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 va_start(args, pat);
1391 o = vdie(pat, &args);
1395 #endif /* PERL_IMPLICIT_CONTEXT */
1398 Perl_die(pTHX_ const char* pat, ...)
1402 va_start(args, pat);
1403 o = vdie(pat, &args);
1409 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1412 const char *message;
1416 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1419 PL_restartop = die_where(message, msglen);
1420 SvFLAGS(ERRSV) |= utf8;
1424 message = SvPVx_const(ERRSV, msglen);
1426 write_to_stderr(message, msglen);
1430 #if defined(PERL_IMPLICIT_CONTEXT)
1432 Perl_croak_nocontext(const char *pat, ...)
1436 va_start(args, pat);
1441 #endif /* PERL_IMPLICIT_CONTEXT */
1444 =head1 Warning and Dieing
1448 This is the XSUB-writer's interface to Perl's C<die> function.
1449 Normally call this function the same way you call the C C<printf>
1450 function. Calling C<croak> returns control directly to Perl,
1451 sidestepping the normal C order of execution. See C<warn>.
1453 If you want to throw an exception object, assign the object to
1454 C<$@> and then pass C<NULL> to croak():
1456 errsv = get_sv("@", GV_ADD);
1457 sv_setsv(errsv, exception_object);
1464 Perl_croak(pTHX_ const char *pat, ...)
1467 va_start(args, pat);
1474 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1478 SV * const msv = vmess(pat, args);
1479 const I32 utf8 = SvUTF8(msv);
1480 const char * const message = SvPV_const(msv, msglen);
1482 PERL_ARGS_ASSERT_VWARN;
1485 if (vdie_common(message, msglen, utf8, TRUE))
1489 write_to_stderr(message, msglen);
1492 #if defined(PERL_IMPLICIT_CONTEXT)
1494 Perl_warn_nocontext(const char *pat, ...)
1498 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
1499 va_start(args, pat);
1503 #endif /* PERL_IMPLICIT_CONTEXT */
1508 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1509 function the same way you call the C C<printf> function. See C<croak>.
1515 Perl_warn(pTHX_ const char *pat, ...)
1518 PERL_ARGS_ASSERT_WARN;
1519 va_start(args, pat);
1524 #if defined(PERL_IMPLICIT_CONTEXT)
1526 Perl_warner_nocontext(U32 err, const char *pat, ...)
1530 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
1531 va_start(args, pat);
1532 vwarner(err, pat, &args);
1535 #endif /* PERL_IMPLICIT_CONTEXT */
1538 Perl_warner(pTHX_ U32 err, const char* pat,...)
1541 PERL_ARGS_ASSERT_WARNER;
1542 va_start(args, pat);
1543 vwarner(err, pat, &args);
1548 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1551 PERL_ARGS_ASSERT_VWARNER;
1552 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1553 SV * const msv = vmess(pat, args);
1555 const char * const message = SvPV_const(msv, msglen);
1556 const I32 utf8 = SvUTF8(msv);
1560 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1563 PL_restartop = die_where(message, msglen);
1564 SvFLAGS(ERRSV) |= utf8;
1567 write_to_stderr(message, msglen);
1571 Perl_vwarn(aTHX_ pat, args);
1575 /* implements the ckWARN? macros */
1578 Perl_ckwarn(pTHX_ U32 w)
1584 && PL_curcop->cop_warnings != pWARN_NONE
1586 PL_curcop->cop_warnings == pWARN_ALL
1587 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1588 || (unpackWARN2(w) &&
1589 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1590 || (unpackWARN3(w) &&
1591 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1592 || (unpackWARN4(w) &&
1593 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1598 isLEXWARN_off && PL_dowarn & G_WARN_ON
1603 /* implements the ckWARN?_d macro */
1606 Perl_ckwarn_d(pTHX_ U32 w)
1611 || PL_curcop->cop_warnings == pWARN_ALL
1613 PL_curcop->cop_warnings != pWARN_NONE
1615 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1616 || (unpackWARN2(w) &&
1617 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1618 || (unpackWARN3(w) &&
1619 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1620 || (unpackWARN4(w) &&
1621 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1627 /* Set buffer=NULL to get a new one. */
1629 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1631 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1632 PERL_UNUSED_CONTEXT;
1633 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
1636 (specialWARN(buffer) ?
1637 PerlMemShared_malloc(len_wanted) :
1638 PerlMemShared_realloc(buffer, len_wanted));
1640 Copy(bits, (buffer + 1), size, char);
1644 /* since we've already done strlen() for both nam and val
1645 * we can use that info to make things faster than
1646 * sprintf(s, "%s=%s", nam, val)
1648 #define my_setenv_format(s, nam, nlen, val, vlen) \
1649 Copy(nam, s, nlen, char); \
1651 Copy(val, s+(nlen+1), vlen, char); \
1652 *(s+(nlen+1+vlen)) = '\0'
1654 #ifdef USE_ENVIRON_ARRAY
1655 /* VMS' my_setenv() is in vms.c */
1656 #if !defined(WIN32) && !defined(NETWARE)
1658 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1662 /* only parent thread can modify process environment */
1663 if (PL_curinterp == aTHX)
1666 #ifndef PERL_USE_SAFE_PUTENV
1667 if (!PL_use_safe_putenv) {
1668 /* most putenv()s leak, so we manipulate environ directly */
1670 register const I32 len = strlen(nam);
1673 /* where does it go? */
1674 for (i = 0; environ[i]; i++) {
1675 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1679 if (environ == PL_origenviron) { /* need we copy environment? */
1685 while (environ[max])
1687 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1688 for (j=0; j<max; j++) { /* copy environment */
1689 const int len = strlen(environ[j]);
1690 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1691 Copy(environ[j], tmpenv[j], len+1, char);
1694 environ = tmpenv; /* tell exec where it is now */
1697 safesysfree(environ[i]);
1698 while (environ[i]) {
1699 environ[i] = environ[i+1];
1704 if (!environ[i]) { /* does not exist yet */
1705 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1706 environ[i+1] = NULL; /* make sure it's null terminated */
1709 safesysfree(environ[i]);
1713 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1714 /* all that work just for this */
1715 my_setenv_format(environ[i], nam, nlen, val, vlen);
1718 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1719 # if defined(HAS_UNSETENV)
1721 (void)unsetenv(nam);
1723 (void)setenv(nam, val, 1);
1725 # else /* ! HAS_UNSETENV */
1726 (void)setenv(nam, val, 1);
1727 # endif /* HAS_UNSETENV */
1729 # if defined(HAS_UNSETENV)
1731 (void)unsetenv(nam);
1733 const int nlen = strlen(nam);
1734 const int vlen = strlen(val);
1735 char * const new_env =
1736 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1737 my_setenv_format(new_env, nam, nlen, val, vlen);
1738 (void)putenv(new_env);
1740 # else /* ! HAS_UNSETENV */
1742 const int nlen = strlen(nam);
1748 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1749 /* all that work just for this */
1750 my_setenv_format(new_env, nam, nlen, val, vlen);
1751 (void)putenv(new_env);
1752 # endif /* HAS_UNSETENV */
1753 # endif /* __CYGWIN__ */
1754 #ifndef PERL_USE_SAFE_PUTENV
1760 #else /* WIN32 || NETWARE */
1763 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1766 register char *envstr;
1767 const int nlen = strlen(nam);
1774 Newx(envstr, nlen+vlen+2, char);
1775 my_setenv_format(envstr, nam, nlen, val, vlen);
1776 (void)PerlEnv_putenv(envstr);
1780 #endif /* WIN32 || NETWARE */
1782 #endif /* !VMS && !EPOC*/
1784 #ifdef UNLINK_ALL_VERSIONS
1786 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1790 PERL_ARGS_ASSERT_UNLNK;
1792 while (PerlLIO_unlink(f) >= 0)
1794 return retries ? 0 : -1;
1798 /* this is a drop-in replacement for bcopy() */
1799 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1801 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1803 char * const retval = to;
1805 PERL_ARGS_ASSERT_MY_BCOPY;
1807 if (from - to >= 0) {
1815 *(--to) = *(--from);
1821 /* this is a drop-in replacement for memset() */
1824 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1826 char * const retval = loc;
1828 PERL_ARGS_ASSERT_MY_MEMSET;
1836 /* this is a drop-in replacement for bzero() */
1837 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1839 Perl_my_bzero(register char *loc, register I32 len)
1841 char * const retval = loc;
1843 PERL_ARGS_ASSERT_MY_BZERO;
1851 /* this is a drop-in replacement for memcmp() */
1852 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1854 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1856 register const U8 *a = (const U8 *)s1;
1857 register const U8 *b = (const U8 *)s2;
1860 PERL_ARGS_ASSERT_MY_MEMCMP;
1863 if ((tmp = *a++ - *b++))
1868 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1871 /* This vsprintf replacement should generally never get used, since
1872 vsprintf was available in both System V and BSD 2.11. (There may
1873 be some cross-compilation or embedded set-ups where it is needed,
1876 If you encounter a problem in this function, it's probably a symptom
1877 that Configure failed to detect your system's vprintf() function.
1878 See the section on "item vsprintf" in the INSTALL file.
1880 This version may compile on systems with BSD-ish <stdio.h>,
1881 but probably won't on others.
1884 #ifdef USE_CHAR_VSPRINTF
1889 vsprintf(char *dest, const char *pat, void *args)
1893 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1894 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1895 FILE_cnt(&fakebuf) = 32767;
1897 /* These probably won't compile -- If you really need
1898 this, you'll have to figure out some other method. */
1899 fakebuf._ptr = dest;
1900 fakebuf._cnt = 32767;
1905 fakebuf._flag = _IOWRT|_IOSTRG;
1906 _doprnt(pat, args, &fakebuf); /* what a kludge */
1907 #if defined(STDIO_PTR_LVALUE)
1908 *(FILE_ptr(&fakebuf)++) = '\0';
1910 /* PerlIO has probably #defined away fputc, but we want it here. */
1912 # undef fputc /* XXX Should really restore it later */
1914 (void)fputc('\0', &fakebuf);
1916 #ifdef USE_CHAR_VSPRINTF
1919 return 0; /* perl doesn't use return value */
1923 #endif /* HAS_VPRINTF */
1926 #if BYTEORDER != 0x4321
1928 Perl_my_swap(pTHX_ short s)
1930 #if (BYTEORDER & 1) == 0
1933 result = ((s & 255) << 8) + ((s >> 8) & 255);
1941 Perl_my_htonl(pTHX_ long l)
1945 char c[sizeof(long)];
1948 #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1949 #if BYTEORDER == 0x12345678
1952 u.c[0] = (l >> 24) & 255;
1953 u.c[1] = (l >> 16) & 255;
1954 u.c[2] = (l >> 8) & 255;
1958 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1959 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1964 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1965 u.c[o & 0xf] = (l >> s) & 255;
1973 Perl_my_ntohl(pTHX_ long l)
1977 char c[sizeof(long)];
1980 #if BYTEORDER == 0x1234
1981 u.c[0] = (l >> 24) & 255;
1982 u.c[1] = (l >> 16) & 255;
1983 u.c[2] = (l >> 8) & 255;
1987 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1988 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1995 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1996 l |= (u.c[o & 0xf] & 255) << s;
2003 #endif /* BYTEORDER != 0x4321 */
2007 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2008 * If these functions are defined,
2009 * the BYTEORDER is neither 0x1234 nor 0x4321.
2010 * However, this is not assumed.
2014 #define HTOLE(name,type) \
2016 name (register type n) \
2020 char c[sizeof(type)]; \
2023 register U32 s = 0; \
2024 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2025 u.c[i] = (n >> s) & 0xFF; \
2030 #define LETOH(name,type) \
2032 name (register type n) \
2036 char c[sizeof(type)]; \
2039 register U32 s = 0; \
2042 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2043 n |= ((type)(u.c[i] & 0xFF)) << s; \
2049 * Big-endian byte order functions.
2052 #define HTOBE(name,type) \
2054 name (register type n) \
2058 char c[sizeof(type)]; \
2061 register U32 s = 8*(sizeof(u.c)-1); \
2062 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2063 u.c[i] = (n >> s) & 0xFF; \
2068 #define BETOH(name,type) \
2070 name (register type n) \
2074 char c[sizeof(type)]; \
2077 register U32 s = 8*(sizeof(u.c)-1); \
2080 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2081 n |= ((type)(u.c[i] & 0xFF)) << s; \
2087 * If we just can't do it...
2090 #define NOT_AVAIL(name,type) \
2092 name (register type n) \
2094 Perl_croak_nocontext(#name "() not available"); \
2095 return n; /* not reached */ \
2099 #if defined(HAS_HTOVS) && !defined(htovs)
2102 #if defined(HAS_HTOVL) && !defined(htovl)
2105 #if defined(HAS_VTOHS) && !defined(vtohs)
2108 #if defined(HAS_VTOHL) && !defined(vtohl)
2112 #ifdef PERL_NEED_MY_HTOLE16
2114 HTOLE(Perl_my_htole16,U16)
2116 NOT_AVAIL(Perl_my_htole16,U16)
2119 #ifdef PERL_NEED_MY_LETOH16
2121 LETOH(Perl_my_letoh16,U16)
2123 NOT_AVAIL(Perl_my_letoh16,U16)
2126 #ifdef PERL_NEED_MY_HTOBE16
2128 HTOBE(Perl_my_htobe16,U16)
2130 NOT_AVAIL(Perl_my_htobe16,U16)
2133 #ifdef PERL_NEED_MY_BETOH16
2135 BETOH(Perl_my_betoh16,U16)
2137 NOT_AVAIL(Perl_my_betoh16,U16)
2141 #ifdef PERL_NEED_MY_HTOLE32
2143 HTOLE(Perl_my_htole32,U32)
2145 NOT_AVAIL(Perl_my_htole32,U32)
2148 #ifdef PERL_NEED_MY_LETOH32
2150 LETOH(Perl_my_letoh32,U32)
2152 NOT_AVAIL(Perl_my_letoh32,U32)
2155 #ifdef PERL_NEED_MY_HTOBE32
2157 HTOBE(Perl_my_htobe32,U32)
2159 NOT_AVAIL(Perl_my_htobe32,U32)
2162 #ifdef PERL_NEED_MY_BETOH32
2164 BETOH(Perl_my_betoh32,U32)
2166 NOT_AVAIL(Perl_my_betoh32,U32)
2170 #ifdef PERL_NEED_MY_HTOLE64
2172 HTOLE(Perl_my_htole64,U64)
2174 NOT_AVAIL(Perl_my_htole64,U64)
2177 #ifdef PERL_NEED_MY_LETOH64
2179 LETOH(Perl_my_letoh64,U64)
2181 NOT_AVAIL(Perl_my_letoh64,U64)
2184 #ifdef PERL_NEED_MY_HTOBE64
2186 HTOBE(Perl_my_htobe64,U64)
2188 NOT_AVAIL(Perl_my_htobe64,U64)
2191 #ifdef PERL_NEED_MY_BETOH64
2193 BETOH(Perl_my_betoh64,U64)
2195 NOT_AVAIL(Perl_my_betoh64,U64)
2199 #ifdef PERL_NEED_MY_HTOLES
2200 HTOLE(Perl_my_htoles,short)
2202 #ifdef PERL_NEED_MY_LETOHS
2203 LETOH(Perl_my_letohs,short)
2205 #ifdef PERL_NEED_MY_HTOBES
2206 HTOBE(Perl_my_htobes,short)
2208 #ifdef PERL_NEED_MY_BETOHS
2209 BETOH(Perl_my_betohs,short)
2212 #ifdef PERL_NEED_MY_HTOLEI
2213 HTOLE(Perl_my_htolei,int)
2215 #ifdef PERL_NEED_MY_LETOHI
2216 LETOH(Perl_my_letohi,int)
2218 #ifdef PERL_NEED_MY_HTOBEI
2219 HTOBE(Perl_my_htobei,int)
2221 #ifdef PERL_NEED_MY_BETOHI
2222 BETOH(Perl_my_betohi,int)
2225 #ifdef PERL_NEED_MY_HTOLEL
2226 HTOLE(Perl_my_htolel,long)
2228 #ifdef PERL_NEED_MY_LETOHL
2229 LETOH(Perl_my_letohl,long)
2231 #ifdef PERL_NEED_MY_HTOBEL
2232 HTOBE(Perl_my_htobel,long)
2234 #ifdef PERL_NEED_MY_BETOHL
2235 BETOH(Perl_my_betohl,long)
2239 Perl_my_swabn(void *ptr, int n)
2241 register char *s = (char *)ptr;
2242 register char *e = s + (n-1);
2245 PERL_ARGS_ASSERT_MY_SWABN;
2247 for (n /= 2; n > 0; s++, e--, n--) {
2255 Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
2257 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
2260 register I32 This, that;
2266 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2268 PERL_FLUSHALL_FOR_CHILD;
2269 This = (*mode == 'w');
2273 taint_proper("Insecure %s%s", "EXEC");
2275 if (PerlProc_pipe(p) < 0)
2277 /* Try for another pipe pair for error return */
2278 if (PerlProc_pipe(pp) >= 0)
2280 while ((pid = PerlProc_fork()) < 0) {
2281 if (errno != EAGAIN) {
2282 PerlLIO_close(p[This]);
2283 PerlLIO_close(p[that]);
2285 PerlLIO_close(pp[0]);
2286 PerlLIO_close(pp[1]);
2290 if (ckWARN(WARN_PIPE))
2291 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2300 /* Close parent's end of error status pipe (if any) */
2302 PerlLIO_close(pp[0]);
2303 #if defined(HAS_FCNTL) && defined(F_SETFD)
2304 /* Close error pipe automatically if exec works */
2305 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2308 /* Now dup our end of _the_ pipe to right position */
2309 if (p[THIS] != (*mode == 'r')) {
2310 PerlLIO_dup2(p[THIS], *mode == 'r');
2311 PerlLIO_close(p[THIS]);
2312 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2313 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2316 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2317 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2318 /* No automatic close - do it by hand */
2325 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2331 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2337 do_execfree(); /* free any memory malloced by child on fork */
2339 PerlLIO_close(pp[1]);
2340 /* Keep the lower of the two fd numbers */
2341 if (p[that] < p[This]) {
2342 PerlLIO_dup2(p[This], p[that]);
2343 PerlLIO_close(p[This]);
2347 PerlLIO_close(p[that]); /* close child's end of pipe */
2349 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2350 SvUPGRADE(sv,SVt_IV);
2352 PL_forkprocess = pid;
2353 /* If we managed to get status pipe check for exec fail */
2354 if (did_pipes && pid > 0) {
2359 while (n < sizeof(int)) {
2360 n1 = PerlLIO_read(pp[0],
2361 (void*)(((char*)&errkid)+n),
2367 PerlLIO_close(pp[0]);
2369 if (n) { /* Error */
2371 PerlLIO_close(p[This]);
2372 if (n != sizeof(int))
2373 Perl_croak(aTHX_ "panic: kid popen errno read");
2375 pid2 = wait4pid(pid, &status, 0);
2376 } while (pid2 == -1 && errno == EINTR);
2377 errno = errkid; /* Propagate errno from kid */
2382 PerlLIO_close(pp[0]);
2383 return PerlIO_fdopen(p[This], mode);
2385 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2386 return my_syspopen4(aTHX_ NULL, mode, n, args);
2388 Perl_croak(aTHX_ "List form of piped open not implemented");
2389 return (PerlIO *) NULL;
2394 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2395 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2397 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2401 register I32 This, that;
2404 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2408 PERL_ARGS_ASSERT_MY_POPEN;
2410 PERL_FLUSHALL_FOR_CHILD;
2413 return my_syspopen(aTHX_ cmd,mode);
2416 This = (*mode == 'w');
2418 if (doexec && PL_tainting) {
2420 taint_proper("Insecure %s%s", "EXEC");
2422 if (PerlProc_pipe(p) < 0)
2424 if (doexec && PerlProc_pipe(pp) >= 0)
2426 while ((pid = PerlProc_fork()) < 0) {
2427 if (errno != EAGAIN) {
2428 PerlLIO_close(p[This]);
2429 PerlLIO_close(p[that]);
2431 PerlLIO_close(pp[0]);
2432 PerlLIO_close(pp[1]);
2435 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
2438 if (ckWARN(WARN_PIPE))
2439 Perl_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
2450 PerlLIO_close(pp[0]);
2451 #if defined(HAS_FCNTL) && defined(F_SETFD)
2452 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2455 if (p[THIS] != (*mode == 'r')) {
2456 PerlLIO_dup2(p[THIS], *mode == 'r');
2457 PerlLIO_close(p[THIS]);
2458 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2459 PerlLIO_close(p[THAT]);
2462 PerlLIO_close(p[THAT]);
2465 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2472 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2477 /* may or may not use the shell */
2478 do_exec3(cmd, pp[1], did_pipes);
2481 #endif /* defined OS2 */
2483 #ifdef PERLIO_USING_CRLF
2484 /* Since we circumvent IO layers when we manipulate low-level
2485 filedescriptors directly, need to manually switch to the
2486 default, binary, low-level mode; see PerlIOBuf_open(). */
2487 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2490 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2491 SvREADONLY_off(GvSV(tmpgv));
2492 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2493 SvREADONLY_on(GvSV(tmpgv));
2495 #ifdef THREADS_HAVE_PIDS
2496 PL_ppid = (IV)getppid();
2499 #ifdef PERL_USES_PL_PIDSTATUS
2500 hv_clear(PL_pidstatus); /* we have no children */
2506 do_execfree(); /* free any memory malloced by child on vfork */
2508 PerlLIO_close(pp[1]);
2509 if (p[that] < p[This]) {
2510 PerlLIO_dup2(p[This], p[that]);
2511 PerlLIO_close(p[This]);
2515 PerlLIO_close(p[that]);
2517 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2518 SvUPGRADE(sv,SVt_IV);
2520 PL_forkprocess = pid;
2521 if (did_pipes && pid > 0) {
2526 while (n < sizeof(int)) {
2527 n1 = PerlLIO_read(pp[0],
2528 (void*)(((char*)&errkid)+n),
2534 PerlLIO_close(pp[0]);
2536 if (n) { /* Error */
2538 PerlLIO_close(p[This]);
2539 if (n != sizeof(int))
2540 Perl_croak(aTHX_ "panic: kid popen errno read");
2542 pid2 = wait4pid(pid, &status, 0);
2543 } while (pid2 == -1 && errno == EINTR);
2544 errno = errkid; /* Propagate errno from kid */
2549 PerlLIO_close(pp[0]);
2550 return PerlIO_fdopen(p[This], mode);
2553 #if defined(atarist) || defined(EPOC)
2556 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2558 PERL_ARGS_ASSERT_MY_POPEN;
2559 PERL_FLUSHALL_FOR_CHILD;
2560 /* Call system's popen() to get a FILE *, then import it.
2561 used 0 for 2nd parameter to PerlIO_importFILE;
2564 return PerlIO_importFILE(popen(cmd, mode), 0);
2568 FILE *djgpp_popen();
2570 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2572 PERL_FLUSHALL_FOR_CHILD;
2573 /* Call system's popen() to get a FILE *, then import it.
2574 used 0 for 2nd parameter to PerlIO_importFILE;
2577 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2580 #if defined(__LIBCATAMOUNT__)
2582 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2590 #endif /* !DOSISH */
2592 /* this is called in parent before the fork() */
2594 Perl_atfork_lock(void)
2597 #if defined(USE_ITHREADS)
2598 /* locks must be held in locking order (if any) */
2600 MUTEX_LOCK(&PL_malloc_mutex);
2606 /* this is called in both parent and child after the fork() */
2608 Perl_atfork_unlock(void)
2611 #if defined(USE_ITHREADS)
2612 /* locks must be released in same order as in atfork_lock() */
2614 MUTEX_UNLOCK(&PL_malloc_mutex);
2623 #if defined(HAS_FORK)
2625 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2630 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2631 * handlers elsewhere in the code */
2636 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2637 Perl_croak_nocontext("fork() not available");
2639 #endif /* HAS_FORK */
2644 Perl_dump_fds(pTHX_ const char *const s)
2649 PERL_ARGS_ASSERT_DUMP_FDS;
2651 PerlIO_printf(Perl_debug_log,"%s", s);
2652 for (fd = 0; fd < 32; fd++) {
2653 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2654 PerlIO_printf(Perl_debug_log," %d",fd);
2656 PerlIO_printf(Perl_debug_log,"\n");
2659 #endif /* DUMP_FDS */
2663 dup2(int oldfd, int newfd)
2665 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2668 PerlLIO_close(newfd);
2669 return fcntl(oldfd, F_DUPFD, newfd);
2671 #define DUP2_MAX_FDS 256
2672 int fdtmp[DUP2_MAX_FDS];
2678 PerlLIO_close(newfd);
2679 /* good enough for low fd's... */
2680 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2681 if (fdx >= DUP2_MAX_FDS) {
2689 PerlLIO_close(fdtmp[--fdx]);
2696 #ifdef HAS_SIGACTION
2699 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2702 struct sigaction act, oact;
2705 /* only "parent" interpreter can diddle signals */
2706 if (PL_curinterp != aTHX)
2707 return (Sighandler_t) SIG_ERR;
2710 act.sa_handler = (void(*)(int))handler;
2711 sigemptyset(&act.sa_mask);
2714 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2715 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2717 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2718 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2719 act.sa_flags |= SA_NOCLDWAIT;
2721 if (sigaction(signo, &act, &oact) == -1)
2722 return (Sighandler_t) SIG_ERR;
2724 return (Sighandler_t) oact.sa_handler;
2728 Perl_rsignal_state(pTHX_ int signo)
2730 struct sigaction oact;
2731 PERL_UNUSED_CONTEXT;
2733 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2734 return (Sighandler_t) SIG_ERR;
2736 return (Sighandler_t) oact.sa_handler;
2740 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2743 struct sigaction act;
2745 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2748 /* only "parent" interpreter can diddle signals */
2749 if (PL_curinterp != aTHX)
2753 act.sa_handler = (void(*)(int))handler;
2754 sigemptyset(&act.sa_mask);
2757 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2758 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2760 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2761 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2762 act.sa_flags |= SA_NOCLDWAIT;
2764 return sigaction(signo, &act, save);
2768 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2772 /* only "parent" interpreter can diddle signals */
2773 if (PL_curinterp != aTHX)
2777 return sigaction(signo, save, (struct sigaction *)NULL);
2780 #else /* !HAS_SIGACTION */
2783 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2785 #if defined(USE_ITHREADS) && !defined(WIN32)
2786 /* only "parent" interpreter can diddle signals */
2787 if (PL_curinterp != aTHX)
2788 return (Sighandler_t) SIG_ERR;
2791 return PerlProc_signal(signo, handler);
2802 Perl_rsignal_state(pTHX_ int signo)
2805 Sighandler_t oldsig;
2807 #if defined(USE_ITHREADS) && !defined(WIN32)
2808 /* only "parent" interpreter can diddle signals */
2809 if (PL_curinterp != aTHX)
2810 return (Sighandler_t) SIG_ERR;
2814 oldsig = PerlProc_signal(signo, sig_trap);
2815 PerlProc_signal(signo, oldsig);
2817 PerlProc_kill(PerlProc_getpid(), signo);
2822 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2824 #if defined(USE_ITHREADS) && !defined(WIN32)
2825 /* only "parent" interpreter can diddle signals */
2826 if (PL_curinterp != aTHX)
2829 *save = PerlProc_signal(signo, handler);
2830 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2834 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2836 #if defined(USE_ITHREADS) && !defined(WIN32)
2837 /* only "parent" interpreter can diddle signals */
2838 if (PL_curinterp != aTHX)
2841 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2844 #endif /* !HAS_SIGACTION */
2845 #endif /* !PERL_MICRO */
2847 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2848 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
2850 Perl_my_pclose(pTHX_ PerlIO *ptr)
2853 Sigsave_t hstat, istat, qstat;
2861 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2862 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2864 *svp = &PL_sv_undef;
2866 if (pid == -1) { /* Opened by popen. */
2867 return my_syspclose(ptr);
2870 close_failed = (PerlIO_close(ptr) == EOF);
2873 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2876 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2877 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2878 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2881 pid2 = wait4pid(pid, &status, 0);
2882 } while (pid2 == -1 && errno == EINTR);
2884 rsignal_restore(SIGHUP, &hstat);
2885 rsignal_restore(SIGINT, &istat);
2886 rsignal_restore(SIGQUIT, &qstat);
2892 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2895 #if defined(__LIBCATAMOUNT__)
2897 Perl_my_pclose(pTHX_ PerlIO *ptr)
2902 #endif /* !DOSISH */
2904 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
2906 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2910 PERL_ARGS_ASSERT_WAIT4PID;
2913 #ifdef PERL_USES_PL_PIDSTATUS
2916 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2917 pid, rather than a string form. */
2918 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2919 if (svp && *svp != &PL_sv_undef) {
2920 *statusp = SvIVX(*svp);
2921 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2929 hv_iterinit(PL_pidstatus);
2930 if ((entry = hv_iternext(PL_pidstatus))) {
2931 SV * const sv = hv_iterval(PL_pidstatus,entry);
2933 const char * const spid = hv_iterkey(entry,&len);
2935 assert (len == sizeof(Pid_t));
2936 memcpy((char *)&pid, spid, len);
2937 *statusp = SvIVX(sv);
2938 /* The hash iterator is currently on this entry, so simply
2939 calling hv_delete would trigger the lazy delete, which on
2940 aggregate does more work, beacuse next call to hv_iterinit()
2941 would spot the flag, and have to call the delete routine,
2942 while in the meantime any new entries can't re-use that
2944 hv_iterinit(PL_pidstatus);
2945 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2952 # ifdef HAS_WAITPID_RUNTIME
2953 if (!HAS_WAITPID_RUNTIME)
2956 result = PerlProc_waitpid(pid,statusp,flags);
2959 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2960 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2963 #ifdef PERL_USES_PL_PIDSTATUS
2964 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2969 Perl_croak(aTHX_ "Can't do waitpid with flags");
2971 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2972 pidgone(result,*statusp);
2978 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2981 if (result < 0 && errno == EINTR) {
2983 errno = EINTR; /* reset in case a signal handler changed $! */
2987 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2989 #ifdef PERL_USES_PL_PIDSTATUS
2991 S_pidgone(pTHX_ Pid_t pid, int status)
2995 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2996 SvUPGRADE(sv,SVt_IV);
2997 SvIV_set(sv, status);
3002 #if defined(atarist) || defined(OS2) || defined(EPOC)
3005 int /* Cannot prototype with I32
3007 my_syspclose(PerlIO *ptr)
3010 Perl_my_pclose(pTHX_ PerlIO *ptr)
3013 /* Needs work for PerlIO ! */
3014 FILE * const f = PerlIO_findFILE(ptr);
3015 const I32 result = pclose(f);
3016 PerlIO_releaseFILE(ptr,f);
3024 Perl_my_pclose(pTHX_ PerlIO *ptr)
3026 /* Needs work for PerlIO ! */
3027 FILE * const f = PerlIO_findFILE(ptr);
3028 I32 result = djgpp_pclose(f);
3029 result = (result << 8) & 0xff00;
3030 PerlIO_releaseFILE(ptr,f);
3036 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
3039 register const char * const frombase = from;
3040 PERL_UNUSED_CONTEXT;
3042 PERL_ARGS_ASSERT_REPEATCPY;
3045 register const char c = *from;
3050 while (count-- > 0) {
3051 for (todo = len; todo > 0; todo--) {
3060 Perl_same_dirent(pTHX_ const char *a, const char *b)
3062 char *fa = strrchr(a,'/');
3063 char *fb = strrchr(b,'/');
3066 SV * const tmpsv = sv_newmortal();
3068 PERL_ARGS_ASSERT_SAME_DIRENT;
3081 sv_setpvs(tmpsv, ".");
3083 sv_setpvn(tmpsv, a, fa - a);
3084 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3087 sv_setpvs(tmpsv, ".");
3089 sv_setpvn(tmpsv, b, fb - b);
3090 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3092 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3093 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3095 #endif /* !HAS_RENAME */
3098 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3099 const char *const *const search_ext, I32 flags)
3102 const char *xfound = NULL;
3103 char *xfailed = NULL;
3104 char tmpbuf[MAXPATHLEN];
3109 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3110 # define SEARCH_EXTS ".bat", ".cmd", NULL
3111 # define MAX_EXT_LEN 4
3114 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3115 # define MAX_EXT_LEN 4
3118 # define SEARCH_EXTS ".pl", ".com", NULL
3119 # define MAX_EXT_LEN 4
3121 /* additional extensions to try in each dir if scriptname not found */
3123 static const char *const exts[] = { SEARCH_EXTS };
3124 const char *const *const ext = search_ext ? search_ext : exts;
3125 int extidx = 0, i = 0;
3126 const char *curext = NULL;
3128 PERL_UNUSED_ARG(search_ext);
3129 # define MAX_EXT_LEN 0
3132 PERL_ARGS_ASSERT_FIND_SCRIPT;
3135 * If dosearch is true and if scriptname does not contain path
3136 * delimiters, search the PATH for scriptname.
3138 * If SEARCH_EXTS is also defined, will look for each
3139 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3140 * while searching the PATH.
3142 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3143 * proceeds as follows:
3144 * If DOSISH or VMSISH:
3145 * + look for ./scriptname{,.foo,.bar}
3146 * + search the PATH for scriptname{,.foo,.bar}
3149 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3150 * this will not look in '.' if it's not in the PATH)
3155 # ifdef ALWAYS_DEFTYPES
3156 len = strlen(scriptname);
3157 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3158 int idx = 0, deftypes = 1;
3161 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3164 int idx = 0, deftypes = 1;
3167 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3169 /* The first time through, just add SEARCH_EXTS to whatever we
3170 * already have, so we can check for default file types. */
3172 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3178 if ((strlen(tmpbuf) + strlen(scriptname)
3179 + MAX_EXT_LEN) >= sizeof tmpbuf)
3180 continue; /* don't search dir with too-long name */
3181 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3185 if (strEQ(scriptname, "-"))
3187 if (dosearch) { /* Look in '.' first. */
3188 const char *cur = scriptname;
3190 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3192 if (strEQ(ext[i++],curext)) {
3193 extidx = -1; /* already has an ext */
3198 DEBUG_p(PerlIO_printf(Perl_debug_log,
3199 "Looking for %s\n",cur));
3200 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3201 && !S_ISDIR(PL_statbuf.st_mode)) {
3209 if (cur == scriptname) {
3210 len = strlen(scriptname);
3211 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3213 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3216 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3217 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3222 if (dosearch && !strchr(scriptname, '/')
3224 && !strchr(scriptname, '\\')
3226 && (s = PerlEnv_getenv("PATH")))
3230 bufend = s + strlen(s);
3231 while (s < bufend) {
3232 #if defined(atarist) || defined(DOSISH)
3237 && *s != ';'; len++, s++) {
3238 if (len < sizeof tmpbuf)
3241 if (len < sizeof tmpbuf)
3243 #else /* ! (atarist || DOSISH) */
3244 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3247 #endif /* ! (atarist || DOSISH) */
3250 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3251 continue; /* don't search dir with too-long name */
3253 # if defined(atarist) || defined(DOSISH)
3254 && tmpbuf[len - 1] != '/'
3255 && tmpbuf[len - 1] != '\\'
3258 tmpbuf[len++] = '/';
3259 if (len == 2 && tmpbuf[0] == '.')
3261 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3265 len = strlen(tmpbuf);
3266 if (extidx > 0) /* reset after previous loop */
3270 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3271 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3272 if (S_ISDIR(PL_statbuf.st_mode)) {
3276 } while ( retval < 0 /* not there */
3277 && extidx>=0 && ext[extidx] /* try an extension? */
3278 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3283 if (S_ISREG(PL_statbuf.st_mode)
3284 && cando(S_IRUSR,TRUE,&PL_statbuf)
3285 #if !defined(DOSISH)
3286 && cando(S_IXUSR,TRUE,&PL_statbuf)
3290 xfound = tmpbuf; /* bingo! */
3294 xfailed = savepv(tmpbuf);
3297 if (!xfound && !seen_dot && !xfailed &&
3298 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3299 || S_ISDIR(PL_statbuf.st_mode)))
3301 seen_dot = 1; /* Disable message. */
3303 if (flags & 1) { /* do or die? */
3304 Perl_croak(aTHX_ "Can't %s %s%s%s",
3305 (xfailed ? "execute" : "find"),
3306 (xfailed ? xfailed : scriptname),
3307 (xfailed ? "" : " on PATH"),
3308 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3313 scriptname = xfound;
3315 return (scriptname ? savepv(scriptname) : NULL);
3318 #ifndef PERL_GET_CONTEXT_DEFINED
3321 Perl_get_context(void)
3324 #if defined(USE_ITHREADS)
3325 # ifdef OLD_PTHREADS_API
3327 if (pthread_getspecific(PL_thr_key, &t))
3328 Perl_croak_nocontext("panic: pthread_getspecific");
3331 # ifdef I_MACH_CTHREADS
3332 return (void*)cthread_data(cthread_self());
3334 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3343 Perl_set_context(void *t)
3346 PERL_ARGS_ASSERT_SET_CONTEXT;
3347 #if defined(USE_ITHREADS)
3348 # ifdef I_MACH_CTHREADS
3349 cthread_set_data(cthread_self(), t);
3351 if (pthread_setspecific(PL_thr_key, t))
3352 Perl_croak_nocontext("panic: pthread_setspecific");
3359 #endif /* !PERL_GET_CONTEXT_DEFINED */
3361 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3370 Perl_get_op_names(pTHX)
3372 PERL_UNUSED_CONTEXT;
3373 return (char **)PL_op_name;
3377 Perl_get_op_descs(pTHX)
3379 PERL_UNUSED_CONTEXT;
3380 return (char **)PL_op_desc;
3384 Perl_get_no_modify(pTHX)
3386 PERL_UNUSED_CONTEXT;
3387 return PL_no_modify;
3391 Perl_get_opargs(pTHX)
3393 PERL_UNUSED_CONTEXT;
3394 return (U32 *)PL_opargs;
3398 Perl_get_ppaddr(pTHX)
3401 PERL_UNUSED_CONTEXT;
3402 return (PPADDR_t*)PL_ppaddr;
3405 #ifndef HAS_GETENV_LEN
3407 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3409 char * const env_trans = PerlEnv_getenv(env_elem);
3410 PERL_UNUSED_CONTEXT;
3411 PERL_ARGS_ASSERT_GETENV_LEN;
3413 *len = strlen(env_trans);
3420 Perl_get_vtbl(pTHX_ int vtbl_id)
3422 const MGVTBL* result;
3423 PERL_UNUSED_CONTEXT;
3427 result = &PL_vtbl_sv;
3430 result = &PL_vtbl_env;
3432 case want_vtbl_envelem:
3433 result = &PL_vtbl_envelem;
3436 result = &PL_vtbl_sig;
3438 case want_vtbl_sigelem:
3439 result = &PL_vtbl_sigelem;
3441 case want_vtbl_pack:
3442 result = &PL_vtbl_pack;
3444 case want_vtbl_packelem:
3445 result = &PL_vtbl_packelem;
3447 case want_vtbl_dbline:
3448 result = &PL_vtbl_dbline;
3451 result = &PL_vtbl_isa;
3453 case want_vtbl_isaelem:
3454 result = &PL_vtbl_isaelem;
3456 case want_vtbl_arylen:
3457 result = &PL_vtbl_arylen;
3459 case want_vtbl_mglob:
3460 result = &PL_vtbl_mglob;
3462 case want_vtbl_nkeys:
3463 result = &PL_vtbl_nkeys;
3465 case want_vtbl_taint:
3466 result = &PL_vtbl_taint;
3468 case want_vtbl_substr:
3469 result = &PL_vtbl_substr;
3472 result = &PL_vtbl_vec;
3475 result = &PL_vtbl_pos;
3478 result = &PL_vtbl_bm;
3481 result = &PL_vtbl_fm;
3483 case want_vtbl_uvar:
3484 result = &PL_vtbl_uvar;
3486 case want_vtbl_defelem:
3487 result = &PL_vtbl_defelem;
3489 case want_vtbl_regexp:
3490 result = &PL_vtbl_regexp;
3492 case want_vtbl_regdata:
3493 result = &PL_vtbl_regdata;
3495 case want_vtbl_regdatum:
3496 result = &PL_vtbl_regdatum;
3498 #ifdef USE_LOCALE_COLLATE
3499 case want_vtbl_collxfrm:
3500 result = &PL_vtbl_collxfrm;
3503 case want_vtbl_amagic:
3504 result = &PL_vtbl_amagic;
3506 case want_vtbl_amagicelem:
3507 result = &PL_vtbl_amagicelem;
3509 case want_vtbl_backref:
3510 result = &PL_vtbl_backref;
3512 case want_vtbl_utf8:
3513 result = &PL_vtbl_utf8;
3519 return (MGVTBL*)result;
3523 Perl_my_fflush_all(pTHX)
3525 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3526 return PerlIO_flush(NULL);
3528 # if defined(HAS__FWALK)
3529 extern int fflush(FILE *);
3530 /* undocumented, unprototyped, but very useful BSDism */
3531 extern void _fwalk(int (*)(FILE *));
3535 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3537 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3538 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3540 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3541 open_max = sysconf(_SC_OPEN_MAX);
3544 open_max = FOPEN_MAX;
3547 open_max = OPEN_MAX;
3558 for (i = 0; i < open_max; i++)
3559 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3560 STDIO_STREAM_ARRAY[i]._file < open_max &&
3561 STDIO_STREAM_ARRAY[i]._flag)
3562 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3566 SETERRNO(EBADF,RMS_IFI);
3573 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3575 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3577 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3578 if (ckWARN(WARN_IO)) {
3579 const char * const direction =
3580 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3582 Perl_warner(aTHX_ packWARN(WARN_IO),
3583 "Filehandle %s opened only for %sput",
3586 Perl_warner(aTHX_ packWARN(WARN_IO),
3587 "Filehandle opened only for %sput", direction);
3594 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3596 warn_type = WARN_CLOSED;
3600 warn_type = WARN_UNOPENED;
3603 if (ckWARN(warn_type)) {
3604 const char * const pars =
3605 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3606 const char * const func =
3608 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3609 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3610 op < 0 ? "" : /* handle phoney cases */
3612 const char * const type =
3614 (OP_IS_SOCKET(op) ||
3615 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3616 "socket" : "filehandle");
3617 if (name && *name) {
3618 Perl_warner(aTHX_ packWARN(warn_type),
3619 "%s%s on %s %s %s", func, pars, vile, type, name);
3620 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3622 aTHX_ packWARN(warn_type),
3623 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3628 Perl_warner(aTHX_ packWARN(warn_type),
3629 "%s%s on %s %s", func, pars, vile, type);
3630 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3632 aTHX_ packWARN(warn_type),
3633 "\t(Are you trying to call %s%s on dirhandle?)\n",
3642 /* in ASCII order, not that it matters */
3643 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3646 Perl_ebcdic_control(pTHX_ int ch)
3654 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3655 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3658 if (ctlp == controllablechars)
3659 return('\177'); /* DEL */
3661 return((unsigned char)(ctlp - controllablechars - 1));
3662 } else { /* Want uncontrol */
3663 if (ch == '\177' || ch == -1)
3665 else if (ch == '\157')
3667 else if (ch == '\174')
3669 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3671 else if (ch == '\155')
3673 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3674 return(controllablechars[ch+1]);
3676 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3681 /* To workaround core dumps from the uninitialised tm_zone we get the
3682 * system to give us a reasonable struct to copy. This fix means that
3683 * strftime uses the tm_zone and tm_gmtoff values returned by
3684 * localtime(time()). That should give the desired result most of the
3685 * time. But probably not always!
3687 * This does not address tzname aspects of NETaa14816.
3692 # ifndef STRUCT_TM_HASZONE
3693 # define STRUCT_TM_HASZONE
3697 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3698 # ifndef HAS_TM_TM_ZONE
3699 # define HAS_TM_TM_ZONE
3704 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3706 #ifdef HAS_TM_TM_ZONE
3708 const struct tm* my_tm;
3709 PERL_ARGS_ASSERT_INIT_TM;
3711 my_tm = localtime(&now);
3713 Copy(my_tm, ptm, 1, struct tm);
3715 PERL_ARGS_ASSERT_INIT_TM;
3716 PERL_UNUSED_ARG(ptm);
3721 * mini_mktime - normalise struct tm values without the localtime()
3722 * semantics (and overhead) of mktime().
3725 Perl_mini_mktime(pTHX_ struct tm *ptm)
3729 int month, mday, year, jday;
3730 int odd_cent, odd_year;
3731 PERL_UNUSED_CONTEXT;
3733 PERL_ARGS_ASSERT_MINI_MKTIME;
3735 #define DAYS_PER_YEAR 365
3736 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3737 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3738 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3739 #define SECS_PER_HOUR (60*60)
3740 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3741 /* parentheses deliberately absent on these two, otherwise they don't work */
3742 #define MONTH_TO_DAYS 153/5
3743 #define DAYS_TO_MONTH 5/153
3744 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3745 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3746 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3747 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3750 * Year/day algorithm notes:
3752 * With a suitable offset for numeric value of the month, one can find
3753 * an offset into the year by considering months to have 30.6 (153/5) days,
3754 * using integer arithmetic (i.e., with truncation). To avoid too much
3755 * messing about with leap days, we consider January and February to be
3756 * the 13th and 14th month of the previous year. After that transformation,
3757 * we need the month index we use to be high by 1 from 'normal human' usage,
3758 * so the month index values we use run from 4 through 15.
3760 * Given that, and the rules for the Gregorian calendar (leap years are those
3761 * divisible by 4 unless also divisible by 100, when they must be divisible
3762 * by 400 instead), we can simply calculate the number of days since some
3763 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3764 * the days we derive from our month index, and adding in the day of the
3765 * month. The value used here is not adjusted for the actual origin which
3766 * it normally would use (1 January A.D. 1), since we're not exposing it.
3767 * We're only building the value so we can turn around and get the
3768 * normalised values for the year, month, day-of-month, and day-of-year.
3770 * For going backward, we need to bias the value we're using so that we find
3771 * the right year value. (Basically, we don't want the contribution of
3772 * March 1st to the number to apply while deriving the year). Having done
3773 * that, we 'count up' the contribution to the year number by accounting for
3774 * full quadracenturies (400-year periods) with their extra leap days, plus
3775 * the contribution from full centuries (to avoid counting in the lost leap
3776 * days), plus the contribution from full quad-years (to count in the normal
3777 * leap days), plus the leftover contribution from any non-leap years.
3778 * At this point, if we were working with an actual leap day, we'll have 0
3779 * days left over. This is also true for March 1st, however. So, we have
3780 * to special-case that result, and (earlier) keep track of the 'odd'
3781 * century and year contributions. If we got 4 extra centuries in a qcent,
3782 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3783 * Otherwise, we add back in the earlier bias we removed (the 123 from
3784 * figuring in March 1st), find the month index (integer division by 30.6),
3785 * and the remainder is the day-of-month. We then have to convert back to
3786 * 'real' months (including fixing January and February from being 14/15 in
3787 * the previous year to being in the proper year). After that, to get
3788 * tm_yday, we work with the normalised year and get a new yearday value for
3789 * January 1st, which we subtract from the yearday value we had earlier,
3790 * representing the date we've re-built. This is done from January 1
3791 * because tm_yday is 0-origin.
3793 * Since POSIX time routines are only guaranteed to work for times since the
3794 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3795 * applies Gregorian calendar rules even to dates before the 16th century
3796 * doesn't bother me. Besides, you'd need cultural context for a given
3797 * date to know whether it was Julian or Gregorian calendar, and that's
3798 * outside the scope for this routine. Since we convert back based on the
3799 * same rules we used to build the yearday, you'll only get strange results
3800 * for input which needed normalising, or for the 'odd' century years which
3801 * were leap years in the Julian calander but not in the Gregorian one.
3802 * I can live with that.
3804 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3805 * that's still outside the scope for POSIX time manipulation, so I don't
3809 year = 1900 + ptm->tm_year;
3810 month = ptm->tm_mon;
3811 mday = ptm->tm_mday;
3812 /* allow given yday with no month & mday to dominate the result */
3813 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3816 jday = 1 + ptm->tm_yday;
3825 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3826 yearday += month*MONTH_TO_DAYS + mday + jday;
3828 * Note that we don't know when leap-seconds were or will be,
3829 * so we have to trust the user if we get something which looks
3830 * like a sensible leap-second. Wild values for seconds will
3831 * be rationalised, however.
3833 if ((unsigned) ptm->tm_sec <= 60) {
3840 secs += 60 * ptm->tm_min;
3841 secs += SECS_PER_HOUR * ptm->tm_hour;
3843 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3844 /* got negative remainder, but need positive time */
3845 /* back off an extra day to compensate */
3846 yearday += (secs/SECS_PER_DAY)-1;
3847 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3850 yearday += (secs/SECS_PER_DAY);
3851 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3854 else if (secs >= SECS_PER_DAY) {
3855 yearday += (secs/SECS_PER_DAY);
3856 secs %= SECS_PER_DAY;
3858 ptm->tm_hour = secs/SECS_PER_HOUR;
3859 secs %= SECS_PER_HOUR;
3860 ptm->tm_min = secs/60;
3862 ptm->tm_sec += secs;
3863 /* done with time of day effects */
3865 * The algorithm for yearday has (so far) left it high by 428.
3866 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3867 * bias it by 123 while trying to figure out what year it
3868 * really represents. Even with this tweak, the reverse
3869 * translation fails for years before A.D. 0001.
3870 * It would still fail for Feb 29, but we catch that one below.
3872 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3873 yearday -= YEAR_ADJUST;
3874 year = (yearday / DAYS_PER_QCENT) * 400;
3875 yearday %= DAYS_PER_QCENT;
3876 odd_cent = yearday / DAYS_PER_CENT;
3877 year += odd_cent * 100;
3878 yearday %= DAYS_PER_CENT;
3879 year += (yearday / DAYS_PER_QYEAR) * 4;
3880 yearday %= DAYS_PER_QYEAR;
3881 odd_year = yearday / DAYS_PER_YEAR;
3883 yearday %= DAYS_PER_YEAR;
3884 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3889 yearday += YEAR_ADJUST; /* recover March 1st crock */
3890 month = yearday*DAYS_TO_MONTH;
3891 yearday -= month*MONTH_TO_DAYS;
3892 /* recover other leap-year adjustment */
3901 ptm->tm_year = year - 1900;
3903 ptm->tm_mday = yearday;
3904 ptm->tm_mon = month;
3908 ptm->tm_mon = month - 1;
3910 /* re-build yearday based on Jan 1 to get tm_yday */
3912 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3913 yearday += 14*MONTH_TO_DAYS + 1;
3914 ptm->tm_yday = jday - yearday;
3915 /* fix tm_wday if not overridden by caller */
3916 if ((unsigned)ptm->tm_wday > 6)
3917 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3921 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)
3929 PERL_ARGS_ASSERT_MY_STRFTIME;
3931 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3934 mytm.tm_hour = hour;
3935 mytm.tm_mday = mday;
3937 mytm.tm_year = year;
3938 mytm.tm_wday = wday;
3939 mytm.tm_yday = yday;
3940 mytm.tm_isdst = isdst;
3942 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3943 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3948 #ifdef HAS_TM_TM_GMTOFF
3949 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3951 #ifdef HAS_TM_TM_ZONE
3952 mytm.tm_zone = mytm2.tm_zone;
3957 Newx(buf, buflen, char);
3958 len = strftime(buf, buflen, fmt, &mytm);
3960 ** The following is needed to handle to the situation where
3961 ** tmpbuf overflows. Basically we want to allocate a buffer
3962 ** and try repeatedly. The reason why it is so complicated
3963 ** is that getting a return value of 0 from strftime can indicate
3964 ** one of the following:
3965 ** 1. buffer overflowed,
3966 ** 2. illegal conversion specifier, or
3967 ** 3. the format string specifies nothing to be returned(not
3968 ** an error). This could be because format is an empty string
3969 ** or it specifies %p that yields an empty string in some locale.
3970 ** If there is a better way to make it portable, go ahead by
3973 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3976 /* Possibly buf overflowed - try again with a bigger buf */
3977 const int fmtlen = strlen(fmt);
3978 int bufsize = fmtlen + buflen;
3980 Newx(buf, bufsize, char);
3982 buflen = strftime(buf, bufsize, fmt, &mytm);
3983 if (buflen > 0 && buflen < bufsize)
3985 /* heuristic to prevent out-of-memory errors */
3986 if (bufsize > 100*fmtlen) {
3992 Renew(buf, bufsize, char);
3997 Perl_croak(aTHX_ "panic: no strftime");
4003 #define SV_CWD_RETURN_UNDEF \
4004 sv_setsv(sv, &PL_sv_undef); \
4007 #define SV_CWD_ISDOT(dp) \
4008 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
4009 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
4012 =head1 Miscellaneous Functions
4014 =for apidoc getcwd_sv
4016 Fill the sv with current working directory
4021 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
4022 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
4023 * getcwd(3) if available
4024 * Comments from the orignal:
4025 * This is a faster version of getcwd. It's also more dangerous
4026 * because you might chdir out of a directory that you can't chdir
4030 Perl_getcwd_sv(pTHX_ register SV *sv)
4034 #ifndef INCOMPLETE_TAINTS
4038 PERL_ARGS_ASSERT_GETCWD_SV;
4042 char buf[MAXPATHLEN];
4044 /* Some getcwd()s automatically allocate a buffer of the given
4045 * size from the heap if they are given a NULL buffer pointer.
4046 * The problem is that this behaviour is not portable. */
4047 if (getcwd(buf, sizeof(buf) - 1)) {
4052 sv_setsv(sv, &PL_sv_undef);
4060 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4064 SvUPGRADE(sv, SVt_PV);
4066 if (PerlLIO_lstat(".", &statbuf) < 0) {
4067 SV_CWD_RETURN_UNDEF;
4070 orig_cdev = statbuf.st_dev;
4071 orig_cino = statbuf.st_ino;
4081 if (PerlDir_chdir("..") < 0) {
4082 SV_CWD_RETURN_UNDEF;
4084 if (PerlLIO_stat(".", &statbuf) < 0) {
4085 SV_CWD_RETURN_UNDEF;
4088 cdev = statbuf.st_dev;
4089 cino = statbuf.st_ino;
4091 if (odev == cdev && oino == cino) {
4094 if (!(dir = PerlDir_open("."))) {
4095 SV_CWD_RETURN_UNDEF;
4098 while ((dp = PerlDir_read(dir)) != NULL) {
4100 namelen = dp->d_namlen;
4102 namelen = strlen(dp->d_name);
4105 if (SV_CWD_ISDOT(dp)) {
4109 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4110 SV_CWD_RETURN_UNDEF;
4113 tdev = statbuf.st_dev;
4114 tino = statbuf.st_ino;
4115 if (tino == oino && tdev == odev) {
4121 SV_CWD_RETURN_UNDEF;
4124 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4125 SV_CWD_RETURN_UNDEF;
4128 SvGROW(sv, pathlen + namelen + 1);
4132 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4135 /* prepend current directory to the front */
4137 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4138 pathlen += (namelen + 1);
4140 #ifdef VOID_CLOSEDIR
4143 if (PerlDir_close(dir) < 0) {
4144 SV_CWD_RETURN_UNDEF;
4150 SvCUR_set(sv, pathlen);
4154 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4155 SV_CWD_RETURN_UNDEF;
4158 if (PerlLIO_stat(".", &statbuf) < 0) {
4159 SV_CWD_RETURN_UNDEF;
4162 cdev = statbuf.st_dev;
4163 cino = statbuf.st_ino;
4165 if (cdev != orig_cdev || cino != orig_cino) {
4166 Perl_croak(aTHX_ "Unstable directory path, "
4167 "current directory changed unexpectedly");
4178 #define VERSION_MAX 0x7FFFFFFF
4180 =for apidoc scan_version
4182 Returns a pointer to the next character after the parsed
4183 version string, as well as upgrading the passed in SV to
4186 Function must be called with an already existing SV like
4189 s = scan_version(s, SV *sv, bool qv);
4191 Performs some preprocessing to the string to ensure that
4192 it has the correct characteristics of a version. Flags the
4193 object if it contains an underscore (which denotes this
4194 is an alpha version). The boolean qv denotes that the version
4195 should be interpreted as if it had multiple decimals, even if
4202 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4211 AV * const av = newAV();
4212 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4214 PERL_ARGS_ASSERT_SCAN_VERSION;
4216 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4218 while (isSPACE(*s)) /* leading whitespace is OK */
4224 s++; /* get past 'v' */
4225 qv = 1; /* force quoted version processing */
4230 /* pre-scan the input string to check for decimals/underbars */
4231 while ( *pos == '.' || *pos == '_' || *pos == ',' || isDIGIT(*pos) )
4236 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4240 else if ( *pos == '_' )
4243 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4245 width = pos - last - 1; /* natural width of sub-version */
4247 else if ( *pos == ',' && isDIGIT(pos[1]) )
4256 if ( alpha && !saw_period )
4257 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4259 if ( alpha && saw_period && width == 0 )
4260 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4262 if ( saw_period > 1 )
4263 qv = 1; /* force quoted version processing */
4269 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv));
4271 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha));
4272 if ( !qv && width < 3 )
4273 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4275 while (isDIGIT(*pos))
4277 if (!isALPHA(*pos)) {
4283 /* this is atoi() that delimits on underscores */
4284 const char *end = pos;
4288 /* the following if() will only be true after the decimal
4289 * point of a version originally created with a bare
4290 * floating point number, i.e. not quoted in any way
4292 if ( !qv && s > start && saw_period == 1 ) {
4296 rev += (*s - '0') * mult;
4298 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4299 || (PERL_ABS(rev) > VERSION_MAX )) {
4300 if(ckWARN(WARN_OVERFLOW))
4301 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4302 "Integer overflow in version %d",VERSION_MAX);
4313 while (--end >= s) {
4315 rev += (*end - '0') * mult;
4317 if ( (PERL_ABS(orev) > PERL_ABS(rev))
4318 || (PERL_ABS(rev) > VERSION_MAX )) {
4319 if(ckWARN(WARN_OVERFLOW))
4320 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
4321 "Integer overflow in version");
4330 /* Append revision */
4331 av_push(av, newSViv(rev));
4336 else if ( *pos == '.' )
4338 else if ( *pos == '_' && isDIGIT(pos[1]) )
4340 else if ( *pos == ',' && isDIGIT(pos[1]) )
4342 else if ( isDIGIT(*pos) )
4349 while ( isDIGIT(*pos) )
4354 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4362 if ( qv ) { /* quoted versions always get at least three terms*/
4363 I32 len = av_len(av);
4364 /* This for loop appears to trigger a compiler bug on OS X, as it
4365 loops infinitely. Yes, len is negative. No, it makes no sense.
4366 Compiler in question is:
4367 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4368 for ( len = 2 - len; len > 0; len-- )
4369 av_push(MUTABLE_AV(sv), newSViv(0));
4373 av_push(av, newSViv(0));
4376 /* need to save off the current version string for later */
4378 SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1);
4379 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4380 (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1));
4382 else if ( s > start ) {
4383 SV * orig = newSVpvn(start,s-start);
4384 if ( qv && saw_period == 1 && *start != 'v' ) {
4385 /* need to insert a v to be consistent */
4386 sv_insert(orig, 0, 0, "v", 1);
4388 (void)hv_stores(MUTABLE_HV(hv), "original", orig);
4391 (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0"));
4392 av_push(av, newSViv(0));
4395 /* And finally, store the AV in the hash */
4396 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4398 /* fix RT#19517 - special case 'undef' as string */
4399 if ( *s == 'u' && strEQ(s,"undef") ) {
4407 =for apidoc new_version
4409 Returns a new version object based on the passed in SV:
4411 SV *sv = new_version(SV *ver);
4413 Does not alter the passed in ver SV. See "upg_version" if you
4414 want to upgrade the SV.
4420 Perl_new_version(pTHX_ SV *ver)
4423 SV * const rv = newSV(0);
4424 PERL_ARGS_ASSERT_NEW_VERSION;
4425 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4428 AV * const av = newAV();
4430 /* This will get reblessed later if a derived class*/
4431 SV * const hv = newSVrv(rv, "version");
4432 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4437 /* Begin copying all of the elements */
4438 if ( hv_exists(MUTABLE_HV(ver), "qv", 2) )
4439 (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1));
4441 if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) )
4442 (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1));
4444 if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) )
4446 const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE));
4447 (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width));
4450 if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) )
4452 SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE);
4453 (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv));
4456 sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE)));
4457 /* This will get reblessed later if a derived class*/
4458 for ( key = 0; key <= av_len(sav); key++ )
4460 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4461 av_push(av, newSViv(rev));
4464 (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av)));
4469 const MAGIC* const mg = SvVSTRING_mg(ver);
4470 if ( mg ) { /* already a v-string */
4471 const STRLEN len = mg->mg_len;
4472 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4473 sv_setpvn(rv,version,len);
4474 /* this is for consistency with the pure Perl class */
4475 if ( *version != 'v' )
4476 sv_insert(rv, 0, 0, "v", 1);
4481 sv_setsv(rv,ver); /* make a duplicate */
4486 return upg_version(rv, FALSE);
4490 =for apidoc upg_version
4492 In-place upgrade of the supplied SV to a version object.
4494 SV *sv = upg_version(SV *sv, bool qv);
4496 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4497 to force this SV to be interpreted as an "extended" version.
4503 Perl_upg_version(pTHX_ SV *ver, bool qv)
4505 const char *version, *s;
4510 PERL_ARGS_ASSERT_UPG_VERSION;
4512 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4514 /* may get too much accuracy */
4516 #ifdef USE_LOCALE_NUMERIC
4517 char *loc = setlocale(LC_NUMERIC, "C");
4519 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4520 #ifdef USE_LOCALE_NUMERIC
4521 setlocale(LC_NUMERIC, loc);
4523 while (tbuf[len-1] == '0' && len > 0) len--;
4524 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4525 version = savepvn(tbuf, len);
4528 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4529 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4533 else /* must be a string or something like a string */
4536 version = savepv(SvPV(ver,len));
4538 # if PERL_VERSION > 5
4539 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4540 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4541 /* may be a v-string */
4542 SV * const nsv = sv_newmortal();
4546 sv_setpvf(nsv,"v%vd",ver);
4547 pos = nver = savepv(SvPV_nolen(nsv));
4549 /* scan the resulting formatted string */
4550 pos++; /* skip the leading 'v' */
4551 while ( *pos == '.' || isDIGIT(*pos) ) {
4557 /* is definitely a v-string */
4558 if ( saw_period == 2 ) {
4567 s = scan_version(version, ver, qv);
4569 if(ckWARN(WARN_MISC))
4570 Perl_warner(aTHX_ packWARN(WARN_MISC),
4571 "Version string '%s' contains invalid data; "
4572 "ignoring: '%s'", version, s);
4580 Validates that the SV contains a valid version object.
4582 bool vverify(SV *vobj);
4584 Note that it only confirms the bare minimum structure (so as not to get
4585 confused by derived classes which may contain additional hash entries):
4589 =item * The SV contains a [reference to a] hash
4591 =item * The hash contains a "version" key
4593 =item * The "version" key has [a reference to] an AV as its value
4601 Perl_vverify(pTHX_ SV *vs)
4605 PERL_ARGS_ASSERT_VVERIFY;
4610 /* see if the appropriate elements exist */
4611 if ( SvTYPE(vs) == SVt_PVHV
4612 && hv_exists(MUTABLE_HV(vs), "version", 7)
4613 && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)))
4614 && SvTYPE(sv) == SVt_PVAV )
4623 Accepts a version object and returns the normalized floating
4624 point representation. Call like:
4628 NOTE: you can pass either the object directly or the SV
4629 contained within the RV.
4635 Perl_vnumify(pTHX_ SV *vs)
4640 SV * const sv = newSV(0);
4643 PERL_ARGS_ASSERT_VNUMIFY;
4649 Perl_croak(aTHX_ "Invalid version object");
4651 /* see if various flags exist */
4652 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4654 if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) )
4655 width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE));
4660 /* attempt to retrieve the version array */
4661 if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) {
4673 digit = SvIV(*av_fetch(av, 0, 0));
4674 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4675 for ( i = 1 ; i < len ; i++ )
4677 digit = SvIV(*av_fetch(av, i, 0));
4679 const int denom = (width == 2 ? 10 : 100);
4680 const div_t term = div((int)PERL_ABS(digit),denom);
4681 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4684 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4690 digit = SvIV(*av_fetch(av, len, 0));
4691 if ( alpha && width == 3 ) /* alpha version */
4693 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4697 sv_catpvs(sv, "000");
4705 Accepts a version object and returns the normalized string
4706 representation. Call like:
4710 NOTE: you can pass either the object directly or the SV
4711 contained within the RV.
4717 Perl_vnormal(pTHX_ SV *vs)
4721 SV * const sv = newSV(0);
4724 PERL_ARGS_ASSERT_VNORMAL;
4730 Perl_croak(aTHX_ "Invalid version object");
4732 if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) )
4734 av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE)));
4742 digit = SvIV(*av_fetch(av, 0, 0));
4743 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4744 for ( i = 1 ; i < len ; i++ ) {
4745 digit = SvIV(*av_fetch(av, i, 0));
4746 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4751 /* handle last digit specially */
4752 digit = SvIV(*av_fetch(av, len, 0));
4754 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4756 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4759 if ( len <= 2 ) { /* short version, must be at least three */
4760 for ( len = 2 - len; len != 0; len-- )
4767 =for apidoc vstringify
4769 In order to maintain maximum compatibility with earlier versions
4770 of Perl, this function will return either the floating point
4771 notation or the multiple dotted notation, depending on whether
4772 the original version contained 1 or more dots, respectively
4778 Perl_vstringify(pTHX_ SV *vs)
4780 PERL_ARGS_ASSERT_VSTRINGIFY;
4786 Perl_croak(aTHX_ "Invalid version object");
4788 if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) {
4790 pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE);
4794 return &PL_sv_undef;
4797 if ( hv_exists(MUTABLE_HV(vs), "qv", 2) )
4807 Version object aware cmp. Both operands must already have been
4808 converted into version objects.
4814 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4817 bool lalpha = FALSE;
4818 bool ralpha = FALSE;
4823 PERL_ARGS_ASSERT_VCMP;
4830 if ( !vverify(lhv) )
4831 Perl_croak(aTHX_ "Invalid version object");
4833 if ( !vverify(rhv) )
4834 Perl_croak(aTHX_ "Invalid version object");
4836 /* get the left hand term */
4837 lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE)));
4838 if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) )
4841 /* and the right hand term */
4842 rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE)));
4843 if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) )
4851 while ( i <= m && retval == 0 )
4853 left = SvIV(*av_fetch(lav,i,0));
4854 right = SvIV(*av_fetch(rav,i,0));
4862 /* tiebreaker for alpha with identical terms */
4863 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4865 if ( lalpha && !ralpha )
4869 else if ( ralpha && !lalpha)
4875 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4879 while ( i <= r && retval == 0 )
4881 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4882 retval = -1; /* not a match after all */
4888 while ( i <= l && retval == 0 )
4890 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4891 retval = +1; /* not a match after all */
4899 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4900 # define EMULATE_SOCKETPAIR_UDP
4903 #ifdef EMULATE_SOCKETPAIR_UDP
4905 S_socketpair_udp (int fd[2]) {
4907 /* Fake a datagram socketpair using UDP to localhost. */
4908 int sockets[2] = {-1, -1};
4909 struct sockaddr_in addresses[2];
4911 Sock_size_t size = sizeof(struct sockaddr_in);
4912 unsigned short port;
4915 memset(&addresses, 0, sizeof(addresses));
4918 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4919 if (sockets[i] == -1)
4920 goto tidy_up_and_fail;
4922 addresses[i].sin_family = AF_INET;
4923 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4924 addresses[i].sin_port = 0; /* kernel choses port. */
4925 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4926 sizeof(struct sockaddr_in)) == -1)
4927 goto tidy_up_and_fail;
4930 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4931 for each connect the other socket to it. */
4934 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4936 goto tidy_up_and_fail;
4937 if (size != sizeof(struct sockaddr_in))
4938 goto abort_tidy_up_and_fail;
4939 /* !1 is 0, !0 is 1 */
4940 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4941 sizeof(struct sockaddr_in)) == -1)
4942 goto tidy_up_and_fail;
4945 /* Now we have 2 sockets connected to each other. I don't trust some other
4946 process not to have already sent a packet to us (by random) so send
4947 a packet from each to the other. */
4950 /* I'm going to send my own port number. As a short.
4951 (Who knows if someone somewhere has sin_port as a bitfield and needs
4952 this routine. (I'm assuming crays have socketpair)) */
4953 port = addresses[i].sin_port;
4954 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4955 if (got != sizeof(port)) {
4957 goto tidy_up_and_fail;
4958 goto abort_tidy_up_and_fail;
4962 /* Packets sent. I don't trust them to have arrived though.
4963 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4964 connect to localhost will use a second kernel thread. In 2.6 the
4965 first thread running the connect() returns before the second completes,
4966 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4967 returns 0. Poor programs have tripped up. One poor program's authors'
4968 had a 50-1 reverse stock split. Not sure how connected these were.)
4969 So I don't trust someone not to have an unpredictable UDP stack.
4973 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4974 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4978 FD_SET((unsigned int)sockets[0], &rset);
4979 FD_SET((unsigned int)sockets[1], &rset);
4981 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4982 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4983 || !FD_ISSET(sockets[1], &rset)) {
4984 /* I hope this is portable and appropriate. */
4986 goto tidy_up_and_fail;
4987 goto abort_tidy_up_and_fail;
4991 /* And the paranoia department even now doesn't trust it to have arrive
4992 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4994 struct sockaddr_in readfrom;
4995 unsigned short buffer[2];
5000 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5001 sizeof(buffer), MSG_DONTWAIT,
5002 (struct sockaddr *) &readfrom, &size);
5004 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
5006 (struct sockaddr *) &readfrom, &size);
5010 goto tidy_up_and_fail;
5011 if (got != sizeof(port)
5012 || size != sizeof(struct sockaddr_in)
5013 /* Check other socket sent us its port. */
5014 || buffer[0] != (unsigned short) addresses[!i].sin_port
5015 /* Check kernel says we got the datagram from that socket */
5016 || readfrom.sin_family != addresses[!i].sin_family
5017 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
5018 || readfrom.sin_port != addresses[!i].sin_port)
5019 goto abort_tidy_up_and_fail;
5022 /* My caller (my_socketpair) has validated that this is non-NULL */
5025 /* I hereby declare this connection open. May God bless all who cross
5029 abort_tidy_up_and_fail:
5030 errno = ECONNABORTED;
5034 if (sockets[0] != -1)
5035 PerlLIO_close(sockets[0]);
5036 if (sockets[1] != -1)
5037 PerlLIO_close(sockets[1]);
5042 #endif /* EMULATE_SOCKETPAIR_UDP */
5044 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
5046 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5047 /* Stevens says that family must be AF_LOCAL, protocol 0.
5048 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
5053 struct sockaddr_in listen_addr;
5054 struct sockaddr_in connect_addr;
5059 || family != AF_UNIX
5062 errno = EAFNOSUPPORT;
5070 #ifdef EMULATE_SOCKETPAIR_UDP
5071 if (type == SOCK_DGRAM)
5072 return S_socketpair_udp(fd);
5075 listener = PerlSock_socket(AF_INET, type, 0);
5078 memset(&listen_addr, 0, sizeof(listen_addr));
5079 listen_addr.sin_family = AF_INET;
5080 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
5081 listen_addr.sin_port = 0; /* kernel choses port. */
5082 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
5083 sizeof(listen_addr)) == -1)
5084 goto tidy_up_and_fail;
5085 if (PerlSock_listen(listener, 1) == -1)
5086 goto tidy_up_and_fail;
5088 connector = PerlSock_socket(AF_INET, type, 0);
5089 if (connector == -1)
5090 goto tidy_up_and_fail;
5091 /* We want to find out the port number to connect to. */
5092 size = sizeof(connect_addr);
5093 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
5095 goto tidy_up_and_fail;
5096 if (size != sizeof(connect_addr))
5097 goto abort_tidy_up_and_fail;
5098 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
5099 sizeof(connect_addr)) == -1)
5100 goto tidy_up_and_fail;
5102 size = sizeof(listen_addr);
5103 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
5106 goto tidy_up_and_fail;
5107 if (size != sizeof(listen_addr))
5108 goto abort_tidy_up_and_fail;
5109 PerlLIO_close(listener);
5110 /* Now check we are talking to ourself by matching port and host on the
5112 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5114 goto tidy_up_and_fail;
5115 if (size != sizeof(connect_addr)
5116 || listen_addr.sin_family != connect_addr.sin_family
5117 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5118 || listen_addr.sin_port != connect_addr.sin_port) {
5119 goto abort_tidy_up_and_fail;
5125 abort_tidy_up_and_fail:
5127 errno = ECONNABORTED; /* This would be the standard thing to do. */
5129 # ifdef ECONNREFUSED
5130 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5132 errno = ETIMEDOUT; /* Desperation time. */
5139 PerlLIO_close(listener);
5140 if (connector != -1)
5141 PerlLIO_close(connector);
5143 PerlLIO_close(acceptor);
5149 /* In any case have a stub so that there's code corresponding
5150 * to the my_socketpair in global.sym. */
5152 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5153 #ifdef HAS_SOCKETPAIR
5154 return socketpair(family, type, protocol, fd);
5163 =for apidoc sv_nosharing
5165 Dummy routine which "shares" an SV when there is no sharing module present.
5166 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5167 Exists to avoid test for a NULL function pointer and because it could
5168 potentially warn under some level of strict-ness.
5174 Perl_sv_nosharing(pTHX_ SV *sv)
5176 PERL_UNUSED_CONTEXT;
5177 PERL_UNUSED_ARG(sv);
5182 =for apidoc sv_destroyable
5184 Dummy routine which reports that object can be destroyed when there is no
5185 sharing module present. It ignores its single SV argument, and returns
5186 'true'. Exists to avoid test for a NULL function pointer and because it
5187 could potentially warn under some level of strict-ness.
5193 Perl_sv_destroyable(pTHX_ SV *sv)
5195 PERL_UNUSED_CONTEXT;
5196 PERL_UNUSED_ARG(sv);
5201 Perl_parse_unicode_opts(pTHX_ const char **popt)
5203 const char *p = *popt;
5206 PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS;
5210 opt = (U32) atoi(p);
5213 if (*p && *p != '\n' && *p != '\r')
5214 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5219 case PERL_UNICODE_STDIN:
5220 opt |= PERL_UNICODE_STDIN_FLAG; break;
5221 case PERL_UNICODE_STDOUT:
5222 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5223 case PERL_UNICODE_STDERR:
5224 opt |= PERL_UNICODE_STDERR_FLAG; break;
5225 case PERL_UNICODE_STD:
5226 opt |= PERL_UNICODE_STD_FLAG; break;
5227 case PERL_UNICODE_IN:
5228 opt |= PERL_UNICODE_IN_FLAG; break;
5229 case PERL_UNICODE_OUT:
5230 opt |= PERL_UNICODE_OUT_FLAG; break;
5231 case PERL_UNICODE_INOUT:
5232 opt |= PERL_UNICODE_INOUT_FLAG; break;
5233 case PERL_UNICODE_LOCALE:
5234 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5235 case PERL_UNICODE_ARGV:
5236 opt |= PERL_UNICODE_ARGV_FLAG; break;
5237 case PERL_UNICODE_UTF8CACHEASSERT:
5238 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5240 if (*p != '\n' && *p != '\r')
5242 "Unknown Unicode option letter '%c'", *p);
5248 opt = PERL_UNICODE_DEFAULT_FLAGS;
5250 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5251 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5252 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5264 * This is really just a quick hack which grabs various garbage
5265 * values. It really should be a real hash algorithm which
5266 * spreads the effect of every input bit onto every output bit,
5267 * if someone who knows about such things would bother to write it.
5268 * Might be a good idea to add that function to CORE as well.
5269 * No numbers below come from careful analysis or anything here,
5270 * except they are primes and SEED_C1 > 1E6 to get a full-width
5271 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5272 * probably be bigger too.
5275 # define SEED_C1 1000003
5276 #define SEED_C4 73819
5278 # define SEED_C1 25747
5279 #define SEED_C4 20639
5283 #define SEED_C5 26107
5285 #ifndef PERL_NO_DEV_RANDOM
5290 # include <starlet.h>
5291 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5292 * in 100-ns units, typically incremented ever 10 ms. */
5293 unsigned int when[2];
5295 # ifdef HAS_GETTIMEOFDAY
5296 struct timeval when;
5302 /* This test is an escape hatch, this symbol isn't set by Configure. */
5303 #ifndef PERL_NO_DEV_RANDOM
5304 #ifndef PERL_RANDOM_DEVICE
5305 /* /dev/random isn't used by default because reads from it will block
5306 * if there isn't enough entropy available. You can compile with
5307 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5308 * is enough real entropy to fill the seed. */
5309 # define PERL_RANDOM_DEVICE "/dev/urandom"
5311 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5313 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5322 _ckvmssts(sys$gettim(when));
5323 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5325 # ifdef HAS_GETTIMEOFDAY
5326 PerlProc_gettimeofday(&when,NULL);
5327 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5330 u = (U32)SEED_C1 * when;
5333 u += SEED_C3 * (U32)PerlProc_getpid();
5334 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5335 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5336 u += SEED_C5 * (U32)PTR2UV(&when);
5342 Perl_get_hash_seed(pTHX)
5345 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5351 if (s && isDIGIT(*s))
5352 myseed = (UV)Atoul(s);
5354 #ifdef USE_HASH_SEED_EXPLICIT
5358 /* Compute a random seed */
5359 (void)seedDrand01((Rand_seed_t)seed());
5360 myseed = (UV)(Drand01() * (NV)UV_MAX);
5361 #if RANDBITS < (UVSIZE * 8)
5362 /* Since there are not enough randbits to to reach all
5363 * the bits of a UV, the low bits might need extra
5364 * help. Sum in another random number that will
5365 * fill in the low bits. */
5367 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5368 #endif /* RANDBITS < (UVSIZE * 8) */
5369 if (myseed == 0) { /* Superparanoia. */
5370 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5372 Perl_croak(aTHX_ "Your random numbers are not that random");
5375 PL_rehash_seed_set = TRUE;
5382 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5384 const char * const stashpv = CopSTASHPV(c);
5385 const char * const name = HvNAME_get(hv);
5386 PERL_UNUSED_CONTEXT;
5387 PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH;
5389 if (stashpv == name)
5391 if (stashpv && name)
5392 if (strEQ(stashpv, name))
5399 #ifdef PERL_GLOBAL_STRUCT
5401 #define PERL_GLOBAL_STRUCT_INIT
5402 #include "opcode.h" /* the ppaddr and check */
5405 Perl_init_global_struct(pTHX)
5407 struct perl_vars *plvarsp = NULL;
5408 # ifdef PERL_GLOBAL_STRUCT
5409 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5410 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5411 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5412 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5413 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5417 plvarsp = PL_VarsPtr;
5418 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5424 # define PERLVAR(var,type) /**/
5425 # define PERLVARA(var,n,type) /**/
5426 # define PERLVARI(var,type,init) plvarsp->var = init;
5427 # define PERLVARIC(var,type,init) plvarsp->var = init;
5428 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5429 # include "perlvars.h"
5435 # ifdef PERL_GLOBAL_STRUCT
5438 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5439 if (!plvarsp->Gppaddr)
5443 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5444 if (!plvarsp->Gcheck)
5446 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5447 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5449 # ifdef PERL_SET_VARS
5450 PERL_SET_VARS(plvarsp);
5452 # undef PERL_GLOBAL_STRUCT_INIT
5457 #endif /* PERL_GLOBAL_STRUCT */
5459 #ifdef PERL_GLOBAL_STRUCT
5462 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5464 PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT;
5465 # ifdef PERL_GLOBAL_STRUCT
5466 # ifdef PERL_UNSET_VARS
5467 PERL_UNSET_VARS(plvarsp);
5469 free(plvarsp->Gppaddr);
5470 free(plvarsp->Gcheck);
5471 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5477 #endif /* PERL_GLOBAL_STRUCT */
5481 /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the
5482 * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also
5483 * given, and you supply your own implementation.
5485 * The default implementation reads a single env var, PERL_MEM_LOG,
5486 * expecting one or more of the following:
5488 * \d+ - fd fd to write to : must be 1st (atoi)
5489 * 'm' - memlog was PERL_MEM_LOG=1
5490 * 's' - svlog was PERL_SV_LOG=1
5491 * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1
5493 * This makes the logger controllable enough that it can reasonably be
5494 * added to the system perl.
5497 /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer
5498 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5500 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5502 /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...()
5503 * writes to. In the default logger, this is settable at runtime.
5505 #ifndef PERL_MEM_LOG_FD
5506 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5509 #ifndef PERL_MEM_LOG_NOIMPL
5511 # ifdef DEBUG_LEAKING_SCALARS
5512 # define SV_LOG_SERIAL_FMT " [%lu]"
5513 # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial
5515 # define SV_LOG_SERIAL_FMT
5516 # define _SV_LOG_SERIAL_ARG(sv)
5520 S_mem_log_common(enum mem_log_type mlt, const UV n,
5521 const UV typesize, const char *type_name, const SV *sv,
5522 Malloc_t oldalloc, Malloc_t newalloc,
5523 const char *filename, const int linenumber,
5524 const char *funcname)
5528 PERL_ARGS_ASSERT_MEM_LOG_COMMON;
5530 pmlenv = PerlEnv_getenv("PERL_MEM_LOG");
5533 if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s'))
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];
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 = atoi(pmlenv);
5558 fd = PERL_MEM_LOG_FD;
5560 if (strchr(pmlenv, 't')) {
5561 len = my_snprintf(buf, sizeof(buf),
5562 MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG);
5563 PerlLIO_write(fd, buf, len);
5567 len = my_snprintf(buf, sizeof(buf),
5568 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5569 " %s = %"IVdf": %"UVxf"\n",
5570 filename, linenumber, funcname, n, typesize,
5571 type_name, n * typesize, PTR2UV(newalloc));
5574 len = my_snprintf(buf, sizeof(buf),
5575 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5576 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5577 filename, linenumber, funcname, n, typesize,
5578 type_name, n * typesize, PTR2UV(oldalloc),
5582 len = my_snprintf(buf, sizeof(buf),
5583 "free: %s:%d:%s: %"UVxf"\n",
5584 filename, linenumber, funcname,
5589 len = my_snprintf(buf, sizeof(buf),
5590 "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n",
5591 mlt == MLT_NEW_SV ? "new" : "del",
5592 filename, linenumber, funcname,
5593 PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv));
5598 PerlLIO_write(fd, buf, len);
5602 #endif /* !PERL_MEM_LOG_NOIMPL */
5604 #ifndef PERL_MEM_LOG_NOIMPL
5606 mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \
5607 mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm)
5609 /* this is suboptimal, but bug compatible. User is providing their
5610 own implemenation, but is getting these functions anyway, and they
5611 do nothing. But _NOIMPL users should be able to cope or fix */
5613 mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \
5614 /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */
5618 Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name,
5620 const char *filename, const int linenumber,
5621 const char *funcname)
5623 mem_log_common_if(MLT_ALLOC, n, typesize, type_name,
5624 NULL, NULL, newalloc,
5625 filename, linenumber, funcname);
5630 Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name,
5631 Malloc_t oldalloc, Malloc_t newalloc,
5632 const char *filename, const int linenumber,
5633 const char *funcname)
5635 mem_log_common_if(MLT_REALLOC, n, typesize, type_name,
5636 NULL, oldalloc, newalloc,
5637 filename, linenumber, funcname);
5642 Perl_mem_log_free(Malloc_t oldalloc,
5643 const char *filename, const int linenumber,
5644 const char *funcname)
5646 mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL,
5647 filename, linenumber, funcname);
5652 Perl_mem_log_new_sv(const SV *sv,
5653 const char *filename, const int linenumber,
5654 const char *funcname)
5656 mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL,
5657 filename, linenumber, funcname);
5661 Perl_mem_log_del_sv(const SV *sv,
5662 const char *filename, const int linenumber,
5663 const char *funcname)
5665 mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL,
5666 filename, linenumber, funcname);
5669 #endif /* PERL_MEM_LOG */
5672 =for apidoc my_sprintf
5674 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5675 the length of the string written to the buffer. Only rare pre-ANSI systems
5676 need the wrapper function - usually this is a direct call to C<sprintf>.
5680 #ifndef SPRINTF_RETURNS_STRLEN
5682 Perl_my_sprintf(char *buffer, const char* pat, ...)
5685 PERL_ARGS_ASSERT_MY_SPRINTF;
5686 va_start(args, pat);
5687 vsprintf(buffer, pat, args);
5689 return strlen(buffer);
5694 =for apidoc my_snprintf
5696 The C library C<snprintf> functionality, if available and
5697 standards-compliant (uses C<vsnprintf>, actually). However, if the
5698 C<vsnprintf> is not available, will unfortunately use the unsafe
5699 C<vsprintf> which can overrun the buffer (there is an overrun check,
5700 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5701 getting C<vsnprintf>.
5706 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5711 PERL_ARGS_ASSERT_MY_SNPRINTF;
5712 va_start(ap, format);
5713 #ifdef HAS_VSNPRINTF
5714 retval = vsnprintf(buffer, len, format, ap);
5716 retval = vsprintf(buffer, format, ap);
5719 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5720 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5721 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5726 =for apidoc my_vsnprintf
5728 The C library C<vsnprintf> if available and standards-compliant.
5729 However, if if the C<vsnprintf> is not available, will unfortunately
5730 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5731 overrun check, but that may be too late). Consider using
5732 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5737 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5744 PERL_ARGS_ASSERT_MY_VSNPRINTF;
5746 Perl_va_copy(ap, apc);
5747 # ifdef HAS_VSNPRINTF
5748 retval = vsnprintf(buffer, len, format, apc);
5750 retval = vsprintf(buffer, format, apc);
5753 # ifdef HAS_VSNPRINTF
5754 retval = vsnprintf(buffer, len, format, ap);
5756 retval = vsprintf(buffer, format, ap);
5758 #endif /* #ifdef NEED_VA_COPY */
5759 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5760 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5761 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5766 Perl_my_clearenv(pTHX)
5769 #if ! defined(PERL_MICRO)
5770 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5772 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5773 # if defined(USE_ENVIRON_ARRAY)
5774 # if defined(USE_ITHREADS)
5775 /* only the parent thread can clobber the process environment */
5776 if (PL_curinterp == aTHX)
5777 # endif /* USE_ITHREADS */
5779 # if ! defined(PERL_USE_SAFE_PUTENV)
5780 if ( !PL_use_safe_putenv) {
5782 if (environ == PL_origenviron)
5783 environ = (char**)safesysmalloc(sizeof(char*));
5785 for (i = 0; environ[i]; i++)
5786 (void)safesysfree(environ[i]);
5789 # else /* PERL_USE_SAFE_PUTENV */
5790 # if defined(HAS_CLEARENV)
5792 # elif defined(HAS_UNSETENV)
5793 int bsiz = 80; /* Most envvar names will be shorter than this. */
5794 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5795 char *buf = (char*)safesysmalloc(bufsiz);
5796 while (*environ != NULL) {
5797 char *e = strchr(*environ, '=');
5798 int l = e ? e - *environ : (int)strlen(*environ);
5800 (void)safesysfree(buf);
5801 bsiz = l + 1; /* + 1 for the \0. */
5802 buf = (char*)safesysmalloc(bufsiz);
5804 memcpy(buf, *environ, l);
5806 (void)unsetenv(buf);
5808 (void)safesysfree(buf);
5809 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5810 /* Just null environ and accept the leakage. */
5812 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5813 # endif /* ! PERL_USE_SAFE_PUTENV */
5815 # endif /* USE_ENVIRON_ARRAY */
5816 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5817 #endif /* PERL_MICRO */
5820 #ifdef PERL_IMPLICIT_CONTEXT
5822 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5823 the global PL_my_cxt_index is incremented, and that value is assigned to
5824 that module's static my_cxt_index (who's address is passed as an arg).
5825 Then, for each interpreter this function is called for, it makes sure a
5826 void* slot is available to hang the static data off, by allocating or
5827 extending the interpreter's PL_my_cxt_list array */
5829 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5831 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5835 PERL_ARGS_ASSERT_MY_CXT_INIT;
5837 /* this module hasn't been allocated an index yet */
5838 MUTEX_LOCK(&PL_my_ctx_mutex);
5839 *index = PL_my_cxt_index++;
5840 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5843 /* make sure the array is big enough */
5844 if (PL_my_cxt_size <= *index) {
5845 if (PL_my_cxt_size) {
5846 while (PL_my_cxt_size <= *index)
5847 PL_my_cxt_size *= 2;
5848 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5851 PL_my_cxt_size = 16;
5852 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5855 /* newSV() allocates one more than needed */
5856 p = (void*)SvPVX(newSV(size-1));
5857 PL_my_cxt_list[*index] = p;
5858 Zero(p, size, char);
5862 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5865 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5870 PERL_ARGS_ASSERT_MY_CXT_INDEX;
5872 for (index = 0; index < PL_my_cxt_index; index++) {
5873 const char *key = PL_my_cxt_keys[index];
5874 /* try direct pointer compare first - there are chances to success,
5875 * and it's much faster.
5877 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5884 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5890 PERL_ARGS_ASSERT_MY_CXT_INIT;
5892 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5894 /* this module hasn't been allocated an index yet */
5895 MUTEX_LOCK(&PL_my_ctx_mutex);
5896 index = PL_my_cxt_index++;
5897 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5900 /* make sure the array is big enough */
5901 if (PL_my_cxt_size <= index) {
5902 int old_size = PL_my_cxt_size;
5904 if (PL_my_cxt_size) {
5905 while (PL_my_cxt_size <= index)
5906 PL_my_cxt_size *= 2;
5907 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5908 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5911 PL_my_cxt_size = 16;
5912 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5913 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5915 for (i = old_size; i < PL_my_cxt_size; i++) {
5916 PL_my_cxt_keys[i] = 0;
5917 PL_my_cxt_list[i] = 0;
5920 PL_my_cxt_keys[index] = my_cxt_key;
5921 /* newSV() allocates one more than needed */
5922 p = (void*)SvPVX(newSV(size-1));
5923 PL_my_cxt_list[index] = p;
5924 Zero(p, size, char);
5927 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5928 #endif /* PERL_IMPLICIT_CONTEXT */
5932 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5934 Size_t used, length, copy;
5937 length = strlen(src);
5938 if (size > 0 && used < size - 1) {
5939 copy = (length >= size - used) ? size - used - 1 : length;
5940 memcpy(dst + used, src, copy);
5941 dst[used + copy] = '\0';
5943 return used + length;
5949 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5951 Size_t length, copy;
5953 length = strlen(src);
5955 copy = (length >= size) ? size - 1 : length;
5956 memcpy(dst, src, copy);
5963 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5964 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5965 long _ftol( double ); /* Defined by VC6 C libs. */
5966 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5970 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5973 SV * const dbsv = GvSVn(PL_DBsub);
5974 /* We do not care about using sv to call CV;
5975 * it's for informational purposes only.
5978 PERL_ARGS_ASSERT_GET_DB_SUB;
5981 if (!PERLDB_SUB_NN) {
5982 GV * const gv = CvGV(cv);
5984 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5985 || strEQ(GvNAME(gv), "END")
5986 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5987 !( (SvTYPE(*svp) == SVt_PVGV)
5988 && (GvCV((const GV *)*svp) == cv) )))) {
5989 /* Use GV from the stack as a fallback. */
5990 /* GV is potentially non-unique, or contain different CV. */
5991 SV * const tmp = newRV(MUTABLE_SV(cv));
5992 sv_setsv(dbsv, tmp);
5996 gv_efullname3(dbsv, gv, NULL);
6000 const int type = SvTYPE(dbsv);
6001 if (type < SVt_PVIV && type != SVt_IV)
6002 sv_upgrade(dbsv, SVt_PVIV);
6003 (void)SvIOK_on(dbsv);
6004 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
6009 Perl_my_dirfd(pTHX_ DIR * dir) {
6011 /* Most dirfd implementations have problems when passed NULL. */
6016 #elif defined(HAS_DIR_DD_FD)
6019 Perl_die(aTHX_ PL_no_func, "dirfd");
6026 Perl_get_re_arg(pTHX_ SV *sv) {
6033 (tmpsv = MUTABLE_SV(SvRV(sv))) && /* assign deliberate */
6034 SvTYPE(tmpsv) == SVt_REGEXP)
6036 return (REGEXP*) tmpsv;
6045 * c-indentation-style: bsd
6047 * indent-tabs-mode: t
6050 * ex: set ts=8 sts=4 sw=4 noet: