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(Perl_error_log,
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(Perl_error_log,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(Perl_error_log,
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(Perl_error_log,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(Perl_error_log,
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(Perl_error_log,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(Perl_debug_log, " 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(Perl_debug_log,"%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(Perl_debug_log,"%3ld ",
323 ? xycount[i][j] - lastxycount[i][j]
325 lastxycount[i][j] = xycount[i][j];
327 PerlIO_printf(Perl_debug_log, " . ", xycount[i][j]);
330 PerlIO_printf(Perl_debug_log, "\n");
334 PerlIO_printf(Perl_debug_log, "Total %7ld ", total);
335 for (j = 0; j < MAXYCOUNT; j++) {
337 PerlIO_printf(Perl_debug_log, "%3ld ", subtot[j]);
339 PerlIO_printf(Perl_debug_log, " . ");
342 PerlIO_printf(Perl_debug_log, "\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 */
547 #endif /* USE_LOCALE_NUMERIC */
551 * Set up for a new numeric locale.
554 Perl_new_numeric(pTHX_ const char *newnum)
556 #ifdef USE_LOCALE_NUMERIC
559 if (PL_numeric_name) {
560 Safefree(PL_numeric_name);
561 PL_numeric_name = NULL;
562 PL_numeric_standard = TRUE;
563 PL_numeric_local = TRUE;
568 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
569 Safefree(PL_numeric_name);
570 PL_numeric_name = savepv(newnum);
571 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
572 PL_numeric_local = TRUE;
576 #endif /* USE_LOCALE_NUMERIC */
580 Perl_set_numeric_standard(pTHX)
582 #ifdef USE_LOCALE_NUMERIC
584 if (! PL_numeric_standard) {
585 setlocale(LC_NUMERIC, "C");
586 PL_numeric_standard = TRUE;
587 PL_numeric_local = FALSE;
590 #endif /* USE_LOCALE_NUMERIC */
594 Perl_set_numeric_local(pTHX)
596 #ifdef USE_LOCALE_NUMERIC
598 if (! PL_numeric_local) {
599 setlocale(LC_NUMERIC, PL_numeric_name);
600 PL_numeric_standard = FALSE;
601 PL_numeric_local = TRUE;
605 #endif /* USE_LOCALE_NUMERIC */
609 * Initialize locale awareness.
612 Perl_init_i18nl10n(pTHX_ int printwarn)
616 * 1 = set ok or not applicable,
617 * 0 = fallback to C locale,
618 * -1 = fallback to C locale failed
623 #ifdef USE_LOCALE_CTYPE
624 char *curctype = NULL;
625 #endif /* USE_LOCALE_CTYPE */
626 #ifdef USE_LOCALE_COLLATE
627 char *curcoll = NULL;
628 #endif /* USE_LOCALE_COLLATE */
629 #ifdef USE_LOCALE_NUMERIC
631 #endif /* USE_LOCALE_NUMERIC */
633 char *language = PerlEnv_getenv("LANGUAGE");
635 char *lc_all = PerlEnv_getenv("LC_ALL");
636 char *lang = PerlEnv_getenv("LANG");
637 bool setlocale_failure = FALSE;
639 #ifdef LOCALE_ENVIRON_REQUIRED
642 * Ultrix setlocale(..., "") fails if there are no environment
643 * variables from which to get a locale name.
650 if (setlocale(LC_ALL, ""))
653 setlocale_failure = TRUE;
655 if (!setlocale_failure) {
656 #ifdef USE_LOCALE_CTYPE
659 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
661 setlocale_failure = TRUE;
662 #endif /* USE_LOCALE_CTYPE */
663 #ifdef USE_LOCALE_COLLATE
665 setlocale(LC_COLLATE,
666 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
668 setlocale_failure = TRUE;
669 #endif /* USE_LOCALE_COLLATE */
670 #ifdef USE_LOCALE_NUMERIC
672 setlocale(LC_NUMERIC,
673 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
675 setlocale_failure = TRUE;
676 #endif /* USE_LOCALE_NUMERIC */
681 #endif /* !LOCALE_ENVIRON_REQUIRED */
684 if (! setlocale(LC_ALL, ""))
685 setlocale_failure = TRUE;
688 if (!setlocale_failure) {
689 #ifdef USE_LOCALE_CTYPE
690 if (! (curctype = setlocale(LC_CTYPE, "")))
691 setlocale_failure = TRUE;
692 #endif /* USE_LOCALE_CTYPE */
693 #ifdef USE_LOCALE_COLLATE
694 if (! (curcoll = setlocale(LC_COLLATE, "")))
695 setlocale_failure = TRUE;
696 #endif /* USE_LOCALE_COLLATE */
697 #ifdef USE_LOCALE_NUMERIC
698 if (! (curnum = setlocale(LC_NUMERIC, "")))
699 setlocale_failure = TRUE;
700 #endif /* USE_LOCALE_NUMERIC */
703 if (setlocale_failure) {
705 bool locwarn = (printwarn > 1 ||
707 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
712 PerlIO_printf(Perl_error_log,
713 "perl: warning: Setting locale failed.\n");
717 PerlIO_printf(Perl_error_log,
718 "perl: warning: Setting locale failed for the categories:\n\t");
719 #ifdef USE_LOCALE_CTYPE
721 PerlIO_printf(Perl_error_log, "LC_CTYPE ");
722 #endif /* USE_LOCALE_CTYPE */
723 #ifdef USE_LOCALE_COLLATE
725 PerlIO_printf(Perl_error_log, "LC_COLLATE ");
726 #endif /* USE_LOCALE_COLLATE */
727 #ifdef USE_LOCALE_NUMERIC
729 PerlIO_printf(Perl_error_log, "LC_NUMERIC ");
730 #endif /* USE_LOCALE_NUMERIC */
731 PerlIO_printf(Perl_error_log, "\n");
735 PerlIO_printf(Perl_error_log,
736 "perl: warning: Please check that your locale settings:\n");
739 PerlIO_printf(Perl_error_log,
740 "\tLANGUAGE = %c%s%c,\n",
741 language ? '"' : '(',
742 language ? language : "unset",
743 language ? '"' : ')');
746 PerlIO_printf(Perl_error_log,
747 "\tLC_ALL = %c%s%c,\n",
749 lc_all ? lc_all : "unset",
754 for (e = environ; *e; e++) {
755 if (strnEQ(*e, "LC_", 3)
756 && strnNE(*e, "LC_ALL=", 7)
757 && (p = strchr(*e, '=')))
758 PerlIO_printf(Perl_error_log, "\t%.*s = \"%s\",\n",
759 (int)(p - *e), *e, p + 1);
763 PerlIO_printf(Perl_error_log,
766 lang ? lang : "unset",
769 PerlIO_printf(Perl_error_log,
770 " are supported and installed on your system.\n");
775 if (setlocale(LC_ALL, "C")) {
777 PerlIO_printf(Perl_error_log,
778 "perl: warning: Falling back to the standard locale (\"C\").\n");
783 PerlIO_printf(Perl_error_log,
784 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
791 #ifdef USE_LOCALE_CTYPE
792 || !(curctype || setlocale(LC_CTYPE, "C"))
793 #endif /* USE_LOCALE_CTYPE */
794 #ifdef USE_LOCALE_COLLATE
795 || !(curcoll || setlocale(LC_COLLATE, "C"))
796 #endif /* USE_LOCALE_COLLATE */
797 #ifdef USE_LOCALE_NUMERIC
798 || !(curnum || setlocale(LC_NUMERIC, "C"))
799 #endif /* USE_LOCALE_NUMERIC */
803 PerlIO_printf(Perl_error_log,
804 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
808 #endif /* ! LC_ALL */
810 #ifdef USE_LOCALE_CTYPE
811 curctype = setlocale(LC_CTYPE, Nullch);
812 #endif /* USE_LOCALE_CTYPE */
813 #ifdef USE_LOCALE_COLLATE
814 curcoll = setlocale(LC_COLLATE, Nullch);
815 #endif /* USE_LOCALE_COLLATE */
816 #ifdef USE_LOCALE_NUMERIC
817 curnum = setlocale(LC_NUMERIC, Nullch);
818 #endif /* USE_LOCALE_NUMERIC */
821 #ifdef USE_LOCALE_CTYPE
823 #endif /* USE_LOCALE_CTYPE */
825 #ifdef USE_LOCALE_COLLATE
826 new_collate(curcoll);
827 #endif /* USE_LOCALE_COLLATE */
829 #ifdef USE_LOCALE_NUMERIC
831 #endif /* USE_LOCALE_NUMERIC */
833 #endif /* USE_LOCALE */
838 /* Backwards compatibility. */
840 Perl_init_i18nl14n(pTHX_ int printwarn)
842 return init_i18nl10n(printwarn);
845 #ifdef USE_LOCALE_COLLATE
848 * mem_collxfrm() is a bit like strxfrm() but with two important
849 * differences. First, it handles embedded NULs. Second, it allocates
850 * a bit more memory than needed for the transformed data itself.
851 * The real transformed data begins at offset sizeof(collationix).
852 * Please see sv_collxfrm() to see how this is used.
855 Perl_mem_collxfrm(pTHX_ const char *s, STRLEN len, STRLEN *xlen)
858 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
860 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
861 /* the +1 is for the terminating NUL. */
863 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
864 New(171, xbuf, xAlloc, char);
868 *(U32*)xbuf = PL_collation_ix;
869 xout = sizeof(PL_collation_ix);
870 for (xin = 0; xin < len; ) {
874 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
877 if (xused < xAlloc - xout)
879 xAlloc = (2 * xAlloc) + 1;
880 Renew(xbuf, xAlloc, char);
885 xin += strlen(s + xin) + 1;
888 /* Embedded NULs are understood but silently skipped
889 * because they make no sense in locale collation. */
893 *xlen = xout - sizeof(PL_collation_ix);
902 #endif /* USE_LOCALE_COLLATE */
904 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
906 /* As a space optimization, we do not compile tables for strings of length
907 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
908 special-cased in fbm_instr().
910 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
913 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
922 if (flags & FBMcf_TAIL)
923 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
924 s = (U8*)SvPV_force(sv, len);
925 (void)SvUPGRADE(sv, SVt_PVBM);
926 if (len == 0) /* TAIL might be on on a zero-length string. */
936 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
937 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
938 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
939 memset((void*)table, mlen, 256);
940 table[-1] = (U8)flags;
942 sb = s - mlen + 1; /* first char (maybe) */
944 if (table[*s] == mlen)
949 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
952 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
953 for (i = 0; i < len; i++) {
954 if (PL_freq[s[i]] < frequency) {
956 frequency = PL_freq[s[i]];
959 BmRARE(sv) = s[rarest];
960 BmPREVIOUS(sv) = rarest;
961 BmUSEFUL(sv) = 100; /* Initial value */
962 if (flags & FBMcf_TAIL)
964 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
965 BmRARE(sv),BmPREVIOUS(sv)));
968 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
969 /* If SvTAIL is actually due to \Z or \z, this gives false positives
973 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
975 register unsigned char *s;
977 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
978 register STRLEN littlelen = l;
979 register I32 multiline = flags & FBMrf_MULTILINE;
981 if (bigend - big < littlelen) {
983 if ( SvTAIL(littlestr)
984 && (bigend - big == littlelen - 1)
986 || *big == *little && memEQ(big, little, littlelen - 1)))
991 if (littlelen <= 2) { /* Special-cased */
994 if (littlelen == 1) {
995 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
996 /* Know that bigend != big. */
997 if (bigend[-1] == '\n')
998 return (char *)(bigend - 1);
999 return (char *) bigend;
1002 while (s < bigend) {
1007 if (SvTAIL(littlestr))
1008 return (char *) bigend;
1012 return (char*)big; /* Cannot be SvTAIL! */
1014 /* littlelen is 2 */
1015 if (SvTAIL(littlestr) && !multiline) {
1016 if (bigend[-1] == '\n' && bigend[-2] == *little)
1017 return (char*)bigend - 2;
1018 if (bigend[-1] == *little)
1019 return (char*)bigend - 1;
1023 /* This should be better than FBM if c1 == c2, and almost
1024 as good otherwise: maybe better since we do less indirection.
1025 And we save a lot of memory by caching no table. */
1026 register unsigned char c1 = little[0];
1027 register unsigned char c2 = little[1];
1032 while (s <= bigend) {
1035 return (char*)s - 1;
1042 goto check_1char_anchor;
1053 goto check_1char_anchor;
1056 while (s <= bigend) {
1059 return (char*)s - 1;
1061 goto check_1char_anchor;
1070 check_1char_anchor: /* One char and anchor! */
1071 if (SvTAIL(littlestr) && (*bigend == *little))
1072 return (char *)bigend; /* bigend is already decremented. */
1075 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
1076 s = bigend - littlelen;
1077 if (s >= big && bigend[-1] == '\n' && *s == *little
1078 /* Automatically of length > 2 */
1079 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1081 return (char*)s; /* how sweet it is */
1084 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
1086 return (char*)s + 1; /* how sweet it is */
1090 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
1091 char *b = ninstr((char*)big,(char*)bigend,
1092 (char*)little, (char*)little + littlelen);
1094 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
1095 /* Chop \n from littlestr: */
1096 s = bigend - littlelen + 1;
1098 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1107 { /* Do actual FBM. */
1108 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
1109 register unsigned char *oldlittle;
1111 if (littlelen > bigend - big)
1113 --littlelen; /* Last char found by table lookup */
1115 s = big + littlelen;
1116 little += littlelen; /* last char */
1123 if ((tmp = table[*s])) {
1125 if (bigend - s > tmp) {
1131 if ((s += tmp) < bigend)
1136 else { /* less expensive than calling strncmp() */
1137 register unsigned char *olds = s;
1142 if (*--s == *--little)
1145 s = olds + 1; /* here we pay the price for failure */
1147 if (s < bigend) /* fake up continue to outer loop */
1155 if ( s == bigend && (table[-1] & FBMcf_TAIL)
1156 && memEQ(bigend - littlelen, oldlittle - littlelen, littlelen) )
1157 return (char*)bigend - littlelen;
1162 /* start_shift, end_shift are positive quantities which give offsets
1163 of ends of some substring of bigstr.
1164 If `last' we want the last occurence.
1165 old_posp is the way of communication between consequent calls if
1166 the next call needs to find the .
1167 The initial *old_posp should be -1.
1169 Note that we take into account SvTAIL, so one can get extra
1170 optimizations if _ALL flag is set.
1173 /* If SvTAIL is actually due to \Z or \z, this gives false positives
1174 if PL_multiline. In fact if !PL_multiline the autoritative answer
1175 is not supported yet. */
1178 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1181 register unsigned char *s, *x;
1182 register unsigned char *big;
1184 register I32 previous;
1186 register unsigned char *little;
1187 register I32 stop_pos;
1188 register unsigned char *littleend;
1192 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1193 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
1195 if ( BmRARE(littlestr) == '\n'
1196 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
1197 little = (unsigned char *)(SvPVX(littlestr));
1198 littleend = little + SvCUR(littlestr);
1205 little = (unsigned char *)(SvPVX(littlestr));
1206 littleend = little + SvCUR(littlestr);
1208 /* The value of pos we can start at: */
1209 previous = BmPREVIOUS(littlestr);
1210 big = (unsigned char *)(SvPVX(bigstr));
1211 /* The value of pos we can stop at: */
1212 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1213 if (previous + start_shift > stop_pos) {
1214 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
1218 while (pos < previous + start_shift) {
1219 if (!(pos += PL_screamnext[pos]))
1224 if (pos >= stop_pos) break;
1225 if (big[pos-previous] != first)
1227 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1233 if (s == littleend) {
1235 if (!last) return (char *)(big+pos-previous);
1238 } while ( pos += PL_screamnext[pos] );
1239 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1240 #else /* !POINTERRIGOR */
1243 if (pos >= stop_pos) break;
1244 if (big[pos] != first)
1246 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1252 if (s == littleend) {
1254 if (!last) return (char *)(big+pos);
1257 } while ( pos += PL_screamnext[pos] );
1259 return (char *)(big+(*old_posp));
1260 #endif /* POINTERRIGOR */
1262 if (!SvTAIL(littlestr) || (end_shift > 0))
1264 /* Ignore the trailing "\n". This code is not microoptimized */
1265 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
1266 stop_pos = littleend - little; /* Actual littlestr len */
1271 && ((stop_pos == 1) || memEQ(big + 1, little, stop_pos - 1)))
1277 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
1279 register U8 *a = (U8 *)s1;
1280 register U8 *b = (U8 *)s2;
1282 if (*a != *b && *a != PL_fold[*b])
1290 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
1292 register U8 *a = (U8 *)s1;
1293 register U8 *b = (U8 *)s2;
1295 if (*a != *b && *a != PL_fold_locale[*b])
1302 /* copy a string to a safe spot */
1305 Perl_savepv(pTHX_ const char *sv)
1307 register char *newaddr;
1309 New(902,newaddr,strlen(sv)+1,char);
1310 (void)strcpy(newaddr,sv);
1314 /* same thing but with a known length */
1317 Perl_savepvn(pTHX_ const char *sv, register I32 len)
1319 register char *newaddr;
1321 New(903,newaddr,len+1,char);
1322 Copy(sv,newaddr,len,char); /* might not be null terminated */
1323 newaddr[len] = '\0'; /* is now */
1327 /* the SV for Perl_form() and mess() is not kept in an arena */
1337 return sv_2mortal(newSVpvn("",0));
1342 /* Create as PVMG now, to avoid any upgrading later */
1343 New(905, sv, 1, SV);
1344 Newz(905, any, 1, XPVMG);
1345 SvFLAGS(sv) = SVt_PVMG;
1346 SvANY(sv) = (void*)any;
1347 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1352 #if defined(PERL_IMPLICIT_CONTEXT)
1354 Perl_form_nocontext(const char* pat, ...)
1359 va_start(args, pat);
1360 retval = vform(pat, &args);
1364 #endif /* PERL_IMPLICIT_CONTEXT */
1367 Perl_form(pTHX_ const char* pat, ...)
1371 va_start(args, pat);
1372 retval = vform(pat, &args);
1378 Perl_vform(pTHX_ const char *pat, va_list *args)
1380 SV *sv = mess_alloc();
1381 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1385 #if defined(PERL_IMPLICIT_CONTEXT)
1387 Perl_mess_nocontext(const char *pat, ...)
1392 va_start(args, pat);
1393 retval = vmess(pat, &args);
1397 #endif /* PERL_IMPLICIT_CONTEXT */
1400 Perl_mess(pTHX_ const char *pat, ...)
1404 va_start(args, pat);
1405 retval = vmess(pat, &args);
1411 Perl_vmess(pTHX_ const char *pat, va_list *args)
1413 SV *sv = mess_alloc();
1414 static char dgd[] = " during global destruction.\n";
1416 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1417 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1419 if (PL_curcop->cop_line)
1420 Perl_sv_catpvf(aTHX_ sv, " at %_ line %"IVdf,
1421 GvSV(PL_curcop->cop_filegv), (IV)PL_curcop->cop_line);
1422 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1423 bool line_mode = (RsSIMPLE(PL_rs) &&
1424 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1425 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1426 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1427 line_mode ? "line" : "chunk",
1428 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1432 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1434 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1440 Perl_vdie(pTHX_ const char* pat, va_list *args)
1444 int was_in_eval = PL_in_eval;
1451 DEBUG_S(PerlIO_printf(Perl_debug_log,
1452 "%p: die: curstack = %p, mainstack = %p\n",
1453 thr, PL_curstack, PL_mainstack));
1456 msv = vmess(pat, args);
1457 if (PL_errors && SvCUR(PL_errors)) {
1458 sv_catsv(PL_errors, msv);
1459 message = SvPV(PL_errors, msglen);
1460 SvCUR_set(PL_errors, 0);
1463 message = SvPV(msv,msglen);
1469 DEBUG_S(PerlIO_printf(Perl_debug_log,
1470 "%p: die: message = %s\ndiehook = %p\n",
1471 thr, message, PL_diehook));
1473 /* sv_2cv might call Perl_croak() */
1474 SV *olddiehook = PL_diehook;
1476 SAVESPTR(PL_diehook);
1477 PL_diehook = Nullsv;
1478 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1480 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1486 msg = newSVpvn(message, msglen);
1494 PUSHSTACKi(PERLSI_DIEHOOK);
1498 call_sv((SV*)cv, G_DISCARD);
1504 PL_restartop = die_where(message, msglen);
1505 DEBUG_S(PerlIO_printf(Perl_debug_log,
1506 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1507 thr, PL_restartop, was_in_eval, PL_top_env));
1508 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1510 return PL_restartop;
1513 #if defined(PERL_IMPLICIT_CONTEXT)
1515 Perl_die_nocontext(const char* pat, ...)
1520 va_start(args, pat);
1521 o = vdie(pat, &args);
1525 #endif /* PERL_IMPLICIT_CONTEXT */
1528 Perl_die(pTHX_ const char* pat, ...)
1532 va_start(args, pat);
1533 o = vdie(pat, &args);
1539 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1549 msv = vmess(pat, args);
1550 if (PL_errors && SvCUR(PL_errors)) {
1551 sv_catsv(PL_errors, msv);
1552 message = SvPV(PL_errors, msglen);
1553 SvCUR_set(PL_errors, 0);
1556 message = SvPV(msv,msglen);
1558 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%lx %s",
1559 (unsigned long) thr, message));
1562 /* sv_2cv might call Perl_croak() */
1563 SV *olddiehook = PL_diehook;
1565 SAVESPTR(PL_diehook);
1566 PL_diehook = Nullsv;
1567 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1569 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1574 msg = newSVpvn(message, msglen);
1578 PUSHSTACKi(PERLSI_DIEHOOK);
1582 call_sv((SV*)cv, G_DISCARD);
1588 PL_restartop = die_where(message, msglen);
1593 /* SFIO can really mess with your errno */
1596 PerlIO *serr = Perl_error_log;
1598 PerlIO_write(serr, message, msglen);
1599 (void)PerlIO_flush(serr);
1607 #if defined(PERL_IMPLICIT_CONTEXT)
1609 Perl_croak_nocontext(const char *pat, ...)
1613 va_start(args, pat);
1618 #endif /* PERL_IMPLICIT_CONTEXT */
1621 Perl_croak(pTHX_ const char *pat, ...)
1624 va_start(args, pat);
1631 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1640 msv = vmess(pat, args);
1641 message = SvPV(msv, msglen);
1644 /* sv_2cv might call Perl_warn() */
1646 SV *oldwarnhook = PL_warnhook;
1648 SAVESPTR(PL_warnhook);
1649 PL_warnhook = Nullsv;
1650 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1652 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1657 msg = newSVpvn(message, msglen);
1661 PUSHSTACKi(PERLSI_WARNHOOK);
1665 call_sv((SV*)cv, G_DISCARD);
1672 PerlIO *serr = Perl_error_log;
1674 PerlIO_write(serr, message, msglen);
1676 DEBUG_L(*message == '!'
1677 ? (xstat(message[1]=='!'
1678 ? (message[2]=='!' ? 2 : 1)
1683 (void)PerlIO_flush(serr);
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(Perl_debug_log, "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);
1777 PerlIO *serr = Perl_error_log;
1778 PerlIO_write(serr, message, msglen);
1779 (void)PerlIO_flush(serr);
1786 /* sv_2cv might call Perl_warn() */
1788 SV *oldwarnhook = PL_warnhook;
1790 SAVESPTR(PL_warnhook);
1791 PL_warnhook = Nullsv;
1792 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1794 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1799 msg = newSVpvn(message, msglen);
1806 call_sv((SV*)cv, G_DISCARD);
1813 PerlIO *serr = Perl_error_log;
1814 PerlIO_write(serr, message, msglen);
1818 (void)PerlIO_flush(serr);
1823 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1824 #if !defined(WIN32) && !defined(CYGWIN)
1826 Perl_my_setenv(pTHX_ char *nam, char *val)
1828 #ifndef PERL_USE_SAFE_PUTENV
1829 /* most putenv()s leak, so we manipulate environ directly */
1830 register I32 i=setenv_getix(nam); /* where does it go? */
1832 if (environ == PL_origenviron) { /* need we copy environment? */
1838 for (max = i; environ[max]; max++) ;
1839 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1840 for (j=0; j<max; j++) { /* copy environment */
1841 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1842 strcpy(tmpenv[j], environ[j]);
1844 tmpenv[max] = Nullch;
1845 environ = tmpenv; /* tell exec where it is now */
1848 safesysfree(environ[i]);
1849 while (environ[i]) {
1850 environ[i] = environ[i+1];
1855 if (!environ[i]) { /* does not exist yet */
1856 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1857 environ[i+1] = Nullch; /* make sure it's null terminated */
1860 safesysfree(environ[i]);
1861 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1863 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1865 #else /* PERL_USE_SAFE_PUTENV */
1868 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1869 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1870 (void)putenv(new_env);
1871 #endif /* PERL_USE_SAFE_PUTENV */
1874 #else /* WIN32 || CYGWIN */
1877 * Save environ of perl.exe, currently Cygwin links in separate environ's
1878 * for each exe/dll. Probably should be a member of impure_ptr.
1880 static char ***Perl_main_environ;
1883 Perl_my_setenv_init(char ***penviron)
1885 Perl_main_environ = penviron;
1889 my_setenv(char *nam, char *val)
1891 /* You can not directly manipulate the environ[] array because
1892 * the routines do some additional work that syncs the Cygwin
1893 * environment with the Windows environment.
1895 char *oldstr = environ[setenv_getix(nam)];
1904 setenv(nam, val, 1);
1905 environ = *Perl_main_environ; /* environ realloc can occur in setenv */
1906 if(oldstr && environ[setenv_getix(nam)] != oldstr)
1909 #else /* if WIN32 */
1912 Perl_my_setenv(pTHX_ char *nam,char *val)
1915 #ifdef USE_WIN32_RTL_ENV
1917 register char *envstr;
1918 STRLEN namlen = strlen(nam);
1920 char *oldstr = environ[setenv_getix(nam)];
1922 /* putenv() has totally broken semantics in both the Borland
1923 * and Microsoft CRTLs. They either store the passed pointer in
1924 * the environment without making a copy, or make a copy and don't
1925 * free it. And on top of that, they dont free() old entries that
1926 * are being replaced/deleted. This means the caller must
1927 * free any old entries somehow, or we end up with a memory
1928 * leak every time my_setenv() is called. One might think
1929 * one could directly manipulate environ[], like the UNIX code
1930 * above, but direct changes to environ are not allowed when
1931 * calling putenv(), since the RTLs maintain an internal
1932 * *copy* of environ[]. Bad, bad, *bad* stink.
1943 vallen = strlen(val);
1944 envstr = (char*)safesysmalloc((namlen + vallen + 3) * sizeof(char));
1945 (void)sprintf(envstr,"%s=%s",nam,val);
1946 (void)PerlEnv_putenv(envstr);
1948 safesysfree(oldstr);
1950 safesysfree(envstr); /* MSVCRT leaks without this */
1953 #else /* !USE_WIN32_RTL_ENV */
1955 register char *envstr;
1956 STRLEN len = strlen(nam) + 3;
1961 New(904, envstr, len, char);
1962 (void)sprintf(envstr,"%s=%s",nam,val);
1963 (void)PerlEnv_putenv(envstr);
1973 Perl_setenv_getix(pTHX_ char *nam)
1975 register I32 i, len = strlen(nam);
1977 for (i = 0; environ[i]; i++) {
1980 strnicmp(environ[i],nam,len) == 0
1982 strnEQ(environ[i],nam,len)
1984 && environ[i][len] == '=')
1985 break; /* strnEQ must come first to avoid */
1986 } /* potential SEGV's */
1992 #ifdef UNLINK_ALL_VERSIONS
1994 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1998 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
2003 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
2005 Perl_my_bcopy(pTHX_ register const char *from,register char *to,register I32 len)
2009 if (from - to >= 0) {
2017 *(--to) = *(--from);
2025 Perl_my_memset(pTHX_ register char *loc, register I32 ch, register I32 len)
2035 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2037 Perl_my_bzero(pTHX_ register char *loc, register I32 len)
2047 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2049 Perl_my_memcmp(pTHX_ const char *s1, const char *s2, register I32 len)
2051 register U8 *a = (U8 *)s1;
2052 register U8 *b = (U8 *)s2;
2056 if (tmp = *a++ - *b++)
2061 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2065 #ifdef USE_CHAR_VSPRINTF
2070 vsprintf(char *dest, const char *pat, char *args)
2074 fakebuf._ptr = dest;
2075 fakebuf._cnt = 32767;
2079 fakebuf._flag = _IOWRT|_IOSTRG;
2080 _doprnt(pat, args, &fakebuf); /* what a kludge */
2081 (void)putc('\0', &fakebuf);
2082 #ifdef USE_CHAR_VSPRINTF
2085 return 0; /* perl doesn't use return value */
2089 #endif /* HAS_VPRINTF */
2092 #if BYTEORDER != 0x4321
2094 Perl_my_swap(pTHX_ short s)
2096 #if (BYTEORDER & 1) == 0
2099 result = ((s & 255) << 8) + ((s >> 8) & 255);
2107 Perl_my_htonl(pTHX_ long l)
2111 char c[sizeof(long)];
2114 #if BYTEORDER == 0x1234
2115 u.c[0] = (l >> 24) & 255;
2116 u.c[1] = (l >> 16) & 255;
2117 u.c[2] = (l >> 8) & 255;
2121 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2122 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2127 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2128 u.c[o & 0xf] = (l >> s) & 255;
2136 Perl_my_ntohl(pTHX_ long l)
2140 char c[sizeof(long)];
2143 #if BYTEORDER == 0x1234
2144 u.c[0] = (l >> 24) & 255;
2145 u.c[1] = (l >> 16) & 255;
2146 u.c[2] = (l >> 8) & 255;
2150 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2151 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2158 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2159 l |= (u.c[o & 0xf] & 255) << s;
2166 #endif /* BYTEORDER != 0x4321 */
2170 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2171 * If these functions are defined,
2172 * the BYTEORDER is neither 0x1234 nor 0x4321.
2173 * However, this is not assumed.
2177 #define HTOV(name,type) \
2179 name (register type n) \
2183 char c[sizeof(type)]; \
2187 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2188 u.c[i] = (n >> s) & 0xFF; \
2193 #define VTOH(name,type) \
2195 name (register type n) \
2199 char c[sizeof(type)]; \
2205 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2206 n += (u.c[i] & 0xFF) << s; \
2211 #if defined(HAS_HTOVS) && !defined(htovs)
2214 #if defined(HAS_HTOVL) && !defined(htovl)
2217 #if defined(HAS_VTOHS) && !defined(vtohs)
2220 #if defined(HAS_VTOHL) && !defined(vtohl)
2224 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2225 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2227 Perl_my_popen(pTHX_ char *cmd, char *mode)
2230 register I32 This, that;
2233 I32 doexec = strNE(cmd,"-");
2237 PERL_FLUSHALL_FOR_CHILD;
2240 return my_syspopen(cmd,mode);
2243 This = (*mode == 'w');
2245 if (doexec && PL_tainting) {
2247 taint_proper("Insecure %s%s", "EXEC");
2249 if (PerlProc_pipe(p) < 0)
2251 if (doexec && PerlProc_pipe(pp) >= 0)
2253 while ((pid = (doexec?vfork():fork())) < 0) {
2254 if (errno != EAGAIN) {
2255 PerlLIO_close(p[This]);
2257 PerlLIO_close(pp[0]);
2258 PerlLIO_close(pp[1]);
2261 Perl_croak(aTHX_ "Can't fork");
2273 PerlLIO_close(p[THAT]);
2275 PerlLIO_close(pp[0]);
2276 #if defined(HAS_FCNTL) && defined(F_SETFD)
2277 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2280 if (p[THIS] != (*mode == 'r')) {
2281 PerlLIO_dup2(p[THIS], *mode == 'r');
2282 PerlLIO_close(p[THIS]);
2286 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2292 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2296 do_exec3(cmd,pp[1],did_pipes); /* may or may not use the shell */
2299 #endif /* defined OS2 */
2301 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
2302 sv_setiv(GvSV(tmpgv), getpid());
2304 hv_clear(PL_pidstatus); /* we have no children */
2309 do_execfree(); /* free any memory malloced by child on vfork */
2310 PerlLIO_close(p[that]);
2312 PerlLIO_close(pp[1]);
2313 if (p[that] < p[This]) {
2314 PerlLIO_dup2(p[This], p[that]);
2315 PerlLIO_close(p[This]);
2318 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2319 (void)SvUPGRADE(sv,SVt_IV);
2321 PL_forkprocess = pid;
2322 if (did_pipes && pid > 0) {
2326 while (n < sizeof(int)) {
2327 n1 = PerlLIO_read(pp[0],
2328 (void*)(((char*)&errkid)+n),
2334 PerlLIO_close(pp[0]);
2336 if (n) { /* Error */
2337 if (n != sizeof(int))
2338 Perl_croak(aTHX_ "panic: kid popen errno read");
2339 errno = errkid; /* Propagate errno from kid */
2344 PerlLIO_close(pp[0]);
2345 return PerlIO_fdopen(p[This], mode);
2348 #if defined(atarist) || defined(DJGPP)
2351 Perl_my_popen(pTHX_ char *cmd, char *mode)
2353 /* Needs work for PerlIO ! */
2354 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
2355 PERL_FLUSHALL_FOR_CHILD;
2356 return popen(PerlIO_exportFILE(cmd, 0), mode);
2360 #endif /* !DOSISH */
2364 Perl_dump_fds(pTHX_ char *s)
2367 struct stat tmpstatbuf;
2369 PerlIO_printf(Perl_debug_log,"%s", s);
2370 for (fd = 0; fd < 32; fd++) {
2371 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2372 PerlIO_printf(Perl_debug_log," %d",fd);
2374 PerlIO_printf(Perl_debug_log,"\n");
2376 #endif /* DUMP_FDS */
2380 dup2(int oldfd, int newfd)
2382 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2385 PerlLIO_close(newfd);
2386 return fcntl(oldfd, F_DUPFD, newfd);
2388 #define DUP2_MAX_FDS 256
2389 int fdtmp[DUP2_MAX_FDS];
2395 PerlLIO_close(newfd);
2396 /* good enough for low fd's... */
2397 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2398 if (fdx >= DUP2_MAX_FDS) {
2406 PerlLIO_close(fdtmp[--fdx]);
2413 #ifdef HAS_SIGACTION
2416 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2418 struct sigaction act, oact;
2420 act.sa_handler = handler;
2421 sigemptyset(&act.sa_mask);
2424 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2427 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2428 act.sa_flags |= SA_NOCLDWAIT;
2430 if (sigaction(signo, &act, &oact) == -1)
2433 return oact.sa_handler;
2437 Perl_rsignal_state(pTHX_ int signo)
2439 struct sigaction oact;
2441 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2444 return oact.sa_handler;
2448 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2450 struct sigaction act;
2452 act.sa_handler = handler;
2453 sigemptyset(&act.sa_mask);
2456 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2459 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2460 act.sa_flags |= SA_NOCLDWAIT;
2462 return sigaction(signo, &act, save);
2466 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2468 return sigaction(signo, save, (struct sigaction *)NULL);
2471 #else /* !HAS_SIGACTION */
2474 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2476 return PerlProc_signal(signo, handler);
2479 static int sig_trapped;
2489 Perl_rsignal_state(pTHX_ int signo)
2491 Sighandler_t oldsig;
2494 oldsig = PerlProc_signal(signo, sig_trap);
2495 PerlProc_signal(signo, oldsig);
2497 PerlProc_kill(getpid(), signo);
2502 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2504 *save = PerlProc_signal(signo, handler);
2505 return (*save == SIG_ERR) ? -1 : 0;
2509 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2511 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2514 #endif /* !HAS_SIGACTION */
2516 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2517 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2519 Perl_my_pclose(pTHX_ PerlIO *ptr)
2521 Sigsave_t hstat, istat, qstat;
2529 int saved_vaxc_errno;
2532 int saved_win32_errno;
2535 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2538 *svp = &PL_sv_undef;
2540 if (pid == -1) { /* Opened by popen. */
2541 return my_syspclose(ptr);
2544 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2545 saved_errno = errno;
2547 saved_vaxc_errno = vaxc$errno;
2550 saved_win32_errno = GetLastError();
2554 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2556 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2557 rsignal_save(SIGINT, SIG_IGN, &istat);
2558 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2560 pid2 = wait4pid(pid, &status, 0);
2561 } while (pid2 == -1 && errno == EINTR);
2562 rsignal_restore(SIGHUP, &hstat);
2563 rsignal_restore(SIGINT, &istat);
2564 rsignal_restore(SIGQUIT, &qstat);
2566 SETERRNO(saved_errno, saved_vaxc_errno);
2569 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2571 #endif /* !DOSISH */
2573 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2575 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2579 char spid[TYPE_CHARS(int)];
2584 sprintf(spid, "%d", pid);
2585 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2586 if (svp && *svp != &PL_sv_undef) {
2587 *statusp = SvIVX(*svp);
2588 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2595 hv_iterinit(PL_pidstatus);
2596 if (entry = hv_iternext(PL_pidstatus)) {
2597 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2598 sv = hv_iterval(PL_pidstatus,entry);
2599 *statusp = SvIVX(sv);
2600 sprintf(spid, "%d", pid);
2601 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2606 # ifdef HAS_WAITPID_RUNTIME
2607 if (!HAS_WAITPID_RUNTIME)
2610 return PerlProc_waitpid(pid,statusp,flags);
2612 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2613 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2615 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2620 Perl_croak(aTHX_ "Can't do waitpid with flags");
2622 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2623 pidgone(result,*statusp);
2631 #endif /* !DOSISH || OS2 || WIN32 */
2635 Perl_pidgone(pTHX_ Pid_t pid, int status)
2638 char spid[TYPE_CHARS(int)];
2640 sprintf(spid, "%d", pid);
2641 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2642 (void)SvUPGRADE(sv,SVt_IV);
2647 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2650 int /* Cannot prototype with I32
2652 my_syspclose(PerlIO *ptr)
2655 Perl_my_pclose(pTHX_ PerlIO *ptr)
2658 /* Needs work for PerlIO ! */
2659 FILE *f = PerlIO_findFILE(ptr);
2660 I32 result = pclose(f);
2662 result = (result << 8) & 0xff00;
2664 PerlIO_releaseFILE(ptr,f);
2670 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2673 register const char *frombase = from;
2676 register const char c = *from;
2681 while (count-- > 0) {
2682 for (todo = len; todo > 0; todo--) {
2690 Perl_cast_ulong(pTHX_ NV f)
2695 # define BIGDOUBLE 2147483648.0
2697 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2700 return (unsigned long)f;
2702 return (unsigned long)along;
2706 /* Unfortunately, on some systems the cast_uv() function doesn't
2707 work with the system-supplied definition of ULONG_MAX. The
2708 comparison (f >= ULONG_MAX) always comes out true. It must be a
2709 problem with the compiler constant folding.
2711 In any case, this workaround should be fine on any two's complement
2712 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2714 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2717 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2719 -- Kenneth Albanowski <kjahds@kjahds.com>
2723 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2727 Perl_cast_i32(pTHX_ NV f)
2730 return (I32) I32_MAX;
2732 return (I32) I32_MIN;
2737 Perl_cast_iv(pTHX_ NV f)
2742 if (f >= (NV)UV_MAX)
2753 Perl_cast_uv(pTHX_ NV f)
2756 return (UV) MY_UV_MAX;
2770 Perl_same_dirent(pTHX_ char *a, char *b)
2772 char *fa = strrchr(a,'/');
2773 char *fb = strrchr(b,'/');
2774 struct stat tmpstatbuf1;
2775 struct stat tmpstatbuf2;
2776 SV *tmpsv = sv_newmortal();
2789 sv_setpv(tmpsv, ".");
2791 sv_setpvn(tmpsv, a, fa - a);
2792 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2795 sv_setpv(tmpsv, ".");
2797 sv_setpvn(tmpsv, b, fb - b);
2798 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2800 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2801 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2803 #endif /* !HAS_RENAME */
2806 Perl_scan_bin(pTHX_ char *start, I32 len, I32 *retlen)
2808 register char *s = start;
2809 register NV rnv = 0.0;
2810 register UV ruv = 0;
2811 register bool seenb = FALSE;
2812 register bool overflowed = FALSE;
2814 for (; len-- && *s; s++) {
2815 if (!(*s == '0' || *s == '1')) {
2817 continue; /* Note: does not check for __ and the like. */
2818 if (seenb == FALSE && *s == 'b' && ruv == 0) {
2819 /* Disallow 0bbb0b0bbb... */
2825 if (ckWARN(WARN_DIGIT))
2826 Perl_warner(aTHX_ WARN_DIGIT,
2827 "Illegal binary digit '%c' ignored", *s);
2832 register UV xuv = ruv << 1;
2834 if ((xuv >> 1) != ruv) {
2838 if (ckWARN_d(WARN_OVERFLOW))
2839 Perl_warner(aTHX_ WARN_OVERFLOW,
2840 "Integer overflow in binary number");
2842 ruv = xuv | (*s - '0');
2846 /* If an NV has not enough bits in its mantissa to
2847 * represent an UV this summing of small low-order numbers
2848 * is a waste of time (because the NV cannot preserve
2849 * the low-order bits anyway): we could just remember when
2850 * did we overflow and in the end just multiply rnv by the
2857 if ( ( overflowed && rnv > 4294967295.0)
2859 || (!overflowed && ruv > 0xffffffff )
2863 if (ckWARN(WARN_PORTABLE))
2864 Perl_warner(aTHX_ WARN_PORTABLE,
2865 "Binary number > 0b11111111111111111111111111111111 non-portable");
2867 *retlen = s - start;
2872 Perl_scan_oct(pTHX_ char *start, I32 len, I32 *retlen)
2874 register char *s = start;
2875 register NV rnv = 0.0;
2876 register UV ruv = 0;
2877 register bool overflowed = FALSE;
2879 for (; len-- && *s; s++) {
2880 if (!(*s >= '0' && *s <= '7')) {
2882 continue; /* Note: does not check for __ and the like. */
2884 /* Allow \octal to work the DWIM way (that is, stop scanning
2885 * as soon as non-octal characters are seen, complain only iff
2886 * someone seems to want to use the digits eight and nine). */
2887 if (*s == '8' || *s == '9') {
2889 if (ckWARN(WARN_DIGIT))
2890 Perl_warner(aTHX_ WARN_DIGIT,
2891 "Illegal octal digit '%c' ignored", *s);
2897 register UV xuv = ruv << 3;
2899 if ((xuv >> 3) != ruv) {
2903 if (ckWARN_d(WARN_OVERFLOW))
2904 Perl_warner(aTHX_ WARN_OVERFLOW,
2905 "Integer overflow in octal number");
2907 ruv = xuv | (*s - '0');
2911 /* If an NV has not enough bits in its mantissa to
2912 * represent an UV this summing of small low-order numbers
2913 * is a waste of time (because the NV cannot preserve
2914 * the low-order bits anyway): we could just remember when
2915 * did we overflow and in the end just multiply rnv by the
2916 * right amount of 8-tuples. */
2917 rnv += (NV)(*s - '0');
2922 if ( ( overflowed && rnv > 4294967295.0)
2924 || (!overflowed && ruv > 0xffffffff )
2928 if (ckWARN(WARN_PORTABLE))
2929 Perl_warner(aTHX_ WARN_PORTABLE,
2930 "Octal number > 037777777777 non-portable");
2932 *retlen = s - start;
2937 Perl_scan_hex(pTHX_ char *start, I32 len, I32 *retlen)
2939 register char *s = start;
2940 register NV rnv = 0.0;
2941 register UV ruv = 0;
2942 register bool seenx = FALSE;
2943 register bool overflowed = FALSE;
2946 for (; len-- && *s; s++) {
2947 hexdigit = strchr((char *) PL_hexdigit, *s);
2950 continue; /* Note: does not check for __ and the like. */
2951 if (seenx == FALSE && *s == 'x' && ruv == 0) {
2952 /* Disallow 0xxx0x0xxx... */
2958 if (ckWARN(WARN_DIGIT))
2959 Perl_warner(aTHX_ WARN_DIGIT,
2960 "Illegal hexadecimal digit '%c' ignored", *s);
2965 register UV xuv = ruv << 4;
2967 if ((xuv >> 4) != ruv) {
2971 if (ckWARN_d(WARN_OVERFLOW))
2972 Perl_warner(aTHX_ WARN_OVERFLOW,
2973 "Integer overflow in hexadecimal number");
2975 ruv = xuv | ((hexdigit - PL_hexdigit) & 15);
2979 /* If an NV has not enough bits in its mantissa to
2980 * represent an UV this summing of small low-order numbers
2981 * is a waste of time (because the NV cannot preserve
2982 * the low-order bits anyway): we could just remember when
2983 * did we overflow and in the end just multiply rnv by the
2984 * right amount of 16-tuples. */
2985 rnv += (NV)((hexdigit - PL_hexdigit) & 15);
2990 if ( ( overflowed && rnv > 4294967295.0)
2992 || (!overflowed && ruv > 0xffffffff )
2996 if (ckWARN(WARN_PORTABLE))
2997 Perl_warner(aTHX_ WARN_PORTABLE,
2998 "Hexadecimal number > 0xffffffff non-portable");
3000 *retlen = s - start;
3005 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
3008 char *xfound = Nullch;
3009 char *xfailed = Nullch;
3010 char tmpbuf[MAXPATHLEN];
3014 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3015 # define SEARCH_EXTS ".bat", ".cmd", NULL
3016 # define MAX_EXT_LEN 4
3019 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3020 # define MAX_EXT_LEN 4
3023 # define SEARCH_EXTS ".pl", ".com", NULL
3024 # define MAX_EXT_LEN 4
3026 /* additional extensions to try in each dir if scriptname not found */
3028 char *exts[] = { SEARCH_EXTS };
3029 char **ext = search_ext ? search_ext : exts;
3030 int extidx = 0, i = 0;
3031 char *curext = Nullch;
3033 # define MAX_EXT_LEN 0
3037 * If dosearch is true and if scriptname does not contain path
3038 * delimiters, search the PATH for scriptname.
3040 * If SEARCH_EXTS is also defined, will look for each
3041 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3042 * while searching the PATH.
3044 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3045 * proceeds as follows:
3046 * If DOSISH or VMSISH:
3047 * + look for ./scriptname{,.foo,.bar}
3048 * + search the PATH for scriptname{,.foo,.bar}
3051 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3052 * this will not look in '.' if it's not in the PATH)
3057 # ifdef ALWAYS_DEFTYPES
3058 len = strlen(scriptname);
3059 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3060 int hasdir, idx = 0, deftypes = 1;
3063 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
3066 int hasdir, idx = 0, deftypes = 1;
3069 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
3071 /* The first time through, just add SEARCH_EXTS to whatever we
3072 * already have, so we can check for default file types. */
3074 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3080 if ((strlen(tmpbuf) + strlen(scriptname)
3081 + MAX_EXT_LEN) >= sizeof tmpbuf)
3082 continue; /* don't search dir with too-long name */
3083 strcat(tmpbuf, scriptname);
3087 if (strEQ(scriptname, "-"))
3089 if (dosearch) { /* Look in '.' first. */
3090 char *cur = scriptname;
3092 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3094 if (strEQ(ext[i++],curext)) {
3095 extidx = -1; /* already has an ext */
3100 DEBUG_p(PerlIO_printf(Perl_debug_log,
3101 "Looking for %s\n",cur));
3102 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3103 && !S_ISDIR(PL_statbuf.st_mode)) {
3111 if (cur == scriptname) {
3112 len = strlen(scriptname);
3113 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3115 cur = strcpy(tmpbuf, scriptname);
3117 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3118 && strcpy(tmpbuf+len, ext[extidx++]));
3123 if (dosearch && !strchr(scriptname, '/')
3125 && !strchr(scriptname, '\\')
3127 && (s = PerlEnv_getenv("PATH"))) {
3130 PL_bufend = s + strlen(s);
3131 while (s < PL_bufend) {
3132 #if defined(atarist) || defined(DOSISH)
3137 && *s != ';'; len++, s++) {
3138 if (len < sizeof tmpbuf)
3141 if (len < sizeof tmpbuf)
3143 #else /* ! (atarist || DOSISH) */
3144 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3147 #endif /* ! (atarist || DOSISH) */
3150 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3151 continue; /* don't search dir with too-long name */
3153 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3154 && tmpbuf[len - 1] != '/'
3155 && tmpbuf[len - 1] != '\\'
3158 tmpbuf[len++] = '/';
3159 if (len == 2 && tmpbuf[0] == '.')
3161 (void)strcpy(tmpbuf + len, scriptname);
3165 len = strlen(tmpbuf);
3166 if (extidx > 0) /* reset after previous loop */
3170 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3171 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3172 if (S_ISDIR(PL_statbuf.st_mode)) {
3176 } while ( retval < 0 /* not there */
3177 && extidx>=0 && ext[extidx] /* try an extension? */
3178 && strcpy(tmpbuf+len, ext[extidx++])
3183 if (S_ISREG(PL_statbuf.st_mode)
3184 && cando(S_IRUSR,TRUE,&PL_statbuf)
3186 && cando(S_IXUSR,TRUE,&PL_statbuf)
3190 xfound = tmpbuf; /* bingo! */
3194 xfailed = savepv(tmpbuf);
3197 if (!xfound && !seen_dot && !xfailed &&
3198 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3199 || S_ISDIR(PL_statbuf.st_mode)))
3201 seen_dot = 1; /* Disable message. */
3203 if (flags & 1) { /* do or die? */
3204 Perl_croak(aTHX_ "Can't %s %s%s%s",
3205 (xfailed ? "execute" : "find"),
3206 (xfailed ? xfailed : scriptname),
3207 (xfailed ? "" : " on PATH"),
3208 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3210 scriptname = Nullch;
3214 scriptname = xfound;
3216 return (scriptname ? savepv(scriptname) : Nullch);
3222 /* Very simplistic scheduler for now */
3226 thr = thr->i.next_run;
3230 Perl_cond_init(pTHX_ perl_cond *cp)
3236 Perl_cond_signal(pTHX_ perl_cond *cp)
3239 perl_cond cond = *cp;
3244 /* Insert t in the runnable queue just ahead of us */
3245 t->i.next_run = thr->i.next_run;
3246 thr->i.next_run->i.prev_run = t;
3247 t->i.prev_run = thr;
3248 thr->i.next_run = t;
3249 thr->i.wait_queue = 0;
3250 /* Remove from the wait queue */
3256 Perl_cond_broadcast(pTHX_ perl_cond *cp)
3259 perl_cond cond, cond_next;
3261 for (cond = *cp; cond; cond = cond_next) {
3263 /* Insert t in the runnable queue just ahead of us */
3264 t->i.next_run = thr->i.next_run;
3265 thr->i.next_run->i.prev_run = t;
3266 t->i.prev_run = thr;
3267 thr->i.next_run = t;
3268 thr->i.wait_queue = 0;
3269 /* Remove from the wait queue */
3270 cond_next = cond->next;
3277 Perl_cond_wait(pTHX_ perl_cond *cp)
3281 if (thr->i.next_run == thr)
3282 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
3284 New(666, cond, 1, struct perl_wait_queue);
3288 thr->i.wait_queue = cond;
3289 /* Remove ourselves from runnable queue */
3290 thr->i.next_run->i.prev_run = thr->i.prev_run;
3291 thr->i.prev_run->i.next_run = thr->i.next_run;
3293 #endif /* FAKE_THREADS */
3295 #ifdef PTHREAD_GETSPECIFIC_INT
3296 struct perl_thread *
3301 if (pthread_getspecific(PL_thr_key, &t))
3302 Perl_croak(aTHX_ "panic: pthread_getspecific");
3303 return (struct perl_thread *) t;
3308 Perl_condpair_magic(pTHX_ SV *sv)
3312 SvUPGRADE(sv, SVt_PVMG);
3313 mg = mg_find(sv, 'm');
3317 New(53, cp, 1, condpair_t);
3318 MUTEX_INIT(&cp->mutex);
3319 COND_INIT(&cp->owner_cond);
3320 COND_INIT(&cp->cond);
3322 MUTEX_LOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3323 mg = mg_find(sv, 'm');
3325 /* someone else beat us to initialising it */
3326 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3327 MUTEX_DESTROY(&cp->mutex);
3328 COND_DESTROY(&cp->owner_cond);
3329 COND_DESTROY(&cp->cond);
3333 sv_magic(sv, Nullsv, 'm', 0, 0);
3335 mg->mg_ptr = (char *)cp;
3336 mg->mg_len = sizeof(cp);
3337 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3338 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
3339 "%p: condpair_magic %p\n", thr, sv));)
3346 * Make a new perl thread structure using t as a prototype. Some of the
3347 * fields for the new thread are copied from the prototype thread, t,
3348 * so t should not be running in perl at the time this function is
3349 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3350 * thread calling new_struct_thread) clearly satisfies this constraint.
3352 struct perl_thread *
3353 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3355 #if !defined(PERL_IMPLICIT_CONTEXT)
3356 struct perl_thread *thr;
3362 sv = newSVpvn("", 0);
3363 SvGROW(sv, sizeof(struct perl_thread) + 1);
3364 SvCUR_set(sv, sizeof(struct perl_thread));
3365 thr = (Thread) SvPVX(sv);
3367 memset(thr, 0xab, sizeof(struct perl_thread));
3374 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3376 Zero(thr, 1, struct perl_thread);
3379 PL_protect = MEMBER_TO_FPTR(Perl_default_protect);
3384 PL_curcop = &PL_compiling;
3385 thr->interp = t->interp;
3386 thr->cvcache = newHV();
3387 thr->threadsv = newAV();
3388 thr->specific = newAV();
3389 thr->errsv = newSVpvn("", 0);
3390 thr->flags = THRf_R_JOINABLE;
3391 MUTEX_INIT(&thr->mutex);
3393 /* top_env needs to be non-zero. It points to an area
3394 in which longjmp() stuff is stored, as C callstack
3395 info there at least is thread specific this has to
3396 be per-thread. Otherwise a 'die' in a thread gives
3397 that thread the C stack of last thread to do an eval {}!
3398 See comments in scope.h
3399 Initialize top entry (as in perl.c for main thread)
3401 PL_start_env.je_prev = NULL;
3402 PL_start_env.je_ret = -1;
3403 PL_start_env.je_mustcatch = TRUE;
3404 PL_top_env = &PL_start_env;
3406 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR) */
3409 PL_statname = NEWSV(66,0);
3410 PL_errors = newSVpvn("", 0);
3412 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3413 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3414 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3415 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3416 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3418 PL_reginterp_cnt = 0;
3419 PL_lastscream = Nullsv;
3422 PL_reg_start_tmp = 0;
3423 PL_reg_start_tmpl = 0;
3424 PL_reg_poscache = Nullch;
3426 /* parent thread's data needs to be locked while we make copy */
3427 MUTEX_LOCK(&t->mutex);
3429 PL_protect = t->Tprotect;
3431 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3432 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3433 PL_curstash = t->Tcurstash; /* always be set to main? */
3435 PL_tainted = t->Ttainted;
3436 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3437 PL_nrs = newSVsv(t->Tnrs);
3438 PL_rs = SvREFCNT_inc(PL_nrs);
3439 PL_last_in_gv = Nullgv;
3440 PL_ofslen = t->Tofslen;
3441 PL_ofs = savepvn(t->Tofs, PL_ofslen);
3442 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3443 PL_chopset = t->Tchopset;
3444 PL_formtarget = newSVsv(t->Tformtarget);
3445 PL_bodytarget = newSVsv(t->Tbodytarget);
3446 PL_toptarget = newSVsv(t->Ttoptarget);
3448 /* Initialise all per-thread SVs that the template thread used */
3449 svp = AvARRAY(t->threadsv);
3450 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3451 if (*svp && *svp != &PL_sv_undef) {
3452 SV *sv = newSVsv(*svp);
3453 av_store(thr->threadsv, i, sv);
3454 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
3455 DEBUG_S(PerlIO_printf(Perl_debug_log,
3456 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
3459 thr->threadsvp = AvARRAY(thr->threadsv);
3461 MUTEX_LOCK(&PL_threads_mutex);
3463 thr->tid = ++PL_threadnum;
3464 thr->next = t->next;
3467 thr->next->prev = thr;
3468 MUTEX_UNLOCK(&PL_threads_mutex);
3470 /* done copying parent's state */
3471 MUTEX_UNLOCK(&t->mutex);
3473 #ifdef HAVE_THREAD_INTERN
3474 Perl_init_thread_intern(thr);
3475 #endif /* HAVE_THREAD_INTERN */
3478 #endif /* USE_THREADS */
3482 * This hack is to force load of "huge" support from libm.a
3483 * So it is in perl for (say) POSIX to use.
3484 * Needed for SunOS with Sun's 'acc' for example.
3493 #ifdef PERL_GLOBAL_STRUCT
3502 Perl_get_op_names(pTHX)
3508 Perl_get_op_descs(pTHX)
3514 Perl_get_no_modify(pTHX)
3516 return (char*)PL_no_modify;
3520 Perl_get_opargs(pTHX)
3526 Perl_get_ppaddr(pTHX)
3531 #ifndef HAS_GETENV_LEN
3533 Perl_getenv_len(pTHX_ char *env_elem, unsigned long *len)
3535 char *env_trans = PerlEnv_getenv(env_elem);
3537 *len = strlen(env_trans);
3544 Perl_get_vtbl(pTHX_ int vtbl_id)
3546 MGVTBL* result = Null(MGVTBL*);
3550 result = &PL_vtbl_sv;
3553 result = &PL_vtbl_env;
3555 case want_vtbl_envelem:
3556 result = &PL_vtbl_envelem;
3559 result = &PL_vtbl_sig;
3561 case want_vtbl_sigelem:
3562 result = &PL_vtbl_sigelem;
3564 case want_vtbl_pack:
3565 result = &PL_vtbl_pack;
3567 case want_vtbl_packelem:
3568 result = &PL_vtbl_packelem;
3570 case want_vtbl_dbline:
3571 result = &PL_vtbl_dbline;
3574 result = &PL_vtbl_isa;
3576 case want_vtbl_isaelem:
3577 result = &PL_vtbl_isaelem;
3579 case want_vtbl_arylen:
3580 result = &PL_vtbl_arylen;
3582 case want_vtbl_glob:
3583 result = &PL_vtbl_glob;
3585 case want_vtbl_mglob:
3586 result = &PL_vtbl_mglob;
3588 case want_vtbl_nkeys:
3589 result = &PL_vtbl_nkeys;
3591 case want_vtbl_taint:
3592 result = &PL_vtbl_taint;
3594 case want_vtbl_substr:
3595 result = &PL_vtbl_substr;
3598 result = &PL_vtbl_vec;
3601 result = &PL_vtbl_pos;
3604 result = &PL_vtbl_bm;
3607 result = &PL_vtbl_fm;
3609 case want_vtbl_uvar:
3610 result = &PL_vtbl_uvar;
3613 case want_vtbl_mutex:
3614 result = &PL_vtbl_mutex;
3617 case want_vtbl_defelem:
3618 result = &PL_vtbl_defelem;
3620 case want_vtbl_regexp:
3621 result = &PL_vtbl_regexp;
3623 case want_vtbl_regdata:
3624 result = &PL_vtbl_regdata;
3626 case want_vtbl_regdatum:
3627 result = &PL_vtbl_regdatum;
3629 #ifdef USE_LOCALE_COLLATE
3630 case want_vtbl_collxfrm:
3631 result = &PL_vtbl_collxfrm;
3634 case want_vtbl_amagic:
3635 result = &PL_vtbl_amagic;
3637 case want_vtbl_amagicelem:
3638 result = &PL_vtbl_amagicelem;
3640 case want_vtbl_backref:
3641 result = &PL_vtbl_backref;
3648 Perl_my_fflush_all(pTHX)
3651 return PerlIO_flush(NULL);
3654 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3655 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3656 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3658 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3659 open_max = sysconf(_SC_OPEN_MAX);
3662 open_max = FOPEN_MAX;
3665 open_max = OPEN_MAX;
3676 for (i = 0; i < open_max; i++)
3677 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3678 STDIO_STREAM_ARRAY[i]._file < open_max &&
3679 STDIO_STREAM_ARRAY[i]._flag)
3680 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3684 SETERRNO(EBADF,RMS$_IFI);
3690 Perl_my_atof(pTHX_ const char* s) {
3691 #ifdef USE_LOCALE_NUMERIC
3692 if ((PL_hints & HINT_LOCALE) && PL_numeric_local) {
3696 SET_NUMERIC_STANDARD();
3698 SET_NUMERIC_LOCAL();
3699 if ((y < 0.0 && y < x) || (y > 0.0 && y > x))
3704 return Perl_atof(s);
3706 return Perl_atof(s);