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 register const 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 * const 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 * const table = little + littlelen + FBM_TABLE_OFFSET;
573 register const 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 register const unsigned char *big;
637 register I32 previous;
639 register const unsigned char *little;
640 register I32 stop_pos;
641 register const 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 register const 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 * const 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(__SYMBIAN32__)
1499 # if defined(HAS_UNSETENV)
1501 (void)unsetenv(nam);
1503 (void)setenv(nam, val, 1);
1505 # else /* ! HAS_UNSETENV */
1506 (void)setenv(nam, val, 1);
1507 # endif /* HAS_UNSETENV */
1509 # if defined(HAS_UNSETENV)
1511 (void)unsetenv(nam);
1513 const int nlen = strlen(nam);
1514 const int vlen = strlen(val);
1515 char * const new_env =
1516 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1517 my_setenv_format(new_env, nam, nlen, val, vlen);
1518 (void)putenv(new_env);
1520 # else /* ! HAS_UNSETENV */
1522 const int nlen = strlen(nam);
1528 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1529 /* all that work just for this */
1530 my_setenv_format(new_env, nam, nlen, val, vlen);
1531 (void)putenv(new_env);
1532 # endif /* HAS_UNSETENV */
1533 # endif /* __CYGWIN__ */
1534 #ifndef PERL_USE_SAFE_PUTENV
1540 #else /* WIN32 || NETWARE */
1543 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1546 register char *envstr;
1547 const int nlen = strlen(nam);
1554 Newx(envstr, nlen+vlen+2, char);
1555 my_setenv_format(envstr, nam, nlen, val, vlen);
1556 (void)PerlEnv_putenv(envstr);
1560 #endif /* WIN32 || NETWARE */
1564 Perl_setenv_getix(pTHX_ const char *nam)
1567 register const I32 len = strlen(nam);
1569 for (i = 0; environ[i]; i++) {
1572 strnicmp(environ[i],nam,len) == 0
1574 strnEQ(environ[i],nam,len)
1576 && environ[i][len] == '=')
1577 break; /* strnEQ must come first to avoid */
1578 } /* potential SEGV's */
1581 #endif /* !PERL_MICRO */
1583 #endif /* !VMS && !EPOC*/
1585 #ifdef UNLINK_ALL_VERSIONS
1587 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1591 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1596 /* this is a drop-in replacement for bcopy() */
1597 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1599 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1601 char * const retval = to;
1603 if (from - to >= 0) {
1611 *(--to) = *(--from);
1617 /* this is a drop-in replacement for memset() */
1620 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1622 char * const retval = loc;
1630 /* this is a drop-in replacement for bzero() */
1631 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1633 Perl_my_bzero(register char *loc, register I32 len)
1635 char * const retval = loc;
1643 /* this is a drop-in replacement for memcmp() */
1644 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1646 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1648 register const U8 *a = (const U8 *)s1;
1649 register const U8 *b = (const U8 *)s2;
1653 if ((tmp = *a++ - *b++))
1658 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1662 #ifdef USE_CHAR_VSPRINTF
1667 vsprintf(char *dest, const char *pat, char *args)
1671 fakebuf._ptr = dest;
1672 fakebuf._cnt = 32767;
1676 fakebuf._flag = _IOWRT|_IOSTRG;
1677 _doprnt(pat, args, &fakebuf); /* what a kludge */
1678 (void)putc('\0', &fakebuf);
1679 #ifdef USE_CHAR_VSPRINTF
1682 return 0; /* perl doesn't use return value */
1686 #endif /* HAS_VPRINTF */
1689 #if BYTEORDER != 0x4321
1691 Perl_my_swap(pTHX_ short s)
1693 #if (BYTEORDER & 1) == 0
1696 result = ((s & 255) << 8) + ((s >> 8) & 255);
1704 Perl_my_htonl(pTHX_ long l)
1708 char c[sizeof(long)];
1711 #if BYTEORDER == 0x1234
1712 u.c[0] = (l >> 24) & 255;
1713 u.c[1] = (l >> 16) & 255;
1714 u.c[2] = (l >> 8) & 255;
1718 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1719 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1724 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1725 u.c[o & 0xf] = (l >> s) & 255;
1733 Perl_my_ntohl(pTHX_ long l)
1737 char c[sizeof(long)];
1740 #if BYTEORDER == 0x1234
1741 u.c[0] = (l >> 24) & 255;
1742 u.c[1] = (l >> 16) & 255;
1743 u.c[2] = (l >> 8) & 255;
1747 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1748 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1755 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1756 l |= (u.c[o & 0xf] & 255) << s;
1763 #endif /* BYTEORDER != 0x4321 */
1767 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1768 * If these functions are defined,
1769 * the BYTEORDER is neither 0x1234 nor 0x4321.
1770 * However, this is not assumed.
1774 #define HTOLE(name,type) \
1776 name (register type n) \
1780 char c[sizeof(type)]; \
1783 register I32 s = 0; \
1784 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1785 u.c[i] = (n >> s) & 0xFF; \
1790 #define LETOH(name,type) \
1792 name (register type n) \
1796 char c[sizeof(type)]; \
1799 register I32 s = 0; \
1802 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1803 n |= ((type)(u.c[i] & 0xFF)) << s; \
1809 * Big-endian byte order functions.
1812 #define HTOBE(name,type) \
1814 name (register type n) \
1818 char c[sizeof(type)]; \
1821 register I32 s = 8*(sizeof(u.c)-1); \
1822 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1823 u.c[i] = (n >> s) & 0xFF; \
1828 #define BETOH(name,type) \
1830 name (register type n) \
1834 char c[sizeof(type)]; \
1837 register I32 s = 8*(sizeof(u.c)-1); \
1840 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1841 n |= ((type)(u.c[i] & 0xFF)) << s; \
1847 * If we just can't do it...
1850 #define NOT_AVAIL(name,type) \
1852 name (register type n) \
1854 Perl_croak_nocontext(#name "() not available"); \
1855 return n; /* not reached */ \
1859 #if defined(HAS_HTOVS) && !defined(htovs)
1862 #if defined(HAS_HTOVL) && !defined(htovl)
1865 #if defined(HAS_VTOHS) && !defined(vtohs)
1868 #if defined(HAS_VTOHL) && !defined(vtohl)
1872 #ifdef PERL_NEED_MY_HTOLE16
1874 HTOLE(Perl_my_htole16,U16)
1876 NOT_AVAIL(Perl_my_htole16,U16)
1879 #ifdef PERL_NEED_MY_LETOH16
1881 LETOH(Perl_my_letoh16,U16)
1883 NOT_AVAIL(Perl_my_letoh16,U16)
1886 #ifdef PERL_NEED_MY_HTOBE16
1888 HTOBE(Perl_my_htobe16,U16)
1890 NOT_AVAIL(Perl_my_htobe16,U16)
1893 #ifdef PERL_NEED_MY_BETOH16
1895 BETOH(Perl_my_betoh16,U16)
1897 NOT_AVAIL(Perl_my_betoh16,U16)
1901 #ifdef PERL_NEED_MY_HTOLE32
1903 HTOLE(Perl_my_htole32,U32)
1905 NOT_AVAIL(Perl_my_htole32,U32)
1908 #ifdef PERL_NEED_MY_LETOH32
1910 LETOH(Perl_my_letoh32,U32)
1912 NOT_AVAIL(Perl_my_letoh32,U32)
1915 #ifdef PERL_NEED_MY_HTOBE32
1917 HTOBE(Perl_my_htobe32,U32)
1919 NOT_AVAIL(Perl_my_htobe32,U32)
1922 #ifdef PERL_NEED_MY_BETOH32
1924 BETOH(Perl_my_betoh32,U32)
1926 NOT_AVAIL(Perl_my_betoh32,U32)
1930 #ifdef PERL_NEED_MY_HTOLE64
1932 HTOLE(Perl_my_htole64,U64)
1934 NOT_AVAIL(Perl_my_htole64,U64)
1937 #ifdef PERL_NEED_MY_LETOH64
1939 LETOH(Perl_my_letoh64,U64)
1941 NOT_AVAIL(Perl_my_letoh64,U64)
1944 #ifdef PERL_NEED_MY_HTOBE64
1946 HTOBE(Perl_my_htobe64,U64)
1948 NOT_AVAIL(Perl_my_htobe64,U64)
1951 #ifdef PERL_NEED_MY_BETOH64
1953 BETOH(Perl_my_betoh64,U64)
1955 NOT_AVAIL(Perl_my_betoh64,U64)
1959 #ifdef PERL_NEED_MY_HTOLES
1960 HTOLE(Perl_my_htoles,short)
1962 #ifdef PERL_NEED_MY_LETOHS
1963 LETOH(Perl_my_letohs,short)
1965 #ifdef PERL_NEED_MY_HTOBES
1966 HTOBE(Perl_my_htobes,short)
1968 #ifdef PERL_NEED_MY_BETOHS
1969 BETOH(Perl_my_betohs,short)
1972 #ifdef PERL_NEED_MY_HTOLEI
1973 HTOLE(Perl_my_htolei,int)
1975 #ifdef PERL_NEED_MY_LETOHI
1976 LETOH(Perl_my_letohi,int)
1978 #ifdef PERL_NEED_MY_HTOBEI
1979 HTOBE(Perl_my_htobei,int)
1981 #ifdef PERL_NEED_MY_BETOHI
1982 BETOH(Perl_my_betohi,int)
1985 #ifdef PERL_NEED_MY_HTOLEL
1986 HTOLE(Perl_my_htolel,long)
1988 #ifdef PERL_NEED_MY_LETOHL
1989 LETOH(Perl_my_letohl,long)
1991 #ifdef PERL_NEED_MY_HTOBEL
1992 HTOBE(Perl_my_htobel,long)
1994 #ifdef PERL_NEED_MY_BETOHL
1995 BETOH(Perl_my_betohl,long)
1999 Perl_my_swabn(void *ptr, int n)
2001 register char *s = (char *)ptr;
2002 register char *e = s + (n-1);
2005 for (n /= 2; n > 0; s++, e--, n--) {
2013 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2015 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2017 register I32 This, that;
2023 PERL_FLUSHALL_FOR_CHILD;
2024 This = (*mode == 'w');
2028 taint_proper("Insecure %s%s", "EXEC");
2030 if (PerlProc_pipe(p) < 0)
2032 /* Try for another pipe pair for error return */
2033 if (PerlProc_pipe(pp) >= 0)
2035 while ((pid = PerlProc_fork()) < 0) {
2036 if (errno != EAGAIN) {
2037 PerlLIO_close(p[This]);
2038 PerlLIO_close(p[that]);
2040 PerlLIO_close(pp[0]);
2041 PerlLIO_close(pp[1]);
2053 /* Close parent's end of error status pipe (if any) */
2055 PerlLIO_close(pp[0]);
2056 #if defined(HAS_FCNTL) && defined(F_SETFD)
2057 /* Close error pipe automatically if exec works */
2058 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2061 /* Now dup our end of _the_ pipe to right position */
2062 if (p[THIS] != (*mode == 'r')) {
2063 PerlLIO_dup2(p[THIS], *mode == 'r');
2064 PerlLIO_close(p[THIS]);
2065 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2066 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2069 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2070 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2071 /* No automatic close - do it by hand */
2078 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2084 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2090 do_execfree(); /* free any memory malloced by child on fork */
2092 PerlLIO_close(pp[1]);
2093 /* Keep the lower of the two fd numbers */
2094 if (p[that] < p[This]) {
2095 PerlLIO_dup2(p[This], p[that]);
2096 PerlLIO_close(p[This]);
2100 PerlLIO_close(p[that]); /* close child's end of pipe */
2103 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2105 SvUPGRADE(sv,SVt_IV);
2107 PL_forkprocess = pid;
2108 /* If we managed to get status pipe check for exec fail */
2109 if (did_pipes && pid > 0) {
2113 while (n < sizeof(int)) {
2114 n1 = PerlLIO_read(pp[0],
2115 (void*)(((char*)&errkid)+n),
2121 PerlLIO_close(pp[0]);
2123 if (n) { /* Error */
2125 PerlLIO_close(p[This]);
2126 if (n != sizeof(int))
2127 Perl_croak(aTHX_ "panic: kid popen errno read");
2129 pid2 = wait4pid(pid, &status, 0);
2130 } while (pid2 == -1 && errno == EINTR);
2131 errno = errkid; /* Propagate errno from kid */
2136 PerlLIO_close(pp[0]);
2137 return PerlIO_fdopen(p[This], mode);
2139 Perl_croak(aTHX_ "List form of piped open not implemented");
2140 return (PerlIO *) NULL;
2144 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2145 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2147 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2150 register I32 This, that;
2153 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2157 PERL_FLUSHALL_FOR_CHILD;
2160 return my_syspopen(aTHX_ cmd,mode);
2163 This = (*mode == 'w');
2165 if (doexec && PL_tainting) {
2167 taint_proper("Insecure %s%s", "EXEC");
2169 if (PerlProc_pipe(p) < 0)
2171 if (doexec && PerlProc_pipe(pp) >= 0)
2173 while ((pid = PerlProc_fork()) < 0) {
2174 if (errno != EAGAIN) {
2175 PerlLIO_close(p[This]);
2176 PerlLIO_close(p[that]);
2178 PerlLIO_close(pp[0]);
2179 PerlLIO_close(pp[1]);
2182 Perl_croak(aTHX_ "Can't fork");
2195 PerlLIO_close(pp[0]);
2196 #if defined(HAS_FCNTL) && defined(F_SETFD)
2197 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2200 if (p[THIS] != (*mode == 'r')) {
2201 PerlLIO_dup2(p[THIS], *mode == 'r');
2202 PerlLIO_close(p[THIS]);
2203 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2204 PerlLIO_close(p[THAT]);
2207 PerlLIO_close(p[THAT]);
2210 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2217 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2222 /* may or may not use the shell */
2223 do_exec3(cmd, pp[1], did_pipes);
2226 #endif /* defined OS2 */
2227 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2228 SvREADONLY_off(GvSV(tmpgv));
2229 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2230 SvREADONLY_on(GvSV(tmpgv));
2232 #ifdef THREADS_HAVE_PIDS
2233 PL_ppid = (IV)getppid();
2236 #ifdef PERL_USES_PL_PIDSTATUS
2237 hv_clear(PL_pidstatus); /* we have no children */
2243 do_execfree(); /* free any memory malloced by child on vfork */
2245 PerlLIO_close(pp[1]);
2246 if (p[that] < p[This]) {
2247 PerlLIO_dup2(p[This], p[that]);
2248 PerlLIO_close(p[This]);
2252 PerlLIO_close(p[that]);
2255 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2257 SvUPGRADE(sv,SVt_IV);
2259 PL_forkprocess = pid;
2260 if (did_pipes && pid > 0) {
2264 while (n < sizeof(int)) {
2265 n1 = PerlLIO_read(pp[0],
2266 (void*)(((char*)&errkid)+n),
2272 PerlLIO_close(pp[0]);
2274 if (n) { /* Error */
2276 PerlLIO_close(p[This]);
2277 if (n != sizeof(int))
2278 Perl_croak(aTHX_ "panic: kid popen errno read");
2280 pid2 = wait4pid(pid, &status, 0);
2281 } while (pid2 == -1 && errno == EINTR);
2282 errno = errkid; /* Propagate errno from kid */
2287 PerlLIO_close(pp[0]);
2288 return PerlIO_fdopen(p[This], mode);
2291 #if defined(atarist) || defined(EPOC)
2294 Perl_my_popen(pTHX_ char *cmd, char *mode)
2296 PERL_FLUSHALL_FOR_CHILD;
2297 /* Call system's popen() to get a FILE *, then import it.
2298 used 0 for 2nd parameter to PerlIO_importFILE;
2301 return PerlIO_importFILE(popen(cmd, mode), 0);
2305 FILE *djgpp_popen();
2307 Perl_my_popen(pTHX_ char *cmd, char *mode)
2309 PERL_FLUSHALL_FOR_CHILD;
2310 /* Call system's popen() to get a FILE *, then import it.
2311 used 0 for 2nd parameter to PerlIO_importFILE;
2314 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2319 #endif /* !DOSISH */
2321 /* this is called in parent before the fork() */
2323 Perl_atfork_lock(void)
2326 #if defined(USE_ITHREADS)
2327 /* locks must be held in locking order (if any) */
2329 MUTEX_LOCK(&PL_malloc_mutex);
2335 /* this is called in both parent and child after the fork() */
2337 Perl_atfork_unlock(void)
2340 #if defined(USE_ITHREADS)
2341 /* locks must be released in same order as in atfork_lock() */
2343 MUTEX_UNLOCK(&PL_malloc_mutex);
2352 #if defined(HAS_FORK)
2354 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2359 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2360 * handlers elsewhere in the code */
2365 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2366 Perl_croak_nocontext("fork() not available");
2368 #endif /* HAS_FORK */
2373 Perl_dump_fds(pTHX_ char *s)
2378 PerlIO_printf(Perl_debug_log,"%s", s);
2379 for (fd = 0; fd < 32; fd++) {
2380 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2381 PerlIO_printf(Perl_debug_log," %d",fd);
2383 PerlIO_printf(Perl_debug_log,"\n");
2386 #endif /* DUMP_FDS */
2390 dup2(int oldfd, int newfd)
2392 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2395 PerlLIO_close(newfd);
2396 return fcntl(oldfd, F_DUPFD, newfd);
2398 #define DUP2_MAX_FDS 256
2399 int fdtmp[DUP2_MAX_FDS];
2405 PerlLIO_close(newfd);
2406 /* good enough for low fd's... */
2407 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2408 if (fdx >= DUP2_MAX_FDS) {
2416 PerlLIO_close(fdtmp[--fdx]);
2423 #ifdef HAS_SIGACTION
2425 #ifdef MACOS_TRADITIONAL
2426 /* We don't want restart behavior on MacOS */
2431 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2434 struct sigaction act, oact;
2437 /* only "parent" interpreter can diddle signals */
2438 if (PL_curinterp != aTHX)
2439 return (Sighandler_t) SIG_ERR;
2442 act.sa_handler = (void(*)(int))handler;
2443 sigemptyset(&act.sa_mask);
2446 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2447 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2449 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2450 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2451 act.sa_flags |= SA_NOCLDWAIT;
2453 if (sigaction(signo, &act, &oact) == -1)
2454 return (Sighandler_t) SIG_ERR;
2456 return (Sighandler_t) oact.sa_handler;
2460 Perl_rsignal_state(pTHX_ int signo)
2462 struct sigaction oact;
2464 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2465 return (Sighandler_t) SIG_ERR;
2467 return (Sighandler_t) oact.sa_handler;
2471 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2474 struct sigaction act;
2477 /* only "parent" interpreter can diddle signals */
2478 if (PL_curinterp != aTHX)
2482 act.sa_handler = (void(*)(int))handler;
2483 sigemptyset(&act.sa_mask);
2486 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2487 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2489 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2490 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2491 act.sa_flags |= SA_NOCLDWAIT;
2493 return sigaction(signo, &act, save);
2497 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2501 /* only "parent" interpreter can diddle signals */
2502 if (PL_curinterp != aTHX)
2506 return sigaction(signo, save, (struct sigaction *)NULL);
2509 #else /* !HAS_SIGACTION */
2512 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
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;
2520 return PerlProc_signal(signo, handler);
2532 Perl_rsignal_state(pTHX_ int signo)
2535 Sighandler_t oldsig;
2537 #if defined(USE_ITHREADS) && !defined(WIN32)
2538 /* only "parent" interpreter can diddle signals */
2539 if (PL_curinterp != aTHX)
2540 return (Sighandler_t) SIG_ERR;
2544 oldsig = PerlProc_signal(signo, sig_trap);
2545 PerlProc_signal(signo, oldsig);
2547 PerlProc_kill(PerlProc_getpid(), signo);
2552 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2554 #if defined(USE_ITHREADS) && !defined(WIN32)
2555 /* only "parent" interpreter can diddle signals */
2556 if (PL_curinterp != aTHX)
2559 *save = PerlProc_signal(signo, handler);
2560 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2564 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2566 #if defined(USE_ITHREADS) && !defined(WIN32)
2567 /* only "parent" interpreter can diddle signals */
2568 if (PL_curinterp != aTHX)
2571 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2574 #endif /* !HAS_SIGACTION */
2575 #endif /* !PERL_MICRO */
2577 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2578 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2580 Perl_my_pclose(pTHX_ PerlIO *ptr)
2582 Sigsave_t hstat, istat, qstat;
2588 int saved_errno = 0;
2590 int saved_win32_errno;
2594 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2596 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2598 *svp = &PL_sv_undef;
2600 if (pid == -1) { /* Opened by popen. */
2601 return my_syspclose(ptr);
2604 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2605 saved_errno = errno;
2607 saved_win32_errno = GetLastError();
2611 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2614 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2615 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2616 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2619 pid2 = wait4pid(pid, &status, 0);
2620 } while (pid2 == -1 && errno == EINTR);
2622 rsignal_restore(SIGHUP, &hstat);
2623 rsignal_restore(SIGINT, &istat);
2624 rsignal_restore(SIGQUIT, &qstat);
2627 SETERRNO(saved_errno, 0);
2630 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2632 #endif /* !DOSISH */
2634 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2636 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2641 #ifdef PERL_USES_PL_PIDSTATUS
2644 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2645 pid, rather than a string form. */
2646 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2647 if (svp && *svp != &PL_sv_undef) {
2648 *statusp = SvIVX(*svp);
2649 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2657 hv_iterinit(PL_pidstatus);
2658 if ((entry = hv_iternext(PL_pidstatus))) {
2659 SV * const sv = hv_iterval(PL_pidstatus,entry);
2661 const char *spid = hv_iterkey(entry,&len);
2663 assert (len == sizeof(Pid_t));
2664 memcpy((char *)&pid, spid, len);
2665 *statusp = SvIVX(sv);
2666 /* The hash iterator is currently on this entry, so simply
2667 calling hv_delete would trigger the lazy delete, which on
2668 aggregate does more work, beacuse next call to hv_iterinit()
2669 would spot the flag, and have to call the delete routine,
2670 while in the meantime any new entries can't re-use that
2672 hv_iterinit(PL_pidstatus);
2673 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2680 # ifdef HAS_WAITPID_RUNTIME
2681 if (!HAS_WAITPID_RUNTIME)
2684 result = PerlProc_waitpid(pid,statusp,flags);
2687 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2688 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2691 #ifdef PERL_USES_PL_PIDSTATUS
2692 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2697 Perl_croak(aTHX_ "Can't do waitpid with flags");
2699 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2700 pidgone(result,*statusp);
2706 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2709 if (result < 0 && errno == EINTR) {
2714 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2716 #ifdef PERL_USES_PL_PIDSTATUS
2718 Perl_pidgone(pTHX_ Pid_t pid, int status)
2722 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2723 SvUPGRADE(sv,SVt_IV);
2724 SvIV_set(sv, status);
2729 #if defined(atarist) || defined(OS2) || defined(EPOC)
2732 int /* Cannot prototype with I32
2734 my_syspclose(PerlIO *ptr)
2737 Perl_my_pclose(pTHX_ PerlIO *ptr)
2740 /* Needs work for PerlIO ! */
2741 FILE * const f = PerlIO_findFILE(ptr);
2742 I32 result = pclose(f);
2743 PerlIO_releaseFILE(ptr,f);
2751 Perl_my_pclose(pTHX_ PerlIO *ptr)
2753 /* Needs work for PerlIO ! */
2754 FILE * const f = PerlIO_findFILE(ptr);
2755 I32 result = djgpp_pclose(f);
2756 result = (result << 8) & 0xff00;
2757 PerlIO_releaseFILE(ptr,f);
2763 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2766 register const char * const frombase = from;
2769 register const char c = *from;
2774 while (count-- > 0) {
2775 for (todo = len; todo > 0; todo--) {
2784 Perl_same_dirent(pTHX_ const char *a, const char *b)
2786 char *fa = strrchr(a,'/');
2787 char *fb = strrchr(b,'/');
2790 SV * const tmpsv = sv_newmortal();
2803 sv_setpvn(tmpsv, ".", 1);
2805 sv_setpvn(tmpsv, a, fa - a);
2806 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2809 sv_setpvn(tmpsv, ".", 1);
2811 sv_setpvn(tmpsv, b, fb - b);
2812 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2814 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2815 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2817 #endif /* !HAS_RENAME */
2820 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2821 const char *const *const search_ext, I32 flags)
2823 const char *xfound = Nullch;
2824 char *xfailed = Nullch;
2825 char tmpbuf[MAXPATHLEN];
2829 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2830 # define SEARCH_EXTS ".bat", ".cmd", NULL
2831 # define MAX_EXT_LEN 4
2834 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2835 # define MAX_EXT_LEN 4
2838 # define SEARCH_EXTS ".pl", ".com", NULL
2839 # define MAX_EXT_LEN 4
2841 /* additional extensions to try in each dir if scriptname not found */
2843 const char *const exts[] = { SEARCH_EXTS };
2844 const char *const *const ext = search_ext ? search_ext : exts;
2845 int extidx = 0, i = 0;
2846 const char *curext = Nullch;
2848 PERL_UNUSED_ARG(search_ext);
2849 # define MAX_EXT_LEN 0
2853 * If dosearch is true and if scriptname does not contain path
2854 * delimiters, search the PATH for scriptname.
2856 * If SEARCH_EXTS is also defined, will look for each
2857 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2858 * while searching the PATH.
2860 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2861 * proceeds as follows:
2862 * If DOSISH or VMSISH:
2863 * + look for ./scriptname{,.foo,.bar}
2864 * + search the PATH for scriptname{,.foo,.bar}
2867 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2868 * this will not look in '.' if it's not in the PATH)
2873 # ifdef ALWAYS_DEFTYPES
2874 len = strlen(scriptname);
2875 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2876 int idx = 0, deftypes = 1;
2879 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch);
2882 int idx = 0, deftypes = 1;
2885 const int hasdir = (strpbrk(scriptname,":[</") != Nullch);
2887 /* The first time through, just add SEARCH_EXTS to whatever we
2888 * already have, so we can check for default file types. */
2890 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2896 if ((strlen(tmpbuf) + strlen(scriptname)
2897 + MAX_EXT_LEN) >= sizeof tmpbuf)
2898 continue; /* don't search dir with too-long name */
2899 strcat(tmpbuf, scriptname);
2903 if (strEQ(scriptname, "-"))
2905 if (dosearch) { /* Look in '.' first. */
2906 const char *cur = scriptname;
2908 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2910 if (strEQ(ext[i++],curext)) {
2911 extidx = -1; /* already has an ext */
2916 DEBUG_p(PerlIO_printf(Perl_debug_log,
2917 "Looking for %s\n",cur));
2918 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2919 && !S_ISDIR(PL_statbuf.st_mode)) {
2927 if (cur == scriptname) {
2928 len = strlen(scriptname);
2929 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2931 /* FIXME? Convert to memcpy */
2932 cur = strcpy(tmpbuf, scriptname);
2934 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2935 && strcpy(tmpbuf+len, ext[extidx++]));
2940 #ifdef MACOS_TRADITIONAL
2941 if (dosearch && !strchr(scriptname, ':') &&
2942 (s = PerlEnv_getenv("Commands")))
2944 if (dosearch && !strchr(scriptname, '/')
2946 && !strchr(scriptname, '\\')
2948 && (s = PerlEnv_getenv("PATH")))
2953 PL_bufend = s + strlen(s);
2954 while (s < PL_bufend) {
2955 #ifdef MACOS_TRADITIONAL
2956 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2960 #if defined(atarist) || defined(DOSISH)
2965 && *s != ';'; len++, s++) {
2966 if (len < sizeof tmpbuf)
2969 if (len < sizeof tmpbuf)
2971 #else /* ! (atarist || DOSISH) */
2972 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2975 #endif /* ! (atarist || DOSISH) */
2976 #endif /* MACOS_TRADITIONAL */
2979 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2980 continue; /* don't search dir with too-long name */
2981 #ifdef MACOS_TRADITIONAL
2982 if (len && tmpbuf[len - 1] != ':')
2983 tmpbuf[len++] = ':';
2986 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2987 && tmpbuf[len - 1] != '/'
2988 && tmpbuf[len - 1] != '\\'
2991 tmpbuf[len++] = '/';
2992 if (len == 2 && tmpbuf[0] == '.')
2995 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2997 (void)strcpy(tmpbuf + len, scriptname);
3001 len = strlen(tmpbuf);
3002 if (extidx > 0) /* reset after previous loop */
3006 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3007 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3008 if (S_ISDIR(PL_statbuf.st_mode)) {
3012 } while ( retval < 0 /* not there */
3013 && extidx>=0 && ext[extidx] /* try an extension? */
3014 && strcpy(tmpbuf+len, ext[extidx++])
3019 if (S_ISREG(PL_statbuf.st_mode)
3020 && cando(S_IRUSR,TRUE,&PL_statbuf)
3021 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3022 && cando(S_IXUSR,TRUE,&PL_statbuf)
3026 xfound = tmpbuf; /* bingo! */
3030 xfailed = savepv(tmpbuf);
3033 if (!xfound && !seen_dot && !xfailed &&
3034 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3035 || S_ISDIR(PL_statbuf.st_mode)))
3037 seen_dot = 1; /* Disable message. */
3039 if (flags & 1) { /* do or die? */
3040 Perl_croak(aTHX_ "Can't %s %s%s%s",
3041 (xfailed ? "execute" : "find"),
3042 (xfailed ? xfailed : scriptname),
3043 (xfailed ? "" : " on PATH"),
3044 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3046 scriptname = Nullch;
3049 scriptname = xfound;
3051 return (scriptname ? savepv(scriptname) : Nullch);
3054 #ifndef PERL_GET_CONTEXT_DEFINED
3057 Perl_get_context(void)
3060 #if defined(USE_ITHREADS)
3061 # ifdef OLD_PTHREADS_API
3063 if (pthread_getspecific(PL_thr_key, &t))
3064 Perl_croak_nocontext("panic: pthread_getspecific");
3067 # ifdef I_MACH_CTHREADS
3068 return (void*)cthread_data(cthread_self());
3070 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3079 Perl_set_context(void *t)
3082 #if defined(USE_ITHREADS)
3083 # ifdef I_MACH_CTHREADS
3084 cthread_set_data(cthread_self(), t);
3086 if (pthread_setspecific(PL_thr_key, t))
3087 Perl_croak_nocontext("panic: pthread_setspecific");
3094 #endif /* !PERL_GET_CONTEXT_DEFINED */
3096 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3105 Perl_get_op_names(pTHX)
3107 return (char **)PL_op_name;
3111 Perl_get_op_descs(pTHX)
3113 return (char **)PL_op_desc;
3117 Perl_get_no_modify(pTHX)
3119 return PL_no_modify;
3123 Perl_get_opargs(pTHX)
3125 return (U32 *)PL_opargs;
3129 Perl_get_ppaddr(pTHX)
3132 return (PPADDR_t*)PL_ppaddr;
3135 #ifndef HAS_GETENV_LEN
3137 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3139 char * const env_trans = PerlEnv_getenv(env_elem);
3141 *len = strlen(env_trans);
3148 Perl_get_vtbl(pTHX_ int vtbl_id)
3150 const MGVTBL* result = Null(MGVTBL*);
3154 result = &PL_vtbl_sv;
3157 result = &PL_vtbl_env;
3159 case want_vtbl_envelem:
3160 result = &PL_vtbl_envelem;
3163 result = &PL_vtbl_sig;
3165 case want_vtbl_sigelem:
3166 result = &PL_vtbl_sigelem;
3168 case want_vtbl_pack:
3169 result = &PL_vtbl_pack;
3171 case want_vtbl_packelem:
3172 result = &PL_vtbl_packelem;
3174 case want_vtbl_dbline:
3175 result = &PL_vtbl_dbline;
3178 result = &PL_vtbl_isa;
3180 case want_vtbl_isaelem:
3181 result = &PL_vtbl_isaelem;
3183 case want_vtbl_arylen:
3184 result = &PL_vtbl_arylen;
3186 case want_vtbl_glob:
3187 result = &PL_vtbl_glob;
3189 case want_vtbl_mglob:
3190 result = &PL_vtbl_mglob;
3192 case want_vtbl_nkeys:
3193 result = &PL_vtbl_nkeys;
3195 case want_vtbl_taint:
3196 result = &PL_vtbl_taint;
3198 case want_vtbl_substr:
3199 result = &PL_vtbl_substr;
3202 result = &PL_vtbl_vec;
3205 result = &PL_vtbl_pos;
3208 result = &PL_vtbl_bm;
3211 result = &PL_vtbl_fm;
3213 case want_vtbl_uvar:
3214 result = &PL_vtbl_uvar;
3216 case want_vtbl_defelem:
3217 result = &PL_vtbl_defelem;
3219 case want_vtbl_regexp:
3220 result = &PL_vtbl_regexp;
3222 case want_vtbl_regdata:
3223 result = &PL_vtbl_regdata;
3225 case want_vtbl_regdatum:
3226 result = &PL_vtbl_regdatum;
3228 #ifdef USE_LOCALE_COLLATE
3229 case want_vtbl_collxfrm:
3230 result = &PL_vtbl_collxfrm;
3233 case want_vtbl_amagic:
3234 result = &PL_vtbl_amagic;
3236 case want_vtbl_amagicelem:
3237 result = &PL_vtbl_amagicelem;
3239 case want_vtbl_backref:
3240 result = &PL_vtbl_backref;
3242 case want_vtbl_utf8:
3243 result = &PL_vtbl_utf8;
3246 return (MGVTBL*)result;
3250 Perl_my_fflush_all(pTHX)
3252 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3253 return PerlIO_flush(NULL);
3255 # if defined(HAS__FWALK)
3256 extern int fflush(FILE *);
3257 /* undocumented, unprototyped, but very useful BSDism */
3258 extern void _fwalk(int (*)(FILE *));
3262 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3264 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3265 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3267 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3268 open_max = sysconf(_SC_OPEN_MAX);
3271 open_max = FOPEN_MAX;
3274 open_max = OPEN_MAX;
3285 for (i = 0; i < open_max; i++)
3286 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3287 STDIO_STREAM_ARRAY[i]._file < open_max &&
3288 STDIO_STREAM_ARRAY[i]._flag)
3289 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3293 SETERRNO(EBADF,RMS_IFI);
3300 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3302 const char * const func =
3303 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3304 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3306 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3307 const char * const type = OP_IS_SOCKET(op)
3308 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3309 ? "socket" : "filehandle";
3310 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3312 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3313 if (ckWARN(WARN_IO)) {
3314 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3316 Perl_warner(aTHX_ packWARN(WARN_IO),
3317 "Filehandle %s opened only for %sput",
3320 Perl_warner(aTHX_ packWARN(WARN_IO),
3321 "Filehandle opened only for %sput", direction);
3328 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3330 warn_type = WARN_CLOSED;
3334 warn_type = WARN_UNOPENED;
3337 if (ckWARN(warn_type)) {
3338 if (name && *name) {
3339 Perl_warner(aTHX_ packWARN(warn_type),
3340 "%s%s on %s %s %s", func, pars, vile, type, name);
3341 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3343 aTHX_ packWARN(warn_type),
3344 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3349 Perl_warner(aTHX_ packWARN(warn_type),
3350 "%s%s on %s %s", func, pars, vile, type);
3351 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3353 aTHX_ packWARN(warn_type),
3354 "\t(Are you trying to call %s%s on dirhandle?)\n",
3363 /* in ASCII order, not that it matters */
3364 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3367 Perl_ebcdic_control(pTHX_ int ch)
3375 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3376 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3379 if (ctlp == controllablechars)
3380 return('\177'); /* DEL */
3382 return((unsigned char)(ctlp - controllablechars - 1));
3383 } else { /* Want uncontrol */
3384 if (ch == '\177' || ch == -1)
3386 else if (ch == '\157')
3388 else if (ch == '\174')
3390 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3392 else if (ch == '\155')
3394 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3395 return(controllablechars[ch+1]);
3397 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3402 /* To workaround core dumps from the uninitialised tm_zone we get the
3403 * system to give us a reasonable struct to copy. This fix means that
3404 * strftime uses the tm_zone and tm_gmtoff values returned by
3405 * localtime(time()). That should give the desired result most of the
3406 * time. But probably not always!
3408 * This does not address tzname aspects of NETaa14816.
3413 # ifndef STRUCT_TM_HASZONE
3414 # define STRUCT_TM_HASZONE
3418 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3419 # ifndef HAS_TM_TM_ZONE
3420 # define HAS_TM_TM_ZONE
3425 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3427 #ifdef HAS_TM_TM_ZONE
3429 const struct tm* my_tm;
3431 my_tm = localtime(&now);
3433 Copy(my_tm, ptm, 1, struct tm);
3435 PERL_UNUSED_ARG(ptm);
3440 * mini_mktime - normalise struct tm values without the localtime()
3441 * semantics (and overhead) of mktime().
3444 Perl_mini_mktime(pTHX_ struct tm *ptm)
3448 int month, mday, year, jday;
3449 int odd_cent, odd_year;
3451 #define DAYS_PER_YEAR 365
3452 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3453 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3454 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3455 #define SECS_PER_HOUR (60*60)
3456 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3457 /* parentheses deliberately absent on these two, otherwise they don't work */
3458 #define MONTH_TO_DAYS 153/5
3459 #define DAYS_TO_MONTH 5/153
3460 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3461 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3462 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3463 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3466 * Year/day algorithm notes:
3468 * With a suitable offset for numeric value of the month, one can find
3469 * an offset into the year by considering months to have 30.6 (153/5) days,
3470 * using integer arithmetic (i.e., with truncation). To avoid too much
3471 * messing about with leap days, we consider January and February to be
3472 * the 13th and 14th month of the previous year. After that transformation,
3473 * we need the month index we use to be high by 1 from 'normal human' usage,
3474 * so the month index values we use run from 4 through 15.
3476 * Given that, and the rules for the Gregorian calendar (leap years are those
3477 * divisible by 4 unless also divisible by 100, when they must be divisible
3478 * by 400 instead), we can simply calculate the number of days since some
3479 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3480 * the days we derive from our month index, and adding in the day of the
3481 * month. The value used here is not adjusted for the actual origin which
3482 * it normally would use (1 January A.D. 1), since we're not exposing it.
3483 * We're only building the value so we can turn around and get the
3484 * normalised values for the year, month, day-of-month, and day-of-year.
3486 * For going backward, we need to bias the value we're using so that we find
3487 * the right year value. (Basically, we don't want the contribution of
3488 * March 1st to the number to apply while deriving the year). Having done
3489 * that, we 'count up' the contribution to the year number by accounting for
3490 * full quadracenturies (400-year periods) with their extra leap days, plus
3491 * the contribution from full centuries (to avoid counting in the lost leap
3492 * days), plus the contribution from full quad-years (to count in the normal
3493 * leap days), plus the leftover contribution from any non-leap years.
3494 * At this point, if we were working with an actual leap day, we'll have 0
3495 * days left over. This is also true for March 1st, however. So, we have
3496 * to special-case that result, and (earlier) keep track of the 'odd'
3497 * century and year contributions. If we got 4 extra centuries in a qcent,
3498 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3499 * Otherwise, we add back in the earlier bias we removed (the 123 from
3500 * figuring in March 1st), find the month index (integer division by 30.6),
3501 * and the remainder is the day-of-month. We then have to convert back to
3502 * 'real' months (including fixing January and February from being 14/15 in
3503 * the previous year to being in the proper year). After that, to get
3504 * tm_yday, we work with the normalised year and get a new yearday value for
3505 * January 1st, which we subtract from the yearday value we had earlier,
3506 * representing the date we've re-built. This is done from January 1
3507 * because tm_yday is 0-origin.
3509 * Since POSIX time routines are only guaranteed to work for times since the
3510 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3511 * applies Gregorian calendar rules even to dates before the 16th century
3512 * doesn't bother me. Besides, you'd need cultural context for a given
3513 * date to know whether it was Julian or Gregorian calendar, and that's
3514 * outside the scope for this routine. Since we convert back based on the
3515 * same rules we used to build the yearday, you'll only get strange results
3516 * for input which needed normalising, or for the 'odd' century years which
3517 * were leap years in the Julian calander but not in the Gregorian one.
3518 * I can live with that.
3520 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3521 * that's still outside the scope for POSIX time manipulation, so I don't
3525 year = 1900 + ptm->tm_year;
3526 month = ptm->tm_mon;
3527 mday = ptm->tm_mday;
3528 /* allow given yday with no month & mday to dominate the result */
3529 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3532 jday = 1 + ptm->tm_yday;
3541 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3542 yearday += month*MONTH_TO_DAYS + mday + jday;
3544 * Note that we don't know when leap-seconds were or will be,
3545 * so we have to trust the user if we get something which looks
3546 * like a sensible leap-second. Wild values for seconds will
3547 * be rationalised, however.
3549 if ((unsigned) ptm->tm_sec <= 60) {
3556 secs += 60 * ptm->tm_min;
3557 secs += SECS_PER_HOUR * ptm->tm_hour;
3559 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3560 /* got negative remainder, but need positive time */
3561 /* back off an extra day to compensate */
3562 yearday += (secs/SECS_PER_DAY)-1;
3563 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3566 yearday += (secs/SECS_PER_DAY);
3567 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3570 else if (secs >= SECS_PER_DAY) {
3571 yearday += (secs/SECS_PER_DAY);
3572 secs %= SECS_PER_DAY;
3574 ptm->tm_hour = secs/SECS_PER_HOUR;
3575 secs %= SECS_PER_HOUR;
3576 ptm->tm_min = secs/60;
3578 ptm->tm_sec += secs;
3579 /* done with time of day effects */
3581 * The algorithm for yearday has (so far) left it high by 428.
3582 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3583 * bias it by 123 while trying to figure out what year it
3584 * really represents. Even with this tweak, the reverse
3585 * translation fails for years before A.D. 0001.
3586 * It would still fail for Feb 29, but we catch that one below.
3588 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3589 yearday -= YEAR_ADJUST;
3590 year = (yearday / DAYS_PER_QCENT) * 400;
3591 yearday %= DAYS_PER_QCENT;
3592 odd_cent = yearday / DAYS_PER_CENT;
3593 year += odd_cent * 100;
3594 yearday %= DAYS_PER_CENT;
3595 year += (yearday / DAYS_PER_QYEAR) * 4;
3596 yearday %= DAYS_PER_QYEAR;
3597 odd_year = yearday / DAYS_PER_YEAR;
3599 yearday %= DAYS_PER_YEAR;
3600 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3605 yearday += YEAR_ADJUST; /* recover March 1st crock */
3606 month = yearday*DAYS_TO_MONTH;
3607 yearday -= month*MONTH_TO_DAYS;
3608 /* recover other leap-year adjustment */
3617 ptm->tm_year = year - 1900;
3619 ptm->tm_mday = yearday;
3620 ptm->tm_mon = month;
3624 ptm->tm_mon = month - 1;
3626 /* re-build yearday based on Jan 1 to get tm_yday */
3628 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3629 yearday += 14*MONTH_TO_DAYS + 1;
3630 ptm->tm_yday = jday - yearday;
3631 /* fix tm_wday if not overridden by caller */
3632 if ((unsigned)ptm->tm_wday > 6)
3633 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3637 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)
3645 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3648 mytm.tm_hour = hour;
3649 mytm.tm_mday = mday;
3651 mytm.tm_year = year;
3652 mytm.tm_wday = wday;
3653 mytm.tm_yday = yday;
3654 mytm.tm_isdst = isdst;
3656 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3657 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3662 #ifdef HAS_TM_TM_GMTOFF
3663 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3665 #ifdef HAS_TM_TM_ZONE
3666 mytm.tm_zone = mytm2.tm_zone;
3671 Newx(buf, buflen, char);
3672 len = strftime(buf, buflen, fmt, &mytm);
3674 ** The following is needed to handle to the situation where
3675 ** tmpbuf overflows. Basically we want to allocate a buffer
3676 ** and try repeatedly. The reason why it is so complicated
3677 ** is that getting a return value of 0 from strftime can indicate
3678 ** one of the following:
3679 ** 1. buffer overflowed,
3680 ** 2. illegal conversion specifier, or
3681 ** 3. the format string specifies nothing to be returned(not
3682 ** an error). This could be because format is an empty string
3683 ** or it specifies %p that yields an empty string in some locale.
3684 ** If there is a better way to make it portable, go ahead by
3687 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3690 /* Possibly buf overflowed - try again with a bigger buf */
3691 const int fmtlen = strlen(fmt);
3692 const int bufsize = fmtlen + buflen;
3694 Newx(buf, bufsize, char);
3696 buflen = strftime(buf, bufsize, fmt, &mytm);
3697 if (buflen > 0 && buflen < bufsize)
3699 /* heuristic to prevent out-of-memory errors */
3700 if (bufsize > 100*fmtlen) {
3705 Renew(buf, bufsize*2, char);
3710 Perl_croak(aTHX_ "panic: no strftime");
3716 #define SV_CWD_RETURN_UNDEF \
3717 sv_setsv(sv, &PL_sv_undef); \
3720 #define SV_CWD_ISDOT(dp) \
3721 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3722 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3725 =head1 Miscellaneous Functions
3727 =for apidoc getcwd_sv
3729 Fill the sv with current working directory
3734 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3735 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3736 * getcwd(3) if available
3737 * Comments from the orignal:
3738 * This is a faster version of getcwd. It's also more dangerous
3739 * because you might chdir out of a directory that you can't chdir
3743 Perl_getcwd_sv(pTHX_ register SV *sv)
3747 #ifndef INCOMPLETE_TAINTS
3753 char buf[MAXPATHLEN];
3755 /* Some getcwd()s automatically allocate a buffer of the given
3756 * size from the heap if they are given a NULL buffer pointer.
3757 * The problem is that this behaviour is not portable. */
3758 if (getcwd(buf, sizeof(buf) - 1)) {
3759 sv_setpvn(sv, buf, strlen(buf));
3763 sv_setsv(sv, &PL_sv_undef);
3771 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3775 SvUPGRADE(sv, SVt_PV);
3777 if (PerlLIO_lstat(".", &statbuf) < 0) {
3778 SV_CWD_RETURN_UNDEF;
3781 orig_cdev = statbuf.st_dev;
3782 orig_cino = statbuf.st_ino;
3791 if (PerlDir_chdir("..") < 0) {
3792 SV_CWD_RETURN_UNDEF;
3794 if (PerlLIO_stat(".", &statbuf) < 0) {
3795 SV_CWD_RETURN_UNDEF;
3798 cdev = statbuf.st_dev;
3799 cino = statbuf.st_ino;
3801 if (odev == cdev && oino == cino) {
3804 if (!(dir = PerlDir_open("."))) {
3805 SV_CWD_RETURN_UNDEF;
3808 while ((dp = PerlDir_read(dir)) != NULL) {
3810 const int namelen = dp->d_namlen;
3812 const int namelen = strlen(dp->d_name);
3815 if (SV_CWD_ISDOT(dp)) {
3819 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3820 SV_CWD_RETURN_UNDEF;
3823 tdev = statbuf.st_dev;
3824 tino = statbuf.st_ino;
3825 if (tino == oino && tdev == odev) {
3831 SV_CWD_RETURN_UNDEF;
3834 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3835 SV_CWD_RETURN_UNDEF;
3838 SvGROW(sv, pathlen + namelen + 1);
3842 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3845 /* prepend current directory to the front */
3847 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3848 pathlen += (namelen + 1);
3850 #ifdef VOID_CLOSEDIR
3853 if (PerlDir_close(dir) < 0) {
3854 SV_CWD_RETURN_UNDEF;
3860 SvCUR_set(sv, pathlen);
3864 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3865 SV_CWD_RETURN_UNDEF;
3868 if (PerlLIO_stat(".", &statbuf) < 0) {
3869 SV_CWD_RETURN_UNDEF;
3872 cdev = statbuf.st_dev;
3873 cino = statbuf.st_ino;
3875 if (cdev != orig_cdev || cino != orig_cino) {
3876 Perl_croak(aTHX_ "Unstable directory path, "
3877 "current directory changed unexpectedly");
3889 =for apidoc scan_version
3891 Returns a pointer to the next character after the parsed
3892 version string, as well as upgrading the passed in SV to
3895 Function must be called with an already existing SV like
3898 s = scan_version(s,SV *sv, bool qv);
3900 Performs some preprocessing to the string to ensure that
3901 it has the correct characteristics of a version. Flags the
3902 object if it contains an underscore (which denotes this
3903 is a alpha version). The boolean qv denotes that the version
3904 should be interpreted as if it had multiple decimals, even if
3911 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3920 SV *hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3921 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3923 #ifndef NODEFAULT_SHAREKEYS
3924 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3927 while (isSPACE(*s)) /* leading whitespace is OK */
3931 s++; /* get past 'v' */
3932 qv = 1; /* force quoted version processing */
3935 start = last = pos = s;
3937 /* pre-scan the input string to check for decimals/underbars */
3938 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3943 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3947 else if ( *pos == '_' )
3950 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3952 width = pos - last - 1; /* natural width of sub-version */
3957 if ( saw_period > 1 )
3958 qv = 1; /* force quoted version processing */
3963 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
3965 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
3966 if ( !qv && width < 3 )
3967 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3969 while (isDIGIT(*pos))
3971 if (!isALPHA(*pos)) {
3977 /* this is atoi() that delimits on underscores */
3978 const char *end = pos;
3982 /* the following if() will only be true after the decimal
3983 * point of a version originally created with a bare
3984 * floating point number, i.e. not quoted in any way
3986 if ( !qv && s > start && saw_period == 1 ) {
3990 rev += (*s - '0') * mult;
3992 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3993 Perl_croak(aTHX_ "Integer overflow in version");
4000 while (--end >= s) {
4002 rev += (*end - '0') * mult;
4004 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4005 Perl_croak(aTHX_ "Integer overflow in version");
4010 /* Append revision */
4011 av_push(av, newSViv(rev));
4012 if ( *pos == '.' && isDIGIT(pos[1]) )
4014 else if ( *pos == '_' && isDIGIT(pos[1]) )
4016 else if ( isDIGIT(*pos) )
4023 while ( isDIGIT(*pos) )
4028 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4036 if ( qv ) { /* quoted versions always get at least three terms*/
4037 I32 len = av_len(av);
4038 /* This for loop appears to trigger a compiler bug on OS X, as it
4039 loops infinitely. Yes, len is negative. No, it makes no sense.
4040 Compiler in question is:
4041 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4042 for ( len = 2 - len; len > 0; len-- )
4043 av_push((AV *)sv, newSViv(0));
4047 av_push(av, newSViv(0));
4050 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4051 av_push(av, newSViv(0));
4053 /* And finally, store the AV in the hash */
4054 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4059 =for apidoc new_version
4061 Returns a new version object based on the passed in SV:
4063 SV *sv = new_version(SV *ver);
4065 Does not alter the passed in ver SV. See "upg_version" if you
4066 want to upgrade the SV.
4072 Perl_new_version(pTHX_ SV *ver)
4074 SV * const rv = newSV(0);
4075 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4078 AV * const av = newAV();
4080 /* This will get reblessed later if a derived class*/
4081 SV * const hv = newSVrv(rv, "version");
4082 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4083 #ifndef NODEFAULT_SHAREKEYS
4084 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4090 /* Begin copying all of the elements */
4091 if ( hv_exists((HV *)ver, "qv", 2) )
4092 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4094 if ( hv_exists((HV *)ver, "alpha", 5) )
4095 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4097 if ( hv_exists((HV*)ver, "width", 5 ) )
4099 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4100 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4103 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
4104 /* This will get reblessed later if a derived class*/
4105 for ( key = 0; key <= av_len(sav); key++ )
4107 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4108 av_push(av, newSViv(rev));
4111 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4115 if ( SvVOK(ver) ) { /* already a v-string */
4116 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4117 const STRLEN len = mg->mg_len;
4118 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4119 sv_setpvn(rv,version,len);
4124 sv_setsv(rv,ver); /* make a duplicate */
4133 =for apidoc upg_version
4135 In-place upgrade of the supplied SV to a version object.
4137 SV *sv = upg_version(SV *sv);
4139 Returns a pointer to the upgraded SV.
4145 Perl_upg_version(pTHX_ SV *ver)
4150 if ( SvNOK(ver) ) /* may get too much accuracy */
4153 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4154 version = savepv(tbuf);
4157 else if ( SvVOK(ver) ) { /* already a v-string */
4158 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4159 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4163 else /* must be a string or something like a string */
4165 version = savepv(SvPV_nolen(ver));
4167 (void)scan_version(version, ver, qv);
4175 Validates that the SV contains a valid version object.
4177 bool vverify(SV *vobj);
4179 Note that it only confirms the bare minimum structure (so as not to get
4180 confused by derived classes which may contain additional hash entries):
4184 =item * The SV contains a [reference to a] hash
4186 =item * The hash contains a "version" key
4188 =item * The "version" key has [a reference to] an AV as its value
4196 Perl_vverify(pTHX_ SV *vs)
4202 /* see if the appropriate elements exist */
4203 if ( SvTYPE(vs) == SVt_PVHV
4204 && hv_exists((HV*)vs, "version", 7)
4205 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
4206 && SvTYPE(sv) == SVt_PVAV )
4215 Accepts a version object and returns the normalized floating
4216 point representation. Call like:
4220 NOTE: you can pass either the object directly or the SV
4221 contained within the RV.
4227 Perl_vnumify(pTHX_ SV *vs)
4232 SV * const sv = newSV(0);
4238 Perl_croak(aTHX_ "Invalid version object");
4240 /* see if various flags exist */
4241 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4243 if ( hv_exists((HV*)vs, "width", 5 ) )
4244 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4249 /* attempt to retrieve the version array */
4250 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
4251 sv_catpvn(sv,"0",1);
4258 sv_catpvn(sv,"0",1);
4262 digit = SvIV(*av_fetch(av, 0, 0));
4263 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4264 for ( i = 1 ; i < len ; i++ )
4266 digit = SvIV(*av_fetch(av, i, 0));
4268 const int denom = (int)pow(10,(3-width));
4269 const div_t term = div((int)PERL_ABS(digit),denom);
4270 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4273 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4279 digit = SvIV(*av_fetch(av, len, 0));
4280 if ( alpha && width == 3 ) /* alpha version */
4281 sv_catpvn(sv,"_",1);
4282 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4286 sv_catpvn(sv,"000",3);
4294 Accepts a version object and returns the normalized string
4295 representation. Call like:
4299 NOTE: you can pass either the object directly or the SV
4300 contained within the RV.
4306 Perl_vnormal(pTHX_ SV *vs)
4310 SV * const sv = newSV(0);
4316 Perl_croak(aTHX_ "Invalid version object");
4318 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4320 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
4328 digit = SvIV(*av_fetch(av, 0, 0));
4329 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4330 for ( i = 1 ; i < len ; i++ ) {
4331 digit = SvIV(*av_fetch(av, i, 0));
4332 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4337 /* handle last digit specially */
4338 digit = SvIV(*av_fetch(av, len, 0));
4340 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4342 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4345 if ( len <= 2 ) { /* short version, must be at least three */
4346 for ( len = 2 - len; len != 0; len-- )
4347 sv_catpvn(sv,".0",2);
4353 =for apidoc vstringify
4355 In order to maintain maximum compatibility with earlier versions
4356 of Perl, this function will return either the floating point
4357 notation or the multiple dotted notation, depending on whether
4358 the original version contained 1 or more dots, respectively
4364 Perl_vstringify(pTHX_ SV *vs)
4370 Perl_croak(aTHX_ "Invalid version object");
4372 if ( hv_exists((HV *)vs, "qv", 2) )
4381 Version object aware cmp. Both operands must already have been
4382 converted into version objects.
4388 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4391 bool lalpha = FALSE;
4392 bool ralpha = FALSE;
4401 if ( !vverify(lhv) )
4402 Perl_croak(aTHX_ "Invalid version object");
4404 if ( !vverify(rhv) )
4405 Perl_croak(aTHX_ "Invalid version object");
4407 /* get the left hand term */
4408 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
4409 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4412 /* and the right hand term */
4413 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
4414 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4422 while ( i <= m && retval == 0 )
4424 left = SvIV(*av_fetch(lav,i,0));
4425 right = SvIV(*av_fetch(rav,i,0));
4433 /* tiebreaker for alpha with identical terms */
4434 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4436 if ( lalpha && !ralpha )
4440 else if ( ralpha && !lalpha)
4446 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4450 while ( i <= r && retval == 0 )
4452 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4453 retval = -1; /* not a match after all */
4459 while ( i <= l && retval == 0 )
4461 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4462 retval = +1; /* not a match after all */
4470 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4471 # define EMULATE_SOCKETPAIR_UDP
4474 #ifdef EMULATE_SOCKETPAIR_UDP
4476 S_socketpair_udp (int fd[2]) {
4478 /* Fake a datagram socketpair using UDP to localhost. */
4479 int sockets[2] = {-1, -1};
4480 struct sockaddr_in addresses[2];
4482 Sock_size_t size = sizeof(struct sockaddr_in);
4483 unsigned short port;
4486 memset(&addresses, 0, sizeof(addresses));
4489 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4490 if (sockets[i] == -1)
4491 goto tidy_up_and_fail;
4493 addresses[i].sin_family = AF_INET;
4494 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4495 addresses[i].sin_port = 0; /* kernel choses port. */
4496 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4497 sizeof(struct sockaddr_in)) == -1)
4498 goto tidy_up_and_fail;
4501 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4502 for each connect the other socket to it. */
4505 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4507 goto tidy_up_and_fail;
4508 if (size != sizeof(struct sockaddr_in))
4509 goto abort_tidy_up_and_fail;
4510 /* !1 is 0, !0 is 1 */
4511 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4512 sizeof(struct sockaddr_in)) == -1)
4513 goto tidy_up_and_fail;
4516 /* Now we have 2 sockets connected to each other. I don't trust some other
4517 process not to have already sent a packet to us (by random) so send
4518 a packet from each to the other. */
4521 /* I'm going to send my own port number. As a short.
4522 (Who knows if someone somewhere has sin_port as a bitfield and needs
4523 this routine. (I'm assuming crays have socketpair)) */
4524 port = addresses[i].sin_port;
4525 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4526 if (got != sizeof(port)) {
4528 goto tidy_up_and_fail;
4529 goto abort_tidy_up_and_fail;
4533 /* Packets sent. I don't trust them to have arrived though.
4534 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4535 connect to localhost will use a second kernel thread. In 2.6 the
4536 first thread running the connect() returns before the second completes,
4537 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4538 returns 0. Poor programs have tripped up. One poor program's authors'
4539 had a 50-1 reverse stock split. Not sure how connected these were.)
4540 So I don't trust someone not to have an unpredictable UDP stack.
4544 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4545 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4549 FD_SET(sockets[0], &rset);
4550 FD_SET(sockets[1], &rset);
4552 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4553 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4554 || !FD_ISSET(sockets[1], &rset)) {
4555 /* I hope this is portable and appropriate. */
4557 goto tidy_up_and_fail;
4558 goto abort_tidy_up_and_fail;
4562 /* And the paranoia department even now doesn't trust it to have arrive
4563 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4565 struct sockaddr_in readfrom;
4566 unsigned short buffer[2];
4571 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4572 sizeof(buffer), MSG_DONTWAIT,
4573 (struct sockaddr *) &readfrom, &size);
4575 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4577 (struct sockaddr *) &readfrom, &size);
4581 goto tidy_up_and_fail;
4582 if (got != sizeof(port)
4583 || size != sizeof(struct sockaddr_in)
4584 /* Check other socket sent us its port. */
4585 || buffer[0] != (unsigned short) addresses[!i].sin_port
4586 /* Check kernel says we got the datagram from that socket */
4587 || readfrom.sin_family != addresses[!i].sin_family
4588 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4589 || readfrom.sin_port != addresses[!i].sin_port)
4590 goto abort_tidy_up_and_fail;
4593 /* My caller (my_socketpair) has validated that this is non-NULL */
4596 /* I hereby declare this connection open. May God bless all who cross
4600 abort_tidy_up_and_fail:
4601 errno = ECONNABORTED;
4604 const int save_errno = errno;
4605 if (sockets[0] != -1)
4606 PerlLIO_close(sockets[0]);
4607 if (sockets[1] != -1)
4608 PerlLIO_close(sockets[1]);
4613 #endif /* EMULATE_SOCKETPAIR_UDP */
4615 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4617 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4618 /* Stevens says that family must be AF_LOCAL, protocol 0.
4619 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4624 struct sockaddr_in listen_addr;
4625 struct sockaddr_in connect_addr;
4630 || family != AF_UNIX
4633 errno = EAFNOSUPPORT;
4641 #ifdef EMULATE_SOCKETPAIR_UDP
4642 if (type == SOCK_DGRAM)
4643 return S_socketpair_udp(fd);
4646 listener = PerlSock_socket(AF_INET, type, 0);
4649 memset(&listen_addr, 0, sizeof(listen_addr));
4650 listen_addr.sin_family = AF_INET;
4651 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4652 listen_addr.sin_port = 0; /* kernel choses port. */
4653 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4654 sizeof(listen_addr)) == -1)
4655 goto tidy_up_and_fail;
4656 if (PerlSock_listen(listener, 1) == -1)
4657 goto tidy_up_and_fail;
4659 connector = PerlSock_socket(AF_INET, type, 0);
4660 if (connector == -1)
4661 goto tidy_up_and_fail;
4662 /* We want to find out the port number to connect to. */
4663 size = sizeof(connect_addr);
4664 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4666 goto tidy_up_and_fail;
4667 if (size != sizeof(connect_addr))
4668 goto abort_tidy_up_and_fail;
4669 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4670 sizeof(connect_addr)) == -1)
4671 goto tidy_up_and_fail;
4673 size = sizeof(listen_addr);
4674 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4677 goto tidy_up_and_fail;
4678 if (size != sizeof(listen_addr))
4679 goto abort_tidy_up_and_fail;
4680 PerlLIO_close(listener);
4681 /* Now check we are talking to ourself by matching port and host on the
4683 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4685 goto tidy_up_and_fail;
4686 if (size != sizeof(connect_addr)
4687 || listen_addr.sin_family != connect_addr.sin_family
4688 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4689 || listen_addr.sin_port != connect_addr.sin_port) {
4690 goto abort_tidy_up_and_fail;
4696 abort_tidy_up_and_fail:
4698 errno = ECONNABORTED; /* This would be the standard thing to do. */
4700 # ifdef ECONNREFUSED
4701 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4703 errno = ETIMEDOUT; /* Desperation time. */
4708 int save_errno = errno;
4710 PerlLIO_close(listener);
4711 if (connector != -1)
4712 PerlLIO_close(connector);
4714 PerlLIO_close(acceptor);
4720 /* In any case have a stub so that there's code corresponding
4721 * to the my_socketpair in global.sym. */
4723 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4724 #ifdef HAS_SOCKETPAIR
4725 return socketpair(family, type, protocol, fd);
4734 =for apidoc sv_nosharing
4736 Dummy routine which "shares" an SV when there is no sharing module present.
4737 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4738 Exists to avoid test for a NULL function pointer and because it could
4739 potentially warn under some level of strict-ness.
4745 Perl_sv_nosharing(pTHX_ SV *sv)
4747 PERL_UNUSED_ARG(sv);
4751 Perl_parse_unicode_opts(pTHX_ const char **popt)
4753 const char *p = *popt;
4758 opt = (U32) atoi(p);
4759 while (isDIGIT(*p)) p++;
4760 if (*p && *p != '\n' && *p != '\r')
4761 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4766 case PERL_UNICODE_STDIN:
4767 opt |= PERL_UNICODE_STDIN_FLAG; break;
4768 case PERL_UNICODE_STDOUT:
4769 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4770 case PERL_UNICODE_STDERR:
4771 opt |= PERL_UNICODE_STDERR_FLAG; break;
4772 case PERL_UNICODE_STD:
4773 opt |= PERL_UNICODE_STD_FLAG; break;
4774 case PERL_UNICODE_IN:
4775 opt |= PERL_UNICODE_IN_FLAG; break;
4776 case PERL_UNICODE_OUT:
4777 opt |= PERL_UNICODE_OUT_FLAG; break;
4778 case PERL_UNICODE_INOUT:
4779 opt |= PERL_UNICODE_INOUT_FLAG; break;
4780 case PERL_UNICODE_LOCALE:
4781 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4782 case PERL_UNICODE_ARGV:
4783 opt |= PERL_UNICODE_ARGV_FLAG; break;
4785 if (*p != '\n' && *p != '\r')
4787 "Unknown Unicode option letter '%c'", *p);
4793 opt = PERL_UNICODE_DEFAULT_FLAGS;
4795 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4796 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4797 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4808 * This is really just a quick hack which grabs various garbage
4809 * values. It really should be a real hash algorithm which
4810 * spreads the effect of every input bit onto every output bit,
4811 * if someone who knows about such things would bother to write it.
4812 * Might be a good idea to add that function to CORE as well.
4813 * No numbers below come from careful analysis or anything here,
4814 * except they are primes and SEED_C1 > 1E6 to get a full-width
4815 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4816 * probably be bigger too.
4819 # define SEED_C1 1000003
4820 #define SEED_C4 73819
4822 # define SEED_C1 25747
4823 #define SEED_C4 20639
4827 #define SEED_C5 26107
4829 #ifndef PERL_NO_DEV_RANDOM
4834 # include <starlet.h>
4835 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4836 * in 100-ns units, typically incremented ever 10 ms. */
4837 unsigned int when[2];
4839 # ifdef HAS_GETTIMEOFDAY
4840 struct timeval when;
4846 /* This test is an escape hatch, this symbol isn't set by Configure. */
4847 #ifndef PERL_NO_DEV_RANDOM
4848 #ifndef PERL_RANDOM_DEVICE
4849 /* /dev/random isn't used by default because reads from it will block
4850 * if there isn't enough entropy available. You can compile with
4851 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4852 * is enough real entropy to fill the seed. */
4853 # define PERL_RANDOM_DEVICE "/dev/urandom"
4855 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4857 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4866 _ckvmssts(sys$gettim(when));
4867 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4869 # ifdef HAS_GETTIMEOFDAY
4870 PerlProc_gettimeofday(&when,NULL);
4871 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4874 u = (U32)SEED_C1 * when;
4877 u += SEED_C3 * (U32)PerlProc_getpid();
4878 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4879 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4880 u += SEED_C5 * (U32)PTR2UV(&when);
4886 Perl_get_hash_seed(pTHX)
4888 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4892 while (isSPACE(*s)) s++;
4893 if (s && isDIGIT(*s))
4894 myseed = (UV)Atoul(s);
4896 #ifdef USE_HASH_SEED_EXPLICIT
4900 /* Compute a random seed */
4901 (void)seedDrand01((Rand_seed_t)seed());
4902 myseed = (UV)(Drand01() * (NV)UV_MAX);
4903 #if RANDBITS < (UVSIZE * 8)
4904 /* Since there are not enough randbits to to reach all
4905 * the bits of a UV, the low bits might need extra
4906 * help. Sum in another random number that will
4907 * fill in the low bits. */
4909 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4910 #endif /* RANDBITS < (UVSIZE * 8) */
4911 if (myseed == 0) { /* Superparanoia. */
4912 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4914 Perl_croak(aTHX_ "Your random numbers are not that random");
4917 PL_rehash_seed_set = TRUE;
4924 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4926 const char * const stashpv = CopSTASHPV(c);
4927 const char * const name = HvNAME_get(hv);
4929 if (stashpv == name)
4931 if (stashpv && name)
4932 if (strEQ(stashpv, name))
4939 #ifdef PERL_GLOBAL_STRUCT
4942 Perl_init_global_struct(pTHX)
4944 struct perl_vars *plvarsp = NULL;
4945 #ifdef PERL_GLOBAL_STRUCT
4946 # define PERL_GLOBAL_STRUCT_INIT
4947 # include "opcode.h" /* the ppaddr and check */
4948 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4949 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4950 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4951 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4952 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4956 plvarsp = PL_VarsPtr;
4957 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4963 # define PERLVAR(var,type) /**/
4964 # define PERLVARA(var,n,type) /**/
4965 # define PERLVARI(var,type,init) plvarsp->var = init;
4966 # define PERLVARIC(var,type,init) plvarsp->var = init;
4967 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4968 # include "perlvars.h"
4974 # ifdef PERL_GLOBAL_STRUCT
4975 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4976 if (!plvarsp->Gppaddr)
4978 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4979 if (!plvarsp->Gcheck)
4981 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4982 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4984 # ifdef PERL_SET_VARS
4985 PERL_SET_VARS(plvarsp);
4987 # undef PERL_GLOBAL_STRUCT_INIT
4992 #endif /* PERL_GLOBAL_STRUCT */
4994 #ifdef PERL_GLOBAL_STRUCT
4997 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4999 #ifdef PERL_GLOBAL_STRUCT
5000 # ifdef PERL_UNSET_VARS
5001 PERL_UNSET_VARS(plvarsp);
5003 free(plvarsp->Gppaddr);
5004 free(plvarsp->Gcheck);
5005 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5011 #endif /* PERL_GLOBAL_STRUCT */
5015 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5018 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)
5020 #ifdef PERL_MEM_LOG_STDERR
5021 /* We can't use PerlIO for obvious reasons. */
5022 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5024 "alloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf"\n",
5025 filename, linenumber, funcname,
5026 n, typesize, typename, n * typesize, PTR2UV(newalloc));
5027 PerlLIO_write(2, buf, strlen(buf));
5033 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)
5035 #ifdef PERL_MEM_LOG_STDERR
5036 /* We can't use PerlIO for obvious reasons. */
5037 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5039 "realloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5040 filename, linenumber, funcname,
5041 n, typesize, typename, n * typesize, PTR2UV(oldalloc), PTR2UV(newalloc));
5042 PerlLIO_write(2, buf, strlen(buf));
5048 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5050 #ifdef PERL_MEM_LOG_STDERR
5051 /* We can't use PerlIO for obvious reasons. */
5052 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5053 sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5054 filename, linenumber, funcname, PTR2UV(oldalloc));
5055 PerlLIO_write(2, buf, strlen(buf));
5060 #endif /* PERL_MEM_LOG */
5063 =for apidoc my_sprintf
5065 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5066 the length of the string written to the buffer. Only rare pre-ANSI systems
5067 need the wrapper function - usually this is a direct call to C<sprintf>.
5071 #ifndef SPRINTF_RETURNS_STRLEN
5073 Perl_my_sprintf(char *buffer, const char* pat, ...)
5076 va_start(args, pat);
5077 vsprintf(buffer, pat, args);
5079 return strlen(buffer);
5084 Perl_my_clearenv(pTHX)
5087 #if ! defined(PERL_MICRO)
5088 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5090 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5091 # if defined(USE_ENVIRON_ARRAY)
5092 # if defined(USE_ITHREADS)
5093 /* only the parent thread can clobber the process environment */
5094 if (PL_curinterp == aTHX)
5095 # endif /* USE_ITHREADS */
5097 # if ! defined(PERL_USE_SAFE_PUTENV)
5098 if ( !PL_use_safe_putenv) {
5100 if (environ == PL_origenviron)
5101 environ = (char**)safesysmalloc(sizeof(char*));
5103 for (i = 0; environ[i]; i++)
5104 (void)safesysfree(environ[i]);
5107 # else /* PERL_USE_SAFE_PUTENV */
5108 # if defined(HAS_CLEARENV)
5110 # elif defined(HAS_UNSETENV)
5111 int bsiz = 80; /* Most envvar names will be shorter than this. */
5112 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5113 while (*environ != NULL) {
5114 char *e = strchr(*environ, '=');
5115 int l = e ? e - *environ : strlen(*environ);
5117 (void)safesysfree(buf);
5119 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5121 strncpy(buf, *environ, l);
5123 (void)unsetenv(buf);
5125 (void)safesysfree(buf);
5126 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5127 /* Just null environ and accept the leakage. */
5129 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5130 # endif /* ! PERL_USE_SAFE_PUTENV */
5132 # endif /* USE_ENVIRON_ARRAY */
5133 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5134 #endif /* PERL_MICRO */
5139 * c-indentation-style: bsd
5141 * indent-tabs-mode: t
5144 * ex: set ts=8 sts=4 sw=4 noet: