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 setenv(nam, val, 1);
1502 const int nlen = strlen(nam);
1508 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1509 /* all that work just for this */
1510 my_setenv_format(new_env, nam, nlen, val, vlen);
1511 (void)putenv(new_env);
1512 # endif /* __CYGWIN__ */
1513 #ifndef PERL_USE_SAFE_PUTENV
1519 #else /* WIN32 || NETWARE */
1522 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1525 register char *envstr;
1526 const int nlen = strlen(nam);
1533 Newx(envstr, nlen+vlen+2, char);
1534 my_setenv_format(envstr, nam, nlen, val, vlen);
1535 (void)PerlEnv_putenv(envstr);
1539 #endif /* WIN32 || NETWARE */
1543 Perl_setenv_getix(pTHX_ const char *nam)
1546 const register I32 len = strlen(nam);
1548 for (i = 0; environ[i]; i++) {
1551 strnicmp(environ[i],nam,len) == 0
1553 strnEQ(environ[i],nam,len)
1555 && environ[i][len] == '=')
1556 break; /* strnEQ must come first to avoid */
1557 } /* potential SEGV's */
1560 #endif /* !PERL_MICRO */
1562 #endif /* !VMS && !EPOC*/
1564 #ifdef UNLINK_ALL_VERSIONS
1566 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1570 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1575 /* this is a drop-in replacement for bcopy() */
1576 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1578 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1580 char * const retval = to;
1582 if (from - to >= 0) {
1590 *(--to) = *(--from);
1596 /* this is a drop-in replacement for memset() */
1599 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1601 char * const retval = loc;
1609 /* this is a drop-in replacement for bzero() */
1610 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1612 Perl_my_bzero(register char *loc, register I32 len)
1614 char * const retval = loc;
1622 /* this is a drop-in replacement for memcmp() */
1623 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1625 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1627 register const U8 *a = (const U8 *)s1;
1628 register const U8 *b = (const U8 *)s2;
1632 if ((tmp = *a++ - *b++))
1637 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1641 #ifdef USE_CHAR_VSPRINTF
1646 vsprintf(char *dest, const char *pat, char *args)
1650 fakebuf._ptr = dest;
1651 fakebuf._cnt = 32767;
1655 fakebuf._flag = _IOWRT|_IOSTRG;
1656 _doprnt(pat, args, &fakebuf); /* what a kludge */
1657 (void)putc('\0', &fakebuf);
1658 #ifdef USE_CHAR_VSPRINTF
1661 return 0; /* perl doesn't use return value */
1665 #endif /* HAS_VPRINTF */
1668 #if BYTEORDER != 0x4321
1670 Perl_my_swap(pTHX_ short s)
1672 #if (BYTEORDER & 1) == 0
1675 result = ((s & 255) << 8) + ((s >> 8) & 255);
1683 Perl_my_htonl(pTHX_ long l)
1687 char c[sizeof(long)];
1690 #if BYTEORDER == 0x1234
1691 u.c[0] = (l >> 24) & 255;
1692 u.c[1] = (l >> 16) & 255;
1693 u.c[2] = (l >> 8) & 255;
1697 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1698 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1703 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1704 u.c[o & 0xf] = (l >> s) & 255;
1712 Perl_my_ntohl(pTHX_ long l)
1716 char c[sizeof(long)];
1719 #if BYTEORDER == 0x1234
1720 u.c[0] = (l >> 24) & 255;
1721 u.c[1] = (l >> 16) & 255;
1722 u.c[2] = (l >> 8) & 255;
1726 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1727 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1734 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1735 l |= (u.c[o & 0xf] & 255) << s;
1742 #endif /* BYTEORDER != 0x4321 */
1746 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1747 * If these functions are defined,
1748 * the BYTEORDER is neither 0x1234 nor 0x4321.
1749 * However, this is not assumed.
1753 #define HTOLE(name,type) \
1755 name (register type n) \
1759 char c[sizeof(type)]; \
1762 register I32 s = 0; \
1763 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1764 u.c[i] = (n >> s) & 0xFF; \
1769 #define LETOH(name,type) \
1771 name (register type n) \
1775 char c[sizeof(type)]; \
1778 register I32 s = 0; \
1781 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1782 n |= ((type)(u.c[i] & 0xFF)) << s; \
1788 * Big-endian byte order functions.
1791 #define HTOBE(name,type) \
1793 name (register type n) \
1797 char c[sizeof(type)]; \
1800 register I32 s = 8*(sizeof(u.c)-1); \
1801 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1802 u.c[i] = (n >> s) & 0xFF; \
1807 #define BETOH(name,type) \
1809 name (register type n) \
1813 char c[sizeof(type)]; \
1816 register I32 s = 8*(sizeof(u.c)-1); \
1819 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1820 n |= ((type)(u.c[i] & 0xFF)) << s; \
1826 * If we just can't do it...
1829 #define NOT_AVAIL(name,type) \
1831 name (register type n) \
1833 Perl_croak_nocontext(#name "() not available"); \
1834 return n; /* not reached */ \
1838 #if defined(HAS_HTOVS) && !defined(htovs)
1841 #if defined(HAS_HTOVL) && !defined(htovl)
1844 #if defined(HAS_VTOHS) && !defined(vtohs)
1847 #if defined(HAS_VTOHL) && !defined(vtohl)
1851 #ifdef PERL_NEED_MY_HTOLE16
1853 HTOLE(Perl_my_htole16,U16)
1855 NOT_AVAIL(Perl_my_htole16,U16)
1858 #ifdef PERL_NEED_MY_LETOH16
1860 LETOH(Perl_my_letoh16,U16)
1862 NOT_AVAIL(Perl_my_letoh16,U16)
1865 #ifdef PERL_NEED_MY_HTOBE16
1867 HTOBE(Perl_my_htobe16,U16)
1869 NOT_AVAIL(Perl_my_htobe16,U16)
1872 #ifdef PERL_NEED_MY_BETOH16
1874 BETOH(Perl_my_betoh16,U16)
1876 NOT_AVAIL(Perl_my_betoh16,U16)
1880 #ifdef PERL_NEED_MY_HTOLE32
1882 HTOLE(Perl_my_htole32,U32)
1884 NOT_AVAIL(Perl_my_htole32,U32)
1887 #ifdef PERL_NEED_MY_LETOH32
1889 LETOH(Perl_my_letoh32,U32)
1891 NOT_AVAIL(Perl_my_letoh32,U32)
1894 #ifdef PERL_NEED_MY_HTOBE32
1896 HTOBE(Perl_my_htobe32,U32)
1898 NOT_AVAIL(Perl_my_htobe32,U32)
1901 #ifdef PERL_NEED_MY_BETOH32
1903 BETOH(Perl_my_betoh32,U32)
1905 NOT_AVAIL(Perl_my_betoh32,U32)
1909 #ifdef PERL_NEED_MY_HTOLE64
1911 HTOLE(Perl_my_htole64,U64)
1913 NOT_AVAIL(Perl_my_htole64,U64)
1916 #ifdef PERL_NEED_MY_LETOH64
1918 LETOH(Perl_my_letoh64,U64)
1920 NOT_AVAIL(Perl_my_letoh64,U64)
1923 #ifdef PERL_NEED_MY_HTOBE64
1925 HTOBE(Perl_my_htobe64,U64)
1927 NOT_AVAIL(Perl_my_htobe64,U64)
1930 #ifdef PERL_NEED_MY_BETOH64
1932 BETOH(Perl_my_betoh64,U64)
1934 NOT_AVAIL(Perl_my_betoh64,U64)
1938 #ifdef PERL_NEED_MY_HTOLES
1939 HTOLE(Perl_my_htoles,short)
1941 #ifdef PERL_NEED_MY_LETOHS
1942 LETOH(Perl_my_letohs,short)
1944 #ifdef PERL_NEED_MY_HTOBES
1945 HTOBE(Perl_my_htobes,short)
1947 #ifdef PERL_NEED_MY_BETOHS
1948 BETOH(Perl_my_betohs,short)
1951 #ifdef PERL_NEED_MY_HTOLEI
1952 HTOLE(Perl_my_htolei,int)
1954 #ifdef PERL_NEED_MY_LETOHI
1955 LETOH(Perl_my_letohi,int)
1957 #ifdef PERL_NEED_MY_HTOBEI
1958 HTOBE(Perl_my_htobei,int)
1960 #ifdef PERL_NEED_MY_BETOHI
1961 BETOH(Perl_my_betohi,int)
1964 #ifdef PERL_NEED_MY_HTOLEL
1965 HTOLE(Perl_my_htolel,long)
1967 #ifdef PERL_NEED_MY_LETOHL
1968 LETOH(Perl_my_letohl,long)
1970 #ifdef PERL_NEED_MY_HTOBEL
1971 HTOBE(Perl_my_htobel,long)
1973 #ifdef PERL_NEED_MY_BETOHL
1974 BETOH(Perl_my_betohl,long)
1978 Perl_my_swabn(void *ptr, int n)
1980 register char *s = (char *)ptr;
1981 register char *e = s + (n-1);
1984 for (n /= 2; n > 0; s++, e--, n--) {
1992 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1994 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1996 register I32 This, that;
2002 PERL_FLUSHALL_FOR_CHILD;
2003 This = (*mode == 'w');
2007 taint_proper("Insecure %s%s", "EXEC");
2009 if (PerlProc_pipe(p) < 0)
2011 /* Try for another pipe pair for error return */
2012 if (PerlProc_pipe(pp) >= 0)
2014 while ((pid = PerlProc_fork()) < 0) {
2015 if (errno != EAGAIN) {
2016 PerlLIO_close(p[This]);
2017 PerlLIO_close(p[that]);
2019 PerlLIO_close(pp[0]);
2020 PerlLIO_close(pp[1]);
2032 /* Close parent's end of error status pipe (if any) */
2034 PerlLIO_close(pp[0]);
2035 #if defined(HAS_FCNTL) && defined(F_SETFD)
2036 /* Close error pipe automatically if exec works */
2037 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2040 /* Now dup our end of _the_ pipe to right position */
2041 if (p[THIS] != (*mode == 'r')) {
2042 PerlLIO_dup2(p[THIS], *mode == 'r');
2043 PerlLIO_close(p[THIS]);
2044 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2045 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2048 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2049 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2050 /* No automatic close - do it by hand */
2057 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2063 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2069 do_execfree(); /* free any memory malloced by child on fork */
2071 PerlLIO_close(pp[1]);
2072 /* Keep the lower of the two fd numbers */
2073 if (p[that] < p[This]) {
2074 PerlLIO_dup2(p[This], p[that]);
2075 PerlLIO_close(p[This]);
2079 PerlLIO_close(p[that]); /* close child's end of pipe */
2082 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2084 SvUPGRADE(sv,SVt_IV);
2086 PL_forkprocess = pid;
2087 /* If we managed to get status pipe check for exec fail */
2088 if (did_pipes && pid > 0) {
2092 while (n < sizeof(int)) {
2093 n1 = PerlLIO_read(pp[0],
2094 (void*)(((char*)&errkid)+n),
2100 PerlLIO_close(pp[0]);
2102 if (n) { /* Error */
2104 PerlLIO_close(p[This]);
2105 if (n != sizeof(int))
2106 Perl_croak(aTHX_ "panic: kid popen errno read");
2108 pid2 = wait4pid(pid, &status, 0);
2109 } while (pid2 == -1 && errno == EINTR);
2110 errno = errkid; /* Propagate errno from kid */
2115 PerlLIO_close(pp[0]);
2116 return PerlIO_fdopen(p[This], mode);
2118 Perl_croak(aTHX_ "List form of piped open not implemented");
2119 return (PerlIO *) NULL;
2123 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2124 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2126 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2129 register I32 This, that;
2132 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2136 PERL_FLUSHALL_FOR_CHILD;
2139 return my_syspopen(aTHX_ cmd,mode);
2142 This = (*mode == 'w');
2144 if (doexec && PL_tainting) {
2146 taint_proper("Insecure %s%s", "EXEC");
2148 if (PerlProc_pipe(p) < 0)
2150 if (doexec && PerlProc_pipe(pp) >= 0)
2152 while ((pid = PerlProc_fork()) < 0) {
2153 if (errno != EAGAIN) {
2154 PerlLIO_close(p[This]);
2155 PerlLIO_close(p[that]);
2157 PerlLIO_close(pp[0]);
2158 PerlLIO_close(pp[1]);
2161 Perl_croak(aTHX_ "Can't fork");
2174 PerlLIO_close(pp[0]);
2175 #if defined(HAS_FCNTL) && defined(F_SETFD)
2176 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2179 if (p[THIS] != (*mode == 'r')) {
2180 PerlLIO_dup2(p[THIS], *mode == 'r');
2181 PerlLIO_close(p[THIS]);
2182 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2183 PerlLIO_close(p[THAT]);
2186 PerlLIO_close(p[THAT]);
2189 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2196 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2201 /* may or may not use the shell */
2202 do_exec3(cmd, pp[1], did_pipes);
2205 #endif /* defined OS2 */
2206 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2207 SvREADONLY_off(GvSV(tmpgv));
2208 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2209 SvREADONLY_on(GvSV(tmpgv));
2211 #ifdef THREADS_HAVE_PIDS
2212 PL_ppid = (IV)getppid();
2215 hv_clear(PL_pidstatus); /* we have no children */
2220 do_execfree(); /* free any memory malloced by child on vfork */
2222 PerlLIO_close(pp[1]);
2223 if (p[that] < p[This]) {
2224 PerlLIO_dup2(p[This], p[that]);
2225 PerlLIO_close(p[This]);
2229 PerlLIO_close(p[that]);
2232 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2234 SvUPGRADE(sv,SVt_IV);
2236 PL_forkprocess = pid;
2237 if (did_pipes && pid > 0) {
2241 while (n < sizeof(int)) {
2242 n1 = PerlLIO_read(pp[0],
2243 (void*)(((char*)&errkid)+n),
2249 PerlLIO_close(pp[0]);
2251 if (n) { /* Error */
2253 PerlLIO_close(p[This]);
2254 if (n != sizeof(int))
2255 Perl_croak(aTHX_ "panic: kid popen errno read");
2257 pid2 = wait4pid(pid, &status, 0);
2258 } while (pid2 == -1 && errno == EINTR);
2259 errno = errkid; /* Propagate errno from kid */
2264 PerlLIO_close(pp[0]);
2265 return PerlIO_fdopen(p[This], mode);
2268 #if defined(atarist) || defined(EPOC)
2271 Perl_my_popen(pTHX_ char *cmd, char *mode)
2273 PERL_FLUSHALL_FOR_CHILD;
2274 /* Call system's popen() to get a FILE *, then import it.
2275 used 0 for 2nd parameter to PerlIO_importFILE;
2278 return PerlIO_importFILE(popen(cmd, mode), 0);
2282 FILE *djgpp_popen();
2284 Perl_my_popen(pTHX_ char *cmd, char *mode)
2286 PERL_FLUSHALL_FOR_CHILD;
2287 /* Call system's popen() to get a FILE *, then import it.
2288 used 0 for 2nd parameter to PerlIO_importFILE;
2291 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2296 #endif /* !DOSISH */
2298 /* this is called in parent before the fork() */
2300 Perl_atfork_lock(void)
2303 #if defined(USE_ITHREADS)
2304 /* locks must be held in locking order (if any) */
2306 MUTEX_LOCK(&PL_malloc_mutex);
2312 /* this is called in both parent and child after the fork() */
2314 Perl_atfork_unlock(void)
2317 #if defined(USE_ITHREADS)
2318 /* locks must be released in same order as in atfork_lock() */
2320 MUTEX_UNLOCK(&PL_malloc_mutex);
2329 #if defined(HAS_FORK)
2331 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2336 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2337 * handlers elsewhere in the code */
2342 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2343 Perl_croak_nocontext("fork() not available");
2345 #endif /* HAS_FORK */
2350 Perl_dump_fds(pTHX_ char *s)
2355 PerlIO_printf(Perl_debug_log,"%s", s);
2356 for (fd = 0; fd < 32; fd++) {
2357 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2358 PerlIO_printf(Perl_debug_log," %d",fd);
2360 PerlIO_printf(Perl_debug_log,"\n");
2363 #endif /* DUMP_FDS */
2367 dup2(int oldfd, int newfd)
2369 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2372 PerlLIO_close(newfd);
2373 return fcntl(oldfd, F_DUPFD, newfd);
2375 #define DUP2_MAX_FDS 256
2376 int fdtmp[DUP2_MAX_FDS];
2382 PerlLIO_close(newfd);
2383 /* good enough for low fd's... */
2384 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2385 if (fdx >= DUP2_MAX_FDS) {
2393 PerlLIO_close(fdtmp[--fdx]);
2400 #ifdef HAS_SIGACTION
2402 #ifdef MACOS_TRADITIONAL
2403 /* We don't want restart behavior on MacOS */
2408 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2411 struct sigaction act, oact;
2414 /* only "parent" interpreter can diddle signals */
2415 if (PL_curinterp != aTHX)
2416 return (Sighandler_t) SIG_ERR;
2419 act.sa_handler = (void(*)(int))handler;
2420 sigemptyset(&act.sa_mask);
2423 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2424 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2426 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2427 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2428 act.sa_flags |= SA_NOCLDWAIT;
2430 if (sigaction(signo, &act, &oact) == -1)
2431 return (Sighandler_t) SIG_ERR;
2433 return (Sighandler_t) oact.sa_handler;
2437 Perl_rsignal_state(pTHX_ int signo)
2439 struct sigaction oact;
2441 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2442 return (Sighandler_t) SIG_ERR;
2444 return (Sighandler_t) oact.sa_handler;
2448 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2451 struct sigaction act;
2454 /* only "parent" interpreter can diddle signals */
2455 if (PL_curinterp != aTHX)
2459 act.sa_handler = (void(*)(int))handler;
2460 sigemptyset(&act.sa_mask);
2463 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2464 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2466 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2467 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2468 act.sa_flags |= SA_NOCLDWAIT;
2470 return sigaction(signo, &act, save);
2474 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2478 /* only "parent" interpreter can diddle signals */
2479 if (PL_curinterp != aTHX)
2483 return sigaction(signo, save, (struct sigaction *)NULL);
2486 #else /* !HAS_SIGACTION */
2489 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2491 #if defined(USE_ITHREADS) && !defined(WIN32)
2492 /* only "parent" interpreter can diddle signals */
2493 if (PL_curinterp != aTHX)
2494 return (Sighandler_t) SIG_ERR;
2497 return PerlProc_signal(signo, handler);
2509 Perl_rsignal_state(pTHX_ int signo)
2512 Sighandler_t oldsig;
2514 #if defined(USE_ITHREADS) && !defined(WIN32)
2515 /* only "parent" interpreter can diddle signals */
2516 if (PL_curinterp != aTHX)
2517 return (Sighandler_t) SIG_ERR;
2521 oldsig = PerlProc_signal(signo, sig_trap);
2522 PerlProc_signal(signo, oldsig);
2524 PerlProc_kill(PerlProc_getpid(), signo);
2529 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2531 #if defined(USE_ITHREADS) && !defined(WIN32)
2532 /* only "parent" interpreter can diddle signals */
2533 if (PL_curinterp != aTHX)
2536 *save = PerlProc_signal(signo, handler);
2537 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2541 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2543 #if defined(USE_ITHREADS) && !defined(WIN32)
2544 /* only "parent" interpreter can diddle signals */
2545 if (PL_curinterp != aTHX)
2548 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2551 #endif /* !HAS_SIGACTION */
2552 #endif /* !PERL_MICRO */
2554 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2555 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2557 Perl_my_pclose(pTHX_ PerlIO *ptr)
2559 Sigsave_t hstat, istat, qstat;
2565 int saved_errno = 0;
2567 int saved_win32_errno;
2571 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2573 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2575 *svp = &PL_sv_undef;
2577 if (pid == -1) { /* Opened by popen. */
2578 return my_syspclose(ptr);
2581 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2582 saved_errno = errno;
2584 saved_win32_errno = GetLastError();
2588 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2591 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2592 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2593 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2596 pid2 = wait4pid(pid, &status, 0);
2597 } while (pid2 == -1 && errno == EINTR);
2599 rsignal_restore(SIGHUP, &hstat);
2600 rsignal_restore(SIGINT, &istat);
2601 rsignal_restore(SIGQUIT, &qstat);
2604 SETERRNO(saved_errno, 0);
2607 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2609 #endif /* !DOSISH */
2611 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2613 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2618 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2620 char spid[TYPE_CHARS(IV)];
2624 sprintf(spid, "%"IVdf, (IV)pid);
2625 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2626 if (svp && *svp != &PL_sv_undef) {
2627 *statusp = SvIVX(*svp);
2628 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2635 hv_iterinit(PL_pidstatus);
2636 if ((entry = hv_iternext(PL_pidstatus))) {
2637 SV *sv = hv_iterval(PL_pidstatus,entry);
2639 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2640 *statusp = SvIVX(sv);
2641 sprintf(spid, "%"IVdf, (IV)pid);
2642 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2649 # ifdef HAS_WAITPID_RUNTIME
2650 if (!HAS_WAITPID_RUNTIME)
2653 result = PerlProc_waitpid(pid,statusp,flags);
2656 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2657 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2660 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2661 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2666 Perl_croak(aTHX_ "Can't do waitpid with flags");
2668 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2669 pidgone(result,*statusp);
2675 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2678 if (result < 0 && errno == EINTR) {
2683 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2686 Perl_pidgone(pTHX_ Pid_t pid, int status)
2689 char spid[TYPE_CHARS(IV)];
2691 sprintf(spid, "%"IVdf, (IV)pid);
2692 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2693 SvUPGRADE(sv,SVt_IV);
2694 SvIV_set(sv, status);
2698 #if defined(atarist) || defined(OS2) || defined(EPOC)
2701 int /* Cannot prototype with I32
2703 my_syspclose(PerlIO *ptr)
2706 Perl_my_pclose(pTHX_ PerlIO *ptr)
2709 /* Needs work for PerlIO ! */
2710 FILE *f = PerlIO_findFILE(ptr);
2711 I32 result = pclose(f);
2712 PerlIO_releaseFILE(ptr,f);
2720 Perl_my_pclose(pTHX_ PerlIO *ptr)
2722 /* Needs work for PerlIO ! */
2723 FILE *f = PerlIO_findFILE(ptr);
2724 I32 result = djgpp_pclose(f);
2725 result = (result << 8) & 0xff00;
2726 PerlIO_releaseFILE(ptr,f);
2732 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2735 register const char *frombase = from;
2738 register const char c = *from;
2743 while (count-- > 0) {
2744 for (todo = len; todo > 0; todo--) {
2753 Perl_same_dirent(pTHX_ const char *a, const char *b)
2755 char *fa = strrchr(a,'/');
2756 char *fb = strrchr(b,'/');
2759 SV *tmpsv = sv_newmortal();
2772 sv_setpvn(tmpsv, ".", 1);
2774 sv_setpvn(tmpsv, a, fa - a);
2775 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2778 sv_setpvn(tmpsv, ".", 1);
2780 sv_setpvn(tmpsv, b, fb - b);
2781 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2783 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2784 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2786 #endif /* !HAS_RENAME */
2789 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2790 const char *const *const search_ext, I32 flags)
2792 const char *xfound = Nullch;
2793 char *xfailed = Nullch;
2794 char tmpbuf[MAXPATHLEN];
2798 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2799 # define SEARCH_EXTS ".bat", ".cmd", NULL
2800 # define MAX_EXT_LEN 4
2803 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2804 # define MAX_EXT_LEN 4
2807 # define SEARCH_EXTS ".pl", ".com", NULL
2808 # define MAX_EXT_LEN 4
2810 /* additional extensions to try in each dir if scriptname not found */
2812 const char *const exts[] = { SEARCH_EXTS };
2813 const char *const *const ext = search_ext ? search_ext : exts;
2814 int extidx = 0, i = 0;
2815 const char *curext = Nullch;
2817 PERL_UNUSED_ARG(search_ext);
2818 # define MAX_EXT_LEN 0
2822 * If dosearch is true and if scriptname does not contain path
2823 * delimiters, search the PATH for scriptname.
2825 * If SEARCH_EXTS is also defined, will look for each
2826 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2827 * while searching the PATH.
2829 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2830 * proceeds as follows:
2831 * If DOSISH or VMSISH:
2832 * + look for ./scriptname{,.foo,.bar}
2833 * + search the PATH for scriptname{,.foo,.bar}
2836 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2837 * this will not look in '.' if it's not in the PATH)
2842 # ifdef ALWAYS_DEFTYPES
2843 len = strlen(scriptname);
2844 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2845 int hasdir, idx = 0, deftypes = 1;
2848 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2851 int hasdir, idx = 0, deftypes = 1;
2854 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2856 /* The first time through, just add SEARCH_EXTS to whatever we
2857 * already have, so we can check for default file types. */
2859 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2865 if ((strlen(tmpbuf) + strlen(scriptname)
2866 + MAX_EXT_LEN) >= sizeof tmpbuf)
2867 continue; /* don't search dir with too-long name */
2868 strcat(tmpbuf, scriptname);
2872 if (strEQ(scriptname, "-"))
2874 if (dosearch) { /* Look in '.' first. */
2875 const char *cur = scriptname;
2877 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2879 if (strEQ(ext[i++],curext)) {
2880 extidx = -1; /* already has an ext */
2885 DEBUG_p(PerlIO_printf(Perl_debug_log,
2886 "Looking for %s\n",cur));
2887 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2888 && !S_ISDIR(PL_statbuf.st_mode)) {
2896 if (cur == scriptname) {
2897 len = strlen(scriptname);
2898 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2900 /* FIXME? Convert to memcpy */
2901 cur = strcpy(tmpbuf, scriptname);
2903 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2904 && strcpy(tmpbuf+len, ext[extidx++]));
2909 #ifdef MACOS_TRADITIONAL
2910 if (dosearch && !strchr(scriptname, ':') &&
2911 (s = PerlEnv_getenv("Commands")))
2913 if (dosearch && !strchr(scriptname, '/')
2915 && !strchr(scriptname, '\\')
2917 && (s = PerlEnv_getenv("PATH")))
2922 PL_bufend = s + strlen(s);
2923 while (s < PL_bufend) {
2924 #ifdef MACOS_TRADITIONAL
2925 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2929 #if defined(atarist) || defined(DOSISH)
2934 && *s != ';'; len++, s++) {
2935 if (len < sizeof tmpbuf)
2938 if (len < sizeof tmpbuf)
2940 #else /* ! (atarist || DOSISH) */
2941 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2944 #endif /* ! (atarist || DOSISH) */
2945 #endif /* MACOS_TRADITIONAL */
2948 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2949 continue; /* don't search dir with too-long name */
2950 #ifdef MACOS_TRADITIONAL
2951 if (len && tmpbuf[len - 1] != ':')
2952 tmpbuf[len++] = ':';
2955 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2956 && tmpbuf[len - 1] != '/'
2957 && tmpbuf[len - 1] != '\\'
2960 tmpbuf[len++] = '/';
2961 if (len == 2 && tmpbuf[0] == '.')
2964 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2966 (void)strcpy(tmpbuf + len, scriptname);
2970 len = strlen(tmpbuf);
2971 if (extidx > 0) /* reset after previous loop */
2975 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2976 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2977 if (S_ISDIR(PL_statbuf.st_mode)) {
2981 } while ( retval < 0 /* not there */
2982 && extidx>=0 && ext[extidx] /* try an extension? */
2983 && strcpy(tmpbuf+len, ext[extidx++])
2988 if (S_ISREG(PL_statbuf.st_mode)
2989 && cando(S_IRUSR,TRUE,&PL_statbuf)
2990 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2991 && cando(S_IXUSR,TRUE,&PL_statbuf)
2995 xfound = tmpbuf; /* bingo! */
2999 xfailed = savepv(tmpbuf);
3002 if (!xfound && !seen_dot && !xfailed &&
3003 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3004 || S_ISDIR(PL_statbuf.st_mode)))
3006 seen_dot = 1; /* Disable message. */
3008 if (flags & 1) { /* do or die? */
3009 Perl_croak(aTHX_ "Can't %s %s%s%s",
3010 (xfailed ? "execute" : "find"),
3011 (xfailed ? xfailed : scriptname),
3012 (xfailed ? "" : " on PATH"),
3013 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3015 scriptname = Nullch;
3018 scriptname = xfound;
3020 return (scriptname ? savepv(scriptname) : Nullch);
3023 #ifndef PERL_GET_CONTEXT_DEFINED
3026 Perl_get_context(void)
3029 #if defined(USE_ITHREADS)
3030 # ifdef OLD_PTHREADS_API
3032 if (pthread_getspecific(PL_thr_key, &t))
3033 Perl_croak_nocontext("panic: pthread_getspecific");
3036 # ifdef I_MACH_CTHREADS
3037 return (void*)cthread_data(cthread_self());
3039 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3048 Perl_set_context(void *t)
3051 #if defined(USE_ITHREADS)
3052 # ifdef I_MACH_CTHREADS
3053 cthread_set_data(cthread_self(), t);
3055 if (pthread_setspecific(PL_thr_key, t))
3056 Perl_croak_nocontext("panic: pthread_setspecific");
3063 #endif /* !PERL_GET_CONTEXT_DEFINED */
3065 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3074 Perl_get_op_names(pTHX)
3076 return (char **)PL_op_name;
3080 Perl_get_op_descs(pTHX)
3082 return (char **)PL_op_desc;
3086 Perl_get_no_modify(pTHX)
3088 return PL_no_modify;
3092 Perl_get_opargs(pTHX)
3094 return (U32 *)PL_opargs;
3098 Perl_get_ppaddr(pTHX)
3101 return (PPADDR_t*)PL_ppaddr;
3104 #ifndef HAS_GETENV_LEN
3106 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3108 char * const env_trans = PerlEnv_getenv(env_elem);
3110 *len = strlen(env_trans);
3117 Perl_get_vtbl(pTHX_ int vtbl_id)
3119 const MGVTBL* result = Null(MGVTBL*);
3123 result = &PL_vtbl_sv;
3126 result = &PL_vtbl_env;
3128 case want_vtbl_envelem:
3129 result = &PL_vtbl_envelem;
3132 result = &PL_vtbl_sig;
3134 case want_vtbl_sigelem:
3135 result = &PL_vtbl_sigelem;
3137 case want_vtbl_pack:
3138 result = &PL_vtbl_pack;
3140 case want_vtbl_packelem:
3141 result = &PL_vtbl_packelem;
3143 case want_vtbl_dbline:
3144 result = &PL_vtbl_dbline;
3147 result = &PL_vtbl_isa;
3149 case want_vtbl_isaelem:
3150 result = &PL_vtbl_isaelem;
3152 case want_vtbl_arylen:
3153 result = &PL_vtbl_arylen;
3155 case want_vtbl_glob:
3156 result = &PL_vtbl_glob;
3158 case want_vtbl_mglob:
3159 result = &PL_vtbl_mglob;
3161 case want_vtbl_nkeys:
3162 result = &PL_vtbl_nkeys;
3164 case want_vtbl_taint:
3165 result = &PL_vtbl_taint;
3167 case want_vtbl_substr:
3168 result = &PL_vtbl_substr;
3171 result = &PL_vtbl_vec;
3174 result = &PL_vtbl_pos;
3177 result = &PL_vtbl_bm;
3180 result = &PL_vtbl_fm;
3182 case want_vtbl_uvar:
3183 result = &PL_vtbl_uvar;
3185 case want_vtbl_defelem:
3186 result = &PL_vtbl_defelem;
3188 case want_vtbl_regexp:
3189 result = &PL_vtbl_regexp;
3191 case want_vtbl_regdata:
3192 result = &PL_vtbl_regdata;
3194 case want_vtbl_regdatum:
3195 result = &PL_vtbl_regdatum;
3197 #ifdef USE_LOCALE_COLLATE
3198 case want_vtbl_collxfrm:
3199 result = &PL_vtbl_collxfrm;
3202 case want_vtbl_amagic:
3203 result = &PL_vtbl_amagic;
3205 case want_vtbl_amagicelem:
3206 result = &PL_vtbl_amagicelem;
3208 case want_vtbl_backref:
3209 result = &PL_vtbl_backref;
3211 case want_vtbl_utf8:
3212 result = &PL_vtbl_utf8;
3215 return (MGVTBL*)result;
3219 Perl_my_fflush_all(pTHX)
3221 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3222 return PerlIO_flush(NULL);
3224 # if defined(HAS__FWALK)
3225 extern int fflush(FILE *);
3226 /* undocumented, unprototyped, but very useful BSDism */
3227 extern void _fwalk(int (*)(FILE *));
3231 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3233 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3234 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3236 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3237 open_max = sysconf(_SC_OPEN_MAX);
3240 open_max = FOPEN_MAX;
3243 open_max = OPEN_MAX;
3254 for (i = 0; i < open_max; i++)
3255 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3256 STDIO_STREAM_ARRAY[i]._file < open_max &&
3257 STDIO_STREAM_ARRAY[i]._flag)
3258 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3262 SETERRNO(EBADF,RMS_IFI);
3269 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3271 const char * const func =
3272 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3273 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3275 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3276 const char * const type = OP_IS_SOCKET(op)
3277 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3278 ? "socket" : "filehandle";
3279 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3281 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3282 if (ckWARN(WARN_IO)) {
3283 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3285 Perl_warner(aTHX_ packWARN(WARN_IO),
3286 "Filehandle %s opened only for %sput",
3289 Perl_warner(aTHX_ packWARN(WARN_IO),
3290 "Filehandle opened only for %sput", direction);
3297 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3299 warn_type = WARN_CLOSED;
3303 warn_type = WARN_UNOPENED;
3306 if (ckWARN(warn_type)) {
3307 if (name && *name) {
3308 Perl_warner(aTHX_ packWARN(warn_type),
3309 "%s%s on %s %s %s", func, pars, vile, type, name);
3310 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3312 aTHX_ packWARN(warn_type),
3313 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3318 Perl_warner(aTHX_ packWARN(warn_type),
3319 "%s%s on %s %s", func, pars, vile, type);
3320 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3322 aTHX_ packWARN(warn_type),
3323 "\t(Are you trying to call %s%s on dirhandle?)\n",
3332 /* in ASCII order, not that it matters */
3333 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3336 Perl_ebcdic_control(pTHX_ int ch)
3344 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3345 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3348 if (ctlp == controllablechars)
3349 return('\177'); /* DEL */
3351 return((unsigned char)(ctlp - controllablechars - 1));
3352 } else { /* Want uncontrol */
3353 if (ch == '\177' || ch == -1)
3355 else if (ch == '\157')
3357 else if (ch == '\174')
3359 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3361 else if (ch == '\155')
3363 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3364 return(controllablechars[ch+1]);
3366 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3371 /* To workaround core dumps from the uninitialised tm_zone we get the
3372 * system to give us a reasonable struct to copy. This fix means that
3373 * strftime uses the tm_zone and tm_gmtoff values returned by
3374 * localtime(time()). That should give the desired result most of the
3375 * time. But probably not always!
3377 * This does not address tzname aspects of NETaa14816.
3382 # ifndef STRUCT_TM_HASZONE
3383 # define STRUCT_TM_HASZONE
3387 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3388 # ifndef HAS_TM_TM_ZONE
3389 # define HAS_TM_TM_ZONE
3394 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3396 #ifdef HAS_TM_TM_ZONE
3398 const struct tm* my_tm;
3400 my_tm = localtime(&now);
3402 Copy(my_tm, ptm, 1, struct tm);
3404 PERL_UNUSED_ARG(ptm);
3409 * mini_mktime - normalise struct tm values without the localtime()
3410 * semantics (and overhead) of mktime().
3413 Perl_mini_mktime(pTHX_ struct tm *ptm)
3417 int month, mday, year, jday;
3418 int odd_cent, odd_year;
3420 #define DAYS_PER_YEAR 365
3421 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3422 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3423 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3424 #define SECS_PER_HOUR (60*60)
3425 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3426 /* parentheses deliberately absent on these two, otherwise they don't work */
3427 #define MONTH_TO_DAYS 153/5
3428 #define DAYS_TO_MONTH 5/153
3429 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3430 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3431 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3432 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3435 * Year/day algorithm notes:
3437 * With a suitable offset for numeric value of the month, one can find
3438 * an offset into the year by considering months to have 30.6 (153/5) days,
3439 * using integer arithmetic (i.e., with truncation). To avoid too much
3440 * messing about with leap days, we consider January and February to be
3441 * the 13th and 14th month of the previous year. After that transformation,
3442 * we need the month index we use to be high by 1 from 'normal human' usage,
3443 * so the month index values we use run from 4 through 15.
3445 * Given that, and the rules for the Gregorian calendar (leap years are those
3446 * divisible by 4 unless also divisible by 100, when they must be divisible
3447 * by 400 instead), we can simply calculate the number of days since some
3448 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3449 * the days we derive from our month index, and adding in the day of the
3450 * month. The value used here is not adjusted for the actual origin which
3451 * it normally would use (1 January A.D. 1), since we're not exposing it.
3452 * We're only building the value so we can turn around and get the
3453 * normalised values for the year, month, day-of-month, and day-of-year.
3455 * For going backward, we need to bias the value we're using so that we find
3456 * the right year value. (Basically, we don't want the contribution of
3457 * March 1st to the number to apply while deriving the year). Having done
3458 * that, we 'count up' the contribution to the year number by accounting for
3459 * full quadracenturies (400-year periods) with their extra leap days, plus
3460 * the contribution from full centuries (to avoid counting in the lost leap
3461 * days), plus the contribution from full quad-years (to count in the normal
3462 * leap days), plus the leftover contribution from any non-leap years.
3463 * At this point, if we were working with an actual leap day, we'll have 0
3464 * days left over. This is also true for March 1st, however. So, we have
3465 * to special-case that result, and (earlier) keep track of the 'odd'
3466 * century and year contributions. If we got 4 extra centuries in a qcent,
3467 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3468 * Otherwise, we add back in the earlier bias we removed (the 123 from
3469 * figuring in March 1st), find the month index (integer division by 30.6),
3470 * and the remainder is the day-of-month. We then have to convert back to
3471 * 'real' months (including fixing January and February from being 14/15 in
3472 * the previous year to being in the proper year). After that, to get
3473 * tm_yday, we work with the normalised year and get a new yearday value for
3474 * January 1st, which we subtract from the yearday value we had earlier,
3475 * representing the date we've re-built. This is done from January 1
3476 * because tm_yday is 0-origin.
3478 * Since POSIX time routines are only guaranteed to work for times since the
3479 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3480 * applies Gregorian calendar rules even to dates before the 16th century
3481 * doesn't bother me. Besides, you'd need cultural context for a given
3482 * date to know whether it was Julian or Gregorian calendar, and that's
3483 * outside the scope for this routine. Since we convert back based on the
3484 * same rules we used to build the yearday, you'll only get strange results
3485 * for input which needed normalising, or for the 'odd' century years which
3486 * were leap years in the Julian calander but not in the Gregorian one.
3487 * I can live with that.
3489 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3490 * that's still outside the scope for POSIX time manipulation, so I don't
3494 year = 1900 + ptm->tm_year;
3495 month = ptm->tm_mon;
3496 mday = ptm->tm_mday;
3497 /* allow given yday with no month & mday to dominate the result */
3498 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3501 jday = 1 + ptm->tm_yday;
3510 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3511 yearday += month*MONTH_TO_DAYS + mday + jday;
3513 * Note that we don't know when leap-seconds were or will be,
3514 * so we have to trust the user if we get something which looks
3515 * like a sensible leap-second. Wild values for seconds will
3516 * be rationalised, however.
3518 if ((unsigned) ptm->tm_sec <= 60) {
3525 secs += 60 * ptm->tm_min;
3526 secs += SECS_PER_HOUR * ptm->tm_hour;
3528 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3529 /* got negative remainder, but need positive time */
3530 /* back off an extra day to compensate */
3531 yearday += (secs/SECS_PER_DAY)-1;
3532 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3535 yearday += (secs/SECS_PER_DAY);
3536 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3539 else if (secs >= SECS_PER_DAY) {
3540 yearday += (secs/SECS_PER_DAY);
3541 secs %= SECS_PER_DAY;
3543 ptm->tm_hour = secs/SECS_PER_HOUR;
3544 secs %= SECS_PER_HOUR;
3545 ptm->tm_min = secs/60;
3547 ptm->tm_sec += secs;
3548 /* done with time of day effects */
3550 * The algorithm for yearday has (so far) left it high by 428.
3551 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3552 * bias it by 123 while trying to figure out what year it
3553 * really represents. Even with this tweak, the reverse
3554 * translation fails for years before A.D. 0001.
3555 * It would still fail for Feb 29, but we catch that one below.
3557 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3558 yearday -= YEAR_ADJUST;
3559 year = (yearday / DAYS_PER_QCENT) * 400;
3560 yearday %= DAYS_PER_QCENT;
3561 odd_cent = yearday / DAYS_PER_CENT;
3562 year += odd_cent * 100;
3563 yearday %= DAYS_PER_CENT;
3564 year += (yearday / DAYS_PER_QYEAR) * 4;
3565 yearday %= DAYS_PER_QYEAR;
3566 odd_year = yearday / DAYS_PER_YEAR;
3568 yearday %= DAYS_PER_YEAR;
3569 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3574 yearday += YEAR_ADJUST; /* recover March 1st crock */
3575 month = yearday*DAYS_TO_MONTH;
3576 yearday -= month*MONTH_TO_DAYS;
3577 /* recover other leap-year adjustment */
3586 ptm->tm_year = year - 1900;
3588 ptm->tm_mday = yearday;
3589 ptm->tm_mon = month;
3593 ptm->tm_mon = month - 1;
3595 /* re-build yearday based on Jan 1 to get tm_yday */
3597 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3598 yearday += 14*MONTH_TO_DAYS + 1;
3599 ptm->tm_yday = jday - yearday;
3600 /* fix tm_wday if not overridden by caller */
3601 if ((unsigned)ptm->tm_wday > 6)
3602 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3606 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)
3614 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3617 mytm.tm_hour = hour;
3618 mytm.tm_mday = mday;
3620 mytm.tm_year = year;
3621 mytm.tm_wday = wday;
3622 mytm.tm_yday = yday;
3623 mytm.tm_isdst = isdst;
3625 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3626 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3631 #ifdef HAS_TM_TM_GMTOFF
3632 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3634 #ifdef HAS_TM_TM_ZONE
3635 mytm.tm_zone = mytm2.tm_zone;
3640 Newx(buf, buflen, char);
3641 len = strftime(buf, buflen, fmt, &mytm);
3643 ** The following is needed to handle to the situation where
3644 ** tmpbuf overflows. Basically we want to allocate a buffer
3645 ** and try repeatedly. The reason why it is so complicated
3646 ** is that getting a return value of 0 from strftime can indicate
3647 ** one of the following:
3648 ** 1. buffer overflowed,
3649 ** 2. illegal conversion specifier, or
3650 ** 3. the format string specifies nothing to be returned(not
3651 ** an error). This could be because format is an empty string
3652 ** or it specifies %p that yields an empty string in some locale.
3653 ** If there is a better way to make it portable, go ahead by
3656 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3659 /* Possibly buf overflowed - try again with a bigger buf */
3660 const int fmtlen = strlen(fmt);
3661 const int bufsize = fmtlen + buflen;
3663 Newx(buf, bufsize, char);
3665 buflen = strftime(buf, bufsize, fmt, &mytm);
3666 if (buflen > 0 && buflen < bufsize)
3668 /* heuristic to prevent out-of-memory errors */
3669 if (bufsize > 100*fmtlen) {
3674 Renew(buf, bufsize*2, char);
3679 Perl_croak(aTHX_ "panic: no strftime");
3685 #define SV_CWD_RETURN_UNDEF \
3686 sv_setsv(sv, &PL_sv_undef); \
3689 #define SV_CWD_ISDOT(dp) \
3690 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3691 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3694 =head1 Miscellaneous Functions
3696 =for apidoc getcwd_sv
3698 Fill the sv with current working directory
3703 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3704 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3705 * getcwd(3) if available
3706 * Comments from the orignal:
3707 * This is a faster version of getcwd. It's also more dangerous
3708 * because you might chdir out of a directory that you can't chdir
3712 Perl_getcwd_sv(pTHX_ register SV *sv)
3716 #ifndef INCOMPLETE_TAINTS
3722 char buf[MAXPATHLEN];
3724 /* Some getcwd()s automatically allocate a buffer of the given
3725 * size from the heap if they are given a NULL buffer pointer.
3726 * The problem is that this behaviour is not portable. */
3727 if (getcwd(buf, sizeof(buf) - 1)) {
3728 sv_setpvn(sv, buf, strlen(buf));
3732 sv_setsv(sv, &PL_sv_undef);
3740 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3744 SvUPGRADE(sv, SVt_PV);
3746 if (PerlLIO_lstat(".", &statbuf) < 0) {
3747 SV_CWD_RETURN_UNDEF;
3750 orig_cdev = statbuf.st_dev;
3751 orig_cino = statbuf.st_ino;
3760 if (PerlDir_chdir("..") < 0) {
3761 SV_CWD_RETURN_UNDEF;
3763 if (PerlLIO_stat(".", &statbuf) < 0) {
3764 SV_CWD_RETURN_UNDEF;
3767 cdev = statbuf.st_dev;
3768 cino = statbuf.st_ino;
3770 if (odev == cdev && oino == cino) {
3773 if (!(dir = PerlDir_open("."))) {
3774 SV_CWD_RETURN_UNDEF;
3777 while ((dp = PerlDir_read(dir)) != NULL) {
3779 const int namelen = dp->d_namlen;
3781 const int namelen = strlen(dp->d_name);
3784 if (SV_CWD_ISDOT(dp)) {
3788 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3789 SV_CWD_RETURN_UNDEF;
3792 tdev = statbuf.st_dev;
3793 tino = statbuf.st_ino;
3794 if (tino == oino && tdev == odev) {
3800 SV_CWD_RETURN_UNDEF;
3803 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3804 SV_CWD_RETURN_UNDEF;
3807 SvGROW(sv, pathlen + namelen + 1);
3811 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3814 /* prepend current directory to the front */
3816 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3817 pathlen += (namelen + 1);
3819 #ifdef VOID_CLOSEDIR
3822 if (PerlDir_close(dir) < 0) {
3823 SV_CWD_RETURN_UNDEF;
3829 SvCUR_set(sv, pathlen);
3833 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3834 SV_CWD_RETURN_UNDEF;
3837 if (PerlLIO_stat(".", &statbuf) < 0) {
3838 SV_CWD_RETURN_UNDEF;
3841 cdev = statbuf.st_dev;
3842 cino = statbuf.st_ino;
3844 if (cdev != orig_cdev || cino != orig_cino) {
3845 Perl_croak(aTHX_ "Unstable directory path, "
3846 "current directory changed unexpectedly");
3858 =for apidoc scan_version
3860 Returns a pointer to the next character after the parsed
3861 version string, as well as upgrading the passed in SV to
3864 Function must be called with an already existing SV like
3867 s = scan_version(s,SV *sv, bool qv);
3869 Performs some preprocessing to the string to ensure that
3870 it has the correct characteristics of a version. Flags the
3871 object if it contains an underscore (which denotes this
3872 is a alpha version). The boolean qv denotes that the version
3873 should be interpreted as if it had multiple decimals, even if
3880 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3889 SV *hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3890 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3892 #ifndef NODEFAULT_SHAREKEYS
3893 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3896 while (isSPACE(*s)) /* leading whitespace is OK */
3900 s++; /* get past 'v' */
3901 qv = 1; /* force quoted version processing */
3904 start = last = pos = s;
3906 /* pre-scan the input string to check for decimals/underbars */
3907 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3912 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3916 else if ( *pos == '_' )
3919 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3921 width = pos - last - 1; /* natural width of sub-version */
3926 if ( saw_period > 1 )
3927 qv = 1; /* force quoted version processing */
3932 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
3934 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
3935 if ( !qv && width < 3 )
3936 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3938 while (isDIGIT(*pos))
3940 if (!isALPHA(*pos)) {
3946 /* this is atoi() that delimits on underscores */
3947 const char *end = pos;
3951 /* the following if() will only be true after the decimal
3952 * point of a version originally created with a bare
3953 * floating point number, i.e. not quoted in any way
3955 if ( !qv && s > start && saw_period == 1 ) {
3959 rev += (*s - '0') * mult;
3961 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3962 Perl_croak(aTHX_ "Integer overflow in version");
3969 while (--end >= s) {
3971 rev += (*end - '0') * mult;
3973 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3974 Perl_croak(aTHX_ "Integer overflow in version");
3979 /* Append revision */
3980 av_push(av, newSViv(rev));
3981 if ( *pos == '.' && isDIGIT(pos[1]) )
3983 else if ( *pos == '_' && isDIGIT(pos[1]) )
3985 else if ( isDIGIT(*pos) )
3992 while ( isDIGIT(*pos) )
3997 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4005 if ( qv ) { /* quoted versions always get at least three terms*/
4006 I32 len = av_len(av);
4007 /* This for loop appears to trigger a compiler bug on OS X, as it
4008 loops infinitely. Yes, len is negative. No, it makes no sense.
4009 Compiler in question is:
4010 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4011 for ( len = 2 - len; len > 0; len-- )
4012 av_push((AV *)sv, newSViv(0));
4016 av_push(av, newSViv(0));
4019 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4020 av_push(av, newSViv(0));
4022 /* And finally, store the AV in the hash */
4023 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4028 =for apidoc new_version
4030 Returns a new version object based on the passed in SV:
4032 SV *sv = new_version(SV *ver);
4034 Does not alter the passed in ver SV. See "upg_version" if you
4035 want to upgrade the SV.
4041 Perl_new_version(pTHX_ SV *ver)
4043 SV * const rv = newSV(0);
4044 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4047 AV * const av = newAV();
4049 /* This will get reblessed later if a derived class*/
4050 SV * const hv = newSVrv(rv, "version");
4051 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4052 #ifndef NODEFAULT_SHAREKEYS
4053 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4059 /* Begin copying all of the elements */
4060 if ( hv_exists((HV *)ver, "qv", 2) )
4061 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4063 if ( hv_exists((HV *)ver, "alpha", 5) )
4064 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4066 if ( hv_exists((HV*)ver, "width", 5 ) )
4068 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4069 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4072 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
4073 /* This will get reblessed later if a derived class*/
4074 for ( key = 0; key <= av_len(sav); key++ )
4076 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4077 av_push(av, newSViv(rev));
4080 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4084 if ( SvVOK(ver) ) { /* already a v-string */
4085 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4086 const STRLEN len = mg->mg_len;
4087 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4088 sv_setpvn(rv,version,len);
4093 sv_setsv(rv,ver); /* make a duplicate */
4102 =for apidoc upg_version
4104 In-place upgrade of the supplied SV to a version object.
4106 SV *sv = upg_version(SV *sv);
4108 Returns a pointer to the upgraded SV.
4114 Perl_upg_version(pTHX_ SV *ver)
4119 if ( SvNOK(ver) ) /* may get too much accuracy */
4122 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4123 version = savepv(tbuf);
4126 else if ( SvVOK(ver) ) { /* already a v-string */
4127 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4128 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4132 else /* must be a string or something like a string */
4134 version = savepv(SvPV_nolen(ver));
4136 (void)scan_version(version, ver, qv);
4144 Validates that the SV contains a valid version object.
4146 bool vverify(SV *vobj);
4148 Note that it only confirms the bare minimum structure (so as not to get
4149 confused by derived classes which may contain additional hash entries):
4153 =item * The SV contains a [reference to a] hash
4155 =item * The hash contains a "version" key
4157 =item * The "version" key has [a reference to] an AV as its value
4165 Perl_vverify(pTHX_ SV *vs)
4171 /* see if the appropriate elements exist */
4172 if ( SvTYPE(vs) == SVt_PVHV
4173 && hv_exists((HV*)vs, "version", 7)
4174 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
4175 && SvTYPE(sv) == SVt_PVAV )
4184 Accepts a version object and returns the normalized floating
4185 point representation. Call like:
4189 NOTE: you can pass either the object directly or the SV
4190 contained within the RV.
4196 Perl_vnumify(pTHX_ SV *vs)
4201 SV * const sv = newSV(0);
4207 Perl_croak(aTHX_ "Invalid version object");
4209 /* see if various flags exist */
4210 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4212 if ( hv_exists((HV*)vs, "width", 5 ) )
4213 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4218 /* attempt to retrieve the version array */
4219 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
4220 sv_catpvn(sv,"0",1);
4227 sv_catpvn(sv,"0",1);
4231 digit = SvIV(*av_fetch(av, 0, 0));
4232 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4233 for ( i = 1 ; i < len ; i++ )
4235 digit = SvIV(*av_fetch(av, i, 0));
4237 const int denom = (int)pow(10,(3-width));
4238 const div_t term = div((int)PERL_ABS(digit),denom);
4239 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4242 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4248 digit = SvIV(*av_fetch(av, len, 0));
4249 if ( alpha && width == 3 ) /* alpha version */
4250 sv_catpvn(sv,"_",1);
4251 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4255 sv_catpvn(sv,"000",3);
4263 Accepts a version object and returns the normalized string
4264 representation. Call like:
4268 NOTE: you can pass either the object directly or the SV
4269 contained within the RV.
4275 Perl_vnormal(pTHX_ SV *vs)
4279 SV * const sv = newSV(0);
4285 Perl_croak(aTHX_ "Invalid version object");
4287 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4289 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
4297 digit = SvIV(*av_fetch(av, 0, 0));
4298 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4299 for ( i = 1 ; i < len ; i++ ) {
4300 digit = SvIV(*av_fetch(av, i, 0));
4301 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4306 /* handle last digit specially */
4307 digit = SvIV(*av_fetch(av, len, 0));
4309 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4311 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4314 if ( len <= 2 ) { /* short version, must be at least three */
4315 for ( len = 2 - len; len != 0; len-- )
4316 sv_catpvn(sv,".0",2);
4322 =for apidoc vstringify
4324 In order to maintain maximum compatibility with earlier versions
4325 of Perl, this function will return either the floating point
4326 notation or the multiple dotted notation, depending on whether
4327 the original version contained 1 or more dots, respectively
4333 Perl_vstringify(pTHX_ SV *vs)
4339 Perl_croak(aTHX_ "Invalid version object");
4341 if ( hv_exists((HV *)vs, "qv", 2) )
4350 Version object aware cmp. Both operands must already have been
4351 converted into version objects.
4357 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4360 bool lalpha = FALSE;
4361 bool ralpha = FALSE;
4370 if ( !vverify(lhv) )
4371 Perl_croak(aTHX_ "Invalid version object");
4373 if ( !vverify(rhv) )
4374 Perl_croak(aTHX_ "Invalid version object");
4376 /* get the left hand term */
4377 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
4378 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4381 /* and the right hand term */
4382 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
4383 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4391 while ( i <= m && retval == 0 )
4393 left = SvIV(*av_fetch(lav,i,0));
4394 right = SvIV(*av_fetch(rav,i,0));
4402 /* tiebreaker for alpha with identical terms */
4403 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4405 if ( lalpha && !ralpha )
4409 else if ( ralpha && !lalpha)
4415 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4419 while ( i <= r && retval == 0 )
4421 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4422 retval = -1; /* not a match after all */
4428 while ( i <= l && retval == 0 )
4430 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4431 retval = +1; /* not a match after all */
4439 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4440 # define EMULATE_SOCKETPAIR_UDP
4443 #ifdef EMULATE_SOCKETPAIR_UDP
4445 S_socketpair_udp (int fd[2]) {
4447 /* Fake a datagram socketpair using UDP to localhost. */
4448 int sockets[2] = {-1, -1};
4449 struct sockaddr_in addresses[2];
4451 Sock_size_t size = sizeof(struct sockaddr_in);
4452 unsigned short port;
4455 memset(&addresses, 0, sizeof(addresses));
4458 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4459 if (sockets[i] == -1)
4460 goto tidy_up_and_fail;
4462 addresses[i].sin_family = AF_INET;
4463 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4464 addresses[i].sin_port = 0; /* kernel choses port. */
4465 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4466 sizeof(struct sockaddr_in)) == -1)
4467 goto tidy_up_and_fail;
4470 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4471 for each connect the other socket to it. */
4474 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4476 goto tidy_up_and_fail;
4477 if (size != sizeof(struct sockaddr_in))
4478 goto abort_tidy_up_and_fail;
4479 /* !1 is 0, !0 is 1 */
4480 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4481 sizeof(struct sockaddr_in)) == -1)
4482 goto tidy_up_and_fail;
4485 /* Now we have 2 sockets connected to each other. I don't trust some other
4486 process not to have already sent a packet to us (by random) so send
4487 a packet from each to the other. */
4490 /* I'm going to send my own port number. As a short.
4491 (Who knows if someone somewhere has sin_port as a bitfield and needs
4492 this routine. (I'm assuming crays have socketpair)) */
4493 port = addresses[i].sin_port;
4494 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4495 if (got != sizeof(port)) {
4497 goto tidy_up_and_fail;
4498 goto abort_tidy_up_and_fail;
4502 /* Packets sent. I don't trust them to have arrived though.
4503 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4504 connect to localhost will use a second kernel thread. In 2.6 the
4505 first thread running the connect() returns before the second completes,
4506 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4507 returns 0. Poor programs have tripped up. One poor program's authors'
4508 had a 50-1 reverse stock split. Not sure how connected these were.)
4509 So I don't trust someone not to have an unpredictable UDP stack.
4513 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4514 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4518 FD_SET(sockets[0], &rset);
4519 FD_SET(sockets[1], &rset);
4521 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4522 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4523 || !FD_ISSET(sockets[1], &rset)) {
4524 /* I hope this is portable and appropriate. */
4526 goto tidy_up_and_fail;
4527 goto abort_tidy_up_and_fail;
4531 /* And the paranoia department even now doesn't trust it to have arrive
4532 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4534 struct sockaddr_in readfrom;
4535 unsigned short buffer[2];
4540 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4541 sizeof(buffer), MSG_DONTWAIT,
4542 (struct sockaddr *) &readfrom, &size);
4544 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4546 (struct sockaddr *) &readfrom, &size);
4550 goto tidy_up_and_fail;
4551 if (got != sizeof(port)
4552 || size != sizeof(struct sockaddr_in)
4553 /* Check other socket sent us its port. */
4554 || buffer[0] != (unsigned short) addresses[!i].sin_port
4555 /* Check kernel says we got the datagram from that socket */
4556 || readfrom.sin_family != addresses[!i].sin_family
4557 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4558 || readfrom.sin_port != addresses[!i].sin_port)
4559 goto abort_tidy_up_and_fail;
4562 /* My caller (my_socketpair) has validated that this is non-NULL */
4565 /* I hereby declare this connection open. May God bless all who cross
4569 abort_tidy_up_and_fail:
4570 errno = ECONNABORTED;
4573 const int save_errno = errno;
4574 if (sockets[0] != -1)
4575 PerlLIO_close(sockets[0]);
4576 if (sockets[1] != -1)
4577 PerlLIO_close(sockets[1]);
4582 #endif /* EMULATE_SOCKETPAIR_UDP */
4584 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4586 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4587 /* Stevens says that family must be AF_LOCAL, protocol 0.
4588 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4593 struct sockaddr_in listen_addr;
4594 struct sockaddr_in connect_addr;
4599 || family != AF_UNIX
4602 errno = EAFNOSUPPORT;
4610 #ifdef EMULATE_SOCKETPAIR_UDP
4611 if (type == SOCK_DGRAM)
4612 return S_socketpair_udp(fd);
4615 listener = PerlSock_socket(AF_INET, type, 0);
4618 memset(&listen_addr, 0, sizeof(listen_addr));
4619 listen_addr.sin_family = AF_INET;
4620 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4621 listen_addr.sin_port = 0; /* kernel choses port. */
4622 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4623 sizeof(listen_addr)) == -1)
4624 goto tidy_up_and_fail;
4625 if (PerlSock_listen(listener, 1) == -1)
4626 goto tidy_up_and_fail;
4628 connector = PerlSock_socket(AF_INET, type, 0);
4629 if (connector == -1)
4630 goto tidy_up_and_fail;
4631 /* We want to find out the port number to connect to. */
4632 size = sizeof(connect_addr);
4633 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4635 goto tidy_up_and_fail;
4636 if (size != sizeof(connect_addr))
4637 goto abort_tidy_up_and_fail;
4638 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4639 sizeof(connect_addr)) == -1)
4640 goto tidy_up_and_fail;
4642 size = sizeof(listen_addr);
4643 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4646 goto tidy_up_and_fail;
4647 if (size != sizeof(listen_addr))
4648 goto abort_tidy_up_and_fail;
4649 PerlLIO_close(listener);
4650 /* Now check we are talking to ourself by matching port and host on the
4652 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4654 goto tidy_up_and_fail;
4655 if (size != sizeof(connect_addr)
4656 || listen_addr.sin_family != connect_addr.sin_family
4657 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4658 || listen_addr.sin_port != connect_addr.sin_port) {
4659 goto abort_tidy_up_and_fail;
4665 abort_tidy_up_and_fail:
4667 errno = ECONNABORTED; /* This would be the standard thing to do. */
4669 # ifdef ECONNREFUSED
4670 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4672 errno = ETIMEDOUT; /* Desperation time. */
4677 int save_errno = errno;
4679 PerlLIO_close(listener);
4680 if (connector != -1)
4681 PerlLIO_close(connector);
4683 PerlLIO_close(acceptor);
4689 /* In any case have a stub so that there's code corresponding
4690 * to the my_socketpair in global.sym. */
4692 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4693 #ifdef HAS_SOCKETPAIR
4694 return socketpair(family, type, protocol, fd);
4703 =for apidoc sv_nosharing
4705 Dummy routine which "shares" an SV when there is no sharing module present.
4706 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4707 some level of strict-ness.
4713 Perl_sv_nosharing(pTHX_ SV *sv)
4715 PERL_UNUSED_ARG(sv);
4719 =for apidoc sv_nolocking
4721 Dummy routine which "locks" an SV when there is no locking module present.
4722 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4723 some level of strict-ness.
4729 Perl_sv_nolocking(pTHX_ SV *sv)
4731 PERL_UNUSED_ARG(sv);
4736 =for apidoc sv_nounlocking
4738 Dummy routine which "unlocks" an SV when there is no locking module present.
4739 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4740 some level of strict-ness.
4746 Perl_sv_nounlocking(pTHX_ SV *sv)
4748 PERL_UNUSED_ARG(sv);
4752 Perl_parse_unicode_opts(pTHX_ const char **popt)
4754 const char *p = *popt;
4759 opt = (U32) atoi(p);
4760 while (isDIGIT(*p)) p++;
4761 if (*p && *p != '\n' && *p != '\r')
4762 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4767 case PERL_UNICODE_STDIN:
4768 opt |= PERL_UNICODE_STDIN_FLAG; break;
4769 case PERL_UNICODE_STDOUT:
4770 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4771 case PERL_UNICODE_STDERR:
4772 opt |= PERL_UNICODE_STDERR_FLAG; break;
4773 case PERL_UNICODE_STD:
4774 opt |= PERL_UNICODE_STD_FLAG; break;
4775 case PERL_UNICODE_IN:
4776 opt |= PERL_UNICODE_IN_FLAG; break;
4777 case PERL_UNICODE_OUT:
4778 opt |= PERL_UNICODE_OUT_FLAG; break;
4779 case PERL_UNICODE_INOUT:
4780 opt |= PERL_UNICODE_INOUT_FLAG; break;
4781 case PERL_UNICODE_LOCALE:
4782 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4783 case PERL_UNICODE_ARGV:
4784 opt |= PERL_UNICODE_ARGV_FLAG; break;
4786 if (*p != '\n' && *p != '\r')
4788 "Unknown Unicode option letter '%c'", *p);
4794 opt = PERL_UNICODE_DEFAULT_FLAGS;
4796 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4797 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4798 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4809 * This is really just a quick hack which grabs various garbage
4810 * values. It really should be a real hash algorithm which
4811 * spreads the effect of every input bit onto every output bit,
4812 * if someone who knows about such things would bother to write it.
4813 * Might be a good idea to add that function to CORE as well.
4814 * No numbers below come from careful analysis or anything here,
4815 * except they are primes and SEED_C1 > 1E6 to get a full-width
4816 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4817 * probably be bigger too.
4820 # define SEED_C1 1000003
4821 #define SEED_C4 73819
4823 # define SEED_C1 25747
4824 #define SEED_C4 20639
4828 #define SEED_C5 26107
4830 #ifndef PERL_NO_DEV_RANDOM
4835 # include <starlet.h>
4836 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4837 * in 100-ns units, typically incremented ever 10 ms. */
4838 unsigned int when[2];
4840 # ifdef HAS_GETTIMEOFDAY
4841 struct timeval when;
4847 /* This test is an escape hatch, this symbol isn't set by Configure. */
4848 #ifndef PERL_NO_DEV_RANDOM
4849 #ifndef PERL_RANDOM_DEVICE
4850 /* /dev/random isn't used by default because reads from it will block
4851 * if there isn't enough entropy available. You can compile with
4852 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4853 * is enough real entropy to fill the seed. */
4854 # define PERL_RANDOM_DEVICE "/dev/urandom"
4856 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4858 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4867 _ckvmssts(sys$gettim(when));
4868 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4870 # ifdef HAS_GETTIMEOFDAY
4871 PerlProc_gettimeofday(&when,NULL);
4872 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4875 u = (U32)SEED_C1 * when;
4878 u += SEED_C3 * (U32)PerlProc_getpid();
4879 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4880 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4881 u += SEED_C5 * (U32)PTR2UV(&when);
4887 Perl_get_hash_seed(pTHX)
4889 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4893 while (isSPACE(*s)) s++;
4894 if (s && isDIGIT(*s))
4895 myseed = (UV)Atoul(s);
4897 #ifdef USE_HASH_SEED_EXPLICIT
4901 /* Compute a random seed */
4902 (void)seedDrand01((Rand_seed_t)seed());
4903 myseed = (UV)(Drand01() * (NV)UV_MAX);
4904 #if RANDBITS < (UVSIZE * 8)
4905 /* Since there are not enough randbits to to reach all
4906 * the bits of a UV, the low bits might need extra
4907 * help. Sum in another random number that will
4908 * fill in the low bits. */
4910 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4911 #endif /* RANDBITS < (UVSIZE * 8) */
4912 if (myseed == 0) { /* Superparanoia. */
4913 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4915 Perl_croak(aTHX_ "Your random numbers are not that random");
4918 PL_rehash_seed_set = TRUE;
4925 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4927 const char * const stashpv = CopSTASHPV(c);
4928 const char * const name = HvNAME_get(hv);
4930 if (stashpv == name)
4932 if (stashpv && name)
4933 if (strEQ(stashpv, name))
4940 #ifdef PERL_GLOBAL_STRUCT
4943 Perl_init_global_struct(pTHX)
4945 struct perl_vars *plvarsp = NULL;
4946 #ifdef PERL_GLOBAL_STRUCT
4947 # define PERL_GLOBAL_STRUCT_INIT
4948 # include "opcode.h" /* the ppaddr and check */
4949 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4950 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4951 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4952 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4953 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4957 plvarsp = PL_VarsPtr;
4958 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4964 # define PERLVAR(var,type) /**/
4965 # define PERLVARA(var,n,type) /**/
4966 # define PERLVARI(var,type,init) plvarsp->var = init;
4967 # define PERLVARIC(var,type,init) plvarsp->var = init;
4968 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4969 # include "perlvars.h"
4975 # ifdef PERL_GLOBAL_STRUCT
4976 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4977 if (!plvarsp->Gppaddr)
4979 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4980 if (!plvarsp->Gcheck)
4982 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4983 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4985 # ifdef PERL_SET_VARS
4986 PERL_SET_VARS(plvarsp);
4988 # undef PERL_GLOBAL_STRUCT_INIT
4993 #endif /* PERL_GLOBAL_STRUCT */
4995 #ifdef PERL_GLOBAL_STRUCT
4998 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5000 #ifdef PERL_GLOBAL_STRUCT
5001 # ifdef PERL_UNSET_VARS
5002 PERL_UNSET_VARS(plvarsp);
5004 free(plvarsp->Gppaddr);
5005 free(plvarsp->Gcheck);
5006 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5012 #endif /* PERL_GLOBAL_STRUCT */
5016 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5019 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)
5021 #ifdef PERL_MEM_LOG_STDERR
5022 /* We can't use PerlIO for obvious reasons. */
5023 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5025 "alloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf"\n",
5026 filename, linenumber, funcname,
5027 n, typesize, typename, n * typesize, PTR2UV(newalloc));
5028 PerlLIO_write(2, buf, strlen(buf));
5034 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)
5036 #ifdef PERL_MEM_LOG_STDERR
5037 /* We can't use PerlIO for obvious reasons. */
5038 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5040 "realloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5041 filename, linenumber, funcname,
5042 n, typesize, typename, n * typesize, PTR2UV(oldalloc), PTR2UV(newalloc));
5043 PerlLIO_write(2, buf, strlen(buf));
5049 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5051 #ifdef PERL_MEM_LOG_STDERR
5052 /* We can't use PerlIO for obvious reasons. */
5053 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5054 sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5055 filename, linenumber, funcname, PTR2UV(oldalloc));
5056 PerlLIO_write(2, buf, strlen(buf));
5061 #endif /* PERL_MEM_LOG */
5065 * c-indentation-style: bsd
5067 * indent-tabs-mode: t
5070 * ex: set ts=8 sts=4 sw=4 noet: