3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 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
17 #define PERL_IN_UTIL_C
23 # define SIG_ERR ((Sighandler_t) -1)
28 # include <sys/wait.h>
33 # include <sys/select.h>
39 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
40 # define FD_CLOEXEC 1 /* NeXT needs this */
43 /* NOTE: Do not call the next three routines directly. Use the macros
44 * in handy.h, so that we can easily redefine everything to do tracking of
45 * allocated hunks back to the original New to track down any memory leaks.
46 * XXX This advice seems to be widely ignored :-( --AD August 1996.
49 /* paranoid version of system's malloc() */
52 Perl_safesysmalloc(MEM_SIZE size)
58 PerlIO_printf(Perl_error_log,
59 "Allocation too large: %lx\n", size) FLUSH;
62 #endif /* HAS_64K_LIMIT */
65 Perl_croak_nocontext("panic: malloc");
67 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
68 PERL_ALLOC_CHECK(ptr);
69 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
75 /* Can't use PerlIO to write as it allocates memory */
76 PerlLIO_write(PerlIO_fileno(Perl_error_log),
77 PL_no_mem, strlen(PL_no_mem));
84 /* paranoid version of system's realloc() */
87 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
91 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
92 Malloc_t PerlMem_realloc();
93 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
97 PerlIO_printf(Perl_error_log,
98 "Reallocation too large: %lx\n", size) FLUSH;
101 #endif /* HAS_64K_LIMIT */
108 return safesysmalloc(size);
111 Perl_croak_nocontext("panic: realloc");
113 ptr = (Malloc_t)PerlMem_realloc(where,size);
114 PERL_ALLOC_CHECK(ptr);
116 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
117 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
124 /* Can't use PerlIO to write as it allocates memory */
125 PerlLIO_write(PerlIO_fileno(Perl_error_log),
126 PL_no_mem, strlen(PL_no_mem));
133 /* safe version of system's free() */
136 Perl_safesysfree(Malloc_t where)
138 #ifdef PERL_IMPLICIT_SYS
141 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
148 /* safe version of system's calloc() */
151 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
157 if (size * count > 0xffff) {
158 PerlIO_printf(Perl_error_log,
159 "Allocation too large: %lx\n", size * count) FLUSH;
162 #endif /* HAS_64K_LIMIT */
164 if ((long)size < 0 || (long)count < 0)
165 Perl_croak_nocontext("panic: calloc");
168 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
169 PERL_ALLOC_CHECK(ptr);
170 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));
172 memset((void*)ptr, 0, size);
178 /* Can't use PerlIO to write as it allocates memory */
179 PerlLIO_write(PerlIO_fileno(Perl_error_log),
180 PL_no_mem, strlen(PL_no_mem));
187 /* These must be defined when not using Perl's malloc for binary
192 Malloc_t Perl_malloc (MEM_SIZE nbytes)
195 return (Malloc_t)PerlMem_malloc(nbytes);
198 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
201 return (Malloc_t)PerlMem_calloc(elements, size);
204 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
207 return (Malloc_t)PerlMem_realloc(where, nbytes);
210 Free_t Perl_mfree (Malloc_t where)
218 /* copy a string up to some (non-backslashed) delimiter, if any */
221 Perl_delimcpy(pTHX_ register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
224 for (tolen = 0; from < fromend; from++, tolen++) {
226 if (from[1] == delim)
235 else if (*from == delim)
246 /* return ptr to little string in big string, NULL if not found */
247 /* This routine was donated by Corey Satten. */
250 Perl_instr(pTHX_ register const char *big, register const char *little)
252 register const char *s, *x;
263 for (x=big,s=little; *s; /**/ ) {
272 return (char*)(big-1);
277 /* same as instr but allow embedded nulls */
280 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
282 register const char *s, *x;
283 register I32 first = *little;
284 register const char *littleend = lend;
286 if (!first && little >= littleend)
288 if (bigend - big < littleend - little)
290 bigend -= littleend - little++;
291 while (big <= bigend) {
294 for (x=big,s=little; s < littleend; /**/ ) {
301 return (char*)(big-1);
306 /* reverse of the above--find last substring */
309 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
311 register const char *bigbeg;
312 register const char *s, *x;
313 register I32 first = *little;
314 register const char *littleend = lend;
316 if (!first && little >= littleend)
317 return (char*)bigend;
319 big = bigend - (littleend - little++);
320 while (big >= bigbeg) {
323 for (x=big+2,s=little; s < littleend; /**/ ) {
330 return (char*)(big+1);
335 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
337 /* As a space optimization, we do not compile tables for strings of length
338 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
339 special-cased in fbm_instr().
341 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
344 =head1 Miscellaneous Functions
346 =for apidoc fbm_compile
348 Analyses the string in order to make fast searches on it using fbm_instr()
349 -- the Boyer-Moore algorithm.
355 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
364 if (flags & FBMcf_TAIL) {
365 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
366 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
367 if (mg && mg->mg_len >= 0)
370 s = (U8*)SvPV_force(sv, len);
371 (void)SvUPGRADE(sv, SVt_PVBM);
372 if (len == 0) /* TAIL might be on a zero-length string. */
382 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
383 table = (unsigned char*)(SvPVX(sv) + len + FBM_TABLE_OFFSET);
384 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
385 memset((void*)table, mlen, 256);
386 table[-1] = (U8)flags;
388 sb = s - mlen + 1; /* first char (maybe) */
390 if (table[*s] == mlen)
395 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
398 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
399 for (i = 0; i < len; i++) {
400 if (PL_freq[s[i]] < frequency) {
402 frequency = PL_freq[s[i]];
405 BmRARE(sv) = s[rarest];
406 BmPREVIOUS(sv) = (U16)rarest;
407 BmUSEFUL(sv) = 100; /* Initial value */
408 if (flags & FBMcf_TAIL)
410 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
411 BmRARE(sv),BmPREVIOUS(sv)));
414 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
415 /* If SvTAIL is actually due to \Z or \z, this gives false positives
419 =for apidoc fbm_instr
421 Returns the location of the SV in the string delimited by C<str> and
422 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
423 does not have to be fbm_compiled, but the search will not be as fast
430 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
432 register unsigned char *s;
434 register unsigned char *little = (unsigned char *)SvPV(littlestr,l);
435 register STRLEN littlelen = l;
436 register I32 multiline = flags & FBMrf_MULTILINE;
438 if ((STRLEN)(bigend - big) < littlelen) {
439 if ( SvTAIL(littlestr)
440 && ((STRLEN)(bigend - big) == littlelen - 1)
442 || (*big == *little &&
443 memEQ((char *)big, (char *)little, littlelen - 1))))
448 if (littlelen <= 2) { /* Special-cased */
450 if (littlelen == 1) {
451 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
452 /* Know that bigend != big. */
453 if (bigend[-1] == '\n')
454 return (char *)(bigend - 1);
455 return (char *) bigend;
463 if (SvTAIL(littlestr))
464 return (char *) bigend;
468 return (char*)big; /* Cannot be SvTAIL! */
471 if (SvTAIL(littlestr) && !multiline) {
472 if (bigend[-1] == '\n' && bigend[-2] == *little)
473 return (char*)bigend - 2;
474 if (bigend[-1] == *little)
475 return (char*)bigend - 1;
479 /* This should be better than FBM if c1 == c2, and almost
480 as good otherwise: maybe better since we do less indirection.
481 And we save a lot of memory by caching no table. */
482 register unsigned char c1 = little[0];
483 register unsigned char c2 = little[1];
488 while (s <= bigend) {
498 goto check_1char_anchor;
509 goto check_1char_anchor;
512 while (s <= bigend) {
517 goto check_1char_anchor;
526 check_1char_anchor: /* One char and anchor! */
527 if (SvTAIL(littlestr) && (*bigend == *little))
528 return (char *)bigend; /* bigend is already decremented. */
531 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
532 s = bigend - littlelen;
533 if (s >= big && bigend[-1] == '\n' && *s == *little
534 /* Automatically of length > 2 */
535 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
537 return (char*)s; /* how sweet it is */
540 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
542 return (char*)s + 1; /* how sweet it is */
546 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
547 char *b = ninstr((char*)big,(char*)bigend,
548 (char*)little, (char*)little + littlelen);
550 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
551 /* Chop \n from littlestr: */
552 s = bigend - littlelen + 1;
554 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
563 { /* Do actual FBM. */
564 register unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
565 register unsigned char *oldlittle;
567 if (littlelen > (STRLEN)(bigend - big))
569 --littlelen; /* Last char found by table lookup */
572 little += littlelen; /* last char */
579 if ((tmp = table[*s])) {
580 if ((s += tmp) < bigend)
584 else { /* less expensive than calling strncmp() */
585 register unsigned char *olds = s;
590 if (*--s == *--little)
592 s = olds + 1; /* here we pay the price for failure */
594 if (s < bigend) /* fake up continue to outer loop */
602 if ( s == bigend && (table[-1] & FBMcf_TAIL)
603 && memEQ((char *)(bigend - littlelen),
604 (char *)(oldlittle - littlelen), littlelen) )
605 return (char*)bigend - littlelen;
610 /* start_shift, end_shift are positive quantities which give offsets
611 of ends of some substring of bigstr.
612 If `last' we want the last occurrence.
613 old_posp is the way of communication between consequent calls if
614 the next call needs to find the .
615 The initial *old_posp should be -1.
617 Note that we take into account SvTAIL, so one can get extra
618 optimizations if _ALL flag is set.
621 /* If SvTAIL is actually due to \Z or \z, this gives false positives
622 if PL_multiline. In fact if !PL_multiline the authoritative answer
623 is not supported yet. */
626 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
628 register unsigned char *s, *x;
629 register unsigned char *big;
631 register I32 previous;
633 register unsigned char *little;
634 register I32 stop_pos;
635 register unsigned char *littleend;
639 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
640 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
642 if ( BmRARE(littlestr) == '\n'
643 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
644 little = (unsigned char *)(SvPVX(littlestr));
645 littleend = little + SvCUR(littlestr);
652 little = (unsigned char *)(SvPVX(littlestr));
653 littleend = little + SvCUR(littlestr);
655 /* The value of pos we can start at: */
656 previous = BmPREVIOUS(littlestr);
657 big = (unsigned char *)(SvPVX(bigstr));
658 /* The value of pos we can stop at: */
659 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
660 if (previous + start_shift > stop_pos) {
662 stop_pos does not include SvTAIL in the count, so this check is incorrect
663 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
666 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
671 while (pos < previous + start_shift) {
672 if (!(pos += PL_screamnext[pos]))
677 if (pos >= stop_pos) break;
678 if (big[pos] != first)
680 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
686 if (s == littleend) {
688 if (!last) return (char *)(big+pos);
691 } while ( pos += PL_screamnext[pos] );
693 return (char *)(big+(*old_posp));
695 if (!SvTAIL(littlestr) || (end_shift > 0))
697 /* Ignore the trailing "\n". This code is not microoptimized */
698 big = (unsigned char *)(SvPVX(bigstr) + SvCUR(bigstr));
699 stop_pos = littleend - little; /* Actual littlestr len */
704 && ((stop_pos == 1) ||
705 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
711 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
713 register U8 *a = (U8 *)s1;
714 register U8 *b = (U8 *)s2;
716 if (*a != *b && *a != PL_fold[*b])
724 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
726 register U8 *a = (U8 *)s1;
727 register U8 *b = (U8 *)s2;
729 if (*a != *b && *a != PL_fold_locale[*b])
736 /* copy a string to a safe spot */
739 =head1 Memory Management
743 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
744 string which is a duplicate of C<pv>. The size of the string is
745 determined by C<strlen()>. The memory allocated for the new string can
746 be freed with the C<Safefree()> function.
752 Perl_savepv(pTHX_ const char *pv)
754 register char *newaddr = Nullch;
756 New(902,newaddr,strlen(pv)+1,char);
757 (void)strcpy(newaddr,pv);
762 /* same thing but with a known length */
767 Perl's version of what C<strndup()> would be if it existed. Returns a
768 pointer to a newly allocated string which is a duplicate of the first
769 C<len> bytes from C<pv>. The memory allocated for the new string can be
770 freed with the C<Safefree()> function.
776 Perl_savepvn(pTHX_ const char *pv, register I32 len)
778 register char *newaddr;
780 New(903,newaddr,len+1,char);
781 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
783 Copy(pv,newaddr,len,char); /* might not be null terminated */
784 newaddr[len] = '\0'; /* is now */
787 Zero(newaddr,len+1,char);
793 =for apidoc savesharedpv
795 A version of C<savepv()> which allocates the duplicate string in memory
796 which is shared between threads.
801 Perl_savesharedpv(pTHX_ const char *pv)
803 register char *newaddr = Nullch;
805 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
807 PerlLIO_write(PerlIO_fileno(Perl_error_log),
808 PL_no_mem, strlen(PL_no_mem));
811 (void)strcpy(newaddr,pv);
818 /* the SV for Perl_form() and mess() is not kept in an arena */
827 return sv_2mortal(newSVpvn("",0));
832 /* Create as PVMG now, to avoid any upgrading later */
834 Newz(905, any, 1, XPVMG);
835 SvFLAGS(sv) = SVt_PVMG;
836 SvANY(sv) = (void*)any;
837 SvREFCNT(sv) = 1 << 30; /* practically infinite */
842 #if defined(PERL_IMPLICIT_CONTEXT)
844 Perl_form_nocontext(const char* pat, ...)
850 retval = vform(pat, &args);
854 #endif /* PERL_IMPLICIT_CONTEXT */
857 =head1 Miscellaneous Functions
860 Takes a sprintf-style format pattern and conventional
861 (non-SV) arguments and returns the formatted string.
863 (char *) Perl_form(pTHX_ const char* pat, ...)
865 can be used any place a string (char *) is required:
867 char * s = Perl_form("%d.%d",major,minor);
869 Uses a single private buffer so if you want to format several strings you
870 must explicitly copy the earlier strings away (and free the copies when you
877 Perl_form(pTHX_ const char* pat, ...)
882 retval = vform(pat, &args);
888 Perl_vform(pTHX_ const char *pat, va_list *args)
890 SV *sv = mess_alloc();
891 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
895 #if defined(PERL_IMPLICIT_CONTEXT)
897 Perl_mess_nocontext(const char *pat, ...)
903 retval = vmess(pat, &args);
907 #endif /* PERL_IMPLICIT_CONTEXT */
910 Perl_mess(pTHX_ const char *pat, ...)
915 retval = vmess(pat, &args);
921 S_closest_cop(pTHX_ COP *cop, OP *o)
923 /* Look for PL_op starting from o. cop is the last COP we've seen. */
925 if (!o || o == PL_op) return cop;
927 if (o->op_flags & OPf_KIDS) {
929 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
933 /* If the OP_NEXTSTATE has been optimised away we can still use it
934 * the get the file and line number. */
936 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
939 /* Keep searching, and return when we've found something. */
941 new_cop = closest_cop(cop, kid);
942 if (new_cop) return new_cop;
952 Perl_vmess(pTHX_ const char *pat, va_list *args)
954 SV *sv = mess_alloc();
955 static char dgd[] = " during global destruction.\n";
958 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
959 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
962 * Try and find the file and line for PL_op. This will usually be
963 * PL_curcop, but it might be a cop that has been optimised away. We
964 * can try to find such a cop by searching through the optree starting
965 * from the sibling of PL_curcop.
968 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
969 if (!cop) cop = PL_curcop;
972 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
973 OutCopFILE(cop), (IV)CopLINE(cop));
974 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
975 bool line_mode = (RsSIMPLE(PL_rs) &&
976 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
977 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
978 PL_last_in_gv == PL_argvgv ?
979 "" : GvNAME(PL_last_in_gv),
980 line_mode ? "line" : "chunk",
981 (IV)IoLINES(GvIOp(PL_last_in_gv)));
983 sv_catpv(sv, PL_dirty ? dgd : ".\n");
989 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
994 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
995 && (io = GvIO(PL_stderrgv))
996 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1003 SAVESPTR(PL_stderrgv);
1004 PL_stderrgv = Nullgv;
1006 PUSHSTACKi(PERLSI_MAGIC);
1010 PUSHs(SvTIED_obj((SV*)io, mg));
1011 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1013 call_method("PRINT", G_SCALAR);
1021 /* SFIO can really mess with your errno */
1024 PerlIO *serr = Perl_error_log;
1026 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1027 (void)PerlIO_flush(serr);
1035 Perl_vdie(pTHX_ const char* pat, va_list *args)
1038 int was_in_eval = PL_in_eval;
1046 DEBUG_S(PerlIO_printf(Perl_debug_log,
1047 "%p: die: curstack = %p, mainstack = %p\n",
1048 thr, PL_curstack, PL_mainstack));
1051 msv = vmess(pat, args);
1052 if (PL_errors && SvCUR(PL_errors)) {
1053 sv_catsv(PL_errors, msv);
1054 message = SvPV(PL_errors, msglen);
1055 SvCUR_set(PL_errors, 0);
1058 message = SvPV(msv,msglen);
1066 DEBUG_S(PerlIO_printf(Perl_debug_log,
1067 "%p: die: message = %s\ndiehook = %p\n",
1068 thr, message, PL_diehook));
1070 /* sv_2cv might call Perl_croak() */
1071 SV *olddiehook = PL_diehook;
1073 SAVESPTR(PL_diehook);
1074 PL_diehook = Nullsv;
1075 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1077 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1084 msg = newSVpvn(message, msglen);
1085 SvFLAGS(msg) |= utf8;
1093 PUSHSTACKi(PERLSI_DIEHOOK);
1097 call_sv((SV*)cv, G_DISCARD);
1103 PL_restartop = die_where(message, msglen);
1104 SvFLAGS(ERRSV) |= utf8;
1105 DEBUG_S(PerlIO_printf(Perl_debug_log,
1106 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1107 thr, PL_restartop, was_in_eval, PL_top_env));
1108 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1110 return PL_restartop;
1113 #if defined(PERL_IMPLICIT_CONTEXT)
1115 Perl_die_nocontext(const char* pat, ...)
1120 va_start(args, pat);
1121 o = vdie(pat, &args);
1125 #endif /* PERL_IMPLICIT_CONTEXT */
1128 Perl_die(pTHX_ const char* pat, ...)
1132 va_start(args, pat);
1133 o = vdie(pat, &args);
1139 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1150 msv = vmess(pat, args);
1151 if (PL_errors && SvCUR(PL_errors)) {
1152 sv_catsv(PL_errors, msv);
1153 message = SvPV(PL_errors, msglen);
1154 SvCUR_set(PL_errors, 0);
1157 message = SvPV(msv,msglen);
1165 DEBUG_S(PerlIO_printf(Perl_debug_log, "croak: 0x%"UVxf" %s",
1166 PTR2UV(thr), message));
1169 /* sv_2cv might call Perl_croak() */
1170 SV *olddiehook = PL_diehook;
1172 SAVESPTR(PL_diehook);
1173 PL_diehook = Nullsv;
1174 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1176 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1183 msg = newSVpvn(message, msglen);
1184 SvFLAGS(msg) |= utf8;
1192 PUSHSTACKi(PERLSI_DIEHOOK);
1196 call_sv((SV*)cv, G_DISCARD);
1202 PL_restartop = die_where(message, msglen);
1203 SvFLAGS(ERRSV) |= utf8;
1207 message = SvPVx(ERRSV, msglen);
1209 write_to_stderr(message, msglen);
1213 #if defined(PERL_IMPLICIT_CONTEXT)
1215 Perl_croak_nocontext(const char *pat, ...)
1219 va_start(args, pat);
1224 #endif /* PERL_IMPLICIT_CONTEXT */
1227 =head1 Warning and Dieing
1231 This is the XSUB-writer's interface to Perl's C<die> function.
1232 Normally call this function the same way you call the C C<printf>
1233 function. Calling C<croak> returns control directly to Perl,
1234 sidestepping the normal C order of execution. See C<warn>.
1236 If you want to throw an exception object, assign the object to
1237 C<$@> and then pass C<Nullch> to croak():
1239 errsv = get_sv("@", TRUE);
1240 sv_setsv(errsv, exception_object);
1247 Perl_croak(pTHX_ const char *pat, ...)
1250 va_start(args, pat);
1257 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1267 msv = vmess(pat, args);
1269 message = SvPV(msv, msglen);
1272 /* sv_2cv might call Perl_warn() */
1273 SV *oldwarnhook = PL_warnhook;
1275 SAVESPTR(PL_warnhook);
1276 PL_warnhook = Nullsv;
1277 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1279 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1285 msg = newSVpvn(message, msglen);
1286 SvFLAGS(msg) |= utf8;
1290 PUSHSTACKi(PERLSI_WARNHOOK);
1294 call_sv((SV*)cv, G_DISCARD);
1301 write_to_stderr(message, msglen);
1304 #if defined(PERL_IMPLICIT_CONTEXT)
1306 Perl_warn_nocontext(const char *pat, ...)
1310 va_start(args, pat);
1314 #endif /* PERL_IMPLICIT_CONTEXT */
1319 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1320 function the same way you call the C C<printf> function. See C<croak>.
1326 Perl_warn(pTHX_ const char *pat, ...)
1329 va_start(args, pat);
1334 #if defined(PERL_IMPLICIT_CONTEXT)
1336 Perl_warner_nocontext(U32 err, const char *pat, ...)
1340 va_start(args, pat);
1341 vwarner(err, pat, &args);
1344 #endif /* PERL_IMPLICIT_CONTEXT */
1347 Perl_warner(pTHX_ U32 err, const char* pat,...)
1350 va_start(args, pat);
1351 vwarner(err, pat, &args);
1356 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1366 msv = vmess(pat, args);
1367 message = SvPV(msv, msglen);
1372 /* sv_2cv might call Perl_croak() */
1373 SV *olddiehook = PL_diehook;
1375 SAVESPTR(PL_diehook);
1376 PL_diehook = Nullsv;
1377 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1379 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1385 msg = newSVpvn(message, msglen);
1386 SvFLAGS(msg) |= utf8;
1390 PUSHSTACKi(PERLSI_DIEHOOK);
1394 call_sv((SV*)cv, G_DISCARD);
1400 PL_restartop = die_where(message, msglen);
1401 SvFLAGS(ERRSV) |= utf8;
1404 write_to_stderr(message, msglen);
1409 /* sv_2cv might call Perl_warn() */
1410 SV *oldwarnhook = PL_warnhook;
1412 SAVESPTR(PL_warnhook);
1413 PL_warnhook = Nullsv;
1414 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1416 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1422 msg = newSVpvn(message, msglen);
1423 SvFLAGS(msg) |= utf8;
1427 PUSHSTACKi(PERLSI_WARNHOOK);
1431 call_sv((SV*)cv, G_DISCARD);
1437 write_to_stderr(message, msglen);
1441 /* since we've already done strlen() for both nam and val
1442 * we can use that info to make things faster than
1443 * sprintf(s, "%s=%s", nam, val)
1445 #define my_setenv_format(s, nam, nlen, val, vlen) \
1446 Copy(nam, s, nlen, char); \
1448 Copy(val, s+(nlen+1), vlen, char); \
1449 *(s+(nlen+1+vlen)) = '\0'
1451 #ifdef USE_ENVIRON_ARRAY
1452 /* VMS' my_setenv() is in vms.c */
1453 #if !defined(WIN32) && !defined(NETWARE)
1455 Perl_my_setenv(pTHX_ char *nam, char *val)
1458 /* only parent thread can modify process environment */
1459 if (PL_curinterp == aTHX)
1462 #ifndef PERL_USE_SAFE_PUTENV
1463 /* most putenv()s leak, so we manipulate environ directly */
1464 register I32 i=setenv_getix(nam); /* where does it go? */
1467 if (environ == PL_origenviron) { /* need we copy environment? */
1473 for (max = i; environ[max]; max++) ;
1474 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1475 for (j=0; j<max; j++) { /* copy environment */
1476 int len = strlen(environ[j]);
1477 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1478 Copy(environ[j], tmpenv[j], len+1, char);
1480 tmpenv[max] = Nullch;
1481 environ = tmpenv; /* tell exec where it is now */
1484 safesysfree(environ[i]);
1485 while (environ[i]) {
1486 environ[i] = environ[i+1];
1491 if (!environ[i]) { /* does not exist yet */
1492 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1493 environ[i+1] = Nullch; /* make sure it's null terminated */
1496 safesysfree(environ[i]);
1500 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1501 /* all that work just for this */
1502 my_setenv_format(environ[i], nam, nlen, val, vlen);
1504 #else /* PERL_USE_SAFE_PUTENV */
1505 # if defined(__CYGWIN__) || defined( EPOC)
1506 setenv(nam, val, 1);
1509 int nlen = strlen(nam), vlen;
1514 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1515 /* all that work just for this */
1516 my_setenv_format(new_env, nam, nlen, val, vlen);
1517 (void)putenv(new_env);
1518 # endif /* __CYGWIN__ */
1519 #endif /* PERL_USE_SAFE_PUTENV */
1523 #else /* WIN32 || NETWARE */
1526 Perl_my_setenv(pTHX_ char *nam,char *val)
1528 register char *envstr;
1529 int nlen = strlen(nam), vlen;
1535 New(904, envstr, nlen+vlen+2, char);
1536 my_setenv_format(envstr, nam, nlen, val, vlen);
1537 (void)PerlEnv_putenv(envstr);
1541 #endif /* WIN32 || NETWARE */
1545 Perl_setenv_getix(pTHX_ char *nam)
1547 register I32 i, len = strlen(nam);
1549 for (i = 0; environ[i]; i++) {
1552 strnicmp(environ[i],nam,len) == 0
1554 strnEQ(environ[i],nam,len)
1556 && environ[i][len] == '=')
1557 break; /* strnEQ must come first to avoid */
1558 } /* potential SEGV's */
1561 #endif /* !PERL_MICRO */
1563 #endif /* !VMS && !EPOC*/
1565 #ifdef UNLINK_ALL_VERSIONS
1567 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1571 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1576 /* this is a drop-in replacement for bcopy() */
1577 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1579 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1583 if (from - to >= 0) {
1591 *(--to) = *(--from);
1597 /* this is a drop-in replacement for memset() */
1600 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1610 /* this is a drop-in replacement for bzero() */
1611 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1613 Perl_my_bzero(register char *loc, register I32 len)
1623 /* this is a drop-in replacement for memcmp() */
1624 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1626 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1628 register U8 *a = (U8 *)s1;
1629 register U8 *b = (U8 *)s2;
1633 if (tmp = *a++ - *b++)
1638 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1642 #ifdef USE_CHAR_VSPRINTF
1647 vsprintf(char *dest, const char *pat, char *args)
1651 fakebuf._ptr = dest;
1652 fakebuf._cnt = 32767;
1656 fakebuf._flag = _IOWRT|_IOSTRG;
1657 _doprnt(pat, args, &fakebuf); /* what a kludge */
1658 (void)putc('\0', &fakebuf);
1659 #ifdef USE_CHAR_VSPRINTF
1662 return 0; /* perl doesn't use return value */
1666 #endif /* HAS_VPRINTF */
1669 #if BYTEORDER != 0x4321
1671 Perl_my_swap(pTHX_ short s)
1673 #if (BYTEORDER & 1) == 0
1676 result = ((s & 255) << 8) + ((s >> 8) & 255);
1684 Perl_my_htonl(pTHX_ long l)
1688 char c[sizeof(long)];
1691 #if BYTEORDER == 0x1234
1692 u.c[0] = (l >> 24) & 255;
1693 u.c[1] = (l >> 16) & 255;
1694 u.c[2] = (l >> 8) & 255;
1698 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1699 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1704 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1705 u.c[o & 0xf] = (l >> s) & 255;
1713 Perl_my_ntohl(pTHX_ long l)
1717 char c[sizeof(long)];
1720 #if BYTEORDER == 0x1234
1721 u.c[0] = (l >> 24) & 255;
1722 u.c[1] = (l >> 16) & 255;
1723 u.c[2] = (l >> 8) & 255;
1727 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1728 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1735 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1736 l |= (u.c[o & 0xf] & 255) << s;
1743 #endif /* BYTEORDER != 0x4321 */
1747 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1748 * If these functions are defined,
1749 * the BYTEORDER is neither 0x1234 nor 0x4321.
1750 * However, this is not assumed.
1754 #define HTOLE(name,type) \
1756 name (register type n) \
1760 char c[sizeof(type)]; \
1763 register I32 s = 0; \
1764 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1765 u.c[i] = (n >> s) & 0xFF; \
1770 #define LETOH(name,type) \
1772 name (register type n) \
1776 char c[sizeof(type)]; \
1779 register I32 s = 0; \
1782 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1783 n |= ((type)(u.c[i] & 0xFF)) << s; \
1789 * Big-endian byte order functions.
1792 #define HTOBE(name,type) \
1794 name (register type n) \
1798 char c[sizeof(type)]; \
1801 register I32 s = 8*(sizeof(u.c)-1); \
1802 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1803 u.c[i] = (n >> s) & 0xFF; \
1808 #define BETOH(name,type) \
1810 name (register type n) \
1814 char c[sizeof(type)]; \
1817 register I32 s = 8*(sizeof(u.c)-1); \
1820 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1821 n |= ((type)(u.c[i] & 0xFF)) << s; \
1827 * If we just can't do it...
1830 #define NOT_AVAIL(name,type) \
1832 name (register type n) \
1834 Perl_croak_nocontext(#name "() not available"); \
1835 return n; /* not reached */ \
1839 #if defined(HAS_HTOVS) && !defined(htovs)
1842 #if defined(HAS_HTOVL) && !defined(htovl)
1845 #if defined(HAS_VTOHS) && !defined(vtohs)
1848 #if defined(HAS_VTOHL) && !defined(vtohl)
1852 #ifdef PERL_NEED_MY_HTOLE16
1854 HTOLE(Perl_my_htole16,U16)
1856 NOT_AVAIL(Perl_my_htole16,U16)
1859 #ifdef PERL_NEED_MY_LETOH16
1861 LETOH(Perl_my_letoh16,U16)
1863 NOT_AVAIL(Perl_my_letoh16,U16)
1866 #ifdef PERL_NEED_MY_HTOBE16
1868 HTOBE(Perl_my_htobe16,U16)
1870 NOT_AVAIL(Perl_my_htobe16,U16)
1873 #ifdef PERL_NEED_MY_BETOH16
1875 BETOH(Perl_my_betoh16,U16)
1877 NOT_AVAIL(Perl_my_betoh16,U16)
1881 #ifdef PERL_NEED_MY_HTOLE32
1883 HTOLE(Perl_my_htole32,U32)
1885 NOT_AVAIL(Perl_my_htole32,U32)
1888 #ifdef PERL_NEED_MY_LETOH32
1890 LETOH(Perl_my_letoh32,U32)
1892 NOT_AVAIL(Perl_my_letoh32,U32)
1895 #ifdef PERL_NEED_MY_HTOBE32
1897 HTOBE(Perl_my_htobe32,U32)
1899 NOT_AVAIL(Perl_my_htobe32,U32)
1902 #ifdef PERL_NEED_MY_BETOH32
1904 BETOH(Perl_my_betoh32,U32)
1906 NOT_AVAIL(Perl_my_betoh32,U32)
1910 #ifdef PERL_NEED_MY_HTOLE64
1912 HTOLE(Perl_my_htole64,U64)
1914 NOT_AVAIL(Perl_my_htole64,U64)
1917 #ifdef PERL_NEED_MY_LETOH64
1919 LETOH(Perl_my_letoh64,U64)
1921 NOT_AVAIL(Perl_my_letoh64,U64)
1924 #ifdef PERL_NEED_MY_HTOBE64
1926 HTOBE(Perl_my_htobe64,U64)
1928 NOT_AVAIL(Perl_my_htobe64,U64)
1931 #ifdef PERL_NEED_MY_BETOH64
1933 BETOH(Perl_my_betoh64,U64)
1935 NOT_AVAIL(Perl_my_betoh64,U64)
1939 #ifdef PERL_NEED_MY_HTOLES
1940 HTOLE(Perl_my_htoles,short)
1942 #ifdef PERL_NEED_MY_LETOHS
1943 LETOH(Perl_my_letohs,short)
1945 #ifdef PERL_NEED_MY_HTOBES
1946 HTOBE(Perl_my_htobes,short)
1948 #ifdef PERL_NEED_MY_BETOHS
1949 BETOH(Perl_my_betohs,short)
1952 #ifdef PERL_NEED_MY_HTOLEI
1953 HTOLE(Perl_my_htolei,int)
1955 #ifdef PERL_NEED_MY_LETOHI
1956 LETOH(Perl_my_letohi,int)
1958 #ifdef PERL_NEED_MY_HTOBEI
1959 HTOBE(Perl_my_htobei,int)
1961 #ifdef PERL_NEED_MY_BETOHI
1962 BETOH(Perl_my_betohi,int)
1965 #ifdef PERL_NEED_MY_HTOLEL
1966 HTOLE(Perl_my_htolel,long)
1968 #ifdef PERL_NEED_MY_LETOHL
1969 LETOH(Perl_my_letohl,long)
1971 #ifdef PERL_NEED_MY_HTOBEL
1972 HTOBE(Perl_my_htobel,long)
1974 #ifdef PERL_NEED_MY_BETOHL
1975 BETOH(Perl_my_betohl,long)
1979 Perl_my_swabn(void *ptr, int n)
1981 register char *s = (char *)ptr;
1982 register char *e = s + (n-1);
1985 for (n /= 2; n > 0; s++, e--, n--) {
1993 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1995 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1997 register I32 This, that;
2003 PERL_FLUSHALL_FOR_CHILD;
2004 This = (*mode == 'w');
2008 taint_proper("Insecure %s%s", "EXEC");
2010 if (PerlProc_pipe(p) < 0)
2012 /* Try for another pipe pair for error return */
2013 if (PerlProc_pipe(pp) >= 0)
2015 while ((pid = PerlProc_fork()) < 0) {
2016 if (errno != EAGAIN) {
2017 PerlLIO_close(p[This]);
2018 PerlLIO_close(p[that]);
2020 PerlLIO_close(pp[0]);
2021 PerlLIO_close(pp[1]);
2033 /* Close parent's end of error status pipe (if any) */
2035 PerlLIO_close(pp[0]);
2036 #if defined(HAS_FCNTL) && defined(F_SETFD)
2037 /* Close error pipe automatically if exec works */
2038 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2041 /* Now dup our end of _the_ pipe to right position */
2042 if (p[THIS] != (*mode == 'r')) {
2043 PerlLIO_dup2(p[THIS], *mode == 'r');
2044 PerlLIO_close(p[THIS]);
2045 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2046 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2049 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2050 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2051 /* No automatic close - do it by hand */
2058 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2064 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2070 do_execfree(); /* free any memory malloced by child on fork */
2072 PerlLIO_close(pp[1]);
2073 /* Keep the lower of the two fd numbers */
2074 if (p[that] < p[This]) {
2075 PerlLIO_dup2(p[This], p[that]);
2076 PerlLIO_close(p[This]);
2080 PerlLIO_close(p[that]); /* close child's end of pipe */
2083 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2085 (void)SvUPGRADE(sv,SVt_IV);
2087 PL_forkprocess = pid;
2088 /* If we managed to get status pipe check for exec fail */
2089 if (did_pipes && pid > 0) {
2093 while (n < sizeof(int)) {
2094 n1 = PerlLIO_read(pp[0],
2095 (void*)(((char*)&errkid)+n),
2101 PerlLIO_close(pp[0]);
2103 if (n) { /* Error */
2105 PerlLIO_close(p[This]);
2106 if (n != sizeof(int))
2107 Perl_croak(aTHX_ "panic: kid popen errno read");
2109 pid2 = wait4pid(pid, &status, 0);
2110 } while (pid2 == -1 && errno == EINTR);
2111 errno = errkid; /* Propagate errno from kid */
2116 PerlLIO_close(pp[0]);
2117 return PerlIO_fdopen(p[This], mode);
2119 Perl_croak(aTHX_ "List form of piped open not implemented");
2120 return (PerlIO *) NULL;
2124 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2125 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2127 Perl_my_popen(pTHX_ char *cmd, char *mode)
2130 register I32 This, that;
2133 I32 doexec = strNE(cmd,"-");
2137 PERL_FLUSHALL_FOR_CHILD;
2140 return my_syspopen(aTHX_ cmd,mode);
2143 This = (*mode == 'w');
2145 if (doexec && PL_tainting) {
2147 taint_proper("Insecure %s%s", "EXEC");
2149 if (PerlProc_pipe(p) < 0)
2151 if (doexec && PerlProc_pipe(pp) >= 0)
2153 while ((pid = PerlProc_fork()) < 0) {
2154 if (errno != EAGAIN) {
2155 PerlLIO_close(p[This]);
2156 PerlLIO_close(p[that]);
2158 PerlLIO_close(pp[0]);
2159 PerlLIO_close(pp[1]);
2162 Perl_croak(aTHX_ "Can't fork");
2175 PerlLIO_close(pp[0]);
2176 #if defined(HAS_FCNTL) && defined(F_SETFD)
2177 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2180 if (p[THIS] != (*mode == 'r')) {
2181 PerlLIO_dup2(p[THIS], *mode == 'r');
2182 PerlLIO_close(p[THIS]);
2183 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2184 PerlLIO_close(p[THAT]);
2187 PerlLIO_close(p[THAT]);
2190 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2199 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2204 /* may or may not use the shell */
2205 do_exec3(cmd, pp[1], did_pipes);
2208 #endif /* defined OS2 */
2210 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2211 SvREADONLY_off(GvSV(tmpgv));
2212 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2213 SvREADONLY_on(GvSV(tmpgv));
2215 #ifdef THREADS_HAVE_PIDS
2216 PL_ppid = (IV)getppid();
2219 hv_clear(PL_pidstatus); /* we have no children */
2224 do_execfree(); /* free any memory malloced by child on vfork */
2226 PerlLIO_close(pp[1]);
2227 if (p[that] < p[This]) {
2228 PerlLIO_dup2(p[This], p[that]);
2229 PerlLIO_close(p[This]);
2233 PerlLIO_close(p[that]);
2236 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2238 (void)SvUPGRADE(sv,SVt_IV);
2240 PL_forkprocess = pid;
2241 if (did_pipes && pid > 0) {
2245 while (n < sizeof(int)) {
2246 n1 = PerlLIO_read(pp[0],
2247 (void*)(((char*)&errkid)+n),
2253 PerlLIO_close(pp[0]);
2255 if (n) { /* Error */
2257 PerlLIO_close(p[This]);
2258 if (n != sizeof(int))
2259 Perl_croak(aTHX_ "panic: kid popen errno read");
2261 pid2 = wait4pid(pid, &status, 0);
2262 } while (pid2 == -1 && errno == EINTR);
2263 errno = errkid; /* Propagate errno from kid */
2268 PerlLIO_close(pp[0]);
2269 return PerlIO_fdopen(p[This], mode);
2272 #if defined(atarist) || defined(EPOC)
2275 Perl_my_popen(pTHX_ char *cmd, char *mode)
2277 PERL_FLUSHALL_FOR_CHILD;
2278 /* Call system's popen() to get a FILE *, then import it.
2279 used 0 for 2nd parameter to PerlIO_importFILE;
2282 return PerlIO_importFILE(popen(cmd, mode), 0);
2286 FILE *djgpp_popen();
2288 Perl_my_popen(pTHX_ char *cmd, char *mode)
2290 PERL_FLUSHALL_FOR_CHILD;
2291 /* Call system's popen() to get a FILE *, then import it.
2292 used 0 for 2nd parameter to PerlIO_importFILE;
2295 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2300 #endif /* !DOSISH */
2302 /* this is called in parent before the fork() */
2304 Perl_atfork_lock(void)
2306 #if defined(USE_ITHREADS)
2307 /* locks must be held in locking order (if any) */
2309 MUTEX_LOCK(&PL_malloc_mutex);
2315 /* this is called in both parent and child after the fork() */
2317 Perl_atfork_unlock(void)
2319 #if defined(USE_ITHREADS)
2320 /* locks must be released in same order as in atfork_lock() */
2322 MUTEX_UNLOCK(&PL_malloc_mutex);
2331 #if defined(HAS_FORK)
2333 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2338 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2339 * handlers elsewhere in the code */
2344 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2345 Perl_croak_nocontext("fork() not available");
2347 #endif /* HAS_FORK */
2352 Perl_dump_fds(pTHX_ char *s)
2357 PerlIO_printf(Perl_debug_log,"%s", s);
2358 for (fd = 0; fd < 32; fd++) {
2359 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2360 PerlIO_printf(Perl_debug_log," %d",fd);
2362 PerlIO_printf(Perl_debug_log,"\n");
2364 #endif /* DUMP_FDS */
2368 dup2(int oldfd, int newfd)
2370 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2373 PerlLIO_close(newfd);
2374 return fcntl(oldfd, F_DUPFD, newfd);
2376 #define DUP2_MAX_FDS 256
2377 int fdtmp[DUP2_MAX_FDS];
2383 PerlLIO_close(newfd);
2384 /* good enough for low fd's... */
2385 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2386 if (fdx >= DUP2_MAX_FDS) {
2394 PerlLIO_close(fdtmp[--fdx]);
2401 #ifdef HAS_SIGACTION
2403 #ifdef MACOS_TRADITIONAL
2404 /* We don't want restart behavior on MacOS */
2409 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2411 struct sigaction act, oact;
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 if (sigaction(signo, &act, &oact) == -1)
2433 return oact.sa_handler;
2437 Perl_rsignal_state(pTHX_ int signo)
2439 struct sigaction oact;
2441 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2444 return oact.sa_handler;
2448 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2450 struct sigaction act;
2453 /* only "parent" interpreter can diddle signals */
2454 if (PL_curinterp != aTHX)
2458 act.sa_handler = handler;
2459 sigemptyset(&act.sa_mask);
2462 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2463 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2465 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2466 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2467 act.sa_flags |= SA_NOCLDWAIT;
2469 return sigaction(signo, &act, save);
2473 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2476 /* only "parent" interpreter can diddle signals */
2477 if (PL_curinterp != aTHX)
2481 return sigaction(signo, save, (struct sigaction *)NULL);
2484 #else /* !HAS_SIGACTION */
2487 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2489 #if defined(USE_ITHREADS) && !defined(WIN32)
2490 /* only "parent" interpreter can diddle signals */
2491 if (PL_curinterp != aTHX)
2495 return PerlProc_signal(signo, handler);
2498 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2499 ignore the implications of this for threading */
2509 Perl_rsignal_state(pTHX_ int signo)
2511 Sighandler_t oldsig;
2513 #if defined(USE_ITHREADS) && !defined(WIN32)
2514 /* only "parent" interpreter can diddle signals */
2515 if (PL_curinterp != aTHX)
2520 oldsig = PerlProc_signal(signo, sig_trap);
2521 PerlProc_signal(signo, oldsig);
2523 PerlProc_kill(PerlProc_getpid(), signo);
2528 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2530 #if defined(USE_ITHREADS) && !defined(WIN32)
2531 /* only "parent" interpreter can diddle signals */
2532 if (PL_curinterp != aTHX)
2535 *save = PerlProc_signal(signo, handler);
2536 return (*save == SIG_ERR) ? -1 : 0;
2540 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2542 #if defined(USE_ITHREADS) && !defined(WIN32)
2543 /* only "parent" interpreter can diddle signals */
2544 if (PL_curinterp != aTHX)
2547 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2550 #endif /* !HAS_SIGACTION */
2551 #endif /* !PERL_MICRO */
2553 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2554 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2556 Perl_my_pclose(pTHX_ PerlIO *ptr)
2558 Sigsave_t hstat, istat, qstat;
2564 int saved_errno = 0;
2566 int saved_vaxc_errno;
2569 int saved_win32_errno;
2573 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2575 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2577 *svp = &PL_sv_undef;
2579 if (pid == -1) { /* Opened by popen. */
2580 return my_syspclose(ptr);
2583 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2584 saved_errno = errno;
2586 saved_vaxc_errno = vaxc$errno;
2589 saved_win32_errno = GetLastError();
2593 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2596 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2597 rsignal_save(SIGINT, SIG_IGN, &istat);
2598 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2601 pid2 = wait4pid(pid, &status, 0);
2602 } while (pid2 == -1 && errno == EINTR);
2604 rsignal_restore(SIGHUP, &hstat);
2605 rsignal_restore(SIGINT, &istat);
2606 rsignal_restore(SIGQUIT, &qstat);
2609 SETERRNO(saved_errno, saved_vaxc_errno);
2612 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2614 #endif /* !DOSISH */
2616 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2618 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2623 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2627 char spid[TYPE_CHARS(int)];
2630 sprintf(spid, "%"IVdf, (IV)pid);
2631 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2632 if (svp && *svp != &PL_sv_undef) {
2633 *statusp = SvIVX(*svp);
2634 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2641 hv_iterinit(PL_pidstatus);
2642 if ((entry = hv_iternext(PL_pidstatus))) {
2644 char spid[TYPE_CHARS(int)];
2646 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2647 sv = hv_iterval(PL_pidstatus,entry);
2648 *statusp = SvIVX(sv);
2649 sprintf(spid, "%"IVdf, (IV)pid);
2650 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2657 # ifdef HAS_WAITPID_RUNTIME
2658 if (!HAS_WAITPID_RUNTIME)
2661 result = PerlProc_waitpid(pid,statusp,flags);
2664 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2665 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2668 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2672 Perl_croak(aTHX_ "Can't do waitpid with flags");
2674 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2675 pidgone(result,*statusp);
2682 if (result < 0 && errno == EINTR) {
2687 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2691 Perl_pidgone(pTHX_ Pid_t pid, int status)
2694 char spid[TYPE_CHARS(int)];
2696 sprintf(spid, "%"IVdf, (IV)pid);
2697 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2698 (void)SvUPGRADE(sv,SVt_IV);
2703 #if defined(atarist) || defined(OS2) || defined(EPOC)
2706 int /* Cannot prototype with I32
2708 my_syspclose(PerlIO *ptr)
2711 Perl_my_pclose(pTHX_ PerlIO *ptr)
2714 /* Needs work for PerlIO ! */
2715 FILE *f = PerlIO_findFILE(ptr);
2716 I32 result = pclose(f);
2717 PerlIO_releaseFILE(ptr,f);
2725 Perl_my_pclose(pTHX_ PerlIO *ptr)
2727 /* Needs work for PerlIO ! */
2728 FILE *f = PerlIO_findFILE(ptr);
2729 I32 result = djgpp_pclose(f);
2730 result = (result << 8) & 0xff00;
2731 PerlIO_releaseFILE(ptr,f);
2737 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2740 register const char *frombase = from;
2743 register const char c = *from;
2748 while (count-- > 0) {
2749 for (todo = len; todo > 0; todo--) {
2758 Perl_same_dirent(pTHX_ char *a, char *b)
2760 char *fa = strrchr(a,'/');
2761 char *fb = strrchr(b,'/');
2764 SV *tmpsv = sv_newmortal();
2777 sv_setpv(tmpsv, ".");
2779 sv_setpvn(tmpsv, a, fa - a);
2780 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2783 sv_setpv(tmpsv, ".");
2785 sv_setpvn(tmpsv, b, fb - b);
2786 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2788 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2789 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2791 #endif /* !HAS_RENAME */
2794 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2796 char *xfound = Nullch;
2797 char *xfailed = Nullch;
2798 char tmpbuf[MAXPATHLEN];
2802 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2803 # define SEARCH_EXTS ".bat", ".cmd", NULL
2804 # define MAX_EXT_LEN 4
2807 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2808 # define MAX_EXT_LEN 4
2811 # define SEARCH_EXTS ".pl", ".com", NULL
2812 # define MAX_EXT_LEN 4
2814 /* additional extensions to try in each dir if scriptname not found */
2816 char *exts[] = { SEARCH_EXTS };
2817 char **ext = search_ext ? search_ext : exts;
2818 int extidx = 0, i = 0;
2819 char *curext = Nullch;
2821 # define MAX_EXT_LEN 0
2825 * If dosearch is true and if scriptname does not contain path
2826 * delimiters, search the PATH for scriptname.
2828 * If SEARCH_EXTS is also defined, will look for each
2829 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2830 * while searching the PATH.
2832 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2833 * proceeds as follows:
2834 * If DOSISH or VMSISH:
2835 * + look for ./scriptname{,.foo,.bar}
2836 * + search the PATH for scriptname{,.foo,.bar}
2839 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2840 * this will not look in '.' if it's not in the PATH)
2845 # ifdef ALWAYS_DEFTYPES
2846 len = strlen(scriptname);
2847 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2848 int hasdir, idx = 0, deftypes = 1;
2851 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2854 int hasdir, idx = 0, deftypes = 1;
2857 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2859 /* The first time through, just add SEARCH_EXTS to whatever we
2860 * already have, so we can check for default file types. */
2862 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2868 if ((strlen(tmpbuf) + strlen(scriptname)
2869 + MAX_EXT_LEN) >= sizeof tmpbuf)
2870 continue; /* don't search dir with too-long name */
2871 strcat(tmpbuf, scriptname);
2875 if (strEQ(scriptname, "-"))
2877 if (dosearch) { /* Look in '.' first. */
2878 char *cur = scriptname;
2880 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2882 if (strEQ(ext[i++],curext)) {
2883 extidx = -1; /* already has an ext */
2888 DEBUG_p(PerlIO_printf(Perl_debug_log,
2889 "Looking for %s\n",cur));
2890 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2891 && !S_ISDIR(PL_statbuf.st_mode)) {
2899 if (cur == scriptname) {
2900 len = strlen(scriptname);
2901 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2903 cur = strcpy(tmpbuf, scriptname);
2905 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2906 && strcpy(tmpbuf+len, ext[extidx++]));
2911 #ifdef MACOS_TRADITIONAL
2912 if (dosearch && !strchr(scriptname, ':') &&
2913 (s = PerlEnv_getenv("Commands")))
2915 if (dosearch && !strchr(scriptname, '/')
2917 && !strchr(scriptname, '\\')
2919 && (s = PerlEnv_getenv("PATH")))
2924 PL_bufend = s + strlen(s);
2925 while (s < PL_bufend) {
2926 #ifdef MACOS_TRADITIONAL
2927 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2931 #if defined(atarist) || defined(DOSISH)
2936 && *s != ';'; len++, s++) {
2937 if (len < sizeof tmpbuf)
2940 if (len < sizeof tmpbuf)
2942 #else /* ! (atarist || DOSISH) */
2943 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2946 #endif /* ! (atarist || DOSISH) */
2947 #endif /* MACOS_TRADITIONAL */
2950 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2951 continue; /* don't search dir with too-long name */
2952 #ifdef MACOS_TRADITIONAL
2953 if (len && tmpbuf[len - 1] != ':')
2954 tmpbuf[len++] = ':';
2957 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2958 && tmpbuf[len - 1] != '/'
2959 && tmpbuf[len - 1] != '\\'
2962 tmpbuf[len++] = '/';
2963 if (len == 2 && tmpbuf[0] == '.')
2966 (void)strcpy(tmpbuf + len, scriptname);
2970 len = strlen(tmpbuf);
2971 if (extidx > 0) /* reset after previous loop */
2975 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2976 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2977 if (S_ISDIR(PL_statbuf.st_mode)) {
2981 } while ( retval < 0 /* not there */
2982 && extidx>=0 && ext[extidx] /* try an extension? */
2983 && strcpy(tmpbuf+len, ext[extidx++])
2988 if (S_ISREG(PL_statbuf.st_mode)
2989 && cando(S_IRUSR,TRUE,&PL_statbuf)
2990 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2991 && cando(S_IXUSR,TRUE,&PL_statbuf)
2995 xfound = tmpbuf; /* bingo! */
2999 xfailed = savepv(tmpbuf);
3002 if (!xfound && !seen_dot && !xfailed &&
3003 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3004 || S_ISDIR(PL_statbuf.st_mode)))
3006 seen_dot = 1; /* Disable message. */
3008 if (flags & 1) { /* do or die? */
3009 Perl_croak(aTHX_ "Can't %s %s%s%s",
3010 (xfailed ? "execute" : "find"),
3011 (xfailed ? xfailed : scriptname),
3012 (xfailed ? "" : " on PATH"),
3013 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3015 scriptname = Nullch;
3019 scriptname = xfound;
3021 return (scriptname ? savepv(scriptname) : Nullch);
3024 #ifndef PERL_GET_CONTEXT_DEFINED
3027 Perl_get_context(void)
3029 #if defined(USE_ITHREADS)
3030 # ifdef OLD_PTHREADS_API
3032 if (pthread_getspecific(PL_thr_key, &t))
3033 Perl_croak_nocontext("panic: pthread_getspecific");
3036 # ifdef I_MACH_CTHREADS
3037 return (void*)cthread_data(cthread_self());
3039 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3048 Perl_set_context(void *t)
3050 #if defined(USE_ITHREADS)
3051 # ifdef I_MACH_CTHREADS
3052 cthread_set_data(cthread_self(), t);
3054 if (pthread_setspecific(PL_thr_key, t))
3055 Perl_croak_nocontext("panic: pthread_setspecific");
3060 #endif /* !PERL_GET_CONTEXT_DEFINED */
3062 #ifdef PERL_GLOBAL_STRUCT
3071 Perl_get_op_names(pTHX)
3077 Perl_get_op_descs(pTHX)
3083 Perl_get_no_modify(pTHX)
3085 return (char*)PL_no_modify;
3089 Perl_get_opargs(pTHX)
3095 Perl_get_ppaddr(pTHX)
3097 return (PPADDR_t*)PL_ppaddr;
3100 #ifndef HAS_GETENV_LEN
3102 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3104 char *env_trans = PerlEnv_getenv(env_elem);
3106 *len = strlen(env_trans);
3113 Perl_get_vtbl(pTHX_ int vtbl_id)
3115 MGVTBL* result = Null(MGVTBL*);
3119 result = &PL_vtbl_sv;
3122 result = &PL_vtbl_env;
3124 case want_vtbl_envelem:
3125 result = &PL_vtbl_envelem;
3128 result = &PL_vtbl_sig;
3130 case want_vtbl_sigelem:
3131 result = &PL_vtbl_sigelem;
3133 case want_vtbl_pack:
3134 result = &PL_vtbl_pack;
3136 case want_vtbl_packelem:
3137 result = &PL_vtbl_packelem;
3139 case want_vtbl_dbline:
3140 result = &PL_vtbl_dbline;
3143 result = &PL_vtbl_isa;
3145 case want_vtbl_isaelem:
3146 result = &PL_vtbl_isaelem;
3148 case want_vtbl_arylen:
3149 result = &PL_vtbl_arylen;
3151 case want_vtbl_glob:
3152 result = &PL_vtbl_glob;
3154 case want_vtbl_mglob:
3155 result = &PL_vtbl_mglob;
3157 case want_vtbl_nkeys:
3158 result = &PL_vtbl_nkeys;
3160 case want_vtbl_taint:
3161 result = &PL_vtbl_taint;
3163 case want_vtbl_substr:
3164 result = &PL_vtbl_substr;
3167 result = &PL_vtbl_vec;
3170 result = &PL_vtbl_pos;
3173 result = &PL_vtbl_bm;
3176 result = &PL_vtbl_fm;
3178 case want_vtbl_uvar:
3179 result = &PL_vtbl_uvar;
3181 case want_vtbl_defelem:
3182 result = &PL_vtbl_defelem;
3184 case want_vtbl_regexp:
3185 result = &PL_vtbl_regexp;
3187 case want_vtbl_regdata:
3188 result = &PL_vtbl_regdata;
3190 case want_vtbl_regdatum:
3191 result = &PL_vtbl_regdatum;
3193 #ifdef USE_LOCALE_COLLATE
3194 case want_vtbl_collxfrm:
3195 result = &PL_vtbl_collxfrm;
3198 case want_vtbl_amagic:
3199 result = &PL_vtbl_amagic;
3201 case want_vtbl_amagicelem:
3202 result = &PL_vtbl_amagicelem;
3204 case want_vtbl_backref:
3205 result = &PL_vtbl_backref;
3207 case want_vtbl_utf8:
3208 result = &PL_vtbl_utf8;
3215 Perl_my_fflush_all(pTHX)
3217 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3218 return PerlIO_flush(NULL);
3220 # if defined(HAS__FWALK)
3221 extern int fflush(FILE *);
3222 /* undocumented, unprototyped, but very useful BSDism */
3223 extern void _fwalk(int (*)(FILE *));
3227 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3229 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3230 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3232 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3233 open_max = sysconf(_SC_OPEN_MAX);
3236 open_max = FOPEN_MAX;
3239 open_max = OPEN_MAX;
3250 for (i = 0; i < open_max; i++)
3251 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3252 STDIO_STREAM_ARRAY[i]._file < open_max &&
3253 STDIO_STREAM_ARRAY[i]._flag)
3254 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3258 SETERRNO(EBADF,RMS_IFI);
3265 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3268 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3269 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3271 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3272 char *type = OP_IS_SOCKET(op)
3273 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3274 ? "socket" : "filehandle";
3277 if (gv && isGV(gv)) {
3281 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3282 if (ckWARN(WARN_IO)) {
3283 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3285 Perl_warner(aTHX_ packWARN(WARN_IO),
3286 "Filehandle %s opened only for %sput",
3289 Perl_warner(aTHX_ packWARN(WARN_IO),
3290 "Filehandle opened only for %sput", direction);
3297 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3299 warn_type = WARN_CLOSED;
3303 warn_type = WARN_UNOPENED;
3306 if (ckWARN(warn_type)) {
3307 if (name && *name) {
3308 Perl_warner(aTHX_ packWARN(warn_type),
3309 "%s%s on %s %s %s", func, pars, vile, type, name);
3310 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3312 aTHX_ packWARN(warn_type),
3313 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3318 Perl_warner(aTHX_ packWARN(warn_type),
3319 "%s%s on %s %s", func, pars, vile, type);
3320 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3322 aTHX_ packWARN(warn_type),
3323 "\t(Are you trying to call %s%s on dirhandle?)\n",
3332 /* in ASCII order, not that it matters */
3333 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3336 Perl_ebcdic_control(pTHX_ int ch)
3344 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3345 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3348 if (ctlp == controllablechars)
3349 return('\177'); /* DEL */
3351 return((unsigned char)(ctlp - controllablechars - 1));
3352 } else { /* Want uncontrol */
3353 if (ch == '\177' || ch == -1)
3355 else if (ch == '\157')
3357 else if (ch == '\174')
3359 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3361 else if (ch == '\155')
3363 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3364 return(controllablechars[ch+1]);
3366 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3371 /* To workaround core dumps from the uninitialised tm_zone we get the
3372 * system to give us a reasonable struct to copy. This fix means that
3373 * strftime uses the tm_zone and tm_gmtoff values returned by
3374 * localtime(time()). That should give the desired result most of the
3375 * time. But probably not always!
3377 * This does not address tzname aspects of NETaa14816.
3382 # ifndef STRUCT_TM_HASZONE
3383 # define STRUCT_TM_HASZONE
3387 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3388 # ifndef HAS_TM_TM_ZONE
3389 # define HAS_TM_TM_ZONE
3394 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3396 #ifdef HAS_TM_TM_ZONE
3399 Copy(localtime(&now), ptm, 1, struct tm);
3404 * mini_mktime - normalise struct tm values without the localtime()
3405 * semantics (and overhead) of mktime().
3408 Perl_mini_mktime(pTHX_ struct tm *ptm)
3412 int month, mday, year, jday;
3413 int odd_cent, odd_year;
3415 #define DAYS_PER_YEAR 365
3416 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3417 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3418 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3419 #define SECS_PER_HOUR (60*60)
3420 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3421 /* parentheses deliberately absent on these two, otherwise they don't work */
3422 #define MONTH_TO_DAYS 153/5
3423 #define DAYS_TO_MONTH 5/153
3424 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3425 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3426 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3427 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3430 * Year/day algorithm notes:
3432 * With a suitable offset for numeric value of the month, one can find
3433 * an offset into the year by considering months to have 30.6 (153/5) days,
3434 * using integer arithmetic (i.e., with truncation). To avoid too much
3435 * messing about with leap days, we consider January and February to be
3436 * the 13th and 14th month of the previous year. After that transformation,
3437 * we need the month index we use to be high by 1 from 'normal human' usage,
3438 * so the month index values we use run from 4 through 15.
3440 * Given that, and the rules for the Gregorian calendar (leap years are those
3441 * divisible by 4 unless also divisible by 100, when they must be divisible
3442 * by 400 instead), we can simply calculate the number of days since some
3443 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3444 * the days we derive from our month index, and adding in the day of the
3445 * month. The value used here is not adjusted for the actual origin which
3446 * it normally would use (1 January A.D. 1), since we're not exposing it.
3447 * We're only building the value so we can turn around and get the
3448 * normalised values for the year, month, day-of-month, and day-of-year.
3450 * For going backward, we need to bias the value we're using so that we find
3451 * the right year value. (Basically, we don't want the contribution of
3452 * March 1st to the number to apply while deriving the year). Having done
3453 * that, we 'count up' the contribution to the year number by accounting for
3454 * full quadracenturies (400-year periods) with their extra leap days, plus
3455 * the contribution from full centuries (to avoid counting in the lost leap
3456 * days), plus the contribution from full quad-years (to count in the normal
3457 * leap days), plus the leftover contribution from any non-leap years.
3458 * At this point, if we were working with an actual leap day, we'll have 0
3459 * days left over. This is also true for March 1st, however. So, we have
3460 * to special-case that result, and (earlier) keep track of the 'odd'
3461 * century and year contributions. If we got 4 extra centuries in a qcent,
3462 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3463 * Otherwise, we add back in the earlier bias we removed (the 123 from
3464 * figuring in March 1st), find the month index (integer division by 30.6),
3465 * and the remainder is the day-of-month. We then have to convert back to
3466 * 'real' months (including fixing January and February from being 14/15 in
3467 * the previous year to being in the proper year). After that, to get
3468 * tm_yday, we work with the normalised year and get a new yearday value for
3469 * January 1st, which we subtract from the yearday value we had earlier,
3470 * representing the date we've re-built. This is done from January 1
3471 * because tm_yday is 0-origin.
3473 * Since POSIX time routines are only guaranteed to work for times since the
3474 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3475 * applies Gregorian calendar rules even to dates before the 16th century
3476 * doesn't bother me. Besides, you'd need cultural context for a given
3477 * date to know whether it was Julian or Gregorian calendar, and that's
3478 * outside the scope for this routine. Since we convert back based on the
3479 * same rules we used to build the yearday, you'll only get strange results
3480 * for input which needed normalising, or for the 'odd' century years which
3481 * were leap years in the Julian calander but not in the Gregorian one.
3482 * I can live with that.
3484 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3485 * that's still outside the scope for POSIX time manipulation, so I don't
3489 year = 1900 + ptm->tm_year;
3490 month = ptm->tm_mon;
3491 mday = ptm->tm_mday;
3492 /* allow given yday with no month & mday to dominate the result */
3493 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3496 jday = 1 + ptm->tm_yday;
3505 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3506 yearday += month*MONTH_TO_DAYS + mday + jday;
3508 * Note that we don't know when leap-seconds were or will be,
3509 * so we have to trust the user if we get something which looks
3510 * like a sensible leap-second. Wild values for seconds will
3511 * be rationalised, however.
3513 if ((unsigned) ptm->tm_sec <= 60) {
3520 secs += 60 * ptm->tm_min;
3521 secs += SECS_PER_HOUR * ptm->tm_hour;
3523 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3524 /* got negative remainder, but need positive time */
3525 /* back off an extra day to compensate */
3526 yearday += (secs/SECS_PER_DAY)-1;
3527 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3530 yearday += (secs/SECS_PER_DAY);
3531 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3534 else if (secs >= SECS_PER_DAY) {
3535 yearday += (secs/SECS_PER_DAY);
3536 secs %= SECS_PER_DAY;
3538 ptm->tm_hour = secs/SECS_PER_HOUR;
3539 secs %= SECS_PER_HOUR;
3540 ptm->tm_min = secs/60;
3542 ptm->tm_sec += secs;
3543 /* done with time of day effects */
3545 * The algorithm for yearday has (so far) left it high by 428.
3546 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3547 * bias it by 123 while trying to figure out what year it
3548 * really represents. Even with this tweak, the reverse
3549 * translation fails for years before A.D. 0001.
3550 * It would still fail for Feb 29, but we catch that one below.
3552 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3553 yearday -= YEAR_ADJUST;
3554 year = (yearday / DAYS_PER_QCENT) * 400;
3555 yearday %= DAYS_PER_QCENT;
3556 odd_cent = yearday / DAYS_PER_CENT;
3557 year += odd_cent * 100;
3558 yearday %= DAYS_PER_CENT;
3559 year += (yearday / DAYS_PER_QYEAR) * 4;
3560 yearday %= DAYS_PER_QYEAR;
3561 odd_year = yearday / DAYS_PER_YEAR;
3563 yearday %= DAYS_PER_YEAR;
3564 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3569 yearday += YEAR_ADJUST; /* recover March 1st crock */
3570 month = yearday*DAYS_TO_MONTH;
3571 yearday -= month*MONTH_TO_DAYS;
3572 /* recover other leap-year adjustment */
3581 ptm->tm_year = year - 1900;
3583 ptm->tm_mday = yearday;
3584 ptm->tm_mon = month;
3588 ptm->tm_mon = month - 1;
3590 /* re-build yearday based on Jan 1 to get tm_yday */
3592 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3593 yearday += 14*MONTH_TO_DAYS + 1;
3594 ptm->tm_yday = jday - yearday;
3595 /* fix tm_wday if not overridden by caller */
3596 if ((unsigned)ptm->tm_wday > 6)
3597 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3601 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3609 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3612 mytm.tm_hour = hour;
3613 mytm.tm_mday = mday;
3615 mytm.tm_year = year;
3616 mytm.tm_wday = wday;
3617 mytm.tm_yday = yday;
3618 mytm.tm_isdst = isdst;
3620 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3621 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3626 #ifdef HAS_TM_TM_GMTOFF
3627 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3629 #ifdef HAS_TM_TM_ZONE
3630 mytm.tm_zone = mytm2.tm_zone;
3635 New(0, buf, buflen, char);
3636 len = strftime(buf, buflen, fmt, &mytm);
3638 ** The following is needed to handle to the situation where
3639 ** tmpbuf overflows. Basically we want to allocate a buffer
3640 ** and try repeatedly. The reason why it is so complicated
3641 ** is that getting a return value of 0 from strftime can indicate
3642 ** one of the following:
3643 ** 1. buffer overflowed,
3644 ** 2. illegal conversion specifier, or
3645 ** 3. the format string specifies nothing to be returned(not
3646 ** an error). This could be because format is an empty string
3647 ** or it specifies %p that yields an empty string in some locale.
3648 ** If there is a better way to make it portable, go ahead by
3651 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3654 /* Possibly buf overflowed - try again with a bigger buf */
3655 int fmtlen = strlen(fmt);
3656 int bufsize = fmtlen + buflen;
3658 New(0, buf, bufsize, char);
3660 buflen = strftime(buf, bufsize, fmt, &mytm);
3661 if (buflen > 0 && buflen < bufsize)
3663 /* heuristic to prevent out-of-memory errors */
3664 if (bufsize > 100*fmtlen) {
3670 Renew(buf, bufsize, char);
3675 Perl_croak(aTHX_ "panic: no strftime");
3680 #define SV_CWD_RETURN_UNDEF \
3681 sv_setsv(sv, &PL_sv_undef); \
3684 #define SV_CWD_ISDOT(dp) \
3685 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3686 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3689 =head1 Miscellaneous Functions
3691 =for apidoc getcwd_sv
3693 Fill the sv with current working directory
3698 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3699 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3700 * getcwd(3) if available
3701 * Comments from the orignal:
3702 * This is a faster version of getcwd. It's also more dangerous
3703 * because you might chdir out of a directory that you can't chdir
3707 Perl_getcwd_sv(pTHX_ register SV *sv)
3711 #ifndef INCOMPLETE_TAINTS
3717 char buf[MAXPATHLEN];
3719 /* Some getcwd()s automatically allocate a buffer of the given
3720 * size from the heap if they are given a NULL buffer pointer.
3721 * The problem is that this behaviour is not portable. */
3722 if (getcwd(buf, sizeof(buf) - 1)) {
3723 STRLEN len = strlen(buf);
3724 sv_setpvn(sv, buf, len);
3728 sv_setsv(sv, &PL_sv_undef);
3736 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3737 int namelen, pathlen=0;
3741 (void)SvUPGRADE(sv, SVt_PV);
3743 if (PerlLIO_lstat(".", &statbuf) < 0) {
3744 SV_CWD_RETURN_UNDEF;
3747 orig_cdev = statbuf.st_dev;
3748 orig_cino = statbuf.st_ino;
3756 if (PerlDir_chdir("..") < 0) {
3757 SV_CWD_RETURN_UNDEF;
3759 if (PerlLIO_stat(".", &statbuf) < 0) {
3760 SV_CWD_RETURN_UNDEF;
3763 cdev = statbuf.st_dev;
3764 cino = statbuf.st_ino;
3766 if (odev == cdev && oino == cino) {
3769 if (!(dir = PerlDir_open("."))) {
3770 SV_CWD_RETURN_UNDEF;
3773 while ((dp = PerlDir_read(dir)) != NULL) {
3775 namelen = dp->d_namlen;
3777 namelen = strlen(dp->d_name);
3780 if (SV_CWD_ISDOT(dp)) {
3784 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3785 SV_CWD_RETURN_UNDEF;
3788 tdev = statbuf.st_dev;
3789 tino = statbuf.st_ino;
3790 if (tino == oino && tdev == odev) {
3796 SV_CWD_RETURN_UNDEF;
3799 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3800 SV_CWD_RETURN_UNDEF;
3803 SvGROW(sv, pathlen + namelen + 1);
3807 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3810 /* prepend current directory to the front */
3812 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3813 pathlen += (namelen + 1);
3815 #ifdef VOID_CLOSEDIR
3818 if (PerlDir_close(dir) < 0) {
3819 SV_CWD_RETURN_UNDEF;
3825 SvCUR_set(sv, pathlen);
3829 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3830 SV_CWD_RETURN_UNDEF;
3833 if (PerlLIO_stat(".", &statbuf) < 0) {
3834 SV_CWD_RETURN_UNDEF;
3837 cdev = statbuf.st_dev;
3838 cino = statbuf.st_ino;
3840 if (cdev != orig_cdev || cino != orig_cino) {
3841 Perl_croak(aTHX_ "Unstable directory path, "
3842 "current directory changed unexpectedly");
3854 =for apidoc scan_version
3856 Returns a pointer to the next character after the parsed
3857 version string, as well as upgrading the passed in SV to
3860 Function must be called with an already existing SV like
3863 s = scan_version(s,SV *sv, bool qv);
3865 Performs some preprocessing to the string to ensure that
3866 it has the correct characteristics of a version. Flags the
3867 object if it contains an underscore (which denotes this
3868 is a alpha version). The boolean qv denotes that the version
3869 should be interpreted as if it had multiple decimals, even if
3876 Perl_scan_version(pTHX_ char *s, SV *rv, bool qv)
3878 const char *start = s;
3882 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3883 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3885 /* pre-scan the imput string to check for decimals */
3886 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3891 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3894 else if ( *pos == '_' )
3897 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3905 pos++; /* get past 'v' */
3906 qv = 1; /* force quoted version processing */
3908 while (isDIGIT(*pos))
3910 if (!isALPHA(*pos)) {
3913 if (*s == 'v') s++; /* get past 'v' */
3918 /* this is atoi() that delimits on underscores */
3922 if ( s < pos && s > start && *(s-1) == '_' ) {
3923 mult *= -1; /* alpha version */
3925 /* the following if() will only be true after the decimal
3926 * point of a version originally created with a bare
3927 * floating point number, i.e. not quoted in any way
3929 if ( !qv && s > start+1 && saw_period == 1 ) {
3933 rev += (*s - '0') * mult;
3935 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3936 Perl_croak(aTHX_ "Integer overflow in version");
3941 while (--end >= s) {
3943 rev += (*end - '0') * mult;
3945 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3946 Perl_croak(aTHX_ "Integer overflow in version");
3951 /* Append revision */
3952 av_push((AV *)sv, newSViv(rev));
3953 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3955 else if ( isDIGIT(*pos) )
3961 while ( isDIGIT(*pos) ) {
3962 if ( saw_period == 1 && pos-s == 3 )
3968 if ( qv ) { /* quoted versions always become full version objects */
3969 I32 len = av_len((AV *)sv);
3970 /* This for loop appears to trigger a compiler bug on OS X, as it
3971 loops infinitely. Yes, len is negative. No, it makes no sense.
3972 Compiler in question is:
3973 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3974 for ( len = 2 - len; len > 0; len-- )
3975 av_push((AV *)sv, newSViv(0));
3979 av_push((AV *)sv, newSViv(0));
3985 =for apidoc new_version
3987 Returns a new version object based on the passed in SV:
3989 SV *sv = new_version(SV *ver);
3991 Does not alter the passed in ver SV. See "upg_version" if you
3992 want to upgrade the SV.
3998 Perl_new_version(pTHX_ SV *ver)
4002 if ( SvVOK(ver) ) { /* already a v-string */
4004 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4005 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4006 sv_setpv(rv,version);
4011 sv_setsv(rv,ver); /* make a duplicate */
4020 =for apidoc upg_version
4022 In-place upgrade of the supplied SV to a version object.
4024 SV *sv = upg_version(SV *sv);
4026 Returns a pointer to the upgraded SV.
4032 Perl_upg_version(pTHX_ SV *ver)
4037 if ( SvNOK(ver) ) /* may get too much accuracy */
4040 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4041 version = savepv(tbuf);
4044 else if ( SvVOK(ver) ) { /* already a v-string */
4045 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4046 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4050 else /* must be a string or something like a string */
4053 version = savepv(SvPV(ver,n_a));
4055 (void)scan_version(version, ver, qv);
4064 Accepts a version object and returns the normalized floating
4065 point representation. Call like:
4069 NOTE: you can pass either the object directly or the SV
4070 contained within the RV.
4076 Perl_vnumify(pTHX_ SV *vs)
4082 len = av_len((AV *)vs);
4085 Perl_sv_catpv(aTHX_ sv,"0");
4088 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4089 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4090 for ( i = 1 ; i < len ; i++ )
4092 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4093 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4098 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4100 /* Don't display any additional trailing zeros */
4101 if ( (int)PERL_ABS(digit) != 0 || len == 1 )
4103 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4108 Perl_sv_catpv(aTHX_ sv,"000");
4116 Accepts a version object and returns the normalized string
4117 representation. Call like:
4121 NOTE: you can pass either the object directly or the SV
4122 contained within the RV.
4128 Perl_vnormal(pTHX_ SV *vs)
4134 len = av_len((AV *)vs);
4137 Perl_sv_catpv(aTHX_ sv,"");
4140 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4141 Perl_sv_setpvf(aTHX_ sv,"%"IVdf,(IV)digit);
4142 for ( i = 1 ; i <= len ; i++ )
4144 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4146 Perl_sv_catpvf(aTHX_ sv,"_%"IVdf,(IV)-digit);
4148 Perl_sv_catpvf(aTHX_ sv,".%"IVdf,(IV)digit);
4151 if ( len <= 2 ) { /* short version, must be at least three */
4152 for ( len = 2 - len; len != 0; len-- )
4153 Perl_sv_catpv(aTHX_ sv,".0");
4160 =for apidoc vstringify
4162 In order to maintain maximum compatibility with earlier versions
4163 of Perl, this function will return either the floating point
4164 notation or the multiple dotted notation, depending on whether
4165 the original version contained 1 or more dots, respectively
4171 Perl_vstringify(pTHX_ SV *vs)
4176 len = av_len((AV *)vs);
4187 Version object aware cmp. Both operands must already have been
4188 converted into version objects.
4194 Perl_vcmp(pTHX_ SV *lsv, SV *rsv)
4201 l = av_len((AV *)lsv);
4202 r = av_len((AV *)rsv);
4206 while ( i <= m && retval == 0 )
4208 I32 left = SvIV(*av_fetch((AV *)lsv,i,0));
4209 I32 right = SvIV(*av_fetch((AV *)rsv,i,0));
4210 bool lalpha = left < 0 ? 1 : 0;
4211 bool ralpha = right < 0 ? 1 : 0;
4214 if ( left < right || (left == right && lalpha && !ralpha) )
4216 if ( left > right || (left == right && ralpha && !lalpha) )
4221 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4225 while ( i <= r && retval == 0 )
4227 if ( SvIV(*av_fetch((AV *)rsv,i,0)) != 0 )
4228 retval = -1; /* not a match after all */
4234 while ( i <= l && retval == 0 )
4236 if ( SvIV(*av_fetch((AV *)lsv,i,0)) != 0 )
4237 retval = +1; /* not a match after all */
4245 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4246 # define EMULATE_SOCKETPAIR_UDP
4249 #ifdef EMULATE_SOCKETPAIR_UDP
4251 S_socketpair_udp (int fd[2]) {
4253 /* Fake a datagram socketpair using UDP to localhost. */
4254 int sockets[2] = {-1, -1};
4255 struct sockaddr_in addresses[2];
4257 Sock_size_t size = sizeof(struct sockaddr_in);
4258 unsigned short port;
4261 memset(&addresses, 0, sizeof(addresses));
4264 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4265 if (sockets[i] == -1)
4266 goto tidy_up_and_fail;
4268 addresses[i].sin_family = AF_INET;
4269 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4270 addresses[i].sin_port = 0; /* kernel choses port. */
4271 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4272 sizeof(struct sockaddr_in)) == -1)
4273 goto tidy_up_and_fail;
4276 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4277 for each connect the other socket to it. */
4280 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4282 goto tidy_up_and_fail;
4283 if (size != sizeof(struct sockaddr_in))
4284 goto abort_tidy_up_and_fail;
4285 /* !1 is 0, !0 is 1 */
4286 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4287 sizeof(struct sockaddr_in)) == -1)
4288 goto tidy_up_and_fail;
4291 /* Now we have 2 sockets connected to each other. I don't trust some other
4292 process not to have already sent a packet to us (by random) so send
4293 a packet from each to the other. */
4296 /* I'm going to send my own port number. As a short.
4297 (Who knows if someone somewhere has sin_port as a bitfield and needs
4298 this routine. (I'm assuming crays have socketpair)) */
4299 port = addresses[i].sin_port;
4300 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4301 if (got != sizeof(port)) {
4303 goto tidy_up_and_fail;
4304 goto abort_tidy_up_and_fail;
4308 /* Packets sent. I don't trust them to have arrived though.
4309 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4310 connect to localhost will use a second kernel thread. In 2.6 the
4311 first thread running the connect() returns before the second completes,
4312 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4313 returns 0. Poor programs have tripped up. One poor program's authors'
4314 had a 50-1 reverse stock split. Not sure how connected these were.)
4315 So I don't trust someone not to have an unpredictable UDP stack.
4319 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4320 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4324 FD_SET(sockets[0], &rset);
4325 FD_SET(sockets[1], &rset);
4327 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4328 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4329 || !FD_ISSET(sockets[1], &rset)) {
4330 /* I hope this is portable and appropriate. */
4332 goto tidy_up_and_fail;
4333 goto abort_tidy_up_and_fail;
4337 /* And the paranoia department even now doesn't trust it to have arrive
4338 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4340 struct sockaddr_in readfrom;
4341 unsigned short buffer[2];
4346 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4347 sizeof(buffer), MSG_DONTWAIT,
4348 (struct sockaddr *) &readfrom, &size);
4350 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4352 (struct sockaddr *) &readfrom, &size);
4356 goto tidy_up_and_fail;
4357 if (got != sizeof(port)
4358 || size != sizeof(struct sockaddr_in)
4359 /* Check other socket sent us its port. */
4360 || buffer[0] != (unsigned short) addresses[!i].sin_port
4361 /* Check kernel says we got the datagram from that socket */
4362 || readfrom.sin_family != addresses[!i].sin_family
4363 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4364 || readfrom.sin_port != addresses[!i].sin_port)
4365 goto abort_tidy_up_and_fail;
4368 /* My caller (my_socketpair) has validated that this is non-NULL */
4371 /* I hereby declare this connection open. May God bless all who cross
4375 abort_tidy_up_and_fail:
4376 errno = ECONNABORTED;
4379 int save_errno = errno;
4380 if (sockets[0] != -1)
4381 PerlLIO_close(sockets[0]);
4382 if (sockets[1] != -1)
4383 PerlLIO_close(sockets[1]);
4388 #endif /* EMULATE_SOCKETPAIR_UDP */
4390 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4392 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4393 /* Stevens says that family must be AF_LOCAL, protocol 0.
4394 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4399 struct sockaddr_in listen_addr;
4400 struct sockaddr_in connect_addr;
4405 || family != AF_UNIX
4408 errno = EAFNOSUPPORT;
4416 #ifdef EMULATE_SOCKETPAIR_UDP
4417 if (type == SOCK_DGRAM)
4418 return S_socketpair_udp(fd);
4421 listener = PerlSock_socket(AF_INET, type, 0);
4424 memset(&listen_addr, 0, sizeof(listen_addr));
4425 listen_addr.sin_family = AF_INET;
4426 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4427 listen_addr.sin_port = 0; /* kernel choses port. */
4428 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4429 sizeof(listen_addr)) == -1)
4430 goto tidy_up_and_fail;
4431 if (PerlSock_listen(listener, 1) == -1)
4432 goto tidy_up_and_fail;
4434 connector = PerlSock_socket(AF_INET, type, 0);
4435 if (connector == -1)
4436 goto tidy_up_and_fail;
4437 /* We want to find out the port number to connect to. */
4438 size = sizeof(connect_addr);
4439 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4441 goto tidy_up_and_fail;
4442 if (size != sizeof(connect_addr))
4443 goto abort_tidy_up_and_fail;
4444 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4445 sizeof(connect_addr)) == -1)
4446 goto tidy_up_and_fail;
4448 size = sizeof(listen_addr);
4449 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4452 goto tidy_up_and_fail;
4453 if (size != sizeof(listen_addr))
4454 goto abort_tidy_up_and_fail;
4455 PerlLIO_close(listener);
4456 /* Now check we are talking to ourself by matching port and host on the
4458 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4460 goto tidy_up_and_fail;
4461 if (size != sizeof(connect_addr)
4462 || listen_addr.sin_family != connect_addr.sin_family
4463 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4464 || listen_addr.sin_port != connect_addr.sin_port) {
4465 goto abort_tidy_up_and_fail;
4471 abort_tidy_up_and_fail:
4472 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4475 int save_errno = errno;
4477 PerlLIO_close(listener);
4478 if (connector != -1)
4479 PerlLIO_close(connector);
4481 PerlLIO_close(acceptor);
4487 /* In any case have a stub so that there's code corresponding
4488 * to the my_socketpair in global.sym. */
4490 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4491 #ifdef HAS_SOCKETPAIR
4492 return socketpair(family, type, protocol, fd);
4501 =for apidoc sv_nosharing
4503 Dummy routine which "shares" an SV when there is no sharing module present.
4504 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4505 some level of strict-ness.
4511 Perl_sv_nosharing(pTHX_ SV *sv)
4516 =for apidoc sv_nolocking
4518 Dummy routine which "locks" an SV when there is no locking module present.
4519 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4520 some level of strict-ness.
4526 Perl_sv_nolocking(pTHX_ SV *sv)
4532 =for apidoc sv_nounlocking
4534 Dummy routine which "unlocks" an SV when there is no locking module present.
4535 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4536 some level of strict-ness.
4542 Perl_sv_nounlocking(pTHX_ SV *sv)
4547 Perl_parse_unicode_opts(pTHX_ char **popt)
4554 opt = (U32) atoi(p);
4555 while (isDIGIT(*p)) p++;
4556 if (*p && *p != '\n' && *p != '\r')
4557 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4562 case PERL_UNICODE_STDIN:
4563 opt |= PERL_UNICODE_STDIN_FLAG; break;
4564 case PERL_UNICODE_STDOUT:
4565 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4566 case PERL_UNICODE_STDERR:
4567 opt |= PERL_UNICODE_STDERR_FLAG; break;
4568 case PERL_UNICODE_STD:
4569 opt |= PERL_UNICODE_STD_FLAG; break;
4570 case PERL_UNICODE_IN:
4571 opt |= PERL_UNICODE_IN_FLAG; break;
4572 case PERL_UNICODE_OUT:
4573 opt |= PERL_UNICODE_OUT_FLAG; break;
4574 case PERL_UNICODE_INOUT:
4575 opt |= PERL_UNICODE_INOUT_FLAG; break;
4576 case PERL_UNICODE_LOCALE:
4577 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4578 case PERL_UNICODE_ARGV:
4579 opt |= PERL_UNICODE_ARGV_FLAG; break;
4581 if (*p != '\n' && *p != '\r')
4583 "Unknown Unicode option letter '%c'", *p);
4589 opt = PERL_UNICODE_DEFAULT_FLAGS;
4591 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4592 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4593 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4604 * This is really just a quick hack which grabs various garbage
4605 * values. It really should be a real hash algorithm which
4606 * spreads the effect of every input bit onto every output bit,
4607 * if someone who knows about such things would bother to write it.
4608 * Might be a good idea to add that function to CORE as well.
4609 * No numbers below come from careful analysis or anything here,
4610 * except they are primes and SEED_C1 > 1E6 to get a full-width
4611 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4612 * probably be bigger too.
4615 # define SEED_C1 1000003
4616 #define SEED_C4 73819
4618 # define SEED_C1 25747
4619 #define SEED_C4 20639
4623 #define SEED_C5 26107
4625 #ifndef PERL_NO_DEV_RANDOM
4630 # include <starlet.h>
4631 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4632 * in 100-ns units, typically incremented ever 10 ms. */
4633 unsigned int when[2];
4635 # ifdef HAS_GETTIMEOFDAY
4636 struct timeval when;
4642 /* This test is an escape hatch, this symbol isn't set by Configure. */
4643 #ifndef PERL_NO_DEV_RANDOM
4644 #ifndef PERL_RANDOM_DEVICE
4645 /* /dev/random isn't used by default because reads from it will block
4646 * if there isn't enough entropy available. You can compile with
4647 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4648 * is enough real entropy to fill the seed. */
4649 # define PERL_RANDOM_DEVICE "/dev/urandom"
4651 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4653 if (PerlLIO_read(fd, &u, sizeof u) != sizeof u)
4662 _ckvmssts(sys$gettim(when));
4663 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4665 # ifdef HAS_GETTIMEOFDAY
4666 PerlProc_gettimeofday(&when,NULL);
4667 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4670 u = (U32)SEED_C1 * when;
4673 u += SEED_C3 * (U32)PerlProc_getpid();
4674 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4675 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4676 u += SEED_C5 * (U32)PTR2UV(&when);
4682 Perl_get_hash_seed(pTHX)
4684 char *s = PerlEnv_getenv("PERL_HASH_SEED");
4688 while (isSPACE(*s)) s++;
4689 if (s && isDIGIT(*s))
4690 myseed = (UV)Atoul(s);
4692 #ifdef USE_HASH_SEED_EXPLICIT
4696 /* Compute a random seed */
4697 (void)seedDrand01((Rand_seed_t)seed());
4698 myseed = (UV)(Drand01() * (NV)UV_MAX);
4699 #if RANDBITS < (UVSIZE * 8)
4700 /* Since there are not enough randbits to to reach all
4701 * the bits of a UV, the low bits might need extra
4702 * help. Sum in another random number that will
4703 * fill in the low bits. */
4705 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4706 #endif /* RANDBITS < (UVSIZE * 8) */
4707 if (myseed == 0) { /* Superparanoia. */
4708 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4710 Perl_croak(aTHX_ "Your random numbers are not that random");
4713 PL_rehash_seed_set = TRUE;