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>
48 long xcount[MAXXCOUNT];
49 long lastxcount[MAXXCOUNT];
50 long xycount[MAXXCOUNT][MAXYCOUNT];
51 long lastxycount[MAXXCOUNT][MAXYCOUNT];
55 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
56 # define FD_CLOEXEC 1 /* NeXT needs this */
59 /* NOTE: Do not call the next three routines directly. Use the macros
60 * in handy.h, so that we can easily redefine everything to do tracking of
61 * allocated hunks back to the original New to track down any memory leaks.
62 * XXX This advice seems to be widely ignored :-( --AD August 1996.
65 /* paranoid version of system's malloc() */
68 Perl_safesysmalloc(MEM_SIZE size)
74 PerlIO_printf(Perl_error_log,
75 "Allocation too large: %lx\n", size) FLUSH;
78 #endif /* HAS_64K_LIMIT */
81 Perl_croak_nocontext("panic: malloc");
83 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
84 PERL_ALLOC_CHECK(ptr);
85 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
91 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
98 /* paranoid version of system's realloc() */
101 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
105 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
106 Malloc_t PerlMem_realloc();
107 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
111 PerlIO_printf(Perl_error_log,
112 "Reallocation too large: %lx\n", size) FLUSH;
115 #endif /* HAS_64K_LIMIT */
122 return safesysmalloc(size);
125 Perl_croak_nocontext("panic: realloc");
127 ptr = (Malloc_t)PerlMem_realloc(where,size);
128 PERL_ALLOC_CHECK(ptr);
130 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
131 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
138 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
145 /* safe version of system's free() */
148 Perl_safesysfree(Malloc_t where)
150 #ifdef PERL_IMPLICIT_SYS
153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
160 /* safe version of system's calloc() */
163 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
169 if (size * count > 0xffff) {
170 PerlIO_printf(Perl_error_log,
171 "Allocation too large: %lx\n", size * count) FLUSH;
174 #endif /* HAS_64K_LIMIT */
176 if ((long)size < 0 || (long)count < 0)
177 Perl_croak_nocontext("panic: calloc");
180 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
181 PERL_ALLOC_CHECK(ptr);
182 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));
184 memset((void*)ptr, 0, size);
190 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
199 struct mem_test_strut {
207 # define ALIGN sizeof(struct mem_test_strut)
209 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
210 # define typeof_chunk(ch) \
211 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
212 # define set_typeof_chunk(ch,t) \
213 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
214 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
217 ? ((size) - 1)/8 + 5 \
221 Perl_safexmalloc(I32 x, MEM_SIZE size)
223 register char* where = (char*)safemalloc(size + ALIGN);
226 xycount[x][SIZE_TO_Y(size)]++;
227 set_typeof_chunk(where, x);
228 sizeof_chunk(where) = size;
229 return (Malloc_t)(where + ALIGN);
233 Perl_safexrealloc(Malloc_t wh, MEM_SIZE size)
235 char *where = (char*)wh;
238 return safexmalloc(0,size);
241 MEM_SIZE old = sizeof_chunk(where - ALIGN);
242 int t = typeof_chunk(where - ALIGN);
243 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
245 xycount[t][SIZE_TO_Y(old)]--;
246 xycount[t][SIZE_TO_Y(size)]++;
247 xcount[t] += size - old;
248 sizeof_chunk(new) = size;
249 return (Malloc_t)(new + ALIGN);
254 Perl_safexfree(Malloc_t wh)
257 char *where = (char*)wh;
263 size = sizeof_chunk(where);
264 x = where[0] + 100 * where[1];
266 xycount[x][SIZE_TO_Y(size)]--;
271 Perl_safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
273 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
275 xycount[x][SIZE_TO_Y(size)]++;
276 memset((void*)(where + ALIGN), 0, size * count);
277 set_typeof_chunk(where, x);
278 sizeof_chunk(where) = size;
279 return (Malloc_t)(where + ALIGN);
283 S_xstat(pTHX_ int flag)
285 register I32 i, j, total = 0;
286 I32 subtot[MAXYCOUNT];
288 for (j = 0; j < MAXYCOUNT; j++) {
292 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);
293 for (i = 0; i < MAXXCOUNT; i++) {
295 for (j = 0; j < MAXYCOUNT; j++) {
296 subtot[j] += xycount[i][j];
299 ? xcount[i] /* Have something */
301 ? xcount[i] != lastxcount[i] /* Changed */
302 : xcount[i] > lastxcount[i])) { /* Growed */
303 PerlIO_printf(Perl_debug_log,"%2d %02d %7ld ", i / 100, i % 100,
304 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
305 lastxcount[i] = xcount[i];
306 for (j = 0; j < MAXYCOUNT; j++) {
308 ? xycount[i][j] /* Have something */
310 ? xycount[i][j] != lastxycount[i][j] /* Changed */
311 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
312 PerlIO_printf(Perl_debug_log,"%3ld ",
314 ? xycount[i][j] - lastxycount[i][j]
316 lastxycount[i][j] = xycount[i][j];
318 PerlIO_printf(Perl_debug_log, " . ", xycount[i][j]);
321 PerlIO_printf(Perl_debug_log, "\n");
325 PerlIO_printf(Perl_debug_log, "Total %7ld ", total);
326 for (j = 0; j < MAXYCOUNT; j++) {
328 PerlIO_printf(Perl_debug_log, "%3ld ", subtot[j]);
330 PerlIO_printf(Perl_debug_log, " . ");
333 PerlIO_printf(Perl_debug_log, "\n");
337 #endif /* LEAKTEST */
339 /* copy a string up to some (non-backslashed) delimiter, if any */
342 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
345 for (tolen = 0; from < fromend; from++, tolen++) {
347 if (from[1] == delim)
356 else if (*from == delim)
367 /* return ptr to little string in big string, NULL if not found */
368 /* This routine was donated by Corey Satten. */
371 Perl_instr(pTHX_ register const char *big, register const char *little)
373 register const char *s, *x;
384 for (x=big,s=little; *s; /**/ ) {
393 return (char*)(big-1);
398 /* same as instr but allow embedded nulls */
401 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
403 register const char *s, *x;
404 register I32 first = *little;
405 register const char *littleend = lend;
407 if (!first && little >= littleend)
409 if (bigend - big < littleend - little)
411 bigend -= littleend - little++;
412 while (big <= bigend) {
415 for (x=big,s=little; s < littleend; /**/ ) {
422 return (char*)(big-1);
427 /* reverse of the above--find last substring */
430 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
432 register const char *bigbeg;
433 register const char *s, *x;
434 register I32 first = *little;
435 register const char *littleend = lend;
437 if (!first && little >= littleend)
438 return (char*)bigend;
440 big = bigend - (littleend - little++);
441 while (big >= bigbeg) {
444 for (x=big+2,s=little; s < littleend; /**/ ) {
451 return (char*)(big+1);
456 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
458 /* As a space optimization, we do not compile tables for strings of length
459 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
460 special-cased in fbm_instr().
462 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
465 =for apidoc fbm_compile
467 Analyses the string in order to make fast searches on it using fbm_instr()
468 -- the Boyer-Moore algorithm.
474 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
483 if (flags & FBMcf_TAIL)
484 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
485 s = (U8*)SvPV_force(sv, len);
486 (void)SvUPGRADE(sv, SVt_PVBM);
487 if (len == 0) /* TAIL might be on on a zero-length string. */
497 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
498 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
499 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
500 memset((void*)table, mlen, 256);
501 table[-1] = (U8)flags;
503 sb = s - mlen + 1; /* first char (maybe) */
505 if (table[*s] == mlen)
510 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
513 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
514 for (i = 0; i < len; i++) {
515 if (PL_freq[s[i]] < frequency) {
517 frequency = PL_freq[s[i]];
520 BmRARE(sv) = s[rarest];
521 BmPREVIOUS(sv) = rarest;
522 BmUSEFUL(sv) = 100; /* Initial value */
523 if (flags & FBMcf_TAIL)
525 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
526 BmRARE(sv),BmPREVIOUS(sv)));
529 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
530 /* If SvTAIL is actually due to \Z or \z, this gives false positives
534 =for apidoc fbm_instr
536 Returns the location of the SV in the string delimited by C<str> and
537 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
538 does not have to be fbm_compiled, but the search will not be as fast
545 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
547 register unsigned char *s;
549 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
550 register STRLEN littlelen = l;
551 register I32 multiline = flags & FBMrf_MULTILINE;
553 if (bigend - big < littlelen) {
554 if ( SvTAIL(littlestr)
555 && (bigend - big == littlelen - 1)
557 || (*big == *little &&
558 memEQ((char *)big, (char *)little, littlelen - 1))))
563 if (littlelen <= 2) { /* Special-cased */
565 if (littlelen == 1) {
566 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
567 /* Know that bigend != big. */
568 if (bigend[-1] == '\n')
569 return (char *)(bigend - 1);
570 return (char *) bigend;
578 if (SvTAIL(littlestr))
579 return (char *) bigend;
583 return (char*)big; /* Cannot be SvTAIL! */
586 if (SvTAIL(littlestr) && !multiline) {
587 if (bigend[-1] == '\n' && bigend[-2] == *little)
588 return (char*)bigend - 2;
589 if (bigend[-1] == *little)
590 return (char*)bigend - 1;
594 /* This should be better than FBM if c1 == c2, and almost
595 as good otherwise: maybe better since we do less indirection.
596 And we save a lot of memory by caching no table. */
597 register unsigned char c1 = little[0];
598 register unsigned char c2 = little[1];
603 while (s <= bigend) {
613 goto check_1char_anchor;
624 goto check_1char_anchor;
627 while (s <= bigend) {
632 goto check_1char_anchor;
641 check_1char_anchor: /* One char and anchor! */
642 if (SvTAIL(littlestr) && (*bigend == *little))
643 return (char *)bigend; /* bigend is already decremented. */
646 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
647 s = bigend - littlelen;
648 if (s >= big && bigend[-1] == '\n' && *s == *little
649 /* Automatically of length > 2 */
650 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
652 return (char*)s; /* how sweet it is */
655 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
657 return (char*)s + 1; /* how sweet it is */
661 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
662 char *b = ninstr((char*)big,(char*)bigend,
663 (char*)little, (char*)little + littlelen);
665 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
666 /* Chop \n from littlestr: */
667 s = bigend - littlelen + 1;
669 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
678 { /* Do actual FBM. */
679 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
680 register unsigned char *oldlittle;
682 if (littlelen > bigend - big)
684 --littlelen; /* Last char found by table lookup */
687 little += littlelen; /* last char */
694 if ((tmp = table[*s])) {
696 if (bigend - s > tmp) {
702 if ((s += tmp) < bigend)
707 else { /* less expensive than calling strncmp() */
708 register unsigned char *olds = s;
713 if (*--s == *--little)
715 s = olds + 1; /* here we pay the price for failure */
717 if (s < bigend) /* fake up continue to outer loop */
725 if ( s == bigend && (table[-1] & FBMcf_TAIL)
726 && memEQ((char *)(bigend - littlelen),
727 (char *)(oldlittle - littlelen), littlelen) )
728 return (char*)bigend - littlelen;
733 /* start_shift, end_shift are positive quantities which give offsets
734 of ends of some substring of bigstr.
735 If `last' we want the last occurence.
736 old_posp is the way of communication between consequent calls if
737 the next call needs to find the .
738 The initial *old_posp should be -1.
740 Note that we take into account SvTAIL, so one can get extra
741 optimizations if _ALL flag is set.
744 /* If SvTAIL is actually due to \Z or \z, this gives false positives
745 if PL_multiline. In fact if !PL_multiline the authoritative answer
746 is not supported yet. */
749 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
751 register unsigned char *s, *x;
752 register unsigned char *big;
754 register I32 previous;
756 register unsigned char *little;
757 register I32 stop_pos;
758 register unsigned char *littleend;
762 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
763 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
765 if ( BmRARE(littlestr) == '\n'
766 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
767 little = (unsigned char *)(SvPVX(littlestr));
768 littleend = little + SvCUR(littlestr);
775 little = (unsigned char *)(SvPVX(littlestr));
776 littleend = little + SvCUR(littlestr);
778 /* The value of pos we can start at: */
779 previous = BmPREVIOUS(littlestr);
780 big = (unsigned char *)(SvPVX(bigstr));
781 /* The value of pos we can stop at: */
782 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
783 if (previous + start_shift > stop_pos) {
785 stop_pos does not include SvTAIL in the count, so this check is incorrect
786 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
789 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
794 while (pos < previous + start_shift) {
795 if (!(pos += PL_screamnext[pos]))
800 if (pos >= stop_pos) break;
801 if (big[pos-previous] != first)
803 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
809 if (s == littleend) {
811 if (!last) return (char *)(big+pos-previous);
814 } while ( pos += PL_screamnext[pos] );
815 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
816 #else /* !POINTERRIGOR */
819 if (pos >= stop_pos) break;
820 if (big[pos] != first)
822 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
828 if (s == littleend) {
830 if (!last) return (char *)(big+pos);
833 } while ( pos += PL_screamnext[pos] );
835 return (char *)(big+(*old_posp));
836 #endif /* POINTERRIGOR */
838 if (!SvTAIL(littlestr) || (end_shift > 0))
840 /* Ignore the trailing "\n". This code is not microoptimized */
841 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
842 stop_pos = littleend - little; /* Actual littlestr len */
847 && ((stop_pos == 1) ||
848 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
854 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
856 register U8 *a = (U8 *)s1;
857 register U8 *b = (U8 *)s2;
859 if (*a != *b && *a != PL_fold[*b])
867 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
869 register U8 *a = (U8 *)s1;
870 register U8 *b = (U8 *)s2;
872 if (*a != *b && *a != PL_fold_locale[*b])
879 /* copy a string to a safe spot */
884 Copy a string to a safe spot. This does not use an SV.
890 Perl_savepv(pTHX_ const char *sv)
892 register char *newaddr;
894 New(902,newaddr,strlen(sv)+1,char);
895 (void)strcpy(newaddr,sv);
899 /* same thing but with a known length */
904 Copy a string to a safe spot. The C<len> indicates number of bytes to
905 copy. This does not use an SV.
911 Perl_savepvn(pTHX_ const char *sv, register I32 len)
913 register char *newaddr;
915 New(903,newaddr,len+1,char);
916 Copy(sv,newaddr,len,char); /* might not be null terminated */
917 newaddr[len] = '\0'; /* is now */
921 /* the SV for Perl_form() and mess() is not kept in an arena */
930 return sv_2mortal(newSVpvn("",0));
935 /* Create as PVMG now, to avoid any upgrading later */
937 Newz(905, any, 1, XPVMG);
938 SvFLAGS(sv) = SVt_PVMG;
939 SvANY(sv) = (void*)any;
940 SvREFCNT(sv) = 1 << 30; /* practically infinite */
945 #if defined(PERL_IMPLICIT_CONTEXT)
947 Perl_form_nocontext(const char* pat, ...)
953 retval = vform(pat, &args);
957 #endif /* PERL_IMPLICIT_CONTEXT */
960 Perl_form(pTHX_ const char* pat, ...)
965 retval = vform(pat, &args);
971 Perl_vform(pTHX_ const char *pat, va_list *args)
973 SV *sv = mess_alloc();
974 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
978 #if defined(PERL_IMPLICIT_CONTEXT)
980 Perl_mess_nocontext(const char *pat, ...)
986 retval = vmess(pat, &args);
990 #endif /* PERL_IMPLICIT_CONTEXT */
993 Perl_mess(pTHX_ const char *pat, ...)
998 retval = vmess(pat, &args);
1004 Perl_vmess(pTHX_ const char *pat, va_list *args)
1006 SV *sv = mess_alloc();
1007 static char dgd[] = " during global destruction.\n";
1009 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1010 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1011 if (CopLINE(PL_curcop))
1012 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1013 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
1014 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1015 bool line_mode = (RsSIMPLE(PL_rs) &&
1016 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1017 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1018 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1019 line_mode ? "line" : "chunk",
1020 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1024 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1026 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1032 Perl_vdie(pTHX_ const char* pat, va_list *args)
1035 int was_in_eval = PL_in_eval;
1042 DEBUG_S(PerlIO_printf(Perl_debug_log,
1043 "%p: die: curstack = %p, mainstack = %p\n",
1044 thr, PL_curstack, PL_mainstack));
1047 msv = vmess(pat, args);
1048 if (PL_errors && SvCUR(PL_errors)) {
1049 sv_catsv(PL_errors, msv);
1050 message = SvPV(PL_errors, msglen);
1051 SvCUR_set(PL_errors, 0);
1054 message = SvPV(msv,msglen);
1061 DEBUG_S(PerlIO_printf(Perl_debug_log,
1062 "%p: die: message = %s\ndiehook = %p\n",
1063 thr, message, PL_diehook));
1065 /* sv_2cv might call Perl_croak() */
1066 SV *olddiehook = PL_diehook;
1068 SAVESPTR(PL_diehook);
1069 PL_diehook = Nullsv;
1070 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1072 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1079 msg = newSVpvn(message, msglen);
1087 PUSHSTACKi(PERLSI_DIEHOOK);
1091 call_sv((SV*)cv, G_DISCARD);
1097 PL_restartop = die_where(message, msglen);
1098 DEBUG_S(PerlIO_printf(Perl_debug_log,
1099 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1100 thr, PL_restartop, was_in_eval, PL_top_env));
1101 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1103 return PL_restartop;
1106 #if defined(PERL_IMPLICIT_CONTEXT)
1108 Perl_die_nocontext(const char* pat, ...)
1113 va_start(args, pat);
1114 o = vdie(pat, &args);
1118 #endif /* PERL_IMPLICIT_CONTEXT */
1121 Perl_die(pTHX_ const char* pat, ...)
1125 va_start(args, pat);
1126 o = vdie(pat, &args);
1132 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1142 msv = vmess(pat, args);
1143 if (PL_errors && SvCUR(PL_errors)) {
1144 sv_catsv(PL_errors, msv);
1145 message = SvPV(PL_errors, msglen);
1146 SvCUR_set(PL_errors, 0);
1149 message = SvPV(msv,msglen);
1156 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1157 PTR2UV(thr), message));
1160 /* sv_2cv might call Perl_croak() */
1161 SV *olddiehook = PL_diehook;
1163 SAVESPTR(PL_diehook);
1164 PL_diehook = Nullsv;
1165 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1167 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1174 msg = newSVpvn(message, msglen);
1182 PUSHSTACKi(PERLSI_DIEHOOK);
1186 call_sv((SV*)cv, G_DISCARD);
1192 PL_restartop = die_where(message, msglen);
1197 /* SFIO can really mess with your errno */
1200 PerlIO *serr = Perl_error_log;
1202 PerlIO_write(serr, message, msglen);
1203 (void)PerlIO_flush(serr);
1211 #if defined(PERL_IMPLICIT_CONTEXT)
1213 Perl_croak_nocontext(const char *pat, ...)
1217 va_start(args, pat);
1222 #endif /* PERL_IMPLICIT_CONTEXT */
1227 This is the XSUB-writer's interface to Perl's C<die> function.
1228 Normally use this function the same way you use the C C<printf>
1229 function. See C<warn>.
1231 If you want to throw an exception object, assign the object to
1232 C<$@> and then pass C<Nullch> to croak():
1234 errsv = get_sv("@", TRUE);
1235 sv_setsv(errsv, exception_object);
1242 Perl_croak(pTHX_ const char *pat, ...)
1245 va_start(args, pat);
1252 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1261 msv = vmess(pat, args);
1262 message = SvPV(msv, msglen);
1265 /* sv_2cv might call Perl_warn() */
1266 SV *oldwarnhook = PL_warnhook;
1268 SAVESPTR(PL_warnhook);
1269 PL_warnhook = Nullsv;
1270 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1272 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1278 msg = newSVpvn(message, msglen);
1282 PUSHSTACKi(PERLSI_WARNHOOK);
1286 call_sv((SV*)cv, G_DISCARD);
1293 PerlIO *serr = Perl_error_log;
1295 PerlIO_write(serr, message, msglen);
1297 DEBUG_L(*message == '!'
1298 ? (xstat(message[1]=='!'
1299 ? (message[2]=='!' ? 2 : 1)
1304 (void)PerlIO_flush(serr);
1308 #if defined(PERL_IMPLICIT_CONTEXT)
1310 Perl_warn_nocontext(const char *pat, ...)
1314 va_start(args, pat);
1318 #endif /* PERL_IMPLICIT_CONTEXT */
1323 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
1324 function the same way you use the C C<printf> function. See
1331 Perl_warn(pTHX_ const char *pat, ...)
1334 va_start(args, pat);
1339 #if defined(PERL_IMPLICIT_CONTEXT)
1341 Perl_warner_nocontext(U32 err, const char *pat, ...)
1345 va_start(args, pat);
1346 vwarner(err, pat, &args);
1349 #endif /* PERL_IMPLICIT_CONTEXT */
1352 Perl_warner(pTHX_ U32 err, const char* pat,...)
1355 va_start(args, pat);
1356 vwarner(err, pat, &args);
1361 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1370 msv = vmess(pat, args);
1371 message = SvPV(msv, msglen);
1375 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s", PTR2UV(thr), message));
1376 #endif /* USE_THREADS */
1378 /* sv_2cv might call Perl_croak() */
1379 SV *olddiehook = PL_diehook;
1381 SAVESPTR(PL_diehook);
1382 PL_diehook = Nullsv;
1383 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1385 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1391 msg = newSVpvn(message, msglen);
1395 PUSHSTACKi(PERLSI_DIEHOOK);
1399 call_sv((SV*)cv, G_DISCARD);
1405 PL_restartop = die_where(message, msglen);
1409 PerlIO *serr = Perl_error_log;
1410 PerlIO_write(serr, message, msglen);
1411 (void)PerlIO_flush(serr);
1418 /* sv_2cv might call Perl_warn() */
1419 SV *oldwarnhook = PL_warnhook;
1421 SAVESPTR(PL_warnhook);
1422 PL_warnhook = Nullsv;
1423 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1425 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1431 msg = newSVpvn(message, msglen);
1435 PUSHSTACKi(PERLSI_WARNHOOK);
1439 call_sv((SV*)cv, G_DISCARD);
1446 PerlIO *serr = Perl_error_log;
1447 PerlIO_write(serr, message, msglen);
1449 DEBUG_L(*message == '!'
1450 ? (xstat(message[1]=='!'
1451 ? (message[2]=='!' ? 2 : 1)
1456 (void)PerlIO_flush(serr);
1461 #ifdef USE_ENVIRON_ARRAY
1462 /* VMS' and EPOC's my_setenv() is in vms.c and epoc.c */
1463 #if !defined(WIN32) && !defined(NETWARE)
1465 Perl_my_setenv(pTHX_ char *nam, char *val)
1467 #ifndef PERL_USE_SAFE_PUTENV
1468 /* most putenv()s leak, so we manipulate environ directly */
1469 register I32 i=setenv_getix(nam); /* where does it go? */
1471 if (environ == PL_origenviron) { /* need we copy environment? */
1477 for (max = i; environ[max]; max++) ;
1478 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1479 for (j=0; j<max; j++) { /* copy environment */
1480 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1481 strcpy(tmpenv[j], environ[j]);
1483 tmpenv[max] = Nullch;
1484 environ = tmpenv; /* tell exec where it is now */
1487 safesysfree(environ[i]);
1488 while (environ[i]) {
1489 environ[i] = environ[i+1];
1494 if (!environ[i]) { /* does not exist yet */
1495 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1496 environ[i+1] = Nullch; /* make sure it's null terminated */
1499 safesysfree(environ[i]);
1500 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1502 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1504 #else /* PERL_USE_SAFE_PUTENV */
1505 # if defined(__CYGWIN__)
1506 setenv(nam, val, 1);
1510 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1511 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1512 (void)putenv(new_env);
1513 # endif /* __CYGWIN__ */
1514 #endif /* PERL_USE_SAFE_PUTENV */
1517 #else /* WIN32 || NETWARE */
1520 Perl_my_setenv(pTHX_ char *nam,char *val)
1522 register char *envstr;
1523 STRLEN len = strlen(nam) + 3;
1528 New(904, envstr, len, char);
1529 (void)sprintf(envstr,"%s=%s",nam,val);
1530 (void)PerlEnv_putenv(envstr);
1534 #endif /* WIN32 || NETWARE */
1537 Perl_setenv_getix(pTHX_ char *nam)
1539 register I32 i, len = strlen(nam);
1541 for (i = 0; environ[i]; i++) {
1544 strnicmp(environ[i],nam,len) == 0
1546 strnEQ(environ[i],nam,len)
1548 && environ[i][len] == '=')
1549 break; /* strnEQ must come first to avoid */
1550 } /* potential SEGV's */
1554 #endif /* !VMS && !EPOC*/
1556 #ifdef UNLINK_ALL_VERSIONS
1558 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1562 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1567 /* this is a drop-in replacement for bcopy() */
1568 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1570 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1574 if (from - to >= 0) {
1582 *(--to) = *(--from);
1588 /* this is a drop-in replacement for memset() */
1591 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1601 /* this is a drop-in replacement for bzero() */
1602 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1604 Perl_my_bzero(register char *loc, register I32 len)
1614 /* this is a drop-in replacement for memcmp() */
1615 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1617 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1619 register U8 *a = (U8 *)s1;
1620 register U8 *b = (U8 *)s2;
1624 if (tmp = *a++ - *b++)
1629 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1633 #ifdef USE_CHAR_VSPRINTF
1638 vsprintf(char *dest, const char *pat, char *args)
1642 fakebuf._ptr = dest;
1643 fakebuf._cnt = 32767;
1647 fakebuf._flag = _IOWRT|_IOSTRG;
1648 _doprnt(pat, args, &fakebuf); /* what a kludge */
1649 (void)putc('\0', &fakebuf);
1650 #ifdef USE_CHAR_VSPRINTF
1653 return 0; /* perl doesn't use return value */
1657 #endif /* HAS_VPRINTF */
1660 #if BYTEORDER != 0x4321
1662 Perl_my_swap(pTHX_ short s)
1664 #if (BYTEORDER & 1) == 0
1667 result = ((s & 255) << 8) + ((s >> 8) & 255);
1675 Perl_my_htonl(pTHX_ long l)
1679 char c[sizeof(long)];
1682 #if BYTEORDER == 0x1234
1683 u.c[0] = (l >> 24) & 255;
1684 u.c[1] = (l >> 16) & 255;
1685 u.c[2] = (l >> 8) & 255;
1689 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1690 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1695 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1696 u.c[o & 0xf] = (l >> s) & 255;
1704 Perl_my_ntohl(pTHX_ long l)
1708 char c[sizeof(long)];
1711 #if BYTEORDER == 0x1234
1712 u.c[0] = (l >> 24) & 255;
1713 u.c[1] = (l >> 16) & 255;
1714 u.c[2] = (l >> 8) & 255;
1718 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1719 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1726 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1727 l |= (u.c[o & 0xf] & 255) << s;
1734 #endif /* BYTEORDER != 0x4321 */
1738 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1739 * If these functions are defined,
1740 * the BYTEORDER is neither 0x1234 nor 0x4321.
1741 * However, this is not assumed.
1745 #define HTOV(name,type) \
1747 name (register type n) \
1751 char c[sizeof(type)]; \
1755 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1756 u.c[i] = (n >> s) & 0xFF; \
1761 #define VTOH(name,type) \
1763 name (register type n) \
1767 char c[sizeof(type)]; \
1773 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1774 n += (u.c[i] & 0xFF) << s; \
1779 #if defined(HAS_HTOVS) && !defined(htovs)
1782 #if defined(HAS_HTOVL) && !defined(htovl)
1785 #if defined(HAS_VTOHS) && !defined(vtohs)
1788 #if defined(HAS_VTOHL) && !defined(vtohl)
1793 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1795 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1797 register I32 This, that;
1803 PERL_FLUSHALL_FOR_CHILD;
1804 This = (*mode == 'w');
1808 taint_proper("Insecure %s%s", "EXEC");
1810 if (PerlProc_pipe(p) < 0)
1812 /* Try for another pipe pair for error return */
1813 if (PerlProc_pipe(pp) >= 0)
1815 while ((pid = vfork()) < 0) {
1816 if (errno != EAGAIN) {
1817 PerlLIO_close(p[This]);
1819 PerlLIO_close(pp[0]);
1820 PerlLIO_close(pp[1]);
1832 /* Close parent's end of _the_ pipe */
1833 PerlLIO_close(p[THAT]);
1834 /* Close parent's end of error status pipe (if any) */
1836 PerlLIO_close(pp[0]);
1837 #if defined(HAS_FCNTL) && defined(F_SETFD)
1838 /* Close error pipe automatically if exec works */
1839 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1842 /* Now dup our end of _the_ pipe to right position */
1843 if (p[THIS] != (*mode == 'r')) {
1844 PerlLIO_dup2(p[THIS], *mode == 'r');
1845 PerlLIO_close(p[THIS]);
1847 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1848 /* No automatic close - do it by hand */
1855 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1861 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1867 do_execfree(); /* free any memory malloced by child on vfork */
1868 /* Close child's end of pipe */
1869 PerlLIO_close(p[that]);
1871 PerlLIO_close(pp[1]);
1872 /* Keep the lower of the two fd numbers */
1873 if (p[that] < p[This]) {
1874 PerlLIO_dup2(p[This], p[that]);
1875 PerlLIO_close(p[This]);
1879 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1881 (void)SvUPGRADE(sv,SVt_IV);
1883 PL_forkprocess = pid;
1884 /* If we managed to get status pipe check for exec fail */
1885 if (did_pipes && pid > 0) {
1889 while (n < sizeof(int)) {
1890 n1 = PerlLIO_read(pp[0],
1891 (void*)(((char*)&errkid)+n),
1897 PerlLIO_close(pp[0]);
1899 if (n) { /* Error */
1901 if (n != sizeof(int))
1902 Perl_croak(aTHX_ "panic: kid popen errno read");
1904 pid2 = wait4pid(pid, &status, 0);
1905 } while (pid2 == -1 && errno == EINTR);
1906 errno = errkid; /* Propagate errno from kid */
1911 PerlLIO_close(pp[0]);
1912 return PerlIO_fdopen(p[This], mode);
1914 Perl_croak(aTHX_ "List form of piped open not implemented");
1915 return (PerlIO *) NULL;
1919 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1920 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
1922 Perl_my_popen(pTHX_ char *cmd, char *mode)
1925 register I32 This, that;
1928 I32 doexec = strNE(cmd,"-");
1932 PERL_FLUSHALL_FOR_CHILD;
1935 return my_syspopen(aTHX_ cmd,mode);
1938 This = (*mode == 'w');
1940 if (doexec && PL_tainting) {
1942 taint_proper("Insecure %s%s", "EXEC");
1944 if (PerlProc_pipe(p) < 0)
1946 if (doexec && PerlProc_pipe(pp) >= 0)
1948 while ((pid = (doexec?vfork():fork())) < 0) {
1949 if (errno != EAGAIN) {
1950 PerlLIO_close(p[This]);
1952 PerlLIO_close(pp[0]);
1953 PerlLIO_close(pp[1]);
1956 Perl_croak(aTHX_ "Can't fork");
1968 PerlLIO_close(p[THAT]);
1970 PerlLIO_close(pp[0]);
1971 #if defined(HAS_FCNTL) && defined(F_SETFD)
1972 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1975 if (p[THIS] != (*mode == 'r')) {
1976 PerlLIO_dup2(p[THIS], *mode == 'r');
1977 PerlLIO_close(p[THIS]);
1981 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1990 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
1995 /* may or may not use the shell */
1996 do_exec3(cmd, pp[1], did_pipes);
1999 #endif /* defined OS2 */
2001 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV)))
2002 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2004 hv_clear(PL_pidstatus); /* we have no children */
2009 do_execfree(); /* free any memory malloced by child on vfork */
2010 PerlLIO_close(p[that]);
2012 PerlLIO_close(pp[1]);
2013 if (p[that] < p[This]) {
2014 PerlLIO_dup2(p[This], p[that]);
2015 PerlLIO_close(p[This]);
2019 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2021 (void)SvUPGRADE(sv,SVt_IV);
2023 PL_forkprocess = pid;
2024 if (did_pipes && pid > 0) {
2028 while (n < sizeof(int)) {
2029 n1 = PerlLIO_read(pp[0],
2030 (void*)(((char*)&errkid)+n),
2036 PerlLIO_close(pp[0]);
2038 if (n) { /* Error */
2040 if (n != sizeof(int))
2041 Perl_croak(aTHX_ "panic: kid popen errno read");
2043 pid2 = wait4pid(pid, &status, 0);
2044 } while (pid2 == -1 && errno == EINTR);
2045 errno = errkid; /* Propagate errno from kid */
2050 PerlLIO_close(pp[0]);
2051 return PerlIO_fdopen(p[This], mode);
2054 #if defined(atarist) || defined(DJGPP)
2057 Perl_my_popen(pTHX_ char *cmd, char *mode)
2059 PERL_FLUSHALL_FOR_CHILD;
2060 /* Call system's popen() to get a FILE *, then import it.
2061 used 0 for 2nd parameter to PerlIO_importFILE;
2064 return PerlIO_importFILE(popen(cmd, mode), 0);
2068 #endif /* !DOSISH */
2072 Perl_dump_fds(pTHX_ char *s)
2075 struct stat tmpstatbuf;
2077 PerlIO_printf(Perl_debug_log,"%s", s);
2078 for (fd = 0; fd < 32; fd++) {
2079 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2080 PerlIO_printf(Perl_debug_log," %d",fd);
2082 PerlIO_printf(Perl_debug_log,"\n");
2084 #endif /* DUMP_FDS */
2088 dup2(int oldfd, int newfd)
2090 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2093 PerlLIO_close(newfd);
2094 return fcntl(oldfd, F_DUPFD, newfd);
2096 #define DUP2_MAX_FDS 256
2097 int fdtmp[DUP2_MAX_FDS];
2103 PerlLIO_close(newfd);
2104 /* good enough for low fd's... */
2105 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2106 if (fdx >= DUP2_MAX_FDS) {
2114 PerlLIO_close(fdtmp[--fdx]);
2121 #ifdef HAS_SIGACTION
2124 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2126 struct sigaction act, oact;
2128 act.sa_handler = handler;
2129 sigemptyset(&act.sa_mask);
2132 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2133 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2137 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2138 act.sa_flags |= SA_NOCLDWAIT;
2140 if (sigaction(signo, &act, &oact) == -1)
2143 return oact.sa_handler;
2147 Perl_rsignal_state(pTHX_ int signo)
2149 struct sigaction oact;
2151 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2154 return oact.sa_handler;
2158 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2160 struct sigaction act;
2162 act.sa_handler = handler;
2163 sigemptyset(&act.sa_mask);
2166 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2167 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2171 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2172 act.sa_flags |= SA_NOCLDWAIT;
2174 return sigaction(signo, &act, save);
2178 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2180 return sigaction(signo, save, (struct sigaction *)NULL);
2183 #else /* !HAS_SIGACTION */
2186 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2188 return PerlProc_signal(signo, handler);
2191 static int sig_trapped;
2201 Perl_rsignal_state(pTHX_ int signo)
2203 Sighandler_t oldsig;
2206 oldsig = PerlProc_signal(signo, sig_trap);
2207 PerlProc_signal(signo, oldsig);
2209 PerlProc_kill(PerlProc_getpid(), signo);
2214 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2216 *save = PerlProc_signal(signo, handler);
2217 return (*save == SIG_ERR) ? -1 : 0;
2221 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2223 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2226 #endif /* !HAS_SIGACTION */
2227 #endif /* !PERL_MICRO */
2229 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2230 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2232 Perl_my_pclose(pTHX_ PerlIO *ptr)
2234 Sigsave_t hstat, istat, qstat;
2240 int saved_errno = 0;
2242 int saved_vaxc_errno;
2245 int saved_win32_errno;
2249 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2251 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2253 *svp = &PL_sv_undef;
2255 if (pid == -1) { /* Opened by popen. */
2256 return my_syspclose(ptr);
2259 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2260 saved_errno = errno;
2262 saved_vaxc_errno = vaxc$errno;
2265 saved_win32_errno = GetLastError();
2269 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2272 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2273 rsignal_save(SIGINT, SIG_IGN, &istat);
2274 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2277 pid2 = wait4pid(pid, &status, 0);
2278 } while (pid2 == -1 && errno == EINTR);
2280 rsignal_restore(SIGHUP, &hstat);
2281 rsignal_restore(SIGINT, &istat);
2282 rsignal_restore(SIGQUIT, &qstat);
2285 SETERRNO(saved_errno, saved_vaxc_errno);
2288 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2290 #endif /* !DOSISH */
2292 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2294 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2298 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2302 char spid[TYPE_CHARS(int)];
2305 sprintf(spid, "%"IVdf, (IV)pid);
2306 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2307 if (svp && *svp != &PL_sv_undef) {
2308 *statusp = SvIVX(*svp);
2309 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2316 hv_iterinit(PL_pidstatus);
2317 if ((entry = hv_iternext(PL_pidstatus))) {
2318 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2319 sv = hv_iterval(PL_pidstatus,entry);
2320 *statusp = SvIVX(sv);
2321 sprintf(spid, "%"IVdf, (IV)pid);
2322 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2329 # ifdef HAS_WAITPID_RUNTIME
2330 if (!HAS_WAITPID_RUNTIME)
2333 return PerlProc_waitpid(pid,statusp,flags);
2335 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2336 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2338 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2343 Perl_croak(aTHX_ "Can't do waitpid with flags");
2345 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2346 pidgone(result,*statusp);
2354 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2358 Perl_pidgone(pTHX_ Pid_t pid, int status)
2361 char spid[TYPE_CHARS(int)];
2363 sprintf(spid, "%"IVdf, (IV)pid);
2364 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2365 (void)SvUPGRADE(sv,SVt_IV);
2370 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2373 int /* Cannot prototype with I32
2375 my_syspclose(PerlIO *ptr)
2378 Perl_my_pclose(pTHX_ PerlIO *ptr)
2381 /* Needs work for PerlIO ! */
2382 FILE *f = PerlIO_findFILE(ptr);
2383 I32 result = pclose(f);
2385 result = (result << 8) & 0xff00;
2387 PerlIO_releaseFILE(ptr,f);
2393 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2396 register const char *frombase = from;
2399 register const char c = *from;
2404 while (count-- > 0) {
2405 for (todo = len; todo > 0; todo--) {
2414 Perl_same_dirent(pTHX_ char *a, char *b)
2416 char *fa = strrchr(a,'/');
2417 char *fb = strrchr(b,'/');
2418 struct stat tmpstatbuf1;
2419 struct stat tmpstatbuf2;
2420 SV *tmpsv = sv_newmortal();
2433 sv_setpv(tmpsv, ".");
2435 sv_setpvn(tmpsv, a, fa - a);
2436 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2439 sv_setpv(tmpsv, ".");
2441 sv_setpvn(tmpsv, b, fb - b);
2442 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2444 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2445 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2447 #endif /* !HAS_RENAME */
2450 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2452 char *xfound = Nullch;
2453 char *xfailed = Nullch;
2454 char tmpbuf[MAXPATHLEN];
2458 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2459 # define SEARCH_EXTS ".bat", ".cmd", NULL
2460 # define MAX_EXT_LEN 4
2463 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2464 # define MAX_EXT_LEN 4
2467 # define SEARCH_EXTS ".pl", ".com", NULL
2468 # define MAX_EXT_LEN 4
2470 /* additional extensions to try in each dir if scriptname not found */
2472 char *exts[] = { SEARCH_EXTS };
2473 char **ext = search_ext ? search_ext : exts;
2474 int extidx = 0, i = 0;
2475 char *curext = Nullch;
2477 # define MAX_EXT_LEN 0
2481 * If dosearch is true and if scriptname does not contain path
2482 * delimiters, search the PATH for scriptname.
2484 * If SEARCH_EXTS is also defined, will look for each
2485 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2486 * while searching the PATH.
2488 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2489 * proceeds as follows:
2490 * If DOSISH or VMSISH:
2491 * + look for ./scriptname{,.foo,.bar}
2492 * + search the PATH for scriptname{,.foo,.bar}
2495 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2496 * this will not look in '.' if it's not in the PATH)
2501 # ifdef ALWAYS_DEFTYPES
2502 len = strlen(scriptname);
2503 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2504 int hasdir, idx = 0, deftypes = 1;
2507 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2510 int hasdir, idx = 0, deftypes = 1;
2513 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2515 /* The first time through, just add SEARCH_EXTS to whatever we
2516 * already have, so we can check for default file types. */
2518 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2524 if ((strlen(tmpbuf) + strlen(scriptname)
2525 + MAX_EXT_LEN) >= sizeof tmpbuf)
2526 continue; /* don't search dir with too-long name */
2527 strcat(tmpbuf, scriptname);
2531 if (strEQ(scriptname, "-"))
2533 if (dosearch) { /* Look in '.' first. */
2534 char *cur = scriptname;
2536 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2538 if (strEQ(ext[i++],curext)) {
2539 extidx = -1; /* already has an ext */
2544 DEBUG_p(PerlIO_printf(Perl_debug_log,
2545 "Looking for %s\n",cur));
2546 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2547 && !S_ISDIR(PL_statbuf.st_mode)) {
2555 if (cur == scriptname) {
2556 len = strlen(scriptname);
2557 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2559 cur = strcpy(tmpbuf, scriptname);
2561 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2562 && strcpy(tmpbuf+len, ext[extidx++]));
2567 #ifdef MACOS_TRADITIONAL
2568 if (dosearch && !strchr(scriptname, ':') &&
2569 (s = PerlEnv_getenv("Commands")))
2571 if (dosearch && !strchr(scriptname, '/')
2573 && !strchr(scriptname, '\\')
2575 && (s = PerlEnv_getenv("PATH")))
2580 PL_bufend = s + strlen(s);
2581 while (s < PL_bufend) {
2582 #ifdef MACOS_TRADITIONAL
2583 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2587 #if defined(atarist) || defined(DOSISH)
2592 && *s != ';'; len++, s++) {
2593 if (len < sizeof tmpbuf)
2596 if (len < sizeof tmpbuf)
2598 #else /* ! (atarist || DOSISH) */
2599 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2602 #endif /* ! (atarist || DOSISH) */
2603 #endif /* MACOS_TRADITIONAL */
2606 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2607 continue; /* don't search dir with too-long name */
2608 #ifdef MACOS_TRADITIONAL
2609 if (len && tmpbuf[len - 1] != ':')
2610 tmpbuf[len++] = ':';
2613 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2614 && tmpbuf[len - 1] != '/'
2615 && tmpbuf[len - 1] != '\\'
2618 tmpbuf[len++] = '/';
2619 if (len == 2 && tmpbuf[0] == '.')
2622 (void)strcpy(tmpbuf + len, scriptname);
2626 len = strlen(tmpbuf);
2627 if (extidx > 0) /* reset after previous loop */
2631 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2632 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2633 if (S_ISDIR(PL_statbuf.st_mode)) {
2637 } while ( retval < 0 /* not there */
2638 && extidx>=0 && ext[extidx] /* try an extension? */
2639 && strcpy(tmpbuf+len, ext[extidx++])
2644 if (S_ISREG(PL_statbuf.st_mode)
2645 && cando(S_IRUSR,TRUE,&PL_statbuf)
2646 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2647 && cando(S_IXUSR,TRUE,&PL_statbuf)
2651 xfound = tmpbuf; /* bingo! */
2655 xfailed = savepv(tmpbuf);
2658 if (!xfound && !seen_dot && !xfailed &&
2659 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2660 || S_ISDIR(PL_statbuf.st_mode)))
2662 seen_dot = 1; /* Disable message. */
2664 if (flags & 1) { /* do or die? */
2665 Perl_croak(aTHX_ "Can't %s %s%s%s",
2666 (xfailed ? "execute" : "find"),
2667 (xfailed ? xfailed : scriptname),
2668 (xfailed ? "" : " on PATH"),
2669 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2671 scriptname = Nullch;
2675 scriptname = xfound;
2677 return (scriptname ? savepv(scriptname) : Nullch);
2680 #ifndef PERL_GET_CONTEXT_DEFINED
2683 Perl_get_context(void)
2685 #if defined(USE_THREADS) || defined(USE_ITHREADS)
2686 # ifdef OLD_PTHREADS_API
2688 if (pthread_getspecific(PL_thr_key, &t))
2689 Perl_croak_nocontext("panic: pthread_getspecific");
2692 # ifdef I_MACH_CTHREADS
2693 return (void*)cthread_data(cthread_self());
2695 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2704 Perl_set_context(void *t)
2706 #if defined(USE_THREADS) || defined(USE_ITHREADS)
2707 # ifdef I_MACH_CTHREADS
2708 cthread_set_data(cthread_self(), t);
2710 if (pthread_setspecific(PL_thr_key, t))
2711 Perl_croak_nocontext("panic: pthread_setspecific");
2716 #endif /* !PERL_GET_CONTEXT_DEFINED */
2721 /* Very simplistic scheduler for now */
2725 thr = thr->i.next_run;
2729 Perl_cond_init(pTHX_ perl_cond *cp)
2735 Perl_cond_signal(pTHX_ perl_cond *cp)
2738 perl_cond cond = *cp;
2743 /* Insert t in the runnable queue just ahead of us */
2744 t->i.next_run = thr->i.next_run;
2745 thr->i.next_run->i.prev_run = t;
2746 t->i.prev_run = thr;
2747 thr->i.next_run = t;
2748 thr->i.wait_queue = 0;
2749 /* Remove from the wait queue */
2755 Perl_cond_broadcast(pTHX_ perl_cond *cp)
2758 perl_cond cond, cond_next;
2760 for (cond = *cp; cond; cond = cond_next) {
2762 /* Insert t in the runnable queue just ahead of us */
2763 t->i.next_run = thr->i.next_run;
2764 thr->i.next_run->i.prev_run = t;
2765 t->i.prev_run = thr;
2766 thr->i.next_run = t;
2767 thr->i.wait_queue = 0;
2768 /* Remove from the wait queue */
2769 cond_next = cond->next;
2776 Perl_cond_wait(pTHX_ perl_cond *cp)
2780 if (thr->i.next_run == thr)
2781 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
2783 New(666, cond, 1, struct perl_wait_queue);
2787 thr->i.wait_queue = cond;
2788 /* Remove ourselves from runnable queue */
2789 thr->i.next_run->i.prev_run = thr->i.prev_run;
2790 thr->i.prev_run->i.next_run = thr->i.next_run;
2792 #endif /* FAKE_THREADS */
2795 Perl_condpair_magic(pTHX_ SV *sv)
2799 (void)SvUPGRADE(sv, SVt_PVMG);
2800 mg = mg_find(sv, PERL_MAGIC_mutex);
2804 New(53, cp, 1, condpair_t);
2805 MUTEX_INIT(&cp->mutex);
2806 COND_INIT(&cp->owner_cond);
2807 COND_INIT(&cp->cond);
2809 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
2810 mg = mg_find(sv, PERL_MAGIC_mutex);
2812 /* someone else beat us to initialising it */
2813 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2814 MUTEX_DESTROY(&cp->mutex);
2815 COND_DESTROY(&cp->owner_cond);
2816 COND_DESTROY(&cp->cond);
2820 sv_magic(sv, Nullsv, PERL_MAGIC_mutex, 0, 0);
2822 mg->mg_ptr = (char *)cp;
2823 mg->mg_len = sizeof(cp);
2824 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2825 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
2826 "%p: condpair_magic %p\n", thr, sv));)
2833 Perl_sv_lock(pTHX_ SV *osv)
2843 mg = condpair_magic(sv);
2844 MUTEX_LOCK(MgMUTEXP(mg));
2845 if (MgOWNER(mg) == thr)
2846 MUTEX_UNLOCK(MgMUTEXP(mg));
2849 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2851 DEBUG_S(PerlIO_printf(Perl_debug_log,
2852 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
2853 PTR2UV(thr), PTR2UV(sv));)
2854 MUTEX_UNLOCK(MgMUTEXP(mg));
2855 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2857 UNLOCK_SV_LOCK_MUTEX;
2862 * Make a new perl thread structure using t as a prototype. Some of the
2863 * fields for the new thread are copied from the prototype thread, t,
2864 * so t should not be running in perl at the time this function is
2865 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2866 * thread calling new_struct_thread) clearly satisfies this constraint.
2868 struct perl_thread *
2869 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
2871 #if !defined(PERL_IMPLICIT_CONTEXT)
2872 struct perl_thread *thr;
2878 sv = newSVpvn("", 0);
2879 SvGROW(sv, sizeof(struct perl_thread) + 1);
2880 SvCUR_set(sv, sizeof(struct perl_thread));
2881 thr = (Thread) SvPVX(sv);
2883 memset(thr, 0xab, sizeof(struct perl_thread));
2890 Zero(&PL_hv_fetch_ent_mh, 1, HE);
2891 PL_efloatbuf = (char*)NULL;
2894 Zero(thr, 1, struct perl_thread);
2900 PL_curcop = &PL_compiling;
2901 thr->interp = t->interp;
2902 thr->cvcache = newHV();
2903 thr->threadsv = newAV();
2904 thr->specific = newAV();
2905 thr->errsv = newSVpvn("", 0);
2906 thr->flags = THRf_R_JOINABLE;
2908 MUTEX_INIT(&thr->mutex);
2912 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
2915 PL_statname = NEWSV(66,0);
2916 PL_errors = newSVpvn("", 0);
2918 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
2919 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
2920 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
2921 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
2922 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
2924 PL_reginterp_cnt = 0;
2925 PL_lastscream = Nullsv;
2928 PL_reg_start_tmp = 0;
2929 PL_reg_start_tmpl = 0;
2930 PL_reg_poscache = Nullch;
2932 /* parent thread's data needs to be locked while we make copy */
2933 MUTEX_LOCK(&t->mutex);
2935 #ifdef PERL_FLEXIBLE_EXCEPTIONS
2936 PL_protect = t->Tprotect;
2939 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
2940 PL_defstash = t->Tdefstash; /* XXX maybe these should */
2941 PL_curstash = t->Tcurstash; /* always be set to main? */
2943 PL_tainted = t->Ttainted;
2944 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
2945 PL_nrs = newSVsv(t->Tnrs);
2946 PL_rs = t->Tnrs ? SvREFCNT_inc(PL_nrs) : Nullsv;
2947 PL_last_in_gv = Nullgv;
2948 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
2949 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2950 PL_chopset = t->Tchopset;
2951 PL_bodytarget = newSVsv(t->Tbodytarget);
2952 PL_toptarget = newSVsv(t->Ttoptarget);
2953 if (t->Tformtarget == t->Ttoptarget)
2954 PL_formtarget = PL_toptarget;
2956 PL_formtarget = PL_bodytarget;
2958 /* Initialise all per-thread SVs that the template thread used */
2959 svp = AvARRAY(t->threadsv);
2960 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2961 if (*svp && *svp != &PL_sv_undef) {
2962 SV *sv = newSVsv(*svp);
2963 av_store(thr->threadsv, i, sv);
2964 sv_magic(sv, 0, PERL_MAGIC_sv, &PL_threadsv_names[i], 1);
2965 DEBUG_S(PerlIO_printf(Perl_debug_log,
2966 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
2970 thr->threadsvp = AvARRAY(thr->threadsv);
2972 MUTEX_LOCK(&PL_threads_mutex);
2974 thr->tid = ++PL_threadnum;
2975 thr->next = t->next;
2978 thr->next->prev = thr;
2979 MUTEX_UNLOCK(&PL_threads_mutex);
2981 /* done copying parent's state */
2982 MUTEX_UNLOCK(&t->mutex);
2984 #ifdef HAVE_THREAD_INTERN
2985 Perl_init_thread_intern(thr);
2986 #endif /* HAVE_THREAD_INTERN */
2989 #endif /* USE_THREADS */
2991 #ifdef PERL_GLOBAL_STRUCT
3000 Perl_get_op_names(pTHX)
3006 Perl_get_op_descs(pTHX)
3012 Perl_get_no_modify(pTHX)
3014 return (char*)PL_no_modify;
3018 Perl_get_opargs(pTHX)
3024 Perl_get_ppaddr(pTHX)
3026 return (PPADDR_t*)PL_ppaddr;
3029 #ifndef HAS_GETENV_LEN
3031 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3033 char *env_trans = PerlEnv_getenv(env_elem);
3035 *len = strlen(env_trans);
3042 Perl_get_vtbl(pTHX_ int vtbl_id)
3044 MGVTBL* result = Null(MGVTBL*);
3048 result = &PL_vtbl_sv;
3051 result = &PL_vtbl_env;
3053 case want_vtbl_envelem:
3054 result = &PL_vtbl_envelem;
3057 result = &PL_vtbl_sig;
3059 case want_vtbl_sigelem:
3060 result = &PL_vtbl_sigelem;
3062 case want_vtbl_pack:
3063 result = &PL_vtbl_pack;
3065 case want_vtbl_packelem:
3066 result = &PL_vtbl_packelem;
3068 case want_vtbl_dbline:
3069 result = &PL_vtbl_dbline;
3072 result = &PL_vtbl_isa;
3074 case want_vtbl_isaelem:
3075 result = &PL_vtbl_isaelem;
3077 case want_vtbl_arylen:
3078 result = &PL_vtbl_arylen;
3080 case want_vtbl_glob:
3081 result = &PL_vtbl_glob;
3083 case want_vtbl_mglob:
3084 result = &PL_vtbl_mglob;
3086 case want_vtbl_nkeys:
3087 result = &PL_vtbl_nkeys;
3089 case want_vtbl_taint:
3090 result = &PL_vtbl_taint;
3092 case want_vtbl_substr:
3093 result = &PL_vtbl_substr;
3096 result = &PL_vtbl_vec;
3099 result = &PL_vtbl_pos;
3102 result = &PL_vtbl_bm;
3105 result = &PL_vtbl_fm;
3107 case want_vtbl_uvar:
3108 result = &PL_vtbl_uvar;
3111 case want_vtbl_mutex:
3112 result = &PL_vtbl_mutex;
3115 case want_vtbl_defelem:
3116 result = &PL_vtbl_defelem;
3118 case want_vtbl_regexp:
3119 result = &PL_vtbl_regexp;
3121 case want_vtbl_regdata:
3122 result = &PL_vtbl_regdata;
3124 case want_vtbl_regdatum:
3125 result = &PL_vtbl_regdatum;
3127 #ifdef USE_LOCALE_COLLATE
3128 case want_vtbl_collxfrm:
3129 result = &PL_vtbl_collxfrm;
3132 case want_vtbl_amagic:
3133 result = &PL_vtbl_amagic;
3135 case want_vtbl_amagicelem:
3136 result = &PL_vtbl_amagicelem;
3138 case want_vtbl_backref:
3139 result = &PL_vtbl_backref;
3146 Perl_my_fflush_all(pTHX)
3148 #if defined(FFLUSH_NULL)
3149 return PerlIO_flush(NULL);
3151 # if defined(HAS__FWALK)
3152 /* undocumented, unprototyped, but very useful BSDism */
3153 extern void _fwalk(int (*)(FILE *));
3157 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3159 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3160 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3162 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3163 open_max = sysconf(_SC_OPEN_MAX);
3166 open_max = FOPEN_MAX;
3169 open_max = OPEN_MAX;
3180 for (i = 0; i < open_max; i++)
3181 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3182 STDIO_STREAM_ARRAY[i]._file < open_max &&
3183 STDIO_STREAM_ARRAY[i]._flag)
3184 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3188 SETERRNO(EBADF,RMS$_IFI);
3195 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3200 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3201 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3203 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3204 char *type = OP_IS_SOCKET(op) ||
3205 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3206 "socket" : "filehandle";
3209 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3211 warn_type = WARN_CLOSED;
3215 warn_type = WARN_UNOPENED;
3218 if (gv && isGV(gv)) {
3219 SV *sv = sv_newmortal();
3220 gv_efullname4(sv, gv, Nullch, FALSE);
3224 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3226 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for %sput",
3228 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3230 Perl_warner(aTHX_ WARN_IO, "Filehandle opened only for %sput",
3231 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3232 } else if (name && *name) {
3233 Perl_warner(aTHX_ warn_type,
3234 "%s%s on %s %s %s", func, pars, vile, type, name);
3235 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3236 Perl_warner(aTHX_ warn_type,
3237 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3241 Perl_warner(aTHX_ warn_type,
3242 "%s%s on %s %s", func, pars, vile, type);
3243 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3244 Perl_warner(aTHX_ warn_type,
3245 "\t(Are you trying to call %s%s on dirhandle?)\n",
3251 /* in ASCII order, not that it matters */
3252 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3255 Perl_ebcdic_control(pTHX_ int ch)
3263 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3264 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3267 if (ctlp == controllablechars)
3268 return('\177'); /* DEL */
3270 return((unsigned char)(ctlp - controllablechars - 1));
3271 } else { /* Want uncontrol */
3272 if (ch == '\177' || ch == -1)
3274 else if (ch == '\157')
3276 else if (ch == '\174')
3278 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3280 else if (ch == '\155')
3282 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3283 return(controllablechars[ch+1]);
3285 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3290 /* XXX struct tm on some systems (SunOS4/BSD) contains extra (non POSIX)
3291 * fields for which we don't have Configure support yet:
3292 * char *tm_zone; -- abbreviation of timezone name
3293 * long tm_gmtoff; -- offset from GMT in seconds
3294 * To workaround core dumps from the uninitialised tm_zone we get the
3295 * system to give us a reasonable struct to copy. This fix means that
3296 * strftime uses the tm_zone and tm_gmtoff values returned by
3297 * localtime(time()). That should give the desired result most of the
3298 * time. But probably not always!
3300 * This is a temporary workaround to be removed once Configure
3301 * support is added and NETaa14816 is considered in full.
3302 * It does not address tzname aspects of NETaa14816.
3305 # ifndef STRUCT_TM_HASZONE
3306 # define STRUCT_TM_HASZONE
3311 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3313 #ifdef STRUCT_TM_HASZONE
3316 Copy(localtime(&now), ptm, 1, struct tm);
3321 * mini_mktime - normalise struct tm values without the localtime()
3322 * semantics (and overhead) of mktime().
3325 Perl_mini_mktime(pTHX_ struct tm *ptm)
3329 int month, mday, year, jday;
3330 int odd_cent, odd_year;
3332 #define DAYS_PER_YEAR 365
3333 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3334 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3335 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3336 #define SECS_PER_HOUR (60*60)
3337 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3338 /* parentheses deliberately absent on these two, otherwise they don't work */
3339 #define MONTH_TO_DAYS 153/5
3340 #define DAYS_TO_MONTH 5/153
3341 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3342 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3343 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3344 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3347 * Year/day algorithm notes:
3349 * With a suitable offset for numeric value of the month, one can find
3350 * an offset into the year by considering months to have 30.6 (153/5) days,
3351 * using integer arithmetic (i.e., with truncation). To avoid too much
3352 * messing about with leap days, we consider January and February to be
3353 * the 13th and 14th month of the previous year. After that transformation,
3354 * we need the month index we use to be high by 1 from 'normal human' usage,
3355 * so the month index values we use run from 4 through 15.
3357 * Given that, and the rules for the Gregorian calendar (leap years are those
3358 * divisible by 4 unless also divisible by 100, when they must be divisible
3359 * by 400 instead), we can simply calculate the number of days since some
3360 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3361 * the days we derive from our month index, and adding in the day of the
3362 * month. The value used here is not adjusted for the actual origin which
3363 * it normally would use (1 January A.D. 1), since we're not exposing it.
3364 * We're only building the value so we can turn around and get the
3365 * normalised values for the year, month, day-of-month, and day-of-year.
3367 * For going backward, we need to bias the value we're using so that we find
3368 * the right year value. (Basically, we don't want the contribution of
3369 * March 1st to the number to apply while deriving the year). Having done
3370 * that, we 'count up' the contribution to the year number by accounting for
3371 * full quadracenturies (400-year periods) with their extra leap days, plus
3372 * the contribution from full centuries (to avoid counting in the lost leap
3373 * days), plus the contribution from full quad-years (to count in the normal
3374 * leap days), plus the leftover contribution from any non-leap years.
3375 * At this point, if we were working with an actual leap day, we'll have 0
3376 * days left over. This is also true for March 1st, however. So, we have
3377 * to special-case that result, and (earlier) keep track of the 'odd'
3378 * century and year contributions. If we got 4 extra centuries in a qcent,
3379 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3380 * Otherwise, we add back in the earlier bias we removed (the 123 from
3381 * figuring in March 1st), find the month index (integer division by 30.6),
3382 * and the remainder is the day-of-month. We then have to convert back to
3383 * 'real' months (including fixing January and February from being 14/15 in
3384 * the previous year to being in the proper year). After that, to get
3385 * tm_yday, we work with the normalised year and get a new yearday value for
3386 * January 1st, which we subtract from the yearday value we had earlier,
3387 * representing the date we've re-built. This is done from January 1
3388 * because tm_yday is 0-origin.
3390 * Since POSIX time routines are only guaranteed to work for times since the
3391 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3392 * applies Gregorian calendar rules even to dates before the 16th century
3393 * doesn't bother me. Besides, you'd need cultural context for a given
3394 * date to know whether it was Julian or Gregorian calendar, and that's
3395 * outside the scope for this routine. Since we convert back based on the
3396 * same rules we used to build the yearday, you'll only get strange results
3397 * for input which needed normalising, or for the 'odd' century years which
3398 * were leap years in the Julian calander but not in the Gregorian one.
3399 * I can live with that.
3401 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3402 * that's still outside the scope for POSIX time manipulation, so I don't
3406 year = 1900 + ptm->tm_year;
3407 month = ptm->tm_mon;
3408 mday = ptm->tm_mday;
3409 /* allow given yday with no month & mday to dominate the result */
3410 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3413 jday = 1 + ptm->tm_yday;
3422 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3423 yearday += month*MONTH_TO_DAYS + mday + jday;
3425 * Note that we don't know when leap-seconds were or will be,
3426 * so we have to trust the user if we get something which looks
3427 * like a sensible leap-second. Wild values for seconds will
3428 * be rationalised, however.
3430 if ((unsigned) ptm->tm_sec <= 60) {
3437 secs += 60 * ptm->tm_min;
3438 secs += SECS_PER_HOUR * ptm->tm_hour;
3440 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3441 /* got negative remainder, but need positive time */
3442 /* back off an extra day to compensate */
3443 yearday += (secs/SECS_PER_DAY)-1;
3444 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3447 yearday += (secs/SECS_PER_DAY);
3448 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3451 else if (secs >= SECS_PER_DAY) {
3452 yearday += (secs/SECS_PER_DAY);
3453 secs %= SECS_PER_DAY;
3455 ptm->tm_hour = secs/SECS_PER_HOUR;
3456 secs %= SECS_PER_HOUR;
3457 ptm->tm_min = secs/60;
3459 ptm->tm_sec += secs;
3460 /* done with time of day effects */
3462 * The algorithm for yearday has (so far) left it high by 428.
3463 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3464 * bias it by 123 while trying to figure out what year it
3465 * really represents. Even with this tweak, the reverse
3466 * translation fails for years before A.D. 0001.
3467 * It would still fail for Feb 29, but we catch that one below.
3469 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3470 yearday -= YEAR_ADJUST;
3471 year = (yearday / DAYS_PER_QCENT) * 400;
3472 yearday %= DAYS_PER_QCENT;
3473 odd_cent = yearday / DAYS_PER_CENT;
3474 year += odd_cent * 100;
3475 yearday %= DAYS_PER_CENT;
3476 year += (yearday / DAYS_PER_QYEAR) * 4;
3477 yearday %= DAYS_PER_QYEAR;
3478 odd_year = yearday / DAYS_PER_YEAR;
3480 yearday %= DAYS_PER_YEAR;
3481 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3486 yearday += YEAR_ADJUST; /* recover March 1st crock */
3487 month = yearday*DAYS_TO_MONTH;
3488 yearday -= month*MONTH_TO_DAYS;
3489 /* recover other leap-year adjustment */
3498 ptm->tm_year = year - 1900;
3500 ptm->tm_mday = yearday;
3501 ptm->tm_mon = month;
3505 ptm->tm_mon = month - 1;
3507 /* re-build yearday based on Jan 1 to get tm_yday */
3509 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3510 yearday += 14*MONTH_TO_DAYS + 1;
3511 ptm->tm_yday = jday - yearday;
3512 /* fix tm_wday if not overridden by caller */
3513 if ((unsigned)ptm->tm_wday > 6)
3514 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3518 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3526 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3529 mytm.tm_hour = hour;
3530 mytm.tm_mday = mday;
3532 mytm.tm_year = year;
3533 mytm.tm_wday = wday;
3534 mytm.tm_yday = yday;
3535 mytm.tm_isdst = isdst;
3538 New(0, buf, buflen, char);
3539 len = strftime(buf, buflen, fmt, &mytm);
3541 ** The following is needed to handle to the situation where
3542 ** tmpbuf overflows. Basically we want to allocate a buffer
3543 ** and try repeatedly. The reason why it is so complicated
3544 ** is that getting a return value of 0 from strftime can indicate
3545 ** one of the following:
3546 ** 1. buffer overflowed,
3547 ** 2. illegal conversion specifier, or
3548 ** 3. the format string specifies nothing to be returned(not
3549 ** an error). This could be because format is an empty string
3550 ** or it specifies %p that yields an empty string in some locale.
3551 ** If there is a better way to make it portable, go ahead by
3554 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3557 /* Possibly buf overflowed - try again with a bigger buf */
3558 int fmtlen = strlen(fmt);
3559 int bufsize = fmtlen + buflen;
3561 New(0, buf, bufsize, char);
3563 buflen = strftime(buf, bufsize, fmt, &mytm);
3564 if (buflen > 0 && buflen < bufsize)
3566 /* heuristic to prevent out-of-memory errors */
3567 if (bufsize > 100*fmtlen) {
3573 Renew(buf, bufsize, char);
3578 Perl_croak(aTHX_ "panic: no strftime");
3583 #define SV_CWD_RETURN_UNDEF \
3584 sv_setsv(sv, &PL_sv_undef); \
3587 #define SV_CWD_ISDOT(dp) \
3588 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3589 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3592 =for apidoc sv_getcwd
3594 Fill the sv with current working directory
3599 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3600 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3601 * getcwd(3) if available
3602 * Comments from the orignal:
3603 * This is a faster version of getcwd. It's also more dangerous
3604 * because you might chdir out of a directory that you can't chdir
3608 Perl_sv_getcwd(pTHX_ register SV *sv)
3614 char buf[MAXPATHLEN];
3616 /* Some getcwd()s automatically allocate a buffer of the given
3617 * size from the heap if they are given a NULL buffer pointer.
3618 * The problem is that this behaviour is not portable. */
3619 if (getcwd(buf, sizeof(buf) - 1)) {
3620 STRLEN len = strlen(buf);
3621 sv_setpvn(sv, buf, len);
3625 sv_setsv(sv, &PL_sv_undef);
3632 struct stat statbuf;
3633 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3634 int namelen, pathlen=0;
3638 (void)SvUPGRADE(sv, SVt_PV);
3640 if (PerlLIO_lstat(".", &statbuf) < 0) {
3641 SV_CWD_RETURN_UNDEF;
3644 orig_cdev = statbuf.st_dev;
3645 orig_cino = statbuf.st_ino;
3653 if (PerlDir_chdir("..") < 0) {
3654 SV_CWD_RETURN_UNDEF;
3656 if (PerlLIO_stat(".", &statbuf) < 0) {
3657 SV_CWD_RETURN_UNDEF;
3660 cdev = statbuf.st_dev;
3661 cino = statbuf.st_ino;
3663 if (odev == cdev && oino == cino) {
3666 if (!(dir = PerlDir_open("."))) {
3667 SV_CWD_RETURN_UNDEF;
3670 while ((dp = PerlDir_read(dir)) != NULL) {
3672 namelen = dp->d_namlen;
3674 namelen = strlen(dp->d_name);
3677 if (SV_CWD_ISDOT(dp)) {
3681 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3682 SV_CWD_RETURN_UNDEF;
3685 tdev = statbuf.st_dev;
3686 tino = statbuf.st_ino;
3687 if (tino == oino && tdev == odev) {
3693 SV_CWD_RETURN_UNDEF;
3696 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3697 SV_CWD_RETURN_UNDEF;
3700 SvGROW(sv, pathlen + namelen + 1);
3704 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3707 /* prepend current directory to the front */
3709 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3710 pathlen += (namelen + 1);
3712 #ifdef VOID_CLOSEDIR
3715 if (PerlDir_close(dir) < 0) {
3716 SV_CWD_RETURN_UNDEF;
3722 SvCUR_set(sv, pathlen);
3726 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3727 SV_CWD_RETURN_UNDEF;
3730 if (PerlLIO_stat(".", &statbuf) < 0) {
3731 SV_CWD_RETURN_UNDEF;
3734 cdev = statbuf.st_dev;
3735 cino = statbuf.st_ino;
3737 if (cdev != orig_cdev || cino != orig_cino) {
3738 Perl_croak(aTHX_ "Unstable directory path, "
3739 "current directory changed unexpectedly");