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 if (PL_curcop->cop_warnings == pWARN_ALL)
1608 if (PL_curcop->cop_warnings == pWARN_NONE)
1611 /* Right, dealt with all the special cases, which are implemented as non-
1612 pointers, so there is a pointer to a real warnings mask. */
1613 return isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1614 || (unpackWARN2(w) &&
1615 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1616 || (unpackWARN3(w) &&
1617 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1618 || (unpackWARN4(w) &&
1619 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)));
1622 /* implements the ckWARN?_d macro */
1625 Perl_ckwarn_d(pTHX_ U32 w)
1628 /* If lexical warnings have not been set then default classes warn. */
1632 if (PL_curcop->cop_warnings == pWARN_ALL)
1635 if (PL_curcop->cop_warnings == pWARN_NONE)
1638 return isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1639 || (unpackWARN2(w) &&
1640 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1641 || (unpackWARN3(w) &&
1642 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1643 || (unpackWARN4(w) &&
1644 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)));
1647 /* Set buffer=NULL to get a new one. */
1649 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1651 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1652 PERL_UNUSED_CONTEXT;
1653 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1656 (specialWARN(buffer) ?
1657 PerlMemShared_malloc(len_wanted) :
1658 PerlMemShared_realloc(buffer, len_wanted));
1660 Copy(bits, (buffer + 1), size, char);
1664 /* since we've already done strlen() for both nam and val
1665 * we can use that info to make things faster than
1666 * sprintf(s, "%s=%s", nam, val)
1668 #define my_setenv_format(s, nam, nlen, val, vlen) \
1669 Copy(nam, s, nlen, char); \
1671 Copy(val, s+(nlen+1), vlen, char); \
1672 *(s+(nlen+1+vlen)) = '\0'
1674 #ifdef USE_ENVIRON_ARRAY
1675 /* VMS' my_setenv() is in vms.c */
1676 #if !defined(WIN32) && !defined(NETWARE)
1678 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1682 /* only parent thread can modify process environment */
1683 if (PL_curinterp == aTHX)
1686 #ifndef PERL_USE_SAFE_PUTENV
1687 if (!PL_use_safe_putenv) {
1688 /* most putenv()s leak, so we manipulate environ directly */
1690 register const I32 len = strlen(nam);
1693 /* where does it go? */
1694 for (i = 0; environ[i]; i++) {
1695 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1699 if (environ == PL_origenviron) { /* need we copy environment? */
1705 while (environ[max])
1707 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1708 for (j=0; j<max; j++) { /* copy environment */
1709 const int len = strlen(environ[j]);
1710 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1711 Copy(environ[j], tmpenv[j], len+1, char);
1714 environ = tmpenv; /* tell exec where it is now */
1717 safesysfree(environ[i]);
1718 while (environ[i]) {
1719 environ[i] = environ[i+1];
1724 if (!environ[i]) { /* does not exist yet */
1725 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1726 environ[i+1] = NULL; /* make sure it's null terminated */
1729 safesysfree(environ[i]);
1733 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1734 /* all that work just for this */
1735 my_setenv_format(environ[i], nam, nlen, val, vlen);
1738 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1739 # if defined(HAS_UNSETENV)
1741 (void)unsetenv(nam);
1743 (void)setenv(nam, val, 1);
1745 # else /* ! HAS_UNSETENV */
1746 (void)setenv(nam, val, 1);
1747 # endif /* HAS_UNSETENV */
1749 # if defined(HAS_UNSETENV)
1751 (void)unsetenv(nam);
1753 const int nlen = strlen(nam);
1754 const int vlen = strlen(val);
1755 char * const new_env =
1756 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1757 my_setenv_format(new_env, nam, nlen, val, vlen);
1758 (void)putenv(new_env);
1760 # else /* ! HAS_UNSETENV */
1762 const int nlen = strlen(nam);
1768 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1769 /* all that work just for this */
1770 my_setenv_format(new_env, nam, nlen, val, vlen);
1771 (void)putenv(new_env);
1772 # endif /* HAS_UNSETENV */
1773 # endif /* __CYGWIN__ */
1774 #ifndef PERL_USE_SAFE_PUTENV
1780 #else /* WIN32 || NETWARE */
1783 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1786 register char *envstr;
1787 const int nlen = strlen(nam);
1794 Newx(envstr, nlen+vlen+2, char);
1795 my_setenv_format(envstr, nam, nlen, val, vlen);
1796 (void)PerlEnv_putenv(envstr);
1800 #endif /* WIN32 || NETWARE */
1802 #endif /* !VMS && !EPOC*/
1804 #ifdef UNLINK_ALL_VERSIONS
1806 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1810 PERL_ARGS_ASSERT_UNLNK;
1812 while (PerlLIO_unlink(f) >= 0)
1814 return retries ? 0 : -1;
1818 /* this is a drop-in replacement for bcopy() */
1819 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1821 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1823 char * const retval = to;
1825 PERL_ARGS_ASSERT_MY_BCOPY;
1827 if (from - to >= 0) {
1835 *(--to) = *(--from);
1841 /* this is a drop-in replacement for memset() */
1844 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1846 char * const retval = loc;
1848 PERL_ARGS_ASSERT_MY_MEMSET;
1856 /* this is a drop-in replacement for bzero() */
1857 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1859 Perl_my_bzero(register char *loc, register I32 len)
1861 char * const retval = loc;
1863 PERL_ARGS_ASSERT_MY_BZERO;
1871 /* this is a drop-in replacement for memcmp() */
1872 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1874 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1876 register const U8 *a = (const U8 *)s1;
1877 register const U8 *b = (const U8 *)s2;
1880 PERL_ARGS_ASSERT_MY_MEMCMP;
1883 if ((tmp = *a++ - *b++))
1888 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1891 /* This vsprintf replacement should generally never get used, since
1892 vsprintf was available in both System V and BSD 2.11. (There may
1893 be some cross-compilation or embedded set-ups where it is needed,
1896 If you encounter a problem in this function, it's probably a symptom
1897 that Configure failed to detect your system's vprintf() function.
1898 See the section on "item vsprintf" in the INSTALL file.
1900 This version may compile on systems with BSD-ish <stdio.h>,
1901 but probably won't on others.
1904 #ifdef USE_CHAR_VSPRINTF
1909 vsprintf(char *dest, const char *pat, void *args)
1913 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1914 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1915 FILE_cnt(&fakebuf) = 32767;
1917 /* These probably won't compile -- If you really need
1918 this, you'll have to figure out some other method. */
1919 fakebuf._ptr = dest;
1920 fakebuf._cnt = 32767;
1925 fakebuf._flag = _IOWRT|_IOSTRG;
1926 _doprnt(pat, args, &fakebuf); /* what a kludge */
1927 #if defined(STDIO_PTR_LVALUE)
1928 *(FILE_ptr(&fakebuf)++) = '\0';
1930 /* PerlIO has probably #defined away fputc, but we want it here. */
1932 # undef fputc /* XXX Should really restore it later */
1934 (void)fputc('\0', &fakebuf);
1936 #ifdef USE_CHAR_VSPRINTF
1939 return 0; /* perl doesn't use return value */
1943 #endif /* HAS_VPRINTF */
1946 #if BYTEORDER != 0x4321
1948 Perl_my_swap(pTHX_ short s)
1950 #if (BYTEORDER & 1) == 0
1953 result = ((s & 255) << 8) + ((s >> 8) & 255);
1961 Perl_my_htonl(pTHX_ long l)
1965 char c[sizeof(long)];
1968 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1969 #if BYTEORDER == 0x12345678
1972 u.c[0] = (l >> 24) & 255;
1973 u.c[1] = (l >> 16) & 255;
1974 u.c[2] = (l >> 8) & 255;
1978 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1979 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1984 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1985 u.c[o & 0xf] = (l >> s) & 255;
1993 Perl_my_ntohl(pTHX_ long l)
1997 char c[sizeof(long)];
2000 #if BYTEORDER == 0x1234
2001 u.c[0] = (l >> 24) & 255;
2002 u.c[1] = (l >> 16) & 255;
2003 u.c[2] = (l >> 8) & 255;
2007 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2008 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2015 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2016 l |= (u.c[o & 0xf] & 255) << s;
2023 #endif /* BYTEORDER != 0x4321 */
2027 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2028 * If these functions are defined,
2029 * the BYTEORDER is neither 0x1234 nor 0x4321.
2030 * However, this is not assumed.
2034 #define HTOLE(name,type) \
2036 name (register type n) \
2040 char c[sizeof(type)]; \
2043 register U32 s = 0; \
2044 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2045 u.c[i] = (n >> s) & 0xFF; \
2050 #define LETOH(name,type) \
2052 name (register type n) \
2056 char c[sizeof(type)]; \
2059 register U32 s = 0; \
2062 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2063 n |= ((type)(u.c[i] & 0xFF)) << s; \
2069 * Big-endian byte order functions.
2072 #define HTOBE(name,type) \
2074 name (register type n) \
2078 char c[sizeof(type)]; \
2081 register U32 s = 8*(sizeof(u.c)-1); \
2082 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2083 u.c[i] = (n >> s) & 0xFF; \
2088 #define BETOH(name,type) \
2090 name (register type n) \
2094 char c[sizeof(type)]; \
2097 register U32 s = 8*(sizeof(u.c)-1); \
2100 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2101 n |= ((type)(u.c[i] & 0xFF)) << s; \
2107 * If we just can't do it...
2110 #define NOT_AVAIL(name,type) \
2112 name (register type n) \
2114 Perl_croak_nocontext(#name "() not available"); \
2115 return n; /* not reached */ \
2119 #if defined(HAS_HTOVS) && !defined(htovs)
2122 #if defined(HAS_HTOVL) && !defined(htovl)
2125 #if defined(HAS_VTOHS) && !defined(vtohs)
2128 #if defined(HAS_VTOHL) && !defined(vtohl)
2132 #ifdef PERL_NEED_MY_HTOLE16
2134 HTOLE(Perl_my_htole16,U16)
2136 NOT_AVAIL(Perl_my_htole16,U16)
2139 #ifdef PERL_NEED_MY_LETOH16
2141 LETOH(Perl_my_letoh16,U16)
2143 NOT_AVAIL(Perl_my_letoh16,U16)
2146 #ifdef PERL_NEED_MY_HTOBE16
2148 HTOBE(Perl_my_htobe16,U16)
2150 NOT_AVAIL(Perl_my_htobe16,U16)
2153 #ifdef PERL_NEED_MY_BETOH16
2155 BETOH(Perl_my_betoh16,U16)
2157 NOT_AVAIL(Perl_my_betoh16,U16)
2161 #ifdef PERL_NEED_MY_HTOLE32
2163 HTOLE(Perl_my_htole32,U32)
2165 NOT_AVAIL(Perl_my_htole32,U32)
2168 #ifdef PERL_NEED_MY_LETOH32
2170 LETOH(Perl_my_letoh32,U32)
2172 NOT_AVAIL(Perl_my_letoh32,U32)
2175 #ifdef PERL_NEED_MY_HTOBE32
2177 HTOBE(Perl_my_htobe32,U32)
2179 NOT_AVAIL(Perl_my_htobe32,U32)
2182 #ifdef PERL_NEED_MY_BETOH32
2184 BETOH(Perl_my_betoh32,U32)
2186 NOT_AVAIL(Perl_my_betoh32,U32)
2190 #ifdef PERL_NEED_MY_HTOLE64
2192 HTOLE(Perl_my_htole64,U64)
2194 NOT_AVAIL(Perl_my_htole64,U64)
2197 #ifdef PERL_NEED_MY_LETOH64
2199 LETOH(Perl_my_letoh64,U64)
2201 NOT_AVAIL(Perl_my_letoh64,U64)
2204 #ifdef PERL_NEED_MY_HTOBE64
2206 HTOBE(Perl_my_htobe64,U64)
2208 NOT_AVAIL(Perl_my_htobe64,U64)
2211 #ifdef PERL_NEED_MY_BETOH64
2213 BETOH(Perl_my_betoh64,U64)
2215 NOT_AVAIL(Perl_my_betoh64,U64)
2219 #ifdef PERL_NEED_MY_HTOLES
2220 HTOLE(Perl_my_htoles,short)
2222 #ifdef PERL_NEED_MY_LETOHS
2223 LETOH(Perl_my_letohs,short)
2225 #ifdef PERL_NEED_MY_HTOBES
2226 HTOBE(Perl_my_htobes,short)
2228 #ifdef PERL_NEED_MY_BETOHS
2229 BETOH(Perl_my_betohs,short)
2232 #ifdef PERL_NEED_MY_HTOLEI
2233 HTOLE(Perl_my_htolei,int)
2235 #ifdef PERL_NEED_MY_LETOHI
2236 LETOH(Perl_my_letohi,int)
2238 #ifdef PERL_NEED_MY_HTOBEI
2239 HTOBE(Perl_my_htobei,int)
2241 #ifdef PERL_NEED_MY_BETOHI
2242 BETOH(Perl_my_betohi,int)
2245 #ifdef PERL_NEED_MY_HTOLEL
2246 HTOLE(Perl_my_htolel,long)
2248 #ifdef PERL_NEED_MY_LETOHL
2249 LETOH(Perl_my_letohl,long)
2251 #ifdef PERL_NEED_MY_HTOBEL
2252 HTOBE(Perl_my_htobel,long)
2254 #ifdef PERL_NEED_MY_BETOHL
2255 BETOH(Perl_my_betohl,long)
2259 Perl_my_swabn(void *ptr, int n)
2261 register char *s = (char *)ptr;
2262 register char *e = s + (n-1);
2265 PERL_ARGS_ASSERT_MY_SWABN;
2267 for (n /= 2; n > 0; s++, e--, n--) {
2275 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2277 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2280 register I32 This, that;
2286 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2288 PERL_FLUSHALL_FOR_CHILD;
2289 This = (*mode == 'w');
2293 taint_proper("Insecure %s%s", "EXEC");
2295 if (PerlProc_pipe(p) < 0)
2297 /* Try for another pipe pair for error return */
2298 if (PerlProc_pipe(pp) >= 0)
2300 while ((pid = PerlProc_fork()) < 0) {
2301 if (errno != EAGAIN) {
2302 PerlLIO_close(p[This]);
2303 PerlLIO_close(p[that]);
2305 PerlLIO_close(pp[0]);
2306 PerlLIO_close(pp[1]);
2310 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2319 /* Close parent's end of error status pipe (if any) */
2321 PerlLIO_close(pp[0]);
2322 #if defined(HAS_FCNTL) && defined(F_SETFD)
2323 /* Close error pipe automatically if exec works */
2324 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2327 /* Now dup our end of _the_ pipe to right position */
2328 if (p[THIS] != (*mode == 'r')) {
2329 PerlLIO_dup2(p[THIS], *mode == 'r');
2330 PerlLIO_close(p[THIS]);
2331 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2332 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2335 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2336 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2337 /* No automatic close - do it by hand */
2344 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2350 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2356 do_execfree(); /* free any memory malloced by child on fork */
2358 PerlLIO_close(pp[1]);
2359 /* Keep the lower of the two fd numbers */
2360 if (p[that] < p[This]) {
2361 PerlLIO_dup2(p[This], p[that]);
2362 PerlLIO_close(p[This]);
2366 PerlLIO_close(p[that]); /* close child's end of pipe */
2368 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2369 SvUPGRADE(sv,SVt_IV);
2371 PL_forkprocess = pid;
2372 /* If we managed to get status pipe check for exec fail */
2373 if (did_pipes && pid > 0) {
2378 while (n < sizeof(int)) {
2379 n1 = PerlLIO_read(pp[0],
2380 (void*)(((char*)&errkid)+n),
2386 PerlLIO_close(pp[0]);
2388 if (n) { /* Error */
2390 PerlLIO_close(p[This]);
2391 if (n != sizeof(int))
2392 Perl_croak(aTHX_ "panic: kid popen errno read");
2394 pid2 = wait4pid(pid, &status, 0);
2395 } while (pid2 == -1 && errno == EINTR);
2396 errno = errkid; /* Propagate errno from kid */
2401 PerlLIO_close(pp[0]);
2402 return PerlIO_fdopen(p[This], mode);
2404 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2405 return my_syspopen4(aTHX_ NULL, mode, n, args);
2407 Perl_croak(aTHX_ "List form of piped open not implemented");
2408 return (PerlIO *) NULL;
2413 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2414 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2416 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2420 register I32 This, that;
2423 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2427 PERL_ARGS_ASSERT_MY_POPEN;
2429 PERL_FLUSHALL_FOR_CHILD;
2432 return my_syspopen(aTHX_ cmd,mode);
2435 This = (*mode == 'w');
2437 if (doexec && PL_tainting) {
2439 taint_proper("Insecure %s%s", "EXEC");
2441 if (PerlProc_pipe(p) < 0)
2443 if (doexec && PerlProc_pipe(pp) >= 0)
2445 while ((pid = PerlProc_fork()) < 0) {
2446 if (errno != EAGAIN) {
2447 PerlLIO_close(p[This]);
2448 PerlLIO_close(p[that]);
2450 PerlLIO_close(pp[0]);
2451 PerlLIO_close(pp[1]);
2454 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2457 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2468 PerlLIO_close(pp[0]);
2469 #if defined(HAS_FCNTL) && defined(F_SETFD)
2470 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2473 if (p[THIS] != (*mode == 'r')) {
2474 PerlLIO_dup2(p[THIS], *mode == 'r');
2475 PerlLIO_close(p[THIS]);
2476 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2477 PerlLIO_close(p[THAT]);
2480 PerlLIO_close(p[THAT]);
2483 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2490 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2495 /* may or may not use the shell */
2496 do_exec3(cmd, pp[1], did_pipes);
2499 #endif /* defined OS2 */
2501 #ifdef PERLIO_USING_CRLF
2502 /* Since we circumvent IO layers when we manipulate low-level
2503 filedescriptors directly, need to manually switch to the
2504 default, binary, low-level mode; see PerlIOBuf_open(). */
2505 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2508 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2509 SvREADONLY_off(GvSV(tmpgv));
2510 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2511 SvREADONLY_on(GvSV(tmpgv));
2513 #ifdef THREADS_HAVE_PIDS
2514 PL_ppid = (IV)getppid();
2517 #ifdef PERL_USES_PL_PIDSTATUS
2518 hv_clear(PL_pidstatus); /* we have no children */
2524 do_execfree(); /* free any memory malloced by child on vfork */
2526 PerlLIO_close(pp[1]);
2527 if (p[that] < p[This]) {
2528 PerlLIO_dup2(p[This], p[that]);
2529 PerlLIO_close(p[This]);
2533 PerlLIO_close(p[that]);
2535 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2536 SvUPGRADE(sv,SVt_IV);
2538 PL_forkprocess = pid;
2539 if (did_pipes && pid > 0) {
2544 while (n < sizeof(int)) {
2545 n1 = PerlLIO_read(pp[0],
2546 (void*)(((char*)&errkid)+n),
2552 PerlLIO_close(pp[0]);
2554 if (n) { /* Error */
2556 PerlLIO_close(p[This]);
2557 if (n != sizeof(int))
2558 Perl_croak(aTHX_ "panic: kid popen errno read");
2560 pid2 = wait4pid(pid, &status, 0);
2561 } while (pid2 == -1 && errno == EINTR);
2562 errno = errkid; /* Propagate errno from kid */
2567 PerlLIO_close(pp[0]);
2568 return PerlIO_fdopen(p[This], mode);
2571 #if defined(atarist) || defined(EPOC)
2574 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2576 PERL_ARGS_ASSERT_MY_POPEN;
2577 PERL_FLUSHALL_FOR_CHILD;
2578 /* Call system's popen() to get a FILE *, then import it.
2579 used 0 for 2nd parameter to PerlIO_importFILE;
2582 return PerlIO_importFILE(popen(cmd, mode), 0);
2586 FILE *djgpp_popen();
2588 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2590 PERL_FLUSHALL_FOR_CHILD;
2591 /* Call system's popen() to get a FILE *, then import it.
2592 used 0 for 2nd parameter to PerlIO_importFILE;
2595 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2598 #if defined(__LIBCATAMOUNT__)
2600 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2608 #endif /* !DOSISH */
2610 /* this is called in parent before the fork() */
2612 Perl_atfork_lock(void)
2615 #if defined(USE_ITHREADS)
2616 /* locks must be held in locking order (if any) */
2618 MUTEX_LOCK(&PL_malloc_mutex);
2624 /* this is called in both parent and child after the fork() */
2626 Perl_atfork_unlock(void)
2629 #if defined(USE_ITHREADS)
2630 /* locks must be released in same order as in atfork_lock() */
2632 MUTEX_UNLOCK(&PL_malloc_mutex);
2641 #if defined(HAS_FORK)
2643 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2648 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2649 * handlers elsewhere in the code */
2654 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2655 Perl_croak_nocontext("fork() not available");
2657 #endif /* HAS_FORK */
2662 Perl_dump_fds(pTHX_ const char *const s)
2667 PERL_ARGS_ASSERT_DUMP_FDS;
2669 PerlIO_printf(Perl_debug_log,"%s", s);
2670 for (fd = 0; fd < 32; fd++) {
2671 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2672 PerlIO_printf(Perl_debug_log," %d",fd);
2674 PerlIO_printf(Perl_debug_log,"\n");
2677 #endif /* DUMP_FDS */
2681 dup2(int oldfd, int newfd)
2683 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2686 PerlLIO_close(newfd);
2687 return fcntl(oldfd, F_DUPFD, newfd);
2689 #define DUP2_MAX_FDS 256
2690 int fdtmp[DUP2_MAX_FDS];
2696 PerlLIO_close(newfd);
2697 /* good enough for low fd's... */
2698 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2699 if (fdx >= DUP2_MAX_FDS) {
2707 PerlLIO_close(fdtmp[--fdx]);
2714 #ifdef HAS_SIGACTION
2717 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2720 struct sigaction act, oact;
2723 /* only "parent" interpreter can diddle signals */
2724 if (PL_curinterp != aTHX)
2725 return (Sighandler_t) SIG_ERR;
2728 act.sa_handler = (void(*)(int))handler;
2729 sigemptyset(&act.sa_mask);
2732 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2733 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2735 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2736 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2737 act.sa_flags |= SA_NOCLDWAIT;
2739 if (sigaction(signo, &act, &oact) == -1)
2740 return (Sighandler_t) SIG_ERR;
2742 return (Sighandler_t) oact.sa_handler;
2746 Perl_rsignal_state(pTHX_ int signo)
2748 struct sigaction oact;
2749 PERL_UNUSED_CONTEXT;
2751 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2752 return (Sighandler_t) SIG_ERR;
2754 return (Sighandler_t) oact.sa_handler;
2758 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2761 struct sigaction act;
2763 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2766 /* only "parent" interpreter can diddle signals */
2767 if (PL_curinterp != aTHX)
2771 act.sa_handler = (void(*)(int))handler;
2772 sigemptyset(&act.sa_mask);
2775 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2776 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2778 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2779 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2780 act.sa_flags |= SA_NOCLDWAIT;
2782 return sigaction(signo, &act, save);
2786 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2790 /* only "parent" interpreter can diddle signals */
2791 if (PL_curinterp != aTHX)
2795 return sigaction(signo, save, (struct sigaction *)NULL);
2798 #else /* !HAS_SIGACTION */
2801 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2803 #if defined(USE_ITHREADS) && !defined(WIN32)
2804 /* only "parent" interpreter can diddle signals */
2805 if (PL_curinterp != aTHX)
2806 return (Sighandler_t) SIG_ERR;
2809 return PerlProc_signal(signo, handler);
2820 Perl_rsignal_state(pTHX_ int signo)
2823 Sighandler_t oldsig;
2825 #if defined(USE_ITHREADS) && !defined(WIN32)
2826 /* only "parent" interpreter can diddle signals */
2827 if (PL_curinterp != aTHX)
2828 return (Sighandler_t) SIG_ERR;
2832 oldsig = PerlProc_signal(signo, sig_trap);
2833 PerlProc_signal(signo, oldsig);
2835 PerlProc_kill(PerlProc_getpid(), signo);
2840 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2842 #if defined(USE_ITHREADS) && !defined(WIN32)
2843 /* only "parent" interpreter can diddle signals */
2844 if (PL_curinterp != aTHX)
2847 *save = PerlProc_signal(signo, handler);
2848 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2852 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2854 #if defined(USE_ITHREADS) && !defined(WIN32)
2855 /* only "parent" interpreter can diddle signals */
2856 if (PL_curinterp != aTHX)
2859 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2862 #endif /* !HAS_SIGACTION */
2863 #endif /* !PERL_MICRO */
2865 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2866 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2868 Perl_my_pclose(pTHX_ PerlIO *ptr)
2871 Sigsave_t hstat, istat, qstat;
2879 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2880 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2882 *svp = &PL_sv_undef;
2884 if (pid == -1) { /* Opened by popen. */
2885 return my_syspclose(ptr);
2888 close_failed = (PerlIO_close(ptr) == EOF);
2891 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2894 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2895 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2896 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2899 pid2 = wait4pid(pid, &status, 0);
2900 } while (pid2 == -1 && errno == EINTR);
2902 rsignal_restore(SIGHUP, &hstat);
2903 rsignal_restore(SIGINT, &istat);
2904 rsignal_restore(SIGQUIT, &qstat);
2910 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2913 #if defined(__LIBCATAMOUNT__)
2915 Perl_my_pclose(pTHX_ PerlIO *ptr)
2920 #endif /* !DOSISH */
2922 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2924 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2928 PERL_ARGS_ASSERT_WAIT4PID;
2931 #ifdef PERL_USES_PL_PIDSTATUS
2934 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2935 pid, rather than a string form. */
2936 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2937 if (svp && *svp != &PL_sv_undef) {
2938 *statusp = SvIVX(*svp);
2939 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2947 hv_iterinit(PL_pidstatus);
2948 if ((entry = hv_iternext(PL_pidstatus))) {
2949 SV * const sv = hv_iterval(PL_pidstatus,entry);
2951 const char * const spid = hv_iterkey(entry,&len);
2953 assert (len == sizeof(Pid_t));
2954 memcpy((char *)&pid, spid, len);
2955 *statusp = SvIVX(sv);
2956 /* The hash iterator is currently on this entry, so simply
2957 calling hv_delete would trigger the lazy delete, which on
2958 aggregate does more work, beacuse next call to hv_iterinit()
2959 would spot the flag, and have to call the delete routine,
2960 while in the meantime any new entries can't re-use that
2962 hv_iterinit(PL_pidstatus);
2963 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2970 # ifdef HAS_WAITPID_RUNTIME
2971 if (!HAS_WAITPID_RUNTIME)
2974 result = PerlProc_waitpid(pid,statusp,flags);
2977 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2978 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2981 #ifdef PERL_USES_PL_PIDSTATUS
2982 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2987 Perl_croak(aTHX_ "Can't do waitpid with flags");
2989 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2990 pidgone(result,*statusp);
2996 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2999 if (result < 0 && errno == EINTR) {
3001 errno = EINTR; /* reset in case a signal handler changed $! */
3005 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3007 #ifdef PERL_USES_PL_PIDSTATUS
3009 S_pidgone(pTHX_ Pid_t pid, int status)
3013 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3014 SvUPGRADE(sv,SVt_IV);
3015 SvIV_set(sv, status);
3020 #if defined(atarist) || defined(OS2) || defined(EPOC)
3023 int /* Cannot prototype with I32
3025 my_syspclose(PerlIO *ptr)
3028 Perl_my_pclose(pTHX_ PerlIO *ptr)
3031 /* Needs work for PerlIO ! */
3032 FILE * const f = PerlIO_findFILE(ptr);
3033 const I32 result = pclose(f);
3034 PerlIO_releaseFILE(ptr,f);
3042 Perl_my_pclose(pTHX_ PerlIO *ptr)
3044 /* Needs work for PerlIO ! */
3045 FILE * const f = PerlIO_findFILE(ptr);
3046 I32 result = djgpp_pclose(f);
3047 result = (result << 8) & 0xff00;
3048 PerlIO_releaseFILE(ptr,f);
3053 #define PERL_REPEATCPY_LINEAR 4
3055 Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
3057 PERL_ARGS_ASSERT_REPEATCPY;
3060 memset(to, *from, count);
3062 register char *p = to;
3063 I32 items, linear, half;
3065 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3066 for (items = 0; items < linear; ++items) {
3067 register const char *q = from;
3069 for (todo = len; todo > 0; todo--)
3074 while (items <= half) {
3075 I32 size = items * len;
3076 memcpy(p, to, size);
3082 memcpy(p, to, (count - items) * len);
3088 Perl_same_dirent(pTHX_ const char *a, const char *b)
3090 char *fa = strrchr(a,'/');
3091 char *fb = strrchr(b,'/');
3094 SV * const tmpsv = sv_newmortal();
3096 PERL_ARGS_ASSERT_SAME_DIRENT;
3109 sv_setpvs(tmpsv, ".");
3111 sv_setpvn(tmpsv, a, fa - a);
3112 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3115 sv_setpvs(tmpsv, ".");
3117 sv_setpvn(tmpsv, b, fb - b);
3118 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3120 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3121 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3123 #endif /* !HAS_RENAME */
3126 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3127 const char *const *const search_ext, I32 flags)
3130 const char *xfound = NULL;
3131 char *xfailed = NULL;
3132 char tmpbuf[MAXPATHLEN];
3137 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3138 # define SEARCH_EXTS ".bat", ".cmd", NULL
3139 # define MAX_EXT_LEN 4
3142 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3143 # define MAX_EXT_LEN 4
3146 # define SEARCH_EXTS ".pl", ".com", NULL
3147 # define MAX_EXT_LEN 4
3149 /* additional extensions to try in each dir if scriptname not found */
3151 static const char *const exts[] = { SEARCH_EXTS };
3152 const char *const *const ext = search_ext ? search_ext : exts;
3153 int extidx = 0, i = 0;
3154 const char *curext = NULL;
3156 PERL_UNUSED_ARG(search_ext);
3157 # define MAX_EXT_LEN 0
3160 PERL_ARGS_ASSERT_FIND_SCRIPT;
3163 * If dosearch is true and if scriptname does not contain path
3164 * delimiters, search the PATH for scriptname.
3166 * If SEARCH_EXTS is also defined, will look for each
3167 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3168 * while searching the PATH.
3170 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3171 * proceeds as follows:
3172 * If DOSISH or VMSISH:
3173 * + look for ./scriptname{,.foo,.bar}
3174 * + search the PATH for scriptname{,.foo,.bar}
3177 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3178 * this will not look in '.' if it's not in the PATH)
3183 # ifdef ALWAYS_DEFTYPES
3184 len = strlen(scriptname);
3185 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3186 int idx = 0, deftypes = 1;
3189 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3192 int idx = 0, deftypes = 1;
3195 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3197 /* The first time through, just add SEARCH_EXTS to whatever we
3198 * already have, so we can check for default file types. */
3200 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3206 if ((strlen(tmpbuf) + strlen(scriptname)
3207 + MAX_EXT_LEN) >= sizeof tmpbuf)
3208 continue; /* don't search dir with too-long name */
3209 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3213 if (strEQ(scriptname, "-"))
3215 if (dosearch) { /* Look in '.' first. */
3216 const char *cur = scriptname;
3218 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3220 if (strEQ(ext[i++],curext)) {
3221 extidx = -1; /* already has an ext */
3226 DEBUG_p(PerlIO_printf(Perl_debug_log,
3227 "Looking for %s\n",cur));
3228 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3229 && !S_ISDIR(PL_statbuf.st_mode)) {
3237 if (cur == scriptname) {
3238 len = strlen(scriptname);
3239 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3241 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3244 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3245 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3250 if (dosearch && !strchr(scriptname, '/')
3252 && !strchr(scriptname, '\\')
3254 && (s = PerlEnv_getenv("PATH")))
3258 bufend = s + strlen(s);
3259 while (s < bufend) {
3260 #if defined(atarist) || defined(DOSISH)
3265 && *s != ';'; len++, s++) {
3266 if (len < sizeof tmpbuf)
3269 if (len < sizeof tmpbuf)
3271 #else /* ! (atarist || DOSISH) */
3272 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3275 #endif /* ! (atarist || DOSISH) */
3278 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3279 continue; /* don't search dir with too-long name */
3281 # if defined(atarist) || defined(DOSISH)
3282 && tmpbuf[len - 1] != '/'
3283 && tmpbuf[len - 1] != '\\'
3286 tmpbuf[len++] = '/';
3287 if (len == 2 && tmpbuf[0] == '.')
3289 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3293 len = strlen(tmpbuf);
3294 if (extidx > 0) /* reset after previous loop */
3298 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3299 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3300 if (S_ISDIR(PL_statbuf.st_mode)) {
3304 } while ( retval < 0 /* not there */
3305 && extidx>=0 && ext[extidx] /* try an extension? */
3306 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3311 if (S_ISREG(PL_statbuf.st_mode)
3312 && cando(S_IRUSR,TRUE,&PL_statbuf)
3313 #if !defined(DOSISH)
3314 && cando(S_IXUSR,TRUE,&PL_statbuf)
3318 xfound = tmpbuf; /* bingo! */
3322 xfailed = savepv(tmpbuf);
3325 if (!xfound && !seen_dot && !xfailed &&
3326 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3327 || S_ISDIR(PL_statbuf.st_mode)))
3329 seen_dot = 1; /* Disable message. */
3331 if (flags & 1) { /* do or die? */
3332 Perl_croak(aTHX_ "Can't %s %s%s%s",
3333 (xfailed ? "execute" : "find"),
3334 (xfailed ? xfailed : scriptname),
3335 (xfailed ? "" : " on PATH"),
3336 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3341 scriptname = xfound;
3343 return (scriptname ? savepv(scriptname) : NULL);
3346 #ifndef PERL_GET_CONTEXT_DEFINED
3349 Perl_get_context(void)
3352 #if defined(USE_ITHREADS)
3353 # ifdef OLD_PTHREADS_API
3355 if (pthread_getspecific(PL_thr_key, &t))
3356 Perl_croak_nocontext("panic: pthread_getspecific");
3359 # ifdef I_MACH_CTHREADS
3360 return (void*)cthread_data(cthread_self());
3362 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3371 Perl_set_context(void *t)
3374 PERL_ARGS_ASSERT_SET_CONTEXT;
3375 #if defined(USE_ITHREADS)
3376 # ifdef I_MACH_CTHREADS
3377 cthread_set_data(cthread_self(), t);
3379 if (pthread_setspecific(PL_thr_key, t))
3380 Perl_croak_nocontext("panic: pthread_setspecific");
3387 #endif /* !PERL_GET_CONTEXT_DEFINED */
3389 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3398 Perl_get_op_names(pTHX)
3400 PERL_UNUSED_CONTEXT;
3401 return (char **)PL_op_name;
3405 Perl_get_op_descs(pTHX)
3407 PERL_UNUSED_CONTEXT;
3408 return (char **)PL_op_desc;
3412 Perl_get_no_modify(pTHX)
3414 PERL_UNUSED_CONTEXT;
3415 return PL_no_modify;
3419 Perl_get_opargs(pTHX)
3421 PERL_UNUSED_CONTEXT;
3422 return (U32 *)PL_opargs;
3426 Perl_get_ppaddr(pTHX)
3429 PERL_UNUSED_CONTEXT;
3430 return (PPADDR_t*)PL_ppaddr;
3433 #ifndef HAS_GETENV_LEN
3435 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3437 char * const env_trans = PerlEnv_getenv(env_elem);
3438 PERL_UNUSED_CONTEXT;
3439 PERL_ARGS_ASSERT_GETENV_LEN;
3441 *len = strlen(env_trans);
3448 Perl_get_vtbl(pTHX_ int vtbl_id)
3450 const MGVTBL* result;
3451 PERL_UNUSED_CONTEXT;
3455 result = &PL_vtbl_sv;
3458 result = &PL_vtbl_env;
3460 case want_vtbl_envelem:
3461 result = &PL_vtbl_envelem;
3464 result = &PL_vtbl_sig;
3466 case want_vtbl_sigelem:
3467 result = &PL_vtbl_sigelem;
3469 case want_vtbl_pack:
3470 result = &PL_vtbl_pack;
3472 case want_vtbl_packelem:
3473 result = &PL_vtbl_packelem;
3475 case want_vtbl_dbline:
3476 result = &PL_vtbl_dbline;
3479 result = &PL_vtbl_isa;
3481 case want_vtbl_isaelem:
3482 result = &PL_vtbl_isaelem;
3484 case want_vtbl_arylen:
3485 result = &PL_vtbl_arylen;
3487 case want_vtbl_mglob:
3488 result = &PL_vtbl_mglob;
3490 case want_vtbl_nkeys:
3491 result = &PL_vtbl_nkeys;
3493 case want_vtbl_taint:
3494 result = &PL_vtbl_taint;
3496 case want_vtbl_substr:
3497 result = &PL_vtbl_substr;
3500 result = &PL_vtbl_vec;
3503 result = &PL_vtbl_pos;
3506 result = &PL_vtbl_bm;
3509 result = &PL_vtbl_fm;
3511 case want_vtbl_uvar:
3512 result = &PL_vtbl_uvar;
3514 case want_vtbl_defelem:
3515 result = &PL_vtbl_defelem;
3517 case want_vtbl_regexp:
3518 result = &PL_vtbl_regexp;
3520 case want_vtbl_regdata:
3521 result = &PL_vtbl_regdata;
3523 case want_vtbl_regdatum:
3524 result = &PL_vtbl_regdatum;
3526 #ifdef USE_LOCALE_COLLATE
3527 case want_vtbl_collxfrm:
3528 result = &PL_vtbl_collxfrm;
3531 case want_vtbl_amagic:
3532 result = &PL_vtbl_amagic;
3534 case want_vtbl_amagicelem:
3535 result = &PL_vtbl_amagicelem;
3537 case want_vtbl_backref:
3538 result = &PL_vtbl_backref;
3540 case want_vtbl_utf8:
3541 result = &PL_vtbl_utf8;
3547 return (MGVTBL*)result;
3551 Perl_my_fflush_all(pTHX)
3553 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3554 return PerlIO_flush(NULL);
3556 # if defined(HAS__FWALK)
3557 extern int fflush(FILE *);
3558 /* undocumented, unprototyped, but very useful BSDism */
3559 extern void _fwalk(int (*)(FILE *));
3563 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3565 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3566 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3568 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3569 open_max = sysconf(_SC_OPEN_MAX);
3572 open_max = FOPEN_MAX;
3575 open_max = OPEN_MAX;
3586 for (i = 0; i < open_max; i++)
3587 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3588 STDIO_STREAM_ARRAY[i]._file < open_max &&
3589 STDIO_STREAM_ARRAY[i]._flag)
3590 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3594 SETERRNO(EBADF,RMS_IFI);
3601 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3603 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3605 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3606 if (ckWARN(WARN_IO)) {
3607 const char * const direction =
3608 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3610 Perl_warner(aTHX_ packWARN(WARN_IO),
3611 "Filehandle %s opened only for %sput",
3614 Perl_warner(aTHX_ packWARN(WARN_IO),
3615 "Filehandle opened only for %sput", direction);
3622 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3624 warn_type = WARN_CLOSED;
3628 warn_type = WARN_UNOPENED;
3631 if (ckWARN(warn_type)) {
3632 const char * const pars =
3633 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3634 const char * const func =
3636 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3637 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3638 op < 0 ? "" : /* handle phoney cases */
3640 const char * const type =
3642 (OP_IS_SOCKET(op) ||
3643 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3644 "socket" : "filehandle");
3645 if (name && *name) {
3646 Perl_warner(aTHX_ packWARN(warn_type),
3647 "%s%s on %s %s %s", func, pars, vile, type, name);
3648 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3650 aTHX_ packWARN(warn_type),
3651 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3656 Perl_warner(aTHX_ packWARN(warn_type),
3657 "%s%s on %s %s", func, pars, vile, type);
3658 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3660 aTHX_ packWARN(warn_type),
3661 "\t(Are you trying to call %s%s on dirhandle?)\n",
3670 /* in ASCII order, not that it matters */
3671 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3674 Perl_ebcdic_control(pTHX_ int ch)
3682 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3683 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3686 if (ctlp == controllablechars)
3687 return('\177'); /* DEL */
3689 return((unsigned char)(ctlp - controllablechars - 1));
3690 } else { /* Want uncontrol */
3691 if (ch == '\177' || ch == -1)
3693 else if (ch == '\157')
3695 else if (ch == '\174')
3697 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3699 else if (ch == '\155')
3701 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3702 return(controllablechars[ch+1]);
3704 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3709 /* To workaround core dumps from the uninitialised tm_zone we get the
3710 * system to give us a reasonable struct to copy. This fix means that
3711 * strftime uses the tm_zone and tm_gmtoff values returned by
3712 * localtime(time()). That should give the desired result most of the
3713 * time. But probably not always!
3715 * This does not address tzname aspects of NETaa14816.
3720 # ifndef STRUCT_TM_HASZONE
3721 # define STRUCT_TM_HASZONE
3725 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3726 # ifndef HAS_TM_TM_ZONE
3727 # define HAS_TM_TM_ZONE
3732 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3734 #ifdef HAS_TM_TM_ZONE
3736 const struct tm* my_tm;
3737 PERL_ARGS_ASSERT_INIT_TM;
3739 my_tm = localtime(&now);
3741 Copy(my_tm, ptm, 1, struct tm);
3743 PERL_ARGS_ASSERT_INIT_TM;
3744 PERL_UNUSED_ARG(ptm);
3749 * mini_mktime - normalise struct tm values without the localtime()
3750 * semantics (and overhead) of mktime().
3753 Perl_mini_mktime(pTHX_ struct tm *ptm)
3757 int month, mday, year, jday;
3758 int odd_cent, odd_year;
3759 PERL_UNUSED_CONTEXT;
3761 PERL_ARGS_ASSERT_MINI_MKTIME;
3763 #define DAYS_PER_YEAR 365
3764 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3765 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3766 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3767 #define SECS_PER_HOUR (60*60)
3768 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3769 /* parentheses deliberately absent on these two, otherwise they don't work */
3770 #define MONTH_TO_DAYS 153/5
3771 #define DAYS_TO_MONTH 5/153
3772 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3773 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3774 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3775 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3778 * Year/day algorithm notes:
3780 * With a suitable offset for numeric value of the month, one can find
3781 * an offset into the year by considering months to have 30.6 (153/5) days,
3782 * using integer arithmetic (i.e., with truncation). To avoid too much
3783 * messing about with leap days, we consider January and February to be
3784 * the 13th and 14th month of the previous year. After that transformation,
3785 * we need the month index we use to be high by 1 from 'normal human' usage,
3786 * so the month index values we use run from 4 through 15.
3788 * Given that, and the rules for the Gregorian calendar (leap years are those
3789 * divisible by 4 unless also divisible by 100, when they must be divisible
3790 * by 400 instead), we can simply calculate the number of days since some
3791 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3792 * the days we derive from our month index, and adding in the day of the
3793 * month. The value used here is not adjusted for the actual origin which
3794 * it normally would use (1 January A.D. 1), since we're not exposing it.
3795 * We're only building the value so we can turn around and get the
3796 * normalised values for the year, month, day-of-month, and day-of-year.
3798 * For going backward, we need to bias the value we're using so that we find
3799 * the right year value. (Basically, we don't want the contribution of
3800 * March 1st to the number to apply while deriving the year). Having done
3801 * that, we 'count up' the contribution to the year number by accounting for
3802 * full quadracenturies (400-year periods) with their extra leap days, plus
3803 * the contribution from full centuries (to avoid counting in the lost leap
3804 * days), plus the contribution from full quad-years (to count in the normal
3805 * leap days), plus the leftover contribution from any non-leap years.
3806 * At this point, if we were working with an actual leap day, we'll have 0
3807 * days left over. This is also true for March 1st, however. So, we have
3808 * to special-case that result, and (earlier) keep track of the 'odd'
3809 * century and year contributions. If we got 4 extra centuries in a qcent,
3810 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3811 * Otherwise, we add back in the earlier bias we removed (the 123 from
3812 * figuring in March 1st), find the month index (integer division by 30.6),
3813 * and the remainder is the day-of-month. We then have to convert back to
3814 * 'real' months (including fixing January and February from being 14/15 in
3815 * the previous year to being in the proper year). After that, to get
3816 * tm_yday, we work with the normalised year and get a new yearday value for
3817 * January 1st, which we subtract from the yearday value we had earlier,
3818 * representing the date we've re-built. This is done from January 1
3819 * because tm_yday is 0-origin.
3821 * Since POSIX time routines are only guaranteed to work for times since the
3822 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3823 * applies Gregorian calendar rules even to dates before the 16th century
3824 * doesn't bother me. Besides, you'd need cultural context for a given
3825 * date to know whether it was Julian or Gregorian calendar, and that's
3826 * outside the scope for this routine. Since we convert back based on the
3827 * same rules we used to build the yearday, you'll only get strange results
3828 * for input which needed normalising, or for the 'odd' century years which
3829 * were leap years in the Julian calander but not in the Gregorian one.
3830 * I can live with that.
3832 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3833 * that's still outside the scope for POSIX time manipulation, so I don't
3837 year = 1900 + ptm->tm_year;
3838 month = ptm->tm_mon;
3839 mday = ptm->tm_mday;
3840 /* allow given yday with no month & mday to dominate the result */
3841 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3844 jday = 1 + ptm->tm_yday;
3853 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3854 yearday += month*MONTH_TO_DAYS + mday + jday;
3856 * Note that we don't know when leap-seconds were or will be,
3857 * so we have to trust the user if we get something which looks
3858 * like a sensible leap-second. Wild values for seconds will
3859 * be rationalised, however.
3861 if ((unsigned) ptm->tm_sec <= 60) {
3868 secs += 60 * ptm->tm_min;
3869 secs += SECS_PER_HOUR * ptm->tm_hour;
3871 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3872 /* got negative remainder, but need positive time */
3873 /* back off an extra day to compensate */
3874 yearday += (secs/SECS_PER_DAY)-1;
3875 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3878 yearday += (secs/SECS_PER_DAY);
3879 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3882 else if (secs >= SECS_PER_DAY) {
3883 yearday += (secs/SECS_PER_DAY);
3884 secs %= SECS_PER_DAY;
3886 ptm->tm_hour = secs/SECS_PER_HOUR;
3887 secs %= SECS_PER_HOUR;
3888 ptm->tm_min = secs/60;
3890 ptm->tm_sec += secs;
3891 /* done with time of day effects */
3893 * The algorithm for yearday has (so far) left it high by 428.
3894 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3895 * bias it by 123 while trying to figure out what year it
3896 * really represents. Even with this tweak, the reverse
3897 * translation fails for years before A.D. 0001.
3898 * It would still fail for Feb 29, but we catch that one below.
3900 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3901 yearday -= YEAR_ADJUST;
3902 year = (yearday / DAYS_PER_QCENT) * 400;
3903 yearday %= DAYS_PER_QCENT;
3904 odd_cent = yearday / DAYS_PER_CENT;
3905 year += odd_cent * 100;
3906 yearday %= DAYS_PER_CENT;
3907 year += (yearday / DAYS_PER_QYEAR) * 4;
3908 yearday %= DAYS_PER_QYEAR;
3909 odd_year = yearday / DAYS_PER_YEAR;
3911 yearday %= DAYS_PER_YEAR;
3912 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3917 yearday += YEAR_ADJUST; /* recover March 1st crock */
3918 month = yearday*DAYS_TO_MONTH;
3919 yearday -= month*MONTH_TO_DAYS;
3920 /* recover other leap-year adjustment */
3929 ptm->tm_year = year - 1900;
3931 ptm->tm_mday = yearday;
3932 ptm->tm_mon = month;
3936 ptm->tm_mon = month - 1;
3938 /* re-build yearday based on Jan 1 to get tm_yday */
3940 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3941 yearday += 14*MONTH_TO_DAYS + 1;
3942 ptm->tm_yday = jday - yearday;
3943 /* fix tm_wday if not overridden by caller */
3944 if ((unsigned)ptm->tm_wday > 6)
3945 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3949 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)
3957 PERL_ARGS_ASSERT_MY_STRFTIME;
3959 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3962 mytm.tm_hour = hour;
3963 mytm.tm_mday = mday;
3965 mytm.tm_year = year;
3966 mytm.tm_wday = wday;
3967 mytm.tm_yday = yday;
3968 mytm.tm_isdst = isdst;
3970 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3971 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3976 #ifdef HAS_TM_TM_GMTOFF
3977 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3979 #ifdef HAS_TM_TM_ZONE
3980 mytm.tm_zone = mytm2.tm_zone;
3985 Newx(buf, buflen, char);
3986 len = strftime(buf, buflen, fmt, &mytm);
3988 ** The following is needed to handle to the situation where
3989 ** tmpbuf overflows. Basically we want to allocate a buffer
3990 ** and try repeatedly. The reason why it is so complicated
3991 ** is that getting a return value of 0 from strftime can indicate
3992 ** one of the following:
3993 ** 1. buffer overflowed,
3994 ** 2. illegal conversion specifier, or
3995 ** 3. the format string specifies nothing to be returned(not
3996 ** an error). This could be because format is an empty string
3997 ** or it specifies %p that yields an empty string in some locale.
3998 ** If there is a better way to make it portable, go ahead by
4001 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4004 /* Possibly buf overflowed - try again with a bigger buf */
4005 const int fmtlen = strlen(fmt);
4006 int bufsize = fmtlen + buflen;
4008 Newx(buf, bufsize, char);
4010 buflen = strftime(buf, bufsize, fmt, &mytm);
4011 if (buflen > 0 && buflen < bufsize)
4013 /* heuristic to prevent out-of-memory errors */
4014 if (bufsize > 100*fmtlen) {
4020 Renew(buf, bufsize, char);
4025 Perl_croak(aTHX_ "panic: no strftime");
4031 #define SV_CWD_RETURN_UNDEF \
4032 sv_setsv(sv, &PL_sv_undef); \
4035 #define SV_CWD_ISDOT(dp) \
4036 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4037 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4040 =head1 Miscellaneous Functions
4042 =for apidoc getcwd_sv
4044 Fill the sv with current working directory
4049 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4050 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4051 * getcwd(3) if available
4052 * Comments from the orignal:
4053 * This is a faster version of getcwd. It's also more dangerous
4054 * because you might chdir out of a directory that you can't chdir
4058 Perl_getcwd_sv(pTHX_ register SV *sv)
4062 #ifndef INCOMPLETE_TAINTS
4066 PERL_ARGS_ASSERT_GETCWD_SV;
4070 char buf[MAXPATHLEN];
4072 /* Some getcwd()s automatically allocate a buffer of the given
4073 * size from the heap if they are given a NULL buffer pointer.
4074 * The problem is that this behaviour is not portable. */
4075 if (getcwd(buf, sizeof(buf) - 1)) {
4080 sv_setsv(sv, &PL_sv_undef);
4088 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4092 SvUPGRADE(sv, SVt_PV);
4094 if (PerlLIO_lstat(".", &statbuf) < 0) {
4095 SV_CWD_RETURN_UNDEF;
4098 orig_cdev = statbuf.st_dev;
4099 orig_cino = statbuf.st_ino;
4109 if (PerlDir_chdir("..") < 0) {
4110 SV_CWD_RETURN_UNDEF;
4112 if (PerlLIO_stat(".", &statbuf) < 0) {
4113 SV_CWD_RETURN_UNDEF;
4116 cdev = statbuf.st_dev;
4117 cino = statbuf.st_ino;
4119 if (odev == cdev && oino == cino) {
4122 if (!(dir = PerlDir_open("."))) {
4123 SV_CWD_RETURN_UNDEF;
4126 while ((dp = PerlDir_read(dir)) != NULL) {
4128 namelen = dp->d_namlen;
4130 namelen = strlen(dp->d_name);
4133 if (SV_CWD_ISDOT(dp)) {
4137 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4138 SV_CWD_RETURN_UNDEF;
4141 tdev = statbuf.st_dev;
4142 tino = statbuf.st_ino;
4143 if (tino == oino && tdev == odev) {
4149 SV_CWD_RETURN_UNDEF;
4152 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4153 SV_CWD_RETURN_UNDEF;
4156 SvGROW(sv, pathlen + namelen + 1);
4160 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4163 /* prepend current directory to the front */
4165 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4166 pathlen += (namelen + 1);
4168 #ifdef VOID_CLOSEDIR
4171 if (PerlDir_close(dir) < 0) {
4172 SV_CWD_RETURN_UNDEF;
4178 SvCUR_set(sv, pathlen);
4182 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4183 SV_CWD_RETURN_UNDEF;
4186 if (PerlLIO_stat(".", &statbuf) < 0) {
4187 SV_CWD_RETURN_UNDEF;
4190 cdev = statbuf.st_dev;
4191 cino = statbuf.st_ino;
4193 if (cdev != orig_cdev || cino != orig_cino) {
4194 Perl_croak(aTHX_ "Unstable directory path, "
4195 "current directory changed unexpectedly");
4206 #define VERSION_MAX 0x7FFFFFFF
4208 =for apidoc scan_version
4210 Returns a pointer to the next character after the parsed
4211 version string, as well as upgrading the passed in SV to
4214 Function must be called with an already existing SV like
4217 s = scan_version(s, SV *sv, bool qv);
4219 Performs some preprocessing to the string to ensure that
4220 it has the correct characteristics of a version. Flags the
4221 object if it contains an underscore (which denotes this
4222 is an alpha version). The boolean qv denotes that the version
4223 should be interpreted as if it had multiple decimals, even if
4230 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4239 AV * const av = newAV();
4240 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4242 PERL_ARGS_ASSERT_SCAN_VERSION;
4244 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4246 while (isSPACE(*s)) /* leading whitespace is OK */
4252 s++; /* get past 'v' */
4253 qv = 1; /* force quoted version processing */
4258 /* pre-scan the input string to check for decimals/underbars */
4259 while ( *pos == '.' || *pos == '_' || *pos == ',' || isDIGIT(*pos) )
4264 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4268 else if ( *pos == '_' )
4271 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4273 width = pos - last - 1; /* natural width of sub-version */
4275 else if ( *pos == ',' && isDIGIT(pos[1]) )
4284 if ( alpha && !saw_period )
4285 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4287 if ( alpha && saw_period && width == 0 )
4288 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4290 if ( saw_period > 1 )
4291 qv = 1; /* force quoted version processing */
4297 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4299 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4300 if ( !qv && width < 3 )
4301 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4303 while (isDIGIT(*pos))
4305 if (!isALPHA(*pos)) {
4311 /* this is atoi() that delimits on underscores */
4312 const char *end = pos;
4316 /* the following if() will only be true after the decimal
4317 * point of a version originally created with a bare
4318 * floating point number, i.e. not quoted in any way
4320 if ( !qv && s > start && saw_period == 1 ) {
4324 rev += (*s - '0') * mult;
4326 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4327 || (PERL_ABS(rev) > VERSION_MAX )) {
4328 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4329 "Integer overflow in version %d",VERSION_MAX);
4340 while (--end >= s) {
4342 rev += (*end - '0') * mult;
4344 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4345 || (PERL_ABS(rev) > VERSION_MAX )) {
4346 Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW),
4347 "Integer overflow in version");
4356 /* Append revision */
4357 av_push(av, newSViv(rev));
4362 else if ( *pos == '.' )
4364 else if ( *pos == '_' && isDIGIT(pos[1]) )
4366 else if ( *pos == ',' && isDIGIT(pos[1]) )
4368 else if ( isDIGIT(*pos) )
4375 while ( isDIGIT(*pos) )
4380 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4388 if ( qv ) { /* quoted versions always get at least three terms*/
4389 I32 len = av_len(av);
4390 /* This for loop appears to trigger a compiler bug on OS X, as it
4391 loops infinitely. Yes, len is negative. No, it makes no sense.
4392 Compiler in question is:
4393 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4394 for ( len = 2 - len; len > 0; len-- )
4395 av_push(MUTABLE_AV(sv), newSViv(0));
4399 av_push(av, newSViv(0));
4402 /* need to save off the current version string for later */
4404 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4405 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4406 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4408 else if ( s > start ) {
4409 SV * orig = newSVpvn(start,s-start);
4410 if ( qv && saw_period == 1 && *start != 'v' ) {
4411 /* need to insert a v to be consistent */
4412 sv_insert(orig, 0, 0, "v", 1);
4414 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4417 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4418 av_push(av, newSViv(0));
4421 /* And finally, store the AV in the hash */
4422 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4424 /* fix RT#19517 - special case 'undef' as string */
4425 if ( *s == 'u' && strEQ(s,"undef") ) {
4433 =for apidoc new_version
4435 Returns a new version object based on the passed in SV:
4437 SV *sv = new_version(SV *ver);
4439 Does not alter the passed in ver SV. See "upg_version" if you
4440 want to upgrade the SV.
4446 Perl_new_version(pTHX_ SV *ver)
4449 SV * const rv = newSV(0);
4450 PERL_ARGS_ASSERT_NEW_VERSION;
4451 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4454 AV * const av = newAV();
4456 /* This will get reblessed later if a derived class*/
4457 SV * const hv = newSVrv(rv, "version");
4458 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4463 /* Begin copying all of the elements */
4464 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4465 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4467 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4468 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4470 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4472 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4473 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4476 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4478 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4479 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4482 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4483 /* This will get reblessed later if a derived class*/
4484 for ( key = 0; key <= av_len(sav); key++ )
4486 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4487 av_push(av, newSViv(rev));
4490 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4495 const MAGIC* const mg = SvVSTRING_mg(ver);
4496 if ( mg ) { /* already a v-string */
4497 const STRLEN len = mg->mg_len;
4498 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4499 sv_setpvn(rv,version,len);
4500 /* this is for consistency with the pure Perl class */
4501 if ( *version != 'v' )
4502 sv_insert(rv, 0, 0, "v", 1);
4507 sv_setsv(rv,ver); /* make a duplicate */
4512 return upg_version(rv, FALSE);
4516 =for apidoc upg_version
4518 In-place upgrade of the supplied SV to a version object.
4520 SV *sv = upg_version(SV *sv, bool qv);
4522 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4523 to force this SV to be interpreted as an "extended" version.
4529 Perl_upg_version(pTHX_ SV *ver, bool qv)
4531 const char *version, *s;
4536 PERL_ARGS_ASSERT_UPG_VERSION;
4538 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4540 /* may get too much accuracy */
4542 #ifdef USE_LOCALE_NUMERIC
4543 char *loc = setlocale(LC_NUMERIC, "C");
4545 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4546 #ifdef USE_LOCALE_NUMERIC
4547 setlocale(LC_NUMERIC, loc);
4549 while (tbuf[len-1] == '0' && len > 0) len--;
4550 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4551 version = savepvn(tbuf, len);
4554 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4555 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4559 else /* must be a string or something like a string */
4562 version = savepv(SvPV(ver,len));
4564 # if PERL_VERSION > 5
4565 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4566 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4567 /* may be a v-string */
4568 SV * const nsv = sv_newmortal();
4572 sv_setpvf(nsv,"v%vd",ver);
4573 pos = nver = savepv(SvPV_nolen(nsv));
4575 /* scan the resulting formatted string */
4576 pos++; /* skip the leading 'v' */
4577 while ( *pos == '.' || isDIGIT(*pos) ) {
4583 /* is definitely a v-string */
4584 if ( saw_period == 2 ) {
4593 s = scan_version(version, ver, qv);
4595 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4596 "Version string '%s' contains invalid data; "
4597 "ignoring: '%s'", version, s);
4605 Validates that the SV contains a valid version object.
4607 bool vverify(SV *vobj);
4609 Note that it only confirms the bare minimum structure (so as not to get
4610 confused by derived classes which may contain additional hash entries):
4614 =item * The SV contains a [reference to a] hash
4616 =item * The hash contains a "version" key
4618 =item * The "version" key has [a reference to] an AV as its value
4626 Perl_vverify(pTHX_ SV *vs)
4630 PERL_ARGS_ASSERT_VVERIFY;
4635 /* see if the appropriate elements exist */
4636 if ( SvTYPE(vs) == SVt_PVHV
4637 && hv_exists(MUTABLE_HV(vs), "version", 7)
4638 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4639 && SvTYPE(sv) == SVt_PVAV )
4648 Accepts a version object and returns the normalized floating
4649 point representation. Call like:
4653 NOTE: you can pass either the object directly or the SV
4654 contained within the RV.
4660 Perl_vnumify(pTHX_ SV *vs)
4665 SV * const sv = newSV(0);
4668 PERL_ARGS_ASSERT_VNUMIFY;
4674 Perl_croak(aTHX_ "Invalid version object");
4676 /* see if various flags exist */
4677 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4679 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4680 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4685 /* attempt to retrieve the version array */
4686 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4698 digit = SvIV(*av_fetch(av, 0, 0));
4699 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4700 for ( i = 1 ; i < len ; i++ )
4702 digit = SvIV(*av_fetch(av, i, 0));
4704 const int denom = (width == 2 ? 10 : 100);
4705 const div_t term = div((int)PERL_ABS(digit),denom);
4706 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4709 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4715 digit = SvIV(*av_fetch(av, len, 0));
4716 if ( alpha && width == 3 ) /* alpha version */
4718 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4722 sv_catpvs(sv, "000");
4730 Accepts a version object and returns the normalized string
4731 representation. Call like:
4735 NOTE: you can pass either the object directly or the SV
4736 contained within the RV.
4742 Perl_vnormal(pTHX_ SV *vs)
4746 SV * const sv = newSV(0);
4749 PERL_ARGS_ASSERT_VNORMAL;
4755 Perl_croak(aTHX_ "Invalid version object");
4757 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4759 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4767 digit = SvIV(*av_fetch(av, 0, 0));
4768 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4769 for ( i = 1 ; i < len ; i++ ) {
4770 digit = SvIV(*av_fetch(av, i, 0));
4771 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4776 /* handle last digit specially */
4777 digit = SvIV(*av_fetch(av, len, 0));
4779 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4781 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4784 if ( len <= 2 ) { /* short version, must be at least three */
4785 for ( len = 2 - len; len != 0; len-- )
4792 =for apidoc vstringify
4794 In order to maintain maximum compatibility with earlier versions
4795 of Perl, this function will return either the floating point
4796 notation or the multiple dotted notation, depending on whether
4797 the original version contained 1 or more dots, respectively
4803 Perl_vstringify(pTHX_ SV *vs)
4805 PERL_ARGS_ASSERT_VSTRINGIFY;
4811 Perl_croak(aTHX_ "Invalid version object");
4813 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4815 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4819 return &PL_sv_undef;
4822 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4832 Version object aware cmp. Both operands must already have been
4833 converted into version objects.
4839 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4842 bool lalpha = FALSE;
4843 bool ralpha = FALSE;
4848 PERL_ARGS_ASSERT_VCMP;
4855 if ( !vverify(lhv) )
4856 Perl_croak(aTHX_ "Invalid version object");
4858 if ( !vverify(rhv) )
4859 Perl_croak(aTHX_ "Invalid version object");
4861 /* get the left hand term */
4862 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4863 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4866 /* and the right hand term */
4867 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4868 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4876 while ( i <= m && retval == 0 )
4878 left = SvIV(*av_fetch(lav,i,0));
4879 right = SvIV(*av_fetch(rav,i,0));
4887 /* tiebreaker for alpha with identical terms */
4888 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4890 if ( lalpha && !ralpha )
4894 else if ( ralpha && !lalpha)
4900 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4904 while ( i <= r && retval == 0 )
4906 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4907 retval = -1; /* not a match after all */
4913 while ( i <= l && retval == 0 )
4915 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4916 retval = +1; /* not a match after all */
4924 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4925 # define EMULATE_SOCKETPAIR_UDP
4928 #ifdef EMULATE_SOCKETPAIR_UDP
4930 S_socketpair_udp (int fd[2]) {
4932 /* Fake a datagram socketpair using UDP to localhost. */
4933 int sockets[2] = {-1, -1};
4934 struct sockaddr_in addresses[2];
4936 Sock_size_t size = sizeof(struct sockaddr_in);
4937 unsigned short port;
4940 memset(&addresses, 0, sizeof(addresses));
4943 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4944 if (sockets[i] == -1)
4945 goto tidy_up_and_fail;
4947 addresses[i].sin_family = AF_INET;
4948 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4949 addresses[i].sin_port = 0; /* kernel choses port. */
4950 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4951 sizeof(struct sockaddr_in)) == -1)
4952 goto tidy_up_and_fail;
4955 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4956 for each connect the other socket to it. */
4959 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4961 goto tidy_up_and_fail;
4962 if (size != sizeof(struct sockaddr_in))
4963 goto abort_tidy_up_and_fail;
4964 /* !1 is 0, !0 is 1 */
4965 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4966 sizeof(struct sockaddr_in)) == -1)
4967 goto tidy_up_and_fail;
4970 /* Now we have 2 sockets connected to each other. I don't trust some other
4971 process not to have already sent a packet to us (by random) so send
4972 a packet from each to the other. */
4975 /* I'm going to send my own port number. As a short.
4976 (Who knows if someone somewhere has sin_port as a bitfield and needs
4977 this routine. (I'm assuming crays have socketpair)) */
4978 port = addresses[i].sin_port;
4979 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4980 if (got != sizeof(port)) {
4982 goto tidy_up_and_fail;
4983 goto abort_tidy_up_and_fail;
4987 /* Packets sent. I don't trust them to have arrived though.
4988 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4989 connect to localhost will use a second kernel thread. In 2.6 the
4990 first thread running the connect() returns before the second completes,
4991 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4992 returns 0. Poor programs have tripped up. One poor program's authors'
4993 had a 50-1 reverse stock split. Not sure how connected these were.)
4994 So I don't trust someone not to have an unpredictable UDP stack.
4998 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4999 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5003 FD_SET((unsigned int)sockets[0], &rset);
5004 FD_SET((unsigned int)sockets[1], &rset);
5006 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5007 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5008 || !FD_ISSET(sockets[1], &rset)) {
5009 /* I hope this is portable and appropriate. */
5011 goto tidy_up_and_fail;
5012 goto abort_tidy_up_and_fail;
5016 /* And the paranoia department even now doesn't trust it to have arrive
5017 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5019 struct sockaddr_in readfrom;
5020 unsigned short buffer[2];
5025 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5026 sizeof(buffer), MSG_DONTWAIT,
5027 (struct sockaddr *) &readfrom, &size);
5029 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5031 (struct sockaddr *) &readfrom, &size);
5035 goto tidy_up_and_fail;
5036 if (got != sizeof(port)
5037 || size != sizeof(struct sockaddr_in)
5038 /* Check other socket sent us its port. */
5039 || buffer[0] != (unsigned short) addresses[!i].sin_port
5040 /* Check kernel says we got the datagram from that socket */
5041 || readfrom.sin_family != addresses[!i].sin_family
5042 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5043 || readfrom.sin_port != addresses[!i].sin_port)
5044 goto abort_tidy_up_and_fail;
5047 /* My caller (my_socketpair) has validated that this is non-NULL */
5050 /* I hereby declare this connection open. May God bless all who cross
5054 abort_tidy_up_and_fail:
5055 errno = ECONNABORTED;
5059 if (sockets[0] != -1)
5060 PerlLIO_close(sockets[0]);
5061 if (sockets[1] != -1)
5062 PerlLIO_close(sockets[1]);
5067 #endif /* EMULATE_SOCKETPAIR_UDP */
5069 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5071 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5072 /* Stevens says that family must be AF_LOCAL, protocol 0.
5073 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5078 struct sockaddr_in listen_addr;
5079 struct sockaddr_in connect_addr;
5084 || family != AF_UNIX
5087 errno = EAFNOSUPPORT;
5095 #ifdef EMULATE_SOCKETPAIR_UDP
5096 if (type == SOCK_DGRAM)
5097 return S_socketpair_udp(fd);
5100 listener = PerlSock_socket(AF_INET, type, 0);
5103 memset(&listen_addr, 0, sizeof(listen_addr));
5104 listen_addr.sin_family = AF_INET;
5105 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5106 listen_addr.sin_port = 0; /* kernel choses port. */
5107 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5108 sizeof(listen_addr)) == -1)
5109 goto tidy_up_and_fail;
5110 if (PerlSock_listen(listener, 1) == -1)
5111 goto tidy_up_and_fail;
5113 connector = PerlSock_socket(AF_INET, type, 0);
5114 if (connector == -1)
5115 goto tidy_up_and_fail;
5116 /* We want to find out the port number to connect to. */
5117 size = sizeof(connect_addr);
5118 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5120 goto tidy_up_and_fail;
5121 if (size != sizeof(connect_addr))
5122 goto abort_tidy_up_and_fail;
5123 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5124 sizeof(connect_addr)) == -1)
5125 goto tidy_up_and_fail;
5127 size = sizeof(listen_addr);
5128 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5131 goto tidy_up_and_fail;
5132 if (size != sizeof(listen_addr))
5133 goto abort_tidy_up_and_fail;
5134 PerlLIO_close(listener);
5135 /* Now check we are talking to ourself by matching port and host on the
5137 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5139 goto tidy_up_and_fail;
5140 if (size != sizeof(connect_addr)
5141 || listen_addr.sin_family != connect_addr.sin_family
5142 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5143 || listen_addr.sin_port != connect_addr.sin_port) {
5144 goto abort_tidy_up_and_fail;
5150 abort_tidy_up_and_fail:
5152 errno = ECONNABORTED; /* This would be the standard thing to do. */
5154 # ifdef ECONNREFUSED
5155 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5157 errno = ETIMEDOUT; /* Desperation time. */
5164 PerlLIO_close(listener);
5165 if (connector != -1)
5166 PerlLIO_close(connector);
5168 PerlLIO_close(acceptor);
5174 /* In any case have a stub so that there's code corresponding
5175 * to the my_socketpair in global.sym. */
5177 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5178 #ifdef HAS_SOCKETPAIR
5179 return socketpair(family, type, protocol, fd);
5188 =for apidoc sv_nosharing
5190 Dummy routine which "shares" an SV when there is no sharing module present.
5191 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5192 Exists to avoid test for a NULL function pointer and because it could
5193 potentially warn under some level of strict-ness.
5199 Perl_sv_nosharing(pTHX_ SV *sv)
5201 PERL_UNUSED_CONTEXT;
5202 PERL_UNUSED_ARG(sv);
5207 =for apidoc sv_destroyable
5209 Dummy routine which reports that object can be destroyed when there is no
5210 sharing module present. It ignores its single SV argument, and returns
5211 'true'. Exists to avoid test for a NULL function pointer and because it
5212 could potentially warn under some level of strict-ness.
5218 Perl_sv_destroyable(pTHX_ SV *sv)
5220 PERL_UNUSED_CONTEXT;
5221 PERL_UNUSED_ARG(sv);
5226 Perl_parse_unicode_opts(pTHX_ const char **popt)
5228 const char *p = *popt;
5231 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5235 opt = (U32) atoi(p);
5238 if (*p && *p != '\n' && *p != '\r')
5239 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5244 case PERL_UNICODE_STDIN:
5245 opt |= PERL_UNICODE_STDIN_FLAG; break;
5246 case PERL_UNICODE_STDOUT:
5247 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5248 case PERL_UNICODE_STDERR:
5249 opt |= PERL_UNICODE_STDERR_FLAG; break;
5250 case PERL_UNICODE_STD:
5251 opt |= PERL_UNICODE_STD_FLAG; break;
5252 case PERL_UNICODE_IN:
5253 opt |= PERL_UNICODE_IN_FLAG; break;
5254 case PERL_UNICODE_OUT:
5255 opt |= PERL_UNICODE_OUT_FLAG; break;
5256 case PERL_UNICODE_INOUT:
5257 opt |= PERL_UNICODE_INOUT_FLAG; break;
5258 case PERL_UNICODE_LOCALE:
5259 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5260 case PERL_UNICODE_ARGV:
5261 opt |= PERL_UNICODE_ARGV_FLAG; break;
5262 case PERL_UNICODE_UTF8CACHEASSERT:
5263 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5265 if (*p != '\n' && *p != '\r')
5267 "Unknown Unicode option letter '%c'", *p);
5273 opt = PERL_UNICODE_DEFAULT_FLAGS;
5275 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5276 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5277 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5289 * This is really just a quick hack which grabs various garbage
5290 * values. It really should be a real hash algorithm which
5291 * spreads the effect of every input bit onto every output bit,
5292 * if someone who knows about such things would bother to write it.
5293 * Might be a good idea to add that function to CORE as well.
5294 * No numbers below come from careful analysis or anything here,
5295 * except they are primes and SEED_C1 > 1E6 to get a full-width
5296 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5297 * probably be bigger too.
5300 # define SEED_C1 1000003
5301 #define SEED_C4 73819
5303 # define SEED_C1 25747
5304 #define SEED_C4 20639
5308 #define SEED_C5 26107
5310 #ifndef PERL_NO_DEV_RANDOM
5315 # include <starlet.h>
5316 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5317 * in 100-ns units, typically incremented ever 10 ms. */
5318 unsigned int when[2];
5320 # ifdef HAS_GETTIMEOFDAY
5321 struct timeval when;
5327 /* This test is an escape hatch, this symbol isn't set by Configure. */
5328 #ifndef PERL_NO_DEV_RANDOM
5329 #ifndef PERL_RANDOM_DEVICE
5330 /* /dev/random isn't used by default because reads from it will block
5331 * if there isn't enough entropy available. You can compile with
5332 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5333 * is enough real entropy to fill the seed. */
5334 # define PERL_RANDOM_DEVICE "/dev/urandom"
5336 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5338 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5347 _ckvmssts(sys$gettim(when));
5348 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5350 # ifdef HAS_GETTIMEOFDAY
5351 PerlProc_gettimeofday(&when,NULL);
5352 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5355 u = (U32)SEED_C1 * when;
5358 u += SEED_C3 * (U32)PerlProc_getpid();
5359 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5360 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5361 u += SEED_C5 * (U32)PTR2UV(&when);
5367 Perl_get_hash_seed(pTHX)
5370 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5376 if (s && isDIGIT(*s))
5377 myseed = (UV)Atoul(s);
5379 #ifdef USE_HASH_SEED_EXPLICIT
5383 /* Compute a random seed */
5384 (void)seedDrand01((Rand_seed_t)seed());
5385 myseed = (UV)(Drand01() * (NV)UV_MAX);
5386 #if RANDBITS < (UVSIZE * 8)
5387 /* Since there are not enough randbits to to reach all
5388 * the bits of a UV, the low bits might need extra
5389 * help. Sum in another random number that will
5390 * fill in the low bits. */
5392 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5393 #endif /* RANDBITS < (UVSIZE * 8) */
5394 if (myseed == 0) { /* Superparanoia. */
5395 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5397 Perl_croak(aTHX_ "Your random numbers are not that random");
5400 PL_rehash_seed_set = TRUE;
5407 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5409 const char * const stashpv = CopSTASHPV(c);
5410 const char * const name = HvNAME_get(hv);
5411 PERL_UNUSED_CONTEXT;
5412 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5414 if (stashpv == name)
5416 if (stashpv && name)
5417 if (strEQ(stashpv, name))
5424 #ifdef PERL_GLOBAL_STRUCT
5426 #define PERL_GLOBAL_STRUCT_INIT
5427 #include "opcode.h" /* the ppaddr and check */
5430 Perl_init_global_struct(pTHX)
5432 struct perl_vars *plvarsp = NULL;
5433 # ifdef PERL_GLOBAL_STRUCT
5434 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5435 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5436 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5437 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5438 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5442 plvarsp = PL_VarsPtr;
5443 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5449 # define PERLVAR(var,type) /**/
5450 # define PERLVARA(var,n,type) /**/
5451 # define PERLVARI(var,type,init) plvarsp->var = init;
5452 # define PERLVARIC(var,type,init) plvarsp->var = init;
5453 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5454 # include "perlvars.h"
5460 # ifdef PERL_GLOBAL_STRUCT
5463 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5464 if (!plvarsp->Gppaddr)
5468 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5469 if (!plvarsp->Gcheck)
5471 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5472 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5474 # ifdef PERL_SET_VARS
5475 PERL_SET_VARS(plvarsp);
5477 # undef PERL_GLOBAL_STRUCT_INIT
5482 #endif /* PERL_GLOBAL_STRUCT */
5484 #ifdef PERL_GLOBAL_STRUCT
5487 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5489 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5490 # ifdef PERL_GLOBAL_STRUCT
5491 # ifdef PERL_UNSET_VARS
5492 PERL_UNSET_VARS(plvarsp);
5494 free(plvarsp->Gppaddr);
5495 free(plvarsp->Gcheck);
5496 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5502 #endif /* PERL_GLOBAL_STRUCT */
5506 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5507 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5508 * given, and you supply your own implementation.
5510 * The default implementation reads a single env var, PERL_MEM_LOG,
5511 * expecting one or more of the following:
5513 * \d+ - fd fd to write to : must be 1st (atoi)
5514 * 'm' - memlog was PERL_MEM_LOG=1
5515 * 's' - svlog was PERL_SV_LOG=1
5516 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5518 * This makes the logger controllable enough that it can reasonably be
5519 * added to the system perl.
5522 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5523 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5525 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5527 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5528 * writes to. In the default logger, this is settable at runtime.
5530 #ifndef PERL_MEM_LOG_FD
5531 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5534 #ifndef PERL_MEM_LOG_NOIMPL
5536 # ifdef DEBUG_LEAKING_SCALARS
5537 # define SV_LOG_SERIAL_FMT " [%lu]"
5538 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5540 # define SV_LOG_SERIAL_FMT
5541 # define _SV_LOG_SERIAL_ARG(sv)
5545 S_mem_log_common(enum mem_log_type mlt, const UV n,
5546 const UV typesize, const char *type_name, const SV *sv,
5547 Malloc_t oldalloc, Malloc_t newalloc,
5548 const char *filename, const int linenumber,
5549 const char *funcname)
5553 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5555 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5558 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
5560 /* We can't use SVs or PerlIO for obvious reasons,
5561 * so we'll use stdio and low-level IO instead. */
5562 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5564 # ifdef HAS_GETTIMEOFDAY
5565 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5566 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5568 gettimeofday(&tv, 0);
5570 # define MEM_LOG_TIME_FMT "%10d: "
5571 # define MEM_LOG_TIME_ARG (int)when
5575 /* If there are other OS specific ways of hires time than
5576 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5577 * probably that they would be used to fill in the struct
5581 int fd = atoi(pmlenv);
5583 fd = PERL_MEM_LOG_FD;
5585 if (strchr(pmlenv, 't')) {
5586 len = my_snprintf(buf, sizeof(buf),
5587 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5588 PerlLIO_write(fd, buf, len);
5592 len = my_snprintf(buf, sizeof(buf),
5593 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5594 " %s = %"IVdf": %"UVxf"\n",
5595 filename, linenumber, funcname, n, typesize,
5596 type_name, n * typesize, PTR2UV(newalloc));
5599 len = my_snprintf(buf, sizeof(buf),
5600 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5601 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5602 filename, linenumber, funcname, n, typesize,
5603 type_name, n * typesize, PTR2UV(oldalloc),
5607 len = my_snprintf(buf, sizeof(buf),
5608 "free: %s:%d:%s: %"UVxf"\n",
5609 filename, linenumber, funcname,
5614 len = my_snprintf(buf, sizeof(buf),
5615 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5616 mlt == MLT_NEW_SV ? "new" : "del",
5617 filename, linenumber, funcname,
5618 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5623 PerlLIO_write(fd, buf, len);
5627 #endif /* !PERL_MEM_LOG_NOIMPL */
5629 #ifndef PERL_MEM_LOG_NOIMPL
5631 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5632 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5634 /* this is suboptimal, but bug compatible. User is providing their
5635 own implemenation, but is getting these functions anyway, and they
5636 do nothing. But _NOIMPL users should be able to cope or fix */
5638 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5639 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5643 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5645 const char *filename, const int linenumber,
5646 const char *funcname)
5648 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5649 NULL, NULL, newalloc,
5650 filename, linenumber, funcname);
5655 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5656 Malloc_t oldalloc, Malloc_t newalloc,
5657 const char *filename, const int linenumber,
5658 const char *funcname)
5660 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5661 NULL, oldalloc, newalloc,
5662 filename, linenumber, funcname);
5667 Perl_mem_log_free(Malloc_t oldalloc,
5668 const char *filename, const int linenumber,
5669 const char *funcname)
5671 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5672 filename, linenumber, funcname);
5677 Perl_mem_log_new_sv(const SV *sv,
5678 const char *filename, const int linenumber,
5679 const char *funcname)
5681 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5682 filename, linenumber, funcname);
5686 Perl_mem_log_del_sv(const SV *sv,
5687 const char *filename, const int linenumber,
5688 const char *funcname)
5690 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5691 filename, linenumber, funcname);
5694 #endif /* PERL_MEM_LOG */
5697 =for apidoc my_sprintf
5699 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5700 the length of the string written to the buffer. Only rare pre-ANSI systems
5701 need the wrapper function - usually this is a direct call to C<sprintf>.
5705 #ifndef SPRINTF_RETURNS_STRLEN
5707 Perl_my_sprintf(char *buffer, const char* pat, ...)
5710 PERL_ARGS_ASSERT_MY_SPRINTF;
5711 va_start(args, pat);
5712 vsprintf(buffer, pat, args);
5714 return strlen(buffer);
5719 =for apidoc my_snprintf
5721 The C library C<snprintf> functionality, if available and
5722 standards-compliant (uses C<vsnprintf>, actually). However, if the
5723 C<vsnprintf> is not available, will unfortunately use the unsafe
5724 C<vsprintf> which can overrun the buffer (there is an overrun check,
5725 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5726 getting C<vsnprintf>.
5731 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5736 PERL_ARGS_ASSERT_MY_SNPRINTF;
5737 va_start(ap, format);
5738 #ifdef HAS_VSNPRINTF
5739 retval = vsnprintf(buffer, len, format, ap);
5741 retval = vsprintf(buffer, format, ap);
5744 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5745 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5746 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5751 =for apidoc my_vsnprintf
5753 The C library C<vsnprintf> if available and standards-compliant.
5754 However, if if the C<vsnprintf> is not available, will unfortunately
5755 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5756 overrun check, but that may be too late). Consider using
5757 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5762 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5769 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5771 Perl_va_copy(ap, apc);
5772 # ifdef HAS_VSNPRINTF
5773 retval = vsnprintf(buffer, len, format, apc);
5775 retval = vsprintf(buffer, format, apc);
5778 # ifdef HAS_VSNPRINTF
5779 retval = vsnprintf(buffer, len, format, ap);
5781 retval = vsprintf(buffer, format, ap);
5783 #endif /* #ifdef NEED_VA_COPY */
5784 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5785 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5786 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5791 Perl_my_clearenv(pTHX)
5794 #if ! defined(PERL_MICRO)
5795 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5797 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5798 # if defined(USE_ENVIRON_ARRAY)
5799 # if defined(USE_ITHREADS)
5800 /* only the parent thread can clobber the process environment */
5801 if (PL_curinterp == aTHX)
5802 # endif /* USE_ITHREADS */
5804 # if ! defined(PERL_USE_SAFE_PUTENV)
5805 if ( !PL_use_safe_putenv) {
5807 if (environ == PL_origenviron)
5808 environ = (char**)safesysmalloc(sizeof(char*));
5810 for (i = 0; environ[i]; i++)
5811 (void)safesysfree(environ[i]);
5814 # else /* PERL_USE_SAFE_PUTENV */
5815 # if defined(HAS_CLEARENV)
5817 # elif defined(HAS_UNSETENV)
5818 int bsiz = 80; /* Most envvar names will be shorter than this. */
5819 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5820 char *buf = (char*)safesysmalloc(bufsiz);
5821 while (*environ != NULL) {
5822 char *e = strchr(*environ, '=');
5823 int l = e ? e - *environ : (int)strlen(*environ);
5825 (void)safesysfree(buf);
5826 bsiz = l + 1; /* + 1 for the \0. */
5827 buf = (char*)safesysmalloc(bufsiz);
5829 memcpy(buf, *environ, l);
5831 (void)unsetenv(buf);
5833 (void)safesysfree(buf);
5834 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5835 /* Just null environ and accept the leakage. */
5837 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5838 # endif /* ! PERL_USE_SAFE_PUTENV */
5840 # endif /* USE_ENVIRON_ARRAY */
5841 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5842 #endif /* PERL_MICRO */
5845 #ifdef PERL_IMPLICIT_CONTEXT
5847 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5848 the global PL_my_cxt_index is incremented, and that value is assigned to
5849 that module's static my_cxt_index (who's address is passed as an arg).
5850 Then, for each interpreter this function is called for, it makes sure a
5851 void* slot is available to hang the static data off, by allocating or
5852 extending the interpreter's PL_my_cxt_list array */
5854 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5856 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5860 PERL_ARGS_ASSERT_MY_CXT_INIT;
5862 /* this module hasn't been allocated an index yet */
5863 MUTEX_LOCK(&PL_my_ctx_mutex);
5864 *index = PL_my_cxt_index++;
5865 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5868 /* make sure the array is big enough */
5869 if (PL_my_cxt_size <= *index) {
5870 if (PL_my_cxt_size) {
5871 while (PL_my_cxt_size <= *index)
5872 PL_my_cxt_size *= 2;
5873 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5876 PL_my_cxt_size = 16;
5877 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5880 /* newSV() allocates one more than needed */
5881 p = (void*)SvPVX(newSV(size-1));
5882 PL_my_cxt_list[*index] = p;
5883 Zero(p, size, char);
5887 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5890 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5895 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5897 for (index = 0; index < PL_my_cxt_index; index++) {
5898 const char *key = PL_my_cxt_keys[index];
5899 /* try direct pointer compare first - there are chances to success,
5900 * and it's much faster.
5902 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5909 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5915 PERL_ARGS_ASSERT_MY_CXT_INIT;
5917 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5919 /* this module hasn't been allocated an index yet */
5920 MUTEX_LOCK(&PL_my_ctx_mutex);
5921 index = PL_my_cxt_index++;
5922 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5925 /* make sure the array is big enough */
5926 if (PL_my_cxt_size <= index) {
5927 int old_size = PL_my_cxt_size;
5929 if (PL_my_cxt_size) {
5930 while (PL_my_cxt_size <= index)
5931 PL_my_cxt_size *= 2;
5932 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5933 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5936 PL_my_cxt_size = 16;
5937 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5938 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5940 for (i = old_size; i < PL_my_cxt_size; i++) {
5941 PL_my_cxt_keys[i] = 0;
5942 PL_my_cxt_list[i] = 0;
5945 PL_my_cxt_keys[index] = my_cxt_key;
5946 /* newSV() allocates one more than needed */
5947 p = (void*)SvPVX(newSV(size-1));
5948 PL_my_cxt_list[index] = p;
5949 Zero(p, size, char);
5952 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5953 #endif /* PERL_IMPLICIT_CONTEXT */
5957 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5959 Size_t used, length, copy;
5962 length = strlen(src);
5963 if (size > 0 && used < size - 1) {
5964 copy = (length >= size - used) ? size - used - 1 : length;
5965 memcpy(dst + used, src, copy);
5966 dst[used + copy] = '\0';
5968 return used + length;
5974 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5976 Size_t length, copy;
5978 length = strlen(src);
5980 copy = (length >= size) ? size - 1 : length;
5981 memcpy(dst, src, copy);
5988 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5989 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5990 long _ftol( double ); /* Defined by VC6 C libs. */
5991 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5995 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5998 SV * const dbsv = GvSVn(PL_DBsub);
5999 /* We do not care about using sv to call CV;
6000 * it's for informational purposes only.
6003 PERL_ARGS_ASSERT_GET_DB_SUB;
6006 if (!PERLDB_SUB_NN) {
6007 GV * const gv = CvGV(cv);
6009 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6010 || strEQ(GvNAME(gv), "END")
6011 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6012 !( (SvTYPE(*svp) == SVt_PVGV)
6013 && (GvCV((const GV *)*svp) == cv) )))) {
6014 /* Use GV from the stack as a fallback. */
6015 /* GV is potentially non-unique, or contain different CV. */
6016 SV * const tmp = newRV(MUTABLE_SV(cv));
6017 sv_setsv(dbsv, tmp);
6021 gv_efullname3(dbsv, gv, NULL);
6025 const int type = SvTYPE(dbsv);
6026 if (type < SVt_PVIV && type != SVt_IV)
6027 sv_upgrade(dbsv, SVt_PVIV);
6028 (void)SvIOK_on(dbsv);
6029 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6034 Perl_my_dirfd(pTHX_ DIR * dir) {
6036 /* Most dirfd implementations have problems when passed NULL. */
6041 #elif defined(HAS_DIR_DD_FD)
6044 Perl_die(aTHX_ PL_no_func, "dirfd");
6051 Perl_get_re_arg(pTHX_ SV *sv) {
6058 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6059 SvTYPE(tmpsv) == SVt_REGEXP)
6061 return (REGEXP*) tmpsv;
6070 * c-indentation-style: bsd
6072 * indent-tabs-mode: t
6075 * ex: set ts=8 sts=4 sw=4 noet: