3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
263 if (size * count > 0xffff) {
264 PerlIO_printf(Perl_error_log,
265 "Allocation too large: %lx\n", size * count) FLUSH;
268 #endif /* HAS_64K_LIMIT */
270 if ((long)size < 0 || (long)count < 0)
271 Perl_croak_nocontext("panic: calloc");
274 #ifdef PERL_TRACK_MEMPOOL
277 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
278 PERL_ALLOC_CHECK(ptr);
279 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
281 memset((void*)ptr, 0, size);
282 #ifdef PERL_TRACK_MEMPOOL
284 struct perl_memory_debug_header *const header
285 = (struct perl_memory_debug_header *)ptr;
287 header->interpreter = aTHX;
288 /* Link us into the list. */
289 header->prev = &PL_memory_debug_header;
290 header->next = PL_memory_debug_header.next;
291 PL_memory_debug_header.next = header;
292 header->next->prev = header;
296 ptr = (Malloc_t)((char*)ptr+sTHX);
303 return write_no_mem();
306 /* These must be defined when not using Perl's malloc for binary
311 Malloc_t Perl_malloc (MEM_SIZE nbytes)
314 return (Malloc_t)PerlMem_malloc(nbytes);
317 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
320 return (Malloc_t)PerlMem_calloc(elements, size);
323 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
326 return (Malloc_t)PerlMem_realloc(where, nbytes);
329 Free_t Perl_mfree (Malloc_t where)
337 /* copy a string up to some (non-backslashed) delimiter, if any */
340 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
345 for (tolen = 0; from < fromend; from++, tolen++) {
347 if (from[1] != delim) {
354 else if (*from == delim)
365 /* return ptr to little string in big string, NULL if not found */
366 /* This routine was donated by Corey Satten. */
369 Perl_instr(pTHX_ register const char *big, register const char *little)
380 register const char *s, *x;
383 for (x=big,s=little; *s; /**/ ) {
394 return (char*)(big-1);
399 /* same as instr but allow embedded nulls */
402 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
408 char first = *little++;
410 bigend -= lend - little;
412 while (big <= bigend) {
415 for (x=big,s=little; s < lend; x++,s++) {
419 return (char*)(big-1);
425 /* reverse of the above--find last substring */
428 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
430 register const char *bigbeg;
431 register const I32 first = *little;
432 register const char * const littleend = lend;
435 if (little >= littleend)
436 return (char*)bigend;
438 big = bigend - (littleend - little++);
439 while (big >= bigbeg) {
440 register const char *s, *x;
443 for (x=big+2,s=little; s < littleend; /**/ ) {
452 return (char*)(big+1);
457 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
459 /* As a space optimization, we do not compile tables for strings of length
460 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
461 special-cased in fbm_instr().
463 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
466 =head1 Miscellaneous Functions
468 =for apidoc fbm_compile
470 Analyses the string in order to make fast searches on it using fbm_instr()
471 -- the Boyer-Moore algorithm.
477 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
480 register const U8 *s;
486 if (flags & FBMcf_TAIL) {
487 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
488 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
489 if (mg && mg->mg_len >= 0)
492 s = (U8*)SvPV_force_mutable(sv, len);
493 if (len == 0) /* TAIL might be on a zero-length string. */
495 SvUPGRADE(sv, SVt_PVBM);
497 const unsigned char *sb;
498 const U8 mlen = (len>255) ? 255 : (U8)len;
501 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
502 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
503 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
504 memset((void*)table, mlen, 256);
505 table[-1] = (U8)flags;
507 sb = s - mlen + 1; /* first char (maybe) */
509 if (table[*s] == mlen)
514 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
517 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
518 for (i = 0; i < len; i++) {
519 if (PL_freq[s[i]] < frequency) {
521 frequency = PL_freq[s[i]];
524 BmRARE(sv) = s[rarest];
525 BmPREVIOUS(sv) = (U16)rarest;
526 BmUSEFUL(sv) = 100; /* Initial value */
527 if (flags & FBMcf_TAIL)
529 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
530 BmRARE(sv),BmPREVIOUS(sv)));
533 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
534 /* If SvTAIL is actually due to \Z or \z, this gives false positives
538 =for apidoc fbm_instr
540 Returns the location of the SV in the string delimited by C<str> and
541 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
542 does not have to be fbm_compiled, but the search will not be as fast
549 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
551 register unsigned char *s;
553 register const unsigned char *little
554 = (const unsigned char *)SvPV_const(littlestr,l);
555 register STRLEN littlelen = l;
556 register const I32 multiline = flags & FBMrf_MULTILINE;
558 if ((STRLEN)(bigend - big) < littlelen) {
559 if ( SvTAIL(littlestr)
560 && ((STRLEN)(bigend - big) == littlelen - 1)
562 || (*big == *little &&
563 memEQ((char *)big, (char *)little, littlelen - 1))))
568 if (littlelen <= 2) { /* Special-cased */
570 if (littlelen == 1) {
571 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
572 /* Know that bigend != big. */
573 if (bigend[-1] == '\n')
574 return (char *)(bigend - 1);
575 return (char *) bigend;
583 if (SvTAIL(littlestr))
584 return (char *) bigend;
588 return (char*)big; /* Cannot be SvTAIL! */
591 if (SvTAIL(littlestr) && !multiline) {
592 if (bigend[-1] == '\n' && bigend[-2] == *little)
593 return (char*)bigend - 2;
594 if (bigend[-1] == *little)
595 return (char*)bigend - 1;
599 /* This should be better than FBM if c1 == c2, and almost
600 as good otherwise: maybe better since we do less indirection.
601 And we save a lot of memory by caching no table. */
602 const unsigned char c1 = little[0];
603 const unsigned char c2 = little[1];
608 while (s <= bigend) {
618 goto check_1char_anchor;
629 goto check_1char_anchor;
632 while (s <= bigend) {
637 goto check_1char_anchor;
646 check_1char_anchor: /* One char and anchor! */
647 if (SvTAIL(littlestr) && (*bigend == *little))
648 return (char *)bigend; /* bigend is already decremented. */
651 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
652 s = bigend - littlelen;
653 if (s >= big && bigend[-1] == '\n' && *s == *little
654 /* Automatically of length > 2 */
655 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
657 return (char*)s; /* how sweet it is */
660 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
662 return (char*)s + 1; /* how sweet it is */
666 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
667 char * const b = ninstr((char*)big,(char*)bigend,
668 (char*)little, (char*)little + littlelen);
670 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
671 /* Chop \n from littlestr: */
672 s = bigend - littlelen + 1;
674 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
683 { /* Do actual FBM. */
684 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
685 register const unsigned char *oldlittle;
687 if (littlelen > (STRLEN)(bigend - big))
689 --littlelen; /* Last char found by table lookup */
692 little += littlelen; /* last char */
698 if ((tmp = table[*s])) {
699 if ((s += tmp) < bigend)
703 else { /* less expensive than calling strncmp() */
704 register unsigned char * const olds = s;
709 if (*--s == *--little)
711 s = olds + 1; /* here we pay the price for failure */
713 if (s < bigend) /* fake up continue to outer loop */
721 if ( s == bigend && (table[-1] & FBMcf_TAIL)
722 && memEQ((char *)(bigend - littlelen),
723 (char *)(oldlittle - littlelen), littlelen) )
724 return (char*)bigend - littlelen;
729 /* start_shift, end_shift are positive quantities which give offsets
730 of ends of some substring of bigstr.
731 If "last" we want the last occurrence.
732 old_posp is the way of communication between consequent calls if
733 the next call needs to find the .
734 The initial *old_posp should be -1.
736 Note that we take into account SvTAIL, so one can get extra
737 optimizations if _ALL flag is set.
740 /* If SvTAIL is actually due to \Z or \z, this gives false positives
741 if PL_multiline. In fact if !PL_multiline the authoritative answer
742 is not supported yet. */
745 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
748 register const unsigned char *big;
750 register I32 previous;
752 register const unsigned char *little;
753 register I32 stop_pos;
754 register const unsigned char *littleend;
757 assert(SvTYPE(littlestr) == SVt_PVBM);
760 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
761 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
763 if ( BmRARE(littlestr) == '\n'
764 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
765 little = (const unsigned char *)(SvPVX_const(littlestr));
766 littleend = little + SvCUR(littlestr);
773 little = (const unsigned char *)(SvPVX_const(littlestr));
774 littleend = little + SvCUR(littlestr);
776 /* The value of pos we can start at: */
777 previous = BmPREVIOUS(littlestr);
778 big = (const unsigned char *)(SvPVX_const(bigstr));
779 /* The value of pos we can stop at: */
780 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
781 if (previous + start_shift > stop_pos) {
783 stop_pos does not include SvTAIL in the count, so this check is incorrect
784 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
787 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
792 while (pos < previous + start_shift) {
793 if (!(pos += PL_screamnext[pos]))
798 register const unsigned char *s, *x;
799 if (pos >= stop_pos) break;
800 if (big[pos] != first)
802 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
808 if (s == littleend) {
810 if (!last) return (char *)(big+pos);
813 } while ( pos += PL_screamnext[pos] );
815 return (char *)(big+(*old_posp));
817 if (!SvTAIL(littlestr) || (end_shift > 0))
819 /* Ignore the trailing "\n". This code is not microoptimized */
820 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
821 stop_pos = littleend - little; /* Actual littlestr len */
826 && ((stop_pos == 1) ||
827 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
833 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
835 register const U8 *a = (const U8 *)s1;
836 register const U8 *b = (const U8 *)s2;
840 if (*a != *b && *a != PL_fold[*b])
848 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
851 register const U8 *a = (const U8 *)s1;
852 register const U8 *b = (const U8 *)s2;
856 if (*a != *b && *a != PL_fold_locale[*b])
863 /* copy a string to a safe spot */
866 =head1 Memory Management
870 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
871 string which is a duplicate of C<pv>. The size of the string is
872 determined by C<strlen()>. The memory allocated for the new string can
873 be freed with the C<Safefree()> function.
879 Perl_savepv(pTHX_ const char *pv)
886 const STRLEN pvlen = strlen(pv)+1;
887 Newx(newaddr, pvlen, char);
888 return (char*)memcpy(newaddr, pv, pvlen);
892 /* same thing but with a known length */
897 Perl's version of what C<strndup()> would be if it existed. Returns a
898 pointer to a newly allocated string which is a duplicate of the first
899 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
900 the new string can be freed with the C<Safefree()> function.
906 Perl_savepvn(pTHX_ const char *pv, register I32 len)
908 register char *newaddr;
911 Newx(newaddr,len+1,char);
912 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
914 /* might not be null terminated */
916 return (char *) CopyD(pv,newaddr,len,char);
919 return (char *) ZeroD(newaddr,len+1,char);
924 =for apidoc savesharedpv
926 A version of C<savepv()> which allocates the duplicate string in memory
927 which is shared between threads.
932 Perl_savesharedpv(pTHX_ const char *pv)
934 register char *newaddr;
939 pvlen = strlen(pv)+1;
940 newaddr = (char*)PerlMemShared_malloc(pvlen);
942 return write_no_mem();
944 return (char*)memcpy(newaddr, pv, pvlen);
950 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
951 the passed in SV using C<SvPV()>
957 Perl_savesvpv(pTHX_ SV *sv)
960 const char * const pv = SvPV_const(sv, len);
961 register char *newaddr;
964 Newx(newaddr,len,char);
965 return (char *) CopyD(pv,newaddr,len,char);
969 /* the SV for Perl_form() and mess() is not kept in an arena */
979 return sv_2mortal(newSVpvs(""));
984 /* Create as PVMG now, to avoid any upgrading later */
986 Newxz(any, 1, XPVMG);
987 SvFLAGS(sv) = SVt_PVMG;
988 SvANY(sv) = (void*)any;
990 SvREFCNT(sv) = 1 << 30; /* practically infinite */
995 #if defined(PERL_IMPLICIT_CONTEXT)
997 Perl_form_nocontext(const char* pat, ...)
1002 va_start(args, pat);
1003 retval = vform(pat, &args);
1007 #endif /* PERL_IMPLICIT_CONTEXT */
1010 =head1 Miscellaneous Functions
1013 Takes a sprintf-style format pattern and conventional
1014 (non-SV) arguments and returns the formatted string.
1016 (char *) Perl_form(pTHX_ const char* pat, ...)
1018 can be used any place a string (char *) is required:
1020 char * s = Perl_form("%d.%d",major,minor);
1022 Uses a single private buffer so if you want to format several strings you
1023 must explicitly copy the earlier strings away (and free the copies when you
1030 Perl_form(pTHX_ const char* pat, ...)
1034 va_start(args, pat);
1035 retval = vform(pat, &args);
1041 Perl_vform(pTHX_ const char *pat, va_list *args)
1043 SV * const sv = mess_alloc();
1044 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1048 #if defined(PERL_IMPLICIT_CONTEXT)
1050 Perl_mess_nocontext(const char *pat, ...)
1055 va_start(args, pat);
1056 retval = vmess(pat, &args);
1060 #endif /* PERL_IMPLICIT_CONTEXT */
1063 Perl_mess(pTHX_ const char *pat, ...)
1067 va_start(args, pat);
1068 retval = vmess(pat, &args);
1074 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1077 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1079 if (!o || o == PL_op)
1082 if (o->op_flags & OPf_KIDS) {
1084 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1087 /* If the OP_NEXTSTATE has been optimised away we can still use it
1088 * the get the file and line number. */
1090 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1091 cop = (const COP *)kid;
1093 /* Keep searching, and return when we've found something. */
1095 new_cop = closest_cop(cop, kid);
1101 /* Nothing found. */
1107 Perl_vmess(pTHX_ const char *pat, va_list *args)
1110 SV * const sv = mess_alloc();
1112 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1113 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1115 * Try and find the file and line for PL_op. This will usually be
1116 * PL_curcop, but it might be a cop that has been optimised away. We
1117 * can try to find such a cop by searching through the optree starting
1118 * from the sibling of PL_curcop.
1121 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1126 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1127 OutCopFILE(cop), (IV)CopLINE(cop));
1128 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1129 const bool line_mode = (RsSIMPLE(PL_rs) &&
1130 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1131 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1132 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1133 line_mode ? "line" : "chunk",
1134 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1137 sv_catpvs(sv, " during global destruction");
1138 sv_catpvs(sv, ".\n");
1144 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1150 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1151 && (io = GvIO(PL_stderrgv))
1152 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1159 SAVESPTR(PL_stderrgv);
1162 PUSHSTACKi(PERLSI_MAGIC);
1166 PUSHs(SvTIED_obj((SV*)io, mg));
1167 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1169 call_method("PRINT", G_SCALAR);
1177 /* SFIO can really mess with your errno */
1178 const int e = errno;
1180 PerlIO * const serr = Perl_error_log;
1182 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1183 (void)PerlIO_flush(serr);
1190 /* Common code used by vcroak, vdie, vwarn and vwarner */
1193 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1199 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1200 /* sv_2cv might call Perl_croak() or Perl_warner() */
1201 SV * const oldhook = *hook;
1208 cv = sv_2cv(oldhook, &stash, &gv, 0);
1210 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1220 if (warn || message) {
1221 msg = newSVpvn(message, msglen);
1222 SvFLAGS(msg) |= utf8;
1230 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1234 call_sv((SV*)cv, G_DISCARD);
1243 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1247 const char *message;
1250 SV * const msv = vmess(pat, args);
1251 if (PL_errors && SvCUR(PL_errors)) {
1252 sv_catsv(PL_errors, msv);
1253 message = SvPV_const(PL_errors, *msglen);
1254 SvCUR_set(PL_errors, 0);
1257 message = SvPV_const(msv,*msglen);
1258 *utf8 = SvUTF8(msv);
1264 DEBUG_S(PerlIO_printf(Perl_debug_log,
1265 "%p: die/croak: message = %s\ndiehook = %p\n",
1266 thr, message, PL_diehook));
1268 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1274 Perl_vdie(pTHX_ const char* pat, va_list *args)
1277 const char *message;
1278 const int was_in_eval = PL_in_eval;
1282 DEBUG_S(PerlIO_printf(Perl_debug_log,
1283 "%p: die: curstack = %p, mainstack = %p\n",
1284 thr, PL_curstack, PL_mainstack));
1286 message = vdie_croak_common(pat, args, &msglen, &utf8);
1288 PL_restartop = die_where(message, msglen);
1289 SvFLAGS(ERRSV) |= utf8;
1290 DEBUG_S(PerlIO_printf(Perl_debug_log,
1291 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1292 thr, PL_restartop, was_in_eval, PL_top_env));
1293 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1295 return PL_restartop;
1298 #if defined(PERL_IMPLICIT_CONTEXT)
1300 Perl_die_nocontext(const char* pat, ...)
1305 va_start(args, pat);
1306 o = vdie(pat, &args);
1310 #endif /* PERL_IMPLICIT_CONTEXT */
1313 Perl_die(pTHX_ const char* pat, ...)
1317 va_start(args, pat);
1318 o = vdie(pat, &args);
1324 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1327 const char *message;
1331 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1334 PL_restartop = die_where(message, msglen);
1335 SvFLAGS(ERRSV) |= utf8;
1339 message = SvPVx_const(ERRSV, msglen);
1341 write_to_stderr(message, msglen);
1345 #if defined(PERL_IMPLICIT_CONTEXT)
1347 Perl_croak_nocontext(const char *pat, ...)
1351 va_start(args, pat);
1356 #endif /* PERL_IMPLICIT_CONTEXT */
1359 =head1 Warning and Dieing
1363 This is the XSUB-writer's interface to Perl's C<die> function.
1364 Normally call this function the same way you call the C C<printf>
1365 function. Calling C<croak> returns control directly to Perl,
1366 sidestepping the normal C order of execution. See C<warn>.
1368 If you want to throw an exception object, assign the object to
1369 C<$@> and then pass C<NULL> to croak():
1371 errsv = get_sv("@", TRUE);
1372 sv_setsv(errsv, exception_object);
1379 Perl_croak(pTHX_ const char *pat, ...)
1382 va_start(args, pat);
1389 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1393 SV * const msv = vmess(pat, args);
1394 const I32 utf8 = SvUTF8(msv);
1395 const char * const message = SvPV_const(msv, msglen);
1398 if (vdie_common(message, msglen, utf8, TRUE))
1402 write_to_stderr(message, msglen);
1405 #if defined(PERL_IMPLICIT_CONTEXT)
1407 Perl_warn_nocontext(const char *pat, ...)
1411 va_start(args, pat);
1415 #endif /* PERL_IMPLICIT_CONTEXT */
1420 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1421 function the same way you call the C C<printf> function. See C<croak>.
1427 Perl_warn(pTHX_ const char *pat, ...)
1430 va_start(args, pat);
1435 #if defined(PERL_IMPLICIT_CONTEXT)
1437 Perl_warner_nocontext(U32 err, const char *pat, ...)
1441 va_start(args, pat);
1442 vwarner(err, pat, &args);
1445 #endif /* PERL_IMPLICIT_CONTEXT */
1448 Perl_warner(pTHX_ U32 err, const char* pat,...)
1451 va_start(args, pat);
1452 vwarner(err, pat, &args);
1457 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1460 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1461 SV * const msv = vmess(pat, args);
1463 const char * const message = SvPV_const(msv, msglen);
1464 const I32 utf8 = SvUTF8(msv);
1468 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1471 PL_restartop = die_where(message, msglen);
1472 SvFLAGS(ERRSV) |= utf8;
1475 write_to_stderr(message, msglen);
1479 Perl_vwarn(aTHX_ pat, args);
1483 /* implements the ckWARN? macros */
1486 Perl_ckwarn(pTHX_ U32 w)
1492 && PL_curcop->cop_warnings != pWARN_NONE
1494 PL_curcop->cop_warnings == pWARN_ALL
1495 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1496 || (unpackWARN2(w) &&
1497 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1498 || (unpackWARN3(w) &&
1499 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1500 || (unpackWARN4(w) &&
1501 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1506 isLEXWARN_off && PL_dowarn & G_WARN_ON
1511 /* implements the ckWARN?_d macro */
1514 Perl_ckwarn_d(pTHX_ U32 w)
1519 || PL_curcop->cop_warnings == pWARN_ALL
1521 PL_curcop->cop_warnings != pWARN_NONE
1523 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1524 || (unpackWARN2(w) &&
1525 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1526 || (unpackWARN3(w) &&
1527 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1528 || (unpackWARN4(w) &&
1529 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1535 /* Set buffer=NULL to get a new one. */
1537 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1539 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1540 PERL_UNUSED_CONTEXT;
1543 (specialWARN(buffer) ?
1544 PerlMemShared_malloc(len_wanted) :
1545 PerlMemShared_realloc(buffer, len_wanted));
1547 Copy(bits, (buffer + 1), size, char);
1551 /* since we've already done strlen() for both nam and val
1552 * we can use that info to make things faster than
1553 * sprintf(s, "%s=%s", nam, val)
1555 #define my_setenv_format(s, nam, nlen, val, vlen) \
1556 Copy(nam, s, nlen, char); \
1558 Copy(val, s+(nlen+1), vlen, char); \
1559 *(s+(nlen+1+vlen)) = '\0'
1561 #ifdef USE_ENVIRON_ARRAY
1562 /* VMS' my_setenv() is in vms.c */
1563 #if !defined(WIN32) && !defined(NETWARE)
1565 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1569 /* only parent thread can modify process environment */
1570 if (PL_curinterp == aTHX)
1573 #ifndef PERL_USE_SAFE_PUTENV
1574 if (!PL_use_safe_putenv) {
1575 /* most putenv()s leak, so we manipulate environ directly */
1576 register I32 i=setenv_getix(nam); /* where does it go? */
1579 if (environ == PL_origenviron) { /* need we copy environment? */
1585 while (environ[max])
1587 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1588 for (j=0; j<max; j++) { /* copy environment */
1589 const int len = strlen(environ[j]);
1590 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1591 Copy(environ[j], tmpenv[j], len+1, char);
1594 environ = tmpenv; /* tell exec where it is now */
1597 safesysfree(environ[i]);
1598 while (environ[i]) {
1599 environ[i] = environ[i+1];
1604 if (!environ[i]) { /* does not exist yet */
1605 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1606 environ[i+1] = NULL; /* make sure it's null terminated */
1609 safesysfree(environ[i]);
1613 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1614 /* all that work just for this */
1615 my_setenv_format(environ[i], nam, nlen, val, vlen);
1618 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1619 # if defined(HAS_UNSETENV)
1621 (void)unsetenv(nam);
1623 (void)setenv(nam, val, 1);
1625 # else /* ! HAS_UNSETENV */
1626 (void)setenv(nam, val, 1);
1627 # endif /* HAS_UNSETENV */
1629 # if defined(HAS_UNSETENV)
1631 (void)unsetenv(nam);
1633 const int nlen = strlen(nam);
1634 const int vlen = strlen(val);
1635 char * const new_env =
1636 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1637 my_setenv_format(new_env, nam, nlen, val, vlen);
1638 (void)putenv(new_env);
1640 # else /* ! HAS_UNSETENV */
1642 const int nlen = strlen(nam);
1648 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1649 /* all that work just for this */
1650 my_setenv_format(new_env, nam, nlen, val, vlen);
1651 (void)putenv(new_env);
1652 # endif /* HAS_UNSETENV */
1653 # endif /* __CYGWIN__ */
1654 #ifndef PERL_USE_SAFE_PUTENV
1660 #else /* WIN32 || NETWARE */
1663 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1666 register char *envstr;
1667 const int nlen = strlen(nam);
1674 Newx(envstr, nlen+vlen+2, char);
1675 my_setenv_format(envstr, nam, nlen, val, vlen);
1676 (void)PerlEnv_putenv(envstr);
1680 #endif /* WIN32 || NETWARE */
1684 Perl_setenv_getix(pTHX_ const char *nam)
1687 register const I32 len = strlen(nam);
1688 PERL_UNUSED_CONTEXT;
1690 for (i = 0; environ[i]; i++) {
1693 strnicmp(environ[i],nam,len) == 0
1695 strnEQ(environ[i],nam,len)
1697 && environ[i][len] == '=')
1698 break; /* strnEQ must come first to avoid */
1699 } /* potential SEGV's */
1702 #endif /* !PERL_MICRO */
1704 #endif /* !VMS && !EPOC*/
1706 #ifdef UNLINK_ALL_VERSIONS
1708 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1712 while (PerlLIO_unlink(f) >= 0)
1714 return retries ? 0 : -1;
1718 /* this is a drop-in replacement for bcopy() */
1719 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1721 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1723 char * const retval = to;
1725 if (from - to >= 0) {
1733 *(--to) = *(--from);
1739 /* this is a drop-in replacement for memset() */
1742 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1744 char * const retval = loc;
1752 /* this is a drop-in replacement for bzero() */
1753 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1755 Perl_my_bzero(register char *loc, register I32 len)
1757 char * const retval = loc;
1765 /* this is a drop-in replacement for memcmp() */
1766 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1768 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1770 register const U8 *a = (const U8 *)s1;
1771 register const U8 *b = (const U8 *)s2;
1775 if ((tmp = *a++ - *b++))
1780 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1784 #ifdef USE_CHAR_VSPRINTF
1789 vsprintf(char *dest, const char *pat, char *args)
1793 fakebuf._ptr = dest;
1794 fakebuf._cnt = 32767;
1798 fakebuf._flag = _IOWRT|_IOSTRG;
1799 _doprnt(pat, args, &fakebuf); /* what a kludge */
1800 (void)putc('\0', &fakebuf);
1801 #ifdef USE_CHAR_VSPRINTF
1804 return 0; /* perl doesn't use return value */
1808 #endif /* HAS_VPRINTF */
1811 #if BYTEORDER != 0x4321
1813 Perl_my_swap(pTHX_ short s)
1815 #if (BYTEORDER & 1) == 0
1818 result = ((s & 255) << 8) + ((s >> 8) & 255);
1826 Perl_my_htonl(pTHX_ long l)
1830 char c[sizeof(long)];
1833 #if BYTEORDER == 0x1234
1834 u.c[0] = (l >> 24) & 255;
1835 u.c[1] = (l >> 16) & 255;
1836 u.c[2] = (l >> 8) & 255;
1840 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1841 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1846 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1847 u.c[o & 0xf] = (l >> s) & 255;
1855 Perl_my_ntohl(pTHX_ long l)
1859 char c[sizeof(long)];
1862 #if BYTEORDER == 0x1234
1863 u.c[0] = (l >> 24) & 255;
1864 u.c[1] = (l >> 16) & 255;
1865 u.c[2] = (l >> 8) & 255;
1869 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1870 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1877 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1878 l |= (u.c[o & 0xf] & 255) << s;
1885 #endif /* BYTEORDER != 0x4321 */
1889 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1890 * If these functions are defined,
1891 * the BYTEORDER is neither 0x1234 nor 0x4321.
1892 * However, this is not assumed.
1896 #define HTOLE(name,type) \
1898 name (register type n) \
1902 char c[sizeof(type)]; \
1905 register U32 s = 0; \
1906 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1907 u.c[i] = (n >> s) & 0xFF; \
1912 #define LETOH(name,type) \
1914 name (register type n) \
1918 char c[sizeof(type)]; \
1921 register U32 s = 0; \
1924 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1925 n |= ((type)(u.c[i] & 0xFF)) << s; \
1931 * Big-endian byte order functions.
1934 #define HTOBE(name,type) \
1936 name (register type n) \
1940 char c[sizeof(type)]; \
1943 register U32 s = 8*(sizeof(u.c)-1); \
1944 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1945 u.c[i] = (n >> s) & 0xFF; \
1950 #define BETOH(name,type) \
1952 name (register type n) \
1956 char c[sizeof(type)]; \
1959 register U32 s = 8*(sizeof(u.c)-1); \
1962 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1963 n |= ((type)(u.c[i] & 0xFF)) << s; \
1969 * If we just can't do it...
1972 #define NOT_AVAIL(name,type) \
1974 name (register type n) \
1976 Perl_croak_nocontext(#name "() not available"); \
1977 return n; /* not reached */ \
1981 #if defined(HAS_HTOVS) && !defined(htovs)
1984 #if defined(HAS_HTOVL) && !defined(htovl)
1987 #if defined(HAS_VTOHS) && !defined(vtohs)
1990 #if defined(HAS_VTOHL) && !defined(vtohl)
1994 #ifdef PERL_NEED_MY_HTOLE16
1996 HTOLE(Perl_my_htole16,U16)
1998 NOT_AVAIL(Perl_my_htole16,U16)
2001 #ifdef PERL_NEED_MY_LETOH16
2003 LETOH(Perl_my_letoh16,U16)
2005 NOT_AVAIL(Perl_my_letoh16,U16)
2008 #ifdef PERL_NEED_MY_HTOBE16
2010 HTOBE(Perl_my_htobe16,U16)
2012 NOT_AVAIL(Perl_my_htobe16,U16)
2015 #ifdef PERL_NEED_MY_BETOH16
2017 BETOH(Perl_my_betoh16,U16)
2019 NOT_AVAIL(Perl_my_betoh16,U16)
2023 #ifdef PERL_NEED_MY_HTOLE32
2025 HTOLE(Perl_my_htole32,U32)
2027 NOT_AVAIL(Perl_my_htole32,U32)
2030 #ifdef PERL_NEED_MY_LETOH32
2032 LETOH(Perl_my_letoh32,U32)
2034 NOT_AVAIL(Perl_my_letoh32,U32)
2037 #ifdef PERL_NEED_MY_HTOBE32
2039 HTOBE(Perl_my_htobe32,U32)
2041 NOT_AVAIL(Perl_my_htobe32,U32)
2044 #ifdef PERL_NEED_MY_BETOH32
2046 BETOH(Perl_my_betoh32,U32)
2048 NOT_AVAIL(Perl_my_betoh32,U32)
2052 #ifdef PERL_NEED_MY_HTOLE64
2054 HTOLE(Perl_my_htole64,U64)
2056 NOT_AVAIL(Perl_my_htole64,U64)
2059 #ifdef PERL_NEED_MY_LETOH64
2061 LETOH(Perl_my_letoh64,U64)
2063 NOT_AVAIL(Perl_my_letoh64,U64)
2066 #ifdef PERL_NEED_MY_HTOBE64
2068 HTOBE(Perl_my_htobe64,U64)
2070 NOT_AVAIL(Perl_my_htobe64,U64)
2073 #ifdef PERL_NEED_MY_BETOH64
2075 BETOH(Perl_my_betoh64,U64)
2077 NOT_AVAIL(Perl_my_betoh64,U64)
2081 #ifdef PERL_NEED_MY_HTOLES
2082 HTOLE(Perl_my_htoles,short)
2084 #ifdef PERL_NEED_MY_LETOHS
2085 LETOH(Perl_my_letohs,short)
2087 #ifdef PERL_NEED_MY_HTOBES
2088 HTOBE(Perl_my_htobes,short)
2090 #ifdef PERL_NEED_MY_BETOHS
2091 BETOH(Perl_my_betohs,short)
2094 #ifdef PERL_NEED_MY_HTOLEI
2095 HTOLE(Perl_my_htolei,int)
2097 #ifdef PERL_NEED_MY_LETOHI
2098 LETOH(Perl_my_letohi,int)
2100 #ifdef PERL_NEED_MY_HTOBEI
2101 HTOBE(Perl_my_htobei,int)
2103 #ifdef PERL_NEED_MY_BETOHI
2104 BETOH(Perl_my_betohi,int)
2107 #ifdef PERL_NEED_MY_HTOLEL
2108 HTOLE(Perl_my_htolel,long)
2110 #ifdef PERL_NEED_MY_LETOHL
2111 LETOH(Perl_my_letohl,long)
2113 #ifdef PERL_NEED_MY_HTOBEL
2114 HTOBE(Perl_my_htobel,long)
2116 #ifdef PERL_NEED_MY_BETOHL
2117 BETOH(Perl_my_betohl,long)
2121 Perl_my_swabn(void *ptr, int n)
2123 register char *s = (char *)ptr;
2124 register char *e = s + (n-1);
2127 for (n /= 2; n > 0; s++, e--, n--) {
2135 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2137 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2140 register I32 This, that;
2146 PERL_FLUSHALL_FOR_CHILD;
2147 This = (*mode == 'w');
2151 taint_proper("Insecure %s%s", "EXEC");
2153 if (PerlProc_pipe(p) < 0)
2155 /* Try for another pipe pair for error return */
2156 if (PerlProc_pipe(pp) >= 0)
2158 while ((pid = PerlProc_fork()) < 0) {
2159 if (errno != EAGAIN) {
2160 PerlLIO_close(p[This]);
2161 PerlLIO_close(p[that]);
2163 PerlLIO_close(pp[0]);
2164 PerlLIO_close(pp[1]);
2176 /* Close parent's end of error status pipe (if any) */
2178 PerlLIO_close(pp[0]);
2179 #if defined(HAS_FCNTL) && defined(F_SETFD)
2180 /* Close error pipe automatically if exec works */
2181 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2184 /* Now dup our end of _the_ pipe to right position */
2185 if (p[THIS] != (*mode == 'r')) {
2186 PerlLIO_dup2(p[THIS], *mode == 'r');
2187 PerlLIO_close(p[THIS]);
2188 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2189 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2192 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2193 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2194 /* No automatic close - do it by hand */
2201 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2207 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2213 do_execfree(); /* free any memory malloced by child on fork */
2215 PerlLIO_close(pp[1]);
2216 /* Keep the lower of the two fd numbers */
2217 if (p[that] < p[This]) {
2218 PerlLIO_dup2(p[This], p[that]);
2219 PerlLIO_close(p[This]);
2223 PerlLIO_close(p[that]); /* close child's end of pipe */
2226 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2228 SvUPGRADE(sv,SVt_IV);
2230 PL_forkprocess = pid;
2231 /* If we managed to get status pipe check for exec fail */
2232 if (did_pipes && pid > 0) {
2237 while (n < sizeof(int)) {
2238 n1 = PerlLIO_read(pp[0],
2239 (void*)(((char*)&errkid)+n),
2245 PerlLIO_close(pp[0]);
2247 if (n) { /* Error */
2249 PerlLIO_close(p[This]);
2250 if (n != sizeof(int))
2251 Perl_croak(aTHX_ "panic: kid popen errno read");
2253 pid2 = wait4pid(pid, &status, 0);
2254 } while (pid2 == -1 && errno == EINTR);
2255 errno = errkid; /* Propagate errno from kid */
2260 PerlLIO_close(pp[0]);
2261 return PerlIO_fdopen(p[This], mode);
2263 Perl_croak(aTHX_ "List form of piped open not implemented");
2264 return (PerlIO *) NULL;
2268 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2269 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2271 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2275 register I32 This, that;
2278 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2282 PERL_FLUSHALL_FOR_CHILD;
2285 return my_syspopen(aTHX_ cmd,mode);
2288 This = (*mode == 'w');
2290 if (doexec && PL_tainting) {
2292 taint_proper("Insecure %s%s", "EXEC");
2294 if (PerlProc_pipe(p) < 0)
2296 if (doexec && PerlProc_pipe(pp) >= 0)
2298 while ((pid = PerlProc_fork()) < 0) {
2299 if (errno != EAGAIN) {
2300 PerlLIO_close(p[This]);
2301 PerlLIO_close(p[that]);
2303 PerlLIO_close(pp[0]);
2304 PerlLIO_close(pp[1]);
2307 Perl_croak(aTHX_ "Can't fork");
2320 PerlLIO_close(pp[0]);
2321 #if defined(HAS_FCNTL) && defined(F_SETFD)
2322 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2325 if (p[THIS] != (*mode == 'r')) {
2326 PerlLIO_dup2(p[THIS], *mode == 'r');
2327 PerlLIO_close(p[THIS]);
2328 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2329 PerlLIO_close(p[THAT]);
2332 PerlLIO_close(p[THAT]);
2335 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2342 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2347 /* may or may not use the shell */
2348 do_exec3(cmd, pp[1], did_pipes);
2351 #endif /* defined OS2 */
2352 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2353 SvREADONLY_off(GvSV(tmpgv));
2354 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2355 SvREADONLY_on(GvSV(tmpgv));
2357 #ifdef THREADS_HAVE_PIDS
2358 PL_ppid = (IV)getppid();
2361 #ifdef PERL_USES_PL_PIDSTATUS
2362 hv_clear(PL_pidstatus); /* we have no children */
2368 do_execfree(); /* free any memory malloced by child on vfork */
2370 PerlLIO_close(pp[1]);
2371 if (p[that] < p[This]) {
2372 PerlLIO_dup2(p[This], p[that]);
2373 PerlLIO_close(p[This]);
2377 PerlLIO_close(p[that]);
2380 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2382 SvUPGRADE(sv,SVt_IV);
2384 PL_forkprocess = pid;
2385 if (did_pipes && pid > 0) {
2390 while (n < sizeof(int)) {
2391 n1 = PerlLIO_read(pp[0],
2392 (void*)(((char*)&errkid)+n),
2398 PerlLIO_close(pp[0]);
2400 if (n) { /* Error */
2402 PerlLIO_close(p[This]);
2403 if (n != sizeof(int))
2404 Perl_croak(aTHX_ "panic: kid popen errno read");
2406 pid2 = wait4pid(pid, &status, 0);
2407 } while (pid2 == -1 && errno == EINTR);
2408 errno = errkid; /* Propagate errno from kid */
2413 PerlLIO_close(pp[0]);
2414 return PerlIO_fdopen(p[This], mode);
2417 #if defined(atarist) || defined(EPOC)
2420 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2422 PERL_FLUSHALL_FOR_CHILD;
2423 /* Call system's popen() to get a FILE *, then import it.
2424 used 0 for 2nd parameter to PerlIO_importFILE;
2427 return PerlIO_importFILE(popen(cmd, mode), 0);
2431 FILE *djgpp_popen();
2433 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2435 PERL_FLUSHALL_FOR_CHILD;
2436 /* Call system's popen() to get a FILE *, then import it.
2437 used 0 for 2nd parameter to PerlIO_importFILE;
2440 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2445 #endif /* !DOSISH */
2447 /* this is called in parent before the fork() */
2449 Perl_atfork_lock(void)
2452 #if defined(USE_ITHREADS)
2453 /* locks must be held in locking order (if any) */
2455 MUTEX_LOCK(&PL_malloc_mutex);
2461 /* this is called in both parent and child after the fork() */
2463 Perl_atfork_unlock(void)
2466 #if defined(USE_ITHREADS)
2467 /* locks must be released in same order as in atfork_lock() */
2469 MUTEX_UNLOCK(&PL_malloc_mutex);
2478 #if defined(HAS_FORK)
2480 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2485 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2486 * handlers elsewhere in the code */
2491 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2492 Perl_croak_nocontext("fork() not available");
2494 #endif /* HAS_FORK */
2499 Perl_dump_fds(pTHX_ char *s)
2504 PerlIO_printf(Perl_debug_log,"%s", s);
2505 for (fd = 0; fd < 32; fd++) {
2506 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2507 PerlIO_printf(Perl_debug_log," %d",fd);
2509 PerlIO_printf(Perl_debug_log,"\n");
2512 #endif /* DUMP_FDS */
2516 dup2(int oldfd, int newfd)
2518 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2521 PerlLIO_close(newfd);
2522 return fcntl(oldfd, F_DUPFD, newfd);
2524 #define DUP2_MAX_FDS 256
2525 int fdtmp[DUP2_MAX_FDS];
2531 PerlLIO_close(newfd);
2532 /* good enough for low fd's... */
2533 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2534 if (fdx >= DUP2_MAX_FDS) {
2542 PerlLIO_close(fdtmp[--fdx]);
2549 #ifdef HAS_SIGACTION
2551 #ifdef MACOS_TRADITIONAL
2552 /* We don't want restart behavior on MacOS */
2557 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2560 struct sigaction act, oact;
2563 /* only "parent" interpreter can diddle signals */
2564 if (PL_curinterp != aTHX)
2565 return (Sighandler_t) SIG_ERR;
2568 act.sa_handler = (void(*)(int))handler;
2569 sigemptyset(&act.sa_mask);
2572 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2573 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2575 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2576 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2577 act.sa_flags |= SA_NOCLDWAIT;
2579 if (sigaction(signo, &act, &oact) == -1)
2580 return (Sighandler_t) SIG_ERR;
2582 return (Sighandler_t) oact.sa_handler;
2586 Perl_rsignal_state(pTHX_ int signo)
2588 struct sigaction oact;
2589 PERL_UNUSED_CONTEXT;
2591 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2592 return (Sighandler_t) SIG_ERR;
2594 return (Sighandler_t) oact.sa_handler;
2598 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2601 struct sigaction act;
2604 /* only "parent" interpreter can diddle signals */
2605 if (PL_curinterp != aTHX)
2609 act.sa_handler = (void(*)(int))handler;
2610 sigemptyset(&act.sa_mask);
2613 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2614 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2616 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2617 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2618 act.sa_flags |= SA_NOCLDWAIT;
2620 return sigaction(signo, &act, save);
2624 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2628 /* only "parent" interpreter can diddle signals */
2629 if (PL_curinterp != aTHX)
2633 return sigaction(signo, save, (struct sigaction *)NULL);
2636 #else /* !HAS_SIGACTION */
2639 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2641 #if defined(USE_ITHREADS) && !defined(WIN32)
2642 /* only "parent" interpreter can diddle signals */
2643 if (PL_curinterp != aTHX)
2644 return (Sighandler_t) SIG_ERR;
2647 return PerlProc_signal(signo, handler);
2658 Perl_rsignal_state(pTHX_ int signo)
2661 Sighandler_t oldsig;
2663 #if defined(USE_ITHREADS) && !defined(WIN32)
2664 /* only "parent" interpreter can diddle signals */
2665 if (PL_curinterp != aTHX)
2666 return (Sighandler_t) SIG_ERR;
2670 oldsig = PerlProc_signal(signo, sig_trap);
2671 PerlProc_signal(signo, oldsig);
2673 PerlProc_kill(PerlProc_getpid(), signo);
2678 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2680 #if defined(USE_ITHREADS) && !defined(WIN32)
2681 /* only "parent" interpreter can diddle signals */
2682 if (PL_curinterp != aTHX)
2685 *save = PerlProc_signal(signo, handler);
2686 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2690 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2692 #if defined(USE_ITHREADS) && !defined(WIN32)
2693 /* only "parent" interpreter can diddle signals */
2694 if (PL_curinterp != aTHX)
2697 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2700 #endif /* !HAS_SIGACTION */
2701 #endif /* !PERL_MICRO */
2703 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2704 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2706 Perl_my_pclose(pTHX_ PerlIO *ptr)
2709 Sigsave_t hstat, istat, qstat;
2715 int saved_errno = 0;
2717 int saved_win32_errno;
2721 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2723 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2725 *svp = &PL_sv_undef;
2727 if (pid == -1) { /* Opened by popen. */
2728 return my_syspclose(ptr);
2731 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2732 saved_errno = errno;
2734 saved_win32_errno = GetLastError();
2738 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2741 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2742 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2743 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2746 pid2 = wait4pid(pid, &status, 0);
2747 } while (pid2 == -1 && errno == EINTR);
2749 rsignal_restore(SIGHUP, &hstat);
2750 rsignal_restore(SIGINT, &istat);
2751 rsignal_restore(SIGQUIT, &qstat);
2754 SETERRNO(saved_errno, 0);
2757 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2759 #endif /* !DOSISH */
2761 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2763 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2769 #ifdef PERL_USES_PL_PIDSTATUS
2772 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2773 pid, rather than a string form. */
2774 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2775 if (svp && *svp != &PL_sv_undef) {
2776 *statusp = SvIVX(*svp);
2777 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2785 hv_iterinit(PL_pidstatus);
2786 if ((entry = hv_iternext(PL_pidstatus))) {
2787 SV * const sv = hv_iterval(PL_pidstatus,entry);
2789 const char * const spid = hv_iterkey(entry,&len);
2791 assert (len == sizeof(Pid_t));
2792 memcpy((char *)&pid, spid, len);
2793 *statusp = SvIVX(sv);
2794 /* The hash iterator is currently on this entry, so simply
2795 calling hv_delete would trigger the lazy delete, which on
2796 aggregate does more work, beacuse next call to hv_iterinit()
2797 would spot the flag, and have to call the delete routine,
2798 while in the meantime any new entries can't re-use that
2800 hv_iterinit(PL_pidstatus);
2801 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2808 # ifdef HAS_WAITPID_RUNTIME
2809 if (!HAS_WAITPID_RUNTIME)
2812 result = PerlProc_waitpid(pid,statusp,flags);
2815 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2816 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2819 #ifdef PERL_USES_PL_PIDSTATUS
2820 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2825 Perl_croak(aTHX_ "Can't do waitpid with flags");
2827 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2828 pidgone(result,*statusp);
2834 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2837 if (result < 0 && errno == EINTR) {
2842 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2844 #ifdef PERL_USES_PL_PIDSTATUS
2846 Perl_pidgone(pTHX_ Pid_t pid, int status)
2850 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2851 SvUPGRADE(sv,SVt_IV);
2852 SvIV_set(sv, status);
2857 #if defined(atarist) || defined(OS2) || defined(EPOC)
2860 int /* Cannot prototype with I32
2862 my_syspclose(PerlIO *ptr)
2865 Perl_my_pclose(pTHX_ PerlIO *ptr)
2868 /* Needs work for PerlIO ! */
2869 FILE * const f = PerlIO_findFILE(ptr);
2870 const I32 result = pclose(f);
2871 PerlIO_releaseFILE(ptr,f);
2879 Perl_my_pclose(pTHX_ PerlIO *ptr)
2881 /* Needs work for PerlIO ! */
2882 FILE * const f = PerlIO_findFILE(ptr);
2883 I32 result = djgpp_pclose(f);
2884 result = (result << 8) & 0xff00;
2885 PerlIO_releaseFILE(ptr,f);
2891 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2894 register const char * const frombase = from;
2895 PERL_UNUSED_CONTEXT;
2898 register const char c = *from;
2903 while (count-- > 0) {
2904 for (todo = len; todo > 0; todo--) {
2913 Perl_same_dirent(pTHX_ const char *a, const char *b)
2915 char *fa = strrchr(a,'/');
2916 char *fb = strrchr(b,'/');
2919 SV * const tmpsv = sv_newmortal();
2932 sv_setpvn(tmpsv, ".", 1);
2934 sv_setpvn(tmpsv, a, fa - a);
2935 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2938 sv_setpvn(tmpsv, ".", 1);
2940 sv_setpvn(tmpsv, b, fb - b);
2941 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2943 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2944 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2946 #endif /* !HAS_RENAME */
2949 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2950 const char *const *const search_ext, I32 flags)
2953 const char *xfound = NULL;
2954 char *xfailed = NULL;
2955 char tmpbuf[MAXPATHLEN];
2959 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2960 # define SEARCH_EXTS ".bat", ".cmd", NULL
2961 # define MAX_EXT_LEN 4
2964 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2965 # define MAX_EXT_LEN 4
2968 # define SEARCH_EXTS ".pl", ".com", NULL
2969 # define MAX_EXT_LEN 4
2971 /* additional extensions to try in each dir if scriptname not found */
2973 static const char *const exts[] = { SEARCH_EXTS };
2974 const char *const *const ext = search_ext ? search_ext : exts;
2975 int extidx = 0, i = 0;
2976 const char *curext = NULL;
2978 PERL_UNUSED_ARG(search_ext);
2979 # define MAX_EXT_LEN 0
2983 * If dosearch is true and if scriptname does not contain path
2984 * delimiters, search the PATH for scriptname.
2986 * If SEARCH_EXTS is also defined, will look for each
2987 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2988 * while searching the PATH.
2990 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2991 * proceeds as follows:
2992 * If DOSISH or VMSISH:
2993 * + look for ./scriptname{,.foo,.bar}
2994 * + search the PATH for scriptname{,.foo,.bar}
2997 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2998 * this will not look in '.' if it's not in the PATH)
3003 # ifdef ALWAYS_DEFTYPES
3004 len = strlen(scriptname);
3005 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3006 int idx = 0, deftypes = 1;
3009 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3012 int idx = 0, deftypes = 1;
3015 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3017 /* The first time through, just add SEARCH_EXTS to whatever we
3018 * already have, so we can check for default file types. */
3020 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3026 if ((strlen(tmpbuf) + strlen(scriptname)
3027 + MAX_EXT_LEN) >= sizeof tmpbuf)
3028 continue; /* don't search dir with too-long name */
3029 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3033 if (strEQ(scriptname, "-"))
3035 if (dosearch) { /* Look in '.' first. */
3036 const char *cur = scriptname;
3038 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3040 if (strEQ(ext[i++],curext)) {
3041 extidx = -1; /* already has an ext */
3046 DEBUG_p(PerlIO_printf(Perl_debug_log,
3047 "Looking for %s\n",cur));
3048 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3049 && !S_ISDIR(PL_statbuf.st_mode)) {
3057 if (cur == scriptname) {
3058 len = strlen(scriptname);
3059 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3061 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3064 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3065 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3070 #ifdef MACOS_TRADITIONAL
3071 if (dosearch && !strchr(scriptname, ':') &&
3072 (s = PerlEnv_getenv("Commands")))
3074 if (dosearch && !strchr(scriptname, '/')
3076 && !strchr(scriptname, '\\')
3078 && (s = PerlEnv_getenv("PATH")))
3083 PL_bufend = s + strlen(s);
3084 while (s < PL_bufend) {
3085 #ifdef MACOS_TRADITIONAL
3086 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3090 #if defined(atarist) || defined(DOSISH)
3095 && *s != ';'; len++, s++) {
3096 if (len < sizeof tmpbuf)
3099 if (len < sizeof tmpbuf)
3101 #else /* ! (atarist || DOSISH) */
3102 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3105 #endif /* ! (atarist || DOSISH) */
3106 #endif /* MACOS_TRADITIONAL */
3109 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3110 continue; /* don't search dir with too-long name */
3111 #ifdef MACOS_TRADITIONAL
3112 if (len && tmpbuf[len - 1] != ':')
3113 tmpbuf[len++] = ':';
3116 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3117 && tmpbuf[len - 1] != '/'
3118 && tmpbuf[len - 1] != '\\'
3121 tmpbuf[len++] = '/';
3122 if (len == 2 && tmpbuf[0] == '.')
3125 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3129 len = strlen(tmpbuf);
3130 if (extidx > 0) /* reset after previous loop */
3134 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3135 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3136 if (S_ISDIR(PL_statbuf.st_mode)) {
3140 } while ( retval < 0 /* not there */
3141 && extidx>=0 && ext[extidx] /* try an extension? */
3142 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3147 if (S_ISREG(PL_statbuf.st_mode)
3148 && cando(S_IRUSR,TRUE,&PL_statbuf)
3149 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3150 && cando(S_IXUSR,TRUE,&PL_statbuf)
3154 xfound = tmpbuf; /* bingo! */
3158 xfailed = savepv(tmpbuf);
3161 if (!xfound && !seen_dot && !xfailed &&
3162 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3163 || S_ISDIR(PL_statbuf.st_mode)))
3165 seen_dot = 1; /* Disable message. */
3167 if (flags & 1) { /* do or die? */
3168 Perl_croak(aTHX_ "Can't %s %s%s%s",
3169 (xfailed ? "execute" : "find"),
3170 (xfailed ? xfailed : scriptname),
3171 (xfailed ? "" : " on PATH"),
3172 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3177 scriptname = xfound;
3179 return (scriptname ? savepv(scriptname) : NULL);
3182 #ifndef PERL_GET_CONTEXT_DEFINED
3185 Perl_get_context(void)
3188 #if defined(USE_ITHREADS)
3189 # ifdef OLD_PTHREADS_API
3191 if (pthread_getspecific(PL_thr_key, &t))
3192 Perl_croak_nocontext("panic: pthread_getspecific");
3195 # ifdef I_MACH_CTHREADS
3196 return (void*)cthread_data(cthread_self());
3198 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3207 Perl_set_context(void *t)
3210 #if defined(USE_ITHREADS)
3211 # ifdef I_MACH_CTHREADS
3212 cthread_set_data(cthread_self(), t);
3214 if (pthread_setspecific(PL_thr_key, t))
3215 Perl_croak_nocontext("panic: pthread_setspecific");
3222 #endif /* !PERL_GET_CONTEXT_DEFINED */
3224 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3233 Perl_get_op_names(pTHX)
3235 PERL_UNUSED_CONTEXT;
3236 return (char **)PL_op_name;
3240 Perl_get_op_descs(pTHX)
3242 PERL_UNUSED_CONTEXT;
3243 return (char **)PL_op_desc;
3247 Perl_get_no_modify(pTHX)
3249 PERL_UNUSED_CONTEXT;
3250 return PL_no_modify;
3254 Perl_get_opargs(pTHX)
3256 PERL_UNUSED_CONTEXT;
3257 return (U32 *)PL_opargs;
3261 Perl_get_ppaddr(pTHX)
3264 PERL_UNUSED_CONTEXT;
3265 return (PPADDR_t*)PL_ppaddr;
3268 #ifndef HAS_GETENV_LEN
3270 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3272 char * const env_trans = PerlEnv_getenv(env_elem);
3273 PERL_UNUSED_CONTEXT;
3275 *len = strlen(env_trans);
3282 Perl_get_vtbl(pTHX_ int vtbl_id)
3284 const MGVTBL* result;
3285 PERL_UNUSED_CONTEXT;
3289 result = &PL_vtbl_sv;
3292 result = &PL_vtbl_env;
3294 case want_vtbl_envelem:
3295 result = &PL_vtbl_envelem;
3298 result = &PL_vtbl_sig;
3300 case want_vtbl_sigelem:
3301 result = &PL_vtbl_sigelem;
3303 case want_vtbl_pack:
3304 result = &PL_vtbl_pack;
3306 case want_vtbl_packelem:
3307 result = &PL_vtbl_packelem;
3309 case want_vtbl_dbline:
3310 result = &PL_vtbl_dbline;
3313 result = &PL_vtbl_isa;
3315 case want_vtbl_isaelem:
3316 result = &PL_vtbl_isaelem;
3318 case want_vtbl_arylen:
3319 result = &PL_vtbl_arylen;
3321 case want_vtbl_mglob:
3322 result = &PL_vtbl_mglob;
3324 case want_vtbl_nkeys:
3325 result = &PL_vtbl_nkeys;
3327 case want_vtbl_taint:
3328 result = &PL_vtbl_taint;
3330 case want_vtbl_substr:
3331 result = &PL_vtbl_substr;
3334 result = &PL_vtbl_vec;
3337 result = &PL_vtbl_pos;
3340 result = &PL_vtbl_bm;
3343 result = &PL_vtbl_fm;
3345 case want_vtbl_uvar:
3346 result = &PL_vtbl_uvar;
3348 case want_vtbl_defelem:
3349 result = &PL_vtbl_defelem;
3351 case want_vtbl_regexp:
3352 result = &PL_vtbl_regexp;
3354 case want_vtbl_regdata:
3355 result = &PL_vtbl_regdata;
3357 case want_vtbl_regdatum:
3358 result = &PL_vtbl_regdatum;
3360 #ifdef USE_LOCALE_COLLATE
3361 case want_vtbl_collxfrm:
3362 result = &PL_vtbl_collxfrm;
3365 case want_vtbl_amagic:
3366 result = &PL_vtbl_amagic;
3368 case want_vtbl_amagicelem:
3369 result = &PL_vtbl_amagicelem;
3371 case want_vtbl_backref:
3372 result = &PL_vtbl_backref;
3374 case want_vtbl_utf8:
3375 result = &PL_vtbl_utf8;
3381 return (MGVTBL*)result;
3385 Perl_my_fflush_all(pTHX)
3387 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3388 return PerlIO_flush(NULL);
3390 # if defined(HAS__FWALK)
3391 extern int fflush(FILE *);
3392 /* undocumented, unprototyped, but very useful BSDism */
3393 extern void _fwalk(int (*)(FILE *));
3397 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3399 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3400 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3402 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3403 open_max = sysconf(_SC_OPEN_MAX);
3406 open_max = FOPEN_MAX;
3409 open_max = OPEN_MAX;
3420 for (i = 0; i < open_max; i++)
3421 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3422 STDIO_STREAM_ARRAY[i]._file < open_max &&
3423 STDIO_STREAM_ARRAY[i]._flag)
3424 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3428 SETERRNO(EBADF,RMS_IFI);
3435 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3437 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3439 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3440 if (ckWARN(WARN_IO)) {
3441 const char * const direction =
3442 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3444 Perl_warner(aTHX_ packWARN(WARN_IO),
3445 "Filehandle %s opened only for %sput",
3448 Perl_warner(aTHX_ packWARN(WARN_IO),
3449 "Filehandle opened only for %sput", direction);
3456 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3458 warn_type = WARN_CLOSED;
3462 warn_type = WARN_UNOPENED;
3465 if (ckWARN(warn_type)) {
3466 const char * const pars =
3467 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3468 const char * const func =
3470 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3471 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3472 op < 0 ? "" : /* handle phoney cases */
3474 const char * const type =
3476 (OP_IS_SOCKET(op) ||
3477 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3478 "socket" : "filehandle");
3479 if (name && *name) {
3480 Perl_warner(aTHX_ packWARN(warn_type),
3481 "%s%s on %s %s %s", func, pars, vile, type, name);
3482 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3484 aTHX_ packWARN(warn_type),
3485 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3490 Perl_warner(aTHX_ packWARN(warn_type),
3491 "%s%s on %s %s", func, pars, vile, type);
3492 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3494 aTHX_ packWARN(warn_type),
3495 "\t(Are you trying to call %s%s on dirhandle?)\n",
3504 /* in ASCII order, not that it matters */
3505 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3508 Perl_ebcdic_control(pTHX_ int ch)
3516 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3517 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3520 if (ctlp == controllablechars)
3521 return('\177'); /* DEL */
3523 return((unsigned char)(ctlp - controllablechars - 1));
3524 } else { /* Want uncontrol */
3525 if (ch == '\177' || ch == -1)
3527 else if (ch == '\157')
3529 else if (ch == '\174')
3531 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3533 else if (ch == '\155')
3535 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3536 return(controllablechars[ch+1]);
3538 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3543 /* To workaround core dumps from the uninitialised tm_zone we get the
3544 * system to give us a reasonable struct to copy. This fix means that
3545 * strftime uses the tm_zone and tm_gmtoff values returned by
3546 * localtime(time()). That should give the desired result most of the
3547 * time. But probably not always!
3549 * This does not address tzname aspects of NETaa14816.
3554 # ifndef STRUCT_TM_HASZONE
3555 # define STRUCT_TM_HASZONE
3559 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3560 # ifndef HAS_TM_TM_ZONE
3561 # define HAS_TM_TM_ZONE
3566 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3568 #ifdef HAS_TM_TM_ZONE
3570 const struct tm* my_tm;
3572 my_tm = localtime(&now);
3574 Copy(my_tm, ptm, 1, struct tm);
3576 PERL_UNUSED_ARG(ptm);
3581 * mini_mktime - normalise struct tm values without the localtime()
3582 * semantics (and overhead) of mktime().
3585 Perl_mini_mktime(pTHX_ struct tm *ptm)
3589 int month, mday, year, jday;
3590 int odd_cent, odd_year;
3591 PERL_UNUSED_CONTEXT;
3593 #define DAYS_PER_YEAR 365
3594 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3595 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3596 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3597 #define SECS_PER_HOUR (60*60)
3598 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3599 /* parentheses deliberately absent on these two, otherwise they don't work */
3600 #define MONTH_TO_DAYS 153/5
3601 #define DAYS_TO_MONTH 5/153
3602 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3603 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3604 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3605 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3608 * Year/day algorithm notes:
3610 * With a suitable offset for numeric value of the month, one can find
3611 * an offset into the year by considering months to have 30.6 (153/5) days,
3612 * using integer arithmetic (i.e., with truncation). To avoid too much
3613 * messing about with leap days, we consider January and February to be
3614 * the 13th and 14th month of the previous year. After that transformation,
3615 * we need the month index we use to be high by 1 from 'normal human' usage,
3616 * so the month index values we use run from 4 through 15.
3618 * Given that, and the rules for the Gregorian calendar (leap years are those
3619 * divisible by 4 unless also divisible by 100, when they must be divisible
3620 * by 400 instead), we can simply calculate the number of days since some
3621 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3622 * the days we derive from our month index, and adding in the day of the
3623 * month. The value used here is not adjusted for the actual origin which
3624 * it normally would use (1 January A.D. 1), since we're not exposing it.
3625 * We're only building the value so we can turn around and get the
3626 * normalised values for the year, month, day-of-month, and day-of-year.
3628 * For going backward, we need to bias the value we're using so that we find
3629 * the right year value. (Basically, we don't want the contribution of
3630 * March 1st to the number to apply while deriving the year). Having done
3631 * that, we 'count up' the contribution to the year number by accounting for
3632 * full quadracenturies (400-year periods) with their extra leap days, plus
3633 * the contribution from full centuries (to avoid counting in the lost leap
3634 * days), plus the contribution from full quad-years (to count in the normal
3635 * leap days), plus the leftover contribution from any non-leap years.
3636 * At this point, if we were working with an actual leap day, we'll have 0
3637 * days left over. This is also true for March 1st, however. So, we have
3638 * to special-case that result, and (earlier) keep track of the 'odd'
3639 * century and year contributions. If we got 4 extra centuries in a qcent,
3640 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3641 * Otherwise, we add back in the earlier bias we removed (the 123 from
3642 * figuring in March 1st), find the month index (integer division by 30.6),
3643 * and the remainder is the day-of-month. We then have to convert back to
3644 * 'real' months (including fixing January and February from being 14/15 in
3645 * the previous year to being in the proper year). After that, to get
3646 * tm_yday, we work with the normalised year and get a new yearday value for
3647 * January 1st, which we subtract from the yearday value we had earlier,
3648 * representing the date we've re-built. This is done from January 1
3649 * because tm_yday is 0-origin.
3651 * Since POSIX time routines are only guaranteed to work for times since the
3652 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3653 * applies Gregorian calendar rules even to dates before the 16th century
3654 * doesn't bother me. Besides, you'd need cultural context for a given
3655 * date to know whether it was Julian or Gregorian calendar, and that's
3656 * outside the scope for this routine. Since we convert back based on the
3657 * same rules we used to build the yearday, you'll only get strange results
3658 * for input which needed normalising, or for the 'odd' century years which
3659 * were leap years in the Julian calander but not in the Gregorian one.
3660 * I can live with that.
3662 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3663 * that's still outside the scope for POSIX time manipulation, so I don't
3667 year = 1900 + ptm->tm_year;
3668 month = ptm->tm_mon;
3669 mday = ptm->tm_mday;
3670 /* allow given yday with no month & mday to dominate the result */
3671 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3674 jday = 1 + ptm->tm_yday;
3683 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3684 yearday += month*MONTH_TO_DAYS + mday + jday;
3686 * Note that we don't know when leap-seconds were or will be,
3687 * so we have to trust the user if we get something which looks
3688 * like a sensible leap-second. Wild values for seconds will
3689 * be rationalised, however.
3691 if ((unsigned) ptm->tm_sec <= 60) {
3698 secs += 60 * ptm->tm_min;
3699 secs += SECS_PER_HOUR * ptm->tm_hour;
3701 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3702 /* got negative remainder, but need positive time */
3703 /* back off an extra day to compensate */
3704 yearday += (secs/SECS_PER_DAY)-1;
3705 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3708 yearday += (secs/SECS_PER_DAY);
3709 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3712 else if (secs >= SECS_PER_DAY) {
3713 yearday += (secs/SECS_PER_DAY);
3714 secs %= SECS_PER_DAY;
3716 ptm->tm_hour = secs/SECS_PER_HOUR;
3717 secs %= SECS_PER_HOUR;
3718 ptm->tm_min = secs/60;
3720 ptm->tm_sec += secs;
3721 /* done with time of day effects */
3723 * The algorithm for yearday has (so far) left it high by 428.
3724 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3725 * bias it by 123 while trying to figure out what year it
3726 * really represents. Even with this tweak, the reverse
3727 * translation fails for years before A.D. 0001.
3728 * It would still fail for Feb 29, but we catch that one below.
3730 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3731 yearday -= YEAR_ADJUST;
3732 year = (yearday / DAYS_PER_QCENT) * 400;
3733 yearday %= DAYS_PER_QCENT;
3734 odd_cent = yearday / DAYS_PER_CENT;
3735 year += odd_cent * 100;
3736 yearday %= DAYS_PER_CENT;
3737 year += (yearday / DAYS_PER_QYEAR) * 4;
3738 yearday %= DAYS_PER_QYEAR;
3739 odd_year = yearday / DAYS_PER_YEAR;
3741 yearday %= DAYS_PER_YEAR;
3742 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3747 yearday += YEAR_ADJUST; /* recover March 1st crock */
3748 month = yearday*DAYS_TO_MONTH;
3749 yearday -= month*MONTH_TO_DAYS;
3750 /* recover other leap-year adjustment */
3759 ptm->tm_year = year - 1900;
3761 ptm->tm_mday = yearday;
3762 ptm->tm_mon = month;
3766 ptm->tm_mon = month - 1;
3768 /* re-build yearday based on Jan 1 to get tm_yday */
3770 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3771 yearday += 14*MONTH_TO_DAYS + 1;
3772 ptm->tm_yday = jday - yearday;
3773 /* fix tm_wday if not overridden by caller */
3774 if ((unsigned)ptm->tm_wday > 6)
3775 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3779 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)
3787 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3790 mytm.tm_hour = hour;
3791 mytm.tm_mday = mday;
3793 mytm.tm_year = year;
3794 mytm.tm_wday = wday;
3795 mytm.tm_yday = yday;
3796 mytm.tm_isdst = isdst;
3798 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3799 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3804 #ifdef HAS_TM_TM_GMTOFF
3805 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3807 #ifdef HAS_TM_TM_ZONE
3808 mytm.tm_zone = mytm2.tm_zone;
3813 Newx(buf, buflen, char);
3814 len = strftime(buf, buflen, fmt, &mytm);
3816 ** The following is needed to handle to the situation where
3817 ** tmpbuf overflows. Basically we want to allocate a buffer
3818 ** and try repeatedly. The reason why it is so complicated
3819 ** is that getting a return value of 0 from strftime can indicate
3820 ** one of the following:
3821 ** 1. buffer overflowed,
3822 ** 2. illegal conversion specifier, or
3823 ** 3. the format string specifies nothing to be returned(not
3824 ** an error). This could be because format is an empty string
3825 ** or it specifies %p that yields an empty string in some locale.
3826 ** If there is a better way to make it portable, go ahead by
3829 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3832 /* Possibly buf overflowed - try again with a bigger buf */
3833 const int fmtlen = strlen(fmt);
3834 int bufsize = fmtlen + buflen;
3836 Newx(buf, bufsize, char);
3838 buflen = strftime(buf, bufsize, fmt, &mytm);
3839 if (buflen > 0 && buflen < bufsize)
3841 /* heuristic to prevent out-of-memory errors */
3842 if (bufsize > 100*fmtlen) {
3848 Renew(buf, bufsize, char);
3853 Perl_croak(aTHX_ "panic: no strftime");
3859 #define SV_CWD_RETURN_UNDEF \
3860 sv_setsv(sv, &PL_sv_undef); \
3863 #define SV_CWD_ISDOT(dp) \
3864 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3865 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3868 =head1 Miscellaneous Functions
3870 =for apidoc getcwd_sv
3872 Fill the sv with current working directory
3877 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3878 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3879 * getcwd(3) if available
3880 * Comments from the orignal:
3881 * This is a faster version of getcwd. It's also more dangerous
3882 * because you might chdir out of a directory that you can't chdir
3886 Perl_getcwd_sv(pTHX_ register SV *sv)
3890 #ifndef INCOMPLETE_TAINTS
3896 char buf[MAXPATHLEN];
3898 /* Some getcwd()s automatically allocate a buffer of the given
3899 * size from the heap if they are given a NULL buffer pointer.
3900 * The problem is that this behaviour is not portable. */
3901 if (getcwd(buf, sizeof(buf) - 1)) {
3906 sv_setsv(sv, &PL_sv_undef);
3914 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3918 SvUPGRADE(sv, SVt_PV);
3920 if (PerlLIO_lstat(".", &statbuf) < 0) {
3921 SV_CWD_RETURN_UNDEF;
3924 orig_cdev = statbuf.st_dev;
3925 orig_cino = statbuf.st_ino;
3934 if (PerlDir_chdir("..") < 0) {
3935 SV_CWD_RETURN_UNDEF;
3937 if (PerlLIO_stat(".", &statbuf) < 0) {
3938 SV_CWD_RETURN_UNDEF;
3941 cdev = statbuf.st_dev;
3942 cino = statbuf.st_ino;
3944 if (odev == cdev && oino == cino) {
3947 if (!(dir = PerlDir_open("."))) {
3948 SV_CWD_RETURN_UNDEF;
3951 while ((dp = PerlDir_read(dir)) != NULL) {
3953 const int namelen = dp->d_namlen;
3955 const int namelen = strlen(dp->d_name);
3958 if (SV_CWD_ISDOT(dp)) {
3962 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3963 SV_CWD_RETURN_UNDEF;
3966 tdev = statbuf.st_dev;
3967 tino = statbuf.st_ino;
3968 if (tino == oino && tdev == odev) {
3974 SV_CWD_RETURN_UNDEF;
3977 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3978 SV_CWD_RETURN_UNDEF;
3981 SvGROW(sv, pathlen + namelen + 1);
3985 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3988 /* prepend current directory to the front */
3990 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3991 pathlen += (namelen + 1);
3993 #ifdef VOID_CLOSEDIR
3996 if (PerlDir_close(dir) < 0) {
3997 SV_CWD_RETURN_UNDEF;
4003 SvCUR_set(sv, pathlen);
4007 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4008 SV_CWD_RETURN_UNDEF;
4011 if (PerlLIO_stat(".", &statbuf) < 0) {
4012 SV_CWD_RETURN_UNDEF;
4015 cdev = statbuf.st_dev;
4016 cino = statbuf.st_ino;
4018 if (cdev != orig_cdev || cino != orig_cino) {
4019 Perl_croak(aTHX_ "Unstable directory path, "
4020 "current directory changed unexpectedly");
4032 =for apidoc scan_version
4034 Returns a pointer to the next character after the parsed
4035 version string, as well as upgrading the passed in SV to
4038 Function must be called with an already existing SV like
4041 s = scan_version(s,SV *sv, bool qv);
4043 Performs some preprocessing to the string to ensure that
4044 it has the correct characteristics of a version. Flags the
4045 object if it contains an underscore (which denotes this
4046 is a alpha version). The boolean qv denotes that the version
4047 should be interpreted as if it had multiple decimals, even if
4054 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4062 AV * const av = newAV();
4063 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4064 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4066 #ifndef NODEFAULT_SHAREKEYS
4067 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4070 while (isSPACE(*s)) /* leading whitespace is OK */
4074 s++; /* get past 'v' */
4075 qv = 1; /* force quoted version processing */
4078 start = last = pos = s;
4080 /* pre-scan the input string to check for decimals/underbars */
4081 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4086 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4090 else if ( *pos == '_' )
4093 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4095 width = pos - last - 1; /* natural width of sub-version */
4100 if ( alpha && !saw_period )
4101 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4103 if ( saw_period > 1 )
4104 qv = 1; /* force quoted version processing */
4109 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4111 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4112 if ( !qv && width < 3 )
4113 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4115 while (isDIGIT(*pos))
4117 if (!isALPHA(*pos)) {
4123 /* this is atoi() that delimits on underscores */
4124 const char *end = pos;
4128 /* the following if() will only be true after the decimal
4129 * point of a version originally created with a bare
4130 * floating point number, i.e. not quoted in any way
4132 if ( !qv && s > start && saw_period == 1 ) {
4136 rev += (*s - '0') * mult;
4138 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4139 Perl_croak(aTHX_ "Integer overflow in version");
4146 while (--end >= s) {
4148 rev += (*end - '0') * mult;
4150 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4151 Perl_croak(aTHX_ "Integer overflow in version");
4156 /* Append revision */
4157 av_push(av, newSViv(rev));
4160 else if ( *pos == '_' && isDIGIT(pos[1]) )
4162 else if ( isDIGIT(*pos) )
4169 while ( isDIGIT(*pos) )
4174 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4182 if ( qv ) { /* quoted versions always get at least three terms*/
4183 I32 len = av_len(av);
4184 /* This for loop appears to trigger a compiler bug on OS X, as it
4185 loops infinitely. Yes, len is negative. No, it makes no sense.
4186 Compiler in question is:
4187 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4188 for ( len = 2 - len; len > 0; len-- )
4189 av_push((AV *)sv, newSViv(0));
4193 av_push(av, newSViv(0));
4196 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4197 av_push(av, newSViv(0));
4199 /* fix RT#19517 - special case 'undef' as string */
4200 if ( *s == 'u' && strEQ(s,"undef") ) {
4204 /* And finally, store the AV in the hash */
4205 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4210 =for apidoc new_version
4212 Returns a new version object based on the passed in SV:
4214 SV *sv = new_version(SV *ver);
4216 Does not alter the passed in ver SV. See "upg_version" if you
4217 want to upgrade the SV.
4223 Perl_new_version(pTHX_ SV *ver)
4226 SV * const rv = newSV(0);
4227 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4230 AV * const av = newAV();
4232 /* This will get reblessed later if a derived class*/
4233 SV * const hv = newSVrv(rv, "version");
4234 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4235 #ifndef NODEFAULT_SHAREKEYS
4236 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4242 /* Begin copying all of the elements */
4243 if ( hv_exists((HV *)ver, "qv", 2) )
4244 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4246 if ( hv_exists((HV *)ver, "alpha", 5) )
4247 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4249 if ( hv_exists((HV*)ver, "width", 5 ) )
4251 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4252 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4255 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4256 /* This will get reblessed later if a derived class*/
4257 for ( key = 0; key <= av_len(sav); key++ )
4259 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4260 av_push(av, newSViv(rev));
4263 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4268 const MAGIC* const mg = SvVSTRING_mg(ver);
4269 if ( mg ) { /* already a v-string */
4270 const STRLEN len = mg->mg_len;
4271 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4272 sv_setpvn(rv,version,len);
4277 sv_setsv(rv,ver); /* make a duplicate */
4282 return upg_version(rv);
4286 =for apidoc upg_version
4288 In-place upgrade of the supplied SV to a version object.
4290 SV *sv = upg_version(SV *sv);
4292 Returns a pointer to the upgraded SV.
4298 Perl_upg_version(pTHX_ SV *ver)
4300 const char *version, *s;
4306 if ( SvNOK(ver) ) /* may get too much accuracy */
4309 #ifdef USE_LOCALE_NUMERIC
4310 char *loc = setlocale(LC_NUMERIC, "C");
4312 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4313 #ifdef USE_LOCALE_NUMERIC
4314 setlocale(LC_NUMERIC, loc);
4316 while (tbuf[len-1] == '0' && len > 0) len--;
4317 version = savepvn(tbuf, len);
4320 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4321 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4325 else /* must be a string or something like a string */
4327 version = savepv(SvPV_nolen(ver));
4330 s = scan_version(version, ver, qv);
4332 if(ckWARN(WARN_MISC))
4333 Perl_warner(aTHX_ packWARN(WARN_MISC),
4334 "Version string '%s' contains invalid data; "
4335 "ignoring: '%s'", version, s);
4343 Validates that the SV contains a valid version object.
4345 bool vverify(SV *vobj);
4347 Note that it only confirms the bare minimum structure (so as not to get
4348 confused by derived classes which may contain additional hash entries):
4352 =item * The SV contains a [reference to a] hash
4354 =item * The hash contains a "version" key
4356 =item * The "version" key has [a reference to] an AV as its value
4364 Perl_vverify(pTHX_ SV *vs)
4370 /* see if the appropriate elements exist */
4371 if ( SvTYPE(vs) == SVt_PVHV
4372 && hv_exists((HV*)vs, "version", 7)
4373 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4374 && SvTYPE(sv) == SVt_PVAV )
4383 Accepts a version object and returns the normalized floating
4384 point representation. Call like:
4388 NOTE: you can pass either the object directly or the SV
4389 contained within the RV.
4395 Perl_vnumify(pTHX_ SV *vs)
4400 SV * const sv = newSV(0);
4406 Perl_croak(aTHX_ "Invalid version object");
4408 /* see if various flags exist */
4409 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4411 if ( hv_exists((HV*)vs, "width", 5 ) )
4412 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4417 /* attempt to retrieve the version array */
4418 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4430 digit = SvIV(*av_fetch(av, 0, 0));
4431 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4432 for ( i = 1 ; i < len ; i++ )
4434 digit = SvIV(*av_fetch(av, i, 0));
4436 const int denom = (width == 2 ? 10 : 100);
4437 const div_t term = div((int)PERL_ABS(digit),denom);
4438 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4441 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4447 digit = SvIV(*av_fetch(av, len, 0));
4448 if ( alpha && width == 3 ) /* alpha version */
4450 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4454 sv_catpvs(sv, "000");
4462 Accepts a version object and returns the normalized string
4463 representation. Call like:
4467 NOTE: you can pass either the object directly or the SV
4468 contained within the RV.
4474 Perl_vnormal(pTHX_ SV *vs)
4478 SV * const sv = newSV(0);
4484 Perl_croak(aTHX_ "Invalid version object");
4486 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4488 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4496 digit = SvIV(*av_fetch(av, 0, 0));
4497 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4498 for ( i = 1 ; i < len ; i++ ) {
4499 digit = SvIV(*av_fetch(av, i, 0));
4500 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4505 /* handle last digit specially */
4506 digit = SvIV(*av_fetch(av, len, 0));
4508 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4510 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4513 if ( len <= 2 ) { /* short version, must be at least three */
4514 for ( len = 2 - len; len != 0; len-- )
4521 =for apidoc vstringify
4523 In order to maintain maximum compatibility with earlier versions
4524 of Perl, this function will return either the floating point
4525 notation or the multiple dotted notation, depending on whether
4526 the original version contained 1 or more dots, respectively
4532 Perl_vstringify(pTHX_ SV *vs)
4538 Perl_croak(aTHX_ "Invalid version object");
4540 if ( hv_exists((HV *)vs, "qv", 2) )
4549 Version object aware cmp. Both operands must already have been
4550 converted into version objects.
4556 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4559 bool lalpha = FALSE;
4560 bool ralpha = FALSE;
4569 if ( !vverify(lhv) )
4570 Perl_croak(aTHX_ "Invalid version object");
4572 if ( !vverify(rhv) )
4573 Perl_croak(aTHX_ "Invalid version object");
4575 /* get the left hand term */
4576 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4577 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4580 /* and the right hand term */
4581 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4582 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4590 while ( i <= m && retval == 0 )
4592 left = SvIV(*av_fetch(lav,i,0));
4593 right = SvIV(*av_fetch(rav,i,0));
4601 /* tiebreaker for alpha with identical terms */
4602 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4604 if ( lalpha && !ralpha )
4608 else if ( ralpha && !lalpha)
4614 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4618 while ( i <= r && retval == 0 )
4620 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4621 retval = -1; /* not a match after all */
4627 while ( i <= l && retval == 0 )
4629 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4630 retval = +1; /* not a match after all */
4638 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4639 # define EMULATE_SOCKETPAIR_UDP
4642 #ifdef EMULATE_SOCKETPAIR_UDP
4644 S_socketpair_udp (int fd[2]) {
4646 /* Fake a datagram socketpair using UDP to localhost. */
4647 int sockets[2] = {-1, -1};
4648 struct sockaddr_in addresses[2];
4650 Sock_size_t size = sizeof(struct sockaddr_in);
4651 unsigned short port;
4654 memset(&addresses, 0, sizeof(addresses));
4657 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4658 if (sockets[i] == -1)
4659 goto tidy_up_and_fail;
4661 addresses[i].sin_family = AF_INET;
4662 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4663 addresses[i].sin_port = 0; /* kernel choses port. */
4664 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4665 sizeof(struct sockaddr_in)) == -1)
4666 goto tidy_up_and_fail;
4669 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4670 for each connect the other socket to it. */
4673 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4675 goto tidy_up_and_fail;
4676 if (size != sizeof(struct sockaddr_in))
4677 goto abort_tidy_up_and_fail;
4678 /* !1 is 0, !0 is 1 */
4679 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4680 sizeof(struct sockaddr_in)) == -1)
4681 goto tidy_up_and_fail;
4684 /* Now we have 2 sockets connected to each other. I don't trust some other
4685 process not to have already sent a packet to us (by random) so send
4686 a packet from each to the other. */
4689 /* I'm going to send my own port number. As a short.
4690 (Who knows if someone somewhere has sin_port as a bitfield and needs
4691 this routine. (I'm assuming crays have socketpair)) */
4692 port = addresses[i].sin_port;
4693 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4694 if (got != sizeof(port)) {
4696 goto tidy_up_and_fail;
4697 goto abort_tidy_up_and_fail;
4701 /* Packets sent. I don't trust them to have arrived though.
4702 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4703 connect to localhost will use a second kernel thread. In 2.6 the
4704 first thread running the connect() returns before the second completes,
4705 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4706 returns 0. Poor programs have tripped up. One poor program's authors'
4707 had a 50-1 reverse stock split. Not sure how connected these were.)
4708 So I don't trust someone not to have an unpredictable UDP stack.
4712 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4713 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4717 FD_SET((unsigned int)sockets[0], &rset);
4718 FD_SET((unsigned int)sockets[1], &rset);
4720 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4721 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4722 || !FD_ISSET(sockets[1], &rset)) {
4723 /* I hope this is portable and appropriate. */
4725 goto tidy_up_and_fail;
4726 goto abort_tidy_up_and_fail;
4730 /* And the paranoia department even now doesn't trust it to have arrive
4731 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4733 struct sockaddr_in readfrom;
4734 unsigned short buffer[2];
4739 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4740 sizeof(buffer), MSG_DONTWAIT,
4741 (struct sockaddr *) &readfrom, &size);
4743 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4745 (struct sockaddr *) &readfrom, &size);
4749 goto tidy_up_and_fail;
4750 if (got != sizeof(port)
4751 || size != sizeof(struct sockaddr_in)
4752 /* Check other socket sent us its port. */
4753 || buffer[0] != (unsigned short) addresses[!i].sin_port
4754 /* Check kernel says we got the datagram from that socket */
4755 || readfrom.sin_family != addresses[!i].sin_family
4756 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4757 || readfrom.sin_port != addresses[!i].sin_port)
4758 goto abort_tidy_up_and_fail;
4761 /* My caller (my_socketpair) has validated that this is non-NULL */
4764 /* I hereby declare this connection open. May God bless all who cross
4768 abort_tidy_up_and_fail:
4769 errno = ECONNABORTED;
4772 const int save_errno = errno;
4773 if (sockets[0] != -1)
4774 PerlLIO_close(sockets[0]);
4775 if (sockets[1] != -1)
4776 PerlLIO_close(sockets[1]);
4781 #endif /* EMULATE_SOCKETPAIR_UDP */
4783 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4785 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4786 /* Stevens says that family must be AF_LOCAL, protocol 0.
4787 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4792 struct sockaddr_in listen_addr;
4793 struct sockaddr_in connect_addr;
4798 || family != AF_UNIX
4801 errno = EAFNOSUPPORT;
4809 #ifdef EMULATE_SOCKETPAIR_UDP
4810 if (type == SOCK_DGRAM)
4811 return S_socketpair_udp(fd);
4814 listener = PerlSock_socket(AF_INET, type, 0);
4817 memset(&listen_addr, 0, sizeof(listen_addr));
4818 listen_addr.sin_family = AF_INET;
4819 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4820 listen_addr.sin_port = 0; /* kernel choses port. */
4821 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4822 sizeof(listen_addr)) == -1)
4823 goto tidy_up_and_fail;
4824 if (PerlSock_listen(listener, 1) == -1)
4825 goto tidy_up_and_fail;
4827 connector = PerlSock_socket(AF_INET, type, 0);
4828 if (connector == -1)
4829 goto tidy_up_and_fail;
4830 /* We want to find out the port number to connect to. */
4831 size = sizeof(connect_addr);
4832 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4834 goto tidy_up_and_fail;
4835 if (size != sizeof(connect_addr))
4836 goto abort_tidy_up_and_fail;
4837 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4838 sizeof(connect_addr)) == -1)
4839 goto tidy_up_and_fail;
4841 size = sizeof(listen_addr);
4842 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4845 goto tidy_up_and_fail;
4846 if (size != sizeof(listen_addr))
4847 goto abort_tidy_up_and_fail;
4848 PerlLIO_close(listener);
4849 /* Now check we are talking to ourself by matching port and host on the
4851 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4853 goto tidy_up_and_fail;
4854 if (size != sizeof(connect_addr)
4855 || listen_addr.sin_family != connect_addr.sin_family
4856 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4857 || listen_addr.sin_port != connect_addr.sin_port) {
4858 goto abort_tidy_up_and_fail;
4864 abort_tidy_up_and_fail:
4866 errno = ECONNABORTED; /* This would be the standard thing to do. */
4868 # ifdef ECONNREFUSED
4869 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4871 errno = ETIMEDOUT; /* Desperation time. */
4876 const int save_errno = errno;
4878 PerlLIO_close(listener);
4879 if (connector != -1)
4880 PerlLIO_close(connector);
4882 PerlLIO_close(acceptor);
4888 /* In any case have a stub so that there's code corresponding
4889 * to the my_socketpair in global.sym. */
4891 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4892 #ifdef HAS_SOCKETPAIR
4893 return socketpair(family, type, protocol, fd);
4902 =for apidoc sv_nosharing
4904 Dummy routine which "shares" an SV when there is no sharing module present.
4905 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4906 Exists to avoid test for a NULL function pointer and because it could
4907 potentially warn under some level of strict-ness.
4913 Perl_sv_nosharing(pTHX_ SV *sv)
4915 PERL_UNUSED_CONTEXT;
4916 PERL_UNUSED_ARG(sv);
4920 Perl_parse_unicode_opts(pTHX_ const char **popt)
4922 const char *p = *popt;
4927 opt = (U32) atoi(p);
4930 if (*p && *p != '\n' && *p != '\r')
4931 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4936 case PERL_UNICODE_STDIN:
4937 opt |= PERL_UNICODE_STDIN_FLAG; break;
4938 case PERL_UNICODE_STDOUT:
4939 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4940 case PERL_UNICODE_STDERR:
4941 opt |= PERL_UNICODE_STDERR_FLAG; break;
4942 case PERL_UNICODE_STD:
4943 opt |= PERL_UNICODE_STD_FLAG; break;
4944 case PERL_UNICODE_IN:
4945 opt |= PERL_UNICODE_IN_FLAG; break;
4946 case PERL_UNICODE_OUT:
4947 opt |= PERL_UNICODE_OUT_FLAG; break;
4948 case PERL_UNICODE_INOUT:
4949 opt |= PERL_UNICODE_INOUT_FLAG; break;
4950 case PERL_UNICODE_LOCALE:
4951 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4952 case PERL_UNICODE_ARGV:
4953 opt |= PERL_UNICODE_ARGV_FLAG; break;
4954 case PERL_UNICODE_UTF8CACHEASSERT:
4955 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4957 if (*p != '\n' && *p != '\r')
4959 "Unknown Unicode option letter '%c'", *p);
4965 opt = PERL_UNICODE_DEFAULT_FLAGS;
4967 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4968 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4969 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4981 * This is really just a quick hack which grabs various garbage
4982 * values. It really should be a real hash algorithm which
4983 * spreads the effect of every input bit onto every output bit,
4984 * if someone who knows about such things would bother to write it.
4985 * Might be a good idea to add that function to CORE as well.
4986 * No numbers below come from careful analysis or anything here,
4987 * except they are primes and SEED_C1 > 1E6 to get a full-width
4988 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4989 * probably be bigger too.
4992 # define SEED_C1 1000003
4993 #define SEED_C4 73819
4995 # define SEED_C1 25747
4996 #define SEED_C4 20639
5000 #define SEED_C5 26107
5002 #ifndef PERL_NO_DEV_RANDOM
5007 # include <starlet.h>
5008 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5009 * in 100-ns units, typically incremented ever 10 ms. */
5010 unsigned int when[2];
5012 # ifdef HAS_GETTIMEOFDAY
5013 struct timeval when;
5019 /* This test is an escape hatch, this symbol isn't set by Configure. */
5020 #ifndef PERL_NO_DEV_RANDOM
5021 #ifndef PERL_RANDOM_DEVICE
5022 /* /dev/random isn't used by default because reads from it will block
5023 * if there isn't enough entropy available. You can compile with
5024 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5025 * is enough real entropy to fill the seed. */
5026 # define PERL_RANDOM_DEVICE "/dev/urandom"
5028 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5030 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5039 _ckvmssts(sys$gettim(when));
5040 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5042 # ifdef HAS_GETTIMEOFDAY
5043 PerlProc_gettimeofday(&when,NULL);
5044 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5047 u = (U32)SEED_C1 * when;
5050 u += SEED_C3 * (U32)PerlProc_getpid();
5051 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5052 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5053 u += SEED_C5 * (U32)PTR2UV(&when);
5059 Perl_get_hash_seed(pTHX)
5062 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5068 if (s && isDIGIT(*s))
5069 myseed = (UV)Atoul(s);
5071 #ifdef USE_HASH_SEED_EXPLICIT
5075 /* Compute a random seed */
5076 (void)seedDrand01((Rand_seed_t)seed());
5077 myseed = (UV)(Drand01() * (NV)UV_MAX);
5078 #if RANDBITS < (UVSIZE * 8)
5079 /* Since there are not enough randbits to to reach all
5080 * the bits of a UV, the low bits might need extra
5081 * help. Sum in another random number that will
5082 * fill in the low bits. */
5084 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5085 #endif /* RANDBITS < (UVSIZE * 8) */
5086 if (myseed == 0) { /* Superparanoia. */
5087 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5089 Perl_croak(aTHX_ "Your random numbers are not that random");
5092 PL_rehash_seed_set = TRUE;
5099 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5101 const char * const stashpv = CopSTASHPV(c);
5102 const char * const name = HvNAME_get(hv);
5103 PERL_UNUSED_CONTEXT;
5105 if (stashpv == name)
5107 if (stashpv && name)
5108 if (strEQ(stashpv, name))
5115 #ifdef PERL_GLOBAL_STRUCT
5118 Perl_init_global_struct(pTHX)
5120 struct perl_vars *plvarsp = NULL;
5121 #ifdef PERL_GLOBAL_STRUCT
5122 # define PERL_GLOBAL_STRUCT_INIT
5123 # include "opcode.h" /* the ppaddr and check */
5124 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5125 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5126 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5127 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5128 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5132 plvarsp = PL_VarsPtr;
5133 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5139 # define PERLVAR(var,type) /**/
5140 # define PERLVARA(var,n,type) /**/
5141 # define PERLVARI(var,type,init) plvarsp->var = init;
5142 # define PERLVARIC(var,type,init) plvarsp->var = init;
5143 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5144 # include "perlvars.h"
5150 # ifdef PERL_GLOBAL_STRUCT
5151 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5152 if (!plvarsp->Gppaddr)
5154 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5155 if (!plvarsp->Gcheck)
5157 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5158 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5160 # ifdef PERL_SET_VARS
5161 PERL_SET_VARS(plvarsp);
5163 # undef PERL_GLOBAL_STRUCT_INIT
5168 #endif /* PERL_GLOBAL_STRUCT */
5170 #ifdef PERL_GLOBAL_STRUCT
5173 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5175 #ifdef PERL_GLOBAL_STRUCT
5176 # ifdef PERL_UNSET_VARS
5177 PERL_UNSET_VARS(plvarsp);
5179 free(plvarsp->Gppaddr);
5180 free(plvarsp->Gcheck);
5181 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5187 #endif /* PERL_GLOBAL_STRUCT */
5192 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5194 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5195 * variable PERL_MEM_LOG will be consulted, and if the integer value
5196 * of that is true, the logging will happen. (The default is to
5197 * always log if the PERL_MEM_LOG define was in effect.)
5201 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5202 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5204 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5207 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5208 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5209 * in which case the environment variable PERL_MEM_LOG_FD will be
5210 * consulted for the file descriptor number to use.
5212 #ifndef PERL_MEM_LOG_FD
5213 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5217 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)
5219 #ifdef PERL_MEM_LOG_STDERR
5220 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5223 # ifdef PERL_MEM_LOG_ENV
5224 s = getenv("PERL_MEM_LOG");
5225 if (s ? atoi(s) : 0)
5228 /* We can't use SVs or PerlIO for obvious reasons,
5229 * so we'll use stdio and low-level IO instead. */
5230 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5231 # ifdef PERL_MEM_LOG_TIMESTAMP
5233 # ifdef HAS_GETTIMEOFDAY
5234 gettimeofday(&tv, 0);
5236 /* If there are other OS specific ways of hires time than
5237 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5238 * probably that they would be used to fill in the struct
5245 # ifdef PERL_MEM_LOG_TIMESTAMP
5248 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5249 " %s = %"IVdf": %"UVxf"\n",
5250 # ifdef PERL_MEM_LOG_TIMESTAMP
5251 (int)tv.tv_sec, (int)tv.tv_usec,
5253 filename, linenumber, funcname, n, typesize,
5254 typename, n * typesize, PTR2UV(newalloc));
5255 # ifdef PERL_MEM_LOG_ENV_FD
5256 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5257 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5259 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5268 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)
5270 #ifdef PERL_MEM_LOG_STDERR
5271 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5274 # ifdef PERL_MEM_LOG_ENV
5275 s = PerlEnv_getenv("PERL_MEM_LOG");
5276 if (s ? atoi(s) : 0)
5279 /* We can't use SVs or PerlIO for obvious reasons,
5280 * so we'll use stdio and low-level IO instead. */
5281 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5282 # ifdef PERL_MEM_LOG_TIMESTAMP
5284 gettimeofday(&tv, 0);
5290 # ifdef PERL_MEM_LOG_TIMESTAMP
5293 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5294 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5295 # ifdef PERL_MEM_LOG_TIMESTAMP
5296 (int)tv.tv_sec, (int)tv.tv_usec,
5298 filename, linenumber, funcname, n, typesize,
5299 typename, n * typesize, PTR2UV(oldalloc),
5301 # ifdef PERL_MEM_LOG_ENV_FD
5302 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5303 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5305 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5314 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5316 #ifdef PERL_MEM_LOG_STDERR
5317 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5320 # ifdef PERL_MEM_LOG_ENV
5321 s = PerlEnv_getenv("PERL_MEM_LOG");
5322 if (s ? atoi(s) : 0)
5325 /* We can't use SVs or PerlIO for obvious reasons,
5326 * so we'll use stdio and low-level IO instead. */
5327 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5328 # ifdef PERL_MEM_LOG_TIMESTAMP
5330 gettimeofday(&tv, 0);
5336 # ifdef PERL_MEM_LOG_TIMESTAMP
5339 "free: %s:%d:%s: %"UVxf"\n",
5340 # ifdef PERL_MEM_LOG_TIMESTAMP
5341 (int)tv.tv_sec, (int)tv.tv_usec,
5343 filename, linenumber, funcname,
5345 # ifdef PERL_MEM_LOG_ENV_FD
5346 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5347 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5349 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5357 #endif /* PERL_MEM_LOG */
5360 =for apidoc my_sprintf
5362 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5363 the length of the string written to the buffer. Only rare pre-ANSI systems
5364 need the wrapper function - usually this is a direct call to C<sprintf>.
5368 #ifndef SPRINTF_RETURNS_STRLEN
5370 Perl_my_sprintf(char *buffer, const char* pat, ...)
5373 va_start(args, pat);
5374 vsprintf(buffer, pat, args);
5376 return strlen(buffer);
5381 =for apidoc my_snprintf
5383 The C library C<snprintf> functionality, if available and
5384 standards-compliant (uses C<vsnprintf>, actually). However, if the
5385 C<vsnprintf> is not available, will unfortunately use the unsafe
5386 C<vsprintf> which can overrun the buffer (there is an overrun check,
5387 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5388 getting C<vsnprintf>.
5393 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5398 va_start(ap, format);
5399 #ifdef HAS_VSNPRINTF
5400 retval = vsnprintf(buffer, len, format, ap);
5402 retval = vsprintf(buffer, format, ap);
5405 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5406 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5407 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5412 =for apidoc my_vsnprintf
5414 The C library C<vsnprintf> if available and standards-compliant.
5415 However, if if the C<vsnprintf> is not available, will unfortunately
5416 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5417 overrun check, but that may be too late). Consider using
5418 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5423 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5429 Perl_va_copy(ap, apc);
5430 # ifdef HAS_VSNPRINTF
5431 retval = vsnprintf(buffer, len, format, apc);
5433 retval = vsprintf(buffer, format, apc);
5436 # ifdef HAS_VSNPRINTF
5437 retval = vsnprintf(buffer, len, format, ap);
5439 retval = vsprintf(buffer, format, ap);
5441 #endif /* #ifdef NEED_VA_COPY */
5442 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5443 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5444 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5449 Perl_my_clearenv(pTHX)
5452 #if ! defined(PERL_MICRO)
5453 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5455 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5456 # if defined(USE_ENVIRON_ARRAY)
5457 # if defined(USE_ITHREADS)
5458 /* only the parent thread can clobber the process environment */
5459 if (PL_curinterp == aTHX)
5460 # endif /* USE_ITHREADS */
5462 # if ! defined(PERL_USE_SAFE_PUTENV)
5463 if ( !PL_use_safe_putenv) {
5465 if (environ == PL_origenviron)
5466 environ = (char**)safesysmalloc(sizeof(char*));
5468 for (i = 0; environ[i]; i++)
5469 (void)safesysfree(environ[i]);
5472 # else /* PERL_USE_SAFE_PUTENV */
5473 # if defined(HAS_CLEARENV)
5475 # elif defined(HAS_UNSETENV)
5476 int bsiz = 80; /* Most envvar names will be shorter than this. */
5477 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5478 char *buf = (char*)safesysmalloc(bufsiz);
5479 while (*environ != NULL) {
5480 char *e = strchr(*environ, '=');
5481 int l = e ? e - *environ : (int)strlen(*environ);
5483 (void)safesysfree(buf);
5484 bsiz = l + 1; /* + 1 for the \0. */
5485 buf = (char*)safesysmalloc(bufsiz);
5487 my_strlcpy(buf, *environ, l + 1);
5488 (void)unsetenv(buf);
5490 (void)safesysfree(buf);
5491 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5492 /* Just null environ and accept the leakage. */
5494 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5495 # endif /* ! PERL_USE_SAFE_PUTENV */
5497 # endif /* USE_ENVIRON_ARRAY */
5498 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5499 #endif /* PERL_MICRO */
5502 #ifdef PERL_IMPLICIT_CONTEXT
5504 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5505 the global PL_my_cxt_index is incremented, and that value is assigned to
5506 that module's static my_cxt_index (who's address is passed as an arg).
5507 Then, for each interpreter this function is called for, it makes sure a
5508 void* slot is available to hang the static data off, by allocating or
5509 extending the interpreter's PL_my_cxt_list array */
5512 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5517 /* this module hasn't been allocated an index yet */
5518 MUTEX_LOCK(&PL_my_ctx_mutex);
5519 *index = PL_my_cxt_index++;
5520 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5523 /* make sure the array is big enough */
5524 if (PL_my_cxt_size <= *index) {
5525 if (PL_my_cxt_size) {
5526 while (PL_my_cxt_size <= *index)
5527 PL_my_cxt_size *= 2;
5528 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5531 PL_my_cxt_size = 16;
5532 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5535 /* newSV() allocates one more than needed */
5536 p = (void*)SvPVX(newSV(size-1));
5537 PL_my_cxt_list[*index] = p;
5538 Zero(p, size, char);
5545 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5547 Size_t used, length, copy;
5550 length = strlen(src);
5551 if (size > 0 && used < size - 1) {
5552 copy = (length >= size - used) ? size - used - 1 : length;
5553 memcpy(dst + used, src, copy);
5554 dst[used + copy] = '\0';
5556 return used + length;
5562 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5564 Size_t length, copy;
5566 length = strlen(src);
5568 copy = (length >= size) ? size - 1 : length;
5569 memcpy(dst, src, copy);
5577 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5580 SV * const dbsv = GvSVn(PL_DBsub);
5581 /* We do not care about using sv to call CV;
5582 * it's for informational purposes only.
5586 if (!PERLDB_SUB_NN) {
5587 GV * const gv = CvGV(cv);
5589 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5590 || strEQ(GvNAME(gv), "END")
5591 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5592 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5593 /* Use GV from the stack as a fallback. */
5594 /* GV is potentially non-unique, or contain different CV. */
5595 SV * const tmp = newRV((SV*)cv);
5596 sv_setsv(dbsv, tmp);
5600 gv_efullname3(dbsv, gv, NULL);
5604 const int type = SvTYPE(dbsv);
5605 if (type < SVt_PVIV && type != SVt_IV)
5606 sv_upgrade(dbsv, SVt_PVIV);
5607 (void)SvIOK_on(dbsv);
5608 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5614 * c-indentation-style: bsd
5616 * indent-tabs-mode: t
5619 * ex: set ts=8 sts=4 sw=4 noet: