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 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2271 return my_syspopen4(aTHX_ Nullch, mode, n, args);
2273 Perl_croak(aTHX_ "List form of piped open not implemented");
2274 return (PerlIO *) NULL;
2279 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2280 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2282 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2286 register I32 This, that;
2289 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2293 PERL_FLUSHALL_FOR_CHILD;
2296 return my_syspopen(aTHX_ cmd,mode);
2299 This = (*mode == 'w');
2301 if (doexec && PL_tainting) {
2303 taint_proper("Insecure %s%s", "EXEC");
2305 if (PerlProc_pipe(p) < 0)
2307 if (doexec && PerlProc_pipe(pp) >= 0)
2309 while ((pid = PerlProc_fork()) < 0) {
2310 if (errno != EAGAIN) {
2311 PerlLIO_close(p[This]);
2312 PerlLIO_close(p[that]);
2314 PerlLIO_close(pp[0]);
2315 PerlLIO_close(pp[1]);
2318 Perl_croak(aTHX_ "Can't fork");
2331 PerlLIO_close(pp[0]);
2332 #if defined(HAS_FCNTL) && defined(F_SETFD)
2333 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2336 if (p[THIS] != (*mode == 'r')) {
2337 PerlLIO_dup2(p[THIS], *mode == 'r');
2338 PerlLIO_close(p[THIS]);
2339 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2340 PerlLIO_close(p[THAT]);
2343 PerlLIO_close(p[THAT]);
2346 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2353 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2358 /* may or may not use the shell */
2359 do_exec3(cmd, pp[1], did_pipes);
2362 #endif /* defined OS2 */
2364 #ifdef PERLIO_USING_CRLF
2365 /* Since we circumvent IO layers when we manipulate low-level
2366 filedescriptors directly, need to manually switch to the
2367 default, binary, low-level mode; see PerlIOBuf_open(). */
2368 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2371 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2372 SvREADONLY_off(GvSV(tmpgv));
2373 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2374 SvREADONLY_on(GvSV(tmpgv));
2376 #ifdef THREADS_HAVE_PIDS
2377 PL_ppid = (IV)getppid();
2380 #ifdef PERL_USES_PL_PIDSTATUS
2381 hv_clear(PL_pidstatus); /* we have no children */
2387 do_execfree(); /* free any memory malloced by child on vfork */
2389 PerlLIO_close(pp[1]);
2390 if (p[that] < p[This]) {
2391 PerlLIO_dup2(p[This], p[that]);
2392 PerlLIO_close(p[This]);
2396 PerlLIO_close(p[that]);
2399 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2401 SvUPGRADE(sv,SVt_IV);
2403 PL_forkprocess = pid;
2404 if (did_pipes && pid > 0) {
2409 while (n < sizeof(int)) {
2410 n1 = PerlLIO_read(pp[0],
2411 (void*)(((char*)&errkid)+n),
2417 PerlLIO_close(pp[0]);
2419 if (n) { /* Error */
2421 PerlLIO_close(p[This]);
2422 if (n != sizeof(int))
2423 Perl_croak(aTHX_ "panic: kid popen errno read");
2425 pid2 = wait4pid(pid, &status, 0);
2426 } while (pid2 == -1 && errno == EINTR);
2427 errno = errkid; /* Propagate errno from kid */
2432 PerlLIO_close(pp[0]);
2433 return PerlIO_fdopen(p[This], mode);
2436 #if defined(atarist) || defined(EPOC)
2439 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2441 PERL_FLUSHALL_FOR_CHILD;
2442 /* Call system's popen() to get a FILE *, then import it.
2443 used 0 for 2nd parameter to PerlIO_importFILE;
2446 return PerlIO_importFILE(popen(cmd, mode), 0);
2450 FILE *djgpp_popen();
2452 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2454 PERL_FLUSHALL_FOR_CHILD;
2455 /* Call system's popen() to get a FILE *, then import it.
2456 used 0 for 2nd parameter to PerlIO_importFILE;
2459 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2464 #endif /* !DOSISH */
2466 /* this is called in parent before the fork() */
2468 Perl_atfork_lock(void)
2471 #if defined(USE_ITHREADS)
2472 /* locks must be held in locking order (if any) */
2474 MUTEX_LOCK(&PL_malloc_mutex);
2480 /* this is called in both parent and child after the fork() */
2482 Perl_atfork_unlock(void)
2485 #if defined(USE_ITHREADS)
2486 /* locks must be released in same order as in atfork_lock() */
2488 MUTEX_UNLOCK(&PL_malloc_mutex);
2497 #if defined(HAS_FORK)
2499 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2504 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2505 * handlers elsewhere in the code */
2510 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2511 Perl_croak_nocontext("fork() not available");
2513 #endif /* HAS_FORK */
2518 Perl_dump_fds(pTHX_ char *s)
2523 PerlIO_printf(Perl_debug_log,"%s", s);
2524 for (fd = 0; fd < 32; fd++) {
2525 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2526 PerlIO_printf(Perl_debug_log," %d",fd);
2528 PerlIO_printf(Perl_debug_log,"\n");
2531 #endif /* DUMP_FDS */
2535 dup2(int oldfd, int newfd)
2537 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2540 PerlLIO_close(newfd);
2541 return fcntl(oldfd, F_DUPFD, newfd);
2543 #define DUP2_MAX_FDS 256
2544 int fdtmp[DUP2_MAX_FDS];
2550 PerlLIO_close(newfd);
2551 /* good enough for low fd's... */
2552 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2553 if (fdx >= DUP2_MAX_FDS) {
2561 PerlLIO_close(fdtmp[--fdx]);
2568 #ifdef HAS_SIGACTION
2570 #ifdef MACOS_TRADITIONAL
2571 /* We don't want restart behavior on MacOS */
2576 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2579 struct sigaction act, oact;
2582 /* only "parent" interpreter can diddle signals */
2583 if (PL_curinterp != aTHX)
2584 return (Sighandler_t) SIG_ERR;
2587 act.sa_handler = (void(*)(int))handler;
2588 sigemptyset(&act.sa_mask);
2591 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2592 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2594 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2595 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2596 act.sa_flags |= SA_NOCLDWAIT;
2598 if (sigaction(signo, &act, &oact) == -1)
2599 return (Sighandler_t) SIG_ERR;
2601 return (Sighandler_t) oact.sa_handler;
2605 Perl_rsignal_state(pTHX_ int signo)
2607 struct sigaction oact;
2608 PERL_UNUSED_CONTEXT;
2610 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2611 return (Sighandler_t) SIG_ERR;
2613 return (Sighandler_t) oact.sa_handler;
2617 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2620 struct sigaction act;
2623 /* only "parent" interpreter can diddle signals */
2624 if (PL_curinterp != aTHX)
2628 act.sa_handler = (void(*)(int))handler;
2629 sigemptyset(&act.sa_mask);
2632 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2633 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2635 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2636 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2637 act.sa_flags |= SA_NOCLDWAIT;
2639 return sigaction(signo, &act, save);
2643 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2647 /* only "parent" interpreter can diddle signals */
2648 if (PL_curinterp != aTHX)
2652 return sigaction(signo, save, (struct sigaction *)NULL);
2655 #else /* !HAS_SIGACTION */
2658 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2660 #if defined(USE_ITHREADS) && !defined(WIN32)
2661 /* only "parent" interpreter can diddle signals */
2662 if (PL_curinterp != aTHX)
2663 return (Sighandler_t) SIG_ERR;
2666 return PerlProc_signal(signo, handler);
2677 Perl_rsignal_state(pTHX_ int signo)
2680 Sighandler_t oldsig;
2682 #if defined(USE_ITHREADS) && !defined(WIN32)
2683 /* only "parent" interpreter can diddle signals */
2684 if (PL_curinterp != aTHX)
2685 return (Sighandler_t) SIG_ERR;
2689 oldsig = PerlProc_signal(signo, sig_trap);
2690 PerlProc_signal(signo, oldsig);
2692 PerlProc_kill(PerlProc_getpid(), signo);
2697 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2699 #if defined(USE_ITHREADS) && !defined(WIN32)
2700 /* only "parent" interpreter can diddle signals */
2701 if (PL_curinterp != aTHX)
2704 *save = PerlProc_signal(signo, handler);
2705 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2709 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2711 #if defined(USE_ITHREADS) && !defined(WIN32)
2712 /* only "parent" interpreter can diddle signals */
2713 if (PL_curinterp != aTHX)
2716 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2719 #endif /* !HAS_SIGACTION */
2720 #endif /* !PERL_MICRO */
2722 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2723 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2725 Perl_my_pclose(pTHX_ PerlIO *ptr)
2728 Sigsave_t hstat, istat, qstat;
2734 int saved_errno = 0;
2736 int saved_win32_errno;
2740 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2742 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2744 *svp = &PL_sv_undef;
2746 if (pid == -1) { /* Opened by popen. */
2747 return my_syspclose(ptr);
2750 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2751 saved_errno = errno;
2753 saved_win32_errno = GetLastError();
2757 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2760 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2761 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2762 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2765 pid2 = wait4pid(pid, &status, 0);
2766 } while (pid2 == -1 && errno == EINTR);
2768 rsignal_restore(SIGHUP, &hstat);
2769 rsignal_restore(SIGINT, &istat);
2770 rsignal_restore(SIGQUIT, &qstat);
2773 SETERRNO(saved_errno, 0);
2776 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2778 #endif /* !DOSISH */
2780 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2782 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2788 #ifdef PERL_USES_PL_PIDSTATUS
2791 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2792 pid, rather than a string form. */
2793 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2794 if (svp && *svp != &PL_sv_undef) {
2795 *statusp = SvIVX(*svp);
2796 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2804 hv_iterinit(PL_pidstatus);
2805 if ((entry = hv_iternext(PL_pidstatus))) {
2806 SV * const sv = hv_iterval(PL_pidstatus,entry);
2808 const char * const spid = hv_iterkey(entry,&len);
2810 assert (len == sizeof(Pid_t));
2811 memcpy((char *)&pid, spid, len);
2812 *statusp = SvIVX(sv);
2813 /* The hash iterator is currently on this entry, so simply
2814 calling hv_delete would trigger the lazy delete, which on
2815 aggregate does more work, beacuse next call to hv_iterinit()
2816 would spot the flag, and have to call the delete routine,
2817 while in the meantime any new entries can't re-use that
2819 hv_iterinit(PL_pidstatus);
2820 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2827 # ifdef HAS_WAITPID_RUNTIME
2828 if (!HAS_WAITPID_RUNTIME)
2831 result = PerlProc_waitpid(pid,statusp,flags);
2834 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2835 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2838 #ifdef PERL_USES_PL_PIDSTATUS
2839 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2844 Perl_croak(aTHX_ "Can't do waitpid with flags");
2846 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2847 pidgone(result,*statusp);
2853 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2856 if (result < 0 && errno == EINTR) {
2861 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2863 #ifdef PERL_USES_PL_PIDSTATUS
2865 Perl_pidgone(pTHX_ Pid_t pid, int status)
2869 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2870 SvUPGRADE(sv,SVt_IV);
2871 SvIV_set(sv, status);
2876 #if defined(atarist) || defined(OS2) || defined(EPOC)
2879 int /* Cannot prototype with I32
2881 my_syspclose(PerlIO *ptr)
2884 Perl_my_pclose(pTHX_ PerlIO *ptr)
2887 /* Needs work for PerlIO ! */
2888 FILE * const f = PerlIO_findFILE(ptr);
2889 const I32 result = pclose(f);
2890 PerlIO_releaseFILE(ptr,f);
2898 Perl_my_pclose(pTHX_ PerlIO *ptr)
2900 /* Needs work for PerlIO ! */
2901 FILE * const f = PerlIO_findFILE(ptr);
2902 I32 result = djgpp_pclose(f);
2903 result = (result << 8) & 0xff00;
2904 PerlIO_releaseFILE(ptr,f);
2910 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2913 register const char * const frombase = from;
2914 PERL_UNUSED_CONTEXT;
2917 register const char c = *from;
2922 while (count-- > 0) {
2923 for (todo = len; todo > 0; todo--) {
2932 Perl_same_dirent(pTHX_ const char *a, const char *b)
2934 char *fa = strrchr(a,'/');
2935 char *fb = strrchr(b,'/');
2938 SV * const tmpsv = sv_newmortal();
2951 sv_setpvn(tmpsv, ".", 1);
2953 sv_setpvn(tmpsv, a, fa - a);
2954 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2957 sv_setpvn(tmpsv, ".", 1);
2959 sv_setpvn(tmpsv, b, fb - b);
2960 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2962 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2963 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2965 #endif /* !HAS_RENAME */
2968 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2969 const char *const *const search_ext, I32 flags)
2972 const char *xfound = NULL;
2973 char *xfailed = NULL;
2974 char tmpbuf[MAXPATHLEN];
2978 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2979 # define SEARCH_EXTS ".bat", ".cmd", NULL
2980 # define MAX_EXT_LEN 4
2983 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2984 # define MAX_EXT_LEN 4
2987 # define SEARCH_EXTS ".pl", ".com", NULL
2988 # define MAX_EXT_LEN 4
2990 /* additional extensions to try in each dir if scriptname not found */
2992 static const char *const exts[] = { SEARCH_EXTS };
2993 const char *const *const ext = search_ext ? search_ext : exts;
2994 int extidx = 0, i = 0;
2995 const char *curext = NULL;
2997 PERL_UNUSED_ARG(search_ext);
2998 # define MAX_EXT_LEN 0
3002 * If dosearch is true and if scriptname does not contain path
3003 * delimiters, search the PATH for scriptname.
3005 * If SEARCH_EXTS is also defined, will look for each
3006 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3007 * while searching the PATH.
3009 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3010 * proceeds as follows:
3011 * If DOSISH or VMSISH:
3012 * + look for ./scriptname{,.foo,.bar}
3013 * + search the PATH for scriptname{,.foo,.bar}
3016 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3017 * this will not look in '.' if it's not in the PATH)
3022 # ifdef ALWAYS_DEFTYPES
3023 len = strlen(scriptname);
3024 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3025 int idx = 0, deftypes = 1;
3028 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3031 int idx = 0, deftypes = 1;
3034 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3036 /* The first time through, just add SEARCH_EXTS to whatever we
3037 * already have, so we can check for default file types. */
3039 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3045 if ((strlen(tmpbuf) + strlen(scriptname)
3046 + MAX_EXT_LEN) >= sizeof tmpbuf)
3047 continue; /* don't search dir with too-long name */
3048 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3052 if (strEQ(scriptname, "-"))
3054 if (dosearch) { /* Look in '.' first. */
3055 const char *cur = scriptname;
3057 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3059 if (strEQ(ext[i++],curext)) {
3060 extidx = -1; /* already has an ext */
3065 DEBUG_p(PerlIO_printf(Perl_debug_log,
3066 "Looking for %s\n",cur));
3067 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3068 && !S_ISDIR(PL_statbuf.st_mode)) {
3076 if (cur == scriptname) {
3077 len = strlen(scriptname);
3078 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3080 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3083 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3084 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3089 #ifdef MACOS_TRADITIONAL
3090 if (dosearch && !strchr(scriptname, ':') &&
3091 (s = PerlEnv_getenv("Commands")))
3093 if (dosearch && !strchr(scriptname, '/')
3095 && !strchr(scriptname, '\\')
3097 && (s = PerlEnv_getenv("PATH")))
3102 PL_bufend = s + strlen(s);
3103 while (s < PL_bufend) {
3104 #ifdef MACOS_TRADITIONAL
3105 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3109 #if defined(atarist) || defined(DOSISH)
3114 && *s != ';'; len++, s++) {
3115 if (len < sizeof tmpbuf)
3118 if (len < sizeof tmpbuf)
3120 #else /* ! (atarist || DOSISH) */
3121 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3124 #endif /* ! (atarist || DOSISH) */
3125 #endif /* MACOS_TRADITIONAL */
3128 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3129 continue; /* don't search dir with too-long name */
3130 #ifdef MACOS_TRADITIONAL
3131 if (len && tmpbuf[len - 1] != ':')
3132 tmpbuf[len++] = ':';
3135 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3136 && tmpbuf[len - 1] != '/'
3137 && tmpbuf[len - 1] != '\\'
3140 tmpbuf[len++] = '/';
3141 if (len == 2 && tmpbuf[0] == '.')
3144 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3148 len = strlen(tmpbuf);
3149 if (extidx > 0) /* reset after previous loop */
3153 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3154 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3155 if (S_ISDIR(PL_statbuf.st_mode)) {
3159 } while ( retval < 0 /* not there */
3160 && extidx>=0 && ext[extidx] /* try an extension? */
3161 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3166 if (S_ISREG(PL_statbuf.st_mode)
3167 && cando(S_IRUSR,TRUE,&PL_statbuf)
3168 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3169 && cando(S_IXUSR,TRUE,&PL_statbuf)
3173 xfound = tmpbuf; /* bingo! */
3177 xfailed = savepv(tmpbuf);
3180 if (!xfound && !seen_dot && !xfailed &&
3181 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3182 || S_ISDIR(PL_statbuf.st_mode)))
3184 seen_dot = 1; /* Disable message. */
3186 if (flags & 1) { /* do or die? */
3187 Perl_croak(aTHX_ "Can't %s %s%s%s",
3188 (xfailed ? "execute" : "find"),
3189 (xfailed ? xfailed : scriptname),
3190 (xfailed ? "" : " on PATH"),
3191 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3196 scriptname = xfound;
3198 return (scriptname ? savepv(scriptname) : NULL);
3201 #ifndef PERL_GET_CONTEXT_DEFINED
3204 Perl_get_context(void)
3207 #if defined(USE_ITHREADS)
3208 # ifdef OLD_PTHREADS_API
3210 if (pthread_getspecific(PL_thr_key, &t))
3211 Perl_croak_nocontext("panic: pthread_getspecific");
3214 # ifdef I_MACH_CTHREADS
3215 return (void*)cthread_data(cthread_self());
3217 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3226 Perl_set_context(void *t)
3229 #if defined(USE_ITHREADS)
3230 # ifdef I_MACH_CTHREADS
3231 cthread_set_data(cthread_self(), t);
3233 if (pthread_setspecific(PL_thr_key, t))
3234 Perl_croak_nocontext("panic: pthread_setspecific");
3241 #endif /* !PERL_GET_CONTEXT_DEFINED */
3243 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3252 Perl_get_op_names(pTHX)
3254 PERL_UNUSED_CONTEXT;
3255 return (char **)PL_op_name;
3259 Perl_get_op_descs(pTHX)
3261 PERL_UNUSED_CONTEXT;
3262 return (char **)PL_op_desc;
3266 Perl_get_no_modify(pTHX)
3268 PERL_UNUSED_CONTEXT;
3269 return PL_no_modify;
3273 Perl_get_opargs(pTHX)
3275 PERL_UNUSED_CONTEXT;
3276 return (U32 *)PL_opargs;
3280 Perl_get_ppaddr(pTHX)
3283 PERL_UNUSED_CONTEXT;
3284 return (PPADDR_t*)PL_ppaddr;
3287 #ifndef HAS_GETENV_LEN
3289 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3291 char * const env_trans = PerlEnv_getenv(env_elem);
3292 PERL_UNUSED_CONTEXT;
3294 *len = strlen(env_trans);
3301 Perl_get_vtbl(pTHX_ int vtbl_id)
3303 const MGVTBL* result;
3304 PERL_UNUSED_CONTEXT;
3308 result = &PL_vtbl_sv;
3311 result = &PL_vtbl_env;
3313 case want_vtbl_envelem:
3314 result = &PL_vtbl_envelem;
3317 result = &PL_vtbl_sig;
3319 case want_vtbl_sigelem:
3320 result = &PL_vtbl_sigelem;
3322 case want_vtbl_pack:
3323 result = &PL_vtbl_pack;
3325 case want_vtbl_packelem:
3326 result = &PL_vtbl_packelem;
3328 case want_vtbl_dbline:
3329 result = &PL_vtbl_dbline;
3332 result = &PL_vtbl_isa;
3334 case want_vtbl_isaelem:
3335 result = &PL_vtbl_isaelem;
3337 case want_vtbl_arylen:
3338 result = &PL_vtbl_arylen;
3340 case want_vtbl_mglob:
3341 result = &PL_vtbl_mglob;
3343 case want_vtbl_nkeys:
3344 result = &PL_vtbl_nkeys;
3346 case want_vtbl_taint:
3347 result = &PL_vtbl_taint;
3349 case want_vtbl_substr:
3350 result = &PL_vtbl_substr;
3353 result = &PL_vtbl_vec;
3356 result = &PL_vtbl_pos;
3359 result = &PL_vtbl_bm;
3362 result = &PL_vtbl_fm;
3364 case want_vtbl_uvar:
3365 result = &PL_vtbl_uvar;
3367 case want_vtbl_defelem:
3368 result = &PL_vtbl_defelem;
3370 case want_vtbl_regexp:
3371 result = &PL_vtbl_regexp;
3373 case want_vtbl_regdata:
3374 result = &PL_vtbl_regdata;
3376 case want_vtbl_regdatum:
3377 result = &PL_vtbl_regdatum;
3379 #ifdef USE_LOCALE_COLLATE
3380 case want_vtbl_collxfrm:
3381 result = &PL_vtbl_collxfrm;
3384 case want_vtbl_amagic:
3385 result = &PL_vtbl_amagic;
3387 case want_vtbl_amagicelem:
3388 result = &PL_vtbl_amagicelem;
3390 case want_vtbl_backref:
3391 result = &PL_vtbl_backref;
3393 case want_vtbl_utf8:
3394 result = &PL_vtbl_utf8;
3400 return (MGVTBL*)result;
3404 Perl_my_fflush_all(pTHX)
3406 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3407 return PerlIO_flush(NULL);
3409 # if defined(HAS__FWALK)
3410 extern int fflush(FILE *);
3411 /* undocumented, unprototyped, but very useful BSDism */
3412 extern void _fwalk(int (*)(FILE *));
3416 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3418 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3419 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3421 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3422 open_max = sysconf(_SC_OPEN_MAX);
3425 open_max = FOPEN_MAX;
3428 open_max = OPEN_MAX;
3439 for (i = 0; i < open_max; i++)
3440 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3441 STDIO_STREAM_ARRAY[i]._file < open_max &&
3442 STDIO_STREAM_ARRAY[i]._flag)
3443 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3447 SETERRNO(EBADF,RMS_IFI);
3454 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3456 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3458 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3459 if (ckWARN(WARN_IO)) {
3460 const char * const direction =
3461 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3463 Perl_warner(aTHX_ packWARN(WARN_IO),
3464 "Filehandle %s opened only for %sput",
3467 Perl_warner(aTHX_ packWARN(WARN_IO),
3468 "Filehandle opened only for %sput", direction);
3475 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3477 warn_type = WARN_CLOSED;
3481 warn_type = WARN_UNOPENED;
3484 if (ckWARN(warn_type)) {
3485 const char * const pars =
3486 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3487 const char * const func =
3489 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3490 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3491 op < 0 ? "" : /* handle phoney cases */
3493 const char * const type =
3495 (OP_IS_SOCKET(op) ||
3496 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3497 "socket" : "filehandle");
3498 if (name && *name) {
3499 Perl_warner(aTHX_ packWARN(warn_type),
3500 "%s%s on %s %s %s", func, pars, vile, type, name);
3501 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3503 aTHX_ packWARN(warn_type),
3504 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3509 Perl_warner(aTHX_ packWARN(warn_type),
3510 "%s%s on %s %s", func, pars, vile, type);
3511 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3513 aTHX_ packWARN(warn_type),
3514 "\t(Are you trying to call %s%s on dirhandle?)\n",
3523 /* in ASCII order, not that it matters */
3524 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3527 Perl_ebcdic_control(pTHX_ int ch)
3535 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3536 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3539 if (ctlp == controllablechars)
3540 return('\177'); /* DEL */
3542 return((unsigned char)(ctlp - controllablechars - 1));
3543 } else { /* Want uncontrol */
3544 if (ch == '\177' || ch == -1)
3546 else if (ch == '\157')
3548 else if (ch == '\174')
3550 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3552 else if (ch == '\155')
3554 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3555 return(controllablechars[ch+1]);
3557 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3562 /* To workaround core dumps from the uninitialised tm_zone we get the
3563 * system to give us a reasonable struct to copy. This fix means that
3564 * strftime uses the tm_zone and tm_gmtoff values returned by
3565 * localtime(time()). That should give the desired result most of the
3566 * time. But probably not always!
3568 * This does not address tzname aspects of NETaa14816.
3573 # ifndef STRUCT_TM_HASZONE
3574 # define STRUCT_TM_HASZONE
3578 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3579 # ifndef HAS_TM_TM_ZONE
3580 # define HAS_TM_TM_ZONE
3585 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3587 #ifdef HAS_TM_TM_ZONE
3589 const struct tm* my_tm;
3591 my_tm = localtime(&now);
3593 Copy(my_tm, ptm, 1, struct tm);
3595 PERL_UNUSED_ARG(ptm);
3600 * mini_mktime - normalise struct tm values without the localtime()
3601 * semantics (and overhead) of mktime().
3604 Perl_mini_mktime(pTHX_ struct tm *ptm)
3608 int month, mday, year, jday;
3609 int odd_cent, odd_year;
3610 PERL_UNUSED_CONTEXT;
3612 #define DAYS_PER_YEAR 365
3613 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3614 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3615 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3616 #define SECS_PER_HOUR (60*60)
3617 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3618 /* parentheses deliberately absent on these two, otherwise they don't work */
3619 #define MONTH_TO_DAYS 153/5
3620 #define DAYS_TO_MONTH 5/153
3621 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3622 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3623 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3624 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3627 * Year/day algorithm notes:
3629 * With a suitable offset for numeric value of the month, one can find
3630 * an offset into the year by considering months to have 30.6 (153/5) days,
3631 * using integer arithmetic (i.e., with truncation). To avoid too much
3632 * messing about with leap days, we consider January and February to be
3633 * the 13th and 14th month of the previous year. After that transformation,
3634 * we need the month index we use to be high by 1 from 'normal human' usage,
3635 * so the month index values we use run from 4 through 15.
3637 * Given that, and the rules for the Gregorian calendar (leap years are those
3638 * divisible by 4 unless also divisible by 100, when they must be divisible
3639 * by 400 instead), we can simply calculate the number of days since some
3640 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3641 * the days we derive from our month index, and adding in the day of the
3642 * month. The value used here is not adjusted for the actual origin which
3643 * it normally would use (1 January A.D. 1), since we're not exposing it.
3644 * We're only building the value so we can turn around and get the
3645 * normalised values for the year, month, day-of-month, and day-of-year.
3647 * For going backward, we need to bias the value we're using so that we find
3648 * the right year value. (Basically, we don't want the contribution of
3649 * March 1st to the number to apply while deriving the year). Having done
3650 * that, we 'count up' the contribution to the year number by accounting for
3651 * full quadracenturies (400-year periods) with their extra leap days, plus
3652 * the contribution from full centuries (to avoid counting in the lost leap
3653 * days), plus the contribution from full quad-years (to count in the normal
3654 * leap days), plus the leftover contribution from any non-leap years.
3655 * At this point, if we were working with an actual leap day, we'll have 0
3656 * days left over. This is also true for March 1st, however. So, we have
3657 * to special-case that result, and (earlier) keep track of the 'odd'
3658 * century and year contributions. If we got 4 extra centuries in a qcent,
3659 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3660 * Otherwise, we add back in the earlier bias we removed (the 123 from
3661 * figuring in March 1st), find the month index (integer division by 30.6),
3662 * and the remainder is the day-of-month. We then have to convert back to
3663 * 'real' months (including fixing January and February from being 14/15 in
3664 * the previous year to being in the proper year). After that, to get
3665 * tm_yday, we work with the normalised year and get a new yearday value for
3666 * January 1st, which we subtract from the yearday value we had earlier,
3667 * representing the date we've re-built. This is done from January 1
3668 * because tm_yday is 0-origin.
3670 * Since POSIX time routines are only guaranteed to work for times since the
3671 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3672 * applies Gregorian calendar rules even to dates before the 16th century
3673 * doesn't bother me. Besides, you'd need cultural context for a given
3674 * date to know whether it was Julian or Gregorian calendar, and that's
3675 * outside the scope for this routine. Since we convert back based on the
3676 * same rules we used to build the yearday, you'll only get strange results
3677 * for input which needed normalising, or for the 'odd' century years which
3678 * were leap years in the Julian calander but not in the Gregorian one.
3679 * I can live with that.
3681 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3682 * that's still outside the scope for POSIX time manipulation, so I don't
3686 year = 1900 + ptm->tm_year;
3687 month = ptm->tm_mon;
3688 mday = ptm->tm_mday;
3689 /* allow given yday with no month & mday to dominate the result */
3690 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3693 jday = 1 + ptm->tm_yday;
3702 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3703 yearday += month*MONTH_TO_DAYS + mday + jday;
3705 * Note that we don't know when leap-seconds were or will be,
3706 * so we have to trust the user if we get something which looks
3707 * like a sensible leap-second. Wild values for seconds will
3708 * be rationalised, however.
3710 if ((unsigned) ptm->tm_sec <= 60) {
3717 secs += 60 * ptm->tm_min;
3718 secs += SECS_PER_HOUR * ptm->tm_hour;
3720 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3721 /* got negative remainder, but need positive time */
3722 /* back off an extra day to compensate */
3723 yearday += (secs/SECS_PER_DAY)-1;
3724 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3727 yearday += (secs/SECS_PER_DAY);
3728 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3731 else if (secs >= SECS_PER_DAY) {
3732 yearday += (secs/SECS_PER_DAY);
3733 secs %= SECS_PER_DAY;
3735 ptm->tm_hour = secs/SECS_PER_HOUR;
3736 secs %= SECS_PER_HOUR;
3737 ptm->tm_min = secs/60;
3739 ptm->tm_sec += secs;
3740 /* done with time of day effects */
3742 * The algorithm for yearday has (so far) left it high by 428.
3743 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3744 * bias it by 123 while trying to figure out what year it
3745 * really represents. Even with this tweak, the reverse
3746 * translation fails for years before A.D. 0001.
3747 * It would still fail for Feb 29, but we catch that one below.
3749 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3750 yearday -= YEAR_ADJUST;
3751 year = (yearday / DAYS_PER_QCENT) * 400;
3752 yearday %= DAYS_PER_QCENT;
3753 odd_cent = yearday / DAYS_PER_CENT;
3754 year += odd_cent * 100;
3755 yearday %= DAYS_PER_CENT;
3756 year += (yearday / DAYS_PER_QYEAR) * 4;
3757 yearday %= DAYS_PER_QYEAR;
3758 odd_year = yearday / DAYS_PER_YEAR;
3760 yearday %= DAYS_PER_YEAR;
3761 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3766 yearday += YEAR_ADJUST; /* recover March 1st crock */
3767 month = yearday*DAYS_TO_MONTH;
3768 yearday -= month*MONTH_TO_DAYS;
3769 /* recover other leap-year adjustment */
3778 ptm->tm_year = year - 1900;
3780 ptm->tm_mday = yearday;
3781 ptm->tm_mon = month;
3785 ptm->tm_mon = month - 1;
3787 /* re-build yearday based on Jan 1 to get tm_yday */
3789 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3790 yearday += 14*MONTH_TO_DAYS + 1;
3791 ptm->tm_yday = jday - yearday;
3792 /* fix tm_wday if not overridden by caller */
3793 if ((unsigned)ptm->tm_wday > 6)
3794 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3798 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)
3806 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3809 mytm.tm_hour = hour;
3810 mytm.tm_mday = mday;
3812 mytm.tm_year = year;
3813 mytm.tm_wday = wday;
3814 mytm.tm_yday = yday;
3815 mytm.tm_isdst = isdst;
3817 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3818 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3823 #ifdef HAS_TM_TM_GMTOFF
3824 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3826 #ifdef HAS_TM_TM_ZONE
3827 mytm.tm_zone = mytm2.tm_zone;
3832 Newx(buf, buflen, char);
3833 len = strftime(buf, buflen, fmt, &mytm);
3835 ** The following is needed to handle to the situation where
3836 ** tmpbuf overflows. Basically we want to allocate a buffer
3837 ** and try repeatedly. The reason why it is so complicated
3838 ** is that getting a return value of 0 from strftime can indicate
3839 ** one of the following:
3840 ** 1. buffer overflowed,
3841 ** 2. illegal conversion specifier, or
3842 ** 3. the format string specifies nothing to be returned(not
3843 ** an error). This could be because format is an empty string
3844 ** or it specifies %p that yields an empty string in some locale.
3845 ** If there is a better way to make it portable, go ahead by
3848 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3851 /* Possibly buf overflowed - try again with a bigger buf */
3852 const int fmtlen = strlen(fmt);
3853 int bufsize = fmtlen + buflen;
3855 Newx(buf, bufsize, char);
3857 buflen = strftime(buf, bufsize, fmt, &mytm);
3858 if (buflen > 0 && buflen < bufsize)
3860 /* heuristic to prevent out-of-memory errors */
3861 if (bufsize > 100*fmtlen) {
3867 Renew(buf, bufsize, char);
3872 Perl_croak(aTHX_ "panic: no strftime");
3878 #define SV_CWD_RETURN_UNDEF \
3879 sv_setsv(sv, &PL_sv_undef); \
3882 #define SV_CWD_ISDOT(dp) \
3883 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3884 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3887 =head1 Miscellaneous Functions
3889 =for apidoc getcwd_sv
3891 Fill the sv with current working directory
3896 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3897 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3898 * getcwd(3) if available
3899 * Comments from the orignal:
3900 * This is a faster version of getcwd. It's also more dangerous
3901 * because you might chdir out of a directory that you can't chdir
3905 Perl_getcwd_sv(pTHX_ register SV *sv)
3909 #ifndef INCOMPLETE_TAINTS
3915 char buf[MAXPATHLEN];
3917 /* Some getcwd()s automatically allocate a buffer of the given
3918 * size from the heap if they are given a NULL buffer pointer.
3919 * The problem is that this behaviour is not portable. */
3920 if (getcwd(buf, sizeof(buf) - 1)) {
3925 sv_setsv(sv, &PL_sv_undef);
3933 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3937 SvUPGRADE(sv, SVt_PV);
3939 if (PerlLIO_lstat(".", &statbuf) < 0) {
3940 SV_CWD_RETURN_UNDEF;
3943 orig_cdev = statbuf.st_dev;
3944 orig_cino = statbuf.st_ino;
3953 if (PerlDir_chdir("..") < 0) {
3954 SV_CWD_RETURN_UNDEF;
3956 if (PerlLIO_stat(".", &statbuf) < 0) {
3957 SV_CWD_RETURN_UNDEF;
3960 cdev = statbuf.st_dev;
3961 cino = statbuf.st_ino;
3963 if (odev == cdev && oino == cino) {
3966 if (!(dir = PerlDir_open("."))) {
3967 SV_CWD_RETURN_UNDEF;
3970 while ((dp = PerlDir_read(dir)) != NULL) {
3972 const int namelen = dp->d_namlen;
3974 const int namelen = strlen(dp->d_name);
3977 if (SV_CWD_ISDOT(dp)) {
3981 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3982 SV_CWD_RETURN_UNDEF;
3985 tdev = statbuf.st_dev;
3986 tino = statbuf.st_ino;
3987 if (tino == oino && tdev == odev) {
3993 SV_CWD_RETURN_UNDEF;
3996 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3997 SV_CWD_RETURN_UNDEF;
4000 SvGROW(sv, pathlen + namelen + 1);
4004 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4007 /* prepend current directory to the front */
4009 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4010 pathlen += (namelen + 1);
4012 #ifdef VOID_CLOSEDIR
4015 if (PerlDir_close(dir) < 0) {
4016 SV_CWD_RETURN_UNDEF;
4022 SvCUR_set(sv, pathlen);
4026 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4027 SV_CWD_RETURN_UNDEF;
4030 if (PerlLIO_stat(".", &statbuf) < 0) {
4031 SV_CWD_RETURN_UNDEF;
4034 cdev = statbuf.st_dev;
4035 cino = statbuf.st_ino;
4037 if (cdev != orig_cdev || cino != orig_cino) {
4038 Perl_croak(aTHX_ "Unstable directory path, "
4039 "current directory changed unexpectedly");
4051 =for apidoc scan_version
4053 Returns a pointer to the next character after the parsed
4054 version string, as well as upgrading the passed in SV to
4057 Function must be called with an already existing SV like
4060 s = scan_version(s,SV *sv, bool qv);
4062 Performs some preprocessing to the string to ensure that
4063 it has the correct characteristics of a version. Flags the
4064 object if it contains an underscore (which denotes this
4065 is a alpha version). The boolean qv denotes that the version
4066 should be interpreted as if it had multiple decimals, even if
4073 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4081 AV * const av = newAV();
4082 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4083 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4085 #ifndef NODEFAULT_SHAREKEYS
4086 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4089 while (isSPACE(*s)) /* leading whitespace is OK */
4093 s++; /* get past 'v' */
4094 qv = 1; /* force quoted version processing */
4097 start = last = pos = s;
4099 /* pre-scan the input string to check for decimals/underbars */
4100 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4105 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4109 else if ( *pos == '_' )
4112 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4114 width = pos - last - 1; /* natural width of sub-version */
4119 if ( alpha && !saw_period )
4120 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4122 if ( saw_period > 1 )
4123 qv = 1; /* force quoted version processing */
4128 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4130 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4131 if ( !qv && width < 3 )
4132 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4134 while (isDIGIT(*pos))
4136 if (!isALPHA(*pos)) {
4142 /* this is atoi() that delimits on underscores */
4143 const char *end = pos;
4147 /* the following if() will only be true after the decimal
4148 * point of a version originally created with a bare
4149 * floating point number, i.e. not quoted in any way
4151 if ( !qv && s > start && saw_period == 1 ) {
4155 rev += (*s - '0') * mult;
4157 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4158 Perl_croak(aTHX_ "Integer overflow in version");
4165 while (--end >= s) {
4167 rev += (*end - '0') * mult;
4169 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4170 Perl_croak(aTHX_ "Integer overflow in version");
4175 /* Append revision */
4176 av_push(av, newSViv(rev));
4179 else if ( *pos == '_' && isDIGIT(pos[1]) )
4181 else if ( isDIGIT(*pos) )
4188 while ( isDIGIT(*pos) )
4193 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4201 if ( qv ) { /* quoted versions always get at least three terms*/
4202 I32 len = av_len(av);
4203 /* This for loop appears to trigger a compiler bug on OS X, as it
4204 loops infinitely. Yes, len is negative. No, it makes no sense.
4205 Compiler in question is:
4206 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4207 for ( len = 2 - len; len > 0; len-- )
4208 av_push((AV *)sv, newSViv(0));
4212 av_push(av, newSViv(0));
4215 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4216 av_push(av, newSViv(0));
4218 /* fix RT#19517 - special case 'undef' as string */
4219 if ( *s == 'u' && strEQ(s,"undef") ) {
4223 /* And finally, store the AV in the hash */
4224 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4229 =for apidoc new_version
4231 Returns a new version object based on the passed in SV:
4233 SV *sv = new_version(SV *ver);
4235 Does not alter the passed in ver SV. See "upg_version" if you
4236 want to upgrade the SV.
4242 Perl_new_version(pTHX_ SV *ver)
4245 SV * const rv = newSV(0);
4246 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4249 AV * const av = newAV();
4251 /* This will get reblessed later if a derived class*/
4252 SV * const hv = newSVrv(rv, "version");
4253 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4254 #ifndef NODEFAULT_SHAREKEYS
4255 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4261 /* Begin copying all of the elements */
4262 if ( hv_exists((HV *)ver, "qv", 2) )
4263 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4265 if ( hv_exists((HV *)ver, "alpha", 5) )
4266 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4268 if ( hv_exists((HV*)ver, "width", 5 ) )
4270 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4271 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4274 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4275 /* This will get reblessed later if a derived class*/
4276 for ( key = 0; key <= av_len(sav); key++ )
4278 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4279 av_push(av, newSViv(rev));
4282 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4287 const MAGIC* const mg = SvVSTRING_mg(ver);
4288 if ( mg ) { /* already a v-string */
4289 const STRLEN len = mg->mg_len;
4290 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4291 sv_setpvn(rv,version,len);
4296 sv_setsv(rv,ver); /* make a duplicate */
4301 return upg_version(rv);
4305 =for apidoc upg_version
4307 In-place upgrade of the supplied SV to a version object.
4309 SV *sv = upg_version(SV *sv);
4311 Returns a pointer to the upgraded SV.
4317 Perl_upg_version(pTHX_ SV *ver)
4319 const char *version, *s;
4325 if ( SvNOK(ver) ) /* may get too much accuracy */
4328 #ifdef USE_LOCALE_NUMERIC
4329 char *loc = setlocale(LC_NUMERIC, "C");
4331 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4332 #ifdef USE_LOCALE_NUMERIC
4333 setlocale(LC_NUMERIC, loc);
4335 while (tbuf[len-1] == '0' && len > 0) len--;
4336 version = savepvn(tbuf, len);
4339 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4340 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4344 else /* must be a string or something like a string */
4346 version = savepv(SvPV_nolen(ver));
4349 s = scan_version(version, ver, qv);
4351 if(ckWARN(WARN_MISC))
4352 Perl_warner(aTHX_ packWARN(WARN_MISC),
4353 "Version string '%s' contains invalid data; "
4354 "ignoring: '%s'", version, s);
4362 Validates that the SV contains a valid version object.
4364 bool vverify(SV *vobj);
4366 Note that it only confirms the bare minimum structure (so as not to get
4367 confused by derived classes which may contain additional hash entries):
4371 =item * The SV contains a [reference to a] hash
4373 =item * The hash contains a "version" key
4375 =item * The "version" key has [a reference to] an AV as its value
4383 Perl_vverify(pTHX_ SV *vs)
4389 /* see if the appropriate elements exist */
4390 if ( SvTYPE(vs) == SVt_PVHV
4391 && hv_exists((HV*)vs, "version", 7)
4392 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4393 && SvTYPE(sv) == SVt_PVAV )
4402 Accepts a version object and returns the normalized floating
4403 point representation. Call like:
4407 NOTE: you can pass either the object directly or the SV
4408 contained within the RV.
4414 Perl_vnumify(pTHX_ SV *vs)
4419 SV * const sv = newSV(0);
4425 Perl_croak(aTHX_ "Invalid version object");
4427 /* see if various flags exist */
4428 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4430 if ( hv_exists((HV*)vs, "width", 5 ) )
4431 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4436 /* attempt to retrieve the version array */
4437 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4449 digit = SvIV(*av_fetch(av, 0, 0));
4450 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4451 for ( i = 1 ; i < len ; i++ )
4453 digit = SvIV(*av_fetch(av, i, 0));
4455 const int denom = (width == 2 ? 10 : 100);
4456 const div_t term = div((int)PERL_ABS(digit),denom);
4457 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4460 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4466 digit = SvIV(*av_fetch(av, len, 0));
4467 if ( alpha && width == 3 ) /* alpha version */
4469 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4473 sv_catpvs(sv, "000");
4481 Accepts a version object and returns the normalized string
4482 representation. Call like:
4486 NOTE: you can pass either the object directly or the SV
4487 contained within the RV.
4493 Perl_vnormal(pTHX_ SV *vs)
4497 SV * const sv = newSV(0);
4503 Perl_croak(aTHX_ "Invalid version object");
4505 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4507 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4515 digit = SvIV(*av_fetch(av, 0, 0));
4516 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4517 for ( i = 1 ; i < len ; i++ ) {
4518 digit = SvIV(*av_fetch(av, i, 0));
4519 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4524 /* handle last digit specially */
4525 digit = SvIV(*av_fetch(av, len, 0));
4527 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4529 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4532 if ( len <= 2 ) { /* short version, must be at least three */
4533 for ( len = 2 - len; len != 0; len-- )
4540 =for apidoc vstringify
4542 In order to maintain maximum compatibility with earlier versions
4543 of Perl, this function will return either the floating point
4544 notation or the multiple dotted notation, depending on whether
4545 the original version contained 1 or more dots, respectively
4551 Perl_vstringify(pTHX_ SV *vs)
4557 Perl_croak(aTHX_ "Invalid version object");
4559 if ( hv_exists((HV *)vs, "qv", 2) )
4568 Version object aware cmp. Both operands must already have been
4569 converted into version objects.
4575 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4578 bool lalpha = FALSE;
4579 bool ralpha = FALSE;
4588 if ( !vverify(lhv) )
4589 Perl_croak(aTHX_ "Invalid version object");
4591 if ( !vverify(rhv) )
4592 Perl_croak(aTHX_ "Invalid version object");
4594 /* get the left hand term */
4595 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4596 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4599 /* and the right hand term */
4600 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4601 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4609 while ( i <= m && retval == 0 )
4611 left = SvIV(*av_fetch(lav,i,0));
4612 right = SvIV(*av_fetch(rav,i,0));
4620 /* tiebreaker for alpha with identical terms */
4621 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4623 if ( lalpha && !ralpha )
4627 else if ( ralpha && !lalpha)
4633 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4637 while ( i <= r && retval == 0 )
4639 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4640 retval = -1; /* not a match after all */
4646 while ( i <= l && retval == 0 )
4648 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4649 retval = +1; /* not a match after all */
4657 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4658 # define EMULATE_SOCKETPAIR_UDP
4661 #ifdef EMULATE_SOCKETPAIR_UDP
4663 S_socketpair_udp (int fd[2]) {
4665 /* Fake a datagram socketpair using UDP to localhost. */
4666 int sockets[2] = {-1, -1};
4667 struct sockaddr_in addresses[2];
4669 Sock_size_t size = sizeof(struct sockaddr_in);
4670 unsigned short port;
4673 memset(&addresses, 0, sizeof(addresses));
4676 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4677 if (sockets[i] == -1)
4678 goto tidy_up_and_fail;
4680 addresses[i].sin_family = AF_INET;
4681 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4682 addresses[i].sin_port = 0; /* kernel choses port. */
4683 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4684 sizeof(struct sockaddr_in)) == -1)
4685 goto tidy_up_and_fail;
4688 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4689 for each connect the other socket to it. */
4692 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4694 goto tidy_up_and_fail;
4695 if (size != sizeof(struct sockaddr_in))
4696 goto abort_tidy_up_and_fail;
4697 /* !1 is 0, !0 is 1 */
4698 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4699 sizeof(struct sockaddr_in)) == -1)
4700 goto tidy_up_and_fail;
4703 /* Now we have 2 sockets connected to each other. I don't trust some other
4704 process not to have already sent a packet to us (by random) so send
4705 a packet from each to the other. */
4708 /* I'm going to send my own port number. As a short.
4709 (Who knows if someone somewhere has sin_port as a bitfield and needs
4710 this routine. (I'm assuming crays have socketpair)) */
4711 port = addresses[i].sin_port;
4712 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4713 if (got != sizeof(port)) {
4715 goto tidy_up_and_fail;
4716 goto abort_tidy_up_and_fail;
4720 /* Packets sent. I don't trust them to have arrived though.
4721 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4722 connect to localhost will use a second kernel thread. In 2.6 the
4723 first thread running the connect() returns before the second completes,
4724 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4725 returns 0. Poor programs have tripped up. One poor program's authors'
4726 had a 50-1 reverse stock split. Not sure how connected these were.)
4727 So I don't trust someone not to have an unpredictable UDP stack.
4731 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4732 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4736 FD_SET((unsigned int)sockets[0], &rset);
4737 FD_SET((unsigned int)sockets[1], &rset);
4739 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4740 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4741 || !FD_ISSET(sockets[1], &rset)) {
4742 /* I hope this is portable and appropriate. */
4744 goto tidy_up_and_fail;
4745 goto abort_tidy_up_and_fail;
4749 /* And the paranoia department even now doesn't trust it to have arrive
4750 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4752 struct sockaddr_in readfrom;
4753 unsigned short buffer[2];
4758 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4759 sizeof(buffer), MSG_DONTWAIT,
4760 (struct sockaddr *) &readfrom, &size);
4762 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4764 (struct sockaddr *) &readfrom, &size);
4768 goto tidy_up_and_fail;
4769 if (got != sizeof(port)
4770 || size != sizeof(struct sockaddr_in)
4771 /* Check other socket sent us its port. */
4772 || buffer[0] != (unsigned short) addresses[!i].sin_port
4773 /* Check kernel says we got the datagram from that socket */
4774 || readfrom.sin_family != addresses[!i].sin_family
4775 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4776 || readfrom.sin_port != addresses[!i].sin_port)
4777 goto abort_tidy_up_and_fail;
4780 /* My caller (my_socketpair) has validated that this is non-NULL */
4783 /* I hereby declare this connection open. May God bless all who cross
4787 abort_tidy_up_and_fail:
4788 errno = ECONNABORTED;
4791 const int save_errno = errno;
4792 if (sockets[0] != -1)
4793 PerlLIO_close(sockets[0]);
4794 if (sockets[1] != -1)
4795 PerlLIO_close(sockets[1]);
4800 #endif /* EMULATE_SOCKETPAIR_UDP */
4802 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4804 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4805 /* Stevens says that family must be AF_LOCAL, protocol 0.
4806 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4811 struct sockaddr_in listen_addr;
4812 struct sockaddr_in connect_addr;
4817 || family != AF_UNIX
4820 errno = EAFNOSUPPORT;
4828 #ifdef EMULATE_SOCKETPAIR_UDP
4829 if (type == SOCK_DGRAM)
4830 return S_socketpair_udp(fd);
4833 listener = PerlSock_socket(AF_INET, type, 0);
4836 memset(&listen_addr, 0, sizeof(listen_addr));
4837 listen_addr.sin_family = AF_INET;
4838 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4839 listen_addr.sin_port = 0; /* kernel choses port. */
4840 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4841 sizeof(listen_addr)) == -1)
4842 goto tidy_up_and_fail;
4843 if (PerlSock_listen(listener, 1) == -1)
4844 goto tidy_up_and_fail;
4846 connector = PerlSock_socket(AF_INET, type, 0);
4847 if (connector == -1)
4848 goto tidy_up_and_fail;
4849 /* We want to find out the port number to connect to. */
4850 size = sizeof(connect_addr);
4851 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4853 goto tidy_up_and_fail;
4854 if (size != sizeof(connect_addr))
4855 goto abort_tidy_up_and_fail;
4856 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4857 sizeof(connect_addr)) == -1)
4858 goto tidy_up_and_fail;
4860 size = sizeof(listen_addr);
4861 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4864 goto tidy_up_and_fail;
4865 if (size != sizeof(listen_addr))
4866 goto abort_tidy_up_and_fail;
4867 PerlLIO_close(listener);
4868 /* Now check we are talking to ourself by matching port and host on the
4870 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4872 goto tidy_up_and_fail;
4873 if (size != sizeof(connect_addr)
4874 || listen_addr.sin_family != connect_addr.sin_family
4875 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4876 || listen_addr.sin_port != connect_addr.sin_port) {
4877 goto abort_tidy_up_and_fail;
4883 abort_tidy_up_and_fail:
4885 errno = ECONNABORTED; /* This would be the standard thing to do. */
4887 # ifdef ECONNREFUSED
4888 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4890 errno = ETIMEDOUT; /* Desperation time. */
4895 const int save_errno = errno;
4897 PerlLIO_close(listener);
4898 if (connector != -1)
4899 PerlLIO_close(connector);
4901 PerlLIO_close(acceptor);
4907 /* In any case have a stub so that there's code corresponding
4908 * to the my_socketpair in global.sym. */
4910 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4911 #ifdef HAS_SOCKETPAIR
4912 return socketpair(family, type, protocol, fd);
4921 =for apidoc sv_nosharing
4923 Dummy routine which "shares" an SV when there is no sharing module present.
4924 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4925 Exists to avoid test for a NULL function pointer and because it could
4926 potentially warn under some level of strict-ness.
4932 Perl_sv_nosharing(pTHX_ SV *sv)
4934 PERL_UNUSED_CONTEXT;
4935 PERL_UNUSED_ARG(sv);
4939 Perl_parse_unicode_opts(pTHX_ const char **popt)
4941 const char *p = *popt;
4946 opt = (U32) atoi(p);
4949 if (*p && *p != '\n' && *p != '\r')
4950 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4955 case PERL_UNICODE_STDIN:
4956 opt |= PERL_UNICODE_STDIN_FLAG; break;
4957 case PERL_UNICODE_STDOUT:
4958 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4959 case PERL_UNICODE_STDERR:
4960 opt |= PERL_UNICODE_STDERR_FLAG; break;
4961 case PERL_UNICODE_STD:
4962 opt |= PERL_UNICODE_STD_FLAG; break;
4963 case PERL_UNICODE_IN:
4964 opt |= PERL_UNICODE_IN_FLAG; break;
4965 case PERL_UNICODE_OUT:
4966 opt |= PERL_UNICODE_OUT_FLAG; break;
4967 case PERL_UNICODE_INOUT:
4968 opt |= PERL_UNICODE_INOUT_FLAG; break;
4969 case PERL_UNICODE_LOCALE:
4970 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4971 case PERL_UNICODE_ARGV:
4972 opt |= PERL_UNICODE_ARGV_FLAG; break;
4973 case PERL_UNICODE_UTF8CACHEASSERT:
4974 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4976 if (*p != '\n' && *p != '\r')
4978 "Unknown Unicode option letter '%c'", *p);
4984 opt = PERL_UNICODE_DEFAULT_FLAGS;
4986 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4987 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4988 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5000 * This is really just a quick hack which grabs various garbage
5001 * values. It really should be a real hash algorithm which
5002 * spreads the effect of every input bit onto every output bit,
5003 * if someone who knows about such things would bother to write it.
5004 * Might be a good idea to add that function to CORE as well.
5005 * No numbers below come from careful analysis or anything here,
5006 * except they are primes and SEED_C1 > 1E6 to get a full-width
5007 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5008 * probably be bigger too.
5011 # define SEED_C1 1000003
5012 #define SEED_C4 73819
5014 # define SEED_C1 25747
5015 #define SEED_C4 20639
5019 #define SEED_C5 26107
5021 #ifndef PERL_NO_DEV_RANDOM
5026 # include <starlet.h>
5027 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5028 * in 100-ns units, typically incremented ever 10 ms. */
5029 unsigned int when[2];
5031 # ifdef HAS_GETTIMEOFDAY
5032 struct timeval when;
5038 /* This test is an escape hatch, this symbol isn't set by Configure. */
5039 #ifndef PERL_NO_DEV_RANDOM
5040 #ifndef PERL_RANDOM_DEVICE
5041 /* /dev/random isn't used by default because reads from it will block
5042 * if there isn't enough entropy available. You can compile with
5043 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5044 * is enough real entropy to fill the seed. */
5045 # define PERL_RANDOM_DEVICE "/dev/urandom"
5047 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5049 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5058 _ckvmssts(sys$gettim(when));
5059 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5061 # ifdef HAS_GETTIMEOFDAY
5062 PerlProc_gettimeofday(&when,NULL);
5063 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5066 u = (U32)SEED_C1 * when;
5069 u += SEED_C3 * (U32)PerlProc_getpid();
5070 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5071 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5072 u += SEED_C5 * (U32)PTR2UV(&when);
5078 Perl_get_hash_seed(pTHX)
5081 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5087 if (s && isDIGIT(*s))
5088 myseed = (UV)Atoul(s);
5090 #ifdef USE_HASH_SEED_EXPLICIT
5094 /* Compute a random seed */
5095 (void)seedDrand01((Rand_seed_t)seed());
5096 myseed = (UV)(Drand01() * (NV)UV_MAX);
5097 #if RANDBITS < (UVSIZE * 8)
5098 /* Since there are not enough randbits to to reach all
5099 * the bits of a UV, the low bits might need extra
5100 * help. Sum in another random number that will
5101 * fill in the low bits. */
5103 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5104 #endif /* RANDBITS < (UVSIZE * 8) */
5105 if (myseed == 0) { /* Superparanoia. */
5106 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5108 Perl_croak(aTHX_ "Your random numbers are not that random");
5111 PL_rehash_seed_set = TRUE;
5118 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5120 const char * const stashpv = CopSTASHPV(c);
5121 const char * const name = HvNAME_get(hv);
5122 PERL_UNUSED_CONTEXT;
5124 if (stashpv == name)
5126 if (stashpv && name)
5127 if (strEQ(stashpv, name))
5134 #ifdef PERL_GLOBAL_STRUCT
5137 Perl_init_global_struct(pTHX)
5139 struct perl_vars *plvarsp = NULL;
5140 #ifdef PERL_GLOBAL_STRUCT
5141 # define PERL_GLOBAL_STRUCT_INIT
5142 # include "opcode.h" /* the ppaddr and check */
5143 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5144 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5145 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5146 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5147 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5151 plvarsp = PL_VarsPtr;
5152 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5158 # define PERLVAR(var,type) /**/
5159 # define PERLVARA(var,n,type) /**/
5160 # define PERLVARI(var,type,init) plvarsp->var = init;
5161 # define PERLVARIC(var,type,init) plvarsp->var = init;
5162 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5163 # include "perlvars.h"
5169 # ifdef PERL_GLOBAL_STRUCT
5170 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5171 if (!plvarsp->Gppaddr)
5173 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5174 if (!plvarsp->Gcheck)
5176 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5177 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5179 # ifdef PERL_SET_VARS
5180 PERL_SET_VARS(plvarsp);
5182 # undef PERL_GLOBAL_STRUCT_INIT
5187 #endif /* PERL_GLOBAL_STRUCT */
5189 #ifdef PERL_GLOBAL_STRUCT
5192 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5194 #ifdef PERL_GLOBAL_STRUCT
5195 # ifdef PERL_UNSET_VARS
5196 PERL_UNSET_VARS(plvarsp);
5198 free(plvarsp->Gppaddr);
5199 free(plvarsp->Gcheck);
5200 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5206 #endif /* PERL_GLOBAL_STRUCT */
5211 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5213 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5214 * variable PERL_MEM_LOG will be consulted, and if the integer value
5215 * of that is true, the logging will happen. (The default is to
5216 * always log if the PERL_MEM_LOG define was in effect.)
5220 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5221 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5223 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5226 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5227 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5228 * in which case the environment variable PERL_MEM_LOG_FD will be
5229 * consulted for the file descriptor number to use.
5231 #ifndef PERL_MEM_LOG_FD
5232 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5236 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)
5238 #ifdef PERL_MEM_LOG_STDERR
5239 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5242 # ifdef PERL_MEM_LOG_ENV
5243 s = getenv("PERL_MEM_LOG");
5244 if (s ? atoi(s) : 0)
5247 /* We can't use SVs or PerlIO for obvious reasons,
5248 * so we'll use stdio and low-level IO instead. */
5249 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5250 # ifdef PERL_MEM_LOG_TIMESTAMP
5252 # ifdef HAS_GETTIMEOFDAY
5253 gettimeofday(&tv, 0);
5255 /* If there are other OS specific ways of hires time than
5256 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5257 * probably that they would be used to fill in the struct
5264 # ifdef PERL_MEM_LOG_TIMESTAMP
5267 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5268 " %s = %"IVdf": %"UVxf"\n",
5269 # ifdef PERL_MEM_LOG_TIMESTAMP
5270 (int)tv.tv_sec, (int)tv.tv_usec,
5272 filename, linenumber, funcname, n, typesize,
5273 typename, n * typesize, PTR2UV(newalloc));
5274 # ifdef PERL_MEM_LOG_ENV_FD
5275 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5276 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5278 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5287 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)
5289 #ifdef PERL_MEM_LOG_STDERR
5290 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5293 # ifdef PERL_MEM_LOG_ENV
5294 s = PerlEnv_getenv("PERL_MEM_LOG");
5295 if (s ? atoi(s) : 0)
5298 /* We can't use SVs or PerlIO for obvious reasons,
5299 * so we'll use stdio and low-level IO instead. */
5300 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5301 # ifdef PERL_MEM_LOG_TIMESTAMP
5303 gettimeofday(&tv, 0);
5309 # ifdef PERL_MEM_LOG_TIMESTAMP
5312 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5313 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5314 # ifdef PERL_MEM_LOG_TIMESTAMP
5315 (int)tv.tv_sec, (int)tv.tv_usec,
5317 filename, linenumber, funcname, n, typesize,
5318 typename, n * typesize, PTR2UV(oldalloc),
5320 # ifdef PERL_MEM_LOG_ENV_FD
5321 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5322 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5324 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5333 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5335 #ifdef PERL_MEM_LOG_STDERR
5336 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5339 # ifdef PERL_MEM_LOG_ENV
5340 s = PerlEnv_getenv("PERL_MEM_LOG");
5341 if (s ? atoi(s) : 0)
5344 /* We can't use SVs or PerlIO for obvious reasons,
5345 * so we'll use stdio and low-level IO instead. */
5346 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5347 # ifdef PERL_MEM_LOG_TIMESTAMP
5349 gettimeofday(&tv, 0);
5355 # ifdef PERL_MEM_LOG_TIMESTAMP
5358 "free: %s:%d:%s: %"UVxf"\n",
5359 # ifdef PERL_MEM_LOG_TIMESTAMP
5360 (int)tv.tv_sec, (int)tv.tv_usec,
5362 filename, linenumber, funcname,
5364 # ifdef PERL_MEM_LOG_ENV_FD
5365 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5366 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5368 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5376 #endif /* PERL_MEM_LOG */
5379 =for apidoc my_sprintf
5381 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5382 the length of the string written to the buffer. Only rare pre-ANSI systems
5383 need the wrapper function - usually this is a direct call to C<sprintf>.
5387 #ifndef SPRINTF_RETURNS_STRLEN
5389 Perl_my_sprintf(char *buffer, const char* pat, ...)
5392 va_start(args, pat);
5393 vsprintf(buffer, pat, args);
5395 return strlen(buffer);
5400 =for apidoc my_snprintf
5402 The C library C<snprintf> functionality, if available and
5403 standards-compliant (uses C<vsnprintf>, actually). However, if the
5404 C<vsnprintf> is not available, will unfortunately use the unsafe
5405 C<vsprintf> which can overrun the buffer (there is an overrun check,
5406 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5407 getting C<vsnprintf>.
5412 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5417 va_start(ap, format);
5418 #ifdef HAS_VSNPRINTF
5419 retval = vsnprintf(buffer, len, format, ap);
5421 retval = vsprintf(buffer, format, ap);
5424 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5425 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5426 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5431 =for apidoc my_vsnprintf
5433 The C library C<vsnprintf> if available and standards-compliant.
5434 However, if if the C<vsnprintf> is not available, will unfortunately
5435 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5436 overrun check, but that may be too late). Consider using
5437 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5442 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5448 Perl_va_copy(ap, apc);
5449 # ifdef HAS_VSNPRINTF
5450 retval = vsnprintf(buffer, len, format, apc);
5452 retval = vsprintf(buffer, format, apc);
5455 # ifdef HAS_VSNPRINTF
5456 retval = vsnprintf(buffer, len, format, ap);
5458 retval = vsprintf(buffer, format, ap);
5460 #endif /* #ifdef NEED_VA_COPY */
5461 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5462 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5463 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5468 Perl_my_clearenv(pTHX)
5471 #if ! defined(PERL_MICRO)
5472 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5474 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5475 # if defined(USE_ENVIRON_ARRAY)
5476 # if defined(USE_ITHREADS)
5477 /* only the parent thread can clobber the process environment */
5478 if (PL_curinterp == aTHX)
5479 # endif /* USE_ITHREADS */
5481 # if ! defined(PERL_USE_SAFE_PUTENV)
5482 if ( !PL_use_safe_putenv) {
5484 if (environ == PL_origenviron)
5485 environ = (char**)safesysmalloc(sizeof(char*));
5487 for (i = 0; environ[i]; i++)
5488 (void)safesysfree(environ[i]);
5491 # else /* PERL_USE_SAFE_PUTENV */
5492 # if defined(HAS_CLEARENV)
5494 # elif defined(HAS_UNSETENV)
5495 int bsiz = 80; /* Most envvar names will be shorter than this. */
5496 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5497 char *buf = (char*)safesysmalloc(bufsiz);
5498 while (*environ != NULL) {
5499 char *e = strchr(*environ, '=');
5500 int l = e ? e - *environ : (int)strlen(*environ);
5502 (void)safesysfree(buf);
5503 bsiz = l + 1; /* + 1 for the \0. */
5504 buf = (char*)safesysmalloc(bufsiz);
5506 my_strlcpy(buf, *environ, l + 1);
5507 (void)unsetenv(buf);
5509 (void)safesysfree(buf);
5510 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5511 /* Just null environ and accept the leakage. */
5513 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5514 # endif /* ! PERL_USE_SAFE_PUTENV */
5516 # endif /* USE_ENVIRON_ARRAY */
5517 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5518 #endif /* PERL_MICRO */
5521 #ifdef PERL_IMPLICIT_CONTEXT
5523 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5524 the global PL_my_cxt_index is incremented, and that value is assigned to
5525 that module's static my_cxt_index (who's address is passed as an arg).
5526 Then, for each interpreter this function is called for, it makes sure a
5527 void* slot is available to hang the static data off, by allocating or
5528 extending the interpreter's PL_my_cxt_list array */
5531 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5536 /* this module hasn't been allocated an index yet */
5537 MUTEX_LOCK(&PL_my_ctx_mutex);
5538 *index = PL_my_cxt_index++;
5539 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5542 /* make sure the array is big enough */
5543 if (PL_my_cxt_size <= *index) {
5544 if (PL_my_cxt_size) {
5545 while (PL_my_cxt_size <= *index)
5546 PL_my_cxt_size *= 2;
5547 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5550 PL_my_cxt_size = 16;
5551 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5554 /* newSV() allocates one more than needed */
5555 p = (void*)SvPVX(newSV(size-1));
5556 PL_my_cxt_list[*index] = p;
5557 Zero(p, size, char);
5564 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5566 Size_t used, length, copy;
5569 length = strlen(src);
5570 if (size > 0 && used < size - 1) {
5571 copy = (length >= size - used) ? size - used - 1 : length;
5572 memcpy(dst + used, src, copy);
5573 dst[used + copy] = '\0';
5575 return used + length;
5581 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5583 Size_t length, copy;
5585 length = strlen(src);
5587 copy = (length >= size) ? size - 1 : length;
5588 memcpy(dst, src, copy);
5596 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5599 SV * const dbsv = GvSVn(PL_DBsub);
5600 /* We do not care about using sv to call CV;
5601 * it's for informational purposes only.
5605 if (!PERLDB_SUB_NN) {
5606 GV * const gv = CvGV(cv);
5608 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5609 || strEQ(GvNAME(gv), "END")
5610 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5611 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5612 /* Use GV from the stack as a fallback. */
5613 /* GV is potentially non-unique, or contain different CV. */
5614 SV * const tmp = newRV((SV*)cv);
5615 sv_setsv(dbsv, tmp);
5619 gv_efullname3(dbsv, gv, NULL);
5623 const int type = SvTYPE(dbsv);
5624 if (type < SVt_PVIV && type != SVt_IV)
5625 sv_upgrade(dbsv, SVt_PVIV);
5626 (void)SvIOK_on(dbsv);
5627 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5633 * c-indentation-style: bsd
5635 * indent-tabs-mode: t
5638 * ex: set ts=8 sts=4 sw=4 noet: