3 * Copyright (c) 1991-2001, 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
20 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
25 # define SIG_ERR ((Sighandler_t) -1)
33 /* Put this after #includes because fork and vfork prototypes may
41 # include <sys/wait.h>
52 long xcount[MAXXCOUNT];
53 long lastxcount[MAXXCOUNT];
54 long xycount[MAXXCOUNT][MAXYCOUNT];
55 long lastxycount[MAXXCOUNT][MAXYCOUNT];
59 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
60 # define FD_CLOEXEC 1 /* NeXT needs this */
63 /* paranoid version of system's malloc() */
65 /* NOTE: Do not call the next three routines directly. Use the macros
66 * in handy.h, so that we can easily redefine everything to do tracking of
67 * allocated hunks back to the original New to track down any memory leaks.
68 * XXX This advice seems to be widely ignored :-( --AD August 1996.
72 Perl_safesysmalloc(MEM_SIZE size)
78 PerlIO_printf(Perl_error_log,
79 "Allocation too large: %lx\n", size) FLUSH;
82 #endif /* HAS_64K_LIMIT */
85 Perl_croak_nocontext("panic: malloc");
87 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
88 PERL_ALLOC_CHECK(ptr);
89 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
95 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
102 /* paranoid version of system's realloc() */
105 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
109 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
110 Malloc_t PerlMem_realloc();
111 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
115 PerlIO_printf(Perl_error_log,
116 "Reallocation too large: %lx\n", size) FLUSH;
119 #endif /* HAS_64K_LIMIT */
126 return safesysmalloc(size);
129 Perl_croak_nocontext("panic: realloc");
131 ptr = (Malloc_t)PerlMem_realloc(where,size);
132 PERL_ALLOC_CHECK(ptr);
134 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
135 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
142 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
149 /* safe version of system's free() */
152 Perl_safesysfree(Malloc_t where)
154 #ifdef PERL_IMPLICIT_SYS
157 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
164 /* safe version of system's calloc() */
167 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
173 if (size * count > 0xffff) {
174 PerlIO_printf(Perl_error_log,
175 "Allocation too large: %lx\n", size * count) FLUSH;
178 #endif /* HAS_64K_LIMIT */
180 if ((long)size < 0 || (long)count < 0)
181 Perl_croak_nocontext("panic: calloc");
184 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
185 PERL_ALLOC_CHECK(ptr);
186 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
188 memset((void*)ptr, 0, size);
194 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
203 struct mem_test_strut {
211 # define ALIGN sizeof(struct mem_test_strut)
213 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
214 # define typeof_chunk(ch) \
215 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
216 # define set_typeof_chunk(ch,t) \
217 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
218 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
221 ? ((size) - 1)/8 + 5 \
225 Perl_safexmalloc(I32 x, MEM_SIZE size)
227 register char* where = (char*)safemalloc(size + ALIGN);
230 xycount[x][SIZE_TO_Y(size)]++;
231 set_typeof_chunk(where, x);
232 sizeof_chunk(where) = size;
233 return (Malloc_t)(where + ALIGN);
237 Perl_safexrealloc(Malloc_t wh, MEM_SIZE size)
239 char *where = (char*)wh;
242 return safexmalloc(0,size);
245 MEM_SIZE old = sizeof_chunk(where - ALIGN);
246 int t = typeof_chunk(where - ALIGN);
247 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
249 xycount[t][SIZE_TO_Y(old)]--;
250 xycount[t][SIZE_TO_Y(size)]++;
251 xcount[t] += size - old;
252 sizeof_chunk(new) = size;
253 return (Malloc_t)(new + ALIGN);
258 Perl_safexfree(Malloc_t wh)
261 char *where = (char*)wh;
267 size = sizeof_chunk(where);
268 x = where[0] + 100 * where[1];
270 xycount[x][SIZE_TO_Y(size)]--;
275 Perl_safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
277 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
279 xycount[x][SIZE_TO_Y(size)]++;
280 memset((void*)(where + ALIGN), 0, size * count);
281 set_typeof_chunk(where, x);
282 sizeof_chunk(where) = size;
283 return (Malloc_t)(where + ALIGN);
287 S_xstat(pTHX_ int flag)
289 register I32 i, j, total = 0;
290 I32 subtot[MAXYCOUNT];
292 for (j = 0; j < MAXYCOUNT; j++) {
296 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);
297 for (i = 0; i < MAXXCOUNT; i++) {
299 for (j = 0; j < MAXYCOUNT; j++) {
300 subtot[j] += xycount[i][j];
303 ? xcount[i] /* Have something */
305 ? xcount[i] != lastxcount[i] /* Changed */
306 : xcount[i] > lastxcount[i])) { /* Growed */
307 PerlIO_printf(Perl_debug_log,"%2d %02d %7ld ", i / 100, i % 100,
308 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
309 lastxcount[i] = xcount[i];
310 for (j = 0; j < MAXYCOUNT; j++) {
312 ? xycount[i][j] /* Have something */
314 ? xycount[i][j] != lastxycount[i][j] /* Changed */
315 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
316 PerlIO_printf(Perl_debug_log,"%3ld ",
318 ? xycount[i][j] - lastxycount[i][j]
320 lastxycount[i][j] = xycount[i][j];
322 PerlIO_printf(Perl_debug_log, " . ", xycount[i][j]);
325 PerlIO_printf(Perl_debug_log, "\n");
329 PerlIO_printf(Perl_debug_log, "Total %7ld ", total);
330 for (j = 0; j < MAXYCOUNT; j++) {
332 PerlIO_printf(Perl_debug_log, "%3ld ", subtot[j]);
334 PerlIO_printf(Perl_debug_log, " . ");
337 PerlIO_printf(Perl_debug_log, "\n");
341 #endif /* LEAKTEST */
343 /* copy a string up to some (non-backslashed) delimiter, if any */
346 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
349 for (tolen = 0; from < fromend; from++, tolen++) {
351 if (from[1] == delim)
360 else if (*from == delim)
371 /* return ptr to little string in big string, NULL if not found */
372 /* This routine was donated by Corey Satten. */
375 Perl_instr(pTHX_ register const char *big, register const char *little)
377 register const char *s, *x;
388 for (x=big,s=little; *s; /**/ ) {
397 return (char*)(big-1);
402 /* same as instr but allow embedded nulls */
405 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
407 register const char *s, *x;
408 register I32 first = *little;
409 register const char *littleend = lend;
411 if (!first && little >= littleend)
413 if (bigend - big < littleend - little)
415 bigend -= littleend - little++;
416 while (big <= bigend) {
419 for (x=big,s=little; s < littleend; /**/ ) {
426 return (char*)(big-1);
431 /* reverse of the above--find last substring */
434 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
436 register const char *bigbeg;
437 register const char *s, *x;
438 register I32 first = *little;
439 register const char *littleend = lend;
441 if (!first && little >= littleend)
442 return (char*)bigend;
444 big = bigend - (littleend - little++);
445 while (big >= bigbeg) {
448 for (x=big+2,s=little; s < littleend; /**/ ) {
455 return (char*)(big+1);
461 * Set up for a new ctype locale.
464 Perl_new_ctype(pTHX_ char *newctype)
466 #ifdef USE_LOCALE_CTYPE
470 for (i = 0; i < 256; i++) {
472 PL_fold_locale[i] = toLOWER_LC(i);
473 else if (isLOWER_LC(i))
474 PL_fold_locale[i] = toUPPER_LC(i);
476 PL_fold_locale[i] = i;
479 #endif /* USE_LOCALE_CTYPE */
483 * Standardize the locale name from a string returned by 'setlocale'.
485 * The standard return value of setlocale() is either
486 * (1) "xx_YY" if the first argument of setlocale() is not LC_ALL
487 * (2) "xa_YY xb_YY ..." if the first argument of setlocale() is LC_ALL
488 * (the space-separated values represent the various sublocales,
489 * in some unspecificed order)
491 * In some platforms it has a form like "LC_SOMETHING=Lang_Country.866\n",
492 * which is harmful for further use of the string in setlocale().
496 S_stdize_locale(pTHX_ char *locs)
501 if ((s = strchr(locs, '='))) {
505 if ((t = strchr(s, '.'))) {
508 if ((u = strchr(t, '\n'))) {
512 Move(s + 1, locs, len, char);
521 Perl_croak(aTHX_ "Can't fix broken locale name \"%s\"", locs);
527 * Set up for a new collation locale.
530 Perl_new_collate(pTHX_ char *newcoll)
532 #ifdef USE_LOCALE_COLLATE
535 if (PL_collation_name) {
537 Safefree(PL_collation_name);
538 PL_collation_name = NULL;
540 PL_collation_standard = TRUE;
541 PL_collxfrm_base = 0;
542 PL_collxfrm_mult = 2;
546 if (! PL_collation_name || strNE(PL_collation_name, newcoll)) {
548 Safefree(PL_collation_name);
549 PL_collation_name = stdize_locale(savepv(newcoll));
550 PL_collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
553 /* 2: at most so many chars ('a', 'b'). */
554 /* 50: surely no system expands a char more. */
555 #define XFRMBUFSIZE (2 * 50)
556 char xbuf[XFRMBUFSIZE];
557 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
558 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
559 SSize_t mult = fb - fa;
561 Perl_croak(aTHX_ "strxfrm() gets absurd");
562 PL_collxfrm_base = (fa > mult) ? (fa - mult) : 0;
563 PL_collxfrm_mult = mult;
567 #endif /* USE_LOCALE_COLLATE */
571 Perl_set_numeric_radix(pTHX)
573 #ifdef USE_LOCALE_NUMERIC
574 # ifdef HAS_LOCALECONV
578 if (lc && lc->decimal_point) {
579 if (lc->decimal_point[0] == '.' && lc->decimal_point[1] == 0) {
580 SvREFCNT_dec(PL_numeric_radix);
581 PL_numeric_radix = 0;
584 if (PL_numeric_radix)
585 sv_setpv(PL_numeric_radix, lc->decimal_point);
587 PL_numeric_radix = newSVpv(lc->decimal_point, 0);
591 PL_numeric_radix = 0;
592 # endif /* HAS_LOCALECONV */
593 #endif /* USE_LOCALE_NUMERIC */
597 * Set up for a new numeric locale.
600 Perl_new_numeric(pTHX_ char *newnum)
602 #ifdef USE_LOCALE_NUMERIC
605 if (PL_numeric_name) {
606 Safefree(PL_numeric_name);
607 PL_numeric_name = NULL;
609 PL_numeric_standard = TRUE;
610 PL_numeric_local = TRUE;
614 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
615 Safefree(PL_numeric_name);
616 PL_numeric_name = stdize_locale(savepv(newnum));
617 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
618 PL_numeric_local = TRUE;
622 #endif /* USE_LOCALE_NUMERIC */
626 Perl_set_numeric_standard(pTHX)
628 #ifdef USE_LOCALE_NUMERIC
630 if (! PL_numeric_standard) {
631 setlocale(LC_NUMERIC, "C");
632 PL_numeric_standard = TRUE;
633 PL_numeric_local = FALSE;
637 #endif /* USE_LOCALE_NUMERIC */
641 Perl_set_numeric_local(pTHX)
643 #ifdef USE_LOCALE_NUMERIC
645 if (! PL_numeric_local) {
646 setlocale(LC_NUMERIC, PL_numeric_name);
647 PL_numeric_standard = FALSE;
648 PL_numeric_local = TRUE;
652 #endif /* USE_LOCALE_NUMERIC */
656 * Initialize locale awareness.
659 Perl_init_i18nl10n(pTHX_ int printwarn)
663 * 1 = set ok or not applicable,
664 * 0 = fallback to C locale,
665 * -1 = fallback to C locale failed
668 #if defined(USE_LOCALE)
670 #ifdef USE_LOCALE_CTYPE
671 char *curctype = NULL;
672 #endif /* USE_LOCALE_CTYPE */
673 #ifdef USE_LOCALE_COLLATE
674 char *curcoll = NULL;
675 #endif /* USE_LOCALE_COLLATE */
676 #ifdef USE_LOCALE_NUMERIC
678 #endif /* USE_LOCALE_NUMERIC */
680 char *language = PerlEnv_getenv("LANGUAGE");
682 char *lc_all = PerlEnv_getenv("LC_ALL");
683 char *lang = PerlEnv_getenv("LANG");
684 bool setlocale_failure = FALSE;
686 #ifdef LOCALE_ENVIRON_REQUIRED
689 * Ultrix setlocale(..., "") fails if there are no environment
690 * variables from which to get a locale name.
697 if (setlocale(LC_ALL, ""))
700 setlocale_failure = TRUE;
702 if (!setlocale_failure) {
703 #ifdef USE_LOCALE_CTYPE
706 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
708 setlocale_failure = TRUE;
710 curctype = savepv(curctype);
711 #endif /* USE_LOCALE_CTYPE */
712 #ifdef USE_LOCALE_COLLATE
714 setlocale(LC_COLLATE,
715 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
717 setlocale_failure = TRUE;
719 curcoll = savepv(curcoll);
720 #endif /* USE_LOCALE_COLLATE */
721 #ifdef USE_LOCALE_NUMERIC
723 setlocale(LC_NUMERIC,
724 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
726 setlocale_failure = TRUE;
728 curnum = savepv(curnum);
729 #endif /* USE_LOCALE_NUMERIC */
734 #endif /* !LOCALE_ENVIRON_REQUIRED */
737 if (! setlocale(LC_ALL, ""))
738 setlocale_failure = TRUE;
741 if (!setlocale_failure) {
742 #ifdef USE_LOCALE_CTYPE
743 if (! (curctype = setlocale(LC_CTYPE, "")))
744 setlocale_failure = TRUE;
746 curctype = savepv(curctype);
747 #endif /* USE_LOCALE_CTYPE */
748 #ifdef USE_LOCALE_COLLATE
749 if (! (curcoll = setlocale(LC_COLLATE, "")))
750 setlocale_failure = TRUE;
752 curcoll = savepv(curcoll);
753 #endif /* USE_LOCALE_COLLATE */
754 #ifdef USE_LOCALE_NUMERIC
755 if (! (curnum = setlocale(LC_NUMERIC, "")))
756 setlocale_failure = TRUE;
758 curnum = savepv(curnum);
759 #endif /* USE_LOCALE_NUMERIC */
762 if (setlocale_failure) {
764 bool locwarn = (printwarn > 1 ||
766 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p))));
771 PerlIO_printf(Perl_error_log,
772 "perl: warning: Setting locale failed.\n");
776 PerlIO_printf(Perl_error_log,
777 "perl: warning: Setting locale failed for the categories:\n\t");
778 #ifdef USE_LOCALE_CTYPE
780 PerlIO_printf(Perl_error_log, "LC_CTYPE ");
781 #endif /* USE_LOCALE_CTYPE */
782 #ifdef USE_LOCALE_COLLATE
784 PerlIO_printf(Perl_error_log, "LC_COLLATE ");
785 #endif /* USE_LOCALE_COLLATE */
786 #ifdef USE_LOCALE_NUMERIC
788 PerlIO_printf(Perl_error_log, "LC_NUMERIC ");
789 #endif /* USE_LOCALE_NUMERIC */
790 PerlIO_printf(Perl_error_log, "\n");
794 PerlIO_printf(Perl_error_log,
795 "perl: warning: Please check that your locale settings:\n");
798 PerlIO_printf(Perl_error_log,
799 "\tLANGUAGE = %c%s%c,\n",
800 language ? '"' : '(',
801 language ? language : "unset",
802 language ? '"' : ')');
805 PerlIO_printf(Perl_error_log,
806 "\tLC_ALL = %c%s%c,\n",
808 lc_all ? lc_all : "unset",
811 #if defined(USE_ENVIRON_ARRAY)
814 for (e = environ; *e; e++) {
815 if (strnEQ(*e, "LC_", 3)
816 && strnNE(*e, "LC_ALL=", 7)
817 && (p = strchr(*e, '=')))
818 PerlIO_printf(Perl_error_log, "\t%.*s = \"%s\",\n",
819 (int)(p - *e), *e, p + 1);
823 PerlIO_printf(Perl_error_log,
824 "\t(possibly more locale environment variables)\n");
827 PerlIO_printf(Perl_error_log,
830 lang ? lang : "unset",
833 PerlIO_printf(Perl_error_log,
834 " are supported and installed on your system.\n");
839 if (setlocale(LC_ALL, "C")) {
841 PerlIO_printf(Perl_error_log,
842 "perl: warning: Falling back to the standard locale (\"C\").\n");
847 PerlIO_printf(Perl_error_log,
848 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
855 #ifdef USE_LOCALE_CTYPE
856 || !(curctype || setlocale(LC_CTYPE, "C"))
857 #endif /* USE_LOCALE_CTYPE */
858 #ifdef USE_LOCALE_COLLATE
859 || !(curcoll || setlocale(LC_COLLATE, "C"))
860 #endif /* USE_LOCALE_COLLATE */
861 #ifdef USE_LOCALE_NUMERIC
862 || !(curnum || setlocale(LC_NUMERIC, "C"))
863 #endif /* USE_LOCALE_NUMERIC */
867 PerlIO_printf(Perl_error_log,
868 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
872 #endif /* ! LC_ALL */
874 #ifdef USE_LOCALE_CTYPE
875 curctype = savepv(setlocale(LC_CTYPE, Nullch));
876 #endif /* USE_LOCALE_CTYPE */
877 #ifdef USE_LOCALE_COLLATE
878 curcoll = savepv(setlocale(LC_COLLATE, Nullch));
879 #endif /* USE_LOCALE_COLLATE */
880 #ifdef USE_LOCALE_NUMERIC
881 curnum = savepv(setlocale(LC_NUMERIC, Nullch));
882 #endif /* USE_LOCALE_NUMERIC */
886 #ifdef USE_LOCALE_CTYPE
888 #endif /* USE_LOCALE_CTYPE */
890 #ifdef USE_LOCALE_COLLATE
891 new_collate(curcoll);
892 #endif /* USE_LOCALE_COLLATE */
894 #ifdef USE_LOCALE_NUMERIC
896 #endif /* USE_LOCALE_NUMERIC */
899 #endif /* USE_LOCALE */
901 #ifdef USE_LOCALE_CTYPE
902 if (curctype != NULL)
904 #endif /* USE_LOCALE_CTYPE */
905 #ifdef USE_LOCALE_COLLATE
908 #endif /* USE_LOCALE_COLLATE */
909 #ifdef USE_LOCALE_NUMERIC
912 #endif /* USE_LOCALE_NUMERIC */
916 /* Backwards compatibility. */
918 Perl_init_i18nl14n(pTHX_ int printwarn)
920 return init_i18nl10n(printwarn);
923 #ifdef USE_LOCALE_COLLATE
926 * mem_collxfrm() is a bit like strxfrm() but with two important
927 * differences. First, it handles embedded NULs. Second, it allocates
928 * a bit more memory than needed for the transformed data itself.
929 * The real transformed data begins at offset sizeof(collationix).
930 * Please see sv_collxfrm() to see how this is used.
933 Perl_mem_collxfrm(pTHX_ const char *s, STRLEN len, STRLEN *xlen)
936 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
938 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
939 /* the +1 is for the terminating NUL. */
941 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
942 New(171, xbuf, xAlloc, char);
946 *(U32*)xbuf = PL_collation_ix;
947 xout = sizeof(PL_collation_ix);
948 for (xin = 0; xin < len; ) {
952 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
955 if (xused < xAlloc - xout)
957 xAlloc = (2 * xAlloc) + 1;
958 Renew(xbuf, xAlloc, char);
963 xin += strlen(s + xin) + 1;
966 /* Embedded NULs are understood but silently skipped
967 * because they make no sense in locale collation. */
971 *xlen = xout - sizeof(PL_collation_ix);
980 #endif /* USE_LOCALE_COLLATE */
982 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
984 /* As a space optimization, we do not compile tables for strings of length
985 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
986 special-cased in fbm_instr().
988 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
991 =for apidoc fbm_compile
993 Analyses the string in order to make fast searches on it using fbm_instr()
994 -- the Boyer-Moore algorithm.
1000 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
1007 U32 frequency = 256;
1009 if (flags & FBMcf_TAIL)
1010 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
1011 s = (U8*)SvPV_force(sv, len);
1012 (void)SvUPGRADE(sv, SVt_PVBM);
1013 if (len == 0) /* TAIL might be on on a zero-length string. */
1023 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
1024 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
1025 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
1026 memset((void*)table, mlen, 256);
1027 table[-1] = (U8)flags;
1029 sb = s - mlen + 1; /* first char (maybe) */
1031 if (table[*s] == mlen)
1036 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
1039 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
1040 for (i = 0; i < len; i++) {
1041 if (PL_freq[s[i]] < frequency) {
1043 frequency = PL_freq[s[i]];
1046 BmRARE(sv) = s[rarest];
1047 BmPREVIOUS(sv) = rarest;
1048 BmUSEFUL(sv) = 100; /* Initial value */
1049 if (flags & FBMcf_TAIL)
1051 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
1052 BmRARE(sv),BmPREVIOUS(sv)));
1055 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
1056 /* If SvTAIL is actually due to \Z or \z, this gives false positives
1060 =for apidoc fbm_instr
1062 Returns the location of the SV in the string delimited by C<str> and
1063 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
1064 does not have to be fbm_compiled, but the search will not be as fast
1071 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
1073 register unsigned char *s;
1075 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
1076 register STRLEN littlelen = l;
1077 register I32 multiline = flags & FBMrf_MULTILINE;
1079 if (bigend - big < littlelen) {
1080 if ( SvTAIL(littlestr)
1081 && (bigend - big == littlelen - 1)
1083 || (*big == *little &&
1084 memEQ((char *)big, (char *)little, littlelen - 1))))
1089 if (littlelen <= 2) { /* Special-cased */
1091 if (littlelen == 1) {
1092 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
1093 /* Know that bigend != big. */
1094 if (bigend[-1] == '\n')
1095 return (char *)(bigend - 1);
1096 return (char *) bigend;
1099 while (s < bigend) {
1104 if (SvTAIL(littlestr))
1105 return (char *) bigend;
1109 return (char*)big; /* Cannot be SvTAIL! */
1111 /* littlelen is 2 */
1112 if (SvTAIL(littlestr) && !multiline) {
1113 if (bigend[-1] == '\n' && bigend[-2] == *little)
1114 return (char*)bigend - 2;
1115 if (bigend[-1] == *little)
1116 return (char*)bigend - 1;
1120 /* This should be better than FBM if c1 == c2, and almost
1121 as good otherwise: maybe better since we do less indirection.
1122 And we save a lot of memory by caching no table. */
1123 register unsigned char c1 = little[0];
1124 register unsigned char c2 = little[1];
1129 while (s <= bigend) {
1132 return (char*)s - 1;
1139 goto check_1char_anchor;
1150 goto check_1char_anchor;
1153 while (s <= bigend) {
1156 return (char*)s - 1;
1158 goto check_1char_anchor;
1167 check_1char_anchor: /* One char and anchor! */
1168 if (SvTAIL(littlestr) && (*bigend == *little))
1169 return (char *)bigend; /* bigend is already decremented. */
1172 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
1173 s = bigend - littlelen;
1174 if (s >= big && bigend[-1] == '\n' && *s == *little
1175 /* Automatically of length > 2 */
1176 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1178 return (char*)s; /* how sweet it is */
1181 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
1183 return (char*)s + 1; /* how sweet it is */
1187 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
1188 char *b = ninstr((char*)big,(char*)bigend,
1189 (char*)little, (char*)little + littlelen);
1191 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
1192 /* Chop \n from littlestr: */
1193 s = bigend - littlelen + 1;
1195 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1204 { /* Do actual FBM. */
1205 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
1206 register unsigned char *oldlittle;
1208 if (littlelen > bigend - big)
1210 --littlelen; /* Last char found by table lookup */
1212 s = big + littlelen;
1213 little += littlelen; /* last char */
1220 if ((tmp = table[*s])) {
1222 if (bigend - s > tmp) {
1228 if ((s += tmp) < bigend)
1233 else { /* less expensive than calling strncmp() */
1234 register unsigned char *olds = s;
1239 if (*--s == *--little)
1241 s = olds + 1; /* here we pay the price for failure */
1243 if (s < bigend) /* fake up continue to outer loop */
1251 if ( s == bigend && (table[-1] & FBMcf_TAIL)
1252 && memEQ((char *)(bigend - littlelen),
1253 (char *)(oldlittle - littlelen), littlelen) )
1254 return (char*)bigend - littlelen;
1259 /* start_shift, end_shift are positive quantities which give offsets
1260 of ends of some substring of bigstr.
1261 If `last' we want the last occurence.
1262 old_posp is the way of communication between consequent calls if
1263 the next call needs to find the .
1264 The initial *old_posp should be -1.
1266 Note that we take into account SvTAIL, so one can get extra
1267 optimizations if _ALL flag is set.
1270 /* If SvTAIL is actually due to \Z or \z, this gives false positives
1271 if PL_multiline. In fact if !PL_multiline the autoritative answer
1272 is not supported yet. */
1275 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1277 register unsigned char *s, *x;
1278 register unsigned char *big;
1280 register I32 previous;
1282 register unsigned char *little;
1283 register I32 stop_pos;
1284 register unsigned char *littleend;
1288 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1289 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
1291 if ( BmRARE(littlestr) == '\n'
1292 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
1293 little = (unsigned char *)(SvPVX(littlestr));
1294 littleend = little + SvCUR(littlestr);
1301 little = (unsigned char *)(SvPVX(littlestr));
1302 littleend = little + SvCUR(littlestr);
1304 /* The value of pos we can start at: */
1305 previous = BmPREVIOUS(littlestr);
1306 big = (unsigned char *)(SvPVX(bigstr));
1307 /* The value of pos we can stop at: */
1308 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1309 if (previous + start_shift > stop_pos) {
1310 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
1314 while (pos < previous + start_shift) {
1315 if (!(pos += PL_screamnext[pos]))
1320 if (pos >= stop_pos) break;
1321 if (big[pos-previous] != first)
1323 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1329 if (s == littleend) {
1331 if (!last) return (char *)(big+pos-previous);
1334 } while ( pos += PL_screamnext[pos] );
1335 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1336 #else /* !POINTERRIGOR */
1339 if (pos >= stop_pos) break;
1340 if (big[pos] != first)
1342 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1348 if (s == littleend) {
1350 if (!last) return (char *)(big+pos);
1353 } while ( pos += PL_screamnext[pos] );
1355 return (char *)(big+(*old_posp));
1356 #endif /* POINTERRIGOR */
1358 if (!SvTAIL(littlestr) || (end_shift > 0))
1360 /* Ignore the trailing "\n". This code is not microoptimized */
1361 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
1362 stop_pos = littleend - little; /* Actual littlestr len */
1367 && ((stop_pos == 1) ||
1368 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
1374 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
1376 register U8 *a = (U8 *)s1;
1377 register U8 *b = (U8 *)s2;
1379 if (*a != *b && *a != PL_fold[*b])
1387 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
1389 register U8 *a = (U8 *)s1;
1390 register U8 *b = (U8 *)s2;
1392 if (*a != *b && *a != PL_fold_locale[*b])
1399 /* copy a string to a safe spot */
1404 Copy a string to a safe spot. This does not use an SV.
1410 Perl_savepv(pTHX_ const char *sv)
1412 register char *newaddr;
1414 New(902,newaddr,strlen(sv)+1,char);
1415 (void)strcpy(newaddr,sv);
1419 /* same thing but with a known length */
1424 Copy a string to a safe spot. The C<len> indicates number of bytes to
1425 copy. This does not use an SV.
1431 Perl_savepvn(pTHX_ const char *sv, register I32 len)
1433 register char *newaddr;
1435 New(903,newaddr,len+1,char);
1436 Copy(sv,newaddr,len,char); /* might not be null terminated */
1437 newaddr[len] = '\0'; /* is now */
1441 /* the SV for Perl_form() and mess() is not kept in an arena */
1450 return sv_2mortal(newSVpvn("",0));
1455 /* Create as PVMG now, to avoid any upgrading later */
1456 New(905, sv, 1, SV);
1457 Newz(905, any, 1, XPVMG);
1458 SvFLAGS(sv) = SVt_PVMG;
1459 SvANY(sv) = (void*)any;
1460 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1465 #if defined(PERL_IMPLICIT_CONTEXT)
1467 Perl_form_nocontext(const char* pat, ...)
1472 va_start(args, pat);
1473 retval = vform(pat, &args);
1477 #endif /* PERL_IMPLICIT_CONTEXT */
1480 Perl_form(pTHX_ const char* pat, ...)
1484 va_start(args, pat);
1485 retval = vform(pat, &args);
1491 Perl_vform(pTHX_ const char *pat, va_list *args)
1493 SV *sv = mess_alloc();
1494 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1498 #if defined(PERL_IMPLICIT_CONTEXT)
1500 Perl_mess_nocontext(const char *pat, ...)
1505 va_start(args, pat);
1506 retval = vmess(pat, &args);
1510 #endif /* PERL_IMPLICIT_CONTEXT */
1513 Perl_mess(pTHX_ const char *pat, ...)
1517 va_start(args, pat);
1518 retval = vmess(pat, &args);
1524 Perl_vmess(pTHX_ const char *pat, va_list *args)
1526 SV *sv = mess_alloc();
1527 static char dgd[] = " during global destruction.\n";
1529 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1530 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1531 if (CopLINE(PL_curcop))
1532 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1533 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
1534 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1535 bool line_mode = (RsSIMPLE(PL_rs) &&
1536 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1537 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1538 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1539 line_mode ? "line" : "chunk",
1540 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1544 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1546 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1552 Perl_vdie(pTHX_ const char* pat, va_list *args)
1555 int was_in_eval = PL_in_eval;
1562 DEBUG_S(PerlIO_printf(Perl_debug_log,
1563 "%p: die: curstack = %p, mainstack = %p\n",
1564 thr, PL_curstack, PL_mainstack));
1567 msv = vmess(pat, args);
1568 if (PL_errors && SvCUR(PL_errors)) {
1569 sv_catsv(PL_errors, msv);
1570 message = SvPV(PL_errors, msglen);
1571 SvCUR_set(PL_errors, 0);
1574 message = SvPV(msv,msglen);
1581 DEBUG_S(PerlIO_printf(Perl_debug_log,
1582 "%p: die: message = %s\ndiehook = %p\n",
1583 thr, message, PL_diehook));
1585 /* sv_2cv might call Perl_croak() */
1586 SV *olddiehook = PL_diehook;
1588 SAVESPTR(PL_diehook);
1589 PL_diehook = Nullsv;
1590 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1592 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1599 msg = newSVpvn(message, msglen);
1607 PUSHSTACKi(PERLSI_DIEHOOK);
1611 call_sv((SV*)cv, G_DISCARD);
1617 PL_restartop = die_where(message, msglen);
1618 DEBUG_S(PerlIO_printf(Perl_debug_log,
1619 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1620 thr, PL_restartop, was_in_eval, PL_top_env));
1621 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1623 return PL_restartop;
1626 #if defined(PERL_IMPLICIT_CONTEXT)
1628 Perl_die_nocontext(const char* pat, ...)
1633 va_start(args, pat);
1634 o = vdie(pat, &args);
1638 #endif /* PERL_IMPLICIT_CONTEXT */
1641 Perl_die(pTHX_ const char* pat, ...)
1645 va_start(args, pat);
1646 o = vdie(pat, &args);
1652 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1662 msv = vmess(pat, args);
1663 if (PL_errors && SvCUR(PL_errors)) {
1664 sv_catsv(PL_errors, msv);
1665 message = SvPV(PL_errors, msglen);
1666 SvCUR_set(PL_errors, 0);
1669 message = SvPV(msv,msglen);
1676 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1677 PTR2UV(thr), message));
1680 /* sv_2cv might call Perl_croak() */
1681 SV *olddiehook = PL_diehook;
1683 SAVESPTR(PL_diehook);
1684 PL_diehook = Nullsv;
1685 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1687 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1694 msg = newSVpvn(message, msglen);
1702 PUSHSTACKi(PERLSI_DIEHOOK);
1706 call_sv((SV*)cv, G_DISCARD);
1712 PL_restartop = die_where(message, msglen);
1717 /* SFIO can really mess with your errno */
1720 PerlIO *serr = Perl_error_log;
1722 PerlIO_write(serr, message, msglen);
1723 (void)PerlIO_flush(serr);
1731 #if defined(PERL_IMPLICIT_CONTEXT)
1733 Perl_croak_nocontext(const char *pat, ...)
1737 va_start(args, pat);
1742 #endif /* PERL_IMPLICIT_CONTEXT */
1747 This is the XSUB-writer's interface to Perl's C<die> function.
1748 Normally use this function the same way you use the C C<printf>
1749 function. See C<warn>.
1751 If you want to throw an exception object, assign the object to
1752 C<$@> and then pass C<Nullch> to croak():
1754 errsv = get_sv("@", TRUE);
1755 sv_setsv(errsv, exception_object);
1762 Perl_croak(pTHX_ const char *pat, ...)
1765 va_start(args, pat);
1772 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1781 msv = vmess(pat, args);
1782 message = SvPV(msv, msglen);
1785 /* sv_2cv might call Perl_warn() */
1786 SV *oldwarnhook = PL_warnhook;
1788 SAVESPTR(PL_warnhook);
1789 PL_warnhook = Nullsv;
1790 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1792 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1798 msg = newSVpvn(message, msglen);
1802 PUSHSTACKi(PERLSI_WARNHOOK);
1806 call_sv((SV*)cv, G_DISCARD);
1813 PerlIO *serr = Perl_error_log;
1815 PerlIO_write(serr, message, msglen);
1817 DEBUG_L(*message == '!'
1818 ? (xstat(message[1]=='!'
1819 ? (message[2]=='!' ? 2 : 1)
1824 (void)PerlIO_flush(serr);
1828 #if defined(PERL_IMPLICIT_CONTEXT)
1830 Perl_warn_nocontext(const char *pat, ...)
1834 va_start(args, pat);
1838 #endif /* PERL_IMPLICIT_CONTEXT */
1843 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
1844 function the same way you use the C C<printf> function. See
1851 Perl_warn(pTHX_ const char *pat, ...)
1854 va_start(args, pat);
1859 #if defined(PERL_IMPLICIT_CONTEXT)
1861 Perl_warner_nocontext(U32 err, const char *pat, ...)
1865 va_start(args, pat);
1866 vwarner(err, pat, &args);
1869 #endif /* PERL_IMPLICIT_CONTEXT */
1872 Perl_warner(pTHX_ U32 err, const char* pat,...)
1875 va_start(args, pat);
1876 vwarner(err, pat, &args);
1881 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1890 msv = vmess(pat, args);
1891 message = SvPV(msv, msglen);
1895 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s", PTR2UV(thr), message));
1896 #endif /* USE_THREADS */
1898 /* sv_2cv might call Perl_croak() */
1899 SV *olddiehook = PL_diehook;
1901 SAVESPTR(PL_diehook);
1902 PL_diehook = Nullsv;
1903 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1905 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1911 msg = newSVpvn(message, msglen);
1915 PUSHSTACKi(PERLSI_DIEHOOK);
1919 call_sv((SV*)cv, G_DISCARD);
1925 PL_restartop = die_where(message, msglen);
1929 PerlIO *serr = Perl_error_log;
1930 PerlIO_write(serr, message, msglen);
1931 (void)PerlIO_flush(serr);
1938 /* sv_2cv might call Perl_warn() */
1939 SV *oldwarnhook = PL_warnhook;
1941 SAVESPTR(PL_warnhook);
1942 PL_warnhook = Nullsv;
1943 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1945 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1951 msg = newSVpvn(message, msglen);
1955 PUSHSTACKi(PERLSI_WARNHOOK);
1959 call_sv((SV*)cv, G_DISCARD);
1966 PerlIO *serr = Perl_error_log;
1967 PerlIO_write(serr, message, msglen);
1969 DEBUG_L(*message == '!'
1970 ? (xstat(message[1]=='!'
1971 ? (message[2]=='!' ? 2 : 1)
1976 (void)PerlIO_flush(serr);
1981 #ifdef USE_ENVIRON_ARRAY
1982 /* VMS' and EPOC's my_setenv() is in vms.c and epoc.c */
1985 Perl_my_setenv(pTHX_ char *nam, char *val)
1987 #ifndef PERL_USE_SAFE_PUTENV
1988 /* most putenv()s leak, so we manipulate environ directly */
1989 register I32 i=setenv_getix(nam); /* where does it go? */
1991 if (environ == PL_origenviron) { /* need we copy environment? */
1997 for (max = i; environ[max]; max++) ;
1998 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1999 for (j=0; j<max; j++) { /* copy environment */
2000 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
2001 strcpy(tmpenv[j], environ[j]);
2003 tmpenv[max] = Nullch;
2004 environ = tmpenv; /* tell exec where it is now */
2007 safesysfree(environ[i]);
2008 while (environ[i]) {
2009 environ[i] = environ[i+1];
2014 if (!environ[i]) { /* does not exist yet */
2015 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2016 environ[i+1] = Nullch; /* make sure it's null terminated */
2019 safesysfree(environ[i]);
2020 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
2022 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
2024 #else /* PERL_USE_SAFE_PUTENV */
2025 # if defined(__CYGWIN__)
2026 setenv(nam, val, 1);
2030 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
2031 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
2032 (void)putenv(new_env);
2033 # endif /* __CYGWIN__ */
2034 #endif /* PERL_USE_SAFE_PUTENV */
2040 Perl_my_setenv(pTHX_ char *nam,char *val)
2042 register char *envstr;
2043 STRLEN len = strlen(nam) + 3;
2048 New(904, envstr, len, char);
2049 (void)sprintf(envstr,"%s=%s",nam,val);
2050 (void)PerlEnv_putenv(envstr);
2057 Perl_setenv_getix(pTHX_ char *nam)
2059 register I32 i, len = strlen(nam);
2061 for (i = 0; environ[i]; i++) {
2064 strnicmp(environ[i],nam,len) == 0
2066 strnEQ(environ[i],nam,len)
2068 && environ[i][len] == '=')
2069 break; /* strnEQ must come first to avoid */
2070 } /* potential SEGV's */
2074 #endif /* !VMS && !EPOC*/
2076 #ifdef UNLINK_ALL_VERSIONS
2078 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
2082 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
2087 /* this is a drop-in replacement for bcopy() */
2088 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
2090 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
2094 if (from - to >= 0) {
2102 *(--to) = *(--from);
2108 /* this is a drop-in replacement for memset() */
2111 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
2121 /* this is a drop-in replacement for bzero() */
2122 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2124 Perl_my_bzero(register char *loc, register I32 len)
2134 /* this is a drop-in replacement for memcmp() */
2135 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2137 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
2139 register U8 *a = (U8 *)s1;
2140 register U8 *b = (U8 *)s2;
2144 if (tmp = *a++ - *b++)
2149 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2153 #ifdef USE_CHAR_VSPRINTF
2158 vsprintf(char *dest, const char *pat, char *args)
2162 fakebuf._ptr = dest;
2163 fakebuf._cnt = 32767;
2167 fakebuf._flag = _IOWRT|_IOSTRG;
2168 _doprnt(pat, args, &fakebuf); /* what a kludge */
2169 (void)putc('\0', &fakebuf);
2170 #ifdef USE_CHAR_VSPRINTF
2173 return 0; /* perl doesn't use return value */
2177 #endif /* HAS_VPRINTF */
2180 #if BYTEORDER != 0x4321
2182 Perl_my_swap(pTHX_ short s)
2184 #if (BYTEORDER & 1) == 0
2187 result = ((s & 255) << 8) + ((s >> 8) & 255);
2195 Perl_my_htonl(pTHX_ long l)
2199 char c[sizeof(long)];
2202 #if BYTEORDER == 0x1234
2203 u.c[0] = (l >> 24) & 255;
2204 u.c[1] = (l >> 16) & 255;
2205 u.c[2] = (l >> 8) & 255;
2209 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2210 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2215 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2216 u.c[o & 0xf] = (l >> s) & 255;
2224 Perl_my_ntohl(pTHX_ long l)
2228 char c[sizeof(long)];
2231 #if BYTEORDER == 0x1234
2232 u.c[0] = (l >> 24) & 255;
2233 u.c[1] = (l >> 16) & 255;
2234 u.c[2] = (l >> 8) & 255;
2238 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2239 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2246 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2247 l |= (u.c[o & 0xf] & 255) << s;
2254 #endif /* BYTEORDER != 0x4321 */
2258 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2259 * If these functions are defined,
2260 * the BYTEORDER is neither 0x1234 nor 0x4321.
2261 * However, this is not assumed.
2265 #define HTOV(name,type) \
2267 name (register type n) \
2271 char c[sizeof(type)]; \
2275 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2276 u.c[i] = (n >> s) & 0xFF; \
2281 #define VTOH(name,type) \
2283 name (register type n) \
2287 char c[sizeof(type)]; \
2293 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
2294 n += (u.c[i] & 0xFF) << s; \
2299 #if defined(HAS_HTOVS) && !defined(htovs)
2302 #if defined(HAS_HTOVL) && !defined(htovl)
2305 #if defined(HAS_VTOHS) && !defined(vtohs)
2308 #if defined(HAS_VTOHL) && !defined(vtohl)
2313 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2315 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2317 register I32 This, that;
2323 PERL_FLUSHALL_FOR_CHILD;
2324 This = (*mode == 'w');
2328 taint_proper("Insecure %s%s", "EXEC");
2330 if (PerlProc_pipe(p) < 0)
2332 /* Try for another pipe pair for error return */
2333 if (PerlProc_pipe(pp) >= 0)
2335 while ((pid = vfork()) < 0) {
2336 if (errno != EAGAIN) {
2337 PerlLIO_close(p[This]);
2339 PerlLIO_close(pp[0]);
2340 PerlLIO_close(pp[1]);
2354 /* Close parent's end of _the_ pipe */
2355 PerlLIO_close(p[THAT]);
2356 /* Close parent's end of error status pipe (if any) */
2358 PerlLIO_close(pp[0]);
2359 #if defined(HAS_FCNTL) && defined(F_SETFD)
2360 /* Close error pipe automatically if exec works */
2361 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2364 /* Now dup our end of _the_ pipe to right position */
2365 if (p[THIS] != (*mode == 'r')) {
2366 PerlLIO_dup2(p[THIS], *mode == 'r');
2367 PerlLIO_close(p[THIS]);
2369 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2370 /* No automatic close - do it by hand */
2374 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2379 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2385 do_execfree(); /* free any memory malloced by child on vfork */
2386 /* Close child's end of pipe */
2387 PerlLIO_close(p[that]);
2389 PerlLIO_close(pp[1]);
2390 /* Keep the lower of the two fd numbers */
2391 if (p[that] < p[This]) {
2392 PerlLIO_dup2(p[This], p[that]);
2393 PerlLIO_close(p[This]);
2397 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2399 (void)SvUPGRADE(sv,SVt_IV);
2401 PL_forkprocess = pid;
2402 /* If we managed to get status pipe check for exec fail */
2403 if (did_pipes && pid > 0) {
2407 while (n < sizeof(int)) {
2408 n1 = PerlLIO_read(pp[0],
2409 (void*)(((char*)&errkid)+n),
2415 PerlLIO_close(pp[0]);
2417 if (n) { /* Error */
2419 if (n != sizeof(int))
2420 Perl_croak(aTHX_ "panic: kid popen errno read");
2422 pid2 = wait4pid(pid, &status, 0);
2423 } while (pid2 == -1 && errno == EINTR);
2424 errno = errkid; /* Propagate errno from kid */
2429 PerlLIO_close(pp[0]);
2430 return PerlIO_fdopen(p[This], mode);
2432 Perl_croak(aTHX_ "List form of piped open not implemented");
2433 return (PerlIO *) NULL;
2437 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2438 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2440 Perl_my_popen(pTHX_ char *cmd, char *mode)
2443 register I32 This, that;
2446 I32 doexec = strNE(cmd,"-");
2450 PERL_FLUSHALL_FOR_CHILD;
2453 return my_syspopen(aTHX_ cmd,mode);
2456 This = (*mode == 'w');
2458 if (doexec && PL_tainting) {
2460 taint_proper("Insecure %s%s", "EXEC");
2462 if (PerlProc_pipe(p) < 0)
2464 if (doexec && PerlProc_pipe(pp) >= 0)
2466 while ((pid = (doexec?vfork():fork())) < 0) {
2467 if (errno != EAGAIN) {
2468 PerlLIO_close(p[This]);
2470 PerlLIO_close(pp[0]);
2471 PerlLIO_close(pp[1]);
2474 Perl_croak(aTHX_ "Can't fork");
2486 PerlLIO_close(p[THAT]);
2488 PerlLIO_close(pp[0]);
2489 #if defined(HAS_FCNTL) && defined(F_SETFD)
2490 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2493 if (p[THIS] != (*mode == 'r')) {
2494 PerlLIO_dup2(p[THIS], *mode == 'r');
2495 PerlLIO_close(p[THIS]);
2499 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2505 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2509 do_exec3(cmd,pp[1],did_pipes); /* may or may not use the shell */
2512 #endif /* defined OS2 */
2514 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV)))
2515 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2517 hv_clear(PL_pidstatus); /* we have no children */
2522 do_execfree(); /* free any memory malloced by child on vfork */
2523 PerlLIO_close(p[that]);
2525 PerlLIO_close(pp[1]);
2526 if (p[that] < p[This]) {
2527 PerlLIO_dup2(p[This], p[that]);
2528 PerlLIO_close(p[This]);
2532 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2534 (void)SvUPGRADE(sv,SVt_IV);
2536 PL_forkprocess = pid;
2537 if (did_pipes && pid > 0) {
2541 while (n < sizeof(int)) {
2542 n1 = PerlLIO_read(pp[0],
2543 (void*)(((char*)&errkid)+n),
2549 PerlLIO_close(pp[0]);
2551 if (n) { /* Error */
2553 if (n != sizeof(int))
2554 Perl_croak(aTHX_ "panic: kid popen errno read");
2556 pid2 = wait4pid(pid, &status, 0);
2557 } while (pid2 == -1 && errno == EINTR);
2558 errno = errkid; /* Propagate errno from kid */
2563 PerlLIO_close(pp[0]);
2564 return PerlIO_fdopen(p[This], mode);
2567 #if defined(atarist) || defined(DJGPP)
2570 Perl_my_popen(pTHX_ char *cmd, char *mode)
2572 PERL_FLUSHALL_FOR_CHILD;
2573 /* Call system's popen() to get a FILE *, then import it.
2574 used 0 for 2nd parameter to PerlIO_importFILE;
2577 return PerlIO_importFILE(popen(cmd, mode), 0);
2581 #endif /* !DOSISH */
2585 Perl_dump_fds(pTHX_ char *s)
2588 struct stat tmpstatbuf;
2590 PerlIO_printf(Perl_debug_log,"%s", s);
2591 for (fd = 0; fd < 32; fd++) {
2592 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2593 PerlIO_printf(Perl_debug_log," %d",fd);
2595 PerlIO_printf(Perl_debug_log,"\n");
2597 #endif /* DUMP_FDS */
2601 dup2(int oldfd, int newfd)
2603 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2606 PerlLIO_close(newfd);
2607 return fcntl(oldfd, F_DUPFD, newfd);
2609 #define DUP2_MAX_FDS 256
2610 int fdtmp[DUP2_MAX_FDS];
2616 PerlLIO_close(newfd);
2617 /* good enough for low fd's... */
2618 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2619 if (fdx >= DUP2_MAX_FDS) {
2627 PerlLIO_close(fdtmp[--fdx]);
2634 #ifdef HAS_SIGACTION
2637 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2639 struct sigaction act, oact;
2641 act.sa_handler = handler;
2642 sigemptyset(&act.sa_mask);
2645 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2646 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2650 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2651 act.sa_flags |= SA_NOCLDWAIT;
2653 if (sigaction(signo, &act, &oact) == -1)
2656 return oact.sa_handler;
2660 Perl_rsignal_state(pTHX_ int signo)
2662 struct sigaction oact;
2664 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2667 return oact.sa_handler;
2671 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2673 struct sigaction act;
2675 act.sa_handler = handler;
2676 sigemptyset(&act.sa_mask);
2679 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2680 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2684 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2685 act.sa_flags |= SA_NOCLDWAIT;
2687 return sigaction(signo, &act, save);
2691 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2693 return sigaction(signo, save, (struct sigaction *)NULL);
2696 #else /* !HAS_SIGACTION */
2699 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2701 return PerlProc_signal(signo, handler);
2704 static int sig_trapped;
2714 Perl_rsignal_state(pTHX_ int signo)
2716 Sighandler_t oldsig;
2719 oldsig = PerlProc_signal(signo, sig_trap);
2720 PerlProc_signal(signo, oldsig);
2722 PerlProc_kill(PerlProc_getpid(), signo);
2727 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2729 *save = PerlProc_signal(signo, handler);
2730 return (*save == SIG_ERR) ? -1 : 0;
2734 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2736 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2739 #endif /* !HAS_SIGACTION */
2740 #endif /* !PERL_MICRO */
2742 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2743 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2745 Perl_my_pclose(pTHX_ PerlIO *ptr)
2747 Sigsave_t hstat, istat, qstat;
2755 int saved_vaxc_errno;
2758 int saved_win32_errno;
2762 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2764 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2766 *svp = &PL_sv_undef;
2768 if (pid == -1) { /* Opened by popen. */
2769 return my_syspclose(ptr);
2772 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2773 saved_errno = errno;
2775 saved_vaxc_errno = vaxc$errno;
2778 saved_win32_errno = GetLastError();
2782 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2785 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2786 rsignal_save(SIGINT, SIG_IGN, &istat);
2787 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2790 pid2 = wait4pid(pid, &status, 0);
2791 } while (pid2 == -1 && errno == EINTR);
2793 rsignal_restore(SIGHUP, &hstat);
2794 rsignal_restore(SIGINT, &istat);
2795 rsignal_restore(SIGQUIT, &qstat);
2798 SETERRNO(saved_errno, saved_vaxc_errno);
2801 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2803 #endif /* !DOSISH */
2805 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32)) && !defined(MACOS_TRADITIONAL)
2807 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2811 char spid[TYPE_CHARS(int)];
2815 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2817 sprintf(spid, "%"IVdf, (IV)pid);
2818 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2819 if (svp && *svp != &PL_sv_undef) {
2820 *statusp = SvIVX(*svp);
2821 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2828 hv_iterinit(PL_pidstatus);
2829 if ((entry = hv_iternext(PL_pidstatus))) {
2830 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2831 sv = hv_iterval(PL_pidstatus,entry);
2832 *statusp = SvIVX(sv);
2833 sprintf(spid, "%"IVdf, (IV)pid);
2834 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2840 # ifdef HAS_WAITPID_RUNTIME
2841 if (!HAS_WAITPID_RUNTIME)
2844 return PerlProc_waitpid(pid,statusp,flags);
2846 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2847 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2849 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2854 Perl_croak(aTHX_ "Can't do waitpid with flags");
2856 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2857 pidgone(result,*statusp);
2865 #endif /* !DOSISH || OS2 || WIN32 */
2869 Perl_pidgone(pTHX_ Pid_t pid, int status)
2872 char spid[TYPE_CHARS(int)];
2874 sprintf(spid, "%"IVdf, (IV)pid);
2875 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2876 (void)SvUPGRADE(sv,SVt_IV);
2881 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2884 int /* Cannot prototype with I32
2886 my_syspclose(PerlIO *ptr)
2889 Perl_my_pclose(pTHX_ PerlIO *ptr)
2892 /* Needs work for PerlIO ! */
2893 FILE *f = PerlIO_findFILE(ptr);
2894 I32 result = pclose(f);
2896 result = (result << 8) & 0xff00;
2898 PerlIO_releaseFILE(ptr,f);
2904 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2907 register const char *frombase = from;
2910 register const char c = *from;
2915 while (count-- > 0) {
2916 for (todo = len; todo > 0; todo--) {
2924 Perl_cast_ulong(pTHX_ NV f)
2929 # define BIGDOUBLE 2147483648.0
2931 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2934 return (unsigned long)f;
2936 return (unsigned long)along;
2940 /* Unfortunately, on some systems the cast_uv() function doesn't
2941 work with the system-supplied definition of ULONG_MAX. The
2942 comparison (f >= ULONG_MAX) always comes out true. It must be a
2943 problem with the compiler constant folding.
2945 In any case, this workaround should be fine on any two's complement
2946 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2948 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2951 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2953 -- Kenneth Albanowski <kjahds@kjahds.com>
2957 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2961 Perl_cast_i32(pTHX_ NV f)
2964 return (I32) I32_MAX;
2966 return (I32) I32_MIN;
2971 Perl_cast_iv(pTHX_ NV f)
2976 if (f >= (NV)UV_MAX)
2987 Perl_cast_uv(pTHX_ NV f)
2990 return (UV) MY_UV_MAX;
3004 Perl_same_dirent(pTHX_ char *a, char *b)
3006 char *fa = strrchr(a,'/');
3007 char *fb = strrchr(b,'/');
3008 struct stat tmpstatbuf1;
3009 struct stat tmpstatbuf2;
3010 SV *tmpsv = sv_newmortal();
3023 sv_setpv(tmpsv, ".");
3025 sv_setpvn(tmpsv, a, fa - a);
3026 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
3029 sv_setpv(tmpsv, ".");
3031 sv_setpvn(tmpsv, b, fb - b);
3032 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
3034 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3035 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3037 #endif /* !HAS_RENAME */
3040 Perl_scan_bin(pTHX_ char *start, STRLEN len, STRLEN *retlen)
3042 register char *s = start;
3043 register NV rnv = 0.0;
3044 register UV ruv = 0;
3045 register bool seenb = FALSE;
3046 register bool overflowed = FALSE;
3048 for (; len-- && *s; s++) {
3049 if (!(*s == '0' || *s == '1')) {
3050 if (*s == '_' && len && *retlen
3051 && (s[1] == '0' || s[1] == '1'))
3056 else if (seenb == FALSE && *s == 'b' && ruv == 0) {
3057 /* Disallow 0bbb0b0bbb... */
3062 if (ckWARN(WARN_DIGIT))
3063 Perl_warner(aTHX_ WARN_DIGIT,
3064 "Illegal binary digit '%c' ignored", *s);
3069 register UV xuv = ruv << 1;
3071 if ((xuv >> 1) != ruv) {
3074 if (ckWARN_d(WARN_OVERFLOW))
3075 Perl_warner(aTHX_ WARN_OVERFLOW,
3076 "Integer overflow in binary number");
3079 ruv = xuv | (*s - '0');
3083 /* If an NV has not enough bits in its mantissa to
3084 * represent an UV this summing of small low-order numbers
3085 * is a waste of time (because the NV cannot preserve
3086 * the low-order bits anyway): we could just remember when
3087 * did we overflow and in the end just multiply rnv by the
3094 if ( ( overflowed && rnv > 4294967295.0)
3096 || (!overflowed && ruv > 0xffffffff )
3099 if (ckWARN(WARN_PORTABLE))
3100 Perl_warner(aTHX_ WARN_PORTABLE,
3101 "Binary number > 0b11111111111111111111111111111111 non-portable");
3103 *retlen = s - start;
3108 Perl_scan_oct(pTHX_ char *start, STRLEN len, STRLEN *retlen)
3110 register char *s = start;
3111 register NV rnv = 0.0;
3112 register UV ruv = 0;
3113 register bool overflowed = FALSE;
3115 for (; len-- && *s; s++) {
3116 if (!(*s >= '0' && *s <= '7')) {
3117 if (*s == '_' && len && *retlen
3118 && (s[1] >= '0' && s[1] <= '7'))
3124 /* Allow \octal to work the DWIM way (that is, stop scanning
3125 * as soon as non-octal characters are seen, complain only iff
3126 * someone seems to want to use the digits eight and nine). */
3127 if (*s == '8' || *s == '9') {
3128 if (ckWARN(WARN_DIGIT))
3129 Perl_warner(aTHX_ WARN_DIGIT,
3130 "Illegal octal digit '%c' ignored", *s);
3136 register UV xuv = ruv << 3;
3138 if ((xuv >> 3) != ruv) {
3141 if (ckWARN_d(WARN_OVERFLOW))
3142 Perl_warner(aTHX_ WARN_OVERFLOW,
3143 "Integer overflow in octal number");
3146 ruv = xuv | (*s - '0');
3150 /* If an NV has not enough bits in its mantissa to
3151 * represent an UV this summing of small low-order numbers
3152 * is a waste of time (because the NV cannot preserve
3153 * the low-order bits anyway): we could just remember when
3154 * did we overflow and in the end just multiply rnv by the
3155 * right amount of 8-tuples. */
3156 rnv += (NV)(*s - '0');
3161 if ( ( overflowed && rnv > 4294967295.0)
3163 || (!overflowed && ruv > 0xffffffff )
3166 if (ckWARN(WARN_PORTABLE))
3167 Perl_warner(aTHX_ WARN_PORTABLE,
3168 "Octal number > 037777777777 non-portable");
3170 *retlen = s - start;
3175 Perl_scan_hex(pTHX_ char *start, STRLEN len, STRLEN *retlen)
3177 register char *s = start;
3178 register NV rnv = 0.0;
3179 register UV ruv = 0;
3180 register bool overflowed = FALSE;
3188 else if (len > 3 && s[0] == '0' && s[1] == 'x') {
3194 for (; len-- && *s; s++) {
3195 hexdigit = strchr((char *) PL_hexdigit, *s);
3197 if (*s == '_' && len && *retlen && s[1]
3198 && (hexdigit = strchr((char *) PL_hexdigit, s[1])))
3204 if (ckWARN(WARN_DIGIT))
3205 Perl_warner(aTHX_ WARN_DIGIT,
3206 "Illegal hexadecimal digit '%c' ignored", *s);
3211 register UV xuv = ruv << 4;
3213 if ((xuv >> 4) != ruv) {
3216 if (ckWARN_d(WARN_OVERFLOW))
3217 Perl_warner(aTHX_ WARN_OVERFLOW,
3218 "Integer overflow in hexadecimal number");
3221 ruv = xuv | ((hexdigit - PL_hexdigit) & 15);
3225 /* If an NV has not enough bits in its mantissa to
3226 * represent an UV this summing of small low-order numbers
3227 * is a waste of time (because the NV cannot preserve
3228 * the low-order bits anyway): we could just remember when
3229 * did we overflow and in the end just multiply rnv by the
3230 * right amount of 16-tuples. */
3231 rnv += (NV)((hexdigit - PL_hexdigit) & 15);
3236 if ( ( overflowed && rnv > 4294967295.0)
3238 || (!overflowed && ruv > 0xffffffff )
3241 if (ckWARN(WARN_PORTABLE))
3242 Perl_warner(aTHX_ WARN_PORTABLE,
3243 "Hexadecimal number > 0xffffffff non-portable");
3245 *retlen = s - start;
3250 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
3252 char *xfound = Nullch;
3253 char *xfailed = Nullch;
3254 char tmpbuf[MAXPATHLEN];
3258 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3259 # define SEARCH_EXTS ".bat", ".cmd", NULL
3260 # define MAX_EXT_LEN 4
3263 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3264 # define MAX_EXT_LEN 4
3267 # define SEARCH_EXTS ".pl", ".com", NULL
3268 # define MAX_EXT_LEN 4
3270 /* additional extensions to try in each dir if scriptname not found */
3272 char *exts[] = { SEARCH_EXTS };
3273 char **ext = search_ext ? search_ext : exts;
3274 int extidx = 0, i = 0;
3275 char *curext = Nullch;
3277 # define MAX_EXT_LEN 0
3281 * If dosearch is true and if scriptname does not contain path
3282 * delimiters, search the PATH for scriptname.
3284 * If SEARCH_EXTS is also defined, will look for each
3285 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3286 * while searching the PATH.
3288 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3289 * proceeds as follows:
3290 * If DOSISH or VMSISH:
3291 * + look for ./scriptname{,.foo,.bar}
3292 * + search the PATH for scriptname{,.foo,.bar}
3295 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3296 * this will not look in '.' if it's not in the PATH)
3301 # ifdef ALWAYS_DEFTYPES
3302 len = strlen(scriptname);
3303 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3304 int hasdir, idx = 0, deftypes = 1;
3307 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
3310 int hasdir, idx = 0, deftypes = 1;
3313 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
3315 /* The first time through, just add SEARCH_EXTS to whatever we
3316 * already have, so we can check for default file types. */
3318 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3324 if ((strlen(tmpbuf) + strlen(scriptname)
3325 + MAX_EXT_LEN) >= sizeof tmpbuf)
3326 continue; /* don't search dir with too-long name */
3327 strcat(tmpbuf, scriptname);
3331 if (strEQ(scriptname, "-"))
3333 if (dosearch) { /* Look in '.' first. */
3334 char *cur = scriptname;
3336 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3338 if (strEQ(ext[i++],curext)) {
3339 extidx = -1; /* already has an ext */
3344 DEBUG_p(PerlIO_printf(Perl_debug_log,
3345 "Looking for %s\n",cur));
3346 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3347 && !S_ISDIR(PL_statbuf.st_mode)) {
3355 if (cur == scriptname) {
3356 len = strlen(scriptname);
3357 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3359 cur = strcpy(tmpbuf, scriptname);
3361 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3362 && strcpy(tmpbuf+len, ext[extidx++]));
3367 #ifdef MACOS_TRADITIONAL
3368 if (dosearch && !strchr(scriptname, ':') &&
3369 (s = PerlEnv_getenv("Commands")))
3371 if (dosearch && !strchr(scriptname, '/')
3373 && !strchr(scriptname, '\\')
3375 && (s = PerlEnv_getenv("PATH")))
3380 PL_bufend = s + strlen(s);
3381 while (s < PL_bufend) {
3382 #ifdef MACOS_TRADITIONAL
3383 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3387 #if defined(atarist) || defined(DOSISH)
3392 && *s != ';'; len++, s++) {
3393 if (len < sizeof tmpbuf)
3396 if (len < sizeof tmpbuf)
3398 #else /* ! (atarist || DOSISH) */
3399 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3402 #endif /* ! (atarist || DOSISH) */
3403 #endif /* MACOS_TRADITIONAL */
3406 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3407 continue; /* don't search dir with too-long name */
3408 #ifdef MACOS_TRADITIONAL
3409 if (len && tmpbuf[len - 1] != ':')
3410 tmpbuf[len++] = ':';
3413 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3414 && tmpbuf[len - 1] != '/'
3415 && tmpbuf[len - 1] != '\\'
3418 tmpbuf[len++] = '/';
3419 if (len == 2 && tmpbuf[0] == '.')
3422 (void)strcpy(tmpbuf + len, scriptname);
3426 len = strlen(tmpbuf);
3427 if (extidx > 0) /* reset after previous loop */
3431 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3432 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3433 if (S_ISDIR(PL_statbuf.st_mode)) {
3437 } while ( retval < 0 /* not there */
3438 && extidx>=0 && ext[extidx] /* try an extension? */
3439 && strcpy(tmpbuf+len, ext[extidx++])
3444 if (S_ISREG(PL_statbuf.st_mode)
3445 && cando(S_IRUSR,TRUE,&PL_statbuf)
3446 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3447 && cando(S_IXUSR,TRUE,&PL_statbuf)
3451 xfound = tmpbuf; /* bingo! */
3455 xfailed = savepv(tmpbuf);
3458 if (!xfound && !seen_dot && !xfailed &&
3459 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3460 || S_ISDIR(PL_statbuf.st_mode)))
3462 seen_dot = 1; /* Disable message. */
3464 if (flags & 1) { /* do or die? */
3465 Perl_croak(aTHX_ "Can't %s %s%s%s",
3466 (xfailed ? "execute" : "find"),
3467 (xfailed ? xfailed : scriptname),
3468 (xfailed ? "" : " on PATH"),
3469 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3471 scriptname = Nullch;
3475 scriptname = xfound;
3477 return (scriptname ? savepv(scriptname) : Nullch);
3480 #ifndef PERL_GET_CONTEXT_DEFINED
3483 Perl_get_context(void)
3485 #if defined(USE_THREADS) || defined(USE_ITHREADS)
3486 # ifdef OLD_PTHREADS_API
3488 if (pthread_getspecific(PL_thr_key, &t))
3489 Perl_croak_nocontext("panic: pthread_getspecific");
3492 # ifdef I_MACH_CTHREADS
3493 return (void*)cthread_data(cthread_self());
3495 return (void*)pthread_getspecific(PL_thr_key);
3504 Perl_set_context(void *t)
3506 #if defined(USE_THREADS) || defined(USE_ITHREADS)
3507 # ifdef I_MACH_CTHREADS
3508 cthread_set_data(cthread_self(), t);
3510 if (pthread_setspecific(PL_thr_key, t))
3511 Perl_croak_nocontext("panic: pthread_setspecific");
3516 #endif /* !PERL_GET_CONTEXT_DEFINED */
3521 /* Very simplistic scheduler for now */
3525 thr = thr->i.next_run;
3529 Perl_cond_init(pTHX_ perl_cond *cp)
3535 Perl_cond_signal(pTHX_ perl_cond *cp)
3538 perl_cond cond = *cp;
3543 /* Insert t in the runnable queue just ahead of us */
3544 t->i.next_run = thr->i.next_run;
3545 thr->i.next_run->i.prev_run = t;
3546 t->i.prev_run = thr;
3547 thr->i.next_run = t;
3548 thr->i.wait_queue = 0;
3549 /* Remove from the wait queue */
3555 Perl_cond_broadcast(pTHX_ perl_cond *cp)
3558 perl_cond cond, cond_next;
3560 for (cond = *cp; cond; cond = cond_next) {
3562 /* Insert t in the runnable queue just ahead of us */
3563 t->i.next_run = thr->i.next_run;
3564 thr->i.next_run->i.prev_run = t;
3565 t->i.prev_run = thr;
3566 thr->i.next_run = t;
3567 thr->i.wait_queue = 0;
3568 /* Remove from the wait queue */
3569 cond_next = cond->next;
3576 Perl_cond_wait(pTHX_ perl_cond *cp)
3580 if (thr->i.next_run == thr)
3581 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
3583 New(666, cond, 1, struct perl_wait_queue);
3587 thr->i.wait_queue = cond;
3588 /* Remove ourselves from runnable queue */
3589 thr->i.next_run->i.prev_run = thr->i.prev_run;
3590 thr->i.prev_run->i.next_run = thr->i.next_run;
3592 #endif /* FAKE_THREADS */
3595 Perl_condpair_magic(pTHX_ SV *sv)
3599 SvUPGRADE(sv, SVt_PVMG);
3600 mg = mg_find(sv, 'm');
3604 New(53, cp, 1, condpair_t);
3605 MUTEX_INIT(&cp->mutex);
3606 COND_INIT(&cp->owner_cond);
3607 COND_INIT(&cp->cond);
3609 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
3610 mg = mg_find(sv, 'm');
3612 /* someone else beat us to initialising it */
3613 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
3614 MUTEX_DESTROY(&cp->mutex);
3615 COND_DESTROY(&cp->owner_cond);
3616 COND_DESTROY(&cp->cond);
3620 sv_magic(sv, Nullsv, 'm', 0, 0);
3622 mg->mg_ptr = (char *)cp;
3623 mg->mg_len = sizeof(cp);
3624 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
3625 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
3626 "%p: condpair_magic %p\n", thr, sv));)
3633 Perl_sv_lock(pTHX_ SV *osv)
3643 mg = condpair_magic(sv);
3644 MUTEX_LOCK(MgMUTEXP(mg));
3645 if (MgOWNER(mg) == thr)
3646 MUTEX_UNLOCK(MgMUTEXP(mg));
3649 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
3651 DEBUG_S(PerlIO_printf(Perl_debug_log,
3652 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
3653 PTR2UV(thr), PTR2UV(sv));)
3654 MUTEX_UNLOCK(MgMUTEXP(mg));
3655 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
3657 UNLOCK_SV_LOCK_MUTEX;
3662 * Make a new perl thread structure using t as a prototype. Some of the
3663 * fields for the new thread are copied from the prototype thread, t,
3664 * so t should not be running in perl at the time this function is
3665 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3666 * thread calling new_struct_thread) clearly satisfies this constraint.
3668 struct perl_thread *
3669 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3671 #if !defined(PERL_IMPLICIT_CONTEXT)
3672 struct perl_thread *thr;
3678 sv = newSVpvn("", 0);
3679 SvGROW(sv, sizeof(struct perl_thread) + 1);
3680 SvCUR_set(sv, sizeof(struct perl_thread));
3681 thr = (Thread) SvPVX(sv);
3683 memset(thr, 0xab, sizeof(struct perl_thread));
3690 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3691 PL_efloatbuf = (char*)NULL;
3694 Zero(thr, 1, struct perl_thread);
3700 PL_curcop = &PL_compiling;
3701 thr->interp = t->interp;
3702 thr->cvcache = newHV();
3703 thr->threadsv = newAV();
3704 thr->specific = newAV();
3705 thr->errsv = newSVpvn("", 0);
3706 thr->flags = THRf_R_JOINABLE;
3708 MUTEX_INIT(&thr->mutex);
3712 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
3715 PL_statname = NEWSV(66,0);
3716 PL_errors = newSVpvn("", 0);
3718 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3719 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3720 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3721 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3722 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3724 PL_reginterp_cnt = 0;
3725 PL_lastscream = Nullsv;
3728 PL_reg_start_tmp = 0;
3729 PL_reg_start_tmpl = 0;
3730 PL_reg_poscache = Nullch;
3732 /* parent thread's data needs to be locked while we make copy */
3733 MUTEX_LOCK(&t->mutex);
3735 #ifdef PERL_FLEXIBLE_EXCEPTIONS
3736 PL_protect = t->Tprotect;
3739 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3740 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3741 PL_curstash = t->Tcurstash; /* always be set to main? */
3743 PL_tainted = t->Ttainted;
3744 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3745 PL_nrs = newSVsv(t->Tnrs);
3746 PL_rs = t->Tnrs ? SvREFCNT_inc(PL_nrs) : Nullsv;
3747 PL_last_in_gv = Nullgv;
3748 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
3749 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3750 PL_chopset = t->Tchopset;
3751 PL_bodytarget = newSVsv(t->Tbodytarget);
3752 PL_toptarget = newSVsv(t->Ttoptarget);
3753 if (t->Tformtarget == t->Ttoptarget)
3754 PL_formtarget = PL_toptarget;
3756 PL_formtarget = PL_bodytarget;
3758 /* Initialise all per-thread SVs that the template thread used */
3759 svp = AvARRAY(t->threadsv);
3760 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3761 if (*svp && *svp != &PL_sv_undef) {
3762 SV *sv = newSVsv(*svp);
3763 av_store(thr->threadsv, i, sv);
3764 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
3765 DEBUG_S(PerlIO_printf(Perl_debug_log,
3766 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
3770 thr->threadsvp = AvARRAY(thr->threadsv);
3772 MUTEX_LOCK(&PL_threads_mutex);
3774 thr->tid = ++PL_threadnum;
3775 thr->next = t->next;
3778 thr->next->prev = thr;
3779 MUTEX_UNLOCK(&PL_threads_mutex);
3781 /* done copying parent's state */
3782 MUTEX_UNLOCK(&t->mutex);
3784 #ifdef HAVE_THREAD_INTERN
3785 Perl_init_thread_intern(thr);
3786 #endif /* HAVE_THREAD_INTERN */
3789 #endif /* USE_THREADS */
3791 #if defined(HUGE_VAL) || (defined(USE_LONG_DOUBLE) && defined(HUGE_VALL))
3793 * This hack is to force load of "huge" support from libm.a
3794 * So it is in perl for (say) POSIX to use.
3795 * Needed for SunOS with Sun's 'acc' for example.
3800 # if defined(USE_LONG_DOUBLE) && defined(HUGE_VALL)
3807 #ifdef PERL_GLOBAL_STRUCT
3816 Perl_get_op_names(pTHX)
3822 Perl_get_op_descs(pTHX)
3828 Perl_get_no_modify(pTHX)
3830 return (char*)PL_no_modify;
3834 Perl_get_opargs(pTHX)
3840 Perl_get_ppaddr(pTHX)
3842 return (PPADDR_t*)PL_ppaddr;
3845 #ifndef HAS_GETENV_LEN
3847 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3849 char *env_trans = PerlEnv_getenv(env_elem);
3851 *len = strlen(env_trans);
3858 Perl_get_vtbl(pTHX_ int vtbl_id)
3860 MGVTBL* result = Null(MGVTBL*);
3864 result = &PL_vtbl_sv;
3867 result = &PL_vtbl_env;
3869 case want_vtbl_envelem:
3870 result = &PL_vtbl_envelem;
3873 result = &PL_vtbl_sig;
3875 case want_vtbl_sigelem:
3876 result = &PL_vtbl_sigelem;
3878 case want_vtbl_pack:
3879 result = &PL_vtbl_pack;
3881 case want_vtbl_packelem:
3882 result = &PL_vtbl_packelem;
3884 case want_vtbl_dbline:
3885 result = &PL_vtbl_dbline;
3888 result = &PL_vtbl_isa;
3890 case want_vtbl_isaelem:
3891 result = &PL_vtbl_isaelem;
3893 case want_vtbl_arylen:
3894 result = &PL_vtbl_arylen;
3896 case want_vtbl_glob:
3897 result = &PL_vtbl_glob;
3899 case want_vtbl_mglob:
3900 result = &PL_vtbl_mglob;
3902 case want_vtbl_nkeys:
3903 result = &PL_vtbl_nkeys;
3905 case want_vtbl_taint:
3906 result = &PL_vtbl_taint;
3908 case want_vtbl_substr:
3909 result = &PL_vtbl_substr;
3912 result = &PL_vtbl_vec;
3915 result = &PL_vtbl_pos;
3918 result = &PL_vtbl_bm;
3921 result = &PL_vtbl_fm;
3923 case want_vtbl_uvar:
3924 result = &PL_vtbl_uvar;
3927 case want_vtbl_mutex:
3928 result = &PL_vtbl_mutex;
3931 case want_vtbl_defelem:
3932 result = &PL_vtbl_defelem;
3934 case want_vtbl_regexp:
3935 result = &PL_vtbl_regexp;
3937 case want_vtbl_regdata:
3938 result = &PL_vtbl_regdata;
3940 case want_vtbl_regdatum:
3941 result = &PL_vtbl_regdatum;
3943 #ifdef USE_LOCALE_COLLATE
3944 case want_vtbl_collxfrm:
3945 result = &PL_vtbl_collxfrm;
3948 case want_vtbl_amagic:
3949 result = &PL_vtbl_amagic;
3951 case want_vtbl_amagicelem:
3952 result = &PL_vtbl_amagicelem;
3954 case want_vtbl_backref:
3955 result = &PL_vtbl_backref;
3962 Perl_my_fflush_all(pTHX)
3964 #if defined(FFLUSH_NULL)
3965 return PerlIO_flush(NULL);
3967 # if defined(HAS__FWALK)
3968 /* undocumented, unprototyped, but very useful BSDism */
3969 extern void _fwalk(int (*)(FILE *));
3974 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3975 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3976 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3978 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3979 open_max = sysconf(_SC_OPEN_MAX);
3982 open_max = FOPEN_MAX;
3985 open_max = OPEN_MAX;
3996 for (i = 0; i < open_max; i++)
3997 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3998 STDIO_STREAM_ARRAY[i]._file < open_max &&
3999 STDIO_STREAM_ARRAY[i]._flag)
4000 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
4004 SETERRNO(EBADF,RMS$_IFI);
4011 Perl_my_atof(pTHX_ const char* s)
4014 #ifdef USE_LOCALE_NUMERIC
4015 if ((PL_hints & HINT_LOCALE) && PL_numeric_local) {
4019 SET_NUMERIC_STANDARD();
4021 SET_NUMERIC_LOCAL();
4022 if ((y < 0.0 && y < x) || (y > 0.0 && y > x))
4034 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
4039 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
4040 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
4042 char *pars = OP_IS_FILETEST(op) ? "" : "()";
4043 char *type = OP_IS_SOCKET(op) ||
4044 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
4045 "socket" : "filehandle";
4048 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
4050 warn_type = WARN_CLOSED;
4054 warn_type = WARN_UNOPENED;
4057 if (gv && isGV(gv)) {
4058 SV *sv = sv_newmortal();
4059 gv_efullname4(sv, gv, Nullch, FALSE);
4063 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
4065 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for %sput",
4067 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
4069 Perl_warner(aTHX_ WARN_IO, "Filehandle opened only for %sput",
4070 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
4071 } else if (name && *name) {
4072 Perl_warner(aTHX_ warn_type,
4073 "%s%s on %s %s %s", func, pars, vile, type, name);
4074 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
4075 Perl_warner(aTHX_ warn_type,
4076 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
4080 Perl_warner(aTHX_ warn_type,
4081 "%s%s on %s %s", func, pars, vile, type);
4082 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
4083 Perl_warner(aTHX_ warn_type,
4084 "\t(Are you trying to call %s%s on dirhandle?)\n",
4090 /* in ASCII order, not that it matters */
4091 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
4094 Perl_ebcdic_control(pTHX_ int ch)
4102 if ((ctlp = strchr(controllablechars, ch)) == 0) {
4103 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
4106 if (ctlp == controllablechars)
4107 return('\177'); /* DEL */
4109 return((unsigned char)(ctlp - controllablechars - 1));
4110 } else { /* Want uncontrol */
4111 if (ch == '\177' || ch == -1)
4113 else if (ch == '\157')
4115 else if (ch == '\174')
4117 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
4119 else if (ch == '\155')
4121 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
4122 return(controllablechars[ch+1]);
4124 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
4130 # if !defined(WIN32) && !defined(__CYGWIN__)
4131 extern char *tzname[];
4134 #if !defined(WIN32) || (defined(__MINGW32__) && !defined(tzname))
4135 char *tzname[] = { "" , "" };
4139 /* XXX struct tm on some systems (SunOS4/BSD) contains extra (non POSIX)
4140 * fields for which we don't have Configure support yet:
4141 * char *tm_zone; -- abbreviation of timezone name
4142 * long tm_gmtoff; -- offset from GMT in seconds
4143 * To workaround core dumps from the uninitialised tm_zone we get the
4144 * system to give us a reasonable struct to copy. This fix means that
4145 * strftime uses the tm_zone and tm_gmtoff values returned by
4146 * localtime(time()). That should give the desired result most of the
4147 * time. But probably not always!
4149 * This is a temporary workaround to be removed once Configure
4150 * support is added and NETaa14816 is considered in full.
4151 * It does not address tzname aspects of NETaa14816.
4154 # ifndef STRUCT_TM_HASZONE
4155 # define STRUCT_TM_HASZONE
4160 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
4162 #ifdef STRUCT_TM_HASZONE
4165 Copy(localtime(&now), ptm, 1, struct tm);
4170 * mini_mktime - normalise struct tm values without the localtime()
4171 * semantics (and overhead) of mktime().
4174 Perl_mini_mktime(pTHX_ struct tm *ptm)
4178 int month, mday, year, jday;
4179 int odd_cent, odd_year;
4181 #define DAYS_PER_YEAR 365
4182 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
4183 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
4184 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
4185 #define SECS_PER_HOUR (60*60)
4186 #define SECS_PER_DAY (24*SECS_PER_HOUR)
4187 /* parentheses deliberately absent on these two, otherwise they don't work */
4188 #define MONTH_TO_DAYS 153/5
4189 #define DAYS_TO_MONTH 5/153
4190 /* offset to bias by March (month 4) 1st between month/mday & year finding */
4191 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
4192 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
4193 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
4196 * Year/day algorithm notes:
4198 * With a suitable offset for numeric value of the month, one can find
4199 * an offset into the year by considering months to have 30.6 (153/5) days,
4200 * using integer arithmetic (i.e., with truncation). To avoid too much
4201 * messing about with leap days, we consider January and February to be
4202 * the 13th and 14th month of the previous year. After that transformation,
4203 * we need the month index we use to be high by 1 from 'normal human' usage,
4204 * so the month index values we use run from 4 through 15.
4206 * Given that, and the rules for the Gregorian calendar (leap years are those
4207 * divisible by 4 unless also divisible by 100, when they must be divisible
4208 * by 400 instead), we can simply calculate the number of days since some
4209 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
4210 * the days we derive from our month index, and adding in the day of the
4211 * month. The value used here is not adjusted for the actual origin which
4212 * it normally would use (1 January A.D. 1), since we're not exposing it.
4213 * We're only building the value so we can turn around and get the
4214 * normalised values for the year, month, day-of-month, and day-of-year.
4216 * For going backward, we need to bias the value we're using so that we find
4217 * the right year value. (Basically, we don't want the contribution of
4218 * March 1st to the number to apply while deriving the year). Having done
4219 * that, we 'count up' the contribution to the year number by accounting for
4220 * full quadracenturies (400-year periods) with their extra leap days, plus
4221 * the contribution from full centuries (to avoid counting in the lost leap
4222 * days), plus the contribution from full quad-years (to count in the normal
4223 * leap days), plus the leftover contribution from any non-leap years.
4224 * At this point, if we were working with an actual leap day, we'll have 0
4225 * days left over. This is also true for March 1st, however. So, we have
4226 * to special-case that result, and (earlier) keep track of the 'odd'
4227 * century and year contributions. If we got 4 extra centuries in a qcent,
4228 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
4229 * Otherwise, we add back in the earlier bias we removed (the 123 from
4230 * figuring in March 1st), find the month index (integer division by 30.6),
4231 * and the remainder is the day-of-month. We then have to convert back to
4232 * 'real' months (including fixing January and February from being 14/15 in
4233 * the previous year to being in the proper year). After that, to get
4234 * tm_yday, we work with the normalised year and get a new yearday value for
4235 * January 1st, which we subtract from the yearday value we had earlier,
4236 * representing the date we've re-built. This is done from January 1
4237 * because tm_yday is 0-origin.
4239 * Since POSIX time routines are only guaranteed to work for times since the
4240 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
4241 * applies Gregorian calendar rules even to dates before the 16th century
4242 * doesn't bother me. Besides, you'd need cultural context for a given
4243 * date to know whether it was Julian or Gregorian calendar, and that's
4244 * outside the scope for this routine. Since we convert back based on the
4245 * same rules we used to build the yearday, you'll only get strange results
4246 * for input which needed normalising, or for the 'odd' century years which
4247 * were leap years in the Julian calander but not in the Gregorian one.
4248 * I can live with that.
4250 * This algorithm also fails to handle years before A.D. 1 gracefully, but
4251 * that's still outside the scope for POSIX time manipulation, so I don't
4255 year = 1900 + ptm->tm_year;
4256 month = ptm->tm_mon;
4257 mday = ptm->tm_mday;
4258 /* allow given yday with no month & mday to dominate the result */
4259 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
4262 jday = 1 + ptm->tm_yday;
4271 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
4272 yearday += month*MONTH_TO_DAYS + mday + jday;
4274 * Note that we don't know when leap-seconds were or will be,
4275 * so we have to trust the user if we get something which looks
4276 * like a sensible leap-second. Wild values for seconds will
4277 * be rationalised, however.
4279 if ((unsigned) ptm->tm_sec <= 60) {
4286 secs += 60 * ptm->tm_min;
4287 secs += SECS_PER_HOUR * ptm->tm_hour;
4289 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
4290 /* got negative remainder, but need positive time */
4291 /* back off an extra day to compensate */
4292 yearday += (secs/SECS_PER_DAY)-1;
4293 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
4296 yearday += (secs/SECS_PER_DAY);
4297 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
4300 else if (secs >= SECS_PER_DAY) {
4301 yearday += (secs/SECS_PER_DAY);
4302 secs %= SECS_PER_DAY;
4304 ptm->tm_hour = secs/SECS_PER_HOUR;
4305 secs %= SECS_PER_HOUR;
4306 ptm->tm_min = secs/60;
4308 ptm->tm_sec += secs;
4309 /* done with time of day effects */
4311 * The algorithm for yearday has (so far) left it high by 428.
4312 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
4313 * bias it by 123 while trying to figure out what year it
4314 * really represents. Even with this tweak, the reverse
4315 * translation fails for years before A.D. 0001.
4316 * It would still fail for Feb 29, but we catch that one below.
4318 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
4319 yearday -= YEAR_ADJUST;
4320 year = (yearday / DAYS_PER_QCENT) * 400;
4321 yearday %= DAYS_PER_QCENT;
4322 odd_cent = yearday / DAYS_PER_CENT;
4323 year += odd_cent * 100;
4324 yearday %= DAYS_PER_CENT;
4325 year += (yearday / DAYS_PER_QYEAR) * 4;
4326 yearday %= DAYS_PER_QYEAR;
4327 odd_year = yearday / DAYS_PER_YEAR;
4329 yearday %= DAYS_PER_YEAR;
4330 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
4335 yearday += YEAR_ADJUST; /* recover March 1st crock */
4336 month = yearday*DAYS_TO_MONTH;
4337 yearday -= month*MONTH_TO_DAYS;
4338 /* recover other leap-year adjustment */
4347 ptm->tm_year = year - 1900;
4349 ptm->tm_mday = yearday;
4350 ptm->tm_mon = month;
4354 ptm->tm_mon = month - 1;
4356 /* re-build yearday based on Jan 1 to get tm_yday */
4358 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
4359 yearday += 14*MONTH_TO_DAYS + 1;
4360 ptm->tm_yday = jday - yearday;
4361 /* fix tm_wday if not overridden by caller */
4362 if ((unsigned)ptm->tm_wday > 6)
4363 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
4367 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
4375 init_tm(&mytm); /* XXX workaround - see init_tm() above */
4378 mytm.tm_hour = hour;
4379 mytm.tm_mday = mday;
4381 mytm.tm_year = year;
4382 mytm.tm_wday = wday;
4383 mytm.tm_yday = yday;
4384 mytm.tm_isdst = isdst;
4387 New(0, buf, buflen, char);
4388 len = strftime(buf, buflen, fmt, &mytm);
4390 ** The following is needed to handle to the situation where
4391 ** tmpbuf overflows. Basically we want to allocate a buffer
4392 ** and try repeatedly. The reason why it is so complicated
4393 ** is that getting a return value of 0 from strftime can indicate
4394 ** one of the following:
4395 ** 1. buffer overflowed,
4396 ** 2. illegal conversion specifier, or
4397 ** 3. the format string specifies nothing to be returned(not
4398 ** an error). This could be because format is an empty string
4399 ** or it specifies %p that yields an empty string in some locale.
4400 ** If there is a better way to make it portable, go ahead by
4403 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4406 /* Possibly buf overflowed - try again with a bigger buf */
4407 int fmtlen = strlen(fmt);
4408 int bufsize = fmtlen + buflen;
4410 New(0, buf, bufsize, char);
4412 buflen = strftime(buf, bufsize, fmt, &mytm);
4413 if (buflen > 0 && buflen < bufsize)
4415 /* heuristic to prevent out-of-memory errors */
4416 if (bufsize > 100*fmtlen) {
4422 Renew(buf, bufsize, char);
4427 Perl_croak(aTHX_ "panic: no strftime");