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++));
160 /* safe version of system's calloc() */
163 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
169 if (size * count > 0xffff) {
170 PerlIO_printf(Perl_error_log,
171 "Allocation too large: %lx\n", size * count) FLUSH;
174 #endif /* HAS_64K_LIMIT */
176 if ((long)size < 0 || (long)count < 0)
177 Perl_croak_nocontext("panic: calloc");
180 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
181 PERL_ALLOC_CHECK(ptr);
182 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));
184 memset((void*)ptr, 0, size);
190 /* Can't use PerlIO to write as it allocates memory */
191 PerlLIO_write(PerlIO_fileno(Perl_error_log),
192 PL_no_mem, strlen(PL_no_mem));
199 /* These must be defined when not using Perl's malloc for binary
204 Malloc_t Perl_malloc (MEM_SIZE nbytes)
207 return (Malloc_t)PerlMem_malloc(nbytes);
210 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
213 return (Malloc_t)PerlMem_calloc(elements, size);
216 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
219 return (Malloc_t)PerlMem_realloc(where, nbytes);
222 Free_t Perl_mfree (Malloc_t where)
230 /* copy a string up to some (non-backslashed) delimiter, if any */
233 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
236 for (tolen = 0; from < fromend; from++, tolen++) {
238 if (from[1] == delim)
247 else if (*from == delim)
258 /* return ptr to little string in big string, NULL if not found */
259 /* This routine was donated by Corey Satten. */
262 Perl_instr(pTHX_ register const char *big, register const char *little)
264 register const char *s, *x;
275 for (x=big,s=little; *s; /**/ ) {
284 return (char*)(big-1);
289 /* same as instr but allow embedded nulls */
292 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
294 register const char *s, *x;
295 register const I32 first = *little;
296 register const char *littleend = lend;
298 if (!first && little >= littleend)
300 if (bigend - big < littleend - little)
302 bigend -= littleend - little++;
303 while (big <= bigend) {
306 for (x=big,s=little; s < littleend; /**/ ) {
313 return (char*)(big-1);
318 /* reverse of the above--find last substring */
321 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
323 register const char *bigbeg;
324 register const char *s, *x;
325 register const I32 first = *little;
326 register const char *littleend = lend;
328 if (!first && little >= littleend)
329 return (char*)bigend;
331 big = bigend - (littleend - little++);
332 while (big >= bigbeg) {
335 for (x=big+2,s=little; s < littleend; /**/ ) {
342 return (char*)(big+1);
347 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
349 /* As a space optimization, we do not compile tables for strings of length
350 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
351 special-cased in fbm_instr().
353 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
356 =head1 Miscellaneous Functions
358 =for apidoc fbm_compile
360 Analyses the string in order to make fast searches on it using fbm_instr()
361 -- the Boyer-Moore algorithm.
367 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
369 const register U8 *s;
376 if (flags & FBMcf_TAIL) {
377 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
378 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
379 if (mg && mg->mg_len >= 0)
382 s = (U8*)SvPV_force_mutable(sv, len);
383 SvUPGRADE(sv, SVt_PVBM);
384 if (len == 0) /* TAIL might be on a zero-length string. */
388 const unsigned char *sb;
394 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
395 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
396 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
397 memset((void*)table, mlen, 256);
398 table[-1] = (U8)flags;
400 sb = s - mlen + 1; /* first char (maybe) */
402 if (table[*s] == mlen)
407 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
410 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
411 for (i = 0; i < len; i++) {
412 if (PL_freq[s[i]] < frequency) {
414 frequency = PL_freq[s[i]];
417 BmRARE(sv) = s[rarest];
418 BmPREVIOUS(sv) = (U16)rarest;
419 BmUSEFUL(sv) = 100; /* Initial value */
420 if (flags & FBMcf_TAIL)
422 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
423 BmRARE(sv),BmPREVIOUS(sv)));
426 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
427 /* If SvTAIL is actually due to \Z or \z, this gives false positives
431 =for apidoc fbm_instr
433 Returns the location of the SV in the string delimited by C<str> and
434 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
435 does not have to be fbm_compiled, but the search will not be as fast
442 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
444 register unsigned char *s;
446 register const unsigned char *little
447 = (const unsigned char *)SvPV_const(littlestr,l);
448 register STRLEN littlelen = l;
449 register const I32 multiline = flags & FBMrf_MULTILINE;
451 if ((STRLEN)(bigend - big) < littlelen) {
452 if ( SvTAIL(littlestr)
453 && ((STRLEN)(bigend - big) == littlelen - 1)
455 || (*big == *little &&
456 memEQ((char *)big, (char *)little, littlelen - 1))))
461 if (littlelen <= 2) { /* Special-cased */
463 if (littlelen == 1) {
464 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
465 /* Know that bigend != big. */
466 if (bigend[-1] == '\n')
467 return (char *)(bigend - 1);
468 return (char *) bigend;
476 if (SvTAIL(littlestr))
477 return (char *) bigend;
481 return (char*)big; /* Cannot be SvTAIL! */
484 if (SvTAIL(littlestr) && !multiline) {
485 if (bigend[-1] == '\n' && bigend[-2] == *little)
486 return (char*)bigend - 2;
487 if (bigend[-1] == *little)
488 return (char*)bigend - 1;
492 /* This should be better than FBM if c1 == c2, and almost
493 as good otherwise: maybe better since we do less indirection.
494 And we save a lot of memory by caching no table. */
495 register unsigned char c1 = little[0];
496 register unsigned char c2 = little[1];
501 while (s <= bigend) {
511 goto check_1char_anchor;
522 goto check_1char_anchor;
525 while (s <= bigend) {
530 goto check_1char_anchor;
539 check_1char_anchor: /* One char and anchor! */
540 if (SvTAIL(littlestr) && (*bigend == *little))
541 return (char *)bigend; /* bigend is already decremented. */
544 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
545 s = bigend - littlelen;
546 if (s >= big && bigend[-1] == '\n' && *s == *little
547 /* Automatically of length > 2 */
548 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
550 return (char*)s; /* how sweet it is */
553 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
555 return (char*)s + 1; /* how sweet it is */
559 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
560 char *b = ninstr((char*)big,(char*)bigend,
561 (char*)little, (char*)little + littlelen);
563 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
564 /* Chop \n from littlestr: */
565 s = bigend - littlelen + 1;
567 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
576 { /* Do actual FBM. */
577 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
578 const register unsigned char *oldlittle;
580 if (littlelen > (STRLEN)(bigend - big))
582 --littlelen; /* Last char found by table lookup */
585 little += littlelen; /* last char */
592 if ((tmp = table[*s])) {
593 if ((s += tmp) < bigend)
597 else { /* less expensive than calling strncmp() */
598 register unsigned char *olds = s;
603 if (*--s == *--little)
605 s = olds + 1; /* here we pay the price for failure */
607 if (s < bigend) /* fake up continue to outer loop */
615 if ( s == bigend && (table[-1] & FBMcf_TAIL)
616 && memEQ((char *)(bigend - littlelen),
617 (char *)(oldlittle - littlelen), littlelen) )
618 return (char*)bigend - littlelen;
623 /* start_shift, end_shift are positive quantities which give offsets
624 of ends of some substring of bigstr.
625 If "last" we want the last occurrence.
626 old_posp is the way of communication between consequent calls if
627 the next call needs to find the .
628 The initial *old_posp should be -1.
630 Note that we take into account SvTAIL, so one can get extra
631 optimizations if _ALL flag is set.
634 /* If SvTAIL is actually due to \Z or \z, this gives false positives
635 if PL_multiline. In fact if !PL_multiline the authoritative answer
636 is not supported yet. */
639 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
641 register unsigned char *s, *x;
642 register unsigned char *big;
644 register I32 previous;
646 register unsigned char *little;
647 register I32 stop_pos;
648 register unsigned char *littleend;
652 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
653 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
655 if ( BmRARE(littlestr) == '\n'
656 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
657 little = (unsigned char *)(SvPVX(littlestr));
658 littleend = little + SvCUR(littlestr);
665 little = (unsigned char *)(SvPVX(littlestr));
666 littleend = little + SvCUR(littlestr);
668 /* The value of pos we can start at: */
669 previous = BmPREVIOUS(littlestr);
670 big = (unsigned char *)(SvPVX(bigstr));
671 /* The value of pos we can stop at: */
672 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
673 if (previous + start_shift > stop_pos) {
675 stop_pos does not include SvTAIL in the count, so this check is incorrect
676 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
679 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
684 while (pos < previous + start_shift) {
685 if (!(pos += PL_screamnext[pos]))
690 if (pos >= stop_pos) break;
691 if (big[pos] != first)
693 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
699 if (s == littleend) {
701 if (!last) return (char *)(big+pos);
704 } while ( pos += PL_screamnext[pos] );
706 return (char *)(big+(*old_posp));
708 if (!SvTAIL(littlestr) || (end_shift > 0))
710 /* Ignore the trailing "\n". This code is not microoptimized */
711 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
712 stop_pos = littleend - little; /* Actual littlestr len */
717 && ((stop_pos == 1) ||
718 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
724 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
726 register const U8 *a = (const U8 *)s1;
727 register const U8 *b = (const U8 *)s2;
729 if (*a != *b && *a != PL_fold[*b])
737 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
740 register const U8 *a = (const U8 *)s1;
741 register const U8 *b = (const U8 *)s2;
743 if (*a != *b && *a != PL_fold_locale[*b])
750 /* copy a string to a safe spot */
753 =head1 Memory Management
757 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
758 string which is a duplicate of C<pv>. The size of the string is
759 determined by C<strlen()>. The memory allocated for the new string can
760 be freed with the C<Safefree()> function.
766 Perl_savepv(pTHX_ const char *pv)
768 register char *newaddr;
769 #ifdef PERL_MALLOC_WRAP
775 #ifdef PERL_MALLOC_WRAP
776 pvlen = strlen(pv)+1;
777 New(902,newaddr,pvlen,char);
779 New(902,newaddr,strlen(pv)+1,char);
781 return strcpy(newaddr,pv);
784 /* same thing but with a known length */
789 Perl's version of what C<strndup()> would be if it existed. Returns a
790 pointer to a newly allocated string which is a duplicate of the first
791 C<len> bytes from C<pv>. The memory allocated for the new string can be
792 freed with the C<Safefree()> function.
798 Perl_savepvn(pTHX_ const char *pv, register I32 len)
800 register char *newaddr;
802 New(903,newaddr,len+1,char);
803 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
805 /* might not be null terminated */
807 return (char *) CopyD(pv,newaddr,len,char);
810 return (char *) ZeroD(newaddr,len+1,char);
815 =for apidoc savesharedpv
817 A version of C<savepv()> which allocates the duplicate string in memory
818 which is shared between threads.
823 Perl_savesharedpv(pTHX_ const char *pv)
825 register char *newaddr;
829 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
831 PerlLIO_write(PerlIO_fileno(Perl_error_log),
832 PL_no_mem, strlen(PL_no_mem));
835 return strcpy(newaddr,pv);
841 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
842 the passed in SV using C<SvPV()>
848 Perl_savesvpv(pTHX_ SV *sv)
851 const char *pv = SvPV(sv, len);
852 register char *newaddr;
855 New(903,newaddr,len,char);
856 return (char *) CopyD(pv,newaddr,len,char);
860 /* the SV for Perl_form() and mess() is not kept in an arena */
869 return sv_2mortal(newSVpvn("",0));
874 /* Create as PVMG now, to avoid any upgrading later */
876 Newz(905, any, 1, XPVMG);
877 SvFLAGS(sv) = SVt_PVMG;
878 SvANY(sv) = (void*)any;
880 SvREFCNT(sv) = 1 << 30; /* practically infinite */
885 #if defined(PERL_IMPLICIT_CONTEXT)
887 Perl_form_nocontext(const char* pat, ...)
893 retval = vform(pat, &args);
897 #endif /* PERL_IMPLICIT_CONTEXT */
900 =head1 Miscellaneous Functions
903 Takes a sprintf-style format pattern and conventional
904 (non-SV) arguments and returns the formatted string.
906 (char *) Perl_form(pTHX_ const char* pat, ...)
908 can be used any place a string (char *) is required:
910 char * s = Perl_form("%d.%d",major,minor);
912 Uses a single private buffer so if you want to format several strings you
913 must explicitly copy the earlier strings away (and free the copies when you
920 Perl_form(pTHX_ const char* pat, ...)
925 retval = vform(pat, &args);
931 Perl_vform(pTHX_ const char *pat, va_list *args)
933 SV *sv = mess_alloc();
934 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
938 #if defined(PERL_IMPLICIT_CONTEXT)
940 Perl_mess_nocontext(const char *pat, ...)
946 retval = vmess(pat, &args);
950 #endif /* PERL_IMPLICIT_CONTEXT */
953 Perl_mess(pTHX_ const char *pat, ...)
958 retval = vmess(pat, &args);
964 S_closest_cop(pTHX_ COP *cop, OP *o)
966 /* Look for PL_op starting from o. cop is the last COP we've seen. */
968 if (!o || o == PL_op) return cop;
970 if (o->op_flags & OPf_KIDS) {
972 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
976 /* If the OP_NEXTSTATE has been optimised away we can still use it
977 * the get the file and line number. */
979 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
982 /* Keep searching, and return when we've found something. */
984 new_cop = closest_cop(cop, kid);
985 if (new_cop) return new_cop;
995 Perl_vmess(pTHX_ const char *pat, va_list *args)
997 SV *sv = mess_alloc();
998 static const char dgd[] = " during global destruction.\n";
1000 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1001 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1004 * Try and find the file and line for PL_op. This will usually be
1005 * PL_curcop, but it might be a cop that has been optimised away. We
1006 * can try to find such a cop by searching through the optree starting
1007 * from the sibling of PL_curcop.
1010 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1011 if (!cop) cop = PL_curcop;
1014 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1015 OutCopFILE(cop), (IV)CopLINE(cop));
1016 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1017 const bool line_mode = (RsSIMPLE(PL_rs) &&
1018 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1019 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1020 PL_last_in_gv == PL_argvgv ?
1021 "" : GvNAME(PL_last_in_gv),
1022 line_mode ? "line" : "chunk",
1023 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1025 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1031 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1037 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1038 && (io = GvIO(PL_stderrgv))
1039 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1046 SAVESPTR(PL_stderrgv);
1047 PL_stderrgv = Nullgv;
1049 PUSHSTACKi(PERLSI_MAGIC);
1053 PUSHs(SvTIED_obj((SV*)io, mg));
1054 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1056 call_method("PRINT", G_SCALAR);
1064 /* SFIO can really mess with your errno */
1067 PerlIO *serr = Perl_error_log;
1069 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1070 (void)PerlIO_flush(serr);
1077 /* Common code used by vcroak, vdie and vwarner */
1079 void S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8);
1082 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1089 SV *msv = vmess(pat, args);
1090 if (PL_errors && SvCUR(PL_errors)) {
1091 sv_catsv(PL_errors, msv);
1092 message = SvPV(PL_errors, *msglen);
1093 SvCUR_set(PL_errors, 0);
1096 message = SvPV(msv,*msglen);
1097 *utf8 = SvUTF8(msv);
1103 DEBUG_S(PerlIO_printf(Perl_debug_log,
1104 "%p: die/croak: message = %s\ndiehook = %p\n",
1105 thr, message, PL_diehook));
1107 S_vdie_common(aTHX_ message, *msglen, *utf8);
1113 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1118 /* sv_2cv might call Perl_croak() */
1119 SV *olddiehook = PL_diehook;
1123 SAVESPTR(PL_diehook);
1124 PL_diehook = Nullsv;
1125 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1127 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1134 msg = newSVpvn(message, msglen);
1135 SvFLAGS(msg) |= utf8;
1143 PUSHSTACKi(PERLSI_DIEHOOK);
1147 call_sv((SV*)cv, G_DISCARD);
1154 Perl_vdie(pTHX_ const char* pat, va_list *args)
1156 const char *message;
1157 const int was_in_eval = PL_in_eval;
1161 DEBUG_S(PerlIO_printf(Perl_debug_log,
1162 "%p: die: curstack = %p, mainstack = %p\n",
1163 thr, PL_curstack, PL_mainstack));
1165 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1167 PL_restartop = die_where(message, msglen);
1168 SvFLAGS(ERRSV) |= utf8;
1169 DEBUG_S(PerlIO_printf(Perl_debug_log,
1170 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1171 thr, PL_restartop, was_in_eval, PL_top_env));
1172 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1174 return PL_restartop;
1177 #if defined(PERL_IMPLICIT_CONTEXT)
1179 Perl_die_nocontext(const char* pat, ...)
1184 va_start(args, pat);
1185 o = vdie(pat, &args);
1189 #endif /* PERL_IMPLICIT_CONTEXT */
1192 Perl_die(pTHX_ const char* pat, ...)
1196 va_start(args, pat);
1197 o = vdie(pat, &args);
1203 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1205 const char *message;
1209 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1212 PL_restartop = die_where(message, msglen);
1213 SvFLAGS(ERRSV) |= utf8;
1217 message = SvPVx(ERRSV, msglen);
1219 write_to_stderr(message, msglen);
1223 #if defined(PERL_IMPLICIT_CONTEXT)
1225 Perl_croak_nocontext(const char *pat, ...)
1229 va_start(args, pat);
1234 #endif /* PERL_IMPLICIT_CONTEXT */
1237 =head1 Warning and Dieing
1241 This is the XSUB-writer's interface to Perl's C<die> function.
1242 Normally call this function the same way you call the C C<printf>
1243 function. Calling C<croak> returns control directly to Perl,
1244 sidestepping the normal C order of execution. See C<warn>.
1246 If you want to throw an exception object, assign the object to
1247 C<$@> and then pass C<Nullch> to croak():
1249 errsv = get_sv("@", TRUE);
1250 sv_setsv(errsv, exception_object);
1257 Perl_croak(pTHX_ const char *pat, ...)
1260 va_start(args, pat);
1267 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1278 msv = vmess(pat, args);
1280 message = SvPV(msv, msglen);
1283 /* sv_2cv might call Perl_warn() */
1284 SV *oldwarnhook = PL_warnhook;
1286 SAVESPTR(PL_warnhook);
1287 PL_warnhook = Nullsv;
1288 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1290 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1296 msg = newSVpvn(message, msglen);
1297 SvFLAGS(msg) |= utf8;
1301 PUSHSTACKi(PERLSI_WARNHOOK);
1305 call_sv((SV*)cv, G_DISCARD);
1312 write_to_stderr(message, msglen);
1315 #if defined(PERL_IMPLICIT_CONTEXT)
1317 Perl_warn_nocontext(const char *pat, ...)
1321 va_start(args, pat);
1325 #endif /* PERL_IMPLICIT_CONTEXT */
1330 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1331 function the same way you call the C C<printf> function. See C<croak>.
1337 Perl_warn(pTHX_ const char *pat, ...)
1340 va_start(args, pat);
1345 #if defined(PERL_IMPLICIT_CONTEXT)
1347 Perl_warner_nocontext(U32 err, const char *pat, ...)
1351 va_start(args, pat);
1352 vwarner(err, pat, &args);
1355 #endif /* PERL_IMPLICIT_CONTEXT */
1358 Perl_warner(pTHX_ U32 err, const char* pat,...)
1361 va_start(args, pat);
1362 vwarner(err, pat, &args);
1367 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1371 SV * const msv = vmess(pat, args);
1373 const char *message = SvPV(msv, msglen);
1374 const I32 utf8 = SvUTF8(msv);
1378 S_vdie_common(aTHX_ message, msglen, utf8);
1381 PL_restartop = die_where(message, msglen);
1382 SvFLAGS(ERRSV) |= utf8;
1385 write_to_stderr(message, msglen);
1389 Perl_vwarn(aTHX_ pat, args);
1393 /* since we've already done strlen() for both nam and val
1394 * we can use that info to make things faster than
1395 * sprintf(s, "%s=%s", nam, val)
1397 #define my_setenv_format(s, nam, nlen, val, vlen) \
1398 Copy(nam, s, nlen, char); \
1400 Copy(val, s+(nlen+1), vlen, char); \
1401 *(s+(nlen+1+vlen)) = '\0'
1403 #ifdef USE_ENVIRON_ARRAY
1404 /* VMS' my_setenv() is in vms.c */
1405 #if !defined(WIN32) && !defined(NETWARE)
1407 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1411 /* only parent thread can modify process environment */
1412 if (PL_curinterp == aTHX)
1415 #ifndef PERL_USE_SAFE_PUTENV
1416 if (!PL_use_safe_putenv) {
1417 /* most putenv()s leak, so we manipulate environ directly */
1418 register I32 i=setenv_getix(nam); /* where does it go? */
1421 if (environ == PL_origenviron) { /* need we copy environment? */
1427 for (max = i; environ[max]; max++) ;
1428 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1429 for (j=0; j<max; j++) { /* copy environment */
1430 const int len = strlen(environ[j]);
1431 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1432 Copy(environ[j], tmpenv[j], len+1, char);
1434 tmpenv[max] = Nullch;
1435 environ = tmpenv; /* tell exec where it is now */
1438 safesysfree(environ[i]);
1439 while (environ[i]) {
1440 environ[i] = environ[i+1];
1445 if (!environ[i]) { /* does not exist yet */
1446 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1447 environ[i+1] = Nullch; /* make sure it's null terminated */
1450 safesysfree(environ[i]);
1454 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1455 /* all that work just for this */
1456 my_setenv_format(environ[i], nam, nlen, val, vlen);
1459 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1460 setenv(nam, val, 1);
1463 int nlen = strlen(nam), vlen;
1468 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1469 /* all that work just for this */
1470 my_setenv_format(new_env, nam, nlen, val, vlen);
1471 (void)putenv(new_env);
1472 # endif /* __CYGWIN__ */
1473 #ifndef PERL_USE_SAFE_PUTENV
1479 #else /* WIN32 || NETWARE */
1482 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1485 register char *envstr;
1486 const int nlen = strlen(nam);
1493 New(904, envstr, nlen+vlen+2, char);
1494 my_setenv_format(envstr, nam, nlen, val, vlen);
1495 (void)PerlEnv_putenv(envstr);
1499 #endif /* WIN32 || NETWARE */
1503 Perl_setenv_getix(pTHX_ const char *nam)
1505 register I32 i, len = strlen(nam);
1507 for (i = 0; environ[i]; i++) {
1510 strnicmp(environ[i],nam,len) == 0
1512 strnEQ(environ[i],nam,len)
1514 && environ[i][len] == '=')
1515 break; /* strnEQ must come first to avoid */
1516 } /* potential SEGV's */
1519 #endif /* !PERL_MICRO */
1521 #endif /* !VMS && !EPOC*/
1523 #ifdef UNLINK_ALL_VERSIONS
1525 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1529 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1534 /* this is a drop-in replacement for bcopy() */
1535 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1537 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1541 if (from - to >= 0) {
1549 *(--to) = *(--from);
1555 /* this is a drop-in replacement for memset() */
1558 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1568 /* this is a drop-in replacement for bzero() */
1569 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1571 Perl_my_bzero(register char *loc, register I32 len)
1581 /* this is a drop-in replacement for memcmp() */
1582 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1584 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1586 register const U8 *a = (const U8 *)s1;
1587 register const U8 *b = (const U8 *)s2;
1591 if ((tmp = *a++ - *b++))
1596 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1600 #ifdef USE_CHAR_VSPRINTF
1605 vsprintf(char *dest, const char *pat, char *args)
1609 fakebuf._ptr = dest;
1610 fakebuf._cnt = 32767;
1614 fakebuf._flag = _IOWRT|_IOSTRG;
1615 _doprnt(pat, args, &fakebuf); /* what a kludge */
1616 (void)putc('\0', &fakebuf);
1617 #ifdef USE_CHAR_VSPRINTF
1620 return 0; /* perl doesn't use return value */
1624 #endif /* HAS_VPRINTF */
1627 #if BYTEORDER != 0x4321
1629 Perl_my_swap(pTHX_ short s)
1631 #if (BYTEORDER & 1) == 0
1634 result = ((s & 255) << 8) + ((s >> 8) & 255);
1642 Perl_my_htonl(pTHX_ long l)
1646 char c[sizeof(long)];
1649 #if BYTEORDER == 0x1234
1650 u.c[0] = (l >> 24) & 255;
1651 u.c[1] = (l >> 16) & 255;
1652 u.c[2] = (l >> 8) & 255;
1656 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1657 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1662 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1663 u.c[o & 0xf] = (l >> s) & 255;
1671 Perl_my_ntohl(pTHX_ long l)
1675 char c[sizeof(long)];
1678 #if BYTEORDER == 0x1234
1679 u.c[0] = (l >> 24) & 255;
1680 u.c[1] = (l >> 16) & 255;
1681 u.c[2] = (l >> 8) & 255;
1685 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1686 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1693 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1694 l |= (u.c[o & 0xf] & 255) << s;
1701 #endif /* BYTEORDER != 0x4321 */
1705 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1706 * If these functions are defined,
1707 * the BYTEORDER is neither 0x1234 nor 0x4321.
1708 * However, this is not assumed.
1712 #define HTOLE(name,type) \
1714 name (register type n) \
1718 char c[sizeof(type)]; \
1721 register I32 s = 0; \
1722 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1723 u.c[i] = (n >> s) & 0xFF; \
1728 #define LETOH(name,type) \
1730 name (register type n) \
1734 char c[sizeof(type)]; \
1737 register I32 s = 0; \
1740 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1741 n |= ((type)(u.c[i] & 0xFF)) << s; \
1747 * Big-endian byte order functions.
1750 #define HTOBE(name,type) \
1752 name (register type n) \
1756 char c[sizeof(type)]; \
1759 register I32 s = 8*(sizeof(u.c)-1); \
1760 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1761 u.c[i] = (n >> s) & 0xFF; \
1766 #define BETOH(name,type) \
1768 name (register type n) \
1772 char c[sizeof(type)]; \
1775 register I32 s = 8*(sizeof(u.c)-1); \
1778 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1779 n |= ((type)(u.c[i] & 0xFF)) << s; \
1785 * If we just can't do it...
1788 #define NOT_AVAIL(name,type) \
1790 name (register type n) \
1792 Perl_croak_nocontext(#name "() not available"); \
1793 return n; /* not reached */ \
1797 #if defined(HAS_HTOVS) && !defined(htovs)
1800 #if defined(HAS_HTOVL) && !defined(htovl)
1803 #if defined(HAS_VTOHS) && !defined(vtohs)
1806 #if defined(HAS_VTOHL) && !defined(vtohl)
1810 #ifdef PERL_NEED_MY_HTOLE16
1812 HTOLE(Perl_my_htole16,U16)
1814 NOT_AVAIL(Perl_my_htole16,U16)
1817 #ifdef PERL_NEED_MY_LETOH16
1819 LETOH(Perl_my_letoh16,U16)
1821 NOT_AVAIL(Perl_my_letoh16,U16)
1824 #ifdef PERL_NEED_MY_HTOBE16
1826 HTOBE(Perl_my_htobe16,U16)
1828 NOT_AVAIL(Perl_my_htobe16,U16)
1831 #ifdef PERL_NEED_MY_BETOH16
1833 BETOH(Perl_my_betoh16,U16)
1835 NOT_AVAIL(Perl_my_betoh16,U16)
1839 #ifdef PERL_NEED_MY_HTOLE32
1841 HTOLE(Perl_my_htole32,U32)
1843 NOT_AVAIL(Perl_my_htole32,U32)
1846 #ifdef PERL_NEED_MY_LETOH32
1848 LETOH(Perl_my_letoh32,U32)
1850 NOT_AVAIL(Perl_my_letoh32,U32)
1853 #ifdef PERL_NEED_MY_HTOBE32
1855 HTOBE(Perl_my_htobe32,U32)
1857 NOT_AVAIL(Perl_my_htobe32,U32)
1860 #ifdef PERL_NEED_MY_BETOH32
1862 BETOH(Perl_my_betoh32,U32)
1864 NOT_AVAIL(Perl_my_betoh32,U32)
1868 #ifdef PERL_NEED_MY_HTOLE64
1870 HTOLE(Perl_my_htole64,U64)
1872 NOT_AVAIL(Perl_my_htole64,U64)
1875 #ifdef PERL_NEED_MY_LETOH64
1877 LETOH(Perl_my_letoh64,U64)
1879 NOT_AVAIL(Perl_my_letoh64,U64)
1882 #ifdef PERL_NEED_MY_HTOBE64
1884 HTOBE(Perl_my_htobe64,U64)
1886 NOT_AVAIL(Perl_my_htobe64,U64)
1889 #ifdef PERL_NEED_MY_BETOH64
1891 BETOH(Perl_my_betoh64,U64)
1893 NOT_AVAIL(Perl_my_betoh64,U64)
1897 #ifdef PERL_NEED_MY_HTOLES
1898 HTOLE(Perl_my_htoles,short)
1900 #ifdef PERL_NEED_MY_LETOHS
1901 LETOH(Perl_my_letohs,short)
1903 #ifdef PERL_NEED_MY_HTOBES
1904 HTOBE(Perl_my_htobes,short)
1906 #ifdef PERL_NEED_MY_BETOHS
1907 BETOH(Perl_my_betohs,short)
1910 #ifdef PERL_NEED_MY_HTOLEI
1911 HTOLE(Perl_my_htolei,int)
1913 #ifdef PERL_NEED_MY_LETOHI
1914 LETOH(Perl_my_letohi,int)
1916 #ifdef PERL_NEED_MY_HTOBEI
1917 HTOBE(Perl_my_htobei,int)
1919 #ifdef PERL_NEED_MY_BETOHI
1920 BETOH(Perl_my_betohi,int)
1923 #ifdef PERL_NEED_MY_HTOLEL
1924 HTOLE(Perl_my_htolel,long)
1926 #ifdef PERL_NEED_MY_LETOHL
1927 LETOH(Perl_my_letohl,long)
1929 #ifdef PERL_NEED_MY_HTOBEL
1930 HTOBE(Perl_my_htobel,long)
1932 #ifdef PERL_NEED_MY_BETOHL
1933 BETOH(Perl_my_betohl,long)
1937 Perl_my_swabn(void *ptr, int n)
1939 register char *s = (char *)ptr;
1940 register char *e = s + (n-1);
1943 for (n /= 2; n > 0; s++, e--, n--) {
1951 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1953 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1955 register I32 This, that;
1961 PERL_FLUSHALL_FOR_CHILD;
1962 This = (*mode == 'w');
1966 taint_proper("Insecure %s%s", "EXEC");
1968 if (PerlProc_pipe(p) < 0)
1970 /* Try for another pipe pair for error return */
1971 if (PerlProc_pipe(pp) >= 0)
1973 while ((pid = PerlProc_fork()) < 0) {
1974 if (errno != EAGAIN) {
1975 PerlLIO_close(p[This]);
1976 PerlLIO_close(p[that]);
1978 PerlLIO_close(pp[0]);
1979 PerlLIO_close(pp[1]);
1991 /* Close parent's end of error status pipe (if any) */
1993 PerlLIO_close(pp[0]);
1994 #if defined(HAS_FCNTL) && defined(F_SETFD)
1995 /* Close error pipe automatically if exec works */
1996 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1999 /* Now dup our end of _the_ pipe to right position */
2000 if (p[THIS] != (*mode == 'r')) {
2001 PerlLIO_dup2(p[THIS], *mode == 'r');
2002 PerlLIO_close(p[THIS]);
2003 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2004 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2007 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2008 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2009 /* No automatic close - do it by hand */
2016 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2022 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2028 do_execfree(); /* free any memory malloced by child on fork */
2030 PerlLIO_close(pp[1]);
2031 /* Keep the lower of the two fd numbers */
2032 if (p[that] < p[This]) {
2033 PerlLIO_dup2(p[This], p[that]);
2034 PerlLIO_close(p[This]);
2038 PerlLIO_close(p[that]); /* close child's end of pipe */
2041 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2043 SvUPGRADE(sv,SVt_IV);
2045 PL_forkprocess = pid;
2046 /* If we managed to get status pipe check for exec fail */
2047 if (did_pipes && pid > 0) {
2051 while (n < sizeof(int)) {
2052 n1 = PerlLIO_read(pp[0],
2053 (void*)(((char*)&errkid)+n),
2059 PerlLIO_close(pp[0]);
2061 if (n) { /* Error */
2063 PerlLIO_close(p[This]);
2064 if (n != sizeof(int))
2065 Perl_croak(aTHX_ "panic: kid popen errno read");
2067 pid2 = wait4pid(pid, &status, 0);
2068 } while (pid2 == -1 && errno == EINTR);
2069 errno = errkid; /* Propagate errno from kid */
2074 PerlLIO_close(pp[0]);
2075 return PerlIO_fdopen(p[This], mode);
2077 Perl_croak(aTHX_ "List form of piped open not implemented");
2078 return (PerlIO *) NULL;
2082 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2083 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2085 Perl_my_popen(pTHX_ char *cmd, char *mode)
2088 register I32 This, that;
2091 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2095 PERL_FLUSHALL_FOR_CHILD;
2098 return my_syspopen(aTHX_ cmd,mode);
2101 This = (*mode == 'w');
2103 if (doexec && PL_tainting) {
2105 taint_proper("Insecure %s%s", "EXEC");
2107 if (PerlProc_pipe(p) < 0)
2109 if (doexec && PerlProc_pipe(pp) >= 0)
2111 while ((pid = PerlProc_fork()) < 0) {
2112 if (errno != EAGAIN) {
2113 PerlLIO_close(p[This]);
2114 PerlLIO_close(p[that]);
2116 PerlLIO_close(pp[0]);
2117 PerlLIO_close(pp[1]);
2120 Perl_croak(aTHX_ "Can't fork");
2133 PerlLIO_close(pp[0]);
2134 #if defined(HAS_FCNTL) && defined(F_SETFD)
2135 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2138 if (p[THIS] != (*mode == 'r')) {
2139 PerlLIO_dup2(p[THIS], *mode == 'r');
2140 PerlLIO_close(p[THIS]);
2141 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2142 PerlLIO_close(p[THAT]);
2145 PerlLIO_close(p[THAT]);
2148 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2155 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2160 /* may or may not use the shell */
2161 do_exec3(cmd, pp[1], did_pipes);
2164 #endif /* defined OS2 */
2166 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2167 SvREADONLY_off(GvSV(tmpgv));
2168 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2169 SvREADONLY_on(GvSV(tmpgv));
2171 #ifdef THREADS_HAVE_PIDS
2172 PL_ppid = (IV)getppid();
2175 hv_clear(PL_pidstatus); /* we have no children */
2180 do_execfree(); /* free any memory malloced by child on vfork */
2182 PerlLIO_close(pp[1]);
2183 if (p[that] < p[This]) {
2184 PerlLIO_dup2(p[This], p[that]);
2185 PerlLIO_close(p[This]);
2189 PerlLIO_close(p[that]);
2192 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2194 SvUPGRADE(sv,SVt_IV);
2196 PL_forkprocess = pid;
2197 if (did_pipes && pid > 0) {
2201 while (n < sizeof(int)) {
2202 n1 = PerlLIO_read(pp[0],
2203 (void*)(((char*)&errkid)+n),
2209 PerlLIO_close(pp[0]);
2211 if (n) { /* Error */
2213 PerlLIO_close(p[This]);
2214 if (n != sizeof(int))
2215 Perl_croak(aTHX_ "panic: kid popen errno read");
2217 pid2 = wait4pid(pid, &status, 0);
2218 } while (pid2 == -1 && errno == EINTR);
2219 errno = errkid; /* Propagate errno from kid */
2224 PerlLIO_close(pp[0]);
2225 return PerlIO_fdopen(p[This], mode);
2228 #if defined(atarist) || defined(EPOC)
2231 Perl_my_popen(pTHX_ char *cmd, char *mode)
2233 PERL_FLUSHALL_FOR_CHILD;
2234 /* Call system's popen() to get a FILE *, then import it.
2235 used 0 for 2nd parameter to PerlIO_importFILE;
2238 return PerlIO_importFILE(popen(cmd, mode), 0);
2242 FILE *djgpp_popen();
2244 Perl_my_popen(pTHX_ char *cmd, char *mode)
2246 PERL_FLUSHALL_FOR_CHILD;
2247 /* Call system's popen() to get a FILE *, then import it.
2248 used 0 for 2nd parameter to PerlIO_importFILE;
2251 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2256 #endif /* !DOSISH */
2258 /* this is called in parent before the fork() */
2260 Perl_atfork_lock(void)
2263 #if defined(USE_ITHREADS)
2264 /* locks must be held in locking order (if any) */
2266 MUTEX_LOCK(&PL_malloc_mutex);
2272 /* this is called in both parent and child after the fork() */
2274 Perl_atfork_unlock(void)
2277 #if defined(USE_ITHREADS)
2278 /* locks must be released in same order as in atfork_lock() */
2280 MUTEX_UNLOCK(&PL_malloc_mutex);
2289 #if defined(HAS_FORK)
2291 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2296 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2297 * handlers elsewhere in the code */
2302 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2303 Perl_croak_nocontext("fork() not available");
2305 #endif /* HAS_FORK */
2310 Perl_dump_fds(pTHX_ char *s)
2315 PerlIO_printf(Perl_debug_log,"%s", s);
2316 for (fd = 0; fd < 32; fd++) {
2317 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2318 PerlIO_printf(Perl_debug_log," %d",fd);
2320 PerlIO_printf(Perl_debug_log,"\n");
2323 #endif /* DUMP_FDS */
2327 dup2(int oldfd, int newfd)
2329 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2332 PerlLIO_close(newfd);
2333 return fcntl(oldfd, F_DUPFD, newfd);
2335 #define DUP2_MAX_FDS 256
2336 int fdtmp[DUP2_MAX_FDS];
2342 PerlLIO_close(newfd);
2343 /* good enough for low fd's... */
2344 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2345 if (fdx >= DUP2_MAX_FDS) {
2353 PerlLIO_close(fdtmp[--fdx]);
2360 #ifdef HAS_SIGACTION
2362 #ifdef MACOS_TRADITIONAL
2363 /* We don't want restart behavior on MacOS */
2368 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2371 struct sigaction act, oact;
2374 /* only "parent" interpreter can diddle signals */
2375 if (PL_curinterp != aTHX)
2379 act.sa_handler = handler;
2380 sigemptyset(&act.sa_mask);
2383 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2384 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2386 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2387 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2388 act.sa_flags |= SA_NOCLDWAIT;
2390 if (sigaction(signo, &act, &oact) == -1)
2393 return oact.sa_handler;
2397 Perl_rsignal_state(pTHX_ int signo)
2399 struct sigaction oact;
2401 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2404 return oact.sa_handler;
2408 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2411 struct sigaction act;
2414 /* only "parent" interpreter can diddle signals */
2415 if (PL_curinterp != aTHX)
2419 act.sa_handler = handler;
2420 sigemptyset(&act.sa_mask);
2423 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2424 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2426 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2427 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2428 act.sa_flags |= SA_NOCLDWAIT;
2430 return sigaction(signo, &act, save);
2434 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2438 /* only "parent" interpreter can diddle signals */
2439 if (PL_curinterp != aTHX)
2443 return sigaction(signo, save, (struct sigaction *)NULL);
2446 #else /* !HAS_SIGACTION */
2449 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2451 #if defined(USE_ITHREADS) && !defined(WIN32)
2452 /* only "parent" interpreter can diddle signals */
2453 if (PL_curinterp != aTHX)
2457 return PerlProc_signal(signo, handler);
2469 Perl_rsignal_state(pTHX_ int signo)
2472 Sighandler_t oldsig;
2474 #if defined(USE_ITHREADS) && !defined(WIN32)
2475 /* only "parent" interpreter can diddle signals */
2476 if (PL_curinterp != aTHX)
2481 oldsig = PerlProc_signal(signo, sig_trap);
2482 PerlProc_signal(signo, oldsig);
2484 PerlProc_kill(PerlProc_getpid(), signo);
2489 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2491 #if defined(USE_ITHREADS) && !defined(WIN32)
2492 /* only "parent" interpreter can diddle signals */
2493 if (PL_curinterp != aTHX)
2496 *save = PerlProc_signal(signo, handler);
2497 return (*save == SIG_ERR) ? -1 : 0;
2501 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2503 #if defined(USE_ITHREADS) && !defined(WIN32)
2504 /* only "parent" interpreter can diddle signals */
2505 if (PL_curinterp != aTHX)
2508 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2511 #endif /* !HAS_SIGACTION */
2512 #endif /* !PERL_MICRO */
2514 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2515 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2517 Perl_my_pclose(pTHX_ PerlIO *ptr)
2519 Sigsave_t hstat, istat, qstat;
2525 int saved_errno = 0;
2527 int saved_vaxc_errno;
2530 int saved_win32_errno;
2534 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2536 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2538 *svp = &PL_sv_undef;
2540 if (pid == -1) { /* Opened by popen. */
2541 return my_syspclose(ptr);
2544 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2545 saved_errno = errno;
2547 saved_vaxc_errno = vaxc$errno;
2550 saved_win32_errno = GetLastError();
2554 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2557 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2558 rsignal_save(SIGINT, SIG_IGN, &istat);
2559 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2562 pid2 = wait4pid(pid, &status, 0);
2563 } while (pid2 == -1 && errno == EINTR);
2565 rsignal_restore(SIGHUP, &hstat);
2566 rsignal_restore(SIGINT, &istat);
2567 rsignal_restore(SIGQUIT, &qstat);
2570 SETERRNO(saved_errno, saved_vaxc_errno);
2573 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2575 #endif /* !DOSISH */
2577 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2579 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2584 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2586 char spid[TYPE_CHARS(IV)];
2590 sprintf(spid, "%"IVdf, (IV)pid);
2591 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2592 if (svp && *svp != &PL_sv_undef) {
2593 *statusp = SvIVX(*svp);
2594 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2601 hv_iterinit(PL_pidstatus);
2602 if ((entry = hv_iternext(PL_pidstatus))) {
2603 SV *sv = hv_iterval(PL_pidstatus,entry);
2605 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2606 *statusp = SvIVX(sv);
2607 sprintf(spid, "%"IVdf, (IV)pid);
2608 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2615 # ifdef HAS_WAITPID_RUNTIME
2616 if (!HAS_WAITPID_RUNTIME)
2619 result = PerlProc_waitpid(pid,statusp,flags);
2622 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2623 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2626 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2627 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2632 Perl_croak(aTHX_ "Can't do waitpid with flags");
2634 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2635 pidgone(result,*statusp);
2641 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2644 if (result < 0 && errno == EINTR) {
2649 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2653 Perl_pidgone(pTHX_ Pid_t pid, int status)
2656 char spid[TYPE_CHARS(IV)];
2658 sprintf(spid, "%"IVdf, (IV)pid);
2659 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2660 SvUPGRADE(sv,SVt_IV);
2661 SvIV_set(sv, status);
2665 #if defined(atarist) || defined(OS2) || defined(EPOC)
2668 int /* Cannot prototype with I32
2670 my_syspclose(PerlIO *ptr)
2673 Perl_my_pclose(pTHX_ PerlIO *ptr)
2676 /* Needs work for PerlIO ! */
2677 FILE *f = PerlIO_findFILE(ptr);
2678 I32 result = pclose(f);
2679 PerlIO_releaseFILE(ptr,f);
2687 Perl_my_pclose(pTHX_ PerlIO *ptr)
2689 /* Needs work for PerlIO ! */
2690 FILE *f = PerlIO_findFILE(ptr);
2691 I32 result = djgpp_pclose(f);
2692 result = (result << 8) & 0xff00;
2693 PerlIO_releaseFILE(ptr,f);
2699 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2702 register const char *frombase = from;
2705 register const char c = *from;
2710 while (count-- > 0) {
2711 for (todo = len; todo > 0; todo--) {
2720 Perl_same_dirent(pTHX_ const char *a, const char *b)
2722 char *fa = strrchr(a,'/');
2723 char *fb = strrchr(b,'/');
2726 SV *tmpsv = sv_newmortal();
2739 sv_setpvn(tmpsv, ".", 1);
2741 sv_setpvn(tmpsv, a, fa - a);
2742 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2745 sv_setpvn(tmpsv, ".", 1);
2747 sv_setpvn(tmpsv, b, fb - b);
2748 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2750 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2751 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2753 #endif /* !HAS_RENAME */
2756 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2758 const char *xfound = Nullch;
2759 char *xfailed = Nullch;
2760 char tmpbuf[MAXPATHLEN];
2764 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2765 # define SEARCH_EXTS ".bat", ".cmd", NULL
2766 # define MAX_EXT_LEN 4
2769 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2770 # define MAX_EXT_LEN 4
2773 # define SEARCH_EXTS ".pl", ".com", NULL
2774 # define MAX_EXT_LEN 4
2776 /* additional extensions to try in each dir if scriptname not found */
2778 const char *exts[] = { SEARCH_EXTS };
2779 const char **ext = search_ext ? search_ext : exts;
2780 int extidx = 0, i = 0;
2781 const char *curext = Nullch;
2784 # define MAX_EXT_LEN 0
2788 * If dosearch is true and if scriptname does not contain path
2789 * delimiters, search the PATH for scriptname.
2791 * If SEARCH_EXTS is also defined, will look for each
2792 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2793 * while searching the PATH.
2795 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2796 * proceeds as follows:
2797 * If DOSISH or VMSISH:
2798 * + look for ./scriptname{,.foo,.bar}
2799 * + search the PATH for scriptname{,.foo,.bar}
2802 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2803 * this will not look in '.' if it's not in the PATH)
2808 # ifdef ALWAYS_DEFTYPES
2809 len = strlen(scriptname);
2810 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2811 int hasdir, idx = 0, deftypes = 1;
2814 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2817 int hasdir, idx = 0, deftypes = 1;
2820 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2822 /* The first time through, just add SEARCH_EXTS to whatever we
2823 * already have, so we can check for default file types. */
2825 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2831 if ((strlen(tmpbuf) + strlen(scriptname)
2832 + MAX_EXT_LEN) >= sizeof tmpbuf)
2833 continue; /* don't search dir with too-long name */
2834 strcat(tmpbuf, scriptname);
2838 if (strEQ(scriptname, "-"))
2840 if (dosearch) { /* Look in '.' first. */
2841 const char *cur = scriptname;
2843 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2845 if (strEQ(ext[i++],curext)) {
2846 extidx = -1; /* already has an ext */
2851 DEBUG_p(PerlIO_printf(Perl_debug_log,
2852 "Looking for %s\n",cur));
2853 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2854 && !S_ISDIR(PL_statbuf.st_mode)) {
2862 if (cur == scriptname) {
2863 len = strlen(scriptname);
2864 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2866 cur = strcpy(tmpbuf, scriptname);
2868 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2869 && strcpy(tmpbuf+len, ext[extidx++]));
2874 #ifdef MACOS_TRADITIONAL
2875 if (dosearch && !strchr(scriptname, ':') &&
2876 (s = PerlEnv_getenv("Commands")))
2878 if (dosearch && !strchr(scriptname, '/')
2880 && !strchr(scriptname, '\\')
2882 && (s = PerlEnv_getenv("PATH")))
2887 PL_bufend = s + strlen(s);
2888 while (s < PL_bufend) {
2889 #ifdef MACOS_TRADITIONAL
2890 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2894 #if defined(atarist) || defined(DOSISH)
2899 && *s != ';'; len++, s++) {
2900 if (len < sizeof tmpbuf)
2903 if (len < sizeof tmpbuf)
2905 #else /* ! (atarist || DOSISH) */
2906 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2909 #endif /* ! (atarist || DOSISH) */
2910 #endif /* MACOS_TRADITIONAL */
2913 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2914 continue; /* don't search dir with too-long name */
2915 #ifdef MACOS_TRADITIONAL
2916 if (len && tmpbuf[len - 1] != ':')
2917 tmpbuf[len++] = ':';
2920 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2921 && tmpbuf[len - 1] != '/'
2922 && tmpbuf[len - 1] != '\\'
2925 tmpbuf[len++] = '/';
2926 if (len == 2 && tmpbuf[0] == '.')
2929 (void)strcpy(tmpbuf + len, scriptname);
2933 len = strlen(tmpbuf);
2934 if (extidx > 0) /* reset after previous loop */
2938 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2939 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2940 if (S_ISDIR(PL_statbuf.st_mode)) {
2944 } while ( retval < 0 /* not there */
2945 && extidx>=0 && ext[extidx] /* try an extension? */
2946 && strcpy(tmpbuf+len, ext[extidx++])
2951 if (S_ISREG(PL_statbuf.st_mode)
2952 && cando(S_IRUSR,TRUE,&PL_statbuf)
2953 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2954 && cando(S_IXUSR,TRUE,&PL_statbuf)
2958 xfound = tmpbuf; /* bingo! */
2962 xfailed = savepv(tmpbuf);
2965 if (!xfound && !seen_dot && !xfailed &&
2966 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2967 || S_ISDIR(PL_statbuf.st_mode)))
2969 seen_dot = 1; /* Disable message. */
2971 if (flags & 1) { /* do or die? */
2972 Perl_croak(aTHX_ "Can't %s %s%s%s",
2973 (xfailed ? "execute" : "find"),
2974 (xfailed ? xfailed : scriptname),
2975 (xfailed ? "" : " on PATH"),
2976 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2978 scriptname = Nullch;
2982 scriptname = xfound;
2984 return (scriptname ? savepv(scriptname) : Nullch);
2987 #ifndef PERL_GET_CONTEXT_DEFINED
2990 Perl_get_context(void)
2993 #if defined(USE_ITHREADS)
2994 # ifdef OLD_PTHREADS_API
2996 if (pthread_getspecific(PL_thr_key, &t))
2997 Perl_croak_nocontext("panic: pthread_getspecific");
3000 # ifdef I_MACH_CTHREADS
3001 return (void*)cthread_data(cthread_self());
3003 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3012 Perl_set_context(void *t)
3015 #if defined(USE_ITHREADS)
3016 # ifdef I_MACH_CTHREADS
3017 cthread_set_data(cthread_self(), t);
3019 if (pthread_setspecific(PL_thr_key, t))
3020 Perl_croak_nocontext("panic: pthread_setspecific");
3027 #endif /* !PERL_GET_CONTEXT_DEFINED */
3029 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3038 Perl_get_op_names(pTHX)
3040 return (char **)PL_op_name;
3044 Perl_get_op_descs(pTHX)
3046 return (char **)PL_op_desc;
3050 Perl_get_no_modify(pTHX)
3052 return PL_no_modify;
3056 Perl_get_opargs(pTHX)
3058 return (U32 *)PL_opargs;
3062 Perl_get_ppaddr(pTHX)
3065 return (PPADDR_t*)PL_ppaddr;
3068 #ifndef HAS_GETENV_LEN
3070 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3072 char *env_trans = PerlEnv_getenv(env_elem);
3074 *len = strlen(env_trans);
3081 Perl_get_vtbl(pTHX_ int vtbl_id)
3083 const MGVTBL* result = Null(MGVTBL*);
3087 result = &PL_vtbl_sv;
3090 result = &PL_vtbl_env;
3092 case want_vtbl_envelem:
3093 result = &PL_vtbl_envelem;
3096 result = &PL_vtbl_sig;
3098 case want_vtbl_sigelem:
3099 result = &PL_vtbl_sigelem;
3101 case want_vtbl_pack:
3102 result = &PL_vtbl_pack;
3104 case want_vtbl_packelem:
3105 result = &PL_vtbl_packelem;
3107 case want_vtbl_dbline:
3108 result = &PL_vtbl_dbline;
3111 result = &PL_vtbl_isa;
3113 case want_vtbl_isaelem:
3114 result = &PL_vtbl_isaelem;
3116 case want_vtbl_arylen:
3117 result = &PL_vtbl_arylen;
3119 case want_vtbl_glob:
3120 result = &PL_vtbl_glob;
3122 case want_vtbl_mglob:
3123 result = &PL_vtbl_mglob;
3125 case want_vtbl_nkeys:
3126 result = &PL_vtbl_nkeys;
3128 case want_vtbl_taint:
3129 result = &PL_vtbl_taint;
3131 case want_vtbl_substr:
3132 result = &PL_vtbl_substr;
3135 result = &PL_vtbl_vec;
3138 result = &PL_vtbl_pos;
3141 result = &PL_vtbl_bm;
3144 result = &PL_vtbl_fm;
3146 case want_vtbl_uvar:
3147 result = &PL_vtbl_uvar;
3149 case want_vtbl_defelem:
3150 result = &PL_vtbl_defelem;
3152 case want_vtbl_regexp:
3153 result = &PL_vtbl_regexp;
3155 case want_vtbl_regdata:
3156 result = &PL_vtbl_regdata;
3158 case want_vtbl_regdatum:
3159 result = &PL_vtbl_regdatum;
3161 #ifdef USE_LOCALE_COLLATE
3162 case want_vtbl_collxfrm:
3163 result = &PL_vtbl_collxfrm;
3166 case want_vtbl_amagic:
3167 result = &PL_vtbl_amagic;
3169 case want_vtbl_amagicelem:
3170 result = &PL_vtbl_amagicelem;
3172 case want_vtbl_backref:
3173 result = &PL_vtbl_backref;
3175 case want_vtbl_utf8:
3176 result = &PL_vtbl_utf8;
3179 return (MGVTBL*)result;
3183 Perl_my_fflush_all(pTHX)
3185 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3186 return PerlIO_flush(NULL);
3188 # if defined(HAS__FWALK)
3189 extern int fflush(FILE *);
3190 /* undocumented, unprototyped, but very useful BSDism */
3191 extern void _fwalk(int (*)(FILE *));
3195 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3197 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3198 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3200 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3201 open_max = sysconf(_SC_OPEN_MAX);
3204 open_max = FOPEN_MAX;
3207 open_max = OPEN_MAX;
3218 for (i = 0; i < open_max; i++)
3219 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3220 STDIO_STREAM_ARRAY[i]._file < open_max &&
3221 STDIO_STREAM_ARRAY[i]._flag)
3222 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3226 SETERRNO(EBADF,RMS_IFI);
3233 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3236 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3237 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3239 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3240 const char *type = OP_IS_SOCKET(op)
3241 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3242 ? "socket" : "filehandle";
3243 const char *name = NULL;
3245 if (gv && isGV(gv)) {
3249 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3250 if (ckWARN(WARN_IO)) {
3251 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3253 Perl_warner(aTHX_ packWARN(WARN_IO),
3254 "Filehandle %s opened only for %sput",
3257 Perl_warner(aTHX_ packWARN(WARN_IO),
3258 "Filehandle opened only for %sput", direction);
3265 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3267 warn_type = WARN_CLOSED;
3271 warn_type = WARN_UNOPENED;
3274 if (ckWARN(warn_type)) {
3275 if (name && *name) {
3276 Perl_warner(aTHX_ packWARN(warn_type),
3277 "%s%s on %s %s %s", func, pars, vile, type, name);
3278 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3280 aTHX_ packWARN(warn_type),
3281 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3286 Perl_warner(aTHX_ packWARN(warn_type),
3287 "%s%s on %s %s", func, pars, vile, type);
3288 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3290 aTHX_ packWARN(warn_type),
3291 "\t(Are you trying to call %s%s on dirhandle?)\n",
3300 /* in ASCII order, not that it matters */
3301 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3304 Perl_ebcdic_control(pTHX_ int ch)
3312 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3313 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3316 if (ctlp == controllablechars)
3317 return('\177'); /* DEL */
3319 return((unsigned char)(ctlp - controllablechars - 1));
3320 } else { /* Want uncontrol */
3321 if (ch == '\177' || ch == -1)
3323 else if (ch == '\157')
3325 else if (ch == '\174')
3327 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3329 else if (ch == '\155')
3331 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3332 return(controllablechars[ch+1]);
3334 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3339 /* To workaround core dumps from the uninitialised tm_zone we get the
3340 * system to give us a reasonable struct to copy. This fix means that
3341 * strftime uses the tm_zone and tm_gmtoff values returned by
3342 * localtime(time()). That should give the desired result most of the
3343 * time. But probably not always!
3345 * This does not address tzname aspects of NETaa14816.
3350 # ifndef STRUCT_TM_HASZONE
3351 # define STRUCT_TM_HASZONE
3355 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3356 # ifndef HAS_TM_TM_ZONE
3357 # define HAS_TM_TM_ZONE
3362 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3364 #ifdef HAS_TM_TM_ZONE
3368 my_tm = localtime(&now);
3370 Copy(my_tm, ptm, 1, struct tm);
3375 * mini_mktime - normalise struct tm values without the localtime()
3376 * semantics (and overhead) of mktime().
3379 Perl_mini_mktime(pTHX_ struct tm *ptm)
3383 int month, mday, year, jday;
3384 int odd_cent, odd_year;
3386 #define DAYS_PER_YEAR 365
3387 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3388 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3389 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3390 #define SECS_PER_HOUR (60*60)
3391 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3392 /* parentheses deliberately absent on these two, otherwise they don't work */
3393 #define MONTH_TO_DAYS 153/5
3394 #define DAYS_TO_MONTH 5/153
3395 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3396 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3397 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3398 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3401 * Year/day algorithm notes:
3403 * With a suitable offset for numeric value of the month, one can find
3404 * an offset into the year by considering months to have 30.6 (153/5) days,
3405 * using integer arithmetic (i.e., with truncation). To avoid too much
3406 * messing about with leap days, we consider January and February to be
3407 * the 13th and 14th month of the previous year. After that transformation,
3408 * we need the month index we use to be high by 1 from 'normal human' usage,
3409 * so the month index values we use run from 4 through 15.
3411 * Given that, and the rules for the Gregorian calendar (leap years are those
3412 * divisible by 4 unless also divisible by 100, when they must be divisible
3413 * by 400 instead), we can simply calculate the number of days since some
3414 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3415 * the days we derive from our month index, and adding in the day of the
3416 * month. The value used here is not adjusted for the actual origin which
3417 * it normally would use (1 January A.D. 1), since we're not exposing it.
3418 * We're only building the value so we can turn around and get the
3419 * normalised values for the year, month, day-of-month, and day-of-year.
3421 * For going backward, we need to bias the value we're using so that we find
3422 * the right year value. (Basically, we don't want the contribution of
3423 * March 1st to the number to apply while deriving the year). Having done
3424 * that, we 'count up' the contribution to the year number by accounting for
3425 * full quadracenturies (400-year periods) with their extra leap days, plus
3426 * the contribution from full centuries (to avoid counting in the lost leap
3427 * days), plus the contribution from full quad-years (to count in the normal
3428 * leap days), plus the leftover contribution from any non-leap years.
3429 * At this point, if we were working with an actual leap day, we'll have 0
3430 * days left over. This is also true for March 1st, however. So, we have
3431 * to special-case that result, and (earlier) keep track of the 'odd'
3432 * century and year contributions. If we got 4 extra centuries in a qcent,
3433 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3434 * Otherwise, we add back in the earlier bias we removed (the 123 from
3435 * figuring in March 1st), find the month index (integer division by 30.6),
3436 * and the remainder is the day-of-month. We then have to convert back to
3437 * 'real' months (including fixing January and February from being 14/15 in
3438 * the previous year to being in the proper year). After that, to get
3439 * tm_yday, we work with the normalised year and get a new yearday value for
3440 * January 1st, which we subtract from the yearday value we had earlier,
3441 * representing the date we've re-built. This is done from January 1
3442 * because tm_yday is 0-origin.
3444 * Since POSIX time routines are only guaranteed to work for times since the
3445 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3446 * applies Gregorian calendar rules even to dates before the 16th century
3447 * doesn't bother me. Besides, you'd need cultural context for a given
3448 * date to know whether it was Julian or Gregorian calendar, and that's
3449 * outside the scope for this routine. Since we convert back based on the
3450 * same rules we used to build the yearday, you'll only get strange results
3451 * for input which needed normalising, or for the 'odd' century years which
3452 * were leap years in the Julian calander but not in the Gregorian one.
3453 * I can live with that.
3455 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3456 * that's still outside the scope for POSIX time manipulation, so I don't
3460 year = 1900 + ptm->tm_year;
3461 month = ptm->tm_mon;
3462 mday = ptm->tm_mday;
3463 /* allow given yday with no month & mday to dominate the result */
3464 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3467 jday = 1 + ptm->tm_yday;
3476 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3477 yearday += month*MONTH_TO_DAYS + mday + jday;
3479 * Note that we don't know when leap-seconds were or will be,
3480 * so we have to trust the user if we get something which looks
3481 * like a sensible leap-second. Wild values for seconds will
3482 * be rationalised, however.
3484 if ((unsigned) ptm->tm_sec <= 60) {
3491 secs += 60 * ptm->tm_min;
3492 secs += SECS_PER_HOUR * ptm->tm_hour;
3494 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3495 /* got negative remainder, but need positive time */
3496 /* back off an extra day to compensate */
3497 yearday += (secs/SECS_PER_DAY)-1;
3498 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3501 yearday += (secs/SECS_PER_DAY);
3502 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3505 else if (secs >= SECS_PER_DAY) {
3506 yearday += (secs/SECS_PER_DAY);
3507 secs %= SECS_PER_DAY;
3509 ptm->tm_hour = secs/SECS_PER_HOUR;
3510 secs %= SECS_PER_HOUR;
3511 ptm->tm_min = secs/60;
3513 ptm->tm_sec += secs;
3514 /* done with time of day effects */
3516 * The algorithm for yearday has (so far) left it high by 428.
3517 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3518 * bias it by 123 while trying to figure out what year it
3519 * really represents. Even with this tweak, the reverse
3520 * translation fails for years before A.D. 0001.
3521 * It would still fail for Feb 29, but we catch that one below.
3523 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3524 yearday -= YEAR_ADJUST;
3525 year = (yearday / DAYS_PER_QCENT) * 400;
3526 yearday %= DAYS_PER_QCENT;
3527 odd_cent = yearday / DAYS_PER_CENT;
3528 year += odd_cent * 100;
3529 yearday %= DAYS_PER_CENT;
3530 year += (yearday / DAYS_PER_QYEAR) * 4;
3531 yearday %= DAYS_PER_QYEAR;
3532 odd_year = yearday / DAYS_PER_YEAR;
3534 yearday %= DAYS_PER_YEAR;
3535 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3540 yearday += YEAR_ADJUST; /* recover March 1st crock */
3541 month = yearday*DAYS_TO_MONTH;
3542 yearday -= month*MONTH_TO_DAYS;
3543 /* recover other leap-year adjustment */
3552 ptm->tm_year = year - 1900;
3554 ptm->tm_mday = yearday;
3555 ptm->tm_mon = month;
3559 ptm->tm_mon = month - 1;
3561 /* re-build yearday based on Jan 1 to get tm_yday */
3563 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3564 yearday += 14*MONTH_TO_DAYS + 1;
3565 ptm->tm_yday = jday - yearday;
3566 /* fix tm_wday if not overridden by caller */
3567 if ((unsigned)ptm->tm_wday > 6)
3568 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3572 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)
3580 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3583 mytm.tm_hour = hour;
3584 mytm.tm_mday = mday;
3586 mytm.tm_year = year;
3587 mytm.tm_wday = wday;
3588 mytm.tm_yday = yday;
3589 mytm.tm_isdst = isdst;
3591 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3592 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3597 #ifdef HAS_TM_TM_GMTOFF
3598 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3600 #ifdef HAS_TM_TM_ZONE
3601 mytm.tm_zone = mytm2.tm_zone;
3606 New(0, buf, buflen, char);
3607 len = strftime(buf, buflen, fmt, &mytm);
3609 ** The following is needed to handle to the situation where
3610 ** tmpbuf overflows. Basically we want to allocate a buffer
3611 ** and try repeatedly. The reason why it is so complicated
3612 ** is that getting a return value of 0 from strftime can indicate
3613 ** one of the following:
3614 ** 1. buffer overflowed,
3615 ** 2. illegal conversion specifier, or
3616 ** 3. the format string specifies nothing to be returned(not
3617 ** an error). This could be because format is an empty string
3618 ** or it specifies %p that yields an empty string in some locale.
3619 ** If there is a better way to make it portable, go ahead by
3622 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3625 /* Possibly buf overflowed - try again with a bigger buf */
3626 const int fmtlen = strlen(fmt);
3627 const int bufsize = fmtlen + buflen;
3629 New(0, buf, bufsize, char);
3631 buflen = strftime(buf, bufsize, fmt, &mytm);
3632 if (buflen > 0 && buflen < bufsize)
3634 /* heuristic to prevent out-of-memory errors */
3635 if (bufsize > 100*fmtlen) {
3640 Renew(buf, bufsize*2, char);
3645 Perl_croak(aTHX_ "panic: no strftime");
3651 #define SV_CWD_RETURN_UNDEF \
3652 sv_setsv(sv, &PL_sv_undef); \
3655 #define SV_CWD_ISDOT(dp) \
3656 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3657 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3660 =head1 Miscellaneous Functions
3662 =for apidoc getcwd_sv
3664 Fill the sv with current working directory
3669 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3670 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3671 * getcwd(3) if available
3672 * Comments from the orignal:
3673 * This is a faster version of getcwd. It's also more dangerous
3674 * because you might chdir out of a directory that you can't chdir
3678 Perl_getcwd_sv(pTHX_ register SV *sv)
3682 #ifndef INCOMPLETE_TAINTS
3688 char buf[MAXPATHLEN];
3690 /* Some getcwd()s automatically allocate a buffer of the given
3691 * size from the heap if they are given a NULL buffer pointer.
3692 * The problem is that this behaviour is not portable. */
3693 if (getcwd(buf, sizeof(buf) - 1)) {
3694 sv_setpvn(sv, buf, strlen(buf));
3698 sv_setsv(sv, &PL_sv_undef);
3706 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3710 SvUPGRADE(sv, SVt_PV);
3712 if (PerlLIO_lstat(".", &statbuf) < 0) {
3713 SV_CWD_RETURN_UNDEF;
3716 orig_cdev = statbuf.st_dev;
3717 orig_cino = statbuf.st_ino;
3726 if (PerlDir_chdir("..") < 0) {
3727 SV_CWD_RETURN_UNDEF;
3729 if (PerlLIO_stat(".", &statbuf) < 0) {
3730 SV_CWD_RETURN_UNDEF;
3733 cdev = statbuf.st_dev;
3734 cino = statbuf.st_ino;
3736 if (odev == cdev && oino == cino) {
3739 if (!(dir = PerlDir_open("."))) {
3740 SV_CWD_RETURN_UNDEF;
3743 while ((dp = PerlDir_read(dir)) != NULL) {
3745 const int namelen = dp->d_namlen;
3747 const int namelen = strlen(dp->d_name);
3750 if (SV_CWD_ISDOT(dp)) {
3754 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3755 SV_CWD_RETURN_UNDEF;
3758 tdev = statbuf.st_dev;
3759 tino = statbuf.st_ino;
3760 if (tino == oino && tdev == odev) {
3766 SV_CWD_RETURN_UNDEF;
3769 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3770 SV_CWD_RETURN_UNDEF;
3773 SvGROW(sv, pathlen + namelen + 1);
3777 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3780 /* prepend current directory to the front */
3782 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3783 pathlen += (namelen + 1);
3785 #ifdef VOID_CLOSEDIR
3788 if (PerlDir_close(dir) < 0) {
3789 SV_CWD_RETURN_UNDEF;
3795 SvCUR_set(sv, pathlen);
3799 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3800 SV_CWD_RETURN_UNDEF;
3803 if (PerlLIO_stat(".", &statbuf) < 0) {
3804 SV_CWD_RETURN_UNDEF;
3807 cdev = statbuf.st_dev;
3808 cino = statbuf.st_ino;
3810 if (cdev != orig_cdev || cino != orig_cino) {
3811 Perl_croak(aTHX_ "Unstable directory path, "
3812 "current directory changed unexpectedly");
3824 =for apidoc scan_version
3826 Returns a pointer to the next character after the parsed
3827 version string, as well as upgrading the passed in SV to
3830 Function must be called with an already existing SV like
3833 s = scan_version(s,SV *sv, bool qv);
3835 Performs some preprocessing to the string to ensure that
3836 it has the correct characteristics of a version. Flags the
3837 object if it contains an underscore (which denotes this
3838 is a alpha version). The boolean qv denotes that the version
3839 should be interpreted as if it had multiple decimals, even if
3846 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3848 const char *start = s;
3849 const char *pos = s;
3852 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3853 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3856 /* pre-scan the imput string to check for decimals */
3857 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3862 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3865 else if ( *pos == '_' )
3868 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3876 pos++; /* get past 'v' */
3877 qv = 1; /* force quoted version processing */
3879 while (isDIGIT(*pos))
3881 if (!isALPHA(*pos)) {
3884 if (*s == 'v') s++; /* get past 'v' */
3889 /* this is atoi() that delimits on underscores */
3890 const char *end = pos;
3893 if ( s < pos && s > start && *(s-1) == '_' ) {
3894 mult *= -1; /* alpha version */
3896 /* the following if() will only be true after the decimal
3897 * point of a version originally created with a bare
3898 * floating point number, i.e. not quoted in any way
3900 if ( !qv && s > start+1 && saw_period == 1 ) {
3904 rev += (*s - '0') * mult;
3906 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3907 Perl_croak(aTHX_ "Integer overflow in version");
3912 while (--end >= s) {
3914 rev += (*end - '0') * mult;
3916 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3917 Perl_croak(aTHX_ "Integer overflow in version");
3922 /* Append revision */
3923 av_push((AV *)sv, newSViv(rev));
3924 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3926 else if ( isDIGIT(*pos) )
3932 while ( isDIGIT(*pos) ) {
3933 if ( saw_period == 1 && pos-s == 3 )
3939 if ( qv ) { /* quoted versions always become full version objects */
3940 I32 len = av_len((AV *)sv);
3941 /* This for loop appears to trigger a compiler bug on OS X, as it
3942 loops infinitely. Yes, len is negative. No, it makes no sense.
3943 Compiler in question is:
3944 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3945 for ( len = 2 - len; len > 0; len-- )
3946 av_push((AV *)sv, newSViv(0));
3950 av_push((AV *)sv, newSViv(0));
3956 =for apidoc new_version
3958 Returns a new version object based on the passed in SV:
3960 SV *sv = new_version(SV *ver);
3962 Does not alter the passed in ver SV. See "upg_version" if you
3963 want to upgrade the SV.
3969 Perl_new_version(pTHX_ SV *ver)
3972 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3975 AV *av = (AV *)SvRV(ver);
3976 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3977 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3979 for ( key = 0; key <= av_len(av); key++ )
3981 const I32 rev = SvIV(*av_fetch(av, key, FALSE));
3982 av_push((AV *)sv, newSViv(rev));
3987 if ( SvVOK(ver) ) { /* already a v-string */
3989 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3990 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3991 sv_setpv(rv,version);
3996 sv_setsv(rv,ver); /* make a duplicate */
4005 =for apidoc upg_version
4007 In-place upgrade of the supplied SV to a version object.
4009 SV *sv = upg_version(SV *sv);
4011 Returns a pointer to the upgraded SV.
4017 Perl_upg_version(pTHX_ SV *ver)
4022 if ( SvNOK(ver) ) /* may get too much accuracy */
4025 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4026 version = savepv(tbuf);
4029 else if ( SvVOK(ver) ) { /* already a v-string */
4030 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4031 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4035 else /* must be a string or something like a string */
4037 version = savesvpv(ver);
4039 (void)scan_version(version, ver, qv);
4048 Accepts a version object and returns the normalized floating
4049 point representation. Call like:
4053 NOTE: you can pass either the object directly or the SV
4054 contained within the RV.
4060 Perl_vnumify(pTHX_ SV *vs)
4066 len = av_len((AV *)vs);
4069 Perl_sv_catpv(aTHX_ sv,"0");
4072 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4073 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4074 for ( i = 1 ; i < len ; i++ )
4076 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4077 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4082 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4083 if ( (int)PERL_ABS(digit) != 0 || len == 1 )
4085 if ( digit < 0 ) /* alpha version */
4086 Perl_sv_catpv(aTHX_ sv,"_");
4087 /* Don't display additional trailing zeros */
4088 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4093 Perl_sv_catpv(aTHX_ sv,"000");
4101 Accepts a version object and returns the normalized string
4102 representation. Call like:
4106 NOTE: you can pass either the object directly or the SV
4107 contained within the RV.
4113 Perl_vnormal(pTHX_ SV *vs)
4119 len = av_len((AV *)vs);
4122 Perl_sv_catpv(aTHX_ sv,"");
4125 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4126 Perl_sv_setpvf(aTHX_ sv,"%"IVdf,(IV)digit);
4127 for ( i = 1 ; i <= len ; i++ )
4129 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4131 Perl_sv_catpvf(aTHX_ sv,"_%"IVdf,(IV)-digit);
4133 Perl_sv_catpvf(aTHX_ sv,".%"IVdf,(IV)digit);
4136 if ( len <= 2 ) { /* short version, must be at least three */
4137 for ( len = 2 - len; len != 0; len-- )
4138 Perl_sv_catpv(aTHX_ sv,".0");
4145 =for apidoc vstringify
4147 In order to maintain maximum compatibility with earlier versions
4148 of Perl, this function will return either the floating point
4149 notation or the multiple dotted notation, depending on whether
4150 the original version contained 1 or more dots, respectively
4156 Perl_vstringify(pTHX_ SV *vs)
4161 len = av_len((AV *)vs);
4162 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4164 if ( len < 2 || ( len == 2 && digit < 0 ) )
4173 Version object aware cmp. Both operands must already have been
4174 converted into version objects.
4180 Perl_vcmp(pTHX_ SV *lsv, SV *rsv)
4187 l = av_len((AV *)lsv);
4188 r = av_len((AV *)rsv);
4192 while ( i <= m && retval == 0 )
4194 I32 left = SvIV(*av_fetch((AV *)lsv,i,0));
4195 I32 right = SvIV(*av_fetch((AV *)rsv,i,0));
4196 bool lalpha = left < 0 ? 1 : 0;
4197 bool ralpha = right < 0 ? 1 : 0;
4200 if ( left < right || (left == right && lalpha && !ralpha) )
4202 if ( left > right || (left == right && ralpha && !lalpha) )
4207 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4211 while ( i <= r && retval == 0 )
4213 if ( SvIV(*av_fetch((AV *)rsv,i,0)) != 0 )
4214 retval = -1; /* not a match after all */
4220 while ( i <= l && retval == 0 )
4222 if ( SvIV(*av_fetch((AV *)lsv,i,0)) != 0 )
4223 retval = +1; /* not a match after all */
4231 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4232 # define EMULATE_SOCKETPAIR_UDP
4235 #ifdef EMULATE_SOCKETPAIR_UDP
4237 S_socketpair_udp (int fd[2]) {
4239 /* Fake a datagram socketpair using UDP to localhost. */
4240 int sockets[2] = {-1, -1};
4241 struct sockaddr_in addresses[2];
4243 Sock_size_t size = sizeof(struct sockaddr_in);
4244 unsigned short port;
4247 memset(&addresses, 0, sizeof(addresses));
4250 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4251 if (sockets[i] == -1)
4252 goto tidy_up_and_fail;
4254 addresses[i].sin_family = AF_INET;
4255 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4256 addresses[i].sin_port = 0; /* kernel choses port. */
4257 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4258 sizeof(struct sockaddr_in)) == -1)
4259 goto tidy_up_and_fail;
4262 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4263 for each connect the other socket to it. */
4266 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4268 goto tidy_up_and_fail;
4269 if (size != sizeof(struct sockaddr_in))
4270 goto abort_tidy_up_and_fail;
4271 /* !1 is 0, !0 is 1 */
4272 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4273 sizeof(struct sockaddr_in)) == -1)
4274 goto tidy_up_and_fail;
4277 /* Now we have 2 sockets connected to each other. I don't trust some other
4278 process not to have already sent a packet to us (by random) so send
4279 a packet from each to the other. */
4282 /* I'm going to send my own port number. As a short.
4283 (Who knows if someone somewhere has sin_port as a bitfield and needs
4284 this routine. (I'm assuming crays have socketpair)) */
4285 port = addresses[i].sin_port;
4286 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4287 if (got != sizeof(port)) {
4289 goto tidy_up_and_fail;
4290 goto abort_tidy_up_and_fail;
4294 /* Packets sent. I don't trust them to have arrived though.
4295 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4296 connect to localhost will use a second kernel thread. In 2.6 the
4297 first thread running the connect() returns before the second completes,
4298 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4299 returns 0. Poor programs have tripped up. One poor program's authors'
4300 had a 50-1 reverse stock split. Not sure how connected these were.)
4301 So I don't trust someone not to have an unpredictable UDP stack.
4305 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4306 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4310 FD_SET(sockets[0], &rset);
4311 FD_SET(sockets[1], &rset);
4313 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4314 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4315 || !FD_ISSET(sockets[1], &rset)) {
4316 /* I hope this is portable and appropriate. */
4318 goto tidy_up_and_fail;
4319 goto abort_tidy_up_and_fail;
4323 /* And the paranoia department even now doesn't trust it to have arrive
4324 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4326 struct sockaddr_in readfrom;
4327 unsigned short buffer[2];
4332 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4333 sizeof(buffer), MSG_DONTWAIT,
4334 (struct sockaddr *) &readfrom, &size);
4336 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4338 (struct sockaddr *) &readfrom, &size);
4342 goto tidy_up_and_fail;
4343 if (got != sizeof(port)
4344 || size != sizeof(struct sockaddr_in)
4345 /* Check other socket sent us its port. */
4346 || buffer[0] != (unsigned short) addresses[!i].sin_port
4347 /* Check kernel says we got the datagram from that socket */
4348 || readfrom.sin_family != addresses[!i].sin_family
4349 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4350 || readfrom.sin_port != addresses[!i].sin_port)
4351 goto abort_tidy_up_and_fail;
4354 /* My caller (my_socketpair) has validated that this is non-NULL */
4357 /* I hereby declare this connection open. May God bless all who cross
4361 abort_tidy_up_and_fail:
4362 errno = ECONNABORTED;
4365 const int save_errno = errno;
4366 if (sockets[0] != -1)
4367 PerlLIO_close(sockets[0]);
4368 if (sockets[1] != -1)
4369 PerlLIO_close(sockets[1]);
4374 #endif /* EMULATE_SOCKETPAIR_UDP */
4376 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4378 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4379 /* Stevens says that family must be AF_LOCAL, protocol 0.
4380 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4385 struct sockaddr_in listen_addr;
4386 struct sockaddr_in connect_addr;
4391 || family != AF_UNIX
4394 errno = EAFNOSUPPORT;
4402 #ifdef EMULATE_SOCKETPAIR_UDP
4403 if (type == SOCK_DGRAM)
4404 return S_socketpair_udp(fd);
4407 listener = PerlSock_socket(AF_INET, type, 0);
4410 memset(&listen_addr, 0, sizeof(listen_addr));
4411 listen_addr.sin_family = AF_INET;
4412 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4413 listen_addr.sin_port = 0; /* kernel choses port. */
4414 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4415 sizeof(listen_addr)) == -1)
4416 goto tidy_up_and_fail;
4417 if (PerlSock_listen(listener, 1) == -1)
4418 goto tidy_up_and_fail;
4420 connector = PerlSock_socket(AF_INET, type, 0);
4421 if (connector == -1)
4422 goto tidy_up_and_fail;
4423 /* We want to find out the port number to connect to. */
4424 size = sizeof(connect_addr);
4425 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4427 goto tidy_up_and_fail;
4428 if (size != sizeof(connect_addr))
4429 goto abort_tidy_up_and_fail;
4430 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4431 sizeof(connect_addr)) == -1)
4432 goto tidy_up_and_fail;
4434 size = sizeof(listen_addr);
4435 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4438 goto tidy_up_and_fail;
4439 if (size != sizeof(listen_addr))
4440 goto abort_tidy_up_and_fail;
4441 PerlLIO_close(listener);
4442 /* Now check we are talking to ourself by matching port and host on the
4444 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4446 goto tidy_up_and_fail;
4447 if (size != sizeof(connect_addr)
4448 || listen_addr.sin_family != connect_addr.sin_family
4449 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4450 || listen_addr.sin_port != connect_addr.sin_port) {
4451 goto abort_tidy_up_and_fail;
4457 abort_tidy_up_and_fail:
4459 errno = ECONNABORTED; /* This would be the standard thing to do. */
4461 # ifdef ECONNREFUSED
4462 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4464 errno = ETIMEDOUT; /* Desperation time. */
4469 int save_errno = errno;
4471 PerlLIO_close(listener);
4472 if (connector != -1)
4473 PerlLIO_close(connector);
4475 PerlLIO_close(acceptor);
4481 /* In any case have a stub so that there's code corresponding
4482 * to the my_socketpair in global.sym. */
4484 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4485 #ifdef HAS_SOCKETPAIR
4486 return socketpair(family, type, protocol, fd);
4495 =for apidoc sv_nosharing
4497 Dummy routine which "shares" an SV when there is no sharing module present.
4498 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4499 some level of strict-ness.
4505 Perl_sv_nosharing(pTHX_ SV *sv)
4511 =for apidoc sv_nolocking
4513 Dummy routine which "locks" an SV when there is no locking module present.
4514 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4515 some level of strict-ness.
4521 Perl_sv_nolocking(pTHX_ SV *sv)
4528 =for apidoc sv_nounlocking
4530 Dummy routine which "unlocks" an SV when there is no locking module present.
4531 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4532 some level of strict-ness.
4538 Perl_sv_nounlocking(pTHX_ SV *sv)
4544 Perl_parse_unicode_opts(pTHX_ const char **popt)
4546 const char *p = *popt;
4551 opt = (U32) atoi(p);
4552 while (isDIGIT(*p)) p++;
4553 if (*p && *p != '\n' && *p != '\r')
4554 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4559 case PERL_UNICODE_STDIN:
4560 opt |= PERL_UNICODE_STDIN_FLAG; break;
4561 case PERL_UNICODE_STDOUT:
4562 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4563 case PERL_UNICODE_STDERR:
4564 opt |= PERL_UNICODE_STDERR_FLAG; break;
4565 case PERL_UNICODE_STD:
4566 opt |= PERL_UNICODE_STD_FLAG; break;
4567 case PERL_UNICODE_IN:
4568 opt |= PERL_UNICODE_IN_FLAG; break;
4569 case PERL_UNICODE_OUT:
4570 opt |= PERL_UNICODE_OUT_FLAG; break;
4571 case PERL_UNICODE_INOUT:
4572 opt |= PERL_UNICODE_INOUT_FLAG; break;
4573 case PERL_UNICODE_LOCALE:
4574 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4575 case PERL_UNICODE_ARGV:
4576 opt |= PERL_UNICODE_ARGV_FLAG; break;
4578 if (*p != '\n' && *p != '\r')
4580 "Unknown Unicode option letter '%c'", *p);
4586 opt = PERL_UNICODE_DEFAULT_FLAGS;
4588 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4589 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4590 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4601 * This is really just a quick hack which grabs various garbage
4602 * values. It really should be a real hash algorithm which
4603 * spreads the effect of every input bit onto every output bit,
4604 * if someone who knows about such things would bother to write it.
4605 * Might be a good idea to add that function to CORE as well.
4606 * No numbers below come from careful analysis or anything here,
4607 * except they are primes and SEED_C1 > 1E6 to get a full-width
4608 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4609 * probably be bigger too.
4612 # define SEED_C1 1000003
4613 #define SEED_C4 73819
4615 # define SEED_C1 25747
4616 #define SEED_C4 20639
4620 #define SEED_C5 26107
4622 #ifndef PERL_NO_DEV_RANDOM
4627 # include <starlet.h>
4628 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4629 * in 100-ns units, typically incremented ever 10 ms. */
4630 unsigned int when[2];
4632 # ifdef HAS_GETTIMEOFDAY
4633 struct timeval when;
4639 /* This test is an escape hatch, this symbol isn't set by Configure. */
4640 #ifndef PERL_NO_DEV_RANDOM
4641 #ifndef PERL_RANDOM_DEVICE
4642 /* /dev/random isn't used by default because reads from it will block
4643 * if there isn't enough entropy available. You can compile with
4644 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4645 * is enough real entropy to fill the seed. */
4646 # define PERL_RANDOM_DEVICE "/dev/urandom"
4648 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4650 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4659 _ckvmssts(sys$gettim(when));
4660 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4662 # ifdef HAS_GETTIMEOFDAY
4663 PerlProc_gettimeofday(&when,NULL);
4664 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4667 u = (U32)SEED_C1 * when;
4670 u += SEED_C3 * (U32)PerlProc_getpid();
4671 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4672 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4673 u += SEED_C5 * (U32)PTR2UV(&when);
4679 Perl_get_hash_seed(pTHX)
4681 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4685 while (isSPACE(*s)) s++;
4686 if (s && isDIGIT(*s))
4687 myseed = (UV)Atoul(s);
4689 #ifdef USE_HASH_SEED_EXPLICIT
4693 /* Compute a random seed */
4694 (void)seedDrand01((Rand_seed_t)seed());
4695 myseed = (UV)(Drand01() * (NV)UV_MAX);
4696 #if RANDBITS < (UVSIZE * 8)
4697 /* Since there are not enough randbits to to reach all
4698 * the bits of a UV, the low bits might need extra
4699 * help. Sum in another random number that will
4700 * fill in the low bits. */
4702 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4703 #endif /* RANDBITS < (UVSIZE * 8) */
4704 if (myseed == 0) { /* Superparanoia. */
4705 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4707 Perl_croak(aTHX_ "Your random numbers are not that random");
4710 PL_rehash_seed_set = TRUE;
4715 #ifdef PERL_GLOBAL_STRUCT
4718 Perl_init_global_struct(pTHX)
4720 struct perl_vars *plvarsp = NULL;
4721 #ifdef PERL_GLOBAL_STRUCT
4722 # define PERL_GLOBAL_STRUCT_INIT
4723 # include "opcode.h" /* the ppaddr and check */
4724 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4725 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4726 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4727 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4728 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4732 plvarsp = PL_VarsPtr;
4733 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4739 # define PERLVAR(var,type) /**/
4740 # define PERLVARA(var,n,type) /**/
4741 # define PERLVARI(var,type,init) plvarsp->var = init;
4742 # define PERLVARIC(var,type,init) plvarsp->var = init;
4743 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4744 # include "perlvars.h"
4750 # ifdef PERL_GLOBAL_STRUCT
4751 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4752 if (!plvarsp->Gppaddr)
4754 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4755 if (!plvarsp->Gcheck)
4757 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4758 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4760 # ifdef PERL_SET_VARS
4761 PERL_SET_VARS(plvarsp);
4763 # undef PERL_GLOBAL_STRUCT_INIT
4768 #endif /* PERL_GLOBAL_STRUCT */
4770 #ifdef PERL_GLOBAL_STRUCT
4773 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4775 #ifdef PERL_GLOBAL_STRUCT
4776 # ifdef PERL_UNSET_VARS
4777 PERL_UNSET_VARS(plvarsp);
4779 free(plvarsp->Gppaddr);
4780 free(plvarsp->Gcheck);
4781 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4787 #endif /* PERL_GLOBAL_STRUCT */
4791 * c-indentation-style: bsd
4793 * indent-tabs-mode: t
4796 * ex: set ts=8 sts=4 sw=4 noet: