3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
263 if (size * count > 0xffff) {
264 PerlIO_printf(Perl_error_log,
265 "Allocation too large: %lx\n", size * count) FLUSH;
268 #endif /* HAS_64K_LIMIT */
270 if ((long)size < 0 || (long)count < 0)
271 Perl_croak_nocontext("panic: calloc");
274 #ifdef PERL_TRACK_MEMPOOL
277 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
278 PERL_ALLOC_CHECK(ptr);
279 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
281 memset((void*)ptr, 0, size);
282 #ifdef PERL_TRACK_MEMPOOL
284 struct perl_memory_debug_header *const header
285 = (struct perl_memory_debug_header *)ptr;
287 header->interpreter = aTHX;
288 /* Link us into the list. */
289 header->prev = &PL_memory_debug_header;
290 header->next = PL_memory_debug_header.next;
291 PL_memory_debug_header.next = header;
292 header->next->prev = header;
296 ptr = (Malloc_t)((char*)ptr+sTHX);
303 return write_no_mem();
306 /* These must be defined when not using Perl's malloc for binary
311 Malloc_t Perl_malloc (MEM_SIZE nbytes)
314 return (Malloc_t)PerlMem_malloc(nbytes);
317 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
320 return (Malloc_t)PerlMem_calloc(elements, size);
323 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
326 return (Malloc_t)PerlMem_realloc(where, nbytes);
329 Free_t Perl_mfree (Malloc_t where)
337 /* copy a string up to some (non-backslashed) delimiter, if any */
340 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
345 for (tolen = 0; from < fromend; from++, tolen++) {
347 if (from[1] != delim) {
354 else if (*from == delim)
365 /* return ptr to little string in big string, NULL if not found */
366 /* This routine was donated by Corey Satten. */
369 Perl_instr(pTHX_ register const char *big, register const char *little)
380 register const char *s, *x;
383 for (x=big,s=little; *s; /**/ ) {
394 return (char*)(big-1);
399 /* same as instr but allow embedded nulls */
402 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
408 char first = *little++;
410 bigend -= lend - little;
412 while (big <= bigend) {
415 for (x=big,s=little; s < lend; x++,s++) {
419 return (char*)(big-1);
425 /* reverse of the above--find last substring */
428 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
430 register const char *bigbeg;
431 register const I32 first = *little;
432 register const char * const littleend = lend;
435 if (little >= littleend)
436 return (char*)bigend;
438 big = bigend - (littleend - little++);
439 while (big >= bigbeg) {
440 register const char *s, *x;
443 for (x=big+2,s=little; s < littleend; /**/ ) {
452 return (char*)(big+1);
457 /* As a space optimization, we do not compile tables for strings of length
458 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
459 special-cased in fbm_instr().
461 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
464 =head1 Miscellaneous Functions
466 =for apidoc fbm_compile
468 Analyses the string in order to make fast searches on it using fbm_instr()
469 -- the Boyer-Moore algorithm.
475 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
478 register const U8 *s;
484 if (flags & FBMcf_TAIL) {
485 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
486 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
487 if (mg && mg->mg_len >= 0)
490 s = (U8*)SvPV_force_mutable(sv, len);
491 if (len == 0) /* TAIL might be on a zero-length string. */
493 SvUPGRADE(sv, SVt_PVGV);
496 const unsigned char *sb;
497 const U8 mlen = (len>255) ? 255 : (U8)len;
500 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
502 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
503 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
504 memset((void*)table, mlen, 256);
505 table[PERL_FBM_FLAGS_OFFSET_FROM_TABLE] = (U8)flags;
507 sb = s - mlen + 1; /* first char (maybe) */
509 if (table[*s] == mlen)
514 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
516 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
519 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
520 for (i = 0; i < len; i++) {
521 if (PL_freq[s[i]] < frequency) {
523 frequency = PL_freq[s[i]];
526 BmRARE(sv) = s[rarest];
527 BmPREVIOUS_set(sv, rarest);
528 BmUSEFUL(sv) = 100; /* Initial value */
529 if (flags & FBMcf_TAIL)
531 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
532 BmRARE(sv),BmPREVIOUS(sv)));
535 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
536 /* If SvTAIL is actually due to \Z or \z, this gives false positives
540 =for apidoc fbm_instr
542 Returns the location of the SV in the string delimited by C<str> and
543 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
544 does not have to be fbm_compiled, but the search will not be as fast
551 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
553 register unsigned char *s;
555 register const unsigned char *little
556 = (const unsigned char *)SvPV_const(littlestr,l);
557 register STRLEN littlelen = l;
558 register const I32 multiline = flags & FBMrf_MULTILINE;
560 if ((STRLEN)(bigend - big) < littlelen) {
561 if ( SvTAIL(littlestr)
562 && ((STRLEN)(bigend - big) == littlelen - 1)
564 || (*big == *little &&
565 memEQ((char *)big, (char *)little, littlelen - 1))))
570 if (littlelen <= 2) { /* Special-cased */
572 if (littlelen == 1) {
573 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
574 /* Know that bigend != big. */
575 if (bigend[-1] == '\n')
576 return (char *)(bigend - 1);
577 return (char *) bigend;
585 if (SvTAIL(littlestr))
586 return (char *) bigend;
590 return (char*)big; /* Cannot be SvTAIL! */
593 if (SvTAIL(littlestr) && !multiline) {
594 if (bigend[-1] == '\n' && bigend[-2] == *little)
595 return (char*)bigend - 2;
596 if (bigend[-1] == *little)
597 return (char*)bigend - 1;
601 /* This should be better than FBM if c1 == c2, and almost
602 as good otherwise: maybe better since we do less indirection.
603 And we save a lot of memory by caching no table. */
604 const unsigned char c1 = little[0];
605 const unsigned char c2 = little[1];
610 while (s <= bigend) {
620 goto check_1char_anchor;
631 goto check_1char_anchor;
634 while (s <= bigend) {
639 goto check_1char_anchor;
648 check_1char_anchor: /* One char and anchor! */
649 if (SvTAIL(littlestr) && (*bigend == *little))
650 return (char *)bigend; /* bigend is already decremented. */
653 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
654 s = bigend - littlelen;
655 if (s >= big && bigend[-1] == '\n' && *s == *little
656 /* Automatically of length > 2 */
657 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
659 return (char*)s; /* how sweet it is */
662 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
664 return (char*)s + 1; /* how sweet it is */
668 if (!SvVALID(littlestr)) {
669 char * const b = ninstr((char*)big,(char*)bigend,
670 (char*)little, (char*)little + littlelen);
672 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
673 /* Chop \n from littlestr: */
674 s = bigend - littlelen + 1;
676 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
686 if (littlelen > (STRLEN)(bigend - big))
690 register const unsigned char * const table
691 = little + littlelen + PERL_FBM_TABLE_OFFSET;
692 register const unsigned char *oldlittle;
694 --littlelen; /* Last char found by table lookup */
697 little += littlelen; /* last char */
703 if ((tmp = table[*s])) {
704 if ((s += tmp) < bigend)
708 else { /* less expensive than calling strncmp() */
709 register unsigned char * const olds = s;
714 if (*--s == *--little)
716 s = olds + 1; /* here we pay the price for failure */
718 if (s < bigend) /* fake up continue to outer loop */
727 && (table[PERL_FBM_FLAGS_OFFSET_FROM_TABLE] & FBMcf_TAIL)
728 && memEQ((char *)(bigend - littlelen),
729 (char *)(oldlittle - littlelen), littlelen) )
730 return (char*)bigend - littlelen;
735 /* start_shift, end_shift are positive quantities which give offsets
736 of ends of some substring of bigstr.
737 If "last" we want the last occurrence.
738 old_posp is the way of communication between consequent calls if
739 the next call needs to find the .
740 The initial *old_posp should be -1.
742 Note that we take into account SvTAIL, so one can get extra
743 optimizations if _ALL flag is set.
746 /* If SvTAIL is actually due to \Z or \z, this gives false positives
747 if PL_multiline. In fact if !PL_multiline the authoritative answer
748 is not supported yet. */
751 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
754 register const unsigned char *big;
756 register I32 previous;
758 register const unsigned char *little;
759 register I32 stop_pos;
760 register const unsigned char *littleend;
763 assert(SvTYPE(littlestr) == SVt_PVGV);
764 assert(SvVALID(littlestr));
767 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
768 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
770 if ( BmRARE(littlestr) == '\n'
771 && BmPREVIOUS(littlestr) == (U8)SvCUR(littlestr) - 1) {
772 little = (const unsigned char *)(SvPVX_const(littlestr));
773 littleend = little + SvCUR(littlestr);
780 little = (const unsigned char *)(SvPVX_const(littlestr));
781 littleend = little + SvCUR(littlestr);
783 /* The value of pos we can start at: */
784 previous = BmPREVIOUS(littlestr);
785 big = (const unsigned char *)(SvPVX_const(bigstr));
786 /* The value of pos we can stop at: */
787 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
788 if (previous + start_shift > stop_pos) {
790 stop_pos does not include SvTAIL in the count, so this check is incorrect
791 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
794 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
799 while (pos < previous + start_shift) {
800 if (!(pos += PL_screamnext[pos]))
805 register const unsigned char *s, *x;
806 if (pos >= stop_pos) break;
807 if (big[pos] != first)
809 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
815 if (s == littleend) {
817 if (!last) return (char *)(big+pos);
820 } while ( pos += PL_screamnext[pos] );
822 return (char *)(big+(*old_posp));
824 if (!SvTAIL(littlestr) || (end_shift > 0))
826 /* Ignore the trailing "\n". This code is not microoptimized */
827 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
828 stop_pos = littleend - little; /* Actual littlestr len */
833 && ((stop_pos == 1) ||
834 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
840 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
842 register const U8 *a = (const U8 *)s1;
843 register const U8 *b = (const U8 *)s2;
847 if (*a != *b && *a != PL_fold[*b])
855 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
858 register const U8 *a = (const U8 *)s1;
859 register const U8 *b = (const U8 *)s2;
863 if (*a != *b && *a != PL_fold_locale[*b])
870 /* copy a string to a safe spot */
873 =head1 Memory Management
877 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
878 string which is a duplicate of C<pv>. The size of the string is
879 determined by C<strlen()>. The memory allocated for the new string can
880 be freed with the C<Safefree()> function.
886 Perl_savepv(pTHX_ const char *pv)
893 const STRLEN pvlen = strlen(pv)+1;
894 Newx(newaddr, pvlen, char);
895 return (char*)memcpy(newaddr, pv, pvlen);
899 /* same thing but with a known length */
904 Perl's version of what C<strndup()> would be if it existed. Returns a
905 pointer to a newly allocated string which is a duplicate of the first
906 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
907 the new string can be freed with the C<Safefree()> function.
913 Perl_savepvn(pTHX_ const char *pv, register I32 len)
915 register char *newaddr;
918 Newx(newaddr,len+1,char);
919 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
921 /* might not be null terminated */
923 return (char *) CopyD(pv,newaddr,len,char);
926 return (char *) ZeroD(newaddr,len+1,char);
931 =for apidoc savesharedpv
933 A version of C<savepv()> which allocates the duplicate string in memory
934 which is shared between threads.
939 Perl_savesharedpv(pTHX_ const char *pv)
941 register char *newaddr;
946 pvlen = strlen(pv)+1;
947 newaddr = (char*)PerlMemShared_malloc(pvlen);
949 return write_no_mem();
951 return (char*)memcpy(newaddr, pv, pvlen);
957 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
958 the passed in SV using C<SvPV()>
964 Perl_savesvpv(pTHX_ SV *sv)
967 const char * const pv = SvPV_const(sv, len);
968 register char *newaddr;
971 Newx(newaddr,len,char);
972 return (char *) CopyD(pv,newaddr,len,char);
976 /* the SV for Perl_form() and mess() is not kept in an arena */
986 return sv_2mortal(newSVpvs(""));
991 /* Create as PVMG now, to avoid any upgrading later */
993 Newxz(any, 1, XPVMG);
994 SvFLAGS(sv) = SVt_PVMG;
995 SvANY(sv) = (void*)any;
997 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1002 #if defined(PERL_IMPLICIT_CONTEXT)
1004 Perl_form_nocontext(const char* pat, ...)
1009 va_start(args, pat);
1010 retval = vform(pat, &args);
1014 #endif /* PERL_IMPLICIT_CONTEXT */
1017 =head1 Miscellaneous Functions
1020 Takes a sprintf-style format pattern and conventional
1021 (non-SV) arguments and returns the formatted string.
1023 (char *) Perl_form(pTHX_ const char* pat, ...)
1025 can be used any place a string (char *) is required:
1027 char * s = Perl_form("%d.%d",major,minor);
1029 Uses a single private buffer so if you want to format several strings you
1030 must explicitly copy the earlier strings away (and free the copies when you
1037 Perl_form(pTHX_ const char* pat, ...)
1041 va_start(args, pat);
1042 retval = vform(pat, &args);
1048 Perl_vform(pTHX_ const char *pat, va_list *args)
1050 SV * const sv = mess_alloc();
1051 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1055 #if defined(PERL_IMPLICIT_CONTEXT)
1057 Perl_mess_nocontext(const char *pat, ...)
1062 va_start(args, pat);
1063 retval = vmess(pat, &args);
1067 #endif /* PERL_IMPLICIT_CONTEXT */
1070 Perl_mess(pTHX_ const char *pat, ...)
1074 va_start(args, pat);
1075 retval = vmess(pat, &args);
1081 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1084 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1086 if (!o || o == PL_op)
1089 if (o->op_flags & OPf_KIDS) {
1091 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1094 /* If the OP_NEXTSTATE has been optimised away we can still use it
1095 * the get the file and line number. */
1097 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1098 cop = (const COP *)kid;
1100 /* Keep searching, and return when we've found something. */
1102 new_cop = closest_cop(cop, kid);
1108 /* Nothing found. */
1114 Perl_vmess(pTHX_ const char *pat, va_list *args)
1117 SV * const sv = mess_alloc();
1119 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1120 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1122 * Try and find the file and line for PL_op. This will usually be
1123 * PL_curcop, but it might be a cop that has been optimised away. We
1124 * can try to find such a cop by searching through the optree starting
1125 * from the sibling of PL_curcop.
1128 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1133 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1134 OutCopFILE(cop), (IV)CopLINE(cop));
1135 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1136 const bool line_mode = (RsSIMPLE(PL_rs) &&
1137 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1138 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1139 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1140 line_mode ? "line" : "chunk",
1141 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1144 sv_catpvs(sv, " during global destruction");
1145 sv_catpvs(sv, ".\n");
1151 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1157 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1158 && (io = GvIO(PL_stderrgv))
1159 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1166 SAVESPTR(PL_stderrgv);
1169 PUSHSTACKi(PERLSI_MAGIC);
1173 PUSHs(SvTIED_obj((SV*)io, mg));
1174 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1176 call_method("PRINT", G_SCALAR);
1184 /* SFIO can really mess with your errno */
1185 const int e = errno;
1187 PerlIO * const serr = Perl_error_log;
1189 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1190 (void)PerlIO_flush(serr);
1197 /* Common code used by vcroak, vdie, vwarn and vwarner */
1200 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1206 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1207 /* sv_2cv might call Perl_croak() or Perl_warner() */
1208 SV * const oldhook = *hook;
1215 cv = sv_2cv(oldhook, &stash, &gv, 0);
1217 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1227 if (warn || message) {
1228 msg = newSVpvn(message, msglen);
1229 SvFLAGS(msg) |= utf8;
1237 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1241 call_sv((SV*)cv, G_DISCARD);
1250 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1254 const char *message;
1257 SV * const msv = vmess(pat, args);
1258 if (PL_errors && SvCUR(PL_errors)) {
1259 sv_catsv(PL_errors, msv);
1260 message = SvPV_const(PL_errors, *msglen);
1261 SvCUR_set(PL_errors, 0);
1264 message = SvPV_const(msv,*msglen);
1265 *utf8 = SvUTF8(msv);
1271 DEBUG_S(PerlIO_printf(Perl_debug_log,
1272 "%p: die/croak: message = %s\ndiehook = %p\n",
1273 thr, message, PL_diehook));
1275 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1281 Perl_vdie(pTHX_ const char* pat, va_list *args)
1284 const char *message;
1285 const int was_in_eval = PL_in_eval;
1289 DEBUG_S(PerlIO_printf(Perl_debug_log,
1290 "%p: die: curstack = %p, mainstack = %p\n",
1291 thr, PL_curstack, PL_mainstack));
1293 message = vdie_croak_common(pat, args, &msglen, &utf8);
1295 PL_restartop = die_where(message, msglen);
1296 SvFLAGS(ERRSV) |= utf8;
1297 DEBUG_S(PerlIO_printf(Perl_debug_log,
1298 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1299 thr, PL_restartop, was_in_eval, PL_top_env));
1300 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1302 return PL_restartop;
1305 #if defined(PERL_IMPLICIT_CONTEXT)
1307 Perl_die_nocontext(const char* pat, ...)
1312 va_start(args, pat);
1313 o = vdie(pat, &args);
1317 #endif /* PERL_IMPLICIT_CONTEXT */
1320 Perl_die(pTHX_ const char* pat, ...)
1324 va_start(args, pat);
1325 o = vdie(pat, &args);
1331 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1334 const char *message;
1338 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1341 PL_restartop = die_where(message, msglen);
1342 SvFLAGS(ERRSV) |= utf8;
1346 message = SvPVx_const(ERRSV, msglen);
1348 write_to_stderr(message, msglen);
1352 #if defined(PERL_IMPLICIT_CONTEXT)
1354 Perl_croak_nocontext(const char *pat, ...)
1358 va_start(args, pat);
1363 #endif /* PERL_IMPLICIT_CONTEXT */
1366 =head1 Warning and Dieing
1370 This is the XSUB-writer's interface to Perl's C<die> function.
1371 Normally call this function the same way you call the C C<printf>
1372 function. Calling C<croak> returns control directly to Perl,
1373 sidestepping the normal C order of execution. See C<warn>.
1375 If you want to throw an exception object, assign the object to
1376 C<$@> and then pass C<NULL> to croak():
1378 errsv = get_sv("@", TRUE);
1379 sv_setsv(errsv, exception_object);
1386 Perl_croak(pTHX_ const char *pat, ...)
1389 va_start(args, pat);
1396 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1400 SV * const msv = vmess(pat, args);
1401 const I32 utf8 = SvUTF8(msv);
1402 const char * const message = SvPV_const(msv, msglen);
1405 if (vdie_common(message, msglen, utf8, TRUE))
1409 write_to_stderr(message, msglen);
1412 #if defined(PERL_IMPLICIT_CONTEXT)
1414 Perl_warn_nocontext(const char *pat, ...)
1418 va_start(args, pat);
1422 #endif /* PERL_IMPLICIT_CONTEXT */
1427 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1428 function the same way you call the C C<printf> function. See C<croak>.
1434 Perl_warn(pTHX_ const char *pat, ...)
1437 va_start(args, pat);
1442 #if defined(PERL_IMPLICIT_CONTEXT)
1444 Perl_warner_nocontext(U32 err, const char *pat, ...)
1448 va_start(args, pat);
1449 vwarner(err, pat, &args);
1452 #endif /* PERL_IMPLICIT_CONTEXT */
1455 Perl_warner(pTHX_ U32 err, const char* pat,...)
1458 va_start(args, pat);
1459 vwarner(err, pat, &args);
1464 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1467 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1468 SV * const msv = vmess(pat, args);
1470 const char * const message = SvPV_const(msv, msglen);
1471 const I32 utf8 = SvUTF8(msv);
1475 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1478 PL_restartop = die_where(message, msglen);
1479 SvFLAGS(ERRSV) |= utf8;
1482 write_to_stderr(message, msglen);
1486 Perl_vwarn(aTHX_ pat, args);
1490 /* implements the ckWARN? macros */
1493 Perl_ckwarn(pTHX_ U32 w)
1499 && PL_curcop->cop_warnings != pWARN_NONE
1501 PL_curcop->cop_warnings == pWARN_ALL
1502 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1503 || (unpackWARN2(w) &&
1504 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1505 || (unpackWARN3(w) &&
1506 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1507 || (unpackWARN4(w) &&
1508 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1513 isLEXWARN_off && PL_dowarn & G_WARN_ON
1518 /* implements the ckWARN?_d macro */
1521 Perl_ckwarn_d(pTHX_ U32 w)
1526 || PL_curcop->cop_warnings == pWARN_ALL
1528 PL_curcop->cop_warnings != pWARN_NONE
1530 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1531 || (unpackWARN2(w) &&
1532 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1533 || (unpackWARN3(w) &&
1534 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1535 || (unpackWARN4(w) &&
1536 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1542 /* Set buffer=NULL to get a new one. */
1544 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1546 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1547 PERL_UNUSED_CONTEXT;
1550 (specialWARN(buffer) ?
1551 PerlMemShared_malloc(len_wanted) :
1552 PerlMemShared_realloc(buffer, len_wanted));
1554 Copy(bits, (buffer + 1), size, char);
1558 /* since we've already done strlen() for both nam and val
1559 * we can use that info to make things faster than
1560 * sprintf(s, "%s=%s", nam, val)
1562 #define my_setenv_format(s, nam, nlen, val, vlen) \
1563 Copy(nam, s, nlen, char); \
1565 Copy(val, s+(nlen+1), vlen, char); \
1566 *(s+(nlen+1+vlen)) = '\0'
1568 #ifdef USE_ENVIRON_ARRAY
1569 /* VMS' my_setenv() is in vms.c */
1570 #if !defined(WIN32) && !defined(NETWARE)
1572 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1576 /* only parent thread can modify process environment */
1577 if (PL_curinterp == aTHX)
1580 #ifndef PERL_USE_SAFE_PUTENV
1581 if (!PL_use_safe_putenv) {
1582 /* most putenv()s leak, so we manipulate environ directly */
1583 register I32 i=setenv_getix(nam); /* where does it go? */
1586 if (environ == PL_origenviron) { /* need we copy environment? */
1592 while (environ[max])
1594 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1595 for (j=0; j<max; j++) { /* copy environment */
1596 const int len = strlen(environ[j]);
1597 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1598 Copy(environ[j], tmpenv[j], len+1, char);
1601 environ = tmpenv; /* tell exec where it is now */
1604 safesysfree(environ[i]);
1605 while (environ[i]) {
1606 environ[i] = environ[i+1];
1611 if (!environ[i]) { /* does not exist yet */
1612 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1613 environ[i+1] = NULL; /* make sure it's null terminated */
1616 safesysfree(environ[i]);
1620 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1621 /* all that work just for this */
1622 my_setenv_format(environ[i], nam, nlen, val, vlen);
1625 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1626 # if defined(HAS_UNSETENV)
1628 (void)unsetenv(nam);
1630 (void)setenv(nam, val, 1);
1632 # else /* ! HAS_UNSETENV */
1633 (void)setenv(nam, val, 1);
1634 # endif /* HAS_UNSETENV */
1636 # if defined(HAS_UNSETENV)
1638 (void)unsetenv(nam);
1640 const int nlen = strlen(nam);
1641 const int vlen = strlen(val);
1642 char * const new_env =
1643 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1644 my_setenv_format(new_env, nam, nlen, val, vlen);
1645 (void)putenv(new_env);
1647 # else /* ! HAS_UNSETENV */
1649 const int nlen = strlen(nam);
1655 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1656 /* all that work just for this */
1657 my_setenv_format(new_env, nam, nlen, val, vlen);
1658 (void)putenv(new_env);
1659 # endif /* HAS_UNSETENV */
1660 # endif /* __CYGWIN__ */
1661 #ifndef PERL_USE_SAFE_PUTENV
1667 #else /* WIN32 || NETWARE */
1670 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1673 register char *envstr;
1674 const int nlen = strlen(nam);
1681 Newx(envstr, nlen+vlen+2, char);
1682 my_setenv_format(envstr, nam, nlen, val, vlen);
1683 (void)PerlEnv_putenv(envstr);
1687 #endif /* WIN32 || NETWARE */
1691 Perl_setenv_getix(pTHX_ const char *nam)
1694 register const I32 len = strlen(nam);
1695 PERL_UNUSED_CONTEXT;
1697 for (i = 0; environ[i]; i++) {
1700 strnicmp(environ[i],nam,len) == 0
1702 strnEQ(environ[i],nam,len)
1704 && environ[i][len] == '=')
1705 break; /* strnEQ must come first to avoid */
1706 } /* potential SEGV's */
1709 #endif /* !PERL_MICRO */
1711 #endif /* !VMS && !EPOC*/
1713 #ifdef UNLINK_ALL_VERSIONS
1715 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1719 while (PerlLIO_unlink(f) >= 0)
1721 return retries ? 0 : -1;
1725 /* this is a drop-in replacement for bcopy() */
1726 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1728 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1730 char * const retval = to;
1732 if (from - to >= 0) {
1740 *(--to) = *(--from);
1746 /* this is a drop-in replacement for memset() */
1749 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1751 char * const retval = loc;
1759 /* this is a drop-in replacement for bzero() */
1760 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1762 Perl_my_bzero(register char *loc, register I32 len)
1764 char * const retval = loc;
1772 /* this is a drop-in replacement for memcmp() */
1773 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1775 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1777 register const U8 *a = (const U8 *)s1;
1778 register const U8 *b = (const U8 *)s2;
1782 if ((tmp = *a++ - *b++))
1787 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1791 #ifdef USE_CHAR_VSPRINTF
1796 vsprintf(char *dest, const char *pat, char *args)
1800 fakebuf._ptr = dest;
1801 fakebuf._cnt = 32767;
1805 fakebuf._flag = _IOWRT|_IOSTRG;
1806 _doprnt(pat, args, &fakebuf); /* what a kludge */
1807 (void)putc('\0', &fakebuf);
1808 #ifdef USE_CHAR_VSPRINTF
1811 return 0; /* perl doesn't use return value */
1815 #endif /* HAS_VPRINTF */
1818 #if BYTEORDER != 0x4321
1820 Perl_my_swap(pTHX_ short s)
1822 #if (BYTEORDER & 1) == 0
1825 result = ((s & 255) << 8) + ((s >> 8) & 255);
1833 Perl_my_htonl(pTHX_ long l)
1837 char c[sizeof(long)];
1840 #if BYTEORDER == 0x1234
1841 u.c[0] = (l >> 24) & 255;
1842 u.c[1] = (l >> 16) & 255;
1843 u.c[2] = (l >> 8) & 255;
1847 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1848 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1853 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1854 u.c[o & 0xf] = (l >> s) & 255;
1862 Perl_my_ntohl(pTHX_ long l)
1866 char c[sizeof(long)];
1869 #if BYTEORDER == 0x1234
1870 u.c[0] = (l >> 24) & 255;
1871 u.c[1] = (l >> 16) & 255;
1872 u.c[2] = (l >> 8) & 255;
1876 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1877 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1884 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1885 l |= (u.c[o & 0xf] & 255) << s;
1892 #endif /* BYTEORDER != 0x4321 */
1896 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1897 * If these functions are defined,
1898 * the BYTEORDER is neither 0x1234 nor 0x4321.
1899 * However, this is not assumed.
1903 #define HTOLE(name,type) \
1905 name (register type n) \
1909 char c[sizeof(type)]; \
1912 register U32 s = 0; \
1913 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1914 u.c[i] = (n >> s) & 0xFF; \
1919 #define LETOH(name,type) \
1921 name (register type n) \
1925 char c[sizeof(type)]; \
1928 register U32 s = 0; \
1931 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1932 n |= ((type)(u.c[i] & 0xFF)) << s; \
1938 * Big-endian byte order functions.
1941 #define HTOBE(name,type) \
1943 name (register type n) \
1947 char c[sizeof(type)]; \
1950 register U32 s = 8*(sizeof(u.c)-1); \
1951 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1952 u.c[i] = (n >> s) & 0xFF; \
1957 #define BETOH(name,type) \
1959 name (register type n) \
1963 char c[sizeof(type)]; \
1966 register U32 s = 8*(sizeof(u.c)-1); \
1969 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1970 n |= ((type)(u.c[i] & 0xFF)) << s; \
1976 * If we just can't do it...
1979 #define NOT_AVAIL(name,type) \
1981 name (register type n) \
1983 Perl_croak_nocontext(#name "() not available"); \
1984 return n; /* not reached */ \
1988 #if defined(HAS_HTOVS) && !defined(htovs)
1991 #if defined(HAS_HTOVL) && !defined(htovl)
1994 #if defined(HAS_VTOHS) && !defined(vtohs)
1997 #if defined(HAS_VTOHL) && !defined(vtohl)
2001 #ifdef PERL_NEED_MY_HTOLE16
2003 HTOLE(Perl_my_htole16,U16)
2005 NOT_AVAIL(Perl_my_htole16,U16)
2008 #ifdef PERL_NEED_MY_LETOH16
2010 LETOH(Perl_my_letoh16,U16)
2012 NOT_AVAIL(Perl_my_letoh16,U16)
2015 #ifdef PERL_NEED_MY_HTOBE16
2017 HTOBE(Perl_my_htobe16,U16)
2019 NOT_AVAIL(Perl_my_htobe16,U16)
2022 #ifdef PERL_NEED_MY_BETOH16
2024 BETOH(Perl_my_betoh16,U16)
2026 NOT_AVAIL(Perl_my_betoh16,U16)
2030 #ifdef PERL_NEED_MY_HTOLE32
2032 HTOLE(Perl_my_htole32,U32)
2034 NOT_AVAIL(Perl_my_htole32,U32)
2037 #ifdef PERL_NEED_MY_LETOH32
2039 LETOH(Perl_my_letoh32,U32)
2041 NOT_AVAIL(Perl_my_letoh32,U32)
2044 #ifdef PERL_NEED_MY_HTOBE32
2046 HTOBE(Perl_my_htobe32,U32)
2048 NOT_AVAIL(Perl_my_htobe32,U32)
2051 #ifdef PERL_NEED_MY_BETOH32
2053 BETOH(Perl_my_betoh32,U32)
2055 NOT_AVAIL(Perl_my_betoh32,U32)
2059 #ifdef PERL_NEED_MY_HTOLE64
2061 HTOLE(Perl_my_htole64,U64)
2063 NOT_AVAIL(Perl_my_htole64,U64)
2066 #ifdef PERL_NEED_MY_LETOH64
2068 LETOH(Perl_my_letoh64,U64)
2070 NOT_AVAIL(Perl_my_letoh64,U64)
2073 #ifdef PERL_NEED_MY_HTOBE64
2075 HTOBE(Perl_my_htobe64,U64)
2077 NOT_AVAIL(Perl_my_htobe64,U64)
2080 #ifdef PERL_NEED_MY_BETOH64
2082 BETOH(Perl_my_betoh64,U64)
2084 NOT_AVAIL(Perl_my_betoh64,U64)
2088 #ifdef PERL_NEED_MY_HTOLES
2089 HTOLE(Perl_my_htoles,short)
2091 #ifdef PERL_NEED_MY_LETOHS
2092 LETOH(Perl_my_letohs,short)
2094 #ifdef PERL_NEED_MY_HTOBES
2095 HTOBE(Perl_my_htobes,short)
2097 #ifdef PERL_NEED_MY_BETOHS
2098 BETOH(Perl_my_betohs,short)
2101 #ifdef PERL_NEED_MY_HTOLEI
2102 HTOLE(Perl_my_htolei,int)
2104 #ifdef PERL_NEED_MY_LETOHI
2105 LETOH(Perl_my_letohi,int)
2107 #ifdef PERL_NEED_MY_HTOBEI
2108 HTOBE(Perl_my_htobei,int)
2110 #ifdef PERL_NEED_MY_BETOHI
2111 BETOH(Perl_my_betohi,int)
2114 #ifdef PERL_NEED_MY_HTOLEL
2115 HTOLE(Perl_my_htolel,long)
2117 #ifdef PERL_NEED_MY_LETOHL
2118 LETOH(Perl_my_letohl,long)
2120 #ifdef PERL_NEED_MY_HTOBEL
2121 HTOBE(Perl_my_htobel,long)
2123 #ifdef PERL_NEED_MY_BETOHL
2124 BETOH(Perl_my_betohl,long)
2128 Perl_my_swabn(void *ptr, int n)
2130 register char *s = (char *)ptr;
2131 register char *e = s + (n-1);
2134 for (n /= 2; n > 0; s++, e--, n--) {
2142 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2144 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2147 register I32 This, that;
2153 PERL_FLUSHALL_FOR_CHILD;
2154 This = (*mode == 'w');
2158 taint_proper("Insecure %s%s", "EXEC");
2160 if (PerlProc_pipe(p) < 0)
2162 /* Try for another pipe pair for error return */
2163 if (PerlProc_pipe(pp) >= 0)
2165 while ((pid = PerlProc_fork()) < 0) {
2166 if (errno != EAGAIN) {
2167 PerlLIO_close(p[This]);
2168 PerlLIO_close(p[that]);
2170 PerlLIO_close(pp[0]);
2171 PerlLIO_close(pp[1]);
2183 /* Close parent's end of error status pipe (if any) */
2185 PerlLIO_close(pp[0]);
2186 #if defined(HAS_FCNTL) && defined(F_SETFD)
2187 /* Close error pipe automatically if exec works */
2188 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2191 /* Now dup our end of _the_ pipe to right position */
2192 if (p[THIS] != (*mode == 'r')) {
2193 PerlLIO_dup2(p[THIS], *mode == 'r');
2194 PerlLIO_close(p[THIS]);
2195 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2196 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2199 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2200 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2201 /* No automatic close - do it by hand */
2208 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2214 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2220 do_execfree(); /* free any memory malloced by child on fork */
2222 PerlLIO_close(pp[1]);
2223 /* Keep the lower of the two fd numbers */
2224 if (p[that] < p[This]) {
2225 PerlLIO_dup2(p[This], p[that]);
2226 PerlLIO_close(p[This]);
2230 PerlLIO_close(p[that]); /* close child's end of pipe */
2233 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2235 SvUPGRADE(sv,SVt_IV);
2237 PL_forkprocess = pid;
2238 /* If we managed to get status pipe check for exec fail */
2239 if (did_pipes && pid > 0) {
2244 while (n < sizeof(int)) {
2245 n1 = PerlLIO_read(pp[0],
2246 (void*)(((char*)&errkid)+n),
2252 PerlLIO_close(pp[0]);
2254 if (n) { /* Error */
2256 PerlLIO_close(p[This]);
2257 if (n != sizeof(int))
2258 Perl_croak(aTHX_ "panic: kid popen errno read");
2260 pid2 = wait4pid(pid, &status, 0);
2261 } while (pid2 == -1 && errno == EINTR);
2262 errno = errkid; /* Propagate errno from kid */
2267 PerlLIO_close(pp[0]);
2268 return PerlIO_fdopen(p[This], mode);
2270 Perl_croak(aTHX_ "List form of piped open not implemented");
2271 return (PerlIO *) NULL;
2275 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2276 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2278 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2282 register I32 This, that;
2285 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2289 PERL_FLUSHALL_FOR_CHILD;
2292 return my_syspopen(aTHX_ cmd,mode);
2295 This = (*mode == 'w');
2297 if (doexec && PL_tainting) {
2299 taint_proper("Insecure %s%s", "EXEC");
2301 if (PerlProc_pipe(p) < 0)
2303 if (doexec && PerlProc_pipe(pp) >= 0)
2305 while ((pid = PerlProc_fork()) < 0) {
2306 if (errno != EAGAIN) {
2307 PerlLIO_close(p[This]);
2308 PerlLIO_close(p[that]);
2310 PerlLIO_close(pp[0]);
2311 PerlLIO_close(pp[1]);
2314 Perl_croak(aTHX_ "Can't fork");
2327 PerlLIO_close(pp[0]);
2328 #if defined(HAS_FCNTL) && defined(F_SETFD)
2329 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2332 if (p[THIS] != (*mode == 'r')) {
2333 PerlLIO_dup2(p[THIS], *mode == 'r');
2334 PerlLIO_close(p[THIS]);
2335 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2336 PerlLIO_close(p[THAT]);
2339 PerlLIO_close(p[THAT]);
2342 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2349 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2354 /* may or may not use the shell */
2355 do_exec3(cmd, pp[1], did_pipes);
2358 #endif /* defined OS2 */
2360 #ifdef PERLIO_USING_CRLF
2361 /* Since we circumvent IO layers when we manipulate low-level
2362 filedescriptors directly, need to manually switch to the
2363 default, binary, low-level mode; see PerlIOBuf_open(). */
2364 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2367 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2368 SvREADONLY_off(GvSV(tmpgv));
2369 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2370 SvREADONLY_on(GvSV(tmpgv));
2372 #ifdef THREADS_HAVE_PIDS
2373 PL_ppid = (IV)getppid();
2376 #ifdef PERL_USES_PL_PIDSTATUS
2377 hv_clear(PL_pidstatus); /* we have no children */
2383 do_execfree(); /* free any memory malloced by child on vfork */
2385 PerlLIO_close(pp[1]);
2386 if (p[that] < p[This]) {
2387 PerlLIO_dup2(p[This], p[that]);
2388 PerlLIO_close(p[This]);
2392 PerlLIO_close(p[that]);
2395 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2397 SvUPGRADE(sv,SVt_IV);
2399 PL_forkprocess = pid;
2400 if (did_pipes && pid > 0) {
2405 while (n < sizeof(int)) {
2406 n1 = PerlLIO_read(pp[0],
2407 (void*)(((char*)&errkid)+n),
2413 PerlLIO_close(pp[0]);
2415 if (n) { /* Error */
2417 PerlLIO_close(p[This]);
2418 if (n != sizeof(int))
2419 Perl_croak(aTHX_ "panic: kid popen errno read");
2421 pid2 = wait4pid(pid, &status, 0);
2422 } while (pid2 == -1 && errno == EINTR);
2423 errno = errkid; /* Propagate errno from kid */
2428 PerlLIO_close(pp[0]);
2429 return PerlIO_fdopen(p[This], mode);
2432 #if defined(atarist) || defined(EPOC)
2435 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2437 PERL_FLUSHALL_FOR_CHILD;
2438 /* Call system's popen() to get a FILE *, then import it.
2439 used 0 for 2nd parameter to PerlIO_importFILE;
2442 return PerlIO_importFILE(popen(cmd, mode), 0);
2446 FILE *djgpp_popen();
2448 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2450 PERL_FLUSHALL_FOR_CHILD;
2451 /* Call system's popen() to get a FILE *, then import it.
2452 used 0 for 2nd parameter to PerlIO_importFILE;
2455 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2460 #endif /* !DOSISH */
2462 /* this is called in parent before the fork() */
2464 Perl_atfork_lock(void)
2467 #if defined(USE_ITHREADS)
2468 /* locks must be held in locking order (if any) */
2470 MUTEX_LOCK(&PL_malloc_mutex);
2476 /* this is called in both parent and child after the fork() */
2478 Perl_atfork_unlock(void)
2481 #if defined(USE_ITHREADS)
2482 /* locks must be released in same order as in atfork_lock() */
2484 MUTEX_UNLOCK(&PL_malloc_mutex);
2493 #if defined(HAS_FORK)
2495 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2500 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2501 * handlers elsewhere in the code */
2506 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2507 Perl_croak_nocontext("fork() not available");
2509 #endif /* HAS_FORK */
2514 Perl_dump_fds(pTHX_ char *s)
2519 PerlIO_printf(Perl_debug_log,"%s", s);
2520 for (fd = 0; fd < 32; fd++) {
2521 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2522 PerlIO_printf(Perl_debug_log," %d",fd);
2524 PerlIO_printf(Perl_debug_log,"\n");
2527 #endif /* DUMP_FDS */
2531 dup2(int oldfd, int newfd)
2533 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2536 PerlLIO_close(newfd);
2537 return fcntl(oldfd, F_DUPFD, newfd);
2539 #define DUP2_MAX_FDS 256
2540 int fdtmp[DUP2_MAX_FDS];
2546 PerlLIO_close(newfd);
2547 /* good enough for low fd's... */
2548 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2549 if (fdx >= DUP2_MAX_FDS) {
2557 PerlLIO_close(fdtmp[--fdx]);
2564 #ifdef HAS_SIGACTION
2566 #ifdef MACOS_TRADITIONAL
2567 /* We don't want restart behavior on MacOS */
2572 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2575 struct sigaction act, oact;
2578 /* only "parent" interpreter can diddle signals */
2579 if (PL_curinterp != aTHX)
2580 return (Sighandler_t) SIG_ERR;
2583 act.sa_handler = (void(*)(int))handler;
2584 sigemptyset(&act.sa_mask);
2587 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2588 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2590 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2591 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2592 act.sa_flags |= SA_NOCLDWAIT;
2594 if (sigaction(signo, &act, &oact) == -1)
2595 return (Sighandler_t) SIG_ERR;
2597 return (Sighandler_t) oact.sa_handler;
2601 Perl_rsignal_state(pTHX_ int signo)
2603 struct sigaction oact;
2604 PERL_UNUSED_CONTEXT;
2606 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2607 return (Sighandler_t) SIG_ERR;
2609 return (Sighandler_t) oact.sa_handler;
2613 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2616 struct sigaction act;
2619 /* only "parent" interpreter can diddle signals */
2620 if (PL_curinterp != aTHX)
2624 act.sa_handler = (void(*)(int))handler;
2625 sigemptyset(&act.sa_mask);
2628 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2629 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2631 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2632 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2633 act.sa_flags |= SA_NOCLDWAIT;
2635 return sigaction(signo, &act, save);
2639 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2643 /* only "parent" interpreter can diddle signals */
2644 if (PL_curinterp != aTHX)
2648 return sigaction(signo, save, (struct sigaction *)NULL);
2651 #else /* !HAS_SIGACTION */
2654 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2656 #if defined(USE_ITHREADS) && !defined(WIN32)
2657 /* only "parent" interpreter can diddle signals */
2658 if (PL_curinterp != aTHX)
2659 return (Sighandler_t) SIG_ERR;
2662 return PerlProc_signal(signo, handler);
2673 Perl_rsignal_state(pTHX_ int signo)
2676 Sighandler_t oldsig;
2678 #if defined(USE_ITHREADS) && !defined(WIN32)
2679 /* only "parent" interpreter can diddle signals */
2680 if (PL_curinterp != aTHX)
2681 return (Sighandler_t) SIG_ERR;
2685 oldsig = PerlProc_signal(signo, sig_trap);
2686 PerlProc_signal(signo, oldsig);
2688 PerlProc_kill(PerlProc_getpid(), signo);
2693 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2695 #if defined(USE_ITHREADS) && !defined(WIN32)
2696 /* only "parent" interpreter can diddle signals */
2697 if (PL_curinterp != aTHX)
2700 *save = PerlProc_signal(signo, handler);
2701 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2705 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2707 #if defined(USE_ITHREADS) && !defined(WIN32)
2708 /* only "parent" interpreter can diddle signals */
2709 if (PL_curinterp != aTHX)
2712 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2715 #endif /* !HAS_SIGACTION */
2716 #endif /* !PERL_MICRO */
2718 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2719 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2721 Perl_my_pclose(pTHX_ PerlIO *ptr)
2724 Sigsave_t hstat, istat, qstat;
2730 int saved_errno = 0;
2732 int saved_win32_errno;
2736 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2738 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2740 *svp = &PL_sv_undef;
2742 if (pid == -1) { /* Opened by popen. */
2743 return my_syspclose(ptr);
2746 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2747 saved_errno = errno;
2749 saved_win32_errno = GetLastError();
2753 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2756 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2757 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2758 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2761 pid2 = wait4pid(pid, &status, 0);
2762 } while (pid2 == -1 && errno == EINTR);
2764 rsignal_restore(SIGHUP, &hstat);
2765 rsignal_restore(SIGINT, &istat);
2766 rsignal_restore(SIGQUIT, &qstat);
2769 SETERRNO(saved_errno, 0);
2772 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2774 #endif /* !DOSISH */
2776 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2778 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2784 #ifdef PERL_USES_PL_PIDSTATUS
2787 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2788 pid, rather than a string form. */
2789 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2790 if (svp && *svp != &PL_sv_undef) {
2791 *statusp = SvIVX(*svp);
2792 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2800 hv_iterinit(PL_pidstatus);
2801 if ((entry = hv_iternext(PL_pidstatus))) {
2802 SV * const sv = hv_iterval(PL_pidstatus,entry);
2804 const char * const spid = hv_iterkey(entry,&len);
2806 assert (len == sizeof(Pid_t));
2807 memcpy((char *)&pid, spid, len);
2808 *statusp = SvIVX(sv);
2809 /* The hash iterator is currently on this entry, so simply
2810 calling hv_delete would trigger the lazy delete, which on
2811 aggregate does more work, beacuse next call to hv_iterinit()
2812 would spot the flag, and have to call the delete routine,
2813 while in the meantime any new entries can't re-use that
2815 hv_iterinit(PL_pidstatus);
2816 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2823 # ifdef HAS_WAITPID_RUNTIME
2824 if (!HAS_WAITPID_RUNTIME)
2827 result = PerlProc_waitpid(pid,statusp,flags);
2830 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2831 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2834 #ifdef PERL_USES_PL_PIDSTATUS
2835 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2840 Perl_croak(aTHX_ "Can't do waitpid with flags");
2842 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2843 pidgone(result,*statusp);
2849 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2852 if (result < 0 && errno == EINTR) {
2857 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2859 #ifdef PERL_USES_PL_PIDSTATUS
2861 Perl_pidgone(pTHX_ Pid_t pid, int status)
2865 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2866 SvUPGRADE(sv,SVt_IV);
2867 SvIV_set(sv, status);
2872 #if defined(atarist) || defined(OS2) || defined(EPOC)
2875 int /* Cannot prototype with I32
2877 my_syspclose(PerlIO *ptr)
2880 Perl_my_pclose(pTHX_ PerlIO *ptr)
2883 /* Needs work for PerlIO ! */
2884 FILE * const f = PerlIO_findFILE(ptr);
2885 const I32 result = pclose(f);
2886 PerlIO_releaseFILE(ptr,f);
2894 Perl_my_pclose(pTHX_ PerlIO *ptr)
2896 /* Needs work for PerlIO ! */
2897 FILE * const f = PerlIO_findFILE(ptr);
2898 I32 result = djgpp_pclose(f);
2899 result = (result << 8) & 0xff00;
2900 PerlIO_releaseFILE(ptr,f);
2906 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2909 register const char * const frombase = from;
2910 PERL_UNUSED_CONTEXT;
2913 register const char c = *from;
2918 while (count-- > 0) {
2919 for (todo = len; todo > 0; todo--) {
2928 Perl_same_dirent(pTHX_ const char *a, const char *b)
2930 char *fa = strrchr(a,'/');
2931 char *fb = strrchr(b,'/');
2934 SV * const tmpsv = sv_newmortal();
2947 sv_setpvn(tmpsv, ".", 1);
2949 sv_setpvn(tmpsv, a, fa - a);
2950 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2953 sv_setpvn(tmpsv, ".", 1);
2955 sv_setpvn(tmpsv, b, fb - b);
2956 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2958 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2959 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2961 #endif /* !HAS_RENAME */
2964 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2965 const char *const *const search_ext, I32 flags)
2968 const char *xfound = NULL;
2969 char *xfailed = NULL;
2970 char tmpbuf[MAXPATHLEN];
2974 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2975 # define SEARCH_EXTS ".bat", ".cmd", NULL
2976 # define MAX_EXT_LEN 4
2979 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2980 # define MAX_EXT_LEN 4
2983 # define SEARCH_EXTS ".pl", ".com", NULL
2984 # define MAX_EXT_LEN 4
2986 /* additional extensions to try in each dir if scriptname not found */
2988 static const char *const exts[] = { SEARCH_EXTS };
2989 const char *const *const ext = search_ext ? search_ext : exts;
2990 int extidx = 0, i = 0;
2991 const char *curext = NULL;
2993 PERL_UNUSED_ARG(search_ext);
2994 # define MAX_EXT_LEN 0
2998 * If dosearch is true and if scriptname does not contain path
2999 * delimiters, search the PATH for scriptname.
3001 * If SEARCH_EXTS is also defined, will look for each
3002 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3003 * while searching the PATH.
3005 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3006 * proceeds as follows:
3007 * If DOSISH or VMSISH:
3008 * + look for ./scriptname{,.foo,.bar}
3009 * + search the PATH for scriptname{,.foo,.bar}
3012 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3013 * this will not look in '.' if it's not in the PATH)
3018 # ifdef ALWAYS_DEFTYPES
3019 len = strlen(scriptname);
3020 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3021 int idx = 0, deftypes = 1;
3024 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3027 int idx = 0, deftypes = 1;
3030 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3032 /* The first time through, just add SEARCH_EXTS to whatever we
3033 * already have, so we can check for default file types. */
3035 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3041 if ((strlen(tmpbuf) + strlen(scriptname)
3042 + MAX_EXT_LEN) >= sizeof tmpbuf)
3043 continue; /* don't search dir with too-long name */
3044 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3048 if (strEQ(scriptname, "-"))
3050 if (dosearch) { /* Look in '.' first. */
3051 const char *cur = scriptname;
3053 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3055 if (strEQ(ext[i++],curext)) {
3056 extidx = -1; /* already has an ext */
3061 DEBUG_p(PerlIO_printf(Perl_debug_log,
3062 "Looking for %s\n",cur));
3063 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3064 && !S_ISDIR(PL_statbuf.st_mode)) {
3072 if (cur == scriptname) {
3073 len = strlen(scriptname);
3074 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3076 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3079 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3080 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3085 #ifdef MACOS_TRADITIONAL
3086 if (dosearch && !strchr(scriptname, ':') &&
3087 (s = PerlEnv_getenv("Commands")))
3089 if (dosearch && !strchr(scriptname, '/')
3091 && !strchr(scriptname, '\\')
3093 && (s = PerlEnv_getenv("PATH")))
3098 PL_bufend = s + strlen(s);
3099 while (s < PL_bufend) {
3100 #ifdef MACOS_TRADITIONAL
3101 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3105 #if defined(atarist) || defined(DOSISH)
3110 && *s != ';'; len++, s++) {
3111 if (len < sizeof tmpbuf)
3114 if (len < sizeof tmpbuf)
3116 #else /* ! (atarist || DOSISH) */
3117 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3120 #endif /* ! (atarist || DOSISH) */
3121 #endif /* MACOS_TRADITIONAL */
3124 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3125 continue; /* don't search dir with too-long name */
3126 #ifdef MACOS_TRADITIONAL
3127 if (len && tmpbuf[len - 1] != ':')
3128 tmpbuf[len++] = ':';
3131 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3132 && tmpbuf[len - 1] != '/'
3133 && tmpbuf[len - 1] != '\\'
3136 tmpbuf[len++] = '/';
3137 if (len == 2 && tmpbuf[0] == '.')
3140 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3144 len = strlen(tmpbuf);
3145 if (extidx > 0) /* reset after previous loop */
3149 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3150 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3151 if (S_ISDIR(PL_statbuf.st_mode)) {
3155 } while ( retval < 0 /* not there */
3156 && extidx>=0 && ext[extidx] /* try an extension? */
3157 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3162 if (S_ISREG(PL_statbuf.st_mode)
3163 && cando(S_IRUSR,TRUE,&PL_statbuf)
3164 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3165 && cando(S_IXUSR,TRUE,&PL_statbuf)
3169 xfound = tmpbuf; /* bingo! */
3173 xfailed = savepv(tmpbuf);
3176 if (!xfound && !seen_dot && !xfailed &&
3177 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3178 || S_ISDIR(PL_statbuf.st_mode)))
3180 seen_dot = 1; /* Disable message. */
3182 if (flags & 1) { /* do or die? */
3183 Perl_croak(aTHX_ "Can't %s %s%s%s",
3184 (xfailed ? "execute" : "find"),
3185 (xfailed ? xfailed : scriptname),
3186 (xfailed ? "" : " on PATH"),
3187 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3192 scriptname = xfound;
3194 return (scriptname ? savepv(scriptname) : NULL);
3197 #ifndef PERL_GET_CONTEXT_DEFINED
3200 Perl_get_context(void)
3203 #if defined(USE_ITHREADS)
3204 # ifdef OLD_PTHREADS_API
3206 if (pthread_getspecific(PL_thr_key, &t))
3207 Perl_croak_nocontext("panic: pthread_getspecific");
3210 # ifdef I_MACH_CTHREADS
3211 return (void*)cthread_data(cthread_self());
3213 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3222 Perl_set_context(void *t)
3225 #if defined(USE_ITHREADS)
3226 # ifdef I_MACH_CTHREADS
3227 cthread_set_data(cthread_self(), t);
3229 if (pthread_setspecific(PL_thr_key, t))
3230 Perl_croak_nocontext("panic: pthread_setspecific");
3237 #endif /* !PERL_GET_CONTEXT_DEFINED */
3239 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3248 Perl_get_op_names(pTHX)
3250 PERL_UNUSED_CONTEXT;
3251 return (char **)PL_op_name;
3255 Perl_get_op_descs(pTHX)
3257 PERL_UNUSED_CONTEXT;
3258 return (char **)PL_op_desc;
3262 Perl_get_no_modify(pTHX)
3264 PERL_UNUSED_CONTEXT;
3265 return PL_no_modify;
3269 Perl_get_opargs(pTHX)
3271 PERL_UNUSED_CONTEXT;
3272 return (U32 *)PL_opargs;
3276 Perl_get_ppaddr(pTHX)
3279 PERL_UNUSED_CONTEXT;
3280 return (PPADDR_t*)PL_ppaddr;
3283 #ifndef HAS_GETENV_LEN
3285 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3287 char * const env_trans = PerlEnv_getenv(env_elem);
3288 PERL_UNUSED_CONTEXT;
3290 *len = strlen(env_trans);
3297 Perl_get_vtbl(pTHX_ int vtbl_id)
3299 const MGVTBL* result;
3300 PERL_UNUSED_CONTEXT;
3304 result = &PL_vtbl_sv;
3307 result = &PL_vtbl_env;
3309 case want_vtbl_envelem:
3310 result = &PL_vtbl_envelem;
3313 result = &PL_vtbl_sig;
3315 case want_vtbl_sigelem:
3316 result = &PL_vtbl_sigelem;
3318 case want_vtbl_pack:
3319 result = &PL_vtbl_pack;
3321 case want_vtbl_packelem:
3322 result = &PL_vtbl_packelem;
3324 case want_vtbl_dbline:
3325 result = &PL_vtbl_dbline;
3328 result = &PL_vtbl_isa;
3330 case want_vtbl_isaelem:
3331 result = &PL_vtbl_isaelem;
3333 case want_vtbl_arylen:
3334 result = &PL_vtbl_arylen;
3336 case want_vtbl_mglob:
3337 result = &PL_vtbl_mglob;
3339 case want_vtbl_nkeys:
3340 result = &PL_vtbl_nkeys;
3342 case want_vtbl_taint:
3343 result = &PL_vtbl_taint;
3345 case want_vtbl_substr:
3346 result = &PL_vtbl_substr;
3349 result = &PL_vtbl_vec;
3352 result = &PL_vtbl_pos;
3355 result = &PL_vtbl_bm;
3358 result = &PL_vtbl_fm;
3360 case want_vtbl_uvar:
3361 result = &PL_vtbl_uvar;
3363 case want_vtbl_defelem:
3364 result = &PL_vtbl_defelem;
3366 case want_vtbl_regexp:
3367 result = &PL_vtbl_regexp;
3369 case want_vtbl_regdata:
3370 result = &PL_vtbl_regdata;
3372 case want_vtbl_regdatum:
3373 result = &PL_vtbl_regdatum;
3375 #ifdef USE_LOCALE_COLLATE
3376 case want_vtbl_collxfrm:
3377 result = &PL_vtbl_collxfrm;
3380 case want_vtbl_amagic:
3381 result = &PL_vtbl_amagic;
3383 case want_vtbl_amagicelem:
3384 result = &PL_vtbl_amagicelem;
3386 case want_vtbl_backref:
3387 result = &PL_vtbl_backref;
3389 case want_vtbl_utf8:
3390 result = &PL_vtbl_utf8;
3396 return (MGVTBL*)result;
3400 Perl_my_fflush_all(pTHX)
3402 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3403 return PerlIO_flush(NULL);
3405 # if defined(HAS__FWALK)
3406 extern int fflush(FILE *);
3407 /* undocumented, unprototyped, but very useful BSDism */
3408 extern void _fwalk(int (*)(FILE *));
3412 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3414 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3415 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3417 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3418 open_max = sysconf(_SC_OPEN_MAX);
3421 open_max = FOPEN_MAX;
3424 open_max = OPEN_MAX;
3435 for (i = 0; i < open_max; i++)
3436 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3437 STDIO_STREAM_ARRAY[i]._file < open_max &&
3438 STDIO_STREAM_ARRAY[i]._flag)
3439 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3443 SETERRNO(EBADF,RMS_IFI);
3450 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3452 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3454 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3455 if (ckWARN(WARN_IO)) {
3456 const char * const direction =
3457 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3459 Perl_warner(aTHX_ packWARN(WARN_IO),
3460 "Filehandle %s opened only for %sput",
3463 Perl_warner(aTHX_ packWARN(WARN_IO),
3464 "Filehandle opened only for %sput", direction);
3471 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3473 warn_type = WARN_CLOSED;
3477 warn_type = WARN_UNOPENED;
3480 if (ckWARN(warn_type)) {
3481 const char * const pars =
3482 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3483 const char * const func =
3485 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3486 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3487 op < 0 ? "" : /* handle phoney cases */
3489 const char * const type =
3491 (OP_IS_SOCKET(op) ||
3492 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3493 "socket" : "filehandle");
3494 if (name && *name) {
3495 Perl_warner(aTHX_ packWARN(warn_type),
3496 "%s%s on %s %s %s", func, pars, vile, type, name);
3497 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3499 aTHX_ packWARN(warn_type),
3500 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3505 Perl_warner(aTHX_ packWARN(warn_type),
3506 "%s%s on %s %s", func, pars, vile, type);
3507 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3509 aTHX_ packWARN(warn_type),
3510 "\t(Are you trying to call %s%s on dirhandle?)\n",
3519 /* in ASCII order, not that it matters */
3520 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3523 Perl_ebcdic_control(pTHX_ int ch)
3531 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3532 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3535 if (ctlp == controllablechars)
3536 return('\177'); /* DEL */
3538 return((unsigned char)(ctlp - controllablechars - 1));
3539 } else { /* Want uncontrol */
3540 if (ch == '\177' || ch == -1)
3542 else if (ch == '\157')
3544 else if (ch == '\174')
3546 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3548 else if (ch == '\155')
3550 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3551 return(controllablechars[ch+1]);
3553 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3558 /* To workaround core dumps from the uninitialised tm_zone we get the
3559 * system to give us a reasonable struct to copy. This fix means that
3560 * strftime uses the tm_zone and tm_gmtoff values returned by
3561 * localtime(time()). That should give the desired result most of the
3562 * time. But probably not always!
3564 * This does not address tzname aspects of NETaa14816.
3569 # ifndef STRUCT_TM_HASZONE
3570 # define STRUCT_TM_HASZONE
3574 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3575 # ifndef HAS_TM_TM_ZONE
3576 # define HAS_TM_TM_ZONE
3581 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3583 #ifdef HAS_TM_TM_ZONE
3585 const struct tm* my_tm;
3587 my_tm = localtime(&now);
3589 Copy(my_tm, ptm, 1, struct tm);
3591 PERL_UNUSED_ARG(ptm);
3596 * mini_mktime - normalise struct tm values without the localtime()
3597 * semantics (and overhead) of mktime().
3600 Perl_mini_mktime(pTHX_ struct tm *ptm)
3604 int month, mday, year, jday;
3605 int odd_cent, odd_year;
3606 PERL_UNUSED_CONTEXT;
3608 #define DAYS_PER_YEAR 365
3609 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3610 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3611 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3612 #define SECS_PER_HOUR (60*60)
3613 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3614 /* parentheses deliberately absent on these two, otherwise they don't work */
3615 #define MONTH_TO_DAYS 153/5
3616 #define DAYS_TO_MONTH 5/153
3617 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3618 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3619 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3620 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3623 * Year/day algorithm notes:
3625 * With a suitable offset for numeric value of the month, one can find
3626 * an offset into the year by considering months to have 30.6 (153/5) days,
3627 * using integer arithmetic (i.e., with truncation). To avoid too much
3628 * messing about with leap days, we consider January and February to be
3629 * the 13th and 14th month of the previous year. After that transformation,
3630 * we need the month index we use to be high by 1 from 'normal human' usage,
3631 * so the month index values we use run from 4 through 15.
3633 * Given that, and the rules for the Gregorian calendar (leap years are those
3634 * divisible by 4 unless also divisible by 100, when they must be divisible
3635 * by 400 instead), we can simply calculate the number of days since some
3636 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3637 * the days we derive from our month index, and adding in the day of the
3638 * month. The value used here is not adjusted for the actual origin which
3639 * it normally would use (1 January A.D. 1), since we're not exposing it.
3640 * We're only building the value so we can turn around and get the
3641 * normalised values for the year, month, day-of-month, and day-of-year.
3643 * For going backward, we need to bias the value we're using so that we find
3644 * the right year value. (Basically, we don't want the contribution of
3645 * March 1st to the number to apply while deriving the year). Having done
3646 * that, we 'count up' the contribution to the year number by accounting for
3647 * full quadracenturies (400-year periods) with their extra leap days, plus
3648 * the contribution from full centuries (to avoid counting in the lost leap
3649 * days), plus the contribution from full quad-years (to count in the normal
3650 * leap days), plus the leftover contribution from any non-leap years.
3651 * At this point, if we were working with an actual leap day, we'll have 0
3652 * days left over. This is also true for March 1st, however. So, we have
3653 * to special-case that result, and (earlier) keep track of the 'odd'
3654 * century and year contributions. If we got 4 extra centuries in a qcent,
3655 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3656 * Otherwise, we add back in the earlier bias we removed (the 123 from
3657 * figuring in March 1st), find the month index (integer division by 30.6),
3658 * and the remainder is the day-of-month. We then have to convert back to
3659 * 'real' months (including fixing January and February from being 14/15 in
3660 * the previous year to being in the proper year). After that, to get
3661 * tm_yday, we work with the normalised year and get a new yearday value for
3662 * January 1st, which we subtract from the yearday value we had earlier,
3663 * representing the date we've re-built. This is done from January 1
3664 * because tm_yday is 0-origin.
3666 * Since POSIX time routines are only guaranteed to work for times since the
3667 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3668 * applies Gregorian calendar rules even to dates before the 16th century
3669 * doesn't bother me. Besides, you'd need cultural context for a given
3670 * date to know whether it was Julian or Gregorian calendar, and that's
3671 * outside the scope for this routine. Since we convert back based on the
3672 * same rules we used to build the yearday, you'll only get strange results
3673 * for input which needed normalising, or for the 'odd' century years which
3674 * were leap years in the Julian calander but not in the Gregorian one.
3675 * I can live with that.
3677 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3678 * that's still outside the scope for POSIX time manipulation, so I don't
3682 year = 1900 + ptm->tm_year;
3683 month = ptm->tm_mon;
3684 mday = ptm->tm_mday;
3685 /* allow given yday with no month & mday to dominate the result */
3686 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3689 jday = 1 + ptm->tm_yday;
3698 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3699 yearday += month*MONTH_TO_DAYS + mday + jday;
3701 * Note that we don't know when leap-seconds were or will be,
3702 * so we have to trust the user if we get something which looks
3703 * like a sensible leap-second. Wild values for seconds will
3704 * be rationalised, however.
3706 if ((unsigned) ptm->tm_sec <= 60) {
3713 secs += 60 * ptm->tm_min;
3714 secs += SECS_PER_HOUR * ptm->tm_hour;
3716 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3717 /* got negative remainder, but need positive time */
3718 /* back off an extra day to compensate */
3719 yearday += (secs/SECS_PER_DAY)-1;
3720 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3723 yearday += (secs/SECS_PER_DAY);
3724 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3727 else if (secs >= SECS_PER_DAY) {
3728 yearday += (secs/SECS_PER_DAY);
3729 secs %= SECS_PER_DAY;
3731 ptm->tm_hour = secs/SECS_PER_HOUR;
3732 secs %= SECS_PER_HOUR;
3733 ptm->tm_min = secs/60;
3735 ptm->tm_sec += secs;
3736 /* done with time of day effects */
3738 * The algorithm for yearday has (so far) left it high by 428.
3739 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3740 * bias it by 123 while trying to figure out what year it
3741 * really represents. Even with this tweak, the reverse
3742 * translation fails for years before A.D. 0001.
3743 * It would still fail for Feb 29, but we catch that one below.
3745 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3746 yearday -= YEAR_ADJUST;
3747 year = (yearday / DAYS_PER_QCENT) * 400;
3748 yearday %= DAYS_PER_QCENT;
3749 odd_cent = yearday / DAYS_PER_CENT;
3750 year += odd_cent * 100;
3751 yearday %= DAYS_PER_CENT;
3752 year += (yearday / DAYS_PER_QYEAR) * 4;
3753 yearday %= DAYS_PER_QYEAR;
3754 odd_year = yearday / DAYS_PER_YEAR;
3756 yearday %= DAYS_PER_YEAR;
3757 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3762 yearday += YEAR_ADJUST; /* recover March 1st crock */
3763 month = yearday*DAYS_TO_MONTH;
3764 yearday -= month*MONTH_TO_DAYS;
3765 /* recover other leap-year adjustment */
3774 ptm->tm_year = year - 1900;
3776 ptm->tm_mday = yearday;
3777 ptm->tm_mon = month;
3781 ptm->tm_mon = month - 1;
3783 /* re-build yearday based on Jan 1 to get tm_yday */
3785 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3786 yearday += 14*MONTH_TO_DAYS + 1;
3787 ptm->tm_yday = jday - yearday;
3788 /* fix tm_wday if not overridden by caller */
3789 if ((unsigned)ptm->tm_wday > 6)
3790 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3794 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)
3802 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3805 mytm.tm_hour = hour;
3806 mytm.tm_mday = mday;
3808 mytm.tm_year = year;
3809 mytm.tm_wday = wday;
3810 mytm.tm_yday = yday;
3811 mytm.tm_isdst = isdst;
3813 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3814 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3819 #ifdef HAS_TM_TM_GMTOFF
3820 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3822 #ifdef HAS_TM_TM_ZONE
3823 mytm.tm_zone = mytm2.tm_zone;
3828 Newx(buf, buflen, char);
3829 len = strftime(buf, buflen, fmt, &mytm);
3831 ** The following is needed to handle to the situation where
3832 ** tmpbuf overflows. Basically we want to allocate a buffer
3833 ** and try repeatedly. The reason why it is so complicated
3834 ** is that getting a return value of 0 from strftime can indicate
3835 ** one of the following:
3836 ** 1. buffer overflowed,
3837 ** 2. illegal conversion specifier, or
3838 ** 3. the format string specifies nothing to be returned(not
3839 ** an error). This could be because format is an empty string
3840 ** or it specifies %p that yields an empty string in some locale.
3841 ** If there is a better way to make it portable, go ahead by
3844 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3847 /* Possibly buf overflowed - try again with a bigger buf */
3848 const int fmtlen = strlen(fmt);
3849 int bufsize = fmtlen + buflen;
3851 Newx(buf, bufsize, char);
3853 buflen = strftime(buf, bufsize, fmt, &mytm);
3854 if (buflen > 0 && buflen < bufsize)
3856 /* heuristic to prevent out-of-memory errors */
3857 if (bufsize > 100*fmtlen) {
3863 Renew(buf, bufsize, char);
3868 Perl_croak(aTHX_ "panic: no strftime");
3874 #define SV_CWD_RETURN_UNDEF \
3875 sv_setsv(sv, &PL_sv_undef); \
3878 #define SV_CWD_ISDOT(dp) \
3879 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3880 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3883 =head1 Miscellaneous Functions
3885 =for apidoc getcwd_sv
3887 Fill the sv with current working directory
3892 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3893 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3894 * getcwd(3) if available
3895 * Comments from the orignal:
3896 * This is a faster version of getcwd. It's also more dangerous
3897 * because you might chdir out of a directory that you can't chdir
3901 Perl_getcwd_sv(pTHX_ register SV *sv)
3905 #ifndef INCOMPLETE_TAINTS
3911 char buf[MAXPATHLEN];
3913 /* Some getcwd()s automatically allocate a buffer of the given
3914 * size from the heap if they are given a NULL buffer pointer.
3915 * The problem is that this behaviour is not portable. */
3916 if (getcwd(buf, sizeof(buf) - 1)) {
3921 sv_setsv(sv, &PL_sv_undef);
3929 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3933 SvUPGRADE(sv, SVt_PV);
3935 if (PerlLIO_lstat(".", &statbuf) < 0) {
3936 SV_CWD_RETURN_UNDEF;
3939 orig_cdev = statbuf.st_dev;
3940 orig_cino = statbuf.st_ino;
3949 if (PerlDir_chdir("..") < 0) {
3950 SV_CWD_RETURN_UNDEF;
3952 if (PerlLIO_stat(".", &statbuf) < 0) {
3953 SV_CWD_RETURN_UNDEF;
3956 cdev = statbuf.st_dev;
3957 cino = statbuf.st_ino;
3959 if (odev == cdev && oino == cino) {
3962 if (!(dir = PerlDir_open("."))) {
3963 SV_CWD_RETURN_UNDEF;
3966 while ((dp = PerlDir_read(dir)) != NULL) {
3968 const int namelen = dp->d_namlen;
3970 const int namelen = strlen(dp->d_name);
3973 if (SV_CWD_ISDOT(dp)) {
3977 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3978 SV_CWD_RETURN_UNDEF;
3981 tdev = statbuf.st_dev;
3982 tino = statbuf.st_ino;
3983 if (tino == oino && tdev == odev) {
3989 SV_CWD_RETURN_UNDEF;
3992 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3993 SV_CWD_RETURN_UNDEF;
3996 SvGROW(sv, pathlen + namelen + 1);
4000 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4003 /* prepend current directory to the front */
4005 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4006 pathlen += (namelen + 1);
4008 #ifdef VOID_CLOSEDIR
4011 if (PerlDir_close(dir) < 0) {
4012 SV_CWD_RETURN_UNDEF;
4018 SvCUR_set(sv, pathlen);
4022 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4023 SV_CWD_RETURN_UNDEF;
4026 if (PerlLIO_stat(".", &statbuf) < 0) {
4027 SV_CWD_RETURN_UNDEF;
4030 cdev = statbuf.st_dev;
4031 cino = statbuf.st_ino;
4033 if (cdev != orig_cdev || cino != orig_cino) {
4034 Perl_croak(aTHX_ "Unstable directory path, "
4035 "current directory changed unexpectedly");
4047 =for apidoc scan_version
4049 Returns a pointer to the next character after the parsed
4050 version string, as well as upgrading the passed in SV to
4053 Function must be called with an already existing SV like
4056 s = scan_version(s,SV *sv, bool qv);
4058 Performs some preprocessing to the string to ensure that
4059 it has the correct characteristics of a version. Flags the
4060 object if it contains an underscore (which denotes this
4061 is a alpha version). The boolean qv denotes that the version
4062 should be interpreted as if it had multiple decimals, even if
4069 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4077 AV * const av = newAV();
4078 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4079 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4081 #ifndef NODEFAULT_SHAREKEYS
4082 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4085 while (isSPACE(*s)) /* leading whitespace is OK */
4089 s++; /* get past 'v' */
4090 qv = 1; /* force quoted version processing */
4093 start = last = pos = s;
4095 /* pre-scan the input string to check for decimals/underbars */
4096 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4101 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4105 else if ( *pos == '_' )
4108 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4110 width = pos - last - 1; /* natural width of sub-version */
4115 if ( alpha && !saw_period )
4116 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4118 if ( saw_period > 1 )
4119 qv = 1; /* force quoted version processing */
4124 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4126 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4127 if ( !qv && width < 3 )
4128 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4130 while (isDIGIT(*pos))
4132 if (!isALPHA(*pos)) {
4138 /* this is atoi() that delimits on underscores */
4139 const char *end = pos;
4143 /* the following if() will only be true after the decimal
4144 * point of a version originally created with a bare
4145 * floating point number, i.e. not quoted in any way
4147 if ( !qv && s > start && saw_period == 1 ) {
4151 rev += (*s - '0') * mult;
4153 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4154 Perl_croak(aTHX_ "Integer overflow in version");
4161 while (--end >= s) {
4163 rev += (*end - '0') * mult;
4165 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4166 Perl_croak(aTHX_ "Integer overflow in version");
4171 /* Append revision */
4172 av_push(av, newSViv(rev));
4175 else if ( *pos == '_' && isDIGIT(pos[1]) )
4177 else if ( isDIGIT(*pos) )
4184 while ( isDIGIT(*pos) )
4189 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4197 if ( qv ) { /* quoted versions always get at least three terms*/
4198 I32 len = av_len(av);
4199 /* This for loop appears to trigger a compiler bug on OS X, as it
4200 loops infinitely. Yes, len is negative. No, it makes no sense.
4201 Compiler in question is:
4202 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4203 for ( len = 2 - len; len > 0; len-- )
4204 av_push((AV *)sv, newSViv(0));
4208 av_push(av, newSViv(0));
4211 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4212 av_push(av, newSViv(0));
4214 /* fix RT#19517 - special case 'undef' as string */
4215 if ( *s == 'u' && strEQ(s,"undef") ) {
4219 /* And finally, store the AV in the hash */
4220 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4225 =for apidoc new_version
4227 Returns a new version object based on the passed in SV:
4229 SV *sv = new_version(SV *ver);
4231 Does not alter the passed in ver SV. See "upg_version" if you
4232 want to upgrade the SV.
4238 Perl_new_version(pTHX_ SV *ver)
4241 SV * const rv = newSV(0);
4242 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4245 AV * const av = newAV();
4247 /* This will get reblessed later if a derived class*/
4248 SV * const hv = newSVrv(rv, "version");
4249 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4250 #ifndef NODEFAULT_SHAREKEYS
4251 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4257 /* Begin copying all of the elements */
4258 if ( hv_exists((HV *)ver, "qv", 2) )
4259 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4261 if ( hv_exists((HV *)ver, "alpha", 5) )
4262 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4264 if ( hv_exists((HV*)ver, "width", 5 ) )
4266 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4267 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4270 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4271 /* This will get reblessed later if a derived class*/
4272 for ( key = 0; key <= av_len(sav); key++ )
4274 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4275 av_push(av, newSViv(rev));
4278 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4283 const MAGIC* const mg = SvVSTRING_mg(ver);
4284 if ( mg ) { /* already a v-string */
4285 const STRLEN len = mg->mg_len;
4286 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4287 sv_setpvn(rv,version,len);
4292 sv_setsv(rv,ver); /* make a duplicate */
4297 return upg_version(rv);
4301 =for apidoc upg_version
4303 In-place upgrade of the supplied SV to a version object.
4305 SV *sv = upg_version(SV *sv);
4307 Returns a pointer to the upgraded SV.
4313 Perl_upg_version(pTHX_ SV *ver)
4315 const char *version, *s;
4321 if ( SvNOK(ver) ) /* may get too much accuracy */
4324 #ifdef USE_LOCALE_NUMERIC
4325 char *loc = setlocale(LC_NUMERIC, "C");
4327 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4328 #ifdef USE_LOCALE_NUMERIC
4329 setlocale(LC_NUMERIC, loc);
4331 while (tbuf[len-1] == '0' && len > 0) len--;
4332 version = savepvn(tbuf, len);
4335 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4336 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4340 else /* must be a string or something like a string */
4342 version = savepv(SvPV_nolen(ver));
4345 s = scan_version(version, ver, qv);
4347 if(ckWARN(WARN_MISC))
4348 Perl_warner(aTHX_ packWARN(WARN_MISC),
4349 "Version string '%s' contains invalid data; "
4350 "ignoring: '%s'", version, s);
4358 Validates that the SV contains a valid version object.
4360 bool vverify(SV *vobj);
4362 Note that it only confirms the bare minimum structure (so as not to get
4363 confused by derived classes which may contain additional hash entries):
4367 =item * The SV contains a [reference to a] hash
4369 =item * The hash contains a "version" key
4371 =item * The "version" key has [a reference to] an AV as its value
4379 Perl_vverify(pTHX_ SV *vs)
4385 /* see if the appropriate elements exist */
4386 if ( SvTYPE(vs) == SVt_PVHV
4387 && hv_exists((HV*)vs, "version", 7)
4388 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4389 && SvTYPE(sv) == SVt_PVAV )
4398 Accepts a version object and returns the normalized floating
4399 point representation. Call like:
4403 NOTE: you can pass either the object directly or the SV
4404 contained within the RV.
4410 Perl_vnumify(pTHX_ SV *vs)
4415 SV * const sv = newSV(0);
4421 Perl_croak(aTHX_ "Invalid version object");
4423 /* see if various flags exist */
4424 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4426 if ( hv_exists((HV*)vs, "width", 5 ) )
4427 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4432 /* attempt to retrieve the version array */
4433 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4445 digit = SvIV(*av_fetch(av, 0, 0));
4446 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4447 for ( i = 1 ; i < len ; i++ )
4449 digit = SvIV(*av_fetch(av, i, 0));
4451 const int denom = (width == 2 ? 10 : 100);
4452 const div_t term = div((int)PERL_ABS(digit),denom);
4453 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4456 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4462 digit = SvIV(*av_fetch(av, len, 0));
4463 if ( alpha && width == 3 ) /* alpha version */
4465 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4469 sv_catpvs(sv, "000");
4477 Accepts a version object and returns the normalized string
4478 representation. Call like:
4482 NOTE: you can pass either the object directly or the SV
4483 contained within the RV.
4489 Perl_vnormal(pTHX_ SV *vs)
4493 SV * const sv = newSV(0);
4499 Perl_croak(aTHX_ "Invalid version object");
4501 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4503 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4511 digit = SvIV(*av_fetch(av, 0, 0));
4512 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4513 for ( i = 1 ; i < len ; i++ ) {
4514 digit = SvIV(*av_fetch(av, i, 0));
4515 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4520 /* handle last digit specially */
4521 digit = SvIV(*av_fetch(av, len, 0));
4523 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4525 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4528 if ( len <= 2 ) { /* short version, must be at least three */
4529 for ( len = 2 - len; len != 0; len-- )
4536 =for apidoc vstringify
4538 In order to maintain maximum compatibility with earlier versions
4539 of Perl, this function will return either the floating point
4540 notation or the multiple dotted notation, depending on whether
4541 the original version contained 1 or more dots, respectively
4547 Perl_vstringify(pTHX_ SV *vs)
4553 Perl_croak(aTHX_ "Invalid version object");
4555 if ( hv_exists((HV *)vs, "qv", 2) )
4564 Version object aware cmp. Both operands must already have been
4565 converted into version objects.
4571 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4574 bool lalpha = FALSE;
4575 bool ralpha = FALSE;
4584 if ( !vverify(lhv) )
4585 Perl_croak(aTHX_ "Invalid version object");
4587 if ( !vverify(rhv) )
4588 Perl_croak(aTHX_ "Invalid version object");
4590 /* get the left hand term */
4591 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4592 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4595 /* and the right hand term */
4596 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4597 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4605 while ( i <= m && retval == 0 )
4607 left = SvIV(*av_fetch(lav,i,0));
4608 right = SvIV(*av_fetch(rav,i,0));
4616 /* tiebreaker for alpha with identical terms */
4617 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4619 if ( lalpha && !ralpha )
4623 else if ( ralpha && !lalpha)
4629 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4633 while ( i <= r && retval == 0 )
4635 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4636 retval = -1; /* not a match after all */
4642 while ( i <= l && retval == 0 )
4644 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4645 retval = +1; /* not a match after all */
4653 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4654 # define EMULATE_SOCKETPAIR_UDP
4657 #ifdef EMULATE_SOCKETPAIR_UDP
4659 S_socketpair_udp (int fd[2]) {
4661 /* Fake a datagram socketpair using UDP to localhost. */
4662 int sockets[2] = {-1, -1};
4663 struct sockaddr_in addresses[2];
4665 Sock_size_t size = sizeof(struct sockaddr_in);
4666 unsigned short port;
4669 memset(&addresses, 0, sizeof(addresses));
4672 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4673 if (sockets[i] == -1)
4674 goto tidy_up_and_fail;
4676 addresses[i].sin_family = AF_INET;
4677 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4678 addresses[i].sin_port = 0; /* kernel choses port. */
4679 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4680 sizeof(struct sockaddr_in)) == -1)
4681 goto tidy_up_and_fail;
4684 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4685 for each connect the other socket to it. */
4688 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4690 goto tidy_up_and_fail;
4691 if (size != sizeof(struct sockaddr_in))
4692 goto abort_tidy_up_and_fail;
4693 /* !1 is 0, !0 is 1 */
4694 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4695 sizeof(struct sockaddr_in)) == -1)
4696 goto tidy_up_and_fail;
4699 /* Now we have 2 sockets connected to each other. I don't trust some other
4700 process not to have already sent a packet to us (by random) so send
4701 a packet from each to the other. */
4704 /* I'm going to send my own port number. As a short.
4705 (Who knows if someone somewhere has sin_port as a bitfield and needs
4706 this routine. (I'm assuming crays have socketpair)) */
4707 port = addresses[i].sin_port;
4708 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4709 if (got != sizeof(port)) {
4711 goto tidy_up_and_fail;
4712 goto abort_tidy_up_and_fail;
4716 /* Packets sent. I don't trust them to have arrived though.
4717 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4718 connect to localhost will use a second kernel thread. In 2.6 the
4719 first thread running the connect() returns before the second completes,
4720 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4721 returns 0. Poor programs have tripped up. One poor program's authors'
4722 had a 50-1 reverse stock split. Not sure how connected these were.)
4723 So I don't trust someone not to have an unpredictable UDP stack.
4727 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4728 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4732 FD_SET((unsigned int)sockets[0], &rset);
4733 FD_SET((unsigned int)sockets[1], &rset);
4735 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4736 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4737 || !FD_ISSET(sockets[1], &rset)) {
4738 /* I hope this is portable and appropriate. */
4740 goto tidy_up_and_fail;
4741 goto abort_tidy_up_and_fail;
4745 /* And the paranoia department even now doesn't trust it to have arrive
4746 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4748 struct sockaddr_in readfrom;
4749 unsigned short buffer[2];
4754 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4755 sizeof(buffer), MSG_DONTWAIT,
4756 (struct sockaddr *) &readfrom, &size);
4758 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4760 (struct sockaddr *) &readfrom, &size);
4764 goto tidy_up_and_fail;
4765 if (got != sizeof(port)
4766 || size != sizeof(struct sockaddr_in)
4767 /* Check other socket sent us its port. */
4768 || buffer[0] != (unsigned short) addresses[!i].sin_port
4769 /* Check kernel says we got the datagram from that socket */
4770 || readfrom.sin_family != addresses[!i].sin_family
4771 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4772 || readfrom.sin_port != addresses[!i].sin_port)
4773 goto abort_tidy_up_and_fail;
4776 /* My caller (my_socketpair) has validated that this is non-NULL */
4779 /* I hereby declare this connection open. May God bless all who cross
4783 abort_tidy_up_and_fail:
4784 errno = ECONNABORTED;
4787 const int save_errno = errno;
4788 if (sockets[0] != -1)
4789 PerlLIO_close(sockets[0]);
4790 if (sockets[1] != -1)
4791 PerlLIO_close(sockets[1]);
4796 #endif /* EMULATE_SOCKETPAIR_UDP */
4798 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4800 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4801 /* Stevens says that family must be AF_LOCAL, protocol 0.
4802 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4807 struct sockaddr_in listen_addr;
4808 struct sockaddr_in connect_addr;
4813 || family != AF_UNIX
4816 errno = EAFNOSUPPORT;
4824 #ifdef EMULATE_SOCKETPAIR_UDP
4825 if (type == SOCK_DGRAM)
4826 return S_socketpair_udp(fd);
4829 listener = PerlSock_socket(AF_INET, type, 0);
4832 memset(&listen_addr, 0, sizeof(listen_addr));
4833 listen_addr.sin_family = AF_INET;
4834 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4835 listen_addr.sin_port = 0; /* kernel choses port. */
4836 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4837 sizeof(listen_addr)) == -1)
4838 goto tidy_up_and_fail;
4839 if (PerlSock_listen(listener, 1) == -1)
4840 goto tidy_up_and_fail;
4842 connector = PerlSock_socket(AF_INET, type, 0);
4843 if (connector == -1)
4844 goto tidy_up_and_fail;
4845 /* We want to find out the port number to connect to. */
4846 size = sizeof(connect_addr);
4847 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4849 goto tidy_up_and_fail;
4850 if (size != sizeof(connect_addr))
4851 goto abort_tidy_up_and_fail;
4852 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4853 sizeof(connect_addr)) == -1)
4854 goto tidy_up_and_fail;
4856 size = sizeof(listen_addr);
4857 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4860 goto tidy_up_and_fail;
4861 if (size != sizeof(listen_addr))
4862 goto abort_tidy_up_and_fail;
4863 PerlLIO_close(listener);
4864 /* Now check we are talking to ourself by matching port and host on the
4866 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4868 goto tidy_up_and_fail;
4869 if (size != sizeof(connect_addr)
4870 || listen_addr.sin_family != connect_addr.sin_family
4871 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4872 || listen_addr.sin_port != connect_addr.sin_port) {
4873 goto abort_tidy_up_and_fail;
4879 abort_tidy_up_and_fail:
4881 errno = ECONNABORTED; /* This would be the standard thing to do. */
4883 # ifdef ECONNREFUSED
4884 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4886 errno = ETIMEDOUT; /* Desperation time. */
4891 const int save_errno = errno;
4893 PerlLIO_close(listener);
4894 if (connector != -1)
4895 PerlLIO_close(connector);
4897 PerlLIO_close(acceptor);
4903 /* In any case have a stub so that there's code corresponding
4904 * to the my_socketpair in global.sym. */
4906 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4907 #ifdef HAS_SOCKETPAIR
4908 return socketpair(family, type, protocol, fd);
4917 =for apidoc sv_nosharing
4919 Dummy routine which "shares" an SV when there is no sharing module present.
4920 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4921 Exists to avoid test for a NULL function pointer and because it could
4922 potentially warn under some level of strict-ness.
4928 Perl_sv_nosharing(pTHX_ SV *sv)
4930 PERL_UNUSED_CONTEXT;
4931 PERL_UNUSED_ARG(sv);
4935 Perl_parse_unicode_opts(pTHX_ const char **popt)
4937 const char *p = *popt;
4942 opt = (U32) atoi(p);
4945 if (*p && *p != '\n' && *p != '\r')
4946 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4951 case PERL_UNICODE_STDIN:
4952 opt |= PERL_UNICODE_STDIN_FLAG; break;
4953 case PERL_UNICODE_STDOUT:
4954 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4955 case PERL_UNICODE_STDERR:
4956 opt |= PERL_UNICODE_STDERR_FLAG; break;
4957 case PERL_UNICODE_STD:
4958 opt |= PERL_UNICODE_STD_FLAG; break;
4959 case PERL_UNICODE_IN:
4960 opt |= PERL_UNICODE_IN_FLAG; break;
4961 case PERL_UNICODE_OUT:
4962 opt |= PERL_UNICODE_OUT_FLAG; break;
4963 case PERL_UNICODE_INOUT:
4964 opt |= PERL_UNICODE_INOUT_FLAG; break;
4965 case PERL_UNICODE_LOCALE:
4966 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4967 case PERL_UNICODE_ARGV:
4968 opt |= PERL_UNICODE_ARGV_FLAG; break;
4969 case PERL_UNICODE_UTF8CACHEASSERT:
4970 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4972 if (*p != '\n' && *p != '\r')
4974 "Unknown Unicode option letter '%c'", *p);
4980 opt = PERL_UNICODE_DEFAULT_FLAGS;
4982 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4983 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4984 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4996 * This is really just a quick hack which grabs various garbage
4997 * values. It really should be a real hash algorithm which
4998 * spreads the effect of every input bit onto every output bit,
4999 * if someone who knows about such things would bother to write it.
5000 * Might be a good idea to add that function to CORE as well.
5001 * No numbers below come from careful analysis or anything here,
5002 * except they are primes and SEED_C1 > 1E6 to get a full-width
5003 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5004 * probably be bigger too.
5007 # define SEED_C1 1000003
5008 #define SEED_C4 73819
5010 # define SEED_C1 25747
5011 #define SEED_C4 20639
5015 #define SEED_C5 26107
5017 #ifndef PERL_NO_DEV_RANDOM
5022 # include <starlet.h>
5023 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5024 * in 100-ns units, typically incremented ever 10 ms. */
5025 unsigned int when[2];
5027 # ifdef HAS_GETTIMEOFDAY
5028 struct timeval when;
5034 /* This test is an escape hatch, this symbol isn't set by Configure. */
5035 #ifndef PERL_NO_DEV_RANDOM
5036 #ifndef PERL_RANDOM_DEVICE
5037 /* /dev/random isn't used by default because reads from it will block
5038 * if there isn't enough entropy available. You can compile with
5039 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5040 * is enough real entropy to fill the seed. */
5041 # define PERL_RANDOM_DEVICE "/dev/urandom"
5043 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5045 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5054 _ckvmssts(sys$gettim(when));
5055 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5057 # ifdef HAS_GETTIMEOFDAY
5058 PerlProc_gettimeofday(&when,NULL);
5059 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5062 u = (U32)SEED_C1 * when;
5065 u += SEED_C3 * (U32)PerlProc_getpid();
5066 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5067 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5068 u += SEED_C5 * (U32)PTR2UV(&when);
5074 Perl_get_hash_seed(pTHX)
5077 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5083 if (s && isDIGIT(*s))
5084 myseed = (UV)Atoul(s);
5086 #ifdef USE_HASH_SEED_EXPLICIT
5090 /* Compute a random seed */
5091 (void)seedDrand01((Rand_seed_t)seed());
5092 myseed = (UV)(Drand01() * (NV)UV_MAX);
5093 #if RANDBITS < (UVSIZE * 8)
5094 /* Since there are not enough randbits to to reach all
5095 * the bits of a UV, the low bits might need extra
5096 * help. Sum in another random number that will
5097 * fill in the low bits. */
5099 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5100 #endif /* RANDBITS < (UVSIZE * 8) */
5101 if (myseed == 0) { /* Superparanoia. */
5102 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5104 Perl_croak(aTHX_ "Your random numbers are not that random");
5107 PL_rehash_seed_set = TRUE;
5114 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5116 const char * const stashpv = CopSTASHPV(c);
5117 const char * const name = HvNAME_get(hv);
5118 PERL_UNUSED_CONTEXT;
5120 if (stashpv == name)
5122 if (stashpv && name)
5123 if (strEQ(stashpv, name))
5130 #ifdef PERL_GLOBAL_STRUCT
5133 Perl_init_global_struct(pTHX)
5135 struct perl_vars *plvarsp = NULL;
5136 #ifdef PERL_GLOBAL_STRUCT
5137 # define PERL_GLOBAL_STRUCT_INIT
5138 # include "opcode.h" /* the ppaddr and check */
5139 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5140 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5141 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5142 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5143 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5147 plvarsp = PL_VarsPtr;
5148 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5154 # define PERLVAR(var,type) /**/
5155 # define PERLVARA(var,n,type) /**/
5156 # define PERLVARI(var,type,init) plvarsp->var = init;
5157 # define PERLVARIC(var,type,init) plvarsp->var = init;
5158 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5159 # include "perlvars.h"
5165 # ifdef PERL_GLOBAL_STRUCT
5166 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5167 if (!plvarsp->Gppaddr)
5169 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5170 if (!plvarsp->Gcheck)
5172 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5173 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5175 # ifdef PERL_SET_VARS
5176 PERL_SET_VARS(plvarsp);
5178 # undef PERL_GLOBAL_STRUCT_INIT
5183 #endif /* PERL_GLOBAL_STRUCT */
5185 #ifdef PERL_GLOBAL_STRUCT
5188 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5190 #ifdef PERL_GLOBAL_STRUCT
5191 # ifdef PERL_UNSET_VARS
5192 PERL_UNSET_VARS(plvarsp);
5194 free(plvarsp->Gppaddr);
5195 free(plvarsp->Gcheck);
5196 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5202 #endif /* PERL_GLOBAL_STRUCT */
5207 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5209 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5210 * variable PERL_MEM_LOG will be consulted, and if the integer value
5211 * of that is true, the logging will happen. (The default is to
5212 * always log if the PERL_MEM_LOG define was in effect.)
5216 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5217 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5219 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5222 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5223 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5224 * in which case the environment variable PERL_MEM_LOG_FD will be
5225 * consulted for the file descriptor number to use.
5227 #ifndef PERL_MEM_LOG_FD
5228 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5232 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)
5234 #ifdef PERL_MEM_LOG_STDERR
5235 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5238 # ifdef PERL_MEM_LOG_ENV
5239 s = getenv("PERL_MEM_LOG");
5240 if (s ? atoi(s) : 0)
5243 /* We can't use SVs or PerlIO for obvious reasons,
5244 * so we'll use stdio and low-level IO instead. */
5245 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5246 # ifdef PERL_MEM_LOG_TIMESTAMP
5248 # ifdef HAS_GETTIMEOFDAY
5249 gettimeofday(&tv, 0);
5251 /* If there are other OS specific ways of hires time than
5252 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5253 * probably that they would be used to fill in the struct
5260 # ifdef PERL_MEM_LOG_TIMESTAMP
5263 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5264 " %s = %"IVdf": %"UVxf"\n",
5265 # ifdef PERL_MEM_LOG_TIMESTAMP
5266 (int)tv.tv_sec, (int)tv.tv_usec,
5268 filename, linenumber, funcname, n, typesize,
5269 typename, n * typesize, PTR2UV(newalloc));
5270 # ifdef PERL_MEM_LOG_ENV_FD
5271 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5272 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5274 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5283 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)
5285 #ifdef PERL_MEM_LOG_STDERR
5286 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5289 # ifdef PERL_MEM_LOG_ENV
5290 s = PerlEnv_getenv("PERL_MEM_LOG");
5291 if (s ? atoi(s) : 0)
5294 /* We can't use SVs or PerlIO for obvious reasons,
5295 * so we'll use stdio and low-level IO instead. */
5296 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5297 # ifdef PERL_MEM_LOG_TIMESTAMP
5299 gettimeofday(&tv, 0);
5305 # ifdef PERL_MEM_LOG_TIMESTAMP
5308 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5309 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5310 # ifdef PERL_MEM_LOG_TIMESTAMP
5311 (int)tv.tv_sec, (int)tv.tv_usec,
5313 filename, linenumber, funcname, n, typesize,
5314 typename, n * typesize, PTR2UV(oldalloc),
5316 # ifdef PERL_MEM_LOG_ENV_FD
5317 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5318 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5320 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5329 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5331 #ifdef PERL_MEM_LOG_STDERR
5332 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5335 # ifdef PERL_MEM_LOG_ENV
5336 s = PerlEnv_getenv("PERL_MEM_LOG");
5337 if (s ? atoi(s) : 0)
5340 /* We can't use SVs or PerlIO for obvious reasons,
5341 * so we'll use stdio and low-level IO instead. */
5342 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5343 # ifdef PERL_MEM_LOG_TIMESTAMP
5345 gettimeofday(&tv, 0);
5351 # ifdef PERL_MEM_LOG_TIMESTAMP
5354 "free: %s:%d:%s: %"UVxf"\n",
5355 # ifdef PERL_MEM_LOG_TIMESTAMP
5356 (int)tv.tv_sec, (int)tv.tv_usec,
5358 filename, linenumber, funcname,
5360 # ifdef PERL_MEM_LOG_ENV_FD
5361 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5362 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5364 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5372 #endif /* PERL_MEM_LOG */
5375 =for apidoc my_sprintf
5377 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5378 the length of the string written to the buffer. Only rare pre-ANSI systems
5379 need the wrapper function - usually this is a direct call to C<sprintf>.
5383 #ifndef SPRINTF_RETURNS_STRLEN
5385 Perl_my_sprintf(char *buffer, const char* pat, ...)
5388 va_start(args, pat);
5389 vsprintf(buffer, pat, args);
5391 return strlen(buffer);
5396 =for apidoc my_snprintf
5398 The C library C<snprintf> functionality, if available and
5399 standards-compliant (uses C<vsnprintf>, actually). However, if the
5400 C<vsnprintf> is not available, will unfortunately use the unsafe
5401 C<vsprintf> which can overrun the buffer (there is an overrun check,
5402 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5403 getting C<vsnprintf>.
5408 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5413 va_start(ap, format);
5414 #ifdef HAS_VSNPRINTF
5415 retval = vsnprintf(buffer, len, format, ap);
5417 retval = vsprintf(buffer, format, ap);
5420 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5421 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5422 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5427 =for apidoc my_vsnprintf
5429 The C library C<vsnprintf> if available and standards-compliant.
5430 However, if if the C<vsnprintf> is not available, will unfortunately
5431 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5432 overrun check, but that may be too late). Consider using
5433 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5438 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5444 Perl_va_copy(ap, apc);
5445 # ifdef HAS_VSNPRINTF
5446 retval = vsnprintf(buffer, len, format, apc);
5448 retval = vsprintf(buffer, format, apc);
5451 # ifdef HAS_VSNPRINTF
5452 retval = vsnprintf(buffer, len, format, ap);
5454 retval = vsprintf(buffer, format, ap);
5456 #endif /* #ifdef NEED_VA_COPY */
5457 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5458 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5459 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5464 Perl_my_clearenv(pTHX)
5467 #if ! defined(PERL_MICRO)
5468 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5470 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5471 # if defined(USE_ENVIRON_ARRAY)
5472 # if defined(USE_ITHREADS)
5473 /* only the parent thread can clobber the process environment */
5474 if (PL_curinterp == aTHX)
5475 # endif /* USE_ITHREADS */
5477 # if ! defined(PERL_USE_SAFE_PUTENV)
5478 if ( !PL_use_safe_putenv) {
5480 if (environ == PL_origenviron)
5481 environ = (char**)safesysmalloc(sizeof(char*));
5483 for (i = 0; environ[i]; i++)
5484 (void)safesysfree(environ[i]);
5487 # else /* PERL_USE_SAFE_PUTENV */
5488 # if defined(HAS_CLEARENV)
5490 # elif defined(HAS_UNSETENV)
5491 int bsiz = 80; /* Most envvar names will be shorter than this. */
5492 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5493 char *buf = (char*)safesysmalloc(bufsiz);
5494 while (*environ != NULL) {
5495 char *e = strchr(*environ, '=');
5496 int l = e ? e - *environ : (int)strlen(*environ);
5498 (void)safesysfree(buf);
5499 bsiz = l + 1; /* + 1 for the \0. */
5500 buf = (char*)safesysmalloc(bufsiz);
5502 my_strlcpy(buf, *environ, l + 1);
5503 (void)unsetenv(buf);
5505 (void)safesysfree(buf);
5506 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5507 /* Just null environ and accept the leakage. */
5509 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5510 # endif /* ! PERL_USE_SAFE_PUTENV */
5512 # endif /* USE_ENVIRON_ARRAY */
5513 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5514 #endif /* PERL_MICRO */
5517 #ifdef PERL_IMPLICIT_CONTEXT
5519 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5520 the global PL_my_cxt_index is incremented, and that value is assigned to
5521 that module's static my_cxt_index (who's address is passed as an arg).
5522 Then, for each interpreter this function is called for, it makes sure a
5523 void* slot is available to hang the static data off, by allocating or
5524 extending the interpreter's PL_my_cxt_list array */
5527 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5532 /* this module hasn't been allocated an index yet */
5533 MUTEX_LOCK(&PL_my_ctx_mutex);
5534 *index = PL_my_cxt_index++;
5535 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5538 /* make sure the array is big enough */
5539 if (PL_my_cxt_size <= *index) {
5540 if (PL_my_cxt_size) {
5541 while (PL_my_cxt_size <= *index)
5542 PL_my_cxt_size *= 2;
5543 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5546 PL_my_cxt_size = 16;
5547 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5550 /* newSV() allocates one more than needed */
5551 p = (void*)SvPVX(newSV(size-1));
5552 PL_my_cxt_list[*index] = p;
5553 Zero(p, size, char);
5560 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5562 Size_t used, length, copy;
5565 length = strlen(src);
5566 if (size > 0 && used < size - 1) {
5567 copy = (length >= size - used) ? size - used - 1 : length;
5568 memcpy(dst + used, src, copy);
5569 dst[used + copy] = '\0';
5571 return used + length;
5577 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5579 Size_t length, copy;
5581 length = strlen(src);
5583 copy = (length >= size) ? size - 1 : length;
5584 memcpy(dst, src, copy);
5592 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5595 SV * const dbsv = GvSVn(PL_DBsub);
5596 /* We do not care about using sv to call CV;
5597 * it's for informational purposes only.
5601 if (!PERLDB_SUB_NN) {
5602 GV * const gv = CvGV(cv);
5604 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5605 || strEQ(GvNAME(gv), "END")
5606 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5607 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5608 /* Use GV from the stack as a fallback. */
5609 /* GV is potentially non-unique, or contain different CV. */
5610 SV * const tmp = newRV((SV*)cv);
5611 sv_setsv(dbsv, tmp);
5615 gv_efullname3(dbsv, gv, NULL);
5619 const int type = SvTYPE(dbsv);
5620 if (type < SVt_PVIV && type != SVt_IV)
5621 sv_upgrade(dbsv, SVt_PVIV);
5622 (void)SvIOK_on(dbsv);
5623 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5629 * c-indentation-style: bsd
5631 * indent-tabs-mode: t
5634 * ex: set ts=8 sts=4 sw=4 noet: