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.
63 /* Can't use PerlIO to write as it allocates memory */
64 PerlLIO_write(PerlIO_fileno(Perl_error_log),
65 PL_no_mem, strlen(PL_no_mem));
67 NORETURN_FUNCTION_END;
70 /* paranoid version of system's malloc() */
73 Perl_safesysmalloc(MEM_SIZE size)
79 PerlIO_printf(Perl_error_log,
80 "Allocation too large: %lx\n", size) FLUSH;
83 #endif /* HAS_64K_LIMIT */
84 #ifdef PERL_TRACK_MEMPOOL
89 Perl_croak_nocontext("panic: malloc");
91 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
92 PERL_ALLOC_CHECK(ptr);
93 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
95 #ifdef PERL_TRACK_MEMPOOL
97 ptr = (Malloc_t)((char*)ptr+sTHX);
104 return write_no_mem();
109 /* paranoid version of system's realloc() */
112 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
116 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
117 Malloc_t PerlMem_realloc();
118 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
122 PerlIO_printf(Perl_error_log,
123 "Reallocation too large: %lx\n", size) FLUSH;
126 #endif /* HAS_64K_LIMIT */
133 return safesysmalloc(size);
134 #ifdef PERL_TRACK_MEMPOOL
135 where = (Malloc_t)((char*)where-sTHX);
137 if (*(tTHX*)where != aTHX) {
138 /* int *nowhere = NULL; *nowhere = 0; */
139 Perl_croak_nocontext("panic: realloc from wrong pool");
144 Perl_croak_nocontext("panic: realloc");
146 ptr = (Malloc_t)PerlMem_realloc(where,size);
147 PERL_ALLOC_CHECK(ptr);
149 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
150 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
153 #ifdef PERL_TRACK_MEMPOOL
154 ptr = (Malloc_t)((char*)ptr+sTHX);
161 return write_no_mem();
166 /* safe version of system's free() */
169 Perl_safesysfree(Malloc_t where)
172 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
175 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
177 #ifdef PERL_TRACK_MEMPOOL
178 where = (Malloc_t)((char*)where-sTHX);
179 if (*(tTHX*)where != aTHX) {
180 /* int *nowhere = NULL; *nowhere = 0; */
181 Perl_croak_nocontext("panic: free from wrong pool");
188 /* safe version of system's calloc() */
191 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
197 if (size * count > 0xffff) {
198 PerlIO_printf(Perl_error_log,
199 "Allocation too large: %lx\n", size * count) FLUSH;
202 #endif /* HAS_64K_LIMIT */
204 if ((long)size < 0 || (long)count < 0)
205 Perl_croak_nocontext("panic: calloc");
208 #ifdef PERL_TRACK_MEMPOOL
211 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
212 PERL_ALLOC_CHECK(ptr);
213 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));
215 memset((void*)ptr, 0, size);
216 #ifdef PERL_TRACK_MEMPOOL
218 ptr = (Malloc_t)((char*)ptr+sTHX);
224 return write_no_mem();
227 /* These must be defined when not using Perl's malloc for binary
232 Malloc_t Perl_malloc (MEM_SIZE nbytes)
235 return (Malloc_t)PerlMem_malloc(nbytes);
238 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
241 return (Malloc_t)PerlMem_calloc(elements, size);
244 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
247 return (Malloc_t)PerlMem_realloc(where, nbytes);
250 Free_t Perl_mfree (Malloc_t where)
258 /* copy a string up to some (non-backslashed) delimiter, if any */
261 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
264 for (tolen = 0; from < fromend; from++, tolen++) {
266 if (from[1] == delim)
275 else if (*from == delim)
286 /* return ptr to little string in big string, NULL if not found */
287 /* This routine was donated by Corey Satten. */
290 Perl_instr(pTHX_ register const char *big, register const char *little)
300 register const char *s, *x;
303 for (x=big,s=little; *s; /**/ ) {
314 return (char*)(big-1);
319 /* same as instr but allow embedded nulls */
322 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
324 register const I32 first = *little;
325 register const char * const littleend = lend;
327 if (!first && little >= littleend)
329 if (bigend - big < littleend - little)
331 bigend -= littleend - little++;
332 while (big <= bigend) {
333 register const char *s, *x;
336 for (x=big,s=little; s < littleend; /**/ ) {
345 return (char*)(big-1);
350 /* reverse of the above--find last substring */
353 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
355 register const char *bigbeg;
356 register const I32 first = *little;
357 register const char * const littleend = lend;
359 if (!first && little >= littleend)
360 return (char*)bigend;
362 big = bigend - (littleend - little++);
363 while (big >= bigbeg) {
364 register const char *s, *x;
367 for (x=big+2,s=little; s < littleend; /**/ ) {
376 return (char*)(big+1);
381 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
383 /* As a space optimization, we do not compile tables for strings of length
384 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
385 special-cased in fbm_instr().
387 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
390 =head1 Miscellaneous Functions
392 =for apidoc fbm_compile
394 Analyses the string in order to make fast searches on it using fbm_instr()
395 -- the Boyer-Moore algorithm.
401 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
403 register const U8 *s;
409 if (flags & FBMcf_TAIL) {
410 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
411 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
412 if (mg && mg->mg_len >= 0)
415 s = (U8*)SvPV_force_mutable(sv, len);
416 SvUPGRADE(sv, SVt_PVBM);
417 if (len == 0) /* TAIL might be on a zero-length string. */
420 const unsigned char *sb;
421 const U8 mlen = (len>255) ? 255 : (U8)len;
424 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
425 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
426 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
427 memset((void*)table, mlen, 256);
428 table[-1] = (U8)flags;
430 sb = s - mlen + 1; /* first char (maybe) */
432 if (table[*s] == mlen)
437 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
440 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
441 for (i = 0; i < len; i++) {
442 if (PL_freq[s[i]] < frequency) {
444 frequency = PL_freq[s[i]];
447 BmRARE(sv) = s[rarest];
448 BmPREVIOUS(sv) = (U16)rarest;
449 BmUSEFUL(sv) = 100; /* Initial value */
450 if (flags & FBMcf_TAIL)
452 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
453 BmRARE(sv),BmPREVIOUS(sv)));
456 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
457 /* If SvTAIL is actually due to \Z or \z, this gives false positives
461 =for apidoc fbm_instr
463 Returns the location of the SV in the string delimited by C<str> and
464 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
465 does not have to be fbm_compiled, but the search will not be as fast
472 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
474 register unsigned char *s;
476 register const unsigned char *little
477 = (const unsigned char *)SvPV_const(littlestr,l);
478 register STRLEN littlelen = l;
479 register const I32 multiline = flags & FBMrf_MULTILINE;
481 if ((STRLEN)(bigend - big) < littlelen) {
482 if ( SvTAIL(littlestr)
483 && ((STRLEN)(bigend - big) == littlelen - 1)
485 || (*big == *little &&
486 memEQ((char *)big, (char *)little, littlelen - 1))))
491 if (littlelen <= 2) { /* Special-cased */
493 if (littlelen == 1) {
494 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
495 /* Know that bigend != big. */
496 if (bigend[-1] == '\n')
497 return (char *)(bigend - 1);
498 return (char *) bigend;
506 if (SvTAIL(littlestr))
507 return (char *) bigend;
511 return (char*)big; /* Cannot be SvTAIL! */
514 if (SvTAIL(littlestr) && !multiline) {
515 if (bigend[-1] == '\n' && bigend[-2] == *little)
516 return (char*)bigend - 2;
517 if (bigend[-1] == *little)
518 return (char*)bigend - 1;
522 /* This should be better than FBM if c1 == c2, and almost
523 as good otherwise: maybe better since we do less indirection.
524 And we save a lot of memory by caching no table. */
525 const unsigned char c1 = little[0];
526 const unsigned char c2 = little[1];
531 while (s <= bigend) {
541 goto check_1char_anchor;
552 goto check_1char_anchor;
555 while (s <= bigend) {
560 goto check_1char_anchor;
569 check_1char_anchor: /* One char and anchor! */
570 if (SvTAIL(littlestr) && (*bigend == *little))
571 return (char *)bigend; /* bigend is already decremented. */
574 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
575 s = bigend - littlelen;
576 if (s >= big && bigend[-1] == '\n' && *s == *little
577 /* Automatically of length > 2 */
578 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
580 return (char*)s; /* how sweet it is */
583 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
585 return (char*)s + 1; /* how sweet it is */
589 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
590 char * const b = ninstr((char*)big,(char*)bigend,
591 (char*)little, (char*)little + littlelen);
593 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
594 /* Chop \n from littlestr: */
595 s = bigend - littlelen + 1;
597 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
606 { /* Do actual FBM. */
607 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
608 register const unsigned char *oldlittle;
610 if (littlelen > (STRLEN)(bigend - big))
612 --littlelen; /* Last char found by table lookup */
615 little += littlelen; /* last char */
621 if ((tmp = table[*s])) {
622 if ((s += tmp) < bigend)
626 else { /* less expensive than calling strncmp() */
627 register unsigned char * const olds = s;
632 if (*--s == *--little)
634 s = olds + 1; /* here we pay the price for failure */
636 if (s < bigend) /* fake up continue to outer loop */
644 if ( s == bigend && (table[-1] & FBMcf_TAIL)
645 && memEQ((char *)(bigend - littlelen),
646 (char *)(oldlittle - littlelen), littlelen) )
647 return (char*)bigend - littlelen;
652 /* start_shift, end_shift are positive quantities which give offsets
653 of ends of some substring of bigstr.
654 If "last" we want the last occurrence.
655 old_posp is the way of communication between consequent calls if
656 the next call needs to find the .
657 The initial *old_posp should be -1.
659 Note that we take into account SvTAIL, so one can get extra
660 optimizations if _ALL flag is set.
663 /* If SvTAIL is actually due to \Z or \z, this gives false positives
664 if PL_multiline. In fact if !PL_multiline the authoritative answer
665 is not supported yet. */
668 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
670 register const unsigned char *big;
672 register I32 previous;
674 register const unsigned char *little;
675 register I32 stop_pos;
676 register const unsigned char *littleend;
680 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
681 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
683 if ( BmRARE(littlestr) == '\n'
684 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
685 little = (const unsigned char *)(SvPVX_const(littlestr));
686 littleend = little + SvCUR(littlestr);
693 little = (const unsigned char *)(SvPVX_const(littlestr));
694 littleend = little + SvCUR(littlestr);
696 /* The value of pos we can start at: */
697 previous = BmPREVIOUS(littlestr);
698 big = (const unsigned char *)(SvPVX_const(bigstr));
699 /* The value of pos we can stop at: */
700 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
701 if (previous + start_shift > stop_pos) {
703 stop_pos does not include SvTAIL in the count, so this check is incorrect
704 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
707 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
712 while (pos < previous + start_shift) {
713 if (!(pos += PL_screamnext[pos]))
718 register const unsigned char *s, *x;
719 if (pos >= stop_pos) break;
720 if (big[pos] != first)
722 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
728 if (s == littleend) {
730 if (!last) return (char *)(big+pos);
733 } while ( pos += PL_screamnext[pos] );
735 return (char *)(big+(*old_posp));
737 if (!SvTAIL(littlestr) || (end_shift > 0))
739 /* Ignore the trailing "\n". This code is not microoptimized */
740 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
741 stop_pos = littleend - little; /* Actual littlestr len */
746 && ((stop_pos == 1) ||
747 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
753 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
755 register const U8 *a = (const U8 *)s1;
756 register const U8 *b = (const U8 *)s2;
758 if (*a != *b && *a != PL_fold[*b])
766 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
769 register const U8 *a = (const U8 *)s1;
770 register const U8 *b = (const U8 *)s2;
772 if (*a != *b && *a != PL_fold_locale[*b])
779 /* copy a string to a safe spot */
782 =head1 Memory Management
786 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
787 string which is a duplicate of C<pv>. The size of the string is
788 determined by C<strlen()>. The memory allocated for the new string can
789 be freed with the C<Safefree()> function.
795 Perl_savepv(pTHX_ const char *pv)
801 const STRLEN pvlen = strlen(pv)+1;
802 Newx(newaddr,pvlen,char);
803 return memcpy(newaddr,pv,pvlen);
808 /* same thing but with a known length */
813 Perl's version of what C<strndup()> would be if it existed. Returns a
814 pointer to a newly allocated string which is a duplicate of the first
815 C<len> bytes from C<pv>. The memory allocated for the new string can be
816 freed with the C<Safefree()> function.
822 Perl_savepvn(pTHX_ const char *pv, register I32 len)
824 register char *newaddr;
826 Newx(newaddr,len+1,char);
827 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
829 /* might not be null terminated */
831 return (char *) CopyD(pv,newaddr,len,char);
834 return (char *) ZeroD(newaddr,len+1,char);
839 =for apidoc savesharedpv
841 A version of C<savepv()> which allocates the duplicate string in memory
842 which is shared between threads.
847 Perl_savesharedpv(pTHX_ const char *pv)
849 register char *newaddr;
854 pvlen = strlen(pv)+1;
855 newaddr = (char*)PerlMemShared_malloc(pvlen);
857 return write_no_mem();
859 return memcpy(newaddr,pv,pvlen);
865 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
866 the passed in SV using C<SvPV()>
872 Perl_savesvpv(pTHX_ SV *sv)
875 const char * const pv = SvPV_const(sv, len);
876 register char *newaddr;
879 Newx(newaddr,len,char);
880 return (char *) CopyD(pv,newaddr,len,char);
884 /* the SV for Perl_form() and mess() is not kept in an arena */
893 return sv_2mortal(newSVpvn("",0));
898 /* Create as PVMG now, to avoid any upgrading later */
900 Newxz(any, 1, XPVMG);
901 SvFLAGS(sv) = SVt_PVMG;
902 SvANY(sv) = (void*)any;
904 SvREFCNT(sv) = 1 << 30; /* practically infinite */
909 #if defined(PERL_IMPLICIT_CONTEXT)
911 Perl_form_nocontext(const char* pat, ...)
917 retval = vform(pat, &args);
921 #endif /* PERL_IMPLICIT_CONTEXT */
924 =head1 Miscellaneous Functions
927 Takes a sprintf-style format pattern and conventional
928 (non-SV) arguments and returns the formatted string.
930 (char *) Perl_form(pTHX_ const char* pat, ...)
932 can be used any place a string (char *) is required:
934 char * s = Perl_form("%d.%d",major,minor);
936 Uses a single private buffer so if you want to format several strings you
937 must explicitly copy the earlier strings away (and free the copies when you
944 Perl_form(pTHX_ const char* pat, ...)
949 retval = vform(pat, &args);
955 Perl_vform(pTHX_ const char *pat, va_list *args)
957 SV * const sv = mess_alloc();
958 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
962 #if defined(PERL_IMPLICIT_CONTEXT)
964 Perl_mess_nocontext(const char *pat, ...)
970 retval = vmess(pat, &args);
974 #endif /* PERL_IMPLICIT_CONTEXT */
977 Perl_mess(pTHX_ const char *pat, ...)
982 retval = vmess(pat, &args);
988 S_closest_cop(pTHX_ COP *cop, const OP *o)
990 /* Look for PL_op starting from o. cop is the last COP we've seen. */
992 if (!o || o == PL_op) return cop;
994 if (o->op_flags & OPf_KIDS) {
996 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1000 /* If the OP_NEXTSTATE has been optimised away we can still use it
1001 * the get the file and line number. */
1003 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1006 /* Keep searching, and return when we've found something. */
1008 new_cop = closest_cop(cop, kid);
1009 if (new_cop) return new_cop;
1013 /* Nothing found. */
1019 Perl_vmess(pTHX_ const char *pat, va_list *args)
1021 SV * const sv = mess_alloc();
1022 static const char dgd[] = " during global destruction.\n";
1024 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1025 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1028 * Try and find the file and line for PL_op. This will usually be
1029 * PL_curcop, but it might be a cop that has been optimised away. We
1030 * can try to find such a cop by searching through the optree starting
1031 * from the sibling of PL_curcop.
1034 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1035 if (!cop) cop = PL_curcop;
1038 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1039 OutCopFILE(cop), (IV)CopLINE(cop));
1040 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1041 const bool line_mode = (RsSIMPLE(PL_rs) &&
1042 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1043 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1044 PL_last_in_gv == PL_argvgv ?
1045 "" : GvNAME(PL_last_in_gv),
1046 line_mode ? "line" : "chunk",
1047 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1049 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1055 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1061 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1062 && (io = GvIO(PL_stderrgv))
1063 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1070 SAVESPTR(PL_stderrgv);
1071 PL_stderrgv = Nullgv;
1073 PUSHSTACKi(PERLSI_MAGIC);
1077 PUSHs(SvTIED_obj((SV*)io, mg));
1078 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1080 call_method("PRINT", G_SCALAR);
1088 /* SFIO can really mess with your errno */
1089 const int e = errno;
1091 PerlIO * const serr = Perl_error_log;
1093 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1094 (void)PerlIO_flush(serr);
1101 /* Common code used by vcroak, vdie and vwarner */
1104 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1109 /* sv_2cv might call Perl_croak() */
1110 SV * const olddiehook = PL_diehook;
1114 SAVESPTR(PL_diehook);
1115 PL_diehook = Nullsv;
1116 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1118 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1125 msg = newSVpvn(message, msglen);
1126 SvFLAGS(msg) |= utf8;
1134 PUSHSTACKi(PERLSI_DIEHOOK);
1138 call_sv((SV*)cv, G_DISCARD);
1145 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1149 const char *message;
1152 SV * const msv = vmess(pat, args);
1153 if (PL_errors && SvCUR(PL_errors)) {
1154 sv_catsv(PL_errors, msv);
1155 message = SvPV_const(PL_errors, *msglen);
1156 SvCUR_set(PL_errors, 0);
1159 message = SvPV_const(msv,*msglen);
1160 *utf8 = SvUTF8(msv);
1166 DEBUG_S(PerlIO_printf(Perl_debug_log,
1167 "%p: die/croak: message = %s\ndiehook = %p\n",
1168 thr, message, PL_diehook));
1170 S_vdie_common(aTHX_ message, *msglen, *utf8);
1176 Perl_vdie(pTHX_ const char* pat, va_list *args)
1178 const char *message;
1179 const int was_in_eval = PL_in_eval;
1183 DEBUG_S(PerlIO_printf(Perl_debug_log,
1184 "%p: die: curstack = %p, mainstack = %p\n",
1185 thr, PL_curstack, PL_mainstack));
1187 message = vdie_croak_common(pat, args, &msglen, &utf8);
1189 PL_restartop = die_where(message, msglen);
1190 SvFLAGS(ERRSV) |= utf8;
1191 DEBUG_S(PerlIO_printf(Perl_debug_log,
1192 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1193 thr, PL_restartop, was_in_eval, PL_top_env));
1194 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1196 return PL_restartop;
1199 #if defined(PERL_IMPLICIT_CONTEXT)
1201 Perl_die_nocontext(const char* pat, ...)
1206 va_start(args, pat);
1207 o = vdie(pat, &args);
1211 #endif /* PERL_IMPLICIT_CONTEXT */
1214 Perl_die(pTHX_ const char* pat, ...)
1218 va_start(args, pat);
1219 o = vdie(pat, &args);
1225 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1227 const char *message;
1231 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1234 PL_restartop = die_where(message, msglen);
1235 SvFLAGS(ERRSV) |= utf8;
1239 message = SvPVx_const(ERRSV, msglen);
1241 write_to_stderr(message, msglen);
1245 #if defined(PERL_IMPLICIT_CONTEXT)
1247 Perl_croak_nocontext(const char *pat, ...)
1251 va_start(args, pat);
1256 #endif /* PERL_IMPLICIT_CONTEXT */
1259 =head1 Warning and Dieing
1263 This is the XSUB-writer's interface to Perl's C<die> function.
1264 Normally call this function the same way you call the C C<printf>
1265 function. Calling C<croak> returns control directly to Perl,
1266 sidestepping the normal C order of execution. See C<warn>.
1268 If you want to throw an exception object, assign the object to
1269 C<$@> and then pass C<Nullch> to croak():
1271 errsv = get_sv("@", TRUE);
1272 sv_setsv(errsv, exception_object);
1279 Perl_croak(pTHX_ const char *pat, ...)
1282 va_start(args, pat);
1289 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1293 SV * const msv = vmess(pat, args);
1294 const I32 utf8 = SvUTF8(msv);
1295 const char * const message = SvPV_const(msv, msglen);
1298 /* sv_2cv might call Perl_warn() */
1299 SV * const oldwarnhook = PL_warnhook;
1305 SAVESPTR(PL_warnhook);
1306 PL_warnhook = Nullsv;
1307 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1309 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1314 SAVESPTR(PL_warnhook);
1315 PL_warnhook = Nullsv;
1317 msg = newSVpvn(message, msglen);
1318 SvFLAGS(msg) |= utf8;
1322 PUSHSTACKi(PERLSI_WARNHOOK);
1326 call_sv((SV*)cv, G_DISCARD);
1333 write_to_stderr(message, msglen);
1336 #if defined(PERL_IMPLICIT_CONTEXT)
1338 Perl_warn_nocontext(const char *pat, ...)
1342 va_start(args, pat);
1346 #endif /* PERL_IMPLICIT_CONTEXT */
1351 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1352 function the same way you call the C C<printf> function. See C<croak>.
1358 Perl_warn(pTHX_ const char *pat, ...)
1361 va_start(args, pat);
1366 #if defined(PERL_IMPLICIT_CONTEXT)
1368 Perl_warner_nocontext(U32 err, const char *pat, ...)
1372 va_start(args, pat);
1373 vwarner(err, pat, &args);
1376 #endif /* PERL_IMPLICIT_CONTEXT */
1379 Perl_warner(pTHX_ U32 err, const char* pat,...)
1382 va_start(args, pat);
1383 vwarner(err, pat, &args);
1388 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1392 SV * const msv = vmess(pat, args);
1394 const char * const message = SvPV_const(msv, msglen);
1395 const I32 utf8 = SvUTF8(msv);
1399 S_vdie_common(aTHX_ message, msglen, utf8);
1402 PL_restartop = die_where(message, msglen);
1403 SvFLAGS(ERRSV) |= utf8;
1406 write_to_stderr(message, msglen);
1410 Perl_vwarn(aTHX_ pat, args);
1414 /* implements the ckWARN? macros */
1417 Perl_ckwarn(pTHX_ U32 w)
1422 && PL_curcop->cop_warnings != pWARN_NONE
1424 PL_curcop->cop_warnings == pWARN_ALL
1425 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1426 || (unpackWARN2(w) &&
1427 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1428 || (unpackWARN3(w) &&
1429 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1430 || (unpackWARN4(w) &&
1431 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1436 isLEXWARN_off && PL_dowarn & G_WARN_ON
1441 /* implements the ckWARN?_d macro */
1444 Perl_ckwarn_d(pTHX_ U32 w)
1448 || PL_curcop->cop_warnings == pWARN_ALL
1450 PL_curcop->cop_warnings != pWARN_NONE
1452 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1453 || (unpackWARN2(w) &&
1454 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1455 || (unpackWARN3(w) &&
1456 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1457 || (unpackWARN4(w) &&
1458 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1466 /* since we've already done strlen() for both nam and val
1467 * we can use that info to make things faster than
1468 * sprintf(s, "%s=%s", nam, val)
1470 #define my_setenv_format(s, nam, nlen, val, vlen) \
1471 Copy(nam, s, nlen, char); \
1473 Copy(val, s+(nlen+1), vlen, char); \
1474 *(s+(nlen+1+vlen)) = '\0'
1476 #ifdef USE_ENVIRON_ARRAY
1477 /* VMS' my_setenv() is in vms.c */
1478 #if !defined(WIN32) && !defined(NETWARE)
1480 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1484 /* only parent thread can modify process environment */
1485 if (PL_curinterp == aTHX)
1488 #ifndef PERL_USE_SAFE_PUTENV
1489 if (!PL_use_safe_putenv) {
1490 /* most putenv()s leak, so we manipulate environ directly */
1491 register I32 i=setenv_getix(nam); /* where does it go? */
1494 if (environ == PL_origenviron) { /* need we copy environment? */
1499 for (max = i; environ[max]; max++) ;
1500 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1501 for (j=0; j<max; j++) { /* copy environment */
1502 const int len = strlen(environ[j]);
1503 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1504 Copy(environ[j], tmpenv[j], len+1, char);
1506 tmpenv[max] = Nullch;
1507 environ = tmpenv; /* tell exec where it is now */
1510 safesysfree(environ[i]);
1511 while (environ[i]) {
1512 environ[i] = environ[i+1];
1517 if (!environ[i]) { /* does not exist yet */
1518 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1519 environ[i+1] = Nullch; /* make sure it's null terminated */
1522 safesysfree(environ[i]);
1526 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1527 /* all that work just for this */
1528 my_setenv_format(environ[i], nam, nlen, val, vlen);
1531 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__)
1532 # if defined(HAS_UNSETENV)
1534 (void)unsetenv(nam);
1536 (void)setenv(nam, val, 1);
1538 # else /* ! HAS_UNSETENV */
1539 (void)setenv(nam, val, 1);
1540 # endif /* HAS_UNSETENV */
1542 # if defined(HAS_UNSETENV)
1544 (void)unsetenv(nam);
1546 const int nlen = strlen(nam);
1547 const int vlen = strlen(val);
1548 char * const new_env =
1549 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1550 my_setenv_format(new_env, nam, nlen, val, vlen);
1551 (void)putenv(new_env);
1553 # else /* ! HAS_UNSETENV */
1555 const int nlen = strlen(nam);
1561 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1562 /* all that work just for this */
1563 my_setenv_format(new_env, nam, nlen, val, vlen);
1564 (void)putenv(new_env);
1565 # endif /* HAS_UNSETENV */
1566 # endif /* __CYGWIN__ */
1567 #ifndef PERL_USE_SAFE_PUTENV
1573 #else /* WIN32 || NETWARE */
1576 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1579 register char *envstr;
1580 const int nlen = strlen(nam);
1587 Newx(envstr, nlen+vlen+2, char);
1588 my_setenv_format(envstr, nam, nlen, val, vlen);
1589 (void)PerlEnv_putenv(envstr);
1593 #endif /* WIN32 || NETWARE */
1597 Perl_setenv_getix(pTHX_ const char *nam)
1600 register const I32 len = strlen(nam);
1602 for (i = 0; environ[i]; i++) {
1605 strnicmp(environ[i],nam,len) == 0
1607 strnEQ(environ[i],nam,len)
1609 && environ[i][len] == '=')
1610 break; /* strnEQ must come first to avoid */
1611 } /* potential SEGV's */
1614 #endif /* !PERL_MICRO */
1616 #endif /* !VMS && !EPOC*/
1618 #ifdef UNLINK_ALL_VERSIONS
1620 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1624 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1629 /* this is a drop-in replacement for bcopy() */
1630 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1632 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1634 char * const retval = to;
1636 if (from - to >= 0) {
1644 *(--to) = *(--from);
1650 /* this is a drop-in replacement for memset() */
1653 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1655 char * const retval = loc;
1663 /* this is a drop-in replacement for bzero() */
1664 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1666 Perl_my_bzero(register char *loc, register I32 len)
1668 char * const retval = loc;
1676 /* this is a drop-in replacement for memcmp() */
1677 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1679 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1681 register const U8 *a = (const U8 *)s1;
1682 register const U8 *b = (const U8 *)s2;
1686 if ((tmp = *a++ - *b++))
1691 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1695 #ifdef USE_CHAR_VSPRINTF
1700 vsprintf(char *dest, const char *pat, char *args)
1704 fakebuf._ptr = dest;
1705 fakebuf._cnt = 32767;
1709 fakebuf._flag = _IOWRT|_IOSTRG;
1710 _doprnt(pat, args, &fakebuf); /* what a kludge */
1711 (void)putc('\0', &fakebuf);
1712 #ifdef USE_CHAR_VSPRINTF
1715 return 0; /* perl doesn't use return value */
1719 #endif /* HAS_VPRINTF */
1722 #if BYTEORDER != 0x4321
1724 Perl_my_swap(pTHX_ short s)
1726 #if (BYTEORDER & 1) == 0
1729 result = ((s & 255) << 8) + ((s >> 8) & 255);
1737 Perl_my_htonl(pTHX_ long l)
1741 char c[sizeof(long)];
1744 #if BYTEORDER == 0x1234
1745 u.c[0] = (l >> 24) & 255;
1746 u.c[1] = (l >> 16) & 255;
1747 u.c[2] = (l >> 8) & 255;
1751 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1752 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1757 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1758 u.c[o & 0xf] = (l >> s) & 255;
1766 Perl_my_ntohl(pTHX_ long l)
1770 char c[sizeof(long)];
1773 #if BYTEORDER == 0x1234
1774 u.c[0] = (l >> 24) & 255;
1775 u.c[1] = (l >> 16) & 255;
1776 u.c[2] = (l >> 8) & 255;
1780 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1781 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1788 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1789 l |= (u.c[o & 0xf] & 255) << s;
1796 #endif /* BYTEORDER != 0x4321 */
1800 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1801 * If these functions are defined,
1802 * the BYTEORDER is neither 0x1234 nor 0x4321.
1803 * However, this is not assumed.
1807 #define HTOLE(name,type) \
1809 name (register type n) \
1813 char c[sizeof(type)]; \
1816 register I32 s = 0; \
1817 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1818 u.c[i] = (n >> s) & 0xFF; \
1823 #define LETOH(name,type) \
1825 name (register type n) \
1829 char c[sizeof(type)]; \
1832 register I32 s = 0; \
1835 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1836 n |= ((type)(u.c[i] & 0xFF)) << s; \
1842 * Big-endian byte order functions.
1845 #define HTOBE(name,type) \
1847 name (register type n) \
1851 char c[sizeof(type)]; \
1854 register I32 s = 8*(sizeof(u.c)-1); \
1855 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1856 u.c[i] = (n >> s) & 0xFF; \
1861 #define BETOH(name,type) \
1863 name (register type n) \
1867 char c[sizeof(type)]; \
1870 register I32 s = 8*(sizeof(u.c)-1); \
1873 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1874 n |= ((type)(u.c[i] & 0xFF)) << s; \
1880 * If we just can't do it...
1883 #define NOT_AVAIL(name,type) \
1885 name (register type n) \
1887 Perl_croak_nocontext(#name "() not available"); \
1888 return n; /* not reached */ \
1892 #if defined(HAS_HTOVS) && !defined(htovs)
1895 #if defined(HAS_HTOVL) && !defined(htovl)
1898 #if defined(HAS_VTOHS) && !defined(vtohs)
1901 #if defined(HAS_VTOHL) && !defined(vtohl)
1905 #ifdef PERL_NEED_MY_HTOLE16
1907 HTOLE(Perl_my_htole16,U16)
1909 NOT_AVAIL(Perl_my_htole16,U16)
1912 #ifdef PERL_NEED_MY_LETOH16
1914 LETOH(Perl_my_letoh16,U16)
1916 NOT_AVAIL(Perl_my_letoh16,U16)
1919 #ifdef PERL_NEED_MY_HTOBE16
1921 HTOBE(Perl_my_htobe16,U16)
1923 NOT_AVAIL(Perl_my_htobe16,U16)
1926 #ifdef PERL_NEED_MY_BETOH16
1928 BETOH(Perl_my_betoh16,U16)
1930 NOT_AVAIL(Perl_my_betoh16,U16)
1934 #ifdef PERL_NEED_MY_HTOLE32
1936 HTOLE(Perl_my_htole32,U32)
1938 NOT_AVAIL(Perl_my_htole32,U32)
1941 #ifdef PERL_NEED_MY_LETOH32
1943 LETOH(Perl_my_letoh32,U32)
1945 NOT_AVAIL(Perl_my_letoh32,U32)
1948 #ifdef PERL_NEED_MY_HTOBE32
1950 HTOBE(Perl_my_htobe32,U32)
1952 NOT_AVAIL(Perl_my_htobe32,U32)
1955 #ifdef PERL_NEED_MY_BETOH32
1957 BETOH(Perl_my_betoh32,U32)
1959 NOT_AVAIL(Perl_my_betoh32,U32)
1963 #ifdef PERL_NEED_MY_HTOLE64
1965 HTOLE(Perl_my_htole64,U64)
1967 NOT_AVAIL(Perl_my_htole64,U64)
1970 #ifdef PERL_NEED_MY_LETOH64
1972 LETOH(Perl_my_letoh64,U64)
1974 NOT_AVAIL(Perl_my_letoh64,U64)
1977 #ifdef PERL_NEED_MY_HTOBE64
1979 HTOBE(Perl_my_htobe64,U64)
1981 NOT_AVAIL(Perl_my_htobe64,U64)
1984 #ifdef PERL_NEED_MY_BETOH64
1986 BETOH(Perl_my_betoh64,U64)
1988 NOT_AVAIL(Perl_my_betoh64,U64)
1992 #ifdef PERL_NEED_MY_HTOLES
1993 HTOLE(Perl_my_htoles,short)
1995 #ifdef PERL_NEED_MY_LETOHS
1996 LETOH(Perl_my_letohs,short)
1998 #ifdef PERL_NEED_MY_HTOBES
1999 HTOBE(Perl_my_htobes,short)
2001 #ifdef PERL_NEED_MY_BETOHS
2002 BETOH(Perl_my_betohs,short)
2005 #ifdef PERL_NEED_MY_HTOLEI
2006 HTOLE(Perl_my_htolei,int)
2008 #ifdef PERL_NEED_MY_LETOHI
2009 LETOH(Perl_my_letohi,int)
2011 #ifdef PERL_NEED_MY_HTOBEI
2012 HTOBE(Perl_my_htobei,int)
2014 #ifdef PERL_NEED_MY_BETOHI
2015 BETOH(Perl_my_betohi,int)
2018 #ifdef PERL_NEED_MY_HTOLEL
2019 HTOLE(Perl_my_htolel,long)
2021 #ifdef PERL_NEED_MY_LETOHL
2022 LETOH(Perl_my_letohl,long)
2024 #ifdef PERL_NEED_MY_HTOBEL
2025 HTOBE(Perl_my_htobel,long)
2027 #ifdef PERL_NEED_MY_BETOHL
2028 BETOH(Perl_my_betohl,long)
2032 Perl_my_swabn(void *ptr, int n)
2034 register char *s = (char *)ptr;
2035 register char *e = s + (n-1);
2038 for (n /= 2; n > 0; s++, e--, n--) {
2046 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2048 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2050 register I32 This, that;
2056 PERL_FLUSHALL_FOR_CHILD;
2057 This = (*mode == 'w');
2061 taint_proper("Insecure %s%s", "EXEC");
2063 if (PerlProc_pipe(p) < 0)
2065 /* Try for another pipe pair for error return */
2066 if (PerlProc_pipe(pp) >= 0)
2068 while ((pid = PerlProc_fork()) < 0) {
2069 if (errno != EAGAIN) {
2070 PerlLIO_close(p[This]);
2071 PerlLIO_close(p[that]);
2073 PerlLIO_close(pp[0]);
2074 PerlLIO_close(pp[1]);
2086 /* Close parent's end of error status pipe (if any) */
2088 PerlLIO_close(pp[0]);
2089 #if defined(HAS_FCNTL) && defined(F_SETFD)
2090 /* Close error pipe automatically if exec works */
2091 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2094 /* Now dup our end of _the_ pipe to right position */
2095 if (p[THIS] != (*mode == 'r')) {
2096 PerlLIO_dup2(p[THIS], *mode == 'r');
2097 PerlLIO_close(p[THIS]);
2098 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2099 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2102 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2103 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2104 /* No automatic close - do it by hand */
2111 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2117 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2123 do_execfree(); /* free any memory malloced by child on fork */
2125 PerlLIO_close(pp[1]);
2126 /* Keep the lower of the two fd numbers */
2127 if (p[that] < p[This]) {
2128 PerlLIO_dup2(p[This], p[that]);
2129 PerlLIO_close(p[This]);
2133 PerlLIO_close(p[that]); /* close child's end of pipe */
2136 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2138 SvUPGRADE(sv,SVt_IV);
2140 PL_forkprocess = pid;
2141 /* If we managed to get status pipe check for exec fail */
2142 if (did_pipes && pid > 0) {
2146 while (n < sizeof(int)) {
2147 n1 = PerlLIO_read(pp[0],
2148 (void*)(((char*)&errkid)+n),
2154 PerlLIO_close(pp[0]);
2156 if (n) { /* Error */
2158 PerlLIO_close(p[This]);
2159 if (n != sizeof(int))
2160 Perl_croak(aTHX_ "panic: kid popen errno read");
2162 pid2 = wait4pid(pid, &status, 0);
2163 } while (pid2 == -1 && errno == EINTR);
2164 errno = errkid; /* Propagate errno from kid */
2169 PerlLIO_close(pp[0]);
2170 return PerlIO_fdopen(p[This], mode);
2172 Perl_croak(aTHX_ "List form of piped open not implemented");
2173 return (PerlIO *) NULL;
2177 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2178 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2180 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2183 register I32 This, that;
2186 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2190 PERL_FLUSHALL_FOR_CHILD;
2193 return my_syspopen(aTHX_ cmd,mode);
2196 This = (*mode == 'w');
2198 if (doexec && PL_tainting) {
2200 taint_proper("Insecure %s%s", "EXEC");
2202 if (PerlProc_pipe(p) < 0)
2204 if (doexec && PerlProc_pipe(pp) >= 0)
2206 while ((pid = PerlProc_fork()) < 0) {
2207 if (errno != EAGAIN) {
2208 PerlLIO_close(p[This]);
2209 PerlLIO_close(p[that]);
2211 PerlLIO_close(pp[0]);
2212 PerlLIO_close(pp[1]);
2215 Perl_croak(aTHX_ "Can't fork");
2228 PerlLIO_close(pp[0]);
2229 #if defined(HAS_FCNTL) && defined(F_SETFD)
2230 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2233 if (p[THIS] != (*mode == 'r')) {
2234 PerlLIO_dup2(p[THIS], *mode == 'r');
2235 PerlLIO_close(p[THIS]);
2236 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2237 PerlLIO_close(p[THAT]);
2240 PerlLIO_close(p[THAT]);
2243 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2250 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2255 /* may or may not use the shell */
2256 do_exec3(cmd, pp[1], did_pipes);
2259 #endif /* defined OS2 */
2260 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2261 SvREADONLY_off(GvSV(tmpgv));
2262 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2263 SvREADONLY_on(GvSV(tmpgv));
2265 #ifdef THREADS_HAVE_PIDS
2266 PL_ppid = (IV)getppid();
2269 #ifdef PERL_USES_PL_PIDSTATUS
2270 hv_clear(PL_pidstatus); /* we have no children */
2276 do_execfree(); /* free any memory malloced by child on vfork */
2278 PerlLIO_close(pp[1]);
2279 if (p[that] < p[This]) {
2280 PerlLIO_dup2(p[This], p[that]);
2281 PerlLIO_close(p[This]);
2285 PerlLIO_close(p[that]);
2288 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2290 SvUPGRADE(sv,SVt_IV);
2292 PL_forkprocess = pid;
2293 if (did_pipes && pid > 0) {
2297 while (n < sizeof(int)) {
2298 n1 = PerlLIO_read(pp[0],
2299 (void*)(((char*)&errkid)+n),
2305 PerlLIO_close(pp[0]);
2307 if (n) { /* Error */
2309 PerlLIO_close(p[This]);
2310 if (n != sizeof(int))
2311 Perl_croak(aTHX_ "panic: kid popen errno read");
2313 pid2 = wait4pid(pid, &status, 0);
2314 } while (pid2 == -1 && errno == EINTR);
2315 errno = errkid; /* Propagate errno from kid */
2320 PerlLIO_close(pp[0]);
2321 return PerlIO_fdopen(p[This], mode);
2324 #if defined(atarist) || defined(EPOC)
2327 Perl_my_popen(pTHX_ char *cmd, char *mode)
2329 PERL_FLUSHALL_FOR_CHILD;
2330 /* Call system's popen() to get a FILE *, then import it.
2331 used 0 for 2nd parameter to PerlIO_importFILE;
2334 return PerlIO_importFILE(popen(cmd, mode), 0);
2338 FILE *djgpp_popen();
2340 Perl_my_popen(pTHX_ char *cmd, char *mode)
2342 PERL_FLUSHALL_FOR_CHILD;
2343 /* Call system's popen() to get a FILE *, then import it.
2344 used 0 for 2nd parameter to PerlIO_importFILE;
2347 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2352 #endif /* !DOSISH */
2354 /* this is called in parent before the fork() */
2356 Perl_atfork_lock(void)
2359 #if defined(USE_ITHREADS)
2360 /* locks must be held in locking order (if any) */
2362 MUTEX_LOCK(&PL_malloc_mutex);
2368 /* this is called in both parent and child after the fork() */
2370 Perl_atfork_unlock(void)
2373 #if defined(USE_ITHREADS)
2374 /* locks must be released in same order as in atfork_lock() */
2376 MUTEX_UNLOCK(&PL_malloc_mutex);
2385 #if defined(HAS_FORK)
2387 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2392 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2393 * handlers elsewhere in the code */
2398 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2399 Perl_croak_nocontext("fork() not available");
2401 #endif /* HAS_FORK */
2406 Perl_dump_fds(pTHX_ char *s)
2411 PerlIO_printf(Perl_debug_log,"%s", s);
2412 for (fd = 0; fd < 32; fd++) {
2413 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2414 PerlIO_printf(Perl_debug_log," %d",fd);
2416 PerlIO_printf(Perl_debug_log,"\n");
2419 #endif /* DUMP_FDS */
2423 dup2(int oldfd, int newfd)
2425 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2428 PerlLIO_close(newfd);
2429 return fcntl(oldfd, F_DUPFD, newfd);
2431 #define DUP2_MAX_FDS 256
2432 int fdtmp[DUP2_MAX_FDS];
2438 PerlLIO_close(newfd);
2439 /* good enough for low fd's... */
2440 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2441 if (fdx >= DUP2_MAX_FDS) {
2449 PerlLIO_close(fdtmp[--fdx]);
2456 #ifdef HAS_SIGACTION
2458 #ifdef MACOS_TRADITIONAL
2459 /* We don't want restart behavior on MacOS */
2464 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2467 struct sigaction act, oact;
2470 /* only "parent" interpreter can diddle signals */
2471 if (PL_curinterp != aTHX)
2472 return (Sighandler_t) SIG_ERR;
2475 act.sa_handler = (void(*)(int))handler;
2476 sigemptyset(&act.sa_mask);
2479 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2480 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2482 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2483 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2484 act.sa_flags |= SA_NOCLDWAIT;
2486 if (sigaction(signo, &act, &oact) == -1)
2487 return (Sighandler_t) SIG_ERR;
2489 return (Sighandler_t) oact.sa_handler;
2493 Perl_rsignal_state(pTHX_ int signo)
2495 struct sigaction oact;
2497 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2498 return (Sighandler_t) SIG_ERR;
2500 return (Sighandler_t) oact.sa_handler;
2504 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2507 struct sigaction act;
2510 /* only "parent" interpreter can diddle signals */
2511 if (PL_curinterp != aTHX)
2515 act.sa_handler = (void(*)(int))handler;
2516 sigemptyset(&act.sa_mask);
2519 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2520 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2522 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2523 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2524 act.sa_flags |= SA_NOCLDWAIT;
2526 return sigaction(signo, &act, save);
2530 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2534 /* only "parent" interpreter can diddle signals */
2535 if (PL_curinterp != aTHX)
2539 return sigaction(signo, save, (struct sigaction *)NULL);
2542 #else /* !HAS_SIGACTION */
2545 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2547 #if defined(USE_ITHREADS) && !defined(WIN32)
2548 /* only "parent" interpreter can diddle signals */
2549 if (PL_curinterp != aTHX)
2550 return (Sighandler_t) SIG_ERR;
2553 return PerlProc_signal(signo, handler);
2565 Perl_rsignal_state(pTHX_ int signo)
2568 Sighandler_t oldsig;
2570 #if defined(USE_ITHREADS) && !defined(WIN32)
2571 /* only "parent" interpreter can diddle signals */
2572 if (PL_curinterp != aTHX)
2573 return (Sighandler_t) SIG_ERR;
2577 oldsig = PerlProc_signal(signo, sig_trap);
2578 PerlProc_signal(signo, oldsig);
2580 PerlProc_kill(PerlProc_getpid(), signo);
2585 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2587 #if defined(USE_ITHREADS) && !defined(WIN32)
2588 /* only "parent" interpreter can diddle signals */
2589 if (PL_curinterp != aTHX)
2592 *save = PerlProc_signal(signo, handler);
2593 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2597 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2599 #if defined(USE_ITHREADS) && !defined(WIN32)
2600 /* only "parent" interpreter can diddle signals */
2601 if (PL_curinterp != aTHX)
2604 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2607 #endif /* !HAS_SIGACTION */
2608 #endif /* !PERL_MICRO */
2610 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2611 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2613 Perl_my_pclose(pTHX_ PerlIO *ptr)
2615 Sigsave_t hstat, istat, qstat;
2621 int saved_errno = 0;
2623 int saved_win32_errno;
2627 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2629 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2631 *svp = &PL_sv_undef;
2633 if (pid == -1) { /* Opened by popen. */
2634 return my_syspclose(ptr);
2637 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2638 saved_errno = errno;
2640 saved_win32_errno = GetLastError();
2644 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2647 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2648 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2649 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2652 pid2 = wait4pid(pid, &status, 0);
2653 } while (pid2 == -1 && errno == EINTR);
2655 rsignal_restore(SIGHUP, &hstat);
2656 rsignal_restore(SIGINT, &istat);
2657 rsignal_restore(SIGQUIT, &qstat);
2660 SETERRNO(saved_errno, 0);
2663 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2665 #endif /* !DOSISH */
2667 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2669 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2674 #ifdef PERL_USES_PL_PIDSTATUS
2677 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2678 pid, rather than a string form. */
2679 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2680 if (svp && *svp != &PL_sv_undef) {
2681 *statusp = SvIVX(*svp);
2682 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2690 hv_iterinit(PL_pidstatus);
2691 if ((entry = hv_iternext(PL_pidstatus))) {
2692 SV * const sv = hv_iterval(PL_pidstatus,entry);
2694 const char * const spid = hv_iterkey(entry,&len);
2696 assert (len == sizeof(Pid_t));
2697 memcpy((char *)&pid, spid, len);
2698 *statusp = SvIVX(sv);
2699 /* The hash iterator is currently on this entry, so simply
2700 calling hv_delete would trigger the lazy delete, which on
2701 aggregate does more work, beacuse next call to hv_iterinit()
2702 would spot the flag, and have to call the delete routine,
2703 while in the meantime any new entries can't re-use that
2705 hv_iterinit(PL_pidstatus);
2706 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2713 # ifdef HAS_WAITPID_RUNTIME
2714 if (!HAS_WAITPID_RUNTIME)
2717 result = PerlProc_waitpid(pid,statusp,flags);
2720 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2721 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2724 #ifdef PERL_USES_PL_PIDSTATUS
2725 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2730 Perl_croak(aTHX_ "Can't do waitpid with flags");
2732 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2733 pidgone(result,*statusp);
2739 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2742 if (result < 0 && errno == EINTR) {
2747 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2749 #ifdef PERL_USES_PL_PIDSTATUS
2751 Perl_pidgone(pTHX_ Pid_t pid, int status)
2755 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2756 SvUPGRADE(sv,SVt_IV);
2757 SvIV_set(sv, status);
2762 #if defined(atarist) || defined(OS2) || defined(EPOC)
2765 int /* Cannot prototype with I32
2767 my_syspclose(PerlIO *ptr)
2770 Perl_my_pclose(pTHX_ PerlIO *ptr)
2773 /* Needs work for PerlIO ! */
2774 FILE * const f = PerlIO_findFILE(ptr);
2775 const I32 result = pclose(f);
2776 PerlIO_releaseFILE(ptr,f);
2784 Perl_my_pclose(pTHX_ PerlIO *ptr)
2786 /* Needs work for PerlIO ! */
2787 FILE * const f = PerlIO_findFILE(ptr);
2788 I32 result = djgpp_pclose(f);
2789 result = (result << 8) & 0xff00;
2790 PerlIO_releaseFILE(ptr,f);
2796 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2799 register const char * const frombase = from;
2802 register const char c = *from;
2807 while (count-- > 0) {
2808 for (todo = len; todo > 0; todo--) {
2817 Perl_same_dirent(pTHX_ const char *a, const char *b)
2819 char *fa = strrchr(a,'/');
2820 char *fb = strrchr(b,'/');
2823 SV * const tmpsv = sv_newmortal();
2836 sv_setpvn(tmpsv, ".", 1);
2838 sv_setpvn(tmpsv, a, fa - a);
2839 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2842 sv_setpvn(tmpsv, ".", 1);
2844 sv_setpvn(tmpsv, b, fb - b);
2845 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2847 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2848 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2850 #endif /* !HAS_RENAME */
2853 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2854 const char *const *const search_ext, I32 flags)
2856 const char *xfound = Nullch;
2857 char *xfailed = Nullch;
2858 char tmpbuf[MAXPATHLEN];
2862 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2863 # define SEARCH_EXTS ".bat", ".cmd", NULL
2864 # define MAX_EXT_LEN 4
2867 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2868 # define MAX_EXT_LEN 4
2871 # define SEARCH_EXTS ".pl", ".com", NULL
2872 # define MAX_EXT_LEN 4
2874 /* additional extensions to try in each dir if scriptname not found */
2876 static const char *const exts[] = { SEARCH_EXTS };
2877 const char *const *const ext = search_ext ? search_ext : exts;
2878 int extidx = 0, i = 0;
2879 const char *curext = Nullch;
2881 PERL_UNUSED_ARG(search_ext);
2882 # define MAX_EXT_LEN 0
2886 * If dosearch is true and if scriptname does not contain path
2887 * delimiters, search the PATH for scriptname.
2889 * If SEARCH_EXTS is also defined, will look for each
2890 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2891 * while searching the PATH.
2893 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2894 * proceeds as follows:
2895 * If DOSISH or VMSISH:
2896 * + look for ./scriptname{,.foo,.bar}
2897 * + search the PATH for scriptname{,.foo,.bar}
2900 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2901 * this will not look in '.' if it's not in the PATH)
2906 # ifdef ALWAYS_DEFTYPES
2907 len = strlen(scriptname);
2908 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2909 int idx = 0, deftypes = 1;
2912 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch);
2915 int idx = 0, deftypes = 1;
2918 const int hasdir = (strpbrk(scriptname,":[</") != Nullch);
2920 /* The first time through, just add SEARCH_EXTS to whatever we
2921 * already have, so we can check for default file types. */
2923 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2929 if ((strlen(tmpbuf) + strlen(scriptname)
2930 + MAX_EXT_LEN) >= sizeof tmpbuf)
2931 continue; /* don't search dir with too-long name */
2932 strcat(tmpbuf, scriptname);
2936 if (strEQ(scriptname, "-"))
2938 if (dosearch) { /* Look in '.' first. */
2939 const char *cur = scriptname;
2941 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2943 if (strEQ(ext[i++],curext)) {
2944 extidx = -1; /* already has an ext */
2949 DEBUG_p(PerlIO_printf(Perl_debug_log,
2950 "Looking for %s\n",cur));
2951 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2952 && !S_ISDIR(PL_statbuf.st_mode)) {
2960 if (cur == scriptname) {
2961 len = strlen(scriptname);
2962 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2964 /* FIXME? Convert to memcpy */
2965 cur = strcpy(tmpbuf, scriptname);
2967 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2968 && strcpy(tmpbuf+len, ext[extidx++]));
2973 #ifdef MACOS_TRADITIONAL
2974 if (dosearch && !strchr(scriptname, ':') &&
2975 (s = PerlEnv_getenv("Commands")))
2977 if (dosearch && !strchr(scriptname, '/')
2979 && !strchr(scriptname, '\\')
2981 && (s = PerlEnv_getenv("PATH")))
2986 PL_bufend = s + strlen(s);
2987 while (s < PL_bufend) {
2988 #ifdef MACOS_TRADITIONAL
2989 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2993 #if defined(atarist) || defined(DOSISH)
2998 && *s != ';'; len++, s++) {
2999 if (len < sizeof tmpbuf)
3002 if (len < sizeof tmpbuf)
3004 #else /* ! (atarist || DOSISH) */
3005 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3008 #endif /* ! (atarist || DOSISH) */
3009 #endif /* MACOS_TRADITIONAL */
3012 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3013 continue; /* don't search dir with too-long name */
3014 #ifdef MACOS_TRADITIONAL
3015 if (len && tmpbuf[len - 1] != ':')
3016 tmpbuf[len++] = ':';
3019 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3020 && tmpbuf[len - 1] != '/'
3021 && tmpbuf[len - 1] != '\\'
3024 tmpbuf[len++] = '/';
3025 if (len == 2 && tmpbuf[0] == '.')
3028 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
3030 (void)strcpy(tmpbuf + len, scriptname);
3034 len = strlen(tmpbuf);
3035 if (extidx > 0) /* reset after previous loop */
3039 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3040 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3041 if (S_ISDIR(PL_statbuf.st_mode)) {
3045 } while ( retval < 0 /* not there */
3046 && extidx>=0 && ext[extidx] /* try an extension? */
3047 && strcpy(tmpbuf+len, ext[extidx++])
3052 if (S_ISREG(PL_statbuf.st_mode)
3053 && cando(S_IRUSR,TRUE,&PL_statbuf)
3054 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3055 && cando(S_IXUSR,TRUE,&PL_statbuf)
3059 xfound = tmpbuf; /* bingo! */
3063 xfailed = savepv(tmpbuf);
3066 if (!xfound && !seen_dot && !xfailed &&
3067 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3068 || S_ISDIR(PL_statbuf.st_mode)))
3070 seen_dot = 1; /* Disable message. */
3072 if (flags & 1) { /* do or die? */
3073 Perl_croak(aTHX_ "Can't %s %s%s%s",
3074 (xfailed ? "execute" : "find"),
3075 (xfailed ? xfailed : scriptname),
3076 (xfailed ? "" : " on PATH"),
3077 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3079 scriptname = Nullch;
3082 scriptname = xfound;
3084 return (scriptname ? savepv(scriptname) : Nullch);
3087 #ifndef PERL_GET_CONTEXT_DEFINED
3090 Perl_get_context(void)
3093 #if defined(USE_ITHREADS)
3094 # ifdef OLD_PTHREADS_API
3096 if (pthread_getspecific(PL_thr_key, &t))
3097 Perl_croak_nocontext("panic: pthread_getspecific");
3100 # ifdef I_MACH_CTHREADS
3101 return (void*)cthread_data(cthread_self());
3103 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3112 Perl_set_context(void *t)
3115 #if defined(USE_ITHREADS)
3116 # ifdef I_MACH_CTHREADS
3117 cthread_set_data(cthread_self(), t);
3119 if (pthread_setspecific(PL_thr_key, t))
3120 Perl_croak_nocontext("panic: pthread_setspecific");
3127 #endif /* !PERL_GET_CONTEXT_DEFINED */
3129 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3138 Perl_get_op_names(pTHX)
3140 return (char **)PL_op_name;
3144 Perl_get_op_descs(pTHX)
3146 return (char **)PL_op_desc;
3150 Perl_get_no_modify(pTHX)
3152 return PL_no_modify;
3156 Perl_get_opargs(pTHX)
3158 return (U32 *)PL_opargs;
3162 Perl_get_ppaddr(pTHX)
3165 return (PPADDR_t*)PL_ppaddr;
3168 #ifndef HAS_GETENV_LEN
3170 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3172 char * const env_trans = PerlEnv_getenv(env_elem);
3174 *len = strlen(env_trans);
3181 Perl_get_vtbl(pTHX_ int vtbl_id)
3183 const MGVTBL* result;
3187 result = &PL_vtbl_sv;
3190 result = &PL_vtbl_env;
3192 case want_vtbl_envelem:
3193 result = &PL_vtbl_envelem;
3196 result = &PL_vtbl_sig;
3198 case want_vtbl_sigelem:
3199 result = &PL_vtbl_sigelem;
3201 case want_vtbl_pack:
3202 result = &PL_vtbl_pack;
3204 case want_vtbl_packelem:
3205 result = &PL_vtbl_packelem;
3207 case want_vtbl_dbline:
3208 result = &PL_vtbl_dbline;
3211 result = &PL_vtbl_isa;
3213 case want_vtbl_isaelem:
3214 result = &PL_vtbl_isaelem;
3216 case want_vtbl_arylen:
3217 result = &PL_vtbl_arylen;
3219 case want_vtbl_glob:
3220 result = &PL_vtbl_glob;
3222 case want_vtbl_mglob:
3223 result = &PL_vtbl_mglob;
3225 case want_vtbl_nkeys:
3226 result = &PL_vtbl_nkeys;
3228 case want_vtbl_taint:
3229 result = &PL_vtbl_taint;
3231 case want_vtbl_substr:
3232 result = &PL_vtbl_substr;
3235 result = &PL_vtbl_vec;
3238 result = &PL_vtbl_pos;
3241 result = &PL_vtbl_bm;
3244 result = &PL_vtbl_fm;
3246 case want_vtbl_uvar:
3247 result = &PL_vtbl_uvar;
3249 case want_vtbl_defelem:
3250 result = &PL_vtbl_defelem;
3252 case want_vtbl_regexp:
3253 result = &PL_vtbl_regexp;
3255 case want_vtbl_regdata:
3256 result = &PL_vtbl_regdata;
3258 case want_vtbl_regdatum:
3259 result = &PL_vtbl_regdatum;
3261 #ifdef USE_LOCALE_COLLATE
3262 case want_vtbl_collxfrm:
3263 result = &PL_vtbl_collxfrm;
3266 case want_vtbl_amagic:
3267 result = &PL_vtbl_amagic;
3269 case want_vtbl_amagicelem:
3270 result = &PL_vtbl_amagicelem;
3272 case want_vtbl_backref:
3273 result = &PL_vtbl_backref;
3275 case want_vtbl_utf8:
3276 result = &PL_vtbl_utf8;
3279 result = Null(MGVTBL*);
3282 return (MGVTBL*)result;
3286 Perl_my_fflush_all(pTHX)
3288 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3289 return PerlIO_flush(NULL);
3291 # if defined(HAS__FWALK)
3292 extern int fflush(FILE *);
3293 /* undocumented, unprototyped, but very useful BSDism */
3294 extern void _fwalk(int (*)(FILE *));
3298 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3300 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3301 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3303 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3304 open_max = sysconf(_SC_OPEN_MAX);
3307 open_max = FOPEN_MAX;
3310 open_max = OPEN_MAX;
3321 for (i = 0; i < open_max; i++)
3322 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3323 STDIO_STREAM_ARRAY[i]._file < open_max &&
3324 STDIO_STREAM_ARRAY[i]._flag)
3325 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3329 SETERRNO(EBADF,RMS_IFI);
3336 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3338 const char * const func =
3339 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3340 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3342 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3343 const char * const type = OP_IS_SOCKET(op)
3344 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3345 ? "socket" : "filehandle";
3346 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3348 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3349 if (ckWARN(WARN_IO)) {
3350 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3352 Perl_warner(aTHX_ packWARN(WARN_IO),
3353 "Filehandle %s opened only for %sput",
3356 Perl_warner(aTHX_ packWARN(WARN_IO),
3357 "Filehandle opened only for %sput", direction);
3364 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3366 warn_type = WARN_CLOSED;
3370 warn_type = WARN_UNOPENED;
3373 if (ckWARN(warn_type)) {
3374 if (name && *name) {
3375 Perl_warner(aTHX_ packWARN(warn_type),
3376 "%s%s on %s %s %s", func, pars, vile, type, name);
3377 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3379 aTHX_ packWARN(warn_type),
3380 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3385 Perl_warner(aTHX_ packWARN(warn_type),
3386 "%s%s on %s %s", func, pars, vile, type);
3387 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3389 aTHX_ packWARN(warn_type),
3390 "\t(Are you trying to call %s%s on dirhandle?)\n",
3399 /* in ASCII order, not that it matters */
3400 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3403 Perl_ebcdic_control(pTHX_ int ch)
3411 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3412 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3415 if (ctlp == controllablechars)
3416 return('\177'); /* DEL */
3418 return((unsigned char)(ctlp - controllablechars - 1));
3419 } else { /* Want uncontrol */
3420 if (ch == '\177' || ch == -1)
3422 else if (ch == '\157')
3424 else if (ch == '\174')
3426 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3428 else if (ch == '\155')
3430 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3431 return(controllablechars[ch+1]);
3433 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3438 /* To workaround core dumps from the uninitialised tm_zone we get the
3439 * system to give us a reasonable struct to copy. This fix means that
3440 * strftime uses the tm_zone and tm_gmtoff values returned by
3441 * localtime(time()). That should give the desired result most of the
3442 * time. But probably not always!
3444 * This does not address tzname aspects of NETaa14816.
3449 # ifndef STRUCT_TM_HASZONE
3450 # define STRUCT_TM_HASZONE
3454 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3455 # ifndef HAS_TM_TM_ZONE
3456 # define HAS_TM_TM_ZONE
3461 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3463 #ifdef HAS_TM_TM_ZONE
3465 const struct tm* my_tm;
3467 my_tm = localtime(&now);
3469 Copy(my_tm, ptm, 1, struct tm);
3471 PERL_UNUSED_ARG(ptm);
3476 * mini_mktime - normalise struct tm values without the localtime()
3477 * semantics (and overhead) of mktime().
3480 Perl_mini_mktime(pTHX_ struct tm *ptm)
3484 int month, mday, year, jday;
3485 int odd_cent, odd_year;
3487 #define DAYS_PER_YEAR 365
3488 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3489 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3490 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3491 #define SECS_PER_HOUR (60*60)
3492 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3493 /* parentheses deliberately absent on these two, otherwise they don't work */
3494 #define MONTH_TO_DAYS 153/5
3495 #define DAYS_TO_MONTH 5/153
3496 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3497 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3498 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3499 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3502 * Year/day algorithm notes:
3504 * With a suitable offset for numeric value of the month, one can find
3505 * an offset into the year by considering months to have 30.6 (153/5) days,
3506 * using integer arithmetic (i.e., with truncation). To avoid too much
3507 * messing about with leap days, we consider January and February to be
3508 * the 13th and 14th month of the previous year. After that transformation,
3509 * we need the month index we use to be high by 1 from 'normal human' usage,
3510 * so the month index values we use run from 4 through 15.
3512 * Given that, and the rules for the Gregorian calendar (leap years are those
3513 * divisible by 4 unless also divisible by 100, when they must be divisible
3514 * by 400 instead), we can simply calculate the number of days since some
3515 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3516 * the days we derive from our month index, and adding in the day of the
3517 * month. The value used here is not adjusted for the actual origin which
3518 * it normally would use (1 January A.D. 1), since we're not exposing it.
3519 * We're only building the value so we can turn around and get the
3520 * normalised values for the year, month, day-of-month, and day-of-year.
3522 * For going backward, we need to bias the value we're using so that we find
3523 * the right year value. (Basically, we don't want the contribution of
3524 * March 1st to the number to apply while deriving the year). Having done
3525 * that, we 'count up' the contribution to the year number by accounting for
3526 * full quadracenturies (400-year periods) with their extra leap days, plus
3527 * the contribution from full centuries (to avoid counting in the lost leap
3528 * days), plus the contribution from full quad-years (to count in the normal
3529 * leap days), plus the leftover contribution from any non-leap years.
3530 * At this point, if we were working with an actual leap day, we'll have 0
3531 * days left over. This is also true for March 1st, however. So, we have
3532 * to special-case that result, and (earlier) keep track of the 'odd'
3533 * century and year contributions. If we got 4 extra centuries in a qcent,
3534 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3535 * Otherwise, we add back in the earlier bias we removed (the 123 from
3536 * figuring in March 1st), find the month index (integer division by 30.6),
3537 * and the remainder is the day-of-month. We then have to convert back to
3538 * 'real' months (including fixing January and February from being 14/15 in
3539 * the previous year to being in the proper year). After that, to get
3540 * tm_yday, we work with the normalised year and get a new yearday value for
3541 * January 1st, which we subtract from the yearday value we had earlier,
3542 * representing the date we've re-built. This is done from January 1
3543 * because tm_yday is 0-origin.
3545 * Since POSIX time routines are only guaranteed to work for times since the
3546 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3547 * applies Gregorian calendar rules even to dates before the 16th century
3548 * doesn't bother me. Besides, you'd need cultural context for a given
3549 * date to know whether it was Julian or Gregorian calendar, and that's
3550 * outside the scope for this routine. Since we convert back based on the
3551 * same rules we used to build the yearday, you'll only get strange results
3552 * for input which needed normalising, or for the 'odd' century years which
3553 * were leap years in the Julian calander but not in the Gregorian one.
3554 * I can live with that.
3556 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3557 * that's still outside the scope for POSIX time manipulation, so I don't
3561 year = 1900 + ptm->tm_year;
3562 month = ptm->tm_mon;
3563 mday = ptm->tm_mday;
3564 /* allow given yday with no month & mday to dominate the result */
3565 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3568 jday = 1 + ptm->tm_yday;
3577 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3578 yearday += month*MONTH_TO_DAYS + mday + jday;
3580 * Note that we don't know when leap-seconds were or will be,
3581 * so we have to trust the user if we get something which looks
3582 * like a sensible leap-second. Wild values for seconds will
3583 * be rationalised, however.
3585 if ((unsigned) ptm->tm_sec <= 60) {
3592 secs += 60 * ptm->tm_min;
3593 secs += SECS_PER_HOUR * ptm->tm_hour;
3595 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3596 /* got negative remainder, but need positive time */
3597 /* back off an extra day to compensate */
3598 yearday += (secs/SECS_PER_DAY)-1;
3599 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3602 yearday += (secs/SECS_PER_DAY);
3603 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3606 else if (secs >= SECS_PER_DAY) {
3607 yearday += (secs/SECS_PER_DAY);
3608 secs %= SECS_PER_DAY;
3610 ptm->tm_hour = secs/SECS_PER_HOUR;
3611 secs %= SECS_PER_HOUR;
3612 ptm->tm_min = secs/60;
3614 ptm->tm_sec += secs;
3615 /* done with time of day effects */
3617 * The algorithm for yearday has (so far) left it high by 428.
3618 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3619 * bias it by 123 while trying to figure out what year it
3620 * really represents. Even with this tweak, the reverse
3621 * translation fails for years before A.D. 0001.
3622 * It would still fail for Feb 29, but we catch that one below.
3624 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3625 yearday -= YEAR_ADJUST;
3626 year = (yearday / DAYS_PER_QCENT) * 400;
3627 yearday %= DAYS_PER_QCENT;
3628 odd_cent = yearday / DAYS_PER_CENT;
3629 year += odd_cent * 100;
3630 yearday %= DAYS_PER_CENT;
3631 year += (yearday / DAYS_PER_QYEAR) * 4;
3632 yearday %= DAYS_PER_QYEAR;
3633 odd_year = yearday / DAYS_PER_YEAR;
3635 yearday %= DAYS_PER_YEAR;
3636 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3641 yearday += YEAR_ADJUST; /* recover March 1st crock */
3642 month = yearday*DAYS_TO_MONTH;
3643 yearday -= month*MONTH_TO_DAYS;
3644 /* recover other leap-year adjustment */
3653 ptm->tm_year = year - 1900;
3655 ptm->tm_mday = yearday;
3656 ptm->tm_mon = month;
3660 ptm->tm_mon = month - 1;
3662 /* re-build yearday based on Jan 1 to get tm_yday */
3664 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3665 yearday += 14*MONTH_TO_DAYS + 1;
3666 ptm->tm_yday = jday - yearday;
3667 /* fix tm_wday if not overridden by caller */
3668 if ((unsigned)ptm->tm_wday > 6)
3669 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3673 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)
3681 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3684 mytm.tm_hour = hour;
3685 mytm.tm_mday = mday;
3687 mytm.tm_year = year;
3688 mytm.tm_wday = wday;
3689 mytm.tm_yday = yday;
3690 mytm.tm_isdst = isdst;
3692 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3693 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3698 #ifdef HAS_TM_TM_GMTOFF
3699 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3701 #ifdef HAS_TM_TM_ZONE
3702 mytm.tm_zone = mytm2.tm_zone;
3707 Newx(buf, buflen, char);
3708 len = strftime(buf, buflen, fmt, &mytm);
3710 ** The following is needed to handle to the situation where
3711 ** tmpbuf overflows. Basically we want to allocate a buffer
3712 ** and try repeatedly. The reason why it is so complicated
3713 ** is that getting a return value of 0 from strftime can indicate
3714 ** one of the following:
3715 ** 1. buffer overflowed,
3716 ** 2. illegal conversion specifier, or
3717 ** 3. the format string specifies nothing to be returned(not
3718 ** an error). This could be because format is an empty string
3719 ** or it specifies %p that yields an empty string in some locale.
3720 ** If there is a better way to make it portable, go ahead by
3723 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3726 /* Possibly buf overflowed - try again with a bigger buf */
3727 const int fmtlen = strlen(fmt);
3728 const int bufsize = fmtlen + buflen;
3730 Newx(buf, bufsize, char);
3732 buflen = strftime(buf, bufsize, fmt, &mytm);
3733 if (buflen > 0 && buflen < bufsize)
3735 /* heuristic to prevent out-of-memory errors */
3736 if (bufsize > 100*fmtlen) {
3741 Renew(buf, bufsize*2, char);
3746 Perl_croak(aTHX_ "panic: no strftime");
3752 #define SV_CWD_RETURN_UNDEF \
3753 sv_setsv(sv, &PL_sv_undef); \
3756 #define SV_CWD_ISDOT(dp) \
3757 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3758 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3761 =head1 Miscellaneous Functions
3763 =for apidoc getcwd_sv
3765 Fill the sv with current working directory
3770 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3771 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3772 * getcwd(3) if available
3773 * Comments from the orignal:
3774 * This is a faster version of getcwd. It's also more dangerous
3775 * because you might chdir out of a directory that you can't chdir
3779 Perl_getcwd_sv(pTHX_ register SV *sv)
3783 #ifndef INCOMPLETE_TAINTS
3789 char buf[MAXPATHLEN];
3791 /* Some getcwd()s automatically allocate a buffer of the given
3792 * size from the heap if they are given a NULL buffer pointer.
3793 * The problem is that this behaviour is not portable. */
3794 if (getcwd(buf, sizeof(buf) - 1)) {
3799 sv_setsv(sv, &PL_sv_undef);
3807 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3811 SvUPGRADE(sv, SVt_PV);
3813 if (PerlLIO_lstat(".", &statbuf) < 0) {
3814 SV_CWD_RETURN_UNDEF;
3817 orig_cdev = statbuf.st_dev;
3818 orig_cino = statbuf.st_ino;
3827 if (PerlDir_chdir("..") < 0) {
3828 SV_CWD_RETURN_UNDEF;
3830 if (PerlLIO_stat(".", &statbuf) < 0) {
3831 SV_CWD_RETURN_UNDEF;
3834 cdev = statbuf.st_dev;
3835 cino = statbuf.st_ino;
3837 if (odev == cdev && oino == cino) {
3840 if (!(dir = PerlDir_open("."))) {
3841 SV_CWD_RETURN_UNDEF;
3844 while ((dp = PerlDir_read(dir)) != NULL) {
3846 const int namelen = dp->d_namlen;
3848 const int namelen = strlen(dp->d_name);
3851 if (SV_CWD_ISDOT(dp)) {
3855 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3856 SV_CWD_RETURN_UNDEF;
3859 tdev = statbuf.st_dev;
3860 tino = statbuf.st_ino;
3861 if (tino == oino && tdev == odev) {
3867 SV_CWD_RETURN_UNDEF;
3870 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3871 SV_CWD_RETURN_UNDEF;
3874 SvGROW(sv, pathlen + namelen + 1);
3878 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3881 /* prepend current directory to the front */
3883 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3884 pathlen += (namelen + 1);
3886 #ifdef VOID_CLOSEDIR
3889 if (PerlDir_close(dir) < 0) {
3890 SV_CWD_RETURN_UNDEF;
3896 SvCUR_set(sv, pathlen);
3900 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3901 SV_CWD_RETURN_UNDEF;
3904 if (PerlLIO_stat(".", &statbuf) < 0) {
3905 SV_CWD_RETURN_UNDEF;
3908 cdev = statbuf.st_dev;
3909 cino = statbuf.st_ino;
3911 if (cdev != orig_cdev || cino != orig_cino) {
3912 Perl_croak(aTHX_ "Unstable directory path, "
3913 "current directory changed unexpectedly");
3925 =for apidoc scan_version
3927 Returns a pointer to the next character after the parsed
3928 version string, as well as upgrading the passed in SV to
3931 Function must be called with an already existing SV like
3934 s = scan_version(s,SV *sv, bool qv);
3936 Performs some preprocessing to the string to ensure that
3937 it has the correct characteristics of a version. Flags the
3938 object if it contains an underscore (which denotes this
3939 is a alpha version). The boolean qv denotes that the version
3940 should be interpreted as if it had multiple decimals, even if
3947 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3955 AV * const av = newAV();
3956 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3957 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3959 #ifndef NODEFAULT_SHAREKEYS
3960 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3963 while (isSPACE(*s)) /* leading whitespace is OK */
3967 s++; /* get past 'v' */
3968 qv = 1; /* force quoted version processing */
3971 start = last = pos = s;
3973 /* pre-scan the input string to check for decimals/underbars */
3974 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3979 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3983 else if ( *pos == '_' )
3986 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3988 width = pos - last - 1; /* natural width of sub-version */
3993 if ( saw_period > 1 )
3994 qv = 1; /* force quoted version processing */
3999 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4001 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4002 if ( !qv && width < 3 )
4003 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4005 while (isDIGIT(*pos))
4007 if (!isALPHA(*pos)) {
4013 /* this is atoi() that delimits on underscores */
4014 const char *end = pos;
4018 /* the following if() will only be true after the decimal
4019 * point of a version originally created with a bare
4020 * floating point number, i.e. not quoted in any way
4022 if ( !qv && s > start && saw_period == 1 ) {
4026 rev += (*s - '0') * mult;
4028 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4029 Perl_croak(aTHX_ "Integer overflow in version");
4036 while (--end >= s) {
4038 rev += (*end - '0') * mult;
4040 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4041 Perl_croak(aTHX_ "Integer overflow in version");
4046 /* Append revision */
4047 av_push(av, newSViv(rev));
4048 if ( *pos == '.' && isDIGIT(pos[1]) )
4050 else if ( *pos == '_' && isDIGIT(pos[1]) )
4052 else if ( isDIGIT(*pos) )
4059 while ( isDIGIT(*pos) )
4064 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4072 if ( qv ) { /* quoted versions always get at least three terms*/
4073 I32 len = av_len(av);
4074 /* This for loop appears to trigger a compiler bug on OS X, as it
4075 loops infinitely. Yes, len is negative. No, it makes no sense.
4076 Compiler in question is:
4077 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4078 for ( len = 2 - len; len > 0; len-- )
4079 av_push((AV *)sv, newSViv(0));
4083 av_push(av, newSViv(0));
4086 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4087 av_push(av, newSViv(0));
4089 /* And finally, store the AV in the hash */
4090 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4095 =for apidoc new_version
4097 Returns a new version object based on the passed in SV:
4099 SV *sv = new_version(SV *ver);
4101 Does not alter the passed in ver SV. See "upg_version" if you
4102 want to upgrade the SV.
4108 Perl_new_version(pTHX_ SV *ver)
4110 SV * const rv = newSV(0);
4111 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4114 AV * const av = newAV();
4116 /* This will get reblessed later if a derived class*/
4117 SV * const hv = newSVrv(rv, "version");
4118 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4119 #ifndef NODEFAULT_SHAREKEYS
4120 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4126 /* Begin copying all of the elements */
4127 if ( hv_exists((HV *)ver, "qv", 2) )
4128 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4130 if ( hv_exists((HV *)ver, "alpha", 5) )
4131 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4133 if ( hv_exists((HV*)ver, "width", 5 ) )
4135 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4136 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4139 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
4140 /* This will get reblessed later if a derived class*/
4141 for ( key = 0; key <= av_len(sav); key++ )
4143 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4144 av_push(av, newSViv(rev));
4147 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4151 if ( SvVOK(ver) ) { /* already a v-string */
4152 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4153 const STRLEN len = mg->mg_len;
4154 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4155 sv_setpvn(rv,version,len);
4160 sv_setsv(rv,ver); /* make a duplicate */
4169 =for apidoc upg_version
4171 In-place upgrade of the supplied SV to a version object.
4173 SV *sv = upg_version(SV *sv);
4175 Returns a pointer to the upgraded SV.
4181 Perl_upg_version(pTHX_ SV *ver)
4186 if ( SvNOK(ver) ) /* may get too much accuracy */
4189 const STRLEN len = my_sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4190 version = savepvn(tbuf, len);
4193 else if ( SvVOK(ver) ) { /* already a v-string */
4194 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4195 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4199 else /* must be a string or something like a string */
4201 version = savepv(SvPV_nolen(ver));
4203 (void)scan_version(version, ver, qv);
4211 Validates that the SV contains a valid version object.
4213 bool vverify(SV *vobj);
4215 Note that it only confirms the bare minimum structure (so as not to get
4216 confused by derived classes which may contain additional hash entries):
4220 =item * The SV contains a [reference to a] hash
4222 =item * The hash contains a "version" key
4224 =item * The "version" key has [a reference to] an AV as its value
4232 Perl_vverify(pTHX_ SV *vs)
4238 /* see if the appropriate elements exist */
4239 if ( SvTYPE(vs) == SVt_PVHV
4240 && hv_exists((HV*)vs, "version", 7)
4241 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
4242 && SvTYPE(sv) == SVt_PVAV )
4251 Accepts a version object and returns the normalized floating
4252 point representation. Call like:
4256 NOTE: you can pass either the object directly or the SV
4257 contained within the RV.
4263 Perl_vnumify(pTHX_ SV *vs)
4268 SV * const sv = newSV(0);
4274 Perl_croak(aTHX_ "Invalid version object");
4276 /* see if various flags exist */
4277 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4279 if ( hv_exists((HV*)vs, "width", 5 ) )
4280 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4285 /* attempt to retrieve the version array */
4286 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
4287 sv_catpvn(sv,"0",1);
4294 sv_catpvn(sv,"0",1);
4298 digit = SvIV(*av_fetch(av, 0, 0));
4299 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4300 for ( i = 1 ; i < len ; i++ )
4302 digit = SvIV(*av_fetch(av, i, 0));
4304 const int denom = (width == 2 ? 10 : 100);
4305 const div_t term = div((int)PERL_ABS(digit),denom);
4306 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4309 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4315 digit = SvIV(*av_fetch(av, len, 0));
4316 if ( alpha && width == 3 ) /* alpha version */
4317 sv_catpvn(sv,"_",1);
4318 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4322 sv_catpvn(sv,"000",3);
4330 Accepts a version object and returns the normalized string
4331 representation. Call like:
4335 NOTE: you can pass either the object directly or the SV
4336 contained within the RV.
4342 Perl_vnormal(pTHX_ SV *vs)
4346 SV * const sv = newSV(0);
4352 Perl_croak(aTHX_ "Invalid version object");
4354 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4356 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
4364 digit = SvIV(*av_fetch(av, 0, 0));
4365 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4366 for ( i = 1 ; i < len ; i++ ) {
4367 digit = SvIV(*av_fetch(av, i, 0));
4368 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4373 /* handle last digit specially */
4374 digit = SvIV(*av_fetch(av, len, 0));
4376 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4378 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4381 if ( len <= 2 ) { /* short version, must be at least three */
4382 for ( len = 2 - len; len != 0; len-- )
4383 sv_catpvn(sv,".0",2);
4389 =for apidoc vstringify
4391 In order to maintain maximum compatibility with earlier versions
4392 of Perl, this function will return either the floating point
4393 notation or the multiple dotted notation, depending on whether
4394 the original version contained 1 or more dots, respectively
4400 Perl_vstringify(pTHX_ SV *vs)
4406 Perl_croak(aTHX_ "Invalid version object");
4408 if ( hv_exists((HV *)vs, "qv", 2) )
4417 Version object aware cmp. Both operands must already have been
4418 converted into version objects.
4424 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4427 bool lalpha = FALSE;
4428 bool ralpha = FALSE;
4437 if ( !vverify(lhv) )
4438 Perl_croak(aTHX_ "Invalid version object");
4440 if ( !vverify(rhv) )
4441 Perl_croak(aTHX_ "Invalid version object");
4443 /* get the left hand term */
4444 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
4445 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4448 /* and the right hand term */
4449 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
4450 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4458 while ( i <= m && retval == 0 )
4460 left = SvIV(*av_fetch(lav,i,0));
4461 right = SvIV(*av_fetch(rav,i,0));
4469 /* tiebreaker for alpha with identical terms */
4470 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4472 if ( lalpha && !ralpha )
4476 else if ( ralpha && !lalpha)
4482 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4486 while ( i <= r && retval == 0 )
4488 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4489 retval = -1; /* not a match after all */
4495 while ( i <= l && retval == 0 )
4497 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4498 retval = +1; /* not a match after all */
4506 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4507 # define EMULATE_SOCKETPAIR_UDP
4510 #ifdef EMULATE_SOCKETPAIR_UDP
4512 S_socketpair_udp (int fd[2]) {
4514 /* Fake a datagram socketpair using UDP to localhost. */
4515 int sockets[2] = {-1, -1};
4516 struct sockaddr_in addresses[2];
4518 Sock_size_t size = sizeof(struct sockaddr_in);
4519 unsigned short port;
4522 memset(&addresses, 0, sizeof(addresses));
4525 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4526 if (sockets[i] == -1)
4527 goto tidy_up_and_fail;
4529 addresses[i].sin_family = AF_INET;
4530 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4531 addresses[i].sin_port = 0; /* kernel choses port. */
4532 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4533 sizeof(struct sockaddr_in)) == -1)
4534 goto tidy_up_and_fail;
4537 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4538 for each connect the other socket to it. */
4541 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4543 goto tidy_up_and_fail;
4544 if (size != sizeof(struct sockaddr_in))
4545 goto abort_tidy_up_and_fail;
4546 /* !1 is 0, !0 is 1 */
4547 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4548 sizeof(struct sockaddr_in)) == -1)
4549 goto tidy_up_and_fail;
4552 /* Now we have 2 sockets connected to each other. I don't trust some other
4553 process not to have already sent a packet to us (by random) so send
4554 a packet from each to the other. */
4557 /* I'm going to send my own port number. As a short.
4558 (Who knows if someone somewhere has sin_port as a bitfield and needs
4559 this routine. (I'm assuming crays have socketpair)) */
4560 port = addresses[i].sin_port;
4561 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4562 if (got != sizeof(port)) {
4564 goto tidy_up_and_fail;
4565 goto abort_tidy_up_and_fail;
4569 /* Packets sent. I don't trust them to have arrived though.
4570 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4571 connect to localhost will use a second kernel thread. In 2.6 the
4572 first thread running the connect() returns before the second completes,
4573 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4574 returns 0. Poor programs have tripped up. One poor program's authors'
4575 had a 50-1 reverse stock split. Not sure how connected these were.)
4576 So I don't trust someone not to have an unpredictable UDP stack.
4580 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4581 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4585 FD_SET(sockets[0], &rset);
4586 FD_SET(sockets[1], &rset);
4588 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4589 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4590 || !FD_ISSET(sockets[1], &rset)) {
4591 /* I hope this is portable and appropriate. */
4593 goto tidy_up_and_fail;
4594 goto abort_tidy_up_and_fail;
4598 /* And the paranoia department even now doesn't trust it to have arrive
4599 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4601 struct sockaddr_in readfrom;
4602 unsigned short buffer[2];
4607 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4608 sizeof(buffer), MSG_DONTWAIT,
4609 (struct sockaddr *) &readfrom, &size);
4611 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4613 (struct sockaddr *) &readfrom, &size);
4617 goto tidy_up_and_fail;
4618 if (got != sizeof(port)
4619 || size != sizeof(struct sockaddr_in)
4620 /* Check other socket sent us its port. */
4621 || buffer[0] != (unsigned short) addresses[!i].sin_port
4622 /* Check kernel says we got the datagram from that socket */
4623 || readfrom.sin_family != addresses[!i].sin_family
4624 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4625 || readfrom.sin_port != addresses[!i].sin_port)
4626 goto abort_tidy_up_and_fail;
4629 /* My caller (my_socketpair) has validated that this is non-NULL */
4632 /* I hereby declare this connection open. May God bless all who cross
4636 abort_tidy_up_and_fail:
4637 errno = ECONNABORTED;
4640 const int save_errno = errno;
4641 if (sockets[0] != -1)
4642 PerlLIO_close(sockets[0]);
4643 if (sockets[1] != -1)
4644 PerlLIO_close(sockets[1]);
4649 #endif /* EMULATE_SOCKETPAIR_UDP */
4651 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4653 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4654 /* Stevens says that family must be AF_LOCAL, protocol 0.
4655 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4660 struct sockaddr_in listen_addr;
4661 struct sockaddr_in connect_addr;
4666 || family != AF_UNIX
4669 errno = EAFNOSUPPORT;
4677 #ifdef EMULATE_SOCKETPAIR_UDP
4678 if (type == SOCK_DGRAM)
4679 return S_socketpair_udp(fd);
4682 listener = PerlSock_socket(AF_INET, type, 0);
4685 memset(&listen_addr, 0, sizeof(listen_addr));
4686 listen_addr.sin_family = AF_INET;
4687 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4688 listen_addr.sin_port = 0; /* kernel choses port. */
4689 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4690 sizeof(listen_addr)) == -1)
4691 goto tidy_up_and_fail;
4692 if (PerlSock_listen(listener, 1) == -1)
4693 goto tidy_up_and_fail;
4695 connector = PerlSock_socket(AF_INET, type, 0);
4696 if (connector == -1)
4697 goto tidy_up_and_fail;
4698 /* We want to find out the port number to connect to. */
4699 size = sizeof(connect_addr);
4700 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4702 goto tidy_up_and_fail;
4703 if (size != sizeof(connect_addr))
4704 goto abort_tidy_up_and_fail;
4705 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4706 sizeof(connect_addr)) == -1)
4707 goto tidy_up_and_fail;
4709 size = sizeof(listen_addr);
4710 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4713 goto tidy_up_and_fail;
4714 if (size != sizeof(listen_addr))
4715 goto abort_tidy_up_and_fail;
4716 PerlLIO_close(listener);
4717 /* Now check we are talking to ourself by matching port and host on the
4719 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4721 goto tidy_up_and_fail;
4722 if (size != sizeof(connect_addr)
4723 || listen_addr.sin_family != connect_addr.sin_family
4724 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4725 || listen_addr.sin_port != connect_addr.sin_port) {
4726 goto abort_tidy_up_and_fail;
4732 abort_tidy_up_and_fail:
4734 errno = ECONNABORTED; /* This would be the standard thing to do. */
4736 # ifdef ECONNREFUSED
4737 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4739 errno = ETIMEDOUT; /* Desperation time. */
4744 const int save_errno = errno;
4746 PerlLIO_close(listener);
4747 if (connector != -1)
4748 PerlLIO_close(connector);
4750 PerlLIO_close(acceptor);
4756 /* In any case have a stub so that there's code corresponding
4757 * to the my_socketpair in global.sym. */
4759 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4760 #ifdef HAS_SOCKETPAIR
4761 return socketpair(family, type, protocol, fd);
4770 =for apidoc sv_nosharing
4772 Dummy routine which "shares" an SV when there is no sharing module present.
4773 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4774 Exists to avoid test for a NULL function pointer and because it could
4775 potentially warn under some level of strict-ness.
4781 Perl_sv_nosharing(pTHX_ SV *sv)
4783 PERL_UNUSED_ARG(sv);
4787 Perl_parse_unicode_opts(pTHX_ const char **popt)
4789 const char *p = *popt;
4794 opt = (U32) atoi(p);
4795 while (isDIGIT(*p)) p++;
4796 if (*p && *p != '\n' && *p != '\r')
4797 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4802 case PERL_UNICODE_STDIN:
4803 opt |= PERL_UNICODE_STDIN_FLAG; break;
4804 case PERL_UNICODE_STDOUT:
4805 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4806 case PERL_UNICODE_STDERR:
4807 opt |= PERL_UNICODE_STDERR_FLAG; break;
4808 case PERL_UNICODE_STD:
4809 opt |= PERL_UNICODE_STD_FLAG; break;
4810 case PERL_UNICODE_IN:
4811 opt |= PERL_UNICODE_IN_FLAG; break;
4812 case PERL_UNICODE_OUT:
4813 opt |= PERL_UNICODE_OUT_FLAG; break;
4814 case PERL_UNICODE_INOUT:
4815 opt |= PERL_UNICODE_INOUT_FLAG; break;
4816 case PERL_UNICODE_LOCALE:
4817 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4818 case PERL_UNICODE_ARGV:
4819 opt |= PERL_UNICODE_ARGV_FLAG; break;
4821 if (*p != '\n' && *p != '\r')
4823 "Unknown Unicode option letter '%c'", *p);
4829 opt = PERL_UNICODE_DEFAULT_FLAGS;
4831 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4832 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4833 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4844 * This is really just a quick hack which grabs various garbage
4845 * values. It really should be a real hash algorithm which
4846 * spreads the effect of every input bit onto every output bit,
4847 * if someone who knows about such things would bother to write it.
4848 * Might be a good idea to add that function to CORE as well.
4849 * No numbers below come from careful analysis or anything here,
4850 * except they are primes and SEED_C1 > 1E6 to get a full-width
4851 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4852 * probably be bigger too.
4855 # define SEED_C1 1000003
4856 #define SEED_C4 73819
4858 # define SEED_C1 25747
4859 #define SEED_C4 20639
4863 #define SEED_C5 26107
4865 #ifndef PERL_NO_DEV_RANDOM
4870 # include <starlet.h>
4871 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4872 * in 100-ns units, typically incremented ever 10 ms. */
4873 unsigned int when[2];
4875 # ifdef HAS_GETTIMEOFDAY
4876 struct timeval when;
4882 /* This test is an escape hatch, this symbol isn't set by Configure. */
4883 #ifndef PERL_NO_DEV_RANDOM
4884 #ifndef PERL_RANDOM_DEVICE
4885 /* /dev/random isn't used by default because reads from it will block
4886 * if there isn't enough entropy available. You can compile with
4887 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4888 * is enough real entropy to fill the seed. */
4889 # define PERL_RANDOM_DEVICE "/dev/urandom"
4891 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4893 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4902 _ckvmssts(sys$gettim(when));
4903 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4905 # ifdef HAS_GETTIMEOFDAY
4906 PerlProc_gettimeofday(&when,NULL);
4907 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4910 u = (U32)SEED_C1 * when;
4913 u += SEED_C3 * (U32)PerlProc_getpid();
4914 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4915 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4916 u += SEED_C5 * (U32)PTR2UV(&when);
4922 Perl_get_hash_seed(pTHX)
4924 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4928 while (isSPACE(*s)) s++;
4929 if (s && isDIGIT(*s))
4930 myseed = (UV)Atoul(s);
4932 #ifdef USE_HASH_SEED_EXPLICIT
4936 /* Compute a random seed */
4937 (void)seedDrand01((Rand_seed_t)seed());
4938 myseed = (UV)(Drand01() * (NV)UV_MAX);
4939 #if RANDBITS < (UVSIZE * 8)
4940 /* Since there are not enough randbits to to reach all
4941 * the bits of a UV, the low bits might need extra
4942 * help. Sum in another random number that will
4943 * fill in the low bits. */
4945 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4946 #endif /* RANDBITS < (UVSIZE * 8) */
4947 if (myseed == 0) { /* Superparanoia. */
4948 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4950 Perl_croak(aTHX_ "Your random numbers are not that random");
4953 PL_rehash_seed_set = TRUE;
4960 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4962 const char * const stashpv = CopSTASHPV(c);
4963 const char * const name = HvNAME_get(hv);
4965 if (stashpv == name)
4967 if (stashpv && name)
4968 if (strEQ(stashpv, name))
4975 #ifdef PERL_GLOBAL_STRUCT
4978 Perl_init_global_struct(pTHX)
4980 struct perl_vars *plvarsp = NULL;
4981 #ifdef PERL_GLOBAL_STRUCT
4982 # define PERL_GLOBAL_STRUCT_INIT
4983 # include "opcode.h" /* the ppaddr and check */
4984 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4985 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4986 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4987 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4988 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4992 plvarsp = PL_VarsPtr;
4993 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4999 # define PERLVAR(var,type) /**/
5000 # define PERLVARA(var,n,type) /**/
5001 # define PERLVARI(var,type,init) plvarsp->var = init;
5002 # define PERLVARIC(var,type,init) plvarsp->var = init;
5003 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5004 # include "perlvars.h"
5010 # ifdef PERL_GLOBAL_STRUCT
5011 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5012 if (!plvarsp->Gppaddr)
5014 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5015 if (!plvarsp->Gcheck)
5017 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5018 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5020 # ifdef PERL_SET_VARS
5021 PERL_SET_VARS(plvarsp);
5023 # undef PERL_GLOBAL_STRUCT_INIT
5028 #endif /* PERL_GLOBAL_STRUCT */
5030 #ifdef PERL_GLOBAL_STRUCT
5033 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5035 #ifdef PERL_GLOBAL_STRUCT
5036 # ifdef PERL_UNSET_VARS
5037 PERL_UNSET_VARS(plvarsp);
5039 free(plvarsp->Gppaddr);
5040 free(plvarsp->Gcheck);
5041 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5047 #endif /* PERL_GLOBAL_STRUCT */
5051 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5054 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)
5056 #ifdef PERL_MEM_LOG_STDERR
5057 /* We can't use PerlIO for obvious reasons. */
5058 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5059 const STRLEN len = my_sprintf(buf,
5060 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5061 " %s = %"IVdf": %"UVxf"\n",
5062 filename, linenumber, funcname, n, typesize,
5063 typename, n * typesize, PTR2UV(newalloc));
5064 PerlLIO_write(2, buf, len);
5070 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)
5072 #ifdef PERL_MEM_LOG_STDERR
5073 /* We can't use PerlIO for obvious reasons. */
5074 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5075 const STRLEN len = my_sprintf(buf, "realloc: %s:%d:%s: %"IVdf" %"UVuf
5076 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5077 filename, linenumber, funcname, n, typesize,
5078 typename, n * typesize, PTR2UV(oldalloc),
5080 PerlLIO_write(2, buf, len);
5086 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5088 #ifdef PERL_MEM_LOG_STDERR
5089 /* We can't use PerlIO for obvious reasons. */
5090 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5091 const STRLEN len = my_sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5092 filename, linenumber, funcname,
5094 PerlLIO_write(2, buf, len);
5099 #endif /* PERL_MEM_LOG */
5102 =for apidoc my_sprintf
5104 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5105 the length of the string written to the buffer. Only rare pre-ANSI systems
5106 need the wrapper function - usually this is a direct call to C<sprintf>.
5110 #ifndef SPRINTF_RETURNS_STRLEN
5112 Perl_my_sprintf(char *buffer, const char* pat, ...)
5115 va_start(args, pat);
5116 vsprintf(buffer, pat, args);
5118 return strlen(buffer);
5123 Perl_my_clearenv(pTHX)
5126 #if ! defined(PERL_MICRO)
5127 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5129 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5130 # if defined(USE_ENVIRON_ARRAY)
5131 # if defined(USE_ITHREADS)
5132 /* only the parent thread can clobber the process environment */
5133 if (PL_curinterp == aTHX)
5134 # endif /* USE_ITHREADS */
5136 # if ! defined(PERL_USE_SAFE_PUTENV)
5137 if ( !PL_use_safe_putenv) {
5139 if (environ == PL_origenviron)
5140 environ = (char**)safesysmalloc(sizeof(char*));
5142 for (i = 0; environ[i]; i++)
5143 (void)safesysfree(environ[i]);
5146 # else /* PERL_USE_SAFE_PUTENV */
5147 # if defined(HAS_CLEARENV)
5149 # elif defined(HAS_UNSETENV)
5150 int bsiz = 80; /* Most envvar names will be shorter than this. */
5151 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5152 while (*environ != NULL) {
5153 char *e = strchr(*environ, '=');
5154 int l = e ? e - *environ : strlen(*environ);
5156 (void)safesysfree(buf);
5158 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5160 strncpy(buf, *environ, l);
5162 (void)unsetenv(buf);
5164 (void)safesysfree(buf);
5165 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5166 /* Just null environ and accept the leakage. */
5168 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5169 # endif /* ! PERL_USE_SAFE_PUTENV */
5171 # endif /* USE_ENVIRON_ARRAY */
5172 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5173 #endif /* PERL_MICRO */
5178 * c-indentation-style: bsd
5180 * indent-tabs-mode: t
5183 * ex: set ts=8 sts=4 sw=4 noet: