3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
4 * 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content.' --Gandalf to Pippin
15 * [p.598 of _The Lord of the Rings_, III/xi: "The Palantír"]
18 /* This file contains assorted utility routines.
19 * Which is a polite way of saying any stuff that people couldn't think of
20 * a better place for. Amongst other things, it includes the warning and
21 * dieing stuff, plus wrappers for malloc code.
25 #define PERL_IN_UTIL_C
29 #include "perliol.h" /* For PerlIOUnix_refcnt */
35 # define SIG_ERR ((Sighandler_t) -1)
40 /* Missing protos on LynxOS */
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
97 if ((SSize_t)size < 0)
98 Perl_croak_nocontext("panic: malloc, size=%"UVuf, (UV) size);
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, %p!=%p",
176 header->interpreter, aTHX);
178 assert(header->next->prev == header);
179 assert(header->prev->next == header);
181 if (header->size > size) {
182 const MEM_SIZE freed_up = header->size - size;
183 char *start_of_freed = ((char *)where) + size;
184 PoisonFree(start_of_freed, freed_up, char);
191 if ((SSize_t)size < 0)
192 Perl_croak_nocontext("panic: realloc, size=%"UVuf, (UV)size);
194 ptr = (Malloc_t)PerlMem_realloc(where,size);
195 PERL_ALLOC_CHECK(ptr);
197 /* MUST do this fixup first, before doing ANYTHING else, as anything else
198 might allocate memory/free/move memory, and until we do the fixup, it
199 may well be chasing (and writing to) free memory. */
200 #ifdef PERL_TRACK_MEMPOOL
202 struct perl_memory_debug_header *const header
203 = (struct perl_memory_debug_header *)ptr;
206 if (header->size < size) {
207 const MEM_SIZE fresh = size - header->size;
208 char *start_of_fresh = ((char *)ptr) + size;
209 PoisonNew(start_of_fresh, fresh, char);
213 header->next->prev = header;
214 header->prev->next = header;
216 ptr = (Malloc_t)((char*)ptr+sTHX);
220 /* In particular, must do that fixup above before logging anything via
221 *printf(), as it can reallocate memory, which can cause SEGVs. */
223 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
224 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
231 #ifndef ALWAYS_NEED_THX
237 return write_no_mem();
243 /* safe version of system's free() */
246 Perl_safesysfree(Malloc_t where)
248 #ifdef ALWAYS_NEED_THX
253 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
255 #ifdef PERL_TRACK_MEMPOOL
256 where = (Malloc_t)((char*)where-sTHX);
258 struct perl_memory_debug_header *const header
259 = (struct perl_memory_debug_header *)where;
261 if (header->interpreter != aTHX) {
262 Perl_croak_nocontext("panic: free from wrong pool, %p!=%p",
263 header->interpreter, aTHX);
266 Perl_croak_nocontext("panic: duplicate free");
269 Perl_croak_nocontext("panic: bad free, header->next==NULL");
270 if (header->next->prev != header || header->prev->next != header) {
271 Perl_croak_nocontext("panic: bad free, ->next->prev=%p, "
272 "header=%p, ->prev->next=%p",
273 header->next->prev, header,
276 /* Unlink us from the chain. */
277 header->next->prev = header->prev;
278 header->prev->next = header->next;
280 PoisonNew(where, header->size, char);
282 /* Trigger the duplicate free warning. */
290 /* safe version of system's calloc() */
293 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
295 #ifdef ALWAYS_NEED_THX
299 #if defined(PERL_TRACK_MEMPOOL) || defined(HAS_64K_LIMIT) || defined(DEBUGGING)
300 MEM_SIZE total_size = 0;
303 /* Even though calloc() for zero bytes is strange, be robust. */
304 if (size && (count <= MEM_SIZE_MAX / size)) {
305 #if defined(PERL_TRACK_MEMPOOL) || defined(HAS_64K_LIMIT) || defined(DEBUGGING)
306 total_size = size * count;
310 Perl_croak_nocontext("%s", PL_memory_wrap);
311 #ifdef PERL_TRACK_MEMPOOL
312 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
315 Perl_croak_nocontext("%s", PL_memory_wrap);
318 if (total_size > 0xffff) {
319 PerlIO_printf(Perl_error_log,
320 "Allocation too large: %lx\n", total_size) FLUSH;
323 #endif /* HAS_64K_LIMIT */
325 if ((SSize_t)size < 0 || (SSize_t)count < 0)
326 Perl_croak_nocontext("panic: calloc, size=%"UVuf", count=%"UVuf,
327 (UV)size, (UV)count);
329 #ifdef PERL_TRACK_MEMPOOL
330 /* Have to use malloc() because we've added some space for our tracking
332 /* malloc(0) is non-portable. */
333 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
335 /* Use calloc() because it might save a memset() if the memory is fresh
336 and clean from the OS. */
338 ptr = (Malloc_t)PerlMem_calloc(count, size);
339 else /* calloc(0) is non-portable. */
340 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
342 PERL_ALLOC_CHECK(ptr);
343 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));
345 #ifdef PERL_TRACK_MEMPOOL
347 struct perl_memory_debug_header *const header
348 = (struct perl_memory_debug_header *)ptr;
350 memset((void*)ptr, 0, total_size);
351 header->interpreter = aTHX;
352 /* Link us into the list. */
353 header->prev = &PL_memory_debug_header;
354 header->next = PL_memory_debug_header.next;
355 PL_memory_debug_header.next = header;
356 header->next->prev = header;
358 header->size = total_size;
360 ptr = (Malloc_t)((char*)ptr+sTHX);
366 #ifndef ALWAYS_NEED_THX
371 return write_no_mem();
375 /* These must be defined when not using Perl's malloc for binary
380 Malloc_t Perl_malloc (MEM_SIZE nbytes)
383 return (Malloc_t)PerlMem_malloc(nbytes);
386 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
389 return (Malloc_t)PerlMem_calloc(elements, size);
392 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
395 return (Malloc_t)PerlMem_realloc(where, nbytes);
398 Free_t Perl_mfree (Malloc_t where)
406 /* copy a string up to some (non-backslashed) delimiter, if any */
409 Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
413 PERL_ARGS_ASSERT_DELIMCPY;
415 for (tolen = 0; from < fromend; from++, tolen++) {
417 if (from[1] != delim) {
424 else if (*from == delim)
435 /* return ptr to little string in big string, NULL if not found */
436 /* This routine was donated by Corey Satten. */
439 Perl_instr(register const char *big, register const char *little)
443 PERL_ARGS_ASSERT_INSTR;
451 register const char *s, *x;
454 for (x=big,s=little; *s; /**/ ) {
465 return (char*)(big-1);
470 /* same as instr but allow embedded nulls */
473 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
475 PERL_ARGS_ASSERT_NINSTR;
479 const char first = *little;
481 bigend -= lend - little++;
483 while (big <= bigend) {
484 if (*big++ == first) {
485 for (x=big,s=little; s < lend; x++,s++) {
489 return (char*)(big-1);
496 /* reverse of the above--find last substring */
499 Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
501 register const char *bigbeg;
502 register const I32 first = *little;
503 register const char * const littleend = lend;
505 PERL_ARGS_ASSERT_RNINSTR;
507 if (little >= littleend)
508 return (char*)bigend;
510 big = bigend - (littleend - little++);
511 while (big >= bigbeg) {
512 register const char *s, *x;
515 for (x=big+2,s=little; s < littleend; /**/ ) {
524 return (char*)(big+1);
529 /* As a space optimization, we do not compile tables for strings of length
530 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
531 special-cased in fbm_instr().
533 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
536 =head1 Miscellaneous Functions
538 =for apidoc fbm_compile
540 Analyses the string in order to make fast searches on it using fbm_instr()
541 -- the Boyer-Moore algorithm.
547 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
550 register const U8 *s;
557 PERL_ARGS_ASSERT_FBM_COMPILE;
559 /* Refuse to fbm_compile a studied scalar, as this gives more flexibility in
560 SV flag usage. No real-world code would ever end up using a studied
561 scalar as a compile-time second argument to index, so this isn't a real
569 if (flags & FBMcf_TAIL) {
570 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
571 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
572 if (mg && mg->mg_len >= 0)
575 s = (U8*)SvPV_force_mutable(sv, len);
576 if (len == 0) /* TAIL might be on a zero-length string. */
578 SvUPGRADE(sv, SVt_PVMG);
583 /* "deep magic", the comment used to add. The use of MAGIC itself isn't
584 really. MAGIC was originally added in 79072805bf63abe5 (perl 5.0 alpha 2)
585 to call SvVALID_off() if the scalar was assigned to.
587 The comment itself (and "deeper magic" below) date back to
588 378cc40b38293ffc (perl 2.0). "deep magic" was an annotation on
590 where the magic (presumably) was that the scalar had a BM table hidden
593 As MAGIC is always present on BMs [in Perl 5 :-)], we can use it to store
594 the table instead of the previous (somewhat hacky) approach of co-opting
595 the string buffer and storing it after the string. */
597 assert(!mg_find(sv, PERL_MAGIC_bm));
598 mg = sv_magicext(sv, NULL, PERL_MAGIC_bm, &PL_vtbl_bm, NULL, 0);
602 /* Shorter strings are special-cased in Perl_fbm_instr(), and don't use
604 const U8 mlen = (len>255) ? 255 : (U8)len;
605 const unsigned char *const sb = s + len - mlen; /* first char (maybe) */
608 Newx(table, 256, U8);
609 memset((void*)table, mlen, 256);
610 mg->mg_ptr = (char *)table;
613 s += len - 1; /* last char */
616 if (table[*s] == mlen)
622 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
623 for (i = 0; i < len; i++) {
624 if (PL_freq[s[i]] < frequency) {
626 frequency = PL_freq[s[i]];
629 BmRARE(sv) = s[rarest];
630 BmPREVIOUS(sv) = rarest;
631 BmUSEFUL(sv) = 100; /* Initial value */
632 if (flags & FBMcf_TAIL)
634 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %"UVuf"\n",
635 BmRARE(sv), BmPREVIOUS(sv)));
638 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
639 /* If SvTAIL is actually due to \Z or \z, this gives false positives
643 =for apidoc fbm_instr
645 Returns the location of the SV in the string delimited by C<str> and
646 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
647 does not have to be fbm_compiled, but the search will not be as fast
654 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
656 register unsigned char *s;
658 register const unsigned char *little
659 = (const unsigned char *)SvPV_const(littlestr,l);
660 register STRLEN littlelen = l;
661 register const I32 multiline = flags & FBMrf_MULTILINE;
663 PERL_ARGS_ASSERT_FBM_INSTR;
665 if ((STRLEN)(bigend - big) < littlelen) {
666 if ( SvTAIL(littlestr)
667 && ((STRLEN)(bigend - big) == littlelen - 1)
669 || (*big == *little &&
670 memEQ((char *)big, (char *)little, littlelen - 1))))
675 switch (littlelen) { /* Special cases for 0, 1 and 2 */
677 return (char*)big; /* Cannot be SvTAIL! */
679 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
680 /* Know that bigend != big. */
681 if (bigend[-1] == '\n')
682 return (char *)(bigend - 1);
683 return (char *) bigend;
691 if (SvTAIL(littlestr))
692 return (char *) bigend;
695 if (SvTAIL(littlestr) && !multiline) {
696 if (bigend[-1] == '\n' && bigend[-2] == *little)
697 return (char*)bigend - 2;
698 if (bigend[-1] == *little)
699 return (char*)bigend - 1;
703 /* This should be better than FBM if c1 == c2, and almost
704 as good otherwise: maybe better since we do less indirection.
705 And we save a lot of memory by caching no table. */
706 const unsigned char c1 = little[0];
707 const unsigned char c2 = little[1];
712 while (s <= bigend) {
722 goto check_1char_anchor;
733 goto check_1char_anchor;
736 while (s <= bigend) {
741 goto check_1char_anchor;
750 check_1char_anchor: /* One char and anchor! */
751 if (SvTAIL(littlestr) && (*bigend == *little))
752 return (char *)bigend; /* bigend is already decremented. */
755 break; /* Only lengths 0 1 and 2 have special-case code. */
758 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
759 s = bigend - littlelen;
760 if (s >= big && bigend[-1] == '\n' && *s == *little
761 /* Automatically of length > 2 */
762 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
764 return (char*)s; /* how sweet it is */
767 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
769 return (char*)s + 1; /* how sweet it is */
773 if (!SvVALID(littlestr)) {
774 char * const b = ninstr((char*)big,(char*)bigend,
775 (char*)little, (char*)little + littlelen);
777 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
778 /* Chop \n from littlestr: */
779 s = bigend - littlelen + 1;
781 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
791 if (littlelen > (STRLEN)(bigend - big))
795 const MAGIC *const mg = mg_find(littlestr, PERL_MAGIC_bm);
796 const unsigned char * const table = (const unsigned char *) mg->mg_ptr;
797 register const unsigned char *oldlittle;
799 --littlelen; /* Last char found by table lookup */
802 little += littlelen; /* last char */
808 if ((tmp = table[*s])) {
809 if ((s += tmp) < bigend)
813 else { /* less expensive than calling strncmp() */
814 register unsigned char * const olds = s;
819 if (*--s == *--little)
821 s = olds + 1; /* here we pay the price for failure */
823 if (s < bigend) /* fake up continue to outer loop */
833 && memEQ((char *)(bigend - littlelen),
834 (char *)(oldlittle - littlelen), littlelen) )
835 return (char*)bigend - littlelen;
840 /* start_shift, end_shift are positive quantities which give offsets
841 of ends of some substring of bigstr.
842 If "last" we want the last occurrence.
843 old_posp is the way of communication between consequent calls if
844 the next call needs to find the .
845 The initial *old_posp should be -1.
847 Note that we take into account SvTAIL, so one can get extra
848 optimizations if _ALL flag is set.
851 /* If SvTAIL is actually due to \Z or \z, this gives false positives
852 if PL_multiline. In fact if !PL_multiline the authoritative answer
853 is not supported yet. */
856 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
859 register const unsigned char *big;
860 U32 pos = 0; /* hush a gcc warning */
861 register I32 previous;
863 register const unsigned char *little;
864 register I32 stop_pos;
865 register const unsigned char *littleend;
868 const void *screamnext_raw = NULL; /* hush a gcc warning */
869 bool cant_find = FALSE; /* hush a gcc warning */
871 PERL_ARGS_ASSERT_SCREAMINSTR;
873 assert(SvMAGICAL(bigstr));
874 mg = mg_find(bigstr, PERL_MAGIC_study);
876 assert(SvTYPE(littlestr) == SVt_PVMG);
877 assert(SvVALID(littlestr));
879 if (mg->mg_private == 1) {
880 const U8 *const screamfirst = (U8 *)mg->mg_ptr;
881 const U8 *const screamnext = screamfirst + 256;
883 screamnext_raw = (const void *)screamnext;
885 pos = *old_posp == -1
886 ? screamfirst[BmRARE(littlestr)] : screamnext[*old_posp];
887 cant_find = pos == (U8)~0;
888 } else if (mg->mg_private == 2) {
889 const U16 *const screamfirst = (U16 *)mg->mg_ptr;
890 const U16 *const screamnext = screamfirst + 256;
892 screamnext_raw = (const void *)screamnext;
894 pos = *old_posp == -1
895 ? screamfirst[BmRARE(littlestr)] : screamnext[*old_posp];
896 cant_find = pos == (U16)~0;
897 } else if (mg->mg_private == 4) {
898 const U32 *const screamfirst = (U32 *)mg->mg_ptr;
899 const U32 *const screamnext = screamfirst + 256;
901 screamnext_raw = (const void *)screamnext;
903 pos = *old_posp == -1
904 ? screamfirst[BmRARE(littlestr)] : screamnext[*old_posp];
905 cant_find = pos == (U32)~0;
907 Perl_croak(aTHX_ "panic: unknown study size %u", mg->mg_private);
911 if ( BmRARE(littlestr) == '\n'
912 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
913 little = (const unsigned char *)(SvPVX_const(littlestr));
914 littleend = little + SvCUR(littlestr);
921 little = (const unsigned char *)(SvPVX_const(littlestr));
922 littleend = little + SvCUR(littlestr);
924 /* The value of pos we can start at: */
925 previous = BmPREVIOUS(littlestr);
926 big = (const unsigned char *)(SvPVX_const(bigstr));
927 /* The value of pos we can stop at: */
928 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
929 if (previous + start_shift > stop_pos) {
931 stop_pos does not include SvTAIL in the count, so this check is incorrect
932 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
935 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
940 if (mg->mg_private == 1) {
941 const U8 *const screamnext = (const U8 *const) screamnext_raw;
942 while ((I32)pos < previous + start_shift) {
943 pos = screamnext[pos];
947 } else if (mg->mg_private == 2) {
948 const U16 *const screamnext = (const U16 *const) screamnext_raw;
949 while ((I32)pos < previous + start_shift) {
950 pos = screamnext[pos];
954 } else if (mg->mg_private == 4) {
955 const U32 *const screamnext = (const U32 *const) screamnext_raw;
956 while ((I32)pos < previous + start_shift) {
957 pos = screamnext[pos];
964 if ((I32)pos >= stop_pos) break;
965 if (big[pos] == first) {
966 const unsigned char *s = little;
967 const unsigned char *x = big + pos + 1;
968 while (s < littleend) {
973 if (s == littleend) {
974 *old_posp = (I32)pos;
975 if (!last) return (char *)(big+pos);
979 if (mg->mg_private == 1) {
980 pos = ((const U8 *const)screamnext_raw)[pos];
983 } else if (mg->mg_private == 2) {
984 pos = ((const U16 *const)screamnext_raw)[pos];
987 } else if (mg->mg_private == 4) {
988 pos = ((const U32 *const)screamnext_raw)[pos];
994 return (char *)(big+(*old_posp));
996 if (!SvTAIL(littlestr) || (end_shift > 0))
998 /* Ignore the trailing "\n". This code is not microoptimized */
999 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
1000 stop_pos = littleend - little; /* Actual littlestr len */
1005 && ((stop_pos == 1) ||
1006 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
1014 Returns true if the leading len bytes of the strings s1 and s2 are the same
1015 case-insensitively; false otherwise. Uppercase and lowercase ASCII range bytes
1016 match themselves and their opposite case counterparts. Non-cased and non-ASCII
1017 range bytes match only themselves.
1024 Perl_foldEQ(const char *s1, const char *s2, register I32 len)
1026 register const U8 *a = (const U8 *)s1;
1027 register const U8 *b = (const U8 *)s2;
1029 PERL_ARGS_ASSERT_FOLDEQ;
1032 if (*a != *b && *a != PL_fold[*b])
1039 Perl_foldEQ_latin1(const char *s1, const char *s2, register I32 len)
1041 /* Compare non-utf8 using Unicode (Latin1) semantics. Does not work on
1042 * MICRO_SIGN, LATIN_SMALL_LETTER_SHARP_S, nor
1043 * LATIN_SMALL_LETTER_Y_WITH_DIAERESIS, and does not check for these. Nor
1044 * does it check that the strings each have at least 'len' characters */
1046 register const U8 *a = (const U8 *)s1;
1047 register const U8 *b = (const U8 *)s2;
1049 PERL_ARGS_ASSERT_FOLDEQ_LATIN1;
1052 if (*a != *b && *a != PL_fold_latin1[*b]) {
1061 =for apidoc foldEQ_locale
1063 Returns true if the leading len bytes of the strings s1 and s2 are the same
1064 case-insensitively in the current locale; false otherwise.
1070 Perl_foldEQ_locale(const char *s1, const char *s2, register I32 len)
1073 register const U8 *a = (const U8 *)s1;
1074 register const U8 *b = (const U8 *)s2;
1076 PERL_ARGS_ASSERT_FOLDEQ_LOCALE;
1079 if (*a != *b && *a != PL_fold_locale[*b])
1086 /* copy a string to a safe spot */
1089 =head1 Memory Management
1093 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
1094 string which is a duplicate of C<pv>. The size of the string is
1095 determined by C<strlen()>. The memory allocated for the new string can
1096 be freed with the C<Safefree()> function.
1102 Perl_savepv(pTHX_ const char *pv)
1104 PERL_UNUSED_CONTEXT;
1109 const STRLEN pvlen = strlen(pv)+1;
1110 Newx(newaddr, pvlen, char);
1111 return (char*)memcpy(newaddr, pv, pvlen);
1115 /* same thing but with a known length */
1120 Perl's version of what C<strndup()> would be if it existed. Returns a
1121 pointer to a newly allocated string which is a duplicate of the first
1122 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
1123 the new string can be freed with the C<Safefree()> function.
1129 Perl_savepvn(pTHX_ const char *pv, register I32 len)
1131 register char *newaddr;
1132 PERL_UNUSED_CONTEXT;
1134 Newx(newaddr,len+1,char);
1135 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
1137 /* might not be null terminated */
1138 newaddr[len] = '\0';
1139 return (char *) CopyD(pv,newaddr,len,char);
1142 return (char *) ZeroD(newaddr,len+1,char);
1147 =for apidoc savesharedpv
1149 A version of C<savepv()> which allocates the duplicate string in memory
1150 which is shared between threads.
1155 Perl_savesharedpv(pTHX_ const char *pv)
1157 register char *newaddr;
1162 pvlen = strlen(pv)+1;
1163 newaddr = (char*)PerlMemShared_malloc(pvlen);
1165 return write_no_mem();
1167 return (char*)memcpy(newaddr, pv, pvlen);
1171 =for apidoc savesharedpvn
1173 A version of C<savepvn()> which allocates the duplicate string in memory
1174 which is shared between threads. (With the specific difference that a NULL
1175 pointer is not acceptable)
1180 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1182 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1184 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1187 return write_no_mem();
1189 newaddr[len] = '\0';
1190 return (char*)memcpy(newaddr, pv, len);
1194 =for apidoc savesvpv
1196 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1197 the passed in SV using C<SvPV()>
1203 Perl_savesvpv(pTHX_ SV *sv)
1206 const char * const pv = SvPV_const(sv, len);
1207 register char *newaddr;
1209 PERL_ARGS_ASSERT_SAVESVPV;
1212 Newx(newaddr,len,char);
1213 return (char *) CopyD(pv,newaddr,len,char);
1217 =for apidoc savesharedsvpv
1219 A version of C<savesharedpv()> which allocates the duplicate string in
1220 memory which is shared between threads.
1226 Perl_savesharedsvpv(pTHX_ SV *sv)
1229 const char * const pv = SvPV_const(sv, len);
1231 PERL_ARGS_ASSERT_SAVESHAREDSVPV;
1233 return savesharedpvn(pv, len);
1236 /* the SV for Perl_form() and mess() is not kept in an arena */
1245 if (PL_phase != PERL_PHASE_DESTRUCT)
1246 return newSVpvs_flags("", SVs_TEMP);
1251 /* Create as PVMG now, to avoid any upgrading later */
1253 Newxz(any, 1, XPVMG);
1254 SvFLAGS(sv) = SVt_PVMG;
1255 SvANY(sv) = (void*)any;
1257 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1262 #if defined(PERL_IMPLICIT_CONTEXT)
1264 Perl_form_nocontext(const char* pat, ...)
1269 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1270 va_start(args, pat);
1271 retval = vform(pat, &args);
1275 #endif /* PERL_IMPLICIT_CONTEXT */
1278 =head1 Miscellaneous Functions
1281 Takes a sprintf-style format pattern and conventional
1282 (non-SV) arguments and returns the formatted string.
1284 (char *) Perl_form(pTHX_ const char* pat, ...)
1286 can be used any place a string (char *) is required:
1288 char * s = Perl_form("%d.%d",major,minor);
1290 Uses a single private buffer so if you want to format several strings you
1291 must explicitly copy the earlier strings away (and free the copies when you
1298 Perl_form(pTHX_ const char* pat, ...)
1302 PERL_ARGS_ASSERT_FORM;
1303 va_start(args, pat);
1304 retval = vform(pat, &args);
1310 Perl_vform(pTHX_ const char *pat, va_list *args)
1312 SV * const sv = mess_alloc();
1313 PERL_ARGS_ASSERT_VFORM;
1314 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1319 =for apidoc Am|SV *|mess|const char *pat|...
1321 Take a sprintf-style format pattern and argument list. These are used to
1322 generate a string message. If the message does not end with a newline,
1323 then it will be extended with some indication of the current location
1324 in the code, as described for L</mess_sv>.
1326 Normally, the resulting message is returned in a new mortal SV.
1327 During global destruction a single SV may be shared between uses of
1333 #if defined(PERL_IMPLICIT_CONTEXT)
1335 Perl_mess_nocontext(const char *pat, ...)
1340 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1341 va_start(args, pat);
1342 retval = vmess(pat, &args);
1346 #endif /* PERL_IMPLICIT_CONTEXT */
1349 Perl_mess(pTHX_ const char *pat, ...)
1353 PERL_ARGS_ASSERT_MESS;
1354 va_start(args, pat);
1355 retval = vmess(pat, &args);
1361 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1364 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1366 PERL_ARGS_ASSERT_CLOSEST_COP;
1368 if (!o || o == PL_op)
1371 if (o->op_flags & OPf_KIDS) {
1373 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1376 /* If the OP_NEXTSTATE has been optimised away we can still use it
1377 * the get the file and line number. */
1379 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1380 cop = (const COP *)kid;
1382 /* Keep searching, and return when we've found something. */
1384 new_cop = closest_cop(cop, kid);
1390 /* Nothing found. */
1396 =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume
1398 Expands a message, intended for the user, to include an indication of
1399 the current location in the code, if the message does not already appear
1402 C<basemsg> is the initial message or object. If it is a reference, it
1403 will be used as-is and will be the result of this function. Otherwise it
1404 is used as a string, and if it already ends with a newline, it is taken
1405 to be complete, and the result of this function will be the same string.
1406 If the message does not end with a newline, then a segment such as C<at
1407 foo.pl line 37> will be appended, and possibly other clauses indicating
1408 the current state of execution. The resulting message will end with a
1411 Normally, the resulting message is returned in a new mortal SV.
1412 During global destruction a single SV may be shared between uses of this
1413 function. If C<consume> is true, then the function is permitted (but not
1414 required) to modify and return C<basemsg> instead of allocating a new SV.
1420 Perl_mess_sv(pTHX_ SV *basemsg, bool consume)
1425 PERL_ARGS_ASSERT_MESS_SV;
1427 if (SvROK(basemsg)) {
1433 sv_setsv(sv, basemsg);
1438 if (SvPOK(basemsg) && consume) {
1443 sv_copypv(sv, basemsg);
1446 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1448 * Try and find the file and line for PL_op. This will usually be
1449 * PL_curcop, but it might be a cop that has been optimised away. We
1450 * can try to find such a cop by searching through the optree starting
1451 * from the sibling of PL_curcop.
1454 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1459 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1460 OutCopFILE(cop), (IV)CopLINE(cop));
1461 /* Seems that GvIO() can be untrustworthy during global destruction. */
1462 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1463 && IoLINES(GvIOp(PL_last_in_gv)))
1465 const bool line_mode = (RsSIMPLE(PL_rs) &&
1466 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1467 Perl_sv_catpvf(aTHX_ sv, ", <%"SVf"> %s %"IVdf,
1468 SVfARG(PL_last_in_gv == PL_argvgv
1470 : sv_2mortal(newSVhek(GvNAME_HEK(PL_last_in_gv)))),
1471 line_mode ? "line" : "chunk",
1472 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1474 if (PL_phase == PERL_PHASE_DESTRUCT)
1475 sv_catpvs(sv, " during global destruction");
1476 sv_catpvs(sv, ".\n");
1482 =for apidoc Am|SV *|vmess|const char *pat|va_list *args
1484 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1485 argument list. These are used to generate a string message. If the
1486 message does not end with a newline, then it will be extended with
1487 some indication of the current location in the code, as described for
1490 Normally, the resulting message is returned in a new mortal SV.
1491 During global destruction a single SV may be shared between uses of
1498 Perl_vmess(pTHX_ const char *pat, va_list *args)
1501 SV * const sv = mess_alloc();
1503 PERL_ARGS_ASSERT_VMESS;
1505 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1506 return mess_sv(sv, 1);
1510 Perl_write_to_stderr(pTHX_ SV* msv)
1516 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1518 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1519 && (io = GvIO(PL_stderrgv))
1520 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1521 Perl_magic_methcall(aTHX_ MUTABLE_SV(io), mg, "PRINT",
1522 G_SCALAR | G_DISCARD | G_WRITING_TO_STDERR, 1, msv);
1525 /* SFIO can really mess with your errno */
1528 PerlIO * const serr = Perl_error_log;
1530 do_print(msv, serr);
1531 (void)PerlIO_flush(serr);
1539 =head1 Warning and Dieing
1542 /* Common code used in dieing and warning */
1545 S_with_queued_errors(pTHX_ SV *ex)
1547 PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS;
1548 if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) {
1549 sv_catsv(PL_errors, ex);
1550 ex = sv_mortalcopy(PL_errors);
1551 SvCUR_set(PL_errors, 0);
1557 S_invoke_exception_hook(pTHX_ SV *ex, bool warn)
1563 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1564 /* sv_2cv might call Perl_croak() or Perl_warner() */
1565 SV * const oldhook = *hook;
1573 cv = sv_2cv(oldhook, &stash, &gv, 0);
1575 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1585 exarg = newSVsv(ex);
1586 SvREADONLY_on(exarg);
1589 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1593 call_sv(MUTABLE_SV(cv), G_DISCARD);
1602 =for apidoc Am|OP *|die_sv|SV *baseex
1604 Behaves the same as L</croak_sv>, except for the return type.
1605 It should be used only where the C<OP *> return type is required.
1606 The function never actually returns.
1612 Perl_die_sv(pTHX_ SV *baseex)
1614 PERL_ARGS_ASSERT_DIE_SV;
1621 =for apidoc Am|OP *|die|const char *pat|...
1623 Behaves the same as L</croak>, except for the return type.
1624 It should be used only where the C<OP *> return type is required.
1625 The function never actually returns.
1630 #if defined(PERL_IMPLICIT_CONTEXT)
1632 Perl_die_nocontext(const char* pat, ...)
1636 va_start(args, pat);
1642 #endif /* PERL_IMPLICIT_CONTEXT */
1645 Perl_die(pTHX_ const char* pat, ...)
1648 va_start(args, pat);
1656 =for apidoc Am|void|croak_sv|SV *baseex
1658 This is an XS interface to Perl's C<die> function.
1660 C<baseex> is the error message or object. If it is a reference, it
1661 will be used as-is. Otherwise it is used as a string, and if it does
1662 not end with a newline then it will be extended with some indication of
1663 the current location in the code, as described for L</mess_sv>.
1665 The error message or object will be used as an exception, by default
1666 returning control to the nearest enclosing C<eval>, but subject to
1667 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv>
1668 function never returns normally.
1670 To die with a simple string message, the L</croak> function may be
1677 Perl_croak_sv(pTHX_ SV *baseex)
1679 SV *ex = with_queued_errors(mess_sv(baseex, 0));
1680 PERL_ARGS_ASSERT_CROAK_SV;
1681 invoke_exception_hook(ex, FALSE);
1686 =for apidoc Am|void|vcroak|const char *pat|va_list *args
1688 This is an XS interface to Perl's C<die> function.
1690 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1691 argument list. These are used to generate a string message. If the
1692 message does not end with a newline, then it will be extended with
1693 some indication of the current location in the code, as described for
1696 The error message will be used as an exception, by default
1697 returning control to the nearest enclosing C<eval>, but subject to
1698 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1699 function never returns normally.
1701 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1702 (C<$@>) will be used as an error message or object instead of building an
1703 error message from arguments. If you want to throw a non-string object,
1704 or build an error message in an SV yourself, it is preferable to use
1705 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1711 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1713 SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0));
1714 invoke_exception_hook(ex, FALSE);
1719 =for apidoc Am|void|croak|const char *pat|...
1721 This is an XS interface to Perl's C<die> function.
1723 Take a sprintf-style format pattern and argument list. These are used to
1724 generate a string message. If the message does not end with a newline,
1725 then it will be extended with some indication of the current location
1726 in the code, as described for L</mess_sv>.
1728 The error message will be used as an exception, by default
1729 returning control to the nearest enclosing C<eval>, but subject to
1730 modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak>
1731 function never returns normally.
1733 For historical reasons, if C<pat> is null then the contents of C<ERRSV>
1734 (C<$@>) will be used as an error message or object instead of building an
1735 error message from arguments. If you want to throw a non-string object,
1736 or build an error message in an SV yourself, it is preferable to use
1737 the L</croak_sv> function, which does not involve clobbering C<ERRSV>.
1742 #if defined(PERL_IMPLICIT_CONTEXT)
1744 Perl_croak_nocontext(const char *pat, ...)
1748 va_start(args, pat);
1753 #endif /* PERL_IMPLICIT_CONTEXT */
1756 Perl_croak(pTHX_ const char *pat, ...)
1759 va_start(args, pat);
1766 =for apidoc Am|void|croak_no_modify
1768 Exactly equivalent to C<Perl_croak(aTHX_ "%s", PL_no_modify)>, but generates
1769 terser object code than using C<Perl_croak>. Less code used on exception code
1770 paths reduces CPU cache pressure.
1776 Perl_croak_no_modify(pTHX)
1778 Perl_croak(aTHX_ "%s", PL_no_modify);
1782 =for apidoc Am|void|warn_sv|SV *baseex
1784 This is an XS interface to Perl's C<warn> function.
1786 C<baseex> is the error message or object. If it is a reference, it
1787 will be used as-is. Otherwise it is used as a string, and if it does
1788 not end with a newline then it will be extended with some indication of
1789 the current location in the code, as described for L</mess_sv>.
1791 The error message or object will by default be written to standard error,
1792 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1794 To warn with a simple string message, the L</warn> function may be
1801 Perl_warn_sv(pTHX_ SV *baseex)
1803 SV *ex = mess_sv(baseex, 0);
1804 PERL_ARGS_ASSERT_WARN_SV;
1805 if (!invoke_exception_hook(ex, TRUE))
1806 write_to_stderr(ex);
1810 =for apidoc Am|void|vwarn|const char *pat|va_list *args
1812 This is an XS interface to Perl's C<warn> function.
1814 C<pat> and C<args> are a sprintf-style format pattern and encapsulated
1815 argument list. These are used to generate a string message. If the
1816 message does not end with a newline, then it will be extended with
1817 some indication of the current location in the code, as described for
1820 The error message or object will by default be written to standard error,
1821 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1823 Unlike with L</vcroak>, C<pat> is not permitted to be null.
1829 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1831 SV *ex = vmess(pat, args);
1832 PERL_ARGS_ASSERT_VWARN;
1833 if (!invoke_exception_hook(ex, TRUE))
1834 write_to_stderr(ex);
1838 =for apidoc Am|void|warn|const char *pat|...
1840 This is an XS interface to Perl's C<warn> function.
1842 Take a sprintf-style format pattern and argument list. These are used to
1843 generate a string message. If the message does not end with a newline,
1844 then it will be extended with some indication of the current location
1845 in the code, as described for L</mess_sv>.
1847 The error message or object will by default be written to standard error,
1848 but this is subject to modification by a C<$SIG{__WARN__}> handler.
1850 Unlike with L</croak>, C<pat> is not permitted to be null.
1855 #if defined(PERL_IMPLICIT_CONTEXT)
1857 Perl_warn_nocontext(const char *pat, ...)
1861 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1862 va_start(args, pat);
1866 #endif /* PERL_IMPLICIT_CONTEXT */
1869 Perl_warn(pTHX_ const char *pat, ...)
1872 PERL_ARGS_ASSERT_WARN;
1873 va_start(args, pat);
1878 #if defined(PERL_IMPLICIT_CONTEXT)
1880 Perl_warner_nocontext(U32 err, const char *pat, ...)
1884 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1885 va_start(args, pat);
1886 vwarner(err, pat, &args);
1889 #endif /* PERL_IMPLICIT_CONTEXT */
1892 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1894 PERL_ARGS_ASSERT_CK_WARNER_D;
1896 if (Perl_ckwarn_d(aTHX_ err)) {
1898 va_start(args, pat);
1899 vwarner(err, pat, &args);
1905 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1907 PERL_ARGS_ASSERT_CK_WARNER;
1909 if (Perl_ckwarn(aTHX_ err)) {
1911 va_start(args, pat);
1912 vwarner(err, pat, &args);
1918 Perl_warner(pTHX_ U32 err, const char* pat,...)
1921 PERL_ARGS_ASSERT_WARNER;
1922 va_start(args, pat);
1923 vwarner(err, pat, &args);
1928 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1931 PERL_ARGS_ASSERT_VWARNER;
1932 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1933 SV * const msv = vmess(pat, args);
1935 invoke_exception_hook(msv, FALSE);
1939 Perl_vwarn(aTHX_ pat, args);
1943 /* implements the ckWARN? macros */
1946 Perl_ckwarn(pTHX_ U32 w)
1949 /* If lexical warnings have not been set, use $^W. */
1951 return PL_dowarn & G_WARN_ON;
1953 return ckwarn_common(w);
1956 /* implements the ckWARN?_d macro */
1959 Perl_ckwarn_d(pTHX_ U32 w)
1962 /* If lexical warnings have not been set then default classes warn. */
1966 return ckwarn_common(w);
1970 S_ckwarn_common(pTHX_ U32 w)
1972 if (PL_curcop->cop_warnings == pWARN_ALL)
1975 if (PL_curcop->cop_warnings == pWARN_NONE)
1978 /* Check the assumption that at least the first slot is non-zero. */
1979 assert(unpackWARN1(w));
1981 /* Check the assumption that it is valid to stop as soon as a zero slot is
1983 if (!unpackWARN2(w)) {
1984 assert(!unpackWARN3(w));
1985 assert(!unpackWARN4(w));
1986 } else if (!unpackWARN3(w)) {
1987 assert(!unpackWARN4(w));
1990 /* Right, dealt with all the special cases, which are implemented as non-
1991 pointers, so there is a pointer to a real warnings mask. */
1993 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1995 } while (w >>= WARNshift);
2000 /* Set buffer=NULL to get a new one. */
2002 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
2004 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
2005 PERL_UNUSED_CONTEXT;
2006 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
2009 (specialWARN(buffer) ?
2010 PerlMemShared_malloc(len_wanted) :
2011 PerlMemShared_realloc(buffer, len_wanted));
2013 Copy(bits, (buffer + 1), size, char);
2017 /* since we've already done strlen() for both nam and val
2018 * we can use that info to make things faster than
2019 * sprintf(s, "%s=%s", nam, val)
2021 #define my_setenv_format(s, nam, nlen, val, vlen) \
2022 Copy(nam, s, nlen, char); \
2024 Copy(val, s+(nlen+1), vlen, char); \
2025 *(s+(nlen+1+vlen)) = '\0'
2027 #ifdef USE_ENVIRON_ARRAY
2028 /* VMS' my_setenv() is in vms.c */
2029 #if !defined(WIN32) && !defined(NETWARE)
2031 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2035 /* only parent thread can modify process environment */
2036 if (PL_curinterp == aTHX)
2039 #ifndef PERL_USE_SAFE_PUTENV
2040 if (!PL_use_safe_putenv) {
2041 /* most putenv()s leak, so we manipulate environ directly */
2043 register const I32 len = strlen(nam);
2046 /* where does it go? */
2047 for (i = 0; environ[i]; i++) {
2048 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
2052 if (environ == PL_origenviron) { /* need we copy environment? */
2058 while (environ[max])
2060 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
2061 for (j=0; j<max; j++) { /* copy environment */
2062 const int len = strlen(environ[j]);
2063 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
2064 Copy(environ[j], tmpenv[j], len+1, char);
2067 environ = tmpenv; /* tell exec where it is now */
2070 safesysfree(environ[i]);
2071 while (environ[i]) {
2072 environ[i] = environ[i+1];
2077 if (!environ[i]) { /* does not exist yet */
2078 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
2079 environ[i+1] = NULL; /* make sure it's null terminated */
2082 safesysfree(environ[i]);
2086 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
2087 /* all that work just for this */
2088 my_setenv_format(environ[i], nam, nlen, val, vlen);
2091 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
2092 # if defined(HAS_UNSETENV)
2094 (void)unsetenv(nam);
2096 (void)setenv(nam, val, 1);
2098 # else /* ! HAS_UNSETENV */
2099 (void)setenv(nam, val, 1);
2100 # endif /* HAS_UNSETENV */
2102 # if defined(HAS_UNSETENV)
2104 (void)unsetenv(nam);
2106 const int nlen = strlen(nam);
2107 const int vlen = strlen(val);
2108 char * const new_env =
2109 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2110 my_setenv_format(new_env, nam, nlen, val, vlen);
2111 (void)putenv(new_env);
2113 # else /* ! HAS_UNSETENV */
2115 const int nlen = strlen(nam);
2121 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
2122 /* all that work just for this */
2123 my_setenv_format(new_env, nam, nlen, val, vlen);
2124 (void)putenv(new_env);
2125 # endif /* HAS_UNSETENV */
2126 # endif /* __CYGWIN__ */
2127 #ifndef PERL_USE_SAFE_PUTENV
2133 #else /* WIN32 || NETWARE */
2136 Perl_my_setenv(pTHX_ const char *nam, const char *val)
2139 register char *envstr;
2140 const int nlen = strlen(nam);
2147 Newx(envstr, nlen+vlen+2, char);
2148 my_setenv_format(envstr, nam, nlen, val, vlen);
2149 (void)PerlEnv_putenv(envstr);
2153 #endif /* WIN32 || NETWARE */
2155 #endif /* !VMS && !EPOC*/
2157 #ifdef UNLINK_ALL_VERSIONS
2159 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
2163 PERL_ARGS_ASSERT_UNLNK;
2165 while (PerlLIO_unlink(f) >= 0)
2167 return retries ? 0 : -1;
2171 /* this is a drop-in replacement for bcopy() */
2172 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
2174 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
2176 char * const retval = to;
2178 PERL_ARGS_ASSERT_MY_BCOPY;
2180 if (from - to >= 0) {
2188 *(--to) = *(--from);
2194 /* this is a drop-in replacement for memset() */
2197 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
2199 char * const retval = loc;
2201 PERL_ARGS_ASSERT_MY_MEMSET;
2209 /* this is a drop-in replacement for bzero() */
2210 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
2212 Perl_my_bzero(register char *loc, register I32 len)
2214 char * const retval = loc;
2216 PERL_ARGS_ASSERT_MY_BZERO;
2224 /* this is a drop-in replacement for memcmp() */
2225 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
2227 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
2229 register const U8 *a = (const U8 *)s1;
2230 register const U8 *b = (const U8 *)s2;
2233 PERL_ARGS_ASSERT_MY_MEMCMP;
2236 if ((tmp = *a++ - *b++))
2241 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
2244 /* This vsprintf replacement should generally never get used, since
2245 vsprintf was available in both System V and BSD 2.11. (There may
2246 be some cross-compilation or embedded set-ups where it is needed,
2249 If you encounter a problem in this function, it's probably a symptom
2250 that Configure failed to detect your system's vprintf() function.
2251 See the section on "item vsprintf" in the INSTALL file.
2253 This version may compile on systems with BSD-ish <stdio.h>,
2254 but probably won't on others.
2257 #ifdef USE_CHAR_VSPRINTF
2262 vsprintf(char *dest, const char *pat, void *args)
2266 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
2267 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
2268 FILE_cnt(&fakebuf) = 32767;
2270 /* These probably won't compile -- If you really need
2271 this, you'll have to figure out some other method. */
2272 fakebuf._ptr = dest;
2273 fakebuf._cnt = 32767;
2278 fakebuf._flag = _IOWRT|_IOSTRG;
2279 _doprnt(pat, args, &fakebuf); /* what a kludge */
2280 #if defined(STDIO_PTR_LVALUE)
2281 *(FILE_ptr(&fakebuf)++) = '\0';
2283 /* PerlIO has probably #defined away fputc, but we want it here. */
2285 # undef fputc /* XXX Should really restore it later */
2287 (void)fputc('\0', &fakebuf);
2289 #ifdef USE_CHAR_VSPRINTF
2292 return 0; /* perl doesn't use return value */
2296 #endif /* HAS_VPRINTF */
2299 #if BYTEORDER != 0x4321
2301 Perl_my_swap(pTHX_ short s)
2303 #if (BYTEORDER & 1) == 0
2306 result = ((s & 255) << 8) + ((s >> 8) & 255);
2314 Perl_my_htonl(pTHX_ long l)
2318 char c[sizeof(long)];
2321 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
2322 #if BYTEORDER == 0x12345678
2325 u.c[0] = (l >> 24) & 255;
2326 u.c[1] = (l >> 16) & 255;
2327 u.c[2] = (l >> 8) & 255;
2331 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2332 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2337 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2338 u.c[o & 0xf] = (l >> s) & 255;
2346 Perl_my_ntohl(pTHX_ long l)
2350 char c[sizeof(long)];
2353 #if BYTEORDER == 0x1234
2354 u.c[0] = (l >> 24) & 255;
2355 u.c[1] = (l >> 16) & 255;
2356 u.c[2] = (l >> 8) & 255;
2360 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2361 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2368 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2369 l |= (u.c[o & 0xf] & 255) << s;
2376 #endif /* BYTEORDER != 0x4321 */
2380 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2381 * If these functions are defined,
2382 * the BYTEORDER is neither 0x1234 nor 0x4321.
2383 * However, this is not assumed.
2387 #define HTOLE(name,type) \
2389 name (register type n) \
2393 char c[sizeof(type)]; \
2396 register U32 s = 0; \
2397 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2398 u.c[i] = (n >> s) & 0xFF; \
2403 #define LETOH(name,type) \
2405 name (register type n) \
2409 char c[sizeof(type)]; \
2412 register U32 s = 0; \
2415 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2416 n |= ((type)(u.c[i] & 0xFF)) << s; \
2422 * Big-endian byte order functions.
2425 #define HTOBE(name,type) \
2427 name (register type n) \
2431 char c[sizeof(type)]; \
2434 register U32 s = 8*(sizeof(u.c)-1); \
2435 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2436 u.c[i] = (n >> s) & 0xFF; \
2441 #define BETOH(name,type) \
2443 name (register type n) \
2447 char c[sizeof(type)]; \
2450 register U32 s = 8*(sizeof(u.c)-1); \
2453 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2454 n |= ((type)(u.c[i] & 0xFF)) << s; \
2460 * If we just can't do it...
2463 #define NOT_AVAIL(name,type) \
2465 name (register type n) \
2467 Perl_croak_nocontext(#name "() not available"); \
2468 return n; /* not reached */ \
2472 #if defined(HAS_HTOVS) && !defined(htovs)
2475 #if defined(HAS_HTOVL) && !defined(htovl)
2478 #if defined(HAS_VTOHS) && !defined(vtohs)
2481 #if defined(HAS_VTOHL) && !defined(vtohl)
2485 #ifdef PERL_NEED_MY_HTOLE16
2487 HTOLE(Perl_my_htole16,U16)
2489 NOT_AVAIL(Perl_my_htole16,U16)
2492 #ifdef PERL_NEED_MY_LETOH16
2494 LETOH(Perl_my_letoh16,U16)
2496 NOT_AVAIL(Perl_my_letoh16,U16)
2499 #ifdef PERL_NEED_MY_HTOBE16
2501 HTOBE(Perl_my_htobe16,U16)
2503 NOT_AVAIL(Perl_my_htobe16,U16)
2506 #ifdef PERL_NEED_MY_BETOH16
2508 BETOH(Perl_my_betoh16,U16)
2510 NOT_AVAIL(Perl_my_betoh16,U16)
2514 #ifdef PERL_NEED_MY_HTOLE32
2516 HTOLE(Perl_my_htole32,U32)
2518 NOT_AVAIL(Perl_my_htole32,U32)
2521 #ifdef PERL_NEED_MY_LETOH32
2523 LETOH(Perl_my_letoh32,U32)
2525 NOT_AVAIL(Perl_my_letoh32,U32)
2528 #ifdef PERL_NEED_MY_HTOBE32
2530 HTOBE(Perl_my_htobe32,U32)
2532 NOT_AVAIL(Perl_my_htobe32,U32)
2535 #ifdef PERL_NEED_MY_BETOH32
2537 BETOH(Perl_my_betoh32,U32)
2539 NOT_AVAIL(Perl_my_betoh32,U32)
2543 #ifdef PERL_NEED_MY_HTOLE64
2545 HTOLE(Perl_my_htole64,U64)
2547 NOT_AVAIL(Perl_my_htole64,U64)
2550 #ifdef PERL_NEED_MY_LETOH64
2552 LETOH(Perl_my_letoh64,U64)
2554 NOT_AVAIL(Perl_my_letoh64,U64)
2557 #ifdef PERL_NEED_MY_HTOBE64
2559 HTOBE(Perl_my_htobe64,U64)
2561 NOT_AVAIL(Perl_my_htobe64,U64)
2564 #ifdef PERL_NEED_MY_BETOH64
2566 BETOH(Perl_my_betoh64,U64)
2568 NOT_AVAIL(Perl_my_betoh64,U64)
2572 #ifdef PERL_NEED_MY_HTOLES
2573 HTOLE(Perl_my_htoles,short)
2575 #ifdef PERL_NEED_MY_LETOHS
2576 LETOH(Perl_my_letohs,short)
2578 #ifdef PERL_NEED_MY_HTOBES
2579 HTOBE(Perl_my_htobes,short)
2581 #ifdef PERL_NEED_MY_BETOHS
2582 BETOH(Perl_my_betohs,short)
2585 #ifdef PERL_NEED_MY_HTOLEI
2586 HTOLE(Perl_my_htolei,int)
2588 #ifdef PERL_NEED_MY_LETOHI
2589 LETOH(Perl_my_letohi,int)
2591 #ifdef PERL_NEED_MY_HTOBEI
2592 HTOBE(Perl_my_htobei,int)
2594 #ifdef PERL_NEED_MY_BETOHI
2595 BETOH(Perl_my_betohi,int)
2598 #ifdef PERL_NEED_MY_HTOLEL
2599 HTOLE(Perl_my_htolel,long)
2601 #ifdef PERL_NEED_MY_LETOHL
2602 LETOH(Perl_my_letohl,long)
2604 #ifdef PERL_NEED_MY_HTOBEL
2605 HTOBE(Perl_my_htobel,long)
2607 #ifdef PERL_NEED_MY_BETOHL
2608 BETOH(Perl_my_betohl,long)
2612 Perl_my_swabn(void *ptr, int n)
2614 register char *s = (char *)ptr;
2615 register char *e = s + (n-1);
2618 PERL_ARGS_ASSERT_MY_SWABN;
2620 for (n /= 2; n > 0; s++, e--, n--) {
2628 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2630 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2633 register I32 This, that;
2639 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2641 PERL_FLUSHALL_FOR_CHILD;
2642 This = (*mode == 'w');
2646 taint_proper("Insecure %s%s", "EXEC");
2648 if (PerlProc_pipe(p) < 0)
2650 /* Try for another pipe pair for error return */
2651 if (PerlProc_pipe(pp) >= 0)
2653 while ((pid = PerlProc_fork()) < 0) {
2654 if (errno != EAGAIN) {
2655 PerlLIO_close(p[This]);
2656 PerlLIO_close(p[that]);
2658 PerlLIO_close(pp[0]);
2659 PerlLIO_close(pp[1]);
2663 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2672 /* Close parent's end of error status pipe (if any) */
2674 PerlLIO_close(pp[0]);
2675 #if defined(HAS_FCNTL) && defined(F_SETFD)
2676 /* Close error pipe automatically if exec works */
2677 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2680 /* Now dup our end of _the_ pipe to right position */
2681 if (p[THIS] != (*mode == 'r')) {
2682 PerlLIO_dup2(p[THIS], *mode == 'r');
2683 PerlLIO_close(p[THIS]);
2684 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2685 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2688 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2689 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2690 /* No automatic close - do it by hand */
2697 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2703 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2709 do_execfree(); /* free any memory malloced by child on fork */
2711 PerlLIO_close(pp[1]);
2712 /* Keep the lower of the two fd numbers */
2713 if (p[that] < p[This]) {
2714 PerlLIO_dup2(p[This], p[that]);
2715 PerlLIO_close(p[This]);
2719 PerlLIO_close(p[that]); /* close child's end of pipe */
2721 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2722 SvUPGRADE(sv,SVt_IV);
2724 PL_forkprocess = pid;
2725 /* If we managed to get status pipe check for exec fail */
2726 if (did_pipes && pid > 0) {
2731 while (n < sizeof(int)) {
2732 n1 = PerlLIO_read(pp[0],
2733 (void*)(((char*)&errkid)+n),
2739 PerlLIO_close(pp[0]);
2741 if (n) { /* Error */
2743 PerlLIO_close(p[This]);
2744 if (n != sizeof(int))
2745 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2747 pid2 = wait4pid(pid, &status, 0);
2748 } while (pid2 == -1 && errno == EINTR);
2749 errno = errkid; /* Propagate errno from kid */
2754 PerlLIO_close(pp[0]);
2755 return PerlIO_fdopen(p[This], mode);
2757 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2758 return my_syspopen4(aTHX_ NULL, mode, n, args);
2760 Perl_croak(aTHX_ "List form of piped open not implemented");
2761 return (PerlIO *) NULL;
2766 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2767 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2769 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2773 register I32 This, that;
2776 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2780 PERL_ARGS_ASSERT_MY_POPEN;
2782 PERL_FLUSHALL_FOR_CHILD;
2785 return my_syspopen(aTHX_ cmd,mode);
2788 This = (*mode == 'w');
2790 if (doexec && PL_tainting) {
2792 taint_proper("Insecure %s%s", "EXEC");
2794 if (PerlProc_pipe(p) < 0)
2796 if (doexec && PerlProc_pipe(pp) >= 0)
2798 while ((pid = PerlProc_fork()) < 0) {
2799 if (errno != EAGAIN) {
2800 PerlLIO_close(p[This]);
2801 PerlLIO_close(p[that]);
2803 PerlLIO_close(pp[0]);
2804 PerlLIO_close(pp[1]);
2807 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2810 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2820 PerlLIO_close(pp[0]);
2821 #if defined(HAS_FCNTL) && defined(F_SETFD)
2822 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2825 if (p[THIS] != (*mode == 'r')) {
2826 PerlLIO_dup2(p[THIS], *mode == 'r');
2827 PerlLIO_close(p[THIS]);
2828 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2829 PerlLIO_close(p[THAT]);
2832 PerlLIO_close(p[THAT]);
2835 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2842 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2847 /* may or may not use the shell */
2848 do_exec3(cmd, pp[1], did_pipes);
2851 #endif /* defined OS2 */
2853 #ifdef PERLIO_USING_CRLF
2854 /* Since we circumvent IO layers when we manipulate low-level
2855 filedescriptors directly, need to manually switch to the
2856 default, binary, low-level mode; see PerlIOBuf_open(). */
2857 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2859 #ifdef THREADS_HAVE_PIDS
2860 PL_ppid = (IV)getppid();
2863 #ifdef PERL_USES_PL_PIDSTATUS
2864 hv_clear(PL_pidstatus); /* we have no children */
2870 do_execfree(); /* free any memory malloced by child on vfork */
2872 PerlLIO_close(pp[1]);
2873 if (p[that] < p[This]) {
2874 PerlLIO_dup2(p[This], p[that]);
2875 PerlLIO_close(p[This]);
2879 PerlLIO_close(p[that]);
2881 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2882 SvUPGRADE(sv,SVt_IV);
2884 PL_forkprocess = pid;
2885 if (did_pipes && pid > 0) {
2890 while (n < sizeof(int)) {
2891 n1 = PerlLIO_read(pp[0],
2892 (void*)(((char*)&errkid)+n),
2898 PerlLIO_close(pp[0]);
2900 if (n) { /* Error */
2902 PerlLIO_close(p[This]);
2903 if (n != sizeof(int))
2904 Perl_croak(aTHX_ "panic: kid popen errno read, n=%u", n);
2906 pid2 = wait4pid(pid, &status, 0);
2907 } while (pid2 == -1 && errno == EINTR);
2908 errno = errkid; /* Propagate errno from kid */
2913 PerlLIO_close(pp[0]);
2914 return PerlIO_fdopen(p[This], mode);
2917 #if defined(atarist) || defined(EPOC)
2920 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2922 PERL_ARGS_ASSERT_MY_POPEN;
2923 PERL_FLUSHALL_FOR_CHILD;
2924 /* Call system's popen() to get a FILE *, then import it.
2925 used 0 for 2nd parameter to PerlIO_importFILE;
2928 return PerlIO_importFILE(popen(cmd, mode), 0);
2932 FILE *djgpp_popen();
2934 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2936 PERL_FLUSHALL_FOR_CHILD;
2937 /* Call system's popen() to get a FILE *, then import it.
2938 used 0 for 2nd parameter to PerlIO_importFILE;
2941 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2944 #if defined(__LIBCATAMOUNT__)
2946 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2954 #endif /* !DOSISH */
2956 /* this is called in parent before the fork() */
2958 Perl_atfork_lock(void)
2961 #if defined(USE_ITHREADS)
2962 /* locks must be held in locking order (if any) */
2964 MUTEX_LOCK(&PL_malloc_mutex);
2970 /* this is called in both parent and child after the fork() */
2972 Perl_atfork_unlock(void)
2975 #if defined(USE_ITHREADS)
2976 /* locks must be released in same order as in atfork_lock() */
2978 MUTEX_UNLOCK(&PL_malloc_mutex);
2987 #if defined(HAS_FORK)
2989 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2994 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2995 * handlers elsewhere in the code */
3000 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
3001 Perl_croak_nocontext("fork() not available");
3003 #endif /* HAS_FORK */
3008 Perl_dump_fds(pTHX_ const char *const s)
3013 PERL_ARGS_ASSERT_DUMP_FDS;
3015 PerlIO_printf(Perl_debug_log,"%s", s);
3016 for (fd = 0; fd < 32; fd++) {
3017 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
3018 PerlIO_printf(Perl_debug_log," %d",fd);
3020 PerlIO_printf(Perl_debug_log,"\n");
3023 #endif /* DUMP_FDS */
3027 dup2(int oldfd, int newfd)
3029 #if defined(HAS_FCNTL) && defined(F_DUPFD)
3032 PerlLIO_close(newfd);
3033 return fcntl(oldfd, F_DUPFD, newfd);
3035 #define DUP2_MAX_FDS 256
3036 int fdtmp[DUP2_MAX_FDS];
3042 PerlLIO_close(newfd);
3043 /* good enough for low fd's... */
3044 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
3045 if (fdx >= DUP2_MAX_FDS) {
3053 PerlLIO_close(fdtmp[--fdx]);
3060 #ifdef HAS_SIGACTION
3063 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
3066 struct sigaction act, oact;
3069 /* only "parent" interpreter can diddle signals */
3070 if (PL_curinterp != aTHX)
3071 return (Sighandler_t) SIG_ERR;
3074 act.sa_handler = (void(*)(int))handler;
3075 sigemptyset(&act.sa_mask);
3078 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
3079 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
3081 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
3082 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
3083 act.sa_flags |= SA_NOCLDWAIT;
3085 if (sigaction(signo, &act, &oact) == -1)
3086 return (Sighandler_t) SIG_ERR;
3088 return (Sighandler_t) oact.sa_handler;
3092 Perl_rsignal_state(pTHX_ int signo)
3094 struct sigaction oact;
3095 PERL_UNUSED_CONTEXT;
3097 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
3098 return (Sighandler_t) SIG_ERR;
3100 return (Sighandler_t) oact.sa_handler;
3104 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3107 struct sigaction act;
3109 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
3112 /* only "parent" interpreter can diddle signals */
3113 if (PL_curinterp != aTHX)
3117 act.sa_handler = (void(*)(int))handler;
3118 sigemptyset(&act.sa_mask);
3121 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
3122 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
3124 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
3125 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
3126 act.sa_flags |= SA_NOCLDWAIT;
3128 return sigaction(signo, &act, save);
3132 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3136 /* only "parent" interpreter can diddle signals */
3137 if (PL_curinterp != aTHX)
3141 return sigaction(signo, save, (struct sigaction *)NULL);
3144 #else /* !HAS_SIGACTION */
3147 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
3149 #if defined(USE_ITHREADS) && !defined(WIN32)
3150 /* only "parent" interpreter can diddle signals */
3151 if (PL_curinterp != aTHX)
3152 return (Sighandler_t) SIG_ERR;
3155 return PerlProc_signal(signo, handler);
3166 Perl_rsignal_state(pTHX_ int signo)
3169 Sighandler_t oldsig;
3171 #if defined(USE_ITHREADS) && !defined(WIN32)
3172 /* only "parent" interpreter can diddle signals */
3173 if (PL_curinterp != aTHX)
3174 return (Sighandler_t) SIG_ERR;
3178 oldsig = PerlProc_signal(signo, sig_trap);
3179 PerlProc_signal(signo, oldsig);
3181 PerlProc_kill(PerlProc_getpid(), signo);
3186 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
3188 #if defined(USE_ITHREADS) && !defined(WIN32)
3189 /* only "parent" interpreter can diddle signals */
3190 if (PL_curinterp != aTHX)
3193 *save = PerlProc_signal(signo, handler);
3194 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
3198 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
3200 #if defined(USE_ITHREADS) && !defined(WIN32)
3201 /* only "parent" interpreter can diddle signals */
3202 if (PL_curinterp != aTHX)
3205 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
3208 #endif /* !HAS_SIGACTION */
3209 #endif /* !PERL_MICRO */
3211 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
3212 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
3214 Perl_my_pclose(pTHX_ PerlIO *ptr)
3217 Sigsave_t hstat, istat, qstat;
3224 const int fd = PerlIO_fileno(ptr);
3227 /* Find out whether the refcount is low enough for us to wait for the
3228 child proc without blocking. */
3229 const bool should_wait = PerlIOUnix_refcnt(fd) == 1;
3231 const bool should_wait = 1;
3234 svp = av_fetch(PL_fdpid,fd,TRUE);
3235 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
3237 *svp = &PL_sv_undef;
3239 if (pid == -1) { /* Opened by popen. */
3240 return my_syspclose(ptr);
3243 close_failed = (PerlIO_close(ptr) == EOF);
3246 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
3249 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
3250 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
3251 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
3253 if (should_wait) do {
3254 pid2 = wait4pid(pid, &status, 0);
3255 } while (pid2 == -1 && errno == EINTR);
3257 rsignal_restore(SIGHUP, &hstat);
3258 rsignal_restore(SIGINT, &istat);
3259 rsignal_restore(SIGQUIT, &qstat);
3267 ? pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)
3272 #if defined(__LIBCATAMOUNT__)
3274 Perl_my_pclose(pTHX_ PerlIO *ptr)
3279 #endif /* !DOSISH */
3281 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
3283 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
3287 PERL_ARGS_ASSERT_WAIT4PID;
3290 #ifdef PERL_USES_PL_PIDSTATUS
3293 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
3294 pid, rather than a string form. */
3295 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3296 if (svp && *svp != &PL_sv_undef) {
3297 *statusp = SvIVX(*svp);
3298 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
3306 hv_iterinit(PL_pidstatus);
3307 if ((entry = hv_iternext(PL_pidstatus))) {
3308 SV * const sv = hv_iterval(PL_pidstatus,entry);
3310 const char * const spid = hv_iterkey(entry,&len);
3312 assert (len == sizeof(Pid_t));
3313 memcpy((char *)&pid, spid, len);
3314 *statusp = SvIVX(sv);
3315 /* The hash iterator is currently on this entry, so simply
3316 calling hv_delete would trigger the lazy delete, which on
3317 aggregate does more work, beacuse next call to hv_iterinit()
3318 would spot the flag, and have to call the delete routine,
3319 while in the meantime any new entries can't re-use that
3321 hv_iterinit(PL_pidstatus);
3322 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3329 # ifdef HAS_WAITPID_RUNTIME
3330 if (!HAS_WAITPID_RUNTIME)
3333 result = PerlProc_waitpid(pid,statusp,flags);
3336 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
3337 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
3340 #ifdef PERL_USES_PL_PIDSTATUS
3341 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3346 Perl_croak(aTHX_ "Can't do waitpid with flags");
3348 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3349 pidgone(result,*statusp);
3355 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3358 if (result < 0 && errno == EINTR) {
3360 errno = EINTR; /* reset in case a signal handler changed $! */
3364 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3366 #ifdef PERL_USES_PL_PIDSTATUS
3368 S_pidgone(pTHX_ Pid_t pid, int status)
3372 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3373 SvUPGRADE(sv,SVt_IV);
3374 SvIV_set(sv, status);
3379 #if defined(atarist) || defined(OS2) || defined(EPOC)
3382 int /* Cannot prototype with I32
3384 my_syspclose(PerlIO *ptr)
3387 Perl_my_pclose(pTHX_ PerlIO *ptr)
3390 /* Needs work for PerlIO ! */
3391 FILE * const f = PerlIO_findFILE(ptr);
3392 const I32 result = pclose(f);
3393 PerlIO_releaseFILE(ptr,f);
3401 Perl_my_pclose(pTHX_ PerlIO *ptr)
3403 /* Needs work for PerlIO ! */
3404 FILE * const f = PerlIO_findFILE(ptr);
3405 I32 result = djgpp_pclose(f);
3406 result = (result << 8) & 0xff00;
3407 PerlIO_releaseFILE(ptr,f);
3412 #define PERL_REPEATCPY_LINEAR 4
3414 Perl_repeatcpy(register char *to, register const char *from, I32 len, register IV count)
3416 PERL_ARGS_ASSERT_REPEATCPY;
3419 memset(to, *from, count);
3421 register char *p = to;
3422 IV items, linear, half;
3424 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3425 for (items = 0; items < linear; ++items) {
3426 register const char *q = from;
3428 for (todo = len; todo > 0; todo--)
3433 while (items <= half) {
3434 IV size = items * len;
3435 memcpy(p, to, size);
3441 memcpy(p, to, (count - items) * len);
3447 Perl_same_dirent(pTHX_ const char *a, const char *b)
3449 char *fa = strrchr(a,'/');
3450 char *fb = strrchr(b,'/');
3453 SV * const tmpsv = sv_newmortal();
3455 PERL_ARGS_ASSERT_SAME_DIRENT;
3468 sv_setpvs(tmpsv, ".");
3470 sv_setpvn(tmpsv, a, fa - a);
3471 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3474 sv_setpvs(tmpsv, ".");
3476 sv_setpvn(tmpsv, b, fb - b);
3477 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3479 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3480 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3482 #endif /* !HAS_RENAME */
3485 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3486 const char *const *const search_ext, I32 flags)
3489 const char *xfound = NULL;
3490 char *xfailed = NULL;
3491 char tmpbuf[MAXPATHLEN];
3496 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3497 # define SEARCH_EXTS ".bat", ".cmd", NULL
3498 # define MAX_EXT_LEN 4
3501 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3502 # define MAX_EXT_LEN 4
3505 # define SEARCH_EXTS ".pl", ".com", NULL
3506 # define MAX_EXT_LEN 4
3508 /* additional extensions to try in each dir if scriptname not found */
3510 static const char *const exts[] = { SEARCH_EXTS };
3511 const char *const *const ext = search_ext ? search_ext : exts;
3512 int extidx = 0, i = 0;
3513 const char *curext = NULL;
3515 PERL_UNUSED_ARG(search_ext);
3516 # define MAX_EXT_LEN 0
3519 PERL_ARGS_ASSERT_FIND_SCRIPT;
3522 * If dosearch is true and if scriptname does not contain path
3523 * delimiters, search the PATH for scriptname.
3525 * If SEARCH_EXTS is also defined, will look for each
3526 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3527 * while searching the PATH.
3529 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3530 * proceeds as follows:
3531 * If DOSISH or VMSISH:
3532 * + look for ./scriptname{,.foo,.bar}
3533 * + search the PATH for scriptname{,.foo,.bar}
3536 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3537 * this will not look in '.' if it's not in the PATH)
3542 # ifdef ALWAYS_DEFTYPES
3543 len = strlen(scriptname);
3544 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3545 int idx = 0, deftypes = 1;
3548 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3551 int idx = 0, deftypes = 1;
3554 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3556 /* The first time through, just add SEARCH_EXTS to whatever we
3557 * already have, so we can check for default file types. */
3559 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3565 if ((strlen(tmpbuf) + strlen(scriptname)
3566 + MAX_EXT_LEN) >= sizeof tmpbuf)
3567 continue; /* don't search dir with too-long name */
3568 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3572 if (strEQ(scriptname, "-"))
3574 if (dosearch) { /* Look in '.' first. */
3575 const char *cur = scriptname;
3577 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3579 if (strEQ(ext[i++],curext)) {
3580 extidx = -1; /* already has an ext */
3585 DEBUG_p(PerlIO_printf(Perl_debug_log,
3586 "Looking for %s\n",cur));
3587 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3588 && !S_ISDIR(PL_statbuf.st_mode)) {
3596 if (cur == scriptname) {
3597 len = strlen(scriptname);
3598 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3600 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3603 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3604 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3609 if (dosearch && !strchr(scriptname, '/')
3611 && !strchr(scriptname, '\\')
3613 && (s = PerlEnv_getenv("PATH")))
3617 bufend = s + strlen(s);
3618 while (s < bufend) {
3619 #if defined(atarist) || defined(DOSISH)
3624 && *s != ';'; len++, s++) {
3625 if (len < sizeof tmpbuf)
3628 if (len < sizeof tmpbuf)
3630 #else /* ! (atarist || DOSISH) */
3631 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3634 #endif /* ! (atarist || DOSISH) */
3637 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3638 continue; /* don't search dir with too-long name */
3640 # if defined(atarist) || defined(DOSISH)
3641 && tmpbuf[len - 1] != '/'
3642 && tmpbuf[len - 1] != '\\'
3645 tmpbuf[len++] = '/';
3646 if (len == 2 && tmpbuf[0] == '.')
3648 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3652 len = strlen(tmpbuf);
3653 if (extidx > 0) /* reset after previous loop */
3657 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3658 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3659 if (S_ISDIR(PL_statbuf.st_mode)) {
3663 } while ( retval < 0 /* not there */
3664 && extidx>=0 && ext[extidx] /* try an extension? */
3665 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3670 if (S_ISREG(PL_statbuf.st_mode)
3671 && cando(S_IRUSR,TRUE,&PL_statbuf)
3672 #if !defined(DOSISH)
3673 && cando(S_IXUSR,TRUE,&PL_statbuf)
3677 xfound = tmpbuf; /* bingo! */
3681 xfailed = savepv(tmpbuf);
3684 if (!xfound && !seen_dot && !xfailed &&
3685 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3686 || S_ISDIR(PL_statbuf.st_mode)))
3688 seen_dot = 1; /* Disable message. */
3690 if (flags & 1) { /* do or die? */
3691 /* diag_listed_as: Can't execute %s */
3692 Perl_croak(aTHX_ "Can't %s %s%s%s",
3693 (xfailed ? "execute" : "find"),
3694 (xfailed ? xfailed : scriptname),
3695 (xfailed ? "" : " on PATH"),
3696 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3701 scriptname = xfound;
3703 return (scriptname ? savepv(scriptname) : NULL);
3706 #ifndef PERL_GET_CONTEXT_DEFINED
3709 Perl_get_context(void)
3712 #if defined(USE_ITHREADS)
3713 # ifdef OLD_PTHREADS_API
3715 int error = pthread_getspecific(PL_thr_key, &t)
3717 Perl_croak_nocontext("panic: pthread_getspecific, error=%d", error);
3720 # ifdef I_MACH_CTHREADS
3721 return (void*)cthread_data(cthread_self());
3723 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3732 Perl_set_context(void *t)
3735 PERL_ARGS_ASSERT_SET_CONTEXT;
3736 #if defined(USE_ITHREADS)
3737 # ifdef I_MACH_CTHREADS
3738 cthread_set_data(cthread_self(), t);
3741 const int error = pthread_setspecific(PL_thr_key, t);
3743 Perl_croak_nocontext("panic: pthread_setspecific, error=%d", error);
3751 #endif /* !PERL_GET_CONTEXT_DEFINED */
3753 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3762 Perl_get_op_names(pTHX)
3764 PERL_UNUSED_CONTEXT;
3765 return (char **)PL_op_name;
3769 Perl_get_op_descs(pTHX)
3771 PERL_UNUSED_CONTEXT;
3772 return (char **)PL_op_desc;
3776 Perl_get_no_modify(pTHX)
3778 PERL_UNUSED_CONTEXT;
3779 return PL_no_modify;
3783 Perl_get_opargs(pTHX)
3785 PERL_UNUSED_CONTEXT;
3786 return (U32 *)PL_opargs;
3790 Perl_get_ppaddr(pTHX)
3793 PERL_UNUSED_CONTEXT;
3794 return (PPADDR_t*)PL_ppaddr;
3797 #ifndef HAS_GETENV_LEN
3799 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3801 char * const env_trans = PerlEnv_getenv(env_elem);
3802 PERL_UNUSED_CONTEXT;
3803 PERL_ARGS_ASSERT_GETENV_LEN;
3805 *len = strlen(env_trans);
3812 Perl_get_vtbl(pTHX_ int vtbl_id)
3814 PERL_UNUSED_CONTEXT;
3816 return (vtbl_id < 0 || vtbl_id >= magic_vtable_max)
3817 ? NULL : PL_magic_vtables + vtbl_id;
3821 Perl_my_fflush_all(pTHX)
3823 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3824 return PerlIO_flush(NULL);
3826 # if defined(HAS__FWALK)
3827 extern int fflush(FILE *);
3828 /* undocumented, unprototyped, but very useful BSDism */
3829 extern void _fwalk(int (*)(FILE *));
3833 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3835 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3836 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3838 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3839 open_max = sysconf(_SC_OPEN_MAX);
3842 open_max = FOPEN_MAX;
3845 open_max = OPEN_MAX;
3856 for (i = 0; i < open_max; i++)
3857 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3858 STDIO_STREAM_ARRAY[i]._file < open_max &&
3859 STDIO_STREAM_ARRAY[i]._flag)
3860 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3864 SETERRNO(EBADF,RMS_IFI);
3871 Perl_report_wrongway_fh(pTHX_ const GV *gv, const char have)
3873 if (ckWARN(WARN_IO)) {
3875 = gv && (isGV(gv) || isGV_with_GP(gv))
3876 ? sv_2mortal(newSVhek(GvENAME_HEK((gv))))
3878 const char * const direction = have == '>' ? "out" : "in";
3880 if (name && SvPOK(name) && *SvPV_nolen(name))
3881 Perl_warner(aTHX_ packWARN(WARN_IO),
3882 "Filehandle %"SVf" opened only for %sput",
3885 Perl_warner(aTHX_ packWARN(WARN_IO),
3886 "Filehandle opened only for %sput", direction);
3891 Perl_report_evil_fh(pTHX_ const GV *gv)
3893 const IO *io = gv ? GvIO(gv) : NULL;
3894 const PERL_BITFIELD16 op = PL_op->op_type;
3898 if (io && IoTYPE(io) == IoTYPE_CLOSED) {
3900 warn_type = WARN_CLOSED;
3904 warn_type = WARN_UNOPENED;
3907 if (ckWARN(warn_type)) {
3909 = gv && (isGV(gv) || isGV_with_GP(gv)) && GvENAMELEN(gv) ?
3910 sv_2mortal(newSVhek(GvENAME_HEK(gv))) : NULL;
3911 const char * const pars =
3912 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3913 const char * const func =
3915 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3916 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3918 const char * const type =
3920 (OP_IS_SOCKET(op) || (io && IoTYPE(io) == IoTYPE_SOCKET)
3921 ? "socket" : "filehandle");
3922 const bool have_name = name && SvPOK(name) && *SvPV_nolen(name);
3923 Perl_warner(aTHX_ packWARN(warn_type),
3924 "%s%s on %s %s%s%"SVf, func, pars, vile, type,
3925 have_name ? " " : "",
3926 SVfARG(have_name ? name : &PL_sv_no));
3927 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3929 aTHX_ packWARN(warn_type),
3930 "\t(Are you trying to call %s%s on dirhandle%s%"SVf"?)\n",
3931 func, pars, have_name ? " " : "",
3932 SVfARG(have_name ? name : &PL_sv_no)
3937 /* To workaround core dumps from the uninitialised tm_zone we get the
3938 * system to give us a reasonable struct to copy. This fix means that
3939 * strftime uses the tm_zone and tm_gmtoff values returned by
3940 * localtime(time()). That should give the desired result most of the
3941 * time. But probably not always!
3943 * This does not address tzname aspects of NETaa14816.
3948 # ifndef STRUCT_TM_HASZONE
3949 # define STRUCT_TM_HASZONE
3953 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3954 # ifndef HAS_TM_TM_ZONE
3955 # define HAS_TM_TM_ZONE
3960 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3962 #ifdef HAS_TM_TM_ZONE
3964 const struct tm* my_tm;
3965 PERL_ARGS_ASSERT_INIT_TM;
3967 my_tm = localtime(&now);
3969 Copy(my_tm, ptm, 1, struct tm);
3971 PERL_ARGS_ASSERT_INIT_TM;
3972 PERL_UNUSED_ARG(ptm);
3977 * mini_mktime - normalise struct tm values without the localtime()
3978 * semantics (and overhead) of mktime().
3981 Perl_mini_mktime(pTHX_ struct tm *ptm)
3985 int month, mday, year, jday;
3986 int odd_cent, odd_year;
3987 PERL_UNUSED_CONTEXT;
3989 PERL_ARGS_ASSERT_MINI_MKTIME;
3991 #define DAYS_PER_YEAR 365
3992 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3993 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3994 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3995 #define SECS_PER_HOUR (60*60)
3996 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3997 /* parentheses deliberately absent on these two, otherwise they don't work */
3998 #define MONTH_TO_DAYS 153/5
3999 #define DAYS_TO_MONTH 5/153
4000 /* offset to bias by March (month 4) 1st between month/mday & year finding */
4001 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
4002 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
4003 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
4006 * Year/day algorithm notes:
4008 * With a suitable offset for numeric value of the month, one can find
4009 * an offset into the year by considering months to have 30.6 (153/5) days,
4010 * using integer arithmetic (i.e., with truncation). To avoid too much
4011 * messing about with leap days, we consider January and February to be
4012 * the 13th and 14th month of the previous year. After that transformation,
4013 * we need the month index we use to be high by 1 from 'normal human' usage,
4014 * so the month index values we use run from 4 through 15.
4016 * Given that, and the rules for the Gregorian calendar (leap years are those
4017 * divisible by 4 unless also divisible by 100, when they must be divisible
4018 * by 400 instead), we can simply calculate the number of days since some
4019 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
4020 * the days we derive from our month index, and adding in the day of the
4021 * month. The value used here is not adjusted for the actual origin which
4022 * it normally would use (1 January A.D. 1), since we're not exposing it.
4023 * We're only building the value so we can turn around and get the
4024 * normalised values for the year, month, day-of-month, and day-of-year.
4026 * For going backward, we need to bias the value we're using so that we find
4027 * the right year value. (Basically, we don't want the contribution of
4028 * March 1st to the number to apply while deriving the year). Having done
4029 * that, we 'count up' the contribution to the year number by accounting for
4030 * full quadracenturies (400-year periods) with their extra leap days, plus
4031 * the contribution from full centuries (to avoid counting in the lost leap
4032 * days), plus the contribution from full quad-years (to count in the normal
4033 * leap days), plus the leftover contribution from any non-leap years.
4034 * At this point, if we were working with an actual leap day, we'll have 0
4035 * days left over. This is also true for March 1st, however. So, we have
4036 * to special-case that result, and (earlier) keep track of the 'odd'
4037 * century and year contributions. If we got 4 extra centuries in a qcent,
4038 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
4039 * Otherwise, we add back in the earlier bias we removed (the 123 from
4040 * figuring in March 1st), find the month index (integer division by 30.6),
4041 * and the remainder is the day-of-month. We then have to convert back to
4042 * 'real' months (including fixing January and February from being 14/15 in
4043 * the previous year to being in the proper year). After that, to get
4044 * tm_yday, we work with the normalised year and get a new yearday value for
4045 * January 1st, which we subtract from the yearday value we had earlier,
4046 * representing the date we've re-built. This is done from January 1
4047 * because tm_yday is 0-origin.
4049 * Since POSIX time routines are only guaranteed to work for times since the
4050 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
4051 * applies Gregorian calendar rules even to dates before the 16th century
4052 * doesn't bother me. Besides, you'd need cultural context for a given
4053 * date to know whether it was Julian or Gregorian calendar, and that's
4054 * outside the scope for this routine. Since we convert back based on the
4055 * same rules we used to build the yearday, you'll only get strange results
4056 * for input which needed normalising, or for the 'odd' century years which
4057 * were leap years in the Julian calendar but not in the Gregorian one.
4058 * I can live with that.
4060 * This algorithm also fails to handle years before A.D. 1 gracefully, but
4061 * that's still outside the scope for POSIX time manipulation, so I don't
4065 year = 1900 + ptm->tm_year;
4066 month = ptm->tm_mon;
4067 mday = ptm->tm_mday;
4068 /* allow given yday with no month & mday to dominate the result */
4069 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
4072 jday = 1 + ptm->tm_yday;
4081 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
4082 yearday += month*MONTH_TO_DAYS + mday + jday;
4084 * Note that we don't know when leap-seconds were or will be,
4085 * so we have to trust the user if we get something which looks
4086 * like a sensible leap-second. Wild values for seconds will
4087 * be rationalised, however.
4089 if ((unsigned) ptm->tm_sec <= 60) {
4096 secs += 60 * ptm->tm_min;
4097 secs += SECS_PER_HOUR * ptm->tm_hour;
4099 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
4100 /* got negative remainder, but need positive time */
4101 /* back off an extra day to compensate */
4102 yearday += (secs/SECS_PER_DAY)-1;
4103 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
4106 yearday += (secs/SECS_PER_DAY);
4107 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
4110 else if (secs >= SECS_PER_DAY) {
4111 yearday += (secs/SECS_PER_DAY);
4112 secs %= SECS_PER_DAY;
4114 ptm->tm_hour = secs/SECS_PER_HOUR;
4115 secs %= SECS_PER_HOUR;
4116 ptm->tm_min = secs/60;
4118 ptm->tm_sec += secs;
4119 /* done with time of day effects */
4121 * The algorithm for yearday has (so far) left it high by 428.
4122 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
4123 * bias it by 123 while trying to figure out what year it
4124 * really represents. Even with this tweak, the reverse
4125 * translation fails for years before A.D. 0001.
4126 * It would still fail for Feb 29, but we catch that one below.
4128 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
4129 yearday -= YEAR_ADJUST;
4130 year = (yearday / DAYS_PER_QCENT) * 400;
4131 yearday %= DAYS_PER_QCENT;
4132 odd_cent = yearday / DAYS_PER_CENT;
4133 year += odd_cent * 100;
4134 yearday %= DAYS_PER_CENT;
4135 year += (yearday / DAYS_PER_QYEAR) * 4;
4136 yearday %= DAYS_PER_QYEAR;
4137 odd_year = yearday / DAYS_PER_YEAR;
4139 yearday %= DAYS_PER_YEAR;
4140 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
4145 yearday += YEAR_ADJUST; /* recover March 1st crock */
4146 month = yearday*DAYS_TO_MONTH;
4147 yearday -= month*MONTH_TO_DAYS;
4148 /* recover other leap-year adjustment */
4157 ptm->tm_year = year - 1900;
4159 ptm->tm_mday = yearday;
4160 ptm->tm_mon = month;
4164 ptm->tm_mon = month - 1;
4166 /* re-build yearday based on Jan 1 to get tm_yday */
4168 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
4169 yearday += 14*MONTH_TO_DAYS + 1;
4170 ptm->tm_yday = jday - yearday;
4171 /* fix tm_wday if not overridden by caller */
4172 if ((unsigned)ptm->tm_wday > 6)
4173 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
4177 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)
4185 PERL_ARGS_ASSERT_MY_STRFTIME;
4187 init_tm(&mytm); /* XXX workaround - see init_tm() above */
4190 mytm.tm_hour = hour;
4191 mytm.tm_mday = mday;
4193 mytm.tm_year = year;
4194 mytm.tm_wday = wday;
4195 mytm.tm_yday = yday;
4196 mytm.tm_isdst = isdst;
4198 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
4199 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
4204 #ifdef HAS_TM_TM_GMTOFF
4205 mytm.tm_gmtoff = mytm2.tm_gmtoff;
4207 #ifdef HAS_TM_TM_ZONE
4208 mytm.tm_zone = mytm2.tm_zone;
4213 Newx(buf, buflen, char);
4214 len = strftime(buf, buflen, fmt, &mytm);
4216 ** The following is needed to handle to the situation where
4217 ** tmpbuf overflows. Basically we want to allocate a buffer
4218 ** and try repeatedly. The reason why it is so complicated
4219 ** is that getting a return value of 0 from strftime can indicate
4220 ** one of the following:
4221 ** 1. buffer overflowed,
4222 ** 2. illegal conversion specifier, or
4223 ** 3. the format string specifies nothing to be returned(not
4224 ** an error). This could be because format is an empty string
4225 ** or it specifies %p that yields an empty string in some locale.
4226 ** If there is a better way to make it portable, go ahead by
4229 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4232 /* Possibly buf overflowed - try again with a bigger buf */
4233 const int fmtlen = strlen(fmt);
4234 int bufsize = fmtlen + buflen;
4236 Renew(buf, bufsize, char);
4238 buflen = strftime(buf, bufsize, fmt, &mytm);
4239 if (buflen > 0 && buflen < bufsize)
4241 /* heuristic to prevent out-of-memory errors */
4242 if (bufsize > 100*fmtlen) {
4248 Renew(buf, bufsize, char);
4253 Perl_croak(aTHX_ "panic: no strftime");
4259 #define SV_CWD_RETURN_UNDEF \
4260 sv_setsv(sv, &PL_sv_undef); \
4263 #define SV_CWD_ISDOT(dp) \
4264 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4265 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4268 =head1 Miscellaneous Functions
4270 =for apidoc getcwd_sv
4272 Fill the sv with current working directory
4277 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4278 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4279 * getcwd(3) if available
4280 * Comments from the orignal:
4281 * This is a faster version of getcwd. It's also more dangerous
4282 * because you might chdir out of a directory that you can't chdir
4286 Perl_getcwd_sv(pTHX_ register SV *sv)
4290 #ifndef INCOMPLETE_TAINTS
4294 PERL_ARGS_ASSERT_GETCWD_SV;
4298 char buf[MAXPATHLEN];
4300 /* Some getcwd()s automatically allocate a buffer of the given
4301 * size from the heap if they are given a NULL buffer pointer.
4302 * The problem is that this behaviour is not portable. */
4303 if (getcwd(buf, sizeof(buf) - 1)) {
4308 sv_setsv(sv, &PL_sv_undef);
4316 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4320 SvUPGRADE(sv, SVt_PV);
4322 if (PerlLIO_lstat(".", &statbuf) < 0) {
4323 SV_CWD_RETURN_UNDEF;
4326 orig_cdev = statbuf.st_dev;
4327 orig_cino = statbuf.st_ino;
4337 if (PerlDir_chdir("..") < 0) {
4338 SV_CWD_RETURN_UNDEF;
4340 if (PerlLIO_stat(".", &statbuf) < 0) {
4341 SV_CWD_RETURN_UNDEF;
4344 cdev = statbuf.st_dev;
4345 cino = statbuf.st_ino;
4347 if (odev == cdev && oino == cino) {
4350 if (!(dir = PerlDir_open("."))) {
4351 SV_CWD_RETURN_UNDEF;
4354 while ((dp = PerlDir_read(dir)) != NULL) {
4356 namelen = dp->d_namlen;
4358 namelen = strlen(dp->d_name);
4361 if (SV_CWD_ISDOT(dp)) {
4365 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4366 SV_CWD_RETURN_UNDEF;
4369 tdev = statbuf.st_dev;
4370 tino = statbuf.st_ino;
4371 if (tino == oino && tdev == odev) {
4377 SV_CWD_RETURN_UNDEF;
4380 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4381 SV_CWD_RETURN_UNDEF;
4384 SvGROW(sv, pathlen + namelen + 1);
4388 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4391 /* prepend current directory to the front */
4393 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4394 pathlen += (namelen + 1);
4396 #ifdef VOID_CLOSEDIR
4399 if (PerlDir_close(dir) < 0) {
4400 SV_CWD_RETURN_UNDEF;
4406 SvCUR_set(sv, pathlen);
4410 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4411 SV_CWD_RETURN_UNDEF;
4414 if (PerlLIO_stat(".", &statbuf) < 0) {
4415 SV_CWD_RETURN_UNDEF;
4418 cdev = statbuf.st_dev;
4419 cino = statbuf.st_ino;
4421 if (cdev != orig_cdev || cino != orig_cino) {
4422 Perl_croak(aTHX_ "Unstable directory path, "
4423 "current directory changed unexpectedly");
4434 #define VERSION_MAX 0x7FFFFFFF
4437 =for apidoc prescan_version
4439 Validate that a given string can be parsed as a version object, but doesn't
4440 actually perform the parsing. Can use either strict or lax validation rules.
4441 Can optionally set a number of hint variables to save the parsing code
4442 some time when tokenizing.
4447 Perl_prescan_version(pTHX_ const char *s, bool strict,
4448 const char **errstr,
4449 bool *sqv, int *ssaw_decimal, int *swidth, bool *salpha) {
4450 bool qv = (sqv ? *sqv : FALSE);
4452 int saw_decimal = 0;
4456 PERL_ARGS_ASSERT_PRESCAN_VERSION;
4458 if (qv && isDIGIT(*d))
4459 goto dotted_decimal_version;
4461 if (*d == 'v') { /* explicit v-string */
4466 else { /* degenerate v-string */
4467 /* requires v1.2.3 */
4468 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4471 dotted_decimal_version:
4472 if (strict && d[0] == '0' && isDIGIT(d[1])) {
4473 /* no leading zeros allowed */
4474 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4477 while (isDIGIT(*d)) /* integer part */
4483 d++; /* decimal point */
4488 /* require v1.2.3 */
4489 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4492 goto version_prescan_finish;
4499 while (isDIGIT(*d)) { /* just keep reading */
4501 while (isDIGIT(*d)) {
4503 /* maximum 3 digits between decimal */
4504 if (strict && j > 3) {
4505 BADVERSION(s,errstr,"Invalid version format (maximum 3 digits between decimals)");
4510 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4513 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4518 else if (*d == '.') {
4520 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4525 else if (!isDIGIT(*d)) {
4531 if (strict && i < 2) {
4532 /* requires v1.2.3 */
4533 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4536 } /* end if dotted-decimal */
4538 { /* decimal versions */
4539 /* special strict case for leading '.' or '0' */
4542 BADVERSION(s,errstr,"Invalid version format (0 before decimal required)");
4544 if (*d == '0' && isDIGIT(d[1])) {
4545 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4549 /* and we never support negative versions */
4551 BADVERSION(s,errstr,"Invalid version format (negative version number)");
4554 /* consume all of the integer part */
4558 /* look for a fractional part */
4560 /* we found it, so consume it */
4564 else if (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') {
4567 BADVERSION(s,errstr,"Invalid version format (version required)");
4569 /* found just an integer */
4570 goto version_prescan_finish;
4572 else if ( d == s ) {
4573 /* didn't find either integer or period */
4574 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4576 else if (*d == '_') {
4577 /* underscore can't come after integer part */
4579 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4581 else if (isDIGIT(d[1])) {
4582 BADVERSION(s,errstr,"Invalid version format (alpha without decimal)");
4585 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4589 /* anything else after integer part is just invalid data */
4590 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4593 /* scan the fractional part after the decimal point*/
4595 if (!isDIGIT(*d) && (strict || ! (!*d || *d == ';' || isSPACE(*d) || *d == '{' || *d == '}') )) {
4596 /* strict or lax-but-not-the-end */
4597 BADVERSION(s,errstr,"Invalid version format (fractional part required)");
4600 while (isDIGIT(*d)) {
4602 if (*d == '.' && isDIGIT(d[-1])) {
4604 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4607 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions must begin with 'v')");
4609 d = (char *)s; /* start all over again */
4611 goto dotted_decimal_version;
4615 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4618 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4620 if ( ! isDIGIT(d[1]) ) {
4621 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4629 version_prescan_finish:
4633 if (!isDIGIT(*d) && (! (!*d || *d == ';' || *d == '{' || *d == '}') )) {
4634 /* trailing non-numeric data */
4635 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4643 *ssaw_decimal = saw_decimal;
4650 =for apidoc scan_version
4652 Returns a pointer to the next character after the parsed
4653 version string, as well as upgrading the passed in SV to
4656 Function must be called with an already existing SV like
4659 s = scan_version(s, SV *sv, bool qv);
4661 Performs some preprocessing to the string to ensure that
4662 it has the correct characteristics of a version. Flags the
4663 object if it contains an underscore (which denotes this
4664 is an alpha version). The boolean qv denotes that the version
4665 should be interpreted as if it had multiple decimals, even if
4672 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4677 const char *errstr = NULL;
4678 int saw_decimal = 0;
4682 AV * const av = newAV();
4683 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4685 PERL_ARGS_ASSERT_SCAN_VERSION;
4687 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4689 #ifndef NODEFAULT_SHAREKEYS
4690 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4693 while (isSPACE(*s)) /* leading whitespace is OK */
4696 last = prescan_version(s, FALSE, &errstr, &qv, &saw_decimal, &width, &alpha);
4698 /* "undef" is a special case and not an error */
4699 if ( ! ( *s == 'u' && strEQ(s,"undef")) ) {
4700 Perl_croak(aTHX_ "%s", errstr);
4710 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4712 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4713 if ( !qv && width < 3 )
4714 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4716 while (isDIGIT(*pos))
4718 if (!isALPHA(*pos)) {
4724 /* this is atoi() that delimits on underscores */
4725 const char *end = pos;
4729 /* the following if() will only be true after the decimal
4730 * point of a version originally created with a bare
4731 * floating point number, i.e. not quoted in any way
4733 if ( !qv && s > start && saw_decimal == 1 ) {
4737 rev += (*s - '0') * mult;
4739 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4740 || (PERL_ABS(rev) > VERSION_MAX )) {
4741 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4742 "Integer overflow in version %d",VERSION_MAX);
4753 while (--end >= s) {
4755 rev += (*end - '0') * mult;
4757 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4758 || (PERL_ABS(rev) > VERSION_MAX )) {
4759 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4760 "Integer overflow in version");
4769 /* Append revision */
4770 av_push(av, newSViv(rev));
4775 else if ( *pos == '.' )
4777 else if ( *pos == '_' && isDIGIT(pos[1]) )
4779 else if ( *pos == ',' && isDIGIT(pos[1]) )
4781 else if ( isDIGIT(*pos) )
4788 while ( isDIGIT(*pos) )
4793 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4801 if ( qv ) { /* quoted versions always get at least three terms*/
4802 I32 len = av_len(av);
4803 /* This for loop appears to trigger a compiler bug on OS X, as it
4804 loops infinitely. Yes, len is negative. No, it makes no sense.
4805 Compiler in question is:
4806 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4807 for ( len = 2 - len; len > 0; len-- )
4808 av_push(MUTABLE_AV(sv), newSViv(0));
4812 av_push(av, newSViv(0));
4815 /* need to save off the current version string for later */
4817 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4818 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4819 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4821 else if ( s > start ) {
4822 SV * orig = newSVpvn(start,s-start);
4823 if ( qv && saw_decimal == 1 && *start != 'v' ) {
4824 /* need to insert a v to be consistent */
4825 sv_insert(orig, 0, 0, "v", 1);
4827 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4830 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4831 av_push(av, newSViv(0));
4834 /* And finally, store the AV in the hash */
4835 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4837 /* fix RT#19517 - special case 'undef' as string */
4838 if ( *s == 'u' && strEQ(s,"undef") ) {
4846 =for apidoc new_version
4848 Returns a new version object based on the passed in SV:
4850 SV *sv = new_version(SV *ver);
4852 Does not alter the passed in ver SV. See "upg_version" if you
4853 want to upgrade the SV.
4859 Perl_new_version(pTHX_ SV *ver)
4862 SV * const rv = newSV(0);
4863 PERL_ARGS_ASSERT_NEW_VERSION;
4864 if ( sv_isobject(ver) && sv_derived_from(ver, "version") )
4865 /* can just copy directly */
4868 AV * const av = newAV();
4870 /* This will get reblessed later if a derived class*/
4871 SV * const hv = newSVrv(rv, "version");
4872 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4873 #ifndef NODEFAULT_SHAREKEYS
4874 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4880 /* Begin copying all of the elements */
4881 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4882 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4884 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4885 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4887 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4889 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4890 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4893 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4895 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4896 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4899 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4900 /* This will get reblessed later if a derived class*/
4901 for ( key = 0; key <= av_len(sav); key++ )
4903 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4904 av_push(av, newSViv(rev));
4907 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4912 const MAGIC* const mg = SvVSTRING_mg(ver);
4913 if ( mg ) { /* already a v-string */
4914 const STRLEN len = mg->mg_len;
4915 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4916 sv_setpvn(rv,version,len);
4917 /* this is for consistency with the pure Perl class */
4918 if ( isDIGIT(*version) )
4919 sv_insert(rv, 0, 0, "v", 1);
4924 sv_setsv(rv,ver); /* make a duplicate */
4929 return upg_version(rv, FALSE);
4933 =for apidoc upg_version
4935 In-place upgrade of the supplied SV to a version object.
4937 SV *sv = upg_version(SV *sv, bool qv);
4939 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4940 to force this SV to be interpreted as an "extended" version.
4946 Perl_upg_version(pTHX_ SV *ver, bool qv)
4948 const char *version, *s;
4953 PERL_ARGS_ASSERT_UPG_VERSION;
4955 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4959 /* may get too much accuracy */
4961 #ifdef USE_LOCALE_NUMERIC
4962 char *loc = savepv(setlocale(LC_NUMERIC, NULL));
4963 setlocale(LC_NUMERIC, "C");
4965 len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4966 #ifdef USE_LOCALE_NUMERIC
4967 setlocale(LC_NUMERIC, loc);
4970 while (tbuf[len-1] == '0' && len > 0) len--;
4971 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4972 version = savepvn(tbuf, len);
4975 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4976 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4980 else /* must be a string or something like a string */
4983 version = savepv(SvPV(ver,len));
4985 # if PERL_VERSION > 5
4986 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4987 if ( len >= 3 && !instr(version,".") && !instr(version,"_")) {
4988 /* may be a v-string */
4989 char *testv = (char *)version;
4991 for (tlen=0; tlen < len; tlen++, testv++) {
4992 /* if one of the characters is non-text assume v-string */
4993 if (testv[0] < ' ') {
4994 SV * const nsv = sv_newmortal();
4997 int saw_decimal = 0;
4998 sv_setpvf(nsv,"v%vd",ver);
4999 pos = nver = savepv(SvPV_nolen(nsv));
5001 /* scan the resulting formatted string */
5002 pos++; /* skip the leading 'v' */
5003 while ( *pos == '.' || isDIGIT(*pos) ) {
5009 /* is definitely a v-string */
5010 if ( saw_decimal >= 2 ) {
5022 s = scan_version(version, ver, qv);
5024 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
5025 "Version string '%s' contains invalid data; "
5026 "ignoring: '%s'", version, s);
5034 Validates that the SV contains valid internal structure for a version object.
5035 It may be passed either the version object (RV) or the hash itself (HV). If
5036 the structure is valid, it returns the HV. If the structure is invalid,
5039 SV *hv = vverify(sv);
5041 Note that it only confirms the bare minimum structure (so as not to get
5042 confused by derived classes which may contain additional hash entries):
5046 =item * The SV is an HV or a reference to an HV
5048 =item * The hash contains a "version" key
5050 =item * The "version" key has a reference to an AV as its value
5058 Perl_vverify(pTHX_ SV *vs)
5062 PERL_ARGS_ASSERT_VVERIFY;
5067 /* see if the appropriate elements exist */
5068 if ( SvTYPE(vs) == SVt_PVHV
5069 && hv_exists(MUTABLE_HV(vs), "version", 7)
5070 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
5071 && SvTYPE(sv) == SVt_PVAV )
5080 Accepts a version object and returns the normalized floating
5081 point representation. Call like:
5085 NOTE: you can pass either the object directly or the SV
5086 contained within the RV.
5088 The SV returned has a refcount of 1.
5094 Perl_vnumify(pTHX_ SV *vs)
5102 PERL_ARGS_ASSERT_VNUMIFY;
5104 /* extract the HV from the object */
5107 Perl_croak(aTHX_ "Invalid version object");
5109 /* see if various flags exist */
5110 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5112 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
5113 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
5118 /* attempt to retrieve the version array */
5119 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
5120 return newSVpvs("0");
5126 return newSVpvs("0");
5129 digit = SvIV(*av_fetch(av, 0, 0));
5130 sv = Perl_newSVpvf(aTHX_ "%d.", (int)PERL_ABS(digit));
5131 for ( i = 1 ; i < len ; i++ )
5133 digit = SvIV(*av_fetch(av, i, 0));
5135 const int denom = (width == 2 ? 10 : 100);
5136 const div_t term = div((int)PERL_ABS(digit),denom);
5137 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
5140 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5146 digit = SvIV(*av_fetch(av, len, 0));
5147 if ( alpha && width == 3 ) /* alpha version */
5149 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
5153 sv_catpvs(sv, "000");
5161 Accepts a version object and returns the normalized string
5162 representation. Call like:
5166 NOTE: you can pass either the object directly or the SV
5167 contained within the RV.
5169 The SV returned has a refcount of 1.
5175 Perl_vnormal(pTHX_ SV *vs)
5182 PERL_ARGS_ASSERT_VNORMAL;
5184 /* extract the HV from the object */
5187 Perl_croak(aTHX_ "Invalid version object");
5189 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
5191 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
5196 return newSVpvs("");
5198 digit = SvIV(*av_fetch(av, 0, 0));
5199 sv = Perl_newSVpvf(aTHX_ "v%"IVdf, (IV)digit);
5200 for ( i = 1 ; i < len ; i++ ) {
5201 digit = SvIV(*av_fetch(av, i, 0));
5202 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5207 /* handle last digit specially */
5208 digit = SvIV(*av_fetch(av, len, 0));
5210 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
5212 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
5215 if ( len <= 2 ) { /* short version, must be at least three */
5216 for ( len = 2 - len; len != 0; len-- )
5223 =for apidoc vstringify
5225 In order to maintain maximum compatibility with earlier versions
5226 of Perl, this function will return either the floating point
5227 notation or the multiple dotted notation, depending on whether
5228 the original version contained 1 or more dots, respectively.
5230 The SV returned has a refcount of 1.
5236 Perl_vstringify(pTHX_ SV *vs)
5238 PERL_ARGS_ASSERT_VSTRINGIFY;
5240 /* extract the HV from the object */
5243 Perl_croak(aTHX_ "Invalid version object");
5245 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
5247 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
5251 return &PL_sv_undef;
5254 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
5264 Version object aware cmp. Both operands must already have been
5265 converted into version objects.
5271 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
5274 bool lalpha = FALSE;
5275 bool ralpha = FALSE;
5280 PERL_ARGS_ASSERT_VCMP;
5282 /* extract the HVs from the objects */
5285 if ( ! ( lhv && rhv ) )
5286 Perl_croak(aTHX_ "Invalid version object");
5288 /* get the left hand term */
5289 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
5290 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
5293 /* and the right hand term */
5294 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
5295 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
5303 while ( i <= m && retval == 0 )
5305 left = SvIV(*av_fetch(lav,i,0));
5306 right = SvIV(*av_fetch(rav,i,0));
5314 /* tiebreaker for alpha with identical terms */
5315 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
5317 if ( lalpha && !ralpha )
5321 else if ( ralpha && !lalpha)
5327 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
5331 while ( i <= r && retval == 0 )
5333 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
5334 retval = -1; /* not a match after all */
5340 while ( i <= l && retval == 0 )
5342 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
5343 retval = +1; /* not a match after all */
5351 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
5352 # define EMULATE_SOCKETPAIR_UDP
5355 #ifdef EMULATE_SOCKETPAIR_UDP
5357 S_socketpair_udp (int fd[2]) {
5359 /* Fake a datagram socketpair using UDP to localhost. */
5360 int sockets[2] = {-1, -1};
5361 struct sockaddr_in addresses[2];
5363 Sock_size_t size = sizeof(struct sockaddr_in);
5364 unsigned short port;
5367 memset(&addresses, 0, sizeof(addresses));
5370 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
5371 if (sockets[i] == -1)
5372 goto tidy_up_and_fail;
5374 addresses[i].sin_family = AF_INET;
5375 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5376 addresses[i].sin_port = 0; /* kernel choses port. */
5377 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
5378 sizeof(struct sockaddr_in)) == -1)
5379 goto tidy_up_and_fail;
5382 /* Now have 2 UDP sockets. Find out which port each is connected to, and
5383 for each connect the other socket to it. */
5386 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
5388 goto tidy_up_and_fail;
5389 if (size != sizeof(struct sockaddr_in))
5390 goto abort_tidy_up_and_fail;
5391 /* !1 is 0, !0 is 1 */
5392 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
5393 sizeof(struct sockaddr_in)) == -1)
5394 goto tidy_up_and_fail;
5397 /* Now we have 2 sockets connected to each other. I don't trust some other
5398 process not to have already sent a packet to us (by random) so send
5399 a packet from each to the other. */
5402 /* I'm going to send my own port number. As a short.
5403 (Who knows if someone somewhere has sin_port as a bitfield and needs
5404 this routine. (I'm assuming crays have socketpair)) */
5405 port = addresses[i].sin_port;
5406 got = PerlLIO_write(sockets[i], &port, sizeof(port));
5407 if (got != sizeof(port)) {
5409 goto tidy_up_and_fail;
5410 goto abort_tidy_up_and_fail;
5414 /* Packets sent. I don't trust them to have arrived though.
5415 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
5416 connect to localhost will use a second kernel thread. In 2.6 the
5417 first thread running the connect() returns before the second completes,
5418 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
5419 returns 0. Poor programs have tripped up. One poor program's authors'
5420 had a 50-1 reverse stock split. Not sure how connected these were.)
5421 So I don't trust someone not to have an unpredictable UDP stack.
5425 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5426 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5430 FD_SET((unsigned int)sockets[0], &rset);
5431 FD_SET((unsigned int)sockets[1], &rset);
5433 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5434 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5435 || !FD_ISSET(sockets[1], &rset)) {
5436 /* I hope this is portable and appropriate. */
5438 goto tidy_up_and_fail;
5439 goto abort_tidy_up_and_fail;
5443 /* And the paranoia department even now doesn't trust it to have arrive
5444 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5446 struct sockaddr_in readfrom;
5447 unsigned short buffer[2];
5452 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5453 sizeof(buffer), MSG_DONTWAIT,
5454 (struct sockaddr *) &readfrom, &size);
5456 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5458 (struct sockaddr *) &readfrom, &size);
5462 goto tidy_up_and_fail;
5463 if (got != sizeof(port)
5464 || size != sizeof(struct sockaddr_in)
5465 /* Check other socket sent us its port. */
5466 || buffer[0] != (unsigned short) addresses[!i].sin_port
5467 /* Check kernel says we got the datagram from that socket */
5468 || readfrom.sin_family != addresses[!i].sin_family
5469 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5470 || readfrom.sin_port != addresses[!i].sin_port)
5471 goto abort_tidy_up_and_fail;
5474 /* My caller (my_socketpair) has validated that this is non-NULL */
5477 /* I hereby declare this connection open. May God bless all who cross
5481 abort_tidy_up_and_fail:
5482 errno = ECONNABORTED;
5486 if (sockets[0] != -1)
5487 PerlLIO_close(sockets[0]);
5488 if (sockets[1] != -1)
5489 PerlLIO_close(sockets[1]);
5494 #endif /* EMULATE_SOCKETPAIR_UDP */
5496 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5498 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5499 /* Stevens says that family must be AF_LOCAL, protocol 0.
5500 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5505 struct sockaddr_in listen_addr;
5506 struct sockaddr_in connect_addr;
5511 || family != AF_UNIX
5514 errno = EAFNOSUPPORT;
5522 #ifdef EMULATE_SOCKETPAIR_UDP
5523 if (type == SOCK_DGRAM)
5524 return S_socketpair_udp(fd);
5527 listener = PerlSock_socket(AF_INET, type, 0);
5530 memset(&listen_addr, 0, sizeof(listen_addr));
5531 listen_addr.sin_family = AF_INET;
5532 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5533 listen_addr.sin_port = 0; /* kernel choses port. */
5534 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5535 sizeof(listen_addr)) == -1)
5536 goto tidy_up_and_fail;
5537 if (PerlSock_listen(listener, 1) == -1)
5538 goto tidy_up_and_fail;
5540 connector = PerlSock_socket(AF_INET, type, 0);
5541 if (connector == -1)
5542 goto tidy_up_and_fail;
5543 /* We want to find out the port number to connect to. */
5544 size = sizeof(connect_addr);
5545 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5547 goto tidy_up_and_fail;
5548 if (size != sizeof(connect_addr))
5549 goto abort_tidy_up_and_fail;
5550 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5551 sizeof(connect_addr)) == -1)
5552 goto tidy_up_and_fail;
5554 size = sizeof(listen_addr);
5555 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5558 goto tidy_up_and_fail;
5559 if (size != sizeof(listen_addr))
5560 goto abort_tidy_up_and_fail;
5561 PerlLIO_close(listener);
5562 /* Now check we are talking to ourself by matching port and host on the
5564 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5566 goto tidy_up_and_fail;
5567 if (size != sizeof(connect_addr)
5568 || listen_addr.sin_family != connect_addr.sin_family
5569 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5570 || listen_addr.sin_port != connect_addr.sin_port) {
5571 goto abort_tidy_up_and_fail;
5577 abort_tidy_up_and_fail:
5579 errno = ECONNABORTED; /* This would be the standard thing to do. */
5581 # ifdef ECONNREFUSED
5582 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5584 errno = ETIMEDOUT; /* Desperation time. */
5591 PerlLIO_close(listener);
5592 if (connector != -1)
5593 PerlLIO_close(connector);
5595 PerlLIO_close(acceptor);
5601 /* In any case have a stub so that there's code corresponding
5602 * to the my_socketpair in embed.fnc. */
5604 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5605 #ifdef HAS_SOCKETPAIR
5606 return socketpair(family, type, protocol, fd);
5615 =for apidoc sv_nosharing
5617 Dummy routine which "shares" an SV when there is no sharing module present.
5618 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5619 Exists to avoid test for a NULL function pointer and because it could
5620 potentially warn under some level of strict-ness.
5626 Perl_sv_nosharing(pTHX_ SV *sv)
5628 PERL_UNUSED_CONTEXT;
5629 PERL_UNUSED_ARG(sv);
5634 =for apidoc sv_destroyable
5636 Dummy routine which reports that object can be destroyed when there is no
5637 sharing module present. It ignores its single SV argument, and returns
5638 'true'. Exists to avoid test for a NULL function pointer and because it
5639 could potentially warn under some level of strict-ness.
5645 Perl_sv_destroyable(pTHX_ SV *sv)
5647 PERL_UNUSED_CONTEXT;
5648 PERL_UNUSED_ARG(sv);
5653 Perl_parse_unicode_opts(pTHX_ const char **popt)
5655 const char *p = *popt;
5658 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5662 opt = (U32) atoi(p);
5665 if (*p && *p != '\n' && *p != '\r') {
5666 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
5668 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5674 case PERL_UNICODE_STDIN:
5675 opt |= PERL_UNICODE_STDIN_FLAG; break;
5676 case PERL_UNICODE_STDOUT:
5677 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5678 case PERL_UNICODE_STDERR:
5679 opt |= PERL_UNICODE_STDERR_FLAG; break;
5680 case PERL_UNICODE_STD:
5681 opt |= PERL_UNICODE_STD_FLAG; break;
5682 case PERL_UNICODE_IN:
5683 opt |= PERL_UNICODE_IN_FLAG; break;
5684 case PERL_UNICODE_OUT:
5685 opt |= PERL_UNICODE_OUT_FLAG; break;
5686 case PERL_UNICODE_INOUT:
5687 opt |= PERL_UNICODE_INOUT_FLAG; break;
5688 case PERL_UNICODE_LOCALE:
5689 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5690 case PERL_UNICODE_ARGV:
5691 opt |= PERL_UNICODE_ARGV_FLAG; break;
5692 case PERL_UNICODE_UTF8CACHEASSERT:
5693 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5695 if (*p != '\n' && *p != '\r') {
5696 if(isSPACE(*p)) goto the_end_of_the_opts_parser;
5699 "Unknown Unicode option letter '%c'", *p);
5706 opt = PERL_UNICODE_DEFAULT_FLAGS;
5708 the_end_of_the_opts_parser:
5710 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5711 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5712 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5724 * This is really just a quick hack which grabs various garbage
5725 * values. It really should be a real hash algorithm which
5726 * spreads the effect of every input bit onto every output bit,
5727 * if someone who knows about such things would bother to write it.
5728 * Might be a good idea to add that function to CORE as well.
5729 * No numbers below come from careful analysis or anything here,
5730 * except they are primes and SEED_C1 > 1E6 to get a full-width
5731 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5732 * probably be bigger too.
5735 # define SEED_C1 1000003
5736 #define SEED_C4 73819
5738 # define SEED_C1 25747
5739 #define SEED_C4 20639
5743 #define SEED_C5 26107
5745 #ifndef PERL_NO_DEV_RANDOM
5750 # include <starlet.h>
5751 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5752 * in 100-ns units, typically incremented ever 10 ms. */
5753 unsigned int when[2];
5755 # ifdef HAS_GETTIMEOFDAY
5756 struct timeval when;
5762 /* This test is an escape hatch, this symbol isn't set by Configure. */
5763 #ifndef PERL_NO_DEV_RANDOM
5764 #ifndef PERL_RANDOM_DEVICE
5765 /* /dev/random isn't used by default because reads from it will block
5766 * if there isn't enough entropy available. You can compile with
5767 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5768 * is enough real entropy to fill the seed. */
5769 # define PERL_RANDOM_DEVICE "/dev/urandom"
5771 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5773 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5782 _ckvmssts(sys$gettim(when));
5783 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5785 # ifdef HAS_GETTIMEOFDAY
5786 PerlProc_gettimeofday(&when,NULL);
5787 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5790 u = (U32)SEED_C1 * when;
5793 u += SEED_C3 * (U32)PerlProc_getpid();
5794 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5795 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5796 u += SEED_C5 * (U32)PTR2UV(&when);
5802 Perl_get_hash_seed(pTHX)
5805 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5811 if (s && isDIGIT(*s))
5812 myseed = (UV)Atoul(s);
5814 #ifdef USE_HASH_SEED_EXPLICIT
5818 /* Compute a random seed */
5819 (void)seedDrand01((Rand_seed_t)seed());
5820 myseed = (UV)(Drand01() * (NV)UV_MAX);
5821 #if RANDBITS < (UVSIZE * 8)
5822 /* Since there are not enough randbits to to reach all
5823 * the bits of a UV, the low bits might need extra
5824 * help. Sum in another random number that will
5825 * fill in the low bits. */
5827 (UV)(Drand01() * (NV)((((UV)1) << ((UVSIZE * 8 - RANDBITS))) - 1));
5828 #endif /* RANDBITS < (UVSIZE * 8) */
5829 if (myseed == 0) { /* Superparanoia. */
5830 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5832 Perl_croak(aTHX_ "Your random numbers are not that random");
5835 PL_rehash_seed_set = TRUE;
5842 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5844 const char * stashpv = CopSTASHPV(c);
5845 const char * name = HvNAME_get(hv);
5846 PERL_UNUSED_CONTEXT;
5847 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5849 if (!stashpv || !name)
5850 return stashpv == name;
5851 if ( HvNAMEUTF8(hv) && !(CopSTASH_flags(c) & SVf_UTF8 ? 1 : 0) ) {
5852 if (CopSTASH_flags(c) & SVf_UTF8) {
5853 return (bytes_cmp_utf8(
5854 (const U8*)stashpv, strlen(stashpv),
5855 (const U8*)name, HEK_LEN(HvNAME_HEK(hv))) == 0);
5857 return (bytes_cmp_utf8(
5858 (const U8*)name, HEK_LEN(HvNAME_HEK(hv)),
5859 (const U8*)stashpv, strlen(stashpv)) == 0);
5863 return (stashpv == name
5864 || strEQ(stashpv, name));
5871 #ifdef PERL_GLOBAL_STRUCT
5873 #define PERL_GLOBAL_STRUCT_INIT
5874 #include "opcode.h" /* the ppaddr and check */
5877 Perl_init_global_struct(pTHX)
5879 struct perl_vars *plvarsp = NULL;
5880 # ifdef PERL_GLOBAL_STRUCT
5881 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5882 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5883 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5884 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5885 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5889 plvarsp = PL_VarsPtr;
5890 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5895 # define PERLVAR(prefix,var,type) /**/
5896 # define PERLVARA(prefix,var,n,type) /**/
5897 # define PERLVARI(prefix,var,type,init) plvarsp->prefix##var = init;
5898 # define PERLVARIC(prefix,var,type,init) plvarsp->prefix##var = init;
5899 # include "perlvars.h"
5904 # ifdef PERL_GLOBAL_STRUCT
5907 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5908 if (!plvarsp->Gppaddr)
5912 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5913 if (!plvarsp->Gcheck)
5915 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5916 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5918 # ifdef PERL_SET_VARS
5919 PERL_SET_VARS(plvarsp);
5921 # undef PERL_GLOBAL_STRUCT_INIT
5926 #endif /* PERL_GLOBAL_STRUCT */
5928 #ifdef PERL_GLOBAL_STRUCT
5931 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5933 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5934 # ifdef PERL_GLOBAL_STRUCT
5935 # ifdef PERL_UNSET_VARS
5936 PERL_UNSET_VARS(plvarsp);
5938 free(plvarsp->Gppaddr);
5939 free(plvarsp->Gcheck);
5940 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5946 #endif /* PERL_GLOBAL_STRUCT */
5950 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5951 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5952 * given, and you supply your own implementation.
5954 * The default implementation reads a single env var, PERL_MEM_LOG,
5955 * expecting one or more of the following:
5957 * \d+ - fd fd to write to : must be 1st (atoi)
5958 * 'm' - memlog was PERL_MEM_LOG=1
5959 * 's' - svlog was PERL_SV_LOG=1
5960 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5962 * This makes the logger controllable enough that it can reasonably be
5963 * added to the system perl.
5966 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5967 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5969 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5971 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5972 * writes to. In the default logger, this is settable at runtime.
5974 #ifndef PERL_MEM_LOG_FD
5975 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5978 #ifndef PERL_MEM_LOG_NOIMPL
5980 # ifdef DEBUG_LEAKING_SCALARS
5981 # define SV_LOG_SERIAL_FMT " [%lu]"
5982 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5984 # define SV_LOG_SERIAL_FMT
5985 # define _SV_LOG_SERIAL_ARG(sv)
5989 S_mem_log_common(enum mem_log_type mlt, const UV n,
5990 const UV typesize, const char *type_name, const SV *sv,
5991 Malloc_t oldalloc, Malloc_t newalloc,
5992 const char *filename, const int linenumber,
5993 const char *funcname)
5997 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5999 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
6002 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
6004 /* We can't use SVs or PerlIO for obvious reasons,
6005 * so we'll use stdio and low-level IO instead. */
6006 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
6008 # ifdef HAS_GETTIMEOFDAY
6009 # define MEM_LOG_TIME_FMT "%10d.%06d: "
6010 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
6012 gettimeofday(&tv, 0);
6014 # define MEM_LOG_TIME_FMT "%10d: "
6015 # define MEM_LOG_TIME_ARG (int)when
6019 /* If there are other OS specific ways of hires time than
6020 * gettimeofday() (see ext/Time-HiRes), the easiest way is
6021 * probably that they would be used to fill in the struct
6025 int fd = atoi(pmlenv);
6027 fd = PERL_MEM_LOG_FD;
6029 if (strchr(pmlenv, 't')) {
6030 len = my_snprintf(buf, sizeof(buf),
6031 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
6032 PerlLIO_write(fd, buf, len);
6036 len = my_snprintf(buf, sizeof(buf),
6037 "alloc: %s:%d:%s: %"IVdf" %"UVuf
6038 " %s = %"IVdf": %"UVxf"\n",
6039 filename, linenumber, funcname, n, typesize,
6040 type_name, n * typesize, PTR2UV(newalloc));
6043 len = my_snprintf(buf, sizeof(buf),
6044 "realloc: %s:%d:%s: %"IVdf" %"UVuf
6045 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
6046 filename, linenumber, funcname, n, typesize,
6047 type_name, n * typesize, PTR2UV(oldalloc),
6051 len = my_snprintf(buf, sizeof(buf),
6052 "free: %s:%d:%s: %"UVxf"\n",
6053 filename, linenumber, funcname,
6058 len = my_snprintf(buf, sizeof(buf),
6059 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
6060 mlt == MLT_NEW_SV ? "new" : "del",
6061 filename, linenumber, funcname,
6062 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
6067 PerlLIO_write(fd, buf, len);
6071 #endif /* !PERL_MEM_LOG_NOIMPL */
6073 #ifndef PERL_MEM_LOG_NOIMPL
6075 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
6076 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
6078 /* this is suboptimal, but bug compatible. User is providing their
6079 own implementation, but is getting these functions anyway, and they
6080 do nothing. But _NOIMPL users should be able to cope or fix */
6082 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
6083 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
6087 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
6089 const char *filename, const int linenumber,
6090 const char *funcname)
6092 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
6093 NULL, NULL, newalloc,
6094 filename, linenumber, funcname);
6099 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
6100 Malloc_t oldalloc, Malloc_t newalloc,
6101 const char *filename, const int linenumber,
6102 const char *funcname)
6104 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
6105 NULL, oldalloc, newalloc,
6106 filename, linenumber, funcname);
6111 Perl_mem_log_free(Malloc_t oldalloc,
6112 const char *filename, const int linenumber,
6113 const char *funcname)
6115 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
6116 filename, linenumber, funcname);
6121 Perl_mem_log_new_sv(const SV *sv,
6122 const char *filename, const int linenumber,
6123 const char *funcname)
6125 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
6126 filename, linenumber, funcname);
6130 Perl_mem_log_del_sv(const SV *sv,
6131 const char *filename, const int linenumber,
6132 const char *funcname)
6134 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
6135 filename, linenumber, funcname);
6138 #endif /* PERL_MEM_LOG */
6141 =for apidoc my_sprintf
6143 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
6144 the length of the string written to the buffer. Only rare pre-ANSI systems
6145 need the wrapper function - usually this is a direct call to C<sprintf>.
6149 #ifndef SPRINTF_RETURNS_STRLEN
6151 Perl_my_sprintf(char *buffer, const char* pat, ...)
6154 PERL_ARGS_ASSERT_MY_SPRINTF;
6155 va_start(args, pat);
6156 vsprintf(buffer, pat, args);
6158 return strlen(buffer);
6163 =for apidoc my_snprintf
6165 The C library C<snprintf> functionality, if available and
6166 standards-compliant (uses C<vsnprintf>, actually). However, if the
6167 C<vsnprintf> is not available, will unfortunately use the unsafe
6168 C<vsprintf> which can overrun the buffer (there is an overrun check,
6169 but that may be too late). Consider using C<sv_vcatpvf> instead, or
6170 getting C<vsnprintf>.
6175 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
6180 PERL_ARGS_ASSERT_MY_SNPRINTF;
6181 va_start(ap, format);
6182 #ifdef HAS_VSNPRINTF
6183 retval = vsnprintf(buffer, len, format, ap);
6185 retval = vsprintf(buffer, format, ap);
6188 /* vsprintf() shows failure with < 0 */
6190 #ifdef HAS_VSNPRINTF
6191 /* vsnprintf() shows failure with >= len */
6193 (len > 0 && (Size_t)retval >= len)
6196 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
6201 =for apidoc my_vsnprintf
6203 The C library C<vsnprintf> if available and standards-compliant.
6204 However, if if the C<vsnprintf> is not available, will unfortunately
6205 use the unsafe C<vsprintf> which can overrun the buffer (there is an
6206 overrun check, but that may be too late). Consider using
6207 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
6212 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
6219 PERL_ARGS_ASSERT_MY_VSNPRINTF;
6221 Perl_va_copy(ap, apc);
6222 # ifdef HAS_VSNPRINTF
6223 retval = vsnprintf(buffer, len, format, apc);
6225 retval = vsprintf(buffer, format, apc);
6228 # ifdef HAS_VSNPRINTF
6229 retval = vsnprintf(buffer, len, format, ap);
6231 retval = vsprintf(buffer, format, ap);
6233 #endif /* #ifdef NEED_VA_COPY */
6234 /* vsprintf() shows failure with < 0 */
6236 #ifdef HAS_VSNPRINTF
6237 /* vsnprintf() shows failure with >= len */
6239 (len > 0 && (Size_t)retval >= len)
6242 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
6247 Perl_my_clearenv(pTHX)
6250 #if ! defined(PERL_MICRO)
6251 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
6253 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
6254 # if defined(USE_ENVIRON_ARRAY)
6255 # if defined(USE_ITHREADS)
6256 /* only the parent thread can clobber the process environment */
6257 if (PL_curinterp == aTHX)
6258 # endif /* USE_ITHREADS */
6260 # if ! defined(PERL_USE_SAFE_PUTENV)
6261 if ( !PL_use_safe_putenv) {
6263 if (environ == PL_origenviron)
6264 environ = (char**)safesysmalloc(sizeof(char*));
6266 for (i = 0; environ[i]; i++)
6267 (void)safesysfree(environ[i]);
6270 # else /* PERL_USE_SAFE_PUTENV */
6271 # if defined(HAS_CLEARENV)
6273 # elif defined(HAS_UNSETENV)
6274 int bsiz = 80; /* Most envvar names will be shorter than this. */
6275 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
6276 char *buf = (char*)safesysmalloc(bufsiz);
6277 while (*environ != NULL) {
6278 char *e = strchr(*environ, '=');
6279 int l = e ? e - *environ : (int)strlen(*environ);
6281 (void)safesysfree(buf);
6282 bsiz = l + 1; /* + 1 for the \0. */
6283 buf = (char*)safesysmalloc(bufsiz);
6285 memcpy(buf, *environ, l);
6287 (void)unsetenv(buf);
6289 (void)safesysfree(buf);
6290 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
6291 /* Just null environ and accept the leakage. */
6293 # endif /* HAS_CLEARENV || HAS_UNSETENV */
6294 # endif /* ! PERL_USE_SAFE_PUTENV */
6296 # endif /* USE_ENVIRON_ARRAY */
6297 # endif /* PERL_IMPLICIT_SYS || WIN32 */
6298 #endif /* PERL_MICRO */
6301 #ifdef PERL_IMPLICIT_CONTEXT
6303 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
6304 the global PL_my_cxt_index is incremented, and that value is assigned to
6305 that module's static my_cxt_index (who's address is passed as an arg).
6306 Then, for each interpreter this function is called for, it makes sure a
6307 void* slot is available to hang the static data off, by allocating or
6308 extending the interpreter's PL_my_cxt_list array */
6310 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
6312 Perl_my_cxt_init(pTHX_ int *index, size_t size)
6316 PERL_ARGS_ASSERT_MY_CXT_INIT;
6318 /* this module hasn't been allocated an index yet */
6319 #if defined(USE_ITHREADS)
6320 MUTEX_LOCK(&PL_my_ctx_mutex);
6322 *index = PL_my_cxt_index++;
6323 #if defined(USE_ITHREADS)
6324 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6328 /* make sure the array is big enough */
6329 if (PL_my_cxt_size <= *index) {
6330 if (PL_my_cxt_size) {
6331 while (PL_my_cxt_size <= *index)
6332 PL_my_cxt_size *= 2;
6333 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6336 PL_my_cxt_size = 16;
6337 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6340 /* newSV() allocates one more than needed */
6341 p = (void*)SvPVX(newSV(size-1));
6342 PL_my_cxt_list[*index] = p;
6343 Zero(p, size, char);
6347 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6350 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
6355 PERL_ARGS_ASSERT_MY_CXT_INDEX;
6357 for (index = 0; index < PL_my_cxt_index; index++) {
6358 const char *key = PL_my_cxt_keys[index];
6359 /* try direct pointer compare first - there are chances to success,
6360 * and it's much faster.
6362 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
6369 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
6375 PERL_ARGS_ASSERT_MY_CXT_INIT;
6377 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
6379 /* this module hasn't been allocated an index yet */
6380 #if defined(USE_ITHREADS)
6381 MUTEX_LOCK(&PL_my_ctx_mutex);
6383 index = PL_my_cxt_index++;
6384 #if defined(USE_ITHREADS)
6385 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6389 /* make sure the array is big enough */
6390 if (PL_my_cxt_size <= index) {
6391 int old_size = PL_my_cxt_size;
6393 if (PL_my_cxt_size) {
6394 while (PL_my_cxt_size <= index)
6395 PL_my_cxt_size *= 2;
6396 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6397 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6400 PL_my_cxt_size = 16;
6401 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6402 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6404 for (i = old_size; i < PL_my_cxt_size; i++) {
6405 PL_my_cxt_keys[i] = 0;
6406 PL_my_cxt_list[i] = 0;
6409 PL_my_cxt_keys[index] = my_cxt_key;
6410 /* newSV() allocates one more than needed */
6411 p = (void*)SvPVX(newSV(size-1));
6412 PL_my_cxt_list[index] = p;
6413 Zero(p, size, char);
6416 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6417 #endif /* PERL_IMPLICIT_CONTEXT */
6420 Perl_xs_version_bootcheck(pTHX_ U32 items, U32 ax, const char *xs_p,
6424 const char *vn = NULL;
6425 SV *const module = PL_stack_base[ax];
6427 PERL_ARGS_ASSERT_XS_VERSION_BOOTCHECK;
6429 if (items >= 2) /* version supplied as bootstrap arg */
6430 sv = PL_stack_base[ax + 1];
6432 /* XXX GV_ADDWARN */
6434 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", module, vn), 0);
6435 if (!sv || !SvOK(sv)) {
6437 sv = get_sv(Perl_form(aTHX_ "%"SVf"::%s", module, vn), 0);
6441 SV *xssv = Perl_newSVpvn_flags(aTHX_ xs_p, xs_len, SVs_TEMP);
6442 SV *pmsv = sv_isobject(sv) && sv_derived_from(sv, "version")
6443 ? sv : sv_2mortal(new_version(sv));
6444 xssv = upg_version(xssv, 0);
6445 if ( vcmp(pmsv,xssv) ) {
6446 SV *string = vstringify(xssv);
6447 SV *xpt = Perl_newSVpvf(aTHX_ "%"SVf" object version %"SVf
6448 " does not match ", module, string);
6450 SvREFCNT_dec(string);
6451 string = vstringify(pmsv);
6454 Perl_sv_catpvf(aTHX_ xpt, "$%"SVf"::%s %"SVf, module, vn,
6457 Perl_sv_catpvf(aTHX_ xpt, "bootstrap parameter %"SVf, string);
6459 SvREFCNT_dec(string);
6461 Perl_sv_2mortal(aTHX_ xpt);
6462 Perl_croak_sv(aTHX_ xpt);
6468 Perl_xs_apiversion_bootcheck(pTHX_ SV *module, const char *api_p,
6472 SV *compver = Perl_newSVpvn_flags(aTHX_ api_p, api_len, SVs_TEMP);
6475 PERL_ARGS_ASSERT_XS_APIVERSION_BOOTCHECK;
6477 /* This might croak */
6478 compver = upg_version(compver, 0);
6479 /* This should never croak */
6480 runver = new_version(PL_apiversion);
6481 if (vcmp(compver, runver)) {
6482 SV *compver_string = vstringify(compver);
6483 SV *runver_string = vstringify(runver);
6484 xpt = Perl_newSVpvf(aTHX_ "Perl API version %"SVf
6485 " of %"SVf" does not match %"SVf,
6486 compver_string, module, runver_string);
6487 Perl_sv_2mortal(aTHX_ xpt);
6489 SvREFCNT_dec(compver_string);
6490 SvREFCNT_dec(runver_string);
6492 SvREFCNT_dec(runver);
6494 Perl_croak_sv(aTHX_ xpt);
6499 Perl_my_strlcat(char *dst, const char *src, Size_t size)
6501 Size_t used, length, copy;
6504 length = strlen(src);
6505 if (size > 0 && used < size - 1) {
6506 copy = (length >= size - used) ? size - used - 1 : length;
6507 memcpy(dst + used, src, copy);
6508 dst[used + copy] = '\0';
6510 return used + length;
6516 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
6518 Size_t length, copy;
6520 length = strlen(src);
6522 copy = (length >= size) ? size - 1 : length;
6523 memcpy(dst, src, copy);
6530 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
6531 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
6532 long _ftol( double ); /* Defined by VC6 C libs. */
6533 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
6536 PERL_STATIC_INLINE bool
6537 S_gv_has_usable_name(pTHX_ GV *gv)
6541 && HvENAME(GvSTASH(gv))
6542 && (gvp = (GV **)hv_fetch(
6543 GvSTASH(gv), GvNAME(gv),
6544 GvNAMEUTF8(gv) ? -GvNAMELEN(gv) : GvNAMELEN(gv), 0
6550 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
6553 SV * const dbsv = GvSVn(PL_DBsub);
6554 const bool save_taint = PL_tainted;
6556 /* When we are called from pp_goto (svp is null),
6557 * we do not care about using dbsv to call CV;
6558 * it's for informational purposes only.
6561 PERL_ARGS_ASSERT_GET_DB_SUB;
6565 if (!PERLDB_SUB_NN) {
6569 gv_efullname3(dbsv, gv, NULL);
6571 else if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6572 || strEQ(GvNAME(gv), "END")
6573 || ( /* Could be imported, and old sub redefined. */
6574 (GvCV(gv) != cv || !S_gv_has_usable_name(aTHX_ gv))
6576 !( (SvTYPE(*svp) == SVt_PVGV)
6577 && (GvCV((const GV *)*svp) == cv)
6578 /* Use GV from the stack as a fallback. */
6579 && S_gv_has_usable_name(aTHX_ gv = (GV *)*svp)
6583 /* GV is potentially non-unique, or contain different CV. */
6584 SV * const tmp = newRV(MUTABLE_SV(cv));
6585 sv_setsv(dbsv, tmp);
6589 sv_sethek(dbsv, HvENAME_HEK(GvSTASH(gv)));
6590 sv_catpvs(dbsv, "::");
6592 dbsv, GvNAME(gv), GvNAMELEN(gv),
6593 GvNAMEUTF8(gv) ? SV_CATUTF8 : SV_CATBYTES
6598 const int type = SvTYPE(dbsv);
6599 if (type < SVt_PVIV && type != SVt_IV)
6600 sv_upgrade(dbsv, SVt_PVIV);
6601 (void)SvIOK_on(dbsv);
6602 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6604 TAINT_IF(save_taint);
6608 Perl_my_dirfd(pTHX_ DIR * dir) {
6610 /* Most dirfd implementations have problems when passed NULL. */
6615 #elif defined(HAS_DIR_DD_FD)
6618 Perl_die(aTHX_ PL_no_func, "dirfd");
6625 Perl_get_re_arg(pTHX_ SV *sv) {
6631 sv = MUTABLE_SV(SvRV(sv));
6632 if (SvTYPE(sv) == SVt_REGEXP)
6633 return (REGEXP*) sv;
6641 * c-indentation-style: bsd
6643 * indent-tabs-mode: t
6646 * ex: set ts=8 sts=4 sw=4 noet: