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 char *toend, register char *from, register 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 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 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 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((char *)big, (char *)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 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 U8 *a = (U8 *)s1;
720 register U8 *b = (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 U8 *a = (U8 *)s1;
733 register U8 *b = (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;
764 New(902,newaddr,strlen(pv)+1,char);
765 return strcpy(newaddr,pv);
768 /* same thing but with a known length */
773 Perl's version of what C<strndup()> would be if it existed. Returns a
774 pointer to a newly allocated string which is a duplicate of the first
775 C<len> bytes from C<pv>. The memory allocated for the new string can be
776 freed with the C<Safefree()> function.
782 Perl_savepvn(pTHX_ const char *pv, register I32 len)
784 register char *newaddr;
786 New(903,newaddr,len+1,char);
787 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
789 /* might not be null terminated */
791 return CopyD(pv,newaddr,len,char);
794 return ZeroD(newaddr,len+1,char);
799 =for apidoc savesharedpv
801 A version of C<savepv()> which allocates the duplicate string in memory
802 which is shared between threads.
807 Perl_savesharedpv(pTHX_ const char *pv)
809 register char *newaddr;
813 newaddr = (char*)PerlMemShared_malloc(strlen(pv)+1);
815 PerlLIO_write(PerlIO_fileno(Perl_error_log),
816 PL_no_mem, strlen(PL_no_mem));
819 return strcpy(newaddr,pv);
825 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
826 the passed in SV using C<SvPV()>
832 Perl_savesvpv(pTHX_ SV *sv)
835 const char *pv = SvPV(sv, len);
836 register char *newaddr;
839 New(903,newaddr,len,char);
840 return CopyD(pv,newaddr,len,char);
844 /* the SV for Perl_form() and mess() is not kept in an arena */
853 return sv_2mortal(newSVpvn("",0));
858 /* Create as PVMG now, to avoid any upgrading later */
860 Newz(905, any, 1, XPVMG);
861 SvFLAGS(sv) = SVt_PVMG;
862 SvANY(sv) = (void*)any;
863 SvREFCNT(sv) = 1 << 30; /* practically infinite */
868 #if defined(PERL_IMPLICIT_CONTEXT)
870 Perl_form_nocontext(const char* pat, ...)
876 retval = vform(pat, &args);
880 #endif /* PERL_IMPLICIT_CONTEXT */
883 =head1 Miscellaneous Functions
886 Takes a sprintf-style format pattern and conventional
887 (non-SV) arguments and returns the formatted string.
889 (char *) Perl_form(pTHX_ const char* pat, ...)
891 can be used any place a string (char *) is required:
893 char * s = Perl_form("%d.%d",major,minor);
895 Uses a single private buffer so if you want to format several strings you
896 must explicitly copy the earlier strings away (and free the copies when you
903 Perl_form(pTHX_ const char* pat, ...)
908 retval = vform(pat, &args);
914 Perl_vform(pTHX_ const char *pat, va_list *args)
916 SV *sv = mess_alloc();
917 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
921 #if defined(PERL_IMPLICIT_CONTEXT)
923 Perl_mess_nocontext(const char *pat, ...)
929 retval = vmess(pat, &args);
933 #endif /* PERL_IMPLICIT_CONTEXT */
936 Perl_mess(pTHX_ const char *pat, ...)
941 retval = vmess(pat, &args);
947 S_closest_cop(pTHX_ COP *cop, OP *o)
949 /* Look for PL_op starting from o. cop is the last COP we've seen. */
951 if (!o || o == PL_op) return cop;
953 if (o->op_flags & OPf_KIDS) {
955 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
959 /* If the OP_NEXTSTATE has been optimised away we can still use it
960 * the get the file and line number. */
962 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
965 /* Keep searching, and return when we've found something. */
967 new_cop = closest_cop(cop, kid);
968 if (new_cop) return new_cop;
978 Perl_vmess(pTHX_ const char *pat, va_list *args)
980 SV *sv = mess_alloc();
981 static char dgd[] = " during global destruction.\n";
984 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
985 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
988 * Try and find the file and line for PL_op. This will usually be
989 * PL_curcop, but it might be a cop that has been optimised away. We
990 * can try to find such a cop by searching through the optree starting
991 * from the sibling of PL_curcop.
994 cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
995 if (!cop) cop = PL_curcop;
998 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
999 OutCopFILE(cop), (IV)CopLINE(cop));
1000 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1001 bool line_mode = (RsSIMPLE(PL_rs) &&
1002 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1003 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1004 PL_last_in_gv == PL_argvgv ?
1005 "" : GvNAME(PL_last_in_gv),
1006 line_mode ? "line" : "chunk",
1007 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1009 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1015 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1020 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1021 && (io = GvIO(PL_stderrgv))
1022 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1029 SAVESPTR(PL_stderrgv);
1030 PL_stderrgv = Nullgv;
1032 PUSHSTACKi(PERLSI_MAGIC);
1036 PUSHs(SvTIED_obj((SV*)io, mg));
1037 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1039 call_method("PRINT", G_SCALAR);
1047 /* SFIO can really mess with your errno */
1050 PerlIO *serr = Perl_error_log;
1052 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1053 (void)PerlIO_flush(serr);
1060 /* Common code used by vcroak, vdie and vwarner */
1062 void S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8);
1065 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1071 SV *msv = vmess(pat, args);
1072 if (PL_errors && SvCUR(PL_errors)) {
1073 sv_catsv(PL_errors, msv);
1074 message = SvPV(PL_errors, *msglen);
1075 SvCUR_set(PL_errors, 0);
1078 message = SvPV(msv,*msglen);
1079 *utf8 = SvUTF8(msv);
1085 DEBUG_S(PerlIO_printf(Perl_debug_log,
1086 "%p: die/croak: message = %s\ndiehook = %p\n",
1087 thr, message, PL_diehook));
1089 S_vdie_common(aTHX_ message, *msglen, *utf8);
1095 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1100 /* sv_2cv might call Perl_croak() */
1101 SV *olddiehook = PL_diehook;
1105 SAVESPTR(PL_diehook);
1106 PL_diehook = Nullsv;
1107 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1109 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1116 msg = newSVpvn(message, msglen);
1117 SvFLAGS(msg) |= utf8;
1125 PUSHSTACKi(PERLSI_DIEHOOK);
1129 call_sv((SV*)cv, G_DISCARD);
1136 Perl_vdie(pTHX_ const char* pat, va_list *args)
1139 int was_in_eval = PL_in_eval;
1143 DEBUG_S(PerlIO_printf(Perl_debug_log,
1144 "%p: die: curstack = %p, mainstack = %p\n",
1145 thr, PL_curstack, PL_mainstack));
1147 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1149 PL_restartop = die_where(message, msglen);
1150 SvFLAGS(ERRSV) |= utf8;
1151 DEBUG_S(PerlIO_printf(Perl_debug_log,
1152 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1153 thr, PL_restartop, was_in_eval, PL_top_env));
1154 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1156 return PL_restartop;
1159 #if defined(PERL_IMPLICIT_CONTEXT)
1161 Perl_die_nocontext(const char* pat, ...)
1166 va_start(args, pat);
1167 o = vdie(pat, &args);
1171 #endif /* PERL_IMPLICIT_CONTEXT */
1174 Perl_die(pTHX_ const char* pat, ...)
1178 va_start(args, pat);
1179 o = vdie(pat, &args);
1185 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1191 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1194 PL_restartop = die_where(message, msglen);
1195 SvFLAGS(ERRSV) |= utf8;
1199 message = SvPVx(ERRSV, msglen);
1201 write_to_stderr(message, msglen);
1205 #if defined(PERL_IMPLICIT_CONTEXT)
1207 Perl_croak_nocontext(const char *pat, ...)
1211 va_start(args, pat);
1216 #endif /* PERL_IMPLICIT_CONTEXT */
1219 =head1 Warning and Dieing
1223 This is the XSUB-writer's interface to Perl's C<die> function.
1224 Normally call this function the same way you call the C C<printf>
1225 function. Calling C<croak> returns control directly to Perl,
1226 sidestepping the normal C order of execution. See C<warn>.
1228 If you want to throw an exception object, assign the object to
1229 C<$@> and then pass C<Nullch> to croak():
1231 errsv = get_sv("@", TRUE);
1232 sv_setsv(errsv, exception_object);
1239 Perl_croak(pTHX_ const char *pat, ...)
1242 va_start(args, pat);
1249 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1259 msv = vmess(pat, args);
1261 message = SvPV(msv, msglen);
1264 /* sv_2cv might call Perl_warn() */
1265 SV *oldwarnhook = PL_warnhook;
1267 SAVESPTR(PL_warnhook);
1268 PL_warnhook = Nullsv;
1269 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1271 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1277 msg = newSVpvn(message, msglen);
1278 SvFLAGS(msg) |= utf8;
1282 PUSHSTACKi(PERLSI_WARNHOOK);
1286 call_sv((SV*)cv, G_DISCARD);
1293 write_to_stderr(message, msglen);
1296 #if defined(PERL_IMPLICIT_CONTEXT)
1298 Perl_warn_nocontext(const char *pat, ...)
1302 va_start(args, pat);
1306 #endif /* PERL_IMPLICIT_CONTEXT */
1311 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1312 function the same way you call the C C<printf> function. See C<croak>.
1318 Perl_warn(pTHX_ const char *pat, ...)
1321 va_start(args, pat);
1326 #if defined(PERL_IMPLICIT_CONTEXT)
1328 Perl_warner_nocontext(U32 err, const char *pat, ...)
1332 va_start(args, pat);
1333 vwarner(err, pat, &args);
1336 #endif /* PERL_IMPLICIT_CONTEXT */
1339 Perl_warner(pTHX_ U32 err, const char* pat,...)
1342 va_start(args, pat);
1343 vwarner(err, pat, &args);
1348 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1351 SV *msv = vmess(pat, args);
1353 char *message = SvPV(msv, msglen);
1354 I32 utf8 = SvUTF8(msv);
1358 S_vdie_common(aTHX_ message, msglen, utf8);
1361 PL_restartop = die_where(message, msglen);
1362 SvFLAGS(ERRSV) |= utf8;
1365 write_to_stderr(message, msglen);
1369 Perl_vwarn(aTHX_ pat, args);
1373 /* since we've already done strlen() for both nam and val
1374 * we can use that info to make things faster than
1375 * sprintf(s, "%s=%s", nam, val)
1377 #define my_setenv_format(s, nam, nlen, val, vlen) \
1378 Copy(nam, s, nlen, char); \
1380 Copy(val, s+(nlen+1), vlen, char); \
1381 *(s+(nlen+1+vlen)) = '\0'
1383 #ifdef USE_ENVIRON_ARRAY
1384 /* VMS' my_setenv() is in vms.c */
1385 #if !defined(WIN32) && !defined(NETWARE)
1387 Perl_my_setenv(pTHX_ char *nam, char *val)
1390 /* only parent thread can modify process environment */
1391 if (PL_curinterp == aTHX)
1394 #ifndef PERL_USE_SAFE_PUTENV
1395 if (!PL_use_safe_putenv) {
1396 /* most putenv()s leak, so we manipulate environ directly */
1397 register I32 i=setenv_getix(nam); /* where does it go? */
1400 if (environ == PL_origenviron) { /* need we copy environment? */
1406 for (max = i; environ[max]; max++) ;
1407 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1408 for (j=0; j<max; j++) { /* copy environment */
1409 int len = strlen(environ[j]);
1410 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1411 Copy(environ[j], tmpenv[j], len+1, char);
1413 tmpenv[max] = Nullch;
1414 environ = tmpenv; /* tell exec where it is now */
1417 safesysfree(environ[i]);
1418 while (environ[i]) {
1419 environ[i] = environ[i+1];
1424 if (!environ[i]) { /* does not exist yet */
1425 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1426 environ[i+1] = Nullch; /* make sure it's null terminated */
1429 safesysfree(environ[i]);
1433 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1434 /* all that work just for this */
1435 my_setenv_format(environ[i], nam, nlen, val, vlen);
1438 # if defined(__CYGWIN__) || defined( EPOC)
1439 setenv(nam, val, 1);
1442 int nlen = strlen(nam), vlen;
1447 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1448 /* all that work just for this */
1449 my_setenv_format(new_env, nam, nlen, val, vlen);
1450 (void)putenv(new_env);
1451 # endif /* __CYGWIN__ */
1452 #ifndef PERL_USE_SAFE_PUTENV
1458 #else /* WIN32 || NETWARE */
1461 Perl_my_setenv(pTHX_ char *nam,char *val)
1463 register char *envstr;
1464 int nlen = strlen(nam), vlen;
1470 New(904, envstr, nlen+vlen+2, char);
1471 my_setenv_format(envstr, nam, nlen, val, vlen);
1472 (void)PerlEnv_putenv(envstr);
1476 #endif /* WIN32 || NETWARE */
1480 Perl_setenv_getix(pTHX_ char *nam)
1482 register I32 i, len = strlen(nam);
1484 for (i = 0; environ[i]; i++) {
1487 strnicmp(environ[i],nam,len) == 0
1489 strnEQ(environ[i],nam,len)
1491 && environ[i][len] == '=')
1492 break; /* strnEQ must come first to avoid */
1493 } /* potential SEGV's */
1496 #endif /* !PERL_MICRO */
1498 #endif /* !VMS && !EPOC*/
1500 #ifdef UNLINK_ALL_VERSIONS
1502 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1506 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1511 /* this is a drop-in replacement for bcopy() */
1512 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1514 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1518 if (from - to >= 0) {
1526 *(--to) = *(--from);
1532 /* this is a drop-in replacement for memset() */
1535 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1545 /* this is a drop-in replacement for bzero() */
1546 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1548 Perl_my_bzero(register char *loc, register I32 len)
1558 /* this is a drop-in replacement for memcmp() */
1559 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1561 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1563 register U8 *a = (U8 *)s1;
1564 register U8 *b = (U8 *)s2;
1568 if (tmp = *a++ - *b++)
1573 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1577 #ifdef USE_CHAR_VSPRINTF
1582 vsprintf(char *dest, const char *pat, char *args)
1586 fakebuf._ptr = dest;
1587 fakebuf._cnt = 32767;
1591 fakebuf._flag = _IOWRT|_IOSTRG;
1592 _doprnt(pat, args, &fakebuf); /* what a kludge */
1593 (void)putc('\0', &fakebuf);
1594 #ifdef USE_CHAR_VSPRINTF
1597 return 0; /* perl doesn't use return value */
1601 #endif /* HAS_VPRINTF */
1604 #if BYTEORDER != 0x4321
1606 Perl_my_swap(pTHX_ short s)
1608 #if (BYTEORDER & 1) == 0
1611 result = ((s & 255) << 8) + ((s >> 8) & 255);
1619 Perl_my_htonl(pTHX_ long l)
1623 char c[sizeof(long)];
1626 #if BYTEORDER == 0x1234
1627 u.c[0] = (l >> 24) & 255;
1628 u.c[1] = (l >> 16) & 255;
1629 u.c[2] = (l >> 8) & 255;
1633 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1634 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1639 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1640 u.c[o & 0xf] = (l >> s) & 255;
1648 Perl_my_ntohl(pTHX_ long l)
1652 char c[sizeof(long)];
1655 #if BYTEORDER == 0x1234
1656 u.c[0] = (l >> 24) & 255;
1657 u.c[1] = (l >> 16) & 255;
1658 u.c[2] = (l >> 8) & 255;
1662 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1663 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1670 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1671 l |= (u.c[o & 0xf] & 255) << s;
1678 #endif /* BYTEORDER != 0x4321 */
1682 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1683 * If these functions are defined,
1684 * the BYTEORDER is neither 0x1234 nor 0x4321.
1685 * However, this is not assumed.
1689 #define HTOLE(name,type) \
1691 name (register type n) \
1695 char c[sizeof(type)]; \
1698 register I32 s = 0; \
1699 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1700 u.c[i] = (n >> s) & 0xFF; \
1705 #define LETOH(name,type) \
1707 name (register type n) \
1711 char c[sizeof(type)]; \
1714 register I32 s = 0; \
1717 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1718 n |= ((type)(u.c[i] & 0xFF)) << s; \
1724 * Big-endian byte order functions.
1727 #define HTOBE(name,type) \
1729 name (register type n) \
1733 char c[sizeof(type)]; \
1736 register I32 s = 8*(sizeof(u.c)-1); \
1737 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1738 u.c[i] = (n >> s) & 0xFF; \
1743 #define BETOH(name,type) \
1745 name (register type n) \
1749 char c[sizeof(type)]; \
1752 register I32 s = 8*(sizeof(u.c)-1); \
1755 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1756 n |= ((type)(u.c[i] & 0xFF)) << s; \
1762 * If we just can't do it...
1765 #define NOT_AVAIL(name,type) \
1767 name (register type n) \
1769 Perl_croak_nocontext(#name "() not available"); \
1770 return n; /* not reached */ \
1774 #if defined(HAS_HTOVS) && !defined(htovs)
1777 #if defined(HAS_HTOVL) && !defined(htovl)
1780 #if defined(HAS_VTOHS) && !defined(vtohs)
1783 #if defined(HAS_VTOHL) && !defined(vtohl)
1787 #ifdef PERL_NEED_MY_HTOLE16
1789 HTOLE(Perl_my_htole16,U16)
1791 NOT_AVAIL(Perl_my_htole16,U16)
1794 #ifdef PERL_NEED_MY_LETOH16
1796 LETOH(Perl_my_letoh16,U16)
1798 NOT_AVAIL(Perl_my_letoh16,U16)
1801 #ifdef PERL_NEED_MY_HTOBE16
1803 HTOBE(Perl_my_htobe16,U16)
1805 NOT_AVAIL(Perl_my_htobe16,U16)
1808 #ifdef PERL_NEED_MY_BETOH16
1810 BETOH(Perl_my_betoh16,U16)
1812 NOT_AVAIL(Perl_my_betoh16,U16)
1816 #ifdef PERL_NEED_MY_HTOLE32
1818 HTOLE(Perl_my_htole32,U32)
1820 NOT_AVAIL(Perl_my_htole32,U32)
1823 #ifdef PERL_NEED_MY_LETOH32
1825 LETOH(Perl_my_letoh32,U32)
1827 NOT_AVAIL(Perl_my_letoh32,U32)
1830 #ifdef PERL_NEED_MY_HTOBE32
1832 HTOBE(Perl_my_htobe32,U32)
1834 NOT_AVAIL(Perl_my_htobe32,U32)
1837 #ifdef PERL_NEED_MY_BETOH32
1839 BETOH(Perl_my_betoh32,U32)
1841 NOT_AVAIL(Perl_my_betoh32,U32)
1845 #ifdef PERL_NEED_MY_HTOLE64
1847 HTOLE(Perl_my_htole64,U64)
1849 NOT_AVAIL(Perl_my_htole64,U64)
1852 #ifdef PERL_NEED_MY_LETOH64
1854 LETOH(Perl_my_letoh64,U64)
1856 NOT_AVAIL(Perl_my_letoh64,U64)
1859 #ifdef PERL_NEED_MY_HTOBE64
1861 HTOBE(Perl_my_htobe64,U64)
1863 NOT_AVAIL(Perl_my_htobe64,U64)
1866 #ifdef PERL_NEED_MY_BETOH64
1868 BETOH(Perl_my_betoh64,U64)
1870 NOT_AVAIL(Perl_my_betoh64,U64)
1874 #ifdef PERL_NEED_MY_HTOLES
1875 HTOLE(Perl_my_htoles,short)
1877 #ifdef PERL_NEED_MY_LETOHS
1878 LETOH(Perl_my_letohs,short)
1880 #ifdef PERL_NEED_MY_HTOBES
1881 HTOBE(Perl_my_htobes,short)
1883 #ifdef PERL_NEED_MY_BETOHS
1884 BETOH(Perl_my_betohs,short)
1887 #ifdef PERL_NEED_MY_HTOLEI
1888 HTOLE(Perl_my_htolei,int)
1890 #ifdef PERL_NEED_MY_LETOHI
1891 LETOH(Perl_my_letohi,int)
1893 #ifdef PERL_NEED_MY_HTOBEI
1894 HTOBE(Perl_my_htobei,int)
1896 #ifdef PERL_NEED_MY_BETOHI
1897 BETOH(Perl_my_betohi,int)
1900 #ifdef PERL_NEED_MY_HTOLEL
1901 HTOLE(Perl_my_htolel,long)
1903 #ifdef PERL_NEED_MY_LETOHL
1904 LETOH(Perl_my_letohl,long)
1906 #ifdef PERL_NEED_MY_HTOBEL
1907 HTOBE(Perl_my_htobel,long)
1909 #ifdef PERL_NEED_MY_BETOHL
1910 BETOH(Perl_my_betohl,long)
1914 Perl_my_swabn(void *ptr, int n)
1916 register char *s = (char *)ptr;
1917 register char *e = s + (n-1);
1920 for (n /= 2; n > 0; s++, e--, n--) {
1928 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1930 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1932 register I32 This, that;
1938 PERL_FLUSHALL_FOR_CHILD;
1939 This = (*mode == 'w');
1943 taint_proper("Insecure %s%s", "EXEC");
1945 if (PerlProc_pipe(p) < 0)
1947 /* Try for another pipe pair for error return */
1948 if (PerlProc_pipe(pp) >= 0)
1950 while ((pid = PerlProc_fork()) < 0) {
1951 if (errno != EAGAIN) {
1952 PerlLIO_close(p[This]);
1953 PerlLIO_close(p[that]);
1955 PerlLIO_close(pp[0]);
1956 PerlLIO_close(pp[1]);
1968 /* Close parent's end of error status pipe (if any) */
1970 PerlLIO_close(pp[0]);
1971 #if defined(HAS_FCNTL) && defined(F_SETFD)
1972 /* Close error pipe automatically if exec works */
1973 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1976 /* Now dup our end of _the_ pipe to right position */
1977 if (p[THIS] != (*mode == 'r')) {
1978 PerlLIO_dup2(p[THIS], *mode == 'r');
1979 PerlLIO_close(p[THIS]);
1980 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1981 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1984 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1985 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1986 /* No automatic close - do it by hand */
1993 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1999 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2005 do_execfree(); /* free any memory malloced by child on fork */
2007 PerlLIO_close(pp[1]);
2008 /* Keep the lower of the two fd numbers */
2009 if (p[that] < p[This]) {
2010 PerlLIO_dup2(p[This], p[that]);
2011 PerlLIO_close(p[This]);
2015 PerlLIO_close(p[that]); /* close child's end of pipe */
2018 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2020 (void)SvUPGRADE(sv,SVt_IV);
2022 PL_forkprocess = pid;
2023 /* If we managed to get status pipe check for exec fail */
2024 if (did_pipes && pid > 0) {
2028 while (n < sizeof(int)) {
2029 n1 = PerlLIO_read(pp[0],
2030 (void*)(((char*)&errkid)+n),
2036 PerlLIO_close(pp[0]);
2038 if (n) { /* Error */
2040 PerlLIO_close(p[This]);
2041 if (n != sizeof(int))
2042 Perl_croak(aTHX_ "panic: kid popen errno read");
2044 pid2 = wait4pid(pid, &status, 0);
2045 } while (pid2 == -1 && errno == EINTR);
2046 errno = errkid; /* Propagate errno from kid */
2051 PerlLIO_close(pp[0]);
2052 return PerlIO_fdopen(p[This], mode);
2054 Perl_croak(aTHX_ "List form of piped open not implemented");
2055 return (PerlIO *) NULL;
2059 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2060 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2062 Perl_my_popen(pTHX_ char *cmd, char *mode)
2065 register I32 This, that;
2068 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2072 PERL_FLUSHALL_FOR_CHILD;
2075 return my_syspopen(aTHX_ cmd,mode);
2078 This = (*mode == 'w');
2080 if (doexec && PL_tainting) {
2082 taint_proper("Insecure %s%s", "EXEC");
2084 if (PerlProc_pipe(p) < 0)
2086 if (doexec && PerlProc_pipe(pp) >= 0)
2088 while ((pid = PerlProc_fork()) < 0) {
2089 if (errno != EAGAIN) {
2090 PerlLIO_close(p[This]);
2091 PerlLIO_close(p[that]);
2093 PerlLIO_close(pp[0]);
2094 PerlLIO_close(pp[1]);
2097 Perl_croak(aTHX_ "Can't fork");
2110 PerlLIO_close(pp[0]);
2111 #if defined(HAS_FCNTL) && defined(F_SETFD)
2112 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2115 if (p[THIS] != (*mode == 'r')) {
2116 PerlLIO_dup2(p[THIS], *mode == 'r');
2117 PerlLIO_close(p[THIS]);
2118 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2119 PerlLIO_close(p[THAT]);
2122 PerlLIO_close(p[THAT]);
2125 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2134 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2139 /* may or may not use the shell */
2140 do_exec3(cmd, pp[1], did_pipes);
2143 #endif /* defined OS2 */
2145 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2146 SvREADONLY_off(GvSV(tmpgv));
2147 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2148 SvREADONLY_on(GvSV(tmpgv));
2150 #ifdef THREADS_HAVE_PIDS
2151 PL_ppid = (IV)getppid();
2154 hv_clear(PL_pidstatus); /* we have no children */
2159 do_execfree(); /* free any memory malloced by child on vfork */
2161 PerlLIO_close(pp[1]);
2162 if (p[that] < p[This]) {
2163 PerlLIO_dup2(p[This], p[that]);
2164 PerlLIO_close(p[This]);
2168 PerlLIO_close(p[that]);
2171 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2173 (void)SvUPGRADE(sv,SVt_IV);
2175 PL_forkprocess = pid;
2176 if (did_pipes && pid > 0) {
2180 while (n < sizeof(int)) {
2181 n1 = PerlLIO_read(pp[0],
2182 (void*)(((char*)&errkid)+n),
2188 PerlLIO_close(pp[0]);
2190 if (n) { /* Error */
2192 PerlLIO_close(p[This]);
2193 if (n != sizeof(int))
2194 Perl_croak(aTHX_ "panic: kid popen errno read");
2196 pid2 = wait4pid(pid, &status, 0);
2197 } while (pid2 == -1 && errno == EINTR);
2198 errno = errkid; /* Propagate errno from kid */
2203 PerlLIO_close(pp[0]);
2204 return PerlIO_fdopen(p[This], mode);
2207 #if defined(atarist) || defined(EPOC)
2210 Perl_my_popen(pTHX_ char *cmd, char *mode)
2212 PERL_FLUSHALL_FOR_CHILD;
2213 /* Call system's popen() to get a FILE *, then import it.
2214 used 0 for 2nd parameter to PerlIO_importFILE;
2217 return PerlIO_importFILE(popen(cmd, mode), 0);
2221 FILE *djgpp_popen();
2223 Perl_my_popen(pTHX_ char *cmd, char *mode)
2225 PERL_FLUSHALL_FOR_CHILD;
2226 /* Call system's popen() to get a FILE *, then import it.
2227 used 0 for 2nd parameter to PerlIO_importFILE;
2230 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2235 #endif /* !DOSISH */
2237 /* this is called in parent before the fork() */
2239 Perl_atfork_lock(void)
2241 #if defined(USE_ITHREADS)
2242 /* locks must be held in locking order (if any) */
2244 MUTEX_LOCK(&PL_malloc_mutex);
2250 /* this is called in both parent and child after the fork() */
2252 Perl_atfork_unlock(void)
2254 #if defined(USE_ITHREADS)
2255 /* locks must be released in same order as in atfork_lock() */
2257 MUTEX_UNLOCK(&PL_malloc_mutex);
2266 #if defined(HAS_FORK)
2268 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2273 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2274 * handlers elsewhere in the code */
2279 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2280 Perl_croak_nocontext("fork() not available");
2282 #endif /* HAS_FORK */
2287 Perl_dump_fds(pTHX_ char *s)
2292 PerlIO_printf(Perl_debug_log,"%s", s);
2293 for (fd = 0; fd < 32; fd++) {
2294 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2295 PerlIO_printf(Perl_debug_log," %d",fd);
2297 PerlIO_printf(Perl_debug_log,"\n");
2299 #endif /* DUMP_FDS */
2303 dup2(int oldfd, int newfd)
2305 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2308 PerlLIO_close(newfd);
2309 return fcntl(oldfd, F_DUPFD, newfd);
2311 #define DUP2_MAX_FDS 256
2312 int fdtmp[DUP2_MAX_FDS];
2318 PerlLIO_close(newfd);
2319 /* good enough for low fd's... */
2320 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2321 if (fdx >= DUP2_MAX_FDS) {
2329 PerlLIO_close(fdtmp[--fdx]);
2336 #ifdef HAS_SIGACTION
2338 #ifdef MACOS_TRADITIONAL
2339 /* We don't want restart behavior on MacOS */
2344 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2346 struct sigaction act, oact;
2349 /* only "parent" interpreter can diddle signals */
2350 if (PL_curinterp != aTHX)
2354 act.sa_handler = handler;
2355 sigemptyset(&act.sa_mask);
2358 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2359 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2361 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2362 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2363 act.sa_flags |= SA_NOCLDWAIT;
2365 if (sigaction(signo, &act, &oact) == -1)
2368 return oact.sa_handler;
2372 Perl_rsignal_state(pTHX_ int signo)
2374 struct sigaction oact;
2376 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2379 return oact.sa_handler;
2383 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2385 struct sigaction act;
2388 /* only "parent" interpreter can diddle signals */
2389 if (PL_curinterp != aTHX)
2393 act.sa_handler = handler;
2394 sigemptyset(&act.sa_mask);
2397 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2398 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2400 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2401 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2402 act.sa_flags |= SA_NOCLDWAIT;
2404 return sigaction(signo, &act, save);
2408 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2411 /* only "parent" interpreter can diddle signals */
2412 if (PL_curinterp != aTHX)
2416 return sigaction(signo, save, (struct sigaction *)NULL);
2419 #else /* !HAS_SIGACTION */
2422 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2424 #if defined(USE_ITHREADS) && !defined(WIN32)
2425 /* only "parent" interpreter can diddle signals */
2426 if (PL_curinterp != aTHX)
2430 return PerlProc_signal(signo, handler);
2433 static int sig_trapped; /* XXX signals are process-wide anyway, so we
2434 ignore the implications of this for threading */
2444 Perl_rsignal_state(pTHX_ int signo)
2446 Sighandler_t oldsig;
2448 #if defined(USE_ITHREADS) && !defined(WIN32)
2449 /* only "parent" interpreter can diddle signals */
2450 if (PL_curinterp != aTHX)
2455 oldsig = PerlProc_signal(signo, sig_trap);
2456 PerlProc_signal(signo, oldsig);
2458 PerlProc_kill(PerlProc_getpid(), signo);
2463 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2465 #if defined(USE_ITHREADS) && !defined(WIN32)
2466 /* only "parent" interpreter can diddle signals */
2467 if (PL_curinterp != aTHX)
2470 *save = PerlProc_signal(signo, handler);
2471 return (*save == SIG_ERR) ? -1 : 0;
2475 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2477 #if defined(USE_ITHREADS) && !defined(WIN32)
2478 /* only "parent" interpreter can diddle signals */
2479 if (PL_curinterp != aTHX)
2482 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2485 #endif /* !HAS_SIGACTION */
2486 #endif /* !PERL_MICRO */
2488 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2489 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2491 Perl_my_pclose(pTHX_ PerlIO *ptr)
2493 Sigsave_t hstat, istat, qstat;
2499 int saved_errno = 0;
2501 int saved_vaxc_errno;
2504 int saved_win32_errno;
2508 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2510 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2512 *svp = &PL_sv_undef;
2514 if (pid == -1) { /* Opened by popen. */
2515 return my_syspclose(ptr);
2518 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2519 saved_errno = errno;
2521 saved_vaxc_errno = vaxc$errno;
2524 saved_win32_errno = GetLastError();
2528 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2531 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2532 rsignal_save(SIGINT, SIG_IGN, &istat);
2533 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2536 pid2 = wait4pid(pid, &status, 0);
2537 } while (pid2 == -1 && errno == EINTR);
2539 rsignal_restore(SIGHUP, &hstat);
2540 rsignal_restore(SIGINT, &istat);
2541 rsignal_restore(SIGQUIT, &qstat);
2544 SETERRNO(saved_errno, saved_vaxc_errno);
2547 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2549 #endif /* !DOSISH */
2551 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2553 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2558 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2562 char spid[TYPE_CHARS(IV)];
2565 sprintf(spid, "%"IVdf, (IV)pid);
2566 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2567 if (svp && *svp != &PL_sv_undef) {
2568 *statusp = SvIVX(*svp);
2569 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2576 hv_iterinit(PL_pidstatus);
2577 if ((entry = hv_iternext(PL_pidstatus))) {
2578 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2579 sv = hv_iterval(PL_pidstatus,entry);
2580 *statusp = SvIVX(sv);
2581 sprintf(spid, "%"IVdf, (IV)pid);
2582 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2589 # ifdef HAS_WAITPID_RUNTIME
2590 if (!HAS_WAITPID_RUNTIME)
2593 result = PerlProc_waitpid(pid,statusp,flags);
2596 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2597 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2600 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2604 Perl_croak(aTHX_ "Can't do waitpid with flags");
2606 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2607 pidgone(result,*statusp);
2614 if (result < 0 && errno == EINTR) {
2619 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2623 Perl_pidgone(pTHX_ Pid_t pid, int status)
2626 char spid[TYPE_CHARS(IV)];
2628 sprintf(spid, "%"IVdf, (IV)pid);
2629 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2630 (void)SvUPGRADE(sv,SVt_IV);
2635 #if defined(atarist) || defined(OS2) || defined(EPOC)
2638 int /* Cannot prototype with I32
2640 my_syspclose(PerlIO *ptr)
2643 Perl_my_pclose(pTHX_ PerlIO *ptr)
2646 /* Needs work for PerlIO ! */
2647 FILE *f = PerlIO_findFILE(ptr);
2648 I32 result = pclose(f);
2649 PerlIO_releaseFILE(ptr,f);
2657 Perl_my_pclose(pTHX_ PerlIO *ptr)
2659 /* Needs work for PerlIO ! */
2660 FILE *f = PerlIO_findFILE(ptr);
2661 I32 result = djgpp_pclose(f);
2662 result = (result << 8) & 0xff00;
2663 PerlIO_releaseFILE(ptr,f);
2669 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2672 register const char *frombase = from;
2675 register const char c = *from;
2680 while (count-- > 0) {
2681 for (todo = len; todo > 0; todo--) {
2690 Perl_same_dirent(pTHX_ char *a, char *b)
2692 char *fa = strrchr(a,'/');
2693 char *fb = strrchr(b,'/');
2696 SV *tmpsv = sv_newmortal();
2709 sv_setpv(tmpsv, ".");
2711 sv_setpvn(tmpsv, a, fa - a);
2712 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2715 sv_setpv(tmpsv, ".");
2717 sv_setpvn(tmpsv, b, fb - b);
2718 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2720 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2721 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2723 #endif /* !HAS_RENAME */
2726 Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
2728 char *xfound = Nullch;
2729 char *xfailed = Nullch;
2730 char tmpbuf[MAXPATHLEN];
2734 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2735 # define SEARCH_EXTS ".bat", ".cmd", NULL
2736 # define MAX_EXT_LEN 4
2739 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2740 # define MAX_EXT_LEN 4
2743 # define SEARCH_EXTS ".pl", ".com", NULL
2744 # define MAX_EXT_LEN 4
2746 /* additional extensions to try in each dir if scriptname not found */
2748 char *exts[] = { SEARCH_EXTS };
2749 char **ext = search_ext ? search_ext : exts;
2750 int extidx = 0, i = 0;
2751 char *curext = Nullch;
2753 # define MAX_EXT_LEN 0
2757 * If dosearch is true and if scriptname does not contain path
2758 * delimiters, search the PATH for scriptname.
2760 * If SEARCH_EXTS is also defined, will look for each
2761 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2762 * while searching the PATH.
2764 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2765 * proceeds as follows:
2766 * If DOSISH or VMSISH:
2767 * + look for ./scriptname{,.foo,.bar}
2768 * + search the PATH for scriptname{,.foo,.bar}
2771 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2772 * this will not look in '.' if it's not in the PATH)
2777 # ifdef ALWAYS_DEFTYPES
2778 len = strlen(scriptname);
2779 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2780 int hasdir, idx = 0, deftypes = 1;
2783 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2786 int hasdir, idx = 0, deftypes = 1;
2789 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2791 /* The first time through, just add SEARCH_EXTS to whatever we
2792 * already have, so we can check for default file types. */
2794 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2800 if ((strlen(tmpbuf) + strlen(scriptname)
2801 + MAX_EXT_LEN) >= sizeof tmpbuf)
2802 continue; /* don't search dir with too-long name */
2803 strcat(tmpbuf, scriptname);
2807 if (strEQ(scriptname, "-"))
2809 if (dosearch) { /* Look in '.' first. */
2810 char *cur = scriptname;
2812 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2814 if (strEQ(ext[i++],curext)) {
2815 extidx = -1; /* already has an ext */
2820 DEBUG_p(PerlIO_printf(Perl_debug_log,
2821 "Looking for %s\n",cur));
2822 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2823 && !S_ISDIR(PL_statbuf.st_mode)) {
2831 if (cur == scriptname) {
2832 len = strlen(scriptname);
2833 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2835 cur = strcpy(tmpbuf, scriptname);
2837 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2838 && strcpy(tmpbuf+len, ext[extidx++]));
2843 #ifdef MACOS_TRADITIONAL
2844 if (dosearch && !strchr(scriptname, ':') &&
2845 (s = PerlEnv_getenv("Commands")))
2847 if (dosearch && !strchr(scriptname, '/')
2849 && !strchr(scriptname, '\\')
2851 && (s = PerlEnv_getenv("PATH")))
2856 PL_bufend = s + strlen(s);
2857 while (s < PL_bufend) {
2858 #ifdef MACOS_TRADITIONAL
2859 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2863 #if defined(atarist) || defined(DOSISH)
2868 && *s != ';'; len++, s++) {
2869 if (len < sizeof tmpbuf)
2872 if (len < sizeof tmpbuf)
2874 #else /* ! (atarist || DOSISH) */
2875 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2878 #endif /* ! (atarist || DOSISH) */
2879 #endif /* MACOS_TRADITIONAL */
2882 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2883 continue; /* don't search dir with too-long name */
2884 #ifdef MACOS_TRADITIONAL
2885 if (len && tmpbuf[len - 1] != ':')
2886 tmpbuf[len++] = ':';
2889 #if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2890 && tmpbuf[len - 1] != '/'
2891 && tmpbuf[len - 1] != '\\'
2894 tmpbuf[len++] = '/';
2895 if (len == 2 && tmpbuf[0] == '.')
2898 (void)strcpy(tmpbuf + len, scriptname);
2902 len = strlen(tmpbuf);
2903 if (extidx > 0) /* reset after previous loop */
2907 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2908 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2909 if (S_ISDIR(PL_statbuf.st_mode)) {
2913 } while ( retval < 0 /* not there */
2914 && extidx>=0 && ext[extidx] /* try an extension? */
2915 && strcpy(tmpbuf+len, ext[extidx++])
2920 if (S_ISREG(PL_statbuf.st_mode)
2921 && cando(S_IRUSR,TRUE,&PL_statbuf)
2922 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2923 && cando(S_IXUSR,TRUE,&PL_statbuf)
2927 xfound = tmpbuf; /* bingo! */
2931 xfailed = savepv(tmpbuf);
2934 if (!xfound && !seen_dot && !xfailed &&
2935 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2936 || S_ISDIR(PL_statbuf.st_mode)))
2938 seen_dot = 1; /* Disable message. */
2940 if (flags & 1) { /* do or die? */
2941 Perl_croak(aTHX_ "Can't %s %s%s%s",
2942 (xfailed ? "execute" : "find"),
2943 (xfailed ? xfailed : scriptname),
2944 (xfailed ? "" : " on PATH"),
2945 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2947 scriptname = Nullch;
2951 scriptname = xfound;
2953 return (scriptname ? savepv(scriptname) : Nullch);
2956 #ifndef PERL_GET_CONTEXT_DEFINED
2959 Perl_get_context(void)
2961 #if defined(USE_ITHREADS)
2962 # ifdef OLD_PTHREADS_API
2964 if (pthread_getspecific(PL_thr_key, &t))
2965 Perl_croak_nocontext("panic: pthread_getspecific");
2968 # ifdef I_MACH_CTHREADS
2969 return (void*)cthread_data(cthread_self());
2971 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2980 Perl_set_context(void *t)
2982 #if defined(USE_ITHREADS)
2983 # ifdef I_MACH_CTHREADS
2984 cthread_set_data(cthread_self(), t);
2986 if (pthread_setspecific(PL_thr_key, t))
2987 Perl_croak_nocontext("panic: pthread_setspecific");
2992 #endif /* !PERL_GET_CONTEXT_DEFINED */
2994 #ifdef PERL_GLOBAL_STRUCT
3003 Perl_get_op_names(pTHX)
3009 Perl_get_op_descs(pTHX)
3015 Perl_get_no_modify(pTHX)
3017 return (char*)PL_no_modify;
3021 Perl_get_opargs(pTHX)
3027 Perl_get_ppaddr(pTHX)
3029 return (PPADDR_t*)PL_ppaddr;
3032 #ifndef HAS_GETENV_LEN
3034 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3036 char *env_trans = PerlEnv_getenv(env_elem);
3038 *len = strlen(env_trans);
3045 Perl_get_vtbl(pTHX_ int vtbl_id)
3047 MGVTBL* result = Null(MGVTBL*);
3051 result = &PL_vtbl_sv;
3054 result = &PL_vtbl_env;
3056 case want_vtbl_envelem:
3057 result = &PL_vtbl_envelem;
3060 result = &PL_vtbl_sig;
3062 case want_vtbl_sigelem:
3063 result = &PL_vtbl_sigelem;
3065 case want_vtbl_pack:
3066 result = &PL_vtbl_pack;
3068 case want_vtbl_packelem:
3069 result = &PL_vtbl_packelem;
3071 case want_vtbl_dbline:
3072 result = &PL_vtbl_dbline;
3075 result = &PL_vtbl_isa;
3077 case want_vtbl_isaelem:
3078 result = &PL_vtbl_isaelem;
3080 case want_vtbl_arylen:
3081 result = &PL_vtbl_arylen;
3083 case want_vtbl_glob:
3084 result = &PL_vtbl_glob;
3086 case want_vtbl_mglob:
3087 result = &PL_vtbl_mglob;
3089 case want_vtbl_nkeys:
3090 result = &PL_vtbl_nkeys;
3092 case want_vtbl_taint:
3093 result = &PL_vtbl_taint;
3095 case want_vtbl_substr:
3096 result = &PL_vtbl_substr;
3099 result = &PL_vtbl_vec;
3102 result = &PL_vtbl_pos;
3105 result = &PL_vtbl_bm;
3108 result = &PL_vtbl_fm;
3110 case want_vtbl_uvar:
3111 result = &PL_vtbl_uvar;
3113 case want_vtbl_defelem:
3114 result = &PL_vtbl_defelem;
3116 case want_vtbl_regexp:
3117 result = &PL_vtbl_regexp;
3119 case want_vtbl_regdata:
3120 result = &PL_vtbl_regdata;
3122 case want_vtbl_regdatum:
3123 result = &PL_vtbl_regdatum;
3125 #ifdef USE_LOCALE_COLLATE
3126 case want_vtbl_collxfrm:
3127 result = &PL_vtbl_collxfrm;
3130 case want_vtbl_amagic:
3131 result = &PL_vtbl_amagic;
3133 case want_vtbl_amagicelem:
3134 result = &PL_vtbl_amagicelem;
3136 case want_vtbl_backref:
3137 result = &PL_vtbl_backref;
3139 case want_vtbl_utf8:
3140 result = &PL_vtbl_utf8;
3147 Perl_my_fflush_all(pTHX)
3149 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3150 return PerlIO_flush(NULL);
3152 # if defined(HAS__FWALK)
3153 extern int fflush(FILE *);
3154 /* undocumented, unprototyped, but very useful BSDism */
3155 extern void _fwalk(int (*)(FILE *));
3159 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3161 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3162 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3164 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3165 open_max = sysconf(_SC_OPEN_MAX);
3168 open_max = FOPEN_MAX;
3171 open_max = OPEN_MAX;
3182 for (i = 0; i < open_max; i++)
3183 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3184 STDIO_STREAM_ARRAY[i]._file < open_max &&
3185 STDIO_STREAM_ARRAY[i]._flag)
3186 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3190 SETERRNO(EBADF,RMS_IFI);
3197 Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3200 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3201 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3203 char *pars = OP_IS_FILETEST(op) ? "" : "()";
3204 char *type = OP_IS_SOCKET(op)
3205 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3206 ? "socket" : "filehandle";
3209 if (gv && isGV(gv)) {
3213 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3214 if (ckWARN(WARN_IO)) {
3215 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3217 Perl_warner(aTHX_ packWARN(WARN_IO),
3218 "Filehandle %s opened only for %sput",
3221 Perl_warner(aTHX_ packWARN(WARN_IO),
3222 "Filehandle opened only for %sput", direction);
3229 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3231 warn_type = WARN_CLOSED;
3235 warn_type = WARN_UNOPENED;
3238 if (ckWARN(warn_type)) {
3239 if (name && *name) {
3240 Perl_warner(aTHX_ packWARN(warn_type),
3241 "%s%s on %s %s %s", func, pars, vile, type, name);
3242 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3244 aTHX_ packWARN(warn_type),
3245 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3250 Perl_warner(aTHX_ packWARN(warn_type),
3251 "%s%s on %s %s", func, pars, vile, type);
3252 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3254 aTHX_ packWARN(warn_type),
3255 "\t(Are you trying to call %s%s on dirhandle?)\n",
3264 /* in ASCII order, not that it matters */
3265 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3268 Perl_ebcdic_control(pTHX_ int ch)
3276 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3277 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3280 if (ctlp == controllablechars)
3281 return('\177'); /* DEL */
3283 return((unsigned char)(ctlp - controllablechars - 1));
3284 } else { /* Want uncontrol */
3285 if (ch == '\177' || ch == -1)
3287 else if (ch == '\157')
3289 else if (ch == '\174')
3291 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3293 else if (ch == '\155')
3295 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3296 return(controllablechars[ch+1]);
3298 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3303 /* To workaround core dumps from the uninitialised tm_zone we get the
3304 * system to give us a reasonable struct to copy. This fix means that
3305 * strftime uses the tm_zone and tm_gmtoff values returned by
3306 * localtime(time()). That should give the desired result most of the
3307 * time. But probably not always!
3309 * This does not address tzname aspects of NETaa14816.
3314 # ifndef STRUCT_TM_HASZONE
3315 # define STRUCT_TM_HASZONE
3319 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3320 # ifndef HAS_TM_TM_ZONE
3321 # define HAS_TM_TM_ZONE
3326 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3328 #ifdef HAS_TM_TM_ZONE
3331 Copy(localtime(&now), ptm, 1, struct tm);
3336 * mini_mktime - normalise struct tm values without the localtime()
3337 * semantics (and overhead) of mktime().
3340 Perl_mini_mktime(pTHX_ struct tm *ptm)
3344 int month, mday, year, jday;
3345 int odd_cent, odd_year;
3347 #define DAYS_PER_YEAR 365
3348 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3349 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3350 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3351 #define SECS_PER_HOUR (60*60)
3352 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3353 /* parentheses deliberately absent on these two, otherwise they don't work */
3354 #define MONTH_TO_DAYS 153/5
3355 #define DAYS_TO_MONTH 5/153
3356 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3357 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3358 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3359 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3362 * Year/day algorithm notes:
3364 * With a suitable offset for numeric value of the month, one can find
3365 * an offset into the year by considering months to have 30.6 (153/5) days,
3366 * using integer arithmetic (i.e., with truncation). To avoid too much
3367 * messing about with leap days, we consider January and February to be
3368 * the 13th and 14th month of the previous year. After that transformation,
3369 * we need the month index we use to be high by 1 from 'normal human' usage,
3370 * so the month index values we use run from 4 through 15.
3372 * Given that, and the rules for the Gregorian calendar (leap years are those
3373 * divisible by 4 unless also divisible by 100, when they must be divisible
3374 * by 400 instead), we can simply calculate the number of days since some
3375 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3376 * the days we derive from our month index, and adding in the day of the
3377 * month. The value used here is not adjusted for the actual origin which
3378 * it normally would use (1 January A.D. 1), since we're not exposing it.
3379 * We're only building the value so we can turn around and get the
3380 * normalised values for the year, month, day-of-month, and day-of-year.
3382 * For going backward, we need to bias the value we're using so that we find
3383 * the right year value. (Basically, we don't want the contribution of
3384 * March 1st to the number to apply while deriving the year). Having done
3385 * that, we 'count up' the contribution to the year number by accounting for
3386 * full quadracenturies (400-year periods) with their extra leap days, plus
3387 * the contribution from full centuries (to avoid counting in the lost leap
3388 * days), plus the contribution from full quad-years (to count in the normal
3389 * leap days), plus the leftover contribution from any non-leap years.
3390 * At this point, if we were working with an actual leap day, we'll have 0
3391 * days left over. This is also true for March 1st, however. So, we have
3392 * to special-case that result, and (earlier) keep track of the 'odd'
3393 * century and year contributions. If we got 4 extra centuries in a qcent,
3394 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3395 * Otherwise, we add back in the earlier bias we removed (the 123 from
3396 * figuring in March 1st), find the month index (integer division by 30.6),
3397 * and the remainder is the day-of-month. We then have to convert back to
3398 * 'real' months (including fixing January and February from being 14/15 in
3399 * the previous year to being in the proper year). After that, to get
3400 * tm_yday, we work with the normalised year and get a new yearday value for
3401 * January 1st, which we subtract from the yearday value we had earlier,
3402 * representing the date we've re-built. This is done from January 1
3403 * because tm_yday is 0-origin.
3405 * Since POSIX time routines are only guaranteed to work for times since the
3406 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3407 * applies Gregorian calendar rules even to dates before the 16th century
3408 * doesn't bother me. Besides, you'd need cultural context for a given
3409 * date to know whether it was Julian or Gregorian calendar, and that's
3410 * outside the scope for this routine. Since we convert back based on the
3411 * same rules we used to build the yearday, you'll only get strange results
3412 * for input which needed normalising, or for the 'odd' century years which
3413 * were leap years in the Julian calander but not in the Gregorian one.
3414 * I can live with that.
3416 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3417 * that's still outside the scope for POSIX time manipulation, so I don't
3421 year = 1900 + ptm->tm_year;
3422 month = ptm->tm_mon;
3423 mday = ptm->tm_mday;
3424 /* allow given yday with no month & mday to dominate the result */
3425 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3428 jday = 1 + ptm->tm_yday;
3437 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3438 yearday += month*MONTH_TO_DAYS + mday + jday;
3440 * Note that we don't know when leap-seconds were or will be,
3441 * so we have to trust the user if we get something which looks
3442 * like a sensible leap-second. Wild values for seconds will
3443 * be rationalised, however.
3445 if ((unsigned) ptm->tm_sec <= 60) {
3452 secs += 60 * ptm->tm_min;
3453 secs += SECS_PER_HOUR * ptm->tm_hour;
3455 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3456 /* got negative remainder, but need positive time */
3457 /* back off an extra day to compensate */
3458 yearday += (secs/SECS_PER_DAY)-1;
3459 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3462 yearday += (secs/SECS_PER_DAY);
3463 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3466 else if (secs >= SECS_PER_DAY) {
3467 yearday += (secs/SECS_PER_DAY);
3468 secs %= SECS_PER_DAY;
3470 ptm->tm_hour = secs/SECS_PER_HOUR;
3471 secs %= SECS_PER_HOUR;
3472 ptm->tm_min = secs/60;
3474 ptm->tm_sec += secs;
3475 /* done with time of day effects */
3477 * The algorithm for yearday has (so far) left it high by 428.
3478 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3479 * bias it by 123 while trying to figure out what year it
3480 * really represents. Even with this tweak, the reverse
3481 * translation fails for years before A.D. 0001.
3482 * It would still fail for Feb 29, but we catch that one below.
3484 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3485 yearday -= YEAR_ADJUST;
3486 year = (yearday / DAYS_PER_QCENT) * 400;
3487 yearday %= DAYS_PER_QCENT;
3488 odd_cent = yearday / DAYS_PER_CENT;
3489 year += odd_cent * 100;
3490 yearday %= DAYS_PER_CENT;
3491 year += (yearday / DAYS_PER_QYEAR) * 4;
3492 yearday %= DAYS_PER_QYEAR;
3493 odd_year = yearday / DAYS_PER_YEAR;
3495 yearday %= DAYS_PER_YEAR;
3496 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3501 yearday += YEAR_ADJUST; /* recover March 1st crock */
3502 month = yearday*DAYS_TO_MONTH;
3503 yearday -= month*MONTH_TO_DAYS;
3504 /* recover other leap-year adjustment */
3513 ptm->tm_year = year - 1900;
3515 ptm->tm_mday = yearday;
3516 ptm->tm_mon = month;
3520 ptm->tm_mon = month - 1;
3522 /* re-build yearday based on Jan 1 to get tm_yday */
3524 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3525 yearday += 14*MONTH_TO_DAYS + 1;
3526 ptm->tm_yday = jday - yearday;
3527 /* fix tm_wday if not overridden by caller */
3528 if ((unsigned)ptm->tm_wday > 6)
3529 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3533 Perl_my_strftime(pTHX_ char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3541 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3544 mytm.tm_hour = hour;
3545 mytm.tm_mday = mday;
3547 mytm.tm_year = year;
3548 mytm.tm_wday = wday;
3549 mytm.tm_yday = yday;
3550 mytm.tm_isdst = isdst;
3552 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3553 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3558 #ifdef HAS_TM_TM_GMTOFF
3559 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3561 #ifdef HAS_TM_TM_ZONE
3562 mytm.tm_zone = mytm2.tm_zone;
3567 New(0, buf, buflen, char);
3568 len = strftime(buf, buflen, fmt, &mytm);
3570 ** The following is needed to handle to the situation where
3571 ** tmpbuf overflows. Basically we want to allocate a buffer
3572 ** and try repeatedly. The reason why it is so complicated
3573 ** is that getting a return value of 0 from strftime can indicate
3574 ** one of the following:
3575 ** 1. buffer overflowed,
3576 ** 2. illegal conversion specifier, or
3577 ** 3. the format string specifies nothing to be returned(not
3578 ** an error). This could be because format is an empty string
3579 ** or it specifies %p that yields an empty string in some locale.
3580 ** If there is a better way to make it portable, go ahead by
3583 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3586 /* Possibly buf overflowed - try again with a bigger buf */
3587 int fmtlen = strlen(fmt);
3588 int bufsize = fmtlen + buflen;
3590 New(0, buf, bufsize, char);
3592 buflen = strftime(buf, bufsize, fmt, &mytm);
3593 if (buflen > 0 && buflen < bufsize)
3595 /* heuristic to prevent out-of-memory errors */
3596 if (bufsize > 100*fmtlen) {
3602 Renew(buf, bufsize, char);
3607 Perl_croak(aTHX_ "panic: no strftime");
3612 #define SV_CWD_RETURN_UNDEF \
3613 sv_setsv(sv, &PL_sv_undef); \
3616 #define SV_CWD_ISDOT(dp) \
3617 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3618 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3621 =head1 Miscellaneous Functions
3623 =for apidoc getcwd_sv
3625 Fill the sv with current working directory
3630 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3631 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3632 * getcwd(3) if available
3633 * Comments from the orignal:
3634 * This is a faster version of getcwd. It's also more dangerous
3635 * because you might chdir out of a directory that you can't chdir
3639 Perl_getcwd_sv(pTHX_ register SV *sv)
3643 #ifndef INCOMPLETE_TAINTS
3649 char buf[MAXPATHLEN];
3651 /* Some getcwd()s automatically allocate a buffer of the given
3652 * size from the heap if they are given a NULL buffer pointer.
3653 * The problem is that this behaviour is not portable. */
3654 if (getcwd(buf, sizeof(buf) - 1)) {
3655 STRLEN len = strlen(buf);
3656 sv_setpvn(sv, buf, len);
3660 sv_setsv(sv, &PL_sv_undef);
3668 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3669 int namelen, pathlen=0;
3673 (void)SvUPGRADE(sv, SVt_PV);
3675 if (PerlLIO_lstat(".", &statbuf) < 0) {
3676 SV_CWD_RETURN_UNDEF;
3679 orig_cdev = statbuf.st_dev;
3680 orig_cino = statbuf.st_ino;
3688 if (PerlDir_chdir("..") < 0) {
3689 SV_CWD_RETURN_UNDEF;
3691 if (PerlLIO_stat(".", &statbuf) < 0) {
3692 SV_CWD_RETURN_UNDEF;
3695 cdev = statbuf.st_dev;
3696 cino = statbuf.st_ino;
3698 if (odev == cdev && oino == cino) {
3701 if (!(dir = PerlDir_open("."))) {
3702 SV_CWD_RETURN_UNDEF;
3705 while ((dp = PerlDir_read(dir)) != NULL) {
3707 namelen = dp->d_namlen;
3709 namelen = strlen(dp->d_name);
3712 if (SV_CWD_ISDOT(dp)) {
3716 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3717 SV_CWD_RETURN_UNDEF;
3720 tdev = statbuf.st_dev;
3721 tino = statbuf.st_ino;
3722 if (tino == oino && tdev == odev) {
3728 SV_CWD_RETURN_UNDEF;
3731 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3732 SV_CWD_RETURN_UNDEF;
3735 SvGROW(sv, pathlen + namelen + 1);
3739 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3742 /* prepend current directory to the front */
3744 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3745 pathlen += (namelen + 1);
3747 #ifdef VOID_CLOSEDIR
3750 if (PerlDir_close(dir) < 0) {
3751 SV_CWD_RETURN_UNDEF;
3757 SvCUR_set(sv, pathlen);
3761 if (PerlDir_chdir(SvPVX(sv)) < 0) {
3762 SV_CWD_RETURN_UNDEF;
3765 if (PerlLIO_stat(".", &statbuf) < 0) {
3766 SV_CWD_RETURN_UNDEF;
3769 cdev = statbuf.st_dev;
3770 cino = statbuf.st_ino;
3772 if (cdev != orig_cdev || cino != orig_cino) {
3773 Perl_croak(aTHX_ "Unstable directory path, "
3774 "current directory changed unexpectedly");
3786 =for apidoc scan_version
3788 Returns a pointer to the next character after the parsed
3789 version string, as well as upgrading the passed in SV to
3792 Function must be called with an already existing SV like
3795 s = scan_version(s,SV *sv, bool qv);
3797 Performs some preprocessing to the string to ensure that
3798 it has the correct characteristics of a version. Flags the
3799 object if it contains an underscore (which denotes this
3800 is a alpha version). The boolean qv denotes that the version
3801 should be interpreted as if it had multiple decimals, even if
3808 Perl_scan_version(pTHX_ char *s, SV *rv, bool qv)
3810 const char *start = s;
3814 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3815 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3818 /* pre-scan the imput string to check for decimals */
3819 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3824 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3827 else if ( *pos == '_' )
3830 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3838 pos++; /* get past 'v' */
3839 qv = 1; /* force quoted version processing */
3841 while (isDIGIT(*pos))
3843 if (!isALPHA(*pos)) {
3846 if (*s == 'v') s++; /* get past 'v' */
3851 /* this is atoi() that delimits on underscores */
3855 if ( s < pos && s > start && *(s-1) == '_' ) {
3856 mult *= -1; /* alpha version */
3858 /* the following if() will only be true after the decimal
3859 * point of a version originally created with a bare
3860 * floating point number, i.e. not quoted in any way
3862 if ( !qv && s > start+1 && saw_period == 1 ) {
3866 rev += (*s - '0') * mult;
3868 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3869 Perl_croak(aTHX_ "Integer overflow in version");
3874 while (--end >= s) {
3876 rev += (*end - '0') * mult;
3878 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3879 Perl_croak(aTHX_ "Integer overflow in version");
3884 /* Append revision */
3885 av_push((AV *)sv, newSViv(rev));
3886 if ( (*pos == '.' || *pos == '_') && isDIGIT(pos[1]))
3888 else if ( isDIGIT(*pos) )
3894 while ( isDIGIT(*pos) ) {
3895 if ( saw_period == 1 && pos-s == 3 )
3901 if ( qv ) { /* quoted versions always become full version objects */
3902 I32 len = av_len((AV *)sv);
3903 /* This for loop appears to trigger a compiler bug on OS X, as it
3904 loops infinitely. Yes, len is negative. No, it makes no sense.
3905 Compiler in question is:
3906 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3907 for ( len = 2 - len; len > 0; len-- )
3908 av_push((AV *)sv, newSViv(0));
3912 av_push((AV *)sv, newSViv(0));
3918 =for apidoc new_version
3920 Returns a new version object based on the passed in SV:
3922 SV *sv = new_version(SV *ver);
3924 Does not alter the passed in ver SV. See "upg_version" if you
3925 want to upgrade the SV.
3931 Perl_new_version(pTHX_ SV *ver)
3934 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3937 AV *av = (AV *)SvRV(ver);
3938 SV* sv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3939 (void)sv_upgrade(sv, SVt_PVAV); /* needs to be an AV type */
3941 for ( key = 0; key <= av_len(av); key++ )
3943 I32 rev = SvIV(*av_fetch(av, key, FALSE));
3944 av_push((AV *)sv, newSViv(rev));
3949 if ( SvVOK(ver) ) { /* already a v-string */
3951 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3952 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3953 sv_setpv(rv,version);
3958 sv_setsv(rv,ver); /* make a duplicate */
3967 =for apidoc upg_version
3969 In-place upgrade of the supplied SV to a version object.
3971 SV *sv = upg_version(SV *sv);
3973 Returns a pointer to the upgraded SV.
3979 Perl_upg_version(pTHX_ SV *ver)
3984 if ( SvNOK(ver) ) /* may get too much accuracy */
3987 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
3988 version = savepv(tbuf);
3991 else if ( SvVOK(ver) ) { /* already a v-string */
3992 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
3993 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
3997 else /* must be a string or something like a string */
3999 version = savesvpv(ver);
4001 (void)scan_version(version, ver, qv);
4010 Accepts a version object and returns the normalized floating
4011 point representation. Call like:
4015 NOTE: you can pass either the object directly or the SV
4016 contained within the RV.
4022 Perl_vnumify(pTHX_ SV *vs)
4028 len = av_len((AV *)vs);
4031 Perl_sv_catpv(aTHX_ sv,"0");
4034 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4035 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4036 for ( i = 1 ; i < len ; i++ )
4038 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4039 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4044 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4045 if ( (int)PERL_ABS(digit) != 0 || len == 1 )
4047 if ( digit < 0 ) /* alpha version */
4048 Perl_sv_catpv(aTHX_ sv,"_");
4049 /* Don't display additional trailing zeros */
4050 Perl_sv_catpvf(aTHX_ sv,"%03d", (int)PERL_ABS(digit));
4055 Perl_sv_catpv(aTHX_ sv,"000");
4063 Accepts a version object and returns the normalized string
4064 representation. Call like:
4068 NOTE: you can pass either the object directly or the SV
4069 contained within the RV.
4075 Perl_vnormal(pTHX_ SV *vs)
4081 len = av_len((AV *)vs);
4084 Perl_sv_catpv(aTHX_ sv,"");
4087 digit = SvIVX(*av_fetch((AV *)vs, 0, 0));
4088 Perl_sv_setpvf(aTHX_ sv,"%"IVdf,(IV)digit);
4089 for ( i = 1 ; i <= len ; i++ )
4091 digit = SvIVX(*av_fetch((AV *)vs, i, 0));
4093 Perl_sv_catpvf(aTHX_ sv,"_%"IVdf,(IV)-digit);
4095 Perl_sv_catpvf(aTHX_ sv,".%"IVdf,(IV)digit);
4098 if ( len <= 2 ) { /* short version, must be at least three */
4099 for ( len = 2 - len; len != 0; len-- )
4100 Perl_sv_catpv(aTHX_ sv,".0");
4107 =for apidoc vstringify
4109 In order to maintain maximum compatibility with earlier versions
4110 of Perl, this function will return either the floating point
4111 notation or the multiple dotted notation, depending on whether
4112 the original version contained 1 or more dots, respectively
4118 Perl_vstringify(pTHX_ SV *vs)
4123 len = av_len((AV *)vs);
4124 digit = SvIVX(*av_fetch((AV *)vs, len, 0));
4126 if ( len < 2 || ( len == 2 && digit < 0 ) )
4135 Version object aware cmp. Both operands must already have been
4136 converted into version objects.
4142 Perl_vcmp(pTHX_ SV *lsv, SV *rsv)
4149 l = av_len((AV *)lsv);
4150 r = av_len((AV *)rsv);
4154 while ( i <= m && retval == 0 )
4156 I32 left = SvIV(*av_fetch((AV *)lsv,i,0));
4157 I32 right = SvIV(*av_fetch((AV *)rsv,i,0));
4158 bool lalpha = left < 0 ? 1 : 0;
4159 bool ralpha = right < 0 ? 1 : 0;
4162 if ( left < right || (left == right && lalpha && !ralpha) )
4164 if ( left > right || (left == right && ralpha && !lalpha) )
4169 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4173 while ( i <= r && retval == 0 )
4175 if ( SvIV(*av_fetch((AV *)rsv,i,0)) != 0 )
4176 retval = -1; /* not a match after all */
4182 while ( i <= l && retval == 0 )
4184 if ( SvIV(*av_fetch((AV *)lsv,i,0)) != 0 )
4185 retval = +1; /* not a match after all */
4193 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4194 # define EMULATE_SOCKETPAIR_UDP
4197 #ifdef EMULATE_SOCKETPAIR_UDP
4199 S_socketpair_udp (int fd[2]) {
4201 /* Fake a datagram socketpair using UDP to localhost. */
4202 int sockets[2] = {-1, -1};
4203 struct sockaddr_in addresses[2];
4205 Sock_size_t size = sizeof(struct sockaddr_in);
4206 unsigned short port;
4209 memset(&addresses, 0, sizeof(addresses));
4212 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4213 if (sockets[i] == -1)
4214 goto tidy_up_and_fail;
4216 addresses[i].sin_family = AF_INET;
4217 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4218 addresses[i].sin_port = 0; /* kernel choses port. */
4219 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4220 sizeof(struct sockaddr_in)) == -1)
4221 goto tidy_up_and_fail;
4224 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4225 for each connect the other socket to it. */
4228 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4230 goto tidy_up_and_fail;
4231 if (size != sizeof(struct sockaddr_in))
4232 goto abort_tidy_up_and_fail;
4233 /* !1 is 0, !0 is 1 */
4234 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4235 sizeof(struct sockaddr_in)) == -1)
4236 goto tidy_up_and_fail;
4239 /* Now we have 2 sockets connected to each other. I don't trust some other
4240 process not to have already sent a packet to us (by random) so send
4241 a packet from each to the other. */
4244 /* I'm going to send my own port number. As a short.
4245 (Who knows if someone somewhere has sin_port as a bitfield and needs
4246 this routine. (I'm assuming crays have socketpair)) */
4247 port = addresses[i].sin_port;
4248 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4249 if (got != sizeof(port)) {
4251 goto tidy_up_and_fail;
4252 goto abort_tidy_up_and_fail;
4256 /* Packets sent. I don't trust them to have arrived though.
4257 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4258 connect to localhost will use a second kernel thread. In 2.6 the
4259 first thread running the connect() returns before the second completes,
4260 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4261 returns 0. Poor programs have tripped up. One poor program's authors'
4262 had a 50-1 reverse stock split. Not sure how connected these were.)
4263 So I don't trust someone not to have an unpredictable UDP stack.
4267 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4268 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4272 FD_SET(sockets[0], &rset);
4273 FD_SET(sockets[1], &rset);
4275 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4276 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4277 || !FD_ISSET(sockets[1], &rset)) {
4278 /* I hope this is portable and appropriate. */
4280 goto tidy_up_and_fail;
4281 goto abort_tidy_up_and_fail;
4285 /* And the paranoia department even now doesn't trust it to have arrive
4286 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4288 struct sockaddr_in readfrom;
4289 unsigned short buffer[2];
4294 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4295 sizeof(buffer), MSG_DONTWAIT,
4296 (struct sockaddr *) &readfrom, &size);
4298 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4300 (struct sockaddr *) &readfrom, &size);
4304 goto tidy_up_and_fail;
4305 if (got != sizeof(port)
4306 || size != sizeof(struct sockaddr_in)
4307 /* Check other socket sent us its port. */
4308 || buffer[0] != (unsigned short) addresses[!i].sin_port
4309 /* Check kernel says we got the datagram from that socket */
4310 || readfrom.sin_family != addresses[!i].sin_family
4311 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4312 || readfrom.sin_port != addresses[!i].sin_port)
4313 goto abort_tidy_up_and_fail;
4316 /* My caller (my_socketpair) has validated that this is non-NULL */
4319 /* I hereby declare this connection open. May God bless all who cross
4323 abort_tidy_up_and_fail:
4324 errno = ECONNABORTED;
4327 int save_errno = errno;
4328 if (sockets[0] != -1)
4329 PerlLIO_close(sockets[0]);
4330 if (sockets[1] != -1)
4331 PerlLIO_close(sockets[1]);
4336 #endif /* EMULATE_SOCKETPAIR_UDP */
4338 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4340 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4341 /* Stevens says that family must be AF_LOCAL, protocol 0.
4342 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4347 struct sockaddr_in listen_addr;
4348 struct sockaddr_in connect_addr;
4353 || family != AF_UNIX
4356 errno = EAFNOSUPPORT;
4364 #ifdef EMULATE_SOCKETPAIR_UDP
4365 if (type == SOCK_DGRAM)
4366 return S_socketpair_udp(fd);
4369 listener = PerlSock_socket(AF_INET, type, 0);
4372 memset(&listen_addr, 0, sizeof(listen_addr));
4373 listen_addr.sin_family = AF_INET;
4374 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4375 listen_addr.sin_port = 0; /* kernel choses port. */
4376 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4377 sizeof(listen_addr)) == -1)
4378 goto tidy_up_and_fail;
4379 if (PerlSock_listen(listener, 1) == -1)
4380 goto tidy_up_and_fail;
4382 connector = PerlSock_socket(AF_INET, type, 0);
4383 if (connector == -1)
4384 goto tidy_up_and_fail;
4385 /* We want to find out the port number to connect to. */
4386 size = sizeof(connect_addr);
4387 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4389 goto tidy_up_and_fail;
4390 if (size != sizeof(connect_addr))
4391 goto abort_tidy_up_and_fail;
4392 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4393 sizeof(connect_addr)) == -1)
4394 goto tidy_up_and_fail;
4396 size = sizeof(listen_addr);
4397 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4400 goto tidy_up_and_fail;
4401 if (size != sizeof(listen_addr))
4402 goto abort_tidy_up_and_fail;
4403 PerlLIO_close(listener);
4404 /* Now check we are talking to ourself by matching port and host on the
4406 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4408 goto tidy_up_and_fail;
4409 if (size != sizeof(connect_addr)
4410 || listen_addr.sin_family != connect_addr.sin_family
4411 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4412 || listen_addr.sin_port != connect_addr.sin_port) {
4413 goto abort_tidy_up_and_fail;
4419 abort_tidy_up_and_fail:
4420 errno = ECONNABORTED; /* I hope this is portable and appropriate. */
4423 int save_errno = errno;
4425 PerlLIO_close(listener);
4426 if (connector != -1)
4427 PerlLIO_close(connector);
4429 PerlLIO_close(acceptor);
4435 /* In any case have a stub so that there's code corresponding
4436 * to the my_socketpair in global.sym. */
4438 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4439 #ifdef HAS_SOCKETPAIR
4440 return socketpair(family, type, protocol, fd);
4449 =for apidoc sv_nosharing
4451 Dummy routine which "shares" an SV when there is no sharing module present.
4452 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4453 some level of strict-ness.
4459 Perl_sv_nosharing(pTHX_ SV *sv)
4464 =for apidoc sv_nolocking
4466 Dummy routine which "locks" an SV when there is no locking module present.
4467 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4468 some level of strict-ness.
4474 Perl_sv_nolocking(pTHX_ SV *sv)
4480 =for apidoc sv_nounlocking
4482 Dummy routine which "unlocks" an SV when there is no locking module present.
4483 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4484 some level of strict-ness.
4490 Perl_sv_nounlocking(pTHX_ SV *sv)
4495 Perl_parse_unicode_opts(pTHX_ char **popt)
4502 opt = (U32) atoi(p);
4503 while (isDIGIT(*p)) p++;
4504 if (*p && *p != '\n' && *p != '\r')
4505 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4510 case PERL_UNICODE_STDIN:
4511 opt |= PERL_UNICODE_STDIN_FLAG; break;
4512 case PERL_UNICODE_STDOUT:
4513 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4514 case PERL_UNICODE_STDERR:
4515 opt |= PERL_UNICODE_STDERR_FLAG; break;
4516 case PERL_UNICODE_STD:
4517 opt |= PERL_UNICODE_STD_FLAG; break;
4518 case PERL_UNICODE_IN:
4519 opt |= PERL_UNICODE_IN_FLAG; break;
4520 case PERL_UNICODE_OUT:
4521 opt |= PERL_UNICODE_OUT_FLAG; break;
4522 case PERL_UNICODE_INOUT:
4523 opt |= PERL_UNICODE_INOUT_FLAG; break;
4524 case PERL_UNICODE_LOCALE:
4525 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4526 case PERL_UNICODE_ARGV:
4527 opt |= PERL_UNICODE_ARGV_FLAG; break;
4529 if (*p != '\n' && *p != '\r')
4531 "Unknown Unicode option letter '%c'", *p);
4537 opt = PERL_UNICODE_DEFAULT_FLAGS;
4539 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4540 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4541 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4552 * This is really just a quick hack which grabs various garbage
4553 * values. It really should be a real hash algorithm which
4554 * spreads the effect of every input bit onto every output bit,
4555 * if someone who knows about such things would bother to write it.
4556 * Might be a good idea to add that function to CORE as well.
4557 * No numbers below come from careful analysis or anything here,
4558 * except they are primes and SEED_C1 > 1E6 to get a full-width
4559 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4560 * probably be bigger too.
4563 # define SEED_C1 1000003
4564 #define SEED_C4 73819
4566 # define SEED_C1 25747
4567 #define SEED_C4 20639
4571 #define SEED_C5 26107
4573 #ifndef PERL_NO_DEV_RANDOM
4578 # include <starlet.h>
4579 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4580 * in 100-ns units, typically incremented ever 10 ms. */
4581 unsigned int when[2];
4583 # ifdef HAS_GETTIMEOFDAY
4584 struct timeval when;
4590 /* This test is an escape hatch, this symbol isn't set by Configure. */
4591 #ifndef PERL_NO_DEV_RANDOM
4592 #ifndef PERL_RANDOM_DEVICE
4593 /* /dev/random isn't used by default because reads from it will block
4594 * if there isn't enough entropy available. You can compile with
4595 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4596 * is enough real entropy to fill the seed. */
4597 # define PERL_RANDOM_DEVICE "/dev/urandom"
4599 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4601 if (PerlLIO_read(fd, &u, sizeof u) != sizeof u)
4610 _ckvmssts(sys$gettim(when));
4611 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4613 # ifdef HAS_GETTIMEOFDAY
4614 PerlProc_gettimeofday(&when,NULL);
4615 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4618 u = (U32)SEED_C1 * when;
4621 u += SEED_C3 * (U32)PerlProc_getpid();
4622 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4623 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4624 u += SEED_C5 * (U32)PTR2UV(&when);
4630 Perl_get_hash_seed(pTHX)
4632 char *s = PerlEnv_getenv("PERL_HASH_SEED");
4636 while (isSPACE(*s)) s++;
4637 if (s && isDIGIT(*s))
4638 myseed = (UV)Atoul(s);
4640 #ifdef USE_HASH_SEED_EXPLICIT
4644 /* Compute a random seed */
4645 (void)seedDrand01((Rand_seed_t)seed());
4646 myseed = (UV)(Drand01() * (NV)UV_MAX);
4647 #if RANDBITS < (UVSIZE * 8)
4648 /* Since there are not enough randbits to to reach all
4649 * the bits of a UV, the low bits might need extra
4650 * help. Sum in another random number that will
4651 * fill in the low bits. */
4653 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4654 #endif /* RANDBITS < (UVSIZE * 8) */
4655 if (myseed == 0) { /* Superparanoia. */
4656 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4658 Perl_croak(aTHX_ "Your random numbers are not that random");
4661 PL_rehash_seed_set = TRUE;