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
23 # define SIG_ERR ((Sighandler_t) -1)
28 # include <sys/wait.h>
33 # include <sys/select.h>
39 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
40 # define FD_CLOEXEC 1 /* NeXT needs this */
43 /* NOTE: Do not call the next three routines directly. Use the macros
44 * in handy.h, so that we can easily redefine everything to do tracking of
45 * allocated hunks back to the original New to track down any memory leaks.
46 * XXX This advice seems to be widely ignored :-( --AD August 1996.
49 /* paranoid version of system's malloc() */
52 Perl_safesysmalloc(MEM_SIZE size)
58 PerlIO_printf(Perl_error_log,
59 "Allocation too large: %lx\n", size) FLUSH;
62 #endif /* HAS_64K_LIMIT */
65 Perl_croak_nocontext("panic: malloc");
67 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
68 PERL_ALLOC_CHECK(ptr);
69 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
75 /* Can't use PerlIO to write as it allocates memory */
76 PerlLIO_write(PerlIO_fileno(Perl_error_log),
77 PL_no_mem, strlen(PL_no_mem));
84 /* paranoid version of system's realloc() */
87 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
91 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
92 Malloc_t PerlMem_realloc();
93 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
97 PerlIO_printf(Perl_error_log,
98 "Reallocation too large: %lx\n", size) FLUSH;
101 #endif /* HAS_64K_LIMIT */
108 return safesysmalloc(size);
111 Perl_croak_nocontext("panic: realloc");
113 ptr = (Malloc_t)PerlMem_realloc(where,size);
114 PERL_ALLOC_CHECK(ptr);
116 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
117 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
124 /* Can't use PerlIO to write as it allocates memory */
125 PerlLIO_write(PerlIO_fileno(Perl_error_log),
126 PL_no_mem, strlen(PL_no_mem));
133 /* safe version of system's free() */
136 Perl_safesysfree(Malloc_t where)
138 #ifdef PERL_IMPLICIT_SYS
141 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
148 /* safe version of system's calloc() */
151 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
157 if (size * count > 0xffff) {
158 PerlIO_printf(Perl_error_log,
159 "Allocation too large: %lx\n", size * count) FLUSH;
162 #endif /* HAS_64K_LIMIT */
164 if ((long)size < 0 || (long)count < 0)
165 Perl_croak_nocontext("panic: calloc");
168 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
169 PERL_ALLOC_CHECK(ptr);
170 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));
172 memset((void*)ptr, 0, size);
178 /* Can't use PerlIO to write as it allocates memory */
179 PerlLIO_write(PerlIO_fileno(Perl_error_log),
180 PL_no_mem, strlen(PL_no_mem));
187 /* These must be defined when not using Perl's malloc for binary
192 Malloc_t Perl_malloc (MEM_SIZE nbytes)
195 return (Malloc_t)PerlMem_malloc(nbytes);
198 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
201 return (Malloc_t)PerlMem_calloc(elements, size);
204 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
207 return (Malloc_t)PerlMem_realloc(where, nbytes);
210 Free_t Perl_mfree (Malloc_t where)
218 /* copy a string up to some (non-backslashed) delimiter, if any */
221 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
224 for (tolen = 0; from < fromend; from++, tolen++) {
226 if (from[1] == delim)
235 else if (*from == delim)
246 /* return ptr to little string in big string, NULL if not found */
247 /* This routine was donated by Corey Satten. */
250 Perl_instr(pTHX_ register const char *big, register const char *little)
252 register const char *s, *x;
263 for (x=big,s=little; *s; /**/ ) {
272 return (char*)(big-1);
277 /* same as instr but allow embedded nulls */
280 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
282 register const char *s, *x;
283 register I32 first = *little;
284 register const char *littleend = lend;
286 if (!first && little >= littleend)
288 if (bigend - big < littleend - little)
290 bigend -= littleend - little++;
291 while (big <= bigend) {
294 for (x=big,s=little; s < littleend; /**/ ) {
301 return (char*)(big-1);
306 /* reverse of the above--find last substring */
309 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
311 register const char *bigbeg;
312 register const char *s, *x;
313 register I32 first = *little;
314 register const char *littleend = lend;
316 if (!first && little >= littleend)
317 return (char*)bigend;
319 big = bigend - (littleend - little++);
320 while (big >= bigbeg) {
323 for (x=big+2,s=little; s < littleend; /**/ ) {
330 return (char*)(big+1);
335 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
337 /* As a space optimization, we do not compile tables for strings of length
338 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
339 special-cased in fbm_instr().
341 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
344 =head1 Miscellaneous Functions
346 =for apidoc fbm_compile
348 Analyses the string in order to make fast searches on it using fbm_instr()
349 -- the Boyer-Moore algorithm.
355 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
364 if (flags & FBMcf_TAIL) {
365 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
366 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
367 if (mg && mg->mg_len >= 0)
370 s = (U8*)SvPV_force(sv, len);
371 (void)SvUPGRADE(sv, SVt_PVBM);
372 if (len == 0) /* TAIL might be on a zero-length string. */
382 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
383 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
384 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
385 memset((void*)table, mlen, 256);
386 table[-1] = (U8)flags;
388 sb = s - mlen + 1; /* first char (maybe) */
390 if (table[*s] == mlen)
395 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
398 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
399 for (i = 0; i < len; i++) {
400 if (PL_freq[s[i]] < frequency) {
402 frequency = PL_freq[s[i]];
405 BmRARE(sv) = s[rarest];
406 BmPREVIOUS(sv) = (U16)rarest;
407 BmUSEFUL(sv) = 100; /* Initial value */
408 if (flags & FBMcf_TAIL)
410 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
411 BmRARE(sv),BmPREVIOUS(sv)));
414 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
415 /* If SvTAIL is actually due to \Z or \z, this gives false positives
419 =for apidoc fbm_instr
421 Returns the location of the SV in the string delimited by C<str> and
422 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
423 does not have to be fbm_compiled, but the search will not be as fast
430 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
432 register unsigned char *s;
434 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
435 register STRLEN littlelen = l;
436 register I32 multiline = flags & FBMrf_MULTILINE;
438 if ((STRLEN)(bigend - big) < littlelen) {
439 if ( SvTAIL(littlestr)
440 && ((STRLEN)(bigend - big) == littlelen - 1)
442 || (*big == *little &&
443 memEQ((char *)big, (char *)little, littlelen - 1))))
448 if (littlelen <= 2) { /* Special-cased */
450 if (littlelen == 1) {
451 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
452 /* Know that bigend != big. */
453 if (bigend[-1] == '\n')
454 return (char *)(bigend - 1);
455 return (char *) bigend;
463 if (SvTAIL(littlestr))
464 return (char *) bigend;
468 return (char*)big; /* Cannot be SvTAIL! */
471 if (SvTAIL(littlestr) && !multiline) {
472 if (bigend[-1] == '\n' && bigend[-2] == *little)
473 return (char*)bigend - 2;
474 if (bigend[-1] == *little)
475 return (char*)bigend - 1;
479 /* This should be better than FBM if c1 == c2, and almost
480 as good otherwise: maybe better since we do less indirection.
481 And we save a lot of memory by caching no table. */
482 register unsigned char c1 = little[0];
483 register unsigned char c2 = little[1];
488 while (s <= bigend) {
498 goto check_1char_anchor;
509 goto check_1char_anchor;
512 while (s <= bigend) {
517 goto check_1char_anchor;
526 check_1char_anchor: /* One char and anchor! */
527 if (SvTAIL(littlestr) && (*bigend == *little))
528 return (char *)bigend; /* bigend is already decremented. */
531 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
532 s = bigend - littlelen;
533 if (s >= big && bigend[-1] == '\n' && *s == *little
534 /* Automatically of length > 2 */
535 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
537 return (char*)s; /* how sweet it is */
540 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
542 return (char*)s + 1; /* how sweet it is */
546 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
547 char *b = ninstr((char*)big,(char*)bigend,
548 (char*)little, (char*)little + littlelen);
550 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
551 /* Chop \n from littlestr: */
552 s = bigend - littlelen + 1;
554 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
563 { /* Do actual FBM. */
564 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
565 register unsigned char *oldlittle;
567 if (littlelen > (STRLEN)(bigend - big))
569 --littlelen; /* Last char found by table lookup */
572 little += littlelen; /* last char */
579 if ((tmp = table[*s])) {
580 if ((s += tmp) < bigend)
584 else { /* less expensive than calling strncmp() */
585 register unsigned char *olds = s;
590 if (*--s == *--little)
592 s = olds + 1; /* here we pay the price for failure */
594 if (s < bigend) /* fake up continue to outer loop */
602 if ( s == bigend && (table[-1] & FBMcf_TAIL)
603 && memEQ((char *)(bigend - littlelen),
604 (char *)(oldlittle - littlelen), littlelen) )
605 return (char*)bigend - littlelen;
610 /* start_shift, end_shift are positive quantities which give offsets
611 of ends of some substring of bigstr.
612 If `last' we want the last occurrence.
613 old_posp is the way of communication between consequent calls if
614 the next call needs to find the .
615 The initial *old_posp should be -1.
617 Note that we take into account SvTAIL, so one can get extra
618 optimizations if _ALL flag is set.
621 /* If SvTAIL is actually due to \Z or \z, this gives false positives
622 if PL_multiline. In fact if !PL_multiline the authoritative answer
623 is not supported yet. */
626 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
628 register unsigned char *s, *x;
629 register unsigned char *big;
631 register I32 previous;
633 register unsigned char *little;
634 register I32 stop_pos;
635 register unsigned char *littleend;
639 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
640 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
642 if ( BmRARE(littlestr) == '\n'
643 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
644 little = (unsigned char *)(SvPVX(littlestr));
645 littleend = little + SvCUR(littlestr);
652 little = (unsigned char *)(SvPVX(littlestr));
653 littleend = little + SvCUR(littlestr);
655 /* The value of pos we can start at: */
656 previous = BmPREVIOUS(littlestr);
657 big = (unsigned char *)(SvPVX(bigstr));
658 /* The value of pos we can stop at: */
659 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
660 if (previous + start_shift > stop_pos) {
662 stop_pos does not include SvTAIL in the count, so this check is incorrect
663 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
666 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
671 while (pos < previous + start_shift) {
672 if (!(pos += PL_screamnext[pos]))
677 if (pos >= stop_pos) break;
678 if (big[pos] != first)
680 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
686 if (s == littleend) {
688 if (!last) return (char *)(big+pos);
691 } while ( pos += PL_screamnext[pos] );
693 return (char *)(big+(*old_posp));
695 if (!SvTAIL(littlestr) || (end_shift > 0))
697 /* Ignore the trailing "\n". This code is not microoptimized */
698 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
699 stop_pos = littleend - little; /* Actual littlestr len */
704 && ((stop_pos == 1) ||
705 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
711 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
713 register U8 *a = (U8 *)s1;
714 register U8 *b = (U8 *)s2;
716 if (*a != *b && *a != PL_fold[*b])
724 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
726 register U8 *a = (U8 *)s1;
727 register U8 *b = (U8 *)s2;
729 if (*a != *b && *a != PL_fold_locale[*b])
736 /* copy a string to a safe spot */
739 =head1 Memory Management
743 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
744 string which is a duplicate of C<pv>. The size of the string is
745 determined by C<strlen()>. The memory allocated for the new string can
746 be freed with the C<Safefree()> function.
752 Perl_savepv(pTHX_ const char *pv)
754 register char *newaddr = Nullch;
756 New(902,newaddr,strlen(pv)+1,char);
757 (void)strcpy(newaddr,pv);
762 /* same thing but with a known length */
767 Perl's version of what C<strndup()> would be if it existed. Returns a
768 pointer to a newly allocated string which is a duplicate of the first
769 C<len> bytes from C<pv>. The memory allocated for the new string can be
770 freed with the C<Safefree()> function.
776 Perl_savepvn(pTHX_ const char *pv, register I32 len)
778 register char *newaddr;
780 New(903,newaddr,len+1,char);
781 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
783 Copy(pv,newaddr,len,char); /* might not be null terminated */
784 newaddr[len] = '\0'; /* is now */
787 Zero(newaddr,len+1,char);
793 =for apidoc savesharedpv
795 A version of C<savepv()> which allocates the duplicate string in memory
796 which is shared between threads.
801 Perl_savesharedpv(pTHX_ const char *pv)
803 register char *newaddr = Nullch;
805 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
806 (void)strcpy(newaddr,pv);
813 /* the SV for Perl_form() and mess() is not kept in an arena */
822 return sv_2mortal(newSVpvn("",0));
827 /* Create as PVMG now, to avoid any upgrading later */
829 Newz(905, any, 1, XPVMG);
830 SvFLAGS(sv) = SVt_PVMG;
831 SvANY(sv) = (void*)any;
832 SvREFCNT(sv) = 1 << 30; /* practically infinite */
837 #if defined(PERL_IMPLICIT_CONTEXT)
839 Perl_form_nocontext(const char* pat, ...)
845 retval = vform(pat, &args);
849 #endif /* PERL_IMPLICIT_CONTEXT */
852 =head1 Miscellaneous Functions
855 Takes a sprintf-style format pattern and conventional
856 (non-SV) arguments and returns the formatted string.
858 (char *) Perl_form(pTHX_ const char* pat, ...)
860 can be used any place a string (char *) is required:
862 char * s = Perl_form("%d.%d",major,minor);
864 Uses a single private buffer so if you want to format several strings you
865 must explicitly copy the earlier strings away (and free the copies when you
872 Perl_form(pTHX_ const char* pat, ...)
877 retval = vform(pat, &args);
883 Perl_vform(pTHX_ const char *pat, va_list *args)
885 SV *sv = mess_alloc();
886 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
890 #if defined(PERL_IMPLICIT_CONTEXT)
892 Perl_mess_nocontext(const char *pat, ...)
898 retval = vmess(pat, &args);
902 #endif /* PERL_IMPLICIT_CONTEXT */
905 Perl_mess(pTHX_ const char *pat, ...)
910 retval = vmess(pat, &args);
916 S_closest_cop(pTHX_ COP *cop, OP *o)
918 /* Look for PL_op starting from o. cop is the last COP we've seen. */
920 if (!o || o == PL_op) return cop;
922 if (o->op_flags & OPf_KIDS) {
924 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
928 /* If the OP_NEXTSTATE has been optimised away we can still use it
929 * the get the file and line number. */
931 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
934 /* Keep searching, and return when we've found something. */
936 new_cop = closest_cop(cop, kid);
937 if (new_cop) return new_cop;
947 Perl_vmess(pTHX_ const char *pat, va_list *args)
949 SV *sv = mess_alloc();
950 static char dgd[] = " during global destruction.\n";
953 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
954 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
957 * Try and find the file and line for PL_op. This will usually be
958 * PL_curcop, but it might be a cop that has been optimised away. We
959 * can try to find such a cop by searching through the optree starting
960 * from the sibling of PL_curcop.
963 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
964 if (!cop) cop = PL_curcop;
967 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
968 OutCopFILE(cop), (IV)CopLINE(cop));
969 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
970 bool line_mode = (RsSIMPLE(PL_rs) &&
971 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
972 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
973 PL_last_in_gv == PL_argvgv ?
974 "" : GvNAME(PL_last_in_gv),
975 line_mode ? "line" : "chunk",
976 (IV)IoLINES(GvIOp(PL_last_in_gv)));
978 sv_catpv(sv, PL_dirty ? dgd : ".\n");
984 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
989 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
990 && (io = GvIO(PL_stderrgv))
991 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
998 SAVESPTR(PL_stderrgv);
999 PL_stderrgv = Nullgv;
1001 PUSHSTACKi(PERLSI_MAGIC);
1005 PUSHs(SvTIED_obj((SV*)io, mg));
1006 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1008 call_method("PRINT", G_SCALAR);
1016 /* SFIO can really mess with your errno */
1019 PerlIO *serr = Perl_error_log;
1021 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1022 (void)PerlIO_flush(serr);
1030 Perl_vdie(pTHX_ const char* pat, va_list *args)
1033 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);
1061 DEBUG_S(PerlIO_printf(Perl_debug_log,
1062 "%p: die: message = %s\ndiehook = %p\n",
1063 thr, message, PL_diehook));
1065 /* sv_2cv might call Perl_croak() */
1066 SV *olddiehook = PL_diehook;
1068 SAVESPTR(PL_diehook);
1069 PL_diehook = Nullsv;
1070 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1072 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1079 msg = newSVpvn(message, msglen);
1080 SvFLAGS(msg) |= utf8;
1088 PUSHSTACKi(PERLSI_DIEHOOK);
1092 call_sv((SV*)cv, G_DISCARD);
1098 PL_restartop = die_where(message, msglen);
1099 SvFLAGS(ERRSV) |= utf8;
1100 DEBUG_S(PerlIO_printf(Perl_debug_log,
1101 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1102 thr, PL_restartop, was_in_eval, PL_top_env));
1103 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1105 return PL_restartop;
1108 #if defined(PERL_IMPLICIT_CONTEXT)
1110 Perl_die_nocontext(const char* pat, ...)
1115 va_start(args, pat);
1116 o = vdie(pat, &args);
1120 #endif /* PERL_IMPLICIT_CONTEXT */
1123 Perl_die(pTHX_ const char* pat, ...)
1127 va_start(args, pat);
1128 o = vdie(pat, &args);
1134 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1145 msv = vmess(pat, args);
1146 if (PL_errors && SvCUR(PL_errors)) {
1147 sv_catsv(PL_errors, msv);
1148 message = SvPV(PL_errors, msglen);
1149 SvCUR_set(PL_errors, 0);
1152 message = SvPV(msv,msglen);
1160 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1161 PTR2UV(thr), message));
1164 /* sv_2cv might call Perl_croak() */
1165 SV *olddiehook = PL_diehook;
1167 SAVESPTR(PL_diehook);
1168 PL_diehook = Nullsv;
1169 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1171 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1178 msg = newSVpvn(message, msglen);
1179 SvFLAGS(msg) |= utf8;
1187 PUSHSTACKi(PERLSI_DIEHOOK);
1191 call_sv((SV*)cv, G_DISCARD);
1197 PL_restartop = die_where(message, msglen);
1198 SvFLAGS(ERRSV) |= utf8;
1202 message = SvPVx(ERRSV, msglen);
1204 write_to_stderr(message, msglen);
1208 #if defined(PERL_IMPLICIT_CONTEXT)
1210 Perl_croak_nocontext(const char *pat, ...)
1214 va_start(args, pat);
1219 #endif /* PERL_IMPLICIT_CONTEXT */
1222 =head1 Warning and Dieing
1226 This is the XSUB-writer's interface to Perl's C<die> function.
1227 Normally call this function the same way you call the C C<printf>
1228 function. Calling C<croak> returns control directly to Perl,
1229 sidestepping the normal C order of execution. See C<warn>.
1231 If you want to throw an exception object, assign the object to
1232 C<$@> and then pass C<Nullch> to croak():
1234 errsv = get_sv("@", TRUE);
1235 sv_setsv(errsv, exception_object);
1242 Perl_croak(pTHX_ const char *pat, ...)
1245 va_start(args, pat);
1252 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1262 msv = vmess(pat, args);
1264 message = SvPV(msv, msglen);
1267 /* sv_2cv might call Perl_warn() */
1268 SV *oldwarnhook = PL_warnhook;
1270 SAVESPTR(PL_warnhook);
1271 PL_warnhook = Nullsv;
1272 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1274 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1280 msg = newSVpvn(message, msglen);
1281 SvFLAGS(msg) |= utf8;
1285 PUSHSTACKi(PERLSI_WARNHOOK);
1289 call_sv((SV*)cv, G_DISCARD);
1296 write_to_stderr(message, msglen);
1299 #if defined(PERL_IMPLICIT_CONTEXT)
1301 Perl_warn_nocontext(const char *pat, ...)
1305 va_start(args, pat);
1309 #endif /* PERL_IMPLICIT_CONTEXT */
1314 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1315 function the same way you call the C C<printf> function. See C<croak>.
1321 Perl_warn(pTHX_ const char *pat, ...)
1324 va_start(args, pat);
1329 #if defined(PERL_IMPLICIT_CONTEXT)
1331 Perl_warner_nocontext(U32 err, const char *pat, ...)
1335 va_start(args, pat);
1336 vwarner(err, pat, &args);
1339 #endif /* PERL_IMPLICIT_CONTEXT */
1342 Perl_warner(pTHX_ U32 err, const char* pat,...)
1345 va_start(args, pat);
1346 vwarner(err, pat, &args);
1351 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1361 msv = vmess(pat, args);
1362 message = SvPV(msv, msglen);
1367 /* sv_2cv might call Perl_croak() */
1368 SV *olddiehook = PL_diehook;
1370 SAVESPTR(PL_diehook);
1371 PL_diehook = Nullsv;
1372 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1374 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1380 msg = newSVpvn(message, msglen);
1381 SvFLAGS(msg) |= utf8;
1385 PUSHSTACKi(PERLSI_DIEHOOK);
1389 call_sv((SV*)cv, G_DISCARD);
1395 PL_restartop = die_where(message, msglen);
1396 SvFLAGS(ERRSV) |= utf8;
1399 write_to_stderr(message, msglen);
1404 /* sv_2cv might call Perl_warn() */
1405 SV *oldwarnhook = PL_warnhook;
1407 SAVESPTR(PL_warnhook);
1408 PL_warnhook = Nullsv;
1409 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1411 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1417 msg = newSVpvn(message, msglen);
1418 SvFLAGS(msg) |= utf8;
1422 PUSHSTACKi(PERLSI_WARNHOOK);
1426 call_sv((SV*)cv, G_DISCARD);
1432 write_to_stderr(message, msglen);
1436 /* since we've already done strlen() for both nam and val
1437 * we can use that info to make things faster than
1438 * sprintf(s, "%s=%s", nam, val)
1440 #define my_setenv_format(s, nam, nlen, val, vlen) \
1441 Copy(nam, s, nlen, char); \
1443 Copy(val, s+(nlen+1), vlen, char); \
1444 *(s+(nlen+1+vlen)) = '\0'
1446 #ifdef USE_ENVIRON_ARRAY
1447 /* VMS' my_setenv() is in vms.c */
1448 #if !defined(WIN32) && !defined(NETWARE)
1450 Perl_my_setenv(pTHX_ char *nam, char *val)
1453 /* only parent thread can modify process environment */
1454 if (PL_curinterp == aTHX)
1457 #ifndef PERL_USE_SAFE_PUTENV
1458 /* most putenv()s leak, so we manipulate environ directly */
1459 register I32 i=setenv_getix(nam); /* where does it go? */
1462 if (environ == PL_origenviron) { /* need we copy environment? */
1468 for (max = i; environ[max]; max++) ;
1469 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1470 for (j=0; j<max; j++) { /* copy environment */
1471 int len = strlen(environ[j]);
1472 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1473 Copy(environ[j], tmpenv[j], len+1, char);
1475 tmpenv[max] = Nullch;
1476 environ = tmpenv; /* tell exec where it is now */
1479 safesysfree(environ[i]);
1480 while (environ[i]) {
1481 environ[i] = environ[i+1];
1486 if (!environ[i]) { /* does not exist yet */
1487 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1488 environ[i+1] = Nullch; /* make sure it's null terminated */
1491 safesysfree(environ[i]);
1495 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1496 /* all that work just for this */
1497 my_setenv_format(environ[i], nam, nlen, val, vlen);
1499 #else /* PERL_USE_SAFE_PUTENV */
1500 # if defined(__CYGWIN__) || defined( EPOC)
1501 setenv(nam, val, 1);
1504 int nlen = strlen(nam), vlen;
1509 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1510 /* all that work just for this */
1511 my_setenv_format(new_env, nam, nlen, val, vlen);
1512 (void)putenv(new_env);
1513 # endif /* __CYGWIN__ */
1514 #endif /* PERL_USE_SAFE_PUTENV */
1518 #else /* WIN32 || NETWARE */
1521 Perl_my_setenv(pTHX_ char *nam,char *val)
1523 register char *envstr;
1524 int nlen = strlen(nam), vlen;
1530 New(904, envstr, nlen+vlen+2, char);
1531 my_setenv_format(envstr, nam, nlen, val, vlen);
1532 (void)PerlEnv_putenv(envstr);
1536 #endif /* WIN32 || NETWARE */
1540 Perl_setenv_getix(pTHX_ char *nam)
1542 register I32 i, len = strlen(nam);
1544 for (i = 0; environ[i]; i++) {
1547 strnicmp(environ[i],nam,len) == 0
1549 strnEQ(environ[i],nam,len)
1551 && environ[i][len] == '=')
1552 break; /* strnEQ must come first to avoid */
1553 } /* potential SEGV's */
1556 #endif /* !PERL_MICRO */
1558 #endif /* !VMS && !EPOC*/
1560 #ifdef UNLINK_ALL_VERSIONS
1562 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1566 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1571 /* this is a drop-in replacement for bcopy() */
1572 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1574 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1578 if (from - to >= 0) {
1586 *(--to) = *(--from);
1592 /* this is a drop-in replacement for memset() */
1595 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1605 /* this is a drop-in replacement for bzero() */
1606 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1608 Perl_my_bzero(register char *loc, register I32 len)
1618 /* this is a drop-in replacement for memcmp() */
1619 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1621 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1623 register U8 *a = (U8 *)s1;
1624 register U8 *b = (U8 *)s2;
1628 if (tmp = *a++ - *b++)
1633 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1637 #ifdef USE_CHAR_VSPRINTF
1642 vsprintf(char *dest, const char *pat, char *args)
1646 fakebuf._ptr = dest;
1647 fakebuf._cnt = 32767;
1651 fakebuf._flag = _IOWRT|_IOSTRG;
1652 _doprnt(pat, args, &fakebuf); /* what a kludge */
1653 (void)putc('\0', &fakebuf);
1654 #ifdef USE_CHAR_VSPRINTF
1657 return 0; /* perl doesn't use return value */
1661 #endif /* HAS_VPRINTF */
1664 #if BYTEORDER != 0x4321
1666 Perl_my_swap(pTHX_ short s)
1668 #if (BYTEORDER & 1) == 0
1671 result = ((s & 255) << 8) + ((s >> 8) & 255);
1679 Perl_my_htonl(pTHX_ long l)
1683 char c[sizeof(long)];
1686 #if BYTEORDER == 0x1234
1687 u.c[0] = (l >> 24) & 255;
1688 u.c[1] = (l >> 16) & 255;
1689 u.c[2] = (l >> 8) & 255;
1693 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1694 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1699 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1700 u.c[o & 0xf] = (l >> s) & 255;
1708 Perl_my_ntohl(pTHX_ long l)
1712 char c[sizeof(long)];
1715 #if BYTEORDER == 0x1234
1716 u.c[0] = (l >> 24) & 255;
1717 u.c[1] = (l >> 16) & 255;
1718 u.c[2] = (l >> 8) & 255;
1722 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1723 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1730 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1731 l |= (u.c[o & 0xf] & 255) << s;
1738 #endif /* BYTEORDER != 0x4321 */
1742 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1743 * If these functions are defined,
1744 * the BYTEORDER is neither 0x1234 nor 0x4321.
1745 * However, this is not assumed.
1749 #define HTOV(name,type) \
1751 name (register type n) \
1755 char c[sizeof(type)]; \
1759 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1760 u.c[i] = (n >> s) & 0xFF; \
1765 #define VTOH(name,type) \
1767 name (register type n) \
1771 char c[sizeof(type)]; \
1777 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1778 n += (u.c[i] & 0xFF) << s; \
1783 #if defined(HAS_HTOVS) && !defined(htovs)
1786 #if defined(HAS_HTOVL) && !defined(htovl)
1789 #if defined(HAS_VTOHS) && !defined(vtohs)
1792 #if defined(HAS_VTOHL) && !defined(vtohl)
1797 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1799 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1801 register I32 This, that;
1807 PERL_FLUSHALL_FOR_CHILD;
1808 This = (*mode == 'w');
1812 taint_proper("Insecure %s%s", "EXEC");
1814 if (PerlProc_pipe(p) < 0)
1816 /* Try for another pipe pair for error return */
1817 if (PerlProc_pipe(pp) >= 0)
1819 while ((pid = PerlProc_fork()) < 0) {
1820 if (errno != EAGAIN) {
1821 PerlLIO_close(p[This]);
1822 PerlLIO_close(p[that]);
1824 PerlLIO_close(pp[0]);
1825 PerlLIO_close(pp[1]);
1837 /* Close parent's end of error status pipe (if any) */
1839 PerlLIO_close(pp[0]);
1840 #if defined(HAS_FCNTL) && defined(F_SETFD)
1841 /* Close error pipe automatically if exec works */
1842 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1845 /* Now dup our end of _the_ pipe to right position */
1846 if (p[THIS] != (*mode == 'r')) {
1847 PerlLIO_dup2(p[THIS], *mode == 'r');
1848 PerlLIO_close(p[THIS]);
1849 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1850 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1853 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1854 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1855 /* No automatic close - do it by hand */
1862 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1868 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1874 do_execfree(); /* free any memory malloced by child on fork */
1876 PerlLIO_close(pp[1]);
1877 /* Keep the lower of the two fd numbers */
1878 if (p[that] < p[This]) {
1879 PerlLIO_dup2(p[This], p[that]);
1880 PerlLIO_close(p[This]);
1884 PerlLIO_close(p[that]); /* close child's end of pipe */
1887 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1889 (void)SvUPGRADE(sv,SVt_IV);
1891 PL_forkprocess = pid;
1892 /* If we managed to get status pipe check for exec fail */
1893 if (did_pipes && pid > 0) {
1897 while (n < sizeof(int)) {
1898 n1 = PerlLIO_read(pp[0],
1899 (void*)(((char*)&errkid)+n),
1905 PerlLIO_close(pp[0]);
1907 if (n) { /* Error */
1909 PerlLIO_close(p[This]);
1910 if (n != sizeof(int))
1911 Perl_croak(aTHX_ "panic: kid popen errno read");
1913 pid2 = wait4pid(pid, &status, 0);
1914 } while (pid2 == -1 && errno == EINTR);
1915 errno = errkid; /* Propagate errno from kid */
1920 PerlLIO_close(pp[0]);
1921 return PerlIO_fdopen(p[This], mode);
1923 Perl_croak(aTHX_ "List form of piped open not implemented");
1924 return (PerlIO *) NULL;
1928 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1929 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
1931 Perl_my_popen(pTHX_ char *cmd, char *mode)
1934 register I32 This, that;
1937 I32 doexec = strNE(cmd,"-");
1941 PERL_FLUSHALL_FOR_CHILD;
1944 return my_syspopen(aTHX_ cmd,mode);
1947 This = (*mode == 'w');
1949 if (doexec && PL_tainting) {
1951 taint_proper("Insecure %s%s", "EXEC");
1953 if (PerlProc_pipe(p) < 0)
1955 if (doexec && PerlProc_pipe(pp) >= 0)
1957 while ((pid = PerlProc_fork()) < 0) {
1958 if (errno != EAGAIN) {
1959 PerlLIO_close(p[This]);
1960 PerlLIO_close(p[that]);
1962 PerlLIO_close(pp[0]);
1963 PerlLIO_close(pp[1]);
1966 Perl_croak(aTHX_ "Can't fork");
1979 PerlLIO_close(pp[0]);
1980 #if defined(HAS_FCNTL) && defined(F_SETFD)
1981 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1984 if (p[THIS] != (*mode == 'r')) {
1985 PerlLIO_dup2(p[THIS], *mode == 'r');
1986 PerlLIO_close(p[THIS]);
1987 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1988 PerlLIO_close(p[THAT]);
1991 PerlLIO_close(p[THAT]);
1994 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2003 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2008 /* may or may not use the shell */
2009 do_exec3(cmd, pp[1], did_pipes);
2012 #endif /* defined OS2 */
2014 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2015 SvREADONLY_off(GvSV(tmpgv));
2016 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2017 SvREADONLY_on(GvSV(tmpgv));
2019 #ifdef THREADS_HAVE_PIDS
2020 PL_ppid = (IV)getppid();
2023 hv_clear(PL_pidstatus); /* we have no children */
2028 do_execfree(); /* free any memory malloced by child on vfork */
2030 PerlLIO_close(pp[1]);
2031 if (p[that] < p[This]) {
2032 PerlLIO_dup2(p[This], p[that]);
2033 PerlLIO_close(p[This]);
2037 PerlLIO_close(p[that]);
2040 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2042 (void)SvUPGRADE(sv,SVt_IV);
2044 PL_forkprocess = pid;
2045 if (did_pipes && pid > 0) {
2049 while (n < sizeof(int)) {
2050 n1 = PerlLIO_read(pp[0],
2051 (void*)(((char*)&errkid)+n),
2057 PerlLIO_close(pp[0]);
2059 if (n) { /* Error */
2061 PerlLIO_close(p[This]);
2062 if (n != sizeof(int))
2063 Perl_croak(aTHX_ "panic: kid popen errno read");
2065 pid2 = wait4pid(pid, &status, 0);
2066 } while (pid2 == -1 && errno == EINTR);
2067 errno = errkid; /* Propagate errno from kid */
2072 PerlLIO_close(pp[0]);
2073 return PerlIO_fdopen(p[This], mode);
2076 #if defined(atarist) || defined(EPOC)
2079 Perl_my_popen(pTHX_ char *cmd, char *mode)
2081 PERL_FLUSHALL_FOR_CHILD;
2082 /* Call system's popen() to get a FILE *, then import it.
2083 used 0 for 2nd parameter to PerlIO_importFILE;
2086 return PerlIO_importFILE(popen(cmd, mode), 0);
2090 FILE *djgpp_popen();
2092 Perl_my_popen(pTHX_ char *cmd, char *mode)
2094 PERL_FLUSHALL_FOR_CHILD;
2095 /* Call system's popen() to get a FILE *, then import it.
2096 used 0 for 2nd parameter to PerlIO_importFILE;
2099 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2104 #endif /* !DOSISH */
2106 /* this is called in parent before the fork() */
2108 Perl_atfork_lock(void)
2110 #if defined(USE_ITHREADS)
2111 /* locks must be held in locking order (if any) */
2113 MUTEX_LOCK(&PL_malloc_mutex);
2119 /* this is called in both parent and child after the fork() */
2121 Perl_atfork_unlock(void)
2123 #if defined(USE_ITHREADS)
2124 /* locks must be released in same order as in atfork_lock() */
2126 MUTEX_UNLOCK(&PL_malloc_mutex);
2135 #if defined(HAS_FORK)
2137 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2142 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2143 * handlers elsewhere in the code */
2148 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2149 Perl_croak_nocontext("fork() not available");
2151 #endif /* HAS_FORK */
2156 Perl_dump_fds(pTHX_ char *s)
2161 PerlIO_printf(Perl_debug_log,"%s", s);
2162 for (fd = 0; fd < 32; fd++) {
2163 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2164 PerlIO_printf(Perl_debug_log," %d",fd);
2166 PerlIO_printf(Perl_debug_log,"\n");
2168 #endif /* DUMP_FDS */
2172 dup2(int oldfd, int newfd)
2174 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2177 PerlLIO_close(newfd);
2178 return fcntl(oldfd, F_DUPFD, newfd);
2180 #define DUP2_MAX_FDS 256
2181 int fdtmp[DUP2_MAX_FDS];
2187 PerlLIO_close(newfd);
2188 /* good enough for low fd's... */
2189 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2190 if (fdx >= DUP2_MAX_FDS) {
2198 PerlLIO_close(fdtmp[--fdx]);
2205 #ifdef HAS_SIGACTION
2207 #ifdef MACOS_TRADITIONAL
2208 /* We don't want restart behavior on MacOS */
2213 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2215 struct sigaction act, oact;
2218 /* only "parent" interpreter can diddle signals */
2219 if (PL_curinterp != aTHX)
2223 act.sa_handler = handler;
2224 sigemptyset(&act.sa_mask);
2227 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2228 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2230 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2231 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2232 act.sa_flags |= SA_NOCLDWAIT;
2234 if (sigaction(signo, &act, &oact) == -1)
2237 return oact.sa_handler;
2241 Perl_rsignal_state(pTHX_ int signo)
2243 struct sigaction oact;
2245 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2248 return oact.sa_handler;
2252 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2254 struct sigaction act;
2257 /* only "parent" interpreter can diddle signals */
2258 if (PL_curinterp != aTHX)
2262 act.sa_handler = handler;
2263 sigemptyset(&act.sa_mask);
2266 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2267 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2269 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2270 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2271 act.sa_flags |= SA_NOCLDWAIT;
2273 return sigaction(signo, &act, save);
2277 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2280 /* only "parent" interpreter can diddle signals */
2281 if (PL_curinterp != aTHX)
2285 return sigaction(signo, save, (struct sigaction *)NULL);
2288 #else /* !HAS_SIGACTION */
2291 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2293 #if defined(USE_ITHREADS) && !defined(WIN32)
2294 /* only "parent" interpreter can diddle signals */
2295 if (PL_curinterp != aTHX)
2299 return PerlProc_signal(signo, handler);
2302 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2303 ignore the implications of this for threading */
2313 Perl_rsignal_state(pTHX_ int signo)
2315 Sighandler_t oldsig;
2317 #if defined(USE_ITHREADS) && !defined(WIN32)
2318 /* only "parent" interpreter can diddle signals */
2319 if (PL_curinterp != aTHX)
2324 oldsig = PerlProc_signal(signo, sig_trap);
2325 PerlProc_signal(signo, oldsig);
2327 PerlProc_kill(PerlProc_getpid(), signo);
2332 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2334 #if defined(USE_ITHREADS) && !defined(WIN32)
2335 /* only "parent" interpreter can diddle signals */
2336 if (PL_curinterp != aTHX)
2339 *save = PerlProc_signal(signo, handler);
2340 return (*save == SIG_ERR) ? -1 : 0;
2344 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2346 #if defined(USE_ITHREADS) && !defined(WIN32)
2347 /* only "parent" interpreter can diddle signals */
2348 if (PL_curinterp != aTHX)
2351 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2354 #endif /* !HAS_SIGACTION */
2355 #endif /* !PERL_MICRO */
2357 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2358 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2360 Perl_my_pclose(pTHX_ PerlIO *ptr)
2362 Sigsave_t hstat, istat, qstat;
2368 int saved_errno = 0;
2370 int saved_vaxc_errno;
2373 int saved_win32_errno;
2377 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2379 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2381 *svp = &PL_sv_undef;
2383 if (pid == -1) { /* Opened by popen. */
2384 return my_syspclose(ptr);
2387 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2388 saved_errno = errno;
2390 saved_vaxc_errno = vaxc$errno;
2393 saved_win32_errno = GetLastError();
2397 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2400 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2401 rsignal_save(SIGINT, SIG_IGN, &istat);
2402 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2405 pid2 = wait4pid(pid, &status, 0);
2406 } while (pid2 == -1 && errno == EINTR);
2408 rsignal_restore(SIGHUP, &hstat);
2409 rsignal_restore(SIGINT, &istat);
2410 rsignal_restore(SIGQUIT, &qstat);
2413 SETERRNO(saved_errno, saved_vaxc_errno);
2416 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2418 #endif /* !DOSISH */
2420 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2422 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2427 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2431 char spid[TYPE_CHARS(int)];
2434 sprintf(spid, "%"IVdf, (IV)pid);
2435 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2436 if (svp && *svp != &PL_sv_undef) {
2437 *statusp = SvIVX(*svp);
2438 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2445 hv_iterinit(PL_pidstatus);
2446 if ((entry = hv_iternext(PL_pidstatus))) {
2448 char spid[TYPE_CHARS(int)];
2450 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2451 sv = hv_iterval(PL_pidstatus,entry);
2452 *statusp = SvIVX(sv);
2453 sprintf(spid, "%"IVdf, (IV)pid);
2454 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2461 # ifdef HAS_WAITPID_RUNTIME
2462 if (!HAS_WAITPID_RUNTIME)
2465 result = PerlProc_waitpid(pid,statusp,flags);
2468 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2469 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2472 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2476 Perl_croak(aTHX_ "Can't do waitpid with flags");
2478 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2479 pidgone(result,*statusp);
2486 if (result < 0 && errno == EINTR) {
2491 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2495 Perl_pidgone(pTHX_ Pid_t pid, int status)
2498 char spid[TYPE_CHARS(int)];
2500 sprintf(spid, "%"IVdf, (IV)pid);
2501 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2502 (void)SvUPGRADE(sv,SVt_IV);
2507 #if defined(atarist) || defined(OS2) || defined(EPOC)
2510 int /* Cannot prototype with I32
2512 my_syspclose(PerlIO *ptr)
2515 Perl_my_pclose(pTHX_ PerlIO *ptr)
2518 /* Needs work for PerlIO ! */
2519 FILE *f = PerlIO_findFILE(ptr);
2520 I32 result = pclose(f);
2521 PerlIO_releaseFILE(ptr,f);
2529 Perl_my_pclose(pTHX_ PerlIO *ptr)
2531 /* Needs work for PerlIO ! */
2532 FILE *f = PerlIO_findFILE(ptr);
2533 I32 result = djgpp_pclose(f);
2534 result = (result << 8) & 0xff00;
2535 PerlIO_releaseFILE(ptr,f);
2541 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2544 register const char *frombase = from;
2547 register const char c = *from;
2552 while (count-- > 0) {
2553 for (todo = len; todo > 0; todo--) {
2562 Perl_same_dirent(pTHX_ char *a, char *b)
2564 char *fa = strrchr(a,'/');
2565 char *fb = strrchr(b,'/');
2568 SV *tmpsv = sv_newmortal();
2581 sv_setpv(tmpsv, ".");
2583 sv_setpvn(tmpsv, a, fa - a);
2584 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2587 sv_setpv(tmpsv, ".");
2589 sv_setpvn(tmpsv, b, fb - b);
2590 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2592 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2593 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2595 #endif /* !HAS_RENAME */
2598 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2600 char *xfound = Nullch;
2601 char *xfailed = Nullch;
2602 char tmpbuf[MAXPATHLEN];
2606 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2607 # define SEARCH_EXTS ".bat", ".cmd", NULL
2608 # define MAX_EXT_LEN 4
2611 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2612 # define MAX_EXT_LEN 4
2615 # define SEARCH_EXTS ".pl", ".com", NULL
2616 # define MAX_EXT_LEN 4
2618 /* additional extensions to try in each dir if scriptname not found */
2620 char *exts[] = { SEARCH_EXTS };
2621 char **ext = search_ext ? search_ext : exts;
2622 int extidx = 0, i = 0;
2623 char *curext = Nullch;
2625 # define MAX_EXT_LEN 0
2629 * If dosearch is true and if scriptname does not contain path
2630 * delimiters, search the PATH for scriptname.
2632 * If SEARCH_EXTS is also defined, will look for each
2633 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2634 * while searching the PATH.
2636 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2637 * proceeds as follows:
2638 * If DOSISH or VMSISH:
2639 * + look for ./scriptname{,.foo,.bar}
2640 * + search the PATH for scriptname{,.foo,.bar}
2643 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2644 * this will not look in '.' if it's not in the PATH)
2649 # ifdef ALWAYS_DEFTYPES
2650 len = strlen(scriptname);
2651 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2652 int hasdir, idx = 0, deftypes = 1;
2655 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2658 int hasdir, idx = 0, deftypes = 1;
2661 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2663 /* The first time through, just add SEARCH_EXTS to whatever we
2664 * already have, so we can check for default file types. */
2666 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2672 if ((strlen(tmpbuf) + strlen(scriptname)
2673 + MAX_EXT_LEN) >= sizeof tmpbuf)
2674 continue; /* don't search dir with too-long name */
2675 strcat(tmpbuf, scriptname);
2679 if (strEQ(scriptname, "-"))
2681 if (dosearch) { /* Look in '.' first. */
2682 char *cur = scriptname;
2684 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2686 if (strEQ(ext[i++],curext)) {
2687 extidx = -1; /* already has an ext */
2692 DEBUG_p(PerlIO_printf(Perl_debug_log,
2693 "Looking for %s\n",cur));
2694 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2695 && !S_ISDIR(PL_statbuf.st_mode)) {
2703 if (cur == scriptname) {
2704 len = strlen(scriptname);
2705 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2707 cur = strcpy(tmpbuf, scriptname);
2709 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2710 && strcpy(tmpbuf+len, ext[extidx++]));
2715 #ifdef MACOS_TRADITIONAL
2716 if (dosearch && !strchr(scriptname, ':') &&
2717 (s = PerlEnv_getenv("Commands")))
2719 if (dosearch && !strchr(scriptname, '/')
2721 && !strchr(scriptname, '\\')
2723 && (s = PerlEnv_getenv("PATH")))
2728 PL_bufend = s + strlen(s);
2729 while (s < PL_bufend) {
2730 #ifdef MACOS_TRADITIONAL
2731 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2735 #if defined(atarist) || defined(DOSISH)
2740 && *s != ';'; len++, s++) {
2741 if (len < sizeof tmpbuf)
2744 if (len < sizeof tmpbuf)
2746 #else /* ! (atarist || DOSISH) */
2747 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2750 #endif /* ! (atarist || DOSISH) */
2751 #endif /* MACOS_TRADITIONAL */
2754 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2755 continue; /* don't search dir with too-long name */
2756 #ifdef MACOS_TRADITIONAL
2757 if (len && tmpbuf[len - 1] != ':')
2758 tmpbuf[len++] = ':';
2761 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2762 && tmpbuf[len - 1] != '/'
2763 && tmpbuf[len - 1] != '\\'
2766 tmpbuf[len++] = '/';
2767 if (len == 2 && tmpbuf[0] == '.')
2770 (void)strcpy(tmpbuf + len, scriptname);
2774 len = strlen(tmpbuf);
2775 if (extidx > 0) /* reset after previous loop */
2779 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2780 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2781 if (S_ISDIR(PL_statbuf.st_mode)) {
2785 } while ( retval < 0 /* not there */
2786 && extidx>=0 && ext[extidx] /* try an extension? */
2787 && strcpy(tmpbuf+len, ext[extidx++])
2792 if (S_ISREG(PL_statbuf.st_mode)
2793 && cando(S_IRUSR,TRUE,&PL_statbuf)
2794 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2795 && cando(S_IXUSR,TRUE,&PL_statbuf)
2799 xfound = tmpbuf; /* bingo! */
2803 xfailed = savepv(tmpbuf);
2806 if (!xfound && !seen_dot && !xfailed &&
2807 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2808 || S_ISDIR(PL_statbuf.st_mode)))
2810 seen_dot = 1; /* Disable message. */
2812 if (flags & 1) { /* do or die? */
2813 Perl_croak(aTHX_ "Can't %s %s%s%s",
2814 (xfailed ? "execute" : "find"),
2815 (xfailed ? xfailed : scriptname),
2816 (xfailed ? "" : " on PATH"),
2817 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2819 scriptname = Nullch;
2823 scriptname = xfound;
2825 return (scriptname ? savepv(scriptname) : Nullch);
2828 #ifndef PERL_GET_CONTEXT_DEFINED
2831 Perl_get_context(void)
2833 #if defined(USE_ITHREADS)
2834 # ifdef OLD_PTHREADS_API
2836 if (pthread_getspecific(PL_thr_key, &t))
2837 Perl_croak_nocontext("panic: pthread_getspecific");
2840 # ifdef I_MACH_CTHREADS
2841 return (void*)cthread_data(cthread_self());
2843 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2852 Perl_set_context(void *t)
2854 #if defined(USE_ITHREADS)
2855 # ifdef I_MACH_CTHREADS
2856 cthread_set_data(cthread_self(), t);
2858 if (pthread_setspecific(PL_thr_key, t))
2859 Perl_croak_nocontext("panic: pthread_setspecific");
2864 #endif /* !PERL_GET_CONTEXT_DEFINED */
2866 #ifdef PERL_GLOBAL_STRUCT
2875 Perl_get_op_names(pTHX)
2881 Perl_get_op_descs(pTHX)
2887 Perl_get_no_modify(pTHX)
2889 return (char*)PL_no_modify;
2893 Perl_get_opargs(pTHX)
2899 Perl_get_ppaddr(pTHX)
2901 return (PPADDR_t*)PL_ppaddr;
2904 #ifndef HAS_GETENV_LEN
2906 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
2908 char *env_trans = PerlEnv_getenv(env_elem);
2910 *len = strlen(env_trans);
2917 Perl_get_vtbl(pTHX_ int vtbl_id)
2919 MGVTBL* result = Null(MGVTBL*);
2923 result = &PL_vtbl_sv;
2926 result = &PL_vtbl_env;
2928 case want_vtbl_envelem:
2929 result = &PL_vtbl_envelem;
2932 result = &PL_vtbl_sig;
2934 case want_vtbl_sigelem:
2935 result = &PL_vtbl_sigelem;
2937 case want_vtbl_pack:
2938 result = &PL_vtbl_pack;
2940 case want_vtbl_packelem:
2941 result = &PL_vtbl_packelem;
2943 case want_vtbl_dbline:
2944 result = &PL_vtbl_dbline;
2947 result = &PL_vtbl_isa;
2949 case want_vtbl_isaelem:
2950 result = &PL_vtbl_isaelem;
2952 case want_vtbl_arylen:
2953 result = &PL_vtbl_arylen;
2955 case want_vtbl_glob:
2956 result = &PL_vtbl_glob;
2958 case want_vtbl_mglob:
2959 result = &PL_vtbl_mglob;
2961 case want_vtbl_nkeys:
2962 result = &PL_vtbl_nkeys;
2964 case want_vtbl_taint:
2965 result = &PL_vtbl_taint;
2967 case want_vtbl_substr:
2968 result = &PL_vtbl_substr;
2971 result = &PL_vtbl_vec;
2974 result = &PL_vtbl_pos;
2977 result = &PL_vtbl_bm;
2980 result = &PL_vtbl_fm;
2982 case want_vtbl_uvar:
2983 result = &PL_vtbl_uvar;
2985 case want_vtbl_defelem:
2986 result = &PL_vtbl_defelem;
2988 case want_vtbl_regexp:
2989 result = &PL_vtbl_regexp;
2991 case want_vtbl_regdata:
2992 result = &PL_vtbl_regdata;
2994 case want_vtbl_regdatum:
2995 result = &PL_vtbl_regdatum;
2997 #ifdef USE_LOCALE_COLLATE
2998 case want_vtbl_collxfrm:
2999 result = &PL_vtbl_collxfrm;
3002 case want_vtbl_amagic:
3003 result = &PL_vtbl_amagic;
3005 case want_vtbl_amagicelem:
3006 result = &PL_vtbl_amagicelem;
3008 case want_vtbl_backref:
3009 result = &PL_vtbl_backref;
3011 case want_vtbl_utf8:
3012 result = &PL_vtbl_utf8;
3019 Perl_my_fflush_all(pTHX)
3021 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3022 return PerlIO_flush(NULL);
3024 # if defined(HAS__FWALK)
3025 extern int fflush(FILE *);
3026 /* undocumented, unprototyped, but very useful BSDism */
3027 extern void _fwalk(int (*)(FILE *));
3031 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3033 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3034 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3036 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3037 open_max = sysconf(_SC_OPEN_MAX);
3040 open_max = FOPEN_MAX;
3043 open_max = OPEN_MAX;
3054 for (i = 0; i < open_max; i++)
3055 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3056 STDIO_STREAM_ARRAY[i]._file < open_max &&
3057 STDIO_STREAM_ARRAY[i]._flag)
3058 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3062 SETERRNO(EBADF,RMS_IFI);
3069 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3072 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3073 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3075 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3076 char *type = OP_IS_SOCKET(op)
3077 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3078 ? "socket" : "filehandle";
3081 if (gv && isGV(gv)) {
3085 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3086 if (ckWARN(WARN_IO)) {
3087 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3089 Perl_warner(aTHX_ packWARN(WARN_IO),
3090 "Filehandle %s opened only for %sput",
3093 Perl_warner(aTHX_ packWARN(WARN_IO),
3094 "Filehandle opened only for %sput", direction);
3101 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3103 warn_type = WARN_CLOSED;
3107 warn_type = WARN_UNOPENED;
3110 if (ckWARN(warn_type)) {
3111 if (name && *name) {
3112 Perl_warner(aTHX_ packWARN(warn_type),
3113 "%s%s on %s %s %s", func, pars, vile, type, name);
3114 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3116 aTHX_ packWARN(warn_type),
3117 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3122 Perl_warner(aTHX_ packWARN(warn_type),
3123 "%s%s on %s %s", func, pars, vile, type);
3124 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3126 aTHX_ packWARN(warn_type),
3127 "\t(Are you trying to call %s%s on dirhandle?)\n",
3136 /* in ASCII order, not that it matters */
3137 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3140 Perl_ebcdic_control(pTHX_ int ch)
3148 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3149 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3152 if (ctlp == controllablechars)
3153 return('\177'); /* DEL */
3155 return((unsigned char)(ctlp - controllablechars - 1));
3156 } else { /* Want uncontrol */
3157 if (ch == '\177' || ch == -1)
3159 else if (ch == '\157')
3161 else if (ch == '\174')
3163 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3165 else if (ch == '\155')
3167 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3168 return(controllablechars[ch+1]);
3170 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3175 /* To workaround core dumps from the uninitialised tm_zone we get the
3176 * system to give us a reasonable struct to copy. This fix means that
3177 * strftime uses the tm_zone and tm_gmtoff values returned by
3178 * localtime(time()). That should give the desired result most of the
3179 * time. But probably not always!
3181 * This does not address tzname aspects of NETaa14816.
3186 # ifndef STRUCT_TM_HASZONE
3187 # define STRUCT_TM_HASZONE
3191 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3192 # ifndef HAS_TM_TM_ZONE
3193 # define HAS_TM_TM_ZONE
3198 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3200 #ifdef HAS_TM_TM_ZONE
3203 Copy(localtime(&now), ptm, 1, struct tm);
3208 * mini_mktime - normalise struct tm values without the localtime()
3209 * semantics (and overhead) of mktime().
3212 Perl_mini_mktime(pTHX_ struct tm *ptm)
3216 int month, mday, year, jday;
3217 int odd_cent, odd_year;
3219 #define DAYS_PER_YEAR 365
3220 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3221 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3222 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3223 #define SECS_PER_HOUR (60*60)
3224 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3225 /* parentheses deliberately absent on these two, otherwise they don't work */
3226 #define MONTH_TO_DAYS 153/5
3227 #define DAYS_TO_MONTH 5/153
3228 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3229 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3230 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3231 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3234 * Year/day algorithm notes:
3236 * With a suitable offset for numeric value of the month, one can find
3237 * an offset into the year by considering months to have 30.6 (153/5) days,
3238 * using integer arithmetic (i.e., with truncation). To avoid too much
3239 * messing about with leap days, we consider January and February to be
3240 * the 13th and 14th month of the previous year. After that transformation,
3241 * we need the month index we use to be high by 1 from 'normal human' usage,
3242 * so the month index values we use run from 4 through 15.
3244 * Given that, and the rules for the Gregorian calendar (leap years are those
3245 * divisible by 4 unless also divisible by 100, when they must be divisible
3246 * by 400 instead), we can simply calculate the number of days since some
3247 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3248 * the days we derive from our month index, and adding in the day of the
3249 * month. The value used here is not adjusted for the actual origin which
3250 * it normally would use (1 January A.D. 1), since we're not exposing it.
3251 * We're only building the value so we can turn around and get the
3252 * normalised values for the year, month, day-of-month, and day-of-year.
3254 * For going backward, we need to bias the value we're using so that we find
3255 * the right year value. (Basically, we don't want the contribution of
3256 * March 1st to the number to apply while deriving the year). Having done
3257 * that, we 'count up' the contribution to the year number by accounting for
3258 * full quadracenturies (400-year periods) with their extra leap days, plus
3259 * the contribution from full centuries (to avoid counting in the lost leap
3260 * days), plus the contribution from full quad-years (to count in the normal
3261 * leap days), plus the leftover contribution from any non-leap years.
3262 * At this point, if we were working with an actual leap day, we'll have 0
3263 * days left over. This is also true for March 1st, however. So, we have
3264 * to special-case that result, and (earlier) keep track of the 'odd'
3265 * century and year contributions. If we got 4 extra centuries in a qcent,
3266 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3267 * Otherwise, we add back in the earlier bias we removed (the 123 from
3268 * figuring in March 1st), find the month index (integer division by 30.6),
3269 * and the remainder is the day-of-month. We then have to convert back to
3270 * 'real' months (including fixing January and February from being 14/15 in
3271 * the previous year to being in the proper year). After that, to get
3272 * tm_yday, we work with the normalised year and get a new yearday value for
3273 * January 1st, which we subtract from the yearday value we had earlier,
3274 * representing the date we've re-built. This is done from January 1
3275 * because tm_yday is 0-origin.
3277 * Since POSIX time routines are only guaranteed to work for times since the
3278 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3279 * applies Gregorian calendar rules even to dates before the 16th century
3280 * doesn't bother me. Besides, you'd need cultural context for a given
3281 * date to know whether it was Julian or Gregorian calendar, and that's
3282 * outside the scope for this routine. Since we convert back based on the
3283 * same rules we used to build the yearday, you'll only get strange results
3284 * for input which needed normalising, or for the 'odd' century years which
3285 * were leap years in the Julian calander but not in the Gregorian one.
3286 * I can live with that.
3288 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3289 * that's still outside the scope for POSIX time manipulation, so I don't
3293 year = 1900 + ptm->tm_year;
3294 month = ptm->tm_mon;
3295 mday = ptm->tm_mday;
3296 /* allow given yday with no month & mday to dominate the result */
3297 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3300 jday = 1 + ptm->tm_yday;
3309 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3310 yearday += month*MONTH_TO_DAYS + mday + jday;
3312 * Note that we don't know when leap-seconds were or will be,
3313 * so we have to trust the user if we get something which looks
3314 * like a sensible leap-second. Wild values for seconds will
3315 * be rationalised, however.
3317 if ((unsigned) ptm->tm_sec <= 60) {
3324 secs += 60 * ptm->tm_min;
3325 secs += SECS_PER_HOUR * ptm->tm_hour;
3327 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3328 /* got negative remainder, but need positive time */
3329 /* back off an extra day to compensate */
3330 yearday += (secs/SECS_PER_DAY)-1;
3331 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3334 yearday += (secs/SECS_PER_DAY);
3335 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3338 else if (secs >= SECS_PER_DAY) {
3339 yearday += (secs/SECS_PER_DAY);
3340 secs %= SECS_PER_DAY;
3342 ptm->tm_hour = secs/SECS_PER_HOUR;
3343 secs %= SECS_PER_HOUR;
3344 ptm->tm_min = secs/60;
3346 ptm->tm_sec += secs;
3347 /* done with time of day effects */
3349 * The algorithm for yearday has (so far) left it high by 428.
3350 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3351 * bias it by 123 while trying to figure out what year it
3352 * really represents. Even with this tweak, the reverse
3353 * translation fails for years before A.D. 0001.
3354 * It would still fail for Feb 29, but we catch that one below.
3356 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3357 yearday -= YEAR_ADJUST;
3358 year = (yearday / DAYS_PER_QCENT) * 400;
3359 yearday %= DAYS_PER_QCENT;
3360 odd_cent = yearday / DAYS_PER_CENT;
3361 year += odd_cent * 100;
3362 yearday %= DAYS_PER_CENT;
3363 year += (yearday / DAYS_PER_QYEAR) * 4;
3364 yearday %= DAYS_PER_QYEAR;
3365 odd_year = yearday / DAYS_PER_YEAR;
3367 yearday %= DAYS_PER_YEAR;
3368 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3373 yearday += YEAR_ADJUST; /* recover March 1st crock */
3374 month = yearday*DAYS_TO_MONTH;
3375 yearday -= month*MONTH_TO_DAYS;
3376 /* recover other leap-year adjustment */
3385 ptm->tm_year = year - 1900;
3387 ptm->tm_mday = yearday;
3388 ptm->tm_mon = month;
3392 ptm->tm_mon = month - 1;
3394 /* re-build yearday based on Jan 1 to get tm_yday */
3396 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3397 yearday += 14*MONTH_TO_DAYS + 1;
3398 ptm->tm_yday = jday - yearday;
3399 /* fix tm_wday if not overridden by caller */
3400 if ((unsigned)ptm->tm_wday > 6)
3401 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3405 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3413 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3416 mytm.tm_hour = hour;
3417 mytm.tm_mday = mday;
3419 mytm.tm_year = year;
3420 mytm.tm_wday = wday;
3421 mytm.tm_yday = yday;
3422 mytm.tm_isdst = isdst;
3424 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3425 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3430 #ifdef HAS_TM_TM_GMTOFF
3431 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3433 #ifdef HAS_TM_TM_ZONE
3434 mytm.tm_zone = mytm2.tm_zone;
3439 New(0, buf, buflen, char);
3440 len = strftime(buf, buflen, fmt, &mytm);
3442 ** The following is needed to handle to the situation where
3443 ** tmpbuf overflows. Basically we want to allocate a buffer
3444 ** and try repeatedly. The reason why it is so complicated
3445 ** is that getting a return value of 0 from strftime can indicate
3446 ** one of the following:
3447 ** 1. buffer overflowed,
3448 ** 2. illegal conversion specifier, or
3449 ** 3. the format string specifies nothing to be returned(not
3450 ** an error). This could be because format is an empty string
3451 ** or it specifies %p that yields an empty string in some locale.
3452 ** If there is a better way to make it portable, go ahead by
3455 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3458 /* Possibly buf overflowed - try again with a bigger buf */
3459 int fmtlen = strlen(fmt);
3460 int bufsize = fmtlen + buflen;
3462 New(0, buf, bufsize, char);
3464 buflen = strftime(buf, bufsize, fmt, &mytm);
3465 if (buflen > 0 && buflen < bufsize)
3467 /* heuristic to prevent out-of-memory errors */
3468 if (bufsize > 100*fmtlen) {
3474 Renew(buf, bufsize, char);
3479 Perl_croak(aTHX_ "panic: no strftime");
3484 #define SV_CWD_RETURN_UNDEF \
3485 sv_setsv(sv, &PL_sv_undef); \
3488 #define SV_CWD_ISDOT(dp) \
3489 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3490 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3493 =head1 Miscellaneous Functions
3495 =for apidoc getcwd_sv
3497 Fill the sv with current working directory
3502 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3503 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3504 * getcwd(3) if available
3505 * Comments from the orignal:
3506 * This is a faster version of getcwd. It's also more dangerous
3507 * because you might chdir out of a directory that you can't chdir
3511 Perl_getcwd_sv(pTHX_ register SV *sv)
3515 #ifndef INCOMPLETE_TAINTS
3521 char buf[MAXPATHLEN];
3523 /* Some getcwd()s automatically allocate a buffer of the given
3524 * size from the heap if they are given a NULL buffer pointer.
3525 * The problem is that this behaviour is not portable. */
3526 if (getcwd(buf, sizeof(buf) - 1)) {
3527 STRLEN len = strlen(buf);
3528 sv_setpvn(sv, buf, len);
3532 sv_setsv(sv, &PL_sv_undef);
3540 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3541 int namelen, pathlen=0;
3545 (void)SvUPGRADE(sv, SVt_PV);
3547 if (PerlLIO_lstat(".", &statbuf) < 0) {
3548 SV_CWD_RETURN_UNDEF;
3551 orig_cdev = statbuf.st_dev;
3552 orig_cino = statbuf.st_ino;
3560 if (PerlDir_chdir("..") < 0) {
3561 SV_CWD_RETURN_UNDEF;
3563 if (PerlLIO_stat(".", &statbuf) < 0) {
3564 SV_CWD_RETURN_UNDEF;
3567 cdev = statbuf.st_dev;
3568 cino = statbuf.st_ino;
3570 if (odev == cdev && oino == cino) {
3573 if (!(dir = PerlDir_open("."))) {
3574 SV_CWD_RETURN_UNDEF;
3577 while ((dp = PerlDir_read(dir)) != NULL) {
3579 namelen = dp->d_namlen;
3581 namelen = strlen(dp->d_name);
3584 if (SV_CWD_ISDOT(dp)) {
3588 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3589 SV_CWD_RETURN_UNDEF;
3592 tdev = statbuf.st_dev;
3593 tino = statbuf.st_ino;
3594 if (tino == oino && tdev == odev) {
3600 SV_CWD_RETURN_UNDEF;
3603 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3604 SV_CWD_RETURN_UNDEF;
3607 SvGROW(sv, pathlen + namelen + 1);
3611 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3614 /* prepend current directory to the front */
3616 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3617 pathlen += (namelen + 1);
3619 #ifdef VOID_CLOSEDIR
3622 if (PerlDir_close(dir) < 0) {
3623 SV_CWD_RETURN_UNDEF;
3629 SvCUR_set(sv, pathlen);
3633 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3634 SV_CWD_RETURN_UNDEF;
3637 if (PerlLIO_stat(".", &statbuf) < 0) {
3638 SV_CWD_RETURN_UNDEF;
3641 cdev = statbuf.st_dev;
3642 cino = statbuf.st_ino;
3644 if (cdev != orig_cdev || cino != orig_cino) {
3645 Perl_croak(aTHX_ "Unstable directory path, "
3646 "current directory changed unexpectedly");
3658 =for apidoc scan_version
3660 Returns a pointer to the next character after the parsed
3661 version string, as well as upgrading the passed in SV to
3664 Function must be called with an already existing SV like
3667 s = scan_version(s,SV *sv, bool qv);
3669 Performs some preprocessing to the string to ensure that
3670 it has the correct characteristics of a version. Flags the
3671 object if it contains an underscore (which denotes this
3672 is a alpha version). The boolean qv denotes that the version
3673 should be interpreted as if it had multiple decimals, even if
3680 Perl_scan_version(pTHX_ char *s, SV *rv, bool qv)
3682 const char *start = s;
3686 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3687 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3689 /* pre-scan the imput string to check for decimals */
3690 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3695 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3698 else if ( *pos == '_' )
3701 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3709 pos++; /* get past 'v' */
3710 qv = 1; /* force quoted version processing */
3712 while (isDIGIT(*pos))
3714 if (!isALPHA(*pos)) {
3717 if (*s == 'v') s++; /* get past 'v' */
3722 /* this is atoi() that delimits on underscores */
3726 if ( s < pos && s > start && *(s-1) == '_' ) {
3727 mult *= -1; /* alpha version */
3729 /* the following if() will only be true after the decimal
3730 * point of a version originally created with a bare
3731 * floating point number, i.e. not quoted in any way
3733 if ( !qv && s > start+1 && saw_period == 1 && !saw_under ) {
3737 rev += (*s - '0') * mult;
3739 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3740 Perl_croak(aTHX_ "Integer overflow in version");
3745 while (--end >= s) {
3747 rev += (*end - '0') * mult;
3749 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3750 Perl_croak(aTHX_ "Integer overflow in version");
3755 /* Append revision */
3756 av_push((AV *)sv, newSViv(rev));
3757 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3759 else if ( isDIGIT(*pos) )
3765 while ( isDIGIT(*pos) ) {
3766 if ( !saw_under && saw_period == 1 && pos-s == 3 )
3776 =for apidoc new_version
3778 Returns a new version object based on the passed in SV:
3780 SV *sv = new_version(SV *ver);
3782 Does not alter the passed in ver SV. See "upg_version" if you
3783 want to upgrade the SV.
3789 Perl_new_version(pTHX_ SV *ver)
3793 if ( SvVOK(ver) ) { /* already a v-string */
3795 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3796 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3797 sv_setpv(rv,version);
3802 sv_setsv(rv,ver); /* make a duplicate */
3811 =for apidoc upg_version
3813 In-place upgrade of the supplied SV to a version object.
3815 SV *sv = upg_version(SV *sv);
3817 Returns a pointer to the upgraded SV.
3823 Perl_upg_version(pTHX_ SV *ver)
3828 if ( SvNOK(ver) ) /* may get too much accuracy */
3831 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
3832 version = savepv(tbuf);
3835 else if ( SvVOK(ver) ) { /* already a v-string */
3836 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3837 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3841 else /* must be a string or something like a string */
3844 version = savepv(SvPV(ver,n_a));
3846 (void)scan_version(version, ver, qv);
3855 Accepts a version object and returns the normalized floating
3856 point representation. Call like:
3860 NOTE: you can pass either the object directly or the SV
3861 contained within the RV.
3867 Perl_vnumify(pTHX_ SV *vs)
3873 len = av_len((AV *)vs);
3876 Perl_sv_catpv(aTHX_ sv,"0");
3879 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
3880 Perl_sv_setpvf(aTHX_ sv,"%d.", PERL_ABS(digit));
3881 for ( i = 1 ; i <= len ; i++ )
3883 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
3884 Perl_sv_catpvf(aTHX_ sv,"%03d", PERL_ABS(digit));
3887 Perl_sv_catpv(aTHX_ sv,"000");
3888 sv_setnv(sv, SvNV(sv));
3893 =for apidoc vstringify
3895 Accepts a version object and returns the normalized string
3896 representation. Call like:
3898 sv = vstringify(rv);
3900 NOTE: you can pass either the object directly or the SV
3901 contained within the RV.
3907 Perl_vstringify(pTHX_ SV *vs)
3913 len = av_len((AV *)vs);
3916 Perl_sv_catpv(aTHX_ sv,"");
3919 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
3920 Perl_sv_setpvf(aTHX_ sv,"%"IVdf,(IV)digit);
3921 for ( i = 1 ; i <= len ; i++ )
3923 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
3925 Perl_sv_catpvf(aTHX_ sv,"_%"IVdf,(IV)-digit);
3927 Perl_sv_catpvf(aTHX_ sv,".%"IVdf,(IV)digit);
3930 if ( len <= 2 ) { /* short version, must be at least three */
3931 for ( len = 2 - len; len != 0; len-- )
3932 Perl_sv_catpv(aTHX_ sv,".0");
3941 Version object aware cmp. Both operands must already have been
3942 converted into version objects.
3948 Perl_vcmp(pTHX_ SV *lsv, SV *rsv)
3955 l = av_len((AV *)lsv);
3956 r = av_len((AV *)rsv);
3960 while ( i <= m && retval == 0 )
3962 I32 left = SvIV(*av_fetch((AV *)lsv,i,0));
3963 I32 right = SvIV(*av_fetch((AV *)rsv,i,0));
3964 bool lalpha = left < 0 ? 1 : 0;
3965 bool ralpha = right < 0 ? 1 : 0;
3968 if ( left < right || (left == right && lalpha && !ralpha) )
3970 if ( left > right || (left == right && ralpha && !lalpha) )
3975 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
3979 while ( i <= r && retval == 0 )
3981 if ( SvIV(*av_fetch((AV *)rsv,i,0)) != 0 )
3982 retval = -1; /* not a match after all */
3988 while ( i <= l && retval == 0 )
3990 if ( SvIV(*av_fetch((AV *)lsv,i,0)) != 0 )
3991 retval = +1; /* not a match after all */
3999 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4000 # define EMULATE_SOCKETPAIR_UDP
4003 #ifdef EMULATE_SOCKETPAIR_UDP
4005 S_socketpair_udp (int fd[2]) {
4007 /* Fake a datagram socketpair using UDP to localhost. */
4008 int sockets[2] = {-1, -1};
4009 struct sockaddr_in addresses[2];
4011 Sock_size_t size = sizeof(struct sockaddr_in);
4012 unsigned short port;
4015 memset(&addresses, 0, sizeof(addresses));
4018 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4019 if (sockets[i] == -1)
4020 goto tidy_up_and_fail;
4022 addresses[i].sin_family = AF_INET;
4023 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4024 addresses[i].sin_port = 0; /* kernel choses port. */
4025 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4026 sizeof(struct sockaddr_in)) == -1)
4027 goto tidy_up_and_fail;
4030 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4031 for each connect the other socket to it. */
4034 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4036 goto tidy_up_and_fail;
4037 if (size != sizeof(struct sockaddr_in))
4038 goto abort_tidy_up_and_fail;
4039 /* !1 is 0, !0 is 1 */
4040 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4041 sizeof(struct sockaddr_in)) == -1)
4042 goto tidy_up_and_fail;
4045 /* Now we have 2 sockets connected to each other. I don't trust some other
4046 process not to have already sent a packet to us (by random) so send
4047 a packet from each to the other. */
4050 /* I'm going to send my own port number. As a short.
4051 (Who knows if someone somewhere has sin_port as a bitfield and needs
4052 this routine. (I'm assuming crays have socketpair)) */
4053 port = addresses[i].sin_port;
4054 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4055 if (got != sizeof(port)) {
4057 goto tidy_up_and_fail;
4058 goto abort_tidy_up_and_fail;
4062 /* Packets sent. I don't trust them to have arrived though.
4063 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4064 connect to localhost will use a second kernel thread. In 2.6 the
4065 first thread running the connect() returns before the second completes,
4066 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4067 returns 0. Poor programs have tripped up. One poor program's authors'
4068 had a 50-1 reverse stock split. Not sure how connected these were.)
4069 So I don't trust someone not to have an unpredictable UDP stack.
4073 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4074 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4078 FD_SET(sockets[0], &rset);
4079 FD_SET(sockets[1], &rset);
4081 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4082 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4083 || !FD_ISSET(sockets[1], &rset)) {
4084 /* I hope this is portable and appropriate. */
4086 goto tidy_up_and_fail;
4087 goto abort_tidy_up_and_fail;
4091 /* And the paranoia department even now doesn't trust it to have arrive
4092 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4094 struct sockaddr_in readfrom;
4095 unsigned short buffer[2];
4100 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4101 sizeof(buffer), MSG_DONTWAIT,
4102 (struct sockaddr *) &readfrom, &size);
4104 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4106 (struct sockaddr *) &readfrom, &size);
4110 goto tidy_up_and_fail;
4111 if (got != sizeof(port)
4112 || size != sizeof(struct sockaddr_in)
4113 /* Check other socket sent us its port. */
4114 || buffer[0] != (unsigned short) addresses[!i].sin_port
4115 /* Check kernel says we got the datagram from that socket */
4116 || readfrom.sin_family != addresses[!i].sin_family
4117 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4118 || readfrom.sin_port != addresses[!i].sin_port)
4119 goto abort_tidy_up_and_fail;
4122 /* My caller (my_socketpair) has validated that this is non-NULL */
4125 /* I hereby declare this connection open. May God bless all who cross
4129 abort_tidy_up_and_fail:
4130 errno = ECONNABORTED;
4133 int save_errno = errno;
4134 if (sockets[0] != -1)
4135 PerlLIO_close(sockets[0]);
4136 if (sockets[1] != -1)
4137 PerlLIO_close(sockets[1]);
4142 #endif /* EMULATE_SOCKETPAIR_UDP */
4144 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4146 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4147 /* Stevens says that family must be AF_LOCAL, protocol 0.
4148 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4153 struct sockaddr_in listen_addr;
4154 struct sockaddr_in connect_addr;
4159 || family != AF_UNIX
4162 errno = EAFNOSUPPORT;
4170 #ifdef EMULATE_SOCKETPAIR_UDP
4171 if (type == SOCK_DGRAM)
4172 return S_socketpair_udp(fd);
4175 listener = PerlSock_socket(AF_INET, type, 0);
4178 memset(&listen_addr, 0, sizeof(listen_addr));
4179 listen_addr.sin_family = AF_INET;
4180 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4181 listen_addr.sin_port = 0; /* kernel choses port. */
4182 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4183 sizeof(listen_addr)) == -1)
4184 goto tidy_up_and_fail;
4185 if (PerlSock_listen(listener, 1) == -1)
4186 goto tidy_up_and_fail;
4188 connector = PerlSock_socket(AF_INET, type, 0);
4189 if (connector == -1)
4190 goto tidy_up_and_fail;
4191 /* We want to find out the port number to connect to. */
4192 size = sizeof(connect_addr);
4193 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4195 goto tidy_up_and_fail;
4196 if (size != sizeof(connect_addr))
4197 goto abort_tidy_up_and_fail;
4198 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4199 sizeof(connect_addr)) == -1)
4200 goto tidy_up_and_fail;
4202 size = sizeof(listen_addr);
4203 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4206 goto tidy_up_and_fail;
4207 if (size != sizeof(listen_addr))
4208 goto abort_tidy_up_and_fail;
4209 PerlLIO_close(listener);
4210 /* Now check we are talking to ourself by matching port and host on the
4212 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4214 goto tidy_up_and_fail;
4215 if (size != sizeof(connect_addr)
4216 || listen_addr.sin_family != connect_addr.sin_family
4217 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4218 || listen_addr.sin_port != connect_addr.sin_port) {
4219 goto abort_tidy_up_and_fail;
4225 abort_tidy_up_and_fail:
4226 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4229 int save_errno = errno;
4231 PerlLIO_close(listener);
4232 if (connector != -1)
4233 PerlLIO_close(connector);
4235 PerlLIO_close(acceptor);
4241 /* In any case have a stub so that there's code corresponding
4242 * to the my_socketpair in global.sym. */
4244 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4245 #ifdef HAS_SOCKETPAIR
4246 return socketpair(family, type, protocol, fd);
4255 =for apidoc sv_nosharing
4257 Dummy routine which "shares" an SV when there is no sharing module present.
4258 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4259 some level of strict-ness.
4265 Perl_sv_nosharing(pTHX_ SV *sv)
4270 =for apidoc sv_nolocking
4272 Dummy routine which "locks" an SV when there is no locking module present.
4273 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4274 some level of strict-ness.
4280 Perl_sv_nolocking(pTHX_ SV *sv)
4286 =for apidoc sv_nounlocking
4288 Dummy routine which "unlocks" an SV when there is no locking module present.
4289 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4290 some level of strict-ness.
4296 Perl_sv_nounlocking(pTHX_ SV *sv)
4301 Perl_parse_unicode_opts(pTHX_ char **popt)
4308 opt = (U32) atoi(p);
4309 while (isDIGIT(*p)) p++;
4310 if (*p && *p != '\n' && *p != '\r')
4311 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4316 case PERL_UNICODE_STDIN:
4317 opt |= PERL_UNICODE_STDIN_FLAG; break;
4318 case PERL_UNICODE_STDOUT:
4319 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4320 case PERL_UNICODE_STDERR:
4321 opt |= PERL_UNICODE_STDERR_FLAG; break;
4322 case PERL_UNICODE_STD:
4323 opt |= PERL_UNICODE_STD_FLAG; break;
4324 case PERL_UNICODE_IN:
4325 opt |= PERL_UNICODE_IN_FLAG; break;
4326 case PERL_UNICODE_OUT:
4327 opt |= PERL_UNICODE_OUT_FLAG; break;
4328 case PERL_UNICODE_INOUT:
4329 opt |= PERL_UNICODE_INOUT_FLAG; break;
4330 case PERL_UNICODE_LOCALE:
4331 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4332 case PERL_UNICODE_ARGV:
4333 opt |= PERL_UNICODE_ARGV_FLAG; break;
4335 if (*p != '\n' && *p != '\r')
4337 "Unknown Unicode option letter '%c'", *p);
4343 opt = PERL_UNICODE_DEFAULT_FLAGS;
4345 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4346 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4347 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4358 * This is really just a quick hack which grabs various garbage
4359 * values. It really should be a real hash algorithm which
4360 * spreads the effect of every input bit onto every output bit,
4361 * if someone who knows about such things would bother to write it.
4362 * Might be a good idea to add that function to CORE as well.
4363 * No numbers below come from careful analysis or anything here,
4364 * except they are primes and SEED_C1 > 1E6 to get a full-width
4365 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4366 * probably be bigger too.
4369 # define SEED_C1 1000003
4370 #define SEED_C4 73819
4372 # define SEED_C1 25747
4373 #define SEED_C4 20639
4377 #define SEED_C5 26107
4379 #ifndef PERL_NO_DEV_RANDOM
4384 # include <starlet.h>
4385 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4386 * in 100-ns units, typically incremented ever 10 ms. */
4387 unsigned int when[2];
4389 # ifdef HAS_GETTIMEOFDAY
4390 struct timeval when;
4396 /* This test is an escape hatch, this symbol isn't set by Configure. */
4397 #ifndef PERL_NO_DEV_RANDOM
4398 #ifndef PERL_RANDOM_DEVICE
4399 /* /dev/random isn't used by default because reads from it will block
4400 * if there isn't enough entropy available. You can compile with
4401 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4402 * is enough real entropy to fill the seed. */
4403 # define PERL_RANDOM_DEVICE "/dev/urandom"
4405 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4407 if (PerlLIO_read(fd, &u, sizeof u) != sizeof u)
4416 _ckvmssts(sys$gettim(when));
4417 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4419 # ifdef HAS_GETTIMEOFDAY
4420 PerlProc_gettimeofday(&when,NULL);
4421 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4424 u = (U32)SEED_C1 * when;
4427 u += SEED_C3 * (U32)PerlProc_getpid();
4428 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4429 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4430 u += SEED_C5 * (U32)PTR2UV(&when);
4436 Perl_get_hash_seed(pTHX)
4438 char *s = PerlEnv_getenv("PERL_HASH_SEED");
4442 while (isSPACE(*s)) s++;
4443 if (s && isDIGIT(*s))
4444 myseed = (UV)Atoul(s);
4446 #ifdef USE_HASH_SEED_EXPLICIT
4450 /* Compute a random seed */
4451 (void)seedDrand01((Rand_seed_t)seed());
4452 myseed = (UV)(Drand01() * (NV)UV_MAX);
4453 #if RANDBITS < (UVSIZE * 8)
4454 /* Since there are not enough randbits to to reach all
4455 * the bits of a UV, the low bits might need extra
4456 * help. Sum in another random number that will
4457 * fill in the low bits. */
4459 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4460 #endif /* RANDBITS < (UVSIZE * 8) */
4461 if (myseed == 0) { /* Superparanoia. */
4462 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4464 Perl_croak(aTHX_ "Your random numbers are not that random");
4467 PL_rehash_seed_set = TRUE;