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
31 # define SIG_ERR ((Sighandler_t) -1)
36 /* Missing protos on LynxOS */
41 # include <sys/wait.h>
46 # include <sys/select.h>
52 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
53 # define FD_CLOEXEC 1 /* NeXT needs this */
56 /* NOTE: Do not call the next three routines directly. Use the macros
57 * in handy.h, so that we can easily redefine everything to do tracking of
58 * allocated hunks back to the original New to track down any memory leaks.
59 * XXX This advice seems to be widely ignored :-( --AD August 1996.
66 /* Can't use PerlIO to write as it allocates memory */
67 PerlLIO_write(PerlIO_fileno(Perl_error_log),
68 PL_no_mem, strlen(PL_no_mem));
70 NORETURN_FUNCTION_END;
73 #if defined (DEBUGGING) || defined(PERL_IMPLICIT_SYS) || defined (PERL_TRACK_MEMPOOL)
74 # define ALWAYS_NEED_THX
77 /* paranoid version of system's malloc() */
80 Perl_safesysmalloc(MEM_SIZE size)
82 #ifdef ALWAYS_NEED_THX
88 PerlIO_printf(Perl_error_log,
89 "Allocation too large: %lx\n", size) FLUSH;
92 #endif /* HAS_64K_LIMIT */
93 #ifdef PERL_TRACK_MEMPOOL
98 Perl_croak_nocontext("panic: malloc");
100 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
101 PERL_ALLOC_CHECK(ptr);
103 #ifdef PERL_TRACK_MEMPOOL
104 struct perl_memory_debug_header *const header
105 = (struct perl_memory_debug_header *)ptr;
109 PoisonNew(((char *)ptr), size, char);
112 #ifdef PERL_TRACK_MEMPOOL
113 header->interpreter = aTHX;
114 /* Link us into the list. */
115 header->prev = &PL_memory_debug_header;
116 header->next = PL_memory_debug_header.next;
117 PL_memory_debug_header.next = header;
118 header->next->prev = header;
122 ptr = (Malloc_t)((char*)ptr+sTHX);
124 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
128 #ifndef ALWAYS_NEED_THX
134 return write_no_mem();
140 /* paranoid version of system's realloc() */
143 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
145 #ifdef ALWAYS_NEED_THX
149 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
150 Malloc_t PerlMem_realloc();
151 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
155 PerlIO_printf(Perl_error_log,
156 "Reallocation too large: %lx\n", size) FLUSH;
159 #endif /* HAS_64K_LIMIT */
166 return safesysmalloc(size);
167 #ifdef PERL_TRACK_MEMPOOL
168 where = (Malloc_t)((char*)where-sTHX);
171 struct perl_memory_debug_header *const header
172 = (struct perl_memory_debug_header *)where;
174 if (header->interpreter != aTHX) {
175 Perl_croak_nocontext("panic: realloc from wrong pool");
177 assert(header->next->prev == header);
178 assert(header->prev->next == header);
180 if (header->size > size) {
181 const MEM_SIZE freed_up = header->size - size;
182 char *start_of_freed = ((char *)where) + size;
183 PoisonFree(start_of_freed, freed_up, char);
191 Perl_croak_nocontext("panic: realloc");
193 ptr = (Malloc_t)PerlMem_realloc(where,size);
194 PERL_ALLOC_CHECK(ptr);
196 /* MUST do this fixup first, before doing ANYTHING else, as anything else
197 might allocate memory/free/move memory, and until we do the fixup, it
198 may well be chasing (and writing to) free memory. */
199 #ifdef PERL_TRACK_MEMPOOL
201 struct perl_memory_debug_header *const header
202 = (struct perl_memory_debug_header *)ptr;
205 if (header->size < size) {
206 const MEM_SIZE fresh = size - header->size;
207 char *start_of_fresh = ((char *)ptr) + size;
208 PoisonNew(start_of_fresh, fresh, char);
212 header->next->prev = header;
213 header->prev->next = header;
215 ptr = (Malloc_t)((char*)ptr+sTHX);
219 /* In particular, must do that fixup above before logging anything via
220 *printf(), as it can reallocate memory, which can cause SEGVs. */
222 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
223 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
230 #ifndef ALWAYS_NEED_THX
236 return write_no_mem();
242 /* safe version of system's free() */
245 Perl_safesysfree(Malloc_t where)
247 #ifdef ALWAYS_NEED_THX
252 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
254 #ifdef PERL_TRACK_MEMPOOL
255 where = (Malloc_t)((char*)where-sTHX);
257 struct perl_memory_debug_header *const header
258 = (struct perl_memory_debug_header *)where;
260 if (header->interpreter != aTHX) {
261 Perl_croak_nocontext("panic: free from wrong pool");
264 Perl_croak_nocontext("panic: duplicate free");
266 if (!(header->next) || header->next->prev != header
267 || header->prev->next != header) {
268 Perl_croak_nocontext("panic: bad free");
270 /* Unlink us from the chain. */
271 header->next->prev = header->prev;
272 header->prev->next = header->next;
274 PoisonNew(where, header->size, char);
276 /* Trigger the duplicate free warning. */
284 /* safe version of system's calloc() */
287 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
289 #ifdef ALWAYS_NEED_THX
293 MEM_SIZE total_size = 0;
295 /* Even though calloc() for zero bytes is strange, be robust. */
296 if (size && (count <= MEM_SIZE_MAX / size))
297 total_size = size * count;
299 Perl_croak_nocontext("%s", PL_memory_wrap);
300 #ifdef PERL_TRACK_MEMPOOL
301 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
304 Perl_croak_nocontext("%s", PL_memory_wrap);
307 if (total_size > 0xffff) {
308 PerlIO_printf(Perl_error_log,
309 "Allocation too large: %lx\n", total_size) FLUSH;
312 #endif /* HAS_64K_LIMIT */
314 if ((long)size < 0 || (long)count < 0)
315 Perl_croak_nocontext("panic: calloc");
317 #ifdef PERL_TRACK_MEMPOOL
318 /* Have to use malloc() because we've added some space for our tracking
320 /* malloc(0) is non-portable. */
321 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
323 /* Use calloc() because it might save a memset() if the memory is fresh
324 and clean from the OS. */
326 ptr = (Malloc_t)PerlMem_calloc(count, size);
327 else /* calloc(0) is non-portable. */
328 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
330 PERL_ALLOC_CHECK(ptr);
331 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)total_size));
333 #ifdef PERL_TRACK_MEMPOOL
335 struct perl_memory_debug_header *const header
336 = (struct perl_memory_debug_header *)ptr;
338 memset((void*)ptr, 0, total_size);
339 header->interpreter = aTHX;
340 /* Link us into the list. */
341 header->prev = &PL_memory_debug_header;
342 header->next = PL_memory_debug_header.next;
343 PL_memory_debug_header.next = header;
344 header->next->prev = header;
346 header->size = total_size;
348 ptr = (Malloc_t)((char*)ptr+sTHX);
354 #ifndef ALWAYS_NEED_THX
359 return write_no_mem();
363 /* These must be defined when not using Perl's malloc for binary
368 Malloc_t Perl_malloc (MEM_SIZE nbytes)
371 return (Malloc_t)PerlMem_malloc(nbytes);
374 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
377 return (Malloc_t)PerlMem_calloc(elements, size);
380 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
383 return (Malloc_t)PerlMem_realloc(where, nbytes);
386 Free_t Perl_mfree (Malloc_t where)
394 /* copy a string up to some (non-backslashed) delimiter, if any */
397 Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
401 PERL_ARGS_ASSERT_DELIMCPY;
403 for (tolen = 0; from < fromend; from++, tolen++) {
405 if (from[1] != delim) {
412 else if (*from == delim)
423 /* return ptr to little string in big string, NULL if not found */
424 /* This routine was donated by Corey Satten. */
427 Perl_instr(register const char *big, register const char *little)
431 PERL_ARGS_ASSERT_INSTR;
439 register const char *s, *x;
442 for (x=big,s=little; *s; /**/ ) {
453 return (char*)(big-1);
458 /* same as instr but allow embedded nulls */
461 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
463 PERL_ARGS_ASSERT_NINSTR;
467 const char first = *little;
469 bigend -= lend - little++;
471 while (big <= bigend) {
472 if (*big++ == first) {
473 for (x=big,s=little; s < lend; x++,s++) {
477 return (char*)(big-1);
484 /* reverse of the above--find last substring */
487 Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
489 register const char *bigbeg;
490 register const I32 first = *little;
491 register const char * const littleend = lend;
493 PERL_ARGS_ASSERT_RNINSTR;
495 if (little >= littleend)
496 return (char*)bigend;
498 big = bigend - (littleend - little++);
499 while (big >= bigbeg) {
500 register const char *s, *x;
503 for (x=big+2,s=little; s < littleend; /**/ ) {
512 return (char*)(big+1);
517 /* As a space optimization, we do not compile tables for strings of length
518 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
519 special-cased in fbm_instr().
521 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
524 =head1 Miscellaneous Functions
526 =for apidoc fbm_compile
528 Analyses the string in order to make fast searches on it using fbm_instr()
529 -- the Boyer-Moore algorithm.
535 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
538 register const U8 *s;
544 PERL_ARGS_ASSERT_FBM_COMPILE;
546 if (flags & FBMcf_TAIL) {
547 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
548 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
549 if (mg && mg->mg_len >= 0)
552 s = (U8*)SvPV_force_mutable(sv, len);
553 if (len == 0) /* TAIL might be on a zero-length string. */
555 SvUPGRADE(sv, SVt_PVGV);
560 const unsigned char *sb;
561 const U8 mlen = (len>255) ? 255 : (U8)len;
564 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
566 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
567 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
568 memset((void*)table, mlen, 256);
570 sb = s - mlen + 1; /* first char (maybe) */
572 if (table[*s] == mlen)
577 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
579 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
581 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
582 for (i = 0; i < len; i++) {
583 if (PL_freq[s[i]] < frequency) {
585 frequency = PL_freq[s[i]];
588 BmFLAGS(sv) = (U8)flags;
589 BmRARE(sv) = s[rarest];
590 BmPREVIOUS(sv) = rarest;
591 BmUSEFUL(sv) = 100; /* Initial value */
592 if (flags & FBMcf_TAIL)
594 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
595 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
598 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
599 /* If SvTAIL is actually due to \Z or \z, this gives false positives
603 =for apidoc fbm_instr
605 Returns the location of the SV in the string delimited by C<str> and
606 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
607 does not have to be fbm_compiled, but the search will not be as fast
614 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
616 register unsigned char *s;
618 register const unsigned char *little
619 = (const unsigned char *)SvPV_const(littlestr,l);
620 register STRLEN littlelen = l;
621 register const I32 multiline = flags & FBMrf_MULTILINE;
623 PERL_ARGS_ASSERT_FBM_INSTR;
625 if ((STRLEN)(bigend - big) < littlelen) {
626 if ( SvTAIL(littlestr)
627 && ((STRLEN)(bigend - big) == littlelen - 1)
629 || (*big == *little &&
630 memEQ((char *)big, (char *)little, littlelen - 1))))
635 if (littlelen <= 2) { /* Special-cased */
637 if (littlelen == 1) {
638 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
639 /* Know that bigend != big. */
640 if (bigend[-1] == '\n')
641 return (char *)(bigend - 1);
642 return (char *) bigend;
650 if (SvTAIL(littlestr))
651 return (char *) bigend;
655 return (char*)big; /* Cannot be SvTAIL! */
658 if (SvTAIL(littlestr) && !multiline) {
659 if (bigend[-1] == '\n' && bigend[-2] == *little)
660 return (char*)bigend - 2;
661 if (bigend[-1] == *little)
662 return (char*)bigend - 1;
666 /* This should be better than FBM if c1 == c2, and almost
667 as good otherwise: maybe better since we do less indirection.
668 And we save a lot of memory by caching no table. */
669 const unsigned char c1 = little[0];
670 const unsigned char c2 = little[1];
675 while (s <= bigend) {
685 goto check_1char_anchor;
696 goto check_1char_anchor;
699 while (s <= bigend) {
704 goto check_1char_anchor;
713 check_1char_anchor: /* One char and anchor! */
714 if (SvTAIL(littlestr) && (*bigend == *little))
715 return (char *)bigend; /* bigend is already decremented. */
718 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
719 s = bigend - littlelen;
720 if (s >= big && bigend[-1] == '\n' && *s == *little
721 /* Automatically of length > 2 */
722 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
724 return (char*)s; /* how sweet it is */
727 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
729 return (char*)s + 1; /* how sweet it is */
733 if (!SvVALID(littlestr)) {
734 char * const b = ninstr((char*)big,(char*)bigend,
735 (char*)little, (char*)little + littlelen);
737 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
738 /* Chop \n from littlestr: */
739 s = bigend - littlelen + 1;
741 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
751 if (littlelen > (STRLEN)(bigend - big))
755 register const unsigned char * const table
756 = little + littlelen + PERL_FBM_TABLE_OFFSET;
757 register const unsigned char *oldlittle;
759 --littlelen; /* Last char found by table lookup */
762 little += littlelen; /* last char */
768 if ((tmp = table[*s])) {
769 if ((s += tmp) < bigend)
773 else { /* less expensive than calling strncmp() */
774 register unsigned char * const olds = s;
779 if (*--s == *--little)
781 s = olds + 1; /* here we pay the price for failure */
783 if (s < bigend) /* fake up continue to outer loop */
792 && (BmFLAGS(littlestr) & FBMcf_TAIL)
793 && memEQ((char *)(bigend - littlelen),
794 (char *)(oldlittle - littlelen), littlelen) )
795 return (char*)bigend - littlelen;
800 /* start_shift, end_shift are positive quantities which give offsets
801 of ends of some substring of bigstr.
802 If "last" we want the last occurrence.
803 old_posp is the way of communication between consequent calls if
804 the next call needs to find the .
805 The initial *old_posp should be -1.
807 Note that we take into account SvTAIL, so one can get extra
808 optimizations if _ALL flag is set.
811 /* If SvTAIL is actually due to \Z or \z, this gives false positives
812 if PL_multiline. In fact if !PL_multiline the authoritative answer
813 is not supported yet. */
816 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
819 register const unsigned char *big;
821 register I32 previous;
823 register const unsigned char *little;
824 register I32 stop_pos;
825 register const unsigned char *littleend;
828 PERL_ARGS_ASSERT_SCREAMINSTR;
830 assert(SvTYPE(littlestr) == SVt_PVGV);
831 assert(SvVALID(littlestr));
834 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
835 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
837 if ( BmRARE(littlestr) == '\n'
838 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
839 little = (const unsigned char *)(SvPVX_const(littlestr));
840 littleend = little + SvCUR(littlestr);
847 little = (const unsigned char *)(SvPVX_const(littlestr));
848 littleend = little + SvCUR(littlestr);
850 /* The value of pos we can start at: */
851 previous = BmPREVIOUS(littlestr);
852 big = (const unsigned char *)(SvPVX_const(bigstr));
853 /* The value of pos we can stop at: */
854 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
855 if (previous + start_shift > stop_pos) {
857 stop_pos does not include SvTAIL in the count, so this check is incorrect
858 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
861 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
866 while (pos < previous + start_shift) {
867 if (!(pos += PL_screamnext[pos]))
872 register const unsigned char *s, *x;
873 if (pos >= stop_pos) break;
874 if (big[pos] != first)
876 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
882 if (s == littleend) {
884 if (!last) return (char *)(big+pos);
887 } while ( pos += PL_screamnext[pos] );
889 return (char *)(big+(*old_posp));
891 if (!SvTAIL(littlestr) || (end_shift > 0))
893 /* Ignore the trailing "\n". This code is not microoptimized */
894 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
895 stop_pos = littleend - little; /* Actual littlestr len */
900 && ((stop_pos == 1) ||
901 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
909 Returns true if the leading len bytes of the strings s1 and s2 are the same
910 case-insensitively; false otherwise. Uppercase and lowercase ASCII range bytes
911 match themselves and their opposite case counterparts. Non-cased and non-ASCII
912 range bytes match only themselves.
919 Perl_foldEQ(const char *s1, const char *s2, register I32 len)
921 register const U8 *a = (const U8 *)s1;
922 register const U8 *b = (const U8 *)s2;
924 PERL_ARGS_ASSERT_FOLDEQ;
927 if (*a != *b && *a != PL_fold[*b])
934 Perl_foldEQ_latin1(const char *s1, const char *s2, register I32 len)
936 /* Compare non-utf8 using Unicode (Latin1) semantics. Does not work on
937 * MICRO_SIGN, LATIN_SMALL_LETTER_SHARP_S, nor
938 * LATIN_SMALL_LETTER_Y_WITH_DIAERESIS, and does not check for these. Nor
939 * does it check that the strings each have at least 'len' characters */
941 register const U8 *a = (const U8 *)s1;
942 register const U8 *b = (const U8 *)s2;
944 PERL_ARGS_ASSERT_FOLDEQ_LATIN1;
947 if (*a != *b && *a != PL_fold_latin1[*b]) {
956 =for apidoc foldEQ_locale
958 Returns true if the leading len bytes of the strings s1 and s2 are the same
959 case-insensitively in the current locale; false otherwise.
965 Perl_foldEQ_locale(const char *s1, const char *s2, register I32 len)
968 register const U8 *a = (const U8 *)s1;
969 register const U8 *b = (const U8 *)s2;
971 PERL_ARGS_ASSERT_FOLDEQ_LOCALE;
974 if (*a != *b && *a != PL_fold_locale[*b])
981 /* copy a string to a safe spot */
984 =head1 Memory Management
988 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
989 string which is a duplicate of C<pv>. The size of the string is
990 determined by C<strlen()>. The memory allocated for the new string can
991 be freed with the C<Safefree()> function.
997 Perl_savepv(pTHX_ const char *pv)
1004 const STRLEN pvlen = strlen(pv)+1;
1005 Newx(newaddr, pvlen, char);
1006 return (char*)memcpy(newaddr, pv, pvlen);
1010 /* same thing but with a known length */
1015 Perl's version of what C<strndup()> would be if it existed. Returns a
1016 pointer to a newly allocated string which is a duplicate of the first
1017 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
1018 the new string can be freed with the C<Safefree()> function.
1024 Perl_savepvn(pTHX_ const char *pv, register I32 len)
1026 register char *newaddr;
1027 PERL_UNUSED_CONTEXT;
1029 Newx(newaddr,len+1,char);
1030 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1032 /* might not be null terminated */
1033 newaddr[len] = '\0';
1034 return (char *) CopyD(pv,newaddr,len,char);
1037 return (char *) ZeroD(newaddr,len+1,char);
1042 =for apidoc savesharedpv
1044 A version of C<savepv()> which allocates the duplicate string in memory
1045 which is shared between threads.
1050 Perl_savesharedpv(pTHX_ const char *pv)
1052 register char *newaddr;
1057 pvlen = strlen(pv)+1;
1058 newaddr = (char*)PerlMemShared_malloc(pvlen);
1060 return write_no_mem();
1062 return (char*)memcpy(newaddr, pv, pvlen);
1066 =for apidoc savesharedpvn
1068 A version of C<savepvn()> which allocates the duplicate string in memory
1069 which is shared between threads. (With the specific difference that a NULL
1070 pointer is not acceptable)
1075 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1077 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1079 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1082 return write_no_mem();
1084 newaddr[len] = '\0';
1085 return (char*)memcpy(newaddr, pv, len);
1089 =for apidoc savesvpv
1091 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1092 the passed in SV using C<SvPV()>
1098 Perl_savesvpv(pTHX_ SV *sv)
1101 const char * const pv = SvPV_const(sv, len);
1102 register char *newaddr;
1104 PERL_ARGS_ASSERT_SAVESVPV;
1107 Newx(newaddr,len,char);
1108 return (char *) CopyD(pv,newaddr,len,char);
1112 =for apidoc savesharedsvpv
1114 A version of C<savesharedpv()> which allocates the duplicate string in
1115 memory which is shared between threads.
1121 Perl_savesharedsvpv(pTHX_ SV *sv)
1124 const char * const pv = SvPV_const(sv, len);
1126 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1128 return savesharedpvn(pv, len);
1131 /* the SV for Perl_form() and mess() is not kept in an arena */
1140 if (PL_phase != PERL_PHASE_DESTRUCT)
1141 return newSVpvs_flags("", SVs_TEMP);
1146 /* Create as PVMG now, to avoid any upgrading later */
1148 Newxz(any, 1, XPVMG);
1149 SvFLAGS(sv) = SVt_PVMG;
1150 SvANY(sv) = (void*)any;
1152 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1157 #if defined(PERL_IMPLICIT_CONTEXT)
1159 Perl_form_nocontext(const char* pat, ...)
1164 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1165 va_start(args, pat);
1166 retval = vform(pat, &args);
1170 #endif /* PERL_IMPLICIT_CONTEXT */
1173 =head1 Miscellaneous Functions
1176 Takes a sprintf-style format pattern and conventional
1177 (non-SV) arguments and returns the formatted string.
1179 (char *) Perl_form(pTHX_ const char* pat, ...)
1181 can be used any place a string (char *) is required:
1183 char * s = Perl_form("%d.%d",major,minor);
1185 Uses a single private buffer so if you want to format several strings you
1186 must explicitly copy the earlier strings away (and free the copies when you
1193 Perl_form(pTHX_ const char* pat, ...)
1197 PERL_ARGS_ASSERT_FORM;
1198 va_start(args, pat);
1199 retval = vform(pat, &args);
1205 Perl_vform(pTHX_ const char *pat, va_list *args)
1207 SV * const sv = mess_alloc();
1208 PERL_ARGS_ASSERT_VFORM;
1209 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1214 =for apidoc Am|SV *|mess|const char *pat|...
1216 Take a sprintf-style format pattern and argument list. These are used to
1217 generate a string message. If the message does not end with a newline,
1218 then it will be extended with some indication of the current location
1219 in the code, as described for L</mess_sv>.
1221 Normally, the resulting message is returned in a new mortal SV.
1222 During global destruction a single SV may be shared between uses of
1228 #if defined(PERL_IMPLICIT_CONTEXT)
1230 Perl_mess_nocontext(const char *pat, ...)
1235 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1236 va_start(args, pat);
1237 retval = vmess(pat, &args);
1241 #endif /* PERL_IMPLICIT_CONTEXT */
1244 Perl_mess(pTHX_ const char *pat, ...)
1248 PERL_ARGS_ASSERT_MESS;
1249 va_start(args, pat);
1250 retval = vmess(pat, &args);
1256 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1259 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1261 PERL_ARGS_ASSERT_CLOSEST_COP;
1263 if (!o || o == PL_op)
1266 if (o->op_flags & OPf_KIDS) {
1268 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1271 /* If the OP_NEXTSTATE has been optimised away we can still use it
1272 * the get the file and line number. */
1274 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1275 cop = (const COP *)kid;
1277 /* Keep searching, and return when we've found something. */
1279 new_cop = closest_cop(cop, kid);
1285 /* Nothing found. */
1291 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1293 Expands a message, intended for the user, to include an indication of
1294 the current location in the code, if the message does not already appear
1297 C<basemsg> is the initial message or object. If it is a reference, it
1298 will be used as-is and will be the result of this function. Otherwise it
1299 is used as a string, and if it already ends with a newline, it is taken
1300 to be complete, and the result of this function will be the same string.
1301 If the message does not end with a newline, then a segment such as C<at
1302 foo.pl line 37> will be appended, and possibly other clauses indicating
1303 the current state of execution. The resulting message will end with a
1306 Normally, the resulting message is returned in a new mortal SV.
1307 During global destruction a single SV may be shared between uses of this
1308 function. If C<consume> is true, then the function is permitted (but not
1309 required) to modify and return C<basemsg> instead of allocating a new SV.
1315 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1320 PERL_ARGS_ASSERT_MESS_SV;
1322 if (SvROK(basemsg)) {
1328 sv_setsv(sv, basemsg);
1333 if (SvPOK(basemsg) && consume) {
1338 sv_copypv(sv, basemsg);
1341 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1343 * Try and find the file and line for PL_op. This will usually be
1344 * PL_curcop, but it might be a cop that has been optimised away. We
1345 * can try to find such a cop by searching through the optree starting
1346 * from the sibling of PL_curcop.
1349 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1354 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1355 OutCopFILE(cop), (IV)CopLINE(cop));
1356 /* Seems that GvIO() can be untrustworthy during global destruction. */
1357 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1358 && IoLINES(GvIOp(PL_last_in_gv)))
1360 const bool line_mode = (RsSIMPLE(PL_rs) &&
1361 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1362 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1363 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1364 line_mode ? "line" : "chunk",
1365 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1367 if (PL_phase == PERL_PHASE_DESTRUCT)
1368 sv_catpvs(sv, " during global destruction");
1369 sv_catpvs(sv, ".\n");
1375 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1377 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1378 argument list. These are used to generate a string message. If the
1379 message does not end with a newline, then it will be extended with
1380 some indication of the current location in the code, as described for
1383 Normally, the resulting message is returned in a new mortal SV.
1384 During global destruction a single SV may be shared between uses of
1391 Perl_vmess(pTHX_ const char *pat, va_list *args)
1394 SV * const sv = mess_alloc();
1396 PERL_ARGS_ASSERT_VMESS;
1398 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1399 return mess_sv(sv, 1);
1403 Perl_write_to_stderr(pTHX_ SV* msv)
1409 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1411 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1412 && (io = GvIO(PL_stderrgv))
1413 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1420 SAVESPTR(PL_stderrgv);
1423 PUSHSTACKi(PERLSI_MAGIC);
1427 PUSHs(SvTIED_obj(MUTABLE_SV(io), mg));
1430 call_method("PRINT", G_SCALAR);
1438 /* SFIO can really mess with your errno */
1441 PerlIO * const serr = Perl_error_log;
1443 do_print(msv, serr);
1444 (void)PerlIO_flush(serr);
1452 =head1 Warning and Dieing
1455 /* Common code used in dieing and warning */
1458 S_with_queued_errors(pTHX_ SV *ex)
1460 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1461 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1462 sv_catsv(PL_errors, ex);
1463 ex = sv_mortalcopy(PL_errors);
1464 SvCUR_set(PL_errors, 0);
1470 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1476 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1477 /* sv_2cv might call Perl_croak() or Perl_warner() */
1478 SV * const oldhook = *hook;
1486 cv = sv_2cv(oldhook, &stash, &gv, 0);
1488 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1498 exarg = newSVsv(ex);
1499 SvREADONLY_on(exarg);
1502 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1506 call_sv(MUTABLE_SV(cv), G_DISCARD);
1515 =for apidoc Am|OP *|die_sv|SV *baseex
1517 Behaves the same as L</croak_sv>, except for the return type.
1518 It should be used only where the C<OP *> return type is required.
1519 The function never actually returns.
1525 Perl_die_sv(pTHX_ SV *baseex)
1527 PERL_ARGS_ASSERT_DIE_SV;
1534 =for apidoc Am|OP *|die|const char *pat|...
1536 Behaves the same as L</croak>, except for the return type.
1537 It should be used only where the C<OP *> return type is required.
1538 The function never actually returns.
1543 #if defined(PERL_IMPLICIT_CONTEXT)
1545 Perl_die_nocontext(const char* pat, ...)
1549 va_start(args, pat);
1555 #endif /* PERL_IMPLICIT_CONTEXT */
1558 Perl_die(pTHX_ const char* pat, ...)
1561 va_start(args, pat);
1569 =for apidoc Am|void|croak_sv|SV *baseex
1571 This is an XS interface to Perl's C<die> function.
1573 C<baseex> is the error message or object. If it is a reference, it
1574 will be used as-is. Otherwise it is used as a string, and if it does
1575 not end with a newline then it will be extended with some indication of
1576 the current location in the code, as described for L</mess_sv>.
1578 The error message or object will be used as an exception, by default
1579 returning control to the nearest enclosing C<eval>, but subject to
1580 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1581 function never returns normally.
1583 To die with a simple string message, the L</croak> function may be
1590 Perl_croak_sv(pTHX_ SV *baseex)
1592 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1593 PERL_ARGS_ASSERT_CROAK_SV;
1594 invoke_exception_hook(ex, FALSE);
1599 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1601 This is an XS interface to Perl's C<die> function.
1603 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1604 argument list. These are used to generate a string message. If the
1605 message does not end with a newline, then it will be extended with
1606 some indication of the current location in the code, as described for
1609 The error message will be used as an exception, by default
1610 returning control to the nearest enclosing C<eval>, but subject to
1611 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1612 function never returns normally.
1614 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1615 (C<$@>) will be used as an error message or object instead of building an
1616 error message from arguments. If you want to throw a non-string object,
1617 or build an error message in an SV yourself, it is preferable to use
1618 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1624 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1626 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1627 invoke_exception_hook(ex, FALSE);
1632 =for apidoc Am|void|croak|const char *pat|...
1634 This is an XS interface to Perl's C<die> function.
1636 Take a sprintf-style format pattern and argument list. These are used to
1637 generate a string message. If the message does not end with a newline,
1638 then it will be extended with some indication of the current location
1639 in the code, as described for L</mess_sv>.
1641 The error message will be used as an exception, by default
1642 returning control to the nearest enclosing C<eval>, but subject to
1643 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1644 function never returns normally.
1646 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1647 (C<$@>) will be used as an error message or object instead of building an
1648 error message from arguments. If you want to throw a non-string object,
1649 or build an error message in an SV yourself, it is preferable to use
1650 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1655 #if defined(PERL_IMPLICIT_CONTEXT)
1657 Perl_croak_nocontext(const char *pat, ...)
1661 va_start(args, pat);
1666 #endif /* PERL_IMPLICIT_CONTEXT */
1669 Perl_croak(pTHX_ const char *pat, ...)
1672 va_start(args, pat);
1679 =for apidoc Am|void|croak_no_modify
1681 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1682 terser object code than using C<Perl_croak>. Less code used on exception code
1683 paths reduces CPU cache pressure.
1689 Perl_croak_no_modify(pTHX)
1691 Perl_croak(aTHX_ "%s", PL_no_modify);
1695 =for apidoc Am|void|warn_sv|SV *baseex
1697 This is an XS interface to Perl's C<warn> function.
1699 C<baseex> is the error message or object. If it is a reference, it
1700 will be used as-is. Otherwise it is used as a string, and if it does
1701 not end with a newline then it will be extended with some indication of
1702 the current location in the code, as described for L</mess_sv>.
1704 The error message or object will by default be written to standard error,
1705 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1707 To warn with a simple string message, the L</warn> function may be
1714 Perl_warn_sv(pTHX_ SV *baseex)
1716 SV *ex = mess_sv(baseex, 0);
1717 PERL_ARGS_ASSERT_WARN_SV;
1718 if (!invoke_exception_hook(ex, TRUE))
1719 write_to_stderr(ex);
1723 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1725 This is an XS interface to Perl's C<warn> function.
1727 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1728 argument list. These are used to generate a string message. If the
1729 message does not end with a newline, then it will be extended with
1730 some indication of the current location in the code, as described for
1733 The error message or object will by default be written to standard error,
1734 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1736 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1742 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1744 SV *ex = vmess(pat, args);
1745 PERL_ARGS_ASSERT_VWARN;
1746 if (!invoke_exception_hook(ex, TRUE))
1747 write_to_stderr(ex);
1751 =for apidoc Am|void|warn|const char *pat|...
1753 This is an XS interface to Perl's C<warn> function.
1755 Take a sprintf-style format pattern and argument list. These are used to
1756 generate a string message. If the message does not end with a newline,
1757 then it will be extended with some indication of the current location
1758 in the code, as described for L</mess_sv>.
1760 The error message or object will by default be written to standard error,
1761 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1763 Unlike with L</croak>, C<pat> is not permitted to be null.
1768 #if defined(PERL_IMPLICIT_CONTEXT)
1770 Perl_warn_nocontext(const char *pat, ...)
1774 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1775 va_start(args, pat);
1779 #endif /* PERL_IMPLICIT_CONTEXT */
1782 Perl_warn(pTHX_ const char *pat, ...)
1785 PERL_ARGS_ASSERT_WARN;
1786 va_start(args, pat);
1791 #if defined(PERL_IMPLICIT_CONTEXT)
1793 Perl_warner_nocontext(U32 err, const char *pat, ...)
1797 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1798 va_start(args, pat);
1799 vwarner(err, pat, &args);
1802 #endif /* PERL_IMPLICIT_CONTEXT */
1805 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1807 PERL_ARGS_ASSERT_CK_WARNER_D;
1809 if (Perl_ckwarn_d(aTHX_ err)) {
1811 va_start(args, pat);
1812 vwarner(err, pat, &args);
1818 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1820 PERL_ARGS_ASSERT_CK_WARNER;
1822 if (Perl_ckwarn(aTHX_ err)) {
1824 va_start(args, pat);
1825 vwarner(err, pat, &args);
1831 Perl_warner(pTHX_ U32 err, const char* pat,...)
1834 PERL_ARGS_ASSERT_WARNER;
1835 va_start(args, pat);
1836 vwarner(err, pat, &args);
1841 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1844 PERL_ARGS_ASSERT_VWARNER;
1845 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1846 SV * const msv = vmess(pat, args);
1848 invoke_exception_hook(msv, FALSE);
1852 Perl_vwarn(aTHX_ pat, args);
1856 /* implements the ckWARN? macros */
1859 Perl_ckwarn(pTHX_ U32 w)
1862 /* If lexical warnings have not been set, use $^W. */
1864 return PL_dowarn & G_WARN_ON;
1866 return ckwarn_common(w);
1869 /* implements the ckWARN?_d macro */
1872 Perl_ckwarn_d(pTHX_ U32 w)
1875 /* If lexical warnings have not been set then default classes warn. */
1879 return ckwarn_common(w);
1883 S_ckwarn_common(pTHX_ U32 w)
1885 if (PL_curcop->cop_warnings == pWARN_ALL)
1888 if (PL_curcop->cop_warnings == pWARN_NONE)
1891 /* Check the assumption that at least the first slot is non-zero. */
1892 assert(unpackWARN1(w));
1894 /* Check the assumption that it is valid to stop as soon as a zero slot is
1896 if (!unpackWARN2(w)) {
1897 assert(!unpackWARN3(w));
1898 assert(!unpackWARN4(w));
1899 } else if (!unpackWARN3(w)) {
1900 assert(!unpackWARN4(w));
1903 /* Right, dealt with all the special cases, which are implemented as non-
1904 pointers, so there is a pointer to a real warnings mask. */
1906 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1908 } while (w >>= WARNshift);
1913 /* Set buffer=NULL to get a new one. */
1915 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1917 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1918 PERL_UNUSED_CONTEXT;
1919 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1922 (specialWARN(buffer) ?
1923 PerlMemShared_malloc(len_wanted) :
1924 PerlMemShared_realloc(buffer, len_wanted));
1926 Copy(bits, (buffer + 1), size, char);
1930 /* since we've already done strlen() for both nam and val
1931 * we can use that info to make things faster than
1932 * sprintf(s, "%s=%s", nam, val)
1934 #define my_setenv_format(s, nam, nlen, val, vlen) \
1935 Copy(nam, s, nlen, char); \
1937 Copy(val, s+(nlen+1), vlen, char); \
1938 *(s+(nlen+1+vlen)) = '\0'
1940 #ifdef USE_ENVIRON_ARRAY
1941 /* VMS' my_setenv() is in vms.c */
1942 #if !defined(WIN32) && !defined(NETWARE)
1944 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1948 /* only parent thread can modify process environment */
1949 if (PL_curinterp == aTHX)
1952 #ifndef PERL_USE_SAFE_PUTENV
1953 if (!PL_use_safe_putenv) {
1954 /* most putenv()s leak, so we manipulate environ directly */
1956 register const I32 len = strlen(nam);
1959 /* where does it go? */
1960 for (i = 0; environ[i]; i++) {
1961 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1965 if (environ == PL_origenviron) { /* need we copy environment? */
1971 while (environ[max])
1973 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1974 for (j=0; j<max; j++) { /* copy environment */
1975 const int len = strlen(environ[j]);
1976 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1977 Copy(environ[j], tmpenv[j], len+1, char);
1980 environ = tmpenv; /* tell exec where it is now */
1983 safesysfree(environ[i]);
1984 while (environ[i]) {
1985 environ[i] = environ[i+1];
1990 if (!environ[i]) { /* does not exist yet */
1991 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1992 environ[i+1] = NULL; /* make sure it's null terminated */
1995 safesysfree(environ[i]);
1999 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2000 /* all that work just for this */
2001 my_setenv_format(environ[i], nam, nlen, val, vlen);
2004 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
2005 # if defined(HAS_UNSETENV)
2007 (void)unsetenv(nam);
2009 (void)setenv(nam, val, 1);
2011 # else /* ! HAS_UNSETENV */
2012 (void)setenv(nam, val, 1);
2013 # endif /* HAS_UNSETENV */
2015 # if defined(HAS_UNSETENV)
2017 (void)unsetenv(nam);
2019 const int nlen = strlen(nam);
2020 const int vlen = strlen(val);
2021 char * const new_env =
2022 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2023 my_setenv_format(new_env, nam, nlen, val, vlen);
2024 (void)putenv(new_env);
2026 # else /* ! HAS_UNSETENV */
2028 const int nlen = strlen(nam);
2034 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2035 /* all that work just for this */
2036 my_setenv_format(new_env, nam, nlen, val, vlen);
2037 (void)putenv(new_env);
2038 # endif /* HAS_UNSETENV */
2039 # endif /* __CYGWIN__ */
2040 #ifndef PERL_USE_SAFE_PUTENV
2046 #else /* WIN32 || NETWARE */
2049 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2052 register char *envstr;
2053 const int nlen = strlen(nam);
2060 Newx(envstr, nlen+vlen+2, char);
2061 my_setenv_format(envstr, nam, nlen, val, vlen);
2062 (void)PerlEnv_putenv(envstr);
2066 #endif /* WIN32 || NETWARE */
2068 #endif /* !VMS && !EPOC*/
2070 #ifdef UNLINK_ALL_VERSIONS
2072 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2076 PERL_ARGS_ASSERT_UNLNK;
2078 while (PerlLIO_unlink(f) >= 0)
2080 return retries ? 0 : -1;
2084 /* this is a drop-in replacement for bcopy() */
2085 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
2087 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
2089 char * const retval = to;
2091 PERL_ARGS_ASSERT_MY_BCOPY;
2093 if (from - to >= 0) {
2101 *(--to) = *(--from);
2107 /* this is a drop-in replacement for memset() */
2110 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
2112 char * const retval = loc;
2114 PERL_ARGS_ASSERT_MY_MEMSET;
2122 /* this is a drop-in replacement for bzero() */
2123 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2125 Perl_my_bzero(register char *loc, register I32 len)
2127 char * const retval = loc;
2129 PERL_ARGS_ASSERT_MY_BZERO;
2137 /* this is a drop-in replacement for memcmp() */
2138 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2140 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
2142 register const U8 *a = (const U8 *)s1;
2143 register const U8 *b = (const U8 *)s2;
2146 PERL_ARGS_ASSERT_MY_MEMCMP;
2149 if ((tmp = *a++ - *b++))
2154 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2157 /* This vsprintf replacement should generally never get used, since
2158 vsprintf was available in both System V and BSD 2.11. (There may
2159 be some cross-compilation or embedded set-ups where it is needed,
2162 If you encounter a problem in this function, it's probably a symptom
2163 that Configure failed to detect your system's vprintf() function.
2164 See the section on "item vsprintf" in the INSTALL file.
2166 This version may compile on systems with BSD-ish <stdio.h>,
2167 but probably won't on others.
2170 #ifdef USE_CHAR_VSPRINTF
2175 vsprintf(char *dest, const char *pat, void *args)
2179 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2180 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2181 FILE_cnt(&fakebuf) = 32767;
2183 /* These probably won't compile -- If you really need
2184 this, you'll have to figure out some other method. */
2185 fakebuf._ptr = dest;
2186 fakebuf._cnt = 32767;
2191 fakebuf._flag = _IOWRT|_IOSTRG;
2192 _doprnt(pat, args, &fakebuf); /* what a kludge */
2193 #if defined(STDIO_PTR_LVALUE)
2194 *(FILE_ptr(&fakebuf)++) = '\0';
2196 /* PerlIO has probably #defined away fputc, but we want it here. */
2198 # undef fputc /* XXX Should really restore it later */
2200 (void)fputc('\0', &fakebuf);
2202 #ifdef USE_CHAR_VSPRINTF
2205 return 0; /* perl doesn't use return value */
2209 #endif /* HAS_VPRINTF */
2212 #if BYTEORDER != 0x4321
2214 Perl_my_swap(pTHX_ short s)
2216 #if (BYTEORDER & 1) == 0
2219 result = ((s & 255) << 8) + ((s >> 8) & 255);
2227 Perl_my_htonl(pTHX_ long l)
2231 char c[sizeof(long)];
2234 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
2235 #if BYTEORDER == 0x12345678
2238 u.c[0] = (l >> 24) & 255;
2239 u.c[1] = (l >> 16) & 255;
2240 u.c[2] = (l >> 8) & 255;
2244 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2245 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2250 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2251 u.c[o & 0xf] = (l >> s) & 255;
2259 Perl_my_ntohl(pTHX_ long l)
2263 char c[sizeof(long)];
2266 #if BYTEORDER == 0x1234
2267 u.c[0] = (l >> 24) & 255;
2268 u.c[1] = (l >> 16) & 255;
2269 u.c[2] = (l >> 8) & 255;
2273 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2274 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2281 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2282 l |= (u.c[o & 0xf] & 255) << s;
2289 #endif /* BYTEORDER != 0x4321 */
2293 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2294 * If these functions are defined,
2295 * the BYTEORDER is neither 0x1234 nor 0x4321.
2296 * However, this is not assumed.
2300 #define HTOLE(name,type) \
2302 name (register type n) \
2306 char c[sizeof(type)]; \
2309 register U32 s = 0; \
2310 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2311 u.c[i] = (n >> s) & 0xFF; \
2316 #define LETOH(name,type) \
2318 name (register type n) \
2322 char c[sizeof(type)]; \
2325 register U32 s = 0; \
2328 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2329 n |= ((type)(u.c[i] & 0xFF)) << s; \
2335 * Big-endian byte order functions.
2338 #define HTOBE(name,type) \
2340 name (register type n) \
2344 char c[sizeof(type)]; \
2347 register U32 s = 8*(sizeof(u.c)-1); \
2348 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2349 u.c[i] = (n >> s) & 0xFF; \
2354 #define BETOH(name,type) \
2356 name (register type n) \
2360 char c[sizeof(type)]; \
2363 register U32 s = 8*(sizeof(u.c)-1); \
2366 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2367 n |= ((type)(u.c[i] & 0xFF)) << s; \
2373 * If we just can't do it...
2376 #define NOT_AVAIL(name,type) \
2378 name (register type n) \
2380 Perl_croak_nocontext(#name "() not available"); \
2381 return n; /* not reached */ \
2385 #if defined(HAS_HTOVS) && !defined(htovs)
2388 #if defined(HAS_HTOVL) && !defined(htovl)
2391 #if defined(HAS_VTOHS) && !defined(vtohs)
2394 #if defined(HAS_VTOHL) && !defined(vtohl)
2398 #ifdef PERL_NEED_MY_HTOLE16
2400 HTOLE(Perl_my_htole16,U16)
2402 NOT_AVAIL(Perl_my_htole16,U16)
2405 #ifdef PERL_NEED_MY_LETOH16
2407 LETOH(Perl_my_letoh16,U16)
2409 NOT_AVAIL(Perl_my_letoh16,U16)
2412 #ifdef PERL_NEED_MY_HTOBE16
2414 HTOBE(Perl_my_htobe16,U16)
2416 NOT_AVAIL(Perl_my_htobe16,U16)
2419 #ifdef PERL_NEED_MY_BETOH16
2421 BETOH(Perl_my_betoh16,U16)
2423 NOT_AVAIL(Perl_my_betoh16,U16)
2427 #ifdef PERL_NEED_MY_HTOLE32
2429 HTOLE(Perl_my_htole32,U32)
2431 NOT_AVAIL(Perl_my_htole32,U32)
2434 #ifdef PERL_NEED_MY_LETOH32
2436 LETOH(Perl_my_letoh32,U32)
2438 NOT_AVAIL(Perl_my_letoh32,U32)
2441 #ifdef PERL_NEED_MY_HTOBE32
2443 HTOBE(Perl_my_htobe32,U32)
2445 NOT_AVAIL(Perl_my_htobe32,U32)
2448 #ifdef PERL_NEED_MY_BETOH32
2450 BETOH(Perl_my_betoh32,U32)
2452 NOT_AVAIL(Perl_my_betoh32,U32)
2456 #ifdef PERL_NEED_MY_HTOLE64
2458 HTOLE(Perl_my_htole64,U64)
2460 NOT_AVAIL(Perl_my_htole64,U64)
2463 #ifdef PERL_NEED_MY_LETOH64
2465 LETOH(Perl_my_letoh64,U64)
2467 NOT_AVAIL(Perl_my_letoh64,U64)
2470 #ifdef PERL_NEED_MY_HTOBE64
2472 HTOBE(Perl_my_htobe64,U64)
2474 NOT_AVAIL(Perl_my_htobe64,U64)
2477 #ifdef PERL_NEED_MY_BETOH64
2479 BETOH(Perl_my_betoh64,U64)
2481 NOT_AVAIL(Perl_my_betoh64,U64)
2485 #ifdef PERL_NEED_MY_HTOLES
2486 HTOLE(Perl_my_htoles,short)
2488 #ifdef PERL_NEED_MY_LETOHS
2489 LETOH(Perl_my_letohs,short)
2491 #ifdef PERL_NEED_MY_HTOBES
2492 HTOBE(Perl_my_htobes,short)
2494 #ifdef PERL_NEED_MY_BETOHS
2495 BETOH(Perl_my_betohs,short)
2498 #ifdef PERL_NEED_MY_HTOLEI
2499 HTOLE(Perl_my_htolei,int)
2501 #ifdef PERL_NEED_MY_LETOHI
2502 LETOH(Perl_my_letohi,int)
2504 #ifdef PERL_NEED_MY_HTOBEI
2505 HTOBE(Perl_my_htobei,int)
2507 #ifdef PERL_NEED_MY_BETOHI
2508 BETOH(Perl_my_betohi,int)
2511 #ifdef PERL_NEED_MY_HTOLEL
2512 HTOLE(Perl_my_htolel,long)
2514 #ifdef PERL_NEED_MY_LETOHL
2515 LETOH(Perl_my_letohl,long)
2517 #ifdef PERL_NEED_MY_HTOBEL
2518 HTOBE(Perl_my_htobel,long)
2520 #ifdef PERL_NEED_MY_BETOHL
2521 BETOH(Perl_my_betohl,long)
2525 Perl_my_swabn(void *ptr, int n)
2527 register char *s = (char *)ptr;
2528 register char *e = s + (n-1);
2531 PERL_ARGS_ASSERT_MY_SWABN;
2533 for (n /= 2; n > 0; s++, e--, n--) {
2541 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2543 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2546 register I32 This, that;
2552 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2554 PERL_FLUSHALL_FOR_CHILD;
2555 This = (*mode == 'w');
2559 taint_proper("Insecure %s%s", "EXEC");
2561 if (PerlProc_pipe(p) < 0)
2563 /* Try for another pipe pair for error return */
2564 if (PerlProc_pipe(pp) >= 0)
2566 while ((pid = PerlProc_fork()) < 0) {
2567 if (errno != EAGAIN) {
2568 PerlLIO_close(p[This]);
2569 PerlLIO_close(p[that]);
2571 PerlLIO_close(pp[0]);
2572 PerlLIO_close(pp[1]);
2576 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2585 /* Close parent's end of error status pipe (if any) */
2587 PerlLIO_close(pp[0]);
2588 #if defined(HAS_FCNTL) && defined(F_SETFD)
2589 /* Close error pipe automatically if exec works */
2590 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2593 /* Now dup our end of _the_ pipe to right position */
2594 if (p[THIS] != (*mode == 'r')) {
2595 PerlLIO_dup2(p[THIS], *mode == 'r');
2596 PerlLIO_close(p[THIS]);
2597 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2598 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2601 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2602 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2603 /* No automatic close - do it by hand */
2610 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2616 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2622 do_execfree(); /* free any memory malloced by child on fork */
2624 PerlLIO_close(pp[1]);
2625 /* Keep the lower of the two fd numbers */
2626 if (p[that] < p[This]) {
2627 PerlLIO_dup2(p[This], p[that]);
2628 PerlLIO_close(p[This]);
2632 PerlLIO_close(p[that]); /* close child's end of pipe */
2634 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2635 SvUPGRADE(sv,SVt_IV);
2637 PL_forkprocess = pid;
2638 /* If we managed to get status pipe check for exec fail */
2639 if (did_pipes && pid > 0) {
2644 while (n < sizeof(int)) {
2645 n1 = PerlLIO_read(pp[0],
2646 (void*)(((char*)&errkid)+n),
2652 PerlLIO_close(pp[0]);
2654 if (n) { /* Error */
2656 PerlLIO_close(p[This]);
2657 if (n != sizeof(int))
2658 Perl_croak(aTHX_ "panic: kid popen errno read");
2660 pid2 = wait4pid(pid, &status, 0);
2661 } while (pid2 == -1 && errno == EINTR);
2662 errno = errkid; /* Propagate errno from kid */
2667 PerlLIO_close(pp[0]);
2668 return PerlIO_fdopen(p[This], mode);
2670 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2671 return my_syspopen4(aTHX_ NULL, mode, n, args);
2673 Perl_croak(aTHX_ "List form of piped open not implemented");
2674 return (PerlIO *) NULL;
2679 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2680 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2682 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2686 register I32 This, that;
2689 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2693 PERL_ARGS_ASSERT_MY_POPEN;
2695 PERL_FLUSHALL_FOR_CHILD;
2698 return my_syspopen(aTHX_ cmd,mode);
2701 This = (*mode == 'w');
2703 if (doexec && PL_tainting) {
2705 taint_proper("Insecure %s%s", "EXEC");
2707 if (PerlProc_pipe(p) < 0)
2709 if (doexec && PerlProc_pipe(pp) >= 0)
2711 while ((pid = PerlProc_fork()) < 0) {
2712 if (errno != EAGAIN) {
2713 PerlLIO_close(p[This]);
2714 PerlLIO_close(p[that]);
2716 PerlLIO_close(pp[0]);
2717 PerlLIO_close(pp[1]);
2720 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2723 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2734 PerlLIO_close(pp[0]);
2735 #if defined(HAS_FCNTL) && defined(F_SETFD)
2736 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2739 if (p[THIS] != (*mode == 'r')) {
2740 PerlLIO_dup2(p[THIS], *mode == 'r');
2741 PerlLIO_close(p[THIS]);
2742 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2743 PerlLIO_close(p[THAT]);
2746 PerlLIO_close(p[THAT]);
2749 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2756 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2761 /* may or may not use the shell */
2762 do_exec3(cmd, pp[1], did_pipes);
2765 #endif /* defined OS2 */
2767 #ifdef PERLIO_USING_CRLF
2768 /* Since we circumvent IO layers when we manipulate low-level
2769 filedescriptors directly, need to manually switch to the
2770 default, binary, low-level mode; see PerlIOBuf_open(). */
2771 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2774 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2775 SvREADONLY_off(GvSV(tmpgv));
2776 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2777 SvREADONLY_on(GvSV(tmpgv));
2779 #ifdef THREADS_HAVE_PIDS
2780 PL_ppid = (IV)getppid();
2783 #ifdef PERL_USES_PL_PIDSTATUS
2784 hv_clear(PL_pidstatus); /* we have no children */
2790 do_execfree(); /* free any memory malloced by child on vfork */
2792 PerlLIO_close(pp[1]);
2793 if (p[that] < p[This]) {
2794 PerlLIO_dup2(p[This], p[that]);
2795 PerlLIO_close(p[This]);
2799 PerlLIO_close(p[that]);
2801 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2802 SvUPGRADE(sv,SVt_IV);
2804 PL_forkprocess = pid;
2805 if (did_pipes && pid > 0) {
2810 while (n < sizeof(int)) {
2811 n1 = PerlLIO_read(pp[0],
2812 (void*)(((char*)&errkid)+n),
2818 PerlLIO_close(pp[0]);
2820 if (n) { /* Error */
2822 PerlLIO_close(p[This]);
2823 if (n != sizeof(int))
2824 Perl_croak(aTHX_ "panic: kid popen errno read");
2826 pid2 = wait4pid(pid, &status, 0);
2827 } while (pid2 == -1 && errno == EINTR);
2828 errno = errkid; /* Propagate errno from kid */
2833 PerlLIO_close(pp[0]);
2834 return PerlIO_fdopen(p[This], mode);
2837 #if defined(atarist) || defined(EPOC)
2840 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2842 PERL_ARGS_ASSERT_MY_POPEN;
2843 PERL_FLUSHALL_FOR_CHILD;
2844 /* Call system's popen() to get a FILE *, then import it.
2845 used 0 for 2nd parameter to PerlIO_importFILE;
2848 return PerlIO_importFILE(popen(cmd, mode), 0);
2852 FILE *djgpp_popen();
2854 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2856 PERL_FLUSHALL_FOR_CHILD;
2857 /* Call system's popen() to get a FILE *, then import it.
2858 used 0 for 2nd parameter to PerlIO_importFILE;
2861 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2864 #if defined(__LIBCATAMOUNT__)
2866 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2874 #endif /* !DOSISH */
2876 /* this is called in parent before the fork() */
2878 Perl_atfork_lock(void)
2881 #if defined(USE_ITHREADS)
2882 /* locks must be held in locking order (if any) */
2884 MUTEX_LOCK(&PL_malloc_mutex);
2890 /* this is called in both parent and child after the fork() */
2892 Perl_atfork_unlock(void)
2895 #if defined(USE_ITHREADS)
2896 /* locks must be released in same order as in atfork_lock() */
2898 MUTEX_UNLOCK(&PL_malloc_mutex);
2907 #if defined(HAS_FORK)
2909 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2914 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2915 * handlers elsewhere in the code */
2920 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2921 Perl_croak_nocontext("fork() not available");
2923 #endif /* HAS_FORK */
2928 Perl_dump_fds(pTHX_ const char *const s)
2933 PERL_ARGS_ASSERT_DUMP_FDS;
2935 PerlIO_printf(Perl_debug_log,"%s", s);
2936 for (fd = 0; fd < 32; fd++) {
2937 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2938 PerlIO_printf(Perl_debug_log," %d",fd);
2940 PerlIO_printf(Perl_debug_log,"\n");
2943 #endif /* DUMP_FDS */
2947 dup2(int oldfd, int newfd)
2949 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2952 PerlLIO_close(newfd);
2953 return fcntl(oldfd, F_DUPFD, newfd);
2955 #define DUP2_MAX_FDS 256
2956 int fdtmp[DUP2_MAX_FDS];
2962 PerlLIO_close(newfd);
2963 /* good enough for low fd's... */
2964 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2965 if (fdx >= DUP2_MAX_FDS) {
2973 PerlLIO_close(fdtmp[--fdx]);
2980 #ifdef HAS_SIGACTION
2983 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2986 struct sigaction act, oact;
2989 /* only "parent" interpreter can diddle signals */
2990 if (PL_curinterp != aTHX)
2991 return (Sighandler_t) SIG_ERR;
2994 act.sa_handler = (void(*)(int))handler;
2995 sigemptyset(&act.sa_mask);
2998 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2999 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
3001 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
3002 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
3003 act.sa_flags |= SA_NOCLDWAIT;
3005 if (sigaction(signo, &act, &oact) == -1)
3006 return (Sighandler_t) SIG_ERR;
3008 return (Sighandler_t) oact.sa_handler;
3012 Perl_rsignal_state(pTHX_ int signo)
3014 struct sigaction oact;
3015 PERL_UNUSED_CONTEXT;
3017 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
3018 return (Sighandler_t) SIG_ERR;
3020 return (Sighandler_t) oact.sa_handler;
3024 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3027 struct sigaction act;
3029 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
3032 /* only "parent" interpreter can diddle signals */
3033 if (PL_curinterp != aTHX)
3037 act.sa_handler = (void(*)(int))handler;
3038 sigemptyset(&act.sa_mask);
3041 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
3042 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
3044 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
3045 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
3046 act.sa_flags |= SA_NOCLDWAIT;
3048 return sigaction(signo, &act, save);
3052 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3056 /* only "parent" interpreter can diddle signals */
3057 if (PL_curinterp != aTHX)
3061 return sigaction(signo, save, (struct sigaction *)NULL);
3064 #else /* !HAS_SIGACTION */
3067 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
3069 #if defined(USE_ITHREADS) && !defined(WIN32)
3070 /* only "parent" interpreter can diddle signals */
3071 if (PL_curinterp != aTHX)
3072 return (Sighandler_t) SIG_ERR;
3075 return PerlProc_signal(signo, handler);
3086 Perl_rsignal_state(pTHX_ int signo)
3089 Sighandler_t oldsig;
3091 #if defined(USE_ITHREADS) && !defined(WIN32)
3092 /* only "parent" interpreter can diddle signals */
3093 if (PL_curinterp != aTHX)
3094 return (Sighandler_t) SIG_ERR;
3098 oldsig = PerlProc_signal(signo, sig_trap);
3099 PerlProc_signal(signo, oldsig);
3101 PerlProc_kill(PerlProc_getpid(), signo);
3106 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3108 #if defined(USE_ITHREADS) && !defined(WIN32)
3109 /* only "parent" interpreter can diddle signals */
3110 if (PL_curinterp != aTHX)
3113 *save = PerlProc_signal(signo, handler);
3114 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
3118 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3120 #if defined(USE_ITHREADS) && !defined(WIN32)
3121 /* only "parent" interpreter can diddle signals */
3122 if (PL_curinterp != aTHX)
3125 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
3128 #endif /* !HAS_SIGACTION */
3129 #endif /* !PERL_MICRO */
3131 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
3132 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
3134 Perl_my_pclose(pTHX_ PerlIO *ptr)
3137 Sigsave_t hstat, istat, qstat;
3145 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
3146 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
3148 *svp = &PL_sv_undef;
3150 if (pid == -1) { /* Opened by popen. */
3151 return my_syspclose(ptr);
3154 close_failed = (PerlIO_close(ptr) == EOF);
3157 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
3160 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
3161 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
3162 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
3165 pid2 = wait4pid(pid, &status, 0);
3166 } while (pid2 == -1 && errno == EINTR);
3168 rsignal_restore(SIGHUP, &hstat);
3169 rsignal_restore(SIGINT, &istat);
3170 rsignal_restore(SIGQUIT, &qstat);
3176 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
3179 #if defined(__LIBCATAMOUNT__)
3181 Perl_my_pclose(pTHX_ PerlIO *ptr)
3186 #endif /* !DOSISH */
3188 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
3190 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
3194 PERL_ARGS_ASSERT_WAIT4PID;
3197 #ifdef PERL_USES_PL_PIDSTATUS
3200 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3201 pid, rather than a string form. */
3202 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3203 if (svp && *svp != &PL_sv_undef) {
3204 *statusp = SvIVX(*svp);
3205 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3213 hv_iterinit(PL_pidstatus);
3214 if ((entry = hv_iternext(PL_pidstatus))) {
3215 SV * const sv = hv_iterval(PL_pidstatus,entry);
3217 const char * const spid = hv_iterkey(entry,&len);
3219 assert (len == sizeof(Pid_t));
3220 memcpy((char *)&pid, spid, len);
3221 *statusp = SvIVX(sv);
3222 /* The hash iterator is currently on this entry, so simply
3223 calling hv_delete would trigger the lazy delete, which on
3224 aggregate does more work, beacuse next call to hv_iterinit()
3225 would spot the flag, and have to call the delete routine,
3226 while in the meantime any new entries can't re-use that
3228 hv_iterinit(PL_pidstatus);
3229 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3236 # ifdef HAS_WAITPID_RUNTIME
3237 if (!HAS_WAITPID_RUNTIME)
3240 result = PerlProc_waitpid(pid,statusp,flags);
3243 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3244 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
3247 #ifdef PERL_USES_PL_PIDSTATUS
3248 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3253 Perl_croak(aTHX_ "Can't do waitpid with flags");
3255 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3256 pidgone(result,*statusp);
3262 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3265 if (result < 0 && errno == EINTR) {
3267 errno = EINTR; /* reset in case a signal handler changed $! */
3271 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3273 #ifdef PERL_USES_PL_PIDSTATUS
3275 S_pidgone(pTHX_ Pid_t pid, int status)
3279 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3280 SvUPGRADE(sv,SVt_IV);
3281 SvIV_set(sv, status);
3286 #if defined(atarist) || defined(OS2) || defined(EPOC)
3289 int /* Cannot prototype with I32
3291 my_syspclose(PerlIO *ptr)
3294 Perl_my_pclose(pTHX_ PerlIO *ptr)
3297 /* Needs work for PerlIO ! */
3298 FILE * const f = PerlIO_findFILE(ptr);
3299 const I32 result = pclose(f);
3300 PerlIO_releaseFILE(ptr,f);
3308 Perl_my_pclose(pTHX_ PerlIO *ptr)
3310 /* Needs work for PerlIO ! */
3311 FILE * const f = PerlIO_findFILE(ptr);
3312 I32 result = djgpp_pclose(f);
3313 result = (result << 8) & 0xff00;
3314 PerlIO_releaseFILE(ptr,f);
3319 #define PERL_REPEATCPY_LINEAR 4
3321 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3323 PERL_ARGS_ASSERT_REPEATCPY;
3326 memset(to, *from, count);
3328 register char *p = to;
3329 I32 items, linear, half;
3331 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3332 for (items = 0; items < linear; ++items) {
3333 register const char *q = from;
3335 for (todo = len; todo > 0; todo--)
3340 while (items <= half) {
3341 I32 size = items * len;
3342 memcpy(p, to, size);
3348 memcpy(p, to, (count - items) * len);
3354 Perl_same_dirent(pTHX_ const char *a, const char *b)
3356 char *fa = strrchr(a,'/');
3357 char *fb = strrchr(b,'/');
3360 SV * const tmpsv = sv_newmortal();
3362 PERL_ARGS_ASSERT_SAME_DIRENT;
3375 sv_setpvs(tmpsv, ".");
3377 sv_setpvn(tmpsv, a, fa - a);
3378 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3381 sv_setpvs(tmpsv, ".");
3383 sv_setpvn(tmpsv, b, fb - b);
3384 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3386 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3387 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3389 #endif /* !HAS_RENAME */
3392 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3393 const char *const *const search_ext, I32 flags)
3396 const char *xfound = NULL;
3397 char *xfailed = NULL;
3398 char tmpbuf[MAXPATHLEN];
3403 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3404 # define SEARCH_EXTS ".bat", ".cmd", NULL
3405 # define MAX_EXT_LEN 4
3408 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3409 # define MAX_EXT_LEN 4
3412 # define SEARCH_EXTS ".pl", ".com", NULL
3413 # define MAX_EXT_LEN 4
3415 /* additional extensions to try in each dir if scriptname not found */
3417 static const char *const exts[] = { SEARCH_EXTS };
3418 const char *const *const ext = search_ext ? search_ext : exts;
3419 int extidx = 0, i = 0;
3420 const char *curext = NULL;
3422 PERL_UNUSED_ARG(search_ext);
3423 # define MAX_EXT_LEN 0
3426 PERL_ARGS_ASSERT_FIND_SCRIPT;
3429 * If dosearch is true and if scriptname does not contain path
3430 * delimiters, search the PATH for scriptname.
3432 * If SEARCH_EXTS is also defined, will look for each
3433 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3434 * while searching the PATH.
3436 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3437 * proceeds as follows:
3438 * If DOSISH or VMSISH:
3439 * + look for ./scriptname{,.foo,.bar}
3440 * + search the PATH for scriptname{,.foo,.bar}
3443 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3444 * this will not look in '.' if it's not in the PATH)
3449 # ifdef ALWAYS_DEFTYPES
3450 len = strlen(scriptname);
3451 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3452 int idx = 0, deftypes = 1;
3455 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3458 int idx = 0, deftypes = 1;
3461 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3463 /* The first time through, just add SEARCH_EXTS to whatever we
3464 * already have, so we can check for default file types. */
3466 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3472 if ((strlen(tmpbuf) + strlen(scriptname)
3473 + MAX_EXT_LEN) >= sizeof tmpbuf)
3474 continue; /* don't search dir with too-long name */
3475 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3479 if (strEQ(scriptname, "-"))
3481 if (dosearch) { /* Look in '.' first. */
3482 const char *cur = scriptname;
3484 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3486 if (strEQ(ext[i++],curext)) {
3487 extidx = -1; /* already has an ext */
3492 DEBUG_p(PerlIO_printf(Perl_debug_log,
3493 "Looking for %s\n",cur));
3494 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3495 && !S_ISDIR(PL_statbuf.st_mode)) {
3503 if (cur == scriptname) {
3504 len = strlen(scriptname);
3505 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3507 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3510 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3511 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3516 if (dosearch && !strchr(scriptname, '/')
3518 && !strchr(scriptname, '\\')
3520 && (s = PerlEnv_getenv("PATH")))
3524 bufend = s + strlen(s);
3525 while (s < bufend) {
3526 #if defined(atarist) || defined(DOSISH)
3531 && *s != ';'; len++, s++) {
3532 if (len < sizeof tmpbuf)
3535 if (len < sizeof tmpbuf)
3537 #else /* ! (atarist || DOSISH) */
3538 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3541 #endif /* ! (atarist || DOSISH) */
3544 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3545 continue; /* don't search dir with too-long name */
3547 # if defined(atarist) || defined(DOSISH)
3548 && tmpbuf[len - 1] != '/'
3549 && tmpbuf[len - 1] != '\\'
3552 tmpbuf[len++] = '/';
3553 if (len == 2 && tmpbuf[0] == '.')
3555 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3559 len = strlen(tmpbuf);
3560 if (extidx > 0) /* reset after previous loop */
3564 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3565 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3566 if (S_ISDIR(PL_statbuf.st_mode)) {
3570 } while ( retval < 0 /* not there */
3571 && extidx>=0 && ext[extidx] /* try an extension? */
3572 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3577 if (S_ISREG(PL_statbuf.st_mode)
3578 && cando(S_IRUSR,TRUE,&PL_statbuf)
3579 #if !defined(DOSISH)
3580 && cando(S_IXUSR,TRUE,&PL_statbuf)
3584 xfound = tmpbuf; /* bingo! */
3588 xfailed = savepv(tmpbuf);
3591 if (!xfound && !seen_dot && !xfailed &&
3592 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3593 || S_ISDIR(PL_statbuf.st_mode)))
3595 seen_dot = 1; /* Disable message. */
3597 if (flags & 1) { /* do or die? */
3598 Perl_croak(aTHX_ "Can't %s %s%s%s",
3599 (xfailed ? "execute" : "find"),
3600 (xfailed ? xfailed : scriptname),
3601 (xfailed ? "" : " on PATH"),
3602 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3607 scriptname = xfound;
3609 return (scriptname ? savepv(scriptname) : NULL);
3612 #ifndef PERL_GET_CONTEXT_DEFINED
3615 Perl_get_context(void)
3618 #if defined(USE_ITHREADS)
3619 # ifdef OLD_PTHREADS_API
3621 if (pthread_getspecific(PL_thr_key, &t))
3622 Perl_croak_nocontext("panic: pthread_getspecific");
3625 # ifdef I_MACH_CTHREADS
3626 return (void*)cthread_data(cthread_self());
3628 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3637 Perl_set_context(void *t)
3640 PERL_ARGS_ASSERT_SET_CONTEXT;
3641 #if defined(USE_ITHREADS)
3642 # ifdef I_MACH_CTHREADS
3643 cthread_set_data(cthread_self(), t);
3645 if (pthread_setspecific(PL_thr_key, t))
3646 Perl_croak_nocontext("panic: pthread_setspecific");
3653 #endif /* !PERL_GET_CONTEXT_DEFINED */
3655 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3664 Perl_get_op_names(pTHX)
3666 PERL_UNUSED_CONTEXT;
3667 return (char **)PL_op_name;
3671 Perl_get_op_descs(pTHX)
3673 PERL_UNUSED_CONTEXT;
3674 return (char **)PL_op_desc;
3678 Perl_get_no_modify(pTHX)
3680 PERL_UNUSED_CONTEXT;
3681 return PL_no_modify;
3685 Perl_get_opargs(pTHX)
3687 PERL_UNUSED_CONTEXT;
3688 return (U32 *)PL_opargs;
3692 Perl_get_ppaddr(pTHX)
3695 PERL_UNUSED_CONTEXT;
3696 return (PPADDR_t*)PL_ppaddr;
3699 #ifndef HAS_GETENV_LEN
3701 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3703 char * const env_trans = PerlEnv_getenv(env_elem);
3704 PERL_UNUSED_CONTEXT;
3705 PERL_ARGS_ASSERT_GETENV_LEN;
3707 *len = strlen(env_trans);
3714 Perl_get_vtbl(pTHX_ int vtbl_id)
3716 const MGVTBL* result;
3717 PERL_UNUSED_CONTEXT;
3721 result = &PL_vtbl_sv;
3724 result = &PL_vtbl_env;
3726 case want_vtbl_envelem:
3727 result = &PL_vtbl_envelem;
3730 result = &PL_vtbl_sig;
3732 case want_vtbl_sigelem:
3733 result = &PL_vtbl_sigelem;
3735 case want_vtbl_pack:
3736 result = &PL_vtbl_pack;
3738 case want_vtbl_packelem:
3739 result = &PL_vtbl_packelem;
3741 case want_vtbl_dbline:
3742 result = &PL_vtbl_dbline;
3745 result = &PL_vtbl_isa;
3747 case want_vtbl_isaelem:
3748 result = &PL_vtbl_isaelem;
3750 case want_vtbl_arylen:
3751 result = &PL_vtbl_arylen;
3753 case want_vtbl_mglob:
3754 result = &PL_vtbl_mglob;
3756 case want_vtbl_nkeys:
3757 result = &PL_vtbl_nkeys;
3759 case want_vtbl_taint:
3760 result = &PL_vtbl_taint;
3762 case want_vtbl_substr:
3763 result = &PL_vtbl_substr;
3766 result = &PL_vtbl_vec;
3769 result = &PL_vtbl_pos;
3772 result = &PL_vtbl_bm;
3775 result = &PL_vtbl_fm;
3777 case want_vtbl_uvar:
3778 result = &PL_vtbl_uvar;
3780 case want_vtbl_defelem:
3781 result = &PL_vtbl_defelem;
3783 case want_vtbl_regexp:
3784 result = &PL_vtbl_regexp;
3786 case want_vtbl_regdata:
3787 result = &PL_vtbl_regdata;
3789 case want_vtbl_regdatum:
3790 result = &PL_vtbl_regdatum;
3792 #ifdef USE_LOCALE_COLLATE
3793 case want_vtbl_collxfrm:
3794 result = &PL_vtbl_collxfrm;
3797 case want_vtbl_amagic:
3798 result = &PL_vtbl_amagic;
3800 case want_vtbl_amagicelem:
3801 result = &PL_vtbl_amagicelem;
3803 case want_vtbl_backref:
3804 result = &PL_vtbl_backref;
3806 case want_vtbl_utf8:
3807 result = &PL_vtbl_utf8;
3813 return (MGVTBL*)result;
3817 Perl_my_fflush_all(pTHX)
3819 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3820 return PerlIO_flush(NULL);
3822 # if defined(HAS__FWALK)
3823 extern int fflush(FILE *);
3824 /* undocumented, unprototyped, but very useful BSDism */
3825 extern void _fwalk(int (*)(FILE *));
3829 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3831 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3832 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3834 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3835 open_max = sysconf(_SC_OPEN_MAX);
3838 open_max = FOPEN_MAX;
3841 open_max = OPEN_MAX;
3852 for (i = 0; i < open_max; i++)
3853 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3854 STDIO_STREAM_ARRAY[i]._file < open_max &&
3855 STDIO_STREAM_ARRAY[i]._flag)
3856 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3860 SETERRNO(EBADF,RMS_IFI);
3867 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3869 const char * const name
3870 = gv && (isGV(gv) || isGV_with_GP(gv)) ? GvENAME(gv) : NULL;
3872 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3873 if (ckWARN(WARN_IO)) {
3874 const char * const direction =
3875 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3877 Perl_warner(aTHX_ packWARN(WARN_IO),
3878 "Filehandle %s opened only for %sput",
3881 Perl_warner(aTHX_ packWARN(WARN_IO),
3882 "Filehandle opened only for %sput", direction);
3889 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3891 warn_type = WARN_CLOSED;
3895 warn_type = WARN_UNOPENED;
3898 if (ckWARN(warn_type)) {
3899 const char * const pars =
3900 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3901 const char * const func =
3903 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3904 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3905 op < 0 ? "" : /* handle phoney cases */
3907 const char * const type =
3909 (OP_IS_SOCKET(op) ||
3910 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3911 "socket" : "filehandle");
3912 if (name && *name) {
3913 Perl_warner(aTHX_ packWARN(warn_type),
3914 "%s%s on %s %s %s", func, pars, vile, type, name);
3915 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3917 aTHX_ packWARN(warn_type),
3918 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3923 Perl_warner(aTHX_ packWARN(warn_type),
3924 "%s%s on %s %s", func, pars, vile, type);
3925 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3927 aTHX_ packWARN(warn_type),
3928 "\t(Are you trying to call %s%s on dirhandle?)\n",
3936 /* XXX Add documentation after final interface and behavior is decided */
3937 /* May want to show context for error, so would pass Perl_bslash_c(pTHX_ const char* current, const char* start, const bool output_warning)
3938 U8 source = *current;
3940 May want to add eg, WARN_REGEX
3944 Perl_grok_bslash_c(pTHX_ const char source, const bool output_warning)
3949 if (! isASCII(source)) {
3950 Perl_croak(aTHX_ "Character following \"\\c\" must be ASCII");
3953 result = toCTRL(source);
3954 if (! isCNTRL(result)) {
3955 if (source == '{') {
3956 Perl_croak(aTHX_ "It is proposed that \"\\c{\" no longer be valid. It has historically evaluated to\n \";\". If you disagree with this proposal, send email to perl5-porters@perl.org\nOtherwise, or in the meantime, you can work around this failure by changing\n\"\\c{\" to \";\"");
3958 else if (output_warning) {
3961 if (! isALNUM(result)) {
3962 clearer[i++] = '\\';
3964 clearer[i++] = result;
3965 clearer[i++] = '\0';
3967 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
3968 "\"\\c%c\" more clearly written simply as \"%s\"",
3978 Perl_grok_bslash_o(pTHX_ const char *s,
3981 const char** error_msg,
3982 const bool output_warning)
3985 /* Documentation to be supplied when interface nailed down finally
3986 * This returns FALSE if there is an error which the caller need not recover
3987 * from; , otherwise TRUE. In either case the caller should look at *len
3989 * s points to a string that begins with 'o', and the previous character
3991 * uv points to a UV that will hold the output value, valid only if the
3992 * return from the function is TRUE
3993 * len on success will point to the next character in the string past the
3994 * end of this construct.
3995 * on failure, it will point to the failure
3996 * error_msg is a pointer that will be set to an internal buffer giving an
3997 * error message upon failure (the return is FALSE). Untouched if
3999 * output_warning says whether to output any warning messages, or suppress
4004 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
4005 | PERL_SCAN_DISALLOW_PREFIX
4006 /* XXX Until the message is improved in grok_oct, handle errors
4008 | PERL_SCAN_SILENT_ILLDIGIT;
4010 PERL_ARGS_ASSERT_GROK_BSLASH_O;
4017 *len = 1; /* Move past the o */
4018 *error_msg = "Missing braces on \\o{}";
4024 *len = 2; /* Move past the o{ */
4025 *error_msg = "Missing right brace on \\o{";
4029 /* Return past the '}' no matter what is inside the braces */
4030 *len = e - s + 2; /* 2 = 1 for the o + 1 for the '}' */
4032 s++; /* Point to first digit */
4034 numbers_len = e - s;
4035 if (numbers_len == 0) {
4036 *error_msg = "Number with no digits";
4040 *uv = NATIVE_TO_UNI(grok_oct(s, &numbers_len, &flags, NULL));
4041 /* Note that if has non-octal, will ignore everything starting with that up
4044 if (output_warning && numbers_len != (STRLEN) (e - s)) {
4045 Perl_ck_warner(aTHX_ packWARN(WARN_DIGIT),
4046 /* diag_listed_as: Non-octal character '%c'. Resolved as "%s" */
4047 "Non-octal character '%c'. Resolved as \"\\o{%.*s}\"",
4056 /* To workaround core dumps from the uninitialised tm_zone we get the
4057 * system to give us a reasonable struct to copy. This fix means that
4058 * strftime uses the tm_zone and tm_gmtoff values returned by
4059 * localtime(time()). That should give the desired result most of the
4060 * time. But probably not always!
4062 * This does not address tzname aspects of NETaa14816.
4067 # ifndef STRUCT_TM_HASZONE
4068 # define STRUCT_TM_HASZONE
4072 #ifdef STRUCT_TM_HASZONE /* Backward compat */
4073 # ifndef HAS_TM_TM_ZONE
4074 # define HAS_TM_TM_ZONE
4079 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
4081 #ifdef HAS_TM_TM_ZONE
4083 const struct tm* my_tm;
4084 PERL_ARGS_ASSERT_INIT_TM;
4086 my_tm = localtime(&now);
4088 Copy(my_tm, ptm, 1, struct tm);
4090 PERL_ARGS_ASSERT_INIT_TM;
4091 PERL_UNUSED_ARG(ptm);
4096 * mini_mktime - normalise struct tm values without the localtime()
4097 * semantics (and overhead) of mktime().
4100 Perl_mini_mktime(pTHX_ struct tm *ptm)
4104 int month, mday, year, jday;
4105 int odd_cent, odd_year;
4106 PERL_UNUSED_CONTEXT;
4108 PERL_ARGS_ASSERT_MINI_MKTIME;
4110 #define DAYS_PER_YEAR 365
4111 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
4112 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
4113 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
4114 #define SECS_PER_HOUR (60*60)
4115 #define SECS_PER_DAY (24*SECS_PER_HOUR)
4116 /* parentheses deliberately absent on these two, otherwise they don't work */
4117 #define MONTH_TO_DAYS 153/5
4118 #define DAYS_TO_MONTH 5/153
4119 /* offset to bias by March (month 4) 1st between month/mday & year finding */
4120 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
4121 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
4122 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
4125 * Year/day algorithm notes:
4127 * With a suitable offset for numeric value of the month, one can find
4128 * an offset into the year by considering months to have 30.6 (153/5) days,
4129 * using integer arithmetic (i.e., with truncation). To avoid too much
4130 * messing about with leap days, we consider January and February to be
4131 * the 13th and 14th month of the previous year. After that transformation,
4132 * we need the month index we use to be high by 1 from 'normal human' usage,
4133 * so the month index values we use run from 4 through 15.
4135 * Given that, and the rules for the Gregorian calendar (leap years are those
4136 * divisible by 4 unless also divisible by 100, when they must be divisible
4137 * by 400 instead), we can simply calculate the number of days since some
4138 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
4139 * the days we derive from our month index, and adding in the day of the
4140 * month. The value used here is not adjusted for the actual origin which
4141 * it normally would use (1 January A.D. 1), since we're not exposing it.
4142 * We're only building the value so we can turn around and get the
4143 * normalised values for the year, month, day-of-month, and day-of-year.
4145 * For going backward, we need to bias the value we're using so that we find
4146 * the right year value. (Basically, we don't want the contribution of
4147 * March 1st to the number to apply while deriving the year). Having done
4148 * that, we 'count up' the contribution to the year number by accounting for
4149 * full quadracenturies (400-year periods) with their extra leap days, plus
4150 * the contribution from full centuries (to avoid counting in the lost leap
4151 * days), plus the contribution from full quad-years (to count in the normal
4152 * leap days), plus the leftover contribution from any non-leap years.
4153 * At this point, if we were working with an actual leap day, we'll have 0
4154 * days left over. This is also true for March 1st, however. So, we have
4155 * to special-case that result, and (earlier) keep track of the 'odd'
4156 * century and year contributions. If we got 4 extra centuries in a qcent,
4157 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
4158 * Otherwise, we add back in the earlier bias we removed (the 123 from
4159 * figuring in March 1st), find the month index (integer division by 30.6),
4160 * and the remainder is the day-of-month. We then have to convert back to
4161 * 'real' months (including fixing January and February from being 14/15 in
4162 * the previous year to being in the proper year). After that, to get
4163 * tm_yday, we work with the normalised year and get a new yearday value for
4164 * January 1st, which we subtract from the yearday value we had earlier,
4165 * representing the date we've re-built. This is done from January 1
4166 * because tm_yday is 0-origin.
4168 * Since POSIX time routines are only guaranteed to work for times since the
4169 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
4170 * applies Gregorian calendar rules even to dates before the 16th century
4171 * doesn't bother me. Besides, you'd need cultural context for a given
4172 * date to know whether it was Julian or Gregorian calendar, and that's
4173 * outside the scope for this routine. Since we convert back based on the
4174 * same rules we used to build the yearday, you'll only get strange results
4175 * for input which needed normalising, or for the 'odd' century years which
4176 * were leap years in the Julian calander but not in the Gregorian one.
4177 * I can live with that.
4179 * This algorithm also fails to handle years before A.D. 1 gracefully, but
4180 * that's still outside the scope for POSIX time manipulation, so I don't
4184 year = 1900 + ptm->tm_year;
4185 month = ptm->tm_mon;
4186 mday = ptm->tm_mday;
4187 /* allow given yday with no month & mday to dominate the result */
4188 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
4191 jday = 1 + ptm->tm_yday;
4200 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
4201 yearday += month*MONTH_TO_DAYS + mday + jday;
4203 * Note that we don't know when leap-seconds were or will be,
4204 * so we have to trust the user if we get something which looks
4205 * like a sensible leap-second. Wild values for seconds will
4206 * be rationalised, however.
4208 if ((unsigned) ptm->tm_sec <= 60) {
4215 secs += 60 * ptm->tm_min;
4216 secs += SECS_PER_HOUR * ptm->tm_hour;
4218 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
4219 /* got negative remainder, but need positive time */
4220 /* back off an extra day to compensate */
4221 yearday += (secs/SECS_PER_DAY)-1;
4222 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
4225 yearday += (secs/SECS_PER_DAY);
4226 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
4229 else if (secs >= SECS_PER_DAY) {
4230 yearday += (secs/SECS_PER_DAY);
4231 secs %= SECS_PER_DAY;
4233 ptm->tm_hour = secs/SECS_PER_HOUR;
4234 secs %= SECS_PER_HOUR;
4235 ptm->tm_min = secs/60;
4237 ptm->tm_sec += secs;
4238 /* done with time of day effects */
4240 * The algorithm for yearday has (so far) left it high by 428.
4241 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
4242 * bias it by 123 while trying to figure out what year it
4243 * really represents. Even with this tweak, the reverse
4244 * translation fails for years before A.D. 0001.
4245 * It would still fail for Feb 29, but we catch that one below.
4247 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
4248 yearday -= YEAR_ADJUST;
4249 year = (yearday / DAYS_PER_QCENT) * 400;
4250 yearday %= DAYS_PER_QCENT;
4251 odd_cent = yearday / DAYS_PER_CENT;
4252 year += odd_cent * 100;
4253 yearday %= DAYS_PER_CENT;
4254 year += (yearday / DAYS_PER_QYEAR) * 4;
4255 yearday %= DAYS_PER_QYEAR;
4256 odd_year = yearday / DAYS_PER_YEAR;
4258 yearday %= DAYS_PER_YEAR;
4259 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
4264 yearday += YEAR_ADJUST; /* recover March 1st crock */
4265 month = yearday*DAYS_TO_MONTH;
4266 yearday -= month*MONTH_TO_DAYS;
4267 /* recover other leap-year adjustment */
4276 ptm->tm_year = year - 1900;
4278 ptm->tm_mday = yearday;
4279 ptm->tm_mon = month;
4283 ptm->tm_mon = month - 1;
4285 /* re-build yearday based on Jan 1 to get tm_yday */
4287 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
4288 yearday += 14*MONTH_TO_DAYS + 1;
4289 ptm->tm_yday = jday - yearday;
4290 /* fix tm_wday if not overridden by caller */
4291 if ((unsigned)ptm->tm_wday > 6)
4292 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
4296 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)
4304 PERL_ARGS_ASSERT_MY_STRFTIME;
4306 init_tm(&mytm); /* XXX workaround - see init_tm() above */
4309 mytm.tm_hour = hour;
4310 mytm.tm_mday = mday;
4312 mytm.tm_year = year;
4313 mytm.tm_wday = wday;
4314 mytm.tm_yday = yday;
4315 mytm.tm_isdst = isdst;
4317 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
4318 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
4323 #ifdef HAS_TM_TM_GMTOFF
4324 mytm.tm_gmtoff = mytm2.tm_gmtoff;
4326 #ifdef HAS_TM_TM_ZONE
4327 mytm.tm_zone = mytm2.tm_zone;
4332 Newx(buf, buflen, char);
4333 len = strftime(buf, buflen, fmt, &mytm);
4335 ** The following is needed to handle to the situation where
4336 ** tmpbuf overflows. Basically we want to allocate a buffer
4337 ** and try repeatedly. The reason why it is so complicated
4338 ** is that getting a return value of 0 from strftime can indicate
4339 ** one of the following:
4340 ** 1. buffer overflowed,
4341 ** 2. illegal conversion specifier, or
4342 ** 3. the format string specifies nothing to be returned(not
4343 ** an error). This could be because format is an empty string
4344 ** or it specifies %p that yields an empty string in some locale.
4345 ** If there is a better way to make it portable, go ahead by
4348 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4351 /* Possibly buf overflowed - try again with a bigger buf */
4352 const int fmtlen = strlen(fmt);
4353 int bufsize = fmtlen + buflen;
4355 Renew(buf, bufsize, char);
4357 buflen = strftime(buf, bufsize, fmt, &mytm);
4358 if (buflen > 0 && buflen < bufsize)
4360 /* heuristic to prevent out-of-memory errors */
4361 if (bufsize > 100*fmtlen) {
4367 Renew(buf, bufsize, char);
4372 Perl_croak(aTHX_ "panic: no strftime");
4378 #define SV_CWD_RETURN_UNDEF \
4379 sv_setsv(sv, &PL_sv_undef); \
4382 #define SV_CWD_ISDOT(dp) \
4383 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4384 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4387 =head1 Miscellaneous Functions
4389 =for apidoc getcwd_sv
4391 Fill the sv with current working directory
4396 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4397 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4398 * getcwd(3) if available
4399 * Comments from the orignal:
4400 * This is a faster version of getcwd. It's also more dangerous
4401 * because you might chdir out of a directory that you can't chdir
4405 Perl_getcwd_sv(pTHX_ register SV *sv)
4409 #ifndef INCOMPLETE_TAINTS
4413 PERL_ARGS_ASSERT_GETCWD_SV;
4417 char buf[MAXPATHLEN];
4419 /* Some getcwd()s automatically allocate a buffer of the given
4420 * size from the heap if they are given a NULL buffer pointer.
4421 * The problem is that this behaviour is not portable. */
4422 if (getcwd(buf, sizeof(buf) - 1)) {
4427 sv_setsv(sv, &PL_sv_undef);
4435 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4439 SvUPGRADE(sv, SVt_PV);
4441 if (PerlLIO_lstat(".", &statbuf) < 0) {
4442 SV_CWD_RETURN_UNDEF;
4445 orig_cdev = statbuf.st_dev;
4446 orig_cino = statbuf.st_ino;
4456 if (PerlDir_chdir("..") < 0) {
4457 SV_CWD_RETURN_UNDEF;
4459 if (PerlLIO_stat(".", &statbuf) < 0) {
4460 SV_CWD_RETURN_UNDEF;
4463 cdev = statbuf.st_dev;
4464 cino = statbuf.st_ino;
4466 if (odev == cdev && oino == cino) {
4469 if (!(dir = PerlDir_open("."))) {
4470 SV_CWD_RETURN_UNDEF;
4473 while ((dp = PerlDir_read(dir)) != NULL) {
4475 namelen = dp->d_namlen;
4477 namelen = strlen(dp->d_name);
4480 if (SV_CWD_ISDOT(dp)) {
4484 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4485 SV_CWD_RETURN_UNDEF;
4488 tdev = statbuf.st_dev;
4489 tino = statbuf.st_ino;
4490 if (tino == oino && tdev == odev) {
4496 SV_CWD_RETURN_UNDEF;
4499 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4500 SV_CWD_RETURN_UNDEF;
4503 SvGROW(sv, pathlen + namelen + 1);
4507 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4510 /* prepend current directory to the front */
4512 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4513 pathlen += (namelen + 1);
4515 #ifdef VOID_CLOSEDIR
4518 if (PerlDir_close(dir) < 0) {
4519 SV_CWD_RETURN_UNDEF;
4525 SvCUR_set(sv, pathlen);
4529 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4530 SV_CWD_RETURN_UNDEF;
4533 if (PerlLIO_stat(".", &statbuf) < 0) {
4534 SV_CWD_RETURN_UNDEF;
4537 cdev = statbuf.st_dev;
4538 cino = statbuf.st_ino;
4540 if (cdev != orig_cdev || cino != orig_cino) {
4541 Perl_croak(aTHX_ "Unstable directory path, "
4542 "current directory changed unexpectedly");
4553 #define VERSION_MAX 0x7FFFFFFF
4556 =for apidoc prescan_version
4558 Validate that a given string can be parsed as a version object, but doesn't
4559 actually perform the parsing. Can use either strict or lax validation rules.
4560 Can optionally set a number of hint variables to save the parsing code
4561 some time when tokenizing.
4566 Perl_prescan_version(pTHX_ const char *s, bool strict,
4567 const char **errstr,
4568 bool *sqv, int *ssaw_decimal, int *swidth, bool *salpha) {
4569 bool qv = (sqv ? *sqv : FALSE);
4571 int saw_decimal = 0;
4575 PERL_ARGS_ASSERT_PRESCAN_VERSION;
4577 if (qv && isDIGIT(*d))
4578 goto dotted_decimal_version;
4580 if (*d == 'v') { /* explicit v-string */
4585 else { /* degenerate v-string */
4586 /* requires v1.2.3 */
4587 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4590 dotted_decimal_version:
4591 if (strict && d[0] == '0' && isDIGIT(d[1])) {
4592 /* no leading zeros allowed */
4593 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4596 while (isDIGIT(*d)) /* integer part */
4602 d++; /* decimal point */
4607 /* require v1.2.3 */
4608 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4611 goto version_prescan_finish;
4618 while (isDIGIT(*d)) { /* just keep reading */
4620 while (isDIGIT(*d)) {
4622 /* maximum 3 digits between decimal */
4623 if (strict && j > 3) {
4624 BADVERSION(s,errstr,"Invalid version format (maximum 3 digits between decimals)");
4629 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4632 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4637 else if (*d == '.') {
4639 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4644 else if (!isDIGIT(*d)) {
4650 if (strict && i < 2) {
4651 /* requires v1.2.3 */
4652 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4655 } /* end if dotted-decimal */
4657 { /* decimal versions */
4658 /* special strict case for leading '.' or '0' */
4661 BADVERSION(s,errstr,"Invalid version format (0 before decimal required)");
4663 if (*d == '0' && isDIGIT(d[1])) {
4664 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4668 /* consume all of the integer part */
4672 /* look for a fractional part */
4674 /* we found it, so consume it */
4678 else if (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') {
4681 BADVERSION(s,errstr,"Invalid version format (version required)");
4683 /* found just an integer */
4684 goto version_prescan_finish;
4686 else if ( d == s ) {
4687 /* didn't find either integer or period */
4688 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4690 else if (*d == '_') {
4691 /* underscore can't come after integer part */
4693 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4695 else if (isDIGIT(d[1])) {
4696 BADVERSION(s,errstr,"Invalid version format (alpha without decimal)");
4699 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4703 /* anything else after integer part is just invalid data */
4704 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4707 /* scan the fractional part after the decimal point*/
4709 if (!isDIGIT(*d) && (strict || ! (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') )) {
4710 /* strict or lax-but-not-the-end */
4711 BADVERSION(s,errstr,"Invalid version format (fractional part required)");
4714 while (isDIGIT(*d)) {
4716 if (*d == '.' && isDIGIT(d[-1])) {
4718 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4721 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions must begin with 'v')");
4723 d = (char *)s; /* start all over again */
4725 goto dotted_decimal_version;
4729 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4732 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4734 if ( ! isDIGIT(d[1]) ) {
4735 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4743 version_prescan_finish:
4747 if (!isDIGIT(*d) && (! (!*d || *d == ';' || *d == '{' || *d == '}') )) {
4748 /* trailing non-numeric data */
4749 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4757 *ssaw_decimal = saw_decimal;
4764 =for apidoc scan_version
4766 Returns a pointer to the next character after the parsed
4767 version string, as well as upgrading the passed in SV to
4770 Function must be called with an already existing SV like
4773 s = scan_version(s, SV *sv, bool qv);
4775 Performs some preprocessing to the string to ensure that
4776 it has the correct characteristics of a version. Flags the
4777 object if it contains an underscore (which denotes this
4778 is an alpha version). The boolean qv denotes that the version
4779 should be interpreted as if it had multiple decimals, even if
4786 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4791 const char *errstr = NULL;
4792 int saw_decimal = 0;
4796 AV * const av = newAV();
4797 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4799 PERL_ARGS_ASSERT_SCAN_VERSION;
4801 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4803 #ifndef NODEFAULT_SHAREKEYS
4804 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4807 while (isSPACE(*s)) /* leading whitespace is OK */
4810 last = prescan_version(s, FALSE, &errstr, &qv, &saw_decimal, &width, &alpha);
4812 /* "undef" is a special case and not an error */
4813 if ( ! ( *s == 'u' && strEQ(s,"undef")) ) {
4814 Perl_croak(aTHX_ "%s", errstr);
4824 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4826 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4827 if ( !qv && width < 3 )
4828 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4830 while (isDIGIT(*pos))
4832 if (!isALPHA(*pos)) {
4838 /* this is atoi() that delimits on underscores */
4839 const char *end = pos;
4843 /* the following if() will only be true after the decimal
4844 * point of a version originally created with a bare
4845 * floating point number, i.e. not quoted in any way
4847 if ( !qv && s > start && saw_decimal == 1 ) {
4851 rev += (*s - '0') * mult;
4853 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4854 || (PERL_ABS(rev) > VERSION_MAX )) {
4855 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4856 "Integer overflow in version %d",VERSION_MAX);
4867 while (--end >= s) {
4869 rev += (*end - '0') * mult;
4871 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4872 || (PERL_ABS(rev) > VERSION_MAX )) {
4873 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4874 "Integer overflow in version");
4883 /* Append revision */
4884 av_push(av, newSViv(rev));
4889 else if ( *pos == '.' )
4891 else if ( *pos == '_' && isDIGIT(pos[1]) )
4893 else if ( *pos == ',' && isDIGIT(pos[1]) )
4895 else if ( isDIGIT(*pos) )
4902 while ( isDIGIT(*pos) )
4907 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4915 if ( qv ) { /* quoted versions always get at least three terms*/
4916 I32 len = av_len(av);
4917 /* This for loop appears to trigger a compiler bug on OS X, as it
4918 loops infinitely. Yes, len is negative. No, it makes no sense.
4919 Compiler in question is:
4920 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4921 for ( len = 2 - len; len > 0; len-- )
4922 av_push(MUTABLE_AV(sv), newSViv(0));
4926 av_push(av, newSViv(0));
4929 /* need to save off the current version string for later */
4931 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4932 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4933 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4935 else if ( s > start ) {
4936 SV * orig = newSVpvn(start,s-start);
4937 if ( qv && saw_decimal == 1 && *start != 'v' ) {
4938 /* need to insert a v to be consistent */
4939 sv_insert(orig, 0, 0, "v", 1);
4941 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4944 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4945 av_push(av, newSViv(0));
4948 /* And finally, store the AV in the hash */
4949 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4951 /* fix RT#19517 - special case 'undef' as string */
4952 if ( *s == 'u' && strEQ(s,"undef") ) {
4960 =for apidoc new_version
4962 Returns a new version object based on the passed in SV:
4964 SV *sv = new_version(SV *ver);
4966 Does not alter the passed in ver SV. See "upg_version" if you
4967 want to upgrade the SV.
4973 Perl_new_version(pTHX_ SV *ver)
4976 SV * const rv = newSV(0);
4977 PERL_ARGS_ASSERT_NEW_VERSION;
4978 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4981 AV * const av = newAV();
4983 /* This will get reblessed later if a derived class*/
4984 SV * const hv = newSVrv(rv, "version");
4985 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4986 #ifndef NODEFAULT_SHAREKEYS
4987 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4993 /* Begin copying all of the elements */
4994 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4995 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4997 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4998 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
5000 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
5002 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
5003 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
5006 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
5008 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
5009 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
5012 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
5013 /* This will get reblessed later if a derived class*/
5014 for ( key = 0; key <= av_len(sav); key++ )
5016 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
5017 av_push(av, newSViv(rev));
5020 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
5025 const MAGIC* const mg = SvVSTRING_mg(ver);
5026 if ( mg ) { /* already a v-string */
5027 const STRLEN len = mg->mg_len;
5028 char * const version = savepvn( (const char*)mg->mg_ptr, len);
5029 sv_setpvn(rv,version,len);
5030 /* this is for consistency with the pure Perl class */
5031 if ( isDIGIT(*version) )
5032 sv_insert(rv, 0, 0, "v", 1);
5037 sv_setsv(rv,ver); /* make a duplicate */
5042 return upg_version(rv, FALSE);
5046 =for apidoc upg_version
5048 In-place upgrade of the supplied SV to a version object.
5050 SV *sv = upg_version(SV *sv, bool qv);
5052 Returns a pointer to the upgraded SV. Set the boolean qv if you want
5053 to force this SV to be interpreted as an "extended" version.
5059 Perl_upg_version(pTHX_ SV *ver, bool qv)
5061 const char *version, *s;
5066 PERL_ARGS_ASSERT_UPG_VERSION;
5068 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
5070 /* may get too much accuracy */
5072 #ifdef USE_LOCALE_NUMERIC
5073 char *loc = setlocale(LC_NUMERIC, "C");
5075 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
5076 #ifdef USE_LOCALE_NUMERIC
5077 setlocale(LC_NUMERIC, loc);
5079 while (tbuf[len-1] == '0' && len > 0) len--;
5080 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
5081 version = savepvn(tbuf, len);
5084 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
5085 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
5089 else /* must be a string or something like a string */
5092 version = savepv(SvPV(ver,len));
5094 # if PERL_VERSION > 5
5095 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
5096 if ( len >= 3 && !instr(version,".") && !instr(version,"_")) {
5097 /* may be a v-string */
5098 char *testv = (char *)version;
5100 for (tlen=0; tlen < len; tlen++, testv++) {
5101 /* if one of the characters is non-text assume v-string */
5102 if (testv[0] < ' ') {
5103 SV * const nsv = sv_newmortal();
5106 int saw_decimal = 0;
5107 sv_setpvf(nsv,"v%vd",ver);
5108 pos = nver = savepv(SvPV_nolen(nsv));
5110 /* scan the resulting formatted string */
5111 pos++; /* skip the leading 'v' */
5112 while ( *pos == '.' || isDIGIT(*pos) ) {
5118 /* is definitely a v-string */
5119 if ( saw_decimal >= 2 ) {
5131 s = scan_version(version, ver, qv);
5133 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
5134 "Version string '%s' contains invalid data; "
5135 "ignoring: '%s'", version, s);
5143 Validates that the SV contains valid internal structure for a version object.
5144 It may be passed either the version object (RV) or the hash itself (HV). If
5145 the structure is valid, it returns the HV. If the structure is invalid,
5148 SV *hv = vverify(sv);
5150 Note that it only confirms the bare minimum structure (so as not to get
5151 confused by derived classes which may contain additional hash entries):
5155 =item * The SV is an HV or a reference to an HV
5157 =item * The hash contains a "version" key
5159 =item * The "version" key has a reference to an AV as its value
5167 Perl_vverify(pTHX_ SV *vs)
5171 PERL_ARGS_ASSERT_VVERIFY;
5176 /* see if the appropriate elements exist */
5177 if ( SvTYPE(vs) == SVt_PVHV
5178 && hv_exists(MUTABLE_HV(vs), "version", 7)
5179 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
5180 && SvTYPE(sv) == SVt_PVAV )
5189 Accepts a version object and returns the normalized floating
5190 point representation. Call like:
5194 NOTE: you can pass either the object directly or the SV
5195 contained within the RV.
5197 The SV returned has a refcount of 1.
5203 Perl_vnumify(pTHX_ SV *vs)
5211 PERL_ARGS_ASSERT_VNUMIFY;
5213 /* extract the HV from the object */
5216 Perl_croak(aTHX_ "Invalid version object");
5218 /* see if various flags exist */
5219 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5221 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
5222 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
5227 /* attempt to retrieve the version array */
5228 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
5229 return newSVpvs("0");
5235 return newSVpvs("0");
5238 digit = SvIV(*av_fetch(av, 0, 0));
5239 sv = Perl_newSVpvf(aTHX_ "%d.", (int)PERL_ABS(digit));
5240 for ( i = 1 ; i < len ; i++ )
5242 digit = SvIV(*av_fetch(av, i, 0));
5244 const int denom = (width == 2 ? 10 : 100);
5245 const div_t term = div((int)PERL_ABS(digit),denom);
5246 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
5249 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5255 digit = SvIV(*av_fetch(av, len, 0));
5256 if ( alpha && width == 3 ) /* alpha version */
5258 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5262 sv_catpvs(sv, "000");
5270 Accepts a version object and returns the normalized string
5271 representation. Call like:
5275 NOTE: you can pass either the object directly or the SV
5276 contained within the RV.
5278 The SV returned has a refcount of 1.
5284 Perl_vnormal(pTHX_ SV *vs)
5291 PERL_ARGS_ASSERT_VNORMAL;
5293 /* extract the HV from the object */
5296 Perl_croak(aTHX_ "Invalid version object");
5298 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5300 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
5305 return newSVpvs("");
5307 digit = SvIV(*av_fetch(av, 0, 0));
5308 sv = Perl_newSVpvf(aTHX_ "v%"IVdf, (IV)digit);
5309 for ( i = 1 ; i < len ; i++ ) {
5310 digit = SvIV(*av_fetch(av, i, 0));
5311 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5316 /* handle last digit specially */
5317 digit = SvIV(*av_fetch(av, len, 0));
5319 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
5321 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5324 if ( len <= 2 ) { /* short version, must be at least three */
5325 for ( len = 2 - len; len != 0; len-- )
5332 =for apidoc vstringify
5334 In order to maintain maximum compatibility with earlier versions
5335 of Perl, this function will return either the floating point
5336 notation or the multiple dotted notation, depending on whether
5337 the original version contained 1 or more dots, respectively.
5339 The SV returned has a refcount of 1.
5345 Perl_vstringify(pTHX_ SV *vs)
5347 PERL_ARGS_ASSERT_VSTRINGIFY;
5349 /* extract the HV from the object */
5352 Perl_croak(aTHX_ "Invalid version object");
5354 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
5356 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
5360 return &PL_sv_undef;
5363 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
5373 Version object aware cmp. Both operands must already have been
5374 converted into version objects.
5380 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
5383 bool lalpha = FALSE;
5384 bool ralpha = FALSE;
5389 PERL_ARGS_ASSERT_VCMP;
5391 /* extract the HVs from the objects */
5394 if ( ! ( lhv && rhv ) )
5395 Perl_croak(aTHX_ "Invalid version object");
5397 /* get the left hand term */
5398 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
5399 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
5402 /* and the right hand term */
5403 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
5404 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
5412 while ( i <= m && retval == 0 )
5414 left = SvIV(*av_fetch(lav,i,0));
5415 right = SvIV(*av_fetch(rav,i,0));
5423 /* tiebreaker for alpha with identical terms */
5424 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
5426 if ( lalpha && !ralpha )
5430 else if ( ralpha && !lalpha)
5436 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
5440 while ( i <= r && retval == 0 )
5442 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
5443 retval = -1; /* not a match after all */
5449 while ( i <= l && retval == 0 )
5451 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
5452 retval = +1; /* not a match after all */
5460 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
5461 # define EMULATE_SOCKETPAIR_UDP
5464 #ifdef EMULATE_SOCKETPAIR_UDP
5466 S_socketpair_udp (int fd[2]) {
5468 /* Fake a datagram socketpair using UDP to localhost. */
5469 int sockets[2] = {-1, -1};
5470 struct sockaddr_in addresses[2];
5472 Sock_size_t size = sizeof(struct sockaddr_in);
5473 unsigned short port;
5476 memset(&addresses, 0, sizeof(addresses));
5479 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
5480 if (sockets[i] == -1)
5481 goto tidy_up_and_fail;
5483 addresses[i].sin_family = AF_INET;
5484 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5485 addresses[i].sin_port = 0; /* kernel choses port. */
5486 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
5487 sizeof(struct sockaddr_in)) == -1)
5488 goto tidy_up_and_fail;
5491 /* Now have 2 UDP sockets. Find out which port each is connected to, and
5492 for each connect the other socket to it. */
5495 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
5497 goto tidy_up_and_fail;
5498 if (size != sizeof(struct sockaddr_in))
5499 goto abort_tidy_up_and_fail;
5500 /* !1 is 0, !0 is 1 */
5501 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
5502 sizeof(struct sockaddr_in)) == -1)
5503 goto tidy_up_and_fail;
5506 /* Now we have 2 sockets connected to each other. I don't trust some other
5507 process not to have already sent a packet to us (by random) so send
5508 a packet from each to the other. */
5511 /* I'm going to send my own port number. As a short.
5512 (Who knows if someone somewhere has sin_port as a bitfield and needs
5513 this routine. (I'm assuming crays have socketpair)) */
5514 port = addresses[i].sin_port;
5515 got = PerlLIO_write(sockets[i], &port, sizeof(port));
5516 if (got != sizeof(port)) {
5518 goto tidy_up_and_fail;
5519 goto abort_tidy_up_and_fail;
5523 /* Packets sent. I don't trust them to have arrived though.
5524 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
5525 connect to localhost will use a second kernel thread. In 2.6 the
5526 first thread running the connect() returns before the second completes,
5527 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
5528 returns 0. Poor programs have tripped up. One poor program's authors'
5529 had a 50-1 reverse stock split. Not sure how connected these were.)
5530 So I don't trust someone not to have an unpredictable UDP stack.
5534 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5535 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5539 FD_SET((unsigned int)sockets[0], &rset);
5540 FD_SET((unsigned int)sockets[1], &rset);
5542 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5543 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5544 || !FD_ISSET(sockets[1], &rset)) {
5545 /* I hope this is portable and appropriate. */
5547 goto tidy_up_and_fail;
5548 goto abort_tidy_up_and_fail;
5552 /* And the paranoia department even now doesn't trust it to have arrive
5553 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5555 struct sockaddr_in readfrom;
5556 unsigned short buffer[2];
5561 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5562 sizeof(buffer), MSG_DONTWAIT,
5563 (struct sockaddr *) &readfrom, &size);
5565 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5567 (struct sockaddr *) &readfrom, &size);
5571 goto tidy_up_and_fail;
5572 if (got != sizeof(port)
5573 || size != sizeof(struct sockaddr_in)
5574 /* Check other socket sent us its port. */
5575 || buffer[0] != (unsigned short) addresses[!i].sin_port
5576 /* Check kernel says we got the datagram from that socket */
5577 || readfrom.sin_family != addresses[!i].sin_family
5578 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5579 || readfrom.sin_port != addresses[!i].sin_port)
5580 goto abort_tidy_up_and_fail;
5583 /* My caller (my_socketpair) has validated that this is non-NULL */
5586 /* I hereby declare this connection open. May God bless all who cross
5590 abort_tidy_up_and_fail:
5591 errno = ECONNABORTED;
5595 if (sockets[0] != -1)
5596 PerlLIO_close(sockets[0]);
5597 if (sockets[1] != -1)
5598 PerlLIO_close(sockets[1]);
5603 #endif /* EMULATE_SOCKETPAIR_UDP */
5605 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5607 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5608 /* Stevens says that family must be AF_LOCAL, protocol 0.
5609 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5614 struct sockaddr_in listen_addr;
5615 struct sockaddr_in connect_addr;
5620 || family != AF_UNIX
5623 errno = EAFNOSUPPORT;
5631 #ifdef EMULATE_SOCKETPAIR_UDP
5632 if (type == SOCK_DGRAM)
5633 return S_socketpair_udp(fd);
5636 listener = PerlSock_socket(AF_INET, type, 0);
5639 memset(&listen_addr, 0, sizeof(listen_addr));
5640 listen_addr.sin_family = AF_INET;
5641 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5642 listen_addr.sin_port = 0; /* kernel choses port. */
5643 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5644 sizeof(listen_addr)) == -1)
5645 goto tidy_up_and_fail;
5646 if (PerlSock_listen(listener, 1) == -1)
5647 goto tidy_up_and_fail;
5649 connector = PerlSock_socket(AF_INET, type, 0);
5650 if (connector == -1)
5651 goto tidy_up_and_fail;
5652 /* We want to find out the port number to connect to. */
5653 size = sizeof(connect_addr);
5654 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5656 goto tidy_up_and_fail;
5657 if (size != sizeof(connect_addr))
5658 goto abort_tidy_up_and_fail;
5659 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5660 sizeof(connect_addr)) == -1)
5661 goto tidy_up_and_fail;
5663 size = sizeof(listen_addr);
5664 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5667 goto tidy_up_and_fail;
5668 if (size != sizeof(listen_addr))
5669 goto abort_tidy_up_and_fail;
5670 PerlLIO_close(listener);
5671 /* Now check we are talking to ourself by matching port and host on the
5673 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5675 goto tidy_up_and_fail;
5676 if (size != sizeof(connect_addr)
5677 || listen_addr.sin_family != connect_addr.sin_family
5678 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5679 || listen_addr.sin_port != connect_addr.sin_port) {
5680 goto abort_tidy_up_and_fail;
5686 abort_tidy_up_and_fail:
5688 errno = ECONNABORTED; /* This would be the standard thing to do. */
5690 # ifdef ECONNREFUSED
5691 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5693 errno = ETIMEDOUT; /* Desperation time. */
5700 PerlLIO_close(listener);
5701 if (connector != -1)
5702 PerlLIO_close(connector);
5704 PerlLIO_close(acceptor);
5710 /* In any case have a stub so that there's code corresponding
5711 * to the my_socketpair in global.sym. */
5713 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5714 #ifdef HAS_SOCKETPAIR
5715 return socketpair(family, type, protocol, fd);
5724 =for apidoc sv_nosharing
5726 Dummy routine which "shares" an SV when there is no sharing module present.
5727 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5728 Exists to avoid test for a NULL function pointer and because it could
5729 potentially warn under some level of strict-ness.
5735 Perl_sv_nosharing(pTHX_ SV *sv)
5737 PERL_UNUSED_CONTEXT;
5738 PERL_UNUSED_ARG(sv);
5743 =for apidoc sv_destroyable
5745 Dummy routine which reports that object can be destroyed when there is no
5746 sharing module present. It ignores its single SV argument, and returns
5747 'true'. Exists to avoid test for a NULL function pointer and because it
5748 could potentially warn under some level of strict-ness.
5754 Perl_sv_destroyable(pTHX_ SV *sv)
5756 PERL_UNUSED_CONTEXT;
5757 PERL_UNUSED_ARG(sv);
5762 Perl_parse_unicode_opts(pTHX_ const char **popt)
5764 const char *p = *popt;
5767 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5771 opt = (U32) atoi(p);
5774 if (*p && *p != '\n' && *p != '\r') {
5775 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
5777 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5783 case PERL_UNICODE_STDIN:
5784 opt |= PERL_UNICODE_STDIN_FLAG; break;
5785 case PERL_UNICODE_STDOUT:
5786 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5787 case PERL_UNICODE_STDERR:
5788 opt |= PERL_UNICODE_STDERR_FLAG; break;
5789 case PERL_UNICODE_STD:
5790 opt |= PERL_UNICODE_STD_FLAG; break;
5791 case PERL_UNICODE_IN:
5792 opt |= PERL_UNICODE_IN_FLAG; break;
5793 case PERL_UNICODE_OUT:
5794 opt |= PERL_UNICODE_OUT_FLAG; break;
5795 case PERL_UNICODE_INOUT:
5796 opt |= PERL_UNICODE_INOUT_FLAG; break;
5797 case PERL_UNICODE_LOCALE:
5798 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5799 case PERL_UNICODE_ARGV:
5800 opt |= PERL_UNICODE_ARGV_FLAG; break;
5801 case PERL_UNICODE_UTF8CACHEASSERT:
5802 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5804 if (*p != '\n' && *p != '\r') {
5805 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
5808 "Unknown Unicode option letter '%c'", *p);
5815 opt = PERL_UNICODE_DEFAULT_FLAGS;
5817 the_end_of_the_opts_parser:
5819 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5820 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5821 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5833 * This is really just a quick hack which grabs various garbage
5834 * values. It really should be a real hash algorithm which
5835 * spreads the effect of every input bit onto every output bit,
5836 * if someone who knows about such things would bother to write it.
5837 * Might be a good idea to add that function to CORE as well.
5838 * No numbers below come from careful analysis or anything here,
5839 * except they are primes and SEED_C1 > 1E6 to get a full-width
5840 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5841 * probably be bigger too.
5844 # define SEED_C1 1000003
5845 #define SEED_C4 73819
5847 # define SEED_C1 25747
5848 #define SEED_C4 20639
5852 #define SEED_C5 26107
5854 #ifndef PERL_NO_DEV_RANDOM
5859 # include <starlet.h>
5860 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5861 * in 100-ns units, typically incremented ever 10 ms. */
5862 unsigned int when[2];
5864 # ifdef HAS_GETTIMEOFDAY
5865 struct timeval when;
5871 /* This test is an escape hatch, this symbol isn't set by Configure. */
5872 #ifndef PERL_NO_DEV_RANDOM
5873 #ifndef PERL_RANDOM_DEVICE
5874 /* /dev/random isn't used by default because reads from it will block
5875 * if there isn't enough entropy available. You can compile with
5876 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5877 * is enough real entropy to fill the seed. */
5878 # define PERL_RANDOM_DEVICE "/dev/urandom"
5880 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5882 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5891 _ckvmssts(sys$gettim(when));
5892 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5894 # ifdef HAS_GETTIMEOFDAY
5895 PerlProc_gettimeofday(&when,NULL);
5896 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5899 u = (U32)SEED_C1 * when;
5902 u += SEED_C3 * (U32)PerlProc_getpid();
5903 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5904 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5905 u += SEED_C5 * (U32)PTR2UV(&when);
5911 Perl_get_hash_seed(pTHX)
5914 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5920 if (s && isDIGIT(*s))
5921 myseed = (UV)Atoul(s);
5923 #ifdef USE_HASH_SEED_EXPLICIT
5927 /* Compute a random seed */
5928 (void)seedDrand01((Rand_seed_t)seed());
5929 myseed = (UV)(Drand01() * (NV)UV_MAX);
5930 #if RANDBITS < (UVSIZE * 8)
5931 /* Since there are not enough randbits to to reach all
5932 * the bits of a UV, the low bits might need extra
5933 * help. Sum in another random number that will
5934 * fill in the low bits. */
5936 (UV)(Drand01() * (NV)((((UV)1) << ((UVSIZE * 8 - RANDBITS))) - 1));
5937 #endif /* RANDBITS < (UVSIZE * 8) */
5938 if (myseed == 0) { /* Superparanoia. */
5939 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5941 Perl_croak(aTHX_ "Your random numbers are not that random");
5944 PL_rehash_seed_set = TRUE;
5951 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5953 const char * const stashpv = CopSTASHPV(c);
5954 const char * const name = HvNAME_get(hv);
5955 PERL_UNUSED_CONTEXT;
5956 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5958 if (stashpv == name)
5960 if (stashpv && name)
5961 if (strEQ(stashpv, name))
5968 #ifdef PERL_GLOBAL_STRUCT
5970 #define PERL_GLOBAL_STRUCT_INIT
5971 #include "opcode.h" /* the ppaddr and check */
5974 Perl_init_global_struct(pTHX)
5976 struct perl_vars *plvarsp = NULL;
5977 # ifdef PERL_GLOBAL_STRUCT
5978 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5979 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5980 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5981 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5982 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5986 plvarsp = PL_VarsPtr;
5987 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5993 # define PERLVAR(var,type) /**/
5994 # define PERLVARA(var,n,type) /**/
5995 # define PERLVARI(var,type,init) plvarsp->var = init;
5996 # define PERLVARIC(var,type,init) plvarsp->var = init;
5997 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5998 # include "perlvars.h"
6004 # ifdef PERL_GLOBAL_STRUCT
6007 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
6008 if (!plvarsp->Gppaddr)
6012 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
6013 if (!plvarsp->Gcheck)
6015 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
6016 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
6018 # ifdef PERL_SET_VARS
6019 PERL_SET_VARS(plvarsp);
6021 # undef PERL_GLOBAL_STRUCT_INIT
6026 #endif /* PERL_GLOBAL_STRUCT */
6028 #ifdef PERL_GLOBAL_STRUCT
6031 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
6033 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
6034 # ifdef PERL_GLOBAL_STRUCT
6035 # ifdef PERL_UNSET_VARS
6036 PERL_UNSET_VARS(plvarsp);
6038 free(plvarsp->Gppaddr);
6039 free(plvarsp->Gcheck);
6040 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
6046 #endif /* PERL_GLOBAL_STRUCT */
6050 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
6051 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
6052 * given, and you supply your own implementation.
6054 * The default implementation reads a single env var, PERL_MEM_LOG,
6055 * expecting one or more of the following:
6057 * \d+ - fd fd to write to : must be 1st (atoi)
6058 * 'm' - memlog was PERL_MEM_LOG=1
6059 * 's' - svlog was PERL_SV_LOG=1
6060 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
6062 * This makes the logger controllable enough that it can reasonably be
6063 * added to the system perl.
6066 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
6067 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
6069 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
6071 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
6072 * writes to. In the default logger, this is settable at runtime.
6074 #ifndef PERL_MEM_LOG_FD
6075 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
6078 #ifndef PERL_MEM_LOG_NOIMPL
6080 # ifdef DEBUG_LEAKING_SCALARS
6081 # define SV_LOG_SERIAL_FMT " [%lu]"
6082 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
6084 # define SV_LOG_SERIAL_FMT
6085 # define _SV_LOG_SERIAL_ARG(sv)
6089 S_mem_log_common(enum mem_log_type mlt, const UV n,
6090 const UV typesize, const char *type_name, const SV *sv,
6091 Malloc_t oldalloc, Malloc_t newalloc,
6092 const char *filename, const int linenumber,
6093 const char *funcname)
6097 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
6099 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
6102 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
6104 /* We can't use SVs or PerlIO for obvious reasons,
6105 * so we'll use stdio and low-level IO instead. */
6106 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
6108 # ifdef HAS_GETTIMEOFDAY
6109 # define MEM_LOG_TIME_FMT "%10d.%06d: "
6110 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
6112 gettimeofday(&tv, 0);
6114 # define MEM_LOG_TIME_FMT "%10d: "
6115 # define MEM_LOG_TIME_ARG (int)when
6119 /* If there are other OS specific ways of hires time than
6120 * gettimeofday() (see ext/Time-HiRes), the easiest way is
6121 * probably that they would be used to fill in the struct
6125 int fd = atoi(pmlenv);
6127 fd = PERL_MEM_LOG_FD;
6129 if (strchr(pmlenv, 't')) {
6130 len = my_snprintf(buf, sizeof(buf),
6131 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
6132 PerlLIO_write(fd, buf, len);
6136 len = my_snprintf(buf, sizeof(buf),
6137 "alloc: %s:%d:%s: %"IVdf" %"UVuf
6138 " %s = %"IVdf": %"UVxf"\n",
6139 filename, linenumber, funcname, n, typesize,
6140 type_name, n * typesize, PTR2UV(newalloc));
6143 len = my_snprintf(buf, sizeof(buf),
6144 "realloc: %s:%d:%s: %"IVdf" %"UVuf
6145 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
6146 filename, linenumber, funcname, n, typesize,
6147 type_name, n * typesize, PTR2UV(oldalloc),
6151 len = my_snprintf(buf, sizeof(buf),
6152 "free: %s:%d:%s: %"UVxf"\n",
6153 filename, linenumber, funcname,
6158 len = my_snprintf(buf, sizeof(buf),
6159 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
6160 mlt == MLT_NEW_SV ? "new" : "del",
6161 filename, linenumber, funcname,
6162 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
6167 PerlLIO_write(fd, buf, len);
6171 #endif /* !PERL_MEM_LOG_NOIMPL */
6173 #ifndef PERL_MEM_LOG_NOIMPL
6175 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
6176 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
6178 /* this is suboptimal, but bug compatible. User is providing their
6179 own implemenation, but is getting these functions anyway, and they
6180 do nothing. But _NOIMPL users should be able to cope or fix */
6182 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
6183 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
6187 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
6189 const char *filename, const int linenumber,
6190 const char *funcname)
6192 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
6193 NULL, NULL, newalloc,
6194 filename, linenumber, funcname);
6199 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
6200 Malloc_t oldalloc, Malloc_t newalloc,
6201 const char *filename, const int linenumber,
6202 const char *funcname)
6204 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
6205 NULL, oldalloc, newalloc,
6206 filename, linenumber, funcname);
6211 Perl_mem_log_free(Malloc_t oldalloc,
6212 const char *filename, const int linenumber,
6213 const char *funcname)
6215 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
6216 filename, linenumber, funcname);
6221 Perl_mem_log_new_sv(const SV *sv,
6222 const char *filename, const int linenumber,
6223 const char *funcname)
6225 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
6226 filename, linenumber, funcname);
6230 Perl_mem_log_del_sv(const SV *sv,
6231 const char *filename, const int linenumber,
6232 const char *funcname)
6234 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
6235 filename, linenumber, funcname);
6238 #endif /* PERL_MEM_LOG */
6241 =for apidoc my_sprintf
6243 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
6244 the length of the string written to the buffer. Only rare pre-ANSI systems
6245 need the wrapper function - usually this is a direct call to C<sprintf>.
6249 #ifndef SPRINTF_RETURNS_STRLEN
6251 Perl_my_sprintf(char *buffer, const char* pat, ...)
6254 PERL_ARGS_ASSERT_MY_SPRINTF;
6255 va_start(args, pat);
6256 vsprintf(buffer, pat, args);
6258 return strlen(buffer);
6263 =for apidoc my_snprintf
6265 The C library C<snprintf> functionality, if available and
6266 standards-compliant (uses C<vsnprintf>, actually). However, if the
6267 C<vsnprintf> is not available, will unfortunately use the unsafe
6268 C<vsprintf> which can overrun the buffer (there is an overrun check,
6269 but that may be too late). Consider using C<sv_vcatpvf> instead, or
6270 getting C<vsnprintf>.
6275 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
6280 PERL_ARGS_ASSERT_MY_SNPRINTF;
6281 va_start(ap, format);
6282 #ifdef HAS_VSNPRINTF
6283 retval = vsnprintf(buffer, len, format, ap);
6285 retval = vsprintf(buffer, format, ap);
6288 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
6289 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
6290 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
6295 =for apidoc my_vsnprintf
6297 The C library C<vsnprintf> if available and standards-compliant.
6298 However, if if the C<vsnprintf> is not available, will unfortunately
6299 use the unsafe C<vsprintf> which can overrun the buffer (there is an
6300 overrun check, but that may be too late). Consider using
6301 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
6306 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
6313 PERL_ARGS_ASSERT_MY_VSNPRINTF;
6315 Perl_va_copy(ap, apc);
6316 # ifdef HAS_VSNPRINTF
6317 retval = vsnprintf(buffer, len, format, apc);
6319 retval = vsprintf(buffer, format, apc);
6322 # ifdef HAS_VSNPRINTF
6323 retval = vsnprintf(buffer, len, format, ap);
6325 retval = vsprintf(buffer, format, ap);
6327 #endif /* #ifdef NEED_VA_COPY */
6328 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
6329 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
6330 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
6335 Perl_my_clearenv(pTHX)
6338 #if ! defined(PERL_MICRO)
6339 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
6341 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
6342 # if defined(USE_ENVIRON_ARRAY)
6343 # if defined(USE_ITHREADS)
6344 /* only the parent thread can clobber the process environment */
6345 if (PL_curinterp == aTHX)
6346 # endif /* USE_ITHREADS */
6348 # if ! defined(PERL_USE_SAFE_PUTENV)
6349 if ( !PL_use_safe_putenv) {
6351 if (environ == PL_origenviron)
6352 environ = (char**)safesysmalloc(sizeof(char*));
6354 for (i = 0; environ[i]; i++)
6355 (void)safesysfree(environ[i]);
6358 # else /* PERL_USE_SAFE_PUTENV */
6359 # if defined(HAS_CLEARENV)
6361 # elif defined(HAS_UNSETENV)
6362 int bsiz = 80; /* Most envvar names will be shorter than this. */
6363 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
6364 char *buf = (char*)safesysmalloc(bufsiz);
6365 while (*environ != NULL) {
6366 char *e = strchr(*environ, '=');
6367 int l = e ? e - *environ : (int)strlen(*environ);
6369 (void)safesysfree(buf);
6370 bsiz = l + 1; /* + 1 for the \0. */
6371 buf = (char*)safesysmalloc(bufsiz);
6373 memcpy(buf, *environ, l);
6375 (void)unsetenv(buf);
6377 (void)safesysfree(buf);
6378 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
6379 /* Just null environ and accept the leakage. */
6381 # endif /* HAS_CLEARENV || HAS_UNSETENV */
6382 # endif /* ! PERL_USE_SAFE_PUTENV */
6384 # endif /* USE_ENVIRON_ARRAY */
6385 # endif /* PERL_IMPLICIT_SYS || WIN32 */
6386 #endif /* PERL_MICRO */
6389 #ifdef PERL_IMPLICIT_CONTEXT
6391 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
6392 the global PL_my_cxt_index is incremented, and that value is assigned to
6393 that module's static my_cxt_index (who's address is passed as an arg).
6394 Then, for each interpreter this function is called for, it makes sure a
6395 void* slot is available to hang the static data off, by allocating or
6396 extending the interpreter's PL_my_cxt_list array */
6398 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
6400 Perl_my_cxt_init(pTHX_ int *index, size_t size)
6404 PERL_ARGS_ASSERT_MY_CXT_INIT;
6406 /* this module hasn't been allocated an index yet */
6407 #if defined(USE_ITHREADS)
6408 MUTEX_LOCK(&PL_my_ctx_mutex);
6410 *index = PL_my_cxt_index++;
6411 #if defined(USE_ITHREADS)
6412 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6416 /* make sure the array is big enough */
6417 if (PL_my_cxt_size <= *index) {
6418 if (PL_my_cxt_size) {
6419 while (PL_my_cxt_size <= *index)
6420 PL_my_cxt_size *= 2;
6421 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6424 PL_my_cxt_size = 16;
6425 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6428 /* newSV() allocates one more than needed */
6429 p = (void*)SvPVX(newSV(size-1));
6430 PL_my_cxt_list[*index] = p;
6431 Zero(p, size, char);
6435 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6438 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
6443 PERL_ARGS_ASSERT_MY_CXT_INDEX;
6445 for (index = 0; index < PL_my_cxt_index; index++) {
6446 const char *key = PL_my_cxt_keys[index];
6447 /* try direct pointer compare first - there are chances to success,
6448 * and it's much faster.
6450 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
6457 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
6463 PERL_ARGS_ASSERT_MY_CXT_INIT;
6465 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
6467 /* this module hasn't been allocated an index yet */
6468 #if defined(USE_ITHREADS)
6469 MUTEX_LOCK(&PL_my_ctx_mutex);
6471 index = PL_my_cxt_index++;
6472 #if defined(USE_ITHREADS)
6473 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6477 /* make sure the array is big enough */
6478 if (PL_my_cxt_size <= index) {
6479 int old_size = PL_my_cxt_size;
6481 if (PL_my_cxt_size) {
6482 while (PL_my_cxt_size <= index)
6483 PL_my_cxt_size *= 2;
6484 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6485 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6488 PL_my_cxt_size = 16;
6489 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6490 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6492 for (i = old_size; i < PL_my_cxt_size; i++) {
6493 PL_my_cxt_keys[i] = 0;
6494 PL_my_cxt_list[i] = 0;
6497 PL_my_cxt_keys[index] = my_cxt_key;
6498 /* newSV() allocates one more than needed */
6499 p = (void*)SvPVX(newSV(size-1));
6500 PL_my_cxt_list[index] = p;
6501 Zero(p, size, char);
6504 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6505 #endif /* PERL_IMPLICIT_CONTEXT */
6508 Perl_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
6512 const char *vn = NULL;
6513 SV *const module = PL_stack_base[ax];
6515 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
6517 if (items >= 2) /* version supplied as bootstrap arg */
6518 sv = PL_stack_base[ax + 1];
6520 /* XXX GV_ADDWARN */
6522 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", module, vn), 0);
6523 if (!sv || !SvOK(sv)) {
6525 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", module, vn), 0);
6529 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
6530 SV *pmsv = sv_derived_from(sv, "version")
6531 ? sv : sv_2mortal(new_version(sv));
6532 xssv = upg_version(xssv, 0);
6533 if ( vcmp(pmsv,xssv) ) {
6534 SV *string = vstringify(xssv);
6535 SV *xpt = Perl_newSVpvf(aTHX_ "%"SVf" object version %"SVf
6536 " does not match ", module, string);
6538 SvREFCNT_dec(string);
6539 string = vstringify(pmsv);
6542 Perl_sv_catpvf(aTHX_ xpt, "$%"SVf"::%s %"SVf, module, vn,
6545 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %"SVf, string);
6547 SvREFCNT_dec(string);
6549 Perl_sv_2mortal(aTHX_ xpt);
6550 Perl_croak_sv(aTHX_ xpt);
6556 Perl_xs_apiversion_bootcheck(pTHX_ SV *module, const char *api_p,
6560 SV *compver = Perl_newSVpvn_flags(aTHX_ api_p, api_len, SVs_TEMP);
6563 PERL_ARGS_ASSERT_XS_APIVERSION_BOOTCHECK;
6565 /* This might croak */
6566 compver = upg_version(compver, 0);
6567 /* This should never croak */
6568 runver = new_version(PL_apiversion);
6569 if (vcmp(compver, runver)) {
6570 SV *compver_string = vstringify(compver);
6571 SV *runver_string = vstringify(runver);
6572 xpt = Perl_newSVpvf(aTHX_ "Perl API version %"SVf
6573 " of %"SVf" does not match %"SVf,
6574 compver_string, module, runver_string);
6575 Perl_sv_2mortal(aTHX_ xpt);
6577 SvREFCNT_dec(compver_string);
6578 SvREFCNT_dec(runver_string);
6580 SvREFCNT_dec(runver);
6582 Perl_croak_sv(aTHX_ xpt);
6587 Perl_my_strlcat(char *dst, const char *src, Size_t size)
6589 Size_t used, length, copy;
6592 length = strlen(src);
6593 if (size > 0 && used < size - 1) {
6594 copy = (length >= size - used) ? size - used - 1 : length;
6595 memcpy(dst + used, src, copy);
6596 dst[used + copy] = '\0';
6598 return used + length;
6604 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
6606 Size_t length, copy;
6608 length = strlen(src);
6610 copy = (length >= size) ? size - 1 : length;
6611 memcpy(dst, src, copy);
6618 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
6619 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
6620 long _ftol( double ); /* Defined by VC6 C libs. */
6621 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
6625 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
6628 SV * const dbsv = GvSVn(PL_DBsub);
6629 const bool save_taint = PL_tainted;
6631 /* We do not care about using sv to call CV;
6632 * it's for informational purposes only.
6635 PERL_ARGS_ASSERT_GET_DB_SUB;
6639 if (!PERLDB_SUB_NN) {
6642 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6643 || strEQ(GvNAME(gv), "END")
6644 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6645 !( (SvTYPE(*svp) == SVt_PVGV)
6646 && (GvCV((const GV *)*svp) == cv)
6647 && (gv = (GV *)*svp)
6651 /* Use GV from the stack as a fallback. */
6652 /* GV is potentially non-unique, or contain different CV. */
6653 SV * const tmp = newRV(MUTABLE_SV(cv));
6654 sv_setsv(dbsv, tmp);
6658 gv_efullname3(dbsv, gv, NULL);
6662 const int type = SvTYPE(dbsv);
6663 if (type < SVt_PVIV && type != SVt_IV)
6664 sv_upgrade(dbsv, SVt_PVIV);
6665 (void)SvIOK_on(dbsv);
6666 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6668 TAINT_IF(save_taint);
6672 Perl_my_dirfd(pTHX_ DIR * dir) {
6674 /* Most dirfd implementations have problems when passed NULL. */
6679 #elif defined(HAS_DIR_DD_FD)
6682 Perl_die(aTHX_ PL_no_func, "dirfd");
6689 Perl_get_re_arg(pTHX_ SV *sv) {
6695 sv = MUTABLE_SV(SvRV(sv));
6696 if (SvTYPE(sv) == SVt_REGEXP)
6697 return (REGEXP*) sv;
6705 * c-indentation-style: bsd
6707 * indent-tabs-mode: t
6710 * ex: set ts=8 sts=4 sw=4 noet: