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_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1534 PERL_ARGS_ASSERT_CK_WARNER_D;
1536 if (Perl_ckwarn_d(aTHX_ err)) {
1538 va_start(args, pat);
1539 vwarner(err, pat, &args);
1545 Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1547 PERL_ARGS_ASSERT_CK_WARNER;
1549 if (Perl_ckwarn(aTHX_ err)) {
1551 va_start(args, pat);
1552 vwarner(err, pat, &args);
1558 Perl_warner(pTHX_ U32 err, const char* pat,...)
1561 PERL_ARGS_ASSERT_WARNER;
1562 va_start(args, pat);
1563 vwarner(err, pat, &args);
1568 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1571 PERL_ARGS_ASSERT_VWARNER;
1572 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1573 SV * const msv = vmess(pat, args);
1575 const char * const message = SvPV_const(msv, msglen);
1576 const I32 utf8 = SvUTF8(msv);
1580 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1583 PL_restartop = die_where(message, msglen);
1584 SvFLAGS(ERRSV) |= utf8;
1587 write_to_stderr(message, msglen);
1591 Perl_vwarn(aTHX_ pat, args);
1595 /* implements the ckWARN? macros */
1598 Perl_ckwarn(pTHX_ U32 w)
1601 /* If lexical warnings have not been set, use $^W. */
1603 return PL_dowarn & G_WARN_ON;
1605 return ckwarn_common(w);
1608 /* implements the ckWARN?_d macro */
1611 Perl_ckwarn_d(pTHX_ U32 w)
1614 /* If lexical warnings have not been set then default classes warn. */
1618 return ckwarn_common(w);
1622 S_ckwarn_common(pTHX_ U32 w)
1624 if (PL_curcop->cop_warnings == pWARN_ALL)
1627 if (PL_curcop->cop_warnings == pWARN_NONE)
1630 /* Check the assumption that at least the first slot is non-zero. */
1631 assert(unpackWARN1(w));
1633 /* Check the assumption that it is valid to stop as soon as a zero slot is
1635 if (!unpackWARN2(w)) {
1636 assert(!unpackWARN3(w));
1637 assert(!unpackWARN4(w));
1638 } else if (!unpackWARN3(w)) {
1639 assert(!unpackWARN4(w));
1642 /* Right, dealt with all the special cases, which are implemented as non-
1643 pointers, so there is a pointer to a real warnings mask. */
1645 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1647 } while (w >>= WARNshift);
1652 /* Set buffer=NULL to get a new one. */
1654 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1656 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1657 PERL_UNUSED_CONTEXT;
1658 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1661 (specialWARN(buffer) ?
1662 PerlMemShared_malloc(len_wanted) :
1663 PerlMemShared_realloc(buffer, len_wanted));
1665 Copy(bits, (buffer + 1), size, char);
1669 /* since we've already done strlen() for both nam and val
1670 * we can use that info to make things faster than
1671 * sprintf(s, "%s=%s", nam, val)
1673 #define my_setenv_format(s, nam, nlen, val, vlen) \
1674 Copy(nam, s, nlen, char); \
1676 Copy(val, s+(nlen+1), vlen, char); \
1677 *(s+(nlen+1+vlen)) = '\0'
1679 #ifdef USE_ENVIRON_ARRAY
1680 /* VMS' my_setenv() is in vms.c */
1681 #if !defined(WIN32) && !defined(NETWARE)
1683 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1687 /* only parent thread can modify process environment */
1688 if (PL_curinterp == aTHX)
1691 #ifndef PERL_USE_SAFE_PUTENV
1692 if (!PL_use_safe_putenv) {
1693 /* most putenv()s leak, so we manipulate environ directly */
1695 register const I32 len = strlen(nam);
1698 /* where does it go? */
1699 for (i = 0; environ[i]; i++) {
1700 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1704 if (environ == PL_origenviron) { /* need we copy environment? */
1710 while (environ[max])
1712 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1713 for (j=0; j<max; j++) { /* copy environment */
1714 const int len = strlen(environ[j]);
1715 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1716 Copy(environ[j], tmpenv[j], len+1, char);
1719 environ = tmpenv; /* tell exec where it is now */
1722 safesysfree(environ[i]);
1723 while (environ[i]) {
1724 environ[i] = environ[i+1];
1729 if (!environ[i]) { /* does not exist yet */
1730 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1731 environ[i+1] = NULL; /* make sure it's null terminated */
1734 safesysfree(environ[i]);
1738 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1739 /* all that work just for this */
1740 my_setenv_format(environ[i], nam, nlen, val, vlen);
1743 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1744 # if defined(HAS_UNSETENV)
1746 (void)unsetenv(nam);
1748 (void)setenv(nam, val, 1);
1750 # else /* ! HAS_UNSETENV */
1751 (void)setenv(nam, val, 1);
1752 # endif /* HAS_UNSETENV */
1754 # if defined(HAS_UNSETENV)
1756 (void)unsetenv(nam);
1758 const int nlen = strlen(nam);
1759 const int vlen = strlen(val);
1760 char * const new_env =
1761 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1762 my_setenv_format(new_env, nam, nlen, val, vlen);
1763 (void)putenv(new_env);
1765 # else /* ! HAS_UNSETENV */
1767 const int nlen = strlen(nam);
1773 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1774 /* all that work just for this */
1775 my_setenv_format(new_env, nam, nlen, val, vlen);
1776 (void)putenv(new_env);
1777 # endif /* HAS_UNSETENV */
1778 # endif /* __CYGWIN__ */
1779 #ifndef PERL_USE_SAFE_PUTENV
1785 #else /* WIN32 || NETWARE */
1788 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1791 register char *envstr;
1792 const int nlen = strlen(nam);
1799 Newx(envstr, nlen+vlen+2, char);
1800 my_setenv_format(envstr, nam, nlen, val, vlen);
1801 (void)PerlEnv_putenv(envstr);
1805 #endif /* WIN32 || NETWARE */
1807 #endif /* !VMS && !EPOC*/
1809 #ifdef UNLINK_ALL_VERSIONS
1811 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1815 PERL_ARGS_ASSERT_UNLNK;
1817 while (PerlLIO_unlink(f) >= 0)
1819 return retries ? 0 : -1;
1823 /* this is a drop-in replacement for bcopy() */
1824 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1826 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1828 char * const retval = to;
1830 PERL_ARGS_ASSERT_MY_BCOPY;
1832 if (from - to >= 0) {
1840 *(--to) = *(--from);
1846 /* this is a drop-in replacement for memset() */
1849 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1851 char * const retval = loc;
1853 PERL_ARGS_ASSERT_MY_MEMSET;
1861 /* this is a drop-in replacement for bzero() */
1862 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1864 Perl_my_bzero(register char *loc, register I32 len)
1866 char * const retval = loc;
1868 PERL_ARGS_ASSERT_MY_BZERO;
1876 /* this is a drop-in replacement for memcmp() */
1877 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1879 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1881 register const U8 *a = (const U8 *)s1;
1882 register const U8 *b = (const U8 *)s2;
1885 PERL_ARGS_ASSERT_MY_MEMCMP;
1888 if ((tmp = *a++ - *b++))
1893 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1896 /* This vsprintf replacement should generally never get used, since
1897 vsprintf was available in both System V and BSD 2.11. (There may
1898 be some cross-compilation or embedded set-ups where it is needed,
1901 If you encounter a problem in this function, it's probably a symptom
1902 that Configure failed to detect your system's vprintf() function.
1903 See the section on "item vsprintf" in the INSTALL file.
1905 This version may compile on systems with BSD-ish <stdio.h>,
1906 but probably won't on others.
1909 #ifdef USE_CHAR_VSPRINTF
1914 vsprintf(char *dest, const char *pat, void *args)
1918 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1919 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1920 FILE_cnt(&fakebuf) = 32767;
1922 /* These probably won't compile -- If you really need
1923 this, you'll have to figure out some other method. */
1924 fakebuf._ptr = dest;
1925 fakebuf._cnt = 32767;
1930 fakebuf._flag = _IOWRT|_IOSTRG;
1931 _doprnt(pat, args, &fakebuf); /* what a kludge */
1932 #if defined(STDIO_PTR_LVALUE)
1933 *(FILE_ptr(&fakebuf)++) = '\0';
1935 /* PerlIO has probably #defined away fputc, but we want it here. */
1937 # undef fputc /* XXX Should really restore it later */
1939 (void)fputc('\0', &fakebuf);
1941 #ifdef USE_CHAR_VSPRINTF
1944 return 0; /* perl doesn't use return value */
1948 #endif /* HAS_VPRINTF */
1951 #if BYTEORDER != 0x4321
1953 Perl_my_swap(pTHX_ short s)
1955 #if (BYTEORDER & 1) == 0
1958 result = ((s & 255) << 8) + ((s >> 8) & 255);
1966 Perl_my_htonl(pTHX_ long l)
1970 char c[sizeof(long)];
1973 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1974 #if BYTEORDER == 0x12345678
1977 u.c[0] = (l >> 24) & 255;
1978 u.c[1] = (l >> 16) & 255;
1979 u.c[2] = (l >> 8) & 255;
1983 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1984 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1989 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1990 u.c[o & 0xf] = (l >> s) & 255;
1998 Perl_my_ntohl(pTHX_ long l)
2002 char c[sizeof(long)];
2005 #if BYTEORDER == 0x1234
2006 u.c[0] = (l >> 24) & 255;
2007 u.c[1] = (l >> 16) & 255;
2008 u.c[2] = (l >> 8) & 255;
2012 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2013 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2020 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2021 l |= (u.c[o & 0xf] & 255) << s;
2028 #endif /* BYTEORDER != 0x4321 */
2032 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2033 * If these functions are defined,
2034 * the BYTEORDER is neither 0x1234 nor 0x4321.
2035 * However, this is not assumed.
2039 #define HTOLE(name,type) \
2041 name (register type n) \
2045 char c[sizeof(type)]; \
2048 register U32 s = 0; \
2049 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2050 u.c[i] = (n >> s) & 0xFF; \
2055 #define LETOH(name,type) \
2057 name (register type n) \
2061 char c[sizeof(type)]; \
2064 register U32 s = 0; \
2067 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2068 n |= ((type)(u.c[i] & 0xFF)) << s; \
2074 * Big-endian byte order functions.
2077 #define HTOBE(name,type) \
2079 name (register type n) \
2083 char c[sizeof(type)]; \
2086 register U32 s = 8*(sizeof(u.c)-1); \
2087 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2088 u.c[i] = (n >> s) & 0xFF; \
2093 #define BETOH(name,type) \
2095 name (register type n) \
2099 char c[sizeof(type)]; \
2102 register U32 s = 8*(sizeof(u.c)-1); \
2105 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2106 n |= ((type)(u.c[i] & 0xFF)) << s; \
2112 * If we just can't do it...
2115 #define NOT_AVAIL(name,type) \
2117 name (register type n) \
2119 Perl_croak_nocontext(#name "() not available"); \
2120 return n; /* not reached */ \
2124 #if defined(HAS_HTOVS) && !defined(htovs)
2127 #if defined(HAS_HTOVL) && !defined(htovl)
2130 #if defined(HAS_VTOHS) && !defined(vtohs)
2133 #if defined(HAS_VTOHL) && !defined(vtohl)
2137 #ifdef PERL_NEED_MY_HTOLE16
2139 HTOLE(Perl_my_htole16,U16)
2141 NOT_AVAIL(Perl_my_htole16,U16)
2144 #ifdef PERL_NEED_MY_LETOH16
2146 LETOH(Perl_my_letoh16,U16)
2148 NOT_AVAIL(Perl_my_letoh16,U16)
2151 #ifdef PERL_NEED_MY_HTOBE16
2153 HTOBE(Perl_my_htobe16,U16)
2155 NOT_AVAIL(Perl_my_htobe16,U16)
2158 #ifdef PERL_NEED_MY_BETOH16
2160 BETOH(Perl_my_betoh16,U16)
2162 NOT_AVAIL(Perl_my_betoh16,U16)
2166 #ifdef PERL_NEED_MY_HTOLE32
2168 HTOLE(Perl_my_htole32,U32)
2170 NOT_AVAIL(Perl_my_htole32,U32)
2173 #ifdef PERL_NEED_MY_LETOH32
2175 LETOH(Perl_my_letoh32,U32)
2177 NOT_AVAIL(Perl_my_letoh32,U32)
2180 #ifdef PERL_NEED_MY_HTOBE32
2182 HTOBE(Perl_my_htobe32,U32)
2184 NOT_AVAIL(Perl_my_htobe32,U32)
2187 #ifdef PERL_NEED_MY_BETOH32
2189 BETOH(Perl_my_betoh32,U32)
2191 NOT_AVAIL(Perl_my_betoh32,U32)
2195 #ifdef PERL_NEED_MY_HTOLE64
2197 HTOLE(Perl_my_htole64,U64)
2199 NOT_AVAIL(Perl_my_htole64,U64)
2202 #ifdef PERL_NEED_MY_LETOH64
2204 LETOH(Perl_my_letoh64,U64)
2206 NOT_AVAIL(Perl_my_letoh64,U64)
2209 #ifdef PERL_NEED_MY_HTOBE64
2211 HTOBE(Perl_my_htobe64,U64)
2213 NOT_AVAIL(Perl_my_htobe64,U64)
2216 #ifdef PERL_NEED_MY_BETOH64
2218 BETOH(Perl_my_betoh64,U64)
2220 NOT_AVAIL(Perl_my_betoh64,U64)
2224 #ifdef PERL_NEED_MY_HTOLES
2225 HTOLE(Perl_my_htoles,short)
2227 #ifdef PERL_NEED_MY_LETOHS
2228 LETOH(Perl_my_letohs,short)
2230 #ifdef PERL_NEED_MY_HTOBES
2231 HTOBE(Perl_my_htobes,short)
2233 #ifdef PERL_NEED_MY_BETOHS
2234 BETOH(Perl_my_betohs,short)
2237 #ifdef PERL_NEED_MY_HTOLEI
2238 HTOLE(Perl_my_htolei,int)
2240 #ifdef PERL_NEED_MY_LETOHI
2241 LETOH(Perl_my_letohi,int)
2243 #ifdef PERL_NEED_MY_HTOBEI
2244 HTOBE(Perl_my_htobei,int)
2246 #ifdef PERL_NEED_MY_BETOHI
2247 BETOH(Perl_my_betohi,int)
2250 #ifdef PERL_NEED_MY_HTOLEL
2251 HTOLE(Perl_my_htolel,long)
2253 #ifdef PERL_NEED_MY_LETOHL
2254 LETOH(Perl_my_letohl,long)
2256 #ifdef PERL_NEED_MY_HTOBEL
2257 HTOBE(Perl_my_htobel,long)
2259 #ifdef PERL_NEED_MY_BETOHL
2260 BETOH(Perl_my_betohl,long)
2264 Perl_my_swabn(void *ptr, int n)
2266 register char *s = (char *)ptr;
2267 register char *e = s + (n-1);
2270 PERL_ARGS_ASSERT_MY_SWABN;
2272 for (n /= 2; n > 0; s++, e--, n--) {
2280 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2282 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2285 register I32 This, that;
2291 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2293 PERL_FLUSHALL_FOR_CHILD;
2294 This = (*mode == 'w');
2298 taint_proper("Insecure %s%s", "EXEC");
2300 if (PerlProc_pipe(p) < 0)
2302 /* Try for another pipe pair for error return */
2303 if (PerlProc_pipe(pp) >= 0)
2305 while ((pid = PerlProc_fork()) < 0) {
2306 if (errno != EAGAIN) {
2307 PerlLIO_close(p[This]);
2308 PerlLIO_close(p[that]);
2310 PerlLIO_close(pp[0]);
2311 PerlLIO_close(pp[1]);
2315 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2324 /* Close parent's end of error status pipe (if any) */
2326 PerlLIO_close(pp[0]);
2327 #if defined(HAS_FCNTL) && defined(F_SETFD)
2328 /* Close error pipe automatically if exec works */
2329 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2332 /* Now dup our end of _the_ pipe to right position */
2333 if (p[THIS] != (*mode == 'r')) {
2334 PerlLIO_dup2(p[THIS], *mode == 'r');
2335 PerlLIO_close(p[THIS]);
2336 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2337 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2340 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2341 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2342 /* No automatic close - do it by hand */
2349 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2355 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2361 do_execfree(); /* free any memory malloced by child on fork */
2363 PerlLIO_close(pp[1]);
2364 /* Keep the lower of the two fd numbers */
2365 if (p[that] < p[This]) {
2366 PerlLIO_dup2(p[This], p[that]);
2367 PerlLIO_close(p[This]);
2371 PerlLIO_close(p[that]); /* close child's end of pipe */
2373 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2374 SvUPGRADE(sv,SVt_IV);
2376 PL_forkprocess = pid;
2377 /* If we managed to get status pipe check for exec fail */
2378 if (did_pipes && pid > 0) {
2383 while (n < sizeof(int)) {
2384 n1 = PerlLIO_read(pp[0],
2385 (void*)(((char*)&errkid)+n),
2391 PerlLIO_close(pp[0]);
2393 if (n) { /* Error */
2395 PerlLIO_close(p[This]);
2396 if (n != sizeof(int))
2397 Perl_croak(aTHX_ "panic: kid popen errno read");
2399 pid2 = wait4pid(pid, &status, 0);
2400 } while (pid2 == -1 && errno == EINTR);
2401 errno = errkid; /* Propagate errno from kid */
2406 PerlLIO_close(pp[0]);
2407 return PerlIO_fdopen(p[This], mode);
2409 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2410 return my_syspopen4(aTHX_ NULL, mode, n, args);
2412 Perl_croak(aTHX_ "List form of piped open not implemented");
2413 return (PerlIO *) NULL;
2418 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2419 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2421 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2425 register I32 This, that;
2428 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2432 PERL_ARGS_ASSERT_MY_POPEN;
2434 PERL_FLUSHALL_FOR_CHILD;
2437 return my_syspopen(aTHX_ cmd,mode);
2440 This = (*mode == 'w');
2442 if (doexec && PL_tainting) {
2444 taint_proper("Insecure %s%s", "EXEC");
2446 if (PerlProc_pipe(p) < 0)
2448 if (doexec && PerlProc_pipe(pp) >= 0)
2450 while ((pid = PerlProc_fork()) < 0) {
2451 if (errno != EAGAIN) {
2452 PerlLIO_close(p[This]);
2453 PerlLIO_close(p[that]);
2455 PerlLIO_close(pp[0]);
2456 PerlLIO_close(pp[1]);
2459 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2462 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2473 PerlLIO_close(pp[0]);
2474 #if defined(HAS_FCNTL) && defined(F_SETFD)
2475 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2478 if (p[THIS] != (*mode == 'r')) {
2479 PerlLIO_dup2(p[THIS], *mode == 'r');
2480 PerlLIO_close(p[THIS]);
2481 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2482 PerlLIO_close(p[THAT]);
2485 PerlLIO_close(p[THAT]);
2488 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2495 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2500 /* may or may not use the shell */
2501 do_exec3(cmd, pp[1], did_pipes);
2504 #endif /* defined OS2 */
2506 #ifdef PERLIO_USING_CRLF
2507 /* Since we circumvent IO layers when we manipulate low-level
2508 filedescriptors directly, need to manually switch to the
2509 default, binary, low-level mode; see PerlIOBuf_open(). */
2510 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2513 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2514 SvREADONLY_off(GvSV(tmpgv));
2515 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2516 SvREADONLY_on(GvSV(tmpgv));
2518 #ifdef THREADS_HAVE_PIDS
2519 PL_ppid = (IV)getppid();
2522 #ifdef PERL_USES_PL_PIDSTATUS
2523 hv_clear(PL_pidstatus); /* we have no children */
2529 do_execfree(); /* free any memory malloced by child on vfork */
2531 PerlLIO_close(pp[1]);
2532 if (p[that] < p[This]) {
2533 PerlLIO_dup2(p[This], p[that]);
2534 PerlLIO_close(p[This]);
2538 PerlLIO_close(p[that]);
2540 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2541 SvUPGRADE(sv,SVt_IV);
2543 PL_forkprocess = pid;
2544 if (did_pipes && pid > 0) {
2549 while (n < sizeof(int)) {
2550 n1 = PerlLIO_read(pp[0],
2551 (void*)(((char*)&errkid)+n),
2557 PerlLIO_close(pp[0]);
2559 if (n) { /* Error */
2561 PerlLIO_close(p[This]);
2562 if (n != sizeof(int))
2563 Perl_croak(aTHX_ "panic: kid popen errno read");
2565 pid2 = wait4pid(pid, &status, 0);
2566 } while (pid2 == -1 && errno == EINTR);
2567 errno = errkid; /* Propagate errno from kid */
2572 PerlLIO_close(pp[0]);
2573 return PerlIO_fdopen(p[This], mode);
2576 #if defined(atarist) || defined(EPOC)
2579 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2581 PERL_ARGS_ASSERT_MY_POPEN;
2582 PERL_FLUSHALL_FOR_CHILD;
2583 /* Call system's popen() to get a FILE *, then import it.
2584 used 0 for 2nd parameter to PerlIO_importFILE;
2587 return PerlIO_importFILE(popen(cmd, mode), 0);
2591 FILE *djgpp_popen();
2593 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2595 PERL_FLUSHALL_FOR_CHILD;
2596 /* Call system's popen() to get a FILE *, then import it.
2597 used 0 for 2nd parameter to PerlIO_importFILE;
2600 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2603 #if defined(__LIBCATAMOUNT__)
2605 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2613 #endif /* !DOSISH */
2615 /* this is called in parent before the fork() */
2617 Perl_atfork_lock(void)
2620 #if defined(USE_ITHREADS)
2621 /* locks must be held in locking order (if any) */
2623 MUTEX_LOCK(&PL_malloc_mutex);
2629 /* this is called in both parent and child after the fork() */
2631 Perl_atfork_unlock(void)
2634 #if defined(USE_ITHREADS)
2635 /* locks must be released in same order as in atfork_lock() */
2637 MUTEX_UNLOCK(&PL_malloc_mutex);
2646 #if defined(HAS_FORK)
2648 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2653 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2654 * handlers elsewhere in the code */
2659 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2660 Perl_croak_nocontext("fork() not available");
2662 #endif /* HAS_FORK */
2667 Perl_dump_fds(pTHX_ const char *const s)
2672 PERL_ARGS_ASSERT_DUMP_FDS;
2674 PerlIO_printf(Perl_debug_log,"%s", s);
2675 for (fd = 0; fd < 32; fd++) {
2676 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2677 PerlIO_printf(Perl_debug_log," %d",fd);
2679 PerlIO_printf(Perl_debug_log,"\n");
2682 #endif /* DUMP_FDS */
2686 dup2(int oldfd, int newfd)
2688 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2691 PerlLIO_close(newfd);
2692 return fcntl(oldfd, F_DUPFD, newfd);
2694 #define DUP2_MAX_FDS 256
2695 int fdtmp[DUP2_MAX_FDS];
2701 PerlLIO_close(newfd);
2702 /* good enough for low fd's... */
2703 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2704 if (fdx >= DUP2_MAX_FDS) {
2712 PerlLIO_close(fdtmp[--fdx]);
2719 #ifdef HAS_SIGACTION
2722 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2725 struct sigaction act, oact;
2728 /* only "parent" interpreter can diddle signals */
2729 if (PL_curinterp != aTHX)
2730 return (Sighandler_t) SIG_ERR;
2733 act.sa_handler = (void(*)(int))handler;
2734 sigemptyset(&act.sa_mask);
2737 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2738 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2740 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2741 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2742 act.sa_flags |= SA_NOCLDWAIT;
2744 if (sigaction(signo, &act, &oact) == -1)
2745 return (Sighandler_t) SIG_ERR;
2747 return (Sighandler_t) oact.sa_handler;
2751 Perl_rsignal_state(pTHX_ int signo)
2753 struct sigaction oact;
2754 PERL_UNUSED_CONTEXT;
2756 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2757 return (Sighandler_t) SIG_ERR;
2759 return (Sighandler_t) oact.sa_handler;
2763 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2766 struct sigaction act;
2768 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2771 /* only "parent" interpreter can diddle signals */
2772 if (PL_curinterp != aTHX)
2776 act.sa_handler = (void(*)(int))handler;
2777 sigemptyset(&act.sa_mask);
2780 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2781 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2783 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2784 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2785 act.sa_flags |= SA_NOCLDWAIT;
2787 return sigaction(signo, &act, save);
2791 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2795 /* only "parent" interpreter can diddle signals */
2796 if (PL_curinterp != aTHX)
2800 return sigaction(signo, save, (struct sigaction *)NULL);
2803 #else /* !HAS_SIGACTION */
2806 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2808 #if defined(USE_ITHREADS) && !defined(WIN32)
2809 /* only "parent" interpreter can diddle signals */
2810 if (PL_curinterp != aTHX)
2811 return (Sighandler_t) SIG_ERR;
2814 return PerlProc_signal(signo, handler);
2825 Perl_rsignal_state(pTHX_ int signo)
2828 Sighandler_t oldsig;
2830 #if defined(USE_ITHREADS) && !defined(WIN32)
2831 /* only "parent" interpreter can diddle signals */
2832 if (PL_curinterp != aTHX)
2833 return (Sighandler_t) SIG_ERR;
2837 oldsig = PerlProc_signal(signo, sig_trap);
2838 PerlProc_signal(signo, oldsig);
2840 PerlProc_kill(PerlProc_getpid(), signo);
2845 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2847 #if defined(USE_ITHREADS) && !defined(WIN32)
2848 /* only "parent" interpreter can diddle signals */
2849 if (PL_curinterp != aTHX)
2852 *save = PerlProc_signal(signo, handler);
2853 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2857 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2859 #if defined(USE_ITHREADS) && !defined(WIN32)
2860 /* only "parent" interpreter can diddle signals */
2861 if (PL_curinterp != aTHX)
2864 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2867 #endif /* !HAS_SIGACTION */
2868 #endif /* !PERL_MICRO */
2870 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2871 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2873 Perl_my_pclose(pTHX_ PerlIO *ptr)
2876 Sigsave_t hstat, istat, qstat;
2884 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2885 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2887 *svp = &PL_sv_undef;
2889 if (pid == -1) { /* Opened by popen. */
2890 return my_syspclose(ptr);
2893 close_failed = (PerlIO_close(ptr) == EOF);
2896 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2899 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2900 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2901 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2904 pid2 = wait4pid(pid, &status, 0);
2905 } while (pid2 == -1 && errno == EINTR);
2907 rsignal_restore(SIGHUP, &hstat);
2908 rsignal_restore(SIGINT, &istat);
2909 rsignal_restore(SIGQUIT, &qstat);
2915 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2918 #if defined(__LIBCATAMOUNT__)
2920 Perl_my_pclose(pTHX_ PerlIO *ptr)
2925 #endif /* !DOSISH */
2927 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2929 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2933 PERL_ARGS_ASSERT_WAIT4PID;
2936 #ifdef PERL_USES_PL_PIDSTATUS
2939 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2940 pid, rather than a string form. */
2941 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2942 if (svp && *svp != &PL_sv_undef) {
2943 *statusp = SvIVX(*svp);
2944 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2952 hv_iterinit(PL_pidstatus);
2953 if ((entry = hv_iternext(PL_pidstatus))) {
2954 SV * const sv = hv_iterval(PL_pidstatus,entry);
2956 const char * const spid = hv_iterkey(entry,&len);
2958 assert (len == sizeof(Pid_t));
2959 memcpy((char *)&pid, spid, len);
2960 *statusp = SvIVX(sv);
2961 /* The hash iterator is currently on this entry, so simply
2962 calling hv_delete would trigger the lazy delete, which on
2963 aggregate does more work, beacuse next call to hv_iterinit()
2964 would spot the flag, and have to call the delete routine,
2965 while in the meantime any new entries can't re-use that
2967 hv_iterinit(PL_pidstatus);
2968 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2975 # ifdef HAS_WAITPID_RUNTIME
2976 if (!HAS_WAITPID_RUNTIME)
2979 result = PerlProc_waitpid(pid,statusp,flags);
2982 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2983 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2986 #ifdef PERL_USES_PL_PIDSTATUS
2987 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2992 Perl_croak(aTHX_ "Can't do waitpid with flags");
2994 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2995 pidgone(result,*statusp);
3001 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3004 if (result < 0 && errno == EINTR) {
3006 errno = EINTR; /* reset in case a signal handler changed $! */
3010 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3012 #ifdef PERL_USES_PL_PIDSTATUS
3014 S_pidgone(pTHX_ Pid_t pid, int status)
3018 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3019 SvUPGRADE(sv,SVt_IV);
3020 SvIV_set(sv, status);
3025 #if defined(atarist) || defined(OS2) || defined(EPOC)
3028 int /* Cannot prototype with I32
3030 my_syspclose(PerlIO *ptr)
3033 Perl_my_pclose(pTHX_ PerlIO *ptr)
3036 /* Needs work for PerlIO ! */
3037 FILE * const f = PerlIO_findFILE(ptr);
3038 const I32 result = pclose(f);
3039 PerlIO_releaseFILE(ptr,f);
3047 Perl_my_pclose(pTHX_ PerlIO *ptr)
3049 /* Needs work for PerlIO ! */
3050 FILE * const f = PerlIO_findFILE(ptr);
3051 I32 result = djgpp_pclose(f);
3052 result = (result << 8) & 0xff00;
3053 PerlIO_releaseFILE(ptr,f);
3058 #define PERL_REPEATCPY_LINEAR 4
3060 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3062 PERL_ARGS_ASSERT_REPEATCPY;
3065 memset(to, *from, count);
3067 register char *p = to;
3068 I32 items, linear, half;
3070 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3071 for (items = 0; items < linear; ++items) {
3072 register const char *q = from;
3074 for (todo = len; todo > 0; todo--)
3079 while (items <= half) {
3080 I32 size = items * len;
3081 memcpy(p, to, size);
3087 memcpy(p, to, (count - items) * len);
3093 Perl_same_dirent(pTHX_ const char *a, const char *b)
3095 char *fa = strrchr(a,'/');
3096 char *fb = strrchr(b,'/');
3099 SV * const tmpsv = sv_newmortal();
3101 PERL_ARGS_ASSERT_SAME_DIRENT;
3114 sv_setpvs(tmpsv, ".");
3116 sv_setpvn(tmpsv, a, fa - a);
3117 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3120 sv_setpvs(tmpsv, ".");
3122 sv_setpvn(tmpsv, b, fb - b);
3123 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3125 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3126 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3128 #endif /* !HAS_RENAME */
3131 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3132 const char *const *const search_ext, I32 flags)
3135 const char *xfound = NULL;
3136 char *xfailed = NULL;
3137 char tmpbuf[MAXPATHLEN];
3142 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3143 # define SEARCH_EXTS ".bat", ".cmd", NULL
3144 # define MAX_EXT_LEN 4
3147 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3148 # define MAX_EXT_LEN 4
3151 # define SEARCH_EXTS ".pl", ".com", NULL
3152 # define MAX_EXT_LEN 4
3154 /* additional extensions to try in each dir if scriptname not found */
3156 static const char *const exts[] = { SEARCH_EXTS };
3157 const char *const *const ext = search_ext ? search_ext : exts;
3158 int extidx = 0, i = 0;
3159 const char *curext = NULL;
3161 PERL_UNUSED_ARG(search_ext);
3162 # define MAX_EXT_LEN 0
3165 PERL_ARGS_ASSERT_FIND_SCRIPT;
3168 * If dosearch is true and if scriptname does not contain path
3169 * delimiters, search the PATH for scriptname.
3171 * If SEARCH_EXTS is also defined, will look for each
3172 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3173 * while searching the PATH.
3175 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3176 * proceeds as follows:
3177 * If DOSISH or VMSISH:
3178 * + look for ./scriptname{,.foo,.bar}
3179 * + search the PATH for scriptname{,.foo,.bar}
3182 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3183 * this will not look in '.' if it's not in the PATH)
3188 # ifdef ALWAYS_DEFTYPES
3189 len = strlen(scriptname);
3190 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3191 int idx = 0, deftypes = 1;
3194 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3197 int idx = 0, deftypes = 1;
3200 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3202 /* The first time through, just add SEARCH_EXTS to whatever we
3203 * already have, so we can check for default file types. */
3205 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3211 if ((strlen(tmpbuf) + strlen(scriptname)
3212 + MAX_EXT_LEN) >= sizeof tmpbuf)
3213 continue; /* don't search dir with too-long name */
3214 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3218 if (strEQ(scriptname, "-"))
3220 if (dosearch) { /* Look in '.' first. */
3221 const char *cur = scriptname;
3223 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3225 if (strEQ(ext[i++],curext)) {
3226 extidx = -1; /* already has an ext */
3231 DEBUG_p(PerlIO_printf(Perl_debug_log,
3232 "Looking for %s\n",cur));
3233 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3234 && !S_ISDIR(PL_statbuf.st_mode)) {
3242 if (cur == scriptname) {
3243 len = strlen(scriptname);
3244 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3246 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3249 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3250 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3255 if (dosearch && !strchr(scriptname, '/')
3257 && !strchr(scriptname, '\\')
3259 && (s = PerlEnv_getenv("PATH")))
3263 bufend = s + strlen(s);
3264 while (s < bufend) {
3265 #if defined(atarist) || defined(DOSISH)
3270 && *s != ';'; len++, s++) {
3271 if (len < sizeof tmpbuf)
3274 if (len < sizeof tmpbuf)
3276 #else /* ! (atarist || DOSISH) */
3277 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3280 #endif /* ! (atarist || DOSISH) */
3283 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3284 continue; /* don't search dir with too-long name */
3286 # if defined(atarist) || defined(DOSISH)
3287 && tmpbuf[len - 1] != '/'
3288 && tmpbuf[len - 1] != '\\'
3291 tmpbuf[len++] = '/';
3292 if (len == 2 && tmpbuf[0] == '.')
3294 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3298 len = strlen(tmpbuf);
3299 if (extidx > 0) /* reset after previous loop */
3303 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3304 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3305 if (S_ISDIR(PL_statbuf.st_mode)) {
3309 } while ( retval < 0 /* not there */
3310 && extidx>=0 && ext[extidx] /* try an extension? */
3311 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3316 if (S_ISREG(PL_statbuf.st_mode)
3317 && cando(S_IRUSR,TRUE,&PL_statbuf)
3318 #if !defined(DOSISH)
3319 && cando(S_IXUSR,TRUE,&PL_statbuf)
3323 xfound = tmpbuf; /* bingo! */
3327 xfailed = savepv(tmpbuf);
3330 if (!xfound && !seen_dot && !xfailed &&
3331 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3332 || S_ISDIR(PL_statbuf.st_mode)))
3334 seen_dot = 1; /* Disable message. */
3336 if (flags & 1) { /* do or die? */
3337 Perl_croak(aTHX_ "Can't %s %s%s%s",
3338 (xfailed ? "execute" : "find"),
3339 (xfailed ? xfailed : scriptname),
3340 (xfailed ? "" : " on PATH"),
3341 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3346 scriptname = xfound;
3348 return (scriptname ? savepv(scriptname) : NULL);
3351 #ifndef PERL_GET_CONTEXT_DEFINED
3354 Perl_get_context(void)
3357 #if defined(USE_ITHREADS)
3358 # ifdef OLD_PTHREADS_API
3360 if (pthread_getspecific(PL_thr_key, &t))
3361 Perl_croak_nocontext("panic: pthread_getspecific");
3364 # ifdef I_MACH_CTHREADS
3365 return (void*)cthread_data(cthread_self());
3367 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3376 Perl_set_context(void *t)
3379 PERL_ARGS_ASSERT_SET_CONTEXT;
3380 #if defined(USE_ITHREADS)
3381 # ifdef I_MACH_CTHREADS
3382 cthread_set_data(cthread_self(), t);
3384 if (pthread_setspecific(PL_thr_key, t))
3385 Perl_croak_nocontext("panic: pthread_setspecific");
3392 #endif /* !PERL_GET_CONTEXT_DEFINED */
3394 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3403 Perl_get_op_names(pTHX)
3405 PERL_UNUSED_CONTEXT;
3406 return (char **)PL_op_name;
3410 Perl_get_op_descs(pTHX)
3412 PERL_UNUSED_CONTEXT;
3413 return (char **)PL_op_desc;
3417 Perl_get_no_modify(pTHX)
3419 PERL_UNUSED_CONTEXT;
3420 return PL_no_modify;
3424 Perl_get_opargs(pTHX)
3426 PERL_UNUSED_CONTEXT;
3427 return (U32 *)PL_opargs;
3431 Perl_get_ppaddr(pTHX)
3434 PERL_UNUSED_CONTEXT;
3435 return (PPADDR_t*)PL_ppaddr;
3438 #ifndef HAS_GETENV_LEN
3440 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3442 char * const env_trans = PerlEnv_getenv(env_elem);
3443 PERL_UNUSED_CONTEXT;
3444 PERL_ARGS_ASSERT_GETENV_LEN;
3446 *len = strlen(env_trans);
3453 Perl_get_vtbl(pTHX_ int vtbl_id)
3455 const MGVTBL* result;
3456 PERL_UNUSED_CONTEXT;
3460 result = &PL_vtbl_sv;
3463 result = &PL_vtbl_env;
3465 case want_vtbl_envelem:
3466 result = &PL_vtbl_envelem;
3469 result = &PL_vtbl_sig;
3471 case want_vtbl_sigelem:
3472 result = &PL_vtbl_sigelem;
3474 case want_vtbl_pack:
3475 result = &PL_vtbl_pack;
3477 case want_vtbl_packelem:
3478 result = &PL_vtbl_packelem;
3480 case want_vtbl_dbline:
3481 result = &PL_vtbl_dbline;
3484 result = &PL_vtbl_isa;
3486 case want_vtbl_isaelem:
3487 result = &PL_vtbl_isaelem;
3489 case want_vtbl_arylen:
3490 result = &PL_vtbl_arylen;
3492 case want_vtbl_mglob:
3493 result = &PL_vtbl_mglob;
3495 case want_vtbl_nkeys:
3496 result = &PL_vtbl_nkeys;
3498 case want_vtbl_taint:
3499 result = &PL_vtbl_taint;
3501 case want_vtbl_substr:
3502 result = &PL_vtbl_substr;
3505 result = &PL_vtbl_vec;
3508 result = &PL_vtbl_pos;
3511 result = &PL_vtbl_bm;
3514 result = &PL_vtbl_fm;
3516 case want_vtbl_uvar:
3517 result = &PL_vtbl_uvar;
3519 case want_vtbl_defelem:
3520 result = &PL_vtbl_defelem;
3522 case want_vtbl_regexp:
3523 result = &PL_vtbl_regexp;
3525 case want_vtbl_regdata:
3526 result = &PL_vtbl_regdata;
3528 case want_vtbl_regdatum:
3529 result = &PL_vtbl_regdatum;
3531 #ifdef USE_LOCALE_COLLATE
3532 case want_vtbl_collxfrm:
3533 result = &PL_vtbl_collxfrm;
3536 case want_vtbl_amagic:
3537 result = &PL_vtbl_amagic;
3539 case want_vtbl_amagicelem:
3540 result = &PL_vtbl_amagicelem;
3542 case want_vtbl_backref:
3543 result = &PL_vtbl_backref;
3545 case want_vtbl_utf8:
3546 result = &PL_vtbl_utf8;
3552 return (MGVTBL*)result;
3556 Perl_my_fflush_all(pTHX)
3558 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3559 return PerlIO_flush(NULL);
3561 # if defined(HAS__FWALK)
3562 extern int fflush(FILE *);
3563 /* undocumented, unprototyped, but very useful BSDism */
3564 extern void _fwalk(int (*)(FILE *));
3568 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3570 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3571 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3573 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3574 open_max = sysconf(_SC_OPEN_MAX);
3577 open_max = FOPEN_MAX;
3580 open_max = OPEN_MAX;
3591 for (i = 0; i < open_max; i++)
3592 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3593 STDIO_STREAM_ARRAY[i]._file < open_max &&
3594 STDIO_STREAM_ARRAY[i]._flag)
3595 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3599 SETERRNO(EBADF,RMS_IFI);
3606 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3608 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3610 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3611 if (ckWARN(WARN_IO)) {
3612 const char * const direction =
3613 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3615 Perl_warner(aTHX_ packWARN(WARN_IO),
3616 "Filehandle %s opened only for %sput",
3619 Perl_warner(aTHX_ packWARN(WARN_IO),
3620 "Filehandle opened only for %sput", direction);
3627 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3629 warn_type = WARN_CLOSED;
3633 warn_type = WARN_UNOPENED;
3636 if (ckWARN(warn_type)) {
3637 const char * const pars =
3638 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3639 const char * const func =
3641 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3642 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3643 op < 0 ? "" : /* handle phoney cases */
3645 const char * const type =
3647 (OP_IS_SOCKET(op) ||
3648 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3649 "socket" : "filehandle");
3650 if (name && *name) {
3651 Perl_warner(aTHX_ packWARN(warn_type),
3652 "%s%s on %s %s %s", func, pars, vile, type, name);
3653 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3655 aTHX_ packWARN(warn_type),
3656 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3661 Perl_warner(aTHX_ packWARN(warn_type),
3662 "%s%s on %s %s", func, pars, vile, type);
3663 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3665 aTHX_ packWARN(warn_type),
3666 "\t(Are you trying to call %s%s on dirhandle?)\n",
3675 /* in ASCII order, not that it matters */
3676 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3679 Perl_ebcdic_control(pTHX_ int ch)
3687 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3688 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3691 if (ctlp == controllablechars)
3692 return('\177'); /* DEL */
3694 return((unsigned char)(ctlp - controllablechars - 1));
3695 } else { /* Want uncontrol */
3696 if (ch == '\177' || ch == -1)
3698 else if (ch == '\157')
3700 else if (ch == '\174')
3702 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3704 else if (ch == '\155')
3706 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3707 return(controllablechars[ch+1]);
3709 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3714 /* To workaround core dumps from the uninitialised tm_zone we get the
3715 * system to give us a reasonable struct to copy. This fix means that
3716 * strftime uses the tm_zone and tm_gmtoff values returned by
3717 * localtime(time()). That should give the desired result most of the
3718 * time. But probably not always!
3720 * This does not address tzname aspects of NETaa14816.
3725 # ifndef STRUCT_TM_HASZONE
3726 # define STRUCT_TM_HASZONE
3730 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3731 # ifndef HAS_TM_TM_ZONE
3732 # define HAS_TM_TM_ZONE
3737 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3739 #ifdef HAS_TM_TM_ZONE
3741 const struct tm* my_tm;
3742 PERL_ARGS_ASSERT_INIT_TM;
3744 my_tm = localtime(&now);
3746 Copy(my_tm, ptm, 1, struct tm);
3748 PERL_ARGS_ASSERT_INIT_TM;
3749 PERL_UNUSED_ARG(ptm);
3754 * mini_mktime - normalise struct tm values without the localtime()
3755 * semantics (and overhead) of mktime().
3758 Perl_mini_mktime(pTHX_ struct tm *ptm)
3762 int month, mday, year, jday;
3763 int odd_cent, odd_year;
3764 PERL_UNUSED_CONTEXT;
3766 PERL_ARGS_ASSERT_MINI_MKTIME;
3768 #define DAYS_PER_YEAR 365
3769 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3770 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3771 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3772 #define SECS_PER_HOUR (60*60)
3773 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3774 /* parentheses deliberately absent on these two, otherwise they don't work */
3775 #define MONTH_TO_DAYS 153/5
3776 #define DAYS_TO_MONTH 5/153
3777 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3778 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3779 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3780 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3783 * Year/day algorithm notes:
3785 * With a suitable offset for numeric value of the month, one can find
3786 * an offset into the year by considering months to have 30.6 (153/5) days,
3787 * using integer arithmetic (i.e., with truncation). To avoid too much
3788 * messing about with leap days, we consider January and February to be
3789 * the 13th and 14th month of the previous year. After that transformation,
3790 * we need the month index we use to be high by 1 from 'normal human' usage,
3791 * so the month index values we use run from 4 through 15.
3793 * Given that, and the rules for the Gregorian calendar (leap years are those
3794 * divisible by 4 unless also divisible by 100, when they must be divisible
3795 * by 400 instead), we can simply calculate the number of days since some
3796 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3797 * the days we derive from our month index, and adding in the day of the
3798 * month. The value used here is not adjusted for the actual origin which
3799 * it normally would use (1 January A.D. 1), since we're not exposing it.
3800 * We're only building the value so we can turn around and get the
3801 * normalised values for the year, month, day-of-month, and day-of-year.
3803 * For going backward, we need to bias the value we're using so that we find
3804 * the right year value. (Basically, we don't want the contribution of
3805 * March 1st to the number to apply while deriving the year). Having done
3806 * that, we 'count up' the contribution to the year number by accounting for
3807 * full quadracenturies (400-year periods) with their extra leap days, plus
3808 * the contribution from full centuries (to avoid counting in the lost leap
3809 * days), plus the contribution from full quad-years (to count in the normal
3810 * leap days), plus the leftover contribution from any non-leap years.
3811 * At this point, if we were working with an actual leap day, we'll have 0
3812 * days left over. This is also true for March 1st, however. So, we have
3813 * to special-case that result, and (earlier) keep track of the 'odd'
3814 * century and year contributions. If we got 4 extra centuries in a qcent,
3815 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3816 * Otherwise, we add back in the earlier bias we removed (the 123 from
3817 * figuring in March 1st), find the month index (integer division by 30.6),
3818 * and the remainder is the day-of-month. We then have to convert back to
3819 * 'real' months (including fixing January and February from being 14/15 in
3820 * the previous year to being in the proper year). After that, to get
3821 * tm_yday, we work with the normalised year and get a new yearday value for
3822 * January 1st, which we subtract from the yearday value we had earlier,
3823 * representing the date we've re-built. This is done from January 1
3824 * because tm_yday is 0-origin.
3826 * Since POSIX time routines are only guaranteed to work for times since the
3827 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3828 * applies Gregorian calendar rules even to dates before the 16th century
3829 * doesn't bother me. Besides, you'd need cultural context for a given
3830 * date to know whether it was Julian or Gregorian calendar, and that's
3831 * outside the scope for this routine. Since we convert back based on the
3832 * same rules we used to build the yearday, you'll only get strange results
3833 * for input which needed normalising, or for the 'odd' century years which
3834 * were leap years in the Julian calander but not in the Gregorian one.
3835 * I can live with that.
3837 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3838 * that's still outside the scope for POSIX time manipulation, so I don't
3842 year = 1900 + ptm->tm_year;
3843 month = ptm->tm_mon;
3844 mday = ptm->tm_mday;
3845 /* allow given yday with no month & mday to dominate the result */
3846 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3849 jday = 1 + ptm->tm_yday;
3858 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3859 yearday += month*MONTH_TO_DAYS + mday + jday;
3861 * Note that we don't know when leap-seconds were or will be,
3862 * so we have to trust the user if we get something which looks
3863 * like a sensible leap-second. Wild values for seconds will
3864 * be rationalised, however.
3866 if ((unsigned) ptm->tm_sec <= 60) {
3873 secs += 60 * ptm->tm_min;
3874 secs += SECS_PER_HOUR * ptm->tm_hour;
3876 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3877 /* got negative remainder, but need positive time */
3878 /* back off an extra day to compensate */
3879 yearday += (secs/SECS_PER_DAY)-1;
3880 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3883 yearday += (secs/SECS_PER_DAY);
3884 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3887 else if (secs >= SECS_PER_DAY) {
3888 yearday += (secs/SECS_PER_DAY);
3889 secs %= SECS_PER_DAY;
3891 ptm->tm_hour = secs/SECS_PER_HOUR;
3892 secs %= SECS_PER_HOUR;
3893 ptm->tm_min = secs/60;
3895 ptm->tm_sec += secs;
3896 /* done with time of day effects */
3898 * The algorithm for yearday has (so far) left it high by 428.
3899 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3900 * bias it by 123 while trying to figure out what year it
3901 * really represents. Even with this tweak, the reverse
3902 * translation fails for years before A.D. 0001.
3903 * It would still fail for Feb 29, but we catch that one below.
3905 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3906 yearday -= YEAR_ADJUST;
3907 year = (yearday / DAYS_PER_QCENT) * 400;
3908 yearday %= DAYS_PER_QCENT;
3909 odd_cent = yearday / DAYS_PER_CENT;
3910 year += odd_cent * 100;
3911 yearday %= DAYS_PER_CENT;
3912 year += (yearday / DAYS_PER_QYEAR) * 4;
3913 yearday %= DAYS_PER_QYEAR;
3914 odd_year = yearday / DAYS_PER_YEAR;
3916 yearday %= DAYS_PER_YEAR;
3917 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3922 yearday += YEAR_ADJUST; /* recover March 1st crock */
3923 month = yearday*DAYS_TO_MONTH;
3924 yearday -= month*MONTH_TO_DAYS;
3925 /* recover other leap-year adjustment */
3934 ptm->tm_year = year - 1900;
3936 ptm->tm_mday = yearday;
3937 ptm->tm_mon = month;
3941 ptm->tm_mon = month - 1;
3943 /* re-build yearday based on Jan 1 to get tm_yday */
3945 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3946 yearday += 14*MONTH_TO_DAYS + 1;
3947 ptm->tm_yday = jday - yearday;
3948 /* fix tm_wday if not overridden by caller */
3949 if ((unsigned)ptm->tm_wday > 6)
3950 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3954 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)
3962 PERL_ARGS_ASSERT_MY_STRFTIME;
3964 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3967 mytm.tm_hour = hour;
3968 mytm.tm_mday = mday;
3970 mytm.tm_year = year;
3971 mytm.tm_wday = wday;
3972 mytm.tm_yday = yday;
3973 mytm.tm_isdst = isdst;
3975 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3976 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3981 #ifdef HAS_TM_TM_GMTOFF
3982 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3984 #ifdef HAS_TM_TM_ZONE
3985 mytm.tm_zone = mytm2.tm_zone;
3990 Newx(buf, buflen, char);
3991 len = strftime(buf, buflen, fmt, &mytm);
3993 ** The following is needed to handle to the situation where
3994 ** tmpbuf overflows. Basically we want to allocate a buffer
3995 ** and try repeatedly. The reason why it is so complicated
3996 ** is that getting a return value of 0 from strftime can indicate
3997 ** one of the following:
3998 ** 1. buffer overflowed,
3999 ** 2. illegal conversion specifier, or
4000 ** 3. the format string specifies nothing to be returned(not
4001 ** an error). This could be because format is an empty string
4002 ** or it specifies %p that yields an empty string in some locale.
4003 ** If there is a better way to make it portable, go ahead by
4006 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4009 /* Possibly buf overflowed - try again with a bigger buf */
4010 const int fmtlen = strlen(fmt);
4011 int bufsize = fmtlen + buflen;
4013 Newx(buf, bufsize, char);
4015 buflen = strftime(buf, bufsize, fmt, &mytm);
4016 if (buflen > 0 && buflen < bufsize)
4018 /* heuristic to prevent out-of-memory errors */
4019 if (bufsize > 100*fmtlen) {
4025 Renew(buf, bufsize, char);
4030 Perl_croak(aTHX_ "panic: no strftime");
4036 #define SV_CWD_RETURN_UNDEF \
4037 sv_setsv(sv, &PL_sv_undef); \
4040 #define SV_CWD_ISDOT(dp) \
4041 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4042 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4045 =head1 Miscellaneous Functions
4047 =for apidoc getcwd_sv
4049 Fill the sv with current working directory
4054 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4055 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4056 * getcwd(3) if available
4057 * Comments from the orignal:
4058 * This is a faster version of getcwd. It's also more dangerous
4059 * because you might chdir out of a directory that you can't chdir
4063 Perl_getcwd_sv(pTHX_ register SV *sv)
4067 #ifndef INCOMPLETE_TAINTS
4071 PERL_ARGS_ASSERT_GETCWD_SV;
4075 char buf[MAXPATHLEN];
4077 /* Some getcwd()s automatically allocate a buffer of the given
4078 * size from the heap if they are given a NULL buffer pointer.
4079 * The problem is that this behaviour is not portable. */
4080 if (getcwd(buf, sizeof(buf) - 1)) {
4085 sv_setsv(sv, &PL_sv_undef);
4093 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4097 SvUPGRADE(sv, SVt_PV);
4099 if (PerlLIO_lstat(".", &statbuf) < 0) {
4100 SV_CWD_RETURN_UNDEF;
4103 orig_cdev = statbuf.st_dev;
4104 orig_cino = statbuf.st_ino;
4114 if (PerlDir_chdir("..") < 0) {
4115 SV_CWD_RETURN_UNDEF;
4117 if (PerlLIO_stat(".", &statbuf) < 0) {
4118 SV_CWD_RETURN_UNDEF;
4121 cdev = statbuf.st_dev;
4122 cino = statbuf.st_ino;
4124 if (odev == cdev && oino == cino) {
4127 if (!(dir = PerlDir_open("."))) {
4128 SV_CWD_RETURN_UNDEF;
4131 while ((dp = PerlDir_read(dir)) != NULL) {
4133 namelen = dp->d_namlen;
4135 namelen = strlen(dp->d_name);
4138 if (SV_CWD_ISDOT(dp)) {
4142 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4143 SV_CWD_RETURN_UNDEF;
4146 tdev = statbuf.st_dev;
4147 tino = statbuf.st_ino;
4148 if (tino == oino && tdev == odev) {
4154 SV_CWD_RETURN_UNDEF;
4157 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4158 SV_CWD_RETURN_UNDEF;
4161 SvGROW(sv, pathlen + namelen + 1);
4165 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4168 /* prepend current directory to the front */
4170 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4171 pathlen += (namelen + 1);
4173 #ifdef VOID_CLOSEDIR
4176 if (PerlDir_close(dir) < 0) {
4177 SV_CWD_RETURN_UNDEF;
4183 SvCUR_set(sv, pathlen);
4187 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4188 SV_CWD_RETURN_UNDEF;
4191 if (PerlLIO_stat(".", &statbuf) < 0) {
4192 SV_CWD_RETURN_UNDEF;
4195 cdev = statbuf.st_dev;
4196 cino = statbuf.st_ino;
4198 if (cdev != orig_cdev || cino != orig_cino) {
4199 Perl_croak(aTHX_ "Unstable directory path, "
4200 "current directory changed unexpectedly");
4211 #define VERSION_MAX 0x7FFFFFFF
4213 =for apidoc scan_version
4215 Returns a pointer to the next character after the parsed
4216 version string, as well as upgrading the passed in SV to
4219 Function must be called with an already existing SV like
4222 s = scan_version(s, SV *sv, bool qv);
4224 Performs some preprocessing to the string to ensure that
4225 it has the correct characteristics of a version. Flags the
4226 object if it contains an underscore (which denotes this
4227 is an alpha version). The boolean qv denotes that the version
4228 should be interpreted as if it had multiple decimals, even if
4235 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4244 AV * const av = newAV();
4245 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4247 PERL_ARGS_ASSERT_SCAN_VERSION;
4249 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4251 while (isSPACE(*s)) /* leading whitespace is OK */
4257 s++; /* get past 'v' */
4258 qv = 1; /* force quoted version processing */
4263 /* pre-scan the input string to check for decimals/underbars */
4264 while ( *pos == '.' || *pos == '_' || *pos == ',' || isDIGIT(*pos) )
4269 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4273 else if ( *pos == '_' )
4276 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4278 width = pos - last - 1; /* natural width of sub-version */
4280 else if ( *pos == ',' && isDIGIT(pos[1]) )
4289 if ( alpha && !saw_period )
4290 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4292 if ( alpha && saw_period && width == 0 )
4293 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4295 if ( saw_period > 1 )
4296 qv = 1; /* force quoted version processing */
4302 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4304 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4305 if ( !qv && width < 3 )
4306 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4308 while (isDIGIT(*pos))
4310 if (!isALPHA(*pos)) {
4316 /* this is atoi() that delimits on underscores */
4317 const char *end = pos;
4321 /* the following if() will only be true after the decimal
4322 * point of a version originally created with a bare
4323 * floating point number, i.e. not quoted in any way
4325 if ( !qv && s > start && saw_period == 1 ) {
4329 rev += (*s - '0') * mult;
4331 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4332 || (PERL_ABS(rev) > VERSION_MAX )) {
4333 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4334 "Integer overflow in version %d",VERSION_MAX);
4345 while (--end >= s) {
4347 rev += (*end - '0') * mult;
4349 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4350 || (PERL_ABS(rev) > VERSION_MAX )) {
4351 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4352 "Integer overflow in version");
4361 /* Append revision */
4362 av_push(av, newSViv(rev));
4367 else if ( *pos == '.' )
4369 else if ( *pos == '_' && isDIGIT(pos[1]) )
4371 else if ( *pos == ',' && isDIGIT(pos[1]) )
4373 else if ( isDIGIT(*pos) )
4380 while ( isDIGIT(*pos) )
4385 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4393 if ( qv ) { /* quoted versions always get at least three terms*/
4394 I32 len = av_len(av);
4395 /* This for loop appears to trigger a compiler bug on OS X, as it
4396 loops infinitely. Yes, len is negative. No, it makes no sense.
4397 Compiler in question is:
4398 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4399 for ( len = 2 - len; len > 0; len-- )
4400 av_push(MUTABLE_AV(sv), newSViv(0));
4404 av_push(av, newSViv(0));
4407 /* need to save off the current version string for later */
4409 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4410 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4411 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4413 else if ( s > start ) {
4414 SV * orig = newSVpvn(start,s-start);
4415 if ( qv && saw_period == 1 && *start != 'v' ) {
4416 /* need to insert a v to be consistent */
4417 sv_insert(orig, 0, 0, "v", 1);
4419 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4422 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4423 av_push(av, newSViv(0));
4426 /* And finally, store the AV in the hash */
4427 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4429 /* fix RT#19517 - special case 'undef' as string */
4430 if ( *s == 'u' && strEQ(s,"undef") ) {
4438 =for apidoc new_version
4440 Returns a new version object based on the passed in SV:
4442 SV *sv = new_version(SV *ver);
4444 Does not alter the passed in ver SV. See "upg_version" if you
4445 want to upgrade the SV.
4451 Perl_new_version(pTHX_ SV *ver)
4454 SV * const rv = newSV(0);
4455 PERL_ARGS_ASSERT_NEW_VERSION;
4456 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4459 AV * const av = newAV();
4461 /* This will get reblessed later if a derived class*/
4462 SV * const hv = newSVrv(rv, "version");
4463 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4468 /* Begin copying all of the elements */
4469 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4470 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4472 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4473 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4475 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4477 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4478 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4481 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4483 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4484 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4487 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4488 /* This will get reblessed later if a derived class*/
4489 for ( key = 0; key <= av_len(sav); key++ )
4491 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4492 av_push(av, newSViv(rev));
4495 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4500 const MAGIC* const mg = SvVSTRING_mg(ver);
4501 if ( mg ) { /* already a v-string */
4502 const STRLEN len = mg->mg_len;
4503 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4504 sv_setpvn(rv,version,len);
4505 /* this is for consistency with the pure Perl class */
4506 if ( *version != 'v' )
4507 sv_insert(rv, 0, 0, "v", 1);
4512 sv_setsv(rv,ver); /* make a duplicate */
4517 return upg_version(rv, FALSE);
4521 =for apidoc upg_version
4523 In-place upgrade of the supplied SV to a version object.
4525 SV *sv = upg_version(SV *sv, bool qv);
4527 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4528 to force this SV to be interpreted as an "extended" version.
4534 Perl_upg_version(pTHX_ SV *ver, bool qv)
4536 const char *version, *s;
4541 PERL_ARGS_ASSERT_UPG_VERSION;
4543 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4545 /* may get too much accuracy */
4547 #ifdef USE_LOCALE_NUMERIC
4548 char *loc = setlocale(LC_NUMERIC, "C");
4550 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4551 #ifdef USE_LOCALE_NUMERIC
4552 setlocale(LC_NUMERIC, loc);
4554 while (tbuf[len-1] == '0' && len > 0) len--;
4555 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4556 version = savepvn(tbuf, len);
4559 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4560 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4564 else /* must be a string or something like a string */
4567 version = savepv(SvPV(ver,len));
4569 # if PERL_VERSION > 5
4570 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4571 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4572 /* may be a v-string */
4573 SV * const nsv = sv_newmortal();
4577 sv_setpvf(nsv,"v%vd",ver);
4578 pos = nver = savepv(SvPV_nolen(nsv));
4580 /* scan the resulting formatted string */
4581 pos++; /* skip the leading 'v' */
4582 while ( *pos == '.' || isDIGIT(*pos) ) {
4588 /* is definitely a v-string */
4589 if ( saw_period == 2 ) {
4598 s = scan_version(version, ver, qv);
4600 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4601 "Version string '%s' contains invalid data; "
4602 "ignoring: '%s'", version, s);
4610 Validates that the SV contains a valid version object.
4612 bool vverify(SV *vobj);
4614 Note that it only confirms the bare minimum structure (so as not to get
4615 confused by derived classes which may contain additional hash entries):
4619 =item * The SV contains a [reference to a] hash
4621 =item * The hash contains a "version" key
4623 =item * The "version" key has [a reference to] an AV as its value
4631 Perl_vverify(pTHX_ SV *vs)
4635 PERL_ARGS_ASSERT_VVERIFY;
4640 /* see if the appropriate elements exist */
4641 if ( SvTYPE(vs) == SVt_PVHV
4642 && hv_exists(MUTABLE_HV(vs), "version", 7)
4643 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4644 && SvTYPE(sv) == SVt_PVAV )
4653 Accepts a version object and returns the normalized floating
4654 point representation. Call like:
4658 NOTE: you can pass either the object directly or the SV
4659 contained within the RV.
4665 Perl_vnumify(pTHX_ SV *vs)
4670 SV * const sv = newSV(0);
4673 PERL_ARGS_ASSERT_VNUMIFY;
4679 Perl_croak(aTHX_ "Invalid version object");
4681 /* see if various flags exist */
4682 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4684 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4685 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4690 /* attempt to retrieve the version array */
4691 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4703 digit = SvIV(*av_fetch(av, 0, 0));
4704 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4705 for ( i = 1 ; i < len ; i++ )
4707 digit = SvIV(*av_fetch(av, i, 0));
4709 const int denom = (width == 2 ? 10 : 100);
4710 const div_t term = div((int)PERL_ABS(digit),denom);
4711 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4714 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4720 digit = SvIV(*av_fetch(av, len, 0));
4721 if ( alpha && width == 3 ) /* alpha version */
4723 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4727 sv_catpvs(sv, "000");
4735 Accepts a version object and returns the normalized string
4736 representation. Call like:
4740 NOTE: you can pass either the object directly or the SV
4741 contained within the RV.
4747 Perl_vnormal(pTHX_ SV *vs)
4751 SV * const sv = newSV(0);
4754 PERL_ARGS_ASSERT_VNORMAL;
4760 Perl_croak(aTHX_ "Invalid version object");
4762 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4764 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4772 digit = SvIV(*av_fetch(av, 0, 0));
4773 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4774 for ( i = 1 ; i < len ; i++ ) {
4775 digit = SvIV(*av_fetch(av, i, 0));
4776 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4781 /* handle last digit specially */
4782 digit = SvIV(*av_fetch(av, len, 0));
4784 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4786 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4789 if ( len <= 2 ) { /* short version, must be at least three */
4790 for ( len = 2 - len; len != 0; len-- )
4797 =for apidoc vstringify
4799 In order to maintain maximum compatibility with earlier versions
4800 of Perl, this function will return either the floating point
4801 notation or the multiple dotted notation, depending on whether
4802 the original version contained 1 or more dots, respectively
4808 Perl_vstringify(pTHX_ SV *vs)
4810 PERL_ARGS_ASSERT_VSTRINGIFY;
4816 Perl_croak(aTHX_ "Invalid version object");
4818 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4820 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4824 return &PL_sv_undef;
4827 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4837 Version object aware cmp. Both operands must already have been
4838 converted into version objects.
4844 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4847 bool lalpha = FALSE;
4848 bool ralpha = FALSE;
4853 PERL_ARGS_ASSERT_VCMP;
4860 if ( !vverify(lhv) )
4861 Perl_croak(aTHX_ "Invalid version object");
4863 if ( !vverify(rhv) )
4864 Perl_croak(aTHX_ "Invalid version object");
4866 /* get the left hand term */
4867 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4868 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4871 /* and the right hand term */
4872 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4873 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4881 while ( i <= m && retval == 0 )
4883 left = SvIV(*av_fetch(lav,i,0));
4884 right = SvIV(*av_fetch(rav,i,0));
4892 /* tiebreaker for alpha with identical terms */
4893 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4895 if ( lalpha && !ralpha )
4899 else if ( ralpha && !lalpha)
4905 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4909 while ( i <= r && retval == 0 )
4911 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4912 retval = -1; /* not a match after all */
4918 while ( i <= l && retval == 0 )
4920 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4921 retval = +1; /* not a match after all */
4929 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4930 # define EMULATE_SOCKETPAIR_UDP
4933 #ifdef EMULATE_SOCKETPAIR_UDP
4935 S_socketpair_udp (int fd[2]) {
4937 /* Fake a datagram socketpair using UDP to localhost. */
4938 int sockets[2] = {-1, -1};
4939 struct sockaddr_in addresses[2];
4941 Sock_size_t size = sizeof(struct sockaddr_in);
4942 unsigned short port;
4945 memset(&addresses, 0, sizeof(addresses));
4948 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4949 if (sockets[i] == -1)
4950 goto tidy_up_and_fail;
4952 addresses[i].sin_family = AF_INET;
4953 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4954 addresses[i].sin_port = 0; /* kernel choses port. */
4955 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4956 sizeof(struct sockaddr_in)) == -1)
4957 goto tidy_up_and_fail;
4960 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4961 for each connect the other socket to it. */
4964 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4966 goto tidy_up_and_fail;
4967 if (size != sizeof(struct sockaddr_in))
4968 goto abort_tidy_up_and_fail;
4969 /* !1 is 0, !0 is 1 */
4970 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4971 sizeof(struct sockaddr_in)) == -1)
4972 goto tidy_up_and_fail;
4975 /* Now we have 2 sockets connected to each other. I don't trust some other
4976 process not to have already sent a packet to us (by random) so send
4977 a packet from each to the other. */
4980 /* I'm going to send my own port number. As a short.
4981 (Who knows if someone somewhere has sin_port as a bitfield and needs
4982 this routine. (I'm assuming crays have socketpair)) */
4983 port = addresses[i].sin_port;
4984 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4985 if (got != sizeof(port)) {
4987 goto tidy_up_and_fail;
4988 goto abort_tidy_up_and_fail;
4992 /* Packets sent. I don't trust them to have arrived though.
4993 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4994 connect to localhost will use a second kernel thread. In 2.6 the
4995 first thread running the connect() returns before the second completes,
4996 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4997 returns 0. Poor programs have tripped up. One poor program's authors'
4998 had a 50-1 reverse stock split. Not sure how connected these were.)
4999 So I don't trust someone not to have an unpredictable UDP stack.
5003 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5004 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5008 FD_SET((unsigned int)sockets[0], &rset);
5009 FD_SET((unsigned int)sockets[1], &rset);
5011 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5012 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5013 || !FD_ISSET(sockets[1], &rset)) {
5014 /* I hope this is portable and appropriate. */
5016 goto tidy_up_and_fail;
5017 goto abort_tidy_up_and_fail;
5021 /* And the paranoia department even now doesn't trust it to have arrive
5022 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5024 struct sockaddr_in readfrom;
5025 unsigned short buffer[2];
5030 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5031 sizeof(buffer), MSG_DONTWAIT,
5032 (struct sockaddr *) &readfrom, &size);
5034 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5036 (struct sockaddr *) &readfrom, &size);
5040 goto tidy_up_and_fail;
5041 if (got != sizeof(port)
5042 || size != sizeof(struct sockaddr_in)
5043 /* Check other socket sent us its port. */
5044 || buffer[0] != (unsigned short) addresses[!i].sin_port
5045 /* Check kernel says we got the datagram from that socket */
5046 || readfrom.sin_family != addresses[!i].sin_family
5047 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5048 || readfrom.sin_port != addresses[!i].sin_port)
5049 goto abort_tidy_up_and_fail;
5052 /* My caller (my_socketpair) has validated that this is non-NULL */
5055 /* I hereby declare this connection open. May God bless all who cross
5059 abort_tidy_up_and_fail:
5060 errno = ECONNABORTED;
5064 if (sockets[0] != -1)
5065 PerlLIO_close(sockets[0]);
5066 if (sockets[1] != -1)
5067 PerlLIO_close(sockets[1]);
5072 #endif /* EMULATE_SOCKETPAIR_UDP */
5074 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5076 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5077 /* Stevens says that family must be AF_LOCAL, protocol 0.
5078 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5083 struct sockaddr_in listen_addr;
5084 struct sockaddr_in connect_addr;
5089 || family != AF_UNIX
5092 errno = EAFNOSUPPORT;
5100 #ifdef EMULATE_SOCKETPAIR_UDP
5101 if (type == SOCK_DGRAM)
5102 return S_socketpair_udp(fd);
5105 listener = PerlSock_socket(AF_INET, type, 0);
5108 memset(&listen_addr, 0, sizeof(listen_addr));
5109 listen_addr.sin_family = AF_INET;
5110 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5111 listen_addr.sin_port = 0; /* kernel choses port. */
5112 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5113 sizeof(listen_addr)) == -1)
5114 goto tidy_up_and_fail;
5115 if (PerlSock_listen(listener, 1) == -1)
5116 goto tidy_up_and_fail;
5118 connector = PerlSock_socket(AF_INET, type, 0);
5119 if (connector == -1)
5120 goto tidy_up_and_fail;
5121 /* We want to find out the port number to connect to. */
5122 size = sizeof(connect_addr);
5123 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5125 goto tidy_up_and_fail;
5126 if (size != sizeof(connect_addr))
5127 goto abort_tidy_up_and_fail;
5128 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5129 sizeof(connect_addr)) == -1)
5130 goto tidy_up_and_fail;
5132 size = sizeof(listen_addr);
5133 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5136 goto tidy_up_and_fail;
5137 if (size != sizeof(listen_addr))
5138 goto abort_tidy_up_and_fail;
5139 PerlLIO_close(listener);
5140 /* Now check we are talking to ourself by matching port and host on the
5142 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5144 goto tidy_up_and_fail;
5145 if (size != sizeof(connect_addr)
5146 || listen_addr.sin_family != connect_addr.sin_family
5147 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5148 || listen_addr.sin_port != connect_addr.sin_port) {
5149 goto abort_tidy_up_and_fail;
5155 abort_tidy_up_and_fail:
5157 errno = ECONNABORTED; /* This would be the standard thing to do. */
5159 # ifdef ECONNREFUSED
5160 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5162 errno = ETIMEDOUT; /* Desperation time. */
5169 PerlLIO_close(listener);
5170 if (connector != -1)
5171 PerlLIO_close(connector);
5173 PerlLIO_close(acceptor);
5179 /* In any case have a stub so that there's code corresponding
5180 * to the my_socketpair in global.sym. */
5182 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5183 #ifdef HAS_SOCKETPAIR
5184 return socketpair(family, type, protocol, fd);
5193 =for apidoc sv_nosharing
5195 Dummy routine which "shares" an SV when there is no sharing module present.
5196 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5197 Exists to avoid test for a NULL function pointer and because it could
5198 potentially warn under some level of strict-ness.
5204 Perl_sv_nosharing(pTHX_ SV *sv)
5206 PERL_UNUSED_CONTEXT;
5207 PERL_UNUSED_ARG(sv);
5212 =for apidoc sv_destroyable
5214 Dummy routine which reports that object can be destroyed when there is no
5215 sharing module present. It ignores its single SV argument, and returns
5216 'true'. Exists to avoid test for a NULL function pointer and because it
5217 could potentially warn under some level of strict-ness.
5223 Perl_sv_destroyable(pTHX_ SV *sv)
5225 PERL_UNUSED_CONTEXT;
5226 PERL_UNUSED_ARG(sv);
5231 Perl_parse_unicode_opts(pTHX_ const char **popt)
5233 const char *p = *popt;
5236 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5240 opt = (U32) atoi(p);
5243 if (*p && *p != '\n' && *p != '\r')
5244 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5249 case PERL_UNICODE_STDIN:
5250 opt |= PERL_UNICODE_STDIN_FLAG; break;
5251 case PERL_UNICODE_STDOUT:
5252 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5253 case PERL_UNICODE_STDERR:
5254 opt |= PERL_UNICODE_STDERR_FLAG; break;
5255 case PERL_UNICODE_STD:
5256 opt |= PERL_UNICODE_STD_FLAG; break;
5257 case PERL_UNICODE_IN:
5258 opt |= PERL_UNICODE_IN_FLAG; break;
5259 case PERL_UNICODE_OUT:
5260 opt |= PERL_UNICODE_OUT_FLAG; break;
5261 case PERL_UNICODE_INOUT:
5262 opt |= PERL_UNICODE_INOUT_FLAG; break;
5263 case PERL_UNICODE_LOCALE:
5264 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5265 case PERL_UNICODE_ARGV:
5266 opt |= PERL_UNICODE_ARGV_FLAG; break;
5267 case PERL_UNICODE_UTF8CACHEASSERT:
5268 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5270 if (*p != '\n' && *p != '\r')
5272 "Unknown Unicode option letter '%c'", *p);
5278 opt = PERL_UNICODE_DEFAULT_FLAGS;
5280 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5281 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5282 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5294 * This is really just a quick hack which grabs various garbage
5295 * values. It really should be a real hash algorithm which
5296 * spreads the effect of every input bit onto every output bit,
5297 * if someone who knows about such things would bother to write it.
5298 * Might be a good idea to add that function to CORE as well.
5299 * No numbers below come from careful analysis or anything here,
5300 * except they are primes and SEED_C1 > 1E6 to get a full-width
5301 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5302 * probably be bigger too.
5305 # define SEED_C1 1000003
5306 #define SEED_C4 73819
5308 # define SEED_C1 25747
5309 #define SEED_C4 20639
5313 #define SEED_C5 26107
5315 #ifndef PERL_NO_DEV_RANDOM
5320 # include <starlet.h>
5321 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5322 * in 100-ns units, typically incremented ever 10 ms. */
5323 unsigned int when[2];
5325 # ifdef HAS_GETTIMEOFDAY
5326 struct timeval when;
5332 /* This test is an escape hatch, this symbol isn't set by Configure. */
5333 #ifndef PERL_NO_DEV_RANDOM
5334 #ifndef PERL_RANDOM_DEVICE
5335 /* /dev/random isn't used by default because reads from it will block
5336 * if there isn't enough entropy available. You can compile with
5337 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5338 * is enough real entropy to fill the seed. */
5339 # define PERL_RANDOM_DEVICE "/dev/urandom"
5341 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5343 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5352 _ckvmssts(sys$gettim(when));
5353 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5355 # ifdef HAS_GETTIMEOFDAY
5356 PerlProc_gettimeofday(&when,NULL);
5357 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5360 u = (U32)SEED_C1 * when;
5363 u += SEED_C3 * (U32)PerlProc_getpid();
5364 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5365 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5366 u += SEED_C5 * (U32)PTR2UV(&when);
5372 Perl_get_hash_seed(pTHX)
5375 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5381 if (s && isDIGIT(*s))
5382 myseed = (UV)Atoul(s);
5384 #ifdef USE_HASH_SEED_EXPLICIT
5388 /* Compute a random seed */
5389 (void)seedDrand01((Rand_seed_t)seed());
5390 myseed = (UV)(Drand01() * (NV)UV_MAX);
5391 #if RANDBITS < (UVSIZE * 8)
5392 /* Since there are not enough randbits to to reach all
5393 * the bits of a UV, the low bits might need extra
5394 * help. Sum in another random number that will
5395 * fill in the low bits. */
5397 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5398 #endif /* RANDBITS < (UVSIZE * 8) */
5399 if (myseed == 0) { /* Superparanoia. */
5400 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5402 Perl_croak(aTHX_ "Your random numbers are not that random");
5405 PL_rehash_seed_set = TRUE;
5412 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5414 const char * const stashpv = CopSTASHPV(c);
5415 const char * const name = HvNAME_get(hv);
5416 PERL_UNUSED_CONTEXT;
5417 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5419 if (stashpv == name)
5421 if (stashpv && name)
5422 if (strEQ(stashpv, name))
5429 #ifdef PERL_GLOBAL_STRUCT
5431 #define PERL_GLOBAL_STRUCT_INIT
5432 #include "opcode.h" /* the ppaddr and check */
5435 Perl_init_global_struct(pTHX)
5437 struct perl_vars *plvarsp = NULL;
5438 # ifdef PERL_GLOBAL_STRUCT
5439 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5440 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5441 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5442 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5443 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5447 plvarsp = PL_VarsPtr;
5448 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5454 # define PERLVAR(var,type) /**/
5455 # define PERLVARA(var,n,type) /**/
5456 # define PERLVARI(var,type,init) plvarsp->var = init;
5457 # define PERLVARIC(var,type,init) plvarsp->var = init;
5458 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5459 # include "perlvars.h"
5465 # ifdef PERL_GLOBAL_STRUCT
5468 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5469 if (!plvarsp->Gppaddr)
5473 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5474 if (!plvarsp->Gcheck)
5476 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5477 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5479 # ifdef PERL_SET_VARS
5480 PERL_SET_VARS(plvarsp);
5482 # undef PERL_GLOBAL_STRUCT_INIT
5487 #endif /* PERL_GLOBAL_STRUCT */
5489 #ifdef PERL_GLOBAL_STRUCT
5492 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5494 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5495 # ifdef PERL_GLOBAL_STRUCT
5496 # ifdef PERL_UNSET_VARS
5497 PERL_UNSET_VARS(plvarsp);
5499 free(plvarsp->Gppaddr);
5500 free(plvarsp->Gcheck);
5501 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5507 #endif /* PERL_GLOBAL_STRUCT */
5511 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5512 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5513 * given, and you supply your own implementation.
5515 * The default implementation reads a single env var, PERL_MEM_LOG,
5516 * expecting one or more of the following:
5518 * \d+ - fd fd to write to : must be 1st (atoi)
5519 * 'm' - memlog was PERL_MEM_LOG=1
5520 * 's' - svlog was PERL_SV_LOG=1
5521 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5523 * This makes the logger controllable enough that it can reasonably be
5524 * added to the system perl.
5527 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5528 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5530 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5532 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5533 * writes to. In the default logger, this is settable at runtime.
5535 #ifndef PERL_MEM_LOG_FD
5536 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5539 #ifndef PERL_MEM_LOG_NOIMPL
5541 # ifdef DEBUG_LEAKING_SCALARS
5542 # define SV_LOG_SERIAL_FMT " [%lu]"
5543 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5545 # define SV_LOG_SERIAL_FMT
5546 # define _SV_LOG_SERIAL_ARG(sv)
5550 S_mem_log_common(enum mem_log_type mlt, const UV n,
5551 const UV typesize, const char *type_name, const SV *sv,
5552 Malloc_t oldalloc, Malloc_t newalloc,
5553 const char *filename, const int linenumber,
5554 const char *funcname)
5558 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5560 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5563 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
5565 /* We can't use SVs or PerlIO for obvious reasons,
5566 * so we'll use stdio and low-level IO instead. */
5567 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5569 # ifdef HAS_GETTIMEOFDAY
5570 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5571 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5573 gettimeofday(&tv, 0);
5575 # define MEM_LOG_TIME_FMT "%10d: "
5576 # define MEM_LOG_TIME_ARG (int)when
5580 /* If there are other OS specific ways of hires time than
5581 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5582 * probably that they would be used to fill in the struct
5586 int fd = atoi(pmlenv);
5588 fd = PERL_MEM_LOG_FD;
5590 if (strchr(pmlenv, 't')) {
5591 len = my_snprintf(buf, sizeof(buf),
5592 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5593 PerlLIO_write(fd, buf, len);
5597 len = my_snprintf(buf, sizeof(buf),
5598 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5599 " %s = %"IVdf": %"UVxf"\n",
5600 filename, linenumber, funcname, n, typesize,
5601 type_name, n * typesize, PTR2UV(newalloc));
5604 len = my_snprintf(buf, sizeof(buf),
5605 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5606 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5607 filename, linenumber, funcname, n, typesize,
5608 type_name, n * typesize, PTR2UV(oldalloc),
5612 len = my_snprintf(buf, sizeof(buf),
5613 "free: %s:%d:%s: %"UVxf"\n",
5614 filename, linenumber, funcname,
5619 len = my_snprintf(buf, sizeof(buf),
5620 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5621 mlt == MLT_NEW_SV ? "new" : "del",
5622 filename, linenumber, funcname,
5623 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5628 PerlLIO_write(fd, buf, len);
5632 #endif /* !PERL_MEM_LOG_NOIMPL */
5634 #ifndef PERL_MEM_LOG_NOIMPL
5636 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5637 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5639 /* this is suboptimal, but bug compatible. User is providing their
5640 own implemenation, but is getting these functions anyway, and they
5641 do nothing. But _NOIMPL users should be able to cope or fix */
5643 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5644 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5648 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5650 const char *filename, const int linenumber,
5651 const char *funcname)
5653 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5654 NULL, NULL, newalloc,
5655 filename, linenumber, funcname);
5660 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5661 Malloc_t oldalloc, Malloc_t newalloc,
5662 const char *filename, const int linenumber,
5663 const char *funcname)
5665 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5666 NULL, oldalloc, newalloc,
5667 filename, linenumber, funcname);
5672 Perl_mem_log_free(Malloc_t oldalloc,
5673 const char *filename, const int linenumber,
5674 const char *funcname)
5676 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5677 filename, linenumber, funcname);
5682 Perl_mem_log_new_sv(const SV *sv,
5683 const char *filename, const int linenumber,
5684 const char *funcname)
5686 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5687 filename, linenumber, funcname);
5691 Perl_mem_log_del_sv(const SV *sv,
5692 const char *filename, const int linenumber,
5693 const char *funcname)
5695 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5696 filename, linenumber, funcname);
5699 #endif /* PERL_MEM_LOG */
5702 =for apidoc my_sprintf
5704 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5705 the length of the string written to the buffer. Only rare pre-ANSI systems
5706 need the wrapper function - usually this is a direct call to C<sprintf>.
5710 #ifndef SPRINTF_RETURNS_STRLEN
5712 Perl_my_sprintf(char *buffer, const char* pat, ...)
5715 PERL_ARGS_ASSERT_MY_SPRINTF;
5716 va_start(args, pat);
5717 vsprintf(buffer, pat, args);
5719 return strlen(buffer);
5724 =for apidoc my_snprintf
5726 The C library C<snprintf> functionality, if available and
5727 standards-compliant (uses C<vsnprintf>, actually). However, if the
5728 C<vsnprintf> is not available, will unfortunately use the unsafe
5729 C<vsprintf> which can overrun the buffer (there is an overrun check,
5730 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5731 getting C<vsnprintf>.
5736 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5741 PERL_ARGS_ASSERT_MY_SNPRINTF;
5742 va_start(ap, format);
5743 #ifdef HAS_VSNPRINTF
5744 retval = vsnprintf(buffer, len, format, ap);
5746 retval = vsprintf(buffer, format, ap);
5749 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5750 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5751 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5756 =for apidoc my_vsnprintf
5758 The C library C<vsnprintf> if available and standards-compliant.
5759 However, if if the C<vsnprintf> is not available, will unfortunately
5760 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5761 overrun check, but that may be too late). Consider using
5762 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5767 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5774 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5776 Perl_va_copy(ap, apc);
5777 # ifdef HAS_VSNPRINTF
5778 retval = vsnprintf(buffer, len, format, apc);
5780 retval = vsprintf(buffer, format, apc);
5783 # ifdef HAS_VSNPRINTF
5784 retval = vsnprintf(buffer, len, format, ap);
5786 retval = vsprintf(buffer, format, ap);
5788 #endif /* #ifdef NEED_VA_COPY */
5789 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5790 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5791 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5796 Perl_my_clearenv(pTHX)
5799 #if ! defined(PERL_MICRO)
5800 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5802 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5803 # if defined(USE_ENVIRON_ARRAY)
5804 # if defined(USE_ITHREADS)
5805 /* only the parent thread can clobber the process environment */
5806 if (PL_curinterp == aTHX)
5807 # endif /* USE_ITHREADS */
5809 # if ! defined(PERL_USE_SAFE_PUTENV)
5810 if ( !PL_use_safe_putenv) {
5812 if (environ == PL_origenviron)
5813 environ = (char**)safesysmalloc(sizeof(char*));
5815 for (i = 0; environ[i]; i++)
5816 (void)safesysfree(environ[i]);
5819 # else /* PERL_USE_SAFE_PUTENV */
5820 # if defined(HAS_CLEARENV)
5822 # elif defined(HAS_UNSETENV)
5823 int bsiz = 80; /* Most envvar names will be shorter than this. */
5824 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5825 char *buf = (char*)safesysmalloc(bufsiz);
5826 while (*environ != NULL) {
5827 char *e = strchr(*environ, '=');
5828 int l = e ? e - *environ : (int)strlen(*environ);
5830 (void)safesysfree(buf);
5831 bsiz = l + 1; /* + 1 for the \0. */
5832 buf = (char*)safesysmalloc(bufsiz);
5834 memcpy(buf, *environ, l);
5836 (void)unsetenv(buf);
5838 (void)safesysfree(buf);
5839 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5840 /* Just null environ and accept the leakage. */
5842 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5843 # endif /* ! PERL_USE_SAFE_PUTENV */
5845 # endif /* USE_ENVIRON_ARRAY */
5846 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5847 #endif /* PERL_MICRO */
5850 #ifdef PERL_IMPLICIT_CONTEXT
5852 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5853 the global PL_my_cxt_index is incremented, and that value is assigned to
5854 that module's static my_cxt_index (who's address is passed as an arg).
5855 Then, for each interpreter this function is called for, it makes sure a
5856 void* slot is available to hang the static data off, by allocating or
5857 extending the interpreter's PL_my_cxt_list array */
5859 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5861 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5865 PERL_ARGS_ASSERT_MY_CXT_INIT;
5867 /* this module hasn't been allocated an index yet */
5868 MUTEX_LOCK(&PL_my_ctx_mutex);
5869 *index = PL_my_cxt_index++;
5870 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5873 /* make sure the array is big enough */
5874 if (PL_my_cxt_size <= *index) {
5875 if (PL_my_cxt_size) {
5876 while (PL_my_cxt_size <= *index)
5877 PL_my_cxt_size *= 2;
5878 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5881 PL_my_cxt_size = 16;
5882 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5885 /* newSV() allocates one more than needed */
5886 p = (void*)SvPVX(newSV(size-1));
5887 PL_my_cxt_list[*index] = p;
5888 Zero(p, size, char);
5892 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5895 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5900 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5902 for (index = 0; index < PL_my_cxt_index; index++) {
5903 const char *key = PL_my_cxt_keys[index];
5904 /* try direct pointer compare first - there are chances to success,
5905 * and it's much faster.
5907 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5914 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5920 PERL_ARGS_ASSERT_MY_CXT_INIT;
5922 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5924 /* this module hasn't been allocated an index yet */
5925 MUTEX_LOCK(&PL_my_ctx_mutex);
5926 index = PL_my_cxt_index++;
5927 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5930 /* make sure the array is big enough */
5931 if (PL_my_cxt_size <= index) {
5932 int old_size = PL_my_cxt_size;
5934 if (PL_my_cxt_size) {
5935 while (PL_my_cxt_size <= index)
5936 PL_my_cxt_size *= 2;
5937 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5938 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5941 PL_my_cxt_size = 16;
5942 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5943 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5945 for (i = old_size; i < PL_my_cxt_size; i++) {
5946 PL_my_cxt_keys[i] = 0;
5947 PL_my_cxt_list[i] = 0;
5950 PL_my_cxt_keys[index] = my_cxt_key;
5951 /* newSV() allocates one more than needed */
5952 p = (void*)SvPVX(newSV(size-1));
5953 PL_my_cxt_list[index] = p;
5954 Zero(p, size, char);
5957 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5958 #endif /* PERL_IMPLICIT_CONTEXT */
5962 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5964 Size_t used, length, copy;
5967 length = strlen(src);
5968 if (size > 0 && used < size - 1) {
5969 copy = (length >= size - used) ? size - used - 1 : length;
5970 memcpy(dst + used, src, copy);
5971 dst[used + copy] = '\0';
5973 return used + length;
5979 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5981 Size_t length, copy;
5983 length = strlen(src);
5985 copy = (length >= size) ? size - 1 : length;
5986 memcpy(dst, src, copy);
5993 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5994 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5995 long _ftol( double ); /* Defined by VC6 C libs. */
5996 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
6000 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
6003 SV * const dbsv = GvSVn(PL_DBsub);
6004 /* We do not care about using sv to call CV;
6005 * it's for informational purposes only.
6008 PERL_ARGS_ASSERT_GET_DB_SUB;
6011 if (!PERLDB_SUB_NN) {
6012 GV * const gv = CvGV(cv);
6014 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6015 || strEQ(GvNAME(gv), "END")
6016 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6017 !( (SvTYPE(*svp) == SVt_PVGV)
6018 && (GvCV((const GV *)*svp) == cv) )))) {
6019 /* Use GV from the stack as a fallback. */
6020 /* GV is potentially non-unique, or contain different CV. */
6021 SV * const tmp = newRV(MUTABLE_SV(cv));
6022 sv_setsv(dbsv, tmp);
6026 gv_efullname3(dbsv, gv, NULL);
6030 const int type = SvTYPE(dbsv);
6031 if (type < SVt_PVIV && type != SVt_IV)
6032 sv_upgrade(dbsv, SVt_PVIV);
6033 (void)SvIOK_on(dbsv);
6034 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6039 Perl_my_dirfd(pTHX_ DIR * dir) {
6041 /* Most dirfd implementations have problems when passed NULL. */
6046 #elif defined(HAS_DIR_DD_FD)
6049 Perl_die(aTHX_ PL_no_func, "dirfd");
6056 Perl_get_re_arg(pTHX_ SV *sv) {
6063 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6064 SvTYPE(tmpsv) == SVt_REGEXP)
6066 return (REGEXP*) tmpsv;
6075 * c-indentation-style: bsd
6077 * indent-tabs-mode: t
6080 * ex: set ts=8 sts=4 sw=4 noet: