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 */
1054 const int e = errno;
1056 PerlIO * const 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)
1258 SV * const msv = vmess(pat, args);
1259 const I32 utf8 = SvUTF8(msv);
1260 const char * const message = SvPV_const(msv, msglen);
1263 /* sv_2cv might call Perl_warn() */
1264 SV * const oldwarnhook = PL_warnhook;
1270 SAVESPTR(PL_warnhook);
1271 PL_warnhook = Nullsv;
1272 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1274 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1280 msg = newSVpvn(message, msglen);
1281 SvFLAGS(msg) |= utf8;
1285 PUSHSTACKi(PERLSI_WARNHOOK);
1289 call_sv((SV*)cv, G_DISCARD);
1296 write_to_stderr(message, msglen);
1299 #if defined(PERL_IMPLICIT_CONTEXT)
1301 Perl_warn_nocontext(const char *pat, ...)
1305 va_start(args, pat);
1309 #endif /* PERL_IMPLICIT_CONTEXT */
1314 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1315 function the same way you call the C C<printf> function. See C<croak>.
1321 Perl_warn(pTHX_ const char *pat, ...)
1324 va_start(args, pat);
1329 #if defined(PERL_IMPLICIT_CONTEXT)
1331 Perl_warner_nocontext(U32 err, const char *pat, ...)
1335 va_start(args, pat);
1336 vwarner(err, pat, &args);
1339 #endif /* PERL_IMPLICIT_CONTEXT */
1342 Perl_warner(pTHX_ U32 err, const char* pat,...)
1345 va_start(args, pat);
1346 vwarner(err, pat, &args);
1351 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1355 SV * const msv = vmess(pat, args);
1357 const char *message = SvPV_const(msv, msglen);
1358 const I32 utf8 = SvUTF8(msv);
1362 S_vdie_common(aTHX_ message, msglen, utf8);
1365 PL_restartop = die_where(message, msglen);
1366 SvFLAGS(ERRSV) |= utf8;
1369 write_to_stderr(message, msglen);
1373 Perl_vwarn(aTHX_ pat, args);
1377 /* since we've already done strlen() for both nam and val
1378 * we can use that info to make things faster than
1379 * sprintf(s, "%s=%s", nam, val)
1381 #define my_setenv_format(s, nam, nlen, val, vlen) \
1382 Copy(nam, s, nlen, char); \
1384 Copy(val, s+(nlen+1), vlen, char); \
1385 *(s+(nlen+1+vlen)) = '\0'
1387 #ifdef USE_ENVIRON_ARRAY
1388 /* VMS' my_setenv() is in vms.c */
1389 #if !defined(WIN32) && !defined(NETWARE)
1391 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1395 /* only parent thread can modify process environment */
1396 if (PL_curinterp == aTHX)
1399 #ifndef PERL_USE_SAFE_PUTENV
1400 if (!PL_use_safe_putenv) {
1401 /* most putenv()s leak, so we manipulate environ directly */
1402 register I32 i=setenv_getix(nam); /* where does it go? */
1405 if (environ == PL_origenviron) { /* need we copy environment? */
1410 for (max = i; environ[max]; max++) ;
1411 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1412 for (j=0; j<max; j++) { /* copy environment */
1413 const int len = strlen(environ[j]);
1414 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1415 Copy(environ[j], tmpenv[j], len+1, char);
1417 tmpenv[max] = Nullch;
1418 environ = tmpenv; /* tell exec where it is now */
1421 safesysfree(environ[i]);
1422 while (environ[i]) {
1423 environ[i] = environ[i+1];
1428 if (!environ[i]) { /* does not exist yet */
1429 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1430 environ[i+1] = Nullch; /* make sure it's null terminated */
1433 safesysfree(environ[i]);
1437 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1438 /* all that work just for this */
1439 my_setenv_format(environ[i], nam, nlen, val, vlen);
1442 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1443 setenv(nam, val, 1);
1446 const int nlen = strlen(nam);
1452 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1453 /* all that work just for this */
1454 my_setenv_format(new_env, nam, nlen, val, vlen);
1455 (void)putenv(new_env);
1456 # endif /* __CYGWIN__ */
1457 #ifndef PERL_USE_SAFE_PUTENV
1463 #else /* WIN32 || NETWARE */
1466 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1469 register char *envstr;
1470 const int nlen = strlen(nam);
1477 New(904, envstr, nlen+vlen+2, char);
1478 my_setenv_format(envstr, nam, nlen, val, vlen);
1479 (void)PerlEnv_putenv(envstr);
1483 #endif /* WIN32 || NETWARE */
1487 Perl_setenv_getix(pTHX_ const char *nam)
1490 const register I32 len = strlen(nam);
1492 for (i = 0; environ[i]; i++) {
1495 strnicmp(environ[i],nam,len) == 0
1497 strnEQ(environ[i],nam,len)
1499 && environ[i][len] == '=')
1500 break; /* strnEQ must come first to avoid */
1501 } /* potential SEGV's */
1504 #endif /* !PERL_MICRO */
1506 #endif /* !VMS && !EPOC*/
1508 #ifdef UNLINK_ALL_VERSIONS
1510 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1514 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1519 /* this is a drop-in replacement for bcopy() */
1520 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1522 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1526 if (from - to >= 0) {
1534 *(--to) = *(--from);
1540 /* this is a drop-in replacement for memset() */
1543 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1553 /* this is a drop-in replacement for bzero() */
1554 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1556 Perl_my_bzero(register char *loc, register I32 len)
1566 /* this is a drop-in replacement for memcmp() */
1567 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1569 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1571 register const U8 *a = (const U8 *)s1;
1572 register const U8 *b = (const U8 *)s2;
1576 if ((tmp = *a++ - *b++))
1581 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1585 #ifdef USE_CHAR_VSPRINTF
1590 vsprintf(char *dest, const char *pat, char *args)
1594 fakebuf._ptr = dest;
1595 fakebuf._cnt = 32767;
1599 fakebuf._flag = _IOWRT|_IOSTRG;
1600 _doprnt(pat, args, &fakebuf); /* what a kludge */
1601 (void)putc('\0', &fakebuf);
1602 #ifdef USE_CHAR_VSPRINTF
1605 return 0; /* perl doesn't use return value */
1609 #endif /* HAS_VPRINTF */
1612 #if BYTEORDER != 0x4321
1614 Perl_my_swap(pTHX_ short s)
1616 #if (BYTEORDER & 1) == 0
1619 result = ((s & 255) << 8) + ((s >> 8) & 255);
1627 Perl_my_htonl(pTHX_ long l)
1631 char c[sizeof(long)];
1634 #if BYTEORDER == 0x1234
1635 u.c[0] = (l >> 24) & 255;
1636 u.c[1] = (l >> 16) & 255;
1637 u.c[2] = (l >> 8) & 255;
1641 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1642 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1647 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1648 u.c[o & 0xf] = (l >> s) & 255;
1656 Perl_my_ntohl(pTHX_ long l)
1660 char c[sizeof(long)];
1663 #if BYTEORDER == 0x1234
1664 u.c[0] = (l >> 24) & 255;
1665 u.c[1] = (l >> 16) & 255;
1666 u.c[2] = (l >> 8) & 255;
1670 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1671 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1678 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1679 l |= (u.c[o & 0xf] & 255) << s;
1686 #endif /* BYTEORDER != 0x4321 */
1690 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1691 * If these functions are defined,
1692 * the BYTEORDER is neither 0x1234 nor 0x4321.
1693 * However, this is not assumed.
1697 #define HTOLE(name,type) \
1699 name (register type n) \
1703 char c[sizeof(type)]; \
1706 register I32 s = 0; \
1707 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1708 u.c[i] = (n >> s) & 0xFF; \
1713 #define LETOH(name,type) \
1715 name (register type n) \
1719 char c[sizeof(type)]; \
1722 register I32 s = 0; \
1725 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1726 n |= ((type)(u.c[i] & 0xFF)) << s; \
1732 * Big-endian byte order functions.
1735 #define HTOBE(name,type) \
1737 name (register type n) \
1741 char c[sizeof(type)]; \
1744 register I32 s = 8*(sizeof(u.c)-1); \
1745 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1746 u.c[i] = (n >> s) & 0xFF; \
1751 #define BETOH(name,type) \
1753 name (register type n) \
1757 char c[sizeof(type)]; \
1760 register I32 s = 8*(sizeof(u.c)-1); \
1763 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1764 n |= ((type)(u.c[i] & 0xFF)) << s; \
1770 * If we just can't do it...
1773 #define NOT_AVAIL(name,type) \
1775 name (register type n) \
1777 Perl_croak_nocontext(#name "() not available"); \
1778 return n; /* not reached */ \
1782 #if defined(HAS_HTOVS) && !defined(htovs)
1785 #if defined(HAS_HTOVL) && !defined(htovl)
1788 #if defined(HAS_VTOHS) && !defined(vtohs)
1791 #if defined(HAS_VTOHL) && !defined(vtohl)
1795 #ifdef PERL_NEED_MY_HTOLE16
1797 HTOLE(Perl_my_htole16,U16)
1799 NOT_AVAIL(Perl_my_htole16,U16)
1802 #ifdef PERL_NEED_MY_LETOH16
1804 LETOH(Perl_my_letoh16,U16)
1806 NOT_AVAIL(Perl_my_letoh16,U16)
1809 #ifdef PERL_NEED_MY_HTOBE16
1811 HTOBE(Perl_my_htobe16,U16)
1813 NOT_AVAIL(Perl_my_htobe16,U16)
1816 #ifdef PERL_NEED_MY_BETOH16
1818 BETOH(Perl_my_betoh16,U16)
1820 NOT_AVAIL(Perl_my_betoh16,U16)
1824 #ifdef PERL_NEED_MY_HTOLE32
1826 HTOLE(Perl_my_htole32,U32)
1828 NOT_AVAIL(Perl_my_htole32,U32)
1831 #ifdef PERL_NEED_MY_LETOH32
1833 LETOH(Perl_my_letoh32,U32)
1835 NOT_AVAIL(Perl_my_letoh32,U32)
1838 #ifdef PERL_NEED_MY_HTOBE32
1840 HTOBE(Perl_my_htobe32,U32)
1842 NOT_AVAIL(Perl_my_htobe32,U32)
1845 #ifdef PERL_NEED_MY_BETOH32
1847 BETOH(Perl_my_betoh32,U32)
1849 NOT_AVAIL(Perl_my_betoh32,U32)
1853 #ifdef PERL_NEED_MY_HTOLE64
1855 HTOLE(Perl_my_htole64,U64)
1857 NOT_AVAIL(Perl_my_htole64,U64)
1860 #ifdef PERL_NEED_MY_LETOH64
1862 LETOH(Perl_my_letoh64,U64)
1864 NOT_AVAIL(Perl_my_letoh64,U64)
1867 #ifdef PERL_NEED_MY_HTOBE64
1869 HTOBE(Perl_my_htobe64,U64)
1871 NOT_AVAIL(Perl_my_htobe64,U64)
1874 #ifdef PERL_NEED_MY_BETOH64
1876 BETOH(Perl_my_betoh64,U64)
1878 NOT_AVAIL(Perl_my_betoh64,U64)
1882 #ifdef PERL_NEED_MY_HTOLES
1883 HTOLE(Perl_my_htoles,short)
1885 #ifdef PERL_NEED_MY_LETOHS
1886 LETOH(Perl_my_letohs,short)
1888 #ifdef PERL_NEED_MY_HTOBES
1889 HTOBE(Perl_my_htobes,short)
1891 #ifdef PERL_NEED_MY_BETOHS
1892 BETOH(Perl_my_betohs,short)
1895 #ifdef PERL_NEED_MY_HTOLEI
1896 HTOLE(Perl_my_htolei,int)
1898 #ifdef PERL_NEED_MY_LETOHI
1899 LETOH(Perl_my_letohi,int)
1901 #ifdef PERL_NEED_MY_HTOBEI
1902 HTOBE(Perl_my_htobei,int)
1904 #ifdef PERL_NEED_MY_BETOHI
1905 BETOH(Perl_my_betohi,int)
1908 #ifdef PERL_NEED_MY_HTOLEL
1909 HTOLE(Perl_my_htolel,long)
1911 #ifdef PERL_NEED_MY_LETOHL
1912 LETOH(Perl_my_letohl,long)
1914 #ifdef PERL_NEED_MY_HTOBEL
1915 HTOBE(Perl_my_htobel,long)
1917 #ifdef PERL_NEED_MY_BETOHL
1918 BETOH(Perl_my_betohl,long)
1922 Perl_my_swabn(void *ptr, int n)
1924 register char *s = (char *)ptr;
1925 register char *e = s + (n-1);
1928 for (n /= 2; n > 0; s++, e--, n--) {
1936 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1938 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1940 register I32 This, that;
1946 PERL_FLUSHALL_FOR_CHILD;
1947 This = (*mode == 'w');
1951 taint_proper("Insecure %s%s", "EXEC");
1953 if (PerlProc_pipe(p) < 0)
1955 /* Try for another pipe pair for error return */
1956 if (PerlProc_pipe(pp) >= 0)
1958 while ((pid = PerlProc_fork()) < 0) {
1959 if (errno != EAGAIN) {
1960 PerlLIO_close(p[This]);
1961 PerlLIO_close(p[that]);
1963 PerlLIO_close(pp[0]);
1964 PerlLIO_close(pp[1]);
1976 /* Close parent's end of error status pipe (if any) */
1978 PerlLIO_close(pp[0]);
1979 #if defined(HAS_FCNTL) && defined(F_SETFD)
1980 /* Close error pipe automatically if exec works */
1981 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1984 /* Now dup our end of _the_ pipe to right position */
1985 if (p[THIS] != (*mode == 'r')) {
1986 PerlLIO_dup2(p[THIS], *mode == 'r');
1987 PerlLIO_close(p[THIS]);
1988 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1989 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1992 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1993 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1994 /* No automatic close - do it by hand */
2001 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2007 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2013 do_execfree(); /* free any memory malloced by child on fork */
2015 PerlLIO_close(pp[1]);
2016 /* Keep the lower of the two fd numbers */
2017 if (p[that] < p[This]) {
2018 PerlLIO_dup2(p[This], p[that]);
2019 PerlLIO_close(p[This]);
2023 PerlLIO_close(p[that]); /* close child's end of pipe */
2026 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2028 SvUPGRADE(sv,SVt_IV);
2030 PL_forkprocess = pid;
2031 /* If we managed to get status pipe check for exec fail */
2032 if (did_pipes && pid > 0) {
2036 while (n < sizeof(int)) {
2037 n1 = PerlLIO_read(pp[0],
2038 (void*)(((char*)&errkid)+n),
2044 PerlLIO_close(pp[0]);
2046 if (n) { /* Error */
2048 PerlLIO_close(p[This]);
2049 if (n != sizeof(int))
2050 Perl_croak(aTHX_ "panic: kid popen errno read");
2052 pid2 = wait4pid(pid, &status, 0);
2053 } while (pid2 == -1 && errno == EINTR);
2054 errno = errkid; /* Propagate errno from kid */
2059 PerlLIO_close(pp[0]);
2060 return PerlIO_fdopen(p[This], mode);
2062 Perl_croak(aTHX_ "List form of piped open not implemented");
2063 return (PerlIO *) NULL;
2067 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2068 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2070 Perl_my_popen(pTHX_ char *cmd, char *mode)
2073 register I32 This, that;
2076 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2080 PERL_FLUSHALL_FOR_CHILD;
2083 return my_syspopen(aTHX_ cmd,mode);
2086 This = (*mode == 'w');
2088 if (doexec && PL_tainting) {
2090 taint_proper("Insecure %s%s", "EXEC");
2092 if (PerlProc_pipe(p) < 0)
2094 if (doexec && PerlProc_pipe(pp) >= 0)
2096 while ((pid = PerlProc_fork()) < 0) {
2097 if (errno != EAGAIN) {
2098 PerlLIO_close(p[This]);
2099 PerlLIO_close(p[that]);
2101 PerlLIO_close(pp[0]);
2102 PerlLIO_close(pp[1]);
2105 Perl_croak(aTHX_ "Can't fork");
2118 PerlLIO_close(pp[0]);
2119 #if defined(HAS_FCNTL) && defined(F_SETFD)
2120 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2123 if (p[THIS] != (*mode == 'r')) {
2124 PerlLIO_dup2(p[THIS], *mode == 'r');
2125 PerlLIO_close(p[THIS]);
2126 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2127 PerlLIO_close(p[THAT]);
2130 PerlLIO_close(p[THAT]);
2133 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2140 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2145 /* may or may not use the shell */
2146 do_exec3(cmd, pp[1], did_pipes);
2149 #endif /* defined OS2 */
2150 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2151 SvREADONLY_off(GvSV(tmpgv));
2152 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2153 SvREADONLY_on(GvSV(tmpgv));
2155 #ifdef THREADS_HAVE_PIDS
2156 PL_ppid = (IV)getppid();
2159 hv_clear(PL_pidstatus); /* we have no children */
2164 do_execfree(); /* free any memory malloced by child on vfork */
2166 PerlLIO_close(pp[1]);
2167 if (p[that] < p[This]) {
2168 PerlLIO_dup2(p[This], p[that]);
2169 PerlLIO_close(p[This]);
2173 PerlLIO_close(p[that]);
2176 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2178 SvUPGRADE(sv,SVt_IV);
2180 PL_forkprocess = pid;
2181 if (did_pipes && pid > 0) {
2185 while (n < sizeof(int)) {
2186 n1 = PerlLIO_read(pp[0],
2187 (void*)(((char*)&errkid)+n),
2193 PerlLIO_close(pp[0]);
2195 if (n) { /* Error */
2197 PerlLIO_close(p[This]);
2198 if (n != sizeof(int))
2199 Perl_croak(aTHX_ "panic: kid popen errno read");
2201 pid2 = wait4pid(pid, &status, 0);
2202 } while (pid2 == -1 && errno == EINTR);
2203 errno = errkid; /* Propagate errno from kid */
2208 PerlLIO_close(pp[0]);
2209 return PerlIO_fdopen(p[This], mode);
2212 #if defined(atarist) || defined(EPOC)
2215 Perl_my_popen(pTHX_ char *cmd, char *mode)
2217 PERL_FLUSHALL_FOR_CHILD;
2218 /* Call system's popen() to get a FILE *, then import it.
2219 used 0 for 2nd parameter to PerlIO_importFILE;
2222 return PerlIO_importFILE(popen(cmd, mode), 0);
2226 FILE *djgpp_popen();
2228 Perl_my_popen(pTHX_ char *cmd, char *mode)
2230 PERL_FLUSHALL_FOR_CHILD;
2231 /* Call system's popen() to get a FILE *, then import it.
2232 used 0 for 2nd parameter to PerlIO_importFILE;
2235 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2240 #endif /* !DOSISH */
2242 /* this is called in parent before the fork() */
2244 Perl_atfork_lock(void)
2247 #if defined(USE_ITHREADS)
2248 /* locks must be held in locking order (if any) */
2250 MUTEX_LOCK(&PL_malloc_mutex);
2256 /* this is called in both parent and child after the fork() */
2258 Perl_atfork_unlock(void)
2261 #if defined(USE_ITHREADS)
2262 /* locks must be released in same order as in atfork_lock() */
2264 MUTEX_UNLOCK(&PL_malloc_mutex);
2273 #if defined(HAS_FORK)
2275 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2280 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2281 * handlers elsewhere in the code */
2286 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2287 Perl_croak_nocontext("fork() not available");
2289 #endif /* HAS_FORK */
2294 Perl_dump_fds(pTHX_ char *s)
2299 PerlIO_printf(Perl_debug_log,"%s", s);
2300 for (fd = 0; fd < 32; fd++) {
2301 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2302 PerlIO_printf(Perl_debug_log," %d",fd);
2304 PerlIO_printf(Perl_debug_log,"\n");
2307 #endif /* DUMP_FDS */
2311 dup2(int oldfd, int newfd)
2313 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2316 PerlLIO_close(newfd);
2317 return fcntl(oldfd, F_DUPFD, newfd);
2319 #define DUP2_MAX_FDS 256
2320 int fdtmp[DUP2_MAX_FDS];
2326 PerlLIO_close(newfd);
2327 /* good enough for low fd's... */
2328 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2329 if (fdx >= DUP2_MAX_FDS) {
2337 PerlLIO_close(fdtmp[--fdx]);
2344 #ifdef HAS_SIGACTION
2346 #ifdef MACOS_TRADITIONAL
2347 /* We don't want restart behavior on MacOS */
2352 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2355 struct sigaction act, oact;
2358 /* only "parent" interpreter can diddle signals */
2359 if (PL_curinterp != aTHX)
2363 act.sa_handler = handler;
2364 sigemptyset(&act.sa_mask);
2367 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2368 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2370 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2371 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2372 act.sa_flags |= SA_NOCLDWAIT;
2374 if (sigaction(signo, &act, &oact) == -1)
2377 return oact.sa_handler;
2381 Perl_rsignal_state(pTHX_ int signo)
2383 struct sigaction oact;
2385 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2388 return oact.sa_handler;
2392 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2395 struct sigaction act;
2398 /* only "parent" interpreter can diddle signals */
2399 if (PL_curinterp != aTHX)
2403 act.sa_handler = handler;
2404 sigemptyset(&act.sa_mask);
2407 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2408 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2410 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2411 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2412 act.sa_flags |= SA_NOCLDWAIT;
2414 return sigaction(signo, &act, save);
2418 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2422 /* only "parent" interpreter can diddle signals */
2423 if (PL_curinterp != aTHX)
2427 return sigaction(signo, save, (struct sigaction *)NULL);
2430 #else /* !HAS_SIGACTION */
2433 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2435 #if defined(USE_ITHREADS) && !defined(WIN32)
2436 /* only "parent" interpreter can diddle signals */
2437 if (PL_curinterp != aTHX)
2441 return PerlProc_signal(signo, handler);
2453 Perl_rsignal_state(pTHX_ int signo)
2456 Sighandler_t oldsig;
2458 #if defined(USE_ITHREADS) && !defined(WIN32)
2459 /* only "parent" interpreter can diddle signals */
2460 if (PL_curinterp != aTHX)
2465 oldsig = PerlProc_signal(signo, sig_trap);
2466 PerlProc_signal(signo, oldsig);
2468 PerlProc_kill(PerlProc_getpid(), signo);
2473 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2475 #if defined(USE_ITHREADS) && !defined(WIN32)
2476 /* only "parent" interpreter can diddle signals */
2477 if (PL_curinterp != aTHX)
2480 *save = PerlProc_signal(signo, handler);
2481 return (*save == SIG_ERR) ? -1 : 0;
2485 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2487 #if defined(USE_ITHREADS) && !defined(WIN32)
2488 /* only "parent" interpreter can diddle signals */
2489 if (PL_curinterp != aTHX)
2492 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2495 #endif /* !HAS_SIGACTION */
2496 #endif /* !PERL_MICRO */
2498 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2499 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2501 Perl_my_pclose(pTHX_ PerlIO *ptr)
2503 Sigsave_t hstat, istat, qstat;
2509 int saved_errno = 0;
2511 int saved_win32_errno;
2515 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2517 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2519 *svp = &PL_sv_undef;
2521 if (pid == -1) { /* Opened by popen. */
2522 return my_syspclose(ptr);
2525 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2526 saved_errno = errno;
2528 saved_win32_errno = GetLastError();
2532 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2535 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2536 rsignal_save(SIGINT, SIG_IGN, &istat);
2537 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2540 pid2 = wait4pid(pid, &status, 0);
2541 } while (pid2 == -1 && errno == EINTR);
2543 rsignal_restore(SIGHUP, &hstat);
2544 rsignal_restore(SIGINT, &istat);
2545 rsignal_restore(SIGQUIT, &qstat);
2548 SETERRNO(saved_errno, 0);
2551 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2553 #endif /* !DOSISH */
2555 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2557 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2562 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2564 char spid[TYPE_CHARS(IV)];
2568 sprintf(spid, "%"IVdf, (IV)pid);
2569 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2570 if (svp && *svp != &PL_sv_undef) {
2571 *statusp = SvIVX(*svp);
2572 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2579 hv_iterinit(PL_pidstatus);
2580 if ((entry = hv_iternext(PL_pidstatus))) {
2581 SV *sv = hv_iterval(PL_pidstatus,entry);
2583 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2584 *statusp = SvIVX(sv);
2585 sprintf(spid, "%"IVdf, (IV)pid);
2586 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2593 # ifdef HAS_WAITPID_RUNTIME
2594 if (!HAS_WAITPID_RUNTIME)
2597 result = PerlProc_waitpid(pid,statusp,flags);
2600 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2601 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2604 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2605 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2610 Perl_croak(aTHX_ "Can't do waitpid with flags");
2612 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2613 pidgone(result,*statusp);
2619 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2622 if (result < 0 && errno == EINTR) {
2627 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2630 Perl_pidgone(pTHX_ Pid_t pid, int status)
2633 char spid[TYPE_CHARS(IV)];
2635 sprintf(spid, "%"IVdf, (IV)pid);
2636 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2637 SvUPGRADE(sv,SVt_IV);
2638 SvIV_set(sv, status);
2642 #if defined(atarist) || defined(OS2) || defined(EPOC)
2645 int /* Cannot prototype with I32
2647 my_syspclose(PerlIO *ptr)
2650 Perl_my_pclose(pTHX_ PerlIO *ptr)
2653 /* Needs work for PerlIO ! */
2654 FILE *f = PerlIO_findFILE(ptr);
2655 I32 result = pclose(f);
2656 PerlIO_releaseFILE(ptr,f);
2664 Perl_my_pclose(pTHX_ PerlIO *ptr)
2666 /* Needs work for PerlIO ! */
2667 FILE *f = PerlIO_findFILE(ptr);
2668 I32 result = djgpp_pclose(f);
2669 result = (result << 8) & 0xff00;
2670 PerlIO_releaseFILE(ptr,f);
2676 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2679 register const char *frombase = from;
2682 register const char c = *from;
2687 while (count-- > 0) {
2688 for (todo = len; todo > 0; todo--) {
2697 Perl_same_dirent(pTHX_ const char *a, const char *b)
2699 char *fa = strrchr(a,'/');
2700 char *fb = strrchr(b,'/');
2703 SV *tmpsv = sv_newmortal();
2716 sv_setpvn(tmpsv, ".", 1);
2718 sv_setpvn(tmpsv, a, fa - a);
2719 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2722 sv_setpvn(tmpsv, ".", 1);
2724 sv_setpvn(tmpsv, b, fb - b);
2725 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2727 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2728 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2730 #endif /* !HAS_RENAME */
2733 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2735 const char *xfound = Nullch;
2736 char *xfailed = Nullch;
2737 char tmpbuf[MAXPATHLEN];
2741 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2742 # define SEARCH_EXTS ".bat", ".cmd", NULL
2743 # define MAX_EXT_LEN 4
2746 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2747 # define MAX_EXT_LEN 4
2750 # define SEARCH_EXTS ".pl", ".com", NULL
2751 # define MAX_EXT_LEN 4
2753 /* additional extensions to try in each dir if scriptname not found */
2755 const char *exts[] = { SEARCH_EXTS };
2756 const char **ext = search_ext ? search_ext : exts;
2757 int extidx = 0, i = 0;
2758 const char *curext = Nullch;
2760 PERL_UNUSED_ARG(search_ext);
2761 # define MAX_EXT_LEN 0
2765 * If dosearch is true and if scriptname does not contain path
2766 * delimiters, search the PATH for scriptname.
2768 * If SEARCH_EXTS is also defined, will look for each
2769 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2770 * while searching the PATH.
2772 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2773 * proceeds as follows:
2774 * If DOSISH or VMSISH:
2775 * + look for ./scriptname{,.foo,.bar}
2776 * + search the PATH for scriptname{,.foo,.bar}
2779 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2780 * this will not look in '.' if it's not in the PATH)
2785 # ifdef ALWAYS_DEFTYPES
2786 len = strlen(scriptname);
2787 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2788 int hasdir, idx = 0, deftypes = 1;
2791 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2794 int hasdir, idx = 0, deftypes = 1;
2797 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2799 /* The first time through, just add SEARCH_EXTS to whatever we
2800 * already have, so we can check for default file types. */
2802 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2808 if ((strlen(tmpbuf) + strlen(scriptname)
2809 + MAX_EXT_LEN) >= sizeof tmpbuf)
2810 continue; /* don't search dir with too-long name */
2811 strcat(tmpbuf, scriptname);
2815 if (strEQ(scriptname, "-"))
2817 if (dosearch) { /* Look in '.' first. */
2818 const char *cur = scriptname;
2820 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2822 if (strEQ(ext[i++],curext)) {
2823 extidx = -1; /* already has an ext */
2828 DEBUG_p(PerlIO_printf(Perl_debug_log,
2829 "Looking for %s\n",cur));
2830 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2831 && !S_ISDIR(PL_statbuf.st_mode)) {
2839 if (cur == scriptname) {
2840 len = strlen(scriptname);
2841 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2843 cur = strcpy(tmpbuf, scriptname);
2845 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2846 && strcpy(tmpbuf+len, ext[extidx++]));
2851 #ifdef MACOS_TRADITIONAL
2852 if (dosearch && !strchr(scriptname, ':') &&
2853 (s = PerlEnv_getenv("Commands")))
2855 if (dosearch && !strchr(scriptname, '/')
2857 && !strchr(scriptname, '\\')
2859 && (s = PerlEnv_getenv("PATH")))
2864 PL_bufend = s + strlen(s);
2865 while (s < PL_bufend) {
2866 #ifdef MACOS_TRADITIONAL
2867 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2871 #if defined(atarist) || defined(DOSISH)
2876 && *s != ';'; len++, s++) {
2877 if (len < sizeof tmpbuf)
2880 if (len < sizeof tmpbuf)
2882 #else /* ! (atarist || DOSISH) */
2883 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2886 #endif /* ! (atarist || DOSISH) */
2887 #endif /* MACOS_TRADITIONAL */
2890 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2891 continue; /* don't search dir with too-long name */
2892 #ifdef MACOS_TRADITIONAL
2893 if (len && tmpbuf[len - 1] != ':')
2894 tmpbuf[len++] = ':';
2897 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2898 && tmpbuf[len - 1] != '/'
2899 && tmpbuf[len - 1] != '\\'
2902 tmpbuf[len++] = '/';
2903 if (len == 2 && tmpbuf[0] == '.')
2906 (void)strcpy(tmpbuf + len, scriptname);
2910 len = strlen(tmpbuf);
2911 if (extidx > 0) /* reset after previous loop */
2915 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2916 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2917 if (S_ISDIR(PL_statbuf.st_mode)) {
2921 } while ( retval < 0 /* not there */
2922 && extidx>=0 && ext[extidx] /* try an extension? */
2923 && strcpy(tmpbuf+len, ext[extidx++])
2928 if (S_ISREG(PL_statbuf.st_mode)
2929 && cando(S_IRUSR,TRUE,&PL_statbuf)
2930 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2931 && cando(S_IXUSR,TRUE,&PL_statbuf)
2935 xfound = tmpbuf; /* bingo! */
2939 xfailed = savepv(tmpbuf);
2942 if (!xfound && !seen_dot && !xfailed &&
2943 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2944 || S_ISDIR(PL_statbuf.st_mode)))
2946 seen_dot = 1; /* Disable message. */
2948 if (flags & 1) { /* do or die? */
2949 Perl_croak(aTHX_ "Can't %s %s%s%s",
2950 (xfailed ? "execute" : "find"),
2951 (xfailed ? xfailed : scriptname),
2952 (xfailed ? "" : " on PATH"),
2953 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2955 scriptname = Nullch;
2959 scriptname = xfound;
2961 return (scriptname ? savepv(scriptname) : Nullch);
2964 #ifndef PERL_GET_CONTEXT_DEFINED
2967 Perl_get_context(void)
2970 #if defined(USE_ITHREADS)
2971 # ifdef OLD_PTHREADS_API
2973 if (pthread_getspecific(PL_thr_key, &t))
2974 Perl_croak_nocontext("panic: pthread_getspecific");
2977 # ifdef I_MACH_CTHREADS
2978 return (void*)cthread_data(cthread_self());
2980 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2989 Perl_set_context(void *t)
2992 #if defined(USE_ITHREADS)
2993 # ifdef I_MACH_CTHREADS
2994 cthread_set_data(cthread_self(), t);
2996 if (pthread_setspecific(PL_thr_key, t))
2997 Perl_croak_nocontext("panic: pthread_setspecific");
3004 #endif /* !PERL_GET_CONTEXT_DEFINED */
3006 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3015 Perl_get_op_names(pTHX)
3017 return (char **)PL_op_name;
3021 Perl_get_op_descs(pTHX)
3023 return (char **)PL_op_desc;
3027 Perl_get_no_modify(pTHX)
3029 return PL_no_modify;
3033 Perl_get_opargs(pTHX)
3035 return (U32 *)PL_opargs;
3039 Perl_get_ppaddr(pTHX)
3042 return (PPADDR_t*)PL_ppaddr;
3045 #ifndef HAS_GETENV_LEN
3047 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3049 char *env_trans = PerlEnv_getenv(env_elem);
3051 *len = strlen(env_trans);
3058 Perl_get_vtbl(pTHX_ int vtbl_id)
3060 const MGVTBL* result = Null(MGVTBL*);
3064 result = &PL_vtbl_sv;
3067 result = &PL_vtbl_env;
3069 case want_vtbl_envelem:
3070 result = &PL_vtbl_envelem;
3073 result = &PL_vtbl_sig;
3075 case want_vtbl_sigelem:
3076 result = &PL_vtbl_sigelem;
3078 case want_vtbl_pack:
3079 result = &PL_vtbl_pack;
3081 case want_vtbl_packelem:
3082 result = &PL_vtbl_packelem;
3084 case want_vtbl_dbline:
3085 result = &PL_vtbl_dbline;
3088 result = &PL_vtbl_isa;
3090 case want_vtbl_isaelem:
3091 result = &PL_vtbl_isaelem;
3093 case want_vtbl_arylen:
3094 result = &PL_vtbl_arylen;
3096 case want_vtbl_glob:
3097 result = &PL_vtbl_glob;
3099 case want_vtbl_mglob:
3100 result = &PL_vtbl_mglob;
3102 case want_vtbl_nkeys:
3103 result = &PL_vtbl_nkeys;
3105 case want_vtbl_taint:
3106 result = &PL_vtbl_taint;
3108 case want_vtbl_substr:
3109 result = &PL_vtbl_substr;
3112 result = &PL_vtbl_vec;
3115 result = &PL_vtbl_pos;
3118 result = &PL_vtbl_bm;
3121 result = &PL_vtbl_fm;
3123 case want_vtbl_uvar:
3124 result = &PL_vtbl_uvar;
3126 case want_vtbl_defelem:
3127 result = &PL_vtbl_defelem;
3129 case want_vtbl_regexp:
3130 result = &PL_vtbl_regexp;
3132 case want_vtbl_regdata:
3133 result = &PL_vtbl_regdata;
3135 case want_vtbl_regdatum:
3136 result = &PL_vtbl_regdatum;
3138 #ifdef USE_LOCALE_COLLATE
3139 case want_vtbl_collxfrm:
3140 result = &PL_vtbl_collxfrm;
3143 case want_vtbl_amagic:
3144 result = &PL_vtbl_amagic;
3146 case want_vtbl_amagicelem:
3147 result = &PL_vtbl_amagicelem;
3149 case want_vtbl_backref:
3150 result = &PL_vtbl_backref;
3152 case want_vtbl_utf8:
3153 result = &PL_vtbl_utf8;
3156 return (MGVTBL*)result;
3160 Perl_my_fflush_all(pTHX)
3162 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3163 return PerlIO_flush(NULL);
3165 # if defined(HAS__FWALK)
3166 extern int fflush(FILE *);
3167 /* undocumented, unprototyped, but very useful BSDism */
3168 extern void _fwalk(int (*)(FILE *));
3172 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3174 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3175 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3177 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3178 open_max = sysconf(_SC_OPEN_MAX);
3181 open_max = FOPEN_MAX;
3184 open_max = OPEN_MAX;
3195 for (i = 0; i < open_max; i++)
3196 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3197 STDIO_STREAM_ARRAY[i]._file < open_max &&
3198 STDIO_STREAM_ARRAY[i]._flag)
3199 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3203 SETERRNO(EBADF,RMS_IFI);
3210 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3213 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3214 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3216 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3217 const char *type = OP_IS_SOCKET(op)
3218 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3219 ? "socket" : "filehandle";
3220 const char *name = NULL;
3222 if (gv && isGV(gv)) {
3226 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3227 if (ckWARN(WARN_IO)) {
3228 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3230 Perl_warner(aTHX_ packWARN(WARN_IO),
3231 "Filehandle %s opened only for %sput",
3234 Perl_warner(aTHX_ packWARN(WARN_IO),
3235 "Filehandle opened only for %sput", direction);
3242 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3244 warn_type = WARN_CLOSED;
3248 warn_type = WARN_UNOPENED;
3251 if (ckWARN(warn_type)) {
3252 if (name && *name) {
3253 Perl_warner(aTHX_ packWARN(warn_type),
3254 "%s%s on %s %s %s", func, pars, vile, type, name);
3255 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3257 aTHX_ packWARN(warn_type),
3258 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3263 Perl_warner(aTHX_ packWARN(warn_type),
3264 "%s%s on %s %s", func, pars, vile, type);
3265 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3267 aTHX_ packWARN(warn_type),
3268 "\t(Are you trying to call %s%s on dirhandle?)\n",
3277 /* in ASCII order, not that it matters */
3278 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3281 Perl_ebcdic_control(pTHX_ int ch)
3289 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3290 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3293 if (ctlp == controllablechars)
3294 return('\177'); /* DEL */
3296 return((unsigned char)(ctlp - controllablechars - 1));
3297 } else { /* Want uncontrol */
3298 if (ch == '\177' || ch == -1)
3300 else if (ch == '\157')
3302 else if (ch == '\174')
3304 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3306 else if (ch == '\155')
3308 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3309 return(controllablechars[ch+1]);
3311 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3316 /* To workaround core dumps from the uninitialised tm_zone we get the
3317 * system to give us a reasonable struct to copy. This fix means that
3318 * strftime uses the tm_zone and tm_gmtoff values returned by
3319 * localtime(time()). That should give the desired result most of the
3320 * time. But probably not always!
3322 * This does not address tzname aspects of NETaa14816.
3327 # ifndef STRUCT_TM_HASZONE
3328 # define STRUCT_TM_HASZONE
3332 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3333 # ifndef HAS_TM_TM_ZONE
3334 # define HAS_TM_TM_ZONE
3339 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3341 #ifdef HAS_TM_TM_ZONE
3345 my_tm = localtime(&now);
3347 Copy(my_tm, ptm, 1, struct tm);
3352 * mini_mktime - normalise struct tm values without the localtime()
3353 * semantics (and overhead) of mktime().
3356 Perl_mini_mktime(pTHX_ struct tm *ptm)
3360 int month, mday, year, jday;
3361 int odd_cent, odd_year;
3363 #define DAYS_PER_YEAR 365
3364 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3365 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3366 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3367 #define SECS_PER_HOUR (60*60)
3368 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3369 /* parentheses deliberately absent on these two, otherwise they don't work */
3370 #define MONTH_TO_DAYS 153/5
3371 #define DAYS_TO_MONTH 5/153
3372 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3373 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3374 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3375 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3378 * Year/day algorithm notes:
3380 * With a suitable offset for numeric value of the month, one can find
3381 * an offset into the year by considering months to have 30.6 (153/5) days,
3382 * using integer arithmetic (i.e., with truncation). To avoid too much
3383 * messing about with leap days, we consider January and February to be
3384 * the 13th and 14th month of the previous year. After that transformation,
3385 * we need the month index we use to be high by 1 from 'normal human' usage,
3386 * so the month index values we use run from 4 through 15.
3388 * Given that, and the rules for the Gregorian calendar (leap years are those
3389 * divisible by 4 unless also divisible by 100, when they must be divisible
3390 * by 400 instead), we can simply calculate the number of days since some
3391 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3392 * the days we derive from our month index, and adding in the day of the
3393 * month. The value used here is not adjusted for the actual origin which
3394 * it normally would use (1 January A.D. 1), since we're not exposing it.
3395 * We're only building the value so we can turn around and get the
3396 * normalised values for the year, month, day-of-month, and day-of-year.
3398 * For going backward, we need to bias the value we're using so that we find
3399 * the right year value. (Basically, we don't want the contribution of
3400 * March 1st to the number to apply while deriving the year). Having done
3401 * that, we 'count up' the contribution to the year number by accounting for
3402 * full quadracenturies (400-year periods) with their extra leap days, plus
3403 * the contribution from full centuries (to avoid counting in the lost leap
3404 * days), plus the contribution from full quad-years (to count in the normal
3405 * leap days), plus the leftover contribution from any non-leap years.
3406 * At this point, if we were working with an actual leap day, we'll have 0
3407 * days left over. This is also true for March 1st, however. So, we have
3408 * to special-case that result, and (earlier) keep track of the 'odd'
3409 * century and year contributions. If we got 4 extra centuries in a qcent,
3410 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3411 * Otherwise, we add back in the earlier bias we removed (the 123 from
3412 * figuring in March 1st), find the month index (integer division by 30.6),
3413 * and the remainder is the day-of-month. We then have to convert back to
3414 * 'real' months (including fixing January and February from being 14/15 in
3415 * the previous year to being in the proper year). After that, to get
3416 * tm_yday, we work with the normalised year and get a new yearday value for
3417 * January 1st, which we subtract from the yearday value we had earlier,
3418 * representing the date we've re-built. This is done from January 1
3419 * because tm_yday is 0-origin.
3421 * Since POSIX time routines are only guaranteed to work for times since the
3422 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3423 * applies Gregorian calendar rules even to dates before the 16th century
3424 * doesn't bother me. Besides, you'd need cultural context for a given
3425 * date to know whether it was Julian or Gregorian calendar, and that's
3426 * outside the scope for this routine. Since we convert back based on the
3427 * same rules we used to build the yearday, you'll only get strange results
3428 * for input which needed normalising, or for the 'odd' century years which
3429 * were leap years in the Julian calander but not in the Gregorian one.
3430 * I can live with that.
3432 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3433 * that's still outside the scope for POSIX time manipulation, so I don't
3437 year = 1900 + ptm->tm_year;
3438 month = ptm->tm_mon;
3439 mday = ptm->tm_mday;
3440 /* allow given yday with no month & mday to dominate the result */
3441 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3444 jday = 1 + ptm->tm_yday;
3453 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3454 yearday += month*MONTH_TO_DAYS + mday + jday;
3456 * Note that we don't know when leap-seconds were or will be,
3457 * so we have to trust the user if we get something which looks
3458 * like a sensible leap-second. Wild values for seconds will
3459 * be rationalised, however.
3461 if ((unsigned) ptm->tm_sec <= 60) {
3468 secs += 60 * ptm->tm_min;
3469 secs += SECS_PER_HOUR * ptm->tm_hour;
3471 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3472 /* got negative remainder, but need positive time */
3473 /* back off an extra day to compensate */
3474 yearday += (secs/SECS_PER_DAY)-1;
3475 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3478 yearday += (secs/SECS_PER_DAY);
3479 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3482 else if (secs >= SECS_PER_DAY) {
3483 yearday += (secs/SECS_PER_DAY);
3484 secs %= SECS_PER_DAY;
3486 ptm->tm_hour = secs/SECS_PER_HOUR;
3487 secs %= SECS_PER_HOUR;
3488 ptm->tm_min = secs/60;
3490 ptm->tm_sec += secs;
3491 /* done with time of day effects */
3493 * The algorithm for yearday has (so far) left it high by 428.
3494 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3495 * bias it by 123 while trying to figure out what year it
3496 * really represents. Even with this tweak, the reverse
3497 * translation fails for years before A.D. 0001.
3498 * It would still fail for Feb 29, but we catch that one below.
3500 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3501 yearday -= YEAR_ADJUST;
3502 year = (yearday / DAYS_PER_QCENT) * 400;
3503 yearday %= DAYS_PER_QCENT;
3504 odd_cent = yearday / DAYS_PER_CENT;
3505 year += odd_cent * 100;
3506 yearday %= DAYS_PER_CENT;
3507 year += (yearday / DAYS_PER_QYEAR) * 4;
3508 yearday %= DAYS_PER_QYEAR;
3509 odd_year = yearday / DAYS_PER_YEAR;
3511 yearday %= DAYS_PER_YEAR;
3512 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3517 yearday += YEAR_ADJUST; /* recover March 1st crock */
3518 month = yearday*DAYS_TO_MONTH;
3519 yearday -= month*MONTH_TO_DAYS;
3520 /* recover other leap-year adjustment */
3529 ptm->tm_year = year - 1900;
3531 ptm->tm_mday = yearday;
3532 ptm->tm_mon = month;
3536 ptm->tm_mon = month - 1;
3538 /* re-build yearday based on Jan 1 to get tm_yday */
3540 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3541 yearday += 14*MONTH_TO_DAYS + 1;
3542 ptm->tm_yday = jday - yearday;
3543 /* fix tm_wday if not overridden by caller */
3544 if ((unsigned)ptm->tm_wday > 6)
3545 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3549 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)
3557 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3560 mytm.tm_hour = hour;
3561 mytm.tm_mday = mday;
3563 mytm.tm_year = year;
3564 mytm.tm_wday = wday;
3565 mytm.tm_yday = yday;
3566 mytm.tm_isdst = isdst;
3568 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3569 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3574 #ifdef HAS_TM_TM_GMTOFF
3575 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3577 #ifdef HAS_TM_TM_ZONE
3578 mytm.tm_zone = mytm2.tm_zone;
3583 New(0, buf, buflen, char);
3584 len = strftime(buf, buflen, fmt, &mytm);
3586 ** The following is needed to handle to the situation where
3587 ** tmpbuf overflows. Basically we want to allocate a buffer
3588 ** and try repeatedly. The reason why it is so complicated
3589 ** is that getting a return value of 0 from strftime can indicate
3590 ** one of the following:
3591 ** 1. buffer overflowed,
3592 ** 2. illegal conversion specifier, or
3593 ** 3. the format string specifies nothing to be returned(not
3594 ** an error). This could be because format is an empty string
3595 ** or it specifies %p that yields an empty string in some locale.
3596 ** If there is a better way to make it portable, go ahead by
3599 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3602 /* Possibly buf overflowed - try again with a bigger buf */
3603 const int fmtlen = strlen(fmt);
3604 const int bufsize = fmtlen + buflen;
3606 New(0, buf, bufsize, char);
3608 buflen = strftime(buf, bufsize, fmt, &mytm);
3609 if (buflen > 0 && buflen < bufsize)
3611 /* heuristic to prevent out-of-memory errors */
3612 if (bufsize > 100*fmtlen) {
3617 Renew(buf, bufsize*2, char);
3622 Perl_croak(aTHX_ "panic: no strftime");
3628 #define SV_CWD_RETURN_UNDEF \
3629 sv_setsv(sv, &PL_sv_undef); \
3632 #define SV_CWD_ISDOT(dp) \
3633 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3634 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3637 =head1 Miscellaneous Functions
3639 =for apidoc getcwd_sv
3641 Fill the sv with current working directory
3646 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3647 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3648 * getcwd(3) if available
3649 * Comments from the orignal:
3650 * This is a faster version of getcwd. It's also more dangerous
3651 * because you might chdir out of a directory that you can't chdir
3655 Perl_getcwd_sv(pTHX_ register SV *sv)
3659 #ifndef INCOMPLETE_TAINTS
3665 char buf[MAXPATHLEN];
3667 /* Some getcwd()s automatically allocate a buffer of the given
3668 * size from the heap if they are given a NULL buffer pointer.
3669 * The problem is that this behaviour is not portable. */
3670 if (getcwd(buf, sizeof(buf) - 1)) {
3671 sv_setpvn(sv, buf, strlen(buf));
3675 sv_setsv(sv, &PL_sv_undef);
3683 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3687 SvUPGRADE(sv, SVt_PV);
3689 if (PerlLIO_lstat(".", &statbuf) < 0) {
3690 SV_CWD_RETURN_UNDEF;
3693 orig_cdev = statbuf.st_dev;
3694 orig_cino = statbuf.st_ino;
3703 if (PerlDir_chdir("..") < 0) {
3704 SV_CWD_RETURN_UNDEF;
3706 if (PerlLIO_stat(".", &statbuf) < 0) {
3707 SV_CWD_RETURN_UNDEF;
3710 cdev = statbuf.st_dev;
3711 cino = statbuf.st_ino;
3713 if (odev == cdev && oino == cino) {
3716 if (!(dir = PerlDir_open("."))) {
3717 SV_CWD_RETURN_UNDEF;
3720 while ((dp = PerlDir_read(dir)) != NULL) {
3722 const int namelen = dp->d_namlen;
3724 const int namelen = strlen(dp->d_name);
3727 if (SV_CWD_ISDOT(dp)) {
3731 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3732 SV_CWD_RETURN_UNDEF;
3735 tdev = statbuf.st_dev;
3736 tino = statbuf.st_ino;
3737 if (tino == oino && tdev == odev) {
3743 SV_CWD_RETURN_UNDEF;
3746 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3747 SV_CWD_RETURN_UNDEF;
3750 SvGROW(sv, pathlen + namelen + 1);
3754 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3757 /* prepend current directory to the front */
3759 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3760 pathlen += (namelen + 1);
3762 #ifdef VOID_CLOSEDIR
3765 if (PerlDir_close(dir) < 0) {
3766 SV_CWD_RETURN_UNDEF;
3772 SvCUR_set(sv, pathlen);
3776 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3777 SV_CWD_RETURN_UNDEF;
3780 if (PerlLIO_stat(".", &statbuf) < 0) {
3781 SV_CWD_RETURN_UNDEF;
3784 cdev = statbuf.st_dev;
3785 cino = statbuf.st_ino;
3787 if (cdev != orig_cdev || cino != orig_cino) {
3788 Perl_croak(aTHX_ "Unstable directory path, "
3789 "current directory changed unexpectedly");
3801 =for apidoc scan_version
3803 Returns a pointer to the next character after the parsed
3804 version string, as well as upgrading the passed in SV to
3807 Function must be called with an already existing SV like
3810 s = scan_version(s,SV *sv, bool qv);
3812 Performs some preprocessing to the string to ensure that
3813 it has the correct characteristics of a version. Flags the
3814 object if it contains an underscore (which denotes this
3815 is a alpha version). The boolean qv denotes that the version
3816 should be interpreted as if it had multiple decimals, even if
3823 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3825 const char *start = s;
3832 SV* hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3833 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3834 #ifndef NODEFAULT_SHAREKEYS
3835 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3839 s++; /* get past 'v' */
3840 qv = 1; /* force quoted version processing */
3845 /* pre-scan the input string to check for decimals/underbars */
3846 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3851 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3855 else if ( *pos == '_' )
3858 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3860 width = pos - last - 1; /* natural width of sub-version */
3865 if ( saw_period > 1 ) {
3866 qv = 1; /* force quoted version processing */
3872 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
3874 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
3876 if ( !qv && width < 3 )
3877 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3879 while (isDIGIT(*pos))
3881 if (!isALPHA(*pos)) {
3887 /* this is atoi() that delimits on underscores */
3888 const char *end = pos;
3892 /* the following if() will only be true after the decimal
3893 * point of a version originally created with a bare
3894 * floating point number, i.e. not quoted in any way
3896 if ( !qv && s > start+1 && saw_period == 1 ) {
3900 rev += (*s - '0') * mult;
3902 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3903 Perl_croak(aTHX_ "Integer overflow in version");
3910 while (--end >= s) {
3912 rev += (*end - '0') * mult;
3914 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3915 Perl_croak(aTHX_ "Integer overflow in version");
3920 /* Append revision */
3921 av_push(av, newSViv(rev));
3922 if ( *pos == '.' && isDIGIT(pos[1]) )
3924 else if ( *pos == '_' && isDIGIT(pos[1]) )
3926 else if ( isDIGIT(*pos) )
3933 while ( isDIGIT(*pos) )
3938 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
3946 if ( qv ) { /* quoted versions always get at least three terms*/
3947 I32 len = av_len(av);
3948 /* This for loop appears to trigger a compiler bug on OS X, as it
3949 loops infinitely. Yes, len is negative. No, it makes no sense.
3950 Compiler in question is:
3951 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3952 for ( len = 2 - len; len > 0; len-- )
3953 av_push((AV *)sv, newSViv(0));
3957 av_push(av, newSViv(0));
3960 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
3961 av_push(av, newSViv(0));
3963 /* And finally, store the AV in the hash */
3964 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
3969 =for apidoc new_version
3971 Returns a new version object based on the passed in SV:
3973 SV *sv = new_version(SV *ver);
3975 Does not alter the passed in ver SV. See "upg_version" if you
3976 want to upgrade the SV.
3982 Perl_new_version(pTHX_ SV *ver)
3985 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3988 AV * const av = newAV();
3990 /* This will get reblessed later if a derived class*/
3991 SV* const hv = newSVrv(rv, "version");
3992 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3993 #ifndef NODEFAULT_SHAREKEYS
3994 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4000 /* Begin copying all of the elements */
4001 if ( hv_exists((HV *)ver, "qv", 2) )
4002 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4004 if ( hv_exists((HV *)ver, "alpha", 5) )
4005 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4007 if ( hv_exists((HV*)ver, "width", 5 ) )
4009 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4010 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4013 sav = (AV *)*hv_fetch((HV*)ver, "version", 7, FALSE);
4014 /* This will get reblessed later if a derived class*/
4015 for ( key = 0; key <= av_len(sav); key++ )
4017 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4018 av_push(av, newSViv(rev));
4021 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
4025 if ( SvVOK(ver) ) { /* already a v-string */
4027 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4028 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4029 sv_setpv(rv,version);
4034 sv_setsv(rv,ver); /* make a duplicate */
4043 =for apidoc upg_version
4045 In-place upgrade of the supplied SV to a version object.
4047 SV *sv = upg_version(SV *sv);
4049 Returns a pointer to the upgraded SV.
4055 Perl_upg_version(pTHX_ SV *ver)
4060 if ( SvNOK(ver) ) /* may get too much accuracy */
4063 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4064 version = savepv(tbuf);
4067 else if ( SvVOK(ver) ) { /* already a v-string */
4068 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4069 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4073 else /* must be a string or something like a string */
4075 version = savepv(SvPV_nolen(ver));
4077 (void)scan_version(version, ver, qv);
4086 Accepts a version object and returns the normalized floating
4087 point representation. Call like:
4091 NOTE: you can pass either the object directly or the SV
4092 contained within the RV.
4098 Perl_vnumify(pTHX_ SV *vs)
4103 SV * const sv = newSV(0);
4108 /* see if various flags exist */
4109 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4111 if ( hv_exists((HV*)vs, "width", 5 ) )
4112 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4117 /* attempt to retrieve the version array */
4118 if ( !(av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE) ) ) {
4119 sv_catpvn(sv,"0",1);
4126 sv_catpvn(sv,"0",1);
4130 digit = SvIV(*av_fetch(av, 0, 0));
4131 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4132 for ( i = 1 ; i < len ; i++ )
4134 digit = SvIV(*av_fetch(av, i, 0));
4136 const int denom = (int)pow(10,(3-width));
4137 const div_t term = div((int)PERL_ABS(digit),denom);
4138 Perl_sv_catpvf(aTHX_ sv,"%0*d_%d", width, term.quot, term.rem);
4141 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4147 digit = SvIV(*av_fetch(av, len, 0));
4148 if ( alpha && width == 3 ) /* alpha version */
4149 Perl_sv_catpv(aTHX_ sv,"_");
4150 /* Don't display additional trailing zeros */
4152 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4156 sv_catpvn(sv,"000",3);
4164 Accepts a version object and returns the normalized string
4165 representation. Call like:
4169 NOTE: you can pass either the object directly or the SV
4170 contained within the RV.
4176 Perl_vnormal(pTHX_ SV *vs)
4185 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4187 av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE);
4194 digit = SvIV(*av_fetch(av, 0, 0));
4195 Perl_sv_setpvf(aTHX_ sv,"v%"IVdf,(IV)digit);
4196 for ( i = 1 ; i <= len-1 ; i++ ) {
4197 digit = SvIV(*av_fetch(av, i, 0));
4198 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4202 /* handle last digit specially */
4203 digit = SvIV(*av_fetch(av, len, 0));
4205 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4207 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4210 if ( len <= 2 ) { /* short version, must be at least three */
4211 for ( len = 2 - len; len != 0; len-- )
4212 sv_catpvn(sv,".0",2);
4219 =for apidoc vstringify
4221 In order to maintain maximum compatibility with earlier versions
4222 of Perl, this function will return either the floating point
4223 notation or the multiple dotted notation, depending on whether
4224 the original version contained 1 or more dots, respectively
4230 Perl_vstringify(pTHX_ SV *vs)
4236 if ( hv_exists((HV *)vs, "qv", 2) )
4248 Version object aware cmp. Both operands must already have been
4249 converted into version objects.
4255 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4258 bool lalpha = FALSE;
4259 bool ralpha = FALSE;
4268 /* get the left hand term */
4269 lav = (AV *)*hv_fetch((HV*)lhv, "version", 7, FALSE);
4270 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4273 /* and the right hand term */
4274 rav = (AV *)*hv_fetch((HV*)rhv, "version", 7, FALSE);
4275 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4283 while ( i <= m && retval == 0 )
4285 left = SvIV(*av_fetch(lav,i,0));
4286 right = SvIV(*av_fetch(rav,i,0));
4294 /* tiebreaker for alpha with identical terms */
4295 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4297 if ( lalpha && !ralpha )
4301 else if ( ralpha && !lalpha)
4307 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4311 while ( i <= r && retval == 0 )
4313 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4314 retval = -1; /* not a match after all */
4320 while ( i <= l && retval == 0 )
4322 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4323 retval = +1; /* not a match after all */
4331 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4332 # define EMULATE_SOCKETPAIR_UDP
4335 #ifdef EMULATE_SOCKETPAIR_UDP
4337 S_socketpair_udp (int fd[2]) {
4339 /* Fake a datagram socketpair using UDP to localhost. */
4340 int sockets[2] = {-1, -1};
4341 struct sockaddr_in addresses[2];
4343 Sock_size_t size = sizeof(struct sockaddr_in);
4344 unsigned short port;
4347 memset(&addresses, 0, sizeof(addresses));
4350 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4351 if (sockets[i] == -1)
4352 goto tidy_up_and_fail;
4354 addresses[i].sin_family = AF_INET;
4355 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4356 addresses[i].sin_port = 0; /* kernel choses port. */
4357 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4358 sizeof(struct sockaddr_in)) == -1)
4359 goto tidy_up_and_fail;
4362 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4363 for each connect the other socket to it. */
4366 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4368 goto tidy_up_and_fail;
4369 if (size != sizeof(struct sockaddr_in))
4370 goto abort_tidy_up_and_fail;
4371 /* !1 is 0, !0 is 1 */
4372 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4373 sizeof(struct sockaddr_in)) == -1)
4374 goto tidy_up_and_fail;
4377 /* Now we have 2 sockets connected to each other. I don't trust some other
4378 process not to have already sent a packet to us (by random) so send
4379 a packet from each to the other. */
4382 /* I'm going to send my own port number. As a short.
4383 (Who knows if someone somewhere has sin_port as a bitfield and needs
4384 this routine. (I'm assuming crays have socketpair)) */
4385 port = addresses[i].sin_port;
4386 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4387 if (got != sizeof(port)) {
4389 goto tidy_up_and_fail;
4390 goto abort_tidy_up_and_fail;
4394 /* Packets sent. I don't trust them to have arrived though.
4395 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4396 connect to localhost will use a second kernel thread. In 2.6 the
4397 first thread running the connect() returns before the second completes,
4398 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4399 returns 0. Poor programs have tripped up. One poor program's authors'
4400 had a 50-1 reverse stock split. Not sure how connected these were.)
4401 So I don't trust someone not to have an unpredictable UDP stack.
4405 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4406 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4410 FD_SET(sockets[0], &rset);
4411 FD_SET(sockets[1], &rset);
4413 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4414 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4415 || !FD_ISSET(sockets[1], &rset)) {
4416 /* I hope this is portable and appropriate. */
4418 goto tidy_up_and_fail;
4419 goto abort_tidy_up_and_fail;
4423 /* And the paranoia department even now doesn't trust it to have arrive
4424 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4426 struct sockaddr_in readfrom;
4427 unsigned short buffer[2];
4432 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4433 sizeof(buffer), MSG_DONTWAIT,
4434 (struct sockaddr *) &readfrom, &size);
4436 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4438 (struct sockaddr *) &readfrom, &size);
4442 goto tidy_up_and_fail;
4443 if (got != sizeof(port)
4444 || size != sizeof(struct sockaddr_in)
4445 /* Check other socket sent us its port. */
4446 || buffer[0] != (unsigned short) addresses[!i].sin_port
4447 /* Check kernel says we got the datagram from that socket */
4448 || readfrom.sin_family != addresses[!i].sin_family
4449 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4450 || readfrom.sin_port != addresses[!i].sin_port)
4451 goto abort_tidy_up_and_fail;
4454 /* My caller (my_socketpair) has validated that this is non-NULL */
4457 /* I hereby declare this connection open. May God bless all who cross
4461 abort_tidy_up_and_fail:
4462 errno = ECONNABORTED;
4465 const int save_errno = errno;
4466 if (sockets[0] != -1)
4467 PerlLIO_close(sockets[0]);
4468 if (sockets[1] != -1)
4469 PerlLIO_close(sockets[1]);
4474 #endif /* EMULATE_SOCKETPAIR_UDP */
4476 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4478 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4479 /* Stevens says that family must be AF_LOCAL, protocol 0.
4480 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4485 struct sockaddr_in listen_addr;
4486 struct sockaddr_in connect_addr;
4491 || family != AF_UNIX
4494 errno = EAFNOSUPPORT;
4502 #ifdef EMULATE_SOCKETPAIR_UDP
4503 if (type == SOCK_DGRAM)
4504 return S_socketpair_udp(fd);
4507 listener = PerlSock_socket(AF_INET, type, 0);
4510 memset(&listen_addr, 0, sizeof(listen_addr));
4511 listen_addr.sin_family = AF_INET;
4512 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4513 listen_addr.sin_port = 0; /* kernel choses port. */
4514 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4515 sizeof(listen_addr)) == -1)
4516 goto tidy_up_and_fail;
4517 if (PerlSock_listen(listener, 1) == -1)
4518 goto tidy_up_and_fail;
4520 connector = PerlSock_socket(AF_INET, type, 0);
4521 if (connector == -1)
4522 goto tidy_up_and_fail;
4523 /* We want to find out the port number to connect to. */
4524 size = sizeof(connect_addr);
4525 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4527 goto tidy_up_and_fail;
4528 if (size != sizeof(connect_addr))
4529 goto abort_tidy_up_and_fail;
4530 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4531 sizeof(connect_addr)) == -1)
4532 goto tidy_up_and_fail;
4534 size = sizeof(listen_addr);
4535 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4538 goto tidy_up_and_fail;
4539 if (size != sizeof(listen_addr))
4540 goto abort_tidy_up_and_fail;
4541 PerlLIO_close(listener);
4542 /* Now check we are talking to ourself by matching port and host on the
4544 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4546 goto tidy_up_and_fail;
4547 if (size != sizeof(connect_addr)
4548 || listen_addr.sin_family != connect_addr.sin_family
4549 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4550 || listen_addr.sin_port != connect_addr.sin_port) {
4551 goto abort_tidy_up_and_fail;
4557 abort_tidy_up_and_fail:
4559 errno = ECONNABORTED; /* This would be the standard thing to do. */
4561 # ifdef ECONNREFUSED
4562 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4564 errno = ETIMEDOUT; /* Desperation time. */
4569 int save_errno = errno;
4571 PerlLIO_close(listener);
4572 if (connector != -1)
4573 PerlLIO_close(connector);
4575 PerlLIO_close(acceptor);
4581 /* In any case have a stub so that there's code corresponding
4582 * to the my_socketpair in global.sym. */
4584 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4585 #ifdef HAS_SOCKETPAIR
4586 return socketpair(family, type, protocol, fd);
4595 =for apidoc sv_nosharing
4597 Dummy routine which "shares" an SV when there is no sharing module present.
4598 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4599 some level of strict-ness.
4605 Perl_sv_nosharing(pTHX_ SV *sv)
4607 PERL_UNUSED_ARG(sv);
4611 =for apidoc sv_nolocking
4613 Dummy routine which "locks" an SV when there is no locking module present.
4614 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4615 some level of strict-ness.
4621 Perl_sv_nolocking(pTHX_ SV *sv)
4623 PERL_UNUSED_ARG(sv);
4628 =for apidoc sv_nounlocking
4630 Dummy routine which "unlocks" an SV when there is no locking module present.
4631 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4632 some level of strict-ness.
4638 Perl_sv_nounlocking(pTHX_ SV *sv)
4640 PERL_UNUSED_ARG(sv);
4644 Perl_parse_unicode_opts(pTHX_ const char **popt)
4646 const char *p = *popt;
4651 opt = (U32) atoi(p);
4652 while (isDIGIT(*p)) p++;
4653 if (*p && *p != '\n' && *p != '\r')
4654 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4659 case PERL_UNICODE_STDIN:
4660 opt |= PERL_UNICODE_STDIN_FLAG; break;
4661 case PERL_UNICODE_STDOUT:
4662 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4663 case PERL_UNICODE_STDERR:
4664 opt |= PERL_UNICODE_STDERR_FLAG; break;
4665 case PERL_UNICODE_STD:
4666 opt |= PERL_UNICODE_STD_FLAG; break;
4667 case PERL_UNICODE_IN:
4668 opt |= PERL_UNICODE_IN_FLAG; break;
4669 case PERL_UNICODE_OUT:
4670 opt |= PERL_UNICODE_OUT_FLAG; break;
4671 case PERL_UNICODE_INOUT:
4672 opt |= PERL_UNICODE_INOUT_FLAG; break;
4673 case PERL_UNICODE_LOCALE:
4674 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4675 case PERL_UNICODE_ARGV:
4676 opt |= PERL_UNICODE_ARGV_FLAG; break;
4678 if (*p != '\n' && *p != '\r')
4680 "Unknown Unicode option letter '%c'", *p);
4686 opt = PERL_UNICODE_DEFAULT_FLAGS;
4688 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4689 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4690 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4701 * This is really just a quick hack which grabs various garbage
4702 * values. It really should be a real hash algorithm which
4703 * spreads the effect of every input bit onto every output bit,
4704 * if someone who knows about such things would bother to write it.
4705 * Might be a good idea to add that function to CORE as well.
4706 * No numbers below come from careful analysis or anything here,
4707 * except they are primes and SEED_C1 > 1E6 to get a full-width
4708 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4709 * probably be bigger too.
4712 # define SEED_C1 1000003
4713 #define SEED_C4 73819
4715 # define SEED_C1 25747
4716 #define SEED_C4 20639
4720 #define SEED_C5 26107
4722 #ifndef PERL_NO_DEV_RANDOM
4727 # include <starlet.h>
4728 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4729 * in 100-ns units, typically incremented ever 10 ms. */
4730 unsigned int when[2];
4732 # ifdef HAS_GETTIMEOFDAY
4733 struct timeval when;
4739 /* This test is an escape hatch, this symbol isn't set by Configure. */
4740 #ifndef PERL_NO_DEV_RANDOM
4741 #ifndef PERL_RANDOM_DEVICE
4742 /* /dev/random isn't used by default because reads from it will block
4743 * if there isn't enough entropy available. You can compile with
4744 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4745 * is enough real entropy to fill the seed. */
4746 # define PERL_RANDOM_DEVICE "/dev/urandom"
4748 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4750 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4759 _ckvmssts(sys$gettim(when));
4760 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4762 # ifdef HAS_GETTIMEOFDAY
4763 PerlProc_gettimeofday(&when,NULL);
4764 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4767 u = (U32)SEED_C1 * when;
4770 u += SEED_C3 * (U32)PerlProc_getpid();
4771 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4772 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4773 u += SEED_C5 * (U32)PTR2UV(&when);
4779 Perl_get_hash_seed(pTHX)
4781 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4785 while (isSPACE(*s)) s++;
4786 if (s && isDIGIT(*s))
4787 myseed = (UV)Atoul(s);
4789 #ifdef USE_HASH_SEED_EXPLICIT
4793 /* Compute a random seed */
4794 (void)seedDrand01((Rand_seed_t)seed());
4795 myseed = (UV)(Drand01() * (NV)UV_MAX);
4796 #if RANDBITS < (UVSIZE * 8)
4797 /* Since there are not enough randbits to to reach all
4798 * the bits of a UV, the low bits might need extra
4799 * help. Sum in another random number that will
4800 * fill in the low bits. */
4802 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4803 #endif /* RANDBITS < (UVSIZE * 8) */
4804 if (myseed == 0) { /* Superparanoia. */
4805 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4807 Perl_croak(aTHX_ "Your random numbers are not that random");
4810 PL_rehash_seed_set = TRUE;
4817 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4819 const char * const stashpv = CopSTASHPV(c);
4820 const char * const name = HvNAME_get(hv);
4822 if (stashpv == name)
4824 if (stashpv && name)
4825 if (strEQ(stashpv, name))
4832 #ifdef PERL_GLOBAL_STRUCT
4835 Perl_init_global_struct(pTHX)
4837 struct perl_vars *plvarsp = NULL;
4838 #ifdef PERL_GLOBAL_STRUCT
4839 # define PERL_GLOBAL_STRUCT_INIT
4840 # include "opcode.h" /* the ppaddr and check */
4841 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4842 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4843 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4844 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4845 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4849 plvarsp = PL_VarsPtr;
4850 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4856 # define PERLVAR(var,type) /**/
4857 # define PERLVARA(var,n,type) /**/
4858 # define PERLVARI(var,type,init) plvarsp->var = init;
4859 # define PERLVARIC(var,type,init) plvarsp->var = init;
4860 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4861 # include "perlvars.h"
4867 # ifdef PERL_GLOBAL_STRUCT
4868 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4869 if (!plvarsp->Gppaddr)
4871 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4872 if (!plvarsp->Gcheck)
4874 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4875 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4877 # ifdef PERL_SET_VARS
4878 PERL_SET_VARS(plvarsp);
4880 # undef PERL_GLOBAL_STRUCT_INIT
4885 #endif /* PERL_GLOBAL_STRUCT */
4887 #ifdef PERL_GLOBAL_STRUCT
4890 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4892 #ifdef PERL_GLOBAL_STRUCT
4893 # ifdef PERL_UNSET_VARS
4894 PERL_UNSET_VARS(plvarsp);
4896 free(plvarsp->Gppaddr);
4897 free(plvarsp->Gcheck);
4898 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4904 #endif /* PERL_GLOBAL_STRUCT */
4908 * c-indentation-style: bsd
4910 * indent-tabs-mode: t
4913 * ex: set ts=8 sts=4 sw=4 noet: