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 */
2359 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2360 SvREADONLY_off(GvSV(tmpgv));
2361 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2362 SvREADONLY_on(GvSV(tmpgv));
2364 #ifdef THREADS_HAVE_PIDS
2365 PL_ppid = (IV)getppid();
2368 #ifdef PERL_USES_PL_PIDSTATUS
2369 hv_clear(PL_pidstatus); /* we have no children */
2375 do_execfree(); /* free any memory malloced by child on vfork */
2377 PerlLIO_close(pp[1]);
2378 if (p[that] < p[This]) {
2379 PerlLIO_dup2(p[This], p[that]);
2380 PerlLIO_close(p[This]);
2384 PerlLIO_close(p[that]);
2387 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2389 SvUPGRADE(sv,SVt_IV);
2391 PL_forkprocess = pid;
2392 if (did_pipes && pid > 0) {
2397 while (n < sizeof(int)) {
2398 n1 = PerlLIO_read(pp[0],
2399 (void*)(((char*)&errkid)+n),
2405 PerlLIO_close(pp[0]);
2407 if (n) { /* Error */
2409 PerlLIO_close(p[This]);
2410 if (n != sizeof(int))
2411 Perl_croak(aTHX_ "panic: kid popen errno read");
2413 pid2 = wait4pid(pid, &status, 0);
2414 } while (pid2 == -1 && errno == EINTR);
2415 errno = errkid; /* Propagate errno from kid */
2420 PerlLIO_close(pp[0]);
2421 return PerlIO_fdopen(p[This], mode);
2424 #if defined(atarist) || defined(EPOC)
2427 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2429 PERL_FLUSHALL_FOR_CHILD;
2430 /* Call system's popen() to get a FILE *, then import it.
2431 used 0 for 2nd parameter to PerlIO_importFILE;
2434 return PerlIO_importFILE(popen(cmd, mode), 0);
2438 FILE *djgpp_popen();
2440 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2442 PERL_FLUSHALL_FOR_CHILD;
2443 /* Call system's popen() to get a FILE *, then import it.
2444 used 0 for 2nd parameter to PerlIO_importFILE;
2447 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2452 #endif /* !DOSISH */
2454 /* this is called in parent before the fork() */
2456 Perl_atfork_lock(void)
2459 #if defined(USE_ITHREADS)
2460 /* locks must be held in locking order (if any) */
2462 MUTEX_LOCK(&PL_malloc_mutex);
2468 /* this is called in both parent and child after the fork() */
2470 Perl_atfork_unlock(void)
2473 #if defined(USE_ITHREADS)
2474 /* locks must be released in same order as in atfork_lock() */
2476 MUTEX_UNLOCK(&PL_malloc_mutex);
2485 #if defined(HAS_FORK)
2487 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2492 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2493 * handlers elsewhere in the code */
2498 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2499 Perl_croak_nocontext("fork() not available");
2501 #endif /* HAS_FORK */
2506 Perl_dump_fds(pTHX_ char *s)
2511 PerlIO_printf(Perl_debug_log,"%s", s);
2512 for (fd = 0; fd < 32; fd++) {
2513 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2514 PerlIO_printf(Perl_debug_log," %d",fd);
2516 PerlIO_printf(Perl_debug_log,"\n");
2519 #endif /* DUMP_FDS */
2523 dup2(int oldfd, int newfd)
2525 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2528 PerlLIO_close(newfd);
2529 return fcntl(oldfd, F_DUPFD, newfd);
2531 #define DUP2_MAX_FDS 256
2532 int fdtmp[DUP2_MAX_FDS];
2538 PerlLIO_close(newfd);
2539 /* good enough for low fd's... */
2540 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2541 if (fdx >= DUP2_MAX_FDS) {
2549 PerlLIO_close(fdtmp[--fdx]);
2556 #ifdef HAS_SIGACTION
2558 #ifdef MACOS_TRADITIONAL
2559 /* We don't want restart behavior on MacOS */
2564 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2567 struct sigaction act, oact;
2570 /* only "parent" interpreter can diddle signals */
2571 if (PL_curinterp != aTHX)
2572 return (Sighandler_t) SIG_ERR;
2575 act.sa_handler = (void(*)(int))handler;
2576 sigemptyset(&act.sa_mask);
2579 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2580 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2582 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2583 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2584 act.sa_flags |= SA_NOCLDWAIT;
2586 if (sigaction(signo, &act, &oact) == -1)
2587 return (Sighandler_t) SIG_ERR;
2589 return (Sighandler_t) oact.sa_handler;
2593 Perl_rsignal_state(pTHX_ int signo)
2595 struct sigaction oact;
2596 PERL_UNUSED_CONTEXT;
2598 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2599 return (Sighandler_t) SIG_ERR;
2601 return (Sighandler_t) oact.sa_handler;
2605 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2608 struct sigaction act;
2611 /* only "parent" interpreter can diddle signals */
2612 if (PL_curinterp != aTHX)
2616 act.sa_handler = (void(*)(int))handler;
2617 sigemptyset(&act.sa_mask);
2620 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2621 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2623 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2624 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2625 act.sa_flags |= SA_NOCLDWAIT;
2627 return sigaction(signo, &act, save);
2631 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2635 /* only "parent" interpreter can diddle signals */
2636 if (PL_curinterp != aTHX)
2640 return sigaction(signo, save, (struct sigaction *)NULL);
2643 #else /* !HAS_SIGACTION */
2646 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2648 #if defined(USE_ITHREADS) && !defined(WIN32)
2649 /* only "parent" interpreter can diddle signals */
2650 if (PL_curinterp != aTHX)
2651 return (Sighandler_t) SIG_ERR;
2654 return PerlProc_signal(signo, handler);
2665 Perl_rsignal_state(pTHX_ int signo)
2668 Sighandler_t oldsig;
2670 #if defined(USE_ITHREADS) && !defined(WIN32)
2671 /* only "parent" interpreter can diddle signals */
2672 if (PL_curinterp != aTHX)
2673 return (Sighandler_t) SIG_ERR;
2677 oldsig = PerlProc_signal(signo, sig_trap);
2678 PerlProc_signal(signo, oldsig);
2680 PerlProc_kill(PerlProc_getpid(), signo);
2685 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2687 #if defined(USE_ITHREADS) && !defined(WIN32)
2688 /* only "parent" interpreter can diddle signals */
2689 if (PL_curinterp != aTHX)
2692 *save = PerlProc_signal(signo, handler);
2693 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2697 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2699 #if defined(USE_ITHREADS) && !defined(WIN32)
2700 /* only "parent" interpreter can diddle signals */
2701 if (PL_curinterp != aTHX)
2704 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2707 #endif /* !HAS_SIGACTION */
2708 #endif /* !PERL_MICRO */
2710 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2711 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2713 Perl_my_pclose(pTHX_ PerlIO *ptr)
2716 Sigsave_t hstat, istat, qstat;
2722 int saved_errno = 0;
2724 int saved_win32_errno;
2728 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2730 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2732 *svp = &PL_sv_undef;
2734 if (pid == -1) { /* Opened by popen. */
2735 return my_syspclose(ptr);
2738 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2739 saved_errno = errno;
2741 saved_win32_errno = GetLastError();
2745 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2748 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2749 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2750 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2753 pid2 = wait4pid(pid, &status, 0);
2754 } while (pid2 == -1 && errno == EINTR);
2756 rsignal_restore(SIGHUP, &hstat);
2757 rsignal_restore(SIGINT, &istat);
2758 rsignal_restore(SIGQUIT, &qstat);
2761 SETERRNO(saved_errno, 0);
2764 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2766 #endif /* !DOSISH */
2768 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2770 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2776 #ifdef PERL_USES_PL_PIDSTATUS
2779 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2780 pid, rather than a string form. */
2781 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2782 if (svp && *svp != &PL_sv_undef) {
2783 *statusp = SvIVX(*svp);
2784 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2792 hv_iterinit(PL_pidstatus);
2793 if ((entry = hv_iternext(PL_pidstatus))) {
2794 SV * const sv = hv_iterval(PL_pidstatus,entry);
2796 const char * const spid = hv_iterkey(entry,&len);
2798 assert (len == sizeof(Pid_t));
2799 memcpy((char *)&pid, spid, len);
2800 *statusp = SvIVX(sv);
2801 /* The hash iterator is currently on this entry, so simply
2802 calling hv_delete would trigger the lazy delete, which on
2803 aggregate does more work, beacuse next call to hv_iterinit()
2804 would spot the flag, and have to call the delete routine,
2805 while in the meantime any new entries can't re-use that
2807 hv_iterinit(PL_pidstatus);
2808 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2815 # ifdef HAS_WAITPID_RUNTIME
2816 if (!HAS_WAITPID_RUNTIME)
2819 result = PerlProc_waitpid(pid,statusp,flags);
2822 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2823 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2826 #ifdef PERL_USES_PL_PIDSTATUS
2827 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2832 Perl_croak(aTHX_ "Can't do waitpid with flags");
2834 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2835 pidgone(result,*statusp);
2841 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2844 if (result < 0 && errno == EINTR) {
2849 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2851 #ifdef PERL_USES_PL_PIDSTATUS
2853 Perl_pidgone(pTHX_ Pid_t pid, int status)
2857 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2858 SvUPGRADE(sv,SVt_IV);
2859 SvIV_set(sv, status);
2864 #if defined(atarist) || defined(OS2) || defined(EPOC)
2867 int /* Cannot prototype with I32
2869 my_syspclose(PerlIO *ptr)
2872 Perl_my_pclose(pTHX_ PerlIO *ptr)
2875 /* Needs work for PerlIO ! */
2876 FILE * const f = PerlIO_findFILE(ptr);
2877 const I32 result = pclose(f);
2878 PerlIO_releaseFILE(ptr,f);
2886 Perl_my_pclose(pTHX_ PerlIO *ptr)
2888 /* Needs work for PerlIO ! */
2889 FILE * const f = PerlIO_findFILE(ptr);
2890 I32 result = djgpp_pclose(f);
2891 result = (result << 8) & 0xff00;
2892 PerlIO_releaseFILE(ptr,f);
2898 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2901 register const char * const frombase = from;
2902 PERL_UNUSED_CONTEXT;
2905 register const char c = *from;
2910 while (count-- > 0) {
2911 for (todo = len; todo > 0; todo--) {
2920 Perl_same_dirent(pTHX_ const char *a, const char *b)
2922 char *fa = strrchr(a,'/');
2923 char *fb = strrchr(b,'/');
2926 SV * const tmpsv = sv_newmortal();
2939 sv_setpvn(tmpsv, ".", 1);
2941 sv_setpvn(tmpsv, a, fa - a);
2942 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2945 sv_setpvn(tmpsv, ".", 1);
2947 sv_setpvn(tmpsv, b, fb - b);
2948 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2950 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2951 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2953 #endif /* !HAS_RENAME */
2956 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2957 const char *const *const search_ext, I32 flags)
2960 const char *xfound = NULL;
2961 char *xfailed = NULL;
2962 char tmpbuf[MAXPATHLEN];
2966 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2967 # define SEARCH_EXTS ".bat", ".cmd", NULL
2968 # define MAX_EXT_LEN 4
2971 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2972 # define MAX_EXT_LEN 4
2975 # define SEARCH_EXTS ".pl", ".com", NULL
2976 # define MAX_EXT_LEN 4
2978 /* additional extensions to try in each dir if scriptname not found */
2980 static const char *const exts[] = { SEARCH_EXTS };
2981 const char *const *const ext = search_ext ? search_ext : exts;
2982 int extidx = 0, i = 0;
2983 const char *curext = NULL;
2985 PERL_UNUSED_ARG(search_ext);
2986 # define MAX_EXT_LEN 0
2990 * If dosearch is true and if scriptname does not contain path
2991 * delimiters, search the PATH for scriptname.
2993 * If SEARCH_EXTS is also defined, will look for each
2994 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2995 * while searching the PATH.
2997 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2998 * proceeds as follows:
2999 * If DOSISH or VMSISH:
3000 * + look for ./scriptname{,.foo,.bar}
3001 * + search the PATH for scriptname{,.foo,.bar}
3004 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3005 * this will not look in '.' if it's not in the PATH)
3010 # ifdef ALWAYS_DEFTYPES
3011 len = strlen(scriptname);
3012 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3013 int idx = 0, deftypes = 1;
3016 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3019 int idx = 0, deftypes = 1;
3022 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3024 /* The first time through, just add SEARCH_EXTS to whatever we
3025 * already have, so we can check for default file types. */
3027 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3033 if ((strlen(tmpbuf) + strlen(scriptname)
3034 + MAX_EXT_LEN) >= sizeof tmpbuf)
3035 continue; /* don't search dir with too-long name */
3036 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3040 if (strEQ(scriptname, "-"))
3042 if (dosearch) { /* Look in '.' first. */
3043 const char *cur = scriptname;
3045 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3047 if (strEQ(ext[i++],curext)) {
3048 extidx = -1; /* already has an ext */
3053 DEBUG_p(PerlIO_printf(Perl_debug_log,
3054 "Looking for %s\n",cur));
3055 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3056 && !S_ISDIR(PL_statbuf.st_mode)) {
3064 if (cur == scriptname) {
3065 len = strlen(scriptname);
3066 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3068 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3071 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3072 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3077 #ifdef MACOS_TRADITIONAL
3078 if (dosearch && !strchr(scriptname, ':') &&
3079 (s = PerlEnv_getenv("Commands")))
3081 if (dosearch && !strchr(scriptname, '/')
3083 && !strchr(scriptname, '\\')
3085 && (s = PerlEnv_getenv("PATH")))
3090 PL_bufend = s + strlen(s);
3091 while (s < PL_bufend) {
3092 #ifdef MACOS_TRADITIONAL
3093 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3097 #if defined(atarist) || defined(DOSISH)
3102 && *s != ';'; len++, s++) {
3103 if (len < sizeof tmpbuf)
3106 if (len < sizeof tmpbuf)
3108 #else /* ! (atarist || DOSISH) */
3109 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3112 #endif /* ! (atarist || DOSISH) */
3113 #endif /* MACOS_TRADITIONAL */
3116 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3117 continue; /* don't search dir with too-long name */
3118 #ifdef MACOS_TRADITIONAL
3119 if (len && tmpbuf[len - 1] != ':')
3120 tmpbuf[len++] = ':';
3123 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3124 && tmpbuf[len - 1] != '/'
3125 && tmpbuf[len - 1] != '\\'
3128 tmpbuf[len++] = '/';
3129 if (len == 2 && tmpbuf[0] == '.')
3132 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3136 len = strlen(tmpbuf);
3137 if (extidx > 0) /* reset after previous loop */
3141 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3142 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3143 if (S_ISDIR(PL_statbuf.st_mode)) {
3147 } while ( retval < 0 /* not there */
3148 && extidx>=0 && ext[extidx] /* try an extension? */
3149 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3154 if (S_ISREG(PL_statbuf.st_mode)
3155 && cando(S_IRUSR,TRUE,&PL_statbuf)
3156 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3157 && cando(S_IXUSR,TRUE,&PL_statbuf)
3161 xfound = tmpbuf; /* bingo! */
3165 xfailed = savepv(tmpbuf);
3168 if (!xfound && !seen_dot && !xfailed &&
3169 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3170 || S_ISDIR(PL_statbuf.st_mode)))
3172 seen_dot = 1; /* Disable message. */
3174 if (flags & 1) { /* do or die? */
3175 Perl_croak(aTHX_ "Can't %s %s%s%s",
3176 (xfailed ? "execute" : "find"),
3177 (xfailed ? xfailed : scriptname),
3178 (xfailed ? "" : " on PATH"),
3179 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3184 scriptname = xfound;
3186 return (scriptname ? savepv(scriptname) : NULL);
3189 #ifndef PERL_GET_CONTEXT_DEFINED
3192 Perl_get_context(void)
3195 #if defined(USE_ITHREADS)
3196 # ifdef OLD_PTHREADS_API
3198 if (pthread_getspecific(PL_thr_key, &t))
3199 Perl_croak_nocontext("panic: pthread_getspecific");
3202 # ifdef I_MACH_CTHREADS
3203 return (void*)cthread_data(cthread_self());
3205 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3214 Perl_set_context(void *t)
3217 #if defined(USE_ITHREADS)
3218 # ifdef I_MACH_CTHREADS
3219 cthread_set_data(cthread_self(), t);
3221 if (pthread_setspecific(PL_thr_key, t))
3222 Perl_croak_nocontext("panic: pthread_setspecific");
3229 #endif /* !PERL_GET_CONTEXT_DEFINED */
3231 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3240 Perl_get_op_names(pTHX)
3242 PERL_UNUSED_CONTEXT;
3243 return (char **)PL_op_name;
3247 Perl_get_op_descs(pTHX)
3249 PERL_UNUSED_CONTEXT;
3250 return (char **)PL_op_desc;
3254 Perl_get_no_modify(pTHX)
3256 PERL_UNUSED_CONTEXT;
3257 return PL_no_modify;
3261 Perl_get_opargs(pTHX)
3263 PERL_UNUSED_CONTEXT;
3264 return (U32 *)PL_opargs;
3268 Perl_get_ppaddr(pTHX)
3271 PERL_UNUSED_CONTEXT;
3272 return (PPADDR_t*)PL_ppaddr;
3275 #ifndef HAS_GETENV_LEN
3277 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3279 char * const env_trans = PerlEnv_getenv(env_elem);
3280 PERL_UNUSED_CONTEXT;
3282 *len = strlen(env_trans);
3289 Perl_get_vtbl(pTHX_ int vtbl_id)
3291 const MGVTBL* result;
3292 PERL_UNUSED_CONTEXT;
3296 result = &PL_vtbl_sv;
3299 result = &PL_vtbl_env;
3301 case want_vtbl_envelem:
3302 result = &PL_vtbl_envelem;
3305 result = &PL_vtbl_sig;
3307 case want_vtbl_sigelem:
3308 result = &PL_vtbl_sigelem;
3310 case want_vtbl_pack:
3311 result = &PL_vtbl_pack;
3313 case want_vtbl_packelem:
3314 result = &PL_vtbl_packelem;
3316 case want_vtbl_dbline:
3317 result = &PL_vtbl_dbline;
3320 result = &PL_vtbl_isa;
3322 case want_vtbl_isaelem:
3323 result = &PL_vtbl_isaelem;
3325 case want_vtbl_arylen:
3326 result = &PL_vtbl_arylen;
3328 case want_vtbl_mglob:
3329 result = &PL_vtbl_mglob;
3331 case want_vtbl_nkeys:
3332 result = &PL_vtbl_nkeys;
3334 case want_vtbl_taint:
3335 result = &PL_vtbl_taint;
3337 case want_vtbl_substr:
3338 result = &PL_vtbl_substr;
3341 result = &PL_vtbl_vec;
3344 result = &PL_vtbl_pos;
3347 result = &PL_vtbl_bm;
3350 result = &PL_vtbl_fm;
3352 case want_vtbl_uvar:
3353 result = &PL_vtbl_uvar;
3355 case want_vtbl_defelem:
3356 result = &PL_vtbl_defelem;
3358 case want_vtbl_regexp:
3359 result = &PL_vtbl_regexp;
3361 case want_vtbl_regdata:
3362 result = &PL_vtbl_regdata;
3364 case want_vtbl_regdatum:
3365 result = &PL_vtbl_regdatum;
3367 #ifdef USE_LOCALE_COLLATE
3368 case want_vtbl_collxfrm:
3369 result = &PL_vtbl_collxfrm;
3372 case want_vtbl_amagic:
3373 result = &PL_vtbl_amagic;
3375 case want_vtbl_amagicelem:
3376 result = &PL_vtbl_amagicelem;
3378 case want_vtbl_backref:
3379 result = &PL_vtbl_backref;
3381 case want_vtbl_utf8:
3382 result = &PL_vtbl_utf8;
3388 return (MGVTBL*)result;
3392 Perl_my_fflush_all(pTHX)
3394 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3395 return PerlIO_flush(NULL);
3397 # if defined(HAS__FWALK)
3398 extern int fflush(FILE *);
3399 /* undocumented, unprototyped, but very useful BSDism */
3400 extern void _fwalk(int (*)(FILE *));
3404 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3406 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3407 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3409 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3410 open_max = sysconf(_SC_OPEN_MAX);
3413 open_max = FOPEN_MAX;
3416 open_max = OPEN_MAX;
3427 for (i = 0; i < open_max; i++)
3428 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3429 STDIO_STREAM_ARRAY[i]._file < open_max &&
3430 STDIO_STREAM_ARRAY[i]._flag)
3431 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3435 SETERRNO(EBADF,RMS_IFI);
3442 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3444 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3446 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3447 if (ckWARN(WARN_IO)) {
3448 const char * const direction =
3449 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3451 Perl_warner(aTHX_ packWARN(WARN_IO),
3452 "Filehandle %s opened only for %sput",
3455 Perl_warner(aTHX_ packWARN(WARN_IO),
3456 "Filehandle opened only for %sput", direction);
3463 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3465 warn_type = WARN_CLOSED;
3469 warn_type = WARN_UNOPENED;
3472 if (ckWARN(warn_type)) {
3473 const char * const pars =
3474 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3475 const char * const func =
3477 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3478 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3479 op < 0 ? "" : /* handle phoney cases */
3481 const char * const type =
3483 (OP_IS_SOCKET(op) ||
3484 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3485 "socket" : "filehandle");
3486 if (name && *name) {
3487 Perl_warner(aTHX_ packWARN(warn_type),
3488 "%s%s on %s %s %s", func, pars, vile, type, name);
3489 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3491 aTHX_ packWARN(warn_type),
3492 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3497 Perl_warner(aTHX_ packWARN(warn_type),
3498 "%s%s on %s %s", func, pars, vile, type);
3499 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3501 aTHX_ packWARN(warn_type),
3502 "\t(Are you trying to call %s%s on dirhandle?)\n",
3511 /* in ASCII order, not that it matters */
3512 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3515 Perl_ebcdic_control(pTHX_ int ch)
3523 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3524 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3527 if (ctlp == controllablechars)
3528 return('\177'); /* DEL */
3530 return((unsigned char)(ctlp - controllablechars - 1));
3531 } else { /* Want uncontrol */
3532 if (ch == '\177' || ch == -1)
3534 else if (ch == '\157')
3536 else if (ch == '\174')
3538 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3540 else if (ch == '\155')
3542 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3543 return(controllablechars[ch+1]);
3545 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3550 /* To workaround core dumps from the uninitialised tm_zone we get the
3551 * system to give us a reasonable struct to copy. This fix means that
3552 * strftime uses the tm_zone and tm_gmtoff values returned by
3553 * localtime(time()). That should give the desired result most of the
3554 * time. But probably not always!
3556 * This does not address tzname aspects of NETaa14816.
3561 # ifndef STRUCT_TM_HASZONE
3562 # define STRUCT_TM_HASZONE
3566 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3567 # ifndef HAS_TM_TM_ZONE
3568 # define HAS_TM_TM_ZONE
3573 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3575 #ifdef HAS_TM_TM_ZONE
3577 const struct tm* my_tm;
3579 my_tm = localtime(&now);
3581 Copy(my_tm, ptm, 1, struct tm);
3583 PERL_UNUSED_ARG(ptm);
3588 * mini_mktime - normalise struct tm values without the localtime()
3589 * semantics (and overhead) of mktime().
3592 Perl_mini_mktime(pTHX_ struct tm *ptm)
3596 int month, mday, year, jday;
3597 int odd_cent, odd_year;
3598 PERL_UNUSED_CONTEXT;
3600 #define DAYS_PER_YEAR 365
3601 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3602 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3603 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3604 #define SECS_PER_HOUR (60*60)
3605 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3606 /* parentheses deliberately absent on these two, otherwise they don't work */
3607 #define MONTH_TO_DAYS 153/5
3608 #define DAYS_TO_MONTH 5/153
3609 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3610 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3611 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3612 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3615 * Year/day algorithm notes:
3617 * With a suitable offset for numeric value of the month, one can find
3618 * an offset into the year by considering months to have 30.6 (153/5) days,
3619 * using integer arithmetic (i.e., with truncation). To avoid too much
3620 * messing about with leap days, we consider January and February to be
3621 * the 13th and 14th month of the previous year. After that transformation,
3622 * we need the month index we use to be high by 1 from 'normal human' usage,
3623 * so the month index values we use run from 4 through 15.
3625 * Given that, and the rules for the Gregorian calendar (leap years are those
3626 * divisible by 4 unless also divisible by 100, when they must be divisible
3627 * by 400 instead), we can simply calculate the number of days since some
3628 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3629 * the days we derive from our month index, and adding in the day of the
3630 * month. The value used here is not adjusted for the actual origin which
3631 * it normally would use (1 January A.D. 1), since we're not exposing it.
3632 * We're only building the value so we can turn around and get the
3633 * normalised values for the year, month, day-of-month, and day-of-year.
3635 * For going backward, we need to bias the value we're using so that we find
3636 * the right year value. (Basically, we don't want the contribution of
3637 * March 1st to the number to apply while deriving the year). Having done
3638 * that, we 'count up' the contribution to the year number by accounting for
3639 * full quadracenturies (400-year periods) with their extra leap days, plus
3640 * the contribution from full centuries (to avoid counting in the lost leap
3641 * days), plus the contribution from full quad-years (to count in the normal
3642 * leap days), plus the leftover contribution from any non-leap years.
3643 * At this point, if we were working with an actual leap day, we'll have 0
3644 * days left over. This is also true for March 1st, however. So, we have
3645 * to special-case that result, and (earlier) keep track of the 'odd'
3646 * century and year contributions. If we got 4 extra centuries in a qcent,
3647 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3648 * Otherwise, we add back in the earlier bias we removed (the 123 from
3649 * figuring in March 1st), find the month index (integer division by 30.6),
3650 * and the remainder is the day-of-month. We then have to convert back to
3651 * 'real' months (including fixing January and February from being 14/15 in
3652 * the previous year to being in the proper year). After that, to get
3653 * tm_yday, we work with the normalised year and get a new yearday value for
3654 * January 1st, which we subtract from the yearday value we had earlier,
3655 * representing the date we've re-built. This is done from January 1
3656 * because tm_yday is 0-origin.
3658 * Since POSIX time routines are only guaranteed to work for times since the
3659 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3660 * applies Gregorian calendar rules even to dates before the 16th century
3661 * doesn't bother me. Besides, you'd need cultural context for a given
3662 * date to know whether it was Julian or Gregorian calendar, and that's
3663 * outside the scope for this routine. Since we convert back based on the
3664 * same rules we used to build the yearday, you'll only get strange results
3665 * for input which needed normalising, or for the 'odd' century years which
3666 * were leap years in the Julian calander but not in the Gregorian one.
3667 * I can live with that.
3669 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3670 * that's still outside the scope for POSIX time manipulation, so I don't
3674 year = 1900 + ptm->tm_year;
3675 month = ptm->tm_mon;
3676 mday = ptm->tm_mday;
3677 /* allow given yday with no month & mday to dominate the result */
3678 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3681 jday = 1 + ptm->tm_yday;
3690 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3691 yearday += month*MONTH_TO_DAYS + mday + jday;
3693 * Note that we don't know when leap-seconds were or will be,
3694 * so we have to trust the user if we get something which looks
3695 * like a sensible leap-second. Wild values for seconds will
3696 * be rationalised, however.
3698 if ((unsigned) ptm->tm_sec <= 60) {
3705 secs += 60 * ptm->tm_min;
3706 secs += SECS_PER_HOUR * ptm->tm_hour;
3708 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3709 /* got negative remainder, but need positive time */
3710 /* back off an extra day to compensate */
3711 yearday += (secs/SECS_PER_DAY)-1;
3712 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3715 yearday += (secs/SECS_PER_DAY);
3716 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3719 else if (secs >= SECS_PER_DAY) {
3720 yearday += (secs/SECS_PER_DAY);
3721 secs %= SECS_PER_DAY;
3723 ptm->tm_hour = secs/SECS_PER_HOUR;
3724 secs %= SECS_PER_HOUR;
3725 ptm->tm_min = secs/60;
3727 ptm->tm_sec += secs;
3728 /* done with time of day effects */
3730 * The algorithm for yearday has (so far) left it high by 428.
3731 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3732 * bias it by 123 while trying to figure out what year it
3733 * really represents. Even with this tweak, the reverse
3734 * translation fails for years before A.D. 0001.
3735 * It would still fail for Feb 29, but we catch that one below.
3737 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3738 yearday -= YEAR_ADJUST;
3739 year = (yearday / DAYS_PER_QCENT) * 400;
3740 yearday %= DAYS_PER_QCENT;
3741 odd_cent = yearday / DAYS_PER_CENT;
3742 year += odd_cent * 100;
3743 yearday %= DAYS_PER_CENT;
3744 year += (yearday / DAYS_PER_QYEAR) * 4;
3745 yearday %= DAYS_PER_QYEAR;
3746 odd_year = yearday / DAYS_PER_YEAR;
3748 yearday %= DAYS_PER_YEAR;
3749 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3754 yearday += YEAR_ADJUST; /* recover March 1st crock */
3755 month = yearday*DAYS_TO_MONTH;
3756 yearday -= month*MONTH_TO_DAYS;
3757 /* recover other leap-year adjustment */
3766 ptm->tm_year = year - 1900;
3768 ptm->tm_mday = yearday;
3769 ptm->tm_mon = month;
3773 ptm->tm_mon = month - 1;
3775 /* re-build yearday based on Jan 1 to get tm_yday */
3777 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3778 yearday += 14*MONTH_TO_DAYS + 1;
3779 ptm->tm_yday = jday - yearday;
3780 /* fix tm_wday if not overridden by caller */
3781 if ((unsigned)ptm->tm_wday > 6)
3782 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3786 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)
3794 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3797 mytm.tm_hour = hour;
3798 mytm.tm_mday = mday;
3800 mytm.tm_year = year;
3801 mytm.tm_wday = wday;
3802 mytm.tm_yday = yday;
3803 mytm.tm_isdst = isdst;
3805 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3806 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3811 #ifdef HAS_TM_TM_GMTOFF
3812 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3814 #ifdef HAS_TM_TM_ZONE
3815 mytm.tm_zone = mytm2.tm_zone;
3820 Newx(buf, buflen, char);
3821 len = strftime(buf, buflen, fmt, &mytm);
3823 ** The following is needed to handle to the situation where
3824 ** tmpbuf overflows. Basically we want to allocate a buffer
3825 ** and try repeatedly. The reason why it is so complicated
3826 ** is that getting a return value of 0 from strftime can indicate
3827 ** one of the following:
3828 ** 1. buffer overflowed,
3829 ** 2. illegal conversion specifier, or
3830 ** 3. the format string specifies nothing to be returned(not
3831 ** an error). This could be because format is an empty string
3832 ** or it specifies %p that yields an empty string in some locale.
3833 ** If there is a better way to make it portable, go ahead by
3836 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3839 /* Possibly buf overflowed - try again with a bigger buf */
3840 const int fmtlen = strlen(fmt);
3841 int bufsize = fmtlen + buflen;
3843 Newx(buf, bufsize, char);
3845 buflen = strftime(buf, bufsize, fmt, &mytm);
3846 if (buflen > 0 && buflen < bufsize)
3848 /* heuristic to prevent out-of-memory errors */
3849 if (bufsize > 100*fmtlen) {
3855 Renew(buf, bufsize, char);
3860 Perl_croak(aTHX_ "panic: no strftime");
3866 #define SV_CWD_RETURN_UNDEF \
3867 sv_setsv(sv, &PL_sv_undef); \
3870 #define SV_CWD_ISDOT(dp) \
3871 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3872 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3875 =head1 Miscellaneous Functions
3877 =for apidoc getcwd_sv
3879 Fill the sv with current working directory
3884 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3885 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3886 * getcwd(3) if available
3887 * Comments from the orignal:
3888 * This is a faster version of getcwd. It's also more dangerous
3889 * because you might chdir out of a directory that you can't chdir
3893 Perl_getcwd_sv(pTHX_ register SV *sv)
3897 #ifndef INCOMPLETE_TAINTS
3903 char buf[MAXPATHLEN];
3905 /* Some getcwd()s automatically allocate a buffer of the given
3906 * size from the heap if they are given a NULL buffer pointer.
3907 * The problem is that this behaviour is not portable. */
3908 if (getcwd(buf, sizeof(buf) - 1)) {
3913 sv_setsv(sv, &PL_sv_undef);
3921 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3925 SvUPGRADE(sv, SVt_PV);
3927 if (PerlLIO_lstat(".", &statbuf) < 0) {
3928 SV_CWD_RETURN_UNDEF;
3931 orig_cdev = statbuf.st_dev;
3932 orig_cino = statbuf.st_ino;
3941 if (PerlDir_chdir("..") < 0) {
3942 SV_CWD_RETURN_UNDEF;
3944 if (PerlLIO_stat(".", &statbuf) < 0) {
3945 SV_CWD_RETURN_UNDEF;
3948 cdev = statbuf.st_dev;
3949 cino = statbuf.st_ino;
3951 if (odev == cdev && oino == cino) {
3954 if (!(dir = PerlDir_open("."))) {
3955 SV_CWD_RETURN_UNDEF;
3958 while ((dp = PerlDir_read(dir)) != NULL) {
3960 const int namelen = dp->d_namlen;
3962 const int namelen = strlen(dp->d_name);
3965 if (SV_CWD_ISDOT(dp)) {
3969 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3970 SV_CWD_RETURN_UNDEF;
3973 tdev = statbuf.st_dev;
3974 tino = statbuf.st_ino;
3975 if (tino == oino && tdev == odev) {
3981 SV_CWD_RETURN_UNDEF;
3984 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3985 SV_CWD_RETURN_UNDEF;
3988 SvGROW(sv, pathlen + namelen + 1);
3992 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3995 /* prepend current directory to the front */
3997 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3998 pathlen += (namelen + 1);
4000 #ifdef VOID_CLOSEDIR
4003 if (PerlDir_close(dir) < 0) {
4004 SV_CWD_RETURN_UNDEF;
4010 SvCUR_set(sv, pathlen);
4014 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4015 SV_CWD_RETURN_UNDEF;
4018 if (PerlLIO_stat(".", &statbuf) < 0) {
4019 SV_CWD_RETURN_UNDEF;
4022 cdev = statbuf.st_dev;
4023 cino = statbuf.st_ino;
4025 if (cdev != orig_cdev || cino != orig_cino) {
4026 Perl_croak(aTHX_ "Unstable directory path, "
4027 "current directory changed unexpectedly");
4039 =for apidoc scan_version
4041 Returns a pointer to the next character after the parsed
4042 version string, as well as upgrading the passed in SV to
4045 Function must be called with an already existing SV like
4048 s = scan_version(s,SV *sv, bool qv);
4050 Performs some preprocessing to the string to ensure that
4051 it has the correct characteristics of a version. Flags the
4052 object if it contains an underscore (which denotes this
4053 is a alpha version). The boolean qv denotes that the version
4054 should be interpreted as if it had multiple decimals, even if
4061 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4069 AV * const av = newAV();
4070 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4071 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4073 #ifndef NODEFAULT_SHAREKEYS
4074 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4077 while (isSPACE(*s)) /* leading whitespace is OK */
4081 s++; /* get past 'v' */
4082 qv = 1; /* force quoted version processing */
4085 start = last = pos = s;
4087 /* pre-scan the input string to check for decimals/underbars */
4088 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4093 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4097 else if ( *pos == '_' )
4100 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4102 width = pos - last - 1; /* natural width of sub-version */
4107 if ( alpha && !saw_period )
4108 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4110 if ( saw_period > 1 )
4111 qv = 1; /* force quoted version processing */
4116 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4118 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4119 if ( !qv && width < 3 )
4120 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4122 while (isDIGIT(*pos))
4124 if (!isALPHA(*pos)) {
4130 /* this is atoi() that delimits on underscores */
4131 const char *end = pos;
4135 /* the following if() will only be true after the decimal
4136 * point of a version originally created with a bare
4137 * floating point number, i.e. not quoted in any way
4139 if ( !qv && s > start && saw_period == 1 ) {
4143 rev += (*s - '0') * mult;
4145 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4146 Perl_croak(aTHX_ "Integer overflow in version");
4153 while (--end >= s) {
4155 rev += (*end - '0') * mult;
4157 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4158 Perl_croak(aTHX_ "Integer overflow in version");
4163 /* Append revision */
4164 av_push(av, newSViv(rev));
4167 else if ( *pos == '_' && isDIGIT(pos[1]) )
4169 else if ( isDIGIT(*pos) )
4176 while ( isDIGIT(*pos) )
4181 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4189 if ( qv ) { /* quoted versions always get at least three terms*/
4190 I32 len = av_len(av);
4191 /* This for loop appears to trigger a compiler bug on OS X, as it
4192 loops infinitely. Yes, len is negative. No, it makes no sense.
4193 Compiler in question is:
4194 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4195 for ( len = 2 - len; len > 0; len-- )
4196 av_push((AV *)sv, newSViv(0));
4200 av_push(av, newSViv(0));
4203 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4204 av_push(av, newSViv(0));
4206 /* fix RT#19517 - special case 'undef' as string */
4207 if ( *s == 'u' && strEQ(s,"undef") ) {
4211 /* And finally, store the AV in the hash */
4212 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4217 =for apidoc new_version
4219 Returns a new version object based on the passed in SV:
4221 SV *sv = new_version(SV *ver);
4223 Does not alter the passed in ver SV. See "upg_version" if you
4224 want to upgrade the SV.
4230 Perl_new_version(pTHX_ SV *ver)
4233 SV * const rv = newSV(0);
4234 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4237 AV * const av = newAV();
4239 /* This will get reblessed later if a derived class*/
4240 SV * const hv = newSVrv(rv, "version");
4241 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4242 #ifndef NODEFAULT_SHAREKEYS
4243 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4249 /* Begin copying all of the elements */
4250 if ( hv_exists((HV *)ver, "qv", 2) )
4251 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4253 if ( hv_exists((HV *)ver, "alpha", 5) )
4254 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4256 if ( hv_exists((HV*)ver, "width", 5 ) )
4258 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4259 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4262 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4263 /* This will get reblessed later if a derived class*/
4264 for ( key = 0; key <= av_len(sav); key++ )
4266 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4267 av_push(av, newSViv(rev));
4270 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4275 const MAGIC* const mg = SvVSTRING_mg(ver);
4276 if ( mg ) { /* already a v-string */
4277 const STRLEN len = mg->mg_len;
4278 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4279 sv_setpvn(rv,version,len);
4284 sv_setsv(rv,ver); /* make a duplicate */
4289 return upg_version(rv);
4293 =for apidoc upg_version
4295 In-place upgrade of the supplied SV to a version object.
4297 SV *sv = upg_version(SV *sv);
4299 Returns a pointer to the upgraded SV.
4305 Perl_upg_version(pTHX_ SV *ver)
4307 const char *version, *s;
4313 if ( SvNOK(ver) ) /* may get too much accuracy */
4316 #ifdef USE_LOCALE_NUMERIC
4317 char *loc = setlocale(LC_NUMERIC, "C");
4319 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4320 #ifdef USE_LOCALE_NUMERIC
4321 setlocale(LC_NUMERIC, loc);
4323 while (tbuf[len-1] == '0' && len > 0) len--;
4324 version = savepvn(tbuf, len);
4327 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4328 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4332 else /* must be a string or something like a string */
4334 version = savepv(SvPV_nolen(ver));
4337 s = scan_version(version, ver, qv);
4339 if(ckWARN(WARN_MISC))
4340 Perl_warner(aTHX_ packWARN(WARN_MISC),
4341 "Version string '%s' contains invalid data; "
4342 "ignoring: '%s'", version, s);
4350 Validates that the SV contains a valid version object.
4352 bool vverify(SV *vobj);
4354 Note that it only confirms the bare minimum structure (so as not to get
4355 confused by derived classes which may contain additional hash entries):
4359 =item * The SV contains a [reference to a] hash
4361 =item * The hash contains a "version" key
4363 =item * The "version" key has [a reference to] an AV as its value
4371 Perl_vverify(pTHX_ SV *vs)
4377 /* see if the appropriate elements exist */
4378 if ( SvTYPE(vs) == SVt_PVHV
4379 && hv_exists((HV*)vs, "version", 7)
4380 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4381 && SvTYPE(sv) == SVt_PVAV )
4390 Accepts a version object and returns the normalized floating
4391 point representation. Call like:
4395 NOTE: you can pass either the object directly or the SV
4396 contained within the RV.
4402 Perl_vnumify(pTHX_ SV *vs)
4407 SV * const sv = newSV(0);
4413 Perl_croak(aTHX_ "Invalid version object");
4415 /* see if various flags exist */
4416 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4418 if ( hv_exists((HV*)vs, "width", 5 ) )
4419 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4424 /* attempt to retrieve the version array */
4425 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4437 digit = SvIV(*av_fetch(av, 0, 0));
4438 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4439 for ( i = 1 ; i < len ; i++ )
4441 digit = SvIV(*av_fetch(av, i, 0));
4443 const int denom = (width == 2 ? 10 : 100);
4444 const div_t term = div((int)PERL_ABS(digit),denom);
4445 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4448 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4454 digit = SvIV(*av_fetch(av, len, 0));
4455 if ( alpha && width == 3 ) /* alpha version */
4457 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4461 sv_catpvs(sv, "000");
4469 Accepts a version object and returns the normalized string
4470 representation. Call like:
4474 NOTE: you can pass either the object directly or the SV
4475 contained within the RV.
4481 Perl_vnormal(pTHX_ SV *vs)
4485 SV * const sv = newSV(0);
4491 Perl_croak(aTHX_ "Invalid version object");
4493 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4495 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4503 digit = SvIV(*av_fetch(av, 0, 0));
4504 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4505 for ( i = 1 ; i < len ; i++ ) {
4506 digit = SvIV(*av_fetch(av, i, 0));
4507 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4512 /* handle last digit specially */
4513 digit = SvIV(*av_fetch(av, len, 0));
4515 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4517 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4520 if ( len <= 2 ) { /* short version, must be at least three */
4521 for ( len = 2 - len; len != 0; len-- )
4528 =for apidoc vstringify
4530 In order to maintain maximum compatibility with earlier versions
4531 of Perl, this function will return either the floating point
4532 notation or the multiple dotted notation, depending on whether
4533 the original version contained 1 or more dots, respectively
4539 Perl_vstringify(pTHX_ SV *vs)
4545 Perl_croak(aTHX_ "Invalid version object");
4547 if ( hv_exists((HV *)vs, "qv", 2) )
4556 Version object aware cmp. Both operands must already have been
4557 converted into version objects.
4563 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4566 bool lalpha = FALSE;
4567 bool ralpha = FALSE;
4576 if ( !vverify(lhv) )
4577 Perl_croak(aTHX_ "Invalid version object");
4579 if ( !vverify(rhv) )
4580 Perl_croak(aTHX_ "Invalid version object");
4582 /* get the left hand term */
4583 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4584 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4587 /* and the right hand term */
4588 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4589 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4597 while ( i <= m && retval == 0 )
4599 left = SvIV(*av_fetch(lav,i,0));
4600 right = SvIV(*av_fetch(rav,i,0));
4608 /* tiebreaker for alpha with identical terms */
4609 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4611 if ( lalpha && !ralpha )
4615 else if ( ralpha && !lalpha)
4621 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4625 while ( i <= r && retval == 0 )
4627 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4628 retval = -1; /* not a match after all */
4634 while ( i <= l && retval == 0 )
4636 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4637 retval = +1; /* not a match after all */
4645 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4646 # define EMULATE_SOCKETPAIR_UDP
4649 #ifdef EMULATE_SOCKETPAIR_UDP
4651 S_socketpair_udp (int fd[2]) {
4653 /* Fake a datagram socketpair using UDP to localhost. */
4654 int sockets[2] = {-1, -1};
4655 struct sockaddr_in addresses[2];
4657 Sock_size_t size = sizeof(struct sockaddr_in);
4658 unsigned short port;
4661 memset(&addresses, 0, sizeof(addresses));
4664 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4665 if (sockets[i] == -1)
4666 goto tidy_up_and_fail;
4668 addresses[i].sin_family = AF_INET;
4669 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4670 addresses[i].sin_port = 0; /* kernel choses port. */
4671 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4672 sizeof(struct sockaddr_in)) == -1)
4673 goto tidy_up_and_fail;
4676 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4677 for each connect the other socket to it. */
4680 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4682 goto tidy_up_and_fail;
4683 if (size != sizeof(struct sockaddr_in))
4684 goto abort_tidy_up_and_fail;
4685 /* !1 is 0, !0 is 1 */
4686 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4687 sizeof(struct sockaddr_in)) == -1)
4688 goto tidy_up_and_fail;
4691 /* Now we have 2 sockets connected to each other. I don't trust some other
4692 process not to have already sent a packet to us (by random) so send
4693 a packet from each to the other. */
4696 /* I'm going to send my own port number. As a short.
4697 (Who knows if someone somewhere has sin_port as a bitfield and needs
4698 this routine. (I'm assuming crays have socketpair)) */
4699 port = addresses[i].sin_port;
4700 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4701 if (got != sizeof(port)) {
4703 goto tidy_up_and_fail;
4704 goto abort_tidy_up_and_fail;
4708 /* Packets sent. I don't trust them to have arrived though.
4709 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4710 connect to localhost will use a second kernel thread. In 2.6 the
4711 first thread running the connect() returns before the second completes,
4712 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4713 returns 0. Poor programs have tripped up. One poor program's authors'
4714 had a 50-1 reverse stock split. Not sure how connected these were.)
4715 So I don't trust someone not to have an unpredictable UDP stack.
4719 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4720 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4724 FD_SET((unsigned int)sockets[0], &rset);
4725 FD_SET((unsigned int)sockets[1], &rset);
4727 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4728 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4729 || !FD_ISSET(sockets[1], &rset)) {
4730 /* I hope this is portable and appropriate. */
4732 goto tidy_up_and_fail;
4733 goto abort_tidy_up_and_fail;
4737 /* And the paranoia department even now doesn't trust it to have arrive
4738 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4740 struct sockaddr_in readfrom;
4741 unsigned short buffer[2];
4746 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4747 sizeof(buffer), MSG_DONTWAIT,
4748 (struct sockaddr *) &readfrom, &size);
4750 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4752 (struct sockaddr *) &readfrom, &size);
4756 goto tidy_up_and_fail;
4757 if (got != sizeof(port)
4758 || size != sizeof(struct sockaddr_in)
4759 /* Check other socket sent us its port. */
4760 || buffer[0] != (unsigned short) addresses[!i].sin_port
4761 /* Check kernel says we got the datagram from that socket */
4762 || readfrom.sin_family != addresses[!i].sin_family
4763 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4764 || readfrom.sin_port != addresses[!i].sin_port)
4765 goto abort_tidy_up_and_fail;
4768 /* My caller (my_socketpair) has validated that this is non-NULL */
4771 /* I hereby declare this connection open. May God bless all who cross
4775 abort_tidy_up_and_fail:
4776 errno = ECONNABORTED;
4779 const int save_errno = errno;
4780 if (sockets[0] != -1)
4781 PerlLIO_close(sockets[0]);
4782 if (sockets[1] != -1)
4783 PerlLIO_close(sockets[1]);
4788 #endif /* EMULATE_SOCKETPAIR_UDP */
4790 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4792 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4793 /* Stevens says that family must be AF_LOCAL, protocol 0.
4794 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4799 struct sockaddr_in listen_addr;
4800 struct sockaddr_in connect_addr;
4805 || family != AF_UNIX
4808 errno = EAFNOSUPPORT;
4816 #ifdef EMULATE_SOCKETPAIR_UDP
4817 if (type == SOCK_DGRAM)
4818 return S_socketpair_udp(fd);
4821 listener = PerlSock_socket(AF_INET, type, 0);
4824 memset(&listen_addr, 0, sizeof(listen_addr));
4825 listen_addr.sin_family = AF_INET;
4826 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4827 listen_addr.sin_port = 0; /* kernel choses port. */
4828 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4829 sizeof(listen_addr)) == -1)
4830 goto tidy_up_and_fail;
4831 if (PerlSock_listen(listener, 1) == -1)
4832 goto tidy_up_and_fail;
4834 connector = PerlSock_socket(AF_INET, type, 0);
4835 if (connector == -1)
4836 goto tidy_up_and_fail;
4837 /* We want to find out the port number to connect to. */
4838 size = sizeof(connect_addr);
4839 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4841 goto tidy_up_and_fail;
4842 if (size != sizeof(connect_addr))
4843 goto abort_tidy_up_and_fail;
4844 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4845 sizeof(connect_addr)) == -1)
4846 goto tidy_up_and_fail;
4848 size = sizeof(listen_addr);
4849 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4852 goto tidy_up_and_fail;
4853 if (size != sizeof(listen_addr))
4854 goto abort_tidy_up_and_fail;
4855 PerlLIO_close(listener);
4856 /* Now check we are talking to ourself by matching port and host on the
4858 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4860 goto tidy_up_and_fail;
4861 if (size != sizeof(connect_addr)
4862 || listen_addr.sin_family != connect_addr.sin_family
4863 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4864 || listen_addr.sin_port != connect_addr.sin_port) {
4865 goto abort_tidy_up_and_fail;
4871 abort_tidy_up_and_fail:
4873 errno = ECONNABORTED; /* This would be the standard thing to do. */
4875 # ifdef ECONNREFUSED
4876 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4878 errno = ETIMEDOUT; /* Desperation time. */
4883 const int save_errno = errno;
4885 PerlLIO_close(listener);
4886 if (connector != -1)
4887 PerlLIO_close(connector);
4889 PerlLIO_close(acceptor);
4895 /* In any case have a stub so that there's code corresponding
4896 * to the my_socketpair in global.sym. */
4898 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4899 #ifdef HAS_SOCKETPAIR
4900 return socketpair(family, type, protocol, fd);
4909 =for apidoc sv_nosharing
4911 Dummy routine which "shares" an SV when there is no sharing module present.
4912 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4913 Exists to avoid test for a NULL function pointer and because it could
4914 potentially warn under some level of strict-ness.
4920 Perl_sv_nosharing(pTHX_ SV *sv)
4922 PERL_UNUSED_CONTEXT;
4923 PERL_UNUSED_ARG(sv);
4927 Perl_parse_unicode_opts(pTHX_ const char **popt)
4929 const char *p = *popt;
4934 opt = (U32) atoi(p);
4937 if (*p && *p != '\n' && *p != '\r')
4938 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4943 case PERL_UNICODE_STDIN:
4944 opt |= PERL_UNICODE_STDIN_FLAG; break;
4945 case PERL_UNICODE_STDOUT:
4946 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4947 case PERL_UNICODE_STDERR:
4948 opt |= PERL_UNICODE_STDERR_FLAG; break;
4949 case PERL_UNICODE_STD:
4950 opt |= PERL_UNICODE_STD_FLAG; break;
4951 case PERL_UNICODE_IN:
4952 opt |= PERL_UNICODE_IN_FLAG; break;
4953 case PERL_UNICODE_OUT:
4954 opt |= PERL_UNICODE_OUT_FLAG; break;
4955 case PERL_UNICODE_INOUT:
4956 opt |= PERL_UNICODE_INOUT_FLAG; break;
4957 case PERL_UNICODE_LOCALE:
4958 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4959 case PERL_UNICODE_ARGV:
4960 opt |= PERL_UNICODE_ARGV_FLAG; break;
4961 case PERL_UNICODE_UTF8CACHEASSERT:
4962 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4964 if (*p != '\n' && *p != '\r')
4966 "Unknown Unicode option letter '%c'", *p);
4972 opt = PERL_UNICODE_DEFAULT_FLAGS;
4974 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4975 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4976 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4988 * This is really just a quick hack which grabs various garbage
4989 * values. It really should be a real hash algorithm which
4990 * spreads the effect of every input bit onto every output bit,
4991 * if someone who knows about such things would bother to write it.
4992 * Might be a good idea to add that function to CORE as well.
4993 * No numbers below come from careful analysis or anything here,
4994 * except they are primes and SEED_C1 > 1E6 to get a full-width
4995 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4996 * probably be bigger too.
4999 # define SEED_C1 1000003
5000 #define SEED_C4 73819
5002 # define SEED_C1 25747
5003 #define SEED_C4 20639
5007 #define SEED_C5 26107
5009 #ifndef PERL_NO_DEV_RANDOM
5014 # include <starlet.h>
5015 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5016 * in 100-ns units, typically incremented ever 10 ms. */
5017 unsigned int when[2];
5019 # ifdef HAS_GETTIMEOFDAY
5020 struct timeval when;
5026 /* This test is an escape hatch, this symbol isn't set by Configure. */
5027 #ifndef PERL_NO_DEV_RANDOM
5028 #ifndef PERL_RANDOM_DEVICE
5029 /* /dev/random isn't used by default because reads from it will block
5030 * if there isn't enough entropy available. You can compile with
5031 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5032 * is enough real entropy to fill the seed. */
5033 # define PERL_RANDOM_DEVICE "/dev/urandom"
5035 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5037 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5046 _ckvmssts(sys$gettim(when));
5047 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5049 # ifdef HAS_GETTIMEOFDAY
5050 PerlProc_gettimeofday(&when,NULL);
5051 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5054 u = (U32)SEED_C1 * when;
5057 u += SEED_C3 * (U32)PerlProc_getpid();
5058 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5059 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5060 u += SEED_C5 * (U32)PTR2UV(&when);
5066 Perl_get_hash_seed(pTHX)
5069 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5075 if (s && isDIGIT(*s))
5076 myseed = (UV)Atoul(s);
5078 #ifdef USE_HASH_SEED_EXPLICIT
5082 /* Compute a random seed */
5083 (void)seedDrand01((Rand_seed_t)seed());
5084 myseed = (UV)(Drand01() * (NV)UV_MAX);
5085 #if RANDBITS < (UVSIZE * 8)
5086 /* Since there are not enough randbits to to reach all
5087 * the bits of a UV, the low bits might need extra
5088 * help. Sum in another random number that will
5089 * fill in the low bits. */
5091 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5092 #endif /* RANDBITS < (UVSIZE * 8) */
5093 if (myseed == 0) { /* Superparanoia. */
5094 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5096 Perl_croak(aTHX_ "Your random numbers are not that random");
5099 PL_rehash_seed_set = TRUE;
5106 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5108 const char * const stashpv = CopSTASHPV(c);
5109 const char * const name = HvNAME_get(hv);
5110 PERL_UNUSED_CONTEXT;
5112 if (stashpv == name)
5114 if (stashpv && name)
5115 if (strEQ(stashpv, name))
5122 #ifdef PERL_GLOBAL_STRUCT
5125 Perl_init_global_struct(pTHX)
5127 struct perl_vars *plvarsp = NULL;
5128 #ifdef PERL_GLOBAL_STRUCT
5129 # define PERL_GLOBAL_STRUCT_INIT
5130 # include "opcode.h" /* the ppaddr and check */
5131 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5132 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5133 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5134 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5135 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5139 plvarsp = PL_VarsPtr;
5140 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5146 # define PERLVAR(var,type) /**/
5147 # define PERLVARA(var,n,type) /**/
5148 # define PERLVARI(var,type,init) plvarsp->var = init;
5149 # define PERLVARIC(var,type,init) plvarsp->var = init;
5150 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5151 # include "perlvars.h"
5157 # ifdef PERL_GLOBAL_STRUCT
5158 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5159 if (!plvarsp->Gppaddr)
5161 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5162 if (!plvarsp->Gcheck)
5164 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5165 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5167 # ifdef PERL_SET_VARS
5168 PERL_SET_VARS(plvarsp);
5170 # undef PERL_GLOBAL_STRUCT_INIT
5175 #endif /* PERL_GLOBAL_STRUCT */
5177 #ifdef PERL_GLOBAL_STRUCT
5180 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5182 #ifdef PERL_GLOBAL_STRUCT
5183 # ifdef PERL_UNSET_VARS
5184 PERL_UNSET_VARS(plvarsp);
5186 free(plvarsp->Gppaddr);
5187 free(plvarsp->Gcheck);
5188 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5194 #endif /* PERL_GLOBAL_STRUCT */
5199 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5201 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5202 * variable PERL_MEM_LOG will be consulted, and if the integer value
5203 * of that is true, the logging will happen. (The default is to
5204 * always log if the PERL_MEM_LOG define was in effect.)
5208 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5209 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5211 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5214 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5215 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5216 * in which case the environment variable PERL_MEM_LOG_FD will be
5217 * consulted for the file descriptor number to use.
5219 #ifndef PERL_MEM_LOG_FD
5220 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5224 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)
5226 #ifdef PERL_MEM_LOG_STDERR
5227 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5230 # ifdef PERL_MEM_LOG_ENV
5231 s = getenv("PERL_MEM_LOG");
5232 if (s ? atoi(s) : 0)
5235 /* We can't use SVs or PerlIO for obvious reasons,
5236 * so we'll use stdio and low-level IO instead. */
5237 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5238 # ifdef PERL_MEM_LOG_TIMESTAMP
5240 # ifdef HAS_GETTIMEOFDAY
5241 gettimeofday(&tv, 0);
5243 /* If there are other OS specific ways of hires time than
5244 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5245 * probably that they would be used to fill in the struct
5252 # ifdef PERL_MEM_LOG_TIMESTAMP
5255 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5256 " %s = %"IVdf": %"UVxf"\n",
5257 # ifdef PERL_MEM_LOG_TIMESTAMP
5258 (int)tv.tv_sec, (int)tv.tv_usec,
5260 filename, linenumber, funcname, n, typesize,
5261 typename, n * typesize, PTR2UV(newalloc));
5262 # ifdef PERL_MEM_LOG_ENV_FD
5263 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5264 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5266 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5275 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)
5277 #ifdef PERL_MEM_LOG_STDERR
5278 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5281 # ifdef PERL_MEM_LOG_ENV
5282 s = PerlEnv_getenv("PERL_MEM_LOG");
5283 if (s ? atoi(s) : 0)
5286 /* We can't use SVs or PerlIO for obvious reasons,
5287 * so we'll use stdio and low-level IO instead. */
5288 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5289 # ifdef PERL_MEM_LOG_TIMESTAMP
5291 gettimeofday(&tv, 0);
5297 # ifdef PERL_MEM_LOG_TIMESTAMP
5300 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5301 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5302 # ifdef PERL_MEM_LOG_TIMESTAMP
5303 (int)tv.tv_sec, (int)tv.tv_usec,
5305 filename, linenumber, funcname, n, typesize,
5306 typename, n * typesize, PTR2UV(oldalloc),
5308 # ifdef PERL_MEM_LOG_ENV_FD
5309 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5310 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5312 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5321 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5323 #ifdef PERL_MEM_LOG_STDERR
5324 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5327 # ifdef PERL_MEM_LOG_ENV
5328 s = PerlEnv_getenv("PERL_MEM_LOG");
5329 if (s ? atoi(s) : 0)
5332 /* We can't use SVs or PerlIO for obvious reasons,
5333 * so we'll use stdio and low-level IO instead. */
5334 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5335 # ifdef PERL_MEM_LOG_TIMESTAMP
5337 gettimeofday(&tv, 0);
5343 # ifdef PERL_MEM_LOG_TIMESTAMP
5346 "free: %s:%d:%s: %"UVxf"\n",
5347 # ifdef PERL_MEM_LOG_TIMESTAMP
5348 (int)tv.tv_sec, (int)tv.tv_usec,
5350 filename, linenumber, funcname,
5352 # ifdef PERL_MEM_LOG_ENV_FD
5353 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5354 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5356 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5364 #endif /* PERL_MEM_LOG */
5367 =for apidoc my_sprintf
5369 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5370 the length of the string written to the buffer. Only rare pre-ANSI systems
5371 need the wrapper function - usually this is a direct call to C<sprintf>.
5375 #ifndef SPRINTF_RETURNS_STRLEN
5377 Perl_my_sprintf(char *buffer, const char* pat, ...)
5380 va_start(args, pat);
5381 vsprintf(buffer, pat, args);
5383 return strlen(buffer);
5388 =for apidoc my_snprintf
5390 The C library C<snprintf> functionality, if available and
5391 standards-compliant (uses C<vsnprintf>, actually). However, if the
5392 C<vsnprintf> is not available, will unfortunately use the unsafe
5393 C<vsprintf> which can overrun the buffer (there is an overrun check,
5394 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5395 getting C<vsnprintf>.
5400 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5405 va_start(ap, format);
5406 #ifdef HAS_VSNPRINTF
5407 retval = vsnprintf(buffer, len, format, ap);
5409 retval = vsprintf(buffer, format, ap);
5412 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5413 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5414 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5419 =for apidoc my_vsnprintf
5421 The C library C<vsnprintf> if available and standards-compliant.
5422 However, if if the C<vsnprintf> is not available, will unfortunately
5423 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5424 overrun check, but that may be too late). Consider using
5425 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5430 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5436 Perl_va_copy(ap, apc);
5437 # ifdef HAS_VSNPRINTF
5438 retval = vsnprintf(buffer, len, format, apc);
5440 retval = vsprintf(buffer, format, apc);
5443 # ifdef HAS_VSNPRINTF
5444 retval = vsnprintf(buffer, len, format, ap);
5446 retval = vsprintf(buffer, format, ap);
5448 #endif /* #ifdef NEED_VA_COPY */
5449 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5450 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5451 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5456 Perl_my_clearenv(pTHX)
5459 #if ! defined(PERL_MICRO)
5460 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5462 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5463 # if defined(USE_ENVIRON_ARRAY)
5464 # if defined(USE_ITHREADS)
5465 /* only the parent thread can clobber the process environment */
5466 if (PL_curinterp == aTHX)
5467 # endif /* USE_ITHREADS */
5469 # if ! defined(PERL_USE_SAFE_PUTENV)
5470 if ( !PL_use_safe_putenv) {
5472 if (environ == PL_origenviron)
5473 environ = (char**)safesysmalloc(sizeof(char*));
5475 for (i = 0; environ[i]; i++)
5476 (void)safesysfree(environ[i]);
5479 # else /* PERL_USE_SAFE_PUTENV */
5480 # if defined(HAS_CLEARENV)
5482 # elif defined(HAS_UNSETENV)
5483 int bsiz = 80; /* Most envvar names will be shorter than this. */
5484 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5485 char *buf = (char*)safesysmalloc(bufsiz);
5486 while (*environ != NULL) {
5487 char *e = strchr(*environ, '=');
5488 int l = e ? e - *environ : (int)strlen(*environ);
5490 (void)safesysfree(buf);
5491 bsiz = l + 1; /* + 1 for the \0. */
5492 buf = (char*)safesysmalloc(bufsiz);
5494 my_strlcpy(buf, *environ, l + 1);
5495 (void)unsetenv(buf);
5497 (void)safesysfree(buf);
5498 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5499 /* Just null environ and accept the leakage. */
5501 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5502 # endif /* ! PERL_USE_SAFE_PUTENV */
5504 # endif /* USE_ENVIRON_ARRAY */
5505 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5506 #endif /* PERL_MICRO */
5509 #ifdef PERL_IMPLICIT_CONTEXT
5511 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5512 the global PL_my_cxt_index is incremented, and that value is assigned to
5513 that module's static my_cxt_index (who's address is passed as an arg).
5514 Then, for each interpreter this function is called for, it makes sure a
5515 void* slot is available to hang the static data off, by allocating or
5516 extending the interpreter's PL_my_cxt_list array */
5519 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5524 /* this module hasn't been allocated an index yet */
5525 MUTEX_LOCK(&PL_my_ctx_mutex);
5526 *index = PL_my_cxt_index++;
5527 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5530 /* make sure the array is big enough */
5531 if (PL_my_cxt_size <= *index) {
5532 if (PL_my_cxt_size) {
5533 while (PL_my_cxt_size <= *index)
5534 PL_my_cxt_size *= 2;
5535 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5538 PL_my_cxt_size = 16;
5539 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5542 /* newSV() allocates one more than needed */
5543 p = (void*)SvPVX(newSV(size-1));
5544 PL_my_cxt_list[*index] = p;
5545 Zero(p, size, char);
5552 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5554 Size_t used, length, copy;
5557 length = strlen(src);
5558 if (size > 0 && used < size - 1) {
5559 copy = (length >= size - used) ? size - used - 1 : length;
5560 memcpy(dst + used, src, copy);
5561 dst[used + copy] = '\0';
5563 return used + length;
5569 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5571 Size_t length, copy;
5573 length = strlen(src);
5575 copy = (length >= size) ? size - 1 : length;
5576 memcpy(dst, src, copy);
5584 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5587 SV * const dbsv = GvSVn(PL_DBsub);
5588 /* We do not care about using sv to call CV;
5589 * it's for informational purposes only.
5593 if (!PERLDB_SUB_NN) {
5594 GV * const gv = CvGV(cv);
5596 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5597 || strEQ(GvNAME(gv), "END")
5598 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5599 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5600 /* Use GV from the stack as a fallback. */
5601 /* GV is potentially non-unique, or contain different CV. */
5602 SV * const tmp = newRV((SV*)cv);
5603 sv_setsv(dbsv, tmp);
5607 gv_efullname3(dbsv, gv, NULL);
5611 const int type = SvTYPE(dbsv);
5612 if (type < SVt_PVIV && type != SVt_IV)
5613 sv_upgrade(dbsv, SVt_PVIV);
5614 (void)SvIOK_on(dbsv);
5615 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5621 * c-indentation-style: bsd
5623 * indent-tabs-mode: t
5626 * ex: set ts=8 sts=4 sw=4 noet: