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)
30 # include <sys/wait.h>
37 long xcount[MAXXCOUNT];
38 long lastxcount[MAXXCOUNT];
39 long xycount[MAXXCOUNT][MAXYCOUNT];
40 long lastxycount[MAXXCOUNT][MAXYCOUNT];
44 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
45 # define FD_CLOEXEC 1 /* NeXT needs this */
48 /* NOTE: Do not call the next three routines directly. Use the macros
49 * in handy.h, so that we can easily redefine everything to do tracking of
50 * allocated hunks back to the original New to track down any memory leaks.
51 * XXX This advice seems to be widely ignored :-( --AD August 1996.
54 /* paranoid version of system's malloc() */
57 Perl_safesysmalloc(MEM_SIZE size)
63 PerlIO_printf(Perl_error_log,
64 "Allocation too large: %lx\n", size) FLUSH;
67 #endif /* HAS_64K_LIMIT */
70 Perl_croak_nocontext("panic: malloc");
72 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
73 PERL_ALLOC_CHECK(ptr);
74 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
80 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
87 /* paranoid version of system's realloc() */
90 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
94 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
95 Malloc_t PerlMem_realloc();
96 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
100 PerlIO_printf(Perl_error_log,
101 "Reallocation too large: %lx\n", size) FLUSH;
104 #endif /* HAS_64K_LIMIT */
111 return safesysmalloc(size);
114 Perl_croak_nocontext("panic: realloc");
116 ptr = (Malloc_t)PerlMem_realloc(where,size);
117 PERL_ALLOC_CHECK(ptr);
119 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
120 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
127 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
134 /* safe version of system's free() */
137 Perl_safesysfree(Malloc_t where)
139 #ifdef PERL_IMPLICIT_SYS
142 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
149 /* safe version of system's calloc() */
152 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
158 if (size * count > 0xffff) {
159 PerlIO_printf(Perl_error_log,
160 "Allocation too large: %lx\n", size * count) FLUSH;
163 #endif /* HAS_64K_LIMIT */
165 if ((long)size < 0 || (long)count < 0)
166 Perl_croak_nocontext("panic: calloc");
169 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
170 PERL_ALLOC_CHECK(ptr);
171 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));
173 memset((void*)ptr, 0, size);
179 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
188 struct mem_test_strut {
196 # define ALIGN sizeof(struct mem_test_strut)
198 # define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
199 # define typeof_chunk(ch) \
200 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
201 # define set_typeof_chunk(ch,t) \
202 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
203 #define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
206 ? ((size) - 1)/8 + 5 \
210 Perl_safexmalloc(I32 x, MEM_SIZE size)
212 register char* where = (char*)safemalloc(size + ALIGN);
215 xycount[x][SIZE_TO_Y(size)]++;
216 set_typeof_chunk(where, x);
217 sizeof_chunk(where) = size;
218 return (Malloc_t)(where + ALIGN);
222 Perl_safexrealloc(Malloc_t wh, MEM_SIZE size)
224 char *where = (char*)wh;
227 return safexmalloc(0,size);
230 MEM_SIZE old = sizeof_chunk(where - ALIGN);
231 int t = typeof_chunk(where - ALIGN);
232 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
234 xycount[t][SIZE_TO_Y(old)]--;
235 xycount[t][SIZE_TO_Y(size)]++;
236 xcount[t] += size - old;
237 sizeof_chunk(new) = size;
238 return (Malloc_t)(new + ALIGN);
243 Perl_safexfree(Malloc_t wh)
246 char *where = (char*)wh;
252 size = sizeof_chunk(where);
253 x = where[0] + 100 * where[1];
255 xycount[x][SIZE_TO_Y(size)]--;
260 Perl_safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
262 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
264 xycount[x][SIZE_TO_Y(size)]++;
265 memset((void*)(where + ALIGN), 0, size * count);
266 set_typeof_chunk(where, x);
267 sizeof_chunk(where) = size;
268 return (Malloc_t)(where + ALIGN);
272 S_xstat(pTHX_ int flag)
274 register I32 i, j, total = 0;
275 I32 subtot[MAXYCOUNT];
277 for (j = 0; j < MAXYCOUNT; j++) {
281 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);
282 for (i = 0; i < MAXXCOUNT; i++) {
284 for (j = 0; j < MAXYCOUNT; j++) {
285 subtot[j] += xycount[i][j];
288 ? xcount[i] /* Have something */
290 ? xcount[i] != lastxcount[i] /* Changed */
291 : xcount[i] > lastxcount[i])) { /* Growed */
292 PerlIO_printf(Perl_debug_log,"%2d %02d %7ld ", i / 100, i % 100,
293 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
294 lastxcount[i] = xcount[i];
295 for (j = 0; j < MAXYCOUNT; j++) {
297 ? xycount[i][j] /* Have something */
299 ? xycount[i][j] != lastxycount[i][j] /* Changed */
300 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
301 PerlIO_printf(Perl_debug_log,"%3ld ",
303 ? xycount[i][j] - lastxycount[i][j]
305 lastxycount[i][j] = xycount[i][j];
307 PerlIO_printf(Perl_debug_log, " . ", xycount[i][j]);
310 PerlIO_printf(Perl_debug_log, "\n");
314 PerlIO_printf(Perl_debug_log, "Total %7ld ", total);
315 for (j = 0; j < MAXYCOUNT; j++) {
317 PerlIO_printf(Perl_debug_log, "%3ld ", subtot[j]);
319 PerlIO_printf(Perl_debug_log, " . ");
322 PerlIO_printf(Perl_debug_log, "\n");
326 #endif /* LEAKTEST */
328 /* These must be defined when not using Perl's malloc for binary
333 Malloc_t Perl_malloc (MEM_SIZE nbytes)
336 return PerlMem_malloc(nbytes);
339 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
342 return PerlMem_calloc(elements, size);
345 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
348 return PerlMem_realloc(where, nbytes);
351 Free_t Perl_mfree (Malloc_t where)
359 /* copy a string up to some (non-backslashed) delimiter, if any */
362 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
365 for (tolen = 0; from < fromend; from++, tolen++) {
367 if (from[1] == delim)
376 else if (*from == delim)
387 /* return ptr to little string in big string, NULL if not found */
388 /* This routine was donated by Corey Satten. */
391 Perl_instr(pTHX_ register const char *big, register const char *little)
393 register const char *s, *x;
404 for (x=big,s=little; *s; /**/ ) {
413 return (char*)(big-1);
418 /* same as instr but allow embedded nulls */
421 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
423 register const char *s, *x;
424 register I32 first = *little;
425 register const char *littleend = lend;
427 if (!first && little >= littleend)
429 if (bigend - big < littleend - little)
431 bigend -= littleend - little++;
432 while (big <= bigend) {
435 for (x=big,s=little; s < littleend; /**/ ) {
442 return (char*)(big-1);
447 /* reverse of the above--find last substring */
450 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
452 register const char *bigbeg;
453 register const char *s, *x;
454 register I32 first = *little;
455 register const char *littleend = lend;
457 if (!first && little >= littleend)
458 return (char*)bigend;
460 big = bigend - (littleend - little++);
461 while (big >= bigbeg) {
464 for (x=big+2,s=little; s < littleend; /**/ ) {
471 return (char*)(big+1);
476 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
478 /* As a space optimization, we do not compile tables for strings of length
479 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
480 special-cased in fbm_instr().
482 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
485 =for apidoc fbm_compile
487 Analyses the string in order to make fast searches on it using fbm_instr()
488 -- the Boyer-Moore algorithm.
494 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
503 if (flags & FBMcf_TAIL)
504 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
505 s = (U8*)SvPV_force(sv, len);
506 (void)SvUPGRADE(sv, SVt_PVBM);
507 if (len == 0) /* TAIL might be on a zero-length string. */
517 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
518 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
519 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
520 memset((void*)table, mlen, 256);
521 table[-1] = (U8)flags;
523 sb = s - mlen + 1; /* first char (maybe) */
525 if (table[*s] == mlen)
530 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
533 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
534 for (i = 0; i < len; i++) {
535 if (PL_freq[s[i]] < frequency) {
537 frequency = PL_freq[s[i]];
540 BmRARE(sv) = s[rarest];
541 BmPREVIOUS(sv) = rarest;
542 BmUSEFUL(sv) = 100; /* Initial value */
543 if (flags & FBMcf_TAIL)
545 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
546 BmRARE(sv),BmPREVIOUS(sv)));
549 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
550 /* If SvTAIL is actually due to \Z or \z, this gives false positives
554 =for apidoc fbm_instr
556 Returns the location of the SV in the string delimited by C<str> and
557 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
558 does not have to be fbm_compiled, but the search will not be as fast
565 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
567 register unsigned char *s;
569 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
570 register STRLEN littlelen = l;
571 register I32 multiline = flags & FBMrf_MULTILINE;
573 if (bigend - big < littlelen) {
574 if ( SvTAIL(littlestr)
575 && (bigend - big == littlelen - 1)
577 || (*big == *little &&
578 memEQ((char *)big, (char *)little, littlelen - 1))))
583 if (littlelen <= 2) { /* Special-cased */
585 if (littlelen == 1) {
586 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
587 /* Know that bigend != big. */
588 if (bigend[-1] == '\n')
589 return (char *)(bigend - 1);
590 return (char *) bigend;
598 if (SvTAIL(littlestr))
599 return (char *) bigend;
603 return (char*)big; /* Cannot be SvTAIL! */
606 if (SvTAIL(littlestr) && !multiline) {
607 if (bigend[-1] == '\n' && bigend[-2] == *little)
608 return (char*)bigend - 2;
609 if (bigend[-1] == *little)
610 return (char*)bigend - 1;
614 /* This should be better than FBM if c1 == c2, and almost
615 as good otherwise: maybe better since we do less indirection.
616 And we save a lot of memory by caching no table. */
617 register unsigned char c1 = little[0];
618 register unsigned char c2 = little[1];
623 while (s <= bigend) {
633 goto check_1char_anchor;
644 goto check_1char_anchor;
647 while (s <= bigend) {
652 goto check_1char_anchor;
661 check_1char_anchor: /* One char and anchor! */
662 if (SvTAIL(littlestr) && (*bigend == *little))
663 return (char *)bigend; /* bigend is already decremented. */
666 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
667 s = bigend - littlelen;
668 if (s >= big && bigend[-1] == '\n' && *s == *little
669 /* Automatically of length > 2 */
670 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
672 return (char*)s; /* how sweet it is */
675 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
677 return (char*)s + 1; /* how sweet it is */
681 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
682 char *b = ninstr((char*)big,(char*)bigend,
683 (char*)little, (char*)little + littlelen);
685 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
686 /* Chop \n from littlestr: */
687 s = bigend - littlelen + 1;
689 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
698 { /* Do actual FBM. */
699 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
700 register unsigned char *oldlittle;
702 if (littlelen > bigend - big)
704 --littlelen; /* Last char found by table lookup */
707 little += littlelen; /* last char */
714 if ((tmp = table[*s])) {
715 if ((s += tmp) < bigend)
719 else { /* less expensive than calling strncmp() */
720 register unsigned char *olds = s;
725 if (*--s == *--little)
727 s = olds + 1; /* here we pay the price for failure */
729 if (s < bigend) /* fake up continue to outer loop */
737 if ( s == bigend && (table[-1] & FBMcf_TAIL)
738 && memEQ((char *)(bigend - littlelen),
739 (char *)(oldlittle - littlelen), littlelen) )
740 return (char*)bigend - littlelen;
745 /* start_shift, end_shift are positive quantities which give offsets
746 of ends of some substring of bigstr.
747 If `last' we want the last occurence.
748 old_posp is the way of communication between consequent calls if
749 the next call needs to find the .
750 The initial *old_posp should be -1.
752 Note that we take into account SvTAIL, so one can get extra
753 optimizations if _ALL flag is set.
756 /* If SvTAIL is actually due to \Z or \z, this gives false positives
757 if PL_multiline. In fact if !PL_multiline the authoritative answer
758 is not supported yet. */
761 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
763 register unsigned char *s, *x;
764 register unsigned char *big;
766 register I32 previous;
768 register unsigned char *little;
769 register I32 stop_pos;
770 register unsigned char *littleend;
774 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
775 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
777 if ( BmRARE(littlestr) == '\n'
778 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
779 little = (unsigned char *)(SvPVX(littlestr));
780 littleend = little + SvCUR(littlestr);
787 little = (unsigned char *)(SvPVX(littlestr));
788 littleend = little + SvCUR(littlestr);
790 /* The value of pos we can start at: */
791 previous = BmPREVIOUS(littlestr);
792 big = (unsigned char *)(SvPVX(bigstr));
793 /* The value of pos we can stop at: */
794 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
795 if (previous + start_shift > stop_pos) {
797 stop_pos does not include SvTAIL in the count, so this check is incorrect
798 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
801 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
806 while (pos < previous + start_shift) {
807 if (!(pos += PL_screamnext[pos]))
812 if (pos >= stop_pos) break;
813 if (big[pos] != first)
815 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
821 if (s == littleend) {
823 if (!last) return (char *)(big+pos);
826 } while ( pos += PL_screamnext[pos] );
828 return (char *)(big+(*old_posp));
830 if (!SvTAIL(littlestr) || (end_shift > 0))
832 /* Ignore the trailing "\n". This code is not microoptimized */
833 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
834 stop_pos = littleend - little; /* Actual littlestr len */
839 && ((stop_pos == 1) ||
840 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
846 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
848 register U8 *a = (U8 *)s1;
849 register U8 *b = (U8 *)s2;
851 if (*a != *b && *a != PL_fold[*b])
859 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
861 register U8 *a = (U8 *)s1;
862 register U8 *b = (U8 *)s2;
864 if (*a != *b && *a != PL_fold_locale[*b])
871 /* copy a string to a safe spot */
876 Copy a string to a safe spot. This does not use an SV.
882 Perl_savepv(pTHX_ const char *sv)
884 register char *newaddr;
886 New(902,newaddr,strlen(sv)+1,char);
887 (void)strcpy(newaddr,sv);
891 /* same thing but with a known length */
896 Copy a string to a safe spot. The C<len> indicates number of bytes to
897 copy. This does not use an SV.
903 Perl_savepvn(pTHX_ const char *sv, register I32 len)
905 register char *newaddr;
907 New(903,newaddr,len+1,char);
908 Copy(sv,newaddr,len,char); /* might not be null terminated */
909 newaddr[len] = '\0'; /* is now */
913 /* the SV for Perl_form() and mess() is not kept in an arena */
922 return sv_2mortal(newSVpvn("",0));
927 /* Create as PVMG now, to avoid any upgrading later */
929 Newz(905, any, 1, XPVMG);
930 SvFLAGS(sv) = SVt_PVMG;
931 SvANY(sv) = (void*)any;
932 SvREFCNT(sv) = 1 << 30; /* practically infinite */
937 #if defined(PERL_IMPLICIT_CONTEXT)
939 Perl_form_nocontext(const char* pat, ...)
945 retval = vform(pat, &args);
949 #endif /* PERL_IMPLICIT_CONTEXT */
954 Takes a sprintf-style format pattern and conventional
955 (non-SV) arguments and returns the formatted string.
957 (char *) Perl_form(pTHX_ const char* pat, ...)
959 can be used any place a string (char *) is required:
961 char * s = Perl_form("%d.%d",major,minor);
963 Uses a single private buffer so if you want to format several strings you
964 must explicitly copy the earlier strings away (and free the copies when you
971 Perl_form(pTHX_ const char* pat, ...)
976 retval = vform(pat, &args);
982 Perl_vform(pTHX_ const char *pat, va_list *args)
984 SV *sv = mess_alloc();
985 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
989 #if defined(PERL_IMPLICIT_CONTEXT)
991 Perl_mess_nocontext(const char *pat, ...)
997 retval = vmess(pat, &args);
1001 #endif /* PERL_IMPLICIT_CONTEXT */
1004 Perl_mess(pTHX_ const char *pat, ...)
1008 va_start(args, pat);
1009 retval = vmess(pat, &args);
1015 S_closest_cop(pTHX_ COP *cop, OP *o)
1017 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1019 if (!o || o == PL_op) return cop;
1021 if (o->op_flags & OPf_KIDS) {
1023 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1027 /* If the OP_NEXTSTATE has been optimised away we can still use it
1028 * the get the file and line number. */
1030 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1033 /* Keep searching, and return when we've found something. */
1035 new_cop = closest_cop(cop, kid);
1036 if (new_cop) return new_cop;
1040 /* Nothing found. */
1046 Perl_vmess(pTHX_ const char *pat, va_list *args)
1048 SV *sv = mess_alloc();
1049 static char dgd[] = " during global destruction.\n";
1052 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1053 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1056 * Try and find the file and line for PL_op. This will usually be
1057 * PL_curcop, but it might be a cop that has been optimised away. We
1058 * can try to find such a cop by searching through the optree starting
1059 * from the sibling of PL_curcop.
1062 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1063 if (!cop) cop = PL_curcop;
1066 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1067 CopFILE(cop), (IV)CopLINE(cop));
1068 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1069 bool line_mode = (RsSIMPLE(PL_rs) &&
1070 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1071 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1072 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1073 line_mode ? "line" : "chunk",
1074 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1076 #ifdef USE_5005THREADS
1078 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
1080 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1086 Perl_vdie(pTHX_ const char* pat, va_list *args)
1089 int was_in_eval = PL_in_eval;
1096 DEBUG_S(PerlIO_printf(Perl_debug_log,
1097 "%p: die: curstack = %p, mainstack = %p\n",
1098 thr, PL_curstack, PL_mainstack));
1101 msv = vmess(pat, args);
1102 if (PL_errors && SvCUR(PL_errors)) {
1103 sv_catsv(PL_errors, msv);
1104 message = SvPV(PL_errors, msglen);
1105 SvCUR_set(PL_errors, 0);
1108 message = SvPV(msv,msglen);
1115 DEBUG_S(PerlIO_printf(Perl_debug_log,
1116 "%p: die: message = %s\ndiehook = %p\n",
1117 thr, message, PL_diehook));
1119 /* sv_2cv might call Perl_croak() */
1120 SV *olddiehook = PL_diehook;
1122 SAVESPTR(PL_diehook);
1123 PL_diehook = Nullsv;
1124 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1126 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1133 msg = newSVpvn(message, msglen);
1141 PUSHSTACKi(PERLSI_DIEHOOK);
1145 call_sv((SV*)cv, G_DISCARD);
1151 PL_restartop = die_where(message, msglen);
1152 DEBUG_S(PerlIO_printf(Perl_debug_log,
1153 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1154 thr, PL_restartop, was_in_eval, PL_top_env));
1155 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1157 return PL_restartop;
1160 #if defined(PERL_IMPLICIT_CONTEXT)
1162 Perl_die_nocontext(const char* pat, ...)
1167 va_start(args, pat);
1168 o = vdie(pat, &args);
1172 #endif /* PERL_IMPLICIT_CONTEXT */
1175 Perl_die(pTHX_ const char* pat, ...)
1179 va_start(args, pat);
1180 o = vdie(pat, &args);
1186 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1196 msv = vmess(pat, args);
1197 if (PL_errors && SvCUR(PL_errors)) {
1198 sv_catsv(PL_errors, msv);
1199 message = SvPV(PL_errors, msglen);
1200 SvCUR_set(PL_errors, 0);
1203 message = SvPV(msv,msglen);
1210 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1211 PTR2UV(thr), message));
1214 /* sv_2cv might call Perl_croak() */
1215 SV *olddiehook = PL_diehook;
1217 SAVESPTR(PL_diehook);
1218 PL_diehook = Nullsv;
1219 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1221 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1228 msg = newSVpvn(message, msglen);
1236 PUSHSTACKi(PERLSI_DIEHOOK);
1240 call_sv((SV*)cv, G_DISCARD);
1246 PL_restartop = die_where(message, msglen);
1250 message = SvPVx(ERRSV, msglen);
1254 /* SFIO can really mess with your errno */
1257 PerlIO *serr = Perl_error_log;
1259 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1260 (void)PerlIO_flush(serr);
1268 #if defined(PERL_IMPLICIT_CONTEXT)
1270 Perl_croak_nocontext(const char *pat, ...)
1274 va_start(args, pat);
1279 #endif /* PERL_IMPLICIT_CONTEXT */
1284 This is the XSUB-writer's interface to Perl's C<die> function.
1285 Normally use this function the same way you use the C C<printf>
1286 function. See C<warn>.
1288 If you want to throw an exception object, assign the object to
1289 C<$@> and then pass C<Nullch> to croak():
1291 errsv = get_sv("@", TRUE);
1292 sv_setsv(errsv, exception_object);
1299 Perl_croak(pTHX_ const char *pat, ...)
1302 va_start(args, pat);
1309 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1318 msv = vmess(pat, args);
1319 message = SvPV(msv, msglen);
1322 /* sv_2cv might call Perl_warn() */
1323 SV *oldwarnhook = PL_warnhook;
1325 SAVESPTR(PL_warnhook);
1326 PL_warnhook = Nullsv;
1327 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1329 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1335 msg = newSVpvn(message, msglen);
1339 PUSHSTACKi(PERLSI_WARNHOOK);
1343 call_sv((SV*)cv, G_DISCARD);
1350 PerlIO *serr = Perl_error_log;
1352 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1354 DEBUG_L(*message == '!'
1355 ? (xstat(message[1]=='!'
1356 ? (message[2]=='!' ? 2 : 1)
1361 (void)PerlIO_flush(serr);
1365 #if defined(PERL_IMPLICIT_CONTEXT)
1367 Perl_warn_nocontext(const char *pat, ...)
1371 va_start(args, pat);
1375 #endif /* PERL_IMPLICIT_CONTEXT */
1380 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
1381 function the same way you use the C C<printf> function. See
1388 Perl_warn(pTHX_ const char *pat, ...)
1391 va_start(args, pat);
1396 #if defined(PERL_IMPLICIT_CONTEXT)
1398 Perl_warner_nocontext(U32 err, const char *pat, ...)
1402 va_start(args, pat);
1403 vwarner(err, pat, &args);
1406 #endif /* PERL_IMPLICIT_CONTEXT */
1409 Perl_warner(pTHX_ U32 err, const char* pat,...)
1412 va_start(args, pat);
1413 vwarner(err, pat, &args);
1418 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1427 msv = vmess(pat, args);
1428 message = SvPV(msv, msglen);
1431 #ifdef USE_5005THREADS
1432 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s", PTR2UV(thr), message));
1433 #endif /* USE_5005THREADS */
1435 /* sv_2cv might call Perl_croak() */
1436 SV *olddiehook = PL_diehook;
1438 SAVESPTR(PL_diehook);
1439 PL_diehook = Nullsv;
1440 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1442 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1448 msg = newSVpvn(message, msglen);
1452 PUSHSTACKi(PERLSI_DIEHOOK);
1456 call_sv((SV*)cv, G_DISCARD);
1462 PL_restartop = die_where(message, msglen);
1466 PerlIO *serr = Perl_error_log;
1467 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1468 (void)PerlIO_flush(serr);
1475 /* sv_2cv might call Perl_warn() */
1476 SV *oldwarnhook = PL_warnhook;
1478 SAVESPTR(PL_warnhook);
1479 PL_warnhook = Nullsv;
1480 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1482 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1488 msg = newSVpvn(message, msglen);
1492 PUSHSTACKi(PERLSI_WARNHOOK);
1496 call_sv((SV*)cv, G_DISCARD);
1503 PerlIO *serr = Perl_error_log;
1504 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1506 DEBUG_L(*message == '!'
1507 ? (xstat(message[1]=='!'
1508 ? (message[2]=='!' ? 2 : 1)
1513 (void)PerlIO_flush(serr);
1518 /* since we've already done strlen() for both nam and val
1519 * we can use that info to make things faster than
1520 * sprintf(s, "%s=%s", nam, val)
1522 #define my_setenv_format(s, nam, nlen, val, vlen) \
1523 Copy(nam, s, nlen, char); \
1525 Copy(val, s+(nlen+1), vlen, char); \
1526 *(s+(nlen+1+vlen)) = '\0'
1528 #ifdef USE_ENVIRON_ARRAY
1529 /* VMS' and EPOC's my_setenv() is in vms.c and epoc.c */
1530 #if !defined(WIN32) && !defined(NETWARE)
1532 Perl_my_setenv(pTHX_ char *nam, char *val)
1534 #ifndef PERL_USE_SAFE_PUTENV
1535 /* most putenv()s leak, so we manipulate environ directly */
1536 register I32 i=setenv_getix(nam); /* where does it go? */
1539 if (environ == PL_origenviron) { /* need we copy environment? */
1545 for (max = i; environ[max]; max++) ;
1546 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1547 for (j=0; j<max; j++) { /* copy environment */
1548 int len = strlen(environ[j]);
1549 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1550 Copy(environ[j], tmpenv[j], len+1, char);
1552 tmpenv[max] = Nullch;
1553 environ = tmpenv; /* tell exec where it is now */
1556 safesysfree(environ[i]);
1557 while (environ[i]) {
1558 environ[i] = environ[i+1];
1563 if (!environ[i]) { /* does not exist yet */
1564 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1565 environ[i+1] = Nullch; /* make sure it's null terminated */
1568 safesysfree(environ[i]);
1572 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1573 /* all that work just for this */
1574 my_setenv_format(environ[i], nam, nlen, val, vlen);
1576 #else /* PERL_USE_SAFE_PUTENV */
1577 # if defined(__CYGWIN__)
1578 setenv(nam, val, 1);
1581 int nlen = strlen(nam), vlen;
1586 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1587 /* all that work just for this */
1588 my_setenv_format(new_env, nam, nlen, val, vlen);
1589 (void)putenv(new_env);
1590 # endif /* __CYGWIN__ */
1591 #endif /* PERL_USE_SAFE_PUTENV */
1594 #else /* WIN32 || NETWARE */
1597 Perl_my_setenv(pTHX_ char *nam,char *val)
1599 register char *envstr;
1600 int nlen = strlen(nam), vlen;
1606 New(904, envstr, nlen+vlen+2, char);
1607 my_setenv_format(envstr, nam, nlen, val, vlen);
1608 (void)PerlEnv_putenv(envstr);
1612 #endif /* WIN32 || NETWARE */
1615 Perl_setenv_getix(pTHX_ char *nam)
1617 register I32 i, len = strlen(nam);
1619 for (i = 0; environ[i]; i++) {
1622 strnicmp(environ[i],nam,len) == 0
1624 strnEQ(environ[i],nam,len)
1626 && environ[i][len] == '=')
1627 break; /* strnEQ must come first to avoid */
1628 } /* potential SEGV's */
1632 #endif /* !VMS && !EPOC*/
1634 #ifdef UNLINK_ALL_VERSIONS
1636 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1640 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1645 /* this is a drop-in replacement for bcopy() */
1646 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1648 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1652 if (from - to >= 0) {
1660 *(--to) = *(--from);
1666 /* this is a drop-in replacement for memset() */
1669 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1679 /* this is a drop-in replacement for bzero() */
1680 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1682 Perl_my_bzero(register char *loc, register I32 len)
1692 /* this is a drop-in replacement for memcmp() */
1693 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1695 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1697 register U8 *a = (U8 *)s1;
1698 register U8 *b = (U8 *)s2;
1702 if (tmp = *a++ - *b++)
1707 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1711 #ifdef USE_CHAR_VSPRINTF
1716 vsprintf(char *dest, const char *pat, char *args)
1720 fakebuf._ptr = dest;
1721 fakebuf._cnt = 32767;
1725 fakebuf._flag = _IOWRT|_IOSTRG;
1726 _doprnt(pat, args, &fakebuf); /* what a kludge */
1727 (void)putc('\0', &fakebuf);
1728 #ifdef USE_CHAR_VSPRINTF
1731 return 0; /* perl doesn't use return value */
1735 #endif /* HAS_VPRINTF */
1738 #if BYTEORDER != 0x4321
1740 Perl_my_swap(pTHX_ short s)
1742 #if (BYTEORDER & 1) == 0
1745 result = ((s & 255) << 8) + ((s >> 8) & 255);
1753 Perl_my_htonl(pTHX_ long l)
1757 char c[sizeof(long)];
1760 #if BYTEORDER == 0x1234
1761 u.c[0] = (l >> 24) & 255;
1762 u.c[1] = (l >> 16) & 255;
1763 u.c[2] = (l >> 8) & 255;
1767 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1768 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1773 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1774 u.c[o & 0xf] = (l >> s) & 255;
1782 Perl_my_ntohl(pTHX_ long l)
1786 char c[sizeof(long)];
1789 #if BYTEORDER == 0x1234
1790 u.c[0] = (l >> 24) & 255;
1791 u.c[1] = (l >> 16) & 255;
1792 u.c[2] = (l >> 8) & 255;
1796 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1797 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1804 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1805 l |= (u.c[o & 0xf] & 255) << s;
1812 #endif /* BYTEORDER != 0x4321 */
1816 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1817 * If these functions are defined,
1818 * the BYTEORDER is neither 0x1234 nor 0x4321.
1819 * However, this is not assumed.
1823 #define HTOV(name,type) \
1825 name (register type n) \
1829 char c[sizeof(type)]; \
1833 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1834 u.c[i] = (n >> s) & 0xFF; \
1839 #define VTOH(name,type) \
1841 name (register type n) \
1845 char c[sizeof(type)]; \
1851 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1852 n += (u.c[i] & 0xFF) << s; \
1857 #if defined(HAS_HTOVS) && !defined(htovs)
1860 #if defined(HAS_HTOVL) && !defined(htovl)
1863 #if defined(HAS_VTOHS) && !defined(vtohs)
1866 #if defined(HAS_VTOHL) && !defined(vtohl)
1871 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1873 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1875 register I32 This, that;
1881 PERL_FLUSHALL_FOR_CHILD;
1882 This = (*mode == 'w');
1886 taint_proper("Insecure %s%s", "EXEC");
1888 if (PerlProc_pipe(p) < 0)
1890 /* Try for another pipe pair for error return */
1891 if (PerlProc_pipe(pp) >= 0)
1893 while ((pid = PerlProc_fork()) < 0) {
1894 if (errno != EAGAIN) {
1895 PerlLIO_close(p[This]);
1897 PerlLIO_close(pp[0]);
1898 PerlLIO_close(pp[1]);
1910 /* Close parent's end of _the_ pipe */
1911 PerlLIO_close(p[THAT]);
1912 /* Close parent's end of error status pipe (if any) */
1914 PerlLIO_close(pp[0]);
1915 #if defined(HAS_FCNTL) && defined(F_SETFD)
1916 /* Close error pipe automatically if exec works */
1917 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1920 /* Now dup our end of _the_ pipe to right position */
1921 if (p[THIS] != (*mode == 'r')) {
1922 PerlLIO_dup2(p[THIS], *mode == 'r');
1923 PerlLIO_close(p[THIS]);
1925 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1926 /* No automatic close - do it by hand */
1933 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1939 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1945 do_execfree(); /* free any memory malloced by child on fork */
1946 /* Close child's end of pipe */
1947 PerlLIO_close(p[that]);
1949 PerlLIO_close(pp[1]);
1950 /* Keep the lower of the two fd numbers */
1951 if (p[that] < p[This]) {
1952 PerlLIO_dup2(p[This], p[that]);
1953 PerlLIO_close(p[This]);
1957 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1959 (void)SvUPGRADE(sv,SVt_IV);
1961 PL_forkprocess = pid;
1962 /* If we managed to get status pipe check for exec fail */
1963 if (did_pipes && pid > 0) {
1967 while (n < sizeof(int)) {
1968 n1 = PerlLIO_read(pp[0],
1969 (void*)(((char*)&errkid)+n),
1975 PerlLIO_close(pp[0]);
1977 if (n) { /* Error */
1979 PerlLIO_close(p[This]);
1980 if (n != sizeof(int))
1981 Perl_croak(aTHX_ "panic: kid popen errno read");
1983 pid2 = wait4pid(pid, &status, 0);
1984 } while (pid2 == -1 && errno == EINTR);
1985 errno = errkid; /* Propagate errno from kid */
1990 PerlLIO_close(pp[0]);
1991 return PerlIO_fdopen(p[This], mode);
1993 Perl_croak(aTHX_ "List form of piped open not implemented");
1994 return (PerlIO *) NULL;
1998 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1999 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2001 Perl_my_popen(pTHX_ char *cmd, char *mode)
2004 register I32 This, that;
2007 I32 doexec = strNE(cmd,"-");
2011 PERL_FLUSHALL_FOR_CHILD;
2014 return my_syspopen(aTHX_ cmd,mode);
2017 This = (*mode == 'w');
2019 if (doexec && PL_tainting) {
2021 taint_proper("Insecure %s%s", "EXEC");
2023 if (PerlProc_pipe(p) < 0)
2025 if (doexec && PerlProc_pipe(pp) >= 0)
2027 while ((pid = PerlProc_fork()) < 0) {
2028 if (errno != EAGAIN) {
2029 PerlLIO_close(p[This]);
2031 PerlLIO_close(pp[0]);
2032 PerlLIO_close(pp[1]);
2035 Perl_croak(aTHX_ "Can't fork");
2047 PerlLIO_close(p[THAT]);
2049 PerlLIO_close(pp[0]);
2050 #if defined(HAS_FCNTL) && defined(F_SETFD)
2051 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2054 if (p[THIS] != (*mode == 'r')) {
2055 PerlLIO_dup2(p[THIS], *mode == 'r');
2056 PerlLIO_close(p[THIS]);
2060 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2069 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2074 /* may or may not use the shell */
2075 do_exec3(cmd, pp[1], did_pipes);
2078 #endif /* defined OS2 */
2080 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2081 SvREADONLY_off(GvSV(tmpgv));
2082 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2083 SvREADONLY_on(GvSV(tmpgv));
2086 hv_clear(PL_pidstatus); /* we have no children */
2091 do_execfree(); /* free any memory malloced by child on fork */
2092 PerlLIO_close(p[that]);
2094 PerlLIO_close(pp[1]);
2095 if (p[that] < p[This]) {
2096 PerlLIO_dup2(p[This], p[that]);
2097 PerlLIO_close(p[This]);
2101 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2103 (void)SvUPGRADE(sv,SVt_IV);
2105 PL_forkprocess = pid;
2106 if (did_pipes && pid > 0) {
2110 while (n < sizeof(int)) {
2111 n1 = PerlLIO_read(pp[0],
2112 (void*)(((char*)&errkid)+n),
2118 PerlLIO_close(pp[0]);
2120 if (n) { /* Error */
2122 PerlLIO_close(p[This]);
2123 if (n != sizeof(int))
2124 Perl_croak(aTHX_ "panic: kid popen errno read");
2126 pid2 = wait4pid(pid, &status, 0);
2127 } while (pid2 == -1 && errno == EINTR);
2128 errno = errkid; /* Propagate errno from kid */
2133 PerlLIO_close(pp[0]);
2134 return PerlIO_fdopen(p[This], mode);
2137 #if defined(atarist)
2140 Perl_my_popen(pTHX_ char *cmd, char *mode)
2142 PERL_FLUSHALL_FOR_CHILD;
2143 /* Call system's popen() to get a FILE *, then import it.
2144 used 0 for 2nd parameter to PerlIO_importFILE;
2147 return PerlIO_importFILE(popen(cmd, mode), 0);
2151 FILE *djgpp_popen();
2153 Perl_my_popen(pTHX_ char *cmd, char *mode)
2155 PERL_FLUSHALL_FOR_CHILD;
2156 /* Call system's popen() to get a FILE *, then import it.
2157 used 0 for 2nd parameter to PerlIO_importFILE;
2160 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2165 #endif /* !DOSISH */
2167 /* this is called in parent before the fork() */
2169 Perl_atfork_lock(void)
2171 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2172 /* locks must be held in locking order (if any) */
2174 MUTEX_LOCK(&PL_malloc_mutex);
2180 /* this is called in both parent and child after the fork() */
2182 Perl_atfork_unlock(void)
2184 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2185 /* locks must be released in same order as in atfork_lock() */
2187 MUTEX_UNLOCK(&PL_malloc_mutex);
2196 #if defined(HAS_FORK)
2198 #if (defined(USE_5005THREADS) || defined(USE_ITHREADS)) && !defined(HAS_PTHREAD_ATFORK)
2203 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2204 * handlers elsewhere in the code */
2209 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2210 Perl_croak_nocontext("fork() not available");
2212 #endif /* HAS_FORK */
2217 Perl_dump_fds(pTHX_ char *s)
2220 struct stat tmpstatbuf;
2222 PerlIO_printf(Perl_debug_log,"%s", s);
2223 for (fd = 0; fd < 32; fd++) {
2224 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2225 PerlIO_printf(Perl_debug_log," %d",fd);
2227 PerlIO_printf(Perl_debug_log,"\n");
2229 #endif /* DUMP_FDS */
2233 dup2(int oldfd, int newfd)
2235 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2238 PerlLIO_close(newfd);
2239 return fcntl(oldfd, F_DUPFD, newfd);
2241 #define DUP2_MAX_FDS 256
2242 int fdtmp[DUP2_MAX_FDS];
2248 PerlLIO_close(newfd);
2249 /* good enough for low fd's... */
2250 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2251 if (fdx >= DUP2_MAX_FDS) {
2259 PerlLIO_close(fdtmp[--fdx]);
2266 #ifdef HAS_SIGACTION
2269 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2271 struct sigaction act, oact;
2273 act.sa_handler = handler;
2274 sigemptyset(&act.sa_mask);
2277 #if defined(PERL_OLD_SIGNALS)
2278 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2282 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2283 act.sa_flags |= SA_NOCLDWAIT;
2285 if (sigaction(signo, &act, &oact) == -1)
2288 return oact.sa_handler;
2292 Perl_rsignal_state(pTHX_ int signo)
2294 struct sigaction oact;
2296 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2299 return oact.sa_handler;
2303 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2305 struct sigaction act;
2307 act.sa_handler = handler;
2308 sigemptyset(&act.sa_mask);
2311 #if defined(PERL_OLD_SIGNALS)
2312 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2316 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2317 act.sa_flags |= SA_NOCLDWAIT;
2319 return sigaction(signo, &act, save);
2323 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2325 return sigaction(signo, save, (struct sigaction *)NULL);
2328 #else /* !HAS_SIGACTION */
2331 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2333 return PerlProc_signal(signo, handler);
2336 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2337 ignore the implications of this for threading */
2347 Perl_rsignal_state(pTHX_ int signo)
2349 Sighandler_t oldsig;
2352 oldsig = PerlProc_signal(signo, sig_trap);
2353 PerlProc_signal(signo, oldsig);
2355 PerlProc_kill(PerlProc_getpid(), signo);
2360 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2362 *save = PerlProc_signal(signo, handler);
2363 return (*save == SIG_ERR) ? -1 : 0;
2367 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2369 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2372 #endif /* !HAS_SIGACTION */
2373 #endif /* !PERL_MICRO */
2375 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2376 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2378 Perl_my_pclose(pTHX_ PerlIO *ptr)
2380 Sigsave_t hstat, istat, qstat;
2386 int saved_errno = 0;
2388 int saved_vaxc_errno;
2391 int saved_win32_errno;
2395 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2397 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2399 *svp = &PL_sv_undef;
2401 if (pid == -1) { /* Opened by popen. */
2402 return my_syspclose(ptr);
2405 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2406 saved_errno = errno;
2408 saved_vaxc_errno = vaxc$errno;
2411 saved_win32_errno = GetLastError();
2415 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2418 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2419 rsignal_save(SIGINT, SIG_IGN, &istat);
2420 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2423 pid2 = wait4pid(pid, &status, 0);
2424 } while (pid2 == -1 && errno == EINTR);
2426 rsignal_restore(SIGHUP, &hstat);
2427 rsignal_restore(SIGINT, &istat);
2428 rsignal_restore(SIGQUIT, &qstat);
2431 SETERRNO(saved_errno, saved_vaxc_errno);
2434 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2436 #endif /* !DOSISH */
2438 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2440 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2445 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2449 char spid[TYPE_CHARS(int)];
2452 sprintf(spid, "%"IVdf, (IV)pid);
2453 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2454 if (svp && *svp != &PL_sv_undef) {
2455 *statusp = SvIVX(*svp);
2456 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2463 hv_iterinit(PL_pidstatus);
2464 if ((entry = hv_iternext(PL_pidstatus))) {
2465 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2466 sv = hv_iterval(PL_pidstatus,entry);
2467 *statusp = SvIVX(sv);
2468 sprintf(spid, "%"IVdf, (IV)pid);
2469 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2476 # ifdef HAS_WAITPID_RUNTIME
2477 if (!HAS_WAITPID_RUNTIME)
2480 result = PerlProc_waitpid(pid,statusp,flags);
2483 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2484 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2487 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2491 Perl_croak(aTHX_ "Can't do waitpid with flags");
2493 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2494 pidgone(result,*statusp);
2501 if (result < 0 && errno == EINTR) {
2506 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2510 Perl_pidgone(pTHX_ Pid_t pid, int status)
2513 char spid[TYPE_CHARS(int)];
2515 sprintf(spid, "%"IVdf, (IV)pid);
2516 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2517 (void)SvUPGRADE(sv,SVt_IV);
2522 #if defined(atarist) || defined(OS2)
2525 int /* Cannot prototype with I32
2527 my_syspclose(PerlIO *ptr)
2530 Perl_my_pclose(pTHX_ PerlIO *ptr)
2533 /* Needs work for PerlIO ! */
2534 FILE *f = PerlIO_findFILE(ptr);
2535 I32 result = pclose(f);
2536 PerlIO_releaseFILE(ptr,f);
2544 Perl_my_pclose(pTHX_ PerlIO *ptr)
2546 /* Needs work for PerlIO ! */
2547 FILE *f = PerlIO_findFILE(ptr);
2548 I32 result = djgpp_pclose(f);
2549 result = (result << 8) & 0xff00;
2550 PerlIO_releaseFILE(ptr,f);
2556 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2559 register const char *frombase = from;
2562 register const char c = *from;
2567 while (count-- > 0) {
2568 for (todo = len; todo > 0; todo--) {
2577 Perl_same_dirent(pTHX_ char *a, char *b)
2579 char *fa = strrchr(a,'/');
2580 char *fb = strrchr(b,'/');
2581 struct stat tmpstatbuf1;
2582 struct stat tmpstatbuf2;
2583 SV *tmpsv = sv_newmortal();
2596 sv_setpv(tmpsv, ".");
2598 sv_setpvn(tmpsv, a, fa - a);
2599 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2602 sv_setpv(tmpsv, ".");
2604 sv_setpvn(tmpsv, b, fb - b);
2605 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2607 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2608 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2610 #endif /* !HAS_RENAME */
2613 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2615 char *xfound = Nullch;
2616 char *xfailed = Nullch;
2617 char tmpbuf[MAXPATHLEN];
2621 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2622 # define SEARCH_EXTS ".bat", ".cmd", NULL
2623 # define MAX_EXT_LEN 4
2626 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2627 # define MAX_EXT_LEN 4
2630 # define SEARCH_EXTS ".pl", ".com", NULL
2631 # define MAX_EXT_LEN 4
2633 /* additional extensions to try in each dir if scriptname not found */
2635 char *exts[] = { SEARCH_EXTS };
2636 char **ext = search_ext ? search_ext : exts;
2637 int extidx = 0, i = 0;
2638 char *curext = Nullch;
2640 # define MAX_EXT_LEN 0
2644 * If dosearch is true and if scriptname does not contain path
2645 * delimiters, search the PATH for scriptname.
2647 * If SEARCH_EXTS is also defined, will look for each
2648 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2649 * while searching the PATH.
2651 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2652 * proceeds as follows:
2653 * If DOSISH or VMSISH:
2654 * + look for ./scriptname{,.foo,.bar}
2655 * + search the PATH for scriptname{,.foo,.bar}
2658 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2659 * this will not look in '.' if it's not in the PATH)
2664 # ifdef ALWAYS_DEFTYPES
2665 len = strlen(scriptname);
2666 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2667 int hasdir, idx = 0, deftypes = 1;
2670 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2673 int hasdir, idx = 0, deftypes = 1;
2676 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2678 /* The first time through, just add SEARCH_EXTS to whatever we
2679 * already have, so we can check for default file types. */
2681 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2687 if ((strlen(tmpbuf) + strlen(scriptname)
2688 + MAX_EXT_LEN) >= sizeof tmpbuf)
2689 continue; /* don't search dir with too-long name */
2690 strcat(tmpbuf, scriptname);
2694 if (strEQ(scriptname, "-"))
2696 if (dosearch) { /* Look in '.' first. */
2697 char *cur = scriptname;
2699 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2701 if (strEQ(ext[i++],curext)) {
2702 extidx = -1; /* already has an ext */
2707 DEBUG_p(PerlIO_printf(Perl_debug_log,
2708 "Looking for %s\n",cur));
2709 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2710 && !S_ISDIR(PL_statbuf.st_mode)) {
2718 if (cur == scriptname) {
2719 len = strlen(scriptname);
2720 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2722 cur = strcpy(tmpbuf, scriptname);
2724 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2725 && strcpy(tmpbuf+len, ext[extidx++]));
2730 #ifdef MACOS_TRADITIONAL
2731 if (dosearch && !strchr(scriptname, ':') &&
2732 (s = PerlEnv_getenv("Commands")))
2734 if (dosearch && !strchr(scriptname, '/')
2736 && !strchr(scriptname, '\\')
2738 && (s = PerlEnv_getenv("PATH")))
2743 PL_bufend = s + strlen(s);
2744 while (s < PL_bufend) {
2745 #ifdef MACOS_TRADITIONAL
2746 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2750 #if defined(atarist) || defined(DOSISH)
2755 && *s != ';'; len++, s++) {
2756 if (len < sizeof tmpbuf)
2759 if (len < sizeof tmpbuf)
2761 #else /* ! (atarist || DOSISH) */
2762 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2765 #endif /* ! (atarist || DOSISH) */
2766 #endif /* MACOS_TRADITIONAL */
2769 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2770 continue; /* don't search dir with too-long name */
2771 #ifdef MACOS_TRADITIONAL
2772 if (len && tmpbuf[len - 1] != ':')
2773 tmpbuf[len++] = ':';
2776 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2777 && tmpbuf[len - 1] != '/'
2778 && tmpbuf[len - 1] != '\\'
2781 tmpbuf[len++] = '/';
2782 if (len == 2 && tmpbuf[0] == '.')
2785 (void)strcpy(tmpbuf + len, scriptname);
2789 len = strlen(tmpbuf);
2790 if (extidx > 0) /* reset after previous loop */
2794 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2795 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2796 if (S_ISDIR(PL_statbuf.st_mode)) {
2800 } while ( retval < 0 /* not there */
2801 && extidx>=0 && ext[extidx] /* try an extension? */
2802 && strcpy(tmpbuf+len, ext[extidx++])
2807 if (S_ISREG(PL_statbuf.st_mode)
2808 && cando(S_IRUSR,TRUE,&PL_statbuf)
2809 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2810 && cando(S_IXUSR,TRUE,&PL_statbuf)
2814 xfound = tmpbuf; /* bingo! */
2818 xfailed = savepv(tmpbuf);
2821 if (!xfound && !seen_dot && !xfailed &&
2822 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2823 || S_ISDIR(PL_statbuf.st_mode)))
2825 seen_dot = 1; /* Disable message. */
2827 if (flags & 1) { /* do or die? */
2828 Perl_croak(aTHX_ "Can't %s %s%s%s",
2829 (xfailed ? "execute" : "find"),
2830 (xfailed ? xfailed : scriptname),
2831 (xfailed ? "" : " on PATH"),
2832 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2834 scriptname = Nullch;
2838 scriptname = xfound;
2840 return (scriptname ? savepv(scriptname) : Nullch);
2843 #ifndef PERL_GET_CONTEXT_DEFINED
2846 Perl_get_context(void)
2848 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2849 # ifdef OLD_PTHREADS_API
2851 if (pthread_getspecific(PL_thr_key, &t))
2852 Perl_croak_nocontext("panic: pthread_getspecific");
2855 # ifdef I_MACH_CTHREADS
2856 return (void*)cthread_data(cthread_self());
2858 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2867 Perl_set_context(void *t)
2869 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2870 # ifdef I_MACH_CTHREADS
2871 cthread_set_data(cthread_self(), t);
2873 if (pthread_setspecific(PL_thr_key, t))
2874 Perl_croak_nocontext("panic: pthread_setspecific");
2879 #endif /* !PERL_GET_CONTEXT_DEFINED */
2881 #ifdef USE_5005THREADS
2884 /* Very simplistic scheduler for now */
2888 thr = thr->i.next_run;
2892 Perl_cond_init(pTHX_ perl_cond *cp)
2898 Perl_cond_signal(pTHX_ perl_cond *cp)
2901 perl_cond cond = *cp;
2906 /* Insert t in the runnable queue just ahead of us */
2907 t->i.next_run = thr->i.next_run;
2908 thr->i.next_run->i.prev_run = t;
2909 t->i.prev_run = thr;
2910 thr->i.next_run = t;
2911 thr->i.wait_queue = 0;
2912 /* Remove from the wait queue */
2918 Perl_cond_broadcast(pTHX_ perl_cond *cp)
2921 perl_cond cond, cond_next;
2923 for (cond = *cp; cond; cond = cond_next) {
2925 /* Insert t in the runnable queue just ahead of us */
2926 t->i.next_run = thr->i.next_run;
2927 thr->i.next_run->i.prev_run = t;
2928 t->i.prev_run = thr;
2929 thr->i.next_run = t;
2930 thr->i.wait_queue = 0;
2931 /* Remove from the wait queue */
2932 cond_next = cond->next;
2939 Perl_cond_wait(pTHX_ perl_cond *cp)
2943 if (thr->i.next_run == thr)
2944 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
2946 New(666, cond, 1, struct perl_wait_queue);
2950 thr->i.wait_queue = cond;
2951 /* Remove ourselves from runnable queue */
2952 thr->i.next_run->i.prev_run = thr->i.prev_run;
2953 thr->i.prev_run->i.next_run = thr->i.next_run;
2955 #endif /* FAKE_THREADS */
2958 Perl_condpair_magic(pTHX_ SV *sv)
2962 (void)SvUPGRADE(sv, SVt_PVMG);
2963 mg = mg_find(sv, PERL_MAGIC_mutex);
2967 New(53, cp, 1, condpair_t);
2968 MUTEX_INIT(&cp->mutex);
2969 COND_INIT(&cp->owner_cond);
2970 COND_INIT(&cp->cond);
2972 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
2973 mg = mg_find(sv, PERL_MAGIC_mutex);
2975 /* someone else beat us to initialising it */
2976 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2977 MUTEX_DESTROY(&cp->mutex);
2978 COND_DESTROY(&cp->owner_cond);
2979 COND_DESTROY(&cp->cond);
2983 sv_magic(sv, Nullsv, PERL_MAGIC_mutex, 0, 0);
2985 mg->mg_ptr = (char *)cp;
2986 mg->mg_len = sizeof(cp);
2987 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2988 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
2989 "%p: condpair_magic %p\n", thr, sv)));
2996 Perl_sv_lock(pTHX_ SV *osv)
3006 mg = condpair_magic(sv);
3007 MUTEX_LOCK(MgMUTEXP(mg));
3008 if (MgOWNER(mg) == thr)
3009 MUTEX_UNLOCK(MgMUTEXP(mg));
3012 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
3014 DEBUG_S(PerlIO_printf(Perl_debug_log,
3015 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
3016 PTR2UV(thr), PTR2UV(sv)));
3017 MUTEX_UNLOCK(MgMUTEXP(mg));
3018 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
3020 UNLOCK_SV_LOCK_MUTEX;
3025 * Make a new perl thread structure using t as a prototype. Some of the
3026 * fields for the new thread are copied from the prototype thread, t,
3027 * so t should not be running in perl at the time this function is
3028 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3029 * thread calling new_struct_thread) clearly satisfies this constraint.
3031 struct perl_thread *
3032 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3034 #if !defined(PERL_IMPLICIT_CONTEXT)
3035 struct perl_thread *thr;
3041 sv = newSVpvn("", 0);
3042 SvGROW(sv, sizeof(struct perl_thread) + 1);
3043 SvCUR_set(sv, sizeof(struct perl_thread));
3044 thr = (Thread) SvPVX(sv);
3046 memset(thr, 0xab, sizeof(struct perl_thread));
3053 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3054 PL_efloatbuf = (char*)NULL;
3057 Zero(thr, 1, struct perl_thread);
3063 PL_curcop = &PL_compiling;
3064 thr->interp = t->interp;
3065 thr->cvcache = newHV();
3066 thr->threadsv = newAV();
3067 thr->specific = newAV();
3068 thr->errsv = newSVpvn("", 0);
3069 thr->flags = THRf_R_JOINABLE;
3071 MUTEX_INIT(&thr->mutex);
3075 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
3078 PL_statname = NEWSV(66,0);
3079 PL_errors = newSVpvn("", 0);
3081 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3082 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3083 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3084 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3085 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3087 PL_reginterp_cnt = 0;
3088 PL_lastscream = Nullsv;
3091 PL_reg_start_tmp = 0;
3092 PL_reg_start_tmpl = 0;
3093 PL_reg_poscache = Nullch;
3095 PL_peepp = MEMBER_TO_FPTR(Perl_peep);
3097 /* parent thread's data needs to be locked while we make copy */
3098 MUTEX_LOCK(&t->mutex);
3100 #ifdef PERL_FLEXIBLE_EXCEPTIONS
3101 PL_protect = t->Tprotect;
3104 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3105 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3106 PL_curstash = t->Tcurstash; /* always be set to main? */
3108 PL_tainted = t->Ttainted;
3109 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3110 PL_rs = newSVsv(t->Trs);
3111 PL_last_in_gv = Nullgv;
3112 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
3113 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3114 PL_chopset = t->Tchopset;
3115 PL_bodytarget = newSVsv(t->Tbodytarget);
3116 PL_toptarget = newSVsv(t->Ttoptarget);
3117 if (t->Tformtarget == t->Ttoptarget)
3118 PL_formtarget = PL_toptarget;
3120 PL_formtarget = PL_bodytarget;
3122 /* Initialise all per-thread SVs that the template thread used */
3123 svp = AvARRAY(t->threadsv);
3124 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3125 if (*svp && *svp != &PL_sv_undef) {
3126 SV *sv = newSVsv(*svp);
3127 av_store(thr->threadsv, i, sv);
3128 sv_magic(sv, 0, PERL_MAGIC_sv, &PL_threadsv_names[i], 1);
3129 DEBUG_S(PerlIO_printf(Perl_debug_log,
3130 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
3134 thr->threadsvp = AvARRAY(thr->threadsv);
3136 MUTEX_LOCK(&PL_threads_mutex);
3138 thr->tid = ++PL_threadnum;
3139 thr->next = t->next;
3142 thr->next->prev = thr;
3143 MUTEX_UNLOCK(&PL_threads_mutex);
3145 /* done copying parent's state */
3146 MUTEX_UNLOCK(&t->mutex);
3148 #ifdef HAVE_THREAD_INTERN
3149 Perl_init_thread_intern(thr);
3150 #endif /* HAVE_THREAD_INTERN */
3153 #endif /* USE_5005THREADS */
3155 #ifdef PERL_GLOBAL_STRUCT
3164 Perl_get_op_names(pTHX)
3170 Perl_get_op_descs(pTHX)
3176 Perl_get_no_modify(pTHX)
3178 return (char*)PL_no_modify;
3182 Perl_get_opargs(pTHX)
3188 Perl_get_ppaddr(pTHX)
3190 return (PPADDR_t*)PL_ppaddr;
3193 #ifndef HAS_GETENV_LEN
3195 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3197 char *env_trans = PerlEnv_getenv(env_elem);
3199 *len = strlen(env_trans);
3206 Perl_get_vtbl(pTHX_ int vtbl_id)
3208 MGVTBL* result = Null(MGVTBL*);
3212 result = &PL_vtbl_sv;
3215 result = &PL_vtbl_env;
3217 case want_vtbl_envelem:
3218 result = &PL_vtbl_envelem;
3221 result = &PL_vtbl_sig;
3223 case want_vtbl_sigelem:
3224 result = &PL_vtbl_sigelem;
3226 case want_vtbl_pack:
3227 result = &PL_vtbl_pack;
3229 case want_vtbl_packelem:
3230 result = &PL_vtbl_packelem;
3232 case want_vtbl_dbline:
3233 result = &PL_vtbl_dbline;
3236 result = &PL_vtbl_isa;
3238 case want_vtbl_isaelem:
3239 result = &PL_vtbl_isaelem;
3241 case want_vtbl_arylen:
3242 result = &PL_vtbl_arylen;
3244 case want_vtbl_glob:
3245 result = &PL_vtbl_glob;
3247 case want_vtbl_mglob:
3248 result = &PL_vtbl_mglob;
3250 case want_vtbl_nkeys:
3251 result = &PL_vtbl_nkeys;
3253 case want_vtbl_taint:
3254 result = &PL_vtbl_taint;
3256 case want_vtbl_substr:
3257 result = &PL_vtbl_substr;
3260 result = &PL_vtbl_vec;
3263 result = &PL_vtbl_pos;
3266 result = &PL_vtbl_bm;
3269 result = &PL_vtbl_fm;
3271 case want_vtbl_uvar:
3272 result = &PL_vtbl_uvar;
3274 #ifdef USE_5005THREADS
3275 case want_vtbl_mutex:
3276 result = &PL_vtbl_mutex;
3279 case want_vtbl_defelem:
3280 result = &PL_vtbl_defelem;
3282 case want_vtbl_regexp:
3283 result = &PL_vtbl_regexp;
3285 case want_vtbl_regdata:
3286 result = &PL_vtbl_regdata;
3288 case want_vtbl_regdatum:
3289 result = &PL_vtbl_regdatum;
3291 #ifdef USE_LOCALE_COLLATE
3292 case want_vtbl_collxfrm:
3293 result = &PL_vtbl_collxfrm;
3296 case want_vtbl_amagic:
3297 result = &PL_vtbl_amagic;
3299 case want_vtbl_amagicelem:
3300 result = &PL_vtbl_amagicelem;
3302 case want_vtbl_backref:
3303 result = &PL_vtbl_backref;
3310 Perl_my_fflush_all(pTHX)
3312 #if defined(FFLUSH_NULL)
3313 return PerlIO_flush(NULL);
3315 # if defined(HAS__FWALK)
3316 /* undocumented, unprototyped, but very useful BSDism */
3317 extern void _fwalk(int (*)(FILE *));
3321 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3323 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3324 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3326 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3327 open_max = sysconf(_SC_OPEN_MAX);
3330 open_max = FOPEN_MAX;
3333 open_max = OPEN_MAX;
3344 for (i = 0; i < open_max; i++)
3345 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3346 STDIO_STREAM_ARRAY[i]._file < open_max &&
3347 STDIO_STREAM_ARRAY[i]._flag)
3348 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3352 SETERRNO(EBADF,RMS$_IFI);
3359 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3364 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3365 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3367 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3368 char *type = OP_IS_SOCKET(op) ||
3369 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3370 "socket" : "filehandle";
3373 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3375 warn_type = WARN_CLOSED;
3379 warn_type = WARN_UNOPENED;
3382 if (gv && isGV(gv)) {
3383 SV *sv = sv_newmortal();
3384 gv_efullname4(sv, gv, Nullch, FALSE);
3388 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3390 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for %sput",
3392 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3394 Perl_warner(aTHX_ WARN_IO, "Filehandle opened only for %sput",
3395 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3396 } else if (name && *name) {
3397 Perl_warner(aTHX_ warn_type,
3398 "%s%s on %s %s %s", func, pars, vile, type, name);
3399 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3400 Perl_warner(aTHX_ warn_type,
3401 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3405 Perl_warner(aTHX_ warn_type,
3406 "%s%s on %s %s", func, pars, vile, type);
3407 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3408 Perl_warner(aTHX_ warn_type,
3409 "\t(Are you trying to call %s%s on dirhandle?)\n",
3415 /* in ASCII order, not that it matters */
3416 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3419 Perl_ebcdic_control(pTHX_ int ch)
3427 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3428 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3431 if (ctlp == controllablechars)
3432 return('\177'); /* DEL */
3434 return((unsigned char)(ctlp - controllablechars - 1));
3435 } else { /* Want uncontrol */
3436 if (ch == '\177' || ch == -1)
3438 else if (ch == '\157')
3440 else if (ch == '\174')
3442 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3444 else if (ch == '\155')
3446 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3447 return(controllablechars[ch+1]);
3449 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3454 /* XXX struct tm on some systems (SunOS4/BSD) contains extra (non POSIX)
3455 * fields for which we don't have Configure support yet:
3456 * char *tm_zone; -- abbreviation of timezone name
3457 * long tm_gmtoff; -- offset from GMT in seconds
3458 * To workaround core dumps from the uninitialised tm_zone we get the
3459 * system to give us a reasonable struct to copy. This fix means that
3460 * strftime uses the tm_zone and tm_gmtoff values returned by
3461 * localtime(time()). That should give the desired result most of the
3462 * time. But probably not always!
3464 * This is a temporary workaround to be removed once Configure
3465 * support is added and NETaa14816 is considered in full.
3466 * It does not address tzname aspects of NETaa14816.
3469 # ifndef STRUCT_TM_HASZONE
3470 # define STRUCT_TM_HASZONE
3475 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3477 #ifdef STRUCT_TM_HASZONE
3480 Copy(localtime(&now), ptm, 1, struct tm);
3485 * mini_mktime - normalise struct tm values without the localtime()
3486 * semantics (and overhead) of mktime().
3489 Perl_mini_mktime(pTHX_ struct tm *ptm)
3493 int month, mday, year, jday;
3494 int odd_cent, odd_year;
3496 #define DAYS_PER_YEAR 365
3497 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3498 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3499 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3500 #define SECS_PER_HOUR (60*60)
3501 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3502 /* parentheses deliberately absent on these two, otherwise they don't work */
3503 #define MONTH_TO_DAYS 153/5
3504 #define DAYS_TO_MONTH 5/153
3505 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3506 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3507 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3508 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3511 * Year/day algorithm notes:
3513 * With a suitable offset for numeric value of the month, one can find
3514 * an offset into the year by considering months to have 30.6 (153/5) days,
3515 * using integer arithmetic (i.e., with truncation). To avoid too much
3516 * messing about with leap days, we consider January and February to be
3517 * the 13th and 14th month of the previous year. After that transformation,
3518 * we need the month index we use to be high by 1 from 'normal human' usage,
3519 * so the month index values we use run from 4 through 15.
3521 * Given that, and the rules for the Gregorian calendar (leap years are those
3522 * divisible by 4 unless also divisible by 100, when they must be divisible
3523 * by 400 instead), we can simply calculate the number of days since some
3524 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3525 * the days we derive from our month index, and adding in the day of the
3526 * month. The value used here is not adjusted for the actual origin which
3527 * it normally would use (1 January A.D. 1), since we're not exposing it.
3528 * We're only building the value so we can turn around and get the
3529 * normalised values for the year, month, day-of-month, and day-of-year.
3531 * For going backward, we need to bias the value we're using so that we find
3532 * the right year value. (Basically, we don't want the contribution of
3533 * March 1st to the number to apply while deriving the year). Having done
3534 * that, we 'count up' the contribution to the year number by accounting for
3535 * full quadracenturies (400-year periods) with their extra leap days, plus
3536 * the contribution from full centuries (to avoid counting in the lost leap
3537 * days), plus the contribution from full quad-years (to count in the normal
3538 * leap days), plus the leftover contribution from any non-leap years.
3539 * At this point, if we were working with an actual leap day, we'll have 0
3540 * days left over. This is also true for March 1st, however. So, we have
3541 * to special-case that result, and (earlier) keep track of the 'odd'
3542 * century and year contributions. If we got 4 extra centuries in a qcent,
3543 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3544 * Otherwise, we add back in the earlier bias we removed (the 123 from
3545 * figuring in March 1st), find the month index (integer division by 30.6),
3546 * and the remainder is the day-of-month. We then have to convert back to
3547 * 'real' months (including fixing January and February from being 14/15 in
3548 * the previous year to being in the proper year). After that, to get
3549 * tm_yday, we work with the normalised year and get a new yearday value for
3550 * January 1st, which we subtract from the yearday value we had earlier,
3551 * representing the date we've re-built. This is done from January 1
3552 * because tm_yday is 0-origin.
3554 * Since POSIX time routines are only guaranteed to work for times since the
3555 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3556 * applies Gregorian calendar rules even to dates before the 16th century
3557 * doesn't bother me. Besides, you'd need cultural context for a given
3558 * date to know whether it was Julian or Gregorian calendar, and that's
3559 * outside the scope for this routine. Since we convert back based on the
3560 * same rules we used to build the yearday, you'll only get strange results
3561 * for input which needed normalising, or for the 'odd' century years which
3562 * were leap years in the Julian calander but not in the Gregorian one.
3563 * I can live with that.
3565 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3566 * that's still outside the scope for POSIX time manipulation, so I don't
3570 year = 1900 + ptm->tm_year;
3571 month = ptm->tm_mon;
3572 mday = ptm->tm_mday;
3573 /* allow given yday with no month & mday to dominate the result */
3574 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3577 jday = 1 + ptm->tm_yday;
3586 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3587 yearday += month*MONTH_TO_DAYS + mday + jday;
3589 * Note that we don't know when leap-seconds were or will be,
3590 * so we have to trust the user if we get something which looks
3591 * like a sensible leap-second. Wild values for seconds will
3592 * be rationalised, however.
3594 if ((unsigned) ptm->tm_sec <= 60) {
3601 secs += 60 * ptm->tm_min;
3602 secs += SECS_PER_HOUR * ptm->tm_hour;
3604 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3605 /* got negative remainder, but need positive time */
3606 /* back off an extra day to compensate */
3607 yearday += (secs/SECS_PER_DAY)-1;
3608 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3611 yearday += (secs/SECS_PER_DAY);
3612 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3615 else if (secs >= SECS_PER_DAY) {
3616 yearday += (secs/SECS_PER_DAY);
3617 secs %= SECS_PER_DAY;
3619 ptm->tm_hour = secs/SECS_PER_HOUR;
3620 secs %= SECS_PER_HOUR;
3621 ptm->tm_min = secs/60;
3623 ptm->tm_sec += secs;
3624 /* done with time of day effects */
3626 * The algorithm for yearday has (so far) left it high by 428.
3627 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3628 * bias it by 123 while trying to figure out what year it
3629 * really represents. Even with this tweak, the reverse
3630 * translation fails for years before A.D. 0001.
3631 * It would still fail for Feb 29, but we catch that one below.
3633 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3634 yearday -= YEAR_ADJUST;
3635 year = (yearday / DAYS_PER_QCENT) * 400;
3636 yearday %= DAYS_PER_QCENT;
3637 odd_cent = yearday / DAYS_PER_CENT;
3638 year += odd_cent * 100;
3639 yearday %= DAYS_PER_CENT;
3640 year += (yearday / DAYS_PER_QYEAR) * 4;
3641 yearday %= DAYS_PER_QYEAR;
3642 odd_year = yearday / DAYS_PER_YEAR;
3644 yearday %= DAYS_PER_YEAR;
3645 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3650 yearday += YEAR_ADJUST; /* recover March 1st crock */
3651 month = yearday*DAYS_TO_MONTH;
3652 yearday -= month*MONTH_TO_DAYS;
3653 /* recover other leap-year adjustment */
3662 ptm->tm_year = year - 1900;
3664 ptm->tm_mday = yearday;
3665 ptm->tm_mon = month;
3669 ptm->tm_mon = month - 1;
3671 /* re-build yearday based on Jan 1 to get tm_yday */
3673 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3674 yearday += 14*MONTH_TO_DAYS + 1;
3675 ptm->tm_yday = jday - yearday;
3676 /* fix tm_wday if not overridden by caller */
3677 if ((unsigned)ptm->tm_wday > 6)
3678 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3682 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3690 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3693 mytm.tm_hour = hour;
3694 mytm.tm_mday = mday;
3696 mytm.tm_year = year;
3697 mytm.tm_wday = wday;
3698 mytm.tm_yday = yday;
3699 mytm.tm_isdst = isdst;
3702 New(0, buf, buflen, char);
3703 len = strftime(buf, buflen, fmt, &mytm);
3705 ** The following is needed to handle to the situation where
3706 ** tmpbuf overflows. Basically we want to allocate a buffer
3707 ** and try repeatedly. The reason why it is so complicated
3708 ** is that getting a return value of 0 from strftime can indicate
3709 ** one of the following:
3710 ** 1. buffer overflowed,
3711 ** 2. illegal conversion specifier, or
3712 ** 3. the format string specifies nothing to be returned(not
3713 ** an error). This could be because format is an empty string
3714 ** or it specifies %p that yields an empty string in some locale.
3715 ** If there is a better way to make it portable, go ahead by
3718 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3721 /* Possibly buf overflowed - try again with a bigger buf */
3722 int fmtlen = strlen(fmt);
3723 int bufsize = fmtlen + buflen;
3725 New(0, buf, bufsize, char);
3727 buflen = strftime(buf, bufsize, fmt, &mytm);
3728 if (buflen > 0 && buflen < bufsize)
3730 /* heuristic to prevent out-of-memory errors */
3731 if (bufsize > 100*fmtlen) {
3737 Renew(buf, bufsize, char);
3742 Perl_croak(aTHX_ "panic: no strftime");
3747 #define SV_CWD_RETURN_UNDEF \
3748 sv_setsv(sv, &PL_sv_undef); \
3751 #define SV_CWD_ISDOT(dp) \
3752 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3753 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3756 =for apidoc getcwd_sv
3758 Fill the sv with current working directory
3763 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3764 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3765 * getcwd(3) if available
3766 * Comments from the orignal:
3767 * This is a faster version of getcwd. It's also more dangerous
3768 * because you might chdir out of a directory that you can't chdir
3772 Perl_getcwd_sv(pTHX_ register SV *sv)
3776 #ifndef INCOMPLETE_TAINTS
3782 char buf[MAXPATHLEN];
3784 /* Some getcwd()s automatically allocate a buffer of the given
3785 * size from the heap if they are given a NULL buffer pointer.
3786 * The problem is that this behaviour is not portable. */
3787 if (getcwd(buf, sizeof(buf) - 1)) {
3788 STRLEN len = strlen(buf);
3789 sv_setpvn(sv, buf, len);
3793 sv_setsv(sv, &PL_sv_undef);
3800 struct stat statbuf;
3801 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3802 int namelen, pathlen=0;
3806 (void)SvUPGRADE(sv, SVt_PV);
3808 if (PerlLIO_lstat(".", &statbuf) < 0) {
3809 SV_CWD_RETURN_UNDEF;
3812 orig_cdev = statbuf.st_dev;
3813 orig_cino = statbuf.st_ino;
3821 if (PerlDir_chdir("..") < 0) {
3822 SV_CWD_RETURN_UNDEF;
3824 if (PerlLIO_stat(".", &statbuf) < 0) {
3825 SV_CWD_RETURN_UNDEF;
3828 cdev = statbuf.st_dev;
3829 cino = statbuf.st_ino;
3831 if (odev == cdev && oino == cino) {
3834 if (!(dir = PerlDir_open("."))) {
3835 SV_CWD_RETURN_UNDEF;
3838 while ((dp = PerlDir_read(dir)) != NULL) {
3840 namelen = dp->d_namlen;
3842 namelen = strlen(dp->d_name);
3845 if (SV_CWD_ISDOT(dp)) {
3849 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3850 SV_CWD_RETURN_UNDEF;
3853 tdev = statbuf.st_dev;
3854 tino = statbuf.st_ino;
3855 if (tino == oino && tdev == odev) {
3861 SV_CWD_RETURN_UNDEF;
3864 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3865 SV_CWD_RETURN_UNDEF;
3868 SvGROW(sv, pathlen + namelen + 1);
3872 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3875 /* prepend current directory to the front */
3877 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3878 pathlen += (namelen + 1);
3880 #ifdef VOID_CLOSEDIR
3883 if (PerlDir_close(dir) < 0) {
3884 SV_CWD_RETURN_UNDEF;
3890 SvCUR_set(sv, pathlen);
3894 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3895 SV_CWD_RETURN_UNDEF;
3898 if (PerlLIO_stat(".", &statbuf) < 0) {
3899 SV_CWD_RETURN_UNDEF;
3902 cdev = statbuf.st_dev;
3903 cino = statbuf.st_ino;
3905 if (cdev != orig_cdev || cino != orig_cino) {
3906 Perl_croak(aTHX_ "Unstable directory path, "
3907 "current directory changed unexpectedly");
3918 =for apidoc new_vstring
3920 Returns a pointer to the next character after the parsed
3921 vstring, as well as updating the passed in sv.
3923 Function must be called like
3926 s = new_vstring(s,sv);
3928 The sv must already be large enough to store the vstring
3935 Perl_new_vstring(pTHX_ char *s, SV *sv)
3938 if (*pos == 'v') pos++; /* get past 'v' */
3939 while (isDIGIT(*pos) || *pos == '_')
3941 if (!isALPHA(*pos)) {
3943 U8 tmpbuf[UTF8_MAXLEN+1];
3946 if (*s == 'v') s++; /* get past 'v' */
3948 sv_setpvn(sv, "", 0);
3953 /* this is atoi() that tolerates underscores */
3956 if ( *(s-1) == '_') {
3959 while (--end >= s) {
3962 rev += (*end - '0') * mult;
3964 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
3965 Perl_warner(aTHX_ WARN_OVERFLOW,
3966 "Integer overflow in decimal number");
3969 /* Append native character for the rev point */
3970 tmpend = uvchr_to_utf8(tmpbuf, rev);
3971 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
3972 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
3974 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3980 while (isDIGIT(*pos) )
3989 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET)
3991 S_socketpair_udp (int fd[2]) {
3992 /* Fake a datagram socketpair using UDP to localhost. */
3993 int sockets[2] = {-1, -1};
3994 struct sockaddr_in addresses[2];
3996 Sock_size_t size = sizeof (struct sockaddr_in);
4000 memset (&addresses, 0, sizeof (addresses));
4003 sockets[i] = socket (AF_INET, SOCK_DGRAM, 0);
4004 if (sockets[i] == -1)
4005 goto tidy_up_and_fail;
4007 addresses[i].sin_family = AF_INET;
4008 addresses[i].sin_addr.s_addr = htonl (INADDR_LOOPBACK);
4009 addresses[i].sin_port = 0; /* kernel choses port. */
4010 if (bind (sockets[i], (struct sockaddr *) &addresses[i],
4011 sizeof (struct sockaddr_in))
4013 goto tidy_up_and_fail;
4016 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4017 for each connect the other socket to it. */
4020 if (getsockname (sockets[i], (struct sockaddr *) &addresses[i], &size)
4022 goto tidy_up_and_fail;
4023 if (size != sizeof (struct sockaddr_in))
4024 goto abort_tidy_up_and_fail;
4025 /* !1 is 0, !0 is 1 */
4026 if (connect(sockets[!i], (struct sockaddr *) &addresses[i],
4027 sizeof (struct sockaddr_in)) == -1)
4028 goto tidy_up_and_fail;
4031 /* Now we have 2 sockets connected to each other. I don't trust some other
4032 process not to have already sent a packet to us (by random) so send
4033 a packet from each to the other. */
4036 /* I'm going to send my own port number. As a short.
4037 (Who knows if someone somewhere has sin_port as a bitfield and needs
4038 this routine. (I'm assuming crays have socketpair)) */
4039 port = addresses[i].sin_port;
4040 got = write (sockets[i], &port, sizeof(port));
4041 if (got != sizeof(port)) {
4043 goto tidy_up_and_fail;
4044 goto abort_tidy_up_and_fail;
4048 /* Packets sent. I don't trust them to have arrived though.
4049 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4050 connect to localhost will use a second kernel thread. In 2.6 the
4051 first thread running the connect() returns before the second completes,
4052 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4053 returns 0. Poor programs have tripped up. One poor program's authors'
4054 had a 50-1 reverse stock split. Not sure how connected these were.)
4055 So I don't trust someone not to have an unpredictable UDP stack.
4059 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4060 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4064 FD_SET (sockets[0], &rset);
4065 FD_SET (sockets[1], &rset);
4067 got = select (max + 1, &rset, NULL, NULL, &waitfor);
4068 if (got != 2 || !FD_ISSET (sockets[0], &rset)
4069 || !FD_ISSET (sockets[1], &rset)) {
4070 /* I hope this is portable and appropriate. */
4072 goto tidy_up_and_fail;
4073 goto abort_tidy_up_and_fail;
4077 /* And the paranoia department even now doesn't trust it to have arrive
4078 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4080 struct sockaddr_in readfrom;
4085 got = recvfrom (sockets[i], (char *) &buffer, sizeof(buffer),
4091 (struct sockaddr *) &readfrom, &size);
4094 goto tidy_up_and_fail;
4095 if (got != sizeof(port)
4096 || size != sizeof (struct sockaddr_in)
4097 /* Check other socket sent us its port. */
4098 || buffer[0] != addresses[!i].sin_port
4099 /* Check kernel says we got the datagram from that socket. */
4100 || readfrom.sin_family != addresses[!i].sin_family
4101 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4102 || readfrom.sin_port != addresses[!i].sin_port)
4103 goto abort_tidy_up_and_fail;
4106 /* My caller (my_socketpair) has validated that this is non-NULL */
4109 /* I hereby declare this connection open. May God bless all who cross
4113 abort_tidy_up_and_fail:
4114 errno = ECONNABORTED;
4117 int save_errno = errno;
4118 if (sockets[0] != -1)
4120 if (sockets[1] != -1)
4128 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4129 /* Stevens says that family must be AF_LOCAL, protocol 0.
4130 I'm going to enforce that, then ignore it, and use TCP. */
4134 struct sockaddr_in listen_addr;
4135 struct sockaddr_in connect_addr;
4140 || family != AF_UNIX
4143 errno = EAFNOSUPPORT;
4149 if (type == SOCK_DGRAM)
4150 return S_socketpair_udp (fd);
4152 listener = socket (AF_INET, type, 0);
4155 memset (&listen_addr, 0, sizeof (listen_addr));
4156 listen_addr.sin_family = AF_INET;
4157 listen_addr.sin_addr.s_addr = htonl (INADDR_LOOPBACK);
4158 listen_addr.sin_port = 0; /* kernel choses port. */
4159 if (bind (listener, (struct sockaddr *) &listen_addr, sizeof (listen_addr))
4161 goto tidy_up_and_fail;
4162 if (listen(listener, 1) == -1)
4163 goto tidy_up_and_fail;
4165 connector = socket (AF_INET, type, 0);
4166 if (connector == -1)
4167 goto tidy_up_and_fail;
4168 /* We want to find out the port number to connect to. */
4169 size = sizeof (connect_addr);
4170 if (getsockname (listener, (struct sockaddr *) &connect_addr, &size) == -1)
4171 goto tidy_up_and_fail;
4172 if (size != sizeof (connect_addr))
4173 goto abort_tidy_up_and_fail;
4174 if (connect(connector, (struct sockaddr *) &connect_addr,
4175 sizeof (connect_addr)) == -1)
4176 goto tidy_up_and_fail;
4178 size = sizeof (listen_addr);
4179 acceptor = accept (listener, (struct sockaddr *) &listen_addr, &size);
4181 goto tidy_up_and_fail;
4182 if (size != sizeof (listen_addr))
4183 goto abort_tidy_up_and_fail;
4185 /* Now check we are talking to ourself by matching port and host on the
4187 if (getsockname (connector, (struct sockaddr *) &connect_addr, &size) == -1)
4188 goto tidy_up_and_fail;
4189 if (size != sizeof (connect_addr)
4190 || listen_addr.sin_family != connect_addr.sin_family
4191 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4192 || listen_addr.sin_port != connect_addr.sin_port) {
4193 goto abort_tidy_up_and_fail;
4199 abort_tidy_up_and_fail:
4200 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4203 int save_errno = errno;
4206 if (connector != -1)
4214 #endif /* !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) */