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++));
160 /* safe version of system's calloc() */
163 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
169 if (size * count > 0xffff) {
170 PerlIO_printf(Perl_error_log,
171 "Allocation too large: %lx\n", size * count) FLUSH;
174 #endif /* HAS_64K_LIMIT */
176 if ((long)size < 0 || (long)count < 0)
177 Perl_croak_nocontext("panic: calloc");
180 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
181 PERL_ALLOC_CHECK(ptr);
182 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));
184 memset((void*)ptr, 0, size);
190 /* Can't use PerlIO to write as it allocates memory */
191 PerlLIO_write(PerlIO_fileno(Perl_error_log),
192 PL_no_mem, strlen(PL_no_mem));
199 /* These must be defined when not using Perl's malloc for binary
204 Malloc_t Perl_malloc (MEM_SIZE nbytes)
207 return (Malloc_t)PerlMem_malloc(nbytes);
210 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
213 return (Malloc_t)PerlMem_calloc(elements, size);
216 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
219 return (Malloc_t)PerlMem_realloc(where, nbytes);
222 Free_t Perl_mfree (Malloc_t where)
230 /* copy a string up to some (non-backslashed) delimiter, if any */
233 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
236 for (tolen = 0; from < fromend; from++, tolen++) {
238 if (from[1] == delim)
247 else if (*from == delim)
258 /* return ptr to little string in big string, NULL if not found */
259 /* This routine was donated by Corey Satten. */
262 Perl_instr(pTHX_ register const char *big, register const char *little)
272 register const char *s, *x;
275 for (x=big,s=little; *s; /**/ ) {
284 return (char*)(big-1);
289 /* same as instr but allow embedded nulls */
292 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
294 register const I32 first = *little;
295 register const char *littleend = lend;
297 if (!first && little >= littleend)
299 if (bigend - big < littleend - little)
301 bigend -= littleend - little++;
302 while (big <= bigend) {
303 register const char *s, *x;
306 for (x=big,s=little; s < littleend; /**/ ) {
313 return (char*)(big-1);
318 /* reverse of the above--find last substring */
321 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
323 register const char *bigbeg;
324 register const I32 first = *little;
325 register const char *littleend = lend;
327 if (!first && little >= littleend)
328 return (char*)bigend;
330 big = bigend - (littleend - little++);
331 while (big >= bigbeg) {
332 register const char *s, *x;
335 for (x=big+2,s=little; s < littleend; /**/ ) {
342 return (char*)(big+1);
347 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
349 /* As a space optimization, we do not compile tables for strings of length
350 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
351 special-cased in fbm_instr().
353 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
356 =head1 Miscellaneous Functions
358 =for apidoc fbm_compile
360 Analyses the string in order to make fast searches on it using fbm_instr()
361 -- the Boyer-Moore algorithm.
367 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
369 const register U8 *s;
376 if (flags & FBMcf_TAIL) {
377 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
378 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
379 if (mg && mg->mg_len >= 0)
382 s = (U8*)SvPV_force_mutable(sv, len);
383 SvUPGRADE(sv, SVt_PVBM);
384 if (len == 0) /* TAIL might be on a zero-length string. */
387 const unsigned char *sb;
388 const U8 mlen = (len>255) ? 255 : (U8)len;
390 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
391 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
392 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
393 memset((void*)table, mlen, 256);
394 table[-1] = (U8)flags;
396 sb = s - mlen + 1; /* first char (maybe) */
398 if (table[*s] == mlen)
403 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
406 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
407 for (i = 0; i < len; i++) {
408 if (PL_freq[s[i]] < frequency) {
410 frequency = PL_freq[s[i]];
413 BmRARE(sv) = s[rarest];
414 BmPREVIOUS(sv) = (U16)rarest;
415 BmUSEFUL(sv) = 100; /* Initial value */
416 if (flags & FBMcf_TAIL)
418 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
419 BmRARE(sv),BmPREVIOUS(sv)));
422 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
423 /* If SvTAIL is actually due to \Z or \z, this gives false positives
427 =for apidoc fbm_instr
429 Returns the location of the SV in the string delimited by C<str> and
430 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
431 does not have to be fbm_compiled, but the search will not be as fast
438 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
440 register unsigned char *s;
442 register const unsigned char *little
443 = (const unsigned char *)SvPV_const(littlestr,l);
444 register STRLEN littlelen = l;
445 register const I32 multiline = flags & FBMrf_MULTILINE;
447 if ((STRLEN)(bigend - big) < littlelen) {
448 if ( SvTAIL(littlestr)
449 && ((STRLEN)(bigend - big) == littlelen - 1)
451 || (*big == *little &&
452 memEQ((char *)big, (char *)little, littlelen - 1))))
457 if (littlelen <= 2) { /* Special-cased */
459 if (littlelen == 1) {
460 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
461 /* Know that bigend != big. */
462 if (bigend[-1] == '\n')
463 return (char *)(bigend - 1);
464 return (char *) bigend;
472 if (SvTAIL(littlestr))
473 return (char *) bigend;
477 return (char*)big; /* Cannot be SvTAIL! */
480 if (SvTAIL(littlestr) && !multiline) {
481 if (bigend[-1] == '\n' && bigend[-2] == *little)
482 return (char*)bigend - 2;
483 if (bigend[-1] == *little)
484 return (char*)bigend - 1;
488 /* This should be better than FBM if c1 == c2, and almost
489 as good otherwise: maybe better since we do less indirection.
490 And we save a lot of memory by caching no table. */
491 const unsigned char c1 = little[0];
492 const unsigned char c2 = little[1];
497 while (s <= bigend) {
507 goto check_1char_anchor;
518 goto check_1char_anchor;
521 while (s <= bigend) {
526 goto check_1char_anchor;
535 check_1char_anchor: /* One char and anchor! */
536 if (SvTAIL(littlestr) && (*bigend == *little))
537 return (char *)bigend; /* bigend is already decremented. */
540 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
541 s = bigend - littlelen;
542 if (s >= big && bigend[-1] == '\n' && *s == *little
543 /* Automatically of length > 2 */
544 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
546 return (char*)s; /* how sweet it is */
549 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
551 return (char*)s + 1; /* how sweet it is */
555 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
556 char *b = ninstr((char*)big,(char*)bigend,
557 (char*)little, (char*)little + littlelen);
559 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
560 /* Chop \n from littlestr: */
561 s = bigend - littlelen + 1;
563 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
572 { /* Do actual FBM. */
573 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
574 const register unsigned char *oldlittle;
576 if (littlelen > (STRLEN)(bigend - big))
578 --littlelen; /* Last char found by table lookup */
581 little += littlelen; /* last char */
588 if ((tmp = table[*s])) {
589 if ((s += tmp) < bigend)
593 else { /* less expensive than calling strncmp() */
594 register unsigned char * const olds = s;
599 if (*--s == *--little)
601 s = olds + 1; /* here we pay the price for failure */
603 if (s < bigend) /* fake up continue to outer loop */
611 if ( s == bigend && (table[-1] & FBMcf_TAIL)
612 && memEQ((char *)(bigend - littlelen),
613 (char *)(oldlittle - littlelen), littlelen) )
614 return (char*)bigend - littlelen;
619 /* start_shift, end_shift are positive quantities which give offsets
620 of ends of some substring of bigstr.
621 If "last" we want the last occurrence.
622 old_posp is the way of communication between consequent calls if
623 the next call needs to find the .
624 The initial *old_posp should be -1.
626 Note that we take into account SvTAIL, so one can get extra
627 optimizations if _ALL flag is set.
630 /* If SvTAIL is actually due to \Z or \z, this gives false positives
631 if PL_multiline. In fact if !PL_multiline the authoritative answer
632 is not supported yet. */
635 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
637 const register unsigned char *big;
639 register I32 previous;
641 const register unsigned char *little;
642 register I32 stop_pos;
643 const register unsigned char *littleend;
647 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
648 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
650 if ( BmRARE(littlestr) == '\n'
651 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
652 little = (const unsigned char *)(SvPVX_const(littlestr));
653 littleend = little + SvCUR(littlestr);
660 little = (const unsigned char *)(SvPVX_const(littlestr));
661 littleend = little + SvCUR(littlestr);
663 /* The value of pos we can start at: */
664 previous = BmPREVIOUS(littlestr);
665 big = (const unsigned char *)(SvPVX_const(bigstr));
666 /* The value of pos we can stop at: */
667 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
668 if (previous + start_shift > stop_pos) {
670 stop_pos does not include SvTAIL in the count, so this check is incorrect
671 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
674 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
679 while (pos < previous + start_shift) {
680 if (!(pos += PL_screamnext[pos]))
685 const register unsigned char *s, *x;
686 if (pos >= stop_pos) break;
687 if (big[pos] != first)
689 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
695 if (s == littleend) {
697 if (!last) return (char *)(big+pos);
700 } while ( pos += PL_screamnext[pos] );
702 return (char *)(big+(*old_posp));
704 if (!SvTAIL(littlestr) || (end_shift > 0))
706 /* Ignore the trailing "\n". This code is not microoptimized */
707 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
708 stop_pos = littleend - little; /* Actual littlestr len */
713 && ((stop_pos == 1) ||
714 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
720 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
722 register const U8 *a = (const U8 *)s1;
723 register const U8 *b = (const U8 *)s2;
725 if (*a != *b && *a != PL_fold[*b])
733 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
736 register const U8 *a = (const U8 *)s1;
737 register const U8 *b = (const U8 *)s2;
739 if (*a != *b && *a != PL_fold_locale[*b])
746 /* copy a string to a safe spot */
749 =head1 Memory Management
753 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
754 string which is a duplicate of C<pv>. The size of the string is
755 determined by C<strlen()>. The memory allocated for the new string can
756 be freed with the C<Safefree()> function.
762 Perl_savepv(pTHX_ const char *pv)
768 const STRLEN pvlen = strlen(pv)+1;
769 New(902,newaddr,pvlen,char);
770 return strcpy(newaddr,pv);
775 /* same thing but with a known length */
780 Perl's version of what C<strndup()> would be if it existed. Returns a
781 pointer to a newly allocated string which is a duplicate of the first
782 C<len> bytes from C<pv>. The memory allocated for the new string can be
783 freed with the C<Safefree()> function.
789 Perl_savepvn(pTHX_ const char *pv, register I32 len)
791 register char *newaddr;
793 New(903,newaddr,len+1,char);
794 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
796 /* might not be null terminated */
798 return (char *) CopyD(pv,newaddr,len,char);
801 return (char *) ZeroD(newaddr,len+1,char);
806 =for apidoc savesharedpv
808 A version of C<savepv()> which allocates the duplicate string in memory
809 which is shared between threads.
814 Perl_savesharedpv(pTHX_ const char *pv)
816 register char *newaddr;
820 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
822 PerlLIO_write(PerlIO_fileno(Perl_error_log),
823 PL_no_mem, strlen(PL_no_mem));
826 return strcpy(newaddr,pv);
832 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
833 the passed in SV using C<SvPV()>
839 Perl_savesvpv(pTHX_ SV *sv)
842 const char *pv = SvPV_const(sv, len);
843 register char *newaddr;
846 New(903,newaddr,len,char);
847 return (char *) CopyD(pv,newaddr,len,char);
851 /* the SV for Perl_form() and mess() is not kept in an arena */
860 return sv_2mortal(newSVpvn("",0));
865 /* Create as PVMG now, to avoid any upgrading later */
867 Newz(905, any, 1, XPVMG);
868 SvFLAGS(sv) = SVt_PVMG;
869 SvANY(sv) = (void*)any;
871 SvREFCNT(sv) = 1 << 30; /* practically infinite */
876 #if defined(PERL_IMPLICIT_CONTEXT)
878 Perl_form_nocontext(const char* pat, ...)
884 retval = vform(pat, &args);
888 #endif /* PERL_IMPLICIT_CONTEXT */
891 =head1 Miscellaneous Functions
894 Takes a sprintf-style format pattern and conventional
895 (non-SV) arguments and returns the formatted string.
897 (char *) Perl_form(pTHX_ const char* pat, ...)
899 can be used any place a string (char *) is required:
901 char * s = Perl_form("%d.%d",major,minor);
903 Uses a single private buffer so if you want to format several strings you
904 must explicitly copy the earlier strings away (and free the copies when you
911 Perl_form(pTHX_ const char* pat, ...)
916 retval = vform(pat, &args);
922 Perl_vform(pTHX_ const char *pat, va_list *args)
924 SV *sv = mess_alloc();
925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
929 #if defined(PERL_IMPLICIT_CONTEXT)
931 Perl_mess_nocontext(const char *pat, ...)
937 retval = vmess(pat, &args);
941 #endif /* PERL_IMPLICIT_CONTEXT */
944 Perl_mess(pTHX_ const char *pat, ...)
949 retval = vmess(pat, &args);
955 S_closest_cop(pTHX_ COP *cop, OP *o)
957 /* Look for PL_op starting from o. cop is the last COP we've seen. */
959 if (!o || o == PL_op) return cop;
961 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
967 /* If the OP_NEXTSTATE has been optimised away we can still use it
968 * the get the file and line number. */
970 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
973 /* Keep searching, and return when we've found something. */
975 new_cop = closest_cop(cop, kid);
976 if (new_cop) return new_cop;
986 Perl_vmess(pTHX_ const char *pat, va_list *args)
988 SV *sv = mess_alloc();
989 static const char dgd[] = " during global destruction.\n";
991 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
992 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
995 * Try and find the file and line for PL_op. This will usually be
996 * PL_curcop, but it might be a cop that has been optimised away. We
997 * can try to find such a cop by searching through the optree starting
998 * from the sibling of PL_curcop.
1001 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1002 if (!cop) cop = PL_curcop;
1005 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1006 OutCopFILE(cop), (IV)CopLINE(cop));
1007 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1008 const bool line_mode = (RsSIMPLE(PL_rs) &&
1009 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1010 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1011 PL_last_in_gv == PL_argvgv ?
1012 "" : GvNAME(PL_last_in_gv),
1013 line_mode ? "line" : "chunk",
1014 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1016 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1022 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1028 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1029 && (io = GvIO(PL_stderrgv))
1030 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1037 SAVESPTR(PL_stderrgv);
1038 PL_stderrgv = Nullgv;
1040 PUSHSTACKi(PERLSI_MAGIC);
1044 PUSHs(SvTIED_obj((SV*)io, mg));
1045 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1047 call_method("PRINT", G_SCALAR);
1055 /* SFIO can really mess with your errno */
1058 PerlIO *serr = Perl_error_log;
1060 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1061 (void)PerlIO_flush(serr);
1068 /* Common code used by vcroak, vdie and vwarner */
1071 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1076 /* sv_2cv might call Perl_croak() */
1077 SV *olddiehook = PL_diehook;
1081 SAVESPTR(PL_diehook);
1082 PL_diehook = Nullsv;
1083 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1085 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1092 msg = newSVpvn(message, msglen);
1093 SvFLAGS(msg) |= utf8;
1101 PUSHSTACKi(PERLSI_DIEHOOK);
1105 call_sv((SV*)cv, G_DISCARD);
1112 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1116 const char *message;
1119 SV *msv = vmess(pat, args);
1120 if (PL_errors && SvCUR(PL_errors)) {
1121 sv_catsv(PL_errors, msv);
1122 message = SvPV_const(PL_errors, *msglen);
1123 SvCUR_set(PL_errors, 0);
1126 message = SvPV_const(msv,*msglen);
1127 *utf8 = SvUTF8(msv);
1133 DEBUG_S(PerlIO_printf(Perl_debug_log,
1134 "%p: die/croak: message = %s\ndiehook = %p\n",
1135 thr, message, PL_diehook));
1137 S_vdie_common(aTHX_ message, *msglen, *utf8);
1143 Perl_vdie(pTHX_ const char* pat, va_list *args)
1145 const char *message;
1146 const int was_in_eval = PL_in_eval;
1150 DEBUG_S(PerlIO_printf(Perl_debug_log,
1151 "%p: die: curstack = %p, mainstack = %p\n",
1152 thr, PL_curstack, PL_mainstack));
1154 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1156 PL_restartop = die_where(message, msglen);
1157 SvFLAGS(ERRSV) |= utf8;
1158 DEBUG_S(PerlIO_printf(Perl_debug_log,
1159 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1160 thr, PL_restartop, was_in_eval, PL_top_env));
1161 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1163 return PL_restartop;
1166 #if defined(PERL_IMPLICIT_CONTEXT)
1168 Perl_die_nocontext(const char* pat, ...)
1173 va_start(args, pat);
1174 o = vdie(pat, &args);
1178 #endif /* PERL_IMPLICIT_CONTEXT */
1181 Perl_die(pTHX_ const char* pat, ...)
1185 va_start(args, pat);
1186 o = vdie(pat, &args);
1192 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1194 const char *message;
1198 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1201 PL_restartop = die_where(message, msglen);
1202 SvFLAGS(ERRSV) |= utf8;
1206 message = SvPVx_const(ERRSV, msglen);
1208 write_to_stderr(message, msglen);
1212 #if defined(PERL_IMPLICIT_CONTEXT)
1214 Perl_croak_nocontext(const char *pat, ...)
1218 va_start(args, pat);
1223 #endif /* PERL_IMPLICIT_CONTEXT */
1226 =head1 Warning and Dieing
1230 This is the XSUB-writer's interface to Perl's C<die> function.
1231 Normally call this function the same way you call the C C<printf>
1232 function. Calling C<croak> returns control directly to Perl,
1233 sidestepping the normal C order of execution. See C<warn>.
1235 If you want to throw an exception object, assign the object to
1236 C<$@> and then pass C<Nullch> to croak():
1238 errsv = get_sv("@", TRUE);
1239 sv_setsv(errsv, exception_object);
1246 Perl_croak(pTHX_ const char *pat, ...)
1249 va_start(args, pat);
1256 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1259 const char *message;
1267 msv = vmess(pat, args);
1269 message = SvPV_const(msv, msglen);
1272 /* sv_2cv might call Perl_warn() */
1273 SV *oldwarnhook = PL_warnhook;
1275 SAVESPTR(PL_warnhook);
1276 PL_warnhook = Nullsv;
1277 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1279 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1285 msg = newSVpvn(message, msglen);
1286 SvFLAGS(msg) |= utf8;
1290 PUSHSTACKi(PERLSI_WARNHOOK);
1294 call_sv((SV*)cv, G_DISCARD);
1301 write_to_stderr(message, msglen);
1304 #if defined(PERL_IMPLICIT_CONTEXT)
1306 Perl_warn_nocontext(const char *pat, ...)
1310 va_start(args, pat);
1314 #endif /* PERL_IMPLICIT_CONTEXT */
1319 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1320 function the same way you call the C C<printf> function. See C<croak>.
1326 Perl_warn(pTHX_ const char *pat, ...)
1329 va_start(args, pat);
1334 #if defined(PERL_IMPLICIT_CONTEXT)
1336 Perl_warner_nocontext(U32 err, const char *pat, ...)
1340 va_start(args, pat);
1341 vwarner(err, pat, &args);
1344 #endif /* PERL_IMPLICIT_CONTEXT */
1347 Perl_warner(pTHX_ U32 err, const char* pat,...)
1350 va_start(args, pat);
1351 vwarner(err, pat, &args);
1356 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1360 SV * const msv = vmess(pat, args);
1362 const char *message = SvPV_const(msv, msglen);
1363 const I32 utf8 = SvUTF8(msv);
1367 S_vdie_common(aTHX_ message, msglen, utf8);
1370 PL_restartop = die_where(message, msglen);
1371 SvFLAGS(ERRSV) |= utf8;
1374 write_to_stderr(message, msglen);
1378 Perl_vwarn(aTHX_ pat, args);
1382 /* since we've already done strlen() for both nam and val
1383 * we can use that info to make things faster than
1384 * sprintf(s, "%s=%s", nam, val)
1386 #define my_setenv_format(s, nam, nlen, val, vlen) \
1387 Copy(nam, s, nlen, char); \
1389 Copy(val, s+(nlen+1), vlen, char); \
1390 *(s+(nlen+1+vlen)) = '\0'
1392 #ifdef USE_ENVIRON_ARRAY
1393 /* VMS' my_setenv() is in vms.c */
1394 #if !defined(WIN32) && !defined(NETWARE)
1396 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1400 /* only parent thread can modify process environment */
1401 if (PL_curinterp == aTHX)
1404 #ifndef PERL_USE_SAFE_PUTENV
1405 if (!PL_use_safe_putenv) {
1406 /* most putenv()s leak, so we manipulate environ directly */
1407 register I32 i=setenv_getix(nam); /* where does it go? */
1410 if (environ == PL_origenviron) { /* need we copy environment? */
1416 for (max = i; environ[max]; max++) ;
1417 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1418 for (j=0; j<max; j++) { /* copy environment */
1419 const int len = strlen(environ[j]);
1420 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1421 Copy(environ[j], tmpenv[j], len+1, char);
1423 tmpenv[max] = Nullch;
1424 environ = tmpenv; /* tell exec where it is now */
1427 safesysfree(environ[i]);
1428 while (environ[i]) {
1429 environ[i] = environ[i+1];
1434 if (!environ[i]) { /* does not exist yet */
1435 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1436 environ[i+1] = Nullch; /* make sure it's null terminated */
1439 safesysfree(environ[i]);
1443 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1444 /* all that work just for this */
1445 my_setenv_format(environ[i], nam, nlen, val, vlen);
1448 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1449 setenv(nam, val, 1);
1452 int nlen = strlen(nam), vlen;
1457 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1458 /* all that work just for this */
1459 my_setenv_format(new_env, nam, nlen, val, vlen);
1460 (void)putenv(new_env);
1461 # endif /* __CYGWIN__ */
1462 #ifndef PERL_USE_SAFE_PUTENV
1468 #else /* WIN32 || NETWARE */
1471 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1474 register char *envstr;
1475 const int nlen = strlen(nam);
1482 New(904, envstr, nlen+vlen+2, char);
1483 my_setenv_format(envstr, nam, nlen, val, vlen);
1484 (void)PerlEnv_putenv(envstr);
1488 #endif /* WIN32 || NETWARE */
1492 Perl_setenv_getix(pTHX_ const char *nam)
1494 register I32 i, len = strlen(nam);
1496 for (i = 0; environ[i]; i++) {
1499 strnicmp(environ[i],nam,len) == 0
1501 strnEQ(environ[i],nam,len)
1503 && environ[i][len] == '=')
1504 break; /* strnEQ must come first to avoid */
1505 } /* potential SEGV's */
1508 #endif /* !PERL_MICRO */
1510 #endif /* !VMS && !EPOC*/
1512 #ifdef UNLINK_ALL_VERSIONS
1514 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1518 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1523 /* this is a drop-in replacement for bcopy() */
1524 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1526 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1530 if (from - to >= 0) {
1538 *(--to) = *(--from);
1544 /* this is a drop-in replacement for memset() */
1547 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1557 /* this is a drop-in replacement for bzero() */
1558 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1560 Perl_my_bzero(register char *loc, register I32 len)
1570 /* this is a drop-in replacement for memcmp() */
1571 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1573 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1575 register const U8 *a = (const U8 *)s1;
1576 register const U8 *b = (const U8 *)s2;
1580 if ((tmp = *a++ - *b++))
1585 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1589 #ifdef USE_CHAR_VSPRINTF
1594 vsprintf(char *dest, const char *pat, char *args)
1598 fakebuf._ptr = dest;
1599 fakebuf._cnt = 32767;
1603 fakebuf._flag = _IOWRT|_IOSTRG;
1604 _doprnt(pat, args, &fakebuf); /* what a kludge */
1605 (void)putc('\0', &fakebuf);
1606 #ifdef USE_CHAR_VSPRINTF
1609 return 0; /* perl doesn't use return value */
1613 #endif /* HAS_VPRINTF */
1616 #if BYTEORDER != 0x4321
1618 Perl_my_swap(pTHX_ short s)
1620 #if (BYTEORDER & 1) == 0
1623 result = ((s & 255) << 8) + ((s >> 8) & 255);
1631 Perl_my_htonl(pTHX_ long l)
1635 char c[sizeof(long)];
1638 #if BYTEORDER == 0x1234
1639 u.c[0] = (l >> 24) & 255;
1640 u.c[1] = (l >> 16) & 255;
1641 u.c[2] = (l >> 8) & 255;
1645 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1646 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1651 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1652 u.c[o & 0xf] = (l >> s) & 255;
1660 Perl_my_ntohl(pTHX_ long l)
1664 char c[sizeof(long)];
1667 #if BYTEORDER == 0x1234
1668 u.c[0] = (l >> 24) & 255;
1669 u.c[1] = (l >> 16) & 255;
1670 u.c[2] = (l >> 8) & 255;
1674 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1675 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1682 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1683 l |= (u.c[o & 0xf] & 255) << s;
1690 #endif /* BYTEORDER != 0x4321 */
1694 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1695 * If these functions are defined,
1696 * the BYTEORDER is neither 0x1234 nor 0x4321.
1697 * However, this is not assumed.
1701 #define HTOLE(name,type) \
1703 name (register type n) \
1707 char c[sizeof(type)]; \
1710 register I32 s = 0; \
1711 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1712 u.c[i] = (n >> s) & 0xFF; \
1717 #define LETOH(name,type) \
1719 name (register type n) \
1723 char c[sizeof(type)]; \
1726 register I32 s = 0; \
1729 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1730 n |= ((type)(u.c[i] & 0xFF)) << s; \
1736 * Big-endian byte order functions.
1739 #define HTOBE(name,type) \
1741 name (register type n) \
1745 char c[sizeof(type)]; \
1748 register I32 s = 8*(sizeof(u.c)-1); \
1749 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1750 u.c[i] = (n >> s) & 0xFF; \
1755 #define BETOH(name,type) \
1757 name (register type n) \
1761 char c[sizeof(type)]; \
1764 register I32 s = 8*(sizeof(u.c)-1); \
1767 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1768 n |= ((type)(u.c[i] & 0xFF)) << s; \
1774 * If we just can't do it...
1777 #define NOT_AVAIL(name,type) \
1779 name (register type n) \
1781 Perl_croak_nocontext(#name "() not available"); \
1782 return n; /* not reached */ \
1786 #if defined(HAS_HTOVS) && !defined(htovs)
1789 #if defined(HAS_HTOVL) && !defined(htovl)
1792 #if defined(HAS_VTOHS) && !defined(vtohs)
1795 #if defined(HAS_VTOHL) && !defined(vtohl)
1799 #ifdef PERL_NEED_MY_HTOLE16
1801 HTOLE(Perl_my_htole16,U16)
1803 NOT_AVAIL(Perl_my_htole16,U16)
1806 #ifdef PERL_NEED_MY_LETOH16
1808 LETOH(Perl_my_letoh16,U16)
1810 NOT_AVAIL(Perl_my_letoh16,U16)
1813 #ifdef PERL_NEED_MY_HTOBE16
1815 HTOBE(Perl_my_htobe16,U16)
1817 NOT_AVAIL(Perl_my_htobe16,U16)
1820 #ifdef PERL_NEED_MY_BETOH16
1822 BETOH(Perl_my_betoh16,U16)
1824 NOT_AVAIL(Perl_my_betoh16,U16)
1828 #ifdef PERL_NEED_MY_HTOLE32
1830 HTOLE(Perl_my_htole32,U32)
1832 NOT_AVAIL(Perl_my_htole32,U32)
1835 #ifdef PERL_NEED_MY_LETOH32
1837 LETOH(Perl_my_letoh32,U32)
1839 NOT_AVAIL(Perl_my_letoh32,U32)
1842 #ifdef PERL_NEED_MY_HTOBE32
1844 HTOBE(Perl_my_htobe32,U32)
1846 NOT_AVAIL(Perl_my_htobe32,U32)
1849 #ifdef PERL_NEED_MY_BETOH32
1851 BETOH(Perl_my_betoh32,U32)
1853 NOT_AVAIL(Perl_my_betoh32,U32)
1857 #ifdef PERL_NEED_MY_HTOLE64
1859 HTOLE(Perl_my_htole64,U64)
1861 NOT_AVAIL(Perl_my_htole64,U64)
1864 #ifdef PERL_NEED_MY_LETOH64
1866 LETOH(Perl_my_letoh64,U64)
1868 NOT_AVAIL(Perl_my_letoh64,U64)
1871 #ifdef PERL_NEED_MY_HTOBE64
1873 HTOBE(Perl_my_htobe64,U64)
1875 NOT_AVAIL(Perl_my_htobe64,U64)
1878 #ifdef PERL_NEED_MY_BETOH64
1880 BETOH(Perl_my_betoh64,U64)
1882 NOT_AVAIL(Perl_my_betoh64,U64)
1886 #ifdef PERL_NEED_MY_HTOLES
1887 HTOLE(Perl_my_htoles,short)
1889 #ifdef PERL_NEED_MY_LETOHS
1890 LETOH(Perl_my_letohs,short)
1892 #ifdef PERL_NEED_MY_HTOBES
1893 HTOBE(Perl_my_htobes,short)
1895 #ifdef PERL_NEED_MY_BETOHS
1896 BETOH(Perl_my_betohs,short)
1899 #ifdef PERL_NEED_MY_HTOLEI
1900 HTOLE(Perl_my_htolei,int)
1902 #ifdef PERL_NEED_MY_LETOHI
1903 LETOH(Perl_my_letohi,int)
1905 #ifdef PERL_NEED_MY_HTOBEI
1906 HTOBE(Perl_my_htobei,int)
1908 #ifdef PERL_NEED_MY_BETOHI
1909 BETOH(Perl_my_betohi,int)
1912 #ifdef PERL_NEED_MY_HTOLEL
1913 HTOLE(Perl_my_htolel,long)
1915 #ifdef PERL_NEED_MY_LETOHL
1916 LETOH(Perl_my_letohl,long)
1918 #ifdef PERL_NEED_MY_HTOBEL
1919 HTOBE(Perl_my_htobel,long)
1921 #ifdef PERL_NEED_MY_BETOHL
1922 BETOH(Perl_my_betohl,long)
1926 Perl_my_swabn(void *ptr, int n)
1928 register char *s = (char *)ptr;
1929 register char *e = s + (n-1);
1932 for (n /= 2; n > 0; s++, e--, n--) {
1940 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1942 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1944 register I32 This, that;
1950 PERL_FLUSHALL_FOR_CHILD;
1951 This = (*mode == 'w');
1955 taint_proper("Insecure %s%s", "EXEC");
1957 if (PerlProc_pipe(p) < 0)
1959 /* Try for another pipe pair for error return */
1960 if (PerlProc_pipe(pp) >= 0)
1962 while ((pid = PerlProc_fork()) < 0) {
1963 if (errno != EAGAIN) {
1964 PerlLIO_close(p[This]);
1965 PerlLIO_close(p[that]);
1967 PerlLIO_close(pp[0]);
1968 PerlLIO_close(pp[1]);
1980 /* Close parent's end of error status pipe (if any) */
1982 PerlLIO_close(pp[0]);
1983 #if defined(HAS_FCNTL) && defined(F_SETFD)
1984 /* Close error pipe automatically if exec works */
1985 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1988 /* Now dup our end of _the_ pipe to right position */
1989 if (p[THIS] != (*mode == 'r')) {
1990 PerlLIO_dup2(p[THIS], *mode == 'r');
1991 PerlLIO_close(p[THIS]);
1992 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1993 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1996 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1997 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1998 /* No automatic close - do it by hand */
2005 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2011 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2017 do_execfree(); /* free any memory malloced by child on fork */
2019 PerlLIO_close(pp[1]);
2020 /* Keep the lower of the two fd numbers */
2021 if (p[that] < p[This]) {
2022 PerlLIO_dup2(p[This], p[that]);
2023 PerlLIO_close(p[This]);
2027 PerlLIO_close(p[that]); /* close child's end of pipe */
2030 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2032 SvUPGRADE(sv,SVt_IV);
2034 PL_forkprocess = pid;
2035 /* If we managed to get status pipe check for exec fail */
2036 if (did_pipes && pid > 0) {
2040 while (n < sizeof(int)) {
2041 n1 = PerlLIO_read(pp[0],
2042 (void*)(((char*)&errkid)+n),
2048 PerlLIO_close(pp[0]);
2050 if (n) { /* Error */
2052 PerlLIO_close(p[This]);
2053 if (n != sizeof(int))
2054 Perl_croak(aTHX_ "panic: kid popen errno read");
2056 pid2 = wait4pid(pid, &status, 0);
2057 } while (pid2 == -1 && errno == EINTR);
2058 errno = errkid; /* Propagate errno from kid */
2063 PerlLIO_close(pp[0]);
2064 return PerlIO_fdopen(p[This], mode);
2066 Perl_croak(aTHX_ "List form of piped open not implemented");
2067 return (PerlIO *) NULL;
2071 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2072 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2074 Perl_my_popen(pTHX_ char *cmd, char *mode)
2077 register I32 This, that;
2080 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2084 PERL_FLUSHALL_FOR_CHILD;
2087 return my_syspopen(aTHX_ cmd,mode);
2090 This = (*mode == 'w');
2092 if (doexec && PL_tainting) {
2094 taint_proper("Insecure %s%s", "EXEC");
2096 if (PerlProc_pipe(p) < 0)
2098 if (doexec && PerlProc_pipe(pp) >= 0)
2100 while ((pid = PerlProc_fork()) < 0) {
2101 if (errno != EAGAIN) {
2102 PerlLIO_close(p[This]);
2103 PerlLIO_close(p[that]);
2105 PerlLIO_close(pp[0]);
2106 PerlLIO_close(pp[1]);
2109 Perl_croak(aTHX_ "Can't fork");
2122 PerlLIO_close(pp[0]);
2123 #if defined(HAS_FCNTL) && defined(F_SETFD)
2124 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2127 if (p[THIS] != (*mode == 'r')) {
2128 PerlLIO_dup2(p[THIS], *mode == 'r');
2129 PerlLIO_close(p[THIS]);
2130 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2131 PerlLIO_close(p[THAT]);
2134 PerlLIO_close(p[THAT]);
2137 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2144 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2149 /* may or may not use the shell */
2150 do_exec3(cmd, pp[1], did_pipes);
2153 #endif /* defined OS2 */
2155 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2156 SvREADONLY_off(GvSV(tmpgv));
2157 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2158 SvREADONLY_on(GvSV(tmpgv));
2160 #ifdef THREADS_HAVE_PIDS
2161 PL_ppid = (IV)getppid();
2164 hv_clear(PL_pidstatus); /* we have no children */
2169 do_execfree(); /* free any memory malloced by child on vfork */
2171 PerlLIO_close(pp[1]);
2172 if (p[that] < p[This]) {
2173 PerlLIO_dup2(p[This], p[that]);
2174 PerlLIO_close(p[This]);
2178 PerlLIO_close(p[that]);
2181 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2183 SvUPGRADE(sv,SVt_IV);
2185 PL_forkprocess = pid;
2186 if (did_pipes && pid > 0) {
2190 while (n < sizeof(int)) {
2191 n1 = PerlLIO_read(pp[0],
2192 (void*)(((char*)&errkid)+n),
2198 PerlLIO_close(pp[0]);
2200 if (n) { /* Error */
2202 PerlLIO_close(p[This]);
2203 if (n != sizeof(int))
2204 Perl_croak(aTHX_ "panic: kid popen errno read");
2206 pid2 = wait4pid(pid, &status, 0);
2207 } while (pid2 == -1 && errno == EINTR);
2208 errno = errkid; /* Propagate errno from kid */
2213 PerlLIO_close(pp[0]);
2214 return PerlIO_fdopen(p[This], mode);
2217 #if defined(atarist) || defined(EPOC)
2220 Perl_my_popen(pTHX_ char *cmd, char *mode)
2222 PERL_FLUSHALL_FOR_CHILD;
2223 /* Call system's popen() to get a FILE *, then import it.
2224 used 0 for 2nd parameter to PerlIO_importFILE;
2227 return PerlIO_importFILE(popen(cmd, mode), 0);
2231 FILE *djgpp_popen();
2233 Perl_my_popen(pTHX_ char *cmd, char *mode)
2235 PERL_FLUSHALL_FOR_CHILD;
2236 /* Call system's popen() to get a FILE *, then import it.
2237 used 0 for 2nd parameter to PerlIO_importFILE;
2240 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2245 #endif /* !DOSISH */
2247 /* this is called in parent before the fork() */
2249 Perl_atfork_lock(void)
2252 #if defined(USE_ITHREADS)
2253 /* locks must be held in locking order (if any) */
2255 MUTEX_LOCK(&PL_malloc_mutex);
2261 /* this is called in both parent and child after the fork() */
2263 Perl_atfork_unlock(void)
2266 #if defined(USE_ITHREADS)
2267 /* locks must be released in same order as in atfork_lock() */
2269 MUTEX_UNLOCK(&PL_malloc_mutex);
2278 #if defined(HAS_FORK)
2280 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2285 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2286 * handlers elsewhere in the code */
2291 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2292 Perl_croak_nocontext("fork() not available");
2294 #endif /* HAS_FORK */
2299 Perl_dump_fds(pTHX_ char *s)
2304 PerlIO_printf(Perl_debug_log,"%s", s);
2305 for (fd = 0; fd < 32; fd++) {
2306 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2307 PerlIO_printf(Perl_debug_log," %d",fd);
2309 PerlIO_printf(Perl_debug_log,"\n");
2312 #endif /* DUMP_FDS */
2316 dup2(int oldfd, int newfd)
2318 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2321 PerlLIO_close(newfd);
2322 return fcntl(oldfd, F_DUPFD, newfd);
2324 #define DUP2_MAX_FDS 256
2325 int fdtmp[DUP2_MAX_FDS];
2331 PerlLIO_close(newfd);
2332 /* good enough for low fd's... */
2333 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2334 if (fdx >= DUP2_MAX_FDS) {
2342 PerlLIO_close(fdtmp[--fdx]);
2349 #ifdef HAS_SIGACTION
2351 #ifdef MACOS_TRADITIONAL
2352 /* We don't want restart behavior on MacOS */
2357 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2360 struct sigaction act, oact;
2363 /* only "parent" interpreter can diddle signals */
2364 if (PL_curinterp != aTHX)
2368 act.sa_handler = handler;
2369 sigemptyset(&act.sa_mask);
2372 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2373 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2375 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2376 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2377 act.sa_flags |= SA_NOCLDWAIT;
2379 if (sigaction(signo, &act, &oact) == -1)
2382 return oact.sa_handler;
2386 Perl_rsignal_state(pTHX_ int signo)
2388 struct sigaction oact;
2390 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2393 return oact.sa_handler;
2397 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2400 struct sigaction act;
2403 /* only "parent" interpreter can diddle signals */
2404 if (PL_curinterp != aTHX)
2408 act.sa_handler = handler;
2409 sigemptyset(&act.sa_mask);
2412 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2413 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2415 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2416 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2417 act.sa_flags |= SA_NOCLDWAIT;
2419 return sigaction(signo, &act, save);
2423 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2427 /* only "parent" interpreter can diddle signals */
2428 if (PL_curinterp != aTHX)
2432 return sigaction(signo, save, (struct sigaction *)NULL);
2435 #else /* !HAS_SIGACTION */
2438 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2440 #if defined(USE_ITHREADS) && !defined(WIN32)
2441 /* only "parent" interpreter can diddle signals */
2442 if (PL_curinterp != aTHX)
2446 return PerlProc_signal(signo, handler);
2458 Perl_rsignal_state(pTHX_ int signo)
2461 Sighandler_t oldsig;
2463 #if defined(USE_ITHREADS) && !defined(WIN32)
2464 /* only "parent" interpreter can diddle signals */
2465 if (PL_curinterp != aTHX)
2470 oldsig = PerlProc_signal(signo, sig_trap);
2471 PerlProc_signal(signo, oldsig);
2473 PerlProc_kill(PerlProc_getpid(), signo);
2478 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2480 #if defined(USE_ITHREADS) && !defined(WIN32)
2481 /* only "parent" interpreter can diddle signals */
2482 if (PL_curinterp != aTHX)
2485 *save = PerlProc_signal(signo, handler);
2486 return (*save == SIG_ERR) ? -1 : 0;
2490 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2492 #if defined(USE_ITHREADS) && !defined(WIN32)
2493 /* only "parent" interpreter can diddle signals */
2494 if (PL_curinterp != aTHX)
2497 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2500 #endif /* !HAS_SIGACTION */
2501 #endif /* !PERL_MICRO */
2503 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2504 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2506 Perl_my_pclose(pTHX_ PerlIO *ptr)
2508 Sigsave_t hstat, istat, qstat;
2514 int saved_errno = 0;
2516 int saved_win32_errno;
2520 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2522 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2524 *svp = &PL_sv_undef;
2526 if (pid == -1) { /* Opened by popen. */
2527 return my_syspclose(ptr);
2530 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2531 saved_errno = errno;
2533 saved_win32_errno = GetLastError();
2537 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2540 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2541 rsignal_save(SIGINT, SIG_IGN, &istat);
2542 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2545 pid2 = wait4pid(pid, &status, 0);
2546 } while (pid2 == -1 && errno == EINTR);
2548 rsignal_restore(SIGHUP, &hstat);
2549 rsignal_restore(SIGINT, &istat);
2550 rsignal_restore(SIGQUIT, &qstat);
2553 SETERRNO(saved_errno, 0);
2556 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2558 #endif /* !DOSISH */
2560 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2562 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2567 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2569 char spid[TYPE_CHARS(IV)];
2573 sprintf(spid, "%"IVdf, (IV)pid);
2574 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2575 if (svp && *svp != &PL_sv_undef) {
2576 *statusp = SvIVX(*svp);
2577 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2584 hv_iterinit(PL_pidstatus);
2585 if ((entry = hv_iternext(PL_pidstatus))) {
2586 SV *sv = hv_iterval(PL_pidstatus,entry);
2588 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2589 *statusp = SvIVX(sv);
2590 sprintf(spid, "%"IVdf, (IV)pid);
2591 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2598 # ifdef HAS_WAITPID_RUNTIME
2599 if (!HAS_WAITPID_RUNTIME)
2602 result = PerlProc_waitpid(pid,statusp,flags);
2605 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2606 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2609 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2610 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2615 Perl_croak(aTHX_ "Can't do waitpid with flags");
2617 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2618 pidgone(result,*statusp);
2624 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2627 if (result < 0 && errno == EINTR) {
2632 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2636 Perl_pidgone(pTHX_ Pid_t pid, int status)
2639 char spid[TYPE_CHARS(IV)];
2641 sprintf(spid, "%"IVdf, (IV)pid);
2642 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2643 SvUPGRADE(sv,SVt_IV);
2644 SvIV_set(sv, status);
2648 #if defined(atarist) || defined(OS2) || defined(EPOC)
2651 int /* Cannot prototype with I32
2653 my_syspclose(PerlIO *ptr)
2656 Perl_my_pclose(pTHX_ PerlIO *ptr)
2659 /* Needs work for PerlIO ! */
2660 FILE *f = PerlIO_findFILE(ptr);
2661 I32 result = pclose(f);
2662 PerlIO_releaseFILE(ptr,f);
2670 Perl_my_pclose(pTHX_ PerlIO *ptr)
2672 /* Needs work for PerlIO ! */
2673 FILE *f = PerlIO_findFILE(ptr);
2674 I32 result = djgpp_pclose(f);
2675 result = (result << 8) & 0xff00;
2676 PerlIO_releaseFILE(ptr,f);
2682 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2685 register const char *frombase = from;
2688 register const char c = *from;
2693 while (count-- > 0) {
2694 for (todo = len; todo > 0; todo--) {
2703 Perl_same_dirent(pTHX_ const char *a, const char *b)
2705 char *fa = strrchr(a,'/');
2706 char *fb = strrchr(b,'/');
2709 SV *tmpsv = sv_newmortal();
2722 sv_setpvn(tmpsv, ".", 1);
2724 sv_setpvn(tmpsv, a, fa - a);
2725 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2728 sv_setpvn(tmpsv, ".", 1);
2730 sv_setpvn(tmpsv, b, fb - b);
2731 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2733 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2734 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2736 #endif /* !HAS_RENAME */
2739 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2741 const char *xfound = Nullch;
2742 char *xfailed = Nullch;
2743 char tmpbuf[MAXPATHLEN];
2747 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2748 # define SEARCH_EXTS ".bat", ".cmd", NULL
2749 # define MAX_EXT_LEN 4
2752 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2753 # define MAX_EXT_LEN 4
2756 # define SEARCH_EXTS ".pl", ".com", NULL
2757 # define MAX_EXT_LEN 4
2759 /* additional extensions to try in each dir if scriptname not found */
2761 const char *exts[] = { SEARCH_EXTS };
2762 const char **ext = search_ext ? search_ext : exts;
2763 int extidx = 0, i = 0;
2764 const char *curext = Nullch;
2767 # define MAX_EXT_LEN 0
2771 * If dosearch is true and if scriptname does not contain path
2772 * delimiters, search the PATH for scriptname.
2774 * If SEARCH_EXTS is also defined, will look for each
2775 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2776 * while searching the PATH.
2778 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2779 * proceeds as follows:
2780 * If DOSISH or VMSISH:
2781 * + look for ./scriptname{,.foo,.bar}
2782 * + search the PATH for scriptname{,.foo,.bar}
2785 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2786 * this will not look in '.' if it's not in the PATH)
2791 # ifdef ALWAYS_DEFTYPES
2792 len = strlen(scriptname);
2793 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2794 int hasdir, idx = 0, deftypes = 1;
2797 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2800 int hasdir, idx = 0, deftypes = 1;
2803 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2805 /* The first time through, just add SEARCH_EXTS to whatever we
2806 * already have, so we can check for default file types. */
2808 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2814 if ((strlen(tmpbuf) + strlen(scriptname)
2815 + MAX_EXT_LEN) >= sizeof tmpbuf)
2816 continue; /* don't search dir with too-long name */
2817 strcat(tmpbuf, scriptname);
2821 if (strEQ(scriptname, "-"))
2823 if (dosearch) { /* Look in '.' first. */
2824 const char *cur = scriptname;
2826 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2828 if (strEQ(ext[i++],curext)) {
2829 extidx = -1; /* already has an ext */
2834 DEBUG_p(PerlIO_printf(Perl_debug_log,
2835 "Looking for %s\n",cur));
2836 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2837 && !S_ISDIR(PL_statbuf.st_mode)) {
2845 if (cur == scriptname) {
2846 len = strlen(scriptname);
2847 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2849 cur = strcpy(tmpbuf, scriptname);
2851 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2852 && strcpy(tmpbuf+len, ext[extidx++]));
2857 #ifdef MACOS_TRADITIONAL
2858 if (dosearch && !strchr(scriptname, ':') &&
2859 (s = PerlEnv_getenv("Commands")))
2861 if (dosearch && !strchr(scriptname, '/')
2863 && !strchr(scriptname, '\\')
2865 && (s = PerlEnv_getenv("PATH")))
2870 PL_bufend = s + strlen(s);
2871 while (s < PL_bufend) {
2872 #ifdef MACOS_TRADITIONAL
2873 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2877 #if defined(atarist) || defined(DOSISH)
2882 && *s != ';'; len++, s++) {
2883 if (len < sizeof tmpbuf)
2886 if (len < sizeof tmpbuf)
2888 #else /* ! (atarist || DOSISH) */
2889 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2892 #endif /* ! (atarist || DOSISH) */
2893 #endif /* MACOS_TRADITIONAL */
2896 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2897 continue; /* don't search dir with too-long name */
2898 #ifdef MACOS_TRADITIONAL
2899 if (len && tmpbuf[len - 1] != ':')
2900 tmpbuf[len++] = ':';
2903 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2904 && tmpbuf[len - 1] != '/'
2905 && tmpbuf[len - 1] != '\\'
2908 tmpbuf[len++] = '/';
2909 if (len == 2 && tmpbuf[0] == '.')
2912 (void)strcpy(tmpbuf + len, scriptname);
2916 len = strlen(tmpbuf);
2917 if (extidx > 0) /* reset after previous loop */
2921 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2922 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2923 if (S_ISDIR(PL_statbuf.st_mode)) {
2927 } while ( retval < 0 /* not there */
2928 && extidx>=0 && ext[extidx] /* try an extension? */
2929 && strcpy(tmpbuf+len, ext[extidx++])
2934 if (S_ISREG(PL_statbuf.st_mode)
2935 && cando(S_IRUSR,TRUE,&PL_statbuf)
2936 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2937 && cando(S_IXUSR,TRUE,&PL_statbuf)
2941 xfound = tmpbuf; /* bingo! */
2945 xfailed = savepv(tmpbuf);
2948 if (!xfound && !seen_dot && !xfailed &&
2949 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2950 || S_ISDIR(PL_statbuf.st_mode)))
2952 seen_dot = 1; /* Disable message. */
2954 if (flags & 1) { /* do or die? */
2955 Perl_croak(aTHX_ "Can't %s %s%s%s",
2956 (xfailed ? "execute" : "find"),
2957 (xfailed ? xfailed : scriptname),
2958 (xfailed ? "" : " on PATH"),
2959 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2961 scriptname = Nullch;
2965 scriptname = xfound;
2967 return (scriptname ? savepv(scriptname) : Nullch);
2970 #ifndef PERL_GET_CONTEXT_DEFINED
2973 Perl_get_context(void)
2976 #if defined(USE_ITHREADS)
2977 # ifdef OLD_PTHREADS_API
2979 if (pthread_getspecific(PL_thr_key, &t))
2980 Perl_croak_nocontext("panic: pthread_getspecific");
2983 # ifdef I_MACH_CTHREADS
2984 return (void*)cthread_data(cthread_self());
2986 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2995 Perl_set_context(void *t)
2998 #if defined(USE_ITHREADS)
2999 # ifdef I_MACH_CTHREADS
3000 cthread_set_data(cthread_self(), t);
3002 if (pthread_setspecific(PL_thr_key, t))
3003 Perl_croak_nocontext("panic: pthread_setspecific");
3010 #endif /* !PERL_GET_CONTEXT_DEFINED */
3012 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3021 Perl_get_op_names(pTHX)
3023 return (char **)PL_op_name;
3027 Perl_get_op_descs(pTHX)
3029 return (char **)PL_op_desc;
3033 Perl_get_no_modify(pTHX)
3035 return PL_no_modify;
3039 Perl_get_opargs(pTHX)
3041 return (U32 *)PL_opargs;
3045 Perl_get_ppaddr(pTHX)
3048 return (PPADDR_t*)PL_ppaddr;
3051 #ifndef HAS_GETENV_LEN
3053 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3055 char *env_trans = PerlEnv_getenv(env_elem);
3057 *len = strlen(env_trans);
3064 Perl_get_vtbl(pTHX_ int vtbl_id)
3066 const MGVTBL* result = Null(MGVTBL*);
3070 result = &PL_vtbl_sv;
3073 result = &PL_vtbl_env;
3075 case want_vtbl_envelem:
3076 result = &PL_vtbl_envelem;
3079 result = &PL_vtbl_sig;
3081 case want_vtbl_sigelem:
3082 result = &PL_vtbl_sigelem;
3084 case want_vtbl_pack:
3085 result = &PL_vtbl_pack;
3087 case want_vtbl_packelem:
3088 result = &PL_vtbl_packelem;
3090 case want_vtbl_dbline:
3091 result = &PL_vtbl_dbline;
3094 result = &PL_vtbl_isa;
3096 case want_vtbl_isaelem:
3097 result = &PL_vtbl_isaelem;
3099 case want_vtbl_arylen:
3100 result = &PL_vtbl_arylen;
3102 case want_vtbl_glob:
3103 result = &PL_vtbl_glob;
3105 case want_vtbl_mglob:
3106 result = &PL_vtbl_mglob;
3108 case want_vtbl_nkeys:
3109 result = &PL_vtbl_nkeys;
3111 case want_vtbl_taint:
3112 result = &PL_vtbl_taint;
3114 case want_vtbl_substr:
3115 result = &PL_vtbl_substr;
3118 result = &PL_vtbl_vec;
3121 result = &PL_vtbl_pos;
3124 result = &PL_vtbl_bm;
3127 result = &PL_vtbl_fm;
3129 case want_vtbl_uvar:
3130 result = &PL_vtbl_uvar;
3132 case want_vtbl_defelem:
3133 result = &PL_vtbl_defelem;
3135 case want_vtbl_regexp:
3136 result = &PL_vtbl_regexp;
3138 case want_vtbl_regdata:
3139 result = &PL_vtbl_regdata;
3141 case want_vtbl_regdatum:
3142 result = &PL_vtbl_regdatum;
3144 #ifdef USE_LOCALE_COLLATE
3145 case want_vtbl_collxfrm:
3146 result = &PL_vtbl_collxfrm;
3149 case want_vtbl_amagic:
3150 result = &PL_vtbl_amagic;
3152 case want_vtbl_amagicelem:
3153 result = &PL_vtbl_amagicelem;
3155 case want_vtbl_backref:
3156 result = &PL_vtbl_backref;
3158 case want_vtbl_utf8:
3159 result = &PL_vtbl_utf8;
3162 return (MGVTBL*)result;
3166 Perl_my_fflush_all(pTHX)
3168 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3169 return PerlIO_flush(NULL);
3171 # if defined(HAS__FWALK)
3172 extern int fflush(FILE *);
3173 /* undocumented, unprototyped, but very useful BSDism */
3174 extern void _fwalk(int (*)(FILE *));
3178 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3180 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3181 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3183 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3184 open_max = sysconf(_SC_OPEN_MAX);
3187 open_max = FOPEN_MAX;
3190 open_max = OPEN_MAX;
3201 for (i = 0; i < open_max; i++)
3202 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3203 STDIO_STREAM_ARRAY[i]._file < open_max &&
3204 STDIO_STREAM_ARRAY[i]._flag)
3205 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3209 SETERRNO(EBADF,RMS_IFI);
3216 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3219 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3220 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3222 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3223 const char *type = OP_IS_SOCKET(op)
3224 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3225 ? "socket" : "filehandle";
3226 const char *name = NULL;
3228 if (gv && isGV(gv)) {
3232 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3233 if (ckWARN(WARN_IO)) {
3234 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3236 Perl_warner(aTHX_ packWARN(WARN_IO),
3237 "Filehandle %s opened only for %sput",
3240 Perl_warner(aTHX_ packWARN(WARN_IO),
3241 "Filehandle opened only for %sput", direction);
3248 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3250 warn_type = WARN_CLOSED;
3254 warn_type = WARN_UNOPENED;
3257 if (ckWARN(warn_type)) {
3258 if (name && *name) {
3259 Perl_warner(aTHX_ packWARN(warn_type),
3260 "%s%s on %s %s %s", func, pars, vile, type, name);
3261 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3263 aTHX_ packWARN(warn_type),
3264 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3269 Perl_warner(aTHX_ packWARN(warn_type),
3270 "%s%s on %s %s", func, pars, vile, type);
3271 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3273 aTHX_ packWARN(warn_type),
3274 "\t(Are you trying to call %s%s on dirhandle?)\n",
3283 /* in ASCII order, not that it matters */
3284 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3287 Perl_ebcdic_control(pTHX_ int ch)
3295 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3296 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3299 if (ctlp == controllablechars)
3300 return('\177'); /* DEL */
3302 return((unsigned char)(ctlp - controllablechars - 1));
3303 } else { /* Want uncontrol */
3304 if (ch == '\177' || ch == -1)
3306 else if (ch == '\157')
3308 else if (ch == '\174')
3310 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3312 else if (ch == '\155')
3314 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3315 return(controllablechars[ch+1]);
3317 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3322 /* To workaround core dumps from the uninitialised tm_zone we get the
3323 * system to give us a reasonable struct to copy. This fix means that
3324 * strftime uses the tm_zone and tm_gmtoff values returned by
3325 * localtime(time()). That should give the desired result most of the
3326 * time. But probably not always!
3328 * This does not address tzname aspects of NETaa14816.
3333 # ifndef STRUCT_TM_HASZONE
3334 # define STRUCT_TM_HASZONE
3338 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3339 # ifndef HAS_TM_TM_ZONE
3340 # define HAS_TM_TM_ZONE
3345 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3347 #ifdef HAS_TM_TM_ZONE
3351 my_tm = localtime(&now);
3353 Copy(my_tm, ptm, 1, struct tm);
3358 * mini_mktime - normalise struct tm values without the localtime()
3359 * semantics (and overhead) of mktime().
3362 Perl_mini_mktime(pTHX_ struct tm *ptm)
3366 int month, mday, year, jday;
3367 int odd_cent, odd_year;
3369 #define DAYS_PER_YEAR 365
3370 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3371 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3372 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3373 #define SECS_PER_HOUR (60*60)
3374 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3375 /* parentheses deliberately absent on these two, otherwise they don't work */
3376 #define MONTH_TO_DAYS 153/5
3377 #define DAYS_TO_MONTH 5/153
3378 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3379 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3380 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3381 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3384 * Year/day algorithm notes:
3386 * With a suitable offset for numeric value of the month, one can find
3387 * an offset into the year by considering months to have 30.6 (153/5) days,
3388 * using integer arithmetic (i.e., with truncation). To avoid too much
3389 * messing about with leap days, we consider January and February to be
3390 * the 13th and 14th month of the previous year. After that transformation,
3391 * we need the month index we use to be high by 1 from 'normal human' usage,
3392 * so the month index values we use run from 4 through 15.
3394 * Given that, and the rules for the Gregorian calendar (leap years are those
3395 * divisible by 4 unless also divisible by 100, when they must be divisible
3396 * by 400 instead), we can simply calculate the number of days since some
3397 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3398 * the days we derive from our month index, and adding in the day of the
3399 * month. The value used here is not adjusted for the actual origin which
3400 * it normally would use (1 January A.D. 1), since we're not exposing it.
3401 * We're only building the value so we can turn around and get the
3402 * normalised values for the year, month, day-of-month, and day-of-year.
3404 * For going backward, we need to bias the value we're using so that we find
3405 * the right year value. (Basically, we don't want the contribution of
3406 * March 1st to the number to apply while deriving the year). Having done
3407 * that, we 'count up' the contribution to the year number by accounting for
3408 * full quadracenturies (400-year periods) with their extra leap days, plus
3409 * the contribution from full centuries (to avoid counting in the lost leap
3410 * days), plus the contribution from full quad-years (to count in the normal
3411 * leap days), plus the leftover contribution from any non-leap years.
3412 * At this point, if we were working with an actual leap day, we'll have 0
3413 * days left over. This is also true for March 1st, however. So, we have
3414 * to special-case that result, and (earlier) keep track of the 'odd'
3415 * century and year contributions. If we got 4 extra centuries in a qcent,
3416 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3417 * Otherwise, we add back in the earlier bias we removed (the 123 from
3418 * figuring in March 1st), find the month index (integer division by 30.6),
3419 * and the remainder is the day-of-month. We then have to convert back to
3420 * 'real' months (including fixing January and February from being 14/15 in
3421 * the previous year to being in the proper year). After that, to get
3422 * tm_yday, we work with the normalised year and get a new yearday value for
3423 * January 1st, which we subtract from the yearday value we had earlier,
3424 * representing the date we've re-built. This is done from January 1
3425 * because tm_yday is 0-origin.
3427 * Since POSIX time routines are only guaranteed to work for times since the
3428 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3429 * applies Gregorian calendar rules even to dates before the 16th century
3430 * doesn't bother me. Besides, you'd need cultural context for a given
3431 * date to know whether it was Julian or Gregorian calendar, and that's
3432 * outside the scope for this routine. Since we convert back based on the
3433 * same rules we used to build the yearday, you'll only get strange results
3434 * for input which needed normalising, or for the 'odd' century years which
3435 * were leap years in the Julian calander but not in the Gregorian one.
3436 * I can live with that.
3438 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3439 * that's still outside the scope for POSIX time manipulation, so I don't
3443 year = 1900 + ptm->tm_year;
3444 month = ptm->tm_mon;
3445 mday = ptm->tm_mday;
3446 /* allow given yday with no month & mday to dominate the result */
3447 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3450 jday = 1 + ptm->tm_yday;
3459 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3460 yearday += month*MONTH_TO_DAYS + mday + jday;
3462 * Note that we don't know when leap-seconds were or will be,
3463 * so we have to trust the user if we get something which looks
3464 * like a sensible leap-second. Wild values for seconds will
3465 * be rationalised, however.
3467 if ((unsigned) ptm->tm_sec <= 60) {
3474 secs += 60 * ptm->tm_min;
3475 secs += SECS_PER_HOUR * ptm->tm_hour;
3477 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3478 /* got negative remainder, but need positive time */
3479 /* back off an extra day to compensate */
3480 yearday += (secs/SECS_PER_DAY)-1;
3481 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3484 yearday += (secs/SECS_PER_DAY);
3485 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3488 else if (secs >= SECS_PER_DAY) {
3489 yearday += (secs/SECS_PER_DAY);
3490 secs %= SECS_PER_DAY;
3492 ptm->tm_hour = secs/SECS_PER_HOUR;
3493 secs %= SECS_PER_HOUR;
3494 ptm->tm_min = secs/60;
3496 ptm->tm_sec += secs;
3497 /* done with time of day effects */
3499 * The algorithm for yearday has (so far) left it high by 428.
3500 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3501 * bias it by 123 while trying to figure out what year it
3502 * really represents. Even with this tweak, the reverse
3503 * translation fails for years before A.D. 0001.
3504 * It would still fail for Feb 29, but we catch that one below.
3506 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3507 yearday -= YEAR_ADJUST;
3508 year = (yearday / DAYS_PER_QCENT) * 400;
3509 yearday %= DAYS_PER_QCENT;
3510 odd_cent = yearday / DAYS_PER_CENT;
3511 year += odd_cent * 100;
3512 yearday %= DAYS_PER_CENT;
3513 year += (yearday / DAYS_PER_QYEAR) * 4;
3514 yearday %= DAYS_PER_QYEAR;
3515 odd_year = yearday / DAYS_PER_YEAR;
3517 yearday %= DAYS_PER_YEAR;
3518 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3523 yearday += YEAR_ADJUST; /* recover March 1st crock */
3524 month = yearday*DAYS_TO_MONTH;
3525 yearday -= month*MONTH_TO_DAYS;
3526 /* recover other leap-year adjustment */
3535 ptm->tm_year = year - 1900;
3537 ptm->tm_mday = yearday;
3538 ptm->tm_mon = month;
3542 ptm->tm_mon = month - 1;
3544 /* re-build yearday based on Jan 1 to get tm_yday */
3546 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3547 yearday += 14*MONTH_TO_DAYS + 1;
3548 ptm->tm_yday = jday - yearday;
3549 /* fix tm_wday if not overridden by caller */
3550 if ((unsigned)ptm->tm_wday > 6)
3551 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3555 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)
3563 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3566 mytm.tm_hour = hour;
3567 mytm.tm_mday = mday;
3569 mytm.tm_year = year;
3570 mytm.tm_wday = wday;
3571 mytm.tm_yday = yday;
3572 mytm.tm_isdst = isdst;
3574 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3575 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3580 #ifdef HAS_TM_TM_GMTOFF
3581 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3583 #ifdef HAS_TM_TM_ZONE
3584 mytm.tm_zone = mytm2.tm_zone;
3589 New(0, buf, buflen, char);
3590 len = strftime(buf, buflen, fmt, &mytm);
3592 ** The following is needed to handle to the situation where
3593 ** tmpbuf overflows. Basically we want to allocate a buffer
3594 ** and try repeatedly. The reason why it is so complicated
3595 ** is that getting a return value of 0 from strftime can indicate
3596 ** one of the following:
3597 ** 1. buffer overflowed,
3598 ** 2. illegal conversion specifier, or
3599 ** 3. the format string specifies nothing to be returned(not
3600 ** an error). This could be because format is an empty string
3601 ** or it specifies %p that yields an empty string in some locale.
3602 ** If there is a better way to make it portable, go ahead by
3605 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3608 /* Possibly buf overflowed - try again with a bigger buf */
3609 const int fmtlen = strlen(fmt);
3610 const int bufsize = fmtlen + buflen;
3612 New(0, buf, bufsize, char);
3614 buflen = strftime(buf, bufsize, fmt, &mytm);
3615 if (buflen > 0 && buflen < bufsize)
3617 /* heuristic to prevent out-of-memory errors */
3618 if (bufsize > 100*fmtlen) {
3623 Renew(buf, bufsize*2, char);
3628 Perl_croak(aTHX_ "panic: no strftime");
3634 #define SV_CWD_RETURN_UNDEF \
3635 sv_setsv(sv, &PL_sv_undef); \
3638 #define SV_CWD_ISDOT(dp) \
3639 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3640 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3643 =head1 Miscellaneous Functions
3645 =for apidoc getcwd_sv
3647 Fill the sv with current working directory
3652 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3653 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3654 * getcwd(3) if available
3655 * Comments from the orignal:
3656 * This is a faster version of getcwd. It's also more dangerous
3657 * because you might chdir out of a directory that you can't chdir
3661 Perl_getcwd_sv(pTHX_ register SV *sv)
3665 #ifndef INCOMPLETE_TAINTS
3671 char buf[MAXPATHLEN];
3673 /* Some getcwd()s automatically allocate a buffer of the given
3674 * size from the heap if they are given a NULL buffer pointer.
3675 * The problem is that this behaviour is not portable. */
3676 if (getcwd(buf, sizeof(buf) - 1)) {
3677 sv_setpvn(sv, buf, strlen(buf));
3681 sv_setsv(sv, &PL_sv_undef);
3689 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3693 SvUPGRADE(sv, SVt_PV);
3695 if (PerlLIO_lstat(".", &statbuf) < 0) {
3696 SV_CWD_RETURN_UNDEF;
3699 orig_cdev = statbuf.st_dev;
3700 orig_cino = statbuf.st_ino;
3709 if (PerlDir_chdir("..") < 0) {
3710 SV_CWD_RETURN_UNDEF;
3712 if (PerlLIO_stat(".", &statbuf) < 0) {
3713 SV_CWD_RETURN_UNDEF;
3716 cdev = statbuf.st_dev;
3717 cino = statbuf.st_ino;
3719 if (odev == cdev && oino == cino) {
3722 if (!(dir = PerlDir_open("."))) {
3723 SV_CWD_RETURN_UNDEF;
3726 while ((dp = PerlDir_read(dir)) != NULL) {
3728 const int namelen = dp->d_namlen;
3730 const int namelen = strlen(dp->d_name);
3733 if (SV_CWD_ISDOT(dp)) {
3737 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3738 SV_CWD_RETURN_UNDEF;
3741 tdev = statbuf.st_dev;
3742 tino = statbuf.st_ino;
3743 if (tino == oino && tdev == odev) {
3749 SV_CWD_RETURN_UNDEF;
3752 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3753 SV_CWD_RETURN_UNDEF;
3756 SvGROW(sv, pathlen + namelen + 1);
3760 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3763 /* prepend current directory to the front */
3765 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3766 pathlen += (namelen + 1);
3768 #ifdef VOID_CLOSEDIR
3771 if (PerlDir_close(dir) < 0) {
3772 SV_CWD_RETURN_UNDEF;
3778 SvCUR_set(sv, pathlen);
3782 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3783 SV_CWD_RETURN_UNDEF;
3786 if (PerlLIO_stat(".", &statbuf) < 0) {
3787 SV_CWD_RETURN_UNDEF;
3790 cdev = statbuf.st_dev;
3791 cino = statbuf.st_ino;
3793 if (cdev != orig_cdev || cino != orig_cino) {
3794 Perl_croak(aTHX_ "Unstable directory path, "
3795 "current directory changed unexpectedly");
3807 =for apidoc scan_version
3809 Returns a pointer to the next character after the parsed
3810 version string, as well as upgrading the passed in SV to
3813 Function must be called with an already existing SV like
3816 s = scan_version(s,SV *sv, bool qv);
3818 Performs some preprocessing to the string to ensure that
3819 it has the correct characteristics of a version. Flags the
3820 object if it contains an underscore (which denotes this
3821 is a alpha version). The boolean qv denotes that the version
3822 should be interpreted as if it had multiple decimals, even if
3829 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3831 const char *start = s;
3838 SV* hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3839 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3842 s++; /* get past 'v' */
3843 qv = 1; /* force quoted version processing */
3848 /* pre-scan the input string to check for decimals/underbars */
3849 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3854 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3858 else if ( *pos == '_' )
3861 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3863 width = pos - last - 1; /* natural width of sub-version */
3868 if ( saw_period > 1 ) {
3869 qv = 1; /* force quoted version processing */
3875 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
3877 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
3879 if ( !qv && width < 3 )
3880 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3882 while (isDIGIT(*pos))
3884 if (!isALPHA(*pos)) {
3890 /* this is atoi() that delimits on underscores */
3891 const char *end = pos;
3895 /* the following if() will only be true after the decimal
3896 * point of a version originally created with a bare
3897 * floating point number, i.e. not quoted in any way
3899 if ( !qv && s > start+1 && saw_period == 1 ) {
3903 rev += (*s - '0') * mult;
3905 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3906 Perl_croak(aTHX_ "Integer overflow in version");
3913 while (--end >= s) {
3915 rev += (*end - '0') * mult;
3917 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3918 Perl_croak(aTHX_ "Integer overflow in version");
3923 /* Append revision */
3924 av_push(av, newSViv(rev));
3925 if ( *pos == '.' && isDIGIT(pos[1]) )
3927 else if ( *pos == '_' && isDIGIT(pos[1]) )
3929 else if ( isDIGIT(*pos) )
3936 while ( isDIGIT(*pos) )
3941 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
3949 if ( qv ) { /* quoted versions always get at least three terms*/
3950 I32 len = av_len(av);
3951 /* This for loop appears to trigger a compiler bug on OS X, as it
3952 loops infinitely. Yes, len is negative. No, it makes no sense.
3953 Compiler in question is:
3954 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3955 for ( len = 2 - len; len > 0; len-- )
3956 av_push((AV *)sv, newSViv(0));
3960 av_push(av, newSViv(0));
3963 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
3964 av_push(av, newSViv(0));
3966 /* And finally, store the AV in the hash */
3967 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
3972 =for apidoc new_version
3974 Returns a new version object based on the passed in SV:
3976 SV *sv = new_version(SV *ver);
3978 Does not alter the passed in ver SV. See "upg_version" if you
3979 want to upgrade the SV.
3985 Perl_new_version(pTHX_ SV *ver)
3988 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3993 /* This will get reblessed later if a derived class*/
3994 SV* hv = newSVrv(rv, "version");
3995 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
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 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)
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 Perl_sv_catpv(aTHX_ sv,"0");
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 int denom = (int)pow(10,(3-width));
4137 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)
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)
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)
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;
4815 #ifdef PERL_GLOBAL_STRUCT
4818 Perl_init_global_struct(pTHX)
4820 struct perl_vars *plvarsp = NULL;
4821 #ifdef PERL_GLOBAL_STRUCT
4822 # define PERL_GLOBAL_STRUCT_INIT
4823 # include "opcode.h" /* the ppaddr and check */
4824 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4825 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4826 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4827 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4828 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4832 plvarsp = PL_VarsPtr;
4833 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4839 # define PERLVAR(var,type) /**/
4840 # define PERLVARA(var,n,type) /**/
4841 # define PERLVARI(var,type,init) plvarsp->var = init;
4842 # define PERLVARIC(var,type,init) plvarsp->var = init;
4843 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4844 # include "perlvars.h"
4850 # ifdef PERL_GLOBAL_STRUCT
4851 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4852 if (!plvarsp->Gppaddr)
4854 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4855 if (!plvarsp->Gcheck)
4857 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4858 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4860 # ifdef PERL_SET_VARS
4861 PERL_SET_VARS(plvarsp);
4863 # undef PERL_GLOBAL_STRUCT_INIT
4868 #endif /* PERL_GLOBAL_STRUCT */
4870 #ifdef PERL_GLOBAL_STRUCT
4873 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4875 #ifdef PERL_GLOBAL_STRUCT
4876 # ifdef PERL_UNSET_VARS
4877 PERL_UNSET_VARS(plvarsp);
4879 free(plvarsp->Gppaddr);
4880 free(plvarsp->Gcheck);
4881 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4887 #endif /* PERL_GLOBAL_STRUCT */
4891 * c-indentation-style: bsd
4893 * indent-tabs-mode: t
4896 * ex: set ts=8 sts=4 sw=4 noet: