3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
12 * not content." --Gandalf
19 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
24 # define SIG_ERR ((Sighandler_t) -1)
27 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
36 /* Put this after #includes because fork and vfork prototypes may
47 # include <sys/file.h>
51 # include <sys/wait.h>
58 static void xstat _((int));
59 long xcount[MAXXCOUNT];
60 long lastxcount[MAXXCOUNT];
61 long xycount[MAXXCOUNT][MAXYCOUNT];
62 long lastxycount[MAXXCOUNT][MAXYCOUNT];
68 /* paranoid version of malloc */
70 /* NOTE: Do not call the next three routines directly. Use the macros
71 * in handy.h, so that we can easily redefine everything to do tracking of
72 * allocated hunks back to the original New to track down any memory leaks.
73 * XXX This advice seems to be widely ignored :-( --AD August 1996.
77 safemalloc(MEM_SIZE size)
82 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
85 #endif /* HAS_64K_LIMIT */
88 croak("panic: malloc");
90 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
91 #if !(defined(I286) || defined(atarist))
92 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
101 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
108 /* paranoid version of realloc */
111 saferealloc(Malloc_t where,MEM_SIZE size)
114 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
115 Malloc_t PerlMem_realloc();
116 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
120 PerlIO_printf(PerlIO_stderr(),
121 "Reallocation too large: %lx\n", size) FLUSH;
124 #endif /* HAS_64K_LIMIT */
126 croak("Null realloc");
129 croak("panic: realloc");
131 ptr = PerlMem_realloc(where,size?size:1); /* realloc(0) is NASTY on our system */
133 #if !(defined(I286) || defined(atarist))
135 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,an++);
136 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
140 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,an++);
141 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
150 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
157 /* safe version of free */
160 safefree(Malloc_t where)
162 #if !(defined(I286) || defined(atarist))
163 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,an++));
165 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,an++));
173 /* safe version of calloc */
176 safecalloc(MEM_SIZE count, MEM_SIZE size)
181 if (size * count > 0xffff) {
182 PerlIO_printf(PerlIO_stderr(),
183 "Allocation too large: %lx\n", size * count) FLUSH;
186 #endif /* HAS_64K_LIMIT */
188 if ((long)size < 0 || (long)count < 0)
189 croak("panic: calloc");
192 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
193 #if !(defined(I286) || defined(atarist))
194 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
196 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
199 memset((void*)ptr, 0, size);
205 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
212 #endif /* !MYMALLOC */
216 struct mem_test_strut {
224 # define ALIGN sizeof(struct mem_test_strut)
226 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
227 # define typeof_chunk(ch) \
228 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
229 # define set_typeof_chunk(ch,t) \
230 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
231 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
234 ? ((size) - 1)/8 + 5 \
238 safexmalloc(I32 x, MEM_SIZE size)
240 register char* where = (char*)safemalloc(size + ALIGN);
243 xycount[x][SIZE_TO_Y(size)]++;
244 set_typeof_chunk(where, x);
245 sizeof_chunk(where) = size;
246 return (Malloc_t)(where + ALIGN);
250 safexrealloc(Malloc_t wh, MEM_SIZE size)
252 char *where = (char*)wh;
255 return safexmalloc(0,size);
258 MEM_SIZE old = sizeof_chunk(where - ALIGN);
259 int t = typeof_chunk(where - ALIGN);
260 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
262 xycount[t][SIZE_TO_Y(old)]--;
263 xycount[t][SIZE_TO_Y(size)]++;
264 xcount[t] += size - old;
265 sizeof_chunk(new) = size;
266 return (Malloc_t)(new + ALIGN);
271 safexfree(Malloc_t wh)
274 char *where = (char*)wh;
280 size = sizeof_chunk(where);
281 x = where[0] + 100 * where[1];
283 xycount[x][SIZE_TO_Y(size)]--;
288 safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
290 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
292 xycount[x][SIZE_TO_Y(size)]++;
293 memset((void*)(where + ALIGN), 0, size * count);
294 set_typeof_chunk(where, x);
295 sizeof_chunk(where) = size;
296 return (Malloc_t)(where + ALIGN);
302 register I32 i, j, total = 0;
303 I32 subtot[MAXYCOUNT];
305 for (j = 0; j < MAXYCOUNT; j++) {
309 PerlIO_printf(PerlIO_stderr(), " Id subtot 4 8 12 16 20 24 28 32 36 40 48 56 64 72 80 80+\n", total);
310 for (i = 0; i < MAXXCOUNT; i++) {
312 for (j = 0; j < MAXYCOUNT; j++) {
313 subtot[j] += xycount[i][j];
316 ? xcount[i] /* Have something */
318 ? xcount[i] != lastxcount[i] /* Changed */
319 : xcount[i] > lastxcount[i])) { /* Growed */
320 PerlIO_printf(PerlIO_stderr(),"%2d %02d %7ld ", i / 100, i % 100,
321 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
322 lastxcount[i] = xcount[i];
323 for (j = 0; j < MAXYCOUNT; j++) {
325 ? xycount[i][j] /* Have something */
327 ? xycount[i][j] != lastxycount[i][j] /* Changed */
328 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
329 PerlIO_printf(PerlIO_stderr(),"%3ld ",
331 ? xycount[i][j] - lastxycount[i][j]
333 lastxycount[i][j] = xycount[i][j];
335 PerlIO_printf(PerlIO_stderr(), " . ", xycount[i][j]);
338 PerlIO_printf(PerlIO_stderr(), "\n");
342 PerlIO_printf(PerlIO_stderr(), "Total %7ld ", total);
343 for (j = 0; j < MAXYCOUNT; j++) {
345 PerlIO_printf(PerlIO_stderr(), "%3ld ", subtot[j]);
347 PerlIO_printf(PerlIO_stderr(), " . ");
350 PerlIO_printf(PerlIO_stderr(), "\n");
354 #endif /* LEAKTEST */
356 /* copy a string up to some (non-backslashed) delimiter, if any */
359 delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
362 for (tolen = 0; from < fromend; from++, tolen++) {
364 if (from[1] == delim)
373 else if (*from == delim)
384 /* return ptr to little string in big string, NULL if not found */
385 /* This routine was donated by Corey Satten. */
388 instr(register char *big, register char *little)
390 register char *s, *x;
401 for (x=big,s=little; *s; /**/ ) {
415 /* same as instr but allow embedded nulls */
418 ninstr(register char *big, register char *bigend, char *little, char *lend)
420 register char *s, *x;
421 register I32 first = *little;
422 register char *littleend = lend;
424 if (!first && little >= littleend)
426 if (bigend - big < littleend - little)
428 bigend -= littleend - little++;
429 while (big <= bigend) {
432 for (x=big,s=little; s < littleend; /**/ ) {
444 /* reverse of the above--find last substring */
447 rninstr(register char *big, char *bigend, char *little, char *lend)
449 register char *bigbeg;
450 register char *s, *x;
451 register I32 first = *little;
452 register char *littleend = lend;
454 if (!first && little >= littleend)
457 big = bigend - (littleend - little++);
458 while (big >= bigbeg) {
461 for (x=big+2,s=little; s < littleend; /**/ ) {
474 * Set up for a new ctype locale.
477 perl_new_ctype(char *newctype)
479 #ifdef USE_LOCALE_CTYPE
483 for (i = 0; i < 256; i++) {
485 fold_locale[i] = toLOWER_LC(i);
486 else if (isLOWER_LC(i))
487 fold_locale[i] = toUPPER_LC(i);
492 #endif /* USE_LOCALE_CTYPE */
496 * Set up for a new collation locale.
499 perl_new_collate(char *newcoll)
501 #ifdef USE_LOCALE_COLLATE
504 if (collation_name) {
506 Safefree(collation_name);
507 collation_name = NULL;
508 collation_standard = TRUE;
515 if (! collation_name || strNE(collation_name, newcoll)) {
517 Safefree(collation_name);
518 collation_name = savepv(newcoll);
519 collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
522 /* 2: at most so many chars ('a', 'b'). */
523 /* 50: surely no system expands a char more. */
524 #define XFRMBUFSIZE (2 * 50)
525 char xbuf[XFRMBUFSIZE];
526 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
527 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
528 SSize_t mult = fb - fa;
530 croak("strxfrm() gets absurd");
531 collxfrm_base = (fa > mult) ? (fa - mult) : 0;
532 collxfrm_mult = mult;
536 #endif /* USE_LOCALE_COLLATE */
540 * Set up for a new numeric locale.
543 perl_new_numeric(char *newnum)
545 #ifdef USE_LOCALE_NUMERIC
549 Safefree(numeric_name);
551 numeric_standard = TRUE;
552 numeric_local = TRUE;
557 if (! numeric_name || strNE(numeric_name, newnum)) {
558 Safefree(numeric_name);
559 numeric_name = savepv(newnum);
560 numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
561 numeric_local = TRUE;
564 #endif /* USE_LOCALE_NUMERIC */
568 perl_set_numeric_standard(void)
570 #ifdef USE_LOCALE_NUMERIC
572 if (! numeric_standard) {
573 setlocale(LC_NUMERIC, "C");
574 numeric_standard = TRUE;
575 numeric_local = FALSE;
578 #endif /* USE_LOCALE_NUMERIC */
582 perl_set_numeric_local(void)
584 #ifdef USE_LOCALE_NUMERIC
586 if (! numeric_local) {
587 setlocale(LC_NUMERIC, numeric_name);
588 numeric_standard = FALSE;
589 numeric_local = TRUE;
592 #endif /* USE_LOCALE_NUMERIC */
597 * Initialize locale awareness.
600 perl_init_i18nl10n(int printwarn)
604 * 1 = set ok or not applicable,
605 * 0 = fallback to C locale,
606 * -1 = fallback to C locale failed
611 #ifdef USE_LOCALE_CTYPE
612 char *curctype = NULL;
613 #endif /* USE_LOCALE_CTYPE */
614 #ifdef USE_LOCALE_COLLATE
615 char *curcoll = NULL;
616 #endif /* USE_LOCALE_COLLATE */
617 #ifdef USE_LOCALE_NUMERIC
619 #endif /* USE_LOCALE_NUMERIC */
620 char *lc_all = PerlEnv_getenv("LC_ALL");
621 char *lang = PerlEnv_getenv("LANG");
622 bool setlocale_failure = FALSE;
624 #ifdef LOCALE_ENVIRON_REQUIRED
627 * Ultrix setlocale(..., "") fails if there are no environment
628 * variables from which to get a locale name.
635 if (setlocale(LC_ALL, ""))
638 setlocale_failure = TRUE;
640 if (!setlocale_failure)
643 #ifdef USE_LOCALE_CTYPE
644 if (! (curctype = setlocale(LC_CTYPE,
645 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
647 setlocale_failure = TRUE;
648 #endif /* USE_LOCALE_CTYPE */
649 #ifdef USE_LOCALE_COLLATE
650 if (! (curcoll = setlocale(LC_COLLATE,
651 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
653 setlocale_failure = TRUE;
654 #endif /* USE_LOCALE_COLLATE */
655 #ifdef USE_LOCALE_NUMERIC
656 if (! (curnum = setlocale(LC_NUMERIC,
657 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
659 setlocale_failure = TRUE;
660 #endif /* USE_LOCALE_NUMERIC */
663 #else /* !LOCALE_ENVIRON_REQUIRED */
667 if (! setlocale(LC_ALL, ""))
668 setlocale_failure = TRUE;
670 #ifdef USE_LOCALE_CTYPE
671 curctype = setlocale(LC_CTYPE, Nullch);
672 #endif /* USE_LOCALE_CTYPE */
673 #ifdef USE_LOCALE_COLLATE
674 curcoll = setlocale(LC_COLLATE, Nullch);
675 #endif /* USE_LOCALE_COLLATE */
676 #ifdef USE_LOCALE_NUMERIC
677 curnum = setlocale(LC_NUMERIC, Nullch);
678 #endif /* USE_LOCALE_NUMERIC */
683 #ifdef USE_LOCALE_CTYPE
684 if (! (curctype = setlocale(LC_CTYPE, "")))
685 setlocale_failure = TRUE;
686 #endif /* USE_LOCALE_CTYPE */
687 #ifdef USE_LOCALE_COLLATE
688 if (! (curcoll = setlocale(LC_COLLATE, "")))
689 setlocale_failure = TRUE;
690 #endif /* USE_LOCALE_COLLATE */
691 #ifdef USE_LOCALE_NUMERIC
692 if (! (curnum = setlocale(LC_NUMERIC, "")))
693 setlocale_failure = TRUE;
694 #endif /* USE_LOCALE_NUMERIC */
698 #endif /* !LOCALE_ENVIRON_REQUIRED */
700 if (setlocale_failure) {
702 bool locwarn = (printwarn > 1 ||
704 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
709 PerlIO_printf(PerlIO_stderr(),
710 "perl: warning: Setting locale failed.\n");
714 PerlIO_printf(PerlIO_stderr(),
715 "perl: warning: Setting locale failed for the categories:\n\t");
716 #ifdef USE_LOCALE_CTYPE
718 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
719 #endif /* USE_LOCALE_CTYPE */
720 #ifdef USE_LOCALE_COLLATE
722 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
723 #endif /* USE_LOCALE_COLLATE */
724 #ifdef USE_LOCALE_NUMERIC
726 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
727 #endif /* USE_LOCALE_NUMERIC */
728 PerlIO_printf(PerlIO_stderr(), "\n");
732 PerlIO_printf(PerlIO_stderr(),
733 "perl: warning: Please check that your locale settings:\n");
735 PerlIO_printf(PerlIO_stderr(),
736 "\tLC_ALL = %c%s%c,\n",
738 lc_all ? lc_all : "unset",
743 for (e = environ; *e; e++) {
744 if (strnEQ(*e, "LC_", 3)
745 && strnNE(*e, "LC_ALL=", 7)
746 && (p = strchr(*e, '=')))
747 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
748 (int)(p - *e), *e, p + 1);
752 PerlIO_printf(PerlIO_stderr(),
755 lang ? lang : "unset",
758 PerlIO_printf(PerlIO_stderr(),
759 " are supported and installed on your system.\n");
764 if (setlocale(LC_ALL, "C")) {
766 PerlIO_printf(PerlIO_stderr(),
767 "perl: warning: Falling back to the standard locale (\"C\").\n");
772 PerlIO_printf(PerlIO_stderr(),
773 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
780 #ifdef USE_LOCALE_CTYPE
781 || !(curctype || setlocale(LC_CTYPE, "C"))
782 #endif /* USE_LOCALE_CTYPE */
783 #ifdef USE_LOCALE_COLLATE
784 || !(curcoll || setlocale(LC_COLLATE, "C"))
785 #endif /* USE_LOCALE_COLLATE */
786 #ifdef USE_LOCALE_NUMERIC
787 || !(curnum || setlocale(LC_NUMERIC, "C"))
788 #endif /* USE_LOCALE_NUMERIC */
792 PerlIO_printf(PerlIO_stderr(),
793 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
797 #endif /* ! LC_ALL */
799 #ifdef USE_LOCALE_CTYPE
800 curctype = setlocale(LC_CTYPE, Nullch);
801 #endif /* USE_LOCALE_CTYPE */
802 #ifdef USE_LOCALE_COLLATE
803 curcoll = setlocale(LC_COLLATE, Nullch);
804 #endif /* USE_LOCALE_COLLATE */
805 #ifdef USE_LOCALE_NUMERIC
806 curnum = setlocale(LC_NUMERIC, Nullch);
807 #endif /* USE_LOCALE_NUMERIC */
810 #ifdef USE_LOCALE_CTYPE
811 perl_new_ctype(curctype);
812 #endif /* USE_LOCALE_CTYPE */
814 #ifdef USE_LOCALE_COLLATE
815 perl_new_collate(curcoll);
816 #endif /* USE_LOCALE_COLLATE */
818 #ifdef USE_LOCALE_NUMERIC
819 perl_new_numeric(curnum);
820 #endif /* USE_LOCALE_NUMERIC */
822 #endif /* USE_LOCALE */
827 /* Backwards compatibility. */
829 perl_init_i18nl14n(int printwarn)
831 return perl_init_i18nl10n(printwarn);
834 #ifdef USE_LOCALE_COLLATE
837 * mem_collxfrm() is a bit like strxfrm() but with two important
838 * differences. First, it handles embedded NULs. Second, it allocates
839 * a bit more memory than needed for the transformed data itself.
840 * The real transformed data begins at offset sizeof(collationix).
841 * Please see sv_collxfrm() to see how this is used.
844 mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
847 STRLEN xalloc, xin, xout;
849 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
850 /* the +1 is for the terminating NUL. */
852 xalloc = sizeof(collation_ix) + collxfrm_base + (collxfrm_mult * len) + 1;
853 New(171, xbuf, xalloc, char);
857 *(U32*)xbuf = collation_ix;
858 xout = sizeof(collation_ix);
859 for (xin = 0; xin < len; ) {
863 xused = strxfrm(xbuf + xout, s + xin, xalloc - xout);
866 if (xused < xalloc - xout)
868 xalloc = (2 * xalloc) + 1;
869 Renew(xbuf, xalloc, char);
874 xin += strlen(s + xin) + 1;
877 /* Embedded NULs are understood but silently skipped
878 * because they make no sense in locale collation. */
882 *xlen = xout - sizeof(collation_ix);
891 #endif /* USE_LOCALE_COLLATE */
894 fbm_compile(SV *sv, U32 flags /* not used yet */)
896 register unsigned char *s;
897 register unsigned char *table;
899 register U32 len = SvCUR(sv);
903 sv_upgrade(sv, SVt_PVBM);
904 if (len > 255 || len == 0) /* TAIL might be on on a zero-length string. */
905 return; /* can't have offsets that big */
907 Sv_Grow(sv,len + 258);
908 table = (unsigned char*)(SvPVX(sv) + len + 1);
910 for (i = 0; i < 256; i++) {
914 while (s >= (unsigned char*)(SvPVX(sv)))
916 if (table[*s] == len)
921 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
924 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
925 for (i = 0; i < len; i++) {
926 if (freq[s[i]] < frequency) {
928 frequency = freq[s[i]];
931 BmRARE(sv) = s[rarest];
932 BmPREVIOUS(sv) = rarest;
933 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
937 fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr)
939 register unsigned char *s;
941 register I32 littlelen;
942 register unsigned char *little;
943 register unsigned char *table;
944 register unsigned char *olds;
945 register unsigned char *oldlittle;
947 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
949 char *l = SvPV(littlestr,len);
951 if (SvTAIL(littlestr)) { /* Can be only 0-len constant
952 substr => we can ignore SvVALID */
955 if ((s = (unsigned char*)ninstr((char*)big, (char*)bigend,
960 if (bigend > big && bigend[-1] == '\n')
961 return (char *)(bigend - 1);
963 return (char *) bigend;
967 return ninstr((char*)big,(char*)bigend, l, l + len);
970 littlelen = SvCUR(littlestr);
971 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
972 if (littlelen > bigend - big)
974 little = (unsigned char*)SvPVX(littlestr);
975 s = bigend - littlelen;
977 && bigend[-1] == '\n'
978 && s[-1] == *little && memEQ((char*)s - 1,(char*)little,littlelen))
979 return (char*)s - 1; /* how sweet it is */
980 else if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
981 return (char*)s; /* how sweet it is */
984 if (littlelen <= 2) {
985 unsigned char c1 = (unsigned char)SvPVX(littlestr)[0];
986 unsigned char c2 = (unsigned char)SvPVX(littlestr)[1];
987 /* This may do extra comparisons if littlelen == 2, but this
988 should be hidden in the noise since we do less indirection. */
992 while (s <= bigend) {
994 && (littlelen == 1 || s[1] == c2)
995 && (!SvTAIL(littlestr)
997 || s[littlelen] == '\n')) /* Automatically multiline */
1005 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
1006 if (--littlelen >= bigend - big)
1008 s = big + littlelen;
1009 oldlittle = little = table - 2;
1013 if (tmp = table[*s]) {
1015 if (bigend - s > tmp) {
1020 if ((s += tmp) < bigend)
1026 tmp = littlelen; /* less expensive than calling strncmp() */
1029 if (*--s == *--little)
1032 s = olds + 1; /* here we pay the price for failure */
1034 if (s < bigend) /* fake up continue to outer loop */
1038 if (SvTAIL(littlestr) /* automatically multiline */
1039 && olds + 1 != bigend
1048 /* start_shift, end_shift are positive quantities which give offsets
1049 of ends of some substring of bigstr.
1050 If `last' we want the last occurence.
1051 old_posp is the way of communication between consequent calls if
1052 the next call needs to find the .
1053 The initial *old_posp should be -1.
1054 Note that we do not take into account SvTAIL, so it may give wrong
1055 positives if _ALL flag is set.
1059 screaminstr(SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1061 register unsigned char *s, *x;
1062 register unsigned char *big;
1064 register I32 previous;
1066 register unsigned char *little;
1067 register I32 stop_pos;
1068 register unsigned char *littleend;
1072 ? (pos = screamfirst[BmRARE(littlestr)]) < 0
1073 : (((pos = *old_posp), pos += screamnext[pos]) == 0))
1075 little = (unsigned char *)(SvPVX(littlestr));
1076 littleend = little + SvCUR(littlestr);
1078 /* The value of pos we can start at: */
1079 previous = BmPREVIOUS(littlestr);
1080 big = (unsigned char *)(SvPVX(bigstr));
1081 /* The value of pos we can stop at: */
1082 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1083 if (previous + start_shift > stop_pos) return Nullch;
1084 while (pos < previous + start_shift) {
1085 if (!(pos += screamnext[pos]))
1090 if (pos >= stop_pos) return Nullch;
1091 if (big[pos-previous] != first)
1093 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1099 if (s == littleend) {
1101 if (!last) return (char *)(big+pos-previous);
1104 } while ( pos += screamnext[pos] );
1105 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1106 #else /* !POINTERRIGOR */
1109 if (pos >= stop_pos) return Nullch;
1110 if (big[pos] != first)
1112 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1118 if (s == littleend) {
1120 if (!last) return (char *)(big+pos);
1123 } while ( pos += screamnext[pos] );
1124 return (last && found) ? (char *)(big+(*old_posp)) : Nullch;
1125 #endif /* POINTERRIGOR */
1129 ibcmp(char *s1, char *s2, register I32 len)
1131 register U8 *a = (U8 *)s1;
1132 register U8 *b = (U8 *)s2;
1134 if (*a != *b && *a != fold[*b])
1142 ibcmp_locale(char *s1, char *s2, register I32 len)
1144 register U8 *a = (U8 *)s1;
1145 register U8 *b = (U8 *)s2;
1147 if (*a != *b && *a != fold_locale[*b])
1154 /* copy a string to a safe spot */
1159 register char *newaddr;
1161 New(902,newaddr,strlen(sv)+1,char);
1162 (void)strcpy(newaddr,sv);
1166 /* same thing but with a known length */
1169 savepvn(char *sv, register I32 len)
1171 register char *newaddr;
1173 New(903,newaddr,len+1,char);
1174 Copy(sv,newaddr,len,char); /* might not be null terminated */
1175 newaddr[len] = '\0'; /* is now */
1179 /* the SV for form() and mess() is not kept in an arena */
1187 /* Create as PVMG now, to avoid any upgrading later */
1188 New(905, sv, 1, SV);
1189 Newz(905, any, 1, XPVMG);
1190 SvFLAGS(sv) = SVt_PVMG;
1191 SvANY(sv) = (void*)any;
1192 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1197 form(const char* pat, ...)
1200 va_start(args, pat);
1202 mess_sv = mess_alloc();
1203 sv_vsetpvfn(mess_sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1205 return SvPVX(mess_sv);
1209 mess(const char *pat, va_list *args)
1212 static char dgd[] = " during global destruction.\n";
1215 mess_sv = mess_alloc();
1217 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1218 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1223 if (curcop->cop_line)
1224 sv_catpvf(sv, " at %_ line %ld",
1225 GvSV(curcop->cop_filegv), (long)curcop->cop_line);
1226 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
1227 bool line_mode = (RsSIMPLE(rs) &&
1228 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
1229 sv_catpvf(sv, ", <%s> %s %ld",
1230 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
1231 line_mode ? "line" : "chunk",
1232 (long)IoLINES(GvIOp(last_in_gv)));
1234 sv_catpv(sv, ".\n");
1241 die(const char* pat, ...)
1246 int was_in_eval = in_eval;
1252 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1253 "%p: die: curstack = %p, mainstack = %p\n",
1254 thr, curstack, mainstack));
1255 #endif /* USE_THREADS */
1257 va_start(args, pat);
1258 message = pat ? mess(pat, &args) : Nullch;
1262 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1263 "%p: die: message = %s\ndiehook = %p\n",
1264 thr, message, diehook));
1265 #endif /* USE_THREADS */
1267 /* sv_2cv might call croak() */
1268 SV *olddiehook = diehook;
1272 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1274 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1280 msg = newSVpv(message, 0);
1288 PUSHSTACK(SI_DIEHOOK);
1292 perl_call_sv((SV*)cv, G_DISCARD);
1298 restartop = die_where(message);
1300 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1301 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1302 thr, restartop, was_in_eval, top_env));
1303 #endif /* USE_THREADS */
1304 if ((!restartop && was_in_eval) || top_env->je_prev)
1310 croak(const char* pat, ...)
1319 va_start(args, pat);
1320 message = mess(pat, &args);
1323 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1324 #endif /* USE_THREADS */
1326 /* sv_2cv might call croak() */
1327 SV *olddiehook = diehook;
1331 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1333 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1338 msg = newSVpv(message, 0);
1342 PUSHSTACK(SI_DIEHOOK);
1346 perl_call_sv((SV*)cv, G_DISCARD);
1352 restartop = die_where(message);
1355 PerlIO_puts(PerlIO_stderr(),message);
1356 (void)PerlIO_flush(PerlIO_stderr());
1361 warn(const char* pat,...)
1369 va_start(args, pat);
1370 message = mess(pat, &args);
1374 /* sv_2cv might call warn() */
1376 SV *oldwarnhook = warnhook;
1380 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1382 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1387 msg = newSVpv(message, 0);
1391 PUSHSTACK(SI_WARNHOOK);
1395 perl_call_sv((SV*)cv, G_DISCARD);
1401 PerlIO_puts(PerlIO_stderr(),message);
1403 DEBUG_L(*message == '!'
1404 ? (xstat(message[1]=='!'
1405 ? (message[2]=='!' ? 2 : 1)
1410 (void)PerlIO_flush(PerlIO_stderr());
1413 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1416 my_setenv(char *nam, char *val)
1418 register I32 i=setenv_getix(nam); /* where does it go? */
1420 if (environ == origenviron) { /* need we copy environment? */
1426 for (max = i; environ[max]; max++) ;
1427 New(901,tmpenv, max+2, char*);
1428 for (j=0; j<max; j++) /* copy environment */
1429 tmpenv[j] = savepv(environ[j]);
1430 tmpenv[max] = Nullch;
1431 environ = tmpenv; /* tell exec where it is now */
1434 Safefree(environ[i]);
1435 while (environ[i]) {
1436 environ[i] = environ[i+1];
1441 if (!environ[i]) { /* does not exist yet */
1442 Renew(environ, i+2, char*); /* just expand it a bit */
1443 environ[i+1] = Nullch; /* make sure it's null terminated */
1446 Safefree(environ[i]);
1447 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1449 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1451 /* MS-DOS requires environment variable names to be in uppercase */
1452 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1453 * some utilities and applications may break because they only look
1454 * for upper case strings. (Fixed strupr() bug here.)]
1456 strcpy(environ[i],nam); strupr(environ[i]);
1457 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1461 #else /* if WIN32 */
1464 my_setenv(char *nam,char *val)
1467 #ifdef USE_WIN32_RTL_ENV
1469 register char *envstr;
1470 STRLEN namlen = strlen(nam);
1472 char *oldstr = environ[setenv_getix(nam)];
1474 /* putenv() has totally broken semantics in both the Borland
1475 * and Microsoft CRTLs. They either store the passed pointer in
1476 * the environment without making a copy, or make a copy and don't
1477 * free it. And on top of that, they dont free() old entries that
1478 * are being replaced/deleted. This means the caller must
1479 * free any old entries somehow, or we end up with a memory
1480 * leak every time my_setenv() is called. One might think
1481 * one could directly manipulate environ[], like the UNIX code
1482 * above, but direct changes to environ are not allowed when
1483 * calling putenv(), since the RTLs maintain an internal
1484 * *copy* of environ[]. Bad, bad, *bad* stink.
1495 vallen = strlen(val);
1496 New(904, envstr, namlen + vallen + 3, char);
1497 (void)sprintf(envstr,"%s=%s",nam,val);
1498 (void)PerlEnv_putenv(envstr);
1502 Safefree(envstr); /* MSVCRT leaks without this */
1505 #else /* !USE_WIN32_RTL_ENV */
1507 /* The sane way to deal with the environment.
1508 * Has these advantages over putenv() & co.:
1509 * * enables us to store a truly empty value in the
1510 * environment (like in UNIX).
1511 * * we don't have to deal with RTL globals, bugs and leaks.
1513 * Why you may want to enable USE_WIN32_RTL_ENV:
1514 * * environ[] and RTL functions will not reflect changes,
1515 * which might be an issue if extensions want to access
1516 * the env. via RTL. This cuts both ways, since RTL will
1517 * not see changes made by extensions that call the Win32
1518 * functions directly, either.
1521 SetEnvironmentVariable(nam,val);
1529 setenv_getix(char *nam)
1531 register I32 i, len = strlen(nam);
1533 for (i = 0; environ[i]; i++) {
1536 strnicmp(environ[i],nam,len) == 0
1538 strnEQ(environ[i],nam,len)
1540 && environ[i][len] == '=')
1541 break; /* strnEQ must come first to avoid */
1542 } /* potential SEGV's */
1548 #ifdef UNLINK_ALL_VERSIONS
1550 unlnk(f) /* unlink all versions of a file */
1555 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1560 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1562 my_bcopy(register char *from,register char *to,register I32 len)
1566 if (from - to >= 0) {
1574 *(--to) = *(--from);
1582 my_memset(loc,ch,len)
1595 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1609 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1611 my_memcmp(s1,s2,len)
1616 register U8 *a = (U8 *)s1;
1617 register U8 *b = (U8 *)s2;
1621 if (tmp = *a++ - *b++)
1626 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1630 #ifdef USE_CHAR_VSPRINTF
1635 vsprintf(dest, pat, args)
1642 fakebuf._ptr = dest;
1643 fakebuf._cnt = 32767;
1647 fakebuf._flag = _IOWRT|_IOSTRG;
1648 _doprnt(pat, args, &fakebuf); /* what a kludge */
1649 (void)putc('\0', &fakebuf);
1650 #ifdef USE_CHAR_VSPRINTF
1653 return 0; /* perl doesn't use return value */
1657 #endif /* HAS_VPRINTF */
1660 #if BYTEORDER != 0x4321
1664 #if (BYTEORDER & 1) == 0
1667 result = ((s & 255) << 8) + ((s >> 8) & 255);
1679 char c[sizeof(long)];
1682 #if BYTEORDER == 0x1234
1683 u.c[0] = (l >> 24) & 255;
1684 u.c[1] = (l >> 16) & 255;
1685 u.c[2] = (l >> 8) & 255;
1689 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1690 croak("Unknown BYTEORDER\n");
1695 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1696 u.c[o & 0xf] = (l >> s) & 255;
1708 char c[sizeof(long)];
1711 #if BYTEORDER == 0x1234
1712 u.c[0] = (l >> 24) & 255;
1713 u.c[1] = (l >> 16) & 255;
1714 u.c[2] = (l >> 8) & 255;
1718 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1719 croak("Unknown BYTEORDER\n");
1726 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1727 l |= (u.c[o & 0xf] & 255) << s;
1734 #endif /* BYTEORDER != 0x4321 */
1738 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1739 * If these functions are defined,
1740 * the BYTEORDER is neither 0x1234 nor 0x4321.
1741 * However, this is not assumed.
1745 #define HTOV(name,type) \
1752 char c[sizeof(type)]; \
1756 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1757 u.c[i] = (n >> s) & 0xFF; \
1762 #define VTOH(name,type) \
1769 char c[sizeof(type)]; \
1775 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1776 n += (u.c[i] & 0xFF) << s; \
1781 #if defined(HAS_HTOVS) && !defined(htovs)
1784 #if defined(HAS_HTOVL) && !defined(htovl)
1787 #if defined(HAS_VTOHS) && !defined(vtohs)
1790 #if defined(HAS_VTOHL) && !defined(vtohl)
1794 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1795 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
1797 my_popen(char *cmd, char *mode)
1800 register I32 This, that;
1803 I32 doexec = strNE(cmd,"-");
1807 return my_syspopen(cmd,mode);
1810 This = (*mode == 'w');
1812 if (doexec && tainting) {
1814 taint_proper("Insecure %s%s", "EXEC");
1816 if (PerlProc_pipe(p) < 0)
1818 while ((pid = (doexec?vfork():fork())) < 0) {
1819 if (errno != EAGAIN) {
1820 PerlLIO_close(p[This]);
1822 croak("Can't fork");
1832 PerlLIO_close(p[THAT]);
1833 if (p[THIS] != (*mode == 'r')) {
1834 PerlLIO_dup2(p[THIS], *mode == 'r');
1835 PerlLIO_close(p[THIS]);
1838 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1844 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
1847 do_exec(cmd); /* may or may not use the shell */
1851 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1852 sv_setiv(GvSV(tmpgv), (IV)getpid());
1854 hv_clear(pidstatus); /* we have no children */
1859 do_execfree(); /* free any memory malloced by child on vfork */
1860 PerlLIO_close(p[that]);
1861 if (p[that] < p[This]) {
1862 PerlLIO_dup2(p[This], p[that]);
1863 PerlLIO_close(p[This]);
1866 sv = *av_fetch(fdpid,p[This],TRUE);
1867 (void)SvUPGRADE(sv,SVt_IV);
1870 return PerlIO_fdopen(p[This], mode);
1873 #if defined(atarist) || defined(DJGPP)
1880 /* Needs work for PerlIO ! */
1881 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1882 return popen(PerlIO_exportFILE(cmd, 0), mode);
1886 #endif /* !DOSISH */
1893 struct stat tmpstatbuf;
1895 PerlIO_printf(PerlIO_stderr(),"%s", s);
1896 for (fd = 0; fd < 32; fd++) {
1897 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
1898 PerlIO_printf(PerlIO_stderr()," %d",fd);
1900 PerlIO_printf(PerlIO_stderr(),"\n");
1902 #endif /* DUMP_FDS */
1910 #if defined(HAS_FCNTL) && defined(F_DUPFD)
1913 PerlLIO_close(newfd);
1914 return fcntl(oldfd, F_DUPFD, newfd);
1916 #define DUP2_MAX_FDS 256
1917 int fdtmp[DUP2_MAX_FDS];
1923 PerlLIO_close(newfd);
1924 /* good enough for low fd's... */
1925 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
1926 if (fdx >= DUP2_MAX_FDS) {
1934 PerlLIO_close(fdtmp[--fdx]);
1941 #ifdef HAS_SIGACTION
1944 rsignal(int signo, Sighandler_t handler)
1946 struct sigaction act, oact;
1948 act.sa_handler = handler;
1949 sigemptyset(&act.sa_mask);
1952 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1954 if (sigaction(signo, &act, &oact) == -1)
1957 return oact.sa_handler;
1961 rsignal_state(int signo)
1963 struct sigaction oact;
1965 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
1968 return oact.sa_handler;
1972 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
1974 struct sigaction act;
1976 act.sa_handler = handler;
1977 sigemptyset(&act.sa_mask);
1980 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1982 return sigaction(signo, &act, save);
1986 rsignal_restore(int signo, Sigsave_t *save)
1988 return sigaction(signo, save, (struct sigaction *)NULL);
1991 #else /* !HAS_SIGACTION */
1994 rsignal(int signo, Sighandler_t handler)
1996 return PerlProc_signal(signo, handler);
1999 static int sig_trapped;
2009 rsignal_state(int signo)
2011 Sighandler_t oldsig;
2014 oldsig = PerlProc_signal(signo, sig_trap);
2015 PerlProc_signal(signo, oldsig);
2017 PerlProc_kill(getpid(), signo);
2022 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2024 *save = PerlProc_signal(signo, handler);
2025 return (*save == SIG_ERR) ? -1 : 0;
2029 rsignal_restore(int signo, Sigsave_t *save)
2031 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2034 #endif /* !HAS_SIGACTION */
2036 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2037 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
2039 my_pclose(PerlIO *ptr)
2041 Sigsave_t hstat, istat, qstat;
2049 int saved_vaxc_errno;
2052 int saved_win32_errno;
2055 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
2056 pid = (int)SvIVX(*svp);
2060 if (pid == -1) { /* Opened by popen. */
2061 return my_syspclose(ptr);
2064 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2065 saved_errno = errno;
2067 saved_vaxc_errno = vaxc$errno;
2070 saved_win32_errno = GetLastError();
2074 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2076 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2077 rsignal_save(SIGINT, SIG_IGN, &istat);
2078 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2080 pid2 = wait4pid(pid, &status, 0);
2081 } while (pid2 == -1 && errno == EINTR);
2082 rsignal_restore(SIGHUP, &hstat);
2083 rsignal_restore(SIGINT, &istat);
2084 rsignal_restore(SIGQUIT, &qstat);
2086 SETERRNO(saved_errno, saved_vaxc_errno);
2089 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2091 #endif /* !DOSISH */
2093 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2095 wait4pid(int pid, int *statusp, int flags)
2099 char spid[TYPE_CHARS(int)];
2104 sprintf(spid, "%d", pid);
2105 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
2106 if (svp && *svp != &sv_undef) {
2107 *statusp = SvIVX(*svp);
2108 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2115 hv_iterinit(pidstatus);
2116 if (entry = hv_iternext(pidstatus)) {
2117 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2118 sv = hv_iterval(pidstatus,entry);
2119 *statusp = SvIVX(sv);
2120 sprintf(spid, "%d", pid);
2121 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2126 # ifdef HAS_WAITPID_RUNTIME
2127 if (!HAS_WAITPID_RUNTIME)
2130 return waitpid(pid,statusp,flags);
2132 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2133 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2135 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2140 croak("Can't do waitpid with flags");
2142 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
2143 pidgone(result,*statusp);
2151 #endif /* !DOSISH || OS2 || WIN32 */
2155 pidgone(int pid, int status)
2158 char spid[TYPE_CHARS(int)];
2160 sprintf(spid, "%d", pid);
2161 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
2162 (void)SvUPGRADE(sv,SVt_IV);
2167 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2170 int /* Cannot prototype with I32
2179 /* Needs work for PerlIO ! */
2180 FILE *f = PerlIO_findFILE(ptr);
2181 I32 result = pclose(f);
2182 PerlIO_releaseFILE(ptr,f);
2188 repeatcpy(register char *to, register char *from, I32 len, register I32 count)
2191 register char *frombase = from;
2199 while (count-- > 0) {
2200 for (todo = len; todo > 0; todo--) {
2207 #ifndef CASTNEGFLOAT
2215 # define BIGDOUBLE 2147483648.0
2217 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2220 return (unsigned long)f;
2222 return (unsigned long)along;
2229 /* Unfortunately, on some systems the cast_uv() function doesn't
2230 work with the system-supplied definition of ULONG_MAX. The
2231 comparison (f >= ULONG_MAX) always comes out true. It must be a
2232 problem with the compiler constant folding.
2234 In any case, this workaround should be fine on any two's complement
2235 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2237 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2240 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2242 -- Kenneth Albanowski <kjahds@kjahds.com>
2246 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2254 return (I32) I32_MAX;
2256 return (I32) I32_MIN;
2276 return (UV) MY_UV_MAX;
2288 char *fa = strrchr(a,'/');
2289 char *fb = strrchr(b,'/');
2290 struct stat tmpstatbuf1;
2291 struct stat tmpstatbuf2;
2292 SV *tmpsv = sv_newmortal();
2305 sv_setpv(tmpsv, ".");
2307 sv_setpvn(tmpsv, a, fa - a);
2308 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2311 sv_setpv(tmpsv, ".");
2313 sv_setpvn(tmpsv, b, fb - b);
2314 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2316 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2317 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2319 #endif /* !HAS_RENAME */
2322 scan_oct(char *start, I32 len, I32 *retlen)
2324 register char *s = start;
2325 register UV retval = 0;
2326 bool overflowed = FALSE;
2328 while (len && *s >= '0' && *s <= '7') {
2329 register UV n = retval << 3;
2330 if (!overflowed && (n >> 3) != retval) {
2331 warn("Integer overflow in octal number");
2334 retval = n | (*s++ - '0');
2337 if (dowarn && len && (*s == '8' || *s == '9'))
2338 warn("Illegal octal digit ignored");
2339 *retlen = s - start;
2344 scan_hex(char *start, I32 len, I32 *retlen)
2346 register char *s = start;
2347 register UV retval = 0;
2348 bool overflowed = FALSE;
2351 while (len-- && *s && (tmp = strchr((char *) hexdigit, *s))) {
2352 register UV n = retval << 4;
2353 if (!overflowed && (n >> 4) != retval) {
2354 warn("Integer overflow in hex number");
2357 retval = n | ((tmp - hexdigit) & 15);
2360 if (dowarn && !tmp) {
2361 warn("Illegal hex digit ignored");
2363 *retlen = s - start;
2368 find_script(char *scriptname, bool dosearch, char **search_ext, I32 flags)
2371 char *xfound = Nullch;
2372 char *xfailed = Nullch;
2376 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2377 # define SEARCH_EXTS ".bat", ".cmd", NULL
2378 # define MAX_EXT_LEN 4
2381 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2382 # define MAX_EXT_LEN 4
2385 # define SEARCH_EXTS ".pl", ".com", NULL
2386 # define MAX_EXT_LEN 4
2388 /* additional extensions to try in each dir if scriptname not found */
2390 char *exts[] = { SEARCH_EXTS };
2391 char **ext = search_ext ? search_ext : exts;
2392 int extidx = 0, i = 0;
2393 char *curext = Nullch;
2395 # define MAX_EXT_LEN 0
2399 * If dosearch is true and if scriptname does not contain path
2400 * delimiters, search the PATH for scriptname.
2402 * If SEARCH_EXTS is also defined, will look for each
2403 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2404 * while searching the PATH.
2406 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2407 * proceeds as follows:
2408 * If DOSISH or VMSISH:
2409 * + look for ./scriptname{,.foo,.bar}
2410 * + search the PATH for scriptname{,.foo,.bar}
2413 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2414 * this will not look in '.' if it's not in the PATH)
2418 # ifdef ALWAYS_DEFTYPES
2419 len = strlen(scriptname);
2420 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2421 int hasdir, idx = 0, deftypes = 1;
2424 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2427 int hasdir, idx = 0, deftypes = 1;
2430 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2432 /* The first time through, just add SEARCH_EXTS to whatever we
2433 * already have, so we can check for default file types. */
2435 (!hasdir && my_trnlnm("DCL$PATH",tokenbuf,idx++)) )
2441 if ((strlen(tokenbuf) + strlen(scriptname)
2442 + MAX_EXT_LEN) >= sizeof tokenbuf)
2443 continue; /* don't search dir with too-long name */
2444 strcat(tokenbuf, scriptname);
2448 if (strEQ(scriptname, "-"))
2450 if (dosearch) { /* Look in '.' first. */
2451 char *cur = scriptname;
2453 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2455 if (strEQ(ext[i++],curext)) {
2456 extidx = -1; /* already has an ext */
2461 DEBUG_p(PerlIO_printf(Perl_debug_log,
2462 "Looking for %s\n",cur));
2463 if (PerlLIO_stat(cur,&statbuf) >= 0) {
2471 if (cur == scriptname) {
2472 len = strlen(scriptname);
2473 if (len+MAX_EXT_LEN+1 >= sizeof(tokenbuf))
2475 cur = strcpy(tokenbuf, scriptname);
2477 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2478 && strcpy(tokenbuf+len, ext[extidx++]));
2483 if (dosearch && !strchr(scriptname, '/')
2485 && !strchr(scriptname, '\\')
2487 && (s = PerlEnv_getenv("PATH"))) {
2490 bufend = s + strlen(s);
2491 while (s < bufend) {
2492 #if defined(atarist) || defined(DOSISH)
2497 && *s != ';'; len++, s++) {
2498 if (len < sizeof tokenbuf)
2501 if (len < sizeof tokenbuf)
2502 tokenbuf[len] = '\0';
2503 #else /* ! (atarist || DOSISH) */
2504 s = delimcpy(tokenbuf, tokenbuf + sizeof tokenbuf, s, bufend,
2507 #endif /* ! (atarist || DOSISH) */
2510 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tokenbuf)
2511 continue; /* don't search dir with too-long name */
2513 #if defined(atarist) || defined(DOSISH)
2514 && tokenbuf[len - 1] != '/'
2515 && tokenbuf[len - 1] != '\\'
2518 tokenbuf[len++] = '/';
2519 if (len == 2 && tokenbuf[0] == '.')
2521 (void)strcpy(tokenbuf + len, scriptname);
2525 len = strlen(tokenbuf);
2526 if (extidx > 0) /* reset after previous loop */
2530 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tokenbuf));
2531 retval = PerlLIO_stat(tokenbuf,&statbuf);
2533 } while ( retval < 0 /* not there */
2534 && extidx>=0 && ext[extidx] /* try an extension? */
2535 && strcpy(tokenbuf+len, ext[extidx++])
2540 if (S_ISREG(statbuf.st_mode)
2541 && cando(S_IRUSR,TRUE,&statbuf)
2543 && cando(S_IXUSR,TRUE,&statbuf)
2547 xfound = tokenbuf; /* bingo! */
2551 xfailed = savepv(tokenbuf);
2554 if (!xfound && !seen_dot && !xfailed && (PerlLIO_stat(scriptname,&statbuf) < 0))
2556 seen_dot = 1; /* Disable message. */
2559 /* croak("Can't %s %s%s%s",
2560 (xfailed ? "execute" : "find"),
2561 (xfailed ? xfailed : scriptname),
2562 (xfailed ? "" : " on PATH"),
2563 (xfailed || seen_dot) ? "" : ", '.' not in PATH"); */
2566 scriptname = xfound;
2574 /* Very simplistic scheduler for now */
2578 thr = thr->i.next_run;
2589 perl_cond_signal(cp)
2593 perl_cond cond = *cp;
2598 /* Insert t in the runnable queue just ahead of us */
2599 t->i.next_run = thr->i.next_run;
2600 thr->i.next_run->i.prev_run = t;
2601 t->i.prev_run = thr;
2602 thr->i.next_run = t;
2603 thr->i.wait_queue = 0;
2604 /* Remove from the wait queue */
2610 perl_cond_broadcast(cp)
2614 perl_cond cond, cond_next;
2616 for (cond = *cp; cond; cond = cond_next) {
2618 /* Insert t in the runnable queue just ahead of us */
2619 t->i.next_run = thr->i.next_run;
2620 thr->i.next_run->i.prev_run = t;
2621 t->i.prev_run = thr;
2622 thr->i.next_run = t;
2623 thr->i.wait_queue = 0;
2624 /* Remove from the wait queue */
2625 cond_next = cond->next;
2637 if (thr->i.next_run == thr)
2638 croak("panic: perl_cond_wait called by last runnable thread");
2640 New(666, cond, 1, struct perl_wait_queue);
2644 thr->i.wait_queue = cond;
2645 /* Remove ourselves from runnable queue */
2646 thr->i.next_run->i.prev_run = thr->i.prev_run;
2647 thr->i.prev_run->i.next_run = thr->i.next_run;
2649 #endif /* FAKE_THREADS */
2651 #ifdef OLD_PTHREADS_API
2652 struct perl_thread *
2657 if (pthread_getspecific(thr_key, &t))
2658 croak("panic: pthread_getspecific");
2659 return (struct perl_thread *) t;
2661 #endif /* OLD_PTHREADS_API */
2664 condpair_magic(SV *sv)
2668 SvUPGRADE(sv, SVt_PVMG);
2669 mg = mg_find(sv, 'm');
2673 New(53, cp, 1, condpair_t);
2674 MUTEX_INIT(&cp->mutex);
2675 COND_INIT(&cp->owner_cond);
2676 COND_INIT(&cp->cond);
2679 mg = mg_find(sv, 'm');
2681 /* someone else beat us to initialising it */
2683 MUTEX_DESTROY(&cp->mutex);
2684 COND_DESTROY(&cp->owner_cond);
2685 COND_DESTROY(&cp->cond);
2689 sv_magic(sv, Nullsv, 'm', 0, 0);
2691 mg->mg_ptr = (char *)cp;
2692 mg->mg_len = sizeof(cp);
2694 DEBUG_L(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2695 "%p: condpair_magic %p\n", thr, sv));)
2702 * Make a new perl thread structure using t as a prototype. Some of the
2703 * fields for the new thread are copied from the prototype thread, t,
2704 * so t should not be running in perl at the time this function is
2705 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2706 * thread calling new_struct_thread) clearly satisfies this constraint.
2708 struct perl_thread *
2709 new_struct_thread(struct perl_thread *t)
2711 struct perl_thread *thr;
2716 sv = newSVpv("", 0);
2717 SvGROW(sv, sizeof(struct perl_thread) + 1);
2718 SvCUR_set(sv, sizeof(struct perl_thread));
2719 thr = (Thread) SvPVX(sv);
2721 memset(thr, 0xab, sizeof(struct perl_thread));
2733 curcop = &compiling;
2734 thr->cvcache = newHV();
2735 thr->threadsv = newAV();
2736 thr->specific = newAV();
2737 thr->errsv = newSVpv("", 0);
2738 thr->errhv = newHV();
2739 thr->flags = THRf_R_JOINABLE;
2740 MUTEX_INIT(&thr->mutex);
2742 curcop = t->Tcurcop; /* XXX As good a guess as any? */
2743 defstash = t->Tdefstash; /* XXX maybe these should */
2744 curstash = t->Tcurstash; /* always be set to main? */
2747 /* top_env needs to be non-zero. It points to an area
2748 in which longjmp() stuff is stored, as C callstack
2749 info there at least is thread specific this has to
2750 be per-thread. Otherwise a 'die' in a thread gives
2751 that thread the C stack of last thread to do an eval {}!
2752 See comments in scope.h
2753 Initialize top entry (as in perl.c for main thread)
2755 start_env.je_prev = NULL;
2756 start_env.je_ret = -1;
2757 start_env.je_mustcatch = TRUE;
2758 top_env = &start_env;
2763 tainted = t->Ttainted;
2764 curpm = t->Tcurpm; /* XXX No PMOP ref count */
2765 nrs = newSVsv(t->Tnrs);
2766 rs = newSVsv(t->Trs);
2767 last_in_gv = (GV*)SvREFCNT_inc(t->Tlast_in_gv);
2768 ofslen = t->Tofslen;
2769 ofs = savepvn(t->Tofs, ofslen);
2770 defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2771 chopset = t->Tchopset;
2772 formtarget = newSVsv(t->Tformtarget);
2773 bodytarget = newSVsv(t->Tbodytarget);
2774 toptarget = newSVsv(t->Ttoptarget);
2776 /* Initialise all per-thread SVs that the template thread used */
2777 svp = AvARRAY(t->threadsv);
2778 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2779 if (*svp && *svp != &sv_undef) {
2780 SV *sv = newSVsv(*svp);
2781 av_store(thr->threadsv, i, sv);
2782 sv_magic(sv, 0, 0, &threadsv_names[i], 1);
2783 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2784 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
2787 thr->threadsvp = AvARRAY(thr->threadsv);
2789 MUTEX_LOCK(&threads_mutex);
2791 thr->tid = ++threadnum;
2792 thr->next = t->next;
2795 thr->next->prev = thr;
2796 MUTEX_UNLOCK(&threads_mutex);
2798 #ifdef HAVE_THREAD_INTERN
2799 init_thread_intern(thr);
2800 #endif /* HAVE_THREAD_INTERN */
2803 #endif /* USE_THREADS */
2807 * This hack is to force load of "huge" support from libm.a
2808 * So it is in perl for (say) POSIX to use.
2809 * Needed for SunOS with Sun's 'acc' for example.
2818 #ifdef PERL_GLOBAL_STRUCT