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 /* These must be defined when not using Perl's malloc for binary
344 Malloc_t Perl_malloc (MEM_SIZE nbytes)
347 return PerlMem_malloc(nbytes);
350 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
353 return PerlMem_calloc(elements, size);
356 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
359 return PerlMem_realloc(where, nbytes);
362 Free_t Perl_mfree (Malloc_t where)
370 /* copy a string up to some (non-backslashed) delimiter, if any */
373 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
376 for (tolen = 0; from < fromend; from++, tolen++) {
378 if (from[1] == delim)
387 else if (*from == delim)
398 /* return ptr to little string in big string, NULL if not found */
399 /* This routine was donated by Corey Satten. */
402 Perl_instr(pTHX_ register const char *big, register const char *little)
404 register const char *s, *x;
415 for (x=big,s=little; *s; /**/ ) {
424 return (char*)(big-1);
429 /* same as instr but allow embedded nulls */
432 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
434 register const char *s, *x;
435 register I32 first = *little;
436 register const char *littleend = lend;
438 if (!first && little >= littleend)
440 if (bigend - big < littleend - little)
442 bigend -= littleend - little++;
443 while (big <= bigend) {
446 for (x=big,s=little; s < littleend; /**/ ) {
453 return (char*)(big-1);
458 /* reverse of the above--find last substring */
461 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
463 register const char *bigbeg;
464 register const char *s, *x;
465 register I32 first = *little;
466 register const char *littleend = lend;
468 if (!first && little >= littleend)
469 return (char*)bigend;
471 big = bigend - (littleend - little++);
472 while (big >= bigbeg) {
475 for (x=big+2,s=little; s < littleend; /**/ ) {
482 return (char*)(big+1);
487 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
489 /* As a space optimization, we do not compile tables for strings of length
490 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
491 special-cased in fbm_instr().
493 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
496 =for apidoc fbm_compile
498 Analyses the string in order to make fast searches on it using fbm_instr()
499 -- the Boyer-Moore algorithm.
505 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
514 if (flags & FBMcf_TAIL)
515 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
516 s = (U8*)SvPV_force(sv, len);
517 (void)SvUPGRADE(sv, SVt_PVBM);
518 if (len == 0) /* TAIL might be on on a zero-length string. */
528 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
529 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
530 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
531 memset((void*)table, mlen, 256);
532 table[-1] = (U8)flags;
534 sb = s - mlen + 1; /* first char (maybe) */
536 if (table[*s] == mlen)
541 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
544 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
545 for (i = 0; i < len; i++) {
546 if (PL_freq[s[i]] < frequency) {
548 frequency = PL_freq[s[i]];
551 BmRARE(sv) = s[rarest];
552 BmPREVIOUS(sv) = rarest;
553 BmUSEFUL(sv) = 100; /* Initial value */
554 if (flags & FBMcf_TAIL)
556 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
557 BmRARE(sv),BmPREVIOUS(sv)));
560 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
561 /* If SvTAIL is actually due to \Z or \z, this gives false positives
565 =for apidoc fbm_instr
567 Returns the location of the SV in the string delimited by C<str> and
568 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
569 does not have to be fbm_compiled, but the search will not be as fast
576 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
578 register unsigned char *s;
580 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
581 register STRLEN littlelen = l;
582 register I32 multiline = flags & FBMrf_MULTILINE;
584 if (bigend - big < littlelen) {
585 if ( SvTAIL(littlestr)
586 && (bigend - big == littlelen - 1)
588 || (*big == *little &&
589 memEQ((char *)big, (char *)little, littlelen - 1))))
594 if (littlelen <= 2) { /* Special-cased */
596 if (littlelen == 1) {
597 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
598 /* Know that bigend != big. */
599 if (bigend[-1] == '\n')
600 return (char *)(bigend - 1);
601 return (char *) bigend;
609 if (SvTAIL(littlestr))
610 return (char *) bigend;
614 return (char*)big; /* Cannot be SvTAIL! */
617 if (SvTAIL(littlestr) && !multiline) {
618 if (bigend[-1] == '\n' && bigend[-2] == *little)
619 return (char*)bigend - 2;
620 if (bigend[-1] == *little)
621 return (char*)bigend - 1;
625 /* This should be better than FBM if c1 == c2, and almost
626 as good otherwise: maybe better since we do less indirection.
627 And we save a lot of memory by caching no table. */
628 register unsigned char c1 = little[0];
629 register unsigned char c2 = little[1];
634 while (s <= bigend) {
644 goto check_1char_anchor;
655 goto check_1char_anchor;
658 while (s <= bigend) {
663 goto check_1char_anchor;
672 check_1char_anchor: /* One char and anchor! */
673 if (SvTAIL(littlestr) && (*bigend == *little))
674 return (char *)bigend; /* bigend is already decremented. */
677 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
678 s = bigend - littlelen;
679 if (s >= big && bigend[-1] == '\n' && *s == *little
680 /* Automatically of length > 2 */
681 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
683 return (char*)s; /* how sweet it is */
686 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
688 return (char*)s + 1; /* how sweet it is */
692 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
693 char *b = ninstr((char*)big,(char*)bigend,
694 (char*)little, (char*)little + littlelen);
696 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
697 /* Chop \n from littlestr: */
698 s = bigend - littlelen + 1;
700 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
709 { /* Do actual FBM. */
710 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
711 register unsigned char *oldlittle;
713 if (littlelen > bigend - big)
715 --littlelen; /* Last char found by table lookup */
718 little += littlelen; /* last char */
725 if ((tmp = table[*s])) {
726 if ((s += tmp) < bigend)
730 else { /* less expensive than calling strncmp() */
731 register unsigned char *olds = s;
736 if (*--s == *--little)
738 s = olds + 1; /* here we pay the price for failure */
740 if (s < bigend) /* fake up continue to outer loop */
748 if ( s == bigend && (table[-1] & FBMcf_TAIL)
749 && memEQ((char *)(bigend - littlelen),
750 (char *)(oldlittle - littlelen), littlelen) )
751 return (char*)bigend - littlelen;
756 /* start_shift, end_shift are positive quantities which give offsets
757 of ends of some substring of bigstr.
758 If `last' we want the last occurence.
759 old_posp is the way of communication between consequent calls if
760 the next call needs to find the .
761 The initial *old_posp should be -1.
763 Note that we take into account SvTAIL, so one can get extra
764 optimizations if _ALL flag is set.
767 /* If SvTAIL is actually due to \Z or \z, this gives false positives
768 if PL_multiline. In fact if !PL_multiline the authoritative answer
769 is not supported yet. */
772 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
774 register unsigned char *s, *x;
775 register unsigned char *big;
777 register I32 previous;
779 register unsigned char *little;
780 register I32 stop_pos;
781 register unsigned char *littleend;
785 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
786 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
788 if ( BmRARE(littlestr) == '\n'
789 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
790 little = (unsigned char *)(SvPVX(littlestr));
791 littleend = little + SvCUR(littlestr);
798 little = (unsigned char *)(SvPVX(littlestr));
799 littleend = little + SvCUR(littlestr);
801 /* The value of pos we can start at: */
802 previous = BmPREVIOUS(littlestr);
803 big = (unsigned char *)(SvPVX(bigstr));
804 /* The value of pos we can stop at: */
805 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
806 if (previous + start_shift > stop_pos) {
808 stop_pos does not include SvTAIL in the count, so this check is incorrect
809 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
812 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
817 while (pos < previous + start_shift) {
818 if (!(pos += PL_screamnext[pos]))
823 if (pos >= stop_pos) break;
824 if (big[pos] != first)
826 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
832 if (s == littleend) {
834 if (!last) return (char *)(big+pos);
837 } while ( pos += PL_screamnext[pos] );
839 return (char *)(big+(*old_posp));
841 if (!SvTAIL(littlestr) || (end_shift > 0))
843 /* Ignore the trailing "\n". This code is not microoptimized */
844 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
845 stop_pos = littleend - little; /* Actual littlestr len */
850 && ((stop_pos == 1) ||
851 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
857 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
859 register U8 *a = (U8 *)s1;
860 register U8 *b = (U8 *)s2;
862 if (*a != *b && *a != PL_fold[*b])
870 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
872 register U8 *a = (U8 *)s1;
873 register U8 *b = (U8 *)s2;
875 if (*a != *b && *a != PL_fold_locale[*b])
882 /* copy a string to a safe spot */
887 Copy a string to a safe spot. This does not use an SV.
893 Perl_savepv(pTHX_ const char *sv)
895 register char *newaddr;
897 New(902,newaddr,strlen(sv)+1,char);
898 (void)strcpy(newaddr,sv);
902 /* same thing but with a known length */
907 Copy a string to a safe spot. The C<len> indicates number of bytes to
908 copy. This does not use an SV.
914 Perl_savepvn(pTHX_ const char *sv, register I32 len)
916 register char *newaddr;
918 New(903,newaddr,len+1,char);
919 Copy(sv,newaddr,len,char); /* might not be null terminated */
920 newaddr[len] = '\0'; /* is now */
924 /* the SV for Perl_form() and mess() is not kept in an arena */
933 return sv_2mortal(newSVpvn("",0));
938 /* Create as PVMG now, to avoid any upgrading later */
940 Newz(905, any, 1, XPVMG);
941 SvFLAGS(sv) = SVt_PVMG;
942 SvANY(sv) = (void*)any;
943 SvREFCNT(sv) = 1 << 30; /* practically infinite */
948 #if defined(PERL_IMPLICIT_CONTEXT)
950 Perl_form_nocontext(const char* pat, ...)
956 retval = vform(pat, &args);
960 #endif /* PERL_IMPLICIT_CONTEXT */
963 Perl_form(pTHX_ const char* pat, ...)
968 retval = vform(pat, &args);
974 Perl_vform(pTHX_ const char *pat, va_list *args)
976 SV *sv = mess_alloc();
977 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
981 #if defined(PERL_IMPLICIT_CONTEXT)
983 Perl_mess_nocontext(const char *pat, ...)
989 retval = vmess(pat, &args);
993 #endif /* PERL_IMPLICIT_CONTEXT */
996 Perl_mess(pTHX_ const char *pat, ...)
1000 va_start(args, pat);
1001 retval = vmess(pat, &args);
1007 S_closest_cop(pTHX_ COP *cop, OP *o)
1009 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1011 if (!o || o == PL_op) return cop;
1013 if (o->op_flags & OPf_KIDS) {
1015 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1019 /* If the OP_NEXTSTATE has been optimised away we can still use it
1020 * the get the file and line number. */
1022 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1025 /* Keep searching, and return when we've found something. */
1027 new_cop = closest_cop(cop, kid);
1028 if (new_cop) return new_cop;
1032 /* Nothing found. */
1038 Perl_vmess(pTHX_ const char *pat, va_list *args)
1040 SV *sv = mess_alloc();
1041 static char dgd[] = " during global destruction.\n";
1044 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1045 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1048 * Try and find the file and line for PL_op. This will usually be
1049 * PL_curcop, but it might be a cop that has been optimised away. We
1050 * can try to find such a cop by searching through the optree starting
1051 * from the sibling of PL_curcop.
1054 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1055 if (!cop) cop = PL_curcop;
1058 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1059 CopFILE(cop), (IV)CopLINE(cop));
1060 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1061 bool line_mode = (RsSIMPLE(PL_rs) &&
1062 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1063 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1064 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1065 line_mode ? "line" : "chunk",
1066 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1070 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1072 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1078 Perl_vdie(pTHX_ const char* pat, va_list *args)
1081 int was_in_eval = PL_in_eval;
1088 DEBUG_S(PerlIO_printf(Perl_debug_log,
1089 "%p: die: curstack = %p, mainstack = %p\n",
1090 thr, PL_curstack, PL_mainstack));
1093 msv = vmess(pat, args);
1094 if (PL_errors && SvCUR(PL_errors)) {
1095 sv_catsv(PL_errors, msv);
1096 message = SvPV(PL_errors, msglen);
1097 SvCUR_set(PL_errors, 0);
1100 message = SvPV(msv,msglen);
1107 DEBUG_S(PerlIO_printf(Perl_debug_log,
1108 "%p: die: message = %s\ndiehook = %p\n",
1109 thr, message, PL_diehook));
1111 /* sv_2cv might call Perl_croak() */
1112 SV *olddiehook = PL_diehook;
1114 SAVESPTR(PL_diehook);
1115 PL_diehook = Nullsv;
1116 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1118 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1125 msg = newSVpvn(message, msglen);
1133 PUSHSTACKi(PERLSI_DIEHOOK);
1137 call_sv((SV*)cv, G_DISCARD);
1143 PL_restartop = die_where(message, msglen);
1144 DEBUG_S(PerlIO_printf(Perl_debug_log,
1145 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1146 thr, PL_restartop, was_in_eval, PL_top_env));
1147 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1149 return PL_restartop;
1152 #if defined(PERL_IMPLICIT_CONTEXT)
1154 Perl_die_nocontext(const char* pat, ...)
1159 va_start(args, pat);
1160 o = vdie(pat, &args);
1164 #endif /* PERL_IMPLICIT_CONTEXT */
1167 Perl_die(pTHX_ const char* pat, ...)
1171 va_start(args, pat);
1172 o = vdie(pat, &args);
1178 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1188 msv = vmess(pat, args);
1189 if (PL_errors && SvCUR(PL_errors)) {
1190 sv_catsv(PL_errors, msv);
1191 message = SvPV(PL_errors, msglen);
1192 SvCUR_set(PL_errors, 0);
1195 message = SvPV(msv,msglen);
1202 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1203 PTR2UV(thr), message));
1206 /* sv_2cv might call Perl_croak() */
1207 SV *olddiehook = PL_diehook;
1209 SAVESPTR(PL_diehook);
1210 PL_diehook = Nullsv;
1211 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1213 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1220 msg = newSVpvn(message, msglen);
1228 PUSHSTACKi(PERLSI_DIEHOOK);
1232 call_sv((SV*)cv, G_DISCARD);
1238 PL_restartop = die_where(message, msglen);
1243 /* SFIO can really mess with your errno */
1246 PerlIO *serr = Perl_error_log;
1248 PerlIO_write(serr, message, msglen);
1249 (void)PerlIO_flush(serr);
1257 #if defined(PERL_IMPLICIT_CONTEXT)
1259 Perl_croak_nocontext(const char *pat, ...)
1263 va_start(args, pat);
1268 #endif /* PERL_IMPLICIT_CONTEXT */
1273 This is the XSUB-writer's interface to Perl's C<die> function.
1274 Normally use this function the same way you use the C C<printf>
1275 function. See C<warn>.
1277 If you want to throw an exception object, assign the object to
1278 C<$@> and then pass C<Nullch> to croak():
1280 errsv = get_sv("@", TRUE);
1281 sv_setsv(errsv, exception_object);
1288 Perl_croak(pTHX_ const char *pat, ...)
1291 va_start(args, pat);
1298 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1307 msv = vmess(pat, args);
1308 message = SvPV(msv, msglen);
1311 /* sv_2cv might call Perl_warn() */
1312 SV *oldwarnhook = PL_warnhook;
1314 SAVESPTR(PL_warnhook);
1315 PL_warnhook = Nullsv;
1316 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1318 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1324 msg = newSVpvn(message, msglen);
1328 PUSHSTACKi(PERLSI_WARNHOOK);
1332 call_sv((SV*)cv, G_DISCARD);
1339 PerlIO *serr = Perl_error_log;
1341 PerlIO_write(serr, message, msglen);
1343 DEBUG_L(*message == '!'
1344 ? (xstat(message[1]=='!'
1345 ? (message[2]=='!' ? 2 : 1)
1350 (void)PerlIO_flush(serr);
1354 #if defined(PERL_IMPLICIT_CONTEXT)
1356 Perl_warn_nocontext(const char *pat, ...)
1360 va_start(args, pat);
1364 #endif /* PERL_IMPLICIT_CONTEXT */
1369 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
1370 function the same way you use the C C<printf> function. See
1377 Perl_warn(pTHX_ const char *pat, ...)
1380 va_start(args, pat);
1385 #if defined(PERL_IMPLICIT_CONTEXT)
1387 Perl_warner_nocontext(U32 err, const char *pat, ...)
1391 va_start(args, pat);
1392 vwarner(err, pat, &args);
1395 #endif /* PERL_IMPLICIT_CONTEXT */
1398 Perl_warner(pTHX_ U32 err, const char* pat,...)
1401 va_start(args, pat);
1402 vwarner(err, pat, &args);
1407 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1416 msv = vmess(pat, args);
1417 message = SvPV(msv, msglen);
1421 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s", PTR2UV(thr), message));
1422 #endif /* USE_THREADS */
1424 /* sv_2cv might call Perl_croak() */
1425 SV *olddiehook = PL_diehook;
1427 SAVESPTR(PL_diehook);
1428 PL_diehook = Nullsv;
1429 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1431 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1437 msg = newSVpvn(message, msglen);
1441 PUSHSTACKi(PERLSI_DIEHOOK);
1445 call_sv((SV*)cv, G_DISCARD);
1451 PL_restartop = die_where(message, msglen);
1455 PerlIO *serr = Perl_error_log;
1456 PerlIO_write(serr, message, msglen);
1457 (void)PerlIO_flush(serr);
1464 /* sv_2cv might call Perl_warn() */
1465 SV *oldwarnhook = PL_warnhook;
1467 SAVESPTR(PL_warnhook);
1468 PL_warnhook = Nullsv;
1469 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1471 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1477 msg = newSVpvn(message, msglen);
1481 PUSHSTACKi(PERLSI_WARNHOOK);
1485 call_sv((SV*)cv, G_DISCARD);
1492 PerlIO *serr = Perl_error_log;
1493 PerlIO_write(serr, message, msglen);
1495 DEBUG_L(*message == '!'
1496 ? (xstat(message[1]=='!'
1497 ? (message[2]=='!' ? 2 : 1)
1502 (void)PerlIO_flush(serr);
1507 #ifdef USE_ENVIRON_ARRAY
1508 /* VMS' and EPOC's my_setenv() is in vms.c and epoc.c */
1509 #if !defined(WIN32) && !defined(NETWARE)
1511 Perl_my_setenv(pTHX_ char *nam, char *val)
1513 #ifndef PERL_USE_SAFE_PUTENV
1514 /* most putenv()s leak, so we manipulate environ directly */
1515 register I32 i=setenv_getix(nam); /* where does it go? */
1517 if (environ == PL_origenviron) { /* need we copy environment? */
1523 for (max = i; environ[max]; max++) ;
1524 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1525 for (j=0; j<max; j++) { /* copy environment */
1526 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1527 strcpy(tmpenv[j], environ[j]);
1529 tmpenv[max] = Nullch;
1530 environ = tmpenv; /* tell exec where it is now */
1533 safesysfree(environ[i]);
1534 while (environ[i]) {
1535 environ[i] = environ[i+1];
1540 if (!environ[i]) { /* does not exist yet */
1541 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1542 environ[i+1] = Nullch; /* make sure it's null terminated */
1545 safesysfree(environ[i]);
1546 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1548 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1550 #else /* PERL_USE_SAFE_PUTENV */
1551 # if defined(__CYGWIN__)
1552 setenv(nam, val, 1);
1556 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1557 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1558 (void)putenv(new_env);
1559 # endif /* __CYGWIN__ */
1560 #endif /* PERL_USE_SAFE_PUTENV */
1563 #else /* WIN32 || NETWARE */
1566 Perl_my_setenv(pTHX_ char *nam,char *val)
1568 register char *envstr;
1569 STRLEN len = strlen(nam) + 3;
1574 New(904, envstr, len, char);
1575 (void)sprintf(envstr,"%s=%s",nam,val);
1576 (void)PerlEnv_putenv(envstr);
1580 #endif /* WIN32 || NETWARE */
1583 Perl_setenv_getix(pTHX_ char *nam)
1585 register I32 i, len = strlen(nam);
1587 for (i = 0; environ[i]; i++) {
1590 strnicmp(environ[i],nam,len) == 0
1592 strnEQ(environ[i],nam,len)
1594 && environ[i][len] == '=')
1595 break; /* strnEQ must come first to avoid */
1596 } /* potential SEGV's */
1600 #endif /* !VMS && !EPOC*/
1602 #ifdef UNLINK_ALL_VERSIONS
1604 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1608 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1613 /* this is a drop-in replacement for bcopy() */
1614 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1616 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1620 if (from - to >= 0) {
1628 *(--to) = *(--from);
1634 /* this is a drop-in replacement for memset() */
1637 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1647 /* this is a drop-in replacement for bzero() */
1648 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1650 Perl_my_bzero(register char *loc, register I32 len)
1660 /* this is a drop-in replacement for memcmp() */
1661 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1663 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1665 register U8 *a = (U8 *)s1;
1666 register U8 *b = (U8 *)s2;
1670 if (tmp = *a++ - *b++)
1675 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1679 #ifdef USE_CHAR_VSPRINTF
1684 vsprintf(char *dest, const char *pat, char *args)
1688 fakebuf._ptr = dest;
1689 fakebuf._cnt = 32767;
1693 fakebuf._flag = _IOWRT|_IOSTRG;
1694 _doprnt(pat, args, &fakebuf); /* what a kludge */
1695 (void)putc('\0', &fakebuf);
1696 #ifdef USE_CHAR_VSPRINTF
1699 return 0; /* perl doesn't use return value */
1703 #endif /* HAS_VPRINTF */
1706 #if BYTEORDER != 0x4321
1708 Perl_my_swap(pTHX_ short s)
1710 #if (BYTEORDER & 1) == 0
1713 result = ((s & 255) << 8) + ((s >> 8) & 255);
1721 Perl_my_htonl(pTHX_ long l)
1725 char c[sizeof(long)];
1728 #if BYTEORDER == 0x1234
1729 u.c[0] = (l >> 24) & 255;
1730 u.c[1] = (l >> 16) & 255;
1731 u.c[2] = (l >> 8) & 255;
1735 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1736 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1741 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1742 u.c[o & 0xf] = (l >> s) & 255;
1750 Perl_my_ntohl(pTHX_ long l)
1754 char c[sizeof(long)];
1757 #if BYTEORDER == 0x1234
1758 u.c[0] = (l >> 24) & 255;
1759 u.c[1] = (l >> 16) & 255;
1760 u.c[2] = (l >> 8) & 255;
1764 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1765 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1772 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1773 l |= (u.c[o & 0xf] & 255) << s;
1780 #endif /* BYTEORDER != 0x4321 */
1784 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1785 * If these functions are defined,
1786 * the BYTEORDER is neither 0x1234 nor 0x4321.
1787 * However, this is not assumed.
1791 #define HTOV(name,type) \
1793 name (register type n) \
1797 char c[sizeof(type)]; \
1801 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1802 u.c[i] = (n >> s) & 0xFF; \
1807 #define VTOH(name,type) \
1809 name (register type n) \
1813 char c[sizeof(type)]; \
1819 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1820 n += (u.c[i] & 0xFF) << s; \
1825 #if defined(HAS_HTOVS) && !defined(htovs)
1828 #if defined(HAS_HTOVL) && !defined(htovl)
1831 #if defined(HAS_VTOHS) && !defined(vtohs)
1834 #if defined(HAS_VTOHL) && !defined(vtohl)
1839 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1841 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1843 register I32 This, that;
1849 PERL_FLUSHALL_FOR_CHILD;
1850 This = (*mode == 'w');
1854 taint_proper("Insecure %s%s", "EXEC");
1856 if (PerlProc_pipe(p) < 0)
1858 /* Try for another pipe pair for error return */
1859 if (PerlProc_pipe(pp) >= 0)
1861 while ((pid = vfork()) < 0) {
1862 if (errno != EAGAIN) {
1863 PerlLIO_close(p[This]);
1865 PerlLIO_close(pp[0]);
1866 PerlLIO_close(pp[1]);
1878 /* Close parent's end of _the_ pipe */
1879 PerlLIO_close(p[THAT]);
1880 /* Close parent's end of error status pipe (if any) */
1882 PerlLIO_close(pp[0]);
1883 #if defined(HAS_FCNTL) && defined(F_SETFD)
1884 /* Close error pipe automatically if exec works */
1885 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1888 /* Now dup our end of _the_ pipe to right position */
1889 if (p[THIS] != (*mode == 'r')) {
1890 PerlLIO_dup2(p[THIS], *mode == 'r');
1891 PerlLIO_close(p[THIS]);
1893 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1894 /* No automatic close - do it by hand */
1901 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1907 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1913 do_execfree(); /* free any memory malloced by child on vfork */
1914 /* Close child's end of pipe */
1915 PerlLIO_close(p[that]);
1917 PerlLIO_close(pp[1]);
1918 /* Keep the lower of the two fd numbers */
1919 if (p[that] < p[This]) {
1920 PerlLIO_dup2(p[This], p[that]);
1921 PerlLIO_close(p[This]);
1925 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1927 (void)SvUPGRADE(sv,SVt_IV);
1929 PL_forkprocess = pid;
1930 /* If we managed to get status pipe check for exec fail */
1931 if (did_pipes && pid > 0) {
1935 while (n < sizeof(int)) {
1936 n1 = PerlLIO_read(pp[0],
1937 (void*)(((char*)&errkid)+n),
1943 PerlLIO_close(pp[0]);
1945 if (n) { /* Error */
1947 if (n != sizeof(int))
1948 Perl_croak(aTHX_ "panic: kid popen errno read");
1950 pid2 = wait4pid(pid, &status, 0);
1951 } while (pid2 == -1 && errno == EINTR);
1952 errno = errkid; /* Propagate errno from kid */
1957 PerlLIO_close(pp[0]);
1958 return PerlIO_fdopen(p[This], mode);
1960 Perl_croak(aTHX_ "List form of piped open not implemented");
1961 return (PerlIO *) NULL;
1965 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1966 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
1968 Perl_my_popen(pTHX_ char *cmd, char *mode)
1971 register I32 This, that;
1974 I32 doexec = strNE(cmd,"-");
1978 PERL_FLUSHALL_FOR_CHILD;
1981 return my_syspopen(aTHX_ cmd,mode);
1984 This = (*mode == 'w');
1986 if (doexec && PL_tainting) {
1988 taint_proper("Insecure %s%s", "EXEC");
1990 if (PerlProc_pipe(p) < 0)
1992 if (doexec && PerlProc_pipe(pp) >= 0)
1994 while ((pid = (doexec?vfork():fork())) < 0) {
1995 if (errno != EAGAIN) {
1996 PerlLIO_close(p[This]);
1998 PerlLIO_close(pp[0]);
1999 PerlLIO_close(pp[1]);
2002 Perl_croak(aTHX_ "Can't fork");
2014 PerlLIO_close(p[THAT]);
2016 PerlLIO_close(pp[0]);
2017 #if defined(HAS_FCNTL) && defined(F_SETFD)
2018 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2021 if (p[THIS] != (*mode == 'r')) {
2022 PerlLIO_dup2(p[THIS], *mode == 'r');
2023 PerlLIO_close(p[THIS]);
2027 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2036 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2041 /* may or may not use the shell */
2042 do_exec3(cmd, pp[1], did_pipes);
2045 #endif /* defined OS2 */
2047 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV)))
2048 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2050 hv_clear(PL_pidstatus); /* we have no children */
2055 do_execfree(); /* free any memory malloced by child on vfork */
2056 PerlLIO_close(p[that]);
2058 PerlLIO_close(pp[1]);
2059 if (p[that] < p[This]) {
2060 PerlLIO_dup2(p[This], p[that]);
2061 PerlLIO_close(p[This]);
2065 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2067 (void)SvUPGRADE(sv,SVt_IV);
2069 PL_forkprocess = pid;
2070 if (did_pipes && pid > 0) {
2074 while (n < sizeof(int)) {
2075 n1 = PerlLIO_read(pp[0],
2076 (void*)(((char*)&errkid)+n),
2082 PerlLIO_close(pp[0]);
2084 if (n) { /* Error */
2086 if (n != sizeof(int))
2087 Perl_croak(aTHX_ "panic: kid popen errno read");
2089 pid2 = wait4pid(pid, &status, 0);
2090 } while (pid2 == -1 && errno == EINTR);
2091 errno = errkid; /* Propagate errno from kid */
2096 PerlLIO_close(pp[0]);
2097 return PerlIO_fdopen(p[This], mode);
2100 #if defined(atarist)
2103 Perl_my_popen(pTHX_ char *cmd, char *mode)
2105 PERL_FLUSHALL_FOR_CHILD;
2106 /* Call system's popen() to get a FILE *, then import it.
2107 used 0 for 2nd parameter to PerlIO_importFILE;
2110 return PerlIO_importFILE(popen(cmd, mode), 0);
2114 FILE *djgpp_popen();
2116 Perl_my_popen(pTHX_ char *cmd, char *mode)
2118 PERL_FLUSHALL_FOR_CHILD;
2119 /* Call system's popen() to get a FILE *, then import it.
2120 used 0 for 2nd parameter to PerlIO_importFILE;
2123 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2128 #endif /* !DOSISH */
2132 Perl_dump_fds(pTHX_ char *s)
2135 struct stat tmpstatbuf;
2137 PerlIO_printf(Perl_debug_log,"%s", s);
2138 for (fd = 0; fd < 32; fd++) {
2139 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2140 PerlIO_printf(Perl_debug_log," %d",fd);
2142 PerlIO_printf(Perl_debug_log,"\n");
2144 #endif /* DUMP_FDS */
2148 dup2(int oldfd, int newfd)
2150 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2153 PerlLIO_close(newfd);
2154 return fcntl(oldfd, F_DUPFD, newfd);
2156 #define DUP2_MAX_FDS 256
2157 int fdtmp[DUP2_MAX_FDS];
2163 PerlLIO_close(newfd);
2164 /* good enough for low fd's... */
2165 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2166 if (fdx >= DUP2_MAX_FDS) {
2174 PerlLIO_close(fdtmp[--fdx]);
2181 #ifdef HAS_SIGACTION
2184 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2186 struct sigaction act, oact;
2188 act.sa_handler = handler;
2189 sigemptyset(&act.sa_mask);
2192 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2193 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2197 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2198 act.sa_flags |= SA_NOCLDWAIT;
2200 if (sigaction(signo, &act, &oact) == -1)
2203 return oact.sa_handler;
2207 Perl_rsignal_state(pTHX_ int signo)
2209 struct sigaction oact;
2211 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2214 return oact.sa_handler;
2218 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2220 struct sigaction act;
2222 act.sa_handler = handler;
2223 sigemptyset(&act.sa_mask);
2226 #if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
2227 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2231 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2232 act.sa_flags |= SA_NOCLDWAIT;
2234 return sigaction(signo, &act, save);
2238 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2240 return sigaction(signo, save, (struct sigaction *)NULL);
2243 #else /* !HAS_SIGACTION */
2246 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2248 return PerlProc_signal(signo, handler);
2251 static int sig_trapped;
2261 Perl_rsignal_state(pTHX_ int signo)
2263 Sighandler_t oldsig;
2266 oldsig = PerlProc_signal(signo, sig_trap);
2267 PerlProc_signal(signo, oldsig);
2269 PerlProc_kill(PerlProc_getpid(), signo);
2274 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2276 *save = PerlProc_signal(signo, handler);
2277 return (*save == SIG_ERR) ? -1 : 0;
2281 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2283 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2286 #endif /* !HAS_SIGACTION */
2287 #endif /* !PERL_MICRO */
2289 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2290 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2292 Perl_my_pclose(pTHX_ PerlIO *ptr)
2294 Sigsave_t hstat, istat, qstat;
2300 int saved_errno = 0;
2302 int saved_vaxc_errno;
2305 int saved_win32_errno;
2309 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2311 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2313 *svp = &PL_sv_undef;
2315 if (pid == -1) { /* Opened by popen. */
2316 return my_syspclose(ptr);
2319 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2320 saved_errno = errno;
2322 saved_vaxc_errno = vaxc$errno;
2325 saved_win32_errno = GetLastError();
2329 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2332 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2333 rsignal_save(SIGINT, SIG_IGN, &istat);
2334 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2337 pid2 = wait4pid(pid, &status, 0);
2338 } while (pid2 == -1 && errno == EINTR);
2340 rsignal_restore(SIGHUP, &hstat);
2341 rsignal_restore(SIGINT, &istat);
2342 rsignal_restore(SIGQUIT, &qstat);
2345 SETERRNO(saved_errno, saved_vaxc_errno);
2348 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2350 #endif /* !DOSISH */
2352 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2354 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2358 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2362 char spid[TYPE_CHARS(int)];
2365 sprintf(spid, "%"IVdf, (IV)pid);
2366 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2367 if (svp && *svp != &PL_sv_undef) {
2368 *statusp = SvIVX(*svp);
2369 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2376 hv_iterinit(PL_pidstatus);
2377 if ((entry = hv_iternext(PL_pidstatus))) {
2378 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2379 sv = hv_iterval(PL_pidstatus,entry);
2380 *statusp = SvIVX(sv);
2381 sprintf(spid, "%"IVdf, (IV)pid);
2382 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2389 # ifdef HAS_WAITPID_RUNTIME
2390 if (!HAS_WAITPID_RUNTIME)
2393 return PerlProc_waitpid(pid,statusp,flags);
2395 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2396 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2398 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2403 Perl_croak(aTHX_ "Can't do waitpid with flags");
2405 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2406 pidgone(result,*statusp);
2414 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2418 Perl_pidgone(pTHX_ Pid_t pid, int status)
2421 char spid[TYPE_CHARS(int)];
2423 sprintf(spid, "%"IVdf, (IV)pid);
2424 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2425 (void)SvUPGRADE(sv,SVt_IV);
2430 #if defined(atarist) || defined(OS2)
2433 int /* Cannot prototype with I32
2435 my_syspclose(PerlIO *ptr)
2438 Perl_my_pclose(pTHX_ PerlIO *ptr)
2441 /* Needs work for PerlIO ! */
2442 FILE *f = PerlIO_findFILE(ptr);
2443 I32 result = pclose(f);
2444 PerlIO_releaseFILE(ptr,f);
2452 Perl_my_pclose(pTHX_ PerlIO *ptr)
2454 /* Needs work for PerlIO ! */
2455 FILE *f = PerlIO_findFILE(ptr);
2456 I32 result = djgpp_pclose(f);
2457 result = (result << 8) & 0xff00;
2458 PerlIO_releaseFILE(ptr,f);
2464 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2467 register const char *frombase = from;
2470 register const char c = *from;
2475 while (count-- > 0) {
2476 for (todo = len; todo > 0; todo--) {
2485 Perl_same_dirent(pTHX_ char *a, char *b)
2487 char *fa = strrchr(a,'/');
2488 char *fb = strrchr(b,'/');
2489 struct stat tmpstatbuf1;
2490 struct stat tmpstatbuf2;
2491 SV *tmpsv = sv_newmortal();
2504 sv_setpv(tmpsv, ".");
2506 sv_setpvn(tmpsv, a, fa - a);
2507 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2510 sv_setpv(tmpsv, ".");
2512 sv_setpvn(tmpsv, b, fb - b);
2513 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2515 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2516 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2518 #endif /* !HAS_RENAME */
2521 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2523 char *xfound = Nullch;
2524 char *xfailed = Nullch;
2525 char tmpbuf[MAXPATHLEN];
2529 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2530 # define SEARCH_EXTS ".bat", ".cmd", NULL
2531 # define MAX_EXT_LEN 4
2534 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2535 # define MAX_EXT_LEN 4
2538 # define SEARCH_EXTS ".pl", ".com", NULL
2539 # define MAX_EXT_LEN 4
2541 /* additional extensions to try in each dir if scriptname not found */
2543 char *exts[] = { SEARCH_EXTS };
2544 char **ext = search_ext ? search_ext : exts;
2545 int extidx = 0, i = 0;
2546 char *curext = Nullch;
2548 # define MAX_EXT_LEN 0
2552 * If dosearch is true and if scriptname does not contain path
2553 * delimiters, search the PATH for scriptname.
2555 * If SEARCH_EXTS is also defined, will look for each
2556 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2557 * while searching the PATH.
2559 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2560 * proceeds as follows:
2561 * If DOSISH or VMSISH:
2562 * + look for ./scriptname{,.foo,.bar}
2563 * + search the PATH for scriptname{,.foo,.bar}
2566 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2567 * this will not look in '.' if it's not in the PATH)
2572 # ifdef ALWAYS_DEFTYPES
2573 len = strlen(scriptname);
2574 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2575 int hasdir, idx = 0, deftypes = 1;
2578 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2581 int hasdir, idx = 0, deftypes = 1;
2584 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2586 /* The first time through, just add SEARCH_EXTS to whatever we
2587 * already have, so we can check for default file types. */
2589 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2595 if ((strlen(tmpbuf) + strlen(scriptname)
2596 + MAX_EXT_LEN) >= sizeof tmpbuf)
2597 continue; /* don't search dir with too-long name */
2598 strcat(tmpbuf, scriptname);
2602 if (strEQ(scriptname, "-"))
2604 if (dosearch) { /* Look in '.' first. */
2605 char *cur = scriptname;
2607 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2609 if (strEQ(ext[i++],curext)) {
2610 extidx = -1; /* already has an ext */
2615 DEBUG_p(PerlIO_printf(Perl_debug_log,
2616 "Looking for %s\n",cur));
2617 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2618 && !S_ISDIR(PL_statbuf.st_mode)) {
2626 if (cur == scriptname) {
2627 len = strlen(scriptname);
2628 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2630 cur = strcpy(tmpbuf, scriptname);
2632 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2633 && strcpy(tmpbuf+len, ext[extidx++]));
2638 #ifdef MACOS_TRADITIONAL
2639 if (dosearch && !strchr(scriptname, ':') &&
2640 (s = PerlEnv_getenv("Commands")))
2642 if (dosearch && !strchr(scriptname, '/')
2644 && !strchr(scriptname, '\\')
2646 && (s = PerlEnv_getenv("PATH")))
2651 PL_bufend = s + strlen(s);
2652 while (s < PL_bufend) {
2653 #ifdef MACOS_TRADITIONAL
2654 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2658 #if defined(atarist) || defined(DOSISH)
2663 && *s != ';'; len++, s++) {
2664 if (len < sizeof tmpbuf)
2667 if (len < sizeof tmpbuf)
2669 #else /* ! (atarist || DOSISH) */
2670 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2673 #endif /* ! (atarist || DOSISH) */
2674 #endif /* MACOS_TRADITIONAL */
2677 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2678 continue; /* don't search dir with too-long name */
2679 #ifdef MACOS_TRADITIONAL
2680 if (len && tmpbuf[len - 1] != ':')
2681 tmpbuf[len++] = ':';
2684 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2685 && tmpbuf[len - 1] != '/'
2686 && tmpbuf[len - 1] != '\\'
2689 tmpbuf[len++] = '/';
2690 if (len == 2 && tmpbuf[0] == '.')
2693 (void)strcpy(tmpbuf + len, scriptname);
2697 len = strlen(tmpbuf);
2698 if (extidx > 0) /* reset after previous loop */
2702 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2703 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2704 if (S_ISDIR(PL_statbuf.st_mode)) {
2708 } while ( retval < 0 /* not there */
2709 && extidx>=0 && ext[extidx] /* try an extension? */
2710 && strcpy(tmpbuf+len, ext[extidx++])
2715 if (S_ISREG(PL_statbuf.st_mode)
2716 && cando(S_IRUSR,TRUE,&PL_statbuf)
2717 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2718 && cando(S_IXUSR,TRUE,&PL_statbuf)
2722 xfound = tmpbuf; /* bingo! */
2726 xfailed = savepv(tmpbuf);
2729 if (!xfound && !seen_dot && !xfailed &&
2730 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2731 || S_ISDIR(PL_statbuf.st_mode)))
2733 seen_dot = 1; /* Disable message. */
2735 if (flags & 1) { /* do or die? */
2736 Perl_croak(aTHX_ "Can't %s %s%s%s",
2737 (xfailed ? "execute" : "find"),
2738 (xfailed ? xfailed : scriptname),
2739 (xfailed ? "" : " on PATH"),
2740 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2742 scriptname = Nullch;
2746 scriptname = xfound;
2748 return (scriptname ? savepv(scriptname) : Nullch);
2751 #ifndef PERL_GET_CONTEXT_DEFINED
2754 Perl_get_context(void)
2756 #if defined(USE_THREADS) || defined(USE_ITHREADS)
2757 # ifdef OLD_PTHREADS_API
2759 if (pthread_getspecific(PL_thr_key, &t))
2760 Perl_croak_nocontext("panic: pthread_getspecific");
2763 # ifdef I_MACH_CTHREADS
2764 return (void*)cthread_data(cthread_self());
2766 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2775 Perl_set_context(void *t)
2777 #if defined(USE_THREADS) || defined(USE_ITHREADS)
2778 # ifdef I_MACH_CTHREADS
2779 cthread_set_data(cthread_self(), t);
2781 if (pthread_setspecific(PL_thr_key, t))
2782 Perl_croak_nocontext("panic: pthread_setspecific");
2787 #endif /* !PERL_GET_CONTEXT_DEFINED */
2792 /* Very simplistic scheduler for now */
2796 thr = thr->i.next_run;
2800 Perl_cond_init(pTHX_ perl_cond *cp)
2806 Perl_cond_signal(pTHX_ perl_cond *cp)
2809 perl_cond cond = *cp;
2814 /* Insert t in the runnable queue just ahead of us */
2815 t->i.next_run = thr->i.next_run;
2816 thr->i.next_run->i.prev_run = t;
2817 t->i.prev_run = thr;
2818 thr->i.next_run = t;
2819 thr->i.wait_queue = 0;
2820 /* Remove from the wait queue */
2826 Perl_cond_broadcast(pTHX_ perl_cond *cp)
2829 perl_cond cond, cond_next;
2831 for (cond = *cp; cond; cond = cond_next) {
2833 /* Insert t in the runnable queue just ahead of us */
2834 t->i.next_run = thr->i.next_run;
2835 thr->i.next_run->i.prev_run = t;
2836 t->i.prev_run = thr;
2837 thr->i.next_run = t;
2838 thr->i.wait_queue = 0;
2839 /* Remove from the wait queue */
2840 cond_next = cond->next;
2847 Perl_cond_wait(pTHX_ perl_cond *cp)
2851 if (thr->i.next_run == thr)
2852 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
2854 New(666, cond, 1, struct perl_wait_queue);
2858 thr->i.wait_queue = cond;
2859 /* Remove ourselves from runnable queue */
2860 thr->i.next_run->i.prev_run = thr->i.prev_run;
2861 thr->i.prev_run->i.next_run = thr->i.next_run;
2863 #endif /* FAKE_THREADS */
2866 Perl_condpair_magic(pTHX_ SV *sv)
2870 (void)SvUPGRADE(sv, SVt_PVMG);
2871 mg = mg_find(sv, PERL_MAGIC_mutex);
2875 New(53, cp, 1, condpair_t);
2876 MUTEX_INIT(&cp->mutex);
2877 COND_INIT(&cp->owner_cond);
2878 COND_INIT(&cp->cond);
2880 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
2881 mg = mg_find(sv, PERL_MAGIC_mutex);
2883 /* someone else beat us to initialising it */
2884 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2885 MUTEX_DESTROY(&cp->mutex);
2886 COND_DESTROY(&cp->owner_cond);
2887 COND_DESTROY(&cp->cond);
2891 sv_magic(sv, Nullsv, PERL_MAGIC_mutex, 0, 0);
2893 mg->mg_ptr = (char *)cp;
2894 mg->mg_len = sizeof(cp);
2895 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2896 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
2897 "%p: condpair_magic %p\n", thr, sv)));
2904 Perl_sv_lock(pTHX_ SV *osv)
2914 mg = condpair_magic(sv);
2915 MUTEX_LOCK(MgMUTEXP(mg));
2916 if (MgOWNER(mg) == thr)
2917 MUTEX_UNLOCK(MgMUTEXP(mg));
2920 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2922 DEBUG_S(PerlIO_printf(Perl_debug_log,
2923 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
2924 PTR2UV(thr), PTR2UV(sv)));
2925 MUTEX_UNLOCK(MgMUTEXP(mg));
2926 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2928 UNLOCK_SV_LOCK_MUTEX;
2933 * Make a new perl thread structure using t as a prototype. Some of the
2934 * fields for the new thread are copied from the prototype thread, t,
2935 * so t should not be running in perl at the time this function is
2936 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2937 * thread calling new_struct_thread) clearly satisfies this constraint.
2939 struct perl_thread *
2940 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
2942 #if !defined(PERL_IMPLICIT_CONTEXT)
2943 struct perl_thread *thr;
2949 sv = newSVpvn("", 0);
2950 SvGROW(sv, sizeof(struct perl_thread) + 1);
2951 SvCUR_set(sv, sizeof(struct perl_thread));
2952 thr = (Thread) SvPVX(sv);
2954 memset(thr, 0xab, sizeof(struct perl_thread));
2961 Zero(&PL_hv_fetch_ent_mh, 1, HE);
2962 PL_efloatbuf = (char*)NULL;
2965 Zero(thr, 1, struct perl_thread);
2971 PL_curcop = &PL_compiling;
2972 thr->interp = t->interp;
2973 thr->cvcache = newHV();
2974 thr->threadsv = newAV();
2975 thr->specific = newAV();
2976 thr->errsv = newSVpvn("", 0);
2977 thr->flags = THRf_R_JOINABLE;
2979 MUTEX_INIT(&thr->mutex);
2983 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
2986 PL_statname = NEWSV(66,0);
2987 PL_errors = newSVpvn("", 0);
2989 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
2990 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
2991 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
2992 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
2993 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
2995 PL_reginterp_cnt = 0;
2996 PL_lastscream = Nullsv;
2999 PL_reg_start_tmp = 0;
3000 PL_reg_start_tmpl = 0;
3001 PL_reg_poscache = Nullch;
3003 /* parent thread's data needs to be locked while we make copy */
3004 MUTEX_LOCK(&t->mutex);
3006 #ifdef PERL_FLEXIBLE_EXCEPTIONS
3007 PL_protect = t->Tprotect;
3010 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3011 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3012 PL_curstash = t->Tcurstash; /* always be set to main? */
3014 PL_tainted = t->Ttainted;
3015 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3016 PL_nrs = newSVsv(t->Tnrs);
3017 PL_rs = t->Tnrs ? SvREFCNT_inc(PL_nrs) : Nullsv;
3018 PL_last_in_gv = Nullgv;
3019 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
3020 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3021 PL_chopset = t->Tchopset;
3022 PL_bodytarget = newSVsv(t->Tbodytarget);
3023 PL_toptarget = newSVsv(t->Ttoptarget);
3024 if (t->Tformtarget == t->Ttoptarget)
3025 PL_formtarget = PL_toptarget;
3027 PL_formtarget = PL_bodytarget;
3029 /* Initialise all per-thread SVs that the template thread used */
3030 svp = AvARRAY(t->threadsv);
3031 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3032 if (*svp && *svp != &PL_sv_undef) {
3033 SV *sv = newSVsv(*svp);
3034 av_store(thr->threadsv, i, sv);
3035 sv_magic(sv, 0, PERL_MAGIC_sv, &PL_threadsv_names[i], 1);
3036 DEBUG_S(PerlIO_printf(Perl_debug_log,
3037 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
3041 thr->threadsvp = AvARRAY(thr->threadsv);
3043 MUTEX_LOCK(&PL_threads_mutex);
3045 thr->tid = ++PL_threadnum;
3046 thr->next = t->next;
3049 thr->next->prev = thr;
3050 MUTEX_UNLOCK(&PL_threads_mutex);
3052 /* done copying parent's state */
3053 MUTEX_UNLOCK(&t->mutex);
3055 #ifdef HAVE_THREAD_INTERN
3056 Perl_init_thread_intern(thr);
3057 #endif /* HAVE_THREAD_INTERN */
3060 #endif /* USE_THREADS */
3062 #ifdef PERL_GLOBAL_STRUCT
3071 Perl_get_op_names(pTHX)
3077 Perl_get_op_descs(pTHX)
3083 Perl_get_no_modify(pTHX)
3085 return (char*)PL_no_modify;
3089 Perl_get_opargs(pTHX)
3095 Perl_get_ppaddr(pTHX)
3097 return (PPADDR_t*)PL_ppaddr;
3100 #ifndef HAS_GETENV_LEN
3102 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3104 char *env_trans = PerlEnv_getenv(env_elem);
3106 *len = strlen(env_trans);
3113 Perl_get_vtbl(pTHX_ int vtbl_id)
3115 MGVTBL* result = Null(MGVTBL*);
3119 result = &PL_vtbl_sv;
3122 result = &PL_vtbl_env;
3124 case want_vtbl_envelem:
3125 result = &PL_vtbl_envelem;
3128 result = &PL_vtbl_sig;
3130 case want_vtbl_sigelem:
3131 result = &PL_vtbl_sigelem;
3133 case want_vtbl_pack:
3134 result = &PL_vtbl_pack;
3136 case want_vtbl_packelem:
3137 result = &PL_vtbl_packelem;
3139 case want_vtbl_dbline:
3140 result = &PL_vtbl_dbline;
3143 result = &PL_vtbl_isa;
3145 case want_vtbl_isaelem:
3146 result = &PL_vtbl_isaelem;
3148 case want_vtbl_arylen:
3149 result = &PL_vtbl_arylen;
3151 case want_vtbl_glob:
3152 result = &PL_vtbl_glob;
3154 case want_vtbl_mglob:
3155 result = &PL_vtbl_mglob;
3157 case want_vtbl_nkeys:
3158 result = &PL_vtbl_nkeys;
3160 case want_vtbl_taint:
3161 result = &PL_vtbl_taint;
3163 case want_vtbl_substr:
3164 result = &PL_vtbl_substr;
3167 result = &PL_vtbl_vec;
3170 result = &PL_vtbl_pos;
3173 result = &PL_vtbl_bm;
3176 result = &PL_vtbl_fm;
3178 case want_vtbl_uvar:
3179 result = &PL_vtbl_uvar;
3182 case want_vtbl_mutex:
3183 result = &PL_vtbl_mutex;
3186 case want_vtbl_defelem:
3187 result = &PL_vtbl_defelem;
3189 case want_vtbl_regexp:
3190 result = &PL_vtbl_regexp;
3192 case want_vtbl_regdata:
3193 result = &PL_vtbl_regdata;
3195 case want_vtbl_regdatum:
3196 result = &PL_vtbl_regdatum;
3198 #ifdef USE_LOCALE_COLLATE
3199 case want_vtbl_collxfrm:
3200 result = &PL_vtbl_collxfrm;
3203 case want_vtbl_amagic:
3204 result = &PL_vtbl_amagic;
3206 case want_vtbl_amagicelem:
3207 result = &PL_vtbl_amagicelem;
3209 case want_vtbl_backref:
3210 result = &PL_vtbl_backref;
3217 Perl_my_fflush_all(pTHX)
3219 #if defined(FFLUSH_NULL)
3220 return PerlIO_flush(NULL);
3222 # if defined(HAS__FWALK)
3223 /* undocumented, unprototyped, but very useful BSDism */
3224 extern void _fwalk(int (*)(FILE *));
3228 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3230 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3231 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3233 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3234 open_max = sysconf(_SC_OPEN_MAX);
3237 open_max = FOPEN_MAX;
3240 open_max = OPEN_MAX;
3251 for (i = 0; i < open_max; i++)
3252 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3253 STDIO_STREAM_ARRAY[i]._file < open_max &&
3254 STDIO_STREAM_ARRAY[i]._flag)
3255 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3259 SETERRNO(EBADF,RMS$_IFI);
3266 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3271 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3272 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3274 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3275 char *type = OP_IS_SOCKET(op) ||
3276 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3277 "socket" : "filehandle";
3280 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3282 warn_type = WARN_CLOSED;
3286 warn_type = WARN_UNOPENED;
3289 if (gv && isGV(gv)) {
3290 SV *sv = sv_newmortal();
3291 gv_efullname4(sv, gv, Nullch, FALSE);
3295 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3297 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for %sput",
3299 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3301 Perl_warner(aTHX_ WARN_IO, "Filehandle opened only for %sput",
3302 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3303 } else if (name && *name) {
3304 Perl_warner(aTHX_ warn_type,
3305 "%s%s on %s %s %s", func, pars, vile, type, name);
3306 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3307 Perl_warner(aTHX_ warn_type,
3308 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3312 Perl_warner(aTHX_ warn_type,
3313 "%s%s on %s %s", func, pars, vile, type);
3314 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3315 Perl_warner(aTHX_ warn_type,
3316 "\t(Are you trying to call %s%s on dirhandle?)\n",
3322 /* in ASCII order, not that it matters */
3323 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3326 Perl_ebcdic_control(pTHX_ int ch)
3334 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3335 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3338 if (ctlp == controllablechars)
3339 return('\177'); /* DEL */
3341 return((unsigned char)(ctlp - controllablechars - 1));
3342 } else { /* Want uncontrol */
3343 if (ch == '\177' || ch == -1)
3345 else if (ch == '\157')
3347 else if (ch == '\174')
3349 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3351 else if (ch == '\155')
3353 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3354 return(controllablechars[ch+1]);
3356 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3361 /* XXX struct tm on some systems (SunOS4/BSD) contains extra (non POSIX)
3362 * fields for which we don't have Configure support yet:
3363 * char *tm_zone; -- abbreviation of timezone name
3364 * long tm_gmtoff; -- offset from GMT in seconds
3365 * To workaround core dumps from the uninitialised tm_zone we get the
3366 * system to give us a reasonable struct to copy. This fix means that
3367 * strftime uses the tm_zone and tm_gmtoff values returned by
3368 * localtime(time()). That should give the desired result most of the
3369 * time. But probably not always!
3371 * This is a temporary workaround to be removed once Configure
3372 * support is added and NETaa14816 is considered in full.
3373 * It does not address tzname aspects of NETaa14816.
3376 # ifndef STRUCT_TM_HASZONE
3377 # define STRUCT_TM_HASZONE
3382 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3384 #ifdef STRUCT_TM_HASZONE
3387 Copy(localtime(&now), ptm, 1, struct tm);
3392 * mini_mktime - normalise struct tm values without the localtime()
3393 * semantics (and overhead) of mktime().
3396 Perl_mini_mktime(pTHX_ struct tm *ptm)
3400 int month, mday, year, jday;
3401 int odd_cent, odd_year;
3403 #define DAYS_PER_YEAR 365
3404 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3405 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3406 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3407 #define SECS_PER_HOUR (60*60)
3408 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3409 /* parentheses deliberately absent on these two, otherwise they don't work */
3410 #define MONTH_TO_DAYS 153/5
3411 #define DAYS_TO_MONTH 5/153
3412 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3413 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3414 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3415 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3418 * Year/day algorithm notes:
3420 * With a suitable offset for numeric value of the month, one can find
3421 * an offset into the year by considering months to have 30.6 (153/5) days,
3422 * using integer arithmetic (i.e., with truncation). To avoid too much
3423 * messing about with leap days, we consider January and February to be
3424 * the 13th and 14th month of the previous year. After that transformation,
3425 * we need the month index we use to be high by 1 from 'normal human' usage,
3426 * so the month index values we use run from 4 through 15.
3428 * Given that, and the rules for the Gregorian calendar (leap years are those
3429 * divisible by 4 unless also divisible by 100, when they must be divisible
3430 * by 400 instead), we can simply calculate the number of days since some
3431 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3432 * the days we derive from our month index, and adding in the day of the
3433 * month. The value used here is not adjusted for the actual origin which
3434 * it normally would use (1 January A.D. 1), since we're not exposing it.
3435 * We're only building the value so we can turn around and get the
3436 * normalised values for the year, month, day-of-month, and day-of-year.
3438 * For going backward, we need to bias the value we're using so that we find
3439 * the right year value. (Basically, we don't want the contribution of
3440 * March 1st to the number to apply while deriving the year). Having done
3441 * that, we 'count up' the contribution to the year number by accounting for
3442 * full quadracenturies (400-year periods) with their extra leap days, plus
3443 * the contribution from full centuries (to avoid counting in the lost leap
3444 * days), plus the contribution from full quad-years (to count in the normal
3445 * leap days), plus the leftover contribution from any non-leap years.
3446 * At this point, if we were working with an actual leap day, we'll have 0
3447 * days left over. This is also true for March 1st, however. So, we have
3448 * to special-case that result, and (earlier) keep track of the 'odd'
3449 * century and year contributions. If we got 4 extra centuries in a qcent,
3450 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3451 * Otherwise, we add back in the earlier bias we removed (the 123 from
3452 * figuring in March 1st), find the month index (integer division by 30.6),
3453 * and the remainder is the day-of-month. We then have to convert back to
3454 * 'real' months (including fixing January and February from being 14/15 in
3455 * the previous year to being in the proper year). After that, to get
3456 * tm_yday, we work with the normalised year and get a new yearday value for
3457 * January 1st, which we subtract from the yearday value we had earlier,
3458 * representing the date we've re-built. This is done from January 1
3459 * because tm_yday is 0-origin.
3461 * Since POSIX time routines are only guaranteed to work for times since the
3462 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3463 * applies Gregorian calendar rules even to dates before the 16th century
3464 * doesn't bother me. Besides, you'd need cultural context for a given
3465 * date to know whether it was Julian or Gregorian calendar, and that's
3466 * outside the scope for this routine. Since we convert back based on the
3467 * same rules we used to build the yearday, you'll only get strange results
3468 * for input which needed normalising, or for the 'odd' century years which
3469 * were leap years in the Julian calander but not in the Gregorian one.
3470 * I can live with that.
3472 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3473 * that's still outside the scope for POSIX time manipulation, so I don't
3477 year = 1900 + ptm->tm_year;
3478 month = ptm->tm_mon;
3479 mday = ptm->tm_mday;
3480 /* allow given yday with no month & mday to dominate the result */
3481 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3484 jday = 1 + ptm->tm_yday;
3493 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3494 yearday += month*MONTH_TO_DAYS + mday + jday;
3496 * Note that we don't know when leap-seconds were or will be,
3497 * so we have to trust the user if we get something which looks
3498 * like a sensible leap-second. Wild values for seconds will
3499 * be rationalised, however.
3501 if ((unsigned) ptm->tm_sec <= 60) {
3508 secs += 60 * ptm->tm_min;
3509 secs += SECS_PER_HOUR * ptm->tm_hour;
3511 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3512 /* got negative remainder, but need positive time */
3513 /* back off an extra day to compensate */
3514 yearday += (secs/SECS_PER_DAY)-1;
3515 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3518 yearday += (secs/SECS_PER_DAY);
3519 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3522 else if (secs >= SECS_PER_DAY) {
3523 yearday += (secs/SECS_PER_DAY);
3524 secs %= SECS_PER_DAY;
3526 ptm->tm_hour = secs/SECS_PER_HOUR;
3527 secs %= SECS_PER_HOUR;
3528 ptm->tm_min = secs/60;
3530 ptm->tm_sec += secs;
3531 /* done with time of day effects */
3533 * The algorithm for yearday has (so far) left it high by 428.
3534 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3535 * bias it by 123 while trying to figure out what year it
3536 * really represents. Even with this tweak, the reverse
3537 * translation fails for years before A.D. 0001.
3538 * It would still fail for Feb 29, but we catch that one below.
3540 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3541 yearday -= YEAR_ADJUST;
3542 year = (yearday / DAYS_PER_QCENT) * 400;
3543 yearday %= DAYS_PER_QCENT;
3544 odd_cent = yearday / DAYS_PER_CENT;
3545 year += odd_cent * 100;
3546 yearday %= DAYS_PER_CENT;
3547 year += (yearday / DAYS_PER_QYEAR) * 4;
3548 yearday %= DAYS_PER_QYEAR;
3549 odd_year = yearday / DAYS_PER_YEAR;
3551 yearday %= DAYS_PER_YEAR;
3552 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3557 yearday += YEAR_ADJUST; /* recover March 1st crock */
3558 month = yearday*DAYS_TO_MONTH;
3559 yearday -= month*MONTH_TO_DAYS;
3560 /* recover other leap-year adjustment */
3569 ptm->tm_year = year - 1900;
3571 ptm->tm_mday = yearday;
3572 ptm->tm_mon = month;
3576 ptm->tm_mon = month - 1;
3578 /* re-build yearday based on Jan 1 to get tm_yday */
3580 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3581 yearday += 14*MONTH_TO_DAYS + 1;
3582 ptm->tm_yday = jday - yearday;
3583 /* fix tm_wday if not overridden by caller */
3584 if ((unsigned)ptm->tm_wday > 6)
3585 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3589 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3597 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3600 mytm.tm_hour = hour;
3601 mytm.tm_mday = mday;
3603 mytm.tm_year = year;
3604 mytm.tm_wday = wday;
3605 mytm.tm_yday = yday;
3606 mytm.tm_isdst = isdst;
3609 New(0, buf, buflen, char);
3610 len = strftime(buf, buflen, fmt, &mytm);
3612 ** The following is needed to handle to the situation where
3613 ** tmpbuf overflows. Basically we want to allocate a buffer
3614 ** and try repeatedly. The reason why it is so complicated
3615 ** is that getting a return value of 0 from strftime can indicate
3616 ** one of the following:
3617 ** 1. buffer overflowed,
3618 ** 2. illegal conversion specifier, or
3619 ** 3. the format string specifies nothing to be returned(not
3620 ** an error). This could be because format is an empty string
3621 ** or it specifies %p that yields an empty string in some locale.
3622 ** If there is a better way to make it portable, go ahead by
3625 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3628 /* Possibly buf overflowed - try again with a bigger buf */
3629 int fmtlen = strlen(fmt);
3630 int bufsize = fmtlen + buflen;
3632 New(0, buf, bufsize, char);
3634 buflen = strftime(buf, bufsize, fmt, &mytm);
3635 if (buflen > 0 && buflen < bufsize)
3637 /* heuristic to prevent out-of-memory errors */
3638 if (bufsize > 100*fmtlen) {
3644 Renew(buf, bufsize, char);
3649 Perl_croak(aTHX_ "panic: no strftime");
3654 #define SV_CWD_RETURN_UNDEF \
3655 sv_setsv(sv, &PL_sv_undef); \
3658 #define SV_CWD_ISDOT(dp) \
3659 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3660 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3663 =for apidoc getcwd_sv
3665 Fill the sv with current working directory
3670 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3671 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3672 * getcwd(3) if available
3673 * Comments from the orignal:
3674 * This is a faster version of getcwd. It's also more dangerous
3675 * because you might chdir out of a directory that you can't chdir
3679 Perl_getcwd_sv(pTHX_ register SV *sv)
3685 char buf[MAXPATHLEN];
3687 /* Some getcwd()s automatically allocate a buffer of the given
3688 * size from the heap if they are given a NULL buffer pointer.
3689 * The problem is that this behaviour is not portable. */
3690 if (getcwd(buf, sizeof(buf) - 1)) {
3691 STRLEN len = strlen(buf);
3692 sv_setpvn(sv, buf, len);
3696 sv_setsv(sv, &PL_sv_undef);
3703 struct stat statbuf;
3704 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3705 int namelen, pathlen=0;
3709 (void)SvUPGRADE(sv, SVt_PV);
3711 if (PerlLIO_lstat(".", &statbuf) < 0) {
3712 SV_CWD_RETURN_UNDEF;
3715 orig_cdev = statbuf.st_dev;
3716 orig_cino = statbuf.st_ino;
3724 if (PerlDir_chdir("..") < 0) {
3725 SV_CWD_RETURN_UNDEF;
3727 if (PerlLIO_stat(".", &statbuf) < 0) {
3728 SV_CWD_RETURN_UNDEF;
3731 cdev = statbuf.st_dev;
3732 cino = statbuf.st_ino;
3734 if (odev == cdev && oino == cino) {
3737 if (!(dir = PerlDir_open("."))) {
3738 SV_CWD_RETURN_UNDEF;
3741 while ((dp = PerlDir_read(dir)) != NULL) {
3743 namelen = dp->d_namlen;
3745 namelen = strlen(dp->d_name);
3748 if (SV_CWD_ISDOT(dp)) {
3752 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3753 SV_CWD_RETURN_UNDEF;
3756 tdev = statbuf.st_dev;
3757 tino = statbuf.st_ino;
3758 if (tino == oino && tdev == odev) {
3764 SV_CWD_RETURN_UNDEF;
3767 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3768 SV_CWD_RETURN_UNDEF;
3771 SvGROW(sv, pathlen + namelen + 1);
3775 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3778 /* prepend current directory to the front */
3780 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3781 pathlen += (namelen + 1);
3783 #ifdef VOID_CLOSEDIR
3786 if (PerlDir_close(dir) < 0) {
3787 SV_CWD_RETURN_UNDEF;
3793 SvCUR_set(sv, pathlen);
3797 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3798 SV_CWD_RETURN_UNDEF;
3801 if (PerlLIO_stat(".", &statbuf) < 0) {
3802 SV_CWD_RETURN_UNDEF;
3805 cdev = statbuf.st_dev;
3806 cino = statbuf.st_ino;
3808 if (cdev != orig_cdev || cino != orig_cino) {
3809 Perl_croak(aTHX_ "Unstable directory path, "
3810 "current directory changed unexpectedly");