3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
4 * 2002, 2003, 2004, 2005, 2006, 2007, 2008 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 to Pippin
15 * [p.598 of _The Lord of the Rings_, III/xi: "The PalantÃr"]
18 /* This file contains assorted utility routines.
19 * Which is a polite way of saying any stuff that people couldn't think of
20 * a better place for. Amongst other things, it includes the warning and
21 * dieing stuff, plus wrappers for malloc code.
25 #define PERL_IN_UTIL_C
31 # define SIG_ERR ((Sighandler_t) -1)
36 /* Missing protos on LynxOS */
41 # include <sys/wait.h>
46 # include <sys/select.h>
52 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
53 # define FD_CLOEXEC 1 /* NeXT needs this */
56 /* NOTE: Do not call the next three routines directly. Use the macros
57 * in handy.h, so that we can easily redefine everything to do tracking of
58 * allocated hunks back to the original New to track down any memory leaks.
59 * XXX This advice seems to be widely ignored :-( --AD August 1996.
66 /* Can't use PerlIO to write as it allocates memory */
67 PerlLIO_write(PerlIO_fileno(Perl_error_log),
68 PL_no_mem, strlen(PL_no_mem));
70 NORETURN_FUNCTION_END;
73 #if defined (DEBUGGING) || defined(PERL_IMPLICIT_SYS) || defined (PERL_TRACK_MEMPOOL)
74 # define ALWAYS_NEED_THX
77 /* paranoid version of system's malloc() */
80 Perl_safesysmalloc(MEM_SIZE size)
82 #ifdef ALWAYS_NEED_THX
88 PerlIO_printf(Perl_error_log,
89 "Allocation too large: %lx\n", size) FLUSH;
92 #endif /* HAS_64K_LIMIT */
93 #ifdef PERL_TRACK_MEMPOOL
98 Perl_croak_nocontext("panic: malloc");
100 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
101 PERL_ALLOC_CHECK(ptr);
102 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
104 #ifdef PERL_TRACK_MEMPOOL
105 struct perl_memory_debug_header *const header
106 = (struct perl_memory_debug_header *)ptr;
110 PoisonNew(((char *)ptr), size, char);
113 #ifdef PERL_TRACK_MEMPOOL
114 header->interpreter = aTHX;
115 /* Link us into the list. */
116 header->prev = &PL_memory_debug_header;
117 header->next = PL_memory_debug_header.next;
118 PL_memory_debug_header.next = header;
119 header->next->prev = header;
123 ptr = (Malloc_t)((char*)ptr+sTHX);
128 #ifndef ALWAYS_NEED_THX
134 return write_no_mem();
140 /* paranoid version of system's realloc() */
143 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
145 #ifdef ALWAYS_NEED_THX
149 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
150 Malloc_t PerlMem_realloc();
151 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
155 PerlIO_printf(Perl_error_log,
156 "Reallocation too large: %lx\n", size) FLUSH;
159 #endif /* HAS_64K_LIMIT */
166 return safesysmalloc(size);
167 #ifdef PERL_TRACK_MEMPOOL
168 where = (Malloc_t)((char*)where-sTHX);
171 struct perl_memory_debug_header *const header
172 = (struct perl_memory_debug_header *)where;
174 if (header->interpreter != aTHX) {
175 Perl_croak_nocontext("panic: realloc from wrong pool");
177 assert(header->next->prev == header);
178 assert(header->prev->next == header);
180 if (header->size > size) {
181 const MEM_SIZE freed_up = header->size - size;
182 char *start_of_freed = ((char *)where) + size;
183 PoisonFree(start_of_freed, freed_up, char);
191 Perl_croak_nocontext("panic: realloc");
193 ptr = (Malloc_t)PerlMem_realloc(where,size);
194 PERL_ALLOC_CHECK(ptr);
196 /* MUST do this fixup first, before doing ANYTHING else, as anything else
197 might allocate memory/free/move memory, and until we do the fixup, it
198 may well be chasing (and writing to) free memory. */
199 #ifdef PERL_TRACK_MEMPOOL
201 struct perl_memory_debug_header *const header
202 = (struct perl_memory_debug_header *)ptr;
205 if (header->size < size) {
206 const MEM_SIZE fresh = size - header->size;
207 char *start_of_fresh = ((char *)ptr) + size;
208 PoisonNew(start_of_fresh, fresh, char);
212 header->next->prev = header;
213 header->prev->next = header;
215 ptr = (Malloc_t)((char*)ptr+sTHX);
219 /* In particular, must do that fixup above before logging anything via
220 *printf(), as it can reallocate memory, which can cause SEGVs. */
222 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
223 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
230 #ifndef ALWAYS_NEED_THX
236 return write_no_mem();
242 /* safe version of system's free() */
245 Perl_safesysfree(Malloc_t where)
247 #ifdef ALWAYS_NEED_THX
252 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
254 #ifdef PERL_TRACK_MEMPOOL
255 where = (Malloc_t)((char*)where-sTHX);
257 struct perl_memory_debug_header *const header
258 = (struct perl_memory_debug_header *)where;
260 if (header->interpreter != aTHX) {
261 Perl_croak_nocontext("panic: free from wrong pool");
264 Perl_croak_nocontext("panic: duplicate free");
266 if (!(header->next) || header->next->prev != header
267 || header->prev->next != header) {
268 Perl_croak_nocontext("panic: bad free");
270 /* Unlink us from the chain. */
271 header->next->prev = header->prev;
272 header->prev->next = header->next;
274 PoisonNew(where, header->size, char);
276 /* Trigger the duplicate free warning. */
284 /* safe version of system's calloc() */
287 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
289 #ifdef ALWAYS_NEED_THX
293 MEM_SIZE total_size = 0;
295 /* Even though calloc() for zero bytes is strange, be robust. */
296 if (size && (count <= MEM_SIZE_MAX / size))
297 total_size = size * count;
299 Perl_croak_nocontext("%s", PL_memory_wrap);
300 #ifdef PERL_TRACK_MEMPOOL
301 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
304 Perl_croak_nocontext("%s", PL_memory_wrap);
307 if (total_size > 0xffff) {
308 PerlIO_printf(Perl_error_log,
309 "Allocation too large: %lx\n", total_size) FLUSH;
312 #endif /* HAS_64K_LIMIT */
314 if ((long)size < 0 || (long)count < 0)
315 Perl_croak_nocontext("panic: calloc");
317 #ifdef PERL_TRACK_MEMPOOL
318 /* Have to use malloc() because we've added some space for our tracking
320 /* malloc(0) is non-portable. */
321 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
323 /* Use calloc() because it might save a memset() if the memory is fresh
324 and clean from the OS. */
326 ptr = (Malloc_t)PerlMem_calloc(count, size);
327 else /* calloc(0) is non-portable. */
328 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
330 PERL_ALLOC_CHECK(ptr);
331 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)total_size));
333 #ifdef PERL_TRACK_MEMPOOL
335 struct perl_memory_debug_header *const header
336 = (struct perl_memory_debug_header *)ptr;
338 memset((void*)ptr, 0, total_size);
339 header->interpreter = aTHX;
340 /* Link us into the list. */
341 header->prev = &PL_memory_debug_header;
342 header->next = PL_memory_debug_header.next;
343 PL_memory_debug_header.next = header;
344 header->next->prev = header;
346 header->size = total_size;
348 ptr = (Malloc_t)((char*)ptr+sTHX);
354 #ifndef ALWAYS_NEED_THX
359 return write_no_mem();
363 /* These must be defined when not using Perl's malloc for binary
368 Malloc_t Perl_malloc (MEM_SIZE nbytes)
371 return (Malloc_t)PerlMem_malloc(nbytes);
374 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
377 return (Malloc_t)PerlMem_calloc(elements, size);
380 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
383 return (Malloc_t)PerlMem_realloc(where, nbytes);
386 Free_t Perl_mfree (Malloc_t where)
394 /* copy a string up to some (non-backslashed) delimiter, if any */
397 Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
401 PERL_ARGS_ASSERT_DELIMCPY;
403 for (tolen = 0; from < fromend; from++, tolen++) {
405 if (from[1] != delim) {
412 else if (*from == delim)
423 /* return ptr to little string in big string, NULL if not found */
424 /* This routine was donated by Corey Satten. */
427 Perl_instr(register const char *big, register const char *little)
431 PERL_ARGS_ASSERT_INSTR;
439 register const char *s, *x;
442 for (x=big,s=little; *s; /**/ ) {
453 return (char*)(big-1);
458 /* same as instr but allow embedded nulls */
461 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
463 PERL_ARGS_ASSERT_NINSTR;
467 const char first = *little;
469 bigend -= lend - little++;
471 while (big <= bigend) {
472 if (*big++ == first) {
473 for (x=big,s=little; s < lend; x++,s++) {
477 return (char*)(big-1);
484 /* reverse of the above--find last substring */
487 Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
489 register const char *bigbeg;
490 register const I32 first = *little;
491 register const char * const littleend = lend;
493 PERL_ARGS_ASSERT_RNINSTR;
495 if (little >= littleend)
496 return (char*)bigend;
498 big = bigend - (littleend - little++);
499 while (big >= bigbeg) {
500 register const char *s, *x;
503 for (x=big+2,s=little; s < littleend; /**/ ) {
512 return (char*)(big+1);
517 /* As a space optimization, we do not compile tables for strings of length
518 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
519 special-cased in fbm_instr().
521 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
524 =head1 Miscellaneous Functions
526 =for apidoc fbm_compile
528 Analyses the string in order to make fast searches on it using fbm_instr()
529 -- the Boyer-Moore algorithm.
535 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
538 register const U8 *s;
544 PERL_ARGS_ASSERT_FBM_COMPILE;
546 if (flags & FBMcf_TAIL) {
547 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
548 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
549 if (mg && mg->mg_len >= 0)
552 s = (U8*)SvPV_force_mutable(sv, len);
553 if (len == 0) /* TAIL might be on a zero-length string. */
555 SvUPGRADE(sv, SVt_PVGV);
560 const unsigned char *sb;
561 const U8 mlen = (len>255) ? 255 : (U8)len;
564 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
566 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
567 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
568 memset((void*)table, mlen, 256);
570 sb = s - mlen + 1; /* first char (maybe) */
572 if (table[*s] == mlen)
577 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
579 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
581 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
582 for (i = 0; i < len; i++) {
583 if (PL_freq[s[i]] < frequency) {
585 frequency = PL_freq[s[i]];
588 BmFLAGS(sv) = (U8)flags;
589 BmRARE(sv) = s[rarest];
590 BmPREVIOUS(sv) = rarest;
591 BmUSEFUL(sv) = 100; /* Initial value */
592 if (flags & FBMcf_TAIL)
594 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
595 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
598 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
599 /* If SvTAIL is actually due to \Z or \z, this gives false positives
603 =for apidoc fbm_instr
605 Returns the location of the SV in the string delimited by C<str> and
606 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
607 does not have to be fbm_compiled, but the search will not be as fast
614 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
616 register unsigned char *s;
618 register const unsigned char *little
619 = (const unsigned char *)SvPV_const(littlestr,l);
620 register STRLEN littlelen = l;
621 register const I32 multiline = flags & FBMrf_MULTILINE;
623 PERL_ARGS_ASSERT_FBM_INSTR;
625 if ((STRLEN)(bigend - big) < littlelen) {
626 if ( SvTAIL(littlestr)
627 && ((STRLEN)(bigend - big) == littlelen - 1)
629 || (*big == *little &&
630 memEQ((char *)big, (char *)little, littlelen - 1))))
635 if (littlelen <= 2) { /* Special-cased */
637 if (littlelen == 1) {
638 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
639 /* Know that bigend != big. */
640 if (bigend[-1] == '\n')
641 return (char *)(bigend - 1);
642 return (char *) bigend;
650 if (SvTAIL(littlestr))
651 return (char *) bigend;
655 return (char*)big; /* Cannot be SvTAIL! */
658 if (SvTAIL(littlestr) && !multiline) {
659 if (bigend[-1] == '\n' && bigend[-2] == *little)
660 return (char*)bigend - 2;
661 if (bigend[-1] == *little)
662 return (char*)bigend - 1;
666 /* This should be better than FBM if c1 == c2, and almost
667 as good otherwise: maybe better since we do less indirection.
668 And we save a lot of memory by caching no table. */
669 const unsigned char c1 = little[0];
670 const unsigned char c2 = little[1];
675 while (s <= bigend) {
685 goto check_1char_anchor;
696 goto check_1char_anchor;
699 while (s <= bigend) {
704 goto check_1char_anchor;
713 check_1char_anchor: /* One char and anchor! */
714 if (SvTAIL(littlestr) && (*bigend == *little))
715 return (char *)bigend; /* bigend is already decremented. */
718 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
719 s = bigend - littlelen;
720 if (s >= big && bigend[-1] == '\n' && *s == *little
721 /* Automatically of length > 2 */
722 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
724 return (char*)s; /* how sweet it is */
727 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
729 return (char*)s + 1; /* how sweet it is */
733 if (!SvVALID(littlestr)) {
734 char * const b = ninstr((char*)big,(char*)bigend,
735 (char*)little, (char*)little + littlelen);
737 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
738 /* Chop \n from littlestr: */
739 s = bigend - littlelen + 1;
741 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
751 if (littlelen > (STRLEN)(bigend - big))
755 register const unsigned char * const table
756 = little + littlelen + PERL_FBM_TABLE_OFFSET;
757 register const unsigned char *oldlittle;
759 --littlelen; /* Last char found by table lookup */
762 little += littlelen; /* last char */
768 if ((tmp = table[*s])) {
769 if ((s += tmp) < bigend)
773 else { /* less expensive than calling strncmp() */
774 register unsigned char * const olds = s;
779 if (*--s == *--little)
781 s = olds + 1; /* here we pay the price for failure */
783 if (s < bigend) /* fake up continue to outer loop */
792 && (BmFLAGS(littlestr) & FBMcf_TAIL)
793 && memEQ((char *)(bigend - littlelen),
794 (char *)(oldlittle - littlelen), littlelen) )
795 return (char*)bigend - littlelen;
800 /* start_shift, end_shift are positive quantities which give offsets
801 of ends of some substring of bigstr.
802 If "last" we want the last occurrence.
803 old_posp is the way of communication between consequent calls if
804 the next call needs to find the .
805 The initial *old_posp should be -1.
807 Note that we take into account SvTAIL, so one can get extra
808 optimizations if _ALL flag is set.
811 /* If SvTAIL is actually due to \Z or \z, this gives false positives
812 if PL_multiline. In fact if !PL_multiline the authoritative answer
813 is not supported yet. */
816 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
819 register const unsigned char *big;
821 register I32 previous;
823 register const unsigned char *little;
824 register I32 stop_pos;
825 register const unsigned char *littleend;
828 PERL_ARGS_ASSERT_SCREAMINSTR;
830 assert(SvTYPE(littlestr) == SVt_PVGV);
831 assert(SvVALID(littlestr));
834 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
835 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
837 if ( BmRARE(littlestr) == '\n'
838 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
839 little = (const unsigned char *)(SvPVX_const(littlestr));
840 littleend = little + SvCUR(littlestr);
847 little = (const unsigned char *)(SvPVX_const(littlestr));
848 littleend = little + SvCUR(littlestr);
850 /* The value of pos we can start at: */
851 previous = BmPREVIOUS(littlestr);
852 big = (const unsigned char *)(SvPVX_const(bigstr));
853 /* The value of pos we can stop at: */
854 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
855 if (previous + start_shift > stop_pos) {
857 stop_pos does not include SvTAIL in the count, so this check is incorrect
858 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
861 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
866 while (pos < previous + start_shift) {
867 if (!(pos += PL_screamnext[pos]))
872 register const unsigned char *s, *x;
873 if (pos >= stop_pos) break;
874 if (big[pos] != first)
876 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
882 if (s == littleend) {
884 if (!last) return (char *)(big+pos);
887 } while ( pos += PL_screamnext[pos] );
889 return (char *)(big+(*old_posp));
891 if (!SvTAIL(littlestr) || (end_shift > 0))
893 /* Ignore the trailing "\n". This code is not microoptimized */
894 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
895 stop_pos = littleend - little; /* Actual littlestr len */
900 && ((stop_pos == 1) ||
901 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
909 Returns true if the leading len bytes of the strings s1 and s2 are the same
910 case-insensitively; false otherwise. Uppercase and lowercase ASCII range bytes
911 match themselves and their opposite case counterparts. Non-cased and non-ASCII
912 range bytes match only themselves.
919 Perl_foldEQ(const char *s1, const char *s2, register I32 len)
921 register const U8 *a = (const U8 *)s1;
922 register const U8 *b = (const U8 *)s2;
924 PERL_ARGS_ASSERT_FOLDEQ;
927 if (*a != *b && *a != PL_fold[*b])
935 =for apidoc foldEQ_locale
937 Returns true if the leading len bytes of the strings s1 and s2 are the same
938 case-insensitively in the current locale; false otherwise.
944 Perl_foldEQ_locale(const char *s1, const char *s2, register I32 len)
947 register const U8 *a = (const U8 *)s1;
948 register const U8 *b = (const U8 *)s2;
950 PERL_ARGS_ASSERT_FOLDEQ_LOCALE;
953 if (*a != *b && *a != PL_fold_locale[*b])
960 /* copy a string to a safe spot */
963 =head1 Memory Management
967 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
968 string which is a duplicate of C<pv>. The size of the string is
969 determined by C<strlen()>. The memory allocated for the new string can
970 be freed with the C<Safefree()> function.
976 Perl_savepv(pTHX_ const char *pv)
983 const STRLEN pvlen = strlen(pv)+1;
984 Newx(newaddr, pvlen, char);
985 return (char*)memcpy(newaddr, pv, pvlen);
989 /* same thing but with a known length */
994 Perl's version of what C<strndup()> would be if it existed. Returns a
995 pointer to a newly allocated string which is a duplicate of the first
996 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
997 the new string can be freed with the C<Safefree()> function.
1003 Perl_savepvn(pTHX_ const char *pv, register I32 len)
1005 register char *newaddr;
1006 PERL_UNUSED_CONTEXT;
1008 Newx(newaddr,len+1,char);
1009 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1011 /* might not be null terminated */
1012 newaddr[len] = '\0';
1013 return (char *) CopyD(pv,newaddr,len,char);
1016 return (char *) ZeroD(newaddr,len+1,char);
1021 =for apidoc savesharedpv
1023 A version of C<savepv()> which allocates the duplicate string in memory
1024 which is shared between threads.
1029 Perl_savesharedpv(pTHX_ const char *pv)
1031 register char *newaddr;
1036 pvlen = strlen(pv)+1;
1037 newaddr = (char*)PerlMemShared_malloc(pvlen);
1039 return write_no_mem();
1041 return (char*)memcpy(newaddr, pv, pvlen);
1045 =for apidoc savesharedpvn
1047 A version of C<savepvn()> which allocates the duplicate string in memory
1048 which is shared between threads. (With the specific difference that a NULL
1049 pointer is not acceptable)
1054 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1056 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1058 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1061 return write_no_mem();
1063 newaddr[len] = '\0';
1064 return (char*)memcpy(newaddr, pv, len);
1068 =for apidoc savesvpv
1070 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1071 the passed in SV using C<SvPV()>
1077 Perl_savesvpv(pTHX_ SV *sv)
1080 const char * const pv = SvPV_const(sv, len);
1081 register char *newaddr;
1083 PERL_ARGS_ASSERT_SAVESVPV;
1086 Newx(newaddr,len,char);
1087 return (char *) CopyD(pv,newaddr,len,char);
1091 /* the SV for Perl_form() and mess() is not kept in an arena */
1101 return newSVpvs_flags("", SVs_TEMP);
1106 /* Create as PVMG now, to avoid any upgrading later */
1108 Newxz(any, 1, XPVMG);
1109 SvFLAGS(sv) = SVt_PVMG;
1110 SvANY(sv) = (void*)any;
1112 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1117 #if defined(PERL_IMPLICIT_CONTEXT)
1119 Perl_form_nocontext(const char* pat, ...)
1124 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1125 va_start(args, pat);
1126 retval = vform(pat, &args);
1130 #endif /* PERL_IMPLICIT_CONTEXT */
1133 =head1 Miscellaneous Functions
1136 Takes a sprintf-style format pattern and conventional
1137 (non-SV) arguments and returns the formatted string.
1139 (char *) Perl_form(pTHX_ const char* pat, ...)
1141 can be used any place a string (char *) is required:
1143 char * s = Perl_form("%d.%d",major,minor);
1145 Uses a single private buffer so if you want to format several strings you
1146 must explicitly copy the earlier strings away (and free the copies when you
1153 Perl_form(pTHX_ const char* pat, ...)
1157 PERL_ARGS_ASSERT_FORM;
1158 va_start(args, pat);
1159 retval = vform(pat, &args);
1165 Perl_vform(pTHX_ const char *pat, va_list *args)
1167 SV * const sv = mess_alloc();
1168 PERL_ARGS_ASSERT_VFORM;
1169 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1174 =for apidoc Am|SV *|mess|const char *pat|...
1176 Take a sprintf-style format pattern and argument list. These are used to
1177 generate a string message. If the message does not end with a newline,
1178 then it will be extended with some indication of the current location
1179 in the code, as described for L</mess_sv>.
1181 Normally, the resulting message is returned in a new mortal SV.
1182 During global destruction a single SV may be shared between uses of
1188 #if defined(PERL_IMPLICIT_CONTEXT)
1190 Perl_mess_nocontext(const char *pat, ...)
1195 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1196 va_start(args, pat);
1197 retval = vmess(pat, &args);
1201 #endif /* PERL_IMPLICIT_CONTEXT */
1204 Perl_mess(pTHX_ const char *pat, ...)
1208 PERL_ARGS_ASSERT_MESS;
1209 va_start(args, pat);
1210 retval = vmess(pat, &args);
1216 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1219 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1221 PERL_ARGS_ASSERT_CLOSEST_COP;
1223 if (!o || o == PL_op)
1226 if (o->op_flags & OPf_KIDS) {
1228 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1231 /* If the OP_NEXTSTATE has been optimised away we can still use it
1232 * the get the file and line number. */
1234 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1235 cop = (const COP *)kid;
1237 /* Keep searching, and return when we've found something. */
1239 new_cop = closest_cop(cop, kid);
1245 /* Nothing found. */
1251 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1253 Expands a message, intended for the user, to include an indication of
1254 the current location in the code, if the message does not already appear
1257 C<basemsg> is the initial message or object. If it is a reference, it
1258 will be used as-is and will be the result of this function. Otherwise it
1259 is used as a string, and if it already ends with a newline, it is taken
1260 to be complete, and the result of this function will be the same string.
1261 If the message does not end with a newline, then a segment such as C<at
1262 foo.pl line 37> will be appended, and possibly other clauses indicating
1263 the current state of execution. The resulting message will end with a
1266 Normally, the resulting message is returned in a new mortal SV.
1267 During global destruction a single SV may be shared between uses of this
1268 function. If C<consume> is true, then the function is permitted (but not
1269 required) to modify and return C<basemsg> instead of allocating a new SV.
1275 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1280 PERL_ARGS_ASSERT_MESS_SV;
1282 if (SvROK(basemsg)) {
1288 sv_setsv(sv, basemsg);
1293 if (SvPOK(basemsg) && consume) {
1298 sv_copypv(sv, basemsg);
1301 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1303 * Try and find the file and line for PL_op. This will usually be
1304 * PL_curcop, but it might be a cop that has been optimised away. We
1305 * can try to find such a cop by searching through the optree starting
1306 * from the sibling of PL_curcop.
1309 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1314 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1315 OutCopFILE(cop), (IV)CopLINE(cop));
1316 /* Seems that GvIO() can be untrustworthy during global destruction. */
1317 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1318 && IoLINES(GvIOp(PL_last_in_gv)))
1320 const bool line_mode = (RsSIMPLE(PL_rs) &&
1321 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1322 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1323 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1324 line_mode ? "line" : "chunk",
1325 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1328 sv_catpvs(sv, " during global destruction");
1329 sv_catpvs(sv, ".\n");
1335 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1337 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1338 argument list. These are used to generate a string message. If the
1339 message does not end with a newline, then it will be extended with
1340 some indication of the current location in the code, as described for
1343 Normally, the resulting message is returned in a new mortal SV.
1344 During global destruction a single SV may be shared between uses of
1351 Perl_vmess(pTHX_ const char *pat, va_list *args)
1354 SV * const sv = mess_alloc();
1356 PERL_ARGS_ASSERT_VMESS;
1358 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1359 return mess_sv(sv, 1);
1363 Perl_write_to_stderr(pTHX_ SV* msv)
1369 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1371 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1372 && (io = GvIO(PL_stderrgv))
1373 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1380 SAVESPTR(PL_stderrgv);
1383 PUSHSTACKi(PERLSI_MAGIC);
1387 PUSHs(SvTIED_obj(MUTABLE_SV(io), mg));
1390 call_method("PRINT", G_SCALAR);
1398 /* SFIO can really mess with your errno */
1401 PerlIO * const serr = Perl_error_log;
1403 do_print(msv, serr);
1404 (void)PerlIO_flush(serr);
1412 =head1 Warning and Dieing
1415 /* Common code used in dieing and warning */
1418 S_with_queued_errors(pTHX_ SV *ex)
1420 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1421 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1422 sv_catsv(PL_errors, ex);
1423 ex = sv_mortalcopy(PL_errors);
1424 SvCUR_set(PL_errors, 0);
1430 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1436 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1437 /* sv_2cv might call Perl_croak() or Perl_warner() */
1438 SV * const oldhook = *hook;
1446 cv = sv_2cv(oldhook, &stash, &gv, 0);
1448 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1458 exarg = newSVsv(ex);
1459 SvREADONLY_on(exarg);
1462 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1466 call_sv(MUTABLE_SV(cv), G_DISCARD);
1475 =for apidoc Am|OP *|die_sv|SV *baseex
1477 Behaves the same as L</croak_sv>, except for the return type.
1478 It should be used only where the C<OP *> return type is required.
1479 The function never actually returns.
1485 Perl_die_sv(pTHX_ SV *baseex)
1487 PERL_ARGS_ASSERT_DIE_SV;
1494 =for apidoc Am|OP *|die|const char *pat|...
1496 Behaves the same as L</croak>, except for the return type.
1497 It should be used only where the C<OP *> return type is required.
1498 The function never actually returns.
1503 #if defined(PERL_IMPLICIT_CONTEXT)
1505 Perl_die_nocontext(const char* pat, ...)
1509 va_start(args, pat);
1515 #endif /* PERL_IMPLICIT_CONTEXT */
1518 Perl_die(pTHX_ const char* pat, ...)
1521 va_start(args, pat);
1529 =for apidoc Am|void|croak_sv|SV *baseex
1531 This is an XS interface to Perl's C<die> function.
1533 C<baseex> is the error message or object. If it is a reference, it
1534 will be used as-is. Otherwise it is used as a string, and if it does
1535 not end with a newline then it will be extended with some indication of
1536 the current location in the code, as described for L</mess_sv>.
1538 The error message or object will be used as an exception, by default
1539 returning control to the nearest enclosing C<eval>, but subject to
1540 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1541 function never returns normally.
1543 To die with a simple string message, the L</croak> function may be
1550 Perl_croak_sv(pTHX_ SV *baseex)
1552 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1553 PERL_ARGS_ASSERT_CROAK_SV;
1554 invoke_exception_hook(ex, FALSE);
1559 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1561 This is an XS interface to Perl's C<die> function.
1563 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1564 argument list. These are used to generate a string message. If the
1565 message does not end with a newline, then it will be extended with
1566 some indication of the current location in the code, as described for
1569 The error message will be used as an exception, by default
1570 returning control to the nearest enclosing C<eval>, but subject to
1571 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1572 function never returns normally.
1574 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1575 (C<$@>) will be used as an error message or object instead of building an
1576 error message from arguments. If you want to throw a non-string object,
1577 or build an error message in an SV yourself, it is preferable to use
1578 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1584 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1586 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1587 invoke_exception_hook(ex, FALSE);
1592 =for apidoc Am|void|croak|const char *pat|...
1594 This is an XS interface to Perl's C<die> function.
1596 Take a sprintf-style format pattern and argument list. These are used to
1597 generate a string message. If the message does not end with a newline,
1598 then it will be extended with some indication of the current location
1599 in the code, as described for L</mess_sv>.
1601 The error message will be used as an exception, by default
1602 returning control to the nearest enclosing C<eval>, but subject to
1603 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1604 function never returns normally.
1606 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1607 (C<$@>) will be used as an error message or object instead of building an
1608 error message from arguments. If you want to throw a non-string object,
1609 or build an error message in an SV yourself, it is preferable to use
1610 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1615 #if defined(PERL_IMPLICIT_CONTEXT)
1617 Perl_croak_nocontext(const char *pat, ...)
1621 va_start(args, pat);
1626 #endif /* PERL_IMPLICIT_CONTEXT */
1629 Perl_croak(pTHX_ const char *pat, ...)
1632 va_start(args, pat);
1639 =for apidoc Am|void|croak_no_modify
1641 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1642 terser object code than using C<Perl_croak>. Less code used on exception code
1643 paths reduces CPU cache pressure.
1649 Perl_croak_no_modify(pTHX)
1651 Perl_croak(aTHX_ "%s", PL_no_modify);
1655 =for apidoc Am|void|warn_sv|SV *baseex
1657 This is an XS interface to Perl's C<warn> function.
1659 C<baseex> is the error message or object. If it is a reference, it
1660 will be used as-is. Otherwise it is used as a string, and if it does
1661 not end with a newline then it will be extended with some indication of
1662 the current location in the code, as described for L</mess_sv>.
1664 The error message or object will by default be written to standard error,
1665 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1667 To warn with a simple string message, the L</warn> function may be
1674 Perl_warn_sv(pTHX_ SV *baseex)
1676 SV *ex = mess_sv(baseex, 0);
1677 PERL_ARGS_ASSERT_WARN_SV;
1678 if (!invoke_exception_hook(ex, TRUE))
1679 write_to_stderr(ex);
1683 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1685 This is an XS interface to Perl's C<warn> function.
1687 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1688 argument list. These are used to generate a string message. If the
1689 message does not end with a newline, then it will be extended with
1690 some indication of the current location in the code, as described for
1693 The error message or object will by default be written to standard error,
1694 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1696 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1702 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1704 SV *ex = vmess(pat, args);
1705 PERL_ARGS_ASSERT_VWARN;
1706 if (!invoke_exception_hook(ex, TRUE))
1707 write_to_stderr(ex);
1711 =for apidoc Am|void|warn|const char *pat|...
1713 This is an XS interface to Perl's C<warn> function.
1715 Take a sprintf-style format pattern and argument list. These are used to
1716 generate a string message. If the message does not end with a newline,
1717 then it will be extended with some indication of the current location
1718 in the code, as described for L</mess_sv>.
1720 The error message or object will by default be written to standard error,
1721 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1723 Unlike with L</croak>, C<pat> is not permitted to be null.
1728 #if defined(PERL_IMPLICIT_CONTEXT)
1730 Perl_warn_nocontext(const char *pat, ...)
1734 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1735 va_start(args, pat);
1739 #endif /* PERL_IMPLICIT_CONTEXT */
1742 Perl_warn(pTHX_ const char *pat, ...)
1745 PERL_ARGS_ASSERT_WARN;
1746 va_start(args, pat);
1751 #if defined(PERL_IMPLICIT_CONTEXT)
1753 Perl_warner_nocontext(U32 err, const char *pat, ...)
1757 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1758 va_start(args, pat);
1759 vwarner(err, pat, &args);
1762 #endif /* PERL_IMPLICIT_CONTEXT */
1765 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1767 PERL_ARGS_ASSERT_CK_WARNER_D;
1769 if (Perl_ckwarn_d(aTHX_ err)) {
1771 va_start(args, pat);
1772 vwarner(err, pat, &args);
1778 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1780 PERL_ARGS_ASSERT_CK_WARNER;
1782 if (Perl_ckwarn(aTHX_ err)) {
1784 va_start(args, pat);
1785 vwarner(err, pat, &args);
1791 Perl_warner(pTHX_ U32 err, const char* pat,...)
1794 PERL_ARGS_ASSERT_WARNER;
1795 va_start(args, pat);
1796 vwarner(err, pat, &args);
1801 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1804 PERL_ARGS_ASSERT_VWARNER;
1805 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1806 SV * const msv = vmess(pat, args);
1808 invoke_exception_hook(msv, FALSE);
1812 Perl_vwarn(aTHX_ pat, args);
1816 /* implements the ckWARN? macros */
1819 Perl_ckwarn(pTHX_ U32 w)
1822 /* If lexical warnings have not been set, use $^W. */
1824 return PL_dowarn & G_WARN_ON;
1826 return ckwarn_common(w);
1829 /* implements the ckWARN?_d macro */
1832 Perl_ckwarn_d(pTHX_ U32 w)
1835 /* If lexical warnings have not been set then default classes warn. */
1839 return ckwarn_common(w);
1843 S_ckwarn_common(pTHX_ U32 w)
1845 if (PL_curcop->cop_warnings == pWARN_ALL)
1848 if (PL_curcop->cop_warnings == pWARN_NONE)
1851 /* Check the assumption that at least the first slot is non-zero. */
1852 assert(unpackWARN1(w));
1854 /* Check the assumption that it is valid to stop as soon as a zero slot is
1856 if (!unpackWARN2(w)) {
1857 assert(!unpackWARN3(w));
1858 assert(!unpackWARN4(w));
1859 } else if (!unpackWARN3(w)) {
1860 assert(!unpackWARN4(w));
1863 /* Right, dealt with all the special cases, which are implemented as non-
1864 pointers, so there is a pointer to a real warnings mask. */
1866 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1868 } while (w >>= WARNshift);
1873 /* Set buffer=NULL to get a new one. */
1875 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1877 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1878 PERL_UNUSED_CONTEXT;
1879 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1882 (specialWARN(buffer) ?
1883 PerlMemShared_malloc(len_wanted) :
1884 PerlMemShared_realloc(buffer, len_wanted));
1886 Copy(bits, (buffer + 1), size, char);
1890 /* since we've already done strlen() for both nam and val
1891 * we can use that info to make things faster than
1892 * sprintf(s, "%s=%s", nam, val)
1894 #define my_setenv_format(s, nam, nlen, val, vlen) \
1895 Copy(nam, s, nlen, char); \
1897 Copy(val, s+(nlen+1), vlen, char); \
1898 *(s+(nlen+1+vlen)) = '\0'
1900 #ifdef USE_ENVIRON_ARRAY
1901 /* VMS' my_setenv() is in vms.c */
1902 #if !defined(WIN32) && !defined(NETWARE)
1904 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1908 /* only parent thread can modify process environment */
1909 if (PL_curinterp == aTHX)
1912 #ifndef PERL_USE_SAFE_PUTENV
1913 if (!PL_use_safe_putenv) {
1914 /* most putenv()s leak, so we manipulate environ directly */
1916 register const I32 len = strlen(nam);
1919 /* where does it go? */
1920 for (i = 0; environ[i]; i++) {
1921 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1925 if (environ == PL_origenviron) { /* need we copy environment? */
1931 while (environ[max])
1933 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1934 for (j=0; j<max; j++) { /* copy environment */
1935 const int len = strlen(environ[j]);
1936 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1937 Copy(environ[j], tmpenv[j], len+1, char);
1940 environ = tmpenv; /* tell exec where it is now */
1943 safesysfree(environ[i]);
1944 while (environ[i]) {
1945 environ[i] = environ[i+1];
1950 if (!environ[i]) { /* does not exist yet */
1951 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1952 environ[i+1] = NULL; /* make sure it's null terminated */
1955 safesysfree(environ[i]);
1959 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1960 /* all that work just for this */
1961 my_setenv_format(environ[i], nam, nlen, val, vlen);
1964 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1965 # if defined(HAS_UNSETENV)
1967 (void)unsetenv(nam);
1969 (void)setenv(nam, val, 1);
1971 # else /* ! HAS_UNSETENV */
1972 (void)setenv(nam, val, 1);
1973 # endif /* HAS_UNSETENV */
1975 # if defined(HAS_UNSETENV)
1977 (void)unsetenv(nam);
1979 const int nlen = strlen(nam);
1980 const int vlen = strlen(val);
1981 char * const new_env =
1982 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1983 my_setenv_format(new_env, nam, nlen, val, vlen);
1984 (void)putenv(new_env);
1986 # else /* ! HAS_UNSETENV */
1988 const int nlen = strlen(nam);
1994 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1995 /* all that work just for this */
1996 my_setenv_format(new_env, nam, nlen, val, vlen);
1997 (void)putenv(new_env);
1998 # endif /* HAS_UNSETENV */
1999 # endif /* __CYGWIN__ */
2000 #ifndef PERL_USE_SAFE_PUTENV
2006 #else /* WIN32 || NETWARE */
2009 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2012 register char *envstr;
2013 const int nlen = strlen(nam);
2020 Newx(envstr, nlen+vlen+2, char);
2021 my_setenv_format(envstr, nam, nlen, val, vlen);
2022 (void)PerlEnv_putenv(envstr);
2026 #endif /* WIN32 || NETWARE */
2028 #endif /* !VMS && !EPOC*/
2030 #ifdef UNLINK_ALL_VERSIONS
2032 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2036 PERL_ARGS_ASSERT_UNLNK;
2038 while (PerlLIO_unlink(f) >= 0)
2040 return retries ? 0 : -1;
2044 /* this is a drop-in replacement for bcopy() */
2045 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
2047 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
2049 char * const retval = to;
2051 PERL_ARGS_ASSERT_MY_BCOPY;
2053 if (from - to >= 0) {
2061 *(--to) = *(--from);
2067 /* this is a drop-in replacement for memset() */
2070 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
2072 char * const retval = loc;
2074 PERL_ARGS_ASSERT_MY_MEMSET;
2082 /* this is a drop-in replacement for bzero() */
2083 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2085 Perl_my_bzero(register char *loc, register I32 len)
2087 char * const retval = loc;
2089 PERL_ARGS_ASSERT_MY_BZERO;
2097 /* this is a drop-in replacement for memcmp() */
2098 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2100 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
2102 register const U8 *a = (const U8 *)s1;
2103 register const U8 *b = (const U8 *)s2;
2106 PERL_ARGS_ASSERT_MY_MEMCMP;
2109 if ((tmp = *a++ - *b++))
2114 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2117 /* This vsprintf replacement should generally never get used, since
2118 vsprintf was available in both System V and BSD 2.11. (There may
2119 be some cross-compilation or embedded set-ups where it is needed,
2122 If you encounter a problem in this function, it's probably a symptom
2123 that Configure failed to detect your system's vprintf() function.
2124 See the section on "item vsprintf" in the INSTALL file.
2126 This version may compile on systems with BSD-ish <stdio.h>,
2127 but probably won't on others.
2130 #ifdef USE_CHAR_VSPRINTF
2135 vsprintf(char *dest, const char *pat, void *args)
2139 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2140 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2141 FILE_cnt(&fakebuf) = 32767;
2143 /* These probably won't compile -- If you really need
2144 this, you'll have to figure out some other method. */
2145 fakebuf._ptr = dest;
2146 fakebuf._cnt = 32767;
2151 fakebuf._flag = _IOWRT|_IOSTRG;
2152 _doprnt(pat, args, &fakebuf); /* what a kludge */
2153 #if defined(STDIO_PTR_LVALUE)
2154 *(FILE_ptr(&fakebuf)++) = '\0';
2156 /* PerlIO has probably #defined away fputc, but we want it here. */
2158 # undef fputc /* XXX Should really restore it later */
2160 (void)fputc('\0', &fakebuf);
2162 #ifdef USE_CHAR_VSPRINTF
2165 return 0; /* perl doesn't use return value */
2169 #endif /* HAS_VPRINTF */
2172 #if BYTEORDER != 0x4321
2174 Perl_my_swap(pTHX_ short s)
2176 #if (BYTEORDER & 1) == 0
2179 result = ((s & 255) << 8) + ((s >> 8) & 255);
2187 Perl_my_htonl(pTHX_ long l)
2191 char c[sizeof(long)];
2194 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
2195 #if BYTEORDER == 0x12345678
2198 u.c[0] = (l >> 24) & 255;
2199 u.c[1] = (l >> 16) & 255;
2200 u.c[2] = (l >> 8) & 255;
2204 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2205 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2210 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2211 u.c[o & 0xf] = (l >> s) & 255;
2219 Perl_my_ntohl(pTHX_ long l)
2223 char c[sizeof(long)];
2226 #if BYTEORDER == 0x1234
2227 u.c[0] = (l >> 24) & 255;
2228 u.c[1] = (l >> 16) & 255;
2229 u.c[2] = (l >> 8) & 255;
2233 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2234 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2241 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2242 l |= (u.c[o & 0xf] & 255) << s;
2249 #endif /* BYTEORDER != 0x4321 */
2253 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2254 * If these functions are defined,
2255 * the BYTEORDER is neither 0x1234 nor 0x4321.
2256 * However, this is not assumed.
2260 #define HTOLE(name,type) \
2262 name (register type n) \
2266 char c[sizeof(type)]; \
2269 register U32 s = 0; \
2270 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2271 u.c[i] = (n >> s) & 0xFF; \
2276 #define LETOH(name,type) \
2278 name (register type n) \
2282 char c[sizeof(type)]; \
2285 register U32 s = 0; \
2288 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2289 n |= ((type)(u.c[i] & 0xFF)) << s; \
2295 * Big-endian byte order functions.
2298 #define HTOBE(name,type) \
2300 name (register type n) \
2304 char c[sizeof(type)]; \
2307 register U32 s = 8*(sizeof(u.c)-1); \
2308 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2309 u.c[i] = (n >> s) & 0xFF; \
2314 #define BETOH(name,type) \
2316 name (register type n) \
2320 char c[sizeof(type)]; \
2323 register U32 s = 8*(sizeof(u.c)-1); \
2326 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2327 n |= ((type)(u.c[i] & 0xFF)) << s; \
2333 * If we just can't do it...
2336 #define NOT_AVAIL(name,type) \
2338 name (register type n) \
2340 Perl_croak_nocontext(#name "() not available"); \
2341 return n; /* not reached */ \
2345 #if defined(HAS_HTOVS) && !defined(htovs)
2348 #if defined(HAS_HTOVL) && !defined(htovl)
2351 #if defined(HAS_VTOHS) && !defined(vtohs)
2354 #if defined(HAS_VTOHL) && !defined(vtohl)
2358 #ifdef PERL_NEED_MY_HTOLE16
2360 HTOLE(Perl_my_htole16,U16)
2362 NOT_AVAIL(Perl_my_htole16,U16)
2365 #ifdef PERL_NEED_MY_LETOH16
2367 LETOH(Perl_my_letoh16,U16)
2369 NOT_AVAIL(Perl_my_letoh16,U16)
2372 #ifdef PERL_NEED_MY_HTOBE16
2374 HTOBE(Perl_my_htobe16,U16)
2376 NOT_AVAIL(Perl_my_htobe16,U16)
2379 #ifdef PERL_NEED_MY_BETOH16
2381 BETOH(Perl_my_betoh16,U16)
2383 NOT_AVAIL(Perl_my_betoh16,U16)
2387 #ifdef PERL_NEED_MY_HTOLE32
2389 HTOLE(Perl_my_htole32,U32)
2391 NOT_AVAIL(Perl_my_htole32,U32)
2394 #ifdef PERL_NEED_MY_LETOH32
2396 LETOH(Perl_my_letoh32,U32)
2398 NOT_AVAIL(Perl_my_letoh32,U32)
2401 #ifdef PERL_NEED_MY_HTOBE32
2403 HTOBE(Perl_my_htobe32,U32)
2405 NOT_AVAIL(Perl_my_htobe32,U32)
2408 #ifdef PERL_NEED_MY_BETOH32
2410 BETOH(Perl_my_betoh32,U32)
2412 NOT_AVAIL(Perl_my_betoh32,U32)
2416 #ifdef PERL_NEED_MY_HTOLE64
2418 HTOLE(Perl_my_htole64,U64)
2420 NOT_AVAIL(Perl_my_htole64,U64)
2423 #ifdef PERL_NEED_MY_LETOH64
2425 LETOH(Perl_my_letoh64,U64)
2427 NOT_AVAIL(Perl_my_letoh64,U64)
2430 #ifdef PERL_NEED_MY_HTOBE64
2432 HTOBE(Perl_my_htobe64,U64)
2434 NOT_AVAIL(Perl_my_htobe64,U64)
2437 #ifdef PERL_NEED_MY_BETOH64
2439 BETOH(Perl_my_betoh64,U64)
2441 NOT_AVAIL(Perl_my_betoh64,U64)
2445 #ifdef PERL_NEED_MY_HTOLES
2446 HTOLE(Perl_my_htoles,short)
2448 #ifdef PERL_NEED_MY_LETOHS
2449 LETOH(Perl_my_letohs,short)
2451 #ifdef PERL_NEED_MY_HTOBES
2452 HTOBE(Perl_my_htobes,short)
2454 #ifdef PERL_NEED_MY_BETOHS
2455 BETOH(Perl_my_betohs,short)
2458 #ifdef PERL_NEED_MY_HTOLEI
2459 HTOLE(Perl_my_htolei,int)
2461 #ifdef PERL_NEED_MY_LETOHI
2462 LETOH(Perl_my_letohi,int)
2464 #ifdef PERL_NEED_MY_HTOBEI
2465 HTOBE(Perl_my_htobei,int)
2467 #ifdef PERL_NEED_MY_BETOHI
2468 BETOH(Perl_my_betohi,int)
2471 #ifdef PERL_NEED_MY_HTOLEL
2472 HTOLE(Perl_my_htolel,long)
2474 #ifdef PERL_NEED_MY_LETOHL
2475 LETOH(Perl_my_letohl,long)
2477 #ifdef PERL_NEED_MY_HTOBEL
2478 HTOBE(Perl_my_htobel,long)
2480 #ifdef PERL_NEED_MY_BETOHL
2481 BETOH(Perl_my_betohl,long)
2485 Perl_my_swabn(void *ptr, int n)
2487 register char *s = (char *)ptr;
2488 register char *e = s + (n-1);
2491 PERL_ARGS_ASSERT_MY_SWABN;
2493 for (n /= 2; n > 0; s++, e--, n--) {
2501 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2503 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2506 register I32 This, that;
2512 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2514 PERL_FLUSHALL_FOR_CHILD;
2515 This = (*mode == 'w');
2519 taint_proper("Insecure %s%s", "EXEC");
2521 if (PerlProc_pipe(p) < 0)
2523 /* Try for another pipe pair for error return */
2524 if (PerlProc_pipe(pp) >= 0)
2526 while ((pid = PerlProc_fork()) < 0) {
2527 if (errno != EAGAIN) {
2528 PerlLIO_close(p[This]);
2529 PerlLIO_close(p[that]);
2531 PerlLIO_close(pp[0]);
2532 PerlLIO_close(pp[1]);
2536 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2545 /* Close parent's end of error status pipe (if any) */
2547 PerlLIO_close(pp[0]);
2548 #if defined(HAS_FCNTL) && defined(F_SETFD)
2549 /* Close error pipe automatically if exec works */
2550 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2553 /* Now dup our end of _the_ pipe to right position */
2554 if (p[THIS] != (*mode == 'r')) {
2555 PerlLIO_dup2(p[THIS], *mode == 'r');
2556 PerlLIO_close(p[THIS]);
2557 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2558 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2561 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2562 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2563 /* No automatic close - do it by hand */
2570 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2576 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2582 do_execfree(); /* free any memory malloced by child on fork */
2584 PerlLIO_close(pp[1]);
2585 /* Keep the lower of the two fd numbers */
2586 if (p[that] < p[This]) {
2587 PerlLIO_dup2(p[This], p[that]);
2588 PerlLIO_close(p[This]);
2592 PerlLIO_close(p[that]); /* close child's end of pipe */
2594 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2595 SvUPGRADE(sv,SVt_IV);
2597 PL_forkprocess = pid;
2598 /* If we managed to get status pipe check for exec fail */
2599 if (did_pipes && pid > 0) {
2604 while (n < sizeof(int)) {
2605 n1 = PerlLIO_read(pp[0],
2606 (void*)(((char*)&errkid)+n),
2612 PerlLIO_close(pp[0]);
2614 if (n) { /* Error */
2616 PerlLIO_close(p[This]);
2617 if (n != sizeof(int))
2618 Perl_croak(aTHX_ "panic: kid popen errno read");
2620 pid2 = wait4pid(pid, &status, 0);
2621 } while (pid2 == -1 && errno == EINTR);
2622 errno = errkid; /* Propagate errno from kid */
2627 PerlLIO_close(pp[0]);
2628 return PerlIO_fdopen(p[This], mode);
2630 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2631 return my_syspopen4(aTHX_ NULL, mode, n, args);
2633 Perl_croak(aTHX_ "List form of piped open not implemented");
2634 return (PerlIO *) NULL;
2639 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2640 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2642 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2646 register I32 This, that;
2649 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2653 PERL_ARGS_ASSERT_MY_POPEN;
2655 PERL_FLUSHALL_FOR_CHILD;
2658 return my_syspopen(aTHX_ cmd,mode);
2661 This = (*mode == 'w');
2663 if (doexec && PL_tainting) {
2665 taint_proper("Insecure %s%s", "EXEC");
2667 if (PerlProc_pipe(p) < 0)
2669 if (doexec && PerlProc_pipe(pp) >= 0)
2671 while ((pid = PerlProc_fork()) < 0) {
2672 if (errno != EAGAIN) {
2673 PerlLIO_close(p[This]);
2674 PerlLIO_close(p[that]);
2676 PerlLIO_close(pp[0]);
2677 PerlLIO_close(pp[1]);
2680 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2683 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2694 PerlLIO_close(pp[0]);
2695 #if defined(HAS_FCNTL) && defined(F_SETFD)
2696 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2699 if (p[THIS] != (*mode == 'r')) {
2700 PerlLIO_dup2(p[THIS], *mode == 'r');
2701 PerlLIO_close(p[THIS]);
2702 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2703 PerlLIO_close(p[THAT]);
2706 PerlLIO_close(p[THAT]);
2709 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2716 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2721 /* may or may not use the shell */
2722 do_exec3(cmd, pp[1], did_pipes);
2725 #endif /* defined OS2 */
2727 #ifdef PERLIO_USING_CRLF
2728 /* Since we circumvent IO layers when we manipulate low-level
2729 filedescriptors directly, need to manually switch to the
2730 default, binary, low-level mode; see PerlIOBuf_open(). */
2731 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2734 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2735 SvREADONLY_off(GvSV(tmpgv));
2736 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2737 SvREADONLY_on(GvSV(tmpgv));
2739 #ifdef THREADS_HAVE_PIDS
2740 PL_ppid = (IV)getppid();
2743 #ifdef PERL_USES_PL_PIDSTATUS
2744 hv_clear(PL_pidstatus); /* we have no children */
2750 do_execfree(); /* free any memory malloced by child on vfork */
2752 PerlLIO_close(pp[1]);
2753 if (p[that] < p[This]) {
2754 PerlLIO_dup2(p[This], p[that]);
2755 PerlLIO_close(p[This]);
2759 PerlLIO_close(p[that]);
2761 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2762 SvUPGRADE(sv,SVt_IV);
2764 PL_forkprocess = pid;
2765 if (did_pipes && pid > 0) {
2770 while (n < sizeof(int)) {
2771 n1 = PerlLIO_read(pp[0],
2772 (void*)(((char*)&errkid)+n),
2778 PerlLIO_close(pp[0]);
2780 if (n) { /* Error */
2782 PerlLIO_close(p[This]);
2783 if (n != sizeof(int))
2784 Perl_croak(aTHX_ "panic: kid popen errno read");
2786 pid2 = wait4pid(pid, &status, 0);
2787 } while (pid2 == -1 && errno == EINTR);
2788 errno = errkid; /* Propagate errno from kid */
2793 PerlLIO_close(pp[0]);
2794 return PerlIO_fdopen(p[This], mode);
2797 #if defined(atarist) || defined(EPOC)
2800 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2802 PERL_ARGS_ASSERT_MY_POPEN;
2803 PERL_FLUSHALL_FOR_CHILD;
2804 /* Call system's popen() to get a FILE *, then import it.
2805 used 0 for 2nd parameter to PerlIO_importFILE;
2808 return PerlIO_importFILE(popen(cmd, mode), 0);
2812 FILE *djgpp_popen();
2814 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2816 PERL_FLUSHALL_FOR_CHILD;
2817 /* Call system's popen() to get a FILE *, then import it.
2818 used 0 for 2nd parameter to PerlIO_importFILE;
2821 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2824 #if defined(__LIBCATAMOUNT__)
2826 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2834 #endif /* !DOSISH */
2836 /* this is called in parent before the fork() */
2838 Perl_atfork_lock(void)
2841 #if defined(USE_ITHREADS)
2842 /* locks must be held in locking order (if any) */
2844 MUTEX_LOCK(&PL_malloc_mutex);
2850 /* this is called in both parent and child after the fork() */
2852 Perl_atfork_unlock(void)
2855 #if defined(USE_ITHREADS)
2856 /* locks must be released in same order as in atfork_lock() */
2858 MUTEX_UNLOCK(&PL_malloc_mutex);
2867 #if defined(HAS_FORK)
2869 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2874 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2875 * handlers elsewhere in the code */
2880 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2881 Perl_croak_nocontext("fork() not available");
2883 #endif /* HAS_FORK */
2888 Perl_dump_fds(pTHX_ const char *const s)
2893 PERL_ARGS_ASSERT_DUMP_FDS;
2895 PerlIO_printf(Perl_debug_log,"%s", s);
2896 for (fd = 0; fd < 32; fd++) {
2897 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2898 PerlIO_printf(Perl_debug_log," %d",fd);
2900 PerlIO_printf(Perl_debug_log,"\n");
2903 #endif /* DUMP_FDS */
2907 dup2(int oldfd, int newfd)
2909 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2912 PerlLIO_close(newfd);
2913 return fcntl(oldfd, F_DUPFD, newfd);
2915 #define DUP2_MAX_FDS 256
2916 int fdtmp[DUP2_MAX_FDS];
2922 PerlLIO_close(newfd);
2923 /* good enough for low fd's... */
2924 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2925 if (fdx >= DUP2_MAX_FDS) {
2933 PerlLIO_close(fdtmp[--fdx]);
2940 #ifdef HAS_SIGACTION
2943 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2946 struct sigaction act, oact;
2949 /* only "parent" interpreter can diddle signals */
2950 if (PL_curinterp != aTHX)
2951 return (Sighandler_t) SIG_ERR;
2954 act.sa_handler = (void(*)(int))handler;
2955 sigemptyset(&act.sa_mask);
2958 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2959 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2961 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2962 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2963 act.sa_flags |= SA_NOCLDWAIT;
2965 if (sigaction(signo, &act, &oact) == -1)
2966 return (Sighandler_t) SIG_ERR;
2968 return (Sighandler_t) oact.sa_handler;
2972 Perl_rsignal_state(pTHX_ int signo)
2974 struct sigaction oact;
2975 PERL_UNUSED_CONTEXT;
2977 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2978 return (Sighandler_t) SIG_ERR;
2980 return (Sighandler_t) oact.sa_handler;
2984 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2987 struct sigaction act;
2989 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2992 /* only "parent" interpreter can diddle signals */
2993 if (PL_curinterp != aTHX)
2997 act.sa_handler = (void(*)(int))handler;
2998 sigemptyset(&act.sa_mask);
3001 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
3002 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
3004 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
3005 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
3006 act.sa_flags |= SA_NOCLDWAIT;
3008 return sigaction(signo, &act, save);
3012 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3016 /* only "parent" interpreter can diddle signals */
3017 if (PL_curinterp != aTHX)
3021 return sigaction(signo, save, (struct sigaction *)NULL);
3024 #else /* !HAS_SIGACTION */
3027 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
3029 #if defined(USE_ITHREADS) && !defined(WIN32)
3030 /* only "parent" interpreter can diddle signals */
3031 if (PL_curinterp != aTHX)
3032 return (Sighandler_t) SIG_ERR;
3035 return PerlProc_signal(signo, handler);
3046 Perl_rsignal_state(pTHX_ int signo)
3049 Sighandler_t oldsig;
3051 #if defined(USE_ITHREADS) && !defined(WIN32)
3052 /* only "parent" interpreter can diddle signals */
3053 if (PL_curinterp != aTHX)
3054 return (Sighandler_t) SIG_ERR;
3058 oldsig = PerlProc_signal(signo, sig_trap);
3059 PerlProc_signal(signo, oldsig);
3061 PerlProc_kill(PerlProc_getpid(), signo);
3066 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3068 #if defined(USE_ITHREADS) && !defined(WIN32)
3069 /* only "parent" interpreter can diddle signals */
3070 if (PL_curinterp != aTHX)
3073 *save = PerlProc_signal(signo, handler);
3074 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
3078 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3080 #if defined(USE_ITHREADS) && !defined(WIN32)
3081 /* only "parent" interpreter can diddle signals */
3082 if (PL_curinterp != aTHX)
3085 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
3088 #endif /* !HAS_SIGACTION */
3089 #endif /* !PERL_MICRO */
3091 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
3092 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
3094 Perl_my_pclose(pTHX_ PerlIO *ptr)
3097 Sigsave_t hstat, istat, qstat;
3105 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
3106 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
3108 *svp = &PL_sv_undef;
3110 if (pid == -1) { /* Opened by popen. */
3111 return my_syspclose(ptr);
3114 close_failed = (PerlIO_close(ptr) == EOF);
3117 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
3120 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
3121 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
3122 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
3125 pid2 = wait4pid(pid, &status, 0);
3126 } while (pid2 == -1 && errno == EINTR);
3128 rsignal_restore(SIGHUP, &hstat);
3129 rsignal_restore(SIGINT, &istat);
3130 rsignal_restore(SIGQUIT, &qstat);
3136 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
3139 #if defined(__LIBCATAMOUNT__)
3141 Perl_my_pclose(pTHX_ PerlIO *ptr)
3146 #endif /* !DOSISH */
3148 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
3150 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
3154 PERL_ARGS_ASSERT_WAIT4PID;
3157 #ifdef PERL_USES_PL_PIDSTATUS
3160 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3161 pid, rather than a string form. */
3162 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3163 if (svp && *svp != &PL_sv_undef) {
3164 *statusp = SvIVX(*svp);
3165 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3173 hv_iterinit(PL_pidstatus);
3174 if ((entry = hv_iternext(PL_pidstatus))) {
3175 SV * const sv = hv_iterval(PL_pidstatus,entry);
3177 const char * const spid = hv_iterkey(entry,&len);
3179 assert (len == sizeof(Pid_t));
3180 memcpy((char *)&pid, spid, len);
3181 *statusp = SvIVX(sv);
3182 /* The hash iterator is currently on this entry, so simply
3183 calling hv_delete would trigger the lazy delete, which on
3184 aggregate does more work, beacuse next call to hv_iterinit()
3185 would spot the flag, and have to call the delete routine,
3186 while in the meantime any new entries can't re-use that
3188 hv_iterinit(PL_pidstatus);
3189 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3196 # ifdef HAS_WAITPID_RUNTIME
3197 if (!HAS_WAITPID_RUNTIME)
3200 result = PerlProc_waitpid(pid,statusp,flags);
3203 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3204 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
3207 #ifdef PERL_USES_PL_PIDSTATUS
3208 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3213 Perl_croak(aTHX_ "Can't do waitpid with flags");
3215 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3216 pidgone(result,*statusp);
3222 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3225 if (result < 0 && errno == EINTR) {
3227 errno = EINTR; /* reset in case a signal handler changed $! */
3231 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3233 #ifdef PERL_USES_PL_PIDSTATUS
3235 S_pidgone(pTHX_ Pid_t pid, int status)
3239 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3240 SvUPGRADE(sv,SVt_IV);
3241 SvIV_set(sv, status);
3246 #if defined(atarist) || defined(OS2) || defined(EPOC)
3249 int /* Cannot prototype with I32
3251 my_syspclose(PerlIO *ptr)
3254 Perl_my_pclose(pTHX_ PerlIO *ptr)
3257 /* Needs work for PerlIO ! */
3258 FILE * const f = PerlIO_findFILE(ptr);
3259 const I32 result = pclose(f);
3260 PerlIO_releaseFILE(ptr,f);
3268 Perl_my_pclose(pTHX_ PerlIO *ptr)
3270 /* Needs work for PerlIO ! */
3271 FILE * const f = PerlIO_findFILE(ptr);
3272 I32 result = djgpp_pclose(f);
3273 result = (result << 8) & 0xff00;
3274 PerlIO_releaseFILE(ptr,f);
3279 #define PERL_REPEATCPY_LINEAR 4
3281 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3283 PERL_ARGS_ASSERT_REPEATCPY;
3286 memset(to, *from, count);
3288 register char *p = to;
3289 I32 items, linear, half;
3291 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3292 for (items = 0; items < linear; ++items) {
3293 register const char *q = from;
3295 for (todo = len; todo > 0; todo--)
3300 while (items <= half) {
3301 I32 size = items * len;
3302 memcpy(p, to, size);
3308 memcpy(p, to, (count - items) * len);
3314 Perl_same_dirent(pTHX_ const char *a, const char *b)
3316 char *fa = strrchr(a,'/');
3317 char *fb = strrchr(b,'/');
3320 SV * const tmpsv = sv_newmortal();
3322 PERL_ARGS_ASSERT_SAME_DIRENT;
3335 sv_setpvs(tmpsv, ".");
3337 sv_setpvn(tmpsv, a, fa - a);
3338 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3341 sv_setpvs(tmpsv, ".");
3343 sv_setpvn(tmpsv, b, fb - b);
3344 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3346 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3347 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3349 #endif /* !HAS_RENAME */
3352 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3353 const char *const *const search_ext, I32 flags)
3356 const char *xfound = NULL;
3357 char *xfailed = NULL;
3358 char tmpbuf[MAXPATHLEN];
3363 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3364 # define SEARCH_EXTS ".bat", ".cmd", NULL
3365 # define MAX_EXT_LEN 4
3368 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3369 # define MAX_EXT_LEN 4
3372 # define SEARCH_EXTS ".pl", ".com", NULL
3373 # define MAX_EXT_LEN 4
3375 /* additional extensions to try in each dir if scriptname not found */
3377 static const char *const exts[] = { SEARCH_EXTS };
3378 const char *const *const ext = search_ext ? search_ext : exts;
3379 int extidx = 0, i = 0;
3380 const char *curext = NULL;
3382 PERL_UNUSED_ARG(search_ext);
3383 # define MAX_EXT_LEN 0
3386 PERL_ARGS_ASSERT_FIND_SCRIPT;
3389 * If dosearch is true and if scriptname does not contain path
3390 * delimiters, search the PATH for scriptname.
3392 * If SEARCH_EXTS is also defined, will look for each
3393 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3394 * while searching the PATH.
3396 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3397 * proceeds as follows:
3398 * If DOSISH or VMSISH:
3399 * + look for ./scriptname{,.foo,.bar}
3400 * + search the PATH for scriptname{,.foo,.bar}
3403 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3404 * this will not look in '.' if it's not in the PATH)
3409 # ifdef ALWAYS_DEFTYPES
3410 len = strlen(scriptname);
3411 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3412 int idx = 0, deftypes = 1;
3415 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3418 int idx = 0, deftypes = 1;
3421 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3423 /* The first time through, just add SEARCH_EXTS to whatever we
3424 * already have, so we can check for default file types. */
3426 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3432 if ((strlen(tmpbuf) + strlen(scriptname)
3433 + MAX_EXT_LEN) >= sizeof tmpbuf)
3434 continue; /* don't search dir with too-long name */
3435 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3439 if (strEQ(scriptname, "-"))
3441 if (dosearch) { /* Look in '.' first. */
3442 const char *cur = scriptname;
3444 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3446 if (strEQ(ext[i++],curext)) {
3447 extidx = -1; /* already has an ext */
3452 DEBUG_p(PerlIO_printf(Perl_debug_log,
3453 "Looking for %s\n",cur));
3454 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3455 && !S_ISDIR(PL_statbuf.st_mode)) {
3463 if (cur == scriptname) {
3464 len = strlen(scriptname);
3465 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3467 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3470 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3471 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3476 if (dosearch && !strchr(scriptname, '/')
3478 && !strchr(scriptname, '\\')
3480 && (s = PerlEnv_getenv("PATH")))
3484 bufend = s + strlen(s);
3485 while (s < bufend) {
3486 #if defined(atarist) || defined(DOSISH)
3491 && *s != ';'; len++, s++) {
3492 if (len < sizeof tmpbuf)
3495 if (len < sizeof tmpbuf)
3497 #else /* ! (atarist || DOSISH) */
3498 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3501 #endif /* ! (atarist || DOSISH) */
3504 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3505 continue; /* don't search dir with too-long name */
3507 # if defined(atarist) || defined(DOSISH)
3508 && tmpbuf[len - 1] != '/'
3509 && tmpbuf[len - 1] != '\\'
3512 tmpbuf[len++] = '/';
3513 if (len == 2 && tmpbuf[0] == '.')
3515 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3519 len = strlen(tmpbuf);
3520 if (extidx > 0) /* reset after previous loop */
3524 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3525 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3526 if (S_ISDIR(PL_statbuf.st_mode)) {
3530 } while ( retval < 0 /* not there */
3531 && extidx>=0 && ext[extidx] /* try an extension? */
3532 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3537 if (S_ISREG(PL_statbuf.st_mode)
3538 && cando(S_IRUSR,TRUE,&PL_statbuf)
3539 #if !defined(DOSISH)
3540 && cando(S_IXUSR,TRUE,&PL_statbuf)
3544 xfound = tmpbuf; /* bingo! */
3548 xfailed = savepv(tmpbuf);
3551 if (!xfound && !seen_dot && !xfailed &&
3552 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3553 || S_ISDIR(PL_statbuf.st_mode)))
3555 seen_dot = 1; /* Disable message. */
3557 if (flags & 1) { /* do or die? */
3558 Perl_croak(aTHX_ "Can't %s %s%s%s",
3559 (xfailed ? "execute" : "find"),
3560 (xfailed ? xfailed : scriptname),
3561 (xfailed ? "" : " on PATH"),
3562 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3567 scriptname = xfound;
3569 return (scriptname ? savepv(scriptname) : NULL);
3572 #ifndef PERL_GET_CONTEXT_DEFINED
3575 Perl_get_context(void)
3578 #if defined(USE_ITHREADS)
3579 # ifdef OLD_PTHREADS_API
3581 if (pthread_getspecific(PL_thr_key, &t))
3582 Perl_croak_nocontext("panic: pthread_getspecific");
3585 # ifdef I_MACH_CTHREADS
3586 return (void*)cthread_data(cthread_self());
3588 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3597 Perl_set_context(void *t)
3600 PERL_ARGS_ASSERT_SET_CONTEXT;
3601 #if defined(USE_ITHREADS)
3602 # ifdef I_MACH_CTHREADS
3603 cthread_set_data(cthread_self(), t);
3605 if (pthread_setspecific(PL_thr_key, t))
3606 Perl_croak_nocontext("panic: pthread_setspecific");
3613 #endif /* !PERL_GET_CONTEXT_DEFINED */
3615 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3624 Perl_get_op_names(pTHX)
3626 PERL_UNUSED_CONTEXT;
3627 return (char **)PL_op_name;
3631 Perl_get_op_descs(pTHX)
3633 PERL_UNUSED_CONTEXT;
3634 return (char **)PL_op_desc;
3638 Perl_get_no_modify(pTHX)
3640 PERL_UNUSED_CONTEXT;
3641 return PL_no_modify;
3645 Perl_get_opargs(pTHX)
3647 PERL_UNUSED_CONTEXT;
3648 return (U32 *)PL_opargs;
3652 Perl_get_ppaddr(pTHX)
3655 PERL_UNUSED_CONTEXT;
3656 return (PPADDR_t*)PL_ppaddr;
3659 #ifndef HAS_GETENV_LEN
3661 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3663 char * const env_trans = PerlEnv_getenv(env_elem);
3664 PERL_UNUSED_CONTEXT;
3665 PERL_ARGS_ASSERT_GETENV_LEN;
3667 *len = strlen(env_trans);
3674 Perl_get_vtbl(pTHX_ int vtbl_id)
3676 const MGVTBL* result;
3677 PERL_UNUSED_CONTEXT;
3681 result = &PL_vtbl_sv;
3684 result = &PL_vtbl_env;
3686 case want_vtbl_envelem:
3687 result = &PL_vtbl_envelem;
3690 result = &PL_vtbl_sig;
3692 case want_vtbl_sigelem:
3693 result = &PL_vtbl_sigelem;
3695 case want_vtbl_pack:
3696 result = &PL_vtbl_pack;
3698 case want_vtbl_packelem:
3699 result = &PL_vtbl_packelem;
3701 case want_vtbl_dbline:
3702 result = &PL_vtbl_dbline;
3705 result = &PL_vtbl_isa;
3707 case want_vtbl_isaelem:
3708 result = &PL_vtbl_isaelem;
3710 case want_vtbl_arylen:
3711 result = &PL_vtbl_arylen;
3713 case want_vtbl_mglob:
3714 result = &PL_vtbl_mglob;
3716 case want_vtbl_nkeys:
3717 result = &PL_vtbl_nkeys;
3719 case want_vtbl_taint:
3720 result = &PL_vtbl_taint;
3722 case want_vtbl_substr:
3723 result = &PL_vtbl_substr;
3726 result = &PL_vtbl_vec;
3729 result = &PL_vtbl_pos;
3732 result = &PL_vtbl_bm;
3735 result = &PL_vtbl_fm;
3737 case want_vtbl_uvar:
3738 result = &PL_vtbl_uvar;
3740 case want_vtbl_defelem:
3741 result = &PL_vtbl_defelem;
3743 case want_vtbl_regexp:
3744 result = &PL_vtbl_regexp;
3746 case want_vtbl_regdata:
3747 result = &PL_vtbl_regdata;
3749 case want_vtbl_regdatum:
3750 result = &PL_vtbl_regdatum;
3752 #ifdef USE_LOCALE_COLLATE
3753 case want_vtbl_collxfrm:
3754 result = &PL_vtbl_collxfrm;
3757 case want_vtbl_amagic:
3758 result = &PL_vtbl_amagic;
3760 case want_vtbl_amagicelem:
3761 result = &PL_vtbl_amagicelem;
3763 case want_vtbl_backref:
3764 result = &PL_vtbl_backref;
3766 case want_vtbl_utf8:
3767 result = &PL_vtbl_utf8;
3773 return (MGVTBL*)result;
3777 Perl_my_fflush_all(pTHX)
3779 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3780 return PerlIO_flush(NULL);
3782 # if defined(HAS__FWALK)
3783 extern int fflush(FILE *);
3784 /* undocumented, unprototyped, but very useful BSDism */
3785 extern void _fwalk(int (*)(FILE *));
3789 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3791 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3792 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3794 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3795 open_max = sysconf(_SC_OPEN_MAX);
3798 open_max = FOPEN_MAX;
3801 open_max = OPEN_MAX;
3812 for (i = 0; i < open_max; i++)
3813 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3814 STDIO_STREAM_ARRAY[i]._file < open_max &&
3815 STDIO_STREAM_ARRAY[i]._flag)
3816 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3820 SETERRNO(EBADF,RMS_IFI);
3827 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3829 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3831 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3832 if (ckWARN(WARN_IO)) {
3833 const char * const direction =
3834 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3836 Perl_warner(aTHX_ packWARN(WARN_IO),
3837 "Filehandle %s opened only for %sput",
3840 Perl_warner(aTHX_ packWARN(WARN_IO),
3841 "Filehandle opened only for %sput", direction);
3848 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3850 warn_type = WARN_CLOSED;
3854 warn_type = WARN_UNOPENED;
3857 if (ckWARN(warn_type)) {
3858 const char * const pars =
3859 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3860 const char * const func =
3862 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3863 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3864 op < 0 ? "" : /* handle phoney cases */
3866 const char * const type =
3868 (OP_IS_SOCKET(op) ||
3869 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3870 "socket" : "filehandle");
3871 if (name && *name) {
3872 Perl_warner(aTHX_ packWARN(warn_type),
3873 "%s%s on %s %s %s", func, pars, vile, type, name);
3874 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3876 aTHX_ packWARN(warn_type),
3877 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3882 Perl_warner(aTHX_ packWARN(warn_type),
3883 "%s%s on %s %s", func, pars, vile, type);
3884 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3886 aTHX_ packWARN(warn_type),
3887 "\t(Are you trying to call %s%s on dirhandle?)\n",
3895 /* XXX Add documentation after final interface and behavior is decided */
3896 /* May want to show context for error, so would pass Perl_bslash_c(pTHX_ const char* current, const char* start, const bool output_warning)
3897 U8 source = *current;
3899 May want to add eg, WARN_REGEX
3903 Perl_grok_bslash_c(pTHX_ const char source, const bool output_warning)
3908 if (! isASCII(source)) {
3909 Perl_croak(aTHX_ "Character following \"\\c\" must be ASCII");
3912 result = toCTRL(source);
3913 if (! isCNTRL(result)) {
3914 if (source == '{') {
3915 Perl_croak(aTHX_ "It is proposed that \"\\c{\" no longer be valid. It has historically evaluated to\n \";\". If you disagree with this proposal, send email to perl5-porters@perl.org\nOtherwise, or in the meantime, you can work around this failure by changing\n\"\\c{\" to \";\"");
3917 else if (output_warning) {
3920 if (! isALNUM(result)) {
3921 clearer[i++] = '\\';
3923 clearer[i++] = result;
3924 clearer[i++] = '\0';
3926 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
3927 "\"\\c%c\" more clearly written simply as \"%s\"",
3937 Perl_grok_bslash_o(pTHX_ const char *s,
3940 const char** error_msg,
3941 const bool output_warning)
3944 /* Documentation to be supplied when interface nailed down finally
3945 * This returns FALSE if there is an error which the caller need not recover
3946 * from; , otherwise TRUE. In either case the caller should look at *len
3948 * s points to a string that begins with 'o', and the previous character
3950 * uv points to a UV that will hold the output value, valid only if the
3951 * return from the function is TRUE
3952 * len on success will point to the next character in the string past the
3953 * end of this construct.
3954 * on failure, it will point to the failure
3955 * error_msg is a pointer that will be set to an internal buffer giving an
3956 * error message upon failure (the return is FALSE). Untouched if
3958 * output_warning says whether to output any warning messages, or suppress
3963 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3964 | PERL_SCAN_DISALLOW_PREFIX
3965 /* XXX Until the message is improved in grok_oct, handle errors
3967 | PERL_SCAN_SILENT_ILLDIGIT;
3969 PERL_ARGS_ASSERT_GROK_BSLASH_O;
3976 *len = 1; /* Move past the o */
3977 *error_msg = "Missing braces on \\o{}";
3983 *len = 2; /* Move past the o{ */
3984 *error_msg = "Missing right brace on \\o{";
3988 /* Return past the '}' no matter what is inside the braces */
3989 *len = e - s + 2; /* 2 = 1 for the o + 1 for the '}' */
3991 s++; /* Point to first digit */
3993 numbers_len = e - s;
3994 if (numbers_len == 0) {
3995 *error_msg = "Number with no digits";
3999 *uv = NATIVE_TO_UNI(grok_oct(s, &numbers_len, &flags, NULL));
4000 /* Note that if has non-octal, will ignore everything starting with that up
4003 if (output_warning && numbers_len != (STRLEN) (e - s)) {
4004 Perl_ck_warner(aTHX_ packWARN(WARN_DIGIT),
4005 /* diag_listed_as: Non-octal character '%c'. Resolved as "%s" */
4006 "Non-octal character '%c'. Resolved as \"\\o{%.*s}\"",
4015 /* To workaround core dumps from the uninitialised tm_zone we get the
4016 * system to give us a reasonable struct to copy. This fix means that
4017 * strftime uses the tm_zone and tm_gmtoff values returned by
4018 * localtime(time()). That should give the desired result most of the
4019 * time. But probably not always!
4021 * This does not address tzname aspects of NETaa14816.
4026 # ifndef STRUCT_TM_HASZONE
4027 # define STRUCT_TM_HASZONE
4031 #ifdef STRUCT_TM_HASZONE /* Backward compat */
4032 # ifndef HAS_TM_TM_ZONE
4033 # define HAS_TM_TM_ZONE
4038 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
4040 #ifdef HAS_TM_TM_ZONE
4042 const struct tm* my_tm;
4043 PERL_ARGS_ASSERT_INIT_TM;
4045 my_tm = localtime(&now);
4047 Copy(my_tm, ptm, 1, struct tm);
4049 PERL_ARGS_ASSERT_INIT_TM;
4050 PERL_UNUSED_ARG(ptm);
4055 * mini_mktime - normalise struct tm values without the localtime()
4056 * semantics (and overhead) of mktime().
4059 Perl_mini_mktime(pTHX_ struct tm *ptm)
4063 int month, mday, year, jday;
4064 int odd_cent, odd_year;
4065 PERL_UNUSED_CONTEXT;
4067 PERL_ARGS_ASSERT_MINI_MKTIME;
4069 #define DAYS_PER_YEAR 365
4070 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
4071 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
4072 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
4073 #define SECS_PER_HOUR (60*60)
4074 #define SECS_PER_DAY (24*SECS_PER_HOUR)
4075 /* parentheses deliberately absent on these two, otherwise they don't work */
4076 #define MONTH_TO_DAYS 153/5
4077 #define DAYS_TO_MONTH 5/153
4078 /* offset to bias by March (month 4) 1st between month/mday & year finding */
4079 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
4080 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
4081 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
4084 * Year/day algorithm notes:
4086 * With a suitable offset for numeric value of the month, one can find
4087 * an offset into the year by considering months to have 30.6 (153/5) days,
4088 * using integer arithmetic (i.e., with truncation). To avoid too much
4089 * messing about with leap days, we consider January and February to be
4090 * the 13th and 14th month of the previous year. After that transformation,
4091 * we need the month index we use to be high by 1 from 'normal human' usage,
4092 * so the month index values we use run from 4 through 15.
4094 * Given that, and the rules for the Gregorian calendar (leap years are those
4095 * divisible by 4 unless also divisible by 100, when they must be divisible
4096 * by 400 instead), we can simply calculate the number of days since some
4097 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
4098 * the days we derive from our month index, and adding in the day of the
4099 * month. The value used here is not adjusted for the actual origin which
4100 * it normally would use (1 January A.D. 1), since we're not exposing it.
4101 * We're only building the value so we can turn around and get the
4102 * normalised values for the year, month, day-of-month, and day-of-year.
4104 * For going backward, we need to bias the value we're using so that we find
4105 * the right year value. (Basically, we don't want the contribution of
4106 * March 1st to the number to apply while deriving the year). Having done
4107 * that, we 'count up' the contribution to the year number by accounting for
4108 * full quadracenturies (400-year periods) with their extra leap days, plus
4109 * the contribution from full centuries (to avoid counting in the lost leap
4110 * days), plus the contribution from full quad-years (to count in the normal
4111 * leap days), plus the leftover contribution from any non-leap years.
4112 * At this point, if we were working with an actual leap day, we'll have 0
4113 * days left over. This is also true for March 1st, however. So, we have
4114 * to special-case that result, and (earlier) keep track of the 'odd'
4115 * century and year contributions. If we got 4 extra centuries in a qcent,
4116 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
4117 * Otherwise, we add back in the earlier bias we removed (the 123 from
4118 * figuring in March 1st), find the month index (integer division by 30.6),
4119 * and the remainder is the day-of-month. We then have to convert back to
4120 * 'real' months (including fixing January and February from being 14/15 in
4121 * the previous year to being in the proper year). After that, to get
4122 * tm_yday, we work with the normalised year and get a new yearday value for
4123 * January 1st, which we subtract from the yearday value we had earlier,
4124 * representing the date we've re-built. This is done from January 1
4125 * because tm_yday is 0-origin.
4127 * Since POSIX time routines are only guaranteed to work for times since the
4128 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
4129 * applies Gregorian calendar rules even to dates before the 16th century
4130 * doesn't bother me. Besides, you'd need cultural context for a given
4131 * date to know whether it was Julian or Gregorian calendar, and that's
4132 * outside the scope for this routine. Since we convert back based on the
4133 * same rules we used to build the yearday, you'll only get strange results
4134 * for input which needed normalising, or for the 'odd' century years which
4135 * were leap years in the Julian calander but not in the Gregorian one.
4136 * I can live with that.
4138 * This algorithm also fails to handle years before A.D. 1 gracefully, but
4139 * that's still outside the scope for POSIX time manipulation, so I don't
4143 year = 1900 + ptm->tm_year;
4144 month = ptm->tm_mon;
4145 mday = ptm->tm_mday;
4146 /* allow given yday with no month & mday to dominate the result */
4147 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
4150 jday = 1 + ptm->tm_yday;
4159 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
4160 yearday += month*MONTH_TO_DAYS + mday + jday;
4162 * Note that we don't know when leap-seconds were or will be,
4163 * so we have to trust the user if we get something which looks
4164 * like a sensible leap-second. Wild values for seconds will
4165 * be rationalised, however.
4167 if ((unsigned) ptm->tm_sec <= 60) {
4174 secs += 60 * ptm->tm_min;
4175 secs += SECS_PER_HOUR * ptm->tm_hour;
4177 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
4178 /* got negative remainder, but need positive time */
4179 /* back off an extra day to compensate */
4180 yearday += (secs/SECS_PER_DAY)-1;
4181 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
4184 yearday += (secs/SECS_PER_DAY);
4185 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
4188 else if (secs >= SECS_PER_DAY) {
4189 yearday += (secs/SECS_PER_DAY);
4190 secs %= SECS_PER_DAY;
4192 ptm->tm_hour = secs/SECS_PER_HOUR;
4193 secs %= SECS_PER_HOUR;
4194 ptm->tm_min = secs/60;
4196 ptm->tm_sec += secs;
4197 /* done with time of day effects */
4199 * The algorithm for yearday has (so far) left it high by 428.
4200 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
4201 * bias it by 123 while trying to figure out what year it
4202 * really represents. Even with this tweak, the reverse
4203 * translation fails for years before A.D. 0001.
4204 * It would still fail for Feb 29, but we catch that one below.
4206 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
4207 yearday -= YEAR_ADJUST;
4208 year = (yearday / DAYS_PER_QCENT) * 400;
4209 yearday %= DAYS_PER_QCENT;
4210 odd_cent = yearday / DAYS_PER_CENT;
4211 year += odd_cent * 100;
4212 yearday %= DAYS_PER_CENT;
4213 year += (yearday / DAYS_PER_QYEAR) * 4;
4214 yearday %= DAYS_PER_QYEAR;
4215 odd_year = yearday / DAYS_PER_YEAR;
4217 yearday %= DAYS_PER_YEAR;
4218 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
4223 yearday += YEAR_ADJUST; /* recover March 1st crock */
4224 month = yearday*DAYS_TO_MONTH;
4225 yearday -= month*MONTH_TO_DAYS;
4226 /* recover other leap-year adjustment */
4235 ptm->tm_year = year - 1900;
4237 ptm->tm_mday = yearday;
4238 ptm->tm_mon = month;
4242 ptm->tm_mon = month - 1;
4244 /* re-build yearday based on Jan 1 to get tm_yday */
4246 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
4247 yearday += 14*MONTH_TO_DAYS + 1;
4248 ptm->tm_yday = jday - yearday;
4249 /* fix tm_wday if not overridden by caller */
4250 if ((unsigned)ptm->tm_wday > 6)
4251 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
4255 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)
4263 PERL_ARGS_ASSERT_MY_STRFTIME;
4265 init_tm(&mytm); /* XXX workaround - see init_tm() above */
4268 mytm.tm_hour = hour;
4269 mytm.tm_mday = mday;
4271 mytm.tm_year = year;
4272 mytm.tm_wday = wday;
4273 mytm.tm_yday = yday;
4274 mytm.tm_isdst = isdst;
4276 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
4277 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
4282 #ifdef HAS_TM_TM_GMTOFF
4283 mytm.tm_gmtoff = mytm2.tm_gmtoff;
4285 #ifdef HAS_TM_TM_ZONE
4286 mytm.tm_zone = mytm2.tm_zone;
4291 Newx(buf, buflen, char);
4292 len = strftime(buf, buflen, fmt, &mytm);
4294 ** The following is needed to handle to the situation where
4295 ** tmpbuf overflows. Basically we want to allocate a buffer
4296 ** and try repeatedly. The reason why it is so complicated
4297 ** is that getting a return value of 0 from strftime can indicate
4298 ** one of the following:
4299 ** 1. buffer overflowed,
4300 ** 2. illegal conversion specifier, or
4301 ** 3. the format string specifies nothing to be returned(not
4302 ** an error). This could be because format is an empty string
4303 ** or it specifies %p that yields an empty string in some locale.
4304 ** If there is a better way to make it portable, go ahead by
4307 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4310 /* Possibly buf overflowed - try again with a bigger buf */
4311 const int fmtlen = strlen(fmt);
4312 int bufsize = fmtlen + buflen;
4314 Renew(buf, bufsize, char);
4316 buflen = strftime(buf, bufsize, fmt, &mytm);
4317 if (buflen > 0 && buflen < bufsize)
4319 /* heuristic to prevent out-of-memory errors */
4320 if (bufsize > 100*fmtlen) {
4326 Renew(buf, bufsize, char);
4331 Perl_croak(aTHX_ "panic: no strftime");
4337 #define SV_CWD_RETURN_UNDEF \
4338 sv_setsv(sv, &PL_sv_undef); \
4341 #define SV_CWD_ISDOT(dp) \
4342 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4343 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4346 =head1 Miscellaneous Functions
4348 =for apidoc getcwd_sv
4350 Fill the sv with current working directory
4355 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4356 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4357 * getcwd(3) if available
4358 * Comments from the orignal:
4359 * This is a faster version of getcwd. It's also more dangerous
4360 * because you might chdir out of a directory that you can't chdir
4364 Perl_getcwd_sv(pTHX_ register SV *sv)
4368 #ifndef INCOMPLETE_TAINTS
4372 PERL_ARGS_ASSERT_GETCWD_SV;
4376 char buf[MAXPATHLEN];
4378 /* Some getcwd()s automatically allocate a buffer of the given
4379 * size from the heap if they are given a NULL buffer pointer.
4380 * The problem is that this behaviour is not portable. */
4381 if (getcwd(buf, sizeof(buf) - 1)) {
4386 sv_setsv(sv, &PL_sv_undef);
4394 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4398 SvUPGRADE(sv, SVt_PV);
4400 if (PerlLIO_lstat(".", &statbuf) < 0) {
4401 SV_CWD_RETURN_UNDEF;
4404 orig_cdev = statbuf.st_dev;
4405 orig_cino = statbuf.st_ino;
4415 if (PerlDir_chdir("..") < 0) {
4416 SV_CWD_RETURN_UNDEF;
4418 if (PerlLIO_stat(".", &statbuf) < 0) {
4419 SV_CWD_RETURN_UNDEF;
4422 cdev = statbuf.st_dev;
4423 cino = statbuf.st_ino;
4425 if (odev == cdev && oino == cino) {
4428 if (!(dir = PerlDir_open("."))) {
4429 SV_CWD_RETURN_UNDEF;
4432 while ((dp = PerlDir_read(dir)) != NULL) {
4434 namelen = dp->d_namlen;
4436 namelen = strlen(dp->d_name);
4439 if (SV_CWD_ISDOT(dp)) {
4443 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4444 SV_CWD_RETURN_UNDEF;
4447 tdev = statbuf.st_dev;
4448 tino = statbuf.st_ino;
4449 if (tino == oino && tdev == odev) {
4455 SV_CWD_RETURN_UNDEF;
4458 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4459 SV_CWD_RETURN_UNDEF;
4462 SvGROW(sv, pathlen + namelen + 1);
4466 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4469 /* prepend current directory to the front */
4471 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4472 pathlen += (namelen + 1);
4474 #ifdef VOID_CLOSEDIR
4477 if (PerlDir_close(dir) < 0) {
4478 SV_CWD_RETURN_UNDEF;
4484 SvCUR_set(sv, pathlen);
4488 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4489 SV_CWD_RETURN_UNDEF;
4492 if (PerlLIO_stat(".", &statbuf) < 0) {
4493 SV_CWD_RETURN_UNDEF;
4496 cdev = statbuf.st_dev;
4497 cino = statbuf.st_ino;
4499 if (cdev != orig_cdev || cino != orig_cino) {
4500 Perl_croak(aTHX_ "Unstable directory path, "
4501 "current directory changed unexpectedly");
4512 #define VERSION_MAX 0x7FFFFFFF
4515 =for apidoc prescan_version
4520 Perl_prescan_version(pTHX_ const char *s, bool strict,
4521 const char **errstr,
4522 bool *sqv, int *ssaw_decimal, int *swidth, bool *salpha) {
4523 bool qv = (sqv ? *sqv : FALSE);
4525 int saw_decimal = 0;
4529 PERL_ARGS_ASSERT_PRESCAN_VERSION;
4531 if (qv && isDIGIT(*d))
4532 goto dotted_decimal_version;
4534 if (*d == 'v') { /* explicit v-string */
4539 else { /* degenerate v-string */
4540 /* requires v1.2.3 */
4541 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4544 dotted_decimal_version:
4545 if (strict && d[0] == '0' && isDIGIT(d[1])) {
4546 /* no leading zeros allowed */
4547 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4550 while (isDIGIT(*d)) /* integer part */
4556 d++; /* decimal point */
4561 /* require v1.2.3 */
4562 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4565 goto version_prescan_finish;
4572 while (isDIGIT(*d)) { /* just keep reading */
4574 while (isDIGIT(*d)) {
4576 /* maximum 3 digits between decimal */
4577 if (strict && j > 3) {
4578 BADVERSION(s,errstr,"Invalid version format (maximum 3 digits between decimals)");
4583 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4586 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4591 else if (*d == '.') {
4593 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4598 else if (!isDIGIT(*d)) {
4604 if (strict && i < 2) {
4605 /* requires v1.2.3 */
4606 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4609 } /* end if dotted-decimal */
4611 { /* decimal versions */
4612 /* special strict case for leading '.' or '0' */
4615 BADVERSION(s,errstr,"Invalid version format (0 before decimal required)");
4617 if (*d == '0' && isDIGIT(d[1])) {
4618 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4622 /* consume all of the integer part */
4626 /* look for a fractional part */
4628 /* we found it, so consume it */
4632 else if (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') {
4635 BADVERSION(s,errstr,"Invalid version format (version required)");
4637 /* found just an integer */
4638 goto version_prescan_finish;
4640 else if ( d == s ) {
4641 /* didn't find either integer or period */
4642 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4644 else if (*d == '_') {
4645 /* underscore can't come after integer part */
4647 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4649 else if (isDIGIT(d[1])) {
4650 BADVERSION(s,errstr,"Invalid version format (alpha without decimal)");
4653 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4657 /* anything else after integer part is just invalid data */
4658 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4661 /* scan the fractional part after the decimal point*/
4663 if (!isDIGIT(*d) && (strict || ! (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') )) {
4664 /* strict or lax-but-not-the-end */
4665 BADVERSION(s,errstr,"Invalid version format (fractional part required)");
4668 while (isDIGIT(*d)) {
4670 if (*d == '.' && isDIGIT(d[-1])) {
4672 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4675 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions must begin with 'v')");
4677 d = (char *)s; /* start all over again */
4679 goto dotted_decimal_version;
4683 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4686 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4688 if ( ! isDIGIT(d[1]) ) {
4689 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4697 version_prescan_finish:
4701 if (!isDIGIT(*d) && (! (!*d || *d == ';' || *d == '{' || *d == '}') )) {
4702 /* trailing non-numeric data */
4703 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4711 *ssaw_decimal = saw_decimal;
4718 =for apidoc scan_version
4720 Returns a pointer to the next character after the parsed
4721 version string, as well as upgrading the passed in SV to
4724 Function must be called with an already existing SV like
4727 s = scan_version(s, SV *sv, bool qv);
4729 Performs some preprocessing to the string to ensure that
4730 it has the correct characteristics of a version. Flags the
4731 object if it contains an underscore (which denotes this
4732 is an alpha version). The boolean qv denotes that the version
4733 should be interpreted as if it had multiple decimals, even if
4740 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4745 const char *errstr = NULL;
4746 int saw_decimal = 0;
4750 AV * const av = newAV();
4751 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4753 PERL_ARGS_ASSERT_SCAN_VERSION;
4755 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4757 #ifndef NODEFAULT_SHAREKEYS
4758 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4761 while (isSPACE(*s)) /* leading whitespace is OK */
4764 last = prescan_version(s, FALSE, &errstr, &qv, &saw_decimal, &width, &alpha);
4766 /* "undef" is a special case and not an error */
4767 if ( ! ( *s == 'u' && strEQ(s,"undef")) ) {
4768 Perl_croak(aTHX_ "%s", errstr);
4778 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4780 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4781 if ( !qv && width < 3 )
4782 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4784 while (isDIGIT(*pos))
4786 if (!isALPHA(*pos)) {
4792 /* this is atoi() that delimits on underscores */
4793 const char *end = pos;
4797 /* the following if() will only be true after the decimal
4798 * point of a version originally created with a bare
4799 * floating point number, i.e. not quoted in any way
4801 if ( !qv && s > start && saw_decimal == 1 ) {
4805 rev += (*s - '0') * mult;
4807 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4808 || (PERL_ABS(rev) > VERSION_MAX )) {
4809 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4810 "Integer overflow in version %d",VERSION_MAX);
4821 while (--end >= s) {
4823 rev += (*end - '0') * mult;
4825 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4826 || (PERL_ABS(rev) > VERSION_MAX )) {
4827 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4828 "Integer overflow in version");
4837 /* Append revision */
4838 av_push(av, newSViv(rev));
4843 else if ( *pos == '.' )
4845 else if ( *pos == '_' && isDIGIT(pos[1]) )
4847 else if ( *pos == ',' && isDIGIT(pos[1]) )
4849 else if ( isDIGIT(*pos) )
4856 while ( isDIGIT(*pos) )
4861 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4869 if ( qv ) { /* quoted versions always get at least three terms*/
4870 I32 len = av_len(av);
4871 /* This for loop appears to trigger a compiler bug on OS X, as it
4872 loops infinitely. Yes, len is negative. No, it makes no sense.
4873 Compiler in question is:
4874 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4875 for ( len = 2 - len; len > 0; len-- )
4876 av_push(MUTABLE_AV(sv), newSViv(0));
4880 av_push(av, newSViv(0));
4883 /* need to save off the current version string for later */
4885 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4886 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4887 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4889 else if ( s > start ) {
4890 SV * orig = newSVpvn(start,s-start);
4891 if ( qv && saw_decimal == 1 && *start != 'v' ) {
4892 /* need to insert a v to be consistent */
4893 sv_insert(orig, 0, 0, "v", 1);
4895 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4898 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4899 av_push(av, newSViv(0));
4902 /* And finally, store the AV in the hash */
4903 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4905 /* fix RT#19517 - special case 'undef' as string */
4906 if ( *s == 'u' && strEQ(s,"undef") ) {
4914 =for apidoc new_version
4916 Returns a new version object based on the passed in SV:
4918 SV *sv = new_version(SV *ver);
4920 Does not alter the passed in ver SV. See "upg_version" if you
4921 want to upgrade the SV.
4927 Perl_new_version(pTHX_ SV *ver)
4930 SV * const rv = newSV(0);
4931 PERL_ARGS_ASSERT_NEW_VERSION;
4932 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4935 AV * const av = newAV();
4937 /* This will get reblessed later if a derived class*/
4938 SV * const hv = newSVrv(rv, "version");
4939 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4940 #ifndef NODEFAULT_SHAREKEYS
4941 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4947 /* Begin copying all of the elements */
4948 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4949 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4951 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4952 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4954 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4956 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4957 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4960 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4962 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4963 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4966 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4967 /* This will get reblessed later if a derived class*/
4968 for ( key = 0; key <= av_len(sav); key++ )
4970 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4971 av_push(av, newSViv(rev));
4974 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4979 const MAGIC* const mg = SvVSTRING_mg(ver);
4980 if ( mg ) { /* already a v-string */
4981 const STRLEN len = mg->mg_len;
4982 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4983 sv_setpvn(rv,version,len);
4984 /* this is for consistency with the pure Perl class */
4985 if ( isDIGIT(*version) )
4986 sv_insert(rv, 0, 0, "v", 1);
4991 sv_setsv(rv,ver); /* make a duplicate */
4996 return upg_version(rv, FALSE);
5000 =for apidoc upg_version
5002 In-place upgrade of the supplied SV to a version object.
5004 SV *sv = upg_version(SV *sv, bool qv);
5006 Returns a pointer to the upgraded SV. Set the boolean qv if you want
5007 to force this SV to be interpreted as an "extended" version.
5013 Perl_upg_version(pTHX_ SV *ver, bool qv)
5015 const char *version, *s;
5020 PERL_ARGS_ASSERT_UPG_VERSION;
5022 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
5024 /* may get too much accuracy */
5026 #ifdef USE_LOCALE_NUMERIC
5027 char *loc = setlocale(LC_NUMERIC, "C");
5029 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
5030 #ifdef USE_LOCALE_NUMERIC
5031 setlocale(LC_NUMERIC, loc);
5033 while (tbuf[len-1] == '0' && len > 0) len--;
5034 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
5035 version = savepvn(tbuf, len);
5038 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
5039 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
5043 else /* must be a string or something like a string */
5046 version = savepv(SvPV(ver,len));
5048 # if PERL_VERSION > 5
5049 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
5050 if ( len >= 3 && !instr(version,".") && !instr(version,"_")
5051 && !(*version == 'u' && strEQ(version, "undef"))
5052 && (*version < '0' || *version > '9') ) {
5053 /* may be a v-string */
5054 SV * const nsv = sv_newmortal();
5057 int saw_decimal = 0;
5058 sv_setpvf(nsv,"v%vd",ver);
5059 pos = nver = savepv(SvPV_nolen(nsv));
5061 /* scan the resulting formatted string */
5062 pos++; /* skip the leading 'v' */
5063 while ( *pos == '.' || isDIGIT(*pos) ) {
5069 /* is definitely a v-string */
5070 if ( saw_decimal >= 2 ) {
5079 s = scan_version(version, ver, qv);
5081 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
5082 "Version string '%s' contains invalid data; "
5083 "ignoring: '%s'", version, s);
5091 Validates that the SV contains a valid version object.
5093 bool vverify(SV *vobj);
5095 Note that it only confirms the bare minimum structure (so as not to get
5096 confused by derived classes which may contain additional hash entries):
5100 =item * The SV contains a [reference to a] hash
5102 =item * The hash contains a "version" key
5104 =item * The "version" key has [a reference to] an AV as its value
5112 Perl_vverify(pTHX_ SV *vs)
5116 PERL_ARGS_ASSERT_VVERIFY;
5121 /* see if the appropriate elements exist */
5122 if ( SvTYPE(vs) == SVt_PVHV
5123 && hv_exists(MUTABLE_HV(vs), "version", 7)
5124 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
5125 && SvTYPE(sv) == SVt_PVAV )
5134 Accepts a version object and returns the normalized floating
5135 point representation. Call like:
5139 NOTE: you can pass either the object directly or the SV
5140 contained within the RV.
5146 Perl_vnumify(pTHX_ SV *vs)
5154 PERL_ARGS_ASSERT_VNUMIFY;
5160 Perl_croak(aTHX_ "Invalid version object");
5162 /* see if various flags exist */
5163 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5165 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
5166 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
5171 /* attempt to retrieve the version array */
5172 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
5173 return newSVpvs("0");
5179 return newSVpvs("0");
5182 digit = SvIV(*av_fetch(av, 0, 0));
5183 sv = Perl_newSVpvf(aTHX_ "%d.", (int)PERL_ABS(digit));
5184 for ( i = 1 ; i < len ; i++ )
5186 digit = SvIV(*av_fetch(av, i, 0));
5188 const int denom = (width == 2 ? 10 : 100);
5189 const div_t term = div((int)PERL_ABS(digit),denom);
5190 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
5193 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5199 digit = SvIV(*av_fetch(av, len, 0));
5200 if ( alpha && width == 3 ) /* alpha version */
5202 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5206 sv_catpvs(sv, "000");
5214 Accepts a version object and returns the normalized string
5215 representation. Call like:
5219 NOTE: you can pass either the object directly or the SV
5220 contained within the RV.
5226 Perl_vnormal(pTHX_ SV *vs)
5233 PERL_ARGS_ASSERT_VNORMAL;
5239 Perl_croak(aTHX_ "Invalid version object");
5241 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5243 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
5248 return newSVpvs("");
5250 digit = SvIV(*av_fetch(av, 0, 0));
5251 sv = Perl_newSVpvf(aTHX_ "v%"IVdf, (IV)digit);
5252 for ( i = 1 ; i < len ; i++ ) {
5253 digit = SvIV(*av_fetch(av, i, 0));
5254 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5259 /* handle last digit specially */
5260 digit = SvIV(*av_fetch(av, len, 0));
5262 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
5264 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5267 if ( len <= 2 ) { /* short version, must be at least three */
5268 for ( len = 2 - len; len != 0; len-- )
5275 =for apidoc vstringify
5277 In order to maintain maximum compatibility with earlier versions
5278 of Perl, this function will return either the floating point
5279 notation or the multiple dotted notation, depending on whether
5280 the original version contained 1 or more dots, respectively
5286 Perl_vstringify(pTHX_ SV *vs)
5288 PERL_ARGS_ASSERT_VSTRINGIFY;
5294 Perl_croak(aTHX_ "Invalid version object");
5296 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
5298 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
5302 return &PL_sv_undef;
5305 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
5315 Version object aware cmp. Both operands must already have been
5316 converted into version objects.
5322 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
5325 bool lalpha = FALSE;
5326 bool ralpha = FALSE;
5331 PERL_ARGS_ASSERT_VCMP;
5338 if ( !vverify(lhv) )
5339 Perl_croak(aTHX_ "Invalid version object");
5341 if ( !vverify(rhv) )
5342 Perl_croak(aTHX_ "Invalid version object");
5344 /* get the left hand term */
5345 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
5346 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
5349 /* and the right hand term */
5350 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
5351 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
5359 while ( i <= m && retval == 0 )
5361 left = SvIV(*av_fetch(lav,i,0));
5362 right = SvIV(*av_fetch(rav,i,0));
5370 /* tiebreaker for alpha with identical terms */
5371 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
5373 if ( lalpha && !ralpha )
5377 else if ( ralpha && !lalpha)
5383 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
5387 while ( i <= r && retval == 0 )
5389 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
5390 retval = -1; /* not a match after all */
5396 while ( i <= l && retval == 0 )
5398 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
5399 retval = +1; /* not a match after all */
5407 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
5408 # define EMULATE_SOCKETPAIR_UDP
5411 #ifdef EMULATE_SOCKETPAIR_UDP
5413 S_socketpair_udp (int fd[2]) {
5415 /* Fake a datagram socketpair using UDP to localhost. */
5416 int sockets[2] = {-1, -1};
5417 struct sockaddr_in addresses[2];
5419 Sock_size_t size = sizeof(struct sockaddr_in);
5420 unsigned short port;
5423 memset(&addresses, 0, sizeof(addresses));
5426 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
5427 if (sockets[i] == -1)
5428 goto tidy_up_and_fail;
5430 addresses[i].sin_family = AF_INET;
5431 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5432 addresses[i].sin_port = 0; /* kernel choses port. */
5433 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
5434 sizeof(struct sockaddr_in)) == -1)
5435 goto tidy_up_and_fail;
5438 /* Now have 2 UDP sockets. Find out which port each is connected to, and
5439 for each connect the other socket to it. */
5442 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
5444 goto tidy_up_and_fail;
5445 if (size != sizeof(struct sockaddr_in))
5446 goto abort_tidy_up_and_fail;
5447 /* !1 is 0, !0 is 1 */
5448 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
5449 sizeof(struct sockaddr_in)) == -1)
5450 goto tidy_up_and_fail;
5453 /* Now we have 2 sockets connected to each other. I don't trust some other
5454 process not to have already sent a packet to us (by random) so send
5455 a packet from each to the other. */
5458 /* I'm going to send my own port number. As a short.
5459 (Who knows if someone somewhere has sin_port as a bitfield and needs
5460 this routine. (I'm assuming crays have socketpair)) */
5461 port = addresses[i].sin_port;
5462 got = PerlLIO_write(sockets[i], &port, sizeof(port));
5463 if (got != sizeof(port)) {
5465 goto tidy_up_and_fail;
5466 goto abort_tidy_up_and_fail;
5470 /* Packets sent. I don't trust them to have arrived though.
5471 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
5472 connect to localhost will use a second kernel thread. In 2.6 the
5473 first thread running the connect() returns before the second completes,
5474 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
5475 returns 0. Poor programs have tripped up. One poor program's authors'
5476 had a 50-1 reverse stock split. Not sure how connected these were.)
5477 So I don't trust someone not to have an unpredictable UDP stack.
5481 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5482 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5486 FD_SET((unsigned int)sockets[0], &rset);
5487 FD_SET((unsigned int)sockets[1], &rset);
5489 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5490 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5491 || !FD_ISSET(sockets[1], &rset)) {
5492 /* I hope this is portable and appropriate. */
5494 goto tidy_up_and_fail;
5495 goto abort_tidy_up_and_fail;
5499 /* And the paranoia department even now doesn't trust it to have arrive
5500 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5502 struct sockaddr_in readfrom;
5503 unsigned short buffer[2];
5508 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5509 sizeof(buffer), MSG_DONTWAIT,
5510 (struct sockaddr *) &readfrom, &size);
5512 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5514 (struct sockaddr *) &readfrom, &size);
5518 goto tidy_up_and_fail;
5519 if (got != sizeof(port)
5520 || size != sizeof(struct sockaddr_in)
5521 /* Check other socket sent us its port. */
5522 || buffer[0] != (unsigned short) addresses[!i].sin_port
5523 /* Check kernel says we got the datagram from that socket */
5524 || readfrom.sin_family != addresses[!i].sin_family
5525 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5526 || readfrom.sin_port != addresses[!i].sin_port)
5527 goto abort_tidy_up_and_fail;
5530 /* My caller (my_socketpair) has validated that this is non-NULL */
5533 /* I hereby declare this connection open. May God bless all who cross
5537 abort_tidy_up_and_fail:
5538 errno = ECONNABORTED;
5542 if (sockets[0] != -1)
5543 PerlLIO_close(sockets[0]);
5544 if (sockets[1] != -1)
5545 PerlLIO_close(sockets[1]);
5550 #endif /* EMULATE_SOCKETPAIR_UDP */
5552 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5554 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5555 /* Stevens says that family must be AF_LOCAL, protocol 0.
5556 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5561 struct sockaddr_in listen_addr;
5562 struct sockaddr_in connect_addr;
5567 || family != AF_UNIX
5570 errno = EAFNOSUPPORT;
5578 #ifdef EMULATE_SOCKETPAIR_UDP
5579 if (type == SOCK_DGRAM)
5580 return S_socketpair_udp(fd);
5583 listener = PerlSock_socket(AF_INET, type, 0);
5586 memset(&listen_addr, 0, sizeof(listen_addr));
5587 listen_addr.sin_family = AF_INET;
5588 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5589 listen_addr.sin_port = 0; /* kernel choses port. */
5590 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5591 sizeof(listen_addr)) == -1)
5592 goto tidy_up_and_fail;
5593 if (PerlSock_listen(listener, 1) == -1)
5594 goto tidy_up_and_fail;
5596 connector = PerlSock_socket(AF_INET, type, 0);
5597 if (connector == -1)
5598 goto tidy_up_and_fail;
5599 /* We want to find out the port number to connect to. */
5600 size = sizeof(connect_addr);
5601 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5603 goto tidy_up_and_fail;
5604 if (size != sizeof(connect_addr))
5605 goto abort_tidy_up_and_fail;
5606 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5607 sizeof(connect_addr)) == -1)
5608 goto tidy_up_and_fail;
5610 size = sizeof(listen_addr);
5611 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5614 goto tidy_up_and_fail;
5615 if (size != sizeof(listen_addr))
5616 goto abort_tidy_up_and_fail;
5617 PerlLIO_close(listener);
5618 /* Now check we are talking to ourself by matching port and host on the
5620 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5622 goto tidy_up_and_fail;
5623 if (size != sizeof(connect_addr)
5624 || listen_addr.sin_family != connect_addr.sin_family
5625 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5626 || listen_addr.sin_port != connect_addr.sin_port) {
5627 goto abort_tidy_up_and_fail;
5633 abort_tidy_up_and_fail:
5635 errno = ECONNABORTED; /* This would be the standard thing to do. */
5637 # ifdef ECONNREFUSED
5638 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5640 errno = ETIMEDOUT; /* Desperation time. */
5647 PerlLIO_close(listener);
5648 if (connector != -1)
5649 PerlLIO_close(connector);
5651 PerlLIO_close(acceptor);
5657 /* In any case have a stub so that there's code corresponding
5658 * to the my_socketpair in global.sym. */
5660 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5661 #ifdef HAS_SOCKETPAIR
5662 return socketpair(family, type, protocol, fd);
5671 =for apidoc sv_nosharing
5673 Dummy routine which "shares" an SV when there is no sharing module present.
5674 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5675 Exists to avoid test for a NULL function pointer and because it could
5676 potentially warn under some level of strict-ness.
5682 Perl_sv_nosharing(pTHX_ SV *sv)
5684 PERL_UNUSED_CONTEXT;
5685 PERL_UNUSED_ARG(sv);
5690 =for apidoc sv_destroyable
5692 Dummy routine which reports that object can be destroyed when there is no
5693 sharing module present. It ignores its single SV argument, and returns
5694 'true'. Exists to avoid test for a NULL function pointer and because it
5695 could potentially warn under some level of strict-ness.
5701 Perl_sv_destroyable(pTHX_ SV *sv)
5703 PERL_UNUSED_CONTEXT;
5704 PERL_UNUSED_ARG(sv);
5709 Perl_parse_unicode_opts(pTHX_ const char **popt)
5711 const char *p = *popt;
5714 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5718 opt = (U32) atoi(p);
5721 if (*p && *p != '\n' && *p != '\r')
5722 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5727 case PERL_UNICODE_STDIN:
5728 opt |= PERL_UNICODE_STDIN_FLAG; break;
5729 case PERL_UNICODE_STDOUT:
5730 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5731 case PERL_UNICODE_STDERR:
5732 opt |= PERL_UNICODE_STDERR_FLAG; break;
5733 case PERL_UNICODE_STD:
5734 opt |= PERL_UNICODE_STD_FLAG; break;
5735 case PERL_UNICODE_IN:
5736 opt |= PERL_UNICODE_IN_FLAG; break;
5737 case PERL_UNICODE_OUT:
5738 opt |= PERL_UNICODE_OUT_FLAG; break;
5739 case PERL_UNICODE_INOUT:
5740 opt |= PERL_UNICODE_INOUT_FLAG; break;
5741 case PERL_UNICODE_LOCALE:
5742 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5743 case PERL_UNICODE_ARGV:
5744 opt |= PERL_UNICODE_ARGV_FLAG; break;
5745 case PERL_UNICODE_UTF8CACHEASSERT:
5746 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5748 if (*p != '\n' && *p != '\r')
5750 "Unknown Unicode option letter '%c'", *p);
5756 opt = PERL_UNICODE_DEFAULT_FLAGS;
5758 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5759 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5760 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5772 * This is really just a quick hack which grabs various garbage
5773 * values. It really should be a real hash algorithm which
5774 * spreads the effect of every input bit onto every output bit,
5775 * if someone who knows about such things would bother to write it.
5776 * Might be a good idea to add that function to CORE as well.
5777 * No numbers below come from careful analysis or anything here,
5778 * except they are primes and SEED_C1 > 1E6 to get a full-width
5779 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5780 * probably be bigger too.
5783 # define SEED_C1 1000003
5784 #define SEED_C4 73819
5786 # define SEED_C1 25747
5787 #define SEED_C4 20639
5791 #define SEED_C5 26107
5793 #ifndef PERL_NO_DEV_RANDOM
5798 # include <starlet.h>
5799 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5800 * in 100-ns units, typically incremented ever 10 ms. */
5801 unsigned int when[2];
5803 # ifdef HAS_GETTIMEOFDAY
5804 struct timeval when;
5810 /* This test is an escape hatch, this symbol isn't set by Configure. */
5811 #ifndef PERL_NO_DEV_RANDOM
5812 #ifndef PERL_RANDOM_DEVICE
5813 /* /dev/random isn't used by default because reads from it will block
5814 * if there isn't enough entropy available. You can compile with
5815 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5816 * is enough real entropy to fill the seed. */
5817 # define PERL_RANDOM_DEVICE "/dev/urandom"
5819 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5821 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5830 _ckvmssts(sys$gettim(when));
5831 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5833 # ifdef HAS_GETTIMEOFDAY
5834 PerlProc_gettimeofday(&when,NULL);
5835 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5838 u = (U32)SEED_C1 * when;
5841 u += SEED_C3 * (U32)PerlProc_getpid();
5842 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5843 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5844 u += SEED_C5 * (U32)PTR2UV(&when);
5850 Perl_get_hash_seed(pTHX)
5853 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5859 if (s && isDIGIT(*s))
5860 myseed = (UV)Atoul(s);
5862 #ifdef USE_HASH_SEED_EXPLICIT
5866 /* Compute a random seed */
5867 (void)seedDrand01((Rand_seed_t)seed());
5868 myseed = (UV)(Drand01() * (NV)UV_MAX);
5869 #if RANDBITS < (UVSIZE * 8)
5870 /* Since there are not enough randbits to to reach all
5871 * the bits of a UV, the low bits might need extra
5872 * help. Sum in another random number that will
5873 * fill in the low bits. */
5875 (UV)(Drand01() * (NV)((((UV)1) << ((UVSIZE * 8 - RANDBITS))) - 1));
5876 #endif /* RANDBITS < (UVSIZE * 8) */
5877 if (myseed == 0) { /* Superparanoia. */
5878 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5880 Perl_croak(aTHX_ "Your random numbers are not that random");
5883 PL_rehash_seed_set = TRUE;
5890 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5892 const char * const stashpv = CopSTASHPV(c);
5893 const char * const name = HvNAME_get(hv);
5894 PERL_UNUSED_CONTEXT;
5895 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5897 if (stashpv == name)
5899 if (stashpv && name)
5900 if (strEQ(stashpv, name))
5907 #ifdef PERL_GLOBAL_STRUCT
5909 #define PERL_GLOBAL_STRUCT_INIT
5910 #include "opcode.h" /* the ppaddr and check */
5913 Perl_init_global_struct(pTHX)
5915 struct perl_vars *plvarsp = NULL;
5916 # ifdef PERL_GLOBAL_STRUCT
5917 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5918 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5919 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5920 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5921 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5925 plvarsp = PL_VarsPtr;
5926 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5932 # define PERLVAR(var,type) /**/
5933 # define PERLVARA(var,n,type) /**/
5934 # define PERLVARI(var,type,init) plvarsp->var = init;
5935 # define PERLVARIC(var,type,init) plvarsp->var = init;
5936 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5937 # include "perlvars.h"
5943 # ifdef PERL_GLOBAL_STRUCT
5946 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5947 if (!plvarsp->Gppaddr)
5951 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5952 if (!plvarsp->Gcheck)
5954 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5955 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5957 # ifdef PERL_SET_VARS
5958 PERL_SET_VARS(plvarsp);
5960 # undef PERL_GLOBAL_STRUCT_INIT
5965 #endif /* PERL_GLOBAL_STRUCT */
5967 #ifdef PERL_GLOBAL_STRUCT
5970 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5972 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5973 # ifdef PERL_GLOBAL_STRUCT
5974 # ifdef PERL_UNSET_VARS
5975 PERL_UNSET_VARS(plvarsp);
5977 free(plvarsp->Gppaddr);
5978 free(plvarsp->Gcheck);
5979 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5985 #endif /* PERL_GLOBAL_STRUCT */
5989 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5990 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5991 * given, and you supply your own implementation.
5993 * The default implementation reads a single env var, PERL_MEM_LOG,
5994 * expecting one or more of the following:
5996 * \d+ - fd fd to write to : must be 1st (atoi)
5997 * 'm' - memlog was PERL_MEM_LOG=1
5998 * 's' - svlog was PERL_SV_LOG=1
5999 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
6001 * This makes the logger controllable enough that it can reasonably be
6002 * added to the system perl.
6005 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
6006 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
6008 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
6010 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
6011 * writes to. In the default logger, this is settable at runtime.
6013 #ifndef PERL_MEM_LOG_FD
6014 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
6017 #ifndef PERL_MEM_LOG_NOIMPL
6019 # ifdef DEBUG_LEAKING_SCALARS
6020 # define SV_LOG_SERIAL_FMT " [%lu]"
6021 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
6023 # define SV_LOG_SERIAL_FMT
6024 # define _SV_LOG_SERIAL_ARG(sv)
6028 S_mem_log_common(enum mem_log_type mlt, const UV n,
6029 const UV typesize, const char *type_name, const SV *sv,
6030 Malloc_t oldalloc, Malloc_t newalloc,
6031 const char *filename, const int linenumber,
6032 const char *funcname)
6036 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
6038 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
6041 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
6043 /* We can't use SVs or PerlIO for obvious reasons,
6044 * so we'll use stdio and low-level IO instead. */
6045 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
6047 # ifdef HAS_GETTIMEOFDAY
6048 # define MEM_LOG_TIME_FMT "%10d.%06d: "
6049 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
6051 gettimeofday(&tv, 0);
6053 # define MEM_LOG_TIME_FMT "%10d: "
6054 # define MEM_LOG_TIME_ARG (int)when
6058 /* If there are other OS specific ways of hires time than
6059 * gettimeofday() (see ext/Time-HiRes), the easiest way is
6060 * probably that they would be used to fill in the struct
6064 int fd = atoi(pmlenv);
6066 fd = PERL_MEM_LOG_FD;
6068 if (strchr(pmlenv, 't')) {
6069 len = my_snprintf(buf, sizeof(buf),
6070 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
6071 PerlLIO_write(fd, buf, len);
6075 len = my_snprintf(buf, sizeof(buf),
6076 "alloc: %s:%d:%s: %"IVdf" %"UVuf
6077 " %s = %"IVdf": %"UVxf"\n",
6078 filename, linenumber, funcname, n, typesize,
6079 type_name, n * typesize, PTR2UV(newalloc));
6082 len = my_snprintf(buf, sizeof(buf),
6083 "realloc: %s:%d:%s: %"IVdf" %"UVuf
6084 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
6085 filename, linenumber, funcname, n, typesize,
6086 type_name, n * typesize, PTR2UV(oldalloc),
6090 len = my_snprintf(buf, sizeof(buf),
6091 "free: %s:%d:%s: %"UVxf"\n",
6092 filename, linenumber, funcname,
6097 len = my_snprintf(buf, sizeof(buf),
6098 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
6099 mlt == MLT_NEW_SV ? "new" : "del",
6100 filename, linenumber, funcname,
6101 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
6106 PerlLIO_write(fd, buf, len);
6110 #endif /* !PERL_MEM_LOG_NOIMPL */
6112 #ifndef PERL_MEM_LOG_NOIMPL
6114 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
6115 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
6117 /* this is suboptimal, but bug compatible. User is providing their
6118 own implemenation, but is getting these functions anyway, and they
6119 do nothing. But _NOIMPL users should be able to cope or fix */
6121 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
6122 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
6126 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
6128 const char *filename, const int linenumber,
6129 const char *funcname)
6131 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
6132 NULL, NULL, newalloc,
6133 filename, linenumber, funcname);
6138 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
6139 Malloc_t oldalloc, Malloc_t newalloc,
6140 const char *filename, const int linenumber,
6141 const char *funcname)
6143 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
6144 NULL, oldalloc, newalloc,
6145 filename, linenumber, funcname);
6150 Perl_mem_log_free(Malloc_t oldalloc,
6151 const char *filename, const int linenumber,
6152 const char *funcname)
6154 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
6155 filename, linenumber, funcname);
6160 Perl_mem_log_new_sv(const SV *sv,
6161 const char *filename, const int linenumber,
6162 const char *funcname)
6164 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
6165 filename, linenumber, funcname);
6169 Perl_mem_log_del_sv(const SV *sv,
6170 const char *filename, const int linenumber,
6171 const char *funcname)
6173 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
6174 filename, linenumber, funcname);
6177 #endif /* PERL_MEM_LOG */
6180 =for apidoc my_sprintf
6182 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
6183 the length of the string written to the buffer. Only rare pre-ANSI systems
6184 need the wrapper function - usually this is a direct call to C<sprintf>.
6188 #ifndef SPRINTF_RETURNS_STRLEN
6190 Perl_my_sprintf(char *buffer, const char* pat, ...)
6193 PERL_ARGS_ASSERT_MY_SPRINTF;
6194 va_start(args, pat);
6195 vsprintf(buffer, pat, args);
6197 return strlen(buffer);
6202 =for apidoc my_snprintf
6204 The C library C<snprintf> functionality, if available and
6205 standards-compliant (uses C<vsnprintf>, actually). However, if the
6206 C<vsnprintf> is not available, will unfortunately use the unsafe
6207 C<vsprintf> which can overrun the buffer (there is an overrun check,
6208 but that may be too late). Consider using C<sv_vcatpvf> instead, or
6209 getting C<vsnprintf>.
6214 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
6219 PERL_ARGS_ASSERT_MY_SNPRINTF;
6220 va_start(ap, format);
6221 #ifdef HAS_VSNPRINTF
6222 retval = vsnprintf(buffer, len, format, ap);
6224 retval = vsprintf(buffer, format, ap);
6227 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
6228 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
6229 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
6234 =for apidoc my_vsnprintf
6236 The C library C<vsnprintf> if available and standards-compliant.
6237 However, if if the C<vsnprintf> is not available, will unfortunately
6238 use the unsafe C<vsprintf> which can overrun the buffer (there is an
6239 overrun check, but that may be too late). Consider using
6240 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
6245 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
6252 PERL_ARGS_ASSERT_MY_VSNPRINTF;
6254 Perl_va_copy(ap, apc);
6255 # ifdef HAS_VSNPRINTF
6256 retval = vsnprintf(buffer, len, format, apc);
6258 retval = vsprintf(buffer, format, apc);
6261 # ifdef HAS_VSNPRINTF
6262 retval = vsnprintf(buffer, len, format, ap);
6264 retval = vsprintf(buffer, format, ap);
6266 #endif /* #ifdef NEED_VA_COPY */
6267 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
6268 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
6269 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
6274 Perl_my_clearenv(pTHX)
6277 #if ! defined(PERL_MICRO)
6278 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
6280 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
6281 # if defined(USE_ENVIRON_ARRAY)
6282 # if defined(USE_ITHREADS)
6283 /* only the parent thread can clobber the process environment */
6284 if (PL_curinterp == aTHX)
6285 # endif /* USE_ITHREADS */
6287 # if ! defined(PERL_USE_SAFE_PUTENV)
6288 if ( !PL_use_safe_putenv) {
6290 if (environ == PL_origenviron)
6291 environ = (char**)safesysmalloc(sizeof(char*));
6293 for (i = 0; environ[i]; i++)
6294 (void)safesysfree(environ[i]);
6297 # else /* PERL_USE_SAFE_PUTENV */
6298 # if defined(HAS_CLEARENV)
6300 # elif defined(HAS_UNSETENV)
6301 int bsiz = 80; /* Most envvar names will be shorter than this. */
6302 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
6303 char *buf = (char*)safesysmalloc(bufsiz);
6304 while (*environ != NULL) {
6305 char *e = strchr(*environ, '=');
6306 int l = e ? e - *environ : (int)strlen(*environ);
6308 (void)safesysfree(buf);
6309 bsiz = l + 1; /* + 1 for the \0. */
6310 buf = (char*)safesysmalloc(bufsiz);
6312 memcpy(buf, *environ, l);
6314 (void)unsetenv(buf);
6316 (void)safesysfree(buf);
6317 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
6318 /* Just null environ and accept the leakage. */
6320 # endif /* HAS_CLEARENV || HAS_UNSETENV */
6321 # endif /* ! PERL_USE_SAFE_PUTENV */
6323 # endif /* USE_ENVIRON_ARRAY */
6324 # endif /* PERL_IMPLICIT_SYS || WIN32 */
6325 #endif /* PERL_MICRO */
6328 #ifdef PERL_IMPLICIT_CONTEXT
6330 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
6331 the global PL_my_cxt_index is incremented, and that value is assigned to
6332 that module's static my_cxt_index (who's address is passed as an arg).
6333 Then, for each interpreter this function is called for, it makes sure a
6334 void* slot is available to hang the static data off, by allocating or
6335 extending the interpreter's PL_my_cxt_list array */
6337 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
6339 Perl_my_cxt_init(pTHX_ int *index, size_t size)
6343 PERL_ARGS_ASSERT_MY_CXT_INIT;
6345 /* this module hasn't been allocated an index yet */
6346 #if defined(USE_ITHREADS)
6347 MUTEX_LOCK(&PL_my_ctx_mutex);
6349 *index = PL_my_cxt_index++;
6350 #if defined(USE_ITHREADS)
6351 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6355 /* make sure the array is big enough */
6356 if (PL_my_cxt_size <= *index) {
6357 if (PL_my_cxt_size) {
6358 while (PL_my_cxt_size <= *index)
6359 PL_my_cxt_size *= 2;
6360 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6363 PL_my_cxt_size = 16;
6364 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6367 /* newSV() allocates one more than needed */
6368 p = (void*)SvPVX(newSV(size-1));
6369 PL_my_cxt_list[*index] = p;
6370 Zero(p, size, char);
6374 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6377 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
6382 PERL_ARGS_ASSERT_MY_CXT_INDEX;
6384 for (index = 0; index < PL_my_cxt_index; index++) {
6385 const char *key = PL_my_cxt_keys[index];
6386 /* try direct pointer compare first - there are chances to success,
6387 * and it's much faster.
6389 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
6396 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
6402 PERL_ARGS_ASSERT_MY_CXT_INIT;
6404 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
6406 /* this module hasn't been allocated an index yet */
6407 #if defined(USE_ITHREADS)
6408 MUTEX_LOCK(&PL_my_ctx_mutex);
6410 index = PL_my_cxt_index++;
6411 #if defined(USE_ITHREADS)
6412 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6416 /* make sure the array is big enough */
6417 if (PL_my_cxt_size <= index) {
6418 int old_size = PL_my_cxt_size;
6420 if (PL_my_cxt_size) {
6421 while (PL_my_cxt_size <= index)
6422 PL_my_cxt_size *= 2;
6423 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6424 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6427 PL_my_cxt_size = 16;
6428 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6429 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6431 for (i = old_size; i < PL_my_cxt_size; i++) {
6432 PL_my_cxt_keys[i] = 0;
6433 PL_my_cxt_list[i] = 0;
6436 PL_my_cxt_keys[index] = my_cxt_key;
6437 /* newSV() allocates one more than needed */
6438 p = (void*)SvPVX(newSV(size-1));
6439 PL_my_cxt_list[index] = p;
6440 Zero(p, size, char);
6443 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6444 #endif /* PERL_IMPLICIT_CONTEXT */
6448 Perl_my_strlcat(char *dst, const char *src, Size_t size)
6450 Size_t used, length, copy;
6453 length = strlen(src);
6454 if (size > 0 && used < size - 1) {
6455 copy = (length >= size - used) ? size - used - 1 : length;
6456 memcpy(dst + used, src, copy);
6457 dst[used + copy] = '\0';
6459 return used + length;
6465 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
6467 Size_t length, copy;
6469 length = strlen(src);
6471 copy = (length >= size) ? size - 1 : length;
6472 memcpy(dst, src, copy);
6479 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
6480 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
6481 long _ftol( double ); /* Defined by VC6 C libs. */
6482 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
6486 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
6489 SV * const dbsv = GvSVn(PL_DBsub);
6490 const bool save_taint = PL_tainted;
6492 /* We do not care about using sv to call CV;
6493 * it's for informational purposes only.
6496 PERL_ARGS_ASSERT_GET_DB_SUB;
6500 if (!PERLDB_SUB_NN) {
6501 GV * const gv = CvGV(cv);
6503 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6504 || strEQ(GvNAME(gv), "END")
6505 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6506 !( (SvTYPE(*svp) == SVt_PVGV)
6507 && (GvCV((const GV *)*svp) == cv) )))) {
6508 /* Use GV from the stack as a fallback. */
6509 /* GV is potentially non-unique, or contain different CV. */
6510 SV * const tmp = newRV(MUTABLE_SV(cv));
6511 sv_setsv(dbsv, tmp);
6515 gv_efullname3(dbsv, gv, NULL);
6519 const int type = SvTYPE(dbsv);
6520 if (type < SVt_PVIV && type != SVt_IV)
6521 sv_upgrade(dbsv, SVt_PVIV);
6522 (void)SvIOK_on(dbsv);
6523 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6525 TAINT_IF(save_taint);
6529 Perl_my_dirfd(pTHX_ DIR * dir) {
6531 /* Most dirfd implementations have problems when passed NULL. */
6536 #elif defined(HAS_DIR_DD_FD)
6539 Perl_die(aTHX_ PL_no_func, "dirfd");
6546 Perl_get_re_arg(pTHX_ SV *sv) {
6552 sv = MUTABLE_SV(SvRV(sv));
6553 if (SvTYPE(sv) == SVt_REGEXP)
6554 return (REGEXP*) sv;
6562 * c-indentation-style: bsd
6564 * indent-tabs-mode: t
6567 * ex: set ts=8 sts=4 sw=4 noet: