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
321 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
324 where = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
326 struct perl_memory_debug_header *const header
327 = (struct perl_memory_debug_header *)where;
330 const MEM_SIZE size = header->size;
332 # ifdef PERL_TRACK_MEMPOOL
333 if (header->interpreter != aTHX) {
334 Perl_croak_nocontext("panic: free from wrong pool, %p!=%p",
335 header->interpreter, aTHX);
338 Perl_croak_nocontext("panic: duplicate free");
341 Perl_croak_nocontext("panic: bad free, header->next==NULL");
342 if (header->next->prev != header || header->prev->next != header) {
343 Perl_croak_nocontext("panic: bad free, ->next->prev=%p, "
344 "header=%p, ->prev->next=%p",
345 header->next->prev, header,
348 /* Unlink us from the chain. */
349 maybe_protect_rw(header->next);
350 header->next->prev = header->prev;
351 maybe_protect_ro(header->next);
352 maybe_protect_rw(header->prev);
353 header->prev->next = header->next;
354 maybe_protect_ro(header->prev);
355 maybe_protect_rw(header);
357 PoisonNew(where, size, char);
359 /* Trigger the duplicate free warning. */
362 # ifdef PERL_DEBUG_READONLY_COW
363 if (munmap(where, size)) {
364 perror("munmap failed");
370 #ifndef PERL_DEBUG_READONLY_COW
376 /* safe version of system's calloc() */
379 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
381 #ifdef ALWAYS_NEED_THX
385 #if defined(USE_MDH) || defined(DEBUGGING)
386 MEM_SIZE total_size = 0;
389 /* Even though calloc() for zero bytes is strange, be robust. */
390 if (size && (count <= MEM_SIZE_MAX / size)) {
391 #if defined(USE_MDH) || defined(DEBUGGING)
392 total_size = size * count;
398 if (PERL_MEMORY_DEBUG_HEADER_SIZE <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
399 total_size += PERL_MEMORY_DEBUG_HEADER_SIZE;
404 if ((SSize_t)size < 0 || (SSize_t)count < 0)
405 Perl_croak_nocontext("panic: calloc, size=%"UVuf", count=%"UVuf,
406 (UV)size, (UV)count);
408 #ifdef PERL_DEBUG_READONLY_COW
409 if ((ptr = mmap(0, total_size ? total_size : 1, PROT_READ|PROT_WRITE,
410 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
411 perror("mmap failed");
414 #elif defined(PERL_TRACK_MEMPOOL)
415 /* Have to use malloc() because we've added some space for our tracking
417 /* malloc(0) is non-portable. */
418 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
420 /* Use calloc() because it might save a memset() if the memory is fresh
421 and clean from the OS. */
423 ptr = (Malloc_t)PerlMem_calloc(count, size);
424 else /* calloc(0) is non-portable. */
425 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
427 PERL_ALLOC_CHECK(ptr);
428 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));
432 struct perl_memory_debug_header *const header
433 = (struct perl_memory_debug_header *)ptr;
435 # ifndef PERL_DEBUG_READONLY_COW
436 memset((void*)ptr, 0, total_size);
438 # ifdef PERL_TRACK_MEMPOOL
439 header->interpreter = aTHX;
440 /* Link us into the list. */
441 header->prev = &PL_memory_debug_header;
442 header->next = PL_memory_debug_header.next;
443 PL_memory_debug_header.next = header;
444 maybe_protect_rw(header->next);
445 header->next->prev = header;
446 maybe_protect_ro(header->next);
447 # ifdef PERL_DEBUG_READONLY_COW
448 header->readonly = 0;
452 header->size = total_size;
454 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
460 #ifndef ALWAYS_NEED_THX
469 /* These must be defined when not using Perl's malloc for binary
474 Malloc_t Perl_malloc (MEM_SIZE nbytes)
477 return (Malloc_t)PerlMem_malloc(nbytes);
480 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
483 return (Malloc_t)PerlMem_calloc(elements, size);
486 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
489 return (Malloc_t)PerlMem_realloc(where, nbytes);
492 Free_t Perl_mfree (Malloc_t where)
500 /* copy a string up to some (non-backslashed) delimiter, if any */
503 Perl_delimcpy(char *to, const char *toend, const char *from, const char *fromend, int delim, I32 *retlen)
507 PERL_ARGS_ASSERT_DELIMCPY;
509 for (tolen = 0; from < fromend; from++, tolen++) {
511 if (from[1] != delim) {
518 else if (*from == delim)
529 /* return ptr to little string in big string, NULL if not found */
530 /* This routine was donated by Corey Satten. */
533 Perl_instr(const char *big, const char *little)
536 PERL_ARGS_ASSERT_INSTR;
538 /* libc prior to 4.6.27 (late 1994) did not work properly on a NULL
542 return strstr((char*)big, (char*)little);
545 /* same as instr but allow embedded nulls. The end pointers point to 1 beyond
546 * the final character desired to be checked */
549 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
551 PERL_ARGS_ASSERT_NINSTR;
555 const char first = *little;
557 bigend -= lend - little++;
559 while (big <= bigend) {
560 if (*big++ == first) {
561 for (x=big,s=little; s < lend; x++,s++) {
565 return (char*)(big-1);
572 /* reverse of the above--find last substring */
575 Perl_rninstr(const char *big, const char *bigend, const char *little, const char *lend)
578 const I32 first = *little;
579 const char * const littleend = lend;
581 PERL_ARGS_ASSERT_RNINSTR;
583 if (little >= littleend)
584 return (char*)bigend;
586 big = bigend - (littleend - little++);
587 while (big >= bigbeg) {
591 for (x=big+2,s=little; s < littleend; /**/ ) {
600 return (char*)(big+1);
605 /* As a space optimization, we do not compile tables for strings of length
606 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
607 special-cased in fbm_instr().
609 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
612 =head1 Miscellaneous Functions
614 =for apidoc fbm_compile
616 Analyses the string in order to make fast searches on it using fbm_instr()
617 -- the Boyer-Moore algorithm.
623 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
631 PERL_DEB( STRLEN rarest = 0 );
633 PERL_ARGS_ASSERT_FBM_COMPILE;
635 if (isGV_with_GP(sv) || SvROK(sv))
641 if (flags & FBMcf_TAIL) {
642 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
643 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
644 if (mg && mg->mg_len >= 0)
647 if (!SvPOK(sv) || SvNIOKp(sv))
648 s = (U8*)SvPV_force_mutable(sv, len);
649 else s = (U8 *)SvPV_mutable(sv, len);
650 if (len == 0) /* TAIL might be on a zero-length string. */
652 SvUPGRADE(sv, SVt_PVMG);
657 /* "deep magic", the comment used to add. The use of MAGIC itself isn't
658 really. MAGIC was originally added in 79072805bf63abe5 (perl 5.0 alpha 2)
659 to call SvVALID_off() if the scalar was assigned to.
661 The comment itself (and "deeper magic" below) date back to
662 378cc40b38293ffc (perl 2.0). "deep magic" was an annotation on
664 where the magic (presumably) was that the scalar had a BM table hidden
667 As MAGIC is always present on BMs [in Perl 5 :-)], we can use it to store
668 the table instead of the previous (somewhat hacky) approach of co-opting
669 the string buffer and storing it after the string. */
671 assert(!mg_find(sv, PERL_MAGIC_bm));
672 mg = sv_magicext(sv, NULL, PERL_MAGIC_bm, &PL_vtbl_bm, NULL, 0);
676 /* Shorter strings are special-cased in Perl_fbm_instr(), and don't use
678 const U8 mlen = (len>255) ? 255 : (U8)len;
679 const unsigned char *const sb = s + len - mlen; /* first char (maybe) */
682 Newx(table, 256, U8);
683 memset((void*)table, mlen, 256);
684 mg->mg_ptr = (char *)table;
687 s += len - 1; /* last char */
690 if (table[*s] == mlen)
696 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
697 for (i = 0; i < len; i++) {
698 if (PL_freq[s[i]] < frequency) {
699 PERL_DEB( rarest = i );
700 frequency = PL_freq[s[i]];
703 BmUSEFUL(sv) = 100; /* Initial value */
704 if (flags & FBMcf_TAIL)
706 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %"UVuf"\n",
707 s[rarest], (UV)rarest));
710 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
711 /* If SvTAIL is actually due to \Z or \z, this gives false positives
715 =for apidoc fbm_instr
717 Returns the location of the SV in the string delimited by C<big> and
718 C<bigend>. It returns C<NULL> if the string can't be found. The C<sv>
719 does not have to be fbm_compiled, but the search will not be as fast
726 Perl_fbm_instr(pTHX_ unsigned char *big, unsigned char *bigend, SV *littlestr, U32 flags)
730 const unsigned char *little = (const unsigned char *)SvPV_const(littlestr,l);
731 STRLEN littlelen = l;
732 const I32 multiline = flags & FBMrf_MULTILINE;
734 PERL_ARGS_ASSERT_FBM_INSTR;
736 if ((STRLEN)(bigend - big) < littlelen) {
737 if ( SvTAIL(littlestr)
738 && ((STRLEN)(bigend - big) == littlelen - 1)
740 || (*big == *little &&
741 memEQ((char *)big, (char *)little, littlelen - 1))))
746 switch (littlelen) { /* Special cases for 0, 1 and 2 */
748 return (char*)big; /* Cannot be SvTAIL! */
750 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
751 /* Know that bigend != big. */
752 if (bigend[-1] == '\n')
753 return (char *)(bigend - 1);
754 return (char *) bigend;
762 if (SvTAIL(littlestr))
763 return (char *) bigend;
766 if (SvTAIL(littlestr) && !multiline) {
767 if (bigend[-1] == '\n' && bigend[-2] == *little)
768 return (char*)bigend - 2;
769 if (bigend[-1] == *little)
770 return (char*)bigend - 1;
774 /* This should be better than FBM if c1 == c2, and almost
775 as good otherwise: maybe better since we do less indirection.
776 And we save a lot of memory by caching no table. */
777 const unsigned char c1 = little[0];
778 const unsigned char c2 = little[1];
783 while (s <= bigend) {
793 goto check_1char_anchor;
804 goto check_1char_anchor;
807 while (s <= bigend) {
812 goto check_1char_anchor;
821 check_1char_anchor: /* One char and anchor! */
822 if (SvTAIL(littlestr) && (*bigend == *little))
823 return (char *)bigend; /* bigend is already decremented. */
826 break; /* Only lengths 0 1 and 2 have special-case code. */
829 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
830 s = bigend - littlelen;
831 if (s >= big && bigend[-1] == '\n' && *s == *little
832 /* Automatically of length > 2 */
833 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
835 return (char*)s; /* how sweet it is */
838 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
840 return (char*)s + 1; /* how sweet it is */
844 if (!SvVALID(littlestr)) {
845 char * const b = ninstr((char*)big,(char*)bigend,
846 (char*)little, (char*)little + littlelen);
848 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
849 /* Chop \n from littlestr: */
850 s = bigend - littlelen + 1;
852 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
862 if (littlelen > (STRLEN)(bigend - big))
866 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
867 const unsigned char *oldlittle;
871 --littlelen; /* Last char found by table lookup */
874 little += littlelen; /* last char */
877 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
881 if ((tmp = table[*s])) {
882 if ((s += tmp) < bigend)
886 else { /* less expensive than calling strncmp() */
887 unsigned char * const olds = s;
892 if (*--s == *--little)
894 s = olds + 1; /* here we pay the price for failure */
896 if (s < bigend) /* fake up continue to outer loop */
906 && memEQ((char *)(bigend - littlelen),
907 (char *)(oldlittle - littlelen), littlelen) )
908 return (char*)bigend - littlelen;
914 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
917 PERL_ARGS_ASSERT_SCREAMINSTR;
918 PERL_UNUSED_ARG(bigstr);
919 PERL_UNUSED_ARG(littlestr);
920 PERL_UNUSED_ARG(start_shift);
921 PERL_UNUSED_ARG(end_shift);
922 PERL_UNUSED_ARG(old_posp);
923 PERL_UNUSED_ARG(last);
925 /* This function must only ever be called on a scalar with study magic,
926 but those do not happen any more. */
927 Perl_croak(aTHX_ "panic: screaminstr");
928 NORETURN_FUNCTION_END;
934 Returns true if the leading len bytes of the strings s1 and s2 are the same
935 case-insensitively; false otherwise. Uppercase and lowercase ASCII range bytes
936 match themselves and their opposite case counterparts. Non-cased and non-ASCII
937 range bytes match only themselves.
944 Perl_foldEQ(const char *s1, const char *s2, I32 len)
946 const U8 *a = (const U8 *)s1;
947 const U8 *b = (const U8 *)s2;
949 PERL_ARGS_ASSERT_FOLDEQ;
954 if (*a != *b && *a != PL_fold[*b])
961 Perl_foldEQ_latin1(const char *s1, const char *s2, I32 len)
963 /* Compare non-utf8 using Unicode (Latin1) semantics. Does not work on
964 * MICRO_SIGN, LATIN_SMALL_LETTER_SHARP_S, nor
965 * LATIN_SMALL_LETTER_Y_WITH_DIAERESIS, and does not check for these. Nor
966 * does it check that the strings each have at least 'len' characters */
968 const U8 *a = (const U8 *)s1;
969 const U8 *b = (const U8 *)s2;
971 PERL_ARGS_ASSERT_FOLDEQ_LATIN1;
976 if (*a != *b && *a != PL_fold_latin1[*b]) {
985 =for apidoc foldEQ_locale
987 Returns true if the leading len bytes of the strings s1 and s2 are the same
988 case-insensitively in the current locale; false otherwise.
994 Perl_foldEQ_locale(const char *s1, const char *s2, I32 len)
997 const U8 *a = (const U8 *)s1;
998 const U8 *b = (const U8 *)s2;
1000 PERL_ARGS_ASSERT_FOLDEQ_LOCALE;
1005 if (*a != *b && *a != PL_fold_locale[*b])
1012 /* copy a string to a safe spot */
1015 =head1 Memory Management
1019 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1020 string which is a duplicate of C<pv>. The size of the string is
1021 determined by C<strlen()>, which means it may not contain embedded C<NUL>
1022 characters and must have a trailing C<NUL>. The memory allocated for the new
1023 string can be freed with the C<Safefree()> function.
1025 On some platforms, Windows for example, all allocated memory owned by a thread
1026 is deallocated when that thread ends. So if you need that not to happen, you
1027 need to use the shared memory functions, such as C<L</savesharedpv>>.
1033 Perl_savepv(pTHX_ const char *pv)
1035 PERL_UNUSED_CONTEXT;
1040 const STRLEN pvlen = strlen(pv)+1;
1041 Newx(newaddr, pvlen, char);
1042 return (char*)memcpy(newaddr, pv, pvlen);
1046 /* same thing but with a known length */
1051 Perl's version of what C<strndup()> would be if it existed. Returns a
1052 pointer to a newly allocated string which is a duplicate of the first
1053 C<len> bytes from C<pv>, plus a trailing
1054 C<NUL> byte. The memory allocated for
1055 the new string can be freed with the C<Safefree()> function.
1057 On some platforms, Windows for example, all allocated memory owned by a thread
1058 is deallocated when that thread ends. So if you need that not to happen, you
1059 need to use the shared memory functions, such as C<L</savesharedpvn>>.
1065 Perl_savepvn(pTHX_ const char *pv, I32 len)
1068 PERL_UNUSED_CONTEXT;
1072 Newx(newaddr,len+1,char);
1073 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1075 /* might not be null terminated */
1076 newaddr[len] = '\0';
1077 return (char *) CopyD(pv,newaddr,len,char);
1080 return (char *) ZeroD(newaddr,len+1,char);
1085 =for apidoc savesharedpv
1087 A version of C<savepv()> which allocates the duplicate string in memory
1088 which is shared between threads.
1093 Perl_savesharedpv(pTHX_ const char *pv)
1098 PERL_UNUSED_CONTEXT;
1103 pvlen = strlen(pv)+1;
1104 newaddr = (char*)PerlMemShared_malloc(pvlen);
1108 return (char*)memcpy(newaddr, pv, pvlen);
1112 =for apidoc savesharedpvn
1114 A version of C<savepvn()> which allocates the duplicate string in memory
1115 which is shared between threads. (With the specific difference that a NULL
1116 pointer is not acceptable)
1121 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1123 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1125 PERL_UNUSED_CONTEXT;
1126 /* PERL_ARGS_ASSERT_SAVESHAREDPVN; */
1131 newaddr[len] = '\0';
1132 return (char*)memcpy(newaddr, pv, len);
1136 =for apidoc savesvpv
1138 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1139 the passed in SV using C<SvPV()>
1141 On some platforms, Windows for example, all allocated memory owned by a thread
1142 is deallocated when that thread ends. So if you need that not to happen, you
1143 need to use the shared memory functions, such as C<L</savesharedsvpv>>.
1149 Perl_savesvpv(pTHX_ SV *sv)
1152 const char * const pv = SvPV_const(sv, len);
1155 PERL_ARGS_ASSERT_SAVESVPV;
1158 Newx(newaddr,len,char);
1159 return (char *) CopyD(pv,newaddr,len,char);
1163 =for apidoc savesharedsvpv
1165 A version of C<savesharedpv()> which allocates the duplicate string in
1166 memory which is shared between threads.
1172 Perl_savesharedsvpv(pTHX_ SV *sv)
1175 const char * const pv = SvPV_const(sv, len);
1177 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1179 return savesharedpvn(pv, len);
1182 /* the SV for Perl_form() and mess() is not kept in an arena */
1191 if (PL_phase != PERL_PHASE_DESTRUCT)
1192 return newSVpvs_flags("", SVs_TEMP);
1197 /* Create as PVMG now, to avoid any upgrading later */
1199 Newxz(any, 1, XPVMG);
1200 SvFLAGS(sv) = SVt_PVMG;
1201 SvANY(sv) = (void*)any;
1203 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1208 #if defined(PERL_IMPLICIT_CONTEXT)
1210 Perl_form_nocontext(const char* pat, ...)
1215 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1216 va_start(args, pat);
1217 retval = vform(pat, &args);
1221 #endif /* PERL_IMPLICIT_CONTEXT */
1224 =head1 Miscellaneous Functions
1227 Takes a sprintf-style format pattern and conventional
1228 (non-SV) arguments and returns the formatted string.
1230 (char *) Perl_form(pTHX_ const char* pat, ...)
1232 can be used any place a string (char *) is required:
1234 char * s = Perl_form("%d.%d",major,minor);
1236 Uses a single private buffer so if you want to format several strings you
1237 must explicitly copy the earlier strings away (and free the copies when you
1244 Perl_form(pTHX_ const char* pat, ...)
1248 PERL_ARGS_ASSERT_FORM;
1249 va_start(args, pat);
1250 retval = vform(pat, &args);
1256 Perl_vform(pTHX_ const char *pat, va_list *args)
1258 SV * const sv = mess_alloc();
1259 PERL_ARGS_ASSERT_VFORM;
1260 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1265 =for apidoc Am|SV *|mess|const char *pat|...
1267 Take a sprintf-style format pattern and argument list. These are used to
1268 generate a string message. If the message does not end with a newline,
1269 then it will be extended with some indication of the current location
1270 in the code, as described for L</mess_sv>.
1272 Normally, the resulting message is returned in a new mortal SV.
1273 During global destruction a single SV may be shared between uses of
1279 #if defined(PERL_IMPLICIT_CONTEXT)
1281 Perl_mess_nocontext(const char *pat, ...)
1286 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1287 va_start(args, pat);
1288 retval = vmess(pat, &args);
1292 #endif /* PERL_IMPLICIT_CONTEXT */
1295 Perl_mess(pTHX_ const char *pat, ...)
1299 PERL_ARGS_ASSERT_MESS;
1300 va_start(args, pat);
1301 retval = vmess(pat, &args);
1307 Perl_closest_cop(pTHX_ const COP *cop, const OP *o, const OP *curop,
1311 /* Look for curop starting from o. cop is the last COP we've seen. */
1312 /* opnext means that curop is actually the ->op_next of the op we are
1315 PERL_ARGS_ASSERT_CLOSEST_COP;
1317 if (!o || !curop || (
1318 opnext ? o->op_next == curop && o->op_type != OP_SCOPE : o == curop
1322 if (o->op_flags & OPf_KIDS) {
1324 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1327 /* If the OP_NEXTSTATE has been optimised away we can still use it
1328 * the get the file and line number. */
1330 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1331 cop = (const COP *)kid;
1333 /* Keep searching, and return when we've found something. */
1335 new_cop = closest_cop(cop, kid, curop, opnext);
1341 /* Nothing found. */
1347 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1349 Expands a message, intended for the user, to include an indication of
1350 the current location in the code, if the message does not already appear
1353 C<basemsg> is the initial message or object. If it is a reference, it
1354 will be used as-is and will be the result of this function. Otherwise it
1355 is used as a string, and if it already ends with a newline, it is taken
1356 to be complete, and the result of this function will be the same string.
1357 If the message does not end with a newline, then a segment such as C<at
1358 foo.pl line 37> will be appended, and possibly other clauses indicating
1359 the current state of execution. The resulting message will end with a
1362 Normally, the resulting message is returned in a new mortal SV.
1363 During global destruction a single SV may be shared between uses of this
1364 function. If C<consume> is true, then the function is permitted (but not
1365 required) to modify and return C<basemsg> instead of allocating a new SV.
1371 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1376 #if defined(USE_C_BACKTRACE) && defined(USE_C_BACKTRACE_ON_ERROR)
1380 /* The PERL_C_BACKTRACE_ON_WARN must be an integer of one or more. */
1381 if ((ws = PerlEnv_getenv("PERL_C_BACKTRACE_ON_ERROR")) &&
1382 (wi = atoi(ws)) > 0) {
1383 Perl_dump_c_backtrace(aTHX_ Perl_debug_log, wi, 1);
1388 PERL_ARGS_ASSERT_MESS_SV;
1390 if (SvROK(basemsg)) {
1396 sv_setsv(sv, basemsg);
1401 if (SvPOK(basemsg) && consume) {
1406 sv_copypv(sv, basemsg);
1409 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1411 * Try and find the file and line for PL_op. This will usually be
1412 * PL_curcop, but it might be a cop that has been optimised away. We
1413 * can try to find such a cop by searching through the optree starting
1414 * from the sibling of PL_curcop.
1418 closest_cop(PL_curcop, PL_curcop->op_sibling, PL_op, FALSE);
1423 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1424 OutCopFILE(cop), (IV)CopLINE(cop));
1425 /* Seems that GvIO() can be untrustworthy during global destruction. */
1426 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1427 && IoLINES(GvIOp(PL_last_in_gv)))
1430 const bool line_mode = (RsSIMPLE(PL_rs) &&
1431 *SvPV_const(PL_rs,l) == '\n' && l == 1);
1432 Perl_sv_catpvf(aTHX_ sv, ", <%"SVf"> %s %"IVdf,
1433 SVfARG(PL_last_in_gv == PL_argvgv
1435 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1436 line_mode ? "line" : "chunk",
1437 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1439 if (PL_phase == PERL_PHASE_DESTRUCT)
1440 sv_catpvs(sv, " during global destruction");
1441 sv_catpvs(sv, ".\n");
1447 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1449 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1450 argument list. These are used to generate a string message. If the
1451 message does not end with a newline, then it will be extended with
1452 some indication of the current location in the code, as described for
1455 Normally, the resulting message is returned in a new mortal SV.
1456 During global destruction a single SV may be shared between uses of
1463 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)
1481 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1483 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1484 && (io = GvIO(PL_stderrgv))
1485 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1486 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, SV_CONST(PRINT),
1487 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1489 PerlIO * const serr = Perl_error_log;
1491 do_print(msv, serr);
1492 (void)PerlIO_flush(serr);
1497 =head1 Warning and Dieing
1500 /* Common code used in dieing and warning */
1503 S_with_queued_errors(pTHX_ SV *ex)
1505 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1506 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1507 sv_catsv(PL_errors, ex);
1508 ex = sv_mortalcopy(PL_errors);
1509 SvCUR_set(PL_errors, 0);
1515 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1521 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1522 /* sv_2cv might call Perl_croak() or Perl_warner() */
1523 SV * const oldhook = *hook;
1531 cv = sv_2cv(oldhook, &stash, &gv, 0);
1533 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1543 exarg = newSVsv(ex);
1544 SvREADONLY_on(exarg);
1547 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1551 call_sv(MUTABLE_SV(cv), G_DISCARD);
1560 =for apidoc Am|OP *|die_sv|SV *baseex
1562 Behaves the same as L</croak_sv>, except for the return type.
1563 It should be used only where the C<OP *> return type is required.
1564 The function never actually returns.
1570 Perl_die_sv(pTHX_ SV *baseex)
1572 PERL_ARGS_ASSERT_DIE_SV;
1574 assert(0); /* NOTREACHED */
1575 NORETURN_FUNCTION_END;
1579 =for apidoc Am|OP *|die|const char *pat|...
1581 Behaves the same as L</croak>, except for the return type.
1582 It should be used only where the C<OP *> return type is required.
1583 The function never actually returns.
1588 #if defined(PERL_IMPLICIT_CONTEXT)
1590 Perl_die_nocontext(const char* pat, ...)
1594 va_start(args, pat);
1596 assert(0); /* NOTREACHED */
1598 NORETURN_FUNCTION_END;
1600 #endif /* PERL_IMPLICIT_CONTEXT */
1603 Perl_die(pTHX_ const char* pat, ...)
1606 va_start(args, pat);
1608 assert(0); /* NOTREACHED */
1610 NORETURN_FUNCTION_END;
1614 =for apidoc Am|void|croak_sv|SV *baseex
1616 This is an XS interface to Perl's C<die> function.
1618 C<baseex> is the error message or object. If it is a reference, it
1619 will be used as-is. Otherwise it is used as a string, and if it does
1620 not end with a newline then it will be extended with some indication of
1621 the current location in the code, as described for L</mess_sv>.
1623 The error message or object will be used as an exception, by default
1624 returning control to the nearest enclosing C<eval>, but subject to
1625 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1626 function never returns normally.
1628 To die with a simple string message, the L</croak> function may be
1635 Perl_croak_sv(pTHX_ SV *baseex)
1637 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1638 PERL_ARGS_ASSERT_CROAK_SV;
1639 invoke_exception_hook(ex, FALSE);
1644 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1646 This is an XS interface to Perl's C<die> function.
1648 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1649 argument list. These are used to generate a string message. If the
1650 message does not end with a newline, then it will be extended with
1651 some indication of the current location in the code, as described for
1654 The error message will be used as an exception, by default
1655 returning control to the nearest enclosing C<eval>, but subject to
1656 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1657 function never returns normally.
1659 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1660 (C<$@>) will be used as an error message or object instead of building an
1661 error message from arguments. If you want to throw a non-string object,
1662 or build an error message in an SV yourself, it is preferable to use
1663 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1669 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1671 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1672 invoke_exception_hook(ex, FALSE);
1677 =for apidoc Am|void|croak|const char *pat|...
1679 This is an XS interface to Perl's C<die> function.
1681 Take a sprintf-style format pattern and argument list. These are used to
1682 generate a string message. If the message does not end with a newline,
1683 then it will be extended with some indication of the current location
1684 in the code, as described for L</mess_sv>.
1686 The error message will be used as an exception, by default
1687 returning control to the nearest enclosing C<eval>, but subject to
1688 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1689 function never returns normally.
1691 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1692 (C<$@>) will be used as an error message or object instead of building an
1693 error message from arguments. If you want to throw a non-string object,
1694 or build an error message in an SV yourself, it is preferable to use
1695 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1700 #if defined(PERL_IMPLICIT_CONTEXT)
1702 Perl_croak_nocontext(const char *pat, ...)
1706 va_start(args, pat);
1708 assert(0); /* NOTREACHED */
1711 #endif /* PERL_IMPLICIT_CONTEXT */
1714 Perl_croak(pTHX_ const char *pat, ...)
1717 va_start(args, pat);
1719 assert(0); /* NOTREACHED */
1724 =for apidoc Am|void|croak_no_modify
1726 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1727 terser object code than using C<Perl_croak>. Less code used on exception code
1728 paths reduces CPU cache pressure.
1734 Perl_croak_no_modify(void)
1736 Perl_croak_nocontext( "%s", PL_no_modify);
1739 /* does not return, used in util.c perlio.c and win32.c
1740 This is typically called when malloc returns NULL.
1743 Perl_croak_no_mem(void)
1747 int fd = PerlIO_fileno(Perl_error_log);
1749 SETERRNO(EBADF,RMS_IFI);
1751 /* Can't use PerlIO to write as it allocates memory */
1752 PERL_UNUSED_RESULT(PerlLIO_write(fd, PL_no_mem, sizeof(PL_no_mem)-1));
1757 /* does not return, used only in POPSTACK */
1759 Perl_croak_popstack(void)
1762 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");
1767 =for apidoc Am|void|warn_sv|SV *baseex
1769 This is an XS interface to Perl's C<warn> function.
1771 C<baseex> is the error message or object. If it is a reference, it
1772 will be used as-is. Otherwise it is used as a string, and if it does
1773 not end with a newline then it will be extended with some indication of
1774 the current location in the code, as described for L</mess_sv>.
1776 The error message or object will by default be written to standard error,
1777 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1779 To warn with a simple string message, the L</warn> function may be
1786 Perl_warn_sv(pTHX_ SV *baseex)
1788 SV *ex = mess_sv(baseex, 0);
1789 PERL_ARGS_ASSERT_WARN_SV;
1790 if (!invoke_exception_hook(ex, TRUE))
1791 write_to_stderr(ex);
1795 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1797 This is an XS interface to Perl's C<warn> function.
1799 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1800 argument list. These are used to generate a string message. If the
1801 message does not end with a newline, then it will be extended with
1802 some indication of the current location in the code, as described for
1805 The error message or object will by default be written to standard error,
1806 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1808 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1814 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1816 SV *ex = vmess(pat, args);
1817 PERL_ARGS_ASSERT_VWARN;
1818 if (!invoke_exception_hook(ex, TRUE))
1819 write_to_stderr(ex);
1823 =for apidoc Am|void|warn|const char *pat|...
1825 This is an XS interface to Perl's C<warn> function.
1827 Take a sprintf-style format pattern and argument list. These are used to
1828 generate a string message. If the message does not end with a newline,
1829 then it will be extended with some indication of the current location
1830 in the code, as described for L</mess_sv>.
1832 The error message or object will by default be written to standard error,
1833 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1835 Unlike with L</croak>, C<pat> is not permitted to be null.
1840 #if defined(PERL_IMPLICIT_CONTEXT)
1842 Perl_warn_nocontext(const char *pat, ...)
1846 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1847 va_start(args, pat);
1851 #endif /* PERL_IMPLICIT_CONTEXT */
1854 Perl_warn(pTHX_ const char *pat, ...)
1857 PERL_ARGS_ASSERT_WARN;
1858 va_start(args, pat);
1863 #if defined(PERL_IMPLICIT_CONTEXT)
1865 Perl_warner_nocontext(U32 err, const char *pat, ...)
1869 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1870 va_start(args, pat);
1871 vwarner(err, pat, &args);
1874 #endif /* PERL_IMPLICIT_CONTEXT */
1877 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1879 PERL_ARGS_ASSERT_CK_WARNER_D;
1881 if (Perl_ckwarn_d(aTHX_ err)) {
1883 va_start(args, pat);
1884 vwarner(err, pat, &args);
1890 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1892 PERL_ARGS_ASSERT_CK_WARNER;
1894 if (Perl_ckwarn(aTHX_ err)) {
1896 va_start(args, pat);
1897 vwarner(err, pat, &args);
1903 Perl_warner(pTHX_ U32 err, const char* pat,...)
1906 PERL_ARGS_ASSERT_WARNER;
1907 va_start(args, pat);
1908 vwarner(err, pat, &args);
1913 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1916 PERL_ARGS_ASSERT_VWARNER;
1917 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1918 SV * const msv = vmess(pat, args);
1920 invoke_exception_hook(msv, FALSE);
1924 Perl_vwarn(aTHX_ pat, args);
1928 /* implements the ckWARN? macros */
1931 Perl_ckwarn(pTHX_ U32 w)
1934 /* If lexical warnings have not been set, use $^W. */
1936 return PL_dowarn & G_WARN_ON;
1938 return ckwarn_common(w);
1941 /* implements the ckWARN?_d macro */
1944 Perl_ckwarn_d(pTHX_ U32 w)
1947 /* If lexical warnings have not been set then default classes warn. */
1951 return ckwarn_common(w);
1955 S_ckwarn_common(pTHX_ U32 w)
1957 if (PL_curcop->cop_warnings == pWARN_ALL)
1960 if (PL_curcop->cop_warnings == pWARN_NONE)
1963 /* Check the assumption that at least the first slot is non-zero. */
1964 assert(unpackWARN1(w));
1966 /* Check the assumption that it is valid to stop as soon as a zero slot is
1968 if (!unpackWARN2(w)) {
1969 assert(!unpackWARN3(w));
1970 assert(!unpackWARN4(w));
1971 } else if (!unpackWARN3(w)) {
1972 assert(!unpackWARN4(w));
1975 /* Right, dealt with all the special cases, which are implemented as non-
1976 pointers, so there is a pointer to a real warnings mask. */
1978 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1980 } while (w >>= WARNshift);
1985 /* Set buffer=NULL to get a new one. */
1987 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1989 const MEM_SIZE len_wanted =
1990 sizeof(STRLEN) + (size > WARNsize ? size : WARNsize);
1991 PERL_UNUSED_CONTEXT;
1992 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1995 (specialWARN(buffer) ?
1996 PerlMemShared_malloc(len_wanted) :
1997 PerlMemShared_realloc(buffer, len_wanted));
1999 Copy(bits, (buffer + 1), size, char);
2000 if (size < WARNsize)
2001 Zero((char *)(buffer + 1) + size, WARNsize - size, char);
2005 /* since we've already done strlen() for both nam and val
2006 * we can use that info to make things faster than
2007 * sprintf(s, "%s=%s", nam, val)
2009 #define my_setenv_format(s, nam, nlen, val, vlen) \
2010 Copy(nam, s, nlen, char); \
2012 Copy(val, s+(nlen+1), vlen, char); \
2013 *(s+(nlen+1+vlen)) = '\0'
2015 #ifdef USE_ENVIRON_ARRAY
2016 /* VMS' my_setenv() is in vms.c */
2017 #if !defined(WIN32) && !defined(NETWARE)
2019 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2023 /* only parent thread can modify process environment */
2024 if (PL_curinterp == aTHX)
2027 #ifndef PERL_USE_SAFE_PUTENV
2028 if (!PL_use_safe_putenv) {
2029 /* most putenv()s leak, so we manipulate environ directly */
2031 const I32 len = strlen(nam);
2034 /* where does it go? */
2035 for (i = 0; environ[i]; i++) {
2036 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
2040 if (environ == PL_origenviron) { /* need we copy environment? */
2046 while (environ[max])
2048 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
2049 for (j=0; j<max; j++) { /* copy environment */
2050 const int len = strlen(environ[j]);
2051 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
2052 Copy(environ[j], tmpenv[j], len+1, char);
2055 environ = tmpenv; /* tell exec where it is now */
2058 safesysfree(environ[i]);
2059 while (environ[i]) {
2060 environ[i] = environ[i+1];
2065 if (!environ[i]) { /* does not exist yet */
2066 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2067 environ[i+1] = NULL; /* make sure it's null terminated */
2070 safesysfree(environ[i]);
2074 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2075 /* all that work just for this */
2076 my_setenv_format(environ[i], nam, nlen, val, vlen);
2079 # if defined(__CYGWIN__)|| defined(__SYMBIAN32__) || defined(__riscos__)
2080 # if defined(HAS_UNSETENV)
2082 (void)unsetenv(nam);
2084 (void)setenv(nam, val, 1);
2086 # else /* ! HAS_UNSETENV */
2087 (void)setenv(nam, val, 1);
2088 # endif /* HAS_UNSETENV */
2090 # if defined(HAS_UNSETENV)
2092 if (environ) /* old glibc can crash with null environ */
2093 (void)unsetenv(nam);
2095 const int nlen = strlen(nam);
2096 const int vlen = strlen(val);
2097 char * const new_env =
2098 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2099 my_setenv_format(new_env, nam, nlen, val, vlen);
2100 (void)putenv(new_env);
2102 # else /* ! HAS_UNSETENV */
2104 const int nlen = strlen(nam);
2110 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2111 /* all that work just for this */
2112 my_setenv_format(new_env, nam, nlen, val, vlen);
2113 (void)putenv(new_env);
2114 # endif /* HAS_UNSETENV */
2115 # endif /* __CYGWIN__ */
2116 #ifndef PERL_USE_SAFE_PUTENV
2122 #else /* WIN32 || NETWARE */
2125 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2129 const int nlen = strlen(nam);
2136 Newx(envstr, nlen+vlen+2, char);
2137 my_setenv_format(envstr, nam, nlen, val, vlen);
2138 (void)PerlEnv_putenv(envstr);
2142 #endif /* WIN32 || NETWARE */
2146 #ifdef UNLINK_ALL_VERSIONS
2148 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2152 PERL_ARGS_ASSERT_UNLNK;
2154 while (PerlLIO_unlink(f) >= 0)
2156 return retries ? 0 : -1;
2160 /* this is a drop-in replacement for bcopy() */
2161 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
2163 Perl_my_bcopy(const char *from, char *to, I32 len)
2165 char * const retval = to;
2167 PERL_ARGS_ASSERT_MY_BCOPY;
2171 if (from - to >= 0) {
2179 *(--to) = *(--from);
2185 /* this is a drop-in replacement for memset() */
2188 Perl_my_memset(char *loc, I32 ch, I32 len)
2190 char * const retval = loc;
2192 PERL_ARGS_ASSERT_MY_MEMSET;
2202 /* this is a drop-in replacement for bzero() */
2203 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2205 Perl_my_bzero(char *loc, I32 len)
2207 char * const retval = loc;
2209 PERL_ARGS_ASSERT_MY_BZERO;
2219 /* this is a drop-in replacement for memcmp() */
2220 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2222 Perl_my_memcmp(const char *s1, const char *s2, I32 len)
2224 const U8 *a = (const U8 *)s1;
2225 const U8 *b = (const U8 *)s2;
2228 PERL_ARGS_ASSERT_MY_MEMCMP;
2233 if ((tmp = *a++ - *b++))
2238 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2241 /* This vsprintf replacement should generally never get used, since
2242 vsprintf was available in both System V and BSD 2.11. (There may
2243 be some cross-compilation or embedded set-ups where it is needed,
2246 If you encounter a problem in this function, it's probably a symptom
2247 that Configure failed to detect your system's vprintf() function.
2248 See the section on "item vsprintf" in the INSTALL file.
2250 This version may compile on systems with BSD-ish <stdio.h>,
2251 but probably won't on others.
2254 #ifdef USE_CHAR_VSPRINTF
2259 vsprintf(char *dest, const char *pat, void *args)
2263 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2264 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2265 FILE_cnt(&fakebuf) = 32767;
2267 /* These probably won't compile -- If you really need
2268 this, you'll have to figure out some other method. */
2269 fakebuf._ptr = dest;
2270 fakebuf._cnt = 32767;
2275 fakebuf._flag = _IOWRT|_IOSTRG;
2276 _doprnt(pat, args, &fakebuf); /* what a kludge */
2277 #if defined(STDIO_PTR_LVALUE)
2278 *(FILE_ptr(&fakebuf)++) = '\0';
2280 /* PerlIO has probably #defined away fputc, but we want it here. */
2282 # undef fputc /* XXX Should really restore it later */
2284 (void)fputc('\0', &fakebuf);
2286 #ifdef USE_CHAR_VSPRINTF
2289 return 0; /* perl doesn't use return value */
2293 #endif /* HAS_VPRINTF */
2296 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2298 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2307 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2309 PERL_FLUSHALL_FOR_CHILD;
2310 This = (*mode == 'w');
2314 taint_proper("Insecure %s%s", "EXEC");
2316 if (PerlProc_pipe(p) < 0)
2318 /* Try for another pipe pair for error return */
2319 if (PerlProc_pipe(pp) >= 0)
2321 while ((pid = PerlProc_fork()) < 0) {
2322 if (errno != EAGAIN) {
2323 PerlLIO_close(p[This]);
2324 PerlLIO_close(p[that]);
2326 PerlLIO_close(pp[0]);
2327 PerlLIO_close(pp[1]);
2331 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2340 /* Close parent's end of error status pipe (if any) */
2342 PerlLIO_close(pp[0]);
2343 #if defined(HAS_FCNTL) && defined(F_SETFD)
2344 /* Close error pipe automatically if exec works */
2345 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2349 /* Now dup our end of _the_ pipe to right position */
2350 if (p[THIS] != (*mode == 'r')) {
2351 PerlLIO_dup2(p[THIS], *mode == 'r');
2352 PerlLIO_close(p[THIS]);
2353 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2354 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2357 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2358 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2359 /* No automatic close - do it by hand */
2366 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2372 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2378 do_execfree(); /* free any memory malloced by child on fork */
2380 PerlLIO_close(pp[1]);
2381 /* Keep the lower of the two fd numbers */
2382 if (p[that] < p[This]) {
2383 PerlLIO_dup2(p[This], p[that]);
2384 PerlLIO_close(p[This]);
2388 PerlLIO_close(p[that]); /* close child's end of pipe */
2390 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2391 SvUPGRADE(sv,SVt_IV);
2393 PL_forkprocess = pid;
2394 /* If we managed to get status pipe check for exec fail */
2395 if (did_pipes && pid > 0) {
2400 while (n < sizeof(int)) {
2401 n1 = PerlLIO_read(pp[0],
2402 (void*)(((char*)&errkid)+n),
2408 PerlLIO_close(pp[0]);
2410 if (n) { /* Error */
2412 PerlLIO_close(p[This]);
2413 if (n != sizeof(int))
2414 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2416 pid2 = wait4pid(pid, &status, 0);
2417 } while (pid2 == -1 && errno == EINTR);
2418 errno = errkid; /* Propagate errno from kid */
2423 PerlLIO_close(pp[0]);
2424 return PerlIO_fdopen(p[This], mode);
2426 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2427 return my_syspopen4(aTHX_ NULL, mode, n, args);
2429 Perl_croak(aTHX_ "List form of piped open not implemented");
2430 return (PerlIO *) NULL;
2435 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2436 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__LIBCATAMOUNT__)
2438 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2445 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2449 PERL_ARGS_ASSERT_MY_POPEN;
2451 PERL_FLUSHALL_FOR_CHILD;
2454 return my_syspopen(aTHX_ cmd,mode);
2457 This = (*mode == 'w');
2459 if (doexec && TAINTING_get) {
2461 taint_proper("Insecure %s%s", "EXEC");
2463 if (PerlProc_pipe(p) < 0)
2465 if (doexec && PerlProc_pipe(pp) >= 0)
2467 while ((pid = PerlProc_fork()) < 0) {
2468 if (errno != EAGAIN) {
2469 PerlLIO_close(p[This]);
2470 PerlLIO_close(p[that]);
2472 PerlLIO_close(pp[0]);
2473 PerlLIO_close(pp[1]);
2476 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2479 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2489 PerlLIO_close(pp[0]);
2490 #if defined(HAS_FCNTL) && defined(F_SETFD)
2491 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2495 if (p[THIS] != (*mode == 'r')) {
2496 PerlLIO_dup2(p[THIS], *mode == 'r');
2497 PerlLIO_close(p[THIS]);
2498 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2499 PerlLIO_close(p[THAT]);
2502 PerlLIO_close(p[THAT]);
2505 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2512 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2517 /* may or may not use the shell */
2518 do_exec3(cmd, pp[1], did_pipes);
2521 #endif /* defined OS2 */
2523 #ifdef PERLIO_USING_CRLF
2524 /* Since we circumvent IO layers when we manipulate low-level
2525 filedescriptors directly, need to manually switch to the
2526 default, binary, low-level mode; see PerlIOBuf_open(). */
2527 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2530 #ifdef PERL_USES_PL_PIDSTATUS
2531 hv_clear(PL_pidstatus); /* we have no children */
2537 do_execfree(); /* free any memory malloced by child on vfork */
2539 PerlLIO_close(pp[1]);
2540 if (p[that] < p[This]) {
2541 PerlLIO_dup2(p[This], p[that]);
2542 PerlLIO_close(p[This]);
2546 PerlLIO_close(p[that]);
2548 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2549 SvUPGRADE(sv,SVt_IV);
2551 PL_forkprocess = pid;
2552 if (did_pipes && pid > 0) {
2557 while (n < sizeof(int)) {
2558 n1 = PerlLIO_read(pp[0],
2559 (void*)(((char*)&errkid)+n),
2565 PerlLIO_close(pp[0]);
2567 if (n) { /* Error */
2569 PerlLIO_close(p[This]);
2570 if (n != sizeof(int))
2571 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2573 pid2 = wait4pid(pid, &status, 0);
2574 } while (pid2 == -1 && errno == EINTR);
2575 errno = errkid; /* Propagate errno from kid */
2580 PerlLIO_close(pp[0]);
2581 return PerlIO_fdopen(p[This], mode);
2585 FILE *djgpp_popen();
2587 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2589 PERL_FLUSHALL_FOR_CHILD;
2590 /* Call system's popen() to get a FILE *, then import it.
2591 used 0 for 2nd parameter to PerlIO_importFILE;
2594 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2597 #if defined(__LIBCATAMOUNT__)
2599 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2606 #endif /* !DOSISH */
2608 /* this is called in parent before the fork() */
2610 Perl_atfork_lock(void)
2613 #if defined(USE_ITHREADS)
2614 /* locks must be held in locking order (if any) */
2616 MUTEX_LOCK(&PL_perlio_mutex);
2619 MUTEX_LOCK(&PL_malloc_mutex);
2625 /* this is called in both parent and child after the fork() */
2627 Perl_atfork_unlock(void)
2630 #if defined(USE_ITHREADS)
2631 /* locks must be released in same order as in atfork_lock() */
2633 MUTEX_UNLOCK(&PL_perlio_mutex);
2636 MUTEX_UNLOCK(&PL_malloc_mutex);
2645 #if defined(HAS_FORK)
2647 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2652 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2653 * handlers elsewhere in the code */
2658 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2659 Perl_croak_nocontext("fork() not available");
2661 #endif /* HAS_FORK */
2666 dup2(int oldfd, int newfd)
2668 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2671 PerlLIO_close(newfd);
2672 return fcntl(oldfd, F_DUPFD, newfd);
2674 #define DUP2_MAX_FDS 256
2675 int fdtmp[DUP2_MAX_FDS];
2681 PerlLIO_close(newfd);
2682 /* good enough for low fd's... */
2683 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2684 if (fdx >= DUP2_MAX_FDS) {
2692 PerlLIO_close(fdtmp[--fdx]);
2699 #ifdef HAS_SIGACTION
2702 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2705 struct sigaction act, oact;
2708 /* only "parent" interpreter can diddle signals */
2709 if (PL_curinterp != aTHX)
2710 return (Sighandler_t) SIG_ERR;
2713 act.sa_handler = (void(*)(int))handler;
2714 sigemptyset(&act.sa_mask);
2717 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2718 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2720 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2721 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2722 act.sa_flags |= SA_NOCLDWAIT;
2724 if (sigaction(signo, &act, &oact) == -1)
2725 return (Sighandler_t) SIG_ERR;
2727 return (Sighandler_t) oact.sa_handler;
2731 Perl_rsignal_state(pTHX_ int signo)
2733 struct sigaction oact;
2734 PERL_UNUSED_CONTEXT;
2736 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2737 return (Sighandler_t) SIG_ERR;
2739 return (Sighandler_t) oact.sa_handler;
2743 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2746 struct sigaction act;
2748 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2751 /* only "parent" interpreter can diddle signals */
2752 if (PL_curinterp != aTHX)
2756 act.sa_handler = (void(*)(int))handler;
2757 sigemptyset(&act.sa_mask);
2760 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2761 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2763 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2764 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2765 act.sa_flags |= SA_NOCLDWAIT;
2767 return sigaction(signo, &act, save);
2771 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2775 /* only "parent" interpreter can diddle signals */
2776 if (PL_curinterp != aTHX)
2780 return sigaction(signo, save, (struct sigaction *)NULL);
2783 #else /* !HAS_SIGACTION */
2786 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2788 #if defined(USE_ITHREADS) && !defined(WIN32)
2789 /* only "parent" interpreter can diddle signals */
2790 if (PL_curinterp != aTHX)
2791 return (Sighandler_t) SIG_ERR;
2794 return PerlProc_signal(signo, handler);
2805 Perl_rsignal_state(pTHX_ int signo)
2808 Sighandler_t oldsig;
2810 #if defined(USE_ITHREADS) && !defined(WIN32)
2811 /* only "parent" interpreter can diddle signals */
2812 if (PL_curinterp != aTHX)
2813 return (Sighandler_t) SIG_ERR;
2817 oldsig = PerlProc_signal(signo, sig_trap);
2818 PerlProc_signal(signo, oldsig);
2820 PerlProc_kill(PerlProc_getpid(), signo);
2825 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2827 #if defined(USE_ITHREADS) && !defined(WIN32)
2828 /* only "parent" interpreter can diddle signals */
2829 if (PL_curinterp != aTHX)
2832 *save = PerlProc_signal(signo, handler);
2833 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2837 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2839 #if defined(USE_ITHREADS) && !defined(WIN32)
2840 /* only "parent" interpreter can diddle signals */
2841 if (PL_curinterp != aTHX)
2844 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2847 #endif /* !HAS_SIGACTION */
2848 #endif /* !PERL_MICRO */
2850 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2851 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__LIBCATAMOUNT__)
2853 Perl_my_pclose(pTHX_ PerlIO *ptr)
2862 const int fd = PerlIO_fileno(ptr);
2865 svp = av_fetch(PL_fdpid,fd,TRUE);
2866 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2870 #if defined(USE_PERLIO)
2871 /* Find out whether the refcount is low enough for us to wait for the
2872 child proc without blocking. */
2873 should_wait = PerlIOUnix_refcnt(fd) == 1 && pid > 0;
2875 should_wait = pid > 0;
2879 if (pid == -1) { /* Opened by popen. */
2880 return my_syspclose(ptr);
2883 close_failed = (PerlIO_close(ptr) == EOF);
2885 if (should_wait) do {
2886 pid2 = wait4pid(pid, &status, 0);
2887 } while (pid2 == -1 && errno == EINTR);
2894 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
2899 #if defined(__LIBCATAMOUNT__)
2901 Perl_my_pclose(pTHX_ PerlIO *ptr)
2906 #endif /* !DOSISH */
2908 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2910 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2914 PERL_ARGS_ASSERT_WAIT4PID;
2915 #ifdef PERL_USES_PL_PIDSTATUS
2917 /* PERL_USES_PL_PIDSTATUS is only defined when neither
2918 waitpid() nor wait4() is available, or on OS/2, which
2919 doesn't appear to support waiting for a progress group
2920 member, so we can only treat a 0 pid as an unknown child.
2927 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2928 pid, rather than a string form. */
2929 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2930 if (svp && *svp != &PL_sv_undef) {
2931 *statusp = SvIVX(*svp);
2932 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2940 hv_iterinit(PL_pidstatus);
2941 if ((entry = hv_iternext(PL_pidstatus))) {
2942 SV * const sv = hv_iterval(PL_pidstatus,entry);
2944 const char * const spid = hv_iterkey(entry,&len);
2946 assert (len == sizeof(Pid_t));
2947 memcpy((char *)&pid, spid, len);
2948 *statusp = SvIVX(sv);
2949 /* The hash iterator is currently on this entry, so simply
2950 calling hv_delete would trigger the lazy delete, which on
2951 aggregate does more work, beacuse next call to hv_iterinit()
2952 would spot the flag, and have to call the delete routine,
2953 while in the meantime any new entries can't re-use that
2955 hv_iterinit(PL_pidstatus);
2956 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2963 # ifdef HAS_WAITPID_RUNTIME
2964 if (!HAS_WAITPID_RUNTIME)
2967 result = PerlProc_waitpid(pid,statusp,flags);
2970 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2971 result = wait4(pid,statusp,flags,NULL);
2974 #ifdef PERL_USES_PL_PIDSTATUS
2975 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2980 Perl_croak(aTHX_ "Can't do waitpid with flags");
2982 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2983 pidgone(result,*statusp);
2989 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2992 if (result < 0 && errno == EINTR) {
2994 errno = EINTR; /* reset in case a signal handler changed $! */
2998 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3000 #ifdef PERL_USES_PL_PIDSTATUS
3002 S_pidgone(pTHX_ Pid_t pid, int status)
3006 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3007 SvUPGRADE(sv,SVt_IV);
3008 SvIV_set(sv, status);
3016 int /* Cannot prototype with I32
3018 my_syspclose(PerlIO *ptr)
3021 Perl_my_pclose(pTHX_ PerlIO *ptr)
3024 /* Needs work for PerlIO ! */
3025 FILE * const f = PerlIO_findFILE(ptr);
3026 const I32 result = pclose(f);
3027 PerlIO_releaseFILE(ptr,f);
3035 Perl_my_pclose(pTHX_ PerlIO *ptr)
3037 /* Needs work for PerlIO ! */
3038 FILE * const f = PerlIO_findFILE(ptr);
3039 I32 result = djgpp_pclose(f);
3040 result = (result << 8) & 0xff00;
3041 PerlIO_releaseFILE(ptr,f);
3046 #define PERL_REPEATCPY_LINEAR 4
3048 Perl_repeatcpy(char *to, const char *from, I32 len, IV count)
3050 PERL_ARGS_ASSERT_REPEATCPY;
3055 croak_memory_wrap();
3058 memset(to, *from, count);
3061 IV items, linear, half;
3063 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3064 for (items = 0; items < linear; ++items) {
3065 const char *q = from;
3067 for (todo = len; todo > 0; todo--)
3072 while (items <= half) {
3073 IV size = items * len;
3074 memcpy(p, to, size);
3080 memcpy(p, to, (count - items) * len);
3086 Perl_same_dirent(pTHX_ const char *a, const char *b)
3088 char *fa = strrchr(a,'/');
3089 char *fb = strrchr(b,'/');
3092 SV * const tmpsv = sv_newmortal();
3094 PERL_ARGS_ASSERT_SAME_DIRENT;
3107 sv_setpvs(tmpsv, ".");
3109 sv_setpvn(tmpsv, a, fa - a);
3110 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3113 sv_setpvs(tmpsv, ".");
3115 sv_setpvn(tmpsv, b, fb - b);
3116 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3118 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3119 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3121 #endif /* !HAS_RENAME */
3124 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3125 const char *const *const search_ext, I32 flags)
3128 const char *xfound = NULL;
3129 char *xfailed = NULL;
3130 char tmpbuf[MAXPATHLEN];
3135 #if defined(DOSISH) && !defined(OS2)
3136 # define SEARCH_EXTS ".bat", ".cmd", NULL
3137 # define MAX_EXT_LEN 4
3140 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3141 # define MAX_EXT_LEN 4
3144 # define SEARCH_EXTS ".pl", ".com", NULL
3145 # define MAX_EXT_LEN 4
3147 /* additional extensions to try in each dir if scriptname not found */
3149 static const char *const exts[] = { SEARCH_EXTS };
3150 const char *const *const ext = search_ext ? search_ext : exts;
3151 int extidx = 0, i = 0;
3152 const char *curext = NULL;
3154 PERL_UNUSED_ARG(search_ext);
3155 # define MAX_EXT_LEN 0
3158 PERL_ARGS_ASSERT_FIND_SCRIPT;
3161 * If dosearch is true and if scriptname does not contain path
3162 * delimiters, search the PATH for scriptname.
3164 * If SEARCH_EXTS is also defined, will look for each
3165 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3166 * while searching the PATH.
3168 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3169 * proceeds as follows:
3170 * If DOSISH or VMSISH:
3171 * + look for ./scriptname{,.foo,.bar}
3172 * + search the PATH for scriptname{,.foo,.bar}
3175 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3176 * this will not look in '.' if it's not in the PATH)
3181 # ifdef ALWAYS_DEFTYPES
3182 len = strlen(scriptname);
3183 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3184 int idx = 0, deftypes = 1;
3187 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3190 int idx = 0, deftypes = 1;
3193 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3195 /* The first time through, just add SEARCH_EXTS to whatever we
3196 * already have, so we can check for default file types. */
3198 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3204 if ((strlen(tmpbuf) + strlen(scriptname)
3205 + MAX_EXT_LEN) >= sizeof tmpbuf)
3206 continue; /* don't search dir with too-long name */
3207 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3211 if (strEQ(scriptname, "-"))
3213 if (dosearch) { /* Look in '.' first. */
3214 const char *cur = scriptname;
3216 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3218 if (strEQ(ext[i++],curext)) {
3219 extidx = -1; /* already has an ext */
3224 DEBUG_p(PerlIO_printf(Perl_debug_log,
3225 "Looking for %s\n",cur));
3226 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3227 && !S_ISDIR(PL_statbuf.st_mode)) {
3235 if (cur == scriptname) {
3236 len = strlen(scriptname);
3237 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3239 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3242 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3243 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3248 if (dosearch && !strchr(scriptname, '/')
3250 && !strchr(scriptname, '\\')
3252 && (s = PerlEnv_getenv("PATH")))
3256 bufend = s + strlen(s);
3257 while (s < bufend) {
3260 && *s != ';'; len++, s++) {
3261 if (len < sizeof tmpbuf)
3264 if (len < sizeof tmpbuf)
3267 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3273 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3274 continue; /* don't search dir with too-long name */
3277 && tmpbuf[len - 1] != '/'
3278 && tmpbuf[len - 1] != '\\'
3281 tmpbuf[len++] = '/';
3282 if (len == 2 && tmpbuf[0] == '.')
3284 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3288 len = strlen(tmpbuf);
3289 if (extidx > 0) /* reset after previous loop */
3293 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3294 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3295 if (S_ISDIR(PL_statbuf.st_mode)) {
3299 } while ( retval < 0 /* not there */
3300 && extidx>=0 && ext[extidx] /* try an extension? */
3301 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3306 if (S_ISREG(PL_statbuf.st_mode)
3307 && cando(S_IRUSR,TRUE,&PL_statbuf)
3308 #if !defined(DOSISH)
3309 && cando(S_IXUSR,TRUE,&PL_statbuf)
3313 xfound = tmpbuf; /* bingo! */
3317 xfailed = savepv(tmpbuf);
3320 if (!xfound && !seen_dot && !xfailed &&
3321 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3322 || S_ISDIR(PL_statbuf.st_mode)))
3324 seen_dot = 1; /* Disable message. */
3326 if (flags & 1) { /* do or die? */
3327 /* diag_listed_as: Can't execute %s */
3328 Perl_croak(aTHX_ "Can't %s %s%s%s",
3329 (xfailed ? "execute" : "find"),
3330 (xfailed ? xfailed : scriptname),
3331 (xfailed ? "" : " on PATH"),
3332 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3337 scriptname = xfound;
3339 return (scriptname ? savepv(scriptname) : NULL);
3342 #ifndef PERL_GET_CONTEXT_DEFINED
3345 Perl_get_context(void)
3348 #if defined(USE_ITHREADS)
3349 # ifdef OLD_PTHREADS_API
3351 int error = pthread_getspecific(PL_thr_key, &t)
3353 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3356 # ifdef I_MACH_CTHREADS
3357 return (void*)cthread_data(cthread_self());
3359 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3368 Perl_set_context(void *t)
3371 PERL_ARGS_ASSERT_SET_CONTEXT;
3372 #if defined(USE_ITHREADS)
3373 # ifdef I_MACH_CTHREADS
3374 cthread_set_data(cthread_self(), t);
3377 const int error = pthread_setspecific(PL_thr_key, t);
3379 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3387 #endif /* !PERL_GET_CONTEXT_DEFINED */
3389 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3398 Perl_get_op_names(pTHX)
3400 PERL_UNUSED_CONTEXT;
3401 return (char **)PL_op_name;
3405 Perl_get_op_descs(pTHX)
3407 PERL_UNUSED_CONTEXT;
3408 return (char **)PL_op_desc;
3412 Perl_get_no_modify(pTHX)
3414 PERL_UNUSED_CONTEXT;
3415 return PL_no_modify;
3419 Perl_get_opargs(pTHX)
3421 PERL_UNUSED_CONTEXT;
3422 return (U32 *)PL_opargs;
3426 Perl_get_ppaddr(pTHX)
3429 PERL_UNUSED_CONTEXT;
3430 return (PPADDR_t*)PL_ppaddr;
3433 #ifndef HAS_GETENV_LEN
3435 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3437 char * const env_trans = PerlEnv_getenv(env_elem);
3438 PERL_UNUSED_CONTEXT;
3439 PERL_ARGS_ASSERT_GETENV_LEN;
3441 *len = strlen(env_trans);
3448 Perl_get_vtbl(pTHX_ int vtbl_id)
3450 PERL_UNUSED_CONTEXT;
3452 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3453 ? NULL : (MGVTBL*)PL_magic_vtables + vtbl_id;
3457 Perl_my_fflush_all(pTHX)
3459 #if defined(USE_PERLIO) || defined(FFLUSH_NULL)
3460 return PerlIO_flush(NULL);
3462 # if defined(HAS__FWALK)
3463 extern int fflush(FILE *);
3464 /* undocumented, unprototyped, but very useful BSDism */
3465 extern void _fwalk(int (*)(FILE *));
3469 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3471 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3472 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3474 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3475 open_max = sysconf(_SC_OPEN_MAX);
3478 open_max = FOPEN_MAX;
3481 open_max = OPEN_MAX;
3492 for (i = 0; i < open_max; i++)
3493 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3494 STDIO_STREAM_ARRAY[i]._file < open_max &&
3495 STDIO_STREAM_ARRAY[i]._flag)
3496 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3500 SETERRNO(EBADF,RMS_IFI);
3507 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3509 if (ckWARN(WARN_IO)) {
3511 = gv && (isGV_with_GP(gv))
3514 const char * const direction = have == '>' ? "out" : "in";
3516 if (name && HEK_LEN(name))
3517 Perl_warner(aTHX_ packWARN(WARN_IO),
3518 "Filehandle %"HEKf" opened only for %sput",
3519 HEKfARG(name), direction);
3521 Perl_warner(aTHX_ packWARN(WARN_IO),
3522 "Filehandle opened only for %sput", direction);
3527 Perl_report_evil_fh(pTHX_ const GV *gv)
3529 const IO *io = gv ? GvIO(gv) : NULL;
3530 const PERL_BITFIELD16 op = PL_op->op_type;
3534 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3536 warn_type = WARN_CLOSED;
3540 warn_type = WARN_UNOPENED;
3543 if (ckWARN(warn_type)) {
3545 = gv && isGV_with_GP(gv) && GvENAMELEN(gv) ?
3546 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3547 const char * const pars =
3548 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3549 const char * const func =
3551 (op == OP_READLINE || op == OP_RCATLINE
3552 ? "readline" : /* "<HANDLE>" not nice */
3553 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3555 const char * const type =
3557 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3558 ? "socket" : "filehandle");
3559 const bool have_name = name && SvCUR(name);
3560 Perl_warner(aTHX_ packWARN(warn_type),
3561 "%s%s on %s %s%s%"SVf, func, pars, vile, type,
3562 have_name ? " " : "",
3563 SVfARG(have_name ? name : &PL_sv_no));
3564 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3566 aTHX_ packWARN(warn_type),
3567 "\t(Are you trying to call %s%s on dirhandle%s%"SVf"?)\n",
3568 func, pars, have_name ? " " : "",
3569 SVfARG(have_name ? name : &PL_sv_no)
3574 /* To workaround core dumps from the uninitialised tm_zone we get the
3575 * system to give us a reasonable struct to copy. This fix means that
3576 * strftime uses the tm_zone and tm_gmtoff values returned by
3577 * localtime(time()). That should give the desired result most of the
3578 * time. But probably not always!
3580 * This does not address tzname aspects of NETaa14816.
3585 # ifndef STRUCT_TM_HASZONE
3586 # define STRUCT_TM_HASZONE
3590 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3591 # ifndef HAS_TM_TM_ZONE
3592 # define HAS_TM_TM_ZONE
3597 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3599 #ifdef HAS_TM_TM_ZONE
3601 const struct tm* my_tm;
3602 PERL_UNUSED_CONTEXT;
3603 PERL_ARGS_ASSERT_INIT_TM;
3605 my_tm = localtime(&now);
3607 Copy(my_tm, ptm, 1, struct tm);
3609 PERL_UNUSED_CONTEXT;
3610 PERL_ARGS_ASSERT_INIT_TM;
3611 PERL_UNUSED_ARG(ptm);
3616 * mini_mktime - normalise struct tm values without the localtime()
3617 * semantics (and overhead) of mktime().
3620 Perl_mini_mktime(pTHX_ struct tm *ptm)
3624 int month, mday, year, jday;
3625 int odd_cent, odd_year;
3626 PERL_UNUSED_CONTEXT;
3628 PERL_ARGS_ASSERT_MINI_MKTIME;
3630 #define DAYS_PER_YEAR 365
3631 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3632 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3633 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3634 #define SECS_PER_HOUR (60*60)
3635 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3636 /* parentheses deliberately absent on these two, otherwise they don't work */
3637 #define MONTH_TO_DAYS 153/5
3638 #define DAYS_TO_MONTH 5/153
3639 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3640 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3641 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3642 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3645 * Year/day algorithm notes:
3647 * With a suitable offset for numeric value of the month, one can find
3648 * an offset into the year by considering months to have 30.6 (153/5) days,
3649 * using integer arithmetic (i.e., with truncation). To avoid too much
3650 * messing about with leap days, we consider January and February to be
3651 * the 13th and 14th month of the previous year. After that transformation,
3652 * we need the month index we use to be high by 1 from 'normal human' usage,
3653 * so the month index values we use run from 4 through 15.
3655 * Given that, and the rules for the Gregorian calendar (leap years are those
3656 * divisible by 4 unless also divisible by 100, when they must be divisible
3657 * by 400 instead), we can simply calculate the number of days since some
3658 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3659 * the days we derive from our month index, and adding in the day of the
3660 * month. The value used here is not adjusted for the actual origin which
3661 * it normally would use (1 January A.D. 1), since we're not exposing it.
3662 * We're only building the value so we can turn around and get the
3663 * normalised values for the year, month, day-of-month, and day-of-year.
3665 * For going backward, we need to bias the value we're using so that we find
3666 * the right year value. (Basically, we don't want the contribution of
3667 * March 1st to the number to apply while deriving the year). Having done
3668 * that, we 'count up' the contribution to the year number by accounting for
3669 * full quadracenturies (400-year periods) with their extra leap days, plus
3670 * the contribution from full centuries (to avoid counting in the lost leap
3671 * days), plus the contribution from full quad-years (to count in the normal
3672 * leap days), plus the leftover contribution from any non-leap years.
3673 * At this point, if we were working with an actual leap day, we'll have 0
3674 * days left over. This is also true for March 1st, however. So, we have
3675 * to special-case that result, and (earlier) keep track of the 'odd'
3676 * century and year contributions. If we got 4 extra centuries in a qcent,
3677 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3678 * Otherwise, we add back in the earlier bias we removed (the 123 from
3679 * figuring in March 1st), find the month index (integer division by 30.6),
3680 * and the remainder is the day-of-month. We then have to convert back to
3681 * 'real' months (including fixing January and February from being 14/15 in
3682 * the previous year to being in the proper year). After that, to get
3683 * tm_yday, we work with the normalised year and get a new yearday value for
3684 * January 1st, which we subtract from the yearday value we had earlier,
3685 * representing the date we've re-built. This is done from January 1
3686 * because tm_yday is 0-origin.
3688 * Since POSIX time routines are only guaranteed to work for times since the
3689 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3690 * applies Gregorian calendar rules even to dates before the 16th century
3691 * doesn't bother me. Besides, you'd need cultural context for a given
3692 * date to know whether it was Julian or Gregorian calendar, and that's
3693 * outside the scope for this routine. Since we convert back based on the
3694 * same rules we used to build the yearday, you'll only get strange results
3695 * for input which needed normalising, or for the 'odd' century years which
3696 * were leap years in the Julian calendar but not in the Gregorian one.
3697 * I can live with that.
3699 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3700 * that's still outside the scope for POSIX time manipulation, so I don't
3704 year = 1900 + ptm->tm_year;
3705 month = ptm->tm_mon;
3706 mday = ptm->tm_mday;
3712 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3713 yearday += month*MONTH_TO_DAYS + mday + jday;
3715 * Note that we don't know when leap-seconds were or will be,
3716 * so we have to trust the user if we get something which looks
3717 * like a sensible leap-second. Wild values for seconds will
3718 * be rationalised, however.
3720 if ((unsigned) ptm->tm_sec <= 60) {
3727 secs += 60 * ptm->tm_min;
3728 secs += SECS_PER_HOUR * ptm->tm_hour;
3730 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3731 /* got negative remainder, but need positive time */
3732 /* back off an extra day to compensate */
3733 yearday += (secs/SECS_PER_DAY)-1;
3734 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3737 yearday += (secs/SECS_PER_DAY);
3738 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3741 else if (secs >= SECS_PER_DAY) {
3742 yearday += (secs/SECS_PER_DAY);
3743 secs %= SECS_PER_DAY;
3745 ptm->tm_hour = secs/SECS_PER_HOUR;
3746 secs %= SECS_PER_HOUR;
3747 ptm->tm_min = secs/60;
3749 ptm->tm_sec += secs;
3750 /* done with time of day effects */
3752 * The algorithm for yearday has (so far) left it high by 428.
3753 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3754 * bias it by 123 while trying to figure out what year it
3755 * really represents. Even with this tweak, the reverse
3756 * translation fails for years before A.D. 0001.
3757 * It would still fail for Feb 29, but we catch that one below.
3759 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3760 yearday -= YEAR_ADJUST;
3761 year = (yearday / DAYS_PER_QCENT) * 400;
3762 yearday %= DAYS_PER_QCENT;
3763 odd_cent = yearday / DAYS_PER_CENT;
3764 year += odd_cent * 100;
3765 yearday %= DAYS_PER_CENT;
3766 year += (yearday / DAYS_PER_QYEAR) * 4;
3767 yearday %= DAYS_PER_QYEAR;
3768 odd_year = yearday / DAYS_PER_YEAR;
3770 yearday %= DAYS_PER_YEAR;
3771 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3776 yearday += YEAR_ADJUST; /* recover March 1st crock */
3777 month = yearday*DAYS_TO_MONTH;
3778 yearday -= month*MONTH_TO_DAYS;
3779 /* recover other leap-year adjustment */
3788 ptm->tm_year = year - 1900;
3790 ptm->tm_mday = yearday;
3791 ptm->tm_mon = month;
3795 ptm->tm_mon = month - 1;
3797 /* re-build yearday based on Jan 1 to get tm_yday */
3799 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3800 yearday += 14*MONTH_TO_DAYS + 1;
3801 ptm->tm_yday = jday - yearday;
3802 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3806 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)
3814 PERL_ARGS_ASSERT_MY_STRFTIME;
3816 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3819 mytm.tm_hour = hour;
3820 mytm.tm_mday = mday;
3822 mytm.tm_year = year;
3823 mytm.tm_wday = wday;
3824 mytm.tm_yday = yday;
3825 mytm.tm_isdst = isdst;
3827 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3828 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3833 #ifdef HAS_TM_TM_GMTOFF
3834 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3836 #ifdef HAS_TM_TM_ZONE
3837 mytm.tm_zone = mytm2.tm_zone;
3842 Newx(buf, buflen, char);
3844 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3845 len = strftime(buf, buflen, fmt, &mytm);
3849 ** The following is needed to handle to the situation where
3850 ** tmpbuf overflows. Basically we want to allocate a buffer
3851 ** and try repeatedly. The reason why it is so complicated
3852 ** is that getting a return value of 0 from strftime can indicate
3853 ** one of the following:
3854 ** 1. buffer overflowed,
3855 ** 2. illegal conversion specifier, or
3856 ** 3. the format string specifies nothing to be returned(not
3857 ** an error). This could be because format is an empty string
3858 ** or it specifies %p that yields an empty string in some locale.
3859 ** If there is a better way to make it portable, go ahead by
3862 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3865 /* Possibly buf overflowed - try again with a bigger buf */
3866 const int fmtlen = strlen(fmt);
3867 int bufsize = fmtlen + buflen;
3869 Renew(buf, bufsize, char);
3872 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3873 buflen = strftime(buf, bufsize, fmt, &mytm);
3876 if (buflen > 0 && buflen < bufsize)
3878 /* heuristic to prevent out-of-memory errors */
3879 if (bufsize > 100*fmtlen) {
3885 Renew(buf, bufsize, char);
3890 Perl_croak(aTHX_ "panic: no strftime");
3896 #define SV_CWD_RETURN_UNDEF \
3897 sv_setsv(sv, &PL_sv_undef); \
3900 #define SV_CWD_ISDOT(dp) \
3901 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3902 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3905 =head1 Miscellaneous Functions
3907 =for apidoc getcwd_sv
3909 Fill the sv with current working directory
3914 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3915 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3916 * getcwd(3) if available
3917 * Comments from the orignal:
3918 * This is a faster version of getcwd. It's also more dangerous
3919 * because you might chdir out of a directory that you can't chdir
3923 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>
4450 * This is really just a quick hack which grabs various garbage
4451 * values. It really should be a real hash algorithm which
4452 * spreads the effect of every input bit onto every output bit,
4453 * if someone who knows about such things would bother to write it.
4454 * Might be a good idea to add that function to CORE as well.
4455 * No numbers below come from careful analysis or anything here,
4456 * except they are primes and SEED_C1 > 1E6 to get a full-width
4457 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4458 * probably be bigger too.
4461 # define SEED_C1 1000003
4462 #define SEED_C4 73819
4464 # define SEED_C1 25747
4465 #define SEED_C4 20639
4469 #define SEED_C5 26107
4471 #ifndef PERL_NO_DEV_RANDOM
4476 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4477 * in 100-ns units, typically incremented ever 10 ms. */
4478 unsigned int when[2];
4480 # ifdef HAS_GETTIMEOFDAY
4481 struct timeval when;
4487 /* This test is an escape hatch, this symbol isn't set by Configure. */
4488 #ifndef PERL_NO_DEV_RANDOM
4489 #ifndef PERL_RANDOM_DEVICE
4490 /* /dev/random isn't used by default because reads from it will block
4491 * if there isn't enough entropy available. You can compile with
4492 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4493 * is enough real entropy to fill the seed. */
4494 # define PERL_RANDOM_DEVICE "/dev/urandom"
4496 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4498 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4507 _ckvmssts(sys$gettim(when));
4508 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4510 # ifdef HAS_GETTIMEOFDAY
4511 PerlProc_gettimeofday(&when,NULL);
4512 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4515 u = (U32)SEED_C1 * when;
4518 u += SEED_C3 * (U32)PerlProc_getpid();
4519 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4520 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4521 u += SEED_C5 * (U32)PTR2UV(&when);
4527 Perl_get_hash_seed(pTHX_ unsigned char * const seed_buffer)
4533 PERL_ARGS_ASSERT_GET_HASH_SEED;
4535 env_pv= PerlEnv_getenv("PERL_HASH_SEED");
4538 #ifndef USE_HASH_SEED_EXPLICIT
4540 /* ignore leading spaces */
4541 while (isSPACE(*env_pv))
4543 #ifdef USE_PERL_PERTURB_KEYS
4544 /* if they set it to "0" we disable key traversal randomization completely */
4545 if (strEQ(env_pv,"0")) {
4546 PL_hash_rand_bits_enabled= 0;
4548 /* otherwise switch to deterministic mode */
4549 PL_hash_rand_bits_enabled= 2;
4552 /* ignore a leading 0x... if it is there */
4553 if (env_pv[0] == '0' && env_pv[1] == 'x')
4556 for( i = 0; isXDIGIT(*env_pv) && i < PERL_HASH_SEED_BYTES; i++ ) {
4557 seed_buffer[i] = READ_XDIGIT(env_pv) << 4;
4558 if ( isXDIGIT(*env_pv)) {
4559 seed_buffer[i] |= READ_XDIGIT(env_pv);
4562 while (isSPACE(*env_pv))
4565 if (*env_pv && !isXDIGIT(*env_pv)) {
4566 Perl_warn(aTHX_ "perl: warning: Non hex character in '$ENV{PERL_HASH_SEED}', seed only partially set\n");
4568 /* should we check for unparsed crap? */
4569 /* should we warn about unused hex? */
4570 /* should we warn about insufficient hex? */
4575 (void)seedDrand01((Rand_seed_t)seed());
4577 for( i = 0; i < PERL_HASH_SEED_BYTES; i++ ) {
4578 seed_buffer[i] = (unsigned char)(Drand01() * (U8_MAX+1));
4581 #ifdef USE_PERL_PERTURB_KEYS
4582 { /* initialize PL_hash_rand_bits from the hash seed.
4583 * This value is highly volatile, it is updated every
4584 * hash insert, and is used as part of hash bucket chain
4585 * randomization and hash iterator randomization. */
4586 PL_hash_rand_bits= 0xbe49d17f; /* I just picked a number */
4587 for( i = 0; i < sizeof(UV) ; i++ ) {
4588 PL_hash_rand_bits += seed_buffer[i % PERL_HASH_SEED_BYTES];
4589 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,8);
4592 env_pv= PerlEnv_getenv("PERL_PERTURB_KEYS");
4594 if (strEQ(env_pv,"0") || strEQ(env_pv,"NO")) {
4595 PL_hash_rand_bits_enabled= 0;
4596 } else if (strEQ(env_pv,"1") || strEQ(env_pv,"RANDOM")) {
4597 PL_hash_rand_bits_enabled= 1;
4598 } else if (strEQ(env_pv,"2") || strEQ(env_pv,"DETERMINISTIC")) {
4599 PL_hash_rand_bits_enabled= 2;
4601 Perl_warn(aTHX_ "perl: warning: strange setting in '$ENV{PERL_PERTURB_KEYS}': '%s'\n", env_pv);
4607 #ifdef PERL_GLOBAL_STRUCT
4609 #define PERL_GLOBAL_STRUCT_INIT
4610 #include "opcode.h" /* the ppaddr and check */
4613 Perl_init_global_struct(pTHX)
4615 struct perl_vars *plvarsp = NULL;
4616 # ifdef PERL_GLOBAL_STRUCT
4617 const IV nppaddr = C_ARRAY_LENGTH(Gppaddr);
4618 const IV ncheck = C_ARRAY_LENGTH(Gcheck);
4619 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4620 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4621 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4625 plvarsp = PL_VarsPtr;
4626 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4631 # define PERLVAR(prefix,var,type) /**/
4632 # define PERLVARA(prefix,var,n,type) /**/
4633 # define PERLVARI(prefix,var,type,init) plvarsp->prefix##var = init;
4634 # define PERLVARIC(prefix,var,type,init) plvarsp->prefix##var = init;
4635 # include "perlvars.h"
4640 # ifdef PERL_GLOBAL_STRUCT
4643 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4644 if (!plvarsp->Gppaddr)
4648 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4649 if (!plvarsp->Gcheck)
4651 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4652 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4654 # ifdef PERL_SET_VARS
4655 PERL_SET_VARS(plvarsp);
4657 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4658 plvarsp->Gsv_placeholder.sv_flags = 0;
4659 memset(plvarsp->Ghash_seed, 0, sizeof(plvarsp->Ghash_seed));
4661 # undef PERL_GLOBAL_STRUCT_INIT
4666 #endif /* PERL_GLOBAL_STRUCT */
4668 #ifdef PERL_GLOBAL_STRUCT
4671 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4673 int veto = plvarsp->Gveto_cleanup;
4675 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
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)
5334 SV * const dbsv = GvSVn(PL_DBsub);
5335 const bool save_taint = TAINT_get;
5337 /* When we are called from pp_goto (svp is null),
5338 * we do not care about using dbsv to call CV;
5339 * it's for informational purposes only.
5342 PERL_ARGS_ASSERT_GET_DB_SUB;
5346 if (!PERLDB_SUB_NN) {
5350 gv_efullname3(dbsv, gv, NULL);
5352 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5353 || strEQ(GvNAME(gv), "END")
5354 || ( /* Could be imported, and old sub redefined. */
5355 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
5357 !( (SvTYPE(*svp) == SVt_PVGV)
5358 && (GvCV((const GV *)*svp) == cv)
5359 /* Use GV from the stack as a fallback. */
5360 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
5364 /* GV is potentially non-unique, or contain different CV. */
5365 SV * const tmp = newRV(MUTABLE_SV(cv));
5366 sv_setsv(dbsv, tmp);
5370 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
5371 sv_catpvs(dbsv, "::");
5373 dbsv, GvNAME(gv), GvNAMELEN(gv),
5374 GvNAMEUTF8(gv) ? SV_CATUTF8 : SV_CATBYTES
5379 const int type = SvTYPE(dbsv);
5380 if (type < SVt_PVIV && type != SVt_IV)
5381 sv_upgrade(dbsv, SVt_PVIV);
5382 (void)SvIOK_on(dbsv);
5383 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5386 TAINT_IF(save_taint);
5387 #ifdef NO_TAINT_SUPPORT
5388 PERL_UNUSED_VAR(save_taint);
5393 Perl_my_dirfd(pTHX_ DIR * dir) {
5395 /* Most dirfd implementations have problems when passed NULL. */
5399 PERL_UNUSED_CONTEXT;
5401 #elif defined(HAS_DIR_DD_FD)
5402 PERL_UNUSED_CONTEXT;
5405 Perl_die(aTHX_ PL_no_func, "dirfd");
5406 assert(0); /* NOT REACHED */
5412 Perl_get_re_arg(pTHX_ SV *sv) {
5418 sv = MUTABLE_SV(SvRV(sv));
5419 if (SvTYPE(sv) == SVt_REGEXP)
5420 return (REGEXP*) sv;
5427 * This code is derived from drand48() implementation from FreeBSD,
5428 * found in lib/libc/gen/_rand48.c.
5430 * The U64 implementation is original, based on the POSIX
5431 * specification for drand48().
5435 * Copyright (c) 1993 Martin Birgmeier
5436 * All rights reserved.
5438 * You may redistribute unmodified or modified versions of this source
5439 * code provided that the above copyright notice and this and the
5440 * following conditions are retained.
5442 * This software is provided ``as is'', and comes with no warranties
5443 * of any kind. I shall in no event be liable for anything that happens
5444 * to anyone/anything when using this software.
5447 #define FREEBSD_DRAND48_SEED_0 (0x330e)
5449 #ifdef PERL_DRAND48_QUAD
5451 #define DRAND48_MULT U64_CONST(0x5deece66d)
5452 #define DRAND48_ADD 0xb
5453 #define DRAND48_MASK U64_CONST(0xffffffffffff)
5457 #define FREEBSD_DRAND48_SEED_1 (0xabcd)
5458 #define FREEBSD_DRAND48_SEED_2 (0x1234)
5459 #define FREEBSD_DRAND48_MULT_0 (0xe66d)
5460 #define FREEBSD_DRAND48_MULT_1 (0xdeec)
5461 #define FREEBSD_DRAND48_MULT_2 (0x0005)
5462 #define FREEBSD_DRAND48_ADD (0x000b)
5464 const unsigned short _rand48_mult[3] = {
5465 FREEBSD_DRAND48_MULT_0,
5466 FREEBSD_DRAND48_MULT_1,
5467 FREEBSD_DRAND48_MULT_2
5469 const unsigned short _rand48_add = FREEBSD_DRAND48_ADD;
5474 Perl_drand48_init_r(perl_drand48_t *random_state, U32 seed)
5476 PERL_ARGS_ASSERT_DRAND48_INIT_R;
5478 #ifdef PERL_DRAND48_QUAD
5479 *random_state = FREEBSD_DRAND48_SEED_0 + ((U64TYPE)seed << 16);
5481 random_state->seed[0] = FREEBSD_DRAND48_SEED_0;
5482 random_state->seed[1] = (U16) seed;
5483 random_state->seed[2] = (U16) (seed >> 16);
5488 Perl_drand48_r(perl_drand48_t *random_state)
5490 PERL_ARGS_ASSERT_DRAND48_R;
5492 #ifdef PERL_DRAND48_QUAD
5493 *random_state = (*random_state * DRAND48_MULT + DRAND48_ADD)
5496 return ldexp((double)*random_state, -48);
5502 accu = (U32) _rand48_mult[0] * (U32) random_state->seed[0]
5503 + (U32) _rand48_add;
5504 temp[0] = (U16) accu; /* lower 16 bits */
5505 accu >>= sizeof(U16) * 8;
5506 accu += (U32) _rand48_mult[0] * (U32) random_state->seed[1]
5507 + (U32) _rand48_mult[1] * (U32) random_state->seed[0];
5508 temp[1] = (U16) accu; /* middle 16 bits */
5509 accu >>= sizeof(U16) * 8;
5510 accu += _rand48_mult[0] * random_state->seed[2]
5511 + _rand48_mult[1] * random_state->seed[1]
5512 + _rand48_mult[2] * random_state->seed[0];
5513 random_state->seed[0] = temp[0];
5514 random_state->seed[1] = temp[1];
5515 random_state->seed[2] = (U16) accu;
5517 return ldexp((double) random_state->seed[0], -48) +
5518 ldexp((double) random_state->seed[1], -32) +
5519 ldexp((double) random_state->seed[2], -16);
5524 #ifdef USE_C_BACKTRACE
5526 /* Possibly move all this USE_C_BACKTRACE code into a new file. */
5531 /* abfd is the BFD handle. */
5533 /* bfd_syms is the BFD symbol table. */
5535 /* bfd_text is handle to the the ".text" section of the object file. */
5537 /* Since opening the executable and scanning its symbols is quite
5538 * heavy operation, we remember the filename we used the last time,
5539 * and do the opening and scanning only if the filename changes.
5540 * This removes most (but not all) open+scan cycles. */
5541 const char* fname_prev;
5544 /* Given a dl_info, update the BFD context if necessary. */
5545 static void bfd_update(bfd_context* ctx, Dl_info* dl_info)
5547 /* BFD open and scan only if the filename changed. */
5548 if (ctx->fname_prev == NULL ||
5549 strNE(dl_info->dli_fname, ctx->fname_prev)) {
5550 ctx->abfd = bfd_openr(dl_info->dli_fname, 0);
5552 if (bfd_check_format(ctx->abfd, bfd_object)) {
5553 IV symbol_size = bfd_get_symtab_upper_bound(ctx->abfd);
5554 if (symbol_size > 0) {
5555 Safefree(ctx->bfd_syms);
5556 Newx(ctx->bfd_syms, symbol_size, asymbol*);
5558 bfd_get_section_by_name(ctx->abfd, ".text");
5566 ctx->fname_prev = dl_info->dli_fname;
5570 /* Given a raw frame, try to symbolize it and store
5571 * symbol information (source file, line number) away. */
5572 static void bfd_symbolize(bfd_context* ctx,
5575 STRLEN* symbol_name_size,
5577 STRLEN* source_name_size,
5578 STRLEN* source_line)
5580 *symbol_name = NULL;
5581 *symbol_name_size = 0;
5583 IV offset = PTR2IV(raw_frame) - PTR2IV(ctx->bfd_text->vma);
5585 bfd_canonicalize_symtab(ctx->abfd, ctx->bfd_syms) > 0) {
5588 unsigned int line = 0;
5589 if (bfd_find_nearest_line(ctx->abfd, ctx->bfd_text,
5590 ctx->bfd_syms, offset,
5591 &file, &func, &line) &&
5592 file && func && line > 0) {
5593 /* Size and copy the source file, use only
5594 * the basename of the source file.
5596 * NOTE: the basenames are fine for the
5597 * Perl source files, but may not always
5598 * be the best idea for XS files. */
5599 const char *p, *b = NULL;
5600 /* Look for the last slash. */
5601 for (p = file; *p; p++) {
5605 if (b == NULL || *b == 0) {
5608 *source_name_size = p - b + 1;
5609 Newx(*source_name, *source_name_size + 1, char);
5610 Copy(b, *source_name, *source_name_size + 1, char);
5612 *symbol_name_size = strlen(func);
5613 Newx(*symbol_name, *symbol_name_size + 1, char);
5614 Copy(func, *symbol_name, *symbol_name_size + 1, char);
5616 *source_line = line;
5622 #endif /* #ifdef USE_BFD */
5626 /* OS X has no public API for for 'symbolicating' (Apple official term)
5627 * stack addresses to {function_name, source_file, line_number}.
5628 * Good news: there is command line utility atos(1) which does that.
5629 * Bad news 1: it's a command line utility.
5630 * Bad news 2: one needs to have the Developer Tools installed.
5631 * Bad news 3: in newer releases it needs to be run as 'xcrun atos'.
5633 * To recap: we need to open a pipe for reading for a utility which
5634 * might not exist, or exists in different locations, and then parse
5635 * the output. And since this is all for a low-level API, we cannot
5636 * use high-level stuff. Thanks, Apple. */
5639 /* tool is set to the absolute pathname of the tool to use:
5642 /* format is set to a printf format string used for building
5643 * the external command to run. */
5645 /* unavail is set if e.g. xcrun cannot be found, or something
5646 * else happens that makes getting the backtrace dubious. Note,
5647 * however, that the context isn't persistent, the next call to
5648 * get_c_backtrace() will start from scratch. */
5650 /* fname is the current object file name. */
5652 /* object_base_addr is the base address of the shared object. */
5653 void* object_base_addr;
5656 /* Given |dl_info|, updates the context. If the context has been
5657 * marked unavailable, return immediately. If not but the tool has
5658 * not been set, set it to either "xcrun atos" or "atos" (also set the
5659 * format to use for creating commands for piping), or if neither is
5660 * unavailable (one needs the Developer Tools installed), mark the context
5661 * an unavailable. Finally, update the filename (object name),
5662 * and its base address. */
5664 static void atos_update(atos_context* ctx,
5669 if (ctx->tool == NULL) {
5670 const char* tools[] = {
5674 const char* formats[] = {
5675 "/usr/bin/xcrun atos -o '%s' -l %08x %08x 2>&1",
5676 "/usr/bin/atos -d -o '%s' -l %08x %08x 2>&1"
5680 for (i = 0; i < C_ARRAY_LENGTH(tools); i++) {
5681 if (stat(tools[i], &st) == 0 && S_ISREG(st.st_mode)) {
5682 ctx->tool = tools[i];
5683 ctx->format = formats[i];
5687 if (ctx->tool == NULL) {
5688 ctx->unavail = TRUE;
5692 if (ctx->fname == NULL ||
5693 strNE(dl_info->dli_fname, ctx->fname)) {
5694 ctx->fname = dl_info->dli_fname;
5695 ctx->object_base_addr = dl_info->dli_fbase;
5699 /* Given an output buffer end |p| and its |start|, matches
5700 * for the atos output, extracting the source code location
5701 * if possible, returning NULL otherwise. */
5702 static const char* atos_parse(const char* p,
5704 STRLEN* source_name_size,
5705 STRLEN* source_line) {
5706 /* atos() outputs is something like:
5707 * perl_parse (in miniperl) (perl.c:2314)\n\n".
5708 * We cannot use Perl regular expressions, because we need to
5709 * stay low-level. Therefore here we have a rolled-out version
5710 * of a state machine which matches _backwards_from_the_end_ and
5711 * if there's a success, returns the starts of the filename,
5712 * also setting the filename size and the source line number.
5713 * The matched regular expression is roughly "\(.*:\d+\)\s*$" */
5714 const char* source_number_start;
5715 const char* source_name_end;
5716 /* Skip trailing whitespace. */
5717 while (p > start && isspace(*p)) p--;
5718 /* Now we should be at the close paren. */
5719 if (p == start || *p != ')')
5722 /* Now we should be in the line number. */
5723 if (p == start || !isdigit(*p))
5725 /* Skip over the digits. */
5726 while (p > start && isdigit(*p))
5728 /* Now we should be at the colon. */
5729 if (p == start || *p != ':')
5731 source_number_start = p + 1;
5732 source_name_end = p; /* Just beyond the end. */
5734 /* Look for the open paren. */
5735 while (p > start && *p != '(')
5740 *source_name_size = source_name_end - p;
5741 *source_line = atoi(source_number_start);
5745 /* Given a raw frame, read a pipe from the symbolicator (that's the
5746 * technical term) atos, reads the result, and parses the source code
5747 * location. We must stay low-level, so we use snprintf(), pipe(),
5748 * and fread(), and then also parse the output ourselves. */
5749 static void atos_symbolize(atos_context* ctx,
5752 STRLEN* source_name_size,
5753 STRLEN* source_line)
5761 /* Simple security measure: if there's any funny business with
5762 * the object name (used as "-o '%s'" ), leave since at least
5763 * partially the user controls it. */
5764 for (p = ctx->fname; *p; p++) {
5765 if (*p == '\'' || iscntrl(*p)) {
5766 ctx->unavail = TRUE;
5770 cnt = snprintf(cmd, sizeof(cmd), ctx->format,
5771 ctx->fname, ctx->object_base_addr, raw_frame);
5772 if (cnt < sizeof(cmd)) {
5773 /* Undo nostdio.h #defines that disable stdio.
5774 * This is somewhat naughty, but is used elsewhere
5775 * in the core, and affects only OS X. */
5780 FILE* fp = popen(cmd, "r");
5781 /* At the moment we open a new pipe for each stack frame.
5782 * This is naturally somewhat slow, but hopefully generating
5783 * stack traces is never going to in a performance critical path.
5785 * We could play tricks with atos by batching the stack
5786 * addresses to be resolved: atos can either take multiple
5787 * addresses from the command line, or read addresses from
5788 * a file (though the mess of creating temporary files would
5789 * probably negate much of any possible speedup).
5791 * Normally there are only two objects present in the backtrace:
5792 * perl itself, and the libdyld.dylib. (Note that the object
5793 * filenames contain the full pathname, so perl may not always
5794 * be in the same place.) Whenever the object in the
5795 * backtrace changes, the base address also changes.
5797 * The problem with batching the addresses, though, would be
5798 * matching the results with the addresses: the parsing of
5799 * the results is already painful enough with a single address. */
5802 UV cnt = fread(out, 1, sizeof(out), fp);
5803 if (cnt < sizeof(out)) {
5804 const char* p = atos_parse(out + cnt, out,
5809 *source_name_size + 1, char);
5810 Copy(p, *source_name,
5811 *source_name_size + 1, char);
5819 #endif /* #ifdef PERL_DARWIN */
5822 =for apidoc get_c_backtrace
5824 Collects the backtrace (aka "stacktrace") into a single linear
5825 malloced buffer, which the caller B<must> Perl_free_c_backtrace().
5827 Scans the frames back by depth + skip, then drops the skip innermost,
5828 returning at most depth frames.
5834 Perl_get_c_backtrace(pTHX_ int depth, int skip)
5836 /* Note that here we must stay as low-level as possible: Newx(),
5837 * Copy(), Safefree(); since we may be called from anywhere,
5838 * so we should avoid higher level constructs like SVs or AVs.
5840 * Since we are using safesysmalloc() via Newx(), don't try
5841 * getting backtrace() there, unless you like deep recursion. */
5843 /* Currently only implemented with backtrace() and dladdr(),
5844 * for other platforms NULL is returned. */
5846 #if defined(HAS_BACKTRACE) && defined(HAS_DLADDR)
5847 /* backtrace() is available via <execinfo.h> in glibc and in most
5848 * modern BSDs; dladdr() is available via <dlfcn.h>. */
5850 /* We try fetching this many frames total, but then discard
5851 * the |skip| first ones. For the remaining ones we will try
5852 * retrieving more information with dladdr(). */
5853 int try_depth = skip + depth;
5855 /* The addresses (program counters) returned by backtrace(). */
5858 /* Retrieved with dladdr() from the addresses returned by backtrace(). */
5861 /* Sizes _including_ the terminating \0 of the object name
5862 * and symbol name strings. */
5863 STRLEN* object_name_sizes;
5864 STRLEN* symbol_name_sizes;
5867 /* The symbol names comes either from dli_sname,
5868 * or if using BFD, they can come from BFD. */
5869 char** symbol_names;
5872 /* The source code location information. Dug out with e.g. BFD. */
5873 char** source_names;
5874 STRLEN* source_name_sizes;
5875 STRLEN* source_lines;
5877 Perl_c_backtrace* bt = NULL; /* This is what will be returned. */
5878 int got_depth; /* How many frames were returned from backtrace(). */
5879 UV frame_count = 0; /* How many frames we return. */
5880 UV total_bytes = 0; /* The size of the whole returned backtrace. */
5883 bfd_context bfd_ctx;
5886 atos_context atos_ctx;
5889 /* Here are probably possibilities for optimizing. We could for
5890 * example have a struct that contains most of these and then
5891 * allocate |try_depth| of them, saving a bunch of malloc calls.
5892 * Note, however, that |frames| could not be part of that struct
5893 * because backtrace() will want an array of just them. Also be
5894 * careful about the name strings. */
5895 Newx(raw_frames, try_depth, void*);
5896 Newx(dl_infos, try_depth, Dl_info);
5897 Newx(object_name_sizes, try_depth, STRLEN);
5898 Newx(symbol_name_sizes, try_depth, STRLEN);
5899 Newx(source_names, try_depth, char*);
5900 Newx(source_name_sizes, try_depth, STRLEN);
5901 Newx(source_lines, try_depth, STRLEN);
5903 Newx(symbol_names, try_depth, char*);
5906 /* Get the raw frames. */
5907 got_depth = (int)backtrace(raw_frames, try_depth);
5909 /* We use dladdr() instead of backtrace_symbols() because we want
5910 * the full details instead of opaque strings. This is useful for
5911 * two reasons: () the details are needed for further symbolic
5912 * digging, for example in OS X (2) by having the details we fully
5913 * control the output, which in turn is useful when more platforms
5914 * are added: we can keep out output "portable". */
5916 /* We want a single linear allocation, which can then be freed
5917 * with a single swoop. We will do the usual trick of first
5918 * walking over the structure and seeing how much we need to
5919 * allocate, then allocating, and then walking over the structure
5920 * the second time and populating it. */
5922 /* First we must compute the total size of the buffer. */
5923 total_bytes = sizeof(Perl_c_backtrace_header);
5924 if (got_depth > skip) {
5927 bfd_init(); /* Is this safe to call multiple times? */
5928 Zero(&bfd_ctx, 1, bfd_context);
5931 Zero(&atos_ctx, 1, atos_context);
5933 for (i = skip; i < try_depth; i++) {
5934 Dl_info* dl_info = &dl_infos[i];
5936 total_bytes += sizeof(Perl_c_backtrace_frame);
5938 source_names[i] = NULL;
5939 source_name_sizes[i] = 0;
5940 source_lines[i] = 0;
5942 /* Yes, zero from dladdr() is failure. */
5943 if (dladdr(raw_frames[i], dl_info)) {
5944 object_name_sizes[i] =
5945 dl_info->dli_fname ? strlen(dl_info->dli_fname) : 0;
5946 symbol_name_sizes[i] =
5947 dl_info->dli_sname ? strlen(dl_info->dli_sname) : 0;
5949 bfd_update(&bfd_ctx, dl_info);
5950 bfd_symbolize(&bfd_ctx, raw_frames[i],
5952 &symbol_name_sizes[i],
5954 &source_name_sizes[i],
5958 atos_update(&atos_ctx, dl_info);
5959 atos_symbolize(&atos_ctx,
5962 &source_name_sizes[i],
5966 /* Plus ones for the terminating \0. */
5967 total_bytes += object_name_sizes[i] + 1;
5968 total_bytes += symbol_name_sizes[i] + 1;
5969 total_bytes += source_name_sizes[i] + 1;
5977 Safefree(bfd_ctx.bfd_syms);
5981 /* Now we can allocate and populate the result buffer. */
5982 Newxc(bt, total_bytes, char, Perl_c_backtrace);
5983 Zero(bt, total_bytes, char);
5984 bt->header.frame_count = frame_count;
5985 bt->header.total_bytes = total_bytes;
5986 if (frame_count > 0) {
5987 Perl_c_backtrace_frame* frame = bt->frame_info;
5988 char* name_base = (char *)(frame + frame_count);
5989 char* name_curr = name_base; /* Outputting the name strings here. */
5991 for (i = skip; i < skip + frame_count; i++) {
5992 Dl_info* dl_info = &dl_infos[i];
5994 frame->addr = raw_frames[i];
5995 frame->object_base_addr = dl_info->dli_fbase;
5996 frame->symbol_addr = dl_info->dli_saddr;
5998 /* Copies a string, including the \0, and advances the name_curr.
5999 * Also copies the start and the size to the frame. */
6000 #define PERL_C_BACKTRACE_STRCPY(frame, doffset, src, dsize, size) \
6002 Copy(src, name_curr, size, char); \
6003 frame->doffset = name_curr - (char*)bt; \
6004 frame->dsize = size; \
6005 name_curr += size; \
6008 PERL_C_BACKTRACE_STRCPY(frame, object_name_offset,
6010 object_name_size, object_name_sizes[i]);
6013 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6015 symbol_name_size, symbol_name_sizes[i]);
6016 Safefree(symbol_names[i]);
6018 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6020 symbol_name_size, symbol_name_sizes[i]);
6023 PERL_C_BACKTRACE_STRCPY(frame, source_name_offset,
6025 source_name_size, source_name_sizes[i]);
6026 Safefree(source_names[i]);
6028 #undef PERL_C_BACKTRACE_STRCPY
6030 frame->source_line_number = source_lines[i];
6034 assert(total_bytes ==
6035 (UV)(sizeof(Perl_c_backtrace_header) +
6036 frame_count * sizeof(Perl_c_backtrace_frame) +
6037 name_curr - name_base));
6040 Safefree(symbol_names);
6042 Safefree(source_lines);
6043 Safefree(source_name_sizes);
6044 Safefree(source_names);
6045 Safefree(symbol_name_sizes);
6046 Safefree(object_name_sizes);
6047 /* Assuming the strings returned by dladdr() are pointers
6048 * to read-only static memory (the object file), so that
6049 * they do not need freeing (and cannot be). */
6051 Safefree(raw_frames);
6054 PERL_UNUSED_ARGV(depth);
6055 PERL_UNUSED_ARGV(skip);
6061 =for apidoc free_c_backtrace
6063 Deallocates a backtrace received from get_c_bracktrace.
6069 =for apidoc get_c_backtrace_dump
6071 Returns a SV a dump of |depth| frames of the call stack, skipping
6072 the |skip| innermost ones. depth of 20 is usually enough.
6074 The appended output looks like:
6077 1 10e004812:0082 Perl_croak util.c:1716 /usr/bin/perl
6078 2 10df8d6d2:1d72 perl_parse perl.c:3975 /usr/bin/perl
6081 The fields are tab-separated. The first column is the depth (zero
6082 being the innermost non-skipped frame). In the hex:offset, the hex is
6083 where the program counter was in S_parse_body, and the :offset (might
6084 be missing) tells how much inside the S_parse_body the program counter was.
6086 The util.c:1716 is the source code file and line number.
6088 The /usr/bin/perl is obvious (hopefully).
6090 Unknowns are C<"-">. Unknowns can happen unfortunately quite easily:
6091 if the platform doesn't support retrieving the information;
6092 if the binary is missing the debug information;
6093 if the optimizer has transformed the code by for example inlining.
6099 Perl_get_c_backtrace_dump(pTHX_ int depth, int skip)
6101 Perl_c_backtrace* bt;
6103 bt = get_c_backtrace(depth, skip + 1 /* Hide ourselves. */);
6105 Perl_c_backtrace_frame* frame;
6106 SV* dsv = newSVpvs("");
6108 for (i = 0, frame = bt->frame_info;
6109 i < bt->header.frame_count; i++, frame++) {
6110 Perl_sv_catpvf(aTHX_ dsv, "%d", (int)i);
6111 Perl_sv_catpvf(aTHX_ dsv, "\t%p", frame->addr ? frame->addr : "-");
6112 /* Symbol (function) names might disappear without debug info.
6114 * The source code location might disappear in case of the
6115 * optimizer inlining or otherwise rearranging the code. */
6116 if (frame->symbol_addr) {
6117 Perl_sv_catpvf(aTHX_ dsv, ":%04x",
6119 ((char*)frame->addr - (char*)frame->symbol_addr));
6121 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6122 frame->symbol_name_size &&
6123 frame->symbol_name_offset ?
6124 (char*)bt + frame->symbol_name_offset : "-");
6125 if (frame->source_name_size &&
6126 frame->source_name_offset &&
6127 frame->source_line_number) {
6128 Perl_sv_catpvf(aTHX_ dsv, "\t%s:%"UVuf,
6129 (char*)bt + frame->source_name_offset,
6130 (UV)frame->source_line_number);
6132 Perl_sv_catpvf(aTHX_ dsv, "\t-");
6134 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6135 frame->object_name_size &&
6136 frame->object_name_offset ?
6137 (char*)bt + frame->object_name_offset : "-");
6138 /* The frame->object_base_addr is not output,
6139 * but it is used for symbolizing/symbolicating. */
6140 sv_catpvs(dsv, "\n");
6143 Perl_free_c_backtrace(aTHX_ bt);
6152 =for apidoc dump_c_backtrace
6154 Dumps the C backtrace to the given fp.
6156 Returns true if a backtrace could be retrieved, false if not.
6162 Perl_dump_c_backtrace(pTHX_ PerlIO* fp, int depth, int skip)
6166 PERL_ARGS_ASSERT_DUMP_C_BACKTRACE;
6168 sv = Perl_get_c_backtrace_dump(aTHX_ depth, skip);
6171 PerlIO_printf(fp, "%s", SvPV_nolen(sv));
6177 #endif /* #ifdef USE_C_BACKTRACE */
6181 * c-indentation-style: bsd
6183 * indent-tabs-mode: nil
6186 * ex: set ts=8 sts=4 sw=4 et: