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
18 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
23 # define SIG_ERR ((Sighandler_t) -1)
26 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
35 /* Put this after #includes because fork and vfork prototypes may
46 # include <sys/file.h>
50 # include <sys/wait.h>
57 static void xstat _((int));
58 long xcount[MAXXCOUNT];
59 long lastxcount[MAXXCOUNT];
60 long xycount[MAXXCOUNT][MAXYCOUNT];
61 long lastxycount[MAXXCOUNT][MAXYCOUNT];
67 /* paranoid version of malloc */
69 /* NOTE: Do not call the next three routines directly. Use the macros
70 * in handy.h, so that we can easily redefine everything to do tracking of
71 * allocated hunks back to the original New to track down any memory leaks.
72 * XXX This advice seems to be widely ignored :-( --AD August 1996.
76 safemalloc(MEM_SIZE size)
81 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
87 croak("panic: malloc");
89 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
90 #if !(defined(I286) || defined(atarist))
91 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
93 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
100 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
107 /* paranoid version of realloc */
110 saferealloc(Malloc_t where,MEM_SIZE size)
113 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
114 Malloc_t PerlMem_realloc();
115 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
119 PerlIO_printf(PerlIO_stderr(),
120 "Reallocation too large: %lx\n", size) FLUSH;
123 #endif /* HAS_64K_LIMIT */
130 return safemalloc(size);
133 croak("panic: realloc");
135 ptr = PerlMem_realloc(where,size);
137 #if !(defined(I286) || defined(atarist))
139 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,PL_an++);
140 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
144 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,PL_an++);
145 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
154 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
161 /* safe version of free */
164 safefree(Malloc_t where)
166 #if !(defined(I286) || defined(atarist))
167 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,PL_an++));
169 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,PL_an++));
177 /* safe version of calloc */
180 safecalloc(MEM_SIZE count, MEM_SIZE size)
185 if (size * count > 0xffff) {
186 PerlIO_printf(PerlIO_stderr(),
187 "Allocation too large: %lx\n", size * count) FLUSH;
190 #endif /* HAS_64K_LIMIT */
192 if ((long)size < 0 || (long)count < 0)
193 croak("panic: calloc");
196 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
197 #if !(defined(I286) || defined(atarist))
198 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
200 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
203 memset((void*)ptr, 0, size);
209 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
216 #endif /* !MYMALLOC */
220 struct mem_test_strut {
228 # define ALIGN sizeof(struct mem_test_strut)
230 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
231 # define typeof_chunk(ch) \
232 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
233 # define set_typeof_chunk(ch,t) \
234 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
235 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
238 ? ((size) - 1)/8 + 5 \
242 safexmalloc(I32 x, MEM_SIZE size)
244 register char* where = (char*)safemalloc(size + ALIGN);
247 xycount[x][SIZE_TO_Y(size)]++;
248 set_typeof_chunk(where, x);
249 sizeof_chunk(where) = size;
250 return (Malloc_t)(where + ALIGN);
254 safexrealloc(Malloc_t wh, MEM_SIZE size)
256 char *where = (char*)wh;
259 return safexmalloc(0,size);
262 MEM_SIZE old = sizeof_chunk(where - ALIGN);
263 int t = typeof_chunk(where - ALIGN);
264 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
266 xycount[t][SIZE_TO_Y(old)]--;
267 xycount[t][SIZE_TO_Y(size)]++;
268 xcount[t] += size - old;
269 sizeof_chunk(new) = size;
270 return (Malloc_t)(new + ALIGN);
275 safexfree(Malloc_t wh)
278 char *where = (char*)wh;
284 size = sizeof_chunk(where);
285 x = where[0] + 100 * where[1];
287 xycount[x][SIZE_TO_Y(size)]--;
292 safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
294 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
296 xycount[x][SIZE_TO_Y(size)]++;
297 memset((void*)(where + ALIGN), 0, size * count);
298 set_typeof_chunk(where, x);
299 sizeof_chunk(where) = size;
300 return (Malloc_t)(where + ALIGN);
306 register I32 i, j, total = 0;
307 I32 subtot[MAXYCOUNT];
309 for (j = 0; j < MAXYCOUNT; j++) {
313 PerlIO_printf(PerlIO_stderr(), " Id subtot 4 8 12 16 20 24 28 32 36 40 48 56 64 72 80 80+\n", total);
314 for (i = 0; i < MAXXCOUNT; i++) {
316 for (j = 0; j < MAXYCOUNT; j++) {
317 subtot[j] += xycount[i][j];
320 ? xcount[i] /* Have something */
322 ? xcount[i] != lastxcount[i] /* Changed */
323 : xcount[i] > lastxcount[i])) { /* Growed */
324 PerlIO_printf(PerlIO_stderr(),"%2d %02d %7ld ", i / 100, i % 100,
325 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
326 lastxcount[i] = xcount[i];
327 for (j = 0; j < MAXYCOUNT; j++) {
329 ? xycount[i][j] /* Have something */
331 ? xycount[i][j] != lastxycount[i][j] /* Changed */
332 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
333 PerlIO_printf(PerlIO_stderr(),"%3ld ",
335 ? xycount[i][j] - lastxycount[i][j]
337 lastxycount[i][j] = xycount[i][j];
339 PerlIO_printf(PerlIO_stderr(), " . ", xycount[i][j]);
342 PerlIO_printf(PerlIO_stderr(), "\n");
346 PerlIO_printf(PerlIO_stderr(), "Total %7ld ", total);
347 for (j = 0; j < MAXYCOUNT; j++) {
349 PerlIO_printf(PerlIO_stderr(), "%3ld ", subtot[j]);
351 PerlIO_printf(PerlIO_stderr(), " . ");
354 PerlIO_printf(PerlIO_stderr(), "\n");
358 #endif /* LEAKTEST */
360 /* copy a string up to some (non-backslashed) delimiter, if any */
363 delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
366 for (tolen = 0; from < fromend; from++, tolen++) {
368 if (from[1] == delim)
377 else if (*from == delim)
388 /* return ptr to little string in big string, NULL if not found */
389 /* This routine was donated by Corey Satten. */
392 instr(register char *big, register char *little)
394 register char *s, *x;
405 for (x=big,s=little; *s; /**/ ) {
419 /* same as instr but allow embedded nulls */
422 ninstr(register char *big, register char *bigend, char *little, char *lend)
424 register char *s, *x;
425 register I32 first = *little;
426 register char *littleend = lend;
428 if (!first && little >= littleend)
430 if (bigend - big < littleend - little)
432 bigend -= littleend - little++;
433 while (big <= bigend) {
436 for (x=big,s=little; s < littleend; /**/ ) {
448 /* reverse of the above--find last substring */
451 rninstr(register char *big, char *bigend, char *little, char *lend)
453 register char *bigbeg;
454 register char *s, *x;
455 register I32 first = *little;
456 register char *littleend = lend;
458 if (!first && little >= littleend)
461 big = bigend - (littleend - little++);
462 while (big >= bigbeg) {
465 for (x=big+2,s=little; s < littleend; /**/ ) {
478 * Set up for a new ctype locale.
481 perl_new_ctype(char *newctype)
483 #ifdef USE_LOCALE_CTYPE
487 for (i = 0; i < 256; i++) {
489 PL_fold_locale[i] = toLOWER_LC(i);
490 else if (isLOWER_LC(i))
491 PL_fold_locale[i] = toUPPER_LC(i);
493 PL_fold_locale[i] = i;
496 #endif /* USE_LOCALE_CTYPE */
500 * Set up for a new collation locale.
503 perl_new_collate(char *newcoll)
505 #ifdef USE_LOCALE_COLLATE
508 if (PL_collation_name) {
510 Safefree(PL_collation_name);
511 PL_collation_name = NULL;
512 PL_collation_standard = TRUE;
513 PL_collxfrm_base = 0;
514 PL_collxfrm_mult = 2;
519 if (! PL_collation_name || strNE(PL_collation_name, newcoll)) {
521 Safefree(PL_collation_name);
522 PL_collation_name = savepv(newcoll);
523 PL_collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
526 /* 2: at most so many chars ('a', 'b'). */
527 /* 50: surely no system expands a char more. */
528 #define XFRMBUFSIZE (2 * 50)
529 char xbuf[XFRMBUFSIZE];
530 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
531 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
532 SSize_t mult = fb - fa;
534 croak("strxfrm() gets absurd");
535 PL_collxfrm_base = (fa > mult) ? (fa - mult) : 0;
536 PL_collxfrm_mult = mult;
540 #endif /* USE_LOCALE_COLLATE */
544 * Set up for a new numeric locale.
547 perl_new_numeric(char *newnum)
549 #ifdef USE_LOCALE_NUMERIC
552 if (PL_numeric_name) {
553 Safefree(PL_numeric_name);
554 PL_numeric_name = NULL;
555 PL_numeric_standard = TRUE;
556 PL_numeric_local = TRUE;
561 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
562 Safefree(PL_numeric_name);
563 PL_numeric_name = savepv(newnum);
564 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
565 PL_numeric_local = TRUE;
568 #endif /* USE_LOCALE_NUMERIC */
572 perl_set_numeric_standard(void)
574 #ifdef USE_LOCALE_NUMERIC
576 if (! PL_numeric_standard) {
577 setlocale(LC_NUMERIC, "C");
578 PL_numeric_standard = TRUE;
579 PL_numeric_local = FALSE;
582 #endif /* USE_LOCALE_NUMERIC */
586 perl_set_numeric_local(void)
588 #ifdef USE_LOCALE_NUMERIC
590 if (! PL_numeric_local) {
591 setlocale(LC_NUMERIC, PL_numeric_name);
592 PL_numeric_standard = FALSE;
593 PL_numeric_local = TRUE;
596 #endif /* USE_LOCALE_NUMERIC */
601 * Initialize locale awareness.
604 perl_init_i18nl10n(int printwarn)
608 * 1 = set ok or not applicable,
609 * 0 = fallback to C locale,
610 * -1 = fallback to C locale failed
615 #ifdef USE_LOCALE_CTYPE
616 char *curctype = NULL;
617 #endif /* USE_LOCALE_CTYPE */
618 #ifdef USE_LOCALE_COLLATE
619 char *curcoll = NULL;
620 #endif /* USE_LOCALE_COLLATE */
621 #ifdef USE_LOCALE_NUMERIC
623 #endif /* USE_LOCALE_NUMERIC */
624 char *lc_all = PerlEnv_getenv("LC_ALL");
625 char *lang = PerlEnv_getenv("LANG");
626 bool setlocale_failure = FALSE;
628 #ifdef LOCALE_ENVIRON_REQUIRED
631 * Ultrix setlocale(..., "") fails if there are no environment
632 * variables from which to get a locale name.
639 if (setlocale(LC_ALL, ""))
642 setlocale_failure = TRUE;
644 if (!setlocale_failure)
647 #ifdef USE_LOCALE_CTYPE
648 if (! (curctype = setlocale(LC_CTYPE,
649 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
651 setlocale_failure = TRUE;
652 #endif /* USE_LOCALE_CTYPE */
653 #ifdef USE_LOCALE_COLLATE
654 if (! (curcoll = setlocale(LC_COLLATE,
655 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
657 setlocale_failure = TRUE;
658 #endif /* USE_LOCALE_COLLATE */
659 #ifdef USE_LOCALE_NUMERIC
660 if (! (curnum = setlocale(LC_NUMERIC,
661 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
663 setlocale_failure = TRUE;
664 #endif /* USE_LOCALE_NUMERIC */
667 #else /* !LOCALE_ENVIRON_REQUIRED */
671 if (! setlocale(LC_ALL, ""))
672 setlocale_failure = TRUE;
674 #ifdef USE_LOCALE_CTYPE
675 curctype = setlocale(LC_CTYPE, Nullch);
676 #endif /* USE_LOCALE_CTYPE */
677 #ifdef USE_LOCALE_COLLATE
678 curcoll = setlocale(LC_COLLATE, Nullch);
679 #endif /* USE_LOCALE_COLLATE */
680 #ifdef USE_LOCALE_NUMERIC
681 curnum = setlocale(LC_NUMERIC, Nullch);
682 #endif /* USE_LOCALE_NUMERIC */
687 #ifdef USE_LOCALE_CTYPE
688 if (! (curctype = setlocale(LC_CTYPE, "")))
689 setlocale_failure = TRUE;
690 #endif /* USE_LOCALE_CTYPE */
691 #ifdef USE_LOCALE_COLLATE
692 if (! (curcoll = setlocale(LC_COLLATE, "")))
693 setlocale_failure = TRUE;
694 #endif /* USE_LOCALE_COLLATE */
695 #ifdef USE_LOCALE_NUMERIC
696 if (! (curnum = setlocale(LC_NUMERIC, "")))
697 setlocale_failure = TRUE;
698 #endif /* USE_LOCALE_NUMERIC */
702 #endif /* !LOCALE_ENVIRON_REQUIRED */
704 if (setlocale_failure) {
706 bool locwarn = (printwarn > 1 ||
708 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
713 PerlIO_printf(PerlIO_stderr(),
714 "perl: warning: Setting locale failed.\n");
718 PerlIO_printf(PerlIO_stderr(),
719 "perl: warning: Setting locale failed for the categories:\n\t");
720 #ifdef USE_LOCALE_CTYPE
722 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
723 #endif /* USE_LOCALE_CTYPE */
724 #ifdef USE_LOCALE_COLLATE
726 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
727 #endif /* USE_LOCALE_COLLATE */
728 #ifdef USE_LOCALE_NUMERIC
730 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
731 #endif /* USE_LOCALE_NUMERIC */
732 PerlIO_printf(PerlIO_stderr(), "\n");
736 PerlIO_printf(PerlIO_stderr(),
737 "perl: warning: Please check that your locale settings:\n");
739 PerlIO_printf(PerlIO_stderr(),
740 "\tLC_ALL = %c%s%c,\n",
742 lc_all ? lc_all : "unset",
747 for (e = environ; *e; e++) {
748 if (strnEQ(*e, "LC_", 3)
749 && strnNE(*e, "LC_ALL=", 7)
750 && (p = strchr(*e, '=')))
751 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
752 (int)(p - *e), *e, p + 1);
756 PerlIO_printf(PerlIO_stderr(),
759 lang ? lang : "unset",
762 PerlIO_printf(PerlIO_stderr(),
763 " are supported and installed on your system.\n");
768 if (setlocale(LC_ALL, "C")) {
770 PerlIO_printf(PerlIO_stderr(),
771 "perl: warning: Falling back to the standard locale (\"C\").\n");
776 PerlIO_printf(PerlIO_stderr(),
777 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
784 #ifdef USE_LOCALE_CTYPE
785 || !(curctype || setlocale(LC_CTYPE, "C"))
786 #endif /* USE_LOCALE_CTYPE */
787 #ifdef USE_LOCALE_COLLATE
788 || !(curcoll || setlocale(LC_COLLATE, "C"))
789 #endif /* USE_LOCALE_COLLATE */
790 #ifdef USE_LOCALE_NUMERIC
791 || !(curnum || setlocale(LC_NUMERIC, "C"))
792 #endif /* USE_LOCALE_NUMERIC */
796 PerlIO_printf(PerlIO_stderr(),
797 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
801 #endif /* ! LC_ALL */
803 #ifdef USE_LOCALE_CTYPE
804 curctype = setlocale(LC_CTYPE, Nullch);
805 #endif /* USE_LOCALE_CTYPE */
806 #ifdef USE_LOCALE_COLLATE
807 curcoll = setlocale(LC_COLLATE, Nullch);
808 #endif /* USE_LOCALE_COLLATE */
809 #ifdef USE_LOCALE_NUMERIC
810 curnum = setlocale(LC_NUMERIC, Nullch);
811 #endif /* USE_LOCALE_NUMERIC */
814 #ifdef USE_LOCALE_CTYPE
815 perl_new_ctype(curctype);
816 #endif /* USE_LOCALE_CTYPE */
818 #ifdef USE_LOCALE_COLLATE
819 perl_new_collate(curcoll);
820 #endif /* USE_LOCALE_COLLATE */
822 #ifdef USE_LOCALE_NUMERIC
823 perl_new_numeric(curnum);
824 #endif /* USE_LOCALE_NUMERIC */
826 #endif /* USE_LOCALE */
831 /* Backwards compatibility. */
833 perl_init_i18nl14n(int printwarn)
835 return perl_init_i18nl10n(printwarn);
838 #ifdef USE_LOCALE_COLLATE
841 * mem_collxfrm() is a bit like strxfrm() but with two important
842 * differences. First, it handles embedded NULs. Second, it allocates
843 * a bit more memory than needed for the transformed data itself.
844 * The real transformed data begins at offset sizeof(collationix).
845 * Please see sv_collxfrm() to see how this is used.
848 mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
851 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
853 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
854 /* the +1 is for the terminating NUL. */
856 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
857 New(171, xbuf, xAlloc, char);
861 *(U32*)xbuf = PL_collation_ix;
862 xout = sizeof(PL_collation_ix);
863 for (xin = 0; xin < len; ) {
867 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
870 if (xused < xAlloc - xout)
872 xAlloc = (2 * xAlloc) + 1;
873 Renew(xbuf, xAlloc, char);
878 xin += strlen(s + xin) + 1;
881 /* Embedded NULs are understood but silently skipped
882 * because they make no sense in locale collation. */
886 *xlen = xout - sizeof(PL_collation_ix);
895 #endif /* USE_LOCALE_COLLATE */
898 fbm_compile(SV *sv, U32 flags /* not used yet */)
907 s = (U8*)SvPV_force(sv, len);
908 (void)SvUPGRADE(sv, SVt_PVBM);
909 if (len > 255 || len == 0) /* TAIL might be on on a zero-length string. */
910 return; /* can't have offsets that big */
912 Sv_Grow(sv,len + 258);
913 table = (unsigned char*)(SvPVX(sv) + len + 1);
915 for (i = 0; i < 256; i++) {
919 while (s >= (unsigned char*)(SvPVX(sv)))
921 if (table[*s] == len)
926 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
929 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
930 for (i = 0; i < len; i++) {
931 if (PL_freq[s[i]] < frequency) {
933 frequency = PL_freq[s[i]];
936 BmRARE(sv) = s[rarest];
937 BmPREVIOUS(sv) = rarest;
938 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
942 fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
944 register unsigned char *s;
946 register I32 littlelen;
947 register unsigned char *little;
948 register unsigned char *table;
949 register unsigned char *olds;
950 register unsigned char *oldlittle;
952 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
954 char *l = SvPV(littlestr,len);
956 if (SvTAIL(littlestr)) { /* Can be only 0-len constant
957 substr => we can ignore SvVALID */
960 if ((s = (unsigned char*)ninstr((char*)big, (char*)bigend,
965 if (bigend > big && bigend[-1] == '\n')
966 return (char *)(bigend - 1);
968 return (char *) bigend;
972 return ninstr((char*)big,(char*)bigend, l, l + len);
975 littlelen = SvCUR(littlestr);
976 if (SvTAIL(littlestr) && !PL_multiline) { /* tail anchored? */
977 if (littlelen > bigend - big)
979 little = (unsigned char*)SvPVX(littlestr);
980 s = bigend - littlelen;
982 && bigend[-1] == '\n'
983 && s[-1] == *little && memEQ((char*)s - 1,(char*)little,littlelen))
984 return (char*)s - 1; /* how sweet it is */
985 else if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
986 return (char*)s; /* how sweet it is */
989 if (littlelen <= 2) {
990 unsigned char c1 = (unsigned char)SvPVX(littlestr)[0];
991 unsigned char c2 = (unsigned char)SvPVX(littlestr)[1];
992 /* This may do extra comparisons if littlelen == 2, but this
993 should be hidden in the noise since we do less indirection. */
997 while (s <= bigend) {
999 && (littlelen == 1 || s[1] == c2)
1000 && (!SvTAIL(littlestr)
1002 || s[littlelen] == '\n')) /* Automatically multiline */
1010 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
1011 if (--littlelen >= bigend - big)
1013 s = big + littlelen;
1014 oldlittle = little = table - 2;
1018 if (tmp = table[*s]) {
1020 if (bigend - s > tmp) {
1025 if ((s += tmp) < bigend)
1031 tmp = littlelen; /* less expensive than calling strncmp() */
1034 if (*--s == *--little)
1037 s = olds + 1; /* here we pay the price for failure */
1039 if (s < bigend) /* fake up continue to outer loop */
1043 if (SvTAIL(littlestr) /* automatically multiline */
1044 && olds + 1 != bigend
1053 /* start_shift, end_shift are positive quantities which give offsets
1054 of ends of some substring of bigstr.
1055 If `last' we want the last occurence.
1056 old_posp is the way of communication between consequent calls if
1057 the next call needs to find the .
1058 The initial *old_posp should be -1.
1059 Note that we do not take into account SvTAIL, so it may give wrong
1060 positives if _ALL flag is set.
1064 screaminstr(SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1067 register unsigned char *s, *x;
1068 register unsigned char *big;
1070 register I32 previous;
1072 register unsigned char *little;
1073 register I32 stop_pos;
1074 register unsigned char *littleend;
1078 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1079 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0))
1081 little = (unsigned char *)(SvPVX(littlestr));
1082 littleend = little + SvCUR(littlestr);
1084 /* The value of pos we can start at: */
1085 previous = BmPREVIOUS(littlestr);
1086 big = (unsigned char *)(SvPVX(bigstr));
1087 /* The value of pos we can stop at: */
1088 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1089 if (previous + start_shift > stop_pos) return Nullch;
1090 while (pos < previous + start_shift) {
1091 if (!(pos += PL_screamnext[pos]))
1096 if (pos >= stop_pos) break;
1097 if (big[pos-previous] != first)
1099 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1105 if (s == littleend) {
1107 if (!last) return (char *)(big+pos-previous);
1110 } while ( pos += PL_screamnext[pos] );
1111 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1112 #else /* !POINTERRIGOR */
1115 if (pos >= stop_pos) break;
1116 if (big[pos] != first)
1118 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1124 if (s == littleend) {
1126 if (!last) return (char *)(big+pos);
1129 } while ( pos += PL_screamnext[pos] );
1130 return (last && found) ? (char *)(big+(*old_posp)) : Nullch;
1131 #endif /* POINTERRIGOR */
1135 ibcmp(char *s1, char *s2, register I32 len)
1137 register U8 *a = (U8 *)s1;
1138 register U8 *b = (U8 *)s2;
1140 if (*a != *b && *a != PL_fold[*b])
1148 ibcmp_locale(char *s1, char *s2, register I32 len)
1150 register U8 *a = (U8 *)s1;
1151 register U8 *b = (U8 *)s2;
1153 if (*a != *b && *a != PL_fold_locale[*b])
1160 /* copy a string to a safe spot */
1165 register char *newaddr;
1167 New(902,newaddr,strlen(sv)+1,char);
1168 (void)strcpy(newaddr,sv);
1172 /* same thing but with a known length */
1175 savepvn(char *sv, register I32 len)
1177 register char *newaddr;
1179 New(903,newaddr,len+1,char);
1180 Copy(sv,newaddr,len,char); /* might not be null terminated */
1181 newaddr[len] = '\0'; /* is now */
1185 /* the SV for form() and mess() is not kept in an arena */
1195 return sv_2mortal(newSVpvn("",0));
1200 /* Create as PVMG now, to avoid any upgrading later */
1201 New(905, sv, 1, SV);
1202 Newz(905, any, 1, XPVMG);
1203 SvFLAGS(sv) = SVt_PVMG;
1204 SvANY(sv) = (void*)any;
1205 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1211 form(const char* pat, ...)
1213 SV *sv = mess_alloc();
1215 va_start(args, pat);
1216 sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1222 mess(const char *pat, va_list *args)
1224 SV *sv = mess_alloc();
1225 static char dgd[] = " during global destruction.\n";
1227 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1228 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1233 if (PL_curcop->cop_line)
1234 sv_catpvf(sv, " at %_ line %ld",
1235 GvSV(PL_curcop->cop_filegv), (long)PL_curcop->cop_line);
1236 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1237 bool line_mode = (RsSIMPLE(PL_rs) &&
1238 SvLEN(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1239 sv_catpvf(sv, ", <%s> %s %ld",
1240 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1241 line_mode ? "line" : "chunk",
1242 (long)IoLINES(GvIOp(PL_last_in_gv)));
1244 sv_catpv(sv, ".\n");
1251 die(const char* pat, ...)
1256 int was_in_eval = PL_in_eval;
1261 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1262 "%p: die: curstack = %p, mainstack = %p\n",
1263 thr, PL_curstack, PL_mainstack));
1265 va_start(args, pat);
1266 message = pat ? mess(pat, &args) : Nullch;
1269 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1270 "%p: die: message = %s\ndiehook = %p\n",
1271 thr, message, PL_diehook));
1273 /* sv_2cv might call croak() */
1274 SV *olddiehook = PL_diehook;
1276 SAVESPTR(PL_diehook);
1277 PL_diehook = Nullsv;
1278 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1280 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1286 msg = newSVpv(message, 0);
1294 PUSHSTACKi(PERLSI_DIEHOOK);
1298 perl_call_sv((SV*)cv, G_DISCARD);
1304 PL_restartop = die_where(message);
1305 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1306 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1307 thr, PL_restartop, was_in_eval, PL_top_env));
1308 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1310 return PL_restartop;
1314 croak(const char* pat, ...)
1323 va_start(args, pat);
1324 message = mess(pat, &args);
1326 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1328 /* sv_2cv might call croak() */
1329 SV *olddiehook = PL_diehook;
1331 SAVESPTR(PL_diehook);
1332 PL_diehook = Nullsv;
1333 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1335 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1340 msg = newSVpv(message, 0);
1344 PUSHSTACKi(PERLSI_DIEHOOK);
1348 perl_call_sv((SV*)cv, G_DISCARD);
1354 PL_restartop = die_where(message);
1357 PerlIO_puts(PerlIO_stderr(),message);
1358 (void)PerlIO_flush(PerlIO_stderr());
1363 warn(const char* pat,...)
1371 va_start(args, pat);
1372 message = mess(pat, &args);
1376 /* sv_2cv might call warn() */
1378 SV *oldwarnhook = PL_warnhook;
1380 SAVESPTR(PL_warnhook);
1381 PL_warnhook = Nullsv;
1382 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1384 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1389 msg = newSVpv(message, 0);
1393 PUSHSTACKi(PERLSI_WARNHOOK);
1397 perl_call_sv((SV*)cv, G_DISCARD);
1403 PerlIO_puts(PerlIO_stderr(),message);
1405 DEBUG_L(*message == '!'
1406 ? (xstat(message[1]=='!'
1407 ? (message[2]=='!' ? 2 : 1)
1412 (void)PerlIO_flush(PerlIO_stderr());
1416 warner(U32 err, const char* pat,...)
1425 va_start(args, pat);
1426 message = mess(pat, &args);
1431 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1432 #endif /* USE_THREADS */
1434 /* sv_2cv might call croak() */
1435 SV *olddiehook = PL_diehook;
1437 SAVESPTR(PL_diehook);
1438 PL_diehook = Nullsv;
1439 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1441 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1446 msg = newSVpv(message, 0);
1453 perl_call_sv((SV*)cv, G_DISCARD);
1459 PL_restartop = die_where(message);
1462 PerlIO_puts(PerlIO_stderr(),message);
1463 (void)PerlIO_flush(PerlIO_stderr());
1469 /* sv_2cv might call warn() */
1471 SV *oldwarnhook = PL_warnhook;
1473 SAVESPTR(PL_warnhook);
1474 PL_warnhook = Nullsv;
1475 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1477 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1482 msg = newSVpv(message, 0);
1489 perl_call_sv((SV*)cv, G_DISCARD);
1495 PerlIO_puts(PerlIO_stderr(),message);
1499 (void)PerlIO_flush(PerlIO_stderr());
1503 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1506 my_setenv(char *nam, char *val)
1508 register I32 i=setenv_getix(nam); /* where does it go? */
1510 if (environ == PL_origenviron) { /* need we copy environment? */
1516 for (max = i; environ[max]; max++) ;
1517 New(901,tmpenv, max+2, char*);
1518 for (j=0; j<max; j++) /* copy environment */
1519 tmpenv[j] = savepv(environ[j]);
1520 tmpenv[max] = Nullch;
1521 environ = tmpenv; /* tell exec where it is now */
1524 Safefree(environ[i]);
1525 while (environ[i]) {
1526 environ[i] = environ[i+1];
1531 if (!environ[i]) { /* does not exist yet */
1532 Renew(environ, i+2, char*); /* just expand it a bit */
1533 environ[i+1] = Nullch; /* make sure it's null terminated */
1536 Safefree(environ[i]);
1537 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1539 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1541 /* MS-DOS requires environment variable names to be in uppercase */
1542 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1543 * some utilities and applications may break because they only look
1544 * for upper case strings. (Fixed strupr() bug here.)]
1546 strcpy(environ[i],nam); strupr(environ[i]);
1547 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1551 #else /* if WIN32 */
1554 my_setenv(char *nam,char *val)
1557 #ifdef USE_WIN32_RTL_ENV
1559 register char *envstr;
1560 STRLEN namlen = strlen(nam);
1562 char *oldstr = environ[setenv_getix(nam)];
1564 /* putenv() has totally broken semantics in both the Borland
1565 * and Microsoft CRTLs. They either store the passed pointer in
1566 * the environment without making a copy, or make a copy and don't
1567 * free it. And on top of that, they dont free() old entries that
1568 * are being replaced/deleted. This means the caller must
1569 * free any old entries somehow, or we end up with a memory
1570 * leak every time my_setenv() is called. One might think
1571 * one could directly manipulate environ[], like the UNIX code
1572 * above, but direct changes to environ are not allowed when
1573 * calling putenv(), since the RTLs maintain an internal
1574 * *copy* of environ[]. Bad, bad, *bad* stink.
1585 vallen = strlen(val);
1586 New(904, envstr, namlen + vallen + 3, char);
1587 (void)sprintf(envstr,"%s=%s",nam,val);
1588 (void)PerlEnv_putenv(envstr);
1592 Safefree(envstr); /* MSVCRT leaks without this */
1595 #else /* !USE_WIN32_RTL_ENV */
1597 /* The sane way to deal with the environment.
1598 * Has these advantages over putenv() & co.:
1599 * * enables us to store a truly empty value in the
1600 * environment (like in UNIX).
1601 * * we don't have to deal with RTL globals, bugs and leaks.
1603 * Why you may want to enable USE_WIN32_RTL_ENV:
1604 * * environ[] and RTL functions will not reflect changes,
1605 * which might be an issue if extensions want to access
1606 * the env. via RTL. This cuts both ways, since RTL will
1607 * not see changes made by extensions that call the Win32
1608 * functions directly, either.
1611 SetEnvironmentVariable(nam,val);
1619 setenv_getix(char *nam)
1621 register I32 i, len = strlen(nam);
1623 for (i = 0; environ[i]; i++) {
1626 strnicmp(environ[i],nam,len) == 0
1628 strnEQ(environ[i],nam,len)
1630 && environ[i][len] == '=')
1631 break; /* strnEQ must come first to avoid */
1632 } /* potential SEGV's */
1638 #ifdef UNLINK_ALL_VERSIONS
1640 unlnk(f) /* unlink all versions of a file */
1645 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1650 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1652 my_bcopy(register char *from,register char *to,register I32 len)
1656 if (from - to >= 0) {
1664 *(--to) = *(--from);
1672 my_memset(loc,ch,len)
1685 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1699 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1701 my_memcmp(s1,s2,len)
1706 register U8 *a = (U8 *)s1;
1707 register U8 *b = (U8 *)s2;
1711 if (tmp = *a++ - *b++)
1716 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1720 #ifdef USE_CHAR_VSPRINTF
1725 vsprintf(dest, pat, args)
1732 fakebuf._ptr = dest;
1733 fakebuf._cnt = 32767;
1737 fakebuf._flag = _IOWRT|_IOSTRG;
1738 _doprnt(pat, args, &fakebuf); /* what a kludge */
1739 (void)putc('\0', &fakebuf);
1740 #ifdef USE_CHAR_VSPRINTF
1743 return 0; /* perl doesn't use return value */
1747 #endif /* HAS_VPRINTF */
1750 #if BYTEORDER != 0x4321
1754 #if (BYTEORDER & 1) == 0
1757 result = ((s & 255) << 8) + ((s >> 8) & 255);
1769 char c[sizeof(long)];
1772 #if BYTEORDER == 0x1234
1773 u.c[0] = (l >> 24) & 255;
1774 u.c[1] = (l >> 16) & 255;
1775 u.c[2] = (l >> 8) & 255;
1779 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1780 croak("Unknown BYTEORDER\n");
1785 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1786 u.c[o & 0xf] = (l >> s) & 255;
1798 char c[sizeof(long)];
1801 #if BYTEORDER == 0x1234
1802 u.c[0] = (l >> 24) & 255;
1803 u.c[1] = (l >> 16) & 255;
1804 u.c[2] = (l >> 8) & 255;
1808 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1809 croak("Unknown BYTEORDER\n");
1816 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1817 l |= (u.c[o & 0xf] & 255) << s;
1824 #endif /* BYTEORDER != 0x4321 */
1828 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1829 * If these functions are defined,
1830 * the BYTEORDER is neither 0x1234 nor 0x4321.
1831 * However, this is not assumed.
1835 #define HTOV(name,type) \
1842 char c[sizeof(type)]; \
1846 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1847 u.c[i] = (n >> s) & 0xFF; \
1852 #define VTOH(name,type) \
1859 char c[sizeof(type)]; \
1865 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1866 n += (u.c[i] & 0xFF) << s; \
1871 #if defined(HAS_HTOVS) && !defined(htovs)
1874 #if defined(HAS_HTOVL) && !defined(htovl)
1877 #if defined(HAS_VTOHS) && !defined(vtohs)
1880 #if defined(HAS_VTOHL) && !defined(vtohl)
1884 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1885 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM)
1887 my_popen(char *cmd, char *mode)
1890 register I32 This, that;
1893 I32 doexec = strNE(cmd,"-");
1897 return my_syspopen(cmd,mode);
1900 This = (*mode == 'w');
1902 if (doexec && PL_tainting) {
1904 taint_proper("Insecure %s%s", "EXEC");
1906 if (PerlProc_pipe(p) < 0)
1908 while ((pid = (doexec?vfork():fork())) < 0) {
1909 if (errno != EAGAIN) {
1910 PerlLIO_close(p[This]);
1912 croak("Can't fork");
1924 PerlLIO_close(p[THAT]);
1925 if (p[THIS] != (*mode == 'r')) {
1926 PerlLIO_dup2(p[THIS], *mode == 'r');
1927 PerlLIO_close(p[THIS]);
1930 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1936 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
1939 do_exec(cmd); /* may or may not use the shell */
1943 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1944 sv_setiv(GvSV(tmpgv), (IV)getpid());
1946 hv_clear(PL_pidstatus); /* we have no children */
1951 do_execfree(); /* free any memory malloced by child on vfork */
1952 PerlLIO_close(p[that]);
1953 if (p[that] < p[This]) {
1954 PerlLIO_dup2(p[This], p[that]);
1955 PerlLIO_close(p[This]);
1958 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1959 (void)SvUPGRADE(sv,SVt_IV);
1961 PL_forkprocess = pid;
1962 return PerlIO_fdopen(p[This], mode);
1965 #if defined(atarist) || defined(DJGPP)
1972 /* Needs work for PerlIO ! */
1973 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1974 return popen(PerlIO_exportFILE(cmd, 0), mode);
1978 #endif /* !DOSISH */
1985 struct stat tmpstatbuf;
1987 PerlIO_printf(PerlIO_stderr(),"%s", s);
1988 for (fd = 0; fd < 32; fd++) {
1989 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
1990 PerlIO_printf(PerlIO_stderr()," %d",fd);
1992 PerlIO_printf(PerlIO_stderr(),"\n");
1994 #endif /* DUMP_FDS */
2002 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2005 PerlLIO_close(newfd);
2006 return fcntl(oldfd, F_DUPFD, newfd);
2008 #define DUP2_MAX_FDS 256
2009 int fdtmp[DUP2_MAX_FDS];
2015 PerlLIO_close(newfd);
2016 /* good enough for low fd's... */
2017 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2018 if (fdx >= DUP2_MAX_FDS) {
2026 PerlLIO_close(fdtmp[--fdx]);
2033 #ifdef HAS_SIGACTION
2036 rsignal(int signo, Sighandler_t handler)
2038 struct sigaction act, oact;
2040 act.sa_handler = handler;
2041 sigemptyset(&act.sa_mask);
2044 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2047 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2048 act.sa_flags |= SA_NOCLDWAIT;
2050 if (sigaction(signo, &act, &oact) == -1)
2053 return oact.sa_handler;
2057 rsignal_state(int signo)
2059 struct sigaction oact;
2061 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2064 return oact.sa_handler;
2068 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2070 struct sigaction act;
2072 act.sa_handler = handler;
2073 sigemptyset(&act.sa_mask);
2076 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2079 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2080 act.sa_flags |= SA_NOCLDWAIT;
2082 return sigaction(signo, &act, save);
2086 rsignal_restore(int signo, Sigsave_t *save)
2088 return sigaction(signo, save, (struct sigaction *)NULL);
2091 #else /* !HAS_SIGACTION */
2094 rsignal(int signo, Sighandler_t handler)
2096 return PerlProc_signal(signo, handler);
2099 static int sig_trapped;
2109 rsignal_state(int signo)
2111 Sighandler_t oldsig;
2114 oldsig = PerlProc_signal(signo, sig_trap);
2115 PerlProc_signal(signo, oldsig);
2117 PerlProc_kill(getpid(), signo);
2122 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2124 *save = PerlProc_signal(signo, handler);
2125 return (*save == SIG_ERR) ? -1 : 0;
2129 rsignal_restore(int signo, Sigsave_t *save)
2131 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2134 #endif /* !HAS_SIGACTION */
2136 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2137 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM)
2139 my_pclose(PerlIO *ptr)
2141 Sigsave_t hstat, istat, qstat;
2149 int saved_vaxc_errno;
2152 int saved_win32_errno;
2155 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2156 pid = (int)SvIVX(*svp);
2158 *svp = &PL_sv_undef;
2160 if (pid == -1) { /* Opened by popen. */
2161 return my_syspclose(ptr);
2164 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2165 saved_errno = errno;
2167 saved_vaxc_errno = vaxc$errno;
2170 saved_win32_errno = GetLastError();
2174 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2176 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2177 rsignal_save(SIGINT, SIG_IGN, &istat);
2178 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2180 pid2 = wait4pid(pid, &status, 0);
2181 } while (pid2 == -1 && errno == EINTR);
2182 rsignal_restore(SIGHUP, &hstat);
2183 rsignal_restore(SIGINT, &istat);
2184 rsignal_restore(SIGQUIT, &qstat);
2186 SETERRNO(saved_errno, saved_vaxc_errno);
2189 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2191 #endif /* !DOSISH */
2193 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2195 wait4pid(int pid, int *statusp, int flags)
2199 char spid[TYPE_CHARS(int)];
2204 sprintf(spid, "%d", pid);
2205 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2206 if (svp && *svp != &PL_sv_undef) {
2207 *statusp = SvIVX(*svp);
2208 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2215 hv_iterinit(PL_pidstatus);
2216 if (entry = hv_iternext(PL_pidstatus)) {
2217 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2218 sv = hv_iterval(PL_pidstatus,entry);
2219 *statusp = SvIVX(sv);
2220 sprintf(spid, "%d", pid);
2221 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2226 # ifdef HAS_WAITPID_RUNTIME
2227 if (!HAS_WAITPID_RUNTIME)
2230 return PerlProc_waitpid(pid,statusp,flags);
2232 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2233 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2235 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2240 croak("Can't do waitpid with flags");
2242 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2243 pidgone(result,*statusp);
2251 #endif /* !DOSISH || OS2 || WIN32 */
2255 pidgone(int pid, int status)
2258 char spid[TYPE_CHARS(int)];
2260 sprintf(spid, "%d", pid);
2261 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2262 (void)SvUPGRADE(sv,SVt_IV);
2267 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2270 int /* Cannot prototype with I32
2279 /* Needs work for PerlIO ! */
2280 FILE *f = PerlIO_findFILE(ptr);
2281 I32 result = pclose(f);
2282 PerlIO_releaseFILE(ptr,f);
2288 repeatcpy(register char *to, register char *from, I32 len, register I32 count)
2291 register char *frombase = from;
2299 while (count-- > 0) {
2300 for (todo = len; todo > 0; todo--) {
2308 cast_ulong(double f)
2313 # define BIGDOUBLE 2147483648.0
2315 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2318 return (unsigned long)f;
2320 return (unsigned long)along;
2324 /* Unfortunately, on some systems the cast_uv() function doesn't
2325 work with the system-supplied definition of ULONG_MAX. The
2326 comparison (f >= ULONG_MAX) always comes out true. It must be a
2327 problem with the compiler constant folding.
2329 In any case, this workaround should be fine on any two's complement
2330 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2332 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2335 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2337 -- Kenneth Albanowski <kjahds@kjahds.com>
2341 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2348 return (I32) I32_MAX;
2350 return (I32) I32_MIN;
2368 return (UV) MY_UV_MAX;
2374 same_dirent(char *a, char *b)
2376 char *fa = strrchr(a,'/');
2377 char *fb = strrchr(b,'/');
2378 struct stat tmpstatbuf1;
2379 struct stat tmpstatbuf2;
2380 SV *tmpsv = sv_newmortal();
2393 sv_setpv(tmpsv, ".");
2395 sv_setpvn(tmpsv, a, fa - a);
2396 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2399 sv_setpv(tmpsv, ".");
2401 sv_setpvn(tmpsv, b, fb - b);
2402 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2404 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2405 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2407 #endif /* !HAS_RENAME */
2410 scan_oct(char *start, I32 len, I32 *retlen)
2412 register char *s = start;
2413 register UV retval = 0;
2414 bool overflowed = FALSE;
2416 while (len && *s >= '0' && *s <= '7') {
2417 register UV n = retval << 3;
2418 if (!overflowed && (n >> 3) != retval) {
2419 warn("Integer overflow in octal number");
2422 retval = n | (*s++ - '0');
2425 if (len && (*s == '8' || *s == '9')) {
2427 if (ckWARN(WARN_OCTAL))
2428 warner(WARN_OCTAL, "Illegal octal digit ignored");
2430 *retlen = s - start;
2435 scan_hex(char *start, I32 len, I32 *retlen)
2437 register char *s = start;
2438 register UV retval = 0;
2439 bool overflowed = FALSE;
2443 while (len-- && *s) {
2444 tmp = strchr((char *) PL_hexdigit, *s++);
2446 if (*(s-1) == '_' || (*(s-1) == 'x' && retval == 0))
2451 if (ckWARN(WARN_UNSAFE))
2452 warner(WARN_UNSAFE,"Illegal hex digit ignored");
2457 if (!overflowed && (n >> 4) != retval) {
2458 warn("Integer overflow in hex number");
2461 retval = n | ((tmp - PL_hexdigit) & 15);
2463 *retlen = s - start;
2468 find_script(char *scriptname, bool dosearch, char **search_ext, I32 flags)
2471 char *xfound = Nullch;
2472 char *xfailed = Nullch;
2477 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2478 # define SEARCH_EXTS ".bat", ".cmd", NULL
2479 # define MAX_EXT_LEN 4
2482 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2483 # define MAX_EXT_LEN 4
2486 # define SEARCH_EXTS ".pl", ".com", NULL
2487 # define MAX_EXT_LEN 4
2489 /* additional extensions to try in each dir if scriptname not found */
2491 char *exts[] = { SEARCH_EXTS };
2492 char **ext = search_ext ? search_ext : exts;
2493 int extidx = 0, i = 0;
2494 char *curext = Nullch;
2496 # define MAX_EXT_LEN 0
2500 * If dosearch is true and if scriptname does not contain path
2501 * delimiters, search the PATH for scriptname.
2503 * If SEARCH_EXTS is also defined, will look for each
2504 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2505 * while searching the PATH.
2507 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2508 * proceeds as follows:
2509 * If DOSISH or VMSISH:
2510 * + look for ./scriptname{,.foo,.bar}
2511 * + search the PATH for scriptname{,.foo,.bar}
2514 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2515 * this will not look in '.' if it's not in the PATH)
2520 # ifdef ALWAYS_DEFTYPES
2521 len = strlen(scriptname);
2522 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2523 int hasdir, idx = 0, deftypes = 1;
2526 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2529 int hasdir, idx = 0, deftypes = 1;
2532 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2534 /* The first time through, just add SEARCH_EXTS to whatever we
2535 * already have, so we can check for default file types. */
2537 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2543 if ((strlen(tmpbuf) + strlen(scriptname)
2544 + MAX_EXT_LEN) >= sizeof tmpbuf)
2545 continue; /* don't search dir with too-long name */
2546 strcat(tmpbuf, scriptname);
2550 if (strEQ(scriptname, "-"))
2552 if (dosearch) { /* Look in '.' first. */
2553 char *cur = scriptname;
2555 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2557 if (strEQ(ext[i++],curext)) {
2558 extidx = -1; /* already has an ext */
2563 DEBUG_p(PerlIO_printf(Perl_debug_log,
2564 "Looking for %s\n",cur));
2565 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2566 && !S_ISDIR(PL_statbuf.st_mode)) {
2574 if (cur == scriptname) {
2575 len = strlen(scriptname);
2576 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2578 cur = strcpy(tmpbuf, scriptname);
2580 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2581 && strcpy(tmpbuf+len, ext[extidx++]));
2586 if (dosearch && !strchr(scriptname, '/')
2588 && !strchr(scriptname, '\\')
2590 && (s = PerlEnv_getenv("PATH"))) {
2593 PL_bufend = s + strlen(s);
2594 while (s < PL_bufend) {
2595 #if defined(atarist) || defined(DOSISH)
2600 && *s != ';'; len++, s++) {
2601 if (len < sizeof tmpbuf)
2604 if (len < sizeof tmpbuf)
2606 #else /* ! (atarist || DOSISH) */
2607 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2610 #endif /* ! (atarist || DOSISH) */
2613 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2614 continue; /* don't search dir with too-long name */
2616 #if defined(atarist) || defined(DOSISH)
2617 && tmpbuf[len - 1] != '/'
2618 && tmpbuf[len - 1] != '\\'
2621 tmpbuf[len++] = '/';
2622 if (len == 2 && tmpbuf[0] == '.')
2624 (void)strcpy(tmpbuf + len, scriptname);
2628 len = strlen(tmpbuf);
2629 if (extidx > 0) /* reset after previous loop */
2633 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2634 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2635 if (S_ISDIR(PL_statbuf.st_mode)) {
2639 } while ( retval < 0 /* not there */
2640 && extidx>=0 && ext[extidx] /* try an extension? */
2641 && strcpy(tmpbuf+len, ext[extidx++])
2646 if (S_ISREG(PL_statbuf.st_mode)
2647 && cando(S_IRUSR,TRUE,&PL_statbuf)
2649 && cando(S_IXUSR,TRUE,&PL_statbuf)
2653 xfound = tmpbuf; /* bingo! */
2657 xfailed = savepv(tmpbuf);
2660 if (!xfound && !seen_dot && !xfailed &&
2661 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2662 || S_ISDIR(PL_statbuf.st_mode)))
2664 seen_dot = 1; /* Disable message. */
2666 if (flags & 1) { /* do or die? */
2667 croak("Can't %s %s%s%s",
2668 (xfailed ? "execute" : "find"),
2669 (xfailed ? xfailed : scriptname),
2670 (xfailed ? "" : " on PATH"),
2671 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2673 scriptname = Nullch;
2677 scriptname = xfound;
2679 return (scriptname ? savepv(scriptname) : Nullch);
2685 /* Very simplistic scheduler for now */
2689 thr = thr->i.next_run;
2693 perl_cond_init(perl_cond *cp)
2699 perl_cond_signal(perl_cond *cp)
2702 perl_cond cond = *cp;
2707 /* Insert t in the runnable queue just ahead of us */
2708 t->i.next_run = thr->i.next_run;
2709 thr->i.next_run->i.prev_run = t;
2710 t->i.prev_run = thr;
2711 thr->i.next_run = t;
2712 thr->i.wait_queue = 0;
2713 /* Remove from the wait queue */
2719 perl_cond_broadcast(perl_cond *cp)
2722 perl_cond cond, cond_next;
2724 for (cond = *cp; cond; cond = cond_next) {
2726 /* Insert t in the runnable queue just ahead of us */
2727 t->i.next_run = thr->i.next_run;
2728 thr->i.next_run->i.prev_run = t;
2729 t->i.prev_run = thr;
2730 thr->i.next_run = t;
2731 thr->i.wait_queue = 0;
2732 /* Remove from the wait queue */
2733 cond_next = cond->next;
2740 perl_cond_wait(perl_cond *cp)
2744 if (thr->i.next_run == thr)
2745 croak("panic: perl_cond_wait called by last runnable thread");
2747 New(666, cond, 1, struct perl_wait_queue);
2751 thr->i.wait_queue = cond;
2752 /* Remove ourselves from runnable queue */
2753 thr->i.next_run->i.prev_run = thr->i.prev_run;
2754 thr->i.prev_run->i.next_run = thr->i.next_run;
2756 #endif /* FAKE_THREADS */
2758 #ifdef PTHREAD_GETSPECIFIC_INT
2759 struct perl_thread *
2764 if (pthread_getspecific(PL_thr_key, &t))
2765 croak("panic: pthread_getspecific");
2766 return (struct perl_thread *) t;
2771 condpair_magic(SV *sv)
2775 SvUPGRADE(sv, SVt_PVMG);
2776 mg = mg_find(sv, 'm');
2780 New(53, cp, 1, condpair_t);
2781 MUTEX_INIT(&cp->mutex);
2782 COND_INIT(&cp->owner_cond);
2783 COND_INIT(&cp->cond);
2786 mg = mg_find(sv, 'm');
2788 /* someone else beat us to initialising it */
2790 MUTEX_DESTROY(&cp->mutex);
2791 COND_DESTROY(&cp->owner_cond);
2792 COND_DESTROY(&cp->cond);
2796 sv_magic(sv, Nullsv, 'm', 0, 0);
2798 mg->mg_ptr = (char *)cp;
2799 mg->mg_len = sizeof(cp);
2801 DEBUG_S(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2802 "%p: condpair_magic %p\n", thr, sv));)
2809 * Make a new perl thread structure using t as a prototype. Some of the
2810 * fields for the new thread are copied from the prototype thread, t,
2811 * so t should not be running in perl at the time this function is
2812 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2813 * thread calling new_struct_thread) clearly satisfies this constraint.
2815 struct perl_thread *
2816 new_struct_thread(struct perl_thread *t)
2818 struct perl_thread *thr;
2823 sv = newSVpv("", 0);
2824 SvGROW(sv, sizeof(struct perl_thread) + 1);
2825 SvCUR_set(sv, sizeof(struct perl_thread));
2826 thr = (Thread) SvPVX(sv);
2828 memset(thr, 0xab, sizeof(struct perl_thread));
2835 Zero(&PL_hv_fetch_ent_mh, 1, HE);
2837 Zero(thr, 1, struct perl_thread);
2843 PL_curcop = &PL_compiling;
2844 thr->cvcache = newHV();
2845 thr->threadsv = newAV();
2846 thr->specific = newAV();
2847 thr->errsv = newSVpv("", 0);
2848 thr->errhv = newHV();
2849 thr->flags = THRf_R_JOINABLE;
2850 MUTEX_INIT(&thr->mutex);
2852 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
2853 PL_defstash = t->Tdefstash; /* XXX maybe these should */
2854 PL_curstash = t->Tcurstash; /* always be set to main? */
2857 /* top_env needs to be non-zero. It points to an area
2858 in which longjmp() stuff is stored, as C callstack
2859 info there at least is thread specific this has to
2860 be per-thread. Otherwise a 'die' in a thread gives
2861 that thread the C stack of last thread to do an eval {}!
2862 See comments in scope.h
2863 Initialize top entry (as in perl.c for main thread)
2865 PL_start_env.je_prev = NULL;
2866 PL_start_env.je_ret = -1;
2867 PL_start_env.je_mustcatch = TRUE;
2868 PL_top_env = &PL_start_env;
2873 PL_tainted = t->Ttainted;
2874 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
2875 PL_nrs = newSVsv(t->Tnrs);
2876 PL_rs = SvREFCNT_inc(PL_nrs);
2877 PL_last_in_gv = Nullgv;
2878 PL_ofslen = t->Tofslen;
2879 PL_ofs = savepvn(t->Tofs, PL_ofslen);
2880 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2881 PL_chopset = t->Tchopset;
2882 PL_formtarget = newSVsv(t->Tformtarget);
2883 PL_bodytarget = newSVsv(t->Tbodytarget);
2884 PL_toptarget = newSVsv(t->Ttoptarget);
2886 PL_statname = NEWSV(66,0);
2888 PL_regcompp = FUNC_NAME_TO_PTR(pregcomp);
2889 PL_regexecp = FUNC_NAME_TO_PTR(regexec_flags);
2891 PL_reginterp_cnt = 0;
2892 PL_lastscream = Nullsv;
2895 PL_reg_start_tmp = 0;
2896 PL_reg_start_tmpl = 0;
2898 /* Initialise all per-thread SVs that the template thread used */
2899 svp = AvARRAY(t->threadsv);
2900 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2901 if (*svp && *svp != &PL_sv_undef) {
2902 SV *sv = newSVsv(*svp);
2903 av_store(thr->threadsv, i, sv);
2904 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
2905 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2906 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
2909 thr->threadsvp = AvARRAY(thr->threadsv);
2911 MUTEX_LOCK(&PL_threads_mutex);
2913 thr->tid = ++PL_threadnum;
2914 thr->next = t->next;
2917 thr->next->prev = thr;
2918 MUTEX_UNLOCK(&PL_threads_mutex);
2920 #ifdef HAVE_THREAD_INTERN
2921 init_thread_intern(thr);
2922 #endif /* HAVE_THREAD_INTERN */
2925 #endif /* USE_THREADS */
2929 * This hack is to force load of "huge" support from libm.a
2930 * So it is in perl for (say) POSIX to use.
2931 * Needed for SunOS with Sun's 'acc' for example.
2940 #ifdef PERL_GLOBAL_STRUCT
2963 return (char*)PL_no_modify;
2973 get_specialsv_list(void)
2975 return PL_specialsv_list;
2980 get_vtbl(int vtbl_id)
2982 MGVTBL* result = Null(MGVTBL*);
2986 result = &PL_vtbl_sv;
2989 result = &PL_vtbl_env;
2991 case want_vtbl_envelem:
2992 result = &PL_vtbl_envelem;
2995 result = &PL_vtbl_sig;
2997 case want_vtbl_sigelem:
2998 result = &PL_vtbl_sigelem;
3000 case want_vtbl_pack:
3001 result = &PL_vtbl_pack;
3003 case want_vtbl_packelem:
3004 result = &PL_vtbl_packelem;
3006 case want_vtbl_dbline:
3007 result = &PL_vtbl_dbline;
3010 result = &PL_vtbl_isa;
3012 case want_vtbl_isaelem:
3013 result = &PL_vtbl_isaelem;
3015 case want_vtbl_arylen:
3016 result = &PL_vtbl_arylen;
3018 case want_vtbl_glob:
3019 result = &PL_vtbl_glob;
3021 case want_vtbl_mglob:
3022 result = &PL_vtbl_mglob;
3024 case want_vtbl_nkeys:
3025 result = &PL_vtbl_nkeys;
3027 case want_vtbl_taint:
3028 result = &PL_vtbl_taint;
3030 case want_vtbl_substr:
3031 result = &PL_vtbl_substr;
3034 result = &PL_vtbl_vec;
3037 result = &PL_vtbl_pos;
3040 result = &PL_vtbl_bm;
3043 result = &PL_vtbl_fm;
3045 case want_vtbl_uvar:
3046 result = &PL_vtbl_uvar;
3049 case want_vtbl_mutex:
3050 result = &PL_vtbl_mutex;
3053 case want_vtbl_defelem:
3054 result = &PL_vtbl_defelem;
3056 case want_vtbl_regexp:
3057 result = &PL_vtbl_regexp;
3059 case want_vtbl_regdata:
3060 result = &PL_vtbl_regdata;
3062 case want_vtbl_regdatum:
3063 result = &PL_vtbl_regdatum;
3065 case want_vtbl_collxfrm:
3066 result = &PL_vtbl_collxfrm;
3068 case want_vtbl_amagic:
3069 result = &PL_vtbl_amagic;
3071 case want_vtbl_amagicelem:
3072 result = &PL_vtbl_amagicelem;