3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
60 /* paranoid version of system's malloc() */
63 Perl_safesysmalloc(MEM_SIZE size)
69 PerlIO_printf(Perl_error_log,
70 "Allocation too large: %lx\n", size) FLUSH;
73 #endif /* HAS_64K_LIMIT */
76 Perl_croak_nocontext("panic: malloc");
78 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
79 PERL_ALLOC_CHECK(ptr);
80 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
86 /* Can't use PerlIO to write as it allocates memory */
87 PerlLIO_write(PerlIO_fileno(Perl_error_log),
88 PL_no_mem, strlen(PL_no_mem));
95 /* paranoid version of system's realloc() */
98 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
102 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
103 Malloc_t PerlMem_realloc();
104 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
108 PerlIO_printf(Perl_error_log,
109 "Reallocation too large: %lx\n", size) FLUSH;
112 #endif /* HAS_64K_LIMIT */
119 return safesysmalloc(size);
122 Perl_croak_nocontext("panic: realloc");
124 ptr = (Malloc_t)PerlMem_realloc(where,size);
125 PERL_ALLOC_CHECK(ptr);
127 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
128 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
135 /* Can't use PerlIO to write as it allocates memory */
136 PerlLIO_write(PerlIO_fileno(Perl_error_log),
137 PL_no_mem, strlen(PL_no_mem));
144 /* safe version of system's free() */
147 Perl_safesysfree(Malloc_t where)
150 #ifdef PERL_IMPLICIT_SYS
153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
159 /* safe version of system's calloc() */
162 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
168 if (size * count > 0xffff) {
169 PerlIO_printf(Perl_error_log,
170 "Allocation too large: %lx\n", size * count) FLUSH;
173 #endif /* HAS_64K_LIMIT */
175 if ((long)size < 0 || (long)count < 0)
176 Perl_croak_nocontext("panic: calloc");
179 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
180 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
183 memset((void*)ptr, 0, size);
189 /* Can't use PerlIO to write as it allocates memory */
190 PerlLIO_write(PerlIO_fileno(Perl_error_log),
191 PL_no_mem, strlen(PL_no_mem));
198 /* These must be defined when not using Perl's malloc for binary
203 Malloc_t Perl_malloc (MEM_SIZE nbytes)
206 return (Malloc_t)PerlMem_malloc(nbytes);
209 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
212 return (Malloc_t)PerlMem_calloc(elements, size);
215 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
218 return (Malloc_t)PerlMem_realloc(where, nbytes);
221 Free_t Perl_mfree (Malloc_t where)
229 /* copy a string up to some (non-backslashed) delimiter, if any */
232 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
235 for (tolen = 0; from < fromend; from++, tolen++) {
237 if (from[1] == delim)
246 else if (*from == delim)
257 /* return ptr to little string in big string, NULL if not found */
258 /* This routine was donated by Corey Satten. */
261 Perl_instr(pTHX_ register const char *big, register const char *little)
271 register const char *s, *x;
274 for (x=big,s=little; *s; /**/ ) {
283 return (char*)(big-1);
288 /* same as instr but allow embedded nulls */
291 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
293 register const I32 first = *little;
294 register const char *littleend = lend;
296 if (!first && little >= littleend)
298 if (bigend - big < littleend - little)
300 bigend -= littleend - little++;
301 while (big <= bigend) {
302 register const char *s, *x;
305 for (x=big,s=little; s < littleend; /**/ ) {
312 return (char*)(big-1);
317 /* reverse of the above--find last substring */
320 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
322 register const char *bigbeg;
323 register const I32 first = *little;
324 register const char *littleend = lend;
326 if (!first && little >= littleend)
327 return (char*)bigend;
329 big = bigend - (littleend - little++);
330 while (big >= bigbeg) {
331 register const char *s, *x;
334 for (x=big+2,s=little; s < littleend; /**/ ) {
341 return (char*)(big+1);
346 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
348 /* As a space optimization, we do not compile tables for strings of length
349 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
350 special-cased in fbm_instr().
352 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
355 =head1 Miscellaneous Functions
357 =for apidoc fbm_compile
359 Analyses the string in order to make fast searches on it using fbm_instr()
360 -- the Boyer-Moore algorithm.
366 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
368 const register U8 *s;
374 if (flags & FBMcf_TAIL) {
375 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
376 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
377 if (mg && mg->mg_len >= 0)
380 s = (U8*)SvPV_force_mutable(sv, len);
381 SvUPGRADE(sv, SVt_PVBM);
382 if (len == 0) /* TAIL might be on a zero-length string. */
385 const unsigned char *sb;
386 const U8 mlen = (len>255) ? 255 : (U8)len;
389 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
390 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
391 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
392 memset((void*)table, mlen, 256);
393 table[-1] = (U8)flags;
395 sb = s - mlen + 1; /* first char (maybe) */
397 if (table[*s] == mlen)
402 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
405 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
406 for (i = 0; i < len; i++) {
407 if (PL_freq[s[i]] < frequency) {
409 frequency = PL_freq[s[i]];
412 BmRARE(sv) = s[rarest];
413 BmPREVIOUS(sv) = (U16)rarest;
414 BmUSEFUL(sv) = 100; /* Initial value */
415 if (flags & FBMcf_TAIL)
417 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
418 BmRARE(sv),BmPREVIOUS(sv)));
421 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
422 /* If SvTAIL is actually due to \Z or \z, this gives false positives
426 =for apidoc fbm_instr
428 Returns the location of the SV in the string delimited by C<str> and
429 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
430 does not have to be fbm_compiled, but the search will not be as fast
437 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
439 register unsigned char *s;
441 register const unsigned char *little
442 = (const unsigned char *)SvPV_const(littlestr,l);
443 register STRLEN littlelen = l;
444 register const I32 multiline = flags & FBMrf_MULTILINE;
446 if ((STRLEN)(bigend - big) < littlelen) {
447 if ( SvTAIL(littlestr)
448 && ((STRLEN)(bigend - big) == littlelen - 1)
450 || (*big == *little &&
451 memEQ((char *)big, (char *)little, littlelen - 1))))
456 if (littlelen <= 2) { /* Special-cased */
458 if (littlelen == 1) {
459 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
460 /* Know that bigend != big. */
461 if (bigend[-1] == '\n')
462 return (char *)(bigend - 1);
463 return (char *) bigend;
471 if (SvTAIL(littlestr))
472 return (char *) bigend;
476 return (char*)big; /* Cannot be SvTAIL! */
479 if (SvTAIL(littlestr) && !multiline) {
480 if (bigend[-1] == '\n' && bigend[-2] == *little)
481 return (char*)bigend - 2;
482 if (bigend[-1] == *little)
483 return (char*)bigend - 1;
487 /* This should be better than FBM if c1 == c2, and almost
488 as good otherwise: maybe better since we do less indirection.
489 And we save a lot of memory by caching no table. */
490 const unsigned char c1 = little[0];
491 const unsigned char c2 = little[1];
496 while (s <= bigend) {
506 goto check_1char_anchor;
517 goto check_1char_anchor;
520 while (s <= bigend) {
525 goto check_1char_anchor;
534 check_1char_anchor: /* One char and anchor! */
535 if (SvTAIL(littlestr) && (*bigend == *little))
536 return (char *)bigend; /* bigend is already decremented. */
539 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
540 s = bigend - littlelen;
541 if (s >= big && bigend[-1] == '\n' && *s == *little
542 /* Automatically of length > 2 */
543 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
545 return (char*)s; /* how sweet it is */
548 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
550 return (char*)s + 1; /* how sweet it is */
554 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
555 char *b = ninstr((char*)big,(char*)bigend,
556 (char*)little, (char*)little + littlelen);
558 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
559 /* Chop \n from littlestr: */
560 s = bigend - littlelen + 1;
562 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
571 { /* Do actual FBM. */
572 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
573 const register unsigned char *oldlittle;
575 if (littlelen > (STRLEN)(bigend - big))
577 --littlelen; /* Last char found by table lookup */
580 little += littlelen; /* last char */
586 if ((tmp = table[*s])) {
587 if ((s += tmp) < bigend)
591 else { /* less expensive than calling strncmp() */
592 register unsigned char * const olds = s;
597 if (*--s == *--little)
599 s = olds + 1; /* here we pay the price for failure */
601 if (s < bigend) /* fake up continue to outer loop */
609 if ( s == bigend && (table[-1] & FBMcf_TAIL)
610 && memEQ((char *)(bigend - littlelen),
611 (char *)(oldlittle - littlelen), littlelen) )
612 return (char*)bigend - littlelen;
617 /* start_shift, end_shift are positive quantities which give offsets
618 of ends of some substring of bigstr.
619 If "last" we want the last occurrence.
620 old_posp is the way of communication between consequent calls if
621 the next call needs to find the .
622 The initial *old_posp should be -1.
624 Note that we take into account SvTAIL, so one can get extra
625 optimizations if _ALL flag is set.
628 /* If SvTAIL is actually due to \Z or \z, this gives false positives
629 if PL_multiline. In fact if !PL_multiline the authoritative answer
630 is not supported yet. */
633 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
635 const register unsigned char *big;
637 register I32 previous;
639 const register unsigned char *little;
640 register I32 stop_pos;
641 const register unsigned char *littleend;
645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
648 if ( BmRARE(littlestr) == '\n'
649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
650 little = (const unsigned char *)(SvPVX_const(littlestr));
651 littleend = little + SvCUR(littlestr);
658 little = (const unsigned char *)(SvPVX_const(littlestr));
659 littleend = little + SvCUR(littlestr);
661 /* The value of pos we can start at: */
662 previous = BmPREVIOUS(littlestr);
663 big = (const unsigned char *)(SvPVX_const(bigstr));
664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
666 if (previous + start_shift > stop_pos) {
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
677 while (pos < previous + start_shift) {
678 if (!(pos += PL_screamnext[pos]))
683 const register unsigned char *s, *x;
684 if (pos >= stop_pos) break;
685 if (big[pos] != first)
687 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
693 if (s == littleend) {
695 if (!last) return (char *)(big+pos);
698 } while ( pos += PL_screamnext[pos] );
700 return (char *)(big+(*old_posp));
702 if (!SvTAIL(littlestr) || (end_shift > 0))
704 /* Ignore the trailing "\n". This code is not microoptimized */
705 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
706 stop_pos = littleend - little; /* Actual littlestr len */
711 && ((stop_pos == 1) ||
712 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
718 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
720 register const U8 *a = (const U8 *)s1;
721 register const U8 *b = (const U8 *)s2;
723 if (*a != *b && *a != PL_fold[*b])
731 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
734 register const U8 *a = (const U8 *)s1;
735 register const U8 *b = (const U8 *)s2;
737 if (*a != *b && *a != PL_fold_locale[*b])
744 /* copy a string to a safe spot */
747 =head1 Memory Management
751 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
752 string which is a duplicate of C<pv>. The size of the string is
753 determined by C<strlen()>. The memory allocated for the new string can
754 be freed with the C<Safefree()> function.
760 Perl_savepv(pTHX_ const char *pv)
766 const STRLEN pvlen = strlen(pv)+1;
767 Newx(newaddr,pvlen,char);
768 return memcpy(newaddr,pv,pvlen);
773 /* same thing but with a known length */
778 Perl's version of what C<strndup()> would be if it existed. Returns a
779 pointer to a newly allocated string which is a duplicate of the first
780 C<len> bytes from C<pv>. The memory allocated for the new string can be
781 freed with the C<Safefree()> function.
787 Perl_savepvn(pTHX_ const char *pv, register I32 len)
789 register char *newaddr;
791 Newx(newaddr,len+1,char);
792 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
794 /* might not be null terminated */
796 return (char *) CopyD(pv,newaddr,len,char);
799 return (char *) ZeroD(newaddr,len+1,char);
804 =for apidoc savesharedpv
806 A version of C<savepv()> which allocates the duplicate string in memory
807 which is shared between threads.
812 Perl_savesharedpv(pTHX_ const char *pv)
814 register char *newaddr;
819 pvlen = strlen(pv)+1;
820 newaddr = (char*)PerlMemShared_malloc(pvlen);
822 PerlLIO_write(PerlIO_fileno(Perl_error_log),
823 PL_no_mem, strlen(PL_no_mem));
826 return memcpy(newaddr,pv,pvlen);
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 Newx(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 Newxz(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 * const 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, const 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 */
1056 const int e = errno;
1058 PerlIO * const 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 * const 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 * const 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 = vdie_croak_common(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)
1260 SV * const msv = vmess(pat, args);
1261 const I32 utf8 = SvUTF8(msv);
1262 const char * const message = SvPV_const(msv, msglen);
1265 /* sv_2cv might call Perl_warn() */
1266 SV * const oldwarnhook = PL_warnhook;
1272 SAVESPTR(PL_warnhook);
1273 PL_warnhook = Nullsv;
1274 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1276 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1281 SAVESPTR(PL_warnhook);
1282 PL_warnhook = Nullsv;
1284 msg = newSVpvn(message, msglen);
1285 SvFLAGS(msg) |= utf8;
1289 PUSHSTACKi(PERLSI_WARNHOOK);
1293 call_sv((SV*)cv, G_DISCARD);
1300 write_to_stderr(message, msglen);
1303 #if defined(PERL_IMPLICIT_CONTEXT)
1305 Perl_warn_nocontext(const char *pat, ...)
1309 va_start(args, pat);
1313 #endif /* PERL_IMPLICIT_CONTEXT */
1318 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1319 function the same way you call the C C<printf> function. See C<croak>.
1325 Perl_warn(pTHX_ const char *pat, ...)
1328 va_start(args, pat);
1333 #if defined(PERL_IMPLICIT_CONTEXT)
1335 Perl_warner_nocontext(U32 err, const char *pat, ...)
1339 va_start(args, pat);
1340 vwarner(err, pat, &args);
1343 #endif /* PERL_IMPLICIT_CONTEXT */
1346 Perl_warner(pTHX_ U32 err, const char* pat,...)
1349 va_start(args, pat);
1350 vwarner(err, pat, &args);
1355 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1359 SV * const msv = vmess(pat, args);
1361 const char *message = SvPV_const(msv, msglen);
1362 const I32 utf8 = SvUTF8(msv);
1366 S_vdie_common(aTHX_ message, msglen, utf8);
1369 PL_restartop = die_where(message, msglen);
1370 SvFLAGS(ERRSV) |= utf8;
1373 write_to_stderr(message, msglen);
1377 Perl_vwarn(aTHX_ pat, args);
1381 /* implements the ckWARN? macros */
1384 Perl_ckwarn(pTHX_ U32 w)
1389 && PL_curcop->cop_warnings != pWARN_NONE
1391 PL_curcop->cop_warnings == pWARN_ALL
1392 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1393 || (unpackWARN2(w) &&
1394 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1395 || (unpackWARN3(w) &&
1396 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1397 || (unpackWARN4(w) &&
1398 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1403 isLEXWARN_off && PL_dowarn & G_WARN_ON
1408 /* implements the ckWARN?_d macro */
1411 Perl_ckwarn_d(pTHX_ U32 w)
1415 || PL_curcop->cop_warnings == pWARN_ALL
1417 PL_curcop->cop_warnings != pWARN_NONE
1419 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1420 || (unpackWARN2(w) &&
1421 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1422 || (unpackWARN3(w) &&
1423 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1424 || (unpackWARN4(w) &&
1425 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1433 /* since we've already done strlen() for both nam and val
1434 * we can use that info to make things faster than
1435 * sprintf(s, "%s=%s", nam, val)
1437 #define my_setenv_format(s, nam, nlen, val, vlen) \
1438 Copy(nam, s, nlen, char); \
1440 Copy(val, s+(nlen+1), vlen, char); \
1441 *(s+(nlen+1+vlen)) = '\0'
1443 #ifdef USE_ENVIRON_ARRAY
1444 /* VMS' my_setenv() is in vms.c */
1445 #if !defined(WIN32) && !defined(NETWARE)
1447 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1451 /* only parent thread can modify process environment */
1452 if (PL_curinterp == aTHX)
1455 #ifndef PERL_USE_SAFE_PUTENV
1456 if (!PL_use_safe_putenv) {
1457 /* most putenv()s leak, so we manipulate environ directly */
1458 register I32 i=setenv_getix(nam); /* where does it go? */
1461 if (environ == PL_origenviron) { /* need we copy environment? */
1466 for (max = i; environ[max]; max++) ;
1467 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1468 for (j=0; j<max; j++) { /* copy environment */
1469 const int len = strlen(environ[j]);
1470 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1471 Copy(environ[j], tmpenv[j], len+1, char);
1473 tmpenv[max] = Nullch;
1474 environ = tmpenv; /* tell exec where it is now */
1477 safesysfree(environ[i]);
1478 while (environ[i]) {
1479 environ[i] = environ[i+1];
1484 if (!environ[i]) { /* does not exist yet */
1485 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1486 environ[i+1] = Nullch; /* make sure it's null terminated */
1489 safesysfree(environ[i]);
1493 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1494 /* all that work just for this */
1495 my_setenv_format(environ[i], nam, nlen, val, vlen);
1498 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1499 # if defined(HAS_UNSETENV)
1501 (void)unsetenv(nam);
1503 (void)setenv(nam, val, 1);
1505 # else /* ! HAS_UNSETENV */
1506 (void)setenv(nam, val, 1);
1507 # endif /* HAS_UNSETENV */
1509 # if defined(HAS_UNSETENV)
1511 (void)unsetenv(nam);
1513 int nlen = strlen(nam);
1514 int vlen = strlen(val);
1516 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1517 my_setenv_format(new_env, nam, nlen, val, vlen);
1518 (void)putenv(new_env);
1520 # else /* ! HAS_UNSETENV */
1522 int nlen = strlen(nam), vlen;
1527 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1528 /* all that work just for this */
1529 my_setenv_format(new_env, nam, nlen, val, vlen);
1530 (void)putenv(new_env);
1531 # endif /* HAS_UNSETENV */
1532 # endif /* __CYGWIN__ */
1533 #ifndef PERL_USE_SAFE_PUTENV
1539 #else /* WIN32 || NETWARE */
1542 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1545 register char *envstr;
1546 const int nlen = strlen(nam);
1553 Newx(envstr, nlen+vlen+2, char);
1554 my_setenv_format(envstr, nam, nlen, val, vlen);
1555 (void)PerlEnv_putenv(envstr);
1559 #endif /* WIN32 || NETWARE */
1563 Perl_setenv_getix(pTHX_ const char *nam)
1566 const register I32 len = strlen(nam);
1568 for (i = 0; environ[i]; i++) {
1571 strnicmp(environ[i],nam,len) == 0
1573 strnEQ(environ[i],nam,len)
1575 && environ[i][len] == '=')
1576 break; /* strnEQ must come first to avoid */
1577 } /* potential SEGV's */
1580 #endif /* !PERL_MICRO */
1582 #endif /* !VMS && !EPOC*/
1584 #ifdef UNLINK_ALL_VERSIONS
1586 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1590 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1595 /* this is a drop-in replacement for bcopy() */
1596 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1598 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1600 char * const retval = to;
1602 if (from - to >= 0) {
1610 *(--to) = *(--from);
1616 /* this is a drop-in replacement for memset() */
1619 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1621 char * const retval = loc;
1629 /* this is a drop-in replacement for bzero() */
1630 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1632 Perl_my_bzero(register char *loc, register I32 len)
1634 char * const retval = loc;
1642 /* this is a drop-in replacement for memcmp() */
1643 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1645 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1647 register const U8 *a = (const U8 *)s1;
1648 register const U8 *b = (const U8 *)s2;
1652 if ((tmp = *a++ - *b++))
1657 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1661 #ifdef USE_CHAR_VSPRINTF
1666 vsprintf(char *dest, const char *pat, char *args)
1670 fakebuf._ptr = dest;
1671 fakebuf._cnt = 32767;
1675 fakebuf._flag = _IOWRT|_IOSTRG;
1676 _doprnt(pat, args, &fakebuf); /* what a kludge */
1677 (void)putc('\0', &fakebuf);
1678 #ifdef USE_CHAR_VSPRINTF
1681 return 0; /* perl doesn't use return value */
1685 #endif /* HAS_VPRINTF */
1688 #if BYTEORDER != 0x4321
1690 Perl_my_swap(pTHX_ short s)
1692 #if (BYTEORDER & 1) == 0
1695 result = ((s & 255) << 8) + ((s >> 8) & 255);
1703 Perl_my_htonl(pTHX_ long l)
1707 char c[sizeof(long)];
1710 #if BYTEORDER == 0x1234
1711 u.c[0] = (l >> 24) & 255;
1712 u.c[1] = (l >> 16) & 255;
1713 u.c[2] = (l >> 8) & 255;
1717 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1718 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1723 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1724 u.c[o & 0xf] = (l >> s) & 255;
1732 Perl_my_ntohl(pTHX_ long l)
1736 char c[sizeof(long)];
1739 #if BYTEORDER == 0x1234
1740 u.c[0] = (l >> 24) & 255;
1741 u.c[1] = (l >> 16) & 255;
1742 u.c[2] = (l >> 8) & 255;
1746 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1747 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1754 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1755 l |= (u.c[o & 0xf] & 255) << s;
1762 #endif /* BYTEORDER != 0x4321 */
1766 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1767 * If these functions are defined,
1768 * the BYTEORDER is neither 0x1234 nor 0x4321.
1769 * However, this is not assumed.
1773 #define HTOLE(name,type) \
1775 name (register type n) \
1779 char c[sizeof(type)]; \
1782 register I32 s = 0; \
1783 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1784 u.c[i] = (n >> s) & 0xFF; \
1789 #define LETOH(name,type) \
1791 name (register type n) \
1795 char c[sizeof(type)]; \
1798 register I32 s = 0; \
1801 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1802 n |= ((type)(u.c[i] & 0xFF)) << s; \
1808 * Big-endian byte order functions.
1811 #define HTOBE(name,type) \
1813 name (register type n) \
1817 char c[sizeof(type)]; \
1820 register I32 s = 8*(sizeof(u.c)-1); \
1821 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1822 u.c[i] = (n >> s) & 0xFF; \
1827 #define BETOH(name,type) \
1829 name (register type n) \
1833 char c[sizeof(type)]; \
1836 register I32 s = 8*(sizeof(u.c)-1); \
1839 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1840 n |= ((type)(u.c[i] & 0xFF)) << s; \
1846 * If we just can't do it...
1849 #define NOT_AVAIL(name,type) \
1851 name (register type n) \
1853 Perl_croak_nocontext(#name "() not available"); \
1854 return n; /* not reached */ \
1858 #if defined(HAS_HTOVS) && !defined(htovs)
1861 #if defined(HAS_HTOVL) && !defined(htovl)
1864 #if defined(HAS_VTOHS) && !defined(vtohs)
1867 #if defined(HAS_VTOHL) && !defined(vtohl)
1871 #ifdef PERL_NEED_MY_HTOLE16
1873 HTOLE(Perl_my_htole16,U16)
1875 NOT_AVAIL(Perl_my_htole16,U16)
1878 #ifdef PERL_NEED_MY_LETOH16
1880 LETOH(Perl_my_letoh16,U16)
1882 NOT_AVAIL(Perl_my_letoh16,U16)
1885 #ifdef PERL_NEED_MY_HTOBE16
1887 HTOBE(Perl_my_htobe16,U16)
1889 NOT_AVAIL(Perl_my_htobe16,U16)
1892 #ifdef PERL_NEED_MY_BETOH16
1894 BETOH(Perl_my_betoh16,U16)
1896 NOT_AVAIL(Perl_my_betoh16,U16)
1900 #ifdef PERL_NEED_MY_HTOLE32
1902 HTOLE(Perl_my_htole32,U32)
1904 NOT_AVAIL(Perl_my_htole32,U32)
1907 #ifdef PERL_NEED_MY_LETOH32
1909 LETOH(Perl_my_letoh32,U32)
1911 NOT_AVAIL(Perl_my_letoh32,U32)
1914 #ifdef PERL_NEED_MY_HTOBE32
1916 HTOBE(Perl_my_htobe32,U32)
1918 NOT_AVAIL(Perl_my_htobe32,U32)
1921 #ifdef PERL_NEED_MY_BETOH32
1923 BETOH(Perl_my_betoh32,U32)
1925 NOT_AVAIL(Perl_my_betoh32,U32)
1929 #ifdef PERL_NEED_MY_HTOLE64
1931 HTOLE(Perl_my_htole64,U64)
1933 NOT_AVAIL(Perl_my_htole64,U64)
1936 #ifdef PERL_NEED_MY_LETOH64
1938 LETOH(Perl_my_letoh64,U64)
1940 NOT_AVAIL(Perl_my_letoh64,U64)
1943 #ifdef PERL_NEED_MY_HTOBE64
1945 HTOBE(Perl_my_htobe64,U64)
1947 NOT_AVAIL(Perl_my_htobe64,U64)
1950 #ifdef PERL_NEED_MY_BETOH64
1952 BETOH(Perl_my_betoh64,U64)
1954 NOT_AVAIL(Perl_my_betoh64,U64)
1958 #ifdef PERL_NEED_MY_HTOLES
1959 HTOLE(Perl_my_htoles,short)
1961 #ifdef PERL_NEED_MY_LETOHS
1962 LETOH(Perl_my_letohs,short)
1964 #ifdef PERL_NEED_MY_HTOBES
1965 HTOBE(Perl_my_htobes,short)
1967 #ifdef PERL_NEED_MY_BETOHS
1968 BETOH(Perl_my_betohs,short)
1971 #ifdef PERL_NEED_MY_HTOLEI
1972 HTOLE(Perl_my_htolei,int)
1974 #ifdef PERL_NEED_MY_LETOHI
1975 LETOH(Perl_my_letohi,int)
1977 #ifdef PERL_NEED_MY_HTOBEI
1978 HTOBE(Perl_my_htobei,int)
1980 #ifdef PERL_NEED_MY_BETOHI
1981 BETOH(Perl_my_betohi,int)
1984 #ifdef PERL_NEED_MY_HTOLEL
1985 HTOLE(Perl_my_htolel,long)
1987 #ifdef PERL_NEED_MY_LETOHL
1988 LETOH(Perl_my_letohl,long)
1990 #ifdef PERL_NEED_MY_HTOBEL
1991 HTOBE(Perl_my_htobel,long)
1993 #ifdef PERL_NEED_MY_BETOHL
1994 BETOH(Perl_my_betohl,long)
1998 Perl_my_swabn(void *ptr, int n)
2000 register char *s = (char *)ptr;
2001 register char *e = s + (n-1);
2004 for (n /= 2; n > 0; s++, e--, n--) {
2012 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2014 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2016 register I32 This, that;
2022 PERL_FLUSHALL_FOR_CHILD;
2023 This = (*mode == 'w');
2027 taint_proper("Insecure %s%s", "EXEC");
2029 if (PerlProc_pipe(p) < 0)
2031 /* Try for another pipe pair for error return */
2032 if (PerlProc_pipe(pp) >= 0)
2034 while ((pid = PerlProc_fork()) < 0) {
2035 if (errno != EAGAIN) {
2036 PerlLIO_close(p[This]);
2037 PerlLIO_close(p[that]);
2039 PerlLIO_close(pp[0]);
2040 PerlLIO_close(pp[1]);
2052 /* Close parent's end of error status pipe (if any) */
2054 PerlLIO_close(pp[0]);
2055 #if defined(HAS_FCNTL) && defined(F_SETFD)
2056 /* Close error pipe automatically if exec works */
2057 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2060 /* Now dup our end of _the_ pipe to right position */
2061 if (p[THIS] != (*mode == 'r')) {
2062 PerlLIO_dup2(p[THIS], *mode == 'r');
2063 PerlLIO_close(p[THIS]);
2064 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2065 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2068 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2069 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2070 /* No automatic close - do it by hand */
2077 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2083 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2089 do_execfree(); /* free any memory malloced by child on fork */
2091 PerlLIO_close(pp[1]);
2092 /* Keep the lower of the two fd numbers */
2093 if (p[that] < p[This]) {
2094 PerlLIO_dup2(p[This], p[that]);
2095 PerlLIO_close(p[This]);
2099 PerlLIO_close(p[that]); /* close child's end of pipe */
2102 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2104 SvUPGRADE(sv,SVt_IV);
2106 PL_forkprocess = pid;
2107 /* If we managed to get status pipe check for exec fail */
2108 if (did_pipes && pid > 0) {
2112 while (n < sizeof(int)) {
2113 n1 = PerlLIO_read(pp[0],
2114 (void*)(((char*)&errkid)+n),
2120 PerlLIO_close(pp[0]);
2122 if (n) { /* Error */
2124 PerlLIO_close(p[This]);
2125 if (n != sizeof(int))
2126 Perl_croak(aTHX_ "panic: kid popen errno read");
2128 pid2 = wait4pid(pid, &status, 0);
2129 } while (pid2 == -1 && errno == EINTR);
2130 errno = errkid; /* Propagate errno from kid */
2135 PerlLIO_close(pp[0]);
2136 return PerlIO_fdopen(p[This], mode);
2138 Perl_croak(aTHX_ "List form of piped open not implemented");
2139 return (PerlIO *) NULL;
2143 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2144 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2146 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2149 register I32 This, that;
2152 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2156 PERL_FLUSHALL_FOR_CHILD;
2159 return my_syspopen(aTHX_ cmd,mode);
2162 This = (*mode == 'w');
2164 if (doexec && PL_tainting) {
2166 taint_proper("Insecure %s%s", "EXEC");
2168 if (PerlProc_pipe(p) < 0)
2170 if (doexec && PerlProc_pipe(pp) >= 0)
2172 while ((pid = PerlProc_fork()) < 0) {
2173 if (errno != EAGAIN) {
2174 PerlLIO_close(p[This]);
2175 PerlLIO_close(p[that]);
2177 PerlLIO_close(pp[0]);
2178 PerlLIO_close(pp[1]);
2181 Perl_croak(aTHX_ "Can't fork");
2194 PerlLIO_close(pp[0]);
2195 #if defined(HAS_FCNTL) && defined(F_SETFD)
2196 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2199 if (p[THIS] != (*mode == 'r')) {
2200 PerlLIO_dup2(p[THIS], *mode == 'r');
2201 PerlLIO_close(p[THIS]);
2202 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2203 PerlLIO_close(p[THAT]);
2206 PerlLIO_close(p[THAT]);
2209 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2216 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2221 /* may or may not use the shell */
2222 do_exec3(cmd, pp[1], did_pipes);
2225 #endif /* defined OS2 */
2226 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2227 SvREADONLY_off(GvSV(tmpgv));
2228 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2229 SvREADONLY_on(GvSV(tmpgv));
2231 #ifdef THREADS_HAVE_PIDS
2232 PL_ppid = (IV)getppid();
2235 hv_clear(PL_pidstatus); /* we have no children */
2240 do_execfree(); /* free any memory malloced by child on vfork */
2242 PerlLIO_close(pp[1]);
2243 if (p[that] < p[This]) {
2244 PerlLIO_dup2(p[This], p[that]);
2245 PerlLIO_close(p[This]);
2249 PerlLIO_close(p[that]);
2252 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2254 SvUPGRADE(sv,SVt_IV);
2256 PL_forkprocess = pid;
2257 if (did_pipes && pid > 0) {
2261 while (n < sizeof(int)) {
2262 n1 = PerlLIO_read(pp[0],
2263 (void*)(((char*)&errkid)+n),
2269 PerlLIO_close(pp[0]);
2271 if (n) { /* Error */
2273 PerlLIO_close(p[This]);
2274 if (n != sizeof(int))
2275 Perl_croak(aTHX_ "panic: kid popen errno read");
2277 pid2 = wait4pid(pid, &status, 0);
2278 } while (pid2 == -1 && errno == EINTR);
2279 errno = errkid; /* Propagate errno from kid */
2284 PerlLIO_close(pp[0]);
2285 return PerlIO_fdopen(p[This], mode);
2288 #if defined(atarist) || defined(EPOC)
2291 Perl_my_popen(pTHX_ char *cmd, char *mode)
2293 PERL_FLUSHALL_FOR_CHILD;
2294 /* Call system's popen() to get a FILE *, then import it.
2295 used 0 for 2nd parameter to PerlIO_importFILE;
2298 return PerlIO_importFILE(popen(cmd, mode), 0);
2302 FILE *djgpp_popen();
2304 Perl_my_popen(pTHX_ char *cmd, char *mode)
2306 PERL_FLUSHALL_FOR_CHILD;
2307 /* Call system's popen() to get a FILE *, then import it.
2308 used 0 for 2nd parameter to PerlIO_importFILE;
2311 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2316 #endif /* !DOSISH */
2318 /* this is called in parent before the fork() */
2320 Perl_atfork_lock(void)
2323 #if defined(USE_ITHREADS)
2324 /* locks must be held in locking order (if any) */
2326 MUTEX_LOCK(&PL_malloc_mutex);
2332 /* this is called in both parent and child after the fork() */
2334 Perl_atfork_unlock(void)
2337 #if defined(USE_ITHREADS)
2338 /* locks must be released in same order as in atfork_lock() */
2340 MUTEX_UNLOCK(&PL_malloc_mutex);
2349 #if defined(HAS_FORK)
2351 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2356 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2357 * handlers elsewhere in the code */
2362 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2363 Perl_croak_nocontext("fork() not available");
2365 #endif /* HAS_FORK */
2370 Perl_dump_fds(pTHX_ char *s)
2375 PerlIO_printf(Perl_debug_log,"%s", s);
2376 for (fd = 0; fd < 32; fd++) {
2377 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2378 PerlIO_printf(Perl_debug_log," %d",fd);
2380 PerlIO_printf(Perl_debug_log,"\n");
2383 #endif /* DUMP_FDS */
2387 dup2(int oldfd, int newfd)
2389 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2392 PerlLIO_close(newfd);
2393 return fcntl(oldfd, F_DUPFD, newfd);
2395 #define DUP2_MAX_FDS 256
2396 int fdtmp[DUP2_MAX_FDS];
2402 PerlLIO_close(newfd);
2403 /* good enough for low fd's... */
2404 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2405 if (fdx >= DUP2_MAX_FDS) {
2413 PerlLIO_close(fdtmp[--fdx]);
2420 #ifdef HAS_SIGACTION
2422 #ifdef MACOS_TRADITIONAL
2423 /* We don't want restart behavior on MacOS */
2428 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2431 struct sigaction act, oact;
2434 /* only "parent" interpreter can diddle signals */
2435 if (PL_curinterp != aTHX)
2436 return (Sighandler_t) SIG_ERR;
2439 act.sa_handler = (void(*)(int))handler;
2440 sigemptyset(&act.sa_mask);
2443 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2444 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2446 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2447 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2448 act.sa_flags |= SA_NOCLDWAIT;
2450 if (sigaction(signo, &act, &oact) == -1)
2451 return (Sighandler_t) SIG_ERR;
2453 return (Sighandler_t) oact.sa_handler;
2457 Perl_rsignal_state(pTHX_ int signo)
2459 struct sigaction oact;
2461 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2462 return (Sighandler_t) SIG_ERR;
2464 return (Sighandler_t) oact.sa_handler;
2468 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2471 struct sigaction act;
2474 /* only "parent" interpreter can diddle signals */
2475 if (PL_curinterp != aTHX)
2479 act.sa_handler = (void(*)(int))handler;
2480 sigemptyset(&act.sa_mask);
2483 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2484 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2486 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2487 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2488 act.sa_flags |= SA_NOCLDWAIT;
2490 return sigaction(signo, &act, save);
2494 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2498 /* only "parent" interpreter can diddle signals */
2499 if (PL_curinterp != aTHX)
2503 return sigaction(signo, save, (struct sigaction *)NULL);
2506 #else /* !HAS_SIGACTION */
2509 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2511 #if defined(USE_ITHREADS) && !defined(WIN32)
2512 /* only "parent" interpreter can diddle signals */
2513 if (PL_curinterp != aTHX)
2514 return (Sighandler_t) SIG_ERR;
2517 return PerlProc_signal(signo, handler);
2529 Perl_rsignal_state(pTHX_ int signo)
2532 Sighandler_t oldsig;
2534 #if defined(USE_ITHREADS) && !defined(WIN32)
2535 /* only "parent" interpreter can diddle signals */
2536 if (PL_curinterp != aTHX)
2537 return (Sighandler_t) SIG_ERR;
2541 oldsig = PerlProc_signal(signo, sig_trap);
2542 PerlProc_signal(signo, oldsig);
2544 PerlProc_kill(PerlProc_getpid(), signo);
2549 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2551 #if defined(USE_ITHREADS) && !defined(WIN32)
2552 /* only "parent" interpreter can diddle signals */
2553 if (PL_curinterp != aTHX)
2556 *save = PerlProc_signal(signo, handler);
2557 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2561 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2563 #if defined(USE_ITHREADS) && !defined(WIN32)
2564 /* only "parent" interpreter can diddle signals */
2565 if (PL_curinterp != aTHX)
2568 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2571 #endif /* !HAS_SIGACTION */
2572 #endif /* !PERL_MICRO */
2574 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2575 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2577 Perl_my_pclose(pTHX_ PerlIO *ptr)
2579 Sigsave_t hstat, istat, qstat;
2585 int saved_errno = 0;
2587 int saved_win32_errno;
2591 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2593 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2595 *svp = &PL_sv_undef;
2597 if (pid == -1) { /* Opened by popen. */
2598 return my_syspclose(ptr);
2601 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2602 saved_errno = errno;
2604 saved_win32_errno = GetLastError();
2608 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2611 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2612 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2613 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2616 pid2 = wait4pid(pid, &status, 0);
2617 } while (pid2 == -1 && errno == EINTR);
2619 rsignal_restore(SIGHUP, &hstat);
2620 rsignal_restore(SIGINT, &istat);
2621 rsignal_restore(SIGQUIT, &qstat);
2624 SETERRNO(saved_errno, 0);
2627 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2629 #endif /* !DOSISH */
2631 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2633 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2638 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2640 char spid[TYPE_CHARS(IV)];
2644 sprintf(spid, "%"IVdf, (IV)pid);
2645 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2646 if (svp && *svp != &PL_sv_undef) {
2647 *statusp = SvIVX(*svp);
2648 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2655 hv_iterinit(PL_pidstatus);
2656 if ((entry = hv_iternext(PL_pidstatus))) {
2657 SV *sv = hv_iterval(PL_pidstatus,entry);
2659 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2660 *statusp = SvIVX(sv);
2661 sprintf(spid, "%"IVdf, (IV)pid);
2662 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2669 # ifdef HAS_WAITPID_RUNTIME
2670 if (!HAS_WAITPID_RUNTIME)
2673 result = PerlProc_waitpid(pid,statusp,flags);
2676 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2677 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2680 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2681 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2686 Perl_croak(aTHX_ "Can't do waitpid with flags");
2688 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2689 pidgone(result,*statusp);
2695 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2698 if (result < 0 && errno == EINTR) {
2703 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2706 Perl_pidgone(pTHX_ Pid_t pid, int status)
2709 char spid[TYPE_CHARS(IV)];
2711 sprintf(spid, "%"IVdf, (IV)pid);
2712 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2713 SvUPGRADE(sv,SVt_IV);
2714 SvIV_set(sv, status);
2718 #if defined(atarist) || defined(OS2) || defined(EPOC)
2721 int /* Cannot prototype with I32
2723 my_syspclose(PerlIO *ptr)
2726 Perl_my_pclose(pTHX_ PerlIO *ptr)
2729 /* Needs work for PerlIO ! */
2730 FILE *f = PerlIO_findFILE(ptr);
2731 I32 result = pclose(f);
2732 PerlIO_releaseFILE(ptr,f);
2740 Perl_my_pclose(pTHX_ PerlIO *ptr)
2742 /* Needs work for PerlIO ! */
2743 FILE *f = PerlIO_findFILE(ptr);
2744 I32 result = djgpp_pclose(f);
2745 result = (result << 8) & 0xff00;
2746 PerlIO_releaseFILE(ptr,f);
2752 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2755 register const char *frombase = from;
2758 register const char c = *from;
2763 while (count-- > 0) {
2764 for (todo = len; todo > 0; todo--) {
2773 Perl_same_dirent(pTHX_ const char *a, const char *b)
2775 char *fa = strrchr(a,'/');
2776 char *fb = strrchr(b,'/');
2779 SV *tmpsv = sv_newmortal();
2792 sv_setpvn(tmpsv, ".", 1);
2794 sv_setpvn(tmpsv, a, fa - a);
2795 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2798 sv_setpvn(tmpsv, ".", 1);
2800 sv_setpvn(tmpsv, b, fb - b);
2801 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2803 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2804 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2806 #endif /* !HAS_RENAME */
2809 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2810 const char *const *const search_ext, I32 flags)
2812 const char *xfound = Nullch;
2813 char *xfailed = Nullch;
2814 char tmpbuf[MAXPATHLEN];
2818 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2819 # define SEARCH_EXTS ".bat", ".cmd", NULL
2820 # define MAX_EXT_LEN 4
2823 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2824 # define MAX_EXT_LEN 4
2827 # define SEARCH_EXTS ".pl", ".com", NULL
2828 # define MAX_EXT_LEN 4
2830 /* additional extensions to try in each dir if scriptname not found */
2832 const char *const exts[] = { SEARCH_EXTS };
2833 const char *const *const ext = search_ext ? search_ext : exts;
2834 int extidx = 0, i = 0;
2835 const char *curext = Nullch;
2837 PERL_UNUSED_ARG(search_ext);
2838 # define MAX_EXT_LEN 0
2842 * If dosearch is true and if scriptname does not contain path
2843 * delimiters, search the PATH for scriptname.
2845 * If SEARCH_EXTS is also defined, will look for each
2846 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2847 * while searching the PATH.
2849 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2850 * proceeds as follows:
2851 * If DOSISH or VMSISH:
2852 * + look for ./scriptname{,.foo,.bar}
2853 * + search the PATH for scriptname{,.foo,.bar}
2856 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2857 * this will not look in '.' if it's not in the PATH)
2862 # ifdef ALWAYS_DEFTYPES
2863 len = strlen(scriptname);
2864 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2865 int hasdir, idx = 0, deftypes = 1;
2868 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2871 int hasdir, idx = 0, deftypes = 1;
2874 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2876 /* The first time through, just add SEARCH_EXTS to whatever we
2877 * already have, so we can check for default file types. */
2879 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2885 if ((strlen(tmpbuf) + strlen(scriptname)
2886 + MAX_EXT_LEN) >= sizeof tmpbuf)
2887 continue; /* don't search dir with too-long name */
2888 strcat(tmpbuf, scriptname);
2892 if (strEQ(scriptname, "-"))
2894 if (dosearch) { /* Look in '.' first. */
2895 const char *cur = scriptname;
2897 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2899 if (strEQ(ext[i++],curext)) {
2900 extidx = -1; /* already has an ext */
2905 DEBUG_p(PerlIO_printf(Perl_debug_log,
2906 "Looking for %s\n",cur));
2907 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2908 && !S_ISDIR(PL_statbuf.st_mode)) {
2916 if (cur == scriptname) {
2917 len = strlen(scriptname);
2918 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2920 /* FIXME? Convert to memcpy */
2921 cur = strcpy(tmpbuf, scriptname);
2923 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2924 && strcpy(tmpbuf+len, ext[extidx++]));
2929 #ifdef MACOS_TRADITIONAL
2930 if (dosearch && !strchr(scriptname, ':') &&
2931 (s = PerlEnv_getenv("Commands")))
2933 if (dosearch && !strchr(scriptname, '/')
2935 && !strchr(scriptname, '\\')
2937 && (s = PerlEnv_getenv("PATH")))
2942 PL_bufend = s + strlen(s);
2943 while (s < PL_bufend) {
2944 #ifdef MACOS_TRADITIONAL
2945 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2949 #if defined(atarist) || defined(DOSISH)
2954 && *s != ';'; len++, s++) {
2955 if (len < sizeof tmpbuf)
2958 if (len < sizeof tmpbuf)
2960 #else /* ! (atarist || DOSISH) */
2961 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2964 #endif /* ! (atarist || DOSISH) */
2965 #endif /* MACOS_TRADITIONAL */
2968 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2969 continue; /* don't search dir with too-long name */
2970 #ifdef MACOS_TRADITIONAL
2971 if (len && tmpbuf[len - 1] != ':')
2972 tmpbuf[len++] = ':';
2975 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2976 && tmpbuf[len - 1] != '/'
2977 && tmpbuf[len - 1] != '\\'
2980 tmpbuf[len++] = '/';
2981 if (len == 2 && tmpbuf[0] == '.')
2984 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2986 (void)strcpy(tmpbuf + len, scriptname);
2990 len = strlen(tmpbuf);
2991 if (extidx > 0) /* reset after previous loop */
2995 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2996 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2997 if (S_ISDIR(PL_statbuf.st_mode)) {
3001 } while ( retval < 0 /* not there */
3002 && extidx>=0 && ext[extidx] /* try an extension? */
3003 && strcpy(tmpbuf+len, ext[extidx++])
3008 if (S_ISREG(PL_statbuf.st_mode)
3009 && cando(S_IRUSR,TRUE,&PL_statbuf)
3010 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3011 && cando(S_IXUSR,TRUE,&PL_statbuf)
3015 xfound = tmpbuf; /* bingo! */
3019 xfailed = savepv(tmpbuf);
3022 if (!xfound && !seen_dot && !xfailed &&
3023 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3024 || S_ISDIR(PL_statbuf.st_mode)))
3026 seen_dot = 1; /* Disable message. */
3028 if (flags & 1) { /* do or die? */
3029 Perl_croak(aTHX_ "Can't %s %s%s%s",
3030 (xfailed ? "execute" : "find"),
3031 (xfailed ? xfailed : scriptname),
3032 (xfailed ? "" : " on PATH"),
3033 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3035 scriptname = Nullch;
3038 scriptname = xfound;
3040 return (scriptname ? savepv(scriptname) : Nullch);
3043 #ifndef PERL_GET_CONTEXT_DEFINED
3046 Perl_get_context(void)
3049 #if defined(USE_ITHREADS)
3050 # ifdef OLD_PTHREADS_API
3052 if (pthread_getspecific(PL_thr_key, &t))
3053 Perl_croak_nocontext("panic: pthread_getspecific");
3056 # ifdef I_MACH_CTHREADS
3057 return (void*)cthread_data(cthread_self());
3059 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3068 Perl_set_context(void *t)
3071 #if defined(USE_ITHREADS)
3072 # ifdef I_MACH_CTHREADS
3073 cthread_set_data(cthread_self(), t);
3075 if (pthread_setspecific(PL_thr_key, t))
3076 Perl_croak_nocontext("panic: pthread_setspecific");
3083 #endif /* !PERL_GET_CONTEXT_DEFINED */
3085 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3094 Perl_get_op_names(pTHX)
3096 return (char **)PL_op_name;
3100 Perl_get_op_descs(pTHX)
3102 return (char **)PL_op_desc;
3106 Perl_get_no_modify(pTHX)
3108 return PL_no_modify;
3112 Perl_get_opargs(pTHX)
3114 return (U32 *)PL_opargs;
3118 Perl_get_ppaddr(pTHX)
3121 return (PPADDR_t*)PL_ppaddr;
3124 #ifndef HAS_GETENV_LEN
3126 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3128 char * const env_trans = PerlEnv_getenv(env_elem);
3130 *len = strlen(env_trans);
3137 Perl_get_vtbl(pTHX_ int vtbl_id)
3139 const MGVTBL* result = Null(MGVTBL*);
3143 result = &PL_vtbl_sv;
3146 result = &PL_vtbl_env;
3148 case want_vtbl_envelem:
3149 result = &PL_vtbl_envelem;
3152 result = &PL_vtbl_sig;
3154 case want_vtbl_sigelem:
3155 result = &PL_vtbl_sigelem;
3157 case want_vtbl_pack:
3158 result = &PL_vtbl_pack;
3160 case want_vtbl_packelem:
3161 result = &PL_vtbl_packelem;
3163 case want_vtbl_dbline:
3164 result = &PL_vtbl_dbline;
3167 result = &PL_vtbl_isa;
3169 case want_vtbl_isaelem:
3170 result = &PL_vtbl_isaelem;
3172 case want_vtbl_arylen:
3173 result = &PL_vtbl_arylen;
3175 case want_vtbl_glob:
3176 result = &PL_vtbl_glob;
3178 case want_vtbl_mglob:
3179 result = &PL_vtbl_mglob;
3181 case want_vtbl_nkeys:
3182 result = &PL_vtbl_nkeys;
3184 case want_vtbl_taint:
3185 result = &PL_vtbl_taint;
3187 case want_vtbl_substr:
3188 result = &PL_vtbl_substr;
3191 result = &PL_vtbl_vec;
3194 result = &PL_vtbl_pos;
3197 result = &PL_vtbl_bm;
3200 result = &PL_vtbl_fm;
3202 case want_vtbl_uvar:
3203 result = &PL_vtbl_uvar;
3205 case want_vtbl_defelem:
3206 result = &PL_vtbl_defelem;
3208 case want_vtbl_regexp:
3209 result = &PL_vtbl_regexp;
3211 case want_vtbl_regdata:
3212 result = &PL_vtbl_regdata;
3214 case want_vtbl_regdatum:
3215 result = &PL_vtbl_regdatum;
3217 #ifdef USE_LOCALE_COLLATE
3218 case want_vtbl_collxfrm:
3219 result = &PL_vtbl_collxfrm;
3222 case want_vtbl_amagic:
3223 result = &PL_vtbl_amagic;
3225 case want_vtbl_amagicelem:
3226 result = &PL_vtbl_amagicelem;
3228 case want_vtbl_backref:
3229 result = &PL_vtbl_backref;
3231 case want_vtbl_utf8:
3232 result = &PL_vtbl_utf8;
3235 return (MGVTBL*)result;
3239 Perl_my_fflush_all(pTHX)
3241 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3242 return PerlIO_flush(NULL);
3244 # if defined(HAS__FWALK)
3245 extern int fflush(FILE *);
3246 /* undocumented, unprototyped, but very useful BSDism */
3247 extern void _fwalk(int (*)(FILE *));
3251 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3253 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3254 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3256 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3257 open_max = sysconf(_SC_OPEN_MAX);
3260 open_max = FOPEN_MAX;
3263 open_max = OPEN_MAX;
3274 for (i = 0; i < open_max; i++)
3275 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3276 STDIO_STREAM_ARRAY[i]._file < open_max &&
3277 STDIO_STREAM_ARRAY[i]._flag)
3278 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3282 SETERRNO(EBADF,RMS_IFI);
3289 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3291 const char * const func =
3292 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3293 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3295 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3296 const char * const type = OP_IS_SOCKET(op)
3297 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3298 ? "socket" : "filehandle";
3299 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3301 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3302 if (ckWARN(WARN_IO)) {
3303 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3305 Perl_warner(aTHX_ packWARN(WARN_IO),
3306 "Filehandle %s opened only for %sput",
3309 Perl_warner(aTHX_ packWARN(WARN_IO),
3310 "Filehandle opened only for %sput", direction);
3317 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3319 warn_type = WARN_CLOSED;
3323 warn_type = WARN_UNOPENED;
3326 if (ckWARN(warn_type)) {
3327 if (name && *name) {
3328 Perl_warner(aTHX_ packWARN(warn_type),
3329 "%s%s on %s %s %s", func, pars, vile, type, name);
3330 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3332 aTHX_ packWARN(warn_type),
3333 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3338 Perl_warner(aTHX_ packWARN(warn_type),
3339 "%s%s on %s %s", func, pars, vile, type);
3340 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3342 aTHX_ packWARN(warn_type),
3343 "\t(Are you trying to call %s%s on dirhandle?)\n",
3352 /* in ASCII order, not that it matters */
3353 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3356 Perl_ebcdic_control(pTHX_ int ch)
3364 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3365 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3368 if (ctlp == controllablechars)
3369 return('\177'); /* DEL */
3371 return((unsigned char)(ctlp - controllablechars - 1));
3372 } else { /* Want uncontrol */
3373 if (ch == '\177' || ch == -1)
3375 else if (ch == '\157')
3377 else if (ch == '\174')
3379 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3381 else if (ch == '\155')
3383 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3384 return(controllablechars[ch+1]);
3386 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3391 /* To workaround core dumps from the uninitialised tm_zone we get the
3392 * system to give us a reasonable struct to copy. This fix means that
3393 * strftime uses the tm_zone and tm_gmtoff values returned by
3394 * localtime(time()). That should give the desired result most of the
3395 * time. But probably not always!
3397 * This does not address tzname aspects of NETaa14816.
3402 # ifndef STRUCT_TM_HASZONE
3403 # define STRUCT_TM_HASZONE
3407 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3408 # ifndef HAS_TM_TM_ZONE
3409 # define HAS_TM_TM_ZONE
3414 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3416 #ifdef HAS_TM_TM_ZONE
3418 const struct tm* my_tm;
3420 my_tm = localtime(&now);
3422 Copy(my_tm, ptm, 1, struct tm);
3424 PERL_UNUSED_ARG(ptm);
3429 * mini_mktime - normalise struct tm values without the localtime()
3430 * semantics (and overhead) of mktime().
3433 Perl_mini_mktime(pTHX_ struct tm *ptm)
3437 int month, mday, year, jday;
3438 int odd_cent, odd_year;
3440 #define DAYS_PER_YEAR 365
3441 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3442 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3443 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3444 #define SECS_PER_HOUR (60*60)
3445 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3446 /* parentheses deliberately absent on these two, otherwise they don't work */
3447 #define MONTH_TO_DAYS 153/5
3448 #define DAYS_TO_MONTH 5/153
3449 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3450 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3451 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3452 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3455 * Year/day algorithm notes:
3457 * With a suitable offset for numeric value of the month, one can find
3458 * an offset into the year by considering months to have 30.6 (153/5) days,
3459 * using integer arithmetic (i.e., with truncation). To avoid too much
3460 * messing about with leap days, we consider January and February to be
3461 * the 13th and 14th month of the previous year. After that transformation,
3462 * we need the month index we use to be high by 1 from 'normal human' usage,
3463 * so the month index values we use run from 4 through 15.
3465 * Given that, and the rules for the Gregorian calendar (leap years are those
3466 * divisible by 4 unless also divisible by 100, when they must be divisible
3467 * by 400 instead), we can simply calculate the number of days since some
3468 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3469 * the days we derive from our month index, and adding in the day of the
3470 * month. The value used here is not adjusted for the actual origin which
3471 * it normally would use (1 January A.D. 1), since we're not exposing it.
3472 * We're only building the value so we can turn around and get the
3473 * normalised values for the year, month, day-of-month, and day-of-year.
3475 * For going backward, we need to bias the value we're using so that we find
3476 * the right year value. (Basically, we don't want the contribution of
3477 * March 1st to the number to apply while deriving the year). Having done
3478 * that, we 'count up' the contribution to the year number by accounting for
3479 * full quadracenturies (400-year periods) with their extra leap days, plus
3480 * the contribution from full centuries (to avoid counting in the lost leap
3481 * days), plus the contribution from full quad-years (to count in the normal
3482 * leap days), plus the leftover contribution from any non-leap years.
3483 * At this point, if we were working with an actual leap day, we'll have 0
3484 * days left over. This is also true for March 1st, however. So, we have
3485 * to special-case that result, and (earlier) keep track of the 'odd'
3486 * century and year contributions. If we got 4 extra centuries in a qcent,
3487 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3488 * Otherwise, we add back in the earlier bias we removed (the 123 from
3489 * figuring in March 1st), find the month index (integer division by 30.6),
3490 * and the remainder is the day-of-month. We then have to convert back to
3491 * 'real' months (including fixing January and February from being 14/15 in
3492 * the previous year to being in the proper year). After that, to get
3493 * tm_yday, we work with the normalised year and get a new yearday value for
3494 * January 1st, which we subtract from the yearday value we had earlier,
3495 * representing the date we've re-built. This is done from January 1
3496 * because tm_yday is 0-origin.
3498 * Since POSIX time routines are only guaranteed to work for times since the
3499 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3500 * applies Gregorian calendar rules even to dates before the 16th century
3501 * doesn't bother me. Besides, you'd need cultural context for a given
3502 * date to know whether it was Julian or Gregorian calendar, and that's
3503 * outside the scope for this routine. Since we convert back based on the
3504 * same rules we used to build the yearday, you'll only get strange results
3505 * for input which needed normalising, or for the 'odd' century years which
3506 * were leap years in the Julian calander but not in the Gregorian one.
3507 * I can live with that.
3509 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3510 * that's still outside the scope for POSIX time manipulation, so I don't
3514 year = 1900 + ptm->tm_year;
3515 month = ptm->tm_mon;
3516 mday = ptm->tm_mday;
3517 /* allow given yday with no month & mday to dominate the result */
3518 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3521 jday = 1 + ptm->tm_yday;
3530 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3531 yearday += month*MONTH_TO_DAYS + mday + jday;
3533 * Note that we don't know when leap-seconds were or will be,
3534 * so we have to trust the user if we get something which looks
3535 * like a sensible leap-second. Wild values for seconds will
3536 * be rationalised, however.
3538 if ((unsigned) ptm->tm_sec <= 60) {
3545 secs += 60 * ptm->tm_min;
3546 secs += SECS_PER_HOUR * ptm->tm_hour;
3548 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3549 /* got negative remainder, but need positive time */
3550 /* back off an extra day to compensate */
3551 yearday += (secs/SECS_PER_DAY)-1;
3552 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3555 yearday += (secs/SECS_PER_DAY);
3556 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3559 else if (secs >= SECS_PER_DAY) {
3560 yearday += (secs/SECS_PER_DAY);
3561 secs %= SECS_PER_DAY;
3563 ptm->tm_hour = secs/SECS_PER_HOUR;
3564 secs %= SECS_PER_HOUR;
3565 ptm->tm_min = secs/60;
3567 ptm->tm_sec += secs;
3568 /* done with time of day effects */
3570 * The algorithm for yearday has (so far) left it high by 428.
3571 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3572 * bias it by 123 while trying to figure out what year it
3573 * really represents. Even with this tweak, the reverse
3574 * translation fails for years before A.D. 0001.
3575 * It would still fail for Feb 29, but we catch that one below.
3577 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3578 yearday -= YEAR_ADJUST;
3579 year = (yearday / DAYS_PER_QCENT) * 400;
3580 yearday %= DAYS_PER_QCENT;
3581 odd_cent = yearday / DAYS_PER_CENT;
3582 year += odd_cent * 100;
3583 yearday %= DAYS_PER_CENT;
3584 year += (yearday / DAYS_PER_QYEAR) * 4;
3585 yearday %= DAYS_PER_QYEAR;
3586 odd_year = yearday / DAYS_PER_YEAR;
3588 yearday %= DAYS_PER_YEAR;
3589 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3594 yearday += YEAR_ADJUST; /* recover March 1st crock */
3595 month = yearday*DAYS_TO_MONTH;
3596 yearday -= month*MONTH_TO_DAYS;
3597 /* recover other leap-year adjustment */
3606 ptm->tm_year = year - 1900;
3608 ptm->tm_mday = yearday;
3609 ptm->tm_mon = month;
3613 ptm->tm_mon = month - 1;
3615 /* re-build yearday based on Jan 1 to get tm_yday */
3617 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3618 yearday += 14*MONTH_TO_DAYS + 1;
3619 ptm->tm_yday = jday - yearday;
3620 /* fix tm_wday if not overridden by caller */
3621 if ((unsigned)ptm->tm_wday > 6)
3622 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3626 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)
3634 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3637 mytm.tm_hour = hour;
3638 mytm.tm_mday = mday;
3640 mytm.tm_year = year;
3641 mytm.tm_wday = wday;
3642 mytm.tm_yday = yday;
3643 mytm.tm_isdst = isdst;
3645 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3646 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3651 #ifdef HAS_TM_TM_GMTOFF
3652 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3654 #ifdef HAS_TM_TM_ZONE
3655 mytm.tm_zone = mytm2.tm_zone;
3660 Newx(buf, buflen, char);
3661 len = strftime(buf, buflen, fmt, &mytm);
3663 ** The following is needed to handle to the situation where
3664 ** tmpbuf overflows. Basically we want to allocate a buffer
3665 ** and try repeatedly. The reason why it is so complicated
3666 ** is that getting a return value of 0 from strftime can indicate
3667 ** one of the following:
3668 ** 1. buffer overflowed,
3669 ** 2. illegal conversion specifier, or
3670 ** 3. the format string specifies nothing to be returned(not
3671 ** an error). This could be because format is an empty string
3672 ** or it specifies %p that yields an empty string in some locale.
3673 ** If there is a better way to make it portable, go ahead by
3676 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3679 /* Possibly buf overflowed - try again with a bigger buf */
3680 const int fmtlen = strlen(fmt);
3681 const int bufsize = fmtlen + buflen;
3683 Newx(buf, bufsize, char);
3685 buflen = strftime(buf, bufsize, fmt, &mytm);
3686 if (buflen > 0 && buflen < bufsize)
3688 /* heuristic to prevent out-of-memory errors */
3689 if (bufsize > 100*fmtlen) {
3694 Renew(buf, bufsize*2, char);
3699 Perl_croak(aTHX_ "panic: no strftime");
3705 #define SV_CWD_RETURN_UNDEF \
3706 sv_setsv(sv, &PL_sv_undef); \
3709 #define SV_CWD_ISDOT(dp) \
3710 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3711 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3714 =head1 Miscellaneous Functions
3716 =for apidoc getcwd_sv
3718 Fill the sv with current working directory
3723 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3724 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3725 * getcwd(3) if available
3726 * Comments from the orignal:
3727 * This is a faster version of getcwd. It's also more dangerous
3728 * because you might chdir out of a directory that you can't chdir
3732 Perl_getcwd_sv(pTHX_ register SV *sv)
3736 #ifndef INCOMPLETE_TAINTS
3742 char buf[MAXPATHLEN];
3744 /* Some getcwd()s automatically allocate a buffer of the given
3745 * size from the heap if they are given a NULL buffer pointer.
3746 * The problem is that this behaviour is not portable. */
3747 if (getcwd(buf, sizeof(buf) - 1)) {
3748 sv_setpvn(sv, buf, strlen(buf));
3752 sv_setsv(sv, &PL_sv_undef);
3760 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3764 SvUPGRADE(sv, SVt_PV);
3766 if (PerlLIO_lstat(".", &statbuf) < 0) {
3767 SV_CWD_RETURN_UNDEF;
3770 orig_cdev = statbuf.st_dev;
3771 orig_cino = statbuf.st_ino;
3780 if (PerlDir_chdir("..") < 0) {
3781 SV_CWD_RETURN_UNDEF;
3783 if (PerlLIO_stat(".", &statbuf) < 0) {
3784 SV_CWD_RETURN_UNDEF;
3787 cdev = statbuf.st_dev;
3788 cino = statbuf.st_ino;
3790 if (odev == cdev && oino == cino) {
3793 if (!(dir = PerlDir_open("."))) {
3794 SV_CWD_RETURN_UNDEF;
3797 while ((dp = PerlDir_read(dir)) != NULL) {
3799 const int namelen = dp->d_namlen;
3801 const int namelen = strlen(dp->d_name);
3804 if (SV_CWD_ISDOT(dp)) {
3808 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3809 SV_CWD_RETURN_UNDEF;
3812 tdev = statbuf.st_dev;
3813 tino = statbuf.st_ino;
3814 if (tino == oino && tdev == odev) {
3820 SV_CWD_RETURN_UNDEF;
3823 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3824 SV_CWD_RETURN_UNDEF;
3827 SvGROW(sv, pathlen + namelen + 1);
3831 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3834 /* prepend current directory to the front */
3836 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3837 pathlen += (namelen + 1);
3839 #ifdef VOID_CLOSEDIR
3842 if (PerlDir_close(dir) < 0) {
3843 SV_CWD_RETURN_UNDEF;
3849 SvCUR_set(sv, pathlen);
3853 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3854 SV_CWD_RETURN_UNDEF;
3857 if (PerlLIO_stat(".", &statbuf) < 0) {
3858 SV_CWD_RETURN_UNDEF;
3861 cdev = statbuf.st_dev;
3862 cino = statbuf.st_ino;
3864 if (cdev != orig_cdev || cino != orig_cino) {
3865 Perl_croak(aTHX_ "Unstable directory path, "
3866 "current directory changed unexpectedly");
3878 =for apidoc scan_version
3880 Returns a pointer to the next character after the parsed
3881 version string, as well as upgrading the passed in SV to
3884 Function must be called with an already existing SV like
3887 s = scan_version(s,SV *sv, bool qv);
3889 Performs some preprocessing to the string to ensure that
3890 it has the correct characteristics of a version. Flags the
3891 object if it contains an underscore (which denotes this
3892 is a alpha version). The boolean qv denotes that the version
3893 should be interpreted as if it had multiple decimals, even if
3900 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3909 SV *hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3910 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3912 #ifndef NODEFAULT_SHAREKEYS
3913 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3916 while (isSPACE(*s)) /* leading whitespace is OK */
3920 s++; /* get past 'v' */
3921 qv = 1; /* force quoted version processing */
3924 start = last = pos = s;
3926 /* pre-scan the input string to check for decimals/underbars */
3927 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3932 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3936 else if ( *pos == '_' )
3939 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3941 width = pos - last - 1; /* natural width of sub-version */
3946 if ( saw_period > 1 )
3947 qv = 1; /* force quoted version processing */
3952 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
3954 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
3955 if ( !qv && width < 3 )
3956 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3958 while (isDIGIT(*pos))
3960 if (!isALPHA(*pos)) {
3966 /* this is atoi() that delimits on underscores */
3967 const char *end = pos;
3971 /* the following if() will only be true after the decimal
3972 * point of a version originally created with a bare
3973 * floating point number, i.e. not quoted in any way
3975 if ( !qv && s > start && saw_period == 1 ) {
3979 rev += (*s - '0') * mult;
3981 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3982 Perl_croak(aTHX_ "Integer overflow in version");
3989 while (--end >= s) {
3991 rev += (*end - '0') * mult;
3993 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3994 Perl_croak(aTHX_ "Integer overflow in version");
3999 /* Append revision */
4000 av_push(av, newSViv(rev));
4001 if ( *pos == '.' && isDIGIT(pos[1]) )
4003 else if ( *pos == '_' && isDIGIT(pos[1]) )
4005 else if ( isDIGIT(*pos) )
4012 while ( isDIGIT(*pos) )
4017 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4025 if ( qv ) { /* quoted versions always get at least three terms*/
4026 I32 len = av_len(av);
4027 /* This for loop appears to trigger a compiler bug on OS X, as it
4028 loops infinitely. Yes, len is negative. No, it makes no sense.
4029 Compiler in question is:
4030 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4031 for ( len = 2 - len; len > 0; len-- )
4032 av_push((AV *)sv, newSViv(0));
4036 av_push(av, newSViv(0));
4039 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4040 av_push(av, newSViv(0));
4042 /* And finally, store the AV in the hash */
4043 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4048 =for apidoc new_version
4050 Returns a new version object based on the passed in SV:
4052 SV *sv = new_version(SV *ver);
4054 Does not alter the passed in ver SV. See "upg_version" if you
4055 want to upgrade the SV.
4061 Perl_new_version(pTHX_ SV *ver)
4063 SV * const rv = newSV(0);
4064 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4067 AV * const av = newAV();
4069 /* This will get reblessed later if a derived class*/
4070 SV * const hv = newSVrv(rv, "version");
4071 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4072 #ifndef NODEFAULT_SHAREKEYS
4073 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4079 /* Begin copying all of the elements */
4080 if ( hv_exists((HV *)ver, "qv", 2) )
4081 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4083 if ( hv_exists((HV *)ver, "alpha", 5) )
4084 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4086 if ( hv_exists((HV*)ver, "width", 5 ) )
4088 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4089 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4092 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
4093 /* This will get reblessed later if a derived class*/
4094 for ( key = 0; key <= av_len(sav); key++ )
4096 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4097 av_push(av, newSViv(rev));
4100 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4104 if ( SvVOK(ver) ) { /* already a v-string */
4105 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4106 const STRLEN len = mg->mg_len;
4107 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4108 sv_setpvn(rv,version,len);
4113 sv_setsv(rv,ver); /* make a duplicate */
4122 =for apidoc upg_version
4124 In-place upgrade of the supplied SV to a version object.
4126 SV *sv = upg_version(SV *sv);
4128 Returns a pointer to the upgraded SV.
4134 Perl_upg_version(pTHX_ SV *ver)
4139 if ( SvNOK(ver) ) /* may get too much accuracy */
4142 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4143 version = savepv(tbuf);
4146 else if ( SvVOK(ver) ) { /* already a v-string */
4147 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4148 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4152 else /* must be a string or something like a string */
4154 version = savepv(SvPV_nolen(ver));
4156 (void)scan_version(version, ver, qv);
4164 Validates that the SV contains a valid version object.
4166 bool vverify(SV *vobj);
4168 Note that it only confirms the bare minimum structure (so as not to get
4169 confused by derived classes which may contain additional hash entries):
4173 =item * The SV contains a [reference to a] hash
4175 =item * The hash contains a "version" key
4177 =item * The "version" key has [a reference to] an AV as its value
4185 Perl_vverify(pTHX_ SV *vs)
4191 /* see if the appropriate elements exist */
4192 if ( SvTYPE(vs) == SVt_PVHV
4193 && hv_exists((HV*)vs, "version", 7)
4194 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
4195 && SvTYPE(sv) == SVt_PVAV )
4204 Accepts a version object and returns the normalized floating
4205 point representation. Call like:
4209 NOTE: you can pass either the object directly or the SV
4210 contained within the RV.
4216 Perl_vnumify(pTHX_ SV *vs)
4221 SV * const sv = newSV(0);
4227 Perl_croak(aTHX_ "Invalid version object");
4229 /* see if various flags exist */
4230 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4232 if ( hv_exists((HV*)vs, "width", 5 ) )
4233 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4238 /* attempt to retrieve the version array */
4239 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
4240 sv_catpvn(sv,"0",1);
4247 sv_catpvn(sv,"0",1);
4251 digit = SvIV(*av_fetch(av, 0, 0));
4252 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4253 for ( i = 1 ; i < len ; i++ )
4255 digit = SvIV(*av_fetch(av, i, 0));
4257 const int denom = (int)pow(10,(3-width));
4258 const div_t term = div((int)PERL_ABS(digit),denom);
4259 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4262 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4268 digit = SvIV(*av_fetch(av, len, 0));
4269 if ( alpha && width == 3 ) /* alpha version */
4270 sv_catpvn(sv,"_",1);
4271 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4275 sv_catpvn(sv,"000",3);
4283 Accepts a version object and returns the normalized string
4284 representation. Call like:
4288 NOTE: you can pass either the object directly or the SV
4289 contained within the RV.
4295 Perl_vnormal(pTHX_ SV *vs)
4299 SV * const sv = newSV(0);
4305 Perl_croak(aTHX_ "Invalid version object");
4307 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4309 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
4317 digit = SvIV(*av_fetch(av, 0, 0));
4318 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4319 for ( i = 1 ; i < len ; i++ ) {
4320 digit = SvIV(*av_fetch(av, i, 0));
4321 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4326 /* handle last digit specially */
4327 digit = SvIV(*av_fetch(av, len, 0));
4329 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4331 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4334 if ( len <= 2 ) { /* short version, must be at least three */
4335 for ( len = 2 - len; len != 0; len-- )
4336 sv_catpvn(sv,".0",2);
4342 =for apidoc vstringify
4344 In order to maintain maximum compatibility with earlier versions
4345 of Perl, this function will return either the floating point
4346 notation or the multiple dotted notation, depending on whether
4347 the original version contained 1 or more dots, respectively
4353 Perl_vstringify(pTHX_ SV *vs)
4359 Perl_croak(aTHX_ "Invalid version object");
4361 if ( hv_exists((HV *)vs, "qv", 2) )
4370 Version object aware cmp. Both operands must already have been
4371 converted into version objects.
4377 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4380 bool lalpha = FALSE;
4381 bool ralpha = FALSE;
4390 if ( !vverify(lhv) )
4391 Perl_croak(aTHX_ "Invalid version object");
4393 if ( !vverify(rhv) )
4394 Perl_croak(aTHX_ "Invalid version object");
4396 /* get the left hand term */
4397 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
4398 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4401 /* and the right hand term */
4402 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
4403 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4411 while ( i <= m && retval == 0 )
4413 left = SvIV(*av_fetch(lav,i,0));
4414 right = SvIV(*av_fetch(rav,i,0));
4422 /* tiebreaker for alpha with identical terms */
4423 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4425 if ( lalpha && !ralpha )
4429 else if ( ralpha && !lalpha)
4435 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4439 while ( i <= r && retval == 0 )
4441 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4442 retval = -1; /* not a match after all */
4448 while ( i <= l && retval == 0 )
4450 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4451 retval = +1; /* not a match after all */
4459 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4460 # define EMULATE_SOCKETPAIR_UDP
4463 #ifdef EMULATE_SOCKETPAIR_UDP
4465 S_socketpair_udp (int fd[2]) {
4467 /* Fake a datagram socketpair using UDP to localhost. */
4468 int sockets[2] = {-1, -1};
4469 struct sockaddr_in addresses[2];
4471 Sock_size_t size = sizeof(struct sockaddr_in);
4472 unsigned short port;
4475 memset(&addresses, 0, sizeof(addresses));
4478 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4479 if (sockets[i] == -1)
4480 goto tidy_up_and_fail;
4482 addresses[i].sin_family = AF_INET;
4483 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4484 addresses[i].sin_port = 0; /* kernel choses port. */
4485 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4486 sizeof(struct sockaddr_in)) == -1)
4487 goto tidy_up_and_fail;
4490 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4491 for each connect the other socket to it. */
4494 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4496 goto tidy_up_and_fail;
4497 if (size != sizeof(struct sockaddr_in))
4498 goto abort_tidy_up_and_fail;
4499 /* !1 is 0, !0 is 1 */
4500 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4501 sizeof(struct sockaddr_in)) == -1)
4502 goto tidy_up_and_fail;
4505 /* Now we have 2 sockets connected to each other. I don't trust some other
4506 process not to have already sent a packet to us (by random) so send
4507 a packet from each to the other. */
4510 /* I'm going to send my own port number. As a short.
4511 (Who knows if someone somewhere has sin_port as a bitfield and needs
4512 this routine. (I'm assuming crays have socketpair)) */
4513 port = addresses[i].sin_port;
4514 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4515 if (got != sizeof(port)) {
4517 goto tidy_up_and_fail;
4518 goto abort_tidy_up_and_fail;
4522 /* Packets sent. I don't trust them to have arrived though.
4523 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4524 connect to localhost will use a second kernel thread. In 2.6 the
4525 first thread running the connect() returns before the second completes,
4526 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4527 returns 0. Poor programs have tripped up. One poor program's authors'
4528 had a 50-1 reverse stock split. Not sure how connected these were.)
4529 So I don't trust someone not to have an unpredictable UDP stack.
4533 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4534 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4538 FD_SET(sockets[0], &rset);
4539 FD_SET(sockets[1], &rset);
4541 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4542 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4543 || !FD_ISSET(sockets[1], &rset)) {
4544 /* I hope this is portable and appropriate. */
4546 goto tidy_up_and_fail;
4547 goto abort_tidy_up_and_fail;
4551 /* And the paranoia department even now doesn't trust it to have arrive
4552 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4554 struct sockaddr_in readfrom;
4555 unsigned short buffer[2];
4560 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4561 sizeof(buffer), MSG_DONTWAIT,
4562 (struct sockaddr *) &readfrom, &size);
4564 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4566 (struct sockaddr *) &readfrom, &size);
4570 goto tidy_up_and_fail;
4571 if (got != sizeof(port)
4572 || size != sizeof(struct sockaddr_in)
4573 /* Check other socket sent us its port. */
4574 || buffer[0] != (unsigned short) addresses[!i].sin_port
4575 /* Check kernel says we got the datagram from that socket */
4576 || readfrom.sin_family != addresses[!i].sin_family
4577 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4578 || readfrom.sin_port != addresses[!i].sin_port)
4579 goto abort_tidy_up_and_fail;
4582 /* My caller (my_socketpair) has validated that this is non-NULL */
4585 /* I hereby declare this connection open. May God bless all who cross
4589 abort_tidy_up_and_fail:
4590 errno = ECONNABORTED;
4593 const int save_errno = errno;
4594 if (sockets[0] != -1)
4595 PerlLIO_close(sockets[0]);
4596 if (sockets[1] != -1)
4597 PerlLIO_close(sockets[1]);
4602 #endif /* EMULATE_SOCKETPAIR_UDP */
4604 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4606 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4607 /* Stevens says that family must be AF_LOCAL, protocol 0.
4608 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4613 struct sockaddr_in listen_addr;
4614 struct sockaddr_in connect_addr;
4619 || family != AF_UNIX
4622 errno = EAFNOSUPPORT;
4630 #ifdef EMULATE_SOCKETPAIR_UDP
4631 if (type == SOCK_DGRAM)
4632 return S_socketpair_udp(fd);
4635 listener = PerlSock_socket(AF_INET, type, 0);
4638 memset(&listen_addr, 0, sizeof(listen_addr));
4639 listen_addr.sin_family = AF_INET;
4640 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4641 listen_addr.sin_port = 0; /* kernel choses port. */
4642 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4643 sizeof(listen_addr)) == -1)
4644 goto tidy_up_and_fail;
4645 if (PerlSock_listen(listener, 1) == -1)
4646 goto tidy_up_and_fail;
4648 connector = PerlSock_socket(AF_INET, type, 0);
4649 if (connector == -1)
4650 goto tidy_up_and_fail;
4651 /* We want to find out the port number to connect to. */
4652 size = sizeof(connect_addr);
4653 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4655 goto tidy_up_and_fail;
4656 if (size != sizeof(connect_addr))
4657 goto abort_tidy_up_and_fail;
4658 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4659 sizeof(connect_addr)) == -1)
4660 goto tidy_up_and_fail;
4662 size = sizeof(listen_addr);
4663 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4666 goto tidy_up_and_fail;
4667 if (size != sizeof(listen_addr))
4668 goto abort_tidy_up_and_fail;
4669 PerlLIO_close(listener);
4670 /* Now check we are talking to ourself by matching port and host on the
4672 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4674 goto tidy_up_and_fail;
4675 if (size != sizeof(connect_addr)
4676 || listen_addr.sin_family != connect_addr.sin_family
4677 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4678 || listen_addr.sin_port != connect_addr.sin_port) {
4679 goto abort_tidy_up_and_fail;
4685 abort_tidy_up_and_fail:
4687 errno = ECONNABORTED; /* This would be the standard thing to do. */
4689 # ifdef ECONNREFUSED
4690 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4692 errno = ETIMEDOUT; /* Desperation time. */
4697 int save_errno = errno;
4699 PerlLIO_close(listener);
4700 if (connector != -1)
4701 PerlLIO_close(connector);
4703 PerlLIO_close(acceptor);
4709 /* In any case have a stub so that there's code corresponding
4710 * to the my_socketpair in global.sym. */
4712 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4713 #ifdef HAS_SOCKETPAIR
4714 return socketpair(family, type, protocol, fd);
4723 =for apidoc sv_nosharing
4725 Dummy routine which "shares" an SV when there is no sharing module present.
4726 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4727 some level of strict-ness.
4733 Perl_sv_nosharing(pTHX_ SV *sv)
4735 PERL_UNUSED_ARG(sv);
4739 =for apidoc sv_nolocking
4741 Dummy routine which "locks" an SV when there is no locking module present.
4742 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4743 some level of strict-ness.
4749 Perl_sv_nolocking(pTHX_ SV *sv)
4751 PERL_UNUSED_ARG(sv);
4756 =for apidoc sv_nounlocking
4758 Dummy routine which "unlocks" an SV when there is no locking module present.
4759 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4760 some level of strict-ness.
4766 Perl_sv_nounlocking(pTHX_ SV *sv)
4768 PERL_UNUSED_ARG(sv);
4772 Perl_parse_unicode_opts(pTHX_ const char **popt)
4774 const char *p = *popt;
4779 opt = (U32) atoi(p);
4780 while (isDIGIT(*p)) p++;
4781 if (*p && *p != '\n' && *p != '\r')
4782 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4787 case PERL_UNICODE_STDIN:
4788 opt |= PERL_UNICODE_STDIN_FLAG; break;
4789 case PERL_UNICODE_STDOUT:
4790 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4791 case PERL_UNICODE_STDERR:
4792 opt |= PERL_UNICODE_STDERR_FLAG; break;
4793 case PERL_UNICODE_STD:
4794 opt |= PERL_UNICODE_STD_FLAG; break;
4795 case PERL_UNICODE_IN:
4796 opt |= PERL_UNICODE_IN_FLAG; break;
4797 case PERL_UNICODE_OUT:
4798 opt |= PERL_UNICODE_OUT_FLAG; break;
4799 case PERL_UNICODE_INOUT:
4800 opt |= PERL_UNICODE_INOUT_FLAG; break;
4801 case PERL_UNICODE_LOCALE:
4802 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4803 case PERL_UNICODE_ARGV:
4804 opt |= PERL_UNICODE_ARGV_FLAG; break;
4806 if (*p != '\n' && *p != '\r')
4808 "Unknown Unicode option letter '%c'", *p);
4814 opt = PERL_UNICODE_DEFAULT_FLAGS;
4816 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4817 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4818 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4829 * This is really just a quick hack which grabs various garbage
4830 * values. It really should be a real hash algorithm which
4831 * spreads the effect of every input bit onto every output bit,
4832 * if someone who knows about such things would bother to write it.
4833 * Might be a good idea to add that function to CORE as well.
4834 * No numbers below come from careful analysis or anything here,
4835 * except they are primes and SEED_C1 > 1E6 to get a full-width
4836 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4837 * probably be bigger too.
4840 # define SEED_C1 1000003
4841 #define SEED_C4 73819
4843 # define SEED_C1 25747
4844 #define SEED_C4 20639
4848 #define SEED_C5 26107
4850 #ifndef PERL_NO_DEV_RANDOM
4855 # include <starlet.h>
4856 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4857 * in 100-ns units, typically incremented ever 10 ms. */
4858 unsigned int when[2];
4860 # ifdef HAS_GETTIMEOFDAY
4861 struct timeval when;
4867 /* This test is an escape hatch, this symbol isn't set by Configure. */
4868 #ifndef PERL_NO_DEV_RANDOM
4869 #ifndef PERL_RANDOM_DEVICE
4870 /* /dev/random isn't used by default because reads from it will block
4871 * if there isn't enough entropy available. You can compile with
4872 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4873 * is enough real entropy to fill the seed. */
4874 # define PERL_RANDOM_DEVICE "/dev/urandom"
4876 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4878 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4887 _ckvmssts(sys$gettim(when));
4888 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4890 # ifdef HAS_GETTIMEOFDAY
4891 PerlProc_gettimeofday(&when,NULL);
4892 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4895 u = (U32)SEED_C1 * when;
4898 u += SEED_C3 * (U32)PerlProc_getpid();
4899 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4900 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4901 u += SEED_C5 * (U32)PTR2UV(&when);
4907 Perl_get_hash_seed(pTHX)
4909 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4913 while (isSPACE(*s)) s++;
4914 if (s && isDIGIT(*s))
4915 myseed = (UV)Atoul(s);
4917 #ifdef USE_HASH_SEED_EXPLICIT
4921 /* Compute a random seed */
4922 (void)seedDrand01((Rand_seed_t)seed());
4923 myseed = (UV)(Drand01() * (NV)UV_MAX);
4924 #if RANDBITS < (UVSIZE * 8)
4925 /* Since there are not enough randbits to to reach all
4926 * the bits of a UV, the low bits might need extra
4927 * help. Sum in another random number that will
4928 * fill in the low bits. */
4930 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4931 #endif /* RANDBITS < (UVSIZE * 8) */
4932 if (myseed == 0) { /* Superparanoia. */
4933 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4935 Perl_croak(aTHX_ "Your random numbers are not that random");
4938 PL_rehash_seed_set = TRUE;
4945 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4947 const char * const stashpv = CopSTASHPV(c);
4948 const char * const name = HvNAME_get(hv);
4950 if (stashpv == name)
4952 if (stashpv && name)
4953 if (strEQ(stashpv, name))
4960 #ifdef PERL_GLOBAL_STRUCT
4963 Perl_init_global_struct(pTHX)
4965 struct perl_vars *plvarsp = NULL;
4966 #ifdef PERL_GLOBAL_STRUCT
4967 # define PERL_GLOBAL_STRUCT_INIT
4968 # include "opcode.h" /* the ppaddr and check */
4969 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4970 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4971 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4972 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4973 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4977 plvarsp = PL_VarsPtr;
4978 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4984 # define PERLVAR(var,type) /**/
4985 # define PERLVARA(var,n,type) /**/
4986 # define PERLVARI(var,type,init) plvarsp->var = init;
4987 # define PERLVARIC(var,type,init) plvarsp->var = init;
4988 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4989 # include "perlvars.h"
4995 # ifdef PERL_GLOBAL_STRUCT
4996 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4997 if (!plvarsp->Gppaddr)
4999 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5000 if (!plvarsp->Gcheck)
5002 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5003 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5005 # ifdef PERL_SET_VARS
5006 PERL_SET_VARS(plvarsp);
5008 # undef PERL_GLOBAL_STRUCT_INIT
5013 #endif /* PERL_GLOBAL_STRUCT */
5015 #ifdef PERL_GLOBAL_STRUCT
5018 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5020 #ifdef PERL_GLOBAL_STRUCT
5021 # ifdef PERL_UNSET_VARS
5022 PERL_UNSET_VARS(plvarsp);
5024 free(plvarsp->Gppaddr);
5025 free(plvarsp->Gcheck);
5026 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5032 #endif /* PERL_GLOBAL_STRUCT */
5036 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5039 Perl_mem_log_alloc(const UV n, const UV typesize, const char *typename, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5041 #ifdef PERL_MEM_LOG_STDERR
5042 /* We can't use PerlIO for obvious reasons. */
5043 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5045 "alloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf"\n",
5046 filename, linenumber, funcname,
5047 n, typesize, typename, n * typesize, PTR2UV(newalloc));
5048 PerlLIO_write(2, buf, strlen(buf));
5054 Perl_mem_log_realloc(const UV n, const UV typesize, const char *typename, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5056 #ifdef PERL_MEM_LOG_STDERR
5057 /* We can't use PerlIO for obvious reasons. */
5058 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5060 "realloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5061 filename, linenumber, funcname,
5062 n, typesize, typename, n * typesize, PTR2UV(oldalloc), PTR2UV(newalloc));
5063 PerlLIO_write(2, buf, strlen(buf));
5069 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5071 #ifdef PERL_MEM_LOG_STDERR
5072 /* We can't use PerlIO for obvious reasons. */
5073 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5074 sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5075 filename, linenumber, funcname, PTR2UV(oldalloc));
5076 PerlLIO_write(2, buf, strlen(buf));
5081 #endif /* PERL_MEM_LOG */
5085 * c-indentation-style: bsd
5087 * indent-tabs-mode: t
5090 * ex: set ts=8 sts=4 sw=4 noet: