3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 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
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
60 /* paranoid version of system's malloc() */
63 Perl_safesysmalloc(MEM_SIZE size)
69 PerlIO_printf(Perl_error_log,
70 "Allocation too large: %lx\n", size) FLUSH;
73 #endif /* HAS_64K_LIMIT */
76 Perl_croak_nocontext("panic: malloc");
78 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
79 PERL_ALLOC_CHECK(ptr);
80 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
86 /* Can't use PerlIO to write as it allocates memory */
87 PerlLIO_write(PerlIO_fileno(Perl_error_log),
88 PL_no_mem, strlen(PL_no_mem));
95 /* paranoid version of system's realloc() */
98 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
102 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
103 Malloc_t PerlMem_realloc();
104 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
108 PerlIO_printf(Perl_error_log,
109 "Reallocation too large: %lx\n", size) FLUSH;
112 #endif /* HAS_64K_LIMIT */
119 return safesysmalloc(size);
122 Perl_croak_nocontext("panic: realloc");
124 ptr = (Malloc_t)PerlMem_realloc(where,size);
125 PERL_ALLOC_CHECK(ptr);
127 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
128 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
135 /* Can't use PerlIO to write as it allocates memory */
136 PerlLIO_write(PerlIO_fileno(Perl_error_log),
137 PL_no_mem, strlen(PL_no_mem));
144 /* safe version of system's free() */
147 Perl_safesysfree(Malloc_t where)
150 #ifdef PERL_IMPLICIT_SYS
153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
159 /* safe version of system's calloc() */
162 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
168 if (size * count > 0xffff) {
169 PerlIO_printf(Perl_error_log,
170 "Allocation too large: %lx\n", size * count) FLUSH;
173 #endif /* HAS_64K_LIMIT */
175 if ((long)size < 0 || (long)count < 0)
176 Perl_croak_nocontext("panic: calloc");
179 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
180 PERL_ALLOC_CHECK(ptr);
181 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));
183 memset((void*)ptr, 0, size);
189 /* Can't use PerlIO to write as it allocates memory */
190 PerlLIO_write(PerlIO_fileno(Perl_error_log),
191 PL_no_mem, strlen(PL_no_mem));
198 /* These must be defined when not using Perl's malloc for binary
203 Malloc_t Perl_malloc (MEM_SIZE nbytes)
206 return (Malloc_t)PerlMem_malloc(nbytes);
209 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
212 return (Malloc_t)PerlMem_calloc(elements, size);
215 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
218 return (Malloc_t)PerlMem_realloc(where, nbytes);
221 Free_t Perl_mfree (Malloc_t where)
229 /* copy a string up to some (non-backslashed) delimiter, if any */
232 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
235 for (tolen = 0; from < fromend; from++, tolen++) {
237 if (from[1] == delim)
246 else if (*from == delim)
257 /* return ptr to little string in big string, NULL if not found */
258 /* This routine was donated by Corey Satten. */
261 Perl_instr(pTHX_ register const char *big, register const char *little)
271 register const char *s, *x;
274 for (x=big,s=little; *s; /**/ ) {
283 return (char*)(big-1);
288 /* same as instr but allow embedded nulls */
291 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
293 register const I32 first = *little;
294 register const char *littleend = lend;
296 if (!first && little >= littleend)
298 if (bigend - big < littleend - little)
300 bigend -= littleend - little++;
301 while (big <= bigend) {
302 register const char *s, *x;
305 for (x=big,s=little; s < littleend; /**/ ) {
312 return (char*)(big-1);
317 /* reverse of the above--find last substring */
320 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
322 register const char *bigbeg;
323 register const I32 first = *little;
324 register const char *littleend = lend;
326 if (!first && little >= littleend)
327 return (char*)bigend;
329 big = bigend - (littleend - little++);
330 while (big >= bigbeg) {
331 register const char *s, *x;
334 for (x=big+2,s=little; s < littleend; /**/ ) {
341 return (char*)(big+1);
346 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
348 /* As a space optimization, we do not compile tables for strings of length
349 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
350 special-cased in fbm_instr().
352 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
355 =head1 Miscellaneous Functions
357 =for apidoc fbm_compile
359 Analyses the string in order to make fast searches on it using fbm_instr()
360 -- the Boyer-Moore algorithm.
366 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
368 const register U8 *s;
375 if (flags & FBMcf_TAIL) {
376 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
377 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
378 if (mg && mg->mg_len >= 0)
381 s = (U8*)SvPV_force_mutable(sv, len);
382 SvUPGRADE(sv, SVt_PVBM);
383 if (len == 0) /* TAIL might be on a zero-length string. */
386 const unsigned char *sb;
387 const U8 mlen = (len>255) ? 255 : (U8)len;
389 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
390 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
391 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
392 memset((void*)table, mlen, 256);
393 table[-1] = (U8)flags;
395 sb = s - mlen + 1; /* first char (maybe) */
397 if (table[*s] == mlen)
402 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
405 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
406 for (i = 0; i < len; i++) {
407 if (PL_freq[s[i]] < frequency) {
409 frequency = PL_freq[s[i]];
412 BmRARE(sv) = s[rarest];
413 BmPREVIOUS(sv) = (U16)rarest;
414 BmUSEFUL(sv) = 100; /* Initial value */
415 if (flags & FBMcf_TAIL)
417 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
418 BmRARE(sv),BmPREVIOUS(sv)));
421 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
422 /* If SvTAIL is actually due to \Z or \z, this gives false positives
426 =for apidoc fbm_instr
428 Returns the location of the SV in the string delimited by C<str> and
429 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
430 does not have to be fbm_compiled, but the search will not be as fast
437 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
439 register unsigned char *s;
441 register const unsigned char *little
442 = (const unsigned char *)SvPV_const(littlestr,l);
443 register STRLEN littlelen = l;
444 register const I32 multiline = flags & FBMrf_MULTILINE;
446 if ((STRLEN)(bigend - big) < littlelen) {
447 if ( SvTAIL(littlestr)
448 && ((STRLEN)(bigend - big) == littlelen - 1)
450 || (*big == *little &&
451 memEQ((char *)big, (char *)little, littlelen - 1))))
456 if (littlelen <= 2) { /* Special-cased */
458 if (littlelen == 1) {
459 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
460 /* Know that bigend != big. */
461 if (bigend[-1] == '\n')
462 return (char *)(bigend - 1);
463 return (char *) bigend;
471 if (SvTAIL(littlestr))
472 return (char *) bigend;
476 return (char*)big; /* Cannot be SvTAIL! */
479 if (SvTAIL(littlestr) && !multiline) {
480 if (bigend[-1] == '\n' && bigend[-2] == *little)
481 return (char*)bigend - 2;
482 if (bigend[-1] == *little)
483 return (char*)bigend - 1;
487 /* This should be better than FBM if c1 == c2, and almost
488 as good otherwise: maybe better since we do less indirection.
489 And we save a lot of memory by caching no table. */
490 const unsigned char c1 = little[0];
491 const unsigned char c2 = little[1];
496 while (s <= bigend) {
506 goto check_1char_anchor;
517 goto check_1char_anchor;
520 while (s <= bigend) {
525 goto check_1char_anchor;
534 check_1char_anchor: /* One char and anchor! */
535 if (SvTAIL(littlestr) && (*bigend == *little))
536 return (char *)bigend; /* bigend is already decremented. */
539 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
540 s = bigend - littlelen;
541 if (s >= big && bigend[-1] == '\n' && *s == *little
542 /* Automatically of length > 2 */
543 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
545 return (char*)s; /* how sweet it is */
548 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
550 return (char*)s + 1; /* how sweet it is */
554 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
555 char *b = ninstr((char*)big,(char*)bigend,
556 (char*)little, (char*)little + littlelen);
558 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
559 /* Chop \n from littlestr: */
560 s = bigend - littlelen + 1;
562 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
571 { /* Do actual FBM. */
572 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
573 const register unsigned char *oldlittle;
575 if (littlelen > (STRLEN)(bigend - big))
577 --littlelen; /* Last char found by table lookup */
580 little += littlelen; /* last char */
586 if ((tmp = table[*s])) {
587 if ((s += tmp) < bigend)
591 else { /* less expensive than calling strncmp() */
592 register unsigned char * const olds = s;
597 if (*--s == *--little)
599 s = olds + 1; /* here we pay the price for failure */
601 if (s < bigend) /* fake up continue to outer loop */
609 if ( s == bigend && (table[-1] & FBMcf_TAIL)
610 && memEQ((char *)(bigend - littlelen),
611 (char *)(oldlittle - littlelen), littlelen) )
612 return (char*)bigend - littlelen;
617 /* start_shift, end_shift are positive quantities which give offsets
618 of ends of some substring of bigstr.
619 If "last" we want the last occurrence.
620 old_posp is the way of communication between consequent calls if
621 the next call needs to find the .
622 The initial *old_posp should be -1.
624 Note that we take into account SvTAIL, so one can get extra
625 optimizations if _ALL flag is set.
628 /* If SvTAIL is actually due to \Z or \z, this gives false positives
629 if PL_multiline. In fact if !PL_multiline the authoritative answer
630 is not supported yet. */
633 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
635 const register unsigned char *big;
637 register I32 previous;
639 const register unsigned char *little;
640 register I32 stop_pos;
641 const register unsigned char *littleend;
645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
648 if ( BmRARE(littlestr) == '\n'
649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
650 little = (const unsigned char *)(SvPVX_const(littlestr));
651 littleend = little + SvCUR(littlestr);
658 little = (const unsigned char *)(SvPVX_const(littlestr));
659 littleend = little + SvCUR(littlestr);
661 /* The value of pos we can start at: */
662 previous = BmPREVIOUS(littlestr);
663 big = (const unsigned char *)(SvPVX_const(bigstr));
664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
666 if (previous + start_shift > stop_pos) {
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
677 while (pos < previous + start_shift) {
678 if (!(pos += PL_screamnext[pos]))
683 const register unsigned char *s, *x;
684 if (pos >= stop_pos) break;
685 if (big[pos] != first)
687 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
693 if (s == littleend) {
695 if (!last) return (char *)(big+pos);
698 } while ( pos += PL_screamnext[pos] );
700 return (char *)(big+(*old_posp));
702 if (!SvTAIL(littlestr) || (end_shift > 0))
704 /* Ignore the trailing "\n". This code is not microoptimized */
705 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
706 stop_pos = littleend - little; /* Actual littlestr len */
711 && ((stop_pos == 1) ||
712 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
718 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
720 register const U8 *a = (const U8 *)s1;
721 register const U8 *b = (const U8 *)s2;
723 if (*a != *b && *a != PL_fold[*b])
731 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
734 register const U8 *a = (const U8 *)s1;
735 register const U8 *b = (const U8 *)s2;
737 if (*a != *b && *a != PL_fold_locale[*b])
744 /* copy a string to a safe spot */
747 =head1 Memory Management
751 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
752 string which is a duplicate of C<pv>. The size of the string is
753 determined by C<strlen()>. The memory allocated for the new string can
754 be freed with the C<Safefree()> function.
760 Perl_savepv(pTHX_ const char *pv)
766 const STRLEN pvlen = strlen(pv)+1;
767 New(902,newaddr,pvlen,char);
768 return strcpy(newaddr,pv);
773 /* same thing but with a known length */
778 Perl's version of what C<strndup()> would be if it existed. Returns a
779 pointer to a newly allocated string which is a duplicate of the first
780 C<len> bytes from C<pv>. The memory allocated for the new string can be
781 freed with the C<Safefree()> function.
787 Perl_savepvn(pTHX_ const char *pv, register I32 len)
789 register char *newaddr;
791 New(903,newaddr,len+1,char);
792 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
794 /* might not be null terminated */
796 return (char *) CopyD(pv,newaddr,len,char);
799 return (char *) ZeroD(newaddr,len+1,char);
804 =for apidoc savesharedpv
806 A version of C<savepv()> which allocates the duplicate string in memory
807 which is shared between threads.
812 Perl_savesharedpv(pTHX_ const char *pv)
814 register char *newaddr;
818 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
820 PerlLIO_write(PerlIO_fileno(Perl_error_log),
821 PL_no_mem, strlen(PL_no_mem));
824 return strcpy(newaddr,pv);
830 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
831 the passed in SV using C<SvPV()>
837 Perl_savesvpv(pTHX_ SV *sv)
840 const char *pv = SvPV_const(sv, len);
841 register char *newaddr;
844 New(903,newaddr,len,char);
845 return (char *) CopyD(pv,newaddr,len,char);
849 /* the SV for Perl_form() and mess() is not kept in an arena */
858 return sv_2mortal(newSVpvn("",0));
863 /* Create as PVMG now, to avoid any upgrading later */
865 Newz(905, any, 1, XPVMG);
866 SvFLAGS(sv) = SVt_PVMG;
867 SvANY(sv) = (void*)any;
869 SvREFCNT(sv) = 1 << 30; /* practically infinite */
874 #if defined(PERL_IMPLICIT_CONTEXT)
876 Perl_form_nocontext(const char* pat, ...)
882 retval = vform(pat, &args);
886 #endif /* PERL_IMPLICIT_CONTEXT */
889 =head1 Miscellaneous Functions
892 Takes a sprintf-style format pattern and conventional
893 (non-SV) arguments and returns the formatted string.
895 (char *) Perl_form(pTHX_ const char* pat, ...)
897 can be used any place a string (char *) is required:
899 char * s = Perl_form("%d.%d",major,minor);
901 Uses a single private buffer so if you want to format several strings you
902 must explicitly copy the earlier strings away (and free the copies when you
909 Perl_form(pTHX_ const char* pat, ...)
914 retval = vform(pat, &args);
920 Perl_vform(pTHX_ const char *pat, va_list *args)
922 SV *sv = mess_alloc();
923 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
927 #if defined(PERL_IMPLICIT_CONTEXT)
929 Perl_mess_nocontext(const char *pat, ...)
935 retval = vmess(pat, &args);
939 #endif /* PERL_IMPLICIT_CONTEXT */
942 Perl_mess(pTHX_ const char *pat, ...)
947 retval = vmess(pat, &args);
953 S_closest_cop(pTHX_ COP *cop, OP *o)
955 /* Look for PL_op starting from o. cop is the last COP we've seen. */
957 if (!o || o == PL_op) return cop;
959 if (o->op_flags & OPf_KIDS) {
961 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
965 /* If the OP_NEXTSTATE has been optimised away we can still use it
966 * the get the file and line number. */
968 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
971 /* Keep searching, and return when we've found something. */
973 new_cop = closest_cop(cop, kid);
974 if (new_cop) return new_cop;
984 Perl_vmess(pTHX_ const char *pat, va_list *args)
986 SV *sv = mess_alloc();
987 static const char dgd[] = " during global destruction.\n";
989 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
990 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
993 * Try and find the file and line for PL_op. This will usually be
994 * PL_curcop, but it might be a cop that has been optimised away. We
995 * can try to find such a cop by searching through the optree starting
996 * from the sibling of PL_curcop.
999 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1000 if (!cop) cop = PL_curcop;
1003 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1004 OutCopFILE(cop), (IV)CopLINE(cop));
1005 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1006 const bool line_mode = (RsSIMPLE(PL_rs) &&
1007 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1008 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1009 PL_last_in_gv == PL_argvgv ?
1010 "" : GvNAME(PL_last_in_gv),
1011 line_mode ? "line" : "chunk",
1012 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1014 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1020 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1026 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1027 && (io = GvIO(PL_stderrgv))
1028 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1035 SAVESPTR(PL_stderrgv);
1036 PL_stderrgv = Nullgv;
1038 PUSHSTACKi(PERLSI_MAGIC);
1042 PUSHs(SvTIED_obj((SV*)io, mg));
1043 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1045 call_method("PRINT", G_SCALAR);
1053 /* SFIO can really mess with your errno */
1056 PerlIO *serr = Perl_error_log;
1058 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1059 (void)PerlIO_flush(serr);
1066 /* Common code used by vcroak, vdie and vwarner */
1069 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1074 /* sv_2cv might call Perl_croak() */
1075 SV *olddiehook = PL_diehook;
1079 SAVESPTR(PL_diehook);
1080 PL_diehook = Nullsv;
1081 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1083 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1090 msg = newSVpvn(message, msglen);
1091 SvFLAGS(msg) |= utf8;
1099 PUSHSTACKi(PERLSI_DIEHOOK);
1103 call_sv((SV*)cv, G_DISCARD);
1110 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1114 const char *message;
1117 SV *msv = vmess(pat, args);
1118 if (PL_errors && SvCUR(PL_errors)) {
1119 sv_catsv(PL_errors, msv);
1120 message = SvPV_const(PL_errors, *msglen);
1121 SvCUR_set(PL_errors, 0);
1124 message = SvPV_const(msv,*msglen);
1125 *utf8 = SvUTF8(msv);
1131 DEBUG_S(PerlIO_printf(Perl_debug_log,
1132 "%p: die/croak: message = %s\ndiehook = %p\n",
1133 thr, message, PL_diehook));
1135 S_vdie_common(aTHX_ message, *msglen, *utf8);
1141 Perl_vdie(pTHX_ const char* pat, va_list *args)
1143 const char *message;
1144 const int was_in_eval = PL_in_eval;
1148 DEBUG_S(PerlIO_printf(Perl_debug_log,
1149 "%p: die: curstack = %p, mainstack = %p\n",
1150 thr, PL_curstack, PL_mainstack));
1152 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1154 PL_restartop = die_where(message, msglen);
1155 SvFLAGS(ERRSV) |= utf8;
1156 DEBUG_S(PerlIO_printf(Perl_debug_log,
1157 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1158 thr, PL_restartop, was_in_eval, PL_top_env));
1159 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1161 return PL_restartop;
1164 #if defined(PERL_IMPLICIT_CONTEXT)
1166 Perl_die_nocontext(const char* pat, ...)
1171 va_start(args, pat);
1172 o = vdie(pat, &args);
1176 #endif /* PERL_IMPLICIT_CONTEXT */
1179 Perl_die(pTHX_ const char* pat, ...)
1183 va_start(args, pat);
1184 o = vdie(pat, &args);
1190 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1192 const char *message;
1196 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1199 PL_restartop = die_where(message, msglen);
1200 SvFLAGS(ERRSV) |= utf8;
1204 message = SvPVx_const(ERRSV, msglen);
1206 write_to_stderr(message, msglen);
1210 #if defined(PERL_IMPLICIT_CONTEXT)
1212 Perl_croak_nocontext(const char *pat, ...)
1216 va_start(args, pat);
1221 #endif /* PERL_IMPLICIT_CONTEXT */
1224 =head1 Warning and Dieing
1228 This is the XSUB-writer's interface to Perl's C<die> function.
1229 Normally call this function the same way you call the C C<printf>
1230 function. Calling C<croak> returns control directly to Perl,
1231 sidestepping the normal C order of execution. See C<warn>.
1233 If you want to throw an exception object, assign the object to
1234 C<$@> and then pass C<Nullch> to croak():
1236 errsv = get_sv("@", TRUE);
1237 sv_setsv(errsv, exception_object);
1244 Perl_croak(pTHX_ const char *pat, ...)
1247 va_start(args, pat);
1254 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1257 const char *message;
1265 msv = vmess(pat, args);
1267 message = SvPV_const(msv, msglen);
1270 /* sv_2cv might call Perl_warn() */
1271 SV *oldwarnhook = PL_warnhook;
1273 SAVESPTR(PL_warnhook);
1274 PL_warnhook = Nullsv;
1275 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1277 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1283 msg = newSVpvn(message, msglen);
1284 SvFLAGS(msg) |= utf8;
1288 PUSHSTACKi(PERLSI_WARNHOOK);
1292 call_sv((SV*)cv, G_DISCARD);
1299 write_to_stderr(message, msglen);
1302 #if defined(PERL_IMPLICIT_CONTEXT)
1304 Perl_warn_nocontext(const char *pat, ...)
1308 va_start(args, pat);
1312 #endif /* PERL_IMPLICIT_CONTEXT */
1317 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1318 function the same way you call the C C<printf> function. See C<croak>.
1324 Perl_warn(pTHX_ const char *pat, ...)
1327 va_start(args, pat);
1332 #if defined(PERL_IMPLICIT_CONTEXT)
1334 Perl_warner_nocontext(U32 err, const char *pat, ...)
1338 va_start(args, pat);
1339 vwarner(err, pat, &args);
1342 #endif /* PERL_IMPLICIT_CONTEXT */
1345 Perl_warner(pTHX_ U32 err, const char* pat,...)
1348 va_start(args, pat);
1349 vwarner(err, pat, &args);
1354 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1358 SV * const msv = vmess(pat, args);
1360 const char *message = SvPV_const(msv, msglen);
1361 const I32 utf8 = SvUTF8(msv);
1365 S_vdie_common(aTHX_ message, msglen, utf8);
1368 PL_restartop = die_where(message, msglen);
1369 SvFLAGS(ERRSV) |= utf8;
1372 write_to_stderr(message, msglen);
1376 Perl_vwarn(aTHX_ pat, args);
1380 /* since we've already done strlen() for both nam and val
1381 * we can use that info to make things faster than
1382 * sprintf(s, "%s=%s", nam, val)
1384 #define my_setenv_format(s, nam, nlen, val, vlen) \
1385 Copy(nam, s, nlen, char); \
1387 Copy(val, s+(nlen+1), vlen, char); \
1388 *(s+(nlen+1+vlen)) = '\0'
1390 #ifdef USE_ENVIRON_ARRAY
1391 /* VMS' my_setenv() is in vms.c */
1392 #if !defined(WIN32) && !defined(NETWARE)
1394 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1398 /* only parent thread can modify process environment */
1399 if (PL_curinterp == aTHX)
1402 #ifndef PERL_USE_SAFE_PUTENV
1403 if (!PL_use_safe_putenv) {
1404 /* most putenv()s leak, so we manipulate environ directly */
1405 register I32 i=setenv_getix(nam); /* where does it go? */
1408 if (environ == PL_origenviron) { /* need we copy environment? */
1413 for (max = i; environ[max]; max++) ;
1414 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1415 for (j=0; j<max; j++) { /* copy environment */
1416 const int len = strlen(environ[j]);
1417 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1418 Copy(environ[j], tmpenv[j], len+1, char);
1420 tmpenv[max] = Nullch;
1421 environ = tmpenv; /* tell exec where it is now */
1424 safesysfree(environ[i]);
1425 while (environ[i]) {
1426 environ[i] = environ[i+1];
1431 if (!environ[i]) { /* does not exist yet */
1432 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1433 environ[i+1] = Nullch; /* make sure it's null terminated */
1436 safesysfree(environ[i]);
1440 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1441 /* all that work just for this */
1442 my_setenv_format(environ[i], nam, nlen, val, vlen);
1445 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1446 setenv(nam, val, 1);
1449 int nlen = strlen(nam), vlen;
1454 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1455 /* all that work just for this */
1456 my_setenv_format(new_env, nam, nlen, val, vlen);
1457 (void)putenv(new_env);
1458 # endif /* __CYGWIN__ */
1459 #ifndef PERL_USE_SAFE_PUTENV
1465 #else /* WIN32 || NETWARE */
1468 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1471 register char *envstr;
1472 const int nlen = strlen(nam);
1479 New(904, envstr, nlen+vlen+2, char);
1480 my_setenv_format(envstr, nam, nlen, val, vlen);
1481 (void)PerlEnv_putenv(envstr);
1485 #endif /* WIN32 || NETWARE */
1489 Perl_setenv_getix(pTHX_ const char *nam)
1491 register I32 i, len = strlen(nam);
1493 for (i = 0; environ[i]; i++) {
1496 strnicmp(environ[i],nam,len) == 0
1498 strnEQ(environ[i],nam,len)
1500 && environ[i][len] == '=')
1501 break; /* strnEQ must come first to avoid */
1502 } /* potential SEGV's */
1505 #endif /* !PERL_MICRO */
1507 #endif /* !VMS && !EPOC*/
1509 #ifdef UNLINK_ALL_VERSIONS
1511 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1515 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1520 /* this is a drop-in replacement for bcopy() */
1521 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1523 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1527 if (from - to >= 0) {
1535 *(--to) = *(--from);
1541 /* this is a drop-in replacement for memset() */
1544 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1554 /* this is a drop-in replacement for bzero() */
1555 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1557 Perl_my_bzero(register char *loc, register I32 len)
1567 /* this is a drop-in replacement for memcmp() */
1568 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1570 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1572 register const U8 *a = (const U8 *)s1;
1573 register const U8 *b = (const U8 *)s2;
1577 if ((tmp = *a++ - *b++))
1582 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1586 #ifdef USE_CHAR_VSPRINTF
1591 vsprintf(char *dest, const char *pat, char *args)
1595 fakebuf._ptr = dest;
1596 fakebuf._cnt = 32767;
1600 fakebuf._flag = _IOWRT|_IOSTRG;
1601 _doprnt(pat, args, &fakebuf); /* what a kludge */
1602 (void)putc('\0', &fakebuf);
1603 #ifdef USE_CHAR_VSPRINTF
1606 return 0; /* perl doesn't use return value */
1610 #endif /* HAS_VPRINTF */
1613 #if BYTEORDER != 0x4321
1615 Perl_my_swap(pTHX_ short s)
1617 #if (BYTEORDER & 1) == 0
1620 result = ((s & 255) << 8) + ((s >> 8) & 255);
1628 Perl_my_htonl(pTHX_ long l)
1632 char c[sizeof(long)];
1635 #if BYTEORDER == 0x1234
1636 u.c[0] = (l >> 24) & 255;
1637 u.c[1] = (l >> 16) & 255;
1638 u.c[2] = (l >> 8) & 255;
1642 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1643 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1648 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1649 u.c[o & 0xf] = (l >> s) & 255;
1657 Perl_my_ntohl(pTHX_ long l)
1661 char c[sizeof(long)];
1664 #if BYTEORDER == 0x1234
1665 u.c[0] = (l >> 24) & 255;
1666 u.c[1] = (l >> 16) & 255;
1667 u.c[2] = (l >> 8) & 255;
1671 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1672 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1679 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1680 l |= (u.c[o & 0xf] & 255) << s;
1687 #endif /* BYTEORDER != 0x4321 */
1691 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1692 * If these functions are defined,
1693 * the BYTEORDER is neither 0x1234 nor 0x4321.
1694 * However, this is not assumed.
1698 #define HTOLE(name,type) \
1700 name (register type n) \
1704 char c[sizeof(type)]; \
1707 register I32 s = 0; \
1708 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1709 u.c[i] = (n >> s) & 0xFF; \
1714 #define LETOH(name,type) \
1716 name (register type n) \
1720 char c[sizeof(type)]; \
1723 register I32 s = 0; \
1726 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1727 n |= ((type)(u.c[i] & 0xFF)) << s; \
1733 * Big-endian byte order functions.
1736 #define HTOBE(name,type) \
1738 name (register type n) \
1742 char c[sizeof(type)]; \
1745 register I32 s = 8*(sizeof(u.c)-1); \
1746 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1747 u.c[i] = (n >> s) & 0xFF; \
1752 #define BETOH(name,type) \
1754 name (register type n) \
1758 char c[sizeof(type)]; \
1761 register I32 s = 8*(sizeof(u.c)-1); \
1764 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1765 n |= ((type)(u.c[i] & 0xFF)) << s; \
1771 * If we just can't do it...
1774 #define NOT_AVAIL(name,type) \
1776 name (register type n) \
1778 Perl_croak_nocontext(#name "() not available"); \
1779 return n; /* not reached */ \
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)
1796 #ifdef PERL_NEED_MY_HTOLE16
1798 HTOLE(Perl_my_htole16,U16)
1800 NOT_AVAIL(Perl_my_htole16,U16)
1803 #ifdef PERL_NEED_MY_LETOH16
1805 LETOH(Perl_my_letoh16,U16)
1807 NOT_AVAIL(Perl_my_letoh16,U16)
1810 #ifdef PERL_NEED_MY_HTOBE16
1812 HTOBE(Perl_my_htobe16,U16)
1814 NOT_AVAIL(Perl_my_htobe16,U16)
1817 #ifdef PERL_NEED_MY_BETOH16
1819 BETOH(Perl_my_betoh16,U16)
1821 NOT_AVAIL(Perl_my_betoh16,U16)
1825 #ifdef PERL_NEED_MY_HTOLE32
1827 HTOLE(Perl_my_htole32,U32)
1829 NOT_AVAIL(Perl_my_htole32,U32)
1832 #ifdef PERL_NEED_MY_LETOH32
1834 LETOH(Perl_my_letoh32,U32)
1836 NOT_AVAIL(Perl_my_letoh32,U32)
1839 #ifdef PERL_NEED_MY_HTOBE32
1841 HTOBE(Perl_my_htobe32,U32)
1843 NOT_AVAIL(Perl_my_htobe32,U32)
1846 #ifdef PERL_NEED_MY_BETOH32
1848 BETOH(Perl_my_betoh32,U32)
1850 NOT_AVAIL(Perl_my_betoh32,U32)
1854 #ifdef PERL_NEED_MY_HTOLE64
1856 HTOLE(Perl_my_htole64,U64)
1858 NOT_AVAIL(Perl_my_htole64,U64)
1861 #ifdef PERL_NEED_MY_LETOH64
1863 LETOH(Perl_my_letoh64,U64)
1865 NOT_AVAIL(Perl_my_letoh64,U64)
1868 #ifdef PERL_NEED_MY_HTOBE64
1870 HTOBE(Perl_my_htobe64,U64)
1872 NOT_AVAIL(Perl_my_htobe64,U64)
1875 #ifdef PERL_NEED_MY_BETOH64
1877 BETOH(Perl_my_betoh64,U64)
1879 NOT_AVAIL(Perl_my_betoh64,U64)
1883 #ifdef PERL_NEED_MY_HTOLES
1884 HTOLE(Perl_my_htoles,short)
1886 #ifdef PERL_NEED_MY_LETOHS
1887 LETOH(Perl_my_letohs,short)
1889 #ifdef PERL_NEED_MY_HTOBES
1890 HTOBE(Perl_my_htobes,short)
1892 #ifdef PERL_NEED_MY_BETOHS
1893 BETOH(Perl_my_betohs,short)
1896 #ifdef PERL_NEED_MY_HTOLEI
1897 HTOLE(Perl_my_htolei,int)
1899 #ifdef PERL_NEED_MY_LETOHI
1900 LETOH(Perl_my_letohi,int)
1902 #ifdef PERL_NEED_MY_HTOBEI
1903 HTOBE(Perl_my_htobei,int)
1905 #ifdef PERL_NEED_MY_BETOHI
1906 BETOH(Perl_my_betohi,int)
1909 #ifdef PERL_NEED_MY_HTOLEL
1910 HTOLE(Perl_my_htolel,long)
1912 #ifdef PERL_NEED_MY_LETOHL
1913 LETOH(Perl_my_letohl,long)
1915 #ifdef PERL_NEED_MY_HTOBEL
1916 HTOBE(Perl_my_htobel,long)
1918 #ifdef PERL_NEED_MY_BETOHL
1919 BETOH(Perl_my_betohl,long)
1923 Perl_my_swabn(void *ptr, int n)
1925 register char *s = (char *)ptr;
1926 register char *e = s + (n-1);
1929 for (n /= 2; n > 0; s++, e--, n--) {
1937 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1939 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1941 register I32 This, that;
1947 PERL_FLUSHALL_FOR_CHILD;
1948 This = (*mode == 'w');
1952 taint_proper("Insecure %s%s", "EXEC");
1954 if (PerlProc_pipe(p) < 0)
1956 /* Try for another pipe pair for error return */
1957 if (PerlProc_pipe(pp) >= 0)
1959 while ((pid = PerlProc_fork()) < 0) {
1960 if (errno != EAGAIN) {
1961 PerlLIO_close(p[This]);
1962 PerlLIO_close(p[that]);
1964 PerlLIO_close(pp[0]);
1965 PerlLIO_close(pp[1]);
1977 /* Close parent's end of error status pipe (if any) */
1979 PerlLIO_close(pp[0]);
1980 #if defined(HAS_FCNTL) && defined(F_SETFD)
1981 /* Close error pipe automatically if exec works */
1982 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1985 /* Now dup our end of _the_ pipe to right position */
1986 if (p[THIS] != (*mode == 'r')) {
1987 PerlLIO_dup2(p[THIS], *mode == 'r');
1988 PerlLIO_close(p[THIS]);
1989 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1990 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1993 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1994 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1995 /* No automatic close - do it by hand */
2002 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2008 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2014 do_execfree(); /* free any memory malloced by child on fork */
2016 PerlLIO_close(pp[1]);
2017 /* Keep the lower of the two fd numbers */
2018 if (p[that] < p[This]) {
2019 PerlLIO_dup2(p[This], p[that]);
2020 PerlLIO_close(p[This]);
2024 PerlLIO_close(p[that]); /* close child's end of pipe */
2027 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2029 SvUPGRADE(sv,SVt_IV);
2031 PL_forkprocess = pid;
2032 /* If we managed to get status pipe check for exec fail */
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);
2063 Perl_croak(aTHX_ "List form of piped open not implemented");
2064 return (PerlIO *) NULL;
2068 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2069 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2071 Perl_my_popen(pTHX_ char *cmd, char *mode)
2074 register I32 This, that;
2077 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2081 PERL_FLUSHALL_FOR_CHILD;
2084 return my_syspopen(aTHX_ cmd,mode);
2087 This = (*mode == 'w');
2089 if (doexec && PL_tainting) {
2091 taint_proper("Insecure %s%s", "EXEC");
2093 if (PerlProc_pipe(p) < 0)
2095 if (doexec && PerlProc_pipe(pp) >= 0)
2097 while ((pid = PerlProc_fork()) < 0) {
2098 if (errno != EAGAIN) {
2099 PerlLIO_close(p[This]);
2100 PerlLIO_close(p[that]);
2102 PerlLIO_close(pp[0]);
2103 PerlLIO_close(pp[1]);
2106 Perl_croak(aTHX_ "Can't fork");
2119 PerlLIO_close(pp[0]);
2120 #if defined(HAS_FCNTL) && defined(F_SETFD)
2121 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2124 if (p[THIS] != (*mode == 'r')) {
2125 PerlLIO_dup2(p[THIS], *mode == 'r');
2126 PerlLIO_close(p[THIS]);
2127 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2128 PerlLIO_close(p[THAT]);
2131 PerlLIO_close(p[THAT]);
2134 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2141 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2146 /* may or may not use the shell */
2147 do_exec3(cmd, pp[1], did_pipes);
2150 #endif /* defined OS2 */
2151 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2152 SvREADONLY_off(GvSV(tmpgv));
2153 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2154 SvREADONLY_on(GvSV(tmpgv));
2156 #ifdef THREADS_HAVE_PIDS
2157 PL_ppid = (IV)getppid();
2160 hv_clear(PL_pidstatus); /* we have no children */
2165 do_execfree(); /* free any memory malloced by child on vfork */
2167 PerlLIO_close(pp[1]);
2168 if (p[that] < p[This]) {
2169 PerlLIO_dup2(p[This], p[that]);
2170 PerlLIO_close(p[This]);
2174 PerlLIO_close(p[that]);
2177 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2179 SvUPGRADE(sv,SVt_IV);
2181 PL_forkprocess = pid;
2182 if (did_pipes && pid > 0) {
2186 while (n < sizeof(int)) {
2187 n1 = PerlLIO_read(pp[0],
2188 (void*)(((char*)&errkid)+n),
2194 PerlLIO_close(pp[0]);
2196 if (n) { /* Error */
2198 PerlLIO_close(p[This]);
2199 if (n != sizeof(int))
2200 Perl_croak(aTHX_ "panic: kid popen errno read");
2202 pid2 = wait4pid(pid, &status, 0);
2203 } while (pid2 == -1 && errno == EINTR);
2204 errno = errkid; /* Propagate errno from kid */
2209 PerlLIO_close(pp[0]);
2210 return PerlIO_fdopen(p[This], mode);
2213 #if defined(atarist) || defined(EPOC)
2216 Perl_my_popen(pTHX_ char *cmd, char *mode)
2218 PERL_FLUSHALL_FOR_CHILD;
2219 /* Call system's popen() to get a FILE *, then import it.
2220 used 0 for 2nd parameter to PerlIO_importFILE;
2223 return PerlIO_importFILE(popen(cmd, mode), 0);
2227 FILE *djgpp_popen();
2229 Perl_my_popen(pTHX_ char *cmd, char *mode)
2231 PERL_FLUSHALL_FOR_CHILD;
2232 /* Call system's popen() to get a FILE *, then import it.
2233 used 0 for 2nd parameter to PerlIO_importFILE;
2236 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2241 #endif /* !DOSISH */
2243 /* this is called in parent before the fork() */
2245 Perl_atfork_lock(void)
2248 #if defined(USE_ITHREADS)
2249 /* locks must be held in locking order (if any) */
2251 MUTEX_LOCK(&PL_malloc_mutex);
2257 /* this is called in both parent and child after the fork() */
2259 Perl_atfork_unlock(void)
2262 #if defined(USE_ITHREADS)
2263 /* locks must be released in same order as in atfork_lock() */
2265 MUTEX_UNLOCK(&PL_malloc_mutex);
2274 #if defined(HAS_FORK)
2276 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2281 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2282 * handlers elsewhere in the code */
2287 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2288 Perl_croak_nocontext("fork() not available");
2290 #endif /* HAS_FORK */
2295 Perl_dump_fds(pTHX_ char *s)
2300 PerlIO_printf(Perl_debug_log,"%s", s);
2301 for (fd = 0; fd < 32; fd++) {
2302 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2303 PerlIO_printf(Perl_debug_log," %d",fd);
2305 PerlIO_printf(Perl_debug_log,"\n");
2308 #endif /* DUMP_FDS */
2312 dup2(int oldfd, int newfd)
2314 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2317 PerlLIO_close(newfd);
2318 return fcntl(oldfd, F_DUPFD, newfd);
2320 #define DUP2_MAX_FDS 256
2321 int fdtmp[DUP2_MAX_FDS];
2327 PerlLIO_close(newfd);
2328 /* good enough for low fd's... */
2329 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2330 if (fdx >= DUP2_MAX_FDS) {
2338 PerlLIO_close(fdtmp[--fdx]);
2345 #ifdef HAS_SIGACTION
2347 #ifdef MACOS_TRADITIONAL
2348 /* We don't want restart behavior on MacOS */
2353 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2356 struct sigaction act, oact;
2359 /* only "parent" interpreter can diddle signals */
2360 if (PL_curinterp != aTHX)
2364 act.sa_handler = handler;
2365 sigemptyset(&act.sa_mask);
2368 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2369 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2371 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2372 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2373 act.sa_flags |= SA_NOCLDWAIT;
2375 if (sigaction(signo, &act, &oact) == -1)
2378 return oact.sa_handler;
2382 Perl_rsignal_state(pTHX_ int signo)
2384 struct sigaction oact;
2386 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2389 return oact.sa_handler;
2393 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2396 struct sigaction act;
2399 /* only "parent" interpreter can diddle signals */
2400 if (PL_curinterp != aTHX)
2404 act.sa_handler = handler;
2405 sigemptyset(&act.sa_mask);
2408 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2409 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2411 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2412 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2413 act.sa_flags |= SA_NOCLDWAIT;
2415 return sigaction(signo, &act, save);
2419 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2423 /* only "parent" interpreter can diddle signals */
2424 if (PL_curinterp != aTHX)
2428 return sigaction(signo, save, (struct sigaction *)NULL);
2431 #else /* !HAS_SIGACTION */
2434 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2436 #if defined(USE_ITHREADS) && !defined(WIN32)
2437 /* only "parent" interpreter can diddle signals */
2438 if (PL_curinterp != aTHX)
2442 return PerlProc_signal(signo, handler);
2454 Perl_rsignal_state(pTHX_ int signo)
2457 Sighandler_t oldsig;
2459 #if defined(USE_ITHREADS) && !defined(WIN32)
2460 /* only "parent" interpreter can diddle signals */
2461 if (PL_curinterp != aTHX)
2466 oldsig = PerlProc_signal(signo, sig_trap);
2467 PerlProc_signal(signo, oldsig);
2469 PerlProc_kill(PerlProc_getpid(), signo);
2474 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2476 #if defined(USE_ITHREADS) && !defined(WIN32)
2477 /* only "parent" interpreter can diddle signals */
2478 if (PL_curinterp != aTHX)
2481 *save = PerlProc_signal(signo, handler);
2482 return (*save == SIG_ERR) ? -1 : 0;
2486 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2488 #if defined(USE_ITHREADS) && !defined(WIN32)
2489 /* only "parent" interpreter can diddle signals */
2490 if (PL_curinterp != aTHX)
2493 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2496 #endif /* !HAS_SIGACTION */
2497 #endif /* !PERL_MICRO */
2499 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2500 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2502 Perl_my_pclose(pTHX_ PerlIO *ptr)
2504 Sigsave_t hstat, istat, qstat;
2510 int saved_errno = 0;
2512 int saved_win32_errno;
2516 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2518 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2520 *svp = &PL_sv_undef;
2522 if (pid == -1) { /* Opened by popen. */
2523 return my_syspclose(ptr);
2526 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2527 saved_errno = errno;
2529 saved_win32_errno = GetLastError();
2533 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2536 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2537 rsignal_save(SIGINT, SIG_IGN, &istat);
2538 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2541 pid2 = wait4pid(pid, &status, 0);
2542 } while (pid2 == -1 && errno == EINTR);
2544 rsignal_restore(SIGHUP, &hstat);
2545 rsignal_restore(SIGINT, &istat);
2546 rsignal_restore(SIGQUIT, &qstat);
2549 SETERRNO(saved_errno, 0);
2552 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2554 #endif /* !DOSISH */
2556 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2558 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2563 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2565 char spid[TYPE_CHARS(IV)];
2569 sprintf(spid, "%"IVdf, (IV)pid);
2570 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2571 if (svp && *svp != &PL_sv_undef) {
2572 *statusp = SvIVX(*svp);
2573 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2580 hv_iterinit(PL_pidstatus);
2581 if ((entry = hv_iternext(PL_pidstatus))) {
2582 SV *sv = hv_iterval(PL_pidstatus,entry);
2584 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2585 *statusp = SvIVX(sv);
2586 sprintf(spid, "%"IVdf, (IV)pid);
2587 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2594 # ifdef HAS_WAITPID_RUNTIME
2595 if (!HAS_WAITPID_RUNTIME)
2598 result = PerlProc_waitpid(pid,statusp,flags);
2601 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2602 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2605 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2606 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2611 Perl_croak(aTHX_ "Can't do waitpid with flags");
2613 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2614 pidgone(result,*statusp);
2620 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2623 if (result < 0 && errno == EINTR) {
2628 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2631 Perl_pidgone(pTHX_ Pid_t pid, int status)
2634 char spid[TYPE_CHARS(IV)];
2636 sprintf(spid, "%"IVdf, (IV)pid);
2637 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2638 SvUPGRADE(sv,SVt_IV);
2639 SvIV_set(sv, status);
2643 #if defined(atarist) || defined(OS2) || defined(EPOC)
2646 int /* Cannot prototype with I32
2648 my_syspclose(PerlIO *ptr)
2651 Perl_my_pclose(pTHX_ PerlIO *ptr)
2654 /* Needs work for PerlIO ! */
2655 FILE *f = PerlIO_findFILE(ptr);
2656 I32 result = pclose(f);
2657 PerlIO_releaseFILE(ptr,f);
2665 Perl_my_pclose(pTHX_ PerlIO *ptr)
2667 /* Needs work for PerlIO ! */
2668 FILE *f = PerlIO_findFILE(ptr);
2669 I32 result = djgpp_pclose(f);
2670 result = (result << 8) & 0xff00;
2671 PerlIO_releaseFILE(ptr,f);
2677 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2680 register const char *frombase = from;
2683 register const char c = *from;
2688 while (count-- > 0) {
2689 for (todo = len; todo > 0; todo--) {
2698 Perl_same_dirent(pTHX_ const char *a, const char *b)
2700 char *fa = strrchr(a,'/');
2701 char *fb = strrchr(b,'/');
2704 SV *tmpsv = sv_newmortal();
2717 sv_setpvn(tmpsv, ".", 1);
2719 sv_setpvn(tmpsv, a, fa - a);
2720 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2723 sv_setpvn(tmpsv, ".", 1);
2725 sv_setpvn(tmpsv, b, fb - b);
2726 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2728 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2729 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2731 #endif /* !HAS_RENAME */
2734 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2736 const char *xfound = Nullch;
2737 char *xfailed = Nullch;
2738 char tmpbuf[MAXPATHLEN];
2742 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2743 # define SEARCH_EXTS ".bat", ".cmd", NULL
2744 # define MAX_EXT_LEN 4
2747 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2748 # define MAX_EXT_LEN 4
2751 # define SEARCH_EXTS ".pl", ".com", NULL
2752 # define MAX_EXT_LEN 4
2754 /* additional extensions to try in each dir if scriptname not found */
2756 const char *exts[] = { SEARCH_EXTS };
2757 const char **ext = search_ext ? search_ext : exts;
2758 int extidx = 0, i = 0;
2759 const char *curext = Nullch;
2762 # define MAX_EXT_LEN 0
2766 * If dosearch is true and if scriptname does not contain path
2767 * delimiters, search the PATH for scriptname.
2769 * If SEARCH_EXTS is also defined, will look for each
2770 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2771 * while searching the PATH.
2773 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2774 * proceeds as follows:
2775 * If DOSISH or VMSISH:
2776 * + look for ./scriptname{,.foo,.bar}
2777 * + search the PATH for scriptname{,.foo,.bar}
2780 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2781 * this will not look in '.' if it's not in the PATH)
2786 # ifdef ALWAYS_DEFTYPES
2787 len = strlen(scriptname);
2788 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2789 int hasdir, idx = 0, deftypes = 1;
2792 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2795 int hasdir, idx = 0, deftypes = 1;
2798 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2800 /* The first time through, just add SEARCH_EXTS to whatever we
2801 * already have, so we can check for default file types. */
2803 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2809 if ((strlen(tmpbuf) + strlen(scriptname)
2810 + MAX_EXT_LEN) >= sizeof tmpbuf)
2811 continue; /* don't search dir with too-long name */
2812 strcat(tmpbuf, scriptname);
2816 if (strEQ(scriptname, "-"))
2818 if (dosearch) { /* Look in '.' first. */
2819 const char *cur = scriptname;
2821 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2823 if (strEQ(ext[i++],curext)) {
2824 extidx = -1; /* already has an ext */
2829 DEBUG_p(PerlIO_printf(Perl_debug_log,
2830 "Looking for %s\n",cur));
2831 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2832 && !S_ISDIR(PL_statbuf.st_mode)) {
2840 if (cur == scriptname) {
2841 len = strlen(scriptname);
2842 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2844 cur = strcpy(tmpbuf, scriptname);
2846 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2847 && strcpy(tmpbuf+len, ext[extidx++]));
2852 #ifdef MACOS_TRADITIONAL
2853 if (dosearch && !strchr(scriptname, ':') &&
2854 (s = PerlEnv_getenv("Commands")))
2856 if (dosearch && !strchr(scriptname, '/')
2858 && !strchr(scriptname, '\\')
2860 && (s = PerlEnv_getenv("PATH")))
2865 PL_bufend = s + strlen(s);
2866 while (s < PL_bufend) {
2867 #ifdef MACOS_TRADITIONAL
2868 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2872 #if defined(atarist) || defined(DOSISH)
2877 && *s != ';'; len++, s++) {
2878 if (len < sizeof tmpbuf)
2881 if (len < sizeof tmpbuf)
2883 #else /* ! (atarist || DOSISH) */
2884 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2887 #endif /* ! (atarist || DOSISH) */
2888 #endif /* MACOS_TRADITIONAL */
2891 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2892 continue; /* don't search dir with too-long name */
2893 #ifdef MACOS_TRADITIONAL
2894 if (len && tmpbuf[len - 1] != ':')
2895 tmpbuf[len++] = ':';
2898 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2899 && tmpbuf[len - 1] != '/'
2900 && tmpbuf[len - 1] != '\\'
2903 tmpbuf[len++] = '/';
2904 if (len == 2 && tmpbuf[0] == '.')
2907 (void)strcpy(tmpbuf + len, scriptname);
2911 len = strlen(tmpbuf);
2912 if (extidx > 0) /* reset after previous loop */
2916 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2917 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2918 if (S_ISDIR(PL_statbuf.st_mode)) {
2922 } while ( retval < 0 /* not there */
2923 && extidx>=0 && ext[extidx] /* try an extension? */
2924 && strcpy(tmpbuf+len, ext[extidx++])
2929 if (S_ISREG(PL_statbuf.st_mode)
2930 && cando(S_IRUSR,TRUE,&PL_statbuf)
2931 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2932 && cando(S_IXUSR,TRUE,&PL_statbuf)
2936 xfound = tmpbuf; /* bingo! */
2940 xfailed = savepv(tmpbuf);
2943 if (!xfound && !seen_dot && !xfailed &&
2944 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2945 || S_ISDIR(PL_statbuf.st_mode)))
2947 seen_dot = 1; /* Disable message. */
2949 if (flags & 1) { /* do or die? */
2950 Perl_croak(aTHX_ "Can't %s %s%s%s",
2951 (xfailed ? "execute" : "find"),
2952 (xfailed ? xfailed : scriptname),
2953 (xfailed ? "" : " on PATH"),
2954 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2956 scriptname = Nullch;
2960 scriptname = xfound;
2962 return (scriptname ? savepv(scriptname) : Nullch);
2965 #ifndef PERL_GET_CONTEXT_DEFINED
2968 Perl_get_context(void)
2971 #if defined(USE_ITHREADS)
2972 # ifdef OLD_PTHREADS_API
2974 if (pthread_getspecific(PL_thr_key, &t))
2975 Perl_croak_nocontext("panic: pthread_getspecific");
2978 # ifdef I_MACH_CTHREADS
2979 return (void*)cthread_data(cthread_self());
2981 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2990 Perl_set_context(void *t)
2993 #if defined(USE_ITHREADS)
2994 # ifdef I_MACH_CTHREADS
2995 cthread_set_data(cthread_self(), t);
2997 if (pthread_setspecific(PL_thr_key, t))
2998 Perl_croak_nocontext("panic: pthread_setspecific");
3005 #endif /* !PERL_GET_CONTEXT_DEFINED */
3007 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3016 Perl_get_op_names(pTHX)
3018 return (char **)PL_op_name;
3022 Perl_get_op_descs(pTHX)
3024 return (char **)PL_op_desc;
3028 Perl_get_no_modify(pTHX)
3030 return PL_no_modify;
3034 Perl_get_opargs(pTHX)
3036 return (U32 *)PL_opargs;
3040 Perl_get_ppaddr(pTHX)
3043 return (PPADDR_t*)PL_ppaddr;
3046 #ifndef HAS_GETENV_LEN
3048 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3050 char *env_trans = PerlEnv_getenv(env_elem);
3052 *len = strlen(env_trans);
3059 Perl_get_vtbl(pTHX_ int vtbl_id)
3061 const MGVTBL* result = Null(MGVTBL*);
3065 result = &PL_vtbl_sv;
3068 result = &PL_vtbl_env;
3070 case want_vtbl_envelem:
3071 result = &PL_vtbl_envelem;
3074 result = &PL_vtbl_sig;
3076 case want_vtbl_sigelem:
3077 result = &PL_vtbl_sigelem;
3079 case want_vtbl_pack:
3080 result = &PL_vtbl_pack;
3082 case want_vtbl_packelem:
3083 result = &PL_vtbl_packelem;
3085 case want_vtbl_dbline:
3086 result = &PL_vtbl_dbline;
3089 result = &PL_vtbl_isa;
3091 case want_vtbl_isaelem:
3092 result = &PL_vtbl_isaelem;
3094 case want_vtbl_arylen:
3095 result = &PL_vtbl_arylen;
3097 case want_vtbl_glob:
3098 result = &PL_vtbl_glob;
3100 case want_vtbl_mglob:
3101 result = &PL_vtbl_mglob;
3103 case want_vtbl_nkeys:
3104 result = &PL_vtbl_nkeys;
3106 case want_vtbl_taint:
3107 result = &PL_vtbl_taint;
3109 case want_vtbl_substr:
3110 result = &PL_vtbl_substr;
3113 result = &PL_vtbl_vec;
3116 result = &PL_vtbl_pos;
3119 result = &PL_vtbl_bm;
3122 result = &PL_vtbl_fm;
3124 case want_vtbl_uvar:
3125 result = &PL_vtbl_uvar;
3127 case want_vtbl_defelem:
3128 result = &PL_vtbl_defelem;
3130 case want_vtbl_regexp:
3131 result = &PL_vtbl_regexp;
3133 case want_vtbl_regdata:
3134 result = &PL_vtbl_regdata;
3136 case want_vtbl_regdatum:
3137 result = &PL_vtbl_regdatum;
3139 #ifdef USE_LOCALE_COLLATE
3140 case want_vtbl_collxfrm:
3141 result = &PL_vtbl_collxfrm;
3144 case want_vtbl_amagic:
3145 result = &PL_vtbl_amagic;
3147 case want_vtbl_amagicelem:
3148 result = &PL_vtbl_amagicelem;
3150 case want_vtbl_backref:
3151 result = &PL_vtbl_backref;
3153 case want_vtbl_utf8:
3154 result = &PL_vtbl_utf8;
3157 return (MGVTBL*)result;
3161 Perl_my_fflush_all(pTHX)
3163 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3164 return PerlIO_flush(NULL);
3166 # if defined(HAS__FWALK)
3167 extern int fflush(FILE *);
3168 /* undocumented, unprototyped, but very useful BSDism */
3169 extern void _fwalk(int (*)(FILE *));
3173 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3175 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3176 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3178 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3179 open_max = sysconf(_SC_OPEN_MAX);
3182 open_max = FOPEN_MAX;
3185 open_max = OPEN_MAX;
3196 for (i = 0; i < open_max; i++)
3197 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3198 STDIO_STREAM_ARRAY[i]._file < open_max &&
3199 STDIO_STREAM_ARRAY[i]._flag)
3200 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3204 SETERRNO(EBADF,RMS_IFI);
3211 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3214 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3215 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3217 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3218 const char *type = OP_IS_SOCKET(op)
3219 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3220 ? "socket" : "filehandle";
3221 const char *name = NULL;
3223 if (gv && isGV(gv)) {
3227 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3228 if (ckWARN(WARN_IO)) {
3229 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3231 Perl_warner(aTHX_ packWARN(WARN_IO),
3232 "Filehandle %s opened only for %sput",
3235 Perl_warner(aTHX_ packWARN(WARN_IO),
3236 "Filehandle opened only for %sput", direction);
3243 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3245 warn_type = WARN_CLOSED;
3249 warn_type = WARN_UNOPENED;
3252 if (ckWARN(warn_type)) {
3253 if (name && *name) {
3254 Perl_warner(aTHX_ packWARN(warn_type),
3255 "%s%s on %s %s %s", func, pars, vile, type, name);
3256 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3258 aTHX_ packWARN(warn_type),
3259 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3264 Perl_warner(aTHX_ packWARN(warn_type),
3265 "%s%s on %s %s", func, pars, vile, type);
3266 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3268 aTHX_ packWARN(warn_type),
3269 "\t(Are you trying to call %s%s on dirhandle?)\n",
3278 /* in ASCII order, not that it matters */
3279 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3282 Perl_ebcdic_control(pTHX_ int ch)
3290 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3291 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3294 if (ctlp == controllablechars)
3295 return('\177'); /* DEL */
3297 return((unsigned char)(ctlp - controllablechars - 1));
3298 } else { /* Want uncontrol */
3299 if (ch == '\177' || ch == -1)
3301 else if (ch == '\157')
3303 else if (ch == '\174')
3305 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3307 else if (ch == '\155')
3309 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3310 return(controllablechars[ch+1]);
3312 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3317 /* To workaround core dumps from the uninitialised tm_zone we get the
3318 * system to give us a reasonable struct to copy. This fix means that
3319 * strftime uses the tm_zone and tm_gmtoff values returned by
3320 * localtime(time()). That should give the desired result most of the
3321 * time. But probably not always!
3323 * This does not address tzname aspects of NETaa14816.
3328 # ifndef STRUCT_TM_HASZONE
3329 # define STRUCT_TM_HASZONE
3333 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3334 # ifndef HAS_TM_TM_ZONE
3335 # define HAS_TM_TM_ZONE
3340 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3342 #ifdef HAS_TM_TM_ZONE
3346 my_tm = localtime(&now);
3348 Copy(my_tm, ptm, 1, struct tm);
3353 * mini_mktime - normalise struct tm values without the localtime()
3354 * semantics (and overhead) of mktime().
3357 Perl_mini_mktime(pTHX_ struct tm *ptm)
3361 int month, mday, year, jday;
3362 int odd_cent, odd_year;
3364 #define DAYS_PER_YEAR 365
3365 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3366 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3367 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3368 #define SECS_PER_HOUR (60*60)
3369 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3370 /* parentheses deliberately absent on these two, otherwise they don't work */
3371 #define MONTH_TO_DAYS 153/5
3372 #define DAYS_TO_MONTH 5/153
3373 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3374 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3375 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3376 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3379 * Year/day algorithm notes:
3381 * With a suitable offset for numeric value of the month, one can find
3382 * an offset into the year by considering months to have 30.6 (153/5) days,
3383 * using integer arithmetic (i.e., with truncation). To avoid too much
3384 * messing about with leap days, we consider January and February to be
3385 * the 13th and 14th month of the previous year. After that transformation,
3386 * we need the month index we use to be high by 1 from 'normal human' usage,
3387 * so the month index values we use run from 4 through 15.
3389 * Given that, and the rules for the Gregorian calendar (leap years are those
3390 * divisible by 4 unless also divisible by 100, when they must be divisible
3391 * by 400 instead), we can simply calculate the number of days since some
3392 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3393 * the days we derive from our month index, and adding in the day of the
3394 * month. The value used here is not adjusted for the actual origin which
3395 * it normally would use (1 January A.D. 1), since we're not exposing it.
3396 * We're only building the value so we can turn around and get the
3397 * normalised values for the year, month, day-of-month, and day-of-year.
3399 * For going backward, we need to bias the value we're using so that we find
3400 * the right year value. (Basically, we don't want the contribution of
3401 * March 1st to the number to apply while deriving the year). Having done
3402 * that, we 'count up' the contribution to the year number by accounting for
3403 * full quadracenturies (400-year periods) with their extra leap days, plus
3404 * the contribution from full centuries (to avoid counting in the lost leap
3405 * days), plus the contribution from full quad-years (to count in the normal
3406 * leap days), plus the leftover contribution from any non-leap years.
3407 * At this point, if we were working with an actual leap day, we'll have 0
3408 * days left over. This is also true for March 1st, however. So, we have
3409 * to special-case that result, and (earlier) keep track of the 'odd'
3410 * century and year contributions. If we got 4 extra centuries in a qcent,
3411 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3412 * Otherwise, we add back in the earlier bias we removed (the 123 from
3413 * figuring in March 1st), find the month index (integer division by 30.6),
3414 * and the remainder is the day-of-month. We then have to convert back to
3415 * 'real' months (including fixing January and February from being 14/15 in
3416 * the previous year to being in the proper year). After that, to get
3417 * tm_yday, we work with the normalised year and get a new yearday value for
3418 * January 1st, which we subtract from the yearday value we had earlier,
3419 * representing the date we've re-built. This is done from January 1
3420 * because tm_yday is 0-origin.
3422 * Since POSIX time routines are only guaranteed to work for times since the
3423 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3424 * applies Gregorian calendar rules even to dates before the 16th century
3425 * doesn't bother me. Besides, you'd need cultural context for a given
3426 * date to know whether it was Julian or Gregorian calendar, and that's
3427 * outside the scope for this routine. Since we convert back based on the
3428 * same rules we used to build the yearday, you'll only get strange results
3429 * for input which needed normalising, or for the 'odd' century years which
3430 * were leap years in the Julian calander but not in the Gregorian one.
3431 * I can live with that.
3433 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3434 * that's still outside the scope for POSIX time manipulation, so I don't
3438 year = 1900 + ptm->tm_year;
3439 month = ptm->tm_mon;
3440 mday = ptm->tm_mday;
3441 /* allow given yday with no month & mday to dominate the result */
3442 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3445 jday = 1 + ptm->tm_yday;
3454 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3455 yearday += month*MONTH_TO_DAYS + mday + jday;
3457 * Note that we don't know when leap-seconds were or will be,
3458 * so we have to trust the user if we get something which looks
3459 * like a sensible leap-second. Wild values for seconds will
3460 * be rationalised, however.
3462 if ((unsigned) ptm->tm_sec <= 60) {
3469 secs += 60 * ptm->tm_min;
3470 secs += SECS_PER_HOUR * ptm->tm_hour;
3472 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3473 /* got negative remainder, but need positive time */
3474 /* back off an extra day to compensate */
3475 yearday += (secs/SECS_PER_DAY)-1;
3476 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3479 yearday += (secs/SECS_PER_DAY);
3480 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3483 else if (secs >= SECS_PER_DAY) {
3484 yearday += (secs/SECS_PER_DAY);
3485 secs %= SECS_PER_DAY;
3487 ptm->tm_hour = secs/SECS_PER_HOUR;
3488 secs %= SECS_PER_HOUR;
3489 ptm->tm_min = secs/60;
3491 ptm->tm_sec += secs;
3492 /* done with time of day effects */
3494 * The algorithm for yearday has (so far) left it high by 428.
3495 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3496 * bias it by 123 while trying to figure out what year it
3497 * really represents. Even with this tweak, the reverse
3498 * translation fails for years before A.D. 0001.
3499 * It would still fail for Feb 29, but we catch that one below.
3501 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3502 yearday -= YEAR_ADJUST;
3503 year = (yearday / DAYS_PER_QCENT) * 400;
3504 yearday %= DAYS_PER_QCENT;
3505 odd_cent = yearday / DAYS_PER_CENT;
3506 year += odd_cent * 100;
3507 yearday %= DAYS_PER_CENT;
3508 year += (yearday / DAYS_PER_QYEAR) * 4;
3509 yearday %= DAYS_PER_QYEAR;
3510 odd_year = yearday / DAYS_PER_YEAR;
3512 yearday %= DAYS_PER_YEAR;
3513 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3518 yearday += YEAR_ADJUST; /* recover March 1st crock */
3519 month = yearday*DAYS_TO_MONTH;
3520 yearday -= month*MONTH_TO_DAYS;
3521 /* recover other leap-year adjustment */
3530 ptm->tm_year = year - 1900;
3532 ptm->tm_mday = yearday;
3533 ptm->tm_mon = month;
3537 ptm->tm_mon = month - 1;
3539 /* re-build yearday based on Jan 1 to get tm_yday */
3541 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3542 yearday += 14*MONTH_TO_DAYS + 1;
3543 ptm->tm_yday = jday - yearday;
3544 /* fix tm_wday if not overridden by caller */
3545 if ((unsigned)ptm->tm_wday > 6)
3546 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3550 Perl_my_strftime(pTHX_ const char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3558 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3561 mytm.tm_hour = hour;
3562 mytm.tm_mday = mday;
3564 mytm.tm_year = year;
3565 mytm.tm_wday = wday;
3566 mytm.tm_yday = yday;
3567 mytm.tm_isdst = isdst;
3569 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3570 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3575 #ifdef HAS_TM_TM_GMTOFF
3576 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3578 #ifdef HAS_TM_TM_ZONE
3579 mytm.tm_zone = mytm2.tm_zone;
3584 New(0, buf, buflen, char);
3585 len = strftime(buf, buflen, fmt, &mytm);
3587 ** The following is needed to handle to the situation where
3588 ** tmpbuf overflows. Basically we want to allocate a buffer
3589 ** and try repeatedly. The reason why it is so complicated
3590 ** is that getting a return value of 0 from strftime can indicate
3591 ** one of the following:
3592 ** 1. buffer overflowed,
3593 ** 2. illegal conversion specifier, or
3594 ** 3. the format string specifies nothing to be returned(not
3595 ** an error). This could be because format is an empty string
3596 ** or it specifies %p that yields an empty string in some locale.
3597 ** If there is a better way to make it portable, go ahead by
3600 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3603 /* Possibly buf overflowed - try again with a bigger buf */
3604 const int fmtlen = strlen(fmt);
3605 const int bufsize = fmtlen + buflen;
3607 New(0, buf, bufsize, char);
3609 buflen = strftime(buf, bufsize, fmt, &mytm);
3610 if (buflen > 0 && buflen < bufsize)
3612 /* heuristic to prevent out-of-memory errors */
3613 if (bufsize > 100*fmtlen) {
3618 Renew(buf, bufsize*2, char);
3623 Perl_croak(aTHX_ "panic: no strftime");
3629 #define SV_CWD_RETURN_UNDEF \
3630 sv_setsv(sv, &PL_sv_undef); \
3633 #define SV_CWD_ISDOT(dp) \
3634 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3635 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3638 =head1 Miscellaneous Functions
3640 =for apidoc getcwd_sv
3642 Fill the sv with current working directory
3647 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3648 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3649 * getcwd(3) if available
3650 * Comments from the orignal:
3651 * This is a faster version of getcwd. It's also more dangerous
3652 * because you might chdir out of a directory that you can't chdir
3656 Perl_getcwd_sv(pTHX_ register SV *sv)
3660 #ifndef INCOMPLETE_TAINTS
3666 char buf[MAXPATHLEN];
3668 /* Some getcwd()s automatically allocate a buffer of the given
3669 * size from the heap if they are given a NULL buffer pointer.
3670 * The problem is that this behaviour is not portable. */
3671 if (getcwd(buf, sizeof(buf) - 1)) {
3672 sv_setpvn(sv, buf, strlen(buf));
3676 sv_setsv(sv, &PL_sv_undef);
3684 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3688 SvUPGRADE(sv, SVt_PV);
3690 if (PerlLIO_lstat(".", &statbuf) < 0) {
3691 SV_CWD_RETURN_UNDEF;
3694 orig_cdev = statbuf.st_dev;
3695 orig_cino = statbuf.st_ino;
3704 if (PerlDir_chdir("..") < 0) {
3705 SV_CWD_RETURN_UNDEF;
3707 if (PerlLIO_stat(".", &statbuf) < 0) {
3708 SV_CWD_RETURN_UNDEF;
3711 cdev = statbuf.st_dev;
3712 cino = statbuf.st_ino;
3714 if (odev == cdev && oino == cino) {
3717 if (!(dir = PerlDir_open("."))) {
3718 SV_CWD_RETURN_UNDEF;
3721 while ((dp = PerlDir_read(dir)) != NULL) {
3723 const int namelen = dp->d_namlen;
3725 const int namelen = strlen(dp->d_name);
3728 if (SV_CWD_ISDOT(dp)) {
3732 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3733 SV_CWD_RETURN_UNDEF;
3736 tdev = statbuf.st_dev;
3737 tino = statbuf.st_ino;
3738 if (tino == oino && tdev == odev) {
3744 SV_CWD_RETURN_UNDEF;
3747 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3748 SV_CWD_RETURN_UNDEF;
3751 SvGROW(sv, pathlen + namelen + 1);
3755 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3758 /* prepend current directory to the front */
3760 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3761 pathlen += (namelen + 1);
3763 #ifdef VOID_CLOSEDIR
3766 if (PerlDir_close(dir) < 0) {
3767 SV_CWD_RETURN_UNDEF;
3773 SvCUR_set(sv, pathlen);
3777 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3778 SV_CWD_RETURN_UNDEF;
3781 if (PerlLIO_stat(".", &statbuf) < 0) {
3782 SV_CWD_RETURN_UNDEF;
3785 cdev = statbuf.st_dev;
3786 cino = statbuf.st_ino;
3788 if (cdev != orig_cdev || cino != orig_cino) {
3789 Perl_croak(aTHX_ "Unstable directory path, "
3790 "current directory changed unexpectedly");
3802 =for apidoc scan_version
3804 Returns a pointer to the next character after the parsed
3805 version string, as well as upgrading the passed in SV to
3808 Function must be called with an already existing SV like
3811 s = scan_version(s,SV *sv, bool qv);
3813 Performs some preprocessing to the string to ensure that
3814 it has the correct characteristics of a version. Flags the
3815 object if it contains an underscore (which denotes this
3816 is a alpha version). The boolean qv denotes that the version
3817 should be interpreted as if it had multiple decimals, even if
3824 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3826 const char *start = s;
3833 SV* hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3834 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3835 #ifndef NODEFAULT_SHAREKEYS
3836 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3840 s++; /* get past 'v' */
3841 qv = 1; /* force quoted version processing */
3846 /* pre-scan the input string to check for decimals/underbars */
3847 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3852 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3856 else if ( *pos == '_' )
3859 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3861 width = pos - last - 1; /* natural width of sub-version */
3866 if ( saw_period > 1 ) {
3867 qv = 1; /* force quoted version processing */
3873 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
3875 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
3877 if ( !qv && width < 3 )
3878 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3880 while (isDIGIT(*pos))
3882 if (!isALPHA(*pos)) {
3888 /* this is atoi() that delimits on underscores */
3889 const char *end = pos;
3893 /* the following if() will only be true after the decimal
3894 * point of a version originally created with a bare
3895 * floating point number, i.e. not quoted in any way
3897 if ( !qv && s > start+1 && saw_period == 1 ) {
3901 rev += (*s - '0') * mult;
3903 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3904 Perl_croak(aTHX_ "Integer overflow in version");
3911 while (--end >= s) {
3913 rev += (*end - '0') * mult;
3915 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3916 Perl_croak(aTHX_ "Integer overflow in version");
3921 /* Append revision */
3922 av_push(av, newSViv(rev));
3923 if ( *pos == '.' && isDIGIT(pos[1]) )
3925 else if ( *pos == '_' && isDIGIT(pos[1]) )
3927 else if ( isDIGIT(*pos) )
3934 while ( isDIGIT(*pos) )
3939 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
3947 if ( qv ) { /* quoted versions always get at least three terms*/
3948 I32 len = av_len(av);
3949 /* This for loop appears to trigger a compiler bug on OS X, as it
3950 loops infinitely. Yes, len is negative. No, it makes no sense.
3951 Compiler in question is:
3952 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3953 for ( len = 2 - len; len > 0; len-- )
3954 av_push((AV *)sv, newSViv(0));
3958 av_push(av, newSViv(0));
3961 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
3962 av_push(av, newSViv(0));
3964 /* And finally, store the AV in the hash */
3965 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
3970 =for apidoc new_version
3972 Returns a new version object based on the passed in SV:
3974 SV *sv = new_version(SV *ver);
3976 Does not alter the passed in ver SV. See "upg_version" if you
3977 want to upgrade the SV.
3983 Perl_new_version(pTHX_ SV *ver)
3986 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3991 /* This will get reblessed later if a derived class*/
3992 SV* hv = newSVrv(rv, "version");
3993 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3994 #ifndef NODEFAULT_SHAREKEYS
3995 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4001 /* Begin copying all of the elements */
4002 if ( hv_exists((HV *)ver, "qv", 2) )
4003 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4005 if ( hv_exists((HV *)ver, "alpha", 5) )
4006 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4008 if ( hv_exists((HV*)ver, "width", 5 ) )
4010 I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4011 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4014 sav = (AV *)*hv_fetch((HV*)ver, "version", 7, FALSE);
4015 /* This will get reblessed later if a derived class*/
4016 for ( key = 0; key <= av_len(sav); key++ )
4018 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4019 av_push(av, newSViv(rev));
4022 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
4026 if ( SvVOK(ver) ) { /* already a v-string */
4028 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4029 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4030 sv_setpv(rv,version);
4035 sv_setsv(rv,ver); /* make a duplicate */
4044 =for apidoc upg_version
4046 In-place upgrade of the supplied SV to a version object.
4048 SV *sv = upg_version(SV *sv);
4050 Returns a pointer to the upgraded SV.
4056 Perl_upg_version(pTHX_ SV *ver)
4061 if ( SvNOK(ver) ) /* may get too much accuracy */
4064 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4065 version = savepv(tbuf);
4068 else if ( SvVOK(ver) ) { /* already a v-string */
4069 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4070 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4074 else /* must be a string or something like a string */
4076 version = savepv(SvPV_nolen(ver));
4078 (void)scan_version(version, ver, qv);
4087 Accepts a version object and returns the normalized floating
4088 point representation. Call like:
4092 NOTE: you can pass either the object directly or the SV
4093 contained within the RV.
4099 Perl_vnumify(pTHX_ SV *vs)
4109 /* see if various flags exist */
4110 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4112 if ( hv_exists((HV*)vs, "width", 5 ) )
4113 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4118 /* attempt to retrieve the version array */
4119 if ( !(av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE) ) ) {
4120 Perl_sv_catpv(aTHX_ sv,"0");
4127 sv_catpvn(sv,"0",1);
4131 digit = SvIV(*av_fetch(av, 0, 0));
4132 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4133 for ( i = 1 ; i < len ; i++ )
4135 digit = SvIV(*av_fetch(av, i, 0));
4137 int denom = (int)pow(10,(3-width));
4138 div_t term = div((int)PERL_ABS(digit),denom);
4139 Perl_sv_catpvf(aTHX_ sv,"%0*d_%d", width, term.quot, term.rem);
4142 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4148 digit = SvIV(*av_fetch(av, len, 0));
4149 if ( alpha && width == 3 ) /* alpha version */
4150 Perl_sv_catpv(aTHX_ sv,"_");
4151 /* Don't display additional trailing zeros */
4153 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4157 sv_catpvn(sv,"000",3);
4165 Accepts a version object and returns the normalized string
4166 representation. Call like:
4170 NOTE: you can pass either the object directly or the SV
4171 contained within the RV.
4177 Perl_vnormal(pTHX_ SV *vs)
4186 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4188 av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE);
4195 digit = SvIV(*av_fetch(av, 0, 0));
4196 Perl_sv_setpvf(aTHX_ sv,"v%"IVdf,(IV)digit);
4197 for ( i = 1 ; i <= len-1 ; i++ ) {
4198 digit = SvIV(*av_fetch(av, i, 0));
4199 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4203 /* handle last digit specially */
4204 digit = SvIV(*av_fetch(av, len, 0));
4206 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4208 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4211 if ( len <= 2 ) { /* short version, must be at least three */
4212 for ( len = 2 - len; len != 0; len-- )
4213 sv_catpvn(sv,".0",2);
4220 =for apidoc vstringify
4222 In order to maintain maximum compatibility with earlier versions
4223 of Perl, this function will return either the floating point
4224 notation or the multiple dotted notation, depending on whether
4225 the original version contained 1 or more dots, respectively
4231 Perl_vstringify(pTHX_ SV *vs)
4237 if ( hv_exists((HV *)vs, "qv", 2) )
4249 Version object aware cmp. Both operands must already have been
4250 converted into version objects.
4256 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4259 bool lalpha = FALSE;
4260 bool ralpha = FALSE;
4269 /* get the left hand term */
4270 lav = (AV *)*hv_fetch((HV*)lhv, "version", 7, FALSE);
4271 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4274 /* and the right hand term */
4275 rav = (AV *)*hv_fetch((HV*)rhv, "version", 7, FALSE);
4276 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4284 while ( i <= m && retval == 0 )
4286 left = SvIV(*av_fetch(lav,i,0));
4287 right = SvIV(*av_fetch(rav,i,0));
4295 /* tiebreaker for alpha with identical terms */
4296 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4298 if ( lalpha && !ralpha )
4302 else if ( ralpha && !lalpha)
4308 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4312 while ( i <= r && retval == 0 )
4314 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4315 retval = -1; /* not a match after all */
4321 while ( i <= l && retval == 0 )
4323 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4324 retval = +1; /* not a match after all */
4332 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4333 # define EMULATE_SOCKETPAIR_UDP
4336 #ifdef EMULATE_SOCKETPAIR_UDP
4338 S_socketpair_udp (int fd[2]) {
4340 /* Fake a datagram socketpair using UDP to localhost. */
4341 int sockets[2] = {-1, -1};
4342 struct sockaddr_in addresses[2];
4344 Sock_size_t size = sizeof(struct sockaddr_in);
4345 unsigned short port;
4348 memset(&addresses, 0, sizeof(addresses));
4351 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4352 if (sockets[i] == -1)
4353 goto tidy_up_and_fail;
4355 addresses[i].sin_family = AF_INET;
4356 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4357 addresses[i].sin_port = 0; /* kernel choses port. */
4358 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4359 sizeof(struct sockaddr_in)) == -1)
4360 goto tidy_up_and_fail;
4363 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4364 for each connect the other socket to it. */
4367 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4369 goto tidy_up_and_fail;
4370 if (size != sizeof(struct sockaddr_in))
4371 goto abort_tidy_up_and_fail;
4372 /* !1 is 0, !0 is 1 */
4373 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4374 sizeof(struct sockaddr_in)) == -1)
4375 goto tidy_up_and_fail;
4378 /* Now we have 2 sockets connected to each other. I don't trust some other
4379 process not to have already sent a packet to us (by random) so send
4380 a packet from each to the other. */
4383 /* I'm going to send my own port number. As a short.
4384 (Who knows if someone somewhere has sin_port as a bitfield and needs
4385 this routine. (I'm assuming crays have socketpair)) */
4386 port = addresses[i].sin_port;
4387 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4388 if (got != sizeof(port)) {
4390 goto tidy_up_and_fail;
4391 goto abort_tidy_up_and_fail;
4395 /* Packets sent. I don't trust them to have arrived though.
4396 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4397 connect to localhost will use a second kernel thread. In 2.6 the
4398 first thread running the connect() returns before the second completes,
4399 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4400 returns 0. Poor programs have tripped up. One poor program's authors'
4401 had a 50-1 reverse stock split. Not sure how connected these were.)
4402 So I don't trust someone not to have an unpredictable UDP stack.
4406 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4407 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4411 FD_SET(sockets[0], &rset);
4412 FD_SET(sockets[1], &rset);
4414 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4415 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4416 || !FD_ISSET(sockets[1], &rset)) {
4417 /* I hope this is portable and appropriate. */
4419 goto tidy_up_and_fail;
4420 goto abort_tidy_up_and_fail;
4424 /* And the paranoia department even now doesn't trust it to have arrive
4425 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4427 struct sockaddr_in readfrom;
4428 unsigned short buffer[2];
4433 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4434 sizeof(buffer), MSG_DONTWAIT,
4435 (struct sockaddr *) &readfrom, &size);
4437 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4439 (struct sockaddr *) &readfrom, &size);
4443 goto tidy_up_and_fail;
4444 if (got != sizeof(port)
4445 || size != sizeof(struct sockaddr_in)
4446 /* Check other socket sent us its port. */
4447 || buffer[0] != (unsigned short) addresses[!i].sin_port
4448 /* Check kernel says we got the datagram from that socket */
4449 || readfrom.sin_family != addresses[!i].sin_family
4450 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4451 || readfrom.sin_port != addresses[!i].sin_port)
4452 goto abort_tidy_up_and_fail;
4455 /* My caller (my_socketpair) has validated that this is non-NULL */
4458 /* I hereby declare this connection open. May God bless all who cross
4462 abort_tidy_up_and_fail:
4463 errno = ECONNABORTED;
4466 const int save_errno = errno;
4467 if (sockets[0] != -1)
4468 PerlLIO_close(sockets[0]);
4469 if (sockets[1] != -1)
4470 PerlLIO_close(sockets[1]);
4475 #endif /* EMULATE_SOCKETPAIR_UDP */
4477 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4479 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4480 /* Stevens says that family must be AF_LOCAL, protocol 0.
4481 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4486 struct sockaddr_in listen_addr;
4487 struct sockaddr_in connect_addr;
4492 || family != AF_UNIX
4495 errno = EAFNOSUPPORT;
4503 #ifdef EMULATE_SOCKETPAIR_UDP
4504 if (type == SOCK_DGRAM)
4505 return S_socketpair_udp(fd);
4508 listener = PerlSock_socket(AF_INET, type, 0);
4511 memset(&listen_addr, 0, sizeof(listen_addr));
4512 listen_addr.sin_family = AF_INET;
4513 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4514 listen_addr.sin_port = 0; /* kernel choses port. */
4515 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4516 sizeof(listen_addr)) == -1)
4517 goto tidy_up_and_fail;
4518 if (PerlSock_listen(listener, 1) == -1)
4519 goto tidy_up_and_fail;
4521 connector = PerlSock_socket(AF_INET, type, 0);
4522 if (connector == -1)
4523 goto tidy_up_and_fail;
4524 /* We want to find out the port number to connect to. */
4525 size = sizeof(connect_addr);
4526 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4528 goto tidy_up_and_fail;
4529 if (size != sizeof(connect_addr))
4530 goto abort_tidy_up_and_fail;
4531 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4532 sizeof(connect_addr)) == -1)
4533 goto tidy_up_and_fail;
4535 size = sizeof(listen_addr);
4536 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4539 goto tidy_up_and_fail;
4540 if (size != sizeof(listen_addr))
4541 goto abort_tidy_up_and_fail;
4542 PerlLIO_close(listener);
4543 /* Now check we are talking to ourself by matching port and host on the
4545 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4547 goto tidy_up_and_fail;
4548 if (size != sizeof(connect_addr)
4549 || listen_addr.sin_family != connect_addr.sin_family
4550 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4551 || listen_addr.sin_port != connect_addr.sin_port) {
4552 goto abort_tidy_up_and_fail;
4558 abort_tidy_up_and_fail:
4560 errno = ECONNABORTED; /* This would be the standard thing to do. */
4562 # ifdef ECONNREFUSED
4563 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4565 errno = ETIMEDOUT; /* Desperation time. */
4570 int save_errno = errno;
4572 PerlLIO_close(listener);
4573 if (connector != -1)
4574 PerlLIO_close(connector);
4576 PerlLIO_close(acceptor);
4582 /* In any case have a stub so that there's code corresponding
4583 * to the my_socketpair in global.sym. */
4585 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4586 #ifdef HAS_SOCKETPAIR
4587 return socketpair(family, type, protocol, fd);
4596 =for apidoc sv_nosharing
4598 Dummy routine which "shares" an SV when there is no sharing module present.
4599 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4600 some level of strict-ness.
4606 Perl_sv_nosharing(pTHX_ SV *sv)
4612 =for apidoc sv_nolocking
4614 Dummy routine which "locks" an SV when there is no locking module present.
4615 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4616 some level of strict-ness.
4622 Perl_sv_nolocking(pTHX_ SV *sv)
4629 =for apidoc sv_nounlocking
4631 Dummy routine which "unlocks" an SV when there is no locking module present.
4632 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4633 some level of strict-ness.
4639 Perl_sv_nounlocking(pTHX_ SV *sv)
4645 Perl_parse_unicode_opts(pTHX_ const char **popt)
4647 const char *p = *popt;
4652 opt = (U32) atoi(p);
4653 while (isDIGIT(*p)) p++;
4654 if (*p && *p != '\n' && *p != '\r')
4655 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4660 case PERL_UNICODE_STDIN:
4661 opt |= PERL_UNICODE_STDIN_FLAG; break;
4662 case PERL_UNICODE_STDOUT:
4663 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4664 case PERL_UNICODE_STDERR:
4665 opt |= PERL_UNICODE_STDERR_FLAG; break;
4666 case PERL_UNICODE_STD:
4667 opt |= PERL_UNICODE_STD_FLAG; break;
4668 case PERL_UNICODE_IN:
4669 opt |= PERL_UNICODE_IN_FLAG; break;
4670 case PERL_UNICODE_OUT:
4671 opt |= PERL_UNICODE_OUT_FLAG; break;
4672 case PERL_UNICODE_INOUT:
4673 opt |= PERL_UNICODE_INOUT_FLAG; break;
4674 case PERL_UNICODE_LOCALE:
4675 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4676 case PERL_UNICODE_ARGV:
4677 opt |= PERL_UNICODE_ARGV_FLAG; break;
4679 if (*p != '\n' && *p != '\r')
4681 "Unknown Unicode option letter '%c'", *p);
4687 opt = PERL_UNICODE_DEFAULT_FLAGS;
4689 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4690 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4691 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4702 * This is really just a quick hack which grabs various garbage
4703 * values. It really should be a real hash algorithm which
4704 * spreads the effect of every input bit onto every output bit,
4705 * if someone who knows about such things would bother to write it.
4706 * Might be a good idea to add that function to CORE as well.
4707 * No numbers below come from careful analysis or anything here,
4708 * except they are primes and SEED_C1 > 1E6 to get a full-width
4709 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4710 * probably be bigger too.
4713 # define SEED_C1 1000003
4714 #define SEED_C4 73819
4716 # define SEED_C1 25747
4717 #define SEED_C4 20639
4721 #define SEED_C5 26107
4723 #ifndef PERL_NO_DEV_RANDOM
4728 # include <starlet.h>
4729 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4730 * in 100-ns units, typically incremented ever 10 ms. */
4731 unsigned int when[2];
4733 # ifdef HAS_GETTIMEOFDAY
4734 struct timeval when;
4740 /* This test is an escape hatch, this symbol isn't set by Configure. */
4741 #ifndef PERL_NO_DEV_RANDOM
4742 #ifndef PERL_RANDOM_DEVICE
4743 /* /dev/random isn't used by default because reads from it will block
4744 * if there isn't enough entropy available. You can compile with
4745 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4746 * is enough real entropy to fill the seed. */
4747 # define PERL_RANDOM_DEVICE "/dev/urandom"
4749 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4751 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4760 _ckvmssts(sys$gettim(when));
4761 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4763 # ifdef HAS_GETTIMEOFDAY
4764 PerlProc_gettimeofday(&when,NULL);
4765 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4768 u = (U32)SEED_C1 * when;
4771 u += SEED_C3 * (U32)PerlProc_getpid();
4772 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4773 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4774 u += SEED_C5 * (U32)PTR2UV(&when);
4780 Perl_get_hash_seed(pTHX)
4782 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4786 while (isSPACE(*s)) s++;
4787 if (s && isDIGIT(*s))
4788 myseed = (UV)Atoul(s);
4790 #ifdef USE_HASH_SEED_EXPLICIT
4794 /* Compute a random seed */
4795 (void)seedDrand01((Rand_seed_t)seed());
4796 myseed = (UV)(Drand01() * (NV)UV_MAX);
4797 #if RANDBITS < (UVSIZE * 8)
4798 /* Since there are not enough randbits to to reach all
4799 * the bits of a UV, the low bits might need extra
4800 * help. Sum in another random number that will
4801 * fill in the low bits. */
4803 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4804 #endif /* RANDBITS < (UVSIZE * 8) */
4805 if (myseed == 0) { /* Superparanoia. */
4806 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4808 Perl_croak(aTHX_ "Your random numbers are not that random");
4811 PL_rehash_seed_set = TRUE;
4818 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4820 const char * const stashpv = CopSTASHPV(c);
4821 const char * const name = HvNAME_get(hv);
4823 if (stashpv == name)
4825 if (stashpv && name)
4826 if (strEQ(stashpv, name))
4833 #ifdef PERL_GLOBAL_STRUCT
4836 Perl_init_global_struct(pTHX)
4838 struct perl_vars *plvarsp = NULL;
4839 #ifdef PERL_GLOBAL_STRUCT
4840 # define PERL_GLOBAL_STRUCT_INIT
4841 # include "opcode.h" /* the ppaddr and check */
4842 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4843 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4844 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4845 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4846 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4850 plvarsp = PL_VarsPtr;
4851 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4857 # define PERLVAR(var,type) /**/
4858 # define PERLVARA(var,n,type) /**/
4859 # define PERLVARI(var,type,init) plvarsp->var = init;
4860 # define PERLVARIC(var,type,init) plvarsp->var = init;
4861 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4862 # include "perlvars.h"
4868 # ifdef PERL_GLOBAL_STRUCT
4869 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4870 if (!plvarsp->Gppaddr)
4872 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4873 if (!plvarsp->Gcheck)
4875 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4876 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4878 # ifdef PERL_SET_VARS
4879 PERL_SET_VARS(plvarsp);
4881 # undef PERL_GLOBAL_STRUCT_INIT
4886 #endif /* PERL_GLOBAL_STRUCT */
4888 #ifdef PERL_GLOBAL_STRUCT
4891 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4893 #ifdef PERL_GLOBAL_STRUCT
4894 # ifdef PERL_UNSET_VARS
4895 PERL_UNSET_VARS(plvarsp);
4897 free(plvarsp->Gppaddr);
4898 free(plvarsp->Gcheck);
4899 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4905 #endif /* PERL_GLOBAL_STRUCT */
4909 * c-indentation-style: bsd
4911 * indent-tabs-mode: t
4914 * ex: set ts=8 sts=4 sw=4 noet: