3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
63 /* Can't use PerlIO to write as it allocates memory */
64 PerlLIO_write(PerlIO_fileno(Perl_error_log),
65 PL_no_mem, strlen(PL_no_mem));
67 NORETURN_FUNCTION_END;
70 /* paranoid version of system's malloc() */
73 Perl_safesysmalloc(MEM_SIZE size)
79 PerlIO_printf(Perl_error_log,
80 "Allocation too large: %lx\n", size) FLUSH;
83 #endif /* HAS_64K_LIMIT */
84 #ifdef PERL_TRACK_MEMPOOL
89 Perl_croak_nocontext("panic: malloc");
91 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
92 PERL_ALLOC_CHECK(ptr);
93 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
95 #ifdef PERL_TRACK_MEMPOOL
96 ((struct perl_memory_debug_header *)ptr)->interpreter = aTHX;
98 ((struct perl_memory_debug_header *)ptr)->size = size;
99 ((struct perl_memory_debug_header *)ptr)->in_use = PERL_POISON_INUSE;
101 ptr = (Malloc_t)((char*)ptr+sTHX);
108 return write_no_mem();
113 /* paranoid version of system's realloc() */
116 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
120 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
121 Malloc_t PerlMem_realloc();
122 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
126 PerlIO_printf(Perl_error_log,
127 "Reallocation too large: %lx\n", size) FLUSH;
130 #endif /* HAS_64K_LIMIT */
137 return safesysmalloc(size);
138 #ifdef PERL_TRACK_MEMPOOL
139 where = (Malloc_t)((char*)where-sTHX);
141 if (((struct perl_memory_debug_header *)where)->interpreter != aTHX) {
142 /* int *nowhere = NULL; *nowhere = 0; */
143 Perl_croak_nocontext("panic: realloc from wrong pool");
146 if (((struct perl_memory_debug_header *)where)->size > size) {
147 const MEM_SIZE freed_up =
148 ((struct perl_memory_debug_header *)where)->size - size;
149 char *start_of_freed = ((char *)where) + size;
150 Poison(start_of_freed, freed_up, char);
152 ((struct perl_memory_debug_header *)where)->size = size;
157 Perl_croak_nocontext("panic: realloc");
159 ptr = (Malloc_t)PerlMem_realloc(where,size);
160 PERL_ALLOC_CHECK(ptr);
162 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
163 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
166 #ifdef PERL_TRACK_MEMPOOL
167 ptr = (Malloc_t)((char*)ptr+sTHX);
174 return write_no_mem();
179 /* safe version of system's free() */
182 Perl_safesysfree(Malloc_t where)
185 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
188 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
190 #ifdef PERL_TRACK_MEMPOOL
191 where = (Malloc_t)((char*)where-sTHX);
192 if (((struct perl_memory_debug_header *)where)->interpreter != aTHX) {
193 /* int *nowhere = NULL; *nowhere = 0; */
194 Perl_croak_nocontext("panic: free from wrong pool");
198 if (((struct perl_memory_debug_header *)where)->in_use
199 == PERL_POISON_FREE) {
200 Perl_croak_nocontext("panic: duplicate free");
202 if (((struct perl_memory_debug_header *)where)->in_use
203 != PERL_POISON_INUSE) {
204 Perl_croak_nocontext("panic: bad free ");
206 ((struct perl_memory_debug_header *)where)->in_use
209 Poison(where, ((struct perl_memory_debug_header *)where)->size, char);
216 /* safe version of system's calloc() */
219 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
225 if (size * count > 0xffff) {
226 PerlIO_printf(Perl_error_log,
227 "Allocation too large: %lx\n", size * count) FLUSH;
230 #endif /* HAS_64K_LIMIT */
232 if ((long)size < 0 || (long)count < 0)
233 Perl_croak_nocontext("panic: calloc");
236 #ifdef PERL_TRACK_MEMPOOL
239 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
240 PERL_ALLOC_CHECK(ptr);
241 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));
243 memset((void*)ptr, 0, size);
244 #ifdef PERL_TRACK_MEMPOOL
245 ((struct perl_memory_debug_header *)ptr)->interpreter = aTHX;
247 ((struct perl_memory_debug_header *)ptr)->size = size;
248 ((struct perl_memory_debug_header *)ptr)->in_use = PERL_POISON_INUSE;
250 ptr = (Malloc_t)((char*)ptr+sTHX);
256 return write_no_mem();
259 /* These must be defined when not using Perl's malloc for binary
264 Malloc_t Perl_malloc (MEM_SIZE nbytes)
267 return (Malloc_t)PerlMem_malloc(nbytes);
270 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
273 return (Malloc_t)PerlMem_calloc(elements, size);
276 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
279 return (Malloc_t)PerlMem_realloc(where, nbytes);
282 Free_t Perl_mfree (Malloc_t where)
290 /* copy a string up to some (non-backslashed) delimiter, if any */
293 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
296 for (tolen = 0; from < fromend; from++, tolen++) {
298 if (from[1] == delim)
307 else if (*from == delim)
318 /* return ptr to little string in big string, NULL if not found */
319 /* This routine was donated by Corey Satten. */
322 Perl_instr(pTHX_ register const char *big, register const char *little)
332 register const char *s, *x;
335 for (x=big,s=little; *s; /**/ ) {
346 return (char*)(big-1);
351 /* same as instr but allow embedded nulls */
354 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
359 char first = *little++;
361 bigend -= lend - little;
363 while (big <= bigend) {
366 for (x=big,s=little; s < lend; x++,s++) {
370 return (char*)(big-1);
376 /* reverse of the above--find last substring */
379 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
381 register const char *bigbeg;
382 register const I32 first = *little;
383 register const char * const littleend = lend;
385 if (little >= littleend)
386 return (char*)bigend;
388 big = bigend - (littleend - little++);
389 while (big >= bigbeg) {
390 register const char *s, *x;
393 for (x=big+2,s=little; s < littleend; /**/ ) {
402 return (char*)(big+1);
407 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
409 /* As a space optimization, we do not compile tables for strings of length
410 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
411 special-cased in fbm_instr().
413 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
416 =head1 Miscellaneous Functions
418 =for apidoc fbm_compile
420 Analyses the string in order to make fast searches on it using fbm_instr()
421 -- the Boyer-Moore algorithm.
427 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
429 register const U8 *s;
435 if (flags & FBMcf_TAIL) {
436 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
437 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
438 if (mg && mg->mg_len >= 0)
441 s = (U8*)SvPV_force_mutable(sv, len);
442 SvUPGRADE(sv, SVt_PVBM);
443 if (len == 0) /* TAIL might be on a zero-length string. */
446 const unsigned char *sb;
447 const U8 mlen = (len>255) ? 255 : (U8)len;
450 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
451 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
452 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
453 memset((void*)table, mlen, 256);
454 table[-1] = (U8)flags;
456 sb = s - mlen + 1; /* first char (maybe) */
458 if (table[*s] == mlen)
463 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
466 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
467 for (i = 0; i < len; i++) {
468 if (PL_freq[s[i]] < frequency) {
470 frequency = PL_freq[s[i]];
473 BmRARE(sv) = s[rarest];
474 BmPREVIOUS(sv) = (U16)rarest;
475 BmUSEFUL(sv) = 100; /* Initial value */
476 if (flags & FBMcf_TAIL)
478 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
479 BmRARE(sv),BmPREVIOUS(sv)));
482 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
483 /* If SvTAIL is actually due to \Z or \z, this gives false positives
487 =for apidoc fbm_instr
489 Returns the location of the SV in the string delimited by C<str> and
490 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
491 does not have to be fbm_compiled, but the search will not be as fast
498 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
500 register unsigned char *s;
502 register const unsigned char *little
503 = (const unsigned char *)SvPV_const(littlestr,l);
504 register STRLEN littlelen = l;
505 register const I32 multiline = flags & FBMrf_MULTILINE;
507 if ((STRLEN)(bigend - big) < littlelen) {
508 if ( SvTAIL(littlestr)
509 && ((STRLEN)(bigend - big) == littlelen - 1)
511 || (*big == *little &&
512 memEQ((char *)big, (char *)little, littlelen - 1))))
517 if (littlelen <= 2) { /* Special-cased */
519 if (littlelen == 1) {
520 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
521 /* Know that bigend != big. */
522 if (bigend[-1] == '\n')
523 return (char *)(bigend - 1);
524 return (char *) bigend;
532 if (SvTAIL(littlestr))
533 return (char *) bigend;
537 return (char*)big; /* Cannot be SvTAIL! */
540 if (SvTAIL(littlestr) && !multiline) {
541 if (bigend[-1] == '\n' && bigend[-2] == *little)
542 return (char*)bigend - 2;
543 if (bigend[-1] == *little)
544 return (char*)bigend - 1;
548 /* This should be better than FBM if c1 == c2, and almost
549 as good otherwise: maybe better since we do less indirection.
550 And we save a lot of memory by caching no table. */
551 const unsigned char c1 = little[0];
552 const unsigned char c2 = little[1];
557 while (s <= bigend) {
567 goto check_1char_anchor;
578 goto check_1char_anchor;
581 while (s <= bigend) {
586 goto check_1char_anchor;
595 check_1char_anchor: /* One char and anchor! */
596 if (SvTAIL(littlestr) && (*bigend == *little))
597 return (char *)bigend; /* bigend is already decremented. */
600 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
601 s = bigend - littlelen;
602 if (s >= big && bigend[-1] == '\n' && *s == *little
603 /* Automatically of length > 2 */
604 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
606 return (char*)s; /* how sweet it is */
609 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
611 return (char*)s + 1; /* how sweet it is */
615 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
616 char * const b = ninstr((char*)big,(char*)bigend,
617 (char*)little, (char*)little + littlelen);
619 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
620 /* Chop \n from littlestr: */
621 s = bigend - littlelen + 1;
623 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
632 { /* Do actual FBM. */
633 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
634 register const unsigned char *oldlittle;
636 if (littlelen > (STRLEN)(bigend - big))
638 --littlelen; /* Last char found by table lookup */
641 little += littlelen; /* last char */
647 if ((tmp = table[*s])) {
648 if ((s += tmp) < bigend)
652 else { /* less expensive than calling strncmp() */
653 register unsigned char * const olds = s;
658 if (*--s == *--little)
660 s = olds + 1; /* here we pay the price for failure */
662 if (s < bigend) /* fake up continue to outer loop */
670 if ( s == bigend && (table[-1] & FBMcf_TAIL)
671 && memEQ((char *)(bigend - littlelen),
672 (char *)(oldlittle - littlelen), littlelen) )
673 return (char*)bigend - littlelen;
678 /* start_shift, end_shift are positive quantities which give offsets
679 of ends of some substring of bigstr.
680 If "last" we want the last occurrence.
681 old_posp is the way of communication between consequent calls if
682 the next call needs to find the .
683 The initial *old_posp should be -1.
685 Note that we take into account SvTAIL, so one can get extra
686 optimizations if _ALL flag is set.
689 /* If SvTAIL is actually due to \Z or \z, this gives false positives
690 if PL_multiline. In fact if !PL_multiline the authoritative answer
691 is not supported yet. */
694 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
696 register const unsigned char *big;
698 register I32 previous;
700 register const unsigned char *little;
701 register I32 stop_pos;
702 register const unsigned char *littleend;
706 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
707 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
709 if ( BmRARE(littlestr) == '\n'
710 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
711 little = (const unsigned char *)(SvPVX_const(littlestr));
712 littleend = little + SvCUR(littlestr);
719 little = (const unsigned char *)(SvPVX_const(littlestr));
720 littleend = little + SvCUR(littlestr);
722 /* The value of pos we can start at: */
723 previous = BmPREVIOUS(littlestr);
724 big = (const unsigned char *)(SvPVX_const(bigstr));
725 /* The value of pos we can stop at: */
726 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
727 if (previous + start_shift > stop_pos) {
729 stop_pos does not include SvTAIL in the count, so this check is incorrect
730 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
733 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
738 while (pos < previous + start_shift) {
739 if (!(pos += PL_screamnext[pos]))
744 register const unsigned char *s, *x;
745 if (pos >= stop_pos) break;
746 if (big[pos] != first)
748 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
754 if (s == littleend) {
756 if (!last) return (char *)(big+pos);
759 } while ( pos += PL_screamnext[pos] );
761 return (char *)(big+(*old_posp));
763 if (!SvTAIL(littlestr) || (end_shift > 0))
765 /* Ignore the trailing "\n". This code is not microoptimized */
766 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
767 stop_pos = littleend - little; /* Actual littlestr len */
772 && ((stop_pos == 1) ||
773 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
779 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
781 register const U8 *a = (const U8 *)s1;
782 register const U8 *b = (const U8 *)s2;
784 if (*a != *b && *a != PL_fold[*b])
792 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
795 register const U8 *a = (const U8 *)s1;
796 register const U8 *b = (const U8 *)s2;
798 if (*a != *b && *a != PL_fold_locale[*b])
805 /* copy a string to a safe spot */
808 =head1 Memory Management
812 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
813 string which is a duplicate of C<pv>. The size of the string is
814 determined by C<strlen()>. The memory allocated for the new string can
815 be freed with the C<Safefree()> function.
821 Perl_savepv(pTHX_ const char *pv)
827 const STRLEN pvlen = strlen(pv)+1;
828 Newx(newaddr,pvlen,char);
829 return memcpy(newaddr,pv,pvlen);
834 /* same thing but with a known length */
839 Perl's version of what C<strndup()> would be if it existed. Returns a
840 pointer to a newly allocated string which is a duplicate of the first
841 C<len> bytes from C<pv>. The memory allocated for the new string can be
842 freed with the C<Safefree()> function.
848 Perl_savepvn(pTHX_ const char *pv, register I32 len)
850 register char *newaddr;
852 Newx(newaddr,len+1,char);
853 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
855 /* might not be null terminated */
857 return (char *) CopyD(pv,newaddr,len,char);
860 return (char *) ZeroD(newaddr,len+1,char);
865 =for apidoc savesharedpv
867 A version of C<savepv()> which allocates the duplicate string in memory
868 which is shared between threads.
873 Perl_savesharedpv(pTHX_ const char *pv)
875 register char *newaddr;
880 pvlen = strlen(pv)+1;
881 newaddr = (char*)PerlMemShared_malloc(pvlen);
883 return write_no_mem();
885 return memcpy(newaddr,pv,pvlen);
891 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
892 the passed in SV using C<SvPV()>
898 Perl_savesvpv(pTHX_ SV *sv)
901 const char * const pv = SvPV_const(sv, len);
902 register char *newaddr;
905 Newx(newaddr,len,char);
906 return (char *) CopyD(pv,newaddr,len,char);
910 /* the SV for Perl_form() and mess() is not kept in an arena */
919 return sv_2mortal(newSVpvn("",0));
924 /* Create as PVMG now, to avoid any upgrading later */
926 Newxz(any, 1, XPVMG);
927 SvFLAGS(sv) = SVt_PVMG;
928 SvANY(sv) = (void*)any;
930 SvREFCNT(sv) = 1 << 30; /* practically infinite */
935 #if defined(PERL_IMPLICIT_CONTEXT)
937 Perl_form_nocontext(const char* pat, ...)
943 retval = vform(pat, &args);
947 #endif /* PERL_IMPLICIT_CONTEXT */
950 =head1 Miscellaneous Functions
953 Takes a sprintf-style format pattern and conventional
954 (non-SV) arguments and returns the formatted string.
956 (char *) Perl_form(pTHX_ const char* pat, ...)
958 can be used any place a string (char *) is required:
960 char * s = Perl_form("%d.%d",major,minor);
962 Uses a single private buffer so if you want to format several strings you
963 must explicitly copy the earlier strings away (and free the copies when you
970 Perl_form(pTHX_ const char* pat, ...)
975 retval = vform(pat, &args);
981 Perl_vform(pTHX_ const char *pat, va_list *args)
983 SV * const sv = mess_alloc();
984 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
988 #if defined(PERL_IMPLICIT_CONTEXT)
990 Perl_mess_nocontext(const char *pat, ...)
996 retval = vmess(pat, &args);
1000 #endif /* PERL_IMPLICIT_CONTEXT */
1003 Perl_mess(pTHX_ const char *pat, ...)
1007 va_start(args, pat);
1008 retval = vmess(pat, &args);
1014 S_closest_cop(pTHX_ COP *cop, const OP *o)
1016 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1018 if (!o || o == PL_op)
1021 if (o->op_flags & OPf_KIDS) {
1023 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1026 /* If the OP_NEXTSTATE has been optimised away we can still use it
1027 * the get the file and line number. */
1029 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1032 /* Keep searching, and return when we've found something. */
1034 new_cop = closest_cop(cop, kid);
1040 /* Nothing found. */
1046 Perl_vmess(pTHX_ const char *pat, va_list *args)
1048 SV * const sv = mess_alloc();
1049 static const char dgd[] = " during global destruction.\n";
1051 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1052 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1055 * Try and find the file and line for PL_op. This will usually be
1056 * PL_curcop, but it might be a cop that has been optimised away. We
1057 * can try to find such a cop by searching through the optree starting
1058 * from the sibling of PL_curcop.
1061 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1062 if (!cop) cop = PL_curcop;
1065 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1066 OutCopFILE(cop), (IV)CopLINE(cop));
1067 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1068 const bool line_mode = (RsSIMPLE(PL_rs) &&
1069 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1070 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1071 PL_last_in_gv == PL_argvgv ?
1072 "" : GvNAME(PL_last_in_gv),
1073 line_mode ? "line" : "chunk",
1074 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1076 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1082 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1088 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1089 && (io = GvIO(PL_stderrgv))
1090 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1097 SAVESPTR(PL_stderrgv);
1098 PL_stderrgv = Nullgv;
1100 PUSHSTACKi(PERLSI_MAGIC);
1104 PUSHs(SvTIED_obj((SV*)io, mg));
1105 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1107 call_method("PRINT", G_SCALAR);
1115 /* SFIO can really mess with your errno */
1116 const int e = errno;
1118 PerlIO * const serr = Perl_error_log;
1120 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1121 (void)PerlIO_flush(serr);
1128 /* Common code used by vcroak, vdie and vwarner */
1131 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1136 /* sv_2cv might call Perl_croak() */
1137 SV * const olddiehook = PL_diehook;
1141 SAVESPTR(PL_diehook);
1142 PL_diehook = Nullsv;
1143 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1145 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1152 msg = newSVpvn(message, msglen);
1153 SvFLAGS(msg) |= utf8;
1161 PUSHSTACKi(PERLSI_DIEHOOK);
1165 call_sv((SV*)cv, G_DISCARD);
1172 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1176 const char *message;
1179 SV * const msv = vmess(pat, args);
1180 if (PL_errors && SvCUR(PL_errors)) {
1181 sv_catsv(PL_errors, msv);
1182 message = SvPV_const(PL_errors, *msglen);
1183 SvCUR_set(PL_errors, 0);
1186 message = SvPV_const(msv,*msglen);
1187 *utf8 = SvUTF8(msv);
1193 DEBUG_S(PerlIO_printf(Perl_debug_log,
1194 "%p: die/croak: message = %s\ndiehook = %p\n",
1195 thr, message, PL_diehook));
1197 S_vdie_common(aTHX_ message, *msglen, *utf8);
1203 Perl_vdie(pTHX_ const char* pat, va_list *args)
1205 const char *message;
1206 const int was_in_eval = PL_in_eval;
1210 DEBUG_S(PerlIO_printf(Perl_debug_log,
1211 "%p: die: curstack = %p, mainstack = %p\n",
1212 thr, PL_curstack, PL_mainstack));
1214 message = vdie_croak_common(pat, args, &msglen, &utf8);
1216 PL_restartop = die_where(message, msglen);
1217 SvFLAGS(ERRSV) |= utf8;
1218 DEBUG_S(PerlIO_printf(Perl_debug_log,
1219 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1220 thr, PL_restartop, was_in_eval, PL_top_env));
1221 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1223 return PL_restartop;
1226 #if defined(PERL_IMPLICIT_CONTEXT)
1228 Perl_die_nocontext(const char* pat, ...)
1233 va_start(args, pat);
1234 o = vdie(pat, &args);
1238 #endif /* PERL_IMPLICIT_CONTEXT */
1241 Perl_die(pTHX_ const char* pat, ...)
1245 va_start(args, pat);
1246 o = vdie(pat, &args);
1252 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1254 const char *message;
1258 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1261 PL_restartop = die_where(message, msglen);
1262 SvFLAGS(ERRSV) |= utf8;
1266 message = SvPVx_const(ERRSV, msglen);
1268 write_to_stderr(message, msglen);
1272 #if defined(PERL_IMPLICIT_CONTEXT)
1274 Perl_croak_nocontext(const char *pat, ...)
1278 va_start(args, pat);
1283 #endif /* PERL_IMPLICIT_CONTEXT */
1286 =head1 Warning and Dieing
1290 This is the XSUB-writer's interface to Perl's C<die> function.
1291 Normally call this function the same way you call the C C<printf>
1292 function. Calling C<croak> returns control directly to Perl,
1293 sidestepping the normal C order of execution. See C<warn>.
1295 If you want to throw an exception object, assign the object to
1296 C<$@> and then pass C<Nullch> to croak():
1298 errsv = get_sv("@", TRUE);
1299 sv_setsv(errsv, exception_object);
1306 Perl_croak(pTHX_ const char *pat, ...)
1309 va_start(args, pat);
1316 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1320 SV * const msv = vmess(pat, args);
1321 const I32 utf8 = SvUTF8(msv);
1322 const char * const message = SvPV_const(msv, msglen);
1325 /* sv_2cv might call Perl_warn() */
1326 SV * const oldwarnhook = PL_warnhook;
1332 SAVESPTR(PL_warnhook);
1333 PL_warnhook = Nullsv;
1334 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1336 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1341 SAVESPTR(PL_warnhook);
1342 PL_warnhook = Nullsv;
1344 msg = newSVpvn(message, msglen);
1345 SvFLAGS(msg) |= utf8;
1349 PUSHSTACKi(PERLSI_WARNHOOK);
1353 call_sv((SV*)cv, G_DISCARD);
1360 write_to_stderr(message, msglen);
1363 #if defined(PERL_IMPLICIT_CONTEXT)
1365 Perl_warn_nocontext(const char *pat, ...)
1369 va_start(args, pat);
1373 #endif /* PERL_IMPLICIT_CONTEXT */
1378 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1379 function the same way you call the C C<printf> function. See C<croak>.
1385 Perl_warn(pTHX_ const char *pat, ...)
1388 va_start(args, pat);
1393 #if defined(PERL_IMPLICIT_CONTEXT)
1395 Perl_warner_nocontext(U32 err, const char *pat, ...)
1399 va_start(args, pat);
1400 vwarner(err, pat, &args);
1403 #endif /* PERL_IMPLICIT_CONTEXT */
1406 Perl_warner(pTHX_ U32 err, const char* pat,...)
1409 va_start(args, pat);
1410 vwarner(err, pat, &args);
1415 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1419 SV * const msv = vmess(pat, args);
1421 const char * const message = SvPV_const(msv, msglen);
1422 const I32 utf8 = SvUTF8(msv);
1426 S_vdie_common(aTHX_ message, msglen, utf8);
1429 PL_restartop = die_where(message, msglen);
1430 SvFLAGS(ERRSV) |= utf8;
1433 write_to_stderr(message, msglen);
1437 Perl_vwarn(aTHX_ pat, args);
1441 /* implements the ckWARN? macros */
1444 Perl_ckwarn(pTHX_ U32 w)
1449 && PL_curcop->cop_warnings != pWARN_NONE
1451 PL_curcop->cop_warnings == pWARN_ALL
1452 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1453 || (unpackWARN2(w) &&
1454 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1455 || (unpackWARN3(w) &&
1456 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1457 || (unpackWARN4(w) &&
1458 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1463 isLEXWARN_off && PL_dowarn & G_WARN_ON
1468 /* implements the ckWARN?_d macro */
1471 Perl_ckwarn_d(pTHX_ U32 w)
1475 || PL_curcop->cop_warnings == pWARN_ALL
1477 PL_curcop->cop_warnings != pWARN_NONE
1479 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1480 || (unpackWARN2(w) &&
1481 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1482 || (unpackWARN3(w) &&
1483 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1484 || (unpackWARN4(w) &&
1485 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1493 /* since we've already done strlen() for both nam and val
1494 * we can use that info to make things faster than
1495 * sprintf(s, "%s=%s", nam, val)
1497 #define my_setenv_format(s, nam, nlen, val, vlen) \
1498 Copy(nam, s, nlen, char); \
1500 Copy(val, s+(nlen+1), vlen, char); \
1501 *(s+(nlen+1+vlen)) = '\0'
1503 #ifdef USE_ENVIRON_ARRAY
1504 /* VMS' my_setenv() is in vms.c */
1505 #if !defined(WIN32) && !defined(NETWARE)
1507 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1511 /* only parent thread can modify process environment */
1512 if (PL_curinterp == aTHX)
1515 #ifndef PERL_USE_SAFE_PUTENV
1516 if (!PL_use_safe_putenv) {
1517 /* most putenv()s leak, so we manipulate environ directly */
1518 register I32 i=setenv_getix(nam); /* where does it go? */
1521 if (environ == PL_origenviron) { /* need we copy environment? */
1526 for (max = i; environ[max]; max++) ;
1527 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1528 for (j=0; j<max; j++) { /* copy environment */
1529 const int len = strlen(environ[j]);
1530 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1531 Copy(environ[j], tmpenv[j], len+1, char);
1533 tmpenv[max] = Nullch;
1534 environ = tmpenv; /* tell exec where it is now */
1537 safesysfree(environ[i]);
1538 while (environ[i]) {
1539 environ[i] = environ[i+1];
1544 if (!environ[i]) { /* does not exist yet */
1545 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1546 environ[i+1] = Nullch; /* make sure it's null terminated */
1549 safesysfree(environ[i]);
1553 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1554 /* all that work just for this */
1555 my_setenv_format(environ[i], nam, nlen, val, vlen);
1558 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__)
1559 # if defined(HAS_UNSETENV)
1561 (void)unsetenv(nam);
1563 (void)setenv(nam, val, 1);
1565 # else /* ! HAS_UNSETENV */
1566 (void)setenv(nam, val, 1);
1567 # endif /* HAS_UNSETENV */
1569 # if defined(HAS_UNSETENV)
1571 (void)unsetenv(nam);
1573 const int nlen = strlen(nam);
1574 const int vlen = strlen(val);
1575 char * const new_env =
1576 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1577 my_setenv_format(new_env, nam, nlen, val, vlen);
1578 (void)putenv(new_env);
1580 # else /* ! HAS_UNSETENV */
1582 const int nlen = strlen(nam);
1588 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1589 /* all that work just for this */
1590 my_setenv_format(new_env, nam, nlen, val, vlen);
1591 (void)putenv(new_env);
1592 # endif /* HAS_UNSETENV */
1593 # endif /* __CYGWIN__ */
1594 #ifndef PERL_USE_SAFE_PUTENV
1600 #else /* WIN32 || NETWARE */
1603 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1606 register char *envstr;
1607 const int nlen = strlen(nam);
1614 Newx(envstr, nlen+vlen+2, char);
1615 my_setenv_format(envstr, nam, nlen, val, vlen);
1616 (void)PerlEnv_putenv(envstr);
1620 #endif /* WIN32 || NETWARE */
1624 Perl_setenv_getix(pTHX_ const char *nam)
1627 register const I32 len = strlen(nam);
1629 for (i = 0; environ[i]; i++) {
1632 strnicmp(environ[i],nam,len) == 0
1634 strnEQ(environ[i],nam,len)
1636 && environ[i][len] == '=')
1637 break; /* strnEQ must come first to avoid */
1638 } /* potential SEGV's */
1641 #endif /* !PERL_MICRO */
1643 #endif /* !VMS && !EPOC*/
1645 #ifdef UNLINK_ALL_VERSIONS
1647 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1651 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1656 /* this is a drop-in replacement for bcopy() */
1657 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1659 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1661 char * const retval = to;
1663 if (from - to >= 0) {
1671 *(--to) = *(--from);
1677 /* this is a drop-in replacement for memset() */
1680 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1682 char * const retval = loc;
1690 /* this is a drop-in replacement for bzero() */
1691 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1693 Perl_my_bzero(register char *loc, register I32 len)
1695 char * const retval = loc;
1703 /* this is a drop-in replacement for memcmp() */
1704 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1706 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1708 register const U8 *a = (const U8 *)s1;
1709 register const U8 *b = (const U8 *)s2;
1713 if ((tmp = *a++ - *b++))
1718 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1722 #ifdef USE_CHAR_VSPRINTF
1727 vsprintf(char *dest, const char *pat, char *args)
1731 fakebuf._ptr = dest;
1732 fakebuf._cnt = 32767;
1736 fakebuf._flag = _IOWRT|_IOSTRG;
1737 _doprnt(pat, args, &fakebuf); /* what a kludge */
1738 (void)putc('\0', &fakebuf);
1739 #ifdef USE_CHAR_VSPRINTF
1742 return 0; /* perl doesn't use return value */
1746 #endif /* HAS_VPRINTF */
1749 #if BYTEORDER != 0x4321
1751 Perl_my_swap(pTHX_ short s)
1753 #if (BYTEORDER & 1) == 0
1756 result = ((s & 255) << 8) + ((s >> 8) & 255);
1764 Perl_my_htonl(pTHX_ long l)
1768 char c[sizeof(long)];
1771 #if BYTEORDER == 0x1234
1772 u.c[0] = (l >> 24) & 255;
1773 u.c[1] = (l >> 16) & 255;
1774 u.c[2] = (l >> 8) & 255;
1778 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1779 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1784 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1785 u.c[o & 0xf] = (l >> s) & 255;
1793 Perl_my_ntohl(pTHX_ long l)
1797 char c[sizeof(long)];
1800 #if BYTEORDER == 0x1234
1801 u.c[0] = (l >> 24) & 255;
1802 u.c[1] = (l >> 16) & 255;
1803 u.c[2] = (l >> 8) & 255;
1807 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1808 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1815 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1816 l |= (u.c[o & 0xf] & 255) << s;
1823 #endif /* BYTEORDER != 0x4321 */
1827 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1828 * If these functions are defined,
1829 * the BYTEORDER is neither 0x1234 nor 0x4321.
1830 * However, this is not assumed.
1834 #define HTOLE(name,type) \
1836 name (register type n) \
1840 char c[sizeof(type)]; \
1843 register I32 s = 0; \
1844 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1845 u.c[i] = (n >> s) & 0xFF; \
1850 #define LETOH(name,type) \
1852 name (register type n) \
1856 char c[sizeof(type)]; \
1859 register I32 s = 0; \
1862 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1863 n |= ((type)(u.c[i] & 0xFF)) << s; \
1869 * Big-endian byte order functions.
1872 #define HTOBE(name,type) \
1874 name (register type n) \
1878 char c[sizeof(type)]; \
1881 register I32 s = 8*(sizeof(u.c)-1); \
1882 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1883 u.c[i] = (n >> s) & 0xFF; \
1888 #define BETOH(name,type) \
1890 name (register type n) \
1894 char c[sizeof(type)]; \
1897 register I32 s = 8*(sizeof(u.c)-1); \
1900 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1901 n |= ((type)(u.c[i] & 0xFF)) << s; \
1907 * If we just can't do it...
1910 #define NOT_AVAIL(name,type) \
1912 name (register type n) \
1914 Perl_croak_nocontext(#name "() not available"); \
1915 return n; /* not reached */ \
1919 #if defined(HAS_HTOVS) && !defined(htovs)
1922 #if defined(HAS_HTOVL) && !defined(htovl)
1925 #if defined(HAS_VTOHS) && !defined(vtohs)
1928 #if defined(HAS_VTOHL) && !defined(vtohl)
1932 #ifdef PERL_NEED_MY_HTOLE16
1934 HTOLE(Perl_my_htole16,U16)
1936 NOT_AVAIL(Perl_my_htole16,U16)
1939 #ifdef PERL_NEED_MY_LETOH16
1941 LETOH(Perl_my_letoh16,U16)
1943 NOT_AVAIL(Perl_my_letoh16,U16)
1946 #ifdef PERL_NEED_MY_HTOBE16
1948 HTOBE(Perl_my_htobe16,U16)
1950 NOT_AVAIL(Perl_my_htobe16,U16)
1953 #ifdef PERL_NEED_MY_BETOH16
1955 BETOH(Perl_my_betoh16,U16)
1957 NOT_AVAIL(Perl_my_betoh16,U16)
1961 #ifdef PERL_NEED_MY_HTOLE32
1963 HTOLE(Perl_my_htole32,U32)
1965 NOT_AVAIL(Perl_my_htole32,U32)
1968 #ifdef PERL_NEED_MY_LETOH32
1970 LETOH(Perl_my_letoh32,U32)
1972 NOT_AVAIL(Perl_my_letoh32,U32)
1975 #ifdef PERL_NEED_MY_HTOBE32
1977 HTOBE(Perl_my_htobe32,U32)
1979 NOT_AVAIL(Perl_my_htobe32,U32)
1982 #ifdef PERL_NEED_MY_BETOH32
1984 BETOH(Perl_my_betoh32,U32)
1986 NOT_AVAIL(Perl_my_betoh32,U32)
1990 #ifdef PERL_NEED_MY_HTOLE64
1992 HTOLE(Perl_my_htole64,U64)
1994 NOT_AVAIL(Perl_my_htole64,U64)
1997 #ifdef PERL_NEED_MY_LETOH64
1999 LETOH(Perl_my_letoh64,U64)
2001 NOT_AVAIL(Perl_my_letoh64,U64)
2004 #ifdef PERL_NEED_MY_HTOBE64
2006 HTOBE(Perl_my_htobe64,U64)
2008 NOT_AVAIL(Perl_my_htobe64,U64)
2011 #ifdef PERL_NEED_MY_BETOH64
2013 BETOH(Perl_my_betoh64,U64)
2015 NOT_AVAIL(Perl_my_betoh64,U64)
2019 #ifdef PERL_NEED_MY_HTOLES
2020 HTOLE(Perl_my_htoles,short)
2022 #ifdef PERL_NEED_MY_LETOHS
2023 LETOH(Perl_my_letohs,short)
2025 #ifdef PERL_NEED_MY_HTOBES
2026 HTOBE(Perl_my_htobes,short)
2028 #ifdef PERL_NEED_MY_BETOHS
2029 BETOH(Perl_my_betohs,short)
2032 #ifdef PERL_NEED_MY_HTOLEI
2033 HTOLE(Perl_my_htolei,int)
2035 #ifdef PERL_NEED_MY_LETOHI
2036 LETOH(Perl_my_letohi,int)
2038 #ifdef PERL_NEED_MY_HTOBEI
2039 HTOBE(Perl_my_htobei,int)
2041 #ifdef PERL_NEED_MY_BETOHI
2042 BETOH(Perl_my_betohi,int)
2045 #ifdef PERL_NEED_MY_HTOLEL
2046 HTOLE(Perl_my_htolel,long)
2048 #ifdef PERL_NEED_MY_LETOHL
2049 LETOH(Perl_my_letohl,long)
2051 #ifdef PERL_NEED_MY_HTOBEL
2052 HTOBE(Perl_my_htobel,long)
2054 #ifdef PERL_NEED_MY_BETOHL
2055 BETOH(Perl_my_betohl,long)
2059 Perl_my_swabn(void *ptr, int n)
2061 register char *s = (char *)ptr;
2062 register char *e = s + (n-1);
2065 for (n /= 2; n > 0; s++, e--, n--) {
2073 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2075 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2077 register I32 This, that;
2083 PERL_FLUSHALL_FOR_CHILD;
2084 This = (*mode == 'w');
2088 taint_proper("Insecure %s%s", "EXEC");
2090 if (PerlProc_pipe(p) < 0)
2092 /* Try for another pipe pair for error return */
2093 if (PerlProc_pipe(pp) >= 0)
2095 while ((pid = PerlProc_fork()) < 0) {
2096 if (errno != EAGAIN) {
2097 PerlLIO_close(p[This]);
2098 PerlLIO_close(p[that]);
2100 PerlLIO_close(pp[0]);
2101 PerlLIO_close(pp[1]);
2113 /* Close parent's end of error status pipe (if any) */
2115 PerlLIO_close(pp[0]);
2116 #if defined(HAS_FCNTL) && defined(F_SETFD)
2117 /* Close error pipe automatically if exec works */
2118 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2121 /* Now dup our end of _the_ pipe to right position */
2122 if (p[THIS] != (*mode == 'r')) {
2123 PerlLIO_dup2(p[THIS], *mode == 'r');
2124 PerlLIO_close(p[THIS]);
2125 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2126 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2129 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2130 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2131 /* No automatic close - do it by hand */
2138 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2144 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2150 do_execfree(); /* free any memory malloced by child on fork */
2152 PerlLIO_close(pp[1]);
2153 /* Keep the lower of the two fd numbers */
2154 if (p[that] < p[This]) {
2155 PerlLIO_dup2(p[This], p[that]);
2156 PerlLIO_close(p[This]);
2160 PerlLIO_close(p[that]); /* close child's end of pipe */
2163 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2165 SvUPGRADE(sv,SVt_IV);
2167 PL_forkprocess = pid;
2168 /* If we managed to get status pipe check for exec fail */
2169 if (did_pipes && pid > 0) {
2173 while (n < sizeof(int)) {
2174 n1 = PerlLIO_read(pp[0],
2175 (void*)(((char*)&errkid)+n),
2181 PerlLIO_close(pp[0]);
2183 if (n) { /* Error */
2185 PerlLIO_close(p[This]);
2186 if (n != sizeof(int))
2187 Perl_croak(aTHX_ "panic: kid popen errno read");
2189 pid2 = wait4pid(pid, &status, 0);
2190 } while (pid2 == -1 && errno == EINTR);
2191 errno = errkid; /* Propagate errno from kid */
2196 PerlLIO_close(pp[0]);
2197 return PerlIO_fdopen(p[This], mode);
2199 Perl_croak(aTHX_ "List form of piped open not implemented");
2200 return (PerlIO *) NULL;
2204 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2205 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2207 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2210 register I32 This, that;
2213 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2217 PERL_FLUSHALL_FOR_CHILD;
2220 return my_syspopen(aTHX_ cmd,mode);
2223 This = (*mode == 'w');
2225 if (doexec && PL_tainting) {
2227 taint_proper("Insecure %s%s", "EXEC");
2229 if (PerlProc_pipe(p) < 0)
2231 if (doexec && PerlProc_pipe(pp) >= 0)
2233 while ((pid = PerlProc_fork()) < 0) {
2234 if (errno != EAGAIN) {
2235 PerlLIO_close(p[This]);
2236 PerlLIO_close(p[that]);
2238 PerlLIO_close(pp[0]);
2239 PerlLIO_close(pp[1]);
2242 Perl_croak(aTHX_ "Can't fork");
2255 PerlLIO_close(pp[0]);
2256 #if defined(HAS_FCNTL) && defined(F_SETFD)
2257 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2260 if (p[THIS] != (*mode == 'r')) {
2261 PerlLIO_dup2(p[THIS], *mode == 'r');
2262 PerlLIO_close(p[THIS]);
2263 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2264 PerlLIO_close(p[THAT]);
2267 PerlLIO_close(p[THAT]);
2270 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2277 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2282 /* may or may not use the shell */
2283 do_exec3(cmd, pp[1], did_pipes);
2286 #endif /* defined OS2 */
2287 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2288 SvREADONLY_off(GvSV(tmpgv));
2289 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2290 SvREADONLY_on(GvSV(tmpgv));
2292 #ifdef THREADS_HAVE_PIDS
2293 PL_ppid = (IV)getppid();
2296 #ifdef PERL_USES_PL_PIDSTATUS
2297 hv_clear(PL_pidstatus); /* we have no children */
2303 do_execfree(); /* free any memory malloced by child on vfork */
2305 PerlLIO_close(pp[1]);
2306 if (p[that] < p[This]) {
2307 PerlLIO_dup2(p[This], p[that]);
2308 PerlLIO_close(p[This]);
2312 PerlLIO_close(p[that]);
2315 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2317 SvUPGRADE(sv,SVt_IV);
2319 PL_forkprocess = pid;
2320 if (did_pipes && pid > 0) {
2324 while (n < sizeof(int)) {
2325 n1 = PerlLIO_read(pp[0],
2326 (void*)(((char*)&errkid)+n),
2332 PerlLIO_close(pp[0]);
2334 if (n) { /* Error */
2336 PerlLIO_close(p[This]);
2337 if (n != sizeof(int))
2338 Perl_croak(aTHX_ "panic: kid popen errno read");
2340 pid2 = wait4pid(pid, &status, 0);
2341 } while (pid2 == -1 && errno == EINTR);
2342 errno = errkid; /* Propagate errno from kid */
2347 PerlLIO_close(pp[0]);
2348 return PerlIO_fdopen(p[This], mode);
2351 #if defined(atarist) || defined(EPOC)
2354 Perl_my_popen(pTHX_ char *cmd, char *mode)
2356 PERL_FLUSHALL_FOR_CHILD;
2357 /* Call system's popen() to get a FILE *, then import it.
2358 used 0 for 2nd parameter to PerlIO_importFILE;
2361 return PerlIO_importFILE(popen(cmd, mode), 0);
2365 FILE *djgpp_popen();
2367 Perl_my_popen(pTHX_ char *cmd, char *mode)
2369 PERL_FLUSHALL_FOR_CHILD;
2370 /* Call system's popen() to get a FILE *, then import it.
2371 used 0 for 2nd parameter to PerlIO_importFILE;
2374 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2379 #endif /* !DOSISH */
2381 /* this is called in parent before the fork() */
2383 Perl_atfork_lock(void)
2386 #if defined(USE_ITHREADS)
2387 /* locks must be held in locking order (if any) */
2389 MUTEX_LOCK(&PL_malloc_mutex);
2395 /* this is called in both parent and child after the fork() */
2397 Perl_atfork_unlock(void)
2400 #if defined(USE_ITHREADS)
2401 /* locks must be released in same order as in atfork_lock() */
2403 MUTEX_UNLOCK(&PL_malloc_mutex);
2412 #if defined(HAS_FORK)
2414 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2419 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2420 * handlers elsewhere in the code */
2425 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2426 Perl_croak_nocontext("fork() not available");
2428 #endif /* HAS_FORK */
2433 Perl_dump_fds(pTHX_ char *s)
2438 PerlIO_printf(Perl_debug_log,"%s", s);
2439 for (fd = 0; fd < 32; fd++) {
2440 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2441 PerlIO_printf(Perl_debug_log," %d",fd);
2443 PerlIO_printf(Perl_debug_log,"\n");
2446 #endif /* DUMP_FDS */
2450 dup2(int oldfd, int newfd)
2452 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2455 PerlLIO_close(newfd);
2456 return fcntl(oldfd, F_DUPFD, newfd);
2458 #define DUP2_MAX_FDS 256
2459 int fdtmp[DUP2_MAX_FDS];
2465 PerlLIO_close(newfd);
2466 /* good enough for low fd's... */
2467 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2468 if (fdx >= DUP2_MAX_FDS) {
2476 PerlLIO_close(fdtmp[--fdx]);
2483 #ifdef HAS_SIGACTION
2485 #ifdef MACOS_TRADITIONAL
2486 /* We don't want restart behavior on MacOS */
2491 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2494 struct sigaction act, oact;
2497 /* only "parent" interpreter can diddle signals */
2498 if (PL_curinterp != aTHX)
2499 return (Sighandler_t) SIG_ERR;
2502 act.sa_handler = (void(*)(int))handler;
2503 sigemptyset(&act.sa_mask);
2506 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2507 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2509 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2510 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2511 act.sa_flags |= SA_NOCLDWAIT;
2513 if (sigaction(signo, &act, &oact) == -1)
2514 return (Sighandler_t) SIG_ERR;
2516 return (Sighandler_t) oact.sa_handler;
2520 Perl_rsignal_state(pTHX_ int signo)
2522 struct sigaction oact;
2524 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2525 return (Sighandler_t) SIG_ERR;
2527 return (Sighandler_t) oact.sa_handler;
2531 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2534 struct sigaction act;
2537 /* only "parent" interpreter can diddle signals */
2538 if (PL_curinterp != aTHX)
2542 act.sa_handler = (void(*)(int))handler;
2543 sigemptyset(&act.sa_mask);
2546 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2547 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2549 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2550 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2551 act.sa_flags |= SA_NOCLDWAIT;
2553 return sigaction(signo, &act, save);
2557 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2561 /* only "parent" interpreter can diddle signals */
2562 if (PL_curinterp != aTHX)
2566 return sigaction(signo, save, (struct sigaction *)NULL);
2569 #else /* !HAS_SIGACTION */
2572 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2574 #if defined(USE_ITHREADS) && !defined(WIN32)
2575 /* only "parent" interpreter can diddle signals */
2576 if (PL_curinterp != aTHX)
2577 return (Sighandler_t) SIG_ERR;
2580 return PerlProc_signal(signo, handler);
2591 Perl_rsignal_state(pTHX_ int signo)
2594 Sighandler_t oldsig;
2596 #if defined(USE_ITHREADS) && !defined(WIN32)
2597 /* only "parent" interpreter can diddle signals */
2598 if (PL_curinterp != aTHX)
2599 return (Sighandler_t) SIG_ERR;
2603 oldsig = PerlProc_signal(signo, sig_trap);
2604 PerlProc_signal(signo, oldsig);
2606 PerlProc_kill(PerlProc_getpid(), signo);
2611 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2613 #if defined(USE_ITHREADS) && !defined(WIN32)
2614 /* only "parent" interpreter can diddle signals */
2615 if (PL_curinterp != aTHX)
2618 *save = PerlProc_signal(signo, handler);
2619 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2623 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2625 #if defined(USE_ITHREADS) && !defined(WIN32)
2626 /* only "parent" interpreter can diddle signals */
2627 if (PL_curinterp != aTHX)
2630 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2633 #endif /* !HAS_SIGACTION */
2634 #endif /* !PERL_MICRO */
2636 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2637 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2639 Perl_my_pclose(pTHX_ PerlIO *ptr)
2641 Sigsave_t hstat, istat, qstat;
2647 int saved_errno = 0;
2649 int saved_win32_errno;
2653 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2655 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2657 *svp = &PL_sv_undef;
2659 if (pid == -1) { /* Opened by popen. */
2660 return my_syspclose(ptr);
2663 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2664 saved_errno = errno;
2666 saved_win32_errno = GetLastError();
2670 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2673 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2674 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2675 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2678 pid2 = wait4pid(pid, &status, 0);
2679 } while (pid2 == -1 && errno == EINTR);
2681 rsignal_restore(SIGHUP, &hstat);
2682 rsignal_restore(SIGINT, &istat);
2683 rsignal_restore(SIGQUIT, &qstat);
2686 SETERRNO(saved_errno, 0);
2689 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2691 #endif /* !DOSISH */
2693 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2695 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2700 #ifdef PERL_USES_PL_PIDSTATUS
2703 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2704 pid, rather than a string form. */
2705 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2706 if (svp && *svp != &PL_sv_undef) {
2707 *statusp = SvIVX(*svp);
2708 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2716 hv_iterinit(PL_pidstatus);
2717 if ((entry = hv_iternext(PL_pidstatus))) {
2718 SV * const sv = hv_iterval(PL_pidstatus,entry);
2720 const char * const spid = hv_iterkey(entry,&len);
2722 assert (len == sizeof(Pid_t));
2723 memcpy((char *)&pid, spid, len);
2724 *statusp = SvIVX(sv);
2725 /* The hash iterator is currently on this entry, so simply
2726 calling hv_delete would trigger the lazy delete, which on
2727 aggregate does more work, beacuse next call to hv_iterinit()
2728 would spot the flag, and have to call the delete routine,
2729 while in the meantime any new entries can't re-use that
2731 hv_iterinit(PL_pidstatus);
2732 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2739 # ifdef HAS_WAITPID_RUNTIME
2740 if (!HAS_WAITPID_RUNTIME)
2743 result = PerlProc_waitpid(pid,statusp,flags);
2746 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2747 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2750 #ifdef PERL_USES_PL_PIDSTATUS
2751 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2756 Perl_croak(aTHX_ "Can't do waitpid with flags");
2758 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2759 pidgone(result,*statusp);
2765 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2768 if (result < 0 && errno == EINTR) {
2773 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2775 #ifdef PERL_USES_PL_PIDSTATUS
2777 Perl_pidgone(pTHX_ Pid_t pid, int status)
2781 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2782 SvUPGRADE(sv,SVt_IV);
2783 SvIV_set(sv, status);
2788 #if defined(atarist) || defined(OS2) || defined(EPOC)
2791 int /* Cannot prototype with I32
2793 my_syspclose(PerlIO *ptr)
2796 Perl_my_pclose(pTHX_ PerlIO *ptr)
2799 /* Needs work for PerlIO ! */
2800 FILE * const f = PerlIO_findFILE(ptr);
2801 const I32 result = pclose(f);
2802 PerlIO_releaseFILE(ptr,f);
2810 Perl_my_pclose(pTHX_ PerlIO *ptr)
2812 /* Needs work for PerlIO ! */
2813 FILE * const f = PerlIO_findFILE(ptr);
2814 I32 result = djgpp_pclose(f);
2815 result = (result << 8) & 0xff00;
2816 PerlIO_releaseFILE(ptr,f);
2822 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2825 register const char * const frombase = from;
2828 register const char c = *from;
2833 while (count-- > 0) {
2834 for (todo = len; todo > 0; todo--) {
2843 Perl_same_dirent(pTHX_ const char *a, const char *b)
2845 char *fa = strrchr(a,'/');
2846 char *fb = strrchr(b,'/');
2849 SV * const tmpsv = sv_newmortal();
2862 sv_setpvn(tmpsv, ".", 1);
2864 sv_setpvn(tmpsv, a, fa - a);
2865 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2868 sv_setpvn(tmpsv, ".", 1);
2870 sv_setpvn(tmpsv, b, fb - b);
2871 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2873 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2874 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2876 #endif /* !HAS_RENAME */
2879 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2880 const char *const *const search_ext, I32 flags)
2882 const char *xfound = Nullch;
2883 char *xfailed = Nullch;
2884 char tmpbuf[MAXPATHLEN];
2888 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2889 # define SEARCH_EXTS ".bat", ".cmd", NULL
2890 # define MAX_EXT_LEN 4
2893 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2894 # define MAX_EXT_LEN 4
2897 # define SEARCH_EXTS ".pl", ".com", NULL
2898 # define MAX_EXT_LEN 4
2900 /* additional extensions to try in each dir if scriptname not found */
2902 static const char *const exts[] = { SEARCH_EXTS };
2903 const char *const *const ext = search_ext ? search_ext : exts;
2904 int extidx = 0, i = 0;
2905 const char *curext = Nullch;
2907 PERL_UNUSED_ARG(search_ext);
2908 # define MAX_EXT_LEN 0
2912 * If dosearch is true and if scriptname does not contain path
2913 * delimiters, search the PATH for scriptname.
2915 * If SEARCH_EXTS is also defined, will look for each
2916 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2917 * while searching the PATH.
2919 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2920 * proceeds as follows:
2921 * If DOSISH or VMSISH:
2922 * + look for ./scriptname{,.foo,.bar}
2923 * + search the PATH for scriptname{,.foo,.bar}
2926 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2927 * this will not look in '.' if it's not in the PATH)
2932 # ifdef ALWAYS_DEFTYPES
2933 len = strlen(scriptname);
2934 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2935 int idx = 0, deftypes = 1;
2938 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch);
2941 int idx = 0, deftypes = 1;
2944 const int hasdir = (strpbrk(scriptname,":[</") != Nullch);
2946 /* The first time through, just add SEARCH_EXTS to whatever we
2947 * already have, so we can check for default file types. */
2949 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2955 if ((strlen(tmpbuf) + strlen(scriptname)
2956 + MAX_EXT_LEN) >= sizeof tmpbuf)
2957 continue; /* don't search dir with too-long name */
2958 strcat(tmpbuf, scriptname);
2962 if (strEQ(scriptname, "-"))
2964 if (dosearch) { /* Look in '.' first. */
2965 const char *cur = scriptname;
2967 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2969 if (strEQ(ext[i++],curext)) {
2970 extidx = -1; /* already has an ext */
2975 DEBUG_p(PerlIO_printf(Perl_debug_log,
2976 "Looking for %s\n",cur));
2977 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2978 && !S_ISDIR(PL_statbuf.st_mode)) {
2986 if (cur == scriptname) {
2987 len = strlen(scriptname);
2988 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2990 /* FIXME? Convert to memcpy */
2991 cur = strcpy(tmpbuf, scriptname);
2993 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2994 && strcpy(tmpbuf+len, ext[extidx++]));
2999 #ifdef MACOS_TRADITIONAL
3000 if (dosearch && !strchr(scriptname, ':') &&
3001 (s = PerlEnv_getenv("Commands")))
3003 if (dosearch && !strchr(scriptname, '/')
3005 && !strchr(scriptname, '\\')
3007 && (s = PerlEnv_getenv("PATH")))
3012 PL_bufend = s + strlen(s);
3013 while (s < PL_bufend) {
3014 #ifdef MACOS_TRADITIONAL
3015 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3019 #if defined(atarist) || defined(DOSISH)
3024 && *s != ';'; len++, s++) {
3025 if (len < sizeof tmpbuf)
3028 if (len < sizeof tmpbuf)
3030 #else /* ! (atarist || DOSISH) */
3031 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3034 #endif /* ! (atarist || DOSISH) */
3035 #endif /* MACOS_TRADITIONAL */
3038 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3039 continue; /* don't search dir with too-long name */
3040 #ifdef MACOS_TRADITIONAL
3041 if (len && tmpbuf[len - 1] != ':')
3042 tmpbuf[len++] = ':';
3045 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3046 && tmpbuf[len - 1] != '/'
3047 && tmpbuf[len - 1] != '\\'
3050 tmpbuf[len++] = '/';
3051 if (len == 2 && tmpbuf[0] == '.')
3054 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
3056 (void)strcpy(tmpbuf + len, scriptname);
3060 len = strlen(tmpbuf);
3061 if (extidx > 0) /* reset after previous loop */
3065 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3066 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3067 if (S_ISDIR(PL_statbuf.st_mode)) {
3071 } while ( retval < 0 /* not there */
3072 && extidx>=0 && ext[extidx] /* try an extension? */
3073 && strcpy(tmpbuf+len, ext[extidx++])
3078 if (S_ISREG(PL_statbuf.st_mode)
3079 && cando(S_IRUSR,TRUE,&PL_statbuf)
3080 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3081 && cando(S_IXUSR,TRUE,&PL_statbuf)
3085 xfound = tmpbuf; /* bingo! */
3089 xfailed = savepv(tmpbuf);
3092 if (!xfound && !seen_dot && !xfailed &&
3093 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3094 || S_ISDIR(PL_statbuf.st_mode)))
3096 seen_dot = 1; /* Disable message. */
3098 if (flags & 1) { /* do or die? */
3099 Perl_croak(aTHX_ "Can't %s %s%s%s",
3100 (xfailed ? "execute" : "find"),
3101 (xfailed ? xfailed : scriptname),
3102 (xfailed ? "" : " on PATH"),
3103 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3105 scriptname = Nullch;
3108 scriptname = xfound;
3110 return (scriptname ? savepv(scriptname) : Nullch);
3113 #ifndef PERL_GET_CONTEXT_DEFINED
3116 Perl_get_context(void)
3119 #if defined(USE_ITHREADS)
3120 # ifdef OLD_PTHREADS_API
3122 if (pthread_getspecific(PL_thr_key, &t))
3123 Perl_croak_nocontext("panic: pthread_getspecific");
3126 # ifdef I_MACH_CTHREADS
3127 return (void*)cthread_data(cthread_self());
3129 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3138 Perl_set_context(void *t)
3141 #if defined(USE_ITHREADS)
3142 # ifdef I_MACH_CTHREADS
3143 cthread_set_data(cthread_self(), t);
3145 if (pthread_setspecific(PL_thr_key, t))
3146 Perl_croak_nocontext("panic: pthread_setspecific");
3153 #endif /* !PERL_GET_CONTEXT_DEFINED */
3155 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3164 Perl_get_op_names(pTHX)
3166 return (char **)PL_op_name;
3170 Perl_get_op_descs(pTHX)
3172 return (char **)PL_op_desc;
3176 Perl_get_no_modify(pTHX)
3178 return PL_no_modify;
3182 Perl_get_opargs(pTHX)
3184 return (U32 *)PL_opargs;
3188 Perl_get_ppaddr(pTHX)
3191 return (PPADDR_t*)PL_ppaddr;
3194 #ifndef HAS_GETENV_LEN
3196 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3198 char * const env_trans = PerlEnv_getenv(env_elem);
3200 *len = strlen(env_trans);
3207 Perl_get_vtbl(pTHX_ int vtbl_id)
3209 const MGVTBL* result;
3213 result = &PL_vtbl_sv;
3216 result = &PL_vtbl_env;
3218 case want_vtbl_envelem:
3219 result = &PL_vtbl_envelem;
3222 result = &PL_vtbl_sig;
3224 case want_vtbl_sigelem:
3225 result = &PL_vtbl_sigelem;
3227 case want_vtbl_pack:
3228 result = &PL_vtbl_pack;
3230 case want_vtbl_packelem:
3231 result = &PL_vtbl_packelem;
3233 case want_vtbl_dbline:
3234 result = &PL_vtbl_dbline;
3237 result = &PL_vtbl_isa;
3239 case want_vtbl_isaelem:
3240 result = &PL_vtbl_isaelem;
3242 case want_vtbl_arylen:
3243 result = &PL_vtbl_arylen;
3245 case want_vtbl_glob:
3246 result = &PL_vtbl_glob;
3248 case want_vtbl_mglob:
3249 result = &PL_vtbl_mglob;
3251 case want_vtbl_nkeys:
3252 result = &PL_vtbl_nkeys;
3254 case want_vtbl_taint:
3255 result = &PL_vtbl_taint;
3257 case want_vtbl_substr:
3258 result = &PL_vtbl_substr;
3261 result = &PL_vtbl_vec;
3264 result = &PL_vtbl_pos;
3267 result = &PL_vtbl_bm;
3270 result = &PL_vtbl_fm;
3272 case want_vtbl_uvar:
3273 result = &PL_vtbl_uvar;
3275 case want_vtbl_defelem:
3276 result = &PL_vtbl_defelem;
3278 case want_vtbl_regexp:
3279 result = &PL_vtbl_regexp;
3281 case want_vtbl_regdata:
3282 result = &PL_vtbl_regdata;
3284 case want_vtbl_regdatum:
3285 result = &PL_vtbl_regdatum;
3287 #ifdef USE_LOCALE_COLLATE
3288 case want_vtbl_collxfrm:
3289 result = &PL_vtbl_collxfrm;
3292 case want_vtbl_amagic:
3293 result = &PL_vtbl_amagic;
3295 case want_vtbl_amagicelem:
3296 result = &PL_vtbl_amagicelem;
3298 case want_vtbl_backref:
3299 result = &PL_vtbl_backref;
3301 case want_vtbl_utf8:
3302 result = &PL_vtbl_utf8;
3305 result = Null(MGVTBL*);
3308 return (MGVTBL*)result;
3312 Perl_my_fflush_all(pTHX)
3314 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3315 return PerlIO_flush(NULL);
3317 # if defined(HAS__FWALK)
3318 extern int fflush(FILE *);
3319 /* undocumented, unprototyped, but very useful BSDism */
3320 extern void _fwalk(int (*)(FILE *));
3324 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3326 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3327 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3329 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3330 open_max = sysconf(_SC_OPEN_MAX);
3333 open_max = FOPEN_MAX;
3336 open_max = OPEN_MAX;
3347 for (i = 0; i < open_max; i++)
3348 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3349 STDIO_STREAM_ARRAY[i]._file < open_max &&
3350 STDIO_STREAM_ARRAY[i]._flag)
3351 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3355 SETERRNO(EBADF,RMS_IFI);
3362 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3364 const char * const func =
3365 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3366 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3368 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3369 const char * const type = OP_IS_SOCKET(op)
3370 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3371 ? "socket" : "filehandle";
3372 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3374 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3375 if (ckWARN(WARN_IO)) {
3376 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3378 Perl_warner(aTHX_ packWARN(WARN_IO),
3379 "Filehandle %s opened only for %sput",
3382 Perl_warner(aTHX_ packWARN(WARN_IO),
3383 "Filehandle opened only for %sput", direction);
3390 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3392 warn_type = WARN_CLOSED;
3396 warn_type = WARN_UNOPENED;
3399 if (ckWARN(warn_type)) {
3400 if (name && *name) {
3401 Perl_warner(aTHX_ packWARN(warn_type),
3402 "%s%s on %s %s %s", func, pars, vile, type, name);
3403 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3405 aTHX_ packWARN(warn_type),
3406 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3411 Perl_warner(aTHX_ packWARN(warn_type),
3412 "%s%s on %s %s", func, pars, vile, type);
3413 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3415 aTHX_ packWARN(warn_type),
3416 "\t(Are you trying to call %s%s on dirhandle?)\n",
3425 /* in ASCII order, not that it matters */
3426 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3429 Perl_ebcdic_control(pTHX_ int ch)
3437 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3438 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3441 if (ctlp == controllablechars)
3442 return('\177'); /* DEL */
3444 return((unsigned char)(ctlp - controllablechars - 1));
3445 } else { /* Want uncontrol */
3446 if (ch == '\177' || ch == -1)
3448 else if (ch == '\157')
3450 else if (ch == '\174')
3452 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3454 else if (ch == '\155')
3456 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3457 return(controllablechars[ch+1]);
3459 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3464 /* To workaround core dumps from the uninitialised tm_zone we get the
3465 * system to give us a reasonable struct to copy. This fix means that
3466 * strftime uses the tm_zone and tm_gmtoff values returned by
3467 * localtime(time()). That should give the desired result most of the
3468 * time. But probably not always!
3470 * This does not address tzname aspects of NETaa14816.
3475 # ifndef STRUCT_TM_HASZONE
3476 # define STRUCT_TM_HASZONE
3480 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3481 # ifndef HAS_TM_TM_ZONE
3482 # define HAS_TM_TM_ZONE
3487 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3489 #ifdef HAS_TM_TM_ZONE
3491 const struct tm* my_tm;
3493 my_tm = localtime(&now);
3495 Copy(my_tm, ptm, 1, struct tm);
3497 PERL_UNUSED_ARG(ptm);
3502 * mini_mktime - normalise struct tm values without the localtime()
3503 * semantics (and overhead) of mktime().
3506 Perl_mini_mktime(pTHX_ struct tm *ptm)
3510 int month, mday, year, jday;
3511 int odd_cent, odd_year;
3513 #define DAYS_PER_YEAR 365
3514 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3515 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3516 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3517 #define SECS_PER_HOUR (60*60)
3518 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3519 /* parentheses deliberately absent on these two, otherwise they don't work */
3520 #define MONTH_TO_DAYS 153/5
3521 #define DAYS_TO_MONTH 5/153
3522 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3523 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3524 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3525 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3528 * Year/day algorithm notes:
3530 * With a suitable offset for numeric value of the month, one can find
3531 * an offset into the year by considering months to have 30.6 (153/5) days,
3532 * using integer arithmetic (i.e., with truncation). To avoid too much
3533 * messing about with leap days, we consider January and February to be
3534 * the 13th and 14th month of the previous year. After that transformation,
3535 * we need the month index we use to be high by 1 from 'normal human' usage,
3536 * so the month index values we use run from 4 through 15.
3538 * Given that, and the rules for the Gregorian calendar (leap years are those
3539 * divisible by 4 unless also divisible by 100, when they must be divisible
3540 * by 400 instead), we can simply calculate the number of days since some
3541 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3542 * the days we derive from our month index, and adding in the day of the
3543 * month. The value used here is not adjusted for the actual origin which
3544 * it normally would use (1 January A.D. 1), since we're not exposing it.
3545 * We're only building the value so we can turn around and get the
3546 * normalised values for the year, month, day-of-month, and day-of-year.
3548 * For going backward, we need to bias the value we're using so that we find
3549 * the right year value. (Basically, we don't want the contribution of
3550 * March 1st to the number to apply while deriving the year). Having done
3551 * that, we 'count up' the contribution to the year number by accounting for
3552 * full quadracenturies (400-year periods) with their extra leap days, plus
3553 * the contribution from full centuries (to avoid counting in the lost leap
3554 * days), plus the contribution from full quad-years (to count in the normal
3555 * leap days), plus the leftover contribution from any non-leap years.
3556 * At this point, if we were working with an actual leap day, we'll have 0
3557 * days left over. This is also true for March 1st, however. So, we have
3558 * to special-case that result, and (earlier) keep track of the 'odd'
3559 * century and year contributions. If we got 4 extra centuries in a qcent,
3560 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3561 * Otherwise, we add back in the earlier bias we removed (the 123 from
3562 * figuring in March 1st), find the month index (integer division by 30.6),
3563 * and the remainder is the day-of-month. We then have to convert back to
3564 * 'real' months (including fixing January and February from being 14/15 in
3565 * the previous year to being in the proper year). After that, to get
3566 * tm_yday, we work with the normalised year and get a new yearday value for
3567 * January 1st, which we subtract from the yearday value we had earlier,
3568 * representing the date we've re-built. This is done from January 1
3569 * because tm_yday is 0-origin.
3571 * Since POSIX time routines are only guaranteed to work for times since the
3572 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3573 * applies Gregorian calendar rules even to dates before the 16th century
3574 * doesn't bother me. Besides, you'd need cultural context for a given
3575 * date to know whether it was Julian or Gregorian calendar, and that's
3576 * outside the scope for this routine. Since we convert back based on the
3577 * same rules we used to build the yearday, you'll only get strange results
3578 * for input which needed normalising, or for the 'odd' century years which
3579 * were leap years in the Julian calander but not in the Gregorian one.
3580 * I can live with that.
3582 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3583 * that's still outside the scope for POSIX time manipulation, so I don't
3587 year = 1900 + ptm->tm_year;
3588 month = ptm->tm_mon;
3589 mday = ptm->tm_mday;
3590 /* allow given yday with no month & mday to dominate the result */
3591 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3594 jday = 1 + ptm->tm_yday;
3603 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3604 yearday += month*MONTH_TO_DAYS + mday + jday;
3606 * Note that we don't know when leap-seconds were or will be,
3607 * so we have to trust the user if we get something which looks
3608 * like a sensible leap-second. Wild values for seconds will
3609 * be rationalised, however.
3611 if ((unsigned) ptm->tm_sec <= 60) {
3618 secs += 60 * ptm->tm_min;
3619 secs += SECS_PER_HOUR * ptm->tm_hour;
3621 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3622 /* got negative remainder, but need positive time */
3623 /* back off an extra day to compensate */
3624 yearday += (secs/SECS_PER_DAY)-1;
3625 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3628 yearday += (secs/SECS_PER_DAY);
3629 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3632 else if (secs >= SECS_PER_DAY) {
3633 yearday += (secs/SECS_PER_DAY);
3634 secs %= SECS_PER_DAY;
3636 ptm->tm_hour = secs/SECS_PER_HOUR;
3637 secs %= SECS_PER_HOUR;
3638 ptm->tm_min = secs/60;
3640 ptm->tm_sec += secs;
3641 /* done with time of day effects */
3643 * The algorithm for yearday has (so far) left it high by 428.
3644 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3645 * bias it by 123 while trying to figure out what year it
3646 * really represents. Even with this tweak, the reverse
3647 * translation fails for years before A.D. 0001.
3648 * It would still fail for Feb 29, but we catch that one below.
3650 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3651 yearday -= YEAR_ADJUST;
3652 year = (yearday / DAYS_PER_QCENT) * 400;
3653 yearday %= DAYS_PER_QCENT;
3654 odd_cent = yearday / DAYS_PER_CENT;
3655 year += odd_cent * 100;
3656 yearday %= DAYS_PER_CENT;
3657 year += (yearday / DAYS_PER_QYEAR) * 4;
3658 yearday %= DAYS_PER_QYEAR;
3659 odd_year = yearday / DAYS_PER_YEAR;
3661 yearday %= DAYS_PER_YEAR;
3662 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3667 yearday += YEAR_ADJUST; /* recover March 1st crock */
3668 month = yearday*DAYS_TO_MONTH;
3669 yearday -= month*MONTH_TO_DAYS;
3670 /* recover other leap-year adjustment */
3679 ptm->tm_year = year - 1900;
3681 ptm->tm_mday = yearday;
3682 ptm->tm_mon = month;
3686 ptm->tm_mon = month - 1;
3688 /* re-build yearday based on Jan 1 to get tm_yday */
3690 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3691 yearday += 14*MONTH_TO_DAYS + 1;
3692 ptm->tm_yday = jday - yearday;
3693 /* fix tm_wday if not overridden by caller */
3694 if ((unsigned)ptm->tm_wday > 6)
3695 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3699 Perl_my_strftime(pTHX_ const char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
3707 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3710 mytm.tm_hour = hour;
3711 mytm.tm_mday = mday;
3713 mytm.tm_year = year;
3714 mytm.tm_wday = wday;
3715 mytm.tm_yday = yday;
3716 mytm.tm_isdst = isdst;
3718 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3719 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3724 #ifdef HAS_TM_TM_GMTOFF
3725 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3727 #ifdef HAS_TM_TM_ZONE
3728 mytm.tm_zone = mytm2.tm_zone;
3733 Newx(buf, buflen, char);
3734 len = strftime(buf, buflen, fmt, &mytm);
3736 ** The following is needed to handle to the situation where
3737 ** tmpbuf overflows. Basically we want to allocate a buffer
3738 ** and try repeatedly. The reason why it is so complicated
3739 ** is that getting a return value of 0 from strftime can indicate
3740 ** one of the following:
3741 ** 1. buffer overflowed,
3742 ** 2. illegal conversion specifier, or
3743 ** 3. the format string specifies nothing to be returned(not
3744 ** an error). This could be because format is an empty string
3745 ** or it specifies %p that yields an empty string in some locale.
3746 ** If there is a better way to make it portable, go ahead by
3749 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3752 /* Possibly buf overflowed - try again with a bigger buf */
3753 const int fmtlen = strlen(fmt);
3754 const int bufsize = fmtlen + buflen;
3756 Newx(buf, bufsize, char);
3758 buflen = strftime(buf, bufsize, fmt, &mytm);
3759 if (buflen > 0 && buflen < bufsize)
3761 /* heuristic to prevent out-of-memory errors */
3762 if (bufsize > 100*fmtlen) {
3767 Renew(buf, bufsize*2, char);
3772 Perl_croak(aTHX_ "panic: no strftime");
3778 #define SV_CWD_RETURN_UNDEF \
3779 sv_setsv(sv, &PL_sv_undef); \
3782 #define SV_CWD_ISDOT(dp) \
3783 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3784 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3787 =head1 Miscellaneous Functions
3789 =for apidoc getcwd_sv
3791 Fill the sv with current working directory
3796 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3797 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3798 * getcwd(3) if available
3799 * Comments from the orignal:
3800 * This is a faster version of getcwd. It's also more dangerous
3801 * because you might chdir out of a directory that you can't chdir
3805 Perl_getcwd_sv(pTHX_ register SV *sv)
3809 #ifndef INCOMPLETE_TAINTS
3815 char buf[MAXPATHLEN];
3817 /* Some getcwd()s automatically allocate a buffer of the given
3818 * size from the heap if they are given a NULL buffer pointer.
3819 * The problem is that this behaviour is not portable. */
3820 if (getcwd(buf, sizeof(buf) - 1)) {
3825 sv_setsv(sv, &PL_sv_undef);
3833 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3837 SvUPGRADE(sv, SVt_PV);
3839 if (PerlLIO_lstat(".", &statbuf) < 0) {
3840 SV_CWD_RETURN_UNDEF;
3843 orig_cdev = statbuf.st_dev;
3844 orig_cino = statbuf.st_ino;
3853 if (PerlDir_chdir("..") < 0) {
3854 SV_CWD_RETURN_UNDEF;
3856 if (PerlLIO_stat(".", &statbuf) < 0) {
3857 SV_CWD_RETURN_UNDEF;
3860 cdev = statbuf.st_dev;
3861 cino = statbuf.st_ino;
3863 if (odev == cdev && oino == cino) {
3866 if (!(dir = PerlDir_open("."))) {
3867 SV_CWD_RETURN_UNDEF;
3870 while ((dp = PerlDir_read(dir)) != NULL) {
3872 const int namelen = dp->d_namlen;
3874 const int namelen = strlen(dp->d_name);
3877 if (SV_CWD_ISDOT(dp)) {
3881 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3882 SV_CWD_RETURN_UNDEF;
3885 tdev = statbuf.st_dev;
3886 tino = statbuf.st_ino;
3887 if (tino == oino && tdev == odev) {
3893 SV_CWD_RETURN_UNDEF;
3896 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3897 SV_CWD_RETURN_UNDEF;
3900 SvGROW(sv, pathlen + namelen + 1);
3904 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3907 /* prepend current directory to the front */
3909 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3910 pathlen += (namelen + 1);
3912 #ifdef VOID_CLOSEDIR
3915 if (PerlDir_close(dir) < 0) {
3916 SV_CWD_RETURN_UNDEF;
3922 SvCUR_set(sv, pathlen);
3926 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3927 SV_CWD_RETURN_UNDEF;
3930 if (PerlLIO_stat(".", &statbuf) < 0) {
3931 SV_CWD_RETURN_UNDEF;
3934 cdev = statbuf.st_dev;
3935 cino = statbuf.st_ino;
3937 if (cdev != orig_cdev || cino != orig_cino) {
3938 Perl_croak(aTHX_ "Unstable directory path, "
3939 "current directory changed unexpectedly");
3951 =for apidoc scan_version
3953 Returns a pointer to the next character after the parsed
3954 version string, as well as upgrading the passed in SV to
3957 Function must be called with an already existing SV like
3960 s = scan_version(s,SV *sv, bool qv);
3962 Performs some preprocessing to the string to ensure that
3963 it has the correct characteristics of a version. Flags the
3964 object if it contains an underscore (which denotes this
3965 is a alpha version). The boolean qv denotes that the version
3966 should be interpreted as if it had multiple decimals, even if
3973 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3981 AV * const av = newAV();
3982 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3983 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3985 #ifndef NODEFAULT_SHAREKEYS
3986 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3989 while (isSPACE(*s)) /* leading whitespace is OK */
3993 s++; /* get past 'v' */
3994 qv = 1; /* force quoted version processing */
3997 start = last = pos = s;
3999 /* pre-scan the input string to check for decimals/underbars */
4000 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4005 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4009 else if ( *pos == '_' )
4012 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4014 width = pos - last - 1; /* natural width of sub-version */
4019 if ( saw_period > 1 )
4020 qv = 1; /* force quoted version processing */
4025 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4027 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4028 if ( !qv && width < 3 )
4029 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4031 while (isDIGIT(*pos))
4033 if (!isALPHA(*pos)) {
4039 /* this is atoi() that delimits on underscores */
4040 const char *end = pos;
4044 /* the following if() will only be true after the decimal
4045 * point of a version originally created with a bare
4046 * floating point number, i.e. not quoted in any way
4048 if ( !qv && s > start && saw_period == 1 ) {
4052 rev += (*s - '0') * mult;
4054 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4055 Perl_croak(aTHX_ "Integer overflow in version");
4062 while (--end >= s) {
4064 rev += (*end - '0') * mult;
4066 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4067 Perl_croak(aTHX_ "Integer overflow in version");
4072 /* Append revision */
4073 av_push(av, newSViv(rev));
4074 if ( *pos == '.' && isDIGIT(pos[1]) )
4076 else if ( *pos == '_' && isDIGIT(pos[1]) )
4078 else if ( isDIGIT(*pos) )
4085 while ( isDIGIT(*pos) )
4090 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4098 if ( qv ) { /* quoted versions always get at least three terms*/
4099 I32 len = av_len(av);
4100 /* This for loop appears to trigger a compiler bug on OS X, as it
4101 loops infinitely. Yes, len is negative. No, it makes no sense.
4102 Compiler in question is:
4103 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4104 for ( len = 2 - len; len > 0; len-- )
4105 av_push((AV *)sv, newSViv(0));
4109 av_push(av, newSViv(0));
4112 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4113 av_push(av, newSViv(0));
4115 /* And finally, store the AV in the hash */
4116 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4121 =for apidoc new_version
4123 Returns a new version object based on the passed in SV:
4125 SV *sv = new_version(SV *ver);
4127 Does not alter the passed in ver SV. See "upg_version" if you
4128 want to upgrade the SV.
4134 Perl_new_version(pTHX_ SV *ver)
4136 SV * const rv = newSV(0);
4137 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4140 AV * const av = newAV();
4142 /* This will get reblessed later if a derived class*/
4143 SV * const hv = newSVrv(rv, "version");
4144 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4145 #ifndef NODEFAULT_SHAREKEYS
4146 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4152 /* Begin copying all of the elements */
4153 if ( hv_exists((HV *)ver, "qv", 2) )
4154 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4156 if ( hv_exists((HV *)ver, "alpha", 5) )
4157 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4159 if ( hv_exists((HV*)ver, "width", 5 ) )
4161 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4162 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4165 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
4166 /* This will get reblessed later if a derived class*/
4167 for ( key = 0; key <= av_len(sav); key++ )
4169 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4170 av_push(av, newSViv(rev));
4173 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4177 if ( SvVOK(ver) ) { /* already a v-string */
4178 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4179 const STRLEN len = mg->mg_len;
4180 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4181 sv_setpvn(rv,version,len);
4186 sv_setsv(rv,ver); /* make a duplicate */
4195 =for apidoc upg_version
4197 In-place upgrade of the supplied SV to a version object.
4199 SV *sv = upg_version(SV *sv);
4201 Returns a pointer to the upgraded SV.
4207 Perl_upg_version(pTHX_ SV *ver)
4212 if ( SvNOK(ver) ) /* may get too much accuracy */
4215 const STRLEN len = my_sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4216 version = savepvn(tbuf, len);
4219 else if ( SvVOK(ver) ) { /* already a v-string */
4220 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
4221 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4225 else /* must be a string or something like a string */
4227 version = savepv(SvPV_nolen(ver));
4229 (void)scan_version(version, ver, qv);
4237 Validates that the SV contains a valid version object.
4239 bool vverify(SV *vobj);
4241 Note that it only confirms the bare minimum structure (so as not to get
4242 confused by derived classes which may contain additional hash entries):
4246 =item * The SV contains a [reference to a] hash
4248 =item * The hash contains a "version" key
4250 =item * The "version" key has [a reference to] an AV as its value
4258 Perl_vverify(pTHX_ SV *vs)
4264 /* see if the appropriate elements exist */
4265 if ( SvTYPE(vs) == SVt_PVHV
4266 && hv_exists((HV*)vs, "version", 7)
4267 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
4268 && SvTYPE(sv) == SVt_PVAV )
4277 Accepts a version object and returns the normalized floating
4278 point representation. Call like:
4282 NOTE: you can pass either the object directly or the SV
4283 contained within the RV.
4289 Perl_vnumify(pTHX_ SV *vs)
4294 SV * const sv = newSV(0);
4300 Perl_croak(aTHX_ "Invalid version object");
4302 /* see if various flags exist */
4303 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4305 if ( hv_exists((HV*)vs, "width", 5 ) )
4306 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4311 /* attempt to retrieve the version array */
4312 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
4313 sv_catpvn(sv,"0",1);
4320 sv_catpvn(sv,"0",1);
4324 digit = SvIV(*av_fetch(av, 0, 0));
4325 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4326 for ( i = 1 ; i < len ; i++ )
4328 digit = SvIV(*av_fetch(av, i, 0));
4330 const int denom = (width == 2 ? 10 : 100);
4331 const div_t term = div((int)PERL_ABS(digit),denom);
4332 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4335 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4341 digit = SvIV(*av_fetch(av, len, 0));
4342 if ( alpha && width == 3 ) /* alpha version */
4343 sv_catpvn(sv,"_",1);
4344 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4348 sv_catpvn(sv,"000",3);
4356 Accepts a version object and returns the normalized string
4357 representation. Call like:
4361 NOTE: you can pass either the object directly or the SV
4362 contained within the RV.
4368 Perl_vnormal(pTHX_ SV *vs)
4372 SV * const sv = newSV(0);
4378 Perl_croak(aTHX_ "Invalid version object");
4380 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4382 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
4390 digit = SvIV(*av_fetch(av, 0, 0));
4391 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4392 for ( i = 1 ; i < len ; i++ ) {
4393 digit = SvIV(*av_fetch(av, i, 0));
4394 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4399 /* handle last digit specially */
4400 digit = SvIV(*av_fetch(av, len, 0));
4402 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4404 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4407 if ( len <= 2 ) { /* short version, must be at least three */
4408 for ( len = 2 - len; len != 0; len-- )
4409 sv_catpvn(sv,".0",2);
4415 =for apidoc vstringify
4417 In order to maintain maximum compatibility with earlier versions
4418 of Perl, this function will return either the floating point
4419 notation or the multiple dotted notation, depending on whether
4420 the original version contained 1 or more dots, respectively
4426 Perl_vstringify(pTHX_ SV *vs)
4432 Perl_croak(aTHX_ "Invalid version object");
4434 if ( hv_exists((HV *)vs, "qv", 2) )
4443 Version object aware cmp. Both operands must already have been
4444 converted into version objects.
4450 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4453 bool lalpha = FALSE;
4454 bool ralpha = FALSE;
4463 if ( !vverify(lhv) )
4464 Perl_croak(aTHX_ "Invalid version object");
4466 if ( !vverify(rhv) )
4467 Perl_croak(aTHX_ "Invalid version object");
4469 /* get the left hand term */
4470 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
4471 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4474 /* and the right hand term */
4475 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
4476 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4484 while ( i <= m && retval == 0 )
4486 left = SvIV(*av_fetch(lav,i,0));
4487 right = SvIV(*av_fetch(rav,i,0));
4495 /* tiebreaker for alpha with identical terms */
4496 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4498 if ( lalpha && !ralpha )
4502 else if ( ralpha && !lalpha)
4508 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4512 while ( i <= r && retval == 0 )
4514 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4515 retval = -1; /* not a match after all */
4521 while ( i <= l && retval == 0 )
4523 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4524 retval = +1; /* not a match after all */
4532 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4533 # define EMULATE_SOCKETPAIR_UDP
4536 #ifdef EMULATE_SOCKETPAIR_UDP
4538 S_socketpair_udp (int fd[2]) {
4540 /* Fake a datagram socketpair using UDP to localhost. */
4541 int sockets[2] = {-1, -1};
4542 struct sockaddr_in addresses[2];
4544 Sock_size_t size = sizeof(struct sockaddr_in);
4545 unsigned short port;
4548 memset(&addresses, 0, sizeof(addresses));
4551 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4552 if (sockets[i] == -1)
4553 goto tidy_up_and_fail;
4555 addresses[i].sin_family = AF_INET;
4556 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4557 addresses[i].sin_port = 0; /* kernel choses port. */
4558 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4559 sizeof(struct sockaddr_in)) == -1)
4560 goto tidy_up_and_fail;
4563 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4564 for each connect the other socket to it. */
4567 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4569 goto tidy_up_and_fail;
4570 if (size != sizeof(struct sockaddr_in))
4571 goto abort_tidy_up_and_fail;
4572 /* !1 is 0, !0 is 1 */
4573 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4574 sizeof(struct sockaddr_in)) == -1)
4575 goto tidy_up_and_fail;
4578 /* Now we have 2 sockets connected to each other. I don't trust some other
4579 process not to have already sent a packet to us (by random) so send
4580 a packet from each to the other. */
4583 /* I'm going to send my own port number. As a short.
4584 (Who knows if someone somewhere has sin_port as a bitfield and needs
4585 this routine. (I'm assuming crays have socketpair)) */
4586 port = addresses[i].sin_port;
4587 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4588 if (got != sizeof(port)) {
4590 goto tidy_up_and_fail;
4591 goto abort_tidy_up_and_fail;
4595 /* Packets sent. I don't trust them to have arrived though.
4596 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4597 connect to localhost will use a second kernel thread. In 2.6 the
4598 first thread running the connect() returns before the second completes,
4599 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4600 returns 0. Poor programs have tripped up. One poor program's authors'
4601 had a 50-1 reverse stock split. Not sure how connected these were.)
4602 So I don't trust someone not to have an unpredictable UDP stack.
4606 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4607 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4611 FD_SET(sockets[0], &rset);
4612 FD_SET(sockets[1], &rset);
4614 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4615 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4616 || !FD_ISSET(sockets[1], &rset)) {
4617 /* I hope this is portable and appropriate. */
4619 goto tidy_up_and_fail;
4620 goto abort_tidy_up_and_fail;
4624 /* And the paranoia department even now doesn't trust it to have arrive
4625 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4627 struct sockaddr_in readfrom;
4628 unsigned short buffer[2];
4633 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4634 sizeof(buffer), MSG_DONTWAIT,
4635 (struct sockaddr *) &readfrom, &size);
4637 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4639 (struct sockaddr *) &readfrom, &size);
4643 goto tidy_up_and_fail;
4644 if (got != sizeof(port)
4645 || size != sizeof(struct sockaddr_in)
4646 /* Check other socket sent us its port. */
4647 || buffer[0] != (unsigned short) addresses[!i].sin_port
4648 /* Check kernel says we got the datagram from that socket */
4649 || readfrom.sin_family != addresses[!i].sin_family
4650 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4651 || readfrom.sin_port != addresses[!i].sin_port)
4652 goto abort_tidy_up_and_fail;
4655 /* My caller (my_socketpair) has validated that this is non-NULL */
4658 /* I hereby declare this connection open. May God bless all who cross
4662 abort_tidy_up_and_fail:
4663 errno = ECONNABORTED;
4666 const int save_errno = errno;
4667 if (sockets[0] != -1)
4668 PerlLIO_close(sockets[0]);
4669 if (sockets[1] != -1)
4670 PerlLIO_close(sockets[1]);
4675 #endif /* EMULATE_SOCKETPAIR_UDP */
4677 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4679 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4680 /* Stevens says that family must be AF_LOCAL, protocol 0.
4681 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4686 struct sockaddr_in listen_addr;
4687 struct sockaddr_in connect_addr;
4692 || family != AF_UNIX
4695 errno = EAFNOSUPPORT;
4703 #ifdef EMULATE_SOCKETPAIR_UDP
4704 if (type == SOCK_DGRAM)
4705 return S_socketpair_udp(fd);
4708 listener = PerlSock_socket(AF_INET, type, 0);
4711 memset(&listen_addr, 0, sizeof(listen_addr));
4712 listen_addr.sin_family = AF_INET;
4713 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4714 listen_addr.sin_port = 0; /* kernel choses port. */
4715 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4716 sizeof(listen_addr)) == -1)
4717 goto tidy_up_and_fail;
4718 if (PerlSock_listen(listener, 1) == -1)
4719 goto tidy_up_and_fail;
4721 connector = PerlSock_socket(AF_INET, type, 0);
4722 if (connector == -1)
4723 goto tidy_up_and_fail;
4724 /* We want to find out the port number to connect to. */
4725 size = sizeof(connect_addr);
4726 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4728 goto tidy_up_and_fail;
4729 if (size != sizeof(connect_addr))
4730 goto abort_tidy_up_and_fail;
4731 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4732 sizeof(connect_addr)) == -1)
4733 goto tidy_up_and_fail;
4735 size = sizeof(listen_addr);
4736 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4739 goto tidy_up_and_fail;
4740 if (size != sizeof(listen_addr))
4741 goto abort_tidy_up_and_fail;
4742 PerlLIO_close(listener);
4743 /* Now check we are talking to ourself by matching port and host on the
4745 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4747 goto tidy_up_and_fail;
4748 if (size != sizeof(connect_addr)
4749 || listen_addr.sin_family != connect_addr.sin_family
4750 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4751 || listen_addr.sin_port != connect_addr.sin_port) {
4752 goto abort_tidy_up_and_fail;
4758 abort_tidy_up_and_fail:
4760 errno = ECONNABORTED; /* This would be the standard thing to do. */
4762 # ifdef ECONNREFUSED
4763 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4765 errno = ETIMEDOUT; /* Desperation time. */
4770 const int save_errno = errno;
4772 PerlLIO_close(listener);
4773 if (connector != -1)
4774 PerlLIO_close(connector);
4776 PerlLIO_close(acceptor);
4782 /* In any case have a stub so that there's code corresponding
4783 * to the my_socketpair in global.sym. */
4785 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4786 #ifdef HAS_SOCKETPAIR
4787 return socketpair(family, type, protocol, fd);
4796 =for apidoc sv_nosharing
4798 Dummy routine which "shares" an SV when there is no sharing module present.
4799 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4800 Exists to avoid test for a NULL function pointer and because it could
4801 potentially warn under some level of strict-ness.
4807 Perl_sv_nosharing(pTHX_ SV *sv)
4809 PERL_UNUSED_ARG(sv);
4813 Perl_parse_unicode_opts(pTHX_ const char **popt)
4815 const char *p = *popt;
4820 opt = (U32) atoi(p);
4821 while (isDIGIT(*p)) p++;
4822 if (*p && *p != '\n' && *p != '\r')
4823 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4828 case PERL_UNICODE_STDIN:
4829 opt |= PERL_UNICODE_STDIN_FLAG; break;
4830 case PERL_UNICODE_STDOUT:
4831 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4832 case PERL_UNICODE_STDERR:
4833 opt |= PERL_UNICODE_STDERR_FLAG; break;
4834 case PERL_UNICODE_STD:
4835 opt |= PERL_UNICODE_STD_FLAG; break;
4836 case PERL_UNICODE_IN:
4837 opt |= PERL_UNICODE_IN_FLAG; break;
4838 case PERL_UNICODE_OUT:
4839 opt |= PERL_UNICODE_OUT_FLAG; break;
4840 case PERL_UNICODE_INOUT:
4841 opt |= PERL_UNICODE_INOUT_FLAG; break;
4842 case PERL_UNICODE_LOCALE:
4843 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4844 case PERL_UNICODE_ARGV:
4845 opt |= PERL_UNICODE_ARGV_FLAG; break;
4847 if (*p != '\n' && *p != '\r')
4849 "Unknown Unicode option letter '%c'", *p);
4855 opt = PERL_UNICODE_DEFAULT_FLAGS;
4857 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4858 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4859 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4870 * This is really just a quick hack which grabs various garbage
4871 * values. It really should be a real hash algorithm which
4872 * spreads the effect of every input bit onto every output bit,
4873 * if someone who knows about such things would bother to write it.
4874 * Might be a good idea to add that function to CORE as well.
4875 * No numbers below come from careful analysis or anything here,
4876 * except they are primes and SEED_C1 > 1E6 to get a full-width
4877 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4878 * probably be bigger too.
4881 # define SEED_C1 1000003
4882 #define SEED_C4 73819
4884 # define SEED_C1 25747
4885 #define SEED_C4 20639
4889 #define SEED_C5 26107
4891 #ifndef PERL_NO_DEV_RANDOM
4896 # include <starlet.h>
4897 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4898 * in 100-ns units, typically incremented ever 10 ms. */
4899 unsigned int when[2];
4901 # ifdef HAS_GETTIMEOFDAY
4902 struct timeval when;
4908 /* This test is an escape hatch, this symbol isn't set by Configure. */
4909 #ifndef PERL_NO_DEV_RANDOM
4910 #ifndef PERL_RANDOM_DEVICE
4911 /* /dev/random isn't used by default because reads from it will block
4912 * if there isn't enough entropy available. You can compile with
4913 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4914 * is enough real entropy to fill the seed. */
4915 # define PERL_RANDOM_DEVICE "/dev/urandom"
4917 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4919 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4928 _ckvmssts(sys$gettim(when));
4929 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4931 # ifdef HAS_GETTIMEOFDAY
4932 PerlProc_gettimeofday(&when,NULL);
4933 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4936 u = (U32)SEED_C1 * when;
4939 u += SEED_C3 * (U32)PerlProc_getpid();
4940 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4941 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4942 u += SEED_C5 * (U32)PTR2UV(&when);
4948 Perl_get_hash_seed(pTHX)
4950 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4954 while (isSPACE(*s)) s++;
4955 if (s && isDIGIT(*s))
4956 myseed = (UV)Atoul(s);
4958 #ifdef USE_HASH_SEED_EXPLICIT
4962 /* Compute a random seed */
4963 (void)seedDrand01((Rand_seed_t)seed());
4964 myseed = (UV)(Drand01() * (NV)UV_MAX);
4965 #if RANDBITS < (UVSIZE * 8)
4966 /* Since there are not enough randbits to to reach all
4967 * the bits of a UV, the low bits might need extra
4968 * help. Sum in another random number that will
4969 * fill in the low bits. */
4971 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4972 #endif /* RANDBITS < (UVSIZE * 8) */
4973 if (myseed == 0) { /* Superparanoia. */
4974 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4976 Perl_croak(aTHX_ "Your random numbers are not that random");
4979 PL_rehash_seed_set = TRUE;
4986 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4988 const char * const stashpv = CopSTASHPV(c);
4989 const char * const name = HvNAME_get(hv);
4991 if (stashpv == name)
4993 if (stashpv && name)
4994 if (strEQ(stashpv, name))
5001 #ifdef PERL_GLOBAL_STRUCT
5004 Perl_init_global_struct(pTHX)
5006 struct perl_vars *plvarsp = NULL;
5007 #ifdef PERL_GLOBAL_STRUCT
5008 # define PERL_GLOBAL_STRUCT_INIT
5009 # include "opcode.h" /* the ppaddr and check */
5010 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5011 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5012 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5013 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5014 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5018 plvarsp = PL_VarsPtr;
5019 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5025 # define PERLVAR(var,type) /**/
5026 # define PERLVARA(var,n,type) /**/
5027 # define PERLVARI(var,type,init) plvarsp->var = init;
5028 # define PERLVARIC(var,type,init) plvarsp->var = init;
5029 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5030 # include "perlvars.h"
5036 # ifdef PERL_GLOBAL_STRUCT
5037 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5038 if (!plvarsp->Gppaddr)
5040 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5041 if (!plvarsp->Gcheck)
5043 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5044 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5046 # ifdef PERL_SET_VARS
5047 PERL_SET_VARS(plvarsp);
5049 # undef PERL_GLOBAL_STRUCT_INIT
5054 #endif /* PERL_GLOBAL_STRUCT */
5056 #ifdef PERL_GLOBAL_STRUCT
5059 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5061 #ifdef PERL_GLOBAL_STRUCT
5062 # ifdef PERL_UNSET_VARS
5063 PERL_UNSET_VARS(plvarsp);
5065 free(plvarsp->Gppaddr);
5066 free(plvarsp->Gcheck);
5067 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5073 #endif /* PERL_GLOBAL_STRUCT */
5077 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5080 Perl_mem_log_alloc(const UV n, const UV typesize, const char *typename, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5082 #ifdef PERL_MEM_LOG_STDERR
5083 /* We can't use PerlIO for obvious reasons. */
5084 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5085 const STRLEN len = my_sprintf(buf,
5086 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5087 " %s = %"IVdf": %"UVxf"\n",
5088 filename, linenumber, funcname, n, typesize,
5089 typename, n * typesize, PTR2UV(newalloc));
5090 PerlLIO_write(2, buf, len);
5096 Perl_mem_log_realloc(const UV n, const UV typesize, const char *typename, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5098 #ifdef PERL_MEM_LOG_STDERR
5099 /* We can't use PerlIO for obvious reasons. */
5100 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5101 const STRLEN len = my_sprintf(buf, "realloc: %s:%d:%s: %"IVdf" %"UVuf
5102 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5103 filename, linenumber, funcname, n, typesize,
5104 typename, n * typesize, PTR2UV(oldalloc),
5106 PerlLIO_write(2, buf, len);
5112 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5114 #ifdef PERL_MEM_LOG_STDERR
5115 /* We can't use PerlIO for obvious reasons. */
5116 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5117 const STRLEN len = my_sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5118 filename, linenumber, funcname,
5120 PerlLIO_write(2, buf, len);
5125 #endif /* PERL_MEM_LOG */
5128 =for apidoc my_sprintf
5130 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5131 the length of the string written to the buffer. Only rare pre-ANSI systems
5132 need the wrapper function - usually this is a direct call to C<sprintf>.
5136 #ifndef SPRINTF_RETURNS_STRLEN
5138 Perl_my_sprintf(char *buffer, const char* pat, ...)
5141 va_start(args, pat);
5142 vsprintf(buffer, pat, args);
5144 return strlen(buffer);
5149 Perl_my_clearenv(pTHX)
5152 #if ! defined(PERL_MICRO)
5153 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5155 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5156 # if defined(USE_ENVIRON_ARRAY)
5157 # if defined(USE_ITHREADS)
5158 /* only the parent thread can clobber the process environment */
5159 if (PL_curinterp == aTHX)
5160 # endif /* USE_ITHREADS */
5162 # if ! defined(PERL_USE_SAFE_PUTENV)
5163 if ( !PL_use_safe_putenv) {
5165 if (environ == PL_origenviron)
5166 environ = (char**)safesysmalloc(sizeof(char*));
5168 for (i = 0; environ[i]; i++)
5169 (void)safesysfree(environ[i]);
5172 # else /* PERL_USE_SAFE_PUTENV */
5173 # if defined(HAS_CLEARENV)
5175 # elif defined(HAS_UNSETENV)
5176 int bsiz = 80; /* Most envvar names will be shorter than this. */
5177 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5178 while (*environ != NULL) {
5179 char *e = strchr(*environ, '=');
5180 int l = e ? e - *environ : strlen(*environ);
5182 (void)safesysfree(buf);
5184 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5186 strncpy(buf, *environ, l);
5188 (void)unsetenv(buf);
5190 (void)safesysfree(buf);
5191 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5192 /* Just null environ and accept the leakage. */
5194 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5195 # endif /* ! PERL_USE_SAFE_PUTENV */
5197 # endif /* USE_ENVIRON_ARRAY */
5198 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5199 #endif /* PERL_MICRO */
5204 * c-indentation-style: bsd
5206 * indent-tabs-mode: t
5209 * ex: set ts=8 sts=4 sw=4 noet: