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_ const char* message, int msglen)
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));
1257 mPUSHp(message, msglen);
1259 call_method("PRINT", G_SCALAR);
1267 /* SFIO can really mess with your errno */
1270 PerlIO * const serr = Perl_error_log;
1272 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1273 (void)PerlIO_flush(serr);
1280 /* Common code used by vcroak, vdie, vwarn and vwarner */
1283 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1289 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1290 /* sv_2cv might call Perl_croak() or Perl_warner() */
1291 SV * const oldhook = *hook;
1298 cv = sv_2cv(oldhook, &stash, &gv, 0);
1300 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1310 if (warn || message) {
1311 msg = newSVpvn_flags(message, msglen, utf8);
1319 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1323 call_sv(MUTABLE_SV(cv), G_DISCARD);
1332 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1336 const char *message;
1339 SV * const msv = vmess(pat, args);
1340 if (PL_errors && SvCUR(PL_errors)) {
1341 sv_catsv(PL_errors, msv);
1342 message = SvPV_const(PL_errors, *msglen);
1343 SvCUR_set(PL_errors, 0);
1346 message = SvPV_const(msv,*msglen);
1347 *utf8 = SvUTF8(msv);
1354 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1360 S_vdie(pTHX_ const char* pat, va_list *args)
1363 const char *message;
1364 const int was_in_eval = PL_in_eval;
1368 message = vdie_croak_common(pat, args, &msglen, &utf8);
1370 PL_restartop = die_where(message, msglen);
1371 SvFLAGS(ERRSV) |= utf8;
1372 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1374 return PL_restartop;
1377 #if defined(PERL_IMPLICIT_CONTEXT)
1379 Perl_die_nocontext(const char* pat, ...)
1384 va_start(args, pat);
1385 o = vdie(pat, &args);
1389 #endif /* PERL_IMPLICIT_CONTEXT */
1392 Perl_die(pTHX_ const char* pat, ...)
1396 va_start(args, pat);
1397 o = vdie(pat, &args);
1403 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1406 const char *message;
1410 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1413 PL_restartop = die_where(message, msglen);
1414 SvFLAGS(ERRSV) |= utf8;
1418 message = SvPVx_const(ERRSV, msglen);
1420 write_to_stderr(message, msglen);
1424 #if defined(PERL_IMPLICIT_CONTEXT)
1426 Perl_croak_nocontext(const char *pat, ...)
1430 va_start(args, pat);
1435 #endif /* PERL_IMPLICIT_CONTEXT */
1438 =head1 Warning and Dieing
1442 This is the XSUB-writer's interface to Perl's C<die> function.
1443 Normally call this function the same way you call the C C<printf>
1444 function. Calling C<croak> returns control directly to Perl,
1445 sidestepping the normal C order of execution. See C<warn>.
1447 If you want to throw an exception object, assign the object to
1448 C<$@> and then pass C<NULL> to croak():
1450 errsv = get_sv("@", GV_ADD);
1451 sv_setsv(errsv, exception_object);
1458 Perl_croak(pTHX_ const char *pat, ...)
1461 va_start(args, pat);
1468 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1472 SV * const msv = vmess(pat, args);
1473 const I32 utf8 = SvUTF8(msv);
1474 const char * const message = SvPV_const(msv, msglen);
1476 PERL_ARGS_ASSERT_VWARN;
1479 if (vdie_common(message, msglen, utf8, TRUE))
1483 write_to_stderr(message, msglen);
1486 #if defined(PERL_IMPLICIT_CONTEXT)
1488 Perl_warn_nocontext(const char *pat, ...)
1492 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1493 va_start(args, pat);
1497 #endif /* PERL_IMPLICIT_CONTEXT */
1502 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1503 function the same way you call the C C<printf> function. See C<croak>.
1509 Perl_warn(pTHX_ const char *pat, ...)
1512 PERL_ARGS_ASSERT_WARN;
1513 va_start(args, pat);
1518 #if defined(PERL_IMPLICIT_CONTEXT)
1520 Perl_warner_nocontext(U32 err, const char *pat, ...)
1524 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1525 va_start(args, pat);
1526 vwarner(err, pat, &args);
1529 #endif /* PERL_IMPLICIT_CONTEXT */
1532 Perl_warner(pTHX_ U32 err, const char* pat,...)
1535 PERL_ARGS_ASSERT_WARNER;
1536 va_start(args, pat);
1537 vwarner(err, pat, &args);
1542 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1545 PERL_ARGS_ASSERT_VWARNER;
1546 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1547 SV * const msv = vmess(pat, args);
1549 const char * const message = SvPV_const(msv, msglen);
1550 const I32 utf8 = SvUTF8(msv);
1554 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1557 PL_restartop = die_where(message, msglen);
1558 SvFLAGS(ERRSV) |= utf8;
1561 write_to_stderr(message, msglen);
1565 Perl_vwarn(aTHX_ pat, args);
1569 /* implements the ckWARN? macros */
1572 Perl_ckwarn(pTHX_ U32 w)
1576 ? (PL_curcop->cop_warnings != pWARN_NONE
1578 PL_curcop->cop_warnings == pWARN_ALL
1579 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1580 || (unpackWARN2(w) &&
1581 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1582 || (unpackWARN3(w) &&
1583 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1584 || (unpackWARN4(w) &&
1585 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1588 : (PL_dowarn & G_WARN_ON);
1591 /* implements the ckWARN?_d macro */
1594 Perl_ckwarn_d(pTHX_ U32 w)
1599 || PL_curcop->cop_warnings == pWARN_ALL
1601 PL_curcop->cop_warnings != pWARN_NONE
1603 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1604 || (unpackWARN2(w) &&
1605 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1606 || (unpackWARN3(w) &&
1607 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1608 || (unpackWARN4(w) &&
1609 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1615 /* Set buffer=NULL to get a new one. */
1617 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1619 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1620 PERL_UNUSED_CONTEXT;
1621 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1624 (specialWARN(buffer) ?
1625 PerlMemShared_malloc(len_wanted) :
1626 PerlMemShared_realloc(buffer, len_wanted));
1628 Copy(bits, (buffer + 1), size, char);
1632 /* since we've already done strlen() for both nam and val
1633 * we can use that info to make things faster than
1634 * sprintf(s, "%s=%s", nam, val)
1636 #define my_setenv_format(s, nam, nlen, val, vlen) \
1637 Copy(nam, s, nlen, char); \
1639 Copy(val, s+(nlen+1), vlen, char); \
1640 *(s+(nlen+1+vlen)) = '\0'
1642 #ifdef USE_ENVIRON_ARRAY
1643 /* VMS' my_setenv() is in vms.c */
1644 #if !defined(WIN32) && !defined(NETWARE)
1646 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1650 /* only parent thread can modify process environment */
1651 if (PL_curinterp == aTHX)
1654 #ifndef PERL_USE_SAFE_PUTENV
1655 if (!PL_use_safe_putenv) {
1656 /* most putenv()s leak, so we manipulate environ directly */
1658 register const I32 len = strlen(nam);
1661 /* where does it go? */
1662 for (i = 0; environ[i]; i++) {
1663 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1667 if (environ == PL_origenviron) { /* need we copy environment? */
1673 while (environ[max])
1675 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1676 for (j=0; j<max; j++) { /* copy environment */
1677 const int len = strlen(environ[j]);
1678 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1679 Copy(environ[j], tmpenv[j], len+1, char);
1682 environ = tmpenv; /* tell exec where it is now */
1685 safesysfree(environ[i]);
1686 while (environ[i]) {
1687 environ[i] = environ[i+1];
1692 if (!environ[i]) { /* does not exist yet */
1693 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1694 environ[i+1] = NULL; /* make sure it's null terminated */
1697 safesysfree(environ[i]);
1701 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1702 /* all that work just for this */
1703 my_setenv_format(environ[i], nam, nlen, val, vlen);
1706 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1707 # if defined(HAS_UNSETENV)
1709 (void)unsetenv(nam);
1711 (void)setenv(nam, val, 1);
1713 # else /* ! HAS_UNSETENV */
1714 (void)setenv(nam, val, 1);
1715 # endif /* HAS_UNSETENV */
1717 # if defined(HAS_UNSETENV)
1719 (void)unsetenv(nam);
1721 const int nlen = strlen(nam);
1722 const int vlen = strlen(val);
1723 char * const new_env =
1724 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1725 my_setenv_format(new_env, nam, nlen, val, vlen);
1726 (void)putenv(new_env);
1728 # else /* ! HAS_UNSETENV */
1730 const int nlen = strlen(nam);
1736 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1737 /* all that work just for this */
1738 my_setenv_format(new_env, nam, nlen, val, vlen);
1739 (void)putenv(new_env);
1740 # endif /* HAS_UNSETENV */
1741 # endif /* __CYGWIN__ */
1742 #ifndef PERL_USE_SAFE_PUTENV
1748 #else /* WIN32 || NETWARE */
1751 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1754 register char *envstr;
1755 const int nlen = strlen(nam);
1762 Newx(envstr, nlen+vlen+2, char);
1763 my_setenv_format(envstr, nam, nlen, val, vlen);
1764 (void)PerlEnv_putenv(envstr);
1768 #endif /* WIN32 || NETWARE */
1770 #endif /* !VMS && !EPOC*/
1772 #ifdef UNLINK_ALL_VERSIONS
1774 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1778 PERL_ARGS_ASSERT_UNLNK;
1780 while (PerlLIO_unlink(f) >= 0)
1782 return retries ? 0 : -1;
1786 /* this is a drop-in replacement for bcopy() */
1787 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1789 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1791 char * const retval = to;
1793 PERL_ARGS_ASSERT_MY_BCOPY;
1795 if (from - to >= 0) {
1803 *(--to) = *(--from);
1809 /* this is a drop-in replacement for memset() */
1812 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1814 char * const retval = loc;
1816 PERL_ARGS_ASSERT_MY_MEMSET;
1824 /* this is a drop-in replacement for bzero() */
1825 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1827 Perl_my_bzero(register char *loc, register I32 len)
1829 char * const retval = loc;
1831 PERL_ARGS_ASSERT_MY_BZERO;
1839 /* this is a drop-in replacement for memcmp() */
1840 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1842 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1844 register const U8 *a = (const U8 *)s1;
1845 register const U8 *b = (const U8 *)s2;
1848 PERL_ARGS_ASSERT_MY_MEMCMP;
1851 if ((tmp = *a++ - *b++))
1856 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1859 /* This vsprintf replacement should generally never get used, since
1860 vsprintf was available in both System V and BSD 2.11. (There may
1861 be some cross-compilation or embedded set-ups where it is needed,
1864 If you encounter a problem in this function, it's probably a symptom
1865 that Configure failed to detect your system's vprintf() function.
1866 See the section on "item vsprintf" in the INSTALL file.
1868 This version may compile on systems with BSD-ish <stdio.h>,
1869 but probably won't on others.
1872 #ifdef USE_CHAR_VSPRINTF
1877 vsprintf(char *dest, const char *pat, void *args)
1881 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1882 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1883 FILE_cnt(&fakebuf) = 32767;
1885 /* These probably won't compile -- If you really need
1886 this, you'll have to figure out some other method. */
1887 fakebuf._ptr = dest;
1888 fakebuf._cnt = 32767;
1893 fakebuf._flag = _IOWRT|_IOSTRG;
1894 _doprnt(pat, args, &fakebuf); /* what a kludge */
1895 #if defined(STDIO_PTR_LVALUE)
1896 *(FILE_ptr(&fakebuf)++) = '\0';
1898 /* PerlIO has probably #defined away fputc, but we want it here. */
1900 # undef fputc /* XXX Should really restore it later */
1902 (void)fputc('\0', &fakebuf);
1904 #ifdef USE_CHAR_VSPRINTF
1907 return 0; /* perl doesn't use return value */
1911 #endif /* HAS_VPRINTF */
1914 #if BYTEORDER != 0x4321
1916 Perl_my_swap(pTHX_ short s)
1918 #if (BYTEORDER & 1) == 0
1921 result = ((s & 255) << 8) + ((s >> 8) & 255);
1929 Perl_my_htonl(pTHX_ long l)
1933 char c[sizeof(long)];
1936 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1937 #if BYTEORDER == 0x12345678
1940 u.c[0] = (l >> 24) & 255;
1941 u.c[1] = (l >> 16) & 255;
1942 u.c[2] = (l >> 8) & 255;
1946 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1947 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1952 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1953 u.c[o & 0xf] = (l >> s) & 255;
1961 Perl_my_ntohl(pTHX_ long l)
1965 char c[sizeof(long)];
1968 #if BYTEORDER == 0x1234
1969 u.c[0] = (l >> 24) & 255;
1970 u.c[1] = (l >> 16) & 255;
1971 u.c[2] = (l >> 8) & 255;
1975 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1976 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1983 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1984 l |= (u.c[o & 0xf] & 255) << s;
1991 #endif /* BYTEORDER != 0x4321 */
1995 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1996 * If these functions are defined,
1997 * the BYTEORDER is neither 0x1234 nor 0x4321.
1998 * However, this is not assumed.
2002 #define HTOLE(name,type) \
2004 name (register type n) \
2008 char c[sizeof(type)]; \
2011 register U32 s = 0; \
2012 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2013 u.c[i] = (n >> s) & 0xFF; \
2018 #define LETOH(name,type) \
2020 name (register type n) \
2024 char c[sizeof(type)]; \
2027 register U32 s = 0; \
2030 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2031 n |= ((type)(u.c[i] & 0xFF)) << s; \
2037 * Big-endian byte order functions.
2040 #define HTOBE(name,type) \
2042 name (register type n) \
2046 char c[sizeof(type)]; \
2049 register U32 s = 8*(sizeof(u.c)-1); \
2050 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2051 u.c[i] = (n >> s) & 0xFF; \
2056 #define BETOH(name,type) \
2058 name (register type n) \
2062 char c[sizeof(type)]; \
2065 register U32 s = 8*(sizeof(u.c)-1); \
2068 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2069 n |= ((type)(u.c[i] & 0xFF)) << s; \
2075 * If we just can't do it...
2078 #define NOT_AVAIL(name,type) \
2080 name (register type n) \
2082 Perl_croak_nocontext(#name "() not available"); \
2083 return n; /* not reached */ \
2087 #if defined(HAS_HTOVS) && !defined(htovs)
2090 #if defined(HAS_HTOVL) && !defined(htovl)
2093 #if defined(HAS_VTOHS) && !defined(vtohs)
2096 #if defined(HAS_VTOHL) && !defined(vtohl)
2100 #ifdef PERL_NEED_MY_HTOLE16
2102 HTOLE(Perl_my_htole16,U16)
2104 NOT_AVAIL(Perl_my_htole16,U16)
2107 #ifdef PERL_NEED_MY_LETOH16
2109 LETOH(Perl_my_letoh16,U16)
2111 NOT_AVAIL(Perl_my_letoh16,U16)
2114 #ifdef PERL_NEED_MY_HTOBE16
2116 HTOBE(Perl_my_htobe16,U16)
2118 NOT_AVAIL(Perl_my_htobe16,U16)
2121 #ifdef PERL_NEED_MY_BETOH16
2123 BETOH(Perl_my_betoh16,U16)
2125 NOT_AVAIL(Perl_my_betoh16,U16)
2129 #ifdef PERL_NEED_MY_HTOLE32
2131 HTOLE(Perl_my_htole32,U32)
2133 NOT_AVAIL(Perl_my_htole32,U32)
2136 #ifdef PERL_NEED_MY_LETOH32
2138 LETOH(Perl_my_letoh32,U32)
2140 NOT_AVAIL(Perl_my_letoh32,U32)
2143 #ifdef PERL_NEED_MY_HTOBE32
2145 HTOBE(Perl_my_htobe32,U32)
2147 NOT_AVAIL(Perl_my_htobe32,U32)
2150 #ifdef PERL_NEED_MY_BETOH32
2152 BETOH(Perl_my_betoh32,U32)
2154 NOT_AVAIL(Perl_my_betoh32,U32)
2158 #ifdef PERL_NEED_MY_HTOLE64
2160 HTOLE(Perl_my_htole64,U64)
2162 NOT_AVAIL(Perl_my_htole64,U64)
2165 #ifdef PERL_NEED_MY_LETOH64
2167 LETOH(Perl_my_letoh64,U64)
2169 NOT_AVAIL(Perl_my_letoh64,U64)
2172 #ifdef PERL_NEED_MY_HTOBE64
2174 HTOBE(Perl_my_htobe64,U64)
2176 NOT_AVAIL(Perl_my_htobe64,U64)
2179 #ifdef PERL_NEED_MY_BETOH64
2181 BETOH(Perl_my_betoh64,U64)
2183 NOT_AVAIL(Perl_my_betoh64,U64)
2187 #ifdef PERL_NEED_MY_HTOLES
2188 HTOLE(Perl_my_htoles,short)
2190 #ifdef PERL_NEED_MY_LETOHS
2191 LETOH(Perl_my_letohs,short)
2193 #ifdef PERL_NEED_MY_HTOBES
2194 HTOBE(Perl_my_htobes,short)
2196 #ifdef PERL_NEED_MY_BETOHS
2197 BETOH(Perl_my_betohs,short)
2200 #ifdef PERL_NEED_MY_HTOLEI
2201 HTOLE(Perl_my_htolei,int)
2203 #ifdef PERL_NEED_MY_LETOHI
2204 LETOH(Perl_my_letohi,int)
2206 #ifdef PERL_NEED_MY_HTOBEI
2207 HTOBE(Perl_my_htobei,int)
2209 #ifdef PERL_NEED_MY_BETOHI
2210 BETOH(Perl_my_betohi,int)
2213 #ifdef PERL_NEED_MY_HTOLEL
2214 HTOLE(Perl_my_htolel,long)
2216 #ifdef PERL_NEED_MY_LETOHL
2217 LETOH(Perl_my_letohl,long)
2219 #ifdef PERL_NEED_MY_HTOBEL
2220 HTOBE(Perl_my_htobel,long)
2222 #ifdef PERL_NEED_MY_BETOHL
2223 BETOH(Perl_my_betohl,long)
2227 Perl_my_swabn(void *ptr, int n)
2229 register char *s = (char *)ptr;
2230 register char *e = s + (n-1);
2233 PERL_ARGS_ASSERT_MY_SWABN;
2235 for (n /= 2; n > 0; s++, e--, n--) {
2243 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2245 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2248 register I32 This, that;
2254 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2256 PERL_FLUSHALL_FOR_CHILD;
2257 This = (*mode == 'w');
2261 taint_proper("Insecure %s%s", "EXEC");
2263 if (PerlProc_pipe(p) < 0)
2265 /* Try for another pipe pair for error return */
2266 if (PerlProc_pipe(pp) >= 0)
2268 while ((pid = PerlProc_fork()) < 0) {
2269 if (errno != EAGAIN) {
2270 PerlLIO_close(p[This]);
2271 PerlLIO_close(p[that]);
2273 PerlLIO_close(pp[0]);
2274 PerlLIO_close(pp[1]);
2278 if (ckWARN(WARN_PIPE))
2279 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2288 /* Close parent's end of error status pipe (if any) */
2290 PerlLIO_close(pp[0]);
2291 #if defined(HAS_FCNTL) && defined(F_SETFD)
2292 /* Close error pipe automatically if exec works */
2293 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2296 /* Now dup our end of _the_ pipe to right position */
2297 if (p[THIS] != (*mode == 'r')) {
2298 PerlLIO_dup2(p[THIS], *mode == 'r');
2299 PerlLIO_close(p[THIS]);
2300 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2301 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2304 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2305 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2306 /* No automatic close - do it by hand */
2313 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2319 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2325 do_execfree(); /* free any memory malloced by child on fork */
2327 PerlLIO_close(pp[1]);
2328 /* Keep the lower of the two fd numbers */
2329 if (p[that] < p[This]) {
2330 PerlLIO_dup2(p[This], p[that]);
2331 PerlLIO_close(p[This]);
2335 PerlLIO_close(p[that]); /* close child's end of pipe */
2337 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2338 SvUPGRADE(sv,SVt_IV);
2340 PL_forkprocess = pid;
2341 /* If we managed to get status pipe check for exec fail */
2342 if (did_pipes && pid > 0) {
2347 while (n < sizeof(int)) {
2348 n1 = PerlLIO_read(pp[0],
2349 (void*)(((char*)&errkid)+n),
2355 PerlLIO_close(pp[0]);
2357 if (n) { /* Error */
2359 PerlLIO_close(p[This]);
2360 if (n != sizeof(int))
2361 Perl_croak(aTHX_ "panic: kid popen errno read");
2363 pid2 = wait4pid(pid, &status, 0);
2364 } while (pid2 == -1 && errno == EINTR);
2365 errno = errkid; /* Propagate errno from kid */
2370 PerlLIO_close(pp[0]);
2371 return PerlIO_fdopen(p[This], mode);
2373 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2374 return my_syspopen4(aTHX_ NULL, mode, n, args);
2376 Perl_croak(aTHX_ "List form of piped open not implemented");
2377 return (PerlIO *) NULL;
2382 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2383 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2385 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2389 register I32 This, that;
2392 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2396 PERL_ARGS_ASSERT_MY_POPEN;
2398 PERL_FLUSHALL_FOR_CHILD;
2401 return my_syspopen(aTHX_ cmd,mode);
2404 This = (*mode == 'w');
2406 if (doexec && PL_tainting) {
2408 taint_proper("Insecure %s%s", "EXEC");
2410 if (PerlProc_pipe(p) < 0)
2412 if (doexec && PerlProc_pipe(pp) >= 0)
2414 while ((pid = PerlProc_fork()) < 0) {
2415 if (errno != EAGAIN) {
2416 PerlLIO_close(p[This]);
2417 PerlLIO_close(p[that]);
2419 PerlLIO_close(pp[0]);
2420 PerlLIO_close(pp[1]);
2423 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2426 if (ckWARN(WARN_PIPE))
2427 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2438 PerlLIO_close(pp[0]);
2439 #if defined(HAS_FCNTL) && defined(F_SETFD)
2440 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2443 if (p[THIS] != (*mode == 'r')) {
2444 PerlLIO_dup2(p[THIS], *mode == 'r');
2445 PerlLIO_close(p[THIS]);
2446 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2447 PerlLIO_close(p[THAT]);
2450 PerlLIO_close(p[THAT]);
2453 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2460 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2465 /* may or may not use the shell */
2466 do_exec3(cmd, pp[1], did_pipes);
2469 #endif /* defined OS2 */
2471 #ifdef PERLIO_USING_CRLF
2472 /* Since we circumvent IO layers when we manipulate low-level
2473 filedescriptors directly, need to manually switch to the
2474 default, binary, low-level mode; see PerlIOBuf_open(). */
2475 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2478 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2479 SvREADONLY_off(GvSV(tmpgv));
2480 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2481 SvREADONLY_on(GvSV(tmpgv));
2483 #ifdef THREADS_HAVE_PIDS
2484 PL_ppid = (IV)getppid();
2487 #ifdef PERL_USES_PL_PIDSTATUS
2488 hv_clear(PL_pidstatus); /* we have no children */
2494 do_execfree(); /* free any memory malloced by child on vfork */
2496 PerlLIO_close(pp[1]);
2497 if (p[that] < p[This]) {
2498 PerlLIO_dup2(p[This], p[that]);
2499 PerlLIO_close(p[This]);
2503 PerlLIO_close(p[that]);
2505 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2506 SvUPGRADE(sv,SVt_IV);
2508 PL_forkprocess = pid;
2509 if (did_pipes && pid > 0) {
2514 while (n < sizeof(int)) {
2515 n1 = PerlLIO_read(pp[0],
2516 (void*)(((char*)&errkid)+n),
2522 PerlLIO_close(pp[0]);
2524 if (n) { /* Error */
2526 PerlLIO_close(p[This]);
2527 if (n != sizeof(int))
2528 Perl_croak(aTHX_ "panic: kid popen errno read");
2530 pid2 = wait4pid(pid, &status, 0);
2531 } while (pid2 == -1 && errno == EINTR);
2532 errno = errkid; /* Propagate errno from kid */
2537 PerlLIO_close(pp[0]);
2538 return PerlIO_fdopen(p[This], mode);
2541 #if defined(atarist) || defined(EPOC)
2544 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2546 PERL_ARGS_ASSERT_MY_POPEN;
2547 PERL_FLUSHALL_FOR_CHILD;
2548 /* Call system's popen() to get a FILE *, then import it.
2549 used 0 for 2nd parameter to PerlIO_importFILE;
2552 return PerlIO_importFILE(popen(cmd, mode), 0);
2556 FILE *djgpp_popen();
2558 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2560 PERL_FLUSHALL_FOR_CHILD;
2561 /* Call system's popen() to get a FILE *, then import it.
2562 used 0 for 2nd parameter to PerlIO_importFILE;
2565 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2568 #if defined(__LIBCATAMOUNT__)
2570 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2578 #endif /* !DOSISH */
2580 /* this is called in parent before the fork() */
2582 Perl_atfork_lock(void)
2585 #if defined(USE_ITHREADS)
2586 /* locks must be held in locking order (if any) */
2588 MUTEX_LOCK(&PL_malloc_mutex);
2594 /* this is called in both parent and child after the fork() */
2596 Perl_atfork_unlock(void)
2599 #if defined(USE_ITHREADS)
2600 /* locks must be released in same order as in atfork_lock() */
2602 MUTEX_UNLOCK(&PL_malloc_mutex);
2611 #if defined(HAS_FORK)
2613 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2618 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2619 * handlers elsewhere in the code */
2624 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2625 Perl_croak_nocontext("fork() not available");
2627 #endif /* HAS_FORK */
2632 Perl_dump_fds(pTHX_ const char *const s)
2637 PERL_ARGS_ASSERT_DUMP_FDS;
2639 PerlIO_printf(Perl_debug_log,"%s", s);
2640 for (fd = 0; fd < 32; fd++) {
2641 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2642 PerlIO_printf(Perl_debug_log," %d",fd);
2644 PerlIO_printf(Perl_debug_log,"\n");
2647 #endif /* DUMP_FDS */
2651 dup2(int oldfd, int newfd)
2653 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2656 PerlLIO_close(newfd);
2657 return fcntl(oldfd, F_DUPFD, newfd);
2659 #define DUP2_MAX_FDS 256
2660 int fdtmp[DUP2_MAX_FDS];
2666 PerlLIO_close(newfd);
2667 /* good enough for low fd's... */
2668 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2669 if (fdx >= DUP2_MAX_FDS) {
2677 PerlLIO_close(fdtmp[--fdx]);
2684 #ifdef HAS_SIGACTION
2687 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2690 struct sigaction act, oact;
2693 /* only "parent" interpreter can diddle signals */
2694 if (PL_curinterp != aTHX)
2695 return (Sighandler_t) SIG_ERR;
2698 act.sa_handler = (void(*)(int))handler;
2699 sigemptyset(&act.sa_mask);
2702 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2703 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2705 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2706 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2707 act.sa_flags |= SA_NOCLDWAIT;
2709 if (sigaction(signo, &act, &oact) == -1)
2710 return (Sighandler_t) SIG_ERR;
2712 return (Sighandler_t) oact.sa_handler;
2716 Perl_rsignal_state(pTHX_ int signo)
2718 struct sigaction oact;
2719 PERL_UNUSED_CONTEXT;
2721 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2722 return (Sighandler_t) SIG_ERR;
2724 return (Sighandler_t) oact.sa_handler;
2728 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2731 struct sigaction act;
2733 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2736 /* only "parent" interpreter can diddle signals */
2737 if (PL_curinterp != aTHX)
2741 act.sa_handler = (void(*)(int))handler;
2742 sigemptyset(&act.sa_mask);
2745 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2746 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2748 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2749 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2750 act.sa_flags |= SA_NOCLDWAIT;
2752 return sigaction(signo, &act, save);
2756 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2760 /* only "parent" interpreter can diddle signals */
2761 if (PL_curinterp != aTHX)
2765 return sigaction(signo, save, (struct sigaction *)NULL);
2768 #else /* !HAS_SIGACTION */
2771 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2773 #if defined(USE_ITHREADS) && !defined(WIN32)
2774 /* only "parent" interpreter can diddle signals */
2775 if (PL_curinterp != aTHX)
2776 return (Sighandler_t) SIG_ERR;
2779 return PerlProc_signal(signo, handler);
2790 Perl_rsignal_state(pTHX_ int signo)
2793 Sighandler_t oldsig;
2795 #if defined(USE_ITHREADS) && !defined(WIN32)
2796 /* only "parent" interpreter can diddle signals */
2797 if (PL_curinterp != aTHX)
2798 return (Sighandler_t) SIG_ERR;
2802 oldsig = PerlProc_signal(signo, sig_trap);
2803 PerlProc_signal(signo, oldsig);
2805 PerlProc_kill(PerlProc_getpid(), signo);
2810 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2812 #if defined(USE_ITHREADS) && !defined(WIN32)
2813 /* only "parent" interpreter can diddle signals */
2814 if (PL_curinterp != aTHX)
2817 *save = PerlProc_signal(signo, handler);
2818 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2822 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2824 #if defined(USE_ITHREADS) && !defined(WIN32)
2825 /* only "parent" interpreter can diddle signals */
2826 if (PL_curinterp != aTHX)
2829 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2832 #endif /* !HAS_SIGACTION */
2833 #endif /* !PERL_MICRO */
2835 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2836 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2838 Perl_my_pclose(pTHX_ PerlIO *ptr)
2841 Sigsave_t hstat, istat, qstat;
2849 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2850 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2852 *svp = &PL_sv_undef;
2854 if (pid == -1) { /* Opened by popen. */
2855 return my_syspclose(ptr);
2858 close_failed = (PerlIO_close(ptr) == EOF);
2861 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2864 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2865 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2866 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2869 pid2 = wait4pid(pid, &status, 0);
2870 } while (pid2 == -1 && errno == EINTR);
2872 rsignal_restore(SIGHUP, &hstat);
2873 rsignal_restore(SIGINT, &istat);
2874 rsignal_restore(SIGQUIT, &qstat);
2880 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2883 #if defined(__LIBCATAMOUNT__)
2885 Perl_my_pclose(pTHX_ PerlIO *ptr)
2890 #endif /* !DOSISH */
2892 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2894 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2898 PERL_ARGS_ASSERT_WAIT4PID;
2901 #ifdef PERL_USES_PL_PIDSTATUS
2904 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2905 pid, rather than a string form. */
2906 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2907 if (svp && *svp != &PL_sv_undef) {
2908 *statusp = SvIVX(*svp);
2909 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2917 hv_iterinit(PL_pidstatus);
2918 if ((entry = hv_iternext(PL_pidstatus))) {
2919 SV * const sv = hv_iterval(PL_pidstatus,entry);
2921 const char * const spid = hv_iterkey(entry,&len);
2923 assert (len == sizeof(Pid_t));
2924 memcpy((char *)&pid, spid, len);
2925 *statusp = SvIVX(sv);
2926 /* The hash iterator is currently on this entry, so simply
2927 calling hv_delete would trigger the lazy delete, which on
2928 aggregate does more work, beacuse next call to hv_iterinit()
2929 would spot the flag, and have to call the delete routine,
2930 while in the meantime any new entries can't re-use that
2932 hv_iterinit(PL_pidstatus);
2933 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2940 # ifdef HAS_WAITPID_RUNTIME
2941 if (!HAS_WAITPID_RUNTIME)
2944 result = PerlProc_waitpid(pid,statusp,flags);
2947 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2948 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2951 #ifdef PERL_USES_PL_PIDSTATUS
2952 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2957 Perl_croak(aTHX_ "Can't do waitpid with flags");
2959 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2960 pidgone(result,*statusp);
2966 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2969 if (result < 0 && errno == EINTR) {
2971 errno = EINTR; /* reset in case a signal handler changed $! */
2975 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2977 #ifdef PERL_USES_PL_PIDSTATUS
2979 S_pidgone(pTHX_ Pid_t pid, int status)
2983 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2984 SvUPGRADE(sv,SVt_IV);
2985 SvIV_set(sv, status);
2990 #if defined(atarist) || defined(OS2) || defined(EPOC)
2993 int /* Cannot prototype with I32
2995 my_syspclose(PerlIO *ptr)
2998 Perl_my_pclose(pTHX_ PerlIO *ptr)
3001 /* Needs work for PerlIO ! */
3002 FILE * const f = PerlIO_findFILE(ptr);
3003 const I32 result = pclose(f);
3004 PerlIO_releaseFILE(ptr,f);
3012 Perl_my_pclose(pTHX_ PerlIO *ptr)
3014 /* Needs work for PerlIO ! */
3015 FILE * const f = PerlIO_findFILE(ptr);
3016 I32 result = djgpp_pclose(f);
3017 result = (result << 8) & 0xff00;
3018 PerlIO_releaseFILE(ptr,f);
3023 #define PERL_REPEATCPY_LINEAR 4
3025 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3027 PERL_ARGS_ASSERT_REPEATCPY;
3030 memset(to, *from, count);
3032 register char *p = to;
3033 I32 items, linear, half;
3035 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3036 for (items = 0; items < linear; ++items) {
3037 register const char *q = from;
3039 for (todo = len; todo > 0; todo--)
3044 while (items <= half) {
3045 I32 size = items * len;
3046 memcpy(p, to, size);
3052 memcpy(p, to, (count - items) * len);
3058 Perl_same_dirent(pTHX_ const char *a, const char *b)
3060 char *fa = strrchr(a,'/');
3061 char *fb = strrchr(b,'/');
3064 SV * const tmpsv = sv_newmortal();
3066 PERL_ARGS_ASSERT_SAME_DIRENT;
3079 sv_setpvs(tmpsv, ".");
3081 sv_setpvn(tmpsv, a, fa - a);
3082 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3085 sv_setpvs(tmpsv, ".");
3087 sv_setpvn(tmpsv, b, fb - b);
3088 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3090 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3091 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3093 #endif /* !HAS_RENAME */
3096 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3097 const char *const *const search_ext, I32 flags)
3100 const char *xfound = NULL;
3101 char *xfailed = NULL;
3102 char tmpbuf[MAXPATHLEN];
3107 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3108 # define SEARCH_EXTS ".bat", ".cmd", NULL
3109 # define MAX_EXT_LEN 4
3112 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3113 # define MAX_EXT_LEN 4
3116 # define SEARCH_EXTS ".pl", ".com", NULL
3117 # define MAX_EXT_LEN 4
3119 /* additional extensions to try in each dir if scriptname not found */
3121 static const char *const exts[] = { SEARCH_EXTS };
3122 const char *const *const ext = search_ext ? search_ext : exts;
3123 int extidx = 0, i = 0;
3124 const char *curext = NULL;
3126 PERL_UNUSED_ARG(search_ext);
3127 # define MAX_EXT_LEN 0
3130 PERL_ARGS_ASSERT_FIND_SCRIPT;
3133 * If dosearch is true and if scriptname does not contain path
3134 * delimiters, search the PATH for scriptname.
3136 * If SEARCH_EXTS is also defined, will look for each
3137 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3138 * while searching the PATH.
3140 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3141 * proceeds as follows:
3142 * If DOSISH or VMSISH:
3143 * + look for ./scriptname{,.foo,.bar}
3144 * + search the PATH for scriptname{,.foo,.bar}
3147 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3148 * this will not look in '.' if it's not in the PATH)
3153 # ifdef ALWAYS_DEFTYPES
3154 len = strlen(scriptname);
3155 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3156 int idx = 0, deftypes = 1;
3159 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3162 int idx = 0, deftypes = 1;
3165 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3167 /* The first time through, just add SEARCH_EXTS to whatever we
3168 * already have, so we can check for default file types. */
3170 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3176 if ((strlen(tmpbuf) + strlen(scriptname)
3177 + MAX_EXT_LEN) >= sizeof tmpbuf)
3178 continue; /* don't search dir with too-long name */
3179 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3183 if (strEQ(scriptname, "-"))
3185 if (dosearch) { /* Look in '.' first. */
3186 const char *cur = scriptname;
3188 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3190 if (strEQ(ext[i++],curext)) {
3191 extidx = -1; /* already has an ext */
3196 DEBUG_p(PerlIO_printf(Perl_debug_log,
3197 "Looking for %s\n",cur));
3198 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3199 && !S_ISDIR(PL_statbuf.st_mode)) {
3207 if (cur == scriptname) {
3208 len = strlen(scriptname);
3209 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3211 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3214 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3215 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3220 if (dosearch && !strchr(scriptname, '/')
3222 && !strchr(scriptname, '\\')
3224 && (s = PerlEnv_getenv("PATH")))
3228 bufend = s + strlen(s);
3229 while (s < bufend) {
3230 #if defined(atarist) || defined(DOSISH)
3235 && *s != ';'; len++, s++) {
3236 if (len < sizeof tmpbuf)
3239 if (len < sizeof tmpbuf)
3241 #else /* ! (atarist || DOSISH) */
3242 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3245 #endif /* ! (atarist || DOSISH) */
3248 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3249 continue; /* don't search dir with too-long name */
3251 # if defined(atarist) || defined(DOSISH)
3252 && tmpbuf[len - 1] != '/'
3253 && tmpbuf[len - 1] != '\\'
3256 tmpbuf[len++] = '/';
3257 if (len == 2 && tmpbuf[0] == '.')
3259 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3263 len = strlen(tmpbuf);
3264 if (extidx > 0) /* reset after previous loop */
3268 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3269 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3270 if (S_ISDIR(PL_statbuf.st_mode)) {
3274 } while ( retval < 0 /* not there */
3275 && extidx>=0 && ext[extidx] /* try an extension? */
3276 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3281 if (S_ISREG(PL_statbuf.st_mode)
3282 && cando(S_IRUSR,TRUE,&PL_statbuf)
3283 #if !defined(DOSISH)
3284 && cando(S_IXUSR,TRUE,&PL_statbuf)
3288 xfound = tmpbuf; /* bingo! */
3292 xfailed = savepv(tmpbuf);
3295 if (!xfound && !seen_dot && !xfailed &&
3296 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3297 || S_ISDIR(PL_statbuf.st_mode)))
3299 seen_dot = 1; /* Disable message. */
3301 if (flags & 1) { /* do or die? */
3302 Perl_croak(aTHX_ "Can't %s %s%s%s",
3303 (xfailed ? "execute" : "find"),
3304 (xfailed ? xfailed : scriptname),
3305 (xfailed ? "" : " on PATH"),
3306 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3311 scriptname = xfound;
3313 return (scriptname ? savepv(scriptname) : NULL);
3316 #ifndef PERL_GET_CONTEXT_DEFINED
3319 Perl_get_context(void)
3322 #if defined(USE_ITHREADS)
3323 # ifdef OLD_PTHREADS_API
3325 if (pthread_getspecific(PL_thr_key, &t))
3326 Perl_croak_nocontext("panic: pthread_getspecific");
3329 # ifdef I_MACH_CTHREADS
3330 return (void*)cthread_data(cthread_self());
3332 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3341 Perl_set_context(void *t)
3344 PERL_ARGS_ASSERT_SET_CONTEXT;
3345 #if defined(USE_ITHREADS)
3346 # ifdef I_MACH_CTHREADS
3347 cthread_set_data(cthread_self(), t);
3349 if (pthread_setspecific(PL_thr_key, t))
3350 Perl_croak_nocontext("panic: pthread_setspecific");
3357 #endif /* !PERL_GET_CONTEXT_DEFINED */
3359 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3368 Perl_get_op_names(pTHX)
3370 PERL_UNUSED_CONTEXT;
3371 return (char **)PL_op_name;
3375 Perl_get_op_descs(pTHX)
3377 PERL_UNUSED_CONTEXT;
3378 return (char **)PL_op_desc;
3382 Perl_get_no_modify(pTHX)
3384 PERL_UNUSED_CONTEXT;
3385 return PL_no_modify;
3389 Perl_get_opargs(pTHX)
3391 PERL_UNUSED_CONTEXT;
3392 return (U32 *)PL_opargs;
3396 Perl_get_ppaddr(pTHX)
3399 PERL_UNUSED_CONTEXT;
3400 return (PPADDR_t*)PL_ppaddr;
3403 #ifndef HAS_GETENV_LEN
3405 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3407 char * const env_trans = PerlEnv_getenv(env_elem);
3408 PERL_UNUSED_CONTEXT;
3409 PERL_ARGS_ASSERT_GETENV_LEN;
3411 *len = strlen(env_trans);
3418 Perl_get_vtbl(pTHX_ int vtbl_id)
3420 const MGVTBL* result;
3421 PERL_UNUSED_CONTEXT;
3425 result = &PL_vtbl_sv;
3428 result = &PL_vtbl_env;
3430 case want_vtbl_envelem:
3431 result = &PL_vtbl_envelem;
3434 result = &PL_vtbl_sig;
3436 case want_vtbl_sigelem:
3437 result = &PL_vtbl_sigelem;
3439 case want_vtbl_pack:
3440 result = &PL_vtbl_pack;
3442 case want_vtbl_packelem:
3443 result = &PL_vtbl_packelem;
3445 case want_vtbl_dbline:
3446 result = &PL_vtbl_dbline;
3449 result = &PL_vtbl_isa;
3451 case want_vtbl_isaelem:
3452 result = &PL_vtbl_isaelem;
3454 case want_vtbl_arylen:
3455 result = &PL_vtbl_arylen;
3457 case want_vtbl_mglob:
3458 result = &PL_vtbl_mglob;
3460 case want_vtbl_nkeys:
3461 result = &PL_vtbl_nkeys;
3463 case want_vtbl_taint:
3464 result = &PL_vtbl_taint;
3466 case want_vtbl_substr:
3467 result = &PL_vtbl_substr;
3470 result = &PL_vtbl_vec;
3473 result = &PL_vtbl_pos;
3476 result = &PL_vtbl_bm;
3479 result = &PL_vtbl_fm;
3481 case want_vtbl_uvar:
3482 result = &PL_vtbl_uvar;
3484 case want_vtbl_defelem:
3485 result = &PL_vtbl_defelem;
3487 case want_vtbl_regexp:
3488 result = &PL_vtbl_regexp;
3490 case want_vtbl_regdata:
3491 result = &PL_vtbl_regdata;
3493 case want_vtbl_regdatum:
3494 result = &PL_vtbl_regdatum;
3496 #ifdef USE_LOCALE_COLLATE
3497 case want_vtbl_collxfrm:
3498 result = &PL_vtbl_collxfrm;
3501 case want_vtbl_amagic:
3502 result = &PL_vtbl_amagic;
3504 case want_vtbl_amagicelem:
3505 result = &PL_vtbl_amagicelem;
3507 case want_vtbl_backref:
3508 result = &PL_vtbl_backref;
3510 case want_vtbl_utf8:
3511 result = &PL_vtbl_utf8;
3517 return (MGVTBL*)result;
3521 Perl_my_fflush_all(pTHX)
3523 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3524 return PerlIO_flush(NULL);
3526 # if defined(HAS__FWALK)
3527 extern int fflush(FILE *);
3528 /* undocumented, unprototyped, but very useful BSDism */
3529 extern void _fwalk(int (*)(FILE *));
3533 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3535 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3536 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3538 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3539 open_max = sysconf(_SC_OPEN_MAX);
3542 open_max = FOPEN_MAX;
3545 open_max = OPEN_MAX;
3556 for (i = 0; i < open_max; i++)
3557 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3558 STDIO_STREAM_ARRAY[i]._file < open_max &&
3559 STDIO_STREAM_ARRAY[i]._flag)
3560 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3564 SETERRNO(EBADF,RMS_IFI);
3571 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3573 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3575 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3576 if (ckWARN(WARN_IO)) {
3577 const char * const direction =
3578 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3580 Perl_warner(aTHX_ packWARN(WARN_IO),
3581 "Filehandle %s opened only for %sput",
3584 Perl_warner(aTHX_ packWARN(WARN_IO),
3585 "Filehandle opened only for %sput", direction);
3592 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3594 warn_type = WARN_CLOSED;
3598 warn_type = WARN_UNOPENED;
3601 if (ckWARN(warn_type)) {
3602 const char * const pars =
3603 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3604 const char * const func =
3606 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3607 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3608 op < 0 ? "" : /* handle phoney cases */
3610 const char * const type =
3612 (OP_IS_SOCKET(op) ||
3613 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3614 "socket" : "filehandle");
3615 if (name && *name) {
3616 Perl_warner(aTHX_ packWARN(warn_type),
3617 "%s%s on %s %s %s", func, pars, vile, type, name);
3618 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3620 aTHX_ packWARN(warn_type),
3621 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3626 Perl_warner(aTHX_ packWARN(warn_type),
3627 "%s%s on %s %s", func, pars, vile, type);
3628 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3630 aTHX_ packWARN(warn_type),
3631 "\t(Are you trying to call %s%s on dirhandle?)\n",
3640 /* in ASCII order, not that it matters */
3641 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3644 Perl_ebcdic_control(pTHX_ int ch)
3652 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3653 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3656 if (ctlp == controllablechars)
3657 return('\177'); /* DEL */
3659 return((unsigned char)(ctlp - controllablechars - 1));
3660 } else { /* Want uncontrol */
3661 if (ch == '\177' || ch == -1)
3663 else if (ch == '\157')
3665 else if (ch == '\174')
3667 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3669 else if (ch == '\155')
3671 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3672 return(controllablechars[ch+1]);
3674 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3679 /* To workaround core dumps from the uninitialised tm_zone we get the
3680 * system to give us a reasonable struct to copy. This fix means that
3681 * strftime uses the tm_zone and tm_gmtoff values returned by
3682 * localtime(time()). That should give the desired result most of the
3683 * time. But probably not always!
3685 * This does not address tzname aspects of NETaa14816.
3690 # ifndef STRUCT_TM_HASZONE
3691 # define STRUCT_TM_HASZONE
3695 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3696 # ifndef HAS_TM_TM_ZONE
3697 # define HAS_TM_TM_ZONE
3702 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3704 #ifdef HAS_TM_TM_ZONE
3706 const struct tm* my_tm;
3707 PERL_ARGS_ASSERT_INIT_TM;
3709 my_tm = localtime(&now);
3711 Copy(my_tm, ptm, 1, struct tm);
3713 PERL_ARGS_ASSERT_INIT_TM;
3714 PERL_UNUSED_ARG(ptm);
3719 * mini_mktime - normalise struct tm values without the localtime()
3720 * semantics (and overhead) of mktime().
3723 Perl_mini_mktime(pTHX_ struct tm *ptm)
3727 int month, mday, year, jday;
3728 int odd_cent, odd_year;
3729 PERL_UNUSED_CONTEXT;
3731 PERL_ARGS_ASSERT_MINI_MKTIME;
3733 #define DAYS_PER_YEAR 365
3734 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3735 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3736 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3737 #define SECS_PER_HOUR (60*60)
3738 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3739 /* parentheses deliberately absent on these two, otherwise they don't work */
3740 #define MONTH_TO_DAYS 153/5
3741 #define DAYS_TO_MONTH 5/153
3742 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3743 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3744 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3745 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3748 * Year/day algorithm notes:
3750 * With a suitable offset for numeric value of the month, one can find
3751 * an offset into the year by considering months to have 30.6 (153/5) days,
3752 * using integer arithmetic (i.e., with truncation). To avoid too much
3753 * messing about with leap days, we consider January and February to be
3754 * the 13th and 14th month of the previous year. After that transformation,
3755 * we need the month index we use to be high by 1 from 'normal human' usage,
3756 * so the month index values we use run from 4 through 15.
3758 * Given that, and the rules for the Gregorian calendar (leap years are those
3759 * divisible by 4 unless also divisible by 100, when they must be divisible
3760 * by 400 instead), we can simply calculate the number of days since some
3761 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3762 * the days we derive from our month index, and adding in the day of the
3763 * month. The value used here is not adjusted for the actual origin which
3764 * it normally would use (1 January A.D. 1), since we're not exposing it.
3765 * We're only building the value so we can turn around and get the
3766 * normalised values for the year, month, day-of-month, and day-of-year.
3768 * For going backward, we need to bias the value we're using so that we find
3769 * the right year value. (Basically, we don't want the contribution of
3770 * March 1st to the number to apply while deriving the year). Having done
3771 * that, we 'count up' the contribution to the year number by accounting for
3772 * full quadracenturies (400-year periods) with their extra leap days, plus
3773 * the contribution from full centuries (to avoid counting in the lost leap
3774 * days), plus the contribution from full quad-years (to count in the normal
3775 * leap days), plus the leftover contribution from any non-leap years.
3776 * At this point, if we were working with an actual leap day, we'll have 0
3777 * days left over. This is also true for March 1st, however. So, we have
3778 * to special-case that result, and (earlier) keep track of the 'odd'
3779 * century and year contributions. If we got 4 extra centuries in a qcent,
3780 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3781 * Otherwise, we add back in the earlier bias we removed (the 123 from
3782 * figuring in March 1st), find the month index (integer division by 30.6),
3783 * and the remainder is the day-of-month. We then have to convert back to
3784 * 'real' months (including fixing January and February from being 14/15 in
3785 * the previous year to being in the proper year). After that, to get
3786 * tm_yday, we work with the normalised year and get a new yearday value for
3787 * January 1st, which we subtract from the yearday value we had earlier,
3788 * representing the date we've re-built. This is done from January 1
3789 * because tm_yday is 0-origin.
3791 * Since POSIX time routines are only guaranteed to work for times since the
3792 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3793 * applies Gregorian calendar rules even to dates before the 16th century
3794 * doesn't bother me. Besides, you'd need cultural context for a given
3795 * date to know whether it was Julian or Gregorian calendar, and that's
3796 * outside the scope for this routine. Since we convert back based on the
3797 * same rules we used to build the yearday, you'll only get strange results
3798 * for input which needed normalising, or for the 'odd' century years which
3799 * were leap years in the Julian calander but not in the Gregorian one.
3800 * I can live with that.
3802 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3803 * that's still outside the scope for POSIX time manipulation, so I don't
3807 year = 1900 + ptm->tm_year;
3808 month = ptm->tm_mon;
3809 mday = ptm->tm_mday;
3810 /* allow given yday with no month & mday to dominate the result */
3811 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3814 jday = 1 + ptm->tm_yday;
3823 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3824 yearday += month*MONTH_TO_DAYS + mday + jday;
3826 * Note that we don't know when leap-seconds were or will be,
3827 * so we have to trust the user if we get something which looks
3828 * like a sensible leap-second. Wild values for seconds will
3829 * be rationalised, however.
3831 if ((unsigned) ptm->tm_sec <= 60) {
3838 secs += 60 * ptm->tm_min;
3839 secs += SECS_PER_HOUR * ptm->tm_hour;
3841 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3842 /* got negative remainder, but need positive time */
3843 /* back off an extra day to compensate */
3844 yearday += (secs/SECS_PER_DAY)-1;
3845 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3848 yearday += (secs/SECS_PER_DAY);
3849 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3852 else if (secs >= SECS_PER_DAY) {
3853 yearday += (secs/SECS_PER_DAY);
3854 secs %= SECS_PER_DAY;
3856 ptm->tm_hour = secs/SECS_PER_HOUR;
3857 secs %= SECS_PER_HOUR;
3858 ptm->tm_min = secs/60;
3860 ptm->tm_sec += secs;
3861 /* done with time of day effects */
3863 * The algorithm for yearday has (so far) left it high by 428.
3864 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3865 * bias it by 123 while trying to figure out what year it
3866 * really represents. Even with this tweak, the reverse
3867 * translation fails for years before A.D. 0001.
3868 * It would still fail for Feb 29, but we catch that one below.
3870 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3871 yearday -= YEAR_ADJUST;
3872 year = (yearday / DAYS_PER_QCENT) * 400;
3873 yearday %= DAYS_PER_QCENT;
3874 odd_cent = yearday / DAYS_PER_CENT;
3875 year += odd_cent * 100;
3876 yearday %= DAYS_PER_CENT;
3877 year += (yearday / DAYS_PER_QYEAR) * 4;
3878 yearday %= DAYS_PER_QYEAR;
3879 odd_year = yearday / DAYS_PER_YEAR;
3881 yearday %= DAYS_PER_YEAR;
3882 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3887 yearday += YEAR_ADJUST; /* recover March 1st crock */
3888 month = yearday*DAYS_TO_MONTH;
3889 yearday -= month*MONTH_TO_DAYS;
3890 /* recover other leap-year adjustment */
3899 ptm->tm_year = year - 1900;
3901 ptm->tm_mday = yearday;
3902 ptm->tm_mon = month;
3906 ptm->tm_mon = month - 1;
3908 /* re-build yearday based on Jan 1 to get tm_yday */
3910 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3911 yearday += 14*MONTH_TO_DAYS + 1;
3912 ptm->tm_yday = jday - yearday;
3913 /* fix tm_wday if not overridden by caller */
3914 if ((unsigned)ptm->tm_wday > 6)
3915 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3919 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)
3927 PERL_ARGS_ASSERT_MY_STRFTIME;
3929 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3932 mytm.tm_hour = hour;
3933 mytm.tm_mday = mday;
3935 mytm.tm_year = year;
3936 mytm.tm_wday = wday;
3937 mytm.tm_yday = yday;
3938 mytm.tm_isdst = isdst;
3940 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3941 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3946 #ifdef HAS_TM_TM_GMTOFF
3947 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3949 #ifdef HAS_TM_TM_ZONE
3950 mytm.tm_zone = mytm2.tm_zone;
3955 Newx(buf, buflen, char);
3956 len = strftime(buf, buflen, fmt, &mytm);
3958 ** The following is needed to handle to the situation where
3959 ** tmpbuf overflows. Basically we want to allocate a buffer
3960 ** and try repeatedly. The reason why it is so complicated
3961 ** is that getting a return value of 0 from strftime can indicate
3962 ** one of the following:
3963 ** 1. buffer overflowed,
3964 ** 2. illegal conversion specifier, or
3965 ** 3. the format string specifies nothing to be returned(not
3966 ** an error). This could be because format is an empty string
3967 ** or it specifies %p that yields an empty string in some locale.
3968 ** If there is a better way to make it portable, go ahead by
3971 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3974 /* Possibly buf overflowed - try again with a bigger buf */
3975 const int fmtlen = strlen(fmt);
3976 int bufsize = fmtlen + buflen;
3978 Newx(buf, bufsize, char);
3980 buflen = strftime(buf, bufsize, fmt, &mytm);
3981 if (buflen > 0 && buflen < bufsize)
3983 /* heuristic to prevent out-of-memory errors */
3984 if (bufsize > 100*fmtlen) {
3990 Renew(buf, bufsize, char);
3995 Perl_croak(aTHX_ "panic: no strftime");
4001 #define SV_CWD_RETURN_UNDEF \
4002 sv_setsv(sv, &PL_sv_undef); \
4005 #define SV_CWD_ISDOT(dp) \
4006 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4007 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4010 =head1 Miscellaneous Functions
4012 =for apidoc getcwd_sv
4014 Fill the sv with current working directory
4019 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4020 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4021 * getcwd(3) if available
4022 * Comments from the orignal:
4023 * This is a faster version of getcwd. It's also more dangerous
4024 * because you might chdir out of a directory that you can't chdir
4028 Perl_getcwd_sv(pTHX_ register SV *sv)
4032 #ifndef INCOMPLETE_TAINTS
4036 PERL_ARGS_ASSERT_GETCWD_SV;
4040 char buf[MAXPATHLEN];
4042 /* Some getcwd()s automatically allocate a buffer of the given
4043 * size from the heap if they are given a NULL buffer pointer.
4044 * The problem is that this behaviour is not portable. */
4045 if (getcwd(buf, sizeof(buf) - 1)) {
4050 sv_setsv(sv, &PL_sv_undef);
4058 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4062 SvUPGRADE(sv, SVt_PV);
4064 if (PerlLIO_lstat(".", &statbuf) < 0) {
4065 SV_CWD_RETURN_UNDEF;
4068 orig_cdev = statbuf.st_dev;
4069 orig_cino = statbuf.st_ino;
4079 if (PerlDir_chdir("..") < 0) {
4080 SV_CWD_RETURN_UNDEF;
4082 if (PerlLIO_stat(".", &statbuf) < 0) {
4083 SV_CWD_RETURN_UNDEF;
4086 cdev = statbuf.st_dev;
4087 cino = statbuf.st_ino;
4089 if (odev == cdev && oino == cino) {
4092 if (!(dir = PerlDir_open("."))) {
4093 SV_CWD_RETURN_UNDEF;
4096 while ((dp = PerlDir_read(dir)) != NULL) {
4098 namelen = dp->d_namlen;
4100 namelen = strlen(dp->d_name);
4103 if (SV_CWD_ISDOT(dp)) {
4107 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4108 SV_CWD_RETURN_UNDEF;
4111 tdev = statbuf.st_dev;
4112 tino = statbuf.st_ino;
4113 if (tino == oino && tdev == odev) {
4119 SV_CWD_RETURN_UNDEF;
4122 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4123 SV_CWD_RETURN_UNDEF;
4126 SvGROW(sv, pathlen + namelen + 1);
4130 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4133 /* prepend current directory to the front */
4135 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4136 pathlen += (namelen + 1);
4138 #ifdef VOID_CLOSEDIR
4141 if (PerlDir_close(dir) < 0) {
4142 SV_CWD_RETURN_UNDEF;
4148 SvCUR_set(sv, pathlen);
4152 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4153 SV_CWD_RETURN_UNDEF;
4156 if (PerlLIO_stat(".", &statbuf) < 0) {
4157 SV_CWD_RETURN_UNDEF;
4160 cdev = statbuf.st_dev;
4161 cino = statbuf.st_ino;
4163 if (cdev != orig_cdev || cino != orig_cino) {
4164 Perl_croak(aTHX_ "Unstable directory path, "
4165 "current directory changed unexpectedly");
4176 #define VERSION_MAX 0x7FFFFFFF
4178 =for apidoc scan_version
4180 Returns a pointer to the next character after the parsed
4181 version string, as well as upgrading the passed in SV to
4184 Function must be called with an already existing SV like
4187 s = scan_version(s, SV *sv, bool qv);
4189 Performs some preprocessing to the string to ensure that
4190 it has the correct characteristics of a version. Flags the
4191 object if it contains an underscore (which denotes this
4192 is an alpha version). The boolean qv denotes that the version
4193 should be interpreted as if it had multiple decimals, even if
4200 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4209 AV * const av = newAV();
4210 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4212 PERL_ARGS_ASSERT_SCAN_VERSION;
4214 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4216 while (isSPACE(*s)) /* leading whitespace is OK */
4222 s++; /* get past 'v' */
4223 qv = 1; /* force quoted version processing */
4228 /* pre-scan the input string to check for decimals/underbars */
4229 while ( *pos == '.' || *pos == '_' || *pos == ',' || isDIGIT(*pos) )
4234 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4238 else if ( *pos == '_' )
4241 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4243 width = pos - last - 1; /* natural width of sub-version */
4245 else if ( *pos == ',' && isDIGIT(pos[1]) )
4254 if ( alpha && !saw_period )
4255 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4257 if ( alpha && saw_period && width == 0 )
4258 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4260 if ( saw_period > 1 )
4261 qv = 1; /* force quoted version processing */
4267 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4269 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4270 if ( !qv && width < 3 )
4271 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4273 while (isDIGIT(*pos))
4275 if (!isALPHA(*pos)) {
4281 /* this is atoi() that delimits on underscores */
4282 const char *end = pos;
4286 /* the following if() will only be true after the decimal
4287 * point of a version originally created with a bare
4288 * floating point number, i.e. not quoted in any way
4290 if ( !qv && s > start && saw_period == 1 ) {
4294 rev += (*s - '0') * mult;
4296 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4297 || (PERL_ABS(rev) > VERSION_MAX )) {
4298 if(ckWARN(WARN_OVERFLOW))
4299 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4300 "Integer overflow in version %d",VERSION_MAX);
4311 while (--end >= s) {
4313 rev += (*end - '0') * mult;
4315 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4316 || (PERL_ABS(rev) > VERSION_MAX )) {
4317 if(ckWARN(WARN_OVERFLOW))
4318 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4319 "Integer overflow in version");
4328 /* Append revision */
4329 av_push(av, newSViv(rev));
4334 else if ( *pos == '.' )
4336 else if ( *pos == '_' && isDIGIT(pos[1]) )
4338 else if ( *pos == ',' && isDIGIT(pos[1]) )
4340 else if ( isDIGIT(*pos) )
4347 while ( isDIGIT(*pos) )
4352 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4360 if ( qv ) { /* quoted versions always get at least three terms*/
4361 I32 len = av_len(av);
4362 /* This for loop appears to trigger a compiler bug on OS X, as it
4363 loops infinitely. Yes, len is negative. No, it makes no sense.
4364 Compiler in question is:
4365 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4366 for ( len = 2 - len; len > 0; len-- )
4367 av_push(MUTABLE_AV(sv), newSViv(0));
4371 av_push(av, newSViv(0));
4374 /* need to save off the current version string for later */
4376 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4377 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4378 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4380 else if ( s > start ) {
4381 SV * orig = newSVpvn(start,s-start);
4382 if ( qv && saw_period == 1 && *start != 'v' ) {
4383 /* need to insert a v to be consistent */
4384 sv_insert(orig, 0, 0, "v", 1);
4386 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4389 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4390 av_push(av, newSViv(0));
4393 /* And finally, store the AV in the hash */
4394 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4396 /* fix RT#19517 - special case 'undef' as string */
4397 if ( *s == 'u' && strEQ(s,"undef") ) {
4405 =for apidoc new_version
4407 Returns a new version object based on the passed in SV:
4409 SV *sv = new_version(SV *ver);
4411 Does not alter the passed in ver SV. See "upg_version" if you
4412 want to upgrade the SV.
4418 Perl_new_version(pTHX_ SV *ver)
4421 SV * const rv = newSV(0);
4422 PERL_ARGS_ASSERT_NEW_VERSION;
4423 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4426 AV * const av = newAV();
4428 /* This will get reblessed later if a derived class*/
4429 SV * const hv = newSVrv(rv, "version");
4430 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4435 /* Begin copying all of the elements */
4436 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4437 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4439 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4440 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4442 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4444 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4445 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4448 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4450 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4451 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4454 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4455 /* This will get reblessed later if a derived class*/
4456 for ( key = 0; key <= av_len(sav); key++ )
4458 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4459 av_push(av, newSViv(rev));
4462 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4467 const MAGIC* const mg = SvVSTRING_mg(ver);
4468 if ( mg ) { /* already a v-string */
4469 const STRLEN len = mg->mg_len;
4470 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4471 sv_setpvn(rv,version,len);
4472 /* this is for consistency with the pure Perl class */
4473 if ( *version != 'v' )
4474 sv_insert(rv, 0, 0, "v", 1);
4479 sv_setsv(rv,ver); /* make a duplicate */
4484 return upg_version(rv, FALSE);
4488 =for apidoc upg_version
4490 In-place upgrade of the supplied SV to a version object.
4492 SV *sv = upg_version(SV *sv, bool qv);
4494 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4495 to force this SV to be interpreted as an "extended" version.
4501 Perl_upg_version(pTHX_ SV *ver, bool qv)
4503 const char *version, *s;
4508 PERL_ARGS_ASSERT_UPG_VERSION;
4510 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4512 /* may get too much accuracy */
4514 #ifdef USE_LOCALE_NUMERIC
4515 char *loc = setlocale(LC_NUMERIC, "C");
4517 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4518 #ifdef USE_LOCALE_NUMERIC
4519 setlocale(LC_NUMERIC, loc);
4521 while (tbuf[len-1] == '0' && len > 0) len--;
4522 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4523 version = savepvn(tbuf, len);
4526 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4527 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4531 else /* must be a string or something like a string */
4534 version = savepv(SvPV(ver,len));
4536 # if PERL_VERSION > 5
4537 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4538 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4539 /* may be a v-string */
4540 SV * const nsv = sv_newmortal();
4544 sv_setpvf(nsv,"v%vd",ver);
4545 pos = nver = savepv(SvPV_nolen(nsv));
4547 /* scan the resulting formatted string */
4548 pos++; /* skip the leading 'v' */
4549 while ( *pos == '.' || isDIGIT(*pos) ) {
4555 /* is definitely a v-string */
4556 if ( saw_period == 2 ) {
4565 s = scan_version(version, ver, qv);
4567 if(ckWARN(WARN_MISC))
4568 Perl_warner(aTHX_ packWARN(WARN_MISC),
4569 "Version string '%s' contains invalid data; "
4570 "ignoring: '%s'", version, s);
4578 Validates that the SV contains a valid version object.
4580 bool vverify(SV *vobj);
4582 Note that it only confirms the bare minimum structure (so as not to get
4583 confused by derived classes which may contain additional hash entries):
4587 =item * The SV contains a [reference to a] hash
4589 =item * The hash contains a "version" key
4591 =item * The "version" key has [a reference to] an AV as its value
4599 Perl_vverify(pTHX_ SV *vs)
4603 PERL_ARGS_ASSERT_VVERIFY;
4608 /* see if the appropriate elements exist */
4609 if ( SvTYPE(vs) == SVt_PVHV
4610 && hv_exists(MUTABLE_HV(vs), "version", 7)
4611 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4612 && SvTYPE(sv) == SVt_PVAV )
4621 Accepts a version object and returns the normalized floating
4622 point representation. Call like:
4626 NOTE: you can pass either the object directly or the SV
4627 contained within the RV.
4633 Perl_vnumify(pTHX_ SV *vs)
4638 SV * const sv = newSV(0);
4641 PERL_ARGS_ASSERT_VNUMIFY;
4647 Perl_croak(aTHX_ "Invalid version object");
4649 /* see if various flags exist */
4650 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4652 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4653 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4658 /* attempt to retrieve the version array */
4659 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4671 digit = SvIV(*av_fetch(av, 0, 0));
4672 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4673 for ( i = 1 ; i < len ; i++ )
4675 digit = SvIV(*av_fetch(av, i, 0));
4677 const int denom = (width == 2 ? 10 : 100);
4678 const div_t term = div((int)PERL_ABS(digit),denom);
4679 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4682 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4688 digit = SvIV(*av_fetch(av, len, 0));
4689 if ( alpha && width == 3 ) /* alpha version */
4691 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4695 sv_catpvs(sv, "000");
4703 Accepts a version object and returns the normalized string
4704 representation. Call like:
4708 NOTE: you can pass either the object directly or the SV
4709 contained within the RV.
4715 Perl_vnormal(pTHX_ SV *vs)
4719 SV * const sv = newSV(0);
4722 PERL_ARGS_ASSERT_VNORMAL;
4728 Perl_croak(aTHX_ "Invalid version object");
4730 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4732 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4740 digit = SvIV(*av_fetch(av, 0, 0));
4741 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4742 for ( i = 1 ; i < len ; i++ ) {
4743 digit = SvIV(*av_fetch(av, i, 0));
4744 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4749 /* handle last digit specially */
4750 digit = SvIV(*av_fetch(av, len, 0));
4752 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4754 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4757 if ( len <= 2 ) { /* short version, must be at least three */
4758 for ( len = 2 - len; len != 0; len-- )
4765 =for apidoc vstringify
4767 In order to maintain maximum compatibility with earlier versions
4768 of Perl, this function will return either the floating point
4769 notation or the multiple dotted notation, depending on whether
4770 the original version contained 1 or more dots, respectively
4776 Perl_vstringify(pTHX_ SV *vs)
4778 PERL_ARGS_ASSERT_VSTRINGIFY;
4784 Perl_croak(aTHX_ "Invalid version object");
4786 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4788 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4792 return &PL_sv_undef;
4795 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4805 Version object aware cmp. Both operands must already have been
4806 converted into version objects.
4812 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4815 bool lalpha = FALSE;
4816 bool ralpha = FALSE;
4821 PERL_ARGS_ASSERT_VCMP;
4828 if ( !vverify(lhv) )
4829 Perl_croak(aTHX_ "Invalid version object");
4831 if ( !vverify(rhv) )
4832 Perl_croak(aTHX_ "Invalid version object");
4834 /* get the left hand term */
4835 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4836 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4839 /* and the right hand term */
4840 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4841 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4849 while ( i <= m && retval == 0 )
4851 left = SvIV(*av_fetch(lav,i,0));
4852 right = SvIV(*av_fetch(rav,i,0));
4860 /* tiebreaker for alpha with identical terms */
4861 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4863 if ( lalpha && !ralpha )
4867 else if ( ralpha && !lalpha)
4873 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4877 while ( i <= r && retval == 0 )
4879 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4880 retval = -1; /* not a match after all */
4886 while ( i <= l && retval == 0 )
4888 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4889 retval = +1; /* not a match after all */
4897 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4898 # define EMULATE_SOCKETPAIR_UDP
4901 #ifdef EMULATE_SOCKETPAIR_UDP
4903 S_socketpair_udp (int fd[2]) {
4905 /* Fake a datagram socketpair using UDP to localhost. */
4906 int sockets[2] = {-1, -1};
4907 struct sockaddr_in addresses[2];
4909 Sock_size_t size = sizeof(struct sockaddr_in);
4910 unsigned short port;
4913 memset(&addresses, 0, sizeof(addresses));
4916 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4917 if (sockets[i] == -1)
4918 goto tidy_up_and_fail;
4920 addresses[i].sin_family = AF_INET;
4921 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4922 addresses[i].sin_port = 0; /* kernel choses port. */
4923 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4924 sizeof(struct sockaddr_in)) == -1)
4925 goto tidy_up_and_fail;
4928 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4929 for each connect the other socket to it. */
4932 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4934 goto tidy_up_and_fail;
4935 if (size != sizeof(struct sockaddr_in))
4936 goto abort_tidy_up_and_fail;
4937 /* !1 is 0, !0 is 1 */
4938 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4939 sizeof(struct sockaddr_in)) == -1)
4940 goto tidy_up_and_fail;
4943 /* Now we have 2 sockets connected to each other. I don't trust some other
4944 process not to have already sent a packet to us (by random) so send
4945 a packet from each to the other. */
4948 /* I'm going to send my own port number. As a short.
4949 (Who knows if someone somewhere has sin_port as a bitfield and needs
4950 this routine. (I'm assuming crays have socketpair)) */
4951 port = addresses[i].sin_port;
4952 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4953 if (got != sizeof(port)) {
4955 goto tidy_up_and_fail;
4956 goto abort_tidy_up_and_fail;
4960 /* Packets sent. I don't trust them to have arrived though.
4961 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4962 connect to localhost will use a second kernel thread. In 2.6 the
4963 first thread running the connect() returns before the second completes,
4964 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4965 returns 0. Poor programs have tripped up. One poor program's authors'
4966 had a 50-1 reverse stock split. Not sure how connected these were.)
4967 So I don't trust someone not to have an unpredictable UDP stack.
4971 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4972 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4976 FD_SET((unsigned int)sockets[0], &rset);
4977 FD_SET((unsigned int)sockets[1], &rset);
4979 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4980 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4981 || !FD_ISSET(sockets[1], &rset)) {
4982 /* I hope this is portable and appropriate. */
4984 goto tidy_up_and_fail;
4985 goto abort_tidy_up_and_fail;
4989 /* And the paranoia department even now doesn't trust it to have arrive
4990 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4992 struct sockaddr_in readfrom;
4993 unsigned short buffer[2];
4998 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4999 sizeof(buffer), MSG_DONTWAIT,
5000 (struct sockaddr *) &readfrom, &size);
5002 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5004 (struct sockaddr *) &readfrom, &size);
5008 goto tidy_up_and_fail;
5009 if (got != sizeof(port)
5010 || size != sizeof(struct sockaddr_in)
5011 /* Check other socket sent us its port. */
5012 || buffer[0] != (unsigned short) addresses[!i].sin_port
5013 /* Check kernel says we got the datagram from that socket */
5014 || readfrom.sin_family != addresses[!i].sin_family
5015 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5016 || readfrom.sin_port != addresses[!i].sin_port)
5017 goto abort_tidy_up_and_fail;
5020 /* My caller (my_socketpair) has validated that this is non-NULL */
5023 /* I hereby declare this connection open. May God bless all who cross
5027 abort_tidy_up_and_fail:
5028 errno = ECONNABORTED;
5032 if (sockets[0] != -1)
5033 PerlLIO_close(sockets[0]);
5034 if (sockets[1] != -1)
5035 PerlLIO_close(sockets[1]);
5040 #endif /* EMULATE_SOCKETPAIR_UDP */
5042 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5044 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5045 /* Stevens says that family must be AF_LOCAL, protocol 0.
5046 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5051 struct sockaddr_in listen_addr;
5052 struct sockaddr_in connect_addr;
5057 || family != AF_UNIX
5060 errno = EAFNOSUPPORT;
5068 #ifdef EMULATE_SOCKETPAIR_UDP
5069 if (type == SOCK_DGRAM)
5070 return S_socketpair_udp(fd);
5073 listener = PerlSock_socket(AF_INET, type, 0);
5076 memset(&listen_addr, 0, sizeof(listen_addr));
5077 listen_addr.sin_family = AF_INET;
5078 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5079 listen_addr.sin_port = 0; /* kernel choses port. */
5080 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5081 sizeof(listen_addr)) == -1)
5082 goto tidy_up_and_fail;
5083 if (PerlSock_listen(listener, 1) == -1)
5084 goto tidy_up_and_fail;
5086 connector = PerlSock_socket(AF_INET, type, 0);
5087 if (connector == -1)
5088 goto tidy_up_and_fail;
5089 /* We want to find out the port number to connect to. */
5090 size = sizeof(connect_addr);
5091 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5093 goto tidy_up_and_fail;
5094 if (size != sizeof(connect_addr))
5095 goto abort_tidy_up_and_fail;
5096 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5097 sizeof(connect_addr)) == -1)
5098 goto tidy_up_and_fail;
5100 size = sizeof(listen_addr);
5101 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5104 goto tidy_up_and_fail;
5105 if (size != sizeof(listen_addr))
5106 goto abort_tidy_up_and_fail;
5107 PerlLIO_close(listener);
5108 /* Now check we are talking to ourself by matching port and host on the
5110 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5112 goto tidy_up_and_fail;
5113 if (size != sizeof(connect_addr)
5114 || listen_addr.sin_family != connect_addr.sin_family
5115 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5116 || listen_addr.sin_port != connect_addr.sin_port) {
5117 goto abort_tidy_up_and_fail;
5123 abort_tidy_up_and_fail:
5125 errno = ECONNABORTED; /* This would be the standard thing to do. */
5127 # ifdef ECONNREFUSED
5128 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5130 errno = ETIMEDOUT; /* Desperation time. */
5137 PerlLIO_close(listener);
5138 if (connector != -1)
5139 PerlLIO_close(connector);
5141 PerlLIO_close(acceptor);
5147 /* In any case have a stub so that there's code corresponding
5148 * to the my_socketpair in global.sym. */
5150 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5151 #ifdef HAS_SOCKETPAIR
5152 return socketpair(family, type, protocol, fd);
5161 =for apidoc sv_nosharing
5163 Dummy routine which "shares" an SV when there is no sharing module present.
5164 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5165 Exists to avoid test for a NULL function pointer and because it could
5166 potentially warn under some level of strict-ness.
5172 Perl_sv_nosharing(pTHX_ SV *sv)
5174 PERL_UNUSED_CONTEXT;
5175 PERL_UNUSED_ARG(sv);
5180 =for apidoc sv_destroyable
5182 Dummy routine which reports that object can be destroyed when there is no
5183 sharing module present. It ignores its single SV argument, and returns
5184 'true'. Exists to avoid test for a NULL function pointer and because it
5185 could potentially warn under some level of strict-ness.
5191 Perl_sv_destroyable(pTHX_ SV *sv)
5193 PERL_UNUSED_CONTEXT;
5194 PERL_UNUSED_ARG(sv);
5199 Perl_parse_unicode_opts(pTHX_ const char **popt)
5201 const char *p = *popt;
5204 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5208 opt = (U32) atoi(p);
5211 if (*p && *p != '\n' && *p != '\r')
5212 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5217 case PERL_UNICODE_STDIN:
5218 opt |= PERL_UNICODE_STDIN_FLAG; break;
5219 case PERL_UNICODE_STDOUT:
5220 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5221 case PERL_UNICODE_STDERR:
5222 opt |= PERL_UNICODE_STDERR_FLAG; break;
5223 case PERL_UNICODE_STD:
5224 opt |= PERL_UNICODE_STD_FLAG; break;
5225 case PERL_UNICODE_IN:
5226 opt |= PERL_UNICODE_IN_FLAG; break;
5227 case PERL_UNICODE_OUT:
5228 opt |= PERL_UNICODE_OUT_FLAG; break;
5229 case PERL_UNICODE_INOUT:
5230 opt |= PERL_UNICODE_INOUT_FLAG; break;
5231 case PERL_UNICODE_LOCALE:
5232 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5233 case PERL_UNICODE_ARGV:
5234 opt |= PERL_UNICODE_ARGV_FLAG; break;
5235 case PERL_UNICODE_UTF8CACHEASSERT:
5236 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5238 if (*p != '\n' && *p != '\r')
5240 "Unknown Unicode option letter '%c'", *p);
5246 opt = PERL_UNICODE_DEFAULT_FLAGS;
5248 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5249 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5250 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5262 * This is really just a quick hack which grabs various garbage
5263 * values. It really should be a real hash algorithm which
5264 * spreads the effect of every input bit onto every output bit,
5265 * if someone who knows about such things would bother to write it.
5266 * Might be a good idea to add that function to CORE as well.
5267 * No numbers below come from careful analysis or anything here,
5268 * except they are primes and SEED_C1 > 1E6 to get a full-width
5269 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5270 * probably be bigger too.
5273 # define SEED_C1 1000003
5274 #define SEED_C4 73819
5276 # define SEED_C1 25747
5277 #define SEED_C4 20639
5281 #define SEED_C5 26107
5283 #ifndef PERL_NO_DEV_RANDOM
5288 # include <starlet.h>
5289 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5290 * in 100-ns units, typically incremented ever 10 ms. */
5291 unsigned int when[2];
5293 # ifdef HAS_GETTIMEOFDAY
5294 struct timeval when;
5300 /* This test is an escape hatch, this symbol isn't set by Configure. */
5301 #ifndef PERL_NO_DEV_RANDOM
5302 #ifndef PERL_RANDOM_DEVICE
5303 /* /dev/random isn't used by default because reads from it will block
5304 * if there isn't enough entropy available. You can compile with
5305 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5306 * is enough real entropy to fill the seed. */
5307 # define PERL_RANDOM_DEVICE "/dev/urandom"
5309 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5311 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5320 _ckvmssts(sys$gettim(when));
5321 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5323 # ifdef HAS_GETTIMEOFDAY
5324 PerlProc_gettimeofday(&when,NULL);
5325 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5328 u = (U32)SEED_C1 * when;
5331 u += SEED_C3 * (U32)PerlProc_getpid();
5332 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5333 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5334 u += SEED_C5 * (U32)PTR2UV(&when);
5340 Perl_get_hash_seed(pTHX)
5343 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5349 if (s && isDIGIT(*s))
5350 myseed = (UV)Atoul(s);
5352 #ifdef USE_HASH_SEED_EXPLICIT
5356 /* Compute a random seed */
5357 (void)seedDrand01((Rand_seed_t)seed());
5358 myseed = (UV)(Drand01() * (NV)UV_MAX);
5359 #if RANDBITS < (UVSIZE * 8)
5360 /* Since there are not enough randbits to to reach all
5361 * the bits of a UV, the low bits might need extra
5362 * help. Sum in another random number that will
5363 * fill in the low bits. */
5365 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5366 #endif /* RANDBITS < (UVSIZE * 8) */
5367 if (myseed == 0) { /* Superparanoia. */
5368 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5370 Perl_croak(aTHX_ "Your random numbers are not that random");
5373 PL_rehash_seed_set = TRUE;
5380 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5382 const char * const stashpv = CopSTASHPV(c);
5383 const char * const name = HvNAME_get(hv);
5384 PERL_UNUSED_CONTEXT;
5385 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5387 if (stashpv == name)
5389 if (stashpv && name)
5390 if (strEQ(stashpv, name))
5397 #ifdef PERL_GLOBAL_STRUCT
5399 #define PERL_GLOBAL_STRUCT_INIT
5400 #include "opcode.h" /* the ppaddr and check */
5403 Perl_init_global_struct(pTHX)
5405 struct perl_vars *plvarsp = NULL;
5406 # ifdef PERL_GLOBAL_STRUCT
5407 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5408 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5409 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5410 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5411 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5415 plvarsp = PL_VarsPtr;
5416 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5422 # define PERLVAR(var,type) /**/
5423 # define PERLVARA(var,n,type) /**/
5424 # define PERLVARI(var,type,init) plvarsp->var = init;
5425 # define PERLVARIC(var,type,init) plvarsp->var = init;
5426 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5427 # include "perlvars.h"
5433 # ifdef PERL_GLOBAL_STRUCT
5436 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5437 if (!plvarsp->Gppaddr)
5441 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5442 if (!plvarsp->Gcheck)
5444 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5445 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5447 # ifdef PERL_SET_VARS
5448 PERL_SET_VARS(plvarsp);
5450 # undef PERL_GLOBAL_STRUCT_INIT
5455 #endif /* PERL_GLOBAL_STRUCT */
5457 #ifdef PERL_GLOBAL_STRUCT
5460 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5462 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5463 # ifdef PERL_GLOBAL_STRUCT
5464 # ifdef PERL_UNSET_VARS
5465 PERL_UNSET_VARS(plvarsp);
5467 free(plvarsp->Gppaddr);
5468 free(plvarsp->Gcheck);
5469 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5475 #endif /* PERL_GLOBAL_STRUCT */
5479 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5480 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5481 * given, and you supply your own implementation.
5483 * The default implementation reads a single env var, PERL_MEM_LOG,
5484 * expecting one or more of the following:
5486 * \d+ - fd fd to write to : must be 1st (atoi)
5487 * 'm' - memlog was PERL_MEM_LOG=1
5488 * 's' - svlog was PERL_SV_LOG=1
5489 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5491 * This makes the logger controllable enough that it can reasonably be
5492 * added to the system perl.
5495 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5496 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5498 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5500 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5501 * writes to. In the default logger, this is settable at runtime.
5503 #ifndef PERL_MEM_LOG_FD
5504 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5507 #ifndef PERL_MEM_LOG_NOIMPL
5509 # ifdef DEBUG_LEAKING_SCALARS
5510 # define SV_LOG_SERIAL_FMT " [%lu]"
5511 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5513 # define SV_LOG_SERIAL_FMT
5514 # define _SV_LOG_SERIAL_ARG(sv)
5518 S_mem_log_common(enum mem_log_type mlt, const UV n,
5519 const UV typesize, const char *type_name, const SV *sv,
5520 Malloc_t oldalloc, Malloc_t newalloc,
5521 const char *filename, const int linenumber,
5522 const char *funcname)
5526 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5528 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5531 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
5533 /* We can't use SVs or PerlIO for obvious reasons,
5534 * so we'll use stdio and low-level IO instead. */
5535 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5537 # ifdef HAS_GETTIMEOFDAY
5538 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5539 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5541 gettimeofday(&tv, 0);
5543 # define MEM_LOG_TIME_FMT "%10d: "
5544 # define MEM_LOG_TIME_ARG (int)when
5548 /* If there are other OS specific ways of hires time than
5549 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5550 * probably that they would be used to fill in the struct
5554 int fd = atoi(pmlenv);
5556 fd = PERL_MEM_LOG_FD;
5558 if (strchr(pmlenv, 't')) {
5559 len = my_snprintf(buf, sizeof(buf),
5560 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5561 PerlLIO_write(fd, buf, len);
5565 len = my_snprintf(buf, sizeof(buf),
5566 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5567 " %s = %"IVdf": %"UVxf"\n",
5568 filename, linenumber, funcname, n, typesize,
5569 type_name, n * typesize, PTR2UV(newalloc));
5572 len = my_snprintf(buf, sizeof(buf),
5573 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5574 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5575 filename, linenumber, funcname, n, typesize,
5576 type_name, n * typesize, PTR2UV(oldalloc),
5580 len = my_snprintf(buf, sizeof(buf),
5581 "free: %s:%d:%s: %"UVxf"\n",
5582 filename, linenumber, funcname,
5587 len = my_snprintf(buf, sizeof(buf),
5588 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5589 mlt == MLT_NEW_SV ? "new" : "del",
5590 filename, linenumber, funcname,
5591 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5596 PerlLIO_write(fd, buf, len);
5600 #endif /* !PERL_MEM_LOG_NOIMPL */
5602 #ifndef PERL_MEM_LOG_NOIMPL
5604 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5605 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5607 /* this is suboptimal, but bug compatible. User is providing their
5608 own implemenation, but is getting these functions anyway, and they
5609 do nothing. But _NOIMPL users should be able to cope or fix */
5611 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5612 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5616 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5618 const char *filename, const int linenumber,
5619 const char *funcname)
5621 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5622 NULL, NULL, newalloc,
5623 filename, linenumber, funcname);
5628 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5629 Malloc_t oldalloc, Malloc_t newalloc,
5630 const char *filename, const int linenumber,
5631 const char *funcname)
5633 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5634 NULL, oldalloc, newalloc,
5635 filename, linenumber, funcname);
5640 Perl_mem_log_free(Malloc_t oldalloc,
5641 const char *filename, const int linenumber,
5642 const char *funcname)
5644 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5645 filename, linenumber, funcname);
5650 Perl_mem_log_new_sv(const SV *sv,
5651 const char *filename, const int linenumber,
5652 const char *funcname)
5654 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5655 filename, linenumber, funcname);
5659 Perl_mem_log_del_sv(const SV *sv,
5660 const char *filename, const int linenumber,
5661 const char *funcname)
5663 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5664 filename, linenumber, funcname);
5667 #endif /* PERL_MEM_LOG */
5670 =for apidoc my_sprintf
5672 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5673 the length of the string written to the buffer. Only rare pre-ANSI systems
5674 need the wrapper function - usually this is a direct call to C<sprintf>.
5678 #ifndef SPRINTF_RETURNS_STRLEN
5680 Perl_my_sprintf(char *buffer, const char* pat, ...)
5683 PERL_ARGS_ASSERT_MY_SPRINTF;
5684 va_start(args, pat);
5685 vsprintf(buffer, pat, args);
5687 return strlen(buffer);
5692 =for apidoc my_snprintf
5694 The C library C<snprintf> functionality, if available and
5695 standards-compliant (uses C<vsnprintf>, actually). However, if the
5696 C<vsnprintf> is not available, will unfortunately use the unsafe
5697 C<vsprintf> which can overrun the buffer (there is an overrun check,
5698 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5699 getting C<vsnprintf>.
5704 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5709 PERL_ARGS_ASSERT_MY_SNPRINTF;
5710 va_start(ap, format);
5711 #ifdef HAS_VSNPRINTF
5712 retval = vsnprintf(buffer, len, format, ap);
5714 retval = vsprintf(buffer, format, ap);
5717 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5718 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5719 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5724 =for apidoc my_vsnprintf
5726 The C library C<vsnprintf> if available and standards-compliant.
5727 However, if if the C<vsnprintf> is not available, will unfortunately
5728 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5729 overrun check, but that may be too late). Consider using
5730 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5735 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5742 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5744 Perl_va_copy(ap, apc);
5745 # ifdef HAS_VSNPRINTF
5746 retval = vsnprintf(buffer, len, format, apc);
5748 retval = vsprintf(buffer, format, apc);
5751 # ifdef HAS_VSNPRINTF
5752 retval = vsnprintf(buffer, len, format, ap);
5754 retval = vsprintf(buffer, format, ap);
5756 #endif /* #ifdef NEED_VA_COPY */
5757 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5758 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5759 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5764 Perl_my_clearenv(pTHX)
5767 #if ! defined(PERL_MICRO)
5768 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5770 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5771 # if defined(USE_ENVIRON_ARRAY)
5772 # if defined(USE_ITHREADS)
5773 /* only the parent thread can clobber the process environment */
5774 if (PL_curinterp == aTHX)
5775 # endif /* USE_ITHREADS */
5777 # if ! defined(PERL_USE_SAFE_PUTENV)
5778 if ( !PL_use_safe_putenv) {
5780 if (environ == PL_origenviron)
5781 environ = (char**)safesysmalloc(sizeof(char*));
5783 for (i = 0; environ[i]; i++)
5784 (void)safesysfree(environ[i]);
5787 # else /* PERL_USE_SAFE_PUTENV */
5788 # if defined(HAS_CLEARENV)
5790 # elif defined(HAS_UNSETENV)
5791 int bsiz = 80; /* Most envvar names will be shorter than this. */
5792 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5793 char *buf = (char*)safesysmalloc(bufsiz);
5794 while (*environ != NULL) {
5795 char *e = strchr(*environ, '=');
5796 int l = e ? e - *environ : (int)strlen(*environ);
5798 (void)safesysfree(buf);
5799 bsiz = l + 1; /* + 1 for the \0. */
5800 buf = (char*)safesysmalloc(bufsiz);
5802 memcpy(buf, *environ, l);
5804 (void)unsetenv(buf);
5806 (void)safesysfree(buf);
5807 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5808 /* Just null environ and accept the leakage. */
5810 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5811 # endif /* ! PERL_USE_SAFE_PUTENV */
5813 # endif /* USE_ENVIRON_ARRAY */
5814 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5815 #endif /* PERL_MICRO */
5818 #ifdef PERL_IMPLICIT_CONTEXT
5820 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5821 the global PL_my_cxt_index is incremented, and that value is assigned to
5822 that module's static my_cxt_index (who's address is passed as an arg).
5823 Then, for each interpreter this function is called for, it makes sure a
5824 void* slot is available to hang the static data off, by allocating or
5825 extending the interpreter's PL_my_cxt_list array */
5827 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5829 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5833 PERL_ARGS_ASSERT_MY_CXT_INIT;
5835 /* this module hasn't been allocated an index yet */
5836 MUTEX_LOCK(&PL_my_ctx_mutex);
5837 *index = PL_my_cxt_index++;
5838 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5841 /* make sure the array is big enough */
5842 if (PL_my_cxt_size <= *index) {
5843 if (PL_my_cxt_size) {
5844 while (PL_my_cxt_size <= *index)
5845 PL_my_cxt_size *= 2;
5846 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5849 PL_my_cxt_size = 16;
5850 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5853 /* newSV() allocates one more than needed */
5854 p = (void*)SvPVX(newSV(size-1));
5855 PL_my_cxt_list[*index] = p;
5856 Zero(p, size, char);
5860 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5863 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5868 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5870 for (index = 0; index < PL_my_cxt_index; index++) {
5871 const char *key = PL_my_cxt_keys[index];
5872 /* try direct pointer compare first - there are chances to success,
5873 * and it's much faster.
5875 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5882 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5888 PERL_ARGS_ASSERT_MY_CXT_INIT;
5890 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5892 /* this module hasn't been allocated an index yet */
5893 MUTEX_LOCK(&PL_my_ctx_mutex);
5894 index = PL_my_cxt_index++;
5895 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5898 /* make sure the array is big enough */
5899 if (PL_my_cxt_size <= index) {
5900 int old_size = PL_my_cxt_size;
5902 if (PL_my_cxt_size) {
5903 while (PL_my_cxt_size <= index)
5904 PL_my_cxt_size *= 2;
5905 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5906 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5909 PL_my_cxt_size = 16;
5910 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5911 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5913 for (i = old_size; i < PL_my_cxt_size; i++) {
5914 PL_my_cxt_keys[i] = 0;
5915 PL_my_cxt_list[i] = 0;
5918 PL_my_cxt_keys[index] = my_cxt_key;
5919 /* newSV() allocates one more than needed */
5920 p = (void*)SvPVX(newSV(size-1));
5921 PL_my_cxt_list[index] = p;
5922 Zero(p, size, char);
5925 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5926 #endif /* PERL_IMPLICIT_CONTEXT */
5930 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5932 Size_t used, length, copy;
5935 length = strlen(src);
5936 if (size > 0 && used < size - 1) {
5937 copy = (length >= size - used) ? size - used - 1 : length;
5938 memcpy(dst + used, src, copy);
5939 dst[used + copy] = '\0';
5941 return used + length;
5947 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5949 Size_t length, copy;
5951 length = strlen(src);
5953 copy = (length >= size) ? size - 1 : length;
5954 memcpy(dst, src, copy);
5961 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5962 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5963 long _ftol( double ); /* Defined by VC6 C libs. */
5964 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5968 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5971 SV * const dbsv = GvSVn(PL_DBsub);
5972 /* We do not care about using sv to call CV;
5973 * it's for informational purposes only.
5976 PERL_ARGS_ASSERT_GET_DB_SUB;
5979 if (!PERLDB_SUB_NN) {
5980 GV * const gv = CvGV(cv);
5982 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5983 || strEQ(GvNAME(gv), "END")
5984 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5985 !( (SvTYPE(*svp) == SVt_PVGV)
5986 && (GvCV((const GV *)*svp) == cv) )))) {
5987 /* Use GV from the stack as a fallback. */
5988 /* GV is potentially non-unique, or contain different CV. */
5989 SV * const tmp = newRV(MUTABLE_SV(cv));
5990 sv_setsv(dbsv, tmp);
5994 gv_efullname3(dbsv, gv, NULL);
5998 const int type = SvTYPE(dbsv);
5999 if (type < SVt_PVIV && type != SVt_IV)
6000 sv_upgrade(dbsv, SVt_PVIV);
6001 (void)SvIOK_on(dbsv);
6002 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6007 Perl_my_dirfd(pTHX_ DIR * dir) {
6009 /* Most dirfd implementations have problems when passed NULL. */
6014 #elif defined(HAS_DIR_DD_FD)
6017 Perl_die(aTHX_ PL_no_func, "dirfd");
6024 Perl_get_re_arg(pTHX_ SV *sv) {
6031 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6032 SvTYPE(tmpsv) == SVt_REGEXP)
6034 return (REGEXP*) tmpsv;
6043 * c-indentation-style: bsd
6045 * indent-tabs-mode: t
6048 * ex: set ts=8 sts=4 sw=4 noet: