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 */
1198 form(const char* pat, ...)
1209 va_start(args, pat);
1214 mess_sv = mess_alloc();
1215 sv_vsetpvfn(mess_sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1217 return SvPVX(mess_sv);
1221 mess(const char *pat, va_list *args)
1224 static char dgd[] = " during global destruction.\n";
1227 mess_sv = mess_alloc();
1229 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1230 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1235 if (curcop->cop_line)
1236 sv_catpvf(sv, " at %_ line %ld",
1237 GvSV(curcop->cop_filegv), (long)curcop->cop_line);
1238 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
1239 bool line_mode = (RsSIMPLE(rs) &&
1240 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
1241 sv_catpvf(sv, ", <%s> %s %ld",
1242 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
1243 line_mode ? "line" : "chunk",
1244 (long)IoLINES(GvIOp(last_in_gv)));
1246 sv_catpv(sv, ".\n");
1254 die(const char* pat, ...)
1266 int was_in_eval = in_eval;
1272 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1273 "%p: die: curstack = %p, mainstack = %p\n",
1274 thr, curstack, mainstack));
1275 #endif /* USE_THREADS */
1278 va_start(args, pat);
1282 message = mess(pat, &args);
1286 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1287 "%p: die: message = %s\ndiehook = %p\n",
1288 thr, message, diehook));
1289 #endif /* USE_THREADS */
1291 /* sv_2cv might call croak() */
1292 SV *olddiehook = diehook;
1296 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1298 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1303 msg = newSVpv(message, 0);
1310 perl_call_sv((SV*)cv, G_DISCARD);
1316 restartop = die_where(message);
1318 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1319 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1320 thr, restartop, was_in_eval, top_env));
1321 #endif /* USE_THREADS */
1322 if ((!restartop && was_in_eval) || top_env->je_prev)
1329 croak(const char* pat, ...)
1333 croak(pat, va_alist)
1346 va_start(args, pat);
1350 message = mess(pat, &args);
1353 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1354 #endif /* USE_THREADS */
1356 /* sv_2cv might call croak() */
1357 SV *olddiehook = diehook;
1361 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1363 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1368 msg = newSVpv(message, 0);
1375 perl_call_sv((SV*)cv, G_DISCARD);
1381 restartop = die_where(message);
1384 PerlIO_puts(PerlIO_stderr(),message);
1385 (void)PerlIO_flush(PerlIO_stderr());
1391 warn(const char* pat,...)
1406 va_start(args, pat);
1410 message = mess(pat, &args);
1414 /* sv_2cv might call warn() */
1416 SV *oldwarnhook = warnhook;
1420 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1422 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1427 msg = newSVpv(message, 0);
1434 perl_call_sv((SV*)cv, G_DISCARD);
1440 PerlIO_puts(PerlIO_stderr(),message);
1442 DEBUG_L(*message == '!'
1443 ? (xstat(message[1]=='!'
1444 ? (message[2]=='!' ? 2 : 1)
1449 (void)PerlIO_flush(PerlIO_stderr());
1452 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1455 my_setenv(char *nam, char *val)
1457 register I32 i=setenv_getix(nam); /* where does it go? */
1459 if (environ == origenviron) { /* need we copy environment? */
1465 for (max = i; environ[max]; max++) ;
1466 New(901,tmpenv, max+2, char*);
1467 for (j=0; j<max; j++) /* copy environment */
1468 tmpenv[j] = savepv(environ[j]);
1469 tmpenv[max] = Nullch;
1470 environ = tmpenv; /* tell exec where it is now */
1473 Safefree(environ[i]);
1474 while (environ[i]) {
1475 environ[i] = environ[i+1];
1480 if (!environ[i]) { /* does not exist yet */
1481 Renew(environ, i+2, char*); /* just expand it a bit */
1482 environ[i+1] = Nullch; /* make sure it's null terminated */
1485 Safefree(environ[i]);
1486 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1488 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1490 /* MS-DOS requires environment variable names to be in uppercase */
1491 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1492 * some utilities and applications may break because they only look
1493 * for upper case strings. (Fixed strupr() bug here.)]
1495 strcpy(environ[i],nam); strupr(environ[i]);
1496 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1500 #else /* if WIN32 */
1503 my_setenv(char *nam,char *val)
1506 #ifdef USE_WIN32_RTL_ENV
1508 register char *envstr;
1509 STRLEN namlen = strlen(nam);
1511 char *oldstr = environ[setenv_getix(nam)];
1513 /* putenv() has totally broken semantics in both the Borland
1514 * and Microsoft CRTLs. They either store the passed pointer in
1515 * the environment without making a copy, or make a copy and don't
1516 * free it. And on top of that, they dont free() old entries that
1517 * are being replaced/deleted. This means the caller must
1518 * free any old entries somehow, or we end up with a memory
1519 * leak every time my_setenv() is called. One might think
1520 * one could directly manipulate environ[], like the UNIX code
1521 * above, but direct changes to environ are not allowed when
1522 * calling putenv(), since the RTLs maintain an internal
1523 * *copy* of environ[]. Bad, bad, *bad* stink.
1534 vallen = strlen(val);
1535 New(904, envstr, namlen + vallen + 3, char);
1536 (void)sprintf(envstr,"%s=%s",nam,val);
1537 (void)PerlEnv_putenv(envstr);
1541 Safefree(envstr); /* MSVCRT leaks without this */
1544 #else /* !USE_WIN32_RTL_ENV */
1546 /* The sane way to deal with the environment.
1547 * Has these advantages over putenv() & co.:
1548 * * enables us to store a truly empty value in the
1549 * environment (like in UNIX).
1550 * * we don't have to deal with RTL globals, bugs and leaks.
1552 * Why you may want to enable USE_WIN32_RTL_ENV:
1553 * * environ[] and RTL functions will not reflect changes,
1554 * which might be an issue if extensions want to access
1555 * the env. via RTL. This cuts both ways, since RTL will
1556 * not see changes made by extensions that call the Win32
1557 * functions directly, either.
1560 SetEnvironmentVariable(nam,val);
1568 setenv_getix(char *nam)
1570 register I32 i, len = strlen(nam);
1572 for (i = 0; environ[i]; i++) {
1575 strnicmp(environ[i],nam,len) == 0
1577 strnEQ(environ[i],nam,len)
1579 && environ[i][len] == '=')
1580 break; /* strnEQ must come first to avoid */
1581 } /* potential SEGV's */
1587 #ifdef UNLINK_ALL_VERSIONS
1589 unlnk(f) /* unlink all versions of a file */
1594 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1599 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1601 my_bcopy(register char *from,register char *to,register I32 len)
1605 if (from - to >= 0) {
1613 *(--to) = *(--from);
1621 my_memset(loc,ch,len)
1634 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1648 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1650 my_memcmp(s1,s2,len)
1655 register U8 *a = (U8 *)s1;
1656 register U8 *b = (U8 *)s2;
1660 if (tmp = *a++ - *b++)
1665 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1667 #if defined(I_STDARG) || defined(I_VARARGS)
1670 #ifdef USE_CHAR_VSPRINTF
1675 vsprintf(dest, pat, args)
1682 fakebuf._ptr = dest;
1683 fakebuf._cnt = 32767;
1687 fakebuf._flag = _IOWRT|_IOSTRG;
1688 _doprnt(pat, args, &fakebuf); /* what a kludge */
1689 (void)putc('\0', &fakebuf);
1690 #ifdef USE_CHAR_VSPRINTF
1693 return 0; /* perl doesn't use return value */
1697 #endif /* HAS_VPRINTF */
1698 #endif /* I_VARARGS || I_STDARGS */
1701 #if BYTEORDER != 0x4321
1705 #if (BYTEORDER & 1) == 0
1708 result = ((s & 255) << 8) + ((s >> 8) & 255);
1720 char c[sizeof(long)];
1723 #if BYTEORDER == 0x1234
1724 u.c[0] = (l >> 24) & 255;
1725 u.c[1] = (l >> 16) & 255;
1726 u.c[2] = (l >> 8) & 255;
1730 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1731 croak("Unknown BYTEORDER\n");
1736 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1737 u.c[o & 0xf] = (l >> s) & 255;
1749 char c[sizeof(long)];
1752 #if BYTEORDER == 0x1234
1753 u.c[0] = (l >> 24) & 255;
1754 u.c[1] = (l >> 16) & 255;
1755 u.c[2] = (l >> 8) & 255;
1759 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1760 croak("Unknown BYTEORDER\n");
1767 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1768 l |= (u.c[o & 0xf] & 255) << s;
1775 #endif /* BYTEORDER != 0x4321 */
1779 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1780 * If these functions are defined,
1781 * the BYTEORDER is neither 0x1234 nor 0x4321.
1782 * However, this is not assumed.
1786 #define HTOV(name,type) \
1793 char c[sizeof(type)]; \
1797 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1798 u.c[i] = (n >> s) & 0xFF; \
1803 #define VTOH(name,type) \
1810 char c[sizeof(type)]; \
1816 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1817 n += (u.c[i] & 0xFF) << s; \
1822 #if defined(HAS_HTOVS) && !defined(htovs)
1825 #if defined(HAS_HTOVL) && !defined(htovl)
1828 #if defined(HAS_VTOHS) && !defined(vtohs)
1831 #if defined(HAS_VTOHL) && !defined(vtohl)
1835 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1836 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
1838 my_popen(char *cmd, char *mode)
1841 register I32 This, that;
1844 I32 doexec = strNE(cmd,"-");
1848 return my_syspopen(cmd,mode);
1851 This = (*mode == 'w');
1853 if (doexec && tainting) {
1855 taint_proper("Insecure %s%s", "EXEC");
1857 if (PerlProc_pipe(p) < 0)
1859 while ((pid = (doexec?vfork():fork())) < 0) {
1860 if (errno != EAGAIN) {
1861 PerlLIO_close(p[This]);
1863 croak("Can't fork");
1873 PerlLIO_close(p[THAT]);
1874 if (p[THIS] != (*mode == 'r')) {
1875 PerlLIO_dup2(p[THIS], *mode == 'r');
1876 PerlLIO_close(p[THIS]);
1879 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1885 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
1888 do_exec(cmd); /* may or may not use the shell */
1892 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1893 sv_setiv(GvSV(tmpgv), (IV)getpid());
1895 hv_clear(pidstatus); /* we have no children */
1900 do_execfree(); /* free any memory malloced by child on vfork */
1901 PerlLIO_close(p[that]);
1902 if (p[that] < p[This]) {
1903 PerlLIO_dup2(p[This], p[that]);
1904 PerlLIO_close(p[This]);
1907 sv = *av_fetch(fdpid,p[This],TRUE);
1908 (void)SvUPGRADE(sv,SVt_IV);
1911 return PerlIO_fdopen(p[This], mode);
1914 #if defined(atarist) || defined(DJGPP)
1921 /* Needs work for PerlIO ! */
1922 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1923 return popen(PerlIO_exportFILE(cmd, 0), mode);
1927 #endif /* !DOSISH */
1934 struct stat tmpstatbuf;
1936 PerlIO_printf(PerlIO_stderr(),"%s", s);
1937 for (fd = 0; fd < 32; fd++) {
1938 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
1939 PerlIO_printf(PerlIO_stderr()," %d",fd);
1941 PerlIO_printf(PerlIO_stderr(),"\n");
1951 #if defined(HAS_FCNTL) && defined(F_DUPFD)
1954 PerlLIO_close(newfd);
1955 return fcntl(oldfd, F_DUPFD, newfd);
1957 #define DUP2_MAX_FDS 256
1958 int fdtmp[DUP2_MAX_FDS];
1964 PerlLIO_close(newfd);
1965 /* good enough for low fd's... */
1966 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
1967 if (fdx >= DUP2_MAX_FDS) {
1975 PerlLIO_close(fdtmp[--fdx]);
1982 #ifdef HAS_SIGACTION
1985 rsignal(int signo, Sighandler_t handler)
1987 struct sigaction act, oact;
1989 act.sa_handler = handler;
1990 sigemptyset(&act.sa_mask);
1993 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1995 if (sigaction(signo, &act, &oact) == -1)
1998 return oact.sa_handler;
2002 rsignal_state(int signo)
2004 struct sigaction oact;
2006 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2009 return oact.sa_handler;
2013 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2015 struct sigaction act;
2017 act.sa_handler = handler;
2018 sigemptyset(&act.sa_mask);
2021 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2023 return sigaction(signo, &act, save);
2027 rsignal_restore(int signo, Sigsave_t *save)
2029 return sigaction(signo, save, (struct sigaction *)NULL);
2032 #else /* !HAS_SIGACTION */
2035 rsignal(int signo, Sighandler_t handler)
2037 return PerlProc_signal(signo, handler);
2040 static int sig_trapped;
2050 rsignal_state(int signo)
2052 Sighandler_t oldsig;
2055 oldsig = PerlProc_signal(signo, sig_trap);
2056 PerlProc_signal(signo, oldsig);
2058 PerlProc_kill(getpid(), signo);
2063 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2065 *save = PerlProc_signal(signo, handler);
2066 return (*save == SIG_ERR) ? -1 : 0;
2070 rsignal_restore(int signo, Sigsave_t *save)
2072 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2075 #endif /* !HAS_SIGACTION */
2077 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2078 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
2080 my_pclose(PerlIO *ptr)
2082 Sigsave_t hstat, istat, qstat;
2089 int saved_vaxc_errno;
2092 int saved_win32_errno;
2095 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
2096 pid = (int)SvIVX(*svp);
2100 if (pid == -1) { /* Opened by popen. */
2101 return my_syspclose(ptr);
2104 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2105 saved_errno = errno;
2107 saved_vaxc_errno = vaxc$errno;
2110 saved_win32_errno = GetLastError();
2114 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2116 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2117 rsignal_save(SIGINT, SIG_IGN, &istat);
2118 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2120 pid = wait4pid(pid, &status, 0);
2121 } while (pid == -1 && errno == EINTR);
2122 rsignal_restore(SIGHUP, &hstat);
2123 rsignal_restore(SIGINT, &istat);
2124 rsignal_restore(SIGQUIT, &qstat);
2126 SETERRNO(saved_errno, saved_vaxc_errno);
2129 return(pid < 0 ? pid : status == 0 ? 0 : (errno = 0, status));
2131 #endif /* !DOSISH */
2133 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2135 wait4pid(int pid, int *statusp, int flags)
2139 char spid[TYPE_CHARS(int)];
2144 sprintf(spid, "%d", pid);
2145 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
2146 if (svp && *svp != &sv_undef) {
2147 *statusp = SvIVX(*svp);
2148 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2155 hv_iterinit(pidstatus);
2156 if (entry = hv_iternext(pidstatus)) {
2157 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2158 sv = hv_iterval(pidstatus,entry);
2159 *statusp = SvIVX(sv);
2160 sprintf(spid, "%d", pid);
2161 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2166 # ifdef HAS_WAITPID_RUNTIME
2167 if (!HAS_WAITPID_RUNTIME)
2170 return waitpid(pid,statusp,flags);
2172 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2173 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2175 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2180 croak("Can't do waitpid with flags");
2182 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
2183 pidgone(result,*statusp);
2191 #endif /* !DOSISH || OS2 || WIN32 */
2195 pidgone(int pid, int status)
2198 char spid[TYPE_CHARS(int)];
2200 sprintf(spid, "%d", pid);
2201 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
2202 (void)SvUPGRADE(sv,SVt_IV);
2207 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2210 int /* Cannot prototype with I32
2219 /* Needs work for PerlIO ! */
2220 FILE *f = PerlIO_findFILE(ptr);
2221 I32 result = pclose(f);
2222 PerlIO_releaseFILE(ptr,f);
2228 repeatcpy(register char *to, register char *from, I32 len, register I32 count)
2231 register char *frombase = from;
2239 while (count-- > 0) {
2240 for (todo = len; todo > 0; todo--) {
2247 #ifndef CASTNEGFLOAT
2255 # define BIGDOUBLE 2147483648.0
2257 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2260 return (unsigned long)f;
2262 return (unsigned long)along;
2269 /* Unfortunately, on some systems the cast_uv() function doesn't
2270 work with the system-supplied definition of ULONG_MAX. The
2271 comparison (f >= ULONG_MAX) always comes out true. It must be a
2272 problem with the compiler constant folding.
2274 In any case, this workaround should be fine on any two's complement
2275 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2277 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2280 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2282 -- Kenneth Albanowski <kjahds@kjahds.com>
2286 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2294 return (I32) I32_MAX;
2296 return (I32) I32_MIN;
2316 return (UV) MY_UV_MAX;
2328 char *fa = strrchr(a,'/');
2329 char *fb = strrchr(b,'/');
2330 struct stat tmpstatbuf1;
2331 struct stat tmpstatbuf2;
2332 SV *tmpsv = sv_newmortal();
2345 sv_setpv(tmpsv, ".");
2347 sv_setpvn(tmpsv, a, fa - a);
2348 if (Stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2351 sv_setpv(tmpsv, ".");
2353 sv_setpvn(tmpsv, b, fb - b);
2354 if (Stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2356 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2357 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2359 #endif /* !HAS_RENAME */
2362 scan_oct(char *start, I32 len, I32 *retlen)
2364 register char *s = start;
2365 register UV retval = 0;
2366 bool overflowed = FALSE;
2368 while (len && *s >= '0' && *s <= '7') {
2369 register UV n = retval << 3;
2370 if (!overflowed && (n >> 3) != retval) {
2371 warn("Integer overflow in octal number");
2374 retval = n | (*s++ - '0');
2377 if (dowarn && len && (*s == '8' || *s == '9'))
2378 warn("Illegal octal digit ignored");
2379 *retlen = s - start;
2384 scan_hex(char *start, I32 len, I32 *retlen)
2386 register char *s = start;
2387 register UV retval = 0;
2388 bool overflowed = FALSE;
2391 while (len-- && *s && (tmp = strchr((char *) hexdigit, *s))) {
2392 register UV n = retval << 4;
2393 if (!overflowed && (n >> 4) != retval) {
2394 warn("Integer overflow in hex number");
2397 retval = n | ((tmp - hexdigit) & 15);
2400 *retlen = s - start;
2406 /* Very simplistic scheduler for now */
2410 thr = thr->i.next_run;
2421 perl_cond_signal(cp)
2425 perl_cond cond = *cp;
2430 /* Insert t in the runnable queue just ahead of us */
2431 t->i.next_run = thr->i.next_run;
2432 thr->i.next_run->i.prev_run = t;
2433 t->i.prev_run = thr;
2434 thr->i.next_run = t;
2435 thr->i.wait_queue = 0;
2436 /* Remove from the wait queue */
2442 perl_cond_broadcast(cp)
2446 perl_cond cond, cond_next;
2448 for (cond = *cp; cond; cond = cond_next) {
2450 /* Insert t in the runnable queue just ahead of us */
2451 t->i.next_run = thr->i.next_run;
2452 thr->i.next_run->i.prev_run = t;
2453 t->i.prev_run = thr;
2454 thr->i.next_run = t;
2455 thr->i.wait_queue = 0;
2456 /* Remove from the wait queue */
2457 cond_next = cond->next;
2469 if (thr->i.next_run == thr)
2470 croak("panic: perl_cond_wait called by last runnable thread");
2472 New(666, cond, 1, struct perl_wait_queue);
2476 thr->i.wait_queue = cond;
2477 /* Remove ourselves from runnable queue */
2478 thr->i.next_run->i.prev_run = thr->i.prev_run;
2479 thr->i.prev_run->i.next_run = thr->i.next_run;
2481 #endif /* FAKE_THREADS */
2483 #ifdef OLD_PTHREADS_API
2484 struct perl_thread *
2489 if (pthread_getspecific(thr_key, &t))
2490 croak("panic: pthread_getspecific");
2491 return (struct perl_thread *) t;
2493 #endif /* OLD_PTHREADS_API */
2496 condpair_magic(SV *sv)
2500 SvUPGRADE(sv, SVt_PVMG);
2501 mg = mg_find(sv, 'm');
2505 New(53, cp, 1, condpair_t);
2506 MUTEX_INIT(&cp->mutex);
2507 COND_INIT(&cp->owner_cond);
2508 COND_INIT(&cp->cond);
2511 mg = mg_find(sv, 'm');
2513 /* someone else beat us to initialising it */
2515 MUTEX_DESTROY(&cp->mutex);
2516 COND_DESTROY(&cp->owner_cond);
2517 COND_DESTROY(&cp->cond);
2521 sv_magic(sv, Nullsv, 'm', 0, 0);
2523 mg->mg_ptr = (char *)cp;
2524 mg->mg_len = sizeof(cp);
2526 DEBUG_L(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2527 "%p: condpair_magic %p\n", thr, sv));)
2534 * Make a new perl thread structure using t as a prototype. Some of the
2535 * fields for the new thread are copied from the prototype thread, t,
2536 * so t should not be running in perl at the time this function is
2537 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2538 * thread calling new_struct_thread) clearly satisfies this constraint.
2540 struct perl_thread *
2541 new_struct_thread(struct perl_thread *t)
2543 struct perl_thread *thr;
2548 sv = newSVpv("", 0);
2549 SvGROW(sv, sizeof(struct perl_thread) + 1);
2550 SvCUR_set(sv, sizeof(struct perl_thread));
2551 thr = (Thread) SvPVX(sv);
2553 memset(thr, 0xab, sizeof(struct perl_thread));
2565 curcop = &compiling;
2566 thr->cvcache = newHV();
2567 thr->threadsv = newAV();
2568 thr->specific = newAV();
2569 thr->errsv = newSVpv("", 0);
2570 thr->errhv = newHV();
2571 thr->flags = THRf_R_JOINABLE;
2572 MUTEX_INIT(&thr->mutex);
2574 curcop = t->Tcurcop; /* XXX As good a guess as any? */
2575 defstash = t->Tdefstash; /* XXX maybe these should */
2576 curstash = t->Tcurstash; /* always be set to main? */
2579 /* top_env needs to be non-zero. It points to an area
2580 in which longjmp() stuff is stored, as C callstack
2581 info there at least is thread specific this has to
2582 be per-thread. Otherwise a 'die' in a thread gives
2583 that thread the C stack of last thread to do an eval {}!
2584 See comments in scope.h
2585 Initialize top entry (as in perl.c for main thread)
2587 start_env.je_prev = NULL;
2588 start_env.je_ret = -1;
2589 start_env.je_mustcatch = TRUE;
2590 top_env = &start_env;
2595 tainted = t->Ttainted;
2596 curpm = t->Tcurpm; /* XXX No PMOP ref count */
2597 nrs = newSVsv(t->Tnrs);
2598 rs = newSVsv(t->Trs);
2599 last_in_gv = (GV*)SvREFCNT_inc(t->Tlast_in_gv);
2600 ofslen = t->Tofslen;
2601 ofs = savepvn(t->Tofs, ofslen);
2602 defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2603 chopset = t->Tchopset;
2604 formtarget = newSVsv(t->Tformtarget);
2605 bodytarget = newSVsv(t->Tbodytarget);
2606 toptarget = newSVsv(t->Ttoptarget);
2608 /* Initialise all per-thread SVs that the template thread used */
2609 svp = AvARRAY(t->threadsv);
2610 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2611 if (*svp && *svp != &sv_undef) {
2612 SV *sv = newSVsv(*svp);
2613 av_store(thr->threadsv, i, sv);
2614 sv_magic(sv, 0, 0, &threadsv_names[i], 1);
2615 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2616 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
2619 thr->threadsvp = AvARRAY(thr->threadsv);
2621 MUTEX_LOCK(&threads_mutex);
2623 thr->tid = ++threadnum;
2624 thr->next = t->next;
2627 thr->next->prev = thr;
2628 MUTEX_UNLOCK(&threads_mutex);
2630 #ifdef HAVE_THREAD_INTERN
2631 init_thread_intern(thr);
2632 #endif /* HAVE_THREAD_INTERN */
2635 #endif /* USE_THREADS */
2639 * This hack is to force load of "huge" support from libm.a
2640 * So it is in perl for (say) POSIX to use.
2641 * Needed for SunOS with Sun's 'acc' for example.
2650 #ifdef PERL_GLOBAL_STRUCT