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 */
49 # include "amigaos4/amigaio.h"
54 # include <sys/select.h>
58 #ifdef USE_C_BACKTRACE
62 # undef USE_BFD /* BFD is useless in OS X. */
72 # include <execinfo.h>
76 #ifdef PERL_DEBUG_READONLY_COW
77 # include <sys/mman.h>
82 /* NOTE: Do not call the next three routines directly. Use the macros
83 * in handy.h, so that we can easily redefine everything to do tracking of
84 * allocated hunks back to the original New to track down any memory leaks.
85 * XXX This advice seems to be widely ignored :-( --AD August 1996.
88 #if defined (DEBUGGING) || defined(PERL_IMPLICIT_SYS) || defined (PERL_TRACK_MEMPOOL)
89 # define ALWAYS_NEED_THX
92 #if defined(PERL_TRACK_MEMPOOL) && defined(PERL_DEBUG_READONLY_COW)
94 S_maybe_protect_rw(pTHX_ struct perl_memory_debug_header *header)
97 && mprotect(header, header->size, PROT_READ|PROT_WRITE))
98 Perl_warn(aTHX_ "mprotect for COW string %p %lu failed with %d",
99 header, header->size, errno);
103 S_maybe_protect_ro(pTHX_ struct perl_memory_debug_header *header)
106 && mprotect(header, header->size, PROT_READ))
107 Perl_warn(aTHX_ "mprotect RW for COW string %p %lu failed with %d",
108 header, header->size, errno);
110 # define maybe_protect_rw(foo) S_maybe_protect_rw(aTHX_ foo)
111 # define maybe_protect_ro(foo) S_maybe_protect_ro(aTHX_ foo)
113 # define maybe_protect_rw(foo) NOOP
114 # define maybe_protect_ro(foo) NOOP
117 #if defined(PERL_TRACK_MEMPOOL) || defined(PERL_DEBUG_READONLY_COW)
118 /* Use memory_debug_header */
120 # if (defined(PERL_POISON) && defined(PERL_TRACK_MEMPOOL)) \
121 || defined(PERL_DEBUG_READONLY_COW)
122 # define MDH_HAS_SIZE
126 /* paranoid version of system's malloc() */
129 Perl_safesysmalloc(MEM_SIZE size)
131 #ifdef ALWAYS_NEED_THX
137 if (size + PERL_MEMORY_DEBUG_HEADER_SIZE < size)
139 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
142 if ((SSize_t)size < 0)
143 Perl_croak_nocontext("panic: malloc, size=%" UVuf, (UV) size);
145 if (!size) size = 1; /* malloc(0) is NASTY on our system */
146 #ifdef PERL_DEBUG_READONLY_COW
147 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
148 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
149 perror("mmap failed");
153 ptr = (Malloc_t)PerlMem_malloc(size?size:1);
155 PERL_ALLOC_CHECK(ptr);
158 struct perl_memory_debug_header *const header
159 = (struct perl_memory_debug_header *)ptr;
163 PoisonNew(((char *)ptr), size, char);
166 #ifdef PERL_TRACK_MEMPOOL
167 header->interpreter = aTHX;
168 /* Link us into the list. */
169 header->prev = &PL_memory_debug_header;
170 header->next = PL_memory_debug_header.next;
171 PL_memory_debug_header.next = header;
172 maybe_protect_rw(header->next);
173 header->next->prev = header;
174 maybe_protect_ro(header->next);
175 # ifdef PERL_DEBUG_READONLY_COW
176 header->readonly = 0;
182 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
183 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
191 #ifndef ALWAYS_NEED_THX
203 /* paranoid version of system's realloc() */
206 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
208 #ifdef ALWAYS_NEED_THX
212 #ifdef PERL_DEBUG_READONLY_COW
213 const MEM_SIZE oldsize = where
214 ? ((struct perl_memory_debug_header *)((char *)where - PERL_MEMORY_DEBUG_HEADER_SIZE))->size
217 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
218 Malloc_t PerlMem_realloc();
219 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
226 ptr = safesysmalloc(size);
230 where = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
231 if (size + PERL_MEMORY_DEBUG_HEADER_SIZE < size)
233 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
235 struct perl_memory_debug_header *const header
236 = (struct perl_memory_debug_header *)where;
238 # ifdef PERL_TRACK_MEMPOOL
239 if (header->interpreter != aTHX) {
240 Perl_croak_nocontext("panic: realloc from wrong pool, %p!=%p",
241 header->interpreter, aTHX);
243 assert(header->next->prev == header);
244 assert(header->prev->next == header);
246 if (header->size > size) {
247 const MEM_SIZE freed_up = header->size - size;
248 char *start_of_freed = ((char *)where) + size;
249 PoisonFree(start_of_freed, freed_up, char);
259 if ((SSize_t)size < 0)
260 Perl_croak_nocontext("panic: realloc, size=%" UVuf, (UV)size);
262 #ifdef PERL_DEBUG_READONLY_COW
263 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
264 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
265 perror("mmap failed");
268 Copy(where,ptr,oldsize < size ? oldsize : size,char);
269 if (munmap(where, oldsize)) {
270 perror("munmap failed");
274 ptr = (Malloc_t)PerlMem_realloc(where,size);
276 PERL_ALLOC_CHECK(ptr);
278 /* MUST do this fixup first, before doing ANYTHING else, as anything else
279 might allocate memory/free/move memory, and until we do the fixup, it
280 may well be chasing (and writing to) free memory. */
282 #ifdef PERL_TRACK_MEMPOOL
283 struct perl_memory_debug_header *const header
284 = (struct perl_memory_debug_header *)ptr;
287 if (header->size < size) {
288 const MEM_SIZE fresh = size - header->size;
289 char *start_of_fresh = ((char *)ptr) + size;
290 PoisonNew(start_of_fresh, fresh, char);
294 maybe_protect_rw(header->next);
295 header->next->prev = header;
296 maybe_protect_ro(header->next);
297 maybe_protect_rw(header->prev);
298 header->prev->next = header;
299 maybe_protect_ro(header->prev);
301 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
304 /* In particular, must do that fixup above before logging anything via
305 *printf(), as it can reallocate memory, which can cause SEGVs. */
307 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
308 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
315 #ifndef ALWAYS_NEED_THX
328 /* safe version of system's free() */
331 Perl_safesysfree(Malloc_t where)
333 #ifdef ALWAYS_NEED_THX
336 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
339 Malloc_t where_intrn = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
341 struct perl_memory_debug_header *const header
342 = (struct perl_memory_debug_header *)where_intrn;
345 const MEM_SIZE size = header->size;
347 # ifdef PERL_TRACK_MEMPOOL
348 if (header->interpreter != aTHX) {
349 Perl_croak_nocontext("panic: free from wrong pool, %p!=%p",
350 header->interpreter, aTHX);
353 Perl_croak_nocontext("panic: duplicate free");
356 Perl_croak_nocontext("panic: bad free, header->next==NULL");
357 if (header->next->prev != header || header->prev->next != header) {
358 Perl_croak_nocontext("panic: bad free, ->next->prev=%p, "
359 "header=%p, ->prev->next=%p",
360 header->next->prev, header,
363 /* Unlink us from the chain. */
364 maybe_protect_rw(header->next);
365 header->next->prev = header->prev;
366 maybe_protect_ro(header->next);
367 maybe_protect_rw(header->prev);
368 header->prev->next = header->next;
369 maybe_protect_ro(header->prev);
370 maybe_protect_rw(header);
372 PoisonNew(where_intrn, size, char);
374 /* Trigger the duplicate free warning. */
377 # ifdef PERL_DEBUG_READONLY_COW
378 if (munmap(where_intrn, size)) {
379 perror("munmap failed");
385 Malloc_t where_intrn = where;
387 #ifndef PERL_DEBUG_READONLY_COW
388 PerlMem_free(where_intrn);
393 /* safe version of system's calloc() */
396 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
398 #ifdef ALWAYS_NEED_THX
402 #if defined(USE_MDH) || defined(DEBUGGING)
403 MEM_SIZE total_size = 0;
406 /* Even though calloc() for zero bytes is strange, be robust. */
407 if (size && (count <= MEM_SIZE_MAX / size)) {
408 #if defined(USE_MDH) || defined(DEBUGGING)
409 total_size = size * count;
415 if (PERL_MEMORY_DEBUG_HEADER_SIZE <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
416 total_size += PERL_MEMORY_DEBUG_HEADER_SIZE;
421 if ((SSize_t)size < 0 || (SSize_t)count < 0)
422 Perl_croak_nocontext("panic: calloc, size=%" UVuf ", count=%" UVuf,
423 (UV)size, (UV)count);
425 #ifdef PERL_DEBUG_READONLY_COW
426 if ((ptr = mmap(0, total_size ? total_size : 1, PROT_READ|PROT_WRITE,
427 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
428 perror("mmap failed");
431 #elif defined(PERL_TRACK_MEMPOOL)
432 /* Have to use malloc() because we've added some space for our tracking
434 /* malloc(0) is non-portable. */
435 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
437 /* Use calloc() because it might save a memset() if the memory is fresh
438 and clean from the OS. */
440 ptr = (Malloc_t)PerlMem_calloc(count, size);
441 else /* calloc(0) is non-portable. */
442 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
444 PERL_ALLOC_CHECK(ptr);
445 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));
449 struct perl_memory_debug_header *const header
450 = (struct perl_memory_debug_header *)ptr;
452 # ifndef PERL_DEBUG_READONLY_COW
453 memset((void*)ptr, 0, total_size);
455 # ifdef PERL_TRACK_MEMPOOL
456 header->interpreter = aTHX;
457 /* Link us into the list. */
458 header->prev = &PL_memory_debug_header;
459 header->next = PL_memory_debug_header.next;
460 PL_memory_debug_header.next = header;
461 maybe_protect_rw(header->next);
462 header->next->prev = header;
463 maybe_protect_ro(header->next);
464 # ifdef PERL_DEBUG_READONLY_COW
465 header->readonly = 0;
469 header->size = total_size;
471 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
477 #ifndef ALWAYS_NEED_THX
486 /* These must be defined when not using Perl's malloc for binary
491 Malloc_t Perl_malloc (MEM_SIZE nbytes)
493 #ifdef PERL_IMPLICIT_SYS
496 return (Malloc_t)PerlMem_malloc(nbytes);
499 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
501 #ifdef PERL_IMPLICIT_SYS
504 return (Malloc_t)PerlMem_calloc(elements, size);
507 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
509 #ifdef PERL_IMPLICIT_SYS
512 return (Malloc_t)PerlMem_realloc(where, nbytes);
515 Free_t Perl_mfree (Malloc_t where)
517 #ifdef PERL_IMPLICIT_SYS
525 /* copy a string up to some (non-backslashed) delimiter, if any.
526 * With allow_escape, converts \<delimiter> to <delimiter>, while leaves
527 * \<non-delimiter> as-is.
528 * Returns the position in the src string of the closing delimiter, if
529 * any, or returns fromend otherwise.
530 * This is the internal implementation for Perl_delimcpy and
531 * Perl_delimcpy_no_escape.
535 S_delimcpy_intern(char *to, const char *toend, const char *from,
536 const char *fromend, int delim, I32 *retlen,
537 const bool allow_escape)
541 PERL_ARGS_ASSERT_DELIMCPY;
543 for (tolen = 0; from < fromend; from++, tolen++) {
544 if (allow_escape && *from == '\\' && from + 1 < fromend) {
545 if (from[1] != delim) {
552 else if (*from == delim)
564 Perl_delimcpy(char *to, const char *toend, const char *from, const char *fromend, int delim, I32 *retlen)
566 PERL_ARGS_ASSERT_DELIMCPY;
568 return S_delimcpy_intern(to, toend, from, fromend, delim, retlen, 1);
572 Perl_delimcpy_no_escape(char *to, const char *toend, const char *from,
573 const char *fromend, int delim, I32 *retlen)
575 PERL_ARGS_ASSERT_DELIMCPY_NO_ESCAPE;
577 return S_delimcpy_intern(to, toend, from, fromend, delim, retlen, 0);
581 =head1 Miscellaneous Functions
583 =for apidoc Am|char *|ninstr|char * big|char * bigend|char * little|char * little_end
585 Find the first (leftmost) occurrence of a sequence of bytes within another
586 sequence. This is the Perl version of C<strstr()>, extended to handle
587 arbitrary sequences, potentially containing embedded C<NUL> characters (C<NUL>
588 is what the initial C<n> in the function name stands for; some systems have an
589 equivalent, C<memmem()>, but with a somewhat different API).
591 Another way of thinking about this function is finding a needle in a haystack.
592 C<big> points to the first byte in the haystack. C<big_end> points to one byte
593 beyond the final byte in the haystack. C<little> points to the first byte in
594 the needle. C<little_end> points to one byte beyond the final byte in the
595 needle. All the parameters must be non-C<NULL>.
597 The function returns C<NULL> if there is no occurrence of C<little> within
598 C<big>. If C<little> is the empty string, C<big> is returned.
600 Because this function operates at the byte level, and because of the inherent
601 characteristics of UTF-8 (or UTF-EBCDIC), it will work properly if both the
602 needle and the haystack are strings with the same UTF-8ness, but not if the
610 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
612 PERL_ARGS_ASSERT_NINSTR;
615 return ninstr(big, bigend, little, lend);
621 const char first = *little;
622 bigend -= lend - little++;
624 while (big <= bigend) {
625 if (*big++ == first) {
627 for (x=big,s=little; s < lend; x++,s++) {
631 return (char*)(big-1);
642 =head1 Miscellaneous Functions
644 =for apidoc Am|char *|rninstr|char * big|char * bigend|char * little|char * little_end
646 Like C<L</ninstr>>, but instead finds the final (rightmost) occurrence of a
647 sequence of bytes within another sequence, returning C<NULL> if there is no
655 Perl_rninstr(const char *big, const char *bigend, const char *little, const char *lend)
658 const I32 first = *little;
659 const char * const littleend = lend;
661 PERL_ARGS_ASSERT_RNINSTR;
663 if (little >= littleend)
664 return (char*)bigend;
666 big = bigend - (littleend - little++);
667 while (big >= bigbeg) {
671 for (x=big+2,s=little; s < littleend; /**/ ) {
680 return (char*)(big+1);
685 /* As a space optimization, we do not compile tables for strings of length
686 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
687 special-cased in fbm_instr().
689 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
692 =head1 Miscellaneous Functions
694 =for apidoc fbm_compile
696 Analyses the string in order to make fast searches on it using C<fbm_instr()>
697 -- the Boyer-Moore algorithm.
703 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
710 PERL_DEB( STRLEN rarest = 0 );
712 PERL_ARGS_ASSERT_FBM_COMPILE;
714 if (isGV_with_GP(sv) || SvROK(sv))
720 if (flags & FBMcf_TAIL) {
721 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
722 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
723 if (mg && mg->mg_len >= 0)
726 if (!SvPOK(sv) || SvNIOKp(sv))
727 s = (U8*)SvPV_force_mutable(sv, len);
728 else s = (U8 *)SvPV_mutable(sv, len);
729 if (len == 0) /* TAIL might be on a zero-length string. */
731 SvUPGRADE(sv, SVt_PVMG);
735 /* add PERL_MAGIC_bm magic holding the FBM lookup table */
737 assert(!mg_find(sv, PERL_MAGIC_bm));
738 mg = sv_magicext(sv, NULL, PERL_MAGIC_bm, &PL_vtbl_bm, NULL, 0);
742 /* Shorter strings are special-cased in Perl_fbm_instr(), and don't use
744 const U8 mlen = (len>255) ? 255 : (U8)len;
745 const unsigned char *const sb = s + len - mlen; /* first char (maybe) */
748 Newx(table, 256, U8);
749 memset((void*)table, mlen, 256);
750 mg->mg_ptr = (char *)table;
753 s += len - 1; /* last char */
756 if (table[*s] == mlen)
762 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
763 for (i = 0; i < len; i++) {
764 if (PL_freq[s[i]] < frequency) {
765 PERL_DEB( rarest = i );
766 frequency = PL_freq[s[i]];
769 BmUSEFUL(sv) = 100; /* Initial value */
770 ((XPVNV*)SvANY(sv))->xnv_u.xnv_bm_tail = cBOOL(flags & FBMcf_TAIL);
771 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %" UVuf "\n",
772 s[rarest], (UV)rarest));
777 =for apidoc fbm_instr
779 Returns the location of the SV in the string delimited by C<big> and
780 C<bigend> (C<bigend>) is the char following the last char).
781 It returns C<NULL> if the string can't be found. The C<sv>
782 does not have to be C<fbm_compiled>, but the search will not be as fast
787 If SvTAIL(littlestr) is true, a fake "\n" was appended to to the string
788 during FBM compilation due to FBMcf_TAIL in flags. It indicates that
789 the littlestr must be anchored to the end of bigstr (or to any \n if
792 E.g. The regex compiler would compile /abc/ to a littlestr of "abc",
793 while /abc$/ compiles to "abc\n" with SvTAIL() true.
795 A littlestr of "abc", !SvTAIL matches as /abc/;
796 a littlestr of "ab\n", SvTAIL matches as:
797 without FBMrf_MULTILINE: /ab\n?\z/
798 with FBMrf_MULTILINE: /ab\n/ || /ab\z/;
800 (According to Ilya from 1999; I don't know if this is still true, DAPM 2015):
801 "If SvTAIL is actually due to \Z or \z, this gives false positives
807 Perl_fbm_instr(pTHX_ unsigned char *big, unsigned char *bigend, SV *littlestr, U32 flags)
811 const unsigned char *little = (const unsigned char *)SvPV_const(littlestr,l);
812 STRLEN littlelen = l;
813 const I32 multiline = flags & FBMrf_MULTILINE;
814 bool valid = SvVALID(littlestr);
815 bool tail = valid ? cBOOL(SvTAIL(littlestr)) : FALSE;
817 PERL_ARGS_ASSERT_FBM_INSTR;
819 assert(bigend >= big);
821 if ((STRLEN)(bigend - big) < littlelen) {
823 && ((STRLEN)(bigend - big) == littlelen - 1)
825 || (*big == *little &&
826 memEQ((char *)big, (char *)little, littlelen - 1))))
831 switch (littlelen) { /* Special cases for 0, 1 and 2 */
833 return (char*)big; /* Cannot be SvTAIL! */
836 if (tail && !multiline) /* Anchor only! */
837 /* [-1] is safe because we know that bigend != big. */
838 return (char *) (bigend - (bigend[-1] == '\n'));
840 s = (unsigned char *)memchr((void*)big, *little, bigend-big);
844 return (char *) bigend;
848 if (tail && !multiline) {
849 /* a littlestr with SvTAIL must be of the form "X\n" (where X
850 * is a single char). It is anchored, and can only match
851 * "....X\n" or "....X" */
852 if (bigend[-2] == *little && bigend[-1] == '\n')
853 return (char*)bigend - 2;
854 if (bigend[-1] == *little)
855 return (char*)bigend - 1;
860 /* memchr() is likely to be very fast, possibly using whatever
861 * hardware support is available, such as checking a whole
862 * cache line in one instruction.
863 * So for a 2 char pattern, calling memchr() is likely to be
864 * faster than running FBM, or rolling our own. The previous
865 * version of this code was roll-your-own which typically
866 * only needed to read every 2nd char, which was good back in
867 * the day, but no longer.
869 unsigned char c1 = little[0];
870 unsigned char c2 = little[1];
872 /* *** for all this case, bigend points to the last char,
873 * not the trailing \0: this makes the conditions slightly
879 /* do a quick test for c1 before calling memchr();
880 * this avoids the expensive fn call overhead when
881 * there are lots of c1's */
882 if (LIKELY(*s != c1)) {
884 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
891 /* failed; try searching for c2 this time; that way
892 * we don't go pathologically slow when the string
893 * consists mostly of c1's or vice versa.
898 s = (unsigned char *)memchr((void*)s, c2, bigend - s + 1);
906 /* c1, c2 the same */
916 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
917 if (!s || s >= bigend)
924 /* failed to find 2 chars; try anchored match at end without
926 if (tail && bigend[0] == little[0])
927 return (char *)bigend;
932 break; /* Only lengths 0 1 and 2 have special-case code. */
935 if (tail && !multiline) { /* tail anchored? */
936 s = bigend - littlelen;
937 if (s >= big && bigend[-1] == '\n' && *s == *little
938 /* Automatically of length > 2 */
939 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
941 return (char*)s; /* how sweet it is */
944 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
946 return (char*)s + 1; /* how sweet it is */
952 /* not compiled; use Perl_ninstr() instead */
953 char * const b = ninstr((char*)big,(char*)bigend,
954 (char*)little, (char*)little + littlelen);
956 assert(!tail); /* valid => FBM; tail only set on SvVALID SVs */
961 if (littlelen > (STRLEN)(bigend - big))
965 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
966 const unsigned char *oldlittle;
970 --littlelen; /* Last char found by table lookup */
973 little += littlelen; /* last char */
976 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
977 const unsigned char lastc = *little;
981 if ((tmp = table[*s])) {
982 /* *s != lastc; earliest position it could match now is
983 * tmp slots further on */
984 if ((s += tmp) >= bigend)
986 if (LIKELY(*s != lastc)) {
988 s = (unsigned char *)memchr((void*)s, lastc, bigend - s);
998 /* hand-rolled strncmp(): less expensive than calling the
999 * real function (maybe???) */
1001 unsigned char * const olds = s;
1006 if (*--s == *--little)
1008 s = olds + 1; /* here we pay the price for failure */
1010 if (s < bigend) /* fake up continue to outer loop */
1020 && memEQ((char *)(bigend - littlelen),
1021 (char *)(oldlittle - littlelen), littlelen) )
1022 return (char*)bigend - littlelen;
1027 /* copy a string to a safe spot */
1030 =head1 Memory Management
1034 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1035 string which is a duplicate of C<pv>. The size of the string is
1036 determined by C<strlen()>, which means it may not contain embedded C<NUL>
1037 characters and must have a trailing C<NUL>. The memory allocated for the new
1038 string can be freed with the C<Safefree()> function.
1040 On some platforms, Windows for example, all allocated memory owned by a thread
1041 is deallocated when that thread ends. So if you need that not to happen, you
1042 need to use the shared memory functions, such as C<L</savesharedpv>>.
1048 Perl_savepv(pTHX_ const char *pv)
1050 PERL_UNUSED_CONTEXT;
1055 const STRLEN pvlen = strlen(pv)+1;
1056 Newx(newaddr, pvlen, char);
1057 return (char*)memcpy(newaddr, pv, pvlen);
1061 /* same thing but with a known length */
1066 Perl's version of what C<strndup()> would be if it existed. Returns a
1067 pointer to a newly allocated string which is a duplicate of the first
1068 C<len> bytes from C<pv>, plus a trailing
1069 C<NUL> byte. The memory allocated for
1070 the new string can be freed with the C<Safefree()> function.
1072 On some platforms, Windows for example, all allocated memory owned by a thread
1073 is deallocated when that thread ends. So if you need that not to happen, you
1074 need to use the shared memory functions, such as C<L</savesharedpvn>>.
1080 Perl_savepvn(pTHX_ const char *pv, I32 len)
1083 PERL_UNUSED_CONTEXT;
1087 Newx(newaddr,len+1,char);
1088 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1090 /* might not be null terminated */
1091 newaddr[len] = '\0';
1092 return (char *) CopyD(pv,newaddr,len,char);
1095 return (char *) ZeroD(newaddr,len+1,char);
1100 =for apidoc savesharedpv
1102 A version of C<savepv()> which allocates the duplicate string in memory
1103 which is shared between threads.
1108 Perl_savesharedpv(pTHX_ const char *pv)
1113 PERL_UNUSED_CONTEXT;
1118 pvlen = strlen(pv)+1;
1119 newaddr = (char*)PerlMemShared_malloc(pvlen);
1123 return (char*)memcpy(newaddr, pv, pvlen);
1127 =for apidoc savesharedpvn
1129 A version of C<savepvn()> which allocates the duplicate string in memory
1130 which is shared between threads. (With the specific difference that a C<NULL>
1131 pointer is not acceptable)
1136 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1138 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1140 PERL_UNUSED_CONTEXT;
1141 /* PERL_ARGS_ASSERT_SAVESHAREDPVN; */
1146 newaddr[len] = '\0';
1147 return (char*)memcpy(newaddr, pv, len);
1151 =for apidoc savesvpv
1153 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1154 the passed in SV using C<SvPV()>
1156 On some platforms, Windows for example, all allocated memory owned by a thread
1157 is deallocated when that thread ends. So if you need that not to happen, you
1158 need to use the shared memory functions, such as C<L</savesharedsvpv>>.
1164 Perl_savesvpv(pTHX_ SV *sv)
1167 const char * const pv = SvPV_const(sv, len);
1170 PERL_ARGS_ASSERT_SAVESVPV;
1173 Newx(newaddr,len,char);
1174 return (char *) CopyD(pv,newaddr,len,char);
1178 =for apidoc savesharedsvpv
1180 A version of C<savesharedpv()> which allocates the duplicate string in
1181 memory which is shared between threads.
1187 Perl_savesharedsvpv(pTHX_ SV *sv)
1190 const char * const pv = SvPV_const(sv, len);
1192 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1194 return savesharedpvn(pv, len);
1197 /* the SV for Perl_form() and mess() is not kept in an arena */
1205 if (PL_phase != PERL_PHASE_DESTRUCT)
1206 return newSVpvs_flags("", SVs_TEMP);
1211 /* Create as PVMG now, to avoid any upgrading later */
1213 Newxz(any, 1, XPVMG);
1214 SvFLAGS(sv) = SVt_PVMG;
1215 SvANY(sv) = (void*)any;
1217 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1222 #if defined(PERL_IMPLICIT_CONTEXT)
1224 Perl_form_nocontext(const char* pat, ...)
1229 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1230 va_start(args, pat);
1231 retval = vform(pat, &args);
1235 #endif /* PERL_IMPLICIT_CONTEXT */
1238 =head1 Miscellaneous Functions
1241 Takes a sprintf-style format pattern and conventional
1242 (non-SV) arguments and returns the formatted string.
1244 (char *) Perl_form(pTHX_ const char* pat, ...)
1246 can be used any place a string (char *) is required:
1248 char * s = Perl_form("%d.%d",major,minor);
1250 Uses a single private buffer so if you want to format several strings you
1251 must explicitly copy the earlier strings away (and free the copies when you
1258 Perl_form(pTHX_ const char* pat, ...)
1262 PERL_ARGS_ASSERT_FORM;
1263 va_start(args, pat);
1264 retval = vform(pat, &args);
1270 Perl_vform(pTHX_ const char *pat, va_list *args)
1272 SV * const sv = mess_alloc();
1273 PERL_ARGS_ASSERT_VFORM;
1274 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1279 =for apidoc Am|SV *|mess|const char *pat|...
1281 Take a sprintf-style format pattern and argument list. These are used to
1282 generate a string message. If the message does not end with a newline,
1283 then it will be extended with some indication of the current location
1284 in the code, as described for L</mess_sv>.
1286 Normally, the resulting message is returned in a new mortal SV.
1287 During global destruction a single SV may be shared between uses of
1293 #if defined(PERL_IMPLICIT_CONTEXT)
1295 Perl_mess_nocontext(const char *pat, ...)
1300 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1301 va_start(args, pat);
1302 retval = vmess(pat, &args);
1306 #endif /* PERL_IMPLICIT_CONTEXT */
1309 Perl_mess(pTHX_ const char *pat, ...)
1313 PERL_ARGS_ASSERT_MESS;
1314 va_start(args, pat);
1315 retval = vmess(pat, &args);
1321 Perl_closest_cop(pTHX_ const COP *cop, const OP *o, const OP *curop,
1324 /* Look for curop starting from o. cop is the last COP we've seen. */
1325 /* opnext means that curop is actually the ->op_next of the op we are
1328 PERL_ARGS_ASSERT_CLOSEST_COP;
1330 if (!o || !curop || (
1331 opnext ? o->op_next == curop && o->op_type != OP_SCOPE : o == curop
1335 if (o->op_flags & OPf_KIDS) {
1337 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
1340 /* If the OP_NEXTSTATE has been optimised away we can still use it
1341 * the get the file and line number. */
1343 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1344 cop = (const COP *)kid;
1346 /* Keep searching, and return when we've found something. */
1348 new_cop = closest_cop(cop, kid, curop, opnext);
1354 /* Nothing found. */
1360 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1362 Expands a message, intended for the user, to include an indication of
1363 the current location in the code, if the message does not already appear
1366 C<basemsg> is the initial message or object. If it is a reference, it
1367 will be used as-is and will be the result of this function. Otherwise it
1368 is used as a string, and if it already ends with a newline, it is taken
1369 to be complete, and the result of this function will be the same string.
1370 If the message does not end with a newline, then a segment such as C<at
1371 foo.pl line 37> will be appended, and possibly other clauses indicating
1372 the current state of execution. The resulting message will end with a
1375 Normally, the resulting message is returned in a new mortal SV.
1376 During global destruction a single SV may be shared between uses of this
1377 function. If C<consume> is true, then the function is permitted (but not
1378 required) to modify and return C<basemsg> instead of allocating a new SV.
1384 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1388 #if defined(USE_C_BACKTRACE) && defined(USE_C_BACKTRACE_ON_ERROR)
1392 /* The PERL_C_BACKTRACE_ON_WARN must be an integer of one or more. */
1393 if ((ws = PerlEnv_getenv("PERL_C_BACKTRACE_ON_ERROR"))
1394 && grok_atoUV(ws, &wi, NULL)
1395 && wi <= PERL_INT_MAX
1397 Perl_dump_c_backtrace(aTHX_ Perl_debug_log, (int)wi, 1);
1402 PERL_ARGS_ASSERT_MESS_SV;
1404 if (SvROK(basemsg)) {
1410 sv_setsv(sv, basemsg);
1415 if (SvPOK(basemsg) && consume) {
1420 sv_copypv(sv, basemsg);
1423 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1425 * Try and find the file and line for PL_op. This will usually be
1426 * PL_curcop, but it might be a cop that has been optimised away. We
1427 * can try to find such a cop by searching through the optree starting
1428 * from the sibling of PL_curcop.
1433 closest_cop(PL_curcop, OpSIBLING(PL_curcop), PL_op, FALSE);
1438 Perl_sv_catpvf(aTHX_ sv, " at %s line %" IVdf,
1439 OutCopFILE(cop), (IV)CopLINE(cop));
1442 /* Seems that GvIO() can be untrustworthy during global destruction. */
1443 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1444 && IoLINES(GvIOp(PL_last_in_gv)))
1447 const bool line_mode = (RsSIMPLE(PL_rs) &&
1448 *SvPV_const(PL_rs,l) == '\n' && l == 1);
1449 Perl_sv_catpvf(aTHX_ sv, ", <%" SVf "> %s %" IVdf,
1450 SVfARG(PL_last_in_gv == PL_argvgv
1452 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1453 line_mode ? "line" : "chunk",
1454 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1456 if (PL_phase == PERL_PHASE_DESTRUCT)
1457 sv_catpvs(sv, " during global destruction");
1458 sv_catpvs(sv, ".\n");
1464 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1466 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1467 argument list, respectively. These are used to generate a string message. If
1469 message does not end with a newline, then it will be extended with
1470 some indication of the current location in the code, as described for
1473 Normally, the resulting message is returned in a new mortal SV.
1474 During global destruction a single SV may be shared between uses of
1481 Perl_vmess(pTHX_ const char *pat, va_list *args)
1483 SV * const sv = mess_alloc();
1485 PERL_ARGS_ASSERT_VMESS;
1487 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1488 return mess_sv(sv, 1);
1492 Perl_write_to_stderr(pTHX_ SV* msv)
1497 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1499 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1500 && (io = GvIO(PL_stderrgv))
1501 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1502 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, SV_CONST(PRINT),
1503 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1505 PerlIO * const serr = Perl_error_log;
1507 do_print(msv, serr);
1508 (void)PerlIO_flush(serr);
1513 =head1 Warning and Dieing
1516 /* Common code used in dieing and warning */
1519 S_with_queued_errors(pTHX_ SV *ex)
1521 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1522 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1523 sv_catsv(PL_errors, ex);
1524 ex = sv_mortalcopy(PL_errors);
1525 SvCUR_set(PL_errors, 0);
1531 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1536 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1537 /* sv_2cv might call Perl_croak() or Perl_warner() */
1538 SV * const oldhook = *hook;
1546 cv = sv_2cv(oldhook, &stash, &gv, 0);
1548 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1558 exarg = newSVsv(ex);
1559 SvREADONLY_on(exarg);
1562 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1566 call_sv(MUTABLE_SV(cv), G_DISCARD);
1575 =for apidoc Am|OP *|die_sv|SV *baseex
1577 Behaves the same as L</croak_sv>, except for the return type.
1578 It should be used only where the C<OP *> return type is required.
1579 The function never actually returns.
1585 # pragma warning( push )
1586 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1587 __declspec(noreturn) has non-void return type */
1588 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1589 __declspec(noreturn) has a return statement */
1592 Perl_die_sv(pTHX_ SV *baseex)
1594 PERL_ARGS_ASSERT_DIE_SV;
1597 NORETURN_FUNCTION_END;
1600 # pragma warning( pop )
1604 =for apidoc Am|OP *|die|const char *pat|...
1606 Behaves the same as L</croak>, except for the return type.
1607 It should be used only where the C<OP *> return type is required.
1608 The function never actually returns.
1613 #if defined(PERL_IMPLICIT_CONTEXT)
1615 # pragma warning( push )
1616 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1617 __declspec(noreturn) has non-void return type */
1618 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1619 __declspec(noreturn) has a return statement */
1622 Perl_die_nocontext(const char* pat, ...)
1626 va_start(args, pat);
1628 NOT_REACHED; /* NOTREACHED */
1630 NORETURN_FUNCTION_END;
1633 # pragma warning( pop )
1635 #endif /* PERL_IMPLICIT_CONTEXT */
1638 # pragma warning( push )
1639 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1640 __declspec(noreturn) has non-void return type */
1641 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1642 __declspec(noreturn) has a return statement */
1645 Perl_die(pTHX_ const char* pat, ...)
1648 va_start(args, pat);
1650 NOT_REACHED; /* NOTREACHED */
1652 NORETURN_FUNCTION_END;
1655 # pragma warning( pop )
1659 =for apidoc Am|void|croak_sv|SV *baseex
1661 This is an XS interface to Perl's C<die> function.
1663 C<baseex> is the error message or object. If it is a reference, it
1664 will be used as-is. Otherwise it is used as a string, and if it does
1665 not end with a newline then it will be extended with some indication of
1666 the current location in the code, as described for L</mess_sv>.
1668 The error message or object will be used as an exception, by default
1669 returning control to the nearest enclosing C<eval>, but subject to
1670 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1671 function never returns normally.
1673 To die with a simple string message, the L</croak> function may be
1680 Perl_croak_sv(pTHX_ SV *baseex)
1682 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1683 PERL_ARGS_ASSERT_CROAK_SV;
1684 invoke_exception_hook(ex, FALSE);
1689 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1691 This is an XS interface to Perl's C<die> function.
1693 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1694 argument list. These are used to generate a string message. If the
1695 message does not end with a newline, then it will be extended with
1696 some indication of the current location in the code, as described for
1699 The error message will be used as an exception, by default
1700 returning control to the nearest enclosing C<eval>, but subject to
1701 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1702 function never returns normally.
1704 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1705 (C<$@>) will be used as an error message or object instead of building an
1706 error message from arguments. If you want to throw a non-string object,
1707 or build an error message in an SV yourself, it is preferable to use
1708 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1714 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1716 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1717 invoke_exception_hook(ex, FALSE);
1722 =for apidoc Am|void|croak|const char *pat|...
1724 This is an XS interface to Perl's C<die> function.
1726 Take a sprintf-style format pattern and argument list. These are used to
1727 generate a string message. If the message does not end with a newline,
1728 then it will be extended with some indication of the current location
1729 in the code, as described for L</mess_sv>.
1731 The error message will be used as an exception, by default
1732 returning control to the nearest enclosing C<eval>, but subject to
1733 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1734 function never returns normally.
1736 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1737 (C<$@>) will be used as an error message or object instead of building an
1738 error message from arguments. If you want to throw a non-string object,
1739 or build an error message in an SV yourself, it is preferable to use
1740 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1745 #if defined(PERL_IMPLICIT_CONTEXT)
1747 Perl_croak_nocontext(const char *pat, ...)
1751 va_start(args, pat);
1753 NOT_REACHED; /* NOTREACHED */
1756 #endif /* PERL_IMPLICIT_CONTEXT */
1759 Perl_croak(pTHX_ const char *pat, ...)
1762 va_start(args, pat);
1764 NOT_REACHED; /* NOTREACHED */
1769 =for apidoc Am|void|croak_no_modify
1771 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1772 terser object code than using C<Perl_croak>. Less code used on exception code
1773 paths reduces CPU cache pressure.
1779 Perl_croak_no_modify(void)
1781 Perl_croak_nocontext( "%s", PL_no_modify);
1784 /* does not return, used in util.c perlio.c and win32.c
1785 This is typically called when malloc returns NULL.
1788 Perl_croak_no_mem(void)
1792 int fd = PerlIO_fileno(Perl_error_log);
1794 SETERRNO(EBADF,RMS_IFI);
1796 /* Can't use PerlIO to write as it allocates memory */
1797 PERL_UNUSED_RESULT(PerlLIO_write(fd, PL_no_mem, sizeof(PL_no_mem)-1));
1802 /* does not return, used only in POPSTACK */
1804 Perl_croak_popstack(void)
1807 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");
1812 =for apidoc Am|void|warn_sv|SV *baseex
1814 This is an XS interface to Perl's C<warn> function.
1816 C<baseex> is the error message or object. If it is a reference, it
1817 will be used as-is. Otherwise it is used as a string, and if it does
1818 not end with a newline then it will be extended with some indication of
1819 the current location in the code, as described for L</mess_sv>.
1821 The error message or object will by default be written to standard error,
1822 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1824 To warn with a simple string message, the L</warn> function may be
1831 Perl_warn_sv(pTHX_ SV *baseex)
1833 SV *ex = mess_sv(baseex, 0);
1834 PERL_ARGS_ASSERT_WARN_SV;
1835 if (!invoke_exception_hook(ex, TRUE))
1836 write_to_stderr(ex);
1840 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1842 This is an XS interface to Perl's C<warn> function.
1844 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1845 argument list. These are used to generate a string message. If the
1846 message does not end with a newline, then it will be extended with
1847 some indication of the current location in the code, as described for
1850 The error message or object will by default be written to standard error,
1851 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1853 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1859 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1861 SV *ex = vmess(pat, args);
1862 PERL_ARGS_ASSERT_VWARN;
1863 if (!invoke_exception_hook(ex, TRUE))
1864 write_to_stderr(ex);
1868 =for apidoc Am|void|warn|const char *pat|...
1870 This is an XS interface to Perl's C<warn> function.
1872 Take a sprintf-style format pattern and argument list. These are used to
1873 generate a string message. If the message does not end with a newline,
1874 then it will be extended with some indication of the current location
1875 in the code, as described for L</mess_sv>.
1877 The error message or object will by default be written to standard error,
1878 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1880 Unlike with L</croak>, C<pat> is not permitted to be null.
1885 #if defined(PERL_IMPLICIT_CONTEXT)
1887 Perl_warn_nocontext(const char *pat, ...)
1891 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1892 va_start(args, pat);
1896 #endif /* PERL_IMPLICIT_CONTEXT */
1899 Perl_warn(pTHX_ const char *pat, ...)
1902 PERL_ARGS_ASSERT_WARN;
1903 va_start(args, pat);
1908 #if defined(PERL_IMPLICIT_CONTEXT)
1910 Perl_warner_nocontext(U32 err, const char *pat, ...)
1914 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1915 va_start(args, pat);
1916 vwarner(err, pat, &args);
1919 #endif /* PERL_IMPLICIT_CONTEXT */
1922 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1924 PERL_ARGS_ASSERT_CK_WARNER_D;
1926 if (Perl_ckwarn_d(aTHX_ err)) {
1928 va_start(args, pat);
1929 vwarner(err, pat, &args);
1935 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1937 PERL_ARGS_ASSERT_CK_WARNER;
1939 if (Perl_ckwarn(aTHX_ err)) {
1941 va_start(args, pat);
1942 vwarner(err, pat, &args);
1948 Perl_warner(pTHX_ U32 err, const char* pat,...)
1951 PERL_ARGS_ASSERT_WARNER;
1952 va_start(args, pat);
1953 vwarner(err, pat, &args);
1958 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1961 PERL_ARGS_ASSERT_VWARNER;
1963 (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) &&
1964 !(PL_in_eval & EVAL_KEEPERR)
1966 SV * const msv = vmess(pat, args);
1968 if (PL_parser && PL_parser->error_count) {
1972 invoke_exception_hook(msv, FALSE);
1977 Perl_vwarn(aTHX_ pat, args);
1981 /* implements the ckWARN? macros */
1984 Perl_ckwarn(pTHX_ U32 w)
1986 /* If lexical warnings have not been set, use $^W. */
1988 return PL_dowarn & G_WARN_ON;
1990 return ckwarn_common(w);
1993 /* implements the ckWARN?_d macro */
1996 Perl_ckwarn_d(pTHX_ U32 w)
1998 /* If lexical warnings have not been set then default classes warn. */
2002 return ckwarn_common(w);
2006 S_ckwarn_common(pTHX_ U32 w)
2008 if (PL_curcop->cop_warnings == pWARN_ALL)
2011 if (PL_curcop->cop_warnings == pWARN_NONE)
2014 /* Check the assumption that at least the first slot is non-zero. */
2015 assert(unpackWARN1(w));
2017 /* Check the assumption that it is valid to stop as soon as a zero slot is
2019 if (!unpackWARN2(w)) {
2020 assert(!unpackWARN3(w));
2021 assert(!unpackWARN4(w));
2022 } else if (!unpackWARN3(w)) {
2023 assert(!unpackWARN4(w));
2026 /* Right, dealt with all the special cases, which are implemented as non-
2027 pointers, so there is a pointer to a real warnings mask. */
2029 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
2031 } while (w >>= WARNshift);
2036 /* Set buffer=NULL to get a new one. */
2038 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
2040 const MEM_SIZE len_wanted =
2041 sizeof(STRLEN) + (size > WARNsize ? size : WARNsize);
2042 PERL_UNUSED_CONTEXT;
2043 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
2046 (specialWARN(buffer) ?
2047 PerlMemShared_malloc(len_wanted) :
2048 PerlMemShared_realloc(buffer, len_wanted));
2050 Copy(bits, (buffer + 1), size, char);
2051 if (size < WARNsize)
2052 Zero((char *)(buffer + 1) + size, WARNsize - size, char);
2056 /* since we've already done strlen() for both nam and val
2057 * we can use that info to make things faster than
2058 * sprintf(s, "%s=%s", nam, val)
2060 #define my_setenv_format(s, nam, nlen, val, vlen) \
2061 Copy(nam, s, nlen, char); \
2063 Copy(val, s+(nlen+1), vlen, char); \
2064 *(s+(nlen+1+vlen)) = '\0'
2066 #ifdef USE_ENVIRON_ARRAY
2067 /* VMS' my_setenv() is in vms.c */
2068 #if !defined(WIN32) && !defined(NETWARE)
2070 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2074 amigaos4_obtain_environ(__FUNCTION__);
2077 /* only parent thread can modify process environment */
2078 if (PL_curinterp == aTHX)
2081 #ifndef PERL_USE_SAFE_PUTENV
2082 if (!PL_use_safe_putenv) {
2083 /* most putenv()s leak, so we manipulate environ directly */
2085 const I32 len = strlen(nam);
2088 /* where does it go? */
2089 for (i = 0; environ[i]; i++) {
2090 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
2094 if (environ == PL_origenviron) { /* need we copy environment? */
2100 while (environ[max])
2102 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
2103 for (j=0; j<max; j++) { /* copy environment */
2104 const int len = strlen(environ[j]);
2105 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
2106 Copy(environ[j], tmpenv[j], len+1, char);
2109 environ = tmpenv; /* tell exec where it is now */
2112 safesysfree(environ[i]);
2113 while (environ[i]) {
2114 environ[i] = environ[i+1];
2123 if (!environ[i]) { /* does not exist yet */
2124 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2125 environ[i+1] = NULL; /* make sure it's null terminated */
2128 safesysfree(environ[i]);
2132 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2133 /* all that work just for this */
2134 my_setenv_format(environ[i], nam, nlen, val, vlen);
2137 /* This next branch should only be called #if defined(HAS_SETENV), but
2138 Configure doesn't test for that yet. For Solaris, setenv() and unsetenv()
2139 were introduced in Solaris 9, so testing for HAS UNSETENV is sufficient.
2141 # if defined(__CYGWIN__)|| defined(__SYMBIAN32__) || defined(__riscos__) || (defined(__sun) && defined(HAS_UNSETENV)) || defined(PERL_DARWIN)
2142 # if defined(HAS_UNSETENV)
2144 (void)unsetenv(nam);
2146 (void)setenv(nam, val, 1);
2148 # else /* ! HAS_UNSETENV */
2149 (void)setenv(nam, val, 1);
2150 # endif /* HAS_UNSETENV */
2152 # if defined(HAS_UNSETENV)
2154 if (environ) /* old glibc can crash with null environ */
2155 (void)unsetenv(nam);
2157 const int nlen = strlen(nam);
2158 const int vlen = strlen(val);
2159 char * const new_env =
2160 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2161 my_setenv_format(new_env, nam, nlen, val, vlen);
2162 (void)putenv(new_env);
2164 # else /* ! HAS_UNSETENV */
2166 const int nlen = strlen(nam);
2172 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2173 /* all that work just for this */
2174 my_setenv_format(new_env, nam, nlen, val, vlen);
2175 (void)putenv(new_env);
2176 # endif /* HAS_UNSETENV */
2177 # endif /* __CYGWIN__ */
2178 #ifndef PERL_USE_SAFE_PUTENV
2184 amigaos4_release_environ(__FUNCTION__);
2188 #else /* WIN32 || NETWARE */
2191 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2195 const int nlen = strlen(nam);
2202 Newx(envstr, nlen+vlen+2, char);
2203 my_setenv_format(envstr, nam, nlen, val, vlen);
2204 (void)PerlEnv_putenv(envstr);
2208 #endif /* WIN32 || NETWARE */
2212 #ifdef UNLINK_ALL_VERSIONS
2214 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2218 PERL_ARGS_ASSERT_UNLNK;
2220 while (PerlLIO_unlink(f) >= 0)
2222 return retries ? 0 : -1;
2226 /* this is a drop-in replacement for bcopy(), except for the return
2227 * value, which we need to be able to emulate memcpy() */
2228 #if !defined(HAS_MEMCPY) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY))
2230 Perl_my_bcopy(const void *vfrom, void *vto, size_t len)
2232 #if defined(HAS_BCOPY) && defined(HAS_SAFE_BCOPY)
2233 bcopy(vfrom, vto, len);
2235 const unsigned char *from = (const unsigned char *)vfrom;
2236 unsigned char *to = (unsigned char *)vto;
2238 PERL_ARGS_ASSERT_MY_BCOPY;
2240 if (from - to >= 0) {
2248 *(--to) = *(--from);
2256 /* this is a drop-in replacement for memset() */
2259 Perl_my_memset(void *vloc, int ch, size_t len)
2261 unsigned char *loc = (unsigned char *)vloc;
2263 PERL_ARGS_ASSERT_MY_MEMSET;
2271 /* this is a drop-in replacement for bzero() */
2272 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2274 Perl_my_bzero(void *vloc, size_t len)
2276 unsigned char *loc = (unsigned char *)vloc;
2278 PERL_ARGS_ASSERT_MY_BZERO;
2286 /* this is a drop-in replacement for memcmp() */
2287 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2289 Perl_my_memcmp(const void *vs1, const void *vs2, size_t len)
2291 const U8 *a = (const U8 *)vs1;
2292 const U8 *b = (const U8 *)vs2;
2295 PERL_ARGS_ASSERT_MY_MEMCMP;
2298 if ((tmp = *a++ - *b++))
2303 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2306 /* This vsprintf replacement should generally never get used, since
2307 vsprintf was available in both System V and BSD 2.11. (There may
2308 be some cross-compilation or embedded set-ups where it is needed,
2311 If you encounter a problem in this function, it's probably a symptom
2312 that Configure failed to detect your system's vprintf() function.
2313 See the section on "item vsprintf" in the INSTALL file.
2315 This version may compile on systems with BSD-ish <stdio.h>,
2316 but probably won't on others.
2319 #ifdef USE_CHAR_VSPRINTF
2324 vsprintf(char *dest, const char *pat, void *args)
2328 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2329 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2330 FILE_cnt(&fakebuf) = 32767;
2332 /* These probably won't compile -- If you really need
2333 this, you'll have to figure out some other method. */
2334 fakebuf._ptr = dest;
2335 fakebuf._cnt = 32767;
2340 fakebuf._flag = _IOWRT|_IOSTRG;
2341 _doprnt(pat, args, &fakebuf); /* what a kludge */
2342 #if defined(STDIO_PTR_LVALUE)
2343 *(FILE_ptr(&fakebuf)++) = '\0';
2345 /* PerlIO has probably #defined away fputc, but we want it here. */
2347 # undef fputc /* XXX Should really restore it later */
2349 (void)fputc('\0', &fakebuf);
2351 #ifdef USE_CHAR_VSPRINTF
2354 return 0; /* perl doesn't use return value */
2358 #endif /* HAS_VPRINTF */
2361 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2363 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(OS2) && !defined(VMS) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2371 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2373 PERL_FLUSHALL_FOR_CHILD;
2374 This = (*mode == 'w');
2378 taint_proper("Insecure %s%s", "EXEC");
2380 if (PerlProc_pipe(p) < 0)
2382 /* Try for another pipe pair for error return */
2383 if (PerlProc_pipe(pp) >= 0)
2385 while ((pid = PerlProc_fork()) < 0) {
2386 if (errno != EAGAIN) {
2387 PerlLIO_close(p[This]);
2388 PerlLIO_close(p[that]);
2390 PerlLIO_close(pp[0]);
2391 PerlLIO_close(pp[1]);
2395 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2404 /* Close parent's end of error status pipe (if any) */
2406 PerlLIO_close(pp[0]);
2407 #if defined(HAS_FCNTL) && defined(F_SETFD) && defined(FD_CLOEXEC)
2408 /* Close error pipe automatically if exec works */
2409 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2413 /* Now dup our end of _the_ pipe to right position */
2414 if (p[THIS] != (*mode == 'r')) {
2415 PerlLIO_dup2(p[THIS], *mode == 'r');
2416 PerlLIO_close(p[THIS]);
2417 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2418 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2421 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2422 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2423 /* No automatic close - do it by hand */
2430 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2436 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2442 do_execfree(); /* free any memory malloced by child on fork */
2444 PerlLIO_close(pp[1]);
2445 /* Keep the lower of the two fd numbers */
2446 if (p[that] < p[This]) {
2447 PerlLIO_dup2(p[This], p[that]);
2448 PerlLIO_close(p[This]);
2452 PerlLIO_close(p[that]); /* close child's end of pipe */
2454 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2455 SvUPGRADE(sv,SVt_IV);
2457 PL_forkprocess = pid;
2458 /* If we managed to get status pipe check for exec fail */
2459 if (did_pipes && pid > 0) {
2463 while (n < sizeof(int)) {
2464 const SSize_t n1 = PerlLIO_read(pp[0],
2465 (void*)(((char*)&errkid)+n),
2471 PerlLIO_close(pp[0]);
2473 if (n) { /* Error */
2475 PerlLIO_close(p[This]);
2476 if (n != sizeof(int))
2477 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2479 pid2 = wait4pid(pid, &status, 0);
2480 } while (pid2 == -1 && errno == EINTR);
2481 errno = errkid; /* Propagate errno from kid */
2486 PerlLIO_close(pp[0]);
2487 return PerlIO_fdopen(p[This], mode);
2489 # if defined(OS2) /* Same, without fork()ing and all extra overhead... */
2490 return my_syspopen4(aTHX_ NULL, mode, n, args);
2491 # elif defined(WIN32)
2492 return win32_popenlist(mode, n, args);
2494 Perl_croak(aTHX_ "List form of piped open not implemented");
2495 return (PerlIO *) NULL;
2500 /* VMS' my_popen() is in VMS.c, same with OS/2 and AmigaOS 4. */
2501 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2503 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2509 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2513 PERL_ARGS_ASSERT_MY_POPEN;
2515 PERL_FLUSHALL_FOR_CHILD;
2518 return my_syspopen(aTHX_ cmd,mode);
2521 This = (*mode == 'w');
2523 if (doexec && TAINTING_get) {
2525 taint_proper("Insecure %s%s", "EXEC");
2527 if (PerlProc_pipe(p) < 0)
2529 if (doexec && PerlProc_pipe(pp) >= 0)
2531 while ((pid = PerlProc_fork()) < 0) {
2532 if (errno != EAGAIN) {
2533 PerlLIO_close(p[This]);
2534 PerlLIO_close(p[that]);
2536 PerlLIO_close(pp[0]);
2537 PerlLIO_close(pp[1]);
2540 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2543 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2553 PerlLIO_close(pp[0]);
2554 #if defined(HAS_FCNTL) && defined(F_SETFD)
2555 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2559 if (p[THIS] != (*mode == 'r')) {
2560 PerlLIO_dup2(p[THIS], *mode == 'r');
2561 PerlLIO_close(p[THIS]);
2562 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2563 PerlLIO_close(p[THAT]);
2566 PerlLIO_close(p[THAT]);
2569 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2576 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2581 /* may or may not use the shell */
2582 do_exec3(cmd, pp[1], did_pipes);
2585 #endif /* defined OS2 */
2587 #ifdef PERLIO_USING_CRLF
2588 /* Since we circumvent IO layers when we manipulate low-level
2589 filedescriptors directly, need to manually switch to the
2590 default, binary, low-level mode; see PerlIOBuf_open(). */
2591 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2594 #ifdef PERL_USES_PL_PIDSTATUS
2595 hv_clear(PL_pidstatus); /* we have no children */
2601 do_execfree(); /* free any memory malloced by child on vfork */
2603 PerlLIO_close(pp[1]);
2604 if (p[that] < p[This]) {
2605 PerlLIO_dup2(p[This], p[that]);
2606 PerlLIO_close(p[This]);
2610 PerlLIO_close(p[that]);
2612 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2613 SvUPGRADE(sv,SVt_IV);
2615 PL_forkprocess = pid;
2616 if (did_pipes && pid > 0) {
2620 while (n < sizeof(int)) {
2621 const SSize_t n1 = PerlLIO_read(pp[0],
2622 (void*)(((char*)&errkid)+n),
2628 PerlLIO_close(pp[0]);
2630 if (n) { /* Error */
2632 PerlLIO_close(p[This]);
2633 if (n != sizeof(int))
2634 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2636 pid2 = wait4pid(pid, &status, 0);
2637 } while (pid2 == -1 && errno == EINTR);
2638 errno = errkid; /* Propagate errno from kid */
2643 PerlLIO_close(pp[0]);
2644 return PerlIO_fdopen(p[This], mode);
2648 FILE *djgpp_popen();
2650 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2652 PERL_FLUSHALL_FOR_CHILD;
2653 /* Call system's popen() to get a FILE *, then import it.
2654 used 0 for 2nd parameter to PerlIO_importFILE;
2657 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2660 #if defined(__LIBCATAMOUNT__)
2662 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2669 #endif /* !DOSISH */
2671 /* this is called in parent before the fork() */
2673 Perl_atfork_lock(void)
2674 #if defined(USE_ITHREADS)
2676 PERL_TSA_ACQUIRE(PL_perlio_mutex)
2679 PERL_TSA_ACQUIRE(PL_malloc_mutex)
2681 PERL_TSA_ACQUIRE(PL_op_mutex)
2684 #if defined(USE_ITHREADS)
2686 /* locks must be held in locking order (if any) */
2688 MUTEX_LOCK(&PL_perlio_mutex);
2691 MUTEX_LOCK(&PL_malloc_mutex);
2697 /* this is called in both parent and child after the fork() */
2699 Perl_atfork_unlock(void)
2700 #if defined(USE_ITHREADS)
2702 PERL_TSA_RELEASE(PL_perlio_mutex)
2705 PERL_TSA_RELEASE(PL_malloc_mutex)
2707 PERL_TSA_RELEASE(PL_op_mutex)
2710 #if defined(USE_ITHREADS)
2712 /* locks must be released in same order as in atfork_lock() */
2714 MUTEX_UNLOCK(&PL_perlio_mutex);
2717 MUTEX_UNLOCK(&PL_malloc_mutex);
2726 #if defined(HAS_FORK)
2728 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2733 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2734 * handlers elsewhere in the code */
2738 #elif defined(__amigaos4__)
2739 return amigaos_fork();
2741 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2742 Perl_croak_nocontext("fork() not available");
2744 #endif /* HAS_FORK */
2749 dup2(int oldfd, int newfd)
2751 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2754 PerlLIO_close(newfd);
2755 return fcntl(oldfd, F_DUPFD, newfd);
2757 #define DUP2_MAX_FDS 256
2758 int fdtmp[DUP2_MAX_FDS];
2764 PerlLIO_close(newfd);
2765 /* good enough for low fd's... */
2766 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2767 if (fdx >= DUP2_MAX_FDS) {
2775 PerlLIO_close(fdtmp[--fdx]);
2782 #ifdef HAS_SIGACTION
2785 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2787 struct sigaction act, oact;
2791 /* only "parent" interpreter can diddle signals */
2792 if (PL_curinterp != aTHX)
2793 return (Sighandler_t) SIG_ERR;
2796 act.sa_handler = (void(*)(int))handler;
2797 sigemptyset(&act.sa_mask);
2800 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2801 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2803 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2804 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2805 act.sa_flags |= SA_NOCLDWAIT;
2807 if (sigaction(signo, &act, &oact) == -1)
2808 return (Sighandler_t) SIG_ERR;
2810 return (Sighandler_t) oact.sa_handler;
2814 Perl_rsignal_state(pTHX_ int signo)
2816 struct sigaction oact;
2817 PERL_UNUSED_CONTEXT;
2819 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2820 return (Sighandler_t) SIG_ERR;
2822 return (Sighandler_t) oact.sa_handler;
2826 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2831 struct sigaction act;
2833 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2836 /* only "parent" interpreter can diddle signals */
2837 if (PL_curinterp != aTHX)
2841 act.sa_handler = (void(*)(int))handler;
2842 sigemptyset(&act.sa_mask);
2845 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2846 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2848 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2849 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2850 act.sa_flags |= SA_NOCLDWAIT;
2852 return sigaction(signo, &act, save);
2856 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2861 PERL_UNUSED_CONTEXT;
2863 /* only "parent" interpreter can diddle signals */
2864 if (PL_curinterp != aTHX)
2868 return sigaction(signo, save, (struct sigaction *)NULL);
2871 #else /* !HAS_SIGACTION */
2874 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2876 #if defined(USE_ITHREADS) && !defined(WIN32)
2877 /* only "parent" interpreter can diddle signals */
2878 if (PL_curinterp != aTHX)
2879 return (Sighandler_t) SIG_ERR;
2882 return PerlProc_signal(signo, handler);
2893 Perl_rsignal_state(pTHX_ int signo)
2896 Sighandler_t oldsig;
2898 #if defined(USE_ITHREADS) && !defined(WIN32)
2899 /* only "parent" interpreter can diddle signals */
2900 if (PL_curinterp != aTHX)
2901 return (Sighandler_t) SIG_ERR;
2905 oldsig = PerlProc_signal(signo, sig_trap);
2906 PerlProc_signal(signo, oldsig);
2908 PerlProc_kill(PerlProc_getpid(), signo);
2913 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2915 #if defined(USE_ITHREADS) && !defined(WIN32)
2916 /* only "parent" interpreter can diddle signals */
2917 if (PL_curinterp != aTHX)
2920 *save = PerlProc_signal(signo, handler);
2921 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2925 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2927 #if defined(USE_ITHREADS) && !defined(WIN32)
2928 /* only "parent" interpreter can diddle signals */
2929 if (PL_curinterp != aTHX)
2932 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2935 #endif /* !HAS_SIGACTION */
2936 #endif /* !PERL_MICRO */
2938 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2939 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2941 Perl_my_pclose(pTHX_ PerlIO *ptr)
2949 const int fd = PerlIO_fileno(ptr);
2952 svp = av_fetch(PL_fdpid,fd,TRUE);
2953 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2957 #if defined(USE_PERLIO)
2958 /* Find out whether the refcount is low enough for us to wait for the
2959 child proc without blocking. */
2960 should_wait = PerlIOUnix_refcnt(fd) == 1 && pid > 0;
2962 should_wait = pid > 0;
2966 if (pid == -1) { /* Opened by popen. */
2967 return my_syspclose(ptr);
2970 close_failed = (PerlIO_close(ptr) == EOF);
2972 if (should_wait) do {
2973 pid2 = wait4pid(pid, &status, 0);
2974 } while (pid2 == -1 && errno == EINTR);
2981 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
2986 #if defined(__LIBCATAMOUNT__)
2988 Perl_my_pclose(pTHX_ PerlIO *ptr)
2993 #endif /* !DOSISH */
2995 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2997 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
3000 PERL_ARGS_ASSERT_WAIT4PID;
3001 #ifdef PERL_USES_PL_PIDSTATUS
3003 /* PERL_USES_PL_PIDSTATUS is only defined when neither
3004 waitpid() nor wait4() is available, or on OS/2, which
3005 doesn't appear to support waiting for a progress group
3006 member, so we can only treat a 0 pid as an unknown child.
3013 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3014 pid, rather than a string form. */
3015 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3016 if (svp && *svp != &PL_sv_undef) {
3017 *statusp = SvIVX(*svp);
3018 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3026 hv_iterinit(PL_pidstatus);
3027 if ((entry = hv_iternext(PL_pidstatus))) {
3028 SV * const sv = hv_iterval(PL_pidstatus,entry);
3030 const char * const spid = hv_iterkey(entry,&len);
3032 assert (len == sizeof(Pid_t));
3033 memcpy((char *)&pid, spid, len);
3034 *statusp = SvIVX(sv);
3035 /* The hash iterator is currently on this entry, so simply
3036 calling hv_delete would trigger the lazy delete, which on
3037 aggregate does more work, because next call to hv_iterinit()
3038 would spot the flag, and have to call the delete routine,
3039 while in the meantime any new entries can't re-use that
3041 hv_iterinit(PL_pidstatus);
3042 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3049 # ifdef HAS_WAITPID_RUNTIME
3050 if (!HAS_WAITPID_RUNTIME)
3053 result = PerlProc_waitpid(pid,statusp,flags);
3056 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3057 result = wait4(pid,statusp,flags,NULL);
3060 #ifdef PERL_USES_PL_PIDSTATUS
3061 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3066 Perl_croak(aTHX_ "Can't do waitpid with flags");
3068 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3069 pidgone(result,*statusp);
3075 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3078 if (result < 0 && errno == EINTR) {
3080 errno = EINTR; /* reset in case a signal handler changed $! */
3084 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3086 #ifdef PERL_USES_PL_PIDSTATUS
3088 S_pidgone(pTHX_ Pid_t pid, int status)
3092 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3093 SvUPGRADE(sv,SVt_IV);
3094 SvIV_set(sv, status);
3102 int /* Cannot prototype with I32
3104 my_syspclose(PerlIO *ptr)
3107 Perl_my_pclose(pTHX_ PerlIO *ptr)
3110 /* Needs work for PerlIO ! */
3111 FILE * const f = PerlIO_findFILE(ptr);
3112 const I32 result = pclose(f);
3113 PerlIO_releaseFILE(ptr,f);
3121 Perl_my_pclose(pTHX_ PerlIO *ptr)
3123 /* Needs work for PerlIO ! */
3124 FILE * const f = PerlIO_findFILE(ptr);
3125 I32 result = djgpp_pclose(f);
3126 result = (result << 8) & 0xff00;
3127 PerlIO_releaseFILE(ptr,f);
3132 #define PERL_REPEATCPY_LINEAR 4
3134 Perl_repeatcpy(char *to, const char *from, I32 len, IV count)
3136 PERL_ARGS_ASSERT_REPEATCPY;
3141 croak_memory_wrap();
3144 memset(to, *from, count);
3147 IV items, linear, half;
3149 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3150 for (items = 0; items < linear; ++items) {
3151 const char *q = from;
3153 for (todo = len; todo > 0; todo--)
3158 while (items <= half) {
3159 IV size = items * len;
3160 memcpy(p, to, size);
3166 memcpy(p, to, (count - items) * len);
3172 Perl_same_dirent(pTHX_ const char *a, const char *b)
3174 char *fa = strrchr(a,'/');
3175 char *fb = strrchr(b,'/');
3178 SV * const tmpsv = sv_newmortal();
3180 PERL_ARGS_ASSERT_SAME_DIRENT;
3193 sv_setpvs(tmpsv, ".");
3195 sv_setpvn(tmpsv, a, fa - a);
3196 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3199 sv_setpvs(tmpsv, ".");
3201 sv_setpvn(tmpsv, b, fb - b);
3202 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3204 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3205 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3207 #endif /* !HAS_RENAME */
3210 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3211 const char *const *const search_ext, I32 flags)
3213 const char *xfound = NULL;
3214 char *xfailed = NULL;
3215 char tmpbuf[MAXPATHLEN];
3220 #if defined(DOSISH) && !defined(OS2)
3221 # define SEARCH_EXTS ".bat", ".cmd", NULL
3222 # define MAX_EXT_LEN 4
3225 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3226 # define MAX_EXT_LEN 4
3229 # define SEARCH_EXTS ".pl", ".com", NULL
3230 # define MAX_EXT_LEN 4
3232 /* additional extensions to try in each dir if scriptname not found */
3234 static const char *const exts[] = { SEARCH_EXTS };
3235 const char *const *const ext = search_ext ? search_ext : exts;
3236 int extidx = 0, i = 0;
3237 const char *curext = NULL;
3239 PERL_UNUSED_ARG(search_ext);
3240 # define MAX_EXT_LEN 0
3243 PERL_ARGS_ASSERT_FIND_SCRIPT;
3246 * If dosearch is true and if scriptname does not contain path
3247 * delimiters, search the PATH for scriptname.
3249 * If SEARCH_EXTS is also defined, will look for each
3250 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3251 * while searching the PATH.
3253 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3254 * proceeds as follows:
3255 * If DOSISH or VMSISH:
3256 * + look for ./scriptname{,.foo,.bar}
3257 * + search the PATH for scriptname{,.foo,.bar}
3260 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3261 * this will not look in '.' if it's not in the PATH)
3266 # ifdef ALWAYS_DEFTYPES
3267 len = strlen(scriptname);
3268 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3269 int idx = 0, deftypes = 1;
3272 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3275 int idx = 0, deftypes = 1;
3278 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3280 /* The first time through, just add SEARCH_EXTS to whatever we
3281 * already have, so we can check for default file types. */
3283 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3290 if ((strlen(tmpbuf) + strlen(scriptname)
3291 + MAX_EXT_LEN) >= sizeof tmpbuf)
3292 continue; /* don't search dir with too-long name */
3293 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3297 if (strEQ(scriptname, "-"))
3299 if (dosearch) { /* Look in '.' first. */
3300 const char *cur = scriptname;
3302 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3304 if (strEQ(ext[i++],curext)) {
3305 extidx = -1; /* already has an ext */
3310 DEBUG_p(PerlIO_printf(Perl_debug_log,
3311 "Looking for %s\n",cur));
3314 if (PerlLIO_stat(cur,&statbuf) >= 0
3315 && !S_ISDIR(statbuf.st_mode)) {
3324 if (cur == scriptname) {
3325 len = strlen(scriptname);
3326 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3328 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3331 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3332 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3337 if (dosearch && !strchr(scriptname, '/')
3339 && !strchr(scriptname, '\\')
3341 && (s = PerlEnv_getenv("PATH")))
3345 bufend = s + strlen(s);
3346 while (s < bufend) {
3350 && *s != ';'; len++, s++) {
3351 if (len < sizeof tmpbuf)
3354 if (len < sizeof tmpbuf)
3357 s = delimcpy_no_escape(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3362 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3363 continue; /* don't search dir with too-long name */
3366 && tmpbuf[len - 1] != '/'
3367 && tmpbuf[len - 1] != '\\'
3370 tmpbuf[len++] = '/';
3371 if (len == 2 && tmpbuf[0] == '.')
3373 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3377 len = strlen(tmpbuf);
3378 if (extidx > 0) /* reset after previous loop */
3382 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3383 retval = PerlLIO_stat(tmpbuf,&statbuf);
3384 if (S_ISDIR(statbuf.st_mode)) {
3388 } while ( retval < 0 /* not there */
3389 && extidx>=0 && ext[extidx] /* try an extension? */
3390 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3395 if (S_ISREG(statbuf.st_mode)
3396 && cando(S_IRUSR,TRUE,&statbuf)
3397 #if !defined(DOSISH)
3398 && cando(S_IXUSR,TRUE,&statbuf)
3402 xfound = tmpbuf; /* bingo! */
3406 xfailed = savepv(tmpbuf);
3411 if (!xfound && !seen_dot && !xfailed &&
3412 (PerlLIO_stat(scriptname,&statbuf) < 0
3413 || S_ISDIR(statbuf.st_mode)))
3415 seen_dot = 1; /* Disable message. */
3420 if (flags & 1) { /* do or die? */
3421 /* diag_listed_as: Can't execute %s */
3422 Perl_croak(aTHX_ "Can't %s %s%s%s",
3423 (xfailed ? "execute" : "find"),
3424 (xfailed ? xfailed : scriptname),
3425 (xfailed ? "" : " on PATH"),
3426 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3431 scriptname = xfound;
3433 return (scriptname ? savepv(scriptname) : NULL);
3436 #ifndef PERL_GET_CONTEXT_DEFINED
3439 Perl_get_context(void)
3441 #if defined(USE_ITHREADS)
3443 # ifdef OLD_PTHREADS_API
3445 int error = pthread_getspecific(PL_thr_key, &t)
3447 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3450 # ifdef I_MACH_CTHREADS
3451 return (void*)cthread_data(cthread_self());
3453 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3462 Perl_set_context(void *t)
3464 #if defined(USE_ITHREADS)
3467 PERL_ARGS_ASSERT_SET_CONTEXT;
3468 #if defined(USE_ITHREADS)
3469 # ifdef I_MACH_CTHREADS
3470 cthread_set_data(cthread_self(), t);
3473 const int error = pthread_setspecific(PL_thr_key, t);
3475 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3483 #endif /* !PERL_GET_CONTEXT_DEFINED */
3485 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3489 PERL_UNUSED_CONTEXT;
3495 Perl_get_op_names(pTHX)
3497 PERL_UNUSED_CONTEXT;
3498 return (char **)PL_op_name;
3502 Perl_get_op_descs(pTHX)
3504 PERL_UNUSED_CONTEXT;
3505 return (char **)PL_op_desc;
3509 Perl_get_no_modify(pTHX)
3511 PERL_UNUSED_CONTEXT;
3512 return PL_no_modify;
3516 Perl_get_opargs(pTHX)
3518 PERL_UNUSED_CONTEXT;
3519 return (U32 *)PL_opargs;
3523 Perl_get_ppaddr(pTHX)
3526 PERL_UNUSED_CONTEXT;
3527 return (PPADDR_t*)PL_ppaddr;
3530 #ifndef HAS_GETENV_LEN
3532 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3534 char * const env_trans = PerlEnv_getenv(env_elem);
3535 PERL_UNUSED_CONTEXT;
3536 PERL_ARGS_ASSERT_GETENV_LEN;
3538 *len = strlen(env_trans);
3545 Perl_get_vtbl(pTHX_ int vtbl_id)
3547 PERL_UNUSED_CONTEXT;
3549 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3550 ? NULL : (MGVTBL*)PL_magic_vtables + vtbl_id;
3554 Perl_my_fflush_all(pTHX)
3556 #if defined(USE_PERLIO) || defined(FFLUSH_NULL)
3557 return PerlIO_flush(NULL);
3559 # if defined(HAS__FWALK)
3560 extern int fflush(FILE *);
3561 /* undocumented, unprototyped, but very useful BSDism */
3562 extern void _fwalk(int (*)(FILE *));
3566 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3568 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3569 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3571 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3572 open_max = sysconf(_SC_OPEN_MAX);
3575 open_max = FOPEN_MAX;
3578 open_max = OPEN_MAX;
3589 for (i = 0; i < open_max; i++)
3590 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3591 STDIO_STREAM_ARRAY[i]._file < open_max &&
3592 STDIO_STREAM_ARRAY[i]._flag)
3593 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3597 SETERRNO(EBADF,RMS_IFI);
3604 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3606 if (ckWARN(WARN_IO)) {
3608 = gv && (isGV_with_GP(gv))
3611 const char * const direction = have == '>' ? "out" : "in";
3613 if (name && HEK_LEN(name))
3614 Perl_warner(aTHX_ packWARN(WARN_IO),
3615 "Filehandle %" HEKf " opened only for %sput",
3616 HEKfARG(name), direction);
3618 Perl_warner(aTHX_ packWARN(WARN_IO),
3619 "Filehandle opened only for %sput", direction);
3624 Perl_report_evil_fh(pTHX_ const GV *gv)
3626 const IO *io = gv ? GvIO(gv) : NULL;
3627 const PERL_BITFIELD16 op = PL_op->op_type;
3631 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3633 warn_type = WARN_CLOSED;
3637 warn_type = WARN_UNOPENED;
3640 if (ckWARN(warn_type)) {
3642 = gv && isGV_with_GP(gv) && GvENAMELEN(gv) ?
3643 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3644 const char * const pars =
3645 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3646 const char * const func =
3648 (op == OP_READLINE || op == OP_RCATLINE
3649 ? "readline" : /* "<HANDLE>" not nice */
3650 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3652 const char * const type =
3654 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3655 ? "socket" : "filehandle");
3656 const bool have_name = name && SvCUR(name);
3657 Perl_warner(aTHX_ packWARN(warn_type),
3658 "%s%s on %s %s%s%" SVf, func, pars, vile, type,
3659 have_name ? " " : "",
3660 SVfARG(have_name ? name : &PL_sv_no));
3661 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3663 aTHX_ packWARN(warn_type),
3664 "\t(Are you trying to call %s%s on dirhandle%s%" SVf "?)\n",
3665 func, pars, have_name ? " " : "",
3666 SVfARG(have_name ? name : &PL_sv_no)
3671 /* To workaround core dumps from the uninitialised tm_zone we get the
3672 * system to give us a reasonable struct to copy. This fix means that
3673 * strftime uses the tm_zone and tm_gmtoff values returned by
3674 * localtime(time()). That should give the desired result most of the
3675 * time. But probably not always!
3677 * This does not address tzname aspects of NETaa14816.
3682 # ifndef STRUCT_TM_HASZONE
3683 # define STRUCT_TM_HASZONE
3687 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3688 # ifndef HAS_TM_TM_ZONE
3689 # define HAS_TM_TM_ZONE
3694 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3696 #ifdef HAS_TM_TM_ZONE
3698 const struct tm* my_tm;
3699 PERL_UNUSED_CONTEXT;
3700 PERL_ARGS_ASSERT_INIT_TM;
3702 my_tm = localtime(&now);
3704 Copy(my_tm, ptm, 1, struct tm);
3706 PERL_UNUSED_CONTEXT;
3707 PERL_ARGS_ASSERT_INIT_TM;
3708 PERL_UNUSED_ARG(ptm);
3713 * mini_mktime - normalise struct tm values without the localtime()
3714 * semantics (and overhead) of mktime().
3717 Perl_mini_mktime(struct tm *ptm)
3721 int month, mday, year, jday;
3722 int odd_cent, odd_year;
3724 PERL_ARGS_ASSERT_MINI_MKTIME;
3726 #define DAYS_PER_YEAR 365
3727 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3728 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3729 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3730 #define SECS_PER_HOUR (60*60)
3731 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3732 /* parentheses deliberately absent on these two, otherwise they don't work */
3733 #define MONTH_TO_DAYS 153/5
3734 #define DAYS_TO_MONTH 5/153
3735 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3736 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3737 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3738 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3741 * Year/day algorithm notes:
3743 * With a suitable offset for numeric value of the month, one can find
3744 * an offset into the year by considering months to have 30.6 (153/5) days,
3745 * using integer arithmetic (i.e., with truncation). To avoid too much
3746 * messing about with leap days, we consider January and February to be
3747 * the 13th and 14th month of the previous year. After that transformation,
3748 * we need the month index we use to be high by 1 from 'normal human' usage,
3749 * so the month index values we use run from 4 through 15.
3751 * Given that, and the rules for the Gregorian calendar (leap years are those
3752 * divisible by 4 unless also divisible by 100, when they must be divisible
3753 * by 400 instead), we can simply calculate the number of days since some
3754 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3755 * the days we derive from our month index, and adding in the day of the
3756 * month. The value used here is not adjusted for the actual origin which
3757 * it normally would use (1 January A.D. 1), since we're not exposing it.
3758 * We're only building the value so we can turn around and get the
3759 * normalised values for the year, month, day-of-month, and day-of-year.
3761 * For going backward, we need to bias the value we're using so that we find
3762 * the right year value. (Basically, we don't want the contribution of
3763 * March 1st to the number to apply while deriving the year). Having done
3764 * that, we 'count up' the contribution to the year number by accounting for
3765 * full quadracenturies (400-year periods) with their extra leap days, plus
3766 * the contribution from full centuries (to avoid counting in the lost leap
3767 * days), plus the contribution from full quad-years (to count in the normal
3768 * leap days), plus the leftover contribution from any non-leap years.
3769 * At this point, if we were working with an actual leap day, we'll have 0
3770 * days left over. This is also true for March 1st, however. So, we have
3771 * to special-case that result, and (earlier) keep track of the 'odd'
3772 * century and year contributions. If we got 4 extra centuries in a qcent,
3773 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3774 * Otherwise, we add back in the earlier bias we removed (the 123 from
3775 * figuring in March 1st), find the month index (integer division by 30.6),
3776 * and the remainder is the day-of-month. We then have to convert back to
3777 * 'real' months (including fixing January and February from being 14/15 in
3778 * the previous year to being in the proper year). After that, to get
3779 * tm_yday, we work with the normalised year and get a new yearday value for
3780 * January 1st, which we subtract from the yearday value we had earlier,
3781 * representing the date we've re-built. This is done from January 1
3782 * because tm_yday is 0-origin.
3784 * Since POSIX time routines are only guaranteed to work for times since the
3785 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3786 * applies Gregorian calendar rules even to dates before the 16th century
3787 * doesn't bother me. Besides, you'd need cultural context for a given
3788 * date to know whether it was Julian or Gregorian calendar, and that's
3789 * outside the scope for this routine. Since we convert back based on the
3790 * same rules we used to build the yearday, you'll only get strange results
3791 * for input which needed normalising, or for the 'odd' century years which
3792 * were leap years in the Julian calendar but not in the Gregorian one.
3793 * I can live with that.
3795 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3796 * that's still outside the scope for POSIX time manipulation, so I don't
3800 year = 1900 + ptm->tm_year;
3801 month = ptm->tm_mon;
3802 mday = ptm->tm_mday;
3808 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3809 yearday += month*MONTH_TO_DAYS + mday + jday;
3811 * Note that we don't know when leap-seconds were or will be,
3812 * so we have to trust the user if we get something which looks
3813 * like a sensible leap-second. Wild values for seconds will
3814 * be rationalised, however.
3816 if ((unsigned) ptm->tm_sec <= 60) {
3823 secs += 60 * ptm->tm_min;
3824 secs += SECS_PER_HOUR * ptm->tm_hour;
3826 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3827 /* got negative remainder, but need positive time */
3828 /* back off an extra day to compensate */
3829 yearday += (secs/SECS_PER_DAY)-1;
3830 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3833 yearday += (secs/SECS_PER_DAY);
3834 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3837 else if (secs >= SECS_PER_DAY) {
3838 yearday += (secs/SECS_PER_DAY);
3839 secs %= SECS_PER_DAY;
3841 ptm->tm_hour = secs/SECS_PER_HOUR;
3842 secs %= SECS_PER_HOUR;
3843 ptm->tm_min = secs/60;
3845 ptm->tm_sec += secs;
3846 /* done with time of day effects */
3848 * The algorithm for yearday has (so far) left it high by 428.
3849 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3850 * bias it by 123 while trying to figure out what year it
3851 * really represents. Even with this tweak, the reverse
3852 * translation fails for years before A.D. 0001.
3853 * It would still fail for Feb 29, but we catch that one below.
3855 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3856 yearday -= YEAR_ADJUST;
3857 year = (yearday / DAYS_PER_QCENT) * 400;
3858 yearday %= DAYS_PER_QCENT;
3859 odd_cent = yearday / DAYS_PER_CENT;
3860 year += odd_cent * 100;
3861 yearday %= DAYS_PER_CENT;
3862 year += (yearday / DAYS_PER_QYEAR) * 4;
3863 yearday %= DAYS_PER_QYEAR;
3864 odd_year = yearday / DAYS_PER_YEAR;
3866 yearday %= DAYS_PER_YEAR;
3867 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3872 yearday += YEAR_ADJUST; /* recover March 1st crock */
3873 month = yearday*DAYS_TO_MONTH;
3874 yearday -= month*MONTH_TO_DAYS;
3875 /* recover other leap-year adjustment */
3884 ptm->tm_year = year - 1900;
3886 ptm->tm_mday = yearday;
3887 ptm->tm_mon = month;
3891 ptm->tm_mon = month - 1;
3893 /* re-build yearday based on Jan 1 to get tm_yday */
3895 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3896 yearday += 14*MONTH_TO_DAYS + 1;
3897 ptm->tm_yday = jday - yearday;
3898 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3902 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)
3906 /* Note that yday and wday effectively are ignored by this function, as mini_mktime() overwrites them */
3913 PERL_ARGS_ASSERT_MY_STRFTIME;
3915 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3918 mytm.tm_hour = hour;
3919 mytm.tm_mday = mday;
3921 mytm.tm_year = year;
3922 mytm.tm_wday = wday;
3923 mytm.tm_yday = yday;
3924 mytm.tm_isdst = isdst;
3926 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3927 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3932 #ifdef HAS_TM_TM_GMTOFF
3933 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3935 #ifdef HAS_TM_TM_ZONE
3936 mytm.tm_zone = mytm2.tm_zone;
3941 Newx(buf, buflen, char);
3943 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3944 len = strftime(buf, buflen, fmt, &mytm);
3948 ** The following is needed to handle to the situation where
3949 ** tmpbuf overflows. Basically we want to allocate a buffer
3950 ** and try repeatedly. The reason why it is so complicated
3951 ** is that getting a return value of 0 from strftime can indicate
3952 ** one of the following:
3953 ** 1. buffer overflowed,
3954 ** 2. illegal conversion specifier, or
3955 ** 3. the format string specifies nothing to be returned(not
3956 ** an error). This could be because format is an empty string
3957 ** or it specifies %p that yields an empty string in some locale.
3958 ** If there is a better way to make it portable, go ahead by
3961 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3964 /* Possibly buf overflowed - try again with a bigger buf */
3965 const int fmtlen = strlen(fmt);
3966 int bufsize = fmtlen + buflen;
3968 Renew(buf, bufsize, char);
3971 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3972 buflen = strftime(buf, bufsize, fmt, &mytm);
3975 if (buflen > 0 && buflen < bufsize)
3977 /* heuristic to prevent out-of-memory errors */
3978 if (bufsize > 100*fmtlen) {
3984 Renew(buf, bufsize, char);
3989 Perl_croak(aTHX_ "panic: no strftime");
3995 #define SV_CWD_RETURN_UNDEF \
3999 #define SV_CWD_ISDOT(dp) \
4000 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4001 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4004 =head1 Miscellaneous Functions
4006 =for apidoc getcwd_sv
4008 Fill C<sv> with current working directory
4013 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4014 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4015 * getcwd(3) if available
4016 * Comments from the original:
4017 * This is a faster version of getcwd. It's also more dangerous
4018 * because you might chdir out of a directory that you can't chdir
4022 Perl_getcwd_sv(pTHX_ SV *sv)
4027 PERL_ARGS_ASSERT_GETCWD_SV;
4031 char buf[MAXPATHLEN];
4033 /* Some getcwd()s automatically allocate a buffer of the given
4034 * size from the heap if they are given a NULL buffer pointer.
4035 * The problem is that this behaviour is not portable. */
4036 if (getcwd(buf, sizeof(buf) - 1)) {
4041 SV_CWD_RETURN_UNDEF;
4048 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4052 SvUPGRADE(sv, SVt_PV);
4054 if (PerlLIO_lstat(".", &statbuf) < 0) {
4055 SV_CWD_RETURN_UNDEF;
4058 orig_cdev = statbuf.st_dev;
4059 orig_cino = statbuf.st_ino;
4069 if (PerlDir_chdir("..") < 0) {
4070 SV_CWD_RETURN_UNDEF;
4072 if (PerlLIO_stat(".", &statbuf) < 0) {
4073 SV_CWD_RETURN_UNDEF;
4076 cdev = statbuf.st_dev;
4077 cino = statbuf.st_ino;
4079 if (odev == cdev && oino == cino) {
4082 if (!(dir = PerlDir_open("."))) {
4083 SV_CWD_RETURN_UNDEF;
4086 while ((dp = PerlDir_read(dir)) != NULL) {
4088 namelen = dp->d_namlen;
4090 namelen = strlen(dp->d_name);
4093 if (SV_CWD_ISDOT(dp)) {
4097 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4098 SV_CWD_RETURN_UNDEF;
4101 tdev = statbuf.st_dev;
4102 tino = statbuf.st_ino;
4103 if (tino == oino && tdev == odev) {
4109 SV_CWD_RETURN_UNDEF;
4112 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4113 SV_CWD_RETURN_UNDEF;
4116 SvGROW(sv, pathlen + namelen + 1);
4120 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4123 /* prepend current directory to the front */
4125 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4126 pathlen += (namelen + 1);
4128 #ifdef VOID_CLOSEDIR
4131 if (PerlDir_close(dir) < 0) {
4132 SV_CWD_RETURN_UNDEF;
4138 SvCUR_set(sv, pathlen);
4142 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4143 SV_CWD_RETURN_UNDEF;
4146 if (PerlLIO_stat(".", &statbuf) < 0) {
4147 SV_CWD_RETURN_UNDEF;
4150 cdev = statbuf.st_dev;
4151 cino = statbuf.st_ino;
4153 if (cdev != orig_cdev || cino != orig_cino) {
4154 Perl_croak(aTHX_ "Unstable directory path, "
4155 "current directory changed unexpectedly");
4168 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4169 # define EMULATE_SOCKETPAIR_UDP
4172 #ifdef EMULATE_SOCKETPAIR_UDP
4174 S_socketpair_udp (int fd[2]) {
4176 /* Fake a datagram socketpair using UDP to localhost. */
4177 int sockets[2] = {-1, -1};
4178 struct sockaddr_in addresses[2];
4180 Sock_size_t size = sizeof(struct sockaddr_in);
4181 unsigned short port;
4184 memset(&addresses, 0, sizeof(addresses));
4187 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4188 if (sockets[i] == -1)
4189 goto tidy_up_and_fail;
4191 addresses[i].sin_family = AF_INET;
4192 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4193 addresses[i].sin_port = 0; /* kernel choses port. */
4194 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4195 sizeof(struct sockaddr_in)) == -1)
4196 goto tidy_up_and_fail;
4199 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4200 for each connect the other socket to it. */
4203 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4205 goto tidy_up_and_fail;
4206 if (size != sizeof(struct sockaddr_in))
4207 goto abort_tidy_up_and_fail;
4208 /* !1 is 0, !0 is 1 */
4209 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4210 sizeof(struct sockaddr_in)) == -1)
4211 goto tidy_up_and_fail;
4214 /* Now we have 2 sockets connected to each other. I don't trust some other
4215 process not to have already sent a packet to us (by random) so send
4216 a packet from each to the other. */
4219 /* I'm going to send my own port number. As a short.
4220 (Who knows if someone somewhere has sin_port as a bitfield and needs
4221 this routine. (I'm assuming crays have socketpair)) */
4222 port = addresses[i].sin_port;
4223 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4224 if (got != sizeof(port)) {
4226 goto tidy_up_and_fail;
4227 goto abort_tidy_up_and_fail;
4231 /* Packets sent. I don't trust them to have arrived though.
4232 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4233 connect to localhost will use a second kernel thread. In 2.6 the
4234 first thread running the connect() returns before the second completes,
4235 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4236 returns 0. Poor programs have tripped up. One poor program's authors'
4237 had a 50-1 reverse stock split. Not sure how connected these were.)
4238 So I don't trust someone not to have an unpredictable UDP stack.
4242 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4243 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4247 FD_SET((unsigned int)sockets[0], &rset);
4248 FD_SET((unsigned int)sockets[1], &rset);
4250 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4251 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4252 || !FD_ISSET(sockets[1], &rset)) {
4253 /* I hope this is portable and appropriate. */
4255 goto tidy_up_and_fail;
4256 goto abort_tidy_up_and_fail;
4260 /* And the paranoia department even now doesn't trust it to have arrive
4261 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4263 struct sockaddr_in readfrom;
4264 unsigned short buffer[2];
4269 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4270 sizeof(buffer), MSG_DONTWAIT,
4271 (struct sockaddr *) &readfrom, &size);
4273 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4275 (struct sockaddr *) &readfrom, &size);
4279 goto tidy_up_and_fail;
4280 if (got != sizeof(port)
4281 || size != sizeof(struct sockaddr_in)
4282 /* Check other socket sent us its port. */
4283 || buffer[0] != (unsigned short) addresses[!i].sin_port
4284 /* Check kernel says we got the datagram from that socket */
4285 || readfrom.sin_family != addresses[!i].sin_family
4286 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4287 || readfrom.sin_port != addresses[!i].sin_port)
4288 goto abort_tidy_up_and_fail;
4291 /* My caller (my_socketpair) has validated that this is non-NULL */
4294 /* I hereby declare this connection open. May God bless all who cross
4298 abort_tidy_up_and_fail:
4299 errno = ECONNABORTED;
4303 if (sockets[0] != -1)
4304 PerlLIO_close(sockets[0]);
4305 if (sockets[1] != -1)
4306 PerlLIO_close(sockets[1]);
4311 #endif /* EMULATE_SOCKETPAIR_UDP */
4313 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4315 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4316 /* Stevens says that family must be AF_LOCAL, protocol 0.
4317 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4322 struct sockaddr_in listen_addr;
4323 struct sockaddr_in connect_addr;
4328 || family != AF_UNIX
4331 errno = EAFNOSUPPORT;
4339 #ifdef EMULATE_SOCKETPAIR_UDP
4340 if (type == SOCK_DGRAM)
4341 return S_socketpair_udp(fd);
4344 aTHXa(PERL_GET_THX);
4345 listener = PerlSock_socket(AF_INET, type, 0);
4348 memset(&listen_addr, 0, sizeof(listen_addr));
4349 listen_addr.sin_family = AF_INET;
4350 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4351 listen_addr.sin_port = 0; /* kernel choses port. */
4352 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4353 sizeof(listen_addr)) == -1)
4354 goto tidy_up_and_fail;
4355 if (PerlSock_listen(listener, 1) == -1)
4356 goto tidy_up_and_fail;
4358 connector = PerlSock_socket(AF_INET, type, 0);
4359 if (connector == -1)
4360 goto tidy_up_and_fail;
4361 /* We want to find out the port number to connect to. */
4362 size = sizeof(connect_addr);
4363 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4365 goto tidy_up_and_fail;
4366 if (size != sizeof(connect_addr))
4367 goto abort_tidy_up_and_fail;
4368 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4369 sizeof(connect_addr)) == -1)
4370 goto tidy_up_and_fail;
4372 size = sizeof(listen_addr);
4373 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4376 goto tidy_up_and_fail;
4377 if (size != sizeof(listen_addr))
4378 goto abort_tidy_up_and_fail;
4379 PerlLIO_close(listener);
4380 /* Now check we are talking to ourself by matching port and host on the
4382 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4384 goto tidy_up_and_fail;
4385 if (size != sizeof(connect_addr)
4386 || listen_addr.sin_family != connect_addr.sin_family
4387 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4388 || listen_addr.sin_port != connect_addr.sin_port) {
4389 goto abort_tidy_up_and_fail;
4395 abort_tidy_up_and_fail:
4397 errno = ECONNABORTED; /* This would be the standard thing to do. */
4399 # ifdef ECONNREFUSED
4400 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4402 errno = ETIMEDOUT; /* Desperation time. */
4409 PerlLIO_close(listener);
4410 if (connector != -1)
4411 PerlLIO_close(connector);
4413 PerlLIO_close(acceptor);
4419 /* In any case have a stub so that there's code corresponding
4420 * to the my_socketpair in embed.fnc. */
4422 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4423 #ifdef HAS_SOCKETPAIR
4424 return socketpair(family, type, protocol, fd);
4433 =for apidoc sv_nosharing
4435 Dummy routine which "shares" an SV when there is no sharing module present.
4436 Or "locks" it. Or "unlocks" it. In other
4437 words, ignores its single SV argument.
4438 Exists to avoid test for a C<NULL> function pointer and because it could
4439 potentially warn under some level of strict-ness.
4445 Perl_sv_nosharing(pTHX_ SV *sv)
4447 PERL_UNUSED_CONTEXT;
4448 PERL_UNUSED_ARG(sv);
4453 =for apidoc sv_destroyable
4455 Dummy routine which reports that object can be destroyed when there is no
4456 sharing module present. It ignores its single SV argument, and returns
4457 'true'. Exists to avoid test for a C<NULL> function pointer and because it
4458 could potentially warn under some level of strict-ness.
4464 Perl_sv_destroyable(pTHX_ SV *sv)
4466 PERL_UNUSED_CONTEXT;
4467 PERL_UNUSED_ARG(sv);
4472 Perl_parse_unicode_opts(pTHX_ const char **popt)
4474 const char *p = *popt;
4477 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
4483 if (grok_atoUV(p, &uv, &endptr) && uv <= U32_MAX) {
4486 if (p && *p && *p != '\n' && *p != '\r') {
4488 goto the_end_of_the_opts_parser;
4490 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4494 Perl_croak(aTHX_ "Invalid number '%s' for -C option.\n", p);
4500 case PERL_UNICODE_STDIN:
4501 opt |= PERL_UNICODE_STDIN_FLAG; break;
4502 case PERL_UNICODE_STDOUT:
4503 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4504 case PERL_UNICODE_STDERR:
4505 opt |= PERL_UNICODE_STDERR_FLAG; break;
4506 case PERL_UNICODE_STD:
4507 opt |= PERL_UNICODE_STD_FLAG; break;
4508 case PERL_UNICODE_IN:
4509 opt |= PERL_UNICODE_IN_FLAG; break;
4510 case PERL_UNICODE_OUT:
4511 opt |= PERL_UNICODE_OUT_FLAG; break;
4512 case PERL_UNICODE_INOUT:
4513 opt |= PERL_UNICODE_INOUT_FLAG; break;
4514 case PERL_UNICODE_LOCALE:
4515 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4516 case PERL_UNICODE_ARGV:
4517 opt |= PERL_UNICODE_ARGV_FLAG; break;
4518 case PERL_UNICODE_UTF8CACHEASSERT:
4519 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4521 if (*p != '\n' && *p != '\r') {
4522 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
4525 "Unknown Unicode option letter '%c'", *p);
4532 opt = PERL_UNICODE_DEFAULT_FLAGS;
4534 the_end_of_the_opts_parser:
4536 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4537 Perl_croak(aTHX_ "Unknown Unicode option value %" UVuf,
4538 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4546 # include <starlet.h>
4553 * This is really just a quick hack which grabs various garbage
4554 * values. It really should be a real hash algorithm which
4555 * spreads the effect of every input bit onto every output bit,
4556 * if someone who knows about such things would bother to write it.
4557 * Might be a good idea to add that function to CORE as well.
4558 * No numbers below come from careful analysis or anything here,
4559 * except they are primes and SEED_C1 > 1E6 to get a full-width
4560 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4561 * probably be bigger too.
4564 # define SEED_C1 1000003
4565 #define SEED_C4 73819
4567 # define SEED_C1 25747
4568 #define SEED_C4 20639
4572 #define SEED_C5 26107
4574 #ifndef PERL_NO_DEV_RANDOM
4578 #ifdef HAS_GETTIMEOFDAY
4579 struct timeval when;
4584 /* This test is an escape hatch, this symbol isn't set by Configure. */
4585 #ifndef PERL_NO_DEV_RANDOM
4586 #ifndef PERL_RANDOM_DEVICE
4587 /* /dev/random isn't used by default because reads from it will block
4588 * if there isn't enough entropy available. You can compile with
4589 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4590 * is enough real entropy to fill the seed. */
4591 # ifdef __amigaos4__
4592 # define PERL_RANDOM_DEVICE "RANDOM:SIZE=4"
4594 # define PERL_RANDOM_DEVICE "/dev/urandom"
4597 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4599 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4607 #ifdef HAS_GETTIMEOFDAY
4608 PerlProc_gettimeofday(&when,NULL);
4609 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4612 u = (U32)SEED_C1 * when;
4614 u += SEED_C3 * (U32)PerlProc_getpid();
4615 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4616 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4617 u += SEED_C5 * (U32)PTR2UV(&when);
4623 Perl_get_hash_seed(pTHX_ unsigned char * const seed_buffer)
4625 #ifndef NO_PERL_HASH_ENV
4630 PERL_ARGS_ASSERT_GET_HASH_SEED;
4632 #ifndef NO_PERL_HASH_ENV
4633 env_pv= PerlEnv_getenv("PERL_HASH_SEED");
4637 /* ignore leading spaces */
4638 while (isSPACE(*env_pv))
4640 # ifdef USE_PERL_PERTURB_KEYS
4641 /* if they set it to "0" we disable key traversal randomization completely */
4642 if (strEQ(env_pv,"0")) {
4643 PL_hash_rand_bits_enabled= 0;
4645 /* otherwise switch to deterministic mode */
4646 PL_hash_rand_bits_enabled= 2;
4649 /* ignore a leading 0x... if it is there */
4650 if (env_pv[0] == '0' && env_pv[1] == 'x')
4653 for( i = 0; isXDIGIT(*env_pv) && i < PERL_HASH_SEED_BYTES; i++ ) {
4654 seed_buffer[i] = READ_XDIGIT(env_pv) << 4;
4655 if ( isXDIGIT(*env_pv)) {
4656 seed_buffer[i] |= READ_XDIGIT(env_pv);
4659 while (isSPACE(*env_pv))
4662 if (*env_pv && !isXDIGIT(*env_pv)) {
4663 Perl_warn(aTHX_ "perl: warning: Non hex character in '$ENV{PERL_HASH_SEED}', seed only partially set\n");
4665 /* should we check for unparsed crap? */
4666 /* should we warn about unused hex? */
4667 /* should we warn about insufficient hex? */
4670 #endif /* NO_PERL_HASH_ENV */
4672 (void)seedDrand01((Rand_seed_t)seed());
4674 for( i = 0; i < PERL_HASH_SEED_BYTES; i++ ) {
4675 seed_buffer[i] = (unsigned char)(Drand01() * (U8_MAX+1));
4678 #ifdef USE_PERL_PERTURB_KEYS
4679 { /* initialize PL_hash_rand_bits from the hash seed.
4680 * This value is highly volatile, it is updated every
4681 * hash insert, and is used as part of hash bucket chain
4682 * randomization and hash iterator randomization. */
4683 PL_hash_rand_bits= 0xbe49d17f; /* I just picked a number */
4684 for( i = 0; i < sizeof(UV) ; i++ ) {
4685 PL_hash_rand_bits += seed_buffer[i % PERL_HASH_SEED_BYTES];
4686 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,8);
4689 # ifndef NO_PERL_HASH_ENV
4690 env_pv= PerlEnv_getenv("PERL_PERTURB_KEYS");
4692 if (strEQ(env_pv,"0") || strEQ(env_pv,"NO")) {
4693 PL_hash_rand_bits_enabled= 0;
4694 } else if (strEQ(env_pv,"1") || strEQ(env_pv,"RANDOM")) {
4695 PL_hash_rand_bits_enabled= 1;
4696 } else if (strEQ(env_pv,"2") || strEQ(env_pv,"DETERMINISTIC")) {
4697 PL_hash_rand_bits_enabled= 2;
4699 Perl_warn(aTHX_ "perl: warning: strange setting in '$ENV{PERL_PERTURB_KEYS}': '%s'\n", env_pv);
4706 #ifdef PERL_GLOBAL_STRUCT
4708 #define PERL_GLOBAL_STRUCT_INIT
4709 #include "opcode.h" /* the ppaddr and check */
4712 Perl_init_global_struct(pTHX)
4714 struct perl_vars *plvarsp = NULL;
4715 # ifdef PERL_GLOBAL_STRUCT
4716 const IV nppaddr = C_ARRAY_LENGTH(Gppaddr);
4717 const IV ncheck = C_ARRAY_LENGTH(Gcheck);
4718 PERL_UNUSED_CONTEXT;
4719 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4720 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4721 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4725 plvarsp = PL_VarsPtr;
4726 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4731 # define PERLVAR(prefix,var,type) /**/
4732 # define PERLVARA(prefix,var,n,type) /**/
4733 # define PERLVARI(prefix,var,type,init) plvarsp->prefix##var = init;
4734 # define PERLVARIC(prefix,var,type,init) plvarsp->prefix##var = init;
4735 # include "perlvars.h"
4740 # ifdef PERL_GLOBAL_STRUCT
4743 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4744 if (!plvarsp->Gppaddr)
4748 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4749 if (!plvarsp->Gcheck)
4751 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4752 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4754 # ifdef PERL_SET_VARS
4755 PERL_SET_VARS(plvarsp);
4757 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4758 plvarsp->Gsv_placeholder.sv_flags = 0;
4759 memset(plvarsp->Ghash_seed, 0, sizeof(plvarsp->Ghash_seed));
4761 # undef PERL_GLOBAL_STRUCT_INIT
4766 #endif /* PERL_GLOBAL_STRUCT */
4768 #ifdef PERL_GLOBAL_STRUCT
4771 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4773 int veto = plvarsp->Gveto_cleanup;
4775 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
4776 PERL_UNUSED_CONTEXT;
4777 # ifdef PERL_GLOBAL_STRUCT
4778 # ifdef PERL_UNSET_VARS
4779 PERL_UNSET_VARS(plvarsp);
4783 free(plvarsp->Gppaddr);
4784 free(plvarsp->Gcheck);
4785 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4791 #endif /* PERL_GLOBAL_STRUCT */
4795 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including
4796 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
4797 * given, and you supply your own implementation.
4799 * The default implementation reads a single env var, PERL_MEM_LOG,
4800 * expecting one or more of the following:
4802 * \d+ - fd fd to write to : must be 1st (grok_atoUV)
4803 * 'm' - memlog was PERL_MEM_LOG=1
4804 * 's' - svlog was PERL_SV_LOG=1
4805 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
4807 * This makes the logger controllable enough that it can reasonably be
4808 * added to the system perl.
4811 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
4812 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
4814 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
4816 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
4817 * writes to. In the default logger, this is settable at runtime.
4819 #ifndef PERL_MEM_LOG_FD
4820 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
4823 #ifndef PERL_MEM_LOG_NOIMPL
4825 # ifdef DEBUG_LEAKING_SCALARS
4826 # define SV_LOG_SERIAL_FMT " [%lu]"
4827 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
4829 # define SV_LOG_SERIAL_FMT
4830 # define _SV_LOG_SERIAL_ARG(sv)
4834 S_mem_log_common(enum mem_log_type mlt, const UV n,
4835 const UV typesize, const char *type_name, const SV *sv,
4836 Malloc_t oldalloc, Malloc_t newalloc,
4837 const char *filename, const int linenumber,
4838 const char *funcname)
4842 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
4844 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
4847 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
4849 /* We can't use SVs or PerlIO for obvious reasons,
4850 * so we'll use stdio and low-level IO instead. */
4851 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
4853 # ifdef HAS_GETTIMEOFDAY
4854 # define MEM_LOG_TIME_FMT "%10d.%06d: "
4855 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
4857 gettimeofday(&tv, 0);
4859 # define MEM_LOG_TIME_FMT "%10d: "
4860 # define MEM_LOG_TIME_ARG (int)when
4864 /* If there are other OS specific ways of hires time than
4865 * gettimeofday() (see dist/Time-HiRes), the easiest way is
4866 * probably that they would be used to fill in the struct
4873 if (grok_atoUV(pmlenv, &uv, &endptr) /* Ignore endptr. */
4874 && uv && uv <= PERL_INT_MAX
4878 fd = PERL_MEM_LOG_FD;
4881 if (strchr(pmlenv, 't')) {
4882 len = my_snprintf(buf, sizeof(buf),
4883 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
4884 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4888 len = my_snprintf(buf, sizeof(buf),
4889 "alloc: %s:%d:%s: %" IVdf " %" UVuf
4890 " %s = %" IVdf ": %" UVxf "\n",
4891 filename, linenumber, funcname, n, typesize,
4892 type_name, n * typesize, PTR2UV(newalloc));
4895 len = my_snprintf(buf, sizeof(buf),
4896 "realloc: %s:%d:%s: %" IVdf " %" UVuf
4897 " %s = %" IVdf ": %" UVxf " -> %" UVxf "\n",
4898 filename, linenumber, funcname, n, typesize,
4899 type_name, n * typesize, PTR2UV(oldalloc),
4903 len = my_snprintf(buf, sizeof(buf),
4904 "free: %s:%d:%s: %" UVxf "\n",
4905 filename, linenumber, funcname,
4910 len = my_snprintf(buf, sizeof(buf),
4911 "%s_SV: %s:%d:%s: %" UVxf SV_LOG_SERIAL_FMT "\n",
4912 mlt == MLT_NEW_SV ? "new" : "del",
4913 filename, linenumber, funcname,
4914 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
4919 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4923 #endif /* !PERL_MEM_LOG_NOIMPL */
4925 #ifndef PERL_MEM_LOG_NOIMPL
4927 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
4928 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
4930 /* this is suboptimal, but bug compatible. User is providing their
4931 own implementation, but is getting these functions anyway, and they
4932 do nothing. But _NOIMPL users should be able to cope or fix */
4934 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
4935 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
4939 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
4941 const char *filename, const int linenumber,
4942 const char *funcname)
4944 PERL_ARGS_ASSERT_MEM_LOG_ALLOC;
4946 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
4947 NULL, NULL, newalloc,
4948 filename, linenumber, funcname);
4953 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
4954 Malloc_t oldalloc, Malloc_t newalloc,
4955 const char *filename, const int linenumber,
4956 const char *funcname)
4958 PERL_ARGS_ASSERT_MEM_LOG_REALLOC;
4960 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
4961 NULL, oldalloc, newalloc,
4962 filename, linenumber, funcname);
4967 Perl_mem_log_free(Malloc_t oldalloc,
4968 const char *filename, const int linenumber,
4969 const char *funcname)
4971 PERL_ARGS_ASSERT_MEM_LOG_FREE;
4973 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
4974 filename, linenumber, funcname);
4979 Perl_mem_log_new_sv(const SV *sv,
4980 const char *filename, const int linenumber,
4981 const char *funcname)
4983 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
4984 filename, linenumber, funcname);
4988 Perl_mem_log_del_sv(const SV *sv,
4989 const char *filename, const int linenumber,
4990 const char *funcname)
4992 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
4993 filename, linenumber, funcname);
4996 #endif /* PERL_MEM_LOG */
4999 =for apidoc my_sprintf
5001 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5002 the length of the string written to the buffer. Only rare pre-ANSI systems
5003 need the wrapper function - usually this is a direct call to C<sprintf>.
5007 #ifndef SPRINTF_RETURNS_STRLEN
5009 Perl_my_sprintf(char *buffer, const char* pat, ...)
5012 PERL_ARGS_ASSERT_MY_SPRINTF;
5013 va_start(args, pat);
5014 vsprintf(buffer, pat, args);
5016 return strlen(buffer);
5021 =for apidoc quadmath_format_single
5023 C<quadmath_snprintf()> is very strict about its C<format> string and will
5024 fail, returning -1, if the format is invalid. It accepts exactly
5027 C<quadmath_format_single()> checks that the intended single spec looks
5028 sane: begins with C<%>, has only one C<%>, ends with C<[efgaEFGA]>,
5029 and has C<Q> before it. This is not a full "printf syntax check",
5032 Returns the format if it is valid, NULL if not.
5034 C<quadmath_format_single()> can and will actually patch in the missing
5035 C<Q>, if necessary. In this case it will return the modified copy of
5036 the format, B<which the caller will need to free.>
5038 See also L</quadmath_format_needed>.
5044 Perl_quadmath_format_single(const char* format)
5048 PERL_ARGS_ASSERT_QUADMATH_FORMAT_SINGLE;
5050 if (format[0] != '%' || strchr(format + 1, '%'))
5052 len = strlen(format);
5053 /* minimum length three: %Qg */
5054 if (len < 3 || strchr("efgaEFGA", format[len - 1]) == NULL)
5056 if (format[len - 2] != 'Q') {
5058 Newx(fixed, len + 1, char);
5059 memcpy(fixed, format, len - 1);
5060 fixed[len - 1] = 'Q';
5061 fixed[len ] = format[len - 1];
5063 return (const char*)fixed;
5070 =for apidoc quadmath_format_needed
5072 C<quadmath_format_needed()> returns true if the C<format> string seems to
5073 contain at least one non-Q-prefixed C<%[efgaEFGA]> format specifier,
5074 or returns false otherwise.
5076 The format specifier detection is not complete printf-syntax detection,
5077 but it should catch most common cases.
5079 If true is returned, those arguments B<should> in theory be processed
5080 with C<quadmath_snprintf()>, but in case there is more than one such
5081 format specifier (see L</quadmath_format_single>), and if there is
5082 anything else beyond that one (even just a single byte), they
5083 B<cannot> be processed because C<quadmath_snprintf()> is very strict,
5084 accepting only one format spec, and nothing else.
5085 In this case, the code should probably fail.
5091 Perl_quadmath_format_needed(const char* format)
5093 const char *p = format;
5096 PERL_ARGS_ASSERT_QUADMATH_FORMAT_NEEDED;
5098 while ((q = strchr(p, '%'))) {
5100 if (*q == '+') /* plus */
5102 if (*q == '#') /* alt */
5104 if (*q == '*') /* width */
5108 while (isDIGIT(*q)) q++;
5111 if (*q == '.' && (q[1] == '*' || isDIGIT(q[1]))) { /* prec */
5116 while (isDIGIT(*q)) q++;
5118 if (strchr("efgaEFGA", *q)) /* Would have needed 'Q' in front. */
5127 =for apidoc my_snprintf
5129 The C library C<snprintf> functionality, if available and
5130 standards-compliant (uses C<vsnprintf>, actually). However, if the
5131 C<vsnprintf> is not available, will unfortunately use the unsafe
5132 C<vsprintf> which can overrun the buffer (there is an overrun check,
5133 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5134 getting C<vsnprintf>.
5139 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5143 PERL_ARGS_ASSERT_MY_SNPRINTF;
5144 #ifndef HAS_VSNPRINTF
5145 PERL_UNUSED_VAR(len);
5147 va_start(ap, format);
5150 const char* qfmt = quadmath_format_single(format);
5151 bool quadmath_valid = FALSE;
5153 /* If the format looked promising, use it as quadmath. */
5154 retval = quadmath_snprintf(buffer, len, qfmt, va_arg(ap, NV));
5156 if (qfmt != format) {
5160 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
5162 quadmath_valid = TRUE;
5167 assert(qfmt == NULL);
5168 /* quadmath_format_single() will return false for example for
5169 * "foo = %g", or simply "%g". We could handle the %g by
5170 * using quadmath for the NV args. More complex cases of
5171 * course exist: "foo = %g, bar = %g", or "foo=%Qg" (otherwise
5172 * quadmath-valid but has stuff in front).
5174 * Handling the "Q-less" cases right would require walking
5175 * through the va_list and rewriting the format, calling
5176 * quadmath for the NVs, building a new va_list, and then
5177 * letting vsnprintf/vsprintf to take care of the other
5178 * arguments. This may be doable.
5180 * We do not attempt that now. But for paranoia, we here try
5181 * to detect some common (but not all) cases where the
5182 * "Q-less" %[efgaEFGA] formats are present, and die if
5183 * detected. This doesn't fix the problem, but it stops the
5184 * vsnprintf/vsprintf pulling doubles off the va_list when
5185 * __float128 NVs should be pulled off instead.
5187 * If quadmath_format_needed() returns false, we are reasonably
5188 * certain that we can call vnsprintf() or vsprintf() safely. */
5189 if (!quadmath_valid && quadmath_format_needed(format))
5190 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", format);
5195 #ifdef HAS_VSNPRINTF
5196 retval = vsnprintf(buffer, len, format, ap);
5198 retval = vsprintf(buffer, format, ap);
5201 /* vsprintf() shows failure with < 0 */
5203 #ifdef HAS_VSNPRINTF
5204 /* vsnprintf() shows failure with >= len */
5206 (len > 0 && (Size_t)retval >= len)
5209 Perl_croak_nocontext("panic: my_snprintf buffer overflow");
5214 =for apidoc my_vsnprintf
5216 The C library C<vsnprintf> if available and standards-compliant.
5217 However, if if the C<vsnprintf> is not available, will unfortunately
5218 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5219 overrun check, but that may be too late). Consider using
5220 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5225 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5228 PERL_UNUSED_ARG(buffer);
5229 PERL_UNUSED_ARG(len);
5230 PERL_UNUSED_ARG(format);
5231 /* the cast is to avoid gcc -Wsizeof-array-argument complaining */
5232 PERL_UNUSED_ARG((void*)ap);
5233 Perl_croak_nocontext("panic: my_vsnprintf not available with quadmath");
5240 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5241 Perl_va_copy(ap, apc);
5242 # ifdef HAS_VSNPRINTF
5243 retval = vsnprintf(buffer, len, format, apc);
5245 PERL_UNUSED_ARG(len);
5246 retval = vsprintf(buffer, format, apc);
5250 # ifdef HAS_VSNPRINTF
5251 retval = vsnprintf(buffer, len, format, ap);
5253 PERL_UNUSED_ARG(len);
5254 retval = vsprintf(buffer, format, ap);
5256 #endif /* #ifdef NEED_VA_COPY */
5257 /* vsprintf() shows failure with < 0 */
5259 #ifdef HAS_VSNPRINTF
5260 /* vsnprintf() shows failure with >= len */
5262 (len > 0 && (Size_t)retval >= len)
5265 Perl_croak_nocontext("panic: my_vsnprintf buffer overflow");
5271 Perl_my_clearenv(pTHX)
5274 #if ! defined(PERL_MICRO)
5275 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5277 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5278 # if defined(USE_ENVIRON_ARRAY)
5279 # if defined(USE_ITHREADS)
5280 /* only the parent thread can clobber the process environment */
5281 if (PL_curinterp == aTHX)
5282 # endif /* USE_ITHREADS */
5284 # if ! defined(PERL_USE_SAFE_PUTENV)
5285 if ( !PL_use_safe_putenv) {
5287 if (environ == PL_origenviron)
5288 environ = (char**)safesysmalloc(sizeof(char*));
5290 for (i = 0; environ[i]; i++)
5291 (void)safesysfree(environ[i]);
5294 # else /* PERL_USE_SAFE_PUTENV */
5295 # if defined(HAS_CLEARENV)
5297 # elif defined(HAS_UNSETENV)
5298 int bsiz = 80; /* Most envvar names will be shorter than this. */
5299 char *buf = (char*)safesysmalloc(bsiz);
5300 while (*environ != NULL) {
5301 char *e = strchr(*environ, '=');
5302 int l = e ? e - *environ : (int)strlen(*environ);
5304 (void)safesysfree(buf);
5305 bsiz = l + 1; /* + 1 for the \0. */
5306 buf = (char*)safesysmalloc(bsiz);
5308 memcpy(buf, *environ, l);
5310 (void)unsetenv(buf);
5312 (void)safesysfree(buf);
5313 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5314 /* Just null environ and accept the leakage. */
5316 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5317 # endif /* ! PERL_USE_SAFE_PUTENV */
5319 # endif /* USE_ENVIRON_ARRAY */
5320 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5321 #endif /* PERL_MICRO */
5324 #ifdef PERL_IMPLICIT_CONTEXT
5326 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5327 the global PL_my_cxt_index is incremented, and that value is assigned to
5328 that module's static my_cxt_index (who's address is passed as an arg).
5329 Then, for each interpreter this function is called for, it makes sure a
5330 void* slot is available to hang the static data off, by allocating or
5331 extending the interpreter's PL_my_cxt_list array */
5333 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5335 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5339 PERL_ARGS_ASSERT_MY_CXT_INIT;
5341 /* this module hasn't been allocated an index yet */
5342 MUTEX_LOCK(&PL_my_ctx_mutex);
5343 *index = PL_my_cxt_index++;
5344 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5347 /* make sure the array is big enough */
5348 if (PL_my_cxt_size <= *index) {
5349 if (PL_my_cxt_size) {
5350 IV new_size = PL_my_cxt_size;
5351 while (new_size <= *index)
5353 Renew(PL_my_cxt_list, new_size, void *);
5354 PL_my_cxt_size = new_size;
5357 PL_my_cxt_size = 16;
5358 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5361 /* newSV() allocates one more than needed */
5362 p = (void*)SvPVX(newSV(size-1));
5363 PL_my_cxt_list[*index] = p;
5364 Zero(p, size, char);
5368 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5371 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5376 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5378 for (index = 0; index < PL_my_cxt_index; index++) {
5379 const char *key = PL_my_cxt_keys[index];
5380 /* try direct pointer compare first - there are chances to success,
5381 * and it's much faster.
5383 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5390 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5396 PERL_ARGS_ASSERT_MY_CXT_INIT;
5398 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5400 /* this module hasn't been allocated an index yet */
5401 MUTEX_LOCK(&PL_my_ctx_mutex);
5402 index = PL_my_cxt_index++;
5403 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5406 /* make sure the array is big enough */
5407 if (PL_my_cxt_size <= index) {
5408 int old_size = PL_my_cxt_size;
5410 if (PL_my_cxt_size) {
5411 IV new_size = PL_my_cxt_size;
5412 while (new_size <= index)
5414 Renew(PL_my_cxt_list, new_size, void *);
5415 Renew(PL_my_cxt_keys, new_size, const char *);
5416 PL_my_cxt_size = new_size;
5419 PL_my_cxt_size = 16;
5420 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5421 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5423 for (i = old_size; i < PL_my_cxt_size; i++) {
5424 PL_my_cxt_keys[i] = 0;
5425 PL_my_cxt_list[i] = 0;
5428 PL_my_cxt_keys[index] = my_cxt_key;
5429 /* newSV() allocates one more than needed */
5430 p = (void*)SvPVX(newSV(size-1));
5431 PL_my_cxt_list[index] = p;
5432 Zero(p, size, char);
5435 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5436 #endif /* PERL_IMPLICIT_CONTEXT */
5439 /* Perl_xs_handshake():
5440 implement the various XS_*_BOOTCHECK macros, which are added to .c
5441 files by ExtUtils::ParseXS, to check that the perl the module was built
5442 with is binary compatible with the running perl.
5445 Perl_xs_handshake(U32 key, void * v_my_perl, const char * file,
5446 [U32 items, U32 ax], [char * api_version], [char * xs_version])
5448 The meaning of the varargs is determined the U32 key arg (which is not
5449 a format string). The fields of key are assembled by using HS_KEY().
5451 Under PERL_IMPLICIT_CONTEX, the v_my_perl arg is of type
5452 "PerlInterpreter *" and represents the callers context; otherwise it is
5453 of type "CV *", and is the boot xsub's CV.
5455 v_my_perl will catch where a threaded future perl526.dll calling IO.dll
5456 for example, and IO.dll was linked with threaded perl524.dll, and both
5457 perl526.dll and perl524.dll are in %PATH and the Win32 DLL loader
5458 successfully can load IO.dll into the process but simultaneously it
5459 loaded an interpreter of a different version into the process, and XS
5460 code will naturally pass SV*s created by perl524.dll for perl526.dll to
5461 use through perl526.dll's my_perl->Istack_base.
5463 v_my_perl cannot be the first arg, since then 'key' will be out of
5464 place in a threaded vs non-threaded mixup; and analyzing the key
5465 number's bitfields won't reveal the problem, since it will be a valid
5466 key (unthreaded perl) on interp side, but croak will report the XS mod's
5467 key as gibberish (it is really a my_perl ptr) (threaded XS mod); or if
5468 it's a threaded perl and an unthreaded XS module, threaded perl will
5469 look at an uninit C stack or an uninit register to get 'key'
5470 (remember that it assumes that the 1st arg is the interp cxt).
5472 'file' is the source filename of the caller.
5476 Perl_xs_handshake(const U32 key, void * v_my_perl, const char * file, ...)
5482 #ifdef PERL_IMPLICIT_CONTEXT
5489 PERL_ARGS_ASSERT_XS_HANDSHAKE;
5490 va_start(args, file);
5492 got = INT2PTR(void*, (UV)(key & HSm_KEY_MATCH));
5493 need = (void *)(HS_KEY(FALSE, FALSE, "", "") & HSm_KEY_MATCH);
5494 if (UNLIKELY(got != need))
5496 /* try to catch where a 2nd threaded perl interp DLL is loaded into a process
5497 by a XS DLL compiled against the wrong interl DLL b/c of bad @INC, and the
5498 2nd threaded perl interp DLL never initialized its TLS/PERL_SYS_INIT3 so
5499 dTHX call from 2nd interp DLL can't return the my_perl that pp_entersub
5500 passed to the XS DLL */
5501 #ifdef PERL_IMPLICIT_CONTEXT
5502 xs_interp = (tTHX)v_my_perl;
5506 /* try to catch where an unthreaded perl interp DLL (for ex. perl522.dll) is
5507 loaded into a process by a XS DLL built by an unthreaded perl522.dll perl,
5508 but the DynaLoder/Perl that started the process and loaded the XS DLL is
5509 unthreaded perl524.dll, since unthreadeds don't pass my_perl (a unique *)
5510 through pp_entersub, use a unique value (which is a pointer to PL_stack_sp's
5511 location in the unthreaded perl binary) stored in CV * to figure out if this
5512 Perl_xs_handshake was called by the same pp_entersub */
5513 cv = (CV*)v_my_perl;
5514 xs_spp = (SV***)CvHSCXT(cv);
5516 need = &PL_stack_sp;
5518 if(UNLIKELY(got != need)) {
5519 bad_handshake:/* recycle branch and string from above */
5520 if(got != (void *)HSf_NOCHK)
5521 noperl_die("%s: loadable library and perl binaries are mismatched"
5522 " (got handshake key %p, needed %p)\n",
5526 if(key & HSf_SETXSUBFN) { /* this might be called from a module bootstrap */
5527 SAVEPPTR(PL_xsubfilename);/* which was require'd from a XSUB BEGIN */
5528 PL_xsubfilename = file; /* so the old name must be restored for
5529 additional XSUBs to register themselves */
5530 /* XSUBs can't be perl lang/perl5db.pl debugged
5531 if (PERLDB_LINE_OR_SAVESRC)
5532 (void)gv_fetchfile(file); */
5535 if(key & HSf_POPMARK) {
5537 { SV **mark = PL_stack_base + ax++;
5539 items = (I32)(SP - MARK);
5543 items = va_arg(args, U32);
5544 ax = va_arg(args, U32);
5548 assert(HS_GETAPIVERLEN(key) <= UCHAR_MAX);
5549 if((apiverlen = HS_GETAPIVERLEN(key))) {
5550 char * api_p = va_arg(args, char*);
5551 if(apiverlen != sizeof("v" PERL_API_VERSION_STRING)-1
5552 || memNE(api_p, "v" PERL_API_VERSION_STRING,
5553 sizeof("v" PERL_API_VERSION_STRING)-1))
5554 Perl_croak_nocontext("Perl API version %s of %" SVf " does not match %s",
5555 api_p, SVfARG(PL_stack_base[ax + 0]),
5556 "v" PERL_API_VERSION_STRING);
5561 assert(HS_GETXSVERLEN(key) <= UCHAR_MAX && HS_GETXSVERLEN(key) <= HS_APIVERLEN_MAX);
5562 if((xsverlen = HS_GETXSVERLEN(key)))
5563 S_xs_version_bootcheck(aTHX_
5564 items, ax, va_arg(args, char*), xsverlen);
5572 S_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
5576 const char *vn = NULL;
5577 SV *const module = PL_stack_base[ax];
5579 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
5581 if (items >= 2) /* version supplied as bootstrap arg */
5582 sv = PL_stack_base[ax + 1];
5584 /* XXX GV_ADDWARN */
5586 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5587 if (!sv || !SvOK(sv)) {
5589 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5593 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
5594 SV *pmsv = sv_isobject(sv) && sv_derived_from(sv, "version")
5595 ? sv : sv_2mortal(new_version(sv));
5596 xssv = upg_version(xssv, 0);
5597 if ( vcmp(pmsv,xssv) ) {
5598 SV *string = vstringify(xssv);
5599 SV *xpt = Perl_newSVpvf(aTHX_ "%" SVf " object version %" SVf
5600 " does not match ", SVfARG(module), SVfARG(string));
5602 SvREFCNT_dec(string);
5603 string = vstringify(pmsv);
5606 Perl_sv_catpvf(aTHX_ xpt, "$%" SVf "::%s %" SVf, SVfARG(module), vn,
5609 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %" SVf, SVfARG(string));
5611 SvREFCNT_dec(string);
5613 Perl_sv_2mortal(aTHX_ xpt);
5614 Perl_croak_sv(aTHX_ xpt);
5620 =for apidoc my_strlcat
5622 The C library C<strlcat> if available, or a Perl implementation of it.
5623 This operates on C C<NUL>-terminated strings.
5625 C<my_strlcat()> appends string C<src> to the end of C<dst>. It will append at
5626 most S<C<size - strlen(dst) - 1>> characters. It will then C<NUL>-terminate,
5627 unless C<size> is 0 or the original C<dst> string was longer than C<size> (in
5628 practice this should not happen as it means that either C<size> is incorrect or
5629 that C<dst> is not a proper C<NUL>-terminated string).
5631 Note that C<size> is the full size of the destination buffer and
5632 the result is guaranteed to be C<NUL>-terminated if there is room. Note that
5633 room for the C<NUL> should be included in C<size>.
5635 The return value is the total length that C<dst> would have if C<size> is
5636 sufficiently large. Thus it is the initial length of C<dst> plus the length of
5637 C<src>. If C<size> is smaller than the return, the excess was not appended.
5641 Description stolen from http://man.openbsd.org/strlcat.3
5645 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5647 Size_t used, length, copy;
5650 length = strlen(src);
5651 if (size > 0 && used < size - 1) {
5652 copy = (length >= size - used) ? size - used - 1 : length;
5653 memcpy(dst + used, src, copy);
5654 dst[used + copy] = '\0';
5656 return used + length;
5662 =for apidoc my_strlcpy
5664 The C library C<strlcpy> if available, or a Perl implementation of it.
5665 This operates on C C<NUL>-terminated strings.
5667 C<my_strlcpy()> copies up to S<C<size - 1>> characters from the string C<src>
5668 to C<dst>, C<NUL>-terminating the result if C<size> is not 0.
5670 The return value is the total length C<src> would be if the copy completely
5671 succeeded. If it is larger than C<size>, the excess was not copied.
5675 Description stolen from http://man.openbsd.org/strlcpy.3
5679 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5681 Size_t length, copy;
5683 length = strlen(src);
5685 copy = (length >= size) ? size - 1 : length;
5686 memcpy(dst, src, copy);
5693 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5694 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5695 long _ftol( double ); /* Defined by VC6 C libs. */
5696 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5699 PERL_STATIC_INLINE bool
5700 S_gv_has_usable_name(pTHX_ GV *gv)
5704 && HvENAME(GvSTASH(gv))
5705 && (gvp = (GV **)hv_fetchhek(
5706 GvSTASH(gv), GvNAME_HEK(gv), 0
5712 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5714 SV * const dbsv = GvSVn(PL_DBsub);
5715 const bool save_taint = TAINT_get;
5717 /* When we are called from pp_goto (svp is null),
5718 * we do not care about using dbsv to call CV;
5719 * it's for informational purposes only.
5722 PERL_ARGS_ASSERT_GET_DB_SUB;
5726 if (!PERLDB_SUB_NN) {
5729 if (!svp && !CvLEXICAL(cv)) {
5730 gv_efullname3(dbsv, gv, NULL);
5732 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED)) || CvLEXICAL(cv)
5733 || strEQ(GvNAME(gv), "END")
5734 || ( /* Could be imported, and old sub redefined. */
5735 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
5737 !( (SvTYPE(*svp) == SVt_PVGV)
5738 && (GvCV((const GV *)*svp) == cv)
5739 /* Use GV from the stack as a fallback. */
5740 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
5744 /* GV is potentially non-unique, or contain different CV. */
5745 SV * const tmp = newRV(MUTABLE_SV(cv));
5746 sv_setsv(dbsv, tmp);
5750 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
5751 sv_catpvs(dbsv, "::");
5752 sv_cathek(dbsv, GvNAME_HEK(gv));
5756 const int type = SvTYPE(dbsv);
5757 if (type < SVt_PVIV && type != SVt_IV)
5758 sv_upgrade(dbsv, SVt_PVIV);
5759 (void)SvIOK_on(dbsv);
5760 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5763 TAINT_IF(save_taint);
5764 #ifdef NO_TAINT_SUPPORT
5765 PERL_UNUSED_VAR(save_taint);
5770 Perl_my_dirfd(DIR * dir) {
5772 /* Most dirfd implementations have problems when passed NULL. */
5777 #elif defined(HAS_DIR_DD_FD)
5780 Perl_croak_nocontext(PL_no_func, "dirfd");
5781 NOT_REACHED; /* NOTREACHED */
5787 Perl_get_re_arg(pTHX_ SV *sv) {
5793 sv = MUTABLE_SV(SvRV(sv));
5794 if (SvTYPE(sv) == SVt_REGEXP)
5795 return (REGEXP*) sv;
5802 * This code is derived from drand48() implementation from FreeBSD,
5803 * found in lib/libc/gen/_rand48.c.
5805 * The U64 implementation is original, based on the POSIX
5806 * specification for drand48().
5810 * Copyright (c) 1993 Martin Birgmeier
5811 * All rights reserved.
5813 * You may redistribute unmodified or modified versions of this source
5814 * code provided that the above copyright notice and this and the
5815 * following conditions are retained.
5817 * This software is provided ``as is'', and comes with no warranties
5818 * of any kind. I shall in no event be liable for anything that happens
5819 * to anyone/anything when using this software.
5822 #define FREEBSD_DRAND48_SEED_0 (0x330e)
5824 #ifdef PERL_DRAND48_QUAD
5826 #define DRAND48_MULT U64_CONST(0x5deece66d)
5827 #define DRAND48_ADD 0xb
5828 #define DRAND48_MASK U64_CONST(0xffffffffffff)
5832 #define FREEBSD_DRAND48_SEED_1 (0xabcd)
5833 #define FREEBSD_DRAND48_SEED_2 (0x1234)
5834 #define FREEBSD_DRAND48_MULT_0 (0xe66d)
5835 #define FREEBSD_DRAND48_MULT_1 (0xdeec)
5836 #define FREEBSD_DRAND48_MULT_2 (0x0005)
5837 #define FREEBSD_DRAND48_ADD (0x000b)
5839 const unsigned short _rand48_mult[3] = {
5840 FREEBSD_DRAND48_MULT_0,
5841 FREEBSD_DRAND48_MULT_1,
5842 FREEBSD_DRAND48_MULT_2
5844 const unsigned short _rand48_add = FREEBSD_DRAND48_ADD;
5849 Perl_drand48_init_r(perl_drand48_t *random_state, U32 seed)
5851 PERL_ARGS_ASSERT_DRAND48_INIT_R;
5853 #ifdef PERL_DRAND48_QUAD
5854 *random_state = FREEBSD_DRAND48_SEED_0 + ((U64)seed << 16);
5856 random_state->seed[0] = FREEBSD_DRAND48_SEED_0;
5857 random_state->seed[1] = (U16) seed;
5858 random_state->seed[2] = (U16) (seed >> 16);
5863 Perl_drand48_r(perl_drand48_t *random_state)
5865 PERL_ARGS_ASSERT_DRAND48_R;
5867 #ifdef PERL_DRAND48_QUAD
5868 *random_state = (*random_state * DRAND48_MULT + DRAND48_ADD)
5871 return ldexp((double)*random_state, -48);
5877 accu = (U32) _rand48_mult[0] * (U32) random_state->seed[0]
5878 + (U32) _rand48_add;
5879 temp[0] = (U16) accu; /* lower 16 bits */
5880 accu >>= sizeof(U16) * 8;
5881 accu += (U32) _rand48_mult[0] * (U32) random_state->seed[1]
5882 + (U32) _rand48_mult[1] * (U32) random_state->seed[0];
5883 temp[1] = (U16) accu; /* middle 16 bits */
5884 accu >>= sizeof(U16) * 8;
5885 accu += _rand48_mult[0] * random_state->seed[2]
5886 + _rand48_mult[1] * random_state->seed[1]
5887 + _rand48_mult[2] * random_state->seed[0];
5888 random_state->seed[0] = temp[0];
5889 random_state->seed[1] = temp[1];
5890 random_state->seed[2] = (U16) accu;
5892 return ldexp((double) random_state->seed[0], -48) +
5893 ldexp((double) random_state->seed[1], -32) +
5894 ldexp((double) random_state->seed[2], -16);
5899 #ifdef USE_C_BACKTRACE
5901 /* Possibly move all this USE_C_BACKTRACE code into a new file. */
5906 /* abfd is the BFD handle. */
5908 /* bfd_syms is the BFD symbol table. */
5910 /* bfd_text is handle to the the ".text" section of the object file. */
5912 /* Since opening the executable and scanning its symbols is quite
5913 * heavy operation, we remember the filename we used the last time,
5914 * and do the opening and scanning only if the filename changes.
5915 * This removes most (but not all) open+scan cycles. */
5916 const char* fname_prev;
5919 /* Given a dl_info, update the BFD context if necessary. */
5920 static void bfd_update(bfd_context* ctx, Dl_info* dl_info)
5922 /* BFD open and scan only if the filename changed. */
5923 if (ctx->fname_prev == NULL ||
5924 strNE(dl_info->dli_fname, ctx->fname_prev)) {
5926 bfd_close(ctx->abfd);
5928 ctx->abfd = bfd_openr(dl_info->dli_fname, 0);
5930 if (bfd_check_format(ctx->abfd, bfd_object)) {
5931 IV symbol_size = bfd_get_symtab_upper_bound(ctx->abfd);
5932 if (symbol_size > 0) {
5933 Safefree(ctx->bfd_syms);
5934 Newx(ctx->bfd_syms, symbol_size, asymbol*);
5936 bfd_get_section_by_name(ctx->abfd, ".text");
5944 ctx->fname_prev = dl_info->dli_fname;
5948 /* Given a raw frame, try to symbolize it and store
5949 * symbol information (source file, line number) away. */
5950 static void bfd_symbolize(bfd_context* ctx,
5953 STRLEN* symbol_name_size,
5955 STRLEN* source_name_size,
5956 STRLEN* source_line)
5958 *symbol_name = NULL;
5959 *symbol_name_size = 0;
5961 IV offset = PTR2IV(raw_frame) - PTR2IV(ctx->bfd_text->vma);
5963 bfd_canonicalize_symtab(ctx->abfd, ctx->bfd_syms) > 0) {
5966 unsigned int line = 0;
5967 if (bfd_find_nearest_line(ctx->abfd, ctx->bfd_text,
5968 ctx->bfd_syms, offset,
5969 &file, &func, &line) &&
5970 file && func && line > 0) {
5971 /* Size and copy the source file, use only
5972 * the basename of the source file.
5974 * NOTE: the basenames are fine for the
5975 * Perl source files, but may not always
5976 * be the best idea for XS files. */
5977 const char *p, *b = NULL;
5978 /* Look for the last slash. */
5979 for (p = file; *p; p++) {
5983 if (b == NULL || *b == 0) {
5986 *source_name_size = p - b + 1;
5987 Newx(*source_name, *source_name_size + 1, char);
5988 Copy(b, *source_name, *source_name_size + 1, char);
5990 *symbol_name_size = strlen(func);
5991 Newx(*symbol_name, *symbol_name_size + 1, char);
5992 Copy(func, *symbol_name, *symbol_name_size + 1, char);
5994 *source_line = line;
6000 #endif /* #ifdef USE_BFD */
6004 /* OS X has no public API for for 'symbolicating' (Apple official term)
6005 * stack addresses to {function_name, source_file, line_number}.
6006 * Good news: there is command line utility atos(1) which does that.
6007 * Bad news 1: it's a command line utility.
6008 * Bad news 2: one needs to have the Developer Tools installed.
6009 * Bad news 3: in newer releases it needs to be run as 'xcrun atos'.
6011 * To recap: we need to open a pipe for reading for a utility which
6012 * might not exist, or exists in different locations, and then parse
6013 * the output. And since this is all for a low-level API, we cannot
6014 * use high-level stuff. Thanks, Apple. */
6017 /* tool is set to the absolute pathname of the tool to use:
6020 /* format is set to a printf format string used for building
6021 * the external command to run. */
6023 /* unavail is set if e.g. xcrun cannot be found, or something
6024 * else happens that makes getting the backtrace dubious. Note,
6025 * however, that the context isn't persistent, the next call to
6026 * get_c_backtrace() will start from scratch. */
6028 /* fname is the current object file name. */
6030 /* object_base_addr is the base address of the shared object. */
6031 void* object_base_addr;
6034 /* Given |dl_info|, updates the context. If the context has been
6035 * marked unavailable, return immediately. If not but the tool has
6036 * not been set, set it to either "xcrun atos" or "atos" (also set the
6037 * format to use for creating commands for piping), or if neither is
6038 * unavailable (one needs the Developer Tools installed), mark the context
6039 * an unavailable. Finally, update the filename (object name),
6040 * and its base address. */
6042 static void atos_update(atos_context* ctx,
6047 if (ctx->tool == NULL) {
6048 const char* tools[] = {
6052 const char* formats[] = {
6053 "/usr/bin/xcrun atos -o '%s' -l %08x %08x 2>&1",
6054 "/usr/bin/atos -d -o '%s' -l %08x %08x 2>&1"
6058 for (i = 0; i < C_ARRAY_LENGTH(tools); i++) {
6059 if (stat(tools[i], &st) == 0 && S_ISREG(st.st_mode)) {
6060 ctx->tool = tools[i];
6061 ctx->format = formats[i];
6065 if (ctx->tool == NULL) {
6066 ctx->unavail = TRUE;
6070 if (ctx->fname == NULL ||
6071 strNE(dl_info->dli_fname, ctx->fname)) {
6072 ctx->fname = dl_info->dli_fname;
6073 ctx->object_base_addr = dl_info->dli_fbase;
6077 /* Given an output buffer end |p| and its |start|, matches
6078 * for the atos output, extracting the source code location
6079 * and returning non-NULL if possible, returning NULL otherwise. */
6080 static const char* atos_parse(const char* p,
6082 STRLEN* source_name_size,
6083 STRLEN* source_line) {
6084 /* atos() output is something like:
6085 * perl_parse (in miniperl) (perl.c:2314)\n\n".
6086 * We cannot use Perl regular expressions, because we need to
6087 * stay low-level. Therefore here we have a rolled-out version
6088 * of a state machine which matches _backwards_from_the_end_ and
6089 * if there's a success, returns the starts of the filename,
6090 * also setting the filename size and the source line number.
6091 * The matched regular expression is roughly "\(.*:\d+\)\s*$" */
6092 const char* source_number_start;
6093 const char* source_name_end;
6094 const char* source_line_end;
6095 const char* close_paren;
6098 /* Skip trailing whitespace. */
6099 while (p > start && isspace(*p)) p--;
6100 /* Now we should be at the close paren. */
6101 if (p == start || *p != ')')
6105 /* Now we should be in the line number. */
6106 if (p == start || !isdigit(*p))
6108 /* Skip over the digits. */
6109 while (p > start && isdigit(*p))
6111 /* Now we should be at the colon. */
6112 if (p == start || *p != ':')
6114 source_number_start = p + 1;
6115 source_name_end = p; /* Just beyond the end. */
6117 /* Look for the open paren. */
6118 while (p > start && *p != '(')
6123 *source_name_size = source_name_end - p;
6124 if (grok_atoUV(source_number_start, &uv, &source_line_end)
6125 && source_line_end == close_paren
6126 && uv <= PERL_INT_MAX
6128 *source_line = (STRLEN)uv;
6134 /* Given a raw frame, read a pipe from the symbolicator (that's the
6135 * technical term) atos, reads the result, and parses the source code
6136 * location. We must stay low-level, so we use snprintf(), pipe(),
6137 * and fread(), and then also parse the output ourselves. */
6138 static void atos_symbolize(atos_context* ctx,
6141 STRLEN* source_name_size,
6142 STRLEN* source_line)
6150 /* Simple security measure: if there's any funny business with
6151 * the object name (used as "-o '%s'" ), leave since at least
6152 * partially the user controls it. */
6153 for (p = ctx->fname; *p; p++) {
6154 if (*p == '\'' || iscntrl(*p)) {
6155 ctx->unavail = TRUE;
6159 cnt = snprintf(cmd, sizeof(cmd), ctx->format,
6160 ctx->fname, ctx->object_base_addr, raw_frame);
6161 if (cnt < sizeof(cmd)) {
6162 /* Undo nostdio.h #defines that disable stdio.
6163 * This is somewhat naughty, but is used elsewhere
6164 * in the core, and affects only OS X. */
6169 FILE* fp = popen(cmd, "r");
6170 /* At the moment we open a new pipe for each stack frame.
6171 * This is naturally somewhat slow, but hopefully generating
6172 * stack traces is never going to in a performance critical path.
6174 * We could play tricks with atos by batching the stack
6175 * addresses to be resolved: atos can either take multiple
6176 * addresses from the command line, or read addresses from
6177 * a file (though the mess of creating temporary files would
6178 * probably negate much of any possible speedup).
6180 * Normally there are only two objects present in the backtrace:
6181 * perl itself, and the libdyld.dylib. (Note that the object
6182 * filenames contain the full pathname, so perl may not always
6183 * be in the same place.) Whenever the object in the
6184 * backtrace changes, the base address also changes.
6186 * The problem with batching the addresses, though, would be
6187 * matching the results with the addresses: the parsing of
6188 * the results is already painful enough with a single address. */
6191 UV cnt = fread(out, 1, sizeof(out), fp);
6192 if (cnt < sizeof(out)) {
6193 const char* p = atos_parse(out + cnt - 1, out,
6198 *source_name_size, char);
6199 Copy(p, *source_name,
6200 *source_name_size, char);
6208 #endif /* #ifdef PERL_DARWIN */
6211 =for apidoc get_c_backtrace
6213 Collects the backtrace (aka "stacktrace") into a single linear
6214 malloced buffer, which the caller B<must> C<Perl_free_c_backtrace()>.
6216 Scans the frames back by S<C<depth + skip>>, then drops the C<skip> innermost,
6217 returning at most C<depth> frames.
6223 Perl_get_c_backtrace(pTHX_ int depth, int skip)
6225 /* Note that here we must stay as low-level as possible: Newx(),
6226 * Copy(), Safefree(); since we may be called from anywhere,
6227 * so we should avoid higher level constructs like SVs or AVs.
6229 * Since we are using safesysmalloc() via Newx(), don't try
6230 * getting backtrace() there, unless you like deep recursion. */
6232 /* Currently only implemented with backtrace() and dladdr(),
6233 * for other platforms NULL is returned. */
6235 #if defined(HAS_BACKTRACE) && defined(HAS_DLADDR)
6236 /* backtrace() is available via <execinfo.h> in glibc and in most
6237 * modern BSDs; dladdr() is available via <dlfcn.h>. */
6239 /* We try fetching this many frames total, but then discard
6240 * the |skip| first ones. For the remaining ones we will try
6241 * retrieving more information with dladdr(). */
6242 int try_depth = skip + depth;
6244 /* The addresses (program counters) returned by backtrace(). */
6247 /* Retrieved with dladdr() from the addresses returned by backtrace(). */
6250 /* Sizes _including_ the terminating \0 of the object name
6251 * and symbol name strings. */
6252 STRLEN* object_name_sizes;
6253 STRLEN* symbol_name_sizes;
6256 /* The symbol names comes either from dli_sname,
6257 * or if using BFD, they can come from BFD. */
6258 char** symbol_names;
6261 /* The source code location information. Dug out with e.g. BFD. */
6262 char** source_names;
6263 STRLEN* source_name_sizes;
6264 STRLEN* source_lines;
6266 Perl_c_backtrace* bt = NULL; /* This is what will be returned. */
6267 int got_depth; /* How many frames were returned from backtrace(). */
6268 UV frame_count = 0; /* How many frames we return. */
6269 UV total_bytes = 0; /* The size of the whole returned backtrace. */
6272 bfd_context bfd_ctx;
6275 atos_context atos_ctx;
6278 /* Here are probably possibilities for optimizing. We could for
6279 * example have a struct that contains most of these and then
6280 * allocate |try_depth| of them, saving a bunch of malloc calls.
6281 * Note, however, that |frames| could not be part of that struct
6282 * because backtrace() will want an array of just them. Also be
6283 * careful about the name strings. */
6284 Newx(raw_frames, try_depth, void*);
6285 Newx(dl_infos, try_depth, Dl_info);
6286 Newx(object_name_sizes, try_depth, STRLEN);
6287 Newx(symbol_name_sizes, try_depth, STRLEN);
6288 Newx(source_names, try_depth, char*);
6289 Newx(source_name_sizes, try_depth, STRLEN);
6290 Newx(source_lines, try_depth, STRLEN);
6292 Newx(symbol_names, try_depth, char*);
6295 /* Get the raw frames. */
6296 got_depth = (int)backtrace(raw_frames, try_depth);
6298 /* We use dladdr() instead of backtrace_symbols() because we want
6299 * the full details instead of opaque strings. This is useful for
6300 * two reasons: () the details are needed for further symbolic
6301 * digging, for example in OS X (2) by having the details we fully
6302 * control the output, which in turn is useful when more platforms
6303 * are added: we can keep out output "portable". */
6305 /* We want a single linear allocation, which can then be freed
6306 * with a single swoop. We will do the usual trick of first
6307 * walking over the structure and seeing how much we need to
6308 * allocate, then allocating, and then walking over the structure
6309 * the second time and populating it. */
6311 /* First we must compute the total size of the buffer. */
6312 total_bytes = sizeof(Perl_c_backtrace_header);
6313 if (got_depth > skip) {
6316 bfd_init(); /* Is this safe to call multiple times? */
6317 Zero(&bfd_ctx, 1, bfd_context);
6320 Zero(&atos_ctx, 1, atos_context);
6322 for (i = skip; i < try_depth; i++) {
6323 Dl_info* dl_info = &dl_infos[i];
6325 object_name_sizes[i] = 0;
6326 source_names[i] = NULL;
6327 source_name_sizes[i] = 0;
6328 source_lines[i] = 0;
6330 /* Yes, zero from dladdr() is failure. */
6331 if (dladdr(raw_frames[i], dl_info)) {
6332 total_bytes += sizeof(Perl_c_backtrace_frame);
6334 object_name_sizes[i] =
6335 dl_info->dli_fname ? strlen(dl_info->dli_fname) : 0;
6336 symbol_name_sizes[i] =
6337 dl_info->dli_sname ? strlen(dl_info->dli_sname) : 0;
6339 bfd_update(&bfd_ctx, dl_info);
6340 bfd_symbolize(&bfd_ctx, raw_frames[i],
6342 &symbol_name_sizes[i],
6344 &source_name_sizes[i],
6348 atos_update(&atos_ctx, dl_info);
6349 atos_symbolize(&atos_ctx,
6352 &source_name_sizes[i],
6356 /* Plus ones for the terminating \0. */
6357 total_bytes += object_name_sizes[i] + 1;
6358 total_bytes += symbol_name_sizes[i] + 1;
6359 total_bytes += source_name_sizes[i] + 1;
6367 Safefree(bfd_ctx.bfd_syms);
6371 /* Now we can allocate and populate the result buffer. */
6372 Newxc(bt, total_bytes, char, Perl_c_backtrace);
6373 Zero(bt, total_bytes, char);
6374 bt->header.frame_count = frame_count;
6375 bt->header.total_bytes = total_bytes;
6376 if (frame_count > 0) {
6377 Perl_c_backtrace_frame* frame = bt->frame_info;
6378 char* name_base = (char *)(frame + frame_count);
6379 char* name_curr = name_base; /* Outputting the name strings here. */
6381 for (i = skip; i < skip + frame_count; i++) {
6382 Dl_info* dl_info = &dl_infos[i];
6384 frame->addr = raw_frames[i];
6385 frame->object_base_addr = dl_info->dli_fbase;
6386 frame->symbol_addr = dl_info->dli_saddr;
6388 /* Copies a string, including the \0, and advances the name_curr.
6389 * Also copies the start and the size to the frame. */
6390 #define PERL_C_BACKTRACE_STRCPY(frame, doffset, src, dsize, size) \
6392 Copy(src, name_curr, size, char); \
6393 frame->doffset = name_curr - (char*)bt; \
6394 frame->dsize = size; \
6395 name_curr += size; \
6398 PERL_C_BACKTRACE_STRCPY(frame, object_name_offset,
6400 object_name_size, object_name_sizes[i]);
6403 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6405 symbol_name_size, symbol_name_sizes[i]);
6406 Safefree(symbol_names[i]);
6408 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6410 symbol_name_size, symbol_name_sizes[i]);
6413 PERL_C_BACKTRACE_STRCPY(frame, source_name_offset,
6415 source_name_size, source_name_sizes[i]);
6416 Safefree(source_names[i]);
6418 #undef PERL_C_BACKTRACE_STRCPY
6420 frame->source_line_number = source_lines[i];
6424 assert(total_bytes ==
6425 (UV)(sizeof(Perl_c_backtrace_header) +
6426 frame_count * sizeof(Perl_c_backtrace_frame) +
6427 name_curr - name_base));
6430 Safefree(symbol_names);
6432 bfd_close(bfd_ctx.abfd);
6435 Safefree(source_lines);
6436 Safefree(source_name_sizes);
6437 Safefree(source_names);
6438 Safefree(symbol_name_sizes);
6439 Safefree(object_name_sizes);
6440 /* Assuming the strings returned by dladdr() are pointers
6441 * to read-only static memory (the object file), so that
6442 * they do not need freeing (and cannot be). */
6444 Safefree(raw_frames);
6447 PERL_UNUSED_ARGV(depth);
6448 PERL_UNUSED_ARGV(skip);
6454 =for apidoc free_c_backtrace
6456 Deallocates a backtrace received from get_c_bracktrace.
6462 =for apidoc get_c_backtrace_dump
6464 Returns a SV containing a dump of C<depth> frames of the call stack, skipping
6465 the C<skip> innermost ones. C<depth> of 20 is usually enough.
6467 The appended output looks like:
6470 1 10e004812:0082 Perl_croak util.c:1716 /usr/bin/perl
6471 2 10df8d6d2:1d72 perl_parse perl.c:3975 /usr/bin/perl
6474 The fields are tab-separated. The first column is the depth (zero
6475 being the innermost non-skipped frame). In the hex:offset, the hex is
6476 where the program counter was in C<S_parse_body>, and the :offset (might
6477 be missing) tells how much inside the C<S_parse_body> the program counter was.
6479 The C<util.c:1716> is the source code file and line number.
6481 The F</usr/bin/perl> is obvious (hopefully).
6483 Unknowns are C<"-">. Unknowns can happen unfortunately quite easily:
6484 if the platform doesn't support retrieving the information;
6485 if the binary is missing the debug information;
6486 if the optimizer has transformed the code by for example inlining.
6492 Perl_get_c_backtrace_dump(pTHX_ int depth, int skip)
6494 Perl_c_backtrace* bt;
6496 bt = get_c_backtrace(depth, skip + 1 /* Hide ourselves. */);
6498 Perl_c_backtrace_frame* frame;
6499 SV* dsv = newSVpvs("");
6501 for (i = 0, frame = bt->frame_info;
6502 i < bt->header.frame_count; i++, frame++) {
6503 Perl_sv_catpvf(aTHX_ dsv, "%d", (int)i);
6504 Perl_sv_catpvf(aTHX_ dsv, "\t%p", frame->addr ? frame->addr : "-");
6505 /* Symbol (function) names might disappear without debug info.
6507 * The source code location might disappear in case of the
6508 * optimizer inlining or otherwise rearranging the code. */
6509 if (frame->symbol_addr) {
6510 Perl_sv_catpvf(aTHX_ dsv, ":%04x",
6512 ((char*)frame->addr - (char*)frame->symbol_addr));
6514 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6515 frame->symbol_name_size &&
6516 frame->symbol_name_offset ?
6517 (char*)bt + frame->symbol_name_offset : "-");
6518 if (frame->source_name_size &&
6519 frame->source_name_offset &&
6520 frame->source_line_number) {
6521 Perl_sv_catpvf(aTHX_ dsv, "\t%s:%" UVuf,
6522 (char*)bt + frame->source_name_offset,
6523 (UV)frame->source_line_number);
6525 Perl_sv_catpvf(aTHX_ dsv, "\t-");
6527 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6528 frame->object_name_size &&
6529 frame->object_name_offset ?
6530 (char*)bt + frame->object_name_offset : "-");
6531 /* The frame->object_base_addr is not output,
6532 * but it is used for symbolizing/symbolicating. */
6533 sv_catpvs(dsv, "\n");
6536 Perl_free_c_backtrace(bt);
6545 =for apidoc dump_c_backtrace
6547 Dumps the C backtrace to the given C<fp>.
6549 Returns true if a backtrace could be retrieved, false if not.
6555 Perl_dump_c_backtrace(pTHX_ PerlIO* fp, int depth, int skip)
6559 PERL_ARGS_ASSERT_DUMP_C_BACKTRACE;
6561 sv = Perl_get_c_backtrace_dump(aTHX_ depth, skip);
6564 PerlIO_printf(fp, "%s", SvPV_nolen(sv));
6570 #endif /* #ifdef USE_C_BACKTRACE */
6572 #ifdef PERL_TSA_ACTIVE
6574 /* pthread_mutex_t and perl_mutex are typedef equivalent
6575 * so casting the pointers is fine. */
6577 int perl_tsa_mutex_lock(perl_mutex* mutex)
6579 return pthread_mutex_lock((pthread_mutex_t *) mutex);
6582 int perl_tsa_mutex_unlock(perl_mutex* mutex)
6584 return pthread_mutex_unlock((pthread_mutex_t *) mutex);
6587 int perl_tsa_mutex_destroy(perl_mutex* mutex)
6589 return pthread_mutex_destroy((pthread_mutex_t *) mutex);
6597 /* log a sub call or return */
6600 Perl_dtrace_probe_call(pTHX_ CV *cv, bool is_call)
6608 PERL_ARGS_ASSERT_DTRACE_PROBE_CALL;
6611 HEK *hek = CvNAME_HEK(cv);
6612 func = HEK_KEY(hek);
6618 start = (const COP *)CvSTART(cv);
6619 file = CopFILE(start);
6620 line = CopLINE(start);
6621 stash = CopSTASHPV(start);
6624 PERL_SUB_ENTRY(func, file, line, stash);
6627 PERL_SUB_RETURN(func, file, line, stash);
6632 /* log a require file loading/loaded */
6635 Perl_dtrace_probe_load(pTHX_ const char *name, bool is_loading)
6637 PERL_ARGS_ASSERT_DTRACE_PROBE_LOAD;
6640 PERL_LOADING_FILE(name);
6643 PERL_LOADED_FILE(name);
6648 /* log an op execution */
6651 Perl_dtrace_probe_op(pTHX_ const OP *op)
6653 PERL_ARGS_ASSERT_DTRACE_PROBE_OP;
6655 PERL_OP_ENTRY(OP_NAME(op));
6659 /* log a compile/run phase change */
6662 Perl_dtrace_probe_phase(pTHX_ enum perl_phase phase)
6664 const char *ph_old = PL_phase_names[PL_phase];
6665 const char *ph_new = PL_phase_names[phase];
6667 PERL_PHASE_CHANGE(ph_new, ph_old);
6673 * ex: set ts=8 sts=4 sw=4 et: