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(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
377 PERL_ARGS_ASSERT_DELIMCPY;
379 for (tolen = 0; from < fromend; from++, tolen++) {
381 if (from[1] != delim) {
388 else if (*from == delim)
399 /* return ptr to little string in big string, NULL if not found */
400 /* This routine was donated by Corey Satten. */
403 Perl_instr(pTHX_ register const char *big, register const char *little)
408 PERL_ARGS_ASSERT_INSTR;
416 register const char *s, *x;
419 for (x=big,s=little; *s; /**/ ) {
430 return (char*)(big-1);
435 /* same as instr but allow embedded nulls */
438 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
440 PERL_ARGS_ASSERT_NINSTR;
445 const char first = *little;
447 bigend -= lend - little++;
449 while (big <= bigend) {
450 if (*big++ == first) {
451 for (x=big,s=little; s < lend; x++,s++) {
455 return (char*)(big-1);
462 /* reverse of the above--find last substring */
465 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
467 register const char *bigbeg;
468 register const I32 first = *little;
469 register const char * const littleend = lend;
472 PERL_ARGS_ASSERT_RNINSTR;
474 if (little >= littleend)
475 return (char*)bigend;
477 big = bigend - (littleend - little++);
478 while (big >= bigbeg) {
479 register const char *s, *x;
482 for (x=big+2,s=little; s < littleend; /**/ ) {
491 return (char*)(big+1);
496 /* As a space optimization, we do not compile tables for strings of length
497 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
498 special-cased in fbm_instr().
500 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
503 =head1 Miscellaneous Functions
505 =for apidoc fbm_compile
507 Analyses the string in order to make fast searches on it using fbm_instr()
508 -- the Boyer-Moore algorithm.
514 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
517 register const U8 *s;
523 PERL_ARGS_ASSERT_FBM_COMPILE;
525 if (flags & FBMcf_TAIL) {
526 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
527 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
528 if (mg && mg->mg_len >= 0)
531 s = (U8*)SvPV_force_mutable(sv, len);
532 if (len == 0) /* TAIL might be on a zero-length string. */
534 SvUPGRADE(sv, SVt_PVGV);
539 const unsigned char *sb;
540 const U8 mlen = (len>255) ? 255 : (U8)len;
543 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
545 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
546 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
547 memset((void*)table, mlen, 256);
549 sb = s - mlen + 1; /* first char (maybe) */
551 if (table[*s] == mlen)
556 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
558 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
560 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
561 for (i = 0; i < len; i++) {
562 if (PL_freq[s[i]] < frequency) {
564 frequency = PL_freq[s[i]];
567 BmFLAGS(sv) = (U8)flags;
568 BmRARE(sv) = s[rarest];
569 BmPREVIOUS(sv) = rarest;
570 BmUSEFUL(sv) = 100; /* Initial value */
571 if (flags & FBMcf_TAIL)
573 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
574 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
577 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
578 /* If SvTAIL is actually due to \Z or \z, this gives false positives
582 =for apidoc fbm_instr
584 Returns the location of the SV in the string delimited by C<str> and
585 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
586 does not have to be fbm_compiled, but the search will not be as fast
593 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
595 register unsigned char *s;
597 register const unsigned char *little
598 = (const unsigned char *)SvPV_const(littlestr,l);
599 register STRLEN littlelen = l;
600 register const I32 multiline = flags & FBMrf_MULTILINE;
602 PERL_ARGS_ASSERT_FBM_INSTR;
604 if ((STRLEN)(bigend - big) < littlelen) {
605 if ( SvTAIL(littlestr)
606 && ((STRLEN)(bigend - big) == littlelen - 1)
608 || (*big == *little &&
609 memEQ((char *)big, (char *)little, littlelen - 1))))
614 if (littlelen <= 2) { /* Special-cased */
616 if (littlelen == 1) {
617 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
618 /* Know that bigend != big. */
619 if (bigend[-1] == '\n')
620 return (char *)(bigend - 1);
621 return (char *) bigend;
629 if (SvTAIL(littlestr))
630 return (char *) bigend;
634 return (char*)big; /* Cannot be SvTAIL! */
637 if (SvTAIL(littlestr) && !multiline) {
638 if (bigend[-1] == '\n' && bigend[-2] == *little)
639 return (char*)bigend - 2;
640 if (bigend[-1] == *little)
641 return (char*)bigend - 1;
645 /* This should be better than FBM if c1 == c2, and almost
646 as good otherwise: maybe better since we do less indirection.
647 And we save a lot of memory by caching no table. */
648 const unsigned char c1 = little[0];
649 const unsigned char c2 = little[1];
654 while (s <= bigend) {
664 goto check_1char_anchor;
675 goto check_1char_anchor;
678 while (s <= bigend) {
683 goto check_1char_anchor;
692 check_1char_anchor: /* One char and anchor! */
693 if (SvTAIL(littlestr) && (*bigend == *little))
694 return (char *)bigend; /* bigend is already decremented. */
697 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
698 s = bigend - littlelen;
699 if (s >= big && bigend[-1] == '\n' && *s == *little
700 /* Automatically of length > 2 */
701 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
703 return (char*)s; /* how sweet it is */
706 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
708 return (char*)s + 1; /* how sweet it is */
712 if (!SvVALID(littlestr)) {
713 char * const b = ninstr((char*)big,(char*)bigend,
714 (char*)little, (char*)little + littlelen);
716 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
717 /* Chop \n from littlestr: */
718 s = bigend - littlelen + 1;
720 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
730 if (littlelen > (STRLEN)(bigend - big))
734 register const unsigned char * const table
735 = little + littlelen + PERL_FBM_TABLE_OFFSET;
736 register const unsigned char *oldlittle;
738 --littlelen; /* Last char found by table lookup */
741 little += littlelen; /* last char */
747 if ((tmp = table[*s])) {
748 if ((s += tmp) < bigend)
752 else { /* less expensive than calling strncmp() */
753 register unsigned char * const olds = s;
758 if (*--s == *--little)
760 s = olds + 1; /* here we pay the price for failure */
762 if (s < bigend) /* fake up continue to outer loop */
771 && (BmFLAGS(littlestr) & FBMcf_TAIL)
772 && memEQ((char *)(bigend - littlelen),
773 (char *)(oldlittle - littlelen), littlelen) )
774 return (char*)bigend - littlelen;
779 /* start_shift, end_shift are positive quantities which give offsets
780 of ends of some substring of bigstr.
781 If "last" we want the last occurrence.
782 old_posp is the way of communication between consequent calls if
783 the next call needs to find the .
784 The initial *old_posp should be -1.
786 Note that we take into account SvTAIL, so one can get extra
787 optimizations if _ALL flag is set.
790 /* If SvTAIL is actually due to \Z or \z, this gives false positives
791 if PL_multiline. In fact if !PL_multiline the authoritative answer
792 is not supported yet. */
795 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
798 register const unsigned char *big;
800 register I32 previous;
802 register const unsigned char *little;
803 register I32 stop_pos;
804 register const unsigned char *littleend;
807 PERL_ARGS_ASSERT_SCREAMINSTR;
809 assert(SvTYPE(littlestr) == SVt_PVGV);
810 assert(SvVALID(littlestr));
813 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
814 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
816 if ( BmRARE(littlestr) == '\n'
817 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
818 little = (const unsigned char *)(SvPVX_const(littlestr));
819 littleend = little + SvCUR(littlestr);
826 little = (const unsigned char *)(SvPVX_const(littlestr));
827 littleend = little + SvCUR(littlestr);
829 /* The value of pos we can start at: */
830 previous = BmPREVIOUS(littlestr);
831 big = (const unsigned char *)(SvPVX_const(bigstr));
832 /* The value of pos we can stop at: */
833 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
834 if (previous + start_shift > stop_pos) {
836 stop_pos does not include SvTAIL in the count, so this check is incorrect
837 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
840 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
845 while (pos < previous + start_shift) {
846 if (!(pos += PL_screamnext[pos]))
851 register const unsigned char *s, *x;
852 if (pos >= stop_pos) break;
853 if (big[pos] != first)
855 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
861 if (s == littleend) {
863 if (!last) return (char *)(big+pos);
866 } while ( pos += PL_screamnext[pos] );
868 return (char *)(big+(*old_posp));
870 if (!SvTAIL(littlestr) || (end_shift > 0))
872 /* Ignore the trailing "\n". This code is not microoptimized */
873 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
874 stop_pos = littleend - little; /* Actual littlestr len */
879 && ((stop_pos == 1) ||
880 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
886 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
888 register const U8 *a = (const U8 *)s1;
889 register const U8 *b = (const U8 *)s2;
892 PERL_ARGS_ASSERT_IBCMP;
895 if (*a != *b && *a != PL_fold[*b])
903 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
906 register const U8 *a = (const U8 *)s1;
907 register const U8 *b = (const U8 *)s2;
910 PERL_ARGS_ASSERT_IBCMP_LOCALE;
913 if (*a != *b && *a != PL_fold_locale[*b])
920 /* copy a string to a safe spot */
923 =head1 Memory Management
927 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
928 string which is a duplicate of C<pv>. The size of the string is
929 determined by C<strlen()>. The memory allocated for the new string can
930 be freed with the C<Safefree()> function.
936 Perl_savepv(pTHX_ const char *pv)
943 const STRLEN pvlen = strlen(pv)+1;
944 Newx(newaddr, pvlen, char);
945 return (char*)memcpy(newaddr, pv, pvlen);
949 /* same thing but with a known length */
954 Perl's version of what C<strndup()> would be if it existed. Returns a
955 pointer to a newly allocated string which is a duplicate of the first
956 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
957 the new string can be freed with the C<Safefree()> function.
963 Perl_savepvn(pTHX_ const char *pv, register I32 len)
965 register char *newaddr;
968 Newx(newaddr,len+1,char);
969 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
971 /* might not be null terminated */
973 return (char *) CopyD(pv,newaddr,len,char);
976 return (char *) ZeroD(newaddr,len+1,char);
981 =for apidoc savesharedpv
983 A version of C<savepv()> which allocates the duplicate string in memory
984 which is shared between threads.
989 Perl_savesharedpv(pTHX_ const char *pv)
991 register char *newaddr;
996 pvlen = strlen(pv)+1;
997 newaddr = (char*)PerlMemShared_malloc(pvlen);
999 return write_no_mem();
1001 return (char*)memcpy(newaddr, pv, pvlen);
1005 =for apidoc savesharedpvn
1007 A version of C<savepvn()> which allocates the duplicate string in memory
1008 which is shared between threads. (With the specific difference that a NULL
1009 pointer is not acceptable)
1014 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1016 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
1018 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1021 return write_no_mem();
1023 newaddr[len] = '\0';
1024 return (char*)memcpy(newaddr, pv, len);
1028 =for apidoc savesvpv
1030 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1031 the passed in SV using C<SvPV()>
1037 Perl_savesvpv(pTHX_ SV *sv)
1040 const char * const pv = SvPV_const(sv, len);
1041 register char *newaddr;
1043 PERL_ARGS_ASSERT_SAVESVPV;
1046 Newx(newaddr,len,char);
1047 return (char *) CopyD(pv,newaddr,len,char);
1051 /* the SV for Perl_form() and mess() is not kept in an arena */
1061 return newSVpvs_flags("", SVs_TEMP);
1066 /* Create as PVMG now, to avoid any upgrading later */
1068 Newxz(any, 1, XPVMG);
1069 SvFLAGS(sv) = SVt_PVMG;
1070 SvANY(sv) = (void*)any;
1072 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1077 #if defined(PERL_IMPLICIT_CONTEXT)
1079 Perl_form_nocontext(const char* pat, ...)
1084 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
1085 va_start(args, pat);
1086 retval = vform(pat, &args);
1090 #endif /* PERL_IMPLICIT_CONTEXT */
1093 =head1 Miscellaneous Functions
1096 Takes a sprintf-style format pattern and conventional
1097 (non-SV) arguments and returns the formatted string.
1099 (char *) Perl_form(pTHX_ const char* pat, ...)
1101 can be used any place a string (char *) is required:
1103 char * s = Perl_form("%d.%d",major,minor);
1105 Uses a single private buffer so if you want to format several strings you
1106 must explicitly copy the earlier strings away (and free the copies when you
1113 Perl_form(pTHX_ const char* pat, ...)
1117 PERL_ARGS_ASSERT_FORM;
1118 va_start(args, pat);
1119 retval = vform(pat, &args);
1125 Perl_vform(pTHX_ const char *pat, va_list *args)
1127 SV * const sv = mess_alloc();
1128 PERL_ARGS_ASSERT_VFORM;
1129 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1133 #if defined(PERL_IMPLICIT_CONTEXT)
1135 Perl_mess_nocontext(const char *pat, ...)
1140 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
1141 va_start(args, pat);
1142 retval = vmess(pat, &args);
1146 #endif /* PERL_IMPLICIT_CONTEXT */
1149 Perl_mess(pTHX_ const char *pat, ...)
1153 PERL_ARGS_ASSERT_MESS;
1154 va_start(args, pat);
1155 retval = vmess(pat, &args);
1161 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1164 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1166 PERL_ARGS_ASSERT_CLOSEST_COP;
1168 if (!o || o == PL_op)
1171 if (o->op_flags & OPf_KIDS) {
1173 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1176 /* If the OP_NEXTSTATE has been optimised away we can still use it
1177 * the get the file and line number. */
1179 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1180 cop = (const COP *)kid;
1182 /* Keep searching, and return when we've found something. */
1184 new_cop = closest_cop(cop, kid);
1190 /* Nothing found. */
1196 Perl_vmess(pTHX_ const char *pat, va_list *args)
1199 SV * const sv = mess_alloc();
1201 PERL_ARGS_ASSERT_VMESS;
1203 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1204 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1206 * Try and find the file and line for PL_op. This will usually be
1207 * PL_curcop, but it might be a cop that has been optimised away. We
1208 * can try to find such a cop by searching through the optree starting
1209 * from the sibling of PL_curcop.
1212 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1217 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1218 OutCopFILE(cop), (IV)CopLINE(cop));
1219 /* Seems that GvIO() can be untrustworthy during global destruction. */
1220 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1221 && IoLINES(GvIOp(PL_last_in_gv)))
1223 const bool line_mode = (RsSIMPLE(PL_rs) &&
1224 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1225 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1226 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1227 line_mode ? "line" : "chunk",
1228 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1231 sv_catpvs(sv, " during global destruction");
1232 sv_catpvs(sv, ".\n");
1238 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1244 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1246 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1247 && (io = GvIO(PL_stderrgv))
1248 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
1255 SAVESPTR(PL_stderrgv);
1258 PUSHSTACKi(PERLSI_MAGIC);
1262 PUSHs(SvTIED_obj(MUTABLE_SV(io), mg));
1263 mPUSHp(message, msglen);
1265 call_method("PRINT", G_SCALAR);
1273 /* SFIO can really mess with your errno */
1274 const int e = errno;
1276 PerlIO * const serr = Perl_error_log;
1278 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1279 (void)PerlIO_flush(serr);
1286 /* Common code used by vcroak, vdie, vwarn and vwarner */
1289 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1295 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1296 /* sv_2cv might call Perl_croak() or Perl_warner() */
1297 SV * const oldhook = *hook;
1304 cv = sv_2cv(oldhook, &stash, &gv, 0);
1306 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1316 if (warn || message) {
1317 msg = newSVpvn_flags(message, msglen, utf8);
1325 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1329 call_sv(MUTABLE_SV(cv), G_DISCARD);
1338 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1342 const char *message;
1345 SV * const msv = vmess(pat, args);
1346 if (PL_errors && SvCUR(PL_errors)) {
1347 sv_catsv(PL_errors, msv);
1348 message = SvPV_const(PL_errors, *msglen);
1349 SvCUR_set(PL_errors, 0);
1352 message = SvPV_const(msv,*msglen);
1353 *utf8 = SvUTF8(msv);
1360 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1366 Perl_vdie(pTHX_ const char* pat, va_list *args)
1369 const char *message;
1370 const int was_in_eval = PL_in_eval;
1374 message = vdie_croak_common(pat, args, &msglen, &utf8);
1376 PL_restartop = die_where(message, msglen);
1377 SvFLAGS(ERRSV) |= utf8;
1378 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1380 return PL_restartop;
1383 #if defined(PERL_IMPLICIT_CONTEXT)
1385 Perl_die_nocontext(const char* pat, ...)
1390 PERL_ARGS_ASSERT_DIE_NOCONTEXT;
1391 va_start(args, pat);
1392 o = vdie(pat, &args);
1396 #endif /* PERL_IMPLICIT_CONTEXT */
1399 Perl_die(pTHX_ const char* pat, ...)
1403 va_start(args, pat);
1404 o = vdie(pat, &args);
1410 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1413 const char *message;
1417 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1420 PL_restartop = die_where(message, msglen);
1421 SvFLAGS(ERRSV) |= utf8;
1425 message = SvPVx_const(ERRSV, msglen);
1427 write_to_stderr(message, msglen);
1431 #if defined(PERL_IMPLICIT_CONTEXT)
1433 Perl_croak_nocontext(const char *pat, ...)
1437 va_start(args, pat);
1442 #endif /* PERL_IMPLICIT_CONTEXT */
1445 =head1 Warning and Dieing
1449 This is the XSUB-writer's interface to Perl's C<die> function.
1450 Normally call this function the same way you call the C C<printf>
1451 function. Calling C<croak> returns control directly to Perl,
1452 sidestepping the normal C order of execution. See C<warn>.
1454 If you want to throw an exception object, assign the object to
1455 C<$@> and then pass C<NULL> to croak():
1457 errsv = get_sv("@", TRUE);
1458 sv_setsv(errsv, exception_object);
1465 Perl_croak(pTHX_ const char *pat, ...)
1468 va_start(args, pat);
1475 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1479 SV * const msv = vmess(pat, args);
1480 const I32 utf8 = SvUTF8(msv);
1481 const char * const message = SvPV_const(msv, msglen);
1483 PERL_ARGS_ASSERT_VWARN;
1486 if (vdie_common(message, msglen, utf8, TRUE))
1490 write_to_stderr(message, msglen);
1493 #if defined(PERL_IMPLICIT_CONTEXT)
1495 Perl_warn_nocontext(const char *pat, ...)
1499 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1500 va_start(args, pat);
1504 #endif /* PERL_IMPLICIT_CONTEXT */
1509 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1510 function the same way you call the C C<printf> function. See C<croak>.
1516 Perl_warn(pTHX_ const char *pat, ...)
1519 PERL_ARGS_ASSERT_WARN;
1520 va_start(args, pat);
1525 #if defined(PERL_IMPLICIT_CONTEXT)
1527 Perl_warner_nocontext(U32 err, const char *pat, ...)
1531 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1532 va_start(args, pat);
1533 vwarner(err, pat, &args);
1536 #endif /* PERL_IMPLICIT_CONTEXT */
1539 Perl_warner(pTHX_ U32 err, const char* pat,...)
1542 PERL_ARGS_ASSERT_WARNER;
1543 va_start(args, pat);
1544 vwarner(err, pat, &args);
1549 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1552 PERL_ARGS_ASSERT_VWARNER;
1553 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1554 SV * const msv = vmess(pat, args);
1556 const char * const message = SvPV_const(msv, msglen);
1557 const I32 utf8 = SvUTF8(msv);
1561 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1564 PL_restartop = die_where(message, msglen);
1565 SvFLAGS(ERRSV) |= utf8;
1568 write_to_stderr(message, msglen);
1572 Perl_vwarn(aTHX_ pat, args);
1576 /* implements the ckWARN? macros */
1579 Perl_ckwarn(pTHX_ U32 w)
1585 && PL_curcop->cop_warnings != pWARN_NONE
1587 PL_curcop->cop_warnings == pWARN_ALL
1588 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1589 || (unpackWARN2(w) &&
1590 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1591 || (unpackWARN3(w) &&
1592 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1593 || (unpackWARN4(w) &&
1594 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1599 isLEXWARN_off && PL_dowarn & G_WARN_ON
1604 /* implements the ckWARN?_d macro */
1607 Perl_ckwarn_d(pTHX_ U32 w)
1612 || PL_curcop->cop_warnings == pWARN_ALL
1614 PL_curcop->cop_warnings != pWARN_NONE
1616 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1617 || (unpackWARN2(w) &&
1618 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1619 || (unpackWARN3(w) &&
1620 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1621 || (unpackWARN4(w) &&
1622 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1628 /* Set buffer=NULL to get a new one. */
1630 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1632 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1633 PERL_UNUSED_CONTEXT;
1634 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1637 (specialWARN(buffer) ?
1638 PerlMemShared_malloc(len_wanted) :
1639 PerlMemShared_realloc(buffer, len_wanted));
1641 Copy(bits, (buffer + 1), size, char);
1645 /* since we've already done strlen() for both nam and val
1646 * we can use that info to make things faster than
1647 * sprintf(s, "%s=%s", nam, val)
1649 #define my_setenv_format(s, nam, nlen, val, vlen) \
1650 Copy(nam, s, nlen, char); \
1652 Copy(val, s+(nlen+1), vlen, char); \
1653 *(s+(nlen+1+vlen)) = '\0'
1655 #ifdef USE_ENVIRON_ARRAY
1656 /* VMS' my_setenv() is in vms.c */
1657 #if !defined(WIN32) && !defined(NETWARE)
1659 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1663 /* only parent thread can modify process environment */
1664 if (PL_curinterp == aTHX)
1667 #ifndef PERL_USE_SAFE_PUTENV
1668 if (!PL_use_safe_putenv) {
1669 /* most putenv()s leak, so we manipulate environ directly */
1670 register I32 i=setenv_getix(nam); /* where does it go? */
1673 if (environ == PL_origenviron) { /* need we copy environment? */
1679 while (environ[max])
1681 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1682 for (j=0; j<max; j++) { /* copy environment */
1683 const int len = strlen(environ[j]);
1684 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1685 Copy(environ[j], tmpenv[j], len+1, char);
1688 environ = tmpenv; /* tell exec where it is now */
1691 safesysfree(environ[i]);
1692 while (environ[i]) {
1693 environ[i] = environ[i+1];
1698 if (!environ[i]) { /* does not exist yet */
1699 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1700 environ[i+1] = NULL; /* make sure it's null terminated */
1703 safesysfree(environ[i]);
1707 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1708 /* all that work just for this */
1709 my_setenv_format(environ[i], nam, nlen, val, vlen);
1712 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1713 # if defined(HAS_UNSETENV)
1715 (void)unsetenv(nam);
1717 (void)setenv(nam, val, 1);
1719 # else /* ! HAS_UNSETENV */
1720 (void)setenv(nam, val, 1);
1721 # endif /* HAS_UNSETENV */
1723 # if defined(HAS_UNSETENV)
1725 (void)unsetenv(nam);
1727 const int nlen = strlen(nam);
1728 const int vlen = strlen(val);
1729 char * const new_env =
1730 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1731 my_setenv_format(new_env, nam, nlen, val, vlen);
1732 (void)putenv(new_env);
1734 # else /* ! HAS_UNSETENV */
1736 const int nlen = strlen(nam);
1742 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1743 /* all that work just for this */
1744 my_setenv_format(new_env, nam, nlen, val, vlen);
1745 (void)putenv(new_env);
1746 # endif /* HAS_UNSETENV */
1747 # endif /* __CYGWIN__ */
1748 #ifndef PERL_USE_SAFE_PUTENV
1754 #else /* WIN32 || NETWARE */
1757 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1760 register char *envstr;
1761 const int nlen = strlen(nam);
1768 Newx(envstr, nlen+vlen+2, char);
1769 my_setenv_format(envstr, nam, nlen, val, vlen);
1770 (void)PerlEnv_putenv(envstr);
1774 #endif /* WIN32 || NETWARE */
1778 Perl_setenv_getix(pTHX_ const char *nam)
1781 register const I32 len = strlen(nam);
1783 PERL_ARGS_ASSERT_SETENV_GETIX;
1784 PERL_UNUSED_CONTEXT;
1786 for (i = 0; environ[i]; i++) {
1789 strnicmp(environ[i],nam,len) == 0
1791 strnEQ(environ[i],nam,len)
1793 && environ[i][len] == '=')
1794 break; /* strnEQ must come first to avoid */
1795 } /* potential SEGV's */
1798 #endif /* !PERL_MICRO */
1800 #endif /* !VMS && !EPOC*/
1802 #ifdef UNLINK_ALL_VERSIONS
1804 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1808 PERL_ARGS_ASSERT_UNLNK;
1810 while (PerlLIO_unlink(f) >= 0)
1812 return retries ? 0 : -1;
1816 /* this is a drop-in replacement for bcopy() */
1817 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1819 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1821 char * const retval = to;
1823 PERL_ARGS_ASSERT_MY_BCOPY;
1825 if (from - to >= 0) {
1833 *(--to) = *(--from);
1839 /* this is a drop-in replacement for memset() */
1842 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1844 char * const retval = loc;
1846 PERL_ARGS_ASSERT_MY_MEMSET;
1854 /* this is a drop-in replacement for bzero() */
1855 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1857 Perl_my_bzero(register char *loc, register I32 len)
1859 char * const retval = loc;
1861 PERL_ARGS_ASSERT_MY_BZERO;
1869 /* this is a drop-in replacement for memcmp() */
1870 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1872 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1874 register const U8 *a = (const U8 *)s1;
1875 register const U8 *b = (const U8 *)s2;
1878 PERL_ARGS_ASSERT_MY_MEMCMP;
1881 if ((tmp = *a++ - *b++))
1886 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1889 /* This vsprintf replacement should generally never get used, since
1890 vsprintf was available in both System V and BSD 2.11. (There may
1891 be some cross-compilation or embedded set-ups where it is needed,
1894 If you encounter a problem in this function, it's probably a symptom
1895 that Configure failed to detect your system's vprintf() function.
1896 See the section on "item vsprintf" in the INSTALL file.
1898 This version may compile on systems with BSD-ish <stdio.h>,
1899 but probably won't on others.
1902 #ifdef USE_CHAR_VSPRINTF
1907 vsprintf(char *dest, const char *pat, void *args)
1911 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1912 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1913 FILE_cnt(&fakebuf) = 32767;
1915 /* These probably won't compile -- If you really need
1916 this, you'll have to figure out some other method. */
1917 fakebuf._ptr = dest;
1918 fakebuf._cnt = 32767;
1923 fakebuf._flag = _IOWRT|_IOSTRG;
1924 _doprnt(pat, args, &fakebuf); /* what a kludge */
1925 #if defined(STDIO_PTR_LVALUE)
1926 *(FILE_ptr(&fakebuf)++) = '\0';
1928 /* PerlIO has probably #defined away fputc, but we want it here. */
1930 # undef fputc /* XXX Should really restore it later */
1932 (void)fputc('\0', &fakebuf);
1934 #ifdef USE_CHAR_VSPRINTF
1937 return 0; /* perl doesn't use return value */
1941 #endif /* HAS_VPRINTF */
1944 #if BYTEORDER != 0x4321
1946 Perl_my_swap(pTHX_ short s)
1948 #if (BYTEORDER & 1) == 0
1951 result = ((s & 255) << 8) + ((s >> 8) & 255);
1959 Perl_my_htonl(pTHX_ long l)
1963 char c[sizeof(long)];
1966 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1967 #if BYTEORDER == 0x12345678
1970 u.c[0] = (l >> 24) & 255;
1971 u.c[1] = (l >> 16) & 255;
1972 u.c[2] = (l >> 8) & 255;
1976 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1977 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1982 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1983 u.c[o & 0xf] = (l >> s) & 255;
1991 Perl_my_ntohl(pTHX_ long l)
1995 char c[sizeof(long)];
1998 #if BYTEORDER == 0x1234
1999 u.c[0] = (l >> 24) & 255;
2000 u.c[1] = (l >> 16) & 255;
2001 u.c[2] = (l >> 8) & 255;
2005 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
2006 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
2013 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2014 l |= (u.c[o & 0xf] & 255) << s;
2021 #endif /* BYTEORDER != 0x4321 */
2025 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2026 * If these functions are defined,
2027 * the BYTEORDER is neither 0x1234 nor 0x4321.
2028 * However, this is not assumed.
2032 #define HTOLE(name,type) \
2034 name (register type n) \
2038 char c[sizeof(type)]; \
2041 register U32 s = 0; \
2042 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2043 u.c[i] = (n >> s) & 0xFF; \
2048 #define LETOH(name,type) \
2050 name (register type n) \
2054 char c[sizeof(type)]; \
2057 register U32 s = 0; \
2060 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2061 n |= ((type)(u.c[i] & 0xFF)) << s; \
2067 * Big-endian byte order functions.
2070 #define HTOBE(name,type) \
2072 name (register type n) \
2076 char c[sizeof(type)]; \
2079 register U32 s = 8*(sizeof(u.c)-1); \
2080 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2081 u.c[i] = (n >> s) & 0xFF; \
2086 #define BETOH(name,type) \
2088 name (register type n) \
2092 char c[sizeof(type)]; \
2095 register U32 s = 8*(sizeof(u.c)-1); \
2098 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2099 n |= ((type)(u.c[i] & 0xFF)) << s; \
2105 * If we just can't do it...
2108 #define NOT_AVAIL(name,type) \
2110 name (register type n) \
2112 Perl_croak_nocontext(#name "() not available"); \
2113 return n; /* not reached */ \
2117 #if defined(HAS_HTOVS) && !defined(htovs)
2120 #if defined(HAS_HTOVL) && !defined(htovl)
2123 #if defined(HAS_VTOHS) && !defined(vtohs)
2126 #if defined(HAS_VTOHL) && !defined(vtohl)
2130 #ifdef PERL_NEED_MY_HTOLE16
2132 HTOLE(Perl_my_htole16,U16)
2134 NOT_AVAIL(Perl_my_htole16,U16)
2137 #ifdef PERL_NEED_MY_LETOH16
2139 LETOH(Perl_my_letoh16,U16)
2141 NOT_AVAIL(Perl_my_letoh16,U16)
2144 #ifdef PERL_NEED_MY_HTOBE16
2146 HTOBE(Perl_my_htobe16,U16)
2148 NOT_AVAIL(Perl_my_htobe16,U16)
2151 #ifdef PERL_NEED_MY_BETOH16
2153 BETOH(Perl_my_betoh16,U16)
2155 NOT_AVAIL(Perl_my_betoh16,U16)
2159 #ifdef PERL_NEED_MY_HTOLE32
2161 HTOLE(Perl_my_htole32,U32)
2163 NOT_AVAIL(Perl_my_htole32,U32)
2166 #ifdef PERL_NEED_MY_LETOH32
2168 LETOH(Perl_my_letoh32,U32)
2170 NOT_AVAIL(Perl_my_letoh32,U32)
2173 #ifdef PERL_NEED_MY_HTOBE32
2175 HTOBE(Perl_my_htobe32,U32)
2177 NOT_AVAIL(Perl_my_htobe32,U32)
2180 #ifdef PERL_NEED_MY_BETOH32
2182 BETOH(Perl_my_betoh32,U32)
2184 NOT_AVAIL(Perl_my_betoh32,U32)
2188 #ifdef PERL_NEED_MY_HTOLE64
2190 HTOLE(Perl_my_htole64,U64)
2192 NOT_AVAIL(Perl_my_htole64,U64)
2195 #ifdef PERL_NEED_MY_LETOH64
2197 LETOH(Perl_my_letoh64,U64)
2199 NOT_AVAIL(Perl_my_letoh64,U64)
2202 #ifdef PERL_NEED_MY_HTOBE64
2204 HTOBE(Perl_my_htobe64,U64)
2206 NOT_AVAIL(Perl_my_htobe64,U64)
2209 #ifdef PERL_NEED_MY_BETOH64
2211 BETOH(Perl_my_betoh64,U64)
2213 NOT_AVAIL(Perl_my_betoh64,U64)
2217 #ifdef PERL_NEED_MY_HTOLES
2218 HTOLE(Perl_my_htoles,short)
2220 #ifdef PERL_NEED_MY_LETOHS
2221 LETOH(Perl_my_letohs,short)
2223 #ifdef PERL_NEED_MY_HTOBES
2224 HTOBE(Perl_my_htobes,short)
2226 #ifdef PERL_NEED_MY_BETOHS
2227 BETOH(Perl_my_betohs,short)
2230 #ifdef PERL_NEED_MY_HTOLEI
2231 HTOLE(Perl_my_htolei,int)
2233 #ifdef PERL_NEED_MY_LETOHI
2234 LETOH(Perl_my_letohi,int)
2236 #ifdef PERL_NEED_MY_HTOBEI
2237 HTOBE(Perl_my_htobei,int)
2239 #ifdef PERL_NEED_MY_BETOHI
2240 BETOH(Perl_my_betohi,int)
2243 #ifdef PERL_NEED_MY_HTOLEL
2244 HTOLE(Perl_my_htolel,long)
2246 #ifdef PERL_NEED_MY_LETOHL
2247 LETOH(Perl_my_letohl,long)
2249 #ifdef PERL_NEED_MY_HTOBEL
2250 HTOBE(Perl_my_htobel,long)
2252 #ifdef PERL_NEED_MY_BETOHL
2253 BETOH(Perl_my_betohl,long)
2257 Perl_my_swabn(void *ptr, int n)
2259 register char *s = (char *)ptr;
2260 register char *e = s + (n-1);
2263 PERL_ARGS_ASSERT_MY_SWABN;
2265 for (n /= 2; n > 0; s++, e--, n--) {
2273 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2275 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2278 register I32 This, that;
2284 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2286 PERL_FLUSHALL_FOR_CHILD;
2287 This = (*mode == 'w');
2291 taint_proper("Insecure %s%s", "EXEC");
2293 if (PerlProc_pipe(p) < 0)
2295 /* Try for another pipe pair for error return */
2296 if (PerlProc_pipe(pp) >= 0)
2298 while ((pid = PerlProc_fork()) < 0) {
2299 if (errno != EAGAIN) {
2300 PerlLIO_close(p[This]);
2301 PerlLIO_close(p[that]);
2303 PerlLIO_close(pp[0]);
2304 PerlLIO_close(pp[1]);
2316 /* Close parent's end of error status pipe (if any) */
2318 PerlLIO_close(pp[0]);
2319 #if defined(HAS_FCNTL) && defined(F_SETFD)
2320 /* Close error pipe automatically if exec works */
2321 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2324 /* Now dup our end of _the_ pipe to right position */
2325 if (p[THIS] != (*mode == 'r')) {
2326 PerlLIO_dup2(p[THIS], *mode == 'r');
2327 PerlLIO_close(p[THIS]);
2328 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2329 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2332 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2333 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2334 /* No automatic close - do it by hand */
2341 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2347 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2353 do_execfree(); /* free any memory malloced by child on fork */
2355 PerlLIO_close(pp[1]);
2356 /* Keep the lower of the two fd numbers */
2357 if (p[that] < p[This]) {
2358 PerlLIO_dup2(p[This], p[that]);
2359 PerlLIO_close(p[This]);
2363 PerlLIO_close(p[that]); /* close child's end of pipe */
2366 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2368 SvUPGRADE(sv,SVt_IV);
2370 PL_forkprocess = pid;
2371 /* If we managed to get status pipe check for exec fail */
2372 if (did_pipes && pid > 0) {
2377 while (n < sizeof(int)) {
2378 n1 = PerlLIO_read(pp[0],
2379 (void*)(((char*)&errkid)+n),
2385 PerlLIO_close(pp[0]);
2387 if (n) { /* Error */
2389 PerlLIO_close(p[This]);
2390 if (n != sizeof(int))
2391 Perl_croak(aTHX_ "panic: kid popen errno read");
2393 pid2 = wait4pid(pid, &status, 0);
2394 } while (pid2 == -1 && errno == EINTR);
2395 errno = errkid; /* Propagate errno from kid */
2400 PerlLIO_close(pp[0]);
2401 return PerlIO_fdopen(p[This], mode);
2403 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2404 return my_syspopen4(aTHX_ NULL, mode, n, args);
2406 Perl_croak(aTHX_ "List form of piped open not implemented");
2407 return (PerlIO *) NULL;
2412 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2413 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(__LIBCATAMOUNT__)
2415 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2419 register I32 This, that;
2422 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2426 PERL_ARGS_ASSERT_MY_POPEN;
2428 PERL_FLUSHALL_FOR_CHILD;
2431 return my_syspopen(aTHX_ cmd,mode);
2434 This = (*mode == 'w');
2436 if (doexec && PL_tainting) {
2438 taint_proper("Insecure %s%s", "EXEC");
2440 if (PerlProc_pipe(p) < 0)
2442 if (doexec && PerlProc_pipe(pp) >= 0)
2444 while ((pid = PerlProc_fork()) < 0) {
2445 if (errno != EAGAIN) {
2446 PerlLIO_close(p[This]);
2447 PerlLIO_close(p[that]);
2449 PerlLIO_close(pp[0]);
2450 PerlLIO_close(pp[1]);
2453 Perl_croak(aTHX_ "Can't fork");
2466 PerlLIO_close(pp[0]);
2467 #if defined(HAS_FCNTL) && defined(F_SETFD)
2468 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2471 if (p[THIS] != (*mode == 'r')) {
2472 PerlLIO_dup2(p[THIS], *mode == 'r');
2473 PerlLIO_close(p[THIS]);
2474 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2475 PerlLIO_close(p[THAT]);
2478 PerlLIO_close(p[THAT]);
2481 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2488 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2493 /* may or may not use the shell */
2494 do_exec3(cmd, pp[1], did_pipes);
2497 #endif /* defined OS2 */
2499 #ifdef PERLIO_USING_CRLF
2500 /* Since we circumvent IO layers when we manipulate low-level
2501 filedescriptors directly, need to manually switch to the
2502 default, binary, low-level mode; see PerlIOBuf_open(). */
2503 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2506 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2507 SvREADONLY_off(GvSV(tmpgv));
2508 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2509 SvREADONLY_on(GvSV(tmpgv));
2511 #ifdef THREADS_HAVE_PIDS
2512 PL_ppid = (IV)getppid();
2515 #ifdef PERL_USES_PL_PIDSTATUS
2516 hv_clear(PL_pidstatus); /* we have no children */
2522 do_execfree(); /* free any memory malloced by child on vfork */
2524 PerlLIO_close(pp[1]);
2525 if (p[that] < p[This]) {
2526 PerlLIO_dup2(p[This], p[that]);
2527 PerlLIO_close(p[This]);
2531 PerlLIO_close(p[that]);
2534 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
2716 #ifdef MACOS_TRADITIONAL
2717 /* We don't want restart behavior on MacOS */
2722 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2725 struct sigaction act, oact;
2728 /* only "parent" interpreter can diddle signals */
2729 if (PL_curinterp != aTHX)
2730 return (Sighandler_t) SIG_ERR;
2733 act.sa_handler = (void(*)(int))handler;
2734 sigemptyset(&act.sa_mask);
2737 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2738 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2740 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2741 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2742 act.sa_flags |= SA_NOCLDWAIT;
2744 if (sigaction(signo, &act, &oact) == -1)
2745 return (Sighandler_t) SIG_ERR;
2747 return (Sighandler_t) oact.sa_handler;
2751 Perl_rsignal_state(pTHX_ int signo)
2753 struct sigaction oact;
2754 PERL_UNUSED_CONTEXT;
2756 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2757 return (Sighandler_t) SIG_ERR;
2759 return (Sighandler_t) oact.sa_handler;
2763 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2766 struct sigaction act;
2768 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2771 /* only "parent" interpreter can diddle signals */
2772 if (PL_curinterp != aTHX)
2776 act.sa_handler = (void(*)(int))handler;
2777 sigemptyset(&act.sa_mask);
2780 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2781 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2783 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2784 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2785 act.sa_flags |= SA_NOCLDWAIT;
2787 return sigaction(signo, &act, save);
2791 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2795 /* only "parent" interpreter can diddle signals */
2796 if (PL_curinterp != aTHX)
2800 return sigaction(signo, save, (struct sigaction *)NULL);
2803 #else /* !HAS_SIGACTION */
2806 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2808 #if defined(USE_ITHREADS) && !defined(WIN32)
2809 /* only "parent" interpreter can diddle signals */
2810 if (PL_curinterp != aTHX)
2811 return (Sighandler_t) SIG_ERR;
2814 return PerlProc_signal(signo, handler);
2825 Perl_rsignal_state(pTHX_ int signo)
2828 Sighandler_t oldsig;
2830 #if defined(USE_ITHREADS) && !defined(WIN32)
2831 /* only "parent" interpreter can diddle signals */
2832 if (PL_curinterp != aTHX)
2833 return (Sighandler_t) SIG_ERR;
2837 oldsig = PerlProc_signal(signo, sig_trap);
2838 PerlProc_signal(signo, oldsig);
2840 PerlProc_kill(PerlProc_getpid(), signo);
2845 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2847 #if defined(USE_ITHREADS) && !defined(WIN32)
2848 /* only "parent" interpreter can diddle signals */
2849 if (PL_curinterp != aTHX)
2852 *save = PerlProc_signal(signo, handler);
2853 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2857 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2859 #if defined(USE_ITHREADS) && !defined(WIN32)
2860 /* only "parent" interpreter can diddle signals */
2861 if (PL_curinterp != aTHX)
2864 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2867 #endif /* !HAS_SIGACTION */
2868 #endif /* !PERL_MICRO */
2870 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2871 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(__LIBCATAMOUNT__)
2873 Perl_my_pclose(pTHX_ PerlIO *ptr)
2876 Sigsave_t hstat, istat, qstat;
2882 int saved_errno = 0;
2884 int saved_win32_errno;
2888 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2890 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2892 *svp = &PL_sv_undef;
2894 if (pid == -1) { /* Opened by popen. */
2895 return my_syspclose(ptr);
2898 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2899 saved_errno = errno;
2901 saved_win32_errno = GetLastError();
2905 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2908 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2909 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2910 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2913 pid2 = wait4pid(pid, &status, 0);
2914 } while (pid2 == -1 && errno == EINTR);
2916 rsignal_restore(SIGHUP, &hstat);
2917 rsignal_restore(SIGINT, &istat);
2918 rsignal_restore(SIGQUIT, &qstat);
2921 SETERRNO(saved_errno, 0);
2924 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2927 #if defined(__LIBCATAMOUNT__)
2929 Perl_my_pclose(pTHX_ PerlIO *ptr)
2934 #endif /* !DOSISH */
2936 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL) && !defined(__LIBCATAMOUNT__)
2938 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2942 PERL_ARGS_ASSERT_WAIT4PID;
2945 #ifdef PERL_USES_PL_PIDSTATUS
2948 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2949 pid, rather than a string form. */
2950 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2951 if (svp && *svp != &PL_sv_undef) {
2952 *statusp = SvIVX(*svp);
2953 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2961 hv_iterinit(PL_pidstatus);
2962 if ((entry = hv_iternext(PL_pidstatus))) {
2963 SV * const sv = hv_iterval(PL_pidstatus,entry);
2965 const char * const spid = hv_iterkey(entry,&len);
2967 assert (len == sizeof(Pid_t));
2968 memcpy((char *)&pid, spid, len);
2969 *statusp = SvIVX(sv);
2970 /* The hash iterator is currently on this entry, so simply
2971 calling hv_delete would trigger the lazy delete, which on
2972 aggregate does more work, beacuse next call to hv_iterinit()
2973 would spot the flag, and have to call the delete routine,
2974 while in the meantime any new entries can't re-use that
2976 hv_iterinit(PL_pidstatus);
2977 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2984 # ifdef HAS_WAITPID_RUNTIME
2985 if (!HAS_WAITPID_RUNTIME)
2988 result = PerlProc_waitpid(pid,statusp,flags);
2991 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2992 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2995 #ifdef PERL_USES_PL_PIDSTATUS
2996 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
3001 Perl_croak(aTHX_ "Can't do waitpid with flags");
3003 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
3004 pidgone(result,*statusp);
3010 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
3013 if (result < 0 && errno == EINTR) {
3015 errno = EINTR; /* reset in case a signal handler changed $! */
3019 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
3021 #ifdef PERL_USES_PL_PIDSTATUS
3023 Perl_pidgone(pTHX_ Pid_t pid, int status)
3027 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3028 SvUPGRADE(sv,SVt_IV);
3029 SvIV_set(sv, status);
3034 #if defined(atarist) || defined(OS2) || defined(EPOC)
3037 int /* Cannot prototype with I32
3039 my_syspclose(PerlIO *ptr)
3042 Perl_my_pclose(pTHX_ PerlIO *ptr)
3045 /* Needs work for PerlIO ! */
3046 FILE * const f = PerlIO_findFILE(ptr);
3047 const I32 result = pclose(f);
3048 PerlIO_releaseFILE(ptr,f);
3056 Perl_my_pclose(pTHX_ PerlIO *ptr)
3058 /* Needs work for PerlIO ! */
3059 FILE * const f = PerlIO_findFILE(ptr);
3060 I32 result = djgpp_pclose(f);
3061 result = (result << 8) & 0xff00;
3062 PerlIO_releaseFILE(ptr,f);
3068 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
3071 register const char * const frombase = from;
3072 PERL_UNUSED_CONTEXT;
3074 PERL_ARGS_ASSERT_REPEATCPY;
3077 register const char c = *from;
3082 while (count-- > 0) {
3083 for (todo = len; todo > 0; todo--) {
3092 Perl_same_dirent(pTHX_ const char *a, const char *b)
3094 char *fa = strrchr(a,'/');
3095 char *fb = strrchr(b,'/');
3098 SV * const tmpsv = sv_newmortal();
3100 PERL_ARGS_ASSERT_SAME_DIRENT;
3113 sv_setpvs(tmpsv, ".");
3115 sv_setpvn(tmpsv, a, fa - a);
3116 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3119 sv_setpvs(tmpsv, ".");
3121 sv_setpvn(tmpsv, b, fb - b);
3122 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3124 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3125 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3127 #endif /* !HAS_RENAME */
3130 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3131 const char *const *const search_ext, I32 flags)
3134 const char *xfound = NULL;
3135 char *xfailed = NULL;
3136 char tmpbuf[MAXPATHLEN];
3141 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3142 # define SEARCH_EXTS ".bat", ".cmd", NULL
3143 # define MAX_EXT_LEN 4
3146 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3147 # define MAX_EXT_LEN 4
3150 # define SEARCH_EXTS ".pl", ".com", NULL
3151 # define MAX_EXT_LEN 4
3153 /* additional extensions to try in each dir if scriptname not found */
3155 static const char *const exts[] = { SEARCH_EXTS };
3156 const char *const *const ext = search_ext ? search_ext : exts;
3157 int extidx = 0, i = 0;
3158 const char *curext = NULL;
3160 PERL_UNUSED_ARG(search_ext);
3161 # define MAX_EXT_LEN 0
3164 PERL_ARGS_ASSERT_FIND_SCRIPT;
3167 * If dosearch is true and if scriptname does not contain path
3168 * delimiters, search the PATH for scriptname.
3170 * If SEARCH_EXTS is also defined, will look for each
3171 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3172 * while searching the PATH.
3174 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3175 * proceeds as follows:
3176 * If DOSISH or VMSISH:
3177 * + look for ./scriptname{,.foo,.bar}
3178 * + search the PATH for scriptname{,.foo,.bar}
3181 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3182 * this will not look in '.' if it's not in the PATH)
3187 # ifdef ALWAYS_DEFTYPES
3188 len = strlen(scriptname);
3189 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3190 int idx = 0, deftypes = 1;
3193 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3196 int idx = 0, deftypes = 1;
3199 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3201 /* The first time through, just add SEARCH_EXTS to whatever we
3202 * already have, so we can check for default file types. */
3204 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3210 if ((strlen(tmpbuf) + strlen(scriptname)
3211 + MAX_EXT_LEN) >= sizeof tmpbuf)
3212 continue; /* don't search dir with too-long name */
3213 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3217 if (strEQ(scriptname, "-"))
3219 if (dosearch) { /* Look in '.' first. */
3220 const char *cur = scriptname;
3222 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3224 if (strEQ(ext[i++],curext)) {
3225 extidx = -1; /* already has an ext */
3230 DEBUG_p(PerlIO_printf(Perl_debug_log,
3231 "Looking for %s\n",cur));
3232 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3233 && !S_ISDIR(PL_statbuf.st_mode)) {
3241 if (cur == scriptname) {
3242 len = strlen(scriptname);
3243 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3245 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3248 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3249 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3254 #ifdef MACOS_TRADITIONAL
3255 if (dosearch && !strchr(scriptname, ':') &&
3256 (s = PerlEnv_getenv("Commands")))
3258 if (dosearch && !strchr(scriptname, '/')
3260 && !strchr(scriptname, '\\')
3262 && (s = PerlEnv_getenv("PATH")))
3267 bufend = s + strlen(s);
3268 while (s < bufend) {
3269 #ifdef MACOS_TRADITIONAL
3270 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3274 #if defined(atarist) || defined(DOSISH)
3279 && *s != ';'; len++, s++) {
3280 if (len < sizeof tmpbuf)
3283 if (len < sizeof tmpbuf)
3285 #else /* ! (atarist || DOSISH) */
3286 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3289 #endif /* ! (atarist || DOSISH) */
3290 #endif /* MACOS_TRADITIONAL */
3293 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3294 continue; /* don't search dir with too-long name */
3295 #ifdef MACOS_TRADITIONAL
3296 if (len && tmpbuf[len - 1] != ':')
3297 tmpbuf[len++] = ':';
3300 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3301 && tmpbuf[len - 1] != '/'
3302 && tmpbuf[len - 1] != '\\'
3305 tmpbuf[len++] = '/';
3306 if (len == 2 && tmpbuf[0] == '.')
3309 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3313 len = strlen(tmpbuf);
3314 if (extidx > 0) /* reset after previous loop */
3318 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3319 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3320 if (S_ISDIR(PL_statbuf.st_mode)) {
3324 } while ( retval < 0 /* not there */
3325 && extidx>=0 && ext[extidx] /* try an extension? */
3326 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3331 if (S_ISREG(PL_statbuf.st_mode)
3332 && cando(S_IRUSR,TRUE,&PL_statbuf)
3333 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3334 && cando(S_IXUSR,TRUE,&PL_statbuf)
3338 xfound = tmpbuf; /* bingo! */
3342 xfailed = savepv(tmpbuf);
3345 if (!xfound && !seen_dot && !xfailed &&
3346 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3347 || S_ISDIR(PL_statbuf.st_mode)))
3349 seen_dot = 1; /* Disable message. */
3351 if (flags & 1) { /* do or die? */
3352 Perl_croak(aTHX_ "Can't %s %s%s%s",
3353 (xfailed ? "execute" : "find"),
3354 (xfailed ? xfailed : scriptname),
3355 (xfailed ? "" : " on PATH"),
3356 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3361 scriptname = xfound;
3363 return (scriptname ? savepv(scriptname) : NULL);
3366 #ifndef PERL_GET_CONTEXT_DEFINED
3369 Perl_get_context(void)
3372 #if defined(USE_ITHREADS)
3373 # ifdef OLD_PTHREADS_API
3375 if (pthread_getspecific(PL_thr_key, &t))
3376 Perl_croak_nocontext("panic: pthread_getspecific");
3379 # ifdef I_MACH_CTHREADS
3380 return (void*)cthread_data(cthread_self());
3382 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3391 Perl_set_context(void *t)
3394 PERL_ARGS_ASSERT_SET_CONTEXT;
3395 #if defined(USE_ITHREADS)
3396 # ifdef I_MACH_CTHREADS
3397 cthread_set_data(cthread_self(), t);
3399 if (pthread_setspecific(PL_thr_key, t))
3400 Perl_croak_nocontext("panic: pthread_setspecific");
3407 #endif /* !PERL_GET_CONTEXT_DEFINED */
3409 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3418 Perl_get_op_names(pTHX)
3420 PERL_UNUSED_CONTEXT;
3421 return (char **)PL_op_name;
3425 Perl_get_op_descs(pTHX)
3427 PERL_UNUSED_CONTEXT;
3428 return (char **)PL_op_desc;
3432 Perl_get_no_modify(pTHX)
3434 PERL_UNUSED_CONTEXT;
3435 return PL_no_modify;
3439 Perl_get_opargs(pTHX)
3441 PERL_UNUSED_CONTEXT;
3442 return (U32 *)PL_opargs;
3446 Perl_get_ppaddr(pTHX)
3449 PERL_UNUSED_CONTEXT;
3450 return (PPADDR_t*)PL_ppaddr;
3453 #ifndef HAS_GETENV_LEN
3455 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3457 char * const env_trans = PerlEnv_getenv(env_elem);
3458 PERL_UNUSED_CONTEXT;
3459 PERL_ARGS_ASSERT_GETENV_LEN;
3461 *len = strlen(env_trans);
3468 Perl_get_vtbl(pTHX_ int vtbl_id)
3470 const MGVTBL* result;
3471 PERL_UNUSED_CONTEXT;
3475 result = &PL_vtbl_sv;
3478 result = &PL_vtbl_env;
3480 case want_vtbl_envelem:
3481 result = &PL_vtbl_envelem;
3484 result = &PL_vtbl_sig;
3486 case want_vtbl_sigelem:
3487 result = &PL_vtbl_sigelem;
3489 case want_vtbl_pack:
3490 result = &PL_vtbl_pack;
3492 case want_vtbl_packelem:
3493 result = &PL_vtbl_packelem;
3495 case want_vtbl_dbline:
3496 result = &PL_vtbl_dbline;
3499 result = &PL_vtbl_isa;
3501 case want_vtbl_isaelem:
3502 result = &PL_vtbl_isaelem;
3504 case want_vtbl_arylen:
3505 result = &PL_vtbl_arylen;
3507 case want_vtbl_mglob:
3508 result = &PL_vtbl_mglob;
3510 case want_vtbl_nkeys:
3511 result = &PL_vtbl_nkeys;
3513 case want_vtbl_taint:
3514 result = &PL_vtbl_taint;
3516 case want_vtbl_substr:
3517 result = &PL_vtbl_substr;
3520 result = &PL_vtbl_vec;
3523 result = &PL_vtbl_pos;
3526 result = &PL_vtbl_bm;
3529 result = &PL_vtbl_fm;
3531 case want_vtbl_uvar:
3532 result = &PL_vtbl_uvar;
3534 case want_vtbl_defelem:
3535 result = &PL_vtbl_defelem;
3537 case want_vtbl_regexp:
3538 result = &PL_vtbl_regexp;
3540 case want_vtbl_regdata:
3541 result = &PL_vtbl_regdata;
3543 case want_vtbl_regdatum:
3544 result = &PL_vtbl_regdatum;
3546 #ifdef USE_LOCALE_COLLATE
3547 case want_vtbl_collxfrm:
3548 result = &PL_vtbl_collxfrm;
3551 case want_vtbl_amagic:
3552 result = &PL_vtbl_amagic;
3554 case want_vtbl_amagicelem:
3555 result = &PL_vtbl_amagicelem;
3557 case want_vtbl_backref:
3558 result = &PL_vtbl_backref;
3560 case want_vtbl_utf8:
3561 result = &PL_vtbl_utf8;
3567 return (MGVTBL*)result;
3571 Perl_my_fflush_all(pTHX)
3573 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3574 return PerlIO_flush(NULL);
3576 # if defined(HAS__FWALK)
3577 extern int fflush(FILE *);
3578 /* undocumented, unprototyped, but very useful BSDism */
3579 extern void _fwalk(int (*)(FILE *));
3583 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3585 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3586 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3588 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3589 open_max = sysconf(_SC_OPEN_MAX);
3592 open_max = FOPEN_MAX;
3595 open_max = OPEN_MAX;
3606 for (i = 0; i < open_max; i++)
3607 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3608 STDIO_STREAM_ARRAY[i]._file < open_max &&
3609 STDIO_STREAM_ARRAY[i]._flag)
3610 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3614 SETERRNO(EBADF,RMS_IFI);
3621 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3623 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3625 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3626 if (ckWARN(WARN_IO)) {
3627 const char * const direction =
3628 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3630 Perl_warner(aTHX_ packWARN(WARN_IO),
3631 "Filehandle %s opened only for %sput",
3634 Perl_warner(aTHX_ packWARN(WARN_IO),
3635 "Filehandle opened only for %sput", direction);
3642 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3644 warn_type = WARN_CLOSED;
3648 warn_type = WARN_UNOPENED;
3651 if (ckWARN(warn_type)) {
3652 const char * const pars =
3653 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3654 const char * const func =
3656 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3657 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3658 op < 0 ? "" : /* handle phoney cases */
3660 const char * const type =
3662 (OP_IS_SOCKET(op) ||
3663 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3664 "socket" : "filehandle");
3665 if (name && *name) {
3666 Perl_warner(aTHX_ packWARN(warn_type),
3667 "%s%s on %s %s %s", func, pars, vile, type, name);
3668 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3670 aTHX_ packWARN(warn_type),
3671 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3676 Perl_warner(aTHX_ packWARN(warn_type),
3677 "%s%s on %s %s", func, pars, vile, type);
3678 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3680 aTHX_ packWARN(warn_type),
3681 "\t(Are you trying to call %s%s on dirhandle?)\n",
3690 /* in ASCII order, not that it matters */
3691 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3694 Perl_ebcdic_control(pTHX_ int ch)
3702 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3703 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3706 if (ctlp == controllablechars)
3707 return('\177'); /* DEL */
3709 return((unsigned char)(ctlp - controllablechars - 1));
3710 } else { /* Want uncontrol */
3711 if (ch == '\177' || ch == -1)
3713 else if (ch == '\157')
3715 else if (ch == '\174')
3717 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3719 else if (ch == '\155')
3721 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3722 return(controllablechars[ch+1]);
3724 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3729 /* To workaround core dumps from the uninitialised tm_zone we get the
3730 * system to give us a reasonable struct to copy. This fix means that
3731 * strftime uses the tm_zone and tm_gmtoff values returned by
3732 * localtime(time()). That should give the desired result most of the
3733 * time. But probably not always!
3735 * This does not address tzname aspects of NETaa14816.
3740 # ifndef STRUCT_TM_HASZONE
3741 # define STRUCT_TM_HASZONE
3745 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3746 # ifndef HAS_TM_TM_ZONE
3747 # define HAS_TM_TM_ZONE
3752 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3754 #ifdef HAS_TM_TM_ZONE
3756 const struct tm* my_tm;
3757 PERL_ARGS_ASSERT_INIT_TM;
3759 my_tm = localtime(&now);
3761 Copy(my_tm, ptm, 1, struct tm);
3763 PERL_ARGS_ASSERT_INIT_TM;
3764 PERL_UNUSED_ARG(ptm);
3769 * mini_mktime - normalise struct tm values without the localtime()
3770 * semantics (and overhead) of mktime().
3773 Perl_mini_mktime(pTHX_ struct tm *ptm)
3777 int month, mday, year, jday;
3778 int odd_cent, odd_year;
3779 PERL_UNUSED_CONTEXT;
3781 PERL_ARGS_ASSERT_MINI_MKTIME;
3783 #define DAYS_PER_YEAR 365
3784 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3785 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3786 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3787 #define SECS_PER_HOUR (60*60)
3788 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3789 /* parentheses deliberately absent on these two, otherwise they don't work */
3790 #define MONTH_TO_DAYS 153/5
3791 #define DAYS_TO_MONTH 5/153
3792 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3793 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3794 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3795 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3798 * Year/day algorithm notes:
3800 * With a suitable offset for numeric value of the month, one can find
3801 * an offset into the year by considering months to have 30.6 (153/5) days,
3802 * using integer arithmetic (i.e., with truncation). To avoid too much
3803 * messing about with leap days, we consider January and February to be
3804 * the 13th and 14th month of the previous year. After that transformation,
3805 * we need the month index we use to be high by 1 from 'normal human' usage,
3806 * so the month index values we use run from 4 through 15.
3808 * Given that, and the rules for the Gregorian calendar (leap years are those
3809 * divisible by 4 unless also divisible by 100, when they must be divisible
3810 * by 400 instead), we can simply calculate the number of days since some
3811 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3812 * the days we derive from our month index, and adding in the day of the
3813 * month. The value used here is not adjusted for the actual origin which
3814 * it normally would use (1 January A.D. 1), since we're not exposing it.
3815 * We're only building the value so we can turn around and get the
3816 * normalised values for the year, month, day-of-month, and day-of-year.
3818 * For going backward, we need to bias the value we're using so that we find
3819 * the right year value. (Basically, we don't want the contribution of
3820 * March 1st to the number to apply while deriving the year). Having done
3821 * that, we 'count up' the contribution to the year number by accounting for
3822 * full quadracenturies (400-year periods) with their extra leap days, plus
3823 * the contribution from full centuries (to avoid counting in the lost leap
3824 * days), plus the contribution from full quad-years (to count in the normal
3825 * leap days), plus the leftover contribution from any non-leap years.
3826 * At this point, if we were working with an actual leap day, we'll have 0
3827 * days left over. This is also true for March 1st, however. So, we have
3828 * to special-case that result, and (earlier) keep track of the 'odd'
3829 * century and year contributions. If we got 4 extra centuries in a qcent,
3830 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3831 * Otherwise, we add back in the earlier bias we removed (the 123 from
3832 * figuring in March 1st), find the month index (integer division by 30.6),
3833 * and the remainder is the day-of-month. We then have to convert back to
3834 * 'real' months (including fixing January and February from being 14/15 in
3835 * the previous year to being in the proper year). After that, to get
3836 * tm_yday, we work with the normalised year and get a new yearday value for
3837 * January 1st, which we subtract from the yearday value we had earlier,
3838 * representing the date we've re-built. This is done from January 1
3839 * because tm_yday is 0-origin.
3841 * Since POSIX time routines are only guaranteed to work for times since the
3842 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3843 * applies Gregorian calendar rules even to dates before the 16th century
3844 * doesn't bother me. Besides, you'd need cultural context for a given
3845 * date to know whether it was Julian or Gregorian calendar, and that's
3846 * outside the scope for this routine. Since we convert back based on the
3847 * same rules we used to build the yearday, you'll only get strange results
3848 * for input which needed normalising, or for the 'odd' century years which
3849 * were leap years in the Julian calander but not in the Gregorian one.
3850 * I can live with that.
3852 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3853 * that's still outside the scope for POSIX time manipulation, so I don't
3857 year = 1900 + ptm->tm_year;
3858 month = ptm->tm_mon;
3859 mday = ptm->tm_mday;
3860 /* allow given yday with no month & mday to dominate the result */
3861 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3864 jday = 1 + ptm->tm_yday;
3873 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3874 yearday += month*MONTH_TO_DAYS + mday + jday;
3876 * Note that we don't know when leap-seconds were or will be,
3877 * so we have to trust the user if we get something which looks
3878 * like a sensible leap-second. Wild values for seconds will
3879 * be rationalised, however.
3881 if ((unsigned) ptm->tm_sec <= 60) {
3888 secs += 60 * ptm->tm_min;
3889 secs += SECS_PER_HOUR * ptm->tm_hour;
3891 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3892 /* got negative remainder, but need positive time */
3893 /* back off an extra day to compensate */
3894 yearday += (secs/SECS_PER_DAY)-1;
3895 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3898 yearday += (secs/SECS_PER_DAY);
3899 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3902 else if (secs >= SECS_PER_DAY) {
3903 yearday += (secs/SECS_PER_DAY);
3904 secs %= SECS_PER_DAY;
3906 ptm->tm_hour = secs/SECS_PER_HOUR;
3907 secs %= SECS_PER_HOUR;
3908 ptm->tm_min = secs/60;
3910 ptm->tm_sec += secs;
3911 /* done with time of day effects */
3913 * The algorithm for yearday has (so far) left it high by 428.
3914 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3915 * bias it by 123 while trying to figure out what year it
3916 * really represents. Even with this tweak, the reverse
3917 * translation fails for years before A.D. 0001.
3918 * It would still fail for Feb 29, but we catch that one below.
3920 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3921 yearday -= YEAR_ADJUST;
3922 year = (yearday / DAYS_PER_QCENT) * 400;
3923 yearday %= DAYS_PER_QCENT;
3924 odd_cent = yearday / DAYS_PER_CENT;
3925 year += odd_cent * 100;
3926 yearday %= DAYS_PER_CENT;
3927 year += (yearday / DAYS_PER_QYEAR) * 4;
3928 yearday %= DAYS_PER_QYEAR;
3929 odd_year = yearday / DAYS_PER_YEAR;
3931 yearday %= DAYS_PER_YEAR;
3932 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3937 yearday += YEAR_ADJUST; /* recover March 1st crock */
3938 month = yearday*DAYS_TO_MONTH;
3939 yearday -= month*MONTH_TO_DAYS;
3940 /* recover other leap-year adjustment */
3949 ptm->tm_year = year - 1900;
3951 ptm->tm_mday = yearday;
3952 ptm->tm_mon = month;
3956 ptm->tm_mon = month - 1;
3958 /* re-build yearday based on Jan 1 to get tm_yday */
3960 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3961 yearday += 14*MONTH_TO_DAYS + 1;
3962 ptm->tm_yday = jday - yearday;
3963 /* fix tm_wday if not overridden by caller */
3964 if ((unsigned)ptm->tm_wday > 6)
3965 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3969 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)
3977 PERL_ARGS_ASSERT_MY_STRFTIME;
3979 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3982 mytm.tm_hour = hour;
3983 mytm.tm_mday = mday;
3985 mytm.tm_year = year;
3986 mytm.tm_wday = wday;
3987 mytm.tm_yday = yday;
3988 mytm.tm_isdst = isdst;
3990 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3991 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3996 #ifdef HAS_TM_TM_GMTOFF
3997 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3999 #ifdef HAS_TM_TM_ZONE
4000 mytm.tm_zone = mytm2.tm_zone;
4005 Newx(buf, buflen, char);
4006 len = strftime(buf, buflen, fmt, &mytm);
4008 ** The following is needed to handle to the situation where
4009 ** tmpbuf overflows. Basically we want to allocate a buffer
4010 ** and try repeatedly. The reason why it is so complicated
4011 ** is that getting a return value of 0 from strftime can indicate
4012 ** one of the following:
4013 ** 1. buffer overflowed,
4014 ** 2. illegal conversion specifier, or
4015 ** 3. the format string specifies nothing to be returned(not
4016 ** an error). This could be because format is an empty string
4017 ** or it specifies %p that yields an empty string in some locale.
4018 ** If there is a better way to make it portable, go ahead by
4021 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
4024 /* Possibly buf overflowed - try again with a bigger buf */
4025 const int fmtlen = strlen(fmt);
4026 int bufsize = fmtlen + buflen;
4028 Newx(buf, bufsize, char);
4030 buflen = strftime(buf, bufsize, fmt, &mytm);
4031 if (buflen > 0 && buflen < bufsize)
4033 /* heuristic to prevent out-of-memory errors */
4034 if (bufsize > 100*fmtlen) {
4040 Renew(buf, bufsize, char);
4045 Perl_croak(aTHX_ "panic: no strftime");
4051 #define SV_CWD_RETURN_UNDEF \
4052 sv_setsv(sv, &PL_sv_undef); \
4055 #define SV_CWD_ISDOT(dp) \
4056 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4057 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4060 =head1 Miscellaneous Functions
4062 =for apidoc getcwd_sv
4064 Fill the sv with current working directory
4069 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4070 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4071 * getcwd(3) if available
4072 * Comments from the orignal:
4073 * This is a faster version of getcwd. It's also more dangerous
4074 * because you might chdir out of a directory that you can't chdir
4078 Perl_getcwd_sv(pTHX_ register SV *sv)
4082 #ifndef INCOMPLETE_TAINTS
4086 PERL_ARGS_ASSERT_GETCWD_SV;
4090 char buf[MAXPATHLEN];
4092 /* Some getcwd()s automatically allocate a buffer of the given
4093 * size from the heap if they are given a NULL buffer pointer.
4094 * The problem is that this behaviour is not portable. */
4095 if (getcwd(buf, sizeof(buf) - 1)) {
4100 sv_setsv(sv, &PL_sv_undef);
4108 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4112 SvUPGRADE(sv, SVt_PV);
4114 if (PerlLIO_lstat(".", &statbuf) < 0) {
4115 SV_CWD_RETURN_UNDEF;
4118 orig_cdev = statbuf.st_dev;
4119 orig_cino = statbuf.st_ino;
4128 if (PerlDir_chdir("..") < 0) {
4129 SV_CWD_RETURN_UNDEF;
4131 if (PerlLIO_stat(".", &statbuf) < 0) {
4132 SV_CWD_RETURN_UNDEF;
4135 cdev = statbuf.st_dev;
4136 cino = statbuf.st_ino;
4138 if (odev == cdev && oino == cino) {
4141 if (!(dir = PerlDir_open("."))) {
4142 SV_CWD_RETURN_UNDEF;
4145 while ((dp = PerlDir_read(dir)) != NULL) {
4147 const int namelen = dp->d_namlen;
4149 const int namelen = strlen(dp->d_name);
4152 if (SV_CWD_ISDOT(dp)) {
4156 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4157 SV_CWD_RETURN_UNDEF;
4160 tdev = statbuf.st_dev;
4161 tino = statbuf.st_ino;
4162 if (tino == oino && tdev == odev) {
4168 SV_CWD_RETURN_UNDEF;
4171 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4172 SV_CWD_RETURN_UNDEF;
4175 SvGROW(sv, pathlen + namelen + 1);
4179 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4182 /* prepend current directory to the front */
4184 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4185 pathlen += (namelen + 1);
4187 #ifdef VOID_CLOSEDIR
4190 if (PerlDir_close(dir) < 0) {
4191 SV_CWD_RETURN_UNDEF;
4197 SvCUR_set(sv, pathlen);
4201 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4202 SV_CWD_RETURN_UNDEF;
4205 if (PerlLIO_stat(".", &statbuf) < 0) {
4206 SV_CWD_RETURN_UNDEF;
4209 cdev = statbuf.st_dev;
4210 cino = statbuf.st_ino;
4212 if (cdev != orig_cdev || cino != orig_cino) {
4213 Perl_croak(aTHX_ "Unstable directory path, "
4214 "current directory changed unexpectedly");
4225 #define VERSION_MAX 0x7FFFFFFF
4227 =for apidoc scan_version
4229 Returns a pointer to the next character after the parsed
4230 version string, as well as upgrading the passed in SV to
4233 Function must be called with an already existing SV like
4236 s = scan_version(s, SV *sv, bool qv);
4238 Performs some preprocessing to the string to ensure that
4239 it has the correct characteristics of a version. Flags the
4240 object if it contains an underscore (which denotes this
4241 is an alpha version). The boolean qv denotes that the version
4242 should be interpreted as if it had multiple decimals, even if
4249 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4258 AV * const av = newAV();
4259 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4261 PERL_ARGS_ASSERT_SCAN_VERSION;
4263 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4265 while (isSPACE(*s)) /* leading whitespace is OK */
4271 s++; /* get past 'v' */
4272 qv = 1; /* force quoted version processing */
4277 /* pre-scan the input string to check for decimals/underbars */
4278 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4283 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4287 else if ( *pos == '_' )
4290 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4292 width = pos - last - 1; /* natural width of sub-version */
4297 if ( alpha && !saw_period )
4298 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4300 if ( alpha && saw_period && width == 0 )
4301 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4303 if ( saw_period > 1 )
4304 qv = 1; /* force quoted version processing */
4310 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4312 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4313 if ( !qv && width < 3 )
4314 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4316 while (isDIGIT(*pos))
4318 if (!isALPHA(*pos)) {
4324 /* this is atoi() that delimits on underscores */
4325 const char *end = pos;
4329 /* the following if() will only be true after the decimal
4330 * point of a version originally created with a bare
4331 * floating point number, i.e. not quoted in any way
4333 if ( !qv && s > start && saw_period == 1 ) {
4337 rev += (*s - '0') * mult;
4339 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4340 || (PERL_ABS(rev) > VERSION_MAX )) {
4341 if(ckWARN(WARN_OVERFLOW))
4342 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4343 "Integer overflow in version %d",VERSION_MAX);
4354 while (--end >= s) {
4356 rev += (*end - '0') * mult;
4358 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4359 || (PERL_ABS(rev) > VERSION_MAX )) {
4360 if(ckWARN(WARN_OVERFLOW))
4361 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4362 "Integer overflow in version");
4371 /* Append revision */
4372 av_push(av, newSViv(rev));
4377 else if ( *pos == '.' )
4379 else if ( *pos == '_' && isDIGIT(pos[1]) )
4381 else if ( isDIGIT(*pos) )
4388 while ( isDIGIT(*pos) )
4393 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4401 if ( qv ) { /* quoted versions always get at least three terms*/
4402 I32 len = av_len(av);
4403 /* This for loop appears to trigger a compiler bug on OS X, as it
4404 loops infinitely. Yes, len is negative. No, it makes no sense.
4405 Compiler in question is:
4406 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4407 for ( len = 2 - len; len > 0; len-- )
4408 av_push(MUTABLE_AV(sv), newSViv(0));
4412 av_push(av, newSViv(0));
4415 /* need to save off the current version string for later */
4417 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4418 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4419 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4421 else if ( s > start ) {
4422 SV * orig = newSVpvn(start,s-start);
4423 if ( qv && saw_period == 1 && *start != 'v' ) {
4424 /* need to insert a v to be consistent */
4425 sv_insert(orig, 0, 0, "v", 1);
4427 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4430 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4431 av_push(av, newSViv(0));
4434 /* And finally, store the AV in the hash */
4435 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4437 /* fix RT#19517 - special case 'undef' as string */
4438 if ( *s == 'u' && strEQ(s,"undef") ) {
4446 =for apidoc new_version
4448 Returns a new version object based on the passed in SV:
4450 SV *sv = new_version(SV *ver);
4452 Does not alter the passed in ver SV. See "upg_version" if you
4453 want to upgrade the SV.
4459 Perl_new_version(pTHX_ SV *ver)
4462 SV * const rv = newSV(0);
4463 PERL_ARGS_ASSERT_NEW_VERSION;
4464 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4467 AV * const av = newAV();
4469 /* This will get reblessed later if a derived class*/
4470 SV * const hv = newSVrv(rv, "version");
4471 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4476 /* Begin copying all of the elements */
4477 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4478 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4480 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4481 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4483 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4485 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4486 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4489 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4491 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4492 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4495 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4496 /* This will get reblessed later if a derived class*/
4497 for ( key = 0; key <= av_len(sav); key++ )
4499 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4500 av_push(av, newSViv(rev));
4503 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4508 const MAGIC* const mg = SvVSTRING_mg(ver);
4509 if ( mg ) { /* already a v-string */
4510 const STRLEN len = mg->mg_len;
4511 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4512 sv_setpvn(rv,version,len);
4513 /* this is for consistency with the pure Perl class */
4514 if ( *version != 'v' )
4515 sv_insert(rv, 0, 0, "v", 1);
4520 sv_setsv(rv,ver); /* make a duplicate */
4525 return upg_version(rv, FALSE);
4529 =for apidoc upg_version
4531 In-place upgrade of the supplied SV to a version object.
4533 SV *sv = upg_version(SV *sv, bool qv);
4535 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4536 to force this SV to be interpreted as an "extended" version.
4542 Perl_upg_version(pTHX_ SV *ver, bool qv)
4544 const char *version, *s;
4549 PERL_ARGS_ASSERT_UPG_VERSION;
4551 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4553 /* may get too much accuracy */
4555 #ifdef USE_LOCALE_NUMERIC
4556 char *loc = setlocale(LC_NUMERIC, "C");
4558 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4559 #ifdef USE_LOCALE_NUMERIC
4560 setlocale(LC_NUMERIC, loc);
4562 while (tbuf[len-1] == '0' && len > 0) len--;
4563 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4564 version = savepvn(tbuf, len);
4567 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4568 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4572 else /* must be a string or something like a string */
4575 version = savepv(SvPV(ver,len));
4577 # if PERL_VERSION > 5
4578 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4579 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4580 /* may be a v-string */
4581 SV * const nsv = sv_newmortal();
4585 sv_setpvf(nsv,"v%vd",ver);
4586 pos = nver = savepv(SvPV_nolen(nsv));
4588 /* scan the resulting formatted string */
4589 pos++; /* skip the leading 'v' */
4590 while ( *pos == '.' || isDIGIT(*pos) ) {
4596 /* is definitely a v-string */
4597 if ( saw_period == 2 ) {
4606 s = scan_version(version, ver, qv);
4608 if(ckWARN(WARN_MISC))
4609 Perl_warner(aTHX_ packWARN(WARN_MISC),
4610 "Version string '%s' contains invalid data; "
4611 "ignoring: '%s'", version, s);
4619 Validates that the SV contains a valid version object.
4621 bool vverify(SV *vobj);
4623 Note that it only confirms the bare minimum structure (so as not to get
4624 confused by derived classes which may contain additional hash entries):
4628 =item * The SV contains a [reference to a] hash
4630 =item * The hash contains a "version" key
4632 =item * The "version" key has [a reference to] an AV as its value
4640 Perl_vverify(pTHX_ SV *vs)
4644 PERL_ARGS_ASSERT_VVERIFY;
4649 /* see if the appropriate elements exist */
4650 if ( SvTYPE(vs) == SVt_PVHV
4651 && hv_exists(MUTABLE_HV(vs), "version", 7)
4652 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4653 && SvTYPE(sv) == SVt_PVAV )
4662 Accepts a version object and returns the normalized floating
4663 point representation. Call like:
4667 NOTE: you can pass either the object directly or the SV
4668 contained within the RV.
4674 Perl_vnumify(pTHX_ SV *vs)
4679 SV * const sv = newSV(0);
4682 PERL_ARGS_ASSERT_VNUMIFY;
4688 Perl_croak(aTHX_ "Invalid version object");
4690 /* see if various flags exist */
4691 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4693 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4694 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4699 /* attempt to retrieve the version array */
4700 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4712 digit = SvIV(*av_fetch(av, 0, 0));
4713 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4714 for ( i = 1 ; i < len ; i++ )
4716 digit = SvIV(*av_fetch(av, i, 0));
4718 const int denom = (width == 2 ? 10 : 100);
4719 const div_t term = div((int)PERL_ABS(digit),denom);
4720 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4723 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4729 digit = SvIV(*av_fetch(av, len, 0));
4730 if ( alpha && width == 3 ) /* alpha version */
4732 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4736 sv_catpvs(sv, "000");
4744 Accepts a version object and returns the normalized string
4745 representation. Call like:
4749 NOTE: you can pass either the object directly or the SV
4750 contained within the RV.
4756 Perl_vnormal(pTHX_ SV *vs)
4760 SV * const sv = newSV(0);
4763 PERL_ARGS_ASSERT_VNORMAL;
4769 Perl_croak(aTHX_ "Invalid version object");
4771 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4773 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4781 digit = SvIV(*av_fetch(av, 0, 0));
4782 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4783 for ( i = 1 ; i < len ; i++ ) {
4784 digit = SvIV(*av_fetch(av, i, 0));
4785 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4790 /* handle last digit specially */
4791 digit = SvIV(*av_fetch(av, len, 0));
4793 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4795 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4798 if ( len <= 2 ) { /* short version, must be at least three */
4799 for ( len = 2 - len; len != 0; len-- )
4806 =for apidoc vstringify
4808 In order to maintain maximum compatibility with earlier versions
4809 of Perl, this function will return either the floating point
4810 notation or the multiple dotted notation, depending on whether
4811 the original version contained 1 or more dots, respectively
4817 Perl_vstringify(pTHX_ SV *vs)
4819 PERL_ARGS_ASSERT_VSTRINGIFY;
4825 Perl_croak(aTHX_ "Invalid version object");
4827 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4829 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4833 return &PL_sv_undef;
4836 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4846 Version object aware cmp. Both operands must already have been
4847 converted into version objects.
4853 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4856 bool lalpha = FALSE;
4857 bool ralpha = FALSE;
4862 PERL_ARGS_ASSERT_VCMP;
4869 if ( !vverify(lhv) )
4870 Perl_croak(aTHX_ "Invalid version object");
4872 if ( !vverify(rhv) )
4873 Perl_croak(aTHX_ "Invalid version object");
4875 /* get the left hand term */
4876 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4877 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4880 /* and the right hand term */
4881 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4882 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4890 while ( i <= m && retval == 0 )
4892 left = SvIV(*av_fetch(lav,i,0));
4893 right = SvIV(*av_fetch(rav,i,0));
4901 /* tiebreaker for alpha with identical terms */
4902 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4904 if ( lalpha && !ralpha )
4908 else if ( ralpha && !lalpha)
4914 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4918 while ( i <= r && retval == 0 )
4920 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4921 retval = -1; /* not a match after all */
4927 while ( i <= l && retval == 0 )
4929 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4930 retval = +1; /* not a match after all */
4938 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4939 # define EMULATE_SOCKETPAIR_UDP
4942 #ifdef EMULATE_SOCKETPAIR_UDP
4944 S_socketpair_udp (int fd[2]) {
4946 /* Fake a datagram socketpair using UDP to localhost. */
4947 int sockets[2] = {-1, -1};
4948 struct sockaddr_in addresses[2];
4950 Sock_size_t size = sizeof(struct sockaddr_in);
4951 unsigned short port;
4954 memset(&addresses, 0, sizeof(addresses));
4957 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4958 if (sockets[i] == -1)
4959 goto tidy_up_and_fail;
4961 addresses[i].sin_family = AF_INET;
4962 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4963 addresses[i].sin_port = 0; /* kernel choses port. */
4964 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4965 sizeof(struct sockaddr_in)) == -1)
4966 goto tidy_up_and_fail;
4969 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4970 for each connect the other socket to it. */
4973 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4975 goto tidy_up_and_fail;
4976 if (size != sizeof(struct sockaddr_in))
4977 goto abort_tidy_up_and_fail;
4978 /* !1 is 0, !0 is 1 */
4979 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4980 sizeof(struct sockaddr_in)) == -1)
4981 goto tidy_up_and_fail;
4984 /* Now we have 2 sockets connected to each other. I don't trust some other
4985 process not to have already sent a packet to us (by random) so send
4986 a packet from each to the other. */
4989 /* I'm going to send my own port number. As a short.
4990 (Who knows if someone somewhere has sin_port as a bitfield and needs
4991 this routine. (I'm assuming crays have socketpair)) */
4992 port = addresses[i].sin_port;
4993 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4994 if (got != sizeof(port)) {
4996 goto tidy_up_and_fail;
4997 goto abort_tidy_up_and_fail;
5001 /* Packets sent. I don't trust them to have arrived though.
5002 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
5003 connect to localhost will use a second kernel thread. In 2.6 the
5004 first thread running the connect() returns before the second completes,
5005 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
5006 returns 0. Poor programs have tripped up. One poor program's authors'
5007 had a 50-1 reverse stock split. Not sure how connected these were.)
5008 So I don't trust someone not to have an unpredictable UDP stack.
5012 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
5013 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
5017 FD_SET((unsigned int)sockets[0], &rset);
5018 FD_SET((unsigned int)sockets[1], &rset);
5020 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
5021 if (got != 2 || !FD_ISSET(sockets[0], &rset)
5022 || !FD_ISSET(sockets[1], &rset)) {
5023 /* I hope this is portable and appropriate. */
5025 goto tidy_up_and_fail;
5026 goto abort_tidy_up_and_fail;
5030 /* And the paranoia department even now doesn't trust it to have arrive
5031 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
5033 struct sockaddr_in readfrom;
5034 unsigned short buffer[2];
5039 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5040 sizeof(buffer), MSG_DONTWAIT,
5041 (struct sockaddr *) &readfrom, &size);
5043 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5045 (struct sockaddr *) &readfrom, &size);
5049 goto tidy_up_and_fail;
5050 if (got != sizeof(port)
5051 || size != sizeof(struct sockaddr_in)
5052 /* Check other socket sent us its port. */
5053 || buffer[0] != (unsigned short) addresses[!i].sin_port
5054 /* Check kernel says we got the datagram from that socket */
5055 || readfrom.sin_family != addresses[!i].sin_family
5056 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5057 || readfrom.sin_port != addresses[!i].sin_port)
5058 goto abort_tidy_up_and_fail;
5061 /* My caller (my_socketpair) has validated that this is non-NULL */
5064 /* I hereby declare this connection open. May God bless all who cross
5068 abort_tidy_up_and_fail:
5069 errno = ECONNABORTED;
5072 const int save_errno = errno;
5073 if (sockets[0] != -1)
5074 PerlLIO_close(sockets[0]);
5075 if (sockets[1] != -1)
5076 PerlLIO_close(sockets[1]);
5081 #endif /* EMULATE_SOCKETPAIR_UDP */
5083 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5085 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5086 /* Stevens says that family must be AF_LOCAL, protocol 0.
5087 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5092 struct sockaddr_in listen_addr;
5093 struct sockaddr_in connect_addr;
5098 || family != AF_UNIX
5101 errno = EAFNOSUPPORT;
5109 #ifdef EMULATE_SOCKETPAIR_UDP
5110 if (type == SOCK_DGRAM)
5111 return S_socketpair_udp(fd);
5114 listener = PerlSock_socket(AF_INET, type, 0);
5117 memset(&listen_addr, 0, sizeof(listen_addr));
5118 listen_addr.sin_family = AF_INET;
5119 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5120 listen_addr.sin_port = 0; /* kernel choses port. */
5121 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5122 sizeof(listen_addr)) == -1)
5123 goto tidy_up_and_fail;
5124 if (PerlSock_listen(listener, 1) == -1)
5125 goto tidy_up_and_fail;
5127 connector = PerlSock_socket(AF_INET, type, 0);
5128 if (connector == -1)
5129 goto tidy_up_and_fail;
5130 /* We want to find out the port number to connect to. */
5131 size = sizeof(connect_addr);
5132 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5134 goto tidy_up_and_fail;
5135 if (size != sizeof(connect_addr))
5136 goto abort_tidy_up_and_fail;
5137 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5138 sizeof(connect_addr)) == -1)
5139 goto tidy_up_and_fail;
5141 size = sizeof(listen_addr);
5142 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5145 goto tidy_up_and_fail;
5146 if (size != sizeof(listen_addr))
5147 goto abort_tidy_up_and_fail;
5148 PerlLIO_close(listener);
5149 /* Now check we are talking to ourself by matching port and host on the
5151 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5153 goto tidy_up_and_fail;
5154 if (size != sizeof(connect_addr)
5155 || listen_addr.sin_family != connect_addr.sin_family
5156 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5157 || listen_addr.sin_port != connect_addr.sin_port) {
5158 goto abort_tidy_up_and_fail;
5164 abort_tidy_up_and_fail:
5166 errno = ECONNABORTED; /* This would be the standard thing to do. */
5168 # ifdef ECONNREFUSED
5169 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5171 errno = ETIMEDOUT; /* Desperation time. */
5176 const int save_errno = errno;
5178 PerlLIO_close(listener);
5179 if (connector != -1)
5180 PerlLIO_close(connector);
5182 PerlLIO_close(acceptor);
5188 /* In any case have a stub so that there's code corresponding
5189 * to the my_socketpair in global.sym. */
5191 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5192 #ifdef HAS_SOCKETPAIR
5193 return socketpair(family, type, protocol, fd);
5202 =for apidoc sv_nosharing
5204 Dummy routine which "shares" an SV when there is no sharing module present.
5205 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5206 Exists to avoid test for a NULL function pointer and because it could
5207 potentially warn under some level of strict-ness.
5213 Perl_sv_nosharing(pTHX_ SV *sv)
5215 PERL_UNUSED_CONTEXT;
5216 PERL_UNUSED_ARG(sv);
5221 =for apidoc sv_destroyable
5223 Dummy routine which reports that object can be destroyed when there is no
5224 sharing module present. It ignores its single SV argument, and returns
5225 'true'. Exists to avoid test for a NULL function pointer and because it
5226 could potentially warn under some level of strict-ness.
5232 Perl_sv_destroyable(pTHX_ SV *sv)
5234 PERL_UNUSED_CONTEXT;
5235 PERL_UNUSED_ARG(sv);
5240 Perl_parse_unicode_opts(pTHX_ const char **popt)
5242 const char *p = *popt;
5245 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5249 opt = (U32) atoi(p);
5252 if (*p && *p != '\n' && *p != '\r')
5253 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5258 case PERL_UNICODE_STDIN:
5259 opt |= PERL_UNICODE_STDIN_FLAG; break;
5260 case PERL_UNICODE_STDOUT:
5261 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5262 case PERL_UNICODE_STDERR:
5263 opt |= PERL_UNICODE_STDERR_FLAG; break;
5264 case PERL_UNICODE_STD:
5265 opt |= PERL_UNICODE_STD_FLAG; break;
5266 case PERL_UNICODE_IN:
5267 opt |= PERL_UNICODE_IN_FLAG; break;
5268 case PERL_UNICODE_OUT:
5269 opt |= PERL_UNICODE_OUT_FLAG; break;
5270 case PERL_UNICODE_INOUT:
5271 opt |= PERL_UNICODE_INOUT_FLAG; break;
5272 case PERL_UNICODE_LOCALE:
5273 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5274 case PERL_UNICODE_ARGV:
5275 opt |= PERL_UNICODE_ARGV_FLAG; break;
5276 case PERL_UNICODE_UTF8CACHEASSERT:
5277 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5279 if (*p != '\n' && *p != '\r')
5281 "Unknown Unicode option letter '%c'", *p);
5287 opt = PERL_UNICODE_DEFAULT_FLAGS;
5289 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5290 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5291 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5303 * This is really just a quick hack which grabs various garbage
5304 * values. It really should be a real hash algorithm which
5305 * spreads the effect of every input bit onto every output bit,
5306 * if someone who knows about such things would bother to write it.
5307 * Might be a good idea to add that function to CORE as well.
5308 * No numbers below come from careful analysis or anything here,
5309 * except they are primes and SEED_C1 > 1E6 to get a full-width
5310 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5311 * probably be bigger too.
5314 # define SEED_C1 1000003
5315 #define SEED_C4 73819
5317 # define SEED_C1 25747
5318 #define SEED_C4 20639
5322 #define SEED_C5 26107
5324 #ifndef PERL_NO_DEV_RANDOM
5329 # include <starlet.h>
5330 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5331 * in 100-ns units, typically incremented ever 10 ms. */
5332 unsigned int when[2];
5334 # ifdef HAS_GETTIMEOFDAY
5335 struct timeval when;
5341 /* This test is an escape hatch, this symbol isn't set by Configure. */
5342 #ifndef PERL_NO_DEV_RANDOM
5343 #ifndef PERL_RANDOM_DEVICE
5344 /* /dev/random isn't used by default because reads from it will block
5345 * if there isn't enough entropy available. You can compile with
5346 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5347 * is enough real entropy to fill the seed. */
5348 # define PERL_RANDOM_DEVICE "/dev/urandom"
5350 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5352 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5361 _ckvmssts(sys$gettim(when));
5362 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5364 # ifdef HAS_GETTIMEOFDAY
5365 PerlProc_gettimeofday(&when,NULL);
5366 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5369 u = (U32)SEED_C1 * when;
5372 u += SEED_C3 * (U32)PerlProc_getpid();
5373 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5374 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5375 u += SEED_C5 * (U32)PTR2UV(&when);
5381 Perl_get_hash_seed(pTHX)
5384 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5390 if (s && isDIGIT(*s))
5391 myseed = (UV)Atoul(s);
5393 #ifdef USE_HASH_SEED_EXPLICIT
5397 /* Compute a random seed */
5398 (void)seedDrand01((Rand_seed_t)seed());
5399 myseed = (UV)(Drand01() * (NV)UV_MAX);
5400 #if RANDBITS < (UVSIZE * 8)
5401 /* Since there are not enough randbits to to reach all
5402 * the bits of a UV, the low bits might need extra
5403 * help. Sum in another random number that will
5404 * fill in the low bits. */
5406 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5407 #endif /* RANDBITS < (UVSIZE * 8) */
5408 if (myseed == 0) { /* Superparanoia. */
5409 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5411 Perl_croak(aTHX_ "Your random numbers are not that random");
5414 PL_rehash_seed_set = TRUE;
5421 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5423 const char * const stashpv = CopSTASHPV(c);
5424 const char * const name = HvNAME_get(hv);
5425 PERL_UNUSED_CONTEXT;
5426 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5428 if (stashpv == name)
5430 if (stashpv && name)
5431 if (strEQ(stashpv, name))
5438 #ifdef PERL_GLOBAL_STRUCT
5440 #define PERL_GLOBAL_STRUCT_INIT
5441 #include "opcode.h" /* the ppaddr and check */
5444 Perl_init_global_struct(pTHX)
5446 struct perl_vars *plvarsp = NULL;
5447 # ifdef PERL_GLOBAL_STRUCT
5448 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5449 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5450 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5451 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5452 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5456 plvarsp = PL_VarsPtr;
5457 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5463 # define PERLVAR(var,type) /**/
5464 # define PERLVARA(var,n,type) /**/
5465 # define PERLVARI(var,type,init) plvarsp->var = init;
5466 # define PERLVARIC(var,type,init) plvarsp->var = init;
5467 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5468 # include "perlvars.h"
5474 # ifdef PERL_GLOBAL_STRUCT
5477 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5478 if (!plvarsp->Gppaddr)
5482 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5483 if (!plvarsp->Gcheck)
5485 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5486 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5488 # ifdef PERL_SET_VARS
5489 PERL_SET_VARS(plvarsp);
5491 # undef PERL_GLOBAL_STRUCT_INIT
5496 #endif /* PERL_GLOBAL_STRUCT */
5498 #ifdef PERL_GLOBAL_STRUCT
5501 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5503 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5504 # ifdef PERL_GLOBAL_STRUCT
5505 # ifdef PERL_UNSET_VARS
5506 PERL_UNSET_VARS(plvarsp);
5508 free(plvarsp->Gppaddr);
5509 free(plvarsp->Gcheck);
5510 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5516 #endif /* PERL_GLOBAL_STRUCT */
5521 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5523 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5524 * variables PERL_MEM_LOG and PERL_SV_LOG will be consulted, and
5525 * if the integer value of that is true, the logging will happen.
5526 * (The default is to always log if the PERL_MEM_LOG define was
5529 * PERL_MEM_LOG_TIMESTAMP: if defined, a timestamp will be logged
5530 * before every memory logging entry. This can be turned off at run
5531 * time by setting the environment variable PERL_MEM_LOG_TIMESTAMP
5536 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5537 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5539 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5542 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5543 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5544 * in which case the environment variable PERL_MEM_LOG_FD will be
5545 * consulted for the file descriptor number to use.
5547 #ifndef PERL_MEM_LOG_FD
5548 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5551 #ifdef PERL_MEM_LOG_STDERR
5553 # ifdef DEBUG_LEAKING_SCALARS
5554 # define SV_LOG_SERIAL_FMT " [%lu]"
5555 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5557 # define SV_LOG_SERIAL_FMT
5558 # define _SV_LOG_SERIAL_ARG(sv)
5562 S_mem_log_common(enum mem_log_type mlt, const UV n, const UV typesize, const char *type_name, const SV *sv, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5564 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5568 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5570 # ifdef PERL_MEM_LOG_ENV
5571 s = PerlEnv_getenv(mlt < MLT_NEW_SV ? "PERL_MEM_LOG" : "PERL_SV_LOG");
5572 if (s ? atoi(s) : 0)
5575 /* We can't use SVs or PerlIO for obvious reasons,
5576 * so we'll use stdio and low-level IO instead. */
5577 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5578 # ifdef PERL_MEM_LOG_TIMESTAMP
5579 # ifdef HAS_GETTIMEOFDAY
5580 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5581 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5583 gettimeofday(&tv, 0);
5585 # define MEM_LOG_TIME_FMT "%10d: "
5586 # define MEM_LOG_TIME_ARG (int)when
5590 /* If there are other OS specific ways of hires time than
5591 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5592 * probably that they would be used to fill in the struct
5596 int fd = PERL_MEM_LOG_FD;
5599 # ifdef PERL_MEM_LOG_ENV_FD
5600 if ((s = PerlEnv_getenv("PERL_MEM_LOG_FD"))) {
5604 # ifdef PERL_MEM_LOG_TIMESTAMP
5605 s = PerlEnv_getenv("PERL_MEM_LOG_TIMESTAMP");
5606 if (!s || atoi(s)) {
5607 len = my_snprintf(buf, sizeof(buf),
5608 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5609 PerlLIO_write(fd, buf, len);
5614 len = my_snprintf(buf, sizeof(buf),
5615 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5616 " %s = %"IVdf": %"UVxf"\n",
5617 filename, linenumber, funcname, n, typesize,
5618 type_name, n * typesize, PTR2UV(newalloc));
5621 len = my_snprintf(buf, sizeof(buf),
5622 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5623 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5624 filename, linenumber, funcname, n, typesize,
5625 type_name, n * typesize, PTR2UV(oldalloc),
5629 len = my_snprintf(buf, sizeof(buf),
5630 "free: %s:%d:%s: %"UVxf"\n",
5631 filename, linenumber, funcname,
5636 len = my_snprintf(buf, sizeof(buf),
5637 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5638 mlt == MLT_NEW_SV ? "new" : "del",
5639 filename, linenumber, funcname,
5640 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5643 PerlLIO_write(fd, buf, len);
5650 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5652 #ifdef PERL_MEM_LOG_STDERR
5653 mem_log_common(MLT_ALLOC, n, typesize, type_name, NULL, NULL, newalloc, filename, linenumber, funcname);
5659 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5661 #ifdef PERL_MEM_LOG_STDERR
5662 mem_log_common(MLT_REALLOC, n, typesize, type_name, NULL, oldalloc, newalloc, filename, linenumber, funcname);
5668 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5670 #ifdef PERL_MEM_LOG_STDERR
5671 mem_log_common(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL, filename, linenumber, funcname);
5677 Perl_mem_log_new_sv(const SV *sv, const char *filename, const int linenumber, const char *funcname)
5679 #ifdef PERL_MEM_LOG_STDERR
5680 mem_log_common(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL, filename, linenumber, funcname);
5685 Perl_mem_log_del_sv(const SV *sv, const char *filename, const int linenumber, const char *funcname)
5687 #ifdef PERL_MEM_LOG_STDERR
5688 mem_log_common(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL, filename, linenumber, funcname);
5692 #endif /* PERL_MEM_LOG */
5695 =for apidoc my_sprintf
5697 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5698 the length of the string written to the buffer. Only rare pre-ANSI systems
5699 need the wrapper function - usually this is a direct call to C<sprintf>.
5703 #ifndef SPRINTF_RETURNS_STRLEN
5705 Perl_my_sprintf(char *buffer, const char* pat, ...)
5708 PERL_ARGS_ASSERT_MY_SPRINTF;
5709 va_start(args, pat);
5710 vsprintf(buffer, pat, args);
5712 return strlen(buffer);
5717 =for apidoc my_snprintf
5719 The C library C<snprintf> functionality, if available and
5720 standards-compliant (uses C<vsnprintf>, actually). However, if the
5721 C<vsnprintf> is not available, will unfortunately use the unsafe
5722 C<vsprintf> which can overrun the buffer (there is an overrun check,
5723 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5724 getting C<vsnprintf>.
5729 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5734 PERL_ARGS_ASSERT_MY_SNPRINTF;
5735 va_start(ap, format);
5736 #ifdef HAS_VSNPRINTF
5737 retval = vsnprintf(buffer, len, format, ap);
5739 retval = vsprintf(buffer, format, ap);
5742 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5743 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5744 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5749 =for apidoc my_vsnprintf
5751 The C library C<vsnprintf> if available and standards-compliant.
5752 However, if if the C<vsnprintf> is not available, will unfortunately
5753 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5754 overrun check, but that may be too late). Consider using
5755 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5760 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5767 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5769 Perl_va_copy(ap, apc);
5770 # ifdef HAS_VSNPRINTF
5771 retval = vsnprintf(buffer, len, format, apc);
5773 retval = vsprintf(buffer, format, apc);
5776 # ifdef HAS_VSNPRINTF
5777 retval = vsnprintf(buffer, len, format, ap);
5779 retval = vsprintf(buffer, format, ap);
5781 #endif /* #ifdef NEED_VA_COPY */
5782 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5783 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5784 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5789 Perl_my_clearenv(pTHX)
5792 #if ! defined(PERL_MICRO)
5793 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5795 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5796 # if defined(USE_ENVIRON_ARRAY)
5797 # if defined(USE_ITHREADS)
5798 /* only the parent thread can clobber the process environment */
5799 if (PL_curinterp == aTHX)
5800 # endif /* USE_ITHREADS */
5802 # if ! defined(PERL_USE_SAFE_PUTENV)
5803 if ( !PL_use_safe_putenv) {
5805 if (environ == PL_origenviron)
5806 environ = (char**)safesysmalloc(sizeof(char*));
5808 for (i = 0; environ[i]; i++)
5809 (void)safesysfree(environ[i]);
5812 # else /* PERL_USE_SAFE_PUTENV */
5813 # if defined(HAS_CLEARENV)
5815 # elif defined(HAS_UNSETENV)
5816 int bsiz = 80; /* Most envvar names will be shorter than this. */
5817 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5818 char *buf = (char*)safesysmalloc(bufsiz);
5819 while (*environ != NULL) {
5820 char *e = strchr(*environ, '=');
5821 int l = e ? e - *environ : (int)strlen(*environ);
5823 (void)safesysfree(buf);
5824 bsiz = l + 1; /* + 1 for the \0. */
5825 buf = (char*)safesysmalloc(bufsiz);
5827 memcpy(buf, *environ, l);
5829 (void)unsetenv(buf);
5831 (void)safesysfree(buf);
5832 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5833 /* Just null environ and accept the leakage. */
5835 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5836 # endif /* ! PERL_USE_SAFE_PUTENV */
5838 # endif /* USE_ENVIRON_ARRAY */
5839 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5840 #endif /* PERL_MICRO */
5843 #ifdef PERL_IMPLICIT_CONTEXT
5845 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5846 the global PL_my_cxt_index is incremented, and that value is assigned to
5847 that module's static my_cxt_index (who's address is passed as an arg).
5848 Then, for each interpreter this function is called for, it makes sure a
5849 void* slot is available to hang the static data off, by allocating or
5850 extending the interpreter's PL_my_cxt_list array */
5852 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5854 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5858 PERL_ARGS_ASSERT_MY_CXT_INIT;
5860 /* this module hasn't been allocated an index yet */
5861 MUTEX_LOCK(&PL_my_ctx_mutex);
5862 *index = PL_my_cxt_index++;
5863 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5866 /* make sure the array is big enough */
5867 if (PL_my_cxt_size <= *index) {
5868 if (PL_my_cxt_size) {
5869 while (PL_my_cxt_size <= *index)
5870 PL_my_cxt_size *= 2;
5871 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5874 PL_my_cxt_size = 16;
5875 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5878 /* newSV() allocates one more than needed */
5879 p = (void*)SvPVX(newSV(size-1));
5880 PL_my_cxt_list[*index] = p;
5881 Zero(p, size, char);
5885 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5888 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5893 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5895 for (index = 0; index < PL_my_cxt_index; index++) {
5896 const char *key = PL_my_cxt_keys[index];
5897 /* try direct pointer compare first - there are chances to success,
5898 * and it's much faster.
5900 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5907 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5913 PERL_ARGS_ASSERT_MY_CXT_INIT;
5915 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5917 /* this module hasn't been allocated an index yet */
5918 MUTEX_LOCK(&PL_my_ctx_mutex);
5919 index = PL_my_cxt_index++;
5920 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5923 /* make sure the array is big enough */
5924 if (PL_my_cxt_size <= index) {
5925 int old_size = PL_my_cxt_size;
5927 if (PL_my_cxt_size) {
5928 while (PL_my_cxt_size <= index)
5929 PL_my_cxt_size *= 2;
5930 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5931 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5934 PL_my_cxt_size = 16;
5935 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5936 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5938 for (i = old_size; i < PL_my_cxt_size; i++) {
5939 PL_my_cxt_keys[i] = 0;
5940 PL_my_cxt_list[i] = 0;
5943 PL_my_cxt_keys[index] = my_cxt_key;
5944 /* newSV() allocates one more than needed */
5945 p = (void*)SvPVX(newSV(size-1));
5946 PL_my_cxt_list[index] = p;
5947 Zero(p, size, char);
5950 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5951 #endif /* PERL_IMPLICIT_CONTEXT */
5955 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5957 Size_t used, length, copy;
5960 length = strlen(src);
5961 if (size > 0 && used < size - 1) {
5962 copy = (length >= size - used) ? size - used - 1 : length;
5963 memcpy(dst + used, src, copy);
5964 dst[used + copy] = '\0';
5966 return used + length;
5972 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5974 Size_t length, copy;
5976 length = strlen(src);
5978 copy = (length >= size) ? size - 1 : length;
5979 memcpy(dst, src, copy);
5986 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5987 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5988 long _ftol( double ); /* Defined by VC6 C libs. */
5989 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5993 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5996 SV * const dbsv = GvSVn(PL_DBsub);
5997 /* We do not care about using sv to call CV;
5998 * it's for informational purposes only.
6001 PERL_ARGS_ASSERT_GET_DB_SUB;
6004 if (!PERLDB_SUB_NN) {
6005 GV * const gv = CvGV(cv);
6007 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
6008 || strEQ(GvNAME(gv), "END")
6009 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
6010 !( (SvTYPE(*svp) == SVt_PVGV)
6011 && (GvCV((const GV *)*svp) == cv) )))) {
6012 /* Use GV from the stack as a fallback. */
6013 /* GV is potentially non-unique, or contain different CV. */
6014 SV * const tmp = newRV(MUTABLE_SV(cv));
6015 sv_setsv(dbsv, tmp);
6019 gv_efullname3(dbsv, gv, NULL);
6023 const int type = SvTYPE(dbsv);
6024 if (type < SVt_PVIV && type != SVt_IV)
6025 sv_upgrade(dbsv, SVt_PVIV);
6026 (void)SvIOK_on(dbsv);
6027 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6032 Perl_my_dirfd(pTHX_ DIR * dir) {
6034 /* Most dirfd implementations have problems when passed NULL. */
6039 #elif defined(HAS_DIR_DD_FD)
6042 Perl_die(aTHX_ PL_no_func, "dirfd");
6049 Perl_get_re_arg(pTHX_ SV *sv) {
6056 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6057 SvTYPE(tmpsv) == SVt_REGEXP)
6059 return (REGEXP*) tmpsv;
6068 * c-indentation-style: bsd
6070 * indent-tabs-mode: t
6073 * ex: set ts=8 sts=4 sw=4 noet: