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 # include <sys/wait.h>
39 # include <sys/select.h>
45 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
46 # define FD_CLOEXEC 1 /* NeXT needs this */
49 /* NOTE: Do not call the next three routines directly. Use the macros
50 * in handy.h, so that we can easily redefine everything to do tracking of
51 * allocated hunks back to the original New to track down any memory leaks.
52 * XXX This advice seems to be widely ignored :-( --AD August 1996.
55 /* paranoid version of system's malloc() */
58 Perl_safesysmalloc(MEM_SIZE size)
64 PerlIO_printf(Perl_error_log,
65 "Allocation too large: %lx\n", size) FLUSH;
68 #endif /* HAS_64K_LIMIT */
71 Perl_croak_nocontext("panic: malloc");
73 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
74 PERL_ALLOC_CHECK(ptr);
75 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
81 /* Can't use PerlIO to write as it allocates memory */
82 PerlLIO_write(PerlIO_fileno(Perl_error_log),
83 PL_no_mem, strlen(PL_no_mem));
90 /* paranoid version of system's realloc() */
93 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
97 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
98 Malloc_t PerlMem_realloc();
99 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
103 PerlIO_printf(Perl_error_log,
104 "Reallocation too large: %lx\n", size) FLUSH;
107 #endif /* HAS_64K_LIMIT */
114 return safesysmalloc(size);
117 Perl_croak_nocontext("panic: realloc");
119 ptr = (Malloc_t)PerlMem_realloc(where,size);
120 PERL_ALLOC_CHECK(ptr);
122 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
123 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
130 /* Can't use PerlIO to write as it allocates memory */
131 PerlLIO_write(PerlIO_fileno(Perl_error_log),
132 PL_no_mem, strlen(PL_no_mem));
139 /* safe version of system's free() */
142 Perl_safesysfree(Malloc_t where)
144 #ifdef PERL_IMPLICIT_SYS
147 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
154 /* safe version of system's calloc() */
157 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
163 if (size * count > 0xffff) {
164 PerlIO_printf(Perl_error_log,
165 "Allocation too large: %lx\n", size * count) FLUSH;
168 #endif /* HAS_64K_LIMIT */
170 if ((long)size < 0 || (long)count < 0)
171 Perl_croak_nocontext("panic: calloc");
174 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
175 PERL_ALLOC_CHECK(ptr);
176 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));
178 memset((void*)ptr, 0, size);
184 /* Can't use PerlIO to write as it allocates memory */
185 PerlLIO_write(PerlIO_fileno(Perl_error_log),
186 PL_no_mem, strlen(PL_no_mem));
193 /* These must be defined when not using Perl's malloc for binary
198 Malloc_t Perl_malloc (MEM_SIZE nbytes)
201 return (Malloc_t)PerlMem_malloc(nbytes);
204 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
207 return (Malloc_t)PerlMem_calloc(elements, size);
210 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
213 return (Malloc_t)PerlMem_realloc(where, nbytes);
216 Free_t Perl_mfree (Malloc_t where)
224 /* copy a string up to some (non-backslashed) delimiter, if any */
227 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
230 for (tolen = 0; from < fromend; from++, tolen++) {
232 if (from[1] == delim)
241 else if (*from == delim)
252 /* return ptr to little string in big string, NULL if not found */
253 /* This routine was donated by Corey Satten. */
256 Perl_instr(pTHX_ register const char *big, register const char *little)
258 register const char *s, *x;
269 for (x=big,s=little; *s; /**/ ) {
278 return (char*)(big-1);
283 /* same as instr but allow embedded nulls */
286 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
288 register const char *s, *x;
289 register const I32 first = *little;
290 register const char *littleend = lend;
292 if (!first && little >= littleend)
294 if (bigend - big < littleend - little)
296 bigend -= littleend - little++;
297 while (big <= bigend) {
300 for (x=big,s=little; s < littleend; /**/ ) {
307 return (char*)(big-1);
312 /* reverse of the above--find last substring */
315 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
317 register const char *bigbeg;
318 register const char *s, *x;
319 register const I32 first = *little;
320 register const char *littleend = lend;
322 if (!first && little >= littleend)
323 return (char*)bigend;
325 big = bigend - (littleend - little++);
326 while (big >= bigbeg) {
329 for (x=big+2,s=little; s < littleend; /**/ ) {
336 return (char*)(big+1);
341 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
343 /* As a space optimization, we do not compile tables for strings of length
344 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
345 special-cased in fbm_instr().
347 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
350 =head1 Miscellaneous Functions
352 =for apidoc fbm_compile
354 Analyses the string in order to make fast searches on it using fbm_instr()
355 -- the Boyer-Moore algorithm.
361 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
370 if (flags & FBMcf_TAIL) {
371 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
372 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
373 if (mg && mg->mg_len >= 0)
376 s = (U8*)SvPV_force(sv, len);
377 (void)SvUPGRADE(sv, SVt_PVBM);
378 if (len == 0) /* TAIL might be on a zero-length string. */
388 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
389 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
390 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
391 memset((void*)table, mlen, 256);
392 table[-1] = (U8)flags;
394 sb = s - mlen + 1; /* first char (maybe) */
396 if (table[*s] == mlen)
401 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
404 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
405 for (i = 0; i < len; i++) {
406 if (PL_freq[s[i]] < frequency) {
408 frequency = PL_freq[s[i]];
411 BmRARE(sv) = s[rarest];
412 BmPREVIOUS(sv) = (U16)rarest;
413 BmUSEFUL(sv) = 100; /* Initial value */
414 if (flags & FBMcf_TAIL)
416 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
417 BmRARE(sv),BmPREVIOUS(sv)));
420 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
421 /* If SvTAIL is actually due to \Z or \z, this gives false positives
425 =for apidoc fbm_instr
427 Returns the location of the SV in the string delimited by C<str> and
428 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
429 does not have to be fbm_compiled, but the search will not be as fast
436 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
438 register unsigned char *s;
440 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
441 register STRLEN littlelen = l;
442 register const I32 multiline = flags & FBMrf_MULTILINE;
444 if ((STRLEN)(bigend - big) < littlelen) {
445 if ( SvTAIL(littlestr)
446 && ((STRLEN)(bigend - big) == littlelen - 1)
448 || (*big == *little &&
449 memEQ(big, little, littlelen - 1))))
454 if (littlelen <= 2) { /* Special-cased */
456 if (littlelen == 1) {
457 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
458 /* Know that bigend != big. */
459 if (bigend[-1] == '\n')
460 return (char *)(bigend - 1);
461 return (char *) bigend;
469 if (SvTAIL(littlestr))
470 return (char *) bigend;
474 return (char*)big; /* Cannot be SvTAIL! */
477 if (SvTAIL(littlestr) && !multiline) {
478 if (bigend[-1] == '\n' && bigend[-2] == *little)
479 return (char*)bigend - 2;
480 if (bigend[-1] == *little)
481 return (char*)bigend - 1;
485 /* This should be better than FBM if c1 == c2, and almost
486 as good otherwise: maybe better since we do less indirection.
487 And we save a lot of memory by caching no table. */
488 register unsigned char c1 = little[0];
489 register unsigned char c2 = little[1];
494 while (s <= bigend) {
504 goto check_1char_anchor;
515 goto check_1char_anchor;
518 while (s <= bigend) {
523 goto check_1char_anchor;
532 check_1char_anchor: /* One char and anchor! */
533 if (SvTAIL(littlestr) && (*bigend == *little))
534 return (char *)bigend; /* bigend is already decremented. */
537 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
538 s = bigend - littlelen;
539 if (s >= big && bigend[-1] == '\n' && *s == *little
540 /* Automatically of length > 2 */
541 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
543 return (char*)s; /* how sweet it is */
546 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
548 return (char*)s + 1; /* how sweet it is */
552 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
553 char *b = ninstr((char*)big,(char*)bigend,
554 (char*)little, (char*)little + littlelen);
556 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
557 /* Chop \n from littlestr: */
558 s = bigend - littlelen + 1;
560 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
569 { /* Do actual FBM. */
570 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
571 register unsigned char *oldlittle;
573 if (littlelen > (STRLEN)(bigend - big))
575 --littlelen; /* Last char found by table lookup */
578 little += littlelen; /* last char */
585 if ((tmp = table[*s])) {
586 if ((s += tmp) < bigend)
590 else { /* less expensive than calling strncmp() */
591 register unsigned char *olds = s;
596 if (*--s == *--little)
598 s = olds + 1; /* here we pay the price for failure */
600 if (s < bigend) /* fake up continue to outer loop */
608 if ( s == bigend && (table[-1] & FBMcf_TAIL)
609 && memEQ((char *)(bigend - littlelen),
610 (char *)(oldlittle - littlelen), littlelen) )
611 return (char*)bigend - littlelen;
616 /* start_shift, end_shift are positive quantities which give offsets
617 of ends of some substring of bigstr.
618 If `last' we want the last occurrence.
619 old_posp is the way of communication between consequent calls if
620 the next call needs to find the .
621 The initial *old_posp should be -1.
623 Note that we take into account SvTAIL, so one can get extra
624 optimizations if _ALL flag is set.
627 /* If SvTAIL is actually due to \Z or \z, this gives false positives
628 if PL_multiline. In fact if !PL_multiline the authoritative answer
629 is not supported yet. */
632 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
634 register unsigned char *s, *x;
635 register unsigned char *big;
637 register I32 previous;
639 register unsigned char *little;
640 register I32 stop_pos;
641 register unsigned char *littleend;
645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
648 if ( BmRARE(littlestr) == '\n'
649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
650 little = (unsigned char *)(SvPVX(littlestr));
651 littleend = little + SvCUR(littlestr);
658 little = (unsigned char *)(SvPVX(littlestr));
659 littleend = little + SvCUR(littlestr);
661 /* The value of pos we can start at: */
662 previous = BmPREVIOUS(littlestr);
663 big = (unsigned char *)(SvPVX(bigstr));
664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
666 if (previous + start_shift > stop_pos) {
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
677 while (pos < previous + start_shift) {
678 if (!(pos += PL_screamnext[pos]))
683 if (pos >= stop_pos) break;
684 if (big[pos] != first)
686 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
692 if (s == littleend) {
694 if (!last) return (char *)(big+pos);
697 } while ( pos += PL_screamnext[pos] );
699 return (char *)(big+(*old_posp));
701 if (!SvTAIL(littlestr) || (end_shift > 0))
703 /* Ignore the trailing "\n". This code is not microoptimized */
704 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
705 stop_pos = littleend - little; /* Actual littlestr len */
710 && ((stop_pos == 1) ||
711 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
717 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
719 register const U8 *a = (const U8 *)s1;
720 register const U8 *b = (const U8 *)s2;
722 if (*a != *b && *a != PL_fold[*b])
730 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
732 register const U8 *a = (const U8 *)s1;
733 register const U8 *b = (const U8 *)s2;
735 if (*a != *b && *a != PL_fold_locale[*b])
742 /* copy a string to a safe spot */
745 =head1 Memory Management
749 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
750 string which is a duplicate of C<pv>. The size of the string is
751 determined by C<strlen()>. The memory allocated for the new string can
752 be freed with the C<Safefree()> function.
758 Perl_savepv(pTHX_ const char *pv)
760 register char *newaddr;
761 #ifdef PERL_MALLOC_WRAP
767 #ifdef PERL_MALLOC_WRAP
768 pvlen = strlen(pv)+1;
769 New(902,newaddr,pvlen,char);
771 New(902,newaddr,strlen(pv)+1,char);
773 return strcpy(newaddr,pv);
776 /* same thing but with a known length */
781 Perl's version of what C<strndup()> would be if it existed. Returns a
782 pointer to a newly allocated string which is a duplicate of the first
783 C<len> bytes from C<pv>. The memory allocated for the new string can be
784 freed with the C<Safefree()> function.
790 Perl_savepvn(pTHX_ const char *pv, register I32 len)
792 register char *newaddr;
794 New(903,newaddr,len+1,char);
795 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
797 /* might not be null terminated */
799 return CopyD(pv,newaddr,len,char);
802 return ZeroD(newaddr,len+1,char);
807 =for apidoc savesharedpv
809 A version of C<savepv()> which allocates the duplicate string in memory
810 which is shared between threads.
815 Perl_savesharedpv(pTHX_ const char *pv)
817 register char *newaddr;
821 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
823 PerlLIO_write(PerlIO_fileno(Perl_error_log),
824 PL_no_mem, strlen(PL_no_mem));
827 return strcpy(newaddr,pv);
833 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
834 the passed in SV using C<SvPV()>
840 Perl_savesvpv(pTHX_ SV *sv)
843 const char *pv = SvPV(sv, len);
844 register char *newaddr;
847 New(903,newaddr,len,char);
848 return CopyD(pv,newaddr,len,char);
852 /* the SV for Perl_form() and mess() is not kept in an arena */
861 return sv_2mortal(newSVpvn("",0));
866 /* Create as PVMG now, to avoid any upgrading later */
868 Newz(905, any, 1, XPVMG);
869 SvFLAGS(sv) = SVt_PVMG;
870 SvANY(sv) = (void*)any;
871 SvREFCNT(sv) = 1 << 30; /* practically infinite */
876 #if defined(PERL_IMPLICIT_CONTEXT)
878 Perl_form_nocontext(const char* pat, ...)
884 retval = vform(pat, &args);
888 #endif /* PERL_IMPLICIT_CONTEXT */
891 =head1 Miscellaneous Functions
894 Takes a sprintf-style format pattern and conventional
895 (non-SV) arguments and returns the formatted string.
897 (char *) Perl_form(pTHX_ const char* pat, ...)
899 can be used any place a string (char *) is required:
901 char * s = Perl_form("%d.%d",major,minor);
903 Uses a single private buffer so if you want to format several strings you
904 must explicitly copy the earlier strings away (and free the copies when you
911 Perl_form(pTHX_ const char* pat, ...)
916 retval = vform(pat, &args);
922 Perl_vform(pTHX_ const char *pat, va_list *args)
924 SV *sv = mess_alloc();
925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
929 #if defined(PERL_IMPLICIT_CONTEXT)
931 Perl_mess_nocontext(const char *pat, ...)
937 retval = vmess(pat, &args);
941 #endif /* PERL_IMPLICIT_CONTEXT */
944 Perl_mess(pTHX_ const char *pat, ...)
949 retval = vmess(pat, &args);
955 S_closest_cop(pTHX_ COP *cop, OP *o)
957 /* Look for PL_op starting from o. cop is the last COP we've seen. */
959 if (!o || o == PL_op) return cop;
961 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
967 /* If the OP_NEXTSTATE has been optimised away we can still use it
968 * the get the file and line number. */
970 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
973 /* Keep searching, and return when we've found something. */
975 new_cop = closest_cop(cop, kid);
976 if (new_cop) return new_cop;
986 Perl_vmess(pTHX_ const char *pat, va_list *args)
988 SV *sv = mess_alloc();
989 static char dgd[] = " during global destruction.\n";
991 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
992 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
995 * Try and find the file and line for PL_op. This will usually be
996 * PL_curcop, but it might be a cop that has been optimised away. We
997 * can try to find such a cop by searching through the optree starting
998 * from the sibling of PL_curcop.
1001 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1002 if (!cop) cop = PL_curcop;
1005 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1006 OutCopFILE(cop), (IV)CopLINE(cop));
1007 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1008 const bool line_mode = (RsSIMPLE(PL_rs) &&
1009 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1010 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1011 PL_last_in_gv == PL_argvgv ?
1012 "" : GvNAME(PL_last_in_gv),
1013 line_mode ? "line" : "chunk",
1014 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1016 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1022 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1027 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1028 && (io = GvIO(PL_stderrgv))
1029 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1036 SAVESPTR(PL_stderrgv);
1037 PL_stderrgv = Nullgv;
1039 PUSHSTACKi(PERLSI_MAGIC);
1043 PUSHs(SvTIED_obj((SV*)io, mg));
1044 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1046 call_method("PRINT", G_SCALAR);
1054 /* SFIO can really mess with your errno */
1057 PerlIO *serr = Perl_error_log;
1059 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1060 (void)PerlIO_flush(serr);
1067 /* Common code used by vcroak, vdie and vwarner */
1069 void S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8);
1072 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1078 SV *msv = vmess(pat, args);
1079 if (PL_errors && SvCUR(PL_errors)) {
1080 sv_catsv(PL_errors, msv);
1081 message = SvPV(PL_errors, *msglen);
1082 SvCUR_set(PL_errors, 0);
1085 message = SvPV(msv,*msglen);
1086 *utf8 = SvUTF8(msv);
1092 DEBUG_S(PerlIO_printf(Perl_debug_log,
1093 "%p: die/croak: message = %s\ndiehook = %p\n",
1094 thr, message, PL_diehook));
1096 S_vdie_common(aTHX_ message, *msglen, *utf8);
1102 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1107 /* sv_2cv might call Perl_croak() */
1108 SV *olddiehook = PL_diehook;
1112 SAVESPTR(PL_diehook);
1113 PL_diehook = Nullsv;
1114 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1116 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1123 msg = newSVpvn(message, msglen);
1124 SvFLAGS(msg) |= utf8;
1132 PUSHSTACKi(PERLSI_DIEHOOK);
1136 call_sv((SV*)cv, G_DISCARD);
1143 Perl_vdie(pTHX_ const char* pat, va_list *args)
1146 const int was_in_eval = PL_in_eval;
1150 DEBUG_S(PerlIO_printf(Perl_debug_log,
1151 "%p: die: curstack = %p, mainstack = %p\n",
1152 thr, PL_curstack, PL_mainstack));
1154 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1156 PL_restartop = die_where(message, msglen);
1157 SvFLAGS(ERRSV) |= utf8;
1158 DEBUG_S(PerlIO_printf(Perl_debug_log,
1159 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1160 thr, PL_restartop, was_in_eval, PL_top_env));
1161 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1163 return PL_restartop;
1166 #if defined(PERL_IMPLICIT_CONTEXT)
1168 Perl_die_nocontext(const char* pat, ...)
1173 va_start(args, pat);
1174 o = vdie(pat, &args);
1178 #endif /* PERL_IMPLICIT_CONTEXT */
1181 Perl_die(pTHX_ const char* pat, ...)
1185 va_start(args, pat);
1186 o = vdie(pat, &args);
1192 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1198 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1201 PL_restartop = die_where(message, msglen);
1202 SvFLAGS(ERRSV) |= utf8;
1206 message = SvPVx(ERRSV, msglen);
1208 write_to_stderr(message, msglen);
1212 #if defined(PERL_IMPLICIT_CONTEXT)
1214 Perl_croak_nocontext(const char *pat, ...)
1218 va_start(args, pat);
1223 #endif /* PERL_IMPLICIT_CONTEXT */
1226 =head1 Warning and Dieing
1230 This is the XSUB-writer's interface to Perl's C<die> function.
1231 Normally call this function the same way you call the C C<printf>
1232 function. Calling C<croak> returns control directly to Perl,
1233 sidestepping the normal C order of execution. See C<warn>.
1235 If you want to throw an exception object, assign the object to
1236 C<$@> and then pass C<Nullch> to croak():
1238 errsv = get_sv("@", TRUE);
1239 sv_setsv(errsv, exception_object);
1246 Perl_croak(pTHX_ const char *pat, ...)
1249 va_start(args, pat);
1256 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1266 msv = vmess(pat, args);
1268 message = SvPV(msv, msglen);
1271 /* sv_2cv might call Perl_warn() */
1272 SV *oldwarnhook = PL_warnhook;
1274 SAVESPTR(PL_warnhook);
1275 PL_warnhook = Nullsv;
1276 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1278 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1284 msg = newSVpvn(message, msglen);
1285 SvFLAGS(msg) |= utf8;
1289 PUSHSTACKi(PERLSI_WARNHOOK);
1293 call_sv((SV*)cv, G_DISCARD);
1300 write_to_stderr(message, msglen);
1303 #if defined(PERL_IMPLICIT_CONTEXT)
1305 Perl_warn_nocontext(const char *pat, ...)
1309 va_start(args, pat);
1313 #endif /* PERL_IMPLICIT_CONTEXT */
1318 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1319 function the same way you call the C C<printf> function. See C<croak>.
1325 Perl_warn(pTHX_ const char *pat, ...)
1328 va_start(args, pat);
1333 #if defined(PERL_IMPLICIT_CONTEXT)
1335 Perl_warner_nocontext(U32 err, const char *pat, ...)
1339 va_start(args, pat);
1340 vwarner(err, pat, &args);
1343 #endif /* PERL_IMPLICIT_CONTEXT */
1346 Perl_warner(pTHX_ U32 err, const char* pat,...)
1349 va_start(args, pat);
1350 vwarner(err, pat, &args);
1355 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1358 SV *msv = vmess(pat, args);
1360 const char *message = SvPV(msv, msglen);
1361 I32 utf8 = SvUTF8(msv);
1365 S_vdie_common(aTHX_ message, msglen, utf8);
1368 PL_restartop = die_where(message, msglen);
1369 SvFLAGS(ERRSV) |= utf8;
1372 write_to_stderr(message, msglen);
1376 Perl_vwarn(aTHX_ pat, args);
1380 /* since we've already done strlen() for both nam and val
1381 * we can use that info to make things faster than
1382 * sprintf(s, "%s=%s", nam, val)
1384 #define my_setenv_format(s, nam, nlen, val, vlen) \
1385 Copy(nam, s, nlen, char); \
1387 Copy(val, s+(nlen+1), vlen, char); \
1388 *(s+(nlen+1+vlen)) = '\0'
1390 #ifdef USE_ENVIRON_ARRAY
1391 /* VMS' my_setenv() is in vms.c */
1392 #if !defined(WIN32) && !defined(NETWARE)
1394 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1397 /* only parent thread can modify process environment */
1398 if (PL_curinterp == aTHX)
1401 #ifndef PERL_USE_SAFE_PUTENV
1402 if (!PL_use_safe_putenv) {
1403 /* most putenv()s leak, so we manipulate environ directly */
1404 register I32 i=setenv_getix(nam); /* where does it go? */
1407 if (environ == PL_origenviron) { /* need we copy environment? */
1413 for (max = i; environ[max]; max++) ;
1414 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1415 for (j=0; j<max; j++) { /* copy environment */
1416 const int len = strlen(environ[j]);
1417 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1418 Copy(environ[j], tmpenv[j], len+1, char);
1420 tmpenv[max] = Nullch;
1421 environ = tmpenv; /* tell exec where it is now */
1424 safesysfree(environ[i]);
1425 while (environ[i]) {
1426 environ[i] = environ[i+1];
1431 if (!environ[i]) { /* does not exist yet */
1432 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1433 environ[i+1] = Nullch; /* make sure it's null terminated */
1436 safesysfree(environ[i]);
1440 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1441 /* all that work just for this */
1442 my_setenv_format(environ[i], nam, nlen, val, vlen);
1445 # if defined(__CYGWIN__) || defined( EPOC)
1446 setenv(nam, val, 1);
1449 int nlen = strlen(nam), vlen;
1454 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1455 /* all that work just for this */
1456 my_setenv_format(new_env, nam, nlen, val, vlen);
1457 (void)putenv(new_env);
1458 # endif /* __CYGWIN__ */
1459 #ifndef PERL_USE_SAFE_PUTENV
1465 #else /* WIN32 || NETWARE */
1468 Perl_my_setenv(pTHX_ const char *nam, char *val)
1470 register char *envstr;
1471 const int nlen = strlen(nam);
1478 New(904, envstr, nlen+vlen+2, char);
1479 my_setenv_format(envstr, nam, nlen, val, vlen);
1480 (void)PerlEnv_putenv(envstr);
1484 #endif /* WIN32 || NETWARE */
1488 Perl_setenv_getix(pTHX_ const char *nam)
1490 register I32 i, len = strlen(nam);
1492 for (i = 0; environ[i]; i++) {
1495 strnicmp(environ[i],nam,len) == 0
1497 strnEQ(environ[i],nam,len)
1499 && environ[i][len] == '=')
1500 break; /* strnEQ must come first to avoid */
1501 } /* potential SEGV's */
1504 #endif /* !PERL_MICRO */
1506 #endif /* !VMS && !EPOC*/
1508 #ifdef UNLINK_ALL_VERSIONS
1510 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1514 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1519 /* this is a drop-in replacement for bcopy() */
1520 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1522 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1526 if (from - to >= 0) {
1534 *(--to) = *(--from);
1540 /* this is a drop-in replacement for memset() */
1543 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1553 /* this is a drop-in replacement for bzero() */
1554 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1556 Perl_my_bzero(register char *loc, register I32 len)
1566 /* this is a drop-in replacement for memcmp() */
1567 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1569 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1571 register const U8 *a = (const U8 *)s1;
1572 register const U8 *b = (const U8 *)s2;
1576 if (tmp = *a++ - *b++)
1581 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1585 #ifdef USE_CHAR_VSPRINTF
1590 vsprintf(char *dest, const char *pat, char *args)
1594 fakebuf._ptr = dest;
1595 fakebuf._cnt = 32767;
1599 fakebuf._flag = _IOWRT|_IOSTRG;
1600 _doprnt(pat, args, &fakebuf); /* what a kludge */
1601 (void)putc('\0', &fakebuf);
1602 #ifdef USE_CHAR_VSPRINTF
1605 return 0; /* perl doesn't use return value */
1609 #endif /* HAS_VPRINTF */
1612 #if BYTEORDER != 0x4321
1614 Perl_my_swap(pTHX_ short s)
1616 #if (BYTEORDER & 1) == 0
1619 result = ((s & 255) << 8) + ((s >> 8) & 255);
1627 Perl_my_htonl(pTHX_ long l)
1631 char c[sizeof(long)];
1634 #if BYTEORDER == 0x1234
1635 u.c[0] = (l >> 24) & 255;
1636 u.c[1] = (l >> 16) & 255;
1637 u.c[2] = (l >> 8) & 255;
1641 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1642 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1647 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1648 u.c[o & 0xf] = (l >> s) & 255;
1656 Perl_my_ntohl(pTHX_ long l)
1660 char c[sizeof(long)];
1663 #if BYTEORDER == 0x1234
1664 u.c[0] = (l >> 24) & 255;
1665 u.c[1] = (l >> 16) & 255;
1666 u.c[2] = (l >> 8) & 255;
1670 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1671 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1678 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1679 l |= (u.c[o & 0xf] & 255) << s;
1686 #endif /* BYTEORDER != 0x4321 */
1690 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1691 * If these functions are defined,
1692 * the BYTEORDER is neither 0x1234 nor 0x4321.
1693 * However, this is not assumed.
1697 #define HTOLE(name,type) \
1699 name (register type n) \
1703 char c[sizeof(type)]; \
1706 register I32 s = 0; \
1707 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1708 u.c[i] = (n >> s) & 0xFF; \
1713 #define LETOH(name,type) \
1715 name (register type n) \
1719 char c[sizeof(type)]; \
1722 register I32 s = 0; \
1725 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1726 n |= ((type)(u.c[i] & 0xFF)) << s; \
1732 * Big-endian byte order functions.
1735 #define HTOBE(name,type) \
1737 name (register type n) \
1741 char c[sizeof(type)]; \
1744 register I32 s = 8*(sizeof(u.c)-1); \
1745 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1746 u.c[i] = (n >> s) & 0xFF; \
1751 #define BETOH(name,type) \
1753 name (register type n) \
1757 char c[sizeof(type)]; \
1760 register I32 s = 8*(sizeof(u.c)-1); \
1763 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1764 n |= ((type)(u.c[i] & 0xFF)) << s; \
1770 * If we just can't do it...
1773 #define NOT_AVAIL(name,type) \
1775 name (register type n) \
1777 Perl_croak_nocontext(#name "() not available"); \
1778 return n; /* not reached */ \
1782 #if defined(HAS_HTOVS) && !defined(htovs)
1785 #if defined(HAS_HTOVL) && !defined(htovl)
1788 #if defined(HAS_VTOHS) && !defined(vtohs)
1791 #if defined(HAS_VTOHL) && !defined(vtohl)
1795 #ifdef PERL_NEED_MY_HTOLE16
1797 HTOLE(Perl_my_htole16,U16)
1799 NOT_AVAIL(Perl_my_htole16,U16)
1802 #ifdef PERL_NEED_MY_LETOH16
1804 LETOH(Perl_my_letoh16,U16)
1806 NOT_AVAIL(Perl_my_letoh16,U16)
1809 #ifdef PERL_NEED_MY_HTOBE16
1811 HTOBE(Perl_my_htobe16,U16)
1813 NOT_AVAIL(Perl_my_htobe16,U16)
1816 #ifdef PERL_NEED_MY_BETOH16
1818 BETOH(Perl_my_betoh16,U16)
1820 NOT_AVAIL(Perl_my_betoh16,U16)
1824 #ifdef PERL_NEED_MY_HTOLE32
1826 HTOLE(Perl_my_htole32,U32)
1828 NOT_AVAIL(Perl_my_htole32,U32)
1831 #ifdef PERL_NEED_MY_LETOH32
1833 LETOH(Perl_my_letoh32,U32)
1835 NOT_AVAIL(Perl_my_letoh32,U32)
1838 #ifdef PERL_NEED_MY_HTOBE32
1840 HTOBE(Perl_my_htobe32,U32)
1842 NOT_AVAIL(Perl_my_htobe32,U32)
1845 #ifdef PERL_NEED_MY_BETOH32
1847 BETOH(Perl_my_betoh32,U32)
1849 NOT_AVAIL(Perl_my_betoh32,U32)
1853 #ifdef PERL_NEED_MY_HTOLE64
1855 HTOLE(Perl_my_htole64,U64)
1857 NOT_AVAIL(Perl_my_htole64,U64)
1860 #ifdef PERL_NEED_MY_LETOH64
1862 LETOH(Perl_my_letoh64,U64)
1864 NOT_AVAIL(Perl_my_letoh64,U64)
1867 #ifdef PERL_NEED_MY_HTOBE64
1869 HTOBE(Perl_my_htobe64,U64)
1871 NOT_AVAIL(Perl_my_htobe64,U64)
1874 #ifdef PERL_NEED_MY_BETOH64
1876 BETOH(Perl_my_betoh64,U64)
1878 NOT_AVAIL(Perl_my_betoh64,U64)
1882 #ifdef PERL_NEED_MY_HTOLES
1883 HTOLE(Perl_my_htoles,short)
1885 #ifdef PERL_NEED_MY_LETOHS
1886 LETOH(Perl_my_letohs,short)
1888 #ifdef PERL_NEED_MY_HTOBES
1889 HTOBE(Perl_my_htobes,short)
1891 #ifdef PERL_NEED_MY_BETOHS
1892 BETOH(Perl_my_betohs,short)
1895 #ifdef PERL_NEED_MY_HTOLEI
1896 HTOLE(Perl_my_htolei,int)
1898 #ifdef PERL_NEED_MY_LETOHI
1899 LETOH(Perl_my_letohi,int)
1901 #ifdef PERL_NEED_MY_HTOBEI
1902 HTOBE(Perl_my_htobei,int)
1904 #ifdef PERL_NEED_MY_BETOHI
1905 BETOH(Perl_my_betohi,int)
1908 #ifdef PERL_NEED_MY_HTOLEL
1909 HTOLE(Perl_my_htolel,long)
1911 #ifdef PERL_NEED_MY_LETOHL
1912 LETOH(Perl_my_letohl,long)
1914 #ifdef PERL_NEED_MY_HTOBEL
1915 HTOBE(Perl_my_htobel,long)
1917 #ifdef PERL_NEED_MY_BETOHL
1918 BETOH(Perl_my_betohl,long)
1922 Perl_my_swabn(void *ptr, int n)
1924 register char *s = (char *)ptr;
1925 register char *e = s + (n-1);
1928 for (n /= 2; n > 0; s++, e--, n--) {
1936 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1938 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1940 register I32 This, that;
1946 PERL_FLUSHALL_FOR_CHILD;
1947 This = (*mode == 'w');
1951 taint_proper("Insecure %s%s", "EXEC");
1953 if (PerlProc_pipe(p) < 0)
1955 /* Try for another pipe pair for error return */
1956 if (PerlProc_pipe(pp) >= 0)
1958 while ((pid = PerlProc_fork()) < 0) {
1959 if (errno != EAGAIN) {
1960 PerlLIO_close(p[This]);
1961 PerlLIO_close(p[that]);
1963 PerlLIO_close(pp[0]);
1964 PerlLIO_close(pp[1]);
1976 /* Close parent's end of error status pipe (if any) */
1978 PerlLIO_close(pp[0]);
1979 #if defined(HAS_FCNTL) && defined(F_SETFD)
1980 /* Close error pipe automatically if exec works */
1981 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1984 /* Now dup our end of _the_ pipe to right position */
1985 if (p[THIS] != (*mode == 'r')) {
1986 PerlLIO_dup2(p[THIS], *mode == 'r');
1987 PerlLIO_close(p[THIS]);
1988 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1989 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1992 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1993 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1994 /* No automatic close - do it by hand */
2001 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2007 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2013 do_execfree(); /* free any memory malloced by child on fork */
2015 PerlLIO_close(pp[1]);
2016 /* Keep the lower of the two fd numbers */
2017 if (p[that] < p[This]) {
2018 PerlLIO_dup2(p[This], p[that]);
2019 PerlLIO_close(p[This]);
2023 PerlLIO_close(p[that]); /* close child's end of pipe */
2026 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2028 (void)SvUPGRADE(sv,SVt_IV);
2030 PL_forkprocess = pid;
2031 /* If we managed to get status pipe check for exec fail */
2032 if (did_pipes && pid > 0) {
2036 while (n < sizeof(int)) {
2037 n1 = PerlLIO_read(pp[0],
2038 (void*)(((char*)&errkid)+n),
2044 PerlLIO_close(pp[0]);
2046 if (n) { /* Error */
2048 PerlLIO_close(p[This]);
2049 if (n != sizeof(int))
2050 Perl_croak(aTHX_ "panic: kid popen errno read");
2052 pid2 = wait4pid(pid, &status, 0);
2053 } while (pid2 == -1 && errno == EINTR);
2054 errno = errkid; /* Propagate errno from kid */
2059 PerlLIO_close(pp[0]);
2060 return PerlIO_fdopen(p[This], mode);
2062 Perl_croak(aTHX_ "List form of piped open not implemented");
2063 return (PerlIO *) NULL;
2067 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2068 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2070 Perl_my_popen(pTHX_ char *cmd, char *mode)
2073 register I32 This, that;
2076 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2080 PERL_FLUSHALL_FOR_CHILD;
2083 return my_syspopen(aTHX_ cmd,mode);
2086 This = (*mode == 'w');
2088 if (doexec && PL_tainting) {
2090 taint_proper("Insecure %s%s", "EXEC");
2092 if (PerlProc_pipe(p) < 0)
2094 if (doexec && PerlProc_pipe(pp) >= 0)
2096 while ((pid = PerlProc_fork()) < 0) {
2097 if (errno != EAGAIN) {
2098 PerlLIO_close(p[This]);
2099 PerlLIO_close(p[that]);
2101 PerlLIO_close(pp[0]);
2102 PerlLIO_close(pp[1]);
2105 Perl_croak(aTHX_ "Can't fork");
2118 PerlLIO_close(pp[0]);
2119 #if defined(HAS_FCNTL) && defined(F_SETFD)
2120 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2123 if (p[THIS] != (*mode == 'r')) {
2124 PerlLIO_dup2(p[THIS], *mode == 'r');
2125 PerlLIO_close(p[THIS]);
2126 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2127 PerlLIO_close(p[THAT]);
2130 PerlLIO_close(p[THAT]);
2133 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2142 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2147 /* may or may not use the shell */
2148 do_exec3(cmd, pp[1], did_pipes);
2151 #endif /* defined OS2 */
2153 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2154 SvREADONLY_off(GvSV(tmpgv));
2155 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2156 SvREADONLY_on(GvSV(tmpgv));
2158 #ifdef THREADS_HAVE_PIDS
2159 PL_ppid = (IV)getppid();
2162 hv_clear(PL_pidstatus); /* we have no children */
2167 do_execfree(); /* free any memory malloced by child on vfork */
2169 PerlLIO_close(pp[1]);
2170 if (p[that] < p[This]) {
2171 PerlLIO_dup2(p[This], p[that]);
2172 PerlLIO_close(p[This]);
2176 PerlLIO_close(p[that]);
2179 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2181 (void)SvUPGRADE(sv,SVt_IV);
2183 PL_forkprocess = pid;
2184 if (did_pipes && pid > 0) {
2188 while (n < sizeof(int)) {
2189 n1 = PerlLIO_read(pp[0],
2190 (void*)(((char*)&errkid)+n),
2196 PerlLIO_close(pp[0]);
2198 if (n) { /* Error */
2200 PerlLIO_close(p[This]);
2201 if (n != sizeof(int))
2202 Perl_croak(aTHX_ "panic: kid popen errno read");
2204 pid2 = wait4pid(pid, &status, 0);
2205 } while (pid2 == -1 && errno == EINTR);
2206 errno = errkid; /* Propagate errno from kid */
2211 PerlLIO_close(pp[0]);
2212 return PerlIO_fdopen(p[This], mode);
2215 #if defined(atarist) || defined(EPOC)
2218 Perl_my_popen(pTHX_ char *cmd, char *mode)
2220 PERL_FLUSHALL_FOR_CHILD;
2221 /* Call system's popen() to get a FILE *, then import it.
2222 used 0 for 2nd parameter to PerlIO_importFILE;
2225 return PerlIO_importFILE(popen(cmd, mode), 0);
2229 FILE *djgpp_popen();
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(djgpp_popen(cmd, mode), 0);
2243 #endif /* !DOSISH */
2245 /* this is called in parent before the fork() */
2247 Perl_atfork_lock(void)
2249 #if defined(USE_ITHREADS)
2250 /* locks must be held in locking order (if any) */
2252 MUTEX_LOCK(&PL_malloc_mutex);
2258 /* this is called in both parent and child after the fork() */
2260 Perl_atfork_unlock(void)
2262 #if defined(USE_ITHREADS)
2263 /* locks must be released in same order as in atfork_lock() */
2265 MUTEX_UNLOCK(&PL_malloc_mutex);
2274 #if defined(HAS_FORK)
2276 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2281 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2282 * handlers elsewhere in the code */
2287 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2288 Perl_croak_nocontext("fork() not available");
2290 #endif /* HAS_FORK */
2295 Perl_dump_fds(pTHX_ char *s)
2300 PerlIO_printf(Perl_debug_log,"%s", s);
2301 for (fd = 0; fd < 32; fd++) {
2302 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2303 PerlIO_printf(Perl_debug_log," %d",fd);
2305 PerlIO_printf(Perl_debug_log,"\n");
2307 #endif /* DUMP_FDS */
2311 dup2(int oldfd, int newfd)
2313 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2316 PerlLIO_close(newfd);
2317 return fcntl(oldfd, F_DUPFD, newfd);
2319 #define DUP2_MAX_FDS 256
2320 int fdtmp[DUP2_MAX_FDS];
2326 PerlLIO_close(newfd);
2327 /* good enough for low fd's... */
2328 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2329 if (fdx >= DUP2_MAX_FDS) {
2337 PerlLIO_close(fdtmp[--fdx]);
2344 #ifdef HAS_SIGACTION
2346 #ifdef MACOS_TRADITIONAL
2347 /* We don't want restart behavior on MacOS */
2352 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2354 struct sigaction act, oact;
2357 /* only "parent" interpreter can diddle signals */
2358 if (PL_curinterp != aTHX)
2362 act.sa_handler = handler;
2363 sigemptyset(&act.sa_mask);
2366 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2367 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2369 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2370 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2371 act.sa_flags |= SA_NOCLDWAIT;
2373 if (sigaction(signo, &act, &oact) == -1)
2376 return oact.sa_handler;
2380 Perl_rsignal_state(pTHX_ int signo)
2382 struct sigaction oact;
2384 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2387 return oact.sa_handler;
2391 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2393 struct sigaction act;
2396 /* only "parent" interpreter can diddle signals */
2397 if (PL_curinterp != aTHX)
2401 act.sa_handler = handler;
2402 sigemptyset(&act.sa_mask);
2405 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2406 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2408 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2409 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2410 act.sa_flags |= SA_NOCLDWAIT;
2412 return sigaction(signo, &act, save);
2416 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2419 /* only "parent" interpreter can diddle signals */
2420 if (PL_curinterp != aTHX)
2424 return sigaction(signo, save, (struct sigaction *)NULL);
2427 #else /* !HAS_SIGACTION */
2430 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2432 #if defined(USE_ITHREADS) && !defined(WIN32)
2433 /* only "parent" interpreter can diddle signals */
2434 if (PL_curinterp != aTHX)
2438 return PerlProc_signal(signo, handler);
2441 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2442 ignore the implications of this for threading */
2452 Perl_rsignal_state(pTHX_ int signo)
2454 Sighandler_t oldsig;
2456 #if defined(USE_ITHREADS) && !defined(WIN32)
2457 /* only "parent" interpreter can diddle signals */
2458 if (PL_curinterp != aTHX)
2463 oldsig = PerlProc_signal(signo, sig_trap);
2464 PerlProc_signal(signo, oldsig);
2466 PerlProc_kill(PerlProc_getpid(), signo);
2471 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2473 #if defined(USE_ITHREADS) && !defined(WIN32)
2474 /* only "parent" interpreter can diddle signals */
2475 if (PL_curinterp != aTHX)
2478 *save = PerlProc_signal(signo, handler);
2479 return (*save == SIG_ERR) ? -1 : 0;
2483 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2485 #if defined(USE_ITHREADS) && !defined(WIN32)
2486 /* only "parent" interpreter can diddle signals */
2487 if (PL_curinterp != aTHX)
2490 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2493 #endif /* !HAS_SIGACTION */
2494 #endif /* !PERL_MICRO */
2496 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2497 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2499 Perl_my_pclose(pTHX_ PerlIO *ptr)
2501 Sigsave_t hstat, istat, qstat;
2507 int saved_errno = 0;
2509 int saved_vaxc_errno;
2512 int saved_win32_errno;
2516 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2518 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2520 *svp = &PL_sv_undef;
2522 if (pid == -1) { /* Opened by popen. */
2523 return my_syspclose(ptr);
2526 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2527 saved_errno = errno;
2529 saved_vaxc_errno = vaxc$errno;
2532 saved_win32_errno = GetLastError();
2536 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2539 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2540 rsignal_save(SIGINT, SIG_IGN, &istat);
2541 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2544 pid2 = wait4pid(pid, &status, 0);
2545 } while (pid2 == -1 && errno == EINTR);
2547 rsignal_restore(SIGHUP, &hstat);
2548 rsignal_restore(SIGINT, &istat);
2549 rsignal_restore(SIGQUIT, &qstat);
2552 SETERRNO(saved_errno, saved_vaxc_errno);
2555 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2557 #endif /* !DOSISH */
2559 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2561 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2566 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2570 char spid[TYPE_CHARS(IV)];
2573 sprintf(spid, "%"IVdf, (IV)pid);
2574 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2575 if (svp && *svp != &PL_sv_undef) {
2576 *statusp = SvIVX(*svp);
2577 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2584 hv_iterinit(PL_pidstatus);
2585 if ((entry = hv_iternext(PL_pidstatus))) {
2586 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2587 sv = hv_iterval(PL_pidstatus,entry);
2588 *statusp = SvIVX(sv);
2589 sprintf(spid, "%"IVdf, (IV)pid);
2590 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2597 # ifdef HAS_WAITPID_RUNTIME
2598 if (!HAS_WAITPID_RUNTIME)
2601 result = PerlProc_waitpid(pid,statusp,flags);
2604 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2605 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2608 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2612 Perl_croak(aTHX_ "Can't do waitpid with flags");
2614 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2615 pidgone(result,*statusp);
2622 if (result < 0 && errno == EINTR) {
2627 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2631 Perl_pidgone(pTHX_ Pid_t pid, int status)
2634 char spid[TYPE_CHARS(IV)];
2636 sprintf(spid, "%"IVdf, (IV)pid);
2637 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2638 (void)SvUPGRADE(sv,SVt_IV);
2643 #if defined(atarist) || defined(OS2) || defined(EPOC)
2646 int /* Cannot prototype with I32
2648 my_syspclose(PerlIO *ptr)
2651 Perl_my_pclose(pTHX_ PerlIO *ptr)
2654 /* Needs work for PerlIO ! */
2655 FILE *f = PerlIO_findFILE(ptr);
2656 I32 result = pclose(f);
2657 PerlIO_releaseFILE(ptr,f);
2665 Perl_my_pclose(pTHX_ PerlIO *ptr)
2667 /* Needs work for PerlIO ! */
2668 FILE *f = PerlIO_findFILE(ptr);
2669 I32 result = djgpp_pclose(f);
2670 result = (result << 8) & 0xff00;
2671 PerlIO_releaseFILE(ptr,f);
2677 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2680 register const char *frombase = from;
2683 register const char c = *from;
2688 while (count-- > 0) {
2689 for (todo = len; todo > 0; todo--) {
2698 Perl_same_dirent(pTHX_ char *a, char *b)
2700 char *fa = strrchr(a,'/');
2701 char *fb = strrchr(b,'/');
2704 SV *tmpsv = sv_newmortal();
2717 sv_setpv(tmpsv, ".");
2719 sv_setpvn(tmpsv, a, fa - a);
2720 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2723 sv_setpv(tmpsv, ".");
2725 sv_setpvn(tmpsv, b, fb - b);
2726 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2728 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2729 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2731 #endif /* !HAS_RENAME */
2734 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2736 const char *xfound = Nullch;
2737 char *xfailed = Nullch;
2738 char tmpbuf[MAXPATHLEN];
2742 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2743 # define SEARCH_EXTS ".bat", ".cmd", NULL
2744 # define MAX_EXT_LEN 4
2747 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2748 # define MAX_EXT_LEN 4
2751 # define SEARCH_EXTS ".pl", ".com", NULL
2752 # define MAX_EXT_LEN 4
2754 /* additional extensions to try in each dir if scriptname not found */
2756 const char *exts[] = { SEARCH_EXTS };
2757 const char **ext = search_ext ? search_ext : exts;
2758 int extidx = 0, i = 0;
2759 const char *curext = Nullch;
2761 # define MAX_EXT_LEN 0
2765 * If dosearch is true and if scriptname does not contain path
2766 * delimiters, search the PATH for scriptname.
2768 * If SEARCH_EXTS is also defined, will look for each
2769 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2770 * while searching the PATH.
2772 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2773 * proceeds as follows:
2774 * If DOSISH or VMSISH:
2775 * + look for ./scriptname{,.foo,.bar}
2776 * + search the PATH for scriptname{,.foo,.bar}
2779 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2780 * this will not look in '.' if it's not in the PATH)
2785 # ifdef ALWAYS_DEFTYPES
2786 len = strlen(scriptname);
2787 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2788 int hasdir, idx = 0, deftypes = 1;
2791 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2794 int hasdir, idx = 0, deftypes = 1;
2797 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2799 /* The first time through, just add SEARCH_EXTS to whatever we
2800 * already have, so we can check for default file types. */
2802 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2808 if ((strlen(tmpbuf) + strlen(scriptname)
2809 + MAX_EXT_LEN) >= sizeof tmpbuf)
2810 continue; /* don't search dir with too-long name */
2811 strcat(tmpbuf, scriptname);
2815 if (strEQ(scriptname, "-"))
2817 if (dosearch) { /* Look in '.' first. */
2818 char *cur = scriptname;
2820 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2822 if (strEQ(ext[i++],curext)) {
2823 extidx = -1; /* already has an ext */
2828 DEBUG_p(PerlIO_printf(Perl_debug_log,
2829 "Looking for %s\n",cur));
2830 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2831 && !S_ISDIR(PL_statbuf.st_mode)) {
2839 if (cur == scriptname) {
2840 len = strlen(scriptname);
2841 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2843 cur = strcpy(tmpbuf, scriptname);
2845 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2846 && strcpy(tmpbuf+len, ext[extidx++]));
2851 #ifdef MACOS_TRADITIONAL
2852 if (dosearch && !strchr(scriptname, ':') &&
2853 (s = PerlEnv_getenv("Commands")))
2855 if (dosearch && !strchr(scriptname, '/')
2857 && !strchr(scriptname, '\\')
2859 && (s = PerlEnv_getenv("PATH")))
2864 PL_bufend = s + strlen(s);
2865 while (s < PL_bufend) {
2866 #ifdef MACOS_TRADITIONAL
2867 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2871 #if defined(atarist) || defined(DOSISH)
2876 && *s != ';'; len++, s++) {
2877 if (len < sizeof tmpbuf)
2880 if (len < sizeof tmpbuf)
2882 #else /* ! (atarist || DOSISH) */
2883 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2886 #endif /* ! (atarist || DOSISH) */
2887 #endif /* MACOS_TRADITIONAL */
2890 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2891 continue; /* don't search dir with too-long name */
2892 #ifdef MACOS_TRADITIONAL
2893 if (len && tmpbuf[len - 1] != ':')
2894 tmpbuf[len++] = ':';
2897 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2898 && tmpbuf[len - 1] != '/'
2899 && tmpbuf[len - 1] != '\\'
2902 tmpbuf[len++] = '/';
2903 if (len == 2 && tmpbuf[0] == '.')
2906 (void)strcpy(tmpbuf + len, scriptname);
2910 len = strlen(tmpbuf);
2911 if (extidx > 0) /* reset after previous loop */
2915 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2916 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2917 if (S_ISDIR(PL_statbuf.st_mode)) {
2921 } while ( retval < 0 /* not there */
2922 && extidx>=0 && ext[extidx] /* try an extension? */
2923 && strcpy(tmpbuf+len, ext[extidx++])
2928 if (S_ISREG(PL_statbuf.st_mode)
2929 && cando(S_IRUSR,TRUE,&PL_statbuf)
2930 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2931 && cando(S_IXUSR,TRUE,&PL_statbuf)
2935 xfound = tmpbuf; /* bingo! */
2939 xfailed = savepv(tmpbuf);
2942 if (!xfound && !seen_dot && !xfailed &&
2943 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2944 || S_ISDIR(PL_statbuf.st_mode)))
2946 seen_dot = 1; /* Disable message. */
2948 if (flags & 1) { /* do or die? */
2949 Perl_croak(aTHX_ "Can't %s %s%s%s",
2950 (xfailed ? "execute" : "find"),
2951 (xfailed ? xfailed : scriptname),
2952 (xfailed ? "" : " on PATH"),
2953 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2955 scriptname = Nullch;
2959 scriptname = xfound;
2961 return (scriptname ? savepv(scriptname) : Nullch);
2964 #ifndef PERL_GET_CONTEXT_DEFINED
2967 Perl_get_context(void)
2969 #if defined(USE_ITHREADS)
2970 # ifdef OLD_PTHREADS_API
2972 if (pthread_getspecific(PL_thr_key, &t))
2973 Perl_croak_nocontext("panic: pthread_getspecific");
2976 # ifdef I_MACH_CTHREADS
2977 return (void*)cthread_data(cthread_self());
2979 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2988 Perl_set_context(void *t)
2990 #if defined(USE_ITHREADS)
2991 # ifdef I_MACH_CTHREADS
2992 cthread_set_data(cthread_self(), t);
2994 if (pthread_setspecific(PL_thr_key, t))
2995 Perl_croak_nocontext("panic: pthread_setspecific");
3000 #endif /* !PERL_GET_CONTEXT_DEFINED */
3002 #ifdef PERL_GLOBAL_STRUCT
3011 Perl_get_op_names(pTHX)
3017 Perl_get_op_descs(pTHX)
3023 Perl_get_no_modify(pTHX)
3025 return PL_no_modify;
3029 Perl_get_opargs(pTHX)
3035 Perl_get_ppaddr(pTHX)
3037 return (PPADDR_t*)PL_ppaddr;
3040 #ifndef HAS_GETENV_LEN
3042 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3044 char *env_trans = PerlEnv_getenv(env_elem);
3046 *len = strlen(env_trans);
3053 Perl_get_vtbl(pTHX_ int vtbl_id)
3055 MGVTBL* result = Null(MGVTBL*);
3059 result = &PL_vtbl_sv;
3062 result = &PL_vtbl_env;
3064 case want_vtbl_envelem:
3065 result = &PL_vtbl_envelem;
3068 result = &PL_vtbl_sig;
3070 case want_vtbl_sigelem:
3071 result = &PL_vtbl_sigelem;
3073 case want_vtbl_pack:
3074 result = &PL_vtbl_pack;
3076 case want_vtbl_packelem:
3077 result = &PL_vtbl_packelem;
3079 case want_vtbl_dbline:
3080 result = &PL_vtbl_dbline;
3083 result = &PL_vtbl_isa;
3085 case want_vtbl_isaelem:
3086 result = &PL_vtbl_isaelem;
3088 case want_vtbl_arylen:
3089 result = &PL_vtbl_arylen;
3091 case want_vtbl_glob:
3092 result = &PL_vtbl_glob;
3094 case want_vtbl_mglob:
3095 result = &PL_vtbl_mglob;
3097 case want_vtbl_nkeys:
3098 result = &PL_vtbl_nkeys;
3100 case want_vtbl_taint:
3101 result = &PL_vtbl_taint;
3103 case want_vtbl_substr:
3104 result = &PL_vtbl_substr;
3107 result = &PL_vtbl_vec;
3110 result = &PL_vtbl_pos;
3113 result = &PL_vtbl_bm;
3116 result = &PL_vtbl_fm;
3118 case want_vtbl_uvar:
3119 result = &PL_vtbl_uvar;
3121 case want_vtbl_defelem:
3122 result = &PL_vtbl_defelem;
3124 case want_vtbl_regexp:
3125 result = &PL_vtbl_regexp;
3127 case want_vtbl_regdata:
3128 result = &PL_vtbl_regdata;
3130 case want_vtbl_regdatum:
3131 result = &PL_vtbl_regdatum;
3133 #ifdef USE_LOCALE_COLLATE
3134 case want_vtbl_collxfrm:
3135 result = &PL_vtbl_collxfrm;
3138 case want_vtbl_amagic:
3139 result = &PL_vtbl_amagic;
3141 case want_vtbl_amagicelem:
3142 result = &PL_vtbl_amagicelem;
3144 case want_vtbl_backref:
3145 result = &PL_vtbl_backref;
3147 case want_vtbl_utf8:
3148 result = &PL_vtbl_utf8;
3155 Perl_my_fflush_all(pTHX)
3157 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3158 return PerlIO_flush(NULL);
3160 # if defined(HAS__FWALK)
3161 extern int fflush(FILE *);
3162 /* undocumented, unprototyped, but very useful BSDism */
3163 extern void _fwalk(int (*)(FILE *));
3167 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3169 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3170 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3172 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3173 open_max = sysconf(_SC_OPEN_MAX);
3176 open_max = FOPEN_MAX;
3179 open_max = OPEN_MAX;
3190 for (i = 0; i < open_max; i++)
3191 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3192 STDIO_STREAM_ARRAY[i]._file < open_max &&
3193 STDIO_STREAM_ARRAY[i]._flag)
3194 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3198 SETERRNO(EBADF,RMS_IFI);
3205 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3208 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3209 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3211 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3212 const char *type = OP_IS_SOCKET(op)
3213 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3214 ? "socket" : "filehandle";
3215 const char *name = NULL;
3217 if (gv && isGV(gv)) {
3221 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3222 if (ckWARN(WARN_IO)) {
3223 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3225 Perl_warner(aTHX_ packWARN(WARN_IO),
3226 "Filehandle %s opened only for %sput",
3229 Perl_warner(aTHX_ packWARN(WARN_IO),
3230 "Filehandle opened only for %sput", direction);
3237 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3239 warn_type = WARN_CLOSED;
3243 warn_type = WARN_UNOPENED;
3246 if (ckWARN(warn_type)) {
3247 if (name && *name) {
3248 Perl_warner(aTHX_ packWARN(warn_type),
3249 "%s%s on %s %s %s", func, pars, vile, type, name);
3250 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3252 aTHX_ packWARN(warn_type),
3253 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3258 Perl_warner(aTHX_ packWARN(warn_type),
3259 "%s%s on %s %s", func, pars, vile, type);
3260 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3262 aTHX_ packWARN(warn_type),
3263 "\t(Are you trying to call %s%s on dirhandle?)\n",
3272 /* in ASCII order, not that it matters */
3273 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3276 Perl_ebcdic_control(pTHX_ int ch)
3284 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3285 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3288 if (ctlp == controllablechars)
3289 return('\177'); /* DEL */
3291 return((unsigned char)(ctlp - controllablechars - 1));
3292 } else { /* Want uncontrol */
3293 if (ch == '\177' || ch == -1)
3295 else if (ch == '\157')
3297 else if (ch == '\174')
3299 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3301 else if (ch == '\155')
3303 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3304 return(controllablechars[ch+1]);
3306 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3311 /* To workaround core dumps from the uninitialised tm_zone we get the
3312 * system to give us a reasonable struct to copy. This fix means that
3313 * strftime uses the tm_zone and tm_gmtoff values returned by
3314 * localtime(time()). That should give the desired result most of the
3315 * time. But probably not always!
3317 * This does not address tzname aspects of NETaa14816.
3322 # ifndef STRUCT_TM_HASZONE
3323 # define STRUCT_TM_HASZONE
3327 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3328 # ifndef HAS_TM_TM_ZONE
3329 # define HAS_TM_TM_ZONE
3334 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3336 #ifdef HAS_TM_TM_ZONE
3339 Copy(localtime(&now), ptm, 1, struct tm);
3344 * mini_mktime - normalise struct tm values without the localtime()
3345 * semantics (and overhead) of mktime().
3348 Perl_mini_mktime(pTHX_ struct tm *ptm)
3352 int month, mday, year, jday;
3353 int odd_cent, odd_year;
3355 #define DAYS_PER_YEAR 365
3356 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3357 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3358 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3359 #define SECS_PER_HOUR (60*60)
3360 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3361 /* parentheses deliberately absent on these two, otherwise they don't work */
3362 #define MONTH_TO_DAYS 153/5
3363 #define DAYS_TO_MONTH 5/153
3364 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3365 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3366 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3367 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3370 * Year/day algorithm notes:
3372 * With a suitable offset for numeric value of the month, one can find
3373 * an offset into the year by considering months to have 30.6 (153/5) days,
3374 * using integer arithmetic (i.e., with truncation). To avoid too much
3375 * messing about with leap days, we consider January and February to be
3376 * the 13th and 14th month of the previous year. After that transformation,
3377 * we need the month index we use to be high by 1 from 'normal human' usage,
3378 * so the month index values we use run from 4 through 15.
3380 * Given that, and the rules for the Gregorian calendar (leap years are those
3381 * divisible by 4 unless also divisible by 100, when they must be divisible
3382 * by 400 instead), we can simply calculate the number of days since some
3383 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3384 * the days we derive from our month index, and adding in the day of the
3385 * month. The value used here is not adjusted for the actual origin which
3386 * it normally would use (1 January A.D. 1), since we're not exposing it.
3387 * We're only building the value so we can turn around and get the
3388 * normalised values for the year, month, day-of-month, and day-of-year.
3390 * For going backward, we need to bias the value we're using so that we find
3391 * the right year value. (Basically, we don't want the contribution of
3392 * March 1st to the number to apply while deriving the year). Having done
3393 * that, we 'count up' the contribution to the year number by accounting for
3394 * full quadracenturies (400-year periods) with their extra leap days, plus
3395 * the contribution from full centuries (to avoid counting in the lost leap
3396 * days), plus the contribution from full quad-years (to count in the normal
3397 * leap days), plus the leftover contribution from any non-leap years.
3398 * At this point, if we were working with an actual leap day, we'll have 0
3399 * days left over. This is also true for March 1st, however. So, we have
3400 * to special-case that result, and (earlier) keep track of the 'odd'
3401 * century and year contributions. If we got 4 extra centuries in a qcent,
3402 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3403 * Otherwise, we add back in the earlier bias we removed (the 123 from
3404 * figuring in March 1st), find the month index (integer division by 30.6),
3405 * and the remainder is the day-of-month. We then have to convert back to
3406 * 'real' months (including fixing January and February from being 14/15 in
3407 * the previous year to being in the proper year). After that, to get
3408 * tm_yday, we work with the normalised year and get a new yearday value for
3409 * January 1st, which we subtract from the yearday value we had earlier,
3410 * representing the date we've re-built. This is done from January 1
3411 * because tm_yday is 0-origin.
3413 * Since POSIX time routines are only guaranteed to work for times since the
3414 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3415 * applies Gregorian calendar rules even to dates before the 16th century
3416 * doesn't bother me. Besides, you'd need cultural context for a given
3417 * date to know whether it was Julian or Gregorian calendar, and that's
3418 * outside the scope for this routine. Since we convert back based on the
3419 * same rules we used to build the yearday, you'll only get strange results
3420 * for input which needed normalising, or for the 'odd' century years which
3421 * were leap years in the Julian calander but not in the Gregorian one.
3422 * I can live with that.
3424 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3425 * that's still outside the scope for POSIX time manipulation, so I don't
3429 year = 1900 + ptm->tm_year;
3430 month = ptm->tm_mon;
3431 mday = ptm->tm_mday;
3432 /* allow given yday with no month & mday to dominate the result */
3433 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3436 jday = 1 + ptm->tm_yday;
3445 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3446 yearday += month*MONTH_TO_DAYS + mday + jday;
3448 * Note that we don't know when leap-seconds were or will be,
3449 * so we have to trust the user if we get something which looks
3450 * like a sensible leap-second. Wild values for seconds will
3451 * be rationalised, however.
3453 if ((unsigned) ptm->tm_sec <= 60) {
3460 secs += 60 * ptm->tm_min;
3461 secs += SECS_PER_HOUR * ptm->tm_hour;
3463 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3464 /* got negative remainder, but need positive time */
3465 /* back off an extra day to compensate */
3466 yearday += (secs/SECS_PER_DAY)-1;
3467 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3470 yearday += (secs/SECS_PER_DAY);
3471 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3474 else if (secs >= SECS_PER_DAY) {
3475 yearday += (secs/SECS_PER_DAY);
3476 secs %= SECS_PER_DAY;
3478 ptm->tm_hour = secs/SECS_PER_HOUR;
3479 secs %= SECS_PER_HOUR;
3480 ptm->tm_min = secs/60;
3482 ptm->tm_sec += secs;
3483 /* done with time of day effects */
3485 * The algorithm for yearday has (so far) left it high by 428.
3486 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3487 * bias it by 123 while trying to figure out what year it
3488 * really represents. Even with this tweak, the reverse
3489 * translation fails for years before A.D. 0001.
3490 * It would still fail for Feb 29, but we catch that one below.
3492 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3493 yearday -= YEAR_ADJUST;
3494 year = (yearday / DAYS_PER_QCENT) * 400;
3495 yearday %= DAYS_PER_QCENT;
3496 odd_cent = yearday / DAYS_PER_CENT;
3497 year += odd_cent * 100;
3498 yearday %= DAYS_PER_CENT;
3499 year += (yearday / DAYS_PER_QYEAR) * 4;
3500 yearday %= DAYS_PER_QYEAR;
3501 odd_year = yearday / DAYS_PER_YEAR;
3503 yearday %= DAYS_PER_YEAR;
3504 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3509 yearday += YEAR_ADJUST; /* recover March 1st crock */
3510 month = yearday*DAYS_TO_MONTH;
3511 yearday -= month*MONTH_TO_DAYS;
3512 /* recover other leap-year adjustment */
3521 ptm->tm_year = year - 1900;
3523 ptm->tm_mday = yearday;
3524 ptm->tm_mon = month;
3528 ptm->tm_mon = month - 1;
3530 /* re-build yearday based on Jan 1 to get tm_yday */
3532 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3533 yearday += 14*MONTH_TO_DAYS + 1;
3534 ptm->tm_yday = jday - yearday;
3535 /* fix tm_wday if not overridden by caller */
3536 if ((unsigned)ptm->tm_wday > 6)
3537 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3541 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)
3549 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3552 mytm.tm_hour = hour;
3553 mytm.tm_mday = mday;
3555 mytm.tm_year = year;
3556 mytm.tm_wday = wday;
3557 mytm.tm_yday = yday;
3558 mytm.tm_isdst = isdst;
3560 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3561 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3566 #ifdef HAS_TM_TM_GMTOFF
3567 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3569 #ifdef HAS_TM_TM_ZONE
3570 mytm.tm_zone = mytm2.tm_zone;
3575 New(0, buf, buflen, char);
3576 len = strftime(buf, buflen, fmt, &mytm);
3578 ** The following is needed to handle to the situation where
3579 ** tmpbuf overflows. Basically we want to allocate a buffer
3580 ** and try repeatedly. The reason why it is so complicated
3581 ** is that getting a return value of 0 from strftime can indicate
3582 ** one of the following:
3583 ** 1. buffer overflowed,
3584 ** 2. illegal conversion specifier, or
3585 ** 3. the format string specifies nothing to be returned(not
3586 ** an error). This could be because format is an empty string
3587 ** or it specifies %p that yields an empty string in some locale.
3588 ** If there is a better way to make it portable, go ahead by
3591 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3594 /* Possibly buf overflowed - try again with a bigger buf */
3595 const int fmtlen = strlen(fmt);
3596 const int bufsize = fmtlen + buflen;
3598 New(0, buf, bufsize, char);
3600 buflen = strftime(buf, bufsize, fmt, &mytm);
3601 if (buflen > 0 && buflen < bufsize)
3603 /* heuristic to prevent out-of-memory errors */
3604 if (bufsize > 100*fmtlen) {
3609 Renew(buf, bufsize*2, char);
3614 Perl_croak(aTHX_ "panic: no strftime");
3619 #define SV_CWD_RETURN_UNDEF \
3620 sv_setsv(sv, &PL_sv_undef); \
3623 #define SV_CWD_ISDOT(dp) \
3624 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3625 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3628 =head1 Miscellaneous Functions
3630 =for apidoc getcwd_sv
3632 Fill the sv with current working directory
3637 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3638 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3639 * getcwd(3) if available
3640 * Comments from the orignal:
3641 * This is a faster version of getcwd. It's also more dangerous
3642 * because you might chdir out of a directory that you can't chdir
3646 Perl_getcwd_sv(pTHX_ register SV *sv)
3650 #ifndef INCOMPLETE_TAINTS
3656 char buf[MAXPATHLEN];
3658 /* Some getcwd()s automatically allocate a buffer of the given
3659 * size from the heap if they are given a NULL buffer pointer.
3660 * The problem is that this behaviour is not portable. */
3661 if (getcwd(buf, sizeof(buf) - 1)) {
3662 STRLEN len = strlen(buf);
3663 sv_setpvn(sv, buf, len);
3667 sv_setsv(sv, &PL_sv_undef);
3675 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3676 int namelen, pathlen=0;
3680 (void)SvUPGRADE(sv, SVt_PV);
3682 if (PerlLIO_lstat(".", &statbuf) < 0) {
3683 SV_CWD_RETURN_UNDEF;
3686 orig_cdev = statbuf.st_dev;
3687 orig_cino = statbuf.st_ino;
3695 if (PerlDir_chdir("..") < 0) {
3696 SV_CWD_RETURN_UNDEF;
3698 if (PerlLIO_stat(".", &statbuf) < 0) {
3699 SV_CWD_RETURN_UNDEF;
3702 cdev = statbuf.st_dev;
3703 cino = statbuf.st_ino;
3705 if (odev == cdev && oino == cino) {
3708 if (!(dir = PerlDir_open("."))) {
3709 SV_CWD_RETURN_UNDEF;
3712 while ((dp = PerlDir_read(dir)) != NULL) {
3714 namelen = dp->d_namlen;
3716 namelen = strlen(dp->d_name);
3719 if (SV_CWD_ISDOT(dp)) {
3723 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3724 SV_CWD_RETURN_UNDEF;
3727 tdev = statbuf.st_dev;
3728 tino = statbuf.st_ino;
3729 if (tino == oino && tdev == odev) {
3735 SV_CWD_RETURN_UNDEF;
3738 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3739 SV_CWD_RETURN_UNDEF;
3742 SvGROW(sv, pathlen + namelen + 1);
3746 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3749 /* prepend current directory to the front */
3751 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3752 pathlen += (namelen + 1);
3754 #ifdef VOID_CLOSEDIR
3757 if (PerlDir_close(dir) < 0) {
3758 SV_CWD_RETURN_UNDEF;
3764 SvCUR_set(sv, pathlen);
3768 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3769 SV_CWD_RETURN_UNDEF;
3772 if (PerlLIO_stat(".", &statbuf) < 0) {
3773 SV_CWD_RETURN_UNDEF;
3776 cdev = statbuf.st_dev;
3777 cino = statbuf.st_ino;
3779 if (cdev != orig_cdev || cino != orig_cino) {
3780 Perl_croak(aTHX_ "Unstable directory path, "
3781 "current directory changed unexpectedly");
3793 =for apidoc scan_version
3795 Returns a pointer to the next character after the parsed
3796 version string, as well as upgrading the passed in SV to
3799 Function must be called with an already existing SV like
3802 s = scan_version(s,SV *sv, bool qv);
3804 Performs some preprocessing to the string to ensure that
3805 it has the correct characteristics of a version. Flags the
3806 object if it contains an underscore (which denotes this
3807 is a alpha version). The boolean qv denotes that the version
3808 should be interpreted as if it had multiple decimals, even if
3815 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3817 const char *start = s;
3818 const char *pos = s;
3821 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3822 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3825 /* pre-scan the imput string to check for decimals */
3826 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3831 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3834 else if ( *pos == '_' )
3837 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3845 pos++; /* get past 'v' */
3846 qv = 1; /* force quoted version processing */
3848 while (isDIGIT(*pos))
3850 if (!isALPHA(*pos)) {
3853 if (*s == 'v') s++; /* get past 'v' */
3858 /* this is atoi() that delimits on underscores */
3859 const char *end = pos;
3862 if ( s < pos && s > start && *(s-1) == '_' ) {
3863 mult *= -1; /* alpha version */
3865 /* the following if() will only be true after the decimal
3866 * point of a version originally created with a bare
3867 * floating point number, i.e. not quoted in any way
3869 if ( !qv && s > start+1 && saw_period == 1 ) {
3873 rev += (*s - '0') * mult;
3875 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3876 Perl_croak(aTHX_ "Integer overflow in version");
3881 while (--end >= s) {
3883 rev += (*end - '0') * mult;
3885 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3886 Perl_croak(aTHX_ "Integer overflow in version");
3891 /* Append revision */
3892 av_push((AV *)sv, newSViv(rev));
3893 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3895 else if ( isDIGIT(*pos) )
3901 while ( isDIGIT(*pos) ) {
3902 if ( saw_period == 1 && pos-s == 3 )
3908 if ( qv ) { /* quoted versions always become full version objects */
3909 I32 len = av_len((AV *)sv);
3910 /* This for loop appears to trigger a compiler bug on OS X, as it
3911 loops infinitely. Yes, len is negative. No, it makes no sense.
3912 Compiler in question is:
3913 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3914 for ( len = 2 - len; len > 0; len-- )
3915 av_push((AV *)sv, newSViv(0));
3919 av_push((AV *)sv, newSViv(0));
3925 =for apidoc new_version
3927 Returns a new version object based on the passed in SV:
3929 SV *sv = new_version(SV *ver);
3931 Does not alter the passed in ver SV. See "upg_version" if you
3932 want to upgrade the SV.
3938 Perl_new_version(pTHX_ SV *ver)
3941 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3944 AV *av = (AV *)SvRV(ver);
3945 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3946 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3948 for ( key = 0; key <= av_len(av); key++ )
3950 I32 rev = SvIV(*av_fetch(av, key, FALSE));
3951 av_push((AV *)sv, newSViv(rev));
3956 if ( SvVOK(ver) ) { /* already a v-string */
3958 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3959 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3960 sv_setpv(rv,version);
3965 sv_setsv(rv,ver); /* make a duplicate */
3974 =for apidoc upg_version
3976 In-place upgrade of the supplied SV to a version object.
3978 SV *sv = upg_version(SV *sv);
3980 Returns a pointer to the upgraded SV.
3986 Perl_upg_version(pTHX_ SV *ver)
3991 if ( SvNOK(ver) ) /* may get too much accuracy */
3994 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
3995 version = savepv(tbuf);
3998 else if ( SvVOK(ver) ) { /* already a v-string */
3999 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4000 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4004 else /* must be a string or something like a string */
4006 version = savesvpv(ver);
4008 (void)scan_version(version, ver, qv);
4017 Accepts a version object and returns the normalized floating
4018 point representation. Call like:
4022 NOTE: you can pass either the object directly or the SV
4023 contained within the RV.
4029 Perl_vnumify(pTHX_ SV *vs)
4035 len = av_len((AV *)vs);
4038 Perl_sv_catpv(aTHX_ sv,"0");
4041 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4042 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4043 for ( i = 1 ; i < len ; i++ )
4045 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4046 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4051 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4052 if ( (int)PERL_ABS(digit) != 0 || len == 1 )
4054 if ( digit < 0 ) /* alpha version */
4055 Perl_sv_catpv(aTHX_ sv,"_");
4056 /* Don't display additional trailing zeros */
4057 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4062 Perl_sv_catpv(aTHX_ sv,"000");
4070 Accepts a version object and returns the normalized string
4071 representation. Call like:
4075 NOTE: you can pass either the object directly or the SV
4076 contained within the RV.
4082 Perl_vnormal(pTHX_ SV *vs)
4088 len = av_len((AV *)vs);
4091 Perl_sv_catpv(aTHX_ sv,"");
4094 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4095 Perl_sv_setpvf(aTHX_ sv,"%"IVdf,(IV)digit);
4096 for ( i = 1 ; i <= len ; i++ )
4098 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4100 Perl_sv_catpvf(aTHX_ sv,"_%"IVdf,(IV)-digit);
4102 Perl_sv_catpvf(aTHX_ sv,".%"IVdf,(IV)digit);
4105 if ( len <= 2 ) { /* short version, must be at least three */
4106 for ( len = 2 - len; len != 0; len-- )
4107 Perl_sv_catpv(aTHX_ sv,".0");
4114 =for apidoc vstringify
4116 In order to maintain maximum compatibility with earlier versions
4117 of Perl, this function will return either the floating point
4118 notation or the multiple dotted notation, depending on whether
4119 the original version contained 1 or more dots, respectively
4125 Perl_vstringify(pTHX_ SV *vs)
4130 len = av_len((AV *)vs);
4131 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4133 if ( len < 2 || ( len == 2 && digit < 0 ) )
4142 Version object aware cmp. Both operands must already have been
4143 converted into version objects.
4149 Perl_vcmp(pTHX_ SV *lsv, SV *rsv)
4156 l = av_len((AV *)lsv);
4157 r = av_len((AV *)rsv);
4161 while ( i <= m && retval == 0 )
4163 I32 left = SvIV(*av_fetch((AV *)lsv,i,0));
4164 I32 right = SvIV(*av_fetch((AV *)rsv,i,0));
4165 bool lalpha = left < 0 ? 1 : 0;
4166 bool ralpha = right < 0 ? 1 : 0;
4169 if ( left < right || (left == right && lalpha && !ralpha) )
4171 if ( left > right || (left == right && ralpha && !lalpha) )
4176 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4180 while ( i <= r && retval == 0 )
4182 if ( SvIV(*av_fetch((AV *)rsv,i,0)) != 0 )
4183 retval = -1; /* not a match after all */
4189 while ( i <= l && retval == 0 )
4191 if ( SvIV(*av_fetch((AV *)lsv,i,0)) != 0 )
4192 retval = +1; /* not a match after all */
4200 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4201 # define EMULATE_SOCKETPAIR_UDP
4204 #ifdef EMULATE_SOCKETPAIR_UDP
4206 S_socketpair_udp (int fd[2]) {
4208 /* Fake a datagram socketpair using UDP to localhost. */
4209 int sockets[2] = {-1, -1};
4210 struct sockaddr_in addresses[2];
4212 Sock_size_t size = sizeof(struct sockaddr_in);
4213 unsigned short port;
4216 memset(&addresses, 0, sizeof(addresses));
4219 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4220 if (sockets[i] == -1)
4221 goto tidy_up_and_fail;
4223 addresses[i].sin_family = AF_INET;
4224 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4225 addresses[i].sin_port = 0; /* kernel choses port. */
4226 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4227 sizeof(struct sockaddr_in)) == -1)
4228 goto tidy_up_and_fail;
4231 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4232 for each connect the other socket to it. */
4235 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4237 goto tidy_up_and_fail;
4238 if (size != sizeof(struct sockaddr_in))
4239 goto abort_tidy_up_and_fail;
4240 /* !1 is 0, !0 is 1 */
4241 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4242 sizeof(struct sockaddr_in)) == -1)
4243 goto tidy_up_and_fail;
4246 /* Now we have 2 sockets connected to each other. I don't trust some other
4247 process not to have already sent a packet to us (by random) so send
4248 a packet from each to the other. */
4251 /* I'm going to send my own port number. As a short.
4252 (Who knows if someone somewhere has sin_port as a bitfield and needs
4253 this routine. (I'm assuming crays have socketpair)) */
4254 port = addresses[i].sin_port;
4255 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4256 if (got != sizeof(port)) {
4258 goto tidy_up_and_fail;
4259 goto abort_tidy_up_and_fail;
4263 /* Packets sent. I don't trust them to have arrived though.
4264 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4265 connect to localhost will use a second kernel thread. In 2.6 the
4266 first thread running the connect() returns before the second completes,
4267 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4268 returns 0. Poor programs have tripped up. One poor program's authors'
4269 had a 50-1 reverse stock split. Not sure how connected these were.)
4270 So I don't trust someone not to have an unpredictable UDP stack.
4274 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4275 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4279 FD_SET(sockets[0], &rset);
4280 FD_SET(sockets[1], &rset);
4282 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4283 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4284 || !FD_ISSET(sockets[1], &rset)) {
4285 /* I hope this is portable and appropriate. */
4287 goto tidy_up_and_fail;
4288 goto abort_tidy_up_and_fail;
4292 /* And the paranoia department even now doesn't trust it to have arrive
4293 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4295 struct sockaddr_in readfrom;
4296 unsigned short buffer[2];
4301 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4302 sizeof(buffer), MSG_DONTWAIT,
4303 (struct sockaddr *) &readfrom, &size);
4305 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4307 (struct sockaddr *) &readfrom, &size);
4311 goto tidy_up_and_fail;
4312 if (got != sizeof(port)
4313 || size != sizeof(struct sockaddr_in)
4314 /* Check other socket sent us its port. */
4315 || buffer[0] != (unsigned short) addresses[!i].sin_port
4316 /* Check kernel says we got the datagram from that socket */
4317 || readfrom.sin_family != addresses[!i].sin_family
4318 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4319 || readfrom.sin_port != addresses[!i].sin_port)
4320 goto abort_tidy_up_and_fail;
4323 /* My caller (my_socketpair) has validated that this is non-NULL */
4326 /* I hereby declare this connection open. May God bless all who cross
4330 abort_tidy_up_and_fail:
4331 errno = ECONNABORTED;
4334 int save_errno = errno;
4335 if (sockets[0] != -1)
4336 PerlLIO_close(sockets[0]);
4337 if (sockets[1] != -1)
4338 PerlLIO_close(sockets[1]);
4343 #endif /* EMULATE_SOCKETPAIR_UDP */
4345 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4347 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4348 /* Stevens says that family must be AF_LOCAL, protocol 0.
4349 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4354 struct sockaddr_in listen_addr;
4355 struct sockaddr_in connect_addr;
4360 || family != AF_UNIX
4363 errno = EAFNOSUPPORT;
4371 #ifdef EMULATE_SOCKETPAIR_UDP
4372 if (type == SOCK_DGRAM)
4373 return S_socketpair_udp(fd);
4376 listener = PerlSock_socket(AF_INET, type, 0);
4379 memset(&listen_addr, 0, sizeof(listen_addr));
4380 listen_addr.sin_family = AF_INET;
4381 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4382 listen_addr.sin_port = 0; /* kernel choses port. */
4383 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4384 sizeof(listen_addr)) == -1)
4385 goto tidy_up_and_fail;
4386 if (PerlSock_listen(listener, 1) == -1)
4387 goto tidy_up_and_fail;
4389 connector = PerlSock_socket(AF_INET, type, 0);
4390 if (connector == -1)
4391 goto tidy_up_and_fail;
4392 /* We want to find out the port number to connect to. */
4393 size = sizeof(connect_addr);
4394 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4396 goto tidy_up_and_fail;
4397 if (size != sizeof(connect_addr))
4398 goto abort_tidy_up_and_fail;
4399 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4400 sizeof(connect_addr)) == -1)
4401 goto tidy_up_and_fail;
4403 size = sizeof(listen_addr);
4404 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4407 goto tidy_up_and_fail;
4408 if (size != sizeof(listen_addr))
4409 goto abort_tidy_up_and_fail;
4410 PerlLIO_close(listener);
4411 /* Now check we are talking to ourself by matching port and host on the
4413 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4415 goto tidy_up_and_fail;
4416 if (size != sizeof(connect_addr)
4417 || listen_addr.sin_family != connect_addr.sin_family
4418 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4419 || listen_addr.sin_port != connect_addr.sin_port) {
4420 goto abort_tidy_up_and_fail;
4426 abort_tidy_up_and_fail:
4427 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4430 int save_errno = errno;
4432 PerlLIO_close(listener);
4433 if (connector != -1)
4434 PerlLIO_close(connector);
4436 PerlLIO_close(acceptor);
4442 /* In any case have a stub so that there's code corresponding
4443 * to the my_socketpair in global.sym. */
4445 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4446 #ifdef HAS_SOCKETPAIR
4447 return socketpair(family, type, protocol, fd);
4456 =for apidoc sv_nosharing
4458 Dummy routine which "shares" an SV when there is no sharing module present.
4459 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4460 some level of strict-ness.
4466 Perl_sv_nosharing(pTHX_ SV *sv)
4471 =for apidoc sv_nolocking
4473 Dummy routine which "locks" an SV when there is no locking module present.
4474 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4475 some level of strict-ness.
4481 Perl_sv_nolocking(pTHX_ SV *sv)
4487 =for apidoc sv_nounlocking
4489 Dummy routine which "unlocks" an SV when there is no locking module present.
4490 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4491 some level of strict-ness.
4497 Perl_sv_nounlocking(pTHX_ SV *sv)
4502 Perl_parse_unicode_opts(pTHX_ const char **popt)
4504 const char *p = *popt;
4509 opt = (U32) atoi(p);
4510 while (isDIGIT(*p)) p++;
4511 if (*p && *p != '\n' && *p != '\r')
4512 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4517 case PERL_UNICODE_STDIN:
4518 opt |= PERL_UNICODE_STDIN_FLAG; break;
4519 case PERL_UNICODE_STDOUT:
4520 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4521 case PERL_UNICODE_STDERR:
4522 opt |= PERL_UNICODE_STDERR_FLAG; break;
4523 case PERL_UNICODE_STD:
4524 opt |= PERL_UNICODE_STD_FLAG; break;
4525 case PERL_UNICODE_IN:
4526 opt |= PERL_UNICODE_IN_FLAG; break;
4527 case PERL_UNICODE_OUT:
4528 opt |= PERL_UNICODE_OUT_FLAG; break;
4529 case PERL_UNICODE_INOUT:
4530 opt |= PERL_UNICODE_INOUT_FLAG; break;
4531 case PERL_UNICODE_LOCALE:
4532 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4533 case PERL_UNICODE_ARGV:
4534 opt |= PERL_UNICODE_ARGV_FLAG; break;
4536 if (*p != '\n' && *p != '\r')
4538 "Unknown Unicode option letter '%c'", *p);
4544 opt = PERL_UNICODE_DEFAULT_FLAGS;
4546 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4547 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4548 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4559 * This is really just a quick hack which grabs various garbage
4560 * values. It really should be a real hash algorithm which
4561 * spreads the effect of every input bit onto every output bit,
4562 * if someone who knows about such things would bother to write it.
4563 * Might be a good idea to add that function to CORE as well.
4564 * No numbers below come from careful analysis or anything here,
4565 * except they are primes and SEED_C1 > 1E6 to get a full-width
4566 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4567 * probably be bigger too.
4570 # define SEED_C1 1000003
4571 #define SEED_C4 73819
4573 # define SEED_C1 25747
4574 #define SEED_C4 20639
4578 #define SEED_C5 26107
4580 #ifndef PERL_NO_DEV_RANDOM
4585 # include <starlet.h>
4586 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4587 * in 100-ns units, typically incremented ever 10 ms. */
4588 unsigned int when[2];
4590 # ifdef HAS_GETTIMEOFDAY
4591 struct timeval when;
4597 /* This test is an escape hatch, this symbol isn't set by Configure. */
4598 #ifndef PERL_NO_DEV_RANDOM
4599 #ifndef PERL_RANDOM_DEVICE
4600 /* /dev/random isn't used by default because reads from it will block
4601 * if there isn't enough entropy available. You can compile with
4602 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4603 * is enough real entropy to fill the seed. */
4604 # define PERL_RANDOM_DEVICE "/dev/urandom"
4606 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4608 if (PerlLIO_read(fd, &u, sizeof u) != sizeof u)
4617 _ckvmssts(sys$gettim(when));
4618 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4620 # ifdef HAS_GETTIMEOFDAY
4621 PerlProc_gettimeofday(&when,NULL);
4622 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4625 u = (U32)SEED_C1 * when;
4628 u += SEED_C3 * (U32)PerlProc_getpid();
4629 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4630 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4631 u += SEED_C5 * (U32)PTR2UV(&when);
4637 Perl_get_hash_seed(pTHX)
4639 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4643 while (isSPACE(*s)) s++;
4644 if (s && isDIGIT(*s))
4645 myseed = (UV)Atoul(s);
4647 #ifdef USE_HASH_SEED_EXPLICIT
4651 /* Compute a random seed */
4652 (void)seedDrand01((Rand_seed_t)seed());
4653 myseed = (UV)(Drand01() * (NV)UV_MAX);
4654 #if RANDBITS < (UVSIZE * 8)
4655 /* Since there are not enough randbits to to reach all
4656 * the bits of a UV, the low bits might need extra
4657 * help. Sum in another random number that will
4658 * fill in the low bits. */
4660 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4661 #endif /* RANDBITS < (UVSIZE * 8) */
4662 if (myseed == 0) { /* Superparanoia. */
4663 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4665 Perl_croak(aTHX_ "Your random numbers are not that random");
4668 PL_rehash_seed_set = TRUE;