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)
344 for (tolen = 0; from < fromend; from++, tolen++) {
346 if (from[1] == delim)
355 else if (*from == delim)
366 /* return ptr to little string in big string, NULL if not found */
367 /* This routine was donated by Corey Satten. */
370 Perl_instr(pTHX_ register const char *big, register const char *little)
381 register const char *s, *x;
384 for (x=big,s=little; *s; /**/ ) {
395 return (char*)(big-1);
400 /* same as instr but allow embedded nulls */
403 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
409 char first = *little++;
411 bigend -= lend - little;
413 while (big <= bigend) {
416 for (x=big,s=little; s < lend; x++,s++) {
420 return (char*)(big-1);
426 /* reverse of the above--find last substring */
429 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
431 register const char *bigbeg;
432 register const I32 first = *little;
433 register const char * const littleend = lend;
436 if (little >= littleend)
437 return (char*)bigend;
439 big = bigend - (littleend - little++);
440 while (big >= bigbeg) {
441 register const char *s, *x;
444 for (x=big+2,s=little; s < littleend; /**/ ) {
453 return (char*)(big+1);
458 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
460 /* As a space optimization, we do not compile tables for strings of length
461 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
462 special-cased in fbm_instr().
464 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
467 =head1 Miscellaneous Functions
469 =for apidoc fbm_compile
471 Analyses the string in order to make fast searches on it using fbm_instr()
472 -- the Boyer-Moore algorithm.
478 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
481 register const U8 *s;
487 if (flags & FBMcf_TAIL) {
488 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
489 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
490 if (mg && mg->mg_len >= 0)
493 s = (U8*)SvPV_force_mutable(sv, len);
494 SvUPGRADE(sv, SVt_PVBM);
495 if (len == 0) /* TAIL might be on a zero-length string. */
498 const unsigned char *sb;
499 const U8 mlen = (len>255) ? 255 : (U8)len;
502 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
503 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
504 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
505 memset((void*)table, mlen, 256);
506 table[-1] = (U8)flags;
508 sb = s - mlen + 1; /* first char (maybe) */
510 if (table[*s] == mlen)
515 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
518 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
519 for (i = 0; i < len; i++) {
520 if (PL_freq[s[i]] < frequency) {
522 frequency = PL_freq[s[i]];
525 BmRARE(sv) = s[rarest];
526 BmPREVIOUS(sv) = (U16)rarest;
527 BmUSEFUL(sv) = 100; /* Initial value */
528 if (flags & FBMcf_TAIL)
530 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
531 BmRARE(sv),BmPREVIOUS(sv)));
534 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
535 /* If SvTAIL is actually due to \Z or \z, this gives false positives
539 =for apidoc fbm_instr
541 Returns the location of the SV in the string delimited by C<str> and
542 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
543 does not have to be fbm_compiled, but the search will not be as fast
550 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
552 register unsigned char *s;
554 register const unsigned char *little
555 = (const unsigned char *)SvPV_const(littlestr,l);
556 register STRLEN littlelen = l;
557 register const I32 multiline = flags & FBMrf_MULTILINE;
559 if ((STRLEN)(bigend - big) < littlelen) {
560 if ( SvTAIL(littlestr)
561 && ((STRLEN)(bigend - big) == littlelen - 1)
563 || (*big == *little &&
564 memEQ((char *)big, (char *)little, littlelen - 1))))
569 if (littlelen <= 2) { /* Special-cased */
571 if (littlelen == 1) {
572 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
573 /* Know that bigend != big. */
574 if (bigend[-1] == '\n')
575 return (char *)(bigend - 1);
576 return (char *) bigend;
584 if (SvTAIL(littlestr))
585 return (char *) bigend;
589 return (char*)big; /* Cannot be SvTAIL! */
592 if (SvTAIL(littlestr) && !multiline) {
593 if (bigend[-1] == '\n' && bigend[-2] == *little)
594 return (char*)bigend - 2;
595 if (bigend[-1] == *little)
596 return (char*)bigend - 1;
600 /* This should be better than FBM if c1 == c2, and almost
601 as good otherwise: maybe better since we do less indirection.
602 And we save a lot of memory by caching no table. */
603 const unsigned char c1 = little[0];
604 const unsigned char c2 = little[1];
609 while (s <= bigend) {
619 goto check_1char_anchor;
630 goto check_1char_anchor;
633 while (s <= bigend) {
638 goto check_1char_anchor;
647 check_1char_anchor: /* One char and anchor! */
648 if (SvTAIL(littlestr) && (*bigend == *little))
649 return (char *)bigend; /* bigend is already decremented. */
652 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
653 s = bigend - littlelen;
654 if (s >= big && bigend[-1] == '\n' && *s == *little
655 /* Automatically of length > 2 */
656 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
658 return (char*)s; /* how sweet it is */
661 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
663 return (char*)s + 1; /* how sweet it is */
667 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
668 char * const b = ninstr((char*)big,(char*)bigend,
669 (char*)little, (char*)little + littlelen);
671 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
672 /* Chop \n from littlestr: */
673 s = bigend - littlelen + 1;
675 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
684 { /* Do actual FBM. */
685 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
686 register const unsigned char *oldlittle;
688 if (littlelen > (STRLEN)(bigend - big))
690 --littlelen; /* Last char found by table lookup */
693 little += littlelen; /* last char */
699 if ((tmp = table[*s])) {
700 if ((s += tmp) < bigend)
704 else { /* less expensive than calling strncmp() */
705 register unsigned char * const olds = s;
710 if (*--s == *--little)
712 s = olds + 1; /* here we pay the price for failure */
714 if (s < bigend) /* fake up continue to outer loop */
722 if ( s == bigend && (table[-1] & FBMcf_TAIL)
723 && memEQ((char *)(bigend - littlelen),
724 (char *)(oldlittle - littlelen), littlelen) )
725 return (char*)bigend - littlelen;
730 /* start_shift, end_shift are positive quantities which give offsets
731 of ends of some substring of bigstr.
732 If "last" we want the last occurrence.
733 old_posp is the way of communication between consequent calls if
734 the next call needs to find the .
735 The initial *old_posp should be -1.
737 Note that we take into account SvTAIL, so one can get extra
738 optimizations if _ALL flag is set.
741 /* If SvTAIL is actually due to \Z or \z, this gives false positives
742 if PL_multiline. In fact if !PL_multiline the authoritative answer
743 is not supported yet. */
746 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
749 register const unsigned char *big;
751 register I32 previous;
753 register const unsigned char *little;
754 register I32 stop_pos;
755 register const unsigned char *littleend;
759 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
760 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
762 if ( BmRARE(littlestr) == '\n'
763 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
764 little = (const unsigned char *)(SvPVX_const(littlestr));
765 littleend = little + SvCUR(littlestr);
772 little = (const unsigned char *)(SvPVX_const(littlestr));
773 littleend = little + SvCUR(littlestr);
775 /* The value of pos we can start at: */
776 previous = BmPREVIOUS(littlestr);
777 big = (const unsigned char *)(SvPVX_const(bigstr));
778 /* The value of pos we can stop at: */
779 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
780 if (previous + start_shift > stop_pos) {
782 stop_pos does not include SvTAIL in the count, so this check is incorrect
783 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
786 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
791 while (pos < previous + start_shift) {
792 if (!(pos += PL_screamnext[pos]))
797 register const unsigned char *s, *x;
798 if (pos >= stop_pos) break;
799 if (big[pos] != first)
801 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
807 if (s == littleend) {
809 if (!last) return (char *)(big+pos);
812 } while ( pos += PL_screamnext[pos] );
814 return (char *)(big+(*old_posp));
816 if (!SvTAIL(littlestr) || (end_shift > 0))
818 /* Ignore the trailing "\n". This code is not microoptimized */
819 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
820 stop_pos = littleend - little; /* Actual littlestr len */
825 && ((stop_pos == 1) ||
826 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
832 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
834 register const U8 *a = (const U8 *)s1;
835 register const U8 *b = (const U8 *)s2;
839 if (*a != *b && *a != PL_fold[*b])
847 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
850 register const U8 *a = (const U8 *)s1;
851 register const U8 *b = (const U8 *)s2;
855 if (*a != *b && *a != PL_fold_locale[*b])
862 /* copy a string to a safe spot */
865 =head1 Memory Management
869 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
870 string which is a duplicate of C<pv>. The size of the string is
871 determined by C<strlen()>. The memory allocated for the new string can
872 be freed with the C<Safefree()> function.
878 Perl_savepv(pTHX_ const char *pv)
885 const STRLEN pvlen = strlen(pv)+1;
886 Newx(newaddr,pvlen,char);
887 return memcpy(newaddr,pv,pvlen);
891 /* same thing but with a known length */
896 Perl's version of what C<strndup()> would be if it existed. Returns a
897 pointer to a newly allocated string which is a duplicate of the first
898 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
899 the new string can be freed with the C<Safefree()> function.
905 Perl_savepvn(pTHX_ const char *pv, register I32 len)
907 register char *newaddr;
910 Newx(newaddr,len+1,char);
911 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
913 /* might not be null terminated */
915 return (char *) CopyD(pv,newaddr,len,char);
918 return (char *) ZeroD(newaddr,len+1,char);
923 =for apidoc savesharedpv
925 A version of C<savepv()> which allocates the duplicate string in memory
926 which is shared between threads.
931 Perl_savesharedpv(pTHX_ const char *pv)
933 register char *newaddr;
938 pvlen = strlen(pv)+1;
939 newaddr = (char*)PerlMemShared_malloc(pvlen);
941 return write_no_mem();
943 return memcpy(newaddr,pv,pvlen);
949 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
950 the passed in SV using C<SvPV()>
956 Perl_savesvpv(pTHX_ SV *sv)
959 const char * const pv = SvPV_const(sv, len);
960 register char *newaddr;
963 Newx(newaddr,len,char);
964 return (char *) CopyD(pv,newaddr,len,char);
968 /* the SV for Perl_form() and mess() is not kept in an arena */
978 return sv_2mortal(newSVpvs(""));
983 /* Create as PVMG now, to avoid any upgrading later */
985 Newxz(any, 1, XPVMG);
986 SvFLAGS(sv) = SVt_PVMG;
987 SvANY(sv) = (void*)any;
989 SvREFCNT(sv) = 1 << 30; /* practically infinite */
994 #if defined(PERL_IMPLICIT_CONTEXT)
996 Perl_form_nocontext(const char* pat, ...)
1001 va_start(args, pat);
1002 retval = vform(pat, &args);
1006 #endif /* PERL_IMPLICIT_CONTEXT */
1009 =head1 Miscellaneous Functions
1012 Takes a sprintf-style format pattern and conventional
1013 (non-SV) arguments and returns the formatted string.
1015 (char *) Perl_form(pTHX_ const char* pat, ...)
1017 can be used any place a string (char *) is required:
1019 char * s = Perl_form("%d.%d",major,minor);
1021 Uses a single private buffer so if you want to format several strings you
1022 must explicitly copy the earlier strings away (and free the copies when you
1029 Perl_form(pTHX_ const char* pat, ...)
1033 va_start(args, pat);
1034 retval = vform(pat, &args);
1040 Perl_vform(pTHX_ const char *pat, va_list *args)
1042 SV * const sv = mess_alloc();
1043 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1047 #if defined(PERL_IMPLICIT_CONTEXT)
1049 Perl_mess_nocontext(const char *pat, ...)
1054 va_start(args, pat);
1055 retval = vmess(pat, &args);
1059 #endif /* PERL_IMPLICIT_CONTEXT */
1062 Perl_mess(pTHX_ const char *pat, ...)
1066 va_start(args, pat);
1067 retval = vmess(pat, &args);
1073 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1076 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1078 if (!o || o == PL_op)
1081 if (o->op_flags & OPf_KIDS) {
1083 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1086 /* If the OP_NEXTSTATE has been optimised away we can still use it
1087 * the get the file and line number. */
1089 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1090 cop = (const COP *)kid;
1092 /* Keep searching, and return when we've found something. */
1094 new_cop = closest_cop(cop, kid);
1100 /* Nothing found. */
1106 Perl_vmess(pTHX_ const char *pat, va_list *args)
1109 SV * const sv = mess_alloc();
1111 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1112 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1114 * Try and find the file and line for PL_op. This will usually be
1115 * PL_curcop, but it might be a cop that has been optimised away. We
1116 * can try to find such a cop by searching through the optree starting
1117 * from the sibling of PL_curcop.
1120 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1125 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1126 OutCopFILE(cop), (IV)CopLINE(cop));
1127 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1128 const bool line_mode = (RsSIMPLE(PL_rs) &&
1129 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1130 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1131 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1132 line_mode ? "line" : "chunk",
1133 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1136 sv_catpvs(sv, " during global destruction");
1137 sv_catpvs(sv, ".\n");
1143 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1149 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1150 && (io = GvIO(PL_stderrgv))
1151 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1158 SAVESPTR(PL_stderrgv);
1161 PUSHSTACKi(PERLSI_MAGIC);
1165 PUSHs(SvTIED_obj((SV*)io, mg));
1166 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1168 call_method("PRINT", G_SCALAR);
1176 /* SFIO can really mess with your errno */
1177 const int e = errno;
1179 PerlIO * const serr = Perl_error_log;
1181 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1182 (void)PerlIO_flush(serr);
1189 /* Common code used by vcroak, vdie, vwarn and vwarner */
1192 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1198 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1199 /* sv_2cv might call Perl_croak() or Perl_warner() */
1200 SV * const oldhook = *hook;
1207 cv = sv_2cv(oldhook, &stash, &gv, 0);
1209 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1219 if (warn || message) {
1220 msg = newSVpvn(message, msglen);
1221 SvFLAGS(msg) |= utf8;
1229 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1233 call_sv((SV*)cv, G_DISCARD);
1242 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1246 const char *message;
1249 SV * const msv = vmess(pat, args);
1250 if (PL_errors && SvCUR(PL_errors)) {
1251 sv_catsv(PL_errors, msv);
1252 message = SvPV_const(PL_errors, *msglen);
1253 SvCUR_set(PL_errors, 0);
1256 message = SvPV_const(msv,*msglen);
1257 *utf8 = SvUTF8(msv);
1263 DEBUG_S(PerlIO_printf(Perl_debug_log,
1264 "%p: die/croak: message = %s\ndiehook = %p\n",
1265 thr, message, PL_diehook));
1267 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1273 Perl_vdie(pTHX_ const char* pat, va_list *args)
1276 const char *message;
1277 const int was_in_eval = PL_in_eval;
1281 DEBUG_S(PerlIO_printf(Perl_debug_log,
1282 "%p: die: curstack = %p, mainstack = %p\n",
1283 thr, PL_curstack, PL_mainstack));
1285 message = vdie_croak_common(pat, args, &msglen, &utf8);
1287 PL_restartop = die_where(message, msglen);
1288 SvFLAGS(ERRSV) |= utf8;
1289 DEBUG_S(PerlIO_printf(Perl_debug_log,
1290 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1291 thr, PL_restartop, was_in_eval, PL_top_env));
1292 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1294 return PL_restartop;
1297 #if defined(PERL_IMPLICIT_CONTEXT)
1299 Perl_die_nocontext(const char* pat, ...)
1304 va_start(args, pat);
1305 o = vdie(pat, &args);
1309 #endif /* PERL_IMPLICIT_CONTEXT */
1312 Perl_die(pTHX_ const char* pat, ...)
1316 va_start(args, pat);
1317 o = vdie(pat, &args);
1323 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1326 const char *message;
1330 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1333 PL_restartop = die_where(message, msglen);
1334 SvFLAGS(ERRSV) |= utf8;
1338 message = SvPVx_const(ERRSV, msglen);
1340 write_to_stderr(message, msglen);
1344 #if defined(PERL_IMPLICIT_CONTEXT)
1346 Perl_croak_nocontext(const char *pat, ...)
1350 va_start(args, pat);
1355 #endif /* PERL_IMPLICIT_CONTEXT */
1358 =head1 Warning and Dieing
1362 This is the XSUB-writer's interface to Perl's C<die> function.
1363 Normally call this function the same way you call the C C<printf>
1364 function. Calling C<croak> returns control directly to Perl,
1365 sidestepping the normal C order of execution. See C<warn>.
1367 If you want to throw an exception object, assign the object to
1368 C<$@> and then pass C<NULL> to croak():
1370 errsv = get_sv("@", TRUE);
1371 sv_setsv(errsv, exception_object);
1378 Perl_croak(pTHX_ const char *pat, ...)
1381 va_start(args, pat);
1388 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1392 SV * const msv = vmess(pat, args);
1393 const I32 utf8 = SvUTF8(msv);
1394 const char * const message = SvPV_const(msv, msglen);
1397 if (vdie_common(message, msglen, utf8, TRUE))
1401 write_to_stderr(message, msglen);
1404 #if defined(PERL_IMPLICIT_CONTEXT)
1406 Perl_warn_nocontext(const char *pat, ...)
1410 va_start(args, pat);
1414 #endif /* PERL_IMPLICIT_CONTEXT */
1419 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1420 function the same way you call the C C<printf> function. See C<croak>.
1426 Perl_warn(pTHX_ const char *pat, ...)
1429 va_start(args, pat);
1434 #if defined(PERL_IMPLICIT_CONTEXT)
1436 Perl_warner_nocontext(U32 err, const char *pat, ...)
1440 va_start(args, pat);
1441 vwarner(err, pat, &args);
1444 #endif /* PERL_IMPLICIT_CONTEXT */
1447 Perl_warner(pTHX_ U32 err, const char* pat,...)
1450 va_start(args, pat);
1451 vwarner(err, pat, &args);
1456 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1459 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1460 SV * const msv = vmess(pat, args);
1462 const char * const message = SvPV_const(msv, msglen);
1463 const I32 utf8 = SvUTF8(msv);
1467 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1470 PL_restartop = die_where(message, msglen);
1471 SvFLAGS(ERRSV) |= utf8;
1474 write_to_stderr(message, msglen);
1478 Perl_vwarn(aTHX_ pat, args);
1482 /* implements the ckWARN? macros */
1485 Perl_ckwarn(pTHX_ U32 w)
1491 && PL_curcop->cop_warnings != pWARN_NONE
1493 PL_curcop->cop_warnings == pWARN_ALL
1494 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1495 || (unpackWARN2(w) &&
1496 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1497 || (unpackWARN3(w) &&
1498 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1499 || (unpackWARN4(w) &&
1500 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1505 isLEXWARN_off && PL_dowarn & G_WARN_ON
1510 /* implements the ckWARN?_d macro */
1513 Perl_ckwarn_d(pTHX_ U32 w)
1518 || PL_curcop->cop_warnings == pWARN_ALL
1520 PL_curcop->cop_warnings != pWARN_NONE
1522 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1523 || (unpackWARN2(w) &&
1524 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1525 || (unpackWARN3(w) &&
1526 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1527 || (unpackWARN4(w) &&
1528 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1534 /* Set buffer=NULL to get a new one. */
1536 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1538 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1540 buffer = specialWARN(buffer) ? PerlMemShared_malloc(len_wanted)
1541 : PerlMemShared_realloc(buffer, len_wanted);
1543 Copy(bits, (buffer + 1), size, char);
1547 /* since we've already done strlen() for both nam and val
1548 * we can use that info to make things faster than
1549 * sprintf(s, "%s=%s", nam, val)
1551 #define my_setenv_format(s, nam, nlen, val, vlen) \
1552 Copy(nam, s, nlen, char); \
1554 Copy(val, s+(nlen+1), vlen, char); \
1555 *(s+(nlen+1+vlen)) = '\0'
1557 #ifdef USE_ENVIRON_ARRAY
1558 /* VMS' my_setenv() is in vms.c */
1559 #if !defined(WIN32) && !defined(NETWARE)
1561 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1565 /* only parent thread can modify process environment */
1566 if (PL_curinterp == aTHX)
1569 #ifndef PERL_USE_SAFE_PUTENV
1570 if (!PL_use_safe_putenv) {
1571 /* most putenv()s leak, so we manipulate environ directly */
1572 register I32 i=setenv_getix(nam); /* where does it go? */
1575 if (environ == PL_origenviron) { /* need we copy environment? */
1580 for (max = i; environ[max]; max++) ;
1581 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1582 for (j=0; j<max; j++) { /* copy environment */
1583 const int len = strlen(environ[j]);
1584 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1585 Copy(environ[j], tmpenv[j], len+1, char);
1588 environ = tmpenv; /* tell exec where it is now */
1591 safesysfree(environ[i]);
1592 while (environ[i]) {
1593 environ[i] = environ[i+1];
1598 if (!environ[i]) { /* does not exist yet */
1599 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1600 environ[i+1] = NULL; /* make sure it's null terminated */
1603 safesysfree(environ[i]);
1607 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1608 /* all that work just for this */
1609 my_setenv_format(environ[i], nam, nlen, val, vlen);
1612 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1613 # if defined(HAS_UNSETENV)
1615 (void)unsetenv(nam);
1617 (void)setenv(nam, val, 1);
1619 # else /* ! HAS_UNSETENV */
1620 (void)setenv(nam, val, 1);
1621 # endif /* HAS_UNSETENV */
1623 # if defined(HAS_UNSETENV)
1625 (void)unsetenv(nam);
1627 const int nlen = strlen(nam);
1628 const int vlen = strlen(val);
1629 char * const new_env =
1630 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1631 my_setenv_format(new_env, nam, nlen, val, vlen);
1632 (void)putenv(new_env);
1634 # else /* ! HAS_UNSETENV */
1636 const int nlen = strlen(nam);
1642 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1643 /* all that work just for this */
1644 my_setenv_format(new_env, nam, nlen, val, vlen);
1645 (void)putenv(new_env);
1646 # endif /* HAS_UNSETENV */
1647 # endif /* __CYGWIN__ */
1648 #ifndef PERL_USE_SAFE_PUTENV
1654 #else /* WIN32 || NETWARE */
1657 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1660 register char *envstr;
1661 const int nlen = strlen(nam);
1668 Newx(envstr, nlen+vlen+2, char);
1669 my_setenv_format(envstr, nam, nlen, val, vlen);
1670 (void)PerlEnv_putenv(envstr);
1674 #endif /* WIN32 || NETWARE */
1678 Perl_setenv_getix(pTHX_ const char *nam)
1681 register const I32 len = strlen(nam);
1682 PERL_UNUSED_CONTEXT;
1684 for (i = 0; environ[i]; i++) {
1687 strnicmp(environ[i],nam,len) == 0
1689 strnEQ(environ[i],nam,len)
1691 && environ[i][len] == '=')
1692 break; /* strnEQ must come first to avoid */
1693 } /* potential SEGV's */
1696 #endif /* !PERL_MICRO */
1698 #endif /* !VMS && !EPOC*/
1700 #ifdef UNLINK_ALL_VERSIONS
1702 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1706 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1711 /* this is a drop-in replacement for bcopy() */
1712 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1714 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1716 char * const retval = to;
1718 if (from - to >= 0) {
1726 *(--to) = *(--from);
1732 /* this is a drop-in replacement for memset() */
1735 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1737 char * const retval = loc;
1745 /* this is a drop-in replacement for bzero() */
1746 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1748 Perl_my_bzero(register char *loc, register I32 len)
1750 char * const retval = loc;
1758 /* this is a drop-in replacement for memcmp() */
1759 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1761 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1763 register const U8 *a = (const U8 *)s1;
1764 register const U8 *b = (const U8 *)s2;
1768 if ((tmp = *a++ - *b++))
1773 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1777 #ifdef USE_CHAR_VSPRINTF
1782 vsprintf(char *dest, const char *pat, char *args)
1786 fakebuf._ptr = dest;
1787 fakebuf._cnt = 32767;
1791 fakebuf._flag = _IOWRT|_IOSTRG;
1792 _doprnt(pat, args, &fakebuf); /* what a kludge */
1793 (void)putc('\0', &fakebuf);
1794 #ifdef USE_CHAR_VSPRINTF
1797 return 0; /* perl doesn't use return value */
1801 #endif /* HAS_VPRINTF */
1804 #if BYTEORDER != 0x4321
1806 Perl_my_swap(pTHX_ short s)
1808 #if (BYTEORDER & 1) == 0
1811 result = ((s & 255) << 8) + ((s >> 8) & 255);
1819 Perl_my_htonl(pTHX_ long l)
1823 char c[sizeof(long)];
1826 #if BYTEORDER == 0x1234
1827 u.c[0] = (l >> 24) & 255;
1828 u.c[1] = (l >> 16) & 255;
1829 u.c[2] = (l >> 8) & 255;
1833 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1834 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1839 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1840 u.c[o & 0xf] = (l >> s) & 255;
1848 Perl_my_ntohl(pTHX_ long l)
1852 char c[sizeof(long)];
1855 #if BYTEORDER == 0x1234
1856 u.c[0] = (l >> 24) & 255;
1857 u.c[1] = (l >> 16) & 255;
1858 u.c[2] = (l >> 8) & 255;
1862 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1863 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1870 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1871 l |= (u.c[o & 0xf] & 255) << s;
1878 #endif /* BYTEORDER != 0x4321 */
1882 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1883 * If these functions are defined,
1884 * the BYTEORDER is neither 0x1234 nor 0x4321.
1885 * However, this is not assumed.
1889 #define HTOLE(name,type) \
1891 name (register type n) \
1895 char c[sizeof(type)]; \
1898 register U32 s = 0; \
1899 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1900 u.c[i] = (n >> s) & 0xFF; \
1905 #define LETOH(name,type) \
1907 name (register type n) \
1911 char c[sizeof(type)]; \
1914 register U32 s = 0; \
1917 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1918 n |= ((type)(u.c[i] & 0xFF)) << s; \
1924 * Big-endian byte order functions.
1927 #define HTOBE(name,type) \
1929 name (register type n) \
1933 char c[sizeof(type)]; \
1936 register U32 s = 8*(sizeof(u.c)-1); \
1937 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1938 u.c[i] = (n >> s) & 0xFF; \
1943 #define BETOH(name,type) \
1945 name (register type n) \
1949 char c[sizeof(type)]; \
1952 register U32 s = 8*(sizeof(u.c)-1); \
1955 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1956 n |= ((type)(u.c[i] & 0xFF)) << s; \
1962 * If we just can't do it...
1965 #define NOT_AVAIL(name,type) \
1967 name (register type n) \
1969 Perl_croak_nocontext(#name "() not available"); \
1970 return n; /* not reached */ \
1974 #if defined(HAS_HTOVS) && !defined(htovs)
1977 #if defined(HAS_HTOVL) && !defined(htovl)
1980 #if defined(HAS_VTOHS) && !defined(vtohs)
1983 #if defined(HAS_VTOHL) && !defined(vtohl)
1987 #ifdef PERL_NEED_MY_HTOLE16
1989 HTOLE(Perl_my_htole16,U16)
1991 NOT_AVAIL(Perl_my_htole16,U16)
1994 #ifdef PERL_NEED_MY_LETOH16
1996 LETOH(Perl_my_letoh16,U16)
1998 NOT_AVAIL(Perl_my_letoh16,U16)
2001 #ifdef PERL_NEED_MY_HTOBE16
2003 HTOBE(Perl_my_htobe16,U16)
2005 NOT_AVAIL(Perl_my_htobe16,U16)
2008 #ifdef PERL_NEED_MY_BETOH16
2010 BETOH(Perl_my_betoh16,U16)
2012 NOT_AVAIL(Perl_my_betoh16,U16)
2016 #ifdef PERL_NEED_MY_HTOLE32
2018 HTOLE(Perl_my_htole32,U32)
2020 NOT_AVAIL(Perl_my_htole32,U32)
2023 #ifdef PERL_NEED_MY_LETOH32
2025 LETOH(Perl_my_letoh32,U32)
2027 NOT_AVAIL(Perl_my_letoh32,U32)
2030 #ifdef PERL_NEED_MY_HTOBE32
2032 HTOBE(Perl_my_htobe32,U32)
2034 NOT_AVAIL(Perl_my_htobe32,U32)
2037 #ifdef PERL_NEED_MY_BETOH32
2039 BETOH(Perl_my_betoh32,U32)
2041 NOT_AVAIL(Perl_my_betoh32,U32)
2045 #ifdef PERL_NEED_MY_HTOLE64
2047 HTOLE(Perl_my_htole64,U64)
2049 NOT_AVAIL(Perl_my_htole64,U64)
2052 #ifdef PERL_NEED_MY_LETOH64
2054 LETOH(Perl_my_letoh64,U64)
2056 NOT_AVAIL(Perl_my_letoh64,U64)
2059 #ifdef PERL_NEED_MY_HTOBE64
2061 HTOBE(Perl_my_htobe64,U64)
2063 NOT_AVAIL(Perl_my_htobe64,U64)
2066 #ifdef PERL_NEED_MY_BETOH64
2068 BETOH(Perl_my_betoh64,U64)
2070 NOT_AVAIL(Perl_my_betoh64,U64)
2074 #ifdef PERL_NEED_MY_HTOLES
2075 HTOLE(Perl_my_htoles,short)
2077 #ifdef PERL_NEED_MY_LETOHS
2078 LETOH(Perl_my_letohs,short)
2080 #ifdef PERL_NEED_MY_HTOBES
2081 HTOBE(Perl_my_htobes,short)
2083 #ifdef PERL_NEED_MY_BETOHS
2084 BETOH(Perl_my_betohs,short)
2087 #ifdef PERL_NEED_MY_HTOLEI
2088 HTOLE(Perl_my_htolei,int)
2090 #ifdef PERL_NEED_MY_LETOHI
2091 LETOH(Perl_my_letohi,int)
2093 #ifdef PERL_NEED_MY_HTOBEI
2094 HTOBE(Perl_my_htobei,int)
2096 #ifdef PERL_NEED_MY_BETOHI
2097 BETOH(Perl_my_betohi,int)
2100 #ifdef PERL_NEED_MY_HTOLEL
2101 HTOLE(Perl_my_htolel,long)
2103 #ifdef PERL_NEED_MY_LETOHL
2104 LETOH(Perl_my_letohl,long)
2106 #ifdef PERL_NEED_MY_HTOBEL
2107 HTOBE(Perl_my_htobel,long)
2109 #ifdef PERL_NEED_MY_BETOHL
2110 BETOH(Perl_my_betohl,long)
2114 Perl_my_swabn(void *ptr, int n)
2116 register char *s = (char *)ptr;
2117 register char *e = s + (n-1);
2120 for (n /= 2; n > 0; s++, e--, n--) {
2128 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2130 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2133 register I32 This, that;
2139 PERL_FLUSHALL_FOR_CHILD;
2140 This = (*mode == 'w');
2144 taint_proper("Insecure %s%s", "EXEC");
2146 if (PerlProc_pipe(p) < 0)
2148 /* Try for another pipe pair for error return */
2149 if (PerlProc_pipe(pp) >= 0)
2151 while ((pid = PerlProc_fork()) < 0) {
2152 if (errno != EAGAIN) {
2153 PerlLIO_close(p[This]);
2154 PerlLIO_close(p[that]);
2156 PerlLIO_close(pp[0]);
2157 PerlLIO_close(pp[1]);
2169 /* Close parent's end of error status pipe (if any) */
2171 PerlLIO_close(pp[0]);
2172 #if defined(HAS_FCNTL) && defined(F_SETFD)
2173 /* Close error pipe automatically if exec works */
2174 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2177 /* Now dup our end of _the_ pipe to right position */
2178 if (p[THIS] != (*mode == 'r')) {
2179 PerlLIO_dup2(p[THIS], *mode == 'r');
2180 PerlLIO_close(p[THIS]);
2181 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2182 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2185 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2186 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2187 /* No automatic close - do it by hand */
2194 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2200 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2206 do_execfree(); /* free any memory malloced by child on fork */
2208 PerlLIO_close(pp[1]);
2209 /* Keep the lower of the two fd numbers */
2210 if (p[that] < p[This]) {
2211 PerlLIO_dup2(p[This], p[that]);
2212 PerlLIO_close(p[This]);
2216 PerlLIO_close(p[that]); /* close child's end of pipe */
2219 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2221 SvUPGRADE(sv,SVt_IV);
2223 PL_forkprocess = pid;
2224 /* If we managed to get status pipe check for exec fail */
2225 if (did_pipes && pid > 0) {
2230 while (n < sizeof(int)) {
2231 n1 = PerlLIO_read(pp[0],
2232 (void*)(((char*)&errkid)+n),
2238 PerlLIO_close(pp[0]);
2240 if (n) { /* Error */
2242 PerlLIO_close(p[This]);
2243 if (n != sizeof(int))
2244 Perl_croak(aTHX_ "panic: kid popen errno read");
2246 pid2 = wait4pid(pid, &status, 0);
2247 } while (pid2 == -1 && errno == EINTR);
2248 errno = errkid; /* Propagate errno from kid */
2253 PerlLIO_close(pp[0]);
2254 return PerlIO_fdopen(p[This], mode);
2256 Perl_croak(aTHX_ "List form of piped open not implemented");
2257 return (PerlIO *) NULL;
2261 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2262 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2264 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2268 register I32 This, that;
2271 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2275 PERL_FLUSHALL_FOR_CHILD;
2278 return my_syspopen(aTHX_ cmd,mode);
2281 This = (*mode == 'w');
2283 if (doexec && PL_tainting) {
2285 taint_proper("Insecure %s%s", "EXEC");
2287 if (PerlProc_pipe(p) < 0)
2289 if (doexec && PerlProc_pipe(pp) >= 0)
2291 while ((pid = PerlProc_fork()) < 0) {
2292 if (errno != EAGAIN) {
2293 PerlLIO_close(p[This]);
2294 PerlLIO_close(p[that]);
2296 PerlLIO_close(pp[0]);
2297 PerlLIO_close(pp[1]);
2300 Perl_croak(aTHX_ "Can't fork");
2313 PerlLIO_close(pp[0]);
2314 #if defined(HAS_FCNTL) && defined(F_SETFD)
2315 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2318 if (p[THIS] != (*mode == 'r')) {
2319 PerlLIO_dup2(p[THIS], *mode == 'r');
2320 PerlLIO_close(p[THIS]);
2321 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2322 PerlLIO_close(p[THAT]);
2325 PerlLIO_close(p[THAT]);
2328 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2335 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2340 /* may or may not use the shell */
2341 do_exec3(cmd, pp[1], did_pipes);
2344 #endif /* defined OS2 */
2345 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2346 SvREADONLY_off(GvSV(tmpgv));
2347 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2348 SvREADONLY_on(GvSV(tmpgv));
2350 #ifdef THREADS_HAVE_PIDS
2351 PL_ppid = (IV)getppid();
2354 #ifdef PERL_USES_PL_PIDSTATUS
2355 hv_clear(PL_pidstatus); /* we have no children */
2361 do_execfree(); /* free any memory malloced by child on vfork */
2363 PerlLIO_close(pp[1]);
2364 if (p[that] < p[This]) {
2365 PerlLIO_dup2(p[This], p[that]);
2366 PerlLIO_close(p[This]);
2370 PerlLIO_close(p[that]);
2373 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2375 SvUPGRADE(sv,SVt_IV);
2377 PL_forkprocess = pid;
2378 if (did_pipes && pid > 0) {
2383 while (n < sizeof(int)) {
2384 n1 = PerlLIO_read(pp[0],
2385 (void*)(((char*)&errkid)+n),
2391 PerlLIO_close(pp[0]);
2393 if (n) { /* Error */
2395 PerlLIO_close(p[This]);
2396 if (n != sizeof(int))
2397 Perl_croak(aTHX_ "panic: kid popen errno read");
2399 pid2 = wait4pid(pid, &status, 0);
2400 } while (pid2 == -1 && errno == EINTR);
2401 errno = errkid; /* Propagate errno from kid */
2406 PerlLIO_close(pp[0]);
2407 return PerlIO_fdopen(p[This], mode);
2410 #if defined(atarist) || defined(EPOC)
2413 Perl_my_popen(pTHX_ char *cmd, char *mode)
2415 PERL_FLUSHALL_FOR_CHILD;
2416 /* Call system's popen() to get a FILE *, then import it.
2417 used 0 for 2nd parameter to PerlIO_importFILE;
2420 return PerlIO_importFILE(popen(cmd, mode), 0);
2424 FILE *djgpp_popen();
2426 Perl_my_popen(pTHX_ char *cmd, char *mode)
2428 PERL_FLUSHALL_FOR_CHILD;
2429 /* Call system's popen() to get a FILE *, then import it.
2430 used 0 for 2nd parameter to PerlIO_importFILE;
2433 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2438 #endif /* !DOSISH */
2440 /* this is called in parent before the fork() */
2442 Perl_atfork_lock(void)
2445 #if defined(USE_ITHREADS)
2446 /* locks must be held in locking order (if any) */
2448 MUTEX_LOCK(&PL_malloc_mutex);
2454 /* this is called in both parent and child after the fork() */
2456 Perl_atfork_unlock(void)
2459 #if defined(USE_ITHREADS)
2460 /* locks must be released in same order as in atfork_lock() */
2462 MUTEX_UNLOCK(&PL_malloc_mutex);
2471 #if defined(HAS_FORK)
2473 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2478 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2479 * handlers elsewhere in the code */
2484 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2485 Perl_croak_nocontext("fork() not available");
2487 #endif /* HAS_FORK */
2492 Perl_dump_fds(pTHX_ char *s)
2497 PerlIO_printf(Perl_debug_log,"%s", s);
2498 for (fd = 0; fd < 32; fd++) {
2499 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2500 PerlIO_printf(Perl_debug_log," %d",fd);
2502 PerlIO_printf(Perl_debug_log,"\n");
2505 #endif /* DUMP_FDS */
2509 dup2(int oldfd, int newfd)
2511 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2514 PerlLIO_close(newfd);
2515 return fcntl(oldfd, F_DUPFD, newfd);
2517 #define DUP2_MAX_FDS 256
2518 int fdtmp[DUP2_MAX_FDS];
2524 PerlLIO_close(newfd);
2525 /* good enough for low fd's... */
2526 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2527 if (fdx >= DUP2_MAX_FDS) {
2535 PerlLIO_close(fdtmp[--fdx]);
2542 #ifdef HAS_SIGACTION
2544 #ifdef MACOS_TRADITIONAL
2545 /* We don't want restart behavior on MacOS */
2550 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2553 struct sigaction act, oact;
2556 /* only "parent" interpreter can diddle signals */
2557 if (PL_curinterp != aTHX)
2558 return (Sighandler_t) SIG_ERR;
2561 act.sa_handler = (void(*)(int))handler;
2562 sigemptyset(&act.sa_mask);
2565 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2566 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2568 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2569 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2570 act.sa_flags |= SA_NOCLDWAIT;
2572 if (sigaction(signo, &act, &oact) == -1)
2573 return (Sighandler_t) SIG_ERR;
2575 return (Sighandler_t) oact.sa_handler;
2579 Perl_rsignal_state(pTHX_ int signo)
2581 struct sigaction oact;
2582 PERL_UNUSED_CONTEXT;
2584 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2585 return (Sighandler_t) SIG_ERR;
2587 return (Sighandler_t) oact.sa_handler;
2591 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2594 struct sigaction act;
2597 /* only "parent" interpreter can diddle signals */
2598 if (PL_curinterp != aTHX)
2602 act.sa_handler = (void(*)(int))handler;
2603 sigemptyset(&act.sa_mask);
2606 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2607 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2609 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2610 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2611 act.sa_flags |= SA_NOCLDWAIT;
2613 return sigaction(signo, &act, save);
2617 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2621 /* only "parent" interpreter can diddle signals */
2622 if (PL_curinterp != aTHX)
2626 return sigaction(signo, save, (struct sigaction *)NULL);
2629 #else /* !HAS_SIGACTION */
2632 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2634 #if defined(USE_ITHREADS) && !defined(WIN32)
2635 /* only "parent" interpreter can diddle signals */
2636 if (PL_curinterp != aTHX)
2637 return (Sighandler_t) SIG_ERR;
2640 return PerlProc_signal(signo, handler);
2651 Perl_rsignal_state(pTHX_ int signo)
2654 Sighandler_t oldsig;
2656 #if defined(USE_ITHREADS) && !defined(WIN32)
2657 /* only "parent" interpreter can diddle signals */
2658 if (PL_curinterp != aTHX)
2659 return (Sighandler_t) SIG_ERR;
2663 oldsig = PerlProc_signal(signo, sig_trap);
2664 PerlProc_signal(signo, oldsig);
2666 PerlProc_kill(PerlProc_getpid(), signo);
2671 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2673 #if defined(USE_ITHREADS) && !defined(WIN32)
2674 /* only "parent" interpreter can diddle signals */
2675 if (PL_curinterp != aTHX)
2678 *save = PerlProc_signal(signo, handler);
2679 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2683 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2685 #if defined(USE_ITHREADS) && !defined(WIN32)
2686 /* only "parent" interpreter can diddle signals */
2687 if (PL_curinterp != aTHX)
2690 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2693 #endif /* !HAS_SIGACTION */
2694 #endif /* !PERL_MICRO */
2696 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2697 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2699 Perl_my_pclose(pTHX_ PerlIO *ptr)
2702 Sigsave_t hstat, istat, qstat;
2708 int saved_errno = 0;
2710 int saved_win32_errno;
2714 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2716 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2718 *svp = &PL_sv_undef;
2720 if (pid == -1) { /* Opened by popen. */
2721 return my_syspclose(ptr);
2724 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2725 saved_errno = errno;
2727 saved_win32_errno = GetLastError();
2731 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2734 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2735 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2736 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2739 pid2 = wait4pid(pid, &status, 0);
2740 } while (pid2 == -1 && errno == EINTR);
2742 rsignal_restore(SIGHUP, &hstat);
2743 rsignal_restore(SIGINT, &istat);
2744 rsignal_restore(SIGQUIT, &qstat);
2747 SETERRNO(saved_errno, 0);
2750 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2752 #endif /* !DOSISH */
2754 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2756 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2762 #ifdef PERL_USES_PL_PIDSTATUS
2765 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2766 pid, rather than a string form. */
2767 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2768 if (svp && *svp != &PL_sv_undef) {
2769 *statusp = SvIVX(*svp);
2770 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2778 hv_iterinit(PL_pidstatus);
2779 if ((entry = hv_iternext(PL_pidstatus))) {
2780 SV * const sv = hv_iterval(PL_pidstatus,entry);
2782 const char * const spid = hv_iterkey(entry,&len);
2784 assert (len == sizeof(Pid_t));
2785 memcpy((char *)&pid, spid, len);
2786 *statusp = SvIVX(sv);
2787 /* The hash iterator is currently on this entry, so simply
2788 calling hv_delete would trigger the lazy delete, which on
2789 aggregate does more work, beacuse next call to hv_iterinit()
2790 would spot the flag, and have to call the delete routine,
2791 while in the meantime any new entries can't re-use that
2793 hv_iterinit(PL_pidstatus);
2794 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2801 # ifdef HAS_WAITPID_RUNTIME
2802 if (!HAS_WAITPID_RUNTIME)
2805 result = PerlProc_waitpid(pid,statusp,flags);
2808 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2809 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2812 #ifdef PERL_USES_PL_PIDSTATUS
2813 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2818 Perl_croak(aTHX_ "Can't do waitpid with flags");
2820 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2821 pidgone(result,*statusp);
2827 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2830 if (result < 0 && errno == EINTR) {
2835 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2837 #ifdef PERL_USES_PL_PIDSTATUS
2839 Perl_pidgone(pTHX_ Pid_t pid, int status)
2843 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2844 SvUPGRADE(sv,SVt_IV);
2845 SvIV_set(sv, status);
2850 #if defined(atarist) || defined(OS2) || defined(EPOC)
2853 int /* Cannot prototype with I32
2855 my_syspclose(PerlIO *ptr)
2858 Perl_my_pclose(pTHX_ PerlIO *ptr)
2861 /* Needs work for PerlIO ! */
2862 FILE * const f = PerlIO_findFILE(ptr);
2863 const I32 result = pclose(f);
2864 PerlIO_releaseFILE(ptr,f);
2872 Perl_my_pclose(pTHX_ PerlIO *ptr)
2874 /* Needs work for PerlIO ! */
2875 FILE * const f = PerlIO_findFILE(ptr);
2876 I32 result = djgpp_pclose(f);
2877 result = (result << 8) & 0xff00;
2878 PerlIO_releaseFILE(ptr,f);
2884 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2887 register const char * const frombase = from;
2888 PERL_UNUSED_CONTEXT;
2891 register const char c = *from;
2896 while (count-- > 0) {
2897 for (todo = len; todo > 0; todo--) {
2906 Perl_same_dirent(pTHX_ const char *a, const char *b)
2908 char *fa = strrchr(a,'/');
2909 char *fb = strrchr(b,'/');
2912 SV * const tmpsv = sv_newmortal();
2925 sv_setpvn(tmpsv, ".", 1);
2927 sv_setpvn(tmpsv, a, fa - a);
2928 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2931 sv_setpvn(tmpsv, ".", 1);
2933 sv_setpvn(tmpsv, b, fb - b);
2934 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2936 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2937 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2939 #endif /* !HAS_RENAME */
2942 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2943 const char *const *const search_ext, I32 flags)
2946 const char *xfound = NULL;
2947 char *xfailed = NULL;
2948 char tmpbuf[MAXPATHLEN];
2952 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2953 # define SEARCH_EXTS ".bat", ".cmd", NULL
2954 # define MAX_EXT_LEN 4
2957 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2958 # define MAX_EXT_LEN 4
2961 # define SEARCH_EXTS ".pl", ".com", NULL
2962 # define MAX_EXT_LEN 4
2964 /* additional extensions to try in each dir if scriptname not found */
2966 static const char *const exts[] = { SEARCH_EXTS };
2967 const char *const *const ext = search_ext ? search_ext : exts;
2968 int extidx = 0, i = 0;
2969 const char *curext = NULL;
2971 PERL_UNUSED_ARG(search_ext);
2972 # define MAX_EXT_LEN 0
2976 * If dosearch is true and if scriptname does not contain path
2977 * delimiters, search the PATH for scriptname.
2979 * If SEARCH_EXTS is also defined, will look for each
2980 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2981 * while searching the PATH.
2983 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2984 * proceeds as follows:
2985 * If DOSISH or VMSISH:
2986 * + look for ./scriptname{,.foo,.bar}
2987 * + search the PATH for scriptname{,.foo,.bar}
2990 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2991 * this will not look in '.' if it's not in the PATH)
2996 # ifdef ALWAYS_DEFTYPES
2997 len = strlen(scriptname);
2998 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2999 int idx = 0, deftypes = 1;
3002 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3005 int idx = 0, deftypes = 1;
3008 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3010 /* The first time through, just add SEARCH_EXTS to whatever we
3011 * already have, so we can check for default file types. */
3013 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3019 if ((strlen(tmpbuf) + strlen(scriptname)
3020 + MAX_EXT_LEN) >= sizeof tmpbuf)
3021 continue; /* don't search dir with too-long name */
3022 strcat(tmpbuf, scriptname);
3026 if (strEQ(scriptname, "-"))
3028 if (dosearch) { /* Look in '.' first. */
3029 const char *cur = scriptname;
3031 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3033 if (strEQ(ext[i++],curext)) {
3034 extidx = -1; /* already has an ext */
3039 DEBUG_p(PerlIO_printf(Perl_debug_log,
3040 "Looking for %s\n",cur));
3041 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3042 && !S_ISDIR(PL_statbuf.st_mode)) {
3050 if (cur == scriptname) {
3051 len = strlen(scriptname);
3052 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3054 /* FIXME? Convert to memcpy */
3055 cur = strcpy(tmpbuf, scriptname);
3057 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3058 && strcpy(tmpbuf+len, ext[extidx++]));
3063 #ifdef MACOS_TRADITIONAL
3064 if (dosearch && !strchr(scriptname, ':') &&
3065 (s = PerlEnv_getenv("Commands")))
3067 if (dosearch && !strchr(scriptname, '/')
3069 && !strchr(scriptname, '\\')
3071 && (s = PerlEnv_getenv("PATH")))
3076 PL_bufend = s + strlen(s);
3077 while (s < PL_bufend) {
3078 #ifdef MACOS_TRADITIONAL
3079 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3083 #if defined(atarist) || defined(DOSISH)
3088 && *s != ';'; len++, s++) {
3089 if (len < sizeof tmpbuf)
3092 if (len < sizeof tmpbuf)
3094 #else /* ! (atarist || DOSISH) */
3095 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3098 #endif /* ! (atarist || DOSISH) */
3099 #endif /* MACOS_TRADITIONAL */
3102 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3103 continue; /* don't search dir with too-long name */
3104 #ifdef MACOS_TRADITIONAL
3105 if (len && tmpbuf[len - 1] != ':')
3106 tmpbuf[len++] = ':';
3109 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3110 && tmpbuf[len - 1] != '/'
3111 && tmpbuf[len - 1] != '\\'
3114 tmpbuf[len++] = '/';
3115 if (len == 2 && tmpbuf[0] == '.')
3119 (void)strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3121 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
3123 (void)strcpy(tmpbuf + len, scriptname);
3124 #endif /* #ifdef HAS_STRLCAT */
3128 len = strlen(tmpbuf);
3129 if (extidx > 0) /* reset after previous loop */
3133 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3134 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3135 if (S_ISDIR(PL_statbuf.st_mode)) {
3139 } while ( retval < 0 /* not there */
3140 && extidx>=0 && ext[extidx] /* try an extension? */
3141 && strcpy(tmpbuf+len, ext[extidx++])
3146 if (S_ISREG(PL_statbuf.st_mode)
3147 && cando(S_IRUSR,TRUE,&PL_statbuf)
3148 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3149 && cando(S_IXUSR,TRUE,&PL_statbuf)
3153 xfound = tmpbuf; /* bingo! */
3157 xfailed = savepv(tmpbuf);
3160 if (!xfound && !seen_dot && !xfailed &&
3161 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3162 || S_ISDIR(PL_statbuf.st_mode)))
3164 seen_dot = 1; /* Disable message. */
3166 if (flags & 1) { /* do or die? */
3167 Perl_croak(aTHX_ "Can't %s %s%s%s",
3168 (xfailed ? "execute" : "find"),
3169 (xfailed ? xfailed : scriptname),
3170 (xfailed ? "" : " on PATH"),
3171 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3176 scriptname = xfound;
3178 return (scriptname ? savepv(scriptname) : NULL);
3181 #ifndef PERL_GET_CONTEXT_DEFINED
3184 Perl_get_context(void)
3187 #if defined(USE_ITHREADS)
3188 # ifdef OLD_PTHREADS_API
3190 if (pthread_getspecific(PL_thr_key, &t))
3191 Perl_croak_nocontext("panic: pthread_getspecific");
3194 # ifdef I_MACH_CTHREADS
3195 return (void*)cthread_data(cthread_self());
3197 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3206 Perl_set_context(void *t)
3209 #if defined(USE_ITHREADS)
3210 # ifdef I_MACH_CTHREADS
3211 cthread_set_data(cthread_self(), t);
3213 if (pthread_setspecific(PL_thr_key, t))
3214 Perl_croak_nocontext("panic: pthread_setspecific");
3221 #endif /* !PERL_GET_CONTEXT_DEFINED */
3223 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3232 Perl_get_op_names(pTHX)
3234 PERL_UNUSED_CONTEXT;
3235 return (char **)PL_op_name;
3239 Perl_get_op_descs(pTHX)
3241 PERL_UNUSED_CONTEXT;
3242 return (char **)PL_op_desc;
3246 Perl_get_no_modify(pTHX)
3248 PERL_UNUSED_CONTEXT;
3249 return PL_no_modify;
3253 Perl_get_opargs(pTHX)
3255 PERL_UNUSED_CONTEXT;
3256 return (U32 *)PL_opargs;
3260 Perl_get_ppaddr(pTHX)
3263 PERL_UNUSED_CONTEXT;
3264 return (PPADDR_t*)PL_ppaddr;
3267 #ifndef HAS_GETENV_LEN
3269 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3271 char * const env_trans = PerlEnv_getenv(env_elem);
3272 PERL_UNUSED_CONTEXT;
3274 *len = strlen(env_trans);
3281 Perl_get_vtbl(pTHX_ int vtbl_id)
3283 const MGVTBL* result;
3284 PERL_UNUSED_CONTEXT;
3288 result = &PL_vtbl_sv;
3291 result = &PL_vtbl_env;
3293 case want_vtbl_envelem:
3294 result = &PL_vtbl_envelem;
3297 result = &PL_vtbl_sig;
3299 case want_vtbl_sigelem:
3300 result = &PL_vtbl_sigelem;
3302 case want_vtbl_pack:
3303 result = &PL_vtbl_pack;
3305 case want_vtbl_packelem:
3306 result = &PL_vtbl_packelem;
3308 case want_vtbl_dbline:
3309 result = &PL_vtbl_dbline;
3312 result = &PL_vtbl_isa;
3314 case want_vtbl_isaelem:
3315 result = &PL_vtbl_isaelem;
3317 case want_vtbl_arylen:
3318 result = &PL_vtbl_arylen;
3320 case want_vtbl_mglob:
3321 result = &PL_vtbl_mglob;
3323 case want_vtbl_nkeys:
3324 result = &PL_vtbl_nkeys;
3326 case want_vtbl_taint:
3327 result = &PL_vtbl_taint;
3329 case want_vtbl_substr:
3330 result = &PL_vtbl_substr;
3333 result = &PL_vtbl_vec;
3336 result = &PL_vtbl_pos;
3339 result = &PL_vtbl_bm;
3342 result = &PL_vtbl_fm;
3344 case want_vtbl_uvar:
3345 result = &PL_vtbl_uvar;
3347 case want_vtbl_defelem:
3348 result = &PL_vtbl_defelem;
3350 case want_vtbl_regexp:
3351 result = &PL_vtbl_regexp;
3353 case want_vtbl_regdata:
3354 result = &PL_vtbl_regdata;
3356 case want_vtbl_regdatum:
3357 result = &PL_vtbl_regdatum;
3359 #ifdef USE_LOCALE_COLLATE
3360 case want_vtbl_collxfrm:
3361 result = &PL_vtbl_collxfrm;
3364 case want_vtbl_amagic:
3365 result = &PL_vtbl_amagic;
3367 case want_vtbl_amagicelem:
3368 result = &PL_vtbl_amagicelem;
3370 case want_vtbl_backref:
3371 result = &PL_vtbl_backref;
3373 case want_vtbl_utf8:
3374 result = &PL_vtbl_utf8;
3380 return (MGVTBL*)result;
3384 Perl_my_fflush_all(pTHX)
3386 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3387 return PerlIO_flush(NULL);
3389 # if defined(HAS__FWALK)
3390 extern int fflush(FILE *);
3391 /* undocumented, unprototyped, but very useful BSDism */
3392 extern void _fwalk(int (*)(FILE *));
3396 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3398 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3399 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3401 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3402 open_max = sysconf(_SC_OPEN_MAX);
3405 open_max = FOPEN_MAX;
3408 open_max = OPEN_MAX;
3419 for (i = 0; i < open_max; i++)
3420 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3421 STDIO_STREAM_ARRAY[i]._file < open_max &&
3422 STDIO_STREAM_ARRAY[i]._flag)
3423 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3427 SETERRNO(EBADF,RMS_IFI);
3434 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3436 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3438 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3439 if (ckWARN(WARN_IO)) {
3440 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3442 Perl_warner(aTHX_ packWARN(WARN_IO),
3443 "Filehandle %s opened only for %sput",
3446 Perl_warner(aTHX_ packWARN(WARN_IO),
3447 "Filehandle opened only for %sput", direction);
3454 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3456 warn_type = WARN_CLOSED;
3460 warn_type = WARN_UNOPENED;
3463 if (ckWARN(warn_type)) {
3464 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3465 const char * const func =
3466 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3467 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3468 op < 0 ? "" : /* handle phoney cases */
3470 const char * const type = OP_IS_SOCKET(op)
3471 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3472 ? "socket" : "filehandle";
3473 if (name && *name) {
3474 Perl_warner(aTHX_ packWARN(warn_type),
3475 "%s%s on %s %s %s", func, pars, vile, type, name);
3476 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3478 aTHX_ packWARN(warn_type),
3479 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3484 Perl_warner(aTHX_ packWARN(warn_type),
3485 "%s%s on %s %s", func, pars, vile, type);
3486 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3488 aTHX_ packWARN(warn_type),
3489 "\t(Are you trying to call %s%s on dirhandle?)\n",
3498 /* in ASCII order, not that it matters */
3499 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3502 Perl_ebcdic_control(pTHX_ int ch)
3510 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3511 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3514 if (ctlp == controllablechars)
3515 return('\177'); /* DEL */
3517 return((unsigned char)(ctlp - controllablechars - 1));
3518 } else { /* Want uncontrol */
3519 if (ch == '\177' || ch == -1)
3521 else if (ch == '\157')
3523 else if (ch == '\174')
3525 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3527 else if (ch == '\155')
3529 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3530 return(controllablechars[ch+1]);
3532 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3537 /* To workaround core dumps from the uninitialised tm_zone we get the
3538 * system to give us a reasonable struct to copy. This fix means that
3539 * strftime uses the tm_zone and tm_gmtoff values returned by
3540 * localtime(time()). That should give the desired result most of the
3541 * time. But probably not always!
3543 * This does not address tzname aspects of NETaa14816.
3548 # ifndef STRUCT_TM_HASZONE
3549 # define STRUCT_TM_HASZONE
3553 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3554 # ifndef HAS_TM_TM_ZONE
3555 # define HAS_TM_TM_ZONE
3560 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3562 #ifdef HAS_TM_TM_ZONE
3564 const struct tm* my_tm;
3566 my_tm = localtime(&now);
3568 Copy(my_tm, ptm, 1, struct tm);
3570 PERL_UNUSED_ARG(ptm);
3575 * mini_mktime - normalise struct tm values without the localtime()
3576 * semantics (and overhead) of mktime().
3579 Perl_mini_mktime(pTHX_ struct tm *ptm)
3583 int month, mday, year, jday;
3584 int odd_cent, odd_year;
3585 PERL_UNUSED_CONTEXT;
3587 #define DAYS_PER_YEAR 365
3588 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3589 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3590 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3591 #define SECS_PER_HOUR (60*60)
3592 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3593 /* parentheses deliberately absent on these two, otherwise they don't work */
3594 #define MONTH_TO_DAYS 153/5
3595 #define DAYS_TO_MONTH 5/153
3596 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3597 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3598 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3599 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3602 * Year/day algorithm notes:
3604 * With a suitable offset for numeric value of the month, one can find
3605 * an offset into the year by considering months to have 30.6 (153/5) days,
3606 * using integer arithmetic (i.e., with truncation). To avoid too much
3607 * messing about with leap days, we consider January and February to be
3608 * the 13th and 14th month of the previous year. After that transformation,
3609 * we need the month index we use to be high by 1 from 'normal human' usage,
3610 * so the month index values we use run from 4 through 15.
3612 * Given that, and the rules for the Gregorian calendar (leap years are those
3613 * divisible by 4 unless also divisible by 100, when they must be divisible
3614 * by 400 instead), we can simply calculate the number of days since some
3615 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3616 * the days we derive from our month index, and adding in the day of the
3617 * month. The value used here is not adjusted for the actual origin which
3618 * it normally would use (1 January A.D. 1), since we're not exposing it.
3619 * We're only building the value so we can turn around and get the
3620 * normalised values for the year, month, day-of-month, and day-of-year.
3622 * For going backward, we need to bias the value we're using so that we find
3623 * the right year value. (Basically, we don't want the contribution of
3624 * March 1st to the number to apply while deriving the year). Having done
3625 * that, we 'count up' the contribution to the year number by accounting for
3626 * full quadracenturies (400-year periods) with their extra leap days, plus
3627 * the contribution from full centuries (to avoid counting in the lost leap
3628 * days), plus the contribution from full quad-years (to count in the normal
3629 * leap days), plus the leftover contribution from any non-leap years.
3630 * At this point, if we were working with an actual leap day, we'll have 0
3631 * days left over. This is also true for March 1st, however. So, we have
3632 * to special-case that result, and (earlier) keep track of the 'odd'
3633 * century and year contributions. If we got 4 extra centuries in a qcent,
3634 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3635 * Otherwise, we add back in the earlier bias we removed (the 123 from
3636 * figuring in March 1st), find the month index (integer division by 30.6),
3637 * and the remainder is the day-of-month. We then have to convert back to
3638 * 'real' months (including fixing January and February from being 14/15 in
3639 * the previous year to being in the proper year). After that, to get
3640 * tm_yday, we work with the normalised year and get a new yearday value for
3641 * January 1st, which we subtract from the yearday value we had earlier,
3642 * representing the date we've re-built. This is done from January 1
3643 * because tm_yday is 0-origin.
3645 * Since POSIX time routines are only guaranteed to work for times since the
3646 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3647 * applies Gregorian calendar rules even to dates before the 16th century
3648 * doesn't bother me. Besides, you'd need cultural context for a given
3649 * date to know whether it was Julian or Gregorian calendar, and that's
3650 * outside the scope for this routine. Since we convert back based on the
3651 * same rules we used to build the yearday, you'll only get strange results
3652 * for input which needed normalising, or for the 'odd' century years which
3653 * were leap years in the Julian calander but not in the Gregorian one.
3654 * I can live with that.
3656 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3657 * that's still outside the scope for POSIX time manipulation, so I don't
3661 year = 1900 + ptm->tm_year;
3662 month = ptm->tm_mon;
3663 mday = ptm->tm_mday;
3664 /* allow given yday with no month & mday to dominate the result */
3665 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3668 jday = 1 + ptm->tm_yday;
3677 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3678 yearday += month*MONTH_TO_DAYS + mday + jday;
3680 * Note that we don't know when leap-seconds were or will be,
3681 * so we have to trust the user if we get something which looks
3682 * like a sensible leap-second. Wild values for seconds will
3683 * be rationalised, however.
3685 if ((unsigned) ptm->tm_sec <= 60) {
3692 secs += 60 * ptm->tm_min;
3693 secs += SECS_PER_HOUR * ptm->tm_hour;
3695 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3696 /* got negative remainder, but need positive time */
3697 /* back off an extra day to compensate */
3698 yearday += (secs/SECS_PER_DAY)-1;
3699 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3702 yearday += (secs/SECS_PER_DAY);
3703 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3706 else if (secs >= SECS_PER_DAY) {
3707 yearday += (secs/SECS_PER_DAY);
3708 secs %= SECS_PER_DAY;
3710 ptm->tm_hour = secs/SECS_PER_HOUR;
3711 secs %= SECS_PER_HOUR;
3712 ptm->tm_min = secs/60;
3714 ptm->tm_sec += secs;
3715 /* done with time of day effects */
3717 * The algorithm for yearday has (so far) left it high by 428.
3718 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3719 * bias it by 123 while trying to figure out what year it
3720 * really represents. Even with this tweak, the reverse
3721 * translation fails for years before A.D. 0001.
3722 * It would still fail for Feb 29, but we catch that one below.
3724 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3725 yearday -= YEAR_ADJUST;
3726 year = (yearday / DAYS_PER_QCENT) * 400;
3727 yearday %= DAYS_PER_QCENT;
3728 odd_cent = yearday / DAYS_PER_CENT;
3729 year += odd_cent * 100;
3730 yearday %= DAYS_PER_CENT;
3731 year += (yearday / DAYS_PER_QYEAR) * 4;
3732 yearday %= DAYS_PER_QYEAR;
3733 odd_year = yearday / DAYS_PER_YEAR;
3735 yearday %= DAYS_PER_YEAR;
3736 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3741 yearday += YEAR_ADJUST; /* recover March 1st crock */
3742 month = yearday*DAYS_TO_MONTH;
3743 yearday -= month*MONTH_TO_DAYS;
3744 /* recover other leap-year adjustment */
3753 ptm->tm_year = year - 1900;
3755 ptm->tm_mday = yearday;
3756 ptm->tm_mon = month;
3760 ptm->tm_mon = month - 1;
3762 /* re-build yearday based on Jan 1 to get tm_yday */
3764 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3765 yearday += 14*MONTH_TO_DAYS + 1;
3766 ptm->tm_yday = jday - yearday;
3767 /* fix tm_wday if not overridden by caller */
3768 if ((unsigned)ptm->tm_wday > 6)
3769 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3773 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)
3781 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3784 mytm.tm_hour = hour;
3785 mytm.tm_mday = mday;
3787 mytm.tm_year = year;
3788 mytm.tm_wday = wday;
3789 mytm.tm_yday = yday;
3790 mytm.tm_isdst = isdst;
3792 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3793 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3798 #ifdef HAS_TM_TM_GMTOFF
3799 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3801 #ifdef HAS_TM_TM_ZONE
3802 mytm.tm_zone = mytm2.tm_zone;
3807 Newx(buf, buflen, char);
3808 len = strftime(buf, buflen, fmt, &mytm);
3810 ** The following is needed to handle to the situation where
3811 ** tmpbuf overflows. Basically we want to allocate a buffer
3812 ** and try repeatedly. The reason why it is so complicated
3813 ** is that getting a return value of 0 from strftime can indicate
3814 ** one of the following:
3815 ** 1. buffer overflowed,
3816 ** 2. illegal conversion specifier, or
3817 ** 3. the format string specifies nothing to be returned(not
3818 ** an error). This could be because format is an empty string
3819 ** or it specifies %p that yields an empty string in some locale.
3820 ** If there is a better way to make it portable, go ahead by
3823 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3826 /* Possibly buf overflowed - try again with a bigger buf */
3827 const int fmtlen = strlen(fmt);
3828 const int bufsize = fmtlen + buflen;
3830 Newx(buf, bufsize, char);
3832 buflen = strftime(buf, bufsize, fmt, &mytm);
3833 if (buflen > 0 && buflen < bufsize)
3835 /* heuristic to prevent out-of-memory errors */
3836 if (bufsize > 100*fmtlen) {
3841 Renew(buf, bufsize*2, char);
3846 Perl_croak(aTHX_ "panic: no strftime");
3852 #define SV_CWD_RETURN_UNDEF \
3853 sv_setsv(sv, &PL_sv_undef); \
3856 #define SV_CWD_ISDOT(dp) \
3857 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3858 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3861 =head1 Miscellaneous Functions
3863 =for apidoc getcwd_sv
3865 Fill the sv with current working directory
3870 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3871 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3872 * getcwd(3) if available
3873 * Comments from the orignal:
3874 * This is a faster version of getcwd. It's also more dangerous
3875 * because you might chdir out of a directory that you can't chdir
3879 Perl_getcwd_sv(pTHX_ register SV *sv)
3883 #ifndef INCOMPLETE_TAINTS
3889 char buf[MAXPATHLEN];
3891 /* Some getcwd()s automatically allocate a buffer of the given
3892 * size from the heap if they are given a NULL buffer pointer.
3893 * The problem is that this behaviour is not portable. */
3894 if (getcwd(buf, sizeof(buf) - 1)) {
3899 sv_setsv(sv, &PL_sv_undef);
3907 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3911 SvUPGRADE(sv, SVt_PV);
3913 if (PerlLIO_lstat(".", &statbuf) < 0) {
3914 SV_CWD_RETURN_UNDEF;
3917 orig_cdev = statbuf.st_dev;
3918 orig_cino = statbuf.st_ino;
3927 if (PerlDir_chdir("..") < 0) {
3928 SV_CWD_RETURN_UNDEF;
3930 if (PerlLIO_stat(".", &statbuf) < 0) {
3931 SV_CWD_RETURN_UNDEF;
3934 cdev = statbuf.st_dev;
3935 cino = statbuf.st_ino;
3937 if (odev == cdev && oino == cino) {
3940 if (!(dir = PerlDir_open("."))) {
3941 SV_CWD_RETURN_UNDEF;
3944 while ((dp = PerlDir_read(dir)) != NULL) {
3946 const int namelen = dp->d_namlen;
3948 const int namelen = strlen(dp->d_name);
3951 if (SV_CWD_ISDOT(dp)) {
3955 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3956 SV_CWD_RETURN_UNDEF;
3959 tdev = statbuf.st_dev;
3960 tino = statbuf.st_ino;
3961 if (tino == oino && tdev == odev) {
3967 SV_CWD_RETURN_UNDEF;
3970 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3971 SV_CWD_RETURN_UNDEF;
3974 SvGROW(sv, pathlen + namelen + 1);
3978 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3981 /* prepend current directory to the front */
3983 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3984 pathlen += (namelen + 1);
3986 #ifdef VOID_CLOSEDIR
3989 if (PerlDir_close(dir) < 0) {
3990 SV_CWD_RETURN_UNDEF;
3996 SvCUR_set(sv, pathlen);
4000 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4001 SV_CWD_RETURN_UNDEF;
4004 if (PerlLIO_stat(".", &statbuf) < 0) {
4005 SV_CWD_RETURN_UNDEF;
4008 cdev = statbuf.st_dev;
4009 cino = statbuf.st_ino;
4011 if (cdev != orig_cdev || cino != orig_cino) {
4012 Perl_croak(aTHX_ "Unstable directory path, "
4013 "current directory changed unexpectedly");
4025 =for apidoc scan_version
4027 Returns a pointer to the next character after the parsed
4028 version string, as well as upgrading the passed in SV to
4031 Function must be called with an already existing SV like
4034 s = scan_version(s,SV *sv, bool qv);
4036 Performs some preprocessing to the string to ensure that
4037 it has the correct characteristics of a version. Flags the
4038 object if it contains an underscore (which denotes this
4039 is a alpha version). The boolean qv denotes that the version
4040 should be interpreted as if it had multiple decimals, even if
4047 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4055 AV * const av = newAV();
4056 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4057 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4059 #ifndef NODEFAULT_SHAREKEYS
4060 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4063 while (isSPACE(*s)) /* leading whitespace is OK */
4067 s++; /* get past 'v' */
4068 qv = 1; /* force quoted version processing */
4071 start = last = pos = s;
4073 /* pre-scan the input string to check for decimals/underbars */
4074 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4079 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4083 else if ( *pos == '_' )
4086 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4088 width = pos - last - 1; /* natural width of sub-version */
4093 if ( alpha && !saw_period )
4094 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4096 if ( saw_period > 1 )
4097 qv = 1; /* force quoted version processing */
4102 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4104 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4105 if ( !qv && width < 3 )
4106 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4108 while (isDIGIT(*pos))
4110 if (!isALPHA(*pos)) {
4116 /* this is atoi() that delimits on underscores */
4117 const char *end = pos;
4121 /* the following if() will only be true after the decimal
4122 * point of a version originally created with a bare
4123 * floating point number, i.e. not quoted in any way
4125 if ( !qv && s > start && saw_period == 1 ) {
4129 rev += (*s - '0') * mult;
4131 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4132 Perl_croak(aTHX_ "Integer overflow in version");
4139 while (--end >= s) {
4141 rev += (*end - '0') * mult;
4143 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4144 Perl_croak(aTHX_ "Integer overflow in version");
4149 /* Append revision */
4150 av_push(av, newSViv(rev));
4153 else if ( *pos == '_' && isDIGIT(pos[1]) )
4155 else if ( isDIGIT(*pos) )
4162 while ( isDIGIT(*pos) )
4167 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4175 if ( qv ) { /* quoted versions always get at least three terms*/
4176 I32 len = av_len(av);
4177 /* This for loop appears to trigger a compiler bug on OS X, as it
4178 loops infinitely. Yes, len is negative. No, it makes no sense.
4179 Compiler in question is:
4180 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4181 for ( len = 2 - len; len > 0; len-- )
4182 av_push((AV *)sv, newSViv(0));
4186 av_push(av, newSViv(0));
4189 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4190 av_push(av, newSViv(0));
4192 /* And finally, store the AV in the hash */
4193 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4198 =for apidoc new_version
4200 Returns a new version object based on the passed in SV:
4202 SV *sv = new_version(SV *ver);
4204 Does not alter the passed in ver SV. See "upg_version" if you
4205 want to upgrade the SV.
4211 Perl_new_version(pTHX_ SV *ver)
4214 SV * const rv = newSV(0);
4215 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4218 AV * const av = newAV();
4220 /* This will get reblessed later if a derived class*/
4221 SV * const hv = newSVrv(rv, "version");
4222 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4223 #ifndef NODEFAULT_SHAREKEYS
4224 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4230 /* Begin copying all of the elements */
4231 if ( hv_exists((HV *)ver, "qv", 2) )
4232 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4234 if ( hv_exists((HV *)ver, "alpha", 5) )
4235 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4237 if ( hv_exists((HV*)ver, "width", 5 ) )
4239 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4240 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4243 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4244 /* This will get reblessed later if a derived class*/
4245 for ( key = 0; key <= av_len(sav); key++ )
4247 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4248 av_push(av, newSViv(rev));
4251 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4256 const MAGIC* const mg = SvVSTRING_mg(ver);
4257 if ( mg ) { /* already a v-string */
4258 const STRLEN len = mg->mg_len;
4259 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4260 sv_setpvn(rv,version,len);
4265 sv_setsv(rv,ver); /* make a duplicate */
4270 return upg_version(rv);
4274 =for apidoc upg_version
4276 In-place upgrade of the supplied SV to a version object.
4278 SV *sv = upg_version(SV *sv);
4280 Returns a pointer to the upgraded SV.
4286 Perl_upg_version(pTHX_ SV *ver)
4288 const char *version, *s;
4294 if ( SvNOK(ver) ) /* may get too much accuracy */
4297 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4298 while (tbuf[len-1] == '0' && len > 0) len--;
4299 version = savepvn(tbuf, len);
4302 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4303 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4307 else /* must be a string or something like a string */
4309 version = savepv(SvPV_nolen(ver));
4311 s = scan_version(version, ver, qv);
4313 if(ckWARN(WARN_MISC))
4314 Perl_warner(aTHX_ packWARN(WARN_MISC),
4315 "Version string '%s' contains invalid data; "
4316 "ignoring: '%s'", version, s);
4324 Validates that the SV contains a valid version object.
4326 bool vverify(SV *vobj);
4328 Note that it only confirms the bare minimum structure (so as not to get
4329 confused by derived classes which may contain additional hash entries):
4333 =item * The SV contains a [reference to a] hash
4335 =item * The hash contains a "version" key
4337 =item * The "version" key has [a reference to] an AV as its value
4345 Perl_vverify(pTHX_ SV *vs)
4351 /* see if the appropriate elements exist */
4352 if ( SvTYPE(vs) == SVt_PVHV
4353 && hv_exists((HV*)vs, "version", 7)
4354 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4355 && SvTYPE(sv) == SVt_PVAV )
4364 Accepts a version object and returns the normalized floating
4365 point representation. Call like:
4369 NOTE: you can pass either the object directly or the SV
4370 contained within the RV.
4376 Perl_vnumify(pTHX_ SV *vs)
4381 SV * const sv = newSV(0);
4387 Perl_croak(aTHX_ "Invalid version object");
4389 /* see if various flags exist */
4390 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4392 if ( hv_exists((HV*)vs, "width", 5 ) )
4393 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4398 /* attempt to retrieve the version array */
4399 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4411 digit = SvIV(*av_fetch(av, 0, 0));
4412 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4413 for ( i = 1 ; i < len ; i++ )
4415 digit = SvIV(*av_fetch(av, i, 0));
4417 const int denom = (width == 2 ? 10 : 100);
4418 const div_t term = div((int)PERL_ABS(digit),denom);
4419 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4422 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4428 digit = SvIV(*av_fetch(av, len, 0));
4429 if ( alpha && width == 3 ) /* alpha version */
4431 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4435 sv_catpvs(sv, "000");
4443 Accepts a version object and returns the normalized string
4444 representation. Call like:
4448 NOTE: you can pass either the object directly or the SV
4449 contained within the RV.
4455 Perl_vnormal(pTHX_ SV *vs)
4459 SV * const sv = newSV(0);
4465 Perl_croak(aTHX_ "Invalid version object");
4467 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4469 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4477 digit = SvIV(*av_fetch(av, 0, 0));
4478 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4479 for ( i = 1 ; i < len ; i++ ) {
4480 digit = SvIV(*av_fetch(av, i, 0));
4481 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4486 /* handle last digit specially */
4487 digit = SvIV(*av_fetch(av, len, 0));
4489 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4491 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4494 if ( len <= 2 ) { /* short version, must be at least three */
4495 for ( len = 2 - len; len != 0; len-- )
4502 =for apidoc vstringify
4504 In order to maintain maximum compatibility with earlier versions
4505 of Perl, this function will return either the floating point
4506 notation or the multiple dotted notation, depending on whether
4507 the original version contained 1 or more dots, respectively
4513 Perl_vstringify(pTHX_ SV *vs)
4519 Perl_croak(aTHX_ "Invalid version object");
4521 if ( hv_exists((HV *)vs, "qv", 2) )
4530 Version object aware cmp. Both operands must already have been
4531 converted into version objects.
4537 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4540 bool lalpha = FALSE;
4541 bool ralpha = FALSE;
4550 if ( !vverify(lhv) )
4551 Perl_croak(aTHX_ "Invalid version object");
4553 if ( !vverify(rhv) )
4554 Perl_croak(aTHX_ "Invalid version object");
4556 /* get the left hand term */
4557 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4558 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4561 /* and the right hand term */
4562 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4563 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4571 while ( i <= m && retval == 0 )
4573 left = SvIV(*av_fetch(lav,i,0));
4574 right = SvIV(*av_fetch(rav,i,0));
4582 /* tiebreaker for alpha with identical terms */
4583 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4585 if ( lalpha && !ralpha )
4589 else if ( ralpha && !lalpha)
4595 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4599 while ( i <= r && retval == 0 )
4601 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4602 retval = -1; /* not a match after all */
4608 while ( i <= l && retval == 0 )
4610 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4611 retval = +1; /* not a match after all */
4619 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4620 # define EMULATE_SOCKETPAIR_UDP
4623 #ifdef EMULATE_SOCKETPAIR_UDP
4625 S_socketpair_udp (int fd[2]) {
4627 /* Fake a datagram socketpair using UDP to localhost. */
4628 int sockets[2] = {-1, -1};
4629 struct sockaddr_in addresses[2];
4631 Sock_size_t size = sizeof(struct sockaddr_in);
4632 unsigned short port;
4635 memset(&addresses, 0, sizeof(addresses));
4638 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4639 if (sockets[i] == -1)
4640 goto tidy_up_and_fail;
4642 addresses[i].sin_family = AF_INET;
4643 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4644 addresses[i].sin_port = 0; /* kernel choses port. */
4645 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4646 sizeof(struct sockaddr_in)) == -1)
4647 goto tidy_up_and_fail;
4650 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4651 for each connect the other socket to it. */
4654 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4656 goto tidy_up_and_fail;
4657 if (size != sizeof(struct sockaddr_in))
4658 goto abort_tidy_up_and_fail;
4659 /* !1 is 0, !0 is 1 */
4660 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4661 sizeof(struct sockaddr_in)) == -1)
4662 goto tidy_up_and_fail;
4665 /* Now we have 2 sockets connected to each other. I don't trust some other
4666 process not to have already sent a packet to us (by random) so send
4667 a packet from each to the other. */
4670 /* I'm going to send my own port number. As a short.
4671 (Who knows if someone somewhere has sin_port as a bitfield and needs
4672 this routine. (I'm assuming crays have socketpair)) */
4673 port = addresses[i].sin_port;
4674 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4675 if (got != sizeof(port)) {
4677 goto tidy_up_and_fail;
4678 goto abort_tidy_up_and_fail;
4682 /* Packets sent. I don't trust them to have arrived though.
4683 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4684 connect to localhost will use a second kernel thread. In 2.6 the
4685 first thread running the connect() returns before the second completes,
4686 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4687 returns 0. Poor programs have tripped up. One poor program's authors'
4688 had a 50-1 reverse stock split. Not sure how connected these were.)
4689 So I don't trust someone not to have an unpredictable UDP stack.
4693 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4694 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4698 FD_SET((unsigned int)sockets[0], &rset);
4699 FD_SET((unsigned int)sockets[1], &rset);
4701 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4702 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4703 || !FD_ISSET(sockets[1], &rset)) {
4704 /* I hope this is portable and appropriate. */
4706 goto tidy_up_and_fail;
4707 goto abort_tidy_up_and_fail;
4711 /* And the paranoia department even now doesn't trust it to have arrive
4712 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4714 struct sockaddr_in readfrom;
4715 unsigned short buffer[2];
4720 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4721 sizeof(buffer), MSG_DONTWAIT,
4722 (struct sockaddr *) &readfrom, &size);
4724 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4726 (struct sockaddr *) &readfrom, &size);
4730 goto tidy_up_and_fail;
4731 if (got != sizeof(port)
4732 || size != sizeof(struct sockaddr_in)
4733 /* Check other socket sent us its port. */
4734 || buffer[0] != (unsigned short) addresses[!i].sin_port
4735 /* Check kernel says we got the datagram from that socket */
4736 || readfrom.sin_family != addresses[!i].sin_family
4737 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4738 || readfrom.sin_port != addresses[!i].sin_port)
4739 goto abort_tidy_up_and_fail;
4742 /* My caller (my_socketpair) has validated that this is non-NULL */
4745 /* I hereby declare this connection open. May God bless all who cross
4749 abort_tidy_up_and_fail:
4750 errno = ECONNABORTED;
4753 const int save_errno = errno;
4754 if (sockets[0] != -1)
4755 PerlLIO_close(sockets[0]);
4756 if (sockets[1] != -1)
4757 PerlLIO_close(sockets[1]);
4762 #endif /* EMULATE_SOCKETPAIR_UDP */
4764 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4766 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4767 /* Stevens says that family must be AF_LOCAL, protocol 0.
4768 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4773 struct sockaddr_in listen_addr;
4774 struct sockaddr_in connect_addr;
4779 || family != AF_UNIX
4782 errno = EAFNOSUPPORT;
4790 #ifdef EMULATE_SOCKETPAIR_UDP
4791 if (type == SOCK_DGRAM)
4792 return S_socketpair_udp(fd);
4795 listener = PerlSock_socket(AF_INET, type, 0);
4798 memset(&listen_addr, 0, sizeof(listen_addr));
4799 listen_addr.sin_family = AF_INET;
4800 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4801 listen_addr.sin_port = 0; /* kernel choses port. */
4802 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4803 sizeof(listen_addr)) == -1)
4804 goto tidy_up_and_fail;
4805 if (PerlSock_listen(listener, 1) == -1)
4806 goto tidy_up_and_fail;
4808 connector = PerlSock_socket(AF_INET, type, 0);
4809 if (connector == -1)
4810 goto tidy_up_and_fail;
4811 /* We want to find out the port number to connect to. */
4812 size = sizeof(connect_addr);
4813 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4815 goto tidy_up_and_fail;
4816 if (size != sizeof(connect_addr))
4817 goto abort_tidy_up_and_fail;
4818 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4819 sizeof(connect_addr)) == -1)
4820 goto tidy_up_and_fail;
4822 size = sizeof(listen_addr);
4823 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4826 goto tidy_up_and_fail;
4827 if (size != sizeof(listen_addr))
4828 goto abort_tidy_up_and_fail;
4829 PerlLIO_close(listener);
4830 /* Now check we are talking to ourself by matching port and host on the
4832 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4834 goto tidy_up_and_fail;
4835 if (size != sizeof(connect_addr)
4836 || listen_addr.sin_family != connect_addr.sin_family
4837 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4838 || listen_addr.sin_port != connect_addr.sin_port) {
4839 goto abort_tidy_up_and_fail;
4845 abort_tidy_up_and_fail:
4847 errno = ECONNABORTED; /* This would be the standard thing to do. */
4849 # ifdef ECONNREFUSED
4850 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4852 errno = ETIMEDOUT; /* Desperation time. */
4857 const int save_errno = errno;
4859 PerlLIO_close(listener);
4860 if (connector != -1)
4861 PerlLIO_close(connector);
4863 PerlLIO_close(acceptor);
4869 /* In any case have a stub so that there's code corresponding
4870 * to the my_socketpair in global.sym. */
4872 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4873 #ifdef HAS_SOCKETPAIR
4874 return socketpair(family, type, protocol, fd);
4883 =for apidoc sv_nosharing
4885 Dummy routine which "shares" an SV when there is no sharing module present.
4886 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4887 Exists to avoid test for a NULL function pointer and because it could
4888 potentially warn under some level of strict-ness.
4894 Perl_sv_nosharing(pTHX_ SV *sv)
4896 PERL_UNUSED_CONTEXT;
4897 PERL_UNUSED_ARG(sv);
4901 Perl_parse_unicode_opts(pTHX_ const char **popt)
4903 const char *p = *popt;
4908 opt = (U32) atoi(p);
4909 while (isDIGIT(*p)) p++;
4910 if (*p && *p != '\n' && *p != '\r')
4911 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4916 case PERL_UNICODE_STDIN:
4917 opt |= PERL_UNICODE_STDIN_FLAG; break;
4918 case PERL_UNICODE_STDOUT:
4919 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4920 case PERL_UNICODE_STDERR:
4921 opt |= PERL_UNICODE_STDERR_FLAG; break;
4922 case PERL_UNICODE_STD:
4923 opt |= PERL_UNICODE_STD_FLAG; break;
4924 case PERL_UNICODE_IN:
4925 opt |= PERL_UNICODE_IN_FLAG; break;
4926 case PERL_UNICODE_OUT:
4927 opt |= PERL_UNICODE_OUT_FLAG; break;
4928 case PERL_UNICODE_INOUT:
4929 opt |= PERL_UNICODE_INOUT_FLAG; break;
4930 case PERL_UNICODE_LOCALE:
4931 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4932 case PERL_UNICODE_ARGV:
4933 opt |= PERL_UNICODE_ARGV_FLAG; break;
4934 case PERL_UNICODE_UTF8CACHEASSERT:
4935 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4937 if (*p != '\n' && *p != '\r')
4939 "Unknown Unicode option letter '%c'", *p);
4945 opt = PERL_UNICODE_DEFAULT_FLAGS;
4947 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4948 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4949 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4961 * This is really just a quick hack which grabs various garbage
4962 * values. It really should be a real hash algorithm which
4963 * spreads the effect of every input bit onto every output bit,
4964 * if someone who knows about such things would bother to write it.
4965 * Might be a good idea to add that function to CORE as well.
4966 * No numbers below come from careful analysis or anything here,
4967 * except they are primes and SEED_C1 > 1E6 to get a full-width
4968 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4969 * probably be bigger too.
4972 # define SEED_C1 1000003
4973 #define SEED_C4 73819
4975 # define SEED_C1 25747
4976 #define SEED_C4 20639
4980 #define SEED_C5 26107
4982 #ifndef PERL_NO_DEV_RANDOM
4987 # include <starlet.h>
4988 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4989 * in 100-ns units, typically incremented ever 10 ms. */
4990 unsigned int when[2];
4992 # ifdef HAS_GETTIMEOFDAY
4993 struct timeval when;
4999 /* This test is an escape hatch, this symbol isn't set by Configure. */
5000 #ifndef PERL_NO_DEV_RANDOM
5001 #ifndef PERL_RANDOM_DEVICE
5002 /* /dev/random isn't used by default because reads from it will block
5003 * if there isn't enough entropy available. You can compile with
5004 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5005 * is enough real entropy to fill the seed. */
5006 # define PERL_RANDOM_DEVICE "/dev/urandom"
5008 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5010 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5019 _ckvmssts(sys$gettim(when));
5020 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5022 # ifdef HAS_GETTIMEOFDAY
5023 PerlProc_gettimeofday(&when,NULL);
5024 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5027 u = (U32)SEED_C1 * when;
5030 u += SEED_C3 * (U32)PerlProc_getpid();
5031 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5032 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5033 u += SEED_C5 * (U32)PTR2UV(&when);
5039 Perl_get_hash_seed(pTHX)
5042 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5046 while (isSPACE(*s)) s++;
5047 if (s && isDIGIT(*s))
5048 myseed = (UV)Atoul(s);
5050 #ifdef USE_HASH_SEED_EXPLICIT
5054 /* Compute a random seed */
5055 (void)seedDrand01((Rand_seed_t)seed());
5056 myseed = (UV)(Drand01() * (NV)UV_MAX);
5057 #if RANDBITS < (UVSIZE * 8)
5058 /* Since there are not enough randbits to to reach all
5059 * the bits of a UV, the low bits might need extra
5060 * help. Sum in another random number that will
5061 * fill in the low bits. */
5063 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5064 #endif /* RANDBITS < (UVSIZE * 8) */
5065 if (myseed == 0) { /* Superparanoia. */
5066 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5068 Perl_croak(aTHX_ "Your random numbers are not that random");
5071 PL_rehash_seed_set = TRUE;
5078 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5080 const char * const stashpv = CopSTASHPV(c);
5081 const char * const name = HvNAME_get(hv);
5082 PERL_UNUSED_CONTEXT;
5084 if (stashpv == name)
5086 if (stashpv && name)
5087 if (strEQ(stashpv, name))
5094 #ifdef PERL_GLOBAL_STRUCT
5097 Perl_init_global_struct(pTHX)
5099 struct perl_vars *plvarsp = NULL;
5100 #ifdef PERL_GLOBAL_STRUCT
5101 # define PERL_GLOBAL_STRUCT_INIT
5102 # include "opcode.h" /* the ppaddr and check */
5103 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5104 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5105 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5106 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5107 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5111 plvarsp = PL_VarsPtr;
5112 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5118 # define PERLVAR(var,type) /**/
5119 # define PERLVARA(var,n,type) /**/
5120 # define PERLVARI(var,type,init) plvarsp->var = init;
5121 # define PERLVARIC(var,type,init) plvarsp->var = init;
5122 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5123 # include "perlvars.h"
5129 # ifdef PERL_GLOBAL_STRUCT
5130 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5131 if (!plvarsp->Gppaddr)
5133 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5134 if (!plvarsp->Gcheck)
5136 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5137 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5139 # ifdef PERL_SET_VARS
5140 PERL_SET_VARS(plvarsp);
5142 # undef PERL_GLOBAL_STRUCT_INIT
5147 #endif /* PERL_GLOBAL_STRUCT */
5149 #ifdef PERL_GLOBAL_STRUCT
5152 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5154 #ifdef PERL_GLOBAL_STRUCT
5155 # ifdef PERL_UNSET_VARS
5156 PERL_UNSET_VARS(plvarsp);
5158 free(plvarsp->Gppaddr);
5159 free(plvarsp->Gcheck);
5160 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5166 #endif /* PERL_GLOBAL_STRUCT */
5171 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5173 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5174 * variable PERL_MEM_LOG will be consulted, and if the integer value
5175 * of that is true, the logging will happen. (The default is to
5176 * always log if the PERL_MEM_LOG define was in effect.)
5180 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5181 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5183 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5186 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5187 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5188 * in which case the environment variable PERL_MEM_LOG_FD will be
5189 * consulted for the file descriptor number to use.
5191 #ifndef PERL_MEM_LOG_FD
5192 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5196 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)
5198 #ifdef PERL_MEM_LOG_STDERR
5199 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5202 # ifdef PERL_MEM_LOG_ENV
5203 s = getenv("PERL_MEM_LOG");
5204 if (s ? atoi(s) : 0)
5207 /* We can't use SVs or PerlIO for obvious reasons,
5208 * so we'll use stdio and low-level IO instead. */
5209 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5210 # ifdef PERL_MEM_LOG_TIMESTAMP
5212 # ifdef HAS_GETTIMEOFDAY
5213 gettimeofday(&tv, 0);
5215 /* If there are other OS specific ways of hires time than
5216 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5217 * probably that they would be used to fill in the struct
5223 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5224 # ifdef PERL_MEM_LOG_TIMESTAMP
5227 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5228 " %s = %"IVdf": %"UVxf"\n",
5229 # ifdef PERL_MEM_LOG_TIMESTAMP
5230 (int)tv.tv_sec, (int)tv.tv_usec,
5232 filename, linenumber, funcname, n, typesize,
5233 typename, n * typesize, PTR2UV(newalloc));
5234 # ifdef PERL_MEM_LOG_ENV_FD
5235 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5236 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5238 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5247 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)
5249 #ifdef PERL_MEM_LOG_STDERR
5250 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5253 # ifdef PERL_MEM_LOG_ENV
5254 s = PerlEnv_getenv("PERL_MEM_LOG");
5255 if (s ? atoi(s) : 0)
5258 /* We can't use SVs or PerlIO for obvious reasons,
5259 * so we'll use stdio and low-level IO instead. */
5260 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5261 # ifdef PERL_MEM_LOG_TIMESTAMP
5263 gettimeofday(&tv, 0);
5268 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5269 # ifdef PERL_MEM_LOG_TIMESTAMP
5272 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5273 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5274 # ifdef PERL_MEM_LOG_TIMESTAMP
5275 (int)tv.tv_sec, (int)tv.tv_usec,
5277 filename, linenumber, funcname, n, typesize,
5278 typename, n * typesize, PTR2UV(oldalloc),
5280 # ifdef PERL_MEM_LOG_ENV_FD
5281 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5282 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5284 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5293 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5295 #ifdef PERL_MEM_LOG_STDERR
5296 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5299 # ifdef PERL_MEM_LOG_ENV
5300 s = PerlEnv_getenv("PERL_MEM_LOG");
5301 if (s ? atoi(s) : 0)
5304 /* We can't use SVs or PerlIO for obvious reasons,
5305 * so we'll use stdio and low-level IO instead. */
5306 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5307 # ifdef PERL_MEM_LOG_TIMESTAMP
5309 gettimeofday(&tv, 0);
5314 PERL_MEM_LOG_SPRINTF_BUF_SIZE,
5315 # ifdef PERL_MEM_LOG_TIMESTAMP
5318 "free: %s:%d:%s: %"UVxf"\n",
5319 # ifdef PERL_MEM_LOG_TIMESTAMP
5320 (int)tv.tv_sec, (int)tv.tv_usec,
5322 filename, linenumber, funcname,
5324 # ifdef PERL_MEM_LOG_ENV_FD
5325 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5326 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5328 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5336 #endif /* PERL_MEM_LOG */
5339 =for apidoc my_sprintf
5341 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5342 the length of the string written to the buffer. Only rare pre-ANSI systems
5343 need the wrapper function - usually this is a direct call to C<sprintf>.
5347 #ifndef SPRINTF_RETURNS_STRLEN
5349 Perl_my_sprintf(char *buffer, const char* pat, ...)
5352 va_start(args, pat);
5353 vsprintf(buffer, pat, args);
5355 return strlen(buffer);
5360 =for apidoc my_snprintf
5362 The C library C<snprintf> functionality, if available and
5363 standards-compliant (uses C<vsnprintf>, actually). However, if the
5364 C<vsnprintf> is not available, will unfortunately use the unsafe
5365 C<vsprintf> which can overrun the buffer (there is an overrun check,
5366 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5367 getting C<vsnprintf>.
5372 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5377 va_start(ap, format);
5378 #ifdef HAS_VSNPRINTF
5379 retval = vsnprintf(buffer, len, format, ap);
5381 retval = vsprintf(buffer, format, ap);
5384 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5385 if (retval < 0 || (len > 0 && retval >= len))
5386 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5391 =for apidoc my_vsnprintf
5393 The C library C<vsnprintf> if available and standards-compliant.
5394 However, if if the C<vsnprintf> is not available, will unfortunately
5395 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5396 overrun check, but that may be too late). Consider using
5397 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5402 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5408 Perl_va_copy(ap, apc);
5409 # ifdef HAS_VSNPRINTF
5410 retval = vsnprintf(buffer, len, format, apc);
5412 retval = vsprintf(buffer, format, apc);
5415 # ifdef HAS_VSNPRINTF
5416 retval = vsnprintf(buffer, len, format, ap);
5418 retval = vsprintf(buffer, format, ap);
5420 #endif /* #ifdef NEED_VA_COPY */
5421 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5422 if (retval < 0 || (len > 0 && retval >= len))
5423 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5428 Perl_my_clearenv(pTHX)
5431 #if ! defined(PERL_MICRO)
5432 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5434 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5435 # if defined(USE_ENVIRON_ARRAY)
5436 # if defined(USE_ITHREADS)
5437 /* only the parent thread can clobber the process environment */
5438 if (PL_curinterp == aTHX)
5439 # endif /* USE_ITHREADS */
5441 # if ! defined(PERL_USE_SAFE_PUTENV)
5442 if ( !PL_use_safe_putenv) {
5444 if (environ == PL_origenviron)
5445 environ = (char**)safesysmalloc(sizeof(char*));
5447 for (i = 0; environ[i]; i++)
5448 (void)safesysfree(environ[i]);
5451 # else /* PERL_USE_SAFE_PUTENV */
5452 # if defined(HAS_CLEARENV)
5454 # elif defined(HAS_UNSETENV)
5455 int bsiz = 80; /* Most envvar names will be shorter than this. */
5456 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5457 while (*environ != NULL) {
5458 char *e = strchr(*environ, '=');
5459 int l = e ? e - *environ : strlen(*environ);
5461 (void)safesysfree(buf);
5463 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5465 strncpy(buf, *environ, l);
5467 (void)unsetenv(buf);
5469 (void)safesysfree(buf);
5470 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5471 /* Just null environ and accept the leakage. */
5473 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5474 # endif /* ! PERL_USE_SAFE_PUTENV */
5476 # endif /* USE_ENVIRON_ARRAY */
5477 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5478 #endif /* PERL_MICRO */
5481 #ifdef PERL_IMPLICIT_CONTEXT
5483 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5484 the global PL_my_cxt_index is incremented, and that value is assigned to
5485 that module's static my_cxt_index (who's address is passed as an arg).
5486 Then, for each interpreter this function is called for, it makes sure a
5487 void* slot is available to hang the static data off, by allocating or
5488 extending the interpreter's PL_my_cxt_list array */
5491 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5496 /* this module hasn't been allocated an index yet */
5497 MUTEX_LOCK(&PL_my_ctx_mutex);
5498 *index = PL_my_cxt_index++;
5499 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5502 /* make sure the array is big enough */
5503 if (PL_my_cxt_size <= *index) {
5504 if (PL_my_cxt_size) {
5505 while (PL_my_cxt_size <= *index)
5506 PL_my_cxt_size *= 2;
5507 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5510 PL_my_cxt_size = 16;
5511 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5514 /* newSV() allocates one more than needed */
5515 p = (void*)SvPVX(newSV(size-1));
5516 PL_my_cxt_list[*index] = p;
5517 Zero(p, size, char);
5524 * c-indentation-style: bsd
5526 * indent-tabs-mode: t
5529 * ex: set ts=8 sts=4 sw=4 noet: