3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
17 #define PERL_IN_UTIL_C
21 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
26 # define SIG_ERR ((Sighandler_t) -1)
31 # include <sys/wait.h>
36 # include <sys/select.h>
42 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
43 # define FD_CLOEXEC 1 /* NeXT needs this */
46 /* NOTE: Do not call the next three routines directly. Use the macros
47 * in handy.h, so that we can easily redefine everything to do tracking of
48 * allocated hunks back to the original New to track down any memory leaks.
49 * XXX This advice seems to be widely ignored :-( --AD August 1996.
52 /* paranoid version of system's malloc() */
55 Perl_safesysmalloc(MEM_SIZE size)
61 PerlIO_printf(Perl_error_log,
62 "Allocation too large: %lx\n", size) FLUSH;
65 #endif /* HAS_64K_LIMIT */
68 Perl_croak_nocontext("panic: malloc");
70 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
71 PERL_ALLOC_CHECK(ptr);
72 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
78 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
85 /* paranoid version of system's realloc() */
88 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
92 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
93 Malloc_t PerlMem_realloc();
94 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
98 PerlIO_printf(Perl_error_log,
99 "Reallocation too large: %lx\n", size) FLUSH;
102 #endif /* HAS_64K_LIMIT */
109 return safesysmalloc(size);
112 Perl_croak_nocontext("panic: realloc");
114 ptr = (Malloc_t)PerlMem_realloc(where,size);
115 PERL_ALLOC_CHECK(ptr);
117 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
118 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
125 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
132 /* safe version of system's free() */
135 Perl_safesysfree(Malloc_t where)
137 #ifdef PERL_IMPLICIT_SYS
140 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
147 /* safe version of system's calloc() */
150 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
156 if (size * count > 0xffff) {
157 PerlIO_printf(Perl_error_log,
158 "Allocation too large: %lx\n", size * count) FLUSH;
161 #endif /* HAS_64K_LIMIT */
163 if ((long)size < 0 || (long)count < 0)
164 Perl_croak_nocontext("panic: calloc");
167 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
168 PERL_ALLOC_CHECK(ptr);
169 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));
171 memset((void*)ptr, 0, size);
177 PerlIO_puts(Perl_error_log,PL_no_mem) FLUSH;
184 /* These must be defined when not using Perl's malloc for binary
189 Malloc_t Perl_malloc (MEM_SIZE nbytes)
192 return (Malloc_t)PerlMem_malloc(nbytes);
195 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
198 return (Malloc_t)PerlMem_calloc(elements, size);
201 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
204 return (Malloc_t)PerlMem_realloc(where, nbytes);
207 Free_t Perl_mfree (Malloc_t where)
215 /* copy a string up to some (non-backslashed) delimiter, if any */
218 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
221 for (tolen = 0; from < fromend; from++, tolen++) {
223 if (from[1] == delim)
232 else if (*from == delim)
243 /* return ptr to little string in big string, NULL if not found */
244 /* This routine was donated by Corey Satten. */
247 Perl_instr(pTHX_ register const char *big, register const char *little)
249 register const char *s, *x;
260 for (x=big,s=little; *s; /**/ ) {
269 return (char*)(big-1);
274 /* same as instr but allow embedded nulls */
277 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
279 register const char *s, *x;
280 register I32 first = *little;
281 register const char *littleend = lend;
283 if (!first && little >= littleend)
285 if (bigend - big < littleend - little)
287 bigend -= littleend - little++;
288 while (big <= bigend) {
291 for (x=big,s=little; s < littleend; /**/ ) {
298 return (char*)(big-1);
303 /* reverse of the above--find last substring */
306 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
308 register const char *bigbeg;
309 register const char *s, *x;
310 register I32 first = *little;
311 register const char *littleend = lend;
313 if (!first && little >= littleend)
314 return (char*)bigend;
316 big = bigend - (littleend - little++);
317 while (big >= bigbeg) {
320 for (x=big+2,s=little; s < littleend; /**/ ) {
327 return (char*)(big+1);
332 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
334 /* As a space optimization, we do not compile tables for strings of length
335 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
336 special-cased in fbm_instr().
338 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
341 =head1 Miscellaneous Functions
343 =for apidoc fbm_compile
345 Analyses the string in order to make fast searches on it using fbm_instr()
346 -- the Boyer-Moore algorithm.
352 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
361 if (flags & FBMcf_TAIL) {
362 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
363 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
364 if (mg && mg->mg_len >= 0)
367 s = (U8*)SvPV_force(sv, len);
368 (void)SvUPGRADE(sv, SVt_PVBM);
369 if (len == 0) /* TAIL might be on a zero-length string. */
379 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
380 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
381 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
382 memset((void*)table, mlen, 256);
383 table[-1] = (U8)flags;
385 sb = s - mlen + 1; /* first char (maybe) */
387 if (table[*s] == mlen)
392 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
395 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
396 for (i = 0; i < len; i++) {
397 if (PL_freq[s[i]] < frequency) {
399 frequency = PL_freq[s[i]];
402 BmRARE(sv) = s[rarest];
403 BmPREVIOUS(sv) = (U16)rarest;
404 BmUSEFUL(sv) = 100; /* Initial value */
405 if (flags & FBMcf_TAIL)
407 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
408 BmRARE(sv),BmPREVIOUS(sv)));
411 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
412 /* If SvTAIL is actually due to \Z or \z, this gives false positives
416 =for apidoc fbm_instr
418 Returns the location of the SV in the string delimited by C<str> and
419 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
420 does not have to be fbm_compiled, but the search will not be as fast
427 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
429 register unsigned char *s;
431 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
432 register STRLEN littlelen = l;
433 register I32 multiline = flags & FBMrf_MULTILINE;
435 if ((STRLEN)(bigend - big) < littlelen) {
436 if ( SvTAIL(littlestr)
437 && ((STRLEN)(bigend - big) == littlelen - 1)
439 || (*big == *little &&
440 memEQ((char *)big, (char *)little, littlelen - 1))))
445 if (littlelen <= 2) { /* Special-cased */
447 if (littlelen == 1) {
448 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
449 /* Know that bigend != big. */
450 if (bigend[-1] == '\n')
451 return (char *)(bigend - 1);
452 return (char *) bigend;
460 if (SvTAIL(littlestr))
461 return (char *) bigend;
465 return (char*)big; /* Cannot be SvTAIL! */
468 if (SvTAIL(littlestr) && !multiline) {
469 if (bigend[-1] == '\n' && bigend[-2] == *little)
470 return (char*)bigend - 2;
471 if (bigend[-1] == *little)
472 return (char*)bigend - 1;
476 /* This should be better than FBM if c1 == c2, and almost
477 as good otherwise: maybe better since we do less indirection.
478 And we save a lot of memory by caching no table. */
479 register unsigned char c1 = little[0];
480 register unsigned char c2 = little[1];
485 while (s <= bigend) {
495 goto check_1char_anchor;
506 goto check_1char_anchor;
509 while (s <= bigend) {
514 goto check_1char_anchor;
523 check_1char_anchor: /* One char and anchor! */
524 if (SvTAIL(littlestr) && (*bigend == *little))
525 return (char *)bigend; /* bigend is already decremented. */
528 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
529 s = bigend - littlelen;
530 if (s >= big && bigend[-1] == '\n' && *s == *little
531 /* Automatically of length > 2 */
532 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
534 return (char*)s; /* how sweet it is */
537 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
539 return (char*)s + 1; /* how sweet it is */
543 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
544 char *b = ninstr((char*)big,(char*)bigend,
545 (char*)little, (char*)little + littlelen);
547 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
548 /* Chop \n from littlestr: */
549 s = bigend - littlelen + 1;
551 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
560 { /* Do actual FBM. */
561 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
562 register unsigned char *oldlittle;
564 if (littlelen > (STRLEN)(bigend - big))
566 --littlelen; /* Last char found by table lookup */
569 little += littlelen; /* last char */
576 if ((tmp = table[*s])) {
577 if ((s += tmp) < bigend)
581 else { /* less expensive than calling strncmp() */
582 register unsigned char *olds = s;
587 if (*--s == *--little)
589 s = olds + 1; /* here we pay the price for failure */
591 if (s < bigend) /* fake up continue to outer loop */
599 if ( s == bigend && (table[-1] & FBMcf_TAIL)
600 && memEQ((char *)(bigend - littlelen),
601 (char *)(oldlittle - littlelen), littlelen) )
602 return (char*)bigend - littlelen;
607 /* start_shift, end_shift are positive quantities which give offsets
608 of ends of some substring of bigstr.
609 If `last' we want the last occurrence.
610 old_posp is the way of communication between consequent calls if
611 the next call needs to find the .
612 The initial *old_posp should be -1.
614 Note that we take into account SvTAIL, so one can get extra
615 optimizations if _ALL flag is set.
618 /* If SvTAIL is actually due to \Z or \z, this gives false positives
619 if PL_multiline. In fact if !PL_multiline the authoritative answer
620 is not supported yet. */
623 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
625 register unsigned char *s, *x;
626 register unsigned char *big;
628 register I32 previous;
630 register unsigned char *little;
631 register I32 stop_pos;
632 register unsigned char *littleend;
636 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
637 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
639 if ( BmRARE(littlestr) == '\n'
640 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
641 little = (unsigned char *)(SvPVX(littlestr));
642 littleend = little + SvCUR(littlestr);
649 little = (unsigned char *)(SvPVX(littlestr));
650 littleend = little + SvCUR(littlestr);
652 /* The value of pos we can start at: */
653 previous = BmPREVIOUS(littlestr);
654 big = (unsigned char *)(SvPVX(bigstr));
655 /* The value of pos we can stop at: */
656 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
657 if (previous + start_shift > stop_pos) {
659 stop_pos does not include SvTAIL in the count, so this check is incorrect
660 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
663 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
668 while (pos < previous + start_shift) {
669 if (!(pos += PL_screamnext[pos]))
674 if (pos >= stop_pos) break;
675 if (big[pos] != first)
677 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
683 if (s == littleend) {
685 if (!last) return (char *)(big+pos);
688 } while ( pos += PL_screamnext[pos] );
690 return (char *)(big+(*old_posp));
692 if (!SvTAIL(littlestr) || (end_shift > 0))
694 /* Ignore the trailing "\n". This code is not microoptimized */
695 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
696 stop_pos = littleend - little; /* Actual littlestr len */
701 && ((stop_pos == 1) ||
702 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
708 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
710 register U8 *a = (U8 *)s1;
711 register U8 *b = (U8 *)s2;
713 if (*a != *b && *a != PL_fold[*b])
721 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
723 register U8 *a = (U8 *)s1;
724 register U8 *b = (U8 *)s2;
726 if (*a != *b && *a != PL_fold_locale[*b])
733 /* copy a string to a safe spot */
736 =head1 Memory Management
740 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
741 string which is a duplicate of C<pv>. The size of the string is
742 determined by C<strlen()>. The memory allocated for the new string can
743 be freed with the C<Safefree()> function.
749 Perl_savepv(pTHX_ const char *pv)
751 register char *newaddr = Nullch;
753 New(902,newaddr,strlen(pv)+1,char);
754 (void)strcpy(newaddr,pv);
759 /* same thing but with a known length */
764 Perl's version of what C<strndup()> would be if it existed. Returns a
765 pointer to a newly allocated string which is a duplicate of the first
766 C<len> bytes from C<pv>. The memory allocated for the new string can be
767 freed with the C<Safefree()> function.
773 Perl_savepvn(pTHX_ const char *pv, register I32 len)
775 register char *newaddr;
777 New(903,newaddr,len+1,char);
778 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
780 Copy(pv,newaddr,len,char); /* might not be null terminated */
781 newaddr[len] = '\0'; /* is now */
784 Zero(newaddr,len+1,char);
790 =for apidoc savesharedpv
792 A version of C<savepv()> which allocates the duplicate string in memory
793 which is shared between threads.
798 Perl_savesharedpv(pTHX_ const char *pv)
800 register char *newaddr = Nullch;
802 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
803 (void)strcpy(newaddr,pv);
810 /* the SV for Perl_form() and mess() is not kept in an arena */
819 return sv_2mortal(newSVpvn("",0));
824 /* Create as PVMG now, to avoid any upgrading later */
826 Newz(905, any, 1, XPVMG);
827 SvFLAGS(sv) = SVt_PVMG;
828 SvANY(sv) = (void*)any;
829 SvREFCNT(sv) = 1 << 30; /* practically infinite */
834 #if defined(PERL_IMPLICIT_CONTEXT)
836 Perl_form_nocontext(const char* pat, ...)
842 retval = vform(pat, &args);
846 #endif /* PERL_IMPLICIT_CONTEXT */
849 =head1 Miscellaneous Functions
852 Takes a sprintf-style format pattern and conventional
853 (non-SV) arguments and returns the formatted string.
855 (char *) Perl_form(pTHX_ const char* pat, ...)
857 can be used any place a string (char *) is required:
859 char * s = Perl_form("%d.%d",major,minor);
861 Uses a single private buffer so if you want to format several strings you
862 must explicitly copy the earlier strings away (and free the copies when you
869 Perl_form(pTHX_ const char* pat, ...)
874 retval = vform(pat, &args);
880 Perl_vform(pTHX_ const char *pat, va_list *args)
882 SV *sv = mess_alloc();
883 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
887 #if defined(PERL_IMPLICIT_CONTEXT)
889 Perl_mess_nocontext(const char *pat, ...)
895 retval = vmess(pat, &args);
899 #endif /* PERL_IMPLICIT_CONTEXT */
902 Perl_mess(pTHX_ const char *pat, ...)
907 retval = vmess(pat, &args);
913 S_closest_cop(pTHX_ COP *cop, OP *o)
915 /* Look for PL_op starting from o. cop is the last COP we've seen. */
917 if (!o || o == PL_op) return cop;
919 if (o->op_flags & OPf_KIDS) {
921 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
925 /* If the OP_NEXTSTATE has been optimised away we can still use it
926 * the get the file and line number. */
928 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
931 /* Keep searching, and return when we've found something. */
933 new_cop = closest_cop(cop, kid);
934 if (new_cop) return new_cop;
944 Perl_vmess(pTHX_ const char *pat, va_list *args)
946 SV *sv = mess_alloc();
947 static char dgd[] = " during global destruction.\n";
950 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
951 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
954 * Try and find the file and line for PL_op. This will usually be
955 * PL_curcop, but it might be a cop that has been optimised away. We
956 * can try to find such a cop by searching through the optree starting
957 * from the sibling of PL_curcop.
960 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
961 if (!cop) cop = PL_curcop;
964 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
965 OutCopFILE(cop), (IV)CopLINE(cop));
966 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
967 bool line_mode = (RsSIMPLE(PL_rs) &&
968 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
969 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
970 PL_last_in_gv == PL_argvgv ?
971 "" : GvNAME(PL_last_in_gv),
972 line_mode ? "line" : "chunk",
973 (IV)IoLINES(GvIOp(PL_last_in_gv)));
975 #ifdef USE_5005THREADS
977 Perl_sv_catpvf(aTHX_ sv, " thread %ld", thr->tid);
979 sv_catpv(sv, PL_dirty ? dgd : ".\n");
985 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
990 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
991 && (io = GvIO(PL_stderrgv))
992 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
999 SAVESPTR(PL_stderrgv);
1000 PL_stderrgv = Nullgv;
1002 PUSHSTACKi(PERLSI_MAGIC);
1006 PUSHs(SvTIED_obj((SV*)io, mg));
1007 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1009 call_method("PRINT", G_SCALAR);
1017 /* SFIO can really mess with your errno */
1020 PerlIO *serr = Perl_error_log;
1022 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1023 (void)PerlIO_flush(serr);
1031 Perl_vdie(pTHX_ const char* pat, va_list *args)
1034 int was_in_eval = PL_in_eval;
1041 DEBUG_S(PerlIO_printf(Perl_debug_log,
1042 "%p: die: curstack = %p, mainstack = %p\n",
1043 thr, PL_curstack, PL_mainstack));
1046 msv = vmess(pat, args);
1047 if (PL_errors && SvCUR(PL_errors)) {
1048 sv_catsv(PL_errors, msv);
1049 message = SvPV(PL_errors, msglen);
1050 SvCUR_set(PL_errors, 0);
1053 message = SvPV(msv,msglen);
1060 DEBUG_S(PerlIO_printf(Perl_debug_log,
1061 "%p: die: message = %s\ndiehook = %p\n",
1062 thr, message, PL_diehook));
1064 /* sv_2cv might call Perl_croak() */
1065 SV *olddiehook = PL_diehook;
1067 SAVESPTR(PL_diehook);
1068 PL_diehook = Nullsv;
1069 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1071 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1078 msg = newSVpvn(message, msglen);
1086 PUSHSTACKi(PERLSI_DIEHOOK);
1090 call_sv((SV*)cv, G_DISCARD);
1096 PL_restartop = die_where(message, msglen);
1097 DEBUG_S(PerlIO_printf(Perl_debug_log,
1098 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1099 thr, PL_restartop, was_in_eval, PL_top_env));
1100 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1102 return PL_restartop;
1105 #if defined(PERL_IMPLICIT_CONTEXT)
1107 Perl_die_nocontext(const char* pat, ...)
1112 va_start(args, pat);
1113 o = vdie(pat, &args);
1117 #endif /* PERL_IMPLICIT_CONTEXT */
1120 Perl_die(pTHX_ const char* pat, ...)
1124 va_start(args, pat);
1125 o = vdie(pat, &args);
1131 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1141 msv = vmess(pat, args);
1142 if (PL_errors && SvCUR(PL_errors)) {
1143 sv_catsv(PL_errors, msv);
1144 message = SvPV(PL_errors, msglen);
1145 SvCUR_set(PL_errors, 0);
1148 message = SvPV(msv,msglen);
1155 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1156 PTR2UV(thr), message));
1159 /* sv_2cv might call Perl_croak() */
1160 SV *olddiehook = PL_diehook;
1162 SAVESPTR(PL_diehook);
1163 PL_diehook = Nullsv;
1164 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1166 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1173 msg = newSVpvn(message, msglen);
1181 PUSHSTACKi(PERLSI_DIEHOOK);
1185 call_sv((SV*)cv, G_DISCARD);
1191 PL_restartop = die_where(message, msglen);
1195 message = SvPVx(ERRSV, msglen);
1197 write_to_stderr(message, msglen);
1201 #if defined(PERL_IMPLICIT_CONTEXT)
1203 Perl_croak_nocontext(const char *pat, ...)
1207 va_start(args, pat);
1212 #endif /* PERL_IMPLICIT_CONTEXT */
1215 =head1 Warning and Dieing
1219 This is the XSUB-writer's interface to Perl's C<die> function.
1220 Normally use this function the same way you use the C C<printf>
1221 function. See C<warn>.
1223 If you want to throw an exception object, assign the object to
1224 C<$@> and then pass C<Nullch> to croak():
1226 errsv = get_sv("@", TRUE);
1227 sv_setsv(errsv, exception_object);
1234 Perl_croak(pTHX_ const char *pat, ...)
1237 va_start(args, pat);
1244 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1253 msv = vmess(pat, args);
1254 message = SvPV(msv, msglen);
1257 /* sv_2cv might call Perl_warn() */
1258 SV *oldwarnhook = PL_warnhook;
1260 SAVESPTR(PL_warnhook);
1261 PL_warnhook = Nullsv;
1262 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1264 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1270 msg = newSVpvn(message, msglen);
1274 PUSHSTACKi(PERLSI_WARNHOOK);
1278 call_sv((SV*)cv, G_DISCARD);
1285 write_to_stderr(message, msglen);
1288 #if defined(PERL_IMPLICIT_CONTEXT)
1290 Perl_warn_nocontext(const char *pat, ...)
1294 va_start(args, pat);
1298 #endif /* PERL_IMPLICIT_CONTEXT */
1303 This is the XSUB-writer's interface to Perl's C<warn> function. Use this
1304 function the same way you use the C C<printf> function. See
1311 Perl_warn(pTHX_ const char *pat, ...)
1314 va_start(args, pat);
1319 #if defined(PERL_IMPLICIT_CONTEXT)
1321 Perl_warner_nocontext(U32 err, const char *pat, ...)
1325 va_start(args, pat);
1326 vwarner(err, pat, &args);
1329 #endif /* PERL_IMPLICIT_CONTEXT */
1332 Perl_warner(pTHX_ U32 err, const char* pat,...)
1335 va_start(args, pat);
1336 vwarner(err, pat, &args);
1341 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1350 msv = vmess(pat, args);
1351 message = SvPV(msv, msglen);
1354 #ifdef USE_5005THREADS
1355 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s", PTR2UV(thr), message));
1356 #endif /* USE_5005THREADS */
1358 /* sv_2cv might call Perl_croak() */
1359 SV *olddiehook = PL_diehook;
1361 SAVESPTR(PL_diehook);
1362 PL_diehook = Nullsv;
1363 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1365 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1371 msg = newSVpvn(message, msglen);
1375 PUSHSTACKi(PERLSI_DIEHOOK);
1379 call_sv((SV*)cv, G_DISCARD);
1385 PL_restartop = die_where(message, msglen);
1388 write_to_stderr(message, msglen);
1393 /* sv_2cv might call Perl_warn() */
1394 SV *oldwarnhook = PL_warnhook;
1396 SAVESPTR(PL_warnhook);
1397 PL_warnhook = Nullsv;
1398 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1400 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1406 msg = newSVpvn(message, msglen);
1410 PUSHSTACKi(PERLSI_WARNHOOK);
1414 call_sv((SV*)cv, G_DISCARD);
1420 write_to_stderr(message, msglen);
1424 /* since we've already done strlen() for both nam and val
1425 * we can use that info to make things faster than
1426 * sprintf(s, "%s=%s", nam, val)
1428 #define my_setenv_format(s, nam, nlen, val, vlen) \
1429 Copy(nam, s, nlen, char); \
1431 Copy(val, s+(nlen+1), vlen, char); \
1432 *(s+(nlen+1+vlen)) = '\0'
1434 #ifdef USE_ENVIRON_ARRAY
1435 /* VMS' my_setenv() is in vms.c */
1436 #if !defined(WIN32) && !defined(NETWARE)
1438 Perl_my_setenv(pTHX_ char *nam, char *val)
1441 /* only parent thread can modify process environment */
1442 if (PL_curinterp == aTHX)
1445 #ifndef PERL_USE_SAFE_PUTENV
1446 /* most putenv()s leak, so we manipulate environ directly */
1447 register I32 i=setenv_getix(nam); /* where does it go? */
1450 if (environ == PL_origenviron) { /* need we copy environment? */
1456 for (max = i; environ[max]; max++) ;
1457 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1458 for (j=0; j<max; j++) { /* copy environment */
1459 int len = strlen(environ[j]);
1460 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1461 Copy(environ[j], tmpenv[j], len+1, char);
1463 tmpenv[max] = Nullch;
1464 environ = tmpenv; /* tell exec where it is now */
1467 safesysfree(environ[i]);
1468 while (environ[i]) {
1469 environ[i] = environ[i+1];
1474 if (!environ[i]) { /* does not exist yet */
1475 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1476 environ[i+1] = Nullch; /* make sure it's null terminated */
1479 safesysfree(environ[i]);
1483 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1484 /* all that work just for this */
1485 my_setenv_format(environ[i], nam, nlen, val, vlen);
1487 #else /* PERL_USE_SAFE_PUTENV */
1488 # if defined(__CYGWIN__) || defined( EPOC)
1489 setenv(nam, val, 1);
1492 int nlen = strlen(nam), vlen;
1497 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1498 /* all that work just for this */
1499 my_setenv_format(new_env, nam, nlen, val, vlen);
1500 (void)putenv(new_env);
1501 # endif /* __CYGWIN__ */
1502 #endif /* PERL_USE_SAFE_PUTENV */
1506 #else /* WIN32 || NETWARE */
1509 Perl_my_setenv(pTHX_ char *nam,char *val)
1511 register char *envstr;
1512 int nlen = strlen(nam), vlen;
1518 New(904, envstr, nlen+vlen+2, char);
1519 my_setenv_format(envstr, nam, nlen, val, vlen);
1520 (void)PerlEnv_putenv(envstr);
1524 #endif /* WIN32 || NETWARE */
1528 Perl_setenv_getix(pTHX_ char *nam)
1530 register I32 i, len = strlen(nam);
1532 for (i = 0; environ[i]; i++) {
1535 strnicmp(environ[i],nam,len) == 0
1537 strnEQ(environ[i],nam,len)
1539 && environ[i][len] == '=')
1540 break; /* strnEQ must come first to avoid */
1541 } /* potential SEGV's */
1544 #endif /* !PERL_MICRO */
1546 #endif /* !VMS && !EPOC*/
1548 #ifdef UNLINK_ALL_VERSIONS
1550 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1554 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1559 /* this is a drop-in replacement for bcopy() */
1560 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1562 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1566 if (from - to >= 0) {
1574 *(--to) = *(--from);
1580 /* this is a drop-in replacement for memset() */
1583 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1593 /* this is a drop-in replacement for bzero() */
1594 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1596 Perl_my_bzero(register char *loc, register I32 len)
1606 /* this is a drop-in replacement for memcmp() */
1607 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1609 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1611 register U8 *a = (U8 *)s1;
1612 register U8 *b = (U8 *)s2;
1616 if (tmp = *a++ - *b++)
1621 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1625 #ifdef USE_CHAR_VSPRINTF
1630 vsprintf(char *dest, const char *pat, char *args)
1634 fakebuf._ptr = dest;
1635 fakebuf._cnt = 32767;
1639 fakebuf._flag = _IOWRT|_IOSTRG;
1640 _doprnt(pat, args, &fakebuf); /* what a kludge */
1641 (void)putc('\0', &fakebuf);
1642 #ifdef USE_CHAR_VSPRINTF
1645 return 0; /* perl doesn't use return value */
1649 #endif /* HAS_VPRINTF */
1652 #if BYTEORDER != 0x4321
1654 Perl_my_swap(pTHX_ short s)
1656 #if (BYTEORDER & 1) == 0
1659 result = ((s & 255) << 8) + ((s >> 8) & 255);
1667 Perl_my_htonl(pTHX_ long l)
1671 char c[sizeof(long)];
1674 #if BYTEORDER == 0x1234
1675 u.c[0] = (l >> 24) & 255;
1676 u.c[1] = (l >> 16) & 255;
1677 u.c[2] = (l >> 8) & 255;
1681 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1682 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1687 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1688 u.c[o & 0xf] = (l >> s) & 255;
1696 Perl_my_ntohl(pTHX_ long l)
1700 char c[sizeof(long)];
1703 #if BYTEORDER == 0x1234
1704 u.c[0] = (l >> 24) & 255;
1705 u.c[1] = (l >> 16) & 255;
1706 u.c[2] = (l >> 8) & 255;
1710 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1711 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1718 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1719 l |= (u.c[o & 0xf] & 255) << s;
1726 #endif /* BYTEORDER != 0x4321 */
1730 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1731 * If these functions are defined,
1732 * the BYTEORDER is neither 0x1234 nor 0x4321.
1733 * However, this is not assumed.
1737 #define HTOV(name,type) \
1739 name (register type n) \
1743 char c[sizeof(type)]; \
1747 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1748 u.c[i] = (n >> s) & 0xFF; \
1753 #define VTOH(name,type) \
1755 name (register type n) \
1759 char c[sizeof(type)]; \
1765 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1766 n += (u.c[i] & 0xFF) << s; \
1771 #if defined(HAS_HTOVS) && !defined(htovs)
1774 #if defined(HAS_HTOVL) && !defined(htovl)
1777 #if defined(HAS_VTOHS) && !defined(vtohs)
1780 #if defined(HAS_VTOHL) && !defined(vtohl)
1785 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1787 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1789 register I32 This, that;
1795 PERL_FLUSHALL_FOR_CHILD;
1796 This = (*mode == 'w');
1800 taint_proper("Insecure %s%s", "EXEC");
1802 if (PerlProc_pipe(p) < 0)
1804 /* Try for another pipe pair for error return */
1805 if (PerlProc_pipe(pp) >= 0)
1807 while ((pid = PerlProc_fork()) < 0) {
1808 if (errno != EAGAIN) {
1809 PerlLIO_close(p[This]);
1810 PerlLIO_close(p[that]);
1812 PerlLIO_close(pp[0]);
1813 PerlLIO_close(pp[1]);
1825 /* Close parent's end of error status pipe (if any) */
1827 PerlLIO_close(pp[0]);
1828 #if defined(HAS_FCNTL) && defined(F_SETFD)
1829 /* Close error pipe automatically if exec works */
1830 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1833 /* Now dup our end of _the_ pipe to right position */
1834 if (p[THIS] != (*mode == 'r')) {
1835 PerlLIO_dup2(p[THIS], *mode == 'r');
1836 PerlLIO_close(p[THIS]);
1837 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1838 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1841 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1842 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1843 /* No automatic close - do it by hand */
1850 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1856 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1862 do_execfree(); /* free any memory malloced by child on fork */
1864 PerlLIO_close(pp[1]);
1865 /* Keep the lower of the two fd numbers */
1866 if (p[that] < p[This]) {
1867 PerlLIO_dup2(p[This], p[that]);
1868 PerlLIO_close(p[This]);
1872 PerlLIO_close(p[that]); /* close child's end of pipe */
1875 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1877 (void)SvUPGRADE(sv,SVt_IV);
1879 PL_forkprocess = pid;
1880 /* If we managed to get status pipe check for exec fail */
1881 if (did_pipes && pid > 0) {
1885 while (n < sizeof(int)) {
1886 n1 = PerlLIO_read(pp[0],
1887 (void*)(((char*)&errkid)+n),
1893 PerlLIO_close(pp[0]);
1895 if (n) { /* Error */
1897 PerlLIO_close(p[This]);
1898 if (n != sizeof(int))
1899 Perl_croak(aTHX_ "panic: kid popen errno read");
1901 pid2 = wait4pid(pid, &status, 0);
1902 } while (pid2 == -1 && errno == EINTR);
1903 errno = errkid; /* Propagate errno from kid */
1908 PerlLIO_close(pp[0]);
1909 return PerlIO_fdopen(p[This], mode);
1911 Perl_croak(aTHX_ "List form of piped open not implemented");
1912 return (PerlIO *) NULL;
1916 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1917 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
1919 Perl_my_popen(pTHX_ char *cmd, char *mode)
1922 register I32 This, that;
1925 I32 doexec = strNE(cmd,"-");
1929 PERL_FLUSHALL_FOR_CHILD;
1932 return my_syspopen(aTHX_ cmd,mode);
1935 This = (*mode == 'w');
1937 if (doexec && PL_tainting) {
1939 taint_proper("Insecure %s%s", "EXEC");
1941 if (PerlProc_pipe(p) < 0)
1943 if (doexec && PerlProc_pipe(pp) >= 0)
1945 while ((pid = PerlProc_fork()) < 0) {
1946 if (errno != EAGAIN) {
1947 PerlLIO_close(p[This]);
1948 PerlLIO_close(p[that]);
1950 PerlLIO_close(pp[0]);
1951 PerlLIO_close(pp[1]);
1954 Perl_croak(aTHX_ "Can't fork");
1967 PerlLIO_close(pp[0]);
1968 #if defined(HAS_FCNTL) && defined(F_SETFD)
1969 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1972 if (p[THIS] != (*mode == 'r')) {
1973 PerlLIO_dup2(p[THIS], *mode == 'r');
1974 PerlLIO_close(p[THIS]);
1975 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1976 PerlLIO_close(p[THAT]);
1979 PerlLIO_close(p[THAT]);
1982 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1991 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
1996 /* may or may not use the shell */
1997 do_exec3(cmd, pp[1], did_pipes);
2000 #endif /* defined OS2 */
2002 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2003 SvREADONLY_off(GvSV(tmpgv));
2004 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2005 SvREADONLY_on(GvSV(tmpgv));
2007 #ifdef THREADS_HAVE_PIDS
2008 PL_ppid = (IV)getppid();
2011 hv_clear(PL_pidstatus); /* we have no children */
2016 do_execfree(); /* free any memory malloced by child on vfork */
2018 PerlLIO_close(pp[1]);
2019 if (p[that] < p[This]) {
2020 PerlLIO_dup2(p[This], p[that]);
2021 PerlLIO_close(p[This]);
2025 PerlLIO_close(p[that]);
2028 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2030 (void)SvUPGRADE(sv,SVt_IV);
2032 PL_forkprocess = pid;
2033 if (did_pipes && pid > 0) {
2037 while (n < sizeof(int)) {
2038 n1 = PerlLIO_read(pp[0],
2039 (void*)(((char*)&errkid)+n),
2045 PerlLIO_close(pp[0]);
2047 if (n) { /* Error */
2049 PerlLIO_close(p[This]);
2050 if (n != sizeof(int))
2051 Perl_croak(aTHX_ "panic: kid popen errno read");
2053 pid2 = wait4pid(pid, &status, 0);
2054 } while (pid2 == -1 && errno == EINTR);
2055 errno = errkid; /* Propagate errno from kid */
2060 PerlLIO_close(pp[0]);
2061 return PerlIO_fdopen(p[This], mode);
2064 #if defined(atarist) || defined(EPOC)
2067 Perl_my_popen(pTHX_ char *cmd, char *mode)
2069 PERL_FLUSHALL_FOR_CHILD;
2070 /* Call system's popen() to get a FILE *, then import it.
2071 used 0 for 2nd parameter to PerlIO_importFILE;
2074 return PerlIO_importFILE(popen(cmd, mode), 0);
2078 FILE *djgpp_popen();
2080 Perl_my_popen(pTHX_ char *cmd, char *mode)
2082 PERL_FLUSHALL_FOR_CHILD;
2083 /* Call system's popen() to get a FILE *, then import it.
2084 used 0 for 2nd parameter to PerlIO_importFILE;
2087 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2092 #endif /* !DOSISH */
2094 /* this is called in parent before the fork() */
2096 Perl_atfork_lock(void)
2098 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2099 /* locks must be held in locking order (if any) */
2101 MUTEX_LOCK(&PL_malloc_mutex);
2107 /* this is called in both parent and child after the fork() */
2109 Perl_atfork_unlock(void)
2111 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2112 /* locks must be released in same order as in atfork_lock() */
2114 MUTEX_UNLOCK(&PL_malloc_mutex);
2123 #if defined(HAS_FORK)
2125 #if (defined(USE_5005THREADS) || defined(USE_ITHREADS)) && !defined(HAS_PTHREAD_ATFORK)
2130 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2131 * handlers elsewhere in the code */
2136 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2137 Perl_croak_nocontext("fork() not available");
2139 #endif /* HAS_FORK */
2144 Perl_dump_fds(pTHX_ char *s)
2149 PerlIO_printf(Perl_debug_log,"%s", s);
2150 for (fd = 0; fd < 32; fd++) {
2151 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2152 PerlIO_printf(Perl_debug_log," %d",fd);
2154 PerlIO_printf(Perl_debug_log,"\n");
2156 #endif /* DUMP_FDS */
2160 dup2(int oldfd, int newfd)
2162 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2165 PerlLIO_close(newfd);
2166 return fcntl(oldfd, F_DUPFD, newfd);
2168 #define DUP2_MAX_FDS 256
2169 int fdtmp[DUP2_MAX_FDS];
2175 PerlLIO_close(newfd);
2176 /* good enough for low fd's... */
2177 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2178 if (fdx >= DUP2_MAX_FDS) {
2186 PerlLIO_close(fdtmp[--fdx]);
2193 #ifdef HAS_SIGACTION
2195 #ifdef MACOS_TRADITIONAL
2196 /* We don't want restart behavior on MacOS */
2201 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2203 struct sigaction act, oact;
2206 /* only "parent" interpreter can diddle signals */
2207 if (PL_curinterp != aTHX)
2211 act.sa_handler = handler;
2212 sigemptyset(&act.sa_mask);
2215 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2216 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2218 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2219 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2220 act.sa_flags |= SA_NOCLDWAIT;
2222 if (sigaction(signo, &act, &oact) == -1)
2225 return oact.sa_handler;
2229 Perl_rsignal_state(pTHX_ int signo)
2231 struct sigaction oact;
2233 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2236 return oact.sa_handler;
2240 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2242 struct sigaction act;
2245 /* only "parent" interpreter can diddle signals */
2246 if (PL_curinterp != aTHX)
2250 act.sa_handler = handler;
2251 sigemptyset(&act.sa_mask);
2254 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2255 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2257 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2258 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2259 act.sa_flags |= SA_NOCLDWAIT;
2261 return sigaction(signo, &act, save);
2265 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2268 /* only "parent" interpreter can diddle signals */
2269 if (PL_curinterp != aTHX)
2273 return sigaction(signo, save, (struct sigaction *)NULL);
2276 #else /* !HAS_SIGACTION */
2279 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2281 #if defined(USE_ITHREADS) && !defined(WIN32)
2282 /* only "parent" interpreter can diddle signals */
2283 if (PL_curinterp != aTHX)
2287 return PerlProc_signal(signo, handler);
2290 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2291 ignore the implications of this for threading */
2301 Perl_rsignal_state(pTHX_ int signo)
2303 Sighandler_t oldsig;
2305 #if defined(USE_ITHREADS) && !defined(WIN32)
2306 /* only "parent" interpreter can diddle signals */
2307 if (PL_curinterp != aTHX)
2312 oldsig = PerlProc_signal(signo, sig_trap);
2313 PerlProc_signal(signo, oldsig);
2315 PerlProc_kill(PerlProc_getpid(), signo);
2320 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2322 #if defined(USE_ITHREADS) && !defined(WIN32)
2323 /* only "parent" interpreter can diddle signals */
2324 if (PL_curinterp != aTHX)
2327 *save = PerlProc_signal(signo, handler);
2328 return (*save == SIG_ERR) ? -1 : 0;
2332 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2334 #if defined(USE_ITHREADS) && !defined(WIN32)
2335 /* only "parent" interpreter can diddle signals */
2336 if (PL_curinterp != aTHX)
2339 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2342 #endif /* !HAS_SIGACTION */
2343 #endif /* !PERL_MICRO */
2345 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2346 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2348 Perl_my_pclose(pTHX_ PerlIO *ptr)
2350 Sigsave_t hstat, istat, qstat;
2356 int saved_errno = 0;
2358 int saved_vaxc_errno;
2361 int saved_win32_errno;
2365 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2367 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2369 *svp = &PL_sv_undef;
2371 if (pid == -1) { /* Opened by popen. */
2372 return my_syspclose(ptr);
2375 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2376 saved_errno = errno;
2378 saved_vaxc_errno = vaxc$errno;
2381 saved_win32_errno = GetLastError();
2385 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2388 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2389 rsignal_save(SIGINT, SIG_IGN, &istat);
2390 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2393 pid2 = wait4pid(pid, &status, 0);
2394 } while (pid2 == -1 && errno == EINTR);
2396 rsignal_restore(SIGHUP, &hstat);
2397 rsignal_restore(SIGINT, &istat);
2398 rsignal_restore(SIGQUIT, &qstat);
2401 SETERRNO(saved_errno, saved_vaxc_errno);
2404 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2406 #endif /* !DOSISH */
2408 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2410 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2415 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2419 char spid[TYPE_CHARS(int)];
2422 sprintf(spid, "%"IVdf, (IV)pid);
2423 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2424 if (svp && *svp != &PL_sv_undef) {
2425 *statusp = SvIVX(*svp);
2426 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2433 hv_iterinit(PL_pidstatus);
2434 if ((entry = hv_iternext(PL_pidstatus))) {
2436 char spid[TYPE_CHARS(int)];
2438 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2439 sv = hv_iterval(PL_pidstatus,entry);
2440 *statusp = SvIVX(sv);
2441 sprintf(spid, "%"IVdf, (IV)pid);
2442 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2449 # ifdef HAS_WAITPID_RUNTIME
2450 if (!HAS_WAITPID_RUNTIME)
2453 result = PerlProc_waitpid(pid,statusp,flags);
2456 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2457 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2460 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2464 Perl_croak(aTHX_ "Can't do waitpid with flags");
2466 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2467 pidgone(result,*statusp);
2474 if (result < 0 && errno == EINTR) {
2479 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2483 Perl_pidgone(pTHX_ Pid_t pid, int status)
2486 char spid[TYPE_CHARS(int)];
2488 sprintf(spid, "%"IVdf, (IV)pid);
2489 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2490 (void)SvUPGRADE(sv,SVt_IV);
2495 #if defined(atarist) || defined(OS2) || defined(EPOC)
2498 int /* Cannot prototype with I32
2500 my_syspclose(PerlIO *ptr)
2503 Perl_my_pclose(pTHX_ PerlIO *ptr)
2506 /* Needs work for PerlIO ! */
2507 FILE *f = PerlIO_findFILE(ptr);
2508 I32 result = pclose(f);
2509 PerlIO_releaseFILE(ptr,f);
2517 Perl_my_pclose(pTHX_ PerlIO *ptr)
2519 /* Needs work for PerlIO ! */
2520 FILE *f = PerlIO_findFILE(ptr);
2521 I32 result = djgpp_pclose(f);
2522 result = (result << 8) & 0xff00;
2523 PerlIO_releaseFILE(ptr,f);
2529 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2532 register const char *frombase = from;
2535 register const char c = *from;
2540 while (count-- > 0) {
2541 for (todo = len; todo > 0; todo--) {
2550 Perl_same_dirent(pTHX_ char *a, char *b)
2552 char *fa = strrchr(a,'/');
2553 char *fb = strrchr(b,'/');
2556 SV *tmpsv = sv_newmortal();
2569 sv_setpv(tmpsv, ".");
2571 sv_setpvn(tmpsv, a, fa - a);
2572 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2575 sv_setpv(tmpsv, ".");
2577 sv_setpvn(tmpsv, b, fb - b);
2578 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2580 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2581 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2583 #endif /* !HAS_RENAME */
2586 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2588 char *xfound = Nullch;
2589 char *xfailed = Nullch;
2590 char tmpbuf[MAXPATHLEN];
2594 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2595 # define SEARCH_EXTS ".bat", ".cmd", NULL
2596 # define MAX_EXT_LEN 4
2599 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2600 # define MAX_EXT_LEN 4
2603 # define SEARCH_EXTS ".pl", ".com", NULL
2604 # define MAX_EXT_LEN 4
2606 /* additional extensions to try in each dir if scriptname not found */
2608 char *exts[] = { SEARCH_EXTS };
2609 char **ext = search_ext ? search_ext : exts;
2610 int extidx = 0, i = 0;
2611 char *curext = Nullch;
2613 # define MAX_EXT_LEN 0
2617 * If dosearch is true and if scriptname does not contain path
2618 * delimiters, search the PATH for scriptname.
2620 * If SEARCH_EXTS is also defined, will look for each
2621 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2622 * while searching the PATH.
2624 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2625 * proceeds as follows:
2626 * If DOSISH or VMSISH:
2627 * + look for ./scriptname{,.foo,.bar}
2628 * + search the PATH for scriptname{,.foo,.bar}
2631 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2632 * this will not look in '.' if it's not in the PATH)
2637 # ifdef ALWAYS_DEFTYPES
2638 len = strlen(scriptname);
2639 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2640 int hasdir, idx = 0, deftypes = 1;
2643 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2646 int hasdir, idx = 0, deftypes = 1;
2649 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2651 /* The first time through, just add SEARCH_EXTS to whatever we
2652 * already have, so we can check for default file types. */
2654 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2660 if ((strlen(tmpbuf) + strlen(scriptname)
2661 + MAX_EXT_LEN) >= sizeof tmpbuf)
2662 continue; /* don't search dir with too-long name */
2663 strcat(tmpbuf, scriptname);
2667 if (strEQ(scriptname, "-"))
2669 if (dosearch) { /* Look in '.' first. */
2670 char *cur = scriptname;
2672 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2674 if (strEQ(ext[i++],curext)) {
2675 extidx = -1; /* already has an ext */
2680 DEBUG_p(PerlIO_printf(Perl_debug_log,
2681 "Looking for %s\n",cur));
2682 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2683 && !S_ISDIR(PL_statbuf.st_mode)) {
2691 if (cur == scriptname) {
2692 len = strlen(scriptname);
2693 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2695 cur = strcpy(tmpbuf, scriptname);
2697 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2698 && strcpy(tmpbuf+len, ext[extidx++]));
2703 #ifdef MACOS_TRADITIONAL
2704 if (dosearch && !strchr(scriptname, ':') &&
2705 (s = PerlEnv_getenv("Commands")))
2707 if (dosearch && !strchr(scriptname, '/')
2709 && !strchr(scriptname, '\\')
2711 && (s = PerlEnv_getenv("PATH")))
2716 PL_bufend = s + strlen(s);
2717 while (s < PL_bufend) {
2718 #ifdef MACOS_TRADITIONAL
2719 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2723 #if defined(atarist) || defined(DOSISH)
2728 && *s != ';'; len++, s++) {
2729 if (len < sizeof tmpbuf)
2732 if (len < sizeof tmpbuf)
2734 #else /* ! (atarist || DOSISH) */
2735 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2738 #endif /* ! (atarist || DOSISH) */
2739 #endif /* MACOS_TRADITIONAL */
2742 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2743 continue; /* don't search dir with too-long name */
2744 #ifdef MACOS_TRADITIONAL
2745 if (len && tmpbuf[len - 1] != ':')
2746 tmpbuf[len++] = ':';
2749 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2750 && tmpbuf[len - 1] != '/'
2751 && tmpbuf[len - 1] != '\\'
2754 tmpbuf[len++] = '/';
2755 if (len == 2 && tmpbuf[0] == '.')
2758 (void)strcpy(tmpbuf + len, scriptname);
2762 len = strlen(tmpbuf);
2763 if (extidx > 0) /* reset after previous loop */
2767 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2768 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2769 if (S_ISDIR(PL_statbuf.st_mode)) {
2773 } while ( retval < 0 /* not there */
2774 && extidx>=0 && ext[extidx] /* try an extension? */
2775 && strcpy(tmpbuf+len, ext[extidx++])
2780 if (S_ISREG(PL_statbuf.st_mode)
2781 && cando(S_IRUSR,TRUE,&PL_statbuf)
2782 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2783 && cando(S_IXUSR,TRUE,&PL_statbuf)
2787 xfound = tmpbuf; /* bingo! */
2791 xfailed = savepv(tmpbuf);
2794 if (!xfound && !seen_dot && !xfailed &&
2795 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2796 || S_ISDIR(PL_statbuf.st_mode)))
2798 seen_dot = 1; /* Disable message. */
2800 if (flags & 1) { /* do or die? */
2801 Perl_croak(aTHX_ "Can't %s %s%s%s",
2802 (xfailed ? "execute" : "find"),
2803 (xfailed ? xfailed : scriptname),
2804 (xfailed ? "" : " on PATH"),
2805 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2807 scriptname = Nullch;
2811 scriptname = xfound;
2813 return (scriptname ? savepv(scriptname) : Nullch);
2816 #ifndef PERL_GET_CONTEXT_DEFINED
2819 Perl_get_context(void)
2821 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2822 # ifdef OLD_PTHREADS_API
2824 if (pthread_getspecific(PL_thr_key, &t))
2825 Perl_croak_nocontext("panic: pthread_getspecific");
2828 # ifdef I_MACH_CTHREADS
2829 return (void*)cthread_data(cthread_self());
2831 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2840 Perl_set_context(void *t)
2842 #if defined(USE_5005THREADS) || defined(USE_ITHREADS)
2843 # ifdef I_MACH_CTHREADS
2844 cthread_set_data(cthread_self(), t);
2846 if (pthread_setspecific(PL_thr_key, t))
2847 Perl_croak_nocontext("panic: pthread_setspecific");
2852 #endif /* !PERL_GET_CONTEXT_DEFINED */
2854 #ifdef USE_5005THREADS
2857 /* Very simplistic scheduler for now */
2861 thr = thr->i.next_run;
2865 Perl_cond_init(pTHX_ perl_cond *cp)
2871 Perl_cond_signal(pTHX_ perl_cond *cp)
2874 perl_cond cond = *cp;
2879 /* Insert t in the runnable queue just ahead of us */
2880 t->i.next_run = thr->i.next_run;
2881 thr->i.next_run->i.prev_run = t;
2882 t->i.prev_run = thr;
2883 thr->i.next_run = t;
2884 thr->i.wait_queue = 0;
2885 /* Remove from the wait queue */
2891 Perl_cond_broadcast(pTHX_ perl_cond *cp)
2894 perl_cond cond, cond_next;
2896 for (cond = *cp; cond; cond = cond_next) {
2898 /* Insert t in the runnable queue just ahead of us */
2899 t->i.next_run = thr->i.next_run;
2900 thr->i.next_run->i.prev_run = t;
2901 t->i.prev_run = thr;
2902 thr->i.next_run = t;
2903 thr->i.wait_queue = 0;
2904 /* Remove from the wait queue */
2905 cond_next = cond->next;
2912 Perl_cond_wait(pTHX_ perl_cond *cp)
2916 if (thr->i.next_run == thr)
2917 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
2919 New(666, cond, 1, struct perl_wait_queue);
2923 thr->i.wait_queue = cond;
2924 /* Remove ourselves from runnable queue */
2925 thr->i.next_run->i.prev_run = thr->i.prev_run;
2926 thr->i.prev_run->i.next_run = thr->i.next_run;
2928 #endif /* FAKE_THREADS */
2931 Perl_condpair_magic(pTHX_ SV *sv)
2935 (void)SvUPGRADE(sv, SVt_PVMG);
2936 mg = mg_find(sv, PERL_MAGIC_mutex);
2940 New(53, cp, 1, condpair_t);
2941 MUTEX_INIT(&cp->mutex);
2942 COND_INIT(&cp->owner_cond);
2943 COND_INIT(&cp->cond);
2945 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
2946 mg = mg_find(sv, PERL_MAGIC_mutex);
2948 /* someone else beat us to initialising it */
2949 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2950 MUTEX_DESTROY(&cp->mutex);
2951 COND_DESTROY(&cp->owner_cond);
2952 COND_DESTROY(&cp->cond);
2956 sv_magic(sv, Nullsv, PERL_MAGIC_mutex, 0, 0);
2958 mg->mg_ptr = (char *)cp;
2959 mg->mg_len = sizeof(cp);
2960 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
2961 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
2962 "%p: condpair_magic %p\n", thr, sv)));
2969 Perl_sv_lock(pTHX_ SV *osv)
2979 mg = condpair_magic(sv);
2980 MUTEX_LOCK(MgMUTEXP(mg));
2981 if (MgOWNER(mg) == thr)
2982 MUTEX_UNLOCK(MgMUTEXP(mg));
2985 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2987 DEBUG_S(PerlIO_printf(Perl_debug_log,
2988 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
2989 PTR2UV(thr), PTR2UV(sv)));
2990 MUTEX_UNLOCK(MgMUTEXP(mg));
2991 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2993 UNLOCK_SV_LOCK_MUTEX;
2998 * Make a new perl thread structure using t as a prototype. Some of the
2999 * fields for the new thread are copied from the prototype thread, t,
3000 * so t should not be running in perl at the time this function is
3001 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
3002 * thread calling new_struct_thread) clearly satisfies this constraint.
3004 struct perl_thread *
3005 Perl_new_struct_thread(pTHX_ struct perl_thread *t)
3007 #if !defined(PERL_IMPLICIT_CONTEXT)
3008 struct perl_thread *thr;
3014 sv = newSVpvn("", 0);
3015 SvGROW(sv, sizeof(struct perl_thread) + 1);
3016 SvCUR_set(sv, sizeof(struct perl_thread));
3017 thr = (Thread) SvPVX(sv);
3019 Poison(thr, 1, struct perl_thread);
3026 Zero(&PL_hv_fetch_ent_mh, 1, HE);
3027 PL_efloatbuf = (char*)NULL;
3030 Zero(thr, 1, struct perl_thread);
3036 PL_curcop = &PL_compiling;
3037 thr->interp = t->interp;
3038 thr->cvcache = newHV();
3039 thr->threadsv = newAV();
3040 thr->specific = newAV();
3041 thr->errsv = newSVpvn("", 0);
3042 thr->flags = THRf_R_JOINABLE;
3044 MUTEX_INIT(&thr->mutex);
3048 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
3051 PL_statname = NEWSV(66,0);
3052 PL_errors = newSVpvn("", 0);
3054 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3055 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3056 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3057 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3058 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
3060 PL_reginterp_cnt = 0;
3061 PL_lastscream = Nullsv;
3064 PL_reg_start_tmp = 0;
3065 PL_reg_start_tmpl = 0;
3066 PL_reg_poscache = Nullch;
3068 PL_peepp = MEMBER_TO_FPTR(Perl_peep);
3070 /* parent thread's data needs to be locked while we make copy */
3071 MUTEX_LOCK(&t->mutex);
3073 #ifdef PERL_FLEXIBLE_EXCEPTIONS
3074 PL_protect = t->Tprotect;
3077 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3078 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3079 PL_curstash = t->Tcurstash; /* always be set to main? */
3081 PL_tainted = t->Ttainted;
3082 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
3083 PL_rs = newSVsv(t->Trs);
3084 PL_last_in_gv = Nullgv;
3085 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
3086 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3087 PL_chopset = t->Tchopset;
3088 PL_bodytarget = newSVsv(t->Tbodytarget);
3089 PL_toptarget = newSVsv(t->Ttoptarget);
3090 if (t->Tformtarget == t->Ttoptarget)
3091 PL_formtarget = PL_toptarget;
3093 PL_formtarget = PL_bodytarget;
3094 PL_watchaddr = 0; /* XXX */
3095 PL_watchok = 0; /* XXX */
3099 /* Initialise all per-thread SVs that the template thread used */
3100 svp = AvARRAY(t->threadsv);
3101 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
3102 if (*svp && *svp != &PL_sv_undef) {
3103 SV *sv = newSVsv(*svp);
3104 av_store(thr->threadsv, i, sv);
3105 sv_magic(sv, 0, PERL_MAGIC_sv, &PL_threadsv_names[i], 1);
3106 DEBUG_S(PerlIO_printf(Perl_debug_log,
3107 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
3111 thr->threadsvp = AvARRAY(thr->threadsv);
3113 MUTEX_LOCK(&PL_threads_mutex);
3115 thr->tid = ++PL_threadnum;
3116 thr->next = t->next;
3119 thr->next->prev = thr;
3120 MUTEX_UNLOCK(&PL_threads_mutex);
3122 /* done copying parent's state */
3123 MUTEX_UNLOCK(&t->mutex);
3125 #ifdef HAVE_THREAD_INTERN
3126 Perl_init_thread_intern(thr);
3127 #endif /* HAVE_THREAD_INTERN */
3130 #endif /* USE_5005THREADS */
3132 #ifdef PERL_GLOBAL_STRUCT
3141 Perl_get_op_names(pTHX)
3147 Perl_get_op_descs(pTHX)
3153 Perl_get_no_modify(pTHX)
3155 return (char*)PL_no_modify;
3159 Perl_get_opargs(pTHX)
3165 Perl_get_ppaddr(pTHX)
3167 return (PPADDR_t*)PL_ppaddr;
3170 #ifndef HAS_GETENV_LEN
3172 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3174 char *env_trans = PerlEnv_getenv(env_elem);
3176 *len = strlen(env_trans);
3183 Perl_get_vtbl(pTHX_ int vtbl_id)
3185 MGVTBL* result = Null(MGVTBL*);
3189 result = &PL_vtbl_sv;
3192 result = &PL_vtbl_env;
3194 case want_vtbl_envelem:
3195 result = &PL_vtbl_envelem;
3198 result = &PL_vtbl_sig;
3200 case want_vtbl_sigelem:
3201 result = &PL_vtbl_sigelem;
3203 case want_vtbl_pack:
3204 result = &PL_vtbl_pack;
3206 case want_vtbl_packelem:
3207 result = &PL_vtbl_packelem;
3209 case want_vtbl_dbline:
3210 result = &PL_vtbl_dbline;
3213 result = &PL_vtbl_isa;
3215 case want_vtbl_isaelem:
3216 result = &PL_vtbl_isaelem;
3218 case want_vtbl_arylen:
3219 result = &PL_vtbl_arylen;
3221 case want_vtbl_glob:
3222 result = &PL_vtbl_glob;
3224 case want_vtbl_mglob:
3225 result = &PL_vtbl_mglob;
3227 case want_vtbl_nkeys:
3228 result = &PL_vtbl_nkeys;
3230 case want_vtbl_taint:
3231 result = &PL_vtbl_taint;
3233 case want_vtbl_substr:
3234 result = &PL_vtbl_substr;
3237 result = &PL_vtbl_vec;
3240 result = &PL_vtbl_pos;
3243 result = &PL_vtbl_bm;
3246 result = &PL_vtbl_fm;
3248 case want_vtbl_uvar:
3249 result = &PL_vtbl_uvar;
3251 #ifdef USE_5005THREADS
3252 case want_vtbl_mutex:
3253 result = &PL_vtbl_mutex;
3256 case want_vtbl_defelem:
3257 result = &PL_vtbl_defelem;
3259 case want_vtbl_regexp:
3260 result = &PL_vtbl_regexp;
3262 case want_vtbl_regdata:
3263 result = &PL_vtbl_regdata;
3265 case want_vtbl_regdatum:
3266 result = &PL_vtbl_regdatum;
3268 #ifdef USE_LOCALE_COLLATE
3269 case want_vtbl_collxfrm:
3270 result = &PL_vtbl_collxfrm;
3273 case want_vtbl_amagic:
3274 result = &PL_vtbl_amagic;
3276 case want_vtbl_amagicelem:
3277 result = &PL_vtbl_amagicelem;
3279 case want_vtbl_backref:
3280 result = &PL_vtbl_backref;
3282 case want_vtbl_utf8:
3283 result = &PL_vtbl_utf8;
3290 Perl_my_fflush_all(pTHX)
3292 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3293 return PerlIO_flush(NULL);
3295 # if defined(HAS__FWALK)
3296 extern int fflush(FILE *);
3297 /* undocumented, unprototyped, but very useful BSDism */
3298 extern void _fwalk(int (*)(FILE *));
3302 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3304 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3305 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3307 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3308 open_max = sysconf(_SC_OPEN_MAX);
3311 open_max = FOPEN_MAX;
3314 open_max = OPEN_MAX;
3325 for (i = 0; i < open_max; i++)
3326 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3327 STDIO_STREAM_ARRAY[i]._file < open_max &&
3328 STDIO_STREAM_ARRAY[i]._flag)
3329 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3333 SETERRNO(EBADF,RMS_IFI);
3340 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3343 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3344 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3346 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3347 char *type = OP_IS_SOCKET(op)
3348 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3349 ? "socket" : "filehandle";
3352 if (gv && isGV(gv)) {
3356 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3357 if (ckWARN(WARN_IO)) {
3358 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3360 Perl_warner(aTHX_ packWARN(WARN_IO),
3361 "Filehandle %s opened only for %sput",
3364 Perl_warner(aTHX_ packWARN(WARN_IO),
3365 "Filehandle opened only for %sput", direction);
3372 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3374 warn_type = WARN_CLOSED;
3378 warn_type = WARN_UNOPENED;
3381 if (ckWARN(warn_type)) {
3382 if (name && *name) {
3383 Perl_warner(aTHX_ packWARN(warn_type),
3384 "%s%s on %s %s %s", func, pars, vile, type, name);
3385 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3387 aTHX_ packWARN(warn_type),
3388 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3393 Perl_warner(aTHX_ packWARN(warn_type),
3394 "%s%s on %s %s", func, pars, vile, type);
3395 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3397 aTHX_ packWARN(warn_type),
3398 "\t(Are you trying to call %s%s on dirhandle?)\n",
3407 /* in ASCII order, not that it matters */
3408 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3411 Perl_ebcdic_control(pTHX_ int ch)
3419 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3420 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3423 if (ctlp == controllablechars)
3424 return('\177'); /* DEL */
3426 return((unsigned char)(ctlp - controllablechars - 1));
3427 } else { /* Want uncontrol */
3428 if (ch == '\177' || ch == -1)
3430 else if (ch == '\157')
3432 else if (ch == '\174')
3434 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3436 else if (ch == '\155')
3438 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3439 return(controllablechars[ch+1]);
3441 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3446 /* To workaround core dumps from the uninitialised tm_zone we get the
3447 * system to give us a reasonable struct to copy. This fix means that
3448 * strftime uses the tm_zone and tm_gmtoff values returned by
3449 * localtime(time()). That should give the desired result most of the
3450 * time. But probably not always!
3452 * This does not address tzname aspects of NETaa14816.
3457 # ifndef STRUCT_TM_HASZONE
3458 # define STRUCT_TM_HASZONE
3462 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3463 # ifndef HAS_TM_TM_ZONE
3464 # define HAS_TM_TM_ZONE
3469 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3471 #ifdef HAS_TM_TM_ZONE
3474 Copy(localtime(&now), ptm, 1, struct tm);
3479 * mini_mktime - normalise struct tm values without the localtime()
3480 * semantics (and overhead) of mktime().
3483 Perl_mini_mktime(pTHX_ struct tm *ptm)
3487 int month, mday, year, jday;
3488 int odd_cent, odd_year;
3490 #define DAYS_PER_YEAR 365
3491 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3492 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3493 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3494 #define SECS_PER_HOUR (60*60)
3495 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3496 /* parentheses deliberately absent on these two, otherwise they don't work */
3497 #define MONTH_TO_DAYS 153/5
3498 #define DAYS_TO_MONTH 5/153
3499 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3500 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3501 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3502 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3505 * Year/day algorithm notes:
3507 * With a suitable offset for numeric value of the month, one can find
3508 * an offset into the year by considering months to have 30.6 (153/5) days,
3509 * using integer arithmetic (i.e., with truncation). To avoid too much
3510 * messing about with leap days, we consider January and February to be
3511 * the 13th and 14th month of the previous year. After that transformation,
3512 * we need the month index we use to be high by 1 from 'normal human' usage,
3513 * so the month index values we use run from 4 through 15.
3515 * Given that, and the rules for the Gregorian calendar (leap years are those
3516 * divisible by 4 unless also divisible by 100, when they must be divisible
3517 * by 400 instead), we can simply calculate the number of days since some
3518 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3519 * the days we derive from our month index, and adding in the day of the
3520 * month. The value used here is not adjusted for the actual origin which
3521 * it normally would use (1 January A.D. 1), since we're not exposing it.
3522 * We're only building the value so we can turn around and get the
3523 * normalised values for the year, month, day-of-month, and day-of-year.
3525 * For going backward, we need to bias the value we're using so that we find
3526 * the right year value. (Basically, we don't want the contribution of
3527 * March 1st to the number to apply while deriving the year). Having done
3528 * that, we 'count up' the contribution to the year number by accounting for
3529 * full quadracenturies (400-year periods) with their extra leap days, plus
3530 * the contribution from full centuries (to avoid counting in the lost leap
3531 * days), plus the contribution from full quad-years (to count in the normal
3532 * leap days), plus the leftover contribution from any non-leap years.
3533 * At this point, if we were working with an actual leap day, we'll have 0
3534 * days left over. This is also true for March 1st, however. So, we have
3535 * to special-case that result, and (earlier) keep track of the 'odd'
3536 * century and year contributions. If we got 4 extra centuries in a qcent,
3537 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3538 * Otherwise, we add back in the earlier bias we removed (the 123 from
3539 * figuring in March 1st), find the month index (integer division by 30.6),
3540 * and the remainder is the day-of-month. We then have to convert back to
3541 * 'real' months (including fixing January and February from being 14/15 in
3542 * the previous year to being in the proper year). After that, to get
3543 * tm_yday, we work with the normalised year and get a new yearday value for
3544 * January 1st, which we subtract from the yearday value we had earlier,
3545 * representing the date we've re-built. This is done from January 1
3546 * because tm_yday is 0-origin.
3548 * Since POSIX time routines are only guaranteed to work for times since the
3549 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3550 * applies Gregorian calendar rules even to dates before the 16th century
3551 * doesn't bother me. Besides, you'd need cultural context for a given
3552 * date to know whether it was Julian or Gregorian calendar, and that's
3553 * outside the scope for this routine. Since we convert back based on the
3554 * same rules we used to build the yearday, you'll only get strange results
3555 * for input which needed normalising, or for the 'odd' century years which
3556 * were leap years in the Julian calander but not in the Gregorian one.
3557 * I can live with that.
3559 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3560 * that's still outside the scope for POSIX time manipulation, so I don't
3564 year = 1900 + ptm->tm_year;
3565 month = ptm->tm_mon;
3566 mday = ptm->tm_mday;
3567 /* allow given yday with no month & mday to dominate the result */
3568 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3571 jday = 1 + ptm->tm_yday;
3580 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3581 yearday += month*MONTH_TO_DAYS + mday + jday;
3583 * Note that we don't know when leap-seconds were or will be,
3584 * so we have to trust the user if we get something which looks
3585 * like a sensible leap-second. Wild values for seconds will
3586 * be rationalised, however.
3588 if ((unsigned) ptm->tm_sec <= 60) {
3595 secs += 60 * ptm->tm_min;
3596 secs += SECS_PER_HOUR * ptm->tm_hour;
3598 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3599 /* got negative remainder, but need positive time */
3600 /* back off an extra day to compensate */
3601 yearday += (secs/SECS_PER_DAY)-1;
3602 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3605 yearday += (secs/SECS_PER_DAY);
3606 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3609 else if (secs >= SECS_PER_DAY) {
3610 yearday += (secs/SECS_PER_DAY);
3611 secs %= SECS_PER_DAY;
3613 ptm->tm_hour = secs/SECS_PER_HOUR;
3614 secs %= SECS_PER_HOUR;
3615 ptm->tm_min = secs/60;
3617 ptm->tm_sec += secs;
3618 /* done with time of day effects */
3620 * The algorithm for yearday has (so far) left it high by 428.
3621 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3622 * bias it by 123 while trying to figure out what year it
3623 * really represents. Even with this tweak, the reverse
3624 * translation fails for years before A.D. 0001.
3625 * It would still fail for Feb 29, but we catch that one below.
3627 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3628 yearday -= YEAR_ADJUST;
3629 year = (yearday / DAYS_PER_QCENT) * 400;
3630 yearday %= DAYS_PER_QCENT;
3631 odd_cent = yearday / DAYS_PER_CENT;
3632 year += odd_cent * 100;
3633 yearday %= DAYS_PER_CENT;
3634 year += (yearday / DAYS_PER_QYEAR) * 4;
3635 yearday %= DAYS_PER_QYEAR;
3636 odd_year = yearday / DAYS_PER_YEAR;
3638 yearday %= DAYS_PER_YEAR;
3639 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3644 yearday += YEAR_ADJUST; /* recover March 1st crock */
3645 month = yearday*DAYS_TO_MONTH;
3646 yearday -= month*MONTH_TO_DAYS;
3647 /* recover other leap-year adjustment */
3656 ptm->tm_year = year - 1900;
3658 ptm->tm_mday = yearday;
3659 ptm->tm_mon = month;
3663 ptm->tm_mon = month - 1;
3665 /* re-build yearday based on Jan 1 to get tm_yday */
3667 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3668 yearday += 14*MONTH_TO_DAYS + 1;
3669 ptm->tm_yday = jday - yearday;
3670 /* fix tm_wday if not overridden by caller */
3671 if ((unsigned)ptm->tm_wday > 6)
3672 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3676 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3684 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3687 mytm.tm_hour = hour;
3688 mytm.tm_mday = mday;
3690 mytm.tm_year = year;
3691 mytm.tm_wday = wday;
3692 mytm.tm_yday = yday;
3693 mytm.tm_isdst = isdst;
3695 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3696 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3701 #ifdef HAS_TM_TM_GMTOFF
3702 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3704 #ifdef HAS_TM_TM_ZONE
3705 mytm.tm_zone = mytm2.tm_zone;
3710 New(0, buf, buflen, char);
3711 len = strftime(buf, buflen, fmt, &mytm);
3713 ** The following is needed to handle to the situation where
3714 ** tmpbuf overflows. Basically we want to allocate a buffer
3715 ** and try repeatedly. The reason why it is so complicated
3716 ** is that getting a return value of 0 from strftime can indicate
3717 ** one of the following:
3718 ** 1. buffer overflowed,
3719 ** 2. illegal conversion specifier, or
3720 ** 3. the format string specifies nothing to be returned(not
3721 ** an error). This could be because format is an empty string
3722 ** or it specifies %p that yields an empty string in some locale.
3723 ** If there is a better way to make it portable, go ahead by
3726 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3729 /* Possibly buf overflowed - try again with a bigger buf */
3730 int fmtlen = strlen(fmt);
3731 int bufsize = fmtlen + buflen;
3733 New(0, buf, bufsize, char);
3735 buflen = strftime(buf, bufsize, fmt, &mytm);
3736 if (buflen > 0 && buflen < bufsize)
3738 /* heuristic to prevent out-of-memory errors */
3739 if (bufsize > 100*fmtlen) {
3745 Renew(buf, bufsize, char);
3750 Perl_croak(aTHX_ "panic: no strftime");
3755 #define SV_CWD_RETURN_UNDEF \
3756 sv_setsv(sv, &PL_sv_undef); \
3759 #define SV_CWD_ISDOT(dp) \
3760 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3761 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3764 =head1 Miscellaneous Functions
3766 =for apidoc getcwd_sv
3768 Fill the sv with current working directory
3773 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3774 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3775 * getcwd(3) if available
3776 * Comments from the orignal:
3777 * This is a faster version of getcwd. It's also more dangerous
3778 * because you might chdir out of a directory that you can't chdir
3782 Perl_getcwd_sv(pTHX_ register SV *sv)
3786 #ifndef INCOMPLETE_TAINTS
3792 char buf[MAXPATHLEN];
3794 /* Some getcwd()s automatically allocate a buffer of the given
3795 * size from the heap if they are given a NULL buffer pointer.
3796 * The problem is that this behaviour is not portable. */
3797 if (getcwd(buf, sizeof(buf) - 1)) {
3798 STRLEN len = strlen(buf);
3799 sv_setpvn(sv, buf, len);
3803 sv_setsv(sv, &PL_sv_undef);
3811 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3812 int namelen, pathlen=0;
3816 (void)SvUPGRADE(sv, SVt_PV);
3818 if (PerlLIO_lstat(".", &statbuf) < 0) {
3819 SV_CWD_RETURN_UNDEF;
3822 orig_cdev = statbuf.st_dev;
3823 orig_cino = statbuf.st_ino;
3831 if (PerlDir_chdir("..") < 0) {
3832 SV_CWD_RETURN_UNDEF;
3834 if (PerlLIO_stat(".", &statbuf) < 0) {
3835 SV_CWD_RETURN_UNDEF;
3838 cdev = statbuf.st_dev;
3839 cino = statbuf.st_ino;
3841 if (odev == cdev && oino == cino) {
3844 if (!(dir = PerlDir_open("."))) {
3845 SV_CWD_RETURN_UNDEF;
3848 while ((dp = PerlDir_read(dir)) != NULL) {
3850 namelen = dp->d_namlen;
3852 namelen = strlen(dp->d_name);
3855 if (SV_CWD_ISDOT(dp)) {
3859 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3860 SV_CWD_RETURN_UNDEF;
3863 tdev = statbuf.st_dev;
3864 tino = statbuf.st_ino;
3865 if (tino == oino && tdev == odev) {
3871 SV_CWD_RETURN_UNDEF;
3874 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3875 SV_CWD_RETURN_UNDEF;
3878 SvGROW(sv, pathlen + namelen + 1);
3882 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3885 /* prepend current directory to the front */
3887 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3888 pathlen += (namelen + 1);
3890 #ifdef VOID_CLOSEDIR
3893 if (PerlDir_close(dir) < 0) {
3894 SV_CWD_RETURN_UNDEF;
3900 SvCUR_set(sv, pathlen);
3904 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3905 SV_CWD_RETURN_UNDEF;
3908 if (PerlLIO_stat(".", &statbuf) < 0) {
3909 SV_CWD_RETURN_UNDEF;
3912 cdev = statbuf.st_dev;
3913 cino = statbuf.st_ino;
3915 if (cdev != orig_cdev || cino != orig_cino) {
3916 Perl_croak(aTHX_ "Unstable directory path, "
3917 "current directory changed unexpectedly");
3928 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
3929 # define EMULATE_SOCKETPAIR_UDP
3932 #ifdef EMULATE_SOCKETPAIR_UDP
3934 S_socketpair_udp (int fd[2]) {
3936 /* Fake a datagram socketpair using UDP to localhost. */
3937 int sockets[2] = {-1, -1};
3938 struct sockaddr_in addresses[2];
3940 Sock_size_t size = sizeof(struct sockaddr_in);
3941 unsigned short port;
3944 memset(&addresses, 0, sizeof(addresses));
3947 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
3948 if (sockets[i] == -1)
3949 goto tidy_up_and_fail;
3951 addresses[i].sin_family = AF_INET;
3952 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
3953 addresses[i].sin_port = 0; /* kernel choses port. */
3954 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
3955 sizeof(struct sockaddr_in)) == -1)
3956 goto tidy_up_and_fail;
3959 /* Now have 2 UDP sockets. Find out which port each is connected to, and
3960 for each connect the other socket to it. */
3963 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
3965 goto tidy_up_and_fail;
3966 if (size != sizeof(struct sockaddr_in))
3967 goto abort_tidy_up_and_fail;
3968 /* !1 is 0, !0 is 1 */
3969 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
3970 sizeof(struct sockaddr_in)) == -1)
3971 goto tidy_up_and_fail;
3974 /* Now we have 2 sockets connected to each other. I don't trust some other
3975 process not to have already sent a packet to us (by random) so send
3976 a packet from each to the other. */
3979 /* I'm going to send my own port number. As a short.
3980 (Who knows if someone somewhere has sin_port as a bitfield and needs
3981 this routine. (I'm assuming crays have socketpair)) */
3982 port = addresses[i].sin_port;
3983 got = PerlLIO_write(sockets[i], &port, sizeof(port));
3984 if (got != sizeof(port)) {
3986 goto tidy_up_and_fail;
3987 goto abort_tidy_up_and_fail;
3991 /* Packets sent. I don't trust them to have arrived though.
3992 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
3993 connect to localhost will use a second kernel thread. In 2.6 the
3994 first thread running the connect() returns before the second completes,
3995 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
3996 returns 0. Poor programs have tripped up. One poor program's authors'
3997 had a 50-1 reverse stock split. Not sure how connected these were.)
3998 So I don't trust someone not to have an unpredictable UDP stack.
4002 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4003 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4007 FD_SET(sockets[0], &rset);
4008 FD_SET(sockets[1], &rset);
4010 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4011 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4012 || !FD_ISSET(sockets[1], &rset)) {
4013 /* I hope this is portable and appropriate. */
4015 goto tidy_up_and_fail;
4016 goto abort_tidy_up_and_fail;
4020 /* And the paranoia department even now doesn't trust it to have arrive
4021 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4023 struct sockaddr_in readfrom;
4024 unsigned short buffer[2];
4029 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4030 sizeof(buffer), MSG_DONTWAIT,
4031 (struct sockaddr *) &readfrom, &size);
4033 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4035 (struct sockaddr *) &readfrom, &size);
4039 goto tidy_up_and_fail;
4040 if (got != sizeof(port)
4041 || size != sizeof(struct sockaddr_in)
4042 /* Check other socket sent us its port. */
4043 || buffer[0] != (unsigned short) addresses[!i].sin_port
4044 /* Check kernel says we got the datagram from that socket */
4045 || readfrom.sin_family != addresses[!i].sin_family
4046 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4047 || readfrom.sin_port != addresses[!i].sin_port)
4048 goto abort_tidy_up_and_fail;
4051 /* My caller (my_socketpair) has validated that this is non-NULL */
4054 /* I hereby declare this connection open. May God bless all who cross
4058 abort_tidy_up_and_fail:
4059 errno = ECONNABORTED;
4062 int save_errno = errno;
4063 if (sockets[0] != -1)
4064 PerlLIO_close(sockets[0]);
4065 if (sockets[1] != -1)
4066 PerlLIO_close(sockets[1]);
4071 #endif /* EMULATE_SOCKETPAIR_UDP */
4073 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4075 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4076 /* Stevens says that family must be AF_LOCAL, protocol 0.
4077 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4082 struct sockaddr_in listen_addr;
4083 struct sockaddr_in connect_addr;
4088 || family != AF_UNIX
4091 errno = EAFNOSUPPORT;
4099 #ifdef EMULATE_SOCKETPAIR_UDP
4100 if (type == SOCK_DGRAM)
4101 return S_socketpair_udp(fd);
4104 listener = PerlSock_socket(AF_INET, type, 0);
4107 memset(&listen_addr, 0, sizeof(listen_addr));
4108 listen_addr.sin_family = AF_INET;
4109 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4110 listen_addr.sin_port = 0; /* kernel choses port. */
4111 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4112 sizeof(listen_addr)) == -1)
4113 goto tidy_up_and_fail;
4114 if (PerlSock_listen(listener, 1) == -1)
4115 goto tidy_up_and_fail;
4117 connector = PerlSock_socket(AF_INET, type, 0);
4118 if (connector == -1)
4119 goto tidy_up_and_fail;
4120 /* We want to find out the port number to connect to. */
4121 size = sizeof(connect_addr);
4122 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4124 goto tidy_up_and_fail;
4125 if (size != sizeof(connect_addr))
4126 goto abort_tidy_up_and_fail;
4127 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4128 sizeof(connect_addr)) == -1)
4129 goto tidy_up_and_fail;
4131 size = sizeof(listen_addr);
4132 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4135 goto tidy_up_and_fail;
4136 if (size != sizeof(listen_addr))
4137 goto abort_tidy_up_and_fail;
4138 PerlLIO_close(listener);
4139 /* Now check we are talking to ourself by matching port and host on the
4141 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4143 goto tidy_up_and_fail;
4144 if (size != sizeof(connect_addr)
4145 || listen_addr.sin_family != connect_addr.sin_family
4146 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4147 || listen_addr.sin_port != connect_addr.sin_port) {
4148 goto abort_tidy_up_and_fail;
4154 abort_tidy_up_and_fail:
4155 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4158 int save_errno = errno;
4160 PerlLIO_close(listener);
4161 if (connector != -1)
4162 PerlLIO_close(connector);
4164 PerlLIO_close(acceptor);
4170 /* In any case have a stub so that there's code corresponding
4171 * to the my_socketpair in global.sym. */
4173 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4174 #ifdef HAS_SOCKETPAIR
4175 return socketpair(family, type, protocol, fd);
4184 =for apidoc sv_nosharing
4186 Dummy routine which "shares" an SV when there is no sharing module present.
4187 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4188 some level of strict-ness.
4194 Perl_sv_nosharing(pTHX_ SV *sv)
4199 =for apidoc sv_nolocking
4201 Dummy routine which "locks" an SV when there is no locking module present.
4202 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4203 some level of strict-ness.
4209 Perl_sv_nolocking(pTHX_ SV *sv)
4215 =for apidoc sv_nounlocking
4217 Dummy routine which "unlocks" an SV when there is no locking module present.
4218 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4219 some level of strict-ness.
4225 Perl_sv_nounlocking(pTHX_ SV *sv)
4230 Perl_parse_unicode_opts(pTHX_ char **popt)
4237 opt = (U32) atoi(p);
4238 while (isDIGIT(*p)) p++;
4239 if (*p && *p != '\n' && *p != '\r')
4240 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4245 case PERL_UNICODE_STDIN:
4246 opt |= PERL_UNICODE_STDIN_FLAG; break;
4247 case PERL_UNICODE_STDOUT:
4248 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4249 case PERL_UNICODE_STDERR:
4250 opt |= PERL_UNICODE_STDERR_FLAG; break;
4251 case PERL_UNICODE_STD:
4252 opt |= PERL_UNICODE_STD_FLAG; break;
4253 case PERL_UNICODE_IN:
4254 opt |= PERL_UNICODE_IN_FLAG; break;
4255 case PERL_UNICODE_OUT:
4256 opt |= PERL_UNICODE_OUT_FLAG; break;
4257 case PERL_UNICODE_INOUT:
4258 opt |= PERL_UNICODE_INOUT_FLAG; break;
4259 case PERL_UNICODE_LOCALE:
4260 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4261 case PERL_UNICODE_ARGV:
4262 opt |= PERL_UNICODE_ARGV_FLAG; break;
4264 if (*p != '\n' && *p != '\r')
4266 "Unknown Unicode option letter '%c'", *p);
4272 opt = PERL_UNICODE_DEFAULT_FLAGS;
4274 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4275 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4276 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4287 * This is really just a quick hack which grabs various garbage
4288 * values. It really should be a real hash algorithm which
4289 * spreads the effect of every input bit onto every output bit,
4290 * if someone who knows about such things would bother to write it.
4291 * Might be a good idea to add that function to CORE as well.
4292 * No numbers below come from careful analysis or anything here,
4293 * except they are primes and SEED_C1 > 1E6 to get a full-width
4294 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4295 * probably be bigger too.
4298 # define SEED_C1 1000003
4299 #define SEED_C4 73819
4301 # define SEED_C1 25747
4302 #define SEED_C4 20639
4306 #define SEED_C5 26107
4308 #ifndef PERL_NO_DEV_RANDOM
4313 # include <starlet.h>
4314 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4315 * in 100-ns units, typically incremented ever 10 ms. */
4316 unsigned int when[2];
4318 # ifdef HAS_GETTIMEOFDAY
4319 struct timeval when;
4325 /* This test is an escape hatch, this symbol isn't set by Configure. */
4326 #ifndef PERL_NO_DEV_RANDOM
4327 #ifndef PERL_RANDOM_DEVICE
4328 /* /dev/random isn't used by default because reads from it will block
4329 * if there isn't enough entropy available. You can compile with
4330 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4331 * is enough real entropy to fill the seed. */
4332 # define PERL_RANDOM_DEVICE "/dev/urandom"
4334 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4336 if (PerlLIO_read(fd, &u, sizeof u) != sizeof u)
4345 _ckvmssts(sys$gettim(when));
4346 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4348 # ifdef HAS_GETTIMEOFDAY
4349 PerlProc_gettimeofday(&when,NULL);
4350 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4353 u = (U32)SEED_C1 * when;
4356 u += SEED_C3 * (U32)PerlProc_getpid();
4357 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4358 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4359 u += SEED_C5 * (U32)PTR2UV(&when);
4365 Perl_get_hash_seed(pTHX)
4367 char *s = PerlEnv_getenv("PERL_HASH_SEED");
4371 while (isSPACE(*s)) s++;
4372 if (s && isDIGIT(*s))
4373 myseed = (UV)Atoul(s);
4375 #ifdef USE_HASH_SEED_EXPLICIT
4379 /* Compute a random seed */
4380 (void)seedDrand01((Rand_seed_t)seed());
4381 PL_srand_called = TRUE;
4382 myseed = (UV)(Drand01() * (NV)UV_MAX);
4383 #if RANDBITS < (UVSIZE * 8)
4384 /* Since there are not enough randbits to to reach all
4385 * the bits of a UV, the low bits might need extra
4386 * help. Sum in another random number that will
4387 * fill in the low bits. */
4389 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4390 #endif /* RANDBITS < (UVSIZE * 8) */
4392 PL_hash_seed_set = TRUE;