3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
4 * 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content.' --Gandalf to Pippin
15 * [p.598 of _The Lord of the Rings_, III/xi: "The PalantÃr"]
18 /* This file contains assorted utility routines.
19 * Which is a polite way of saying any stuff that people couldn't think of
20 * a better place for. Amongst other things, it includes the warning and
21 * dieing stuff, plus wrappers for malloc code.
25 #define PERL_IN_UTIL_C
31 # define SIG_ERR ((Sighandler_t) -1)
36 /* Missing protos on LynxOS */
41 # include <sys/wait.h>
46 # include <sys/select.h>
52 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
53 # define FD_CLOEXEC 1 /* NeXT needs this */
56 /* NOTE: Do not call the next three routines directly. Use the macros
57 * in handy.h, so that we can easily redefine everything to do tracking of
58 * allocated hunks back to the original New to track down any memory leaks.
59 * XXX This advice seems to be widely ignored :-( --AD August 1996.
66 /* Can't use PerlIO to write as it allocates memory */
67 PerlLIO_write(PerlIO_fileno(Perl_error_log),
68 PL_no_mem, strlen(PL_no_mem));
70 NORETURN_FUNCTION_END;
73 /* paranoid version of system's malloc() */
76 Perl_safesysmalloc(MEM_SIZE size)
82 PerlIO_printf(Perl_error_log,
83 "Allocation too large: %lx\n", size) FLUSH;
86 #endif /* HAS_64K_LIMIT */
87 #ifdef PERL_TRACK_MEMPOOL
92 Perl_croak_nocontext("panic: malloc");
94 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
95 PERL_ALLOC_CHECK(ptr);
96 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
98 #ifdef PERL_TRACK_MEMPOOL
99 struct perl_memory_debug_header *const header
100 = (struct perl_memory_debug_header *)ptr;
104 PoisonNew(((char *)ptr), size, char);
107 #ifdef PERL_TRACK_MEMPOOL
108 header->interpreter = aTHX;
109 /* Link us into the list. */
110 header->prev = &PL_memory_debug_header;
111 header->next = PL_memory_debug_header.next;
112 PL_memory_debug_header.next = header;
113 header->next->prev = header;
117 ptr = (Malloc_t)((char*)ptr+sTHX);
124 return write_no_mem();
129 /* paranoid version of system's realloc() */
132 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
136 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
137 Malloc_t PerlMem_realloc();
138 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
142 PerlIO_printf(Perl_error_log,
143 "Reallocation too large: %lx\n", size) FLUSH;
146 #endif /* HAS_64K_LIMIT */
153 return safesysmalloc(size);
154 #ifdef PERL_TRACK_MEMPOOL
155 where = (Malloc_t)((char*)where-sTHX);
158 struct perl_memory_debug_header *const header
159 = (struct perl_memory_debug_header *)where;
161 if (header->interpreter != aTHX) {
162 Perl_croak_nocontext("panic: realloc from wrong pool");
164 assert(header->next->prev == header);
165 assert(header->prev->next == header);
167 if (header->size > size) {
168 const MEM_SIZE freed_up = header->size - size;
169 char *start_of_freed = ((char *)where) + size;
170 PoisonFree(start_of_freed, freed_up, char);
178 Perl_croak_nocontext("panic: realloc");
180 ptr = (Malloc_t)PerlMem_realloc(where,size);
181 PERL_ALLOC_CHECK(ptr);
183 /* MUST do this fixup first, before doing ANYTHING else, as anything else
184 might allocate memory/free/move memory, and until we do the fixup, it
185 may well be chasing (and writing to) free memory. */
186 #ifdef PERL_TRACK_MEMPOOL
188 struct perl_memory_debug_header *const header
189 = (struct perl_memory_debug_header *)ptr;
192 if (header->size < size) {
193 const MEM_SIZE fresh = size - header->size;
194 char *start_of_fresh = ((char *)ptr) + size;
195 PoisonNew(start_of_fresh, fresh, char);
199 header->next->prev = header;
200 header->prev->next = header;
202 ptr = (Malloc_t)((char*)ptr+sTHX);
206 /* In particular, must do that fixup above before logging anything via
207 *printf(), as it can reallocate memory, which can cause SEGVs. */
209 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
210 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
219 return write_no_mem();
224 /* safe version of system's free() */
227 Perl_safesysfree(Malloc_t where)
229 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
234 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
236 #ifdef PERL_TRACK_MEMPOOL
237 where = (Malloc_t)((char*)where-sTHX);
239 struct perl_memory_debug_header *const header
240 = (struct perl_memory_debug_header *)where;
242 if (header->interpreter != aTHX) {
243 Perl_croak_nocontext("panic: free from wrong pool");
246 Perl_croak_nocontext("panic: duplicate free");
248 if (!(header->next) || header->next->prev != header
249 || header->prev->next != header) {
250 Perl_croak_nocontext("panic: bad free");
252 /* Unlink us from the chain. */
253 header->next->prev = header->prev;
254 header->prev->next = header->next;
256 PoisonNew(where, header->size, char);
258 /* Trigger the duplicate free warning. */
266 /* safe version of system's calloc() */
269 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
273 MEM_SIZE total_size = 0;
275 /* Even though calloc() for zero bytes is strange, be robust. */
276 if (size && (count <= MEM_SIZE_MAX / size))
277 total_size = size * count;
279 Perl_croak_nocontext("%s", PL_memory_wrap);
280 #ifdef PERL_TRACK_MEMPOOL
281 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
284 Perl_croak_nocontext("%s", PL_memory_wrap);
287 if (total_size > 0xffff) {
288 PerlIO_printf(Perl_error_log,
289 "Allocation too large: %lx\n", total_size) FLUSH;
292 #endif /* HAS_64K_LIMIT */
294 if ((long)size < 0 || (long)count < 0)
295 Perl_croak_nocontext("panic: calloc");
297 #ifdef PERL_TRACK_MEMPOOL
298 /* Have to use malloc() because we've added some space for our tracking
300 /* malloc(0) is non-portable. */
301 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
303 /* Use calloc() because it might save a memset() if the memory is fresh
304 and clean from the OS. */
306 ptr = (Malloc_t)PerlMem_calloc(count, size);
307 else /* calloc(0) is non-portable. */
308 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
310 PERL_ALLOC_CHECK(ptr);
311 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));
313 #ifdef PERL_TRACK_MEMPOOL
315 struct perl_memory_debug_header *const header
316 = (struct perl_memory_debug_header *)ptr;
318 memset((void*)ptr, 0, total_size);
319 header->interpreter = aTHX;
320 /* Link us into the list. */
321 header->prev = &PL_memory_debug_header;
322 header->next = PL_memory_debug_header.next;
323 PL_memory_debug_header.next = header;
324 header->next->prev = header;
326 header->size = total_size;
328 ptr = (Malloc_t)((char*)ptr+sTHX);
335 return write_no_mem();
338 /* These must be defined when not using Perl's malloc for binary
343 Malloc_t Perl_malloc (MEM_SIZE nbytes)
346 return (Malloc_t)PerlMem_malloc(nbytes);
349 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
352 return (Malloc_t)PerlMem_calloc(elements, size);
355 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
358 return (Malloc_t)PerlMem_realloc(where, nbytes);
361 Free_t Perl_mfree (Malloc_t where)
369 /* copy a string up to some (non-backslashed) delimiter, if any */
372 Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
376 PERL_ARGS_ASSERT_DELIMCPY;
378 for (tolen = 0; from < fromend; from++, tolen++) {
380 if (from[1] != delim) {
387 else if (*from == delim)
398 /* return ptr to little string in big string, NULL if not found */
399 /* This routine was donated by Corey Satten. */
402 Perl_instr(register const char *big, register const char *little)
406 PERL_ARGS_ASSERT_INSTR;
414 register const char *s, *x;
417 for (x=big,s=little; *s; /**/ ) {
428 return (char*)(big-1);
433 /* same as instr but allow embedded nulls */
436 Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
438 PERL_ARGS_ASSERT_NINSTR;
442 const char first = *little;
444 bigend -= lend - little++;
446 while (big <= bigend) {
447 if (*big++ == first) {
448 for (x=big,s=little; s < lend; x++,s++) {
452 return (char*)(big-1);
459 /* reverse of the above--find last substring */
462 Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
464 register const char *bigbeg;
465 register const I32 first = *little;
466 register const char * const littleend = lend;
468 PERL_ARGS_ASSERT_RNINSTR;
470 if (little >= littleend)
471 return (char*)bigend;
473 big = bigend - (littleend - little++);
474 while (big >= bigbeg) {
475 register const char *s, *x;
478 for (x=big+2,s=little; s < littleend; /**/ ) {
487 return (char*)(big+1);
492 /* As a space optimization, we do not compile tables for strings of length
493 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
494 special-cased in fbm_instr().
496 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
499 =head1 Miscellaneous Functions
501 =for apidoc fbm_compile
503 Analyses the string in order to make fast searches on it using fbm_instr()
504 -- the Boyer-Moore algorithm.
510 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
513 register const U8 *s;
519 PERL_ARGS_ASSERT_FBM_COMPILE;
521 if (flags & FBMcf_TAIL) {
522 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
523 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
524 if (mg && mg->mg_len >= 0)
527 s = (U8*)SvPV_force_mutable(sv, len);
528 if (len == 0) /* TAIL might be on a zero-length string. */
530 SvUPGRADE(sv, SVt_PVGV);
535 const unsigned char *sb;
536 const U8 mlen = (len>255) ? 255 : (U8)len;
539 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
541 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
542 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
543 memset((void*)table, mlen, 256);
545 sb = s - mlen + 1; /* first char (maybe) */
547 if (table[*s] == mlen)
552 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
554 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
556 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
557 for (i = 0; i < len; i++) {
558 if (PL_freq[s[i]] < frequency) {
560 frequency = PL_freq[s[i]];
563 BmFLAGS(sv) = (U8)flags;
564 BmRARE(sv) = s[rarest];
565 BmPREVIOUS(sv) = rarest;
566 BmUSEFUL(sv) = 100; /* Initial value */
567 if (flags & FBMcf_TAIL)
569 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
570 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
573 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
574 /* If SvTAIL is actually due to \Z or \z, this gives false positives
578 =for apidoc fbm_instr
580 Returns the location of the SV in the string delimited by C<str> and
581 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
582 does not have to be fbm_compiled, but the search will not be as fast
589 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
591 register unsigned char *s;
593 register const unsigned char *little
594 = (const unsigned char *)SvPV_const(littlestr,l);
595 register STRLEN littlelen = l;
596 register const I32 multiline = flags & FBMrf_MULTILINE;
598 PERL_ARGS_ASSERT_FBM_INSTR;
600 if ((STRLEN)(bigend - big) < littlelen) {
601 if ( SvTAIL(littlestr)
602 && ((STRLEN)(bigend - big) == littlelen - 1)
604 || (*big == *little &&
605 memEQ((char *)big, (char *)little, littlelen - 1))))
610 if (littlelen <= 2) { /* Special-cased */
612 if (littlelen == 1) {
613 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
614 /* Know that bigend != big. */
615 if (bigend[-1] == '\n')
616 return (char *)(bigend - 1);
617 return (char *) bigend;
625 if (SvTAIL(littlestr))
626 return (char *) bigend;
630 return (char*)big; /* Cannot be SvTAIL! */
633 if (SvTAIL(littlestr) && !multiline) {
634 if (bigend[-1] == '\n' && bigend[-2] == *little)
635 return (char*)bigend - 2;
636 if (bigend[-1] == *little)
637 return (char*)bigend - 1;
641 /* This should be better than FBM if c1 == c2, and almost
642 as good otherwise: maybe better since we do less indirection.
643 And we save a lot of memory by caching no table. */
644 const unsigned char c1 = little[0];
645 const unsigned char c2 = little[1];
650 while (s <= bigend) {
660 goto check_1char_anchor;
671 goto check_1char_anchor;
674 while (s <= bigend) {
679 goto check_1char_anchor;
688 check_1char_anchor: /* One char and anchor! */
689 if (SvTAIL(littlestr) && (*bigend == *little))
690 return (char *)bigend; /* bigend is already decremented. */
693 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
694 s = bigend - littlelen;
695 if (s >= big && bigend[-1] == '\n' && *s == *little
696 /* Automatically of length > 2 */
697 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
699 return (char*)s; /* how sweet it is */
702 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
704 return (char*)s + 1; /* how sweet it is */
708 if (!SvVALID(littlestr)) {
709 char * const b = ninstr((char*)big,(char*)bigend,
710 (char*)little, (char*)little + littlelen);
712 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
713 /* Chop \n from littlestr: */
714 s = bigend - littlelen + 1;
716 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
726 if (littlelen > (STRLEN)(bigend - big))
730 register const unsigned char * const table
731 = little + littlelen + PERL_FBM_TABLE_OFFSET;
732 register const unsigned char *oldlittle;
734 --littlelen; /* Last char found by table lookup */
737 little += littlelen; /* last char */
743 if ((tmp = table[*s])) {
744 if ((s += tmp) < bigend)
748 else { /* less expensive than calling strncmp() */
749 register unsigned char * const olds = s;
754 if (*--s == *--little)
756 s = olds + 1; /* here we pay the price for failure */
758 if (s < bigend) /* fake up continue to outer loop */
767 && (BmFLAGS(littlestr) & FBMcf_TAIL)
768 && memEQ((char *)(bigend - littlelen),
769 (char *)(oldlittle - littlelen), littlelen) )
770 return (char*)bigend - littlelen;
775 /* start_shift, end_shift are positive quantities which give offsets
776 of ends of some substring of bigstr.
777 If "last" we want the last occurrence.
778 old_posp is the way of communication between consequent calls if
779 the next call needs to find the .
780 The initial *old_posp should be -1.
782 Note that we take into account SvTAIL, so one can get extra
783 optimizations if _ALL flag is set.
786 /* If SvTAIL is actually due to \Z or \z, this gives false positives
787 if PL_multiline. In fact if !PL_multiline the authoritative answer
788 is not supported yet. */
791 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
794 register const unsigned char *big;
796 register I32 previous;
798 register const unsigned char *little;
799 register I32 stop_pos;
800 register const unsigned char *littleend;
803 PERL_ARGS_ASSERT_SCREAMINSTR;
805 assert(SvTYPE(littlestr) == SVt_PVGV);
806 assert(SvVALID(littlestr));
809 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
810 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
812 if ( BmRARE(littlestr) == '\n'
813 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
814 little = (const unsigned char *)(SvPVX_const(littlestr));
815 littleend = little + SvCUR(littlestr);
822 little = (const unsigned char *)(SvPVX_const(littlestr));
823 littleend = little + SvCUR(littlestr);
825 /* The value of pos we can start at: */
826 previous = BmPREVIOUS(littlestr);
827 big = (const unsigned char *)(SvPVX_const(bigstr));
828 /* The value of pos we can stop at: */
829 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
830 if (previous + start_shift > stop_pos) {
832 stop_pos does not include SvTAIL in the count, so this check is incorrect
833 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
836 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
841 while (pos < previous + start_shift) {
842 if (!(pos += PL_screamnext[pos]))
847 register const unsigned char *s, *x;
848 if (pos >= stop_pos) break;
849 if (big[pos] != first)
851 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
857 if (s == littleend) {
859 if (!last) return (char *)(big+pos);
862 } while ( pos += PL_screamnext[pos] );
864 return (char *)(big+(*old_posp));
866 if (!SvTAIL(littlestr) || (end_shift > 0))
868 /* Ignore the trailing "\n". This code is not microoptimized */
869 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
870 stop_pos = littleend - little; /* Actual littlestr len */
875 && ((stop_pos == 1) ||
876 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
882 Perl_ibcmp(const char *s1, const char *s2, register I32 len)
884 register const U8 *a = (const U8 *)s1;
885 register const U8 *b = (const U8 *)s2;
887 PERL_ARGS_ASSERT_IBCMP;
890 if (*a != *b && *a != PL_fold[*b])
898 Perl_ibcmp_locale(const char *s1, const char *s2, register I32 len)
901 register const U8 *a = (const U8 *)s1;
902 register const U8 *b = (const U8 *)s2;
904 PERL_ARGS_ASSERT_IBCMP_LOCALE;
907 if (*a != *b && *a != PL_fold_locale[*b])
914 /* copy a string to a safe spot */
917 =head1 Memory Management
921 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
922 string which is a duplicate of C<pv>. The size of the string is
923 determined by C<strlen()>. The memory allocated for the new string can
924 be freed with the C<Safefree()> function.
930 Perl_savepv(pTHX_ const char *pv)
937 const STRLEN pvlen = strlen(pv)+1;
938 Newx(newaddr, pvlen, char);
939 return (char*)memcpy(newaddr, pv, pvlen);
943 /* same thing but with a known length */
948 Perl's version of what C<strndup()> would be if it existed. Returns a
949 pointer to a newly allocated string which is a duplicate of the first
950 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
951 the new string can be freed with the C<Safefree()> function.
957 Perl_savepvn(pTHX_ const char *pv, register I32 len)
959 register char *newaddr;
962 Newx(newaddr,len+1,char);
963 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
965 /* might not be null terminated */
967 return (char *) CopyD(pv,newaddr,len,char);
970 return (char *) ZeroD(newaddr,len+1,char);
975 =for apidoc savesharedpv
977 A version of C<savepv()> which allocates the duplicate string in memory
978 which is shared between threads.
983 Perl_savesharedpv(pTHX_ const char *pv)
985 register char *newaddr;
990 pvlen = strlen(pv)+1;
991 newaddr = (char*)PerlMemShared_malloc(pvlen);
993 return write_no_mem();
995 return (char*)memcpy(newaddr, pv, pvlen);
999 =for apidoc savesharedpvn
1001 A version of C<savepvn()> which allocates the duplicate string in memory
1002 which is shared between threads. (With the specific difference that a NULL
1003 pointer is not acceptable)
1008 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1010 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1012 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1015 return write_no_mem();
1017 newaddr[len] = '\0';
1018 return (char*)memcpy(newaddr, pv, len);
1022 =for apidoc savesvpv
1024 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1025 the passed in SV using C<SvPV()>
1031 Perl_savesvpv(pTHX_ SV *sv)
1034 const char * const pv = SvPV_const(sv, len);
1035 register char *newaddr;
1037 PERL_ARGS_ASSERT_SAVESVPV;
1040 Newx(newaddr,len,char);
1041 return (char *) CopyD(pv,newaddr,len,char);
1045 /* the SV for Perl_form() and mess() is not kept in an arena */
1055 return newSVpvs_flags("", SVs_TEMP);
1060 /* Create as PVMG now, to avoid any upgrading later */
1062 Newxz(any, 1, XPVMG);
1063 SvFLAGS(sv) = SVt_PVMG;
1064 SvANY(sv) = (void*)any;
1066 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1071 #if defined(PERL_IMPLICIT_CONTEXT)
1073 Perl_form_nocontext(const char* pat, ...)
1078 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1079 va_start(args, pat);
1080 retval = vform(pat, &args);
1084 #endif /* PERL_IMPLICIT_CONTEXT */
1087 =head1 Miscellaneous Functions
1090 Takes a sprintf-style format pattern and conventional
1091 (non-SV) arguments and returns the formatted string.
1093 (char *) Perl_form(pTHX_ const char* pat, ...)
1095 can be used any place a string (char *) is required:
1097 char * s = Perl_form("%d.%d",major,minor);
1099 Uses a single private buffer so if you want to format several strings you
1100 must explicitly copy the earlier strings away (and free the copies when you
1107 Perl_form(pTHX_ const char* pat, ...)
1111 PERL_ARGS_ASSERT_FORM;
1112 va_start(args, pat);
1113 retval = vform(pat, &args);
1119 Perl_vform(pTHX_ const char *pat, va_list *args)
1121 SV * const sv = mess_alloc();
1122 PERL_ARGS_ASSERT_VFORM;
1123 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1127 #if defined(PERL_IMPLICIT_CONTEXT)
1129 Perl_mess_nocontext(const char *pat, ...)
1134 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1135 va_start(args, pat);
1136 retval = vmess(pat, &args);
1140 #endif /* PERL_IMPLICIT_CONTEXT */
1143 Perl_mess(pTHX_ const char *pat, ...)
1147 PERL_ARGS_ASSERT_MESS;
1148 va_start(args, pat);
1149 retval = vmess(pat, &args);
1155 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1158 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1160 PERL_ARGS_ASSERT_CLOSEST_COP;
1162 if (!o || o == PL_op)
1165 if (o->op_flags & OPf_KIDS) {
1167 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1170 /* If the OP_NEXTSTATE has been optimised away we can still use it
1171 * the get the file and line number. */
1173 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1174 cop = (const COP *)kid;
1176 /* Keep searching, and return when we've found something. */
1178 new_cop = closest_cop(cop, kid);
1184 /* Nothing found. */
1190 Perl_vmess(pTHX_ const char *pat, va_list *args)
1193 SV * const sv = mess_alloc();
1195 PERL_ARGS_ASSERT_VMESS;
1197 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1198 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1200 * Try and find the file and line for PL_op. This will usually be
1201 * PL_curcop, but it might be a cop that has been optimised away. We
1202 * can try to find such a cop by searching through the optree starting
1203 * from the sibling of PL_curcop.
1206 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1211 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1212 OutCopFILE(cop), (IV)CopLINE(cop));
1213 /* Seems that GvIO() can be untrustworthy during global destruction. */
1214 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1215 && IoLINES(GvIOp(PL_last_in_gv)))
1217 const bool line_mode = (RsSIMPLE(PL_rs) &&
1218 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1219 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1220 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1221 line_mode ? "line" : "chunk",
1222 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1225 sv_catpvs(sv, " during global destruction");
1226 sv_catpvs(sv, ".\n");
1232 Perl_write_to_stderr(pTHX_ SV* msv)
1238 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1240 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1241 && (io = GvIO(PL_stderrgv))
1242 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1249 SAVESPTR(PL_stderrgv);
1252 PUSHSTACKi(PERLSI_MAGIC);
1256 PUSHs(SvTIED_obj(MUTABLE_SV(io), mg));
1259 call_method("PRINT", G_SCALAR);
1267 /* SFIO can really mess with your errno */
1270 PerlIO * const serr = Perl_error_log;
1272 const char* message = SvPVx_const(msv, msglen);
1274 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1275 (void)PerlIO_flush(serr);
1282 /* Common code used by vcroak, vdie, vwarn and vwarner */
1285 S_vdie_common(pTHX_ SV *message, bool warn)
1291 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1292 /* sv_2cv might call Perl_croak() or Perl_warner() */
1293 SV * const oldhook = *hook;
1300 cv = sv_2cv(oldhook, &stash, &gv, 0);
1302 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1312 if (warn || message) {
1313 msg = newSVsv(message);
1321 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1325 call_sv(MUTABLE_SV(cv), G_DISCARD);
1334 S_vdie_croak_common(pTHX_ const char* pat, va_list* args)
1340 SV * const msv = vmess(pat, args);
1341 if (PL_errors && SvCUR(PL_errors)) {
1342 sv_catsv(PL_errors, msv);
1343 message = sv_mortalcopy(PL_errors);
1344 SvCUR_set(PL_errors, 0);
1354 S_vdie_common(aTHX_ message, FALSE);
1360 S_vdie(pTHX_ const char* pat, va_list *args)
1365 message = vdie_croak_common(pat, args);
1372 #if defined(PERL_IMPLICIT_CONTEXT)
1374 Perl_die_nocontext(const char* pat, ...)
1379 va_start(args, pat);
1380 o = vdie(pat, &args);
1384 #endif /* PERL_IMPLICIT_CONTEXT */
1387 Perl_die(pTHX_ const char* pat, ...)
1391 va_start(args, pat);
1392 o = vdie(pat, &args);
1398 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1403 msv = S_vdie_croak_common(aTHX_ pat, args);
1408 #if defined(PERL_IMPLICIT_CONTEXT)
1410 Perl_croak_nocontext(const char *pat, ...)
1414 va_start(args, pat);
1419 #endif /* PERL_IMPLICIT_CONTEXT */
1422 =head1 Warning and Dieing
1426 This is the XSUB-writer's interface to Perl's C<die> function.
1427 Normally call this function the same way you call the C C<printf>
1428 function. Calling C<croak> returns control directly to Perl,
1429 sidestepping the normal C order of execution. See C<warn>.
1431 If you want to throw an exception object, assign the object to
1432 C<$@> and then pass C<NULL> to croak():
1434 errsv = get_sv("@", GV_ADD);
1435 sv_setsv(errsv, exception_object);
1442 Perl_croak(pTHX_ const char *pat, ...)
1445 va_start(args, pat);
1452 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1455 SV * const msv = vmess(pat, args);
1457 PERL_ARGS_ASSERT_VWARN;
1460 if (vdie_common(msv, TRUE))
1464 write_to_stderr(msv);
1467 #if defined(PERL_IMPLICIT_CONTEXT)
1469 Perl_warn_nocontext(const char *pat, ...)
1473 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1474 va_start(args, pat);
1478 #endif /* PERL_IMPLICIT_CONTEXT */
1483 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1484 function the same way you call the C C<printf> function. See C<croak>.
1490 Perl_warn(pTHX_ const char *pat, ...)
1493 PERL_ARGS_ASSERT_WARN;
1494 va_start(args, pat);
1499 #if defined(PERL_IMPLICIT_CONTEXT)
1501 Perl_warner_nocontext(U32 err, const char *pat, ...)
1505 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1506 va_start(args, pat);
1507 vwarner(err, pat, &args);
1510 #endif /* PERL_IMPLICIT_CONTEXT */
1513 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1515 PERL_ARGS_ASSERT_CK_WARNER_D;
1517 if (Perl_ckwarn_d(aTHX_ err)) {
1519 va_start(args, pat);
1520 vwarner(err, pat, &args);
1526 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1528 PERL_ARGS_ASSERT_CK_WARNER;
1530 if (Perl_ckwarn(aTHX_ err)) {
1532 va_start(args, pat);
1533 vwarner(err, pat, &args);
1539 Perl_warner(pTHX_ U32 err, const char* pat,...)
1542 PERL_ARGS_ASSERT_WARNER;
1543 va_start(args, pat);
1544 vwarner(err, pat, &args);
1549 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1552 PERL_ARGS_ASSERT_VWARNER;
1553 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1554 SV * const msv = vmess(pat, args);
1558 S_vdie_common(aTHX_ msv, FALSE);
1563 Perl_vwarn(aTHX_ pat, args);
1567 /* implements the ckWARN? macros */
1570 Perl_ckwarn(pTHX_ U32 w)
1573 /* If lexical warnings have not been set, use $^W. */
1575 return PL_dowarn & G_WARN_ON;
1577 return ckwarn_common(w);
1580 /* implements the ckWARN?_d macro */
1583 Perl_ckwarn_d(pTHX_ U32 w)
1586 /* If lexical warnings have not been set then default classes warn. */
1590 return ckwarn_common(w);
1594 S_ckwarn_common(pTHX_ U32 w)
1596 if (PL_curcop->cop_warnings == pWARN_ALL)
1599 if (PL_curcop->cop_warnings == pWARN_NONE)
1602 /* Check the assumption that at least the first slot is non-zero. */
1603 assert(unpackWARN1(w));
1605 /* Check the assumption that it is valid to stop as soon as a zero slot is
1607 if (!unpackWARN2(w)) {
1608 assert(!unpackWARN3(w));
1609 assert(!unpackWARN4(w));
1610 } else if (!unpackWARN3(w)) {
1611 assert(!unpackWARN4(w));
1614 /* Right, dealt with all the special cases, which are implemented as non-
1615 pointers, so there is a pointer to a real warnings mask. */
1617 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1619 } while (w >>= WARNshift);
1624 /* Set buffer=NULL to get a new one. */
1626 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1628 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1629 PERL_UNUSED_CONTEXT;
1630 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1633 (specialWARN(buffer) ?
1634 PerlMemShared_malloc(len_wanted) :
1635 PerlMemShared_realloc(buffer, len_wanted));
1637 Copy(bits, (buffer + 1), size, char);
1641 /* since we've already done strlen() for both nam and val
1642 * we can use that info to make things faster than
1643 * sprintf(s, "%s=%s", nam, val)
1645 #define my_setenv_format(s, nam, nlen, val, vlen) \
1646 Copy(nam, s, nlen, char); \
1648 Copy(val, s+(nlen+1), vlen, char); \
1649 *(s+(nlen+1+vlen)) = '\0'
1651 #ifdef USE_ENVIRON_ARRAY
1652 /* VMS' my_setenv() is in vms.c */
1653 #if !defined(WIN32) && !defined(NETWARE)
1655 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1659 /* only parent thread can modify process environment */
1660 if (PL_curinterp == aTHX)
1663 #ifndef PERL_USE_SAFE_PUTENV
1664 if (!PL_use_safe_putenv) {
1665 /* most putenv()s leak, so we manipulate environ directly */
1667 register const I32 len = strlen(nam);
1670 /* where does it go? */
1671 for (i = 0; environ[i]; i++) {
1672 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1676 if (environ == PL_origenviron) { /* need we copy environment? */
1682 while (environ[max])
1684 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1685 for (j=0; j<max; j++) { /* copy environment */
1686 const int len = strlen(environ[j]);
1687 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1688 Copy(environ[j], tmpenv[j], len+1, char);
1691 environ = tmpenv; /* tell exec where it is now */
1694 safesysfree(environ[i]);
1695 while (environ[i]) {
1696 environ[i] = environ[i+1];
1701 if (!environ[i]) { /* does not exist yet */
1702 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1703 environ[i+1] = NULL; /* make sure it's null terminated */
1706 safesysfree(environ[i]);
1710 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1711 /* all that work just for this */
1712 my_setenv_format(environ[i], nam, nlen, val, vlen);
1715 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1716 # if defined(HAS_UNSETENV)
1718 (void)unsetenv(nam);
1720 (void)setenv(nam, val, 1);
1722 # else /* ! HAS_UNSETENV */
1723 (void)setenv(nam, val, 1);
1724 # endif /* HAS_UNSETENV */
1726 # if defined(HAS_UNSETENV)
1728 (void)unsetenv(nam);
1730 const int nlen = strlen(nam);
1731 const int vlen = strlen(val);
1732 char * const new_env =
1733 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1734 my_setenv_format(new_env, nam, nlen, val, vlen);
1735 (void)putenv(new_env);
1737 # else /* ! HAS_UNSETENV */
1739 const int nlen = strlen(nam);
1745 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1746 /* all that work just for this */
1747 my_setenv_format(new_env, nam, nlen, val, vlen);
1748 (void)putenv(new_env);
1749 # endif /* HAS_UNSETENV */
1750 # endif /* __CYGWIN__ */
1751 #ifndef PERL_USE_SAFE_PUTENV
1757 #else /* WIN32 || NETWARE */
1760 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1763 register char *envstr;
1764 const int nlen = strlen(nam);
1771 Newx(envstr, nlen+vlen+2, char);
1772 my_setenv_format(envstr, nam, nlen, val, vlen);
1773 (void)PerlEnv_putenv(envstr);
1777 #endif /* WIN32 || NETWARE */
1779 #endif /* !VMS && !EPOC*/
1781 #ifdef UNLINK_ALL_VERSIONS
1783 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1787 PERL_ARGS_ASSERT_UNLNK;
1789 while (PerlLIO_unlink(f) >= 0)
1791 return retries ? 0 : -1;
1795 /* this is a drop-in replacement for bcopy() */
1796 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1798 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1800 char * const retval = to;
1802 PERL_ARGS_ASSERT_MY_BCOPY;
1804 if (from - to >= 0) {
1812 *(--to) = *(--from);
1818 /* this is a drop-in replacement for memset() */
1821 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1823 char * const retval = loc;
1825 PERL_ARGS_ASSERT_MY_MEMSET;
1833 /* this is a drop-in replacement for bzero() */
1834 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1836 Perl_my_bzero(register char *loc, register I32 len)
1838 char * const retval = loc;
1840 PERL_ARGS_ASSERT_MY_BZERO;
1848 /* this is a drop-in replacement for memcmp() */
1849 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1851 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1853 register const U8 *a = (const U8 *)s1;
1854 register const U8 *b = (const U8 *)s2;
1857 PERL_ARGS_ASSERT_MY_MEMCMP;
1860 if ((tmp = *a++ - *b++))
1865 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1868 /* This vsprintf replacement should generally never get used, since
1869 vsprintf was available in both System V and BSD 2.11. (There may
1870 be some cross-compilation or embedded set-ups where it is needed,
1873 If you encounter a problem in this function, it's probably a symptom
1874 that Configure failed to detect your system's vprintf() function.
1875 See the section on "item vsprintf" in the INSTALL file.
1877 This version may compile on systems with BSD-ish <stdio.h>,
1878 but probably won't on others.
1881 #ifdef USE_CHAR_VSPRINTF
1886 vsprintf(char *dest, const char *pat, void *args)
1890 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1891 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1892 FILE_cnt(&fakebuf) = 32767;
1894 /* These probably won't compile -- If you really need
1895 this, you'll have to figure out some other method. */
1896 fakebuf._ptr = dest;
1897 fakebuf._cnt = 32767;
1902 fakebuf._flag = _IOWRT|_IOSTRG;
1903 _doprnt(pat, args, &fakebuf); /* what a kludge */
1904 #if defined(STDIO_PTR_LVALUE)
1905 *(FILE_ptr(&fakebuf)++) = '\0';
1907 /* PerlIO has probably #defined away fputc, but we want it here. */
1909 # undef fputc /* XXX Should really restore it later */
1911 (void)fputc('\0', &fakebuf);
1913 #ifdef USE_CHAR_VSPRINTF
1916 return 0; /* perl doesn't use return value */
1920 #endif /* HAS_VPRINTF */
1923 #if BYTEORDER != 0x4321
1925 Perl_my_swap(pTHX_ short s)
1927 #if (BYTEORDER & 1) == 0
1930 result = ((s & 255) << 8) + ((s >> 8) & 255);
1938 Perl_my_htonl(pTHX_ long l)
1942 char c[sizeof(long)];
1945 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1946 #if BYTEORDER == 0x12345678
1949 u.c[0] = (l >> 24) & 255;
1950 u.c[1] = (l >> 16) & 255;
1951 u.c[2] = (l >> 8) & 255;
1955 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1956 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1961 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1962 u.c[o & 0xf] = (l >> s) & 255;
1970 Perl_my_ntohl(pTHX_ long l)
1974 char c[sizeof(long)];
1977 #if BYTEORDER == 0x1234
1978 u.c[0] = (l >> 24) & 255;
1979 u.c[1] = (l >> 16) & 255;
1980 u.c[2] = (l >> 8) & 255;
1984 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1985 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1992 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1993 l |= (u.c[o & 0xf] & 255) << s;
2000 #endif /* BYTEORDER != 0x4321 */
2004 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2005 * If these functions are defined,
2006 * the BYTEORDER is neither 0x1234 nor 0x4321.
2007 * However, this is not assumed.
2011 #define HTOLE(name,type) \
2013 name (register type n) \
2017 char c[sizeof(type)]; \
2020 register U32 s = 0; \
2021 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2022 u.c[i] = (n >> s) & 0xFF; \
2027 #define LETOH(name,type) \
2029 name (register type n) \
2033 char c[sizeof(type)]; \
2036 register U32 s = 0; \
2039 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2040 n |= ((type)(u.c[i] & 0xFF)) << s; \
2046 * Big-endian byte order functions.
2049 #define HTOBE(name,type) \
2051 name (register type n) \
2055 char c[sizeof(type)]; \
2058 register U32 s = 8*(sizeof(u.c)-1); \
2059 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2060 u.c[i] = (n >> s) & 0xFF; \
2065 #define BETOH(name,type) \
2067 name (register type n) \
2071 char c[sizeof(type)]; \
2074 register U32 s = 8*(sizeof(u.c)-1); \
2077 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2078 n |= ((type)(u.c[i] & 0xFF)) << s; \
2084 * If we just can't do it...
2087 #define NOT_AVAIL(name,type) \
2089 name (register type n) \
2091 Perl_croak_nocontext(#name "() not available"); \
2092 return n; /* not reached */ \
2096 #if defined(HAS_HTOVS) && !defined(htovs)
2099 #if defined(HAS_HTOVL) && !defined(htovl)
2102 #if defined(HAS_VTOHS) && !defined(vtohs)
2105 #if defined(HAS_VTOHL) && !defined(vtohl)
2109 #ifdef PERL_NEED_MY_HTOLE16
2111 HTOLE(Perl_my_htole16,U16)
2113 NOT_AVAIL(Perl_my_htole16,U16)
2116 #ifdef PERL_NEED_MY_LETOH16
2118 LETOH(Perl_my_letoh16,U16)
2120 NOT_AVAIL(Perl_my_letoh16,U16)
2123 #ifdef PERL_NEED_MY_HTOBE16
2125 HTOBE(Perl_my_htobe16,U16)
2127 NOT_AVAIL(Perl_my_htobe16,U16)
2130 #ifdef PERL_NEED_MY_BETOH16
2132 BETOH(Perl_my_betoh16,U16)
2134 NOT_AVAIL(Perl_my_betoh16,U16)
2138 #ifdef PERL_NEED_MY_HTOLE32
2140 HTOLE(Perl_my_htole32,U32)
2142 NOT_AVAIL(Perl_my_htole32,U32)
2145 #ifdef PERL_NEED_MY_LETOH32
2147 LETOH(Perl_my_letoh32,U32)
2149 NOT_AVAIL(Perl_my_letoh32,U32)
2152 #ifdef PERL_NEED_MY_HTOBE32
2154 HTOBE(Perl_my_htobe32,U32)
2156 NOT_AVAIL(Perl_my_htobe32,U32)
2159 #ifdef PERL_NEED_MY_BETOH32
2161 BETOH(Perl_my_betoh32,U32)
2163 NOT_AVAIL(Perl_my_betoh32,U32)
2167 #ifdef PERL_NEED_MY_HTOLE64
2169 HTOLE(Perl_my_htole64,U64)
2171 NOT_AVAIL(Perl_my_htole64,U64)
2174 #ifdef PERL_NEED_MY_LETOH64
2176 LETOH(Perl_my_letoh64,U64)
2178 NOT_AVAIL(Perl_my_letoh64,U64)
2181 #ifdef PERL_NEED_MY_HTOBE64
2183 HTOBE(Perl_my_htobe64,U64)
2185 NOT_AVAIL(Perl_my_htobe64,U64)
2188 #ifdef PERL_NEED_MY_BETOH64
2190 BETOH(Perl_my_betoh64,U64)
2192 NOT_AVAIL(Perl_my_betoh64,U64)
2196 #ifdef PERL_NEED_MY_HTOLES
2197 HTOLE(Perl_my_htoles,short)
2199 #ifdef PERL_NEED_MY_LETOHS
2200 LETOH(Perl_my_letohs,short)
2202 #ifdef PERL_NEED_MY_HTOBES
2203 HTOBE(Perl_my_htobes,short)
2205 #ifdef PERL_NEED_MY_BETOHS
2206 BETOH(Perl_my_betohs,short)
2209 #ifdef PERL_NEED_MY_HTOLEI
2210 HTOLE(Perl_my_htolei,int)
2212 #ifdef PERL_NEED_MY_LETOHI
2213 LETOH(Perl_my_letohi,int)
2215 #ifdef PERL_NEED_MY_HTOBEI
2216 HTOBE(Perl_my_htobei,int)
2218 #ifdef PERL_NEED_MY_BETOHI
2219 BETOH(Perl_my_betohi,int)
2222 #ifdef PERL_NEED_MY_HTOLEL
2223 HTOLE(Perl_my_htolel,long)
2225 #ifdef PERL_NEED_MY_LETOHL
2226 LETOH(Perl_my_letohl,long)
2228 #ifdef PERL_NEED_MY_HTOBEL
2229 HTOBE(Perl_my_htobel,long)
2231 #ifdef PERL_NEED_MY_BETOHL
2232 BETOH(Perl_my_betohl,long)
2236 Perl_my_swabn(void *ptr, int n)
2238 register char *s = (char *)ptr;
2239 register char *e = s + (n-1);
2242 PERL_ARGS_ASSERT_MY_SWABN;
2244 for (n /= 2; n > 0; s++, e--, n--) {
2252 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2254 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2257 register I32 This, that;
2263 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2265 PERL_FLUSHALL_FOR_CHILD;
2266 This = (*mode == 'w');
2270 taint_proper("Insecure %s%s", "EXEC");
2272 if (PerlProc_pipe(p) < 0)
2274 /* Try for another pipe pair for error return */
2275 if (PerlProc_pipe(pp) >= 0)
2277 while ((pid = PerlProc_fork()) < 0) {
2278 if (errno != EAGAIN) {
2279 PerlLIO_close(p[This]);
2280 PerlLIO_close(p[that]);
2282 PerlLIO_close(pp[0]);
2283 PerlLIO_close(pp[1]);
2287 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2296 /* Close parent's end of error status pipe (if any) */
2298 PerlLIO_close(pp[0]);
2299 #if defined(HAS_FCNTL) && defined(F_SETFD)
2300 /* Close error pipe automatically if exec works */
2301 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2304 /* Now dup our end of _the_ pipe to right position */
2305 if (p[THIS] != (*mode == 'r')) {
2306 PerlLIO_dup2(p[THIS], *mode == 'r');
2307 PerlLIO_close(p[THIS]);
2308 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2309 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2312 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2313 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2314 /* No automatic close - do it by hand */
2321 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2327 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2333 do_execfree(); /* free any memory malloced by child on fork */
2335 PerlLIO_close(pp[1]);
2336 /* Keep the lower of the two fd numbers */
2337 if (p[that] < p[This]) {
2338 PerlLIO_dup2(p[This], p[that]);
2339 PerlLIO_close(p[This]);
2343 PerlLIO_close(p[that]); /* close child's end of pipe */
2345 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2346 SvUPGRADE(sv,SVt_IV);
2348 PL_forkprocess = pid;
2349 /* If we managed to get status pipe check for exec fail */
2350 if (did_pipes && pid > 0) {
2355 while (n < sizeof(int)) {
2356 n1 = PerlLIO_read(pp[0],
2357 (void*)(((char*)&errkid)+n),
2363 PerlLIO_close(pp[0]);
2365 if (n) { /* Error */
2367 PerlLIO_close(p[This]);
2368 if (n != sizeof(int))
2369 Perl_croak(aTHX_ "panic: kid popen errno read");
2371 pid2 = wait4pid(pid, &status, 0);
2372 } while (pid2 == -1 && errno == EINTR);
2373 errno = errkid; /* Propagate errno from kid */
2378 PerlLIO_close(pp[0]);
2379 return PerlIO_fdopen(p[This], mode);
2381 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2382 return my_syspopen4(aTHX_ NULL, mode, n, args);
2384 Perl_croak(aTHX_ "List form of piped open not implemented");
2385 return (PerlIO *) NULL;
2390 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2391 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2393 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2397 register I32 This, that;
2400 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2404 PERL_ARGS_ASSERT_MY_POPEN;
2406 PERL_FLUSHALL_FOR_CHILD;
2409 return my_syspopen(aTHX_ cmd,mode);
2412 This = (*mode == 'w');
2414 if (doexec && PL_tainting) {
2416 taint_proper("Insecure %s%s", "EXEC");
2418 if (PerlProc_pipe(p) < 0)
2420 if (doexec && PerlProc_pipe(pp) >= 0)
2422 while ((pid = PerlProc_fork()) < 0) {
2423 if (errno != EAGAIN) {
2424 PerlLIO_close(p[This]);
2425 PerlLIO_close(p[that]);
2427 PerlLIO_close(pp[0]);
2428 PerlLIO_close(pp[1]);
2431 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2434 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2445 PerlLIO_close(pp[0]);
2446 #if defined(HAS_FCNTL) && defined(F_SETFD)
2447 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2450 if (p[THIS] != (*mode == 'r')) {
2451 PerlLIO_dup2(p[THIS], *mode == 'r');
2452 PerlLIO_close(p[THIS]);
2453 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2454 PerlLIO_close(p[THAT]);
2457 PerlLIO_close(p[THAT]);
2460 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2467 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2472 /* may or may not use the shell */
2473 do_exec3(cmd, pp[1], did_pipes);
2476 #endif /* defined OS2 */
2478 #ifdef PERLIO_USING_CRLF
2479 /* Since we circumvent IO layers when we manipulate low-level
2480 filedescriptors directly, need to manually switch to the
2481 default, binary, low-level mode; see PerlIOBuf_open(). */
2482 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2485 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2486 SvREADONLY_off(GvSV(tmpgv));
2487 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2488 SvREADONLY_on(GvSV(tmpgv));
2490 #ifdef THREADS_HAVE_PIDS
2491 PL_ppid = (IV)getppid();
2494 #ifdef PERL_USES_PL_PIDSTATUS
2495 hv_clear(PL_pidstatus); /* we have no children */
2501 do_execfree(); /* free any memory malloced by child on vfork */
2503 PerlLIO_close(pp[1]);
2504 if (p[that] < p[This]) {
2505 PerlLIO_dup2(p[This], p[that]);
2506 PerlLIO_close(p[This]);
2510 PerlLIO_close(p[that]);
2512 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2513 SvUPGRADE(sv,SVt_IV);
2515 PL_forkprocess = pid;
2516 if (did_pipes && pid > 0) {
2521 while (n < sizeof(int)) {
2522 n1 = PerlLIO_read(pp[0],
2523 (void*)(((char*)&errkid)+n),
2529 PerlLIO_close(pp[0]);
2531 if (n) { /* Error */
2533 PerlLIO_close(p[This]);
2534 if (n != sizeof(int))
2535 Perl_croak(aTHX_ "panic: kid popen errno read");
2537 pid2 = wait4pid(pid, &status, 0);
2538 } while (pid2 == -1 && errno == EINTR);
2539 errno = errkid; /* Propagate errno from kid */
2544 PerlLIO_close(pp[0]);
2545 return PerlIO_fdopen(p[This], mode);
2548 #if defined(atarist) || defined(EPOC)
2551 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2553 PERL_ARGS_ASSERT_MY_POPEN;
2554 PERL_FLUSHALL_FOR_CHILD;
2555 /* Call system's popen() to get a FILE *, then import it.
2556 used 0 for 2nd parameter to PerlIO_importFILE;
2559 return PerlIO_importFILE(popen(cmd, mode), 0);
2563 FILE *djgpp_popen();
2565 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2567 PERL_FLUSHALL_FOR_CHILD;
2568 /* Call system's popen() to get a FILE *, then import it.
2569 used 0 for 2nd parameter to PerlIO_importFILE;
2572 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2575 #if defined(__LIBCATAMOUNT__)
2577 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2585 #endif /* !DOSISH */
2587 /* this is called in parent before the fork() */
2589 Perl_atfork_lock(void)
2592 #if defined(USE_ITHREADS)
2593 /* locks must be held in locking order (if any) */
2595 MUTEX_LOCK(&PL_malloc_mutex);
2601 /* this is called in both parent and child after the fork() */
2603 Perl_atfork_unlock(void)
2606 #if defined(USE_ITHREADS)
2607 /* locks must be released in same order as in atfork_lock() */
2609 MUTEX_UNLOCK(&PL_malloc_mutex);
2618 #if defined(HAS_FORK)
2620 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2625 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2626 * handlers elsewhere in the code */
2631 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2632 Perl_croak_nocontext("fork() not available");
2634 #endif /* HAS_FORK */
2639 Perl_dump_fds(pTHX_ const char *const s)
2644 PERL_ARGS_ASSERT_DUMP_FDS;
2646 PerlIO_printf(Perl_debug_log,"%s", s);
2647 for (fd = 0; fd < 32; fd++) {
2648 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2649 PerlIO_printf(Perl_debug_log," %d",fd);
2651 PerlIO_printf(Perl_debug_log,"\n");
2654 #endif /* DUMP_FDS */
2658 dup2(int oldfd, int newfd)
2660 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2663 PerlLIO_close(newfd);
2664 return fcntl(oldfd, F_DUPFD, newfd);
2666 #define DUP2_MAX_FDS 256
2667 int fdtmp[DUP2_MAX_FDS];
2673 PerlLIO_close(newfd);
2674 /* good enough for low fd's... */
2675 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2676 if (fdx >= DUP2_MAX_FDS) {
2684 PerlLIO_close(fdtmp[--fdx]);
2691 #ifdef HAS_SIGACTION
2694 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2697 struct sigaction act, oact;
2700 /* only "parent" interpreter can diddle signals */
2701 if (PL_curinterp != aTHX)
2702 return (Sighandler_t) SIG_ERR;
2705 act.sa_handler = (void(*)(int))handler;
2706 sigemptyset(&act.sa_mask);
2709 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2710 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2712 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2713 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2714 act.sa_flags |= SA_NOCLDWAIT;
2716 if (sigaction(signo, &act, &oact) == -1)
2717 return (Sighandler_t) SIG_ERR;
2719 return (Sighandler_t) oact.sa_handler;
2723 Perl_rsignal_state(pTHX_ int signo)
2725 struct sigaction oact;
2726 PERL_UNUSED_CONTEXT;
2728 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2729 return (Sighandler_t) SIG_ERR;
2731 return (Sighandler_t) oact.sa_handler;
2735 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2738 struct sigaction act;
2740 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2743 /* only "parent" interpreter can diddle signals */
2744 if (PL_curinterp != aTHX)
2748 act.sa_handler = (void(*)(int))handler;
2749 sigemptyset(&act.sa_mask);
2752 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2753 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2755 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2756 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2757 act.sa_flags |= SA_NOCLDWAIT;
2759 return sigaction(signo, &act, save);
2763 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2767 /* only "parent" interpreter can diddle signals */
2768 if (PL_curinterp != aTHX)
2772 return sigaction(signo, save, (struct sigaction *)NULL);
2775 #else /* !HAS_SIGACTION */
2778 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2780 #if defined(USE_ITHREADS) && !defined(WIN32)
2781 /* only "parent" interpreter can diddle signals */
2782 if (PL_curinterp != aTHX)
2783 return (Sighandler_t) SIG_ERR;
2786 return PerlProc_signal(signo, handler);
2797 Perl_rsignal_state(pTHX_ int signo)
2800 Sighandler_t oldsig;
2802 #if defined(USE_ITHREADS) && !defined(WIN32)
2803 /* only "parent" interpreter can diddle signals */
2804 if (PL_curinterp != aTHX)
2805 return (Sighandler_t) SIG_ERR;
2809 oldsig = PerlProc_signal(signo, sig_trap);
2810 PerlProc_signal(signo, oldsig);
2812 PerlProc_kill(PerlProc_getpid(), signo);
2817 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2819 #if defined(USE_ITHREADS) && !defined(WIN32)
2820 /* only "parent" interpreter can diddle signals */
2821 if (PL_curinterp != aTHX)
2824 *save = PerlProc_signal(signo, handler);
2825 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2829 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2831 #if defined(USE_ITHREADS) && !defined(WIN32)
2832 /* only "parent" interpreter can diddle signals */
2833 if (PL_curinterp != aTHX)
2836 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2839 #endif /* !HAS_SIGACTION */
2840 #endif /* !PERL_MICRO */
2842 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2843 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2845 Perl_my_pclose(pTHX_ PerlIO *ptr)
2848 Sigsave_t hstat, istat, qstat;
2856 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2857 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2859 *svp = &PL_sv_undef;
2861 if (pid == -1) { /* Opened by popen. */
2862 return my_syspclose(ptr);
2865 close_failed = (PerlIO_close(ptr) == EOF);
2868 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2871 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2872 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2873 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2876 pid2 = wait4pid(pid, &status, 0);
2877 } while (pid2 == -1 && errno == EINTR);
2879 rsignal_restore(SIGHUP, &hstat);
2880 rsignal_restore(SIGINT, &istat);
2881 rsignal_restore(SIGQUIT, &qstat);
2887 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2890 #if defined(__LIBCATAMOUNT__)
2892 Perl_my_pclose(pTHX_ PerlIO *ptr)
2897 #endif /* !DOSISH */
2899 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2901 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2905 PERL_ARGS_ASSERT_WAIT4PID;
2908 #ifdef PERL_USES_PL_PIDSTATUS
2911 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2912 pid, rather than a string form. */
2913 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2914 if (svp && *svp != &PL_sv_undef) {
2915 *statusp = SvIVX(*svp);
2916 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2924 hv_iterinit(PL_pidstatus);
2925 if ((entry = hv_iternext(PL_pidstatus))) {
2926 SV * const sv = hv_iterval(PL_pidstatus,entry);
2928 const char * const spid = hv_iterkey(entry,&len);
2930 assert (len == sizeof(Pid_t));
2931 memcpy((char *)&pid, spid, len);
2932 *statusp = SvIVX(sv);
2933 /* The hash iterator is currently on this entry, so simply
2934 calling hv_delete would trigger the lazy delete, which on
2935 aggregate does more work, beacuse next call to hv_iterinit()
2936 would spot the flag, and have to call the delete routine,
2937 while in the meantime any new entries can't re-use that
2939 hv_iterinit(PL_pidstatus);
2940 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2947 # ifdef HAS_WAITPID_RUNTIME
2948 if (!HAS_WAITPID_RUNTIME)
2951 result = PerlProc_waitpid(pid,statusp,flags);
2954 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2955 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2958 #ifdef PERL_USES_PL_PIDSTATUS
2959 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2964 Perl_croak(aTHX_ "Can't do waitpid with flags");
2966 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2967 pidgone(result,*statusp);
2973 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2976 if (result < 0 && errno == EINTR) {
2978 errno = EINTR; /* reset in case a signal handler changed $! */
2982 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2984 #ifdef PERL_USES_PL_PIDSTATUS
2986 S_pidgone(pTHX_ Pid_t pid, int status)
2990 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2991 SvUPGRADE(sv,SVt_IV);
2992 SvIV_set(sv, status);
2997 #if defined(atarist) || defined(OS2) || defined(EPOC)
3000 int /* Cannot prototype with I32
3002 my_syspclose(PerlIO *ptr)
3005 Perl_my_pclose(pTHX_ PerlIO *ptr)
3008 /* Needs work for PerlIO ! */
3009 FILE * const f = PerlIO_findFILE(ptr);
3010 const I32 result = pclose(f);
3011 PerlIO_releaseFILE(ptr,f);
3019 Perl_my_pclose(pTHX_ PerlIO *ptr)
3021 /* Needs work for PerlIO ! */
3022 FILE * const f = PerlIO_findFILE(ptr);
3023 I32 result = djgpp_pclose(f);
3024 result = (result << 8) & 0xff00;
3025 PerlIO_releaseFILE(ptr,f);
3030 #define PERL_REPEATCPY_LINEAR 4
3032 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3034 PERL_ARGS_ASSERT_REPEATCPY;
3037 memset(to, *from, count);
3039 register char *p = to;
3040 I32 items, linear, half;
3042 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3043 for (items = 0; items < linear; ++items) {
3044 register const char *q = from;
3046 for (todo = len; todo > 0; todo--)
3051 while (items <= half) {
3052 I32 size = items * len;
3053 memcpy(p, to, size);
3059 memcpy(p, to, (count - items) * len);
3065 Perl_same_dirent(pTHX_ const char *a, const char *b)
3067 char *fa = strrchr(a,'/');
3068 char *fb = strrchr(b,'/');
3071 SV * const tmpsv = sv_newmortal();
3073 PERL_ARGS_ASSERT_SAME_DIRENT;
3086 sv_setpvs(tmpsv, ".");
3088 sv_setpvn(tmpsv, a, fa - a);
3089 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3092 sv_setpvs(tmpsv, ".");
3094 sv_setpvn(tmpsv, b, fb - b);
3095 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3097 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3098 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3100 #endif /* !HAS_RENAME */
3103 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3104 const char *const *const search_ext, I32 flags)
3107 const char *xfound = NULL;
3108 char *xfailed = NULL;
3109 char tmpbuf[MAXPATHLEN];
3114 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3115 # define SEARCH_EXTS ".bat", ".cmd", NULL
3116 # define MAX_EXT_LEN 4
3119 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3120 # define MAX_EXT_LEN 4
3123 # define SEARCH_EXTS ".pl", ".com", NULL
3124 # define MAX_EXT_LEN 4
3126 /* additional extensions to try in each dir if scriptname not found */
3128 static const char *const exts[] = { SEARCH_EXTS };
3129 const char *const *const ext = search_ext ? search_ext : exts;
3130 int extidx = 0, i = 0;
3131 const char *curext = NULL;
3133 PERL_UNUSED_ARG(search_ext);
3134 # define MAX_EXT_LEN 0
3137 PERL_ARGS_ASSERT_FIND_SCRIPT;
3140 * If dosearch is true and if scriptname does not contain path
3141 * delimiters, search the PATH for scriptname.
3143 * If SEARCH_EXTS is also defined, will look for each
3144 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3145 * while searching the PATH.
3147 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3148 * proceeds as follows:
3149 * If DOSISH or VMSISH:
3150 * + look for ./scriptname{,.foo,.bar}
3151 * + search the PATH for scriptname{,.foo,.bar}
3154 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3155 * this will not look in '.' if it's not in the PATH)
3160 # ifdef ALWAYS_DEFTYPES
3161 len = strlen(scriptname);
3162 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3163 int idx = 0, deftypes = 1;
3166 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3169 int idx = 0, deftypes = 1;
3172 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3174 /* The first time through, just add SEARCH_EXTS to whatever we
3175 * already have, so we can check for default file types. */
3177 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3183 if ((strlen(tmpbuf) + strlen(scriptname)
3184 + MAX_EXT_LEN) >= sizeof tmpbuf)
3185 continue; /* don't search dir with too-long name */
3186 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3190 if (strEQ(scriptname, "-"))
3192 if (dosearch) { /* Look in '.' first. */
3193 const char *cur = scriptname;
3195 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3197 if (strEQ(ext[i++],curext)) {
3198 extidx = -1; /* already has an ext */
3203 DEBUG_p(PerlIO_printf(Perl_debug_log,
3204 "Looking for %s\n",cur));
3205 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3206 && !S_ISDIR(PL_statbuf.st_mode)) {
3214 if (cur == scriptname) {
3215 len = strlen(scriptname);
3216 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3218 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3221 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3222 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3227 if (dosearch && !strchr(scriptname, '/')
3229 && !strchr(scriptname, '\\')
3231 && (s = PerlEnv_getenv("PATH")))
3235 bufend = s + strlen(s);
3236 while (s < bufend) {
3237 #if defined(atarist) || defined(DOSISH)
3242 && *s != ';'; len++, s++) {
3243 if (len < sizeof tmpbuf)
3246 if (len < sizeof tmpbuf)
3248 #else /* ! (atarist || DOSISH) */
3249 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3252 #endif /* ! (atarist || DOSISH) */
3255 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3256 continue; /* don't search dir with too-long name */
3258 # if defined(atarist) || defined(DOSISH)
3259 && tmpbuf[len - 1] != '/'
3260 && tmpbuf[len - 1] != '\\'
3263 tmpbuf[len++] = '/';
3264 if (len == 2 && tmpbuf[0] == '.')
3266 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3270 len = strlen(tmpbuf);
3271 if (extidx > 0) /* reset after previous loop */
3275 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3276 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3277 if (S_ISDIR(PL_statbuf.st_mode)) {
3281 } while ( retval < 0 /* not there */
3282 && extidx>=0 && ext[extidx] /* try an extension? */
3283 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3288 if (S_ISREG(PL_statbuf.st_mode)
3289 && cando(S_IRUSR,TRUE,&PL_statbuf)
3290 #if !defined(DOSISH)
3291 && cando(S_IXUSR,TRUE,&PL_statbuf)
3295 xfound = tmpbuf; /* bingo! */
3299 xfailed = savepv(tmpbuf);
3302 if (!xfound && !seen_dot && !xfailed &&
3303 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3304 || S_ISDIR(PL_statbuf.st_mode)))
3306 seen_dot = 1; /* Disable message. */
3308 if (flags & 1) { /* do or die? */
3309 Perl_croak(aTHX_ "Can't %s %s%s%s",
3310 (xfailed ? "execute" : "find"),
3311 (xfailed ? xfailed : scriptname),
3312 (xfailed ? "" : " on PATH"),
3313 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3318 scriptname = xfound;
3320 return (scriptname ? savepv(scriptname) : NULL);
3323 #ifndef PERL_GET_CONTEXT_DEFINED
3326 Perl_get_context(void)
3329 #if defined(USE_ITHREADS)
3330 # ifdef OLD_PTHREADS_API
3332 if (pthread_getspecific(PL_thr_key, &t))
3333 Perl_croak_nocontext("panic: pthread_getspecific");
3336 # ifdef I_MACH_CTHREADS
3337 return (void*)cthread_data(cthread_self());
3339 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3348 Perl_set_context(void *t)
3351 PERL_ARGS_ASSERT_SET_CONTEXT;
3352 #if defined(USE_ITHREADS)
3353 # ifdef I_MACH_CTHREADS
3354 cthread_set_data(cthread_self(), t);
3356 if (pthread_setspecific(PL_thr_key, t))
3357 Perl_croak_nocontext("panic: pthread_setspecific");
3364 #endif /* !PERL_GET_CONTEXT_DEFINED */
3366 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3375 Perl_get_op_names(pTHX)
3377 PERL_UNUSED_CONTEXT;
3378 return (char **)PL_op_name;
3382 Perl_get_op_descs(pTHX)
3384 PERL_UNUSED_CONTEXT;
3385 return (char **)PL_op_desc;
3389 Perl_get_no_modify(pTHX)
3391 PERL_UNUSED_CONTEXT;
3392 return PL_no_modify;
3396 Perl_get_opargs(pTHX)
3398 PERL_UNUSED_CONTEXT;
3399 return (U32 *)PL_opargs;
3403 Perl_get_ppaddr(pTHX)
3406 PERL_UNUSED_CONTEXT;
3407 return (PPADDR_t*)PL_ppaddr;
3410 #ifndef HAS_GETENV_LEN
3412 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3414 char * const env_trans = PerlEnv_getenv(env_elem);
3415 PERL_UNUSED_CONTEXT;
3416 PERL_ARGS_ASSERT_GETENV_LEN;
3418 *len = strlen(env_trans);
3425 Perl_get_vtbl(pTHX_ int vtbl_id)
3427 const MGVTBL* result;
3428 PERL_UNUSED_CONTEXT;
3432 result = &PL_vtbl_sv;
3435 result = &PL_vtbl_env;
3437 case want_vtbl_envelem:
3438 result = &PL_vtbl_envelem;
3441 result = &PL_vtbl_sig;
3443 case want_vtbl_sigelem:
3444 result = &PL_vtbl_sigelem;
3446 case want_vtbl_pack:
3447 result = &PL_vtbl_pack;
3449 case want_vtbl_packelem:
3450 result = &PL_vtbl_packelem;
3452 case want_vtbl_dbline:
3453 result = &PL_vtbl_dbline;
3456 result = &PL_vtbl_isa;
3458 case want_vtbl_isaelem:
3459 result = &PL_vtbl_isaelem;
3461 case want_vtbl_arylen:
3462 result = &PL_vtbl_arylen;
3464 case want_vtbl_mglob:
3465 result = &PL_vtbl_mglob;
3467 case want_vtbl_nkeys:
3468 result = &PL_vtbl_nkeys;
3470 case want_vtbl_taint:
3471 result = &PL_vtbl_taint;
3473 case want_vtbl_substr:
3474 result = &PL_vtbl_substr;
3477 result = &PL_vtbl_vec;
3480 result = &PL_vtbl_pos;
3483 result = &PL_vtbl_bm;
3486 result = &PL_vtbl_fm;
3488 case want_vtbl_uvar:
3489 result = &PL_vtbl_uvar;
3491 case want_vtbl_defelem:
3492 result = &PL_vtbl_defelem;
3494 case want_vtbl_regexp:
3495 result = &PL_vtbl_regexp;
3497 case want_vtbl_regdata:
3498 result = &PL_vtbl_regdata;
3500 case want_vtbl_regdatum:
3501 result = &PL_vtbl_regdatum;
3503 #ifdef USE_LOCALE_COLLATE
3504 case want_vtbl_collxfrm:
3505 result = &PL_vtbl_collxfrm;
3508 case want_vtbl_amagic:
3509 result = &PL_vtbl_amagic;
3511 case want_vtbl_amagicelem:
3512 result = &PL_vtbl_amagicelem;
3514 case want_vtbl_backref:
3515 result = &PL_vtbl_backref;
3517 case want_vtbl_utf8:
3518 result = &PL_vtbl_utf8;
3524 return (MGVTBL*)result;
3528 Perl_my_fflush_all(pTHX)
3530 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3531 return PerlIO_flush(NULL);
3533 # if defined(HAS__FWALK)
3534 extern int fflush(FILE *);
3535 /* undocumented, unprototyped, but very useful BSDism */
3536 extern void _fwalk(int (*)(FILE *));
3540 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3542 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3543 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3545 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3546 open_max = sysconf(_SC_OPEN_MAX);
3549 open_max = FOPEN_MAX;
3552 open_max = OPEN_MAX;
3563 for (i = 0; i < open_max; i++)
3564 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3565 STDIO_STREAM_ARRAY[i]._file < open_max &&
3566 STDIO_STREAM_ARRAY[i]._flag)
3567 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3571 SETERRNO(EBADF,RMS_IFI);
3578 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3580 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3582 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3583 if (ckWARN(WARN_IO)) {
3584 const char * const direction =
3585 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3587 Perl_warner(aTHX_ packWARN(WARN_IO),
3588 "Filehandle %s opened only for %sput",
3591 Perl_warner(aTHX_ packWARN(WARN_IO),
3592 "Filehandle opened only for %sput", direction);
3599 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3601 warn_type = WARN_CLOSED;
3605 warn_type = WARN_UNOPENED;
3608 if (ckWARN(warn_type)) {
3609 const char * const pars =
3610 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3611 const char * const func =
3613 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3614 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3615 op < 0 ? "" : /* handle phoney cases */
3617 const char * const type =
3619 (OP_IS_SOCKET(op) ||
3620 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3621 "socket" : "filehandle");
3622 if (name && *name) {
3623 Perl_warner(aTHX_ packWARN(warn_type),
3624 "%s%s on %s %s %s", func, pars, vile, type, name);
3625 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3627 aTHX_ packWARN(warn_type),
3628 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3633 Perl_warner(aTHX_ packWARN(warn_type),
3634 "%s%s on %s %s", func, pars, vile, type);
3635 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3637 aTHX_ packWARN(warn_type),
3638 "\t(Are you trying to call %s%s on dirhandle?)\n",
3647 /* in ASCII order, not that it matters */
3648 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3651 Perl_ebcdic_control(pTHX_ int ch)
3659 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3660 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3663 if (ctlp == controllablechars)
3664 return('\177'); /* DEL */
3666 return((unsigned char)(ctlp - controllablechars - 1));
3667 } else { /* Want uncontrol */
3668 if (ch == '\177' || ch == -1)
3670 else if (ch == '\157')
3672 else if (ch == '\174')
3674 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3676 else if (ch == '\155')
3678 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3679 return(controllablechars[ch+1]);
3681 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3686 /* To workaround core dumps from the uninitialised tm_zone we get the
3687 * system to give us a reasonable struct to copy. This fix means that
3688 * strftime uses the tm_zone and tm_gmtoff values returned by
3689 * localtime(time()). That should give the desired result most of the
3690 * time. But probably not always!
3692 * This does not address tzname aspects of NETaa14816.
3697 # ifndef STRUCT_TM_HASZONE
3698 # define STRUCT_TM_HASZONE
3702 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3703 # ifndef HAS_TM_TM_ZONE
3704 # define HAS_TM_TM_ZONE
3709 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3711 #ifdef HAS_TM_TM_ZONE
3713 const struct tm* my_tm;
3714 PERL_ARGS_ASSERT_INIT_TM;
3716 my_tm = localtime(&now);
3718 Copy(my_tm, ptm, 1, struct tm);
3720 PERL_ARGS_ASSERT_INIT_TM;
3721 PERL_UNUSED_ARG(ptm);
3726 * mini_mktime - normalise struct tm values without the localtime()
3727 * semantics (and overhead) of mktime().
3730 Perl_mini_mktime(pTHX_ struct tm *ptm)
3734 int month, mday, year, jday;
3735 int odd_cent, odd_year;
3736 PERL_UNUSED_CONTEXT;
3738 PERL_ARGS_ASSERT_MINI_MKTIME;
3740 #define DAYS_PER_YEAR 365
3741 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3742 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3743 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3744 #define SECS_PER_HOUR (60*60)
3745 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3746 /* parentheses deliberately absent on these two, otherwise they don't work */
3747 #define MONTH_TO_DAYS 153/5
3748 #define DAYS_TO_MONTH 5/153
3749 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3750 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3751 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3752 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3755 * Year/day algorithm notes:
3757 * With a suitable offset for numeric value of the month, one can find
3758 * an offset into the year by considering months to have 30.6 (153/5) days,
3759 * using integer arithmetic (i.e., with truncation). To avoid too much
3760 * messing about with leap days, we consider January and February to be
3761 * the 13th and 14th month of the previous year. After that transformation,
3762 * we need the month index we use to be high by 1 from 'normal human' usage,
3763 * so the month index values we use run from 4 through 15.
3765 * Given that, and the rules for the Gregorian calendar (leap years are those
3766 * divisible by 4 unless also divisible by 100, when they must be divisible
3767 * by 400 instead), we can simply calculate the number of days since some
3768 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3769 * the days we derive from our month index, and adding in the day of the
3770 * month. The value used here is not adjusted for the actual origin which
3771 * it normally would use (1 January A.D. 1), since we're not exposing it.
3772 * We're only building the value so we can turn around and get the
3773 * normalised values for the year, month, day-of-month, and day-of-year.
3775 * For going backward, we need to bias the value we're using so that we find
3776 * the right year value. (Basically, we don't want the contribution of
3777 * March 1st to the number to apply while deriving the year). Having done
3778 * that, we 'count up' the contribution to the year number by accounting for
3779 * full quadracenturies (400-year periods) with their extra leap days, plus
3780 * the contribution from full centuries (to avoid counting in the lost leap
3781 * days), plus the contribution from full quad-years (to count in the normal
3782 * leap days), plus the leftover contribution from any non-leap years.
3783 * At this point, if we were working with an actual leap day, we'll have 0
3784 * days left over. This is also true for March 1st, however. So, we have
3785 * to special-case that result, and (earlier) keep track of the 'odd'
3786 * century and year contributions. If we got 4 extra centuries in a qcent,
3787 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3788 * Otherwise, we add back in the earlier bias we removed (the 123 from
3789 * figuring in March 1st), find the month index (integer division by 30.6),
3790 * and the remainder is the day-of-month. We then have to convert back to
3791 * 'real' months (including fixing January and February from being 14/15 in
3792 * the previous year to being in the proper year). After that, to get
3793 * tm_yday, we work with the normalised year and get a new yearday value for
3794 * January 1st, which we subtract from the yearday value we had earlier,
3795 * representing the date we've re-built. This is done from January 1
3796 * because tm_yday is 0-origin.
3798 * Since POSIX time routines are only guaranteed to work for times since the
3799 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3800 * applies Gregorian calendar rules even to dates before the 16th century
3801 * doesn't bother me. Besides, you'd need cultural context for a given
3802 * date to know whether it was Julian or Gregorian calendar, and that's
3803 * outside the scope for this routine. Since we convert back based on the
3804 * same rules we used to build the yearday, you'll only get strange results
3805 * for input which needed normalising, or for the 'odd' century years which
3806 * were leap years in the Julian calander but not in the Gregorian one.
3807 * I can live with that.
3809 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3810 * that's still outside the scope for POSIX time manipulation, so I don't
3814 year = 1900 + ptm->tm_year;
3815 month = ptm->tm_mon;
3816 mday = ptm->tm_mday;
3817 /* allow given yday with no month & mday to dominate the result */
3818 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3821 jday = 1 + ptm->tm_yday;
3830 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3831 yearday += month*MONTH_TO_DAYS + mday + jday;
3833 * Note that we don't know when leap-seconds were or will be,
3834 * so we have to trust the user if we get something which looks
3835 * like a sensible leap-second. Wild values for seconds will
3836 * be rationalised, however.
3838 if ((unsigned) ptm->tm_sec <= 60) {
3845 secs += 60 * ptm->tm_min;
3846 secs += SECS_PER_HOUR * ptm->tm_hour;
3848 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3849 /* got negative remainder, but need positive time */
3850 /* back off an extra day to compensate */
3851 yearday += (secs/SECS_PER_DAY)-1;
3852 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3855 yearday += (secs/SECS_PER_DAY);
3856 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3859 else if (secs >= SECS_PER_DAY) {
3860 yearday += (secs/SECS_PER_DAY);
3861 secs %= SECS_PER_DAY;
3863 ptm->tm_hour = secs/SECS_PER_HOUR;
3864 secs %= SECS_PER_HOUR;
3865 ptm->tm_min = secs/60;
3867 ptm->tm_sec += secs;
3868 /* done with time of day effects */
3870 * The algorithm for yearday has (so far) left it high by 428.
3871 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3872 * bias it by 123 while trying to figure out what year it
3873 * really represents. Even with this tweak, the reverse
3874 * translation fails for years before A.D. 0001.
3875 * It would still fail for Feb 29, but we catch that one below.
3877 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3878 yearday -= YEAR_ADJUST;
3879 year = (yearday / DAYS_PER_QCENT) * 400;
3880 yearday %= DAYS_PER_QCENT;
3881 odd_cent = yearday / DAYS_PER_CENT;
3882 year += odd_cent * 100;
3883 yearday %= DAYS_PER_CENT;
3884 year += (yearday / DAYS_PER_QYEAR) * 4;
3885 yearday %= DAYS_PER_QYEAR;
3886 odd_year = yearday / DAYS_PER_YEAR;
3888 yearday %= DAYS_PER_YEAR;
3889 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3894 yearday += YEAR_ADJUST; /* recover March 1st crock */
3895 month = yearday*DAYS_TO_MONTH;
3896 yearday -= month*MONTH_TO_DAYS;
3897 /* recover other leap-year adjustment */
3906 ptm->tm_year = year - 1900;
3908 ptm->tm_mday = yearday;
3909 ptm->tm_mon = month;
3913 ptm->tm_mon = month - 1;
3915 /* re-build yearday based on Jan 1 to get tm_yday */
3917 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3918 yearday += 14*MONTH_TO_DAYS + 1;
3919 ptm->tm_yday = jday - yearday;
3920 /* fix tm_wday if not overridden by caller */
3921 if ((unsigned)ptm->tm_wday > 6)
3922 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3926 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)
3934 PERL_ARGS_ASSERT_MY_STRFTIME;
3936 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3939 mytm.tm_hour = hour;
3940 mytm.tm_mday = mday;
3942 mytm.tm_year = year;
3943 mytm.tm_wday = wday;
3944 mytm.tm_yday = yday;
3945 mytm.tm_isdst = isdst;
3947 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3948 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3953 #ifdef HAS_TM_TM_GMTOFF
3954 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3956 #ifdef HAS_TM_TM_ZONE
3957 mytm.tm_zone = mytm2.tm_zone;
3962 Newx(buf, buflen, char);
3963 len = strftime(buf, buflen, fmt, &mytm);
3965 ** The following is needed to handle to the situation where
3966 ** tmpbuf overflows. Basically we want to allocate a buffer
3967 ** and try repeatedly. The reason why it is so complicated
3968 ** is that getting a return value of 0 from strftime can indicate
3969 ** one of the following:
3970 ** 1. buffer overflowed,
3971 ** 2. illegal conversion specifier, or
3972 ** 3. the format string specifies nothing to be returned(not
3973 ** an error). This could be because format is an empty string
3974 ** or it specifies %p that yields an empty string in some locale.
3975 ** If there is a better way to make it portable, go ahead by
3978 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3981 /* Possibly buf overflowed - try again with a bigger buf */
3982 const int fmtlen = strlen(fmt);
3983 int bufsize = fmtlen + buflen;
3985 Newx(buf, bufsize, char);
3987 buflen = strftime(buf, bufsize, fmt, &mytm);
3988 if (buflen > 0 && buflen < bufsize)
3990 /* heuristic to prevent out-of-memory errors */
3991 if (bufsize > 100*fmtlen) {
3997 Renew(buf, bufsize, char);
4002 Perl_croak(aTHX_ "panic: no strftime");
4008 #define SV_CWD_RETURN_UNDEF \
4009 sv_setsv(sv, &PL_sv_undef); \
4012 #define SV_CWD_ISDOT(dp) \
4013 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4014 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4017 =head1 Miscellaneous Functions
4019 =for apidoc getcwd_sv
4021 Fill the sv with current working directory
4026 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4027 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4028 * getcwd(3) if available
4029 * Comments from the orignal:
4030 * This is a faster version of getcwd. It's also more dangerous
4031 * because you might chdir out of a directory that you can't chdir
4035 Perl_getcwd_sv(pTHX_ register SV *sv)
4039 #ifndef INCOMPLETE_TAINTS
4043 PERL_ARGS_ASSERT_GETCWD_SV;
4047 char buf[MAXPATHLEN];
4049 /* Some getcwd()s automatically allocate a buffer of the given
4050 * size from the heap if they are given a NULL buffer pointer.
4051 * The problem is that this behaviour is not portable. */
4052 if (getcwd(buf, sizeof(buf) - 1)) {
4057 sv_setsv(sv, &PL_sv_undef);
4065 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4069 SvUPGRADE(sv, SVt_PV);
4071 if (PerlLIO_lstat(".", &statbuf) < 0) {
4072 SV_CWD_RETURN_UNDEF;
4075 orig_cdev = statbuf.st_dev;
4076 orig_cino = statbuf.st_ino;
4086 if (PerlDir_chdir("..") < 0) {
4087 SV_CWD_RETURN_UNDEF;
4089 if (PerlLIO_stat(".", &statbuf) < 0) {
4090 SV_CWD_RETURN_UNDEF;
4093 cdev = statbuf.st_dev;
4094 cino = statbuf.st_ino;
4096 if (odev == cdev && oino == cino) {
4099 if (!(dir = PerlDir_open("."))) {
4100 SV_CWD_RETURN_UNDEF;
4103 while ((dp = PerlDir_read(dir)) != NULL) {
4105 namelen = dp->d_namlen;
4107 namelen = strlen(dp->d_name);
4110 if (SV_CWD_ISDOT(dp)) {
4114 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4115 SV_CWD_RETURN_UNDEF;
4118 tdev = statbuf.st_dev;
4119 tino = statbuf.st_ino;
4120 if (tino == oino && tdev == odev) {
4126 SV_CWD_RETURN_UNDEF;
4129 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4130 SV_CWD_RETURN_UNDEF;
4133 SvGROW(sv, pathlen + namelen + 1);
4137 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4140 /* prepend current directory to the front */
4142 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4143 pathlen += (namelen + 1);
4145 #ifdef VOID_CLOSEDIR
4148 if (PerlDir_close(dir) < 0) {
4149 SV_CWD_RETURN_UNDEF;
4155 SvCUR_set(sv, pathlen);
4159 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4160 SV_CWD_RETURN_UNDEF;
4163 if (PerlLIO_stat(".", &statbuf) < 0) {
4164 SV_CWD_RETURN_UNDEF;
4167 cdev = statbuf.st_dev;
4168 cino = statbuf.st_ino;
4170 if (cdev != orig_cdev || cino != orig_cino) {
4171 Perl_croak(aTHX_ "Unstable directory path, "
4172 "current directory changed unexpectedly");
4183 #define VERSION_MAX 0x7FFFFFFF
4186 Perl_prescan_version(pTHX_ const char *s, bool strict,
4187 const char **errstr,
4188 bool *sqv, int *ssaw_decimal, int *swidth, bool *salpha) {
4189 bool qv = (sqv ? *sqv : FALSE);
4191 int saw_decimal = 0;
4195 PERL_ARGS_ASSERT_PRESCAN_VERSION;
4197 if (qv && isDIGIT(*d))
4198 goto dotted_decimal_version;
4200 if (*d == 'v') { /* explicit v-string */
4205 else { /* degenerate v-string */
4206 /* requires v1.2.3 */
4207 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4210 dotted_decimal_version:
4211 if (strict && d[0] == '0' && isDIGIT(d[1])) {
4212 /* no leading zeros allowed */
4213 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4216 while (isDIGIT(*d)) /* integer part */
4222 d++; /* decimal point */
4227 /* require v1.2.3 */
4228 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4231 goto version_prescan_finish;
4238 while (isDIGIT(*d)) { /* just keep reading */
4240 while (isDIGIT(*d)) {
4242 /* maximum 3 digits between decimal */
4243 if (strict && j > 3) {
4244 BADVERSION(s,errstr,"Invalid version format (maximum 3 digits between decimals)");
4249 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4252 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4257 else if (*d == '.') {
4259 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4264 else if (!isDIGIT(*d)) {
4270 if (strict && i < 2) {
4271 /* requires v1.2.3 */
4272 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)");
4275 } /* end if dotted-decimal */
4277 { /* decimal versions */
4278 /* special strict case for leading '.' or '0' */
4281 BADVERSION(s,errstr,"Invalid version format (0 before decimal required)");
4283 if (*d == '0' && isDIGIT(d[1])) {
4284 BADVERSION(s,errstr,"Invalid version format (no leading zeros)");
4288 /* consume all of the integer part */
4292 /* look for a fractional part */
4294 /* we found it, so consume it */
4298 else if (!*d || *d == ';' || isSPACE(*d) || *d == '}') {
4301 BADVERSION(s,errstr,"Invalid version format (version required)");
4303 /* found just an integer */
4304 goto version_prescan_finish;
4306 else if ( d == s ) {
4307 /* didn't find either integer or period */
4308 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4310 else if (*d == '_') {
4311 /* underscore can't come after integer part */
4313 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4315 else if (isDIGIT(d[1])) {
4316 BADVERSION(s,errstr,"Invalid version format (alpha without decimal)");
4319 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4323 /* anything else after integer part is just invalid data */
4324 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4327 /* scan the fractional part after the decimal point*/
4329 if (!isDIGIT(*d) && (strict || ! (!*d || *d == ';' || isSPACE(*d) || *d == '}') )) {
4330 /* strict or lax-but-not-the-end */
4331 BADVERSION(s,errstr,"Invalid version format (fractional part required)");
4334 while (isDIGIT(*d)) {
4336 if (*d == '.' && isDIGIT(d[-1])) {
4338 BADVERSION(s,errstr,"Invalid version format (underscores before decimal)");
4341 BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions must begin with 'v')");
4343 d = (char *)s; /* start all over again */
4345 goto dotted_decimal_version;
4349 BADVERSION(s,errstr,"Invalid version format (no underscores)");
4352 BADVERSION(s,errstr,"Invalid version format (multiple underscores)");
4354 if ( ! isDIGIT(d[1]) ) {
4355 BADVERSION(s,errstr,"Invalid version format (misplaced underscore)");
4363 version_prescan_finish:
4367 if (!isDIGIT(*d) && (! (!*d || *d == ';' || *d == '}') )) {
4368 /* trailing non-numeric data */
4369 BADVERSION(s,errstr,"Invalid version format (non-numeric data)");
4377 *ssaw_decimal = saw_decimal;
4384 =for apidoc scan_version
4386 Returns a pointer to the next character after the parsed
4387 version string, as well as upgrading the passed in SV to
4390 Function must be called with an already existing SV like
4393 s = scan_version(s, SV *sv, bool qv);
4395 Performs some preprocessing to the string to ensure that
4396 it has the correct characteristics of a version. Flags the
4397 object if it contains an underscore (which denotes this
4398 is an alpha version). The boolean qv denotes that the version
4399 should be interpreted as if it had multiple decimals, even if
4406 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4411 const char *errstr = NULL;
4412 int saw_decimal = 0;
4416 AV * const av = newAV();
4417 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4419 PERL_ARGS_ASSERT_SCAN_VERSION;
4421 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4423 #ifndef NODEFAULT_SHAREKEYS
4424 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4427 while (isSPACE(*s)) /* leading whitespace is OK */
4430 last = prescan_version(s, FALSE, &errstr, &qv, &saw_decimal, &width, &alpha);
4432 /* "undef" is a special case and not an error */
4433 if ( ! ( *s == 'u' && strEQ(s,"undef")) ) {
4434 Perl_croak(aTHX_ "%s", errstr);
4444 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4446 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4447 if ( !qv && width < 3 )
4448 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4450 while (isDIGIT(*pos))
4452 if (!isALPHA(*pos)) {
4458 /* this is atoi() that delimits on underscores */
4459 const char *end = pos;
4463 /* the following if() will only be true after the decimal
4464 * point of a version originally created with a bare
4465 * floating point number, i.e. not quoted in any way
4467 if ( !qv && s > start && saw_decimal == 1 ) {
4471 rev += (*s - '0') * mult;
4473 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4474 || (PERL_ABS(rev) > VERSION_MAX )) {
4475 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4476 "Integer overflow in version %d",VERSION_MAX);
4487 while (--end >= s) {
4489 rev += (*end - '0') * mult;
4491 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4492 || (PERL_ABS(rev) > VERSION_MAX )) {
4493 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4494 "Integer overflow in version");
4503 /* Append revision */
4504 av_push(av, newSViv(rev));
4509 else if ( *pos == '.' )
4511 else if ( *pos == '_' && isDIGIT(pos[1]) )
4513 else if ( *pos == ',' && isDIGIT(pos[1]) )
4515 else if ( isDIGIT(*pos) )
4522 while ( isDIGIT(*pos) )
4527 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4535 if ( qv ) { /* quoted versions always get at least three terms*/
4536 I32 len = av_len(av);
4537 /* This for loop appears to trigger a compiler bug on OS X, as it
4538 loops infinitely. Yes, len is negative. No, it makes no sense.
4539 Compiler in question is:
4540 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4541 for ( len = 2 - len; len > 0; len-- )
4542 av_push(MUTABLE_AV(sv), newSViv(0));
4546 av_push(av, newSViv(0));
4549 /* need to save off the current version string for later */
4551 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4552 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4553 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4555 else if ( s > start ) {
4556 SV * orig = newSVpvn(start,s-start);
4557 if ( qv && saw_decimal == 1 && *start != 'v' ) {
4558 /* need to insert a v to be consistent */
4559 sv_insert(orig, 0, 0, "v", 1);
4561 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4564 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4565 av_push(av, newSViv(0));
4568 /* And finally, store the AV in the hash */
4569 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4571 /* fix RT#19517 - special case 'undef' as string */
4572 if ( *s == 'u' && strEQ(s,"undef") ) {
4580 =for apidoc new_version
4582 Returns a new version object based on the passed in SV:
4584 SV *sv = new_version(SV *ver);
4586 Does not alter the passed in ver SV. See "upg_version" if you
4587 want to upgrade the SV.
4593 Perl_new_version(pTHX_ SV *ver)
4596 SV * const rv = newSV(0);
4597 PERL_ARGS_ASSERT_NEW_VERSION;
4598 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4601 AV * const av = newAV();
4603 /* This will get reblessed later if a derived class*/
4604 SV * const hv = newSVrv(rv, "version");
4605 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4606 #ifndef NODEFAULT_SHAREKEYS
4607 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4613 /* Begin copying all of the elements */
4614 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4615 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4617 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4618 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4620 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4622 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4623 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4626 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4628 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4629 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4632 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4633 /* This will get reblessed later if a derived class*/
4634 for ( key = 0; key <= av_len(sav); key++ )
4636 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4637 av_push(av, newSViv(rev));
4640 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4645 const MAGIC* const mg = SvVSTRING_mg(ver);
4646 if ( mg ) { /* already a v-string */
4647 const STRLEN len = mg->mg_len;
4648 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4649 sv_setpvn(rv,version,len);
4650 /* this is for consistency with the pure Perl class */
4651 if ( isDIGIT(*version) )
4652 sv_insert(rv, 0, 0, "v", 1);
4657 sv_setsv(rv,ver); /* make a duplicate */
4662 return upg_version(rv, FALSE);
4666 =for apidoc upg_version
4668 In-place upgrade of the supplied SV to a version object.
4670 SV *sv = upg_version(SV *sv, bool qv);
4672 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4673 to force this SV to be interpreted as an "extended" version.
4679 Perl_upg_version(pTHX_ SV *ver, bool qv)
4681 const char *version, *s;
4686 PERL_ARGS_ASSERT_UPG_VERSION;
4688 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4690 /* may get too much accuracy */
4692 #ifdef USE_LOCALE_NUMERIC
4693 char *loc = setlocale(LC_NUMERIC, "C");
4695 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4696 #ifdef USE_LOCALE_NUMERIC
4697 setlocale(LC_NUMERIC, loc);
4699 while (tbuf[len-1] == '0' && len > 0) len--;
4700 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4701 version = savepvn(tbuf, len);
4704 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4705 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4709 else /* must be a string or something like a string */
4712 version = savepv(SvPV(ver,len));
4714 # if PERL_VERSION > 5
4715 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4716 if ( len >= 3 && !instr(version,".") && !instr(version,"_")
4717 && !(*version == 'u' && strEQ(version, "undef"))
4718 && (*version < '0' || *version > '9') ) {
4719 /* may be a v-string */
4720 SV * const nsv = sv_newmortal();
4723 int saw_decimal = 0;
4724 sv_setpvf(nsv,"v%vd",ver);
4725 pos = nver = savepv(SvPV_nolen(nsv));
4727 /* scan the resulting formatted string */
4728 pos++; /* skip the leading 'v' */
4729 while ( *pos == '.' || isDIGIT(*pos) ) {
4735 /* is definitely a v-string */
4736 if ( saw_decimal >= 2 ) {
4745 s = scan_version(version, ver, qv);
4747 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4748 "Version string '%s' contains invalid data; "
4749 "ignoring: '%s'", version, s);
4757 Validates that the SV contains a valid version object.
4759 bool vverify(SV *vobj);
4761 Note that it only confirms the bare minimum structure (so as not to get
4762 confused by derived classes which may contain additional hash entries):
4766 =item * The SV contains a [reference to a] hash
4768 =item * The hash contains a "version" key
4770 =item * The "version" key has [a reference to] an AV as its value
4778 Perl_vverify(pTHX_ SV *vs)
4782 PERL_ARGS_ASSERT_VVERIFY;
4787 /* see if the appropriate elements exist */
4788 if ( SvTYPE(vs) == SVt_PVHV
4789 && hv_exists(MUTABLE_HV(vs), "version", 7)
4790 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4791 && SvTYPE(sv) == SVt_PVAV )
4800 Accepts a version object and returns the normalized floating
4801 point representation. Call like:
4805 NOTE: you can pass either the object directly or the SV
4806 contained within the RV.
4812 Perl_vnumify(pTHX_ SV *vs)
4820 PERL_ARGS_ASSERT_VNUMIFY;
4826 Perl_croak(aTHX_ "Invalid version object");
4828 /* see if various flags exist */
4829 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4831 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4832 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4837 /* attempt to retrieve the version array */
4838 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4839 return newSVpvs("0");
4845 return newSVpvs("0");
4848 digit = SvIV(*av_fetch(av, 0, 0));
4849 sv = Perl_newSVpvf(aTHX_ "%d.", (int)PERL_ABS(digit));
4850 for ( i = 1 ; i < len ; i++ )
4852 digit = SvIV(*av_fetch(av, i, 0));
4854 const int denom = (width == 2 ? 10 : 100);
4855 const div_t term = div((int)PERL_ABS(digit),denom);
4856 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4859 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4865 digit = SvIV(*av_fetch(av, len, 0));
4866 if ( alpha && width == 3 ) /* alpha version */
4868 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4872 sv_catpvs(sv, "000");
4880 Accepts a version object and returns the normalized string
4881 representation. Call like:
4885 NOTE: you can pass either the object directly or the SV
4886 contained within the RV.
4892 Perl_vnormal(pTHX_ SV *vs)
4899 PERL_ARGS_ASSERT_VNORMAL;
4905 Perl_croak(aTHX_ "Invalid version object");
4907 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4909 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4914 return newSVpvs("");
4916 digit = SvIV(*av_fetch(av, 0, 0));
4917 sv = Perl_newSVpvf(aTHX_ "v%"IVdf, (IV)digit);
4918 for ( i = 1 ; i < len ; i++ ) {
4919 digit = SvIV(*av_fetch(av, i, 0));
4920 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4925 /* handle last digit specially */
4926 digit = SvIV(*av_fetch(av, len, 0));
4928 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4930 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4933 if ( len <= 2 ) { /* short version, must be at least three */
4934 for ( len = 2 - len; len != 0; len-- )
4941 =for apidoc vstringify
4943 In order to maintain maximum compatibility with earlier versions
4944 of Perl, this function will return either the floating point
4945 notation or the multiple dotted notation, depending on whether
4946 the original version contained 1 or more dots, respectively
4952 Perl_vstringify(pTHX_ SV *vs)
4954 PERL_ARGS_ASSERT_VSTRINGIFY;
4960 Perl_croak(aTHX_ "Invalid version object");
4962 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4964 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4968 return &PL_sv_undef;
4971 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4981 Version object aware cmp. Both operands must already have been
4982 converted into version objects.
4988 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4991 bool lalpha = FALSE;
4992 bool ralpha = FALSE;
4997 PERL_ARGS_ASSERT_VCMP;
5004 if ( !vverify(lhv) )
5005 Perl_croak(aTHX_ "Invalid version object");
5007 if ( !vverify(rhv) )
5008 Perl_croak(aTHX_ "Invalid version object");
5010 /* get the left hand term */
5011 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
5012 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
5015 /* and the right hand term */
5016 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
5017 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
5025 while ( i <= m && retval == 0 )
5027 left = SvIV(*av_fetch(lav,i,0));
5028 right = SvIV(*av_fetch(rav,i,0));
5036 /* tiebreaker for alpha with identical terms */
5037 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
5039 if ( lalpha && !ralpha )
5043 else if ( ralpha && !lalpha)
5049 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
5053 while ( i <= r && retval == 0 )
5055 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
5056 retval = -1; /* not a match after all */
5062 while ( i <= l && retval == 0 )
5064 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
5065 retval = +1; /* not a match after all */
5073 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
5074 # define EMULATE_SOCKETPAIR_UDP
5077 #ifdef EMULATE_SOCKETPAIR_UDP
5079 S_socketpair_udp (int fd[2]) {
5081 /* Fake a datagram socketpair using UDP to localhost. */
5082 int sockets[2] = {-1, -1};
5083 struct sockaddr_in addresses[2];
5085 Sock_size_t size = sizeof(struct sockaddr_in);
5086 unsigned short port;
5089 memset(&addresses, 0, sizeof(addresses));
5092 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
5093 if (sockets[i] == -1)
5094 goto tidy_up_and_fail;
5096 addresses[i].sin_family = AF_INET;
5097 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5098 addresses[i].sin_port = 0; /* kernel choses port. */
5099 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
5100 sizeof(struct sockaddr_in)) == -1)
5101 goto tidy_up_and_fail;
5104 /* Now have 2 UDP sockets. Find out which port each is connected to, and
5105 for each connect the other socket to it. */
5108 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
5110 goto tidy_up_and_fail;
5111 if (size != sizeof(struct sockaddr_in))
5112 goto abort_tidy_up_and_fail;
5113 /* !1 is 0, !0 is 1 */
5114 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
5115 sizeof(struct sockaddr_in)) == -1)
5116 goto tidy_up_and_fail;
5119 /* Now we have 2 sockets connected to each other. I don't trust some other
5120 process not to have already sent a packet to us (by random) so send
5121 a packet from each to the other. */
5124 /* I'm going to send my own port number. As a short.
5125 (Who knows if someone somewhere has sin_port as a bitfield and needs
5126 this routine. (I'm assuming crays have socketpair)) */
5127 port = addresses[i].sin_port;
5128 got = PerlLIO_write(sockets[i], &port, sizeof(port));
5129 if (got != sizeof(port)) {
5131 goto tidy_up_and_fail;
5132 goto abort_tidy_up_and_fail;
5136 /* Packets sent. I don't trust them to have arrived though.
5137 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
5138 connect to localhost will use a second kernel thread. In 2.6 the
5139 first thread running the connect() returns before the second completes,
5140 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
5141 returns 0. Poor programs have tripped up. One poor program's authors'
5142 had a 50-1 reverse stock split. Not sure how connected these were.)
5143 So I don't trust someone not to have an unpredictable UDP stack.
5147 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5148 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5152 FD_SET((unsigned int)sockets[0], &rset);
5153 FD_SET((unsigned int)sockets[1], &rset);
5155 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5156 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5157 || !FD_ISSET(sockets[1], &rset)) {
5158 /* I hope this is portable and appropriate. */
5160 goto tidy_up_and_fail;
5161 goto abort_tidy_up_and_fail;
5165 /* And the paranoia department even now doesn't trust it to have arrive
5166 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5168 struct sockaddr_in readfrom;
5169 unsigned short buffer[2];
5174 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5175 sizeof(buffer), MSG_DONTWAIT,
5176 (struct sockaddr *) &readfrom, &size);
5178 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5180 (struct sockaddr *) &readfrom, &size);
5184 goto tidy_up_and_fail;
5185 if (got != sizeof(port)
5186 || size != sizeof(struct sockaddr_in)
5187 /* Check other socket sent us its port. */
5188 || buffer[0] != (unsigned short) addresses[!i].sin_port
5189 /* Check kernel says we got the datagram from that socket */
5190 || readfrom.sin_family != addresses[!i].sin_family
5191 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5192 || readfrom.sin_port != addresses[!i].sin_port)
5193 goto abort_tidy_up_and_fail;
5196 /* My caller (my_socketpair) has validated that this is non-NULL */
5199 /* I hereby declare this connection open. May God bless all who cross
5203 abort_tidy_up_and_fail:
5204 errno = ECONNABORTED;
5208 if (sockets[0] != -1)
5209 PerlLIO_close(sockets[0]);
5210 if (sockets[1] != -1)
5211 PerlLIO_close(sockets[1]);
5216 #endif /* EMULATE_SOCKETPAIR_UDP */
5218 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5220 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5221 /* Stevens says that family must be AF_LOCAL, protocol 0.
5222 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5227 struct sockaddr_in listen_addr;
5228 struct sockaddr_in connect_addr;
5233 || family != AF_UNIX
5236 errno = EAFNOSUPPORT;
5244 #ifdef EMULATE_SOCKETPAIR_UDP
5245 if (type == SOCK_DGRAM)
5246 return S_socketpair_udp(fd);
5249 listener = PerlSock_socket(AF_INET, type, 0);
5252 memset(&listen_addr, 0, sizeof(listen_addr));
5253 listen_addr.sin_family = AF_INET;
5254 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5255 listen_addr.sin_port = 0; /* kernel choses port. */
5256 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5257 sizeof(listen_addr)) == -1)
5258 goto tidy_up_and_fail;
5259 if (PerlSock_listen(listener, 1) == -1)
5260 goto tidy_up_and_fail;
5262 connector = PerlSock_socket(AF_INET, type, 0);
5263 if (connector == -1)
5264 goto tidy_up_and_fail;
5265 /* We want to find out the port number to connect to. */
5266 size = sizeof(connect_addr);
5267 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5269 goto tidy_up_and_fail;
5270 if (size != sizeof(connect_addr))
5271 goto abort_tidy_up_and_fail;
5272 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5273 sizeof(connect_addr)) == -1)
5274 goto tidy_up_and_fail;
5276 size = sizeof(listen_addr);
5277 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5280 goto tidy_up_and_fail;
5281 if (size != sizeof(listen_addr))
5282 goto abort_tidy_up_and_fail;
5283 PerlLIO_close(listener);
5284 /* Now check we are talking to ourself by matching port and host on the
5286 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5288 goto tidy_up_and_fail;
5289 if (size != sizeof(connect_addr)
5290 || listen_addr.sin_family != connect_addr.sin_family
5291 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5292 || listen_addr.sin_port != connect_addr.sin_port) {
5293 goto abort_tidy_up_and_fail;
5299 abort_tidy_up_and_fail:
5301 errno = ECONNABORTED; /* This would be the standard thing to do. */
5303 # ifdef ECONNREFUSED
5304 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5306 errno = ETIMEDOUT; /* Desperation time. */
5313 PerlLIO_close(listener);
5314 if (connector != -1)
5315 PerlLIO_close(connector);
5317 PerlLIO_close(acceptor);
5323 /* In any case have a stub so that there's code corresponding
5324 * to the my_socketpair in global.sym. */
5326 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5327 #ifdef HAS_SOCKETPAIR
5328 return socketpair(family, type, protocol, fd);
5337 =for apidoc sv_nosharing
5339 Dummy routine which "shares" an SV when there is no sharing module present.
5340 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5341 Exists to avoid test for a NULL function pointer and because it could
5342 potentially warn under some level of strict-ness.
5348 Perl_sv_nosharing(pTHX_ SV *sv)
5350 PERL_UNUSED_CONTEXT;
5351 PERL_UNUSED_ARG(sv);
5356 =for apidoc sv_destroyable
5358 Dummy routine which reports that object can be destroyed when there is no
5359 sharing module present. It ignores its single SV argument, and returns
5360 'true'. Exists to avoid test for a NULL function pointer and because it
5361 could potentially warn under some level of strict-ness.
5367 Perl_sv_destroyable(pTHX_ SV *sv)
5369 PERL_UNUSED_CONTEXT;
5370 PERL_UNUSED_ARG(sv);
5375 Perl_parse_unicode_opts(pTHX_ const char **popt)
5377 const char *p = *popt;
5380 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5384 opt = (U32) atoi(p);
5387 if (*p && *p != '\n' && *p != '\r')
5388 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5393 case PERL_UNICODE_STDIN:
5394 opt |= PERL_UNICODE_STDIN_FLAG; break;
5395 case PERL_UNICODE_STDOUT:
5396 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5397 case PERL_UNICODE_STDERR:
5398 opt |= PERL_UNICODE_STDERR_FLAG; break;
5399 case PERL_UNICODE_STD:
5400 opt |= PERL_UNICODE_STD_FLAG; break;
5401 case PERL_UNICODE_IN:
5402 opt |= PERL_UNICODE_IN_FLAG; break;
5403 case PERL_UNICODE_OUT:
5404 opt |= PERL_UNICODE_OUT_FLAG; break;
5405 case PERL_UNICODE_INOUT:
5406 opt |= PERL_UNICODE_INOUT_FLAG; break;
5407 case PERL_UNICODE_LOCALE:
5408 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5409 case PERL_UNICODE_ARGV:
5410 opt |= PERL_UNICODE_ARGV_FLAG; break;
5411 case PERL_UNICODE_UTF8CACHEASSERT:
5412 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5414 if (*p != '\n' && *p != '\r')
5416 "Unknown Unicode option letter '%c'", *p);
5422 opt = PERL_UNICODE_DEFAULT_FLAGS;
5424 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5425 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5426 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5438 * This is really just a quick hack which grabs various garbage
5439 * values. It really should be a real hash algorithm which
5440 * spreads the effect of every input bit onto every output bit,
5441 * if someone who knows about such things would bother to write it.
5442 * Might be a good idea to add that function to CORE as well.
5443 * No numbers below come from careful analysis or anything here,
5444 * except they are primes and SEED_C1 > 1E6 to get a full-width
5445 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5446 * probably be bigger too.
5449 # define SEED_C1 1000003
5450 #define SEED_C4 73819
5452 # define SEED_C1 25747
5453 #define SEED_C4 20639
5457 #define SEED_C5 26107
5459 #ifndef PERL_NO_DEV_RANDOM
5464 # include <starlet.h>
5465 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5466 * in 100-ns units, typically incremented ever 10 ms. */
5467 unsigned int when[2];
5469 # ifdef HAS_GETTIMEOFDAY
5470 struct timeval when;
5476 /* This test is an escape hatch, this symbol isn't set by Configure. */
5477 #ifndef PERL_NO_DEV_RANDOM
5478 #ifndef PERL_RANDOM_DEVICE
5479 /* /dev/random isn't used by default because reads from it will block
5480 * if there isn't enough entropy available. You can compile with
5481 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5482 * is enough real entropy to fill the seed. */
5483 # define PERL_RANDOM_DEVICE "/dev/urandom"
5485 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5487 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5496 _ckvmssts(sys$gettim(when));
5497 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5499 # ifdef HAS_GETTIMEOFDAY
5500 PerlProc_gettimeofday(&when,NULL);
5501 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5504 u = (U32)SEED_C1 * when;
5507 u += SEED_C3 * (U32)PerlProc_getpid();
5508 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5509 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5510 u += SEED_C5 * (U32)PTR2UV(&when);
5516 Perl_get_hash_seed(pTHX)
5519 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5525 if (s && isDIGIT(*s))
5526 myseed = (UV)Atoul(s);
5528 #ifdef USE_HASH_SEED_EXPLICIT
5532 /* Compute a random seed */
5533 (void)seedDrand01((Rand_seed_t)seed());
5534 myseed = (UV)(Drand01() * (NV)UV_MAX);
5535 #if RANDBITS < (UVSIZE * 8)
5536 /* Since there are not enough randbits to to reach all
5537 * the bits of a UV, the low bits might need extra
5538 * help. Sum in another random number that will
5539 * fill in the low bits. */
5541 (UV)(Drand01() * (NV)((((UV)1) << ((UVSIZE * 8 - RANDBITS))) - 1));
5542 #endif /* RANDBITS < (UVSIZE * 8) */
5543 if (myseed == 0) { /* Superparanoia. */
5544 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5546 Perl_croak(aTHX_ "Your random numbers are not that random");
5549 PL_rehash_seed_set = TRUE;
5556 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5558 const char * const stashpv = CopSTASHPV(c);
5559 const char * const name = HvNAME_get(hv);
5560 PERL_UNUSED_CONTEXT;
5561 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5563 if (stashpv == name)
5565 if (stashpv && name)
5566 if (strEQ(stashpv, name))
5573 #ifdef PERL_GLOBAL_STRUCT
5575 #define PERL_GLOBAL_STRUCT_INIT
5576 #include "opcode.h" /* the ppaddr and check */
5579 Perl_init_global_struct(pTHX)
5581 struct perl_vars *plvarsp = NULL;
5582 # ifdef PERL_GLOBAL_STRUCT
5583 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5584 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5585 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5586 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5587 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5591 plvarsp = PL_VarsPtr;
5592 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5598 # define PERLVAR(var,type) /**/
5599 # define PERLVARA(var,n,type) /**/
5600 # define PERLVARI(var,type,init) plvarsp->var = init;
5601 # define PERLVARIC(var,type,init) plvarsp->var = init;
5602 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5603 # include "perlvars.h"
5609 # ifdef PERL_GLOBAL_STRUCT
5612 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5613 if (!plvarsp->Gppaddr)
5617 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5618 if (!plvarsp->Gcheck)
5620 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5621 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5623 # ifdef PERL_SET_VARS
5624 PERL_SET_VARS(plvarsp);
5626 # undef PERL_GLOBAL_STRUCT_INIT
5631 #endif /* PERL_GLOBAL_STRUCT */
5633 #ifdef PERL_GLOBAL_STRUCT
5636 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5638 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5639 # ifdef PERL_GLOBAL_STRUCT
5640 # ifdef PERL_UNSET_VARS
5641 PERL_UNSET_VARS(plvarsp);
5643 free(plvarsp->Gppaddr);
5644 free(plvarsp->Gcheck);
5645 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5651 #endif /* PERL_GLOBAL_STRUCT */
5655 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5656 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5657 * given, and you supply your own implementation.
5659 * The default implementation reads a single env var, PERL_MEM_LOG,
5660 * expecting one or more of the following:
5662 * \d+ - fd fd to write to : must be 1st (atoi)
5663 * 'm' - memlog was PERL_MEM_LOG=1
5664 * 's' - svlog was PERL_SV_LOG=1
5665 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5667 * This makes the logger controllable enough that it can reasonably be
5668 * added to the system perl.
5671 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5672 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5674 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5676 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5677 * writes to. In the default logger, this is settable at runtime.
5679 #ifndef PERL_MEM_LOG_FD
5680 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5683 #ifndef PERL_MEM_LOG_NOIMPL
5685 # ifdef DEBUG_LEAKING_SCALARS
5686 # define SV_LOG_SERIAL_FMT " [%lu]"
5687 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5689 # define SV_LOG_SERIAL_FMT
5690 # define _SV_LOG_SERIAL_ARG(sv)
5694 S_mem_log_common(enum mem_log_type mlt, const UV n,
5695 const UV typesize, const char *type_name, const SV *sv,
5696 Malloc_t oldalloc, Malloc_t newalloc,
5697 const char *filename, const int linenumber,
5698 const char *funcname)
5702 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5704 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5707 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
5709 /* We can't use SVs or PerlIO for obvious reasons,
5710 * so we'll use stdio and low-level IO instead. */
5711 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5713 # ifdef HAS_GETTIMEOFDAY
5714 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5715 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5717 gettimeofday(&tv, 0);
5719 # define MEM_LOG_TIME_FMT "%10d: "
5720 # define MEM_LOG_TIME_ARG (int)when
5724 /* If there are other OS specific ways of hires time than
5725 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5726 * probably that they would be used to fill in the struct
5730 int fd = atoi(pmlenv);
5732 fd = PERL_MEM_LOG_FD;
5734 if (strchr(pmlenv, 't')) {
5735 len = my_snprintf(buf, sizeof(buf),
5736 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5737 PerlLIO_write(fd, buf, len);
5741 len = my_snprintf(buf, sizeof(buf),
5742 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5743 " %s = %"IVdf": %"UVxf"\n",
5744 filename, linenumber, funcname, n, typesize,
5745 type_name, n * typesize, PTR2UV(newalloc));
5748 len = my_snprintf(buf, sizeof(buf),
5749 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5750 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5751 filename, linenumber, funcname, n, typesize,
5752 type_name, n * typesize, PTR2UV(oldalloc),
5756 len = my_snprintf(buf, sizeof(buf),
5757 "free: %s:%d:%s: %"UVxf"\n",
5758 filename, linenumber, funcname,
5763 len = my_snprintf(buf, sizeof(buf),
5764 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5765 mlt == MLT_NEW_SV ? "new" : "del",
5766 filename, linenumber, funcname,
5767 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5772 PerlLIO_write(fd, buf, len);
5776 #endif /* !PERL_MEM_LOG_NOIMPL */
5778 #ifndef PERL_MEM_LOG_NOIMPL
5780 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5781 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5783 /* this is suboptimal, but bug compatible. User is providing their
5784 own implemenation, but is getting these functions anyway, and they
5785 do nothing. But _NOIMPL users should be able to cope or fix */
5787 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5788 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5792 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5794 const char *filename, const int linenumber,
5795 const char *funcname)
5797 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5798 NULL, NULL, newalloc,
5799 filename, linenumber, funcname);
5804 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5805 Malloc_t oldalloc, Malloc_t newalloc,
5806 const char *filename, const int linenumber,
5807 const char *funcname)
5809 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5810 NULL, oldalloc, newalloc,
5811 filename, linenumber, funcname);
5816 Perl_mem_log_free(Malloc_t oldalloc,
5817 const char *filename, const int linenumber,
5818 const char *funcname)
5820 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5821 filename, linenumber, funcname);
5826 Perl_mem_log_new_sv(const SV *sv,
5827 const char *filename, const int linenumber,
5828 const char *funcname)
5830 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5831 filename, linenumber, funcname);
5835 Perl_mem_log_del_sv(const SV *sv,
5836 const char *filename, const int linenumber,
5837 const char *funcname)
5839 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5840 filename, linenumber, funcname);
5843 #endif /* PERL_MEM_LOG */
5846 =for apidoc my_sprintf
5848 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5849 the length of the string written to the buffer. Only rare pre-ANSI systems
5850 need the wrapper function - usually this is a direct call to C<sprintf>.
5854 #ifndef SPRINTF_RETURNS_STRLEN
5856 Perl_my_sprintf(char *buffer, const char* pat, ...)
5859 PERL_ARGS_ASSERT_MY_SPRINTF;
5860 va_start(args, pat);
5861 vsprintf(buffer, pat, args);
5863 return strlen(buffer);
5868 =for apidoc my_snprintf
5870 The C library C<snprintf> functionality, if available and
5871 standards-compliant (uses C<vsnprintf>, actually). However, if the
5872 C<vsnprintf> is not available, will unfortunately use the unsafe
5873 C<vsprintf> which can overrun the buffer (there is an overrun check,
5874 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5875 getting C<vsnprintf>.
5880 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5885 PERL_ARGS_ASSERT_MY_SNPRINTF;
5886 va_start(ap, format);
5887 #ifdef HAS_VSNPRINTF
5888 retval = vsnprintf(buffer, len, format, ap);
5890 retval = vsprintf(buffer, format, ap);
5893 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5894 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5895 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5900 =for apidoc my_vsnprintf
5902 The C library C<vsnprintf> if available and standards-compliant.
5903 However, if if the C<vsnprintf> is not available, will unfortunately
5904 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5905 overrun check, but that may be too late). Consider using
5906 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5911 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5918 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5920 Perl_va_copy(ap, apc);
5921 # ifdef HAS_VSNPRINTF
5922 retval = vsnprintf(buffer, len, format, apc);
5924 retval = vsprintf(buffer, format, apc);
5927 # ifdef HAS_VSNPRINTF
5928 retval = vsnprintf(buffer, len, format, ap);
5930 retval = vsprintf(buffer, format, ap);
5932 #endif /* #ifdef NEED_VA_COPY */
5933 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5934 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5935 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5940 Perl_my_clearenv(pTHX)
5943 #if ! defined(PERL_MICRO)
5944 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5946 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5947 # if defined(USE_ENVIRON_ARRAY)
5948 # if defined(USE_ITHREADS)
5949 /* only the parent thread can clobber the process environment */
5950 if (PL_curinterp == aTHX)
5951 # endif /* USE_ITHREADS */
5953 # if ! defined(PERL_USE_SAFE_PUTENV)
5954 if ( !PL_use_safe_putenv) {
5956 if (environ == PL_origenviron)
5957 environ = (char**)safesysmalloc(sizeof(char*));
5959 for (i = 0; environ[i]; i++)
5960 (void)safesysfree(environ[i]);
5963 # else /* PERL_USE_SAFE_PUTENV */
5964 # if defined(HAS_CLEARENV)
5966 # elif defined(HAS_UNSETENV)
5967 int bsiz = 80; /* Most envvar names will be shorter than this. */
5968 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5969 char *buf = (char*)safesysmalloc(bufsiz);
5970 while (*environ != NULL) {
5971 char *e = strchr(*environ, '=');
5972 int l = e ? e - *environ : (int)strlen(*environ);
5974 (void)safesysfree(buf);
5975 bsiz = l + 1; /* + 1 for the \0. */
5976 buf = (char*)safesysmalloc(bufsiz);
5978 memcpy(buf, *environ, l);
5980 (void)unsetenv(buf);
5982 (void)safesysfree(buf);
5983 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5984 /* Just null environ and accept the leakage. */
5986 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5987 # endif /* ! PERL_USE_SAFE_PUTENV */
5989 # endif /* USE_ENVIRON_ARRAY */
5990 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5991 #endif /* PERL_MICRO */
5994 #ifdef PERL_IMPLICIT_CONTEXT
5996 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5997 the global PL_my_cxt_index is incremented, and that value is assigned to
5998 that module's static my_cxt_index (who's address is passed as an arg).
5999 Then, for each interpreter this function is called for, it makes sure a
6000 void* slot is available to hang the static data off, by allocating or
6001 extending the interpreter's PL_my_cxt_list array */
6003 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
6005 Perl_my_cxt_init(pTHX_ int *index, size_t size)
6009 PERL_ARGS_ASSERT_MY_CXT_INIT;
6011 /* this module hasn't been allocated an index yet */
6012 #if defined(USE_ITHREADS)
6013 MUTEX_LOCK(&PL_my_ctx_mutex);
6015 *index = PL_my_cxt_index++;
6016 #if defined(USE_ITHREADS)
6017 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6021 /* make sure the array is big enough */
6022 if (PL_my_cxt_size <= *index) {
6023 if (PL_my_cxt_size) {
6024 while (PL_my_cxt_size <= *index)
6025 PL_my_cxt_size *= 2;
6026 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6029 PL_my_cxt_size = 16;
6030 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6033 /* newSV() allocates one more than needed */
6034 p = (void*)SvPVX(newSV(size-1));
6035 PL_my_cxt_list[*index] = p;
6036 Zero(p, size, char);
6040 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6043 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
6048 PERL_ARGS_ASSERT_MY_CXT_INDEX;
6050 for (index = 0; index < PL_my_cxt_index; index++) {
6051 const char *key = PL_my_cxt_keys[index];
6052 /* try direct pointer compare first - there are chances to success,
6053 * and it's much faster.
6055 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
6062 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
6068 PERL_ARGS_ASSERT_MY_CXT_INIT;
6070 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
6072 /* this module hasn't been allocated an index yet */
6073 #if defined(USE_ITHREADS)
6074 MUTEX_LOCK(&PL_my_ctx_mutex);
6076 index = PL_my_cxt_index++;
6077 #if defined(USE_ITHREADS)
6078 MUTEX_UNLOCK(&PL_my_ctx_mutex);
6082 /* make sure the array is big enough */
6083 if (PL_my_cxt_size <= index) {
6084 int old_size = PL_my_cxt_size;
6086 if (PL_my_cxt_size) {
6087 while (PL_my_cxt_size <= index)
6088 PL_my_cxt_size *= 2;
6089 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
6090 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6093 PL_my_cxt_size = 16;
6094 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
6095 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
6097 for (i = old_size; i < PL_my_cxt_size; i++) {
6098 PL_my_cxt_keys[i] = 0;
6099 PL_my_cxt_list[i] = 0;
6102 PL_my_cxt_keys[index] = my_cxt_key;
6103 /* newSV() allocates one more than needed */
6104 p = (void*)SvPVX(newSV(size-1));
6105 PL_my_cxt_list[index] = p;
6106 Zero(p, size, char);
6109 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
6110 #endif /* PERL_IMPLICIT_CONTEXT */
6114 Perl_my_strlcat(char *dst, const char *src, Size_t size)
6116 Size_t used, length, copy;
6119 length = strlen(src);
6120 if (size > 0 && used < size - 1) {
6121 copy = (length >= size - used) ? size - used - 1 : length;
6122 memcpy(dst + used, src, copy);
6123 dst[used + copy] = '\0';
6125 return used + length;
6131 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
6133 Size_t length, copy;
6135 length = strlen(src);
6137 copy = (length >= size) ? size - 1 : length;
6138 memcpy(dst, src, copy);
6145 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
6146 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
6147 long _ftol( double ); /* Defined by VC6 C libs. */
6148 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
6152 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
6155 SV * const dbsv = GvSVn(PL_DBsub);
6156 /* We do not care about using sv to call CV;
6157 * it's for informational purposes only.
6160 PERL_ARGS_ASSERT_GET_DB_SUB;
6163 if (!PERLDB_SUB_NN) {
6164 GV * const gv = CvGV(cv);
6166 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6167 || strEQ(GvNAME(gv), "END")
6168 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6169 !( (SvTYPE(*svp) == SVt_PVGV)
6170 && (GvCV((const GV *)*svp) == cv) )))) {
6171 /* Use GV from the stack as a fallback. */
6172 /* GV is potentially non-unique, or contain different CV. */
6173 SV * const tmp = newRV(MUTABLE_SV(cv));
6174 sv_setsv(dbsv, tmp);
6178 gv_efullname3(dbsv, gv, NULL);
6182 const int type = SvTYPE(dbsv);
6183 if (type < SVt_PVIV && type != SVt_IV)
6184 sv_upgrade(dbsv, SVt_PVIV);
6185 (void)SvIOK_on(dbsv);
6186 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6191 Perl_my_dirfd(pTHX_ DIR * dir) {
6193 /* Most dirfd implementations have problems when passed NULL. */
6198 #elif defined(HAS_DIR_DD_FD)
6201 Perl_die(aTHX_ PL_no_func, "dirfd");
6208 Perl_get_re_arg(pTHX_ SV *sv) {
6214 sv = MUTABLE_SV(SvRV(sv));
6215 if (SvTYPE(sv) == SVt_REGEXP)
6216 return (REGEXP*) sv;
6224 * c-indentation-style: bsd
6226 * indent-tabs-mode: t
6229 * ex: set ts=8 sts=4 sw=4 noet: