3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
60 /* paranoid version of system's malloc() */
63 Perl_safesysmalloc(MEM_SIZE size)
69 PerlIO_printf(Perl_error_log,
70 "Allocation too large: %lx\n", size) FLUSH;
73 #endif /* HAS_64K_LIMIT */
76 Perl_croak_nocontext("panic: malloc");
78 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
79 PERL_ALLOC_CHECK(ptr);
80 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
86 /* Can't use PerlIO to write as it allocates memory */
87 PerlLIO_write(PerlIO_fileno(Perl_error_log),
88 PL_no_mem, strlen(PL_no_mem));
95 /* paranoid version of system's realloc() */
98 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
102 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
103 Malloc_t PerlMem_realloc();
104 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
108 PerlIO_printf(Perl_error_log,
109 "Reallocation too large: %lx\n", size) FLUSH;
112 #endif /* HAS_64K_LIMIT */
119 return safesysmalloc(size);
122 Perl_croak_nocontext("panic: realloc");
124 ptr = (Malloc_t)PerlMem_realloc(where,size);
125 PERL_ALLOC_CHECK(ptr);
127 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
128 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
135 /* Can't use PerlIO to write as it allocates memory */
136 PerlLIO_write(PerlIO_fileno(Perl_error_log),
137 PL_no_mem, strlen(PL_no_mem));
144 /* safe version of system's free() */
147 Perl_safesysfree(Malloc_t where)
150 #ifdef PERL_IMPLICIT_SYS
153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
159 /* safe version of system's calloc() */
162 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
168 if (size * count > 0xffff) {
169 PerlIO_printf(Perl_error_log,
170 "Allocation too large: %lx\n", size * count) FLUSH;
173 #endif /* HAS_64K_LIMIT */
175 if ((long)size < 0 || (long)count < 0)
176 Perl_croak_nocontext("panic: calloc");
179 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
180 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
183 memset((void*)ptr, 0, size);
189 /* Can't use PerlIO to write as it allocates memory */
190 PerlLIO_write(PerlIO_fileno(Perl_error_log),
191 PL_no_mem, strlen(PL_no_mem));
198 /* These must be defined when not using Perl's malloc for binary
203 Malloc_t Perl_malloc (MEM_SIZE nbytes)
206 return (Malloc_t)PerlMem_malloc(nbytes);
209 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
212 return (Malloc_t)PerlMem_calloc(elements, size);
215 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
218 return (Malloc_t)PerlMem_realloc(where, nbytes);
221 Free_t Perl_mfree (Malloc_t where)
229 /* copy a string up to some (non-backslashed) delimiter, if any */
232 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
235 for (tolen = 0; from < fromend; from++, tolen++) {
237 if (from[1] == delim)
246 else if (*from == delim)
257 /* return ptr to little string in big string, NULL if not found */
258 /* This routine was donated by Corey Satten. */
261 Perl_instr(pTHX_ register const char *big, register const char *little)
271 register const char *s, *x;
274 for (x=big,s=little; *s; /**/ ) {
283 return (char*)(big-1);
288 /* same as instr but allow embedded nulls */
291 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
293 register const I32 first = *little;
294 register const char *littleend = lend;
296 if (!first && little >= littleend)
298 if (bigend - big < littleend - little)
300 bigend -= littleend - little++;
301 while (big <= bigend) {
302 register const char *s, *x;
305 for (x=big,s=little; s < littleend; /**/ ) {
312 return (char*)(big-1);
317 /* reverse of the above--find last substring */
320 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
322 register const char *bigbeg;
323 register const I32 first = *little;
324 register const char *littleend = lend;
326 if (!first && little >= littleend)
327 return (char*)bigend;
329 big = bigend - (littleend - little++);
330 while (big >= bigbeg) {
331 register const char *s, *x;
334 for (x=big+2,s=little; s < littleend; /**/ ) {
341 return (char*)(big+1);
346 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
348 /* As a space optimization, we do not compile tables for strings of length
349 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
350 special-cased in fbm_instr().
352 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
355 =head1 Miscellaneous Functions
357 =for apidoc fbm_compile
359 Analyses the string in order to make fast searches on it using fbm_instr()
360 -- the Boyer-Moore algorithm.
366 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
368 const register U8 *s;
375 if (flags & FBMcf_TAIL) {
376 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
377 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
378 if (mg && mg->mg_len >= 0)
381 s = (U8*)SvPV_force_mutable(sv, len);
382 SvUPGRADE(sv, SVt_PVBM);
383 if (len == 0) /* TAIL might be on a zero-length string. */
386 const unsigned char *sb;
387 const U8 mlen = (len>255) ? 255 : (U8)len;
389 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
390 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
391 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
392 memset((void*)table, mlen, 256);
393 table[-1] = (U8)flags;
395 sb = s - mlen + 1; /* first char (maybe) */
397 if (table[*s] == mlen)
402 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
405 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
406 for (i = 0; i < len; i++) {
407 if (PL_freq[s[i]] < frequency) {
409 frequency = PL_freq[s[i]];
412 BmRARE(sv) = s[rarest];
413 BmPREVIOUS(sv) = (U16)rarest;
414 BmUSEFUL(sv) = 100; /* Initial value */
415 if (flags & FBMcf_TAIL)
417 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
418 BmRARE(sv),BmPREVIOUS(sv)));
421 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
422 /* If SvTAIL is actually due to \Z or \z, this gives false positives
426 =for apidoc fbm_instr
428 Returns the location of the SV in the string delimited by C<str> and
429 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
430 does not have to be fbm_compiled, but the search will not be as fast
437 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
439 register unsigned char *s;
441 register const unsigned char *little
442 = (const unsigned char *)SvPV_const(littlestr,l);
443 register STRLEN littlelen = l;
444 register const I32 multiline = flags & FBMrf_MULTILINE;
446 if ((STRLEN)(bigend - big) < littlelen) {
447 if ( SvTAIL(littlestr)
448 && ((STRLEN)(bigend - big) == littlelen - 1)
450 || (*big == *little &&
451 memEQ((char *)big, (char *)little, littlelen - 1))))
456 if (littlelen <= 2) { /* Special-cased */
458 if (littlelen == 1) {
459 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
460 /* Know that bigend != big. */
461 if (bigend[-1] == '\n')
462 return (char *)(bigend - 1);
463 return (char *) bigend;
471 if (SvTAIL(littlestr))
472 return (char *) bigend;
476 return (char*)big; /* Cannot be SvTAIL! */
479 if (SvTAIL(littlestr) && !multiline) {
480 if (bigend[-1] == '\n' && bigend[-2] == *little)
481 return (char*)bigend - 2;
482 if (bigend[-1] == *little)
483 return (char*)bigend - 1;
487 /* This should be better than FBM if c1 == c2, and almost
488 as good otherwise: maybe better since we do less indirection.
489 And we save a lot of memory by caching no table. */
490 const unsigned char c1 = little[0];
491 const unsigned char c2 = little[1];
496 while (s <= bigend) {
506 goto check_1char_anchor;
517 goto check_1char_anchor;
520 while (s <= bigend) {
525 goto check_1char_anchor;
534 check_1char_anchor: /* One char and anchor! */
535 if (SvTAIL(littlestr) && (*bigend == *little))
536 return (char *)bigend; /* bigend is already decremented. */
539 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
540 s = bigend - littlelen;
541 if (s >= big && bigend[-1] == '\n' && *s == *little
542 /* Automatically of length > 2 */
543 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
545 return (char*)s; /* how sweet it is */
548 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
550 return (char*)s + 1; /* how sweet it is */
554 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
555 char *b = ninstr((char*)big,(char*)bigend,
556 (char*)little, (char*)little + littlelen);
558 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
559 /* Chop \n from littlestr: */
560 s = bigend - littlelen + 1;
562 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
571 { /* Do actual FBM. */
572 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
573 const register unsigned char *oldlittle;
575 if (littlelen > (STRLEN)(bigend - big))
577 --littlelen; /* Last char found by table lookup */
580 little += littlelen; /* last char */
586 if ((tmp = table[*s])) {
587 if ((s += tmp) < bigend)
591 else { /* less expensive than calling strncmp() */
592 register unsigned char * const olds = s;
597 if (*--s == *--little)
599 s = olds + 1; /* here we pay the price for failure */
601 if (s < bigend) /* fake up continue to outer loop */
609 if ( s == bigend && (table[-1] & FBMcf_TAIL)
610 && memEQ((char *)(bigend - littlelen),
611 (char *)(oldlittle - littlelen), littlelen) )
612 return (char*)bigend - littlelen;
617 /* start_shift, end_shift are positive quantities which give offsets
618 of ends of some substring of bigstr.
619 If "last" we want the last occurrence.
620 old_posp is the way of communication between consequent calls if
621 the next call needs to find the .
622 The initial *old_posp should be -1.
624 Note that we take into account SvTAIL, so one can get extra
625 optimizations if _ALL flag is set.
628 /* If SvTAIL is actually due to \Z or \z, this gives false positives
629 if PL_multiline. In fact if !PL_multiline the authoritative answer
630 is not supported yet. */
633 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
635 const register unsigned char *big;
637 register I32 previous;
639 const register unsigned char *little;
640 register I32 stop_pos;
641 const register unsigned char *littleend;
645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
648 if ( BmRARE(littlestr) == '\n'
649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
650 little = (const unsigned char *)(SvPVX_const(littlestr));
651 littleend = little + SvCUR(littlestr);
658 little = (const unsigned char *)(SvPVX_const(littlestr));
659 littleend = little + SvCUR(littlestr);
661 /* The value of pos we can start at: */
662 previous = BmPREVIOUS(littlestr);
663 big = (const unsigned char *)(SvPVX_const(bigstr));
664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
666 if (previous + start_shift > stop_pos) {
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
677 while (pos < previous + start_shift) {
678 if (!(pos += PL_screamnext[pos]))
683 const register unsigned char *s, *x;
684 if (pos >= stop_pos) break;
685 if (big[pos] != first)
687 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
693 if (s == littleend) {
695 if (!last) return (char *)(big+pos);
698 } while ( pos += PL_screamnext[pos] );
700 return (char *)(big+(*old_posp));
702 if (!SvTAIL(littlestr) || (end_shift > 0))
704 /* Ignore the trailing "\n". This code is not microoptimized */
705 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
706 stop_pos = littleend - little; /* Actual littlestr len */
711 && ((stop_pos == 1) ||
712 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
718 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
720 register const U8 *a = (const U8 *)s1;
721 register const U8 *b = (const U8 *)s2;
723 if (*a != *b && *a != PL_fold[*b])
731 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
734 register const U8 *a = (const U8 *)s1;
735 register const U8 *b = (const U8 *)s2;
737 if (*a != *b && *a != PL_fold_locale[*b])
744 /* copy a string to a safe spot */
747 =head1 Memory Management
751 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
752 string which is a duplicate of C<pv>. The size of the string is
753 determined by C<strlen()>. The memory allocated for the new string can
754 be freed with the C<Safefree()> function.
760 Perl_savepv(pTHX_ const char *pv)
766 const STRLEN pvlen = strlen(pv)+1;
767 New(902,newaddr,pvlen,char);
768 return memcpy(newaddr,pv,pvlen);
773 /* same thing but with a known length */
778 Perl's version of what C<strndup()> would be if it existed. Returns a
779 pointer to a newly allocated string which is a duplicate of the first
780 C<len> bytes from C<pv>. The memory allocated for the new string can be
781 freed with the C<Safefree()> function.
787 Perl_savepvn(pTHX_ const char *pv, register I32 len)
789 register char *newaddr;
791 New(903,newaddr,len+1,char);
792 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
794 /* might not be null terminated */
796 return (char *) CopyD(pv,newaddr,len,char);
799 return (char *) ZeroD(newaddr,len+1,char);
804 =for apidoc savesharedpv
806 A version of C<savepv()> which allocates the duplicate string in memory
807 which is shared between threads.
812 Perl_savesharedpv(pTHX_ const char *pv)
814 register char *newaddr;
819 pvlen = strlen(pv)+1;
820 newaddr = (char*)PerlMemShared_malloc(pvlen);
822 PerlLIO_write(PerlIO_fileno(Perl_error_log),
823 PL_no_mem, strlen(PL_no_mem));
826 return memcpy(newaddr,pv,pvlen);
832 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
833 the passed in SV using C<SvPV()>
839 Perl_savesvpv(pTHX_ SV *sv)
842 const char *pv = SvPV_const(sv, len);
843 register char *newaddr;
846 New(903,newaddr,len,char);
847 return (char *) CopyD(pv,newaddr,len,char);
851 /* the SV for Perl_form() and mess() is not kept in an arena */
860 return sv_2mortal(newSVpvn("",0));
865 /* Create as PVMG now, to avoid any upgrading later */
867 Newz(905, any, 1, XPVMG);
868 SvFLAGS(sv) = SVt_PVMG;
869 SvANY(sv) = (void*)any;
871 SvREFCNT(sv) = 1 << 30; /* practically infinite */
876 #if defined(PERL_IMPLICIT_CONTEXT)
878 Perl_form_nocontext(const char* pat, ...)
884 retval = vform(pat, &args);
888 #endif /* PERL_IMPLICIT_CONTEXT */
891 =head1 Miscellaneous Functions
894 Takes a sprintf-style format pattern and conventional
895 (non-SV) arguments and returns the formatted string.
897 (char *) Perl_form(pTHX_ const char* pat, ...)
899 can be used any place a string (char *) is required:
901 char * s = Perl_form("%d.%d",major,minor);
903 Uses a single private buffer so if you want to format several strings you
904 must explicitly copy the earlier strings away (and free the copies when you
911 Perl_form(pTHX_ const char* pat, ...)
916 retval = vform(pat, &args);
922 Perl_vform(pTHX_ const char *pat, va_list *args)
924 SV *sv = mess_alloc();
925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
929 #if defined(PERL_IMPLICIT_CONTEXT)
931 Perl_mess_nocontext(const char *pat, ...)
937 retval = vmess(pat, &args);
941 #endif /* PERL_IMPLICIT_CONTEXT */
944 Perl_mess(pTHX_ const char *pat, ...)
949 retval = vmess(pat, &args);
955 S_closest_cop(pTHX_ COP *cop, const OP *o)
957 /* Look for PL_op starting from o. cop is the last COP we've seen. */
959 if (!o || o == PL_op) return cop;
961 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
967 /* If the OP_NEXTSTATE has been optimised away we can still use it
968 * the get the file and line number. */
970 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
973 /* Keep searching, and return when we've found something. */
975 new_cop = closest_cop(cop, kid);
976 if (new_cop) return new_cop;
986 Perl_vmess(pTHX_ const char *pat, va_list *args)
988 SV *sv = mess_alloc();
989 static const char dgd[] = " during global destruction.\n";
991 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
992 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
995 * Try and find the file and line for PL_op. This will usually be
996 * PL_curcop, but it might be a cop that has been optimised away. We
997 * can try to find such a cop by searching through the optree starting
998 * from the sibling of PL_curcop.
1001 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1002 if (!cop) cop = PL_curcop;
1005 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1006 OutCopFILE(cop), (IV)CopLINE(cop));
1007 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1008 const bool line_mode = (RsSIMPLE(PL_rs) &&
1009 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1010 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1011 PL_last_in_gv == PL_argvgv ?
1012 "" : GvNAME(PL_last_in_gv),
1013 line_mode ? "line" : "chunk",
1014 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1016 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1022 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1028 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1029 && (io = GvIO(PL_stderrgv))
1030 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1037 SAVESPTR(PL_stderrgv);
1038 PL_stderrgv = Nullgv;
1040 PUSHSTACKi(PERLSI_MAGIC);
1044 PUSHs(SvTIED_obj((SV*)io, mg));
1045 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1047 call_method("PRINT", G_SCALAR);
1055 /* SFIO can really mess with your errno */
1056 const int e = errno;
1058 PerlIO * const serr = Perl_error_log;
1060 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1061 (void)PerlIO_flush(serr);
1068 /* Common code used by vcroak, vdie and vwarner */
1071 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1076 /* sv_2cv might call Perl_croak() */
1077 SV *olddiehook = PL_diehook;
1081 SAVESPTR(PL_diehook);
1082 PL_diehook = Nullsv;
1083 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1085 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1092 msg = newSVpvn(message, msglen);
1093 SvFLAGS(msg) |= utf8;
1101 PUSHSTACKi(PERLSI_DIEHOOK);
1105 call_sv((SV*)cv, G_DISCARD);
1112 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1116 const char *message;
1119 SV *msv = vmess(pat, args);
1120 if (PL_errors && SvCUR(PL_errors)) {
1121 sv_catsv(PL_errors, msv);
1122 message = SvPV_const(PL_errors, *msglen);
1123 SvCUR_set(PL_errors, 0);
1126 message = SvPV_const(msv,*msglen);
1127 *utf8 = SvUTF8(msv);
1133 DEBUG_S(PerlIO_printf(Perl_debug_log,
1134 "%p: die/croak: message = %s\ndiehook = %p\n",
1135 thr, message, PL_diehook));
1137 S_vdie_common(aTHX_ message, *msglen, *utf8);
1143 Perl_vdie(pTHX_ const char* pat, va_list *args)
1145 const char *message;
1146 const int was_in_eval = PL_in_eval;
1150 DEBUG_S(PerlIO_printf(Perl_debug_log,
1151 "%p: die: curstack = %p, mainstack = %p\n",
1152 thr, PL_curstack, PL_mainstack));
1154 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1156 PL_restartop = die_where(message, msglen);
1157 SvFLAGS(ERRSV) |= utf8;
1158 DEBUG_S(PerlIO_printf(Perl_debug_log,
1159 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1160 thr, PL_restartop, was_in_eval, PL_top_env));
1161 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1163 return PL_restartop;
1166 #if defined(PERL_IMPLICIT_CONTEXT)
1168 Perl_die_nocontext(const char* pat, ...)
1173 va_start(args, pat);
1174 o = vdie(pat, &args);
1178 #endif /* PERL_IMPLICIT_CONTEXT */
1181 Perl_die(pTHX_ const char* pat, ...)
1185 va_start(args, pat);
1186 o = vdie(pat, &args);
1192 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1194 const char *message;
1198 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1201 PL_restartop = die_where(message, msglen);
1202 SvFLAGS(ERRSV) |= utf8;
1206 message = SvPVx_const(ERRSV, msglen);
1208 write_to_stderr(message, msglen);
1212 #if defined(PERL_IMPLICIT_CONTEXT)
1214 Perl_croak_nocontext(const char *pat, ...)
1218 va_start(args, pat);
1223 #endif /* PERL_IMPLICIT_CONTEXT */
1226 =head1 Warning and Dieing
1230 This is the XSUB-writer's interface to Perl's C<die> function.
1231 Normally call this function the same way you call the C C<printf>
1232 function. Calling C<croak> returns control directly to Perl,
1233 sidestepping the normal C order of execution. See C<warn>.
1235 If you want to throw an exception object, assign the object to
1236 C<$@> and then pass C<Nullch> to croak():
1238 errsv = get_sv("@", TRUE);
1239 sv_setsv(errsv, exception_object);
1246 Perl_croak(pTHX_ const char *pat, ...)
1249 va_start(args, pat);
1256 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1260 SV * const msv = vmess(pat, args);
1261 const I32 utf8 = SvUTF8(msv);
1262 const char * const message = SvPV_const(msv, msglen);
1265 /* sv_2cv might call Perl_warn() */
1266 SV * const oldwarnhook = PL_warnhook;
1272 SAVESPTR(PL_warnhook);
1273 PL_warnhook = Nullsv;
1274 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1276 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1282 msg = newSVpvn(message, msglen);
1283 SvFLAGS(msg) |= utf8;
1287 PUSHSTACKi(PERLSI_WARNHOOK);
1291 call_sv((SV*)cv, G_DISCARD);
1298 write_to_stderr(message, msglen);
1301 #if defined(PERL_IMPLICIT_CONTEXT)
1303 Perl_warn_nocontext(const char *pat, ...)
1307 va_start(args, pat);
1311 #endif /* PERL_IMPLICIT_CONTEXT */
1316 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1317 function the same way you call the C C<printf> function. See C<croak>.
1323 Perl_warn(pTHX_ const char *pat, ...)
1326 va_start(args, pat);
1331 #if defined(PERL_IMPLICIT_CONTEXT)
1333 Perl_warner_nocontext(U32 err, const char *pat, ...)
1337 va_start(args, pat);
1338 vwarner(err, pat, &args);
1341 #endif /* PERL_IMPLICIT_CONTEXT */
1344 Perl_warner(pTHX_ U32 err, const char* pat,...)
1347 va_start(args, pat);
1348 vwarner(err, pat, &args);
1353 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1357 SV * const msv = vmess(pat, args);
1359 const char *message = SvPV_const(msv, msglen);
1360 const I32 utf8 = SvUTF8(msv);
1364 S_vdie_common(aTHX_ message, msglen, utf8);
1367 PL_restartop = die_where(message, msglen);
1368 SvFLAGS(ERRSV) |= utf8;
1371 write_to_stderr(message, msglen);
1375 Perl_vwarn(aTHX_ pat, args);
1379 /* implements the ckWARN? macros */
1382 Perl_ckwarn(pTHX_ U32 w)
1387 && PL_curcop->cop_warnings != pWARN_NONE
1389 PL_curcop->cop_warnings == pWARN_ALL
1390 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1391 || (unpackWARN2(w) &&
1392 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1393 || (unpackWARN3(w) &&
1394 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1395 || (unpackWARN4(w) &&
1396 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1401 isLEXWARN_off && PL_dowarn & G_WARN_ON
1406 /* implements the ckWARN?_d macro */
1409 Perl_ckwarn_d(pTHX_ U32 w)
1413 || PL_curcop->cop_warnings == pWARN_ALL
1415 PL_curcop->cop_warnings != pWARN_NONE
1417 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1418 || (unpackWARN2(w) &&
1419 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1420 || (unpackWARN3(w) &&
1421 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1422 || (unpackWARN4(w) &&
1423 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1431 /* since we've already done strlen() for both nam and val
1432 * we can use that info to make things faster than
1433 * sprintf(s, "%s=%s", nam, val)
1435 #define my_setenv_format(s, nam, nlen, val, vlen) \
1436 Copy(nam, s, nlen, char); \
1438 Copy(val, s+(nlen+1), vlen, char); \
1439 *(s+(nlen+1+vlen)) = '\0'
1441 #ifdef USE_ENVIRON_ARRAY
1442 /* VMS' my_setenv() is in vms.c */
1443 #if !defined(WIN32) && !defined(NETWARE)
1445 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1449 /* only parent thread can modify process environment */
1450 if (PL_curinterp == aTHX)
1453 #ifndef PERL_USE_SAFE_PUTENV
1454 if (!PL_use_safe_putenv) {
1455 /* most putenv()s leak, so we manipulate environ directly */
1456 register I32 i=setenv_getix(nam); /* where does it go? */
1459 if (environ == PL_origenviron) { /* need we copy environment? */
1464 for (max = i; environ[max]; max++) ;
1465 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1466 for (j=0; j<max; j++) { /* copy environment */
1467 const int len = strlen(environ[j]);
1468 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1469 Copy(environ[j], tmpenv[j], len+1, char);
1471 tmpenv[max] = Nullch;
1472 environ = tmpenv; /* tell exec where it is now */
1475 safesysfree(environ[i]);
1476 while (environ[i]) {
1477 environ[i] = environ[i+1];
1482 if (!environ[i]) { /* does not exist yet */
1483 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1484 environ[i+1] = Nullch; /* make sure it's null terminated */
1487 safesysfree(environ[i]);
1491 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1492 /* all that work just for this */
1493 my_setenv_format(environ[i], nam, nlen, val, vlen);
1496 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1497 setenv(nam, val, 1);
1500 const int nlen = strlen(nam);
1506 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1507 /* all that work just for this */
1508 my_setenv_format(new_env, nam, nlen, val, vlen);
1509 (void)putenv(new_env);
1510 # endif /* __CYGWIN__ */
1511 #ifndef PERL_USE_SAFE_PUTENV
1517 #else /* WIN32 || NETWARE */
1520 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1523 register char *envstr;
1524 const int nlen = strlen(nam);
1531 New(904, envstr, nlen+vlen+2, char);
1532 my_setenv_format(envstr, nam, nlen, val, vlen);
1533 (void)PerlEnv_putenv(envstr);
1537 #endif /* WIN32 || NETWARE */
1541 Perl_setenv_getix(pTHX_ const char *nam)
1544 const register I32 len = strlen(nam);
1546 for (i = 0; environ[i]; i++) {
1549 strnicmp(environ[i],nam,len) == 0
1551 strnEQ(environ[i],nam,len)
1553 && environ[i][len] == '=')
1554 break; /* strnEQ must come first to avoid */
1555 } /* potential SEGV's */
1558 #endif /* !PERL_MICRO */
1560 #endif /* !VMS && !EPOC*/
1562 #ifdef UNLINK_ALL_VERSIONS
1564 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1568 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1573 /* this is a drop-in replacement for bcopy() */
1574 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1576 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1580 if (from - to >= 0) {
1588 *(--to) = *(--from);
1594 /* this is a drop-in replacement for memset() */
1597 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1607 /* this is a drop-in replacement for bzero() */
1608 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1610 Perl_my_bzero(register char *loc, register I32 len)
1620 /* this is a drop-in replacement for memcmp() */
1621 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1623 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1625 register const U8 *a = (const U8 *)s1;
1626 register const U8 *b = (const U8 *)s2;
1630 if ((tmp = *a++ - *b++))
1635 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1639 #ifdef USE_CHAR_VSPRINTF
1644 vsprintf(char *dest, const char *pat, char *args)
1648 fakebuf._ptr = dest;
1649 fakebuf._cnt = 32767;
1653 fakebuf._flag = _IOWRT|_IOSTRG;
1654 _doprnt(pat, args, &fakebuf); /* what a kludge */
1655 (void)putc('\0', &fakebuf);
1656 #ifdef USE_CHAR_VSPRINTF
1659 return 0; /* perl doesn't use return value */
1663 #endif /* HAS_VPRINTF */
1666 #if BYTEORDER != 0x4321
1668 Perl_my_swap(pTHX_ short s)
1670 #if (BYTEORDER & 1) == 0
1673 result = ((s & 255) << 8) + ((s >> 8) & 255);
1681 Perl_my_htonl(pTHX_ long l)
1685 char c[sizeof(long)];
1688 #if BYTEORDER == 0x1234
1689 u.c[0] = (l >> 24) & 255;
1690 u.c[1] = (l >> 16) & 255;
1691 u.c[2] = (l >> 8) & 255;
1695 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1696 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1701 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1702 u.c[o & 0xf] = (l >> s) & 255;
1710 Perl_my_ntohl(pTHX_ long l)
1714 char c[sizeof(long)];
1717 #if BYTEORDER == 0x1234
1718 u.c[0] = (l >> 24) & 255;
1719 u.c[1] = (l >> 16) & 255;
1720 u.c[2] = (l >> 8) & 255;
1724 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1725 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1732 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1733 l |= (u.c[o & 0xf] & 255) << s;
1740 #endif /* BYTEORDER != 0x4321 */
1744 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1745 * If these functions are defined,
1746 * the BYTEORDER is neither 0x1234 nor 0x4321.
1747 * However, this is not assumed.
1751 #define HTOLE(name,type) \
1753 name (register type n) \
1757 char c[sizeof(type)]; \
1760 register I32 s = 0; \
1761 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1762 u.c[i] = (n >> s) & 0xFF; \
1767 #define LETOH(name,type) \
1769 name (register type n) \
1773 char c[sizeof(type)]; \
1776 register I32 s = 0; \
1779 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1780 n |= ((type)(u.c[i] & 0xFF)) << s; \
1786 * Big-endian byte order functions.
1789 #define HTOBE(name,type) \
1791 name (register type n) \
1795 char c[sizeof(type)]; \
1798 register I32 s = 8*(sizeof(u.c)-1); \
1799 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1800 u.c[i] = (n >> s) & 0xFF; \
1805 #define BETOH(name,type) \
1807 name (register type n) \
1811 char c[sizeof(type)]; \
1814 register I32 s = 8*(sizeof(u.c)-1); \
1817 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1818 n |= ((type)(u.c[i] & 0xFF)) << s; \
1824 * If we just can't do it...
1827 #define NOT_AVAIL(name,type) \
1829 name (register type n) \
1831 Perl_croak_nocontext(#name "() not available"); \
1832 return n; /* not reached */ \
1836 #if defined(HAS_HTOVS) && !defined(htovs)
1839 #if defined(HAS_HTOVL) && !defined(htovl)
1842 #if defined(HAS_VTOHS) && !defined(vtohs)
1845 #if defined(HAS_VTOHL) && !defined(vtohl)
1849 #ifdef PERL_NEED_MY_HTOLE16
1851 HTOLE(Perl_my_htole16,U16)
1853 NOT_AVAIL(Perl_my_htole16,U16)
1856 #ifdef PERL_NEED_MY_LETOH16
1858 LETOH(Perl_my_letoh16,U16)
1860 NOT_AVAIL(Perl_my_letoh16,U16)
1863 #ifdef PERL_NEED_MY_HTOBE16
1865 HTOBE(Perl_my_htobe16,U16)
1867 NOT_AVAIL(Perl_my_htobe16,U16)
1870 #ifdef PERL_NEED_MY_BETOH16
1872 BETOH(Perl_my_betoh16,U16)
1874 NOT_AVAIL(Perl_my_betoh16,U16)
1878 #ifdef PERL_NEED_MY_HTOLE32
1880 HTOLE(Perl_my_htole32,U32)
1882 NOT_AVAIL(Perl_my_htole32,U32)
1885 #ifdef PERL_NEED_MY_LETOH32
1887 LETOH(Perl_my_letoh32,U32)
1889 NOT_AVAIL(Perl_my_letoh32,U32)
1892 #ifdef PERL_NEED_MY_HTOBE32
1894 HTOBE(Perl_my_htobe32,U32)
1896 NOT_AVAIL(Perl_my_htobe32,U32)
1899 #ifdef PERL_NEED_MY_BETOH32
1901 BETOH(Perl_my_betoh32,U32)
1903 NOT_AVAIL(Perl_my_betoh32,U32)
1907 #ifdef PERL_NEED_MY_HTOLE64
1909 HTOLE(Perl_my_htole64,U64)
1911 NOT_AVAIL(Perl_my_htole64,U64)
1914 #ifdef PERL_NEED_MY_LETOH64
1916 LETOH(Perl_my_letoh64,U64)
1918 NOT_AVAIL(Perl_my_letoh64,U64)
1921 #ifdef PERL_NEED_MY_HTOBE64
1923 HTOBE(Perl_my_htobe64,U64)
1925 NOT_AVAIL(Perl_my_htobe64,U64)
1928 #ifdef PERL_NEED_MY_BETOH64
1930 BETOH(Perl_my_betoh64,U64)
1932 NOT_AVAIL(Perl_my_betoh64,U64)
1936 #ifdef PERL_NEED_MY_HTOLES
1937 HTOLE(Perl_my_htoles,short)
1939 #ifdef PERL_NEED_MY_LETOHS
1940 LETOH(Perl_my_letohs,short)
1942 #ifdef PERL_NEED_MY_HTOBES
1943 HTOBE(Perl_my_htobes,short)
1945 #ifdef PERL_NEED_MY_BETOHS
1946 BETOH(Perl_my_betohs,short)
1949 #ifdef PERL_NEED_MY_HTOLEI
1950 HTOLE(Perl_my_htolei,int)
1952 #ifdef PERL_NEED_MY_LETOHI
1953 LETOH(Perl_my_letohi,int)
1955 #ifdef PERL_NEED_MY_HTOBEI
1956 HTOBE(Perl_my_htobei,int)
1958 #ifdef PERL_NEED_MY_BETOHI
1959 BETOH(Perl_my_betohi,int)
1962 #ifdef PERL_NEED_MY_HTOLEL
1963 HTOLE(Perl_my_htolel,long)
1965 #ifdef PERL_NEED_MY_LETOHL
1966 LETOH(Perl_my_letohl,long)
1968 #ifdef PERL_NEED_MY_HTOBEL
1969 HTOBE(Perl_my_htobel,long)
1971 #ifdef PERL_NEED_MY_BETOHL
1972 BETOH(Perl_my_betohl,long)
1976 Perl_my_swabn(void *ptr, int n)
1978 register char *s = (char *)ptr;
1979 register char *e = s + (n-1);
1982 for (n /= 2; n > 0; s++, e--, n--) {
1990 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1992 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1994 register I32 This, that;
2000 PERL_FLUSHALL_FOR_CHILD;
2001 This = (*mode == 'w');
2005 taint_proper("Insecure %s%s", "EXEC");
2007 if (PerlProc_pipe(p) < 0)
2009 /* Try for another pipe pair for error return */
2010 if (PerlProc_pipe(pp) >= 0)
2012 while ((pid = PerlProc_fork()) < 0) {
2013 if (errno != EAGAIN) {
2014 PerlLIO_close(p[This]);
2015 PerlLIO_close(p[that]);
2017 PerlLIO_close(pp[0]);
2018 PerlLIO_close(pp[1]);
2030 /* Close parent's end of error status pipe (if any) */
2032 PerlLIO_close(pp[0]);
2033 #if defined(HAS_FCNTL) && defined(F_SETFD)
2034 /* Close error pipe automatically if exec works */
2035 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2038 /* Now dup our end of _the_ pipe to right position */
2039 if (p[THIS] != (*mode == 'r')) {
2040 PerlLIO_dup2(p[THIS], *mode == 'r');
2041 PerlLIO_close(p[THIS]);
2042 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2043 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2046 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2047 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2048 /* No automatic close - do it by hand */
2055 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2061 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2067 do_execfree(); /* free any memory malloced by child on fork */
2069 PerlLIO_close(pp[1]);
2070 /* Keep the lower of the two fd numbers */
2071 if (p[that] < p[This]) {
2072 PerlLIO_dup2(p[This], p[that]);
2073 PerlLIO_close(p[This]);
2077 PerlLIO_close(p[that]); /* close child's end of pipe */
2080 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2082 SvUPGRADE(sv,SVt_IV);
2084 PL_forkprocess = pid;
2085 /* If we managed to get status pipe check for exec fail */
2086 if (did_pipes && pid > 0) {
2090 while (n < sizeof(int)) {
2091 n1 = PerlLIO_read(pp[0],
2092 (void*)(((char*)&errkid)+n),
2098 PerlLIO_close(pp[0]);
2100 if (n) { /* Error */
2102 PerlLIO_close(p[This]);
2103 if (n != sizeof(int))
2104 Perl_croak(aTHX_ "panic: kid popen errno read");
2106 pid2 = wait4pid(pid, &status, 0);
2107 } while (pid2 == -1 && errno == EINTR);
2108 errno = errkid; /* Propagate errno from kid */
2113 PerlLIO_close(pp[0]);
2114 return PerlIO_fdopen(p[This], mode);
2116 Perl_croak(aTHX_ "List form of piped open not implemented");
2117 return (PerlIO *) NULL;
2121 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2122 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2124 Perl_my_popen(pTHX_ char *cmd, char *mode)
2127 register I32 This, that;
2130 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2134 PERL_FLUSHALL_FOR_CHILD;
2137 return my_syspopen(aTHX_ cmd,mode);
2140 This = (*mode == 'w');
2142 if (doexec && PL_tainting) {
2144 taint_proper("Insecure %s%s", "EXEC");
2146 if (PerlProc_pipe(p) < 0)
2148 if (doexec && PerlProc_pipe(pp) >= 0)
2150 while ((pid = PerlProc_fork()) < 0) {
2151 if (errno != EAGAIN) {
2152 PerlLIO_close(p[This]);
2153 PerlLIO_close(p[that]);
2155 PerlLIO_close(pp[0]);
2156 PerlLIO_close(pp[1]);
2159 Perl_croak(aTHX_ "Can't fork");
2172 PerlLIO_close(pp[0]);
2173 #if defined(HAS_FCNTL) && defined(F_SETFD)
2174 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2177 if (p[THIS] != (*mode == 'r')) {
2178 PerlLIO_dup2(p[THIS], *mode == 'r');
2179 PerlLIO_close(p[THIS]);
2180 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2181 PerlLIO_close(p[THAT]);
2184 PerlLIO_close(p[THAT]);
2187 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2194 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2199 /* may or may not use the shell */
2200 do_exec3(cmd, pp[1], did_pipes);
2203 #endif /* defined OS2 */
2204 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2205 SvREADONLY_off(GvSV(tmpgv));
2206 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2207 SvREADONLY_on(GvSV(tmpgv));
2209 #ifdef THREADS_HAVE_PIDS
2210 PL_ppid = (IV)getppid();
2213 hv_clear(PL_pidstatus); /* we have no children */
2218 do_execfree(); /* free any memory malloced by child on vfork */
2220 PerlLIO_close(pp[1]);
2221 if (p[that] < p[This]) {
2222 PerlLIO_dup2(p[This], p[that]);
2223 PerlLIO_close(p[This]);
2227 PerlLIO_close(p[that]);
2230 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2232 SvUPGRADE(sv,SVt_IV);
2234 PL_forkprocess = pid;
2235 if (did_pipes && pid > 0) {
2239 while (n < sizeof(int)) {
2240 n1 = PerlLIO_read(pp[0],
2241 (void*)(((char*)&errkid)+n),
2247 PerlLIO_close(pp[0]);
2249 if (n) { /* Error */
2251 PerlLIO_close(p[This]);
2252 if (n != sizeof(int))
2253 Perl_croak(aTHX_ "panic: kid popen errno read");
2255 pid2 = wait4pid(pid, &status, 0);
2256 } while (pid2 == -1 && errno == EINTR);
2257 errno = errkid; /* Propagate errno from kid */
2262 PerlLIO_close(pp[0]);
2263 return PerlIO_fdopen(p[This], mode);
2266 #if defined(atarist) || defined(EPOC)
2269 Perl_my_popen(pTHX_ char *cmd, char *mode)
2271 PERL_FLUSHALL_FOR_CHILD;
2272 /* Call system's popen() to get a FILE *, then import it.
2273 used 0 for 2nd parameter to PerlIO_importFILE;
2276 return PerlIO_importFILE(popen(cmd, mode), 0);
2280 FILE *djgpp_popen();
2282 Perl_my_popen(pTHX_ char *cmd, char *mode)
2284 PERL_FLUSHALL_FOR_CHILD;
2285 /* Call system's popen() to get a FILE *, then import it.
2286 used 0 for 2nd parameter to PerlIO_importFILE;
2289 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2294 #endif /* !DOSISH */
2296 /* this is called in parent before the fork() */
2298 Perl_atfork_lock(void)
2301 #if defined(USE_ITHREADS)
2302 /* locks must be held in locking order (if any) */
2304 MUTEX_LOCK(&PL_malloc_mutex);
2310 /* this is called in both parent and child after the fork() */
2312 Perl_atfork_unlock(void)
2315 #if defined(USE_ITHREADS)
2316 /* locks must be released in same order as in atfork_lock() */
2318 MUTEX_UNLOCK(&PL_malloc_mutex);
2327 #if defined(HAS_FORK)
2329 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2334 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2335 * handlers elsewhere in the code */
2340 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2341 Perl_croak_nocontext("fork() not available");
2343 #endif /* HAS_FORK */
2348 Perl_dump_fds(pTHX_ char *s)
2353 PerlIO_printf(Perl_debug_log,"%s", s);
2354 for (fd = 0; fd < 32; fd++) {
2355 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2356 PerlIO_printf(Perl_debug_log," %d",fd);
2358 PerlIO_printf(Perl_debug_log,"\n");
2361 #endif /* DUMP_FDS */
2365 dup2(int oldfd, int newfd)
2367 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2370 PerlLIO_close(newfd);
2371 return fcntl(oldfd, F_DUPFD, newfd);
2373 #define DUP2_MAX_FDS 256
2374 int fdtmp[DUP2_MAX_FDS];
2380 PerlLIO_close(newfd);
2381 /* good enough for low fd's... */
2382 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2383 if (fdx >= DUP2_MAX_FDS) {
2391 PerlLIO_close(fdtmp[--fdx]);
2398 #ifdef HAS_SIGACTION
2400 #ifdef MACOS_TRADITIONAL
2401 /* We don't want restart behavior on MacOS */
2406 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2409 struct sigaction act, oact;
2412 /* only "parent" interpreter can diddle signals */
2413 if (PL_curinterp != aTHX)
2417 act.sa_handler = handler;
2418 sigemptyset(&act.sa_mask);
2421 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2422 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2424 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2425 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2426 act.sa_flags |= SA_NOCLDWAIT;
2428 if (sigaction(signo, &act, &oact) == -1)
2431 return oact.sa_handler;
2435 Perl_rsignal_state(pTHX_ int signo)
2437 struct sigaction oact;
2439 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2442 return oact.sa_handler;
2446 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2449 struct sigaction act;
2452 /* only "parent" interpreter can diddle signals */
2453 if (PL_curinterp != aTHX)
2457 act.sa_handler = handler;
2458 sigemptyset(&act.sa_mask);
2461 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2462 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2464 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2465 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2466 act.sa_flags |= SA_NOCLDWAIT;
2468 return sigaction(signo, &act, save);
2472 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2476 /* only "parent" interpreter can diddle signals */
2477 if (PL_curinterp != aTHX)
2481 return sigaction(signo, save, (struct sigaction *)NULL);
2484 #else /* !HAS_SIGACTION */
2487 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2489 #if defined(USE_ITHREADS) && !defined(WIN32)
2490 /* only "parent" interpreter can diddle signals */
2491 if (PL_curinterp != aTHX)
2495 return PerlProc_signal(signo, handler);
2507 Perl_rsignal_state(pTHX_ int signo)
2510 Sighandler_t oldsig;
2512 #if defined(USE_ITHREADS) && !defined(WIN32)
2513 /* only "parent" interpreter can diddle signals */
2514 if (PL_curinterp != aTHX)
2519 oldsig = PerlProc_signal(signo, sig_trap);
2520 PerlProc_signal(signo, oldsig);
2522 PerlProc_kill(PerlProc_getpid(), signo);
2527 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2529 #if defined(USE_ITHREADS) && !defined(WIN32)
2530 /* only "parent" interpreter can diddle signals */
2531 if (PL_curinterp != aTHX)
2534 *save = PerlProc_signal(signo, handler);
2535 return (*save == SIG_ERR) ? -1 : 0;
2539 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2541 #if defined(USE_ITHREADS) && !defined(WIN32)
2542 /* only "parent" interpreter can diddle signals */
2543 if (PL_curinterp != aTHX)
2546 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2549 #endif /* !HAS_SIGACTION */
2550 #endif /* !PERL_MICRO */
2552 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2553 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2555 Perl_my_pclose(pTHX_ PerlIO *ptr)
2557 Sigsave_t hstat, istat, qstat;
2563 int saved_errno = 0;
2565 int saved_win32_errno;
2569 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2571 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2573 *svp = &PL_sv_undef;
2575 if (pid == -1) { /* Opened by popen. */
2576 return my_syspclose(ptr);
2579 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2580 saved_errno = errno;
2582 saved_win32_errno = GetLastError();
2586 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2589 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2590 rsignal_save(SIGINT, SIG_IGN, &istat);
2591 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2594 pid2 = wait4pid(pid, &status, 0);
2595 } while (pid2 == -1 && errno == EINTR);
2597 rsignal_restore(SIGHUP, &hstat);
2598 rsignal_restore(SIGINT, &istat);
2599 rsignal_restore(SIGQUIT, &qstat);
2602 SETERRNO(saved_errno, 0);
2605 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2607 #endif /* !DOSISH */
2609 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2611 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2616 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2618 char spid[TYPE_CHARS(IV)];
2622 sprintf(spid, "%"IVdf, (IV)pid);
2623 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2624 if (svp && *svp != &PL_sv_undef) {
2625 *statusp = SvIVX(*svp);
2626 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2633 hv_iterinit(PL_pidstatus);
2634 if ((entry = hv_iternext(PL_pidstatus))) {
2635 SV *sv = hv_iterval(PL_pidstatus,entry);
2637 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2638 *statusp = SvIVX(sv);
2639 sprintf(spid, "%"IVdf, (IV)pid);
2640 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2647 # ifdef HAS_WAITPID_RUNTIME
2648 if (!HAS_WAITPID_RUNTIME)
2651 result = PerlProc_waitpid(pid,statusp,flags);
2654 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2655 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2658 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2659 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2664 Perl_croak(aTHX_ "Can't do waitpid with flags");
2666 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2667 pidgone(result,*statusp);
2673 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2676 if (result < 0 && errno == EINTR) {
2681 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2684 Perl_pidgone(pTHX_ Pid_t pid, int status)
2687 char spid[TYPE_CHARS(IV)];
2689 sprintf(spid, "%"IVdf, (IV)pid);
2690 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2691 SvUPGRADE(sv,SVt_IV);
2692 SvIV_set(sv, status);
2696 #if defined(atarist) || defined(OS2) || defined(EPOC)
2699 int /* Cannot prototype with I32
2701 my_syspclose(PerlIO *ptr)
2704 Perl_my_pclose(pTHX_ PerlIO *ptr)
2707 /* Needs work for PerlIO ! */
2708 FILE *f = PerlIO_findFILE(ptr);
2709 I32 result = pclose(f);
2710 PerlIO_releaseFILE(ptr,f);
2718 Perl_my_pclose(pTHX_ PerlIO *ptr)
2720 /* Needs work for PerlIO ! */
2721 FILE *f = PerlIO_findFILE(ptr);
2722 I32 result = djgpp_pclose(f);
2723 result = (result << 8) & 0xff00;
2724 PerlIO_releaseFILE(ptr,f);
2730 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2733 register const char *frombase = from;
2736 register const char c = *from;
2741 while (count-- > 0) {
2742 for (todo = len; todo > 0; todo--) {
2751 Perl_same_dirent(pTHX_ const char *a, const char *b)
2753 char *fa = strrchr(a,'/');
2754 char *fb = strrchr(b,'/');
2757 SV *tmpsv = sv_newmortal();
2770 sv_setpvn(tmpsv, ".", 1);
2772 sv_setpvn(tmpsv, a, fa - a);
2773 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2776 sv_setpvn(tmpsv, ".", 1);
2778 sv_setpvn(tmpsv, b, fb - b);
2779 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2781 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2782 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2784 #endif /* !HAS_RENAME */
2787 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2789 const char *xfound = Nullch;
2790 char *xfailed = Nullch;
2791 char tmpbuf[MAXPATHLEN];
2795 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2796 # define SEARCH_EXTS ".bat", ".cmd", NULL
2797 # define MAX_EXT_LEN 4
2800 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2801 # define MAX_EXT_LEN 4
2804 # define SEARCH_EXTS ".pl", ".com", NULL
2805 # define MAX_EXT_LEN 4
2807 /* additional extensions to try in each dir if scriptname not found */
2809 const char *exts[] = { SEARCH_EXTS };
2810 const char **ext = search_ext ? search_ext : exts;
2811 int extidx = 0, i = 0;
2812 const char *curext = Nullch;
2814 PERL_UNUSED_ARG(search_ext);
2815 # define MAX_EXT_LEN 0
2819 * If dosearch is true and if scriptname does not contain path
2820 * delimiters, search the PATH for scriptname.
2822 * If SEARCH_EXTS is also defined, will look for each
2823 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2824 * while searching the PATH.
2826 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2827 * proceeds as follows:
2828 * If DOSISH or VMSISH:
2829 * + look for ./scriptname{,.foo,.bar}
2830 * + search the PATH for scriptname{,.foo,.bar}
2833 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2834 * this will not look in '.' if it's not in the PATH)
2839 # ifdef ALWAYS_DEFTYPES
2840 len = strlen(scriptname);
2841 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2842 int hasdir, idx = 0, deftypes = 1;
2845 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2848 int hasdir, idx = 0, deftypes = 1;
2851 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2853 /* The first time through, just add SEARCH_EXTS to whatever we
2854 * already have, so we can check for default file types. */
2856 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2862 if ((strlen(tmpbuf) + strlen(scriptname)
2863 + MAX_EXT_LEN) >= sizeof tmpbuf)
2864 continue; /* don't search dir with too-long name */
2865 strcat(tmpbuf, scriptname);
2869 if (strEQ(scriptname, "-"))
2871 if (dosearch) { /* Look in '.' first. */
2872 const char *cur = scriptname;
2874 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2876 if (strEQ(ext[i++],curext)) {
2877 extidx = -1; /* already has an ext */
2882 DEBUG_p(PerlIO_printf(Perl_debug_log,
2883 "Looking for %s\n",cur));
2884 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2885 && !S_ISDIR(PL_statbuf.st_mode)) {
2893 if (cur == scriptname) {
2894 len = strlen(scriptname);
2895 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2897 /* FIXME? Convert to memcpy */
2898 cur = strcpy(tmpbuf, scriptname);
2900 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2901 && strcpy(tmpbuf+len, ext[extidx++]));
2906 #ifdef MACOS_TRADITIONAL
2907 if (dosearch && !strchr(scriptname, ':') &&
2908 (s = PerlEnv_getenv("Commands")))
2910 if (dosearch && !strchr(scriptname, '/')
2912 && !strchr(scriptname, '\\')
2914 && (s = PerlEnv_getenv("PATH")))
2919 PL_bufend = s + strlen(s);
2920 while (s < PL_bufend) {
2921 #ifdef MACOS_TRADITIONAL
2922 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2926 #if defined(atarist) || defined(DOSISH)
2931 && *s != ';'; len++, s++) {
2932 if (len < sizeof tmpbuf)
2935 if (len < sizeof tmpbuf)
2937 #else /* ! (atarist || DOSISH) */
2938 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2941 #endif /* ! (atarist || DOSISH) */
2942 #endif /* MACOS_TRADITIONAL */
2945 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2946 continue; /* don't search dir with too-long name */
2947 #ifdef MACOS_TRADITIONAL
2948 if (len && tmpbuf[len - 1] != ':')
2949 tmpbuf[len++] = ':';
2952 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2953 && tmpbuf[len - 1] != '/'
2954 && tmpbuf[len - 1] != '\\'
2957 tmpbuf[len++] = '/';
2958 if (len == 2 && tmpbuf[0] == '.')
2961 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2963 (void)strcpy(tmpbuf + len, scriptname);
2967 len = strlen(tmpbuf);
2968 if (extidx > 0) /* reset after previous loop */
2972 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2973 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2974 if (S_ISDIR(PL_statbuf.st_mode)) {
2978 } while ( retval < 0 /* not there */
2979 && extidx>=0 && ext[extidx] /* try an extension? */
2980 && strcpy(tmpbuf+len, ext[extidx++])
2985 if (S_ISREG(PL_statbuf.st_mode)
2986 && cando(S_IRUSR,TRUE,&PL_statbuf)
2987 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2988 && cando(S_IXUSR,TRUE,&PL_statbuf)
2992 xfound = tmpbuf; /* bingo! */
2996 xfailed = savepv(tmpbuf);
2999 if (!xfound && !seen_dot && !xfailed &&
3000 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3001 || S_ISDIR(PL_statbuf.st_mode)))
3003 seen_dot = 1; /* Disable message. */
3005 if (flags & 1) { /* do or die? */
3006 Perl_croak(aTHX_ "Can't %s %s%s%s",
3007 (xfailed ? "execute" : "find"),
3008 (xfailed ? xfailed : scriptname),
3009 (xfailed ? "" : " on PATH"),
3010 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3012 scriptname = Nullch;
3015 scriptname = xfound;
3017 return (scriptname ? savepv(scriptname) : Nullch);
3020 #ifndef PERL_GET_CONTEXT_DEFINED
3023 Perl_get_context(void)
3026 #if defined(USE_ITHREADS)
3027 # ifdef OLD_PTHREADS_API
3029 if (pthread_getspecific(PL_thr_key, &t))
3030 Perl_croak_nocontext("panic: pthread_getspecific");
3033 # ifdef I_MACH_CTHREADS
3034 return (void*)cthread_data(cthread_self());
3036 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3045 Perl_set_context(void *t)
3048 #if defined(USE_ITHREADS)
3049 # ifdef I_MACH_CTHREADS
3050 cthread_set_data(cthread_self(), t);
3052 if (pthread_setspecific(PL_thr_key, t))
3053 Perl_croak_nocontext("panic: pthread_setspecific");
3060 #endif /* !PERL_GET_CONTEXT_DEFINED */
3062 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3071 Perl_get_op_names(pTHX)
3073 return (char **)PL_op_name;
3077 Perl_get_op_descs(pTHX)
3079 return (char **)PL_op_desc;
3083 Perl_get_no_modify(pTHX)
3085 return PL_no_modify;
3089 Perl_get_opargs(pTHX)
3091 return (U32 *)PL_opargs;
3095 Perl_get_ppaddr(pTHX)
3098 return (PPADDR_t*)PL_ppaddr;
3101 #ifndef HAS_GETENV_LEN
3103 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3105 char * const env_trans = PerlEnv_getenv(env_elem);
3107 *len = strlen(env_trans);
3114 Perl_get_vtbl(pTHX_ int vtbl_id)
3116 const MGVTBL* result = Null(MGVTBL*);
3120 result = &PL_vtbl_sv;
3123 result = &PL_vtbl_env;
3125 case want_vtbl_envelem:
3126 result = &PL_vtbl_envelem;
3129 result = &PL_vtbl_sig;
3131 case want_vtbl_sigelem:
3132 result = &PL_vtbl_sigelem;
3134 case want_vtbl_pack:
3135 result = &PL_vtbl_pack;
3137 case want_vtbl_packelem:
3138 result = &PL_vtbl_packelem;
3140 case want_vtbl_dbline:
3141 result = &PL_vtbl_dbline;
3144 result = &PL_vtbl_isa;
3146 case want_vtbl_isaelem:
3147 result = &PL_vtbl_isaelem;
3149 case want_vtbl_arylen:
3150 result = &PL_vtbl_arylen;
3152 case want_vtbl_glob:
3153 result = &PL_vtbl_glob;
3155 case want_vtbl_mglob:
3156 result = &PL_vtbl_mglob;
3158 case want_vtbl_nkeys:
3159 result = &PL_vtbl_nkeys;
3161 case want_vtbl_taint:
3162 result = &PL_vtbl_taint;
3164 case want_vtbl_substr:
3165 result = &PL_vtbl_substr;
3168 result = &PL_vtbl_vec;
3171 result = &PL_vtbl_pos;
3174 result = &PL_vtbl_bm;
3177 result = &PL_vtbl_fm;
3179 case want_vtbl_uvar:
3180 result = &PL_vtbl_uvar;
3182 case want_vtbl_defelem:
3183 result = &PL_vtbl_defelem;
3185 case want_vtbl_regexp:
3186 result = &PL_vtbl_regexp;
3188 case want_vtbl_regdata:
3189 result = &PL_vtbl_regdata;
3191 case want_vtbl_regdatum:
3192 result = &PL_vtbl_regdatum;
3194 #ifdef USE_LOCALE_COLLATE
3195 case want_vtbl_collxfrm:
3196 result = &PL_vtbl_collxfrm;
3199 case want_vtbl_amagic:
3200 result = &PL_vtbl_amagic;
3202 case want_vtbl_amagicelem:
3203 result = &PL_vtbl_amagicelem;
3205 case want_vtbl_backref:
3206 result = &PL_vtbl_backref;
3208 case want_vtbl_utf8:
3209 result = &PL_vtbl_utf8;
3212 return (MGVTBL*)result;
3216 Perl_my_fflush_all(pTHX)
3218 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3219 return PerlIO_flush(NULL);
3221 # if defined(HAS__FWALK)
3222 extern int fflush(FILE *);
3223 /* undocumented, unprototyped, but very useful BSDism */
3224 extern void _fwalk(int (*)(FILE *));
3228 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3230 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3231 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3233 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3234 open_max = sysconf(_SC_OPEN_MAX);
3237 open_max = FOPEN_MAX;
3240 open_max = OPEN_MAX;
3251 for (i = 0; i < open_max; i++)
3252 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3253 STDIO_STREAM_ARRAY[i]._file < open_max &&
3254 STDIO_STREAM_ARRAY[i]._flag)
3255 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3259 SETERRNO(EBADF,RMS_IFI);
3266 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3269 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3270 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3272 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3273 const char *type = OP_IS_SOCKET(op)
3274 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3275 ? "socket" : "filehandle";
3276 const char *name = NULL;
3278 if (gv && isGV(gv)) {
3282 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3283 if (ckWARN(WARN_IO)) {
3284 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3286 Perl_warner(aTHX_ packWARN(WARN_IO),
3287 "Filehandle %s opened only for %sput",
3290 Perl_warner(aTHX_ packWARN(WARN_IO),
3291 "Filehandle opened only for %sput", direction);
3298 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3300 warn_type = WARN_CLOSED;
3304 warn_type = WARN_UNOPENED;
3307 if (ckWARN(warn_type)) {
3308 if (name && *name) {
3309 Perl_warner(aTHX_ packWARN(warn_type),
3310 "%s%s on %s %s %s", func, pars, vile, type, name);
3311 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3313 aTHX_ packWARN(warn_type),
3314 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3319 Perl_warner(aTHX_ packWARN(warn_type),
3320 "%s%s on %s %s", func, pars, vile, type);
3321 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3323 aTHX_ packWARN(warn_type),
3324 "\t(Are you trying to call %s%s on dirhandle?)\n",
3333 /* in ASCII order, not that it matters */
3334 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3337 Perl_ebcdic_control(pTHX_ int ch)
3345 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3346 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3349 if (ctlp == controllablechars)
3350 return('\177'); /* DEL */
3352 return((unsigned char)(ctlp - controllablechars - 1));
3353 } else { /* Want uncontrol */
3354 if (ch == '\177' || ch == -1)
3356 else if (ch == '\157')
3358 else if (ch == '\174')
3360 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3362 else if (ch == '\155')
3364 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3365 return(controllablechars[ch+1]);
3367 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3372 /* To workaround core dumps from the uninitialised tm_zone we get the
3373 * system to give us a reasonable struct to copy. This fix means that
3374 * strftime uses the tm_zone and tm_gmtoff values returned by
3375 * localtime(time()). That should give the desired result most of the
3376 * time. But probably not always!
3378 * This does not address tzname aspects of NETaa14816.
3383 # ifndef STRUCT_TM_HASZONE
3384 # define STRUCT_TM_HASZONE
3388 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3389 # ifndef HAS_TM_TM_ZONE
3390 # define HAS_TM_TM_ZONE
3395 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3397 #ifdef HAS_TM_TM_ZONE
3399 const struct tm* my_tm;
3401 my_tm = localtime(&now);
3403 Copy(my_tm, ptm, 1, struct tm);
3405 PERL_UNUSED_ARG(ptm);
3410 * mini_mktime - normalise struct tm values without the localtime()
3411 * semantics (and overhead) of mktime().
3414 Perl_mini_mktime(pTHX_ struct tm *ptm)
3418 int month, mday, year, jday;
3419 int odd_cent, odd_year;
3421 #define DAYS_PER_YEAR 365
3422 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3423 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3424 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3425 #define SECS_PER_HOUR (60*60)
3426 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3427 /* parentheses deliberately absent on these two, otherwise they don't work */
3428 #define MONTH_TO_DAYS 153/5
3429 #define DAYS_TO_MONTH 5/153
3430 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3431 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3432 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3433 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3436 * Year/day algorithm notes:
3438 * With a suitable offset for numeric value of the month, one can find
3439 * an offset into the year by considering months to have 30.6 (153/5) days,
3440 * using integer arithmetic (i.e., with truncation). To avoid too much
3441 * messing about with leap days, we consider January and February to be
3442 * the 13th and 14th month of the previous year. After that transformation,
3443 * we need the month index we use to be high by 1 from 'normal human' usage,
3444 * so the month index values we use run from 4 through 15.
3446 * Given that, and the rules for the Gregorian calendar (leap years are those
3447 * divisible by 4 unless also divisible by 100, when they must be divisible
3448 * by 400 instead), we can simply calculate the number of days since some
3449 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3450 * the days we derive from our month index, and adding in the day of the
3451 * month. The value used here is not adjusted for the actual origin which
3452 * it normally would use (1 January A.D. 1), since we're not exposing it.
3453 * We're only building the value so we can turn around and get the
3454 * normalised values for the year, month, day-of-month, and day-of-year.
3456 * For going backward, we need to bias the value we're using so that we find
3457 * the right year value. (Basically, we don't want the contribution of
3458 * March 1st to the number to apply while deriving the year). Having done
3459 * that, we 'count up' the contribution to the year number by accounting for
3460 * full quadracenturies (400-year periods) with their extra leap days, plus
3461 * the contribution from full centuries (to avoid counting in the lost leap
3462 * days), plus the contribution from full quad-years (to count in the normal
3463 * leap days), plus the leftover contribution from any non-leap years.
3464 * At this point, if we were working with an actual leap day, we'll have 0
3465 * days left over. This is also true for March 1st, however. So, we have
3466 * to special-case that result, and (earlier) keep track of the 'odd'
3467 * century and year contributions. If we got 4 extra centuries in a qcent,
3468 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3469 * Otherwise, we add back in the earlier bias we removed (the 123 from
3470 * figuring in March 1st), find the month index (integer division by 30.6),
3471 * and the remainder is the day-of-month. We then have to convert back to
3472 * 'real' months (including fixing January and February from being 14/15 in
3473 * the previous year to being in the proper year). After that, to get
3474 * tm_yday, we work with the normalised year and get a new yearday value for
3475 * January 1st, which we subtract from the yearday value we had earlier,
3476 * representing the date we've re-built. This is done from January 1
3477 * because tm_yday is 0-origin.
3479 * Since POSIX time routines are only guaranteed to work for times since the
3480 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3481 * applies Gregorian calendar rules even to dates before the 16th century
3482 * doesn't bother me. Besides, you'd need cultural context for a given
3483 * date to know whether it was Julian or Gregorian calendar, and that's
3484 * outside the scope for this routine. Since we convert back based on the
3485 * same rules we used to build the yearday, you'll only get strange results
3486 * for input which needed normalising, or for the 'odd' century years which
3487 * were leap years in the Julian calander but not in the Gregorian one.
3488 * I can live with that.
3490 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3491 * that's still outside the scope for POSIX time manipulation, so I don't
3495 year = 1900 + ptm->tm_year;
3496 month = ptm->tm_mon;
3497 mday = ptm->tm_mday;
3498 /* allow given yday with no month & mday to dominate the result */
3499 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3502 jday = 1 + ptm->tm_yday;
3511 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3512 yearday += month*MONTH_TO_DAYS + mday + jday;
3514 * Note that we don't know when leap-seconds were or will be,
3515 * so we have to trust the user if we get something which looks
3516 * like a sensible leap-second. Wild values for seconds will
3517 * be rationalised, however.
3519 if ((unsigned) ptm->tm_sec <= 60) {
3526 secs += 60 * ptm->tm_min;
3527 secs += SECS_PER_HOUR * ptm->tm_hour;
3529 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3530 /* got negative remainder, but need positive time */
3531 /* back off an extra day to compensate */
3532 yearday += (secs/SECS_PER_DAY)-1;
3533 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3536 yearday += (secs/SECS_PER_DAY);
3537 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3540 else if (secs >= SECS_PER_DAY) {
3541 yearday += (secs/SECS_PER_DAY);
3542 secs %= SECS_PER_DAY;
3544 ptm->tm_hour = secs/SECS_PER_HOUR;
3545 secs %= SECS_PER_HOUR;
3546 ptm->tm_min = secs/60;
3548 ptm->tm_sec += secs;
3549 /* done with time of day effects */
3551 * The algorithm for yearday has (so far) left it high by 428.
3552 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3553 * bias it by 123 while trying to figure out what year it
3554 * really represents. Even with this tweak, the reverse
3555 * translation fails for years before A.D. 0001.
3556 * It would still fail for Feb 29, but we catch that one below.
3558 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3559 yearday -= YEAR_ADJUST;
3560 year = (yearday / DAYS_PER_QCENT) * 400;
3561 yearday %= DAYS_PER_QCENT;
3562 odd_cent = yearday / DAYS_PER_CENT;
3563 year += odd_cent * 100;
3564 yearday %= DAYS_PER_CENT;
3565 year += (yearday / DAYS_PER_QYEAR) * 4;
3566 yearday %= DAYS_PER_QYEAR;
3567 odd_year = yearday / DAYS_PER_YEAR;
3569 yearday %= DAYS_PER_YEAR;
3570 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3575 yearday += YEAR_ADJUST; /* recover March 1st crock */
3576 month = yearday*DAYS_TO_MONTH;
3577 yearday -= month*MONTH_TO_DAYS;
3578 /* recover other leap-year adjustment */
3587 ptm->tm_year = year - 1900;
3589 ptm->tm_mday = yearday;
3590 ptm->tm_mon = month;
3594 ptm->tm_mon = month - 1;
3596 /* re-build yearday based on Jan 1 to get tm_yday */
3598 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3599 yearday += 14*MONTH_TO_DAYS + 1;
3600 ptm->tm_yday = jday - yearday;
3601 /* fix tm_wday if not overridden by caller */
3602 if ((unsigned)ptm->tm_wday > 6)
3603 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3607 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)
3615 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3618 mytm.tm_hour = hour;
3619 mytm.tm_mday = mday;
3621 mytm.tm_year = year;
3622 mytm.tm_wday = wday;
3623 mytm.tm_yday = yday;
3624 mytm.tm_isdst = isdst;
3626 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3627 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3632 #ifdef HAS_TM_TM_GMTOFF
3633 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3635 #ifdef HAS_TM_TM_ZONE
3636 mytm.tm_zone = mytm2.tm_zone;
3641 New(0, buf, buflen, char);
3642 len = strftime(buf, buflen, fmt, &mytm);
3644 ** The following is needed to handle to the situation where
3645 ** tmpbuf overflows. Basically we want to allocate a buffer
3646 ** and try repeatedly. The reason why it is so complicated
3647 ** is that getting a return value of 0 from strftime can indicate
3648 ** one of the following:
3649 ** 1. buffer overflowed,
3650 ** 2. illegal conversion specifier, or
3651 ** 3. the format string specifies nothing to be returned(not
3652 ** an error). This could be because format is an empty string
3653 ** or it specifies %p that yields an empty string in some locale.
3654 ** If there is a better way to make it portable, go ahead by
3657 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3660 /* Possibly buf overflowed - try again with a bigger buf */
3661 const int fmtlen = strlen(fmt);
3662 const int bufsize = fmtlen + buflen;
3664 New(0, buf, bufsize, char);
3666 buflen = strftime(buf, bufsize, fmt, &mytm);
3667 if (buflen > 0 && buflen < bufsize)
3669 /* heuristic to prevent out-of-memory errors */
3670 if (bufsize > 100*fmtlen) {
3675 Renew(buf, bufsize*2, char);
3680 Perl_croak(aTHX_ "panic: no strftime");
3686 #define SV_CWD_RETURN_UNDEF \
3687 sv_setsv(sv, &PL_sv_undef); \
3690 #define SV_CWD_ISDOT(dp) \
3691 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3692 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3695 =head1 Miscellaneous Functions
3697 =for apidoc getcwd_sv
3699 Fill the sv with current working directory
3704 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3705 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3706 * getcwd(3) if available
3707 * Comments from the orignal:
3708 * This is a faster version of getcwd. It's also more dangerous
3709 * because you might chdir out of a directory that you can't chdir
3713 Perl_getcwd_sv(pTHX_ register SV *sv)
3717 #ifndef INCOMPLETE_TAINTS
3723 char buf[MAXPATHLEN];
3725 /* Some getcwd()s automatically allocate a buffer of the given
3726 * size from the heap if they are given a NULL buffer pointer.
3727 * The problem is that this behaviour is not portable. */
3728 if (getcwd(buf, sizeof(buf) - 1)) {
3729 sv_setpvn(sv, buf, strlen(buf));
3733 sv_setsv(sv, &PL_sv_undef);
3741 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3745 SvUPGRADE(sv, SVt_PV);
3747 if (PerlLIO_lstat(".", &statbuf) < 0) {
3748 SV_CWD_RETURN_UNDEF;
3751 orig_cdev = statbuf.st_dev;
3752 orig_cino = statbuf.st_ino;
3761 if (PerlDir_chdir("..") < 0) {
3762 SV_CWD_RETURN_UNDEF;
3764 if (PerlLIO_stat(".", &statbuf) < 0) {
3765 SV_CWD_RETURN_UNDEF;
3768 cdev = statbuf.st_dev;
3769 cino = statbuf.st_ino;
3771 if (odev == cdev && oino == cino) {
3774 if (!(dir = PerlDir_open("."))) {
3775 SV_CWD_RETURN_UNDEF;
3778 while ((dp = PerlDir_read(dir)) != NULL) {
3780 const int namelen = dp->d_namlen;
3782 const int namelen = strlen(dp->d_name);
3785 if (SV_CWD_ISDOT(dp)) {
3789 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3790 SV_CWD_RETURN_UNDEF;
3793 tdev = statbuf.st_dev;
3794 tino = statbuf.st_ino;
3795 if (tino == oino && tdev == odev) {
3801 SV_CWD_RETURN_UNDEF;
3804 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3805 SV_CWD_RETURN_UNDEF;
3808 SvGROW(sv, pathlen + namelen + 1);
3812 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3815 /* prepend current directory to the front */
3817 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3818 pathlen += (namelen + 1);
3820 #ifdef VOID_CLOSEDIR
3823 if (PerlDir_close(dir) < 0) {
3824 SV_CWD_RETURN_UNDEF;
3830 SvCUR_set(sv, pathlen);
3834 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3835 SV_CWD_RETURN_UNDEF;
3838 if (PerlLIO_stat(".", &statbuf) < 0) {
3839 SV_CWD_RETURN_UNDEF;
3842 cdev = statbuf.st_dev;
3843 cino = statbuf.st_ino;
3845 if (cdev != orig_cdev || cino != orig_cino) {
3846 Perl_croak(aTHX_ "Unstable directory path, "
3847 "current directory changed unexpectedly");
3859 =for apidoc scan_version
3861 Returns a pointer to the next character after the parsed
3862 version string, as well as upgrading the passed in SV to
3865 Function must be called with an already existing SV like
3868 s = scan_version(s,SV *sv, bool qv);
3870 Performs some preprocessing to the string to ensure that
3871 it has the correct characteristics of a version. Flags the
3872 object if it contains an underscore (which denotes this
3873 is a alpha version). The boolean qv denotes that the version
3874 should be interpreted as if it had multiple decimals, even if
3881 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3883 const char *start = s;
3890 SV* hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3891 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3892 #ifndef NODEFAULT_SHAREKEYS
3893 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3897 s++; /* get past 'v' */
3898 qv = 1; /* force quoted version processing */
3903 /* pre-scan the input string to check for decimals/underbars */
3904 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3909 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3913 else if ( *pos == '_' )
3916 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3918 width = pos - last - 1; /* natural width of sub-version */
3923 if ( saw_period > 1 ) {
3924 qv = 1; /* force quoted version processing */
3930 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
3932 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
3934 if ( !qv && width < 3 )
3935 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3937 while (isDIGIT(*pos))
3939 if (!isALPHA(*pos)) {
3945 /* this is atoi() that delimits on underscores */
3946 const char *end = pos;
3950 /* the following if() will only be true after the decimal
3951 * point of a version originally created with a bare
3952 * floating point number, i.e. not quoted in any way
3954 if ( !qv && s > start+1 && saw_period == 1 ) {
3958 rev += (*s - '0') * mult;
3960 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3961 Perl_croak(aTHX_ "Integer overflow in version");
3968 while (--end >= s) {
3970 rev += (*end - '0') * mult;
3972 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3973 Perl_croak(aTHX_ "Integer overflow in version");
3978 /* Append revision */
3979 av_push(av, newSViv(rev));
3980 if ( *pos == '.' && isDIGIT(pos[1]) )
3982 else if ( *pos == '_' && isDIGIT(pos[1]) )
3984 else if ( isDIGIT(*pos) )
3991 while ( isDIGIT(*pos) )
3996 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4004 if ( qv ) { /* quoted versions always get at least three terms*/
4005 I32 len = av_len(av);
4006 /* This for loop appears to trigger a compiler bug on OS X, as it
4007 loops infinitely. Yes, len is negative. No, it makes no sense.
4008 Compiler in question is:
4009 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4010 for ( len = 2 - len; len > 0; len-- )
4011 av_push((AV *)sv, newSViv(0));
4015 av_push(av, newSViv(0));
4018 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4019 av_push(av, newSViv(0));
4021 /* And finally, store the AV in the hash */
4022 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
4027 =for apidoc new_version
4029 Returns a new version object based on the passed in SV:
4031 SV *sv = new_version(SV *ver);
4033 Does not alter the passed in ver SV. See "upg_version" if you
4034 want to upgrade the SV.
4040 Perl_new_version(pTHX_ SV *ver)
4043 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4046 AV * const av = newAV();
4048 /* This will get reblessed later if a derived class*/
4049 SV* const hv = newSVrv(rv, "version");
4050 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4051 #ifndef NODEFAULT_SHAREKEYS
4052 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4058 /* Begin copying all of the elements */
4059 if ( hv_exists((HV *)ver, "qv", 2) )
4060 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4062 if ( hv_exists((HV *)ver, "alpha", 5) )
4063 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4065 if ( hv_exists((HV*)ver, "width", 5 ) )
4067 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4068 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4071 sav = (AV *)*hv_fetch((HV*)ver, "version", 7, FALSE);
4072 /* This will get reblessed later if a derived class*/
4073 for ( key = 0; key <= av_len(sav); key++ )
4075 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4076 av_push(av, newSViv(rev));
4079 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
4083 if ( SvVOK(ver) ) { /* already a v-string */
4085 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4086 const STRLEN len = mg->mg_len;
4087 version = savepvn( (const char*)mg->mg_ptr, len);
4088 sv_setpvn(rv,version,len);
4093 sv_setsv(rv,ver); /* make a duplicate */
4102 =for apidoc upg_version
4104 In-place upgrade of the supplied SV to a version object.
4106 SV *sv = upg_version(SV *sv);
4108 Returns a pointer to the upgraded SV.
4114 Perl_upg_version(pTHX_ SV *ver)
4119 if ( SvNOK(ver) ) /* may get too much accuracy */
4122 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4123 version = savepv(tbuf);
4126 else if ( SvVOK(ver) ) { /* already a v-string */
4127 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4128 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4132 else /* must be a string or something like a string */
4134 version = savepv(SvPV_nolen(ver));
4136 (void)scan_version(version, ver, qv);
4145 Accepts a version object and returns the normalized floating
4146 point representation. Call like:
4150 NOTE: you can pass either the object directly or the SV
4151 contained within the RV.
4157 Perl_vnumify(pTHX_ SV *vs)
4162 SV * const sv = newSV(0);
4167 /* see if various flags exist */
4168 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4170 if ( hv_exists((HV*)vs, "width", 5 ) )
4171 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4176 /* attempt to retrieve the version array */
4177 if ( !(av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE) ) ) {
4178 sv_catpvn(sv,"0",1);
4185 sv_catpvn(sv,"0",1);
4189 digit = SvIV(*av_fetch(av, 0, 0));
4190 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4191 for ( i = 1 ; i < len ; i++ )
4193 digit = SvIV(*av_fetch(av, i, 0));
4195 const int denom = (int)pow(10,(3-width));
4196 const div_t term = div((int)PERL_ABS(digit),denom);
4197 Perl_sv_catpvf(aTHX_ sv,"%0*d_%d", width, term.quot, term.rem);
4200 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4206 digit = SvIV(*av_fetch(av, len, 0));
4207 if ( alpha && width == 3 ) /* alpha version */
4208 Perl_sv_catpv(aTHX_ sv,"_");
4209 /* Don't display additional trailing zeros */
4211 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4215 sv_catpvn(sv,"000",3);
4223 Accepts a version object and returns the normalized string
4224 representation. Call like:
4228 NOTE: you can pass either the object directly or the SV
4229 contained within the RV.
4235 Perl_vnormal(pTHX_ SV *vs)
4244 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4246 av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE);
4253 digit = SvIV(*av_fetch(av, 0, 0));
4254 Perl_sv_setpvf(aTHX_ sv,"v%"IVdf,(IV)digit);
4255 for ( i = 1 ; i <= len-1 ; i++ ) {
4256 digit = SvIV(*av_fetch(av, i, 0));
4257 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4261 /* handle last digit specially */
4262 digit = SvIV(*av_fetch(av, len, 0));
4264 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4266 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4269 if ( len <= 2 ) { /* short version, must be at least three */
4270 for ( len = 2 - len; len != 0; len-- )
4271 sv_catpvn(sv,".0",2);
4278 =for apidoc vstringify
4280 In order to maintain maximum compatibility with earlier versions
4281 of Perl, this function will return either the floating point
4282 notation or the multiple dotted notation, depending on whether
4283 the original version contained 1 or more dots, respectively
4289 Perl_vstringify(pTHX_ SV *vs)
4295 if ( hv_exists((HV *)vs, "qv", 2) )
4307 Version object aware cmp. Both operands must already have been
4308 converted into version objects.
4314 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4317 bool lalpha = FALSE;
4318 bool ralpha = FALSE;
4327 /* get the left hand term */
4328 lav = (AV *)*hv_fetch((HV*)lhv, "version", 7, FALSE);
4329 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4332 /* and the right hand term */
4333 rav = (AV *)*hv_fetch((HV*)rhv, "version", 7, FALSE);
4334 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4342 while ( i <= m && retval == 0 )
4344 left = SvIV(*av_fetch(lav,i,0));
4345 right = SvIV(*av_fetch(rav,i,0));
4353 /* tiebreaker for alpha with identical terms */
4354 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4356 if ( lalpha && !ralpha )
4360 else if ( ralpha && !lalpha)
4366 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4370 while ( i <= r && retval == 0 )
4372 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4373 retval = -1; /* not a match after all */
4379 while ( i <= l && retval == 0 )
4381 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4382 retval = +1; /* not a match after all */
4390 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4391 # define EMULATE_SOCKETPAIR_UDP
4394 #ifdef EMULATE_SOCKETPAIR_UDP
4396 S_socketpair_udp (int fd[2]) {
4398 /* Fake a datagram socketpair using UDP to localhost. */
4399 int sockets[2] = {-1, -1};
4400 struct sockaddr_in addresses[2];
4402 Sock_size_t size = sizeof(struct sockaddr_in);
4403 unsigned short port;
4406 memset(&addresses, 0, sizeof(addresses));
4409 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4410 if (sockets[i] == -1)
4411 goto tidy_up_and_fail;
4413 addresses[i].sin_family = AF_INET;
4414 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4415 addresses[i].sin_port = 0; /* kernel choses port. */
4416 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4417 sizeof(struct sockaddr_in)) == -1)
4418 goto tidy_up_and_fail;
4421 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4422 for each connect the other socket to it. */
4425 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4427 goto tidy_up_and_fail;
4428 if (size != sizeof(struct sockaddr_in))
4429 goto abort_tidy_up_and_fail;
4430 /* !1 is 0, !0 is 1 */
4431 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4432 sizeof(struct sockaddr_in)) == -1)
4433 goto tidy_up_and_fail;
4436 /* Now we have 2 sockets connected to each other. I don't trust some other
4437 process not to have already sent a packet to us (by random) so send
4438 a packet from each to the other. */
4441 /* I'm going to send my own port number. As a short.
4442 (Who knows if someone somewhere has sin_port as a bitfield and needs
4443 this routine. (I'm assuming crays have socketpair)) */
4444 port = addresses[i].sin_port;
4445 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4446 if (got != sizeof(port)) {
4448 goto tidy_up_and_fail;
4449 goto abort_tidy_up_and_fail;
4453 /* Packets sent. I don't trust them to have arrived though.
4454 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4455 connect to localhost will use a second kernel thread. In 2.6 the
4456 first thread running the connect() returns before the second completes,
4457 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4458 returns 0. Poor programs have tripped up. One poor program's authors'
4459 had a 50-1 reverse stock split. Not sure how connected these were.)
4460 So I don't trust someone not to have an unpredictable UDP stack.
4464 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4465 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4469 FD_SET(sockets[0], &rset);
4470 FD_SET(sockets[1], &rset);
4472 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4473 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4474 || !FD_ISSET(sockets[1], &rset)) {
4475 /* I hope this is portable and appropriate. */
4477 goto tidy_up_and_fail;
4478 goto abort_tidy_up_and_fail;
4482 /* And the paranoia department even now doesn't trust it to have arrive
4483 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4485 struct sockaddr_in readfrom;
4486 unsigned short buffer[2];
4491 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4492 sizeof(buffer), MSG_DONTWAIT,
4493 (struct sockaddr *) &readfrom, &size);
4495 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4497 (struct sockaddr *) &readfrom, &size);
4501 goto tidy_up_and_fail;
4502 if (got != sizeof(port)
4503 || size != sizeof(struct sockaddr_in)
4504 /* Check other socket sent us its port. */
4505 || buffer[0] != (unsigned short) addresses[!i].sin_port
4506 /* Check kernel says we got the datagram from that socket */
4507 || readfrom.sin_family != addresses[!i].sin_family
4508 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4509 || readfrom.sin_port != addresses[!i].sin_port)
4510 goto abort_tidy_up_and_fail;
4513 /* My caller (my_socketpair) has validated that this is non-NULL */
4516 /* I hereby declare this connection open. May God bless all who cross
4520 abort_tidy_up_and_fail:
4521 errno = ECONNABORTED;
4524 const int save_errno = errno;
4525 if (sockets[0] != -1)
4526 PerlLIO_close(sockets[0]);
4527 if (sockets[1] != -1)
4528 PerlLIO_close(sockets[1]);
4533 #endif /* EMULATE_SOCKETPAIR_UDP */
4535 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4537 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4538 /* Stevens says that family must be AF_LOCAL, protocol 0.
4539 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4544 struct sockaddr_in listen_addr;
4545 struct sockaddr_in connect_addr;
4550 || family != AF_UNIX
4553 errno = EAFNOSUPPORT;
4561 #ifdef EMULATE_SOCKETPAIR_UDP
4562 if (type == SOCK_DGRAM)
4563 return S_socketpair_udp(fd);
4566 listener = PerlSock_socket(AF_INET, type, 0);
4569 memset(&listen_addr, 0, sizeof(listen_addr));
4570 listen_addr.sin_family = AF_INET;
4571 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4572 listen_addr.sin_port = 0; /* kernel choses port. */
4573 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4574 sizeof(listen_addr)) == -1)
4575 goto tidy_up_and_fail;
4576 if (PerlSock_listen(listener, 1) == -1)
4577 goto tidy_up_and_fail;
4579 connector = PerlSock_socket(AF_INET, type, 0);
4580 if (connector == -1)
4581 goto tidy_up_and_fail;
4582 /* We want to find out the port number to connect to. */
4583 size = sizeof(connect_addr);
4584 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4586 goto tidy_up_and_fail;
4587 if (size != sizeof(connect_addr))
4588 goto abort_tidy_up_and_fail;
4589 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4590 sizeof(connect_addr)) == -1)
4591 goto tidy_up_and_fail;
4593 size = sizeof(listen_addr);
4594 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4597 goto tidy_up_and_fail;
4598 if (size != sizeof(listen_addr))
4599 goto abort_tidy_up_and_fail;
4600 PerlLIO_close(listener);
4601 /* Now check we are talking to ourself by matching port and host on the
4603 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4605 goto tidy_up_and_fail;
4606 if (size != sizeof(connect_addr)
4607 || listen_addr.sin_family != connect_addr.sin_family
4608 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4609 || listen_addr.sin_port != connect_addr.sin_port) {
4610 goto abort_tidy_up_and_fail;
4616 abort_tidy_up_and_fail:
4618 errno = ECONNABORTED; /* This would be the standard thing to do. */
4620 # ifdef ECONNREFUSED
4621 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4623 errno = ETIMEDOUT; /* Desperation time. */
4628 int save_errno = errno;
4630 PerlLIO_close(listener);
4631 if (connector != -1)
4632 PerlLIO_close(connector);
4634 PerlLIO_close(acceptor);
4640 /* In any case have a stub so that there's code corresponding
4641 * to the my_socketpair in global.sym. */
4643 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4644 #ifdef HAS_SOCKETPAIR
4645 return socketpair(family, type, protocol, fd);
4654 =for apidoc sv_nosharing
4656 Dummy routine which "shares" an SV when there is no sharing module present.
4657 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4658 some level of strict-ness.
4664 Perl_sv_nosharing(pTHX_ SV *sv)
4666 PERL_UNUSED_ARG(sv);
4670 =for apidoc sv_nolocking
4672 Dummy routine which "locks" an SV when there is no locking module present.
4673 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4674 some level of strict-ness.
4680 Perl_sv_nolocking(pTHX_ SV *sv)
4682 PERL_UNUSED_ARG(sv);
4687 =for apidoc sv_nounlocking
4689 Dummy routine which "unlocks" an SV when there is no locking module present.
4690 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4691 some level of strict-ness.
4697 Perl_sv_nounlocking(pTHX_ SV *sv)
4699 PERL_UNUSED_ARG(sv);
4703 Perl_parse_unicode_opts(pTHX_ const char **popt)
4705 const char *p = *popt;
4710 opt = (U32) atoi(p);
4711 while (isDIGIT(*p)) p++;
4712 if (*p && *p != '\n' && *p != '\r')
4713 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4718 case PERL_UNICODE_STDIN:
4719 opt |= PERL_UNICODE_STDIN_FLAG; break;
4720 case PERL_UNICODE_STDOUT:
4721 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4722 case PERL_UNICODE_STDERR:
4723 opt |= PERL_UNICODE_STDERR_FLAG; break;
4724 case PERL_UNICODE_STD:
4725 opt |= PERL_UNICODE_STD_FLAG; break;
4726 case PERL_UNICODE_IN:
4727 opt |= PERL_UNICODE_IN_FLAG; break;
4728 case PERL_UNICODE_OUT:
4729 opt |= PERL_UNICODE_OUT_FLAG; break;
4730 case PERL_UNICODE_INOUT:
4731 opt |= PERL_UNICODE_INOUT_FLAG; break;
4732 case PERL_UNICODE_LOCALE:
4733 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4734 case PERL_UNICODE_ARGV:
4735 opt |= PERL_UNICODE_ARGV_FLAG; break;
4737 if (*p != '\n' && *p != '\r')
4739 "Unknown Unicode option letter '%c'", *p);
4745 opt = PERL_UNICODE_DEFAULT_FLAGS;
4747 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4748 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4749 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4760 * This is really just a quick hack which grabs various garbage
4761 * values. It really should be a real hash algorithm which
4762 * spreads the effect of every input bit onto every output bit,
4763 * if someone who knows about such things would bother to write it.
4764 * Might be a good idea to add that function to CORE as well.
4765 * No numbers below come from careful analysis or anything here,
4766 * except they are primes and SEED_C1 > 1E6 to get a full-width
4767 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4768 * probably be bigger too.
4771 # define SEED_C1 1000003
4772 #define SEED_C4 73819
4774 # define SEED_C1 25747
4775 #define SEED_C4 20639
4779 #define SEED_C5 26107
4781 #ifndef PERL_NO_DEV_RANDOM
4786 # include <starlet.h>
4787 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4788 * in 100-ns units, typically incremented ever 10 ms. */
4789 unsigned int when[2];
4791 # ifdef HAS_GETTIMEOFDAY
4792 struct timeval when;
4798 /* This test is an escape hatch, this symbol isn't set by Configure. */
4799 #ifndef PERL_NO_DEV_RANDOM
4800 #ifndef PERL_RANDOM_DEVICE
4801 /* /dev/random isn't used by default because reads from it will block
4802 * if there isn't enough entropy available. You can compile with
4803 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4804 * is enough real entropy to fill the seed. */
4805 # define PERL_RANDOM_DEVICE "/dev/urandom"
4807 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4809 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4818 _ckvmssts(sys$gettim(when));
4819 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4821 # ifdef HAS_GETTIMEOFDAY
4822 PerlProc_gettimeofday(&when,NULL);
4823 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4826 u = (U32)SEED_C1 * when;
4829 u += SEED_C3 * (U32)PerlProc_getpid();
4830 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4831 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4832 u += SEED_C5 * (U32)PTR2UV(&when);
4838 Perl_get_hash_seed(pTHX)
4840 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4844 while (isSPACE(*s)) s++;
4845 if (s && isDIGIT(*s))
4846 myseed = (UV)Atoul(s);
4848 #ifdef USE_HASH_SEED_EXPLICIT
4852 /* Compute a random seed */
4853 (void)seedDrand01((Rand_seed_t)seed());
4854 myseed = (UV)(Drand01() * (NV)UV_MAX);
4855 #if RANDBITS < (UVSIZE * 8)
4856 /* Since there are not enough randbits to to reach all
4857 * the bits of a UV, the low bits might need extra
4858 * help. Sum in another random number that will
4859 * fill in the low bits. */
4861 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4862 #endif /* RANDBITS < (UVSIZE * 8) */
4863 if (myseed == 0) { /* Superparanoia. */
4864 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4866 Perl_croak(aTHX_ "Your random numbers are not that random");
4869 PL_rehash_seed_set = TRUE;
4876 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4878 const char * const stashpv = CopSTASHPV(c);
4879 const char * const name = HvNAME_get(hv);
4881 if (stashpv == name)
4883 if (stashpv && name)
4884 if (strEQ(stashpv, name))
4891 #ifdef PERL_GLOBAL_STRUCT
4894 Perl_init_global_struct(pTHX)
4896 struct perl_vars *plvarsp = NULL;
4897 #ifdef PERL_GLOBAL_STRUCT
4898 # define PERL_GLOBAL_STRUCT_INIT
4899 # include "opcode.h" /* the ppaddr and check */
4900 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4901 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4902 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4903 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4904 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4908 plvarsp = PL_VarsPtr;
4909 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4915 # define PERLVAR(var,type) /**/
4916 # define PERLVARA(var,n,type) /**/
4917 # define PERLVARI(var,type,init) plvarsp->var = init;
4918 # define PERLVARIC(var,type,init) plvarsp->var = init;
4919 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4920 # include "perlvars.h"
4926 # ifdef PERL_GLOBAL_STRUCT
4927 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4928 if (!plvarsp->Gppaddr)
4930 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4931 if (!plvarsp->Gcheck)
4933 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4934 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4936 # ifdef PERL_SET_VARS
4937 PERL_SET_VARS(plvarsp);
4939 # undef PERL_GLOBAL_STRUCT_INIT
4944 #endif /* PERL_GLOBAL_STRUCT */
4946 #ifdef PERL_GLOBAL_STRUCT
4949 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4951 #ifdef PERL_GLOBAL_STRUCT
4952 # ifdef PERL_UNSET_VARS
4953 PERL_UNSET_VARS(plvarsp);
4955 free(plvarsp->Gppaddr);
4956 free(plvarsp->Gcheck);
4957 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4963 #endif /* PERL_GLOBAL_STRUCT */
4967 * c-indentation-style: bsd
4969 * indent-tabs-mode: t
4972 * ex: set ts=8 sts=4 sw=4 noet: