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)
87 PerlIO_printf(PerlIO_stderr(),
88 "Allocation too large: %lx\n", size) FLUSH;
91 #endif /* HAS_64K_LIMIT */
94 Perl_croak_nocontext("panic: malloc");
96 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
97 #if !(defined(I286) || defined(atarist))
98 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
100 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
107 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
108 WITH_THX(my_exit(1));
114 /* paranoid version of system's realloc() */
117 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
120 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
121 Malloc_t PerlMem_realloc();
122 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
126 PerlIO_printf(PerlIO_stderr(),
127 "Reallocation too large: %lx\n", size) FLUSH;
128 WITH_THX(my_exit(1));
130 #endif /* HAS_64K_LIMIT */
137 return safesysmalloc(size);
140 Perl_croak_nocontext("panic: realloc");
142 ptr = PerlMem_realloc(where,size);
144 #if !(defined(I286) || defined(atarist))
146 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,PL_an++);
147 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
151 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,PL_an++);
152 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
161 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
162 WITH_THX(my_exit(1));
168 /* safe version of system's free() */
171 Perl_safesysfree(Malloc_t where)
173 #if !(defined(I286) || defined(atarist))
174 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,PL_an++));
176 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,PL_an++));
184 /* safe version of system's calloc() */
187 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
192 if (size * count > 0xffff) {
193 PerlIO_printf(PerlIO_stderr(),
194 "Allocation too large: %lx\n", size * count) FLUSH;
195 WITH_THX(my_exit(1));
197 #endif /* HAS_64K_LIMIT */
199 if ((long)size < 0 || (long)count < 0)
200 Perl_croak_nocontext("panic: calloc");
203 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
204 #if !(defined(I286) || defined(atarist))
205 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
207 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
210 memset((void*)ptr, 0, size);
216 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
217 WITH_THX(my_exit(1));
225 struct mem_test_strut {
233 # define ALIGN sizeof(struct mem_test_strut)
235 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
236 # define typeof_chunk(ch) \
237 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
238 # define set_typeof_chunk(ch,t) \
239 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
240 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
243 ? ((size) - 1)/8 + 5 \
247 Perl_safexmalloc(I32 x, MEM_SIZE size)
249 register char* where = (char*)safemalloc(size + ALIGN);
252 xycount[x][SIZE_TO_Y(size)]++;
253 set_typeof_chunk(where, x);
254 sizeof_chunk(where) = size;
255 return (Malloc_t)(where + ALIGN);
259 Perl_safexrealloc(Malloc_t wh, MEM_SIZE size)
261 char *where = (char*)wh;
264 return safexmalloc(0,size);
267 MEM_SIZE old = sizeof_chunk(where - ALIGN);
268 int t = typeof_chunk(where - ALIGN);
269 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
271 xycount[t][SIZE_TO_Y(old)]--;
272 xycount[t][SIZE_TO_Y(size)]++;
273 xcount[t] += size - old;
274 sizeof_chunk(new) = size;
275 return (Malloc_t)(new + ALIGN);
280 Perl_safexfree(Malloc_t wh)
283 char *where = (char*)wh;
289 size = sizeof_chunk(where);
290 x = where[0] + 100 * where[1];
292 xycount[x][SIZE_TO_Y(size)]--;
297 Perl_safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
299 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
301 xycount[x][SIZE_TO_Y(size)]++;
302 memset((void*)(where + ALIGN), 0, size * count);
303 set_typeof_chunk(where, x);
304 sizeof_chunk(where) = size;
305 return (Malloc_t)(where + ALIGN);
309 S_xstat(pTHX_ int flag)
311 register I32 i, j, total = 0;
312 I32 subtot[MAXYCOUNT];
314 for (j = 0; j < MAXYCOUNT; j++) {
318 PerlIO_printf(PerlIO_stderr(), " Id subtot 4 8 12 16 20 24 28 32 36 40 48 56 64 72 80 80+\n", total);
319 for (i = 0; i < MAXXCOUNT; i++) {
321 for (j = 0; j < MAXYCOUNT; j++) {
322 subtot[j] += xycount[i][j];
325 ? xcount[i] /* Have something */
327 ? xcount[i] != lastxcount[i] /* Changed */
328 : xcount[i] > lastxcount[i])) { /* Growed */
329 PerlIO_printf(PerlIO_stderr(),"%2d %02d %7ld ", i / 100, i % 100,
330 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
331 lastxcount[i] = xcount[i];
332 for (j = 0; j < MAXYCOUNT; j++) {
334 ? xycount[i][j] /* Have something */
336 ? xycount[i][j] != lastxycount[i][j] /* Changed */
337 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
338 PerlIO_printf(PerlIO_stderr(),"%3ld ",
340 ? xycount[i][j] - lastxycount[i][j]
342 lastxycount[i][j] = xycount[i][j];
344 PerlIO_printf(PerlIO_stderr(), " . ", xycount[i][j]);
347 PerlIO_printf(PerlIO_stderr(), "\n");
351 PerlIO_printf(PerlIO_stderr(), "Total %7ld ", total);
352 for (j = 0; j < MAXYCOUNT; j++) {
354 PerlIO_printf(PerlIO_stderr(), "%3ld ", subtot[j]);
356 PerlIO_printf(PerlIO_stderr(), " . ");
359 PerlIO_printf(PerlIO_stderr(), "\n");
363 #endif /* LEAKTEST */
365 /* copy a string up to some (non-backslashed) delimiter, if any */
368 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
371 for (tolen = 0; from < fromend; from++, tolen++) {
373 if (from[1] == delim)
382 else if (*from == delim)
393 /* return ptr to little string in big string, NULL if not found */
394 /* This routine was donated by Corey Satten. */
397 Perl_instr(pTHX_ register const char *big, register const char *little)
399 register const char *s, *x;
410 for (x=big,s=little; *s; /**/ ) {
419 return (char*)(big-1);
424 /* same as instr but allow embedded nulls */
427 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
429 register const char *s, *x;
430 register I32 first = *little;
431 register const char *littleend = lend;
433 if (!first && little >= littleend)
435 if (bigend - big < littleend - little)
437 bigend -= littleend - little++;
438 while (big <= bigend) {
441 for (x=big,s=little; s < littleend; /**/ ) {
448 return (char*)(big-1);
453 /* reverse of the above--find last substring */
456 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
458 register const char *bigbeg;
459 register const char *s, *x;
460 register I32 first = *little;
461 register const char *littleend = lend;
463 if (!first && little >= littleend)
464 return (char*)bigend;
466 big = bigend - (littleend - little++);
467 while (big >= bigbeg) {
470 for (x=big+2,s=little; s < littleend; /**/ ) {
477 return (char*)(big+1);
483 * Set up for a new ctype locale.
486 Perl_new_ctype(pTHX_ const char *newctype)
488 #ifdef USE_LOCALE_CTYPE
492 for (i = 0; i < 256; i++) {
494 PL_fold_locale[i] = toLOWER_LC(i);
495 else if (isLOWER_LC(i))
496 PL_fold_locale[i] = toUPPER_LC(i);
498 PL_fold_locale[i] = i;
501 #endif /* USE_LOCALE_CTYPE */
505 * Set up for a new collation locale.
508 Perl_new_collate(pTHX_ const char *newcoll)
510 #ifdef USE_LOCALE_COLLATE
513 if (PL_collation_name) {
515 Safefree(PL_collation_name);
516 PL_collation_name = NULL;
517 PL_collation_standard = TRUE;
518 PL_collxfrm_base = 0;
519 PL_collxfrm_mult = 2;
524 if (! PL_collation_name || strNE(PL_collation_name, newcoll)) {
526 Safefree(PL_collation_name);
527 PL_collation_name = savepv(newcoll);
528 PL_collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
531 /* 2: at most so many chars ('a', 'b'). */
532 /* 50: surely no system expands a char more. */
533 #define XFRMBUFSIZE (2 * 50)
534 char xbuf[XFRMBUFSIZE];
535 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
536 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
537 SSize_t mult = fb - fa;
539 Perl_croak(aTHX_ "strxfrm() gets absurd");
540 PL_collxfrm_base = (fa > mult) ? (fa - mult) : 0;
541 PL_collxfrm_mult = mult;
545 #endif /* USE_LOCALE_COLLATE */
549 Perl_set_numeric_radix(pTHX)
551 #ifdef USE_LOCALE_NUMERIC
552 # ifdef HAS_LOCALECONV
556 if (lc && lc->decimal_point)
557 /* We assume that decimal separator aka the radix
558 * character is always a single character. If it
559 * ever is a string, this needs to be rethunk. */
560 PL_numeric_radix = *lc->decimal_point;
562 PL_numeric_radix = 0;
563 # endif /* HAS_LOCALECONV */
565 PL_numeric_radix = 0;
566 #endif /* USE_LOCALE_NUMERIC */
570 * Set up for a new numeric locale.
573 Perl_new_numeric(pTHX_ const char *newnum)
575 #ifdef USE_LOCALE_NUMERIC
578 if (PL_numeric_name) {
579 Safefree(PL_numeric_name);
580 PL_numeric_name = NULL;
581 PL_numeric_standard = TRUE;
582 PL_numeric_local = TRUE;
587 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
588 Safefree(PL_numeric_name);
589 PL_numeric_name = savepv(newnum);
590 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
591 PL_numeric_local = TRUE;
595 #endif /* USE_LOCALE_NUMERIC */
599 Perl_set_numeric_standard(pTHX)
601 #ifdef USE_LOCALE_NUMERIC
603 if (! PL_numeric_standard) {
604 setlocale(LC_NUMERIC, "C");
605 PL_numeric_standard = TRUE;
606 PL_numeric_local = FALSE;
609 #endif /* USE_LOCALE_NUMERIC */
613 Perl_set_numeric_local(pTHX)
615 #ifdef USE_LOCALE_NUMERIC
617 if (! PL_numeric_local) {
618 setlocale(LC_NUMERIC, PL_numeric_name);
619 PL_numeric_standard = FALSE;
620 PL_numeric_local = TRUE;
624 #endif /* USE_LOCALE_NUMERIC */
628 * Initialize locale awareness.
631 Perl_init_i18nl10n(pTHX_ int printwarn)
635 * 1 = set ok or not applicable,
636 * 0 = fallback to C locale,
637 * -1 = fallback to C locale failed
642 #ifdef USE_LOCALE_CTYPE
643 char *curctype = NULL;
644 #endif /* USE_LOCALE_CTYPE */
645 #ifdef USE_LOCALE_COLLATE
646 char *curcoll = NULL;
647 #endif /* USE_LOCALE_COLLATE */
648 #ifdef USE_LOCALE_NUMERIC
650 #endif /* USE_LOCALE_NUMERIC */
652 char *language = PerlEnv_getenv("LANGUAGE");
654 char *lc_all = PerlEnv_getenv("LC_ALL");
655 char *lang = PerlEnv_getenv("LANG");
656 bool setlocale_failure = FALSE;
658 #ifdef LOCALE_ENVIRON_REQUIRED
661 * Ultrix setlocale(..., "") fails if there are no environment
662 * variables from which to get a locale name.
669 if (setlocale(LC_ALL, ""))
672 setlocale_failure = TRUE;
674 if (!setlocale_failure) {
675 #ifdef USE_LOCALE_CTYPE
678 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
680 setlocale_failure = TRUE;
681 #endif /* USE_LOCALE_CTYPE */
682 #ifdef USE_LOCALE_COLLATE
684 setlocale(LC_COLLATE,
685 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
687 setlocale_failure = TRUE;
688 #endif /* USE_LOCALE_COLLATE */
689 #ifdef USE_LOCALE_NUMERIC
691 setlocale(LC_NUMERIC,
692 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
694 setlocale_failure = TRUE;
695 #endif /* USE_LOCALE_NUMERIC */
700 #endif /* !LOCALE_ENVIRON_REQUIRED */
703 if (! setlocale(LC_ALL, ""))
704 setlocale_failure = TRUE;
707 if (!setlocale_failure) {
708 #ifdef USE_LOCALE_CTYPE
709 if (! (curctype = setlocale(LC_CTYPE, "")))
710 setlocale_failure = TRUE;
711 #endif /* USE_LOCALE_CTYPE */
712 #ifdef USE_LOCALE_COLLATE
713 if (! (curcoll = setlocale(LC_COLLATE, "")))
714 setlocale_failure = TRUE;
715 #endif /* USE_LOCALE_COLLATE */
716 #ifdef USE_LOCALE_NUMERIC
717 if (! (curnum = setlocale(LC_NUMERIC, "")))
718 setlocale_failure = TRUE;
719 #endif /* USE_LOCALE_NUMERIC */
722 if (setlocale_failure) {
724 bool locwarn = (printwarn > 1 ||
726 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
731 PerlIO_printf(PerlIO_stderr(),
732 "perl: warning: Setting locale failed.\n");
736 PerlIO_printf(PerlIO_stderr(),
737 "perl: warning: Setting locale failed for the categories:\n\t");
738 #ifdef USE_LOCALE_CTYPE
740 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
741 #endif /* USE_LOCALE_CTYPE */
742 #ifdef USE_LOCALE_COLLATE
744 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
745 #endif /* USE_LOCALE_COLLATE */
746 #ifdef USE_LOCALE_NUMERIC
748 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
749 #endif /* USE_LOCALE_NUMERIC */
750 PerlIO_printf(PerlIO_stderr(), "\n");
754 PerlIO_printf(PerlIO_stderr(),
755 "perl: warning: Please check that your locale settings:\n");
758 PerlIO_printf(PerlIO_stderr(),
759 "\tLANGUAGE = %c%s%c,\n",
760 language ? '"' : '(',
761 language ? language : "unset",
762 language ? '"' : ')');
765 PerlIO_printf(PerlIO_stderr(),
766 "\tLC_ALL = %c%s%c,\n",
768 lc_all ? lc_all : "unset",
773 for (e = environ; *e; e++) {
774 if (strnEQ(*e, "LC_", 3)
775 && strnNE(*e, "LC_ALL=", 7)
776 && (p = strchr(*e, '=')))
777 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
778 (int)(p - *e), *e, p + 1);
782 PerlIO_printf(PerlIO_stderr(),
785 lang ? lang : "unset",
788 PerlIO_printf(PerlIO_stderr(),
789 " are supported and installed on your system.\n");
794 if (setlocale(LC_ALL, "C")) {
796 PerlIO_printf(PerlIO_stderr(),
797 "perl: warning: Falling back to the standard locale (\"C\").\n");
802 PerlIO_printf(PerlIO_stderr(),
803 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
810 #ifdef USE_LOCALE_CTYPE
811 || !(curctype || setlocale(LC_CTYPE, "C"))
812 #endif /* USE_LOCALE_CTYPE */
813 #ifdef USE_LOCALE_COLLATE
814 || !(curcoll || setlocale(LC_COLLATE, "C"))
815 #endif /* USE_LOCALE_COLLATE */
816 #ifdef USE_LOCALE_NUMERIC
817 || !(curnum || setlocale(LC_NUMERIC, "C"))
818 #endif /* USE_LOCALE_NUMERIC */
822 PerlIO_printf(PerlIO_stderr(),
823 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
827 #endif /* ! LC_ALL */
829 #ifdef USE_LOCALE_CTYPE
830 curctype = setlocale(LC_CTYPE, Nullch);
831 #endif /* USE_LOCALE_CTYPE */
832 #ifdef USE_LOCALE_COLLATE
833 curcoll = setlocale(LC_COLLATE, Nullch);
834 #endif /* USE_LOCALE_COLLATE */
835 #ifdef USE_LOCALE_NUMERIC
836 curnum = setlocale(LC_NUMERIC, Nullch);
837 #endif /* USE_LOCALE_NUMERIC */
840 #ifdef USE_LOCALE_CTYPE
842 #endif /* USE_LOCALE_CTYPE */
844 #ifdef USE_LOCALE_COLLATE
845 new_collate(curcoll);
846 #endif /* USE_LOCALE_COLLATE */
848 #ifdef USE_LOCALE_NUMERIC
850 #endif /* USE_LOCALE_NUMERIC */
852 #endif /* USE_LOCALE */
857 /* Backwards compatibility. */
859 Perl_init_i18nl14n(pTHX_ int printwarn)
861 return init_i18nl10n(printwarn);
864 #ifdef USE_LOCALE_COLLATE
867 * mem_collxfrm() is a bit like strxfrm() but with two important
868 * differences. First, it handles embedded NULs. Second, it allocates
869 * a bit more memory than needed for the transformed data itself.
870 * The real transformed data begins at offset sizeof(collationix).
871 * Please see sv_collxfrm() to see how this is used.
874 Perl_mem_collxfrm(pTHX_ const char *s, STRLEN len, STRLEN *xlen)
877 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
879 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
880 /* the +1 is for the terminating NUL. */
882 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
883 New(171, xbuf, xAlloc, char);
887 *(U32*)xbuf = PL_collation_ix;
888 xout = sizeof(PL_collation_ix);
889 for (xin = 0; xin < len; ) {
893 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
896 if (xused < xAlloc - xout)
898 xAlloc = (2 * xAlloc) + 1;
899 Renew(xbuf, xAlloc, char);
904 xin += strlen(s + xin) + 1;
907 /* Embedded NULs are understood but silently skipped
908 * because they make no sense in locale collation. */
912 *xlen = xout - sizeof(PL_collation_ix);
921 #endif /* USE_LOCALE_COLLATE */
923 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
925 /* As a space optimization, we do not compile tables for strings of length
926 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
927 special-cased in fbm_instr().
929 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
932 Perl_fbm_compile(pTHX_ SV *sv, U32 flags /* not used yet */)
941 if (flags & FBMcf_TAIL)
942 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
943 s = (U8*)SvPV_force(sv, len);
944 (void)SvUPGRADE(sv, SVt_PVBM);
945 if (len == 0) /* TAIL might be on on a zero-length string. */
953 Sv_Grow(sv,len + 256 + FBM_TABLE_OFFSET);
954 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
955 s = table - 1 - FBM_TABLE_OFFSET; /* Last char */
956 for (i = 0; i < 256; i++) {
959 table[-1] = flags; /* Not used yet */
963 if (table[*s] == mlen)
968 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
971 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
972 for (i = 0; i < len; i++) {
973 if (PL_freq[s[i]] < frequency) {
975 frequency = PL_freq[s[i]];
978 BmRARE(sv) = s[rarest];
979 BmPREVIOUS(sv) = rarest;
980 BmUSEFUL(sv) = 100; /* Initial value */
981 if (flags & FBMcf_TAIL)
983 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
986 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
987 /* If SvTAIL is actually due to \Z or \z, this gives false positives
991 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
993 register unsigned char *s;
995 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
996 register STRLEN littlelen = l;
997 register I32 multiline = flags & FBMrf_MULTILINE;
999 if (bigend - big < littlelen) {
1001 if ( SvTAIL(littlestr)
1002 && (bigend - big == littlelen - 1)
1004 || *big == *little && memEQ(big, little, littlelen - 1)))
1009 if (littlelen <= 2) { /* Special-cased */
1012 if (littlelen == 1) {
1013 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
1014 /* Know that bigend != big. */
1015 if (bigend[-1] == '\n')
1016 return (char *)(bigend - 1);
1017 return (char *) bigend;
1020 while (s < bigend) {
1025 if (SvTAIL(littlestr))
1026 return (char *) bigend;
1030 return (char*)big; /* Cannot be SvTAIL! */
1032 /* littlelen is 2 */
1033 if (SvTAIL(littlestr) && !multiline) {
1034 if (bigend[-1] == '\n' && bigend[-2] == *little)
1035 return (char*)bigend - 2;
1036 if (bigend[-1] == *little)
1037 return (char*)bigend - 1;
1041 /* This should be better than FBM if c1 == c2, and almost
1042 as good otherwise: maybe better since we do less indirection.
1043 And we save a lot of memory by caching no table. */
1044 register unsigned char c1 = little[0];
1045 register unsigned char c2 = little[1];
1050 while (s <= bigend) {
1053 return (char*)s - 1;
1060 goto check_1char_anchor;
1071 goto check_1char_anchor;
1074 while (s <= bigend) {
1077 return (char*)s - 1;
1079 goto check_1char_anchor;
1088 check_1char_anchor: /* One char and anchor! */
1089 if (SvTAIL(littlestr) && (*bigend == *little))
1090 return (char *)bigend; /* bigend is already decremented. */
1093 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
1094 s = bigend - littlelen;
1096 && bigend[-1] == '\n'
1098 /* Automatically of length > 2 */
1099 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1100 return (char*)s; /* how sweet it is */
1101 if (s[1] == *little && memEQ((char*)s + 2,(char*)little + 1,
1103 return (char*)s + 1; /* how sweet it is */
1106 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
1107 char *b = ninstr((char*)big,(char*)bigend,
1108 (char*)little, (char*)little + littlelen);
1110 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
1111 /* Chop \n from littlestr: */
1112 s = bigend - littlelen + 1;
1113 if (*s == *little && memEQ((char*)s + 1, (char*)little + 1,
1121 { /* Do actual FBM. */
1122 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
1123 register unsigned char *oldlittle;
1125 if (littlelen > bigend - big)
1127 --littlelen; /* Last char found by table lookup */
1129 s = big + littlelen;
1130 little += littlelen; /* last char */
1137 if (tmp = table[*s]) {
1139 if (bigend - s > tmp) {
1145 if ((s += tmp) < bigend)
1150 else { /* less expensive than calling strncmp() */
1151 register unsigned char *olds = s;
1156 if (*--s == *--little)
1159 s = olds + 1; /* here we pay the price for failure */
1161 if (s < bigend) /* fake up continue to outer loop */
1169 if ( s == bigend && (table[-1] & FBMcf_TAIL)
1170 && memEQ(bigend - littlelen, oldlittle - littlelen, littlelen) )
1171 return (char*)bigend - littlelen;
1176 /* start_shift, end_shift are positive quantities which give offsets
1177 of ends of some substring of bigstr.
1178 If `last' we want the last occurence.
1179 old_posp is the way of communication between consequent calls if
1180 the next call needs to find the .
1181 The initial *old_posp should be -1.
1183 Note that we take into account SvTAIL, so one can get extra
1184 optimizations if _ALL flag is set.
1187 /* If SvTAIL is actually due to \Z or \z, this gives false positives
1188 if PL_multiline. In fact if !PL_multiline the autoritative answer
1189 is not supported yet. */
1192 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1195 register unsigned char *s, *x;
1196 register unsigned char *big;
1198 register I32 previous;
1200 register unsigned char *little;
1201 register I32 stop_pos;
1202 register unsigned char *littleend;
1206 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1207 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
1209 if ( BmRARE(littlestr) == '\n'
1210 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
1211 little = (unsigned char *)(SvPVX(littlestr));
1212 littleend = little + SvCUR(littlestr);
1219 little = (unsigned char *)(SvPVX(littlestr));
1220 littleend = little + SvCUR(littlestr);
1222 /* The value of pos we can start at: */
1223 previous = BmPREVIOUS(littlestr);
1224 big = (unsigned char *)(SvPVX(bigstr));
1225 /* The value of pos we can stop at: */
1226 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1227 if (previous + start_shift > stop_pos) {
1228 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
1232 while (pos < previous + start_shift) {
1233 if (!(pos += PL_screamnext[pos]))
1238 if (pos >= stop_pos) break;
1239 if (big[pos-previous] != first)
1241 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1247 if (s == littleend) {
1249 if (!last) return (char *)(big+pos-previous);
1252 } while ( pos += PL_screamnext[pos] );
1253 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1254 #else /* !POINTERRIGOR */
1257 if (pos >= stop_pos) break;
1258 if (big[pos] != first)
1260 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1266 if (s == littleend) {
1268 if (!last) return (char *)(big+pos);
1271 } while ( pos += PL_screamnext[pos] );
1273 return (char *)(big+(*old_posp));
1274 #endif /* POINTERRIGOR */
1276 if (!SvTAIL(littlestr) || (end_shift > 0))
1278 /* Ignore the trailing "\n". This code is not microoptimized */
1279 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
1280 stop_pos = littleend - little; /* Actual littlestr len */
1285 && ((stop_pos == 1) || memEQ(big + 1, little, stop_pos - 1)))
1291 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
1293 register U8 *a = (U8 *)s1;
1294 register U8 *b = (U8 *)s2;
1296 if (*a != *b && *a != PL_fold[*b])
1304 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
1306 register U8 *a = (U8 *)s1;
1307 register U8 *b = (U8 *)s2;
1309 if (*a != *b && *a != PL_fold_locale[*b])
1316 /* copy a string to a safe spot */
1319 Perl_savepv(pTHX_ const char *sv)
1321 register char *newaddr;
1323 New(902,newaddr,strlen(sv)+1,char);
1324 (void)strcpy(newaddr,sv);
1328 /* same thing but with a known length */
1331 Perl_savepvn(pTHX_ const char *sv, register I32 len)
1333 register char *newaddr;
1335 New(903,newaddr,len+1,char);
1336 Copy(sv,newaddr,len,char); /* might not be null terminated */
1337 newaddr[len] = '\0'; /* is now */
1341 /* the SV for Perl_form() and mess() is not kept in an arena */
1351 return sv_2mortal(newSVpvn("",0));
1356 /* Create as PVMG now, to avoid any upgrading later */
1357 New(905, sv, 1, SV);
1358 Newz(905, any, 1, XPVMG);
1359 SvFLAGS(sv) = SVt_PVMG;
1360 SvANY(sv) = (void*)any;
1361 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1366 #if defined(PERL_IMPLICIT_CONTEXT)
1368 Perl_form_nocontext(const char* pat, ...)
1373 va_start(args, pat);
1374 retval = vform(pat, &args);
1378 #endif /* PERL_IMPLICIT_CONTEXT */
1381 Perl_form(pTHX_ const char* pat, ...)
1385 va_start(args, pat);
1386 retval = vform(pat, &args);
1392 Perl_vform(pTHX_ const char *pat, va_list *args)
1394 SV *sv = mess_alloc();
1395 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1400 Perl_mess(pTHX_ const char *pat, va_list *args)
1402 SV *sv = mess_alloc();
1403 static char dgd[] = " during global destruction.\n";
1405 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1406 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1408 if (PL_curcop->cop_line)
1410 Perl_sv_catpvf(aTHX_ sv, " at %_ line %" PERL_PRId64,
1411 GvSV(PL_curcop->cop_filegv), (IV)PL_curcop->cop_line);
1413 Perl_sv_catpvf(aTHX_ sv, " at %_ line %ld",
1414 GvSV(PL_curcop->cop_filegv), (long)PL_curcop->cop_line);
1416 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1417 bool line_mode = (RsSIMPLE(PL_rs) &&
1418 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1420 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %" PERL_PRId64,
1421 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1422 line_mode ? "line" : "chunk",
1423 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1425 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %ld",
1426 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1427 line_mode ? "line" : "chunk",
1428 (long)IoLINES(GvIOp(PL_last_in_gv)));
1433 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1435 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1441 Perl_vdie(pTHX_ const char* pat, va_list *args)
1445 int was_in_eval = PL_in_eval;
1452 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1453 "%p: die: curstack = %p, mainstack = %p\n",
1454 thr, PL_curstack, PL_mainstack));
1457 msv = mess(pat, args);
1458 message = SvPV(msv,msglen);
1464 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1465 "%p: die: message = %s\ndiehook = %p\n",
1466 thr, message, PL_diehook));
1468 /* sv_2cv might call Perl_croak() */
1469 SV *olddiehook = PL_diehook;
1471 SAVESPTR(PL_diehook);
1472 PL_diehook = Nullsv;
1473 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1475 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1481 msg = newSVpvn(message, msglen);
1489 PUSHSTACKi(PERLSI_DIEHOOK);
1493 call_sv((SV*)cv, G_DISCARD);
1499 PL_restartop = die_where(message, msglen);
1500 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1501 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1502 thr, PL_restartop, was_in_eval, PL_top_env));
1503 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1505 return PL_restartop;
1508 #if defined(PERL_IMPLICIT_CONTEXT)
1510 Perl_die_nocontext(const char* pat, ...)
1515 va_start(args, pat);
1516 o = vdie(pat, &args);
1520 #endif /* PERL_IMPLICIT_CONTEXT */
1523 Perl_die(pTHX_ const char* pat, ...)
1527 va_start(args, pat);
1528 o = vdie(pat, &args);
1534 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1544 msv = mess(pat, args);
1545 message = SvPV(msv,msglen);
1546 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1548 /* sv_2cv might call Perl_croak() */
1549 SV *olddiehook = PL_diehook;
1551 SAVESPTR(PL_diehook);
1552 PL_diehook = Nullsv;
1553 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1555 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1560 msg = newSVpvn(message, msglen);
1564 PUSHSTACKi(PERLSI_DIEHOOK);
1568 call_sv((SV*)cv, G_DISCARD);
1574 PL_restartop = die_where(message, msglen);
1579 /* SFIO can really mess with your errno */
1582 PerlIO_write(PerlIO_stderr(), message, msglen);
1583 (void)PerlIO_flush(PerlIO_stderr());
1591 #if defined(PERL_IMPLICIT_CONTEXT)
1593 Perl_croak_nocontext(const char *pat, ...)
1597 va_start(args, pat);
1602 #endif /* PERL_IMPLICIT_CONTEXT */
1605 Perl_croak(pTHX_ const char *pat, ...)
1608 va_start(args, pat);
1615 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1624 msv = mess(pat, args);
1625 message = SvPV(msv, msglen);
1628 /* sv_2cv might call Perl_warn() */
1630 SV *oldwarnhook = PL_warnhook;
1632 SAVESPTR(PL_warnhook);
1633 PL_warnhook = Nullsv;
1634 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1636 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1641 msg = newSVpvn(message, msglen);
1645 PUSHSTACKi(PERLSI_WARNHOOK);
1649 call_sv((SV*)cv, G_DISCARD);
1655 PerlIO_write(PerlIO_stderr(), message, msglen);
1657 DEBUG_L(*message == '!'
1658 ? (xstat(message[1]=='!'
1659 ? (message[2]=='!' ? 2 : 1)
1664 (void)PerlIO_flush(PerlIO_stderr());
1667 #if defined(PERL_IMPLICIT_CONTEXT)
1669 Perl_warn_nocontext(const char *pat, ...)
1673 va_start(args, pat);
1677 #endif /* PERL_IMPLICIT_CONTEXT */
1680 Perl_warn(pTHX_ const char *pat, ...)
1683 va_start(args, pat);
1688 #if defined(PERL_IMPLICIT_CONTEXT)
1690 Perl_warner_nocontext(U32 err, const char *pat, ...)
1694 va_start(args, pat);
1695 vwarner(err, pat, &args);
1698 #endif /* PERL_IMPLICIT_CONTEXT */
1701 Perl_warner(pTHX_ U32 err, const char* pat,...)
1704 va_start(args, pat);
1705 vwarner(err, pat, &args);
1710 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1720 msv = mess(pat, args);
1721 message = SvPV(msv, msglen);
1725 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1726 #endif /* USE_THREADS */
1728 /* sv_2cv might call Perl_croak() */
1729 SV *olddiehook = PL_diehook;
1731 SAVESPTR(PL_diehook);
1732 PL_diehook = Nullsv;
1733 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1735 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1740 msg = newSVpvn(message, msglen);
1747 call_sv((SV*)cv, G_DISCARD);
1753 PL_restartop = die_where(message, msglen);
1756 PerlIO_write(PerlIO_stderr(), message, msglen);
1757 (void)PerlIO_flush(PerlIO_stderr());
1763 /* sv_2cv might call Perl_warn() */
1765 SV *oldwarnhook = PL_warnhook;
1767 SAVESPTR(PL_warnhook);
1768 PL_warnhook = Nullsv;
1769 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1771 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1776 msg = newSVpvn(message, msglen);
1783 call_sv((SV*)cv, G_DISCARD);
1789 PerlIO_write(PerlIO_stderr(), message, msglen);
1793 (void)PerlIO_flush(PerlIO_stderr());
1797 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1798 #if !defined(WIN32) && !defined(CYGWIN)
1800 Perl_my_setenv(pTHX_ char *nam, char *val)
1802 #ifndef PERL_USE_SAFE_PUTENV
1803 /* most putenv()s leak, so we manipulate environ directly */
1804 register I32 i=setenv_getix(nam); /* where does it go? */
1806 if (environ == PL_origenviron) { /* need we copy environment? */
1812 for (max = i; environ[max]; max++) ;
1813 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1814 for (j=0; j<max; j++) { /* copy environment */
1815 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1816 strcpy(tmpenv[j], environ[j]);
1818 tmpenv[max] = Nullch;
1819 environ = tmpenv; /* tell exec where it is now */
1822 safesysfree(environ[i]);
1823 while (environ[i]) {
1824 environ[i] = environ[i+1];
1829 if (!environ[i]) { /* does not exist yet */
1830 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1831 environ[i+1] = Nullch; /* make sure it's null terminated */
1834 safesysfree(environ[i]);
1835 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1838 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1840 /* MS-DOS requires environment variable names to be in uppercase */
1841 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1842 * some utilities and applications may break because they only look
1843 * for upper case strings. (Fixed strupr() bug here.)]
1845 strcpy(environ[i],nam); strupr(environ[i]);
1846 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1849 #else /* PERL_USE_SAFE_PUTENV */
1852 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1854 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1856 strcpy(new_env,nam); strupr(new_env);
1857 (void)sprintf(new_env + strlen(nam),"=%s",val);
1859 (void)putenv(new_env);
1860 #endif /* PERL_USE_SAFE_PUTENV */
1863 #else /* WIN32 || CYGWIN */
1866 * Save environ of perl.exe, currently Cygwin links in separate environ's
1867 * for each exe/dll. Probably should be a member of impure_ptr.
1869 static char ***Perl_main_environ;
1872 Perl_my_setenv_init(char ***penviron)
1874 Perl_main_environ = penviron;
1878 my_setenv(char *nam, char *val)
1880 /* You can not directly manipulate the environ[] array because
1881 * the routines do some additional work that syncs the Cygwin
1882 * environment with the Windows environment.
1884 char *oldstr = environ[setenv_getix(nam)];
1893 setenv(nam, val, 1);
1894 environ = *Perl_main_environ; /* environ realloc can occur in setenv */
1895 if(oldstr && environ[setenv_getix(nam)] != oldstr)
1898 #else /* if WIN32 */
1901 Perl_my_setenv(pTHX_ char *nam,char *val)
1904 #ifdef USE_WIN32_RTL_ENV
1906 register char *envstr;
1907 STRLEN namlen = strlen(nam);
1909 char *oldstr = environ[setenv_getix(nam)];
1911 /* putenv() has totally broken semantics in both the Borland
1912 * and Microsoft CRTLs. They either store the passed pointer in
1913 * the environment without making a copy, or make a copy and don't
1914 * free it. And on top of that, they dont free() old entries that
1915 * are being replaced/deleted. This means the caller must
1916 * free any old entries somehow, or we end up with a memory
1917 * leak every time my_setenv() is called. One might think
1918 * one could directly manipulate environ[], like the UNIX code
1919 * above, but direct changes to environ are not allowed when
1920 * calling putenv(), since the RTLs maintain an internal
1921 * *copy* of environ[]. Bad, bad, *bad* stink.
1932 vallen = strlen(val);
1933 envstr = (char*)safesysmalloc((namlen + vallen + 3) * sizeof(char));
1934 (void)sprintf(envstr,"%s=%s",nam,val);
1935 (void)PerlEnv_putenv(envstr);
1937 safesysfree(oldstr);
1939 safesysfree(envstr); /* MSVCRT leaks without this */
1942 #else /* !USE_WIN32_RTL_ENV */
1944 register char *envstr;
1945 STRLEN len = strlen(nam) + 3;
1950 New(904, envstr, len, char);
1951 (void)sprintf(envstr,"%s=%s",nam,val);
1952 (void)PerlEnv_putenv(envstr);
1962 Perl_setenv_getix(pTHX_ char *nam)
1964 register I32 i, len = strlen(nam);
1966 for (i = 0; environ[i]; i++) {
1969 strnicmp(environ[i],nam,len) == 0
1971 strnEQ(environ[i],nam,len)
1973 && environ[i][len] == '=')
1974 break; /* strnEQ must come first to avoid */
1975 } /* potential SEGV's */
1981 #ifdef UNLINK_ALL_VERSIONS
1983 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1987 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1992 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1994 Perl_my_bcopy(pTHX_ register const char *from,register char *to,register I32 len)
1998 if (from - to >= 0) {
2006 *(--to) = *(--from);
2014 Perl_my_memset(pTHX_ register char *loc, register I32 ch, register I32 len)
2024 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2026 Perl_my_bzero(pTHX_ register char *loc, register I32 len)
2036 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2038 Perl_my_memcmp(pTHX_ const char *s1, const char *s2, register I32 len)
2040 register U8 *a = (U8 *)s1;
2041 register U8 *b = (U8 *)s2;
2045 if (tmp = *a++ - *b++)
2050 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2054 #ifdef USE_CHAR_VSPRINTF
2059 vsprintf(char *dest, const char *pat, char *args)
2063 fakebuf._ptr = dest;
2064 fakebuf._cnt = 32767;
2068 fakebuf._flag = _IOWRT|_IOSTRG;
2069 _doprnt(pat, args, &fakebuf); /* what a kludge */
2070 (void)putc('\0', &fakebuf);
2071 #ifdef USE_CHAR_VSPRINTF
2074 return 0; /* perl doesn't use return value */
2078 #endif /* HAS_VPRINTF */
2081 #if BYTEORDER != 0x4321
2083 Perl_my_swap(pTHX_ short s)
2085 #if (BYTEORDER & 1) == 0
2088 result = ((s & 255) << 8) + ((s >> 8) & 255);
2096 Perl_my_htonl(pTHX_ long l)
2100 char c[sizeof(long)];
2103 #if BYTEORDER == 0x1234
2104 u.c[0] = (l >> 24) & 255;
2105 u.c[1] = (l >> 16) & 255;
2106 u.c[2] = (l >> 8) & 255;
2110 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2111 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2116 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2117 u.c[o & 0xf] = (l >> s) & 255;
2125 Perl_my_ntohl(pTHX_ long l)
2129 char c[sizeof(long)];
2132 #if BYTEORDER == 0x1234
2133 u.c[0] = (l >> 24) & 255;
2134 u.c[1] = (l >> 16) & 255;
2135 u.c[2] = (l >> 8) & 255;
2139 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2140 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2147 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2148 l |= (u.c[o & 0xf] & 255) << s;
2155 #endif /* BYTEORDER != 0x4321 */
2159 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2160 * If these functions are defined,
2161 * the BYTEORDER is neither 0x1234 nor 0x4321.
2162 * However, this is not assumed.
2166 #define HTOV(name,type) \
2168 name (register type n) \
2172 char c[sizeof(type)]; \
2176 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2177 u.c[i] = (n >> s) & 0xFF; \
2182 #define VTOH(name,type) \
2184 name (register type n) \
2188 char c[sizeof(type)]; \
2194 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2195 n += (u.c[i] & 0xFF) << s; \
2200 #if defined(HAS_HTOVS) && !defined(htovs)
2203 #if defined(HAS_HTOVL) && !defined(htovl)
2206 #if defined(HAS_VTOHS) && !defined(vtohs)
2209 #if defined(HAS_VTOHL) && !defined(vtohl)
2213 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2214 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2216 Perl_my_popen(pTHX_ char *cmd, char *mode)
2219 register I32 This, that;
2222 I32 doexec = strNE(cmd,"-");
2226 PERL_FLUSHALL_FOR_CHILD;
2229 return my_syspopen(cmd,mode);
2232 This = (*mode == 'w');
2234 if (doexec && PL_tainting) {
2236 taint_proper("Insecure %s%s", "EXEC");
2238 if (PerlProc_pipe(p) < 0)
2240 if (doexec && PerlProc_pipe(pp) >= 0)
2242 while ((pid = (doexec?vfork():fork())) < 0) {
2243 if (errno != EAGAIN) {
2244 PerlLIO_close(p[This]);
2246 PerlLIO_close(pp[0]);
2247 PerlLIO_close(pp[1]);
2250 Perl_croak(aTHX_ "Can't fork");
2262 PerlLIO_close(p[THAT]);
2264 PerlLIO_close(pp[0]);
2265 #if defined(HAS_FCNTL) && defined(F_SETFD)
2266 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2269 if (p[THIS] != (*mode == 'r')) {
2270 PerlLIO_dup2(p[THIS], *mode == 'r');
2271 PerlLIO_close(p[THIS]);
2275 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2281 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2285 do_exec3(cmd,pp[1],did_pipes); /* may or may not use the shell */
2288 #endif /* defined OS2 */
2290 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
2291 sv_setiv(GvSV(tmpgv), (IV)getpid());
2293 hv_clear(PL_pidstatus); /* we have no children */
2298 do_execfree(); /* free any memory malloced by child on vfork */
2299 PerlLIO_close(p[that]);
2301 PerlLIO_close(pp[1]);
2302 if (p[that] < p[This]) {
2303 PerlLIO_dup2(p[This], p[that]);
2304 PerlLIO_close(p[This]);
2307 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2308 (void)SvUPGRADE(sv,SVt_IV);
2310 PL_forkprocess = pid;
2311 if (did_pipes && pid > 0) {
2315 while (n < sizeof(int)) {
2316 n1 = PerlLIO_read(pp[0],
2317 (void*)(((char*)&errkid)+n),
2323 PerlLIO_close(pp[0]);
2325 if (n) { /* Error */
2326 if (n != sizeof(int))
2327 Perl_croak(aTHX_ "panic: kid popen errno read");
2328 errno = errkid; /* Propagate errno from kid */
2333 PerlLIO_close(pp[0]);
2334 return PerlIO_fdopen(p[This], mode);
2337 #if defined(atarist) || defined(DJGPP)
2340 Perl_my_popen(pTHX_ char *cmd, char *mode)
2342 /* Needs work for PerlIO ! */
2343 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
2344 PERL_FLUSHALL_FOR_CHILD;
2345 return popen(PerlIO_exportFILE(cmd, 0), mode);
2349 #endif /* !DOSISH */
2353 Perl_dump_fds(pTHX_ char *s)
2356 struct stat tmpstatbuf;
2358 PerlIO_printf(PerlIO_stderr(),"%s", s);
2359 for (fd = 0; fd < 32; fd++) {
2360 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2361 PerlIO_printf(PerlIO_stderr()," %d",fd);
2363 PerlIO_printf(PerlIO_stderr(),"\n");
2365 #endif /* DUMP_FDS */
2369 dup2(int oldfd, int newfd)
2371 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2374 PerlLIO_close(newfd);
2375 return fcntl(oldfd, F_DUPFD, newfd);
2377 #define DUP2_MAX_FDS 256
2378 int fdtmp[DUP2_MAX_FDS];
2384 PerlLIO_close(newfd);
2385 /* good enough for low fd's... */
2386 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2387 if (fdx >= DUP2_MAX_FDS) {
2395 PerlLIO_close(fdtmp[--fdx]);
2402 #ifdef HAS_SIGACTION
2405 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2407 struct sigaction act, oact;
2409 act.sa_handler = handler;
2410 sigemptyset(&act.sa_mask);
2413 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2416 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2417 act.sa_flags |= SA_NOCLDWAIT;
2419 if (sigaction(signo, &act, &oact) == -1)
2422 return oact.sa_handler;
2426 Perl_rsignal_state(pTHX_ int signo)
2428 struct sigaction oact;
2430 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2433 return oact.sa_handler;
2437 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2439 struct sigaction act;
2441 act.sa_handler = handler;
2442 sigemptyset(&act.sa_mask);
2445 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2448 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2449 act.sa_flags |= SA_NOCLDWAIT;
2451 return sigaction(signo, &act, save);
2455 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2457 return sigaction(signo, save, (struct sigaction *)NULL);
2460 #else /* !HAS_SIGACTION */
2463 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2465 return PerlProc_signal(signo, handler);
2468 static int sig_trapped;
2478 Perl_rsignal_state(pTHX_ int signo)
2480 Sighandler_t oldsig;
2483 oldsig = PerlProc_signal(signo, sig_trap);
2484 PerlProc_signal(signo, oldsig);
2486 PerlProc_kill(getpid(), signo);
2491 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2493 *save = PerlProc_signal(signo, handler);
2494 return (*save == SIG_ERR) ? -1 : 0;
2498 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2500 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2503 #endif /* !HAS_SIGACTION */
2505 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2506 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC)
2508 Perl_my_pclose(pTHX_ PerlIO *ptr)
2510 Sigsave_t hstat, istat, qstat;
2518 int saved_vaxc_errno;
2521 int saved_win32_errno;
2524 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2525 pid = (int)SvIVX(*svp);
2527 *svp = &PL_sv_undef;
2529 if (pid == -1) { /* Opened by popen. */
2530 return my_syspclose(ptr);
2533 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2534 saved_errno = errno;
2536 saved_vaxc_errno = vaxc$errno;
2539 saved_win32_errno = GetLastError();
2543 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2545 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2546 rsignal_save(SIGINT, SIG_IGN, &istat);
2547 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2549 pid2 = wait4pid(pid, &status, 0);
2550 } while (pid2 == -1 && errno == EINTR);
2551 rsignal_restore(SIGHUP, &hstat);
2552 rsignal_restore(SIGINT, &istat);
2553 rsignal_restore(SIGQUIT, &qstat);
2555 SETERRNO(saved_errno, saved_vaxc_errno);
2558 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2560 #endif /* !DOSISH */
2562 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2564 Perl_wait4pid(pTHX_ int pid, int *statusp, int flags)
2568 char spid[TYPE_CHARS(int)];
2573 sprintf(spid, "%d", pid);
2574 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2575 if (svp && *svp != &PL_sv_undef) {
2576 *statusp = SvIVX(*svp);
2577 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2584 hv_iterinit(PL_pidstatus);
2585 if (entry = hv_iternext(PL_pidstatus)) {
2586 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2587 sv = hv_iterval(PL_pidstatus,entry);
2588 *statusp = SvIVX(sv);
2589 sprintf(spid, "%d", pid);
2590 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2595 # ifdef HAS_WAITPID_RUNTIME
2596 if (!HAS_WAITPID_RUNTIME)
2599 return PerlProc_waitpid(pid,statusp,flags);
2601 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2602 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2604 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2609 Perl_croak(aTHX_ "Can't do waitpid with flags");
2611 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2612 pidgone(result,*statusp);
2620 #endif /* !DOSISH || OS2 || WIN32 */
2624 Perl_pidgone(pTHX_ int pid, int status)
2627 char spid[TYPE_CHARS(int)];
2629 sprintf(spid, "%d", pid);
2630 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2631 (void)SvUPGRADE(sv,SVt_IV);
2636 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2639 int /* Cannot prototype with I32
2641 my_syspclose(PerlIO *ptr)
2644 Perl_my_pclose(pTHX_ PerlIO *ptr)
2647 /* Needs work for PerlIO ! */
2648 FILE *f = PerlIO_findFILE(ptr);
2649 I32 result = pclose(f);
2650 PerlIO_releaseFILE(ptr,f);
2656 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2659 register const char *frombase = from;
2662 register const char c = *from;
2667 while (count-- > 0) {
2668 for (todo = len; todo > 0; todo--) {
2676 Perl_cast_ulong(pTHX_ NV f)
2681 # define BIGDOUBLE 2147483648.0
2683 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2686 return (unsigned long)f;
2688 return (unsigned long)along;
2692 /* Unfortunately, on some systems the cast_uv() function doesn't
2693 work with the system-supplied definition of ULONG_MAX. The
2694 comparison (f >= ULONG_MAX) always comes out true. It must be a
2695 problem with the compiler constant folding.
2697 In any case, this workaround should be fine on any two's complement
2698 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2700 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2703 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2705 -- Kenneth Albanowski <kjahds@kjahds.com>
2709 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2713 Perl_cast_i32(pTHX_ NV f)
2716 return (I32) I32_MAX;
2718 return (I32) I32_MIN;
2723 Perl_cast_iv(pTHX_ NV f)
2728 if (f >= (NV)UV_MAX)
2739 Perl_cast_uv(pTHX_ NV f)
2742 return (UV) MY_UV_MAX;
2756 Perl_same_dirent(pTHX_ char *a, char *b)
2758 char *fa = strrchr(a,'/');
2759 char *fb = strrchr(b,'/');
2760 struct stat tmpstatbuf1;
2761 struct stat tmpstatbuf2;
2762 SV *tmpsv = sv_newmortal();
2775 sv_setpv(tmpsv, ".");
2777 sv_setpvn(tmpsv, a, fa - a);
2778 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2781 sv_setpv(tmpsv, ".");
2783 sv_setpvn(tmpsv, b, fb - b);
2784 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2786 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2787 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2789 #endif /* !HAS_RENAME */
2792 Perl_scan_bin(pTHX_ char *start, I32 len, I32 *retlen)
2794 register char *s = start;
2795 register NV rnv = 0.0;
2796 register UV ruv = 0;
2797 register bool seenb = FALSE;
2798 register bool overflowed = FALSE;
2800 for (; len-- && *s; s++) {
2801 if (!(*s == '0' || *s == '1')) {
2803 continue; /* Note: does not check for __ and the like. */
2804 if (seenb == FALSE && *s == 'b' && ruv == 0) {
2805 /* Disallow 0bbb0b0bbb... */
2811 if (ckWARN(WARN_UNSAFE))
2812 Perl_warner(aTHX_ WARN_UNSAFE,
2813 "Illegal binary digit '%c' ignored", *s);
2818 register UV xuv = ruv << 1;
2820 if ((xuv >> 1) != ruv) {
2824 if (ckWARN_d(WARN_UNSAFE))
2825 Perl_warner(aTHX_ WARN_UNSAFE,
2826 "Integer overflow in binary number");
2828 ruv = xuv | (*s - '0');
2832 /* If an NV has not enough bits in its mantissa to
2833 * represent an UV this summing of small low-order numbers
2834 * is a waste of time (because the NV cannot preserve
2835 * the low-order bits anyway): we could just remember when
2836 * did we overflow and in the end just multiply rnv by the
2843 if ( ( overflowed && rnv > 4294967295.0)
2845 || (!overflowed && ruv > 0xffffffff )
2849 if (ckWARN(WARN_UNSAFE))
2850 Perl_warner(aTHX_ WARN_UNSAFE,
2851 "Binary number > 0b11111111111111111111111111111111 non-portable");
2853 *retlen = s - start;
2858 Perl_scan_oct(pTHX_ char *start, I32 len, I32 *retlen)
2860 register char *s = start;
2861 register NV rnv = 0.0;
2862 register UV ruv = 0;
2863 register bool overflowed = FALSE;
2865 for (; len-- && *s; s++) {
2866 if (!(*s >= '0' && *s <= '7')) {
2868 continue; /* Note: does not check for __ and the like. */
2870 /* Allow \octal to work the DWIM way (that is, stop scanning
2871 * as soon as non-octal characters are seen, complain only iff
2872 * someone seems to want to use the digits eight and nine). */
2873 if (*s == '8' || *s == '9') {
2875 if (ckWARN(WARN_OCTAL))
2876 Perl_warner(aTHX_ WARN_OCTAL,
2877 "Illegal octal digit '%c' ignored", *s);
2883 register UV xuv = ruv << 3;
2885 if ((xuv >> 3) != ruv) {
2889 if (ckWARN_d(WARN_UNSAFE))
2890 Perl_warner(aTHX_ WARN_UNSAFE,
2891 "Integer overflow in octal number");
2893 ruv = xuv | (*s - '0');
2897 /* If an NV has not enough bits in its mantissa to
2898 * represent an UV this summing of small low-order numbers
2899 * is a waste of time (because the NV cannot preserve
2900 * the low-order bits anyway): we could just remember when
2901 * did we overflow and in the end just multiply rnv by the
2902 * right amount of 8-tuples. */
2903 rnv += (NV)(*s - '0');
2908 if ( ( overflowed && rnv > 4294967295.0)
2910 || (!overflowed && ruv > 0xffffffff )
2914 if (ckWARN(WARN_UNSAFE))
2915 Perl_warner(aTHX_ WARN_UNSAFE,
2916 "Octal number > 037777777777 non-portable");
2918 *retlen = s - start;
2923 Perl_scan_hex(pTHX_ char *start, I32 len, I32 *retlen)
2925 register char *s = start;
2926 register NV rnv = 0.0;
2927 register UV ruv = 0;
2928 register bool seenx = FALSE;
2929 register bool overflowed = FALSE;
2932 for (; len-- && *s; s++) {
2933 hexdigit = strchr((char *) PL_hexdigit, *s);
2936 continue; /* Note: does not check for __ and the like. */
2937 if (seenx == FALSE && *s == 'x' && ruv == 0) {
2938 /* Disallow 0xxx0x0xxx... */
2944 if (ckWARN(WARN_UNSAFE))
2945 Perl_warner(aTHX_ WARN_UNSAFE,
2946 "Illegal hexadecimal digit '%c' ignored", *s);
2951 register UV xuv = ruv << 4;
2953 if ((xuv >> 4) != ruv) {
2957 if (ckWARN_d(WARN_UNSAFE))
2958 Perl_warner(aTHX_ WARN_UNSAFE,
2959 "Integer overflow in hexadecimal number");
2961 ruv = xuv | ((hexdigit - PL_hexdigit) & 15);
2965 /* If an NV has not enough bits in its mantissa to
2966 * represent an UV this summing of small low-order numbers
2967 * is a waste of time (because the NV cannot preserve
2968 * the low-order bits anyway): we could just remember when
2969 * did we overflow and in the end just multiply rnv by the
2970 * right amount of 16-tuples. */
2971 rnv += (NV)((hexdigit - PL_hexdigit) & 15);
2974 register UV xuv = ruv << 4;
2976 if ((xuv >> 4) != ruv) {
2980 if (ckWARN_d(WARN_UNSAFE))
2981 Perl_warner(aTHX_ WARN_UNSAFE,
2982 "Integer overflow in hexadecimal number");
2984 ruv = xuv | ((hexdigit - PL_hexdigit) & 15);
2988 /* If an NV has not enough bits in its mantissa to
2989 * represent an UV this summing of small low-order numbers
2990 * is a waste of time (because the NV cannot preserve
2991 * the low-order bits anyway): we could just remember when
2992 * did we overflow and in the end just multiply rnv by the
2993 * right amount of 16-tuples. */
2994 rnv += (NV)((hexdigit - PL_hexdigit) & 15);
2999 if ( ( overflowed && rnv > 4294967295.0)
3001 || (!overflowed && ruv > 0xffffffff )
3005 if (ckWARN(WARN_UNSAFE))
3006 Perl_warner(aTHX_ WARN_UNSAFE,
3007 "Hexadecimal number > 0xffffffff non-portable");
3009 *retlen = s - start;
3014 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
3017 char *xfound = Nullch;
3018 char *xfailed = Nullch;
3019 char tmpbuf[MAXPATHLEN];
3023 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3024 # define SEARCH_EXTS ".bat", ".cmd", NULL
3025 # define MAX_EXT_LEN 4
3028 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3029 # define MAX_EXT_LEN 4
3032 # define SEARCH_EXTS ".pl", ".com", NULL
3033 # define MAX_EXT_LEN 4
3035 /* additional extensions to try in each dir if scriptname not found */
3037 char *exts[] = { SEARCH_EXTS };
3038 char **ext = search_ext ? search_ext : exts;
3039 int extidx = 0, i = 0;
3040 char *curext = Nullch;
3042 # define MAX_EXT_LEN 0
3046 * If dosearch is true and if scriptname does not contain path
3047 * delimiters, search the PATH for scriptname.
3049 * If SEARCH_EXTS is also defined, will look for each
3050 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3051 * while searching the PATH.
3053 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3054 * proceeds as follows:
3055 * If DOSISH or VMSISH:
3056 * + look for ./scriptname{,.foo,.bar}
3057 * + search the PATH for scriptname{,.foo,.bar}
3060 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3061 * this will not look in '.' if it's not in the PATH)
3066 # ifdef ALWAYS_DEFTYPES
3067 len = strlen(scriptname);
3068 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3069 int hasdir, idx = 0, deftypes = 1;
3072 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
3075 int hasdir, idx = 0, deftypes = 1;
3078 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
3080 /* The first time through, just add SEARCH_EXTS to whatever we
3081 * already have, so we can check for default file types. */
3083 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3089 if ((strlen(tmpbuf) + strlen(scriptname)
3090 + MAX_EXT_LEN) >= sizeof tmpbuf)
3091 continue; /* don't search dir with too-long name */
3092 strcat(tmpbuf, scriptname);
3096 if (strEQ(scriptname, "-"))
3098 if (dosearch) { /* Look in '.' first. */
3099 char *cur = scriptname;
3101 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3103 if (strEQ(ext[i++],curext)) {
3104 extidx = -1; /* already has an ext */
3109 DEBUG_p(PerlIO_printf(Perl_debug_log,
3110 "Looking for %s\n",cur));
3111 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3112 && !S_ISDIR(PL_statbuf.st_mode)) {
3120 if (cur == scriptname) {
3121 len = strlen(scriptname);
3122 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3124 cur = strcpy(tmpbuf, scriptname);
3126 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3127 && strcpy(tmpbuf+len, ext[extidx++]));
3132 if (dosearch && !strchr(scriptname, '/')
3134 && !strchr(scriptname, '\\')
3136 && (s = PerlEnv_getenv("PATH"))) {
3139 PL_bufend = s + strlen(s);
3140 while (s < PL_bufend) {
3141 #if defined(atarist) || defined(DOSISH)
3146 && *s != ';'; len++, s++) {
3147 if (len < sizeof tmpbuf)
3150 if (len < sizeof tmpbuf)
3152 #else /* ! (atarist || DOSISH) */
3153 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3156 #endif /* ! (atarist || DOSISH) */
3159 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3160 continue; /* don't search dir with too-long name */
3162 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3163 && tmpbuf[len - 1] != '/'
3164 && tmpbuf[len - 1] != '\\'
3167 tmpbuf[len++] = '/';
3168 if (len == 2 && tmpbuf[0] == '.')
3170 (void)strcpy(tmpbuf + len, scriptname);
3174 len = strlen(tmpbuf);
3175 if (extidx > 0) /* reset after previous loop */
3179 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3180 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3181 if (S_ISDIR(PL_statbuf.st_mode)) {
3185 } while ( retval < 0 /* not there */
3186 && extidx>=0 && ext[extidx] /* try an extension? */
3187 && strcpy(tmpbuf+len, ext[extidx++])
3192 if (S_ISREG(PL_statbuf.st_mode)
3193 && cando(S_IRUSR,TRUE,&PL_statbuf)
3195 && cando(S_IXUSR,TRUE,&PL_statbuf)
3199 xfound = tmpbuf; /* bingo! */
3203 xfailed = savepv(tmpbuf);
3206 if (!xfound && !seen_dot && !xfailed &&
3207 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3208 || S_ISDIR(PL_statbuf.st_mode)))
3210 seen_dot = 1; /* Disable message. */
3212 if (flags & 1) { /* do or die? */
3213 Perl_croak(aTHX_ "Can't %s %s%s%s",
3214 (xfailed ? "execute" : "find"),
3215 (xfailed ? xfailed : scriptname),
3216 (xfailed ? "" : " on PATH"),
3217 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3219 scriptname = Nullch;
3223 scriptname = xfound;
3225 return (scriptname ? savepv(scriptname) : Nullch);
3231 /* Very simplistic scheduler for now */
3235 thr = thr->i.next_run;
3239 Perl_cond_init(pTHX_ perl_cond *cp)
3245 Perl_cond_signal(pTHX_ perl_cond *cp)
3248 perl_cond cond = *cp;
3253 /* Insert t in the runnable queue just ahead of us */
3254 t->i.next_run = thr->i.next_run;
3255 thr->i.next_run->i.prev_run = t;
3256 t->i.prev_run = thr;
3257 thr->i.next_run = t;
3258 thr->i.wait_queue = 0;
3259 /* Remove from the wait queue */
3265 Perl_cond_broadcast(pTHX_ perl_cond *cp)
3268 perl_cond cond, cond_next;
3270 for (cond = *cp; cond; cond = cond_next) {
3272 /* Insert t in the runnable queue just ahead of us */
3273 t->i.next_run = thr->i.next_run;
3274 thr->i.next_run->i.prev_run = t;
3275 t->i.prev_run = thr;
3276 thr->i.next_run = t;
3277 thr->i.wait_queue = 0;
3278 /* Remove from the wait queue */
3279 cond_next = cond->next;
3286 Perl_cond_wait(pTHX_ perl_cond *cp)
3290 if (thr->i.next_run == thr)
3291 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
3293 New(666, cond, 1, struct perl_wait_queue);
3297 thr->i.wait_queue = cond;
3298 /* Remove ourselves from runnable queue */
3299 thr->i.next_run->i.prev_run = thr->i.prev_run;
3300 thr->i.prev_run->i.next_run = thr->i.next_run;
3302 #endif /* FAKE_THREADS */
3304 #ifdef PTHREAD_GETSPECIFIC_INT
3305 struct perl_thread *
3310 if (pthread_getspecific(PL_thr_key, &t))
3311 Perl_croak(aTHX_ "panic: pthread_getspecific");
3312 return (struct perl_thread *) t;
3317 Perl_condpair_magic(pTHX_ SV *sv)
3321 SvUPGRADE(sv, SVt_PVMG);
3322 mg = mg_find(sv, 'm');
3326 New(53, cp, 1, condpair_t);
3327 MUTEX_INIT(&cp->mutex);
3328 COND_INIT(&cp->owner_cond);
3329 COND_INIT(&cp->cond);
3331 MUTEX_LOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3332 mg = mg_find(sv, 'm');
3334 /* someone else beat us to initialising it */
3335 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3336 MUTEX_DESTROY(&cp->mutex);
3337 COND_DESTROY(&cp->owner_cond);
3338 COND_DESTROY(&cp->cond);
3342 sv_magic(sv, Nullsv, 'm', 0, 0);
3344 mg->mg_ptr = (char *)cp;
3345 mg->mg_len = sizeof(cp);
3346 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
3347 DEBUG_S(WITH_THR(PerlIO_printf(PerlIO_stderr(),
3348 "%p: condpair_magic %p\n", thr, sv));)
3355 * Make a new perl thread structure using t as a prototype. Some of the
3356 * fields for the new thread are copied from the prototype thread, t,
3357 * so t should not be running in perl at the time this function is
3358 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3359 * thread calling new_struct_thread) clearly satisfies this constraint.
3361 struct perl_thread *
3362 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3364 #if !defined(PERL_IMPLICIT_CONTEXT)
3365 struct perl_thread *thr;
3371 sv = newSVpvn("", 0);
3372 SvGROW(sv, sizeof(struct perl_thread) + 1);
3373 SvCUR_set(sv, sizeof(struct perl_thread));
3374 thr = (Thread) SvPVX(sv);
3376 memset(thr, 0xab, sizeof(struct perl_thread));
3383 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3385 Zero(thr, 1, struct perl_thread);
3388 PL_protect = MEMBER_TO_FPTR(Perl_default_protect);
3393 PL_curcop = &PL_compiling;
3394 thr->interp = t->interp;
3395 thr->cvcache = newHV();
3396 thr->threadsv = newAV();
3397 thr->specific = newAV();
3398 thr->errsv = newSVpvn("", 0);
3399 thr->errhv = newHV();
3400 thr->flags = THRf_R_JOINABLE;
3401 MUTEX_INIT(&thr->mutex);
3403 /* top_env needs to be non-zero. It points to an area
3404 in which longjmp() stuff is stored, as C callstack
3405 info there at least is thread specific this has to
3406 be per-thread. Otherwise a 'die' in a thread gives
3407 that thread the C stack of last thread to do an eval {}!
3408 See comments in scope.h
3409 Initialize top entry (as in perl.c for main thread)
3411 PL_start_env.je_prev = NULL;
3412 PL_start_env.je_ret = -1;
3413 PL_start_env.je_mustcatch = TRUE;
3414 PL_top_env = &PL_start_env;
3416 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR) */
3419 PL_statname = NEWSV(66,0);
3421 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3422 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3423 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3424 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3425 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3427 PL_reginterp_cnt = 0;
3428 PL_lastscream = Nullsv;
3431 PL_reg_start_tmp = 0;
3432 PL_reg_start_tmpl = 0;
3434 /* parent thread's data needs to be locked while we make copy */
3435 MUTEX_LOCK(&t->mutex);
3437 PL_protect = t->Tprotect;
3439 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3440 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3441 PL_curstash = t->Tcurstash; /* always be set to main? */
3443 PL_tainted = t->Ttainted;
3444 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3445 PL_nrs = newSVsv(t->Tnrs);
3446 PL_rs = SvREFCNT_inc(PL_nrs);
3447 PL_last_in_gv = Nullgv;
3448 PL_ofslen = t->Tofslen;
3449 PL_ofs = savepvn(t->Tofs, PL_ofslen);
3450 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3451 PL_chopset = t->Tchopset;
3452 PL_formtarget = newSVsv(t->Tformtarget);
3453 PL_bodytarget = newSVsv(t->Tbodytarget);
3454 PL_toptarget = newSVsv(t->Ttoptarget);
3456 /* Initialise all per-thread SVs that the template thread used */
3457 svp = AvARRAY(t->threadsv);
3458 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3459 if (*svp && *svp != &PL_sv_undef) {
3460 SV *sv = newSVsv(*svp);
3461 av_store(thr->threadsv, i, sv);
3462 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
3463 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
3464 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
3467 thr->threadsvp = AvARRAY(thr->threadsv);
3469 MUTEX_LOCK(&PL_threads_mutex);
3471 thr->tid = ++PL_threadnum;
3472 thr->next = t->next;
3475 thr->next->prev = thr;
3476 MUTEX_UNLOCK(&PL_threads_mutex);
3478 /* done copying parent's state */
3479 MUTEX_UNLOCK(&t->mutex);
3481 #ifdef HAVE_THREAD_INTERN
3482 Perl_init_thread_intern(thr);
3483 #endif /* HAVE_THREAD_INTERN */
3486 #endif /* USE_THREADS */
3490 * This hack is to force load of "huge" support from libm.a
3491 * So it is in perl for (say) POSIX to use.
3492 * Needed for SunOS with Sun's 'acc' for example.
3501 #ifdef PERL_GLOBAL_STRUCT
3510 Perl_get_op_names(pTHX)
3516 Perl_get_op_descs(pTHX)
3522 Perl_get_no_modify(pTHX)
3524 return (char*)PL_no_modify;
3528 Perl_get_opargs(pTHX)
3534 Perl_get_ppaddr(pTHX)
3539 #ifndef HAS_GETENV_LEN
3541 Perl_getenv_len(pTHX_ char *env_elem, unsigned long *len)
3543 char *env_trans = PerlEnv_getenv(env_elem);
3545 *len = strlen(env_trans);
3552 Perl_get_vtbl(pTHX_ int vtbl_id)
3554 MGVTBL* result = Null(MGVTBL*);
3558 result = &PL_vtbl_sv;
3561 result = &PL_vtbl_env;
3563 case want_vtbl_envelem:
3564 result = &PL_vtbl_envelem;
3567 result = &PL_vtbl_sig;
3569 case want_vtbl_sigelem:
3570 result = &PL_vtbl_sigelem;
3572 case want_vtbl_pack:
3573 result = &PL_vtbl_pack;
3575 case want_vtbl_packelem:
3576 result = &PL_vtbl_packelem;
3578 case want_vtbl_dbline:
3579 result = &PL_vtbl_dbline;
3582 result = &PL_vtbl_isa;
3584 case want_vtbl_isaelem:
3585 result = &PL_vtbl_isaelem;
3587 case want_vtbl_arylen:
3588 result = &PL_vtbl_arylen;
3590 case want_vtbl_glob:
3591 result = &PL_vtbl_glob;
3593 case want_vtbl_mglob:
3594 result = &PL_vtbl_mglob;
3596 case want_vtbl_nkeys:
3597 result = &PL_vtbl_nkeys;
3599 case want_vtbl_taint:
3600 result = &PL_vtbl_taint;
3602 case want_vtbl_substr:
3603 result = &PL_vtbl_substr;
3606 result = &PL_vtbl_vec;
3609 result = &PL_vtbl_pos;
3612 result = &PL_vtbl_bm;
3615 result = &PL_vtbl_fm;
3617 case want_vtbl_uvar:
3618 result = &PL_vtbl_uvar;
3621 case want_vtbl_mutex:
3622 result = &PL_vtbl_mutex;
3625 case want_vtbl_defelem:
3626 result = &PL_vtbl_defelem;
3628 case want_vtbl_regexp:
3629 result = &PL_vtbl_regexp;
3631 case want_vtbl_regdata:
3632 result = &PL_vtbl_regdata;
3634 case want_vtbl_regdatum:
3635 result = &PL_vtbl_regdatum;
3637 #ifdef USE_LOCALE_COLLATE
3638 case want_vtbl_collxfrm:
3639 result = &PL_vtbl_collxfrm;
3642 case want_vtbl_amagic:
3643 result = &PL_vtbl_amagic;
3645 case want_vtbl_amagicelem:
3646 result = &PL_vtbl_amagicelem;
3648 case want_vtbl_backref:
3649 result = &PL_vtbl_backref;
3656 Perl_my_fflush_all(pTHX)
3659 return PerlIO_flush(NULL);
3662 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3663 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3664 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3666 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3667 open_max = sysconf(_SC_OPEN_MAX);
3670 open_max = FOPEN_MAX;
3673 open_max = OPEN_MAX;
3684 for (i = 0; i < open_max; i++)
3685 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3686 STDIO_STREAM_ARRAY[i]._file < open_max &&
3687 STDIO_STREAM_ARRAY[i]._flag)
3688 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3692 SETERRNO(EBADF,RMS$_IFI);
3698 Perl_my_atof(pTHX_ const char* s) {
3699 #ifdef USE_LOCALE_NUMERIC
3700 if ((PL_hints & HINT_LOCALE) && PL_numeric_local) {
3704 SET_NUMERIC_STANDARD();
3706 SET_NUMERIC_LOCAL();
3707 if ((y < 0.0 && y < x) || (y > 0.0 && y > x))
3712 return Perl_atof(s);
3714 return Perl_atof(s);