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 if ((STRLEN)(bigend - big) < littlelen) {
821 && ((STRLEN)(bigend - big) == littlelen - 1)
823 || (*big == *little &&
824 memEQ((char *)big, (char *)little, littlelen - 1))))
829 switch (littlelen) { /* Special cases for 0, 1 and 2 */
831 return (char*)big; /* Cannot be SvTAIL! */
834 if (tail && !multiline) /* Anchor only! */
835 /* [-1] is safe because we know that bigend != big. */
836 return (char *) (bigend - (bigend[-1] == '\n'));
838 s = (unsigned char *)memchr((void*)big, *little, bigend-big);
842 return (char *) bigend;
846 if (tail && !multiline) {
847 /* a littlestr with SvTAIL must be of the form "X\n" (where X
848 * is a single char). It is anchored, and can only match
849 * "....X\n" or "....X" */
850 if (bigend[-2] == *little && bigend[-1] == '\n')
851 return (char*)bigend - 2;
852 if (bigend[-1] == *little)
853 return (char*)bigend - 1;
858 /* memchr() is likely to be very fast, possibly using whatever
859 * hardware support is available, such as checking a whole
860 * cache line in one instruction.
861 * So for a 2 char pattern, calling memchr() is likely to be
862 * faster than running FBM, or rolling our own. The previous
863 * version of this code was roll-your-own which typically
864 * only needed to read every 2nd char, which was good back in
865 * the day, but no longer.
867 unsigned char c1 = little[0];
868 unsigned char c2 = little[1];
870 /* *** for all this case, bigend points to the last char,
871 * not the trailing \0: this makes the conditions slightly
877 /* do a quick test for c1 before calling memchr();
878 * this avoids the expensive fn call overhead when
879 * there are lots of c1's */
880 if (LIKELY(*s != c1)) {
882 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
889 /* failed; try searching for c2 this time; that way
890 * we don't go pathologically slow when the string
891 * consists mostly of c1's or vice versa.
896 s = (unsigned char *)memchr((void*)s, c2, bigend - s + 1);
904 /* c1, c2 the same */
914 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
915 if (!s || s >= bigend)
922 /* failed to find 2 chars; try anchored match at end without
924 if (tail && bigend[0] == little[0])
925 return (char *)bigend;
930 break; /* Only lengths 0 1 and 2 have special-case code. */
933 if (tail && !multiline) { /* tail anchored? */
934 s = bigend - littlelen;
935 if (s >= big && bigend[-1] == '\n' && *s == *little
936 /* Automatically of length > 2 */
937 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
939 return (char*)s; /* how sweet it is */
942 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
944 return (char*)s + 1; /* how sweet it is */
950 /* not compiled; use Perl_ninstr() instead */
951 char * const b = ninstr((char*)big,(char*)bigend,
952 (char*)little, (char*)little + littlelen);
954 assert(!tail); /* valid => FBM; tail only set on SvVALID SVs */
959 if (littlelen > (STRLEN)(bigend - big))
963 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
964 const unsigned char *oldlittle;
968 --littlelen; /* Last char found by table lookup */
971 little += littlelen; /* last char */
974 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
975 const unsigned char lastc = *little;
979 if ((tmp = table[*s])) {
980 /* *s != lastc; earliest position it could match now is
981 * tmp slots further on */
982 if ((s += tmp) >= bigend)
984 if (LIKELY(*s != lastc)) {
986 s = (unsigned char *)memchr((void*)s, lastc, bigend - s);
996 /* hand-rolled strncmp(): less expensive than calling the
997 * real function (maybe???) */
999 unsigned char * const olds = s;
1004 if (*--s == *--little)
1006 s = olds + 1; /* here we pay the price for failure */
1008 if (s < bigend) /* fake up continue to outer loop */
1018 && memEQ((char *)(bigend - littlelen),
1019 (char *)(oldlittle - littlelen), littlelen) )
1020 return (char*)bigend - littlelen;
1025 /* copy a string to a safe spot */
1028 =head1 Memory Management
1032 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1033 string which is a duplicate of C<pv>. The size of the string is
1034 determined by C<strlen()>, which means it may not contain embedded C<NUL>
1035 characters and must have a trailing C<NUL>. The memory allocated for the new
1036 string can be freed with the C<Safefree()> function.
1038 On some platforms, Windows for example, all allocated memory owned by a thread
1039 is deallocated when that thread ends. So if you need that not to happen, you
1040 need to use the shared memory functions, such as C<L</savesharedpv>>.
1046 Perl_savepv(pTHX_ const char *pv)
1048 PERL_UNUSED_CONTEXT;
1053 const STRLEN pvlen = strlen(pv)+1;
1054 Newx(newaddr, pvlen, char);
1055 return (char*)memcpy(newaddr, pv, pvlen);
1059 /* same thing but with a known length */
1064 Perl's version of what C<strndup()> would be if it existed. Returns a
1065 pointer to a newly allocated string which is a duplicate of the first
1066 C<len> bytes from C<pv>, plus a trailing
1067 C<NUL> byte. The memory allocated for
1068 the new string can be freed with the C<Safefree()> function.
1070 On some platforms, Windows for example, all allocated memory owned by a thread
1071 is deallocated when that thread ends. So if you need that not to happen, you
1072 need to use the shared memory functions, such as C<L</savesharedpvn>>.
1078 Perl_savepvn(pTHX_ const char *pv, I32 len)
1081 PERL_UNUSED_CONTEXT;
1085 Newx(newaddr,len+1,char);
1086 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1088 /* might not be null terminated */
1089 newaddr[len] = '\0';
1090 return (char *) CopyD(pv,newaddr,len,char);
1093 return (char *) ZeroD(newaddr,len+1,char);
1098 =for apidoc savesharedpv
1100 A version of C<savepv()> which allocates the duplicate string in memory
1101 which is shared between threads.
1106 Perl_savesharedpv(pTHX_ const char *pv)
1111 PERL_UNUSED_CONTEXT;
1116 pvlen = strlen(pv)+1;
1117 newaddr = (char*)PerlMemShared_malloc(pvlen);
1121 return (char*)memcpy(newaddr, pv, pvlen);
1125 =for apidoc savesharedpvn
1127 A version of C<savepvn()> which allocates the duplicate string in memory
1128 which is shared between threads. (With the specific difference that a C<NULL>
1129 pointer is not acceptable)
1134 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1136 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1138 PERL_UNUSED_CONTEXT;
1139 /* PERL_ARGS_ASSERT_SAVESHAREDPVN; */
1144 newaddr[len] = '\0';
1145 return (char*)memcpy(newaddr, pv, len);
1149 =for apidoc savesvpv
1151 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1152 the passed in SV using C<SvPV()>
1154 On some platforms, Windows for example, all allocated memory owned by a thread
1155 is deallocated when that thread ends. So if you need that not to happen, you
1156 need to use the shared memory functions, such as C<L</savesharedsvpv>>.
1162 Perl_savesvpv(pTHX_ SV *sv)
1165 const char * const pv = SvPV_const(sv, len);
1168 PERL_ARGS_ASSERT_SAVESVPV;
1171 Newx(newaddr,len,char);
1172 return (char *) CopyD(pv,newaddr,len,char);
1176 =for apidoc savesharedsvpv
1178 A version of C<savesharedpv()> which allocates the duplicate string in
1179 memory which is shared between threads.
1185 Perl_savesharedsvpv(pTHX_ SV *sv)
1188 const char * const pv = SvPV_const(sv, len);
1190 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1192 return savesharedpvn(pv, len);
1195 /* the SV for Perl_form() and mess() is not kept in an arena */
1203 if (PL_phase != PERL_PHASE_DESTRUCT)
1204 return newSVpvs_flags("", SVs_TEMP);
1209 /* Create as PVMG now, to avoid any upgrading later */
1211 Newxz(any, 1, XPVMG);
1212 SvFLAGS(sv) = SVt_PVMG;
1213 SvANY(sv) = (void*)any;
1215 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1220 #if defined(PERL_IMPLICIT_CONTEXT)
1222 Perl_form_nocontext(const char* pat, ...)
1227 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1228 va_start(args, pat);
1229 retval = vform(pat, &args);
1233 #endif /* PERL_IMPLICIT_CONTEXT */
1236 =head1 Miscellaneous Functions
1239 Takes a sprintf-style format pattern and conventional
1240 (non-SV) arguments and returns the formatted string.
1242 (char *) Perl_form(pTHX_ const char* pat, ...)
1244 can be used any place a string (char *) is required:
1246 char * s = Perl_form("%d.%d",major,minor);
1248 Uses a single private buffer so if you want to format several strings you
1249 must explicitly copy the earlier strings away (and free the copies when you
1256 Perl_form(pTHX_ const char* pat, ...)
1260 PERL_ARGS_ASSERT_FORM;
1261 va_start(args, pat);
1262 retval = vform(pat, &args);
1268 Perl_vform(pTHX_ const char *pat, va_list *args)
1270 SV * const sv = mess_alloc();
1271 PERL_ARGS_ASSERT_VFORM;
1272 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1277 =for apidoc Am|SV *|mess|const char *pat|...
1279 Take a sprintf-style format pattern and argument list. These are used to
1280 generate a string message. If the message does not end with a newline,
1281 then it will be extended with some indication of the current location
1282 in the code, as described for L</mess_sv>.
1284 Normally, the resulting message is returned in a new mortal SV.
1285 During global destruction a single SV may be shared between uses of
1291 #if defined(PERL_IMPLICIT_CONTEXT)
1293 Perl_mess_nocontext(const char *pat, ...)
1298 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1299 va_start(args, pat);
1300 retval = vmess(pat, &args);
1304 #endif /* PERL_IMPLICIT_CONTEXT */
1307 Perl_mess(pTHX_ const char *pat, ...)
1311 PERL_ARGS_ASSERT_MESS;
1312 va_start(args, pat);
1313 retval = vmess(pat, &args);
1319 Perl_closest_cop(pTHX_ const COP *cop, const OP *o, const OP *curop,
1322 /* Look for curop starting from o. cop is the last COP we've seen. */
1323 /* opnext means that curop is actually the ->op_next of the op we are
1326 PERL_ARGS_ASSERT_CLOSEST_COP;
1328 if (!o || !curop || (
1329 opnext ? o->op_next == curop && o->op_type != OP_SCOPE : o == curop
1333 if (o->op_flags & OPf_KIDS) {
1335 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
1338 /* If the OP_NEXTSTATE has been optimised away we can still use it
1339 * the get the file and line number. */
1341 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1342 cop = (const COP *)kid;
1344 /* Keep searching, and return when we've found something. */
1346 new_cop = closest_cop(cop, kid, curop, opnext);
1352 /* Nothing found. */
1358 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1360 Expands a message, intended for the user, to include an indication of
1361 the current location in the code, if the message does not already appear
1364 C<basemsg> is the initial message or object. If it is a reference, it
1365 will be used as-is and will be the result of this function. Otherwise it
1366 is used as a string, and if it already ends with a newline, it is taken
1367 to be complete, and the result of this function will be the same string.
1368 If the message does not end with a newline, then a segment such as C<at
1369 foo.pl line 37> will be appended, and possibly other clauses indicating
1370 the current state of execution. The resulting message will end with a
1373 Normally, the resulting message is returned in a new mortal SV.
1374 During global destruction a single SV may be shared between uses of this
1375 function. If C<consume> is true, then the function is permitted (but not
1376 required) to modify and return C<basemsg> instead of allocating a new SV.
1382 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1386 #if defined(USE_C_BACKTRACE) && defined(USE_C_BACKTRACE_ON_ERROR)
1390 /* The PERL_C_BACKTRACE_ON_WARN must be an integer of one or more. */
1391 if ((ws = PerlEnv_getenv("PERL_C_BACKTRACE_ON_ERROR"))
1392 && grok_atoUV(ws, &wi, NULL)
1393 && wi <= PERL_INT_MAX
1395 Perl_dump_c_backtrace(aTHX_ Perl_debug_log, (int)wi, 1);
1400 PERL_ARGS_ASSERT_MESS_SV;
1402 if (SvROK(basemsg)) {
1408 sv_setsv(sv, basemsg);
1413 if (SvPOK(basemsg) && consume) {
1418 sv_copypv(sv, basemsg);
1421 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1423 * Try and find the file and line for PL_op. This will usually be
1424 * PL_curcop, but it might be a cop that has been optimised away. We
1425 * can try to find such a cop by searching through the optree starting
1426 * from the sibling of PL_curcop.
1431 closest_cop(PL_curcop, OpSIBLING(PL_curcop), PL_op, FALSE);
1436 Perl_sv_catpvf(aTHX_ sv, " at %s line %" IVdf,
1437 OutCopFILE(cop), (IV)CopLINE(cop));
1440 /* Seems that GvIO() can be untrustworthy during global destruction. */
1441 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1442 && IoLINES(GvIOp(PL_last_in_gv)))
1445 const bool line_mode = (RsSIMPLE(PL_rs) &&
1446 *SvPV_const(PL_rs,l) == '\n' && l == 1);
1447 Perl_sv_catpvf(aTHX_ sv, ", <%" SVf "> %s %" IVdf,
1448 SVfARG(PL_last_in_gv == PL_argvgv
1450 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1451 line_mode ? "line" : "chunk",
1452 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1454 if (PL_phase == PERL_PHASE_DESTRUCT)
1455 sv_catpvs(sv, " during global destruction");
1456 sv_catpvs(sv, ".\n");
1462 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1464 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1465 argument list, respectively. These are used to generate a string message. If
1467 message does not end with a newline, then it will be extended with
1468 some indication of the current location in the code, as described for
1471 Normally, the resulting message is returned in a new mortal SV.
1472 During global destruction a single SV may be shared between uses of
1479 Perl_vmess(pTHX_ const char *pat, va_list *args)
1481 SV * const sv = mess_alloc();
1483 PERL_ARGS_ASSERT_VMESS;
1485 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1486 return mess_sv(sv, 1);
1490 Perl_write_to_stderr(pTHX_ SV* msv)
1495 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1497 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1498 && (io = GvIO(PL_stderrgv))
1499 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1500 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, SV_CONST(PRINT),
1501 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1503 PerlIO * const serr = Perl_error_log;
1505 do_print(msv, serr);
1506 (void)PerlIO_flush(serr);
1511 =head1 Warning and Dieing
1514 /* Common code used in dieing and warning */
1517 S_with_queued_errors(pTHX_ SV *ex)
1519 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1520 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1521 sv_catsv(PL_errors, ex);
1522 ex = sv_mortalcopy(PL_errors);
1523 SvCUR_set(PL_errors, 0);
1529 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1534 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1535 /* sv_2cv might call Perl_croak() or Perl_warner() */
1536 SV * const oldhook = *hook;
1544 cv = sv_2cv(oldhook, &stash, &gv, 0);
1546 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1556 exarg = newSVsv(ex);
1557 SvREADONLY_on(exarg);
1560 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1564 call_sv(MUTABLE_SV(cv), G_DISCARD);
1573 =for apidoc Am|OP *|die_sv|SV *baseex
1575 Behaves the same as L</croak_sv>, except for the return type.
1576 It should be used only where the C<OP *> return type is required.
1577 The function never actually returns.
1583 # pragma warning( push )
1584 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1585 __declspec(noreturn) has non-void return type */
1586 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1587 __declspec(noreturn) has a return statement */
1590 Perl_die_sv(pTHX_ SV *baseex)
1592 PERL_ARGS_ASSERT_DIE_SV;
1595 NORETURN_FUNCTION_END;
1598 # pragma warning( pop )
1602 =for apidoc Am|OP *|die|const char *pat|...
1604 Behaves the same as L</croak>, except for the return type.
1605 It should be used only where the C<OP *> return type is required.
1606 The function never actually returns.
1611 #if defined(PERL_IMPLICIT_CONTEXT)
1613 # pragma warning( push )
1614 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1615 __declspec(noreturn) has non-void return type */
1616 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1617 __declspec(noreturn) has a return statement */
1620 Perl_die_nocontext(const char* pat, ...)
1624 va_start(args, pat);
1626 NOT_REACHED; /* NOTREACHED */
1628 NORETURN_FUNCTION_END;
1631 # pragma warning( pop )
1633 #endif /* PERL_IMPLICIT_CONTEXT */
1636 # pragma warning( push )
1637 # pragma warning( disable : 4646 ) /* warning C4646: function declared with
1638 __declspec(noreturn) has non-void return type */
1639 # pragma warning( disable : 4645 ) /* warning C4645: function declared with
1640 __declspec(noreturn) has a return statement */
1643 Perl_die(pTHX_ const char* pat, ...)
1646 va_start(args, pat);
1648 NOT_REACHED; /* NOTREACHED */
1650 NORETURN_FUNCTION_END;
1653 # pragma warning( pop )
1657 =for apidoc Am|void|croak_sv|SV *baseex
1659 This is an XS interface to Perl's C<die> function.
1661 C<baseex> is the error message or object. If it is a reference, it
1662 will be used as-is. Otherwise it is used as a string, and if it does
1663 not end with a newline then it will be extended with some indication of
1664 the current location in the code, as described for L</mess_sv>.
1666 The error message or object will be used as an exception, by default
1667 returning control to the nearest enclosing C<eval>, but subject to
1668 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1669 function never returns normally.
1671 To die with a simple string message, the L</croak> function may be
1678 Perl_croak_sv(pTHX_ SV *baseex)
1680 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1681 PERL_ARGS_ASSERT_CROAK_SV;
1682 invoke_exception_hook(ex, FALSE);
1687 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1689 This is an XS interface to Perl's C<die> function.
1691 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1692 argument list. These are used to generate a string message. If the
1693 message does not end with a newline, then it will be extended with
1694 some indication of the current location in the code, as described for
1697 The error message will be used as an exception, by default
1698 returning control to the nearest enclosing C<eval>, but subject to
1699 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1700 function never returns normally.
1702 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1703 (C<$@>) will be used as an error message or object instead of building an
1704 error message from arguments. If you want to throw a non-string object,
1705 or build an error message in an SV yourself, it is preferable to use
1706 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1712 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1714 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1715 invoke_exception_hook(ex, FALSE);
1720 =for apidoc Am|void|croak|const char *pat|...
1722 This is an XS interface to Perl's C<die> function.
1724 Take a sprintf-style format pattern and argument list. These are used to
1725 generate a string message. If the message does not end with a newline,
1726 then it will be extended with some indication of the current location
1727 in the code, as described for L</mess_sv>.
1729 The error message will be used as an exception, by default
1730 returning control to the nearest enclosing C<eval>, but subject to
1731 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1732 function never returns normally.
1734 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1735 (C<$@>) will be used as an error message or object instead of building an
1736 error message from arguments. If you want to throw a non-string object,
1737 or build an error message in an SV yourself, it is preferable to use
1738 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1743 #if defined(PERL_IMPLICIT_CONTEXT)
1745 Perl_croak_nocontext(const char *pat, ...)
1749 va_start(args, pat);
1751 NOT_REACHED; /* NOTREACHED */
1754 #endif /* PERL_IMPLICIT_CONTEXT */
1757 Perl_croak(pTHX_ const char *pat, ...)
1760 va_start(args, pat);
1762 NOT_REACHED; /* NOTREACHED */
1767 =for apidoc Am|void|croak_no_modify
1769 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1770 terser object code than using C<Perl_croak>. Less code used on exception code
1771 paths reduces CPU cache pressure.
1777 Perl_croak_no_modify(void)
1779 Perl_croak_nocontext( "%s", PL_no_modify);
1782 /* does not return, used in util.c perlio.c and win32.c
1783 This is typically called when malloc returns NULL.
1786 Perl_croak_no_mem(void)
1790 int fd = PerlIO_fileno(Perl_error_log);
1792 SETERRNO(EBADF,RMS_IFI);
1794 /* Can't use PerlIO to write as it allocates memory */
1795 PERL_UNUSED_RESULT(PerlLIO_write(fd, PL_no_mem, sizeof(PL_no_mem)-1));
1800 /* does not return, used only in POPSTACK */
1802 Perl_croak_popstack(void)
1805 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");
1810 =for apidoc Am|void|warn_sv|SV *baseex
1812 This is an XS interface to Perl's C<warn> function.
1814 C<baseex> is the error message or object. If it is a reference, it
1815 will be used as-is. Otherwise it is used as a string, and if it does
1816 not end with a newline then it will be extended with some indication of
1817 the current location in the code, as described for L</mess_sv>.
1819 The error message or object will by default be written to standard error,
1820 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1822 To warn with a simple string message, the L</warn> function may be
1829 Perl_warn_sv(pTHX_ SV *baseex)
1831 SV *ex = mess_sv(baseex, 0);
1832 PERL_ARGS_ASSERT_WARN_SV;
1833 if (!invoke_exception_hook(ex, TRUE))
1834 write_to_stderr(ex);
1838 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1840 This is an XS interface to Perl's C<warn> function.
1842 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1843 argument list. These are used to generate a string message. If the
1844 message does not end with a newline, then it will be extended with
1845 some indication of the current location in the code, as described for
1848 The error message or object will by default be written to standard error,
1849 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1851 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1857 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1859 SV *ex = vmess(pat, args);
1860 PERL_ARGS_ASSERT_VWARN;
1861 if (!invoke_exception_hook(ex, TRUE))
1862 write_to_stderr(ex);
1866 =for apidoc Am|void|warn|const char *pat|...
1868 This is an XS interface to Perl's C<warn> function.
1870 Take a sprintf-style format pattern and argument list. These are used to
1871 generate a string message. If the message does not end with a newline,
1872 then it will be extended with some indication of the current location
1873 in the code, as described for L</mess_sv>.
1875 The error message or object will by default be written to standard error,
1876 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1878 Unlike with L</croak>, C<pat> is not permitted to be null.
1883 #if defined(PERL_IMPLICIT_CONTEXT)
1885 Perl_warn_nocontext(const char *pat, ...)
1889 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1890 va_start(args, pat);
1894 #endif /* PERL_IMPLICIT_CONTEXT */
1897 Perl_warn(pTHX_ const char *pat, ...)
1900 PERL_ARGS_ASSERT_WARN;
1901 va_start(args, pat);
1906 #if defined(PERL_IMPLICIT_CONTEXT)
1908 Perl_warner_nocontext(U32 err, const char *pat, ...)
1912 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1913 va_start(args, pat);
1914 vwarner(err, pat, &args);
1917 #endif /* PERL_IMPLICIT_CONTEXT */
1920 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1922 PERL_ARGS_ASSERT_CK_WARNER_D;
1924 if (Perl_ckwarn_d(aTHX_ err)) {
1926 va_start(args, pat);
1927 vwarner(err, pat, &args);
1933 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1935 PERL_ARGS_ASSERT_CK_WARNER;
1937 if (Perl_ckwarn(aTHX_ err)) {
1939 va_start(args, pat);
1940 vwarner(err, pat, &args);
1946 Perl_warner(pTHX_ U32 err, const char* pat,...)
1949 PERL_ARGS_ASSERT_WARNER;
1950 va_start(args, pat);
1951 vwarner(err, pat, &args);
1956 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1959 PERL_ARGS_ASSERT_VWARNER;
1961 (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) &&
1962 !(PL_in_eval & EVAL_KEEPERR)
1964 SV * const msv = vmess(pat, args);
1966 if (PL_parser && PL_parser->error_count) {
1970 invoke_exception_hook(msv, FALSE);
1975 Perl_vwarn(aTHX_ pat, args);
1979 /* implements the ckWARN? macros */
1982 Perl_ckwarn(pTHX_ U32 w)
1984 /* If lexical warnings have not been set, use $^W. */
1986 return PL_dowarn & G_WARN_ON;
1988 return ckwarn_common(w);
1991 /* implements the ckWARN?_d macro */
1994 Perl_ckwarn_d(pTHX_ U32 w)
1996 /* If lexical warnings have not been set then default classes warn. */
2000 return ckwarn_common(w);
2004 S_ckwarn_common(pTHX_ U32 w)
2006 if (PL_curcop->cop_warnings == pWARN_ALL)
2009 if (PL_curcop->cop_warnings == pWARN_NONE)
2012 /* Check the assumption that at least the first slot is non-zero. */
2013 assert(unpackWARN1(w));
2015 /* Check the assumption that it is valid to stop as soon as a zero slot is
2017 if (!unpackWARN2(w)) {
2018 assert(!unpackWARN3(w));
2019 assert(!unpackWARN4(w));
2020 } else if (!unpackWARN3(w)) {
2021 assert(!unpackWARN4(w));
2024 /* Right, dealt with all the special cases, which are implemented as non-
2025 pointers, so there is a pointer to a real warnings mask. */
2027 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
2029 } while (w >>= WARNshift);
2034 /* Set buffer=NULL to get a new one. */
2036 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
2038 const MEM_SIZE len_wanted =
2039 sizeof(STRLEN) + (size > WARNsize ? size : WARNsize);
2040 PERL_UNUSED_CONTEXT;
2041 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
2044 (specialWARN(buffer) ?
2045 PerlMemShared_malloc(len_wanted) :
2046 PerlMemShared_realloc(buffer, len_wanted));
2048 Copy(bits, (buffer + 1), size, char);
2049 if (size < WARNsize)
2050 Zero((char *)(buffer + 1) + size, WARNsize - size, char);
2054 /* since we've already done strlen() for both nam and val
2055 * we can use that info to make things faster than
2056 * sprintf(s, "%s=%s", nam, val)
2058 #define my_setenv_format(s, nam, nlen, val, vlen) \
2059 Copy(nam, s, nlen, char); \
2061 Copy(val, s+(nlen+1), vlen, char); \
2062 *(s+(nlen+1+vlen)) = '\0'
2064 #ifdef USE_ENVIRON_ARRAY
2065 /* VMS' my_setenv() is in vms.c */
2066 #if !defined(WIN32) && !defined(NETWARE)
2068 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2072 amigaos4_obtain_environ(__FUNCTION__);
2075 /* only parent thread can modify process environment */
2076 if (PL_curinterp == aTHX)
2079 #ifndef PERL_USE_SAFE_PUTENV
2080 if (!PL_use_safe_putenv) {
2081 /* most putenv()s leak, so we manipulate environ directly */
2083 const I32 len = strlen(nam);
2086 /* where does it go? */
2087 for (i = 0; environ[i]; i++) {
2088 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
2092 if (environ == PL_origenviron) { /* need we copy environment? */
2098 while (environ[max])
2100 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
2101 for (j=0; j<max; j++) { /* copy environment */
2102 const int len = strlen(environ[j]);
2103 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
2104 Copy(environ[j], tmpenv[j], len+1, char);
2107 environ = tmpenv; /* tell exec where it is now */
2110 safesysfree(environ[i]);
2111 while (environ[i]) {
2112 environ[i] = environ[i+1];
2121 if (!environ[i]) { /* does not exist yet */
2122 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2123 environ[i+1] = NULL; /* make sure it's null terminated */
2126 safesysfree(environ[i]);
2130 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2131 /* all that work just for this */
2132 my_setenv_format(environ[i], nam, nlen, val, vlen);
2135 /* This next branch should only be called #if defined(HAS_SETENV), but
2136 Configure doesn't test for that yet. For Solaris, setenv() and unsetenv()
2137 were introduced in Solaris 9, so testing for HAS UNSETENV is sufficient.
2139 # if defined(__CYGWIN__)|| defined(__SYMBIAN32__) || defined(__riscos__) || (defined(__sun) && defined(HAS_UNSETENV)) || defined(PERL_DARWIN)
2140 # if defined(HAS_UNSETENV)
2142 (void)unsetenv(nam);
2144 (void)setenv(nam, val, 1);
2146 # else /* ! HAS_UNSETENV */
2147 (void)setenv(nam, val, 1);
2148 # endif /* HAS_UNSETENV */
2150 # if defined(HAS_UNSETENV)
2152 if (environ) /* old glibc can crash with null environ */
2153 (void)unsetenv(nam);
2155 const int nlen = strlen(nam);
2156 const int vlen = strlen(val);
2157 char * const new_env =
2158 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2159 my_setenv_format(new_env, nam, nlen, val, vlen);
2160 (void)putenv(new_env);
2162 # else /* ! HAS_UNSETENV */
2164 const int nlen = strlen(nam);
2170 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2171 /* all that work just for this */
2172 my_setenv_format(new_env, nam, nlen, val, vlen);
2173 (void)putenv(new_env);
2174 # endif /* HAS_UNSETENV */
2175 # endif /* __CYGWIN__ */
2176 #ifndef PERL_USE_SAFE_PUTENV
2182 amigaos4_release_environ(__FUNCTION__);
2186 #else /* WIN32 || NETWARE */
2189 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2193 const int nlen = strlen(nam);
2200 Newx(envstr, nlen+vlen+2, char);
2201 my_setenv_format(envstr, nam, nlen, val, vlen);
2202 (void)PerlEnv_putenv(envstr);
2206 #endif /* WIN32 || NETWARE */
2210 #ifdef UNLINK_ALL_VERSIONS
2212 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2216 PERL_ARGS_ASSERT_UNLNK;
2218 while (PerlLIO_unlink(f) >= 0)
2220 return retries ? 0 : -1;
2224 /* this is a drop-in replacement for bcopy(), except for the return
2225 * value, which we need to be able to emulate memcpy() */
2226 #if !defined(HAS_MEMCPY) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY))
2228 Perl_my_bcopy(const void *vfrom, void *vto, size_t len)
2230 #if defined(HAS_BCOPY) && defined(HAS_SAFE_BCOPY)
2231 bcopy(vfrom, vto, len);
2233 const unsigned char *from = (const unsigned char *)vfrom;
2234 unsigned char *to = (unsigned char *)vto;
2236 PERL_ARGS_ASSERT_MY_BCOPY;
2238 if (from - to >= 0) {
2246 *(--to) = *(--from);
2254 /* this is a drop-in replacement for memset() */
2257 Perl_my_memset(void *vloc, int ch, size_t len)
2259 unsigned char *loc = (unsigned char *)vloc;
2261 PERL_ARGS_ASSERT_MY_MEMSET;
2269 /* this is a drop-in replacement for bzero() */
2270 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2272 Perl_my_bzero(void *vloc, size_t len)
2274 unsigned char *loc = (unsigned char *)vloc;
2276 PERL_ARGS_ASSERT_MY_BZERO;
2284 /* this is a drop-in replacement for memcmp() */
2285 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2287 Perl_my_memcmp(const void *vs1, const void *vs2, size_t len)
2289 const U8 *a = (const U8 *)vs1;
2290 const U8 *b = (const U8 *)vs2;
2293 PERL_ARGS_ASSERT_MY_MEMCMP;
2296 if ((tmp = *a++ - *b++))
2301 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2304 /* This vsprintf replacement should generally never get used, since
2305 vsprintf was available in both System V and BSD 2.11. (There may
2306 be some cross-compilation or embedded set-ups where it is needed,
2309 If you encounter a problem in this function, it's probably a symptom
2310 that Configure failed to detect your system's vprintf() function.
2311 See the section on "item vsprintf" in the INSTALL file.
2313 This version may compile on systems with BSD-ish <stdio.h>,
2314 but probably won't on others.
2317 #ifdef USE_CHAR_VSPRINTF
2322 vsprintf(char *dest, const char *pat, void *args)
2326 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2327 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2328 FILE_cnt(&fakebuf) = 32767;
2330 /* These probably won't compile -- If you really need
2331 this, you'll have to figure out some other method. */
2332 fakebuf._ptr = dest;
2333 fakebuf._cnt = 32767;
2338 fakebuf._flag = _IOWRT|_IOSTRG;
2339 _doprnt(pat, args, &fakebuf); /* what a kludge */
2340 #if defined(STDIO_PTR_LVALUE)
2341 *(FILE_ptr(&fakebuf)++) = '\0';
2343 /* PerlIO has probably #defined away fputc, but we want it here. */
2345 # undef fputc /* XXX Should really restore it later */
2347 (void)fputc('\0', &fakebuf);
2349 #ifdef USE_CHAR_VSPRINTF
2352 return 0; /* perl doesn't use return value */
2356 #endif /* HAS_VPRINTF */
2359 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2361 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(OS2) && !defined(VMS) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2369 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2371 PERL_FLUSHALL_FOR_CHILD;
2372 This = (*mode == 'w');
2376 taint_proper("Insecure %s%s", "EXEC");
2378 if (PerlProc_pipe(p) < 0)
2380 /* Try for another pipe pair for error return */
2381 if (PerlProc_pipe(pp) >= 0)
2383 while ((pid = PerlProc_fork()) < 0) {
2384 if (errno != EAGAIN) {
2385 PerlLIO_close(p[This]);
2386 PerlLIO_close(p[that]);
2388 PerlLIO_close(pp[0]);
2389 PerlLIO_close(pp[1]);
2393 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2402 /* Close parent's end of error status pipe (if any) */
2404 PerlLIO_close(pp[0]);
2405 #if defined(HAS_FCNTL) && defined(F_SETFD) && defined(FD_CLOEXEC)
2406 /* Close error pipe automatically if exec works */
2407 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2411 /* Now dup our end of _the_ pipe to right position */
2412 if (p[THIS] != (*mode == 'r')) {
2413 PerlLIO_dup2(p[THIS], *mode == 'r');
2414 PerlLIO_close(p[THIS]);
2415 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2416 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2419 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2420 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2421 /* No automatic close - do it by hand */
2428 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2434 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2440 do_execfree(); /* free any memory malloced by child on fork */
2442 PerlLIO_close(pp[1]);
2443 /* Keep the lower of the two fd numbers */
2444 if (p[that] < p[This]) {
2445 PerlLIO_dup2(p[This], p[that]);
2446 PerlLIO_close(p[This]);
2450 PerlLIO_close(p[that]); /* close child's end of pipe */
2452 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2453 SvUPGRADE(sv,SVt_IV);
2455 PL_forkprocess = pid;
2456 /* If we managed to get status pipe check for exec fail */
2457 if (did_pipes && pid > 0) {
2461 while (n < sizeof(int)) {
2462 const SSize_t n1 = PerlLIO_read(pp[0],
2463 (void*)(((char*)&errkid)+n),
2469 PerlLIO_close(pp[0]);
2471 if (n) { /* Error */
2473 PerlLIO_close(p[This]);
2474 if (n != sizeof(int))
2475 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2477 pid2 = wait4pid(pid, &status, 0);
2478 } while (pid2 == -1 && errno == EINTR);
2479 errno = errkid; /* Propagate errno from kid */
2484 PerlLIO_close(pp[0]);
2485 return PerlIO_fdopen(p[This], mode);
2487 # if defined(OS2) /* Same, without fork()ing and all extra overhead... */
2488 return my_syspopen4(aTHX_ NULL, mode, n, args);
2489 # elif defined(WIN32)
2490 return win32_popenlist(mode, n, args);
2492 Perl_croak(aTHX_ "List form of piped open not implemented");
2493 return (PerlIO *) NULL;
2498 /* VMS' my_popen() is in VMS.c, same with OS/2 and AmigaOS 4. */
2499 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2501 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2507 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2511 PERL_ARGS_ASSERT_MY_POPEN;
2513 PERL_FLUSHALL_FOR_CHILD;
2516 return my_syspopen(aTHX_ cmd,mode);
2519 This = (*mode == 'w');
2521 if (doexec && TAINTING_get) {
2523 taint_proper("Insecure %s%s", "EXEC");
2525 if (PerlProc_pipe(p) < 0)
2527 if (doexec && PerlProc_pipe(pp) >= 0)
2529 while ((pid = PerlProc_fork()) < 0) {
2530 if (errno != EAGAIN) {
2531 PerlLIO_close(p[This]);
2532 PerlLIO_close(p[that]);
2534 PerlLIO_close(pp[0]);
2535 PerlLIO_close(pp[1]);
2538 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2541 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2551 PerlLIO_close(pp[0]);
2552 #if defined(HAS_FCNTL) && defined(F_SETFD)
2553 if (fcntl(pp[1], F_SETFD, FD_CLOEXEC) < 0)
2557 if (p[THIS] != (*mode == 'r')) {
2558 PerlLIO_dup2(p[THIS], *mode == 'r');
2559 PerlLIO_close(p[THIS]);
2560 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2561 PerlLIO_close(p[THAT]);
2564 PerlLIO_close(p[THAT]);
2567 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2574 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2579 /* may or may not use the shell */
2580 do_exec3(cmd, pp[1], did_pipes);
2583 #endif /* defined OS2 */
2585 #ifdef PERLIO_USING_CRLF
2586 /* Since we circumvent IO layers when we manipulate low-level
2587 filedescriptors directly, need to manually switch to the
2588 default, binary, low-level mode; see PerlIOBuf_open(). */
2589 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2592 #ifdef PERL_USES_PL_PIDSTATUS
2593 hv_clear(PL_pidstatus); /* we have no children */
2599 do_execfree(); /* free any memory malloced by child on vfork */
2601 PerlLIO_close(pp[1]);
2602 if (p[that] < p[This]) {
2603 PerlLIO_dup2(p[This], p[that]);
2604 PerlLIO_close(p[This]);
2608 PerlLIO_close(p[that]);
2610 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2611 SvUPGRADE(sv,SVt_IV);
2613 PL_forkprocess = pid;
2614 if (did_pipes && pid > 0) {
2618 while (n < sizeof(int)) {
2619 const SSize_t n1 = PerlLIO_read(pp[0],
2620 (void*)(((char*)&errkid)+n),
2626 PerlLIO_close(pp[0]);
2628 if (n) { /* Error */
2630 PerlLIO_close(p[This]);
2631 if (n != sizeof(int))
2632 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2634 pid2 = wait4pid(pid, &status, 0);
2635 } while (pid2 == -1 && errno == EINTR);
2636 errno = errkid; /* Propagate errno from kid */
2641 PerlLIO_close(pp[0]);
2642 return PerlIO_fdopen(p[This], mode);
2646 FILE *djgpp_popen();
2648 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2650 PERL_FLUSHALL_FOR_CHILD;
2651 /* Call system's popen() to get a FILE *, then import it.
2652 used 0 for 2nd parameter to PerlIO_importFILE;
2655 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2658 #if defined(__LIBCATAMOUNT__)
2660 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2667 #endif /* !DOSISH */
2669 /* this is called in parent before the fork() */
2671 Perl_atfork_lock(void)
2672 #if defined(USE_ITHREADS)
2674 PERL_TSA_ACQUIRE(PL_perlio_mutex)
2677 PERL_TSA_ACQUIRE(PL_malloc_mutex)
2679 PERL_TSA_ACQUIRE(PL_op_mutex)
2682 #if defined(USE_ITHREADS)
2684 /* locks must be held in locking order (if any) */
2686 MUTEX_LOCK(&PL_perlio_mutex);
2689 MUTEX_LOCK(&PL_malloc_mutex);
2695 /* this is called in both parent and child after the fork() */
2697 Perl_atfork_unlock(void)
2698 #if defined(USE_ITHREADS)
2700 PERL_TSA_RELEASE(PL_perlio_mutex)
2703 PERL_TSA_RELEASE(PL_malloc_mutex)
2705 PERL_TSA_RELEASE(PL_op_mutex)
2708 #if defined(USE_ITHREADS)
2710 /* locks must be released in same order as in atfork_lock() */
2712 MUTEX_UNLOCK(&PL_perlio_mutex);
2715 MUTEX_UNLOCK(&PL_malloc_mutex);
2724 #if defined(HAS_FORK)
2726 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2731 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2732 * handlers elsewhere in the code */
2736 #elif defined(__amigaos4__)
2737 return amigaos_fork();
2739 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2740 Perl_croak_nocontext("fork() not available");
2742 #endif /* HAS_FORK */
2747 dup2(int oldfd, int newfd)
2749 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2752 PerlLIO_close(newfd);
2753 return fcntl(oldfd, F_DUPFD, newfd);
2755 #define DUP2_MAX_FDS 256
2756 int fdtmp[DUP2_MAX_FDS];
2762 PerlLIO_close(newfd);
2763 /* good enough for low fd's... */
2764 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2765 if (fdx >= DUP2_MAX_FDS) {
2773 PerlLIO_close(fdtmp[--fdx]);
2780 #ifdef HAS_SIGACTION
2783 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2785 struct sigaction act, oact;
2789 /* only "parent" interpreter can diddle signals */
2790 if (PL_curinterp != aTHX)
2791 return (Sighandler_t) SIG_ERR;
2794 act.sa_handler = (void(*)(int))handler;
2795 sigemptyset(&act.sa_mask);
2798 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2799 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2801 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2802 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2803 act.sa_flags |= SA_NOCLDWAIT;
2805 if (sigaction(signo, &act, &oact) == -1)
2806 return (Sighandler_t) SIG_ERR;
2808 return (Sighandler_t) oact.sa_handler;
2812 Perl_rsignal_state(pTHX_ int signo)
2814 struct sigaction oact;
2815 PERL_UNUSED_CONTEXT;
2817 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2818 return (Sighandler_t) SIG_ERR;
2820 return (Sighandler_t) oact.sa_handler;
2824 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2829 struct sigaction act;
2831 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2834 /* only "parent" interpreter can diddle signals */
2835 if (PL_curinterp != aTHX)
2839 act.sa_handler = (void(*)(int))handler;
2840 sigemptyset(&act.sa_mask);
2843 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2844 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2846 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2847 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2848 act.sa_flags |= SA_NOCLDWAIT;
2850 return sigaction(signo, &act, save);
2854 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2859 PERL_UNUSED_CONTEXT;
2861 /* only "parent" interpreter can diddle signals */
2862 if (PL_curinterp != aTHX)
2866 return sigaction(signo, save, (struct sigaction *)NULL);
2869 #else /* !HAS_SIGACTION */
2872 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2874 #if defined(USE_ITHREADS) && !defined(WIN32)
2875 /* only "parent" interpreter can diddle signals */
2876 if (PL_curinterp != aTHX)
2877 return (Sighandler_t) SIG_ERR;
2880 return PerlProc_signal(signo, handler);
2891 Perl_rsignal_state(pTHX_ int signo)
2894 Sighandler_t oldsig;
2896 #if defined(USE_ITHREADS) && !defined(WIN32)
2897 /* only "parent" interpreter can diddle signals */
2898 if (PL_curinterp != aTHX)
2899 return (Sighandler_t) SIG_ERR;
2903 oldsig = PerlProc_signal(signo, sig_trap);
2904 PerlProc_signal(signo, oldsig);
2906 PerlProc_kill(PerlProc_getpid(), signo);
2911 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2913 #if defined(USE_ITHREADS) && !defined(WIN32)
2914 /* only "parent" interpreter can diddle signals */
2915 if (PL_curinterp != aTHX)
2918 *save = PerlProc_signal(signo, handler);
2919 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2923 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2925 #if defined(USE_ITHREADS) && !defined(WIN32)
2926 /* only "parent" interpreter can diddle signals */
2927 if (PL_curinterp != aTHX)
2930 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2933 #endif /* !HAS_SIGACTION */
2934 #endif /* !PERL_MICRO */
2936 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2937 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2939 Perl_my_pclose(pTHX_ PerlIO *ptr)
2947 const int fd = PerlIO_fileno(ptr);
2950 svp = av_fetch(PL_fdpid,fd,TRUE);
2951 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2955 #if defined(USE_PERLIO)
2956 /* Find out whether the refcount is low enough for us to wait for the
2957 child proc without blocking. */
2958 should_wait = PerlIOUnix_refcnt(fd) == 1 && pid > 0;
2960 should_wait = pid > 0;
2964 if (pid == -1) { /* Opened by popen. */
2965 return my_syspclose(ptr);
2968 close_failed = (PerlIO_close(ptr) == EOF);
2970 if (should_wait) do {
2971 pid2 = wait4pid(pid, &status, 0);
2972 } while (pid2 == -1 && errno == EINTR);
2979 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
2984 #if defined(__LIBCATAMOUNT__)
2986 Perl_my_pclose(pTHX_ PerlIO *ptr)
2991 #endif /* !DOSISH */
2993 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2995 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2998 PERL_ARGS_ASSERT_WAIT4PID;
2999 #ifdef PERL_USES_PL_PIDSTATUS
3001 /* PERL_USES_PL_PIDSTATUS is only defined when neither
3002 waitpid() nor wait4() is available, or on OS/2, which
3003 doesn't appear to support waiting for a progress group
3004 member, so we can only treat a 0 pid as an unknown child.
3011 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3012 pid, rather than a string form. */
3013 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3014 if (svp && *svp != &PL_sv_undef) {
3015 *statusp = SvIVX(*svp);
3016 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3024 hv_iterinit(PL_pidstatus);
3025 if ((entry = hv_iternext(PL_pidstatus))) {
3026 SV * const sv = hv_iterval(PL_pidstatus,entry);
3028 const char * const spid = hv_iterkey(entry,&len);
3030 assert (len == sizeof(Pid_t));
3031 memcpy((char *)&pid, spid, len);
3032 *statusp = SvIVX(sv);
3033 /* The hash iterator is currently on this entry, so simply
3034 calling hv_delete would trigger the lazy delete, which on
3035 aggregate does more work, because next call to hv_iterinit()
3036 would spot the flag, and have to call the delete routine,
3037 while in the meantime any new entries can't re-use that
3039 hv_iterinit(PL_pidstatus);
3040 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3047 # ifdef HAS_WAITPID_RUNTIME
3048 if (!HAS_WAITPID_RUNTIME)
3051 result = PerlProc_waitpid(pid,statusp,flags);
3054 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3055 result = wait4(pid,statusp,flags,NULL);
3058 #ifdef PERL_USES_PL_PIDSTATUS
3059 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3064 Perl_croak(aTHX_ "Can't do waitpid with flags");
3066 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3067 pidgone(result,*statusp);
3073 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3076 if (result < 0 && errno == EINTR) {
3078 errno = EINTR; /* reset in case a signal handler changed $! */
3082 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3084 #ifdef PERL_USES_PL_PIDSTATUS
3086 S_pidgone(pTHX_ Pid_t pid, int status)
3090 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3091 SvUPGRADE(sv,SVt_IV);
3092 SvIV_set(sv, status);
3100 int /* Cannot prototype with I32
3102 my_syspclose(PerlIO *ptr)
3105 Perl_my_pclose(pTHX_ PerlIO *ptr)
3108 /* Needs work for PerlIO ! */
3109 FILE * const f = PerlIO_findFILE(ptr);
3110 const I32 result = pclose(f);
3111 PerlIO_releaseFILE(ptr,f);
3119 Perl_my_pclose(pTHX_ PerlIO *ptr)
3121 /* Needs work for PerlIO ! */
3122 FILE * const f = PerlIO_findFILE(ptr);
3123 I32 result = djgpp_pclose(f);
3124 result = (result << 8) & 0xff00;
3125 PerlIO_releaseFILE(ptr,f);
3130 #define PERL_REPEATCPY_LINEAR 4
3132 Perl_repeatcpy(char *to, const char *from, I32 len, IV count)
3134 PERL_ARGS_ASSERT_REPEATCPY;
3139 croak_memory_wrap();
3142 memset(to, *from, count);
3145 IV items, linear, half;
3147 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3148 for (items = 0; items < linear; ++items) {
3149 const char *q = from;
3151 for (todo = len; todo > 0; todo--)
3156 while (items <= half) {
3157 IV size = items * len;
3158 memcpy(p, to, size);
3164 memcpy(p, to, (count - items) * len);
3170 Perl_same_dirent(pTHX_ const char *a, const char *b)
3172 char *fa = strrchr(a,'/');
3173 char *fb = strrchr(b,'/');
3176 SV * const tmpsv = sv_newmortal();
3178 PERL_ARGS_ASSERT_SAME_DIRENT;
3191 sv_setpvs(tmpsv, ".");
3193 sv_setpvn(tmpsv, a, fa - a);
3194 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3197 sv_setpvs(tmpsv, ".");
3199 sv_setpvn(tmpsv, b, fb - b);
3200 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3202 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3203 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3205 #endif /* !HAS_RENAME */
3208 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3209 const char *const *const search_ext, I32 flags)
3211 const char *xfound = NULL;
3212 char *xfailed = NULL;
3213 char tmpbuf[MAXPATHLEN];
3218 #if defined(DOSISH) && !defined(OS2)
3219 # define SEARCH_EXTS ".bat", ".cmd", NULL
3220 # define MAX_EXT_LEN 4
3223 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3224 # define MAX_EXT_LEN 4
3227 # define SEARCH_EXTS ".pl", ".com", NULL
3228 # define MAX_EXT_LEN 4
3230 /* additional extensions to try in each dir if scriptname not found */
3232 static const char *const exts[] = { SEARCH_EXTS };
3233 const char *const *const ext = search_ext ? search_ext : exts;
3234 int extidx = 0, i = 0;
3235 const char *curext = NULL;
3237 PERL_UNUSED_ARG(search_ext);
3238 # define MAX_EXT_LEN 0
3241 PERL_ARGS_ASSERT_FIND_SCRIPT;
3244 * If dosearch is true and if scriptname does not contain path
3245 * delimiters, search the PATH for scriptname.
3247 * If SEARCH_EXTS is also defined, will look for each
3248 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3249 * while searching the PATH.
3251 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3252 * proceeds as follows:
3253 * If DOSISH or VMSISH:
3254 * + look for ./scriptname{,.foo,.bar}
3255 * + search the PATH for scriptname{,.foo,.bar}
3258 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3259 * this will not look in '.' if it's not in the PATH)
3264 # ifdef ALWAYS_DEFTYPES
3265 len = strlen(scriptname);
3266 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3267 int idx = 0, deftypes = 1;
3270 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3273 int idx = 0, deftypes = 1;
3276 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3278 /* The first time through, just add SEARCH_EXTS to whatever we
3279 * already have, so we can check for default file types. */
3281 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3288 if ((strlen(tmpbuf) + strlen(scriptname)
3289 + MAX_EXT_LEN) >= sizeof tmpbuf)
3290 continue; /* don't search dir with too-long name */
3291 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3295 if (strEQ(scriptname, "-"))
3297 if (dosearch) { /* Look in '.' first. */
3298 const char *cur = scriptname;
3300 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3302 if (strEQ(ext[i++],curext)) {
3303 extidx = -1; /* already has an ext */
3308 DEBUG_p(PerlIO_printf(Perl_debug_log,
3309 "Looking for %s\n",cur));
3312 if (PerlLIO_stat(cur,&statbuf) >= 0
3313 && !S_ISDIR(statbuf.st_mode)) {
3322 if (cur == scriptname) {
3323 len = strlen(scriptname);
3324 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3326 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3329 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3330 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3335 if (dosearch && !strchr(scriptname, '/')
3337 && !strchr(scriptname, '\\')
3339 && (s = PerlEnv_getenv("PATH")))
3343 bufend = s + strlen(s);
3344 while (s < bufend) {
3348 && *s != ';'; len++, s++) {
3349 if (len < sizeof tmpbuf)
3352 if (len < sizeof tmpbuf)
3355 s = delimcpy_no_escape(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3360 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3361 continue; /* don't search dir with too-long name */
3364 && tmpbuf[len - 1] != '/'
3365 && tmpbuf[len - 1] != '\\'
3368 tmpbuf[len++] = '/';
3369 if (len == 2 && tmpbuf[0] == '.')
3371 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3375 len = strlen(tmpbuf);
3376 if (extidx > 0) /* reset after previous loop */
3380 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3381 retval = PerlLIO_stat(tmpbuf,&statbuf);
3382 if (S_ISDIR(statbuf.st_mode)) {
3386 } while ( retval < 0 /* not there */
3387 && extidx>=0 && ext[extidx] /* try an extension? */
3388 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3393 if (S_ISREG(statbuf.st_mode)
3394 && cando(S_IRUSR,TRUE,&statbuf)
3395 #if !defined(DOSISH)
3396 && cando(S_IXUSR,TRUE,&statbuf)
3400 xfound = tmpbuf; /* bingo! */
3404 xfailed = savepv(tmpbuf);
3409 if (!xfound && !seen_dot && !xfailed &&
3410 (PerlLIO_stat(scriptname,&statbuf) < 0
3411 || S_ISDIR(statbuf.st_mode)))
3413 seen_dot = 1; /* Disable message. */
3418 if (flags & 1) { /* do or die? */
3419 /* diag_listed_as: Can't execute %s */
3420 Perl_croak(aTHX_ "Can't %s %s%s%s",
3421 (xfailed ? "execute" : "find"),
3422 (xfailed ? xfailed : scriptname),
3423 (xfailed ? "" : " on PATH"),
3424 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3429 scriptname = xfound;
3431 return (scriptname ? savepv(scriptname) : NULL);
3434 #ifndef PERL_GET_CONTEXT_DEFINED
3437 Perl_get_context(void)
3439 #if defined(USE_ITHREADS)
3441 # ifdef OLD_PTHREADS_API
3443 int error = pthread_getspecific(PL_thr_key, &t)
3445 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3448 # ifdef I_MACH_CTHREADS
3449 return (void*)cthread_data(cthread_self());
3451 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3460 Perl_set_context(void *t)
3462 #if defined(USE_ITHREADS)
3465 PERL_ARGS_ASSERT_SET_CONTEXT;
3466 #if defined(USE_ITHREADS)
3467 # ifdef I_MACH_CTHREADS
3468 cthread_set_data(cthread_self(), t);
3471 const int error = pthread_setspecific(PL_thr_key, t);
3473 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3481 #endif /* !PERL_GET_CONTEXT_DEFINED */
3483 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3487 PERL_UNUSED_CONTEXT;
3493 Perl_get_op_names(pTHX)
3495 PERL_UNUSED_CONTEXT;
3496 return (char **)PL_op_name;
3500 Perl_get_op_descs(pTHX)
3502 PERL_UNUSED_CONTEXT;
3503 return (char **)PL_op_desc;
3507 Perl_get_no_modify(pTHX)
3509 PERL_UNUSED_CONTEXT;
3510 return PL_no_modify;
3514 Perl_get_opargs(pTHX)
3516 PERL_UNUSED_CONTEXT;
3517 return (U32 *)PL_opargs;
3521 Perl_get_ppaddr(pTHX)
3524 PERL_UNUSED_CONTEXT;
3525 return (PPADDR_t*)PL_ppaddr;
3528 #ifndef HAS_GETENV_LEN
3530 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3532 char * const env_trans = PerlEnv_getenv(env_elem);
3533 PERL_UNUSED_CONTEXT;
3534 PERL_ARGS_ASSERT_GETENV_LEN;
3536 *len = strlen(env_trans);
3543 Perl_get_vtbl(pTHX_ int vtbl_id)
3545 PERL_UNUSED_CONTEXT;
3547 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3548 ? NULL : (MGVTBL*)PL_magic_vtables + vtbl_id;
3552 Perl_my_fflush_all(pTHX)
3554 #if defined(USE_PERLIO) || defined(FFLUSH_NULL)
3555 return PerlIO_flush(NULL);
3557 # if defined(HAS__FWALK)
3558 extern int fflush(FILE *);
3559 /* undocumented, unprototyped, but very useful BSDism */
3560 extern void _fwalk(int (*)(FILE *));
3564 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3566 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3567 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3569 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3570 open_max = sysconf(_SC_OPEN_MAX);
3573 open_max = FOPEN_MAX;
3576 open_max = OPEN_MAX;
3587 for (i = 0; i < open_max; i++)
3588 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3589 STDIO_STREAM_ARRAY[i]._file < open_max &&
3590 STDIO_STREAM_ARRAY[i]._flag)
3591 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3595 SETERRNO(EBADF,RMS_IFI);
3602 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3604 if (ckWARN(WARN_IO)) {
3606 = gv && (isGV_with_GP(gv))
3609 const char * const direction = have == '>' ? "out" : "in";
3611 if (name && HEK_LEN(name))
3612 Perl_warner(aTHX_ packWARN(WARN_IO),
3613 "Filehandle %" HEKf " opened only for %sput",
3614 HEKfARG(name), direction);
3616 Perl_warner(aTHX_ packWARN(WARN_IO),
3617 "Filehandle opened only for %sput", direction);
3622 Perl_report_evil_fh(pTHX_ const GV *gv)
3624 const IO *io = gv ? GvIO(gv) : NULL;
3625 const PERL_BITFIELD16 op = PL_op->op_type;
3629 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3631 warn_type = WARN_CLOSED;
3635 warn_type = WARN_UNOPENED;
3638 if (ckWARN(warn_type)) {
3640 = gv && isGV_with_GP(gv) && GvENAMELEN(gv) ?
3641 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3642 const char * const pars =
3643 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3644 const char * const func =
3646 (op == OP_READLINE || op == OP_RCATLINE
3647 ? "readline" : /* "<HANDLE>" not nice */
3648 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3650 const char * const type =
3652 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3653 ? "socket" : "filehandle");
3654 const bool have_name = name && SvCUR(name);
3655 Perl_warner(aTHX_ packWARN(warn_type),
3656 "%s%s on %s %s%s%" SVf, func, pars, vile, type,
3657 have_name ? " " : "",
3658 SVfARG(have_name ? name : &PL_sv_no));
3659 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3661 aTHX_ packWARN(warn_type),
3662 "\t(Are you trying to call %s%s on dirhandle%s%" SVf "?)\n",
3663 func, pars, have_name ? " " : "",
3664 SVfARG(have_name ? name : &PL_sv_no)
3669 /* To workaround core dumps from the uninitialised tm_zone we get the
3670 * system to give us a reasonable struct to copy. This fix means that
3671 * strftime uses the tm_zone and tm_gmtoff values returned by
3672 * localtime(time()). That should give the desired result most of the
3673 * time. But probably not always!
3675 * This does not address tzname aspects of NETaa14816.
3680 # ifndef STRUCT_TM_HASZONE
3681 # define STRUCT_TM_HASZONE
3685 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3686 # ifndef HAS_TM_TM_ZONE
3687 # define HAS_TM_TM_ZONE
3692 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3694 #ifdef HAS_TM_TM_ZONE
3696 const struct tm* my_tm;
3697 PERL_UNUSED_CONTEXT;
3698 PERL_ARGS_ASSERT_INIT_TM;
3700 my_tm = localtime(&now);
3702 Copy(my_tm, ptm, 1, struct tm);
3704 PERL_UNUSED_CONTEXT;
3705 PERL_ARGS_ASSERT_INIT_TM;
3706 PERL_UNUSED_ARG(ptm);
3711 * mini_mktime - normalise struct tm values without the localtime()
3712 * semantics (and overhead) of mktime().
3715 Perl_mini_mktime(struct tm *ptm)
3719 int month, mday, year, jday;
3720 int odd_cent, odd_year;
3722 PERL_ARGS_ASSERT_MINI_MKTIME;
3724 #define DAYS_PER_YEAR 365
3725 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3726 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3727 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3728 #define SECS_PER_HOUR (60*60)
3729 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3730 /* parentheses deliberately absent on these two, otherwise they don't work */
3731 #define MONTH_TO_DAYS 153/5
3732 #define DAYS_TO_MONTH 5/153
3733 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3734 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3735 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3736 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3739 * Year/day algorithm notes:
3741 * With a suitable offset for numeric value of the month, one can find
3742 * an offset into the year by considering months to have 30.6 (153/5) days,
3743 * using integer arithmetic (i.e., with truncation). To avoid too much
3744 * messing about with leap days, we consider January and February to be
3745 * the 13th and 14th month of the previous year. After that transformation,
3746 * we need the month index we use to be high by 1 from 'normal human' usage,
3747 * so the month index values we use run from 4 through 15.
3749 * Given that, and the rules for the Gregorian calendar (leap years are those
3750 * divisible by 4 unless also divisible by 100, when they must be divisible
3751 * by 400 instead), we can simply calculate the number of days since some
3752 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3753 * the days we derive from our month index, and adding in the day of the
3754 * month. The value used here is not adjusted for the actual origin which
3755 * it normally would use (1 January A.D. 1), since we're not exposing it.
3756 * We're only building the value so we can turn around and get the
3757 * normalised values for the year, month, day-of-month, and day-of-year.
3759 * For going backward, we need to bias the value we're using so that we find
3760 * the right year value. (Basically, we don't want the contribution of
3761 * March 1st to the number to apply while deriving the year). Having done
3762 * that, we 'count up' the contribution to the year number by accounting for
3763 * full quadracenturies (400-year periods) with their extra leap days, plus
3764 * the contribution from full centuries (to avoid counting in the lost leap
3765 * days), plus the contribution from full quad-years (to count in the normal
3766 * leap days), plus the leftover contribution from any non-leap years.
3767 * At this point, if we were working with an actual leap day, we'll have 0
3768 * days left over. This is also true for March 1st, however. So, we have
3769 * to special-case that result, and (earlier) keep track of the 'odd'
3770 * century and year contributions. If we got 4 extra centuries in a qcent,
3771 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3772 * Otherwise, we add back in the earlier bias we removed (the 123 from
3773 * figuring in March 1st), find the month index (integer division by 30.6),
3774 * and the remainder is the day-of-month. We then have to convert back to
3775 * 'real' months (including fixing January and February from being 14/15 in
3776 * the previous year to being in the proper year). After that, to get
3777 * tm_yday, we work with the normalised year and get a new yearday value for
3778 * January 1st, which we subtract from the yearday value we had earlier,
3779 * representing the date we've re-built. This is done from January 1
3780 * because tm_yday is 0-origin.
3782 * Since POSIX time routines are only guaranteed to work for times since the
3783 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3784 * applies Gregorian calendar rules even to dates before the 16th century
3785 * doesn't bother me. Besides, you'd need cultural context for a given
3786 * date to know whether it was Julian or Gregorian calendar, and that's
3787 * outside the scope for this routine. Since we convert back based on the
3788 * same rules we used to build the yearday, you'll only get strange results
3789 * for input which needed normalising, or for the 'odd' century years which
3790 * were leap years in the Julian calendar but not in the Gregorian one.
3791 * I can live with that.
3793 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3794 * that's still outside the scope for POSIX time manipulation, so I don't
3798 year = 1900 + ptm->tm_year;
3799 month = ptm->tm_mon;
3800 mday = ptm->tm_mday;
3806 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3807 yearday += month*MONTH_TO_DAYS + mday + jday;
3809 * Note that we don't know when leap-seconds were or will be,
3810 * so we have to trust the user if we get something which looks
3811 * like a sensible leap-second. Wild values for seconds will
3812 * be rationalised, however.
3814 if ((unsigned) ptm->tm_sec <= 60) {
3821 secs += 60 * ptm->tm_min;
3822 secs += SECS_PER_HOUR * ptm->tm_hour;
3824 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3825 /* got negative remainder, but need positive time */
3826 /* back off an extra day to compensate */
3827 yearday += (secs/SECS_PER_DAY)-1;
3828 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3831 yearday += (secs/SECS_PER_DAY);
3832 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3835 else if (secs >= SECS_PER_DAY) {
3836 yearday += (secs/SECS_PER_DAY);
3837 secs %= SECS_PER_DAY;
3839 ptm->tm_hour = secs/SECS_PER_HOUR;
3840 secs %= SECS_PER_HOUR;
3841 ptm->tm_min = secs/60;
3843 ptm->tm_sec += secs;
3844 /* done with time of day effects */
3846 * The algorithm for yearday has (so far) left it high by 428.
3847 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3848 * bias it by 123 while trying to figure out what year it
3849 * really represents. Even with this tweak, the reverse
3850 * translation fails for years before A.D. 0001.
3851 * It would still fail for Feb 29, but we catch that one below.
3853 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3854 yearday -= YEAR_ADJUST;
3855 year = (yearday / DAYS_PER_QCENT) * 400;
3856 yearday %= DAYS_PER_QCENT;
3857 odd_cent = yearday / DAYS_PER_CENT;
3858 year += odd_cent * 100;
3859 yearday %= DAYS_PER_CENT;
3860 year += (yearday / DAYS_PER_QYEAR) * 4;
3861 yearday %= DAYS_PER_QYEAR;
3862 odd_year = yearday / DAYS_PER_YEAR;
3864 yearday %= DAYS_PER_YEAR;
3865 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3870 yearday += YEAR_ADJUST; /* recover March 1st crock */
3871 month = yearday*DAYS_TO_MONTH;
3872 yearday -= month*MONTH_TO_DAYS;
3873 /* recover other leap-year adjustment */
3882 ptm->tm_year = year - 1900;
3884 ptm->tm_mday = yearday;
3885 ptm->tm_mon = month;
3889 ptm->tm_mon = month - 1;
3891 /* re-build yearday based on Jan 1 to get tm_yday */
3893 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3894 yearday += 14*MONTH_TO_DAYS + 1;
3895 ptm->tm_yday = jday - yearday;
3896 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3900 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)
3904 /* Note that yday and wday effectively are ignored by this function, as mini_mktime() overwrites them */
3911 PERL_ARGS_ASSERT_MY_STRFTIME;
3913 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3916 mytm.tm_hour = hour;
3917 mytm.tm_mday = mday;
3919 mytm.tm_year = year;
3920 mytm.tm_wday = wday;
3921 mytm.tm_yday = yday;
3922 mytm.tm_isdst = isdst;
3924 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3925 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3930 #ifdef HAS_TM_TM_GMTOFF
3931 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3933 #ifdef HAS_TM_TM_ZONE
3934 mytm.tm_zone = mytm2.tm_zone;
3939 Newx(buf, buflen, char);
3941 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3942 len = strftime(buf, buflen, fmt, &mytm);
3946 ** The following is needed to handle to the situation where
3947 ** tmpbuf overflows. Basically we want to allocate a buffer
3948 ** and try repeatedly. The reason why it is so complicated
3949 ** is that getting a return value of 0 from strftime can indicate
3950 ** one of the following:
3951 ** 1. buffer overflowed,
3952 ** 2. illegal conversion specifier, or
3953 ** 3. the format string specifies nothing to be returned(not
3954 ** an error). This could be because format is an empty string
3955 ** or it specifies %p that yields an empty string in some locale.
3956 ** If there is a better way to make it portable, go ahead by
3959 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3962 /* Possibly buf overflowed - try again with a bigger buf */
3963 const int fmtlen = strlen(fmt);
3964 int bufsize = fmtlen + buflen;
3966 Renew(buf, bufsize, char);
3969 GCC_DIAG_IGNORE(-Wformat-nonliteral); /* fmt checked by caller */
3970 buflen = strftime(buf, bufsize, fmt, &mytm);
3973 if (buflen > 0 && buflen < bufsize)
3975 /* heuristic to prevent out-of-memory errors */
3976 if (bufsize > 100*fmtlen) {
3982 Renew(buf, bufsize, char);
3987 Perl_croak(aTHX_ "panic: no strftime");
3993 #define SV_CWD_RETURN_UNDEF \
3997 #define SV_CWD_ISDOT(dp) \
3998 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3999 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4002 =head1 Miscellaneous Functions
4004 =for apidoc getcwd_sv
4006 Fill C<sv> with current working directory
4011 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4012 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4013 * getcwd(3) if available
4014 * Comments from the original:
4015 * This is a faster version of getcwd. It's also more dangerous
4016 * because you might chdir out of a directory that you can't chdir
4020 Perl_getcwd_sv(pTHX_ SV *sv)
4025 PERL_ARGS_ASSERT_GETCWD_SV;
4029 char buf[MAXPATHLEN];
4031 /* Some getcwd()s automatically allocate a buffer of the given
4032 * size from the heap if they are given a NULL buffer pointer.
4033 * The problem is that this behaviour is not portable. */
4034 if (getcwd(buf, sizeof(buf) - 1)) {
4039 SV_CWD_RETURN_UNDEF;
4046 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4050 SvUPGRADE(sv, SVt_PV);
4052 if (PerlLIO_lstat(".", &statbuf) < 0) {
4053 SV_CWD_RETURN_UNDEF;
4056 orig_cdev = statbuf.st_dev;
4057 orig_cino = statbuf.st_ino;
4067 if (PerlDir_chdir("..") < 0) {
4068 SV_CWD_RETURN_UNDEF;
4070 if (PerlLIO_stat(".", &statbuf) < 0) {
4071 SV_CWD_RETURN_UNDEF;
4074 cdev = statbuf.st_dev;
4075 cino = statbuf.st_ino;
4077 if (odev == cdev && oino == cino) {
4080 if (!(dir = PerlDir_open("."))) {
4081 SV_CWD_RETURN_UNDEF;
4084 while ((dp = PerlDir_read(dir)) != NULL) {
4086 namelen = dp->d_namlen;
4088 namelen = strlen(dp->d_name);
4091 if (SV_CWD_ISDOT(dp)) {
4095 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4096 SV_CWD_RETURN_UNDEF;
4099 tdev = statbuf.st_dev;
4100 tino = statbuf.st_ino;
4101 if (tino == oino && tdev == odev) {
4107 SV_CWD_RETURN_UNDEF;
4110 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4111 SV_CWD_RETURN_UNDEF;
4114 SvGROW(sv, pathlen + namelen + 1);
4118 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4121 /* prepend current directory to the front */
4123 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4124 pathlen += (namelen + 1);
4126 #ifdef VOID_CLOSEDIR
4129 if (PerlDir_close(dir) < 0) {
4130 SV_CWD_RETURN_UNDEF;
4136 SvCUR_set(sv, pathlen);
4140 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4141 SV_CWD_RETURN_UNDEF;
4144 if (PerlLIO_stat(".", &statbuf) < 0) {
4145 SV_CWD_RETURN_UNDEF;
4148 cdev = statbuf.st_dev;
4149 cino = statbuf.st_ino;
4151 if (cdev != orig_cdev || cino != orig_cino) {
4152 Perl_croak(aTHX_ "Unstable directory path, "
4153 "current directory changed unexpectedly");
4166 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4167 # define EMULATE_SOCKETPAIR_UDP
4170 #ifdef EMULATE_SOCKETPAIR_UDP
4172 S_socketpair_udp (int fd[2]) {
4174 /* Fake a datagram socketpair using UDP to localhost. */
4175 int sockets[2] = {-1, -1};
4176 struct sockaddr_in addresses[2];
4178 Sock_size_t size = sizeof(struct sockaddr_in);
4179 unsigned short port;
4182 memset(&addresses, 0, sizeof(addresses));
4185 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4186 if (sockets[i] == -1)
4187 goto tidy_up_and_fail;
4189 addresses[i].sin_family = AF_INET;
4190 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4191 addresses[i].sin_port = 0; /* kernel choses port. */
4192 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4193 sizeof(struct sockaddr_in)) == -1)
4194 goto tidy_up_and_fail;
4197 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4198 for each connect the other socket to it. */
4201 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4203 goto tidy_up_and_fail;
4204 if (size != sizeof(struct sockaddr_in))
4205 goto abort_tidy_up_and_fail;
4206 /* !1 is 0, !0 is 1 */
4207 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4208 sizeof(struct sockaddr_in)) == -1)
4209 goto tidy_up_and_fail;
4212 /* Now we have 2 sockets connected to each other. I don't trust some other
4213 process not to have already sent a packet to us (by random) so send
4214 a packet from each to the other. */
4217 /* I'm going to send my own port number. As a short.
4218 (Who knows if someone somewhere has sin_port as a bitfield and needs
4219 this routine. (I'm assuming crays have socketpair)) */
4220 port = addresses[i].sin_port;
4221 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4222 if (got != sizeof(port)) {
4224 goto tidy_up_and_fail;
4225 goto abort_tidy_up_and_fail;
4229 /* Packets sent. I don't trust them to have arrived though.
4230 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4231 connect to localhost will use a second kernel thread. In 2.6 the
4232 first thread running the connect() returns before the second completes,
4233 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4234 returns 0. Poor programs have tripped up. One poor program's authors'
4235 had a 50-1 reverse stock split. Not sure how connected these were.)
4236 So I don't trust someone not to have an unpredictable UDP stack.
4240 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4241 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4245 FD_SET((unsigned int)sockets[0], &rset);
4246 FD_SET((unsigned int)sockets[1], &rset);
4248 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4249 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4250 || !FD_ISSET(sockets[1], &rset)) {
4251 /* I hope this is portable and appropriate. */
4253 goto tidy_up_and_fail;
4254 goto abort_tidy_up_and_fail;
4258 /* And the paranoia department even now doesn't trust it to have arrive
4259 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4261 struct sockaddr_in readfrom;
4262 unsigned short buffer[2];
4267 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4268 sizeof(buffer), MSG_DONTWAIT,
4269 (struct sockaddr *) &readfrom, &size);
4271 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4273 (struct sockaddr *) &readfrom, &size);
4277 goto tidy_up_and_fail;
4278 if (got != sizeof(port)
4279 || size != sizeof(struct sockaddr_in)
4280 /* Check other socket sent us its port. */
4281 || buffer[0] != (unsigned short) addresses[!i].sin_port
4282 /* Check kernel says we got the datagram from that socket */
4283 || readfrom.sin_family != addresses[!i].sin_family
4284 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4285 || readfrom.sin_port != addresses[!i].sin_port)
4286 goto abort_tidy_up_and_fail;
4289 /* My caller (my_socketpair) has validated that this is non-NULL */
4292 /* I hereby declare this connection open. May God bless all who cross
4296 abort_tidy_up_and_fail:
4297 errno = ECONNABORTED;
4301 if (sockets[0] != -1)
4302 PerlLIO_close(sockets[0]);
4303 if (sockets[1] != -1)
4304 PerlLIO_close(sockets[1]);
4309 #endif /* EMULATE_SOCKETPAIR_UDP */
4311 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4313 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4314 /* Stevens says that family must be AF_LOCAL, protocol 0.
4315 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4320 struct sockaddr_in listen_addr;
4321 struct sockaddr_in connect_addr;
4326 || family != AF_UNIX
4329 errno = EAFNOSUPPORT;
4337 #ifdef EMULATE_SOCKETPAIR_UDP
4338 if (type == SOCK_DGRAM)
4339 return S_socketpair_udp(fd);
4342 aTHXa(PERL_GET_THX);
4343 listener = PerlSock_socket(AF_INET, type, 0);
4346 memset(&listen_addr, 0, sizeof(listen_addr));
4347 listen_addr.sin_family = AF_INET;
4348 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4349 listen_addr.sin_port = 0; /* kernel choses port. */
4350 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4351 sizeof(listen_addr)) == -1)
4352 goto tidy_up_and_fail;
4353 if (PerlSock_listen(listener, 1) == -1)
4354 goto tidy_up_and_fail;
4356 connector = PerlSock_socket(AF_INET, type, 0);
4357 if (connector == -1)
4358 goto tidy_up_and_fail;
4359 /* We want to find out the port number to connect to. */
4360 size = sizeof(connect_addr);
4361 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4363 goto tidy_up_and_fail;
4364 if (size != sizeof(connect_addr))
4365 goto abort_tidy_up_and_fail;
4366 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4367 sizeof(connect_addr)) == -1)
4368 goto tidy_up_and_fail;
4370 size = sizeof(listen_addr);
4371 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4374 goto tidy_up_and_fail;
4375 if (size != sizeof(listen_addr))
4376 goto abort_tidy_up_and_fail;
4377 PerlLIO_close(listener);
4378 /* Now check we are talking to ourself by matching port and host on the
4380 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4382 goto tidy_up_and_fail;
4383 if (size != sizeof(connect_addr)
4384 || listen_addr.sin_family != connect_addr.sin_family
4385 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4386 || listen_addr.sin_port != connect_addr.sin_port) {
4387 goto abort_tidy_up_and_fail;
4393 abort_tidy_up_and_fail:
4395 errno = ECONNABORTED; /* This would be the standard thing to do. */
4397 # ifdef ECONNREFUSED
4398 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4400 errno = ETIMEDOUT; /* Desperation time. */
4407 PerlLIO_close(listener);
4408 if (connector != -1)
4409 PerlLIO_close(connector);
4411 PerlLIO_close(acceptor);
4417 /* In any case have a stub so that there's code corresponding
4418 * to the my_socketpair in embed.fnc. */
4420 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4421 #ifdef HAS_SOCKETPAIR
4422 return socketpair(family, type, protocol, fd);
4431 =for apidoc sv_nosharing
4433 Dummy routine which "shares" an SV when there is no sharing module present.
4434 Or "locks" it. Or "unlocks" it. In other
4435 words, ignores its single SV argument.
4436 Exists to avoid test for a C<NULL> function pointer and because it could
4437 potentially warn under some level of strict-ness.
4443 Perl_sv_nosharing(pTHX_ SV *sv)
4445 PERL_UNUSED_CONTEXT;
4446 PERL_UNUSED_ARG(sv);
4451 =for apidoc sv_destroyable
4453 Dummy routine which reports that object can be destroyed when there is no
4454 sharing module present. It ignores its single SV argument, and returns
4455 'true'. Exists to avoid test for a C<NULL> function pointer and because it
4456 could potentially warn under some level of strict-ness.
4462 Perl_sv_destroyable(pTHX_ SV *sv)
4464 PERL_UNUSED_CONTEXT;
4465 PERL_UNUSED_ARG(sv);
4470 Perl_parse_unicode_opts(pTHX_ const char **popt)
4472 const char *p = *popt;
4475 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
4481 if (grok_atoUV(p, &uv, &endptr) && uv <= U32_MAX) {
4484 if (p && *p && *p != '\n' && *p != '\r') {
4486 goto the_end_of_the_opts_parser;
4488 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4492 Perl_croak(aTHX_ "Invalid number '%s' for -C option.\n", p);
4498 case PERL_UNICODE_STDIN:
4499 opt |= PERL_UNICODE_STDIN_FLAG; break;
4500 case PERL_UNICODE_STDOUT:
4501 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4502 case PERL_UNICODE_STDERR:
4503 opt |= PERL_UNICODE_STDERR_FLAG; break;
4504 case PERL_UNICODE_STD:
4505 opt |= PERL_UNICODE_STD_FLAG; break;
4506 case PERL_UNICODE_IN:
4507 opt |= PERL_UNICODE_IN_FLAG; break;
4508 case PERL_UNICODE_OUT:
4509 opt |= PERL_UNICODE_OUT_FLAG; break;
4510 case PERL_UNICODE_INOUT:
4511 opt |= PERL_UNICODE_INOUT_FLAG; break;
4512 case PERL_UNICODE_LOCALE:
4513 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4514 case PERL_UNICODE_ARGV:
4515 opt |= PERL_UNICODE_ARGV_FLAG; break;
4516 case PERL_UNICODE_UTF8CACHEASSERT:
4517 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4519 if (*p != '\n' && *p != '\r') {
4520 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
4523 "Unknown Unicode option letter '%c'", *p);
4530 opt = PERL_UNICODE_DEFAULT_FLAGS;
4532 the_end_of_the_opts_parser:
4534 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4535 Perl_croak(aTHX_ "Unknown Unicode option value %" UVuf,
4536 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4544 # include <starlet.h>
4551 * This is really just a quick hack which grabs various garbage
4552 * values. It really should be a real hash algorithm which
4553 * spreads the effect of every input bit onto every output bit,
4554 * if someone who knows about such things would bother to write it.
4555 * Might be a good idea to add that function to CORE as well.
4556 * No numbers below come from careful analysis or anything here,
4557 * except they are primes and SEED_C1 > 1E6 to get a full-width
4558 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4559 * probably be bigger too.
4562 # define SEED_C1 1000003
4563 #define SEED_C4 73819
4565 # define SEED_C1 25747
4566 #define SEED_C4 20639
4570 #define SEED_C5 26107
4572 #ifndef PERL_NO_DEV_RANDOM
4576 #ifdef HAS_GETTIMEOFDAY
4577 struct timeval when;
4582 /* This test is an escape hatch, this symbol isn't set by Configure. */
4583 #ifndef PERL_NO_DEV_RANDOM
4584 #ifndef PERL_RANDOM_DEVICE
4585 /* /dev/random isn't used by default because reads from it will block
4586 * if there isn't enough entropy available. You can compile with
4587 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4588 * is enough real entropy to fill the seed. */
4589 # ifdef __amigaos4__
4590 # define PERL_RANDOM_DEVICE "RANDOM:SIZE=4"
4592 # define PERL_RANDOM_DEVICE "/dev/urandom"
4595 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4597 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4605 #ifdef HAS_GETTIMEOFDAY
4606 PerlProc_gettimeofday(&when,NULL);
4607 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4610 u = (U32)SEED_C1 * when;
4612 u += SEED_C3 * (U32)PerlProc_getpid();
4613 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4614 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4615 u += SEED_C5 * (U32)PTR2UV(&when);
4621 Perl_get_hash_seed(pTHX_ unsigned char * const seed_buffer)
4623 #ifndef NO_PERL_HASH_ENV
4628 PERL_ARGS_ASSERT_GET_HASH_SEED;
4630 #ifndef NO_PERL_HASH_ENV
4631 env_pv= PerlEnv_getenv("PERL_HASH_SEED");
4635 /* ignore leading spaces */
4636 while (isSPACE(*env_pv))
4638 # ifdef USE_PERL_PERTURB_KEYS
4639 /* if they set it to "0" we disable key traversal randomization completely */
4640 if (strEQ(env_pv,"0")) {
4641 PL_hash_rand_bits_enabled= 0;
4643 /* otherwise switch to deterministic mode */
4644 PL_hash_rand_bits_enabled= 2;
4647 /* ignore a leading 0x... if it is there */
4648 if (env_pv[0] == '0' && env_pv[1] == 'x')
4651 for( i = 0; isXDIGIT(*env_pv) && i < PERL_HASH_SEED_BYTES; i++ ) {
4652 seed_buffer[i] = READ_XDIGIT(env_pv) << 4;
4653 if ( isXDIGIT(*env_pv)) {
4654 seed_buffer[i] |= READ_XDIGIT(env_pv);
4657 while (isSPACE(*env_pv))
4660 if (*env_pv && !isXDIGIT(*env_pv)) {
4661 Perl_warn(aTHX_ "perl: warning: Non hex character in '$ENV{PERL_HASH_SEED}', seed only partially set\n");
4663 /* should we check for unparsed crap? */
4664 /* should we warn about unused hex? */
4665 /* should we warn about insufficient hex? */
4668 #endif /* NO_PERL_HASH_ENV */
4670 (void)seedDrand01((Rand_seed_t)seed());
4672 for( i = 0; i < PERL_HASH_SEED_BYTES; i++ ) {
4673 seed_buffer[i] = (unsigned char)(Drand01() * (U8_MAX+1));
4676 #ifdef USE_PERL_PERTURB_KEYS
4677 { /* initialize PL_hash_rand_bits from the hash seed.
4678 * This value is highly volatile, it is updated every
4679 * hash insert, and is used as part of hash bucket chain
4680 * randomization and hash iterator randomization. */
4681 PL_hash_rand_bits= 0xbe49d17f; /* I just picked a number */
4682 for( i = 0; i < sizeof(UV) ; i++ ) {
4683 PL_hash_rand_bits += seed_buffer[i % PERL_HASH_SEED_BYTES];
4684 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,8);
4687 # ifndef NO_PERL_HASH_ENV
4688 env_pv= PerlEnv_getenv("PERL_PERTURB_KEYS");
4690 if (strEQ(env_pv,"0") || strEQ(env_pv,"NO")) {
4691 PL_hash_rand_bits_enabled= 0;
4692 } else if (strEQ(env_pv,"1") || strEQ(env_pv,"RANDOM")) {
4693 PL_hash_rand_bits_enabled= 1;
4694 } else if (strEQ(env_pv,"2") || strEQ(env_pv,"DETERMINISTIC")) {
4695 PL_hash_rand_bits_enabled= 2;
4697 Perl_warn(aTHX_ "perl: warning: strange setting in '$ENV{PERL_PERTURB_KEYS}': '%s'\n", env_pv);
4704 #ifdef PERL_GLOBAL_STRUCT
4706 #define PERL_GLOBAL_STRUCT_INIT
4707 #include "opcode.h" /* the ppaddr and check */
4710 Perl_init_global_struct(pTHX)
4712 struct perl_vars *plvarsp = NULL;
4713 # ifdef PERL_GLOBAL_STRUCT
4714 const IV nppaddr = C_ARRAY_LENGTH(Gppaddr);
4715 const IV ncheck = C_ARRAY_LENGTH(Gcheck);
4716 PERL_UNUSED_CONTEXT;
4717 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4718 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4719 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4723 plvarsp = PL_VarsPtr;
4724 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4729 # define PERLVAR(prefix,var,type) /**/
4730 # define PERLVARA(prefix,var,n,type) /**/
4731 # define PERLVARI(prefix,var,type,init) plvarsp->prefix##var = init;
4732 # define PERLVARIC(prefix,var,type,init) plvarsp->prefix##var = init;
4733 # include "perlvars.h"
4738 # ifdef PERL_GLOBAL_STRUCT
4741 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4742 if (!plvarsp->Gppaddr)
4746 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4747 if (!plvarsp->Gcheck)
4749 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4750 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4752 # ifdef PERL_SET_VARS
4753 PERL_SET_VARS(plvarsp);
4755 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4756 plvarsp->Gsv_placeholder.sv_flags = 0;
4757 memset(plvarsp->Ghash_seed, 0, sizeof(plvarsp->Ghash_seed));
4759 # undef PERL_GLOBAL_STRUCT_INIT
4764 #endif /* PERL_GLOBAL_STRUCT */
4766 #ifdef PERL_GLOBAL_STRUCT
4769 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4771 int veto = plvarsp->Gveto_cleanup;
4773 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
4774 PERL_UNUSED_CONTEXT;
4775 # ifdef PERL_GLOBAL_STRUCT
4776 # ifdef PERL_UNSET_VARS
4777 PERL_UNSET_VARS(plvarsp);
4781 free(plvarsp->Gppaddr);
4782 free(plvarsp->Gcheck);
4783 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4789 #endif /* PERL_GLOBAL_STRUCT */
4793 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including
4794 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
4795 * given, and you supply your own implementation.
4797 * The default implementation reads a single env var, PERL_MEM_LOG,
4798 * expecting one or more of the following:
4800 * \d+ - fd fd to write to : must be 1st (grok_atoUV)
4801 * 'm' - memlog was PERL_MEM_LOG=1
4802 * 's' - svlog was PERL_SV_LOG=1
4803 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
4805 * This makes the logger controllable enough that it can reasonably be
4806 * added to the system perl.
4809 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
4810 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
4812 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
4814 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
4815 * writes to. In the default logger, this is settable at runtime.
4817 #ifndef PERL_MEM_LOG_FD
4818 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
4821 #ifndef PERL_MEM_LOG_NOIMPL
4823 # ifdef DEBUG_LEAKING_SCALARS
4824 # define SV_LOG_SERIAL_FMT " [%lu]"
4825 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
4827 # define SV_LOG_SERIAL_FMT
4828 # define _SV_LOG_SERIAL_ARG(sv)
4832 S_mem_log_common(enum mem_log_type mlt, const UV n,
4833 const UV typesize, const char *type_name, const SV *sv,
4834 Malloc_t oldalloc, Malloc_t newalloc,
4835 const char *filename, const int linenumber,
4836 const char *funcname)
4840 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
4842 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
4845 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
4847 /* We can't use SVs or PerlIO for obvious reasons,
4848 * so we'll use stdio and low-level IO instead. */
4849 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
4851 # ifdef HAS_GETTIMEOFDAY
4852 # define MEM_LOG_TIME_FMT "%10d.%06d: "
4853 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
4855 gettimeofday(&tv, 0);
4857 # define MEM_LOG_TIME_FMT "%10d: "
4858 # define MEM_LOG_TIME_ARG (int)when
4862 /* If there are other OS specific ways of hires time than
4863 * gettimeofday() (see dist/Time-HiRes), the easiest way is
4864 * probably that they would be used to fill in the struct
4871 if (grok_atoUV(pmlenv, &uv, &endptr) /* Ignore endptr. */
4872 && uv && uv <= PERL_INT_MAX
4876 fd = PERL_MEM_LOG_FD;
4879 if (strchr(pmlenv, 't')) {
4880 len = my_snprintf(buf, sizeof(buf),
4881 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
4882 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4886 len = my_snprintf(buf, sizeof(buf),
4887 "alloc: %s:%d:%s: %" IVdf " %" UVuf
4888 " %s = %" IVdf ": %" UVxf "\n",
4889 filename, linenumber, funcname, n, typesize,
4890 type_name, n * typesize, PTR2UV(newalloc));
4893 len = my_snprintf(buf, sizeof(buf),
4894 "realloc: %s:%d:%s: %" IVdf " %" UVuf
4895 " %s = %" IVdf ": %" UVxf " -> %" UVxf "\n",
4896 filename, linenumber, funcname, n, typesize,
4897 type_name, n * typesize, PTR2UV(oldalloc),
4901 len = my_snprintf(buf, sizeof(buf),
4902 "free: %s:%d:%s: %" UVxf "\n",
4903 filename, linenumber, funcname,
4908 len = my_snprintf(buf, sizeof(buf),
4909 "%s_SV: %s:%d:%s: %" UVxf SV_LOG_SERIAL_FMT "\n",
4910 mlt == MLT_NEW_SV ? "new" : "del",
4911 filename, linenumber, funcname,
4912 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
4917 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4921 #endif /* !PERL_MEM_LOG_NOIMPL */
4923 #ifndef PERL_MEM_LOG_NOIMPL
4925 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
4926 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
4928 /* this is suboptimal, but bug compatible. User is providing their
4929 own implementation, but is getting these functions anyway, and they
4930 do nothing. But _NOIMPL users should be able to cope or fix */
4932 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
4933 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
4937 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
4939 const char *filename, const int linenumber,
4940 const char *funcname)
4942 PERL_ARGS_ASSERT_MEM_LOG_ALLOC;
4944 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
4945 NULL, NULL, newalloc,
4946 filename, linenumber, funcname);
4951 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
4952 Malloc_t oldalloc, Malloc_t newalloc,
4953 const char *filename, const int linenumber,
4954 const char *funcname)
4956 PERL_ARGS_ASSERT_MEM_LOG_REALLOC;
4958 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
4959 NULL, oldalloc, newalloc,
4960 filename, linenumber, funcname);
4965 Perl_mem_log_free(Malloc_t oldalloc,
4966 const char *filename, const int linenumber,
4967 const char *funcname)
4969 PERL_ARGS_ASSERT_MEM_LOG_FREE;
4971 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
4972 filename, linenumber, funcname);
4977 Perl_mem_log_new_sv(const SV *sv,
4978 const char *filename, const int linenumber,
4979 const char *funcname)
4981 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
4982 filename, linenumber, funcname);
4986 Perl_mem_log_del_sv(const SV *sv,
4987 const char *filename, const int linenumber,
4988 const char *funcname)
4990 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
4991 filename, linenumber, funcname);
4994 #endif /* PERL_MEM_LOG */
4997 =for apidoc my_sprintf
4999 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5000 the length of the string written to the buffer. Only rare pre-ANSI systems
5001 need the wrapper function - usually this is a direct call to C<sprintf>.
5005 #ifndef SPRINTF_RETURNS_STRLEN
5007 Perl_my_sprintf(char *buffer, const char* pat, ...)
5010 PERL_ARGS_ASSERT_MY_SPRINTF;
5011 va_start(args, pat);
5012 vsprintf(buffer, pat, args);
5014 return strlen(buffer);
5019 =for apidoc quadmath_format_single
5021 C<quadmath_snprintf()> is very strict about its C<format> string and will
5022 fail, returning -1, if the format is invalid. It accepts exactly
5025 C<quadmath_format_single()> checks that the intended single spec looks
5026 sane: begins with C<%>, has only one C<%>, ends with C<[efgaEFGA]>,
5027 and has C<Q> before it. This is not a full "printf syntax check",
5030 Returns the format if it is valid, NULL if not.
5032 C<quadmath_format_single()> can and will actually patch in the missing
5033 C<Q>, if necessary. In this case it will return the modified copy of
5034 the format, B<which the caller will need to free.>
5036 See also L</quadmath_format_needed>.
5042 Perl_quadmath_format_single(const char* format)
5046 PERL_ARGS_ASSERT_QUADMATH_FORMAT_SINGLE;
5048 if (format[0] != '%' || strchr(format + 1, '%'))
5050 len = strlen(format);
5051 /* minimum length three: %Qg */
5052 if (len < 3 || strchr("efgaEFGA", format[len - 1]) == NULL)
5054 if (format[len - 2] != 'Q') {
5056 Newx(fixed, len + 1, char);
5057 memcpy(fixed, format, len - 1);
5058 fixed[len - 1] = 'Q';
5059 fixed[len ] = format[len - 1];
5061 return (const char*)fixed;
5068 =for apidoc quadmath_format_needed
5070 C<quadmath_format_needed()> returns true if the C<format> string seems to
5071 contain at least one non-Q-prefixed C<%[efgaEFGA]> format specifier,
5072 or returns false otherwise.
5074 The format specifier detection is not complete printf-syntax detection,
5075 but it should catch most common cases.
5077 If true is returned, those arguments B<should> in theory be processed
5078 with C<quadmath_snprintf()>, but in case there is more than one such
5079 format specifier (see L</quadmath_format_single>), and if there is
5080 anything else beyond that one (even just a single byte), they
5081 B<cannot> be processed because C<quadmath_snprintf()> is very strict,
5082 accepting only one format spec, and nothing else.
5083 In this case, the code should probably fail.
5089 Perl_quadmath_format_needed(const char* format)
5091 const char *p = format;
5094 PERL_ARGS_ASSERT_QUADMATH_FORMAT_NEEDED;
5096 while ((q = strchr(p, '%'))) {
5098 if (*q == '+') /* plus */
5100 if (*q == '#') /* alt */
5102 if (*q == '*') /* width */
5106 while (isDIGIT(*q)) q++;
5109 if (*q == '.' && (q[1] == '*' || isDIGIT(q[1]))) { /* prec */
5114 while (isDIGIT(*q)) q++;
5116 if (strchr("efgaEFGA", *q)) /* Would have needed 'Q' in front. */
5125 =for apidoc my_snprintf
5127 The C library C<snprintf> functionality, if available and
5128 standards-compliant (uses C<vsnprintf>, actually). However, if the
5129 C<vsnprintf> is not available, will unfortunately use the unsafe
5130 C<vsprintf> which can overrun the buffer (there is an overrun check,
5131 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5132 getting C<vsnprintf>.
5137 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5141 PERL_ARGS_ASSERT_MY_SNPRINTF;
5142 #ifndef HAS_VSNPRINTF
5143 PERL_UNUSED_VAR(len);
5145 va_start(ap, format);
5148 const char* qfmt = quadmath_format_single(format);
5149 bool quadmath_valid = FALSE;
5151 /* If the format looked promising, use it as quadmath. */
5152 retval = quadmath_snprintf(buffer, len, qfmt, va_arg(ap, NV));
5154 if (qfmt != format) {
5158 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
5160 quadmath_valid = TRUE;
5165 assert(qfmt == NULL);
5166 /* quadmath_format_single() will return false for example for
5167 * "foo = %g", or simply "%g". We could handle the %g by
5168 * using quadmath for the NV args. More complex cases of
5169 * course exist: "foo = %g, bar = %g", or "foo=%Qg" (otherwise
5170 * quadmath-valid but has stuff in front).
5172 * Handling the "Q-less" cases right would require walking
5173 * through the va_list and rewriting the format, calling
5174 * quadmath for the NVs, building a new va_list, and then
5175 * letting vsnprintf/vsprintf to take care of the other
5176 * arguments. This may be doable.
5178 * We do not attempt that now. But for paranoia, we here try
5179 * to detect some common (but not all) cases where the
5180 * "Q-less" %[efgaEFGA] formats are present, and die if
5181 * detected. This doesn't fix the problem, but it stops the
5182 * vsnprintf/vsprintf pulling doubles off the va_list when
5183 * __float128 NVs should be pulled off instead.
5185 * If quadmath_format_needed() returns false, we are reasonably
5186 * certain that we can call vnsprintf() or vsprintf() safely. */
5187 if (!quadmath_valid && quadmath_format_needed(format))
5188 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", format);
5193 #ifdef HAS_VSNPRINTF
5194 retval = vsnprintf(buffer, len, format, ap);
5196 retval = vsprintf(buffer, format, ap);
5199 /* vsprintf() shows failure with < 0 */
5201 #ifdef HAS_VSNPRINTF
5202 /* vsnprintf() shows failure with >= len */
5204 (len > 0 && (Size_t)retval >= len)
5207 Perl_croak_nocontext("panic: my_snprintf buffer overflow");
5212 =for apidoc my_vsnprintf
5214 The C library C<vsnprintf> if available and standards-compliant.
5215 However, if if the C<vsnprintf> is not available, will unfortunately
5216 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5217 overrun check, but that may be too late). Consider using
5218 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5223 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5226 PERL_UNUSED_ARG(buffer);
5227 PERL_UNUSED_ARG(len);
5228 PERL_UNUSED_ARG(format);
5229 /* the cast is to avoid gcc -Wsizeof-array-argument complaining */
5230 PERL_UNUSED_ARG((void*)ap);
5231 Perl_croak_nocontext("panic: my_vsnprintf not available with quadmath");
5238 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5239 Perl_va_copy(ap, apc);
5240 # ifdef HAS_VSNPRINTF
5241 retval = vsnprintf(buffer, len, format, apc);
5243 PERL_UNUSED_ARG(len);
5244 retval = vsprintf(buffer, format, apc);
5248 # ifdef HAS_VSNPRINTF
5249 retval = vsnprintf(buffer, len, format, ap);
5251 PERL_UNUSED_ARG(len);
5252 retval = vsprintf(buffer, format, ap);
5254 #endif /* #ifdef NEED_VA_COPY */
5255 /* vsprintf() shows failure with < 0 */
5257 #ifdef HAS_VSNPRINTF
5258 /* vsnprintf() shows failure with >= len */
5260 (len > 0 && (Size_t)retval >= len)
5263 Perl_croak_nocontext("panic: my_vsnprintf buffer overflow");
5269 Perl_my_clearenv(pTHX)
5272 #if ! defined(PERL_MICRO)
5273 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5275 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5276 # if defined(USE_ENVIRON_ARRAY)
5277 # if defined(USE_ITHREADS)
5278 /* only the parent thread can clobber the process environment */
5279 if (PL_curinterp == aTHX)
5280 # endif /* USE_ITHREADS */
5282 # if ! defined(PERL_USE_SAFE_PUTENV)
5283 if ( !PL_use_safe_putenv) {
5285 if (environ == PL_origenviron)
5286 environ = (char**)safesysmalloc(sizeof(char*));
5288 for (i = 0; environ[i]; i++)
5289 (void)safesysfree(environ[i]);
5292 # else /* PERL_USE_SAFE_PUTENV */
5293 # if defined(HAS_CLEARENV)
5295 # elif defined(HAS_UNSETENV)
5296 int bsiz = 80; /* Most envvar names will be shorter than this. */
5297 char *buf = (char*)safesysmalloc(bsiz);
5298 while (*environ != NULL) {
5299 char *e = strchr(*environ, '=');
5300 int l = e ? e - *environ : (int)strlen(*environ);
5302 (void)safesysfree(buf);
5303 bsiz = l + 1; /* + 1 for the \0. */
5304 buf = (char*)safesysmalloc(bsiz);
5306 memcpy(buf, *environ, l);
5308 (void)unsetenv(buf);
5310 (void)safesysfree(buf);
5311 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5312 /* Just null environ and accept the leakage. */
5314 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5315 # endif /* ! PERL_USE_SAFE_PUTENV */
5317 # endif /* USE_ENVIRON_ARRAY */
5318 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5319 #endif /* PERL_MICRO */
5322 #ifdef PERL_IMPLICIT_CONTEXT
5324 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5325 the global PL_my_cxt_index is incremented, and that value is assigned to
5326 that module's static my_cxt_index (who's address is passed as an arg).
5327 Then, for each interpreter this function is called for, it makes sure a
5328 void* slot is available to hang the static data off, by allocating or
5329 extending the interpreter's PL_my_cxt_list array */
5331 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5333 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5337 PERL_ARGS_ASSERT_MY_CXT_INIT;
5339 /* this module hasn't been allocated an index yet */
5340 #if defined(USE_ITHREADS)
5341 MUTEX_LOCK(&PL_my_ctx_mutex);
5343 *index = PL_my_cxt_index++;
5344 #if defined(USE_ITHREADS)
5345 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5349 /* make sure the array is big enough */
5350 if (PL_my_cxt_size <= *index) {
5351 if (PL_my_cxt_size) {
5352 IV new_size = PL_my_cxt_size;
5353 while (new_size <= *index)
5355 Renew(PL_my_cxt_list, new_size, void *);
5356 PL_my_cxt_size = new_size;
5359 PL_my_cxt_size = 16;
5360 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5363 /* newSV() allocates one more than needed */
5364 p = (void*)SvPVX(newSV(size-1));
5365 PL_my_cxt_list[*index] = p;
5366 Zero(p, size, char);
5370 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5373 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5378 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5380 for (index = 0; index < PL_my_cxt_index; index++) {
5381 const char *key = PL_my_cxt_keys[index];
5382 /* try direct pointer compare first - there are chances to success,
5383 * and it's much faster.
5385 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5392 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5398 PERL_ARGS_ASSERT_MY_CXT_INIT;
5400 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5402 /* this module hasn't been allocated an index yet */
5403 #if defined(USE_ITHREADS)
5404 MUTEX_LOCK(&PL_my_ctx_mutex);
5406 index = PL_my_cxt_index++;
5407 #if defined(USE_ITHREADS)
5408 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5412 /* make sure the array is big enough */
5413 if (PL_my_cxt_size <= index) {
5414 int old_size = PL_my_cxt_size;
5416 if (PL_my_cxt_size) {
5417 IV new_size = PL_my_cxt_size;
5418 while (new_size <= index)
5420 Renew(PL_my_cxt_list, new_size, void *);
5421 Renew(PL_my_cxt_keys, new_size, const char *);
5422 PL_my_cxt_size = new_size;
5425 PL_my_cxt_size = 16;
5426 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5427 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5429 for (i = old_size; i < PL_my_cxt_size; i++) {
5430 PL_my_cxt_keys[i] = 0;
5431 PL_my_cxt_list[i] = 0;
5434 PL_my_cxt_keys[index] = my_cxt_key;
5435 /* newSV() allocates one more than needed */
5436 p = (void*)SvPVX(newSV(size-1));
5437 PL_my_cxt_list[index] = p;
5438 Zero(p, size, char);
5441 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5442 #endif /* PERL_IMPLICIT_CONTEXT */
5445 /* Perl_xs_handshake():
5446 implement the various XS_*_BOOTCHECK macros, which are added to .c
5447 files by ExtUtils::ParseXS, to check that the perl the module was built
5448 with is binary compatible with the running perl.
5451 Perl_xs_handshake(U32 key, void * v_my_perl, const char * file,
5452 [U32 items, U32 ax], [char * api_version], [char * xs_version])
5454 The meaning of the varargs is determined the U32 key arg (which is not
5455 a format string). The fields of key are assembled by using HS_KEY().
5457 Under PERL_IMPLICIT_CONTEX, the v_my_perl arg is of type
5458 "PerlInterpreter *" and represents the callers context; otherwise it is
5459 of type "CV *", and is the boot xsub's CV.
5461 v_my_perl will catch where a threaded future perl526.dll calling IO.dll
5462 for example, and IO.dll was linked with threaded perl524.dll, and both
5463 perl526.dll and perl524.dll are in %PATH and the Win32 DLL loader
5464 successfully can load IO.dll into the process but simultaneously it
5465 loaded an interpreter of a different version into the process, and XS
5466 code will naturally pass SV*s created by perl524.dll for perl526.dll to
5467 use through perl526.dll's my_perl->Istack_base.
5469 v_my_perl cannot be the first arg, since then 'key' will be out of
5470 place in a threaded vs non-threaded mixup; and analyzing the key
5471 number's bitfields won't reveal the problem, since it will be a valid
5472 key (unthreaded perl) on interp side, but croak will report the XS mod's
5473 key as gibberish (it is really a my_perl ptr) (threaded XS mod); or if
5474 it's a threaded perl and an unthreaded XS module, threaded perl will
5475 look at an uninit C stack or an uninit register to get 'key'
5476 (remember that it assumes that the 1st arg is the interp cxt).
5478 'file' is the source filename of the caller.
5482 Perl_xs_handshake(const U32 key, void * v_my_perl, const char * file, ...)
5488 #ifdef PERL_IMPLICIT_CONTEXT
5495 PERL_ARGS_ASSERT_XS_HANDSHAKE;
5496 va_start(args, file);
5498 got = INT2PTR(void*, (UV)(key & HSm_KEY_MATCH));
5499 need = (void *)(HS_KEY(FALSE, FALSE, "", "") & HSm_KEY_MATCH);
5500 if (UNLIKELY(got != need))
5502 /* try to catch where a 2nd threaded perl interp DLL is loaded into a process
5503 by a XS DLL compiled against the wrong interl DLL b/c of bad @INC, and the
5504 2nd threaded perl interp DLL never initialized its TLS/PERL_SYS_INIT3 so
5505 dTHX call from 2nd interp DLL can't return the my_perl that pp_entersub
5506 passed to the XS DLL */
5507 #ifdef PERL_IMPLICIT_CONTEXT
5508 xs_interp = (tTHX)v_my_perl;
5512 /* try to catch where an unthreaded perl interp DLL (for ex. perl522.dll) is
5513 loaded into a process by a XS DLL built by an unthreaded perl522.dll perl,
5514 but the DynaLoder/Perl that started the process and loaded the XS DLL is
5515 unthreaded perl524.dll, since unthreadeds don't pass my_perl (a unique *)
5516 through pp_entersub, use a unique value (which is a pointer to PL_stack_sp's
5517 location in the unthreaded perl binary) stored in CV * to figure out if this
5518 Perl_xs_handshake was called by the same pp_entersub */
5519 cv = (CV*)v_my_perl;
5520 xs_spp = (SV***)CvHSCXT(cv);
5522 need = &PL_stack_sp;
5524 if(UNLIKELY(got != need)) {
5525 bad_handshake:/* recycle branch and string from above */
5526 if(got != (void *)HSf_NOCHK)
5527 noperl_die("%s: loadable library and perl binaries are mismatched"
5528 " (got handshake key %p, needed %p)\n",
5532 if(key & HSf_SETXSUBFN) { /* this might be called from a module bootstrap */
5533 SAVEPPTR(PL_xsubfilename);/* which was require'd from a XSUB BEGIN */
5534 PL_xsubfilename = file; /* so the old name must be restored for
5535 additional XSUBs to register themselves */
5536 /* XSUBs can't be perl lang/perl5db.pl debugged
5537 if (PERLDB_LINE_OR_SAVESRC)
5538 (void)gv_fetchfile(file); */
5541 if(key & HSf_POPMARK) {
5543 { SV **mark = PL_stack_base + ax++;
5545 items = (I32)(SP - MARK);
5549 items = va_arg(args, U32);
5550 ax = va_arg(args, U32);
5554 assert(HS_GETAPIVERLEN(key) <= UCHAR_MAX);
5555 if((apiverlen = HS_GETAPIVERLEN(key))) {
5556 char * api_p = va_arg(args, char*);
5557 if(apiverlen != sizeof("v" PERL_API_VERSION_STRING)-1
5558 || memNE(api_p, "v" PERL_API_VERSION_STRING,
5559 sizeof("v" PERL_API_VERSION_STRING)-1))
5560 Perl_croak_nocontext("Perl API version %s of %" SVf " does not match %s",
5561 api_p, SVfARG(PL_stack_base[ax + 0]),
5562 "v" PERL_API_VERSION_STRING);
5567 assert(HS_GETXSVERLEN(key) <= UCHAR_MAX && HS_GETXSVERLEN(key) <= HS_APIVERLEN_MAX);
5568 if((xsverlen = HS_GETXSVERLEN(key)))
5569 S_xs_version_bootcheck(aTHX_
5570 items, ax, va_arg(args, char*), xsverlen);
5578 S_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
5582 const char *vn = NULL;
5583 SV *const module = PL_stack_base[ax];
5585 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
5587 if (items >= 2) /* version supplied as bootstrap arg */
5588 sv = PL_stack_base[ax + 1];
5590 /* XXX GV_ADDWARN */
5592 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5593 if (!sv || !SvOK(sv)) {
5595 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5599 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
5600 SV *pmsv = sv_isobject(sv) && sv_derived_from(sv, "version")
5601 ? sv : sv_2mortal(new_version(sv));
5602 xssv = upg_version(xssv, 0);
5603 if ( vcmp(pmsv,xssv) ) {
5604 SV *string = vstringify(xssv);
5605 SV *xpt = Perl_newSVpvf(aTHX_ "%" SVf " object version %" SVf
5606 " does not match ", SVfARG(module), SVfARG(string));
5608 SvREFCNT_dec(string);
5609 string = vstringify(pmsv);
5612 Perl_sv_catpvf(aTHX_ xpt, "$%" SVf "::%s %" SVf, SVfARG(module), vn,
5615 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %" SVf, SVfARG(string));
5617 SvREFCNT_dec(string);
5619 Perl_sv_2mortal(aTHX_ xpt);
5620 Perl_croak_sv(aTHX_ xpt);
5626 =for apidoc my_strlcat
5628 The C library C<strlcat> if available, or a Perl implementation of it.
5629 This operates on C C<NUL>-terminated strings.
5631 C<my_strlcat()> appends string C<src> to the end of C<dst>. It will append at
5632 most S<C<size - strlen(dst) - 1>> characters. It will then C<NUL>-terminate,
5633 unless C<size> is 0 or the original C<dst> string was longer than C<size> (in
5634 practice this should not happen as it means that either C<size> is incorrect or
5635 that C<dst> is not a proper C<NUL>-terminated string).
5637 Note that C<size> is the full size of the destination buffer and
5638 the result is guaranteed to be C<NUL>-terminated if there is room. Note that
5639 room for the C<NUL> should be included in C<size>.
5641 The return value is the total length that C<dst> would have if C<size> is
5642 sufficiently large. Thus it is the initial length of C<dst> plus the length of
5643 C<src>. If C<size> is smaller than the return, the excess was not appended.
5647 Description stolen from http://man.openbsd.org/strlcat.3
5651 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5653 Size_t used, length, copy;
5656 length = strlen(src);
5657 if (size > 0 && used < size - 1) {
5658 copy = (length >= size - used) ? size - used - 1 : length;
5659 memcpy(dst + used, src, copy);
5660 dst[used + copy] = '\0';
5662 return used + length;
5668 =for apidoc my_strlcpy
5670 The C library C<strlcpy> if available, or a Perl implementation of it.
5671 This operates on C C<NUL>-terminated strings.
5673 C<my_strlcpy()> copies up to S<C<size - 1>> characters from the string C<src>
5674 to C<dst>, C<NUL>-terminating the result if C<size> is not 0.
5676 The return value is the total length C<src> would be if the copy completely
5677 succeeded. If it is larger than C<size>, the excess was not copied.
5681 Description stolen from http://man.openbsd.org/strlcpy.3
5685 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5687 Size_t length, copy;
5689 length = strlen(src);
5691 copy = (length >= size) ? size - 1 : length;
5692 memcpy(dst, src, copy);
5699 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5700 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5701 long _ftol( double ); /* Defined by VC6 C libs. */
5702 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5705 PERL_STATIC_INLINE bool
5706 S_gv_has_usable_name(pTHX_ GV *gv)
5710 && HvENAME(GvSTASH(gv))
5711 && (gvp = (GV **)hv_fetchhek(
5712 GvSTASH(gv), GvNAME_HEK(gv), 0
5718 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5720 SV * const dbsv = GvSVn(PL_DBsub);
5721 const bool save_taint = TAINT_get;
5723 /* When we are called from pp_goto (svp is null),
5724 * we do not care about using dbsv to call CV;
5725 * it's for informational purposes only.
5728 PERL_ARGS_ASSERT_GET_DB_SUB;
5732 if (!PERLDB_SUB_NN) {
5735 if (!svp && !CvLEXICAL(cv)) {
5736 gv_efullname3(dbsv, gv, NULL);
5738 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED)) || CvLEXICAL(cv)
5739 || strEQ(GvNAME(gv), "END")
5740 || ( /* Could be imported, and old sub redefined. */
5741 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
5743 !( (SvTYPE(*svp) == SVt_PVGV)
5744 && (GvCV((const GV *)*svp) == cv)
5745 /* Use GV from the stack as a fallback. */
5746 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
5750 /* GV is potentially non-unique, or contain different CV. */
5751 SV * const tmp = newRV(MUTABLE_SV(cv));
5752 sv_setsv(dbsv, tmp);
5756 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
5757 sv_catpvs(dbsv, "::");
5758 sv_cathek(dbsv, GvNAME_HEK(gv));
5762 const int type = SvTYPE(dbsv);
5763 if (type < SVt_PVIV && type != SVt_IV)
5764 sv_upgrade(dbsv, SVt_PVIV);
5765 (void)SvIOK_on(dbsv);
5766 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5769 TAINT_IF(save_taint);
5770 #ifdef NO_TAINT_SUPPORT
5771 PERL_UNUSED_VAR(save_taint);
5776 Perl_my_dirfd(DIR * dir) {
5778 /* Most dirfd implementations have problems when passed NULL. */
5783 #elif defined(HAS_DIR_DD_FD)
5786 Perl_croak_nocontext(PL_no_func, "dirfd");
5787 NOT_REACHED; /* NOTREACHED */
5793 Perl_get_re_arg(pTHX_ SV *sv) {
5799 sv = MUTABLE_SV(SvRV(sv));
5800 if (SvTYPE(sv) == SVt_REGEXP)
5801 return (REGEXP*) sv;
5808 * This code is derived from drand48() implementation from FreeBSD,
5809 * found in lib/libc/gen/_rand48.c.
5811 * The U64 implementation is original, based on the POSIX
5812 * specification for drand48().
5816 * Copyright (c) 1993 Martin Birgmeier
5817 * All rights reserved.
5819 * You may redistribute unmodified or modified versions of this source
5820 * code provided that the above copyright notice and this and the
5821 * following conditions are retained.
5823 * This software is provided ``as is'', and comes with no warranties
5824 * of any kind. I shall in no event be liable for anything that happens
5825 * to anyone/anything when using this software.
5828 #define FREEBSD_DRAND48_SEED_0 (0x330e)
5830 #ifdef PERL_DRAND48_QUAD
5832 #define DRAND48_MULT U64_CONST(0x5deece66d)
5833 #define DRAND48_ADD 0xb
5834 #define DRAND48_MASK U64_CONST(0xffffffffffff)
5838 #define FREEBSD_DRAND48_SEED_1 (0xabcd)
5839 #define FREEBSD_DRAND48_SEED_2 (0x1234)
5840 #define FREEBSD_DRAND48_MULT_0 (0xe66d)
5841 #define FREEBSD_DRAND48_MULT_1 (0xdeec)
5842 #define FREEBSD_DRAND48_MULT_2 (0x0005)
5843 #define FREEBSD_DRAND48_ADD (0x000b)
5845 const unsigned short _rand48_mult[3] = {
5846 FREEBSD_DRAND48_MULT_0,
5847 FREEBSD_DRAND48_MULT_1,
5848 FREEBSD_DRAND48_MULT_2
5850 const unsigned short _rand48_add = FREEBSD_DRAND48_ADD;
5855 Perl_drand48_init_r(perl_drand48_t *random_state, U32 seed)
5857 PERL_ARGS_ASSERT_DRAND48_INIT_R;
5859 #ifdef PERL_DRAND48_QUAD
5860 *random_state = FREEBSD_DRAND48_SEED_0 + ((U64)seed << 16);
5862 random_state->seed[0] = FREEBSD_DRAND48_SEED_0;
5863 random_state->seed[1] = (U16) seed;
5864 random_state->seed[2] = (U16) (seed >> 16);
5869 Perl_drand48_r(perl_drand48_t *random_state)
5871 PERL_ARGS_ASSERT_DRAND48_R;
5873 #ifdef PERL_DRAND48_QUAD
5874 *random_state = (*random_state * DRAND48_MULT + DRAND48_ADD)
5877 return ldexp((double)*random_state, -48);
5883 accu = (U32) _rand48_mult[0] * (U32) random_state->seed[0]
5884 + (U32) _rand48_add;
5885 temp[0] = (U16) accu; /* lower 16 bits */
5886 accu >>= sizeof(U16) * 8;
5887 accu += (U32) _rand48_mult[0] * (U32) random_state->seed[1]
5888 + (U32) _rand48_mult[1] * (U32) random_state->seed[0];
5889 temp[1] = (U16) accu; /* middle 16 bits */
5890 accu >>= sizeof(U16) * 8;
5891 accu += _rand48_mult[0] * random_state->seed[2]
5892 + _rand48_mult[1] * random_state->seed[1]
5893 + _rand48_mult[2] * random_state->seed[0];
5894 random_state->seed[0] = temp[0];
5895 random_state->seed[1] = temp[1];
5896 random_state->seed[2] = (U16) accu;
5898 return ldexp((double) random_state->seed[0], -48) +
5899 ldexp((double) random_state->seed[1], -32) +
5900 ldexp((double) random_state->seed[2], -16);
5905 #ifdef USE_C_BACKTRACE
5907 /* Possibly move all this USE_C_BACKTRACE code into a new file. */
5912 /* abfd is the BFD handle. */
5914 /* bfd_syms is the BFD symbol table. */
5916 /* bfd_text is handle to the the ".text" section of the object file. */
5918 /* Since opening the executable and scanning its symbols is quite
5919 * heavy operation, we remember the filename we used the last time,
5920 * and do the opening and scanning only if the filename changes.
5921 * This removes most (but not all) open+scan cycles. */
5922 const char* fname_prev;
5925 /* Given a dl_info, update the BFD context if necessary. */
5926 static void bfd_update(bfd_context* ctx, Dl_info* dl_info)
5928 /* BFD open and scan only if the filename changed. */
5929 if (ctx->fname_prev == NULL ||
5930 strNE(dl_info->dli_fname, ctx->fname_prev)) {
5932 bfd_close(ctx->abfd);
5934 ctx->abfd = bfd_openr(dl_info->dli_fname, 0);
5936 if (bfd_check_format(ctx->abfd, bfd_object)) {
5937 IV symbol_size = bfd_get_symtab_upper_bound(ctx->abfd);
5938 if (symbol_size > 0) {
5939 Safefree(ctx->bfd_syms);
5940 Newx(ctx->bfd_syms, symbol_size, asymbol*);
5942 bfd_get_section_by_name(ctx->abfd, ".text");
5950 ctx->fname_prev = dl_info->dli_fname;
5954 /* Given a raw frame, try to symbolize it and store
5955 * symbol information (source file, line number) away. */
5956 static void bfd_symbolize(bfd_context* ctx,
5959 STRLEN* symbol_name_size,
5961 STRLEN* source_name_size,
5962 STRLEN* source_line)
5964 *symbol_name = NULL;
5965 *symbol_name_size = 0;
5967 IV offset = PTR2IV(raw_frame) - PTR2IV(ctx->bfd_text->vma);
5969 bfd_canonicalize_symtab(ctx->abfd, ctx->bfd_syms) > 0) {
5972 unsigned int line = 0;
5973 if (bfd_find_nearest_line(ctx->abfd, ctx->bfd_text,
5974 ctx->bfd_syms, offset,
5975 &file, &func, &line) &&
5976 file && func && line > 0) {
5977 /* Size and copy the source file, use only
5978 * the basename of the source file.
5980 * NOTE: the basenames are fine for the
5981 * Perl source files, but may not always
5982 * be the best idea for XS files. */
5983 const char *p, *b = NULL;
5984 /* Look for the last slash. */
5985 for (p = file; *p; p++) {
5989 if (b == NULL || *b == 0) {
5992 *source_name_size = p - b + 1;
5993 Newx(*source_name, *source_name_size + 1, char);
5994 Copy(b, *source_name, *source_name_size + 1, char);
5996 *symbol_name_size = strlen(func);
5997 Newx(*symbol_name, *symbol_name_size + 1, char);
5998 Copy(func, *symbol_name, *symbol_name_size + 1, char);
6000 *source_line = line;
6006 #endif /* #ifdef USE_BFD */
6010 /* OS X has no public API for for 'symbolicating' (Apple official term)
6011 * stack addresses to {function_name, source_file, line_number}.
6012 * Good news: there is command line utility atos(1) which does that.
6013 * Bad news 1: it's a command line utility.
6014 * Bad news 2: one needs to have the Developer Tools installed.
6015 * Bad news 3: in newer releases it needs to be run as 'xcrun atos'.
6017 * To recap: we need to open a pipe for reading for a utility which
6018 * might not exist, or exists in different locations, and then parse
6019 * the output. And since this is all for a low-level API, we cannot
6020 * use high-level stuff. Thanks, Apple. */
6023 /* tool is set to the absolute pathname of the tool to use:
6026 /* format is set to a printf format string used for building
6027 * the external command to run. */
6029 /* unavail is set if e.g. xcrun cannot be found, or something
6030 * else happens that makes getting the backtrace dubious. Note,
6031 * however, that the context isn't persistent, the next call to
6032 * get_c_backtrace() will start from scratch. */
6034 /* fname is the current object file name. */
6036 /* object_base_addr is the base address of the shared object. */
6037 void* object_base_addr;
6040 /* Given |dl_info|, updates the context. If the context has been
6041 * marked unavailable, return immediately. If not but the tool has
6042 * not been set, set it to either "xcrun atos" or "atos" (also set the
6043 * format to use for creating commands for piping), or if neither is
6044 * unavailable (one needs the Developer Tools installed), mark the context
6045 * an unavailable. Finally, update the filename (object name),
6046 * and its base address. */
6048 static void atos_update(atos_context* ctx,
6053 if (ctx->tool == NULL) {
6054 const char* tools[] = {
6058 const char* formats[] = {
6059 "/usr/bin/xcrun atos -o '%s' -l %08x %08x 2>&1",
6060 "/usr/bin/atos -d -o '%s' -l %08x %08x 2>&1"
6064 for (i = 0; i < C_ARRAY_LENGTH(tools); i++) {
6065 if (stat(tools[i], &st) == 0 && S_ISREG(st.st_mode)) {
6066 ctx->tool = tools[i];
6067 ctx->format = formats[i];
6071 if (ctx->tool == NULL) {
6072 ctx->unavail = TRUE;
6076 if (ctx->fname == NULL ||
6077 strNE(dl_info->dli_fname, ctx->fname)) {
6078 ctx->fname = dl_info->dli_fname;
6079 ctx->object_base_addr = dl_info->dli_fbase;
6083 /* Given an output buffer end |p| and its |start|, matches
6084 * for the atos output, extracting the source code location
6085 * and returning non-NULL if possible, returning NULL otherwise. */
6086 static const char* atos_parse(const char* p,
6088 STRLEN* source_name_size,
6089 STRLEN* source_line) {
6090 /* atos() output is something like:
6091 * perl_parse (in miniperl) (perl.c:2314)\n\n".
6092 * We cannot use Perl regular expressions, because we need to
6093 * stay low-level. Therefore here we have a rolled-out version
6094 * of a state machine which matches _backwards_from_the_end_ and
6095 * if there's a success, returns the starts of the filename,
6096 * also setting the filename size and the source line number.
6097 * The matched regular expression is roughly "\(.*:\d+\)\s*$" */
6098 const char* source_number_start;
6099 const char* source_name_end;
6100 const char* source_line_end;
6101 const char* close_paren;
6104 /* Skip trailing whitespace. */
6105 while (p > start && isspace(*p)) p--;
6106 /* Now we should be at the close paren. */
6107 if (p == start || *p != ')')
6111 /* Now we should be in the line number. */
6112 if (p == start || !isdigit(*p))
6114 /* Skip over the digits. */
6115 while (p > start && isdigit(*p))
6117 /* Now we should be at the colon. */
6118 if (p == start || *p != ':')
6120 source_number_start = p + 1;
6121 source_name_end = p; /* Just beyond the end. */
6123 /* Look for the open paren. */
6124 while (p > start && *p != '(')
6129 *source_name_size = source_name_end - p;
6130 if (grok_atoUV(source_number_start, &uv, &source_line_end)
6131 && source_line_end == close_paren
6132 && uv <= PERL_INT_MAX
6134 *source_line = (STRLEN)uv;
6140 /* Given a raw frame, read a pipe from the symbolicator (that's the
6141 * technical term) atos, reads the result, and parses the source code
6142 * location. We must stay low-level, so we use snprintf(), pipe(),
6143 * and fread(), and then also parse the output ourselves. */
6144 static void atos_symbolize(atos_context* ctx,
6147 STRLEN* source_name_size,
6148 STRLEN* source_line)
6156 /* Simple security measure: if there's any funny business with
6157 * the object name (used as "-o '%s'" ), leave since at least
6158 * partially the user controls it. */
6159 for (p = ctx->fname; *p; p++) {
6160 if (*p == '\'' || iscntrl(*p)) {
6161 ctx->unavail = TRUE;
6165 cnt = snprintf(cmd, sizeof(cmd), ctx->format,
6166 ctx->fname, ctx->object_base_addr, raw_frame);
6167 if (cnt < sizeof(cmd)) {
6168 /* Undo nostdio.h #defines that disable stdio.
6169 * This is somewhat naughty, but is used elsewhere
6170 * in the core, and affects only OS X. */
6175 FILE* fp = popen(cmd, "r");
6176 /* At the moment we open a new pipe for each stack frame.
6177 * This is naturally somewhat slow, but hopefully generating
6178 * stack traces is never going to in a performance critical path.
6180 * We could play tricks with atos by batching the stack
6181 * addresses to be resolved: atos can either take multiple
6182 * addresses from the command line, or read addresses from
6183 * a file (though the mess of creating temporary files would
6184 * probably negate much of any possible speedup).
6186 * Normally there are only two objects present in the backtrace:
6187 * perl itself, and the libdyld.dylib. (Note that the object
6188 * filenames contain the full pathname, so perl may not always
6189 * be in the same place.) Whenever the object in the
6190 * backtrace changes, the base address also changes.
6192 * The problem with batching the addresses, though, would be
6193 * matching the results with the addresses: the parsing of
6194 * the results is already painful enough with a single address. */
6197 UV cnt = fread(out, 1, sizeof(out), fp);
6198 if (cnt < sizeof(out)) {
6199 const char* p = atos_parse(out + cnt - 1, out,
6204 *source_name_size, char);
6205 Copy(p, *source_name,
6206 *source_name_size, char);
6214 #endif /* #ifdef PERL_DARWIN */
6217 =for apidoc get_c_backtrace
6219 Collects the backtrace (aka "stacktrace") into a single linear
6220 malloced buffer, which the caller B<must> C<Perl_free_c_backtrace()>.
6222 Scans the frames back by S<C<depth + skip>>, then drops the C<skip> innermost,
6223 returning at most C<depth> frames.
6229 Perl_get_c_backtrace(pTHX_ int depth, int skip)
6231 /* Note that here we must stay as low-level as possible: Newx(),
6232 * Copy(), Safefree(); since we may be called from anywhere,
6233 * so we should avoid higher level constructs like SVs or AVs.
6235 * Since we are using safesysmalloc() via Newx(), don't try
6236 * getting backtrace() there, unless you like deep recursion. */
6238 /* Currently only implemented with backtrace() and dladdr(),
6239 * for other platforms NULL is returned. */
6241 #if defined(HAS_BACKTRACE) && defined(HAS_DLADDR)
6242 /* backtrace() is available via <execinfo.h> in glibc and in most
6243 * modern BSDs; dladdr() is available via <dlfcn.h>. */
6245 /* We try fetching this many frames total, but then discard
6246 * the |skip| first ones. For the remaining ones we will try
6247 * retrieving more information with dladdr(). */
6248 int try_depth = skip + depth;
6250 /* The addresses (program counters) returned by backtrace(). */
6253 /* Retrieved with dladdr() from the addresses returned by backtrace(). */
6256 /* Sizes _including_ the terminating \0 of the object name
6257 * and symbol name strings. */
6258 STRLEN* object_name_sizes;
6259 STRLEN* symbol_name_sizes;
6262 /* The symbol names comes either from dli_sname,
6263 * or if using BFD, they can come from BFD. */
6264 char** symbol_names;
6267 /* The source code location information. Dug out with e.g. BFD. */
6268 char** source_names;
6269 STRLEN* source_name_sizes;
6270 STRLEN* source_lines;
6272 Perl_c_backtrace* bt = NULL; /* This is what will be returned. */
6273 int got_depth; /* How many frames were returned from backtrace(). */
6274 UV frame_count = 0; /* How many frames we return. */
6275 UV total_bytes = 0; /* The size of the whole returned backtrace. */
6278 bfd_context bfd_ctx;
6281 atos_context atos_ctx;
6284 /* Here are probably possibilities for optimizing. We could for
6285 * example have a struct that contains most of these and then
6286 * allocate |try_depth| of them, saving a bunch of malloc calls.
6287 * Note, however, that |frames| could not be part of that struct
6288 * because backtrace() will want an array of just them. Also be
6289 * careful about the name strings. */
6290 Newx(raw_frames, try_depth, void*);
6291 Newx(dl_infos, try_depth, Dl_info);
6292 Newx(object_name_sizes, try_depth, STRLEN);
6293 Newx(symbol_name_sizes, try_depth, STRLEN);
6294 Newx(source_names, try_depth, char*);
6295 Newx(source_name_sizes, try_depth, STRLEN);
6296 Newx(source_lines, try_depth, STRLEN);
6298 Newx(symbol_names, try_depth, char*);
6301 /* Get the raw frames. */
6302 got_depth = (int)backtrace(raw_frames, try_depth);
6304 /* We use dladdr() instead of backtrace_symbols() because we want
6305 * the full details instead of opaque strings. This is useful for
6306 * two reasons: () the details are needed for further symbolic
6307 * digging, for example in OS X (2) by having the details we fully
6308 * control the output, which in turn is useful when more platforms
6309 * are added: we can keep out output "portable". */
6311 /* We want a single linear allocation, which can then be freed
6312 * with a single swoop. We will do the usual trick of first
6313 * walking over the structure and seeing how much we need to
6314 * allocate, then allocating, and then walking over the structure
6315 * the second time and populating it. */
6317 /* First we must compute the total size of the buffer. */
6318 total_bytes = sizeof(Perl_c_backtrace_header);
6319 if (got_depth > skip) {
6322 bfd_init(); /* Is this safe to call multiple times? */
6323 Zero(&bfd_ctx, 1, bfd_context);
6326 Zero(&atos_ctx, 1, atos_context);
6328 for (i = skip; i < try_depth; i++) {
6329 Dl_info* dl_info = &dl_infos[i];
6331 object_name_sizes[i] = 0;
6332 source_names[i] = NULL;
6333 source_name_sizes[i] = 0;
6334 source_lines[i] = 0;
6336 /* Yes, zero from dladdr() is failure. */
6337 if (dladdr(raw_frames[i], dl_info)) {
6338 total_bytes += sizeof(Perl_c_backtrace_frame);
6340 object_name_sizes[i] =
6341 dl_info->dli_fname ? strlen(dl_info->dli_fname) : 0;
6342 symbol_name_sizes[i] =
6343 dl_info->dli_sname ? strlen(dl_info->dli_sname) : 0;
6345 bfd_update(&bfd_ctx, dl_info);
6346 bfd_symbolize(&bfd_ctx, raw_frames[i],
6348 &symbol_name_sizes[i],
6350 &source_name_sizes[i],
6354 atos_update(&atos_ctx, dl_info);
6355 atos_symbolize(&atos_ctx,
6358 &source_name_sizes[i],
6362 /* Plus ones for the terminating \0. */
6363 total_bytes += object_name_sizes[i] + 1;
6364 total_bytes += symbol_name_sizes[i] + 1;
6365 total_bytes += source_name_sizes[i] + 1;
6373 Safefree(bfd_ctx.bfd_syms);
6377 /* Now we can allocate and populate the result buffer. */
6378 Newxc(bt, total_bytes, char, Perl_c_backtrace);
6379 Zero(bt, total_bytes, char);
6380 bt->header.frame_count = frame_count;
6381 bt->header.total_bytes = total_bytes;
6382 if (frame_count > 0) {
6383 Perl_c_backtrace_frame* frame = bt->frame_info;
6384 char* name_base = (char *)(frame + frame_count);
6385 char* name_curr = name_base; /* Outputting the name strings here. */
6387 for (i = skip; i < skip + frame_count; i++) {
6388 Dl_info* dl_info = &dl_infos[i];
6390 frame->addr = raw_frames[i];
6391 frame->object_base_addr = dl_info->dli_fbase;
6392 frame->symbol_addr = dl_info->dli_saddr;
6394 /* Copies a string, including the \0, and advances the name_curr.
6395 * Also copies the start and the size to the frame. */
6396 #define PERL_C_BACKTRACE_STRCPY(frame, doffset, src, dsize, size) \
6398 Copy(src, name_curr, size, char); \
6399 frame->doffset = name_curr - (char*)bt; \
6400 frame->dsize = size; \
6401 name_curr += size; \
6404 PERL_C_BACKTRACE_STRCPY(frame, object_name_offset,
6406 object_name_size, object_name_sizes[i]);
6409 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6411 symbol_name_size, symbol_name_sizes[i]);
6412 Safefree(symbol_names[i]);
6414 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6416 symbol_name_size, symbol_name_sizes[i]);
6419 PERL_C_BACKTRACE_STRCPY(frame, source_name_offset,
6421 source_name_size, source_name_sizes[i]);
6422 Safefree(source_names[i]);
6424 #undef PERL_C_BACKTRACE_STRCPY
6426 frame->source_line_number = source_lines[i];
6430 assert(total_bytes ==
6431 (UV)(sizeof(Perl_c_backtrace_header) +
6432 frame_count * sizeof(Perl_c_backtrace_frame) +
6433 name_curr - name_base));
6436 Safefree(symbol_names);
6438 bfd_close(bfd_ctx.abfd);
6441 Safefree(source_lines);
6442 Safefree(source_name_sizes);
6443 Safefree(source_names);
6444 Safefree(symbol_name_sizes);
6445 Safefree(object_name_sizes);
6446 /* Assuming the strings returned by dladdr() are pointers
6447 * to read-only static memory (the object file), so that
6448 * they do not need freeing (and cannot be). */
6450 Safefree(raw_frames);
6453 PERL_UNUSED_ARGV(depth);
6454 PERL_UNUSED_ARGV(skip);
6460 =for apidoc free_c_backtrace
6462 Deallocates a backtrace received from get_c_bracktrace.
6468 =for apidoc get_c_backtrace_dump
6470 Returns a SV containing a dump of C<depth> frames of the call stack, skipping
6471 the C<skip> innermost ones. C<depth> of 20 is usually enough.
6473 The appended output looks like:
6476 1 10e004812:0082 Perl_croak util.c:1716 /usr/bin/perl
6477 2 10df8d6d2:1d72 perl_parse perl.c:3975 /usr/bin/perl
6480 The fields are tab-separated. The first column is the depth (zero
6481 being the innermost non-skipped frame). In the hex:offset, the hex is
6482 where the program counter was in C<S_parse_body>, and the :offset (might
6483 be missing) tells how much inside the C<S_parse_body> the program counter was.
6485 The C<util.c:1716> is the source code file and line number.
6487 The F</usr/bin/perl> is obvious (hopefully).
6489 Unknowns are C<"-">. Unknowns can happen unfortunately quite easily:
6490 if the platform doesn't support retrieving the information;
6491 if the binary is missing the debug information;
6492 if the optimizer has transformed the code by for example inlining.
6498 Perl_get_c_backtrace_dump(pTHX_ int depth, int skip)
6500 Perl_c_backtrace* bt;
6502 bt = get_c_backtrace(depth, skip + 1 /* Hide ourselves. */);
6504 Perl_c_backtrace_frame* frame;
6505 SV* dsv = newSVpvs("");
6507 for (i = 0, frame = bt->frame_info;
6508 i < bt->header.frame_count; i++, frame++) {
6509 Perl_sv_catpvf(aTHX_ dsv, "%d", (int)i);
6510 Perl_sv_catpvf(aTHX_ dsv, "\t%p", frame->addr ? frame->addr : "-");
6511 /* Symbol (function) names might disappear without debug info.
6513 * The source code location might disappear in case of the
6514 * optimizer inlining or otherwise rearranging the code. */
6515 if (frame->symbol_addr) {
6516 Perl_sv_catpvf(aTHX_ dsv, ":%04x",
6518 ((char*)frame->addr - (char*)frame->symbol_addr));
6520 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6521 frame->symbol_name_size &&
6522 frame->symbol_name_offset ?
6523 (char*)bt + frame->symbol_name_offset : "-");
6524 if (frame->source_name_size &&
6525 frame->source_name_offset &&
6526 frame->source_line_number) {
6527 Perl_sv_catpvf(aTHX_ dsv, "\t%s:%" UVuf,
6528 (char*)bt + frame->source_name_offset,
6529 (UV)frame->source_line_number);
6531 Perl_sv_catpvf(aTHX_ dsv, "\t-");
6533 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6534 frame->object_name_size &&
6535 frame->object_name_offset ?
6536 (char*)bt + frame->object_name_offset : "-");
6537 /* The frame->object_base_addr is not output,
6538 * but it is used for symbolizing/symbolicating. */
6539 sv_catpvs(dsv, "\n");
6542 Perl_free_c_backtrace(bt);
6551 =for apidoc dump_c_backtrace
6553 Dumps the C backtrace to the given C<fp>.
6555 Returns true if a backtrace could be retrieved, false if not.
6561 Perl_dump_c_backtrace(pTHX_ PerlIO* fp, int depth, int skip)
6565 PERL_ARGS_ASSERT_DUMP_C_BACKTRACE;
6567 sv = Perl_get_c_backtrace_dump(aTHX_ depth, skip);
6570 PerlIO_printf(fp, "%s", SvPV_nolen(sv));
6576 #endif /* #ifdef USE_C_BACKTRACE */
6578 #ifdef PERL_TSA_ACTIVE
6580 /* pthread_mutex_t and perl_mutex are typedef equivalent
6581 * so casting the pointers is fine. */
6583 int perl_tsa_mutex_lock(perl_mutex* mutex)
6585 return pthread_mutex_lock((pthread_mutex_t *) mutex);
6588 int perl_tsa_mutex_unlock(perl_mutex* mutex)
6590 return pthread_mutex_unlock((pthread_mutex_t *) mutex);
6593 int perl_tsa_mutex_destroy(perl_mutex* mutex)
6595 return pthread_mutex_destroy((pthread_mutex_t *) mutex);
6603 /* log a sub call or return */
6606 Perl_dtrace_probe_call(pTHX_ CV *cv, bool is_call)
6614 PERL_ARGS_ASSERT_DTRACE_PROBE_CALL;
6617 HEK *hek = CvNAME_HEK(cv);
6618 func = HEK_KEY(hek);
6624 start = (const COP *)CvSTART(cv);
6625 file = CopFILE(start);
6626 line = CopLINE(start);
6627 stash = CopSTASHPV(start);
6630 PERL_SUB_ENTRY(func, file, line, stash);
6633 PERL_SUB_RETURN(func, file, line, stash);
6638 /* log a require file loading/loaded */
6641 Perl_dtrace_probe_load(pTHX_ const char *name, bool is_loading)
6643 PERL_ARGS_ASSERT_DTRACE_PROBE_LOAD;
6646 PERL_LOADING_FILE(name);
6649 PERL_LOADED_FILE(name);
6654 /* log an op execution */
6657 Perl_dtrace_probe_op(pTHX_ const OP *op)
6659 PERL_ARGS_ASSERT_DTRACE_PROBE_OP;
6661 PERL_OP_ENTRY(OP_NAME(op));
6665 /* log a compile/run phase change */
6668 Perl_dtrace_probe_phase(pTHX_ enum perl_phase phase)
6670 const char *ph_old = PL_phase_names[PL_phase];
6671 const char *ph_new = PL_phase_names[phase];
6673 PERL_PHASE_CHANGE(ph_new, ph_old);
6679 * ex: set ts=8 sts=4 sw=4 et: