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);
1367 PL_restartop = die_where(message);
1373 #if defined(PERL_IMPLICIT_CONTEXT)
1375 Perl_die_nocontext(const char* pat, ...)
1380 va_start(args, pat);
1381 o = vdie(pat, &args);
1385 #endif /* PERL_IMPLICIT_CONTEXT */
1388 Perl_die(pTHX_ const char* pat, ...)
1392 va_start(args, pat);
1393 o = vdie(pat, &args);
1399 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1404 msv = S_vdie_croak_common(aTHX_ pat, args);
1407 PL_restartop = die_where(msv);
1411 write_to_stderr( msv ? msv : ERRSV );
1415 #if defined(PERL_IMPLICIT_CONTEXT)
1417 Perl_croak_nocontext(const char *pat, ...)
1421 va_start(args, pat);
1426 #endif /* PERL_IMPLICIT_CONTEXT */
1429 =head1 Warning and Dieing
1433 This is the XSUB-writer's interface to Perl's C<die> function.
1434 Normally call this function the same way you call the C C<printf>
1435 function. Calling C<croak> returns control directly to Perl,
1436 sidestepping the normal C order of execution. See C<warn>.
1438 If you want to throw an exception object, assign the object to
1439 C<$@> and then pass C<NULL> to croak():
1441 errsv = get_sv("@", GV_ADD);
1442 sv_setsv(errsv, exception_object);
1449 Perl_croak(pTHX_ const char *pat, ...)
1452 va_start(args, pat);
1459 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1462 SV * const msv = vmess(pat, args);
1464 PERL_ARGS_ASSERT_VWARN;
1467 if (vdie_common(msv, TRUE))
1471 write_to_stderr(msv);
1474 #if defined(PERL_IMPLICIT_CONTEXT)
1476 Perl_warn_nocontext(const char *pat, ...)
1480 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1481 va_start(args, pat);
1485 #endif /* PERL_IMPLICIT_CONTEXT */
1490 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1491 function the same way you call the C C<printf> function. See C<croak>.
1497 Perl_warn(pTHX_ const char *pat, ...)
1500 PERL_ARGS_ASSERT_WARN;
1501 va_start(args, pat);
1506 #if defined(PERL_IMPLICIT_CONTEXT)
1508 Perl_warner_nocontext(U32 err, const char *pat, ...)
1512 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1513 va_start(args, pat);
1514 vwarner(err, pat, &args);
1517 #endif /* PERL_IMPLICIT_CONTEXT */
1520 Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1522 PERL_ARGS_ASSERT_CK_WARNER_D;
1524 if (Perl_ckwarn_d(aTHX_ err)) {
1526 va_start(args, pat);
1527 vwarner(err, pat, &args);
1533 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1535 PERL_ARGS_ASSERT_CK_WARNER;
1537 if (Perl_ckwarn(aTHX_ err)) {
1539 va_start(args, pat);
1540 vwarner(err, pat, &args);
1546 Perl_warner(pTHX_ U32 err, const char* pat,...)
1549 PERL_ARGS_ASSERT_WARNER;
1550 va_start(args, pat);
1551 vwarner(err, pat, &args);
1556 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1559 PERL_ARGS_ASSERT_VWARNER;
1560 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1561 SV * const msv = vmess(pat, args);
1565 S_vdie_common(aTHX_ msv, FALSE);
1568 PL_restartop = die_where(msv);
1571 write_to_stderr(msv);
1575 Perl_vwarn(aTHX_ pat, args);
1579 /* implements the ckWARN? macros */
1582 Perl_ckwarn(pTHX_ U32 w)
1585 /* If lexical warnings have not been set, use $^W. */
1587 return PL_dowarn & G_WARN_ON;
1589 return ckwarn_common(w);
1592 /* implements the ckWARN?_d macro */
1595 Perl_ckwarn_d(pTHX_ U32 w)
1598 /* If lexical warnings have not been set then default classes warn. */
1602 return ckwarn_common(w);
1606 S_ckwarn_common(pTHX_ U32 w)
1608 if (PL_curcop->cop_warnings == pWARN_ALL)
1611 if (PL_curcop->cop_warnings == pWARN_NONE)
1614 /* Check the assumption that at least the first slot is non-zero. */
1615 assert(unpackWARN1(w));
1617 /* Check the assumption that it is valid to stop as soon as a zero slot is
1619 if (!unpackWARN2(w)) {
1620 assert(!unpackWARN3(w));
1621 assert(!unpackWARN4(w));
1622 } else if (!unpackWARN3(w)) {
1623 assert(!unpackWARN4(w));
1626 /* Right, dealt with all the special cases, which are implemented as non-
1627 pointers, so there is a pointer to a real warnings mask. */
1629 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1631 } while (w >>= WARNshift);
1636 /* Set buffer=NULL to get a new one. */
1638 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1640 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1641 PERL_UNUSED_CONTEXT;
1642 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1645 (specialWARN(buffer) ?
1646 PerlMemShared_malloc(len_wanted) :
1647 PerlMemShared_realloc(buffer, len_wanted));
1649 Copy(bits, (buffer + 1), size, char);
1653 /* since we've already done strlen() for both nam and val
1654 * we can use that info to make things faster than
1655 * sprintf(s, "%s=%s", nam, val)
1657 #define my_setenv_format(s, nam, nlen, val, vlen) \
1658 Copy(nam, s, nlen, char); \
1660 Copy(val, s+(nlen+1), vlen, char); \
1661 *(s+(nlen+1+vlen)) = '\0'
1663 #ifdef USE_ENVIRON_ARRAY
1664 /* VMS' my_setenv() is in vms.c */
1665 #if !defined(WIN32) && !defined(NETWARE)
1667 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1671 /* only parent thread can modify process environment */
1672 if (PL_curinterp == aTHX)
1675 #ifndef PERL_USE_SAFE_PUTENV
1676 if (!PL_use_safe_putenv) {
1677 /* most putenv()s leak, so we manipulate environ directly */
1679 register const I32 len = strlen(nam);
1682 /* where does it go? */
1683 for (i = 0; environ[i]; i++) {
1684 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1688 if (environ == PL_origenviron) { /* need we copy environment? */
1694 while (environ[max])
1696 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1697 for (j=0; j<max; j++) { /* copy environment */
1698 const int len = strlen(environ[j]);
1699 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1700 Copy(environ[j], tmpenv[j], len+1, char);
1703 environ = tmpenv; /* tell exec where it is now */
1706 safesysfree(environ[i]);
1707 while (environ[i]) {
1708 environ[i] = environ[i+1];
1713 if (!environ[i]) { /* does not exist yet */
1714 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1715 environ[i+1] = NULL; /* make sure it's null terminated */
1718 safesysfree(environ[i]);
1722 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1723 /* all that work just for this */
1724 my_setenv_format(environ[i], nam, nlen, val, vlen);
1727 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1728 # if defined(HAS_UNSETENV)
1730 (void)unsetenv(nam);
1732 (void)setenv(nam, val, 1);
1734 # else /* ! HAS_UNSETENV */
1735 (void)setenv(nam, val, 1);
1736 # endif /* HAS_UNSETENV */
1738 # if defined(HAS_UNSETENV)
1740 (void)unsetenv(nam);
1742 const int nlen = strlen(nam);
1743 const int vlen = strlen(val);
1744 char * const new_env =
1745 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1746 my_setenv_format(new_env, nam, nlen, val, vlen);
1747 (void)putenv(new_env);
1749 # else /* ! HAS_UNSETENV */
1751 const int nlen = strlen(nam);
1757 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1758 /* all that work just for this */
1759 my_setenv_format(new_env, nam, nlen, val, vlen);
1760 (void)putenv(new_env);
1761 # endif /* HAS_UNSETENV */
1762 # endif /* __CYGWIN__ */
1763 #ifndef PERL_USE_SAFE_PUTENV
1769 #else /* WIN32 || NETWARE */
1772 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1775 register char *envstr;
1776 const int nlen = strlen(nam);
1783 Newx(envstr, nlen+vlen+2, char);
1784 my_setenv_format(envstr, nam, nlen, val, vlen);
1785 (void)PerlEnv_putenv(envstr);
1789 #endif /* WIN32 || NETWARE */
1791 #endif /* !VMS && !EPOC*/
1793 #ifdef UNLINK_ALL_VERSIONS
1795 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1799 PERL_ARGS_ASSERT_UNLNK;
1801 while (PerlLIO_unlink(f) >= 0)
1803 return retries ? 0 : -1;
1807 /* this is a drop-in replacement for bcopy() */
1808 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1810 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1812 char * const retval = to;
1814 PERL_ARGS_ASSERT_MY_BCOPY;
1816 if (from - to >= 0) {
1824 *(--to) = *(--from);
1830 /* this is a drop-in replacement for memset() */
1833 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1835 char * const retval = loc;
1837 PERL_ARGS_ASSERT_MY_MEMSET;
1845 /* this is a drop-in replacement for bzero() */
1846 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1848 Perl_my_bzero(register char *loc, register I32 len)
1850 char * const retval = loc;
1852 PERL_ARGS_ASSERT_MY_BZERO;
1860 /* this is a drop-in replacement for memcmp() */
1861 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1863 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1865 register const U8 *a = (const U8 *)s1;
1866 register const U8 *b = (const U8 *)s2;
1869 PERL_ARGS_ASSERT_MY_MEMCMP;
1872 if ((tmp = *a++ - *b++))
1877 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1880 /* This vsprintf replacement should generally never get used, since
1881 vsprintf was available in both System V and BSD 2.11. (There may
1882 be some cross-compilation or embedded set-ups where it is needed,
1885 If you encounter a problem in this function, it's probably a symptom
1886 that Configure failed to detect your system's vprintf() function.
1887 See the section on "item vsprintf" in the INSTALL file.
1889 This version may compile on systems with BSD-ish <stdio.h>,
1890 but probably won't on others.
1893 #ifdef USE_CHAR_VSPRINTF
1898 vsprintf(char *dest, const char *pat, void *args)
1902 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1903 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1904 FILE_cnt(&fakebuf) = 32767;
1906 /* These probably won't compile -- If you really need
1907 this, you'll have to figure out some other method. */
1908 fakebuf._ptr = dest;
1909 fakebuf._cnt = 32767;
1914 fakebuf._flag = _IOWRT|_IOSTRG;
1915 _doprnt(pat, args, &fakebuf); /* what a kludge */
1916 #if defined(STDIO_PTR_LVALUE)
1917 *(FILE_ptr(&fakebuf)++) = '\0';
1919 /* PerlIO has probably #defined away fputc, but we want it here. */
1921 # undef fputc /* XXX Should really restore it later */
1923 (void)fputc('\0', &fakebuf);
1925 #ifdef USE_CHAR_VSPRINTF
1928 return 0; /* perl doesn't use return value */
1932 #endif /* HAS_VPRINTF */
1935 #if BYTEORDER != 0x4321
1937 Perl_my_swap(pTHX_ short s)
1939 #if (BYTEORDER & 1) == 0
1942 result = ((s & 255) << 8) + ((s >> 8) & 255);
1950 Perl_my_htonl(pTHX_ long l)
1954 char c[sizeof(long)];
1957 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1958 #if BYTEORDER == 0x12345678
1961 u.c[0] = (l >> 24) & 255;
1962 u.c[1] = (l >> 16) & 255;
1963 u.c[2] = (l >> 8) & 255;
1967 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1968 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1973 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1974 u.c[o & 0xf] = (l >> s) & 255;
1982 Perl_my_ntohl(pTHX_ long l)
1986 char c[sizeof(long)];
1989 #if BYTEORDER == 0x1234
1990 u.c[0] = (l >> 24) & 255;
1991 u.c[1] = (l >> 16) & 255;
1992 u.c[2] = (l >> 8) & 255;
1996 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1997 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2004 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2005 l |= (u.c[o & 0xf] & 255) << s;
2012 #endif /* BYTEORDER != 0x4321 */
2016 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2017 * If these functions are defined,
2018 * the BYTEORDER is neither 0x1234 nor 0x4321.
2019 * However, this is not assumed.
2023 #define HTOLE(name,type) \
2025 name (register type n) \
2029 char c[sizeof(type)]; \
2032 register U32 s = 0; \
2033 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2034 u.c[i] = (n >> s) & 0xFF; \
2039 #define LETOH(name,type) \
2041 name (register type n) \
2045 char c[sizeof(type)]; \
2048 register U32 s = 0; \
2051 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2052 n |= ((type)(u.c[i] & 0xFF)) << s; \
2058 * Big-endian byte order functions.
2061 #define HTOBE(name,type) \
2063 name (register type n) \
2067 char c[sizeof(type)]; \
2070 register U32 s = 8*(sizeof(u.c)-1); \
2071 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2072 u.c[i] = (n >> s) & 0xFF; \
2077 #define BETOH(name,type) \
2079 name (register type n) \
2083 char c[sizeof(type)]; \
2086 register U32 s = 8*(sizeof(u.c)-1); \
2089 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2090 n |= ((type)(u.c[i] & 0xFF)) << s; \
2096 * If we just can't do it...
2099 #define NOT_AVAIL(name,type) \
2101 name (register type n) \
2103 Perl_croak_nocontext(#name "() not available"); \
2104 return n; /* not reached */ \
2108 #if defined(HAS_HTOVS) && !defined(htovs)
2111 #if defined(HAS_HTOVL) && !defined(htovl)
2114 #if defined(HAS_VTOHS) && !defined(vtohs)
2117 #if defined(HAS_VTOHL) && !defined(vtohl)
2121 #ifdef PERL_NEED_MY_HTOLE16
2123 HTOLE(Perl_my_htole16,U16)
2125 NOT_AVAIL(Perl_my_htole16,U16)
2128 #ifdef PERL_NEED_MY_LETOH16
2130 LETOH(Perl_my_letoh16,U16)
2132 NOT_AVAIL(Perl_my_letoh16,U16)
2135 #ifdef PERL_NEED_MY_HTOBE16
2137 HTOBE(Perl_my_htobe16,U16)
2139 NOT_AVAIL(Perl_my_htobe16,U16)
2142 #ifdef PERL_NEED_MY_BETOH16
2144 BETOH(Perl_my_betoh16,U16)
2146 NOT_AVAIL(Perl_my_betoh16,U16)
2150 #ifdef PERL_NEED_MY_HTOLE32
2152 HTOLE(Perl_my_htole32,U32)
2154 NOT_AVAIL(Perl_my_htole32,U32)
2157 #ifdef PERL_NEED_MY_LETOH32
2159 LETOH(Perl_my_letoh32,U32)
2161 NOT_AVAIL(Perl_my_letoh32,U32)
2164 #ifdef PERL_NEED_MY_HTOBE32
2166 HTOBE(Perl_my_htobe32,U32)
2168 NOT_AVAIL(Perl_my_htobe32,U32)
2171 #ifdef PERL_NEED_MY_BETOH32
2173 BETOH(Perl_my_betoh32,U32)
2175 NOT_AVAIL(Perl_my_betoh32,U32)
2179 #ifdef PERL_NEED_MY_HTOLE64
2181 HTOLE(Perl_my_htole64,U64)
2183 NOT_AVAIL(Perl_my_htole64,U64)
2186 #ifdef PERL_NEED_MY_LETOH64
2188 LETOH(Perl_my_letoh64,U64)
2190 NOT_AVAIL(Perl_my_letoh64,U64)
2193 #ifdef PERL_NEED_MY_HTOBE64
2195 HTOBE(Perl_my_htobe64,U64)
2197 NOT_AVAIL(Perl_my_htobe64,U64)
2200 #ifdef PERL_NEED_MY_BETOH64
2202 BETOH(Perl_my_betoh64,U64)
2204 NOT_AVAIL(Perl_my_betoh64,U64)
2208 #ifdef PERL_NEED_MY_HTOLES
2209 HTOLE(Perl_my_htoles,short)
2211 #ifdef PERL_NEED_MY_LETOHS
2212 LETOH(Perl_my_letohs,short)
2214 #ifdef PERL_NEED_MY_HTOBES
2215 HTOBE(Perl_my_htobes,short)
2217 #ifdef PERL_NEED_MY_BETOHS
2218 BETOH(Perl_my_betohs,short)
2221 #ifdef PERL_NEED_MY_HTOLEI
2222 HTOLE(Perl_my_htolei,int)
2224 #ifdef PERL_NEED_MY_LETOHI
2225 LETOH(Perl_my_letohi,int)
2227 #ifdef PERL_NEED_MY_HTOBEI
2228 HTOBE(Perl_my_htobei,int)
2230 #ifdef PERL_NEED_MY_BETOHI
2231 BETOH(Perl_my_betohi,int)
2234 #ifdef PERL_NEED_MY_HTOLEL
2235 HTOLE(Perl_my_htolel,long)
2237 #ifdef PERL_NEED_MY_LETOHL
2238 LETOH(Perl_my_letohl,long)
2240 #ifdef PERL_NEED_MY_HTOBEL
2241 HTOBE(Perl_my_htobel,long)
2243 #ifdef PERL_NEED_MY_BETOHL
2244 BETOH(Perl_my_betohl,long)
2248 Perl_my_swabn(void *ptr, int n)
2250 register char *s = (char *)ptr;
2251 register char *e = s + (n-1);
2254 PERL_ARGS_ASSERT_MY_SWABN;
2256 for (n /= 2; n > 0; s++, e--, n--) {
2264 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2266 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2269 register I32 This, that;
2275 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2277 PERL_FLUSHALL_FOR_CHILD;
2278 This = (*mode == 'w');
2282 taint_proper("Insecure %s%s", "EXEC");
2284 if (PerlProc_pipe(p) < 0)
2286 /* Try for another pipe pair for error return */
2287 if (PerlProc_pipe(pp) >= 0)
2289 while ((pid = PerlProc_fork()) < 0) {
2290 if (errno != EAGAIN) {
2291 PerlLIO_close(p[This]);
2292 PerlLIO_close(p[that]);
2294 PerlLIO_close(pp[0]);
2295 PerlLIO_close(pp[1]);
2299 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2308 /* Close parent's end of error status pipe (if any) */
2310 PerlLIO_close(pp[0]);
2311 #if defined(HAS_FCNTL) && defined(F_SETFD)
2312 /* Close error pipe automatically if exec works */
2313 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2316 /* Now dup our end of _the_ pipe to right position */
2317 if (p[THIS] != (*mode == 'r')) {
2318 PerlLIO_dup2(p[THIS], *mode == 'r');
2319 PerlLIO_close(p[THIS]);
2320 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2321 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2324 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2325 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2326 /* No automatic close - do it by hand */
2333 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2339 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2345 do_execfree(); /* free any memory malloced by child on fork */
2347 PerlLIO_close(pp[1]);
2348 /* Keep the lower of the two fd numbers */
2349 if (p[that] < p[This]) {
2350 PerlLIO_dup2(p[This], p[that]);
2351 PerlLIO_close(p[This]);
2355 PerlLIO_close(p[that]); /* close child's end of pipe */
2357 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2358 SvUPGRADE(sv,SVt_IV);
2360 PL_forkprocess = pid;
2361 /* If we managed to get status pipe check for exec fail */
2362 if (did_pipes && pid > 0) {
2367 while (n < sizeof(int)) {
2368 n1 = PerlLIO_read(pp[0],
2369 (void*)(((char*)&errkid)+n),
2375 PerlLIO_close(pp[0]);
2377 if (n) { /* Error */
2379 PerlLIO_close(p[This]);
2380 if (n != sizeof(int))
2381 Perl_croak(aTHX_ "panic: kid popen errno read");
2383 pid2 = wait4pid(pid, &status, 0);
2384 } while (pid2 == -1 && errno == EINTR);
2385 errno = errkid; /* Propagate errno from kid */
2390 PerlLIO_close(pp[0]);
2391 return PerlIO_fdopen(p[This], mode);
2393 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2394 return my_syspopen4(aTHX_ NULL, mode, n, args);
2396 Perl_croak(aTHX_ "List form of piped open not implemented");
2397 return (PerlIO *) NULL;
2402 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2403 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2405 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2409 register I32 This, that;
2412 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2416 PERL_ARGS_ASSERT_MY_POPEN;
2418 PERL_FLUSHALL_FOR_CHILD;
2421 return my_syspopen(aTHX_ cmd,mode);
2424 This = (*mode == 'w');
2426 if (doexec && PL_tainting) {
2428 taint_proper("Insecure %s%s", "EXEC");
2430 if (PerlProc_pipe(p) < 0)
2432 if (doexec && PerlProc_pipe(pp) >= 0)
2434 while ((pid = PerlProc_fork()) < 0) {
2435 if (errno != EAGAIN) {
2436 PerlLIO_close(p[This]);
2437 PerlLIO_close(p[that]);
2439 PerlLIO_close(pp[0]);
2440 PerlLIO_close(pp[1]);
2443 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2446 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2457 PerlLIO_close(pp[0]);
2458 #if defined(HAS_FCNTL) && defined(F_SETFD)
2459 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2462 if (p[THIS] != (*mode == 'r')) {
2463 PerlLIO_dup2(p[THIS], *mode == 'r');
2464 PerlLIO_close(p[THIS]);
2465 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2466 PerlLIO_close(p[THAT]);
2469 PerlLIO_close(p[THAT]);
2472 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2479 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2484 /* may or may not use the shell */
2485 do_exec3(cmd, pp[1], did_pipes);
2488 #endif /* defined OS2 */
2490 #ifdef PERLIO_USING_CRLF
2491 /* Since we circumvent IO layers when we manipulate low-level
2492 filedescriptors directly, need to manually switch to the
2493 default, binary, low-level mode; see PerlIOBuf_open(). */
2494 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2497 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2498 SvREADONLY_off(GvSV(tmpgv));
2499 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2500 SvREADONLY_on(GvSV(tmpgv));
2502 #ifdef THREADS_HAVE_PIDS
2503 PL_ppid = (IV)getppid();
2506 #ifdef PERL_USES_PL_PIDSTATUS
2507 hv_clear(PL_pidstatus); /* we have no children */
2513 do_execfree(); /* free any memory malloced by child on vfork */
2515 PerlLIO_close(pp[1]);
2516 if (p[that] < p[This]) {
2517 PerlLIO_dup2(p[This], p[that]);
2518 PerlLIO_close(p[This]);
2522 PerlLIO_close(p[that]);
2524 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2525 SvUPGRADE(sv,SVt_IV);
2527 PL_forkprocess = pid;
2528 if (did_pipes && pid > 0) {
2533 while (n < sizeof(int)) {
2534 n1 = PerlLIO_read(pp[0],
2535 (void*)(((char*)&errkid)+n),
2541 PerlLIO_close(pp[0]);
2543 if (n) { /* Error */
2545 PerlLIO_close(p[This]);
2546 if (n != sizeof(int))
2547 Perl_croak(aTHX_ "panic: kid popen errno read");
2549 pid2 = wait4pid(pid, &status, 0);
2550 } while (pid2 == -1 && errno == EINTR);
2551 errno = errkid; /* Propagate errno from kid */
2556 PerlLIO_close(pp[0]);
2557 return PerlIO_fdopen(p[This], mode);
2560 #if defined(atarist) || defined(EPOC)
2563 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2565 PERL_ARGS_ASSERT_MY_POPEN;
2566 PERL_FLUSHALL_FOR_CHILD;
2567 /* Call system's popen() to get a FILE *, then import it.
2568 used 0 for 2nd parameter to PerlIO_importFILE;
2571 return PerlIO_importFILE(popen(cmd, mode), 0);
2575 FILE *djgpp_popen();
2577 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2579 PERL_FLUSHALL_FOR_CHILD;
2580 /* Call system's popen() to get a FILE *, then import it.
2581 used 0 for 2nd parameter to PerlIO_importFILE;
2584 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2587 #if defined(__LIBCATAMOUNT__)
2589 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2597 #endif /* !DOSISH */
2599 /* this is called in parent before the fork() */
2601 Perl_atfork_lock(void)
2604 #if defined(USE_ITHREADS)
2605 /* locks must be held in locking order (if any) */
2607 MUTEX_LOCK(&PL_malloc_mutex);
2613 /* this is called in both parent and child after the fork() */
2615 Perl_atfork_unlock(void)
2618 #if defined(USE_ITHREADS)
2619 /* locks must be released in same order as in atfork_lock() */
2621 MUTEX_UNLOCK(&PL_malloc_mutex);
2630 #if defined(HAS_FORK)
2632 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2637 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2638 * handlers elsewhere in the code */
2643 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2644 Perl_croak_nocontext("fork() not available");
2646 #endif /* HAS_FORK */
2651 Perl_dump_fds(pTHX_ const char *const s)
2656 PERL_ARGS_ASSERT_DUMP_FDS;
2658 PerlIO_printf(Perl_debug_log,"%s", s);
2659 for (fd = 0; fd < 32; fd++) {
2660 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2661 PerlIO_printf(Perl_debug_log," %d",fd);
2663 PerlIO_printf(Perl_debug_log,"\n");
2666 #endif /* DUMP_FDS */
2670 dup2(int oldfd, int newfd)
2672 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2675 PerlLIO_close(newfd);
2676 return fcntl(oldfd, F_DUPFD, newfd);
2678 #define DUP2_MAX_FDS 256
2679 int fdtmp[DUP2_MAX_FDS];
2685 PerlLIO_close(newfd);
2686 /* good enough for low fd's... */
2687 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2688 if (fdx >= DUP2_MAX_FDS) {
2696 PerlLIO_close(fdtmp[--fdx]);
2703 #ifdef HAS_SIGACTION
2706 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2709 struct sigaction act, oact;
2712 /* only "parent" interpreter can diddle signals */
2713 if (PL_curinterp != aTHX)
2714 return (Sighandler_t) SIG_ERR;
2717 act.sa_handler = (void(*)(int))handler;
2718 sigemptyset(&act.sa_mask);
2721 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2722 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2724 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2725 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2726 act.sa_flags |= SA_NOCLDWAIT;
2728 if (sigaction(signo, &act, &oact) == -1)
2729 return (Sighandler_t) SIG_ERR;
2731 return (Sighandler_t) oact.sa_handler;
2735 Perl_rsignal_state(pTHX_ int signo)
2737 struct sigaction oact;
2738 PERL_UNUSED_CONTEXT;
2740 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2741 return (Sighandler_t) SIG_ERR;
2743 return (Sighandler_t) oact.sa_handler;
2747 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2750 struct sigaction act;
2752 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2755 /* only "parent" interpreter can diddle signals */
2756 if (PL_curinterp != aTHX)
2760 act.sa_handler = (void(*)(int))handler;
2761 sigemptyset(&act.sa_mask);
2764 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2765 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2767 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2768 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2769 act.sa_flags |= SA_NOCLDWAIT;
2771 return sigaction(signo, &act, save);
2775 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2779 /* only "parent" interpreter can diddle signals */
2780 if (PL_curinterp != aTHX)
2784 return sigaction(signo, save, (struct sigaction *)NULL);
2787 #else /* !HAS_SIGACTION */
2790 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2792 #if defined(USE_ITHREADS) && !defined(WIN32)
2793 /* only "parent" interpreter can diddle signals */
2794 if (PL_curinterp != aTHX)
2795 return (Sighandler_t) SIG_ERR;
2798 return PerlProc_signal(signo, handler);
2809 Perl_rsignal_state(pTHX_ int signo)
2812 Sighandler_t oldsig;
2814 #if defined(USE_ITHREADS) && !defined(WIN32)
2815 /* only "parent" interpreter can diddle signals */
2816 if (PL_curinterp != aTHX)
2817 return (Sighandler_t) SIG_ERR;
2821 oldsig = PerlProc_signal(signo, sig_trap);
2822 PerlProc_signal(signo, oldsig);
2824 PerlProc_kill(PerlProc_getpid(), signo);
2829 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2831 #if defined(USE_ITHREADS) && !defined(WIN32)
2832 /* only "parent" interpreter can diddle signals */
2833 if (PL_curinterp != aTHX)
2836 *save = PerlProc_signal(signo, handler);
2837 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2841 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2843 #if defined(USE_ITHREADS) && !defined(WIN32)
2844 /* only "parent" interpreter can diddle signals */
2845 if (PL_curinterp != aTHX)
2848 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2851 #endif /* !HAS_SIGACTION */
2852 #endif /* !PERL_MICRO */
2854 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2855 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2857 Perl_my_pclose(pTHX_ PerlIO *ptr)
2860 Sigsave_t hstat, istat, qstat;
2868 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2869 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2871 *svp = &PL_sv_undef;
2873 if (pid == -1) { /* Opened by popen. */
2874 return my_syspclose(ptr);
2877 close_failed = (PerlIO_close(ptr) == EOF);
2880 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2883 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2884 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2885 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2888 pid2 = wait4pid(pid, &status, 0);
2889 } while (pid2 == -1 && errno == EINTR);
2891 rsignal_restore(SIGHUP, &hstat);
2892 rsignal_restore(SIGINT, &istat);
2893 rsignal_restore(SIGQUIT, &qstat);
2899 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2902 #if defined(__LIBCATAMOUNT__)
2904 Perl_my_pclose(pTHX_ PerlIO *ptr)
2909 #endif /* !DOSISH */
2911 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2913 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2917 PERL_ARGS_ASSERT_WAIT4PID;
2920 #ifdef PERL_USES_PL_PIDSTATUS
2923 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2924 pid, rather than a string form. */
2925 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2926 if (svp && *svp != &PL_sv_undef) {
2927 *statusp = SvIVX(*svp);
2928 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2936 hv_iterinit(PL_pidstatus);
2937 if ((entry = hv_iternext(PL_pidstatus))) {
2938 SV * const sv = hv_iterval(PL_pidstatus,entry);
2940 const char * const spid = hv_iterkey(entry,&len);
2942 assert (len == sizeof(Pid_t));
2943 memcpy((char *)&pid, spid, len);
2944 *statusp = SvIVX(sv);
2945 /* The hash iterator is currently on this entry, so simply
2946 calling hv_delete would trigger the lazy delete, which on
2947 aggregate does more work, beacuse next call to hv_iterinit()
2948 would spot the flag, and have to call the delete routine,
2949 while in the meantime any new entries can't re-use that
2951 hv_iterinit(PL_pidstatus);
2952 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2959 # ifdef HAS_WAITPID_RUNTIME
2960 if (!HAS_WAITPID_RUNTIME)
2963 result = PerlProc_waitpid(pid,statusp,flags);
2966 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2967 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2970 #ifdef PERL_USES_PL_PIDSTATUS
2971 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2976 Perl_croak(aTHX_ "Can't do waitpid with flags");
2978 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2979 pidgone(result,*statusp);
2985 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2988 if (result < 0 && errno == EINTR) {
2990 errno = EINTR; /* reset in case a signal handler changed $! */
2994 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2996 #ifdef PERL_USES_PL_PIDSTATUS
2998 S_pidgone(pTHX_ Pid_t pid, int status)
3002 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3003 SvUPGRADE(sv,SVt_IV);
3004 SvIV_set(sv, status);
3009 #if defined(atarist) || defined(OS2) || defined(EPOC)
3012 int /* Cannot prototype with I32
3014 my_syspclose(PerlIO *ptr)
3017 Perl_my_pclose(pTHX_ PerlIO *ptr)
3020 /* Needs work for PerlIO ! */
3021 FILE * const f = PerlIO_findFILE(ptr);
3022 const I32 result = pclose(f);
3023 PerlIO_releaseFILE(ptr,f);
3031 Perl_my_pclose(pTHX_ PerlIO *ptr)
3033 /* Needs work for PerlIO ! */
3034 FILE * const f = PerlIO_findFILE(ptr);
3035 I32 result = djgpp_pclose(f);
3036 result = (result << 8) & 0xff00;
3037 PerlIO_releaseFILE(ptr,f);
3042 #define PERL_REPEATCPY_LINEAR 4
3044 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3046 PERL_ARGS_ASSERT_REPEATCPY;
3049 memset(to, *from, count);
3051 register char *p = to;
3052 I32 items, linear, half;
3054 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3055 for (items = 0; items < linear; ++items) {
3056 register const char *q = from;
3058 for (todo = len; todo > 0; todo--)
3063 while (items <= half) {
3064 I32 size = items * len;
3065 memcpy(p, to, size);
3071 memcpy(p, to, (count - items) * len);
3077 Perl_same_dirent(pTHX_ const char *a, const char *b)
3079 char *fa = strrchr(a,'/');
3080 char *fb = strrchr(b,'/');
3083 SV * const tmpsv = sv_newmortal();
3085 PERL_ARGS_ASSERT_SAME_DIRENT;
3098 sv_setpvs(tmpsv, ".");
3100 sv_setpvn(tmpsv, a, fa - a);
3101 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3104 sv_setpvs(tmpsv, ".");
3106 sv_setpvn(tmpsv, b, fb - b);
3107 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3109 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3110 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3112 #endif /* !HAS_RENAME */
3115 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3116 const char *const *const search_ext, I32 flags)
3119 const char *xfound = NULL;
3120 char *xfailed = NULL;
3121 char tmpbuf[MAXPATHLEN];
3126 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3127 # define SEARCH_EXTS ".bat", ".cmd", NULL
3128 # define MAX_EXT_LEN 4
3131 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3132 # define MAX_EXT_LEN 4
3135 # define SEARCH_EXTS ".pl", ".com", NULL
3136 # define MAX_EXT_LEN 4
3138 /* additional extensions to try in each dir if scriptname not found */
3140 static const char *const exts[] = { SEARCH_EXTS };
3141 const char *const *const ext = search_ext ? search_ext : exts;
3142 int extidx = 0, i = 0;
3143 const char *curext = NULL;
3145 PERL_UNUSED_ARG(search_ext);
3146 # define MAX_EXT_LEN 0
3149 PERL_ARGS_ASSERT_FIND_SCRIPT;
3152 * If dosearch is true and if scriptname does not contain path
3153 * delimiters, search the PATH for scriptname.
3155 * If SEARCH_EXTS is also defined, will look for each
3156 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3157 * while searching the PATH.
3159 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3160 * proceeds as follows:
3161 * If DOSISH or VMSISH:
3162 * + look for ./scriptname{,.foo,.bar}
3163 * + search the PATH for scriptname{,.foo,.bar}
3166 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3167 * this will not look in '.' if it's not in the PATH)
3172 # ifdef ALWAYS_DEFTYPES
3173 len = strlen(scriptname);
3174 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3175 int idx = 0, deftypes = 1;
3178 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3181 int idx = 0, deftypes = 1;
3184 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3186 /* The first time through, just add SEARCH_EXTS to whatever we
3187 * already have, so we can check for default file types. */
3189 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3195 if ((strlen(tmpbuf) + strlen(scriptname)
3196 + MAX_EXT_LEN) >= sizeof tmpbuf)
3197 continue; /* don't search dir with too-long name */
3198 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3202 if (strEQ(scriptname, "-"))
3204 if (dosearch) { /* Look in '.' first. */
3205 const char *cur = scriptname;
3207 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3209 if (strEQ(ext[i++],curext)) {
3210 extidx = -1; /* already has an ext */
3215 DEBUG_p(PerlIO_printf(Perl_debug_log,
3216 "Looking for %s\n",cur));
3217 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3218 && !S_ISDIR(PL_statbuf.st_mode)) {
3226 if (cur == scriptname) {
3227 len = strlen(scriptname);
3228 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3230 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3233 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3234 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3239 if (dosearch && !strchr(scriptname, '/')
3241 && !strchr(scriptname, '\\')
3243 && (s = PerlEnv_getenv("PATH")))
3247 bufend = s + strlen(s);
3248 while (s < bufend) {
3249 #if defined(atarist) || defined(DOSISH)
3254 && *s != ';'; len++, s++) {
3255 if (len < sizeof tmpbuf)
3258 if (len < sizeof tmpbuf)
3260 #else /* ! (atarist || DOSISH) */
3261 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3264 #endif /* ! (atarist || DOSISH) */
3267 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3268 continue; /* don't search dir with too-long name */
3270 # if defined(atarist) || defined(DOSISH)
3271 && tmpbuf[len - 1] != '/'
3272 && tmpbuf[len - 1] != '\\'
3275 tmpbuf[len++] = '/';
3276 if (len == 2 && tmpbuf[0] == '.')
3278 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3282 len = strlen(tmpbuf);
3283 if (extidx > 0) /* reset after previous loop */
3287 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3288 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3289 if (S_ISDIR(PL_statbuf.st_mode)) {
3293 } while ( retval < 0 /* not there */
3294 && extidx>=0 && ext[extidx] /* try an extension? */
3295 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3300 if (S_ISREG(PL_statbuf.st_mode)
3301 && cando(S_IRUSR,TRUE,&PL_statbuf)
3302 #if !defined(DOSISH)
3303 && cando(S_IXUSR,TRUE,&PL_statbuf)
3307 xfound = tmpbuf; /* bingo! */
3311 xfailed = savepv(tmpbuf);
3314 if (!xfound && !seen_dot && !xfailed &&
3315 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3316 || S_ISDIR(PL_statbuf.st_mode)))
3318 seen_dot = 1; /* Disable message. */
3320 if (flags & 1) { /* do or die? */
3321 Perl_croak(aTHX_ "Can't %s %s%s%s",
3322 (xfailed ? "execute" : "find"),
3323 (xfailed ? xfailed : scriptname),
3324 (xfailed ? "" : " on PATH"),
3325 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3330 scriptname = xfound;
3332 return (scriptname ? savepv(scriptname) : NULL);
3335 #ifndef PERL_GET_CONTEXT_DEFINED
3338 Perl_get_context(void)
3341 #if defined(USE_ITHREADS)
3342 # ifdef OLD_PTHREADS_API
3344 if (pthread_getspecific(PL_thr_key, &t))
3345 Perl_croak_nocontext("panic: pthread_getspecific");
3348 # ifdef I_MACH_CTHREADS
3349 return (void*)cthread_data(cthread_self());
3351 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3360 Perl_set_context(void *t)
3363 PERL_ARGS_ASSERT_SET_CONTEXT;
3364 #if defined(USE_ITHREADS)
3365 # ifdef I_MACH_CTHREADS
3366 cthread_set_data(cthread_self(), t);
3368 if (pthread_setspecific(PL_thr_key, t))
3369 Perl_croak_nocontext("panic: pthread_setspecific");
3376 #endif /* !PERL_GET_CONTEXT_DEFINED */
3378 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3387 Perl_get_op_names(pTHX)
3389 PERL_UNUSED_CONTEXT;
3390 return (char **)PL_op_name;
3394 Perl_get_op_descs(pTHX)
3396 PERL_UNUSED_CONTEXT;
3397 return (char **)PL_op_desc;
3401 Perl_get_no_modify(pTHX)
3403 PERL_UNUSED_CONTEXT;
3404 return PL_no_modify;
3408 Perl_get_opargs(pTHX)
3410 PERL_UNUSED_CONTEXT;
3411 return (U32 *)PL_opargs;
3415 Perl_get_ppaddr(pTHX)
3418 PERL_UNUSED_CONTEXT;
3419 return (PPADDR_t*)PL_ppaddr;
3422 #ifndef HAS_GETENV_LEN
3424 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3426 char * const env_trans = PerlEnv_getenv(env_elem);
3427 PERL_UNUSED_CONTEXT;
3428 PERL_ARGS_ASSERT_GETENV_LEN;
3430 *len = strlen(env_trans);
3437 Perl_get_vtbl(pTHX_ int vtbl_id)
3439 const MGVTBL* result;
3440 PERL_UNUSED_CONTEXT;
3444 result = &PL_vtbl_sv;
3447 result = &PL_vtbl_env;
3449 case want_vtbl_envelem:
3450 result = &PL_vtbl_envelem;
3453 result = &PL_vtbl_sig;
3455 case want_vtbl_sigelem:
3456 result = &PL_vtbl_sigelem;
3458 case want_vtbl_pack:
3459 result = &PL_vtbl_pack;
3461 case want_vtbl_packelem:
3462 result = &PL_vtbl_packelem;
3464 case want_vtbl_dbline:
3465 result = &PL_vtbl_dbline;
3468 result = &PL_vtbl_isa;
3470 case want_vtbl_isaelem:
3471 result = &PL_vtbl_isaelem;
3473 case want_vtbl_arylen:
3474 result = &PL_vtbl_arylen;
3476 case want_vtbl_mglob:
3477 result = &PL_vtbl_mglob;
3479 case want_vtbl_nkeys:
3480 result = &PL_vtbl_nkeys;
3482 case want_vtbl_taint:
3483 result = &PL_vtbl_taint;
3485 case want_vtbl_substr:
3486 result = &PL_vtbl_substr;
3489 result = &PL_vtbl_vec;
3492 result = &PL_vtbl_pos;
3495 result = &PL_vtbl_bm;
3498 result = &PL_vtbl_fm;
3500 case want_vtbl_uvar:
3501 result = &PL_vtbl_uvar;
3503 case want_vtbl_defelem:
3504 result = &PL_vtbl_defelem;
3506 case want_vtbl_regexp:
3507 result = &PL_vtbl_regexp;
3509 case want_vtbl_regdata:
3510 result = &PL_vtbl_regdata;
3512 case want_vtbl_regdatum:
3513 result = &PL_vtbl_regdatum;
3515 #ifdef USE_LOCALE_COLLATE
3516 case want_vtbl_collxfrm:
3517 result = &PL_vtbl_collxfrm;
3520 case want_vtbl_amagic:
3521 result = &PL_vtbl_amagic;
3523 case want_vtbl_amagicelem:
3524 result = &PL_vtbl_amagicelem;
3526 case want_vtbl_backref:
3527 result = &PL_vtbl_backref;
3529 case want_vtbl_utf8:
3530 result = &PL_vtbl_utf8;
3536 return (MGVTBL*)result;
3540 Perl_my_fflush_all(pTHX)
3542 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3543 return PerlIO_flush(NULL);
3545 # if defined(HAS__FWALK)
3546 extern int fflush(FILE *);
3547 /* undocumented, unprototyped, but very useful BSDism */
3548 extern void _fwalk(int (*)(FILE *));
3552 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3554 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3555 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3557 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3558 open_max = sysconf(_SC_OPEN_MAX);
3561 open_max = FOPEN_MAX;
3564 open_max = OPEN_MAX;
3575 for (i = 0; i < open_max; i++)
3576 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3577 STDIO_STREAM_ARRAY[i]._file < open_max &&
3578 STDIO_STREAM_ARRAY[i]._flag)
3579 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3583 SETERRNO(EBADF,RMS_IFI);
3590 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3592 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3594 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3595 if (ckWARN(WARN_IO)) {
3596 const char * const direction =
3597 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3599 Perl_warner(aTHX_ packWARN(WARN_IO),
3600 "Filehandle %s opened only for %sput",
3603 Perl_warner(aTHX_ packWARN(WARN_IO),
3604 "Filehandle opened only for %sput", direction);
3611 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3613 warn_type = WARN_CLOSED;
3617 warn_type = WARN_UNOPENED;
3620 if (ckWARN(warn_type)) {
3621 const char * const pars =
3622 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3623 const char * const func =
3625 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3626 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3627 op < 0 ? "" : /* handle phoney cases */
3629 const char * const type =
3631 (OP_IS_SOCKET(op) ||
3632 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3633 "socket" : "filehandle");
3634 if (name && *name) {
3635 Perl_warner(aTHX_ packWARN(warn_type),
3636 "%s%s on %s %s %s", func, pars, vile, type, name);
3637 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3639 aTHX_ packWARN(warn_type),
3640 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3645 Perl_warner(aTHX_ packWARN(warn_type),
3646 "%s%s on %s %s", func, pars, vile, type);
3647 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3649 aTHX_ packWARN(warn_type),
3650 "\t(Are you trying to call %s%s on dirhandle?)\n",
3659 /* in ASCII order, not that it matters */
3660 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3663 Perl_ebcdic_control(pTHX_ int ch)
3671 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3672 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3675 if (ctlp == controllablechars)
3676 return('\177'); /* DEL */
3678 return((unsigned char)(ctlp - controllablechars - 1));
3679 } else { /* Want uncontrol */
3680 if (ch == '\177' || ch == -1)
3682 else if (ch == '\157')
3684 else if (ch == '\174')
3686 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3688 else if (ch == '\155')
3690 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3691 return(controllablechars[ch+1]);
3693 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3698 /* To workaround core dumps from the uninitialised tm_zone we get the
3699 * system to give us a reasonable struct to copy. This fix means that
3700 * strftime uses the tm_zone and tm_gmtoff values returned by
3701 * localtime(time()). That should give the desired result most of the
3702 * time. But probably not always!
3704 * This does not address tzname aspects of NETaa14816.
3709 # ifndef STRUCT_TM_HASZONE
3710 # define STRUCT_TM_HASZONE
3714 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3715 # ifndef HAS_TM_TM_ZONE
3716 # define HAS_TM_TM_ZONE
3721 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3723 #ifdef HAS_TM_TM_ZONE
3725 const struct tm* my_tm;
3726 PERL_ARGS_ASSERT_INIT_TM;
3728 my_tm = localtime(&now);
3730 Copy(my_tm, ptm, 1, struct tm);
3732 PERL_ARGS_ASSERT_INIT_TM;
3733 PERL_UNUSED_ARG(ptm);
3738 * mini_mktime - normalise struct tm values without the localtime()
3739 * semantics (and overhead) of mktime().
3742 Perl_mini_mktime(pTHX_ struct tm *ptm)
3746 int month, mday, year, jday;
3747 int odd_cent, odd_year;
3748 PERL_UNUSED_CONTEXT;
3750 PERL_ARGS_ASSERT_MINI_MKTIME;
3752 #define DAYS_PER_YEAR 365
3753 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3754 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3755 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3756 #define SECS_PER_HOUR (60*60)
3757 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3758 /* parentheses deliberately absent on these two, otherwise they don't work */
3759 #define MONTH_TO_DAYS 153/5
3760 #define DAYS_TO_MONTH 5/153
3761 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3762 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3763 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3764 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3767 * Year/day algorithm notes:
3769 * With a suitable offset for numeric value of the month, one can find
3770 * an offset into the year by considering months to have 30.6 (153/5) days,
3771 * using integer arithmetic (i.e., with truncation). To avoid too much
3772 * messing about with leap days, we consider January and February to be
3773 * the 13th and 14th month of the previous year. After that transformation,
3774 * we need the month index we use to be high by 1 from 'normal human' usage,
3775 * so the month index values we use run from 4 through 15.
3777 * Given that, and the rules for the Gregorian calendar (leap years are those
3778 * divisible by 4 unless also divisible by 100, when they must be divisible
3779 * by 400 instead), we can simply calculate the number of days since some
3780 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3781 * the days we derive from our month index, and adding in the day of the
3782 * month. The value used here is not adjusted for the actual origin which
3783 * it normally would use (1 January A.D. 1), since we're not exposing it.
3784 * We're only building the value so we can turn around and get the
3785 * normalised values for the year, month, day-of-month, and day-of-year.
3787 * For going backward, we need to bias the value we're using so that we find
3788 * the right year value. (Basically, we don't want the contribution of
3789 * March 1st to the number to apply while deriving the year). Having done
3790 * that, we 'count up' the contribution to the year number by accounting for
3791 * full quadracenturies (400-year periods) with their extra leap days, plus
3792 * the contribution from full centuries (to avoid counting in the lost leap
3793 * days), plus the contribution from full quad-years (to count in the normal
3794 * leap days), plus the leftover contribution from any non-leap years.
3795 * At this point, if we were working with an actual leap day, we'll have 0
3796 * days left over. This is also true for March 1st, however. So, we have
3797 * to special-case that result, and (earlier) keep track of the 'odd'
3798 * century and year contributions. If we got 4 extra centuries in a qcent,
3799 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3800 * Otherwise, we add back in the earlier bias we removed (the 123 from
3801 * figuring in March 1st), find the month index (integer division by 30.6),
3802 * and the remainder is the day-of-month. We then have to convert back to
3803 * 'real' months (including fixing January and February from being 14/15 in
3804 * the previous year to being in the proper year). After that, to get
3805 * tm_yday, we work with the normalised year and get a new yearday value for
3806 * January 1st, which we subtract from the yearday value we had earlier,
3807 * representing the date we've re-built. This is done from January 1
3808 * because tm_yday is 0-origin.
3810 * Since POSIX time routines are only guaranteed to work for times since the
3811 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3812 * applies Gregorian calendar rules even to dates before the 16th century
3813 * doesn't bother me. Besides, you'd need cultural context for a given
3814 * date to know whether it was Julian or Gregorian calendar, and that's
3815 * outside the scope for this routine. Since we convert back based on the
3816 * same rules we used to build the yearday, you'll only get strange results
3817 * for input which needed normalising, or for the 'odd' century years which
3818 * were leap years in the Julian calander but not in the Gregorian one.
3819 * I can live with that.
3821 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3822 * that's still outside the scope for POSIX time manipulation, so I don't
3826 year = 1900 + ptm->tm_year;
3827 month = ptm->tm_mon;
3828 mday = ptm->tm_mday;
3829 /* allow given yday with no month & mday to dominate the result */
3830 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3833 jday = 1 + ptm->tm_yday;
3842 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3843 yearday += month*MONTH_TO_DAYS + mday + jday;
3845 * Note that we don't know when leap-seconds were or will be,
3846 * so we have to trust the user if we get something which looks
3847 * like a sensible leap-second. Wild values for seconds will
3848 * be rationalised, however.
3850 if ((unsigned) ptm->tm_sec <= 60) {
3857 secs += 60 * ptm->tm_min;
3858 secs += SECS_PER_HOUR * ptm->tm_hour;
3860 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3861 /* got negative remainder, but need positive time */
3862 /* back off an extra day to compensate */
3863 yearday += (secs/SECS_PER_DAY)-1;
3864 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3867 yearday += (secs/SECS_PER_DAY);
3868 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3871 else if (secs >= SECS_PER_DAY) {
3872 yearday += (secs/SECS_PER_DAY);
3873 secs %= SECS_PER_DAY;
3875 ptm->tm_hour = secs/SECS_PER_HOUR;
3876 secs %= SECS_PER_HOUR;
3877 ptm->tm_min = secs/60;
3879 ptm->tm_sec += secs;
3880 /* done with time of day effects */
3882 * The algorithm for yearday has (so far) left it high by 428.
3883 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3884 * bias it by 123 while trying to figure out what year it
3885 * really represents. Even with this tweak, the reverse
3886 * translation fails for years before A.D. 0001.
3887 * It would still fail for Feb 29, but we catch that one below.
3889 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3890 yearday -= YEAR_ADJUST;
3891 year = (yearday / DAYS_PER_QCENT) * 400;
3892 yearday %= DAYS_PER_QCENT;
3893 odd_cent = yearday / DAYS_PER_CENT;
3894 year += odd_cent * 100;
3895 yearday %= DAYS_PER_CENT;
3896 year += (yearday / DAYS_PER_QYEAR) * 4;
3897 yearday %= DAYS_PER_QYEAR;
3898 odd_year = yearday / DAYS_PER_YEAR;
3900 yearday %= DAYS_PER_YEAR;
3901 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3906 yearday += YEAR_ADJUST; /* recover March 1st crock */
3907 month = yearday*DAYS_TO_MONTH;
3908 yearday -= month*MONTH_TO_DAYS;
3909 /* recover other leap-year adjustment */
3918 ptm->tm_year = year - 1900;
3920 ptm->tm_mday = yearday;
3921 ptm->tm_mon = month;
3925 ptm->tm_mon = month - 1;
3927 /* re-build yearday based on Jan 1 to get tm_yday */
3929 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3930 yearday += 14*MONTH_TO_DAYS + 1;
3931 ptm->tm_yday = jday - yearday;
3932 /* fix tm_wday if not overridden by caller */
3933 if ((unsigned)ptm->tm_wday > 6)
3934 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3938 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)
3946 PERL_ARGS_ASSERT_MY_STRFTIME;
3948 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3951 mytm.tm_hour = hour;
3952 mytm.tm_mday = mday;
3954 mytm.tm_year = year;
3955 mytm.tm_wday = wday;
3956 mytm.tm_yday = yday;
3957 mytm.tm_isdst = isdst;
3959 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3960 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3965 #ifdef HAS_TM_TM_GMTOFF
3966 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3968 #ifdef HAS_TM_TM_ZONE
3969 mytm.tm_zone = mytm2.tm_zone;
3974 Newx(buf, buflen, char);
3975 len = strftime(buf, buflen, fmt, &mytm);
3977 ** The following is needed to handle to the situation where
3978 ** tmpbuf overflows. Basically we want to allocate a buffer
3979 ** and try repeatedly. The reason why it is so complicated
3980 ** is that getting a return value of 0 from strftime can indicate
3981 ** one of the following:
3982 ** 1. buffer overflowed,
3983 ** 2. illegal conversion specifier, or
3984 ** 3. the format string specifies nothing to be returned(not
3985 ** an error). This could be because format is an empty string
3986 ** or it specifies %p that yields an empty string in some locale.
3987 ** If there is a better way to make it portable, go ahead by
3990 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3993 /* Possibly buf overflowed - try again with a bigger buf */
3994 const int fmtlen = strlen(fmt);
3995 int bufsize = fmtlen + buflen;
3997 Newx(buf, bufsize, char);
3999 buflen = strftime(buf, bufsize, fmt, &mytm);
4000 if (buflen > 0 && buflen < bufsize)
4002 /* heuristic to prevent out-of-memory errors */
4003 if (bufsize > 100*fmtlen) {
4009 Renew(buf, bufsize, char);
4014 Perl_croak(aTHX_ "panic: no strftime");
4020 #define SV_CWD_RETURN_UNDEF \
4021 sv_setsv(sv, &PL_sv_undef); \
4024 #define SV_CWD_ISDOT(dp) \
4025 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4026 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4029 =head1 Miscellaneous Functions
4031 =for apidoc getcwd_sv
4033 Fill the sv with current working directory
4038 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4039 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4040 * getcwd(3) if available
4041 * Comments from the orignal:
4042 * This is a faster version of getcwd. It's also more dangerous
4043 * because you might chdir out of a directory that you can't chdir
4047 Perl_getcwd_sv(pTHX_ register SV *sv)
4051 #ifndef INCOMPLETE_TAINTS
4055 PERL_ARGS_ASSERT_GETCWD_SV;
4059 char buf[MAXPATHLEN];
4061 /* Some getcwd()s automatically allocate a buffer of the given
4062 * size from the heap if they are given a NULL buffer pointer.
4063 * The problem is that this behaviour is not portable. */
4064 if (getcwd(buf, sizeof(buf) - 1)) {
4069 sv_setsv(sv, &PL_sv_undef);
4077 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4081 SvUPGRADE(sv, SVt_PV);
4083 if (PerlLIO_lstat(".", &statbuf) < 0) {
4084 SV_CWD_RETURN_UNDEF;
4087 orig_cdev = statbuf.st_dev;
4088 orig_cino = statbuf.st_ino;
4098 if (PerlDir_chdir("..") < 0) {
4099 SV_CWD_RETURN_UNDEF;
4101 if (PerlLIO_stat(".", &statbuf) < 0) {
4102 SV_CWD_RETURN_UNDEF;
4105 cdev = statbuf.st_dev;
4106 cino = statbuf.st_ino;
4108 if (odev == cdev && oino == cino) {
4111 if (!(dir = PerlDir_open("."))) {
4112 SV_CWD_RETURN_UNDEF;
4115 while ((dp = PerlDir_read(dir)) != NULL) {
4117 namelen = dp->d_namlen;
4119 namelen = strlen(dp->d_name);
4122 if (SV_CWD_ISDOT(dp)) {
4126 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4127 SV_CWD_RETURN_UNDEF;
4130 tdev = statbuf.st_dev;
4131 tino = statbuf.st_ino;
4132 if (tino == oino && tdev == odev) {
4138 SV_CWD_RETURN_UNDEF;
4141 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4142 SV_CWD_RETURN_UNDEF;
4145 SvGROW(sv, pathlen + namelen + 1);
4149 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4152 /* prepend current directory to the front */
4154 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4155 pathlen += (namelen + 1);
4157 #ifdef VOID_CLOSEDIR
4160 if (PerlDir_close(dir) < 0) {
4161 SV_CWD_RETURN_UNDEF;
4167 SvCUR_set(sv, pathlen);
4171 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4172 SV_CWD_RETURN_UNDEF;
4175 if (PerlLIO_stat(".", &statbuf) < 0) {
4176 SV_CWD_RETURN_UNDEF;
4179 cdev = statbuf.st_dev;
4180 cino = statbuf.st_ino;
4182 if (cdev != orig_cdev || cino != orig_cino) {
4183 Perl_croak(aTHX_ "Unstable directory path, "
4184 "current directory changed unexpectedly");
4195 #define VERSION_MAX 0x7FFFFFFF
4197 =for apidoc scan_version
4199 Returns a pointer to the next character after the parsed
4200 version string, as well as upgrading the passed in SV to
4203 Function must be called with an already existing SV like
4206 s = scan_version(s, SV *sv, bool qv);
4208 Performs some preprocessing to the string to ensure that
4209 it has the correct characteristics of a version. Flags the
4210 object if it contains an underscore (which denotes this
4211 is an alpha version). The boolean qv denotes that the version
4212 should be interpreted as if it had multiple decimals, even if
4219 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4228 AV * const av = newAV();
4229 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4231 PERL_ARGS_ASSERT_SCAN_VERSION;
4233 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4235 while (isSPACE(*s)) /* leading whitespace is OK */
4241 s++; /* get past 'v' */
4242 qv = 1; /* force quoted version processing */
4247 /* pre-scan the input string to check for decimals/underbars */
4248 while ( *pos == '.' || *pos == '_' || *pos == ',' || isDIGIT(*pos) )
4253 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4257 else if ( *pos == '_' )
4260 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4262 width = pos - last - 1; /* natural width of sub-version */
4264 else if ( *pos == ',' && isDIGIT(pos[1]) )
4273 if ( alpha && !saw_period )
4274 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4276 if ( alpha && saw_period && width == 0 )
4277 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4279 if ( saw_period > 1 )
4280 qv = 1; /* force quoted version processing */
4286 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4288 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4289 if ( !qv && width < 3 )
4290 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4292 while (isDIGIT(*pos))
4294 if (!isALPHA(*pos)) {
4300 /* this is atoi() that delimits on underscores */
4301 const char *end = pos;
4305 /* the following if() will only be true after the decimal
4306 * point of a version originally created with a bare
4307 * floating point number, i.e. not quoted in any way
4309 if ( !qv && s > start && saw_period == 1 ) {
4313 rev += (*s - '0') * mult;
4315 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4316 || (PERL_ABS(rev) > VERSION_MAX )) {
4317 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4318 "Integer overflow in version %d",VERSION_MAX);
4329 while (--end >= s) {
4331 rev += (*end - '0') * mult;
4333 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4334 || (PERL_ABS(rev) > VERSION_MAX )) {
4335 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4336 "Integer overflow in version");
4345 /* Append revision */
4346 av_push(av, newSViv(rev));
4351 else if ( *pos == '.' )
4353 else if ( *pos == '_' && isDIGIT(pos[1]) )
4355 else if ( *pos == ',' && isDIGIT(pos[1]) )
4357 else if ( isDIGIT(*pos) )
4364 while ( isDIGIT(*pos) )
4369 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4377 if ( qv ) { /* quoted versions always get at least three terms*/
4378 I32 len = av_len(av);
4379 /* This for loop appears to trigger a compiler bug on OS X, as it
4380 loops infinitely. Yes, len is negative. No, it makes no sense.
4381 Compiler in question is:
4382 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4383 for ( len = 2 - len; len > 0; len-- )
4384 av_push(MUTABLE_AV(sv), newSViv(0));
4388 av_push(av, newSViv(0));
4391 /* need to save off the current version string for later */
4393 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4394 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4395 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4397 else if ( s > start ) {
4398 SV * orig = newSVpvn(start,s-start);
4399 if ( qv && saw_period == 1 && *start != 'v' ) {
4400 /* need to insert a v to be consistent */
4401 sv_insert(orig, 0, 0, "v", 1);
4403 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4406 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4407 av_push(av, newSViv(0));
4410 /* And finally, store the AV in the hash */
4411 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4413 /* fix RT#19517 - special case 'undef' as string */
4414 if ( *s == 'u' && strEQ(s,"undef") ) {
4422 =for apidoc new_version
4424 Returns a new version object based on the passed in SV:
4426 SV *sv = new_version(SV *ver);
4428 Does not alter the passed in ver SV. See "upg_version" if you
4429 want to upgrade the SV.
4435 Perl_new_version(pTHX_ SV *ver)
4438 SV * const rv = newSV(0);
4439 PERL_ARGS_ASSERT_NEW_VERSION;
4440 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4443 AV * const av = newAV();
4445 /* This will get reblessed later if a derived class*/
4446 SV * const hv = newSVrv(rv, "version");
4447 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4452 /* Begin copying all of the elements */
4453 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4454 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4456 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4457 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4459 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4461 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4462 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4465 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4467 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4468 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4471 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4472 /* This will get reblessed later if a derived class*/
4473 for ( key = 0; key <= av_len(sav); key++ )
4475 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4476 av_push(av, newSViv(rev));
4479 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4484 const MAGIC* const mg = SvVSTRING_mg(ver);
4485 if ( mg ) { /* already a v-string */
4486 const STRLEN len = mg->mg_len;
4487 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4488 sv_setpvn(rv,version,len);
4489 /* this is for consistency with the pure Perl class */
4490 if ( *version != 'v' )
4491 sv_insert(rv, 0, 0, "v", 1);
4496 sv_setsv(rv,ver); /* make a duplicate */
4501 return upg_version(rv, FALSE);
4505 =for apidoc upg_version
4507 In-place upgrade of the supplied SV to a version object.
4509 SV *sv = upg_version(SV *sv, bool qv);
4511 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4512 to force this SV to be interpreted as an "extended" version.
4518 Perl_upg_version(pTHX_ SV *ver, bool qv)
4520 const char *version, *s;
4525 PERL_ARGS_ASSERT_UPG_VERSION;
4527 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4529 /* may get too much accuracy */
4531 #ifdef USE_LOCALE_NUMERIC
4532 char *loc = setlocale(LC_NUMERIC, "C");
4534 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4535 #ifdef USE_LOCALE_NUMERIC
4536 setlocale(LC_NUMERIC, loc);
4538 while (tbuf[len-1] == '0' && len > 0) len--;
4539 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4540 version = savepvn(tbuf, len);
4543 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4544 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4548 else /* must be a string or something like a string */
4551 version = savepv(SvPV(ver,len));
4553 # if PERL_VERSION > 5
4554 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4555 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4556 /* may be a v-string */
4557 SV * const nsv = sv_newmortal();
4561 sv_setpvf(nsv,"v%vd",ver);
4562 pos = nver = savepv(SvPV_nolen(nsv));
4564 /* scan the resulting formatted string */
4565 pos++; /* skip the leading 'v' */
4566 while ( *pos == '.' || isDIGIT(*pos) ) {
4572 /* is definitely a v-string */
4573 if ( saw_period == 2 ) {
4582 s = scan_version(version, ver, qv);
4584 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4585 "Version string '%s' contains invalid data; "
4586 "ignoring: '%s'", version, s);
4594 Validates that the SV contains a valid version object.
4596 bool vverify(SV *vobj);
4598 Note that it only confirms the bare minimum structure (so as not to get
4599 confused by derived classes which may contain additional hash entries):
4603 =item * The SV contains a [reference to a] hash
4605 =item * The hash contains a "version" key
4607 =item * The "version" key has [a reference to] an AV as its value
4615 Perl_vverify(pTHX_ SV *vs)
4619 PERL_ARGS_ASSERT_VVERIFY;
4624 /* see if the appropriate elements exist */
4625 if ( SvTYPE(vs) == SVt_PVHV
4626 && hv_exists(MUTABLE_HV(vs), "version", 7)
4627 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4628 && SvTYPE(sv) == SVt_PVAV )
4637 Accepts a version object and returns the normalized floating
4638 point representation. Call like:
4642 NOTE: you can pass either the object directly or the SV
4643 contained within the RV.
4649 Perl_vnumify(pTHX_ SV *vs)
4654 SV * const sv = newSV(0);
4657 PERL_ARGS_ASSERT_VNUMIFY;
4663 Perl_croak(aTHX_ "Invalid version object");
4665 /* see if various flags exist */
4666 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4668 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4669 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4674 /* attempt to retrieve the version array */
4675 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4687 digit = SvIV(*av_fetch(av, 0, 0));
4688 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4689 for ( i = 1 ; i < len ; i++ )
4691 digit = SvIV(*av_fetch(av, i, 0));
4693 const int denom = (width == 2 ? 10 : 100);
4694 const div_t term = div((int)PERL_ABS(digit),denom);
4695 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4698 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4704 digit = SvIV(*av_fetch(av, len, 0));
4705 if ( alpha && width == 3 ) /* alpha version */
4707 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4711 sv_catpvs(sv, "000");
4719 Accepts a version object and returns the normalized string
4720 representation. Call like:
4724 NOTE: you can pass either the object directly or the SV
4725 contained within the RV.
4731 Perl_vnormal(pTHX_ SV *vs)
4735 SV * const sv = newSV(0);
4738 PERL_ARGS_ASSERT_VNORMAL;
4744 Perl_croak(aTHX_ "Invalid version object");
4746 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4748 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4756 digit = SvIV(*av_fetch(av, 0, 0));
4757 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4758 for ( i = 1 ; i < len ; i++ ) {
4759 digit = SvIV(*av_fetch(av, i, 0));
4760 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4765 /* handle last digit specially */
4766 digit = SvIV(*av_fetch(av, len, 0));
4768 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4770 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4773 if ( len <= 2 ) { /* short version, must be at least three */
4774 for ( len = 2 - len; len != 0; len-- )
4781 =for apidoc vstringify
4783 In order to maintain maximum compatibility with earlier versions
4784 of Perl, this function will return either the floating point
4785 notation or the multiple dotted notation, depending on whether
4786 the original version contained 1 or more dots, respectively
4792 Perl_vstringify(pTHX_ SV *vs)
4794 PERL_ARGS_ASSERT_VSTRINGIFY;
4800 Perl_croak(aTHX_ "Invalid version object");
4802 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4804 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4808 return &PL_sv_undef;
4811 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4821 Version object aware cmp. Both operands must already have been
4822 converted into version objects.
4828 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4831 bool lalpha = FALSE;
4832 bool ralpha = FALSE;
4837 PERL_ARGS_ASSERT_VCMP;
4844 if ( !vverify(lhv) )
4845 Perl_croak(aTHX_ "Invalid version object");
4847 if ( !vverify(rhv) )
4848 Perl_croak(aTHX_ "Invalid version object");
4850 /* get the left hand term */
4851 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4852 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4855 /* and the right hand term */
4856 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4857 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4865 while ( i <= m && retval == 0 )
4867 left = SvIV(*av_fetch(lav,i,0));
4868 right = SvIV(*av_fetch(rav,i,0));
4876 /* tiebreaker for alpha with identical terms */
4877 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4879 if ( lalpha && !ralpha )
4883 else if ( ralpha && !lalpha)
4889 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4893 while ( i <= r && retval == 0 )
4895 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4896 retval = -1; /* not a match after all */
4902 while ( i <= l && retval == 0 )
4904 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4905 retval = +1; /* not a match after all */
4913 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4914 # define EMULATE_SOCKETPAIR_UDP
4917 #ifdef EMULATE_SOCKETPAIR_UDP
4919 S_socketpair_udp (int fd[2]) {
4921 /* Fake a datagram socketpair using UDP to localhost. */
4922 int sockets[2] = {-1, -1};
4923 struct sockaddr_in addresses[2];
4925 Sock_size_t size = sizeof(struct sockaddr_in);
4926 unsigned short port;
4929 memset(&addresses, 0, sizeof(addresses));
4932 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4933 if (sockets[i] == -1)
4934 goto tidy_up_and_fail;
4936 addresses[i].sin_family = AF_INET;
4937 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4938 addresses[i].sin_port = 0; /* kernel choses port. */
4939 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4940 sizeof(struct sockaddr_in)) == -1)
4941 goto tidy_up_and_fail;
4944 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4945 for each connect the other socket to it. */
4948 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4950 goto tidy_up_and_fail;
4951 if (size != sizeof(struct sockaddr_in))
4952 goto abort_tidy_up_and_fail;
4953 /* !1 is 0, !0 is 1 */
4954 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4955 sizeof(struct sockaddr_in)) == -1)
4956 goto tidy_up_and_fail;
4959 /* Now we have 2 sockets connected to each other. I don't trust some other
4960 process not to have already sent a packet to us (by random) so send
4961 a packet from each to the other. */
4964 /* I'm going to send my own port number. As a short.
4965 (Who knows if someone somewhere has sin_port as a bitfield and needs
4966 this routine. (I'm assuming crays have socketpair)) */
4967 port = addresses[i].sin_port;
4968 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4969 if (got != sizeof(port)) {
4971 goto tidy_up_and_fail;
4972 goto abort_tidy_up_and_fail;
4976 /* Packets sent. I don't trust them to have arrived though.
4977 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4978 connect to localhost will use a second kernel thread. In 2.6 the
4979 first thread running the connect() returns before the second completes,
4980 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4981 returns 0. Poor programs have tripped up. One poor program's authors'
4982 had a 50-1 reverse stock split. Not sure how connected these were.)
4983 So I don't trust someone not to have an unpredictable UDP stack.
4987 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4988 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4992 FD_SET((unsigned int)sockets[0], &rset);
4993 FD_SET((unsigned int)sockets[1], &rset);
4995 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4996 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4997 || !FD_ISSET(sockets[1], &rset)) {
4998 /* I hope this is portable and appropriate. */
5000 goto tidy_up_and_fail;
5001 goto abort_tidy_up_and_fail;
5005 /* And the paranoia department even now doesn't trust it to have arrive
5006 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5008 struct sockaddr_in readfrom;
5009 unsigned short buffer[2];
5014 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5015 sizeof(buffer), MSG_DONTWAIT,
5016 (struct sockaddr *) &readfrom, &size);
5018 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5020 (struct sockaddr *) &readfrom, &size);
5024 goto tidy_up_and_fail;
5025 if (got != sizeof(port)
5026 || size != sizeof(struct sockaddr_in)
5027 /* Check other socket sent us its port. */
5028 || buffer[0] != (unsigned short) addresses[!i].sin_port
5029 /* Check kernel says we got the datagram from that socket */
5030 || readfrom.sin_family != addresses[!i].sin_family
5031 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5032 || readfrom.sin_port != addresses[!i].sin_port)
5033 goto abort_tidy_up_and_fail;
5036 /* My caller (my_socketpair) has validated that this is non-NULL */
5039 /* I hereby declare this connection open. May God bless all who cross
5043 abort_tidy_up_and_fail:
5044 errno = ECONNABORTED;
5048 if (sockets[0] != -1)
5049 PerlLIO_close(sockets[0]);
5050 if (sockets[1] != -1)
5051 PerlLIO_close(sockets[1]);
5056 #endif /* EMULATE_SOCKETPAIR_UDP */
5058 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5060 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5061 /* Stevens says that family must be AF_LOCAL, protocol 0.
5062 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5067 struct sockaddr_in listen_addr;
5068 struct sockaddr_in connect_addr;
5073 || family != AF_UNIX
5076 errno = EAFNOSUPPORT;
5084 #ifdef EMULATE_SOCKETPAIR_UDP
5085 if (type == SOCK_DGRAM)
5086 return S_socketpair_udp(fd);
5089 listener = PerlSock_socket(AF_INET, type, 0);
5092 memset(&listen_addr, 0, sizeof(listen_addr));
5093 listen_addr.sin_family = AF_INET;
5094 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5095 listen_addr.sin_port = 0; /* kernel choses port. */
5096 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5097 sizeof(listen_addr)) == -1)
5098 goto tidy_up_and_fail;
5099 if (PerlSock_listen(listener, 1) == -1)
5100 goto tidy_up_and_fail;
5102 connector = PerlSock_socket(AF_INET, type, 0);
5103 if (connector == -1)
5104 goto tidy_up_and_fail;
5105 /* We want to find out the port number to connect to. */
5106 size = sizeof(connect_addr);
5107 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5109 goto tidy_up_and_fail;
5110 if (size != sizeof(connect_addr))
5111 goto abort_tidy_up_and_fail;
5112 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5113 sizeof(connect_addr)) == -1)
5114 goto tidy_up_and_fail;
5116 size = sizeof(listen_addr);
5117 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5120 goto tidy_up_and_fail;
5121 if (size != sizeof(listen_addr))
5122 goto abort_tidy_up_and_fail;
5123 PerlLIO_close(listener);
5124 /* Now check we are talking to ourself by matching port and host on the
5126 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5128 goto tidy_up_and_fail;
5129 if (size != sizeof(connect_addr)
5130 || listen_addr.sin_family != connect_addr.sin_family
5131 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5132 || listen_addr.sin_port != connect_addr.sin_port) {
5133 goto abort_tidy_up_and_fail;
5139 abort_tidy_up_and_fail:
5141 errno = ECONNABORTED; /* This would be the standard thing to do. */
5143 # ifdef ECONNREFUSED
5144 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5146 errno = ETIMEDOUT; /* Desperation time. */
5153 PerlLIO_close(listener);
5154 if (connector != -1)
5155 PerlLIO_close(connector);
5157 PerlLIO_close(acceptor);
5163 /* In any case have a stub so that there's code corresponding
5164 * to the my_socketpair in global.sym. */
5166 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5167 #ifdef HAS_SOCKETPAIR
5168 return socketpair(family, type, protocol, fd);
5177 =for apidoc sv_nosharing
5179 Dummy routine which "shares" an SV when there is no sharing module present.
5180 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5181 Exists to avoid test for a NULL function pointer and because it could
5182 potentially warn under some level of strict-ness.
5188 Perl_sv_nosharing(pTHX_ SV *sv)
5190 PERL_UNUSED_CONTEXT;
5191 PERL_UNUSED_ARG(sv);
5196 =for apidoc sv_destroyable
5198 Dummy routine which reports that object can be destroyed when there is no
5199 sharing module present. It ignores its single SV argument, and returns
5200 'true'. Exists to avoid test for a NULL function pointer and because it
5201 could potentially warn under some level of strict-ness.
5207 Perl_sv_destroyable(pTHX_ SV *sv)
5209 PERL_UNUSED_CONTEXT;
5210 PERL_UNUSED_ARG(sv);
5215 Perl_parse_unicode_opts(pTHX_ const char **popt)
5217 const char *p = *popt;
5220 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5224 opt = (U32) atoi(p);
5227 if (*p && *p != '\n' && *p != '\r')
5228 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5233 case PERL_UNICODE_STDIN:
5234 opt |= PERL_UNICODE_STDIN_FLAG; break;
5235 case PERL_UNICODE_STDOUT:
5236 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5237 case PERL_UNICODE_STDERR:
5238 opt |= PERL_UNICODE_STDERR_FLAG; break;
5239 case PERL_UNICODE_STD:
5240 opt |= PERL_UNICODE_STD_FLAG; break;
5241 case PERL_UNICODE_IN:
5242 opt |= PERL_UNICODE_IN_FLAG; break;
5243 case PERL_UNICODE_OUT:
5244 opt |= PERL_UNICODE_OUT_FLAG; break;
5245 case PERL_UNICODE_INOUT:
5246 opt |= PERL_UNICODE_INOUT_FLAG; break;
5247 case PERL_UNICODE_LOCALE:
5248 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5249 case PERL_UNICODE_ARGV:
5250 opt |= PERL_UNICODE_ARGV_FLAG; break;
5251 case PERL_UNICODE_UTF8CACHEASSERT:
5252 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5254 if (*p != '\n' && *p != '\r')
5256 "Unknown Unicode option letter '%c'", *p);
5262 opt = PERL_UNICODE_DEFAULT_FLAGS;
5264 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5265 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5266 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5278 * This is really just a quick hack which grabs various garbage
5279 * values. It really should be a real hash algorithm which
5280 * spreads the effect of every input bit onto every output bit,
5281 * if someone who knows about such things would bother to write it.
5282 * Might be a good idea to add that function to CORE as well.
5283 * No numbers below come from careful analysis or anything here,
5284 * except they are primes and SEED_C1 > 1E6 to get a full-width
5285 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5286 * probably be bigger too.
5289 # define SEED_C1 1000003
5290 #define SEED_C4 73819
5292 # define SEED_C1 25747
5293 #define SEED_C4 20639
5297 #define SEED_C5 26107
5299 #ifndef PERL_NO_DEV_RANDOM
5304 # include <starlet.h>
5305 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5306 * in 100-ns units, typically incremented ever 10 ms. */
5307 unsigned int when[2];
5309 # ifdef HAS_GETTIMEOFDAY
5310 struct timeval when;
5316 /* This test is an escape hatch, this symbol isn't set by Configure. */
5317 #ifndef PERL_NO_DEV_RANDOM
5318 #ifndef PERL_RANDOM_DEVICE
5319 /* /dev/random isn't used by default because reads from it will block
5320 * if there isn't enough entropy available. You can compile with
5321 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5322 * is enough real entropy to fill the seed. */
5323 # define PERL_RANDOM_DEVICE "/dev/urandom"
5325 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5327 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5336 _ckvmssts(sys$gettim(when));
5337 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5339 # ifdef HAS_GETTIMEOFDAY
5340 PerlProc_gettimeofday(&when,NULL);
5341 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5344 u = (U32)SEED_C1 * when;
5347 u += SEED_C3 * (U32)PerlProc_getpid();
5348 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5349 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5350 u += SEED_C5 * (U32)PTR2UV(&when);
5356 Perl_get_hash_seed(pTHX)
5359 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5365 if (s && isDIGIT(*s))
5366 myseed = (UV)Atoul(s);
5368 #ifdef USE_HASH_SEED_EXPLICIT
5372 /* Compute a random seed */
5373 (void)seedDrand01((Rand_seed_t)seed());
5374 myseed = (UV)(Drand01() * (NV)UV_MAX);
5375 #if RANDBITS < (UVSIZE * 8)
5376 /* Since there are not enough randbits to to reach all
5377 * the bits of a UV, the low bits might need extra
5378 * help. Sum in another random number that will
5379 * fill in the low bits. */
5381 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5382 #endif /* RANDBITS < (UVSIZE * 8) */
5383 if (myseed == 0) { /* Superparanoia. */
5384 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5386 Perl_croak(aTHX_ "Your random numbers are not that random");
5389 PL_rehash_seed_set = TRUE;
5396 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5398 const char * const stashpv = CopSTASHPV(c);
5399 const char * const name = HvNAME_get(hv);
5400 PERL_UNUSED_CONTEXT;
5401 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5403 if (stashpv == name)
5405 if (stashpv && name)
5406 if (strEQ(stashpv, name))
5413 #ifdef PERL_GLOBAL_STRUCT
5415 #define PERL_GLOBAL_STRUCT_INIT
5416 #include "opcode.h" /* the ppaddr and check */
5419 Perl_init_global_struct(pTHX)
5421 struct perl_vars *plvarsp = NULL;
5422 # ifdef PERL_GLOBAL_STRUCT
5423 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5424 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5425 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5426 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5427 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5431 plvarsp = PL_VarsPtr;
5432 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5438 # define PERLVAR(var,type) /**/
5439 # define PERLVARA(var,n,type) /**/
5440 # define PERLVARI(var,type,init) plvarsp->var = init;
5441 # define PERLVARIC(var,type,init) plvarsp->var = init;
5442 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5443 # include "perlvars.h"
5449 # ifdef PERL_GLOBAL_STRUCT
5452 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5453 if (!plvarsp->Gppaddr)
5457 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5458 if (!plvarsp->Gcheck)
5460 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5461 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5463 # ifdef PERL_SET_VARS
5464 PERL_SET_VARS(plvarsp);
5466 # undef PERL_GLOBAL_STRUCT_INIT
5471 #endif /* PERL_GLOBAL_STRUCT */
5473 #ifdef PERL_GLOBAL_STRUCT
5476 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5478 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5479 # ifdef PERL_GLOBAL_STRUCT
5480 # ifdef PERL_UNSET_VARS
5481 PERL_UNSET_VARS(plvarsp);
5483 free(plvarsp->Gppaddr);
5484 free(plvarsp->Gcheck);
5485 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5491 #endif /* PERL_GLOBAL_STRUCT */
5495 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5496 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5497 * given, and you supply your own implementation.
5499 * The default implementation reads a single env var, PERL_MEM_LOG,
5500 * expecting one or more of the following:
5502 * \d+ - fd fd to write to : must be 1st (atoi)
5503 * 'm' - memlog was PERL_MEM_LOG=1
5504 * 's' - svlog was PERL_SV_LOG=1
5505 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5507 * This makes the logger controllable enough that it can reasonably be
5508 * added to the system perl.
5511 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5512 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5514 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5516 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5517 * writes to. In the default logger, this is settable at runtime.
5519 #ifndef PERL_MEM_LOG_FD
5520 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5523 #ifndef PERL_MEM_LOG_NOIMPL
5525 # ifdef DEBUG_LEAKING_SCALARS
5526 # define SV_LOG_SERIAL_FMT " [%lu]"
5527 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5529 # define SV_LOG_SERIAL_FMT
5530 # define _SV_LOG_SERIAL_ARG(sv)
5534 S_mem_log_common(enum mem_log_type mlt, const UV n,
5535 const UV typesize, const char *type_name, const SV *sv,
5536 Malloc_t oldalloc, Malloc_t newalloc,
5537 const char *filename, const int linenumber,
5538 const char *funcname)
5542 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5544 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5547 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
5549 /* We can't use SVs or PerlIO for obvious reasons,
5550 * so we'll use stdio and low-level IO instead. */
5551 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5553 # ifdef HAS_GETTIMEOFDAY
5554 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5555 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5557 gettimeofday(&tv, 0);
5559 # define MEM_LOG_TIME_FMT "%10d: "
5560 # define MEM_LOG_TIME_ARG (int)when
5564 /* If there are other OS specific ways of hires time than
5565 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5566 * probably that they would be used to fill in the struct
5570 int fd = atoi(pmlenv);
5572 fd = PERL_MEM_LOG_FD;
5574 if (strchr(pmlenv, 't')) {
5575 len = my_snprintf(buf, sizeof(buf),
5576 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5577 PerlLIO_write(fd, buf, len);
5581 len = my_snprintf(buf, sizeof(buf),
5582 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5583 " %s = %"IVdf": %"UVxf"\n",
5584 filename, linenumber, funcname, n, typesize,
5585 type_name, n * typesize, PTR2UV(newalloc));
5588 len = my_snprintf(buf, sizeof(buf),
5589 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5590 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5591 filename, linenumber, funcname, n, typesize,
5592 type_name, n * typesize, PTR2UV(oldalloc),
5596 len = my_snprintf(buf, sizeof(buf),
5597 "free: %s:%d:%s: %"UVxf"\n",
5598 filename, linenumber, funcname,
5603 len = my_snprintf(buf, sizeof(buf),
5604 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5605 mlt == MLT_NEW_SV ? "new" : "del",
5606 filename, linenumber, funcname,
5607 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5612 PerlLIO_write(fd, buf, len);
5616 #endif /* !PERL_MEM_LOG_NOIMPL */
5618 #ifndef PERL_MEM_LOG_NOIMPL
5620 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5621 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5623 /* this is suboptimal, but bug compatible. User is providing their
5624 own implemenation, but is getting these functions anyway, and they
5625 do nothing. But _NOIMPL users should be able to cope or fix */
5627 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5628 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5632 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5634 const char *filename, const int linenumber,
5635 const char *funcname)
5637 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5638 NULL, NULL, newalloc,
5639 filename, linenumber, funcname);
5644 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5645 Malloc_t oldalloc, Malloc_t newalloc,
5646 const char *filename, const int linenumber,
5647 const char *funcname)
5649 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5650 NULL, oldalloc, newalloc,
5651 filename, linenumber, funcname);
5656 Perl_mem_log_free(Malloc_t oldalloc,
5657 const char *filename, const int linenumber,
5658 const char *funcname)
5660 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5661 filename, linenumber, funcname);
5666 Perl_mem_log_new_sv(const SV *sv,
5667 const char *filename, const int linenumber,
5668 const char *funcname)
5670 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5671 filename, linenumber, funcname);
5675 Perl_mem_log_del_sv(const SV *sv,
5676 const char *filename, const int linenumber,
5677 const char *funcname)
5679 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5680 filename, linenumber, funcname);
5683 #endif /* PERL_MEM_LOG */
5686 =for apidoc my_sprintf
5688 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5689 the length of the string written to the buffer. Only rare pre-ANSI systems
5690 need the wrapper function - usually this is a direct call to C<sprintf>.
5694 #ifndef SPRINTF_RETURNS_STRLEN
5696 Perl_my_sprintf(char *buffer, const char* pat, ...)
5699 PERL_ARGS_ASSERT_MY_SPRINTF;
5700 va_start(args, pat);
5701 vsprintf(buffer, pat, args);
5703 return strlen(buffer);
5708 =for apidoc my_snprintf
5710 The C library C<snprintf> functionality, if available and
5711 standards-compliant (uses C<vsnprintf>, actually). However, if the
5712 C<vsnprintf> is not available, will unfortunately use the unsafe
5713 C<vsprintf> which can overrun the buffer (there is an overrun check,
5714 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5715 getting C<vsnprintf>.
5720 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5725 PERL_ARGS_ASSERT_MY_SNPRINTF;
5726 va_start(ap, format);
5727 #ifdef HAS_VSNPRINTF
5728 retval = vsnprintf(buffer, len, format, ap);
5730 retval = vsprintf(buffer, format, ap);
5733 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5734 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5735 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5740 =for apidoc my_vsnprintf
5742 The C library C<vsnprintf> if available and standards-compliant.
5743 However, if if the C<vsnprintf> is not available, will unfortunately
5744 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5745 overrun check, but that may be too late). Consider using
5746 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5751 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5758 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5760 Perl_va_copy(ap, apc);
5761 # ifdef HAS_VSNPRINTF
5762 retval = vsnprintf(buffer, len, format, apc);
5764 retval = vsprintf(buffer, format, apc);
5767 # ifdef HAS_VSNPRINTF
5768 retval = vsnprintf(buffer, len, format, ap);
5770 retval = vsprintf(buffer, format, ap);
5772 #endif /* #ifdef NEED_VA_COPY */
5773 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5774 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5775 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5780 Perl_my_clearenv(pTHX)
5783 #if ! defined(PERL_MICRO)
5784 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5786 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5787 # if defined(USE_ENVIRON_ARRAY)
5788 # if defined(USE_ITHREADS)
5789 /* only the parent thread can clobber the process environment */
5790 if (PL_curinterp == aTHX)
5791 # endif /* USE_ITHREADS */
5793 # if ! defined(PERL_USE_SAFE_PUTENV)
5794 if ( !PL_use_safe_putenv) {
5796 if (environ == PL_origenviron)
5797 environ = (char**)safesysmalloc(sizeof(char*));
5799 for (i = 0; environ[i]; i++)
5800 (void)safesysfree(environ[i]);
5803 # else /* PERL_USE_SAFE_PUTENV */
5804 # if defined(HAS_CLEARENV)
5806 # elif defined(HAS_UNSETENV)
5807 int bsiz = 80; /* Most envvar names will be shorter than this. */
5808 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5809 char *buf = (char*)safesysmalloc(bufsiz);
5810 while (*environ != NULL) {
5811 char *e = strchr(*environ, '=');
5812 int l = e ? e - *environ : (int)strlen(*environ);
5814 (void)safesysfree(buf);
5815 bsiz = l + 1; /* + 1 for the \0. */
5816 buf = (char*)safesysmalloc(bufsiz);
5818 memcpy(buf, *environ, l);
5820 (void)unsetenv(buf);
5822 (void)safesysfree(buf);
5823 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5824 /* Just null environ and accept the leakage. */
5826 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5827 # endif /* ! PERL_USE_SAFE_PUTENV */
5829 # endif /* USE_ENVIRON_ARRAY */
5830 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5831 #endif /* PERL_MICRO */
5834 #ifdef PERL_IMPLICIT_CONTEXT
5836 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5837 the global PL_my_cxt_index is incremented, and that value is assigned to
5838 that module's static my_cxt_index (who's address is passed as an arg).
5839 Then, for each interpreter this function is called for, it makes sure a
5840 void* slot is available to hang the static data off, by allocating or
5841 extending the interpreter's PL_my_cxt_list array */
5843 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5845 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5849 PERL_ARGS_ASSERT_MY_CXT_INIT;
5851 /* this module hasn't been allocated an index yet */
5852 MUTEX_LOCK(&PL_my_ctx_mutex);
5853 *index = PL_my_cxt_index++;
5854 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5857 /* make sure the array is big enough */
5858 if (PL_my_cxt_size <= *index) {
5859 if (PL_my_cxt_size) {
5860 while (PL_my_cxt_size <= *index)
5861 PL_my_cxt_size *= 2;
5862 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5865 PL_my_cxt_size = 16;
5866 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5869 /* newSV() allocates one more than needed */
5870 p = (void*)SvPVX(newSV(size-1));
5871 PL_my_cxt_list[*index] = p;
5872 Zero(p, size, char);
5876 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5879 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5884 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5886 for (index = 0; index < PL_my_cxt_index; index++) {
5887 const char *key = PL_my_cxt_keys[index];
5888 /* try direct pointer compare first - there are chances to success,
5889 * and it's much faster.
5891 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5898 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5904 PERL_ARGS_ASSERT_MY_CXT_INIT;
5906 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5908 /* this module hasn't been allocated an index yet */
5909 MUTEX_LOCK(&PL_my_ctx_mutex);
5910 index = PL_my_cxt_index++;
5911 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5914 /* make sure the array is big enough */
5915 if (PL_my_cxt_size <= index) {
5916 int old_size = PL_my_cxt_size;
5918 if (PL_my_cxt_size) {
5919 while (PL_my_cxt_size <= index)
5920 PL_my_cxt_size *= 2;
5921 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5922 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5925 PL_my_cxt_size = 16;
5926 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5927 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5929 for (i = old_size; i < PL_my_cxt_size; i++) {
5930 PL_my_cxt_keys[i] = 0;
5931 PL_my_cxt_list[i] = 0;
5934 PL_my_cxt_keys[index] = my_cxt_key;
5935 /* newSV() allocates one more than needed */
5936 p = (void*)SvPVX(newSV(size-1));
5937 PL_my_cxt_list[index] = p;
5938 Zero(p, size, char);
5941 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5942 #endif /* PERL_IMPLICIT_CONTEXT */
5946 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5948 Size_t used, length, copy;
5951 length = strlen(src);
5952 if (size > 0 && used < size - 1) {
5953 copy = (length >= size - used) ? size - used - 1 : length;
5954 memcpy(dst + used, src, copy);
5955 dst[used + copy] = '\0';
5957 return used + length;
5963 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5965 Size_t length, copy;
5967 length = strlen(src);
5969 copy = (length >= size) ? size - 1 : length;
5970 memcpy(dst, src, copy);
5977 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5978 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5979 long _ftol( double ); /* Defined by VC6 C libs. */
5980 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5984 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5987 SV * const dbsv = GvSVn(PL_DBsub);
5988 /* We do not care about using sv to call CV;
5989 * it's for informational purposes only.
5992 PERL_ARGS_ASSERT_GET_DB_SUB;
5995 if (!PERLDB_SUB_NN) {
5996 GV * const gv = CvGV(cv);
5998 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5999 || strEQ(GvNAME(gv), "END")
6000 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6001 !( (SvTYPE(*svp) == SVt_PVGV)
6002 && (GvCV((const GV *)*svp) == cv) )))) {
6003 /* Use GV from the stack as a fallback. */
6004 /* GV is potentially non-unique, or contain different CV. */
6005 SV * const tmp = newRV(MUTABLE_SV(cv));
6006 sv_setsv(dbsv, tmp);
6010 gv_efullname3(dbsv, gv, NULL);
6014 const int type = SvTYPE(dbsv);
6015 if (type < SVt_PVIV && type != SVt_IV)
6016 sv_upgrade(dbsv, SVt_PVIV);
6017 (void)SvIOK_on(dbsv);
6018 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6023 Perl_my_dirfd(pTHX_ DIR * dir) {
6025 /* Most dirfd implementations have problems when passed NULL. */
6030 #elif defined(HAS_DIR_DD_FD)
6033 Perl_die(aTHX_ PL_no_func, "dirfd");
6040 Perl_get_re_arg(pTHX_ SV *sv) {
6046 sv = MUTABLE_SV(SvRV(sv));
6047 if (SvTYPE(sv) == SVt_REGEXP)
6048 return (REGEXP*) sv;
6056 * c-indentation-style: bsd
6058 * indent-tabs-mode: t
6061 * ex: set ts=8 sts=4 sw=4 noet: