3 * Copyright (c) 1991-1999, 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
16 #define PERL_IN_UTIL_C
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>
62 long xcount[MAXXCOUNT];
63 long lastxcount[MAXXCOUNT];
64 long xycount[MAXXCOUNT][MAXYCOUNT];
65 long lastxycount[MAXXCOUNT][MAXYCOUNT];
69 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
70 # define FD_CLOEXEC 1 /* NeXT needs this */
73 /* paranoid version of system's malloc() */
75 /* NOTE: Do not call the next three routines directly. Use the macros
76 * in handy.h, so that we can easily redefine everything to do tracking of
77 * allocated hunks back to the original New to track down any memory leaks.
78 * XXX This advice seems to be widely ignored :-( --AD August 1996.
82 Perl_safesysmalloc(MEM_SIZE size)
88 PerlIO_printf(PerlIO_stderr(),
89 "Allocation too large: %lx\n", size) FLUSH;
92 #endif /* HAS_64K_LIMIT */
95 Perl_croak_nocontext("panic: malloc");
97 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
98 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
104 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
111 /* paranoid version of system's realloc() */
114 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
118 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
119 Malloc_t PerlMem_realloc();
120 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
124 PerlIO_printf(PerlIO_stderr(),
125 "Reallocation too large: %lx\n", size) FLUSH;
128 #endif /* HAS_64K_LIMIT */
135 return safesysmalloc(size);
138 Perl_croak_nocontext("panic: realloc");
140 ptr = PerlMem_realloc(where,size);
142 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,PL_an++));
143 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size));
150 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
157 /* safe version of system's free() */
160 Perl_safesysfree(Malloc_t where)
163 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,PL_an++));
170 /* safe version of system's calloc() */
173 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
179 if (size * count > 0xffff) {
180 PerlIO_printf(PerlIO_stderr(),
181 "Allocation too large: %lx\n", size * count) FLUSH;
184 #endif /* HAS_64K_LIMIT */
186 if ((long)size < 0 || (long)count < 0)
187 Perl_croak_nocontext("panic: calloc");
190 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
191 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
193 memset((void*)ptr, 0, size);
199 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
208 struct mem_test_strut {
216 # define ALIGN sizeof(struct mem_test_strut)
218 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
219 # define typeof_chunk(ch) \
220 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
221 # define set_typeof_chunk(ch,t) \
222 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
223 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
226 ? ((size) - 1)/8 + 5 \
230 Perl_safexmalloc(I32 x, MEM_SIZE size)
232 register char* where = (char*)safemalloc(size + ALIGN);
235 xycount[x][SIZE_TO_Y(size)]++;
236 set_typeof_chunk(where, x);
237 sizeof_chunk(where) = size;
238 return (Malloc_t)(where + ALIGN);
242 Perl_safexrealloc(Malloc_t wh, MEM_SIZE size)
244 char *where = (char*)wh;
247 return safexmalloc(0,size);
250 MEM_SIZE old = sizeof_chunk(where - ALIGN);
251 int t = typeof_chunk(where - ALIGN);
252 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
254 xycount[t][SIZE_TO_Y(old)]--;
255 xycount[t][SIZE_TO_Y(size)]++;
256 xcount[t] += size - old;
257 sizeof_chunk(new) = size;
258 return (Malloc_t)(new + ALIGN);
263 Perl_safexfree(Malloc_t wh)
266 char *where = (char*)wh;
272 size = sizeof_chunk(where);
273 x = where[0] + 100 * where[1];
275 xycount[x][SIZE_TO_Y(size)]--;
280 Perl_safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
282 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
284 xycount[x][SIZE_TO_Y(size)]++;
285 memset((void*)(where + ALIGN), 0, size * count);
286 set_typeof_chunk(where, x);
287 sizeof_chunk(where) = size;
288 return (Malloc_t)(where + ALIGN);
292 S_xstat(pTHX_ int flag)
294 register I32 i, j, total = 0;
295 I32 subtot[MAXYCOUNT];
297 for (j = 0; j < MAXYCOUNT; j++) {
301 PerlIO_printf(PerlIO_stderr(), " Id subtot 4 8 12 16 20 24 28 32 36 40 48 56 64 72 80 80+\n", total);
302 for (i = 0; i < MAXXCOUNT; i++) {
304 for (j = 0; j < MAXYCOUNT; j++) {
305 subtot[j] += xycount[i][j];
308 ? xcount[i] /* Have something */
310 ? xcount[i] != lastxcount[i] /* Changed */
311 : xcount[i] > lastxcount[i])) { /* Growed */
312 PerlIO_printf(PerlIO_stderr(),"%2d %02d %7ld ", i / 100, i % 100,
313 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
314 lastxcount[i] = xcount[i];
315 for (j = 0; j < MAXYCOUNT; j++) {
317 ? xycount[i][j] /* Have something */
319 ? xycount[i][j] != lastxycount[i][j] /* Changed */
320 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
321 PerlIO_printf(PerlIO_stderr(),"%3ld ",
323 ? xycount[i][j] - lastxycount[i][j]
325 lastxycount[i][j] = xycount[i][j];
327 PerlIO_printf(PerlIO_stderr(), " . ", xycount[i][j]);
330 PerlIO_printf(PerlIO_stderr(), "\n");
334 PerlIO_printf(PerlIO_stderr(), "Total %7ld ", total);
335 for (j = 0; j < MAXYCOUNT; j++) {
337 PerlIO_printf(PerlIO_stderr(), "%3ld ", subtot[j]);
339 PerlIO_printf(PerlIO_stderr(), " . ");
342 PerlIO_printf(PerlIO_stderr(), "\n");
346 #endif /* LEAKTEST */
348 /* copy a string up to some (non-backslashed) delimiter, if any */
351 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
354 for (tolen = 0; from < fromend; from++, tolen++) {
356 if (from[1] == delim)
365 else if (*from == delim)
376 /* return ptr to little string in big string, NULL if not found */
377 /* This routine was donated by Corey Satten. */
380 Perl_instr(pTHX_ register const char *big, register const char *little)
382 register const char *s, *x;
393 for (x=big,s=little; *s; /**/ ) {
402 return (char*)(big-1);
407 /* same as instr but allow embedded nulls */
410 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
412 register const char *s, *x;
413 register I32 first = *little;
414 register const char *littleend = lend;
416 if (!first && little >= littleend)
418 if (bigend - big < littleend - little)
420 bigend -= littleend - little++;
421 while (big <= bigend) {
424 for (x=big,s=little; s < littleend; /**/ ) {
431 return (char*)(big-1);
436 /* reverse of the above--find last substring */
439 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
441 register const char *bigbeg;
442 register const char *s, *x;
443 register I32 first = *little;
444 register const char *littleend = lend;
446 if (!first && little >= littleend)
447 return (char*)bigend;
449 big = bigend - (littleend - little++);
450 while (big >= bigbeg) {
453 for (x=big+2,s=little; s < littleend; /**/ ) {
460 return (char*)(big+1);
466 * Set up for a new ctype locale.
469 Perl_new_ctype(pTHX_ const char *newctype)
471 #ifdef USE_LOCALE_CTYPE
475 for (i = 0; i < 256; i++) {
477 PL_fold_locale[i] = toLOWER_LC(i);
478 else if (isLOWER_LC(i))
479 PL_fold_locale[i] = toUPPER_LC(i);
481 PL_fold_locale[i] = i;
484 #endif /* USE_LOCALE_CTYPE */
488 * Set up for a new collation locale.
491 Perl_new_collate(pTHX_ const char *newcoll)
493 #ifdef USE_LOCALE_COLLATE
496 if (PL_collation_name) {
498 Safefree(PL_collation_name);
499 PL_collation_name = NULL;
500 PL_collation_standard = TRUE;
501 PL_collxfrm_base = 0;
502 PL_collxfrm_mult = 2;
507 if (! PL_collation_name || strNE(PL_collation_name, newcoll)) {
509 Safefree(PL_collation_name);
510 PL_collation_name = savepv(newcoll);
511 PL_collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
514 /* 2: at most so many chars ('a', 'b'). */
515 /* 50: surely no system expands a char more. */
516 #define XFRMBUFSIZE (2 * 50)
517 char xbuf[XFRMBUFSIZE];
518 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
519 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
520 SSize_t mult = fb - fa;
522 Perl_croak(aTHX_ "strxfrm() gets absurd");
523 PL_collxfrm_base = (fa > mult) ? (fa - mult) : 0;
524 PL_collxfrm_mult = mult;
528 #endif /* USE_LOCALE_COLLATE */
532 Perl_set_numeric_radix(pTHX)
534 #ifdef USE_LOCALE_NUMERIC
535 # ifdef HAS_LOCALECONV
539 if (lc && lc->decimal_point)
540 /* We assume that decimal separator aka the radix
541 * character is always a single character. If it
542 * ever is a string, this needs to be rethunk. */
543 PL_numeric_radix = *lc->decimal_point;
545 PL_numeric_radix = 0;
546 # endif /* HAS_LOCALECONV */
548 PL_numeric_radix = 0;
549 #endif /* USE_LOCALE_NUMERIC */
553 * Set up for a new numeric locale.
556 Perl_new_numeric(pTHX_ const char *newnum)
558 #ifdef USE_LOCALE_NUMERIC
561 if (PL_numeric_name) {
562 Safefree(PL_numeric_name);
563 PL_numeric_name = NULL;
564 PL_numeric_standard = TRUE;
565 PL_numeric_local = TRUE;
570 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
571 Safefree(PL_numeric_name);
572 PL_numeric_name = savepv(newnum);
573 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
574 PL_numeric_local = TRUE;
578 #endif /* USE_LOCALE_NUMERIC */
582 Perl_set_numeric_standard(pTHX)
584 #ifdef USE_LOCALE_NUMERIC
586 if (! PL_numeric_standard) {
587 setlocale(LC_NUMERIC, "C");
588 PL_numeric_standard = TRUE;
589 PL_numeric_local = FALSE;
592 #endif /* USE_LOCALE_NUMERIC */
596 Perl_set_numeric_local(pTHX)
598 #ifdef USE_LOCALE_NUMERIC
600 if (! PL_numeric_local) {
601 setlocale(LC_NUMERIC, PL_numeric_name);
602 PL_numeric_standard = FALSE;
603 PL_numeric_local = TRUE;
607 #endif /* USE_LOCALE_NUMERIC */
611 * Initialize locale awareness.
614 Perl_init_i18nl10n(pTHX_ int printwarn)
618 * 1 = set ok or not applicable,
619 * 0 = fallback to C locale,
620 * -1 = fallback to C locale failed
625 #ifdef USE_LOCALE_CTYPE
626 char *curctype = NULL;
627 #endif /* USE_LOCALE_CTYPE */
628 #ifdef USE_LOCALE_COLLATE
629 char *curcoll = NULL;
630 #endif /* USE_LOCALE_COLLATE */
631 #ifdef USE_LOCALE_NUMERIC
633 #endif /* USE_LOCALE_NUMERIC */
635 char *language = PerlEnv_getenv("LANGUAGE");
637 char *lc_all = PerlEnv_getenv("LC_ALL");
638 char *lang = PerlEnv_getenv("LANG");
639 bool setlocale_failure = FALSE;
641 #ifdef LOCALE_ENVIRON_REQUIRED
644 * Ultrix setlocale(..., "") fails if there are no environment
645 * variables from which to get a locale name.
652 if (setlocale(LC_ALL, ""))
655 setlocale_failure = TRUE;
657 if (!setlocale_failure) {
658 #ifdef USE_LOCALE_CTYPE
661 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
663 setlocale_failure = TRUE;
664 #endif /* USE_LOCALE_CTYPE */
665 #ifdef USE_LOCALE_COLLATE
667 setlocale(LC_COLLATE,
668 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
670 setlocale_failure = TRUE;
671 #endif /* USE_LOCALE_COLLATE */
672 #ifdef USE_LOCALE_NUMERIC
674 setlocale(LC_NUMERIC,
675 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
677 setlocale_failure = TRUE;
678 #endif /* USE_LOCALE_NUMERIC */
683 #endif /* !LOCALE_ENVIRON_REQUIRED */
686 if (! setlocale(LC_ALL, ""))
687 setlocale_failure = TRUE;
690 if (!setlocale_failure) {
691 #ifdef USE_LOCALE_CTYPE
692 if (! (curctype = setlocale(LC_CTYPE, "")))
693 setlocale_failure = TRUE;
694 #endif /* USE_LOCALE_CTYPE */
695 #ifdef USE_LOCALE_COLLATE
696 if (! (curcoll = setlocale(LC_COLLATE, "")))
697 setlocale_failure = TRUE;
698 #endif /* USE_LOCALE_COLLATE */
699 #ifdef USE_LOCALE_NUMERIC
700 if (! (curnum = setlocale(LC_NUMERIC, "")))
701 setlocale_failure = TRUE;
702 #endif /* USE_LOCALE_NUMERIC */
705 if (setlocale_failure) {
707 bool locwarn = (printwarn > 1 ||
709 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
714 PerlIO_printf(PerlIO_stderr(),
715 "perl: warning: Setting locale failed.\n");
719 PerlIO_printf(PerlIO_stderr(),
720 "perl: warning: Setting locale failed for the categories:\n\t");
721 #ifdef USE_LOCALE_CTYPE
723 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
724 #endif /* USE_LOCALE_CTYPE */
725 #ifdef USE_LOCALE_COLLATE
727 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
728 #endif /* USE_LOCALE_COLLATE */
729 #ifdef USE_LOCALE_NUMERIC
731 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
732 #endif /* USE_LOCALE_NUMERIC */
733 PerlIO_printf(PerlIO_stderr(), "\n");
737 PerlIO_printf(PerlIO_stderr(),
738 "perl: warning: Please check that your locale settings:\n");
741 PerlIO_printf(PerlIO_stderr(),
742 "\tLANGUAGE = %c%s%c,\n",
743 language ? '"' : '(',
744 language ? language : "unset",
745 language ? '"' : ')');
748 PerlIO_printf(PerlIO_stderr(),
749 "\tLC_ALL = %c%s%c,\n",
751 lc_all ? lc_all : "unset",
756 for (e = environ; *e; e++) {
757 if (strnEQ(*e, "LC_", 3)
758 && strnNE(*e, "LC_ALL=", 7)
759 && (p = strchr(*e, '=')))
760 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
761 (int)(p - *e), *e, p + 1);
765 PerlIO_printf(PerlIO_stderr(),
768 lang ? lang : "unset",
771 PerlIO_printf(PerlIO_stderr(),
772 " are supported and installed on your system.\n");
777 if (setlocale(LC_ALL, "C")) {
779 PerlIO_printf(PerlIO_stderr(),
780 "perl: warning: Falling back to the standard locale (\"C\").\n");
785 PerlIO_printf(PerlIO_stderr(),
786 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
793 #ifdef USE_LOCALE_CTYPE
794 || !(curctype || setlocale(LC_CTYPE, "C"))
795 #endif /* USE_LOCALE_CTYPE */
796 #ifdef USE_LOCALE_COLLATE
797 || !(curcoll || setlocale(LC_COLLATE, "C"))
798 #endif /* USE_LOCALE_COLLATE */
799 #ifdef USE_LOCALE_NUMERIC
800 || !(curnum || setlocale(LC_NUMERIC, "C"))
801 #endif /* USE_LOCALE_NUMERIC */
805 PerlIO_printf(PerlIO_stderr(),
806 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
810 #endif /* ! LC_ALL */
812 #ifdef USE_LOCALE_CTYPE
813 curctype = setlocale(LC_CTYPE, Nullch);
814 #endif /* USE_LOCALE_CTYPE */
815 #ifdef USE_LOCALE_COLLATE
816 curcoll = setlocale(LC_COLLATE, Nullch);
817 #endif /* USE_LOCALE_COLLATE */
818 #ifdef USE_LOCALE_NUMERIC
819 curnum = setlocale(LC_NUMERIC, Nullch);
820 #endif /* USE_LOCALE_NUMERIC */
823 #ifdef USE_LOCALE_CTYPE
825 #endif /* USE_LOCALE_CTYPE */
827 #ifdef USE_LOCALE_COLLATE
828 new_collate(curcoll);
829 #endif /* USE_LOCALE_COLLATE */
831 #ifdef USE_LOCALE_NUMERIC
833 #endif /* USE_LOCALE_NUMERIC */
835 #endif /* USE_LOCALE */
840 /* Backwards compatibility. */
842 Perl_init_i18nl14n(pTHX_ int printwarn)
844 return init_i18nl10n(printwarn);
847 #ifdef USE_LOCALE_COLLATE
850 * mem_collxfrm() is a bit like strxfrm() but with two important
851 * differences. First, it handles embedded NULs. Second, it allocates
852 * a bit more memory than needed for the transformed data itself.
853 * The real transformed data begins at offset sizeof(collationix).
854 * Please see sv_collxfrm() to see how this is used.
857 Perl_mem_collxfrm(pTHX_ const char *s, STRLEN len, STRLEN *xlen)
860 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
862 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
863 /* the +1 is for the terminating NUL. */
865 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
866 New(171, xbuf, xAlloc, char);
870 *(U32*)xbuf = PL_collation_ix;
871 xout = sizeof(PL_collation_ix);
872 for (xin = 0; xin < len; ) {
876 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
879 if (xused < xAlloc - xout)
881 xAlloc = (2 * xAlloc) + 1;
882 Renew(xbuf, xAlloc, char);
887 xin += strlen(s + xin) + 1;
890 /* Embedded NULs are understood but silently skipped
891 * because they make no sense in locale collation. */
895 *xlen = xout - sizeof(PL_collation_ix);
904 #endif /* USE_LOCALE_COLLATE */
906 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
908 /* As a space optimization, we do not compile tables for strings of length
909 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
910 special-cased in fbm_instr().
912 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
915 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
924 if (flags & FBMcf_TAIL)
925 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
926 s = (U8*)SvPV_force(sv, len);
927 (void)SvUPGRADE(sv, SVt_PVBM);
928 if (len == 0) /* TAIL might be on on a zero-length string. */
938 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
939 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
940 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
941 memset((void*)table, mlen, 256);
942 table[-1] = (U8)flags;
944 sb = s - mlen + 1; /* first char (maybe) */
946 if (table[*s] == mlen)
951 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
954 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
955 for (i = 0; i < len; i++) {
956 if (PL_freq[s[i]] < frequency) {
958 frequency = PL_freq[s[i]];
961 BmRARE(sv) = s[rarest];
962 BmPREVIOUS(sv) = rarest;
963 BmUSEFUL(sv) = 100; /* Initial value */
964 if (flags & FBMcf_TAIL)
966 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
967 BmRARE(sv),BmPREVIOUS(sv)));
970 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
971 /* If SvTAIL is actually due to \Z or \z, this gives false positives
975 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
977 register unsigned char *s;
979 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
980 register STRLEN littlelen = l;
981 register I32 multiline = flags & FBMrf_MULTILINE;
983 if (bigend - big < littlelen) {
985 if ( SvTAIL(littlestr)
986 && (bigend - big == littlelen - 1)
988 || *big == *little && memEQ(big, little, littlelen - 1)))
993 if (littlelen <= 2) { /* Special-cased */
996 if (littlelen == 1) {
997 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
998 /* Know that bigend != big. */
999 if (bigend[-1] == '\n')
1000 return (char *)(bigend - 1);
1001 return (char *) bigend;
1004 while (s < bigend) {
1009 if (SvTAIL(littlestr))
1010 return (char *) bigend;
1014 return (char*)big; /* Cannot be SvTAIL! */
1016 /* littlelen is 2 */
1017 if (SvTAIL(littlestr) && !multiline) {
1018 if (bigend[-1] == '\n' && bigend[-2] == *little)
1019 return (char*)bigend - 2;
1020 if (bigend[-1] == *little)
1021 return (char*)bigend - 1;
1025 /* This should be better than FBM if c1 == c2, and almost
1026 as good otherwise: maybe better since we do less indirection.
1027 And we save a lot of memory by caching no table. */
1028 register unsigned char c1 = little[0];
1029 register unsigned char c2 = little[1];
1034 while (s <= bigend) {
1037 return (char*)s - 1;
1044 goto check_1char_anchor;
1055 goto check_1char_anchor;
1058 while (s <= bigend) {
1061 return (char*)s - 1;
1063 goto check_1char_anchor;
1072 check_1char_anchor: /* One char and anchor! */
1073 if (SvTAIL(littlestr) && (*bigend == *little))
1074 return (char *)bigend; /* bigend is already decremented. */
1077 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
1078 s = bigend - littlelen;
1079 if (s >= big && bigend[-1] == '\n' && *s == *little
1080 /* Automatically of length > 2 */
1081 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1083 return (char*)s; /* how sweet it is */
1086 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
1088 return (char*)s + 1; /* how sweet it is */
1092 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
1093 char *b = ninstr((char*)big,(char*)bigend,
1094 (char*)little, (char*)little + littlelen);
1096 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
1097 /* Chop \n from littlestr: */
1098 s = bigend - littlelen + 1;
1100 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1109 { /* Do actual FBM. */
1110 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
1111 register unsigned char *oldlittle;
1113 if (littlelen > bigend - big)
1115 --littlelen; /* Last char found by table lookup */
1117 s = big + littlelen;
1118 little += littlelen; /* last char */
1125 if ((tmp = table[*s])) {
1127 if (bigend - s > tmp) {
1133 if ((s += tmp) < bigend)
1138 else { /* less expensive than calling strncmp() */
1139 register unsigned char *olds = s;
1144 if (*--s == *--little)
1147 s = olds + 1; /* here we pay the price for failure */
1149 if (s < bigend) /* fake up continue to outer loop */
1157 if ( s == bigend && (table[-1] & FBMcf_TAIL)
1158 && memEQ(bigend - littlelen, oldlittle - littlelen, littlelen) )
1159 return (char*)bigend - littlelen;
1164 /* start_shift, end_shift are positive quantities which give offsets
1165 of ends of some substring of bigstr.
1166 If `last' we want the last occurence.
1167 old_posp is the way of communication between consequent calls if
1168 the next call needs to find the .
1169 The initial *old_posp should be -1.
1171 Note that we take into account SvTAIL, so one can get extra
1172 optimizations if _ALL flag is set.
1175 /* If SvTAIL is actually due to \Z or \z, this gives false positives
1176 if PL_multiline. In fact if !PL_multiline the autoritative answer
1177 is not supported yet. */
1180 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1183 register unsigned char *s, *x;
1184 register unsigned char *big;
1186 register I32 previous;
1188 register unsigned char *little;
1189 register I32 stop_pos;
1190 register unsigned char *littleend;
1194 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1195 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
1197 if ( BmRARE(littlestr) == '\n'
1198 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
1199 little = (unsigned char *)(SvPVX(littlestr));
1200 littleend = little + SvCUR(littlestr);
1207 little = (unsigned char *)(SvPVX(littlestr));
1208 littleend = little + SvCUR(littlestr);
1210 /* The value of pos we can start at: */
1211 previous = BmPREVIOUS(littlestr);
1212 big = (unsigned char *)(SvPVX(bigstr));
1213 /* The value of pos we can stop at: */
1214 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1215 if (previous + start_shift > stop_pos) {
1216 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
1220 while (pos < previous + start_shift) {
1221 if (!(pos += PL_screamnext[pos]))
1226 if (pos >= stop_pos) break;
1227 if (big[pos-previous] != first)
1229 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1235 if (s == littleend) {
1237 if (!last) return (char *)(big+pos-previous);
1240 } while ( pos += PL_screamnext[pos] );
1241 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1242 #else /* !POINTERRIGOR */
1245 if (pos >= stop_pos) break;
1246 if (big[pos] != first)
1248 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1254 if (s == littleend) {
1256 if (!last) return (char *)(big+pos);
1259 } while ( pos += PL_screamnext[pos] );
1261 return (char *)(big+(*old_posp));
1262 #endif /* POINTERRIGOR */
1264 if (!SvTAIL(littlestr) || (end_shift > 0))
1266 /* Ignore the trailing "\n". This code is not microoptimized */
1267 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
1268 stop_pos = littleend - little; /* Actual littlestr len */
1273 && ((stop_pos == 1) || memEQ(big + 1, little, stop_pos - 1)))
1279 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
1281 register U8 *a = (U8 *)s1;
1282 register U8 *b = (U8 *)s2;
1284 if (*a != *b && *a != PL_fold[*b])
1292 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
1294 register U8 *a = (U8 *)s1;
1295 register U8 *b = (U8 *)s2;
1297 if (*a != *b && *a != PL_fold_locale[*b])
1304 /* copy a string to a safe spot */
1307 Perl_savepv(pTHX_ const char *sv)
1309 register char *newaddr;
1311 New(902,newaddr,strlen(sv)+1,char);
1312 (void)strcpy(newaddr,sv);
1316 /* same thing but with a known length */
1319 Perl_savepvn(pTHX_ const char *sv, register I32 len)
1321 register char *newaddr;
1323 New(903,newaddr,len+1,char);
1324 Copy(sv,newaddr,len,char); /* might not be null terminated */
1325 newaddr[len] = '\0'; /* is now */
1329 /* the SV for Perl_form() and mess() is not kept in an arena */
1339 return sv_2mortal(newSVpvn("",0));
1344 /* Create as PVMG now, to avoid any upgrading later */
1345 New(905, sv, 1, SV);
1346 Newz(905, any, 1, XPVMG);
1347 SvFLAGS(sv) = SVt_PVMG;
1348 SvANY(sv) = (void*)any;
1349 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1354 #if defined(PERL_IMPLICIT_CONTEXT)
1356 Perl_form_nocontext(const char* pat, ...)
1361 va_start(args, pat);
1362 retval = vform(pat, &args);
1366 #endif /* PERL_IMPLICIT_CONTEXT */
1369 Perl_form(pTHX_ const char* pat, ...)
1373 va_start(args, pat);
1374 retval = vform(pat, &args);
1380 Perl_vform(pTHX_ const char *pat, va_list *args)
1382 SV *sv = mess_alloc();
1383 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1387 #if defined(PERL_IMPLICIT_CONTEXT)
1389 Perl_mess_nocontext(const char *pat, ...)
1394 va_start(args, pat);
1395 retval = vmess(pat, &args);
1399 #endif /* PERL_IMPLICIT_CONTEXT */
1402 Perl_mess(pTHX_ const char *pat, ...)
1406 va_start(args, pat);
1407 retval = vmess(pat, &args);
1413 Perl_vmess(pTHX_ const char *pat, va_list *args)
1415 SV *sv = mess_alloc();
1416 static char dgd[] = " during global destruction.\n";
1418 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1419 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1421 if (PL_curcop->cop_line)
1422 Perl_sv_catpvf(aTHX_ sv, " at %_ line %"IVdf,
1423 GvSV(PL_curcop->cop_filegv), (IV)PL_curcop->cop_line);
1424 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1425 bool line_mode = (RsSIMPLE(PL_rs) &&
1426 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1427 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1428 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1429 line_mode ? "line" : "chunk",
1430 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1434 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1436 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1442 Perl_vdie(pTHX_ const char* pat, va_list *args)
1446 int was_in_eval = PL_in_eval;
1453 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1454 "%p: die: curstack = %p, mainstack = %p\n",
1455 thr, PL_curstack, PL_mainstack));
1458 msv = vmess(pat, args);
1459 if (PL_errors && SvCUR(PL_errors)) {
1460 sv_catsv(PL_errors, msv);
1461 message = SvPV(PL_errors, msglen);
1462 SvCUR_set(PL_errors, 0);
1465 message = SvPV(msv,msglen);
1471 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1472 "%p: die: message = %s\ndiehook = %p\n",
1473 thr, message, PL_diehook));
1475 /* sv_2cv might call Perl_croak() */
1476 SV *olddiehook = PL_diehook;
1478 SAVESPTR(PL_diehook);
1479 PL_diehook = Nullsv;
1480 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1482 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1488 msg = newSVpvn(message, msglen);
1496 PUSHSTACKi(PERLSI_DIEHOOK);
1500 /* HACK - REVISIT - avoid CATCH_SET(TRUE) in call_sv()
1501 or we come back here due to a JMPENV_JMP() and do
1502 a POPSTACK - but die_where() will have already done
1503 one as it unwound - NI-S 1999/08/14 */
1504 call_sv((SV*)cv, G_DISCARD|G_NOCATCH);
1510 PL_restartop = die_where(message, msglen);
1511 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1512 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1513 thr, PL_restartop, was_in_eval, PL_top_env));
1514 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1516 return PL_restartop;
1519 #if defined(PERL_IMPLICIT_CONTEXT)
1521 Perl_die_nocontext(const char* pat, ...)
1526 va_start(args, pat);
1527 o = vdie(pat, &args);
1531 #endif /* PERL_IMPLICIT_CONTEXT */
1534 Perl_die(pTHX_ const char* pat, ...)
1538 va_start(args, pat);
1539 o = vdie(pat, &args);
1545 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1555 msv = vmess(pat, args);
1556 if (PL_errors && SvCUR(PL_errors)) {
1557 sv_catsv(PL_errors, msv);
1558 message = SvPV(PL_errors, msglen);
1559 SvCUR_set(PL_errors, 0);
1562 message = SvPV(msv,msglen);
1564 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s",
1565 (unsigned long) thr, message));
1568 /* sv_2cv might call Perl_croak() */
1569 SV *olddiehook = PL_diehook;
1571 SAVESPTR(PL_diehook);
1572 PL_diehook = Nullsv;
1573 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1575 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1580 msg = newSVpvn(message, msglen);
1584 PUSHSTACKi(PERLSI_DIEHOOK);
1588 call_sv((SV*)cv, G_DISCARD);
1594 PL_restartop = die_where(message, msglen);
1599 /* SFIO can really mess with your errno */
1602 PerlIO_write(PerlIO_stderr(), message, msglen);
1603 (void)PerlIO_flush(PerlIO_stderr());
1611 #if defined(PERL_IMPLICIT_CONTEXT)
1613 Perl_croak_nocontext(const char *pat, ...)
1617 va_start(args, pat);
1622 #endif /* PERL_IMPLICIT_CONTEXT */
1625 Perl_croak(pTHX_ const char *pat, ...)
1628 va_start(args, pat);
1635 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1644 msv = vmess(pat, args);
1645 message = SvPV(msv, msglen);
1648 /* sv_2cv might call Perl_warn() */
1650 SV *oldwarnhook = PL_warnhook;
1652 SAVESPTR(PL_warnhook);
1653 PL_warnhook = Nullsv;
1654 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1656 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1661 msg = newSVpvn(message, msglen);
1665 PUSHSTACKi(PERLSI_WARNHOOK);
1669 call_sv((SV*)cv, G_DISCARD);
1675 PerlIO_write(PerlIO_stderr(), message, msglen);
1677 DEBUG_L(*message == '!'
1678 ? (xstat(message[1]=='!'
1679 ? (message[2]=='!' ? 2 : 1)
1684 (void)PerlIO_flush(PerlIO_stderr());
1687 #if defined(PERL_IMPLICIT_CONTEXT)
1689 Perl_warn_nocontext(const char *pat, ...)
1693 va_start(args, pat);
1697 #endif /* PERL_IMPLICIT_CONTEXT */
1700 Perl_warn(pTHX_ const char *pat, ...)
1703 va_start(args, pat);
1708 #if defined(PERL_IMPLICIT_CONTEXT)
1710 Perl_warner_nocontext(U32 err, const char *pat, ...)
1714 va_start(args, pat);
1715 vwarner(err, pat, &args);
1718 #endif /* PERL_IMPLICIT_CONTEXT */
1721 Perl_warner(pTHX_ U32 err, const char* pat,...)
1724 va_start(args, pat);
1725 vwarner(err, pat, &args);
1730 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1740 msv = vmess(pat, args);
1741 message = SvPV(msv, msglen);
1745 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1746 #endif /* USE_THREADS */
1748 /* sv_2cv might call Perl_croak() */
1749 SV *olddiehook = PL_diehook;
1751 SAVESPTR(PL_diehook);
1752 PL_diehook = Nullsv;
1753 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1755 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1760 msg = newSVpvn(message, msglen);
1767 call_sv((SV*)cv, G_DISCARD);
1773 PL_restartop = die_where(message, msglen);
1776 PerlIO_write(PerlIO_stderr(), message, msglen);
1777 (void)PerlIO_flush(PerlIO_stderr());
1783 /* sv_2cv might call Perl_warn() */
1785 SV *oldwarnhook = PL_warnhook;
1787 SAVESPTR(PL_warnhook);
1788 PL_warnhook = Nullsv;
1789 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1791 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1796 msg = newSVpvn(message, msglen);
1803 call_sv((SV*)cv, G_DISCARD);
1809 PerlIO_write(PerlIO_stderr(), message, msglen);
1813 (void)PerlIO_flush(PerlIO_stderr());
1817 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1818 #if !defined(WIN32) && !defined(CYGWIN)
1820 Perl_my_setenv(pTHX_ char *nam, char *val)
1822 #ifndef PERL_USE_SAFE_PUTENV
1823 /* most putenv()s leak, so we manipulate environ directly */
1824 register I32 i=setenv_getix(nam); /* where does it go? */
1826 if (environ == PL_origenviron) { /* need we copy environment? */
1832 for (max = i; environ[max]; max++) ;
1833 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1834 for (j=0; j<max; j++) { /* copy environment */
1835 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1836 strcpy(tmpenv[j], environ[j]);
1838 tmpenv[max] = Nullch;
1839 environ = tmpenv; /* tell exec where it is now */
1842 safesysfree(environ[i]);
1843 while (environ[i]) {
1844 environ[i] = environ[i+1];
1849 if (!environ[i]) { /* does not exist yet */
1850 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1851 environ[i+1] = Nullch; /* make sure it's null terminated */
1854 safesysfree(environ[i]);
1855 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1857 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1859 #else /* PERL_USE_SAFE_PUTENV */
1862 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1863 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1864 (void)putenv(new_env);
1865 #endif /* PERL_USE_SAFE_PUTENV */
1868 #else /* WIN32 || CYGWIN */
1871 * Save environ of perl.exe, currently Cygwin links in separate environ's
1872 * for each exe/dll. Probably should be a member of impure_ptr.
1874 static char ***Perl_main_environ;
1877 Perl_my_setenv_init(char ***penviron)
1879 Perl_main_environ = penviron;
1883 my_setenv(char *nam, char *val)
1885 /* You can not directly manipulate the environ[] array because
1886 * the routines do some additional work that syncs the Cygwin
1887 * environment with the Windows environment.
1889 char *oldstr = environ[setenv_getix(nam)];
1898 setenv(nam, val, 1);
1899 environ = *Perl_main_environ; /* environ realloc can occur in setenv */
1900 if(oldstr && environ[setenv_getix(nam)] != oldstr)
1903 #else /* if WIN32 */
1906 Perl_my_setenv(pTHX_ char *nam,char *val)
1909 #ifdef USE_WIN32_RTL_ENV
1911 register char *envstr;
1912 STRLEN namlen = strlen(nam);
1914 char *oldstr = environ[setenv_getix(nam)];
1916 /* putenv() has totally broken semantics in both the Borland
1917 * and Microsoft CRTLs. They either store the passed pointer in
1918 * the environment without making a copy, or make a copy and don't
1919 * free it. And on top of that, they dont free() old entries that
1920 * are being replaced/deleted. This means the caller must
1921 * free any old entries somehow, or we end up with a memory
1922 * leak every time my_setenv() is called. One might think
1923 * one could directly manipulate environ[], like the UNIX code
1924 * above, but direct changes to environ are not allowed when
1925 * calling putenv(), since the RTLs maintain an internal
1926 * *copy* of environ[]. Bad, bad, *bad* stink.
1937 vallen = strlen(val);
1938 envstr = (char*)safesysmalloc((namlen + vallen + 3) * sizeof(char));
1939 (void)sprintf(envstr,"%s=%s",nam,val);
1940 (void)PerlEnv_putenv(envstr);
1942 safesysfree(oldstr);
1944 safesysfree(envstr); /* MSVCRT leaks without this */
1947 #else /* !USE_WIN32_RTL_ENV */
1949 register char *envstr;
1950 STRLEN len = strlen(nam) + 3;
1955 New(904, envstr, len, char);
1956 (void)sprintf(envstr,"%s=%s",nam,val);
1957 (void)PerlEnv_putenv(envstr);
1967 Perl_setenv_getix(pTHX_ char *nam)
1969 register I32 i, len = strlen(nam);
1971 for (i = 0; environ[i]; i++) {
1974 strnicmp(environ[i],nam,len) == 0
1976 strnEQ(environ[i],nam,len)
1978 && environ[i][len] == '=')
1979 break; /* strnEQ must come first to avoid */
1980 } /* potential SEGV's */
1986 #ifdef UNLINK_ALL_VERSIONS
1988 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1992 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1997 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1999 Perl_my_bcopy(pTHX_ register const char *from,register char *to,register I32 len)
2003 if (from - to >= 0) {
2011 *(--to) = *(--from);
2019 Perl_my_memset(pTHX_ register char *loc, register I32 ch, register I32 len)
2029 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2031 Perl_my_bzero(pTHX_ register char *loc, register I32 len)
2041 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2043 Perl_my_memcmp(pTHX_ const char *s1, const char *s2, register I32 len)
2045 register U8 *a = (U8 *)s1;
2046 register U8 *b = (U8 *)s2;
2050 if (tmp = *a++ - *b++)
2055 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2059 #ifdef USE_CHAR_VSPRINTF
2064 vsprintf(char *dest, const char *pat, char *args)
2068 fakebuf._ptr = dest;
2069 fakebuf._cnt = 32767;
2073 fakebuf._flag = _IOWRT|_IOSTRG;
2074 _doprnt(pat, args, &fakebuf); /* what a kludge */
2075 (void)putc('\0', &fakebuf);
2076 #ifdef USE_CHAR_VSPRINTF
2079 return 0; /* perl doesn't use return value */
2083 #endif /* HAS_VPRINTF */
2086 #if BYTEORDER != 0x4321
2088 Perl_my_swap(pTHX_ short s)
2090 #if (BYTEORDER & 1) == 0
2093 result = ((s & 255) << 8) + ((s >> 8) & 255);
2101 Perl_my_htonl(pTHX_ long l)
2105 char c[sizeof(long)];
2108 #if BYTEORDER == 0x1234
2109 u.c[0] = (l >> 24) & 255;
2110 u.c[1] = (l >> 16) & 255;
2111 u.c[2] = (l >> 8) & 255;
2115 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2116 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2121 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2122 u.c[o & 0xf] = (l >> s) & 255;
2130 Perl_my_ntohl(pTHX_ long l)
2134 char c[sizeof(long)];
2137 #if BYTEORDER == 0x1234
2138 u.c[0] = (l >> 24) & 255;
2139 u.c[1] = (l >> 16) & 255;
2140 u.c[2] = (l >> 8) & 255;
2144 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2145 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2152 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2153 l |= (u.c[o & 0xf] & 255) << s;
2160 #endif /* BYTEORDER != 0x4321 */
2164 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2165 * If these functions are defined,
2166 * the BYTEORDER is neither 0x1234 nor 0x4321.
2167 * However, this is not assumed.
2171 #define HTOV(name,type) \
2173 name (register type n) \
2177 char c[sizeof(type)]; \
2181 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2182 u.c[i] = (n >> s) & 0xFF; \
2187 #define VTOH(name,type) \
2189 name (register type n) \
2193 char c[sizeof(type)]; \
2199 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2200 n += (u.c[i] & 0xFF) << s; \
2205 #if defined(HAS_HTOVS) && !defined(htovs)
2208 #if defined(HAS_HTOVL) && !defined(htovl)
2211 #if defined(HAS_VTOHS) && !defined(vtohs)
2214 #if defined(HAS_VTOHL) && !defined(vtohl)
2218 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2219 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2221 Perl_my_popen(pTHX_ char *cmd, char *mode)
2224 register I32 This, that;
2227 I32 doexec = strNE(cmd,"-");
2231 PERL_FLUSHALL_FOR_CHILD;
2234 return my_syspopen(cmd,mode);
2237 This = (*mode == 'w');
2239 if (doexec && PL_tainting) {
2241 taint_proper("Insecure %s%s", "EXEC");
2243 if (PerlProc_pipe(p) < 0)
2245 if (doexec && PerlProc_pipe(pp) >= 0)
2247 while ((pid = (doexec?vfork():fork())) < 0) {
2248 if (errno != EAGAIN) {
2249 PerlLIO_close(p[This]);
2251 PerlLIO_close(pp[0]);
2252 PerlLIO_close(pp[1]);
2255 Perl_croak(aTHX_ "Can't fork");
2267 PerlLIO_close(p[THAT]);
2269 PerlLIO_close(pp[0]);
2270 #if defined(HAS_FCNTL) && defined(F_SETFD)
2271 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2274 if (p[THIS] != (*mode == 'r')) {
2275 PerlLIO_dup2(p[THIS], *mode == 'r');
2276 PerlLIO_close(p[THIS]);
2280 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2286 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2290 do_exec3(cmd,pp[1],did_pipes); /* may or may not use the shell */
2293 #endif /* defined OS2 */
2295 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
2296 sv_setiv(GvSV(tmpgv), getpid());
2298 hv_clear(PL_pidstatus); /* we have no children */
2303 do_execfree(); /* free any memory malloced by child on vfork */
2304 PerlLIO_close(p[that]);
2306 PerlLIO_close(pp[1]);
2307 if (p[that] < p[This]) {
2308 PerlLIO_dup2(p[This], p[that]);
2309 PerlLIO_close(p[This]);
2312 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2313 (void)SvUPGRADE(sv,SVt_IV);
2315 PL_forkprocess = pid;
2316 if (did_pipes && pid > 0) {
2320 while (n < sizeof(int)) {
2321 n1 = PerlLIO_read(pp[0],
2322 (void*)(((char*)&errkid)+n),
2328 PerlLIO_close(pp[0]);
2330 if (n) { /* Error */
2331 if (n != sizeof(int))
2332 Perl_croak(aTHX_ "panic: kid popen errno read");
2333 errno = errkid; /* Propagate errno from kid */
2338 PerlLIO_close(pp[0]);
2339 return PerlIO_fdopen(p[This], mode);
2342 #if defined(atarist) || defined(DJGPP)
2345 Perl_my_popen(pTHX_ char *cmd, char *mode)
2347 /* Needs work for PerlIO ! */
2348 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
2349 PERL_FLUSHALL_FOR_CHILD;
2350 return popen(PerlIO_exportFILE(cmd, 0), mode);
2354 #endif /* !DOSISH */
2358 Perl_dump_fds(pTHX_ char *s)
2361 struct stat tmpstatbuf;
2363 PerlIO_printf(PerlIO_stderr(),"%s", s);
2364 for (fd = 0; fd < 32; fd++) {
2365 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2366 PerlIO_printf(PerlIO_stderr()," %d",fd);
2368 PerlIO_printf(PerlIO_stderr(),"\n");
2370 #endif /* DUMP_FDS */
2374 dup2(int oldfd, int newfd)
2376 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2379 PerlLIO_close(newfd);
2380 return fcntl(oldfd, F_DUPFD, newfd);
2382 #define DUP2_MAX_FDS 256
2383 int fdtmp[DUP2_MAX_FDS];
2389 PerlLIO_close(newfd);
2390 /* good enough for low fd's... */
2391 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2392 if (fdx >= DUP2_MAX_FDS) {
2400 PerlLIO_close(fdtmp[--fdx]);
2407 #ifdef HAS_SIGACTION
2410 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2412 struct sigaction act, oact;
2414 act.sa_handler = handler;
2415 sigemptyset(&act.sa_mask);
2418 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2421 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2422 act.sa_flags |= SA_NOCLDWAIT;
2424 if (sigaction(signo, &act, &oact) == -1)
2427 return oact.sa_handler;
2431 Perl_rsignal_state(pTHX_ int signo)
2433 struct sigaction oact;
2435 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2438 return oact.sa_handler;
2442 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2444 struct sigaction act;
2446 act.sa_handler = handler;
2447 sigemptyset(&act.sa_mask);
2450 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2453 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2454 act.sa_flags |= SA_NOCLDWAIT;
2456 return sigaction(signo, &act, save);
2460 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2462 return sigaction(signo, save, (struct sigaction *)NULL);
2465 #else /* !HAS_SIGACTION */
2468 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2470 return PerlProc_signal(signo, handler);
2473 static int sig_trapped;
2483 Perl_rsignal_state(pTHX_ int signo)
2485 Sighandler_t oldsig;
2488 oldsig = PerlProc_signal(signo, sig_trap);
2489 PerlProc_signal(signo, oldsig);
2491 PerlProc_kill(getpid(), signo);
2496 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2498 *save = PerlProc_signal(signo, handler);
2499 return (*save == SIG_ERR) ? -1 : 0;
2503 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2505 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2508 #endif /* !HAS_SIGACTION */
2510 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2511 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2513 Perl_my_pclose(pTHX_ PerlIO *ptr)
2515 Sigsave_t hstat, istat, qstat;
2523 int saved_vaxc_errno;
2526 int saved_win32_errno;
2529 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2532 *svp = &PL_sv_undef;
2534 if (pid == -1) { /* Opened by popen. */
2535 return my_syspclose(ptr);
2538 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2539 saved_errno = errno;
2541 saved_vaxc_errno = vaxc$errno;
2544 saved_win32_errno = GetLastError();
2548 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2550 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2551 rsignal_save(SIGINT, SIG_IGN, &istat);
2552 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2554 pid2 = wait4pid(pid, &status, 0);
2555 } while (pid2 == -1 && errno == EINTR);
2556 rsignal_restore(SIGHUP, &hstat);
2557 rsignal_restore(SIGINT, &istat);
2558 rsignal_restore(SIGQUIT, &qstat);
2560 SETERRNO(saved_errno, saved_vaxc_errno);
2563 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2565 #endif /* !DOSISH */
2567 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2569 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2573 char spid[TYPE_CHARS(int)];
2578 sprintf(spid, "%d", pid);
2579 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2580 if (svp && *svp != &PL_sv_undef) {
2581 *statusp = SvIVX(*svp);
2582 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2589 hv_iterinit(PL_pidstatus);
2590 if (entry = hv_iternext(PL_pidstatus)) {
2591 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2592 sv = hv_iterval(PL_pidstatus,entry);
2593 *statusp = SvIVX(sv);
2594 sprintf(spid, "%d", pid);
2595 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2600 # ifdef HAS_WAITPID_RUNTIME
2601 if (!HAS_WAITPID_RUNTIME)
2604 return PerlProc_waitpid(pid,statusp,flags);
2606 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2607 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2609 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2614 Perl_croak(aTHX_ "Can't do waitpid with flags");
2616 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2617 pidgone(result,*statusp);
2625 #endif /* !DOSISH || OS2 || WIN32 */
2629 Perl_pidgone(pTHX_ Pid_t pid, int status)
2632 char spid[TYPE_CHARS(int)];
2634 sprintf(spid, "%d", pid);
2635 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2636 (void)SvUPGRADE(sv,SVt_IV);
2641 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2644 int /* Cannot prototype with I32
2646 my_syspclose(PerlIO *ptr)
2649 Perl_my_pclose(pTHX_ PerlIO *ptr)
2652 /* Needs work for PerlIO ! */
2653 FILE *f = PerlIO_findFILE(ptr);
2654 I32 result = pclose(f);
2656 result = (result << 8) & 0xff00;
2658 PerlIO_releaseFILE(ptr,f);
2664 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2667 register const char *frombase = from;
2670 register const char c = *from;
2675 while (count-- > 0) {
2676 for (todo = len; todo > 0; todo--) {
2684 Perl_cast_ulong(pTHX_ NV f)
2689 # define BIGDOUBLE 2147483648.0
2691 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2694 return (unsigned long)f;
2696 return (unsigned long)along;
2700 /* Unfortunately, on some systems the cast_uv() function doesn't
2701 work with the system-supplied definition of ULONG_MAX. The
2702 comparison (f >= ULONG_MAX) always comes out true. It must be a
2703 problem with the compiler constant folding.
2705 In any case, this workaround should be fine on any two's complement
2706 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2708 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2711 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2713 -- Kenneth Albanowski <kjahds@kjahds.com>
2717 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2721 Perl_cast_i32(pTHX_ NV f)
2724 return (I32) I32_MAX;
2726 return (I32) I32_MIN;
2731 Perl_cast_iv(pTHX_ NV f)
2736 if (f >= (NV)UV_MAX)
2747 Perl_cast_uv(pTHX_ NV f)
2750 return (UV) MY_UV_MAX;
2764 Perl_same_dirent(pTHX_ char *a, char *b)
2766 char *fa = strrchr(a,'/');
2767 char *fb = strrchr(b,'/');
2768 struct stat tmpstatbuf1;
2769 struct stat tmpstatbuf2;
2770 SV *tmpsv = sv_newmortal();
2783 sv_setpv(tmpsv, ".");
2785 sv_setpvn(tmpsv, a, fa - a);
2786 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2789 sv_setpv(tmpsv, ".");
2791 sv_setpvn(tmpsv, b, fb - b);
2792 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2794 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2795 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2797 #endif /* !HAS_RENAME */
2800 Perl_scan_bin(pTHX_ char *start, I32 len, I32 *retlen)
2802 register char *s = start;
2803 register NV rnv = 0.0;
2804 register UV ruv = 0;
2805 register bool seenb = FALSE;
2806 register bool overflowed = FALSE;
2808 for (; len-- && *s; s++) {
2809 if (!(*s == '0' || *s == '1')) {
2811 continue; /* Note: does not check for __ and the like. */
2812 if (seenb == FALSE && *s == 'b' && ruv == 0) {
2813 /* Disallow 0bbb0b0bbb... */
2819 if (ckWARN(WARN_DIGIT))
2820 Perl_warner(aTHX_ WARN_DIGIT,
2821 "Illegal binary digit '%c' ignored", *s);
2826 register UV xuv = ruv << 1;
2828 if ((xuv >> 1) != ruv) {
2832 if (ckWARN_d(WARN_OVERFLOW))
2833 Perl_warner(aTHX_ WARN_OVERFLOW,
2834 "Integer overflow in binary number");
2836 ruv = xuv | (*s - '0');
2840 /* If an NV has not enough bits in its mantissa to
2841 * represent an UV this summing of small low-order numbers
2842 * is a waste of time (because the NV cannot preserve
2843 * the low-order bits anyway): we could just remember when
2844 * did we overflow and in the end just multiply rnv by the
2851 if ( ( overflowed && rnv > 4294967295.0)
2853 || (!overflowed && ruv > 0xffffffff )
2857 if (ckWARN(WARN_PORTABLE))
2858 Perl_warner(aTHX_ WARN_PORTABLE,
2859 "Binary number > 0b11111111111111111111111111111111 non-portable");
2861 *retlen = s - start;
2866 Perl_scan_oct(pTHX_ char *start, I32 len, I32 *retlen)
2868 register char *s = start;
2869 register NV rnv = 0.0;
2870 register UV ruv = 0;
2871 register bool overflowed = FALSE;
2873 for (; len-- && *s; s++) {
2874 if (!(*s >= '0' && *s <= '7')) {
2876 continue; /* Note: does not check for __ and the like. */
2878 /* Allow \octal to work the DWIM way (that is, stop scanning
2879 * as soon as non-octal characters are seen, complain only iff
2880 * someone seems to want to use the digits eight and nine). */
2881 if (*s == '8' || *s == '9') {
2883 if (ckWARN(WARN_DIGIT))
2884 Perl_warner(aTHX_ WARN_DIGIT,
2885 "Illegal octal digit '%c' ignored", *s);
2891 register UV xuv = ruv << 3;
2893 if ((xuv >> 3) != ruv) {
2897 if (ckWARN_d(WARN_OVERFLOW))
2898 Perl_warner(aTHX_ WARN_OVERFLOW,
2899 "Integer overflow in octal number");
2901 ruv = xuv | (*s - '0');
2905 /* If an NV has not enough bits in its mantissa to
2906 * represent an UV this summing of small low-order numbers
2907 * is a waste of time (because the NV cannot preserve
2908 * the low-order bits anyway): we could just remember when
2909 * did we overflow and in the end just multiply rnv by the
2910 * right amount of 8-tuples. */
2911 rnv += (NV)(*s - '0');
2916 if ( ( overflowed && rnv > 4294967295.0)
2918 || (!overflowed && ruv > 0xffffffff )
2922 if (ckWARN(WARN_PORTABLE))
2923 Perl_warner(aTHX_ WARN_PORTABLE,
2924 "Octal number > 037777777777 non-portable");
2926 *retlen = s - start;
2931 Perl_scan_hex(pTHX_ char *start, I32 len, I32 *retlen)
2933 register char *s = start;
2934 register NV rnv = 0.0;
2935 register UV ruv = 0;
2936 register bool seenx = FALSE;
2937 register bool overflowed = FALSE;
2940 for (; len-- && *s; s++) {
2941 hexdigit = strchr((char *) PL_hexdigit, *s);
2944 continue; /* Note: does not check for __ and the like. */
2945 if (seenx == FALSE && *s == 'x' && ruv == 0) {
2946 /* Disallow 0xxx0x0xxx... */
2952 if (ckWARN(WARN_DIGIT))
2953 Perl_warner(aTHX_ WARN_DIGIT,
2954 "Illegal hexadecimal digit '%c' ignored", *s);
2959 register UV xuv = ruv << 4;
2961 if ((xuv >> 4) != ruv) {
2965 if (ckWARN_d(WARN_OVERFLOW))
2966 Perl_warner(aTHX_ WARN_OVERFLOW,
2967 "Integer overflow in hexadecimal number");
2969 ruv = xuv | ((hexdigit - PL_hexdigit) & 15);
2973 /* If an NV has not enough bits in its mantissa to
2974 * represent an UV this summing of small low-order numbers
2975 * is a waste of time (because the NV cannot preserve
2976 * the low-order bits anyway): we could just remember when
2977 * did we overflow and in the end just multiply rnv by the
2978 * right amount of 16-tuples. */
2979 rnv += (NV)((hexdigit - PL_hexdigit) & 15);
2984 if ( ( overflowed && rnv > 4294967295.0)
2986 || (!overflowed && ruv > 0xffffffff )
2990 if (ckWARN(WARN_PORTABLE))
2991 Perl_warner(aTHX_ WARN_PORTABLE,
2992 "Hexadecimal number > 0xffffffff non-portable");
2994 *retlen = s - start;
2999 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
3002 char *xfound = Nullch;
3003 char *xfailed = Nullch;
3004 char tmpbuf[MAXPATHLEN];
3008 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3009 # define SEARCH_EXTS ".bat", ".cmd", NULL
3010 # define MAX_EXT_LEN 4
3013 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3014 # define MAX_EXT_LEN 4
3017 # define SEARCH_EXTS ".pl", ".com", NULL
3018 # define MAX_EXT_LEN 4
3020 /* additional extensions to try in each dir if scriptname not found */
3022 char *exts[] = { SEARCH_EXTS };
3023 char **ext = search_ext ? search_ext : exts;
3024 int extidx = 0, i = 0;
3025 char *curext = Nullch;
3027 # define MAX_EXT_LEN 0
3031 * If dosearch is true and if scriptname does not contain path
3032 * delimiters, search the PATH for scriptname.
3034 * If SEARCH_EXTS is also defined, will look for each
3035 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3036 * while searching the PATH.
3038 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3039 * proceeds as follows:
3040 * If DOSISH or VMSISH:
3041 * + look for ./scriptname{,.foo,.bar}
3042 * + search the PATH for scriptname{,.foo,.bar}
3045 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3046 * this will not look in '.' if it's not in the PATH)
3051 # ifdef ALWAYS_DEFTYPES
3052 len = strlen(scriptname);
3053 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3054 int hasdir, idx = 0, deftypes = 1;
3057 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
3060 int hasdir, idx = 0, deftypes = 1;
3063 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
3065 /* The first time through, just add SEARCH_EXTS to whatever we
3066 * already have, so we can check for default file types. */
3068 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3074 if ((strlen(tmpbuf) + strlen(scriptname)
3075 + MAX_EXT_LEN) >= sizeof tmpbuf)
3076 continue; /* don't search dir with too-long name */
3077 strcat(tmpbuf, scriptname);
3081 if (strEQ(scriptname, "-"))
3083 if (dosearch) { /* Look in '.' first. */
3084 char *cur = scriptname;
3086 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3088 if (strEQ(ext[i++],curext)) {
3089 extidx = -1; /* already has an ext */
3094 DEBUG_p(PerlIO_printf(Perl_debug_log,
3095 "Looking for %s\n",cur));
3096 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3097 && !S_ISDIR(PL_statbuf.st_mode)) {
3105 if (cur == scriptname) {
3106 len = strlen(scriptname);
3107 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3109 cur = strcpy(tmpbuf, scriptname);
3111 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3112 && strcpy(tmpbuf+len, ext[extidx++]));
3117 if (dosearch && !strchr(scriptname, '/')
3119 && !strchr(scriptname, '\\')
3121 && (s = PerlEnv_getenv("PATH"))) {
3124 PL_bufend = s + strlen(s);
3125 while (s < PL_bufend) {
3126 #if defined(atarist) || defined(DOSISH)
3131 && *s != ';'; len++, s++) {
3132 if (len < sizeof tmpbuf)
3135 if (len < sizeof tmpbuf)
3137 #else /* ! (atarist || DOSISH) */
3138 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3141 #endif /* ! (atarist || DOSISH) */
3144 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3145 continue; /* don't search dir with too-long name */
3147 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3148 && tmpbuf[len - 1] != '/'
3149 && tmpbuf[len - 1] != '\\'
3152 tmpbuf[len++] = '/';
3153 if (len == 2 && tmpbuf[0] == '.')
3155 (void)strcpy(tmpbuf + len, scriptname);
3159 len = strlen(tmpbuf);
3160 if (extidx > 0) /* reset after previous loop */
3164 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3165 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3166 if (S_ISDIR(PL_statbuf.st_mode)) {
3170 } while ( retval < 0 /* not there */
3171 && extidx>=0 && ext[extidx] /* try an extension? */
3172 && strcpy(tmpbuf+len, ext[extidx++])
3177 if (S_ISREG(PL_statbuf.st_mode)
3178 && cando(S_IRUSR,TRUE,&PL_statbuf)
3180 && cando(S_IXUSR,TRUE,&PL_statbuf)
3184 xfound = tmpbuf; /* bingo! */
3188 xfailed = savepv(tmpbuf);
3191 if (!xfound && !seen_dot && !xfailed &&
3192 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3193 || S_ISDIR(PL_statbuf.st_mode)))
3195 seen_dot = 1; /* Disable message. */
3197 if (flags & 1) { /* do or die? */
3198 Perl_croak(aTHX_ "Can't %s %s%s%s",
3199 (xfailed ? "execute" : "find"),
3200 (xfailed ? xfailed : scriptname),
3201 (xfailed ? "" : " on PATH"),
3202 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3204 scriptname = Nullch;
3208 scriptname = xfound;
3210 return (scriptname ? savepv(scriptname) : Nullch);
3216 /* Very simplistic scheduler for now */
3220 thr = thr->i.next_run;
3224 Perl_cond_init(pTHX_ perl_cond *cp)
3230 Perl_cond_signal(pTHX_ perl_cond *cp)
3233 perl_cond cond = *cp;
3238 /* Insert t in the runnable queue just ahead of us */
3239 t->i.next_run = thr->i.next_run;
3240 thr->i.next_run->i.prev_run = t;
3241 t->i.prev_run = thr;
3242 thr->i.next_run = t;
3243 thr->i.wait_queue = 0;
3244 /* Remove from the wait queue */
3250 Perl_cond_broadcast(pTHX_ perl_cond *cp)
3253 perl_cond cond, cond_next;
3255 for (cond = *cp; cond; cond = cond_next) {
3257 /* Insert t in the runnable queue just ahead of us */
3258 t->i.next_run = thr->i.next_run;
3259 thr->i.next_run->i.prev_run = t;
3260 t->i.prev_run = thr;
3261 thr->i.next_run = t;
3262 thr->i.wait_queue = 0;
3263 /* Remove from the wait queue */
3264 cond_next = cond->next;
3271 Perl_cond_wait(pTHX_ perl_cond *cp)
3275 if (thr->i.next_run == thr)
3276 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
3278 New(666, cond, 1, struct perl_wait_queue);
3282 thr->i.wait_queue = cond;
3283 /* Remove ourselves from runnable queue */
3284 thr->i.next_run->i.prev_run = thr->i.prev_run;
3285 thr->i.prev_run->i.next_run = thr->i.next_run;
3287 #endif /* FAKE_THREADS */
3289 #ifdef PTHREAD_GETSPECIFIC_INT
3290 struct perl_thread *
3295 if (pthread_getspecific(PL_thr_key, &t))
3296 Perl_croak(aTHX_ "panic: pthread_getspecific");
3297 return (struct perl_thread *) t;
3302 Perl_condpair_magic(pTHX_ SV *sv)
3306 SvUPGRADE(sv, SVt_PVMG);
3307 mg = mg_find(sv, 'm');
3311 New(53, cp, 1, condpair_t);
3312 MUTEX_INIT(&cp->mutex);
3313 COND_INIT(&cp->owner_cond);
3314 COND_INIT(&cp->cond);
3316 MUTEX_LOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3317 mg = mg_find(sv, 'm');
3319 /* someone else beat us to initialising it */
3320 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3321 MUTEX_DESTROY(&cp->mutex);
3322 COND_DESTROY(&cp->owner_cond);
3323 COND_DESTROY(&cp->cond);
3327 sv_magic(sv, Nullsv, 'm', 0, 0);
3329 mg->mg_ptr = (char *)cp;
3330 mg->mg_len = sizeof(cp);
3331 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3332 DEBUG_S(WITH_THR(PerlIO_printf(PerlIO_stderr(),
3333 "%p: condpair_magic %p\n", thr, sv));)
3340 * Make a new perl thread structure using t as a prototype. Some of the
3341 * fields for the new thread are copied from the prototype thread, t,
3342 * so t should not be running in perl at the time this function is
3343 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3344 * thread calling new_struct_thread) clearly satisfies this constraint.
3346 struct perl_thread *
3347 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3349 #if !defined(PERL_IMPLICIT_CONTEXT)
3350 struct perl_thread *thr;
3356 sv = newSVpvn("", 0);
3357 SvGROW(sv, sizeof(struct perl_thread) + 1);
3358 SvCUR_set(sv, sizeof(struct perl_thread));
3359 thr = (Thread) SvPVX(sv);
3361 memset(thr, 0xab, sizeof(struct perl_thread));
3368 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3370 Zero(thr, 1, struct perl_thread);
3373 PL_protect = MEMBER_TO_FPTR(Perl_default_protect);
3378 PL_curcop = &PL_compiling;
3379 thr->interp = t->interp;
3380 thr->cvcache = newHV();
3381 thr->threadsv = newAV();
3382 thr->specific = newAV();
3383 thr->errsv = newSVpvn("", 0);
3384 thr->errhv = newHV();
3385 thr->flags = THRf_R_JOINABLE;
3386 MUTEX_INIT(&thr->mutex);
3388 /* top_env needs to be non-zero. It points to an area
3389 in which longjmp() stuff is stored, as C callstack
3390 info there at least is thread specific this has to
3391 be per-thread. Otherwise a 'die' in a thread gives
3392 that thread the C stack of last thread to do an eval {}!
3393 See comments in scope.h
3394 Initialize top entry (as in perl.c for main thread)
3396 PL_start_env.je_prev = NULL;
3397 PL_start_env.je_ret = -1;
3398 PL_start_env.je_mustcatch = TRUE;
3399 PL_top_env = &PL_start_env;
3401 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR) */
3404 PL_statname = NEWSV(66,0);
3405 PL_errors = newSVpvn("", 0);
3407 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3408 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3409 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3410 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3411 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3413 PL_reginterp_cnt = 0;
3414 PL_lastscream = Nullsv;
3417 PL_reg_start_tmp = 0;
3418 PL_reg_start_tmpl = 0;
3419 PL_reg_poscache = Nullch;
3421 /* parent thread's data needs to be locked while we make copy */
3422 MUTEX_LOCK(&t->mutex);
3424 PL_protect = t->Tprotect;
3426 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3427 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3428 PL_curstash = t->Tcurstash; /* always be set to main? */
3430 PL_tainted = t->Ttainted;
3431 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3432 PL_nrs = newSVsv(t->Tnrs);
3433 PL_rs = SvREFCNT_inc(PL_nrs);
3434 PL_last_in_gv = Nullgv;
3435 PL_ofslen = t->Tofslen;
3436 PL_ofs = savepvn(t->Tofs, PL_ofslen);
3437 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3438 PL_chopset = t->Tchopset;
3439 PL_formtarget = newSVsv(t->Tformtarget);
3440 PL_bodytarget = newSVsv(t->Tbodytarget);
3441 PL_toptarget = newSVsv(t->Ttoptarget);
3443 /* Initialise all per-thread SVs that the template thread used */
3444 svp = AvARRAY(t->threadsv);
3445 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3446 if (*svp && *svp != &PL_sv_undef) {
3447 SV *sv = newSVsv(*svp);
3448 av_store(thr->threadsv, i, sv);
3449 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
3450 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
3451 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
3454 thr->threadsvp = AvARRAY(thr->threadsv);
3456 MUTEX_LOCK(&PL_threads_mutex);
3458 thr->tid = ++PL_threadnum;
3459 thr->next = t->next;
3462 thr->next->prev = thr;
3463 MUTEX_UNLOCK(&PL_threads_mutex);
3465 /* done copying parent's state */
3466 MUTEX_UNLOCK(&t->mutex);
3468 #ifdef HAVE_THREAD_INTERN
3469 Perl_init_thread_intern(thr);
3470 #endif /* HAVE_THREAD_INTERN */
3473 #endif /* USE_THREADS */
3477 * This hack is to force load of "huge" support from libm.a
3478 * So it is in perl for (say) POSIX to use.
3479 * Needed for SunOS with Sun's 'acc' for example.
3488 #ifdef PERL_GLOBAL_STRUCT
3497 Perl_get_op_names(pTHX)
3503 Perl_get_op_descs(pTHX)
3509 Perl_get_no_modify(pTHX)
3511 return (char*)PL_no_modify;
3515 Perl_get_opargs(pTHX)
3521 Perl_get_ppaddr(pTHX)
3526 #ifndef HAS_GETENV_LEN
3528 Perl_getenv_len(pTHX_ char *env_elem, unsigned long *len)
3530 char *env_trans = PerlEnv_getenv(env_elem);
3532 *len = strlen(env_trans);
3539 Perl_get_vtbl(pTHX_ int vtbl_id)
3541 MGVTBL* result = Null(MGVTBL*);
3545 result = &PL_vtbl_sv;
3548 result = &PL_vtbl_env;
3550 case want_vtbl_envelem:
3551 result = &PL_vtbl_envelem;
3554 result = &PL_vtbl_sig;
3556 case want_vtbl_sigelem:
3557 result = &PL_vtbl_sigelem;
3559 case want_vtbl_pack:
3560 result = &PL_vtbl_pack;
3562 case want_vtbl_packelem:
3563 result = &PL_vtbl_packelem;
3565 case want_vtbl_dbline:
3566 result = &PL_vtbl_dbline;
3569 result = &PL_vtbl_isa;
3571 case want_vtbl_isaelem:
3572 result = &PL_vtbl_isaelem;
3574 case want_vtbl_arylen:
3575 result = &PL_vtbl_arylen;
3577 case want_vtbl_glob:
3578 result = &PL_vtbl_glob;
3580 case want_vtbl_mglob:
3581 result = &PL_vtbl_mglob;
3583 case want_vtbl_nkeys:
3584 result = &PL_vtbl_nkeys;
3586 case want_vtbl_taint:
3587 result = &PL_vtbl_taint;
3589 case want_vtbl_substr:
3590 result = &PL_vtbl_substr;
3593 result = &PL_vtbl_vec;
3596 result = &PL_vtbl_pos;
3599 result = &PL_vtbl_bm;
3602 result = &PL_vtbl_fm;
3604 case want_vtbl_uvar:
3605 result = &PL_vtbl_uvar;
3608 case want_vtbl_mutex:
3609 result = &PL_vtbl_mutex;
3612 case want_vtbl_defelem:
3613 result = &PL_vtbl_defelem;
3615 case want_vtbl_regexp:
3616 result = &PL_vtbl_regexp;
3618 case want_vtbl_regdata:
3619 result = &PL_vtbl_regdata;
3621 case want_vtbl_regdatum:
3622 result = &PL_vtbl_regdatum;
3624 #ifdef USE_LOCALE_COLLATE
3625 case want_vtbl_collxfrm:
3626 result = &PL_vtbl_collxfrm;
3629 case want_vtbl_amagic:
3630 result = &PL_vtbl_amagic;
3632 case want_vtbl_amagicelem:
3633 result = &PL_vtbl_amagicelem;
3635 case want_vtbl_backref:
3636 result = &PL_vtbl_backref;
3643 Perl_my_fflush_all(pTHX)
3646 return PerlIO_flush(NULL);
3649 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3650 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3651 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3653 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3654 open_max = sysconf(_SC_OPEN_MAX);
3657 open_max = FOPEN_MAX;
3660 open_max = OPEN_MAX;
3671 for (i = 0; i < open_max; i++)
3672 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3673 STDIO_STREAM_ARRAY[i]._file < open_max &&
3674 STDIO_STREAM_ARRAY[i]._flag)
3675 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3679 SETERRNO(EBADF,RMS$_IFI);
3685 Perl_my_atof(pTHX_ const char* s) {
3686 #ifdef USE_LOCALE_NUMERIC
3687 if ((PL_hints & HINT_LOCALE) && PL_numeric_local) {
3691 SET_NUMERIC_STANDARD();
3693 SET_NUMERIC_LOCAL();
3694 if ((y < 0.0 && y < x) || (y > 0.0 && y > x))
3699 return Perl_atof(s);
3701 return Perl_atof(s);