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 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
459 /* As a space optimization, we do not compile tables for strings of length
460 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
461 special-cased in fbm_instr().
463 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
466 =head1 Miscellaneous Functions
468 =for apidoc fbm_compile
470 Analyses the string in order to make fast searches on it using fbm_instr()
471 -- the Boyer-Moore algorithm.
477 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
480 register const U8 *s;
486 if (flags & FBMcf_TAIL) {
487 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
488 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
489 if (mg && mg->mg_len >= 0)
492 s = (U8*)SvPV_force_mutable(sv, len);
493 SvUPGRADE(sv, SVt_PVBM);
494 if (len == 0) /* TAIL might be on a zero-length string. */
497 const unsigned char *sb;
498 const U8 mlen = (len>255) ? 255 : (U8)len;
501 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
502 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
503 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
504 memset((void*)table, mlen, 256);
505 table[-1] = (U8)flags;
507 sb = s - mlen + 1; /* first char (maybe) */
509 if (table[*s] == mlen)
514 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
517 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
518 for (i = 0; i < len; i++) {
519 if (PL_freq[s[i]] < frequency) {
521 frequency = PL_freq[s[i]];
524 BmRARE(sv) = s[rarest];
525 BmPREVIOUS(sv) = (U16)rarest;
526 BmUSEFUL(sv) = 100; /* Initial value */
527 if (flags & FBMcf_TAIL)
529 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
530 BmRARE(sv),BmPREVIOUS(sv)));
533 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
534 /* If SvTAIL is actually due to \Z or \z, this gives false positives
538 =for apidoc fbm_instr
540 Returns the location of the SV in the string delimited by C<str> and
541 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
542 does not have to be fbm_compiled, but the search will not be as fast
549 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
551 register unsigned char *s;
553 register const unsigned char *little
554 = (const unsigned char *)SvPV_const(littlestr,l);
555 register STRLEN littlelen = l;
556 register const I32 multiline = flags & FBMrf_MULTILINE;
558 if ((STRLEN)(bigend - big) < littlelen) {
559 if ( SvTAIL(littlestr)
560 && ((STRLEN)(bigend - big) == littlelen - 1)
562 || (*big == *little &&
563 memEQ((char *)big, (char *)little, littlelen - 1))))
568 if (littlelen <= 2) { /* Special-cased */
570 if (littlelen == 1) {
571 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
572 /* Know that bigend != big. */
573 if (bigend[-1] == '\n')
574 return (char *)(bigend - 1);
575 return (char *) bigend;
583 if (SvTAIL(littlestr))
584 return (char *) bigend;
588 return (char*)big; /* Cannot be SvTAIL! */
591 if (SvTAIL(littlestr) && !multiline) {
592 if (bigend[-1] == '\n' && bigend[-2] == *little)
593 return (char*)bigend - 2;
594 if (bigend[-1] == *little)
595 return (char*)bigend - 1;
599 /* This should be better than FBM if c1 == c2, and almost
600 as good otherwise: maybe better since we do less indirection.
601 And we save a lot of memory by caching no table. */
602 const unsigned char c1 = little[0];
603 const unsigned char c2 = little[1];
608 while (s <= bigend) {
618 goto check_1char_anchor;
629 goto check_1char_anchor;
632 while (s <= bigend) {
637 goto check_1char_anchor;
646 check_1char_anchor: /* One char and anchor! */
647 if (SvTAIL(littlestr) && (*bigend == *little))
648 return (char *)bigend; /* bigend is already decremented. */
651 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
652 s = bigend - littlelen;
653 if (s >= big && bigend[-1] == '\n' && *s == *little
654 /* Automatically of length > 2 */
655 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
657 return (char*)s; /* how sweet it is */
660 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
662 return (char*)s + 1; /* how sweet it is */
666 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
667 char * const b = ninstr((char*)big,(char*)bigend,
668 (char*)little, (char*)little + littlelen);
670 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
671 /* Chop \n from littlestr: */
672 s = bigend - littlelen + 1;
674 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
683 { /* Do actual FBM. */
684 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
685 register const unsigned char *oldlittle;
687 if (littlelen > (STRLEN)(bigend - big))
689 --littlelen; /* Last char found by table lookup */
692 little += littlelen; /* last char */
698 if ((tmp = table[*s])) {
699 if ((s += tmp) < bigend)
703 else { /* less expensive than calling strncmp() */
704 register unsigned char * const olds = s;
709 if (*--s == *--little)
711 s = olds + 1; /* here we pay the price for failure */
713 if (s < bigend) /* fake up continue to outer loop */
721 if ( s == bigend && (table[-1] & FBMcf_TAIL)
722 && memEQ((char *)(bigend - littlelen),
723 (char *)(oldlittle - littlelen), littlelen) )
724 return (char*)bigend - littlelen;
729 /* start_shift, end_shift are positive quantities which give offsets
730 of ends of some substring of bigstr.
731 If "last" we want the last occurrence.
732 old_posp is the way of communication between consequent calls if
733 the next call needs to find the .
734 The initial *old_posp should be -1.
736 Note that we take into account SvTAIL, so one can get extra
737 optimizations if _ALL flag is set.
740 /* If SvTAIL is actually due to \Z or \z, this gives false positives
741 if PL_multiline. In fact if !PL_multiline the authoritative answer
742 is not supported yet. */
745 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
748 register const unsigned char *big;
750 register I32 previous;
752 register const unsigned char *little;
753 register I32 stop_pos;
754 register const unsigned char *littleend;
758 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
759 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
761 if ( BmRARE(littlestr) == '\n'
762 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
763 little = (const unsigned char *)(SvPVX_const(littlestr));
764 littleend = little + SvCUR(littlestr);
771 little = (const unsigned char *)(SvPVX_const(littlestr));
772 littleend = little + SvCUR(littlestr);
774 /* The value of pos we can start at: */
775 previous = BmPREVIOUS(littlestr);
776 big = (const unsigned char *)(SvPVX_const(bigstr));
777 /* The value of pos we can stop at: */
778 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
779 if (previous + start_shift > stop_pos) {
781 stop_pos does not include SvTAIL in the count, so this check is incorrect
782 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
785 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
790 while (pos < previous + start_shift) {
791 if (!(pos += PL_screamnext[pos]))
796 register const unsigned char *s, *x;
797 if (pos >= stop_pos) break;
798 if (big[pos] != first)
800 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
806 if (s == littleend) {
808 if (!last) return (char *)(big+pos);
811 } while ( pos += PL_screamnext[pos] );
813 return (char *)(big+(*old_posp));
815 if (!SvTAIL(littlestr) || (end_shift > 0))
817 /* Ignore the trailing "\n". This code is not microoptimized */
818 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
819 stop_pos = littleend - little; /* Actual littlestr len */
824 && ((stop_pos == 1) ||
825 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
831 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
833 register const U8 *a = (const U8 *)s1;
834 register const U8 *b = (const U8 *)s2;
838 if (*a != *b && *a != PL_fold[*b])
846 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
849 register const U8 *a = (const U8 *)s1;
850 register const U8 *b = (const U8 *)s2;
854 if (*a != *b && *a != PL_fold_locale[*b])
861 /* copy a string to a safe spot */
864 =head1 Memory Management
868 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
869 string which is a duplicate of C<pv>. The size of the string is
870 determined by C<strlen()>. The memory allocated for the new string can
871 be freed with the C<Safefree()> function.
877 Perl_savepv(pTHX_ const char *pv)
884 const STRLEN pvlen = strlen(pv)+1;
885 Newx(newaddr,pvlen,char);
886 return memcpy(newaddr,pv,pvlen);
890 /* same thing but with a known length */
895 Perl's version of what C<strndup()> would be if it existed. Returns a
896 pointer to a newly allocated string which is a duplicate of the first
897 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
898 the new string can be freed with the C<Safefree()> function.
904 Perl_savepvn(pTHX_ const char *pv, register I32 len)
906 register char *newaddr;
909 Newx(newaddr,len+1,char);
910 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
912 /* might not be null terminated */
914 return (char *) CopyD(pv,newaddr,len,char);
917 return (char *) ZeroD(newaddr,len+1,char);
922 =for apidoc savesharedpv
924 A version of C<savepv()> which allocates the duplicate string in memory
925 which is shared between threads.
930 Perl_savesharedpv(pTHX_ const char *pv)
932 register char *newaddr;
937 pvlen = strlen(pv)+1;
938 newaddr = (char*)PerlMemShared_malloc(pvlen);
940 return write_no_mem();
942 return memcpy(newaddr,pv,pvlen);
948 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
949 the passed in SV using C<SvPV()>
955 Perl_savesvpv(pTHX_ SV *sv)
958 const char * const pv = SvPV_const(sv, len);
959 register char *newaddr;
962 Newx(newaddr,len,char);
963 return (char *) CopyD(pv,newaddr,len,char);
967 /* the SV for Perl_form() and mess() is not kept in an arena */
977 return sv_2mortal(newSVpvs(""));
982 /* Create as PVMG now, to avoid any upgrading later */
984 Newxz(any, 1, XPVMG);
985 SvFLAGS(sv) = SVt_PVMG;
986 SvANY(sv) = (void*)any;
988 SvREFCNT(sv) = 1 << 30; /* practically infinite */
993 #if defined(PERL_IMPLICIT_CONTEXT)
995 Perl_form_nocontext(const char* pat, ...)
1000 va_start(args, pat);
1001 retval = vform(pat, &args);
1005 #endif /* PERL_IMPLICIT_CONTEXT */
1008 =head1 Miscellaneous Functions
1011 Takes a sprintf-style format pattern and conventional
1012 (non-SV) arguments and returns the formatted string.
1014 (char *) Perl_form(pTHX_ const char* pat, ...)
1016 can be used any place a string (char *) is required:
1018 char * s = Perl_form("%d.%d",major,minor);
1020 Uses a single private buffer so if you want to format several strings you
1021 must explicitly copy the earlier strings away (and free the copies when you
1028 Perl_form(pTHX_ const char* pat, ...)
1032 va_start(args, pat);
1033 retval = vform(pat, &args);
1039 Perl_vform(pTHX_ const char *pat, va_list *args)
1041 SV * const sv = mess_alloc();
1042 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1046 #if defined(PERL_IMPLICIT_CONTEXT)
1048 Perl_mess_nocontext(const char *pat, ...)
1053 va_start(args, pat);
1054 retval = vmess(pat, &args);
1058 #endif /* PERL_IMPLICIT_CONTEXT */
1061 Perl_mess(pTHX_ const char *pat, ...)
1065 va_start(args, pat);
1066 retval = vmess(pat, &args);
1072 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1075 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1077 if (!o || o == PL_op)
1080 if (o->op_flags & OPf_KIDS) {
1082 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1085 /* If the OP_NEXTSTATE has been optimised away we can still use it
1086 * the get the file and line number. */
1088 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1089 cop = (const COP *)kid;
1091 /* Keep searching, and return when we've found something. */
1093 new_cop = closest_cop(cop, kid);
1099 /* Nothing found. */
1105 Perl_vmess(pTHX_ const char *pat, va_list *args)
1108 SV * const sv = mess_alloc();
1110 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1111 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1113 * Try and find the file and line for PL_op. This will usually be
1114 * PL_curcop, but it might be a cop that has been optimised away. We
1115 * can try to find such a cop by searching through the optree starting
1116 * from the sibling of PL_curcop.
1119 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1124 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1125 OutCopFILE(cop), (IV)CopLINE(cop));
1126 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1127 const bool line_mode = (RsSIMPLE(PL_rs) &&
1128 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1129 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1130 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1131 line_mode ? "line" : "chunk",
1132 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1135 sv_catpvs(sv, " during global destruction");
1136 sv_catpvs(sv, ".\n");
1142 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1148 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1149 && (io = GvIO(PL_stderrgv))
1150 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1157 SAVESPTR(PL_stderrgv);
1160 PUSHSTACKi(PERLSI_MAGIC);
1164 PUSHs(SvTIED_obj((SV*)io, mg));
1165 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1167 call_method("PRINT", G_SCALAR);
1175 /* SFIO can really mess with your errno */
1176 const int e = errno;
1178 PerlIO * const serr = Perl_error_log;
1180 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1181 (void)PerlIO_flush(serr);
1188 /* Common code used by vcroak, vdie, vwarn and vwarner */
1191 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1197 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1198 /* sv_2cv might call Perl_croak() or Perl_warner() */
1199 SV * const oldhook = *hook;
1206 cv = sv_2cv(oldhook, &stash, &gv, 0);
1208 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1218 if (warn || message) {
1219 msg = newSVpvn(message, msglen);
1220 SvFLAGS(msg) |= utf8;
1228 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1232 call_sv((SV*)cv, G_DISCARD);
1241 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1245 const char *message;
1248 SV * const msv = vmess(pat, args);
1249 if (PL_errors && SvCUR(PL_errors)) {
1250 sv_catsv(PL_errors, msv);
1251 message = SvPV_const(PL_errors, *msglen);
1252 SvCUR_set(PL_errors, 0);
1255 message = SvPV_const(msv,*msglen);
1256 *utf8 = SvUTF8(msv);
1262 DEBUG_S(PerlIO_printf(Perl_debug_log,
1263 "%p: die/croak: message = %s\ndiehook = %p\n",
1264 thr, message, PL_diehook));
1266 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1272 Perl_vdie(pTHX_ const char* pat, va_list *args)
1275 const char *message;
1276 const int was_in_eval = PL_in_eval;
1280 DEBUG_S(PerlIO_printf(Perl_debug_log,
1281 "%p: die: curstack = %p, mainstack = %p\n",
1282 thr, PL_curstack, PL_mainstack));
1284 message = vdie_croak_common(pat, args, &msglen, &utf8);
1286 PL_restartop = die_where(message, msglen);
1287 SvFLAGS(ERRSV) |= utf8;
1288 DEBUG_S(PerlIO_printf(Perl_debug_log,
1289 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1290 thr, PL_restartop, was_in_eval, PL_top_env));
1291 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1293 return PL_restartop;
1296 #if defined(PERL_IMPLICIT_CONTEXT)
1298 Perl_die_nocontext(const char* pat, ...)
1303 va_start(args, pat);
1304 o = vdie(pat, &args);
1308 #endif /* PERL_IMPLICIT_CONTEXT */
1311 Perl_die(pTHX_ const char* pat, ...)
1315 va_start(args, pat);
1316 o = vdie(pat, &args);
1322 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1325 const char *message;
1329 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1332 PL_restartop = die_where(message, msglen);
1333 SvFLAGS(ERRSV) |= utf8;
1337 message = SvPVx_const(ERRSV, msglen);
1339 write_to_stderr(message, msglen);
1343 #if defined(PERL_IMPLICIT_CONTEXT)
1345 Perl_croak_nocontext(const char *pat, ...)
1349 va_start(args, pat);
1354 #endif /* PERL_IMPLICIT_CONTEXT */
1357 =head1 Warning and Dieing
1361 This is the XSUB-writer's interface to Perl's C<die> function.
1362 Normally call this function the same way you call the C C<printf>
1363 function. Calling C<croak> returns control directly to Perl,
1364 sidestepping the normal C order of execution. See C<warn>.
1366 If you want to throw an exception object, assign the object to
1367 C<$@> and then pass C<NULL> to croak():
1369 errsv = get_sv("@", TRUE);
1370 sv_setsv(errsv, exception_object);
1377 Perl_croak(pTHX_ const char *pat, ...)
1380 va_start(args, pat);
1387 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1391 SV * const msv = vmess(pat, args);
1392 const I32 utf8 = SvUTF8(msv);
1393 const char * const message = SvPV_const(msv, msglen);
1396 if (vdie_common(message, msglen, utf8, TRUE))
1400 write_to_stderr(message, msglen);
1403 #if defined(PERL_IMPLICIT_CONTEXT)
1405 Perl_warn_nocontext(const char *pat, ...)
1409 va_start(args, pat);
1413 #endif /* PERL_IMPLICIT_CONTEXT */
1418 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1419 function the same way you call the C C<printf> function. See C<croak>.
1425 Perl_warn(pTHX_ const char *pat, ...)
1428 va_start(args, pat);
1433 #if defined(PERL_IMPLICIT_CONTEXT)
1435 Perl_warner_nocontext(U32 err, const char *pat, ...)
1439 va_start(args, pat);
1440 vwarner(err, pat, &args);
1443 #endif /* PERL_IMPLICIT_CONTEXT */
1446 Perl_warner(pTHX_ U32 err, const char* pat,...)
1449 va_start(args, pat);
1450 vwarner(err, pat, &args);
1455 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1458 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1459 SV * const msv = vmess(pat, args);
1461 const char * const message = SvPV_const(msv, msglen);
1462 const I32 utf8 = SvUTF8(msv);
1466 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1469 PL_restartop = die_where(message, msglen);
1470 SvFLAGS(ERRSV) |= utf8;
1473 write_to_stderr(message, msglen);
1477 Perl_vwarn(aTHX_ pat, args);
1481 /* implements the ckWARN? macros */
1484 Perl_ckwarn(pTHX_ U32 w)
1490 && PL_curcop->cop_warnings != pWARN_NONE
1492 PL_curcop->cop_warnings == pWARN_ALL
1493 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1494 || (unpackWARN2(w) &&
1495 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1496 || (unpackWARN3(w) &&
1497 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1498 || (unpackWARN4(w) &&
1499 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1504 isLEXWARN_off && PL_dowarn & G_WARN_ON
1509 /* implements the ckWARN?_d macro */
1512 Perl_ckwarn_d(pTHX_ U32 w)
1517 || PL_curcop->cop_warnings == pWARN_ALL
1519 PL_curcop->cop_warnings != pWARN_NONE
1521 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1522 || (unpackWARN2(w) &&
1523 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1524 || (unpackWARN3(w) &&
1525 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1526 || (unpackWARN4(w) &&
1527 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1533 /* Set buffer=NULL to get a new one. */
1535 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1537 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1538 PERL_UNUSED_CONTEXT;
1540 buffer = specialWARN(buffer) ? PerlMemShared_malloc(len_wanted)
1541 : PerlMemShared_realloc(buffer, len_wanted);
1543 Copy(bits, (buffer + 1), size, char);
1547 /* since we've already done strlen() for both nam and val
1548 * we can use that info to make things faster than
1549 * sprintf(s, "%s=%s", nam, val)
1551 #define my_setenv_format(s, nam, nlen, val, vlen) \
1552 Copy(nam, s, nlen, char); \
1554 Copy(val, s+(nlen+1), vlen, char); \
1555 *(s+(nlen+1+vlen)) = '\0'
1557 #ifdef USE_ENVIRON_ARRAY
1558 /* VMS' my_setenv() is in vms.c */
1559 #if !defined(WIN32) && !defined(NETWARE)
1561 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1565 /* only parent thread can modify process environment */
1566 if (PL_curinterp == aTHX)
1569 #ifndef PERL_USE_SAFE_PUTENV
1570 if (!PL_use_safe_putenv) {
1571 /* most putenv()s leak, so we manipulate environ directly */
1572 register I32 i=setenv_getix(nam); /* where does it go? */
1575 if (environ == PL_origenviron) { /* need we copy environment? */
1581 while (environ[max])
1583 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1584 for (j=0; j<max; j++) { /* copy environment */
1585 const int len = strlen(environ[j]);
1586 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1587 Copy(environ[j], tmpenv[j], len+1, char);
1590 environ = tmpenv; /* tell exec where it is now */
1593 safesysfree(environ[i]);
1594 while (environ[i]) {
1595 environ[i] = environ[i+1];
1600 if (!environ[i]) { /* does not exist yet */
1601 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1602 environ[i+1] = NULL; /* make sure it's null terminated */
1605 safesysfree(environ[i]);
1609 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1610 /* all that work just for this */
1611 my_setenv_format(environ[i], nam, nlen, val, vlen);
1614 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1615 # if defined(HAS_UNSETENV)
1617 (void)unsetenv(nam);
1619 (void)setenv(nam, val, 1);
1621 # else /* ! HAS_UNSETENV */
1622 (void)setenv(nam, val, 1);
1623 # endif /* HAS_UNSETENV */
1625 # if defined(HAS_UNSETENV)
1627 (void)unsetenv(nam);
1629 const int nlen = strlen(nam);
1630 const int vlen = strlen(val);
1631 char * const new_env =
1632 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1633 my_setenv_format(new_env, nam, nlen, val, vlen);
1634 (void)putenv(new_env);
1636 # else /* ! HAS_UNSETENV */
1638 const int nlen = strlen(nam);
1644 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1645 /* all that work just for this */
1646 my_setenv_format(new_env, nam, nlen, val, vlen);
1647 (void)putenv(new_env);
1648 # endif /* HAS_UNSETENV */
1649 # endif /* __CYGWIN__ */
1650 #ifndef PERL_USE_SAFE_PUTENV
1656 #else /* WIN32 || NETWARE */
1659 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1662 register char *envstr;
1663 const int nlen = strlen(nam);
1670 Newx(envstr, nlen+vlen+2, char);
1671 my_setenv_format(envstr, nam, nlen, val, vlen);
1672 (void)PerlEnv_putenv(envstr);
1676 #endif /* WIN32 || NETWARE */
1680 Perl_setenv_getix(pTHX_ const char *nam)
1683 register const I32 len = strlen(nam);
1684 PERL_UNUSED_CONTEXT;
1686 for (i = 0; environ[i]; i++) {
1689 strnicmp(environ[i],nam,len) == 0
1691 strnEQ(environ[i],nam,len)
1693 && environ[i][len] == '=')
1694 break; /* strnEQ must come first to avoid */
1695 } /* potential SEGV's */
1698 #endif /* !PERL_MICRO */
1700 #endif /* !VMS && !EPOC*/
1702 #ifdef UNLINK_ALL_VERSIONS
1704 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1708 while (PerlLIO_unlink(f) >= 0)
1710 return retries ? 0 : -1;
1714 /* this is a drop-in replacement for bcopy() */
1715 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1717 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1719 char * const retval = to;
1721 if (from - to >= 0) {
1729 *(--to) = *(--from);
1735 /* this is a drop-in replacement for memset() */
1738 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1740 char * const retval = loc;
1748 /* this is a drop-in replacement for bzero() */
1749 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1751 Perl_my_bzero(register char *loc, register I32 len)
1753 char * const retval = loc;
1761 /* this is a drop-in replacement for memcmp() */
1762 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1764 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1766 register const U8 *a = (const U8 *)s1;
1767 register const U8 *b = (const U8 *)s2;
1771 if ((tmp = *a++ - *b++))
1776 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1780 #ifdef USE_CHAR_VSPRINTF
1785 vsprintf(char *dest, const char *pat, char *args)
1789 fakebuf._ptr = dest;
1790 fakebuf._cnt = 32767;
1794 fakebuf._flag = _IOWRT|_IOSTRG;
1795 _doprnt(pat, args, &fakebuf); /* what a kludge */
1796 (void)putc('\0', &fakebuf);
1797 #ifdef USE_CHAR_VSPRINTF
1800 return 0; /* perl doesn't use return value */
1804 #endif /* HAS_VPRINTF */
1807 #if BYTEORDER != 0x4321
1809 Perl_my_swap(pTHX_ short s)
1811 #if (BYTEORDER & 1) == 0
1814 result = ((s & 255) << 8) + ((s >> 8) & 255);
1822 Perl_my_htonl(pTHX_ long l)
1826 char c[sizeof(long)];
1829 #if BYTEORDER == 0x1234
1830 u.c[0] = (l >> 24) & 255;
1831 u.c[1] = (l >> 16) & 255;
1832 u.c[2] = (l >> 8) & 255;
1836 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1837 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1842 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1843 u.c[o & 0xf] = (l >> s) & 255;
1851 Perl_my_ntohl(pTHX_ long l)
1855 char c[sizeof(long)];
1858 #if BYTEORDER == 0x1234
1859 u.c[0] = (l >> 24) & 255;
1860 u.c[1] = (l >> 16) & 255;
1861 u.c[2] = (l >> 8) & 255;
1865 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1866 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1873 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1874 l |= (u.c[o & 0xf] & 255) << s;
1881 #endif /* BYTEORDER != 0x4321 */
1885 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1886 * If these functions are defined,
1887 * the BYTEORDER is neither 0x1234 nor 0x4321.
1888 * However, this is not assumed.
1892 #define HTOLE(name,type) \
1894 name (register type n) \
1898 char c[sizeof(type)]; \
1901 register U32 s = 0; \
1902 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1903 u.c[i] = (n >> s) & 0xFF; \
1908 #define LETOH(name,type) \
1910 name (register type n) \
1914 char c[sizeof(type)]; \
1917 register U32 s = 0; \
1920 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1921 n |= ((type)(u.c[i] & 0xFF)) << s; \
1927 * Big-endian byte order functions.
1930 #define HTOBE(name,type) \
1932 name (register type n) \
1936 char c[sizeof(type)]; \
1939 register U32 s = 8*(sizeof(u.c)-1); \
1940 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1941 u.c[i] = (n >> s) & 0xFF; \
1946 #define BETOH(name,type) \
1948 name (register type n) \
1952 char c[sizeof(type)]; \
1955 register U32 s = 8*(sizeof(u.c)-1); \
1958 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1959 n |= ((type)(u.c[i] & 0xFF)) << s; \
1965 * If we just can't do it...
1968 #define NOT_AVAIL(name,type) \
1970 name (register type n) \
1972 Perl_croak_nocontext(#name "() not available"); \
1973 return n; /* not reached */ \
1977 #if defined(HAS_HTOVS) && !defined(htovs)
1980 #if defined(HAS_HTOVL) && !defined(htovl)
1983 #if defined(HAS_VTOHS) && !defined(vtohs)
1986 #if defined(HAS_VTOHL) && !defined(vtohl)
1990 #ifdef PERL_NEED_MY_HTOLE16
1992 HTOLE(Perl_my_htole16,U16)
1994 NOT_AVAIL(Perl_my_htole16,U16)
1997 #ifdef PERL_NEED_MY_LETOH16
1999 LETOH(Perl_my_letoh16,U16)
2001 NOT_AVAIL(Perl_my_letoh16,U16)
2004 #ifdef PERL_NEED_MY_HTOBE16
2006 HTOBE(Perl_my_htobe16,U16)
2008 NOT_AVAIL(Perl_my_htobe16,U16)
2011 #ifdef PERL_NEED_MY_BETOH16
2013 BETOH(Perl_my_betoh16,U16)
2015 NOT_AVAIL(Perl_my_betoh16,U16)
2019 #ifdef PERL_NEED_MY_HTOLE32
2021 HTOLE(Perl_my_htole32,U32)
2023 NOT_AVAIL(Perl_my_htole32,U32)
2026 #ifdef PERL_NEED_MY_LETOH32
2028 LETOH(Perl_my_letoh32,U32)
2030 NOT_AVAIL(Perl_my_letoh32,U32)
2033 #ifdef PERL_NEED_MY_HTOBE32
2035 HTOBE(Perl_my_htobe32,U32)
2037 NOT_AVAIL(Perl_my_htobe32,U32)
2040 #ifdef PERL_NEED_MY_BETOH32
2042 BETOH(Perl_my_betoh32,U32)
2044 NOT_AVAIL(Perl_my_betoh32,U32)
2048 #ifdef PERL_NEED_MY_HTOLE64
2050 HTOLE(Perl_my_htole64,U64)
2052 NOT_AVAIL(Perl_my_htole64,U64)
2055 #ifdef PERL_NEED_MY_LETOH64
2057 LETOH(Perl_my_letoh64,U64)
2059 NOT_AVAIL(Perl_my_letoh64,U64)
2062 #ifdef PERL_NEED_MY_HTOBE64
2064 HTOBE(Perl_my_htobe64,U64)
2066 NOT_AVAIL(Perl_my_htobe64,U64)
2069 #ifdef PERL_NEED_MY_BETOH64
2071 BETOH(Perl_my_betoh64,U64)
2073 NOT_AVAIL(Perl_my_betoh64,U64)
2077 #ifdef PERL_NEED_MY_HTOLES
2078 HTOLE(Perl_my_htoles,short)
2080 #ifdef PERL_NEED_MY_LETOHS
2081 LETOH(Perl_my_letohs,short)
2083 #ifdef PERL_NEED_MY_HTOBES
2084 HTOBE(Perl_my_htobes,short)
2086 #ifdef PERL_NEED_MY_BETOHS
2087 BETOH(Perl_my_betohs,short)
2090 #ifdef PERL_NEED_MY_HTOLEI
2091 HTOLE(Perl_my_htolei,int)
2093 #ifdef PERL_NEED_MY_LETOHI
2094 LETOH(Perl_my_letohi,int)
2096 #ifdef PERL_NEED_MY_HTOBEI
2097 HTOBE(Perl_my_htobei,int)
2099 #ifdef PERL_NEED_MY_BETOHI
2100 BETOH(Perl_my_betohi,int)
2103 #ifdef PERL_NEED_MY_HTOLEL
2104 HTOLE(Perl_my_htolel,long)
2106 #ifdef PERL_NEED_MY_LETOHL
2107 LETOH(Perl_my_letohl,long)
2109 #ifdef PERL_NEED_MY_HTOBEL
2110 HTOBE(Perl_my_htobel,long)
2112 #ifdef PERL_NEED_MY_BETOHL
2113 BETOH(Perl_my_betohl,long)
2117 Perl_my_swabn(void *ptr, int n)
2119 register char *s = (char *)ptr;
2120 register char *e = s + (n-1);
2123 for (n /= 2; n > 0; s++, e--, n--) {
2131 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2133 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2136 register I32 This, that;
2142 PERL_FLUSHALL_FOR_CHILD;
2143 This = (*mode == 'w');
2147 taint_proper("Insecure %s%s", "EXEC");
2149 if (PerlProc_pipe(p) < 0)
2151 /* Try for another pipe pair for error return */
2152 if (PerlProc_pipe(pp) >= 0)
2154 while ((pid = PerlProc_fork()) < 0) {
2155 if (errno != EAGAIN) {
2156 PerlLIO_close(p[This]);
2157 PerlLIO_close(p[that]);
2159 PerlLIO_close(pp[0]);
2160 PerlLIO_close(pp[1]);
2172 /* Close parent's end of error status pipe (if any) */
2174 PerlLIO_close(pp[0]);
2175 #if defined(HAS_FCNTL) && defined(F_SETFD)
2176 /* Close error pipe automatically if exec works */
2177 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2180 /* Now dup our end of _the_ pipe to right position */
2181 if (p[THIS] != (*mode == 'r')) {
2182 PerlLIO_dup2(p[THIS], *mode == 'r');
2183 PerlLIO_close(p[THIS]);
2184 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2185 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2188 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2189 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2190 /* No automatic close - do it by hand */
2197 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2203 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2209 do_execfree(); /* free any memory malloced by child on fork */
2211 PerlLIO_close(pp[1]);
2212 /* Keep the lower of the two fd numbers */
2213 if (p[that] < p[This]) {
2214 PerlLIO_dup2(p[This], p[that]);
2215 PerlLIO_close(p[This]);
2219 PerlLIO_close(p[that]); /* close child's end of pipe */
2222 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2224 SvUPGRADE(sv,SVt_IV);
2226 PL_forkprocess = pid;
2227 /* If we managed to get status pipe check for exec fail */
2228 if (did_pipes && pid > 0) {
2233 while (n < sizeof(int)) {
2234 n1 = PerlLIO_read(pp[0],
2235 (void*)(((char*)&errkid)+n),
2241 PerlLIO_close(pp[0]);
2243 if (n) { /* Error */
2245 PerlLIO_close(p[This]);
2246 if (n != sizeof(int))
2247 Perl_croak(aTHX_ "panic: kid popen errno read");
2249 pid2 = wait4pid(pid, &status, 0);
2250 } while (pid2 == -1 && errno == EINTR);
2251 errno = errkid; /* Propagate errno from kid */
2256 PerlLIO_close(pp[0]);
2257 return PerlIO_fdopen(p[This], mode);
2259 Perl_croak(aTHX_ "List form of piped open not implemented");
2260 return (PerlIO *) NULL;
2264 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2265 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2267 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2271 register I32 This, that;
2274 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2278 PERL_FLUSHALL_FOR_CHILD;
2281 return my_syspopen(aTHX_ cmd,mode);
2284 This = (*mode == 'w');
2286 if (doexec && PL_tainting) {
2288 taint_proper("Insecure %s%s", "EXEC");
2290 if (PerlProc_pipe(p) < 0)
2292 if (doexec && PerlProc_pipe(pp) >= 0)
2294 while ((pid = PerlProc_fork()) < 0) {
2295 if (errno != EAGAIN) {
2296 PerlLIO_close(p[This]);
2297 PerlLIO_close(p[that]);
2299 PerlLIO_close(pp[0]);
2300 PerlLIO_close(pp[1]);
2303 Perl_croak(aTHX_ "Can't fork");
2316 PerlLIO_close(pp[0]);
2317 #if defined(HAS_FCNTL) && defined(F_SETFD)
2318 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2321 if (p[THIS] != (*mode == 'r')) {
2322 PerlLIO_dup2(p[THIS], *mode == 'r');
2323 PerlLIO_close(p[THIS]);
2324 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2325 PerlLIO_close(p[THAT]);
2328 PerlLIO_close(p[THAT]);
2331 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2338 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2343 /* may or may not use the shell */
2344 do_exec3(cmd, pp[1], did_pipes);
2347 #endif /* defined OS2 */
2348 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2349 SvREADONLY_off(GvSV(tmpgv));
2350 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2351 SvREADONLY_on(GvSV(tmpgv));
2353 #ifdef THREADS_HAVE_PIDS
2354 PL_ppid = (IV)getppid();
2357 #ifdef PERL_USES_PL_PIDSTATUS
2358 hv_clear(PL_pidstatus); /* we have no children */
2364 do_execfree(); /* free any memory malloced by child on vfork */
2366 PerlLIO_close(pp[1]);
2367 if (p[that] < p[This]) {
2368 PerlLIO_dup2(p[This], p[that]);
2369 PerlLIO_close(p[This]);
2373 PerlLIO_close(p[that]);
2376 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2378 SvUPGRADE(sv,SVt_IV);
2380 PL_forkprocess = pid;
2381 if (did_pipes && pid > 0) {
2386 while (n < sizeof(int)) {
2387 n1 = PerlLIO_read(pp[0],
2388 (void*)(((char*)&errkid)+n),
2394 PerlLIO_close(pp[0]);
2396 if (n) { /* Error */
2398 PerlLIO_close(p[This]);
2399 if (n != sizeof(int))
2400 Perl_croak(aTHX_ "panic: kid popen errno read");
2402 pid2 = wait4pid(pid, &status, 0);
2403 } while (pid2 == -1 && errno == EINTR);
2404 errno = errkid; /* Propagate errno from kid */
2409 PerlLIO_close(pp[0]);
2410 return PerlIO_fdopen(p[This], mode);
2413 #if defined(atarist) || defined(EPOC)
2416 Perl_my_popen(pTHX_ char *cmd, char *mode)
2418 PERL_FLUSHALL_FOR_CHILD;
2419 /* Call system's popen() to get a FILE *, then import it.
2420 used 0 for 2nd parameter to PerlIO_importFILE;
2423 return PerlIO_importFILE(popen(cmd, mode), 0);
2427 FILE *djgpp_popen();
2429 Perl_my_popen(pTHX_ char *cmd, char *mode)
2431 PERL_FLUSHALL_FOR_CHILD;
2432 /* Call system's popen() to get a FILE *, then import it.
2433 used 0 for 2nd parameter to PerlIO_importFILE;
2436 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2441 #endif /* !DOSISH */
2443 /* this is called in parent before the fork() */
2445 Perl_atfork_lock(void)
2448 #if defined(USE_ITHREADS)
2449 /* locks must be held in locking order (if any) */
2451 MUTEX_LOCK(&PL_malloc_mutex);
2457 /* this is called in both parent and child after the fork() */
2459 Perl_atfork_unlock(void)
2462 #if defined(USE_ITHREADS)
2463 /* locks must be released in same order as in atfork_lock() */
2465 MUTEX_UNLOCK(&PL_malloc_mutex);
2474 #if defined(HAS_FORK)
2476 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2481 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2482 * handlers elsewhere in the code */
2487 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2488 Perl_croak_nocontext("fork() not available");
2490 #endif /* HAS_FORK */
2495 Perl_dump_fds(pTHX_ char *s)
2500 PerlIO_printf(Perl_debug_log,"%s", s);
2501 for (fd = 0; fd < 32; fd++) {
2502 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2503 PerlIO_printf(Perl_debug_log," %d",fd);
2505 PerlIO_printf(Perl_debug_log,"\n");
2508 #endif /* DUMP_FDS */
2512 dup2(int oldfd, int newfd)
2514 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2517 PerlLIO_close(newfd);
2518 return fcntl(oldfd, F_DUPFD, newfd);
2520 #define DUP2_MAX_FDS 256
2521 int fdtmp[DUP2_MAX_FDS];
2527 PerlLIO_close(newfd);
2528 /* good enough for low fd's... */
2529 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2530 if (fdx >= DUP2_MAX_FDS) {
2538 PerlLIO_close(fdtmp[--fdx]);
2545 #ifdef HAS_SIGACTION
2547 #ifdef MACOS_TRADITIONAL
2548 /* We don't want restart behavior on MacOS */
2553 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2556 struct sigaction act, oact;
2559 /* only "parent" interpreter can diddle signals */
2560 if (PL_curinterp != aTHX)
2561 return (Sighandler_t) SIG_ERR;
2564 act.sa_handler = (void(*)(int))handler;
2565 sigemptyset(&act.sa_mask);
2568 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2569 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2571 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2572 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2573 act.sa_flags |= SA_NOCLDWAIT;
2575 if (sigaction(signo, &act, &oact) == -1)
2576 return (Sighandler_t) SIG_ERR;
2578 return (Sighandler_t) oact.sa_handler;
2582 Perl_rsignal_state(pTHX_ int signo)
2584 struct sigaction oact;
2585 PERL_UNUSED_CONTEXT;
2587 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2588 return (Sighandler_t) SIG_ERR;
2590 return (Sighandler_t) oact.sa_handler;
2594 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2597 struct sigaction act;
2600 /* only "parent" interpreter can diddle signals */
2601 if (PL_curinterp != aTHX)
2605 act.sa_handler = (void(*)(int))handler;
2606 sigemptyset(&act.sa_mask);
2609 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2610 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2612 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2613 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2614 act.sa_flags |= SA_NOCLDWAIT;
2616 return sigaction(signo, &act, save);
2620 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2624 /* only "parent" interpreter can diddle signals */
2625 if (PL_curinterp != aTHX)
2629 return sigaction(signo, save, (struct sigaction *)NULL);
2632 #else /* !HAS_SIGACTION */
2635 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2637 #if defined(USE_ITHREADS) && !defined(WIN32)
2638 /* only "parent" interpreter can diddle signals */
2639 if (PL_curinterp != aTHX)
2640 return (Sighandler_t) SIG_ERR;
2643 return PerlProc_signal(signo, handler);
2654 Perl_rsignal_state(pTHX_ int signo)
2657 Sighandler_t oldsig;
2659 #if defined(USE_ITHREADS) && !defined(WIN32)
2660 /* only "parent" interpreter can diddle signals */
2661 if (PL_curinterp != aTHX)
2662 return (Sighandler_t) SIG_ERR;
2666 oldsig = PerlProc_signal(signo, sig_trap);
2667 PerlProc_signal(signo, oldsig);
2669 PerlProc_kill(PerlProc_getpid(), signo);
2674 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2676 #if defined(USE_ITHREADS) && !defined(WIN32)
2677 /* only "parent" interpreter can diddle signals */
2678 if (PL_curinterp != aTHX)
2681 *save = PerlProc_signal(signo, handler);
2682 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2686 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2688 #if defined(USE_ITHREADS) && !defined(WIN32)
2689 /* only "parent" interpreter can diddle signals */
2690 if (PL_curinterp != aTHX)
2693 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2696 #endif /* !HAS_SIGACTION */
2697 #endif /* !PERL_MICRO */
2699 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2700 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2702 Perl_my_pclose(pTHX_ PerlIO *ptr)
2705 Sigsave_t hstat, istat, qstat;
2711 int saved_errno = 0;
2713 int saved_win32_errno;
2717 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2719 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2721 *svp = &PL_sv_undef;
2723 if (pid == -1) { /* Opened by popen. */
2724 return my_syspclose(ptr);
2727 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2728 saved_errno = errno;
2730 saved_win32_errno = GetLastError();
2734 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2737 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2738 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2739 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2742 pid2 = wait4pid(pid, &status, 0);
2743 } while (pid2 == -1 && errno == EINTR);
2745 rsignal_restore(SIGHUP, &hstat);
2746 rsignal_restore(SIGINT, &istat);
2747 rsignal_restore(SIGQUIT, &qstat);
2750 SETERRNO(saved_errno, 0);
2753 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2755 #endif /* !DOSISH */
2757 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2759 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2765 #ifdef PERL_USES_PL_PIDSTATUS
2768 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2769 pid, rather than a string form. */
2770 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2771 if (svp && *svp != &PL_sv_undef) {
2772 *statusp = SvIVX(*svp);
2773 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2781 hv_iterinit(PL_pidstatus);
2782 if ((entry = hv_iternext(PL_pidstatus))) {
2783 SV * const sv = hv_iterval(PL_pidstatus,entry);
2785 const char * const spid = hv_iterkey(entry,&len);
2787 assert (len == sizeof(Pid_t));
2788 memcpy((char *)&pid, spid, len);
2789 *statusp = SvIVX(sv);
2790 /* The hash iterator is currently on this entry, so simply
2791 calling hv_delete would trigger the lazy delete, which on
2792 aggregate does more work, beacuse next call to hv_iterinit()
2793 would spot the flag, and have to call the delete routine,
2794 while in the meantime any new entries can't re-use that
2796 hv_iterinit(PL_pidstatus);
2797 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2804 # ifdef HAS_WAITPID_RUNTIME
2805 if (!HAS_WAITPID_RUNTIME)
2808 result = PerlProc_waitpid(pid,statusp,flags);
2811 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2812 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2815 #ifdef PERL_USES_PL_PIDSTATUS
2816 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2821 Perl_croak(aTHX_ "Can't do waitpid with flags");
2823 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2824 pidgone(result,*statusp);
2830 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2833 if (result < 0 && errno == EINTR) {
2838 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2840 #ifdef PERL_USES_PL_PIDSTATUS
2842 Perl_pidgone(pTHX_ Pid_t pid, int status)
2846 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2847 SvUPGRADE(sv,SVt_IV);
2848 SvIV_set(sv, status);
2853 #if defined(atarist) || defined(OS2) || defined(EPOC)
2856 int /* Cannot prototype with I32
2858 my_syspclose(PerlIO *ptr)
2861 Perl_my_pclose(pTHX_ PerlIO *ptr)
2864 /* Needs work for PerlIO ! */
2865 FILE * const f = PerlIO_findFILE(ptr);
2866 const I32 result = pclose(f);
2867 PerlIO_releaseFILE(ptr,f);
2875 Perl_my_pclose(pTHX_ PerlIO *ptr)
2877 /* Needs work for PerlIO ! */
2878 FILE * const f = PerlIO_findFILE(ptr);
2879 I32 result = djgpp_pclose(f);
2880 result = (result << 8) & 0xff00;
2881 PerlIO_releaseFILE(ptr,f);
2887 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2890 register const char * const frombase = from;
2891 PERL_UNUSED_CONTEXT;
2894 register const char c = *from;
2899 while (count-- > 0) {
2900 for (todo = len; todo > 0; todo--) {
2909 Perl_same_dirent(pTHX_ const char *a, const char *b)
2911 char *fa = strrchr(a,'/');
2912 char *fb = strrchr(b,'/');
2915 SV * const tmpsv = sv_newmortal();
2928 sv_setpvn(tmpsv, ".", 1);
2930 sv_setpvn(tmpsv, a, fa - a);
2931 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2934 sv_setpvn(tmpsv, ".", 1);
2936 sv_setpvn(tmpsv, b, fb - b);
2937 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2939 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2940 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2942 #endif /* !HAS_RENAME */
2945 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2946 const char *const *const search_ext, I32 flags)
2949 const char *xfound = NULL;
2950 char *xfailed = NULL;
2951 char tmpbuf[MAXPATHLEN];
2955 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2956 # define SEARCH_EXTS ".bat", ".cmd", NULL
2957 # define MAX_EXT_LEN 4
2960 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2961 # define MAX_EXT_LEN 4
2964 # define SEARCH_EXTS ".pl", ".com", NULL
2965 # define MAX_EXT_LEN 4
2967 /* additional extensions to try in each dir if scriptname not found */
2969 static const char *const exts[] = { SEARCH_EXTS };
2970 const char *const *const ext = search_ext ? search_ext : exts;
2971 int extidx = 0, i = 0;
2972 const char *curext = NULL;
2974 PERL_UNUSED_ARG(search_ext);
2975 # define MAX_EXT_LEN 0
2979 * If dosearch is true and if scriptname does not contain path
2980 * delimiters, search the PATH for scriptname.
2982 * If SEARCH_EXTS is also defined, will look for each
2983 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2984 * while searching the PATH.
2986 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2987 * proceeds as follows:
2988 * If DOSISH or VMSISH:
2989 * + look for ./scriptname{,.foo,.bar}
2990 * + search the PATH for scriptname{,.foo,.bar}
2993 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2994 * this will not look in '.' if it's not in the PATH)
2999 # ifdef ALWAYS_DEFTYPES
3000 len = strlen(scriptname);
3001 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3002 int idx = 0, deftypes = 1;
3005 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3008 int idx = 0, deftypes = 1;
3011 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3013 /* The first time through, just add SEARCH_EXTS to whatever we
3014 * already have, so we can check for default file types. */
3016 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3022 if ((strlen(tmpbuf) + strlen(scriptname)
3023 + MAX_EXT_LEN) >= sizeof tmpbuf)
3024 continue; /* don't search dir with too-long name */
3025 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3029 if (strEQ(scriptname, "-"))
3031 if (dosearch) { /* Look in '.' first. */
3032 const char *cur = scriptname;
3034 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3036 if (strEQ(ext[i++],curext)) {
3037 extidx = -1; /* already has an ext */
3042 DEBUG_p(PerlIO_printf(Perl_debug_log,
3043 "Looking for %s\n",cur));
3044 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3045 && !S_ISDIR(PL_statbuf.st_mode)) {
3053 if (cur == scriptname) {
3054 len = strlen(scriptname);
3055 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3057 cur = my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3059 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3060 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3065 #ifdef MACOS_TRADITIONAL
3066 if (dosearch && !strchr(scriptname, ':') &&
3067 (s = PerlEnv_getenv("Commands")))
3069 if (dosearch && !strchr(scriptname, '/')
3071 && !strchr(scriptname, '\\')
3073 && (s = PerlEnv_getenv("PATH")))
3078 PL_bufend = s + strlen(s);
3079 while (s < PL_bufend) {
3080 #ifdef MACOS_TRADITIONAL
3081 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3085 #if defined(atarist) || defined(DOSISH)
3090 && *s != ';'; len++, s++) {
3091 if (len < sizeof tmpbuf)
3094 if (len < sizeof tmpbuf)
3096 #else /* ! (atarist || DOSISH) */
3097 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3100 #endif /* ! (atarist || DOSISH) */
3101 #endif /* MACOS_TRADITIONAL */
3104 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3105 continue; /* don't search dir with too-long name */
3106 #ifdef MACOS_TRADITIONAL
3107 if (len && tmpbuf[len - 1] != ':')
3108 tmpbuf[len++] = ':';
3111 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3112 && tmpbuf[len - 1] != '/'
3113 && tmpbuf[len - 1] != '\\'
3116 tmpbuf[len++] = '/';
3117 if (len == 2 && tmpbuf[0] == '.')
3120 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3124 len = strlen(tmpbuf);
3125 if (extidx > 0) /* reset after previous loop */
3129 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3130 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3131 if (S_ISDIR(PL_statbuf.st_mode)) {
3135 } while ( retval < 0 /* not there */
3136 && extidx>=0 && ext[extidx] /* try an extension? */
3137 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3142 if (S_ISREG(PL_statbuf.st_mode)
3143 && cando(S_IRUSR,TRUE,&PL_statbuf)
3144 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3145 && cando(S_IXUSR,TRUE,&PL_statbuf)
3149 xfound = tmpbuf; /* bingo! */
3153 xfailed = savepv(tmpbuf);
3156 if (!xfound && !seen_dot && !xfailed &&
3157 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3158 || S_ISDIR(PL_statbuf.st_mode)))
3160 seen_dot = 1; /* Disable message. */
3162 if (flags & 1) { /* do or die? */
3163 Perl_croak(aTHX_ "Can't %s %s%s%s",
3164 (xfailed ? "execute" : "find"),
3165 (xfailed ? xfailed : scriptname),
3166 (xfailed ? "" : " on PATH"),
3167 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3172 scriptname = xfound;
3174 return (scriptname ? savepv(scriptname) : NULL);
3177 #ifndef PERL_GET_CONTEXT_DEFINED
3180 Perl_get_context(void)
3183 #if defined(USE_ITHREADS)
3184 # ifdef OLD_PTHREADS_API
3186 if (pthread_getspecific(PL_thr_key, &t))
3187 Perl_croak_nocontext("panic: pthread_getspecific");
3190 # ifdef I_MACH_CTHREADS
3191 return (void*)cthread_data(cthread_self());
3193 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3202 Perl_set_context(void *t)
3205 #if defined(USE_ITHREADS)
3206 # ifdef I_MACH_CTHREADS
3207 cthread_set_data(cthread_self(), t);
3209 if (pthread_setspecific(PL_thr_key, t))
3210 Perl_croak_nocontext("panic: pthread_setspecific");
3217 #endif /* !PERL_GET_CONTEXT_DEFINED */
3219 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3228 Perl_get_op_names(pTHX)
3230 PERL_UNUSED_CONTEXT;
3231 return (char **)PL_op_name;
3235 Perl_get_op_descs(pTHX)
3237 PERL_UNUSED_CONTEXT;
3238 return (char **)PL_op_desc;
3242 Perl_get_no_modify(pTHX)
3244 PERL_UNUSED_CONTEXT;
3245 return PL_no_modify;
3249 Perl_get_opargs(pTHX)
3251 PERL_UNUSED_CONTEXT;
3252 return (U32 *)PL_opargs;
3256 Perl_get_ppaddr(pTHX)
3259 PERL_UNUSED_CONTEXT;
3260 return (PPADDR_t*)PL_ppaddr;
3263 #ifndef HAS_GETENV_LEN
3265 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3267 char * const env_trans = PerlEnv_getenv(env_elem);
3268 PERL_UNUSED_CONTEXT;
3270 *len = strlen(env_trans);
3277 Perl_get_vtbl(pTHX_ int vtbl_id)
3279 const MGVTBL* result;
3280 PERL_UNUSED_CONTEXT;
3284 result = &PL_vtbl_sv;
3287 result = &PL_vtbl_env;
3289 case want_vtbl_envelem:
3290 result = &PL_vtbl_envelem;
3293 result = &PL_vtbl_sig;
3295 case want_vtbl_sigelem:
3296 result = &PL_vtbl_sigelem;
3298 case want_vtbl_pack:
3299 result = &PL_vtbl_pack;
3301 case want_vtbl_packelem:
3302 result = &PL_vtbl_packelem;
3304 case want_vtbl_dbline:
3305 result = &PL_vtbl_dbline;
3308 result = &PL_vtbl_isa;
3310 case want_vtbl_isaelem:
3311 result = &PL_vtbl_isaelem;
3313 case want_vtbl_arylen:
3314 result = &PL_vtbl_arylen;
3316 case want_vtbl_mglob:
3317 result = &PL_vtbl_mglob;
3319 case want_vtbl_nkeys:
3320 result = &PL_vtbl_nkeys;
3322 case want_vtbl_taint:
3323 result = &PL_vtbl_taint;
3325 case want_vtbl_substr:
3326 result = &PL_vtbl_substr;
3329 result = &PL_vtbl_vec;
3332 result = &PL_vtbl_pos;
3335 result = &PL_vtbl_bm;
3338 result = &PL_vtbl_fm;
3340 case want_vtbl_uvar:
3341 result = &PL_vtbl_uvar;
3343 case want_vtbl_defelem:
3344 result = &PL_vtbl_defelem;
3346 case want_vtbl_regexp:
3347 result = &PL_vtbl_regexp;
3349 case want_vtbl_regdata:
3350 result = &PL_vtbl_regdata;
3352 case want_vtbl_regdatum:
3353 result = &PL_vtbl_regdatum;
3355 #ifdef USE_LOCALE_COLLATE
3356 case want_vtbl_collxfrm:
3357 result = &PL_vtbl_collxfrm;
3360 case want_vtbl_amagic:
3361 result = &PL_vtbl_amagic;
3363 case want_vtbl_amagicelem:
3364 result = &PL_vtbl_amagicelem;
3366 case want_vtbl_backref:
3367 result = &PL_vtbl_backref;
3369 case want_vtbl_utf8:
3370 result = &PL_vtbl_utf8;
3376 return (MGVTBL*)result;
3380 Perl_my_fflush_all(pTHX)
3382 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3383 return PerlIO_flush(NULL);
3385 # if defined(HAS__FWALK)
3386 extern int fflush(FILE *);
3387 /* undocumented, unprototyped, but very useful BSDism */
3388 extern void _fwalk(int (*)(FILE *));
3392 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3394 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3395 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3397 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3398 open_max = sysconf(_SC_OPEN_MAX);
3401 open_max = FOPEN_MAX;
3404 open_max = OPEN_MAX;
3415 for (i = 0; i < open_max; i++)
3416 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3417 STDIO_STREAM_ARRAY[i]._file < open_max &&
3418 STDIO_STREAM_ARRAY[i]._flag)
3419 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3423 SETERRNO(EBADF,RMS_IFI);
3430 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3432 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3434 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3435 if (ckWARN(WARN_IO)) {
3436 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3438 Perl_warner(aTHX_ packWARN(WARN_IO),
3439 "Filehandle %s opened only for %sput",
3442 Perl_warner(aTHX_ packWARN(WARN_IO),
3443 "Filehandle opened only for %sput", direction);
3450 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3452 warn_type = WARN_CLOSED;
3456 warn_type = WARN_UNOPENED;
3459 if (ckWARN(warn_type)) {
3460 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3461 const char * const func =
3462 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3463 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3464 op < 0 ? "" : /* handle phoney cases */
3466 const char * const type = OP_IS_SOCKET(op)
3467 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3468 ? "socket" : "filehandle";
3469 if (name && *name) {
3470 Perl_warner(aTHX_ packWARN(warn_type),
3471 "%s%s on %s %s %s", func, pars, vile, type, name);
3472 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3474 aTHX_ packWARN(warn_type),
3475 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3480 Perl_warner(aTHX_ packWARN(warn_type),
3481 "%s%s on %s %s", func, pars, vile, type);
3482 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3484 aTHX_ packWARN(warn_type),
3485 "\t(Are you trying to call %s%s on dirhandle?)\n",
3494 /* in ASCII order, not that it matters */
3495 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3498 Perl_ebcdic_control(pTHX_ int ch)
3506 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3507 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3510 if (ctlp == controllablechars)
3511 return('\177'); /* DEL */
3513 return((unsigned char)(ctlp - controllablechars - 1));
3514 } else { /* Want uncontrol */
3515 if (ch == '\177' || ch == -1)
3517 else if (ch == '\157')
3519 else if (ch == '\174')
3521 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3523 else if (ch == '\155')
3525 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3526 return(controllablechars[ch+1]);
3528 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3533 /* To workaround core dumps from the uninitialised tm_zone we get the
3534 * system to give us a reasonable struct to copy. This fix means that
3535 * strftime uses the tm_zone and tm_gmtoff values returned by
3536 * localtime(time()). That should give the desired result most of the
3537 * time. But probably not always!
3539 * This does not address tzname aspects of NETaa14816.
3544 # ifndef STRUCT_TM_HASZONE
3545 # define STRUCT_TM_HASZONE
3549 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3550 # ifndef HAS_TM_TM_ZONE
3551 # define HAS_TM_TM_ZONE
3556 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3558 #ifdef HAS_TM_TM_ZONE
3560 const struct tm* my_tm;
3562 my_tm = localtime(&now);
3564 Copy(my_tm, ptm, 1, struct tm);
3566 PERL_UNUSED_ARG(ptm);
3571 * mini_mktime - normalise struct tm values without the localtime()
3572 * semantics (and overhead) of mktime().
3575 Perl_mini_mktime(pTHX_ struct tm *ptm)
3579 int month, mday, year, jday;
3580 int odd_cent, odd_year;
3581 PERL_UNUSED_CONTEXT;
3583 #define DAYS_PER_YEAR 365
3584 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3585 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3586 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3587 #define SECS_PER_HOUR (60*60)
3588 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3589 /* parentheses deliberately absent on these two, otherwise they don't work */
3590 #define MONTH_TO_DAYS 153/5
3591 #define DAYS_TO_MONTH 5/153
3592 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3593 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3594 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3595 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3598 * Year/day algorithm notes:
3600 * With a suitable offset for numeric value of the month, one can find
3601 * an offset into the year by considering months to have 30.6 (153/5) days,
3602 * using integer arithmetic (i.e., with truncation). To avoid too much
3603 * messing about with leap days, we consider January and February to be
3604 * the 13th and 14th month of the previous year. After that transformation,
3605 * we need the month index we use to be high by 1 from 'normal human' usage,
3606 * so the month index values we use run from 4 through 15.
3608 * Given that, and the rules for the Gregorian calendar (leap years are those
3609 * divisible by 4 unless also divisible by 100, when they must be divisible
3610 * by 400 instead), we can simply calculate the number of days since some
3611 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3612 * the days we derive from our month index, and adding in the day of the
3613 * month. The value used here is not adjusted for the actual origin which
3614 * it normally would use (1 January A.D. 1), since we're not exposing it.
3615 * We're only building the value so we can turn around and get the
3616 * normalised values for the year, month, day-of-month, and day-of-year.
3618 * For going backward, we need to bias the value we're using so that we find
3619 * the right year value. (Basically, we don't want the contribution of
3620 * March 1st to the number to apply while deriving the year). Having done
3621 * that, we 'count up' the contribution to the year number by accounting for
3622 * full quadracenturies (400-year periods) with their extra leap days, plus
3623 * the contribution from full centuries (to avoid counting in the lost leap
3624 * days), plus the contribution from full quad-years (to count in the normal
3625 * leap days), plus the leftover contribution from any non-leap years.
3626 * At this point, if we were working with an actual leap day, we'll have 0
3627 * days left over. This is also true for March 1st, however. So, we have
3628 * to special-case that result, and (earlier) keep track of the 'odd'
3629 * century and year contributions. If we got 4 extra centuries in a qcent,
3630 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3631 * Otherwise, we add back in the earlier bias we removed (the 123 from
3632 * figuring in March 1st), find the month index (integer division by 30.6),
3633 * and the remainder is the day-of-month. We then have to convert back to
3634 * 'real' months (including fixing January and February from being 14/15 in
3635 * the previous year to being in the proper year). After that, to get
3636 * tm_yday, we work with the normalised year and get a new yearday value for
3637 * January 1st, which we subtract from the yearday value we had earlier,
3638 * representing the date we've re-built. This is done from January 1
3639 * because tm_yday is 0-origin.
3641 * Since POSIX time routines are only guaranteed to work for times since the
3642 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3643 * applies Gregorian calendar rules even to dates before the 16th century
3644 * doesn't bother me. Besides, you'd need cultural context for a given
3645 * date to know whether it was Julian or Gregorian calendar, and that's
3646 * outside the scope for this routine. Since we convert back based on the
3647 * same rules we used to build the yearday, you'll only get strange results
3648 * for input which needed normalising, or for the 'odd' century years which
3649 * were leap years in the Julian calander but not in the Gregorian one.
3650 * I can live with that.
3652 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3653 * that's still outside the scope for POSIX time manipulation, so I don't
3657 year = 1900 + ptm->tm_year;
3658 month = ptm->tm_mon;
3659 mday = ptm->tm_mday;
3660 /* allow given yday with no month & mday to dominate the result */
3661 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3664 jday = 1 + ptm->tm_yday;
3673 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3674 yearday += month*MONTH_TO_DAYS + mday + jday;
3676 * Note that we don't know when leap-seconds were or will be,
3677 * so we have to trust the user if we get something which looks
3678 * like a sensible leap-second. Wild values for seconds will
3679 * be rationalised, however.
3681 if ((unsigned) ptm->tm_sec <= 60) {
3688 secs += 60 * ptm->tm_min;
3689 secs += SECS_PER_HOUR * ptm->tm_hour;
3691 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3692 /* got negative remainder, but need positive time */
3693 /* back off an extra day to compensate */
3694 yearday += (secs/SECS_PER_DAY)-1;
3695 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3698 yearday += (secs/SECS_PER_DAY);
3699 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3702 else if (secs >= SECS_PER_DAY) {
3703 yearday += (secs/SECS_PER_DAY);
3704 secs %= SECS_PER_DAY;
3706 ptm->tm_hour = secs/SECS_PER_HOUR;
3707 secs %= SECS_PER_HOUR;
3708 ptm->tm_min = secs/60;
3710 ptm->tm_sec += secs;
3711 /* done with time of day effects */
3713 * The algorithm for yearday has (so far) left it high by 428.
3714 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3715 * bias it by 123 while trying to figure out what year it
3716 * really represents. Even with this tweak, the reverse
3717 * translation fails for years before A.D. 0001.
3718 * It would still fail for Feb 29, but we catch that one below.
3720 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3721 yearday -= YEAR_ADJUST;
3722 year = (yearday / DAYS_PER_QCENT) * 400;
3723 yearday %= DAYS_PER_QCENT;
3724 odd_cent = yearday / DAYS_PER_CENT;
3725 year += odd_cent * 100;
3726 yearday %= DAYS_PER_CENT;
3727 year += (yearday / DAYS_PER_QYEAR) * 4;
3728 yearday %= DAYS_PER_QYEAR;
3729 odd_year = yearday / DAYS_PER_YEAR;
3731 yearday %= DAYS_PER_YEAR;
3732 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3737 yearday += YEAR_ADJUST; /* recover March 1st crock */
3738 month = yearday*DAYS_TO_MONTH;
3739 yearday -= month*MONTH_TO_DAYS;
3740 /* recover other leap-year adjustment */
3749 ptm->tm_year = year - 1900;
3751 ptm->tm_mday = yearday;
3752 ptm->tm_mon = month;
3756 ptm->tm_mon = month - 1;
3758 /* re-build yearday based on Jan 1 to get tm_yday */
3760 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3761 yearday += 14*MONTH_TO_DAYS + 1;
3762 ptm->tm_yday = jday - yearday;
3763 /* fix tm_wday if not overridden by caller */
3764 if ((unsigned)ptm->tm_wday > 6)
3765 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3769 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)
3777 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3780 mytm.tm_hour = hour;
3781 mytm.tm_mday = mday;
3783 mytm.tm_year = year;
3784 mytm.tm_wday = wday;
3785 mytm.tm_yday = yday;
3786 mytm.tm_isdst = isdst;
3788 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3789 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3794 #ifdef HAS_TM_TM_GMTOFF
3795 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3797 #ifdef HAS_TM_TM_ZONE
3798 mytm.tm_zone = mytm2.tm_zone;
3803 Newx(buf, buflen, char);
3804 len = strftime(buf, buflen, fmt, &mytm);
3806 ** The following is needed to handle to the situation where
3807 ** tmpbuf overflows. Basically we want to allocate a buffer
3808 ** and try repeatedly. The reason why it is so complicated
3809 ** is that getting a return value of 0 from strftime can indicate
3810 ** one of the following:
3811 ** 1. buffer overflowed,
3812 ** 2. illegal conversion specifier, or
3813 ** 3. the format string specifies nothing to be returned(not
3814 ** an error). This could be because format is an empty string
3815 ** or it specifies %p that yields an empty string in some locale.
3816 ** If there is a better way to make it portable, go ahead by
3819 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3822 /* Possibly buf overflowed - try again with a bigger buf */
3823 const int fmtlen = strlen(fmt);
3824 const int bufsize = fmtlen + buflen;
3826 Newx(buf, bufsize, char);
3828 buflen = strftime(buf, bufsize, fmt, &mytm);
3829 if (buflen > 0 && buflen < bufsize)
3831 /* heuristic to prevent out-of-memory errors */
3832 if (bufsize > 100*fmtlen) {
3837 Renew(buf, bufsize*2, char);
3842 Perl_croak(aTHX_ "panic: no strftime");
3848 #define SV_CWD_RETURN_UNDEF \
3849 sv_setsv(sv, &PL_sv_undef); \
3852 #define SV_CWD_ISDOT(dp) \
3853 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3854 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3857 =head1 Miscellaneous Functions
3859 =for apidoc getcwd_sv
3861 Fill the sv with current working directory
3866 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3867 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3868 * getcwd(3) if available
3869 * Comments from the orignal:
3870 * This is a faster version of getcwd. It's also more dangerous
3871 * because you might chdir out of a directory that you can't chdir
3875 Perl_getcwd_sv(pTHX_ register SV *sv)
3879 #ifndef INCOMPLETE_TAINTS
3885 char buf[MAXPATHLEN];
3887 /* Some getcwd()s automatically allocate a buffer of the given
3888 * size from the heap if they are given a NULL buffer pointer.
3889 * The problem is that this behaviour is not portable. */
3890 if (getcwd(buf, sizeof(buf) - 1)) {
3895 sv_setsv(sv, &PL_sv_undef);
3903 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3907 SvUPGRADE(sv, SVt_PV);
3909 if (PerlLIO_lstat(".", &statbuf) < 0) {
3910 SV_CWD_RETURN_UNDEF;
3913 orig_cdev = statbuf.st_dev;
3914 orig_cino = statbuf.st_ino;
3923 if (PerlDir_chdir("..") < 0) {
3924 SV_CWD_RETURN_UNDEF;
3926 if (PerlLIO_stat(".", &statbuf) < 0) {
3927 SV_CWD_RETURN_UNDEF;
3930 cdev = statbuf.st_dev;
3931 cino = statbuf.st_ino;
3933 if (odev == cdev && oino == cino) {
3936 if (!(dir = PerlDir_open("."))) {
3937 SV_CWD_RETURN_UNDEF;
3940 while ((dp = PerlDir_read(dir)) != NULL) {
3942 const int namelen = dp->d_namlen;
3944 const int namelen = strlen(dp->d_name);
3947 if (SV_CWD_ISDOT(dp)) {
3951 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3952 SV_CWD_RETURN_UNDEF;
3955 tdev = statbuf.st_dev;
3956 tino = statbuf.st_ino;
3957 if (tino == oino && tdev == odev) {
3963 SV_CWD_RETURN_UNDEF;
3966 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3967 SV_CWD_RETURN_UNDEF;
3970 SvGROW(sv, pathlen + namelen + 1);
3974 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3977 /* prepend current directory to the front */
3979 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3980 pathlen += (namelen + 1);
3982 #ifdef VOID_CLOSEDIR
3985 if (PerlDir_close(dir) < 0) {
3986 SV_CWD_RETURN_UNDEF;
3992 SvCUR_set(sv, pathlen);
3996 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3997 SV_CWD_RETURN_UNDEF;
4000 if (PerlLIO_stat(".", &statbuf) < 0) {
4001 SV_CWD_RETURN_UNDEF;
4004 cdev = statbuf.st_dev;
4005 cino = statbuf.st_ino;
4007 if (cdev != orig_cdev || cino != orig_cino) {
4008 Perl_croak(aTHX_ "Unstable directory path, "
4009 "current directory changed unexpectedly");
4021 =for apidoc scan_version
4023 Returns a pointer to the next character after the parsed
4024 version string, as well as upgrading the passed in SV to
4027 Function must be called with an already existing SV like
4030 s = scan_version(s,SV *sv, bool qv);
4032 Performs some preprocessing to the string to ensure that
4033 it has the correct characteristics of a version. Flags the
4034 object if it contains an underscore (which denotes this
4035 is a alpha version). The boolean qv denotes that the version
4036 should be interpreted as if it had multiple decimals, even if
4043 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4051 AV * const av = newAV();
4052 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4053 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4055 #ifndef NODEFAULT_SHAREKEYS
4056 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4059 while (isSPACE(*s)) /* leading whitespace is OK */
4063 s++; /* get past 'v' */
4064 qv = 1; /* force quoted version processing */
4067 start = last = pos = s;
4069 /* pre-scan the input string to check for decimals/underbars */
4070 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4075 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4079 else if ( *pos == '_' )
4082 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4084 width = pos - last - 1; /* natural width of sub-version */
4089 if ( alpha && !saw_period )
4090 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4092 if ( saw_period > 1 )
4093 qv = 1; /* force quoted version processing */
4098 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4100 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4101 if ( !qv && width < 3 )
4102 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4104 while (isDIGIT(*pos))
4106 if (!isALPHA(*pos)) {
4112 /* this is atoi() that delimits on underscores */
4113 const char *end = pos;
4117 /* the following if() will only be true after the decimal
4118 * point of a version originally created with a bare
4119 * floating point number, i.e. not quoted in any way
4121 if ( !qv && s > start && saw_period == 1 ) {
4125 rev += (*s - '0') * mult;
4127 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4128 Perl_croak(aTHX_ "Integer overflow in version");
4135 while (--end >= s) {
4137 rev += (*end - '0') * mult;
4139 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4140 Perl_croak(aTHX_ "Integer overflow in version");
4145 /* Append revision */
4146 av_push(av, newSViv(rev));
4149 else if ( *pos == '_' && isDIGIT(pos[1]) )
4151 else if ( isDIGIT(*pos) )
4158 while ( isDIGIT(*pos) )
4163 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4171 if ( qv ) { /* quoted versions always get at least three terms*/
4172 I32 len = av_len(av);
4173 /* This for loop appears to trigger a compiler bug on OS X, as it
4174 loops infinitely. Yes, len is negative. No, it makes no sense.
4175 Compiler in question is:
4176 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4177 for ( len = 2 - len; len > 0; len-- )
4178 av_push((AV *)sv, newSViv(0));
4182 av_push(av, newSViv(0));
4185 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4186 av_push(av, newSViv(0));
4188 /* fix RT#19517 - special case 'undef' as string */
4189 if ( *s == 'u' && strEQ(s,"undef") ) {
4193 /* And finally, store the AV in the hash */
4194 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4199 =for apidoc new_version
4201 Returns a new version object based on the passed in SV:
4203 SV *sv = new_version(SV *ver);
4205 Does not alter the passed in ver SV. See "upg_version" if you
4206 want to upgrade the SV.
4212 Perl_new_version(pTHX_ SV *ver)
4215 SV * const rv = newSV(0);
4216 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4219 AV * const av = newAV();
4221 /* This will get reblessed later if a derived class*/
4222 SV * const hv = newSVrv(rv, "version");
4223 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4224 #ifndef NODEFAULT_SHAREKEYS
4225 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4231 /* Begin copying all of the elements */
4232 if ( hv_exists((HV *)ver, "qv", 2) )
4233 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4235 if ( hv_exists((HV *)ver, "alpha", 5) )
4236 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4238 if ( hv_exists((HV*)ver, "width", 5 ) )
4240 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4241 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4244 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4245 /* This will get reblessed later if a derived class*/
4246 for ( key = 0; key <= av_len(sav); key++ )
4248 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4249 av_push(av, newSViv(rev));
4252 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4257 const MAGIC* const mg = SvVSTRING_mg(ver);
4258 if ( mg ) { /* already a v-string */
4259 const STRLEN len = mg->mg_len;
4260 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4261 sv_setpvn(rv,version,len);
4266 sv_setsv(rv,ver); /* make a duplicate */
4271 return upg_version(rv);
4275 =for apidoc upg_version
4277 In-place upgrade of the supplied SV to a version object.
4279 SV *sv = upg_version(SV *sv);
4281 Returns a pointer to the upgraded SV.
4287 Perl_upg_version(pTHX_ SV *ver)
4289 const char *version, *s;
4295 if ( SvNOK(ver) ) /* may get too much accuracy */
4298 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4299 while (tbuf[len-1] == '0' && len > 0) len--;
4300 version = savepvn(tbuf, len);
4303 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4304 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4308 else /* must be a string or something like a string */
4310 version = savepv(SvPV_nolen(ver));
4313 s = scan_version(version, ver, qv);
4315 if(ckWARN(WARN_MISC))
4316 Perl_warner(aTHX_ packWARN(WARN_MISC),
4317 "Version string '%s' contains invalid data; "
4318 "ignoring: '%s'", version, s);
4326 Validates that the SV contains a valid version object.
4328 bool vverify(SV *vobj);
4330 Note that it only confirms the bare minimum structure (so as not to get
4331 confused by derived classes which may contain additional hash entries):
4335 =item * The SV contains a [reference to a] hash
4337 =item * The hash contains a "version" key
4339 =item * The "version" key has [a reference to] an AV as its value
4347 Perl_vverify(pTHX_ SV *vs)
4353 /* see if the appropriate elements exist */
4354 if ( SvTYPE(vs) == SVt_PVHV
4355 && hv_exists((HV*)vs, "version", 7)
4356 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4357 && SvTYPE(sv) == SVt_PVAV )
4366 Accepts a version object and returns the normalized floating
4367 point representation. Call like:
4371 NOTE: you can pass either the object directly or the SV
4372 contained within the RV.
4378 Perl_vnumify(pTHX_ SV *vs)
4383 SV * const sv = newSV(0);
4389 Perl_croak(aTHX_ "Invalid version object");
4391 /* see if various flags exist */
4392 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4394 if ( hv_exists((HV*)vs, "width", 5 ) )
4395 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4400 /* attempt to retrieve the version array */
4401 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4413 digit = SvIV(*av_fetch(av, 0, 0));
4414 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4415 for ( i = 1 ; i < len ; i++ )
4417 digit = SvIV(*av_fetch(av, i, 0));
4419 const int denom = (width == 2 ? 10 : 100);
4420 const div_t term = div((int)PERL_ABS(digit),denom);
4421 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4424 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4430 digit = SvIV(*av_fetch(av, len, 0));
4431 if ( alpha && width == 3 ) /* alpha version */
4433 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4437 sv_catpvs(sv, "000");
4445 Accepts a version object and returns the normalized string
4446 representation. Call like:
4450 NOTE: you can pass either the object directly or the SV
4451 contained within the RV.
4457 Perl_vnormal(pTHX_ SV *vs)
4461 SV * const sv = newSV(0);
4467 Perl_croak(aTHX_ "Invalid version object");
4469 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4471 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4479 digit = SvIV(*av_fetch(av, 0, 0));
4480 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4481 for ( i = 1 ; i < len ; i++ ) {
4482 digit = SvIV(*av_fetch(av, i, 0));
4483 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4488 /* handle last digit specially */
4489 digit = SvIV(*av_fetch(av, len, 0));
4491 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4493 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4496 if ( len <= 2 ) { /* short version, must be at least three */
4497 for ( len = 2 - len; len != 0; len-- )
4504 =for apidoc vstringify
4506 In order to maintain maximum compatibility with earlier versions
4507 of Perl, this function will return either the floating point
4508 notation or the multiple dotted notation, depending on whether
4509 the original version contained 1 or more dots, respectively
4515 Perl_vstringify(pTHX_ SV *vs)
4521 Perl_croak(aTHX_ "Invalid version object");
4523 if ( hv_exists((HV *)vs, "qv", 2) )
4532 Version object aware cmp. Both operands must already have been
4533 converted into version objects.
4539 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4542 bool lalpha = FALSE;
4543 bool ralpha = FALSE;
4552 if ( !vverify(lhv) )
4553 Perl_croak(aTHX_ "Invalid version object");
4555 if ( !vverify(rhv) )
4556 Perl_croak(aTHX_ "Invalid version object");
4558 /* get the left hand term */
4559 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4560 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4563 /* and the right hand term */
4564 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4565 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4573 while ( i <= m && retval == 0 )
4575 left = SvIV(*av_fetch(lav,i,0));
4576 right = SvIV(*av_fetch(rav,i,0));
4584 /* tiebreaker for alpha with identical terms */
4585 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4587 if ( lalpha && !ralpha )
4591 else if ( ralpha && !lalpha)
4597 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4601 while ( i <= r && retval == 0 )
4603 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4604 retval = -1; /* not a match after all */
4610 while ( i <= l && retval == 0 )
4612 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4613 retval = +1; /* not a match after all */
4621 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4622 # define EMULATE_SOCKETPAIR_UDP
4625 #ifdef EMULATE_SOCKETPAIR_UDP
4627 S_socketpair_udp (int fd[2]) {
4629 /* Fake a datagram socketpair using UDP to localhost. */
4630 int sockets[2] = {-1, -1};
4631 struct sockaddr_in addresses[2];
4633 Sock_size_t size = sizeof(struct sockaddr_in);
4634 unsigned short port;
4637 memset(&addresses, 0, sizeof(addresses));
4640 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4641 if (sockets[i] == -1)
4642 goto tidy_up_and_fail;
4644 addresses[i].sin_family = AF_INET;
4645 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4646 addresses[i].sin_port = 0; /* kernel choses port. */
4647 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4648 sizeof(struct sockaddr_in)) == -1)
4649 goto tidy_up_and_fail;
4652 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4653 for each connect the other socket to it. */
4656 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4658 goto tidy_up_and_fail;
4659 if (size != sizeof(struct sockaddr_in))
4660 goto abort_tidy_up_and_fail;
4661 /* !1 is 0, !0 is 1 */
4662 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4663 sizeof(struct sockaddr_in)) == -1)
4664 goto tidy_up_and_fail;
4667 /* Now we have 2 sockets connected to each other. I don't trust some other
4668 process not to have already sent a packet to us (by random) so send
4669 a packet from each to the other. */
4672 /* I'm going to send my own port number. As a short.
4673 (Who knows if someone somewhere has sin_port as a bitfield and needs
4674 this routine. (I'm assuming crays have socketpair)) */
4675 port = addresses[i].sin_port;
4676 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4677 if (got != sizeof(port)) {
4679 goto tidy_up_and_fail;
4680 goto abort_tidy_up_and_fail;
4684 /* Packets sent. I don't trust them to have arrived though.
4685 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4686 connect to localhost will use a second kernel thread. In 2.6 the
4687 first thread running the connect() returns before the second completes,
4688 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4689 returns 0. Poor programs have tripped up. One poor program's authors'
4690 had a 50-1 reverse stock split. Not sure how connected these were.)
4691 So I don't trust someone not to have an unpredictable UDP stack.
4695 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4696 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4700 FD_SET((unsigned int)sockets[0], &rset);
4701 FD_SET((unsigned int)sockets[1], &rset);
4703 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4704 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4705 || !FD_ISSET(sockets[1], &rset)) {
4706 /* I hope this is portable and appropriate. */
4708 goto tidy_up_and_fail;
4709 goto abort_tidy_up_and_fail;
4713 /* And the paranoia department even now doesn't trust it to have arrive
4714 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4716 struct sockaddr_in readfrom;
4717 unsigned short buffer[2];
4722 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4723 sizeof(buffer), MSG_DONTWAIT,
4724 (struct sockaddr *) &readfrom, &size);
4726 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4728 (struct sockaddr *) &readfrom, &size);
4732 goto tidy_up_and_fail;
4733 if (got != sizeof(port)
4734 || size != sizeof(struct sockaddr_in)
4735 /* Check other socket sent us its port. */
4736 || buffer[0] != (unsigned short) addresses[!i].sin_port
4737 /* Check kernel says we got the datagram from that socket */
4738 || readfrom.sin_family != addresses[!i].sin_family
4739 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4740 || readfrom.sin_port != addresses[!i].sin_port)
4741 goto abort_tidy_up_and_fail;
4744 /* My caller (my_socketpair) has validated that this is non-NULL */
4747 /* I hereby declare this connection open. May God bless all who cross
4751 abort_tidy_up_and_fail:
4752 errno = ECONNABORTED;
4755 const int save_errno = errno;
4756 if (sockets[0] != -1)
4757 PerlLIO_close(sockets[0]);
4758 if (sockets[1] != -1)
4759 PerlLIO_close(sockets[1]);
4764 #endif /* EMULATE_SOCKETPAIR_UDP */
4766 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4768 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4769 /* Stevens says that family must be AF_LOCAL, protocol 0.
4770 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4775 struct sockaddr_in listen_addr;
4776 struct sockaddr_in connect_addr;
4781 || family != AF_UNIX
4784 errno = EAFNOSUPPORT;
4792 #ifdef EMULATE_SOCKETPAIR_UDP
4793 if (type == SOCK_DGRAM)
4794 return S_socketpair_udp(fd);
4797 listener = PerlSock_socket(AF_INET, type, 0);
4800 memset(&listen_addr, 0, sizeof(listen_addr));
4801 listen_addr.sin_family = AF_INET;
4802 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4803 listen_addr.sin_port = 0; /* kernel choses port. */
4804 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4805 sizeof(listen_addr)) == -1)
4806 goto tidy_up_and_fail;
4807 if (PerlSock_listen(listener, 1) == -1)
4808 goto tidy_up_and_fail;
4810 connector = PerlSock_socket(AF_INET, type, 0);
4811 if (connector == -1)
4812 goto tidy_up_and_fail;
4813 /* We want to find out the port number to connect to. */
4814 size = sizeof(connect_addr);
4815 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4817 goto tidy_up_and_fail;
4818 if (size != sizeof(connect_addr))
4819 goto abort_tidy_up_and_fail;
4820 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4821 sizeof(connect_addr)) == -1)
4822 goto tidy_up_and_fail;
4824 size = sizeof(listen_addr);
4825 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4828 goto tidy_up_and_fail;
4829 if (size != sizeof(listen_addr))
4830 goto abort_tidy_up_and_fail;
4831 PerlLIO_close(listener);
4832 /* Now check we are talking to ourself by matching port and host on the
4834 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4836 goto tidy_up_and_fail;
4837 if (size != sizeof(connect_addr)
4838 || listen_addr.sin_family != connect_addr.sin_family
4839 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4840 || listen_addr.sin_port != connect_addr.sin_port) {
4841 goto abort_tidy_up_and_fail;
4847 abort_tidy_up_and_fail:
4849 errno = ECONNABORTED; /* This would be the standard thing to do. */
4851 # ifdef ECONNREFUSED
4852 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4854 errno = ETIMEDOUT; /* Desperation time. */
4859 const int save_errno = errno;
4861 PerlLIO_close(listener);
4862 if (connector != -1)
4863 PerlLIO_close(connector);
4865 PerlLIO_close(acceptor);
4871 /* In any case have a stub so that there's code corresponding
4872 * to the my_socketpair in global.sym. */
4874 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4875 #ifdef HAS_SOCKETPAIR
4876 return socketpair(family, type, protocol, fd);
4885 =for apidoc sv_nosharing
4887 Dummy routine which "shares" an SV when there is no sharing module present.
4888 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4889 Exists to avoid test for a NULL function pointer and because it could
4890 potentially warn under some level of strict-ness.
4896 Perl_sv_nosharing(pTHX_ SV *sv)
4898 PERL_UNUSED_CONTEXT;
4899 PERL_UNUSED_ARG(sv);
4903 Perl_parse_unicode_opts(pTHX_ const char **popt)
4905 const char *p = *popt;
4910 opt = (U32) atoi(p);
4913 if (*p && *p != '\n' && *p != '\r')
4914 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4919 case PERL_UNICODE_STDIN:
4920 opt |= PERL_UNICODE_STDIN_FLAG; break;
4921 case PERL_UNICODE_STDOUT:
4922 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4923 case PERL_UNICODE_STDERR:
4924 opt |= PERL_UNICODE_STDERR_FLAG; break;
4925 case PERL_UNICODE_STD:
4926 opt |= PERL_UNICODE_STD_FLAG; break;
4927 case PERL_UNICODE_IN:
4928 opt |= PERL_UNICODE_IN_FLAG; break;
4929 case PERL_UNICODE_OUT:
4930 opt |= PERL_UNICODE_OUT_FLAG; break;
4931 case PERL_UNICODE_INOUT:
4932 opt |= PERL_UNICODE_INOUT_FLAG; break;
4933 case PERL_UNICODE_LOCALE:
4934 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4935 case PERL_UNICODE_ARGV:
4936 opt |= PERL_UNICODE_ARGV_FLAG; break;
4937 case PERL_UNICODE_UTF8CACHEASSERT:
4938 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4940 if (*p != '\n' && *p != '\r')
4942 "Unknown Unicode option letter '%c'", *p);
4948 opt = PERL_UNICODE_DEFAULT_FLAGS;
4950 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4951 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4952 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4964 * This is really just a quick hack which grabs various garbage
4965 * values. It really should be a real hash algorithm which
4966 * spreads the effect of every input bit onto every output bit,
4967 * if someone who knows about such things would bother to write it.
4968 * Might be a good idea to add that function to CORE as well.
4969 * No numbers below come from careful analysis or anything here,
4970 * except they are primes and SEED_C1 > 1E6 to get a full-width
4971 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4972 * probably be bigger too.
4975 # define SEED_C1 1000003
4976 #define SEED_C4 73819
4978 # define SEED_C1 25747
4979 #define SEED_C4 20639
4983 #define SEED_C5 26107
4985 #ifndef PERL_NO_DEV_RANDOM
4990 # include <starlet.h>
4991 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4992 * in 100-ns units, typically incremented ever 10 ms. */
4993 unsigned int when[2];
4995 # ifdef HAS_GETTIMEOFDAY
4996 struct timeval when;
5002 /* This test is an escape hatch, this symbol isn't set by Configure. */
5003 #ifndef PERL_NO_DEV_RANDOM
5004 #ifndef PERL_RANDOM_DEVICE
5005 /* /dev/random isn't used by default because reads from it will block
5006 * if there isn't enough entropy available. You can compile with
5007 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5008 * is enough real entropy to fill the seed. */
5009 # define PERL_RANDOM_DEVICE "/dev/urandom"
5011 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5013 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5022 _ckvmssts(sys$gettim(when));
5023 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5025 # ifdef HAS_GETTIMEOFDAY
5026 PerlProc_gettimeofday(&when,NULL);
5027 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5030 u = (U32)SEED_C1 * when;
5033 u += SEED_C3 * (U32)PerlProc_getpid();
5034 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5035 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5036 u += SEED_C5 * (U32)PTR2UV(&when);
5042 Perl_get_hash_seed(pTHX)
5045 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5051 if (s && isDIGIT(*s))
5052 myseed = (UV)Atoul(s);
5054 #ifdef USE_HASH_SEED_EXPLICIT
5058 /* Compute a random seed */
5059 (void)seedDrand01((Rand_seed_t)seed());
5060 myseed = (UV)(Drand01() * (NV)UV_MAX);
5061 #if RANDBITS < (UVSIZE * 8)
5062 /* Since there are not enough randbits to to reach all
5063 * the bits of a UV, the low bits might need extra
5064 * help. Sum in another random number that will
5065 * fill in the low bits. */
5067 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5068 #endif /* RANDBITS < (UVSIZE * 8) */
5069 if (myseed == 0) { /* Superparanoia. */
5070 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5072 Perl_croak(aTHX_ "Your random numbers are not that random");
5075 PL_rehash_seed_set = TRUE;
5082 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5084 const char * const stashpv = CopSTASHPV(c);
5085 const char * const name = HvNAME_get(hv);
5086 PERL_UNUSED_CONTEXT;
5088 if (stashpv == name)
5090 if (stashpv && name)
5091 if (strEQ(stashpv, name))
5098 #ifdef PERL_GLOBAL_STRUCT
5101 Perl_init_global_struct(pTHX)
5103 struct perl_vars *plvarsp = NULL;
5104 #ifdef PERL_GLOBAL_STRUCT
5105 # define PERL_GLOBAL_STRUCT_INIT
5106 # include "opcode.h" /* the ppaddr and check */
5107 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5108 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5109 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5110 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5111 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5115 plvarsp = PL_VarsPtr;
5116 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5122 # define PERLVAR(var,type) /**/
5123 # define PERLVARA(var,n,type) /**/
5124 # define PERLVARI(var,type,init) plvarsp->var = init;
5125 # define PERLVARIC(var,type,init) plvarsp->var = init;
5126 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5127 # include "perlvars.h"
5133 # ifdef PERL_GLOBAL_STRUCT
5134 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5135 if (!plvarsp->Gppaddr)
5137 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5138 if (!plvarsp->Gcheck)
5140 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5141 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5143 # ifdef PERL_SET_VARS
5144 PERL_SET_VARS(plvarsp);
5146 # undef PERL_GLOBAL_STRUCT_INIT
5151 #endif /* PERL_GLOBAL_STRUCT */
5153 #ifdef PERL_GLOBAL_STRUCT
5156 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5158 #ifdef PERL_GLOBAL_STRUCT
5159 # ifdef PERL_UNSET_VARS
5160 PERL_UNSET_VARS(plvarsp);
5162 free(plvarsp->Gppaddr);
5163 free(plvarsp->Gcheck);
5164 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5170 #endif /* PERL_GLOBAL_STRUCT */
5175 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5177 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5178 * variable PERL_MEM_LOG will be consulted, and if the integer value
5179 * of that is true, the logging will happen. (The default is to
5180 * always log if the PERL_MEM_LOG define was in effect.)
5184 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5185 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5187 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5190 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5191 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5192 * in which case the environment variable PERL_MEM_LOG_FD will be
5193 * consulted for the file descriptor number to use.
5195 #ifndef PERL_MEM_LOG_FD
5196 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5200 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)
5202 #ifdef PERL_MEM_LOG_STDERR
5203 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5206 # ifdef PERL_MEM_LOG_ENV
5207 s = getenv("PERL_MEM_LOG");
5208 if (s ? atoi(s) : 0)
5211 /* We can't use SVs or PerlIO for obvious reasons,
5212 * so we'll use stdio and low-level IO instead. */
5213 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5214 # ifdef PERL_MEM_LOG_TIMESTAMP
5216 # ifdef HAS_GETTIMEOFDAY
5217 gettimeofday(&tv, 0);
5219 /* If there are other OS specific ways of hires time than
5220 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5221 * probably that they would be used to fill in the struct
5227 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5228 # ifdef PERL_MEM_LOG_TIMESTAMP
5231 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5232 " %s = %"IVdf": %"UVxf"\n",
5233 # ifdef PERL_MEM_LOG_TIMESTAMP
5234 (int)tv.tv_sec, (int)tv.tv_usec,
5236 filename, linenumber, funcname, n, typesize,
5237 typename, n * typesize, PTR2UV(newalloc));
5238 # ifdef PERL_MEM_LOG_ENV_FD
5239 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5240 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5242 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5251 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)
5253 #ifdef PERL_MEM_LOG_STDERR
5254 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5257 # ifdef PERL_MEM_LOG_ENV
5258 s = PerlEnv_getenv("PERL_MEM_LOG");
5259 if (s ? atoi(s) : 0)
5262 /* We can't use SVs or PerlIO for obvious reasons,
5263 * so we'll use stdio and low-level IO instead. */
5264 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5265 # ifdef PERL_MEM_LOG_TIMESTAMP
5267 gettimeofday(&tv, 0);
5272 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5273 # ifdef PERL_MEM_LOG_TIMESTAMP
5276 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5277 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5278 # ifdef PERL_MEM_LOG_TIMESTAMP
5279 (int)tv.tv_sec, (int)tv.tv_usec,
5281 filename, linenumber, funcname, n, typesize,
5282 typename, n * typesize, PTR2UV(oldalloc),
5284 # ifdef PERL_MEM_LOG_ENV_FD
5285 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5286 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5288 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5297 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5299 #ifdef PERL_MEM_LOG_STDERR
5300 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5303 # ifdef PERL_MEM_LOG_ENV
5304 s = PerlEnv_getenv("PERL_MEM_LOG");
5305 if (s ? atoi(s) : 0)
5308 /* We can't use SVs or PerlIO for obvious reasons,
5309 * so we'll use stdio and low-level IO instead. */
5310 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5311 # ifdef PERL_MEM_LOG_TIMESTAMP
5313 gettimeofday(&tv, 0);
5318 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5319 # ifdef PERL_MEM_LOG_TIMESTAMP
5322 "free: %s:%d:%s: %"UVxf"\n",
5323 # ifdef PERL_MEM_LOG_TIMESTAMP
5324 (int)tv.tv_sec, (int)tv.tv_usec,
5326 filename, linenumber, funcname,
5328 # ifdef PERL_MEM_LOG_ENV_FD
5329 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5330 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5332 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5340 #endif /* PERL_MEM_LOG */
5343 =for apidoc my_sprintf
5345 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5346 the length of the string written to the buffer. Only rare pre-ANSI systems
5347 need the wrapper function - usually this is a direct call to C<sprintf>.
5351 #ifndef SPRINTF_RETURNS_STRLEN
5353 Perl_my_sprintf(char *buffer, const char* pat, ...)
5356 va_start(args, pat);
5357 vsprintf(buffer, pat, args);
5359 return strlen(buffer);
5364 =for apidoc my_snprintf
5366 The C library C<snprintf> functionality, if available and
5367 standards-compliant (uses C<vsnprintf>, actually). However, if the
5368 C<vsnprintf> is not available, will unfortunately use the unsafe
5369 C<vsprintf> which can overrun the buffer (there is an overrun check,
5370 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5371 getting C<vsnprintf>.
5376 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5381 va_start(ap, format);
5382 #ifdef HAS_VSNPRINTF
5383 retval = vsnprintf(buffer, len, format, ap);
5385 retval = vsprintf(buffer, format, ap);
5388 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5389 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5390 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5395 =for apidoc my_vsnprintf
5397 The C library C<vsnprintf> if available and standards-compliant.
5398 However, if if the C<vsnprintf> is not available, will unfortunately
5399 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5400 overrun check, but that may be too late). Consider using
5401 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5406 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5412 Perl_va_copy(ap, apc);
5413 # ifdef HAS_VSNPRINTF
5414 retval = vsnprintf(buffer, len, format, apc);
5416 retval = vsprintf(buffer, format, apc);
5419 # ifdef HAS_VSNPRINTF
5420 retval = vsnprintf(buffer, len, format, ap);
5422 retval = vsprintf(buffer, format, ap);
5424 #endif /* #ifdef NEED_VA_COPY */
5425 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5426 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5427 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5432 Perl_my_clearenv(pTHX)
5435 #if ! defined(PERL_MICRO)
5436 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5438 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5439 # if defined(USE_ENVIRON_ARRAY)
5440 # if defined(USE_ITHREADS)
5441 /* only the parent thread can clobber the process environment */
5442 if (PL_curinterp == aTHX)
5443 # endif /* USE_ITHREADS */
5445 # if ! defined(PERL_USE_SAFE_PUTENV)
5446 if ( !PL_use_safe_putenv) {
5448 if (environ == PL_origenviron)
5449 environ = (char**)safesysmalloc(sizeof(char*));
5451 for (i = 0; environ[i]; i++)
5452 (void)safesysfree(environ[i]);
5455 # else /* PERL_USE_SAFE_PUTENV */
5456 # if defined(HAS_CLEARENV)
5458 # elif defined(HAS_UNSETENV)
5459 int bsiz = 80; /* Most envvar names will be shorter than this. */
5460 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5461 while (*environ != NULL) {
5462 char *e = strchr(*environ, '=');
5463 int l = e ? e - *environ : strlen(*environ);
5465 (void)safesysfree(buf);
5467 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5469 strncpy(buf, *environ, l);
5471 (void)unsetenv(buf);
5473 (void)safesysfree(buf);
5474 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5475 /* Just null environ and accept the leakage. */
5477 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5478 # endif /* ! PERL_USE_SAFE_PUTENV */
5480 # endif /* USE_ENVIRON_ARRAY */
5481 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5482 #endif /* PERL_MICRO */
5485 #ifdef PERL_IMPLICIT_CONTEXT
5487 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5488 the global PL_my_cxt_index is incremented, and that value is assigned to
5489 that module's static my_cxt_index (who's address is passed as an arg).
5490 Then, for each interpreter this function is called for, it makes sure a
5491 void* slot is available to hang the static data off, by allocating or
5492 extending the interpreter's PL_my_cxt_list array */
5495 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5500 /* this module hasn't been allocated an index yet */
5501 MUTEX_LOCK(&PL_my_ctx_mutex);
5502 *index = PL_my_cxt_index++;
5503 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5506 /* make sure the array is big enough */
5507 if (PL_my_cxt_size <= *index) {
5508 if (PL_my_cxt_size) {
5509 while (PL_my_cxt_size <= *index)
5510 PL_my_cxt_size *= 2;
5511 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5514 PL_my_cxt_size = 16;
5515 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5518 /* newSV() allocates one more than needed */
5519 p = (void*)SvPVX(newSV(size-1));
5520 PL_my_cxt_list[*index] = p;
5521 Zero(p, size, char);
5528 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5530 Size_t used, length, copy;
5533 length = strlen(src);
5534 if (size > 0 && used < size - 1) {
5535 copy = (length >= size - used) ? size - used - 1 : length;
5536 memcpy(dst + used, src, copy);
5537 dst[used + copy] = '\0';
5539 return used + length;
5545 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5547 Size_t length, copy;
5549 length = strlen(src);
5551 copy = (length >= size) ? size - 1 : length;
5552 memcpy(dst, src, copy);
5561 * c-indentation-style: bsd
5563 * indent-tabs-mode: t
5566 * ex: set ts=8 sts=4 sw=4 noet: