3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
263 if (size * count > 0xffff) {
264 PerlIO_printf(Perl_error_log,
265 "Allocation too large: %lx\n", size * count) FLUSH;
268 #endif /* HAS_64K_LIMIT */
270 if ((long)size < 0 || (long)count < 0)
271 Perl_croak_nocontext("panic: calloc");
274 #ifdef PERL_TRACK_MEMPOOL
277 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
278 PERL_ALLOC_CHECK(ptr);
279 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
281 memset((void*)ptr, 0, size);
282 #ifdef PERL_TRACK_MEMPOOL
284 struct perl_memory_debug_header *const header
285 = (struct perl_memory_debug_header *)ptr;
287 header->interpreter = aTHX;
288 /* Link us into the list. */
289 header->prev = &PL_memory_debug_header;
290 header->next = PL_memory_debug_header.next;
291 PL_memory_debug_header.next = header;
292 header->next->prev = header;
296 ptr = (Malloc_t)((char*)ptr+sTHX);
303 return write_no_mem();
306 /* These must be defined when not using Perl's malloc for binary
311 Malloc_t Perl_malloc (MEM_SIZE nbytes)
314 return (Malloc_t)PerlMem_malloc(nbytes);
317 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
320 return (Malloc_t)PerlMem_calloc(elements, size);
323 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
326 return (Malloc_t)PerlMem_realloc(where, nbytes);
329 Free_t Perl_mfree (Malloc_t where)
337 /* copy a string up to some (non-backslashed) delimiter, if any */
340 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
345 for (tolen = 0; from < fromend; from++, tolen++) {
347 if (from[1] != delim) {
354 else if (*from == delim)
365 /* return ptr to little string in big string, NULL if not found */
366 /* This routine was donated by Corey Satten. */
369 Perl_instr(pTHX_ register const char *big, register const char *little)
380 register const char *s, *x;
383 for (x=big,s=little; *s; /**/ ) {
394 return (char*)(big-1);
399 /* same as instr but allow embedded nulls */
402 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
408 char first = *little++;
410 bigend -= lend - little;
412 while (big <= bigend) {
415 for (x=big,s=little; s < lend; x++,s++) {
419 return (char*)(big-1);
425 /* reverse of the above--find last substring */
428 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
430 register const char *bigbeg;
431 register const I32 first = *little;
432 register const char * const littleend = lend;
435 if (little >= littleend)
436 return (char*)bigend;
438 big = bigend - (littleend - little++);
439 while (big >= bigbeg) {
440 register const char *s, *x;
443 for (x=big+2,s=little; s < littleend; /**/ ) {
452 return (char*)(big+1);
457 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
459 /* As a space optimization, we do not compile tables for strings of length
460 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
461 special-cased in fbm_instr().
463 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
466 =head1 Miscellaneous Functions
468 =for apidoc fbm_compile
470 Analyses the string in order to make fast searches on it using fbm_instr()
471 -- the Boyer-Moore algorithm.
477 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
480 register const U8 *s;
486 if (flags & FBMcf_TAIL) {
487 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
488 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
489 if (mg && mg->mg_len >= 0)
492 s = (U8*)SvPV_force_mutable(sv, len);
493 SvUPGRADE(sv, SVt_PVBM);
494 if (len == 0) /* TAIL might be on a zero-length string. */
497 const unsigned char *sb;
498 const U8 mlen = (len>255) ? 255 : (U8)len;
501 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
502 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
503 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
504 memset((void*)table, mlen, 256);
505 table[-1] = (U8)flags;
507 sb = s - mlen + 1; /* first char (maybe) */
509 if (table[*s] == mlen)
514 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
517 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
518 for (i = 0; i < len; i++) {
519 if (PL_freq[s[i]] < frequency) {
521 frequency = PL_freq[s[i]];
524 BmRARE(sv) = s[rarest];
525 BmPREVIOUS(sv) = (U16)rarest;
526 BmUSEFUL(sv) = 100; /* Initial value */
527 if (flags & FBMcf_TAIL)
529 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
530 BmRARE(sv),BmPREVIOUS(sv)));
533 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
534 /* If SvTAIL is actually due to \Z or \z, this gives false positives
538 =for apidoc fbm_instr
540 Returns the location of the SV in the string delimited by C<str> and
541 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
542 does not have to be fbm_compiled, but the search will not be as fast
549 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
551 register unsigned char *s;
553 register const unsigned char *little
554 = (const unsigned char *)SvPV_const(littlestr,l);
555 register STRLEN littlelen = l;
556 register const I32 multiline = flags & FBMrf_MULTILINE;
558 if ((STRLEN)(bigend - big) < littlelen) {
559 if ( SvTAIL(littlestr)
560 && ((STRLEN)(bigend - big) == littlelen - 1)
562 || (*big == *little &&
563 memEQ((char *)big, (char *)little, littlelen - 1))))
568 if (littlelen <= 2) { /* Special-cased */
570 if (littlelen == 1) {
571 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
572 /* Know that bigend != big. */
573 if (bigend[-1] == '\n')
574 return (char *)(bigend - 1);
575 return (char *) bigend;
583 if (SvTAIL(littlestr))
584 return (char *) bigend;
588 return (char*)big; /* Cannot be SvTAIL! */
591 if (SvTAIL(littlestr) && !multiline) {
592 if (bigend[-1] == '\n' && bigend[-2] == *little)
593 return (char*)bigend - 2;
594 if (bigend[-1] == *little)
595 return (char*)bigend - 1;
599 /* This should be better than FBM if c1 == c2, and almost
600 as good otherwise: maybe better since we do less indirection.
601 And we save a lot of memory by caching no table. */
602 const unsigned char c1 = little[0];
603 const unsigned char c2 = little[1];
608 while (s <= bigend) {
618 goto check_1char_anchor;
629 goto check_1char_anchor;
632 while (s <= bigend) {
637 goto check_1char_anchor;
646 check_1char_anchor: /* One char and anchor! */
647 if (SvTAIL(littlestr) && (*bigend == *little))
648 return (char *)bigend; /* bigend is already decremented. */
651 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
652 s = bigend - littlelen;
653 if (s >= big && bigend[-1] == '\n' && *s == *little
654 /* Automatically of length > 2 */
655 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
657 return (char*)s; /* how sweet it is */
660 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
662 return (char*)s + 1; /* how sweet it is */
666 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
667 char * const b = ninstr((char*)big,(char*)bigend,
668 (char*)little, (char*)little + littlelen);
670 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
671 /* Chop \n from littlestr: */
672 s = bigend - littlelen + 1;
674 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
683 { /* Do actual FBM. */
684 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
685 register const unsigned char *oldlittle;
687 if (littlelen > (STRLEN)(bigend - big))
689 --littlelen; /* Last char found by table lookup */
692 little += littlelen; /* last char */
698 if ((tmp = table[*s])) {
699 if ((s += tmp) < bigend)
703 else { /* less expensive than calling strncmp() */
704 register unsigned char * const olds = s;
709 if (*--s == *--little)
711 s = olds + 1; /* here we pay the price for failure */
713 if (s < bigend) /* fake up continue to outer loop */
721 if ( s == bigend && (table[-1] & FBMcf_TAIL)
722 && memEQ((char *)(bigend - littlelen),
723 (char *)(oldlittle - littlelen), littlelen) )
724 return (char*)bigend - littlelen;
729 /* start_shift, end_shift are positive quantities which give offsets
730 of ends of some substring of bigstr.
731 If "last" we want the last occurrence.
732 old_posp is the way of communication between consequent calls if
733 the next call needs to find the .
734 The initial *old_posp should be -1.
736 Note that we take into account SvTAIL, so one can get extra
737 optimizations if _ALL flag is set.
740 /* If SvTAIL is actually due to \Z or \z, this gives false positives
741 if PL_multiline. In fact if !PL_multiline the authoritative answer
742 is not supported yet. */
745 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
748 register const unsigned char *big;
750 register I32 previous;
752 register const unsigned char *little;
753 register I32 stop_pos;
754 register const unsigned char *littleend;
758 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
759 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
761 if ( BmRARE(littlestr) == '\n'
762 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
763 little = (const unsigned char *)(SvPVX_const(littlestr));
764 littleend = little + SvCUR(littlestr);
771 little = (const unsigned char *)(SvPVX_const(littlestr));
772 littleend = little + SvCUR(littlestr);
774 /* The value of pos we can start at: */
775 previous = BmPREVIOUS(littlestr);
776 big = (const unsigned char *)(SvPVX_const(bigstr));
777 /* The value of pos we can stop at: */
778 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
779 if (previous + start_shift > stop_pos) {
781 stop_pos does not include SvTAIL in the count, so this check is incorrect
782 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
785 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
790 while (pos < previous + start_shift) {
791 if (!(pos += PL_screamnext[pos]))
796 register const unsigned char *s, *x;
797 if (pos >= stop_pos) break;
798 if (big[pos] != first)
800 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
806 if (s == littleend) {
808 if (!last) return (char *)(big+pos);
811 } while ( pos += PL_screamnext[pos] );
813 return (char *)(big+(*old_posp));
815 if (!SvTAIL(littlestr) || (end_shift > 0))
817 /* Ignore the trailing "\n". This code is not microoptimized */
818 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
819 stop_pos = littleend - little; /* Actual littlestr len */
824 && ((stop_pos == 1) ||
825 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
831 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
833 register const U8 *a = (const U8 *)s1;
834 register const U8 *b = (const U8 *)s2;
838 if (*a != *b && *a != PL_fold[*b])
846 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
849 register const U8 *a = (const U8 *)s1;
850 register const U8 *b = (const U8 *)s2;
854 if (*a != *b && *a != PL_fold_locale[*b])
861 /* copy a string to a safe spot */
864 =head1 Memory Management
868 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
869 string which is a duplicate of C<pv>. The size of the string is
870 determined by C<strlen()>. The memory allocated for the new string can
871 be freed with the C<Safefree()> function.
877 Perl_savepv(pTHX_ const char *pv)
884 const STRLEN pvlen = strlen(pv)+1;
885 Newx(newaddr, pvlen, char);
886 return (char*)memcpy(newaddr, pv, pvlen);
890 /* same thing but with a known length */
895 Perl's version of what C<strndup()> would be if it existed. Returns a
896 pointer to a newly allocated string which is a duplicate of the first
897 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
898 the new string can be freed with the C<Safefree()> function.
904 Perl_savepvn(pTHX_ const char *pv, register I32 len)
906 register char *newaddr;
909 Newx(newaddr,len+1,char);
910 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
912 /* might not be null terminated */
914 return (char *) CopyD(pv,newaddr,len,char);
917 return (char *) ZeroD(newaddr,len+1,char);
922 =for apidoc savesharedpv
924 A version of C<savepv()> which allocates the duplicate string in memory
925 which is shared between threads.
930 Perl_savesharedpv(pTHX_ const char *pv)
932 register char *newaddr;
937 pvlen = strlen(pv)+1;
938 newaddr = (char*)PerlMemShared_malloc(pvlen);
940 return write_no_mem();
942 return (char*)memcpy(newaddr, pv, pvlen);
948 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
949 the passed in SV using C<SvPV()>
955 Perl_savesvpv(pTHX_ SV *sv)
958 const char * const pv = SvPV_const(sv, len);
959 register char *newaddr;
962 Newx(newaddr,len,char);
963 return (char *) CopyD(pv,newaddr,len,char);
967 /* the SV for Perl_form() and mess() is not kept in an arena */
977 return sv_2mortal(newSVpvs(""));
982 /* Create as PVMG now, to avoid any upgrading later */
984 Newxz(any, 1, XPVMG);
985 SvFLAGS(sv) = SVt_PVMG;
986 SvANY(sv) = (void*)any;
988 SvREFCNT(sv) = 1 << 30; /* practically infinite */
993 #if defined(PERL_IMPLICIT_CONTEXT)
995 Perl_form_nocontext(const char* pat, ...)
1000 va_start(args, pat);
1001 retval = vform(pat, &args);
1005 #endif /* PERL_IMPLICIT_CONTEXT */
1008 =head1 Miscellaneous Functions
1011 Takes a sprintf-style format pattern and conventional
1012 (non-SV) arguments and returns the formatted string.
1014 (char *) Perl_form(pTHX_ const char* pat, ...)
1016 can be used any place a string (char *) is required:
1018 char * s = Perl_form("%d.%d",major,minor);
1020 Uses a single private buffer so if you want to format several strings you
1021 must explicitly copy the earlier strings away (and free the copies when you
1028 Perl_form(pTHX_ const char* pat, ...)
1032 va_start(args, pat);
1033 retval = vform(pat, &args);
1039 Perl_vform(pTHX_ const char *pat, va_list *args)
1041 SV * const sv = mess_alloc();
1042 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1046 #if defined(PERL_IMPLICIT_CONTEXT)
1048 Perl_mess_nocontext(const char *pat, ...)
1053 va_start(args, pat);
1054 retval = vmess(pat, &args);
1058 #endif /* PERL_IMPLICIT_CONTEXT */
1061 Perl_mess(pTHX_ const char *pat, ...)
1065 va_start(args, pat);
1066 retval = vmess(pat, &args);
1072 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1075 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1077 if (!o || o == PL_op)
1080 if (o->op_flags & OPf_KIDS) {
1082 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1085 /* If the OP_NEXTSTATE has been optimised away we can still use it
1086 * the get the file and line number. */
1088 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1089 cop = (const COP *)kid;
1091 /* Keep searching, and return when we've found something. */
1093 new_cop = closest_cop(cop, kid);
1099 /* Nothing found. */
1105 Perl_vmess(pTHX_ const char *pat, va_list *args)
1108 SV * const sv = mess_alloc();
1110 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1111 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1113 * Try and find the file and line for PL_op. This will usually be
1114 * PL_curcop, but it might be a cop that has been optimised away. We
1115 * can try to find such a cop by searching through the optree starting
1116 * from the sibling of PL_curcop.
1119 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1124 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1125 OutCopFILE(cop), (IV)CopLINE(cop));
1126 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1127 const bool line_mode = (RsSIMPLE(PL_rs) &&
1128 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1129 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1130 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1131 line_mode ? "line" : "chunk",
1132 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1135 sv_catpvs(sv, " during global destruction");
1136 sv_catpvs(sv, ".\n");
1142 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1148 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1149 && (io = GvIO(PL_stderrgv))
1150 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1157 SAVESPTR(PL_stderrgv);
1160 PUSHSTACKi(PERLSI_MAGIC);
1164 PUSHs(SvTIED_obj((SV*)io, mg));
1165 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1167 call_method("PRINT", G_SCALAR);
1175 /* SFIO can really mess with your errno */
1176 const int e = errno;
1178 PerlIO * const serr = Perl_error_log;
1180 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1181 (void)PerlIO_flush(serr);
1188 /* Common code used by vcroak, vdie, vwarn and vwarner */
1191 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1197 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1198 /* sv_2cv might call Perl_croak() or Perl_warner() */
1199 SV * const oldhook = *hook;
1206 cv = sv_2cv(oldhook, &stash, &gv, 0);
1208 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1218 if (warn || message) {
1219 msg = newSVpvn(message, msglen);
1220 SvFLAGS(msg) |= utf8;
1228 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1232 call_sv((SV*)cv, G_DISCARD);
1241 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1245 const char *message;
1248 SV * const msv = vmess(pat, args);
1249 if (PL_errors && SvCUR(PL_errors)) {
1250 sv_catsv(PL_errors, msv);
1251 message = SvPV_const(PL_errors, *msglen);
1252 SvCUR_set(PL_errors, 0);
1255 message = SvPV_const(msv,*msglen);
1256 *utf8 = SvUTF8(msv);
1262 DEBUG_S(PerlIO_printf(Perl_debug_log,
1263 "%p: die/croak: message = %s\ndiehook = %p\n",
1264 thr, message, PL_diehook));
1266 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1272 Perl_vdie(pTHX_ const char* pat, va_list *args)
1275 const char *message;
1276 const int was_in_eval = PL_in_eval;
1280 DEBUG_S(PerlIO_printf(Perl_debug_log,
1281 "%p: die: curstack = %p, mainstack = %p\n",
1282 thr, PL_curstack, PL_mainstack));
1284 message = vdie_croak_common(pat, args, &msglen, &utf8);
1286 PL_restartop = die_where(message, msglen);
1287 SvFLAGS(ERRSV) |= utf8;
1288 DEBUG_S(PerlIO_printf(Perl_debug_log,
1289 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1290 thr, PL_restartop, was_in_eval, PL_top_env));
1291 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1293 return PL_restartop;
1296 #if defined(PERL_IMPLICIT_CONTEXT)
1298 Perl_die_nocontext(const char* pat, ...)
1303 va_start(args, pat);
1304 o = vdie(pat, &args);
1308 #endif /* PERL_IMPLICIT_CONTEXT */
1311 Perl_die(pTHX_ const char* pat, ...)
1315 va_start(args, pat);
1316 o = vdie(pat, &args);
1322 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1325 const char *message;
1329 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1332 PL_restartop = die_where(message, msglen);
1333 SvFLAGS(ERRSV) |= utf8;
1337 message = SvPVx_const(ERRSV, msglen);
1339 write_to_stderr(message, msglen);
1343 #if defined(PERL_IMPLICIT_CONTEXT)
1345 Perl_croak_nocontext(const char *pat, ...)
1349 va_start(args, pat);
1354 #endif /* PERL_IMPLICIT_CONTEXT */
1357 =head1 Warning and Dieing
1361 This is the XSUB-writer's interface to Perl's C<die> function.
1362 Normally call this function the same way you call the C C<printf>
1363 function. Calling C<croak> returns control directly to Perl,
1364 sidestepping the normal C order of execution. See C<warn>.
1366 If you want to throw an exception object, assign the object to
1367 C<$@> and then pass C<NULL> to croak():
1369 errsv = get_sv("@", TRUE);
1370 sv_setsv(errsv, exception_object);
1377 Perl_croak(pTHX_ const char *pat, ...)
1380 va_start(args, pat);
1387 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1391 SV * const msv = vmess(pat, args);
1392 const I32 utf8 = SvUTF8(msv);
1393 const char * const message = SvPV_const(msv, msglen);
1396 if (vdie_common(message, msglen, utf8, TRUE))
1400 write_to_stderr(message, msglen);
1403 #if defined(PERL_IMPLICIT_CONTEXT)
1405 Perl_warn_nocontext(const char *pat, ...)
1409 va_start(args, pat);
1413 #endif /* PERL_IMPLICIT_CONTEXT */
1418 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1419 function the same way you call the C C<printf> function. See C<croak>.
1425 Perl_warn(pTHX_ const char *pat, ...)
1428 va_start(args, pat);
1433 #if defined(PERL_IMPLICIT_CONTEXT)
1435 Perl_warner_nocontext(U32 err, const char *pat, ...)
1439 va_start(args, pat);
1440 vwarner(err, pat, &args);
1443 #endif /* PERL_IMPLICIT_CONTEXT */
1446 Perl_warner(pTHX_ U32 err, const char* pat,...)
1449 va_start(args, pat);
1450 vwarner(err, pat, &args);
1455 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1458 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1459 SV * const msv = vmess(pat, args);
1461 const char * const message = SvPV_const(msv, msglen);
1462 const I32 utf8 = SvUTF8(msv);
1466 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1469 PL_restartop = die_where(message, msglen);
1470 SvFLAGS(ERRSV) |= utf8;
1473 write_to_stderr(message, msglen);
1477 Perl_vwarn(aTHX_ pat, args);
1481 /* implements the ckWARN? macros */
1484 Perl_ckwarn(pTHX_ U32 w)
1490 && PL_curcop->cop_warnings != pWARN_NONE
1492 PL_curcop->cop_warnings == pWARN_ALL
1493 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1494 || (unpackWARN2(w) &&
1495 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1496 || (unpackWARN3(w) &&
1497 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1498 || (unpackWARN4(w) &&
1499 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1504 isLEXWARN_off && PL_dowarn & G_WARN_ON
1509 /* implements the ckWARN?_d macro */
1512 Perl_ckwarn_d(pTHX_ U32 w)
1517 || PL_curcop->cop_warnings == pWARN_ALL
1519 PL_curcop->cop_warnings != pWARN_NONE
1521 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1522 || (unpackWARN2(w) &&
1523 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1524 || (unpackWARN3(w) &&
1525 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1526 || (unpackWARN4(w) &&
1527 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1533 /* Set buffer=NULL to get a new one. */
1535 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1537 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1538 PERL_UNUSED_CONTEXT;
1541 (specialWARN(buffer) ?
1542 PerlMemShared_malloc(len_wanted) :
1543 PerlMemShared_realloc(buffer, len_wanted));
1545 Copy(bits, (buffer + 1), size, char);
1549 /* since we've already done strlen() for both nam and val
1550 * we can use that info to make things faster than
1551 * sprintf(s, "%s=%s", nam, val)
1553 #define my_setenv_format(s, nam, nlen, val, vlen) \
1554 Copy(nam, s, nlen, char); \
1556 Copy(val, s+(nlen+1), vlen, char); \
1557 *(s+(nlen+1+vlen)) = '\0'
1559 #if defined(USE_ENVIRON_ARRAY) && !defined(WIN32) && !defined(NETWARE)
1560 /* VMS' my_setenv() is in vms.c */
1562 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1566 /* only parent thread can modify process environment */
1567 if (PL_curinterp == aTHX)
1570 #ifndef PERL_USE_SAFE_PUTENV
1571 if (!PL_use_safe_putenv) {
1572 /* The excuse for this code was that many putenv()s used to
1573 * leak, so we manipulate environ directly -- but the claim is
1574 * somewhat doubtful, since manipulating environment CANNOT be
1575 * made in a safe way, the env API and the whole concept are
1576 * fundamentally broken. */
1577 register I32 i = setenv_getix(nam); /* where does it go? */
1581 if (environ == PL_origenviron) { /* need we copy environment? */
1587 while (environ[max])
1589 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1590 for (j=0; j<max; j++) { /* copy environment */
1591 const int len = strlen(environ[j]);
1592 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1593 Copy(environ[j], tmpenv[j], len+1, char);
1596 environ = tmpenv; /* tell exec where it is now */
1599 safesysfree(environ[i]);
1600 while (environ[i]) {
1601 environ[i] = environ[i+1];
1606 if (!environ[i]) { /* does not exist yet */
1607 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1608 environ[i+1] = NULL; /* make sure it's null terminated */
1611 safesysfree(environ[i]);
1615 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1616 /* all that work just for this */
1617 my_setenv_format(environ[i], nam, nlen, val, vlen);
1621 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1622 # if defined(HAS_UNSETENV)
1624 (void)unsetenv(nam);
1626 (void)setenv(nam, val, 1);
1628 # else /* ! HAS_UNSETENV */
1629 (void)setenv(nam, val, 1);
1630 # endif /* HAS_UNSETENV */
1632 # if defined(HAS_UNSETENV)
1634 (void)unsetenv(nam);
1636 const int nlen = strlen(nam);
1637 const int vlen = strlen(val);
1638 char * const new_env =
1639 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1640 my_setenv_format(new_env, nam, nlen, val, vlen);
1641 (void)putenv(new_env);
1643 # else /* ! HAS_UNSETENV */
1645 const int nlen = strlen(nam);
1651 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1652 /* all that work just for this */
1653 my_setenv_format(new_env, nam, nlen, val, vlen);
1654 (void)putenv(new_env);
1655 # endif /* HAS_UNSETENV */
1656 # endif /* __CYGWIN__ */
1657 #ifndef PERL_USE_SAFE_PUTENV
1663 #else /* defined(USE_ENVIRON_ARRAY) && !defined(WIN32) && !defined(NETWARE)*/
1666 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1669 #if !(defined(WIN32) || defined(NETWARE))
1670 # ifdef USE_ITHREADS
1671 /* only parent thread can modify process environment */
1672 if (PL_curinterp == aTHX)
1676 register char *envstr;
1677 const int nlen = strlen(nam);
1684 Newx(envstr, nlen+vlen+2, char);
1685 my_setenv_format(envstr, nam, nlen, val, vlen);
1686 (void)PerlEnv_putenv(envstr);
1691 #endif /* defined(USE_ENVIRON_ARRAY) && !defined(WIN32) && !defined(NETWARE) */
1696 Perl_setenv_getix(pTHX_ const char *nam)
1698 register I32 i = -1;
1699 register const I32 len = strlen(nam);
1700 PERL_UNUSED_CONTEXT;
1702 #ifdef USE_ENVIRON_ARRAY
1703 for (i = 0; environ[i]; i++) {
1706 strnicmp(environ[i],nam,len) == 0
1708 strnEQ(environ[i],nam,len)
1710 && environ[i][len] == '=')
1711 break; /* strnEQ must come first to avoid */
1712 } /* potential SEGV's */
1713 #endif /* USE_ENVIRON_ARRAY */
1718 #endif /* !PERL_VMS */
1720 #ifdef UNLINK_ALL_VERSIONS
1722 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1726 while (PerlLIO_unlink(f) >= 0)
1728 return retries ? 0 : -1;
1732 /* this is a drop-in replacement for bcopy() */
1733 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1735 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1737 char * const retval = to;
1739 if (from - to >= 0) {
1747 *(--to) = *(--from);
1753 /* this is a drop-in replacement for memset() */
1756 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1758 char * const retval = loc;
1766 /* this is a drop-in replacement for bzero() */
1767 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1769 Perl_my_bzero(register char *loc, register I32 len)
1771 char * const retval = loc;
1779 /* this is a drop-in replacement for memcmp() */
1780 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1782 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1784 register const U8 *a = (const U8 *)s1;
1785 register const U8 *b = (const U8 *)s2;
1789 if ((tmp = *a++ - *b++))
1794 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1798 #ifdef USE_CHAR_VSPRINTF
1803 vsprintf(char *dest, const char *pat, char *args)
1807 fakebuf._ptr = dest;
1808 fakebuf._cnt = 32767;
1812 fakebuf._flag = _IOWRT|_IOSTRG;
1813 _doprnt(pat, args, &fakebuf); /* what a kludge */
1814 (void)putc('\0', &fakebuf);
1815 #ifdef USE_CHAR_VSPRINTF
1818 return 0; /* perl doesn't use return value */
1822 #endif /* HAS_VPRINTF */
1825 #if BYTEORDER != 0x4321
1827 Perl_my_swap(pTHX_ short s)
1829 #if (BYTEORDER & 1) == 0
1832 result = ((s & 255) << 8) + ((s >> 8) & 255);
1840 Perl_my_htonl(pTHX_ long l)
1844 char c[sizeof(long)];
1847 #if BYTEORDER == 0x1234
1848 u.c[0] = (l >> 24) & 255;
1849 u.c[1] = (l >> 16) & 255;
1850 u.c[2] = (l >> 8) & 255;
1854 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1855 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1860 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1861 u.c[o & 0xf] = (l >> s) & 255;
1869 Perl_my_ntohl(pTHX_ long l)
1873 char c[sizeof(long)];
1876 #if BYTEORDER == 0x1234
1877 u.c[0] = (l >> 24) & 255;
1878 u.c[1] = (l >> 16) & 255;
1879 u.c[2] = (l >> 8) & 255;
1883 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1884 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1891 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1892 l |= (u.c[o & 0xf] & 255) << s;
1899 #endif /* BYTEORDER != 0x4321 */
1903 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1904 * If these functions are defined,
1905 * the BYTEORDER is neither 0x1234 nor 0x4321.
1906 * However, this is not assumed.
1910 #define HTOLE(name,type) \
1912 name (register type n) \
1916 char c[sizeof(type)]; \
1919 register U32 s = 0; \
1920 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1921 u.c[i] = (n >> s) & 0xFF; \
1926 #define LETOH(name,type) \
1928 name (register type n) \
1932 char c[sizeof(type)]; \
1935 register U32 s = 0; \
1938 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1939 n |= ((type)(u.c[i] & 0xFF)) << s; \
1945 * Big-endian byte order functions.
1948 #define HTOBE(name,type) \
1950 name (register type n) \
1954 char c[sizeof(type)]; \
1957 register U32 s = 8*(sizeof(u.c)-1); \
1958 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1959 u.c[i] = (n >> s) & 0xFF; \
1964 #define BETOH(name,type) \
1966 name (register type n) \
1970 char c[sizeof(type)]; \
1973 register U32 s = 8*(sizeof(u.c)-1); \
1976 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1977 n |= ((type)(u.c[i] & 0xFF)) << s; \
1983 * If we just can't do it...
1986 #define NOT_AVAIL(name,type) \
1988 name (register type n) \
1990 Perl_croak_nocontext(#name "() not available"); \
1991 return n; /* not reached */ \
1995 #if defined(HAS_HTOVS) && !defined(htovs)
1998 #if defined(HAS_HTOVL) && !defined(htovl)
2001 #if defined(HAS_VTOHS) && !defined(vtohs)
2004 #if defined(HAS_VTOHL) && !defined(vtohl)
2008 #ifdef PERL_NEED_MY_HTOLE16
2010 HTOLE(Perl_my_htole16,U16)
2012 NOT_AVAIL(Perl_my_htole16,U16)
2015 #ifdef PERL_NEED_MY_LETOH16
2017 LETOH(Perl_my_letoh16,U16)
2019 NOT_AVAIL(Perl_my_letoh16,U16)
2022 #ifdef PERL_NEED_MY_HTOBE16
2024 HTOBE(Perl_my_htobe16,U16)
2026 NOT_AVAIL(Perl_my_htobe16,U16)
2029 #ifdef PERL_NEED_MY_BETOH16
2031 BETOH(Perl_my_betoh16,U16)
2033 NOT_AVAIL(Perl_my_betoh16,U16)
2037 #ifdef PERL_NEED_MY_HTOLE32
2039 HTOLE(Perl_my_htole32,U32)
2041 NOT_AVAIL(Perl_my_htole32,U32)
2044 #ifdef PERL_NEED_MY_LETOH32
2046 LETOH(Perl_my_letoh32,U32)
2048 NOT_AVAIL(Perl_my_letoh32,U32)
2051 #ifdef PERL_NEED_MY_HTOBE32
2053 HTOBE(Perl_my_htobe32,U32)
2055 NOT_AVAIL(Perl_my_htobe32,U32)
2058 #ifdef PERL_NEED_MY_BETOH32
2060 BETOH(Perl_my_betoh32,U32)
2062 NOT_AVAIL(Perl_my_betoh32,U32)
2066 #ifdef PERL_NEED_MY_HTOLE64
2068 HTOLE(Perl_my_htole64,U64)
2070 NOT_AVAIL(Perl_my_htole64,U64)
2073 #ifdef PERL_NEED_MY_LETOH64
2075 LETOH(Perl_my_letoh64,U64)
2077 NOT_AVAIL(Perl_my_letoh64,U64)
2080 #ifdef PERL_NEED_MY_HTOBE64
2082 HTOBE(Perl_my_htobe64,U64)
2084 NOT_AVAIL(Perl_my_htobe64,U64)
2087 #ifdef PERL_NEED_MY_BETOH64
2089 BETOH(Perl_my_betoh64,U64)
2091 NOT_AVAIL(Perl_my_betoh64,U64)
2095 #ifdef PERL_NEED_MY_HTOLES
2096 HTOLE(Perl_my_htoles,short)
2098 #ifdef PERL_NEED_MY_LETOHS
2099 LETOH(Perl_my_letohs,short)
2101 #ifdef PERL_NEED_MY_HTOBES
2102 HTOBE(Perl_my_htobes,short)
2104 #ifdef PERL_NEED_MY_BETOHS
2105 BETOH(Perl_my_betohs,short)
2108 #ifdef PERL_NEED_MY_HTOLEI
2109 HTOLE(Perl_my_htolei,int)
2111 #ifdef PERL_NEED_MY_LETOHI
2112 LETOH(Perl_my_letohi,int)
2114 #ifdef PERL_NEED_MY_HTOBEI
2115 HTOBE(Perl_my_htobei,int)
2117 #ifdef PERL_NEED_MY_BETOHI
2118 BETOH(Perl_my_betohi,int)
2121 #ifdef PERL_NEED_MY_HTOLEL
2122 HTOLE(Perl_my_htolel,long)
2124 #ifdef PERL_NEED_MY_LETOHL
2125 LETOH(Perl_my_letohl,long)
2127 #ifdef PERL_NEED_MY_HTOBEL
2128 HTOBE(Perl_my_htobel,long)
2130 #ifdef PERL_NEED_MY_BETOHL
2131 BETOH(Perl_my_betohl,long)
2135 Perl_my_swabn(void *ptr, int n)
2137 register char *s = (char *)ptr;
2138 register char *e = s + (n-1);
2141 for (n /= 2; n > 0; s++, e--, n--) {
2149 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2151 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2154 register I32 This, that;
2160 PERL_FLUSHALL_FOR_CHILD;
2161 This = (*mode == 'w');
2165 taint_proper("Insecure %s%s", "EXEC");
2167 if (PerlProc_pipe(p) < 0)
2169 /* Try for another pipe pair for error return */
2170 if (PerlProc_pipe(pp) >= 0)
2172 while ((pid = PerlProc_fork()) < 0) {
2173 if (errno != EAGAIN) {
2174 PerlLIO_close(p[This]);
2175 PerlLIO_close(p[that]);
2177 PerlLIO_close(pp[0]);
2178 PerlLIO_close(pp[1]);
2190 /* Close parent's end of error status pipe (if any) */
2192 PerlLIO_close(pp[0]);
2193 #if defined(HAS_FCNTL) && defined(F_SETFD)
2194 /* Close error pipe automatically if exec works */
2195 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2198 /* Now dup our end of _the_ pipe to right position */
2199 if (p[THIS] != (*mode == 'r')) {
2200 PerlLIO_dup2(p[THIS], *mode == 'r');
2201 PerlLIO_close(p[THIS]);
2202 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2203 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2206 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2207 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2208 /* No automatic close - do it by hand */
2215 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2221 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2227 do_execfree(); /* free any memory malloced by child on fork */
2229 PerlLIO_close(pp[1]);
2230 /* Keep the lower of the two fd numbers */
2231 if (p[that] < p[This]) {
2232 PerlLIO_dup2(p[This], p[that]);
2233 PerlLIO_close(p[This]);
2237 PerlLIO_close(p[that]); /* close child's end of pipe */
2240 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2242 SvUPGRADE(sv,SVt_IV);
2244 PL_forkprocess = pid;
2245 /* If we managed to get status pipe check for exec fail */
2246 if (did_pipes && pid > 0) {
2251 while (n < sizeof(int)) {
2252 n1 = PerlLIO_read(pp[0],
2253 (void*)(((char*)&errkid)+n),
2259 PerlLIO_close(pp[0]);
2261 if (n) { /* Error */
2263 PerlLIO_close(p[This]);
2264 if (n != sizeof(int))
2265 Perl_croak(aTHX_ "panic: kid popen errno read");
2267 pid2 = wait4pid(pid, &status, 0);
2268 } while (pid2 == -1 && errno == EINTR);
2269 errno = errkid; /* Propagate errno from kid */
2274 PerlLIO_close(pp[0]);
2275 return PerlIO_fdopen(p[This], mode);
2277 Perl_croak(aTHX_ "List form of piped open not implemented");
2278 return (PerlIO *) NULL;
2282 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2283 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2285 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2289 register I32 This, that;
2292 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2296 PERL_FLUSHALL_FOR_CHILD;
2299 return my_syspopen(aTHX_ cmd,mode);
2302 This = (*mode == 'w');
2304 if (doexec && PL_tainting) {
2306 taint_proper("Insecure %s%s", "EXEC");
2308 if (PerlProc_pipe(p) < 0)
2310 if (doexec && PerlProc_pipe(pp) >= 0)
2312 while ((pid = PerlProc_fork()) < 0) {
2313 if (errno != EAGAIN) {
2314 PerlLIO_close(p[This]);
2315 PerlLIO_close(p[that]);
2317 PerlLIO_close(pp[0]);
2318 PerlLIO_close(pp[1]);
2321 Perl_croak(aTHX_ "Can't fork");
2334 PerlLIO_close(pp[0]);
2335 #if defined(HAS_FCNTL) && defined(F_SETFD)
2336 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2339 if (p[THIS] != (*mode == 'r')) {
2340 PerlLIO_dup2(p[THIS], *mode == 'r');
2341 PerlLIO_close(p[THIS]);
2342 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2343 PerlLIO_close(p[THAT]);
2346 PerlLIO_close(p[THAT]);
2349 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2356 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2361 /* may or may not use the shell */
2362 do_exec3(cmd, pp[1], did_pipes);
2365 #endif /* defined OS2 */
2366 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2367 SvREADONLY_off(GvSV(tmpgv));
2368 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2369 SvREADONLY_on(GvSV(tmpgv));
2371 #ifdef THREADS_HAVE_PIDS
2372 PL_ppid = (IV)getppid();
2375 #ifdef PERL_USES_PL_PIDSTATUS
2376 hv_clear(PL_pidstatus); /* we have no children */
2382 do_execfree(); /* free any memory malloced by child on vfork */
2384 PerlLIO_close(pp[1]);
2385 if (p[that] < p[This]) {
2386 PerlLIO_dup2(p[This], p[that]);
2387 PerlLIO_close(p[This]);
2391 PerlLIO_close(p[that]);
2394 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2396 SvUPGRADE(sv,SVt_IV);
2398 PL_forkprocess = pid;
2399 if (did_pipes && pid > 0) {
2404 while (n < sizeof(int)) {
2405 n1 = PerlLIO_read(pp[0],
2406 (void*)(((char*)&errkid)+n),
2412 PerlLIO_close(pp[0]);
2414 if (n) { /* Error */
2416 PerlLIO_close(p[This]);
2417 if (n != sizeof(int))
2418 Perl_croak(aTHX_ "panic: kid popen errno read");
2420 pid2 = wait4pid(pid, &status, 0);
2421 } while (pid2 == -1 && errno == EINTR);
2422 errno = errkid; /* Propagate errno from kid */
2427 PerlLIO_close(pp[0]);
2428 return PerlIO_fdopen(p[This], mode);
2431 #if defined(atarist) || defined(EPOC)
2434 Perl_my_popen(pTHX_ char *cmd, char *mode)
2436 PERL_FLUSHALL_FOR_CHILD;
2437 /* Call system's popen() to get a FILE *, then import it.
2438 used 0 for 2nd parameter to PerlIO_importFILE;
2441 return PerlIO_importFILE(popen(cmd, mode), 0);
2445 FILE *djgpp_popen();
2447 Perl_my_popen(pTHX_ char *cmd, char *mode)
2449 PERL_FLUSHALL_FOR_CHILD;
2450 /* Call system's popen() to get a FILE *, then import it.
2451 used 0 for 2nd parameter to PerlIO_importFILE;
2454 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2459 #endif /* !DOSISH */
2461 /* this is called in parent before the fork() */
2463 Perl_atfork_lock(void)
2466 #if defined(USE_ITHREADS)
2467 /* locks must be held in locking order (if any) */
2469 MUTEX_LOCK(&PL_malloc_mutex);
2475 /* this is called in both parent and child after the fork() */
2477 Perl_atfork_unlock(void)
2480 #if defined(USE_ITHREADS)
2481 /* locks must be released in same order as in atfork_lock() */
2483 MUTEX_UNLOCK(&PL_malloc_mutex);
2492 #if defined(HAS_FORK)
2494 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2499 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2500 * handlers elsewhere in the code */
2505 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2506 Perl_croak_nocontext("fork() not available");
2508 #endif /* HAS_FORK */
2513 Perl_dump_fds(pTHX_ char *s)
2518 PerlIO_printf(Perl_debug_log,"%s", s);
2519 for (fd = 0; fd < 32; fd++) {
2520 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2521 PerlIO_printf(Perl_debug_log," %d",fd);
2523 PerlIO_printf(Perl_debug_log,"\n");
2526 #endif /* DUMP_FDS */
2530 dup2(int oldfd, int newfd)
2532 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2535 PerlLIO_close(newfd);
2536 return fcntl(oldfd, F_DUPFD, newfd);
2538 #define DUP2_MAX_FDS 256
2539 int fdtmp[DUP2_MAX_FDS];
2545 PerlLIO_close(newfd);
2546 /* good enough for low fd's... */
2547 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2548 if (fdx >= DUP2_MAX_FDS) {
2556 PerlLIO_close(fdtmp[--fdx]);
2563 #ifdef HAS_SIGACTION
2565 #ifdef MACOS_TRADITIONAL
2566 /* We don't want restart behavior on MacOS */
2571 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2574 struct sigaction act, oact;
2577 /* only "parent" interpreter can diddle signals */
2578 if (PL_curinterp != aTHX)
2579 return (Sighandler_t) SIG_ERR;
2582 act.sa_handler = (void(*)(int))handler;
2583 sigemptyset(&act.sa_mask);
2586 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2587 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2589 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2590 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2591 act.sa_flags |= SA_NOCLDWAIT;
2593 if (sigaction(signo, &act, &oact) == -1)
2594 return (Sighandler_t) SIG_ERR;
2596 return (Sighandler_t) oact.sa_handler;
2600 Perl_rsignal_state(pTHX_ int signo)
2602 struct sigaction oact;
2603 PERL_UNUSED_CONTEXT;
2605 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2606 return (Sighandler_t) SIG_ERR;
2608 return (Sighandler_t) oact.sa_handler;
2612 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2615 struct sigaction act;
2618 /* only "parent" interpreter can diddle signals */
2619 if (PL_curinterp != aTHX)
2623 act.sa_handler = (void(*)(int))handler;
2624 sigemptyset(&act.sa_mask);
2627 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2628 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2630 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2631 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2632 act.sa_flags |= SA_NOCLDWAIT;
2634 return sigaction(signo, &act, save);
2638 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2642 /* only "parent" interpreter can diddle signals */
2643 if (PL_curinterp != aTHX)
2647 return sigaction(signo, save, (struct sigaction *)NULL);
2650 #else /* !HAS_SIGACTION */
2653 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2655 #if defined(USE_ITHREADS) && !defined(WIN32)
2656 /* only "parent" interpreter can diddle signals */
2657 if (PL_curinterp != aTHX)
2658 return (Sighandler_t) SIG_ERR;
2661 return PerlProc_signal(signo, handler);
2672 Perl_rsignal_state(pTHX_ int signo)
2675 Sighandler_t oldsig;
2677 #if defined(USE_ITHREADS) && !defined(WIN32)
2678 /* only "parent" interpreter can diddle signals */
2679 if (PL_curinterp != aTHX)
2680 return (Sighandler_t) SIG_ERR;
2684 oldsig = PerlProc_signal(signo, sig_trap);
2685 PerlProc_signal(signo, oldsig);
2687 PerlProc_kill(PerlProc_getpid(), signo);
2692 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2694 #if defined(USE_ITHREADS) && !defined(WIN32)
2695 /* only "parent" interpreter can diddle signals */
2696 if (PL_curinterp != aTHX)
2699 *save = PerlProc_signal(signo, handler);
2700 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2704 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2706 #if defined(USE_ITHREADS) && !defined(WIN32)
2707 /* only "parent" interpreter can diddle signals */
2708 if (PL_curinterp != aTHX)
2711 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2714 #endif /* !HAS_SIGACTION */
2715 #endif /* !PERL_MICRO */
2717 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2718 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2720 Perl_my_pclose(pTHX_ PerlIO *ptr)
2723 Sigsave_t hstat, istat, qstat;
2729 int saved_errno = 0;
2731 int saved_win32_errno;
2735 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2737 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2739 *svp = &PL_sv_undef;
2741 if (pid == -1) { /* Opened by popen. */
2742 return my_syspclose(ptr);
2745 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2746 saved_errno = errno;
2748 saved_win32_errno = GetLastError();
2752 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2755 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2756 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2757 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2760 pid2 = wait4pid(pid, &status, 0);
2761 } while (pid2 == -1 && errno == EINTR);
2763 rsignal_restore(SIGHUP, &hstat);
2764 rsignal_restore(SIGINT, &istat);
2765 rsignal_restore(SIGQUIT, &qstat);
2768 SETERRNO(saved_errno, 0);
2771 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2773 #endif /* !DOSISH */
2775 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2777 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2783 #ifdef PERL_USES_PL_PIDSTATUS
2786 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2787 pid, rather than a string form. */
2788 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2789 if (svp && *svp != &PL_sv_undef) {
2790 *statusp = SvIVX(*svp);
2791 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2799 hv_iterinit(PL_pidstatus);
2800 if ((entry = hv_iternext(PL_pidstatus))) {
2801 SV * const sv = hv_iterval(PL_pidstatus,entry);
2803 const char * const spid = hv_iterkey(entry,&len);
2805 assert (len == sizeof(Pid_t));
2806 memcpy((char *)&pid, spid, len);
2807 *statusp = SvIVX(sv);
2808 /* The hash iterator is currently on this entry, so simply
2809 calling hv_delete would trigger the lazy delete, which on
2810 aggregate does more work, beacuse next call to hv_iterinit()
2811 would spot the flag, and have to call the delete routine,
2812 while in the meantime any new entries can't re-use that
2814 hv_iterinit(PL_pidstatus);
2815 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2822 # ifdef HAS_WAITPID_RUNTIME
2823 if (!HAS_WAITPID_RUNTIME)
2826 result = PerlProc_waitpid(pid,statusp,flags);
2829 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2830 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2833 #ifdef PERL_USES_PL_PIDSTATUS
2834 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2839 Perl_croak(aTHX_ "Can't do waitpid with flags");
2841 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2842 pidgone(result,*statusp);
2848 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2851 if (result < 0 && errno == EINTR) {
2856 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2858 #ifdef PERL_USES_PL_PIDSTATUS
2860 Perl_pidgone(pTHX_ Pid_t pid, int status)
2864 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2865 SvUPGRADE(sv,SVt_IV);
2866 SvIV_set(sv, status);
2871 #if defined(atarist) || defined(OS2) || defined(EPOC)
2874 int /* Cannot prototype with I32
2876 my_syspclose(PerlIO *ptr)
2879 Perl_my_pclose(pTHX_ PerlIO *ptr)
2882 /* Needs work for PerlIO ! */
2883 FILE * const f = PerlIO_findFILE(ptr);
2884 const I32 result = pclose(f);
2885 PerlIO_releaseFILE(ptr,f);
2893 Perl_my_pclose(pTHX_ PerlIO *ptr)
2895 /* Needs work for PerlIO ! */
2896 FILE * const f = PerlIO_findFILE(ptr);
2897 I32 result = djgpp_pclose(f);
2898 result = (result << 8) & 0xff00;
2899 PerlIO_releaseFILE(ptr,f);
2905 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2908 register const char * const frombase = from;
2909 PERL_UNUSED_CONTEXT;
2912 register const char c = *from;
2917 while (count-- > 0) {
2918 for (todo = len; todo > 0; todo--) {
2927 Perl_same_dirent(pTHX_ const char *a, const char *b)
2929 char *fa = strrchr(a,'/');
2930 char *fb = strrchr(b,'/');
2933 SV * const tmpsv = sv_newmortal();
2946 sv_setpvn(tmpsv, ".", 1);
2948 sv_setpvn(tmpsv, a, fa - a);
2949 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2952 sv_setpvn(tmpsv, ".", 1);
2954 sv_setpvn(tmpsv, b, fb - b);
2955 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2957 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2958 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2960 #endif /* !HAS_RENAME */
2963 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2964 const char *const *const search_ext, I32 flags)
2967 const char *xfound = NULL;
2968 char *xfailed = NULL;
2969 char tmpbuf[MAXPATHLEN];
2973 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2974 # define SEARCH_EXTS ".bat", ".cmd", NULL
2975 # define MAX_EXT_LEN 4
2978 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2979 # define MAX_EXT_LEN 4
2982 # define SEARCH_EXTS ".pl", ".com", NULL
2983 # define MAX_EXT_LEN 4
2985 /* additional extensions to try in each dir if scriptname not found */
2987 static const char *const exts[] = { SEARCH_EXTS };
2988 const char *const *const ext = search_ext ? search_ext : exts;
2989 int extidx = 0, i = 0;
2990 const char *curext = NULL;
2992 PERL_UNUSED_ARG(search_ext);
2993 # define MAX_EXT_LEN 0
2997 * If dosearch is true and if scriptname does not contain path
2998 * delimiters, search the PATH for scriptname.
3000 * If SEARCH_EXTS is also defined, will look for each
3001 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3002 * while searching the PATH.
3004 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3005 * proceeds as follows:
3006 * If DOSISH or VMSISH:
3007 * + look for ./scriptname{,.foo,.bar}
3008 * + search the PATH for scriptname{,.foo,.bar}
3011 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3012 * this will not look in '.' if it's not in the PATH)
3017 # ifdef ALWAYS_DEFTYPES
3018 len = strlen(scriptname);
3019 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3020 int idx = 0, deftypes = 1;
3023 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3026 int idx = 0, deftypes = 1;
3029 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3031 /* The first time through, just add SEARCH_EXTS to whatever we
3032 * already have, so we can check for default file types. */
3034 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3040 if ((strlen(tmpbuf) + strlen(scriptname)
3041 + MAX_EXT_LEN) >= sizeof tmpbuf)
3042 continue; /* don't search dir with too-long name */
3043 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3047 if (strEQ(scriptname, "-"))
3049 if (dosearch) { /* Look in '.' first. */
3050 const char *cur = scriptname;
3052 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3054 if (strEQ(ext[i++],curext)) {
3055 extidx = -1; /* already has an ext */
3060 DEBUG_p(PerlIO_printf(Perl_debug_log,
3061 "Looking for %s\n",cur));
3062 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3063 && !S_ISDIR(PL_statbuf.st_mode)) {
3071 if (cur == scriptname) {
3072 len = strlen(scriptname);
3073 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3075 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3078 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3079 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3084 #ifdef MACOS_TRADITIONAL
3085 if (dosearch && !strchr(scriptname, ':') &&
3086 (s = PerlEnv_getenv("Commands")))
3088 if (dosearch && !strchr(scriptname, '/')
3090 && !strchr(scriptname, '\\')
3092 && (s = PerlEnv_getenv("PATH")))
3097 PL_bufend = s + strlen(s);
3098 while (s < PL_bufend) {
3099 #ifdef MACOS_TRADITIONAL
3100 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3104 #if defined(atarist) || defined(DOSISH)
3109 && *s != ';'; len++, s++) {
3110 if (len < sizeof tmpbuf)
3113 if (len < sizeof tmpbuf)
3115 #else /* ! (atarist || DOSISH) */
3116 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3119 #endif /* ! (atarist || DOSISH) */
3120 #endif /* MACOS_TRADITIONAL */
3123 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3124 continue; /* don't search dir with too-long name */
3125 #ifdef MACOS_TRADITIONAL
3126 if (len && tmpbuf[len - 1] != ':')
3127 tmpbuf[len++] = ':';
3130 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3131 && tmpbuf[len - 1] != '/'
3132 && tmpbuf[len - 1] != '\\'
3135 tmpbuf[len++] = '/';
3136 if (len == 2 && tmpbuf[0] == '.')
3139 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3143 len = strlen(tmpbuf);
3144 if (extidx > 0) /* reset after previous loop */
3148 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3149 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3150 if (S_ISDIR(PL_statbuf.st_mode)) {
3154 } while ( retval < 0 /* not there */
3155 && extidx>=0 && ext[extidx] /* try an extension? */
3156 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3161 if (S_ISREG(PL_statbuf.st_mode)
3162 && cando(S_IRUSR,TRUE,&PL_statbuf)
3163 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3164 && cando(S_IXUSR,TRUE,&PL_statbuf)
3168 xfound = tmpbuf; /* bingo! */
3172 xfailed = savepv(tmpbuf);
3175 if (!xfound && !seen_dot && !xfailed &&
3176 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3177 || S_ISDIR(PL_statbuf.st_mode)))
3179 seen_dot = 1; /* Disable message. */
3181 if (flags & 1) { /* do or die? */
3182 Perl_croak(aTHX_ "Can't %s %s%s%s",
3183 (xfailed ? "execute" : "find"),
3184 (xfailed ? xfailed : scriptname),
3185 (xfailed ? "" : " on PATH"),
3186 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3191 scriptname = xfound;
3193 return (scriptname ? savepv(scriptname) : NULL);
3196 #ifndef PERL_GET_CONTEXT_DEFINED
3199 Perl_get_context(void)
3202 #if defined(USE_ITHREADS)
3203 # ifdef OLD_PTHREADS_API
3205 if (pthread_getspecific(PL_thr_key, &t))
3206 Perl_croak_nocontext("panic: pthread_getspecific");
3209 # ifdef I_MACH_CTHREADS
3210 return (void*)cthread_data(cthread_self());
3212 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3221 Perl_set_context(void *t)
3224 #if defined(USE_ITHREADS)
3225 # ifdef I_MACH_CTHREADS
3226 cthread_set_data(cthread_self(), t);
3228 if (pthread_setspecific(PL_thr_key, t))
3229 Perl_croak_nocontext("panic: pthread_setspecific");
3236 #endif /* !PERL_GET_CONTEXT_DEFINED */
3238 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3247 Perl_get_op_names(pTHX)
3249 PERL_UNUSED_CONTEXT;
3250 return (char **)PL_op_name;
3254 Perl_get_op_descs(pTHX)
3256 PERL_UNUSED_CONTEXT;
3257 return (char **)PL_op_desc;
3261 Perl_get_no_modify(pTHX)
3263 PERL_UNUSED_CONTEXT;
3264 return PL_no_modify;
3268 Perl_get_opargs(pTHX)
3270 PERL_UNUSED_CONTEXT;
3271 return (U32 *)PL_opargs;
3275 Perl_get_ppaddr(pTHX)
3278 PERL_UNUSED_CONTEXT;
3279 return (PPADDR_t*)PL_ppaddr;
3282 #ifndef HAS_GETENV_LEN
3284 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3286 char * const env_trans = PerlEnv_getenv(env_elem);
3287 PERL_UNUSED_CONTEXT;
3289 *len = strlen(env_trans);
3296 Perl_get_vtbl(pTHX_ int vtbl_id)
3298 const MGVTBL* result;
3299 PERL_UNUSED_CONTEXT;
3303 result = &PL_vtbl_sv;
3306 result = &PL_vtbl_env;
3308 case want_vtbl_envelem:
3309 result = &PL_vtbl_envelem;
3312 result = &PL_vtbl_sig;
3314 case want_vtbl_sigelem:
3315 result = &PL_vtbl_sigelem;
3317 case want_vtbl_pack:
3318 result = &PL_vtbl_pack;
3320 case want_vtbl_packelem:
3321 result = &PL_vtbl_packelem;
3323 case want_vtbl_dbline:
3324 result = &PL_vtbl_dbline;
3327 result = &PL_vtbl_isa;
3329 case want_vtbl_isaelem:
3330 result = &PL_vtbl_isaelem;
3332 case want_vtbl_arylen:
3333 result = &PL_vtbl_arylen;
3335 case want_vtbl_mglob:
3336 result = &PL_vtbl_mglob;
3338 case want_vtbl_nkeys:
3339 result = &PL_vtbl_nkeys;
3341 case want_vtbl_taint:
3342 result = &PL_vtbl_taint;
3344 case want_vtbl_substr:
3345 result = &PL_vtbl_substr;
3348 result = &PL_vtbl_vec;
3351 result = &PL_vtbl_pos;
3354 result = &PL_vtbl_bm;
3357 result = &PL_vtbl_fm;
3359 case want_vtbl_uvar:
3360 result = &PL_vtbl_uvar;
3362 case want_vtbl_defelem:
3363 result = &PL_vtbl_defelem;
3365 case want_vtbl_regexp:
3366 result = &PL_vtbl_regexp;
3368 case want_vtbl_regdata:
3369 result = &PL_vtbl_regdata;
3371 case want_vtbl_regdatum:
3372 result = &PL_vtbl_regdatum;
3374 #ifdef USE_LOCALE_COLLATE
3375 case want_vtbl_collxfrm:
3376 result = &PL_vtbl_collxfrm;
3379 case want_vtbl_amagic:
3380 result = &PL_vtbl_amagic;
3382 case want_vtbl_amagicelem:
3383 result = &PL_vtbl_amagicelem;
3385 case want_vtbl_backref:
3386 result = &PL_vtbl_backref;
3388 case want_vtbl_utf8:
3389 result = &PL_vtbl_utf8;
3395 return (MGVTBL*)result;
3399 Perl_my_fflush_all(pTHX)
3401 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3402 return PerlIO_flush(NULL);
3404 # if defined(HAS__FWALK)
3405 extern int fflush(FILE *);
3406 /* undocumented, unprototyped, but very useful BSDism */
3407 extern void _fwalk(int (*)(FILE *));
3411 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3413 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3414 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3416 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3417 open_max = sysconf(_SC_OPEN_MAX);
3420 open_max = FOPEN_MAX;
3423 open_max = OPEN_MAX;
3434 for (i = 0; i < open_max; i++)
3435 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3436 STDIO_STREAM_ARRAY[i]._file < open_max &&
3437 STDIO_STREAM_ARRAY[i]._flag)
3438 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3442 SETERRNO(EBADF,RMS_IFI);
3449 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3451 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3453 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3454 if (ckWARN(WARN_IO)) {
3455 const char * const direction =
3456 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3458 Perl_warner(aTHX_ packWARN(WARN_IO),
3459 "Filehandle %s opened only for %sput",
3462 Perl_warner(aTHX_ packWARN(WARN_IO),
3463 "Filehandle opened only for %sput", direction);
3470 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3472 warn_type = WARN_CLOSED;
3476 warn_type = WARN_UNOPENED;
3479 if (ckWARN(warn_type)) {
3480 const char * const pars =
3481 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3482 const char * const func =
3484 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3485 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3486 op < 0 ? "" : /* handle phoney cases */
3488 const char * const type =
3490 (OP_IS_SOCKET(op) ||
3491 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3492 "socket" : "filehandle");
3493 if (name && *name) {
3494 Perl_warner(aTHX_ packWARN(warn_type),
3495 "%s%s on %s %s %s", func, pars, vile, type, name);
3496 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3498 aTHX_ packWARN(warn_type),
3499 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3504 Perl_warner(aTHX_ packWARN(warn_type),
3505 "%s%s on %s %s", func, pars, vile, type);
3506 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3508 aTHX_ packWARN(warn_type),
3509 "\t(Are you trying to call %s%s on dirhandle?)\n",
3518 /* in ASCII order, not that it matters */
3519 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3522 Perl_ebcdic_control(pTHX_ int ch)
3530 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3531 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3534 if (ctlp == controllablechars)
3535 return('\177'); /* DEL */
3537 return((unsigned char)(ctlp - controllablechars - 1));
3538 } else { /* Want uncontrol */
3539 if (ch == '\177' || ch == -1)
3541 else if (ch == '\157')
3543 else if (ch == '\174')
3545 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3547 else if (ch == '\155')
3549 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3550 return(controllablechars[ch+1]);
3552 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3557 /* To workaround core dumps from the uninitialised tm_zone we get the
3558 * system to give us a reasonable struct to copy. This fix means that
3559 * strftime uses the tm_zone and tm_gmtoff values returned by
3560 * localtime(time()). That should give the desired result most of the
3561 * time. But probably not always!
3563 * This does not address tzname aspects of NETaa14816.
3568 # ifndef STRUCT_TM_HASZONE
3569 # define STRUCT_TM_HASZONE
3573 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3574 # ifndef HAS_TM_TM_ZONE
3575 # define HAS_TM_TM_ZONE
3580 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3582 #ifdef HAS_TM_TM_ZONE
3584 const struct tm* my_tm;
3586 my_tm = localtime(&now);
3588 Copy(my_tm, ptm, 1, struct tm);
3590 PERL_UNUSED_ARG(ptm);
3595 * mini_mktime - normalise struct tm values without the localtime()
3596 * semantics (and overhead) of mktime().
3599 Perl_mini_mktime(pTHX_ struct tm *ptm)
3603 int month, mday, year, jday;
3604 int odd_cent, odd_year;
3605 PERL_UNUSED_CONTEXT;
3607 #define DAYS_PER_YEAR 365
3608 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3609 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3610 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3611 #define SECS_PER_HOUR (60*60)
3612 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3613 /* parentheses deliberately absent on these two, otherwise they don't work */
3614 #define MONTH_TO_DAYS 153/5
3615 #define DAYS_TO_MONTH 5/153
3616 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3617 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3618 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3619 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3622 * Year/day algorithm notes:
3624 * With a suitable offset for numeric value of the month, one can find
3625 * an offset into the year by considering months to have 30.6 (153/5) days,
3626 * using integer arithmetic (i.e., with truncation). To avoid too much
3627 * messing about with leap days, we consider January and February to be
3628 * the 13th and 14th month of the previous year. After that transformation,
3629 * we need the month index we use to be high by 1 from 'normal human' usage,
3630 * so the month index values we use run from 4 through 15.
3632 * Given that, and the rules for the Gregorian calendar (leap years are those
3633 * divisible by 4 unless also divisible by 100, when they must be divisible
3634 * by 400 instead), we can simply calculate the number of days since some
3635 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3636 * the days we derive from our month index, and adding in the day of the
3637 * month. The value used here is not adjusted for the actual origin which
3638 * it normally would use (1 January A.D. 1), since we're not exposing it.
3639 * We're only building the value so we can turn around and get the
3640 * normalised values for the year, month, day-of-month, and day-of-year.
3642 * For going backward, we need to bias the value we're using so that we find
3643 * the right year value. (Basically, we don't want the contribution of
3644 * March 1st to the number to apply while deriving the year). Having done
3645 * that, we 'count up' the contribution to the year number by accounting for
3646 * full quadracenturies (400-year periods) with their extra leap days, plus
3647 * the contribution from full centuries (to avoid counting in the lost leap
3648 * days), plus the contribution from full quad-years (to count in the normal
3649 * leap days), plus the leftover contribution from any non-leap years.
3650 * At this point, if we were working with an actual leap day, we'll have 0
3651 * days left over. This is also true for March 1st, however. So, we have
3652 * to special-case that result, and (earlier) keep track of the 'odd'
3653 * century and year contributions. If we got 4 extra centuries in a qcent,
3654 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3655 * Otherwise, we add back in the earlier bias we removed (the 123 from
3656 * figuring in March 1st), find the month index (integer division by 30.6),
3657 * and the remainder is the day-of-month. We then have to convert back to
3658 * 'real' months (including fixing January and February from being 14/15 in
3659 * the previous year to being in the proper year). After that, to get
3660 * tm_yday, we work with the normalised year and get a new yearday value for
3661 * January 1st, which we subtract from the yearday value we had earlier,
3662 * representing the date we've re-built. This is done from January 1
3663 * because tm_yday is 0-origin.
3665 * Since POSIX time routines are only guaranteed to work for times since the
3666 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3667 * applies Gregorian calendar rules even to dates before the 16th century
3668 * doesn't bother me. Besides, you'd need cultural context for a given
3669 * date to know whether it was Julian or Gregorian calendar, and that's
3670 * outside the scope for this routine. Since we convert back based on the
3671 * same rules we used to build the yearday, you'll only get strange results
3672 * for input which needed normalising, or for the 'odd' century years which
3673 * were leap years in the Julian calander but not in the Gregorian one.
3674 * I can live with that.
3676 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3677 * that's still outside the scope for POSIX time manipulation, so I don't
3681 year = 1900 + ptm->tm_year;
3682 month = ptm->tm_mon;
3683 mday = ptm->tm_mday;
3684 /* allow given yday with no month & mday to dominate the result */
3685 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3688 jday = 1 + ptm->tm_yday;
3697 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3698 yearday += month*MONTH_TO_DAYS + mday + jday;
3700 * Note that we don't know when leap-seconds were or will be,
3701 * so we have to trust the user if we get something which looks
3702 * like a sensible leap-second. Wild values for seconds will
3703 * be rationalised, however.
3705 if ((unsigned) ptm->tm_sec <= 60) {
3712 secs += 60 * ptm->tm_min;
3713 secs += SECS_PER_HOUR * ptm->tm_hour;
3715 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3716 /* got negative remainder, but need positive time */
3717 /* back off an extra day to compensate */
3718 yearday += (secs/SECS_PER_DAY)-1;
3719 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3722 yearday += (secs/SECS_PER_DAY);
3723 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3726 else if (secs >= SECS_PER_DAY) {
3727 yearday += (secs/SECS_PER_DAY);
3728 secs %= SECS_PER_DAY;
3730 ptm->tm_hour = secs/SECS_PER_HOUR;
3731 secs %= SECS_PER_HOUR;
3732 ptm->tm_min = secs/60;
3734 ptm->tm_sec += secs;
3735 /* done with time of day effects */
3737 * The algorithm for yearday has (so far) left it high by 428.
3738 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3739 * bias it by 123 while trying to figure out what year it
3740 * really represents. Even with this tweak, the reverse
3741 * translation fails for years before A.D. 0001.
3742 * It would still fail for Feb 29, but we catch that one below.
3744 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3745 yearday -= YEAR_ADJUST;
3746 year = (yearday / DAYS_PER_QCENT) * 400;
3747 yearday %= DAYS_PER_QCENT;
3748 odd_cent = yearday / DAYS_PER_CENT;
3749 year += odd_cent * 100;
3750 yearday %= DAYS_PER_CENT;
3751 year += (yearday / DAYS_PER_QYEAR) * 4;
3752 yearday %= DAYS_PER_QYEAR;
3753 odd_year = yearday / DAYS_PER_YEAR;
3755 yearday %= DAYS_PER_YEAR;
3756 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3761 yearday += YEAR_ADJUST; /* recover March 1st crock */
3762 month = yearday*DAYS_TO_MONTH;
3763 yearday -= month*MONTH_TO_DAYS;
3764 /* recover other leap-year adjustment */
3773 ptm->tm_year = year - 1900;
3775 ptm->tm_mday = yearday;
3776 ptm->tm_mon = month;
3780 ptm->tm_mon = month - 1;
3782 /* re-build yearday based on Jan 1 to get tm_yday */
3784 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3785 yearday += 14*MONTH_TO_DAYS + 1;
3786 ptm->tm_yday = jday - yearday;
3787 /* fix tm_wday if not overridden by caller */
3788 if ((unsigned)ptm->tm_wday > 6)
3789 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3793 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)
3801 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3804 mytm.tm_hour = hour;
3805 mytm.tm_mday = mday;
3807 mytm.tm_year = year;
3808 mytm.tm_wday = wday;
3809 mytm.tm_yday = yday;
3810 mytm.tm_isdst = isdst;
3812 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3813 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3818 #ifdef HAS_TM_TM_GMTOFF
3819 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3821 #ifdef HAS_TM_TM_ZONE
3822 mytm.tm_zone = mytm2.tm_zone;
3827 Newx(buf, buflen, char);
3828 len = strftime(buf, buflen, fmt, &mytm);
3830 ** The following is needed to handle to the situation where
3831 ** tmpbuf overflows. Basically we want to allocate a buffer
3832 ** and try repeatedly. The reason why it is so complicated
3833 ** is that getting a return value of 0 from strftime can indicate
3834 ** one of the following:
3835 ** 1. buffer overflowed,
3836 ** 2. illegal conversion specifier, or
3837 ** 3. the format string specifies nothing to be returned(not
3838 ** an error). This could be because format is an empty string
3839 ** or it specifies %p that yields an empty string in some locale.
3840 ** If there is a better way to make it portable, go ahead by
3843 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3846 /* Possibly buf overflowed - try again with a bigger buf */
3847 const int fmtlen = strlen(fmt);
3848 const int bufsize = fmtlen + buflen;
3850 Newx(buf, bufsize, char);
3852 buflen = strftime(buf, bufsize, fmt, &mytm);
3853 if (buflen > 0 && buflen < bufsize)
3855 /* heuristic to prevent out-of-memory errors */
3856 if (bufsize > 100*fmtlen) {
3861 Renew(buf, bufsize*2, char);
3866 Perl_croak(aTHX_ "panic: no strftime");
3872 #define SV_CWD_RETURN_UNDEF \
3873 sv_setsv(sv, &PL_sv_undef); \
3876 #define SV_CWD_ISDOT(dp) \
3877 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3878 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3881 =head1 Miscellaneous Functions
3883 =for apidoc getcwd_sv
3885 Fill the sv with current working directory
3890 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3891 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3892 * getcwd(3) if available
3893 * Comments from the orignal:
3894 * This is a faster version of getcwd. It's also more dangerous
3895 * because you might chdir out of a directory that you can't chdir
3899 Perl_getcwd_sv(pTHX_ register SV *sv)
3903 #ifndef INCOMPLETE_TAINTS
3909 char buf[MAXPATHLEN];
3911 /* Some getcwd()s automatically allocate a buffer of the given
3912 * size from the heap if they are given a NULL buffer pointer.
3913 * The problem is that this behaviour is not portable. */
3914 if (getcwd(buf, sizeof(buf) - 1)) {
3919 sv_setsv(sv, &PL_sv_undef);
3927 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3931 SvUPGRADE(sv, SVt_PV);
3933 if (PerlLIO_lstat(".", &statbuf) < 0) {
3934 SV_CWD_RETURN_UNDEF;
3937 orig_cdev = statbuf.st_dev;
3938 orig_cino = statbuf.st_ino;
3947 if (PerlDir_chdir("..") < 0) {
3948 SV_CWD_RETURN_UNDEF;
3950 if (PerlLIO_stat(".", &statbuf) < 0) {
3951 SV_CWD_RETURN_UNDEF;
3954 cdev = statbuf.st_dev;
3955 cino = statbuf.st_ino;
3957 if (odev == cdev && oino == cino) {
3960 if (!(dir = PerlDir_open("."))) {
3961 SV_CWD_RETURN_UNDEF;
3964 while ((dp = PerlDir_read(dir)) != NULL) {
3966 const int namelen = dp->d_namlen;
3968 const int namelen = strlen(dp->d_name);
3971 if (SV_CWD_ISDOT(dp)) {
3975 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3976 SV_CWD_RETURN_UNDEF;
3979 tdev = statbuf.st_dev;
3980 tino = statbuf.st_ino;
3981 if (tino == oino && tdev == odev) {
3987 SV_CWD_RETURN_UNDEF;
3990 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3991 SV_CWD_RETURN_UNDEF;
3994 SvGROW(sv, pathlen + namelen + 1);
3998 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4001 /* prepend current directory to the front */
4003 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4004 pathlen += (namelen + 1);
4006 #ifdef VOID_CLOSEDIR
4009 if (PerlDir_close(dir) < 0) {
4010 SV_CWD_RETURN_UNDEF;
4016 SvCUR_set(sv, pathlen);
4020 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4021 SV_CWD_RETURN_UNDEF;
4024 if (PerlLIO_stat(".", &statbuf) < 0) {
4025 SV_CWD_RETURN_UNDEF;
4028 cdev = statbuf.st_dev;
4029 cino = statbuf.st_ino;
4031 if (cdev != orig_cdev || cino != orig_cino) {
4032 Perl_croak(aTHX_ "Unstable directory path, "
4033 "current directory changed unexpectedly");
4045 =for apidoc scan_version
4047 Returns a pointer to the next character after the parsed
4048 version string, as well as upgrading the passed in SV to
4051 Function must be called with an already existing SV like
4054 s = scan_version(s,SV *sv, bool qv);
4056 Performs some preprocessing to the string to ensure that
4057 it has the correct characteristics of a version. Flags the
4058 object if it contains an underscore (which denotes this
4059 is a alpha version). The boolean qv denotes that the version
4060 should be interpreted as if it had multiple decimals, even if
4067 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4075 AV * const av = newAV();
4076 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4077 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4079 #ifndef NODEFAULT_SHAREKEYS
4080 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4083 while (isSPACE(*s)) /* leading whitespace is OK */
4087 s++; /* get past 'v' */
4088 qv = 1; /* force quoted version processing */
4091 start = last = pos = s;
4093 /* pre-scan the input string to check for decimals/underbars */
4094 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4099 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4103 else if ( *pos == '_' )
4106 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4108 width = pos - last - 1; /* natural width of sub-version */
4113 if ( alpha && !saw_period )
4114 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4116 if ( saw_period > 1 )
4117 qv = 1; /* force quoted version processing */
4122 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4124 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4125 if ( !qv && width < 3 )
4126 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4128 while (isDIGIT(*pos))
4130 if (!isALPHA(*pos)) {
4136 /* this is atoi() that delimits on underscores */
4137 const char *end = pos;
4141 /* the following if() will only be true after the decimal
4142 * point of a version originally created with a bare
4143 * floating point number, i.e. not quoted in any way
4145 if ( !qv && s > start && saw_period == 1 ) {
4149 rev += (*s - '0') * mult;
4151 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4152 Perl_croak(aTHX_ "Integer overflow in version");
4159 while (--end >= s) {
4161 rev += (*end - '0') * mult;
4163 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4164 Perl_croak(aTHX_ "Integer overflow in version");
4169 /* Append revision */
4170 av_push(av, newSViv(rev));
4173 else if ( *pos == '_' && isDIGIT(pos[1]) )
4175 else if ( isDIGIT(*pos) )
4182 while ( isDIGIT(*pos) )
4187 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4195 if ( qv ) { /* quoted versions always get at least three terms*/
4196 I32 len = av_len(av);
4197 /* This for loop appears to trigger a compiler bug on OS X, as it
4198 loops infinitely. Yes, len is negative. No, it makes no sense.
4199 Compiler in question is:
4200 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4201 for ( len = 2 - len; len > 0; len-- )
4202 av_push((AV *)sv, newSViv(0));
4206 av_push(av, newSViv(0));
4209 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4210 av_push(av, newSViv(0));
4212 /* fix RT#19517 - special case 'undef' as string */
4213 if ( *s == 'u' && strEQ(s,"undef") ) {
4217 /* And finally, store the AV in the hash */
4218 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4223 =for apidoc new_version
4225 Returns a new version object based on the passed in SV:
4227 SV *sv = new_version(SV *ver);
4229 Does not alter the passed in ver SV. See "upg_version" if you
4230 want to upgrade the SV.
4236 Perl_new_version(pTHX_ SV *ver)
4239 SV * const rv = newSV(0);
4240 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4243 AV * const av = newAV();
4245 /* This will get reblessed later if a derived class*/
4246 SV * const hv = newSVrv(rv, "version");
4247 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4248 #ifndef NODEFAULT_SHAREKEYS
4249 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4255 /* Begin copying all of the elements */
4256 if ( hv_exists((HV *)ver, "qv", 2) )
4257 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4259 if ( hv_exists((HV *)ver, "alpha", 5) )
4260 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4262 if ( hv_exists((HV*)ver, "width", 5 ) )
4264 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4265 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4268 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4269 /* This will get reblessed later if a derived class*/
4270 for ( key = 0; key <= av_len(sav); key++ )
4272 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4273 av_push(av, newSViv(rev));
4276 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4281 const MAGIC* const mg = SvVSTRING_mg(ver);
4282 if ( mg ) { /* already a v-string */
4283 const STRLEN len = mg->mg_len;
4284 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4285 sv_setpvn(rv,version,len);
4290 sv_setsv(rv,ver); /* make a duplicate */
4295 return upg_version(rv);
4299 =for apidoc upg_version
4301 In-place upgrade of the supplied SV to a version object.
4303 SV *sv = upg_version(SV *sv);
4305 Returns a pointer to the upgraded SV.
4311 Perl_upg_version(pTHX_ SV *ver)
4313 const char *version, *s;
4319 if ( SvNOK(ver) ) /* may get too much accuracy */
4322 SET_NUMERIC_STANDARD();
4323 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4324 SET_NUMERIC_LOCAL();
4325 while (tbuf[len-1] == '0' && len > 0) len--;
4326 version = savepvn(tbuf, len);
4329 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4330 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4334 else /* must be a string or something like a string */
4336 version = savepv(SvPV_nolen(ver));
4339 s = scan_version(version, ver, qv);
4341 if(ckWARN(WARN_MISC))
4342 Perl_warner(aTHX_ packWARN(WARN_MISC),
4343 "Version string '%s' contains invalid data; "
4344 "ignoring: '%s'", version, s);
4352 Validates that the SV contains a valid version object.
4354 bool vverify(SV *vobj);
4356 Note that it only confirms the bare minimum structure (so as not to get
4357 confused by derived classes which may contain additional hash entries):
4361 =item * The SV contains a [reference to a] hash
4363 =item * The hash contains a "version" key
4365 =item * The "version" key has [a reference to] an AV as its value
4373 Perl_vverify(pTHX_ SV *vs)
4379 /* see if the appropriate elements exist */
4380 if ( SvTYPE(vs) == SVt_PVHV
4381 && hv_exists((HV*)vs, "version", 7)
4382 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4383 && SvTYPE(sv) == SVt_PVAV )
4392 Accepts a version object and returns the normalized floating
4393 point representation. Call like:
4397 NOTE: you can pass either the object directly or the SV
4398 contained within the RV.
4404 Perl_vnumify(pTHX_ SV *vs)
4409 SV * const sv = newSV(0);
4415 Perl_croak(aTHX_ "Invalid version object");
4417 /* see if various flags exist */
4418 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4420 if ( hv_exists((HV*)vs, "width", 5 ) )
4421 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4426 /* attempt to retrieve the version array */
4427 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4439 digit = SvIV(*av_fetch(av, 0, 0));
4440 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4441 for ( i = 1 ; i < len ; i++ )
4443 digit = SvIV(*av_fetch(av, i, 0));
4445 const int denom = (width == 2 ? 10 : 100);
4446 const div_t term = div((int)PERL_ABS(digit),denom);
4447 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4450 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4456 digit = SvIV(*av_fetch(av, len, 0));
4457 if ( alpha && width == 3 ) /* alpha version */
4459 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4463 sv_catpvs(sv, "000");
4471 Accepts a version object and returns the normalized string
4472 representation. Call like:
4476 NOTE: you can pass either the object directly or the SV
4477 contained within the RV.
4483 Perl_vnormal(pTHX_ SV *vs)
4487 SV * const sv = newSV(0);
4493 Perl_croak(aTHX_ "Invalid version object");
4495 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4497 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4505 digit = SvIV(*av_fetch(av, 0, 0));
4506 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4507 for ( i = 1 ; i < len ; i++ ) {
4508 digit = SvIV(*av_fetch(av, i, 0));
4509 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4514 /* handle last digit specially */
4515 digit = SvIV(*av_fetch(av, len, 0));
4517 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4519 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4522 if ( len <= 2 ) { /* short version, must be at least three */
4523 for ( len = 2 - len; len != 0; len-- )
4530 =for apidoc vstringify
4532 In order to maintain maximum compatibility with earlier versions
4533 of Perl, this function will return either the floating point
4534 notation or the multiple dotted notation, depending on whether
4535 the original version contained 1 or more dots, respectively
4541 Perl_vstringify(pTHX_ SV *vs)
4547 Perl_croak(aTHX_ "Invalid version object");
4549 if ( hv_exists((HV *)vs, "qv", 2) )
4558 Version object aware cmp. Both operands must already have been
4559 converted into version objects.
4565 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4568 bool lalpha = FALSE;
4569 bool ralpha = FALSE;
4578 if ( !vverify(lhv) )
4579 Perl_croak(aTHX_ "Invalid version object");
4581 if ( !vverify(rhv) )
4582 Perl_croak(aTHX_ "Invalid version object");
4584 /* get the left hand term */
4585 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4586 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4589 /* and the right hand term */
4590 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4591 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4599 while ( i <= m && retval == 0 )
4601 left = SvIV(*av_fetch(lav,i,0));
4602 right = SvIV(*av_fetch(rav,i,0));
4610 /* tiebreaker for alpha with identical terms */
4611 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4613 if ( lalpha && !ralpha )
4617 else if ( ralpha && !lalpha)
4623 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4627 while ( i <= r && retval == 0 )
4629 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4630 retval = -1; /* not a match after all */
4636 while ( i <= l && retval == 0 )
4638 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4639 retval = +1; /* not a match after all */
4647 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4648 # define EMULATE_SOCKETPAIR_UDP
4651 #ifdef EMULATE_SOCKETPAIR_UDP
4653 S_socketpair_udp (int fd[2]) {
4655 /* Fake a datagram socketpair using UDP to localhost. */
4656 int sockets[2] = {-1, -1};
4657 struct sockaddr_in addresses[2];
4659 Sock_size_t size = sizeof(struct sockaddr_in);
4660 unsigned short port;
4663 memset(&addresses, 0, sizeof(addresses));
4666 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4667 if (sockets[i] == -1)
4668 goto tidy_up_and_fail;
4670 addresses[i].sin_family = AF_INET;
4671 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4672 addresses[i].sin_port = 0; /* kernel choses port. */
4673 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4674 sizeof(struct sockaddr_in)) == -1)
4675 goto tidy_up_and_fail;
4678 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4679 for each connect the other socket to it. */
4682 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4684 goto tidy_up_and_fail;
4685 if (size != sizeof(struct sockaddr_in))
4686 goto abort_tidy_up_and_fail;
4687 /* !1 is 0, !0 is 1 */
4688 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4689 sizeof(struct sockaddr_in)) == -1)
4690 goto tidy_up_and_fail;
4693 /* Now we have 2 sockets connected to each other. I don't trust some other
4694 process not to have already sent a packet to us (by random) so send
4695 a packet from each to the other. */
4698 /* I'm going to send my own port number. As a short.
4699 (Who knows if someone somewhere has sin_port as a bitfield and needs
4700 this routine. (I'm assuming crays have socketpair)) */
4701 port = addresses[i].sin_port;
4702 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4703 if (got != sizeof(port)) {
4705 goto tidy_up_and_fail;
4706 goto abort_tidy_up_and_fail;
4710 /* Packets sent. I don't trust them to have arrived though.
4711 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4712 connect to localhost will use a second kernel thread. In 2.6 the
4713 first thread running the connect() returns before the second completes,
4714 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4715 returns 0. Poor programs have tripped up. One poor program's authors'
4716 had a 50-1 reverse stock split. Not sure how connected these were.)
4717 So I don't trust someone not to have an unpredictable UDP stack.
4721 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4722 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4726 FD_SET((unsigned int)sockets[0], &rset);
4727 FD_SET((unsigned int)sockets[1], &rset);
4729 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4730 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4731 || !FD_ISSET(sockets[1], &rset)) {
4732 /* I hope this is portable and appropriate. */
4734 goto tidy_up_and_fail;
4735 goto abort_tidy_up_and_fail;
4739 /* And the paranoia department even now doesn't trust it to have arrive
4740 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4742 struct sockaddr_in readfrom;
4743 unsigned short buffer[2];
4748 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4749 sizeof(buffer), MSG_DONTWAIT,
4750 (struct sockaddr *) &readfrom, &size);
4752 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4754 (struct sockaddr *) &readfrom, &size);
4758 goto tidy_up_and_fail;
4759 if (got != sizeof(port)
4760 || size != sizeof(struct sockaddr_in)
4761 /* Check other socket sent us its port. */
4762 || buffer[0] != (unsigned short) addresses[!i].sin_port
4763 /* Check kernel says we got the datagram from that socket */
4764 || readfrom.sin_family != addresses[!i].sin_family
4765 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4766 || readfrom.sin_port != addresses[!i].sin_port)
4767 goto abort_tidy_up_and_fail;
4770 /* My caller (my_socketpair) has validated that this is non-NULL */
4773 /* I hereby declare this connection open. May God bless all who cross
4777 abort_tidy_up_and_fail:
4778 errno = ECONNABORTED;
4781 const int save_errno = errno;
4782 if (sockets[0] != -1)
4783 PerlLIO_close(sockets[0]);
4784 if (sockets[1] != -1)
4785 PerlLIO_close(sockets[1]);
4790 #endif /* EMULATE_SOCKETPAIR_UDP */
4792 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4794 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4795 /* Stevens says that family must be AF_LOCAL, protocol 0.
4796 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4801 struct sockaddr_in listen_addr;
4802 struct sockaddr_in connect_addr;
4807 || family != AF_UNIX
4810 errno = EAFNOSUPPORT;
4818 #ifdef EMULATE_SOCKETPAIR_UDP
4819 if (type == SOCK_DGRAM)
4820 return S_socketpair_udp(fd);
4823 listener = PerlSock_socket(AF_INET, type, 0);
4826 memset(&listen_addr, 0, sizeof(listen_addr));
4827 listen_addr.sin_family = AF_INET;
4828 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4829 listen_addr.sin_port = 0; /* kernel choses port. */
4830 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4831 sizeof(listen_addr)) == -1)
4832 goto tidy_up_and_fail;
4833 if (PerlSock_listen(listener, 1) == -1)
4834 goto tidy_up_and_fail;
4836 connector = PerlSock_socket(AF_INET, type, 0);
4837 if (connector == -1)
4838 goto tidy_up_and_fail;
4839 /* We want to find out the port number to connect to. */
4840 size = sizeof(connect_addr);
4841 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4843 goto tidy_up_and_fail;
4844 if (size != sizeof(connect_addr))
4845 goto abort_tidy_up_and_fail;
4846 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4847 sizeof(connect_addr)) == -1)
4848 goto tidy_up_and_fail;
4850 size = sizeof(listen_addr);
4851 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4854 goto tidy_up_and_fail;
4855 if (size != sizeof(listen_addr))
4856 goto abort_tidy_up_and_fail;
4857 PerlLIO_close(listener);
4858 /* Now check we are talking to ourself by matching port and host on the
4860 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4862 goto tidy_up_and_fail;
4863 if (size != sizeof(connect_addr)
4864 || listen_addr.sin_family != connect_addr.sin_family
4865 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4866 || listen_addr.sin_port != connect_addr.sin_port) {
4867 goto abort_tidy_up_and_fail;
4873 abort_tidy_up_and_fail:
4875 errno = ECONNABORTED; /* This would be the standard thing to do. */
4877 # ifdef ECONNREFUSED
4878 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4880 errno = ETIMEDOUT; /* Desperation time. */
4885 const int save_errno = errno;
4887 PerlLIO_close(listener);
4888 if (connector != -1)
4889 PerlLIO_close(connector);
4891 PerlLIO_close(acceptor);
4897 /* In any case have a stub so that there's code corresponding
4898 * to the my_socketpair in global.sym. */
4900 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4901 #ifdef HAS_SOCKETPAIR
4902 return socketpair(family, type, protocol, fd);
4911 =for apidoc sv_nosharing
4913 Dummy routine which "shares" an SV when there is no sharing module present.
4914 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4915 Exists to avoid test for a NULL function pointer and because it could
4916 potentially warn under some level of strict-ness.
4922 Perl_sv_nosharing(pTHX_ SV *sv)
4924 PERL_UNUSED_CONTEXT;
4925 PERL_UNUSED_ARG(sv);
4929 Perl_parse_unicode_opts(pTHX_ const char **popt)
4931 const char *p = *popt;
4936 opt = (U32) atoi(p);
4939 if (*p && *p != '\n' && *p != '\r')
4940 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4945 case PERL_UNICODE_STDIN:
4946 opt |= PERL_UNICODE_STDIN_FLAG; break;
4947 case PERL_UNICODE_STDOUT:
4948 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4949 case PERL_UNICODE_STDERR:
4950 opt |= PERL_UNICODE_STDERR_FLAG; break;
4951 case PERL_UNICODE_STD:
4952 opt |= PERL_UNICODE_STD_FLAG; break;
4953 case PERL_UNICODE_IN:
4954 opt |= PERL_UNICODE_IN_FLAG; break;
4955 case PERL_UNICODE_OUT:
4956 opt |= PERL_UNICODE_OUT_FLAG; break;
4957 case PERL_UNICODE_INOUT:
4958 opt |= PERL_UNICODE_INOUT_FLAG; break;
4959 case PERL_UNICODE_LOCALE:
4960 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4961 case PERL_UNICODE_ARGV:
4962 opt |= PERL_UNICODE_ARGV_FLAG; break;
4963 case PERL_UNICODE_UTF8CACHEASSERT:
4964 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4966 if (*p != '\n' && *p != '\r')
4968 "Unknown Unicode option letter '%c'", *p);
4974 opt = PERL_UNICODE_DEFAULT_FLAGS;
4976 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4977 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4978 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4990 * This is really just a quick hack which grabs various garbage
4991 * values. It really should be a real hash algorithm which
4992 * spreads the effect of every input bit onto every output bit,
4993 * if someone who knows about such things would bother to write it.
4994 * Might be a good idea to add that function to CORE as well.
4995 * No numbers below come from careful analysis or anything here,
4996 * except they are primes and SEED_C1 > 1E6 to get a full-width
4997 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4998 * probably be bigger too.
5001 # define SEED_C1 1000003
5002 #define SEED_C4 73819
5004 # define SEED_C1 25747
5005 #define SEED_C4 20639
5009 #define SEED_C5 26107
5011 #ifndef PERL_NO_DEV_RANDOM
5016 # include <starlet.h>
5017 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5018 * in 100-ns units, typically incremented ever 10 ms. */
5019 unsigned int when[2];
5021 # ifdef HAS_GETTIMEOFDAY
5022 struct timeval when;
5028 /* This test is an escape hatch, this symbol isn't set by Configure. */
5029 #ifndef PERL_NO_DEV_RANDOM
5030 #ifndef PERL_RANDOM_DEVICE
5031 /* /dev/random isn't used by default because reads from it will block
5032 * if there isn't enough entropy available. You can compile with
5033 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5034 * is enough real entropy to fill the seed. */
5035 # define PERL_RANDOM_DEVICE "/dev/urandom"
5037 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5039 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5048 _ckvmssts(sys$gettim(when));
5049 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5051 # ifdef HAS_GETTIMEOFDAY
5052 PerlProc_gettimeofday(&when,NULL);
5053 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5056 u = (U32)SEED_C1 * when;
5059 u += SEED_C3 * (U32)PerlProc_getpid();
5060 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5061 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5062 u += SEED_C5 * (U32)PTR2UV(&when);
5068 Perl_get_hash_seed(pTHX)
5071 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5077 if (s && isDIGIT(*s))
5078 myseed = (UV)Atoul(s);
5080 #ifdef USE_HASH_SEED_EXPLICIT
5084 /* Compute a random seed */
5085 (void)seedDrand01((Rand_seed_t)seed());
5086 myseed = (UV)(Drand01() * (NV)UV_MAX);
5087 #if RANDBITS < (UVSIZE * 8)
5088 /* Since there are not enough randbits to to reach all
5089 * the bits of a UV, the low bits might need extra
5090 * help. Sum in another random number that will
5091 * fill in the low bits. */
5093 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5094 #endif /* RANDBITS < (UVSIZE * 8) */
5095 if (myseed == 0) { /* Superparanoia. */
5096 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5098 Perl_croak(aTHX_ "Your random numbers are not that random");
5101 PL_rehash_seed_set = TRUE;
5108 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5110 const char * const stashpv = CopSTASHPV(c);
5111 const char * const name = HvNAME_get(hv);
5112 PERL_UNUSED_CONTEXT;
5114 if (stashpv == name)
5116 if (stashpv && name)
5117 if (strEQ(stashpv, name))
5124 #ifdef PERL_GLOBAL_STRUCT
5127 Perl_init_global_struct(pTHX)
5129 struct perl_vars *plvarsp = NULL;
5130 #ifdef PERL_GLOBAL_STRUCT
5131 # define PERL_GLOBAL_STRUCT_INIT
5132 # include "opcode.h" /* the ppaddr and check */
5133 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5134 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5135 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5136 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5137 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5141 plvarsp = PL_VarsPtr;
5142 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5148 # define PERLVAR(var,type) /**/
5149 # define PERLVARA(var,n,type) /**/
5150 # define PERLVARI(var,type,init) plvarsp->var = init;
5151 # define PERLVARIC(var,type,init) plvarsp->var = init;
5152 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5153 # include "perlvars.h"
5159 # ifdef PERL_GLOBAL_STRUCT
5160 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5161 if (!plvarsp->Gppaddr)
5163 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5164 if (!plvarsp->Gcheck)
5166 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5167 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5169 # ifdef PERL_SET_VARS
5170 PERL_SET_VARS(plvarsp);
5172 # undef PERL_GLOBAL_STRUCT_INIT
5177 #endif /* PERL_GLOBAL_STRUCT */
5179 #ifdef PERL_GLOBAL_STRUCT
5182 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5184 #ifdef PERL_GLOBAL_STRUCT
5185 # ifdef PERL_UNSET_VARS
5186 PERL_UNSET_VARS(plvarsp);
5188 free(plvarsp->Gppaddr);
5189 free(plvarsp->Gcheck);
5190 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5196 #endif /* PERL_GLOBAL_STRUCT */
5201 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5203 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5204 * variable PERL_MEM_LOG will be consulted, and if the integer value
5205 * of that is true, the logging will happen. (The default is to
5206 * always log if the PERL_MEM_LOG define was in effect.)
5210 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5211 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5213 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5216 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5217 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5218 * in which case the environment variable PERL_MEM_LOG_FD will be
5219 * consulted for the file descriptor number to use.
5221 #ifndef PERL_MEM_LOG_FD
5222 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5226 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)
5228 #ifdef PERL_MEM_LOG_STDERR
5229 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5232 # ifdef PERL_MEM_LOG_ENV
5233 s = getenv("PERL_MEM_LOG");
5234 if (s ? atoi(s) : 0)
5237 /* We can't use SVs or PerlIO for obvious reasons,
5238 * so we'll use stdio and low-level IO instead. */
5239 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5240 # ifdef PERL_MEM_LOG_TIMESTAMP
5242 # ifdef HAS_GETTIMEOFDAY
5243 gettimeofday(&tv, 0);
5245 /* If there are other OS specific ways of hires time than
5246 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5247 * probably that they would be used to fill in the struct
5254 # ifdef PERL_MEM_LOG_TIMESTAMP
5257 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5258 " %s = %"IVdf": %"UVxf"\n",
5259 # ifdef PERL_MEM_LOG_TIMESTAMP
5260 (int)tv.tv_sec, (int)tv.tv_usec,
5262 filename, linenumber, funcname, n, typesize,
5263 typename, n * typesize, PTR2UV(newalloc));
5264 # ifdef PERL_MEM_LOG_ENV_FD
5265 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5266 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5268 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5277 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)
5279 #ifdef PERL_MEM_LOG_STDERR
5280 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5283 # ifdef PERL_MEM_LOG_ENV
5284 s = PerlEnv_getenv("PERL_MEM_LOG");
5285 if (s ? atoi(s) : 0)
5288 /* We can't use SVs or PerlIO for obvious reasons,
5289 * so we'll use stdio and low-level IO instead. */
5290 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5291 # ifdef PERL_MEM_LOG_TIMESTAMP
5293 gettimeofday(&tv, 0);
5299 # ifdef PERL_MEM_LOG_TIMESTAMP
5302 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5303 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5304 # ifdef PERL_MEM_LOG_TIMESTAMP
5305 (int)tv.tv_sec, (int)tv.tv_usec,
5307 filename, linenumber, funcname, n, typesize,
5308 typename, n * typesize, PTR2UV(oldalloc),
5310 # ifdef PERL_MEM_LOG_ENV_FD
5311 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5312 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5314 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5323 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5325 #ifdef PERL_MEM_LOG_STDERR
5326 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5329 # ifdef PERL_MEM_LOG_ENV
5330 s = PerlEnv_getenv("PERL_MEM_LOG");
5331 if (s ? atoi(s) : 0)
5334 /* We can't use SVs or PerlIO for obvious reasons,
5335 * so we'll use stdio and low-level IO instead. */
5336 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5337 # ifdef PERL_MEM_LOG_TIMESTAMP
5339 gettimeofday(&tv, 0);
5345 # ifdef PERL_MEM_LOG_TIMESTAMP
5348 "free: %s:%d:%s: %"UVxf"\n",
5349 # ifdef PERL_MEM_LOG_TIMESTAMP
5350 (int)tv.tv_sec, (int)tv.tv_usec,
5352 filename, linenumber, funcname,
5354 # ifdef PERL_MEM_LOG_ENV_FD
5355 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5356 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5358 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5366 #endif /* PERL_MEM_LOG */
5369 =for apidoc my_sprintf
5371 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5372 the length of the string written to the buffer. Only rare pre-ANSI systems
5373 need the wrapper function - usually this is a direct call to C<sprintf>.
5377 #ifndef SPRINTF_RETURNS_STRLEN
5379 Perl_my_sprintf(char *buffer, const char* pat, ...)
5382 va_start(args, pat);
5383 vsprintf(buffer, pat, args);
5385 return strlen(buffer);
5390 =for apidoc my_snprintf
5392 The C library C<snprintf> functionality, if available and
5393 standards-compliant (uses C<vsnprintf>, actually). However, if the
5394 C<vsnprintf> is not available, will unfortunately use the unsafe
5395 C<vsprintf> which can overrun the buffer (there is an overrun check,
5396 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5397 getting C<vsnprintf>.
5402 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5407 va_start(ap, format);
5408 #ifdef HAS_VSNPRINTF
5409 retval = vsnprintf(buffer, len, format, ap);
5411 retval = vsprintf(buffer, format, ap);
5414 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5415 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5416 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5421 =for apidoc my_vsnprintf
5423 The C library C<vsnprintf> if available and standards-compliant.
5424 However, if if the C<vsnprintf> is not available, will unfortunately
5425 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5426 overrun check, but that may be too late). Consider using
5427 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5432 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5438 Perl_va_copy(ap, apc);
5439 # ifdef HAS_VSNPRINTF
5440 retval = vsnprintf(buffer, len, format, apc);
5442 retval = vsprintf(buffer, format, apc);
5445 # ifdef HAS_VSNPRINTF
5446 retval = vsnprintf(buffer, len, format, ap);
5448 retval = vsprintf(buffer, format, ap);
5450 #endif /* #ifdef NEED_VA_COPY */
5451 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5452 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5453 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5458 Perl_my_clearenv(pTHX)
5461 #if ! defined(PERL_MICRO)
5462 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5464 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5465 # if defined(USE_ENVIRON_ARRAY)
5466 # if defined(USE_ITHREADS)
5467 /* only the parent thread can clobber the process environment */
5468 if (PL_curinterp == aTHX)
5469 # endif /* USE_ITHREADS */
5471 # if ! defined(PERL_USE_SAFE_PUTENV)
5472 if ( !PL_use_safe_putenv) {
5474 if (environ == PL_origenviron)
5475 environ = (char**)safesysmalloc(sizeof(char*));
5477 for (i = 0; environ[i]; i++)
5478 (void)safesysfree(environ[i]);
5481 # else /* PERL_USE_SAFE_PUTENV */
5482 # if defined(HAS_CLEARENV)
5484 # elif defined(HAS_UNSETENV)
5485 int bsiz = 80; /* Most envvar names will be shorter than this. */
5486 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5487 char *buf = (char*)safesysmalloc(bufsiz);
5488 while (*environ != NULL) {
5489 char *e = strchr(*environ, '=');
5490 int l = e ? e - *environ : strlen(*environ);
5492 (void)safesysfree(buf);
5493 bsiz = l + 1; /* + 1 for the \0. */
5494 buf = (char*)safesysmalloc(bufsiz);
5496 my_strlcpy(buf, *environ, l + 1);
5497 (void)unsetenv(buf);
5499 (void)safesysfree(buf);
5500 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5501 /* Just null environ and accept the leakage. */
5503 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5504 # endif /* ! PERL_USE_SAFE_PUTENV */
5506 # endif /* USE_ENVIRON_ARRAY */
5507 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5508 #endif /* PERL_MICRO */
5511 #ifdef PERL_IMPLICIT_CONTEXT
5513 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5514 the global PL_my_cxt_index is incremented, and that value is assigned to
5515 that module's static my_cxt_index (who's address is passed as an arg).
5516 Then, for each interpreter this function is called for, it makes sure a
5517 void* slot is available to hang the static data off, by allocating or
5518 extending the interpreter's PL_my_cxt_list array */
5521 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5526 /* this module hasn't been allocated an index yet */
5527 MUTEX_LOCK(&PL_my_ctx_mutex);
5528 *index = PL_my_cxt_index++;
5529 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5532 /* make sure the array is big enough */
5533 if (PL_my_cxt_size <= *index) {
5534 if (PL_my_cxt_size) {
5535 while (PL_my_cxt_size <= *index)
5536 PL_my_cxt_size *= 2;
5537 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5540 PL_my_cxt_size = 16;
5541 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5544 /* newSV() allocates one more than needed */
5545 p = (void*)SvPVX(newSV(size-1));
5546 PL_my_cxt_list[*index] = p;
5547 Zero(p, size, char);
5554 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5556 Size_t used, length, copy;
5559 length = strlen(src);
5560 if (size > 0 && used < size - 1) {
5561 copy = (length >= size - used) ? size - used - 1 : length;
5562 memcpy(dst + used, src, copy);
5563 dst[used + copy] = '\0';
5565 return used + length;
5571 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5573 Size_t length, copy;
5575 length = strlen(src);
5577 copy = (length >= size) ? size - 1 : length;
5578 memcpy(dst, src, copy);
5587 * c-indentation-style: bsd
5589 * indent-tabs-mode: t
5592 * ex: set ts=8 sts=4 sw=4 noet: