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 */
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 S_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("@", GV_ADD);
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 */
1671 register const I32 len = strlen(nam);
1674 /* where does it go? */
1675 for (i = 0; environ[i]; i++) {
1676 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1680 if (environ == PL_origenviron) { /* need we copy environment? */
1686 while (environ[max])
1688 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1689 for (j=0; j<max; j++) { /* copy environment */
1690 const int len = strlen(environ[j]);
1691 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1692 Copy(environ[j], tmpenv[j], len+1, char);
1695 environ = tmpenv; /* tell exec where it is now */
1698 safesysfree(environ[i]);
1699 while (environ[i]) {
1700 environ[i] = environ[i+1];
1705 if (!environ[i]) { /* does not exist yet */
1706 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1707 environ[i+1] = NULL; /* make sure it's null terminated */
1710 safesysfree(environ[i]);
1714 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1715 /* all that work just for this */
1716 my_setenv_format(environ[i], nam, nlen, val, vlen);
1719 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1720 # if defined(HAS_UNSETENV)
1722 (void)unsetenv(nam);
1724 (void)setenv(nam, val, 1);
1726 # else /* ! HAS_UNSETENV */
1727 (void)setenv(nam, val, 1);
1728 # endif /* HAS_UNSETENV */
1730 # if defined(HAS_UNSETENV)
1732 (void)unsetenv(nam);
1734 const int nlen = strlen(nam);
1735 const int vlen = strlen(val);
1736 char * const new_env =
1737 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1738 my_setenv_format(new_env, nam, nlen, val, vlen);
1739 (void)putenv(new_env);
1741 # else /* ! HAS_UNSETENV */
1743 const int nlen = strlen(nam);
1749 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1750 /* all that work just for this */
1751 my_setenv_format(new_env, nam, nlen, val, vlen);
1752 (void)putenv(new_env);
1753 # endif /* HAS_UNSETENV */
1754 # endif /* __CYGWIN__ */
1755 #ifndef PERL_USE_SAFE_PUTENV
1761 #else /* WIN32 || NETWARE */
1764 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1767 register char *envstr;
1768 const int nlen = strlen(nam);
1775 Newx(envstr, nlen+vlen+2, char);
1776 my_setenv_format(envstr, nam, nlen, val, vlen);
1777 (void)PerlEnv_putenv(envstr);
1781 #endif /* WIN32 || NETWARE */
1783 #endif /* !VMS && !EPOC*/
1785 #ifdef UNLINK_ALL_VERSIONS
1787 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1791 PERL_ARGS_ASSERT_UNLNK;
1793 while (PerlLIO_unlink(f) >= 0)
1795 return retries ? 0 : -1;
1799 /* this is a drop-in replacement for bcopy() */
1800 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1802 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1804 char * const retval = to;
1806 PERL_ARGS_ASSERT_MY_BCOPY;
1808 if (from - to >= 0) {
1816 *(--to) = *(--from);
1822 /* this is a drop-in replacement for memset() */
1825 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1827 char * const retval = loc;
1829 PERL_ARGS_ASSERT_MY_MEMSET;
1837 /* this is a drop-in replacement for bzero() */
1838 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1840 Perl_my_bzero(register char *loc, register I32 len)
1842 char * const retval = loc;
1844 PERL_ARGS_ASSERT_MY_BZERO;
1852 /* this is a drop-in replacement for memcmp() */
1853 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1855 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1857 register const U8 *a = (const U8 *)s1;
1858 register const U8 *b = (const U8 *)s2;
1861 PERL_ARGS_ASSERT_MY_MEMCMP;
1864 if ((tmp = *a++ - *b++))
1869 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1872 /* This vsprintf replacement should generally never get used, since
1873 vsprintf was available in both System V and BSD 2.11. (There may
1874 be some cross-compilation or embedded set-ups where it is needed,
1877 If you encounter a problem in this function, it's probably a symptom
1878 that Configure failed to detect your system's vprintf() function.
1879 See the section on "item vsprintf" in the INSTALL file.
1881 This version may compile on systems with BSD-ish <stdio.h>,
1882 but probably won't on others.
1885 #ifdef USE_CHAR_VSPRINTF
1890 vsprintf(char *dest, const char *pat, void *args)
1894 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1895 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1896 FILE_cnt(&fakebuf) = 32767;
1898 /* These probably won't compile -- If you really need
1899 this, you'll have to figure out some other method. */
1900 fakebuf._ptr = dest;
1901 fakebuf._cnt = 32767;
1906 fakebuf._flag = _IOWRT|_IOSTRG;
1907 _doprnt(pat, args, &fakebuf); /* what a kludge */
1908 #if defined(STDIO_PTR_LVALUE)
1909 *(FILE_ptr(&fakebuf)++) = '\0';
1911 /* PerlIO has probably #defined away fputc, but we want it here. */
1913 # undef fputc /* XXX Should really restore it later */
1915 (void)fputc('\0', &fakebuf);
1917 #ifdef USE_CHAR_VSPRINTF
1920 return 0; /* perl doesn't use return value */
1924 #endif /* HAS_VPRINTF */
1927 #if BYTEORDER != 0x4321
1929 Perl_my_swap(pTHX_ short s)
1931 #if (BYTEORDER & 1) == 0
1934 result = ((s & 255) << 8) + ((s >> 8) & 255);
1942 Perl_my_htonl(pTHX_ long l)
1946 char c[sizeof(long)];
1949 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1950 #if BYTEORDER == 0x12345678
1953 u.c[0] = (l >> 24) & 255;
1954 u.c[1] = (l >> 16) & 255;
1955 u.c[2] = (l >> 8) & 255;
1959 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1960 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1965 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1966 u.c[o & 0xf] = (l >> s) & 255;
1974 Perl_my_ntohl(pTHX_ long l)
1978 char c[sizeof(long)];
1981 #if BYTEORDER == 0x1234
1982 u.c[0] = (l >> 24) & 255;
1983 u.c[1] = (l >> 16) & 255;
1984 u.c[2] = (l >> 8) & 255;
1988 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1989 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1996 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1997 l |= (u.c[o & 0xf] & 255) << s;
2004 #endif /* BYTEORDER != 0x4321 */
2008 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2009 * If these functions are defined,
2010 * the BYTEORDER is neither 0x1234 nor 0x4321.
2011 * However, this is not assumed.
2015 #define HTOLE(name,type) \
2017 name (register type n) \
2021 char c[sizeof(type)]; \
2024 register U32 s = 0; \
2025 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2026 u.c[i] = (n >> s) & 0xFF; \
2031 #define LETOH(name,type) \
2033 name (register type n) \
2037 char c[sizeof(type)]; \
2040 register U32 s = 0; \
2043 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2044 n |= ((type)(u.c[i] & 0xFF)) << s; \
2050 * Big-endian byte order functions.
2053 #define HTOBE(name,type) \
2055 name (register type n) \
2059 char c[sizeof(type)]; \
2062 register U32 s = 8*(sizeof(u.c)-1); \
2063 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2064 u.c[i] = (n >> s) & 0xFF; \
2069 #define BETOH(name,type) \
2071 name (register type n) \
2075 char c[sizeof(type)]; \
2078 register U32 s = 8*(sizeof(u.c)-1); \
2081 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2082 n |= ((type)(u.c[i] & 0xFF)) << s; \
2088 * If we just can't do it...
2091 #define NOT_AVAIL(name,type) \
2093 name (register type n) \
2095 Perl_croak_nocontext(#name "() not available"); \
2096 return n; /* not reached */ \
2100 #if defined(HAS_HTOVS) && !defined(htovs)
2103 #if defined(HAS_HTOVL) && !defined(htovl)
2106 #if defined(HAS_VTOHS) && !defined(vtohs)
2109 #if defined(HAS_VTOHL) && !defined(vtohl)
2113 #ifdef PERL_NEED_MY_HTOLE16
2115 HTOLE(Perl_my_htole16,U16)
2117 NOT_AVAIL(Perl_my_htole16,U16)
2120 #ifdef PERL_NEED_MY_LETOH16
2122 LETOH(Perl_my_letoh16,U16)
2124 NOT_AVAIL(Perl_my_letoh16,U16)
2127 #ifdef PERL_NEED_MY_HTOBE16
2129 HTOBE(Perl_my_htobe16,U16)
2131 NOT_AVAIL(Perl_my_htobe16,U16)
2134 #ifdef PERL_NEED_MY_BETOH16
2136 BETOH(Perl_my_betoh16,U16)
2138 NOT_AVAIL(Perl_my_betoh16,U16)
2142 #ifdef PERL_NEED_MY_HTOLE32
2144 HTOLE(Perl_my_htole32,U32)
2146 NOT_AVAIL(Perl_my_htole32,U32)
2149 #ifdef PERL_NEED_MY_LETOH32
2151 LETOH(Perl_my_letoh32,U32)
2153 NOT_AVAIL(Perl_my_letoh32,U32)
2156 #ifdef PERL_NEED_MY_HTOBE32
2158 HTOBE(Perl_my_htobe32,U32)
2160 NOT_AVAIL(Perl_my_htobe32,U32)
2163 #ifdef PERL_NEED_MY_BETOH32
2165 BETOH(Perl_my_betoh32,U32)
2167 NOT_AVAIL(Perl_my_betoh32,U32)
2171 #ifdef PERL_NEED_MY_HTOLE64
2173 HTOLE(Perl_my_htole64,U64)
2175 NOT_AVAIL(Perl_my_htole64,U64)
2178 #ifdef PERL_NEED_MY_LETOH64
2180 LETOH(Perl_my_letoh64,U64)
2182 NOT_AVAIL(Perl_my_letoh64,U64)
2185 #ifdef PERL_NEED_MY_HTOBE64
2187 HTOBE(Perl_my_htobe64,U64)
2189 NOT_AVAIL(Perl_my_htobe64,U64)
2192 #ifdef PERL_NEED_MY_BETOH64
2194 BETOH(Perl_my_betoh64,U64)
2196 NOT_AVAIL(Perl_my_betoh64,U64)
2200 #ifdef PERL_NEED_MY_HTOLES
2201 HTOLE(Perl_my_htoles,short)
2203 #ifdef PERL_NEED_MY_LETOHS
2204 LETOH(Perl_my_letohs,short)
2206 #ifdef PERL_NEED_MY_HTOBES
2207 HTOBE(Perl_my_htobes,short)
2209 #ifdef PERL_NEED_MY_BETOHS
2210 BETOH(Perl_my_betohs,short)
2213 #ifdef PERL_NEED_MY_HTOLEI
2214 HTOLE(Perl_my_htolei,int)
2216 #ifdef PERL_NEED_MY_LETOHI
2217 LETOH(Perl_my_letohi,int)
2219 #ifdef PERL_NEED_MY_HTOBEI
2220 HTOBE(Perl_my_htobei,int)
2222 #ifdef PERL_NEED_MY_BETOHI
2223 BETOH(Perl_my_betohi,int)
2226 #ifdef PERL_NEED_MY_HTOLEL
2227 HTOLE(Perl_my_htolel,long)
2229 #ifdef PERL_NEED_MY_LETOHL
2230 LETOH(Perl_my_letohl,long)
2232 #ifdef PERL_NEED_MY_HTOBEL
2233 HTOBE(Perl_my_htobel,long)
2235 #ifdef PERL_NEED_MY_BETOHL
2236 BETOH(Perl_my_betohl,long)
2240 Perl_my_swabn(void *ptr, int n)
2242 register char *s = (char *)ptr;
2243 register char *e = s + (n-1);
2246 PERL_ARGS_ASSERT_MY_SWABN;
2248 for (n /= 2; n > 0; s++, e--, n--) {
2256 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2258 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2261 register I32 This, that;
2267 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2269 PERL_FLUSHALL_FOR_CHILD;
2270 This = (*mode == 'w');
2274 taint_proper("Insecure %s%s", "EXEC");
2276 if (PerlProc_pipe(p) < 0)
2278 /* Try for another pipe pair for error return */
2279 if (PerlProc_pipe(pp) >= 0)
2281 while ((pid = PerlProc_fork()) < 0) {
2282 if (errno != EAGAIN) {
2283 PerlLIO_close(p[This]);
2284 PerlLIO_close(p[that]);
2286 PerlLIO_close(pp[0]);
2287 PerlLIO_close(pp[1]);
2291 if (ckWARN(WARN_PIPE))
2292 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2301 /* Close parent's end of error status pipe (if any) */
2303 PerlLIO_close(pp[0]);
2304 #if defined(HAS_FCNTL) && defined(F_SETFD)
2305 /* Close error pipe automatically if exec works */
2306 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2309 /* Now dup our end of _the_ pipe to right position */
2310 if (p[THIS] != (*mode == 'r')) {
2311 PerlLIO_dup2(p[THIS], *mode == 'r');
2312 PerlLIO_close(p[THIS]);
2313 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2314 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2317 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2318 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2319 /* No automatic close - do it by hand */
2326 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2332 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2338 do_execfree(); /* free any memory malloced by child on fork */
2340 PerlLIO_close(pp[1]);
2341 /* Keep the lower of the two fd numbers */
2342 if (p[that] < p[This]) {
2343 PerlLIO_dup2(p[This], p[that]);
2344 PerlLIO_close(p[This]);
2348 PerlLIO_close(p[that]); /* close child's end of pipe */
2351 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2353 SvUPGRADE(sv,SVt_IV);
2355 PL_forkprocess = pid;
2356 /* If we managed to get status pipe check for exec fail */
2357 if (did_pipes && pid > 0) {
2362 while (n < sizeof(int)) {
2363 n1 = PerlLIO_read(pp[0],
2364 (void*)(((char*)&errkid)+n),
2370 PerlLIO_close(pp[0]);
2372 if (n) { /* Error */
2374 PerlLIO_close(p[This]);
2375 if (n != sizeof(int))
2376 Perl_croak(aTHX_ "panic: kid popen errno read");
2378 pid2 = wait4pid(pid, &status, 0);
2379 } while (pid2 == -1 && errno == EINTR);
2380 errno = errkid; /* Propagate errno from kid */
2385 PerlLIO_close(pp[0]);
2386 return PerlIO_fdopen(p[This], mode);
2388 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2389 return my_syspopen4(aTHX_ NULL, mode, n, args);
2391 Perl_croak(aTHX_ "List form of piped open not implemented");
2392 return (PerlIO *) NULL;
2397 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2398 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2400 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2404 register I32 This, that;
2407 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2411 PERL_ARGS_ASSERT_MY_POPEN;
2413 PERL_FLUSHALL_FOR_CHILD;
2416 return my_syspopen(aTHX_ cmd,mode);
2419 This = (*mode == 'w');
2421 if (doexec && PL_tainting) {
2423 taint_proper("Insecure %s%s", "EXEC");
2425 if (PerlProc_pipe(p) < 0)
2427 if (doexec && PerlProc_pipe(pp) >= 0)
2429 while ((pid = PerlProc_fork()) < 0) {
2430 if (errno != EAGAIN) {
2431 PerlLIO_close(p[This]);
2432 PerlLIO_close(p[that]);
2434 PerlLIO_close(pp[0]);
2435 PerlLIO_close(pp[1]);
2438 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2441 if (ckWARN(WARN_PIPE))
2442 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2453 PerlLIO_close(pp[0]);
2454 #if defined(HAS_FCNTL) && defined(F_SETFD)
2455 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2458 if (p[THIS] != (*mode == 'r')) {
2459 PerlLIO_dup2(p[THIS], *mode == 'r');
2460 PerlLIO_close(p[THIS]);
2461 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2462 PerlLIO_close(p[THAT]);
2465 PerlLIO_close(p[THAT]);
2468 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2475 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2480 /* may or may not use the shell */
2481 do_exec3(cmd, pp[1], did_pipes);
2484 #endif /* defined OS2 */
2486 #ifdef PERLIO_USING_CRLF
2487 /* Since we circumvent IO layers when we manipulate low-level
2488 filedescriptors directly, need to manually switch to the
2489 default, binary, low-level mode; see PerlIOBuf_open(). */
2490 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2493 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2494 SvREADONLY_off(GvSV(tmpgv));
2495 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2496 SvREADONLY_on(GvSV(tmpgv));
2498 #ifdef THREADS_HAVE_PIDS
2499 PL_ppid = (IV)getppid();
2502 #ifdef PERL_USES_PL_PIDSTATUS
2503 hv_clear(PL_pidstatus); /* we have no children */
2509 do_execfree(); /* free any memory malloced by child on vfork */
2511 PerlLIO_close(pp[1]);
2512 if (p[that] < p[This]) {
2513 PerlLIO_dup2(p[This], p[that]);
2514 PerlLIO_close(p[This]);
2518 PerlLIO_close(p[that]);
2521 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2523 SvUPGRADE(sv,SVt_IV);
2525 PL_forkprocess = pid;
2526 if (did_pipes && pid > 0) {
2531 while (n < sizeof(int)) {
2532 n1 = PerlLIO_read(pp[0],
2533 (void*)(((char*)&errkid)+n),
2539 PerlLIO_close(pp[0]);
2541 if (n) { /* Error */
2543 PerlLIO_close(p[This]);
2544 if (n != sizeof(int))
2545 Perl_croak(aTHX_ "panic: kid popen errno read");
2547 pid2 = wait4pid(pid, &status, 0);
2548 } while (pid2 == -1 && errno == EINTR);
2549 errno = errkid; /* Propagate errno from kid */
2554 PerlLIO_close(pp[0]);
2555 return PerlIO_fdopen(p[This], mode);
2558 #if defined(atarist) || defined(EPOC)
2561 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2563 PERL_ARGS_ASSERT_MY_POPEN;
2564 PERL_FLUSHALL_FOR_CHILD;
2565 /* Call system's popen() to get a FILE *, then import it.
2566 used 0 for 2nd parameter to PerlIO_importFILE;
2569 return PerlIO_importFILE(popen(cmd, mode), 0);
2573 FILE *djgpp_popen();
2575 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
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(djgpp_popen(cmd, mode), 0);
2585 #if defined(__LIBCATAMOUNT__)
2587 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2595 #endif /* !DOSISH */
2597 /* this is called in parent before the fork() */
2599 Perl_atfork_lock(void)
2602 #if defined(USE_ITHREADS)
2603 /* locks must be held in locking order (if any) */
2605 MUTEX_LOCK(&PL_malloc_mutex);
2611 /* this is called in both parent and child after the fork() */
2613 Perl_atfork_unlock(void)
2616 #if defined(USE_ITHREADS)
2617 /* locks must be released in same order as in atfork_lock() */
2619 MUTEX_UNLOCK(&PL_malloc_mutex);
2628 #if defined(HAS_FORK)
2630 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2635 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2636 * handlers elsewhere in the code */
2641 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2642 Perl_croak_nocontext("fork() not available");
2644 #endif /* HAS_FORK */
2649 Perl_dump_fds(pTHX_ const char *const s)
2654 PERL_ARGS_ASSERT_DUMP_FDS;
2656 PerlIO_printf(Perl_debug_log,"%s", s);
2657 for (fd = 0; fd < 32; fd++) {
2658 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2659 PerlIO_printf(Perl_debug_log," %d",fd);
2661 PerlIO_printf(Perl_debug_log,"\n");
2664 #endif /* DUMP_FDS */
2668 dup2(int oldfd, int newfd)
2670 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2673 PerlLIO_close(newfd);
2674 return fcntl(oldfd, F_DUPFD, newfd);
2676 #define DUP2_MAX_FDS 256
2677 int fdtmp[DUP2_MAX_FDS];
2683 PerlLIO_close(newfd);
2684 /* good enough for low fd's... */
2685 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2686 if (fdx >= DUP2_MAX_FDS) {
2694 PerlLIO_close(fdtmp[--fdx]);
2701 #ifdef HAS_SIGACTION
2704 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2707 struct sigaction act, oact;
2710 /* only "parent" interpreter can diddle signals */
2711 if (PL_curinterp != aTHX)
2712 return (Sighandler_t) SIG_ERR;
2715 act.sa_handler = (void(*)(int))handler;
2716 sigemptyset(&act.sa_mask);
2719 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2720 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2722 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2723 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2724 act.sa_flags |= SA_NOCLDWAIT;
2726 if (sigaction(signo, &act, &oact) == -1)
2727 return (Sighandler_t) SIG_ERR;
2729 return (Sighandler_t) oact.sa_handler;
2733 Perl_rsignal_state(pTHX_ int signo)
2735 struct sigaction oact;
2736 PERL_UNUSED_CONTEXT;
2738 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2739 return (Sighandler_t) SIG_ERR;
2741 return (Sighandler_t) oact.sa_handler;
2745 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2748 struct sigaction act;
2750 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2753 /* only "parent" interpreter can diddle signals */
2754 if (PL_curinterp != aTHX)
2758 act.sa_handler = (void(*)(int))handler;
2759 sigemptyset(&act.sa_mask);
2762 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2763 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2765 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2766 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2767 act.sa_flags |= SA_NOCLDWAIT;
2769 return sigaction(signo, &act, save);
2773 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2777 /* only "parent" interpreter can diddle signals */
2778 if (PL_curinterp != aTHX)
2782 return sigaction(signo, save, (struct sigaction *)NULL);
2785 #else /* !HAS_SIGACTION */
2788 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2790 #if defined(USE_ITHREADS) && !defined(WIN32)
2791 /* only "parent" interpreter can diddle signals */
2792 if (PL_curinterp != aTHX)
2793 return (Sighandler_t) SIG_ERR;
2796 return PerlProc_signal(signo, handler);
2807 Perl_rsignal_state(pTHX_ int signo)
2810 Sighandler_t oldsig;
2812 #if defined(USE_ITHREADS) && !defined(WIN32)
2813 /* only "parent" interpreter can diddle signals */
2814 if (PL_curinterp != aTHX)
2815 return (Sighandler_t) SIG_ERR;
2819 oldsig = PerlProc_signal(signo, sig_trap);
2820 PerlProc_signal(signo, oldsig);
2822 PerlProc_kill(PerlProc_getpid(), signo);
2827 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2829 #if defined(USE_ITHREADS) && !defined(WIN32)
2830 /* only "parent" interpreter can diddle signals */
2831 if (PL_curinterp != aTHX)
2834 *save = PerlProc_signal(signo, handler);
2835 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2839 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2841 #if defined(USE_ITHREADS) && !defined(WIN32)
2842 /* only "parent" interpreter can diddle signals */
2843 if (PL_curinterp != aTHX)
2846 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2849 #endif /* !HAS_SIGACTION */
2850 #endif /* !PERL_MICRO */
2852 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2853 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2855 Perl_my_pclose(pTHX_ PerlIO *ptr)
2858 Sigsave_t hstat, istat, qstat;
2867 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2869 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2871 *svp = &PL_sv_undef;
2873 if (pid == -1) { /* Opened by popen. */
2874 return my_syspclose(ptr);
2877 close_failed = (PerlIO_close(ptr) == EOF);
2880 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2883 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2884 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2885 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2888 pid2 = wait4pid(pid, &status, 0);
2889 } while (pid2 == -1 && errno == EINTR);
2891 rsignal_restore(SIGHUP, &hstat);
2892 rsignal_restore(SIGINT, &istat);
2893 rsignal_restore(SIGQUIT, &qstat);
2899 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2902 #if defined(__LIBCATAMOUNT__)
2904 Perl_my_pclose(pTHX_ PerlIO *ptr)
2909 #endif /* !DOSISH */
2911 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2913 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2917 PERL_ARGS_ASSERT_WAIT4PID;
2920 #ifdef PERL_USES_PL_PIDSTATUS
2923 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2924 pid, rather than a string form. */
2925 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2926 if (svp && *svp != &PL_sv_undef) {
2927 *statusp = SvIVX(*svp);
2928 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2936 hv_iterinit(PL_pidstatus);
2937 if ((entry = hv_iternext(PL_pidstatus))) {
2938 SV * const sv = hv_iterval(PL_pidstatus,entry);
2940 const char * const spid = hv_iterkey(entry,&len);
2942 assert (len == sizeof(Pid_t));
2943 memcpy((char *)&pid, spid, len);
2944 *statusp = SvIVX(sv);
2945 /* The hash iterator is currently on this entry, so simply
2946 calling hv_delete would trigger the lazy delete, which on
2947 aggregate does more work, beacuse next call to hv_iterinit()
2948 would spot the flag, and have to call the delete routine,
2949 while in the meantime any new entries can't re-use that
2951 hv_iterinit(PL_pidstatus);
2952 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2959 # ifdef HAS_WAITPID_RUNTIME
2960 if (!HAS_WAITPID_RUNTIME)
2963 result = PerlProc_waitpid(pid,statusp,flags);
2966 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2967 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2970 #ifdef PERL_USES_PL_PIDSTATUS
2971 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2976 Perl_croak(aTHX_ "Can't do waitpid with flags");
2978 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2979 pidgone(result,*statusp);
2985 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2988 if (result < 0 && errno == EINTR) {
2990 errno = EINTR; /* reset in case a signal handler changed $! */
2994 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2996 #ifdef PERL_USES_PL_PIDSTATUS
2998 S_pidgone(pTHX_ Pid_t pid, int status)
3002 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
3003 SvUPGRADE(sv,SVt_IV);
3004 SvIV_set(sv, status);
3009 #if defined(atarist) || defined(OS2) || defined(EPOC)
3012 int /* Cannot prototype with I32
3014 my_syspclose(PerlIO *ptr)
3017 Perl_my_pclose(pTHX_ PerlIO *ptr)
3020 /* Needs work for PerlIO ! */
3021 FILE * const f = PerlIO_findFILE(ptr);
3022 const I32 result = pclose(f);
3023 PerlIO_releaseFILE(ptr,f);
3031 Perl_my_pclose(pTHX_ PerlIO *ptr)
3033 /* Needs work for PerlIO ! */
3034 FILE * const f = PerlIO_findFILE(ptr);
3035 I32 result = djgpp_pclose(f);
3036 result = (result << 8) & 0xff00;
3037 PerlIO_releaseFILE(ptr,f);
3043 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
3046 register const char * const frombase = from;
3047 PERL_UNUSED_CONTEXT;
3049 PERL_ARGS_ASSERT_REPEATCPY;
3052 register const char c = *from;
3057 while (count-- > 0) {
3058 for (todo = len; todo > 0; todo--) {
3067 Perl_same_dirent(pTHX_ const char *a, const char *b)
3069 char *fa = strrchr(a,'/');
3070 char *fb = strrchr(b,'/');
3073 SV * const tmpsv = sv_newmortal();
3075 PERL_ARGS_ASSERT_SAME_DIRENT;
3088 sv_setpvs(tmpsv, ".");
3090 sv_setpvn(tmpsv, a, fa - a);
3091 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3094 sv_setpvs(tmpsv, ".");
3096 sv_setpvn(tmpsv, b, fb - b);
3097 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3099 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3100 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3102 #endif /* !HAS_RENAME */
3105 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3106 const char *const *const search_ext, I32 flags)
3109 const char *xfound = NULL;
3110 char *xfailed = NULL;
3111 char tmpbuf[MAXPATHLEN];
3116 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3117 # define SEARCH_EXTS ".bat", ".cmd", NULL
3118 # define MAX_EXT_LEN 4
3121 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3122 # define MAX_EXT_LEN 4
3125 # define SEARCH_EXTS ".pl", ".com", NULL
3126 # define MAX_EXT_LEN 4
3128 /* additional extensions to try in each dir if scriptname not found */
3130 static const char *const exts[] = { SEARCH_EXTS };
3131 const char *const *const ext = search_ext ? search_ext : exts;
3132 int extidx = 0, i = 0;
3133 const char *curext = NULL;
3135 PERL_UNUSED_ARG(search_ext);
3136 # define MAX_EXT_LEN 0
3139 PERL_ARGS_ASSERT_FIND_SCRIPT;
3142 * If dosearch is true and if scriptname does not contain path
3143 * delimiters, search the PATH for scriptname.
3145 * If SEARCH_EXTS is also defined, will look for each
3146 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3147 * while searching the PATH.
3149 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3150 * proceeds as follows:
3151 * If DOSISH or VMSISH:
3152 * + look for ./scriptname{,.foo,.bar}
3153 * + search the PATH for scriptname{,.foo,.bar}
3156 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3157 * this will not look in '.' if it's not in the PATH)
3162 # ifdef ALWAYS_DEFTYPES
3163 len = strlen(scriptname);
3164 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3165 int idx = 0, deftypes = 1;
3168 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3171 int idx = 0, deftypes = 1;
3174 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3176 /* The first time through, just add SEARCH_EXTS to whatever we
3177 * already have, so we can check for default file types. */
3179 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3185 if ((strlen(tmpbuf) + strlen(scriptname)
3186 + MAX_EXT_LEN) >= sizeof tmpbuf)
3187 continue; /* don't search dir with too-long name */
3188 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3192 if (strEQ(scriptname, "-"))
3194 if (dosearch) { /* Look in '.' first. */
3195 const char *cur = scriptname;
3197 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3199 if (strEQ(ext[i++],curext)) {
3200 extidx = -1; /* already has an ext */
3205 DEBUG_p(PerlIO_printf(Perl_debug_log,
3206 "Looking for %s\n",cur));
3207 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3208 && !S_ISDIR(PL_statbuf.st_mode)) {
3216 if (cur == scriptname) {
3217 len = strlen(scriptname);
3218 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3220 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3223 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3224 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3229 if (dosearch && !strchr(scriptname, '/')
3231 && !strchr(scriptname, '\\')
3233 && (s = PerlEnv_getenv("PATH")))
3237 bufend = s + strlen(s);
3238 while (s < bufend) {
3239 #if defined(atarist) || defined(DOSISH)
3244 && *s != ';'; len++, s++) {
3245 if (len < sizeof tmpbuf)
3248 if (len < sizeof tmpbuf)
3250 #else /* ! (atarist || DOSISH) */
3251 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3254 #endif /* ! (atarist || DOSISH) */
3257 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3258 continue; /* don't search dir with too-long name */
3260 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3261 && tmpbuf[len - 1] != '/'
3262 && tmpbuf[len - 1] != '\\'
3265 tmpbuf[len++] = '/';
3266 if (len == 2 && tmpbuf[0] == '.')
3268 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3272 len = strlen(tmpbuf);
3273 if (extidx > 0) /* reset after previous loop */
3277 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3278 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3279 if (S_ISDIR(PL_statbuf.st_mode)) {
3283 } while ( retval < 0 /* not there */
3284 && extidx>=0 && ext[extidx] /* try an extension? */
3285 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3290 if (S_ISREG(PL_statbuf.st_mode)
3291 && cando(S_IRUSR,TRUE,&PL_statbuf)
3292 #if !defined(DOSISH)
3293 && cando(S_IXUSR,TRUE,&PL_statbuf)
3297 xfound = tmpbuf; /* bingo! */
3301 xfailed = savepv(tmpbuf);
3304 if (!xfound && !seen_dot && !xfailed &&
3305 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3306 || S_ISDIR(PL_statbuf.st_mode)))
3308 seen_dot = 1; /* Disable message. */
3310 if (flags & 1) { /* do or die? */
3311 Perl_croak(aTHX_ "Can't %s %s%s%s",
3312 (xfailed ? "execute" : "find"),
3313 (xfailed ? xfailed : scriptname),
3314 (xfailed ? "" : " on PATH"),
3315 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3320 scriptname = xfound;
3322 return (scriptname ? savepv(scriptname) : NULL);
3325 #ifndef PERL_GET_CONTEXT_DEFINED
3328 Perl_get_context(void)
3331 #if defined(USE_ITHREADS)
3332 # ifdef OLD_PTHREADS_API
3334 if (pthread_getspecific(PL_thr_key, &t))
3335 Perl_croak_nocontext("panic: pthread_getspecific");
3338 # ifdef I_MACH_CTHREADS
3339 return (void*)cthread_data(cthread_self());
3341 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3350 Perl_set_context(void *t)
3353 PERL_ARGS_ASSERT_SET_CONTEXT;
3354 #if defined(USE_ITHREADS)
3355 # ifdef I_MACH_CTHREADS
3356 cthread_set_data(cthread_self(), t);
3358 if (pthread_setspecific(PL_thr_key, t))
3359 Perl_croak_nocontext("panic: pthread_setspecific");
3366 #endif /* !PERL_GET_CONTEXT_DEFINED */
3368 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3377 Perl_get_op_names(pTHX)
3379 PERL_UNUSED_CONTEXT;
3380 return (char **)PL_op_name;
3384 Perl_get_op_descs(pTHX)
3386 PERL_UNUSED_CONTEXT;
3387 return (char **)PL_op_desc;
3391 Perl_get_no_modify(pTHX)
3393 PERL_UNUSED_CONTEXT;
3394 return PL_no_modify;
3398 Perl_get_opargs(pTHX)
3400 PERL_UNUSED_CONTEXT;
3401 return (U32 *)PL_opargs;
3405 Perl_get_ppaddr(pTHX)
3408 PERL_UNUSED_CONTEXT;
3409 return (PPADDR_t*)PL_ppaddr;
3412 #ifndef HAS_GETENV_LEN
3414 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3416 char * const env_trans = PerlEnv_getenv(env_elem);
3417 PERL_UNUSED_CONTEXT;
3418 PERL_ARGS_ASSERT_GETENV_LEN;
3420 *len = strlen(env_trans);
3427 Perl_get_vtbl(pTHX_ int vtbl_id)
3429 const MGVTBL* result;
3430 PERL_UNUSED_CONTEXT;
3434 result = &PL_vtbl_sv;
3437 result = &PL_vtbl_env;
3439 case want_vtbl_envelem:
3440 result = &PL_vtbl_envelem;
3443 result = &PL_vtbl_sig;
3445 case want_vtbl_sigelem:
3446 result = &PL_vtbl_sigelem;
3448 case want_vtbl_pack:
3449 result = &PL_vtbl_pack;
3451 case want_vtbl_packelem:
3452 result = &PL_vtbl_packelem;
3454 case want_vtbl_dbline:
3455 result = &PL_vtbl_dbline;
3458 result = &PL_vtbl_isa;
3460 case want_vtbl_isaelem:
3461 result = &PL_vtbl_isaelem;
3463 case want_vtbl_arylen:
3464 result = &PL_vtbl_arylen;
3466 case want_vtbl_mglob:
3467 result = &PL_vtbl_mglob;
3469 case want_vtbl_nkeys:
3470 result = &PL_vtbl_nkeys;
3472 case want_vtbl_taint:
3473 result = &PL_vtbl_taint;
3475 case want_vtbl_substr:
3476 result = &PL_vtbl_substr;
3479 result = &PL_vtbl_vec;
3482 result = &PL_vtbl_pos;
3485 result = &PL_vtbl_bm;
3488 result = &PL_vtbl_fm;
3490 case want_vtbl_uvar:
3491 result = &PL_vtbl_uvar;
3493 case want_vtbl_defelem:
3494 result = &PL_vtbl_defelem;
3496 case want_vtbl_regexp:
3497 result = &PL_vtbl_regexp;
3499 case want_vtbl_regdata:
3500 result = &PL_vtbl_regdata;
3502 case want_vtbl_regdatum:
3503 result = &PL_vtbl_regdatum;
3505 #ifdef USE_LOCALE_COLLATE
3506 case want_vtbl_collxfrm:
3507 result = &PL_vtbl_collxfrm;
3510 case want_vtbl_amagic:
3511 result = &PL_vtbl_amagic;
3513 case want_vtbl_amagicelem:
3514 result = &PL_vtbl_amagicelem;
3516 case want_vtbl_backref:
3517 result = &PL_vtbl_backref;
3519 case want_vtbl_utf8:
3520 result = &PL_vtbl_utf8;
3526 return (MGVTBL*)result;
3530 Perl_my_fflush_all(pTHX)
3532 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3533 return PerlIO_flush(NULL);
3535 # if defined(HAS__FWALK)
3536 extern int fflush(FILE *);
3537 /* undocumented, unprototyped, but very useful BSDism */
3538 extern void _fwalk(int (*)(FILE *));
3542 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3544 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3545 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3547 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3548 open_max = sysconf(_SC_OPEN_MAX);
3551 open_max = FOPEN_MAX;
3554 open_max = OPEN_MAX;
3565 for (i = 0; i < open_max; i++)
3566 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3567 STDIO_STREAM_ARRAY[i]._file < open_max &&
3568 STDIO_STREAM_ARRAY[i]._flag)
3569 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3573 SETERRNO(EBADF,RMS_IFI);
3580 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3582 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3584 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3585 if (ckWARN(WARN_IO)) {
3586 const char * const direction =
3587 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3589 Perl_warner(aTHX_ packWARN(WARN_IO),
3590 "Filehandle %s opened only for %sput",
3593 Perl_warner(aTHX_ packWARN(WARN_IO),
3594 "Filehandle opened only for %sput", direction);
3601 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3603 warn_type = WARN_CLOSED;
3607 warn_type = WARN_UNOPENED;
3610 if (ckWARN(warn_type)) {
3611 const char * const pars =
3612 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3613 const char * const func =
3615 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3616 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3617 op < 0 ? "" : /* handle phoney cases */
3619 const char * const type =
3621 (OP_IS_SOCKET(op) ||
3622 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3623 "socket" : "filehandle");
3624 if (name && *name) {
3625 Perl_warner(aTHX_ packWARN(warn_type),
3626 "%s%s on %s %s %s", func, pars, vile, type, name);
3627 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3629 aTHX_ packWARN(warn_type),
3630 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3635 Perl_warner(aTHX_ packWARN(warn_type),
3636 "%s%s on %s %s", func, pars, vile, type);
3637 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3639 aTHX_ packWARN(warn_type),
3640 "\t(Are you trying to call %s%s on dirhandle?)\n",
3649 /* in ASCII order, not that it matters */
3650 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3653 Perl_ebcdic_control(pTHX_ int ch)
3661 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3662 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3665 if (ctlp == controllablechars)
3666 return('\177'); /* DEL */
3668 return((unsigned char)(ctlp - controllablechars - 1));
3669 } else { /* Want uncontrol */
3670 if (ch == '\177' || ch == -1)
3672 else if (ch == '\157')
3674 else if (ch == '\174')
3676 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3678 else if (ch == '\155')
3680 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3681 return(controllablechars[ch+1]);
3683 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3688 /* To workaround core dumps from the uninitialised tm_zone we get the
3689 * system to give us a reasonable struct to copy. This fix means that
3690 * strftime uses the tm_zone and tm_gmtoff values returned by
3691 * localtime(time()). That should give the desired result most of the
3692 * time. But probably not always!
3694 * This does not address tzname aspects of NETaa14816.
3699 # ifndef STRUCT_TM_HASZONE
3700 # define STRUCT_TM_HASZONE
3704 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3705 # ifndef HAS_TM_TM_ZONE
3706 # define HAS_TM_TM_ZONE
3711 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3713 #ifdef HAS_TM_TM_ZONE
3715 const struct tm* my_tm;
3716 PERL_ARGS_ASSERT_INIT_TM;
3718 my_tm = localtime(&now);
3720 Copy(my_tm, ptm, 1, struct tm);
3722 PERL_ARGS_ASSERT_INIT_TM;
3723 PERL_UNUSED_ARG(ptm);
3728 * mini_mktime - normalise struct tm values without the localtime()
3729 * semantics (and overhead) of mktime().
3732 Perl_mini_mktime(pTHX_ struct tm *ptm)
3736 int month, mday, year, jday;
3737 int odd_cent, odd_year;
3738 PERL_UNUSED_CONTEXT;
3740 PERL_ARGS_ASSERT_MINI_MKTIME;
3742 #define DAYS_PER_YEAR 365
3743 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3744 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3745 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3746 #define SECS_PER_HOUR (60*60)
3747 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3748 /* parentheses deliberately absent on these two, otherwise they don't work */
3749 #define MONTH_TO_DAYS 153/5
3750 #define DAYS_TO_MONTH 5/153
3751 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3752 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3753 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3754 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3757 * Year/day algorithm notes:
3759 * With a suitable offset for numeric value of the month, one can find
3760 * an offset into the year by considering months to have 30.6 (153/5) days,
3761 * using integer arithmetic (i.e., with truncation). To avoid too much
3762 * messing about with leap days, we consider January and February to be
3763 * the 13th and 14th month of the previous year. After that transformation,
3764 * we need the month index we use to be high by 1 from 'normal human' usage,
3765 * so the month index values we use run from 4 through 15.
3767 * Given that, and the rules for the Gregorian calendar (leap years are those
3768 * divisible by 4 unless also divisible by 100, when they must be divisible
3769 * by 400 instead), we can simply calculate the number of days since some
3770 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3771 * the days we derive from our month index, and adding in the day of the
3772 * month. The value used here is not adjusted for the actual origin which
3773 * it normally would use (1 January A.D. 1), since we're not exposing it.
3774 * We're only building the value so we can turn around and get the
3775 * normalised values for the year, month, day-of-month, and day-of-year.
3777 * For going backward, we need to bias the value we're using so that we find
3778 * the right year value. (Basically, we don't want the contribution of
3779 * March 1st to the number to apply while deriving the year). Having done
3780 * that, we 'count up' the contribution to the year number by accounting for
3781 * full quadracenturies (400-year periods) with their extra leap days, plus
3782 * the contribution from full centuries (to avoid counting in the lost leap
3783 * days), plus the contribution from full quad-years (to count in the normal
3784 * leap days), plus the leftover contribution from any non-leap years.
3785 * At this point, if we were working with an actual leap day, we'll have 0
3786 * days left over. This is also true for March 1st, however. So, we have
3787 * to special-case that result, and (earlier) keep track of the 'odd'
3788 * century and year contributions. If we got 4 extra centuries in a qcent,
3789 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3790 * Otherwise, we add back in the earlier bias we removed (the 123 from
3791 * figuring in March 1st), find the month index (integer division by 30.6),
3792 * and the remainder is the day-of-month. We then have to convert back to
3793 * 'real' months (including fixing January and February from being 14/15 in
3794 * the previous year to being in the proper year). After that, to get
3795 * tm_yday, we work with the normalised year and get a new yearday value for
3796 * January 1st, which we subtract from the yearday value we had earlier,
3797 * representing the date we've re-built. This is done from January 1
3798 * because tm_yday is 0-origin.
3800 * Since POSIX time routines are only guaranteed to work for times since the
3801 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3802 * applies Gregorian calendar rules even to dates before the 16th century
3803 * doesn't bother me. Besides, you'd need cultural context for a given
3804 * date to know whether it was Julian or Gregorian calendar, and that's
3805 * outside the scope for this routine. Since we convert back based on the
3806 * same rules we used to build the yearday, you'll only get strange results
3807 * for input which needed normalising, or for the 'odd' century years which
3808 * were leap years in the Julian calander but not in the Gregorian one.
3809 * I can live with that.
3811 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3812 * that's still outside the scope for POSIX time manipulation, so I don't
3816 year = 1900 + ptm->tm_year;
3817 month = ptm->tm_mon;
3818 mday = ptm->tm_mday;
3819 /* allow given yday with no month & mday to dominate the result */
3820 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3823 jday = 1 + ptm->tm_yday;
3832 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3833 yearday += month*MONTH_TO_DAYS + mday + jday;
3835 * Note that we don't know when leap-seconds were or will be,
3836 * so we have to trust the user if we get something which looks
3837 * like a sensible leap-second. Wild values for seconds will
3838 * be rationalised, however.
3840 if ((unsigned) ptm->tm_sec <= 60) {
3847 secs += 60 * ptm->tm_min;
3848 secs += SECS_PER_HOUR * ptm->tm_hour;
3850 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3851 /* got negative remainder, but need positive time */
3852 /* back off an extra day to compensate */
3853 yearday += (secs/SECS_PER_DAY)-1;
3854 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3857 yearday += (secs/SECS_PER_DAY);
3858 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3861 else if (secs >= SECS_PER_DAY) {
3862 yearday += (secs/SECS_PER_DAY);
3863 secs %= SECS_PER_DAY;
3865 ptm->tm_hour = secs/SECS_PER_HOUR;
3866 secs %= SECS_PER_HOUR;
3867 ptm->tm_min = secs/60;
3869 ptm->tm_sec += secs;
3870 /* done with time of day effects */
3872 * The algorithm for yearday has (so far) left it high by 428.
3873 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3874 * bias it by 123 while trying to figure out what year it
3875 * really represents. Even with this tweak, the reverse
3876 * translation fails for years before A.D. 0001.
3877 * It would still fail for Feb 29, but we catch that one below.
3879 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3880 yearday -= YEAR_ADJUST;
3881 year = (yearday / DAYS_PER_QCENT) * 400;
3882 yearday %= DAYS_PER_QCENT;
3883 odd_cent = yearday / DAYS_PER_CENT;
3884 year += odd_cent * 100;
3885 yearday %= DAYS_PER_CENT;
3886 year += (yearday / DAYS_PER_QYEAR) * 4;
3887 yearday %= DAYS_PER_QYEAR;
3888 odd_year = yearday / DAYS_PER_YEAR;
3890 yearday %= DAYS_PER_YEAR;
3891 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3896 yearday += YEAR_ADJUST; /* recover March 1st crock */
3897 month = yearday*DAYS_TO_MONTH;
3898 yearday -= month*MONTH_TO_DAYS;
3899 /* recover other leap-year adjustment */
3908 ptm->tm_year = year - 1900;
3910 ptm->tm_mday = yearday;
3911 ptm->tm_mon = month;
3915 ptm->tm_mon = month - 1;
3917 /* re-build yearday based on Jan 1 to get tm_yday */
3919 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3920 yearday += 14*MONTH_TO_DAYS + 1;
3921 ptm->tm_yday = jday - yearday;
3922 /* fix tm_wday if not overridden by caller */
3923 if ((unsigned)ptm->tm_wday > 6)
3924 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3928 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)
3936 PERL_ARGS_ASSERT_MY_STRFTIME;
3938 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3941 mytm.tm_hour = hour;
3942 mytm.tm_mday = mday;
3944 mytm.tm_year = year;
3945 mytm.tm_wday = wday;
3946 mytm.tm_yday = yday;
3947 mytm.tm_isdst = isdst;
3949 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3950 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3955 #ifdef HAS_TM_TM_GMTOFF
3956 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3958 #ifdef HAS_TM_TM_ZONE
3959 mytm.tm_zone = mytm2.tm_zone;
3964 Newx(buf, buflen, char);
3965 len = strftime(buf, buflen, fmt, &mytm);
3967 ** The following is needed to handle to the situation where
3968 ** tmpbuf overflows. Basically we want to allocate a buffer
3969 ** and try repeatedly. The reason why it is so complicated
3970 ** is that getting a return value of 0 from strftime can indicate
3971 ** one of the following:
3972 ** 1. buffer overflowed,
3973 ** 2. illegal conversion specifier, or
3974 ** 3. the format string specifies nothing to be returned(not
3975 ** an error). This could be because format is an empty string
3976 ** or it specifies %p that yields an empty string in some locale.
3977 ** If there is a better way to make it portable, go ahead by
3980 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3983 /* Possibly buf overflowed - try again with a bigger buf */
3984 const int fmtlen = strlen(fmt);
3985 int bufsize = fmtlen + buflen;
3987 Newx(buf, bufsize, char);
3989 buflen = strftime(buf, bufsize, fmt, &mytm);
3990 if (buflen > 0 && buflen < bufsize)
3992 /* heuristic to prevent out-of-memory errors */
3993 if (bufsize > 100*fmtlen) {
3999 Renew(buf, bufsize, char);
4004 Perl_croak(aTHX_ "panic: no strftime");
4010 #define SV_CWD_RETURN_UNDEF \
4011 sv_setsv(sv, &PL_sv_undef); \
4014 #define SV_CWD_ISDOT(dp) \
4015 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4016 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4019 =head1 Miscellaneous Functions
4021 =for apidoc getcwd_sv
4023 Fill the sv with current working directory
4028 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4029 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4030 * getcwd(3) if available
4031 * Comments from the orignal:
4032 * This is a faster version of getcwd. It's also more dangerous
4033 * because you might chdir out of a directory that you can't chdir
4037 Perl_getcwd_sv(pTHX_ register SV *sv)
4041 #ifndef INCOMPLETE_TAINTS
4045 PERL_ARGS_ASSERT_GETCWD_SV;
4049 char buf[MAXPATHLEN];
4051 /* Some getcwd()s automatically allocate a buffer of the given
4052 * size from the heap if they are given a NULL buffer pointer.
4053 * The problem is that this behaviour is not portable. */
4054 if (getcwd(buf, sizeof(buf) - 1)) {
4059 sv_setsv(sv, &PL_sv_undef);
4067 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4071 SvUPGRADE(sv, SVt_PV);
4073 if (PerlLIO_lstat(".", &statbuf) < 0) {
4074 SV_CWD_RETURN_UNDEF;
4077 orig_cdev = statbuf.st_dev;
4078 orig_cino = statbuf.st_ino;
4088 if (PerlDir_chdir("..") < 0) {
4089 SV_CWD_RETURN_UNDEF;
4091 if (PerlLIO_stat(".", &statbuf) < 0) {
4092 SV_CWD_RETURN_UNDEF;
4095 cdev = statbuf.st_dev;
4096 cino = statbuf.st_ino;
4098 if (odev == cdev && oino == cino) {
4101 if (!(dir = PerlDir_open("."))) {
4102 SV_CWD_RETURN_UNDEF;
4105 while ((dp = PerlDir_read(dir)) != NULL) {
4107 namelen = dp->d_namlen;
4109 namelen = strlen(dp->d_name);
4112 if (SV_CWD_ISDOT(dp)) {
4116 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4117 SV_CWD_RETURN_UNDEF;
4120 tdev = statbuf.st_dev;
4121 tino = statbuf.st_ino;
4122 if (tino == oino && tdev == odev) {
4128 SV_CWD_RETURN_UNDEF;
4131 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4132 SV_CWD_RETURN_UNDEF;
4135 SvGROW(sv, pathlen + namelen + 1);
4139 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4142 /* prepend current directory to the front */
4144 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4145 pathlen += (namelen + 1);
4147 #ifdef VOID_CLOSEDIR
4150 if (PerlDir_close(dir) < 0) {
4151 SV_CWD_RETURN_UNDEF;
4157 SvCUR_set(sv, pathlen);
4161 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4162 SV_CWD_RETURN_UNDEF;
4165 if (PerlLIO_stat(".", &statbuf) < 0) {
4166 SV_CWD_RETURN_UNDEF;
4169 cdev = statbuf.st_dev;
4170 cino = statbuf.st_ino;
4172 if (cdev != orig_cdev || cino != orig_cino) {
4173 Perl_croak(aTHX_ "Unstable directory path, "
4174 "current directory changed unexpectedly");
4185 #define VERSION_MAX 0x7FFFFFFF
4187 =for apidoc scan_version
4189 Returns a pointer to the next character after the parsed
4190 version string, as well as upgrading the passed in SV to
4193 Function must be called with an already existing SV like
4196 s = scan_version(s, SV *sv, bool qv);
4198 Performs some preprocessing to the string to ensure that
4199 it has the correct characteristics of a version. Flags the
4200 object if it contains an underscore (which denotes this
4201 is an alpha version). The boolean qv denotes that the version
4202 should be interpreted as if it had multiple decimals, even if
4209 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4218 AV * const av = newAV();
4219 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4221 PERL_ARGS_ASSERT_SCAN_VERSION;
4223 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4225 while (isSPACE(*s)) /* leading whitespace is OK */
4231 s++; /* get past 'v' */
4232 qv = 1; /* force quoted version processing */
4237 /* pre-scan the input string to check for decimals/underbars */
4238 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4243 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4247 else if ( *pos == '_' )
4250 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4252 width = pos - last - 1; /* natural width of sub-version */
4257 if ( alpha && !saw_period )
4258 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4260 if ( alpha && saw_period && width == 0 )
4261 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4263 if ( saw_period > 1 )
4264 qv = 1; /* force quoted version processing */
4270 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4272 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4273 if ( !qv && width < 3 )
4274 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4276 while (isDIGIT(*pos))
4278 if (!isALPHA(*pos)) {
4284 /* this is atoi() that delimits on underscores */
4285 const char *end = pos;
4289 /* the following if() will only be true after the decimal
4290 * point of a version originally created with a bare
4291 * floating point number, i.e. not quoted in any way
4293 if ( !qv && s > start && saw_period == 1 ) {
4297 rev += (*s - '0') * mult;
4299 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4300 || (PERL_ABS(rev) > VERSION_MAX )) {
4301 if(ckWARN(WARN_OVERFLOW))
4302 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4303 "Integer overflow in version %d",VERSION_MAX);
4314 while (--end >= s) {
4316 rev += (*end - '0') * mult;
4318 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4319 || (PERL_ABS(rev) > VERSION_MAX )) {
4320 if(ckWARN(WARN_OVERFLOW))
4321 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4322 "Integer overflow in version");
4331 /* Append revision */
4332 av_push(av, newSViv(rev));
4337 else if ( *pos == '.' )
4339 else if ( *pos == '_' && isDIGIT(pos[1]) )
4341 else if ( isDIGIT(*pos) )
4348 while ( isDIGIT(*pos) )
4353 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4361 if ( qv ) { /* quoted versions always get at least three terms*/
4362 I32 len = av_len(av);
4363 /* This for loop appears to trigger a compiler bug on OS X, as it
4364 loops infinitely. Yes, len is negative. No, it makes no sense.
4365 Compiler in question is:
4366 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4367 for ( len = 2 - len; len > 0; len-- )
4368 av_push(MUTABLE_AV(sv), newSViv(0));
4372 av_push(av, newSViv(0));
4375 /* need to save off the current version string for later */
4377 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4378 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4379 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4381 else if ( s > start ) {
4382 SV * orig = newSVpvn(start,s-start);
4383 if ( qv && saw_period == 1 && *start != 'v' ) {
4384 /* need to insert a v to be consistent */
4385 sv_insert(orig, 0, 0, "v", 1);
4387 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4390 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4391 av_push(av, newSViv(0));
4394 /* And finally, store the AV in the hash */
4395 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4397 /* fix RT#19517 - special case 'undef' as string */
4398 if ( *s == 'u' && strEQ(s,"undef") ) {
4406 =for apidoc new_version
4408 Returns a new version object based on the passed in SV:
4410 SV *sv = new_version(SV *ver);
4412 Does not alter the passed in ver SV. See "upg_version" if you
4413 want to upgrade the SV.
4419 Perl_new_version(pTHX_ SV *ver)
4422 SV * const rv = newSV(0);
4423 PERL_ARGS_ASSERT_NEW_VERSION;
4424 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4427 AV * const av = newAV();
4429 /* This will get reblessed later if a derived class*/
4430 SV * const hv = newSVrv(rv, "version");
4431 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4436 /* Begin copying all of the elements */
4437 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4438 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4440 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4441 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4443 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4445 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4446 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4449 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4451 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4452 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4455 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4456 /* This will get reblessed later if a derived class*/
4457 for ( key = 0; key <= av_len(sav); key++ )
4459 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4460 av_push(av, newSViv(rev));
4463 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4468 const MAGIC* const mg = SvVSTRING_mg(ver);
4469 if ( mg ) { /* already a v-string */
4470 const STRLEN len = mg->mg_len;
4471 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4472 sv_setpvn(rv,version,len);
4473 /* this is for consistency with the pure Perl class */
4474 if ( *version != 'v' )
4475 sv_insert(rv, 0, 0, "v", 1);
4480 sv_setsv(rv,ver); /* make a duplicate */
4485 return upg_version(rv, FALSE);
4489 =for apidoc upg_version
4491 In-place upgrade of the supplied SV to a version object.
4493 SV *sv = upg_version(SV *sv, bool qv);
4495 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4496 to force this SV to be interpreted as an "extended" version.
4502 Perl_upg_version(pTHX_ SV *ver, bool qv)
4504 const char *version, *s;
4509 PERL_ARGS_ASSERT_UPG_VERSION;
4511 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4513 /* may get too much accuracy */
4515 #ifdef USE_LOCALE_NUMERIC
4516 char *loc = setlocale(LC_NUMERIC, "C");
4518 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4519 #ifdef USE_LOCALE_NUMERIC
4520 setlocale(LC_NUMERIC, loc);
4522 while (tbuf[len-1] == '0' && len > 0) len--;
4523 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4524 version = savepvn(tbuf, len);
4527 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4528 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4532 else /* must be a string or something like a string */
4535 version = savepv(SvPV(ver,len));
4537 # if PERL_VERSION > 5
4538 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4539 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4540 /* may be a v-string */
4541 SV * const nsv = sv_newmortal();
4545 sv_setpvf(nsv,"v%vd",ver);
4546 pos = nver = savepv(SvPV_nolen(nsv));
4548 /* scan the resulting formatted string */
4549 pos++; /* skip the leading 'v' */
4550 while ( *pos == '.' || isDIGIT(*pos) ) {
4556 /* is definitely a v-string */
4557 if ( saw_period == 2 ) {
4566 s = scan_version(version, ver, qv);
4568 if(ckWARN(WARN_MISC))
4569 Perl_warner(aTHX_ packWARN(WARN_MISC),
4570 "Version string '%s' contains invalid data; "
4571 "ignoring: '%s'", version, s);
4579 Validates that the SV contains a valid version object.
4581 bool vverify(SV *vobj);
4583 Note that it only confirms the bare minimum structure (so as not to get
4584 confused by derived classes which may contain additional hash entries):
4588 =item * The SV contains a [reference to a] hash
4590 =item * The hash contains a "version" key
4592 =item * The "version" key has [a reference to] an AV as its value
4600 Perl_vverify(pTHX_ SV *vs)
4604 PERL_ARGS_ASSERT_VVERIFY;
4609 /* see if the appropriate elements exist */
4610 if ( SvTYPE(vs) == SVt_PVHV
4611 && hv_exists(MUTABLE_HV(vs), "version", 7)
4612 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4613 && SvTYPE(sv) == SVt_PVAV )
4622 Accepts a version object and returns the normalized floating
4623 point representation. Call like:
4627 NOTE: you can pass either the object directly or the SV
4628 contained within the RV.
4634 Perl_vnumify(pTHX_ SV *vs)
4639 SV * const sv = newSV(0);
4642 PERL_ARGS_ASSERT_VNUMIFY;
4648 Perl_croak(aTHX_ "Invalid version object");
4650 /* see if various flags exist */
4651 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4653 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4654 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4659 /* attempt to retrieve the version array */
4660 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4672 digit = SvIV(*av_fetch(av, 0, 0));
4673 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4674 for ( i = 1 ; i < len ; i++ )
4676 digit = SvIV(*av_fetch(av, i, 0));
4678 const int denom = (width == 2 ? 10 : 100);
4679 const div_t term = div((int)PERL_ABS(digit),denom);
4680 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4683 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4689 digit = SvIV(*av_fetch(av, len, 0));
4690 if ( alpha && width == 3 ) /* alpha version */
4692 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4696 sv_catpvs(sv, "000");
4704 Accepts a version object and returns the normalized string
4705 representation. Call like:
4709 NOTE: you can pass either the object directly or the SV
4710 contained within the RV.
4716 Perl_vnormal(pTHX_ SV *vs)
4720 SV * const sv = newSV(0);
4723 PERL_ARGS_ASSERT_VNORMAL;
4729 Perl_croak(aTHX_ "Invalid version object");
4731 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4733 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4741 digit = SvIV(*av_fetch(av, 0, 0));
4742 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4743 for ( i = 1 ; i < len ; i++ ) {
4744 digit = SvIV(*av_fetch(av, i, 0));
4745 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4750 /* handle last digit specially */
4751 digit = SvIV(*av_fetch(av, len, 0));
4753 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4755 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4758 if ( len <= 2 ) { /* short version, must be at least three */
4759 for ( len = 2 - len; len != 0; len-- )
4766 =for apidoc vstringify
4768 In order to maintain maximum compatibility with earlier versions
4769 of Perl, this function will return either the floating point
4770 notation or the multiple dotted notation, depending on whether
4771 the original version contained 1 or more dots, respectively
4777 Perl_vstringify(pTHX_ SV *vs)
4779 PERL_ARGS_ASSERT_VSTRINGIFY;
4785 Perl_croak(aTHX_ "Invalid version object");
4787 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4789 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4793 return &PL_sv_undef;
4796 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4806 Version object aware cmp. Both operands must already have been
4807 converted into version objects.
4813 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4816 bool lalpha = FALSE;
4817 bool ralpha = FALSE;
4822 PERL_ARGS_ASSERT_VCMP;
4829 if ( !vverify(lhv) )
4830 Perl_croak(aTHX_ "Invalid version object");
4832 if ( !vverify(rhv) )
4833 Perl_croak(aTHX_ "Invalid version object");
4835 /* get the left hand term */
4836 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4837 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4840 /* and the right hand term */
4841 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4842 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4850 while ( i <= m && retval == 0 )
4852 left = SvIV(*av_fetch(lav,i,0));
4853 right = SvIV(*av_fetch(rav,i,0));
4861 /* tiebreaker for alpha with identical terms */
4862 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4864 if ( lalpha && !ralpha )
4868 else if ( ralpha && !lalpha)
4874 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4878 while ( i <= r && retval == 0 )
4880 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4881 retval = -1; /* not a match after all */
4887 while ( i <= l && retval == 0 )
4889 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4890 retval = +1; /* not a match after all */
4898 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4899 # define EMULATE_SOCKETPAIR_UDP
4902 #ifdef EMULATE_SOCKETPAIR_UDP
4904 S_socketpair_udp (int fd[2]) {
4906 /* Fake a datagram socketpair using UDP to localhost. */
4907 int sockets[2] = {-1, -1};
4908 struct sockaddr_in addresses[2];
4910 Sock_size_t size = sizeof(struct sockaddr_in);
4911 unsigned short port;
4914 memset(&addresses, 0, sizeof(addresses));
4917 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4918 if (sockets[i] == -1)
4919 goto tidy_up_and_fail;
4921 addresses[i].sin_family = AF_INET;
4922 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4923 addresses[i].sin_port = 0; /* kernel choses port. */
4924 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4925 sizeof(struct sockaddr_in)) == -1)
4926 goto tidy_up_and_fail;
4929 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4930 for each connect the other socket to it. */
4933 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4935 goto tidy_up_and_fail;
4936 if (size != sizeof(struct sockaddr_in))
4937 goto abort_tidy_up_and_fail;
4938 /* !1 is 0, !0 is 1 */
4939 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4940 sizeof(struct sockaddr_in)) == -1)
4941 goto tidy_up_and_fail;
4944 /* Now we have 2 sockets connected to each other. I don't trust some other
4945 process not to have already sent a packet to us (by random) so send
4946 a packet from each to the other. */
4949 /* I'm going to send my own port number. As a short.
4950 (Who knows if someone somewhere has sin_port as a bitfield and needs
4951 this routine. (I'm assuming crays have socketpair)) */
4952 port = addresses[i].sin_port;
4953 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4954 if (got != sizeof(port)) {
4956 goto tidy_up_and_fail;
4957 goto abort_tidy_up_and_fail;
4961 /* Packets sent. I don't trust them to have arrived though.
4962 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4963 connect to localhost will use a second kernel thread. In 2.6 the
4964 first thread running the connect() returns before the second completes,
4965 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4966 returns 0. Poor programs have tripped up. One poor program's authors'
4967 had a 50-1 reverse stock split. Not sure how connected these were.)
4968 So I don't trust someone not to have an unpredictable UDP stack.
4972 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4973 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4977 FD_SET((unsigned int)sockets[0], &rset);
4978 FD_SET((unsigned int)sockets[1], &rset);
4980 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4981 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4982 || !FD_ISSET(sockets[1], &rset)) {
4983 /* I hope this is portable and appropriate. */
4985 goto tidy_up_and_fail;
4986 goto abort_tidy_up_and_fail;
4990 /* And the paranoia department even now doesn't trust it to have arrive
4991 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4993 struct sockaddr_in readfrom;
4994 unsigned short buffer[2];
4999 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5000 sizeof(buffer), MSG_DONTWAIT,
5001 (struct sockaddr *) &readfrom, &size);
5003 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5005 (struct sockaddr *) &readfrom, &size);
5009 goto tidy_up_and_fail;
5010 if (got != sizeof(port)
5011 || size != sizeof(struct sockaddr_in)
5012 /* Check other socket sent us its port. */
5013 || buffer[0] != (unsigned short) addresses[!i].sin_port
5014 /* Check kernel says we got the datagram from that socket */
5015 || readfrom.sin_family != addresses[!i].sin_family
5016 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5017 || readfrom.sin_port != addresses[!i].sin_port)
5018 goto abort_tidy_up_and_fail;
5021 /* My caller (my_socketpair) has validated that this is non-NULL */
5024 /* I hereby declare this connection open. May God bless all who cross
5028 abort_tidy_up_and_fail:
5029 errno = ECONNABORTED;
5033 if (sockets[0] != -1)
5034 PerlLIO_close(sockets[0]);
5035 if (sockets[1] != -1)
5036 PerlLIO_close(sockets[1]);
5041 #endif /* EMULATE_SOCKETPAIR_UDP */
5043 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5045 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5046 /* Stevens says that family must be AF_LOCAL, protocol 0.
5047 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5052 struct sockaddr_in listen_addr;
5053 struct sockaddr_in connect_addr;
5058 || family != AF_UNIX
5061 errno = EAFNOSUPPORT;
5069 #ifdef EMULATE_SOCKETPAIR_UDP
5070 if (type == SOCK_DGRAM)
5071 return S_socketpair_udp(fd);
5074 listener = PerlSock_socket(AF_INET, type, 0);
5077 memset(&listen_addr, 0, sizeof(listen_addr));
5078 listen_addr.sin_family = AF_INET;
5079 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5080 listen_addr.sin_port = 0; /* kernel choses port. */
5081 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5082 sizeof(listen_addr)) == -1)
5083 goto tidy_up_and_fail;
5084 if (PerlSock_listen(listener, 1) == -1)
5085 goto tidy_up_and_fail;
5087 connector = PerlSock_socket(AF_INET, type, 0);
5088 if (connector == -1)
5089 goto tidy_up_and_fail;
5090 /* We want to find out the port number to connect to. */
5091 size = sizeof(connect_addr);
5092 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5094 goto tidy_up_and_fail;
5095 if (size != sizeof(connect_addr))
5096 goto abort_tidy_up_and_fail;
5097 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5098 sizeof(connect_addr)) == -1)
5099 goto tidy_up_and_fail;
5101 size = sizeof(listen_addr);
5102 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5105 goto tidy_up_and_fail;
5106 if (size != sizeof(listen_addr))
5107 goto abort_tidy_up_and_fail;
5108 PerlLIO_close(listener);
5109 /* Now check we are talking to ourself by matching port and host on the
5111 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5113 goto tidy_up_and_fail;
5114 if (size != sizeof(connect_addr)
5115 || listen_addr.sin_family != connect_addr.sin_family
5116 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5117 || listen_addr.sin_port != connect_addr.sin_port) {
5118 goto abort_tidy_up_and_fail;
5124 abort_tidy_up_and_fail:
5126 errno = ECONNABORTED; /* This would be the standard thing to do. */
5128 # ifdef ECONNREFUSED
5129 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5131 errno = ETIMEDOUT; /* Desperation time. */
5138 PerlLIO_close(listener);
5139 if (connector != -1)
5140 PerlLIO_close(connector);
5142 PerlLIO_close(acceptor);
5148 /* In any case have a stub so that there's code corresponding
5149 * to the my_socketpair in global.sym. */
5151 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5152 #ifdef HAS_SOCKETPAIR
5153 return socketpair(family, type, protocol, fd);
5162 =for apidoc sv_nosharing
5164 Dummy routine which "shares" an SV when there is no sharing module present.
5165 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5166 Exists to avoid test for a NULL function pointer and because it could
5167 potentially warn under some level of strict-ness.
5173 Perl_sv_nosharing(pTHX_ SV *sv)
5175 PERL_UNUSED_CONTEXT;
5176 PERL_UNUSED_ARG(sv);
5181 =for apidoc sv_destroyable
5183 Dummy routine which reports that object can be destroyed when there is no
5184 sharing module present. It ignores its single SV argument, and returns
5185 'true'. Exists to avoid test for a NULL function pointer and because it
5186 could potentially warn under some level of strict-ness.
5192 Perl_sv_destroyable(pTHX_ SV *sv)
5194 PERL_UNUSED_CONTEXT;
5195 PERL_UNUSED_ARG(sv);
5200 Perl_parse_unicode_opts(pTHX_ const char **popt)
5202 const char *p = *popt;
5205 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5209 opt = (U32) atoi(p);
5212 if (*p && *p != '\n' && *p != '\r')
5213 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5218 case PERL_UNICODE_STDIN:
5219 opt |= PERL_UNICODE_STDIN_FLAG; break;
5220 case PERL_UNICODE_STDOUT:
5221 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5222 case PERL_UNICODE_STDERR:
5223 opt |= PERL_UNICODE_STDERR_FLAG; break;
5224 case PERL_UNICODE_STD:
5225 opt |= PERL_UNICODE_STD_FLAG; break;
5226 case PERL_UNICODE_IN:
5227 opt |= PERL_UNICODE_IN_FLAG; break;
5228 case PERL_UNICODE_OUT:
5229 opt |= PERL_UNICODE_OUT_FLAG; break;
5230 case PERL_UNICODE_INOUT:
5231 opt |= PERL_UNICODE_INOUT_FLAG; break;
5232 case PERL_UNICODE_LOCALE:
5233 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5234 case PERL_UNICODE_ARGV:
5235 opt |= PERL_UNICODE_ARGV_FLAG; break;
5236 case PERL_UNICODE_UTF8CACHEASSERT:
5237 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5239 if (*p != '\n' && *p != '\r')
5241 "Unknown Unicode option letter '%c'", *p);
5247 opt = PERL_UNICODE_DEFAULT_FLAGS;
5249 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5250 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5251 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5263 * This is really just a quick hack which grabs various garbage
5264 * values. It really should be a real hash algorithm which
5265 * spreads the effect of every input bit onto every output bit,
5266 * if someone who knows about such things would bother to write it.
5267 * Might be a good idea to add that function to CORE as well.
5268 * No numbers below come from careful analysis or anything here,
5269 * except they are primes and SEED_C1 > 1E6 to get a full-width
5270 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5271 * probably be bigger too.
5274 # define SEED_C1 1000003
5275 #define SEED_C4 73819
5277 # define SEED_C1 25747
5278 #define SEED_C4 20639
5282 #define SEED_C5 26107
5284 #ifndef PERL_NO_DEV_RANDOM
5289 # include <starlet.h>
5290 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5291 * in 100-ns units, typically incremented ever 10 ms. */
5292 unsigned int when[2];
5294 # ifdef HAS_GETTIMEOFDAY
5295 struct timeval when;
5301 /* This test is an escape hatch, this symbol isn't set by Configure. */
5302 #ifndef PERL_NO_DEV_RANDOM
5303 #ifndef PERL_RANDOM_DEVICE
5304 /* /dev/random isn't used by default because reads from it will block
5305 * if there isn't enough entropy available. You can compile with
5306 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5307 * is enough real entropy to fill the seed. */
5308 # define PERL_RANDOM_DEVICE "/dev/urandom"
5310 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5312 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5321 _ckvmssts(sys$gettim(when));
5322 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5324 # ifdef HAS_GETTIMEOFDAY
5325 PerlProc_gettimeofday(&when,NULL);
5326 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5329 u = (U32)SEED_C1 * when;
5332 u += SEED_C3 * (U32)PerlProc_getpid();
5333 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5334 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5335 u += SEED_C5 * (U32)PTR2UV(&when);
5341 Perl_get_hash_seed(pTHX)
5344 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5350 if (s && isDIGIT(*s))
5351 myseed = (UV)Atoul(s);
5353 #ifdef USE_HASH_SEED_EXPLICIT
5357 /* Compute a random seed */
5358 (void)seedDrand01((Rand_seed_t)seed());
5359 myseed = (UV)(Drand01() * (NV)UV_MAX);
5360 #if RANDBITS < (UVSIZE * 8)
5361 /* Since there are not enough randbits to to reach all
5362 * the bits of a UV, the low bits might need extra
5363 * help. Sum in another random number that will
5364 * fill in the low bits. */
5366 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5367 #endif /* RANDBITS < (UVSIZE * 8) */
5368 if (myseed == 0) { /* Superparanoia. */
5369 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5371 Perl_croak(aTHX_ "Your random numbers are not that random");
5374 PL_rehash_seed_set = TRUE;
5381 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5383 const char * const stashpv = CopSTASHPV(c);
5384 const char * const name = HvNAME_get(hv);
5385 PERL_UNUSED_CONTEXT;
5386 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5388 if (stashpv == name)
5390 if (stashpv && name)
5391 if (strEQ(stashpv, name))
5398 #ifdef PERL_GLOBAL_STRUCT
5400 #define PERL_GLOBAL_STRUCT_INIT
5401 #include "opcode.h" /* the ppaddr and check */
5404 Perl_init_global_struct(pTHX)
5406 struct perl_vars *plvarsp = NULL;
5407 # ifdef PERL_GLOBAL_STRUCT
5408 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5409 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5410 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5411 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5412 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5416 plvarsp = PL_VarsPtr;
5417 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5423 # define PERLVAR(var,type) /**/
5424 # define PERLVARA(var,n,type) /**/
5425 # define PERLVARI(var,type,init) plvarsp->var = init;
5426 # define PERLVARIC(var,type,init) plvarsp->var = init;
5427 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5428 # include "perlvars.h"
5434 # ifdef PERL_GLOBAL_STRUCT
5437 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5438 if (!plvarsp->Gppaddr)
5442 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5443 if (!plvarsp->Gcheck)
5445 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5446 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5448 # ifdef PERL_SET_VARS
5449 PERL_SET_VARS(plvarsp);
5451 # undef PERL_GLOBAL_STRUCT_INIT
5456 #endif /* PERL_GLOBAL_STRUCT */
5458 #ifdef PERL_GLOBAL_STRUCT
5461 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5463 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5464 # ifdef PERL_GLOBAL_STRUCT
5465 # ifdef PERL_UNSET_VARS
5466 PERL_UNSET_VARS(plvarsp);
5468 free(plvarsp->Gppaddr);
5469 free(plvarsp->Gcheck);
5470 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5476 #endif /* PERL_GLOBAL_STRUCT */
5481 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5483 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5484 * variables PERL_MEM_LOG and PERL_SV_LOG will be consulted, and
5485 * if the integer value of that is true, the logging will happen.
5486 * (The default is to always log if the PERL_MEM_LOG define was
5489 * PERL_MEM_LOG_TIMESTAMP: if defined, a timestamp will be logged
5490 * before every memory logging entry. This can be turned off at run
5491 * time by setting the environment variable PERL_MEM_LOG_TIMESTAMP
5496 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5497 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5499 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5502 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5503 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5504 * in which case the environment variable PERL_MEM_LOG_FD will be
5505 * consulted for the file descriptor number to use.
5507 #ifndef PERL_MEM_LOG_FD
5508 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5511 #ifdef PERL_MEM_LOG_STDERR
5513 # ifdef DEBUG_LEAKING_SCALARS
5514 # define SV_LOG_SERIAL_FMT " [%lu]"
5515 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5517 # define SV_LOG_SERIAL_FMT
5518 # define _SV_LOG_SERIAL_ARG(sv)
5522 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)
5524 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5528 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5530 # ifdef PERL_MEM_LOG_ENV
5531 s = PerlEnv_getenv(mlt < MLT_NEW_SV ? "PERL_MEM_LOG" : "PERL_SV_LOG");
5532 if (s ? atoi(s) : 0)
5535 /* We can't use SVs or PerlIO for obvious reasons,
5536 * so we'll use stdio and low-level IO instead. */
5537 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5538 # ifdef PERL_MEM_LOG_TIMESTAMP
5539 # ifdef HAS_GETTIMEOFDAY
5540 # define MEM_LOG_TIME_FMT "%10d.%06d: "
5541 # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec
5543 gettimeofday(&tv, 0);
5545 # define MEM_LOG_TIME_FMT "%10d: "
5546 # define MEM_LOG_TIME_ARG (int)when
5550 /* If there are other OS specific ways of hires time than
5551 * gettimeofday() (see ext/Time-HiRes), the easiest way is
5552 * probably that they would be used to fill in the struct
5556 int fd = PERL_MEM_LOG_FD;
5559 # ifdef PERL_MEM_LOG_ENV_FD
5560 if ((s = PerlEnv_getenv("PERL_MEM_LOG_FD"))) {
5564 # ifdef PERL_MEM_LOG_TIMESTAMP
5565 s = PerlEnv_getenv("PERL_MEM_LOG_TIMESTAMP");
5566 if (!s || atoi(s)) {
5567 len = my_snprintf(buf, sizeof(buf),
5568 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5569 PerlLIO_write(fd, buf, len);
5574 len = my_snprintf(buf, sizeof(buf),
5575 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5576 " %s = %"IVdf": %"UVxf"\n",
5577 filename, linenumber, funcname, n, typesize,
5578 type_name, n * typesize, PTR2UV(newalloc));
5581 len = my_snprintf(buf, sizeof(buf),
5582 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5583 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5584 filename, linenumber, funcname, n, typesize,
5585 type_name, n * typesize, PTR2UV(oldalloc),
5589 len = my_snprintf(buf, sizeof(buf),
5590 "free: %s:%d:%s: %"UVxf"\n",
5591 filename, linenumber, funcname,
5596 len = my_snprintf(buf, sizeof(buf),
5597 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5598 mlt == MLT_NEW_SV ? "new" : "del",
5599 filename, linenumber, funcname,
5600 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5603 PerlLIO_write(fd, buf, len);
5610 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)
5612 #ifdef PERL_MEM_LOG_STDERR
5613 mem_log_common(MLT_ALLOC, n, typesize, type_name, NULL, NULL, newalloc, filename, linenumber, funcname);
5619 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)
5621 #ifdef PERL_MEM_LOG_STDERR
5622 mem_log_common(MLT_REALLOC, n, typesize, type_name, NULL, oldalloc, newalloc, filename, linenumber, funcname);
5628 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5630 #ifdef PERL_MEM_LOG_STDERR
5631 mem_log_common(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL, filename, linenumber, funcname);
5637 Perl_mem_log_new_sv(const SV *sv, const char *filename, const int linenumber, const char *funcname)
5639 #ifdef PERL_MEM_LOG_STDERR
5640 mem_log_common(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL, filename, linenumber, funcname);
5645 Perl_mem_log_del_sv(const SV *sv, const char *filename, const int linenumber, const char *funcname)
5647 #ifdef PERL_MEM_LOG_STDERR
5648 mem_log_common(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL, filename, linenumber, funcname);
5652 #endif /* PERL_MEM_LOG */
5655 =for apidoc my_sprintf
5657 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5658 the length of the string written to the buffer. Only rare pre-ANSI systems
5659 need the wrapper function - usually this is a direct call to C<sprintf>.
5663 #ifndef SPRINTF_RETURNS_STRLEN
5665 Perl_my_sprintf(char *buffer, const char* pat, ...)
5668 PERL_ARGS_ASSERT_MY_SPRINTF;
5669 va_start(args, pat);
5670 vsprintf(buffer, pat, args);
5672 return strlen(buffer);
5677 =for apidoc my_snprintf
5679 The C library C<snprintf> functionality, if available and
5680 standards-compliant (uses C<vsnprintf>, actually). However, if the
5681 C<vsnprintf> is not available, will unfortunately use the unsafe
5682 C<vsprintf> which can overrun the buffer (there is an overrun check,
5683 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5684 getting C<vsnprintf>.
5689 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5694 PERL_ARGS_ASSERT_MY_SNPRINTF;
5695 va_start(ap, format);
5696 #ifdef HAS_VSNPRINTF
5697 retval = vsnprintf(buffer, len, format, ap);
5699 retval = vsprintf(buffer, format, ap);
5702 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5703 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5704 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5709 =for apidoc my_vsnprintf
5711 The C library C<vsnprintf> if available and standards-compliant.
5712 However, if if the C<vsnprintf> is not available, will unfortunately
5713 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5714 overrun check, but that may be too late). Consider using
5715 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5720 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5727 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5729 Perl_va_copy(ap, apc);
5730 # ifdef HAS_VSNPRINTF
5731 retval = vsnprintf(buffer, len, format, apc);
5733 retval = vsprintf(buffer, format, apc);
5736 # ifdef HAS_VSNPRINTF
5737 retval = vsnprintf(buffer, len, format, ap);
5739 retval = vsprintf(buffer, format, ap);
5741 #endif /* #ifdef NEED_VA_COPY */
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_vsnprintf buffer overflow");
5749 Perl_my_clearenv(pTHX)
5752 #if ! defined(PERL_MICRO)
5753 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5755 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5756 # if defined(USE_ENVIRON_ARRAY)
5757 # if defined(USE_ITHREADS)
5758 /* only the parent thread can clobber the process environment */
5759 if (PL_curinterp == aTHX)
5760 # endif /* USE_ITHREADS */
5762 # if ! defined(PERL_USE_SAFE_PUTENV)
5763 if ( !PL_use_safe_putenv) {
5765 if (environ == PL_origenviron)
5766 environ = (char**)safesysmalloc(sizeof(char*));
5768 for (i = 0; environ[i]; i++)
5769 (void)safesysfree(environ[i]);
5772 # else /* PERL_USE_SAFE_PUTENV */
5773 # if defined(HAS_CLEARENV)
5775 # elif defined(HAS_UNSETENV)
5776 int bsiz = 80; /* Most envvar names will be shorter than this. */
5777 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5778 char *buf = (char*)safesysmalloc(bufsiz);
5779 while (*environ != NULL) {
5780 char *e = strchr(*environ, '=');
5781 int l = e ? e - *environ : (int)strlen(*environ);
5783 (void)safesysfree(buf);
5784 bsiz = l + 1; /* + 1 for the \0. */
5785 buf = (char*)safesysmalloc(bufsiz);
5787 memcpy(buf, *environ, l);
5789 (void)unsetenv(buf);
5791 (void)safesysfree(buf);
5792 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5793 /* Just null environ and accept the leakage. */
5795 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5796 # endif /* ! PERL_USE_SAFE_PUTENV */
5798 # endif /* USE_ENVIRON_ARRAY */
5799 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5800 #endif /* PERL_MICRO */
5803 #ifdef PERL_IMPLICIT_CONTEXT
5805 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5806 the global PL_my_cxt_index is incremented, and that value is assigned to
5807 that module's static my_cxt_index (who's address is passed as an arg).
5808 Then, for each interpreter this function is called for, it makes sure a
5809 void* slot is available to hang the static data off, by allocating or
5810 extending the interpreter's PL_my_cxt_list array */
5812 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5814 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5818 PERL_ARGS_ASSERT_MY_CXT_INIT;
5820 /* this module hasn't been allocated an index yet */
5821 MUTEX_LOCK(&PL_my_ctx_mutex);
5822 *index = PL_my_cxt_index++;
5823 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5826 /* make sure the array is big enough */
5827 if (PL_my_cxt_size <= *index) {
5828 if (PL_my_cxt_size) {
5829 while (PL_my_cxt_size <= *index)
5830 PL_my_cxt_size *= 2;
5831 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5834 PL_my_cxt_size = 16;
5835 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5838 /* newSV() allocates one more than needed */
5839 p = (void*)SvPVX(newSV(size-1));
5840 PL_my_cxt_list[*index] = p;
5841 Zero(p, size, char);
5845 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5848 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5853 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5855 for (index = 0; index < PL_my_cxt_index; index++) {
5856 const char *key = PL_my_cxt_keys[index];
5857 /* try direct pointer compare first - there are chances to success,
5858 * and it's much faster.
5860 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5867 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5873 PERL_ARGS_ASSERT_MY_CXT_INIT;
5875 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5877 /* this module hasn't been allocated an index yet */
5878 MUTEX_LOCK(&PL_my_ctx_mutex);
5879 index = PL_my_cxt_index++;
5880 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5883 /* make sure the array is big enough */
5884 if (PL_my_cxt_size <= index) {
5885 int old_size = PL_my_cxt_size;
5887 if (PL_my_cxt_size) {
5888 while (PL_my_cxt_size <= index)
5889 PL_my_cxt_size *= 2;
5890 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5891 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5894 PL_my_cxt_size = 16;
5895 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5896 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5898 for (i = old_size; i < PL_my_cxt_size; i++) {
5899 PL_my_cxt_keys[i] = 0;
5900 PL_my_cxt_list[i] = 0;
5903 PL_my_cxt_keys[index] = my_cxt_key;
5904 /* newSV() allocates one more than needed */
5905 p = (void*)SvPVX(newSV(size-1));
5906 PL_my_cxt_list[index] = p;
5907 Zero(p, size, char);
5910 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5911 #endif /* PERL_IMPLICIT_CONTEXT */
5915 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5917 Size_t used, length, copy;
5920 length = strlen(src);
5921 if (size > 0 && used < size - 1) {
5922 copy = (length >= size - used) ? size - used - 1 : length;
5923 memcpy(dst + used, src, copy);
5924 dst[used + copy] = '\0';
5926 return used + length;
5932 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5934 Size_t length, copy;
5936 length = strlen(src);
5938 copy = (length >= size) ? size - 1 : length;
5939 memcpy(dst, src, copy);
5946 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5947 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5948 long _ftol( double ); /* Defined by VC6 C libs. */
5949 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5953 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5956 SV * const dbsv = GvSVn(PL_DBsub);
5957 /* We do not care about using sv to call CV;
5958 * it's for informational purposes only.
5961 PERL_ARGS_ASSERT_GET_DB_SUB;
5964 if (!PERLDB_SUB_NN) {
5965 GV * const gv = CvGV(cv);
5967 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5968 || strEQ(GvNAME(gv), "END")
5969 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5970 !( (SvTYPE(*svp) == SVt_PVGV)
5971 && (GvCV((const GV *)*svp) == cv) )))) {
5972 /* Use GV from the stack as a fallback. */
5973 /* GV is potentially non-unique, or contain different CV. */
5974 SV * const tmp = newRV(MUTABLE_SV(cv));
5975 sv_setsv(dbsv, tmp);
5979 gv_efullname3(dbsv, gv, NULL);
5983 const int type = SvTYPE(dbsv);
5984 if (type < SVt_PVIV && type != SVt_IV)
5985 sv_upgrade(dbsv, SVt_PVIV);
5986 (void)SvIOK_on(dbsv);
5987 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5992 Perl_my_dirfd(pTHX_ DIR * dir) {
5994 /* Most dirfd implementations have problems when passed NULL. */
5999 #elif defined(HAS_DIR_DD_FD)
6002 Perl_die(aTHX_ PL_no_func, "dirfd");
6009 Perl_get_re_arg(pTHX_ SV *sv) {
6016 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6017 SvTYPE(tmpsv) == SVt_REGEXP)
6019 return (REGEXP*) tmpsv;
6028 * c-indentation-style: bsd
6030 * indent-tabs-mode: t
6033 * ex: set ts=8 sts=4 sw=4 noet: