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
29 #if defined(USE_PERLIO)
30 #include "perliol.h" /* For PerlIOUnix_refcnt */
36 # define SIG_ERR ((Sighandler_t) -1)
44 /* Missing protos on LynxOS */
50 # include <sys/select.h>
54 #ifdef USE_C_BACKTRACE
58 # undef USE_BFD /* BFD is useless in OS X. */
68 # include <execinfo.h>
72 #ifdef PERL_DEBUG_READONLY_COW
73 # include <sys/mman.h>
78 /* NOTE: Do not call the next three routines directly. Use the macros
79 * in handy.h, so that we can easily redefine everything to do tracking of
80 * allocated hunks back to the original New to track down any memory leaks.
81 * XXX This advice seems to be widely ignored :-( --AD August 1996.
84 #if defined (DEBUGGING) || defined(PERL_IMPLICIT_SYS) || defined (PERL_TRACK_MEMPOOL)
85 # define ALWAYS_NEED_THX
88 #if defined(PERL_TRACK_MEMPOOL) && defined(PERL_DEBUG_READONLY_COW)
90 S_maybe_protect_rw(pTHX_ struct perl_memory_debug_header *header)
93 && mprotect(header, header->size, PROT_READ|PROT_WRITE))
94 Perl_warn(aTHX_ "mprotect for COW string %p %lu failed with %d",
95 header, header->size, errno);
99 S_maybe_protect_ro(pTHX_ struct perl_memory_debug_header *header)
102 && mprotect(header, header->size, PROT_READ))
103 Perl_warn(aTHX_ "mprotect RW for COW string %p %lu failed with %d",
104 header, header->size, errno);
106 # define maybe_protect_rw(foo) S_maybe_protect_rw(aTHX_ foo)
107 # define maybe_protect_ro(foo) S_maybe_protect_ro(aTHX_ foo)
109 # define maybe_protect_rw(foo) NOOP
110 # define maybe_protect_ro(foo) NOOP
113 #if defined(PERL_TRACK_MEMPOOL) || defined(PERL_DEBUG_READONLY_COW)
114 /* Use memory_debug_header */
116 # if (defined(PERL_POISON) && defined(PERL_TRACK_MEMPOOL)) \
117 || defined(PERL_DEBUG_READONLY_COW)
118 # define MDH_HAS_SIZE
122 /* paranoid version of system's malloc() */
125 Perl_safesysmalloc(MEM_SIZE size)
127 #ifdef ALWAYS_NEED_THX
131 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
133 if ((SSize_t)size < 0)
134 Perl_croak_nocontext("panic: malloc, size=%"UVuf, (UV) size);
136 if (!size) size = 1; /* malloc(0) is NASTY on our system */
137 #ifdef PERL_DEBUG_READONLY_COW
138 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
139 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
140 perror("mmap failed");
144 ptr = (Malloc_t)PerlMem_malloc(size?size:1);
146 PERL_ALLOC_CHECK(ptr);
149 struct perl_memory_debug_header *const header
150 = (struct perl_memory_debug_header *)ptr;
154 PoisonNew(((char *)ptr), size, char);
157 #ifdef PERL_TRACK_MEMPOOL
158 header->interpreter = aTHX;
159 /* Link us into the list. */
160 header->prev = &PL_memory_debug_header;
161 header->next = PL_memory_debug_header.next;
162 PL_memory_debug_header.next = header;
163 maybe_protect_rw(header->next);
164 header->next->prev = header;
165 maybe_protect_ro(header->next);
166 # ifdef PERL_DEBUG_READONLY_COW
167 header->readonly = 0;
173 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
174 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
178 #ifndef ALWAYS_NEED_THX
190 /* paranoid version of system's realloc() */
193 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
195 #ifdef ALWAYS_NEED_THX
199 #ifdef PERL_DEBUG_READONLY_COW
200 const MEM_SIZE oldsize = where
201 ? ((struct perl_memory_debug_header *)((char *)where - PERL_MEMORY_DEBUG_HEADER_SIZE))->size
204 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
205 Malloc_t PerlMem_realloc();
206 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
214 return safesysmalloc(size);
216 where = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
217 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
219 struct perl_memory_debug_header *const header
220 = (struct perl_memory_debug_header *)where;
222 # ifdef PERL_TRACK_MEMPOOL
223 if (header->interpreter != aTHX) {
224 Perl_croak_nocontext("panic: realloc from wrong pool, %p!=%p",
225 header->interpreter, aTHX);
227 assert(header->next->prev == header);
228 assert(header->prev->next == header);
230 if (header->size > size) {
231 const MEM_SIZE freed_up = header->size - size;
232 char *start_of_freed = ((char *)where) + size;
233 PoisonFree(start_of_freed, freed_up, char);
243 if ((SSize_t)size < 0)
244 Perl_croak_nocontext("panic: realloc, size=%"UVuf, (UV)size);
246 #ifdef PERL_DEBUG_READONLY_COW
247 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
248 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
249 perror("mmap failed");
252 Copy(where,ptr,oldsize < size ? oldsize : size,char);
253 if (munmap(where, oldsize)) {
254 perror("munmap failed");
258 ptr = (Malloc_t)PerlMem_realloc(where,size);
260 PERL_ALLOC_CHECK(ptr);
262 /* MUST do this fixup first, before doing ANYTHING else, as anything else
263 might allocate memory/free/move memory, and until we do the fixup, it
264 may well be chasing (and writing to) free memory. */
266 #ifdef PERL_TRACK_MEMPOOL
267 struct perl_memory_debug_header *const header
268 = (struct perl_memory_debug_header *)ptr;
271 if (header->size < size) {
272 const MEM_SIZE fresh = size - header->size;
273 char *start_of_fresh = ((char *)ptr) + size;
274 PoisonNew(start_of_fresh, fresh, char);
278 maybe_protect_rw(header->next);
279 header->next->prev = header;
280 maybe_protect_ro(header->next);
281 maybe_protect_rw(header->prev);
282 header->prev->next = header;
283 maybe_protect_ro(header->prev);
285 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
288 /* In particular, must do that fixup above before logging anything via
289 *printf(), as it can reallocate memory, which can cause SEGVs. */
291 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
292 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
299 #ifndef ALWAYS_NEED_THX
311 /* safe version of system's free() */
314 Perl_safesysfree(Malloc_t where)
316 #ifdef ALWAYS_NEED_THX
319 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
322 where = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
324 struct perl_memory_debug_header *const header
325 = (struct perl_memory_debug_header *)where;
328 const MEM_SIZE size = header->size;
330 # ifdef PERL_TRACK_MEMPOOL
331 if (header->interpreter != aTHX) {
332 Perl_croak_nocontext("panic: free from wrong pool, %p!=%p",
333 header->interpreter, aTHX);
336 Perl_croak_nocontext("panic: duplicate free");
339 Perl_croak_nocontext("panic: bad free, header->next==NULL");
340 if (header->next->prev != header || header->prev->next != header) {
341 Perl_croak_nocontext("panic: bad free, ->next->prev=%p, "
342 "header=%p, ->prev->next=%p",
343 header->next->prev, header,
346 /* Unlink us from the chain. */
347 maybe_protect_rw(header->next);
348 header->next->prev = header->prev;
349 maybe_protect_ro(header->next);
350 maybe_protect_rw(header->prev);
351 header->prev->next = header->next;
352 maybe_protect_ro(header->prev);
353 maybe_protect_rw(header);
355 PoisonNew(where, size, char);
357 /* Trigger the duplicate free warning. */
360 # ifdef PERL_DEBUG_READONLY_COW
361 if (munmap(where, size)) {
362 perror("munmap failed");
368 #ifndef PERL_DEBUG_READONLY_COW
374 /* safe version of system's calloc() */
377 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
379 #ifdef ALWAYS_NEED_THX
383 #if defined(USE_MDH) || defined(DEBUGGING)
384 MEM_SIZE total_size = 0;
387 /* Even though calloc() for zero bytes is strange, be robust. */
388 if (size && (count <= MEM_SIZE_MAX / size)) {
389 #if defined(USE_MDH) || defined(DEBUGGING)
390 total_size = size * count;
396 if (PERL_MEMORY_DEBUG_HEADER_SIZE <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
397 total_size += PERL_MEMORY_DEBUG_HEADER_SIZE;
402 if ((SSize_t)size < 0 || (SSize_t)count < 0)
403 Perl_croak_nocontext("panic: calloc, size=%"UVuf", count=%"UVuf,
404 (UV)size, (UV)count);
406 #ifdef PERL_DEBUG_READONLY_COW
407 if ((ptr = mmap(0, total_size ? total_size : 1, PROT_READ|PROT_WRITE,
408 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
409 perror("mmap failed");
412 #elif defined(PERL_TRACK_MEMPOOL)
413 /* Have to use malloc() because we've added some space for our tracking
415 /* malloc(0) is non-portable. */
416 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
418 /* Use calloc() because it might save a memset() if the memory is fresh
419 and clean from the OS. */
421 ptr = (Malloc_t)PerlMem_calloc(count, size);
422 else /* calloc(0) is non-portable. */
423 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
425 PERL_ALLOC_CHECK(ptr);
426 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));
430 struct perl_memory_debug_header *const header
431 = (struct perl_memory_debug_header *)ptr;
433 # ifndef PERL_DEBUG_READONLY_COW
434 memset((void*)ptr, 0, total_size);
436 # ifdef PERL_TRACK_MEMPOOL
437 header->interpreter = aTHX;
438 /* Link us into the list. */
439 header->prev = &PL_memory_debug_header;
440 header->next = PL_memory_debug_header.next;
441 PL_memory_debug_header.next = header;
442 maybe_protect_rw(header->next);
443 header->next->prev = header;
444 maybe_protect_ro(header->next);
445 # ifdef PERL_DEBUG_READONLY_COW
446 header->readonly = 0;
450 header->size = total_size;
452 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
458 #ifndef ALWAYS_NEED_THX
467 /* These must be defined when not using Perl's malloc for binary
472 Malloc_t Perl_malloc (MEM_SIZE nbytes)
474 #ifdef PERL_IMPLICIT_SYS
477 return (Malloc_t)PerlMem_malloc(nbytes);
480 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
482 #ifdef PERL_IMPLICIT_SYS
485 return (Malloc_t)PerlMem_calloc(elements, size);
488 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
490 #ifdef PERL_IMPLICIT_SYS
493 return (Malloc_t)PerlMem_realloc(where, nbytes);
496 Free_t Perl_mfree (Malloc_t where)
498 #ifdef PERL_IMPLICIT_SYS
506 /* copy a string up to some (non-backslashed) delimiter, if any */
509 Perl_delimcpy(char *to, const char *toend, const char *from, const char *fromend, int delim, I32 *retlen)
513 PERL_ARGS_ASSERT_DELIMCPY;
515 for (tolen = 0; from < fromend; from++, tolen++) {
517 if (from[1] != delim) {
524 else if (*from == delim)
535 /* return ptr to little string in big string, NULL if not found */
536 /* This routine was donated by Corey Satten. */
539 Perl_instr(const char *big, const char *little)
542 PERL_ARGS_ASSERT_INSTR;
544 /* libc prior to 4.6.27 (late 1994) did not work properly on a NULL
548 return strstr((char*)big, (char*)little);
551 /* same as instr but allow embedded nulls. The end pointers point to 1 beyond
552 * the final character desired to be checked */
555 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
557 PERL_ARGS_ASSERT_NINSTR;
561 const char first = *little;
563 bigend -= lend - little++;
565 while (big <= bigend) {
566 if (*big++ == first) {
567 for (x=big,s=little; s < lend; x++,s++) {
571 return (char*)(big-1);
578 /* reverse of the above--find last substring */
581 Perl_rninstr(const char *big, const char *bigend, const char *little, const char *lend)
584 const I32 first = *little;
585 const char * const littleend = lend;
587 PERL_ARGS_ASSERT_RNINSTR;
589 if (little >= littleend)
590 return (char*)bigend;
592 big = bigend - (littleend - little++);
593 while (big >= bigbeg) {
597 for (x=big+2,s=little; s < littleend; /**/ ) {
606 return (char*)(big+1);
611 /* As a space optimization, we do not compile tables for strings of length
612 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
613 special-cased in fbm_instr().
615 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
618 =head1 Miscellaneous Functions
620 =for apidoc fbm_compile
622 Analyses the string in order to make fast searches on it using fbm_instr()
623 -- the Boyer-Moore algorithm.
629 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
636 PERL_DEB( STRLEN rarest = 0 );
638 PERL_ARGS_ASSERT_FBM_COMPILE;
640 if (isGV_with_GP(sv) || SvROK(sv))
646 if (flags & FBMcf_TAIL) {
647 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
648 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
649 if (mg && mg->mg_len >= 0)
652 if (!SvPOK(sv) || SvNIOKp(sv))
653 s = (U8*)SvPV_force_mutable(sv, len);
654 else s = (U8 *)SvPV_mutable(sv, len);
655 if (len == 0) /* TAIL might be on a zero-length string. */
657 SvUPGRADE(sv, SVt_PVMG);
662 /* "deep magic", the comment used to add. The use of MAGIC itself isn't
663 really. MAGIC was originally added in 79072805bf63abe5 (perl 5.0 alpha 2)
664 to call SvVALID_off() if the scalar was assigned to.
666 The comment itself (and "deeper magic" below) date back to
667 378cc40b38293ffc (perl 2.0). "deep magic" was an annotation on
669 where the magic (presumably) was that the scalar had a BM table hidden
672 As MAGIC is always present on BMs [in Perl 5 :-)], we can use it to store
673 the table instead of the previous (somewhat hacky) approach of co-opting
674 the string buffer and storing it after the string. */
676 assert(!mg_find(sv, PERL_MAGIC_bm));
677 mg = sv_magicext(sv, NULL, PERL_MAGIC_bm, &PL_vtbl_bm, NULL, 0);
681 /* Shorter strings are special-cased in Perl_fbm_instr(), and don't use
683 const U8 mlen = (len>255) ? 255 : (U8)len;
684 const unsigned char *const sb = s + len - mlen; /* first char (maybe) */
687 Newx(table, 256, U8);
688 memset((void*)table, mlen, 256);
689 mg->mg_ptr = (char *)table;
692 s += len - 1; /* last char */
695 if (table[*s] == mlen)
701 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
702 for (i = 0; i < len; i++) {
703 if (PL_freq[s[i]] < frequency) {
704 PERL_DEB( rarest = i );
705 frequency = PL_freq[s[i]];
708 BmUSEFUL(sv) = 100; /* Initial value */
709 if (flags & FBMcf_TAIL)
711 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %"UVuf"\n",
712 s[rarest], (UV)rarest));
715 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
716 /* If SvTAIL is actually due to \Z or \z, this gives false positives
720 =for apidoc fbm_instr
722 Returns the location of the SV in the string delimited by C<big> and
723 C<bigend>. It returns C<NULL> if the string can't be found. The C<sv>
724 does not have to be fbm_compiled, but the search will not be as fast
731 Perl_fbm_instr(pTHX_ unsigned char *big, unsigned char *bigend, SV *littlestr, U32 flags)
735 const unsigned char *little = (const unsigned char *)SvPV_const(littlestr,l);
736 STRLEN littlelen = l;
737 const I32 multiline = flags & FBMrf_MULTILINE;
739 PERL_ARGS_ASSERT_FBM_INSTR;
741 if ((STRLEN)(bigend - big) < littlelen) {
742 if ( SvTAIL(littlestr)
743 && ((STRLEN)(bigend - big) == littlelen - 1)
745 || (*big == *little &&
746 memEQ((char *)big, (char *)little, littlelen - 1))))
751 switch (littlelen) { /* Special cases for 0, 1 and 2 */
753 return (char*)big; /* Cannot be SvTAIL! */
755 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
756 /* Know that bigend != big. */
757 if (bigend[-1] == '\n')
758 return (char *)(bigend - 1);
759 return (char *) bigend;
767 if (SvTAIL(littlestr))
768 return (char *) bigend;
771 if (SvTAIL(littlestr) && !multiline) {
772 if (bigend[-1] == '\n' && bigend[-2] == *little)
773 return (char*)bigend - 2;
774 if (bigend[-1] == *little)
775 return (char*)bigend - 1;
779 /* This should be better than FBM if c1 == c2, and almost
780 as good otherwise: maybe better since we do less indirection.
781 And we save a lot of memory by caching no table. */
782 const unsigned char c1 = little[0];
783 const unsigned char c2 = little[1];
788 while (s <= bigend) {
798 goto check_1char_anchor;
809 goto check_1char_anchor;
812 while (s <= bigend) {
817 goto check_1char_anchor;
826 check_1char_anchor: /* One char and anchor! */
827 if (SvTAIL(littlestr) && (*bigend == *little))
828 return (char *)bigend; /* bigend is already decremented. */
831 break; /* Only lengths 0 1 and 2 have special-case code. */
834 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
835 s = bigend - littlelen;
836 if (s >= big && bigend[-1] == '\n' && *s == *little
837 /* Automatically of length > 2 */
838 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
840 return (char*)s; /* how sweet it is */
843 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
845 return (char*)s + 1; /* how sweet it is */
849 if (!SvVALID(littlestr)) {
850 char * const b = ninstr((char*)big,(char*)bigend,
851 (char*)little, (char*)little + littlelen);
853 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
854 /* Chop \n from littlestr: */
855 s = bigend - littlelen + 1;
857 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
867 if (littlelen > (STRLEN)(bigend - big))
871 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
872 const unsigned char *oldlittle;
876 --littlelen; /* Last char found by table lookup */
879 little += littlelen; /* last char */
882 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
886 if ((tmp = table[*s])) {
887 if ((s += tmp) < bigend)
891 else { /* less expensive than calling strncmp() */
892 unsigned char * const olds = s;
897 if (*--s == *--little)
899 s = olds + 1; /* here we pay the price for failure */
901 if (s < bigend) /* fake up continue to outer loop */
911 && memEQ((char *)(bigend - littlelen),
912 (char *)(oldlittle - littlelen), littlelen) )
913 return (char*)bigend - littlelen;
919 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
921 PERL_ARGS_ASSERT_SCREAMINSTR;
922 PERL_UNUSED_ARG(bigstr);
923 PERL_UNUSED_ARG(littlestr);
924 PERL_UNUSED_ARG(start_shift);
925 PERL_UNUSED_ARG(end_shift);
926 PERL_UNUSED_ARG(old_posp);
927 PERL_UNUSED_ARG(last);
929 /* This function must only ever be called on a scalar with study magic,
930 but those do not happen any more. */
931 Perl_croak(aTHX_ "panic: screaminstr");
932 NORETURN_FUNCTION_END;
938 Returns true if the leading len bytes of the strings s1 and s2 are the same
939 case-insensitively; false otherwise. Uppercase and lowercase ASCII range bytes
940 match themselves and their opposite case counterparts. Non-cased and non-ASCII
941 range bytes match only themselves.
948 Perl_foldEQ(const char *s1, const char *s2, I32 len)
950 const U8 *a = (const U8 *)s1;
951 const U8 *b = (const U8 *)s2;
953 PERL_ARGS_ASSERT_FOLDEQ;
958 if (*a != *b && *a != PL_fold[*b])
965 Perl_foldEQ_latin1(const char *s1, const char *s2, I32 len)
967 /* Compare non-utf8 using Unicode (Latin1) semantics. Does not work on
968 * MICRO_SIGN, LATIN_SMALL_LETTER_SHARP_S, nor
969 * LATIN_SMALL_LETTER_Y_WITH_DIAERESIS, and does not check for these. Nor
970 * does it check that the strings each have at least 'len' characters */
972 const U8 *a = (const U8 *)s1;
973 const U8 *b = (const U8 *)s2;
975 PERL_ARGS_ASSERT_FOLDEQ_LATIN1;
980 if (*a != *b && *a != PL_fold_latin1[*b]) {
989 =for apidoc foldEQ_locale
991 Returns true if the leading len bytes of the strings s1 and s2 are the same
992 case-insensitively in the current locale; false otherwise.
998 Perl_foldEQ_locale(const char *s1, const char *s2, I32 len)
1001 const U8 *a = (const U8 *)s1;
1002 const U8 *b = (const U8 *)s2;
1004 PERL_ARGS_ASSERT_FOLDEQ_LOCALE;
1009 if (*a != *b && *a != PL_fold_locale[*b])
1016 /* copy a string to a safe spot */
1019 =head1 Memory Management
1023 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1024 string which is a duplicate of C<pv>. The size of the string is
1025 determined by C<strlen()>, which means it may not contain embedded C<NUL>
1026 characters and must have a trailing C<NUL>. The memory allocated for the new
1027 string can be freed with the C<Safefree()> function.
1029 On some platforms, Windows for example, all allocated memory owned by a thread
1030 is deallocated when that thread ends. So if you need that not to happen, you
1031 need to use the shared memory functions, such as C<L</savesharedpv>>.
1037 Perl_savepv(pTHX_ const char *pv)
1039 PERL_UNUSED_CONTEXT;
1044 const STRLEN pvlen = strlen(pv)+1;
1045 Newx(newaddr, pvlen, char);
1046 return (char*)memcpy(newaddr, pv, pvlen);
1050 /* same thing but with a known length */
1055 Perl's version of what C<strndup()> would be if it existed. Returns a
1056 pointer to a newly allocated string which is a duplicate of the first
1057 C<len> bytes from C<pv>, plus a trailing
1058 C<NUL> byte. The memory allocated for
1059 the new string can be freed with the C<Safefree()> function.
1061 On some platforms, Windows for example, all allocated memory owned by a thread
1062 is deallocated when that thread ends. So if you need that not to happen, you
1063 need to use the shared memory functions, such as C<L</savesharedpvn>>.
1069 Perl_savepvn(pTHX_ const char *pv, I32 len)
1072 PERL_UNUSED_CONTEXT;
1076 Newx(newaddr,len+1,char);
1077 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1079 /* might not be null terminated */
1080 newaddr[len] = '\0';
1081 return (char *) CopyD(pv,newaddr,len,char);
1084 return (char *) ZeroD(newaddr,len+1,char);
1089 =for apidoc savesharedpv
1091 A version of C<savepv()> which allocates the duplicate string in memory
1092 which is shared between threads.
1097 Perl_savesharedpv(pTHX_ const char *pv)
1102 PERL_UNUSED_CONTEXT;
1107 pvlen = strlen(pv)+1;
1108 newaddr = (char*)PerlMemShared_malloc(pvlen);
1112 return (char*)memcpy(newaddr, pv, pvlen);
1116 =for apidoc savesharedpvn
1118 A version of C<savepvn()> which allocates the duplicate string in memory
1119 which is shared between threads. (With the specific difference that a NULL
1120 pointer is not acceptable)
1125 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1127 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1129 PERL_UNUSED_CONTEXT;
1130 /* PERL_ARGS_ASSERT_SAVESHAREDPVN; */
1135 newaddr[len] = '\0';
1136 return (char*)memcpy(newaddr, pv, len);
1140 =for apidoc savesvpv
1142 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1143 the passed in SV using C<SvPV()>
1145 On some platforms, Windows for example, all allocated memory owned by a thread
1146 is deallocated when that thread ends. So if you need that not to happen, you
1147 need to use the shared memory functions, such as C<L</savesharedsvpv>>.
1153 Perl_savesvpv(pTHX_ SV *sv)
1156 const char * const pv = SvPV_const(sv, len);
1159 PERL_ARGS_ASSERT_SAVESVPV;
1162 Newx(newaddr,len,char);
1163 return (char *) CopyD(pv,newaddr,len,char);
1167 =for apidoc savesharedsvpv
1169 A version of C<savesharedpv()> which allocates the duplicate string in
1170 memory which is shared between threads.
1176 Perl_savesharedsvpv(pTHX_ SV *sv)
1179 const char * const pv = SvPV_const(sv, len);
1181 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1183 return savesharedpvn(pv, len);
1186 /* the SV for Perl_form() and mess() is not kept in an arena */
1194 if (PL_phase != PERL_PHASE_DESTRUCT)
1195 return newSVpvs_flags("", SVs_TEMP);
1200 /* Create as PVMG now, to avoid any upgrading later */
1202 Newxz(any, 1, XPVMG);
1203 SvFLAGS(sv) = SVt_PVMG;
1204 SvANY(sv) = (void*)any;
1206 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1211 #if defined(PERL_IMPLICIT_CONTEXT)
1213 Perl_form_nocontext(const char* pat, ...)
1218 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1219 va_start(args, pat);
1220 retval = vform(pat, &args);
1224 #endif /* PERL_IMPLICIT_CONTEXT */
1227 =head1 Miscellaneous Functions
1230 Takes a sprintf-style format pattern and conventional
1231 (non-SV) arguments and returns the formatted string.
1233 (char *) Perl_form(pTHX_ const char* pat, ...)
1235 can be used any place a string (char *) is required:
1237 char * s = Perl_form("%d.%d",major,minor);
1239 Uses a single private buffer so if you want to format several strings you
1240 must explicitly copy the earlier strings away (and free the copies when you
1247 Perl_form(pTHX_ const char* pat, ...)
1251 PERL_ARGS_ASSERT_FORM;
1252 va_start(args, pat);
1253 retval = vform(pat, &args);
1259 Perl_vform(pTHX_ const char *pat, va_list *args)
1261 SV * const sv = mess_alloc();
1262 PERL_ARGS_ASSERT_VFORM;
1263 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1268 =for apidoc Am|SV *|mess|const char *pat|...
1270 Take a sprintf-style format pattern and argument list. These are used to
1271 generate a string message. If the message does not end with a newline,
1272 then it will be extended with some indication of the current location
1273 in the code, as described for L</mess_sv>.
1275 Normally, the resulting message is returned in a new mortal SV.
1276 During global destruction a single SV may be shared between uses of
1282 #if defined(PERL_IMPLICIT_CONTEXT)
1284 Perl_mess_nocontext(const char *pat, ...)
1289 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1290 va_start(args, pat);
1291 retval = vmess(pat, &args);
1295 #endif /* PERL_IMPLICIT_CONTEXT */
1298 Perl_mess(pTHX_ const char *pat, ...)
1302 PERL_ARGS_ASSERT_MESS;
1303 va_start(args, pat);
1304 retval = vmess(pat, &args);
1310 Perl_closest_cop(pTHX_ const COP *cop, const OP *o, const OP *curop,
1313 /* Look for curop starting from o. cop is the last COP we've seen. */
1314 /* opnext means that curop is actually the ->op_next of the op we are
1317 PERL_ARGS_ASSERT_CLOSEST_COP;
1319 if (!o || !curop || (
1320 opnext ? o->op_next == curop && o->op_type != OP_SCOPE : o == curop
1324 if (o->op_flags & OPf_KIDS) {
1326 for (kid = cUNOPo->op_first; kid; kid = OP_SIBLING(kid)) {
1329 /* If the OP_NEXTSTATE has been optimised away we can still use it
1330 * the get the file and line number. */
1332 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1333 cop = (const COP *)kid;
1335 /* Keep searching, and return when we've found something. */
1337 new_cop = closest_cop(cop, kid, curop, opnext);
1343 /* Nothing found. */
1349 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1351 Expands a message, intended for the user, to include an indication of
1352 the current location in the code, if the message does not already appear
1355 C<basemsg> is the initial message or object. If it is a reference, it
1356 will be used as-is and will be the result of this function. Otherwise it
1357 is used as a string, and if it already ends with a newline, it is taken
1358 to be complete, and the result of this function will be the same string.
1359 If the message does not end with a newline, then a segment such as C<at
1360 foo.pl line 37> will be appended, and possibly other clauses indicating
1361 the current state of execution. The resulting message will end with a
1364 Normally, the resulting message is returned in a new mortal SV.
1365 During global destruction a single SV may be shared between uses of this
1366 function. If C<consume> is true, then the function is permitted (but not
1367 required) to modify and return C<basemsg> instead of allocating a new SV.
1373 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1377 #if defined(USE_C_BACKTRACE) && defined(USE_C_BACKTRACE_ON_ERROR)
1381 /* The PERL_C_BACKTRACE_ON_WARN must be an integer of one or more. */
1382 if ((ws = PerlEnv_getenv("PERL_C_BACKTRACE_ON_ERROR")) &&
1383 (wi = atoi(ws)) > 0) {
1384 Perl_dump_c_backtrace(aTHX_ Perl_debug_log, wi, 1);
1389 PERL_ARGS_ASSERT_MESS_SV;
1391 if (SvROK(basemsg)) {
1397 sv_setsv(sv, basemsg);
1402 if (SvPOK(basemsg) && consume) {
1407 sv_copypv(sv, basemsg);
1410 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1412 * Try and find the file and line for PL_op. This will usually be
1413 * PL_curcop, but it might be a cop that has been optimised away. We
1414 * can try to find such a cop by searching through the optree starting
1415 * from the sibling of PL_curcop.
1419 closest_cop(PL_curcop, OP_SIBLING(PL_curcop), PL_op, FALSE);
1424 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1425 OutCopFILE(cop), (IV)CopLINE(cop));
1426 /* Seems that GvIO() can be untrustworthy during global destruction. */
1427 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1428 && IoLINES(GvIOp(PL_last_in_gv)))
1431 const bool line_mode = (RsSIMPLE(PL_rs) &&
1432 *SvPV_const(PL_rs,l) == '\n' && l == 1);
1433 Perl_sv_catpvf(aTHX_ sv, ", <%"SVf"> %s %"IVdf,
1434 SVfARG(PL_last_in_gv == PL_argvgv
1436 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1437 line_mode ? "line" : "chunk",
1438 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1440 if (PL_phase == PERL_PHASE_DESTRUCT)
1441 sv_catpvs(sv, " during global destruction");
1442 sv_catpvs(sv, ".\n");
1448 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1450 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1451 argument list. These are used to generate a string message. If the
1452 message does not end with a newline, then it will be extended with
1453 some indication of the current location in the code, as described for
1456 Normally, the resulting message is returned in a new mortal SV.
1457 During global destruction a single SV may be shared between uses of
1464 Perl_vmess(pTHX_ const char *pat, va_list *args)
1466 SV * const sv = mess_alloc();
1468 PERL_ARGS_ASSERT_VMESS;
1470 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1471 return mess_sv(sv, 1);
1475 Perl_write_to_stderr(pTHX_ SV* msv)
1480 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1482 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1483 && (io = GvIO(PL_stderrgv))
1484 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1485 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, SV_CONST(PRINT),
1486 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1488 PerlIO * const serr = Perl_error_log;
1490 do_print(msv, serr);
1491 (void)PerlIO_flush(serr);
1496 =head1 Warning and Dieing
1499 /* Common code used in dieing and warning */
1502 S_with_queued_errors(pTHX_ SV *ex)
1504 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1505 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1506 sv_catsv(PL_errors, ex);
1507 ex = sv_mortalcopy(PL_errors);
1508 SvCUR_set(PL_errors, 0);
1514 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1519 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1520 /* sv_2cv might call Perl_croak() or Perl_warner() */
1521 SV * const oldhook = *hook;
1529 cv = sv_2cv(oldhook, &stash, &gv, 0);
1531 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1541 exarg = newSVsv(ex);
1542 SvREADONLY_on(exarg);
1545 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1549 call_sv(MUTABLE_SV(cv), G_DISCARD);
1558 =for apidoc Am|OP *|die_sv|SV *baseex
1560 Behaves the same as L</croak_sv>, except for the return type.
1561 It should be used only where the C<OP *> return type is required.
1562 The function never actually returns.
1568 Perl_die_sv(pTHX_ SV *baseex)
1570 PERL_ARGS_ASSERT_DIE_SV;
1572 assert(0); /* NOTREACHED */
1573 NORETURN_FUNCTION_END;
1577 =for apidoc Am|OP *|die|const char *pat|...
1579 Behaves the same as L</croak>, except for the return type.
1580 It should be used only where the C<OP *> return type is required.
1581 The function never actually returns.
1586 #if defined(PERL_IMPLICIT_CONTEXT)
1588 Perl_die_nocontext(const char* pat, ...)
1592 va_start(args, pat);
1594 assert(0); /* NOTREACHED */
1596 NORETURN_FUNCTION_END;
1598 #endif /* PERL_IMPLICIT_CONTEXT */
1601 Perl_die(pTHX_ const char* pat, ...)
1604 va_start(args, pat);
1606 assert(0); /* NOTREACHED */
1608 NORETURN_FUNCTION_END;
1612 =for apidoc Am|void|croak_sv|SV *baseex
1614 This is an XS interface to Perl's C<die> function.
1616 C<baseex> is the error message or object. If it is a reference, it
1617 will be used as-is. Otherwise it is used as a string, and if it does
1618 not end with a newline then it will be extended with some indication of
1619 the current location in the code, as described for L</mess_sv>.
1621 The error message or object will be used as an exception, by default
1622 returning control to the nearest enclosing C<eval>, but subject to
1623 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1624 function never returns normally.
1626 To die with a simple string message, the L</croak> function may be
1633 Perl_croak_sv(pTHX_ SV *baseex)
1635 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1636 PERL_ARGS_ASSERT_CROAK_SV;
1637 invoke_exception_hook(ex, FALSE);
1642 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1644 This is an XS interface to Perl's C<die> function.
1646 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1647 argument list. These are used to generate a string message. If the
1648 message does not end with a newline, then it will be extended with
1649 some indication of the current location in the code, as described for
1652 The error message will be used as an exception, by default
1653 returning control to the nearest enclosing C<eval>, but subject to
1654 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1655 function never returns normally.
1657 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1658 (C<$@>) will be used as an error message or object instead of building an
1659 error message from arguments. If you want to throw a non-string object,
1660 or build an error message in an SV yourself, it is preferable to use
1661 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1667 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1669 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1670 invoke_exception_hook(ex, FALSE);
1675 =for apidoc Am|void|croak|const char *pat|...
1677 This is an XS interface to Perl's C<die> function.
1679 Take a sprintf-style format pattern and argument list. These are used to
1680 generate a string message. If the message does not end with a newline,
1681 then it will be extended with some indication of the current location
1682 in the code, as described for L</mess_sv>.
1684 The error message will be used as an exception, by default
1685 returning control to the nearest enclosing C<eval>, but subject to
1686 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1687 function never returns normally.
1689 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1690 (C<$@>) will be used as an error message or object instead of building an
1691 error message from arguments. If you want to throw a non-string object,
1692 or build an error message in an SV yourself, it is preferable to use
1693 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1698 #if defined(PERL_IMPLICIT_CONTEXT)
1700 Perl_croak_nocontext(const char *pat, ...)
1704 va_start(args, pat);
1706 assert(0); /* NOTREACHED */
1709 #endif /* PERL_IMPLICIT_CONTEXT */
1712 Perl_croak(pTHX_ const char *pat, ...)
1715 va_start(args, pat);
1717 assert(0); /* NOTREACHED */
1722 =for apidoc Am|void|croak_no_modify
1724 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1725 terser object code than using C<Perl_croak>. Less code used on exception code
1726 paths reduces CPU cache pressure.
1732 Perl_croak_no_modify(void)
1734 Perl_croak_nocontext( "%s", PL_no_modify);
1737 /* does not return, used in util.c perlio.c and win32.c
1738 This is typically called when malloc returns NULL.
1741 Perl_croak_no_mem(void)
1745 int fd = PerlIO_fileno(Perl_error_log);
1747 SETERRNO(EBADF,RMS_IFI);
1749 /* Can't use PerlIO to write as it allocates memory */
1750 PERL_UNUSED_RESULT(PerlLIO_write(fd, PL_no_mem, sizeof(PL_no_mem)-1));
1755 /* does not return, used only in POPSTACK */
1757 Perl_croak_popstack(void)
1760 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");
1765 =for apidoc Am|void|warn_sv|SV *baseex
1767 This is an XS interface to Perl's C<warn> function.
1769 C<baseex> is the error message or object. If it is a reference, it
1770 will be used as-is. Otherwise it is used as a string, and if it does
1771 not end with a newline then it will be extended with some indication of
1772 the current location in the code, as described for L</mess_sv>.
1774 The error message or object will by default be written to standard error,
1775 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1777 To warn with a simple string message, the L</warn> function may be
1784 Perl_warn_sv(pTHX_ SV *baseex)
1786 SV *ex = mess_sv(baseex, 0);
1787 PERL_ARGS_ASSERT_WARN_SV;
1788 if (!invoke_exception_hook(ex, TRUE))
1789 write_to_stderr(ex);
1793 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1795 This is an XS interface to Perl's C<warn> function.
1797 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1798 argument list. These are used to generate a string message. If the
1799 message does not end with a newline, then it will be extended with
1800 some indication of the current location in the code, as described for
1803 The error message or object will by default be written to standard error,
1804 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1806 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1812 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1814 SV *ex = vmess(pat, args);
1815 PERL_ARGS_ASSERT_VWARN;
1816 if (!invoke_exception_hook(ex, TRUE))
1817 write_to_stderr(ex);
1821 =for apidoc Am|void|warn|const char *pat|...
1823 This is an XS interface to Perl's C<warn> function.
1825 Take a sprintf-style format pattern and argument list. These are used to
1826 generate a string message. If the message does not end with a newline,
1827 then it will be extended with some indication of the current location
1828 in the code, as described for L</mess_sv>.
1830 The error message or object will by default be written to standard error,
1831 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1833 Unlike with L</croak>, C<pat> is not permitted to be null.
1838 #if defined(PERL_IMPLICIT_CONTEXT)
1840 Perl_warn_nocontext(const char *pat, ...)
1844 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1845 va_start(args, pat);
1849 #endif /* PERL_IMPLICIT_CONTEXT */
1852 Perl_warn(pTHX_ const char *pat, ...)
1855 PERL_ARGS_ASSERT_WARN;
1856 va_start(args, pat);
1861 #if defined(PERL_IMPLICIT_CONTEXT)
1863 Perl_warner_nocontext(U32 err, const char *pat, ...)
1867 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1868 va_start(args, pat);
1869 vwarner(err, pat, &args);
1872 #endif /* PERL_IMPLICIT_CONTEXT */
1875 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1877 PERL_ARGS_ASSERT_CK_WARNER_D;
1879 if (Perl_ckwarn_d(aTHX_ err)) {
1881 va_start(args, pat);
1882 vwarner(err, pat, &args);
1888 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1890 PERL_ARGS_ASSERT_CK_WARNER;
1892 if (Perl_ckwarn(aTHX_ err)) {
1894 va_start(args, pat);
1895 vwarner(err, pat, &args);
1901 Perl_warner(pTHX_ U32 err, const char* pat,...)
1904 PERL_ARGS_ASSERT_WARNER;
1905 va_start(args, pat);
1906 vwarner(err, pat, &args);
1911 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1914 PERL_ARGS_ASSERT_VWARNER;
1915 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1916 SV * const msv = vmess(pat, args);
1918 invoke_exception_hook(msv, FALSE);
1922 Perl_vwarn(aTHX_ pat, args);
1926 /* implements the ckWARN? macros */
1929 Perl_ckwarn(pTHX_ U32 w)
1931 /* If lexical warnings have not been set, use $^W. */
1933 return PL_dowarn & G_WARN_ON;
1935 return ckwarn_common(w);
1938 /* implements the ckWARN?_d macro */
1941 Perl_ckwarn_d(pTHX_ U32 w)
1943 /* If lexical warnings have not been set then default classes warn. */
1947 return ckwarn_common(w);
1951 S_ckwarn_common(pTHX_ U32 w)
1953 if (PL_curcop->cop_warnings == pWARN_ALL)
1956 if (PL_curcop->cop_warnings == pWARN_NONE)
1959 /* Check the assumption that at least the first slot is non-zero. */
1960 assert(unpackWARN1(w));
1962 /* Check the assumption that it is valid to stop as soon as a zero slot is
1964 if (!unpackWARN2(w)) {
1965 assert(!unpackWARN3(w));
1966 assert(!unpackWARN4(w));
1967 } else if (!unpackWARN3(w)) {
1968 assert(!unpackWARN4(w));
1971 /* Right, dealt with all the special cases, which are implemented as non-
1972 pointers, so there is a pointer to a real warnings mask. */
1974 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1976 } while (w >>= WARNshift);
1981 /* Set buffer=NULL to get a new one. */
1983 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1985 const MEM_SIZE len_wanted =
1986 sizeof(STRLEN) + (size > WARNsize ? size : WARNsize);
1987 PERL_UNUSED_CONTEXT;
1988 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1991 (specialWARN(buffer) ?
1992 PerlMemShared_malloc(len_wanted) :
1993 PerlMemShared_realloc(buffer, len_wanted));
1995 Copy(bits, (buffer + 1), size, char);
1996 if (size < WARNsize)
1997 Zero((char *)(buffer + 1) + size, WARNsize - size, char);
2001 /* since we've already done strlen() for both nam and val
2002 * we can use that info to make things faster than
2003 * sprintf(s, "%s=%s", nam, val)
2005 #define my_setenv_format(s, nam, nlen, val, vlen) \
2006 Copy(nam, s, nlen, char); \
2008 Copy(val, s+(nlen+1), vlen, char); \
2009 *(s+(nlen+1+vlen)) = '\0'
2011 #ifdef USE_ENVIRON_ARRAY
2012 /* VMS' my_setenv() is in vms.c */
2013 #if !defined(WIN32) && !defined(NETWARE)
2015 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2019 /* only parent thread can modify process environment */
2020 if (PL_curinterp == aTHX)
2023 #ifndef PERL_USE_SAFE_PUTENV
2024 if (!PL_use_safe_putenv) {
2025 /* most putenv()s leak, so we manipulate environ directly */
2027 const I32 len = strlen(nam);
2030 /* where does it go? */
2031 for (i = 0; environ[i]; i++) {
2032 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
2036 if (environ == PL_origenviron) { /* need we copy environment? */
2042 while (environ[max])
2044 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
2045 for (j=0; j<max; j++) { /* copy environment */
2046 const int len = strlen(environ[j]);
2047 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
2048 Copy(environ[j], tmpenv[j], len+1, char);
2051 environ = tmpenv; /* tell exec where it is now */
2054 safesysfree(environ[i]);
2055 while (environ[i]) {
2056 environ[i] = environ[i+1];
2061 if (!environ[i]) { /* does not exist yet */
2062 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2063 environ[i+1] = NULL; /* make sure it's null terminated */
2066 safesysfree(environ[i]);
2070 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2071 /* all that work just for this */
2072 my_setenv_format(environ[i], nam, nlen, val, vlen);
2075 # if defined(__CYGWIN__)|| defined(__SYMBIAN32__) || defined(__riscos__)
2076 # if defined(HAS_UNSETENV)
2078 (void)unsetenv(nam);
2080 (void)setenv(nam, val, 1);
2082 # else /* ! HAS_UNSETENV */
2083 (void)setenv(nam, val, 1);
2084 # endif /* HAS_UNSETENV */
2086 # if defined(HAS_UNSETENV)
2088 if (environ) /* old glibc can crash with null environ */
2089 (void)unsetenv(nam);
2091 const int nlen = strlen(nam);
2092 const int vlen = strlen(val);
2093 char * const new_env =
2094 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2095 my_setenv_format(new_env, nam, nlen, val, vlen);
2096 (void)putenv(new_env);
2098 # else /* ! HAS_UNSETENV */
2100 const int nlen = strlen(nam);
2106 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2107 /* all that work just for this */
2108 my_setenv_format(new_env, nam, nlen, val, vlen);
2109 (void)putenv(new_env);
2110 # endif /* HAS_UNSETENV */
2111 # endif /* __CYGWIN__ */
2112 #ifndef PERL_USE_SAFE_PUTENV
2118 #else /* WIN32 || NETWARE */
2121 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2125 const int nlen = strlen(nam);
2132 Newx(envstr, nlen+vlen+2, char);
2133 my_setenv_format(envstr, nam, nlen, val, vlen);
2134 (void)PerlEnv_putenv(envstr);
2138 #endif /* WIN32 || NETWARE */
2142 #ifdef UNLINK_ALL_VERSIONS
2144 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2148 PERL_ARGS_ASSERT_UNLNK;
2150 while (PerlLIO_unlink(f) >= 0)
2152 return retries ? 0 : -1;
2156 /* this is a drop-in replacement for bcopy() */
2157 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
2159 Perl_my_bcopy(const char *from, char *to, I32 len)
2161 char * const retval = to;
2163 PERL_ARGS_ASSERT_MY_BCOPY;
2167 if (from - to >= 0) {
2175 *(--to) = *(--from);
2181 /* this is a drop-in replacement for memset() */
2184 Perl_my_memset(char *loc, I32 ch, I32 len)
2186 char * const retval = loc;
2188 PERL_ARGS_ASSERT_MY_MEMSET;
2198 /* this is a drop-in replacement for bzero() */
2199 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2201 Perl_my_bzero(char *loc, I32 len)
2203 char * const retval = loc;
2205 PERL_ARGS_ASSERT_MY_BZERO;
2215 /* this is a drop-in replacement for memcmp() */
2216 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2218 Perl_my_memcmp(const char *s1, const char *s2, I32 len)
2220 const U8 *a = (const U8 *)s1;
2221 const U8 *b = (const U8 *)s2;
2224 PERL_ARGS_ASSERT_MY_MEMCMP;
2229 if ((tmp = *a++ - *b++))
2234 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2237 /* This vsprintf replacement should generally never get used, since
2238 vsprintf was available in both System V and BSD 2.11. (There may
2239 be some cross-compilation or embedded set-ups where it is needed,
2242 If you encounter a problem in this function, it's probably a symptom
2243 that Configure failed to detect your system's vprintf() function.
2244 See the section on "item vsprintf" in the INSTALL file.
2246 This version may compile on systems with BSD-ish <stdio.h>,
2247 but probably won't on others.
2250 #ifdef USE_CHAR_VSPRINTF
2255 vsprintf(char *dest, const char *pat, void *args)
2259 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2260 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2261 FILE_cnt(&fakebuf) = 32767;
2263 /* These probably won't compile -- If you really need
2264 this, you'll have to figure out some other method. */
2265 fakebuf._ptr = dest;
2266 fakebuf._cnt = 32767;
2271 fakebuf._flag = _IOWRT|_IOSTRG;
2272 _doprnt(pat, args, &fakebuf); /* what a kludge */
2273 #if defined(STDIO_PTR_LVALUE)
2274 *(FILE_ptr(&fakebuf)++) = '\0';
2276 /* PerlIO has probably #defined away fputc, but we want it here. */
2278 # undef fputc /* XXX Should really restore it later */
2280 (void)fputc('\0', &fakebuf);
2282 #ifdef USE_CHAR_VSPRINTF
2285 return 0; /* perl doesn't use return value */
2289 #endif /* HAS_VPRINTF */
2292 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2294 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2302 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2304 PERL_FLUSHALL_FOR_CHILD;
2305 This = (*mode == 'w');
2309 taint_proper("Insecure %s%s", "EXEC");
2311 if (PerlProc_pipe(p) < 0)
2313 /* Try for another pipe pair for error return */
2314 if (PerlProc_pipe(pp) >= 0)
2316 while ((pid = PerlProc_fork()) < 0) {
2317 if (errno != EAGAIN) {
2318 PerlLIO_close(p[This]);
2319 PerlLIO_close(p[that]);
2321 PerlLIO_close(pp[0]);
2322 PerlLIO_close(pp[1]);
2326 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2335 /* Close parent's end of error status pipe (if any) */
2337 PerlLIO_close(pp[0]);
2338 #if defined(HAS_FCNTL) && defined(F_SETFD)
2339 /* Close error pipe automatically if exec works */
2340 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2344 /* Now dup our end of _the_ pipe to right position */
2345 if (p[THIS] != (*mode == 'r')) {
2346 PerlLIO_dup2(p[THIS], *mode == 'r');
2347 PerlLIO_close(p[THIS]);
2348 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2349 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2352 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2353 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2354 /* No automatic close - do it by hand */
2361 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2367 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2373 do_execfree(); /* free any memory malloced by child on fork */
2375 PerlLIO_close(pp[1]);
2376 /* Keep the lower of the two fd numbers */
2377 if (p[that] < p[This]) {
2378 PerlLIO_dup2(p[This], p[that]);
2379 PerlLIO_close(p[This]);
2383 PerlLIO_close(p[that]); /* close child's end of pipe */
2385 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2386 SvUPGRADE(sv,SVt_IV);
2388 PL_forkprocess = pid;
2389 /* If we managed to get status pipe check for exec fail */
2390 if (did_pipes && pid > 0) {
2395 while (n < sizeof(int)) {
2396 n1 = PerlLIO_read(pp[0],
2397 (void*)(((char*)&errkid)+n),
2403 PerlLIO_close(pp[0]);
2405 if (n) { /* Error */
2407 PerlLIO_close(p[This]);
2408 if (n != sizeof(int))
2409 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2411 pid2 = wait4pid(pid, &status, 0);
2412 } while (pid2 == -1 && errno == EINTR);
2413 errno = errkid; /* Propagate errno from kid */
2418 PerlLIO_close(pp[0]);
2419 return PerlIO_fdopen(p[This], mode);
2421 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2422 return my_syspopen4(aTHX_ NULL, mode, n, args);
2424 Perl_croak(aTHX_ "List form of piped open not implemented");
2425 return (PerlIO *) NULL;
2430 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2431 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__LIBCATAMOUNT__)
2433 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2439 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2443 PERL_ARGS_ASSERT_MY_POPEN;
2445 PERL_FLUSHALL_FOR_CHILD;
2448 return my_syspopen(aTHX_ cmd,mode);
2451 This = (*mode == 'w');
2453 if (doexec && TAINTING_get) {
2455 taint_proper("Insecure %s%s", "EXEC");
2457 if (PerlProc_pipe(p) < 0)
2459 if (doexec && PerlProc_pipe(pp) >= 0)
2461 while ((pid = PerlProc_fork()) < 0) {
2462 if (errno != EAGAIN) {
2463 PerlLIO_close(p[This]);
2464 PerlLIO_close(p[that]);
2466 PerlLIO_close(pp[0]);
2467 PerlLIO_close(pp[1]);
2470 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2473 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2483 PerlLIO_close(pp[0]);
2484 #if defined(HAS_FCNTL) && defined(F_SETFD)
2485 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2489 if (p[THIS] != (*mode == 'r')) {
2490 PerlLIO_dup2(p[THIS], *mode == 'r');
2491 PerlLIO_close(p[THIS]);
2492 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2493 PerlLIO_close(p[THAT]);
2496 PerlLIO_close(p[THAT]);
2499 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2506 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2511 /* may or may not use the shell */
2512 do_exec3(cmd, pp[1], did_pipes);
2515 #endif /* defined OS2 */
2517 #ifdef PERLIO_USING_CRLF
2518 /* Since we circumvent IO layers when we manipulate low-level
2519 filedescriptors directly, need to manually switch to the
2520 default, binary, low-level mode; see PerlIOBuf_open(). */
2521 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2524 #ifdef PERL_USES_PL_PIDSTATUS
2525 hv_clear(PL_pidstatus); /* we have no children */
2531 do_execfree(); /* free any memory malloced by child on vfork */
2533 PerlLIO_close(pp[1]);
2534 if (p[that] < p[This]) {
2535 PerlLIO_dup2(p[This], p[that]);
2536 PerlLIO_close(p[This]);
2540 PerlLIO_close(p[that]);
2542 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2543 SvUPGRADE(sv,SVt_IV);
2545 PL_forkprocess = pid;
2546 if (did_pipes && pid > 0) {
2551 while (n < sizeof(int)) {
2552 n1 = PerlLIO_read(pp[0],
2553 (void*)(((char*)&errkid)+n),
2559 PerlLIO_close(pp[0]);
2561 if (n) { /* Error */
2563 PerlLIO_close(p[This]);
2564 if (n != sizeof(int))
2565 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2567 pid2 = wait4pid(pid, &status, 0);
2568 } while (pid2 == -1 && errno == EINTR);
2569 errno = errkid; /* Propagate errno from kid */
2574 PerlLIO_close(pp[0]);
2575 return PerlIO_fdopen(p[This], mode);
2579 FILE *djgpp_popen();
2581 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2583 PERL_FLUSHALL_FOR_CHILD;
2584 /* Call system's popen() to get a FILE *, then import it.
2585 used 0 for 2nd parameter to PerlIO_importFILE;
2588 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2591 #if defined(__LIBCATAMOUNT__)
2593 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2600 #endif /* !DOSISH */
2602 /* this is called in parent before the fork() */
2604 Perl_atfork_lock(void)
2606 #if defined(USE_ITHREADS)
2608 /* locks must be held in locking order (if any) */
2610 MUTEX_LOCK(&PL_perlio_mutex);
2613 MUTEX_LOCK(&PL_malloc_mutex);
2619 /* this is called in both parent and child after the fork() */
2621 Perl_atfork_unlock(void)
2623 #if defined(USE_ITHREADS)
2625 /* locks must be released in same order as in atfork_lock() */
2627 MUTEX_UNLOCK(&PL_perlio_mutex);
2630 MUTEX_UNLOCK(&PL_malloc_mutex);
2639 #if defined(HAS_FORK)
2641 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2646 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2647 * handlers elsewhere in the code */
2652 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2653 Perl_croak_nocontext("fork() not available");
2655 #endif /* HAS_FORK */
2660 dup2(int oldfd, int newfd)
2662 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2665 PerlLIO_close(newfd);
2666 return fcntl(oldfd, F_DUPFD, newfd);
2668 #define DUP2_MAX_FDS 256
2669 int fdtmp[DUP2_MAX_FDS];
2675 PerlLIO_close(newfd);
2676 /* good enough for low fd's... */
2677 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2678 if (fdx >= DUP2_MAX_FDS) {
2686 PerlLIO_close(fdtmp[--fdx]);
2693 #ifdef HAS_SIGACTION
2696 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2698 struct sigaction act, oact;
2702 /* only "parent" interpreter can diddle signals */
2703 if (PL_curinterp != aTHX)
2704 return (Sighandler_t) SIG_ERR;
2707 act.sa_handler = (void(*)(int))handler;
2708 sigemptyset(&act.sa_mask);
2711 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2712 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2714 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2715 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2716 act.sa_flags |= SA_NOCLDWAIT;
2718 if (sigaction(signo, &act, &oact) == -1)
2719 return (Sighandler_t) SIG_ERR;
2721 return (Sighandler_t) oact.sa_handler;
2725 Perl_rsignal_state(pTHX_ int signo)
2727 struct sigaction oact;
2728 PERL_UNUSED_CONTEXT;
2730 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2731 return (Sighandler_t) SIG_ERR;
2733 return (Sighandler_t) oact.sa_handler;
2737 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2742 struct sigaction act;
2744 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2747 /* only "parent" interpreter can diddle signals */
2748 if (PL_curinterp != aTHX)
2752 act.sa_handler = (void(*)(int))handler;
2753 sigemptyset(&act.sa_mask);
2756 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2757 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2759 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2760 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2761 act.sa_flags |= SA_NOCLDWAIT;
2763 return sigaction(signo, &act, save);
2767 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2772 PERL_UNUSED_CONTEXT;
2774 /* only "parent" interpreter can diddle signals */
2775 if (PL_curinterp != aTHX)
2779 return sigaction(signo, save, (struct sigaction *)NULL);
2782 #else /* !HAS_SIGACTION */
2785 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2787 #if defined(USE_ITHREADS) && !defined(WIN32)
2788 /* only "parent" interpreter can diddle signals */
2789 if (PL_curinterp != aTHX)
2790 return (Sighandler_t) SIG_ERR;
2793 return PerlProc_signal(signo, handler);
2804 Perl_rsignal_state(pTHX_ int signo)
2807 Sighandler_t oldsig;
2809 #if defined(USE_ITHREADS) && !defined(WIN32)
2810 /* only "parent" interpreter can diddle signals */
2811 if (PL_curinterp != aTHX)
2812 return (Sighandler_t) SIG_ERR;
2816 oldsig = PerlProc_signal(signo, sig_trap);
2817 PerlProc_signal(signo, oldsig);
2819 PerlProc_kill(PerlProc_getpid(), signo);
2824 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2826 #if defined(USE_ITHREADS) && !defined(WIN32)
2827 /* only "parent" interpreter can diddle signals */
2828 if (PL_curinterp != aTHX)
2831 *save = PerlProc_signal(signo, handler);
2832 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2836 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2838 #if defined(USE_ITHREADS) && !defined(WIN32)
2839 /* only "parent" interpreter can diddle signals */
2840 if (PL_curinterp != aTHX)
2843 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2846 #endif /* !HAS_SIGACTION */
2847 #endif /* !PERL_MICRO */
2849 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2850 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__LIBCATAMOUNT__)
2852 Perl_my_pclose(pTHX_ PerlIO *ptr)
2860 const int fd = PerlIO_fileno(ptr);
2863 svp = av_fetch(PL_fdpid,fd,TRUE);
2864 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2868 #if defined(USE_PERLIO)
2869 /* Find out whether the refcount is low enough for us to wait for the
2870 child proc without blocking. */
2871 should_wait = PerlIOUnix_refcnt(fd) == 1 && pid > 0;
2873 should_wait = pid > 0;
2877 if (pid == -1) { /* Opened by popen. */
2878 return my_syspclose(ptr);
2881 close_failed = (PerlIO_close(ptr) == EOF);
2883 if (should_wait) do {
2884 pid2 = wait4pid(pid, &status, 0);
2885 } while (pid2 == -1 && errno == EINTR);
2892 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
2897 #if defined(__LIBCATAMOUNT__)
2899 Perl_my_pclose(pTHX_ PerlIO *ptr)
2904 #endif /* !DOSISH */
2906 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2908 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2911 PERL_ARGS_ASSERT_WAIT4PID;
2912 #ifdef PERL_USES_PL_PIDSTATUS
2914 /* PERL_USES_PL_PIDSTATUS is only defined when neither
2915 waitpid() nor wait4() is available, or on OS/2, which
2916 doesn't appear to support waiting for a progress group
2917 member, so we can only treat a 0 pid as an unknown child.
2924 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2925 pid, rather than a string form. */
2926 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2927 if (svp && *svp != &PL_sv_undef) {
2928 *statusp = SvIVX(*svp);
2929 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2937 hv_iterinit(PL_pidstatus);
2938 if ((entry = hv_iternext(PL_pidstatus))) {
2939 SV * const sv = hv_iterval(PL_pidstatus,entry);
2941 const char * const spid = hv_iterkey(entry,&len);
2943 assert (len == sizeof(Pid_t));
2944 memcpy((char *)&pid, spid, len);
2945 *statusp = SvIVX(sv);
2946 /* The hash iterator is currently on this entry, so simply
2947 calling hv_delete would trigger the lazy delete, which on
2948 aggregate does more work, beacuse next call to hv_iterinit()
2949 would spot the flag, and have to call the delete routine,
2950 while in the meantime any new entries can't re-use that
2952 hv_iterinit(PL_pidstatus);
2953 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2960 # ifdef HAS_WAITPID_RUNTIME
2961 if (!HAS_WAITPID_RUNTIME)
2964 result = PerlProc_waitpid(pid,statusp,flags);
2967 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2968 result = wait4(pid,statusp,flags,NULL);
2971 #ifdef PERL_USES_PL_PIDSTATUS
2972 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2977 Perl_croak(aTHX_ "Can't do waitpid with flags");
2979 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2980 pidgone(result,*statusp);
2986 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2989 if (result < 0 && errno == EINTR) {
2991 errno = EINTR; /* reset in case a signal handler changed $! */
2995 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2997 #ifdef PERL_USES_PL_PIDSTATUS
2999 S_pidgone(pTHX_ Pid_t pid, int status)
3003 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3004 SvUPGRADE(sv,SVt_IV);
3005 SvIV_set(sv, status);
3013 int /* Cannot prototype with I32
3015 my_syspclose(PerlIO *ptr)
3018 Perl_my_pclose(pTHX_ PerlIO *ptr)
3021 /* Needs work for PerlIO ! */
3022 FILE * const f = PerlIO_findFILE(ptr);
3023 const I32 result = pclose(f);
3024 PerlIO_releaseFILE(ptr,f);
3032 Perl_my_pclose(pTHX_ PerlIO *ptr)
3034 /* Needs work for PerlIO ! */
3035 FILE * const f = PerlIO_findFILE(ptr);
3036 I32 result = djgpp_pclose(f);
3037 result = (result << 8) & 0xff00;
3038 PerlIO_releaseFILE(ptr,f);
3043 #define PERL_REPEATCPY_LINEAR 4
3045 Perl_repeatcpy(char *to, const char *from, I32 len, IV count)
3047 PERL_ARGS_ASSERT_REPEATCPY;
3052 croak_memory_wrap();
3055 memset(to, *from, count);
3058 IV items, linear, half;
3060 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3061 for (items = 0; items < linear; ++items) {
3062 const char *q = from;
3064 for (todo = len; todo > 0; todo--)
3069 while (items <= half) {
3070 IV size = items * len;
3071 memcpy(p, to, size);
3077 memcpy(p, to, (count - items) * len);
3083 Perl_same_dirent(pTHX_ const char *a, const char *b)
3085 char *fa = strrchr(a,'/');
3086 char *fb = strrchr(b,'/');
3089 SV * const tmpsv = sv_newmortal();
3091 PERL_ARGS_ASSERT_SAME_DIRENT;
3104 sv_setpvs(tmpsv, ".");
3106 sv_setpvn(tmpsv, a, fa - a);
3107 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3110 sv_setpvs(tmpsv, ".");
3112 sv_setpvn(tmpsv, b, fb - b);
3113 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3115 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3116 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3118 #endif /* !HAS_RENAME */
3121 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3122 const char *const *const search_ext, I32 flags)
3124 const char *xfound = NULL;
3125 char *xfailed = NULL;
3126 char tmpbuf[MAXPATHLEN];
3131 #if defined(DOSISH) && !defined(OS2)
3132 # define SEARCH_EXTS ".bat", ".cmd", NULL
3133 # define MAX_EXT_LEN 4
3136 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3137 # define MAX_EXT_LEN 4
3140 # define SEARCH_EXTS ".pl", ".com", NULL
3141 # define MAX_EXT_LEN 4
3143 /* additional extensions to try in each dir if scriptname not found */
3145 static const char *const exts[] = { SEARCH_EXTS };
3146 const char *const *const ext = search_ext ? search_ext : exts;
3147 int extidx = 0, i = 0;
3148 const char *curext = NULL;
3150 PERL_UNUSED_ARG(search_ext);
3151 # define MAX_EXT_LEN 0
3154 PERL_ARGS_ASSERT_FIND_SCRIPT;
3157 * If dosearch is true and if scriptname does not contain path
3158 * delimiters, search the PATH for scriptname.
3160 * If SEARCH_EXTS is also defined, will look for each
3161 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3162 * while searching the PATH.
3164 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3165 * proceeds as follows:
3166 * If DOSISH or VMSISH:
3167 * + look for ./scriptname{,.foo,.bar}
3168 * + search the PATH for scriptname{,.foo,.bar}
3171 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3172 * this will not look in '.' if it's not in the PATH)
3177 # ifdef ALWAYS_DEFTYPES
3178 len = strlen(scriptname);
3179 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3180 int idx = 0, deftypes = 1;
3183 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3186 int idx = 0, deftypes = 1;
3189 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3191 /* The first time through, just add SEARCH_EXTS to whatever we
3192 * already have, so we can check for default file types. */
3194 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3200 if ((strlen(tmpbuf) + strlen(scriptname)
3201 + MAX_EXT_LEN) >= sizeof tmpbuf)
3202 continue; /* don't search dir with too-long name */
3203 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3207 if (strEQ(scriptname, "-"))
3209 if (dosearch) { /* Look in '.' first. */
3210 const char *cur = scriptname;
3212 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3214 if (strEQ(ext[i++],curext)) {
3215 extidx = -1; /* already has an ext */
3220 DEBUG_p(PerlIO_printf(Perl_debug_log,
3221 "Looking for %s\n",cur));
3222 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3223 && !S_ISDIR(PL_statbuf.st_mode)) {
3231 if (cur == scriptname) {
3232 len = strlen(scriptname);
3233 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3235 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3238 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3239 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3244 if (dosearch && !strchr(scriptname, '/')
3246 && !strchr(scriptname, '\\')
3248 && (s = PerlEnv_getenv("PATH")))
3252 bufend = s + strlen(s);
3253 while (s < bufend) {
3256 && *s != ';'; len++, s++) {
3257 if (len < sizeof tmpbuf)
3260 if (len < sizeof tmpbuf)
3263 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3269 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3270 continue; /* don't search dir with too-long name */
3273 && tmpbuf[len - 1] != '/'
3274 && tmpbuf[len - 1] != '\\'
3277 tmpbuf[len++] = '/';
3278 if (len == 2 && tmpbuf[0] == '.')
3280 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3284 len = strlen(tmpbuf);
3285 if (extidx > 0) /* reset after previous loop */
3289 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3290 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3291 if (S_ISDIR(PL_statbuf.st_mode)) {
3295 } while ( retval < 0 /* not there */
3296 && extidx>=0 && ext[extidx] /* try an extension? */
3297 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3302 if (S_ISREG(PL_statbuf.st_mode)
3303 && cando(S_IRUSR,TRUE,&PL_statbuf)
3304 #if !defined(DOSISH)
3305 && cando(S_IXUSR,TRUE,&PL_statbuf)
3309 xfound = tmpbuf; /* bingo! */
3313 xfailed = savepv(tmpbuf);
3316 if (!xfound && !seen_dot && !xfailed &&
3317 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3318 || S_ISDIR(PL_statbuf.st_mode)))
3320 seen_dot = 1; /* Disable message. */
3322 if (flags & 1) { /* do or die? */
3323 /* diag_listed_as: Can't execute %s */
3324 Perl_croak(aTHX_ "Can't %s %s%s%s",
3325 (xfailed ? "execute" : "find"),
3326 (xfailed ? xfailed : scriptname),
3327 (xfailed ? "" : " on PATH"),
3328 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3333 scriptname = xfound;
3335 return (scriptname ? savepv(scriptname) : NULL);
3338 #ifndef PERL_GET_CONTEXT_DEFINED
3341 Perl_get_context(void)
3343 #if defined(USE_ITHREADS)
3345 # ifdef OLD_PTHREADS_API
3347 int error = pthread_getspecific(PL_thr_key, &t)
3349 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3352 # ifdef I_MACH_CTHREADS
3353 return (void*)cthread_data(cthread_self());
3355 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3364 Perl_set_context(void *t)
3366 #if defined(USE_ITHREADS)
3369 PERL_ARGS_ASSERT_SET_CONTEXT;
3370 #if defined(USE_ITHREADS)
3371 # ifdef I_MACH_CTHREADS
3372 cthread_set_data(cthread_self(), t);
3375 const int error = pthread_setspecific(PL_thr_key, t);
3377 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3385 #endif /* !PERL_GET_CONTEXT_DEFINED */
3387 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3391 PERL_UNUSED_CONTEXT;
3397 Perl_get_op_names(pTHX)
3399 PERL_UNUSED_CONTEXT;
3400 return (char **)PL_op_name;
3404 Perl_get_op_descs(pTHX)
3406 PERL_UNUSED_CONTEXT;
3407 return (char **)PL_op_desc;
3411 Perl_get_no_modify(pTHX)
3413 PERL_UNUSED_CONTEXT;
3414 return PL_no_modify;
3418 Perl_get_opargs(pTHX)
3420 PERL_UNUSED_CONTEXT;
3421 return (U32 *)PL_opargs;
3425 Perl_get_ppaddr(pTHX)
3428 PERL_UNUSED_CONTEXT;
3429 return (PPADDR_t*)PL_ppaddr;
3432 #ifndef HAS_GETENV_LEN
3434 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3436 char * const env_trans = PerlEnv_getenv(env_elem);
3437 PERL_UNUSED_CONTEXT;
3438 PERL_ARGS_ASSERT_GETENV_LEN;
3440 *len = strlen(env_trans);
3447 Perl_get_vtbl(pTHX_ int vtbl_id)
3449 PERL_UNUSED_CONTEXT;
3451 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3452 ? NULL : (MGVTBL*)PL_magic_vtables + vtbl_id;
3456 Perl_my_fflush_all(pTHX)
3458 #if defined(USE_PERLIO) || defined(FFLUSH_NULL)
3459 return PerlIO_flush(NULL);
3461 # if defined(HAS__FWALK)
3462 extern int fflush(FILE *);
3463 /* undocumented, unprototyped, but very useful BSDism */
3464 extern void _fwalk(int (*)(FILE *));
3468 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3470 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3471 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3473 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3474 open_max = sysconf(_SC_OPEN_MAX);
3477 open_max = FOPEN_MAX;
3480 open_max = OPEN_MAX;
3491 for (i = 0; i < open_max; i++)
3492 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3493 STDIO_STREAM_ARRAY[i]._file < open_max &&
3494 STDIO_STREAM_ARRAY[i]._flag)
3495 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3499 SETERRNO(EBADF,RMS_IFI);
3506 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3508 if (ckWARN(WARN_IO)) {
3510 = gv && (isGV_with_GP(gv))
3513 const char * const direction = have == '>' ? "out" : "in";
3515 if (name && HEK_LEN(name))
3516 Perl_warner(aTHX_ packWARN(WARN_IO),
3517 "Filehandle %"HEKf" opened only for %sput",
3518 HEKfARG(name), direction);
3520 Perl_warner(aTHX_ packWARN(WARN_IO),
3521 "Filehandle opened only for %sput", direction);
3526 Perl_report_evil_fh(pTHX_ const GV *gv)
3528 const IO *io = gv ? GvIO(gv) : NULL;
3529 const PERL_BITFIELD16 op = PL_op->op_type;
3533 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3535 warn_type = WARN_CLOSED;
3539 warn_type = WARN_UNOPENED;
3542 if (ckWARN(warn_type)) {
3544 = gv && isGV_with_GP(gv) && GvENAMELEN(gv) ?
3545 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3546 const char * const pars =
3547 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3548 const char * const func =
3550 (op == OP_READLINE || op == OP_RCATLINE
3551 ? "readline" : /* "<HANDLE>" not nice */
3552 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3554 const char * const type =
3556 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3557 ? "socket" : "filehandle");
3558 const bool have_name = name && SvCUR(name);
3559 Perl_warner(aTHX_ packWARN(warn_type),
3560 "%s%s on %s %s%s%"SVf, func, pars, vile, type,
3561 have_name ? " " : "",
3562 SVfARG(have_name ? name : &PL_sv_no));
3563 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3565 aTHX_ packWARN(warn_type),
3566 "\t(Are you trying to call %s%s on dirhandle%s%"SVf"?)\n",
3567 func, pars, have_name ? " " : "",
3568 SVfARG(have_name ? name : &PL_sv_no)
3573 /* To workaround core dumps from the uninitialised tm_zone we get the
3574 * system to give us a reasonable struct to copy. This fix means that
3575 * strftime uses the tm_zone and tm_gmtoff values returned by
3576 * localtime(time()). That should give the desired result most of the
3577 * time. But probably not always!
3579 * This does not address tzname aspects of NETaa14816.
3584 # ifndef STRUCT_TM_HASZONE
3585 # define STRUCT_TM_HASZONE
3589 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3590 # ifndef HAS_TM_TM_ZONE
3591 # define HAS_TM_TM_ZONE
3596 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3598 #ifdef HAS_TM_TM_ZONE
3600 const struct tm* my_tm;
3601 PERL_UNUSED_CONTEXT;
3602 PERL_ARGS_ASSERT_INIT_TM;
3604 my_tm = localtime(&now);
3606 Copy(my_tm, ptm, 1, struct tm);
3608 PERL_UNUSED_CONTEXT;
3609 PERL_ARGS_ASSERT_INIT_TM;
3610 PERL_UNUSED_ARG(ptm);
3615 * mini_mktime - normalise struct tm values without the localtime()
3616 * semantics (and overhead) of mktime().
3619 Perl_mini_mktime(struct tm *ptm)
3623 int month, mday, year, jday;
3624 int odd_cent, odd_year;
3626 PERL_ARGS_ASSERT_MINI_MKTIME;
3628 #define DAYS_PER_YEAR 365
3629 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3630 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3631 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3632 #define SECS_PER_HOUR (60*60)
3633 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3634 /* parentheses deliberately absent on these two, otherwise they don't work */
3635 #define MONTH_TO_DAYS 153/5
3636 #define DAYS_TO_MONTH 5/153
3637 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3638 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3639 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3640 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3643 * Year/day algorithm notes:
3645 * With a suitable offset for numeric value of the month, one can find
3646 * an offset into the year by considering months to have 30.6 (153/5) days,
3647 * using integer arithmetic (i.e., with truncation). To avoid too much
3648 * messing about with leap days, we consider January and February to be
3649 * the 13th and 14th month of the previous year. After that transformation,
3650 * we need the month index we use to be high by 1 from 'normal human' usage,
3651 * so the month index values we use run from 4 through 15.
3653 * Given that, and the rules for the Gregorian calendar (leap years are those
3654 * divisible by 4 unless also divisible by 100, when they must be divisible
3655 * by 400 instead), we can simply calculate the number of days since some
3656 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3657 * the days we derive from our month index, and adding in the day of the
3658 * month. The value used here is not adjusted for the actual origin which
3659 * it normally would use (1 January A.D. 1), since we're not exposing it.
3660 * We're only building the value so we can turn around and get the
3661 * normalised values for the year, month, day-of-month, and day-of-year.
3663 * For going backward, we need to bias the value we're using so that we find
3664 * the right year value. (Basically, we don't want the contribution of
3665 * March 1st to the number to apply while deriving the year). Having done
3666 * that, we 'count up' the contribution to the year number by accounting for
3667 * full quadracenturies (400-year periods) with their extra leap days, plus
3668 * the contribution from full centuries (to avoid counting in the lost leap
3669 * days), plus the contribution from full quad-years (to count in the normal
3670 * leap days), plus the leftover contribution from any non-leap years.
3671 * At this point, if we were working with an actual leap day, we'll have 0
3672 * days left over. This is also true for March 1st, however. So, we have
3673 * to special-case that result, and (earlier) keep track of the 'odd'
3674 * century and year contributions. If we got 4 extra centuries in a qcent,
3675 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3676 * Otherwise, we add back in the earlier bias we removed (the 123 from
3677 * figuring in March 1st), find the month index (integer division by 30.6),
3678 * and the remainder is the day-of-month. We then have to convert back to
3679 * 'real' months (including fixing January and February from being 14/15 in
3680 * the previous year to being in the proper year). After that, to get
3681 * tm_yday, we work with the normalised year and get a new yearday value for
3682 * January 1st, which we subtract from the yearday value we had earlier,
3683 * representing the date we've re-built. This is done from January 1
3684 * because tm_yday is 0-origin.
3686 * Since POSIX time routines are only guaranteed to work for times since the
3687 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3688 * applies Gregorian calendar rules even to dates before the 16th century
3689 * doesn't bother me. Besides, you'd need cultural context for a given
3690 * date to know whether it was Julian or Gregorian calendar, and that's
3691 * outside the scope for this routine. Since we convert back based on the
3692 * same rules we used to build the yearday, you'll only get strange results
3693 * for input which needed normalising, or for the 'odd' century years which
3694 * were leap years in the Julian calendar but not in the Gregorian one.
3695 * I can live with that.
3697 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3698 * that's still outside the scope for POSIX time manipulation, so I don't
3702 year = 1900 + ptm->tm_year;
3703 month = ptm->tm_mon;
3704 mday = ptm->tm_mday;
3710 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3711 yearday += month*MONTH_TO_DAYS + mday + jday;
3713 * Note that we don't know when leap-seconds were or will be,
3714 * so we have to trust the user if we get something which looks
3715 * like a sensible leap-second. Wild values for seconds will
3716 * be rationalised, however.
3718 if ((unsigned) ptm->tm_sec <= 60) {
3725 secs += 60 * ptm->tm_min;
3726 secs += SECS_PER_HOUR * ptm->tm_hour;
3728 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3729 /* got negative remainder, but need positive time */
3730 /* back off an extra day to compensate */
3731 yearday += (secs/SECS_PER_DAY)-1;
3732 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3735 yearday += (secs/SECS_PER_DAY);
3736 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3739 else if (secs >= SECS_PER_DAY) {
3740 yearday += (secs/SECS_PER_DAY);
3741 secs %= SECS_PER_DAY;
3743 ptm->tm_hour = secs/SECS_PER_HOUR;
3744 secs %= SECS_PER_HOUR;
3745 ptm->tm_min = secs/60;
3747 ptm->tm_sec += secs;
3748 /* done with time of day effects */
3750 * The algorithm for yearday has (so far) left it high by 428.
3751 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3752 * bias it by 123 while trying to figure out what year it
3753 * really represents. Even with this tweak, the reverse
3754 * translation fails for years before A.D. 0001.
3755 * It would still fail for Feb 29, but we catch that one below.
3757 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3758 yearday -= YEAR_ADJUST;
3759 year = (yearday / DAYS_PER_QCENT) * 400;
3760 yearday %= DAYS_PER_QCENT;
3761 odd_cent = yearday / DAYS_PER_CENT;
3762 year += odd_cent * 100;
3763 yearday %= DAYS_PER_CENT;
3764 year += (yearday / DAYS_PER_QYEAR) * 4;
3765 yearday %= DAYS_PER_QYEAR;
3766 odd_year = yearday / DAYS_PER_YEAR;
3768 yearday %= DAYS_PER_YEAR;
3769 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3774 yearday += YEAR_ADJUST; /* recover March 1st crock */
3775 month = yearday*DAYS_TO_MONTH;
3776 yearday -= month*MONTH_TO_DAYS;
3777 /* recover other leap-year adjustment */
3786 ptm->tm_year = year - 1900;
3788 ptm->tm_mday = yearday;
3789 ptm->tm_mon = month;
3793 ptm->tm_mon = month - 1;
3795 /* re-build yearday based on Jan 1 to get tm_yday */
3797 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3798 yearday += 14*MONTH_TO_DAYS + 1;
3799 ptm->tm_yday = jday - yearday;
3800 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3804 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)
3808 /* Note that yday and wday effectively are ignored by this function, as mini_mktime() overwrites them */
3815 PERL_ARGS_ASSERT_MY_STRFTIME;
3817 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3820 mytm.tm_hour = hour;
3821 mytm.tm_mday = mday;
3823 mytm.tm_year = year;
3824 mytm.tm_wday = wday;
3825 mytm.tm_yday = yday;
3826 mytm.tm_isdst = isdst;
3828 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3829 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3834 #ifdef HAS_TM_TM_GMTOFF
3835 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3837 #ifdef HAS_TM_TM_ZONE
3838 mytm.tm_zone = mytm2.tm_zone;
3843 Newx(buf, buflen, char);
3845 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3846 len = strftime(buf, buflen, fmt, &mytm);
3850 ** The following is needed to handle to the situation where
3851 ** tmpbuf overflows. Basically we want to allocate a buffer
3852 ** and try repeatedly. The reason why it is so complicated
3853 ** is that getting a return value of 0 from strftime can indicate
3854 ** one of the following:
3855 ** 1. buffer overflowed,
3856 ** 2. illegal conversion specifier, or
3857 ** 3. the format string specifies nothing to be returned(not
3858 ** an error). This could be because format is an empty string
3859 ** or it specifies %p that yields an empty string in some locale.
3860 ** If there is a better way to make it portable, go ahead by
3863 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3866 /* Possibly buf overflowed - try again with a bigger buf */
3867 const int fmtlen = strlen(fmt);
3868 int bufsize = fmtlen + buflen;
3870 Renew(buf, bufsize, char);
3873 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3874 buflen = strftime(buf, bufsize, fmt, &mytm);
3877 if (buflen > 0 && buflen < bufsize)
3879 /* heuristic to prevent out-of-memory errors */
3880 if (bufsize > 100*fmtlen) {
3886 Renew(buf, bufsize, char);
3891 Perl_croak(aTHX_ "panic: no strftime");
3897 #define SV_CWD_RETURN_UNDEF \
3898 sv_setsv(sv, &PL_sv_undef); \
3901 #define SV_CWD_ISDOT(dp) \
3902 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3903 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3906 =head1 Miscellaneous Functions
3908 =for apidoc getcwd_sv
3910 Fill the sv with current working directory
3915 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3916 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3917 * getcwd(3) if available
3918 * Comments from the orignal:
3919 * This is a faster version of getcwd. It's also more dangerous
3920 * because you might chdir out of a directory that you can't chdir
3924 Perl_getcwd_sv(pTHX_ SV *sv)
3929 PERL_ARGS_ASSERT_GETCWD_SV;
3933 char buf[MAXPATHLEN];
3935 /* Some getcwd()s automatically allocate a buffer of the given
3936 * size from the heap if they are given a NULL buffer pointer.
3937 * The problem is that this behaviour is not portable. */
3938 if (getcwd(buf, sizeof(buf) - 1)) {
3943 sv_setsv(sv, &PL_sv_undef);
3951 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3955 SvUPGRADE(sv, SVt_PV);
3957 if (PerlLIO_lstat(".", &statbuf) < 0) {
3958 SV_CWD_RETURN_UNDEF;
3961 orig_cdev = statbuf.st_dev;
3962 orig_cino = statbuf.st_ino;
3972 if (PerlDir_chdir("..") < 0) {
3973 SV_CWD_RETURN_UNDEF;
3975 if (PerlLIO_stat(".", &statbuf) < 0) {
3976 SV_CWD_RETURN_UNDEF;
3979 cdev = statbuf.st_dev;
3980 cino = statbuf.st_ino;
3982 if (odev == cdev && oino == cino) {
3985 if (!(dir = PerlDir_open("."))) {
3986 SV_CWD_RETURN_UNDEF;
3989 while ((dp = PerlDir_read(dir)) != NULL) {
3991 namelen = dp->d_namlen;
3993 namelen = strlen(dp->d_name);
3996 if (SV_CWD_ISDOT(dp)) {
4000 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4001 SV_CWD_RETURN_UNDEF;
4004 tdev = statbuf.st_dev;
4005 tino = statbuf.st_ino;
4006 if (tino == oino && tdev == odev) {
4012 SV_CWD_RETURN_UNDEF;
4015 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4016 SV_CWD_RETURN_UNDEF;
4019 SvGROW(sv, pathlen + namelen + 1);
4023 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4026 /* prepend current directory to the front */
4028 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4029 pathlen += (namelen + 1);
4031 #ifdef VOID_CLOSEDIR
4034 if (PerlDir_close(dir) < 0) {
4035 SV_CWD_RETURN_UNDEF;
4041 SvCUR_set(sv, pathlen);
4045 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4046 SV_CWD_RETURN_UNDEF;
4049 if (PerlLIO_stat(".", &statbuf) < 0) {
4050 SV_CWD_RETURN_UNDEF;
4053 cdev = statbuf.st_dev;
4054 cino = statbuf.st_ino;
4056 if (cdev != orig_cdev || cino != orig_cino) {
4057 Perl_croak(aTHX_ "Unstable directory path, "
4058 "current directory changed unexpectedly");
4071 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4072 # define EMULATE_SOCKETPAIR_UDP
4075 #ifdef EMULATE_SOCKETPAIR_UDP
4077 S_socketpair_udp (int fd[2]) {
4079 /* Fake a datagram socketpair using UDP to localhost. */
4080 int sockets[2] = {-1, -1};
4081 struct sockaddr_in addresses[2];
4083 Sock_size_t size = sizeof(struct sockaddr_in);
4084 unsigned short port;
4087 memset(&addresses, 0, sizeof(addresses));
4090 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4091 if (sockets[i] == -1)
4092 goto tidy_up_and_fail;
4094 addresses[i].sin_family = AF_INET;
4095 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4096 addresses[i].sin_port = 0; /* kernel choses port. */
4097 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4098 sizeof(struct sockaddr_in)) == -1)
4099 goto tidy_up_and_fail;
4102 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4103 for each connect the other socket to it. */
4106 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4108 goto tidy_up_and_fail;
4109 if (size != sizeof(struct sockaddr_in))
4110 goto abort_tidy_up_and_fail;
4111 /* !1 is 0, !0 is 1 */
4112 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4113 sizeof(struct sockaddr_in)) == -1)
4114 goto tidy_up_and_fail;
4117 /* Now we have 2 sockets connected to each other. I don't trust some other
4118 process not to have already sent a packet to us (by random) so send
4119 a packet from each to the other. */
4122 /* I'm going to send my own port number. As a short.
4123 (Who knows if someone somewhere has sin_port as a bitfield and needs
4124 this routine. (I'm assuming crays have socketpair)) */
4125 port = addresses[i].sin_port;
4126 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4127 if (got != sizeof(port)) {
4129 goto tidy_up_and_fail;
4130 goto abort_tidy_up_and_fail;
4134 /* Packets sent. I don't trust them to have arrived though.
4135 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4136 connect to localhost will use a second kernel thread. In 2.6 the
4137 first thread running the connect() returns before the second completes,
4138 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4139 returns 0. Poor programs have tripped up. One poor program's authors'
4140 had a 50-1 reverse stock split. Not sure how connected these were.)
4141 So I don't trust someone not to have an unpredictable UDP stack.
4145 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4146 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4150 FD_SET((unsigned int)sockets[0], &rset);
4151 FD_SET((unsigned int)sockets[1], &rset);
4153 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4154 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4155 || !FD_ISSET(sockets[1], &rset)) {
4156 /* I hope this is portable and appropriate. */
4158 goto tidy_up_and_fail;
4159 goto abort_tidy_up_and_fail;
4163 /* And the paranoia department even now doesn't trust it to have arrive
4164 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4166 struct sockaddr_in readfrom;
4167 unsigned short buffer[2];
4172 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4173 sizeof(buffer), MSG_DONTWAIT,
4174 (struct sockaddr *) &readfrom, &size);
4176 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4178 (struct sockaddr *) &readfrom, &size);
4182 goto tidy_up_and_fail;
4183 if (got != sizeof(port)
4184 || size != sizeof(struct sockaddr_in)
4185 /* Check other socket sent us its port. */
4186 || buffer[0] != (unsigned short) addresses[!i].sin_port
4187 /* Check kernel says we got the datagram from that socket */
4188 || readfrom.sin_family != addresses[!i].sin_family
4189 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4190 || readfrom.sin_port != addresses[!i].sin_port)
4191 goto abort_tidy_up_and_fail;
4194 /* My caller (my_socketpair) has validated that this is non-NULL */
4197 /* I hereby declare this connection open. May God bless all who cross
4201 abort_tidy_up_and_fail:
4202 errno = ECONNABORTED;
4206 if (sockets[0] != -1)
4207 PerlLIO_close(sockets[0]);
4208 if (sockets[1] != -1)
4209 PerlLIO_close(sockets[1]);
4214 #endif /* EMULATE_SOCKETPAIR_UDP */
4216 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4218 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4219 /* Stevens says that family must be AF_LOCAL, protocol 0.
4220 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4225 struct sockaddr_in listen_addr;
4226 struct sockaddr_in connect_addr;
4231 || family != AF_UNIX
4234 errno = EAFNOSUPPORT;
4242 #ifdef EMULATE_SOCKETPAIR_UDP
4243 if (type == SOCK_DGRAM)
4244 return S_socketpair_udp(fd);
4247 aTHXa(PERL_GET_THX);
4248 listener = PerlSock_socket(AF_INET, type, 0);
4251 memset(&listen_addr, 0, sizeof(listen_addr));
4252 listen_addr.sin_family = AF_INET;
4253 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4254 listen_addr.sin_port = 0; /* kernel choses port. */
4255 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4256 sizeof(listen_addr)) == -1)
4257 goto tidy_up_and_fail;
4258 if (PerlSock_listen(listener, 1) == -1)
4259 goto tidy_up_and_fail;
4261 connector = PerlSock_socket(AF_INET, type, 0);
4262 if (connector == -1)
4263 goto tidy_up_and_fail;
4264 /* We want to find out the port number to connect to. */
4265 size = sizeof(connect_addr);
4266 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4268 goto tidy_up_and_fail;
4269 if (size != sizeof(connect_addr))
4270 goto abort_tidy_up_and_fail;
4271 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4272 sizeof(connect_addr)) == -1)
4273 goto tidy_up_and_fail;
4275 size = sizeof(listen_addr);
4276 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4279 goto tidy_up_and_fail;
4280 if (size != sizeof(listen_addr))
4281 goto abort_tidy_up_and_fail;
4282 PerlLIO_close(listener);
4283 /* Now check we are talking to ourself by matching port and host on the
4285 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4287 goto tidy_up_and_fail;
4288 if (size != sizeof(connect_addr)
4289 || listen_addr.sin_family != connect_addr.sin_family
4290 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4291 || listen_addr.sin_port != connect_addr.sin_port) {
4292 goto abort_tidy_up_and_fail;
4298 abort_tidy_up_and_fail:
4300 errno = ECONNABORTED; /* This would be the standard thing to do. */
4302 # ifdef ECONNREFUSED
4303 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4305 errno = ETIMEDOUT; /* Desperation time. */
4312 PerlLIO_close(listener);
4313 if (connector != -1)
4314 PerlLIO_close(connector);
4316 PerlLIO_close(acceptor);
4322 /* In any case have a stub so that there's code corresponding
4323 * to the my_socketpair in embed.fnc. */
4325 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4326 #ifdef HAS_SOCKETPAIR
4327 return socketpair(family, type, protocol, fd);
4336 =for apidoc sv_nosharing
4338 Dummy routine which "shares" an SV when there is no sharing module present.
4339 Or "locks" it. Or "unlocks" it. In other
4340 words, ignores its single SV argument.
4341 Exists to avoid test for a NULL function pointer and because it could
4342 potentially warn under some level of strict-ness.
4348 Perl_sv_nosharing(pTHX_ SV *sv)
4350 PERL_UNUSED_CONTEXT;
4351 PERL_UNUSED_ARG(sv);
4356 =for apidoc sv_destroyable
4358 Dummy routine which reports that object can be destroyed when there is no
4359 sharing module present. It ignores its single SV argument, and returns
4360 'true'. Exists to avoid test for a NULL function pointer and because it
4361 could potentially warn under some level of strict-ness.
4367 Perl_sv_destroyable(pTHX_ SV *sv)
4369 PERL_UNUSED_CONTEXT;
4370 PERL_UNUSED_ARG(sv);
4375 Perl_parse_unicode_opts(pTHX_ const char **popt)
4377 const char *p = *popt;
4380 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
4384 opt = (U32) atoi(p);
4387 if (*p && *p != '\n' && *p != '\r') {
4388 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
4390 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4396 case PERL_UNICODE_STDIN:
4397 opt |= PERL_UNICODE_STDIN_FLAG; break;
4398 case PERL_UNICODE_STDOUT:
4399 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4400 case PERL_UNICODE_STDERR:
4401 opt |= PERL_UNICODE_STDERR_FLAG; break;
4402 case PERL_UNICODE_STD:
4403 opt |= PERL_UNICODE_STD_FLAG; break;
4404 case PERL_UNICODE_IN:
4405 opt |= PERL_UNICODE_IN_FLAG; break;
4406 case PERL_UNICODE_OUT:
4407 opt |= PERL_UNICODE_OUT_FLAG; break;
4408 case PERL_UNICODE_INOUT:
4409 opt |= PERL_UNICODE_INOUT_FLAG; break;
4410 case PERL_UNICODE_LOCALE:
4411 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4412 case PERL_UNICODE_ARGV:
4413 opt |= PERL_UNICODE_ARGV_FLAG; break;
4414 case PERL_UNICODE_UTF8CACHEASSERT:
4415 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4417 if (*p != '\n' && *p != '\r') {
4418 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
4421 "Unknown Unicode option letter '%c'", *p);
4428 opt = PERL_UNICODE_DEFAULT_FLAGS;
4430 the_end_of_the_opts_parser:
4432 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4433 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4434 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4442 # include <starlet.h>
4449 * This is really just a quick hack which grabs various garbage
4450 * values. It really should be a real hash algorithm which
4451 * spreads the effect of every input bit onto every output bit,
4452 * if someone who knows about such things would bother to write it.
4453 * Might be a good idea to add that function to CORE as well.
4454 * No numbers below come from careful analysis or anything here,
4455 * except they are primes and SEED_C1 > 1E6 to get a full-width
4456 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4457 * probably be bigger too.
4460 # define SEED_C1 1000003
4461 #define SEED_C4 73819
4463 # define SEED_C1 25747
4464 #define SEED_C4 20639
4468 #define SEED_C5 26107
4470 #ifndef PERL_NO_DEV_RANDOM
4475 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4476 * in 100-ns units, typically incremented ever 10 ms. */
4477 unsigned int when[2];
4479 # ifdef HAS_GETTIMEOFDAY
4480 struct timeval when;
4486 /* This test is an escape hatch, this symbol isn't set by Configure. */
4487 #ifndef PERL_NO_DEV_RANDOM
4488 #ifndef PERL_RANDOM_DEVICE
4489 /* /dev/random isn't used by default because reads from it will block
4490 * if there isn't enough entropy available. You can compile with
4491 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4492 * is enough real entropy to fill the seed. */
4493 # define PERL_RANDOM_DEVICE "/dev/urandom"
4495 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4497 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4506 _ckvmssts(sys$gettim(when));
4507 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4509 # ifdef HAS_GETTIMEOFDAY
4510 PerlProc_gettimeofday(&when,NULL);
4511 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4514 u = (U32)SEED_C1 * when;
4517 u += SEED_C3 * (U32)PerlProc_getpid();
4518 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4519 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4520 u += SEED_C5 * (U32)PTR2UV(&when);
4526 Perl_get_hash_seed(pTHX_ unsigned char * const seed_buffer)
4531 PERL_ARGS_ASSERT_GET_HASH_SEED;
4533 env_pv= PerlEnv_getenv("PERL_HASH_SEED");
4536 #ifndef USE_HASH_SEED_EXPLICIT
4538 /* ignore leading spaces */
4539 while (isSPACE(*env_pv))
4541 #ifdef USE_PERL_PERTURB_KEYS
4542 /* if they set it to "0" we disable key traversal randomization completely */
4543 if (strEQ(env_pv,"0")) {
4544 PL_hash_rand_bits_enabled= 0;
4546 /* otherwise switch to deterministic mode */
4547 PL_hash_rand_bits_enabled= 2;
4550 /* ignore a leading 0x... if it is there */
4551 if (env_pv[0] == '0' && env_pv[1] == 'x')
4554 for( i = 0; isXDIGIT(*env_pv) && i < PERL_HASH_SEED_BYTES; i++ ) {
4555 seed_buffer[i] = READ_XDIGIT(env_pv) << 4;
4556 if ( isXDIGIT(*env_pv)) {
4557 seed_buffer[i] |= READ_XDIGIT(env_pv);
4560 while (isSPACE(*env_pv))
4563 if (*env_pv && !isXDIGIT(*env_pv)) {
4564 Perl_warn(aTHX_ "perl: warning: Non hex character in '$ENV{PERL_HASH_SEED}', seed only partially set\n");
4566 /* should we check for unparsed crap? */
4567 /* should we warn about unused hex? */
4568 /* should we warn about insufficient hex? */
4573 (void)seedDrand01((Rand_seed_t)seed());
4575 for( i = 0; i < PERL_HASH_SEED_BYTES; i++ ) {
4576 seed_buffer[i] = (unsigned char)(Drand01() * (U8_MAX+1));
4579 #ifdef USE_PERL_PERTURB_KEYS
4580 { /* initialize PL_hash_rand_bits from the hash seed.
4581 * This value is highly volatile, it is updated every
4582 * hash insert, and is used as part of hash bucket chain
4583 * randomization and hash iterator randomization. */
4584 PL_hash_rand_bits= 0xbe49d17f; /* I just picked a number */
4585 for( i = 0; i < sizeof(UV) ; i++ ) {
4586 PL_hash_rand_bits += seed_buffer[i % PERL_HASH_SEED_BYTES];
4587 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,8);
4590 env_pv= PerlEnv_getenv("PERL_PERTURB_KEYS");
4592 if (strEQ(env_pv,"0") || strEQ(env_pv,"NO")) {
4593 PL_hash_rand_bits_enabled= 0;
4594 } else if (strEQ(env_pv,"1") || strEQ(env_pv,"RANDOM")) {
4595 PL_hash_rand_bits_enabled= 1;
4596 } else if (strEQ(env_pv,"2") || strEQ(env_pv,"DETERMINISTIC")) {
4597 PL_hash_rand_bits_enabled= 2;
4599 Perl_warn(aTHX_ "perl: warning: strange setting in '$ENV{PERL_PERTURB_KEYS}': '%s'\n", env_pv);
4605 #ifdef PERL_GLOBAL_STRUCT
4607 #define PERL_GLOBAL_STRUCT_INIT
4608 #include "opcode.h" /* the ppaddr and check */
4611 Perl_init_global_struct(pTHX)
4613 struct perl_vars *plvarsp = NULL;
4614 # ifdef PERL_GLOBAL_STRUCT
4615 const IV nppaddr = C_ARRAY_LENGTH(Gppaddr);
4616 const IV ncheck = C_ARRAY_LENGTH(Gcheck);
4617 PERL_UNUSED_CONTEXT;
4618 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4619 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4620 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4624 plvarsp = PL_VarsPtr;
4625 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4630 # define PERLVAR(prefix,var,type) /**/
4631 # define PERLVARA(prefix,var,n,type) /**/
4632 # define PERLVARI(prefix,var,type,init) plvarsp->prefix##var = init;
4633 # define PERLVARIC(prefix,var,type,init) plvarsp->prefix##var = init;
4634 # include "perlvars.h"
4639 # ifdef PERL_GLOBAL_STRUCT
4642 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4643 if (!plvarsp->Gppaddr)
4647 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4648 if (!plvarsp->Gcheck)
4650 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4651 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4653 # ifdef PERL_SET_VARS
4654 PERL_SET_VARS(plvarsp);
4656 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4657 plvarsp->Gsv_placeholder.sv_flags = 0;
4658 memset(plvarsp->Ghash_seed, 0, sizeof(plvarsp->Ghash_seed));
4660 # undef PERL_GLOBAL_STRUCT_INIT
4665 #endif /* PERL_GLOBAL_STRUCT */
4667 #ifdef PERL_GLOBAL_STRUCT
4670 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4672 int veto = plvarsp->Gveto_cleanup;
4674 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
4675 PERL_UNUSED_CONTEXT;
4676 # ifdef PERL_GLOBAL_STRUCT
4677 # ifdef PERL_UNSET_VARS
4678 PERL_UNSET_VARS(plvarsp);
4682 free(plvarsp->Gppaddr);
4683 free(plvarsp->Gcheck);
4684 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4690 #endif /* PERL_GLOBAL_STRUCT */
4694 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
4695 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
4696 * given, and you supply your own implementation.
4698 * The default implementation reads a single env var, PERL_MEM_LOG,
4699 * expecting one or more of the following:
4701 * \d+ - fd fd to write to : must be 1st (atoi)
4702 * 'm' - memlog was PERL_MEM_LOG=1
4703 * 's' - svlog was PERL_SV_LOG=1
4704 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
4706 * This makes the logger controllable enough that it can reasonably be
4707 * added to the system perl.
4710 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
4711 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
4713 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
4715 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
4716 * writes to. In the default logger, this is settable at runtime.
4718 #ifndef PERL_MEM_LOG_FD
4719 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
4722 #ifndef PERL_MEM_LOG_NOIMPL
4724 # ifdef DEBUG_LEAKING_SCALARS
4725 # define SV_LOG_SERIAL_FMT " [%lu]"
4726 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
4728 # define SV_LOG_SERIAL_FMT
4729 # define _SV_LOG_SERIAL_ARG(sv)
4733 S_mem_log_common(enum mem_log_type mlt, const UV n,
4734 const UV typesize, const char *type_name, const SV *sv,
4735 Malloc_t oldalloc, Malloc_t newalloc,
4736 const char *filename, const int linenumber,
4737 const char *funcname)
4741 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
4743 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
4746 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
4748 /* We can't use SVs or PerlIO for obvious reasons,
4749 * so we'll use stdio and low-level IO instead. */
4750 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
4752 # ifdef HAS_GETTIMEOFDAY
4753 # define MEM_LOG_TIME_FMT "%10d.%06d: "
4754 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
4756 gettimeofday(&tv, 0);
4758 # define MEM_LOG_TIME_FMT "%10d: "
4759 # define MEM_LOG_TIME_ARG (int)when
4763 /* If there are other OS specific ways of hires time than
4764 * gettimeofday() (see ext/Time-HiRes), the easiest way is
4765 * probably that they would be used to fill in the struct
4769 int fd = atoi(pmlenv);
4771 fd = PERL_MEM_LOG_FD;
4773 if (strchr(pmlenv, 't')) {
4774 len = my_snprintf(buf, sizeof(buf),
4775 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
4776 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4780 len = my_snprintf(buf, sizeof(buf),
4781 "alloc: %s:%d:%s: %"IVdf" %"UVuf
4782 " %s = %"IVdf": %"UVxf"\n",
4783 filename, linenumber, funcname, n, typesize,
4784 type_name, n * typesize, PTR2UV(newalloc));
4787 len = my_snprintf(buf, sizeof(buf),
4788 "realloc: %s:%d:%s: %"IVdf" %"UVuf
4789 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
4790 filename, linenumber, funcname, n, typesize,
4791 type_name, n * typesize, PTR2UV(oldalloc),
4795 len = my_snprintf(buf, sizeof(buf),
4796 "free: %s:%d:%s: %"UVxf"\n",
4797 filename, linenumber, funcname,
4802 len = my_snprintf(buf, sizeof(buf),
4803 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
4804 mlt == MLT_NEW_SV ? "new" : "del",
4805 filename, linenumber, funcname,
4806 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
4811 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4815 #endif /* !PERL_MEM_LOG_NOIMPL */
4817 #ifndef PERL_MEM_LOG_NOIMPL
4819 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
4820 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
4822 /* this is suboptimal, but bug compatible. User is providing their
4823 own implementation, but is getting these functions anyway, and they
4824 do nothing. But _NOIMPL users should be able to cope or fix */
4826 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
4827 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
4831 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
4833 const char *filename, const int linenumber,
4834 const char *funcname)
4836 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
4837 NULL, NULL, newalloc,
4838 filename, linenumber, funcname);
4843 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
4844 Malloc_t oldalloc, Malloc_t newalloc,
4845 const char *filename, const int linenumber,
4846 const char *funcname)
4848 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
4849 NULL, oldalloc, newalloc,
4850 filename, linenumber, funcname);
4855 Perl_mem_log_free(Malloc_t oldalloc,
4856 const char *filename, const int linenumber,
4857 const char *funcname)
4859 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
4860 filename, linenumber, funcname);
4865 Perl_mem_log_new_sv(const SV *sv,
4866 const char *filename, const int linenumber,
4867 const char *funcname)
4869 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
4870 filename, linenumber, funcname);
4874 Perl_mem_log_del_sv(const SV *sv,
4875 const char *filename, const int linenumber,
4876 const char *funcname)
4878 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
4879 filename, linenumber, funcname);
4882 #endif /* PERL_MEM_LOG */
4885 =for apidoc my_sprintf
4887 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
4888 the length of the string written to the buffer. Only rare pre-ANSI systems
4889 need the wrapper function - usually this is a direct call to C<sprintf>.
4893 #ifndef SPRINTF_RETURNS_STRLEN
4895 Perl_my_sprintf(char *buffer, const char* pat, ...)
4898 PERL_ARGS_ASSERT_MY_SPRINTF;
4899 va_start(args, pat);
4900 vsprintf(buffer, pat, args);
4902 return strlen(buffer);
4907 =for apidoc my_snprintf
4909 The C library C<snprintf> functionality, if available and
4910 standards-compliant (uses C<vsnprintf>, actually). However, if the
4911 C<vsnprintf> is not available, will unfortunately use the unsafe
4912 C<vsprintf> which can overrun the buffer (there is an overrun check,
4913 but that may be too late). Consider using C<sv_vcatpvf> instead, or
4914 getting C<vsnprintf>.
4919 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
4923 PERL_ARGS_ASSERT_MY_SNPRINTF;
4924 #ifndef HAS_VSNPRINTF
4925 PERL_UNUSED_VAR(len);
4927 va_start(ap, format);
4928 #ifdef HAS_VSNPRINTF
4929 retval = vsnprintf(buffer, len, format, ap);
4931 retval = vsprintf(buffer, format, ap);
4934 /* vsprintf() shows failure with < 0 */
4936 #ifdef HAS_VSNPRINTF
4937 /* vsnprintf() shows failure with >= len */
4939 (len > 0 && (Size_t)retval >= len)
4942 Perl_croak_nocontext("panic: my_snprintf buffer overflow");
4947 =for apidoc my_vsnprintf
4949 The C library C<vsnprintf> if available and standards-compliant.
4950 However, if if the C<vsnprintf> is not available, will unfortunately
4951 use the unsafe C<vsprintf> which can overrun the buffer (there is an
4952 overrun check, but that may be too late). Consider using
4953 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
4958 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
4964 PERL_ARGS_ASSERT_MY_VSNPRINTF;
4965 #ifndef HAS_VSNPRINTF
4966 PERL_UNUSED_VAR(len);
4968 Perl_va_copy(ap, apc);
4969 # ifdef HAS_VSNPRINTF
4970 retval = vsnprintf(buffer, len, format, apc);
4972 retval = vsprintf(buffer, format, apc);
4976 # ifdef HAS_VSNPRINTF
4977 retval = vsnprintf(buffer, len, format, ap);
4979 retval = vsprintf(buffer, format, ap);
4981 #endif /* #ifdef NEED_VA_COPY */
4982 /* vsprintf() shows failure with < 0 */
4984 #ifdef HAS_VSNPRINTF
4985 /* vsnprintf() shows failure with >= len */
4987 (len > 0 && (Size_t)retval >= len)
4990 Perl_croak_nocontext("panic: my_vsnprintf buffer overflow");
4995 Perl_my_clearenv(pTHX)
4998 #if ! defined(PERL_MICRO)
4999 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5001 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5002 # if defined(USE_ENVIRON_ARRAY)
5003 # if defined(USE_ITHREADS)
5004 /* only the parent thread can clobber the process environment */
5005 if (PL_curinterp == aTHX)
5006 # endif /* USE_ITHREADS */
5008 # if ! defined(PERL_USE_SAFE_PUTENV)
5009 if ( !PL_use_safe_putenv) {
5011 if (environ == PL_origenviron)
5012 environ = (char**)safesysmalloc(sizeof(char*));
5014 for (i = 0; environ[i]; i++)
5015 (void)safesysfree(environ[i]);
5018 # else /* PERL_USE_SAFE_PUTENV */
5019 # if defined(HAS_CLEARENV)
5021 # elif defined(HAS_UNSETENV)
5022 int bsiz = 80; /* Most envvar names will be shorter than this. */
5023 char *buf = (char*)safesysmalloc(bsiz);
5024 while (*environ != NULL) {
5025 char *e = strchr(*environ, '=');
5026 int l = e ? e - *environ : (int)strlen(*environ);
5028 (void)safesysfree(buf);
5029 bsiz = l + 1; /* + 1 for the \0. */
5030 buf = (char*)safesysmalloc(bsiz);
5032 memcpy(buf, *environ, l);
5034 (void)unsetenv(buf);
5036 (void)safesysfree(buf);
5037 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5038 /* Just null environ and accept the leakage. */
5040 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5041 # endif /* ! PERL_USE_SAFE_PUTENV */
5043 # endif /* USE_ENVIRON_ARRAY */
5044 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5045 #endif /* PERL_MICRO */
5048 #ifdef PERL_IMPLICIT_CONTEXT
5050 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5051 the global PL_my_cxt_index is incremented, and that value is assigned to
5052 that module's static my_cxt_index (who's address is passed as an arg).
5053 Then, for each interpreter this function is called for, it makes sure a
5054 void* slot is available to hang the static data off, by allocating or
5055 extending the interpreter's PL_my_cxt_list array */
5057 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5059 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5063 PERL_ARGS_ASSERT_MY_CXT_INIT;
5065 /* this module hasn't been allocated an index yet */
5066 #if defined(USE_ITHREADS)
5067 MUTEX_LOCK(&PL_my_ctx_mutex);
5069 *index = PL_my_cxt_index++;
5070 #if defined(USE_ITHREADS)
5071 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5075 /* make sure the array is big enough */
5076 if (PL_my_cxt_size <= *index) {
5077 if (PL_my_cxt_size) {
5078 while (PL_my_cxt_size <= *index)
5079 PL_my_cxt_size *= 2;
5080 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5083 PL_my_cxt_size = 16;
5084 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5087 /* newSV() allocates one more than needed */
5088 p = (void*)SvPVX(newSV(size-1));
5089 PL_my_cxt_list[*index] = p;
5090 Zero(p, size, char);
5094 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5097 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5102 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5104 for (index = 0; index < PL_my_cxt_index; index++) {
5105 const char *key = PL_my_cxt_keys[index];
5106 /* try direct pointer compare first - there are chances to success,
5107 * and it's much faster.
5109 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5116 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5122 PERL_ARGS_ASSERT_MY_CXT_INIT;
5124 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5126 /* this module hasn't been allocated an index yet */
5127 #if defined(USE_ITHREADS)
5128 MUTEX_LOCK(&PL_my_ctx_mutex);
5130 index = PL_my_cxt_index++;
5131 #if defined(USE_ITHREADS)
5132 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5136 /* make sure the array is big enough */
5137 if (PL_my_cxt_size <= index) {
5138 int old_size = PL_my_cxt_size;
5140 if (PL_my_cxt_size) {
5141 while (PL_my_cxt_size <= index)
5142 PL_my_cxt_size *= 2;
5143 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5144 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5147 PL_my_cxt_size = 16;
5148 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5149 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5151 for (i = old_size; i < PL_my_cxt_size; i++) {
5152 PL_my_cxt_keys[i] = 0;
5153 PL_my_cxt_list[i] = 0;
5156 PL_my_cxt_keys[index] = my_cxt_key;
5157 /* newSV() allocates one more than needed */
5158 p = (void*)SvPVX(newSV(size-1));
5159 PL_my_cxt_list[index] = p;
5160 Zero(p, size, char);
5163 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5164 #endif /* PERL_IMPLICIT_CONTEXT */
5167 Perl_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
5171 const char *vn = NULL;
5172 SV *const module = PL_stack_base[ax];
5174 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
5176 if (items >= 2) /* version supplied as bootstrap arg */
5177 sv = PL_stack_base[ax + 1];
5179 /* XXX GV_ADDWARN */
5181 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", SVfARG(module), vn), 0);
5182 if (!sv || !SvOK(sv)) {
5184 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", SVfARG(module), vn), 0);
5188 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
5189 SV *pmsv = sv_isobject(sv) && sv_derived_from(sv, "version")
5190 ? sv : sv_2mortal(new_version(sv));
5191 xssv = upg_version(xssv, 0);
5192 if ( vcmp(pmsv,xssv) ) {
5193 SV *string = vstringify(xssv);
5194 SV *xpt = Perl_newSVpvf(aTHX_ "%"SVf" object version %"SVf
5195 " does not match ", SVfARG(module), SVfARG(string));
5197 SvREFCNT_dec(string);
5198 string = vstringify(pmsv);
5201 Perl_sv_catpvf(aTHX_ xpt, "$%"SVf"::%s %"SVf, SVfARG(module), vn,
5204 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %"SVf, SVfARG(string));
5206 SvREFCNT_dec(string);
5208 Perl_sv_2mortal(aTHX_ xpt);
5209 Perl_croak_sv(aTHX_ xpt);
5215 Perl_xs_apiversion_bootcheck(pTHX_ SV *module, const char *api_p,
5219 SV *compver = Perl_newSVpvn_flags(aTHX_ api_p, api_len, SVs_TEMP);
5222 PERL_ARGS_ASSERT_XS_APIVERSION_BOOTCHECK;
5224 /* This might croak */
5225 compver = upg_version(compver, 0);
5226 /* This should never croak */
5227 runver = new_version(PL_apiversion);
5228 if (vcmp(compver, runver)) {
5229 SV *compver_string = vstringify(compver);
5230 SV *runver_string = vstringify(runver);
5231 xpt = Perl_newSVpvf(aTHX_ "Perl API version %"SVf
5232 " of %"SVf" does not match %"SVf,
5233 SVfARG(compver_string), SVfARG(module),
5234 SVfARG(runver_string));
5235 Perl_sv_2mortal(aTHX_ xpt);
5237 SvREFCNT_dec(compver_string);
5238 SvREFCNT_dec(runver_string);
5240 SvREFCNT_dec(runver);
5242 Perl_croak_sv(aTHX_ xpt);
5246 =for apidoc my_strlcat
5248 The C library C<strlcat> if available, or a Perl implementation of it.
5249 This operates on C C<NUL>-terminated strings.
5251 C<my_strlcat()> appends string C<src> to the end of C<dst>. It will append at
5252 most S<C<size - strlen(dst) - 1>> characters. It will then C<NUL>-terminate,
5253 unless C<size> is 0 or the original C<dst> string was longer than C<size> (in
5254 practice this should not happen as it means that either C<size> is incorrect or
5255 that C<dst> is not a proper C<NUL>-terminated string).
5257 Note that C<size> is the full size of the destination buffer and
5258 the result is guaranteed to be C<NUL>-terminated if there is room. Note that
5259 room for the C<NUL> should be included in C<size>.
5263 Description stolen from http://www.openbsd.org/cgi-bin/man.cgi?query=strlcat
5267 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5269 Size_t used, length, copy;
5272 length = strlen(src);
5273 if (size > 0 && used < size - 1) {
5274 copy = (length >= size - used) ? size - used - 1 : length;
5275 memcpy(dst + used, src, copy);
5276 dst[used + copy] = '\0';
5278 return used + length;
5284 =for apidoc my_strlcpy
5286 The C library C<strlcpy> if available, or a Perl implementation of it.
5287 This operates on C C<NUL>-terminated strings.
5289 C<my_strlcpy()> copies up to S<C<size - 1>> characters from the string C<src>
5290 to C<dst>, C<NUL>-terminating the result if C<size> is not 0.
5294 Description stolen from http://www.openbsd.org/cgi-bin/man.cgi?query=strlcpy
5298 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5300 Size_t length, copy;
5302 length = strlen(src);
5304 copy = (length >= size) ? size - 1 : length;
5305 memcpy(dst, src, copy);
5312 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5313 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5314 long _ftol( double ); /* Defined by VC6 C libs. */
5315 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5318 PERL_STATIC_INLINE bool
5319 S_gv_has_usable_name(pTHX_ GV *gv)
5323 && HvENAME(GvSTASH(gv))
5324 && (gvp = (GV **)hv_fetchhek(
5325 GvSTASH(gv), GvNAME_HEK(gv), 0
5331 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5333 SV * const dbsv = GvSVn(PL_DBsub);
5334 const bool save_taint = TAINT_get;
5336 /* When we are called from pp_goto (svp is null),
5337 * we do not care about using dbsv to call CV;
5338 * it's for informational purposes only.
5341 PERL_ARGS_ASSERT_GET_DB_SUB;
5345 if (!PERLDB_SUB_NN) {
5349 gv_efullname3(dbsv, gv, NULL);
5351 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5352 || strEQ(GvNAME(gv), "END")
5353 || ( /* Could be imported, and old sub redefined. */
5354 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
5356 !( (SvTYPE(*svp) == SVt_PVGV)
5357 && (GvCV((const GV *)*svp) == cv)
5358 /* Use GV from the stack as a fallback. */
5359 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
5363 /* GV is potentially non-unique, or contain different CV. */
5364 SV * const tmp = newRV(MUTABLE_SV(cv));
5365 sv_setsv(dbsv, tmp);
5369 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
5370 sv_catpvs(dbsv, "::");
5372 dbsv, GvNAME(gv), GvNAMELEN(gv),
5373 GvNAMEUTF8(gv) ? SV_CATUTF8 : SV_CATBYTES
5378 const int type = SvTYPE(dbsv);
5379 if (type < SVt_PVIV && type != SVt_IV)
5380 sv_upgrade(dbsv, SVt_PVIV);
5381 (void)SvIOK_on(dbsv);
5382 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5385 TAINT_IF(save_taint);
5386 #ifdef NO_TAINT_SUPPORT
5387 PERL_UNUSED_VAR(save_taint);
5392 Perl_my_dirfd(DIR * dir) {
5394 /* Most dirfd implementations have problems when passed NULL. */
5399 #elif defined(HAS_DIR_DD_FD)
5402 Perl_croak_nocontext(PL_no_func, "dirfd");
5403 assert(0); /* NOT REACHED */
5409 Perl_get_re_arg(pTHX_ SV *sv) {
5415 sv = MUTABLE_SV(SvRV(sv));
5416 if (SvTYPE(sv) == SVt_REGEXP)
5417 return (REGEXP*) sv;
5424 * This code is derived from drand48() implementation from FreeBSD,
5425 * found in lib/libc/gen/_rand48.c.
5427 * The U64 implementation is original, based on the POSIX
5428 * specification for drand48().
5432 * Copyright (c) 1993 Martin Birgmeier
5433 * All rights reserved.
5435 * You may redistribute unmodified or modified versions of this source
5436 * code provided that the above copyright notice and this and the
5437 * following conditions are retained.
5439 * This software is provided ``as is'', and comes with no warranties
5440 * of any kind. I shall in no event be liable for anything that happens
5441 * to anyone/anything when using this software.
5444 #define FREEBSD_DRAND48_SEED_0 (0x330e)
5446 #ifdef PERL_DRAND48_QUAD
5448 #define DRAND48_MULT U64_CONST(0x5deece66d)
5449 #define DRAND48_ADD 0xb
5450 #define DRAND48_MASK U64_CONST(0xffffffffffff)
5454 #define FREEBSD_DRAND48_SEED_1 (0xabcd)
5455 #define FREEBSD_DRAND48_SEED_2 (0x1234)
5456 #define FREEBSD_DRAND48_MULT_0 (0xe66d)
5457 #define FREEBSD_DRAND48_MULT_1 (0xdeec)
5458 #define FREEBSD_DRAND48_MULT_2 (0x0005)
5459 #define FREEBSD_DRAND48_ADD (0x000b)
5461 const unsigned short _rand48_mult[3] = {
5462 FREEBSD_DRAND48_MULT_0,
5463 FREEBSD_DRAND48_MULT_1,
5464 FREEBSD_DRAND48_MULT_2
5466 const unsigned short _rand48_add = FREEBSD_DRAND48_ADD;
5471 Perl_drand48_init_r(perl_drand48_t *random_state, U32 seed)
5473 PERL_ARGS_ASSERT_DRAND48_INIT_R;
5475 #ifdef PERL_DRAND48_QUAD
5476 *random_state = FREEBSD_DRAND48_SEED_0 + ((U64TYPE)seed << 16);
5478 random_state->seed[0] = FREEBSD_DRAND48_SEED_0;
5479 random_state->seed[1] = (U16) seed;
5480 random_state->seed[2] = (U16) (seed >> 16);
5485 Perl_drand48_r(perl_drand48_t *random_state)
5487 PERL_ARGS_ASSERT_DRAND48_R;
5489 #ifdef PERL_DRAND48_QUAD
5490 *random_state = (*random_state * DRAND48_MULT + DRAND48_ADD)
5493 return ldexp((double)*random_state, -48);
5499 accu = (U32) _rand48_mult[0] * (U32) random_state->seed[0]
5500 + (U32) _rand48_add;
5501 temp[0] = (U16) accu; /* lower 16 bits */
5502 accu >>= sizeof(U16) * 8;
5503 accu += (U32) _rand48_mult[0] * (U32) random_state->seed[1]
5504 + (U32) _rand48_mult[1] * (U32) random_state->seed[0];
5505 temp[1] = (U16) accu; /* middle 16 bits */
5506 accu >>= sizeof(U16) * 8;
5507 accu += _rand48_mult[0] * random_state->seed[2]
5508 + _rand48_mult[1] * random_state->seed[1]
5509 + _rand48_mult[2] * random_state->seed[0];
5510 random_state->seed[0] = temp[0];
5511 random_state->seed[1] = temp[1];
5512 random_state->seed[2] = (U16) accu;
5514 return ldexp((double) random_state->seed[0], -48) +
5515 ldexp((double) random_state->seed[1], -32) +
5516 ldexp((double) random_state->seed[2], -16);
5521 #ifdef USE_C_BACKTRACE
5523 /* Possibly move all this USE_C_BACKTRACE code into a new file. */
5528 /* abfd is the BFD handle. */
5530 /* bfd_syms is the BFD symbol table. */
5532 /* bfd_text is handle to the the ".text" section of the object file. */
5534 /* Since opening the executable and scanning its symbols is quite
5535 * heavy operation, we remember the filename we used the last time,
5536 * and do the opening and scanning only if the filename changes.
5537 * This removes most (but not all) open+scan cycles. */
5538 const char* fname_prev;
5541 /* Given a dl_info, update the BFD context if necessary. */
5542 static void bfd_update(bfd_context* ctx, Dl_info* dl_info)
5544 /* BFD open and scan only if the filename changed. */
5545 if (ctx->fname_prev == NULL ||
5546 strNE(dl_info->dli_fname, ctx->fname_prev)) {
5547 ctx->abfd = bfd_openr(dl_info->dli_fname, 0);
5549 if (bfd_check_format(ctx->abfd, bfd_object)) {
5550 IV symbol_size = bfd_get_symtab_upper_bound(ctx->abfd);
5551 if (symbol_size > 0) {
5552 Safefree(ctx->bfd_syms);
5553 Newx(ctx->bfd_syms, symbol_size, asymbol*);
5555 bfd_get_section_by_name(ctx->abfd, ".text");
5563 ctx->fname_prev = dl_info->dli_fname;
5567 /* Given a raw frame, try to symbolize it and store
5568 * symbol information (source file, line number) away. */
5569 static void bfd_symbolize(bfd_context* ctx,
5572 STRLEN* symbol_name_size,
5574 STRLEN* source_name_size,
5575 STRLEN* source_line)
5577 *symbol_name = NULL;
5578 *symbol_name_size = 0;
5580 IV offset = PTR2IV(raw_frame) - PTR2IV(ctx->bfd_text->vma);
5582 bfd_canonicalize_symtab(ctx->abfd, ctx->bfd_syms) > 0) {
5585 unsigned int line = 0;
5586 if (bfd_find_nearest_line(ctx->abfd, ctx->bfd_text,
5587 ctx->bfd_syms, offset,
5588 &file, &func, &line) &&
5589 file && func && line > 0) {
5590 /* Size and copy the source file, use only
5591 * the basename of the source file.
5593 * NOTE: the basenames are fine for the
5594 * Perl source files, but may not always
5595 * be the best idea for XS files. */
5596 const char *p, *b = NULL;
5597 /* Look for the last slash. */
5598 for (p = file; *p; p++) {
5602 if (b == NULL || *b == 0) {
5605 *source_name_size = p - b + 1;
5606 Newx(*source_name, *source_name_size + 1, char);
5607 Copy(b, *source_name, *source_name_size + 1, char);
5609 *symbol_name_size = strlen(func);
5610 Newx(*symbol_name, *symbol_name_size + 1, char);
5611 Copy(func, *symbol_name, *symbol_name_size + 1, char);
5613 *source_line = line;
5619 #endif /* #ifdef USE_BFD */
5623 /* OS X has no public API for for 'symbolicating' (Apple official term)
5624 * stack addresses to {function_name, source_file, line_number}.
5625 * Good news: there is command line utility atos(1) which does that.
5626 * Bad news 1: it's a command line utility.
5627 * Bad news 2: one needs to have the Developer Tools installed.
5628 * Bad news 3: in newer releases it needs to be run as 'xcrun atos'.
5630 * To recap: we need to open a pipe for reading for a utility which
5631 * might not exist, or exists in different locations, and then parse
5632 * the output. And since this is all for a low-level API, we cannot
5633 * use high-level stuff. Thanks, Apple. */
5636 /* tool is set to the absolute pathname of the tool to use:
5639 /* format is set to a printf format string used for building
5640 * the external command to run. */
5642 /* unavail is set if e.g. xcrun cannot be found, or something
5643 * else happens that makes getting the backtrace dubious. Note,
5644 * however, that the context isn't persistent, the next call to
5645 * get_c_backtrace() will start from scratch. */
5647 /* fname is the current object file name. */
5649 /* object_base_addr is the base address of the shared object. */
5650 void* object_base_addr;
5653 /* Given |dl_info|, updates the context. If the context has been
5654 * marked unavailable, return immediately. If not but the tool has
5655 * not been set, set it to either "xcrun atos" or "atos" (also set the
5656 * format to use for creating commands for piping), or if neither is
5657 * unavailable (one needs the Developer Tools installed), mark the context
5658 * an unavailable. Finally, update the filename (object name),
5659 * and its base address. */
5661 static void atos_update(atos_context* ctx,
5666 if (ctx->tool == NULL) {
5667 const char* tools[] = {
5671 const char* formats[] = {
5672 "/usr/bin/xcrun atos -o '%s' -l %08x %08x 2>&1",
5673 "/usr/bin/atos -d -o '%s' -l %08x %08x 2>&1"
5677 for (i = 0; i < C_ARRAY_LENGTH(tools); i++) {
5678 if (stat(tools[i], &st) == 0 && S_ISREG(st.st_mode)) {
5679 ctx->tool = tools[i];
5680 ctx->format = formats[i];
5684 if (ctx->tool == NULL) {
5685 ctx->unavail = TRUE;
5689 if (ctx->fname == NULL ||
5690 strNE(dl_info->dli_fname, ctx->fname)) {
5691 ctx->fname = dl_info->dli_fname;
5692 ctx->object_base_addr = dl_info->dli_fbase;
5696 /* Given an output buffer end |p| and its |start|, matches
5697 * for the atos output, extracting the source code location
5698 * if possible, returning NULL otherwise. */
5699 static const char* atos_parse(const char* p,
5701 STRLEN* source_name_size,
5702 STRLEN* source_line) {
5703 /* atos() outputs is something like:
5704 * perl_parse (in miniperl) (perl.c:2314)\n\n".
5705 * We cannot use Perl regular expressions, because we need to
5706 * stay low-level. Therefore here we have a rolled-out version
5707 * of a state machine which matches _backwards_from_the_end_ and
5708 * if there's a success, returns the starts of the filename,
5709 * also setting the filename size and the source line number.
5710 * The matched regular expression is roughly "\(.*:\d+\)\s*$" */
5711 const char* source_number_start;
5712 const char* source_name_end;
5713 /* Skip trailing whitespace. */
5714 while (p > start && isspace(*p)) p--;
5715 /* Now we should be at the close paren. */
5716 if (p == start || *p != ')')
5719 /* Now we should be in the line number. */
5720 if (p == start || !isdigit(*p))
5722 /* Skip over the digits. */
5723 while (p > start && isdigit(*p))
5725 /* Now we should be at the colon. */
5726 if (p == start || *p != ':')
5728 source_number_start = p + 1;
5729 source_name_end = p; /* Just beyond the end. */
5731 /* Look for the open paren. */
5732 while (p > start && *p != '(')
5737 *source_name_size = source_name_end - p;
5738 *source_line = atoi(source_number_start);
5742 /* Given a raw frame, read a pipe from the symbolicator (that's the
5743 * technical term) atos, reads the result, and parses the source code
5744 * location. We must stay low-level, so we use snprintf(), pipe(),
5745 * and fread(), and then also parse the output ourselves. */
5746 static void atos_symbolize(atos_context* ctx,
5749 STRLEN* source_name_size,
5750 STRLEN* source_line)
5758 /* Simple security measure: if there's any funny business with
5759 * the object name (used as "-o '%s'" ), leave since at least
5760 * partially the user controls it. */
5761 for (p = ctx->fname; *p; p++) {
5762 if (*p == '\'' || iscntrl(*p)) {
5763 ctx->unavail = TRUE;
5767 cnt = snprintf(cmd, sizeof(cmd), ctx->format,
5768 ctx->fname, ctx->object_base_addr, raw_frame);
5769 if (cnt < sizeof(cmd)) {
5770 /* Undo nostdio.h #defines that disable stdio.
5771 * This is somewhat naughty, but is used elsewhere
5772 * in the core, and affects only OS X. */
5777 FILE* fp = popen(cmd, "r");
5778 /* At the moment we open a new pipe for each stack frame.
5779 * This is naturally somewhat slow, but hopefully generating
5780 * stack traces is never going to in a performance critical path.
5782 * We could play tricks with atos by batching the stack
5783 * addresses to be resolved: atos can either take multiple
5784 * addresses from the command line, or read addresses from
5785 * a file (though the mess of creating temporary files would
5786 * probably negate much of any possible speedup).
5788 * Normally there are only two objects present in the backtrace:
5789 * perl itself, and the libdyld.dylib. (Note that the object
5790 * filenames contain the full pathname, so perl may not always
5791 * be in the same place.) Whenever the object in the
5792 * backtrace changes, the base address also changes.
5794 * The problem with batching the addresses, though, would be
5795 * matching the results with the addresses: the parsing of
5796 * the results is already painful enough with a single address. */
5799 UV cnt = fread(out, 1, sizeof(out), fp);
5800 if (cnt < sizeof(out)) {
5801 const char* p = atos_parse(out + cnt, out,
5806 *source_name_size + 1, char);
5807 Copy(p, *source_name,
5808 *source_name_size + 1, char);
5816 #endif /* #ifdef PERL_DARWIN */
5819 =for apidoc get_c_backtrace
5821 Collects the backtrace (aka "stacktrace") into a single linear
5822 malloced buffer, which the caller B<must> Perl_free_c_backtrace().
5824 Scans the frames back by depth + skip, then drops the skip innermost,
5825 returning at most depth frames.
5831 Perl_get_c_backtrace(pTHX_ int depth, int skip)
5833 /* Note that here we must stay as low-level as possible: Newx(),
5834 * Copy(), Safefree(); since we may be called from anywhere,
5835 * so we should avoid higher level constructs like SVs or AVs.
5837 * Since we are using safesysmalloc() via Newx(), don't try
5838 * getting backtrace() there, unless you like deep recursion. */
5840 /* Currently only implemented with backtrace() and dladdr(),
5841 * for other platforms NULL is returned. */
5843 #if defined(HAS_BACKTRACE) && defined(HAS_DLADDR)
5844 /* backtrace() is available via <execinfo.h> in glibc and in most
5845 * modern BSDs; dladdr() is available via <dlfcn.h>. */
5847 /* We try fetching this many frames total, but then discard
5848 * the |skip| first ones. For the remaining ones we will try
5849 * retrieving more information with dladdr(). */
5850 int try_depth = skip + depth;
5852 /* The addresses (program counters) returned by backtrace(). */
5855 /* Retrieved with dladdr() from the addresses returned by backtrace(). */
5858 /* Sizes _including_ the terminating \0 of the object name
5859 * and symbol name strings. */
5860 STRLEN* object_name_sizes;
5861 STRLEN* symbol_name_sizes;
5864 /* The symbol names comes either from dli_sname,
5865 * or if using BFD, they can come from BFD. */
5866 char** symbol_names;
5869 /* The source code location information. Dug out with e.g. BFD. */
5870 char** source_names;
5871 STRLEN* source_name_sizes;
5872 STRLEN* source_lines;
5874 Perl_c_backtrace* bt = NULL; /* This is what will be returned. */
5875 int got_depth; /* How many frames were returned from backtrace(). */
5876 UV frame_count = 0; /* How many frames we return. */
5877 UV total_bytes = 0; /* The size of the whole returned backtrace. */
5880 bfd_context bfd_ctx;
5883 atos_context atos_ctx;
5886 /* Here are probably possibilities for optimizing. We could for
5887 * example have a struct that contains most of these and then
5888 * allocate |try_depth| of them, saving a bunch of malloc calls.
5889 * Note, however, that |frames| could not be part of that struct
5890 * because backtrace() will want an array of just them. Also be
5891 * careful about the name strings. */
5892 Newx(raw_frames, try_depth, void*);
5893 Newx(dl_infos, try_depth, Dl_info);
5894 Newx(object_name_sizes, try_depth, STRLEN);
5895 Newx(symbol_name_sizes, try_depth, STRLEN);
5896 Newx(source_names, try_depth, char*);
5897 Newx(source_name_sizes, try_depth, STRLEN);
5898 Newx(source_lines, try_depth, STRLEN);
5900 Newx(symbol_names, try_depth, char*);
5903 /* Get the raw frames. */
5904 got_depth = (int)backtrace(raw_frames, try_depth);
5906 /* We use dladdr() instead of backtrace_symbols() because we want
5907 * the full details instead of opaque strings. This is useful for
5908 * two reasons: () the details are needed for further symbolic
5909 * digging, for example in OS X (2) by having the details we fully
5910 * control the output, which in turn is useful when more platforms
5911 * are added: we can keep out output "portable". */
5913 /* We want a single linear allocation, which can then be freed
5914 * with a single swoop. We will do the usual trick of first
5915 * walking over the structure and seeing how much we need to
5916 * allocate, then allocating, and then walking over the structure
5917 * the second time and populating it. */
5919 /* First we must compute the total size of the buffer. */
5920 total_bytes = sizeof(Perl_c_backtrace_header);
5921 if (got_depth > skip) {
5924 bfd_init(); /* Is this safe to call multiple times? */
5925 Zero(&bfd_ctx, 1, bfd_context);
5928 Zero(&atos_ctx, 1, atos_context);
5930 for (i = skip; i < try_depth; i++) {
5931 Dl_info* dl_info = &dl_infos[i];
5933 total_bytes += sizeof(Perl_c_backtrace_frame);
5935 source_names[i] = NULL;
5936 source_name_sizes[i] = 0;
5937 source_lines[i] = 0;
5939 /* Yes, zero from dladdr() is failure. */
5940 if (dladdr(raw_frames[i], dl_info)) {
5941 object_name_sizes[i] =
5942 dl_info->dli_fname ? strlen(dl_info->dli_fname) : 0;
5943 symbol_name_sizes[i] =
5944 dl_info->dli_sname ? strlen(dl_info->dli_sname) : 0;
5946 bfd_update(&bfd_ctx, dl_info);
5947 bfd_symbolize(&bfd_ctx, raw_frames[i],
5949 &symbol_name_sizes[i],
5951 &source_name_sizes[i],
5955 atos_update(&atos_ctx, dl_info);
5956 atos_symbolize(&atos_ctx,
5959 &source_name_sizes[i],
5963 /* Plus ones for the terminating \0. */
5964 total_bytes += object_name_sizes[i] + 1;
5965 total_bytes += symbol_name_sizes[i] + 1;
5966 total_bytes += source_name_sizes[i] + 1;
5974 Safefree(bfd_ctx.bfd_syms);
5978 /* Now we can allocate and populate the result buffer. */
5979 Newxc(bt, total_bytes, char, Perl_c_backtrace);
5980 Zero(bt, total_bytes, char);
5981 bt->header.frame_count = frame_count;
5982 bt->header.total_bytes = total_bytes;
5983 if (frame_count > 0) {
5984 Perl_c_backtrace_frame* frame = bt->frame_info;
5985 char* name_base = (char *)(frame + frame_count);
5986 char* name_curr = name_base; /* Outputting the name strings here. */
5988 for (i = skip; i < skip + frame_count; i++) {
5989 Dl_info* dl_info = &dl_infos[i];
5991 frame->addr = raw_frames[i];
5992 frame->object_base_addr = dl_info->dli_fbase;
5993 frame->symbol_addr = dl_info->dli_saddr;
5995 /* Copies a string, including the \0, and advances the name_curr.
5996 * Also copies the start and the size to the frame. */
5997 #define PERL_C_BACKTRACE_STRCPY(frame, doffset, src, dsize, size) \
5999 Copy(src, name_curr, size, char); \
6000 frame->doffset = name_curr - (char*)bt; \
6001 frame->dsize = size; \
6002 name_curr += size; \
6005 PERL_C_BACKTRACE_STRCPY(frame, object_name_offset,
6007 object_name_size, object_name_sizes[i]);
6010 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6012 symbol_name_size, symbol_name_sizes[i]);
6013 Safefree(symbol_names[i]);
6015 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6017 symbol_name_size, symbol_name_sizes[i]);
6020 PERL_C_BACKTRACE_STRCPY(frame, source_name_offset,
6022 source_name_size, source_name_sizes[i]);
6023 Safefree(source_names[i]);
6025 #undef PERL_C_BACKTRACE_STRCPY
6027 frame->source_line_number = source_lines[i];
6031 assert(total_bytes ==
6032 (UV)(sizeof(Perl_c_backtrace_header) +
6033 frame_count * sizeof(Perl_c_backtrace_frame) +
6034 name_curr - name_base));
6037 Safefree(symbol_names);
6039 Safefree(source_lines);
6040 Safefree(source_name_sizes);
6041 Safefree(source_names);
6042 Safefree(symbol_name_sizes);
6043 Safefree(object_name_sizes);
6044 /* Assuming the strings returned by dladdr() are pointers
6045 * to read-only static memory (the object file), so that
6046 * they do not need freeing (and cannot be). */
6048 Safefree(raw_frames);
6051 PERL_UNUSED_ARGV(depth);
6052 PERL_UNUSED_ARGV(skip);
6058 =for apidoc free_c_backtrace
6060 Deallocates a backtrace received from get_c_bracktrace.
6066 =for apidoc get_c_backtrace_dump
6068 Returns a SV a dump of |depth| frames of the call stack, skipping
6069 the |skip| innermost ones. depth of 20 is usually enough.
6071 The appended output looks like:
6074 1 10e004812:0082 Perl_croak util.c:1716 /usr/bin/perl
6075 2 10df8d6d2:1d72 perl_parse perl.c:3975 /usr/bin/perl
6078 The fields are tab-separated. The first column is the depth (zero
6079 being the innermost non-skipped frame). In the hex:offset, the hex is
6080 where the program counter was in S_parse_body, and the :offset (might
6081 be missing) tells how much inside the S_parse_body the program counter was.
6083 The util.c:1716 is the source code file and line number.
6085 The /usr/bin/perl is obvious (hopefully).
6087 Unknowns are C<"-">. Unknowns can happen unfortunately quite easily:
6088 if the platform doesn't support retrieving the information;
6089 if the binary is missing the debug information;
6090 if the optimizer has transformed the code by for example inlining.
6096 Perl_get_c_backtrace_dump(pTHX_ int depth, int skip)
6098 Perl_c_backtrace* bt;
6100 bt = get_c_backtrace(depth, skip + 1 /* Hide ourselves. */);
6102 Perl_c_backtrace_frame* frame;
6103 SV* dsv = newSVpvs("");
6105 for (i = 0, frame = bt->frame_info;
6106 i < bt->header.frame_count; i++, frame++) {
6107 Perl_sv_catpvf(aTHX_ dsv, "%d", (int)i);
6108 Perl_sv_catpvf(aTHX_ dsv, "\t%p", frame->addr ? frame->addr : "-");
6109 /* Symbol (function) names might disappear without debug info.
6111 * The source code location might disappear in case of the
6112 * optimizer inlining or otherwise rearranging the code. */
6113 if (frame->symbol_addr) {
6114 Perl_sv_catpvf(aTHX_ dsv, ":%04x",
6116 ((char*)frame->addr - (char*)frame->symbol_addr));
6118 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6119 frame->symbol_name_size &&
6120 frame->symbol_name_offset ?
6121 (char*)bt + frame->symbol_name_offset : "-");
6122 if (frame->source_name_size &&
6123 frame->source_name_offset &&
6124 frame->source_line_number) {
6125 Perl_sv_catpvf(aTHX_ dsv, "\t%s:%"UVuf,
6126 (char*)bt + frame->source_name_offset,
6127 (UV)frame->source_line_number);
6129 Perl_sv_catpvf(aTHX_ dsv, "\t-");
6131 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6132 frame->object_name_size &&
6133 frame->object_name_offset ?
6134 (char*)bt + frame->object_name_offset : "-");
6135 /* The frame->object_base_addr is not output,
6136 * but it is used for symbolizing/symbolicating. */
6137 sv_catpvs(dsv, "\n");
6140 Perl_free_c_backtrace(aTHX_ bt);
6149 =for apidoc dump_c_backtrace
6151 Dumps the C backtrace to the given fp.
6153 Returns true if a backtrace could be retrieved, false if not.
6159 Perl_dump_c_backtrace(pTHX_ PerlIO* fp, int depth, int skip)
6163 PERL_ARGS_ASSERT_DUMP_C_BACKTRACE;
6165 sv = Perl_get_c_backtrace_dump(aTHX_ depth, skip);
6168 PerlIO_printf(fp, "%s", SvPV_nolen(sv));
6174 #endif /* #ifdef USE_C_BACKTRACE */
6178 * c-indentation-style: bsd
6180 * indent-tabs-mode: nil
6183 * ex: set ts=8 sts=4 sw=4 et: