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
138 if (size + PERL_MEMORY_DEBUG_HEADER_SIZE < size)
140 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
143 if ((SSize_t)size < 0)
144 Perl_croak_nocontext("panic: malloc, size=%" UVuf, (UV) size);
146 if (!size) size = 1; /* malloc(0) is NASTY on our system */
148 #ifdef PERL_DEBUG_READONLY_COW
149 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
150 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
151 perror("mmap failed");
155 ptr = (Malloc_t)PerlMem_malloc(size);
157 PERL_ALLOC_CHECK(ptr);
160 struct perl_memory_debug_header *const header
161 = (struct perl_memory_debug_header *)ptr;
165 PoisonNew(((char *)ptr), size, char);
168 #ifdef PERL_TRACK_MEMPOOL
169 header->interpreter = aTHX;
170 /* Link us into the list. */
171 header->prev = &PL_memory_debug_header;
172 header->next = PL_memory_debug_header.next;
173 PL_memory_debug_header.next = header;
174 maybe_protect_rw(header->next);
175 header->next->prev = header;
176 maybe_protect_ro(header->next);
177 # ifdef PERL_DEBUG_READONLY_COW
178 header->readonly = 0;
184 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
185 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
187 /* malloc() can modify errno() even on success, but since someone
188 writing perl code doesn't have any control over when perl calls
189 malloc() we need to hide that.
198 #ifndef ALWAYS_NEED_THX
210 /* paranoid version of system's realloc() */
213 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
215 #ifdef ALWAYS_NEED_THX
219 #ifdef PERL_DEBUG_READONLY_COW
220 const MEM_SIZE oldsize = where
221 ? ((struct perl_memory_debug_header *)((char *)where - PERL_MEMORY_DEBUG_HEADER_SIZE))->size
230 ptr = safesysmalloc(size);
235 where = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
236 if (size + PERL_MEMORY_DEBUG_HEADER_SIZE < size)
238 size += PERL_MEMORY_DEBUG_HEADER_SIZE;
240 struct perl_memory_debug_header *const header
241 = (struct perl_memory_debug_header *)where;
243 # ifdef PERL_TRACK_MEMPOOL
244 if (header->interpreter != aTHX) {
245 Perl_croak_nocontext("panic: realloc from wrong pool, %p!=%p",
246 header->interpreter, aTHX);
248 assert(header->next->prev == header);
249 assert(header->prev->next == header);
251 if (header->size > size) {
252 const MEM_SIZE freed_up = header->size - size;
253 char *start_of_freed = ((char *)where) + size;
254 PoisonFree(start_of_freed, freed_up, char);
264 if ((SSize_t)size < 0)
265 Perl_croak_nocontext("panic: realloc, size=%" UVuf, (UV)size);
267 #ifdef PERL_DEBUG_READONLY_COW
268 if ((ptr = mmap(0, size, PROT_READ|PROT_WRITE,
269 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
270 perror("mmap failed");
273 Copy(where,ptr,oldsize < size ? oldsize : size,char);
274 if (munmap(where, oldsize)) {
275 perror("munmap failed");
279 ptr = (Malloc_t)PerlMem_realloc(where,size);
281 PERL_ALLOC_CHECK(ptr);
283 /* MUST do this fixup first, before doing ANYTHING else, as anything else
284 might allocate memory/free/move memory, and until we do the fixup, it
285 may well be chasing (and writing to) free memory. */
287 #ifdef PERL_TRACK_MEMPOOL
288 struct perl_memory_debug_header *const header
289 = (struct perl_memory_debug_header *)ptr;
292 if (header->size < size) {
293 const MEM_SIZE fresh = size - header->size;
294 char *start_of_fresh = ((char *)ptr) + size;
295 PoisonNew(start_of_fresh, fresh, char);
299 maybe_protect_rw(header->next);
300 header->next->prev = header;
301 maybe_protect_ro(header->next);
302 maybe_protect_rw(header->prev);
303 header->prev->next = header;
304 maybe_protect_ro(header->prev);
306 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
308 /* realloc() can modify errno() even on success, but since someone
309 writing perl code doesn't have any control over when perl calls
310 realloc() we need to hide that.
315 /* In particular, must do that fixup above before logging anything via
316 *printf(), as it can reallocate memory, which can cause SEGVs. */
318 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
319 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
326 #ifndef ALWAYS_NEED_THX
339 /* safe version of system's free() */
342 Perl_safesysfree(Malloc_t where)
344 #ifdef ALWAYS_NEED_THX
347 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
350 Malloc_t where_intrn = (Malloc_t)((char*)where-PERL_MEMORY_DEBUG_HEADER_SIZE);
352 struct perl_memory_debug_header *const header
353 = (struct perl_memory_debug_header *)where_intrn;
356 const MEM_SIZE size = header->size;
358 # ifdef PERL_TRACK_MEMPOOL
359 if (header->interpreter != aTHX) {
360 Perl_croak_nocontext("panic: free from wrong pool, %p!=%p",
361 header->interpreter, aTHX);
364 Perl_croak_nocontext("panic: duplicate free");
367 Perl_croak_nocontext("panic: bad free, header->next==NULL");
368 if (header->next->prev != header || header->prev->next != header) {
369 Perl_croak_nocontext("panic: bad free, ->next->prev=%p, "
370 "header=%p, ->prev->next=%p",
371 header->next->prev, header,
374 /* Unlink us from the chain. */
375 maybe_protect_rw(header->next);
376 header->next->prev = header->prev;
377 maybe_protect_ro(header->next);
378 maybe_protect_rw(header->prev);
379 header->prev->next = header->next;
380 maybe_protect_ro(header->prev);
381 maybe_protect_rw(header);
383 PoisonNew(where_intrn, size, char);
385 /* Trigger the duplicate free warning. */
388 # ifdef PERL_DEBUG_READONLY_COW
389 if (munmap(where_intrn, size)) {
390 perror("munmap failed");
396 Malloc_t where_intrn = where;
398 #ifndef PERL_DEBUG_READONLY_COW
399 PerlMem_free(where_intrn);
404 /* safe version of system's calloc() */
407 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
409 #ifdef ALWAYS_NEED_THX
413 #if defined(USE_MDH) || defined(DEBUGGING)
414 MEM_SIZE total_size = 0;
417 /* Even though calloc() for zero bytes is strange, be robust. */
418 if (size && (count <= MEM_SIZE_MAX / size)) {
419 #if defined(USE_MDH) || defined(DEBUGGING)
420 total_size = size * count;
426 if (PERL_MEMORY_DEBUG_HEADER_SIZE <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
427 total_size += PERL_MEMORY_DEBUG_HEADER_SIZE;
432 if ((SSize_t)size < 0 || (SSize_t)count < 0)
433 Perl_croak_nocontext("panic: calloc, size=%" UVuf ", count=%" UVuf,
434 (UV)size, (UV)count);
436 #ifdef PERL_DEBUG_READONLY_COW
437 if ((ptr = mmap(0, total_size ? total_size : 1, PROT_READ|PROT_WRITE,
438 MAP_ANON|MAP_PRIVATE, -1, 0)) == MAP_FAILED) {
439 perror("mmap failed");
442 #elif defined(PERL_TRACK_MEMPOOL)
443 /* Have to use malloc() because we've added some space for our tracking
445 /* malloc(0) is non-portable. */
446 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
448 /* Use calloc() because it might save a memset() if the memory is fresh
449 and clean from the OS. */
451 ptr = (Malloc_t)PerlMem_calloc(count, size);
452 else /* calloc(0) is non-portable. */
453 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
455 PERL_ALLOC_CHECK(ptr);
456 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) calloc %zu x %zu = %zu bytes\n",PTR2UV(ptr),(long)PL_an++, count, size, total_size));
460 struct perl_memory_debug_header *const header
461 = (struct perl_memory_debug_header *)ptr;
463 # ifndef PERL_DEBUG_READONLY_COW
464 memset((void*)ptr, 0, total_size);
466 # ifdef PERL_TRACK_MEMPOOL
467 header->interpreter = aTHX;
468 /* Link us into the list. */
469 header->prev = &PL_memory_debug_header;
470 header->next = PL_memory_debug_header.next;
471 PL_memory_debug_header.next = header;
472 maybe_protect_rw(header->next);
473 header->next->prev = header;
474 maybe_protect_ro(header->next);
475 # ifdef PERL_DEBUG_READONLY_COW
476 header->readonly = 0;
480 header->size = total_size;
482 ptr = (Malloc_t)((char*)ptr+PERL_MEMORY_DEBUG_HEADER_SIZE);
488 #ifndef ALWAYS_NEED_THX
497 /* These must be defined when not using Perl's malloc for binary
502 Malloc_t Perl_malloc (MEM_SIZE nbytes)
504 #ifdef PERL_IMPLICIT_SYS
507 return (Malloc_t)PerlMem_malloc(nbytes);
510 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
512 #ifdef PERL_IMPLICIT_SYS
515 return (Malloc_t)PerlMem_calloc(elements, size);
518 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
520 #ifdef PERL_IMPLICIT_SYS
523 return (Malloc_t)PerlMem_realloc(where, nbytes);
526 Free_t Perl_mfree (Malloc_t where)
528 #ifdef PERL_IMPLICIT_SYS
536 /* copy a string up to some (non-backslashed) delimiter, if any.
537 * With allow_escape, converts \<delimiter> to <delimiter>, while leaves
538 * \<non-delimiter> as-is.
539 * Returns the position in the src string of the closing delimiter, if
540 * any, or returns fromend otherwise.
541 * This is the internal implementation for Perl_delimcpy and
542 * Perl_delimcpy_no_escape.
546 S_delimcpy_intern(char *to, const char *toend, const char *from,
547 const char *fromend, int delim, I32 *retlen,
548 const bool allow_escape)
552 PERL_ARGS_ASSERT_DELIMCPY;
554 for (tolen = 0; from < fromend; from++, tolen++) {
555 if (allow_escape && *from == '\\' && from + 1 < fromend) {
556 if (from[1] != delim) {
563 else if (*from == delim)
576 =for apidoc_section String Handling
577 =for apidoc delimcpy_no_escape
579 Copy a source buffer to a destination buffer, stopping at (but not including)
580 the first occurrence of the delimiter byte C<delim>, in the source. The source
581 is the bytes between C<from> and C<fromend> inclusive. The dest is C<to>
584 Nothing is copied beyond what fits between C<to> through C<toend>. If C<delim>
585 doesn't occur in the source buffer, as much of the source as will fit is copied
588 The actual number of bytes copied is written to C<*retlen>.
590 If there is room in the destination available after the copy, an extra
591 terminating safety NUL byte is written (not included in the returned length).
596 Perl_delimcpy_no_escape(char *to, const char *toend, const char *from,
597 const char *fromend, int delim, I32 *retlen)
599 const char * delim_pos;
600 Ptrdiff_t to_len = toend - to;
602 /* Only use the minimum of the available source/dest */
603 Ptrdiff_t copy_len = MIN(fromend - from, to_len);
605 PERL_ARGS_ASSERT_DELIMCPY_NO_ESCAPE;
607 assert(copy_len >= 0);
609 /* Look for the first delimiter in the portion of the source we are allowed
610 * to look at (determined by the input bounds). */
611 delim_pos = (const char *) memchr(from, delim, copy_len);
613 copy_len = delim_pos - from;
614 } /* else didn't find it: copy all of the source permitted */
616 Copy(from, to, copy_len, char);
622 /* If there is extra space available, add a trailing NUL */
623 if (copy_len < to_len) {
627 return (char *) from + copy_len;
631 Perl_delimcpy(char *to, const char *toend, const char *from, const char *fromend, int delim, I32 *retlen)
633 PERL_ARGS_ASSERT_DELIMCPY;
635 return S_delimcpy_intern(to, toend, from, fromend, delim, retlen, 1);
641 Find the first (leftmost) occurrence of a sequence of bytes within another
642 sequence. This is the Perl version of C<strstr()>, extended to handle
643 arbitrary sequences, potentially containing embedded C<NUL> characters (C<NUL>
644 is what the initial C<n> in the function name stands for; some systems have an
645 equivalent, C<memmem()>, but with a somewhat different API).
647 Another way of thinking about this function is finding a needle in a haystack.
648 C<big> points to the first byte in the haystack. C<big_end> points to one byte
649 beyond the final byte in the haystack. C<little> points to the first byte in
650 the needle. C<little_end> points to one byte beyond the final byte in the
651 needle. All the parameters must be non-C<NULL>.
653 The function returns C<NULL> if there is no occurrence of C<little> within
654 C<big>. If C<little> is the empty string, C<big> is returned.
656 Because this function operates at the byte level, and because of the inherent
657 characteristics of UTF-8 (or UTF-EBCDIC), it will work properly if both the
658 needle and the haystack are strings with the same UTF-8ness, but not if the
666 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
668 PERL_ARGS_ASSERT_NINSTR;
671 return ninstr(big, bigend, little, lend);
674 if (little >= lend) {
678 const U8 first = *little;
681 /* No match can start closer to the end of the haystack than the length
683 bigend -= lend - little;
684 little++; /* Look for 'first', then the remainder is in here */
685 lsize = lend - little;
687 while (big <= bigend) {
688 big = (char *) memchr((U8 *) big, first, bigend - big + 1);
689 if (big == NULL || big > bigend) {
693 if (memEQ(big + 1, little, lsize)) {
709 Like C<L</ninstr>>, but instead finds the final (rightmost) occurrence of a
710 sequence of bytes within another sequence, returning C<NULL> if there is no
718 Perl_rninstr(const char *big, const char *bigend, const char *little, const char *lend)
720 const Ptrdiff_t little_len = lend - little;
721 const Ptrdiff_t big_len = bigend - big;
723 PERL_ARGS_ASSERT_RNINSTR;
725 /* A non-existent needle trivially matches the rightmost possible position
727 if (UNLIKELY(little_len <= 0)) {
728 return (char*)bigend;
731 /* If the needle is larger than the haystack, the needle can't possibly fit
732 * inside the haystack. */
733 if (UNLIKELY(little_len > big_len)) {
737 /* Special case length 1 needles. It's trivial if we have memrchr();
738 * and otherwise we just do a per-byte search backwards.
740 * XXX When we don't have memrchr, we could use something like
741 * S_find_next_masked( or S_find_span_end() to do per-word searches */
742 if (little_len == 1) {
743 const char final = *little;
747 return (char *) memrchr(big, final, big_len);
749 const char * cur = bigend - 1;
755 } while (--cur >= big);
761 else { /* Below, the needle is longer than a single byte */
763 /* We search backwards in the haystack for the final character of the
764 * needle. Each time one is found, we see if the characters just
765 * before it in the haystack match the rest of the needle. */
766 const char final = *(lend - 1);
768 /* What matches consists of 'little_len'-1 characters, then the final
770 const Size_t prefix_len = little_len - 1;
772 /* If the final character in the needle is any closer than this to the
773 * left edge, there wouldn't be enough room for all of it to fit in the
775 const char * const left_fence = big + prefix_len;
777 /* Start at the right edge */
778 char * cur = (char *) bigend;
780 /* memrchr() makes the search easy (and fast); otherwise, look
781 * backwards byte-by-byte. */
786 cur = (char *) memrchr(left_fence, final, cur - left_fence);
793 if (cur < left_fence) {
797 while (*cur != final);
800 /* Here, we know that *cur is 'final'; see if the preceding bytes
801 * of the needle also match the corresponding haystack bytes */
802 if memEQ(cur - prefix_len, little, prefix_len) {
803 return cur - prefix_len;
805 } while (cur > left_fence);
811 /* As a space optimization, we do not compile tables for strings of length
812 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
813 special-cased in fbm_instr().
815 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
819 =for apidoc fbm_compile
821 Analyzes the string in order to make fast searches on it using C<fbm_instr()>
822 -- the Boyer-Moore algorithm.
828 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
835 PERL_ARGS_ASSERT_FBM_COMPILE;
837 if (isGV_with_GP(sv) || SvROK(sv))
843 if (flags & FBMcf_TAIL) {
844 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
845 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
846 if (mg && mg->mg_len >= 0)
849 if (!SvPOK(sv) || SvNIOKp(sv))
850 s = (U8*)SvPV_force_mutable(sv, len);
851 else s = (U8 *)SvPV_mutable(sv, len);
852 if (len == 0) /* TAIL might be on a zero-length string. */
854 SvUPGRADE(sv, SVt_PVMG);
858 /* add PERL_MAGIC_bm magic holding the FBM lookup table */
860 assert(!mg_find(sv, PERL_MAGIC_bm));
861 mg = sv_magicext(sv, NULL, PERL_MAGIC_bm, &PL_vtbl_bm, NULL, 0);
865 /* Shorter strings are special-cased in Perl_fbm_instr(), and don't use
867 const U8 mlen = (len>255) ? 255 : (U8)len;
868 const unsigned char *const sb = s + len - mlen; /* first char (maybe) */
871 Newx(table, 256, U8);
872 memset((void*)table, mlen, 256);
873 mg->mg_ptr = (char *)table;
876 s += len - 1; /* last char */
879 if (table[*s] == mlen)
885 BmUSEFUL(sv) = 100; /* Initial value */
886 ((XPVNV*)SvANY(sv))->xnv_u.xnv_bm_tail = cBOOL(flags & FBMcf_TAIL);
891 =for apidoc fbm_instr
893 Returns the location of the SV in the string delimited by C<big> and
894 C<bigend> (C<bigend>) is the char following the last char).
895 It returns C<NULL> if the string can't be found. The C<sv>
896 does not have to be C<fbm_compiled>, but the search will not be as fast
901 If SvTAIL(littlestr) is true, a fake "\n" was appended to the string
902 during FBM compilation due to FBMcf_TAIL in flags. It indicates that
903 the littlestr must be anchored to the end of bigstr (or to any \n if
906 E.g. The regex compiler would compile /abc/ to a littlestr of "abc",
907 while /abc$/ compiles to "abc\n" with SvTAIL() true.
909 A littlestr of "abc", !SvTAIL matches as /abc/;
910 a littlestr of "ab\n", SvTAIL matches as:
911 without FBMrf_MULTILINE: /ab\n?\z/
912 with FBMrf_MULTILINE: /ab\n/ || /ab\z/;
914 (According to Ilya from 1999; I don't know if this is still true, DAPM 2015):
915 "If SvTAIL is actually due to \Z or \z, this gives false positives
921 Perl_fbm_instr(pTHX_ unsigned char *big, unsigned char *bigend, SV *littlestr, U32 flags)
925 const unsigned char *little = (const unsigned char *)SvPV_const(littlestr,l);
926 STRLEN littlelen = l;
927 const I32 multiline = flags & FBMrf_MULTILINE;
928 bool valid = SvVALID(littlestr);
929 bool tail = valid ? cBOOL(SvTAIL(littlestr)) : FALSE;
931 PERL_ARGS_ASSERT_FBM_INSTR;
933 assert(bigend >= big);
935 if ((STRLEN)(bigend - big) < littlelen) {
937 && ((STRLEN)(bigend - big) == littlelen - 1)
939 || (*big == *little &&
940 memEQ((char *)big, (char *)little, littlelen - 1))))
945 switch (littlelen) { /* Special cases for 0, 1 and 2 */
947 return (char*)big; /* Cannot be SvTAIL! */
950 if (tail && !multiline) /* Anchor only! */
951 /* [-1] is safe because we know that bigend != big. */
952 return (char *) (bigend - (bigend[-1] == '\n'));
954 s = (unsigned char *)memchr((void*)big, *little, bigend-big);
958 return (char *) bigend;
962 if (tail && !multiline) {
963 /* a littlestr with SvTAIL must be of the form "X\n" (where X
964 * is a single char). It is anchored, and can only match
965 * "....X\n" or "....X" */
966 if (bigend[-2] == *little && bigend[-1] == '\n')
967 return (char*)bigend - 2;
968 if (bigend[-1] == *little)
969 return (char*)bigend - 1;
974 /* memchr() is likely to be very fast, possibly using whatever
975 * hardware support is available, such as checking a whole
976 * cache line in one instruction.
977 * So for a 2 char pattern, calling memchr() is likely to be
978 * faster than running FBM, or rolling our own. The previous
979 * version of this code was roll-your-own which typically
980 * only needed to read every 2nd char, which was good back in
981 * the day, but no longer.
983 unsigned char c1 = little[0];
984 unsigned char c2 = little[1];
986 /* *** for all this case, bigend points to the last char,
987 * not the trailing \0: this makes the conditions slightly
993 /* do a quick test for c1 before calling memchr();
994 * this avoids the expensive fn call overhead when
995 * there are lots of c1's */
996 if (LIKELY(*s != c1)) {
998 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
1005 /* failed; try searching for c2 this time; that way
1006 * we don't go pathologically slow when the string
1007 * consists mostly of c1's or vice versa.
1012 s = (unsigned char *)memchr((void*)s, c2, bigend - s + 1);
1016 return (char*)s - 1;
1020 /* c1, c2 the same */
1021 while (s < bigend) {
1030 s = (unsigned char *)memchr((void*)s, c1, bigend - s);
1031 if (!s || s >= bigend)
1038 /* failed to find 2 chars; try anchored match at end without
1040 if (tail && bigend[0] == little[0])
1041 return (char *)bigend;
1046 break; /* Only lengths 0 1 and 2 have special-case code. */
1049 if (tail && !multiline) { /* tail anchored? */
1050 s = bigend - littlelen;
1051 if (s >= big && bigend[-1] == '\n' && *s == *little
1052 /* Automatically of length > 2 */
1053 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
1055 return (char*)s; /* how sweet it is */
1058 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
1060 return (char*)s + 1; /* how sweet it is */
1066 /* not compiled; use Perl_ninstr() instead */
1067 char * const b = ninstr((char*)big,(char*)bigend,
1068 (char*)little, (char*)little + littlelen);
1070 assert(!tail); /* valid => FBM; tail only set on SvVALID SVs */
1074 /* Do actual FBM. */
1075 if (littlelen > (STRLEN)(bigend - big))
1079 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
1080 const unsigned char *oldlittle;
1084 --littlelen; /* Last char found by table lookup */
1086 s = big + littlelen;
1087 little += littlelen; /* last char */
1090 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
1091 const unsigned char lastc = *little;
1095 if ((tmp = table[*s])) {
1096 /* *s != lastc; earliest position it could match now is
1097 * tmp slots further on */
1098 if ((s += tmp) >= bigend)
1100 if (LIKELY(*s != lastc)) {
1102 s = (unsigned char *)memchr((void*)s, lastc, bigend - s);
1112 /* hand-rolled strncmp(): less expensive than calling the
1113 * real function (maybe???) */
1115 unsigned char * const olds = s;
1120 if (*--s == *--little)
1122 s = olds + 1; /* here we pay the price for failure */
1124 if (s < bigend) /* fake up continue to outer loop */
1134 && memEQ((char *)(bigend - littlelen),
1135 (char *)(oldlittle - littlelen), littlelen) )
1136 return (char*)bigend - littlelen;
1142 Perl_cntrl_to_mnemonic(const U8 c)
1144 /* Returns the mnemonic string that represents character 'c', if one
1145 * exists; NULL otherwise. The only ones that exist for the purposes of
1146 * this routine are a few control characters */
1149 case '\a': return "\\a";
1150 case '\b': return "\\b";
1151 case ESC_NATIVE: return "\\e";
1152 case '\f': return "\\f";
1153 case '\n': return "\\n";
1154 case '\r': return "\\r";
1155 case '\t': return "\\t";
1161 /* copy a string to a safe spot */
1164 =for apidoc_section String Handling
1167 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1168 string which is a duplicate of C<pv>. The size of the string is
1169 determined by C<strlen()>, which means it may not contain embedded C<NUL>
1170 characters and must have a trailing C<NUL>. To prevent memory leaks, the
1171 memory allocated for the new string needs to be freed when no longer needed.
1172 This can be done with the C<L</Safefree>> function, or
1173 L<C<SAVEFREEPV>|perlguts/SAVEFREEPV(p)>.
1175 On some platforms, Windows for example, all allocated memory owned by a thread
1176 is deallocated when that thread ends. So if you need that not to happen, you
1177 need to use the shared memory functions, such as C<L</savesharedpv>>.
1183 Perl_savepv(pTHX_ const char *pv)
1185 PERL_UNUSED_CONTEXT;
1190 const STRLEN pvlen = strlen(pv)+1;
1191 Newx(newaddr, pvlen, char);
1192 return (char*)memcpy(newaddr, pv, pvlen);
1196 /* same thing but with a known length */
1201 Perl's version of what C<strndup()> would be if it existed. Returns a
1202 pointer to a newly allocated string which is a duplicate of the first
1203 C<len> bytes from C<pv>, plus a trailing
1204 C<NUL> byte. The memory allocated for
1205 the new string can be freed with the C<Safefree()> function.
1207 On some platforms, Windows for example, all allocated memory owned by a thread
1208 is deallocated when that thread ends. So if you need that not to happen, you
1209 need to use the shared memory functions, such as C<L</savesharedpvn>>.
1215 Perl_savepvn(pTHX_ const char *pv, Size_t len)
1218 PERL_UNUSED_CONTEXT;
1220 Newx(newaddr,len+1,char);
1221 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1223 /* might not be null terminated */
1224 newaddr[len] = '\0';
1225 return (char *) CopyD(pv,newaddr,len,char);
1228 return (char *) ZeroD(newaddr,len+1,char);
1233 =for apidoc savesharedpv
1235 A version of C<savepv()> which allocates the duplicate string in memory
1236 which is shared between threads.
1241 Perl_savesharedpv(pTHX_ const char *pv)
1246 PERL_UNUSED_CONTEXT;
1251 pvlen = strlen(pv)+1;
1252 newaddr = (char*)PerlMemShared_malloc(pvlen);
1256 return (char*)memcpy(newaddr, pv, pvlen);
1260 =for apidoc savesharedpvn
1262 A version of C<savepvn()> which allocates the duplicate string in memory
1263 which is shared between threads. (With the specific difference that a C<NULL>
1264 pointer is not acceptable)
1269 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1271 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1273 PERL_UNUSED_CONTEXT;
1274 /* PERL_ARGS_ASSERT_SAVESHAREDPVN; */
1279 newaddr[len] = '\0';
1280 return (char*)memcpy(newaddr, pv, len);
1284 =for apidoc savesvpv
1286 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1287 the passed in SV using C<SvPV()>
1289 On some platforms, Windows for example, all allocated memory owned by a thread
1290 is deallocated when that thread ends. So if you need that not to happen, you
1291 need to use the shared memory functions, such as C<L</savesharedsvpv>>.
1297 Perl_savesvpv(pTHX_ SV *sv)
1300 const char * const pv = SvPV_const(sv, len);
1303 PERL_ARGS_ASSERT_SAVESVPV;
1306 Newx(newaddr,len,char);
1307 return (char *) CopyD(pv,newaddr,len,char);
1311 =for apidoc savesharedsvpv
1313 A version of C<savesharedpv()> which allocates the duplicate string in
1314 memory which is shared between threads.
1320 Perl_savesharedsvpv(pTHX_ SV *sv)
1323 const char * const pv = SvPV_const(sv, len);
1325 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1327 return savesharedpvn(pv, len);
1330 /* the SV for Perl_form() and mess() is not kept in an arena */
1338 if (PL_phase != PERL_PHASE_DESTRUCT)
1339 return newSVpvs_flags("", SVs_TEMP);
1344 /* Create as PVMG now, to avoid any upgrading later */
1346 Newxz(any, 1, XPVMG);
1347 SvFLAGS(sv) = SVt_PVMG;
1348 SvANY(sv) = (void*)any;
1350 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1355 #if defined(PERL_IMPLICIT_CONTEXT)
1357 Perl_form_nocontext(const char* pat, ...)
1362 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1363 va_start(args, pat);
1364 retval = vform(pat, &args);
1368 #endif /* PERL_IMPLICIT_CONTEXT */
1371 =for apidoc_section Display and Dump functions
1373 =for apidoc_item form_nocontext
1375 These take a sprintf-style format pattern and conventional
1376 (non-SV) arguments and return the formatted string.
1378 (char *) Perl_form(pTHX_ const char* pat, ...)
1380 can be used any place a string (char *) is required:
1382 char * s = Perl_form("%d.%d",major,minor);
1384 They use a single private buffer so if you want to format several strings you
1385 must explicitly copy the earlier strings away (and free the copies when you
1388 The two forms differ only in that C<form_nocontext> does not take a thread
1389 context (C<aTHX>) parameter, so is used in situations where the caller doesn't
1390 already have the thread context.
1393 Like C<L</form>> but but the arguments are an encapsulated argument list.
1399 Perl_form(pTHX_ const char* pat, ...)
1403 PERL_ARGS_ASSERT_FORM;
1404 va_start(args, pat);
1405 retval = vform(pat, &args);
1411 Perl_vform(pTHX_ const char *pat, va_list *args)
1413 SV * const sv = mess_alloc();
1414 PERL_ARGS_ASSERT_VFORM;
1415 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1421 =for apidoc_item mess_nocontext
1423 These take a sprintf-style format pattern and argument list, which are used to
1424 generate a string message. If the message does not end with a newline, then it
1425 will be extended with some indication of the current location in the code, as
1426 described for C<L</mess_sv>>.
1428 Normally, the resulting message is returned in a new mortal SV.
1429 But during global destruction a single SV may be shared between uses of
1432 The two forms differ only in that C<mess_nocontext> does not take a thread
1433 context (C<aTHX>) parameter, so is used in situations where the caller doesn't
1434 already have the thread context.
1439 #if defined(PERL_IMPLICIT_CONTEXT)
1441 Perl_mess_nocontext(const char *pat, ...)
1446 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1447 va_start(args, pat);
1448 retval = vmess(pat, &args);
1452 #endif /* PERL_IMPLICIT_CONTEXT */
1455 Perl_mess(pTHX_ const char *pat, ...)
1459 PERL_ARGS_ASSERT_MESS;
1460 va_start(args, pat);
1461 retval = vmess(pat, &args);
1467 Perl_closest_cop(pTHX_ const COP *cop, const OP *o, const OP *curop,
1470 /* Look for curop starting from o. cop is the last COP we've seen. */
1471 /* opnext means that curop is actually the ->op_next of the op we are
1474 PERL_ARGS_ASSERT_CLOSEST_COP;
1476 if (!o || !curop || (
1477 opnext ? o->op_next == curop && o->op_type != OP_SCOPE : o == curop
1481 if (o->op_flags & OPf_KIDS) {
1483 for (kid = cUNOPo->op_first; kid; kid = OpSIBLING(kid)) {
1486 /* If the OP_NEXTSTATE has been optimised away we can still use it
1487 * the get the file and line number. */
1489 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1490 cop = (const COP *)kid;
1492 /* Keep searching, and return when we've found something. */
1494 new_cop = closest_cop(cop, kid, curop, opnext);
1500 /* Nothing found. */
1508 Expands a message, intended for the user, to include an indication of
1509 the current location in the code, if the message does not already appear
1512 C<basemsg> is the initial message or object. If it is a reference, it
1513 will be used as-is and will be the result of this function. Otherwise it
1514 is used as a string, and if it already ends with a newline, it is taken
1515 to be complete, and the result of this function will be the same string.
1516 If the message does not end with a newline, then a segment such as C<at
1517 foo.pl line 37> will be appended, and possibly other clauses indicating
1518 the current state of execution. The resulting message will end with a
1521 Normally, the resulting message is returned in a new mortal SV.
1522 During global destruction a single SV may be shared between uses of this
1523 function. If C<consume> is true, then the function is permitted (but not
1524 required) to modify and return C<basemsg> instead of allocating a new SV.
1530 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1534 #if defined(USE_C_BACKTRACE) && defined(USE_C_BACKTRACE_ON_ERROR)
1538 /* The PERL_C_BACKTRACE_ON_WARN must be an integer of one or more. */
1539 if ((ws = PerlEnv_getenv("PERL_C_BACKTRACE_ON_ERROR"))
1540 && grok_atoUV(ws, &wi, NULL)
1541 && wi <= PERL_INT_MAX
1543 Perl_dump_c_backtrace(aTHX_ Perl_debug_log, (int)wi, 1);
1548 PERL_ARGS_ASSERT_MESS_SV;
1550 if (SvROK(basemsg)) {
1556 sv_setsv(sv, basemsg);
1561 if (SvPOK(basemsg) && consume) {
1566 sv_copypv(sv, basemsg);
1569 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1571 * Try and find the file and line for PL_op. This will usually be
1572 * PL_curcop, but it might be a cop that has been optimised away. We
1573 * can try to find such a cop by searching through the optree starting
1574 * from the sibling of PL_curcop.
1579 closest_cop(PL_curcop, OpSIBLING(PL_curcop), PL_op, FALSE);
1584 Perl_sv_catpvf(aTHX_ sv, " at %s line %" IVdf,
1585 OutCopFILE(cop), (IV)CopLINE(cop));
1588 /* Seems that GvIO() can be untrustworthy during global destruction. */
1589 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1590 && IoLINES(GvIOp(PL_last_in_gv)))
1593 const bool line_mode = (RsSIMPLE(PL_rs) &&
1594 *SvPV_const(PL_rs,l) == '\n' && l == 1);
1595 Perl_sv_catpvf(aTHX_ sv, ", <%" SVf "> %s %" IVdf,
1596 SVfARG(PL_last_in_gv == PL_argvgv
1598 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1599 line_mode ? "line" : "chunk",
1600 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1602 if (PL_phase == PERL_PHASE_DESTRUCT)
1603 sv_catpvs(sv, " during global destruction");
1604 sv_catpvs(sv, ".\n");
1612 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1613 argument list, respectively. These are used to generate a string message. If
1615 message does not end with a newline, then it will be extended with
1616 some indication of the current location in the code, as described for
1619 Normally, the resulting message is returned in a new mortal SV.
1620 During global destruction a single SV may be shared between uses of
1627 Perl_vmess(pTHX_ const char *pat, va_list *args)
1629 SV * const sv = mess_alloc();
1631 PERL_ARGS_ASSERT_VMESS;
1633 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1634 return mess_sv(sv, 1);
1638 Perl_write_to_stderr(pTHX_ SV* msv)
1643 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1645 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1646 && (io = GvIO(PL_stderrgv))
1647 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1648 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, SV_CONST(PRINT),
1649 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1651 PerlIO * const serr = Perl_error_log;
1653 do_print(msv, serr);
1654 (void)PerlIO_flush(serr);
1659 =for apidoc_section Warning and Dieing
1662 /* Common code used in dieing and warning */
1665 S_with_queued_errors(pTHX_ SV *ex)
1667 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1668 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1669 sv_catsv(PL_errors, ex);
1670 ex = sv_mortalcopy(PL_errors);
1671 SvCUR_set(PL_errors, 0);
1677 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1682 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1683 /* sv_2cv might call Perl_croak() or Perl_warner() */
1684 SV * const oldhook = *hook;
1686 if (!oldhook || oldhook == PERL_WARNHOOK_FATAL)
1692 cv = sv_2cv(oldhook, &stash, &gv, 0);
1694 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1704 exarg = newSVsv(ex);
1705 SvREADONLY_on(exarg);
1708 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1712 call_sv(MUTABLE_SV(cv), G_DISCARD);
1722 =for apidoc_item die_nocontext
1724 These ehave the same as L</croak_sv>, except for the return type.
1725 It should be used only where the C<OP *> return type is required.
1726 The functions never actually return.
1728 The two forms differ only in that C<die_nocontext> does not take a thread
1729 context (C<aTHX>) parameter, so is used in situations where the caller doesn't
1730 already have the thread context.
1735 /* silence __declspec(noreturn) warnings */
1736 MSVC_DIAG_IGNORE(4646 4645)
1738 Perl_die_sv(pTHX_ SV *baseex)
1740 PERL_ARGS_ASSERT_DIE_SV;
1743 NORETURN_FUNCTION_END;
1750 Behaves the same as L</croak>, except for the return type.
1751 It should be used only where the C<OP *> return type is required.
1752 The function never actually returns.
1757 #if defined(PERL_IMPLICIT_CONTEXT)
1759 /* silence __declspec(noreturn) warnings */
1760 MSVC_DIAG_IGNORE(4646 4645)
1762 Perl_die_nocontext(const char* pat, ...)
1766 va_start(args, pat);
1768 NOT_REACHED; /* NOTREACHED */
1770 NORETURN_FUNCTION_END;
1774 #endif /* PERL_IMPLICIT_CONTEXT */
1776 /* silence __declspec(noreturn) warnings */
1777 MSVC_DIAG_IGNORE(4646 4645)
1779 Perl_die(pTHX_ const char* pat, ...)
1782 va_start(args, pat);
1784 NOT_REACHED; /* NOTREACHED */
1786 NORETURN_FUNCTION_END;
1791 =for apidoc croak_sv
1793 This is an XS interface to Perl's C<die> function.
1795 C<baseex> is the error message or object. If it is a reference, it
1796 will be used as-is. Otherwise it is used as a string, and if it does
1797 not end with a newline then it will be extended with some indication of
1798 the current location in the code, as described for L</mess_sv>.
1800 The error message or object will be used as an exception, by default
1801 returning control to the nearest enclosing C<eval>, but subject to
1802 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1803 function never returns normally.
1805 To die with a simple string message, the L</croak> function may be
1812 Perl_croak_sv(pTHX_ SV *baseex)
1814 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1815 PERL_ARGS_ASSERT_CROAK_SV;
1816 invoke_exception_hook(ex, FALSE);
1823 This is an XS interface to Perl's C<die> function.
1825 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1826 argument list. These are used to generate a string message. If the
1827 message does not end with a newline, then it will be extended with
1828 some indication of the current location in the code, as described for
1831 The error message will be used as an exception, by default
1832 returning control to the nearest enclosing C<eval>, but subject to
1833 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1834 function never returns normally.
1836 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1837 (C<$@>) will be used as an error message or object instead of building an
1838 error message from arguments. If you want to throw a non-string object,
1839 or build an error message in an SV yourself, it is preferable to use
1840 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1846 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1848 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1849 invoke_exception_hook(ex, FALSE);
1855 =for apidoc_item croak_nocontext
1857 These are XS interfaces to Perl's C<die> function.
1859 They take a sprintf-style format pattern and argument list, which are used to
1860 generate a string message. If the message does not end with a newline, then it
1861 will be extended with some indication of the current location in the code, as
1862 described for C<L</mess_sv>>.
1864 The error message will be used as an exception, by default
1865 returning control to the nearest enclosing C<eval>, but subject to
1866 modification by a C<$SIG{__DIE__}> handler. In any case, these croak
1867 functions never return normally.
1869 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1870 (C<$@>) will be used as an error message or object instead of building an
1871 error message from arguments. If you want to throw a non-string object,
1872 or build an error message in an SV yourself, it is preferable to use
1873 the C<L</croak_sv>> function, which does not involve clobbering C<ERRSV>.
1875 The two forms differ only in that C<croak_nocontext> does not take a thread
1876 context (C<aTHX>) parameter. It is usually preferred as it takes up fewer
1877 bytes of code than plain C<Perl_croak>, and time is rarely a critical resource
1878 when you are about to throw an exception.
1883 #if defined(PERL_IMPLICIT_CONTEXT)
1885 Perl_croak_nocontext(const char *pat, ...)
1889 va_start(args, pat);
1891 NOT_REACHED; /* NOTREACHED */
1894 #endif /* PERL_IMPLICIT_CONTEXT */
1896 /* saves machine code for a common noreturn idiom typically used in Newx*() */
1897 GCC_DIAG_IGNORE_DECL(-Wunused-function);
1899 Perl_croak_memory_wrap(void)
1901 Perl_croak_nocontext("%s",PL_memory_wrap);
1903 GCC_DIAG_RESTORE_DECL;
1906 Perl_croak(pTHX_ const char *pat, ...)
1909 va_start(args, pat);
1911 NOT_REACHED; /* NOTREACHED */
1916 =for apidoc croak_no_modify
1918 This encapsulates a common reason for dying, generating terser object code than
1919 using the generic C<Perl_croak>. It is exactly equivalent to
1920 C<Perl_croak(aTHX_ "%s", PL_no_modify)> (which expands to something like
1921 "Modification of a read-only value attempted").
1923 Less code used on exception code paths reduces CPU cache pressure.
1929 Perl_croak_no_modify(void)
1931 Perl_croak_nocontext( "%s", PL_no_modify);
1934 /* does not return, used in util.c perlio.c and win32.c
1935 This is typically called when malloc returns NULL.
1938 Perl_croak_no_mem(void)
1942 int fd = PerlIO_fileno(Perl_error_log);
1944 SETERRNO(EBADF,RMS_IFI);
1946 /* Can't use PerlIO to write as it allocates memory */
1947 PERL_UNUSED_RESULT(PerlLIO_write(fd, PL_no_mem, sizeof(PL_no_mem)-1));
1952 /* does not return, used only in POPSTACK */
1954 Perl_croak_popstack(void)
1957 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");
1964 This is an XS interface to Perl's C<warn> function.
1966 C<baseex> is the error message or object. If it is a reference, it
1967 will be used as-is. Otherwise it is used as a string, and if it does
1968 not end with a newline then it will be extended with some indication of
1969 the current location in the code, as described for L</mess_sv>.
1971 The error message or object will by default be written to standard error,
1972 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1974 To warn with a simple string message, the L</warn> function may be
1981 Perl_warn_sv(pTHX_ SV *baseex)
1983 SV *ex = mess_sv(baseex, 0);
1984 PERL_ARGS_ASSERT_WARN_SV;
1985 if (!invoke_exception_hook(ex, TRUE))
1986 write_to_stderr(ex);
1992 This is an XS interface to Perl's C<warn> function.
1994 This is like C<L</warn>>, but C<args> are an encapsulated
1997 Unlike with L</vcroak>, C<pat> is not permitted to be null.
2003 Perl_vwarn(pTHX_ const char* pat, va_list *args)
2005 SV *ex = vmess(pat, args);
2006 PERL_ARGS_ASSERT_VWARN;
2007 if (!invoke_exception_hook(ex, TRUE))
2008 write_to_stderr(ex);
2013 =for apidoc_item warn_nocontext
2015 These are XS interfaces to Perl's C<warn> function.
2017 They take a sprintf-style format pattern and argument list, which are used to
2018 generate a string message. If the message does not end with a newline, then it
2019 will be extended with some indication of the current location in the code, as
2020 described for C<L</mess_sv>>.
2022 The error message or object will by default be written to standard error,
2023 but this is subject to modification by a C<$SIG{__WARN__}> handler.
2025 Unlike with C<L</croak>>, C<pat> is not permitted to be null.
2027 The two forms differ only in that C<warn_nocontext> does not take a thread
2028 context (C<aTHX>) parameter, so is used in situations where the caller doesn't
2029 already have the thread context.
2034 #if defined(PERL_IMPLICIT_CONTEXT)
2036 Perl_warn_nocontext(const char *pat, ...)
2040 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
2041 va_start(args, pat);
2045 #endif /* PERL_IMPLICIT_CONTEXT */
2048 Perl_warn(pTHX_ const char *pat, ...)
2051 PERL_ARGS_ASSERT_WARN;
2052 va_start(args, pat);
2059 =for apidoc_item warner_nocontext
2061 These output a warning of the specified category (or categories) given by
2062 C<err>, using the sprintf-style format pattern C<pat>, and argument list.
2064 C<err> must be one of the C<L</packWARN>>, C<packWARN2>, C<packWARN3>,
2065 C<packWARN4> macros populated with the appropriate number of warning
2066 categories. If any of the warning categories they specify is fatal, a fatal
2067 exception is thrown.
2069 In any event a message is generated by the pattern and arguments. If the
2070 message does not end with a newline, then it will be extended with some
2071 indication of the current location in the code, as described for L</mess_sv>.
2073 The error message or object will by default be written to standard error,
2074 but this is subject to modification by a C<$SIG{__WARN__}> handler.
2076 C<pat> is not permitted to be null.
2078 The two forms differ only in that C<warner_nocontext> does not take a thread
2079 context (C<aTHX>) parameter, so is used in situations where the caller doesn't
2080 already have the thread context.
2082 These functions differ from the similarly named C<L</warn>> functions, in that
2083 the latter are for XS code to unconditionally display a warning, whereas these
2084 are for code that may be compiling a perl program, and does extra checking to
2085 see if the warning should be fatal.
2087 =for apidoc ck_warner
2088 =for apidoc_item ck_warner_d
2089 If none of the warning categories given by C<err> are enabled, do nothing;
2090 otherwise call C<L</warner>> or C<L</warner_nocontext>> with the passed-in
2093 C<err> must be one of the C<L</packWARN>>, C<packWARN2>, C<packWARN3>,
2094 C<packWARN4> macros populated with the appropriate number of warning
2097 The two forms differ only in that C<ck_warner_d> should be used if warnings for
2098 any of the categories are by default enabled.
2101 This is like C<L</warner>>, but C<args> are an encapsulated argument list.
2106 #if defined(PERL_IMPLICIT_CONTEXT)
2108 Perl_warner_nocontext(U32 err, const char *pat, ...)
2112 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
2113 va_start(args, pat);
2114 vwarner(err, pat, &args);
2117 #endif /* PERL_IMPLICIT_CONTEXT */
2120 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
2122 PERL_ARGS_ASSERT_CK_WARNER_D;
2124 if (Perl_ckwarn_d(aTHX_ err)) {
2126 va_start(args, pat);
2127 vwarner(err, pat, &args);
2133 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
2135 PERL_ARGS_ASSERT_CK_WARNER;
2137 if (Perl_ckwarn(aTHX_ err)) {
2139 va_start(args, pat);
2140 vwarner(err, pat, &args);
2146 Perl_warner(pTHX_ U32 err, const char* pat,...)
2149 PERL_ARGS_ASSERT_WARNER;
2150 va_start(args, pat);
2151 vwarner(err, pat, &args);
2156 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
2158 PERL_ARGS_ASSERT_VWARNER;
2160 (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) &&
2161 !(PL_in_eval & EVAL_KEEPERR)
2163 SV * const msv = vmess(pat, args);
2165 if (PL_parser && PL_parser->error_count) {
2169 invoke_exception_hook(msv, FALSE);
2174 Perl_vwarn(aTHX_ pat, args);
2178 /* implements the ckWARN? macros */
2181 Perl_ckwarn(pTHX_ U32 w)
2183 /* If lexical warnings have not been set, use $^W. */
2185 return PL_dowarn & G_WARN_ON;
2187 return ckwarn_common(w);
2190 /* implements the ckWARN?_d macro */
2193 Perl_ckwarn_d(pTHX_ U32 w)
2195 /* If lexical warnings have not been set then default classes warn. */
2199 return ckwarn_common(w);
2203 S_ckwarn_common(pTHX_ U32 w)
2205 if (PL_curcop->cop_warnings == pWARN_ALL)
2208 if (PL_curcop->cop_warnings == pWARN_NONE)
2211 /* Check the assumption that at least the first slot is non-zero. */
2212 assert(unpackWARN1(w));
2214 /* Check the assumption that it is valid to stop as soon as a zero slot is
2216 if (!unpackWARN2(w)) {
2217 assert(!unpackWARN3(w));
2218 assert(!unpackWARN4(w));
2219 } else if (!unpackWARN3(w)) {
2220 assert(!unpackWARN4(w));
2223 /* Right, dealt with all the special cases, which are implemented as non-
2224 pointers, so there is a pointer to a real warnings mask. */
2226 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
2228 } while (w >>= WARNshift);
2233 /* Set buffer=NULL to get a new one. */
2235 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
2237 const MEM_SIZE len_wanted =
2238 sizeof(STRLEN) + (size > WARNsize ? size : WARNsize);
2239 PERL_UNUSED_CONTEXT;
2240 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
2243 (specialWARN(buffer) ?
2244 PerlMemShared_malloc(len_wanted) :
2245 PerlMemShared_realloc(buffer, len_wanted));
2247 Copy(bits, (buffer + 1), size, char);
2248 if (size < WARNsize)
2249 Zero((char *)(buffer + 1) + size, WARNsize - size, char);
2253 /* since we've already done strlen() for both nam and val
2254 * we can use that info to make things faster than
2255 * sprintf(s, "%s=%s", nam, val)
2257 #define my_setenv_format(s, nam, nlen, val, vlen) \
2258 Copy(nam, s, nlen, char); \
2260 Copy(val, s+(nlen+1), vlen, char); \
2261 *(s+(nlen+1+vlen)) = '\0'
2265 #ifdef USE_ENVIRON_ARRAY
2266 /* NB: VMS' my_setenv() is in vms.c */
2268 /* Configure doesn't test for HAS_SETENV yet, so decide based on platform.
2269 * For Solaris, setenv() and unsetenv() were introduced in Solaris 9, so
2270 * testing for HAS UNSETENV is sufficient.
2272 # if defined(__CYGWIN__)|| defined(__riscos__) || (defined(__sun) && defined(HAS_UNSETENV)) || defined(PERL_DARWIN)
2273 # define MY_HAS_SETENV
2276 /* small wrapper for use by Perl_my_setenv that mallocs, or reallocs if
2277 * 'current' is non-null, with up to three sizes that are added together.
2278 * It handles integer overflow.
2280 # ifndef MY_HAS_SETENV
2282 S_env_alloc(void *current, Size_t l1, Size_t l2, Size_t l3, Size_t size)
2285 Size_t sl, l = l1 + l2;
2297 ? safesysrealloc(current, sl)
2298 : safesysmalloc(sl);
2303 croak_memory_wrap();
2308 # if !defined(WIN32) && !defined(NETWARE)
2311 =for apidoc_section Utility Functions
2312 =for apidoc my_setenv
2314 A wrapper for the C library L<setenv(3)>. Don't use the latter, as the perl
2315 version has desirable safeguards
2321 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2323 # ifdef __amigaos4__
2324 amigaos4_obtain_environ(__FUNCTION__);
2327 # ifdef USE_ITHREADS
2328 /* only parent thread can modify process environment, so no need to use a
2330 if (PL_curinterp == aTHX)
2334 # ifndef PERL_USE_SAFE_PUTENV
2335 if (!PL_use_safe_putenv) {
2336 /* most putenv()s leak, so we manipulate environ directly */
2338 Size_t vlen, nlen = strlen(nam);
2340 /* where does it go? */
2341 for (i = 0; environ[i]; i++) {
2342 if (strnEQ(environ[i], nam, nlen) && environ[i][nlen] == '=')
2346 if (environ == PL_origenviron) { /* need we copy environment? */
2351 while (environ[max])
2354 /* XXX shouldn't that be max+1 rather than max+2 ??? - DAPM */
2355 tmpenv = (char**)S_env_alloc(NULL, max, 2, 0, sizeof(char*));
2357 for (j=0; j<max; j++) { /* copy environment */
2358 const Size_t len = strlen(environ[j]);
2359 tmpenv[j] = S_env_alloc(NULL, len, 1, 0, 1);
2360 Copy(environ[j], tmpenv[j], len+1, char);
2364 environ = tmpenv; /* tell exec where it is now */
2368 safesysfree(environ[i]);
2369 while (environ[i]) {
2370 environ[i] = environ[i+1];
2373 # ifdef __amigaos4__
2380 if (!environ[i]) { /* does not exist yet */
2381 environ = (char**)S_env_alloc(environ, i, 2, 0, sizeof(char*));
2382 environ[i+1] = NULL; /* make sure it's null terminated */
2385 safesysfree(environ[i]);
2389 environ[i] = S_env_alloc(NULL, nlen, vlen, 2, 1);
2390 /* all that work just for this */
2391 my_setenv_format(environ[i], nam, nlen, val, vlen);
2395 # endif /* !PERL_USE_SAFE_PUTENV */
2397 # ifdef MY_HAS_SETENV
2398 # if defined(HAS_UNSETENV)
2400 (void)unsetenv(nam);
2402 (void)setenv(nam, val, 1);
2404 # else /* ! HAS_UNSETENV */
2405 (void)setenv(nam, val, 1);
2406 # endif /* HAS_UNSETENV */
2408 # elif defined(HAS_UNSETENV)
2411 if (environ) /* old glibc can crash with null environ */
2412 (void)unsetenv(nam);
2414 const Size_t nlen = strlen(nam);
2415 const Size_t vlen = strlen(val);
2416 char * const new_env = S_env_alloc(NULL, nlen, vlen, 2, 1);
2417 my_setenv_format(new_env, nam, nlen, val, vlen);
2418 (void)putenv(new_env);
2421 # else /* ! HAS_UNSETENV */
2424 const Size_t nlen = strlen(nam);
2430 new_env = S_env_alloc(NULL, nlen, vlen, 2, 1);
2431 /* all that work just for this */
2432 my_setenv_format(new_env, nam, nlen, val, vlen);
2433 (void)putenv(new_env);
2435 # endif /* MY_HAS_SETENV */
2437 # ifndef PERL_USE_SAFE_PUTENV
2442 # ifdef __amigaos4__
2444 amigaos4_release_environ(__FUNCTION__);
2448 # else /* WIN32 || NETWARE */
2451 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2454 const Size_t nlen = strlen(nam);
2461 envstr = S_env_alloc(NULL, nlen, vlen, 2, 1);
2462 my_setenv_format(envstr, nam, nlen, val, vlen);
2463 (void)PerlEnv_putenv(envstr);
2464 safesysfree(envstr);
2467 # endif /* WIN32 || NETWARE */
2469 #endif /* USE_ENVIRON_ARRAY */
2474 #ifdef UNLINK_ALL_VERSIONS
2476 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2480 PERL_ARGS_ASSERT_UNLNK;
2482 while (PerlLIO_unlink(f) >= 0)
2484 return retries ? 0 : -1;
2489 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2491 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(OS2) && !defined(VMS) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2499 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2501 PERL_FLUSHALL_FOR_CHILD;
2502 This = (*mode == 'w');
2506 taint_proper("Insecure %s%s", "EXEC");
2508 if (PerlProc_pipe_cloexec(p) < 0)
2510 /* Try for another pipe pair for error return */
2511 if (PerlProc_pipe_cloexec(pp) >= 0)
2513 while ((pid = PerlProc_fork()) < 0) {
2514 if (errno != EAGAIN) {
2515 PerlLIO_close(p[This]);
2516 PerlLIO_close(p[that]);
2518 PerlLIO_close(pp[0]);
2519 PerlLIO_close(pp[1]);
2523 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2532 /* Close parent's end of error status pipe (if any) */
2534 PerlLIO_close(pp[0]);
2535 /* Now dup our end of _the_ pipe to right position */
2536 if (p[THIS] != (*mode == 'r')) {
2537 PerlLIO_dup2(p[THIS], *mode == 'r');
2538 PerlLIO_close(p[THIS]);
2539 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2540 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2543 setfd_cloexec_or_inhexec_by_sysfdness(p[THIS]);
2544 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2546 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2547 /* No automatic close - do it by hand */
2554 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2560 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2567 PerlLIO_close(pp[1]);
2568 /* Keep the lower of the two fd numbers */
2569 if (p[that] < p[This]) {
2570 PerlLIO_dup2_cloexec(p[This], p[that]);
2571 PerlLIO_close(p[This]);
2575 PerlLIO_close(p[that]); /* close child's end of pipe */
2577 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2578 SvUPGRADE(sv,SVt_IV);
2580 PL_forkprocess = pid;
2581 /* If we managed to get status pipe check for exec fail */
2582 if (did_pipes && pid > 0) {
2584 unsigned read_total = 0;
2586 while (read_total < sizeof(int)) {
2587 const SSize_t n1 = PerlLIO_read(pp[0],
2588 (void*)(((char*)&errkid)+read_total),
2589 (sizeof(int)) - read_total);
2594 PerlLIO_close(pp[0]);
2596 if (read_total) { /* Error */
2598 PerlLIO_close(p[This]);
2599 if (read_total != sizeof(int))
2600 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", read_total);
2602 pid2 = wait4pid(pid, &status, 0);
2603 } while (pid2 == -1 && errno == EINTR);
2604 errno = errkid; /* Propagate errno from kid */
2609 PerlLIO_close(pp[0]);
2610 return PerlIO_fdopen(p[This], mode);
2612 # if defined(OS2) /* Same, without fork()ing and all extra overhead... */
2613 return my_syspopen4(aTHX_ NULL, mode, n, args);
2614 # elif defined(WIN32)
2615 return win32_popenlist(mode, n, args);
2617 Perl_croak(aTHX_ "List form of piped open not implemented");
2618 return (PerlIO *) NULL;
2623 /* VMS' my_popen() is in VMS.c, same with OS/2 and AmigaOS 4. */
2624 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
2626 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2632 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2636 PERL_ARGS_ASSERT_MY_POPEN;
2638 PERL_FLUSHALL_FOR_CHILD;
2641 return my_syspopen(aTHX_ cmd,mode);
2644 This = (*mode == 'w');
2646 if (doexec && TAINTING_get) {
2648 taint_proper("Insecure %s%s", "EXEC");
2650 if (PerlProc_pipe_cloexec(p) < 0)
2652 if (doexec && PerlProc_pipe_cloexec(pp) >= 0)
2654 while ((pid = PerlProc_fork()) < 0) {
2655 if (errno != EAGAIN) {
2656 PerlLIO_close(p[This]);
2657 PerlLIO_close(p[that]);
2659 PerlLIO_close(pp[0]);
2660 PerlLIO_close(pp[1]);
2663 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2666 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2676 PerlLIO_close(pp[0]);
2677 if (p[THIS] != (*mode == 'r')) {
2678 PerlLIO_dup2(p[THIS], *mode == 'r');
2679 PerlLIO_close(p[THIS]);
2680 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2681 PerlLIO_close(p[THAT]);
2684 setfd_cloexec_or_inhexec_by_sysfdness(p[THIS]);
2685 PerlLIO_close(p[THAT]);
2689 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2696 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2701 /* may or may not use the shell */
2702 do_exec3(cmd, pp[1], did_pipes);
2705 #endif /* defined OS2 */
2707 #ifdef PERLIO_USING_CRLF
2708 /* Since we circumvent IO layers when we manipulate low-level
2709 filedescriptors directly, need to manually switch to the
2710 default, binary, low-level mode; see PerlIOBuf_open(). */
2711 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2714 #ifdef PERL_USES_PL_PIDSTATUS
2715 hv_clear(PL_pidstatus); /* we have no children */
2722 PerlLIO_close(pp[1]);
2723 if (p[that] < p[This]) {
2724 PerlLIO_dup2_cloexec(p[This], p[that]);
2725 PerlLIO_close(p[This]);
2729 PerlLIO_close(p[that]);
2731 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2732 SvUPGRADE(sv,SVt_IV);
2734 PL_forkprocess = pid;
2735 if (did_pipes && pid > 0) {
2739 while (n < sizeof(int)) {
2740 const SSize_t n1 = PerlLIO_read(pp[0],
2741 (void*)(((char*)&errkid)+n),
2747 PerlLIO_close(pp[0]);
2749 if (n) { /* Error */
2751 PerlLIO_close(p[This]);
2752 if (n != sizeof(int))
2753 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2755 pid2 = wait4pid(pid, &status, 0);
2756 } while (pid2 == -1 && errno == EINTR);
2757 errno = errkid; /* Propagate errno from kid */
2762 PerlLIO_close(pp[0]);
2763 return PerlIO_fdopen(p[This], mode);
2765 #elif defined(DJGPP)
2766 FILE *djgpp_popen();
2768 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2770 PERL_FLUSHALL_FOR_CHILD;
2771 /* Call system's popen() to get a FILE *, then import it.
2772 used 0 for 2nd parameter to PerlIO_importFILE;
2775 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2777 #elif defined(__LIBCATAMOUNT__)
2779 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2784 #endif /* !DOSISH */
2786 /* this is called in parent before the fork() */
2788 Perl_atfork_lock(void)
2789 #if defined(USE_ITHREADS)
2791 PERL_TSA_ACQUIRE(PL_perlio_mutex)
2794 PERL_TSA_ACQUIRE(PL_malloc_mutex)
2796 PERL_TSA_ACQUIRE(PL_op_mutex)
2799 #if defined(USE_ITHREADS)
2800 /* locks must be held in locking order (if any) */
2802 MUTEX_LOCK(&PL_perlio_mutex);
2805 MUTEX_LOCK(&PL_malloc_mutex);
2811 /* this is called in both parent and child after the fork() */
2813 Perl_atfork_unlock(void)
2814 #if defined(USE_ITHREADS)
2816 PERL_TSA_RELEASE(PL_perlio_mutex)
2819 PERL_TSA_RELEASE(PL_malloc_mutex)
2821 PERL_TSA_RELEASE(PL_op_mutex)
2824 #if defined(USE_ITHREADS)
2825 /* locks must be released in same order as in atfork_lock() */
2827 MUTEX_UNLOCK(&PL_perlio_mutex);
2830 MUTEX_UNLOCK(&PL_malloc_mutex);
2839 #if defined(HAS_FORK)
2841 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2846 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2847 * handlers elsewhere in the code */
2851 #elif defined(__amigaos4__)
2852 return amigaos_fork();
2854 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2855 Perl_croak_nocontext("fork() not available");
2857 #endif /* HAS_FORK */
2862 dup2(int oldfd, int newfd)
2864 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2867 PerlLIO_close(newfd);
2868 return fcntl(oldfd, F_DUPFD, newfd);
2870 #define DUP2_MAX_FDS 256
2871 int fdtmp[DUP2_MAX_FDS];
2877 PerlLIO_close(newfd);
2878 /* good enough for low fd's... */
2879 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2880 if (fdx >= DUP2_MAX_FDS) {
2888 PerlLIO_close(fdtmp[--fdx]);
2895 #ifdef HAS_SIGACTION
2898 =for apidoc_section Signals
2901 A wrapper for the C library L<signal(2)>. Don't use the latter, as the Perl
2902 version knows things that interact with the rest of the perl interpreter.
2908 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2910 struct sigaction act, oact;
2913 /* only "parent" interpreter can diddle signals */
2914 if (PL_curinterp != aTHX)
2915 return (Sighandler_t) SIG_ERR;
2918 act.sa_handler = handler;
2919 sigemptyset(&act.sa_mask);
2922 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2923 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2925 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2926 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2927 act.sa_flags |= SA_NOCLDWAIT;
2929 if (sigaction(signo, &act, &oact) == -1)
2930 return (Sighandler_t) SIG_ERR;
2932 return (Sighandler_t) oact.sa_handler;
2936 Perl_rsignal_state(pTHX_ int signo)
2938 struct sigaction oact;
2939 PERL_UNUSED_CONTEXT;
2941 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2942 return (Sighandler_t) SIG_ERR;
2944 return (Sighandler_t) oact.sa_handler;
2948 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2952 struct sigaction act;
2954 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2957 /* only "parent" interpreter can diddle signals */
2958 if (PL_curinterp != aTHX)
2962 act.sa_handler = handler;
2963 sigemptyset(&act.sa_mask);
2966 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2967 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2969 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2970 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2971 act.sa_flags |= SA_NOCLDWAIT;
2973 return sigaction(signo, &act, save);
2977 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2981 PERL_UNUSED_CONTEXT;
2983 /* only "parent" interpreter can diddle signals */
2984 if (PL_curinterp != aTHX)
2988 return sigaction(signo, save, (struct sigaction *)NULL);
2991 #else /* !HAS_SIGACTION */
2994 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2996 #if defined(USE_ITHREADS) && !defined(WIN32)
2997 /* only "parent" interpreter can diddle signals */
2998 if (PL_curinterp != aTHX)
2999 return (Sighandler_t) SIG_ERR;
3002 return PerlProc_signal(signo, handler);
3012 Perl_rsignal_state(pTHX_ int signo)
3014 Sighandler_t oldsig;
3016 #if defined(USE_ITHREADS) && !defined(WIN32)
3017 /* only "parent" interpreter can diddle signals */
3018 if (PL_curinterp != aTHX)
3019 return (Sighandler_t) SIG_ERR;
3023 oldsig = PerlProc_signal(signo, sig_trap);
3024 PerlProc_signal(signo, oldsig);
3026 PerlProc_kill(PerlProc_getpid(), signo);
3031 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3033 #if defined(USE_ITHREADS) && !defined(WIN32)
3034 /* only "parent" interpreter can diddle signals */
3035 if (PL_curinterp != aTHX)
3038 *save = PerlProc_signal(signo, handler);
3039 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
3043 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3045 #if defined(USE_ITHREADS) && !defined(WIN32)
3046 /* only "parent" interpreter can diddle signals */
3047 if (PL_curinterp != aTHX)
3050 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
3053 #endif /* !HAS_SIGACTION */
3054 #endif /* !PERL_MICRO */
3056 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
3057 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) && !defined(__LIBCATAMOUNT__) && !defined(__amigaos4__)
3059 Perl_my_pclose(pTHX_ PerlIO *ptr)
3067 const int fd = PerlIO_fileno(ptr);
3070 svp = av_fetch(PL_fdpid,fd,TRUE);
3071 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
3075 #if defined(USE_PERLIO)
3076 /* Find out whether the refcount is low enough for us to wait for the
3077 child proc without blocking. */
3078 should_wait = PerlIOUnix_refcnt(fd) == 1 && pid > 0;
3080 should_wait = pid > 0;
3084 if (pid == -1) { /* Opened by popen. */
3085 return my_syspclose(ptr);
3088 close_failed = (PerlIO_close(ptr) == EOF);
3090 if (should_wait) do {
3091 pid2 = wait4pid(pid, &status, 0);
3092 } while (pid2 == -1 && errno == EINTR);
3099 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
3103 #elif defined(__LIBCATAMOUNT__)
3105 Perl_my_pclose(pTHX_ PerlIO *ptr)
3109 #endif /* !DOSISH */
3111 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
3113 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
3116 PERL_ARGS_ASSERT_WAIT4PID;
3117 #ifdef PERL_USES_PL_PIDSTATUS
3119 /* PERL_USES_PL_PIDSTATUS is only defined when neither
3120 waitpid() nor wait4() is available, or on OS/2, which
3121 doesn't appear to support waiting for a progress group
3122 member, so we can only treat a 0 pid as an unknown child.
3129 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3130 pid, rather than a string form. */
3131 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3132 if (svp && *svp != &PL_sv_undef) {
3133 *statusp = SvIVX(*svp);
3134 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3142 hv_iterinit(PL_pidstatus);
3143 if ((entry = hv_iternext(PL_pidstatus))) {
3144 SV * const sv = hv_iterval(PL_pidstatus,entry);
3146 const char * const spid = hv_iterkey(entry,&len);
3148 assert (len == sizeof(Pid_t));
3149 memcpy((char *)&pid, spid, len);
3150 *statusp = SvIVX(sv);
3151 /* The hash iterator is currently on this entry, so simply
3152 calling hv_delete would trigger the lazy delete, which on
3153 aggregate does more work, because next call to hv_iterinit()
3154 would spot the flag, and have to call the delete routine,
3155 while in the meantime any new entries can't re-use that
3157 hv_iterinit(PL_pidstatus);
3158 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3165 # ifdef HAS_WAITPID_RUNTIME
3166 if (!HAS_WAITPID_RUNTIME)
3169 result = PerlProc_waitpid(pid,statusp,flags);
3172 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3173 result = wait4(pid,statusp,flags,NULL);
3176 #ifdef PERL_USES_PL_PIDSTATUS
3177 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3182 Perl_croak(aTHX_ "Can't do waitpid with flags");
3184 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3185 pidgone(result,*statusp);
3191 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3194 if (result < 0 && errno == EINTR) {
3196 errno = EINTR; /* reset in case a signal handler changed $! */
3200 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3202 #ifdef PERL_USES_PL_PIDSTATUS
3204 S_pidgone(pTHX_ Pid_t pid, int status)
3208 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3209 SvUPGRADE(sv,SVt_IV);
3210 SvIV_set(sv, status);
3218 int /* Cannot prototype with I32
3220 my_syspclose(PerlIO *ptr)
3223 Perl_my_pclose(pTHX_ PerlIO *ptr)
3226 /* Needs work for PerlIO ! */
3227 FILE * const f = PerlIO_findFILE(ptr);
3228 const I32 result = pclose(f);
3229 PerlIO_releaseFILE(ptr,f);
3237 Perl_my_pclose(pTHX_ PerlIO *ptr)
3239 /* Needs work for PerlIO ! */
3240 FILE * const f = PerlIO_findFILE(ptr);
3241 I32 result = djgpp_pclose(f);
3242 result = (result << 8) & 0xff00;
3243 PerlIO_releaseFILE(ptr,f);
3248 #define PERL_REPEATCPY_LINEAR 4
3250 Perl_repeatcpy(char *to, const char *from, I32 len, IV count)
3252 PERL_ARGS_ASSERT_REPEATCPY;
3257 croak_memory_wrap();
3260 memset(to, *from, count);
3263 IV items, linear, half;
3265 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3266 for (items = 0; items < linear; ++items) {
3267 const char *q = from;
3269 for (todo = len; todo > 0; todo--)
3274 while (items <= half) {
3275 IV size = items * len;
3276 memcpy(p, to, size);
3282 memcpy(p, to, (count - items) * len);
3288 Perl_same_dirent(pTHX_ const char *a, const char *b)
3290 char *fa = strrchr(a,'/');
3291 char *fb = strrchr(b,'/');
3294 SV * const tmpsv = sv_newmortal();
3296 PERL_ARGS_ASSERT_SAME_DIRENT;
3309 sv_setpvs(tmpsv, ".");
3311 sv_setpvn(tmpsv, a, fa - a);
3312 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3315 sv_setpvs(tmpsv, ".");
3317 sv_setpvn(tmpsv, b, fb - b);
3318 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3320 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3321 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3323 #endif /* !HAS_RENAME */
3326 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3327 const char *const *const search_ext, I32 flags)
3329 const char *xfound = NULL;
3330 char *xfailed = NULL;
3331 char tmpbuf[MAXPATHLEN];
3336 #if defined(DOSISH) && !defined(OS2)
3337 # define SEARCH_EXTS ".bat", ".cmd", NULL
3338 # define MAX_EXT_LEN 4
3341 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3342 # define MAX_EXT_LEN 4
3345 # define SEARCH_EXTS ".pl", ".com", NULL
3346 # define MAX_EXT_LEN 4
3348 /* additional extensions to try in each dir if scriptname not found */
3350 static const char *const exts[] = { SEARCH_EXTS };
3351 const char *const *const ext = search_ext ? search_ext : exts;
3352 int extidx = 0, i = 0;
3353 const char *curext = NULL;
3355 PERL_UNUSED_ARG(search_ext);
3356 # define MAX_EXT_LEN 0
3359 PERL_ARGS_ASSERT_FIND_SCRIPT;
3362 * If dosearch is true and if scriptname does not contain path
3363 * delimiters, search the PATH for scriptname.
3365 * If SEARCH_EXTS is also defined, will look for each
3366 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3367 * while searching the PATH.
3369 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3370 * proceeds as follows:
3371 * If DOSISH or VMSISH:
3372 * + look for ./scriptname{,.foo,.bar}
3373 * + search the PATH for scriptname{,.foo,.bar}
3376 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3377 * this will not look in '.' if it's not in the PATH)
3382 # ifdef ALWAYS_DEFTYPES
3383 len = strlen(scriptname);
3384 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3385 int idx = 0, deftypes = 1;
3388 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3391 int idx = 0, deftypes = 1;
3394 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3396 /* The first time through, just add SEARCH_EXTS to whatever we
3397 * already have, so we can check for default file types. */
3399 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3406 if ((strlen(tmpbuf) + strlen(scriptname)
3407 + MAX_EXT_LEN) >= sizeof tmpbuf)
3408 continue; /* don't search dir with too-long name */
3409 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3413 if (strEQ(scriptname, "-"))
3415 if (dosearch) { /* Look in '.' first. */
3416 const char *cur = scriptname;
3418 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3420 if (strEQ(ext[i++],curext)) {
3421 extidx = -1; /* already has an ext */
3426 DEBUG_p(PerlIO_printf(Perl_debug_log,
3427 "Looking for %s\n",cur));
3430 if (PerlLIO_stat(cur,&statbuf) >= 0
3431 && !S_ISDIR(statbuf.st_mode)) {
3440 if (cur == scriptname) {
3441 len = strlen(scriptname);
3442 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3444 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3447 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3448 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3453 if (dosearch && !strchr(scriptname, '/')
3455 && !strchr(scriptname, '\\')
3457 && (s = PerlEnv_getenv("PATH")))
3461 bufend = s + strlen(s);
3462 while (s < bufend) {
3466 && *s != ';'; len++, s++) {
3467 if (len < sizeof tmpbuf)
3470 if (len < sizeof tmpbuf)
3473 s = delimcpy_no_escape(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3478 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3479 continue; /* don't search dir with too-long name */
3482 && tmpbuf[len - 1] != '/'
3483 && tmpbuf[len - 1] != '\\'
3486 tmpbuf[len++] = '/';
3487 if (len == 2 && tmpbuf[0] == '.')
3489 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3493 len = strlen(tmpbuf);
3494 if (extidx > 0) /* reset after previous loop */
3498 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3499 retval = PerlLIO_stat(tmpbuf,&statbuf);
3500 if (S_ISDIR(statbuf.st_mode)) {
3504 } while ( retval < 0 /* not there */
3505 && extidx>=0 && ext[extidx] /* try an extension? */
3506 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3511 if (S_ISREG(statbuf.st_mode)
3512 && cando(S_IRUSR,TRUE,&statbuf)
3513 #if !defined(DOSISH)
3514 && cando(S_IXUSR,TRUE,&statbuf)
3518 xfound = tmpbuf; /* bingo! */
3522 xfailed = savepv(tmpbuf);
3527 if (!xfound && !seen_dot && !xfailed &&
3528 (PerlLIO_stat(scriptname,&statbuf) < 0
3529 || S_ISDIR(statbuf.st_mode)))
3531 seen_dot = 1; /* Disable message. */
3536 if (flags & 1) { /* do or die? */
3537 /* diag_listed_as: Can't execute %s */
3538 Perl_croak(aTHX_ "Can't %s %s%s%s",
3539 (xfailed ? "execute" : "find"),
3540 (xfailed ? xfailed : scriptname),
3541 (xfailed ? "" : " on PATH"),
3542 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3547 scriptname = xfound;
3549 return (scriptname ? savepv(scriptname) : NULL);
3552 #ifndef PERL_GET_CONTEXT_DEFINED
3555 Perl_get_context(void)
3557 #if defined(USE_ITHREADS)
3558 # ifdef OLD_PTHREADS_API
3560 int error = pthread_getspecific(PL_thr_key, &t);
3562 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3564 # elif defined(I_MACH_CTHREADS)
3565 return (void*)cthread_data(cthread_self());
3567 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3575 Perl_set_context(void *t)
3577 #if defined(USE_ITHREADS)
3579 PERL_ARGS_ASSERT_SET_CONTEXT;
3580 #if defined(USE_ITHREADS)
3581 # ifdef I_MACH_CTHREADS
3582 cthread_set_data(cthread_self(), t);
3585 const int error = pthread_setspecific(PL_thr_key, t);
3587 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3595 #endif /* !PERL_GET_CONTEXT_DEFINED */
3598 Perl_get_op_names(pTHX)
3600 PERL_UNUSED_CONTEXT;
3601 return (char **)PL_op_name;
3605 Perl_get_op_descs(pTHX)
3607 PERL_UNUSED_CONTEXT;
3608 return (char **)PL_op_desc;
3612 Perl_get_no_modify(pTHX)
3614 PERL_UNUSED_CONTEXT;
3615 return PL_no_modify;
3619 Perl_get_opargs(pTHX)
3621 PERL_UNUSED_CONTEXT;
3622 return (U32 *)PL_opargs;
3626 Perl_get_ppaddr(pTHX)
3628 PERL_UNUSED_CONTEXT;
3629 return (PPADDR_t*)PL_ppaddr;
3632 #ifndef HAS_GETENV_LEN
3634 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3636 char * const env_trans = PerlEnv_getenv(env_elem);
3637 PERL_UNUSED_CONTEXT;
3638 PERL_ARGS_ASSERT_GETENV_LEN;
3640 *len = strlen(env_trans);
3647 Perl_get_vtbl(pTHX_ int vtbl_id)
3649 PERL_UNUSED_CONTEXT;
3651 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3652 ? NULL : (MGVTBL*)PL_magic_vtables + vtbl_id;
3656 Perl_my_fflush_all(pTHX)
3658 #if defined(USE_PERLIO) || defined(FFLUSH_NULL)
3659 return PerlIO_flush(NULL);
3661 # if defined(HAS__FWALK)
3662 extern int fflush(FILE *);
3663 /* undocumented, unprototyped, but very useful BSDism */
3664 extern void _fwalk(int (*)(FILE *));
3668 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3670 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3671 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3672 # elif defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3673 open_max = sysconf(_SC_OPEN_MAX);
3674 # elif defined(FOPEN_MAX)
3675 open_max = FOPEN_MAX;
3676 # elif defined(OPEN_MAX)
3677 open_max = OPEN_MAX;
3678 # elif defined(_NFILE)
3683 for (i = 0; i < open_max; i++)
3684 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3685 STDIO_STREAM_ARRAY[i]._file < open_max &&
3686 STDIO_STREAM_ARRAY[i]._flag)
3687 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3691 SETERRNO(EBADF,RMS_IFI);
3698 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3700 if (ckWARN(WARN_IO)) {
3702 = gv && (isGV_with_GP(gv))
3705 const char * const direction = have == '>' ? "out" : "in";
3707 if (name && HEK_LEN(name))
3708 Perl_warner(aTHX_ packWARN(WARN_IO),
3709 "Filehandle %" HEKf " opened only for %sput",
3710 HEKfARG(name), direction);
3712 Perl_warner(aTHX_ packWARN(WARN_IO),
3713 "Filehandle opened only for %sput", direction);
3718 Perl_report_evil_fh(pTHX_ const GV *gv)
3720 const IO *io = gv ? GvIO(gv) : NULL;
3721 const PERL_BITFIELD16 op = PL_op->op_type;
3725 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3727 warn_type = WARN_CLOSED;
3731 warn_type = WARN_UNOPENED;
3734 if (ckWARN(warn_type)) {
3736 = gv && isGV_with_GP(gv) && GvENAMELEN(gv) ?
3737 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3738 const char * const pars =
3739 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3740 const char * const func =
3742 (op == OP_READLINE || op == OP_RCATLINE
3743 ? "readline" : /* "<HANDLE>" not nice */
3744 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3746 const char * const type =
3748 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3749 ? "socket" : "filehandle");
3750 const bool have_name = name && SvCUR(name);
3751 Perl_warner(aTHX_ packWARN(warn_type),
3752 "%s%s on %s %s%s%" SVf, func, pars, vile, type,
3753 have_name ? " " : "",
3754 SVfARG(have_name ? name : &PL_sv_no));
3755 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3757 aTHX_ packWARN(warn_type),
3758 "\t(Are you trying to call %s%s on dirhandle%s%" SVf "?)\n",
3759 func, pars, have_name ? " " : "",
3760 SVfARG(have_name ? name : &PL_sv_no)
3765 /* To workaround core dumps from the uninitialised tm_zone we get the
3766 * system to give us a reasonable struct to copy. This fix means that
3767 * strftime uses the tm_zone and tm_gmtoff values returned by
3768 * localtime(time()). That should give the desired result most of the
3769 * time. But probably not always!
3771 * This does not address tzname aspects of NETaa14816.
3776 # ifndef STRUCT_TM_HASZONE
3777 # define STRUCT_TM_HASZONE
3781 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3782 # ifndef HAS_TM_TM_ZONE
3783 # define HAS_TM_TM_ZONE
3788 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3790 #ifdef HAS_TM_TM_ZONE
3792 const struct tm* my_tm;
3793 PERL_UNUSED_CONTEXT;
3794 PERL_ARGS_ASSERT_INIT_TM;
3796 ENV_LOCALE_READ_LOCK;
3797 my_tm = localtime(&now);
3799 Copy(my_tm, ptm, 1, struct tm);
3800 ENV_LOCALE_READ_UNLOCK;
3802 PERL_UNUSED_CONTEXT;
3803 PERL_ARGS_ASSERT_INIT_TM;
3804 PERL_UNUSED_ARG(ptm);
3809 =for apidoc_section Time
3810 =for apidoc mini_mktime
3811 normalise S<C<struct tm>> values without the localtime() semantics (and
3812 overhead) of mktime().
3817 Perl_mini_mktime(struct tm *ptm)
3821 int month, mday, year, jday;
3822 int odd_cent, odd_year;
3824 PERL_ARGS_ASSERT_MINI_MKTIME;
3826 #define DAYS_PER_YEAR 365
3827 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3828 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3829 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3830 #define SECS_PER_HOUR (60*60)
3831 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3832 /* parentheses deliberately absent on these two, otherwise they don't work */
3833 #define MONTH_TO_DAYS 153/5
3834 #define DAYS_TO_MONTH 5/153
3835 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3836 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3837 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3838 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3841 * Year/day algorithm notes:
3843 * With a suitable offset for numeric value of the month, one can find
3844 * an offset into the year by considering months to have 30.6 (153/5) days,
3845 * using integer arithmetic (i.e., with truncation). To avoid too much
3846 * messing about with leap days, we consider January and February to be
3847 * the 13th and 14th month of the previous year. After that transformation,
3848 * we need the month index we use to be high by 1 from 'normal human' usage,
3849 * so the month index values we use run from 4 through 15.
3851 * Given that, and the rules for the Gregorian calendar (leap years are those
3852 * divisible by 4 unless also divisible by 100, when they must be divisible
3853 * by 400 instead), we can simply calculate the number of days since some
3854 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3855 * the days we derive from our month index, and adding in the day of the
3856 * month. The value used here is not adjusted for the actual origin which
3857 * it normally would use (1 January A.D. 1), since we're not exposing it.
3858 * We're only building the value so we can turn around and get the
3859 * normalised values for the year, month, day-of-month, and day-of-year.
3861 * For going backward, we need to bias the value we're using so that we find
3862 * the right year value. (Basically, we don't want the contribution of
3863 * March 1st to the number to apply while deriving the year). Having done
3864 * that, we 'count up' the contribution to the year number by accounting for
3865 * full quadracenturies (400-year periods) with their extra leap days, plus
3866 * the contribution from full centuries (to avoid counting in the lost leap
3867 * days), plus the contribution from full quad-years (to count in the normal
3868 * leap days), plus the leftover contribution from any non-leap years.
3869 * At this point, if we were working with an actual leap day, we'll have 0
3870 * days left over. This is also true for March 1st, however. So, we have
3871 * to special-case that result, and (earlier) keep track of the 'odd'
3872 * century and year contributions. If we got 4 extra centuries in a qcent,
3873 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3874 * Otherwise, we add back in the earlier bias we removed (the 123 from
3875 * figuring in March 1st), find the month index (integer division by 30.6),
3876 * and the remainder is the day-of-month. We then have to convert back to
3877 * 'real' months (including fixing January and February from being 14/15 in
3878 * the previous year to being in the proper year). After that, to get
3879 * tm_yday, we work with the normalised year and get a new yearday value for
3880 * January 1st, which we subtract from the yearday value we had earlier,
3881 * representing the date we've re-built. This is done from January 1
3882 * because tm_yday is 0-origin.
3884 * Since POSIX time routines are only guaranteed to work for times since the
3885 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3886 * applies Gregorian calendar rules even to dates before the 16th century
3887 * doesn't bother me. Besides, you'd need cultural context for a given
3888 * date to know whether it was Julian or Gregorian calendar, and that's
3889 * outside the scope for this routine. Since we convert back based on the
3890 * same rules we used to build the yearday, you'll only get strange results
3891 * for input which needed normalising, or for the 'odd' century years which
3892 * were leap years in the Julian calendar but not in the Gregorian one.
3893 * I can live with that.
3895 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3896 * that's still outside the scope for POSIX time manipulation, so I don't
3902 year = 1900 + ptm->tm_year;
3903 month = ptm->tm_mon;
3904 mday = ptm->tm_mday;
3910 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3911 yearday += month*MONTH_TO_DAYS + mday + jday;
3913 * Note that we don't know when leap-seconds were or will be,
3914 * so we have to trust the user if we get something which looks
3915 * like a sensible leap-second. Wild values for seconds will
3916 * be rationalised, however.
3918 if ((unsigned) ptm->tm_sec <= 60) {
3925 secs += 60 * ptm->tm_min;
3926 secs += SECS_PER_HOUR * ptm->tm_hour;
3928 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3929 /* got negative remainder, but need positive time */
3930 /* back off an extra day to compensate */
3931 yearday += (secs/SECS_PER_DAY)-1;
3932 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3935 yearday += (secs/SECS_PER_DAY);
3936 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3939 else if (secs >= SECS_PER_DAY) {
3940 yearday += (secs/SECS_PER_DAY);
3941 secs %= SECS_PER_DAY;
3943 ptm->tm_hour = secs/SECS_PER_HOUR;
3944 secs %= SECS_PER_HOUR;
3945 ptm->tm_min = secs/60;
3947 ptm->tm_sec += secs;
3948 /* done with time of day effects */
3950 * The algorithm for yearday has (so far) left it high by 428.
3951 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3952 * bias it by 123 while trying to figure out what year it
3953 * really represents. Even with this tweak, the reverse
3954 * translation fails for years before A.D. 0001.
3955 * It would still fail for Feb 29, but we catch that one below.
3957 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3958 yearday -= YEAR_ADJUST;
3959 year = (yearday / DAYS_PER_QCENT) * 400;
3960 yearday %= DAYS_PER_QCENT;
3961 odd_cent = yearday / DAYS_PER_CENT;
3962 year += odd_cent * 100;
3963 yearday %= DAYS_PER_CENT;
3964 year += (yearday / DAYS_PER_QYEAR) * 4;
3965 yearday %= DAYS_PER_QYEAR;
3966 odd_year = yearday / DAYS_PER_YEAR;
3968 yearday %= DAYS_PER_YEAR;
3969 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3974 yearday += YEAR_ADJUST; /* recover March 1st crock */
3975 month = yearday*DAYS_TO_MONTH;
3976 yearday -= month*MONTH_TO_DAYS;
3977 /* recover other leap-year adjustment */
3986 ptm->tm_year = year - 1900;
3988 ptm->tm_mday = yearday;
3989 ptm->tm_mon = month;
3993 ptm->tm_mon = month - 1;
3995 /* re-build yearday based on Jan 1 to get tm_yday */
3997 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3998 yearday += 14*MONTH_TO_DAYS + 1;
3999 ptm->tm_yday = jday - yearday;
4000 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
4004 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)
4009 =for apidoc_section Time
4010 =for apidoc my_strftime
4011 strftime(), but with a different API so that the return value is a pointer
4012 to the formatted result (which MUST be arranged to be FREED BY THE
4013 CALLER). This allows this function to increase the buffer size as needed,
4014 so that the caller doesn't have to worry about that.
4016 Note that yday and wday effectively are ignored by this function, as
4017 mini_mktime() overwrites them
4027 PERL_ARGS_ASSERT_MY_STRFTIME;
4029 init_tm(&mytm); /* XXX workaround - see init_tm() above */
4032 mytm.tm_hour = hour;
4033 mytm.tm_mday = mday;
4035 mytm.tm_year = year;
4036 mytm.tm_wday = wday;
4037 mytm.tm_yday = yday;
4038 mytm.tm_isdst = isdst;
4040 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
4041 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
4046 #ifdef HAS_TM_TM_GMTOFF
4047 mytm.tm_gmtoff = mytm2.tm_gmtoff;
4049 #ifdef HAS_TM_TM_ZONE
4050 mytm.tm_zone = mytm2.tm_zone;
4055 Newx(buf, buflen, char);
4057 GCC_DIAG_IGNORE_STMT(-Wformat-nonliteral); /* fmt checked by caller */
4058 len = strftime(buf, buflen, fmt, &mytm);
4059 GCC_DIAG_RESTORE_STMT;
4062 ** The following is needed to handle to the situation where
4063 ** tmpbuf overflows. Basically we want to allocate a buffer
4064 ** and try repeatedly. The reason why it is so complicated
4065 ** is that getting a return value of 0 from strftime can indicate
4066 ** one of the following:
4067 ** 1. buffer overflowed,
4068 ** 2. illegal conversion specifier, or
4069 ** 3. the format string specifies nothing to be returned(not
4070 ** an error). This could be because format is an empty string
4071 ** or it specifies %p that yields an empty string in some locale.
4072 ** If there is a better way to make it portable, go ahead by
4075 if (inRANGE(len, 1, buflen - 1) || (len == 0 && *fmt == '\0'))
4078 /* Possibly buf overflowed - try again with a bigger buf */
4079 const int fmtlen = strlen(fmt);
4080 int bufsize = fmtlen + buflen;
4082 Renew(buf, bufsize, char);
4085 GCC_DIAG_IGNORE_STMT(-Wformat-nonliteral); /* fmt checked by caller */
4086 buflen = strftime(buf, bufsize, fmt, &mytm);
4087 GCC_DIAG_RESTORE_STMT;
4089 if (inRANGE(buflen, 1, bufsize - 1))
4091 /* heuristic to prevent out-of-memory errors */
4092 if (bufsize > 100*fmtlen) {
4098 Renew(buf, bufsize, char);
4103 Perl_croak(aTHX_ "panic: no strftime");
4109 #define SV_CWD_RETURN_UNDEF \
4113 #define SV_CWD_ISDOT(dp) \
4114 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4115 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4118 =for apidoc_section Utility Functions
4120 =for apidoc getcwd_sv
4122 Fill C<sv> with current working directory
4127 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4128 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4129 * getcwd(3) if available
4130 * Comments from the original:
4131 * This is a faster version of getcwd. It's also more dangerous
4132 * because you might chdir out of a directory that you can't chdir
4136 Perl_getcwd_sv(pTHX_ SV *sv)
4141 PERL_ARGS_ASSERT_GETCWD_SV;
4145 char buf[MAXPATHLEN];
4147 /* Some getcwd()s automatically allocate a buffer of the given
4148 * size from the heap if they are given a NULL buffer pointer.
4149 * The problem is that this behaviour is not portable. */
4150 if (getcwd(buf, sizeof(buf) - 1)) {
4155 SV_CWD_RETURN_UNDEF;
4162 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4166 SvUPGRADE(sv, SVt_PV);
4168 if (PerlLIO_lstat(".", &statbuf) < 0) {
4169 SV_CWD_RETURN_UNDEF;
4172 orig_cdev = statbuf.st_dev;
4173 orig_cino = statbuf.st_ino;
4183 if (PerlDir_chdir("..") < 0) {
4184 SV_CWD_RETURN_UNDEF;
4186 if (PerlLIO_stat(".", &statbuf) < 0) {
4187 SV_CWD_RETURN_UNDEF;
4190 cdev = statbuf.st_dev;
4191 cino = statbuf.st_ino;
4193 if (odev == cdev && oino == cino) {
4196 if (!(dir = PerlDir_open("."))) {
4197 SV_CWD_RETURN_UNDEF;
4200 while ((dp = PerlDir_read(dir)) != NULL) {
4202 namelen = dp->d_namlen;
4204 namelen = strlen(dp->d_name);
4207 if (SV_CWD_ISDOT(dp)) {
4211 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4212 SV_CWD_RETURN_UNDEF;
4215 tdev = statbuf.st_dev;
4216 tino = statbuf.st_ino;
4217 if (tino == oino && tdev == odev) {
4223 SV_CWD_RETURN_UNDEF;
4226 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4227 SV_CWD_RETURN_UNDEF;
4230 SvGROW(sv, pathlen + namelen + 1);
4234 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4237 /* prepend current directory to the front */
4239 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4240 pathlen += (namelen + 1);
4242 #ifdef VOID_CLOSEDIR
4245 if (PerlDir_close(dir) < 0) {
4246 SV_CWD_RETURN_UNDEF;
4252 SvCUR_set(sv, pathlen);
4256 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4257 SV_CWD_RETURN_UNDEF;
4260 if (PerlLIO_stat(".", &statbuf) < 0) {
4261 SV_CWD_RETURN_UNDEF;
4264 cdev = statbuf.st_dev;
4265 cino = statbuf.st_ino;
4267 if (cdev != orig_cdev || cino != orig_cino) {
4268 Perl_croak(aTHX_ "Unstable directory path, "
4269 "current directory changed unexpectedly");
4282 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4283 # define EMULATE_SOCKETPAIR_UDP
4286 #ifdef EMULATE_SOCKETPAIR_UDP
4288 S_socketpair_udp (int fd[2]) {
4290 /* Fake a datagram socketpair using UDP to localhost. */
4291 int sockets[2] = {-1, -1};
4292 struct sockaddr_in addresses[2];
4294 Sock_size_t size = sizeof(struct sockaddr_in);
4295 unsigned short port;
4298 memset(&addresses, 0, sizeof(addresses));
4301 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4302 if (sockets[i] == -1)
4303 goto tidy_up_and_fail;
4305 addresses[i].sin_family = AF_INET;
4306 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4307 addresses[i].sin_port = 0; /* kernel choses port. */
4308 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4309 sizeof(struct sockaddr_in)) == -1)
4310 goto tidy_up_and_fail;
4313 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4314 for each connect the other socket to it. */
4317 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4319 goto tidy_up_and_fail;
4320 if (size != sizeof(struct sockaddr_in))
4321 goto abort_tidy_up_and_fail;
4322 /* !1 is 0, !0 is 1 */
4323 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4324 sizeof(struct sockaddr_in)) == -1)
4325 goto tidy_up_and_fail;
4328 /* Now we have 2 sockets connected to each other. I don't trust some other
4329 process not to have already sent a packet to us (by random) so send
4330 a packet from each to the other. */
4333 /* I'm going to send my own port number. As a short.
4334 (Who knows if someone somewhere has sin_port as a bitfield and needs
4335 this routine. (I'm assuming crays have socketpair)) */
4336 port = addresses[i].sin_port;
4337 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4338 if (got != sizeof(port)) {
4340 goto tidy_up_and_fail;
4341 goto abort_tidy_up_and_fail;
4345 /* Packets sent. I don't trust them to have arrived though.
4346 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4347 connect to localhost will use a second kernel thread. In 2.6 the
4348 first thread running the connect() returns before the second completes,
4349 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4350 returns 0. Poor programs have tripped up. One poor program's authors'
4351 had a 50-1 reverse stock split. Not sure how connected these were.)
4352 So I don't trust someone not to have an unpredictable UDP stack.
4356 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4357 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4361 FD_SET((unsigned int)sockets[0], &rset);
4362 FD_SET((unsigned int)sockets[1], &rset);
4364 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4365 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4366 || !FD_ISSET(sockets[1], &rset)) {
4367 /* I hope this is portable and appropriate. */
4369 goto tidy_up_and_fail;
4370 goto abort_tidy_up_and_fail;
4374 /* And the paranoia department even now doesn't trust it to have arrive
4375 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4377 struct sockaddr_in readfrom;
4378 unsigned short buffer[2];
4383 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4384 sizeof(buffer), MSG_DONTWAIT,
4385 (struct sockaddr *) &readfrom, &size);
4387 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4389 (struct sockaddr *) &readfrom, &size);
4393 goto tidy_up_and_fail;
4394 if (got != sizeof(port)
4395 || size != sizeof(struct sockaddr_in)
4396 /* Check other socket sent us its port. */
4397 || buffer[0] != (unsigned short) addresses[!i].sin_port
4398 /* Check kernel says we got the datagram from that socket */
4399 || readfrom.sin_family != addresses[!i].sin_family
4400 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4401 || readfrom.sin_port != addresses[!i].sin_port)
4402 goto abort_tidy_up_and_fail;
4405 /* My caller (my_socketpair) has validated that this is non-NULL */
4408 /* I hereby declare this connection open. May God bless all who cross
4412 abort_tidy_up_and_fail:
4413 errno = ECONNABORTED;
4417 if (sockets[0] != -1)
4418 PerlLIO_close(sockets[0]);
4419 if (sockets[1] != -1)
4420 PerlLIO_close(sockets[1]);
4425 #endif /* EMULATE_SOCKETPAIR_UDP */
4427 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4429 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4430 /* Stevens says that family must be AF_LOCAL, protocol 0.
4431 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4436 struct sockaddr_in listen_addr;
4437 struct sockaddr_in connect_addr;
4442 || family != AF_UNIX
4445 errno = EAFNOSUPPORT;
4454 type &= ~SOCK_CLOEXEC;
4457 #ifdef EMULATE_SOCKETPAIR_UDP
4458 if (type == SOCK_DGRAM)
4459 return S_socketpair_udp(fd);
4462 aTHXa(PERL_GET_THX);
4463 listener = PerlSock_socket(AF_INET, type, 0);
4466 memset(&listen_addr, 0, sizeof(listen_addr));
4467 listen_addr.sin_family = AF_INET;
4468 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4469 listen_addr.sin_port = 0; /* kernel choses port. */
4470 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4471 sizeof(listen_addr)) == -1)
4472 goto tidy_up_and_fail;
4473 if (PerlSock_listen(listener, 1) == -1)
4474 goto tidy_up_and_fail;
4476 connector = PerlSock_socket(AF_INET, type, 0);
4477 if (connector == -1)
4478 goto tidy_up_and_fail;
4479 /* We want to find out the port number to connect to. */
4480 size = sizeof(connect_addr);
4481 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4483 goto tidy_up_and_fail;
4484 if (size != sizeof(connect_addr))
4485 goto abort_tidy_up_and_fail;
4486 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4487 sizeof(connect_addr)) == -1)
4488 goto tidy_up_and_fail;
4490 size = sizeof(listen_addr);
4491 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4494 goto tidy_up_and_fail;
4495 if (size != sizeof(listen_addr))
4496 goto abort_tidy_up_and_fail;
4497 PerlLIO_close(listener);
4498 /* Now check we are talking to ourself by matching port and host on the
4500 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4502 goto tidy_up_and_fail;
4503 if (size != sizeof(connect_addr)
4504 || listen_addr.sin_family != connect_addr.sin_family
4505 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4506 || listen_addr.sin_port != connect_addr.sin_port) {
4507 goto abort_tidy_up_and_fail;
4513 abort_tidy_up_and_fail:
4515 errno = ECONNABORTED; /* This would be the standard thing to do. */
4516 #elif defined(ECONNREFUSED)
4517 errno = ECONNREFUSED; /* some OSes might not have ECONNABORTED. */
4519 errno = ETIMEDOUT; /* Desperation time. */
4525 PerlLIO_close(listener);
4526 if (connector != -1)
4527 PerlLIO_close(connector);
4529 PerlLIO_close(acceptor);
4535 /* In any case have a stub so that there's code corresponding
4536 * to the my_socketpair in embed.fnc. */
4538 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4539 #ifdef HAS_SOCKETPAIR
4540 return socketpair(family, type, protocol, fd);
4549 =for apidoc sv_nosharing
4551 Dummy routine which "shares" an SV when there is no sharing module present.
4552 Or "locks" it. Or "unlocks" it. In other
4553 words, ignores its single SV argument.
4554 Exists to avoid test for a C<NULL> function pointer and because it could
4555 potentially warn under some level of strict-ness.
4561 Perl_sv_nosharing(pTHX_ SV *sv)
4563 PERL_UNUSED_CONTEXT;
4564 PERL_UNUSED_ARG(sv);
4569 =for apidoc sv_destroyable
4571 Dummy routine which reports that object can be destroyed when there is no
4572 sharing module present. It ignores its single SV argument, and returns
4573 'true'. Exists to avoid test for a C<NULL> function pointer and because it
4574 could potentially warn under some level of strict-ness.
4580 Perl_sv_destroyable(pTHX_ SV *sv)
4582 PERL_UNUSED_CONTEXT;
4583 PERL_UNUSED_ARG(sv);
4588 Perl_parse_unicode_opts(pTHX_ const char **popt)
4590 const char *p = *popt;
4593 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
4597 const char* endptr = p + strlen(p);
4599 if (grok_atoUV(p, &uv, &endptr) && uv <= U32_MAX) {
4602 if (p && *p && *p != '\n' && *p != '\r') {
4604 goto the_end_of_the_opts_parser;
4606 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4610 Perl_croak(aTHX_ "Invalid number '%s' for -C option.\n", p);
4616 case PERL_UNICODE_STDIN:
4617 opt |= PERL_UNICODE_STDIN_FLAG; break;
4618 case PERL_UNICODE_STDOUT:
4619 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4620 case PERL_UNICODE_STDERR:
4621 opt |= PERL_UNICODE_STDERR_FLAG; break;
4622 case PERL_UNICODE_STD:
4623 opt |= PERL_UNICODE_STD_FLAG; break;
4624 case PERL_UNICODE_IN:
4625 opt |= PERL_UNICODE_IN_FLAG; break;
4626 case PERL_UNICODE_OUT:
4627 opt |= PERL_UNICODE_OUT_FLAG; break;
4628 case PERL_UNICODE_INOUT:
4629 opt |= PERL_UNICODE_INOUT_FLAG; break;
4630 case PERL_UNICODE_LOCALE:
4631 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4632 case PERL_UNICODE_ARGV:
4633 opt |= PERL_UNICODE_ARGV_FLAG; break;
4634 case PERL_UNICODE_UTF8CACHEASSERT:
4635 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
4637 if (*p != '\n' && *p != '\r') {
4638 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
4641 "Unknown Unicode option letter '%c'", *p);
4648 opt = PERL_UNICODE_DEFAULT_FLAGS;
4650 the_end_of_the_opts_parser:
4652 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4653 Perl_croak(aTHX_ "Unknown Unicode option value %" UVuf,
4654 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4662 # include <starlet.h>
4669 * This is really just a quick hack which grabs various garbage
4670 * values. It really should be a real hash algorithm which
4671 * spreads the effect of every input bit onto every output bit,
4672 * if someone who knows about such things would bother to write it.
4673 * Might be a good idea to add that function to CORE as well.
4674 * No numbers below come from careful analysis or anything here,
4675 * except they are primes and SEED_C1 > 1E6 to get a full-width
4676 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4677 * probably be bigger too.
4680 # define SEED_C1 1000003
4681 #define SEED_C4 73819
4683 # define SEED_C1 25747
4684 #define SEED_C4 20639
4688 #define SEED_C5 26107
4690 #ifndef PERL_NO_DEV_RANDOM
4694 #ifdef HAS_GETTIMEOFDAY
4695 struct timeval when;
4700 /* This test is an escape hatch, this symbol isn't set by Configure. */
4701 #ifndef PERL_NO_DEV_RANDOM
4702 #ifndef PERL_RANDOM_DEVICE
4703 /* /dev/random isn't used by default because reads from it will block
4704 * if there isn't enough entropy available. You can compile with
4705 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4706 * is enough real entropy to fill the seed. */
4707 # ifdef __amigaos4__
4708 # define PERL_RANDOM_DEVICE "RANDOM:SIZE=4"
4710 # define PERL_RANDOM_DEVICE "/dev/urandom"
4713 fd = PerlLIO_open_cloexec(PERL_RANDOM_DEVICE, 0);
4715 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4723 #ifdef HAS_GETTIMEOFDAY
4724 PerlProc_gettimeofday(&when,NULL);
4725 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4728 u = (U32)SEED_C1 * when;
4730 u += SEED_C3 * (U32)PerlProc_getpid();
4731 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4732 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4733 u += SEED_C5 * (U32)PTR2UV(&when);
4739 Perl_get_hash_seed(pTHX_ unsigned char * const seed_buffer)
4741 #ifndef NO_PERL_HASH_ENV
4746 PERL_ARGS_ASSERT_GET_HASH_SEED;
4748 #ifndef NO_PERL_HASH_ENV
4749 env_pv= PerlEnv_getenv("PERL_HASH_SEED");
4753 /* ignore leading spaces */
4754 while (isSPACE(*env_pv))
4756 # ifdef USE_PERL_PERTURB_KEYS
4757 /* if they set it to "0" we disable key traversal randomization completely */
4758 if (strEQ(env_pv,"0")) {
4759 PL_hash_rand_bits_enabled= 0;
4761 /* otherwise switch to deterministic mode */
4762 PL_hash_rand_bits_enabled= 2;
4765 /* ignore a leading 0x... if it is there */
4766 if (env_pv[0] == '0' && env_pv[1] == 'x')
4769 for( i = 0; isXDIGIT(*env_pv) && i < PERL_HASH_SEED_BYTES; i++ ) {
4770 seed_buffer[i] = READ_XDIGIT(env_pv) << 4;
4771 if ( isXDIGIT(*env_pv)) {
4772 seed_buffer[i] |= READ_XDIGIT(env_pv);
4775 while (isSPACE(*env_pv))
4778 if (*env_pv && !isXDIGIT(*env_pv)) {
4779 Perl_warn(aTHX_ "perl: warning: Non hex character in '$ENV{PERL_HASH_SEED}', seed only partially set\n");
4781 /* should we check for unparsed crap? */
4782 /* should we warn about unused hex? */
4783 /* should we warn about insufficient hex? */
4786 #endif /* NO_PERL_HASH_ENV */
4788 for( i = 0; i < PERL_HASH_SEED_BYTES; i++ ) {
4789 seed_buffer[i] = (unsigned char)(Perl_internal_drand48() * (U8_MAX+1));
4792 #ifdef USE_PERL_PERTURB_KEYS
4793 { /* initialize PL_hash_rand_bits from the hash seed.
4794 * This value is highly volatile, it is updated every
4795 * hash insert, and is used as part of hash bucket chain
4796 * randomization and hash iterator randomization. */
4797 PL_hash_rand_bits= 0xbe49d17f; /* I just picked a number */
4798 for( i = 0; i < sizeof(UV) ; i++ ) {
4799 PL_hash_rand_bits += seed_buffer[i % PERL_HASH_SEED_BYTES];
4800 PL_hash_rand_bits = ROTL_UV(PL_hash_rand_bits,8);
4803 # ifndef NO_PERL_HASH_ENV
4804 env_pv= PerlEnv_getenv("PERL_PERTURB_KEYS");
4806 if (strEQ(env_pv,"0") || strEQ(env_pv,"NO")) {
4807 PL_hash_rand_bits_enabled= 0;
4808 } else if (strEQ(env_pv,"1") || strEQ(env_pv,"RANDOM")) {
4809 PL_hash_rand_bits_enabled= 1;
4810 } else if (strEQ(env_pv,"2") || strEQ(env_pv,"DETERMINISTIC")) {
4811 PL_hash_rand_bits_enabled= 2;
4813 Perl_warn(aTHX_ "perl: warning: strange setting in '$ENV{PERL_PERTURB_KEYS}': '%s'\n", env_pv);
4822 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including
4823 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
4824 * given, and you supply your own implementation.
4826 * The default implementation reads a single env var, PERL_MEM_LOG,
4827 * expecting one or more of the following:
4829 * \d+ - fd fd to write to : must be 1st (grok_atoUV)
4830 * 'm' - memlog was PERL_MEM_LOG=1
4831 * 's' - svlog was PERL_SV_LOG=1
4832 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
4834 * This makes the logger controllable enough that it can reasonably be
4835 * added to the system perl.
4838 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
4839 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
4841 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
4843 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
4844 * writes to. In the default logger, this is settable at runtime.
4846 #ifndef PERL_MEM_LOG_FD
4847 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
4850 #ifndef PERL_MEM_LOG_NOIMPL
4852 # ifdef DEBUG_LEAKING_SCALARS
4853 # define SV_LOG_SERIAL_FMT " [%lu]"
4854 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
4856 # define SV_LOG_SERIAL_FMT
4857 # define _SV_LOG_SERIAL_ARG(sv)
4861 S_mem_log_common(enum mem_log_type mlt, const UV n,
4862 const UV typesize, const char *type_name, const SV *sv,
4863 Malloc_t oldalloc, Malloc_t newalloc,
4864 const char *filename, const int linenumber,
4865 const char *funcname)
4869 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
4871 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
4874 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
4876 /* We can't use SVs or PerlIO for obvious reasons,
4877 * so we'll use stdio and low-level IO instead. */
4878 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
4880 # ifdef HAS_GETTIMEOFDAY
4881 # define MEM_LOG_TIME_FMT "%10d.%06d: "
4882 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
4884 gettimeofday(&tv, 0);
4886 # define MEM_LOG_TIME_FMT "%10d: "
4887 # define MEM_LOG_TIME_ARG (int)when
4891 /* If there are other OS specific ways of hires time than
4892 * gettimeofday() (see dist/Time-HiRes), the easiest way is
4893 * probably that they would be used to fill in the struct
4897 const char* endptr = pmlenv + strlen(pmlenv);
4900 if (grok_atoUV(pmlenv, &uv, &endptr) /* Ignore endptr. */
4901 && uv && uv <= PERL_INT_MAX
4905 fd = PERL_MEM_LOG_FD;
4908 if (strchr(pmlenv, 't')) {
4909 len = my_snprintf(buf, sizeof(buf),
4910 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
4911 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4915 len = my_snprintf(buf, sizeof(buf),
4916 "alloc: %s:%d:%s: %" IVdf " %" UVuf
4917 " %s = %" IVdf ": %" UVxf "\n",
4918 filename, linenumber, funcname, n, typesize,
4919 type_name, n * typesize, PTR2UV(newalloc));
4922 len = my_snprintf(buf, sizeof(buf),
4923 "realloc: %s:%d:%s: %" IVdf " %" UVuf
4924 " %s = %" IVdf ": %" UVxf " -> %" UVxf "\n",
4925 filename, linenumber, funcname, n, typesize,
4926 type_name, n * typesize, PTR2UV(oldalloc),
4930 len = my_snprintf(buf, sizeof(buf),
4931 "free: %s:%d:%s: %" UVxf "\n",
4932 filename, linenumber, funcname,
4937 len = my_snprintf(buf, sizeof(buf),
4938 "%s_SV: %s:%d:%s: %" UVxf SV_LOG_SERIAL_FMT "\n",
4939 mlt == MLT_NEW_SV ? "new" : "del",
4940 filename, linenumber, funcname,
4941 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
4946 PERL_UNUSED_RESULT(PerlLIO_write(fd, buf, len));
4950 #endif /* !PERL_MEM_LOG_NOIMPL */
4952 #ifndef PERL_MEM_LOG_NOIMPL
4954 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
4955 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
4957 /* this is suboptimal, but bug compatible. User is providing their
4958 own implementation, but is getting these functions anyway, and they
4959 do nothing. But _NOIMPL users should be able to cope or fix */
4961 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
4962 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
4966 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
4968 const char *filename, const int linenumber,
4969 const char *funcname)
4971 PERL_ARGS_ASSERT_MEM_LOG_ALLOC;
4973 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
4974 NULL, NULL, newalloc,
4975 filename, linenumber, funcname);
4980 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
4981 Malloc_t oldalloc, Malloc_t newalloc,
4982 const char *filename, const int linenumber,
4983 const char *funcname)
4985 PERL_ARGS_ASSERT_MEM_LOG_REALLOC;
4987 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
4988 NULL, oldalloc, newalloc,
4989 filename, linenumber, funcname);
4994 Perl_mem_log_free(Malloc_t oldalloc,
4995 const char *filename, const int linenumber,
4996 const char *funcname)
4998 PERL_ARGS_ASSERT_MEM_LOG_FREE;
5000 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5001 filename, linenumber, funcname);
5006 Perl_mem_log_new_sv(const SV *sv,
5007 const char *filename, const int linenumber,
5008 const char *funcname)
5010 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5011 filename, linenumber, funcname);
5015 Perl_mem_log_del_sv(const SV *sv,
5016 const char *filename, const int linenumber,
5017 const char *funcname)
5019 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5020 filename, linenumber, funcname);
5023 #endif /* PERL_MEM_LOG */
5026 =for apidoc_section String Handling
5027 =for apidoc quadmath_format_valid
5029 C<quadmath_snprintf()> is very strict about its C<format> string and will
5030 fail, returning -1, if the format is invalid. It accepts exactly
5033 C<quadmath_format_valid()> checks that the intended single spec looks
5034 sane: begins with C<%>, has only one C<%>, ends with C<[efgaEFGA]>,
5035 and has C<Q> before it. This is not a full "printf syntax check",
5038 Returns true if it is valid, false if not.
5040 See also L</quadmath_format_needed>.
5046 Perl_quadmath_format_valid(const char* format)
5050 PERL_ARGS_ASSERT_QUADMATH_FORMAT_VALID;
5052 if (format[0] != '%' || strchr(format + 1, '%'))
5054 len = strlen(format);
5055 /* minimum length three: %Qg */
5056 if (len < 3 || memCHRs("efgaEFGA", format[len - 1]) == NULL)
5058 if (format[len - 2] != 'Q')
5065 =for apidoc quadmath_format_needed
5067 C<quadmath_format_needed()> returns true if the C<format> string seems to
5068 contain at least one non-Q-prefixed C<%[efgaEFGA]> format specifier,
5069 or returns false otherwise.
5071 The format specifier detection is not complete printf-syntax detection,
5072 but it should catch most common cases.
5074 If true is returned, those arguments B<should> in theory be processed
5075 with C<quadmath_snprintf()>, but in case there is more than one such
5076 format specifier (see L</quadmath_format_valid>), and if there is
5077 anything else beyond that one (even just a single byte), they
5078 B<cannot> be processed because C<quadmath_snprintf()> is very strict,
5079 accepting only one format spec, and nothing else.
5080 In this case, the code should probably fail.
5086 Perl_quadmath_format_needed(const char* format)
5088 const char *p = format;
5091 PERL_ARGS_ASSERT_QUADMATH_FORMAT_NEEDED;
5093 while ((q = strchr(p, '%'))) {
5095 if (*q == '+') /* plus */
5097 if (*q == '#') /* alt */
5099 if (*q == '*') /* width */
5103 while (isDIGIT(*q)) q++;
5106 if (*q == '.' && (q[1] == '*' || isDIGIT(q[1]))) { /* prec */
5111 while (isDIGIT(*q)) q++;
5113 if (memCHRs("efgaEFGA", *q)) /* Would have needed 'Q' in front. */
5122 =for apidoc my_snprintf
5124 The C library C<snprintf> functionality, if available and
5125 standards-compliant (uses C<vsnprintf>, actually). However, if the
5126 C<vsnprintf> is not available, will unfortunately use the unsafe
5127 C<vsprintf> which can overrun the buffer (there is an overrun check,
5128 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5129 getting C<vsnprintf>.
5134 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5138 PERL_ARGS_ASSERT_MY_SNPRINTF;
5139 #ifndef HAS_VSNPRINTF
5140 PERL_UNUSED_VAR(len);
5142 va_start(ap, format);
5145 bool quadmath_valid = FALSE;
5146 if (quadmath_format_valid(format)) {
5147 /* If the format looked promising, use it as quadmath. */
5148 retval = quadmath_snprintf(buffer, len, format, va_arg(ap, NV));
5150 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", format);
5152 quadmath_valid = TRUE;
5154 /* quadmath_format_single() will return false for example for
5155 * "foo = %g", or simply "%g". We could handle the %g by
5156 * using quadmath for the NV args. More complex cases of
5157 * course exist: "foo = %g, bar = %g", or "foo=%Qg" (otherwise
5158 * quadmath-valid but has stuff in front).
5160 * Handling the "Q-less" cases right would require walking
5161 * through the va_list and rewriting the format, calling
5162 * quadmath for the NVs, building a new va_list, and then
5163 * letting vsnprintf/vsprintf to take care of the other
5164 * arguments. This may be doable.
5166 * We do not attempt that now. But for paranoia, we here try
5167 * to detect some common (but not all) cases where the
5168 * "Q-less" %[efgaEFGA] formats are present, and die if
5169 * detected. This doesn't fix the problem, but it stops the
5170 * vsnprintf/vsprintf pulling doubles off the va_list when
5171 * __float128 NVs should be pulled off instead.
5173 * If quadmath_format_needed() returns false, we are reasonably
5174 * certain that we can call vnsprintf() or vsprintf() safely. */
5175 if (!quadmath_valid && quadmath_format_needed(format))
5176 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", format);
5181 #ifdef HAS_VSNPRINTF
5182 retval = vsnprintf(buffer, len, format, ap);
5184 retval = vsprintf(buffer, format, ap);
5187 /* vsprintf() shows failure with < 0 */
5189 #ifdef HAS_VSNPRINTF
5190 /* vsnprintf() shows failure with >= len */
5192 (len > 0 && (Size_t)retval >= len)
5195 Perl_croak_nocontext("panic: my_snprintf buffer overflow");
5200 =for apidoc my_vsnprintf
5202 The C library C<vsnprintf> if available and standards-compliant.
5203 However, if the C<vsnprintf> is not available, will unfortunately
5204 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5205 overrun check, but that may be too late). Consider using
5206 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5211 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5214 PERL_UNUSED_ARG(buffer);
5215 PERL_UNUSED_ARG(len);
5216 PERL_UNUSED_ARG(format);
5217 /* the cast is to avoid gcc -Wsizeof-array-argument complaining */
5218 PERL_UNUSED_ARG((void*)ap);
5219 Perl_croak_nocontext("panic: my_vsnprintf not available with quadmath");
5226 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5227 Perl_va_copy(ap, apc);
5228 # ifdef HAS_VSNPRINTF
5229 retval = vsnprintf(buffer, len, format, apc);
5231 PERL_UNUSED_ARG(len);
5232 retval = vsprintf(buffer, format, apc);
5236 # ifdef HAS_VSNPRINTF
5237 retval = vsnprintf(buffer, len, format, ap);
5239 PERL_UNUSED_ARG(len);
5240 retval = vsprintf(buffer, format, ap);
5242 #endif /* #ifdef NEED_VA_COPY */
5243 /* vsprintf() shows failure with < 0 */
5245 #ifdef HAS_VSNPRINTF
5246 /* vsnprintf() shows failure with >= len */
5248 (len > 0 && (Size_t)retval >= len)
5251 Perl_croak_nocontext("panic: my_vsnprintf buffer overflow");
5257 Perl_my_clearenv(pTHX)
5259 #if ! defined(PERL_MICRO)
5260 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5262 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5263 # if defined(USE_ENVIRON_ARRAY)
5264 # if defined(USE_ITHREADS)
5265 /* only the parent thread can clobber the process environment, so no need
5267 if (PL_curinterp == aTHX)
5268 # endif /* USE_ITHREADS */
5270 # if ! defined(PERL_USE_SAFE_PUTENV)
5271 if ( !PL_use_safe_putenv) {
5273 if (environ == PL_origenviron)
5274 environ = (char**)safesysmalloc(sizeof(char*));
5276 for (i = 0; environ[i]; i++)
5277 (void)safesysfree(environ[i]);
5280 # else /* PERL_USE_SAFE_PUTENV */
5281 # if defined(HAS_CLEARENV)
5283 # elif defined(HAS_UNSETENV)
5284 int bsiz = 80; /* Most envvar names will be shorter than this. */
5285 char *buf = (char*)safesysmalloc(bsiz);
5286 while (*environ != NULL) {
5287 char *e = strchr(*environ, '=');
5288 int l = e ? e - *environ : (int)strlen(*environ);
5290 (void)safesysfree(buf);
5291 bsiz = l + 1; /* + 1 for the \0. */
5292 buf = (char*)safesysmalloc(bsiz);
5294 memcpy(buf, *environ, l);
5296 (void)unsetenv(buf);
5298 (void)safesysfree(buf);
5299 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5300 /* Just null environ and accept the leakage. */
5302 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5303 # endif /* ! PERL_USE_SAFE_PUTENV */
5305 # endif /* USE_ENVIRON_ARRAY */
5306 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5307 #endif /* PERL_MICRO */
5310 #ifdef PERL_IMPLICIT_CONTEXT
5313 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5314 the global PL_my_cxt_index is incremented, and that value is assigned to
5315 that module's static my_cxt_index (who's address is passed as an arg).
5316 Then, for each interpreter this function is called for, it makes sure a
5317 void* slot is available to hang the static data off, by allocating or
5318 extending the interpreter's PL_my_cxt_list array */
5321 Perl_my_cxt_init(pTHX_ int *indexp, size_t size)
5326 PERL_ARGS_ASSERT_MY_CXT_INIT;
5329 /* do initial check without locking.
5330 * -1: not allocated or another thread currently allocating
5331 * other: already allocated by another thread
5334 MUTEX_LOCK(&PL_my_ctx_mutex);
5335 /*now a stricter check with locking */
5338 /* this module hasn't been allocated an index yet */
5339 *indexp = PL_my_cxt_index++;
5341 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5344 /* make sure the array is big enough */
5345 if (PL_my_cxt_size <= index) {
5346 if (PL_my_cxt_size) {
5347 IV new_size = PL_my_cxt_size;
5348 while (new_size <= index)
5350 Renew(PL_my_cxt_list, new_size, void *);
5351 PL_my_cxt_size = new_size;
5354 PL_my_cxt_size = 16;
5355 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5358 /* newSV() allocates one more than needed */
5359 p = (void*)SvPVX(newSV(size-1));
5360 PL_my_cxt_list[index] = p;
5361 Zero(p, size, char);
5365 #endif /* PERL_IMPLICIT_CONTEXT */
5368 /* Perl_xs_handshake():
5369 implement the various XS_*_BOOTCHECK macros, which are added to .c
5370 files by ExtUtils::ParseXS, to check that the perl the module was built
5371 with is binary compatible with the running perl.
5374 Perl_xs_handshake(U32 key, void * v_my_perl, const char * file,
5375 [U32 items, U32 ax], [char * api_version], [char * xs_version])
5377 The meaning of the varargs is determined the U32 key arg (which is not
5378 a format string). The fields of key are assembled by using HS_KEY().
5380 Under PERL_IMPLICIT_CONTEX, the v_my_perl arg is of type
5381 "PerlInterpreter *" and represents the callers context; otherwise it is
5382 of type "CV *", and is the boot xsub's CV.
5384 v_my_perl will catch where a threaded future perl526.dll calling IO.dll
5385 for example, and IO.dll was linked with threaded perl524.dll, and both
5386 perl526.dll and perl524.dll are in %PATH and the Win32 DLL loader
5387 successfully can load IO.dll into the process but simultaneously it
5388 loaded an interpreter of a different version into the process, and XS
5389 code will naturally pass SV*s created by perl524.dll for perl526.dll to
5390 use through perl526.dll's my_perl->Istack_base.
5392 v_my_perl cannot be the first arg, since then 'key' will be out of
5393 place in a threaded vs non-threaded mixup; and analyzing the key
5394 number's bitfields won't reveal the problem, since it will be a valid
5395 key (unthreaded perl) on interp side, but croak will report the XS mod's
5396 key as gibberish (it is really a my_perl ptr) (threaded XS mod); or if
5397 it's a threaded perl and an unthreaded XS module, threaded perl will
5398 look at an uninit C stack or an uninit register to get 'key'
5399 (remember that it assumes that the 1st arg is the interp cxt).
5401 'file' is the source filename of the caller.
5405 Perl_xs_handshake(const U32 key, void * v_my_perl, const char * file, ...)
5411 #ifdef PERL_IMPLICIT_CONTEXT
5418 PERL_ARGS_ASSERT_XS_HANDSHAKE;
5419 va_start(args, file);
5421 got = INT2PTR(void*, (UV)(key & HSm_KEY_MATCH));
5422 need = (void *)(HS_KEY(FALSE, FALSE, "", "") & HSm_KEY_MATCH);
5423 if (UNLIKELY(got != need))
5425 /* try to catch where a 2nd threaded perl interp DLL is loaded into a process
5426 by a XS DLL compiled against the wrong interl DLL b/c of bad @INC, and the
5427 2nd threaded perl interp DLL never initialized its TLS/PERL_SYS_INIT3 so
5428 dTHX call from 2nd interp DLL can't return the my_perl that pp_entersub
5429 passed to the XS DLL */
5430 #ifdef PERL_IMPLICIT_CONTEXT
5431 xs_interp = (tTHX)v_my_perl;
5435 /* try to catch where an unthreaded perl interp DLL (for ex. perl522.dll) is
5436 loaded into a process by a XS DLL built by an unthreaded perl522.dll perl,
5437 but the DynaLoder/Perl that started the process and loaded the XS DLL is
5438 unthreaded perl524.dll, since unthreadeds don't pass my_perl (a unique *)
5439 through pp_entersub, use a unique value (which is a pointer to PL_stack_sp's
5440 location in the unthreaded perl binary) stored in CV * to figure out if this
5441 Perl_xs_handshake was called by the same pp_entersub */
5442 cv = (CV*)v_my_perl;
5443 xs_spp = (SV***)CvHSCXT(cv);
5445 need = &PL_stack_sp;
5447 if(UNLIKELY(got != need)) {
5448 bad_handshake:/* recycle branch and string from above */
5449 if(got != (void *)HSf_NOCHK)
5450 noperl_die("%s: loadable library and perl binaries are mismatched"
5451 " (got handshake key %p, needed %p)\n",
5455 if(key & HSf_SETXSUBFN) { /* this might be called from a module bootstrap */
5456 SAVEPPTR(PL_xsubfilename);/* which was require'd from a XSUB BEGIN */
5457 PL_xsubfilename = file; /* so the old name must be restored for
5458 additional XSUBs to register themselves */
5459 /* XSUBs can't be perl lang/perl5db.pl debugged
5460 if (PERLDB_LINE_OR_SAVESRC)
5461 (void)gv_fetchfile(file); */
5464 if(key & HSf_POPMARK) {
5466 { SV **mark = PL_stack_base + ax++;
5468 items = (I32)(SP - MARK);
5472 items = va_arg(args, U32);
5473 ax = va_arg(args, U32);
5477 assert(HS_GETAPIVERLEN(key) <= UCHAR_MAX);
5478 if((apiverlen = HS_GETAPIVERLEN(key))) {
5479 char * api_p = va_arg(args, char*);
5480 if(apiverlen != sizeof("v" PERL_API_VERSION_STRING)-1
5481 || memNE(api_p, "v" PERL_API_VERSION_STRING,
5482 sizeof("v" PERL_API_VERSION_STRING)-1))
5483 Perl_croak_nocontext("Perl API version %s of %" SVf " does not match %s",
5484 api_p, SVfARG(PL_stack_base[ax + 0]),
5485 "v" PERL_API_VERSION_STRING);
5490 assert(HS_GETXSVERLEN(key) <= UCHAR_MAX && HS_GETXSVERLEN(key) <= HS_APIVERLEN_MAX);
5491 if((xsverlen = HS_GETXSVERLEN(key)))
5492 S_xs_version_bootcheck(aTHX_
5493 items, ax, va_arg(args, char*), xsverlen);
5501 S_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
5505 const char *vn = NULL;
5506 SV *const module = PL_stack_base[ax];
5508 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
5510 if (items >= 2) /* version supplied as bootstrap arg */
5511 sv = PL_stack_base[ax + 1];
5513 /* XXX GV_ADDWARN */
5515 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5516 if (!sv || !SvOK(sv)) {
5518 sv = get_sv(Perl_form(aTHX_ "%" SVf "::%s", SVfARG(module), vn), 0);
5522 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
5523 SV *pmsv = sv_isobject(sv) && sv_derived_from(sv, "version")
5524 ? sv : sv_2mortal(new_version(sv));
5525 xssv = upg_version(xssv, 0);
5526 if ( vcmp(pmsv,xssv) ) {
5527 SV *string = vstringify(xssv);
5528 SV *xpt = Perl_newSVpvf(aTHX_ "%" SVf " object version %" SVf
5529 " does not match ", SVfARG(module), SVfARG(string));
5531 SvREFCNT_dec(string);
5532 string = vstringify(pmsv);
5535 Perl_sv_catpvf(aTHX_ xpt, "$%" SVf "::%s %" SVf, SVfARG(module), vn,
5538 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %" SVf, SVfARG(string));
5540 SvREFCNT_dec(string);
5542 Perl_sv_2mortal(aTHX_ xpt);
5543 Perl_croak_sv(aTHX_ xpt);
5549 =for apidoc my_strlcat
5551 The C library C<strlcat> if available, or a Perl implementation of it.
5552 This operates on C C<NUL>-terminated strings.
5554 C<my_strlcat()> appends string C<src> to the end of C<dst>. It will append at
5555 most S<C<size - strlen(dst) - 1>> characters. It will then C<NUL>-terminate,
5556 unless C<size> is 0 or the original C<dst> string was longer than C<size> (in
5557 practice this should not happen as it means that either C<size> is incorrect or
5558 that C<dst> is not a proper C<NUL>-terminated string).
5560 Note that C<size> is the full size of the destination buffer and
5561 the result is guaranteed to be C<NUL>-terminated if there is room. Note that
5562 room for the C<NUL> should be included in C<size>.
5564 The return value is the total length that C<dst> would have if C<size> is
5565 sufficiently large. Thus it is the initial length of C<dst> plus the length of
5566 C<src>. If C<size> is smaller than the return, the excess was not appended.
5570 Description stolen from http://man.openbsd.org/strlcat.3
5574 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5576 Size_t used, length, copy;
5579 length = strlen(src);
5580 if (size > 0 && used < size - 1) {
5581 copy = (length >= size - used) ? size - used - 1 : length;
5582 memcpy(dst + used, src, copy);
5583 dst[used + copy] = '\0';
5585 return used + length;
5591 =for apidoc my_strlcpy
5593 The C library C<strlcpy> if available, or a Perl implementation of it.
5594 This operates on C C<NUL>-terminated strings.
5596 C<my_strlcpy()> copies up to S<C<size - 1>> characters from the string C<src>
5597 to C<dst>, C<NUL>-terminating the result if C<size> is not 0.
5599 The return value is the total length C<src> would be if the copy completely
5600 succeeded. If it is larger than C<size>, the excess was not copied.
5604 Description stolen from http://man.openbsd.org/strlcpy.3
5608 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5610 Size_t length, copy;
5612 length = strlen(src);
5614 copy = (length >= size) ? size - 1 : length;
5615 memcpy(dst, src, copy);
5622 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5623 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5624 long _ftol( double ); /* Defined by VC6 C libs. */
5625 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5628 PERL_STATIC_INLINE bool
5629 S_gv_has_usable_name(pTHX_ GV *gv)
5633 && HvENAME(GvSTASH(gv))
5634 && (gvp = (GV **)hv_fetchhek(
5635 GvSTASH(gv), GvNAME_HEK(gv), 0
5641 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5643 SV * const dbsv = GvSVn(PL_DBsub);
5644 const bool save_taint = TAINT_get;
5646 /* When we are called from pp_goto (svp is null),
5647 * we do not care about using dbsv to call CV;
5648 * it's for informational purposes only.
5651 PERL_ARGS_ASSERT_GET_DB_SUB;
5655 if (!PERLDB_SUB_NN) {
5658 if (!svp && !CvLEXICAL(cv)) {
5659 gv_efullname3(dbsv, gv, NULL);
5661 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED)) || CvLEXICAL(cv)
5662 || strEQ(GvNAME(gv), "END")
5663 || ( /* Could be imported, and old sub redefined. */
5664 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
5666 !( (SvTYPE(*svp) == SVt_PVGV)
5667 && (GvCV((const GV *)*svp) == cv)
5668 /* Use GV from the stack as a fallback. */
5669 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
5673 /* GV is potentially non-unique, or contain different CV. */
5674 SV * const tmp = newRV(MUTABLE_SV(cv));
5675 sv_setsv(dbsv, tmp);
5679 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
5680 sv_catpvs(dbsv, "::");
5681 sv_cathek(dbsv, GvNAME_HEK(gv));
5685 const int type = SvTYPE(dbsv);
5686 if (type < SVt_PVIV && type != SVt_IV)
5687 sv_upgrade(dbsv, SVt_PVIV);
5688 (void)SvIOK_on(dbsv);
5689 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5692 TAINT_IF(save_taint);
5693 #ifdef NO_TAINT_SUPPORT
5694 PERL_UNUSED_VAR(save_taint);
5699 Perl_my_dirfd(DIR * dir) {
5701 /* Most dirfd implementations have problems when passed NULL. */
5706 #elif defined(HAS_DIR_DD_FD)
5709 Perl_croak_nocontext(PL_no_func, "dirfd");
5710 NOT_REACHED; /* NOTREACHED */
5715 #if !defined(HAS_MKOSTEMP) || !defined(HAS_MKSTEMP)
5717 #define TEMP_FILE_CH "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvxyz0123456789"
5718 #define TEMP_FILE_CH_COUNT (sizeof(TEMP_FILE_CH)-1)
5721 S_my_mkostemp(char *templte, int flags) {
5723 STRLEN len = strlen(templte);
5727 int delete_on_close = flags & O_VMS_DELETEONCLOSE;
5729 flags &= ~O_VMS_DELETEONCLOSE;
5733 templte[len-1] != 'X' || templte[len-2] != 'X' || templte[len-3] != 'X' ||
5734 templte[len-4] != 'X' || templte[len-5] != 'X' || templte[len-6] != 'X') {
5735 SETERRNO(EINVAL, LIB_INVARG);
5741 for (i = 1; i <= 6; ++i) {
5742 templte[len-i] = TEMP_FILE_CH[(int)(Perl_internal_drand48() * TEMP_FILE_CH_COUNT)];
5745 if (delete_on_close) {
5746 fd = open(templte, O_RDWR | O_CREAT | O_EXCL | flags, 0600, "fop=dlt");
5751 fd = PerlLIO_open3(templte, O_RDWR | O_CREAT | O_EXCL | flags, 0600);
5753 } while (fd == -1 && errno == EEXIST && ++attempts <= 100);
5760 #ifndef HAS_MKOSTEMP
5762 Perl_my_mkostemp(char *templte, int flags)
5764 PERL_ARGS_ASSERT_MY_MKOSTEMP;
5765 return S_my_mkostemp(templte, flags);
5771 Perl_my_mkstemp(char *templte)
5773 PERL_ARGS_ASSERT_MY_MKSTEMP;
5774 return S_my_mkostemp(templte, 0);
5779 Perl_get_re_arg(pTHX_ SV *sv) {
5785 sv = MUTABLE_SV(SvRV(sv));
5786 if (SvTYPE(sv) == SVt_REGEXP)
5787 return (REGEXP*) sv;
5794 * This code is derived from drand48() implementation from FreeBSD,
5795 * found in lib/libc/gen/_rand48.c.
5797 * The U64 implementation is original, based on the POSIX
5798 * specification for drand48().
5802 * Copyright (c) 1993 Martin Birgmeier
5803 * All rights reserved.
5805 * You may redistribute unmodified or modified versions of this source
5806 * code provided that the above copyright notice and this and the
5807 * following conditions are retained.
5809 * This software is provided ``as is'', and comes with no warranties
5810 * of any kind. I shall in no event be liable for anything that happens
5811 * to anyone/anything when using this software.
5814 #define FREEBSD_DRAND48_SEED_0 (0x330e)
5816 #ifdef PERL_DRAND48_QUAD
5818 #define DRAND48_MULT UINT64_C(0x5deece66d)
5819 #define DRAND48_ADD 0xb
5820 #define DRAND48_MASK UINT64_C(0xffffffffffff)
5824 #define FREEBSD_DRAND48_SEED_1 (0xabcd)
5825 #define FREEBSD_DRAND48_SEED_2 (0x1234)
5826 #define FREEBSD_DRAND48_MULT_0 (0xe66d)
5827 #define FREEBSD_DRAND48_MULT_1 (0xdeec)
5828 #define FREEBSD_DRAND48_MULT_2 (0x0005)
5829 #define FREEBSD_DRAND48_ADD (0x000b)
5831 const unsigned short _rand48_mult[3] = {
5832 FREEBSD_DRAND48_MULT_0,
5833 FREEBSD_DRAND48_MULT_1,
5834 FREEBSD_DRAND48_MULT_2
5836 const unsigned short _rand48_add = FREEBSD_DRAND48_ADD;
5841 Perl_drand48_init_r(perl_drand48_t *random_state, U32 seed)
5843 PERL_ARGS_ASSERT_DRAND48_INIT_R;
5845 #ifdef PERL_DRAND48_QUAD
5846 *random_state = FREEBSD_DRAND48_SEED_0 + ((U64)seed << 16);
5848 random_state->seed[0] = FREEBSD_DRAND48_SEED_0;
5849 random_state->seed[1] = (U16) seed;
5850 random_state->seed[2] = (U16) (seed >> 16);
5855 Perl_drand48_r(perl_drand48_t *random_state)
5857 PERL_ARGS_ASSERT_DRAND48_R;
5859 #ifdef PERL_DRAND48_QUAD
5860 *random_state = (*random_state * DRAND48_MULT + DRAND48_ADD)
5863 return ldexp((double)*random_state, -48);
5869 accu = (U32) _rand48_mult[0] * (U32) random_state->seed[0]
5870 + (U32) _rand48_add;
5871 temp[0] = (U16) accu; /* lower 16 bits */
5872 accu >>= sizeof(U16) * 8;
5873 accu += (U32) _rand48_mult[0] * (U32) random_state->seed[1]
5874 + (U32) _rand48_mult[1] * (U32) random_state->seed[0];
5875 temp[1] = (U16) accu; /* middle 16 bits */
5876 accu >>= sizeof(U16) * 8;
5877 accu += _rand48_mult[0] * random_state->seed[2]
5878 + _rand48_mult[1] * random_state->seed[1]
5879 + _rand48_mult[2] * random_state->seed[0];
5880 random_state->seed[0] = temp[0];
5881 random_state->seed[1] = temp[1];
5882 random_state->seed[2] = (U16) accu;
5884 return ldexp((double) random_state->seed[0], -48) +
5885 ldexp((double) random_state->seed[1], -32) +
5886 ldexp((double) random_state->seed[2], -16);
5891 #ifdef USE_C_BACKTRACE
5893 /* Possibly move all this USE_C_BACKTRACE code into a new file. */
5898 /* abfd is the BFD handle. */
5900 /* bfd_syms is the BFD symbol table. */
5902 /* bfd_text is handle to the the ".text" section of the object file. */
5904 /* Since opening the executable and scanning its symbols is quite
5905 * heavy operation, we remember the filename we used the last time,
5906 * and do the opening and scanning only if the filename changes.
5907 * This removes most (but not all) open+scan cycles. */
5908 const char* fname_prev;
5911 /* Given a dl_info, update the BFD context if necessary. */
5912 static void bfd_update(bfd_context* ctx, Dl_info* dl_info)
5914 /* BFD open and scan only if the filename changed. */
5915 if (ctx->fname_prev == NULL ||
5916 strNE(dl_info->dli_fname, ctx->fname_prev)) {
5918 bfd_close(ctx->abfd);
5920 ctx->abfd = bfd_openr(dl_info->dli_fname, 0);
5922 if (bfd_check_format(ctx->abfd, bfd_object)) {
5923 IV symbol_size = bfd_get_symtab_upper_bound(ctx->abfd);
5924 if (symbol_size > 0) {
5925 Safefree(ctx->bfd_syms);
5926 Newx(ctx->bfd_syms, symbol_size, asymbol*);
5928 bfd_get_section_by_name(ctx->abfd, ".text");
5936 ctx->fname_prev = dl_info->dli_fname;
5940 /* Given a raw frame, try to symbolize it and store
5941 * symbol information (source file, line number) away. */
5942 static void bfd_symbolize(bfd_context* ctx,
5945 STRLEN* symbol_name_size,
5947 STRLEN* source_name_size,
5948 STRLEN* source_line)
5950 *symbol_name = NULL;
5951 *symbol_name_size = 0;
5953 IV offset = PTR2IV(raw_frame) - PTR2IV(ctx->bfd_text->vma);
5955 bfd_canonicalize_symtab(ctx->abfd, ctx->bfd_syms) > 0) {
5958 unsigned int line = 0;
5959 if (bfd_find_nearest_line(ctx->abfd, ctx->bfd_text,
5960 ctx->bfd_syms, offset,
5961 &file, &func, &line) &&
5962 file && func && line > 0) {
5963 /* Size and copy the source file, use only
5964 * the basename of the source file.
5966 * NOTE: the basenames are fine for the
5967 * Perl source files, but may not always
5968 * be the best idea for XS files. */
5969 const char *p, *b = NULL;
5970 /* Look for the last slash. */
5971 for (p = file; *p; p++) {
5975 if (b == NULL || *b == 0) {
5978 *source_name_size = p - b + 1;
5979 Newx(*source_name, *source_name_size + 1, char);
5980 Copy(b, *source_name, *source_name_size + 1, char);
5982 *symbol_name_size = strlen(func);
5983 Newx(*symbol_name, *symbol_name_size + 1, char);
5984 Copy(func, *symbol_name, *symbol_name_size + 1, char);
5986 *source_line = line;
5992 #endif /* #ifdef USE_BFD */
5996 /* OS X has no public API for for 'symbolicating' (Apple official term)
5997 * stack addresses to {function_name, source_file, line_number}.
5998 * Good news: there is command line utility atos(1) which does that.
5999 * Bad news 1: it's a command line utility.
6000 * Bad news 2: one needs to have the Developer Tools installed.
6001 * Bad news 3: in newer releases it needs to be run as 'xcrun atos'.
6003 * To recap: we need to open a pipe for reading for a utility which
6004 * might not exist, or exists in different locations, and then parse
6005 * the output. And since this is all for a low-level API, we cannot
6006 * use high-level stuff. Thanks, Apple. */
6009 /* tool is set to the absolute pathname of the tool to use:
6012 /* format is set to a printf format string used for building
6013 * the external command to run. */
6015 /* unavail is set if e.g. xcrun cannot be found, or something
6016 * else happens that makes getting the backtrace dubious. Note,
6017 * however, that the context isn't persistent, the next call to
6018 * get_c_backtrace() will start from scratch. */
6020 /* fname is the current object file name. */
6022 /* object_base_addr is the base address of the shared object. */
6023 void* object_base_addr;
6026 /* Given |dl_info|, updates the context. If the context has been
6027 * marked unavailable, return immediately. If not but the tool has
6028 * not been set, set it to either "xcrun atos" or "atos" (also set the
6029 * format to use for creating commands for piping), or if neither is
6030 * unavailable (one needs the Developer Tools installed), mark the context
6031 * an unavailable. Finally, update the filename (object name),
6032 * and its base address. */
6034 static void atos_update(atos_context* ctx,
6039 if (ctx->tool == NULL) {
6040 const char* tools[] = {
6044 const char* formats[] = {
6045 "/usr/bin/xcrun atos -o '%s' -l %08x %08x 2>&1",
6046 "/usr/bin/atos -d -o '%s' -l %08x %08x 2>&1"
6050 for (i = 0; i < C_ARRAY_LENGTH(tools); i++) {
6051 if (stat(tools[i], &st) == 0 && S_ISREG(st.st_mode)) {
6052 ctx->tool = tools[i];
6053 ctx->format = formats[i];
6057 if (ctx->tool == NULL) {
6058 ctx->unavail = TRUE;
6062 if (ctx->fname == NULL ||
6063 strNE(dl_info->dli_fname, ctx->fname)) {
6064 ctx->fname = dl_info->dli_fname;
6065 ctx->object_base_addr = dl_info->dli_fbase;
6069 /* Given an output buffer end |p| and its |start|, matches
6070 * for the atos output, extracting the source code location
6071 * and returning non-NULL if possible, returning NULL otherwise. */
6072 static const char* atos_parse(const char* p,
6074 STRLEN* source_name_size,
6075 STRLEN* source_line) {
6076 /* atos() output is something like:
6077 * perl_parse (in miniperl) (perl.c:2314)\n\n".
6078 * We cannot use Perl regular expressions, because we need to
6079 * stay low-level. Therefore here we have a rolled-out version
6080 * of a state machine which matches _backwards_from_the_end_ and
6081 * if there's a success, returns the starts of the filename,
6082 * also setting the filename size and the source line number.
6083 * The matched regular expression is roughly "\(.*:\d+\)\s*$" */
6084 const char* source_number_start;
6085 const char* source_name_end;
6086 const char* source_line_end = start;
6087 const char* close_paren;
6090 /* Skip trailing whitespace. */
6091 while (p > start && isSPACE(*p)) p--;
6092 /* Now we should be at the close paren. */
6093 if (p == start || *p != ')')
6097 /* Now we should be in the line number. */
6098 if (p == start || !isDIGIT(*p))
6100 /* Skip over the digits. */
6101 while (p > start && isDIGIT(*p))
6103 /* Now we should be at the colon. */
6104 if (p == start || *p != ':')
6106 source_number_start = p + 1;
6107 source_name_end = p; /* Just beyond the end. */
6109 /* Look for the open paren. */
6110 while (p > start && *p != '(')
6115 *source_name_size = source_name_end - p;
6116 if (grok_atoUV(source_number_start, &uv, &source_line_end)
6117 && source_line_end == close_paren
6118 && uv <= PERL_INT_MAX
6120 *source_line = (STRLEN)uv;
6126 /* Given a raw frame, read a pipe from the symbolicator (that's the
6127 * technical term) atos, reads the result, and parses the source code
6128 * location. We must stay low-level, so we use snprintf(), pipe(),
6129 * and fread(), and then also parse the output ourselves. */
6130 static void atos_symbolize(atos_context* ctx,
6133 STRLEN* source_name_size,
6134 STRLEN* source_line)
6142 /* Simple security measure: if there's any funny business with
6143 * the object name (used as "-o '%s'" ), leave since at least
6144 * partially the user controls it. */
6145 for (p = ctx->fname; *p; p++) {
6146 if (*p == '\'' || isCNTRL(*p)) {
6147 ctx->unavail = TRUE;
6151 cnt = snprintf(cmd, sizeof(cmd), ctx->format,
6152 ctx->fname, ctx->object_base_addr, raw_frame);
6153 if (cnt < sizeof(cmd)) {
6154 /* Undo nostdio.h #defines that disable stdio.
6155 * This is somewhat naughty, but is used elsewhere
6156 * in the core, and affects only OS X. */
6161 FILE* fp = popen(cmd, "r");
6162 /* At the moment we open a new pipe for each stack frame.
6163 * This is naturally somewhat slow, but hopefully generating
6164 * stack traces is never going to in a performance critical path.
6166 * We could play tricks with atos by batching the stack
6167 * addresses to be resolved: atos can either take multiple
6168 * addresses from the command line, or read addresses from
6169 * a file (though the mess of creating temporary files would
6170 * probably negate much of any possible speedup).
6172 * Normally there are only two objects present in the backtrace:
6173 * perl itself, and the libdyld.dylib. (Note that the object
6174 * filenames contain the full pathname, so perl may not always
6175 * be in the same place.) Whenever the object in the
6176 * backtrace changes, the base address also changes.
6178 * The problem with batching the addresses, though, would be
6179 * matching the results with the addresses: the parsing of
6180 * the results is already painful enough with a single address. */
6183 UV cnt = fread(out, 1, sizeof(out), fp);
6184 if (cnt < sizeof(out)) {
6185 const char* p = atos_parse(out + cnt - 1, out,
6190 *source_name_size, char);
6191 Copy(p, *source_name,
6192 *source_name_size, char);
6200 #endif /* #ifdef PERL_DARWIN */
6203 =for apidoc_section Display and Dump functions
6204 =for apidoc get_c_backtrace
6206 Collects the backtrace (aka "stacktrace") into a single linear
6207 malloced buffer, which the caller B<must> C<Perl_free_c_backtrace()>.
6209 Scans the frames back by S<C<depth + skip>>, then drops the C<skip> innermost,
6210 returning at most C<depth> frames.
6216 Perl_get_c_backtrace(pTHX_ int depth, int skip)
6218 /* Note that here we must stay as low-level as possible: Newx(),
6219 * Copy(), Safefree(); since we may be called from anywhere,
6220 * so we should avoid higher level constructs like SVs or AVs.
6222 * Since we are using safesysmalloc() via Newx(), don't try
6223 * getting backtrace() there, unless you like deep recursion. */
6225 /* Currently only implemented with backtrace() and dladdr(),
6226 * for other platforms NULL is returned. */
6228 #if defined(HAS_BACKTRACE) && defined(HAS_DLADDR)
6229 /* backtrace() is available via <execinfo.h> in glibc and in most
6230 * modern BSDs; dladdr() is available via <dlfcn.h>. */
6232 /* We try fetching this many frames total, but then discard
6233 * the |skip| first ones. For the remaining ones we will try
6234 * retrieving more information with dladdr(). */
6235 int try_depth = skip + depth;
6237 /* The addresses (program counters) returned by backtrace(). */
6240 /* Retrieved with dladdr() from the addresses returned by backtrace(). */
6243 /* Sizes _including_ the terminating \0 of the object name
6244 * and symbol name strings. */
6245 STRLEN* object_name_sizes;
6246 STRLEN* symbol_name_sizes;
6249 /* The symbol names comes either from dli_sname,
6250 * or if using BFD, they can come from BFD. */
6251 char** symbol_names;
6254 /* The source code location information. Dug out with e.g. BFD. */
6255 char** source_names;
6256 STRLEN* source_name_sizes;
6257 STRLEN* source_lines;
6259 Perl_c_backtrace* bt = NULL; /* This is what will be returned. */
6260 int got_depth; /* How many frames were returned from backtrace(). */
6261 UV frame_count = 0; /* How many frames we return. */
6262 UV total_bytes = 0; /* The size of the whole returned backtrace. */
6265 bfd_context bfd_ctx;
6268 atos_context atos_ctx;
6271 /* Here are probably possibilities for optimizing. We could for
6272 * example have a struct that contains most of these and then
6273 * allocate |try_depth| of them, saving a bunch of malloc calls.
6274 * Note, however, that |frames| could not be part of that struct
6275 * because backtrace() will want an array of just them. Also be
6276 * careful about the name strings. */
6277 Newx(raw_frames, try_depth, void*);
6278 Newx(dl_infos, try_depth, Dl_info);
6279 Newx(object_name_sizes, try_depth, STRLEN);
6280 Newx(symbol_name_sizes, try_depth, STRLEN);
6281 Newx(source_names, try_depth, char*);
6282 Newx(source_name_sizes, try_depth, STRLEN);
6283 Newx(source_lines, try_depth, STRLEN);
6285 Newx(symbol_names, try_depth, char*);
6288 /* Get the raw frames. */
6289 got_depth = (int)backtrace(raw_frames, try_depth);
6291 /* We use dladdr() instead of backtrace_symbols() because we want
6292 * the full details instead of opaque strings. This is useful for
6293 * two reasons: () the details are needed for further symbolic
6294 * digging, for example in OS X (2) by having the details we fully
6295 * control the output, which in turn is useful when more platforms
6296 * are added: we can keep out output "portable". */
6298 /* We want a single linear allocation, which can then be freed
6299 * with a single swoop. We will do the usual trick of first
6300 * walking over the structure and seeing how much we need to
6301 * allocate, then allocating, and then walking over the structure
6302 * the second time and populating it. */
6304 /* First we must compute the total size of the buffer. */
6305 total_bytes = sizeof(Perl_c_backtrace_header);
6306 if (got_depth > skip) {
6309 bfd_init(); /* Is this safe to call multiple times? */
6310 Zero(&bfd_ctx, 1, bfd_context);
6313 Zero(&atos_ctx, 1, atos_context);
6315 for (i = skip; i < try_depth; i++) {
6316 Dl_info* dl_info = &dl_infos[i];
6318 object_name_sizes[i] = 0;
6319 source_names[i] = NULL;
6320 source_name_sizes[i] = 0;
6321 source_lines[i] = 0;
6323 /* Yes, zero from dladdr() is failure. */
6324 if (dladdr(raw_frames[i], dl_info)) {
6325 total_bytes += sizeof(Perl_c_backtrace_frame);
6327 object_name_sizes[i] =
6328 dl_info->dli_fname ? strlen(dl_info->dli_fname) : 0;
6329 symbol_name_sizes[i] =
6330 dl_info->dli_sname ? strlen(dl_info->dli_sname) : 0;
6332 bfd_update(&bfd_ctx, dl_info);
6333 bfd_symbolize(&bfd_ctx, raw_frames[i],
6335 &symbol_name_sizes[i],
6337 &source_name_sizes[i],
6341 atos_update(&atos_ctx, dl_info);
6342 atos_symbolize(&atos_ctx,
6345 &source_name_sizes[i],
6349 /* Plus ones for the terminating \0. */
6350 total_bytes += object_name_sizes[i] + 1;
6351 total_bytes += symbol_name_sizes[i] + 1;
6352 total_bytes += source_name_sizes[i] + 1;
6360 Safefree(bfd_ctx.bfd_syms);
6364 /* Now we can allocate and populate the result buffer. */
6365 Newxc(bt, total_bytes, char, Perl_c_backtrace);
6366 Zero(bt, total_bytes, char);
6367 bt->header.frame_count = frame_count;
6368 bt->header.total_bytes = total_bytes;
6369 if (frame_count > 0) {
6370 Perl_c_backtrace_frame* frame = bt->frame_info;
6371 char* name_base = (char *)(frame + frame_count);
6372 char* name_curr = name_base; /* Outputting the name strings here. */
6374 for (i = skip; i < skip + frame_count; i++) {
6375 Dl_info* dl_info = &dl_infos[i];
6377 frame->addr = raw_frames[i];
6378 frame->object_base_addr = dl_info->dli_fbase;
6379 frame->symbol_addr = dl_info->dli_saddr;
6381 /* Copies a string, including the \0, and advances the name_curr.
6382 * Also copies the start and the size to the frame. */
6383 #define PERL_C_BACKTRACE_STRCPY(frame, doffset, src, dsize, size) \
6385 Copy(src, name_curr, size, char); \
6386 frame->doffset = name_curr - (char*)bt; \
6387 frame->dsize = size; \
6388 name_curr += size; \
6391 PERL_C_BACKTRACE_STRCPY(frame, object_name_offset,
6393 object_name_size, object_name_sizes[i]);
6396 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6398 symbol_name_size, symbol_name_sizes[i]);
6399 Safefree(symbol_names[i]);
6401 PERL_C_BACKTRACE_STRCPY(frame, symbol_name_offset,
6403 symbol_name_size, symbol_name_sizes[i]);
6406 PERL_C_BACKTRACE_STRCPY(frame, source_name_offset,
6408 source_name_size, source_name_sizes[i]);
6409 Safefree(source_names[i]);
6411 #undef PERL_C_BACKTRACE_STRCPY
6413 frame->source_line_number = source_lines[i];
6417 assert(total_bytes ==
6418 (UV)(sizeof(Perl_c_backtrace_header) +
6419 frame_count * sizeof(Perl_c_backtrace_frame) +
6420 name_curr - name_base));
6423 Safefree(symbol_names);
6425 bfd_close(bfd_ctx.abfd);
6428 Safefree(source_lines);
6429 Safefree(source_name_sizes);
6430 Safefree(source_names);
6431 Safefree(symbol_name_sizes);
6432 Safefree(object_name_sizes);
6433 /* Assuming the strings returned by dladdr() are pointers
6434 * to read-only static memory (the object file), so that
6435 * they do not need freeing (and cannot be). */
6437 Safefree(raw_frames);
6440 PERL_UNUSED_ARG(depth);
6441 PERL_UNUSED_ARG(skip);
6447 =for apidoc free_c_backtrace
6449 Deallocates a backtrace received from get_c_backtrace.
6455 =for apidoc_section Display and Dump functions
6456 =for apidoc get_c_backtrace_dump
6458 Returns a SV containing a dump of C<depth> frames of the call stack, skipping
6459 the C<skip> innermost ones. C<depth> of 20 is usually enough.
6461 The appended output looks like:
6464 1 10e004812:0082 Perl_croak util.c:1716 /usr/bin/perl
6465 2 10df8d6d2:1d72 perl_parse perl.c:3975 /usr/bin/perl
6468 The fields are tab-separated. The first column is the depth (zero
6469 being the innermost non-skipped frame). In the hex:offset, the hex is
6470 where the program counter was in C<S_parse_body>, and the :offset (might
6471 be missing) tells how much inside the C<S_parse_body> the program counter was.
6473 The C<util.c:1716> is the source code file and line number.
6475 The F</usr/bin/perl> is obvious (hopefully).
6477 Unknowns are C<"-">. Unknowns can happen unfortunately quite easily:
6478 if the platform doesn't support retrieving the information;
6479 if the binary is missing the debug information;
6480 if the optimizer has transformed the code by for example inlining.
6486 Perl_get_c_backtrace_dump(pTHX_ int depth, int skip)
6488 Perl_c_backtrace* bt;
6490 bt = get_c_backtrace(depth, skip + 1 /* Hide ourselves. */);
6492 Perl_c_backtrace_frame* frame;
6493 SV* dsv = newSVpvs("");
6495 for (i = 0, frame = bt->frame_info;
6496 i < bt->header.frame_count; i++, frame++) {
6497 Perl_sv_catpvf(aTHX_ dsv, "%d", (int)i);
6498 Perl_sv_catpvf(aTHX_ dsv, "\t%p", frame->addr ? frame->addr : "-");
6499 /* Symbol (function) names might disappear without debug info.
6501 * The source code location might disappear in case of the
6502 * optimizer inlining or otherwise rearranging the code. */
6503 if (frame->symbol_addr) {
6504 Perl_sv_catpvf(aTHX_ dsv, ":%04x",
6506 ((char*)frame->addr - (char*)frame->symbol_addr));
6508 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6509 frame->symbol_name_size &&
6510 frame->symbol_name_offset ?
6511 (char*)bt + frame->symbol_name_offset : "-");
6512 if (frame->source_name_size &&
6513 frame->source_name_offset &&
6514 frame->source_line_number) {
6515 Perl_sv_catpvf(aTHX_ dsv, "\t%s:%" UVuf,
6516 (char*)bt + frame->source_name_offset,
6517 (UV)frame->source_line_number);
6519 Perl_sv_catpvf(aTHX_ dsv, "\t-");
6521 Perl_sv_catpvf(aTHX_ dsv, "\t%s",
6522 frame->object_name_size &&
6523 frame->object_name_offset ?
6524 (char*)bt + frame->object_name_offset : "-");
6525 /* The frame->object_base_addr is not output,
6526 * but it is used for symbolizing/symbolicating. */
6527 sv_catpvs(dsv, "\n");
6530 Perl_free_c_backtrace(bt);
6539 =for apidoc dump_c_backtrace
6541 Dumps the C backtrace to the given C<fp>.
6543 Returns true if a backtrace could be retrieved, false if not.
6549 Perl_dump_c_backtrace(pTHX_ PerlIO* fp, int depth, int skip)
6553 PERL_ARGS_ASSERT_DUMP_C_BACKTRACE;
6555 sv = Perl_get_c_backtrace_dump(aTHX_ depth, skip);
6558 PerlIO_printf(fp, "%s", SvPV_nolen(sv));
6564 #endif /* #ifdef USE_C_BACKTRACE */
6566 #if defined(USE_ITHREADS) && defined(I_PTHREAD)
6568 /* pthread_mutex_t and perl_mutex are typedef equivalent
6569 * so casting the pointers is fine. */
6571 int perl_tsa_mutex_lock(perl_mutex* mutex)
6573 return pthread_mutex_lock((pthread_mutex_t *) mutex);
6576 int perl_tsa_mutex_unlock(perl_mutex* mutex)
6578 return pthread_mutex_unlock((pthread_mutex_t *) mutex);
6581 int perl_tsa_mutex_destroy(perl_mutex* mutex)
6583 return pthread_mutex_destroy((pthread_mutex_t *) mutex);
6590 /* log a sub call or return */
6593 Perl_dtrace_probe_call(pTHX_ CV *cv, bool is_call)
6601 PERL_ARGS_ASSERT_DTRACE_PROBE_CALL;
6604 HEK *hek = CvNAME_HEK(cv);
6605 func = HEK_KEY(hek);
6611 start = (const COP *)CvSTART(cv);
6612 file = CopFILE(start);
6613 line = CopLINE(start);
6614 stash = CopSTASHPV(start);
6617 PERL_SUB_ENTRY(func, file, line, stash);
6620 PERL_SUB_RETURN(func, file, line, stash);
6625 /* log a require file loading/loaded */
6628 Perl_dtrace_probe_load(pTHX_ const char *name, bool is_loading)
6630 PERL_ARGS_ASSERT_DTRACE_PROBE_LOAD;
6633 PERL_LOADING_FILE(name);
6636 PERL_LOADED_FILE(name);
6641 /* log an op execution */
6644 Perl_dtrace_probe_op(pTHX_ const OP *op)
6646 PERL_ARGS_ASSERT_DTRACE_PROBE_OP;
6648 PERL_OP_ENTRY(OP_NAME(op));
6652 /* log a compile/run phase change */
6655 Perl_dtrace_probe_phase(pTHX_ enum perl_phase phase)
6657 const char *ph_old = PL_phase_names[PL_phase];
6658 const char *ph_new = PL_phase_names[phase];
6660 PERL_PHASE_CHANGE(ph_new, ph_old);
6666 * ex: set ts=8 sts=4 sw=4 et: