3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 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.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
263 if (size * count > 0xffff) {
264 PerlIO_printf(Perl_error_log,
265 "Allocation too large: %lx\n", size * count) FLUSH;
268 #endif /* HAS_64K_LIMIT */
270 if ((long)size < 0 || (long)count < 0)
271 Perl_croak_nocontext("panic: calloc");
274 #ifdef PERL_TRACK_MEMPOOL
277 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
278 PERL_ALLOC_CHECK(ptr);
279 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));
281 memset((void*)ptr, 0, size);
282 #ifdef PERL_TRACK_MEMPOOL
284 struct perl_memory_debug_header *const header
285 = (struct perl_memory_debug_header *)ptr;
287 header->interpreter = aTHX;
288 /* Link us into the list. */
289 header->prev = &PL_memory_debug_header;
290 header->next = PL_memory_debug_header.next;
291 PL_memory_debug_header.next = header;
292 header->next->prev = header;
296 ptr = (Malloc_t)((char*)ptr+sTHX);
303 return write_no_mem();
306 /* These must be defined when not using Perl's malloc for binary
311 Malloc_t Perl_malloc (MEM_SIZE nbytes)
314 return (Malloc_t)PerlMem_malloc(nbytes);
317 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
320 return (Malloc_t)PerlMem_calloc(elements, size);
323 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
326 return (Malloc_t)PerlMem_realloc(where, nbytes);
329 Free_t Perl_mfree (Malloc_t where)
337 /* copy a string up to some (non-backslashed) delimiter, if any */
340 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
345 for (tolen = 0; from < fromend; from++, tolen++) {
347 if (from[1] != delim) {
354 else if (*from == delim)
365 /* return ptr to little string in big string, NULL if not found */
366 /* This routine was donated by Corey Satten. */
369 Perl_instr(pTHX_ register const char *big, register const char *little)
380 register const char *s, *x;
383 for (x=big,s=little; *s; /**/ ) {
394 return (char*)(big-1);
399 /* same as instr but allow embedded nulls */
402 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
408 char first = *little++;
410 bigend -= lend - little;
412 while (big <= bigend) {
415 for (x=big,s=little; s < lend; x++,s++) {
419 return (char*)(big-1);
425 /* reverse of the above--find last substring */
428 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
430 register const char *bigbeg;
431 register const I32 first = *little;
432 register const char * const littleend = lend;
435 if (little >= littleend)
436 return (char*)bigend;
438 big = bigend - (littleend - little++);
439 while (big >= bigbeg) {
440 register const char *s, *x;
443 for (x=big+2,s=little; s < littleend; /**/ ) {
452 return (char*)(big+1);
457 /* As a space optimization, we do not compile tables for strings of length
458 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
459 special-cased in fbm_instr().
461 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
464 =head1 Miscellaneous Functions
466 =for apidoc fbm_compile
468 Analyses the string in order to make fast searches on it using fbm_instr()
469 -- the Boyer-Moore algorithm.
475 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
478 register const U8 *s;
484 if (flags & FBMcf_TAIL) {
485 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
486 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
487 if (mg && mg->mg_len >= 0)
490 s = (U8*)SvPV_force_mutable(sv, len);
491 if (len == 0) /* TAIL might be on a zero-length string. */
493 SvUPGRADE(sv, SVt_PVBM);
496 const unsigned char *sb;
497 const U8 mlen = (len>255) ? 255 : (U8)len;
500 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
502 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
503 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
504 memset((void*)table, mlen, 256);
505 table[PERL_FBM_FLAGS_OFFSET_FROM_TABLE] = (U8)flags;
507 sb = s - mlen + 1; /* first char (maybe) */
509 if (table[*s] == mlen)
514 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
516 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
519 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
520 for (i = 0; i < len; i++) {
521 if (PL_freq[s[i]] < frequency) {
523 frequency = PL_freq[s[i]];
526 BmRARE(sv) = s[rarest];
527 BmPREVIOUS_set(sv, rarest);
528 BmUSEFUL(sv) = 100; /* Initial value */
529 if (flags & FBMcf_TAIL)
531 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
532 BmRARE(sv),BmPREVIOUS(sv)));
535 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
536 /* If SvTAIL is actually due to \Z or \z, this gives false positives
540 =for apidoc fbm_instr
542 Returns the location of the SV in the string delimited by C<str> and
543 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
544 does not have to be fbm_compiled, but the search will not be as fast
551 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
553 register unsigned char *s;
555 register const unsigned char *little
556 = (const unsigned char *)SvPV_const(littlestr,l);
557 register STRLEN littlelen = l;
558 register const I32 multiline = flags & FBMrf_MULTILINE;
560 if ((STRLEN)(bigend - big) < littlelen) {
561 if ( SvTAIL(littlestr)
562 && ((STRLEN)(bigend - big) == littlelen - 1)
564 || (*big == *little &&
565 memEQ((char *)big, (char *)little, littlelen - 1))))
570 if (littlelen <= 2) { /* Special-cased */
572 if (littlelen == 1) {
573 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
574 /* Know that bigend != big. */
575 if (bigend[-1] == '\n')
576 return (char *)(bigend - 1);
577 return (char *) bigend;
585 if (SvTAIL(littlestr))
586 return (char *) bigend;
590 return (char*)big; /* Cannot be SvTAIL! */
593 if (SvTAIL(littlestr) && !multiline) {
594 if (bigend[-1] == '\n' && bigend[-2] == *little)
595 return (char*)bigend - 2;
596 if (bigend[-1] == *little)
597 return (char*)bigend - 1;
601 /* This should be better than FBM if c1 == c2, and almost
602 as good otherwise: maybe better since we do less indirection.
603 And we save a lot of memory by caching no table. */
604 const unsigned char c1 = little[0];
605 const unsigned char c2 = little[1];
610 while (s <= bigend) {
620 goto check_1char_anchor;
631 goto check_1char_anchor;
634 while (s <= bigend) {
639 goto check_1char_anchor;
648 check_1char_anchor: /* One char and anchor! */
649 if (SvTAIL(littlestr) && (*bigend == *little))
650 return (char *)bigend; /* bigend is already decremented. */
653 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
654 s = bigend - littlelen;
655 if (s >= big && bigend[-1] == '\n' && *s == *little
656 /* Automatically of length > 2 */
657 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
659 return (char*)s; /* how sweet it is */
662 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
664 return (char*)s + 1; /* how sweet it is */
668 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
669 char * const b = ninstr((char*)big,(char*)bigend,
670 (char*)little, (char*)little + littlelen);
672 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
673 /* Chop \n from littlestr: */
674 s = bigend - littlelen + 1;
676 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
686 if (littlelen > (STRLEN)(bigend - big))
690 register const unsigned char * const table
691 = little + littlelen + PERL_FBM_TABLE_OFFSET;
692 register const unsigned char *oldlittle;
694 --littlelen; /* Last char found by table lookup */
697 little += littlelen; /* last char */
703 if ((tmp = table[*s])) {
704 if ((s += tmp) < bigend)
708 else { /* less expensive than calling strncmp() */
709 register unsigned char * const olds = s;
714 if (*--s == *--little)
716 s = olds + 1; /* here we pay the price for failure */
718 if (s < bigend) /* fake up continue to outer loop */
727 && (table[PERL_FBM_FLAGS_OFFSET_FROM_TABLE] & FBMcf_TAIL)
728 && memEQ((char *)(bigend - littlelen),
729 (char *)(oldlittle - littlelen), littlelen) )
730 return (char*)bigend - littlelen;
735 /* start_shift, end_shift are positive quantities which give offsets
736 of ends of some substring of bigstr.
737 If "last" we want the last occurrence.
738 old_posp is the way of communication between consequent calls if
739 the next call needs to find the .
740 The initial *old_posp should be -1.
742 Note that we take into account SvTAIL, so one can get extra
743 optimizations if _ALL flag is set.
746 /* If SvTAIL is actually due to \Z or \z, this gives false positives
747 if PL_multiline. In fact if !PL_multiline the authoritative answer
748 is not supported yet. */
751 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
754 register const unsigned char *big;
756 register I32 previous;
758 register const unsigned char *little;
759 register I32 stop_pos;
760 register const unsigned char *littleend;
763 assert(SvTYPE(littlestr) == SVt_PVBM);
766 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
767 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
769 if ( BmRARE(littlestr) == '\n'
770 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
771 little = (const unsigned char *)(SvPVX_const(littlestr));
772 littleend = little + SvCUR(littlestr);
779 little = (const unsigned char *)(SvPVX_const(littlestr));
780 littleend = little + SvCUR(littlestr);
782 /* The value of pos we can start at: */
783 previous = BmPREVIOUS(littlestr);
784 big = (const unsigned char *)(SvPVX_const(bigstr));
785 /* The value of pos we can stop at: */
786 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
787 if (previous + start_shift > stop_pos) {
789 stop_pos does not include SvTAIL in the count, so this check is incorrect
790 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
793 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
798 while (pos < previous + start_shift) {
799 if (!(pos += PL_screamnext[pos]))
804 register const unsigned char *s, *x;
805 if (pos >= stop_pos) break;
806 if (big[pos] != first)
808 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
814 if (s == littleend) {
816 if (!last) return (char *)(big+pos);
819 } while ( pos += PL_screamnext[pos] );
821 return (char *)(big+(*old_posp));
823 if (!SvTAIL(littlestr) || (end_shift > 0))
825 /* Ignore the trailing "\n". This code is not microoptimized */
826 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
827 stop_pos = littleend - little; /* Actual littlestr len */
832 && ((stop_pos == 1) ||
833 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
839 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
841 register const U8 *a = (const U8 *)s1;
842 register const U8 *b = (const U8 *)s2;
846 if (*a != *b && *a != PL_fold[*b])
854 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
857 register const U8 *a = (const U8 *)s1;
858 register const U8 *b = (const U8 *)s2;
862 if (*a != *b && *a != PL_fold_locale[*b])
869 /* copy a string to a safe spot */
872 =head1 Memory Management
876 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
877 string which is a duplicate of C<pv>. The size of the string is
878 determined by C<strlen()>. The memory allocated for the new string can
879 be freed with the C<Safefree()> function.
885 Perl_savepv(pTHX_ const char *pv)
892 const STRLEN pvlen = strlen(pv)+1;
893 Newx(newaddr, pvlen, char);
894 return (char*)memcpy(newaddr, pv, pvlen);
898 /* same thing but with a known length */
903 Perl's version of what C<strndup()> would be if it existed. Returns a
904 pointer to a newly allocated string which is a duplicate of the first
905 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
906 the new string can be freed with the C<Safefree()> function.
912 Perl_savepvn(pTHX_ const char *pv, register I32 len)
914 register char *newaddr;
917 Newx(newaddr,len+1,char);
918 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
920 /* might not be null terminated */
922 return (char *) CopyD(pv,newaddr,len,char);
925 return (char *) ZeroD(newaddr,len+1,char);
930 =for apidoc savesharedpv
932 A version of C<savepv()> which allocates the duplicate string in memory
933 which is shared between threads.
938 Perl_savesharedpv(pTHX_ const char *pv)
940 register char *newaddr;
945 pvlen = strlen(pv)+1;
946 newaddr = (char*)PerlMemShared_malloc(pvlen);
948 return write_no_mem();
950 return (char*)memcpy(newaddr, pv, pvlen);
956 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
957 the passed in SV using C<SvPV()>
963 Perl_savesvpv(pTHX_ SV *sv)
966 const char * const pv = SvPV_const(sv, len);
967 register char *newaddr;
970 Newx(newaddr,len,char);
971 return (char *) CopyD(pv,newaddr,len,char);
975 /* the SV for Perl_form() and mess() is not kept in an arena */
985 return sv_2mortal(newSVpvs(""));
990 /* Create as PVMG now, to avoid any upgrading later */
992 Newxz(any, 1, XPVMG);
993 SvFLAGS(sv) = SVt_PVMG;
994 SvANY(sv) = (void*)any;
996 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1001 #if defined(PERL_IMPLICIT_CONTEXT)
1003 Perl_form_nocontext(const char* pat, ...)
1008 va_start(args, pat);
1009 retval = vform(pat, &args);
1013 #endif /* PERL_IMPLICIT_CONTEXT */
1016 =head1 Miscellaneous Functions
1019 Takes a sprintf-style format pattern and conventional
1020 (non-SV) arguments and returns the formatted string.
1022 (char *) Perl_form(pTHX_ const char* pat, ...)
1024 can be used any place a string (char *) is required:
1026 char * s = Perl_form("%d.%d",major,minor);
1028 Uses a single private buffer so if you want to format several strings you
1029 must explicitly copy the earlier strings away (and free the copies when you
1036 Perl_form(pTHX_ const char* pat, ...)
1040 va_start(args, pat);
1041 retval = vform(pat, &args);
1047 Perl_vform(pTHX_ const char *pat, va_list *args)
1049 SV * const sv = mess_alloc();
1050 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1054 #if defined(PERL_IMPLICIT_CONTEXT)
1056 Perl_mess_nocontext(const char *pat, ...)
1061 va_start(args, pat);
1062 retval = vmess(pat, &args);
1066 #endif /* PERL_IMPLICIT_CONTEXT */
1069 Perl_mess(pTHX_ const char *pat, ...)
1073 va_start(args, pat);
1074 retval = vmess(pat, &args);
1080 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1083 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1085 if (!o || o == PL_op)
1088 if (o->op_flags & OPf_KIDS) {
1090 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1093 /* If the OP_NEXTSTATE has been optimised away we can still use it
1094 * the get the file and line number. */
1096 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1097 cop = (const COP *)kid;
1099 /* Keep searching, and return when we've found something. */
1101 new_cop = closest_cop(cop, kid);
1107 /* Nothing found. */
1113 Perl_vmess(pTHX_ const char *pat, va_list *args)
1116 SV * const sv = mess_alloc();
1118 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1119 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1121 * Try and find the file and line for PL_op. This will usually be
1122 * PL_curcop, but it might be a cop that has been optimised away. We
1123 * can try to find such a cop by searching through the optree starting
1124 * from the sibling of PL_curcop.
1127 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1132 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1133 OutCopFILE(cop), (IV)CopLINE(cop));
1134 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1135 const bool line_mode = (RsSIMPLE(PL_rs) &&
1136 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1137 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1138 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1139 line_mode ? "line" : "chunk",
1140 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1143 sv_catpvs(sv, " during global destruction");
1144 sv_catpvs(sv, ".\n");
1150 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1156 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1157 && (io = GvIO(PL_stderrgv))
1158 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1165 SAVESPTR(PL_stderrgv);
1168 PUSHSTACKi(PERLSI_MAGIC);
1172 PUSHs(SvTIED_obj((SV*)io, mg));
1173 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1175 call_method("PRINT", G_SCALAR);
1183 /* SFIO can really mess with your errno */
1184 const int e = errno;
1186 PerlIO * const serr = Perl_error_log;
1188 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1189 (void)PerlIO_flush(serr);
1196 /* Common code used by vcroak, vdie, vwarn and vwarner */
1199 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1205 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1206 /* sv_2cv might call Perl_croak() or Perl_warner() */
1207 SV * const oldhook = *hook;
1214 cv = sv_2cv(oldhook, &stash, &gv, 0);
1216 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1226 if (warn || message) {
1227 msg = newSVpvn(message, msglen);
1228 SvFLAGS(msg) |= utf8;
1236 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1240 call_sv((SV*)cv, G_DISCARD);
1249 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1253 const char *message;
1256 SV * const msv = vmess(pat, args);
1257 if (PL_errors && SvCUR(PL_errors)) {
1258 sv_catsv(PL_errors, msv);
1259 message = SvPV_const(PL_errors, *msglen);
1260 SvCUR_set(PL_errors, 0);
1263 message = SvPV_const(msv,*msglen);
1264 *utf8 = SvUTF8(msv);
1270 DEBUG_S(PerlIO_printf(Perl_debug_log,
1271 "%p: die/croak: message = %s\ndiehook = %p\n",
1272 thr, message, PL_diehook));
1274 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1280 Perl_vdie(pTHX_ const char* pat, va_list *args)
1283 const char *message;
1284 const int was_in_eval = PL_in_eval;
1288 DEBUG_S(PerlIO_printf(Perl_debug_log,
1289 "%p: die: curstack = %p, mainstack = %p\n",
1290 thr, PL_curstack, PL_mainstack));
1292 message = vdie_croak_common(pat, args, &msglen, &utf8);
1294 PL_restartop = die_where(message, msglen);
1295 SvFLAGS(ERRSV) |= utf8;
1296 DEBUG_S(PerlIO_printf(Perl_debug_log,
1297 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1298 thr, PL_restartop, was_in_eval, PL_top_env));
1299 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1301 return PL_restartop;
1304 #if defined(PERL_IMPLICIT_CONTEXT)
1306 Perl_die_nocontext(const char* pat, ...)
1311 va_start(args, pat);
1312 o = vdie(pat, &args);
1316 #endif /* PERL_IMPLICIT_CONTEXT */
1319 Perl_die(pTHX_ const char* pat, ...)
1323 va_start(args, pat);
1324 o = vdie(pat, &args);
1330 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1333 const char *message;
1337 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1340 PL_restartop = die_where(message, msglen);
1341 SvFLAGS(ERRSV) |= utf8;
1345 message = SvPVx_const(ERRSV, msglen);
1347 write_to_stderr(message, msglen);
1351 #if defined(PERL_IMPLICIT_CONTEXT)
1353 Perl_croak_nocontext(const char *pat, ...)
1357 va_start(args, pat);
1362 #endif /* PERL_IMPLICIT_CONTEXT */
1365 =head1 Warning and Dieing
1369 This is the XSUB-writer's interface to Perl's C<die> function.
1370 Normally call this function the same way you call the C C<printf>
1371 function. Calling C<croak> returns control directly to Perl,
1372 sidestepping the normal C order of execution. See C<warn>.
1374 If you want to throw an exception object, assign the object to
1375 C<$@> and then pass C<NULL> to croak():
1377 errsv = get_sv("@", TRUE);
1378 sv_setsv(errsv, exception_object);
1385 Perl_croak(pTHX_ const char *pat, ...)
1388 va_start(args, pat);
1395 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1399 SV * const msv = vmess(pat, args);
1400 const I32 utf8 = SvUTF8(msv);
1401 const char * const message = SvPV_const(msv, msglen);
1404 if (vdie_common(message, msglen, utf8, TRUE))
1408 write_to_stderr(message, msglen);
1411 #if defined(PERL_IMPLICIT_CONTEXT)
1413 Perl_warn_nocontext(const char *pat, ...)
1417 va_start(args, pat);
1421 #endif /* PERL_IMPLICIT_CONTEXT */
1426 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1427 function the same way you call the C C<printf> function. See C<croak>.
1433 Perl_warn(pTHX_ const char *pat, ...)
1436 va_start(args, pat);
1441 #if defined(PERL_IMPLICIT_CONTEXT)
1443 Perl_warner_nocontext(U32 err, const char *pat, ...)
1447 va_start(args, pat);
1448 vwarner(err, pat, &args);
1451 #endif /* PERL_IMPLICIT_CONTEXT */
1454 Perl_warner(pTHX_ U32 err, const char* pat,...)
1457 va_start(args, pat);
1458 vwarner(err, pat, &args);
1463 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1466 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1467 SV * const msv = vmess(pat, args);
1469 const char * const message = SvPV_const(msv, msglen);
1470 const I32 utf8 = SvUTF8(msv);
1474 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1477 PL_restartop = die_where(message, msglen);
1478 SvFLAGS(ERRSV) |= utf8;
1481 write_to_stderr(message, msglen);
1485 Perl_vwarn(aTHX_ pat, args);
1489 /* implements the ckWARN? macros */
1492 Perl_ckwarn(pTHX_ U32 w)
1498 && PL_curcop->cop_warnings != pWARN_NONE
1500 PL_curcop->cop_warnings == pWARN_ALL
1501 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1502 || (unpackWARN2(w) &&
1503 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1504 || (unpackWARN3(w) &&
1505 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1506 || (unpackWARN4(w) &&
1507 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1512 isLEXWARN_off && PL_dowarn & G_WARN_ON
1517 /* implements the ckWARN?_d macro */
1520 Perl_ckwarn_d(pTHX_ U32 w)
1525 || PL_curcop->cop_warnings == pWARN_ALL
1527 PL_curcop->cop_warnings != pWARN_NONE
1529 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1530 || (unpackWARN2(w) &&
1531 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1532 || (unpackWARN3(w) &&
1533 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1534 || (unpackWARN4(w) &&
1535 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1541 /* Set buffer=NULL to get a new one. */
1543 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1545 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1546 PERL_UNUSED_CONTEXT;
1549 (specialWARN(buffer) ?
1550 PerlMemShared_malloc(len_wanted) :
1551 PerlMemShared_realloc(buffer, len_wanted));
1553 Copy(bits, (buffer + 1), size, char);
1557 /* since we've already done strlen() for both nam and val
1558 * we can use that info to make things faster than
1559 * sprintf(s, "%s=%s", nam, val)
1561 #define my_setenv_format(s, nam, nlen, val, vlen) \
1562 Copy(nam, s, nlen, char); \
1564 Copy(val, s+(nlen+1), vlen, char); \
1565 *(s+(nlen+1+vlen)) = '\0'
1567 #ifdef USE_ENVIRON_ARRAY
1568 /* VMS' my_setenv() is in vms.c */
1569 #if !defined(WIN32) && !defined(NETWARE)
1571 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1575 /* only parent thread can modify process environment */
1576 if (PL_curinterp == aTHX)
1579 #ifndef PERL_USE_SAFE_PUTENV
1580 if (!PL_use_safe_putenv) {
1581 /* most putenv()s leak, so we manipulate environ directly */
1582 register I32 i=setenv_getix(nam); /* where does it go? */
1585 if (environ == PL_origenviron) { /* need we copy environment? */
1591 while (environ[max])
1593 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1594 for (j=0; j<max; j++) { /* copy environment */
1595 const int len = strlen(environ[j]);
1596 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1597 Copy(environ[j], tmpenv[j], len+1, char);
1600 environ = tmpenv; /* tell exec where it is now */
1603 safesysfree(environ[i]);
1604 while (environ[i]) {
1605 environ[i] = environ[i+1];
1610 if (!environ[i]) { /* does not exist yet */
1611 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1612 environ[i+1] = NULL; /* make sure it's null terminated */
1615 safesysfree(environ[i]);
1619 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1620 /* all that work just for this */
1621 my_setenv_format(environ[i], nam, nlen, val, vlen);
1624 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1625 # if defined(HAS_UNSETENV)
1627 (void)unsetenv(nam);
1629 (void)setenv(nam, val, 1);
1631 # else /* ! HAS_UNSETENV */
1632 (void)setenv(nam, val, 1);
1633 # endif /* HAS_UNSETENV */
1635 # if defined(HAS_UNSETENV)
1637 (void)unsetenv(nam);
1639 const int nlen = strlen(nam);
1640 const int vlen = strlen(val);
1641 char * const new_env =
1642 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1643 my_setenv_format(new_env, nam, nlen, val, vlen);
1644 (void)putenv(new_env);
1646 # else /* ! HAS_UNSETENV */
1648 const int nlen = strlen(nam);
1654 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1655 /* all that work just for this */
1656 my_setenv_format(new_env, nam, nlen, val, vlen);
1657 (void)putenv(new_env);
1658 # endif /* HAS_UNSETENV */
1659 # endif /* __CYGWIN__ */
1660 #ifndef PERL_USE_SAFE_PUTENV
1666 #else /* WIN32 || NETWARE */
1669 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1672 register char *envstr;
1673 const int nlen = strlen(nam);
1680 Newx(envstr, nlen+vlen+2, char);
1681 my_setenv_format(envstr, nam, nlen, val, vlen);
1682 (void)PerlEnv_putenv(envstr);
1686 #endif /* WIN32 || NETWARE */
1690 Perl_setenv_getix(pTHX_ const char *nam)
1693 register const I32 len = strlen(nam);
1694 PERL_UNUSED_CONTEXT;
1696 for (i = 0; environ[i]; i++) {
1699 strnicmp(environ[i],nam,len) == 0
1701 strnEQ(environ[i],nam,len)
1703 && environ[i][len] == '=')
1704 break; /* strnEQ must come first to avoid */
1705 } /* potential SEGV's */
1708 #endif /* !PERL_MICRO */
1710 #endif /* !VMS && !EPOC*/
1712 #ifdef UNLINK_ALL_VERSIONS
1714 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1718 while (PerlLIO_unlink(f) >= 0)
1720 return retries ? 0 : -1;
1724 /* this is a drop-in replacement for bcopy() */
1725 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1727 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1729 char * const retval = to;
1731 if (from - to >= 0) {
1739 *(--to) = *(--from);
1745 /* this is a drop-in replacement for memset() */
1748 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1750 char * const retval = loc;
1758 /* this is a drop-in replacement for bzero() */
1759 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1761 Perl_my_bzero(register char *loc, register I32 len)
1763 char * const retval = loc;
1771 /* this is a drop-in replacement for memcmp() */
1772 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1774 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1776 register const U8 *a = (const U8 *)s1;
1777 register const U8 *b = (const U8 *)s2;
1781 if ((tmp = *a++ - *b++))
1786 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1790 #ifdef USE_CHAR_VSPRINTF
1795 vsprintf(char *dest, const char *pat, char *args)
1799 fakebuf._ptr = dest;
1800 fakebuf._cnt = 32767;
1804 fakebuf._flag = _IOWRT|_IOSTRG;
1805 _doprnt(pat, args, &fakebuf); /* what a kludge */
1806 (void)putc('\0', &fakebuf);
1807 #ifdef USE_CHAR_VSPRINTF
1810 return 0; /* perl doesn't use return value */
1814 #endif /* HAS_VPRINTF */
1817 #if BYTEORDER != 0x4321
1819 Perl_my_swap(pTHX_ short s)
1821 #if (BYTEORDER & 1) == 0
1824 result = ((s & 255) << 8) + ((s >> 8) & 255);
1832 Perl_my_htonl(pTHX_ long l)
1836 char c[sizeof(long)];
1839 #if BYTEORDER == 0x1234
1840 u.c[0] = (l >> 24) & 255;
1841 u.c[1] = (l >> 16) & 255;
1842 u.c[2] = (l >> 8) & 255;
1846 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1847 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1852 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1853 u.c[o & 0xf] = (l >> s) & 255;
1861 Perl_my_ntohl(pTHX_ long l)
1865 char c[sizeof(long)];
1868 #if BYTEORDER == 0x1234
1869 u.c[0] = (l >> 24) & 255;
1870 u.c[1] = (l >> 16) & 255;
1871 u.c[2] = (l >> 8) & 255;
1875 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1876 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1883 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1884 l |= (u.c[o & 0xf] & 255) << s;
1891 #endif /* BYTEORDER != 0x4321 */
1895 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1896 * If these functions are defined,
1897 * the BYTEORDER is neither 0x1234 nor 0x4321.
1898 * However, this is not assumed.
1902 #define HTOLE(name,type) \
1904 name (register type n) \
1908 char c[sizeof(type)]; \
1911 register U32 s = 0; \
1912 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1913 u.c[i] = (n >> s) & 0xFF; \
1918 #define LETOH(name,type) \
1920 name (register type n) \
1924 char c[sizeof(type)]; \
1927 register U32 s = 0; \
1930 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1931 n |= ((type)(u.c[i] & 0xFF)) << s; \
1937 * Big-endian byte order functions.
1940 #define HTOBE(name,type) \
1942 name (register type n) \
1946 char c[sizeof(type)]; \
1949 register U32 s = 8*(sizeof(u.c)-1); \
1950 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1951 u.c[i] = (n >> s) & 0xFF; \
1956 #define BETOH(name,type) \
1958 name (register type n) \
1962 char c[sizeof(type)]; \
1965 register U32 s = 8*(sizeof(u.c)-1); \
1968 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1969 n |= ((type)(u.c[i] & 0xFF)) << s; \
1975 * If we just can't do it...
1978 #define NOT_AVAIL(name,type) \
1980 name (register type n) \
1982 Perl_croak_nocontext(#name "() not available"); \
1983 return n; /* not reached */ \
1987 #if defined(HAS_HTOVS) && !defined(htovs)
1990 #if defined(HAS_HTOVL) && !defined(htovl)
1993 #if defined(HAS_VTOHS) && !defined(vtohs)
1996 #if defined(HAS_VTOHL) && !defined(vtohl)
2000 #ifdef PERL_NEED_MY_HTOLE16
2002 HTOLE(Perl_my_htole16,U16)
2004 NOT_AVAIL(Perl_my_htole16,U16)
2007 #ifdef PERL_NEED_MY_LETOH16
2009 LETOH(Perl_my_letoh16,U16)
2011 NOT_AVAIL(Perl_my_letoh16,U16)
2014 #ifdef PERL_NEED_MY_HTOBE16
2016 HTOBE(Perl_my_htobe16,U16)
2018 NOT_AVAIL(Perl_my_htobe16,U16)
2021 #ifdef PERL_NEED_MY_BETOH16
2023 BETOH(Perl_my_betoh16,U16)
2025 NOT_AVAIL(Perl_my_betoh16,U16)
2029 #ifdef PERL_NEED_MY_HTOLE32
2031 HTOLE(Perl_my_htole32,U32)
2033 NOT_AVAIL(Perl_my_htole32,U32)
2036 #ifdef PERL_NEED_MY_LETOH32
2038 LETOH(Perl_my_letoh32,U32)
2040 NOT_AVAIL(Perl_my_letoh32,U32)
2043 #ifdef PERL_NEED_MY_HTOBE32
2045 HTOBE(Perl_my_htobe32,U32)
2047 NOT_AVAIL(Perl_my_htobe32,U32)
2050 #ifdef PERL_NEED_MY_BETOH32
2052 BETOH(Perl_my_betoh32,U32)
2054 NOT_AVAIL(Perl_my_betoh32,U32)
2058 #ifdef PERL_NEED_MY_HTOLE64
2060 HTOLE(Perl_my_htole64,U64)
2062 NOT_AVAIL(Perl_my_htole64,U64)
2065 #ifdef PERL_NEED_MY_LETOH64
2067 LETOH(Perl_my_letoh64,U64)
2069 NOT_AVAIL(Perl_my_letoh64,U64)
2072 #ifdef PERL_NEED_MY_HTOBE64
2074 HTOBE(Perl_my_htobe64,U64)
2076 NOT_AVAIL(Perl_my_htobe64,U64)
2079 #ifdef PERL_NEED_MY_BETOH64
2081 BETOH(Perl_my_betoh64,U64)
2083 NOT_AVAIL(Perl_my_betoh64,U64)
2087 #ifdef PERL_NEED_MY_HTOLES
2088 HTOLE(Perl_my_htoles,short)
2090 #ifdef PERL_NEED_MY_LETOHS
2091 LETOH(Perl_my_letohs,short)
2093 #ifdef PERL_NEED_MY_HTOBES
2094 HTOBE(Perl_my_htobes,short)
2096 #ifdef PERL_NEED_MY_BETOHS
2097 BETOH(Perl_my_betohs,short)
2100 #ifdef PERL_NEED_MY_HTOLEI
2101 HTOLE(Perl_my_htolei,int)
2103 #ifdef PERL_NEED_MY_LETOHI
2104 LETOH(Perl_my_letohi,int)
2106 #ifdef PERL_NEED_MY_HTOBEI
2107 HTOBE(Perl_my_htobei,int)
2109 #ifdef PERL_NEED_MY_BETOHI
2110 BETOH(Perl_my_betohi,int)
2113 #ifdef PERL_NEED_MY_HTOLEL
2114 HTOLE(Perl_my_htolel,long)
2116 #ifdef PERL_NEED_MY_LETOHL
2117 LETOH(Perl_my_letohl,long)
2119 #ifdef PERL_NEED_MY_HTOBEL
2120 HTOBE(Perl_my_htobel,long)
2122 #ifdef PERL_NEED_MY_BETOHL
2123 BETOH(Perl_my_betohl,long)
2127 Perl_my_swabn(void *ptr, int n)
2129 register char *s = (char *)ptr;
2130 register char *e = s + (n-1);
2133 for (n /= 2; n > 0; s++, e--, n--) {
2141 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2143 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2146 register I32 This, that;
2152 PERL_FLUSHALL_FOR_CHILD;
2153 This = (*mode == 'w');
2157 taint_proper("Insecure %s%s", "EXEC");
2159 if (PerlProc_pipe(p) < 0)
2161 /* Try for another pipe pair for error return */
2162 if (PerlProc_pipe(pp) >= 0)
2164 while ((pid = PerlProc_fork()) < 0) {
2165 if (errno != EAGAIN) {
2166 PerlLIO_close(p[This]);
2167 PerlLIO_close(p[that]);
2169 PerlLIO_close(pp[0]);
2170 PerlLIO_close(pp[1]);
2182 /* Close parent's end of error status pipe (if any) */
2184 PerlLIO_close(pp[0]);
2185 #if defined(HAS_FCNTL) && defined(F_SETFD)
2186 /* Close error pipe automatically if exec works */
2187 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2190 /* Now dup our end of _the_ pipe to right position */
2191 if (p[THIS] != (*mode == 'r')) {
2192 PerlLIO_dup2(p[THIS], *mode == 'r');
2193 PerlLIO_close(p[THIS]);
2194 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2195 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2198 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2199 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2200 /* No automatic close - do it by hand */
2207 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2213 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2219 do_execfree(); /* free any memory malloced by child on fork */
2221 PerlLIO_close(pp[1]);
2222 /* Keep the lower of the two fd numbers */
2223 if (p[that] < p[This]) {
2224 PerlLIO_dup2(p[This], p[that]);
2225 PerlLIO_close(p[This]);
2229 PerlLIO_close(p[that]); /* close child's end of pipe */
2232 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2234 SvUPGRADE(sv,SVt_IV);
2236 PL_forkprocess = pid;
2237 /* If we managed to get status pipe check for exec fail */
2238 if (did_pipes && pid > 0) {
2243 while (n < sizeof(int)) {
2244 n1 = PerlLIO_read(pp[0],
2245 (void*)(((char*)&errkid)+n),
2251 PerlLIO_close(pp[0]);
2253 if (n) { /* Error */
2255 PerlLIO_close(p[This]);
2256 if (n != sizeof(int))
2257 Perl_croak(aTHX_ "panic: kid popen errno read");
2259 pid2 = wait4pid(pid, &status, 0);
2260 } while (pid2 == -1 && errno == EINTR);
2261 errno = errkid; /* Propagate errno from kid */
2266 PerlLIO_close(pp[0]);
2267 return PerlIO_fdopen(p[This], mode);
2269 Perl_croak(aTHX_ "List form of piped open not implemented");
2270 return (PerlIO *) NULL;
2274 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2275 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2277 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2281 register I32 This, that;
2284 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2288 PERL_FLUSHALL_FOR_CHILD;
2291 return my_syspopen(aTHX_ cmd,mode);
2294 This = (*mode == 'w');
2296 if (doexec && PL_tainting) {
2298 taint_proper("Insecure %s%s", "EXEC");
2300 if (PerlProc_pipe(p) < 0)
2302 if (doexec && PerlProc_pipe(pp) >= 0)
2304 while ((pid = PerlProc_fork()) < 0) {
2305 if (errno != EAGAIN) {
2306 PerlLIO_close(p[This]);
2307 PerlLIO_close(p[that]);
2309 PerlLIO_close(pp[0]);
2310 PerlLIO_close(pp[1]);
2313 Perl_croak(aTHX_ "Can't fork");
2326 PerlLIO_close(pp[0]);
2327 #if defined(HAS_FCNTL) && defined(F_SETFD)
2328 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2331 if (p[THIS] != (*mode == 'r')) {
2332 PerlLIO_dup2(p[THIS], *mode == 'r');
2333 PerlLIO_close(p[THIS]);
2334 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2335 PerlLIO_close(p[THAT]);
2338 PerlLIO_close(p[THAT]);
2341 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2348 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2353 /* may or may not use the shell */
2354 do_exec3(cmd, pp[1], did_pipes);
2357 #endif /* defined OS2 */
2358 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2359 SvREADONLY_off(GvSV(tmpgv));
2360 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2361 SvREADONLY_on(GvSV(tmpgv));
2363 #ifdef THREADS_HAVE_PIDS
2364 PL_ppid = (IV)getppid();
2367 #ifdef PERL_USES_PL_PIDSTATUS
2368 hv_clear(PL_pidstatus); /* we have no children */
2374 do_execfree(); /* free any memory malloced by child on vfork */
2376 PerlLIO_close(pp[1]);
2377 if (p[that] < p[This]) {
2378 PerlLIO_dup2(p[This], p[that]);
2379 PerlLIO_close(p[This]);
2383 PerlLIO_close(p[that]);
2386 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2388 SvUPGRADE(sv,SVt_IV);
2390 PL_forkprocess = pid;
2391 if (did_pipes && pid > 0) {
2396 while (n < sizeof(int)) {
2397 n1 = PerlLIO_read(pp[0],
2398 (void*)(((char*)&errkid)+n),
2404 PerlLIO_close(pp[0]);
2406 if (n) { /* Error */
2408 PerlLIO_close(p[This]);
2409 if (n != sizeof(int))
2410 Perl_croak(aTHX_ "panic: kid popen errno read");
2412 pid2 = wait4pid(pid, &status, 0);
2413 } while (pid2 == -1 && errno == EINTR);
2414 errno = errkid; /* Propagate errno from kid */
2419 PerlLIO_close(pp[0]);
2420 return PerlIO_fdopen(p[This], mode);
2423 #if defined(atarist) || defined(EPOC)
2426 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2428 PERL_FLUSHALL_FOR_CHILD;
2429 /* Call system's popen() to get a FILE *, then import it.
2430 used 0 for 2nd parameter to PerlIO_importFILE;
2433 return PerlIO_importFILE(popen(cmd, mode), 0);
2437 FILE *djgpp_popen();
2439 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2441 PERL_FLUSHALL_FOR_CHILD;
2442 /* Call system's popen() to get a FILE *, then import it.
2443 used 0 for 2nd parameter to PerlIO_importFILE;
2446 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2451 #endif /* !DOSISH */
2453 /* this is called in parent before the fork() */
2455 Perl_atfork_lock(void)
2458 #if defined(USE_ITHREADS)
2459 /* locks must be held in locking order (if any) */
2461 MUTEX_LOCK(&PL_malloc_mutex);
2467 /* this is called in both parent and child after the fork() */
2469 Perl_atfork_unlock(void)
2472 #if defined(USE_ITHREADS)
2473 /* locks must be released in same order as in atfork_lock() */
2475 MUTEX_UNLOCK(&PL_malloc_mutex);
2484 #if defined(HAS_FORK)
2486 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2491 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2492 * handlers elsewhere in the code */
2497 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2498 Perl_croak_nocontext("fork() not available");
2500 #endif /* HAS_FORK */
2505 Perl_dump_fds(pTHX_ char *s)
2510 PerlIO_printf(Perl_debug_log,"%s", s);
2511 for (fd = 0; fd < 32; fd++) {
2512 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2513 PerlIO_printf(Perl_debug_log," %d",fd);
2515 PerlIO_printf(Perl_debug_log,"\n");
2518 #endif /* DUMP_FDS */
2522 dup2(int oldfd, int newfd)
2524 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2527 PerlLIO_close(newfd);
2528 return fcntl(oldfd, F_DUPFD, newfd);
2530 #define DUP2_MAX_FDS 256
2531 int fdtmp[DUP2_MAX_FDS];
2537 PerlLIO_close(newfd);
2538 /* good enough for low fd's... */
2539 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2540 if (fdx >= DUP2_MAX_FDS) {
2548 PerlLIO_close(fdtmp[--fdx]);
2555 #ifdef HAS_SIGACTION
2557 #ifdef MACOS_TRADITIONAL
2558 /* We don't want restart behavior on MacOS */
2563 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2566 struct sigaction act, oact;
2569 /* only "parent" interpreter can diddle signals */
2570 if (PL_curinterp != aTHX)
2571 return (Sighandler_t) SIG_ERR;
2574 act.sa_handler = (void(*)(int))handler;
2575 sigemptyset(&act.sa_mask);
2578 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2579 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2581 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2582 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2583 act.sa_flags |= SA_NOCLDWAIT;
2585 if (sigaction(signo, &act, &oact) == -1)
2586 return (Sighandler_t) SIG_ERR;
2588 return (Sighandler_t) oact.sa_handler;
2592 Perl_rsignal_state(pTHX_ int signo)
2594 struct sigaction oact;
2595 PERL_UNUSED_CONTEXT;
2597 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2598 return (Sighandler_t) SIG_ERR;
2600 return (Sighandler_t) oact.sa_handler;
2604 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2607 struct sigaction act;
2610 /* only "parent" interpreter can diddle signals */
2611 if (PL_curinterp != aTHX)
2615 act.sa_handler = (void(*)(int))handler;
2616 sigemptyset(&act.sa_mask);
2619 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2620 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2622 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2623 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2624 act.sa_flags |= SA_NOCLDWAIT;
2626 return sigaction(signo, &act, save);
2630 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2634 /* only "parent" interpreter can diddle signals */
2635 if (PL_curinterp != aTHX)
2639 return sigaction(signo, save, (struct sigaction *)NULL);
2642 #else /* !HAS_SIGACTION */
2645 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2647 #if defined(USE_ITHREADS) && !defined(WIN32)
2648 /* only "parent" interpreter can diddle signals */
2649 if (PL_curinterp != aTHX)
2650 return (Sighandler_t) SIG_ERR;
2653 return PerlProc_signal(signo, handler);
2664 Perl_rsignal_state(pTHX_ int signo)
2667 Sighandler_t oldsig;
2669 #if defined(USE_ITHREADS) && !defined(WIN32)
2670 /* only "parent" interpreter can diddle signals */
2671 if (PL_curinterp != aTHX)
2672 return (Sighandler_t) SIG_ERR;
2676 oldsig = PerlProc_signal(signo, sig_trap);
2677 PerlProc_signal(signo, oldsig);
2679 PerlProc_kill(PerlProc_getpid(), signo);
2684 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2686 #if defined(USE_ITHREADS) && !defined(WIN32)
2687 /* only "parent" interpreter can diddle signals */
2688 if (PL_curinterp != aTHX)
2691 *save = PerlProc_signal(signo, handler);
2692 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2696 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2698 #if defined(USE_ITHREADS) && !defined(WIN32)
2699 /* only "parent" interpreter can diddle signals */
2700 if (PL_curinterp != aTHX)
2703 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2706 #endif /* !HAS_SIGACTION */
2707 #endif /* !PERL_MICRO */
2709 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2710 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2712 Perl_my_pclose(pTHX_ PerlIO *ptr)
2715 Sigsave_t hstat, istat, qstat;
2721 int saved_errno = 0;
2723 int saved_win32_errno;
2727 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2729 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2731 *svp = &PL_sv_undef;
2733 if (pid == -1) { /* Opened by popen. */
2734 return my_syspclose(ptr);
2737 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2738 saved_errno = errno;
2740 saved_win32_errno = GetLastError();
2744 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2747 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2748 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2749 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2752 pid2 = wait4pid(pid, &status, 0);
2753 } while (pid2 == -1 && errno == EINTR);
2755 rsignal_restore(SIGHUP, &hstat);
2756 rsignal_restore(SIGINT, &istat);
2757 rsignal_restore(SIGQUIT, &qstat);
2760 SETERRNO(saved_errno, 0);
2763 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2765 #endif /* !DOSISH */
2767 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2769 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2775 #ifdef PERL_USES_PL_PIDSTATUS
2778 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2779 pid, rather than a string form. */
2780 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2781 if (svp && *svp != &PL_sv_undef) {
2782 *statusp = SvIVX(*svp);
2783 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2791 hv_iterinit(PL_pidstatus);
2792 if ((entry = hv_iternext(PL_pidstatus))) {
2793 SV * const sv = hv_iterval(PL_pidstatus,entry);
2795 const char * const spid = hv_iterkey(entry,&len);
2797 assert (len == sizeof(Pid_t));
2798 memcpy((char *)&pid, spid, len);
2799 *statusp = SvIVX(sv);
2800 /* The hash iterator is currently on this entry, so simply
2801 calling hv_delete would trigger the lazy delete, which on
2802 aggregate does more work, beacuse next call to hv_iterinit()
2803 would spot the flag, and have to call the delete routine,
2804 while in the meantime any new entries can't re-use that
2806 hv_iterinit(PL_pidstatus);
2807 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2814 # ifdef HAS_WAITPID_RUNTIME
2815 if (!HAS_WAITPID_RUNTIME)
2818 result = PerlProc_waitpid(pid,statusp,flags);
2821 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2822 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2825 #ifdef PERL_USES_PL_PIDSTATUS
2826 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2831 Perl_croak(aTHX_ "Can't do waitpid with flags");
2833 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2834 pidgone(result,*statusp);
2840 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2843 if (result < 0 && errno == EINTR) {
2848 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2850 #ifdef PERL_USES_PL_PIDSTATUS
2852 Perl_pidgone(pTHX_ Pid_t pid, int status)
2856 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2857 SvUPGRADE(sv,SVt_IV);
2858 SvIV_set(sv, status);
2863 #if defined(atarist) || defined(OS2) || defined(EPOC)
2866 int /* Cannot prototype with I32
2868 my_syspclose(PerlIO *ptr)
2871 Perl_my_pclose(pTHX_ PerlIO *ptr)
2874 /* Needs work for PerlIO ! */
2875 FILE * const f = PerlIO_findFILE(ptr);
2876 const I32 result = pclose(f);
2877 PerlIO_releaseFILE(ptr,f);
2885 Perl_my_pclose(pTHX_ PerlIO *ptr)
2887 /* Needs work for PerlIO ! */
2888 FILE * const f = PerlIO_findFILE(ptr);
2889 I32 result = djgpp_pclose(f);
2890 result = (result << 8) & 0xff00;
2891 PerlIO_releaseFILE(ptr,f);
2897 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2900 register const char * const frombase = from;
2901 PERL_UNUSED_CONTEXT;
2904 register const char c = *from;
2909 while (count-- > 0) {
2910 for (todo = len; todo > 0; todo--) {
2919 Perl_same_dirent(pTHX_ const char *a, const char *b)
2921 char *fa = strrchr(a,'/');
2922 char *fb = strrchr(b,'/');
2925 SV * const tmpsv = sv_newmortal();
2938 sv_setpvn(tmpsv, ".", 1);
2940 sv_setpvn(tmpsv, a, fa - a);
2941 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2944 sv_setpvn(tmpsv, ".", 1);
2946 sv_setpvn(tmpsv, b, fb - b);
2947 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2949 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2950 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2952 #endif /* !HAS_RENAME */
2955 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2956 const char *const *const search_ext, I32 flags)
2959 const char *xfound = NULL;
2960 char *xfailed = NULL;
2961 char tmpbuf[MAXPATHLEN];
2965 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2966 # define SEARCH_EXTS ".bat", ".cmd", NULL
2967 # define MAX_EXT_LEN 4
2970 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2971 # define MAX_EXT_LEN 4
2974 # define SEARCH_EXTS ".pl", ".com", NULL
2975 # define MAX_EXT_LEN 4
2977 /* additional extensions to try in each dir if scriptname not found */
2979 static const char *const exts[] = { SEARCH_EXTS };
2980 const char *const *const ext = search_ext ? search_ext : exts;
2981 int extidx = 0, i = 0;
2982 const char *curext = NULL;
2984 PERL_UNUSED_ARG(search_ext);
2985 # define MAX_EXT_LEN 0
2989 * If dosearch is true and if scriptname does not contain path
2990 * delimiters, search the PATH for scriptname.
2992 * If SEARCH_EXTS is also defined, will look for each
2993 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2994 * while searching the PATH.
2996 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2997 * proceeds as follows:
2998 * If DOSISH or VMSISH:
2999 * + look for ./scriptname{,.foo,.bar}
3000 * + search the PATH for scriptname{,.foo,.bar}
3003 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3004 * this will not look in '.' if it's not in the PATH)
3009 # ifdef ALWAYS_DEFTYPES
3010 len = strlen(scriptname);
3011 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3012 int idx = 0, deftypes = 1;
3015 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3018 int idx = 0, deftypes = 1;
3021 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3023 /* The first time through, just add SEARCH_EXTS to whatever we
3024 * already have, so we can check for default file types. */
3026 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3032 if ((strlen(tmpbuf) + strlen(scriptname)
3033 + MAX_EXT_LEN) >= sizeof tmpbuf)
3034 continue; /* don't search dir with too-long name */
3035 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3039 if (strEQ(scriptname, "-"))
3041 if (dosearch) { /* Look in '.' first. */
3042 const char *cur = scriptname;
3044 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3046 if (strEQ(ext[i++],curext)) {
3047 extidx = -1; /* already has an ext */
3052 DEBUG_p(PerlIO_printf(Perl_debug_log,
3053 "Looking for %s\n",cur));
3054 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3055 && !S_ISDIR(PL_statbuf.st_mode)) {
3063 if (cur == scriptname) {
3064 len = strlen(scriptname);
3065 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3067 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3070 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3071 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3076 #ifdef MACOS_TRADITIONAL
3077 if (dosearch && !strchr(scriptname, ':') &&
3078 (s = PerlEnv_getenv("Commands")))
3080 if (dosearch && !strchr(scriptname, '/')
3082 && !strchr(scriptname, '\\')
3084 && (s = PerlEnv_getenv("PATH")))
3089 PL_bufend = s + strlen(s);
3090 while (s < PL_bufend) {
3091 #ifdef MACOS_TRADITIONAL
3092 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3096 #if defined(atarist) || defined(DOSISH)
3101 && *s != ';'; len++, s++) {
3102 if (len < sizeof tmpbuf)
3105 if (len < sizeof tmpbuf)
3107 #else /* ! (atarist || DOSISH) */
3108 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3111 #endif /* ! (atarist || DOSISH) */
3112 #endif /* MACOS_TRADITIONAL */
3115 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3116 continue; /* don't search dir with too-long name */
3117 #ifdef MACOS_TRADITIONAL
3118 if (len && tmpbuf[len - 1] != ':')
3119 tmpbuf[len++] = ':';
3122 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3123 && tmpbuf[len - 1] != '/'
3124 && tmpbuf[len - 1] != '\\'
3127 tmpbuf[len++] = '/';
3128 if (len == 2 && tmpbuf[0] == '.')
3131 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3135 len = strlen(tmpbuf);
3136 if (extidx > 0) /* reset after previous loop */
3140 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3141 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3142 if (S_ISDIR(PL_statbuf.st_mode)) {
3146 } while ( retval < 0 /* not there */
3147 && extidx>=0 && ext[extidx] /* try an extension? */
3148 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3153 if (S_ISREG(PL_statbuf.st_mode)
3154 && cando(S_IRUSR,TRUE,&PL_statbuf)
3155 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3156 && cando(S_IXUSR,TRUE,&PL_statbuf)
3160 xfound = tmpbuf; /* bingo! */
3164 xfailed = savepv(tmpbuf);
3167 if (!xfound && !seen_dot && !xfailed &&
3168 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3169 || S_ISDIR(PL_statbuf.st_mode)))
3171 seen_dot = 1; /* Disable message. */
3173 if (flags & 1) { /* do or die? */
3174 Perl_croak(aTHX_ "Can't %s %s%s%s",
3175 (xfailed ? "execute" : "find"),
3176 (xfailed ? xfailed : scriptname),
3177 (xfailed ? "" : " on PATH"),
3178 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3183 scriptname = xfound;
3185 return (scriptname ? savepv(scriptname) : NULL);
3188 #ifndef PERL_GET_CONTEXT_DEFINED
3191 Perl_get_context(void)
3194 #if defined(USE_ITHREADS)
3195 # ifdef OLD_PTHREADS_API
3197 if (pthread_getspecific(PL_thr_key, &t))
3198 Perl_croak_nocontext("panic: pthread_getspecific");
3201 # ifdef I_MACH_CTHREADS
3202 return (void*)cthread_data(cthread_self());
3204 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3213 Perl_set_context(void *t)
3216 #if defined(USE_ITHREADS)
3217 # ifdef I_MACH_CTHREADS
3218 cthread_set_data(cthread_self(), t);
3220 if (pthread_setspecific(PL_thr_key, t))
3221 Perl_croak_nocontext("panic: pthread_setspecific");
3228 #endif /* !PERL_GET_CONTEXT_DEFINED */
3230 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3239 Perl_get_op_names(pTHX)
3241 PERL_UNUSED_CONTEXT;
3242 return (char **)PL_op_name;
3246 Perl_get_op_descs(pTHX)
3248 PERL_UNUSED_CONTEXT;
3249 return (char **)PL_op_desc;
3253 Perl_get_no_modify(pTHX)
3255 PERL_UNUSED_CONTEXT;
3256 return PL_no_modify;
3260 Perl_get_opargs(pTHX)
3262 PERL_UNUSED_CONTEXT;
3263 return (U32 *)PL_opargs;
3267 Perl_get_ppaddr(pTHX)
3270 PERL_UNUSED_CONTEXT;
3271 return (PPADDR_t*)PL_ppaddr;
3274 #ifndef HAS_GETENV_LEN
3276 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3278 char * const env_trans = PerlEnv_getenv(env_elem);
3279 PERL_UNUSED_CONTEXT;
3281 *len = strlen(env_trans);
3288 Perl_get_vtbl(pTHX_ int vtbl_id)
3290 const MGVTBL* result;
3291 PERL_UNUSED_CONTEXT;
3295 result = &PL_vtbl_sv;
3298 result = &PL_vtbl_env;
3300 case want_vtbl_envelem:
3301 result = &PL_vtbl_envelem;
3304 result = &PL_vtbl_sig;
3306 case want_vtbl_sigelem:
3307 result = &PL_vtbl_sigelem;
3309 case want_vtbl_pack:
3310 result = &PL_vtbl_pack;
3312 case want_vtbl_packelem:
3313 result = &PL_vtbl_packelem;
3315 case want_vtbl_dbline:
3316 result = &PL_vtbl_dbline;
3319 result = &PL_vtbl_isa;
3321 case want_vtbl_isaelem:
3322 result = &PL_vtbl_isaelem;
3324 case want_vtbl_arylen:
3325 result = &PL_vtbl_arylen;
3327 case want_vtbl_mglob:
3328 result = &PL_vtbl_mglob;
3330 case want_vtbl_nkeys:
3331 result = &PL_vtbl_nkeys;
3333 case want_vtbl_taint:
3334 result = &PL_vtbl_taint;
3336 case want_vtbl_substr:
3337 result = &PL_vtbl_substr;
3340 result = &PL_vtbl_vec;
3343 result = &PL_vtbl_pos;
3346 result = &PL_vtbl_bm;
3349 result = &PL_vtbl_fm;
3351 case want_vtbl_uvar:
3352 result = &PL_vtbl_uvar;
3354 case want_vtbl_defelem:
3355 result = &PL_vtbl_defelem;
3357 case want_vtbl_regexp:
3358 result = &PL_vtbl_regexp;
3360 case want_vtbl_regdata:
3361 result = &PL_vtbl_regdata;
3363 case want_vtbl_regdatum:
3364 result = &PL_vtbl_regdatum;
3366 #ifdef USE_LOCALE_COLLATE
3367 case want_vtbl_collxfrm:
3368 result = &PL_vtbl_collxfrm;
3371 case want_vtbl_amagic:
3372 result = &PL_vtbl_amagic;
3374 case want_vtbl_amagicelem:
3375 result = &PL_vtbl_amagicelem;
3377 case want_vtbl_backref:
3378 result = &PL_vtbl_backref;
3380 case want_vtbl_utf8:
3381 result = &PL_vtbl_utf8;
3387 return (MGVTBL*)result;
3391 Perl_my_fflush_all(pTHX)
3393 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3394 return PerlIO_flush(NULL);
3396 # if defined(HAS__FWALK)
3397 extern int fflush(FILE *);
3398 /* undocumented, unprototyped, but very useful BSDism */
3399 extern void _fwalk(int (*)(FILE *));
3403 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3405 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3406 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3408 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3409 open_max = sysconf(_SC_OPEN_MAX);
3412 open_max = FOPEN_MAX;
3415 open_max = OPEN_MAX;
3426 for (i = 0; i < open_max; i++)
3427 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3428 STDIO_STREAM_ARRAY[i]._file < open_max &&
3429 STDIO_STREAM_ARRAY[i]._flag)
3430 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3434 SETERRNO(EBADF,RMS_IFI);
3441 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3443 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3445 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3446 if (ckWARN(WARN_IO)) {
3447 const char * const direction =
3448 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3450 Perl_warner(aTHX_ packWARN(WARN_IO),
3451 "Filehandle %s opened only for %sput",
3454 Perl_warner(aTHX_ packWARN(WARN_IO),
3455 "Filehandle opened only for %sput", direction);
3462 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3464 warn_type = WARN_CLOSED;
3468 warn_type = WARN_UNOPENED;
3471 if (ckWARN(warn_type)) {
3472 const char * const pars =
3473 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3474 const char * const func =
3476 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3477 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3478 op < 0 ? "" : /* handle phoney cases */
3480 const char * const type =
3482 (OP_IS_SOCKET(op) ||
3483 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3484 "socket" : "filehandle");
3485 if (name && *name) {
3486 Perl_warner(aTHX_ packWARN(warn_type),
3487 "%s%s on %s %s %s", func, pars, vile, type, name);
3488 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3490 aTHX_ packWARN(warn_type),
3491 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3496 Perl_warner(aTHX_ packWARN(warn_type),
3497 "%s%s on %s %s", func, pars, vile, type);
3498 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3500 aTHX_ packWARN(warn_type),
3501 "\t(Are you trying to call %s%s on dirhandle?)\n",
3510 /* in ASCII order, not that it matters */
3511 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3514 Perl_ebcdic_control(pTHX_ int ch)
3522 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3523 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3526 if (ctlp == controllablechars)
3527 return('\177'); /* DEL */
3529 return((unsigned char)(ctlp - controllablechars - 1));
3530 } else { /* Want uncontrol */
3531 if (ch == '\177' || ch == -1)
3533 else if (ch == '\157')
3535 else if (ch == '\174')
3537 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3539 else if (ch == '\155')
3541 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3542 return(controllablechars[ch+1]);
3544 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3549 /* To workaround core dumps from the uninitialised tm_zone we get the
3550 * system to give us a reasonable struct to copy. This fix means that
3551 * strftime uses the tm_zone and tm_gmtoff values returned by
3552 * localtime(time()). That should give the desired result most of the
3553 * time. But probably not always!
3555 * This does not address tzname aspects of NETaa14816.
3560 # ifndef STRUCT_TM_HASZONE
3561 # define STRUCT_TM_HASZONE
3565 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3566 # ifndef HAS_TM_TM_ZONE
3567 # define HAS_TM_TM_ZONE
3572 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3574 #ifdef HAS_TM_TM_ZONE
3576 const struct tm* my_tm;
3578 my_tm = localtime(&now);
3580 Copy(my_tm, ptm, 1, struct tm);
3582 PERL_UNUSED_ARG(ptm);
3587 * mini_mktime - normalise struct tm values without the localtime()
3588 * semantics (and overhead) of mktime().
3591 Perl_mini_mktime(pTHX_ struct tm *ptm)
3595 int month, mday, year, jday;
3596 int odd_cent, odd_year;
3597 PERL_UNUSED_CONTEXT;
3599 #define DAYS_PER_YEAR 365
3600 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3601 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3602 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3603 #define SECS_PER_HOUR (60*60)
3604 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3605 /* parentheses deliberately absent on these two, otherwise they don't work */
3606 #define MONTH_TO_DAYS 153/5
3607 #define DAYS_TO_MONTH 5/153
3608 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3609 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3610 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3611 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3614 * Year/day algorithm notes:
3616 * With a suitable offset for numeric value of the month, one can find
3617 * an offset into the year by considering months to have 30.6 (153/5) days,
3618 * using integer arithmetic (i.e., with truncation). To avoid too much
3619 * messing about with leap days, we consider January and February to be
3620 * the 13th and 14th month of the previous year. After that transformation,
3621 * we need the month index we use to be high by 1 from 'normal human' usage,
3622 * so the month index values we use run from 4 through 15.
3624 * Given that, and the rules for the Gregorian calendar (leap years are those
3625 * divisible by 4 unless also divisible by 100, when they must be divisible
3626 * by 400 instead), we can simply calculate the number of days since some
3627 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3628 * the days we derive from our month index, and adding in the day of the
3629 * month. The value used here is not adjusted for the actual origin which
3630 * it normally would use (1 January A.D. 1), since we're not exposing it.
3631 * We're only building the value so we can turn around and get the
3632 * normalised values for the year, month, day-of-month, and day-of-year.
3634 * For going backward, we need to bias the value we're using so that we find
3635 * the right year value. (Basically, we don't want the contribution of
3636 * March 1st to the number to apply while deriving the year). Having done
3637 * that, we 'count up' the contribution to the year number by accounting for
3638 * full quadracenturies (400-year periods) with their extra leap days, plus
3639 * the contribution from full centuries (to avoid counting in the lost leap
3640 * days), plus the contribution from full quad-years (to count in the normal
3641 * leap days), plus the leftover contribution from any non-leap years.
3642 * At this point, if we were working with an actual leap day, we'll have 0
3643 * days left over. This is also true for March 1st, however. So, we have
3644 * to special-case that result, and (earlier) keep track of the 'odd'
3645 * century and year contributions. If we got 4 extra centuries in a qcent,
3646 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3647 * Otherwise, we add back in the earlier bias we removed (the 123 from
3648 * figuring in March 1st), find the month index (integer division by 30.6),
3649 * and the remainder is the day-of-month. We then have to convert back to
3650 * 'real' months (including fixing January and February from being 14/15 in
3651 * the previous year to being in the proper year). After that, to get
3652 * tm_yday, we work with the normalised year and get a new yearday value for
3653 * January 1st, which we subtract from the yearday value we had earlier,
3654 * representing the date we've re-built. This is done from January 1
3655 * because tm_yday is 0-origin.
3657 * Since POSIX time routines are only guaranteed to work for times since the
3658 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3659 * applies Gregorian calendar rules even to dates before the 16th century
3660 * doesn't bother me. Besides, you'd need cultural context for a given
3661 * date to know whether it was Julian or Gregorian calendar, and that's
3662 * outside the scope for this routine. Since we convert back based on the
3663 * same rules we used to build the yearday, you'll only get strange results
3664 * for input which needed normalising, or for the 'odd' century years which
3665 * were leap years in the Julian calander but not in the Gregorian one.
3666 * I can live with that.
3668 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3669 * that's still outside the scope for POSIX time manipulation, so I don't
3673 year = 1900 + ptm->tm_year;
3674 month = ptm->tm_mon;
3675 mday = ptm->tm_mday;
3676 /* allow given yday with no month & mday to dominate the result */
3677 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3680 jday = 1 + ptm->tm_yday;
3689 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3690 yearday += month*MONTH_TO_DAYS + mday + jday;
3692 * Note that we don't know when leap-seconds were or will be,
3693 * so we have to trust the user if we get something which looks
3694 * like a sensible leap-second. Wild values for seconds will
3695 * be rationalised, however.
3697 if ((unsigned) ptm->tm_sec <= 60) {
3704 secs += 60 * ptm->tm_min;
3705 secs += SECS_PER_HOUR * ptm->tm_hour;
3707 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3708 /* got negative remainder, but need positive time */
3709 /* back off an extra day to compensate */
3710 yearday += (secs/SECS_PER_DAY)-1;
3711 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3714 yearday += (secs/SECS_PER_DAY);
3715 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3718 else if (secs >= SECS_PER_DAY) {
3719 yearday += (secs/SECS_PER_DAY);
3720 secs %= SECS_PER_DAY;
3722 ptm->tm_hour = secs/SECS_PER_HOUR;
3723 secs %= SECS_PER_HOUR;
3724 ptm->tm_min = secs/60;
3726 ptm->tm_sec += secs;
3727 /* done with time of day effects */
3729 * The algorithm for yearday has (so far) left it high by 428.
3730 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3731 * bias it by 123 while trying to figure out what year it
3732 * really represents. Even with this tweak, the reverse
3733 * translation fails for years before A.D. 0001.
3734 * It would still fail for Feb 29, but we catch that one below.
3736 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3737 yearday -= YEAR_ADJUST;
3738 year = (yearday / DAYS_PER_QCENT) * 400;
3739 yearday %= DAYS_PER_QCENT;
3740 odd_cent = yearday / DAYS_PER_CENT;
3741 year += odd_cent * 100;
3742 yearday %= DAYS_PER_CENT;
3743 year += (yearday / DAYS_PER_QYEAR) * 4;
3744 yearday %= DAYS_PER_QYEAR;
3745 odd_year = yearday / DAYS_PER_YEAR;
3747 yearday %= DAYS_PER_YEAR;
3748 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3753 yearday += YEAR_ADJUST; /* recover March 1st crock */
3754 month = yearday*DAYS_TO_MONTH;
3755 yearday -= month*MONTH_TO_DAYS;
3756 /* recover other leap-year adjustment */
3765 ptm->tm_year = year - 1900;
3767 ptm->tm_mday = yearday;
3768 ptm->tm_mon = month;
3772 ptm->tm_mon = month - 1;
3774 /* re-build yearday based on Jan 1 to get tm_yday */
3776 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3777 yearday += 14*MONTH_TO_DAYS + 1;
3778 ptm->tm_yday = jday - yearday;
3779 /* fix tm_wday if not overridden by caller */
3780 if ((unsigned)ptm->tm_wday > 6)
3781 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3785 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)
3793 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3796 mytm.tm_hour = hour;
3797 mytm.tm_mday = mday;
3799 mytm.tm_year = year;
3800 mytm.tm_wday = wday;
3801 mytm.tm_yday = yday;
3802 mytm.tm_isdst = isdst;
3804 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3805 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3810 #ifdef HAS_TM_TM_GMTOFF
3811 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3813 #ifdef HAS_TM_TM_ZONE
3814 mytm.tm_zone = mytm2.tm_zone;
3819 Newx(buf, buflen, char);
3820 len = strftime(buf, buflen, fmt, &mytm);
3822 ** The following is needed to handle to the situation where
3823 ** tmpbuf overflows. Basically we want to allocate a buffer
3824 ** and try repeatedly. The reason why it is so complicated
3825 ** is that getting a return value of 0 from strftime can indicate
3826 ** one of the following:
3827 ** 1. buffer overflowed,
3828 ** 2. illegal conversion specifier, or
3829 ** 3. the format string specifies nothing to be returned(not
3830 ** an error). This could be because format is an empty string
3831 ** or it specifies %p that yields an empty string in some locale.
3832 ** If there is a better way to make it portable, go ahead by
3835 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3838 /* Possibly buf overflowed - try again with a bigger buf */
3839 const int fmtlen = strlen(fmt);
3840 int bufsize = fmtlen + buflen;
3842 Newx(buf, bufsize, char);
3844 buflen = strftime(buf, bufsize, fmt, &mytm);
3845 if (buflen > 0 && buflen < bufsize)
3847 /* heuristic to prevent out-of-memory errors */
3848 if (bufsize > 100*fmtlen) {
3854 Renew(buf, bufsize, char);
3859 Perl_croak(aTHX_ "panic: no strftime");
3865 #define SV_CWD_RETURN_UNDEF \
3866 sv_setsv(sv, &PL_sv_undef); \
3869 #define SV_CWD_ISDOT(dp) \
3870 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3871 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3874 =head1 Miscellaneous Functions
3876 =for apidoc getcwd_sv
3878 Fill the sv with current working directory
3883 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3884 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3885 * getcwd(3) if available
3886 * Comments from the orignal:
3887 * This is a faster version of getcwd. It's also more dangerous
3888 * because you might chdir out of a directory that you can't chdir
3892 Perl_getcwd_sv(pTHX_ register SV *sv)
3896 #ifndef INCOMPLETE_TAINTS
3902 char buf[MAXPATHLEN];
3904 /* Some getcwd()s automatically allocate a buffer of the given
3905 * size from the heap if they are given a NULL buffer pointer.
3906 * The problem is that this behaviour is not portable. */
3907 if (getcwd(buf, sizeof(buf) - 1)) {
3912 sv_setsv(sv, &PL_sv_undef);
3920 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3924 SvUPGRADE(sv, SVt_PV);
3926 if (PerlLIO_lstat(".", &statbuf) < 0) {
3927 SV_CWD_RETURN_UNDEF;
3930 orig_cdev = statbuf.st_dev;
3931 orig_cino = statbuf.st_ino;
3940 if (PerlDir_chdir("..") < 0) {
3941 SV_CWD_RETURN_UNDEF;
3943 if (PerlLIO_stat(".", &statbuf) < 0) {
3944 SV_CWD_RETURN_UNDEF;
3947 cdev = statbuf.st_dev;
3948 cino = statbuf.st_ino;
3950 if (odev == cdev && oino == cino) {
3953 if (!(dir = PerlDir_open("."))) {
3954 SV_CWD_RETURN_UNDEF;
3957 while ((dp = PerlDir_read(dir)) != NULL) {
3959 const int namelen = dp->d_namlen;
3961 const int namelen = strlen(dp->d_name);
3964 if (SV_CWD_ISDOT(dp)) {
3968 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3969 SV_CWD_RETURN_UNDEF;
3972 tdev = statbuf.st_dev;
3973 tino = statbuf.st_ino;
3974 if (tino == oino && tdev == odev) {
3980 SV_CWD_RETURN_UNDEF;
3983 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3984 SV_CWD_RETURN_UNDEF;
3987 SvGROW(sv, pathlen + namelen + 1);
3991 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3994 /* prepend current directory to the front */
3996 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3997 pathlen += (namelen + 1);
3999 #ifdef VOID_CLOSEDIR
4002 if (PerlDir_close(dir) < 0) {
4003 SV_CWD_RETURN_UNDEF;
4009 SvCUR_set(sv, pathlen);
4013 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4014 SV_CWD_RETURN_UNDEF;
4017 if (PerlLIO_stat(".", &statbuf) < 0) {
4018 SV_CWD_RETURN_UNDEF;
4021 cdev = statbuf.st_dev;
4022 cino = statbuf.st_ino;
4024 if (cdev != orig_cdev || cino != orig_cino) {
4025 Perl_croak(aTHX_ "Unstable directory path, "
4026 "current directory changed unexpectedly");
4038 =for apidoc scan_version
4040 Returns a pointer to the next character after the parsed
4041 version string, as well as upgrading the passed in SV to
4044 Function must be called with an already existing SV like
4047 s = scan_version(s,SV *sv, bool qv);
4049 Performs some preprocessing to the string to ensure that
4050 it has the correct characteristics of a version. Flags the
4051 object if it contains an underscore (which denotes this
4052 is a alpha version). The boolean qv denotes that the version
4053 should be interpreted as if it had multiple decimals, even if
4060 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4068 AV * const av = newAV();
4069 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4070 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4072 #ifndef NODEFAULT_SHAREKEYS
4073 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4076 while (isSPACE(*s)) /* leading whitespace is OK */
4080 s++; /* get past 'v' */
4081 qv = 1; /* force quoted version processing */
4084 start = last = pos = s;
4086 /* pre-scan the input string to check for decimals/underbars */
4087 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4092 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4096 else if ( *pos == '_' )
4099 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4101 width = pos - last - 1; /* natural width of sub-version */
4106 if ( alpha && !saw_period )
4107 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4109 if ( saw_period > 1 )
4110 qv = 1; /* force quoted version processing */
4115 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4117 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4118 if ( !qv && width < 3 )
4119 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4121 while (isDIGIT(*pos))
4123 if (!isALPHA(*pos)) {
4129 /* this is atoi() that delimits on underscores */
4130 const char *end = pos;
4134 /* the following if() will only be true after the decimal
4135 * point of a version originally created with a bare
4136 * floating point number, i.e. not quoted in any way
4138 if ( !qv && s > start && saw_period == 1 ) {
4142 rev += (*s - '0') * mult;
4144 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4145 Perl_croak(aTHX_ "Integer overflow in version");
4152 while (--end >= s) {
4154 rev += (*end - '0') * mult;
4156 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4157 Perl_croak(aTHX_ "Integer overflow in version");
4162 /* Append revision */
4163 av_push(av, newSViv(rev));
4166 else if ( *pos == '_' && isDIGIT(pos[1]) )
4168 else if ( isDIGIT(*pos) )
4175 while ( isDIGIT(*pos) )
4180 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4188 if ( qv ) { /* quoted versions always get at least three terms*/
4189 I32 len = av_len(av);
4190 /* This for loop appears to trigger a compiler bug on OS X, as it
4191 loops infinitely. Yes, len is negative. No, it makes no sense.
4192 Compiler in question is:
4193 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4194 for ( len = 2 - len; len > 0; len-- )
4195 av_push((AV *)sv, newSViv(0));
4199 av_push(av, newSViv(0));
4202 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4203 av_push(av, newSViv(0));
4205 /* fix RT#19517 - special case 'undef' as string */
4206 if ( *s == 'u' && strEQ(s,"undef") ) {
4210 /* And finally, store the AV in the hash */
4211 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4216 =for apidoc new_version
4218 Returns a new version object based on the passed in SV:
4220 SV *sv = new_version(SV *ver);
4222 Does not alter the passed in ver SV. See "upg_version" if you
4223 want to upgrade the SV.
4229 Perl_new_version(pTHX_ SV *ver)
4232 SV * const rv = newSV(0);
4233 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4236 AV * const av = newAV();
4238 /* This will get reblessed later if a derived class*/
4239 SV * const hv = newSVrv(rv, "version");
4240 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4241 #ifndef NODEFAULT_SHAREKEYS
4242 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4248 /* Begin copying all of the elements */
4249 if ( hv_exists((HV *)ver, "qv", 2) )
4250 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4252 if ( hv_exists((HV *)ver, "alpha", 5) )
4253 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4255 if ( hv_exists((HV*)ver, "width", 5 ) )
4257 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4258 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4261 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4262 /* This will get reblessed later if a derived class*/
4263 for ( key = 0; key <= av_len(sav); key++ )
4265 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4266 av_push(av, newSViv(rev));
4269 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4274 const MAGIC* const mg = SvVSTRING_mg(ver);
4275 if ( mg ) { /* already a v-string */
4276 const STRLEN len = mg->mg_len;
4277 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4278 sv_setpvn(rv,version,len);
4283 sv_setsv(rv,ver); /* make a duplicate */
4288 return upg_version(rv);
4292 =for apidoc upg_version
4294 In-place upgrade of the supplied SV to a version object.
4296 SV *sv = upg_version(SV *sv);
4298 Returns a pointer to the upgraded SV.
4304 Perl_upg_version(pTHX_ SV *ver)
4306 const char *version, *s;
4312 if ( SvNOK(ver) ) /* may get too much accuracy */
4315 #ifdef USE_LOCALE_NUMERIC
4316 char *loc = setlocale(LC_NUMERIC, "C");
4318 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4319 #ifdef USE_LOCALE_NUMERIC
4320 setlocale(LC_NUMERIC, loc);
4322 while (tbuf[len-1] == '0' && len > 0) len--;
4323 version = savepvn(tbuf, len);
4326 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4327 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4331 else /* must be a string or something like a string */
4333 version = savepv(SvPV_nolen(ver));
4336 s = scan_version(version, ver, qv);
4338 if(ckWARN(WARN_MISC))
4339 Perl_warner(aTHX_ packWARN(WARN_MISC),
4340 "Version string '%s' contains invalid data; "
4341 "ignoring: '%s'", version, s);
4349 Validates that the SV contains a valid version object.
4351 bool vverify(SV *vobj);
4353 Note that it only confirms the bare minimum structure (so as not to get
4354 confused by derived classes which may contain additional hash entries):
4358 =item * The SV contains a [reference to a] hash
4360 =item * The hash contains a "version" key
4362 =item * The "version" key has [a reference to] an AV as its value
4370 Perl_vverify(pTHX_ SV *vs)
4376 /* see if the appropriate elements exist */
4377 if ( SvTYPE(vs) == SVt_PVHV
4378 && hv_exists((HV*)vs, "version", 7)
4379 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4380 && SvTYPE(sv) == SVt_PVAV )
4389 Accepts a version object and returns the normalized floating
4390 point representation. Call like:
4394 NOTE: you can pass either the object directly or the SV
4395 contained within the RV.
4401 Perl_vnumify(pTHX_ SV *vs)
4406 SV * const sv = newSV(0);
4412 Perl_croak(aTHX_ "Invalid version object");
4414 /* see if various flags exist */
4415 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4417 if ( hv_exists((HV*)vs, "width", 5 ) )
4418 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4423 /* attempt to retrieve the version array */
4424 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4436 digit = SvIV(*av_fetch(av, 0, 0));
4437 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4438 for ( i = 1 ; i < len ; i++ )
4440 digit = SvIV(*av_fetch(av, i, 0));
4442 const int denom = (width == 2 ? 10 : 100);
4443 const div_t term = div((int)PERL_ABS(digit),denom);
4444 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4447 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4453 digit = SvIV(*av_fetch(av, len, 0));
4454 if ( alpha && width == 3 ) /* alpha version */
4456 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4460 sv_catpvs(sv, "000");
4468 Accepts a version object and returns the normalized string
4469 representation. Call like:
4473 NOTE: you can pass either the object directly or the SV
4474 contained within the RV.
4480 Perl_vnormal(pTHX_ SV *vs)
4484 SV * const sv = newSV(0);
4490 Perl_croak(aTHX_ "Invalid version object");
4492 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4494 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4502 digit = SvIV(*av_fetch(av, 0, 0));
4503 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4504 for ( i = 1 ; i < len ; i++ ) {
4505 digit = SvIV(*av_fetch(av, i, 0));
4506 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4511 /* handle last digit specially */
4512 digit = SvIV(*av_fetch(av, len, 0));
4514 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4516 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4519 if ( len <= 2 ) { /* short version, must be at least three */
4520 for ( len = 2 - len; len != 0; len-- )
4527 =for apidoc vstringify
4529 In order to maintain maximum compatibility with earlier versions
4530 of Perl, this function will return either the floating point
4531 notation or the multiple dotted notation, depending on whether
4532 the original version contained 1 or more dots, respectively
4538 Perl_vstringify(pTHX_ SV *vs)
4544 Perl_croak(aTHX_ "Invalid version object");
4546 if ( hv_exists((HV *)vs, "qv", 2) )
4555 Version object aware cmp. Both operands must already have been
4556 converted into version objects.
4562 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4565 bool lalpha = FALSE;
4566 bool ralpha = FALSE;
4575 if ( !vverify(lhv) )
4576 Perl_croak(aTHX_ "Invalid version object");
4578 if ( !vverify(rhv) )
4579 Perl_croak(aTHX_ "Invalid version object");
4581 /* get the left hand term */
4582 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4583 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4586 /* and the right hand term */
4587 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4588 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4596 while ( i <= m && retval == 0 )
4598 left = SvIV(*av_fetch(lav,i,0));
4599 right = SvIV(*av_fetch(rav,i,0));
4607 /* tiebreaker for alpha with identical terms */
4608 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4610 if ( lalpha && !ralpha )
4614 else if ( ralpha && !lalpha)
4620 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4624 while ( i <= r && retval == 0 )
4626 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4627 retval = -1; /* not a match after all */
4633 while ( i <= l && retval == 0 )
4635 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4636 retval = +1; /* not a match after all */
4644 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4645 # define EMULATE_SOCKETPAIR_UDP
4648 #ifdef EMULATE_SOCKETPAIR_UDP
4650 S_socketpair_udp (int fd[2]) {
4652 /* Fake a datagram socketpair using UDP to localhost. */
4653 int sockets[2] = {-1, -1};
4654 struct sockaddr_in addresses[2];
4656 Sock_size_t size = sizeof(struct sockaddr_in);
4657 unsigned short port;
4660 memset(&addresses, 0, sizeof(addresses));
4663 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4664 if (sockets[i] == -1)
4665 goto tidy_up_and_fail;
4667 addresses[i].sin_family = AF_INET;
4668 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4669 addresses[i].sin_port = 0; /* kernel choses port. */
4670 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4671 sizeof(struct sockaddr_in)) == -1)
4672 goto tidy_up_and_fail;
4675 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4676 for each connect the other socket to it. */
4679 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4681 goto tidy_up_and_fail;
4682 if (size != sizeof(struct sockaddr_in))
4683 goto abort_tidy_up_and_fail;
4684 /* !1 is 0, !0 is 1 */
4685 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4686 sizeof(struct sockaddr_in)) == -1)
4687 goto tidy_up_and_fail;
4690 /* Now we have 2 sockets connected to each other. I don't trust some other
4691 process not to have already sent a packet to us (by random) so send
4692 a packet from each to the other. */
4695 /* I'm going to send my own port number. As a short.
4696 (Who knows if someone somewhere has sin_port as a bitfield and needs
4697 this routine. (I'm assuming crays have socketpair)) */
4698 port = addresses[i].sin_port;
4699 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4700 if (got != sizeof(port)) {
4702 goto tidy_up_and_fail;
4703 goto abort_tidy_up_and_fail;
4707 /* Packets sent. I don't trust them to have arrived though.
4708 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4709 connect to localhost will use a second kernel thread. In 2.6 the
4710 first thread running the connect() returns before the second completes,
4711 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4712 returns 0. Poor programs have tripped up. One poor program's authors'
4713 had a 50-1 reverse stock split. Not sure how connected these were.)
4714 So I don't trust someone not to have an unpredictable UDP stack.
4718 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4719 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4723 FD_SET((unsigned int)sockets[0], &rset);
4724 FD_SET((unsigned int)sockets[1], &rset);
4726 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4727 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4728 || !FD_ISSET(sockets[1], &rset)) {
4729 /* I hope this is portable and appropriate. */
4731 goto tidy_up_and_fail;
4732 goto abort_tidy_up_and_fail;
4736 /* And the paranoia department even now doesn't trust it to have arrive
4737 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4739 struct sockaddr_in readfrom;
4740 unsigned short buffer[2];
4745 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4746 sizeof(buffer), MSG_DONTWAIT,
4747 (struct sockaddr *) &readfrom, &size);
4749 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4751 (struct sockaddr *) &readfrom, &size);
4755 goto tidy_up_and_fail;
4756 if (got != sizeof(port)
4757 || size != sizeof(struct sockaddr_in)
4758 /* Check other socket sent us its port. */
4759 || buffer[0] != (unsigned short) addresses[!i].sin_port
4760 /* Check kernel says we got the datagram from that socket */
4761 || readfrom.sin_family != addresses[!i].sin_family
4762 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4763 || readfrom.sin_port != addresses[!i].sin_port)
4764 goto abort_tidy_up_and_fail;
4767 /* My caller (my_socketpair) has validated that this is non-NULL */
4770 /* I hereby declare this connection open. May God bless all who cross
4774 abort_tidy_up_and_fail:
4775 errno = ECONNABORTED;
4778 const int save_errno = errno;
4779 if (sockets[0] != -1)
4780 PerlLIO_close(sockets[0]);
4781 if (sockets[1] != -1)
4782 PerlLIO_close(sockets[1]);
4787 #endif /* EMULATE_SOCKETPAIR_UDP */
4789 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4791 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4792 /* Stevens says that family must be AF_LOCAL, protocol 0.
4793 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4798 struct sockaddr_in listen_addr;
4799 struct sockaddr_in connect_addr;
4804 || family != AF_UNIX
4807 errno = EAFNOSUPPORT;
4815 #ifdef EMULATE_SOCKETPAIR_UDP
4816 if (type == SOCK_DGRAM)
4817 return S_socketpair_udp(fd);
4820 listener = PerlSock_socket(AF_INET, type, 0);
4823 memset(&listen_addr, 0, sizeof(listen_addr));
4824 listen_addr.sin_family = AF_INET;
4825 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4826 listen_addr.sin_port = 0; /* kernel choses port. */
4827 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4828 sizeof(listen_addr)) == -1)
4829 goto tidy_up_and_fail;
4830 if (PerlSock_listen(listener, 1) == -1)
4831 goto tidy_up_and_fail;
4833 connector = PerlSock_socket(AF_INET, type, 0);
4834 if (connector == -1)
4835 goto tidy_up_and_fail;
4836 /* We want to find out the port number to connect to. */
4837 size = sizeof(connect_addr);
4838 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4840 goto tidy_up_and_fail;
4841 if (size != sizeof(connect_addr))
4842 goto abort_tidy_up_and_fail;
4843 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4844 sizeof(connect_addr)) == -1)
4845 goto tidy_up_and_fail;
4847 size = sizeof(listen_addr);
4848 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4851 goto tidy_up_and_fail;
4852 if (size != sizeof(listen_addr))
4853 goto abort_tidy_up_and_fail;
4854 PerlLIO_close(listener);
4855 /* Now check we are talking to ourself by matching port and host on the
4857 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4859 goto tidy_up_and_fail;
4860 if (size != sizeof(connect_addr)
4861 || listen_addr.sin_family != connect_addr.sin_family
4862 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4863 || listen_addr.sin_port != connect_addr.sin_port) {
4864 goto abort_tidy_up_and_fail;
4870 abort_tidy_up_and_fail:
4872 errno = ECONNABORTED; /* This would be the standard thing to do. */
4874 # ifdef ECONNREFUSED
4875 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4877 errno = ETIMEDOUT; /* Desperation time. */
4882 const int save_errno = errno;
4884 PerlLIO_close(listener);
4885 if (connector != -1)
4886 PerlLIO_close(connector);
4888 PerlLIO_close(acceptor);
4894 /* In any case have a stub so that there's code corresponding
4895 * to the my_socketpair in global.sym. */
4897 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4898 #ifdef HAS_SOCKETPAIR
4899 return socketpair(family, type, protocol, fd);
4908 =for apidoc sv_nosharing
4910 Dummy routine which "shares" an SV when there is no sharing module present.
4911 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4912 Exists to avoid test for a NULL function pointer and because it could
4913 potentially warn under some level of strict-ness.
4919 Perl_sv_nosharing(pTHX_ SV *sv)
4921 PERL_UNUSED_CONTEXT;
4922 PERL_UNUSED_ARG(sv);
4926 Perl_parse_unicode_opts(pTHX_ const char **popt)
4928 const char *p = *popt;
4933 opt = (U32) atoi(p);
4936 if (*p && *p != '\n' && *p != '\r')
4937 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4942 case PERL_UNICODE_STDIN:
4943 opt |= PERL_UNICODE_STDIN_FLAG; break;
4944 case PERL_UNICODE_STDOUT:
4945 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4946 case PERL_UNICODE_STDERR:
4947 opt |= PERL_UNICODE_STDERR_FLAG; break;
4948 case PERL_UNICODE_STD:
4949 opt |= PERL_UNICODE_STD_FLAG; break;
4950 case PERL_UNICODE_IN:
4951 opt |= PERL_UNICODE_IN_FLAG; break;
4952 case PERL_UNICODE_OUT:
4953 opt |= PERL_UNICODE_OUT_FLAG; break;
4954 case PERL_UNICODE_INOUT:
4955 opt |= PERL_UNICODE_INOUT_FLAG; break;
4956 case PERL_UNICODE_LOCALE:
4957 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4958 case PERL_UNICODE_ARGV:
4959 opt |= PERL_UNICODE_ARGV_FLAG; break;
4960 case PERL_UNICODE_UTF8CACHEASSERT:
4961 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4963 if (*p != '\n' && *p != '\r')
4965 "Unknown Unicode option letter '%c'", *p);
4971 opt = PERL_UNICODE_DEFAULT_FLAGS;
4973 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4974 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4975 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4987 * This is really just a quick hack which grabs various garbage
4988 * values. It really should be a real hash algorithm which
4989 * spreads the effect of every input bit onto every output bit,
4990 * if someone who knows about such things would bother to write it.
4991 * Might be a good idea to add that function to CORE as well.
4992 * No numbers below come from careful analysis or anything here,
4993 * except they are primes and SEED_C1 > 1E6 to get a full-width
4994 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4995 * probably be bigger too.
4998 # define SEED_C1 1000003
4999 #define SEED_C4 73819
5001 # define SEED_C1 25747
5002 #define SEED_C4 20639
5006 #define SEED_C5 26107
5008 #ifndef PERL_NO_DEV_RANDOM
5013 # include <starlet.h>
5014 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5015 * in 100-ns units, typically incremented ever 10 ms. */
5016 unsigned int when[2];
5018 # ifdef HAS_GETTIMEOFDAY
5019 struct timeval when;
5025 /* This test is an escape hatch, this symbol isn't set by Configure. */
5026 #ifndef PERL_NO_DEV_RANDOM
5027 #ifndef PERL_RANDOM_DEVICE
5028 /* /dev/random isn't used by default because reads from it will block
5029 * if there isn't enough entropy available. You can compile with
5030 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5031 * is enough real entropy to fill the seed. */
5032 # define PERL_RANDOM_DEVICE "/dev/urandom"
5034 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5036 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5045 _ckvmssts(sys$gettim(when));
5046 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5048 # ifdef HAS_GETTIMEOFDAY
5049 PerlProc_gettimeofday(&when,NULL);
5050 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5053 u = (U32)SEED_C1 * when;
5056 u += SEED_C3 * (U32)PerlProc_getpid();
5057 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5058 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5059 u += SEED_C5 * (U32)PTR2UV(&when);
5065 Perl_get_hash_seed(pTHX)
5068 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5074 if (s && isDIGIT(*s))
5075 myseed = (UV)Atoul(s);
5077 #ifdef USE_HASH_SEED_EXPLICIT
5081 /* Compute a random seed */
5082 (void)seedDrand01((Rand_seed_t)seed());
5083 myseed = (UV)(Drand01() * (NV)UV_MAX);
5084 #if RANDBITS < (UVSIZE * 8)
5085 /* Since there are not enough randbits to to reach all
5086 * the bits of a UV, the low bits might need extra
5087 * help. Sum in another random number that will
5088 * fill in the low bits. */
5090 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5091 #endif /* RANDBITS < (UVSIZE * 8) */
5092 if (myseed == 0) { /* Superparanoia. */
5093 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5095 Perl_croak(aTHX_ "Your random numbers are not that random");
5098 PL_rehash_seed_set = TRUE;
5105 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5107 const char * const stashpv = CopSTASHPV(c);
5108 const char * const name = HvNAME_get(hv);
5109 PERL_UNUSED_CONTEXT;
5111 if (stashpv == name)
5113 if (stashpv && name)
5114 if (strEQ(stashpv, name))
5121 #ifdef PERL_GLOBAL_STRUCT
5124 Perl_init_global_struct(pTHX)
5126 struct perl_vars *plvarsp = NULL;
5127 #ifdef PERL_GLOBAL_STRUCT
5128 # define PERL_GLOBAL_STRUCT_INIT
5129 # include "opcode.h" /* the ppaddr and check */
5130 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5131 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5132 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5133 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5134 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5138 plvarsp = PL_VarsPtr;
5139 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5145 # define PERLVAR(var,type) /**/
5146 # define PERLVARA(var,n,type) /**/
5147 # define PERLVARI(var,type,init) plvarsp->var = init;
5148 # define PERLVARIC(var,type,init) plvarsp->var = init;
5149 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5150 # include "perlvars.h"
5156 # ifdef PERL_GLOBAL_STRUCT
5157 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5158 if (!plvarsp->Gppaddr)
5160 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5161 if (!plvarsp->Gcheck)
5163 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5164 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5166 # ifdef PERL_SET_VARS
5167 PERL_SET_VARS(plvarsp);
5169 # undef PERL_GLOBAL_STRUCT_INIT
5174 #endif /* PERL_GLOBAL_STRUCT */
5176 #ifdef PERL_GLOBAL_STRUCT
5179 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5181 #ifdef PERL_GLOBAL_STRUCT
5182 # ifdef PERL_UNSET_VARS
5183 PERL_UNSET_VARS(plvarsp);
5185 free(plvarsp->Gppaddr);
5186 free(plvarsp->Gcheck);
5187 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5193 #endif /* PERL_GLOBAL_STRUCT */
5198 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5200 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5201 * variable PERL_MEM_LOG will be consulted, and if the integer value
5202 * of that is true, the logging will happen. (The default is to
5203 * always log if the PERL_MEM_LOG define was in effect.)
5207 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5208 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5210 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5213 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5214 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5215 * in which case the environment variable PERL_MEM_LOG_FD will be
5216 * consulted for the file descriptor number to use.
5218 #ifndef PERL_MEM_LOG_FD
5219 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5223 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)
5225 #ifdef PERL_MEM_LOG_STDERR
5226 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5229 # ifdef PERL_MEM_LOG_ENV
5230 s = getenv("PERL_MEM_LOG");
5231 if (s ? atoi(s) : 0)
5234 /* We can't use SVs or PerlIO for obvious reasons,
5235 * so we'll use stdio and low-level IO instead. */
5236 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5237 # ifdef PERL_MEM_LOG_TIMESTAMP
5239 # ifdef HAS_GETTIMEOFDAY
5240 gettimeofday(&tv, 0);
5242 /* If there are other OS specific ways of hires time than
5243 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5244 * probably that they would be used to fill in the struct
5251 # ifdef PERL_MEM_LOG_TIMESTAMP
5254 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5255 " %s = %"IVdf": %"UVxf"\n",
5256 # ifdef PERL_MEM_LOG_TIMESTAMP
5257 (int)tv.tv_sec, (int)tv.tv_usec,
5259 filename, linenumber, funcname, n, typesize,
5260 typename, n * typesize, PTR2UV(newalloc));
5261 # ifdef PERL_MEM_LOG_ENV_FD
5262 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5263 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5265 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5274 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)
5276 #ifdef PERL_MEM_LOG_STDERR
5277 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5280 # ifdef PERL_MEM_LOG_ENV
5281 s = PerlEnv_getenv("PERL_MEM_LOG");
5282 if (s ? atoi(s) : 0)
5285 /* We can't use SVs or PerlIO for obvious reasons,
5286 * so we'll use stdio and low-level IO instead. */
5287 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5288 # ifdef PERL_MEM_LOG_TIMESTAMP
5290 gettimeofday(&tv, 0);
5296 # ifdef PERL_MEM_LOG_TIMESTAMP
5299 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5300 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5301 # ifdef PERL_MEM_LOG_TIMESTAMP
5302 (int)tv.tv_sec, (int)tv.tv_usec,
5304 filename, linenumber, funcname, n, typesize,
5305 typename, n * typesize, PTR2UV(oldalloc),
5307 # ifdef PERL_MEM_LOG_ENV_FD
5308 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5309 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5311 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5320 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5322 #ifdef PERL_MEM_LOG_STDERR
5323 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5326 # ifdef PERL_MEM_LOG_ENV
5327 s = PerlEnv_getenv("PERL_MEM_LOG");
5328 if (s ? atoi(s) : 0)
5331 /* We can't use SVs or PerlIO for obvious reasons,
5332 * so we'll use stdio and low-level IO instead. */
5333 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5334 # ifdef PERL_MEM_LOG_TIMESTAMP
5336 gettimeofday(&tv, 0);
5342 # ifdef PERL_MEM_LOG_TIMESTAMP
5345 "free: %s:%d:%s: %"UVxf"\n",
5346 # ifdef PERL_MEM_LOG_TIMESTAMP
5347 (int)tv.tv_sec, (int)tv.tv_usec,
5349 filename, linenumber, funcname,
5351 # ifdef PERL_MEM_LOG_ENV_FD
5352 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5353 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5355 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5363 #endif /* PERL_MEM_LOG */
5366 =for apidoc my_sprintf
5368 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5369 the length of the string written to the buffer. Only rare pre-ANSI systems
5370 need the wrapper function - usually this is a direct call to C<sprintf>.
5374 #ifndef SPRINTF_RETURNS_STRLEN
5376 Perl_my_sprintf(char *buffer, const char* pat, ...)
5379 va_start(args, pat);
5380 vsprintf(buffer, pat, args);
5382 return strlen(buffer);
5387 =for apidoc my_snprintf
5389 The C library C<snprintf> functionality, if available and
5390 standards-compliant (uses C<vsnprintf>, actually). However, if the
5391 C<vsnprintf> is not available, will unfortunately use the unsafe
5392 C<vsprintf> which can overrun the buffer (there is an overrun check,
5393 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5394 getting C<vsnprintf>.
5399 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5404 va_start(ap, format);
5405 #ifdef HAS_VSNPRINTF
5406 retval = vsnprintf(buffer, len, format, ap);
5408 retval = vsprintf(buffer, format, ap);
5411 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5412 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5413 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5418 =for apidoc my_vsnprintf
5420 The C library C<vsnprintf> if available and standards-compliant.
5421 However, if if the C<vsnprintf> is not available, will unfortunately
5422 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5423 overrun check, but that may be too late). Consider using
5424 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5429 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5435 Perl_va_copy(ap, apc);
5436 # ifdef HAS_VSNPRINTF
5437 retval = vsnprintf(buffer, len, format, apc);
5439 retval = vsprintf(buffer, format, apc);
5442 # ifdef HAS_VSNPRINTF
5443 retval = vsnprintf(buffer, len, format, ap);
5445 retval = vsprintf(buffer, format, ap);
5447 #endif /* #ifdef NEED_VA_COPY */
5448 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5449 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5450 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5455 Perl_my_clearenv(pTHX)
5458 #if ! defined(PERL_MICRO)
5459 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5461 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5462 # if defined(USE_ENVIRON_ARRAY)
5463 # if defined(USE_ITHREADS)
5464 /* only the parent thread can clobber the process environment */
5465 if (PL_curinterp == aTHX)
5466 # endif /* USE_ITHREADS */
5468 # if ! defined(PERL_USE_SAFE_PUTENV)
5469 if ( !PL_use_safe_putenv) {
5471 if (environ == PL_origenviron)
5472 environ = (char**)safesysmalloc(sizeof(char*));
5474 for (i = 0; environ[i]; i++)
5475 (void)safesysfree(environ[i]);
5478 # else /* PERL_USE_SAFE_PUTENV */
5479 # if defined(HAS_CLEARENV)
5481 # elif defined(HAS_UNSETENV)
5482 int bsiz = 80; /* Most envvar names will be shorter than this. */
5483 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5484 char *buf = (char*)safesysmalloc(bufsiz);
5485 while (*environ != NULL) {
5486 char *e = strchr(*environ, '=');
5487 int l = e ? e - *environ : (int)strlen(*environ);
5489 (void)safesysfree(buf);
5490 bsiz = l + 1; /* + 1 for the \0. */
5491 buf = (char*)safesysmalloc(bufsiz);
5493 my_strlcpy(buf, *environ, l + 1);
5494 (void)unsetenv(buf);
5496 (void)safesysfree(buf);
5497 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5498 /* Just null environ and accept the leakage. */
5500 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5501 # endif /* ! PERL_USE_SAFE_PUTENV */
5503 # endif /* USE_ENVIRON_ARRAY */
5504 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5505 #endif /* PERL_MICRO */
5508 #ifdef PERL_IMPLICIT_CONTEXT
5510 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5511 the global PL_my_cxt_index is incremented, and that value is assigned to
5512 that module's static my_cxt_index (who's address is passed as an arg).
5513 Then, for each interpreter this function is called for, it makes sure a
5514 void* slot is available to hang the static data off, by allocating or
5515 extending the interpreter's PL_my_cxt_list array */
5518 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5523 /* this module hasn't been allocated an index yet */
5524 MUTEX_LOCK(&PL_my_ctx_mutex);
5525 *index = PL_my_cxt_index++;
5526 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5529 /* make sure the array is big enough */
5530 if (PL_my_cxt_size <= *index) {
5531 if (PL_my_cxt_size) {
5532 while (PL_my_cxt_size <= *index)
5533 PL_my_cxt_size *= 2;
5534 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5537 PL_my_cxt_size = 16;
5538 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5541 /* newSV() allocates one more than needed */
5542 p = (void*)SvPVX(newSV(size-1));
5543 PL_my_cxt_list[*index] = p;
5544 Zero(p, size, char);
5551 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5553 Size_t used, length, copy;
5556 length = strlen(src);
5557 if (size > 0 && used < size - 1) {
5558 copy = (length >= size - used) ? size - used - 1 : length;
5559 memcpy(dst + used, src, copy);
5560 dst[used + copy] = '\0';
5562 return used + length;
5568 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5570 Size_t length, copy;
5572 length = strlen(src);
5574 copy = (length >= size) ? size - 1 : length;
5575 memcpy(dst, src, copy);
5583 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5586 SV * const dbsv = GvSVn(PL_DBsub);
5587 /* We do not care about using sv to call CV;
5588 * it's for informational purposes only.
5592 if (!PERLDB_SUB_NN) {
5593 GV * const gv = CvGV(cv);
5595 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5596 || strEQ(GvNAME(gv), "END")
5597 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5598 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5599 /* Use GV from the stack as a fallback. */
5600 /* GV is potentially non-unique, or contain different CV. */
5601 SV * const tmp = newRV((SV*)cv);
5602 sv_setsv(dbsv, tmp);
5606 gv_efullname3(dbsv, gv, NULL);
5610 const int type = SvTYPE(dbsv);
5611 if (type < SVt_PVIV && type != SVt_IV)
5612 sv_upgrade(dbsv, SVt_PVIV);
5613 (void)SvIOK_on(dbsv);
5614 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5620 * c-indentation-style: bsd
5622 * indent-tabs-mode: t
5625 * ex: set ts=8 sts=4 sw=4 noet: