3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
263 if (size * count > 0xffff) {
264 PerlIO_printf(Perl_error_log,
265 "Allocation too large: %lx\n", size * count) FLUSH;
268 #endif /* HAS_64K_LIMIT */
270 if ((long)size < 0 || (long)count < 0)
271 Perl_croak_nocontext("panic: calloc");
274 #ifdef PERL_TRACK_MEMPOOL
277 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
278 PERL_ALLOC_CHECK(ptr);
279 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
281 memset((void*)ptr, 0, size);
282 #ifdef PERL_TRACK_MEMPOOL
284 struct perl_memory_debug_header *const header
285 = (struct perl_memory_debug_header *)ptr;
287 header->interpreter = aTHX;
288 /* Link us into the list. */
289 header->prev = &PL_memory_debug_header;
290 header->next = PL_memory_debug_header.next;
291 PL_memory_debug_header.next = header;
292 header->next->prev = header;
296 ptr = (Malloc_t)((char*)ptr+sTHX);
303 return write_no_mem();
306 /* These must be defined when not using Perl's malloc for binary
311 Malloc_t Perl_malloc (MEM_SIZE nbytes)
314 return (Malloc_t)PerlMem_malloc(nbytes);
317 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
320 return (Malloc_t)PerlMem_calloc(elements, size);
323 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
326 return (Malloc_t)PerlMem_realloc(where, nbytes);
329 Free_t Perl_mfree (Malloc_t where)
337 /* copy a string up to some (non-backslashed) delimiter, if any */
340 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
344 for (tolen = 0; from < fromend; from++, tolen++) {
346 if (from[1] == delim)
355 else if (*from == delim)
366 /* return ptr to little string in big string, NULL if not found */
367 /* This routine was donated by Corey Satten. */
370 Perl_instr(pTHX_ register const char *big, register const char *little)
381 register const char *s, *x;
384 for (x=big,s=little; *s; /**/ ) {
395 return (char*)(big-1);
400 /* same as instr but allow embedded nulls */
403 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
409 char first = *little++;
411 bigend -= lend - little;
413 while (big <= bigend) {
416 for (x=big,s=little; s < lend; x++,s++) {
420 return (char*)(big-1);
426 /* reverse of the above--find last substring */
429 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
431 register const char *bigbeg;
432 register const I32 first = *little;
433 register const char * const littleend = lend;
436 if (little >= littleend)
437 return (char*)bigend;
439 big = bigend - (littleend - little++);
440 while (big >= bigbeg) {
441 register const char *s, *x;
444 for (x=big+2,s=little; s < littleend; /**/ ) {
453 return (char*)(big+1);
458 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
460 /* As a space optimization, we do not compile tables for strings of length
461 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
462 special-cased in fbm_instr().
464 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
467 =head1 Miscellaneous Functions
469 =for apidoc fbm_compile
471 Analyses the string in order to make fast searches on it using fbm_instr()
472 -- the Boyer-Moore algorithm.
478 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
481 register const U8 *s;
487 if (flags & FBMcf_TAIL) {
488 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
489 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
490 if (mg && mg->mg_len >= 0)
493 s = (U8*)SvPV_force_mutable(sv, len);
494 SvUPGRADE(sv, SVt_PVBM);
495 if (len == 0) /* TAIL might be on a zero-length string. */
498 const unsigned char *sb;
499 const U8 mlen = (len>255) ? 255 : (U8)len;
502 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
503 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
504 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
505 memset((void*)table, mlen, 256);
506 table[-1] = (U8)flags;
508 sb = s - mlen + 1; /* first char (maybe) */
510 if (table[*s] == mlen)
515 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
518 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
519 for (i = 0; i < len; i++) {
520 if (PL_freq[s[i]] < frequency) {
522 frequency = PL_freq[s[i]];
525 BmRARE(sv) = s[rarest];
526 BmPREVIOUS(sv) = (U16)rarest;
527 BmUSEFUL(sv) = 100; /* Initial value */
528 if (flags & FBMcf_TAIL)
530 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
531 BmRARE(sv),BmPREVIOUS(sv)));
534 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
535 /* If SvTAIL is actually due to \Z or \z, this gives false positives
539 =for apidoc fbm_instr
541 Returns the location of the SV in the string delimited by C<str> and
542 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
543 does not have to be fbm_compiled, but the search will not be as fast
550 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
552 register unsigned char *s;
554 register const unsigned char *little
555 = (const unsigned char *)SvPV_const(littlestr,l);
556 register STRLEN littlelen = l;
557 register const I32 multiline = flags & FBMrf_MULTILINE;
559 if ((STRLEN)(bigend - big) < littlelen) {
560 if ( SvTAIL(littlestr)
561 && ((STRLEN)(bigend - big) == littlelen - 1)
563 || (*big == *little &&
564 memEQ((char *)big, (char *)little, littlelen - 1))))
569 if (littlelen <= 2) { /* Special-cased */
571 if (littlelen == 1) {
572 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
573 /* Know that bigend != big. */
574 if (bigend[-1] == '\n')
575 return (char *)(bigend - 1);
576 return (char *) bigend;
584 if (SvTAIL(littlestr))
585 return (char *) bigend;
589 return (char*)big; /* Cannot be SvTAIL! */
592 if (SvTAIL(littlestr) && !multiline) {
593 if (bigend[-1] == '\n' && bigend[-2] == *little)
594 return (char*)bigend - 2;
595 if (bigend[-1] == *little)
596 return (char*)bigend - 1;
600 /* This should be better than FBM if c1 == c2, and almost
601 as good otherwise: maybe better since we do less indirection.
602 And we save a lot of memory by caching no table. */
603 const unsigned char c1 = little[0];
604 const unsigned char c2 = little[1];
609 while (s <= bigend) {
619 goto check_1char_anchor;
630 goto check_1char_anchor;
633 while (s <= bigend) {
638 goto check_1char_anchor;
647 check_1char_anchor: /* One char and anchor! */
648 if (SvTAIL(littlestr) && (*bigend == *little))
649 return (char *)bigend; /* bigend is already decremented. */
652 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
653 s = bigend - littlelen;
654 if (s >= big && bigend[-1] == '\n' && *s == *little
655 /* Automatically of length > 2 */
656 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
658 return (char*)s; /* how sweet it is */
661 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
663 return (char*)s + 1; /* how sweet it is */
667 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
668 char * const b = ninstr((char*)big,(char*)bigend,
669 (char*)little, (char*)little + littlelen);
671 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
672 /* Chop \n from littlestr: */
673 s = bigend - littlelen + 1;
675 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
684 { /* Do actual FBM. */
685 register const unsigned char * const table = little + littlelen + FBM_TABLE_OFFSET;
686 register const unsigned char *oldlittle;
688 if (littlelen > (STRLEN)(bigend - big))
690 --littlelen; /* Last char found by table lookup */
693 little += littlelen; /* last char */
699 if ((tmp = table[*s])) {
700 if ((s += tmp) < bigend)
704 else { /* less expensive than calling strncmp() */
705 register unsigned char * const olds = s;
710 if (*--s == *--little)
712 s = olds + 1; /* here we pay the price for failure */
714 if (s < bigend) /* fake up continue to outer loop */
722 if ( s == bigend && (table[-1] & FBMcf_TAIL)
723 && memEQ((char *)(bigend - littlelen),
724 (char *)(oldlittle - littlelen), littlelen) )
725 return (char*)bigend - littlelen;
730 /* start_shift, end_shift are positive quantities which give offsets
731 of ends of some substring of bigstr.
732 If "last" we want the last occurrence.
733 old_posp is the way of communication between consequent calls if
734 the next call needs to find the .
735 The initial *old_posp should be -1.
737 Note that we take into account SvTAIL, so one can get extra
738 optimizations if _ALL flag is set.
741 /* If SvTAIL is actually due to \Z or \z, this gives false positives
742 if PL_multiline. In fact if !PL_multiline the authoritative answer
743 is not supported yet. */
746 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
749 register const unsigned char *big;
751 register I32 previous;
753 register const unsigned char *little;
754 register I32 stop_pos;
755 register const unsigned char *littleend;
759 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
760 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
762 if ( BmRARE(littlestr) == '\n'
763 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
764 little = (const unsigned char *)(SvPVX_const(littlestr));
765 littleend = little + SvCUR(littlestr);
772 little = (const unsigned char *)(SvPVX_const(littlestr));
773 littleend = little + SvCUR(littlestr);
775 /* The value of pos we can start at: */
776 previous = BmPREVIOUS(littlestr);
777 big = (const unsigned char *)(SvPVX_const(bigstr));
778 /* The value of pos we can stop at: */
779 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
780 if (previous + start_shift > stop_pos) {
782 stop_pos does not include SvTAIL in the count, so this check is incorrect
783 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
786 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
791 while (pos < previous + start_shift) {
792 if (!(pos += PL_screamnext[pos]))
797 register const unsigned char *s, *x;
798 if (pos >= stop_pos) break;
799 if (big[pos] != first)
801 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
807 if (s == littleend) {
809 if (!last) return (char *)(big+pos);
812 } while ( pos += PL_screamnext[pos] );
814 return (char *)(big+(*old_posp));
816 if (!SvTAIL(littlestr) || (end_shift > 0))
818 /* Ignore the trailing "\n". This code is not microoptimized */
819 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
820 stop_pos = littleend - little; /* Actual littlestr len */
825 && ((stop_pos == 1) ||
826 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
832 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
834 register const U8 *a = (const U8 *)s1;
835 register const U8 *b = (const U8 *)s2;
839 if (*a != *b && *a != PL_fold[*b])
847 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
850 register const U8 *a = (const U8 *)s1;
851 register const U8 *b = (const U8 *)s2;
855 if (*a != *b && *a != PL_fold_locale[*b])
862 /* copy a string to a safe spot */
865 =head1 Memory Management
869 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
870 string which is a duplicate of C<pv>. The size of the string is
871 determined by C<strlen()>. The memory allocated for the new string can
872 be freed with the C<Safefree()> function.
878 Perl_savepv(pTHX_ const char *pv)
885 const STRLEN pvlen = strlen(pv)+1;
886 Newx(newaddr,pvlen,char);
887 return memcpy(newaddr,pv,pvlen);
891 /* same thing but with a known length */
896 Perl's version of what C<strndup()> would be if it existed. Returns a
897 pointer to a newly allocated string which is a duplicate of the first
898 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
899 the new string can be freed with the C<Safefree()> function.
905 Perl_savepvn(pTHX_ const char *pv, register I32 len)
907 register char *newaddr;
910 Newx(newaddr,len+1,char);
911 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
913 /* might not be null terminated */
915 return (char *) CopyD(pv,newaddr,len,char);
918 return (char *) ZeroD(newaddr,len+1,char);
923 =for apidoc savesharedpv
925 A version of C<savepv()> which allocates the duplicate string in memory
926 which is shared between threads.
931 Perl_savesharedpv(pTHX_ const char *pv)
933 register char *newaddr;
938 pvlen = strlen(pv)+1;
939 newaddr = (char*)PerlMemShared_malloc(pvlen);
941 return write_no_mem();
943 return memcpy(newaddr,pv,pvlen);
949 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
950 the passed in SV using C<SvPV()>
956 Perl_savesvpv(pTHX_ SV *sv)
959 const char * const pv = SvPV_const(sv, len);
960 register char *newaddr;
963 Newx(newaddr,len,char);
964 return (char *) CopyD(pv,newaddr,len,char);
968 /* the SV for Perl_form() and mess() is not kept in an arena */
978 return sv_2mortal(newSVpvs(""));
983 /* Create as PVMG now, to avoid any upgrading later */
985 Newxz(any, 1, XPVMG);
986 SvFLAGS(sv) = SVt_PVMG;
987 SvANY(sv) = (void*)any;
989 SvREFCNT(sv) = 1 << 30; /* practically infinite */
994 #if defined(PERL_IMPLICIT_CONTEXT)
996 Perl_form_nocontext(const char* pat, ...)
1001 va_start(args, pat);
1002 retval = vform(pat, &args);
1006 #endif /* PERL_IMPLICIT_CONTEXT */
1009 =head1 Miscellaneous Functions
1012 Takes a sprintf-style format pattern and conventional
1013 (non-SV) arguments and returns the formatted string.
1015 (char *) Perl_form(pTHX_ const char* pat, ...)
1017 can be used any place a string (char *) is required:
1019 char * s = Perl_form("%d.%d",major,minor);
1021 Uses a single private buffer so if you want to format several strings you
1022 must explicitly copy the earlier strings away (and free the copies when you
1029 Perl_form(pTHX_ const char* pat, ...)
1033 va_start(args, pat);
1034 retval = vform(pat, &args);
1040 Perl_vform(pTHX_ const char *pat, va_list *args)
1042 SV * const sv = mess_alloc();
1043 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1047 #if defined(PERL_IMPLICIT_CONTEXT)
1049 Perl_mess_nocontext(const char *pat, ...)
1054 va_start(args, pat);
1055 retval = vmess(pat, &args);
1059 #endif /* PERL_IMPLICIT_CONTEXT */
1062 Perl_mess(pTHX_ const char *pat, ...)
1066 va_start(args, pat);
1067 retval = vmess(pat, &args);
1073 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1076 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1078 if (!o || o == PL_op)
1081 if (o->op_flags & OPf_KIDS) {
1083 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1086 /* If the OP_NEXTSTATE has been optimised away we can still use it
1087 * the get the file and line number. */
1089 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1090 cop = (const COP *)kid;
1092 /* Keep searching, and return when we've found something. */
1094 new_cop = closest_cop(cop, kid);
1100 /* Nothing found. */
1106 Perl_vmess(pTHX_ const char *pat, va_list *args)
1109 SV * const sv = mess_alloc();
1111 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1112 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1114 * Try and find the file and line for PL_op. This will usually be
1115 * PL_curcop, but it might be a cop that has been optimised away. We
1116 * can try to find such a cop by searching through the optree starting
1117 * from the sibling of PL_curcop.
1120 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1125 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1126 OutCopFILE(cop), (IV)CopLINE(cop));
1127 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1128 const bool line_mode = (RsSIMPLE(PL_rs) &&
1129 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1130 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1131 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1132 line_mode ? "line" : "chunk",
1133 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1136 sv_catpvs(sv, " during global destruction");
1137 sv_catpvs(sv, ".\n");
1143 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1149 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1150 && (io = GvIO(PL_stderrgv))
1151 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1158 SAVESPTR(PL_stderrgv);
1161 PUSHSTACKi(PERLSI_MAGIC);
1165 PUSHs(SvTIED_obj((SV*)io, mg));
1166 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1168 call_method("PRINT", G_SCALAR);
1176 /* SFIO can really mess with your errno */
1177 const int e = errno;
1179 PerlIO * const serr = Perl_error_log;
1181 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1182 (void)PerlIO_flush(serr);
1189 /* Common code used by vcroak, vdie, vwarn and vwarner */
1192 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1198 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1199 /* sv_2cv might call Perl_croak() or Perl_warner() */
1200 SV * const oldhook = *hook;
1207 cv = sv_2cv(oldhook, &stash, &gv, 0);
1209 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1219 if (warn || message) {
1220 msg = newSVpvn(message, msglen);
1221 SvFLAGS(msg) |= utf8;
1229 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1233 call_sv((SV*)cv, G_DISCARD);
1242 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1246 const char *message;
1249 SV * const msv = vmess(pat, args);
1250 if (PL_errors && SvCUR(PL_errors)) {
1251 sv_catsv(PL_errors, msv);
1252 message = SvPV_const(PL_errors, *msglen);
1253 SvCUR_set(PL_errors, 0);
1256 message = SvPV_const(msv,*msglen);
1257 *utf8 = SvUTF8(msv);
1263 DEBUG_S(PerlIO_printf(Perl_debug_log,
1264 "%p: die/croak: message = %s\ndiehook = %p\n",
1265 thr, message, PL_diehook));
1267 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1273 Perl_vdie(pTHX_ const char* pat, va_list *args)
1276 const char *message;
1277 const int was_in_eval = PL_in_eval;
1281 DEBUG_S(PerlIO_printf(Perl_debug_log,
1282 "%p: die: curstack = %p, mainstack = %p\n",
1283 thr, PL_curstack, PL_mainstack));
1285 message = vdie_croak_common(pat, args, &msglen, &utf8);
1287 PL_restartop = die_where(message, msglen);
1288 SvFLAGS(ERRSV) |= utf8;
1289 DEBUG_S(PerlIO_printf(Perl_debug_log,
1290 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1291 thr, PL_restartop, was_in_eval, PL_top_env));
1292 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1294 return PL_restartop;
1297 #if defined(PERL_IMPLICIT_CONTEXT)
1299 Perl_die_nocontext(const char* pat, ...)
1304 va_start(args, pat);
1305 o = vdie(pat, &args);
1309 #endif /* PERL_IMPLICIT_CONTEXT */
1312 Perl_die(pTHX_ const char* pat, ...)
1316 va_start(args, pat);
1317 o = vdie(pat, &args);
1323 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1326 const char *message;
1330 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1333 PL_restartop = die_where(message, msglen);
1334 SvFLAGS(ERRSV) |= utf8;
1338 message = SvPVx_const(ERRSV, msglen);
1340 write_to_stderr(message, msglen);
1344 #if defined(PERL_IMPLICIT_CONTEXT)
1346 Perl_croak_nocontext(const char *pat, ...)
1350 va_start(args, pat);
1355 #endif /* PERL_IMPLICIT_CONTEXT */
1358 =head1 Warning and Dieing
1362 This is the XSUB-writer's interface to Perl's C<die> function.
1363 Normally call this function the same way you call the C C<printf>
1364 function. Calling C<croak> returns control directly to Perl,
1365 sidestepping the normal C order of execution. See C<warn>.
1367 If you want to throw an exception object, assign the object to
1368 C<$@> and then pass C<NULL> to croak():
1370 errsv = get_sv("@", TRUE);
1371 sv_setsv(errsv, exception_object);
1378 Perl_croak(pTHX_ const char *pat, ...)
1381 va_start(args, pat);
1388 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1392 SV * const msv = vmess(pat, args);
1393 const I32 utf8 = SvUTF8(msv);
1394 const char * const message = SvPV_const(msv, msglen);
1397 if (vdie_common(message, msglen, utf8, TRUE))
1401 write_to_stderr(message, msglen);
1404 #if defined(PERL_IMPLICIT_CONTEXT)
1406 Perl_warn_nocontext(const char *pat, ...)
1410 va_start(args, pat);
1414 #endif /* PERL_IMPLICIT_CONTEXT */
1419 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1420 function the same way you call the C C<printf> function. See C<croak>.
1426 Perl_warn(pTHX_ const char *pat, ...)
1429 va_start(args, pat);
1434 #if defined(PERL_IMPLICIT_CONTEXT)
1436 Perl_warner_nocontext(U32 err, const char *pat, ...)
1440 va_start(args, pat);
1441 vwarner(err, pat, &args);
1444 #endif /* PERL_IMPLICIT_CONTEXT */
1447 Perl_warner(pTHX_ U32 err, const char* pat,...)
1450 va_start(args, pat);
1451 vwarner(err, pat, &args);
1456 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1460 SV * const msv = vmess(pat, args);
1462 const char * const message = SvPV_const(msv, msglen);
1463 const I32 utf8 = SvUTF8(msv);
1467 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1470 PL_restartop = die_where(message, msglen);
1471 SvFLAGS(ERRSV) |= utf8;
1474 write_to_stderr(message, msglen);
1478 Perl_vwarn(aTHX_ pat, args);
1482 /* implements the ckWARN? macros */
1485 Perl_ckwarn(pTHX_ U32 w)
1491 && PL_curcop->cop_warnings != pWARN_NONE
1493 PL_curcop->cop_warnings == pWARN_ALL
1494 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1495 || (unpackWARN2(w) &&
1496 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1497 || (unpackWARN3(w) &&
1498 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1499 || (unpackWARN4(w) &&
1500 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1505 isLEXWARN_off && PL_dowarn & G_WARN_ON
1510 /* implements the ckWARN?_d macro */
1513 Perl_ckwarn_d(pTHX_ U32 w)
1518 || PL_curcop->cop_warnings == pWARN_ALL
1520 PL_curcop->cop_warnings != pWARN_NONE
1522 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1523 || (unpackWARN2(w) &&
1524 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1525 || (unpackWARN3(w) &&
1526 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1527 || (unpackWARN4(w) &&
1528 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1534 /* Set buffer=NULL to get a new one. */
1536 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1538 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1540 buffer = specialWARN(buffer) ? PerlMemShared_malloc(len_wanted)
1541 : PerlMemShared_realloc(buffer, len_wanted);
1543 Copy(bits, (buffer + 1), size, char);
1547 /* since we've already done strlen() for both nam and val
1548 * we can use that info to make things faster than
1549 * sprintf(s, "%s=%s", nam, val)
1551 #define my_setenv_format(s, nam, nlen, val, vlen) \
1552 Copy(nam, s, nlen, char); \
1554 Copy(val, s+(nlen+1), vlen, char); \
1555 *(s+(nlen+1+vlen)) = '\0'
1557 #ifdef USE_ENVIRON_ARRAY
1558 /* VMS' my_setenv() is in vms.c */
1559 #if !defined(WIN32) && !defined(NETWARE)
1561 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1565 /* only parent thread can modify process environment */
1566 if (PL_curinterp == aTHX)
1569 #ifndef PERL_USE_SAFE_PUTENV
1570 if (!PL_use_safe_putenv) {
1571 /* most putenv()s leak, so we manipulate environ directly */
1572 register I32 i=setenv_getix(nam); /* where does it go? */
1575 if (environ == PL_origenviron) { /* need we copy environment? */
1580 for (max = i; environ[max]; max++) ;
1581 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1582 for (j=0; j<max; j++) { /* copy environment */
1583 const int len = strlen(environ[j]);
1584 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1585 Copy(environ[j], tmpenv[j], len+1, char);
1588 environ = tmpenv; /* tell exec where it is now */
1591 safesysfree(environ[i]);
1592 while (environ[i]) {
1593 environ[i] = environ[i+1];
1598 if (!environ[i]) { /* does not exist yet */
1599 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1600 environ[i+1] = NULL; /* make sure it's null terminated */
1603 safesysfree(environ[i]);
1607 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1608 /* all that work just for this */
1609 my_setenv_format(environ[i], nam, nlen, val, vlen);
1612 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1613 # if defined(HAS_UNSETENV)
1615 (void)unsetenv(nam);
1617 (void)setenv(nam, val, 1);
1619 # else /* ! HAS_UNSETENV */
1620 (void)setenv(nam, val, 1);
1621 # endif /* HAS_UNSETENV */
1623 # if defined(HAS_UNSETENV)
1625 (void)unsetenv(nam);
1627 const int nlen = strlen(nam);
1628 const int vlen = strlen(val);
1629 char * const new_env =
1630 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1631 my_setenv_format(new_env, nam, nlen, val, vlen);
1632 (void)putenv(new_env);
1634 # else /* ! HAS_UNSETENV */
1636 const int nlen = strlen(nam);
1642 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1643 /* all that work just for this */
1644 my_setenv_format(new_env, nam, nlen, val, vlen);
1645 (void)putenv(new_env);
1646 # endif /* HAS_UNSETENV */
1647 # endif /* __CYGWIN__ */
1648 #ifndef PERL_USE_SAFE_PUTENV
1654 #else /* WIN32 || NETWARE */
1657 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1660 register char *envstr;
1661 const int nlen = strlen(nam);
1668 Newx(envstr, nlen+vlen+2, char);
1669 my_setenv_format(envstr, nam, nlen, val, vlen);
1670 (void)PerlEnv_putenv(envstr);
1674 #endif /* WIN32 || NETWARE */
1678 Perl_setenv_getix(pTHX_ const char *nam)
1681 register const I32 len = strlen(nam);
1682 PERL_UNUSED_CONTEXT;
1684 for (i = 0; environ[i]; i++) {
1687 strnicmp(environ[i],nam,len) == 0
1689 strnEQ(environ[i],nam,len)
1691 && environ[i][len] == '=')
1692 break; /* strnEQ must come first to avoid */
1693 } /* potential SEGV's */
1696 #endif /* !PERL_MICRO */
1698 #endif /* !VMS && !EPOC*/
1700 #ifdef UNLINK_ALL_VERSIONS
1702 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1706 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1711 /* this is a drop-in replacement for bcopy() */
1712 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1714 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1716 char * const retval = to;
1718 if (from - to >= 0) {
1726 *(--to) = *(--from);
1732 /* this is a drop-in replacement for memset() */
1735 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1737 char * const retval = loc;
1745 /* this is a drop-in replacement for bzero() */
1746 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1748 Perl_my_bzero(register char *loc, register I32 len)
1750 char * const retval = loc;
1758 /* this is a drop-in replacement for memcmp() */
1759 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1761 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1763 register const U8 *a = (const U8 *)s1;
1764 register const U8 *b = (const U8 *)s2;
1768 if ((tmp = *a++ - *b++))
1773 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1777 #ifdef USE_CHAR_VSPRINTF
1782 vsprintf(char *dest, const char *pat, char *args)
1786 fakebuf._ptr = dest;
1787 fakebuf._cnt = 32767;
1791 fakebuf._flag = _IOWRT|_IOSTRG;
1792 _doprnt(pat, args, &fakebuf); /* what a kludge */
1793 (void)putc('\0', &fakebuf);
1794 #ifdef USE_CHAR_VSPRINTF
1797 return 0; /* perl doesn't use return value */
1801 #endif /* HAS_VPRINTF */
1804 #if BYTEORDER != 0x4321
1806 Perl_my_swap(pTHX_ short s)
1808 #if (BYTEORDER & 1) == 0
1811 result = ((s & 255) << 8) + ((s >> 8) & 255);
1819 Perl_my_htonl(pTHX_ long l)
1823 char c[sizeof(long)];
1826 #if BYTEORDER == 0x1234
1827 u.c[0] = (l >> 24) & 255;
1828 u.c[1] = (l >> 16) & 255;
1829 u.c[2] = (l >> 8) & 255;
1833 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1834 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1839 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1840 u.c[o & 0xf] = (l >> s) & 255;
1848 Perl_my_ntohl(pTHX_ long l)
1852 char c[sizeof(long)];
1855 #if BYTEORDER == 0x1234
1856 u.c[0] = (l >> 24) & 255;
1857 u.c[1] = (l >> 16) & 255;
1858 u.c[2] = (l >> 8) & 255;
1862 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1863 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1870 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1871 l |= (u.c[o & 0xf] & 255) << s;
1878 #endif /* BYTEORDER != 0x4321 */
1882 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1883 * If these functions are defined,
1884 * the BYTEORDER is neither 0x1234 nor 0x4321.
1885 * However, this is not assumed.
1889 #define HTOLE(name,type) \
1891 name (register type n) \
1895 char c[sizeof(type)]; \
1898 register U32 s = 0; \
1899 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1900 u.c[i] = (n >> s) & 0xFF; \
1905 #define LETOH(name,type) \
1907 name (register type n) \
1911 char c[sizeof(type)]; \
1914 register U32 s = 0; \
1917 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1918 n |= ((type)(u.c[i] & 0xFF)) << s; \
1924 * Big-endian byte order functions.
1927 #define HTOBE(name,type) \
1929 name (register type n) \
1933 char c[sizeof(type)]; \
1936 register U32 s = 8*(sizeof(u.c)-1); \
1937 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1938 u.c[i] = (n >> s) & 0xFF; \
1943 #define BETOH(name,type) \
1945 name (register type n) \
1949 char c[sizeof(type)]; \
1952 register U32 s = 8*(sizeof(u.c)-1); \
1955 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1956 n |= ((type)(u.c[i] & 0xFF)) << s; \
1962 * If we just can't do it...
1965 #define NOT_AVAIL(name,type) \
1967 name (register type n) \
1969 Perl_croak_nocontext(#name "() not available"); \
1970 return n; /* not reached */ \
1974 #if defined(HAS_HTOVS) && !defined(htovs)
1977 #if defined(HAS_HTOVL) && !defined(htovl)
1980 #if defined(HAS_VTOHS) && !defined(vtohs)
1983 #if defined(HAS_VTOHL) && !defined(vtohl)
1987 #ifdef PERL_NEED_MY_HTOLE16
1989 HTOLE(Perl_my_htole16,U16)
1991 NOT_AVAIL(Perl_my_htole16,U16)
1994 #ifdef PERL_NEED_MY_LETOH16
1996 LETOH(Perl_my_letoh16,U16)
1998 NOT_AVAIL(Perl_my_letoh16,U16)
2001 #ifdef PERL_NEED_MY_HTOBE16
2003 HTOBE(Perl_my_htobe16,U16)
2005 NOT_AVAIL(Perl_my_htobe16,U16)
2008 #ifdef PERL_NEED_MY_BETOH16
2010 BETOH(Perl_my_betoh16,U16)
2012 NOT_AVAIL(Perl_my_betoh16,U16)
2016 #ifdef PERL_NEED_MY_HTOLE32
2018 HTOLE(Perl_my_htole32,U32)
2020 NOT_AVAIL(Perl_my_htole32,U32)
2023 #ifdef PERL_NEED_MY_LETOH32
2025 LETOH(Perl_my_letoh32,U32)
2027 NOT_AVAIL(Perl_my_letoh32,U32)
2030 #ifdef PERL_NEED_MY_HTOBE32
2032 HTOBE(Perl_my_htobe32,U32)
2034 NOT_AVAIL(Perl_my_htobe32,U32)
2037 #ifdef PERL_NEED_MY_BETOH32
2039 BETOH(Perl_my_betoh32,U32)
2041 NOT_AVAIL(Perl_my_betoh32,U32)
2045 #ifdef PERL_NEED_MY_HTOLE64
2047 HTOLE(Perl_my_htole64,U64)
2049 NOT_AVAIL(Perl_my_htole64,U64)
2052 #ifdef PERL_NEED_MY_LETOH64
2054 LETOH(Perl_my_letoh64,U64)
2056 NOT_AVAIL(Perl_my_letoh64,U64)
2059 #ifdef PERL_NEED_MY_HTOBE64
2061 HTOBE(Perl_my_htobe64,U64)
2063 NOT_AVAIL(Perl_my_htobe64,U64)
2066 #ifdef PERL_NEED_MY_BETOH64
2068 BETOH(Perl_my_betoh64,U64)
2070 NOT_AVAIL(Perl_my_betoh64,U64)
2074 #ifdef PERL_NEED_MY_HTOLES
2075 HTOLE(Perl_my_htoles,short)
2077 #ifdef PERL_NEED_MY_LETOHS
2078 LETOH(Perl_my_letohs,short)
2080 #ifdef PERL_NEED_MY_HTOBES
2081 HTOBE(Perl_my_htobes,short)
2083 #ifdef PERL_NEED_MY_BETOHS
2084 BETOH(Perl_my_betohs,short)
2087 #ifdef PERL_NEED_MY_HTOLEI
2088 HTOLE(Perl_my_htolei,int)
2090 #ifdef PERL_NEED_MY_LETOHI
2091 LETOH(Perl_my_letohi,int)
2093 #ifdef PERL_NEED_MY_HTOBEI
2094 HTOBE(Perl_my_htobei,int)
2096 #ifdef PERL_NEED_MY_BETOHI
2097 BETOH(Perl_my_betohi,int)
2100 #ifdef PERL_NEED_MY_HTOLEL
2101 HTOLE(Perl_my_htolel,long)
2103 #ifdef PERL_NEED_MY_LETOHL
2104 LETOH(Perl_my_letohl,long)
2106 #ifdef PERL_NEED_MY_HTOBEL
2107 HTOBE(Perl_my_htobel,long)
2109 #ifdef PERL_NEED_MY_BETOHL
2110 BETOH(Perl_my_betohl,long)
2114 Perl_my_swabn(void *ptr, int n)
2116 register char *s = (char *)ptr;
2117 register char *e = s + (n-1);
2120 for (n /= 2; n > 0; s++, e--, n--) {
2128 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2130 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2133 register I32 This, that;
2139 PERL_FLUSHALL_FOR_CHILD;
2140 This = (*mode == 'w');
2144 taint_proper("Insecure %s%s", "EXEC");
2146 if (PerlProc_pipe(p) < 0)
2148 /* Try for another pipe pair for error return */
2149 if (PerlProc_pipe(pp) >= 0)
2151 while ((pid = PerlProc_fork()) < 0) {
2152 if (errno != EAGAIN) {
2153 PerlLIO_close(p[This]);
2154 PerlLIO_close(p[that]);
2156 PerlLIO_close(pp[0]);
2157 PerlLIO_close(pp[1]);
2169 /* Close parent's end of error status pipe (if any) */
2171 PerlLIO_close(pp[0]);
2172 #if defined(HAS_FCNTL) && defined(F_SETFD)
2173 /* Close error pipe automatically if exec works */
2174 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2177 /* Now dup our end of _the_ pipe to right position */
2178 if (p[THIS] != (*mode == 'r')) {
2179 PerlLIO_dup2(p[THIS], *mode == 'r');
2180 PerlLIO_close(p[THIS]);
2181 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2182 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2185 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2186 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2187 /* No automatic close - do it by hand */
2194 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2200 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2206 do_execfree(); /* free any memory malloced by child on fork */
2208 PerlLIO_close(pp[1]);
2209 /* Keep the lower of the two fd numbers */
2210 if (p[that] < p[This]) {
2211 PerlLIO_dup2(p[This], p[that]);
2212 PerlLIO_close(p[This]);
2216 PerlLIO_close(p[that]); /* close child's end of pipe */
2219 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2221 SvUPGRADE(sv,SVt_IV);
2223 PL_forkprocess = pid;
2224 /* If we managed to get status pipe check for exec fail */
2225 if (did_pipes && pid > 0) {
2230 while (n < sizeof(int)) {
2231 n1 = PerlLIO_read(pp[0],
2232 (void*)(((char*)&errkid)+n),
2238 PerlLIO_close(pp[0]);
2240 if (n) { /* Error */
2242 PerlLIO_close(p[This]);
2243 if (n != sizeof(int))
2244 Perl_croak(aTHX_ "panic: kid popen errno read");
2246 pid2 = wait4pid(pid, &status, 0);
2247 } while (pid2 == -1 && errno == EINTR);
2248 errno = errkid; /* Propagate errno from kid */
2253 PerlLIO_close(pp[0]);
2254 return PerlIO_fdopen(p[This], mode);
2256 Perl_croak(aTHX_ "List form of piped open not implemented");
2257 return (PerlIO *) NULL;
2261 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2262 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2264 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2268 register I32 This, that;
2271 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2275 PERL_FLUSHALL_FOR_CHILD;
2278 return my_syspopen(aTHX_ cmd,mode);
2281 This = (*mode == 'w');
2283 if (doexec && PL_tainting) {
2285 taint_proper("Insecure %s%s", "EXEC");
2287 if (PerlProc_pipe(p) < 0)
2289 if (doexec && PerlProc_pipe(pp) >= 0)
2291 while ((pid = PerlProc_fork()) < 0) {
2292 if (errno != EAGAIN) {
2293 PerlLIO_close(p[This]);
2294 PerlLIO_close(p[that]);
2296 PerlLIO_close(pp[0]);
2297 PerlLIO_close(pp[1]);
2300 Perl_croak(aTHX_ "Can't fork");
2313 PerlLIO_close(pp[0]);
2314 #if defined(HAS_FCNTL) && defined(F_SETFD)
2315 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2318 if (p[THIS] != (*mode == 'r')) {
2319 PerlLIO_dup2(p[THIS], *mode == 'r');
2320 PerlLIO_close(p[THIS]);
2321 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2322 PerlLIO_close(p[THAT]);
2325 PerlLIO_close(p[THAT]);
2328 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2335 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2340 /* may or may not use the shell */
2341 do_exec3(cmd, pp[1], did_pipes);
2344 #endif /* defined OS2 */
2345 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2346 SvREADONLY_off(GvSV(tmpgv));
2347 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2348 SvREADONLY_on(GvSV(tmpgv));
2350 #ifdef THREADS_HAVE_PIDS
2351 PL_ppid = (IV)getppid();
2354 #ifdef PERL_USES_PL_PIDSTATUS
2355 hv_clear(PL_pidstatus); /* we have no children */
2361 do_execfree(); /* free any memory malloced by child on vfork */
2363 PerlLIO_close(pp[1]);
2364 if (p[that] < p[This]) {
2365 PerlLIO_dup2(p[This], p[that]);
2366 PerlLIO_close(p[This]);
2370 PerlLIO_close(p[that]);
2373 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2375 SvUPGRADE(sv,SVt_IV);
2377 PL_forkprocess = pid;
2378 if (did_pipes && pid > 0) {
2383 while (n < sizeof(int)) {
2384 n1 = PerlLIO_read(pp[0],
2385 (void*)(((char*)&errkid)+n),
2391 PerlLIO_close(pp[0]);
2393 if (n) { /* Error */
2395 PerlLIO_close(p[This]);
2396 if (n != sizeof(int))
2397 Perl_croak(aTHX_ "panic: kid popen errno read");
2399 pid2 = wait4pid(pid, &status, 0);
2400 } while (pid2 == -1 && errno == EINTR);
2401 errno = errkid; /* Propagate errno from kid */
2406 PerlLIO_close(pp[0]);
2407 return PerlIO_fdopen(p[This], mode);
2410 #if defined(atarist) || defined(EPOC)
2413 Perl_my_popen(pTHX_ char *cmd, char *mode)
2415 PERL_FLUSHALL_FOR_CHILD;
2416 /* Call system's popen() to get a FILE *, then import it.
2417 used 0 for 2nd parameter to PerlIO_importFILE;
2420 return PerlIO_importFILE(popen(cmd, mode), 0);
2424 FILE *djgpp_popen();
2426 Perl_my_popen(pTHX_ char *cmd, char *mode)
2428 PERL_FLUSHALL_FOR_CHILD;
2429 /* Call system's popen() to get a FILE *, then import it.
2430 used 0 for 2nd parameter to PerlIO_importFILE;
2433 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2438 #endif /* !DOSISH */
2440 /* this is called in parent before the fork() */
2442 Perl_atfork_lock(void)
2445 #if defined(USE_ITHREADS)
2446 /* locks must be held in locking order (if any) */
2448 MUTEX_LOCK(&PL_malloc_mutex);
2454 /* this is called in both parent and child after the fork() */
2456 Perl_atfork_unlock(void)
2459 #if defined(USE_ITHREADS)
2460 /* locks must be released in same order as in atfork_lock() */
2462 MUTEX_UNLOCK(&PL_malloc_mutex);
2471 #if defined(HAS_FORK)
2473 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2478 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2479 * handlers elsewhere in the code */
2484 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2485 Perl_croak_nocontext("fork() not available");
2487 #endif /* HAS_FORK */
2492 Perl_dump_fds(pTHX_ char *s)
2497 PerlIO_printf(Perl_debug_log,"%s", s);
2498 for (fd = 0; fd < 32; fd++) {
2499 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2500 PerlIO_printf(Perl_debug_log," %d",fd);
2502 PerlIO_printf(Perl_debug_log,"\n");
2505 #endif /* DUMP_FDS */
2509 dup2(int oldfd, int newfd)
2511 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2514 PerlLIO_close(newfd);
2515 return fcntl(oldfd, F_DUPFD, newfd);
2517 #define DUP2_MAX_FDS 256
2518 int fdtmp[DUP2_MAX_FDS];
2524 PerlLIO_close(newfd);
2525 /* good enough for low fd's... */
2526 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2527 if (fdx >= DUP2_MAX_FDS) {
2535 PerlLIO_close(fdtmp[--fdx]);
2542 #ifdef HAS_SIGACTION
2544 #ifdef MACOS_TRADITIONAL
2545 /* We don't want restart behavior on MacOS */
2550 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2553 struct sigaction act, oact;
2556 /* only "parent" interpreter can diddle signals */
2557 if (PL_curinterp != aTHX)
2558 return (Sighandler_t) SIG_ERR;
2561 act.sa_handler = (void(*)(int))handler;
2562 sigemptyset(&act.sa_mask);
2565 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2566 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2568 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2569 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2570 act.sa_flags |= SA_NOCLDWAIT;
2572 if (sigaction(signo, &act, &oact) == -1)
2573 return (Sighandler_t) SIG_ERR;
2575 return (Sighandler_t) oact.sa_handler;
2579 Perl_rsignal_state(pTHX_ int signo)
2581 struct sigaction oact;
2582 PERL_UNUSED_CONTEXT;
2584 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2585 return (Sighandler_t) SIG_ERR;
2587 return (Sighandler_t) oact.sa_handler;
2591 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2594 struct sigaction act;
2597 /* only "parent" interpreter can diddle signals */
2598 if (PL_curinterp != aTHX)
2602 act.sa_handler = (void(*)(int))handler;
2603 sigemptyset(&act.sa_mask);
2606 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2607 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2609 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2610 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2611 act.sa_flags |= SA_NOCLDWAIT;
2613 return sigaction(signo, &act, save);
2617 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2621 /* only "parent" interpreter can diddle signals */
2622 if (PL_curinterp != aTHX)
2626 return sigaction(signo, save, (struct sigaction *)NULL);
2629 #else /* !HAS_SIGACTION */
2632 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2634 #if defined(USE_ITHREADS) && !defined(WIN32)
2635 /* only "parent" interpreter can diddle signals */
2636 if (PL_curinterp != aTHX)
2637 return (Sighandler_t) SIG_ERR;
2640 return PerlProc_signal(signo, handler);
2651 Perl_rsignal_state(pTHX_ int signo)
2654 Sighandler_t oldsig;
2656 #if defined(USE_ITHREADS) && !defined(WIN32)
2657 /* only "parent" interpreter can diddle signals */
2658 if (PL_curinterp != aTHX)
2659 return (Sighandler_t) SIG_ERR;
2663 oldsig = PerlProc_signal(signo, sig_trap);
2664 PerlProc_signal(signo, oldsig);
2666 PerlProc_kill(PerlProc_getpid(), signo);
2671 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2673 #if defined(USE_ITHREADS) && !defined(WIN32)
2674 /* only "parent" interpreter can diddle signals */
2675 if (PL_curinterp != aTHX)
2678 *save = PerlProc_signal(signo, handler);
2679 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2683 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2685 #if defined(USE_ITHREADS) && !defined(WIN32)
2686 /* only "parent" interpreter can diddle signals */
2687 if (PL_curinterp != aTHX)
2690 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2693 #endif /* !HAS_SIGACTION */
2694 #endif /* !PERL_MICRO */
2696 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2697 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2699 Perl_my_pclose(pTHX_ PerlIO *ptr)
2702 Sigsave_t hstat, istat, qstat;
2708 int saved_errno = 0;
2710 int saved_win32_errno;
2714 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2716 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2718 *svp = &PL_sv_undef;
2720 if (pid == -1) { /* Opened by popen. */
2721 return my_syspclose(ptr);
2724 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2725 saved_errno = errno;
2727 saved_win32_errno = GetLastError();
2731 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2734 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2735 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2736 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2739 pid2 = wait4pid(pid, &status, 0);
2740 } while (pid2 == -1 && errno == EINTR);
2742 rsignal_restore(SIGHUP, &hstat);
2743 rsignal_restore(SIGINT, &istat);
2744 rsignal_restore(SIGQUIT, &qstat);
2747 SETERRNO(saved_errno, 0);
2750 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2752 #endif /* !DOSISH */
2754 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2756 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2762 #ifdef PERL_USES_PL_PIDSTATUS
2765 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2766 pid, rather than a string form. */
2767 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2768 if (svp && *svp != &PL_sv_undef) {
2769 *statusp = SvIVX(*svp);
2770 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2778 hv_iterinit(PL_pidstatus);
2779 if ((entry = hv_iternext(PL_pidstatus))) {
2780 SV * const sv = hv_iterval(PL_pidstatus,entry);
2782 const char * const spid = hv_iterkey(entry,&len);
2784 assert (len == sizeof(Pid_t));
2785 memcpy((char *)&pid, spid, len);
2786 *statusp = SvIVX(sv);
2787 /* The hash iterator is currently on this entry, so simply
2788 calling hv_delete would trigger the lazy delete, which on
2789 aggregate does more work, beacuse next call to hv_iterinit()
2790 would spot the flag, and have to call the delete routine,
2791 while in the meantime any new entries can't re-use that
2793 hv_iterinit(PL_pidstatus);
2794 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2801 # ifdef HAS_WAITPID_RUNTIME
2802 if (!HAS_WAITPID_RUNTIME)
2805 result = PerlProc_waitpid(pid,statusp,flags);
2808 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2809 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2812 #ifdef PERL_USES_PL_PIDSTATUS
2813 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2818 Perl_croak(aTHX_ "Can't do waitpid with flags");
2820 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2821 pidgone(result,*statusp);
2827 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2830 if (result < 0 && errno == EINTR) {
2835 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2837 #ifdef PERL_USES_PL_PIDSTATUS
2839 Perl_pidgone(pTHX_ Pid_t pid, int status)
2843 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2844 SvUPGRADE(sv,SVt_IV);
2845 SvIV_set(sv, status);
2850 #if defined(atarist) || defined(OS2) || defined(EPOC)
2853 int /* Cannot prototype with I32
2855 my_syspclose(PerlIO *ptr)
2858 Perl_my_pclose(pTHX_ PerlIO *ptr)
2861 /* Needs work for PerlIO ! */
2862 FILE * const f = PerlIO_findFILE(ptr);
2863 const I32 result = pclose(f);
2864 PerlIO_releaseFILE(ptr,f);
2872 Perl_my_pclose(pTHX_ PerlIO *ptr)
2874 /* Needs work for PerlIO ! */
2875 FILE * const f = PerlIO_findFILE(ptr);
2876 I32 result = djgpp_pclose(f);
2877 result = (result << 8) & 0xff00;
2878 PerlIO_releaseFILE(ptr,f);
2884 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2887 register const char * const frombase = from;
2888 PERL_UNUSED_CONTEXT;
2891 register const char c = *from;
2896 while (count-- > 0) {
2897 for (todo = len; todo > 0; todo--) {
2906 Perl_same_dirent(pTHX_ const char *a, const char *b)
2908 char *fa = strrchr(a,'/');
2909 char *fb = strrchr(b,'/');
2912 SV * const tmpsv = sv_newmortal();
2925 sv_setpvn(tmpsv, ".", 1);
2927 sv_setpvn(tmpsv, a, fa - a);
2928 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2931 sv_setpvn(tmpsv, ".", 1);
2933 sv_setpvn(tmpsv, b, fb - b);
2934 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2936 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2937 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2939 #endif /* !HAS_RENAME */
2942 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2943 const char *const *const search_ext, I32 flags)
2946 const char *xfound = NULL;
2947 char *xfailed = NULL;
2948 char tmpbuf[MAXPATHLEN];
2952 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2953 # define SEARCH_EXTS ".bat", ".cmd", NULL
2954 # define MAX_EXT_LEN 4
2957 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2958 # define MAX_EXT_LEN 4
2961 # define SEARCH_EXTS ".pl", ".com", NULL
2962 # define MAX_EXT_LEN 4
2964 /* additional extensions to try in each dir if scriptname not found */
2966 static const char *const exts[] = { SEARCH_EXTS };
2967 const char *const *const ext = search_ext ? search_ext : exts;
2968 int extidx = 0, i = 0;
2969 const char *curext = NULL;
2971 PERL_UNUSED_ARG(search_ext);
2972 # define MAX_EXT_LEN 0
2976 * If dosearch is true and if scriptname does not contain path
2977 * delimiters, search the PATH for scriptname.
2979 * If SEARCH_EXTS is also defined, will look for each
2980 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2981 * while searching the PATH.
2983 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2984 * proceeds as follows:
2985 * If DOSISH or VMSISH:
2986 * + look for ./scriptname{,.foo,.bar}
2987 * + search the PATH for scriptname{,.foo,.bar}
2990 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2991 * this will not look in '.' if it's not in the PATH)
2996 # ifdef ALWAYS_DEFTYPES
2997 len = strlen(scriptname);
2998 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2999 int idx = 0, deftypes = 1;
3002 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3005 int idx = 0, deftypes = 1;
3008 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3010 /* The first time through, just add SEARCH_EXTS to whatever we
3011 * already have, so we can check for default file types. */
3013 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3019 if ((strlen(tmpbuf) + strlen(scriptname)
3020 + MAX_EXT_LEN) >= sizeof tmpbuf)
3021 continue; /* don't search dir with too-long name */
3022 strcat(tmpbuf, scriptname);
3026 if (strEQ(scriptname, "-"))
3028 if (dosearch) { /* Look in '.' first. */
3029 const char *cur = scriptname;
3031 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3033 if (strEQ(ext[i++],curext)) {
3034 extidx = -1; /* already has an ext */
3039 DEBUG_p(PerlIO_printf(Perl_debug_log,
3040 "Looking for %s\n",cur));
3041 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3042 && !S_ISDIR(PL_statbuf.st_mode)) {
3050 if (cur == scriptname) {
3051 len = strlen(scriptname);
3052 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3054 /* FIXME? Convert to memcpy */
3055 cur = strcpy(tmpbuf, scriptname);
3057 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3058 && strcpy(tmpbuf+len, ext[extidx++]));
3063 #ifdef MACOS_TRADITIONAL
3064 if (dosearch && !strchr(scriptname, ':') &&
3065 (s = PerlEnv_getenv("Commands")))
3067 if (dosearch && !strchr(scriptname, '/')
3069 && !strchr(scriptname, '\\')
3071 && (s = PerlEnv_getenv("PATH")))
3076 PL_bufend = s + strlen(s);
3077 while (s < PL_bufend) {
3078 #ifdef MACOS_TRADITIONAL
3079 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3083 #if defined(atarist) || defined(DOSISH)
3088 && *s != ';'; len++, s++) {
3089 if (len < sizeof tmpbuf)
3092 if (len < sizeof tmpbuf)
3094 #else /* ! (atarist || DOSISH) */
3095 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3098 #endif /* ! (atarist || DOSISH) */
3099 #endif /* MACOS_TRADITIONAL */
3102 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3103 continue; /* don't search dir with too-long name */
3104 #ifdef MACOS_TRADITIONAL
3105 if (len && tmpbuf[len - 1] != ':')
3106 tmpbuf[len++] = ':';
3109 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3110 && tmpbuf[len - 1] != '/'
3111 && tmpbuf[len - 1] != '\\'
3114 tmpbuf[len++] = '/';
3115 if (len == 2 && tmpbuf[0] == '.')
3118 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
3120 (void)strcpy(tmpbuf + len, scriptname);
3124 len = strlen(tmpbuf);
3125 if (extidx > 0) /* reset after previous loop */
3129 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3130 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3131 if (S_ISDIR(PL_statbuf.st_mode)) {
3135 } while ( retval < 0 /* not there */
3136 && extidx>=0 && ext[extidx] /* try an extension? */
3137 && strcpy(tmpbuf+len, ext[extidx++])
3142 if (S_ISREG(PL_statbuf.st_mode)
3143 && cando(S_IRUSR,TRUE,&PL_statbuf)
3144 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3145 && cando(S_IXUSR,TRUE,&PL_statbuf)
3149 xfound = tmpbuf; /* bingo! */
3153 xfailed = savepv(tmpbuf);
3156 if (!xfound && !seen_dot && !xfailed &&
3157 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3158 || S_ISDIR(PL_statbuf.st_mode)))
3160 seen_dot = 1; /* Disable message. */
3162 if (flags & 1) { /* do or die? */
3163 Perl_croak(aTHX_ "Can't %s %s%s%s",
3164 (xfailed ? "execute" : "find"),
3165 (xfailed ? xfailed : scriptname),
3166 (xfailed ? "" : " on PATH"),
3167 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3172 scriptname = xfound;
3174 return (scriptname ? savepv(scriptname) : NULL);
3177 #ifndef PERL_GET_CONTEXT_DEFINED
3180 Perl_get_context(void)
3183 #if defined(USE_ITHREADS)
3184 # ifdef OLD_PTHREADS_API
3186 if (pthread_getspecific(PL_thr_key, &t))
3187 Perl_croak_nocontext("panic: pthread_getspecific");
3190 # ifdef I_MACH_CTHREADS
3191 return (void*)cthread_data(cthread_self());
3193 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3202 Perl_set_context(void *t)
3205 #if defined(USE_ITHREADS)
3206 # ifdef I_MACH_CTHREADS
3207 cthread_set_data(cthread_self(), t);
3209 if (pthread_setspecific(PL_thr_key, t))
3210 Perl_croak_nocontext("panic: pthread_setspecific");
3217 #endif /* !PERL_GET_CONTEXT_DEFINED */
3219 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3228 Perl_get_op_names(pTHX)
3230 PERL_UNUSED_CONTEXT;
3231 return (char **)PL_op_name;
3235 Perl_get_op_descs(pTHX)
3237 PERL_UNUSED_CONTEXT;
3238 return (char **)PL_op_desc;
3242 Perl_get_no_modify(pTHX)
3244 PERL_UNUSED_CONTEXT;
3245 return PL_no_modify;
3249 Perl_get_opargs(pTHX)
3251 PERL_UNUSED_CONTEXT;
3252 return (U32 *)PL_opargs;
3256 Perl_get_ppaddr(pTHX)
3259 PERL_UNUSED_CONTEXT;
3260 return (PPADDR_t*)PL_ppaddr;
3263 #ifndef HAS_GETENV_LEN
3265 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3267 char * const env_trans = PerlEnv_getenv(env_elem);
3268 PERL_UNUSED_CONTEXT;
3270 *len = strlen(env_trans);
3277 Perl_get_vtbl(pTHX_ int vtbl_id)
3279 const MGVTBL* result;
3280 PERL_UNUSED_CONTEXT;
3284 result = &PL_vtbl_sv;
3287 result = &PL_vtbl_env;
3289 case want_vtbl_envelem:
3290 result = &PL_vtbl_envelem;
3293 result = &PL_vtbl_sig;
3295 case want_vtbl_sigelem:
3296 result = &PL_vtbl_sigelem;
3298 case want_vtbl_pack:
3299 result = &PL_vtbl_pack;
3301 case want_vtbl_packelem:
3302 result = &PL_vtbl_packelem;
3304 case want_vtbl_dbline:
3305 result = &PL_vtbl_dbline;
3308 result = &PL_vtbl_isa;
3310 case want_vtbl_isaelem:
3311 result = &PL_vtbl_isaelem;
3313 case want_vtbl_arylen:
3314 result = &PL_vtbl_arylen;
3316 case want_vtbl_mglob:
3317 result = &PL_vtbl_mglob;
3319 case want_vtbl_nkeys:
3320 result = &PL_vtbl_nkeys;
3322 case want_vtbl_taint:
3323 result = &PL_vtbl_taint;
3325 case want_vtbl_substr:
3326 result = &PL_vtbl_substr;
3329 result = &PL_vtbl_vec;
3332 result = &PL_vtbl_pos;
3335 result = &PL_vtbl_bm;
3338 result = &PL_vtbl_fm;
3340 case want_vtbl_uvar:
3341 result = &PL_vtbl_uvar;
3343 case want_vtbl_defelem:
3344 result = &PL_vtbl_defelem;
3346 case want_vtbl_regexp:
3347 result = &PL_vtbl_regexp;
3349 case want_vtbl_regdata:
3350 result = &PL_vtbl_regdata;
3352 case want_vtbl_regdatum:
3353 result = &PL_vtbl_regdatum;
3355 #ifdef USE_LOCALE_COLLATE
3356 case want_vtbl_collxfrm:
3357 result = &PL_vtbl_collxfrm;
3360 case want_vtbl_amagic:
3361 result = &PL_vtbl_amagic;
3363 case want_vtbl_amagicelem:
3364 result = &PL_vtbl_amagicelem;
3366 case want_vtbl_backref:
3367 result = &PL_vtbl_backref;
3369 case want_vtbl_utf8:
3370 result = &PL_vtbl_utf8;
3376 return (MGVTBL*)result;
3380 Perl_my_fflush_all(pTHX)
3382 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3383 return PerlIO_flush(NULL);
3385 # if defined(HAS__FWALK)
3386 extern int fflush(FILE *);
3387 /* undocumented, unprototyped, but very useful BSDism */
3388 extern void _fwalk(int (*)(FILE *));
3392 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3394 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3395 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3397 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3398 open_max = sysconf(_SC_OPEN_MAX);
3401 open_max = FOPEN_MAX;
3404 open_max = OPEN_MAX;
3415 for (i = 0; i < open_max; i++)
3416 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3417 STDIO_STREAM_ARRAY[i]._file < open_max &&
3418 STDIO_STREAM_ARRAY[i]._flag)
3419 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3423 SETERRNO(EBADF,RMS_IFI);
3430 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3432 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3434 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3435 if (ckWARN(WARN_IO)) {
3436 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3438 Perl_warner(aTHX_ packWARN(WARN_IO),
3439 "Filehandle %s opened only for %sput",
3442 Perl_warner(aTHX_ packWARN(WARN_IO),
3443 "Filehandle opened only for %sput", direction);
3450 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3452 warn_type = WARN_CLOSED;
3456 warn_type = WARN_UNOPENED;
3459 if (ckWARN(warn_type)) {
3460 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3461 const char * const func =
3462 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3463 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3464 op < 0 ? "" : /* handle phoney cases */
3466 const char * const type = OP_IS_SOCKET(op)
3467 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3468 ? "socket" : "filehandle";
3469 if (name && *name) {
3470 Perl_warner(aTHX_ packWARN(warn_type),
3471 "%s%s on %s %s %s", func, pars, vile, type, name);
3472 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3474 aTHX_ packWARN(warn_type),
3475 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3480 Perl_warner(aTHX_ packWARN(warn_type),
3481 "%s%s on %s %s", func, pars, vile, type);
3482 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3484 aTHX_ packWARN(warn_type),
3485 "\t(Are you trying to call %s%s on dirhandle?)\n",
3494 /* in ASCII order, not that it matters */
3495 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3498 Perl_ebcdic_control(pTHX_ int ch)
3506 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3507 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3510 if (ctlp == controllablechars)
3511 return('\177'); /* DEL */
3513 return((unsigned char)(ctlp - controllablechars - 1));
3514 } else { /* Want uncontrol */
3515 if (ch == '\177' || ch == -1)
3517 else if (ch == '\157')
3519 else if (ch == '\174')
3521 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3523 else if (ch == '\155')
3525 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3526 return(controllablechars[ch+1]);
3528 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3533 /* To workaround core dumps from the uninitialised tm_zone we get the
3534 * system to give us a reasonable struct to copy. This fix means that
3535 * strftime uses the tm_zone and tm_gmtoff values returned by
3536 * localtime(time()). That should give the desired result most of the
3537 * time. But probably not always!
3539 * This does not address tzname aspects of NETaa14816.
3544 # ifndef STRUCT_TM_HASZONE
3545 # define STRUCT_TM_HASZONE
3549 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3550 # ifndef HAS_TM_TM_ZONE
3551 # define HAS_TM_TM_ZONE
3556 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3558 #ifdef HAS_TM_TM_ZONE
3560 const struct tm* my_tm;
3562 my_tm = localtime(&now);
3564 Copy(my_tm, ptm, 1, struct tm);
3566 PERL_UNUSED_ARG(ptm);
3571 * mini_mktime - normalise struct tm values without the localtime()
3572 * semantics (and overhead) of mktime().
3575 Perl_mini_mktime(pTHX_ struct tm *ptm)
3579 int month, mday, year, jday;
3580 int odd_cent, odd_year;
3581 PERL_UNUSED_CONTEXT;
3583 #define DAYS_PER_YEAR 365
3584 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3585 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3586 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3587 #define SECS_PER_HOUR (60*60)
3588 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3589 /* parentheses deliberately absent on these two, otherwise they don't work */
3590 #define MONTH_TO_DAYS 153/5
3591 #define DAYS_TO_MONTH 5/153
3592 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3593 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3594 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3595 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3598 * Year/day algorithm notes:
3600 * With a suitable offset for numeric value of the month, one can find
3601 * an offset into the year by considering months to have 30.6 (153/5) days,
3602 * using integer arithmetic (i.e., with truncation). To avoid too much
3603 * messing about with leap days, we consider January and February to be
3604 * the 13th and 14th month of the previous year. After that transformation,
3605 * we need the month index we use to be high by 1 from 'normal human' usage,
3606 * so the month index values we use run from 4 through 15.
3608 * Given that, and the rules for the Gregorian calendar (leap years are those
3609 * divisible by 4 unless also divisible by 100, when they must be divisible
3610 * by 400 instead), we can simply calculate the number of days since some
3611 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3612 * the days we derive from our month index, and adding in the day of the
3613 * month. The value used here is not adjusted for the actual origin which
3614 * it normally would use (1 January A.D. 1), since we're not exposing it.
3615 * We're only building the value so we can turn around and get the
3616 * normalised values for the year, month, day-of-month, and day-of-year.
3618 * For going backward, we need to bias the value we're using so that we find
3619 * the right year value. (Basically, we don't want the contribution of
3620 * March 1st to the number to apply while deriving the year). Having done
3621 * that, we 'count up' the contribution to the year number by accounting for
3622 * full quadracenturies (400-year periods) with their extra leap days, plus
3623 * the contribution from full centuries (to avoid counting in the lost leap
3624 * days), plus the contribution from full quad-years (to count in the normal
3625 * leap days), plus the leftover contribution from any non-leap years.
3626 * At this point, if we were working with an actual leap day, we'll have 0
3627 * days left over. This is also true for March 1st, however. So, we have
3628 * to special-case that result, and (earlier) keep track of the 'odd'
3629 * century and year contributions. If we got 4 extra centuries in a qcent,
3630 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3631 * Otherwise, we add back in the earlier bias we removed (the 123 from
3632 * figuring in March 1st), find the month index (integer division by 30.6),
3633 * and the remainder is the day-of-month. We then have to convert back to
3634 * 'real' months (including fixing January and February from being 14/15 in
3635 * the previous year to being in the proper year). After that, to get
3636 * tm_yday, we work with the normalised year and get a new yearday value for
3637 * January 1st, which we subtract from the yearday value we had earlier,
3638 * representing the date we've re-built. This is done from January 1
3639 * because tm_yday is 0-origin.
3641 * Since POSIX time routines are only guaranteed to work for times since the
3642 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3643 * applies Gregorian calendar rules even to dates before the 16th century
3644 * doesn't bother me. Besides, you'd need cultural context for a given
3645 * date to know whether it was Julian or Gregorian calendar, and that's
3646 * outside the scope for this routine. Since we convert back based on the
3647 * same rules we used to build the yearday, you'll only get strange results
3648 * for input which needed normalising, or for the 'odd' century years which
3649 * were leap years in the Julian calander but not in the Gregorian one.
3650 * I can live with that.
3652 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3653 * that's still outside the scope for POSIX time manipulation, so I don't
3657 year = 1900 + ptm->tm_year;
3658 month = ptm->tm_mon;
3659 mday = ptm->tm_mday;
3660 /* allow given yday with no month & mday to dominate the result */
3661 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3664 jday = 1 + ptm->tm_yday;
3673 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3674 yearday += month*MONTH_TO_DAYS + mday + jday;
3676 * Note that we don't know when leap-seconds were or will be,
3677 * so we have to trust the user if we get something which looks
3678 * like a sensible leap-second. Wild values for seconds will
3679 * be rationalised, however.
3681 if ((unsigned) ptm->tm_sec <= 60) {
3688 secs += 60 * ptm->tm_min;
3689 secs += SECS_PER_HOUR * ptm->tm_hour;
3691 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3692 /* got negative remainder, but need positive time */
3693 /* back off an extra day to compensate */
3694 yearday += (secs/SECS_PER_DAY)-1;
3695 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3698 yearday += (secs/SECS_PER_DAY);
3699 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3702 else if (secs >= SECS_PER_DAY) {
3703 yearday += (secs/SECS_PER_DAY);
3704 secs %= SECS_PER_DAY;
3706 ptm->tm_hour = secs/SECS_PER_HOUR;
3707 secs %= SECS_PER_HOUR;
3708 ptm->tm_min = secs/60;
3710 ptm->tm_sec += secs;
3711 /* done with time of day effects */
3713 * The algorithm for yearday has (so far) left it high by 428.
3714 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3715 * bias it by 123 while trying to figure out what year it
3716 * really represents. Even with this tweak, the reverse
3717 * translation fails for years before A.D. 0001.
3718 * It would still fail for Feb 29, but we catch that one below.
3720 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3721 yearday -= YEAR_ADJUST;
3722 year = (yearday / DAYS_PER_QCENT) * 400;
3723 yearday %= DAYS_PER_QCENT;
3724 odd_cent = yearday / DAYS_PER_CENT;
3725 year += odd_cent * 100;
3726 yearday %= DAYS_PER_CENT;
3727 year += (yearday / DAYS_PER_QYEAR) * 4;
3728 yearday %= DAYS_PER_QYEAR;
3729 odd_year = yearday / DAYS_PER_YEAR;
3731 yearday %= DAYS_PER_YEAR;
3732 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3737 yearday += YEAR_ADJUST; /* recover March 1st crock */
3738 month = yearday*DAYS_TO_MONTH;
3739 yearday -= month*MONTH_TO_DAYS;
3740 /* recover other leap-year adjustment */
3749 ptm->tm_year = year - 1900;
3751 ptm->tm_mday = yearday;
3752 ptm->tm_mon = month;
3756 ptm->tm_mon = month - 1;
3758 /* re-build yearday based on Jan 1 to get tm_yday */
3760 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3761 yearday += 14*MONTH_TO_DAYS + 1;
3762 ptm->tm_yday = jday - yearday;
3763 /* fix tm_wday if not overridden by caller */
3764 if ((unsigned)ptm->tm_wday > 6)
3765 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3769 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)
3777 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3780 mytm.tm_hour = hour;
3781 mytm.tm_mday = mday;
3783 mytm.tm_year = year;
3784 mytm.tm_wday = wday;
3785 mytm.tm_yday = yday;
3786 mytm.tm_isdst = isdst;
3788 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3789 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3794 #ifdef HAS_TM_TM_GMTOFF
3795 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3797 #ifdef HAS_TM_TM_ZONE
3798 mytm.tm_zone = mytm2.tm_zone;
3803 Newx(buf, buflen, char);
3804 len = strftime(buf, buflen, fmt, &mytm);
3806 ** The following is needed to handle to the situation where
3807 ** tmpbuf overflows. Basically we want to allocate a buffer
3808 ** and try repeatedly. The reason why it is so complicated
3809 ** is that getting a return value of 0 from strftime can indicate
3810 ** one of the following:
3811 ** 1. buffer overflowed,
3812 ** 2. illegal conversion specifier, or
3813 ** 3. the format string specifies nothing to be returned(not
3814 ** an error). This could be because format is an empty string
3815 ** or it specifies %p that yields an empty string in some locale.
3816 ** If there is a better way to make it portable, go ahead by
3819 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3822 /* Possibly buf overflowed - try again with a bigger buf */
3823 const int fmtlen = strlen(fmt);
3824 const int bufsize = fmtlen + buflen;
3826 Newx(buf, bufsize, char);
3828 buflen = strftime(buf, bufsize, fmt, &mytm);
3829 if (buflen > 0 && buflen < bufsize)
3831 /* heuristic to prevent out-of-memory errors */
3832 if (bufsize > 100*fmtlen) {
3837 Renew(buf, bufsize*2, char);
3842 Perl_croak(aTHX_ "panic: no strftime");
3848 #define SV_CWD_RETURN_UNDEF \
3849 sv_setsv(sv, &PL_sv_undef); \
3852 #define SV_CWD_ISDOT(dp) \
3853 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3854 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3857 =head1 Miscellaneous Functions
3859 =for apidoc getcwd_sv
3861 Fill the sv with current working directory
3866 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3867 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3868 * getcwd(3) if available
3869 * Comments from the orignal:
3870 * This is a faster version of getcwd. It's also more dangerous
3871 * because you might chdir out of a directory that you can't chdir
3875 Perl_getcwd_sv(pTHX_ register SV *sv)
3879 #ifndef INCOMPLETE_TAINTS
3885 char buf[MAXPATHLEN];
3887 /* Some getcwd()s automatically allocate a buffer of the given
3888 * size from the heap if they are given a NULL buffer pointer.
3889 * The problem is that this behaviour is not portable. */
3890 if (getcwd(buf, sizeof(buf) - 1)) {
3895 sv_setsv(sv, &PL_sv_undef);
3903 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3907 SvUPGRADE(sv, SVt_PV);
3909 if (PerlLIO_lstat(".", &statbuf) < 0) {
3910 SV_CWD_RETURN_UNDEF;
3913 orig_cdev = statbuf.st_dev;
3914 orig_cino = statbuf.st_ino;
3923 if (PerlDir_chdir("..") < 0) {
3924 SV_CWD_RETURN_UNDEF;
3926 if (PerlLIO_stat(".", &statbuf) < 0) {
3927 SV_CWD_RETURN_UNDEF;
3930 cdev = statbuf.st_dev;
3931 cino = statbuf.st_ino;
3933 if (odev == cdev && oino == cino) {
3936 if (!(dir = PerlDir_open("."))) {
3937 SV_CWD_RETURN_UNDEF;
3940 while ((dp = PerlDir_read(dir)) != NULL) {
3942 const int namelen = dp->d_namlen;
3944 const int namelen = strlen(dp->d_name);
3947 if (SV_CWD_ISDOT(dp)) {
3951 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3952 SV_CWD_RETURN_UNDEF;
3955 tdev = statbuf.st_dev;
3956 tino = statbuf.st_ino;
3957 if (tino == oino && tdev == odev) {
3963 SV_CWD_RETURN_UNDEF;
3966 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3967 SV_CWD_RETURN_UNDEF;
3970 SvGROW(sv, pathlen + namelen + 1);
3974 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3977 /* prepend current directory to the front */
3979 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3980 pathlen += (namelen + 1);
3982 #ifdef VOID_CLOSEDIR
3985 if (PerlDir_close(dir) < 0) {
3986 SV_CWD_RETURN_UNDEF;
3992 SvCUR_set(sv, pathlen);
3996 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3997 SV_CWD_RETURN_UNDEF;
4000 if (PerlLIO_stat(".", &statbuf) < 0) {
4001 SV_CWD_RETURN_UNDEF;
4004 cdev = statbuf.st_dev;
4005 cino = statbuf.st_ino;
4007 if (cdev != orig_cdev || cino != orig_cino) {
4008 Perl_croak(aTHX_ "Unstable directory path, "
4009 "current directory changed unexpectedly");
4021 =for apidoc scan_version
4023 Returns a pointer to the next character after the parsed
4024 version string, as well as upgrading the passed in SV to
4027 Function must be called with an already existing SV like
4030 s = scan_version(s,SV *sv, bool qv);
4032 Performs some preprocessing to the string to ensure that
4033 it has the correct characteristics of a version. Flags the
4034 object if it contains an underscore (which denotes this
4035 is a alpha version). The boolean qv denotes that the version
4036 should be interpreted as if it had multiple decimals, even if
4043 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4051 AV * const av = newAV();
4052 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4053 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4055 #ifndef NODEFAULT_SHAREKEYS
4056 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4059 while (isSPACE(*s)) /* leading whitespace is OK */
4063 s++; /* get past 'v' */
4064 qv = 1; /* force quoted version processing */
4067 start = last = pos = s;
4069 /* pre-scan the input string to check for decimals/underbars */
4070 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4075 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4079 else if ( *pos == '_' )
4082 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4084 width = pos - last - 1; /* natural width of sub-version */
4089 if ( alpha && !saw_period )
4090 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4092 if ( saw_period > 1 )
4093 qv = 1; /* force quoted version processing */
4098 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4100 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4101 if ( !qv && width < 3 )
4102 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4104 while (isDIGIT(*pos))
4106 if (!isALPHA(*pos)) {
4112 /* this is atoi() that delimits on underscores */
4113 const char *end = pos;
4117 /* the following if() will only be true after the decimal
4118 * point of a version originally created with a bare
4119 * floating point number, i.e. not quoted in any way
4121 if ( !qv && s > start && saw_period == 1 ) {
4125 rev += (*s - '0') * mult;
4127 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4128 Perl_croak(aTHX_ "Integer overflow in version");
4135 while (--end >= s) {
4137 rev += (*end - '0') * mult;
4139 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4140 Perl_croak(aTHX_ "Integer overflow in version");
4145 /* Append revision */
4146 av_push(av, newSViv(rev));
4147 if ( *pos == '.' && isDIGIT(pos[1]) )
4149 else if ( *pos == '_' && isDIGIT(pos[1]) )
4151 else if ( isDIGIT(*pos) )
4158 while ( isDIGIT(*pos) )
4163 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4171 if ( qv ) { /* quoted versions always get at least three terms*/
4172 I32 len = av_len(av);
4173 /* This for loop appears to trigger a compiler bug on OS X, as it
4174 loops infinitely. Yes, len is negative. No, it makes no sense.
4175 Compiler in question is:
4176 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4177 for ( len = 2 - len; len > 0; len-- )
4178 av_push((AV *)sv, newSViv(0));
4182 av_push(av, newSViv(0));
4185 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4186 av_push(av, newSViv(0));
4188 /* And finally, store the AV in the hash */
4189 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4194 =for apidoc new_version
4196 Returns a new version object based on the passed in SV:
4198 SV *sv = new_version(SV *ver);
4200 Does not alter the passed in ver SV. See "upg_version" if you
4201 want to upgrade the SV.
4207 Perl_new_version(pTHX_ SV *ver)
4210 SV * const rv = newSV(0);
4211 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4214 AV * const av = newAV();
4216 /* This will get reblessed later if a derived class*/
4217 SV * const hv = newSVrv(rv, "version");
4218 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4219 #ifndef NODEFAULT_SHAREKEYS
4220 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4226 /* Begin copying all of the elements */
4227 if ( hv_exists((HV *)ver, "qv", 2) )
4228 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4230 if ( hv_exists((HV *)ver, "alpha", 5) )
4231 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4233 if ( hv_exists((HV*)ver, "width", 5 ) )
4235 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4236 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4239 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4240 /* This will get reblessed later if a derived class*/
4241 for ( key = 0; key <= av_len(sav); key++ )
4243 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4244 av_push(av, newSViv(rev));
4247 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4252 const MAGIC* const mg = SvVOK(ver);
4253 if ( mg ) { /* already a v-string */
4254 const STRLEN len = mg->mg_len;
4255 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4256 sv_setpvn(rv,version,len);
4261 sv_setsv(rv,ver); /* make a duplicate */
4266 return upg_version(rv);
4270 =for apidoc upg_version
4272 In-place upgrade of the supplied SV to a version object.
4274 SV *sv = upg_version(SV *sv);
4276 Returns a pointer to the upgraded SV.
4282 Perl_upg_version(pTHX_ SV *ver)
4284 const char *version, *s;
4290 if ( SvNOK(ver) ) /* may get too much accuracy */
4293 const STRLEN len = my_sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4294 version = savepvn(tbuf, len);
4297 else if ( (mg = SvVOK(ver)) ) { /* already a v-string */
4298 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4302 else /* must be a string or something like a string */
4304 version = savepv(SvPV_nolen(ver));
4306 s = scan_version(version, ver, qv);
4308 if(ckWARN(WARN_MISC))
4309 Perl_warner(aTHX_ packWARN(WARN_MISC),
4310 "Version string '%s' contains invalid data; "
4311 "ignoring: '%s'", version, s);
4319 Validates that the SV contains a valid version object.
4321 bool vverify(SV *vobj);
4323 Note that it only confirms the bare minimum structure (so as not to get
4324 confused by derived classes which may contain additional hash entries):
4328 =item * The SV contains a [reference to a] hash
4330 =item * The hash contains a "version" key
4332 =item * The "version" key has [a reference to] an AV as its value
4340 Perl_vverify(pTHX_ SV *vs)
4346 /* see if the appropriate elements exist */
4347 if ( SvTYPE(vs) == SVt_PVHV
4348 && hv_exists((HV*)vs, "version", 7)
4349 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4350 && SvTYPE(sv) == SVt_PVAV )
4359 Accepts a version object and returns the normalized floating
4360 point representation. Call like:
4364 NOTE: you can pass either the object directly or the SV
4365 contained within the RV.
4371 Perl_vnumify(pTHX_ SV *vs)
4376 SV * const sv = newSV(0);
4382 Perl_croak(aTHX_ "Invalid version object");
4384 /* see if various flags exist */
4385 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4387 if ( hv_exists((HV*)vs, "width", 5 ) )
4388 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4393 /* attempt to retrieve the version array */
4394 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4406 digit = SvIV(*av_fetch(av, 0, 0));
4407 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4408 for ( i = 1 ; i < len ; i++ )
4410 digit = SvIV(*av_fetch(av, i, 0));
4412 const int denom = (width == 2 ? 10 : 100);
4413 const div_t term = div((int)PERL_ABS(digit),denom);
4414 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4417 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4423 digit = SvIV(*av_fetch(av, len, 0));
4424 if ( alpha && width == 3 ) /* alpha version */
4426 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4430 sv_catpvs(sv, "000");
4438 Accepts a version object and returns the normalized string
4439 representation. Call like:
4443 NOTE: you can pass either the object directly or the SV
4444 contained within the RV.
4450 Perl_vnormal(pTHX_ SV *vs)
4454 SV * const sv = newSV(0);
4460 Perl_croak(aTHX_ "Invalid version object");
4462 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4464 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4472 digit = SvIV(*av_fetch(av, 0, 0));
4473 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4474 for ( i = 1 ; i < len ; i++ ) {
4475 digit = SvIV(*av_fetch(av, i, 0));
4476 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4481 /* handle last digit specially */
4482 digit = SvIV(*av_fetch(av, len, 0));
4484 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4486 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4489 if ( len <= 2 ) { /* short version, must be at least three */
4490 for ( len = 2 - len; len != 0; len-- )
4497 =for apidoc vstringify
4499 In order to maintain maximum compatibility with earlier versions
4500 of Perl, this function will return either the floating point
4501 notation or the multiple dotted notation, depending on whether
4502 the original version contained 1 or more dots, respectively
4508 Perl_vstringify(pTHX_ SV *vs)
4514 Perl_croak(aTHX_ "Invalid version object");
4516 if ( hv_exists((HV *)vs, "qv", 2) )
4525 Version object aware cmp. Both operands must already have been
4526 converted into version objects.
4532 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4535 bool lalpha = FALSE;
4536 bool ralpha = FALSE;
4545 if ( !vverify(lhv) )
4546 Perl_croak(aTHX_ "Invalid version object");
4548 if ( !vverify(rhv) )
4549 Perl_croak(aTHX_ "Invalid version object");
4551 /* get the left hand term */
4552 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4553 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4556 /* and the right hand term */
4557 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4558 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4566 while ( i <= m && retval == 0 )
4568 left = SvIV(*av_fetch(lav,i,0));
4569 right = SvIV(*av_fetch(rav,i,0));
4577 /* tiebreaker for alpha with identical terms */
4578 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4580 if ( lalpha && !ralpha )
4584 else if ( ralpha && !lalpha)
4590 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4594 while ( i <= r && retval == 0 )
4596 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4597 retval = -1; /* not a match after all */
4603 while ( i <= l && retval == 0 )
4605 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4606 retval = +1; /* not a match after all */
4614 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4615 # define EMULATE_SOCKETPAIR_UDP
4618 #ifdef EMULATE_SOCKETPAIR_UDP
4620 S_socketpair_udp (int fd[2]) {
4622 /* Fake a datagram socketpair using UDP to localhost. */
4623 int sockets[2] = {-1, -1};
4624 struct sockaddr_in addresses[2];
4626 Sock_size_t size = sizeof(struct sockaddr_in);
4627 unsigned short port;
4630 memset(&addresses, 0, sizeof(addresses));
4633 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4634 if (sockets[i] == -1)
4635 goto tidy_up_and_fail;
4637 addresses[i].sin_family = AF_INET;
4638 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4639 addresses[i].sin_port = 0; /* kernel choses port. */
4640 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4641 sizeof(struct sockaddr_in)) == -1)
4642 goto tidy_up_and_fail;
4645 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4646 for each connect the other socket to it. */
4649 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4651 goto tidy_up_and_fail;
4652 if (size != sizeof(struct sockaddr_in))
4653 goto abort_tidy_up_and_fail;
4654 /* !1 is 0, !0 is 1 */
4655 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4656 sizeof(struct sockaddr_in)) == -1)
4657 goto tidy_up_and_fail;
4660 /* Now we have 2 sockets connected to each other. I don't trust some other
4661 process not to have already sent a packet to us (by random) so send
4662 a packet from each to the other. */
4665 /* I'm going to send my own port number. As a short.
4666 (Who knows if someone somewhere has sin_port as a bitfield and needs
4667 this routine. (I'm assuming crays have socketpair)) */
4668 port = addresses[i].sin_port;
4669 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4670 if (got != sizeof(port)) {
4672 goto tidy_up_and_fail;
4673 goto abort_tidy_up_and_fail;
4677 /* Packets sent. I don't trust them to have arrived though.
4678 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4679 connect to localhost will use a second kernel thread. In 2.6 the
4680 first thread running the connect() returns before the second completes,
4681 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4682 returns 0. Poor programs have tripped up. One poor program's authors'
4683 had a 50-1 reverse stock split. Not sure how connected these were.)
4684 So I don't trust someone not to have an unpredictable UDP stack.
4688 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4689 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4693 FD_SET((unsigned int)sockets[0], &rset);
4694 FD_SET((unsigned int)sockets[1], &rset);
4696 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4697 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4698 || !FD_ISSET(sockets[1], &rset)) {
4699 /* I hope this is portable and appropriate. */
4701 goto tidy_up_and_fail;
4702 goto abort_tidy_up_and_fail;
4706 /* And the paranoia department even now doesn't trust it to have arrive
4707 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4709 struct sockaddr_in readfrom;
4710 unsigned short buffer[2];
4715 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4716 sizeof(buffer), MSG_DONTWAIT,
4717 (struct sockaddr *) &readfrom, &size);
4719 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4721 (struct sockaddr *) &readfrom, &size);
4725 goto tidy_up_and_fail;
4726 if (got != sizeof(port)
4727 || size != sizeof(struct sockaddr_in)
4728 /* Check other socket sent us its port. */
4729 || buffer[0] != (unsigned short) addresses[!i].sin_port
4730 /* Check kernel says we got the datagram from that socket */
4731 || readfrom.sin_family != addresses[!i].sin_family
4732 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4733 || readfrom.sin_port != addresses[!i].sin_port)
4734 goto abort_tidy_up_and_fail;
4737 /* My caller (my_socketpair) has validated that this is non-NULL */
4740 /* I hereby declare this connection open. May God bless all who cross
4744 abort_tidy_up_and_fail:
4745 errno = ECONNABORTED;
4748 const int save_errno = errno;
4749 if (sockets[0] != -1)
4750 PerlLIO_close(sockets[0]);
4751 if (sockets[1] != -1)
4752 PerlLIO_close(sockets[1]);
4757 #endif /* EMULATE_SOCKETPAIR_UDP */
4759 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4761 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4762 /* Stevens says that family must be AF_LOCAL, protocol 0.
4763 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4768 struct sockaddr_in listen_addr;
4769 struct sockaddr_in connect_addr;
4774 || family != AF_UNIX
4777 errno = EAFNOSUPPORT;
4785 #ifdef EMULATE_SOCKETPAIR_UDP
4786 if (type == SOCK_DGRAM)
4787 return S_socketpair_udp(fd);
4790 listener = PerlSock_socket(AF_INET, type, 0);
4793 memset(&listen_addr, 0, sizeof(listen_addr));
4794 listen_addr.sin_family = AF_INET;
4795 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4796 listen_addr.sin_port = 0; /* kernel choses port. */
4797 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4798 sizeof(listen_addr)) == -1)
4799 goto tidy_up_and_fail;
4800 if (PerlSock_listen(listener, 1) == -1)
4801 goto tidy_up_and_fail;
4803 connector = PerlSock_socket(AF_INET, type, 0);
4804 if (connector == -1)
4805 goto tidy_up_and_fail;
4806 /* We want to find out the port number to connect to. */
4807 size = sizeof(connect_addr);
4808 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4810 goto tidy_up_and_fail;
4811 if (size != sizeof(connect_addr))
4812 goto abort_tidy_up_and_fail;
4813 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4814 sizeof(connect_addr)) == -1)
4815 goto tidy_up_and_fail;
4817 size = sizeof(listen_addr);
4818 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4821 goto tidy_up_and_fail;
4822 if (size != sizeof(listen_addr))
4823 goto abort_tidy_up_and_fail;
4824 PerlLIO_close(listener);
4825 /* Now check we are talking to ourself by matching port and host on the
4827 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4829 goto tidy_up_and_fail;
4830 if (size != sizeof(connect_addr)
4831 || listen_addr.sin_family != connect_addr.sin_family
4832 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4833 || listen_addr.sin_port != connect_addr.sin_port) {
4834 goto abort_tidy_up_and_fail;
4840 abort_tidy_up_and_fail:
4842 errno = ECONNABORTED; /* This would be the standard thing to do. */
4844 # ifdef ECONNREFUSED
4845 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4847 errno = ETIMEDOUT; /* Desperation time. */
4852 const int save_errno = errno;
4854 PerlLIO_close(listener);
4855 if (connector != -1)
4856 PerlLIO_close(connector);
4858 PerlLIO_close(acceptor);
4864 /* In any case have a stub so that there's code corresponding
4865 * to the my_socketpair in global.sym. */
4867 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4868 #ifdef HAS_SOCKETPAIR
4869 return socketpair(family, type, protocol, fd);
4878 =for apidoc sv_nosharing
4880 Dummy routine which "shares" an SV when there is no sharing module present.
4881 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4882 Exists to avoid test for a NULL function pointer and because it could
4883 potentially warn under some level of strict-ness.
4889 Perl_sv_nosharing(pTHX_ SV *sv)
4891 PERL_UNUSED_CONTEXT;
4892 PERL_UNUSED_ARG(sv);
4896 Perl_parse_unicode_opts(pTHX_ const char **popt)
4898 const char *p = *popt;
4903 opt = (U32) atoi(p);
4904 while (isDIGIT(*p)) p++;
4905 if (*p && *p != '\n' && *p != '\r')
4906 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4911 case PERL_UNICODE_STDIN:
4912 opt |= PERL_UNICODE_STDIN_FLAG; break;
4913 case PERL_UNICODE_STDOUT:
4914 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4915 case PERL_UNICODE_STDERR:
4916 opt |= PERL_UNICODE_STDERR_FLAG; break;
4917 case PERL_UNICODE_STD:
4918 opt |= PERL_UNICODE_STD_FLAG; break;
4919 case PERL_UNICODE_IN:
4920 opt |= PERL_UNICODE_IN_FLAG; break;
4921 case PERL_UNICODE_OUT:
4922 opt |= PERL_UNICODE_OUT_FLAG; break;
4923 case PERL_UNICODE_INOUT:
4924 opt |= PERL_UNICODE_INOUT_FLAG; break;
4925 case PERL_UNICODE_LOCALE:
4926 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4927 case PERL_UNICODE_ARGV:
4928 opt |= PERL_UNICODE_ARGV_FLAG; break;
4929 case PERL_UNICODE_UTF8CACHEASSERT:
4930 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4932 if (*p != '\n' && *p != '\r')
4934 "Unknown Unicode option letter '%c'", *p);
4940 opt = PERL_UNICODE_DEFAULT_FLAGS;
4942 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4943 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4944 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4956 * This is really just a quick hack which grabs various garbage
4957 * values. It really should be a real hash algorithm which
4958 * spreads the effect of every input bit onto every output bit,
4959 * if someone who knows about such things would bother to write it.
4960 * Might be a good idea to add that function to CORE as well.
4961 * No numbers below come from careful analysis or anything here,
4962 * except they are primes and SEED_C1 > 1E6 to get a full-width
4963 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4964 * probably be bigger too.
4967 # define SEED_C1 1000003
4968 #define SEED_C4 73819
4970 # define SEED_C1 25747
4971 #define SEED_C4 20639
4975 #define SEED_C5 26107
4977 #ifndef PERL_NO_DEV_RANDOM
4982 # include <starlet.h>
4983 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4984 * in 100-ns units, typically incremented ever 10 ms. */
4985 unsigned int when[2];
4987 # ifdef HAS_GETTIMEOFDAY
4988 struct timeval when;
4994 /* This test is an escape hatch, this symbol isn't set by Configure. */
4995 #ifndef PERL_NO_DEV_RANDOM
4996 #ifndef PERL_RANDOM_DEVICE
4997 /* /dev/random isn't used by default because reads from it will block
4998 * if there isn't enough entropy available. You can compile with
4999 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5000 * is enough real entropy to fill the seed. */
5001 # define PERL_RANDOM_DEVICE "/dev/urandom"
5003 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5005 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5014 _ckvmssts(sys$gettim(when));
5015 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5017 # ifdef HAS_GETTIMEOFDAY
5018 PerlProc_gettimeofday(&when,NULL);
5019 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5022 u = (U32)SEED_C1 * when;
5025 u += SEED_C3 * (U32)PerlProc_getpid();
5026 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5027 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5028 u += SEED_C5 * (U32)PTR2UV(&when);
5034 Perl_get_hash_seed(pTHX)
5037 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5041 while (isSPACE(*s)) s++;
5042 if (s && isDIGIT(*s))
5043 myseed = (UV)Atoul(s);
5045 #ifdef USE_HASH_SEED_EXPLICIT
5049 /* Compute a random seed */
5050 (void)seedDrand01((Rand_seed_t)seed());
5051 myseed = (UV)(Drand01() * (NV)UV_MAX);
5052 #if RANDBITS < (UVSIZE * 8)
5053 /* Since there are not enough randbits to to reach all
5054 * the bits of a UV, the low bits might need extra
5055 * help. Sum in another random number that will
5056 * fill in the low bits. */
5058 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5059 #endif /* RANDBITS < (UVSIZE * 8) */
5060 if (myseed == 0) { /* Superparanoia. */
5061 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5063 Perl_croak(aTHX_ "Your random numbers are not that random");
5066 PL_rehash_seed_set = TRUE;
5073 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5075 const char * const stashpv = CopSTASHPV(c);
5076 const char * const name = HvNAME_get(hv);
5077 PERL_UNUSED_CONTEXT;
5079 if (stashpv == name)
5081 if (stashpv && name)
5082 if (strEQ(stashpv, name))
5089 #ifdef PERL_GLOBAL_STRUCT
5092 Perl_init_global_struct(pTHX)
5094 struct perl_vars *plvarsp = NULL;
5095 #ifdef PERL_GLOBAL_STRUCT
5096 # define PERL_GLOBAL_STRUCT_INIT
5097 # include "opcode.h" /* the ppaddr and check */
5098 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5099 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5100 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5101 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5102 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5106 plvarsp = PL_VarsPtr;
5107 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5113 # define PERLVAR(var,type) /**/
5114 # define PERLVARA(var,n,type) /**/
5115 # define PERLVARI(var,type,init) plvarsp->var = init;
5116 # define PERLVARIC(var,type,init) plvarsp->var = init;
5117 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5118 # include "perlvars.h"
5124 # ifdef PERL_GLOBAL_STRUCT
5125 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5126 if (!plvarsp->Gppaddr)
5128 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5129 if (!plvarsp->Gcheck)
5131 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5132 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5134 # ifdef PERL_SET_VARS
5135 PERL_SET_VARS(plvarsp);
5137 # undef PERL_GLOBAL_STRUCT_INIT
5142 #endif /* PERL_GLOBAL_STRUCT */
5144 #ifdef PERL_GLOBAL_STRUCT
5147 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5149 #ifdef PERL_GLOBAL_STRUCT
5150 # ifdef PERL_UNSET_VARS
5151 PERL_UNSET_VARS(plvarsp);
5153 free(plvarsp->Gppaddr);
5154 free(plvarsp->Gcheck);
5155 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5161 #endif /* PERL_GLOBAL_STRUCT */
5165 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5168 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)
5170 #ifdef PERL_MEM_LOG_STDERR
5171 /* We can't use PerlIO for obvious reasons. */
5172 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5173 const STRLEN len = my_sprintf(buf,
5174 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5175 " %s = %"IVdf": %"UVxf"\n",
5176 filename, linenumber, funcname, n, typesize,
5177 typename, n * typesize, PTR2UV(newalloc));
5178 PerlLIO_write(2, buf, len);
5184 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)
5186 #ifdef PERL_MEM_LOG_STDERR
5187 /* We can't use PerlIO for obvious reasons. */
5188 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5189 const STRLEN len = my_sprintf(buf, "realloc: %s:%d:%s: %"IVdf" %"UVuf
5190 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5191 filename, linenumber, funcname, n, typesize,
5192 typename, n * typesize, PTR2UV(oldalloc),
5194 PerlLIO_write(2, buf, len);
5200 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5202 #ifdef PERL_MEM_LOG_STDERR
5203 /* We can't use PerlIO for obvious reasons. */
5204 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5205 const STRLEN len = my_sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5206 filename, linenumber, funcname,
5208 PerlLIO_write(2, buf, len);
5213 #endif /* PERL_MEM_LOG */
5216 =for apidoc my_sprintf
5218 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5219 the length of the string written to the buffer. Only rare pre-ANSI systems
5220 need the wrapper function - usually this is a direct call to C<sprintf>.
5224 #ifndef SPRINTF_RETURNS_STRLEN
5226 Perl_my_sprintf(char *buffer, const char* pat, ...)
5229 va_start(args, pat);
5230 vsprintf(buffer, pat, args);
5232 return strlen(buffer);
5237 Perl_my_clearenv(pTHX)
5240 #if ! defined(PERL_MICRO)
5241 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5243 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5244 # if defined(USE_ENVIRON_ARRAY)
5245 # if defined(USE_ITHREADS)
5246 /* only the parent thread can clobber the process environment */
5247 if (PL_curinterp == aTHX)
5248 # endif /* USE_ITHREADS */
5250 # if ! defined(PERL_USE_SAFE_PUTENV)
5251 if ( !PL_use_safe_putenv) {
5253 if (environ == PL_origenviron)
5254 environ = (char**)safesysmalloc(sizeof(char*));
5256 for (i = 0; environ[i]; i++)
5257 (void)safesysfree(environ[i]);
5260 # else /* PERL_USE_SAFE_PUTENV */
5261 # if defined(HAS_CLEARENV)
5263 # elif defined(HAS_UNSETENV)
5264 int bsiz = 80; /* Most envvar names will be shorter than this. */
5265 char *buf = (char*)safesysmalloc(bsiz * sizeof(char));
5266 while (*environ != NULL) {
5267 char *e = strchr(*environ, '=');
5268 int l = e ? e - *environ : strlen(*environ);
5270 (void)safesysfree(buf);
5272 buf = (char*)safesysmalloc(bsiz * sizeof(char));
5274 strncpy(buf, *environ, l);
5276 (void)unsetenv(buf);
5278 (void)safesysfree(buf);
5279 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5280 /* Just null environ and accept the leakage. */
5282 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5283 # endif /* ! PERL_USE_SAFE_PUTENV */
5285 # endif /* USE_ENVIRON_ARRAY */
5286 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5287 #endif /* PERL_MICRO */
5290 #ifdef PERL_IMPLICIT_CONTEXT
5292 /* implements the MY_CXT_INIT macro. The first time a module is loaded,
5293 the global PL_my_cxt_index is incremented, and that value is assigned to
5294 that module's static my_cxt_index (who's address is passed as an arg).
5295 Then, for each interpreter this function is called for, it makes sure a
5296 void* slot is available to hang the static data off, by allocating or
5297 extending the interpreter's PL_my_cxt_list array */
5300 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5305 /* this module hasn't been allocated an index yet */
5306 MUTEX_LOCK(&PL_my_ctx_mutex);
5307 *index = PL_my_cxt_index++;
5308 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5311 /* make sure the array is big enough */
5312 if (PL_my_cxt_size <= *index) {
5313 if (PL_my_cxt_size) {
5314 while (PL_my_cxt_size <= *index)
5315 PL_my_cxt_size *= 2;
5316 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5319 PL_my_cxt_size = 16;
5320 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5323 /* newSV() allocates one more than needed */
5324 p = (void*)SvPVX(newSV(size-1));
5325 PL_my_cxt_list[*index] = p;
5326 Zero(p, size, char);
5333 * c-indentation-style: bsd
5335 * indent-tabs-mode: t
5338 * ex: set ts=8 sts=4 sw=4 noet: