3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 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
16 /* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
23 #define PERL_IN_UTIL_C
29 # define SIG_ERR ((Sighandler_t) -1)
34 /* Missing protos on LynxOS */
39 # include <sys/wait.h>
44 # include <sys/select.h>
50 #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51 # define FD_CLOEXEC 1 /* NeXT needs this */
54 /* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
64 /* Can't use PerlIO to write as it allocates memory */
65 PerlLIO_write(PerlIO_fileno(Perl_error_log),
66 PL_no_mem, strlen(PL_no_mem));
68 NORETURN_FUNCTION_END;
71 /* paranoid version of system's malloc() */
74 Perl_safesysmalloc(MEM_SIZE size)
80 PerlIO_printf(Perl_error_log,
81 "Allocation too large: %lx\n", size) FLUSH;
84 #endif /* HAS_64K_LIMIT */
85 #ifdef PERL_TRACK_MEMPOOL
90 Perl_croak_nocontext("panic: malloc");
92 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
93 PERL_ALLOC_CHECK(ptr);
94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
96 #ifdef PERL_TRACK_MEMPOOL
97 struct perl_memory_debug_header *const header
98 = (struct perl_memory_debug_header *)ptr;
102 PoisonNew(((char *)ptr), size, char);
105 #ifdef PERL_TRACK_MEMPOOL
106 header->interpreter = aTHX;
107 /* Link us into the list. */
108 header->prev = &PL_memory_debug_header;
109 header->next = PL_memory_debug_header.next;
110 PL_memory_debug_header.next = header;
111 header->next->prev = header;
115 ptr = (Malloc_t)((char*)ptr+sTHX);
122 return write_no_mem();
127 /* paranoid version of system's realloc() */
130 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
134 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
135 Malloc_t PerlMem_realloc();
136 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
140 PerlIO_printf(Perl_error_log,
141 "Reallocation too large: %lx\n", size) FLUSH;
144 #endif /* HAS_64K_LIMIT */
151 return safesysmalloc(size);
152 #ifdef PERL_TRACK_MEMPOOL
153 where = (Malloc_t)((char*)where-sTHX);
156 struct perl_memory_debug_header *const header
157 = (struct perl_memory_debug_header *)where;
159 if (header->interpreter != aTHX) {
160 Perl_croak_nocontext("panic: realloc from wrong pool");
162 assert(header->next->prev == header);
163 assert(header->prev->next == header);
165 if (header->size > size) {
166 const MEM_SIZE freed_up = header->size - size;
167 char *start_of_freed = ((char *)where) + size;
168 PoisonFree(start_of_freed, freed_up, char);
176 Perl_croak_nocontext("panic: realloc");
178 ptr = (Malloc_t)PerlMem_realloc(where,size);
179 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
182 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
185 #ifdef PERL_TRACK_MEMPOOL
186 struct perl_memory_debug_header *const header
187 = (struct perl_memory_debug_header *)ptr;
190 if (header->size < size) {
191 const MEM_SIZE fresh = size - header->size;
192 char *start_of_fresh = ((char *)ptr) + size;
193 PoisonNew(start_of_fresh, fresh, char);
197 header->next->prev = header;
198 header->prev->next = header;
200 ptr = (Malloc_t)((char*)ptr+sTHX);
207 return write_no_mem();
212 /* safe version of system's free() */
215 Perl_safesysfree(Malloc_t where)
217 #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
222 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
224 #ifdef PERL_TRACK_MEMPOOL
225 where = (Malloc_t)((char*)where-sTHX);
227 struct perl_memory_debug_header *const header
228 = (struct perl_memory_debug_header *)where;
230 if (header->interpreter != aTHX) {
231 Perl_croak_nocontext("panic: free from wrong pool");
234 Perl_croak_nocontext("panic: duplicate free");
236 if (!(header->next) || header->next->prev != header
237 || header->prev->next != header) {
238 Perl_croak_nocontext("panic: bad free");
240 /* Unlink us from the chain. */
241 header->next->prev = header->prev;
242 header->prev->next = header->next;
244 PoisonNew(where, header->size, char);
246 /* Trigger the duplicate free warning. */
254 /* safe version of system's calloc() */
257 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
261 MEM_SIZE total_size = 0;
263 /* Even though calloc() for zero bytes is strange, be robust. */
264 if (size && (count <= MEM_SIZE_MAX / size))
265 total_size = size * count;
267 Perl_croak_nocontext(PL_memory_wrap);
268 #ifdef PERL_TRACK_MEMPOOL
269 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
272 Perl_croak_nocontext(PL_memory_wrap);
275 if (total_size > 0xffff) {
276 PerlIO_printf(Perl_error_log,
277 "Allocation too large: %lx\n", total_size) FLUSH;
280 #endif /* HAS_64K_LIMIT */
282 if ((long)size < 0 || (long)count < 0)
283 Perl_croak_nocontext("panic: calloc");
285 #ifdef PERL_TRACK_MEMPOOL
286 /* Have to use malloc() because we've added some space for our tracking
288 /* malloc(0) is non-portable. */
289 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
291 /* Use calloc() because it might save a memset() if the memory is fresh
292 and clean from the OS. */
294 ptr = (Malloc_t)PerlMem_calloc(count, size);
295 else /* calloc(0) is non-portable. */
296 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
298 PERL_ALLOC_CHECK(ptr);
299 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));
301 #ifdef PERL_TRACK_MEMPOOL
303 struct perl_memory_debug_header *const header
304 = (struct perl_memory_debug_header *)ptr;
306 memset((void*)ptr, 0, total_size);
307 header->interpreter = aTHX;
308 /* Link us into the list. */
309 header->prev = &PL_memory_debug_header;
310 header->next = PL_memory_debug_header.next;
311 PL_memory_debug_header.next = header;
312 header->next->prev = header;
314 header->size = total_size;
316 ptr = (Malloc_t)((char*)ptr+sTHX);
323 return write_no_mem();
326 /* These must be defined when not using Perl's malloc for binary
331 Malloc_t Perl_malloc (MEM_SIZE nbytes)
334 return (Malloc_t)PerlMem_malloc(nbytes);
337 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
340 return (Malloc_t)PerlMem_calloc(elements, size);
343 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
346 return (Malloc_t)PerlMem_realloc(where, nbytes);
349 Free_t Perl_mfree (Malloc_t where)
357 /* copy a string up to some (non-backslashed) delimiter, if any */
360 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
365 for (tolen = 0; from < fromend; from++, tolen++) {
367 if (from[1] != delim) {
374 else if (*from == delim)
385 /* return ptr to little string in big string, NULL if not found */
386 /* This routine was donated by Corey Satten. */
389 Perl_instr(pTHX_ register const char *big, register const char *little)
400 register const char *s, *x;
403 for (x=big,s=little; *s; /**/ ) {
414 return (char*)(big-1);
419 /* same as instr but allow embedded nulls */
422 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
428 char first = *little++;
430 bigend -= lend - little;
432 while (big <= bigend) {
433 if (*big++ == first) {
434 for (x=big,s=little; s < lend; x++,s++) {
438 return (char*)(big-1);
445 /* reverse of the above--find last substring */
448 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
450 register const char *bigbeg;
451 register const I32 first = *little;
452 register const char * const littleend = lend;
455 if (little >= littleend)
456 return (char*)bigend;
458 big = bigend - (littleend - little++);
459 while (big >= bigbeg) {
460 register const char *s, *x;
463 for (x=big+2,s=little; s < littleend; /**/ ) {
472 return (char*)(big+1);
477 /* As a space optimization, we do not compile tables for strings of length
478 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
479 special-cased in fbm_instr().
481 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
484 =head1 Miscellaneous Functions
486 =for apidoc fbm_compile
488 Analyses the string in order to make fast searches on it using fbm_instr()
489 -- the Boyer-Moore algorithm.
495 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
498 register const U8 *s;
504 if (flags & FBMcf_TAIL) {
505 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
506 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
507 if (mg && mg->mg_len >= 0)
510 s = (U8*)SvPV_force_mutable(sv, len);
511 if (len == 0) /* TAIL might be on a zero-length string. */
513 SvUPGRADE(sv, SVt_PVGV);
518 const unsigned char *sb;
519 const U8 mlen = (len>255) ? 255 : (U8)len;
522 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
524 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
525 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
526 memset((void*)table, mlen, 256);
528 sb = s - mlen + 1; /* first char (maybe) */
530 if (table[*s] == mlen)
535 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
537 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
539 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
540 for (i = 0; i < len; i++) {
541 if (PL_freq[s[i]] < frequency) {
543 frequency = PL_freq[s[i]];
546 BmFLAGS(sv) = (U8)flags;
547 BmRARE(sv) = s[rarest];
548 BmPREVIOUS(sv) = rarest;
549 BmUSEFUL(sv) = 100; /* Initial value */
550 if (flags & FBMcf_TAIL)
552 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
553 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
556 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
557 /* If SvTAIL is actually due to \Z or \z, this gives false positives
561 =for apidoc fbm_instr
563 Returns the location of the SV in the string delimited by C<str> and
564 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
565 does not have to be fbm_compiled, but the search will not be as fast
572 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
574 register unsigned char *s;
576 register const unsigned char *little
577 = (const unsigned char *)SvPV_const(littlestr,l);
578 register STRLEN littlelen = l;
579 register const I32 multiline = flags & FBMrf_MULTILINE;
581 if ((STRLEN)(bigend - big) < littlelen) {
582 if ( SvTAIL(littlestr)
583 && ((STRLEN)(bigend - big) == littlelen - 1)
585 || (*big == *little &&
586 memEQ((char *)big, (char *)little, littlelen - 1))))
591 if (littlelen <= 2) { /* Special-cased */
593 if (littlelen == 1) {
594 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
595 /* Know that bigend != big. */
596 if (bigend[-1] == '\n')
597 return (char *)(bigend - 1);
598 return (char *) bigend;
606 if (SvTAIL(littlestr))
607 return (char *) bigend;
611 return (char*)big; /* Cannot be SvTAIL! */
614 if (SvTAIL(littlestr) && !multiline) {
615 if (bigend[-1] == '\n' && bigend[-2] == *little)
616 return (char*)bigend - 2;
617 if (bigend[-1] == *little)
618 return (char*)bigend - 1;
622 /* This should be better than FBM if c1 == c2, and almost
623 as good otherwise: maybe better since we do less indirection.
624 And we save a lot of memory by caching no table. */
625 const unsigned char c1 = little[0];
626 const unsigned char c2 = little[1];
631 while (s <= bigend) {
641 goto check_1char_anchor;
652 goto check_1char_anchor;
655 while (s <= bigend) {
660 goto check_1char_anchor;
669 check_1char_anchor: /* One char and anchor! */
670 if (SvTAIL(littlestr) && (*bigend == *little))
671 return (char *)bigend; /* bigend is already decremented. */
674 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
675 s = bigend - littlelen;
676 if (s >= big && bigend[-1] == '\n' && *s == *little
677 /* Automatically of length > 2 */
678 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
680 return (char*)s; /* how sweet it is */
683 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
685 return (char*)s + 1; /* how sweet it is */
689 if (!SvVALID(littlestr)) {
690 char * const b = ninstr((char*)big,(char*)bigend,
691 (char*)little, (char*)little + littlelen);
693 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
694 /* Chop \n from littlestr: */
695 s = bigend - littlelen + 1;
697 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
707 if (littlelen > (STRLEN)(bigend - big))
711 register const unsigned char * const table
712 = little + littlelen + PERL_FBM_TABLE_OFFSET;
713 register const unsigned char *oldlittle;
715 --littlelen; /* Last char found by table lookup */
718 little += littlelen; /* last char */
724 if ((tmp = table[*s])) {
725 if ((s += tmp) < bigend)
729 else { /* less expensive than calling strncmp() */
730 register unsigned char * const olds = s;
735 if (*--s == *--little)
737 s = olds + 1; /* here we pay the price for failure */
739 if (s < bigend) /* fake up continue to outer loop */
748 && (BmFLAGS(littlestr) & FBMcf_TAIL)
749 && memEQ((char *)(bigend - littlelen),
750 (char *)(oldlittle - littlelen), littlelen) )
751 return (char*)bigend - littlelen;
756 /* start_shift, end_shift are positive quantities which give offsets
757 of ends of some substring of bigstr.
758 If "last" we want the last occurrence.
759 old_posp is the way of communication between consequent calls if
760 the next call needs to find the .
761 The initial *old_posp should be -1.
763 Note that we take into account SvTAIL, so one can get extra
764 optimizations if _ALL flag is set.
767 /* If SvTAIL is actually due to \Z or \z, this gives false positives
768 if PL_multiline. In fact if !PL_multiline the authoritative answer
769 is not supported yet. */
772 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
775 register const unsigned char *big;
777 register I32 previous;
779 register const unsigned char *little;
780 register I32 stop_pos;
781 register const unsigned char *littleend;
784 assert(SvTYPE(littlestr) == SVt_PVGV);
785 assert(SvVALID(littlestr));
788 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
789 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
791 if ( BmRARE(littlestr) == '\n'
792 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
793 little = (const unsigned char *)(SvPVX_const(littlestr));
794 littleend = little + SvCUR(littlestr);
801 little = (const unsigned char *)(SvPVX_const(littlestr));
802 littleend = little + SvCUR(littlestr);
804 /* The value of pos we can start at: */
805 previous = BmPREVIOUS(littlestr);
806 big = (const unsigned char *)(SvPVX_const(bigstr));
807 /* The value of pos we can stop at: */
808 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
809 if (previous + start_shift > stop_pos) {
811 stop_pos does not include SvTAIL in the count, so this check is incorrect
812 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
815 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
820 while (pos < previous + start_shift) {
821 if (!(pos += PL_screamnext[pos]))
826 register const unsigned char *s, *x;
827 if (pos >= stop_pos) break;
828 if (big[pos] != first)
830 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
836 if (s == littleend) {
838 if (!last) return (char *)(big+pos);
841 } while ( pos += PL_screamnext[pos] );
843 return (char *)(big+(*old_posp));
845 if (!SvTAIL(littlestr) || (end_shift > 0))
847 /* Ignore the trailing "\n". This code is not microoptimized */
848 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
849 stop_pos = littleend - little; /* Actual littlestr len */
854 && ((stop_pos == 1) ||
855 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
861 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
863 register const U8 *a = (const U8 *)s1;
864 register const U8 *b = (const U8 *)s2;
868 if (*a != *b && *a != PL_fold[*b])
876 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
879 register const U8 *a = (const U8 *)s1;
880 register const U8 *b = (const U8 *)s2;
884 if (*a != *b && *a != PL_fold_locale[*b])
891 /* copy a string to a safe spot */
894 =head1 Memory Management
898 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
899 string which is a duplicate of C<pv>. The size of the string is
900 determined by C<strlen()>. The memory allocated for the new string can
901 be freed with the C<Safefree()> function.
907 Perl_savepv(pTHX_ const char *pv)
914 const STRLEN pvlen = strlen(pv)+1;
915 Newx(newaddr, pvlen, char);
916 return (char*)memcpy(newaddr, pv, pvlen);
920 /* same thing but with a known length */
925 Perl's version of what C<strndup()> would be if it existed. Returns a
926 pointer to a newly allocated string which is a duplicate of the first
927 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
928 the new string can be freed with the C<Safefree()> function.
934 Perl_savepvn(pTHX_ const char *pv, register I32 len)
936 register char *newaddr;
939 Newx(newaddr,len+1,char);
940 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
942 /* might not be null terminated */
944 return (char *) CopyD(pv,newaddr,len,char);
947 return (char *) ZeroD(newaddr,len+1,char);
952 =for apidoc savesharedpv
954 A version of C<savepv()> which allocates the duplicate string in memory
955 which is shared between threads.
960 Perl_savesharedpv(pTHX_ const char *pv)
962 register char *newaddr;
967 pvlen = strlen(pv)+1;
968 newaddr = (char*)PerlMemShared_malloc(pvlen);
970 return write_no_mem();
972 return (char*)memcpy(newaddr, pv, pvlen);
976 =for apidoc savesharedpvn
978 A version of C<savepvn()> which allocates the duplicate string in memory
979 which is shared between threads. (With the specific difference that a NULL
980 pointer is not acceptable)
985 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
987 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
990 return write_no_mem();
993 return (char*)memcpy(newaddr, pv, len);
999 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
1000 the passed in SV using C<SvPV()>
1006 Perl_savesvpv(pTHX_ SV *sv)
1009 const char * const pv = SvPV_const(sv, len);
1010 register char *newaddr;
1013 Newx(newaddr,len,char);
1014 return (char *) CopyD(pv,newaddr,len,char);
1018 /* the SV for Perl_form() and mess() is not kept in an arena */
1028 return sv_2mortal(newSVpvs(""));
1033 /* Create as PVMG now, to avoid any upgrading later */
1035 Newxz(any, 1, XPVMG);
1036 SvFLAGS(sv) = SVt_PVMG;
1037 SvANY(sv) = (void*)any;
1039 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1044 #if defined(PERL_IMPLICIT_CONTEXT)
1046 Perl_form_nocontext(const char* pat, ...)
1051 va_start(args, pat);
1052 retval = vform(pat, &args);
1056 #endif /* PERL_IMPLICIT_CONTEXT */
1059 =head1 Miscellaneous Functions
1062 Takes a sprintf-style format pattern and conventional
1063 (non-SV) arguments and returns the formatted string.
1065 (char *) Perl_form(pTHX_ const char* pat, ...)
1067 can be used any place a string (char *) is required:
1069 char * s = Perl_form("%d.%d",major,minor);
1071 Uses a single private buffer so if you want to format several strings you
1072 must explicitly copy the earlier strings away (and free the copies when you
1079 Perl_form(pTHX_ const char* pat, ...)
1083 va_start(args, pat);
1084 retval = vform(pat, &args);
1090 Perl_vform(pTHX_ const char *pat, va_list *args)
1092 SV * const sv = mess_alloc();
1093 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1097 #if defined(PERL_IMPLICIT_CONTEXT)
1099 Perl_mess_nocontext(const char *pat, ...)
1104 va_start(args, pat);
1105 retval = vmess(pat, &args);
1109 #endif /* PERL_IMPLICIT_CONTEXT */
1112 Perl_mess(pTHX_ const char *pat, ...)
1116 va_start(args, pat);
1117 retval = vmess(pat, &args);
1123 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1126 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1128 if (!o || o == PL_op)
1131 if (o->op_flags & OPf_KIDS) {
1133 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1136 /* If the OP_NEXTSTATE has been optimised away we can still use it
1137 * the get the file and line number. */
1139 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1140 cop = (const COP *)kid;
1142 /* Keep searching, and return when we've found something. */
1144 new_cop = closest_cop(cop, kid);
1150 /* Nothing found. */
1156 Perl_vmess(pTHX_ const char *pat, va_list *args)
1159 SV * const sv = mess_alloc();
1161 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1162 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1164 * Try and find the file and line for PL_op. This will usually be
1165 * PL_curcop, but it might be a cop that has been optimised away. We
1166 * can try to find such a cop by searching through the optree starting
1167 * from the sibling of PL_curcop.
1170 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1175 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1176 OutCopFILE(cop), (IV)CopLINE(cop));
1177 /* Seems that GvIO() can be untrustworthy during global destruction. */
1178 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1179 && IoLINES(GvIOp(PL_last_in_gv)))
1181 const bool line_mode = (RsSIMPLE(PL_rs) &&
1182 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1183 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1184 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1185 line_mode ? "line" : "chunk",
1186 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1189 sv_catpvs(sv, " during global destruction");
1190 sv_catpvs(sv, ".\n");
1196 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1202 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1203 && (io = GvIO(PL_stderrgv))
1204 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1211 SAVESPTR(PL_stderrgv);
1214 PUSHSTACKi(PERLSI_MAGIC);
1218 PUSHs(SvTIED_obj((SV*)io, mg));
1219 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1221 call_method("PRINT", G_SCALAR);
1229 /* SFIO can really mess with your errno */
1230 const int e = errno;
1232 PerlIO * const serr = Perl_error_log;
1234 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1235 (void)PerlIO_flush(serr);
1242 /* Common code used by vcroak, vdie, vwarn and vwarner */
1245 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1251 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1252 /* sv_2cv might call Perl_croak() or Perl_warner() */
1253 SV * const oldhook = *hook;
1260 cv = sv_2cv(oldhook, &stash, &gv, 0);
1262 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1272 if (warn || message) {
1273 msg = newSVpvn(message, msglen);
1274 SvFLAGS(msg) |= utf8;
1282 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1286 call_sv((SV*)cv, G_DISCARD);
1295 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1299 const char *message;
1302 SV * const msv = vmess(pat, args);
1303 if (PL_errors && SvCUR(PL_errors)) {
1304 sv_catsv(PL_errors, msv);
1305 message = SvPV_const(PL_errors, *msglen);
1306 SvCUR_set(PL_errors, 0);
1309 message = SvPV_const(msv,*msglen);
1310 *utf8 = SvUTF8(msv);
1316 DEBUG_S(PerlIO_printf(Perl_debug_log,
1317 "%p: die/croak: message = %s\ndiehook = %p\n",
1318 (void*)thr, message, (void*)PL_diehook));
1320 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1326 Perl_vdie(pTHX_ const char* pat, va_list *args)
1329 const char *message;
1330 const int was_in_eval = PL_in_eval;
1334 DEBUG_S(PerlIO_printf(Perl_debug_log,
1335 "%p: die: curstack = %p, mainstack = %p\n",
1336 (void*)thr, (void*)PL_curstack, (void*)PL_mainstack));
1338 message = vdie_croak_common(pat, args, &msglen, &utf8);
1340 PL_restartop = die_where(message, msglen);
1341 SvFLAGS(ERRSV) |= utf8;
1342 DEBUG_S(PerlIO_printf(Perl_debug_log,
1343 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1344 (void*)thr, (void*)PL_restartop, was_in_eval, (void*)PL_top_env));
1345 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1347 return PL_restartop;
1350 #if defined(PERL_IMPLICIT_CONTEXT)
1352 Perl_die_nocontext(const char* pat, ...)
1357 va_start(args, pat);
1358 o = vdie(pat, &args);
1362 #endif /* PERL_IMPLICIT_CONTEXT */
1365 Perl_die(pTHX_ const char* pat, ...)
1369 va_start(args, pat);
1370 o = vdie(pat, &args);
1376 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1379 const char *message;
1383 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1386 PL_restartop = die_where(message, msglen);
1387 SvFLAGS(ERRSV) |= utf8;
1391 message = SvPVx_const(ERRSV, msglen);
1393 write_to_stderr(message, msglen);
1397 #if defined(PERL_IMPLICIT_CONTEXT)
1399 Perl_croak_nocontext(const char *pat, ...)
1403 va_start(args, pat);
1408 #endif /* PERL_IMPLICIT_CONTEXT */
1411 =head1 Warning and Dieing
1415 This is the XSUB-writer's interface to Perl's C<die> function.
1416 Normally call this function the same way you call the C C<printf>
1417 function. Calling C<croak> returns control directly to Perl,
1418 sidestepping the normal C order of execution. See C<warn>.
1420 If you want to throw an exception object, assign the object to
1421 C<$@> and then pass C<NULL> to croak():
1423 errsv = get_sv("@", TRUE);
1424 sv_setsv(errsv, exception_object);
1431 Perl_croak(pTHX_ const char *pat, ...)
1434 va_start(args, pat);
1441 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1445 SV * const msv = vmess(pat, args);
1446 const I32 utf8 = SvUTF8(msv);
1447 const char * const message = SvPV_const(msv, msglen);
1450 if (vdie_common(message, msglen, utf8, TRUE))
1454 write_to_stderr(message, msglen);
1457 #if defined(PERL_IMPLICIT_CONTEXT)
1459 Perl_warn_nocontext(const char *pat, ...)
1463 va_start(args, pat);
1467 #endif /* PERL_IMPLICIT_CONTEXT */
1472 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1473 function the same way you call the C C<printf> function. See C<croak>.
1479 Perl_warn(pTHX_ const char *pat, ...)
1482 va_start(args, pat);
1487 #if defined(PERL_IMPLICIT_CONTEXT)
1489 Perl_warner_nocontext(U32 err, const char *pat, ...)
1493 va_start(args, pat);
1494 vwarner(err, pat, &args);
1497 #endif /* PERL_IMPLICIT_CONTEXT */
1500 Perl_warner(pTHX_ U32 err, const char* pat,...)
1503 va_start(args, pat);
1504 vwarner(err, pat, &args);
1509 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1512 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1513 SV * const msv = vmess(pat, args);
1515 const char * const message = SvPV_const(msv, msglen);
1516 const I32 utf8 = SvUTF8(msv);
1520 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1523 PL_restartop = die_where(message, msglen);
1524 SvFLAGS(ERRSV) |= utf8;
1527 write_to_stderr(message, msglen);
1531 Perl_vwarn(aTHX_ pat, args);
1535 /* implements the ckWARN? macros */
1538 Perl_ckwarn(pTHX_ U32 w)
1544 && PL_curcop->cop_warnings != pWARN_NONE
1546 PL_curcop->cop_warnings == pWARN_ALL
1547 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1548 || (unpackWARN2(w) &&
1549 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1550 || (unpackWARN3(w) &&
1551 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1552 || (unpackWARN4(w) &&
1553 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1558 isLEXWARN_off && PL_dowarn & G_WARN_ON
1563 /* implements the ckWARN?_d macro */
1566 Perl_ckwarn_d(pTHX_ U32 w)
1571 || PL_curcop->cop_warnings == pWARN_ALL
1573 PL_curcop->cop_warnings != pWARN_NONE
1575 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1576 || (unpackWARN2(w) &&
1577 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1578 || (unpackWARN3(w) &&
1579 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1580 || (unpackWARN4(w) &&
1581 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1587 /* Set buffer=NULL to get a new one. */
1589 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1591 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1592 PERL_UNUSED_CONTEXT;
1595 (specialWARN(buffer) ?
1596 PerlMemShared_malloc(len_wanted) :
1597 PerlMemShared_realloc(buffer, len_wanted));
1599 Copy(bits, (buffer + 1), size, char);
1603 /* since we've already done strlen() for both nam and val
1604 * we can use that info to make things faster than
1605 * sprintf(s, "%s=%s", nam, val)
1607 #define my_setenv_format(s, nam, nlen, val, vlen) \
1608 Copy(nam, s, nlen, char); \
1610 Copy(val, s+(nlen+1), vlen, char); \
1611 *(s+(nlen+1+vlen)) = '\0'
1613 #ifdef USE_ENVIRON_ARRAY
1614 /* VMS' my_setenv() is in vms.c */
1615 #if !defined(WIN32) && !defined(NETWARE)
1617 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1621 /* only parent thread can modify process environment */
1622 if (PL_curinterp == aTHX)
1625 #ifndef PERL_USE_SAFE_PUTENV
1626 if (!PL_use_safe_putenv) {
1627 /* most putenv()s leak, so we manipulate environ directly */
1628 register I32 i=setenv_getix(nam); /* where does it go? */
1631 if (environ == PL_origenviron) { /* need we copy environment? */
1637 while (environ[max])
1639 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1640 for (j=0; j<max; j++) { /* copy environment */
1641 const int len = strlen(environ[j]);
1642 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1643 Copy(environ[j], tmpenv[j], len+1, char);
1646 environ = tmpenv; /* tell exec where it is now */
1649 safesysfree(environ[i]);
1650 while (environ[i]) {
1651 environ[i] = environ[i+1];
1656 if (!environ[i]) { /* does not exist yet */
1657 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1658 environ[i+1] = NULL; /* make sure it's null terminated */
1661 safesysfree(environ[i]);
1665 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1666 /* all that work just for this */
1667 my_setenv_format(environ[i], nam, nlen, val, vlen);
1670 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1671 # if defined(HAS_UNSETENV)
1673 (void)unsetenv(nam);
1675 (void)setenv(nam, val, 1);
1677 # else /* ! HAS_UNSETENV */
1678 (void)setenv(nam, val, 1);
1679 # endif /* HAS_UNSETENV */
1681 # if defined(HAS_UNSETENV)
1683 (void)unsetenv(nam);
1685 const int nlen = strlen(nam);
1686 const int vlen = strlen(val);
1687 char * const new_env =
1688 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1689 my_setenv_format(new_env, nam, nlen, val, vlen);
1690 (void)putenv(new_env);
1692 # else /* ! HAS_UNSETENV */
1694 const int nlen = strlen(nam);
1700 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1701 /* all that work just for this */
1702 my_setenv_format(new_env, nam, nlen, val, vlen);
1703 (void)putenv(new_env);
1704 # endif /* HAS_UNSETENV */
1705 # endif /* __CYGWIN__ */
1706 #ifndef PERL_USE_SAFE_PUTENV
1712 #else /* WIN32 || NETWARE */
1715 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1718 register char *envstr;
1719 const int nlen = strlen(nam);
1726 Newx(envstr, nlen+vlen+2, char);
1727 my_setenv_format(envstr, nam, nlen, val, vlen);
1728 (void)PerlEnv_putenv(envstr);
1732 #endif /* WIN32 || NETWARE */
1736 Perl_setenv_getix(pTHX_ const char *nam)
1739 register const I32 len = strlen(nam);
1740 PERL_UNUSED_CONTEXT;
1742 for (i = 0; environ[i]; i++) {
1745 strnicmp(environ[i],nam,len) == 0
1747 strnEQ(environ[i],nam,len)
1749 && environ[i][len] == '=')
1750 break; /* strnEQ must come first to avoid */
1751 } /* potential SEGV's */
1754 #endif /* !PERL_MICRO */
1756 #endif /* !VMS && !EPOC*/
1758 #ifdef UNLINK_ALL_VERSIONS
1760 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1764 while (PerlLIO_unlink(f) >= 0)
1766 return retries ? 0 : -1;
1770 /* this is a drop-in replacement for bcopy() */
1771 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1773 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1775 char * const retval = to;
1777 if (from - to >= 0) {
1785 *(--to) = *(--from);
1791 /* this is a drop-in replacement for memset() */
1794 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1796 char * const retval = loc;
1804 /* this is a drop-in replacement for bzero() */
1805 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1807 Perl_my_bzero(register char *loc, register I32 len)
1809 char * const retval = loc;
1817 /* this is a drop-in replacement for memcmp() */
1818 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1820 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1822 register const U8 *a = (const U8 *)s1;
1823 register const U8 *b = (const U8 *)s2;
1827 if ((tmp = *a++ - *b++))
1832 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1835 /* This vsprintf replacement should generally never get used, since
1836 vsprintf was available in both System V and BSD 2.11. (There may
1837 be some cross-compilation or embedded set-ups where it is needed,
1840 If you encounter a problem in this function, it's probably a symptom
1841 that Configure failed to detect your system's vprintf() function.
1842 See the section on "item vsprintf" in the INSTALL file.
1844 This version may compile on systems with BSD-ish <stdio.h>,
1845 but probably won't on others.
1848 #ifdef USE_CHAR_VSPRINTF
1853 vsprintf(char *dest, const char *pat, void *args)
1857 #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1858 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1859 FILE_cnt(&fakebuf) = 32767;
1861 /* These probably won't compile -- If you really need
1862 this, you'll have to figure out some other method. */
1863 fakebuf._ptr = dest;
1864 fakebuf._cnt = 32767;
1869 fakebuf._flag = _IOWRT|_IOSTRG;
1870 _doprnt(pat, args, &fakebuf); /* what a kludge */
1871 #if defined(STDIO_PTR_LVALUE)
1872 *(FILE_ptr(&fakebuf)++) = '\0';
1874 /* PerlIO has probably #defined away fputc, but we want it here. */
1876 # undef fputc /* XXX Should really restore it later */
1878 (void)fputc('\0', &fakebuf);
1880 #ifdef USE_CHAR_VSPRINTF
1883 return 0; /* perl doesn't use return value */
1887 #endif /* HAS_VPRINTF */
1890 #if BYTEORDER != 0x4321
1892 Perl_my_swap(pTHX_ short s)
1894 #if (BYTEORDER & 1) == 0
1897 result = ((s & 255) << 8) + ((s >> 8) & 255);
1905 Perl_my_htonl(pTHX_ long l)
1909 char c[sizeof(long)];
1912 #if BYTEORDER == 0x1234
1913 u.c[0] = (l >> 24) & 255;
1914 u.c[1] = (l >> 16) & 255;
1915 u.c[2] = (l >> 8) & 255;
1919 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1920 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1925 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1926 u.c[o & 0xf] = (l >> s) & 255;
1934 Perl_my_ntohl(pTHX_ long l)
1938 char c[sizeof(long)];
1941 #if BYTEORDER == 0x1234
1942 u.c[0] = (l >> 24) & 255;
1943 u.c[1] = (l >> 16) & 255;
1944 u.c[2] = (l >> 8) & 255;
1948 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1949 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1956 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1957 l |= (u.c[o & 0xf] & 255) << s;
1964 #endif /* BYTEORDER != 0x4321 */
1968 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1969 * If these functions are defined,
1970 * the BYTEORDER is neither 0x1234 nor 0x4321.
1971 * However, this is not assumed.
1975 #define HTOLE(name,type) \
1977 name (register type n) \
1981 char c[sizeof(type)]; \
1984 register U32 s = 0; \
1985 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1986 u.c[i] = (n >> s) & 0xFF; \
1991 #define LETOH(name,type) \
1993 name (register type n) \
1997 char c[sizeof(type)]; \
2000 register U32 s = 0; \
2003 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2004 n |= ((type)(u.c[i] & 0xFF)) << s; \
2010 * Big-endian byte order functions.
2013 #define HTOBE(name,type) \
2015 name (register type n) \
2019 char c[sizeof(type)]; \
2022 register U32 s = 8*(sizeof(u.c)-1); \
2023 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2024 u.c[i] = (n >> s) & 0xFF; \
2029 #define BETOH(name,type) \
2031 name (register type n) \
2035 char c[sizeof(type)]; \
2038 register U32 s = 8*(sizeof(u.c)-1); \
2041 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2042 n |= ((type)(u.c[i] & 0xFF)) << s; \
2048 * If we just can't do it...
2051 #define NOT_AVAIL(name,type) \
2053 name (register type n) \
2055 Perl_croak_nocontext(#name "() not available"); \
2056 return n; /* not reached */ \
2060 #if defined(HAS_HTOVS) && !defined(htovs)
2063 #if defined(HAS_HTOVL) && !defined(htovl)
2066 #if defined(HAS_VTOHS) && !defined(vtohs)
2069 #if defined(HAS_VTOHL) && !defined(vtohl)
2073 #ifdef PERL_NEED_MY_HTOLE16
2075 HTOLE(Perl_my_htole16,U16)
2077 NOT_AVAIL(Perl_my_htole16,U16)
2080 #ifdef PERL_NEED_MY_LETOH16
2082 LETOH(Perl_my_letoh16,U16)
2084 NOT_AVAIL(Perl_my_letoh16,U16)
2087 #ifdef PERL_NEED_MY_HTOBE16
2089 HTOBE(Perl_my_htobe16,U16)
2091 NOT_AVAIL(Perl_my_htobe16,U16)
2094 #ifdef PERL_NEED_MY_BETOH16
2096 BETOH(Perl_my_betoh16,U16)
2098 NOT_AVAIL(Perl_my_betoh16,U16)
2102 #ifdef PERL_NEED_MY_HTOLE32
2104 HTOLE(Perl_my_htole32,U32)
2106 NOT_AVAIL(Perl_my_htole32,U32)
2109 #ifdef PERL_NEED_MY_LETOH32
2111 LETOH(Perl_my_letoh32,U32)
2113 NOT_AVAIL(Perl_my_letoh32,U32)
2116 #ifdef PERL_NEED_MY_HTOBE32
2118 HTOBE(Perl_my_htobe32,U32)
2120 NOT_AVAIL(Perl_my_htobe32,U32)
2123 #ifdef PERL_NEED_MY_BETOH32
2125 BETOH(Perl_my_betoh32,U32)
2127 NOT_AVAIL(Perl_my_betoh32,U32)
2131 #ifdef PERL_NEED_MY_HTOLE64
2133 HTOLE(Perl_my_htole64,U64)
2135 NOT_AVAIL(Perl_my_htole64,U64)
2138 #ifdef PERL_NEED_MY_LETOH64
2140 LETOH(Perl_my_letoh64,U64)
2142 NOT_AVAIL(Perl_my_letoh64,U64)
2145 #ifdef PERL_NEED_MY_HTOBE64
2147 HTOBE(Perl_my_htobe64,U64)
2149 NOT_AVAIL(Perl_my_htobe64,U64)
2152 #ifdef PERL_NEED_MY_BETOH64
2154 BETOH(Perl_my_betoh64,U64)
2156 NOT_AVAIL(Perl_my_betoh64,U64)
2160 #ifdef PERL_NEED_MY_HTOLES
2161 HTOLE(Perl_my_htoles,short)
2163 #ifdef PERL_NEED_MY_LETOHS
2164 LETOH(Perl_my_letohs,short)
2166 #ifdef PERL_NEED_MY_HTOBES
2167 HTOBE(Perl_my_htobes,short)
2169 #ifdef PERL_NEED_MY_BETOHS
2170 BETOH(Perl_my_betohs,short)
2173 #ifdef PERL_NEED_MY_HTOLEI
2174 HTOLE(Perl_my_htolei,int)
2176 #ifdef PERL_NEED_MY_LETOHI
2177 LETOH(Perl_my_letohi,int)
2179 #ifdef PERL_NEED_MY_HTOBEI
2180 HTOBE(Perl_my_htobei,int)
2182 #ifdef PERL_NEED_MY_BETOHI
2183 BETOH(Perl_my_betohi,int)
2186 #ifdef PERL_NEED_MY_HTOLEL
2187 HTOLE(Perl_my_htolel,long)
2189 #ifdef PERL_NEED_MY_LETOHL
2190 LETOH(Perl_my_letohl,long)
2192 #ifdef PERL_NEED_MY_HTOBEL
2193 HTOBE(Perl_my_htobel,long)
2195 #ifdef PERL_NEED_MY_BETOHL
2196 BETOH(Perl_my_betohl,long)
2200 Perl_my_swabn(void *ptr, int n)
2202 register char *s = (char *)ptr;
2203 register char *e = s + (n-1);
2206 for (n /= 2; n > 0; s++, e--, n--) {
2214 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2216 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2219 register I32 This, that;
2225 PERL_FLUSHALL_FOR_CHILD;
2226 This = (*mode == 'w');
2230 taint_proper("Insecure %s%s", "EXEC");
2232 if (PerlProc_pipe(p) < 0)
2234 /* Try for another pipe pair for error return */
2235 if (PerlProc_pipe(pp) >= 0)
2237 while ((pid = PerlProc_fork()) < 0) {
2238 if (errno != EAGAIN) {
2239 PerlLIO_close(p[This]);
2240 PerlLIO_close(p[that]);
2242 PerlLIO_close(pp[0]);
2243 PerlLIO_close(pp[1]);
2255 /* Close parent's end of error status pipe (if any) */
2257 PerlLIO_close(pp[0]);
2258 #if defined(HAS_FCNTL) && defined(F_SETFD)
2259 /* Close error pipe automatically if exec works */
2260 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2263 /* Now dup our end of _the_ pipe to right position */
2264 if (p[THIS] != (*mode == 'r')) {
2265 PerlLIO_dup2(p[THIS], *mode == 'r');
2266 PerlLIO_close(p[THIS]);
2267 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2268 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2271 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2272 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2273 /* No automatic close - do it by hand */
2280 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2286 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2292 do_execfree(); /* free any memory malloced by child on fork */
2294 PerlLIO_close(pp[1]);
2295 /* Keep the lower of the two fd numbers */
2296 if (p[that] < p[This]) {
2297 PerlLIO_dup2(p[This], p[that]);
2298 PerlLIO_close(p[This]);
2302 PerlLIO_close(p[that]); /* close child's end of pipe */
2305 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2307 SvUPGRADE(sv,SVt_IV);
2309 PL_forkprocess = pid;
2310 /* If we managed to get status pipe check for exec fail */
2311 if (did_pipes && pid > 0) {
2316 while (n < sizeof(int)) {
2317 n1 = PerlLIO_read(pp[0],
2318 (void*)(((char*)&errkid)+n),
2324 PerlLIO_close(pp[0]);
2326 if (n) { /* Error */
2328 PerlLIO_close(p[This]);
2329 if (n != sizeof(int))
2330 Perl_croak(aTHX_ "panic: kid popen errno read");
2332 pid2 = wait4pid(pid, &status, 0);
2333 } while (pid2 == -1 && errno == EINTR);
2334 errno = errkid; /* Propagate errno from kid */
2339 PerlLIO_close(pp[0]);
2340 return PerlIO_fdopen(p[This], mode);
2342 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2343 return my_syspopen4(aTHX_ Nullch, mode, n, args);
2345 Perl_croak(aTHX_ "List form of piped open not implemented");
2346 return (PerlIO *) NULL;
2351 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2352 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2354 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2358 register I32 This, that;
2361 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2365 PERL_FLUSHALL_FOR_CHILD;
2368 return my_syspopen(aTHX_ cmd,mode);
2371 This = (*mode == 'w');
2373 if (doexec && PL_tainting) {
2375 taint_proper("Insecure %s%s", "EXEC");
2377 if (PerlProc_pipe(p) < 0)
2379 if (doexec && PerlProc_pipe(pp) >= 0)
2381 while ((pid = PerlProc_fork()) < 0) {
2382 if (errno != EAGAIN) {
2383 PerlLIO_close(p[This]);
2384 PerlLIO_close(p[that]);
2386 PerlLIO_close(pp[0]);
2387 PerlLIO_close(pp[1]);
2390 Perl_croak(aTHX_ "Can't fork");
2403 PerlLIO_close(pp[0]);
2404 #if defined(HAS_FCNTL) && defined(F_SETFD)
2405 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2408 if (p[THIS] != (*mode == 'r')) {
2409 PerlLIO_dup2(p[THIS], *mode == 'r');
2410 PerlLIO_close(p[THIS]);
2411 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2412 PerlLIO_close(p[THAT]);
2415 PerlLIO_close(p[THAT]);
2418 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2425 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2430 /* may or may not use the shell */
2431 do_exec3(cmd, pp[1], did_pipes);
2434 #endif /* defined OS2 */
2436 #ifdef PERLIO_USING_CRLF
2437 /* Since we circumvent IO layers when we manipulate low-level
2438 filedescriptors directly, need to manually switch to the
2439 default, binary, low-level mode; see PerlIOBuf_open(). */
2440 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2443 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2444 SvREADONLY_off(GvSV(tmpgv));
2445 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2446 SvREADONLY_on(GvSV(tmpgv));
2448 #ifdef THREADS_HAVE_PIDS
2449 PL_ppid = (IV)getppid();
2452 #ifdef PERL_USES_PL_PIDSTATUS
2453 hv_clear(PL_pidstatus); /* we have no children */
2459 do_execfree(); /* free any memory malloced by child on vfork */
2461 PerlLIO_close(pp[1]);
2462 if (p[that] < p[This]) {
2463 PerlLIO_dup2(p[This], p[that]);
2464 PerlLIO_close(p[This]);
2468 PerlLIO_close(p[that]);
2471 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2473 SvUPGRADE(sv,SVt_IV);
2475 PL_forkprocess = pid;
2476 if (did_pipes && pid > 0) {
2481 while (n < sizeof(int)) {
2482 n1 = PerlLIO_read(pp[0],
2483 (void*)(((char*)&errkid)+n),
2489 PerlLIO_close(pp[0]);
2491 if (n) { /* Error */
2493 PerlLIO_close(p[This]);
2494 if (n != sizeof(int))
2495 Perl_croak(aTHX_ "panic: kid popen errno read");
2497 pid2 = wait4pid(pid, &status, 0);
2498 } while (pid2 == -1 && errno == EINTR);
2499 errno = errkid; /* Propagate errno from kid */
2504 PerlLIO_close(pp[0]);
2505 return PerlIO_fdopen(p[This], mode);
2508 #if defined(atarist) || defined(EPOC)
2511 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2513 PERL_FLUSHALL_FOR_CHILD;
2514 /* Call system's popen() to get a FILE *, then import it.
2515 used 0 for 2nd parameter to PerlIO_importFILE;
2518 return PerlIO_importFILE(popen(cmd, mode), 0);
2522 FILE *djgpp_popen();
2524 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2526 PERL_FLUSHALL_FOR_CHILD;
2527 /* Call system's popen() to get a FILE *, then import it.
2528 used 0 for 2nd parameter to PerlIO_importFILE;
2531 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2536 #endif /* !DOSISH */
2538 /* this is called in parent before the fork() */
2540 Perl_atfork_lock(void)
2543 #if defined(USE_ITHREADS)
2544 /* locks must be held in locking order (if any) */
2546 MUTEX_LOCK(&PL_malloc_mutex);
2552 /* this is called in both parent and child after the fork() */
2554 Perl_atfork_unlock(void)
2557 #if defined(USE_ITHREADS)
2558 /* locks must be released in same order as in atfork_lock() */
2560 MUTEX_UNLOCK(&PL_malloc_mutex);
2569 #if defined(HAS_FORK)
2571 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2576 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2577 * handlers elsewhere in the code */
2582 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2583 Perl_croak_nocontext("fork() not available");
2585 #endif /* HAS_FORK */
2590 Perl_dump_fds(pTHX_ char *s)
2595 PerlIO_printf(Perl_debug_log,"%s", s);
2596 for (fd = 0; fd < 32; fd++) {
2597 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2598 PerlIO_printf(Perl_debug_log," %d",fd);
2600 PerlIO_printf(Perl_debug_log,"\n");
2603 #endif /* DUMP_FDS */
2607 dup2(int oldfd, int newfd)
2609 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2612 PerlLIO_close(newfd);
2613 return fcntl(oldfd, F_DUPFD, newfd);
2615 #define DUP2_MAX_FDS 256
2616 int fdtmp[DUP2_MAX_FDS];
2622 PerlLIO_close(newfd);
2623 /* good enough for low fd's... */
2624 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2625 if (fdx >= DUP2_MAX_FDS) {
2633 PerlLIO_close(fdtmp[--fdx]);
2640 #ifdef HAS_SIGACTION
2642 #ifdef MACOS_TRADITIONAL
2643 /* We don't want restart behavior on MacOS */
2648 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2651 struct sigaction act, oact;
2654 /* only "parent" interpreter can diddle signals */
2655 if (PL_curinterp != aTHX)
2656 return (Sighandler_t) SIG_ERR;
2659 act.sa_handler = (void(*)(int))handler;
2660 sigemptyset(&act.sa_mask);
2663 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2664 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2666 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2667 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2668 act.sa_flags |= SA_NOCLDWAIT;
2670 if (sigaction(signo, &act, &oact) == -1)
2671 return (Sighandler_t) SIG_ERR;
2673 return (Sighandler_t) oact.sa_handler;
2677 Perl_rsignal_state(pTHX_ int signo)
2679 struct sigaction oact;
2680 PERL_UNUSED_CONTEXT;
2682 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2683 return (Sighandler_t) SIG_ERR;
2685 return (Sighandler_t) oact.sa_handler;
2689 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2692 struct sigaction act;
2695 /* only "parent" interpreter can diddle signals */
2696 if (PL_curinterp != aTHX)
2700 act.sa_handler = (void(*)(int))handler;
2701 sigemptyset(&act.sa_mask);
2704 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2705 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2707 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2708 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2709 act.sa_flags |= SA_NOCLDWAIT;
2711 return sigaction(signo, &act, save);
2715 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2719 /* only "parent" interpreter can diddle signals */
2720 if (PL_curinterp != aTHX)
2724 return sigaction(signo, save, (struct sigaction *)NULL);
2727 #else /* !HAS_SIGACTION */
2730 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2732 #if defined(USE_ITHREADS) && !defined(WIN32)
2733 /* only "parent" interpreter can diddle signals */
2734 if (PL_curinterp != aTHX)
2735 return (Sighandler_t) SIG_ERR;
2738 return PerlProc_signal(signo, handler);
2749 Perl_rsignal_state(pTHX_ int signo)
2752 Sighandler_t oldsig;
2754 #if defined(USE_ITHREADS) && !defined(WIN32)
2755 /* only "parent" interpreter can diddle signals */
2756 if (PL_curinterp != aTHX)
2757 return (Sighandler_t) SIG_ERR;
2761 oldsig = PerlProc_signal(signo, sig_trap);
2762 PerlProc_signal(signo, oldsig);
2764 PerlProc_kill(PerlProc_getpid(), signo);
2769 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2771 #if defined(USE_ITHREADS) && !defined(WIN32)
2772 /* only "parent" interpreter can diddle signals */
2773 if (PL_curinterp != aTHX)
2776 *save = PerlProc_signal(signo, handler);
2777 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2781 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2783 #if defined(USE_ITHREADS) && !defined(WIN32)
2784 /* only "parent" interpreter can diddle signals */
2785 if (PL_curinterp != aTHX)
2788 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2791 #endif /* !HAS_SIGACTION */
2792 #endif /* !PERL_MICRO */
2794 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2795 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2797 Perl_my_pclose(pTHX_ PerlIO *ptr)
2800 Sigsave_t hstat, istat, qstat;
2806 int saved_errno = 0;
2808 int saved_win32_errno;
2812 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2814 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2816 *svp = &PL_sv_undef;
2818 if (pid == -1) { /* Opened by popen. */
2819 return my_syspclose(ptr);
2822 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2823 saved_errno = errno;
2825 saved_win32_errno = GetLastError();
2829 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2832 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2833 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2834 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2837 pid2 = wait4pid(pid, &status, 0);
2838 } while (pid2 == -1 && errno == EINTR);
2840 rsignal_restore(SIGHUP, &hstat);
2841 rsignal_restore(SIGINT, &istat);
2842 rsignal_restore(SIGQUIT, &qstat);
2845 SETERRNO(saved_errno, 0);
2848 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2850 #endif /* !DOSISH */
2852 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2854 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2860 #ifdef PERL_USES_PL_PIDSTATUS
2863 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2864 pid, rather than a string form. */
2865 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2866 if (svp && *svp != &PL_sv_undef) {
2867 *statusp = SvIVX(*svp);
2868 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2876 hv_iterinit(PL_pidstatus);
2877 if ((entry = hv_iternext(PL_pidstatus))) {
2878 SV * const sv = hv_iterval(PL_pidstatus,entry);
2880 const char * const spid = hv_iterkey(entry,&len);
2882 assert (len == sizeof(Pid_t));
2883 memcpy((char *)&pid, spid, len);
2884 *statusp = SvIVX(sv);
2885 /* The hash iterator is currently on this entry, so simply
2886 calling hv_delete would trigger the lazy delete, which on
2887 aggregate does more work, beacuse next call to hv_iterinit()
2888 would spot the flag, and have to call the delete routine,
2889 while in the meantime any new entries can't re-use that
2891 hv_iterinit(PL_pidstatus);
2892 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2899 # ifdef HAS_WAITPID_RUNTIME
2900 if (!HAS_WAITPID_RUNTIME)
2903 result = PerlProc_waitpid(pid,statusp,flags);
2906 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2907 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2910 #ifdef PERL_USES_PL_PIDSTATUS
2911 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2916 Perl_croak(aTHX_ "Can't do waitpid with flags");
2918 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2919 pidgone(result,*statusp);
2925 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2928 if (result < 0 && errno == EINTR) {
2933 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2935 #ifdef PERL_USES_PL_PIDSTATUS
2937 Perl_pidgone(pTHX_ Pid_t pid, int status)
2941 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2942 SvUPGRADE(sv,SVt_IV);
2943 SvIV_set(sv, status);
2948 #if defined(atarist) || defined(OS2) || defined(EPOC)
2951 int /* Cannot prototype with I32
2953 my_syspclose(PerlIO *ptr)
2956 Perl_my_pclose(pTHX_ PerlIO *ptr)
2959 /* Needs work for PerlIO ! */
2960 FILE * const f = PerlIO_findFILE(ptr);
2961 const I32 result = pclose(f);
2962 PerlIO_releaseFILE(ptr,f);
2970 Perl_my_pclose(pTHX_ PerlIO *ptr)
2972 /* Needs work for PerlIO ! */
2973 FILE * const f = PerlIO_findFILE(ptr);
2974 I32 result = djgpp_pclose(f);
2975 result = (result << 8) & 0xff00;
2976 PerlIO_releaseFILE(ptr,f);
2982 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2985 register const char * const frombase = from;
2986 PERL_UNUSED_CONTEXT;
2989 register const char c = *from;
2994 while (count-- > 0) {
2995 for (todo = len; todo > 0; todo--) {
3004 Perl_same_dirent(pTHX_ const char *a, const char *b)
3006 char *fa = strrchr(a,'/');
3007 char *fb = strrchr(b,'/');
3010 SV * const tmpsv = sv_newmortal();
3023 sv_setpvn(tmpsv, ".", 1);
3025 sv_setpvn(tmpsv, a, fa - a);
3026 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
3029 sv_setpvn(tmpsv, ".", 1);
3031 sv_setpvn(tmpsv, b, fb - b);
3032 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
3034 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3035 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3037 #endif /* !HAS_RENAME */
3040 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3041 const char *const *const search_ext, I32 flags)
3044 const char *xfound = NULL;
3045 char *xfailed = NULL;
3046 char tmpbuf[MAXPATHLEN];
3051 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3052 # define SEARCH_EXTS ".bat", ".cmd", NULL
3053 # define MAX_EXT_LEN 4
3056 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3057 # define MAX_EXT_LEN 4
3060 # define SEARCH_EXTS ".pl", ".com", NULL
3061 # define MAX_EXT_LEN 4
3063 /* additional extensions to try in each dir if scriptname not found */
3065 static const char *const exts[] = { SEARCH_EXTS };
3066 const char *const *const ext = search_ext ? search_ext : exts;
3067 int extidx = 0, i = 0;
3068 const char *curext = NULL;
3070 PERL_UNUSED_ARG(search_ext);
3071 # define MAX_EXT_LEN 0
3075 * If dosearch is true and if scriptname does not contain path
3076 * delimiters, search the PATH for scriptname.
3078 * If SEARCH_EXTS is also defined, will look for each
3079 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3080 * while searching the PATH.
3082 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3083 * proceeds as follows:
3084 * If DOSISH or VMSISH:
3085 * + look for ./scriptname{,.foo,.bar}
3086 * + search the PATH for scriptname{,.foo,.bar}
3089 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3090 * this will not look in '.' if it's not in the PATH)
3095 # ifdef ALWAYS_DEFTYPES
3096 len = strlen(scriptname);
3097 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3098 int idx = 0, deftypes = 1;
3101 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3104 int idx = 0, deftypes = 1;
3107 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3109 /* The first time through, just add SEARCH_EXTS to whatever we
3110 * already have, so we can check for default file types. */
3112 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3118 if ((strlen(tmpbuf) + strlen(scriptname)
3119 + MAX_EXT_LEN) >= sizeof tmpbuf)
3120 continue; /* don't search dir with too-long name */
3121 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3125 if (strEQ(scriptname, "-"))
3127 if (dosearch) { /* Look in '.' first. */
3128 const char *cur = scriptname;
3130 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3132 if (strEQ(ext[i++],curext)) {
3133 extidx = -1; /* already has an ext */
3138 DEBUG_p(PerlIO_printf(Perl_debug_log,
3139 "Looking for %s\n",cur));
3140 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3141 && !S_ISDIR(PL_statbuf.st_mode)) {
3149 if (cur == scriptname) {
3150 len = strlen(scriptname);
3151 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3153 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3156 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3157 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3162 #ifdef MACOS_TRADITIONAL
3163 if (dosearch && !strchr(scriptname, ':') &&
3164 (s = PerlEnv_getenv("Commands")))
3166 if (dosearch && !strchr(scriptname, '/')
3168 && !strchr(scriptname, '\\')
3170 && (s = PerlEnv_getenv("PATH")))
3175 bufend = s + strlen(s);
3176 while (s < bufend) {
3177 #ifdef MACOS_TRADITIONAL
3178 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3182 #if defined(atarist) || defined(DOSISH)
3187 && *s != ';'; len++, s++) {
3188 if (len < sizeof tmpbuf)
3191 if (len < sizeof tmpbuf)
3193 #else /* ! (atarist || DOSISH) */
3194 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
3197 #endif /* ! (atarist || DOSISH) */
3198 #endif /* MACOS_TRADITIONAL */
3201 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3202 continue; /* don't search dir with too-long name */
3203 #ifdef MACOS_TRADITIONAL
3204 if (len && tmpbuf[len - 1] != ':')
3205 tmpbuf[len++] = ':';
3208 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3209 && tmpbuf[len - 1] != '/'
3210 && tmpbuf[len - 1] != '\\'
3213 tmpbuf[len++] = '/';
3214 if (len == 2 && tmpbuf[0] == '.')
3217 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3221 len = strlen(tmpbuf);
3222 if (extidx > 0) /* reset after previous loop */
3226 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3227 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3228 if (S_ISDIR(PL_statbuf.st_mode)) {
3232 } while ( retval < 0 /* not there */
3233 && extidx>=0 && ext[extidx] /* try an extension? */
3234 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3239 if (S_ISREG(PL_statbuf.st_mode)
3240 && cando(S_IRUSR,TRUE,&PL_statbuf)
3241 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3242 && cando(S_IXUSR,TRUE,&PL_statbuf)
3246 xfound = tmpbuf; /* bingo! */
3250 xfailed = savepv(tmpbuf);
3253 if (!xfound && !seen_dot && !xfailed &&
3254 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3255 || S_ISDIR(PL_statbuf.st_mode)))
3257 seen_dot = 1; /* Disable message. */
3259 if (flags & 1) { /* do or die? */
3260 Perl_croak(aTHX_ "Can't %s %s%s%s",
3261 (xfailed ? "execute" : "find"),
3262 (xfailed ? xfailed : scriptname),
3263 (xfailed ? "" : " on PATH"),
3264 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3269 scriptname = xfound;
3271 return (scriptname ? savepv(scriptname) : NULL);
3274 #ifndef PERL_GET_CONTEXT_DEFINED
3277 Perl_get_context(void)
3280 #if defined(USE_ITHREADS)
3281 # ifdef OLD_PTHREADS_API
3283 if (pthread_getspecific(PL_thr_key, &t))
3284 Perl_croak_nocontext("panic: pthread_getspecific");
3287 # ifdef I_MACH_CTHREADS
3288 return (void*)cthread_data(cthread_self());
3290 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3299 Perl_set_context(void *t)
3302 #if defined(USE_ITHREADS)
3303 # ifdef I_MACH_CTHREADS
3304 cthread_set_data(cthread_self(), t);
3306 if (pthread_setspecific(PL_thr_key, t))
3307 Perl_croak_nocontext("panic: pthread_setspecific");
3314 #endif /* !PERL_GET_CONTEXT_DEFINED */
3316 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3325 Perl_get_op_names(pTHX)
3327 PERL_UNUSED_CONTEXT;
3328 return (char **)PL_op_name;
3332 Perl_get_op_descs(pTHX)
3334 PERL_UNUSED_CONTEXT;
3335 return (char **)PL_op_desc;
3339 Perl_get_no_modify(pTHX)
3341 PERL_UNUSED_CONTEXT;
3342 return PL_no_modify;
3346 Perl_get_opargs(pTHX)
3348 PERL_UNUSED_CONTEXT;
3349 return (U32 *)PL_opargs;
3353 Perl_get_ppaddr(pTHX)
3356 PERL_UNUSED_CONTEXT;
3357 return (PPADDR_t*)PL_ppaddr;
3360 #ifndef HAS_GETENV_LEN
3362 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3364 char * const env_trans = PerlEnv_getenv(env_elem);
3365 PERL_UNUSED_CONTEXT;
3367 *len = strlen(env_trans);
3374 Perl_get_vtbl(pTHX_ int vtbl_id)
3376 const MGVTBL* result;
3377 PERL_UNUSED_CONTEXT;
3381 result = &PL_vtbl_sv;
3384 result = &PL_vtbl_env;
3386 case want_vtbl_envelem:
3387 result = &PL_vtbl_envelem;
3390 result = &PL_vtbl_sig;
3392 case want_vtbl_sigelem:
3393 result = &PL_vtbl_sigelem;
3395 case want_vtbl_pack:
3396 result = &PL_vtbl_pack;
3398 case want_vtbl_packelem:
3399 result = &PL_vtbl_packelem;
3401 case want_vtbl_dbline:
3402 result = &PL_vtbl_dbline;
3405 result = &PL_vtbl_isa;
3407 case want_vtbl_isaelem:
3408 result = &PL_vtbl_isaelem;
3410 case want_vtbl_arylen:
3411 result = &PL_vtbl_arylen;
3413 case want_vtbl_mglob:
3414 result = &PL_vtbl_mglob;
3416 case want_vtbl_nkeys:
3417 result = &PL_vtbl_nkeys;
3419 case want_vtbl_taint:
3420 result = &PL_vtbl_taint;
3422 case want_vtbl_substr:
3423 result = &PL_vtbl_substr;
3426 result = &PL_vtbl_vec;
3429 result = &PL_vtbl_pos;
3432 result = &PL_vtbl_bm;
3435 result = &PL_vtbl_fm;
3437 case want_vtbl_uvar:
3438 result = &PL_vtbl_uvar;
3440 case want_vtbl_defelem:
3441 result = &PL_vtbl_defelem;
3443 case want_vtbl_regexp:
3444 result = &PL_vtbl_regexp;
3446 case want_vtbl_regdata:
3447 result = &PL_vtbl_regdata;
3449 case want_vtbl_regdatum:
3450 result = &PL_vtbl_regdatum;
3452 #ifdef USE_LOCALE_COLLATE
3453 case want_vtbl_collxfrm:
3454 result = &PL_vtbl_collxfrm;
3457 case want_vtbl_amagic:
3458 result = &PL_vtbl_amagic;
3460 case want_vtbl_amagicelem:
3461 result = &PL_vtbl_amagicelem;
3463 case want_vtbl_backref:
3464 result = &PL_vtbl_backref;
3466 case want_vtbl_utf8:
3467 result = &PL_vtbl_utf8;
3473 return (MGVTBL*)result;
3477 Perl_my_fflush_all(pTHX)
3479 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3480 return PerlIO_flush(NULL);
3482 # if defined(HAS__FWALK)
3483 extern int fflush(FILE *);
3484 /* undocumented, unprototyped, but very useful BSDism */
3485 extern void _fwalk(int (*)(FILE *));
3489 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3491 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3492 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3494 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3495 open_max = sysconf(_SC_OPEN_MAX);
3498 open_max = FOPEN_MAX;
3501 open_max = OPEN_MAX;
3512 for (i = 0; i < open_max; i++)
3513 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3514 STDIO_STREAM_ARRAY[i]._file < open_max &&
3515 STDIO_STREAM_ARRAY[i]._flag)
3516 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3520 SETERRNO(EBADF,RMS_IFI);
3527 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3529 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3531 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3532 if (ckWARN(WARN_IO)) {
3533 const char * const direction =
3534 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3536 Perl_warner(aTHX_ packWARN(WARN_IO),
3537 "Filehandle %s opened only for %sput",
3540 Perl_warner(aTHX_ packWARN(WARN_IO),
3541 "Filehandle opened only for %sput", direction);
3548 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3550 warn_type = WARN_CLOSED;
3554 warn_type = WARN_UNOPENED;
3557 if (ckWARN(warn_type)) {
3558 const char * const pars =
3559 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3560 const char * const func =
3562 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3563 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3564 op < 0 ? "" : /* handle phoney cases */
3566 const char * const type =
3568 (OP_IS_SOCKET(op) ||
3569 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3570 "socket" : "filehandle");
3571 if (name && *name) {
3572 Perl_warner(aTHX_ packWARN(warn_type),
3573 "%s%s on %s %s %s", func, pars, vile, type, name);
3574 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3576 aTHX_ packWARN(warn_type),
3577 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3582 Perl_warner(aTHX_ packWARN(warn_type),
3583 "%s%s on %s %s", func, pars, vile, type);
3584 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3586 aTHX_ packWARN(warn_type),
3587 "\t(Are you trying to call %s%s on dirhandle?)\n",
3596 /* in ASCII order, not that it matters */
3597 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3600 Perl_ebcdic_control(pTHX_ int ch)
3608 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3609 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3612 if (ctlp == controllablechars)
3613 return('\177'); /* DEL */
3615 return((unsigned char)(ctlp - controllablechars - 1));
3616 } else { /* Want uncontrol */
3617 if (ch == '\177' || ch == -1)
3619 else if (ch == '\157')
3621 else if (ch == '\174')
3623 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3625 else if (ch == '\155')
3627 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3628 return(controllablechars[ch+1]);
3630 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3635 /* To workaround core dumps from the uninitialised tm_zone we get the
3636 * system to give us a reasonable struct to copy. This fix means that
3637 * strftime uses the tm_zone and tm_gmtoff values returned by
3638 * localtime(time()). That should give the desired result most of the
3639 * time. But probably not always!
3641 * This does not address tzname aspects of NETaa14816.
3646 # ifndef STRUCT_TM_HASZONE
3647 # define STRUCT_TM_HASZONE
3651 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3652 # ifndef HAS_TM_TM_ZONE
3653 # define HAS_TM_TM_ZONE
3658 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3660 #ifdef HAS_TM_TM_ZONE
3662 const struct tm* my_tm;
3664 my_tm = localtime(&now);
3666 Copy(my_tm, ptm, 1, struct tm);
3668 PERL_UNUSED_ARG(ptm);
3673 * mini_mktime - normalise struct tm values without the localtime()
3674 * semantics (and overhead) of mktime().
3677 Perl_mini_mktime(pTHX_ struct tm *ptm)
3681 int month, mday, year, jday;
3682 int odd_cent, odd_year;
3683 PERL_UNUSED_CONTEXT;
3685 #define DAYS_PER_YEAR 365
3686 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3687 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3688 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3689 #define SECS_PER_HOUR (60*60)
3690 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3691 /* parentheses deliberately absent on these two, otherwise they don't work */
3692 #define MONTH_TO_DAYS 153/5
3693 #define DAYS_TO_MONTH 5/153
3694 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3695 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3696 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3697 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3700 * Year/day algorithm notes:
3702 * With a suitable offset for numeric value of the month, one can find
3703 * an offset into the year by considering months to have 30.6 (153/5) days,
3704 * using integer arithmetic (i.e., with truncation). To avoid too much
3705 * messing about with leap days, we consider January and February to be
3706 * the 13th and 14th month of the previous year. After that transformation,
3707 * we need the month index we use to be high by 1 from 'normal human' usage,
3708 * so the month index values we use run from 4 through 15.
3710 * Given that, and the rules for the Gregorian calendar (leap years are those
3711 * divisible by 4 unless also divisible by 100, when they must be divisible
3712 * by 400 instead), we can simply calculate the number of days since some
3713 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3714 * the days we derive from our month index, and adding in the day of the
3715 * month. The value used here is not adjusted for the actual origin which
3716 * it normally would use (1 January A.D. 1), since we're not exposing it.
3717 * We're only building the value so we can turn around and get the
3718 * normalised values for the year, month, day-of-month, and day-of-year.
3720 * For going backward, we need to bias the value we're using so that we find
3721 * the right year value. (Basically, we don't want the contribution of
3722 * March 1st to the number to apply while deriving the year). Having done
3723 * that, we 'count up' the contribution to the year number by accounting for
3724 * full quadracenturies (400-year periods) with their extra leap days, plus
3725 * the contribution from full centuries (to avoid counting in the lost leap
3726 * days), plus the contribution from full quad-years (to count in the normal
3727 * leap days), plus the leftover contribution from any non-leap years.
3728 * At this point, if we were working with an actual leap day, we'll have 0
3729 * days left over. This is also true for March 1st, however. So, we have
3730 * to special-case that result, and (earlier) keep track of the 'odd'
3731 * century and year contributions. If we got 4 extra centuries in a qcent,
3732 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3733 * Otherwise, we add back in the earlier bias we removed (the 123 from
3734 * figuring in March 1st), find the month index (integer division by 30.6),
3735 * and the remainder is the day-of-month. We then have to convert back to
3736 * 'real' months (including fixing January and February from being 14/15 in
3737 * the previous year to being in the proper year). After that, to get
3738 * tm_yday, we work with the normalised year and get a new yearday value for
3739 * January 1st, which we subtract from the yearday value we had earlier,
3740 * representing the date we've re-built. This is done from January 1
3741 * because tm_yday is 0-origin.
3743 * Since POSIX time routines are only guaranteed to work for times since the
3744 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3745 * applies Gregorian calendar rules even to dates before the 16th century
3746 * doesn't bother me. Besides, you'd need cultural context for a given
3747 * date to know whether it was Julian or Gregorian calendar, and that's
3748 * outside the scope for this routine. Since we convert back based on the
3749 * same rules we used to build the yearday, you'll only get strange results
3750 * for input which needed normalising, or for the 'odd' century years which
3751 * were leap years in the Julian calander but not in the Gregorian one.
3752 * I can live with that.
3754 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3755 * that's still outside the scope for POSIX time manipulation, so I don't
3759 year = 1900 + ptm->tm_year;
3760 month = ptm->tm_mon;
3761 mday = ptm->tm_mday;
3762 /* allow given yday with no month & mday to dominate the result */
3763 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3766 jday = 1 + ptm->tm_yday;
3775 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3776 yearday += month*MONTH_TO_DAYS + mday + jday;
3778 * Note that we don't know when leap-seconds were or will be,
3779 * so we have to trust the user if we get something which looks
3780 * like a sensible leap-second. Wild values for seconds will
3781 * be rationalised, however.
3783 if ((unsigned) ptm->tm_sec <= 60) {
3790 secs += 60 * ptm->tm_min;
3791 secs += SECS_PER_HOUR * ptm->tm_hour;
3793 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3794 /* got negative remainder, but need positive time */
3795 /* back off an extra day to compensate */
3796 yearday += (secs/SECS_PER_DAY)-1;
3797 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3800 yearday += (secs/SECS_PER_DAY);
3801 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3804 else if (secs >= SECS_PER_DAY) {
3805 yearday += (secs/SECS_PER_DAY);
3806 secs %= SECS_PER_DAY;
3808 ptm->tm_hour = secs/SECS_PER_HOUR;
3809 secs %= SECS_PER_HOUR;
3810 ptm->tm_min = secs/60;
3812 ptm->tm_sec += secs;
3813 /* done with time of day effects */
3815 * The algorithm for yearday has (so far) left it high by 428.
3816 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3817 * bias it by 123 while trying to figure out what year it
3818 * really represents. Even with this tweak, the reverse
3819 * translation fails for years before A.D. 0001.
3820 * It would still fail for Feb 29, but we catch that one below.
3822 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3823 yearday -= YEAR_ADJUST;
3824 year = (yearday / DAYS_PER_QCENT) * 400;
3825 yearday %= DAYS_PER_QCENT;
3826 odd_cent = yearday / DAYS_PER_CENT;
3827 year += odd_cent * 100;
3828 yearday %= DAYS_PER_CENT;
3829 year += (yearday / DAYS_PER_QYEAR) * 4;
3830 yearday %= DAYS_PER_QYEAR;
3831 odd_year = yearday / DAYS_PER_YEAR;
3833 yearday %= DAYS_PER_YEAR;
3834 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3839 yearday += YEAR_ADJUST; /* recover March 1st crock */
3840 month = yearday*DAYS_TO_MONTH;
3841 yearday -= month*MONTH_TO_DAYS;
3842 /* recover other leap-year adjustment */
3851 ptm->tm_year = year - 1900;
3853 ptm->tm_mday = yearday;
3854 ptm->tm_mon = month;
3858 ptm->tm_mon = month - 1;
3860 /* re-build yearday based on Jan 1 to get tm_yday */
3862 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3863 yearday += 14*MONTH_TO_DAYS + 1;
3864 ptm->tm_yday = jday - yearday;
3865 /* fix tm_wday if not overridden by caller */
3866 if ((unsigned)ptm->tm_wday > 6)
3867 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3871 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)
3879 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3882 mytm.tm_hour = hour;
3883 mytm.tm_mday = mday;
3885 mytm.tm_year = year;
3886 mytm.tm_wday = wday;
3887 mytm.tm_yday = yday;
3888 mytm.tm_isdst = isdst;
3890 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3891 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3896 #ifdef HAS_TM_TM_GMTOFF
3897 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3899 #ifdef HAS_TM_TM_ZONE
3900 mytm.tm_zone = mytm2.tm_zone;
3905 Newx(buf, buflen, char);
3906 len = strftime(buf, buflen, fmt, &mytm);
3908 ** The following is needed to handle to the situation where
3909 ** tmpbuf overflows. Basically we want to allocate a buffer
3910 ** and try repeatedly. The reason why it is so complicated
3911 ** is that getting a return value of 0 from strftime can indicate
3912 ** one of the following:
3913 ** 1. buffer overflowed,
3914 ** 2. illegal conversion specifier, or
3915 ** 3. the format string specifies nothing to be returned(not
3916 ** an error). This could be because format is an empty string
3917 ** or it specifies %p that yields an empty string in some locale.
3918 ** If there is a better way to make it portable, go ahead by
3921 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3924 /* Possibly buf overflowed - try again with a bigger buf */
3925 const int fmtlen = strlen(fmt);
3926 int bufsize = fmtlen + buflen;
3928 Newx(buf, bufsize, char);
3930 buflen = strftime(buf, bufsize, fmt, &mytm);
3931 if (buflen > 0 && buflen < bufsize)
3933 /* heuristic to prevent out-of-memory errors */
3934 if (bufsize > 100*fmtlen) {
3940 Renew(buf, bufsize, char);
3945 Perl_croak(aTHX_ "panic: no strftime");
3951 #define SV_CWD_RETURN_UNDEF \
3952 sv_setsv(sv, &PL_sv_undef); \
3955 #define SV_CWD_ISDOT(dp) \
3956 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3957 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3960 =head1 Miscellaneous Functions
3962 =for apidoc getcwd_sv
3964 Fill the sv with current working directory
3969 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3970 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3971 * getcwd(3) if available
3972 * Comments from the orignal:
3973 * This is a faster version of getcwd. It's also more dangerous
3974 * because you might chdir out of a directory that you can't chdir
3978 Perl_getcwd_sv(pTHX_ register SV *sv)
3982 #ifndef INCOMPLETE_TAINTS
3988 char buf[MAXPATHLEN];
3990 /* Some getcwd()s automatically allocate a buffer of the given
3991 * size from the heap if they are given a NULL buffer pointer.
3992 * The problem is that this behaviour is not portable. */
3993 if (getcwd(buf, sizeof(buf) - 1)) {
3998 sv_setsv(sv, &PL_sv_undef);
4006 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4010 SvUPGRADE(sv, SVt_PV);
4012 if (PerlLIO_lstat(".", &statbuf) < 0) {
4013 SV_CWD_RETURN_UNDEF;
4016 orig_cdev = statbuf.st_dev;
4017 orig_cino = statbuf.st_ino;
4026 if (PerlDir_chdir("..") < 0) {
4027 SV_CWD_RETURN_UNDEF;
4029 if (PerlLIO_stat(".", &statbuf) < 0) {
4030 SV_CWD_RETURN_UNDEF;
4033 cdev = statbuf.st_dev;
4034 cino = statbuf.st_ino;
4036 if (odev == cdev && oino == cino) {
4039 if (!(dir = PerlDir_open("."))) {
4040 SV_CWD_RETURN_UNDEF;
4043 while ((dp = PerlDir_read(dir)) != NULL) {
4045 const int namelen = dp->d_namlen;
4047 const int namelen = strlen(dp->d_name);
4050 if (SV_CWD_ISDOT(dp)) {
4054 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4055 SV_CWD_RETURN_UNDEF;
4058 tdev = statbuf.st_dev;
4059 tino = statbuf.st_ino;
4060 if (tino == oino && tdev == odev) {
4066 SV_CWD_RETURN_UNDEF;
4069 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4070 SV_CWD_RETURN_UNDEF;
4073 SvGROW(sv, pathlen + namelen + 1);
4077 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4080 /* prepend current directory to the front */
4082 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4083 pathlen += (namelen + 1);
4085 #ifdef VOID_CLOSEDIR
4088 if (PerlDir_close(dir) < 0) {
4089 SV_CWD_RETURN_UNDEF;
4095 SvCUR_set(sv, pathlen);
4099 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4100 SV_CWD_RETURN_UNDEF;
4103 if (PerlLIO_stat(".", &statbuf) < 0) {
4104 SV_CWD_RETURN_UNDEF;
4107 cdev = statbuf.st_dev;
4108 cino = statbuf.st_ino;
4110 if (cdev != orig_cdev || cino != orig_cino) {
4111 Perl_croak(aTHX_ "Unstable directory path, "
4112 "current directory changed unexpectedly");
4124 =for apidoc scan_version
4126 Returns a pointer to the next character after the parsed
4127 version string, as well as upgrading the passed in SV to
4130 Function must be called with an already existing SV like
4133 s = scan_version(s, SV *sv, bool qv);
4135 Performs some preprocessing to the string to ensure that
4136 it has the correct characteristics of a version. Flags the
4137 object if it contains an underscore (which denotes this
4138 is an alpha version). The boolean qv denotes that the version
4139 should be interpreted as if it had multiple decimals, even if
4146 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4154 AV * const av = newAV();
4155 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4156 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4158 #ifndef NODEFAULT_SHAREKEYS
4159 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4162 while (isSPACE(*s)) /* leading whitespace is OK */
4168 s++; /* get past 'v' */
4169 qv = 1; /* force quoted version processing */
4174 /* pre-scan the input string to check for decimals/underbars */
4175 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4180 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4184 else if ( *pos == '_' )
4187 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4189 width = pos - last - 1; /* natural width of sub-version */
4194 if ( alpha && !saw_period )
4195 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4197 if ( alpha && saw_period && width == 0 )
4198 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4200 if ( saw_period > 1 )
4201 qv = 1; /* force quoted version processing */
4206 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4208 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4209 if ( !qv && width < 3 )
4210 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4212 while (isDIGIT(*pos))
4214 if (!isALPHA(*pos)) {
4220 /* this is atoi() that delimits on underscores */
4221 const char *end = pos;
4225 /* the following if() will only be true after the decimal
4226 * point of a version originally created with a bare
4227 * floating point number, i.e. not quoted in any way
4229 if ( !qv && s > start && saw_period == 1 ) {
4233 rev += (*s - '0') * mult;
4235 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4236 Perl_croak(aTHX_ "Integer overflow in version");
4243 while (--end >= s) {
4245 rev += (*end - '0') * mult;
4247 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4248 Perl_croak(aTHX_ "Integer overflow in version");
4253 /* Append revision */
4254 av_push(av, newSViv(rev));
4257 else if ( *pos == '_' && isDIGIT(pos[1]) )
4259 else if ( isDIGIT(*pos) )
4266 while ( isDIGIT(*pos) )
4271 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4279 if ( qv ) { /* quoted versions always get at least three terms*/
4280 I32 len = av_len(av);
4281 /* This for loop appears to trigger a compiler bug on OS X, as it
4282 loops infinitely. Yes, len is negative. No, it makes no sense.
4283 Compiler in question is:
4284 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4285 for ( len = 2 - len; len > 0; len-- )
4286 av_push((AV *)sv, newSViv(0));
4290 av_push(av, newSViv(0));
4293 /* need to save off the current version string for later */
4295 SV * orig = newSVpvn(start,s-start);
4296 if ( qv && saw_period == 1 && *start != 'v' ) {
4297 /* need to insert a v to be consistent */
4298 sv_insert(orig, 0, 0, "v", 1);
4300 hv_store((HV *)hv, "original", 8, orig, 0);
4303 hv_store((HV *)hv, "original", 8, newSVpvn("0",1), 0);
4304 av_push(av, newSViv(0));
4307 /* And finally, store the AV in the hash */
4308 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4310 /* fix RT#19517 - special case 'undef' as string */
4311 if ( *s == 'u' && strEQ(s,"undef") ) {
4319 =for apidoc new_version
4321 Returns a new version object based on the passed in SV:
4323 SV *sv = new_version(SV *ver);
4325 Does not alter the passed in ver SV. See "upg_version" if you
4326 want to upgrade the SV.
4332 Perl_new_version(pTHX_ SV *ver)
4335 SV * const rv = newSV(0);
4336 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4339 AV * const av = newAV();
4341 /* This will get reblessed later if a derived class*/
4342 SV * const hv = newSVrv(rv, "version");
4343 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4344 #ifndef NODEFAULT_SHAREKEYS
4345 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4351 /* Begin copying all of the elements */
4352 if ( hv_exists((HV *)ver, "qv", 2) )
4353 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4355 if ( hv_exists((HV *)ver, "alpha", 5) )
4356 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4358 if ( hv_exists((HV*)ver, "width", 5 ) )
4360 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4361 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4364 if ( hv_exists((HV*)ver, "original", 8 ) )
4366 SV * pv = *hv_fetchs((HV*)ver, "original", FALSE);
4367 hv_store((HV *)hv, "original", 8, newSVsv(pv), 0);
4370 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4371 /* This will get reblessed later if a derived class*/
4372 for ( key = 0; key <= av_len(sav); key++ )
4374 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4375 av_push(av, newSViv(rev));
4378 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4383 const MAGIC* const mg = SvVSTRING_mg(ver);
4384 if ( mg ) { /* already a v-string */
4385 const STRLEN len = mg->mg_len;
4386 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4387 sv_setpvn(rv,version,len);
4388 /* this is for consistency with the pure Perl class */
4389 if ( *version != 'v' )
4390 sv_insert(rv, 0, 0, "v", 1);
4395 sv_setsv(rv,ver); /* make a duplicate */
4400 return upg_version(rv, FALSE);
4404 =for apidoc upg_version
4406 In-place upgrade of the supplied SV to a version object.
4408 SV *sv = upg_version(SV *sv, bool qv);
4410 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4411 to force this SV to be interpreted as an "extended" version.
4417 Perl_upg_version(pTHX_ SV *ver, bool qv)
4419 const char *version, *s;
4424 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4426 /* may get too much accuracy */
4428 #ifdef USE_LOCALE_NUMERIC
4429 char *loc = setlocale(LC_NUMERIC, "C");
4431 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4432 #ifdef USE_LOCALE_NUMERIC
4433 setlocale(LC_NUMERIC, loc);
4435 while (tbuf[len-1] == '0' && len > 0) len--;
4436 if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */
4437 version = savepvn(tbuf, len);
4440 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4441 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4445 else /* must be a string or something like a string */
4448 version = savepv(SvPV(ver,len));
4450 # if PERL_VERSION > 5
4451 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4452 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4453 /* may be a v-string */
4454 SV * const nsv = sv_newmortal();
4458 sv_setpvf(nsv,"v%vd",ver);
4459 pos = nver = savepv(SvPV_nolen(nsv));
4461 /* scan the resulting formatted string */
4462 pos++; /* skip the leading 'v' */
4463 while ( *pos == '.' || isDIGIT(*pos) ) {
4469 /* is definitely a v-string */
4470 if ( saw_period == 2 ) {
4479 s = scan_version(version, ver, qv);
4481 if(ckWARN(WARN_MISC))
4482 Perl_warner(aTHX_ packWARN(WARN_MISC),
4483 "Version string '%s' contains invalid data; "
4484 "ignoring: '%s'", version, s);
4492 Validates that the SV contains a valid version object.
4494 bool vverify(SV *vobj);
4496 Note that it only confirms the bare minimum structure (so as not to get
4497 confused by derived classes which may contain additional hash entries):
4501 =item * The SV contains a [reference to a] hash
4503 =item * The hash contains a "version" key
4505 =item * The "version" key has [a reference to] an AV as its value
4513 Perl_vverify(pTHX_ SV *vs)
4519 /* see if the appropriate elements exist */
4520 if ( SvTYPE(vs) == SVt_PVHV
4521 && hv_exists((HV*)vs, "version", 7)
4522 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4523 && SvTYPE(sv) == SVt_PVAV )
4532 Accepts a version object and returns the normalized floating
4533 point representation. Call like:
4537 NOTE: you can pass either the object directly or the SV
4538 contained within the RV.
4544 Perl_vnumify(pTHX_ SV *vs)
4549 SV * const sv = newSV(0);
4555 Perl_croak(aTHX_ "Invalid version object");
4557 /* see if various flags exist */
4558 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4560 if ( hv_exists((HV*)vs, "width", 5 ) )
4561 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4566 /* attempt to retrieve the version array */
4567 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4579 digit = SvIV(*av_fetch(av, 0, 0));
4580 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4581 for ( i = 1 ; i < len ; i++ )
4583 digit = SvIV(*av_fetch(av, i, 0));
4585 const int denom = (width == 2 ? 10 : 100);
4586 const div_t term = div((int)PERL_ABS(digit),denom);
4587 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4590 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4596 digit = SvIV(*av_fetch(av, len, 0));
4597 if ( alpha && width == 3 ) /* alpha version */
4599 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4603 sv_catpvs(sv, "000");
4611 Accepts a version object and returns the normalized string
4612 representation. Call like:
4616 NOTE: you can pass either the object directly or the SV
4617 contained within the RV.
4623 Perl_vnormal(pTHX_ SV *vs)
4627 SV * const sv = newSV(0);
4633 Perl_croak(aTHX_ "Invalid version object");
4635 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4637 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4645 digit = SvIV(*av_fetch(av, 0, 0));
4646 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4647 for ( i = 1 ; i < len ; i++ ) {
4648 digit = SvIV(*av_fetch(av, i, 0));
4649 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4654 /* handle last digit specially */
4655 digit = SvIV(*av_fetch(av, len, 0));
4657 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4659 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4662 if ( len <= 2 ) { /* short version, must be at least three */
4663 for ( len = 2 - len; len != 0; len-- )
4670 =for apidoc vstringify
4672 In order to maintain maximum compatibility with earlier versions
4673 of Perl, this function will return either the floating point
4674 notation or the multiple dotted notation, depending on whether
4675 the original version contained 1 or more dots, respectively
4681 Perl_vstringify(pTHX_ SV *vs)
4688 Perl_croak(aTHX_ "Invalid version object");
4690 pv = *hv_fetchs((HV*)vs, "original", FALSE);
4694 return &PL_sv_undef;
4700 Version object aware cmp. Both operands must already have been
4701 converted into version objects.
4707 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4710 bool lalpha = FALSE;
4711 bool ralpha = FALSE;
4720 if ( !vverify(lhv) )
4721 Perl_croak(aTHX_ "Invalid version object");
4723 if ( !vverify(rhv) )
4724 Perl_croak(aTHX_ "Invalid version object");
4726 /* get the left hand term */
4727 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4728 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4731 /* and the right hand term */
4732 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4733 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4741 while ( i <= m && retval == 0 )
4743 left = SvIV(*av_fetch(lav,i,0));
4744 right = SvIV(*av_fetch(rav,i,0));
4752 /* tiebreaker for alpha with identical terms */
4753 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4755 if ( lalpha && !ralpha )
4759 else if ( ralpha && !lalpha)
4765 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4769 while ( i <= r && retval == 0 )
4771 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4772 retval = -1; /* not a match after all */
4778 while ( i <= l && retval == 0 )
4780 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4781 retval = +1; /* not a match after all */
4789 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4790 # define EMULATE_SOCKETPAIR_UDP
4793 #ifdef EMULATE_SOCKETPAIR_UDP
4795 S_socketpair_udp (int fd[2]) {
4797 /* Fake a datagram socketpair using UDP to localhost. */
4798 int sockets[2] = {-1, -1};
4799 struct sockaddr_in addresses[2];
4801 Sock_size_t size = sizeof(struct sockaddr_in);
4802 unsigned short port;
4805 memset(&addresses, 0, sizeof(addresses));
4808 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4809 if (sockets[i] == -1)
4810 goto tidy_up_and_fail;
4812 addresses[i].sin_family = AF_INET;
4813 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4814 addresses[i].sin_port = 0; /* kernel choses port. */
4815 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4816 sizeof(struct sockaddr_in)) == -1)
4817 goto tidy_up_and_fail;
4820 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4821 for each connect the other socket to it. */
4824 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4826 goto tidy_up_and_fail;
4827 if (size != sizeof(struct sockaddr_in))
4828 goto abort_tidy_up_and_fail;
4829 /* !1 is 0, !0 is 1 */
4830 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4831 sizeof(struct sockaddr_in)) == -1)
4832 goto tidy_up_and_fail;
4835 /* Now we have 2 sockets connected to each other. I don't trust some other
4836 process not to have already sent a packet to us (by random) so send
4837 a packet from each to the other. */
4840 /* I'm going to send my own port number. As a short.
4841 (Who knows if someone somewhere has sin_port as a bitfield and needs
4842 this routine. (I'm assuming crays have socketpair)) */
4843 port = addresses[i].sin_port;
4844 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4845 if (got != sizeof(port)) {
4847 goto tidy_up_and_fail;
4848 goto abort_tidy_up_and_fail;
4852 /* Packets sent. I don't trust them to have arrived though.
4853 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4854 connect to localhost will use a second kernel thread. In 2.6 the
4855 first thread running the connect() returns before the second completes,
4856 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4857 returns 0. Poor programs have tripped up. One poor program's authors'
4858 had a 50-1 reverse stock split. Not sure how connected these were.)
4859 So I don't trust someone not to have an unpredictable UDP stack.
4863 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4864 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4868 FD_SET((unsigned int)sockets[0], &rset);
4869 FD_SET((unsigned int)sockets[1], &rset);
4871 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4872 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4873 || !FD_ISSET(sockets[1], &rset)) {
4874 /* I hope this is portable and appropriate. */
4876 goto tidy_up_and_fail;
4877 goto abort_tidy_up_and_fail;
4881 /* And the paranoia department even now doesn't trust it to have arrive
4882 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4884 struct sockaddr_in readfrom;
4885 unsigned short buffer[2];
4890 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4891 sizeof(buffer), MSG_DONTWAIT,
4892 (struct sockaddr *) &readfrom, &size);
4894 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4896 (struct sockaddr *) &readfrom, &size);
4900 goto tidy_up_and_fail;
4901 if (got != sizeof(port)
4902 || size != sizeof(struct sockaddr_in)
4903 /* Check other socket sent us its port. */
4904 || buffer[0] != (unsigned short) addresses[!i].sin_port
4905 /* Check kernel says we got the datagram from that socket */
4906 || readfrom.sin_family != addresses[!i].sin_family
4907 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4908 || readfrom.sin_port != addresses[!i].sin_port)
4909 goto abort_tidy_up_and_fail;
4912 /* My caller (my_socketpair) has validated that this is non-NULL */
4915 /* I hereby declare this connection open. May God bless all who cross
4919 abort_tidy_up_and_fail:
4920 errno = ECONNABORTED;
4923 const int save_errno = errno;
4924 if (sockets[0] != -1)
4925 PerlLIO_close(sockets[0]);
4926 if (sockets[1] != -1)
4927 PerlLIO_close(sockets[1]);
4932 #endif /* EMULATE_SOCKETPAIR_UDP */
4934 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4936 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4937 /* Stevens says that family must be AF_LOCAL, protocol 0.
4938 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4943 struct sockaddr_in listen_addr;
4944 struct sockaddr_in connect_addr;
4949 || family != AF_UNIX
4952 errno = EAFNOSUPPORT;
4960 #ifdef EMULATE_SOCKETPAIR_UDP
4961 if (type == SOCK_DGRAM)
4962 return S_socketpair_udp(fd);
4965 listener = PerlSock_socket(AF_INET, type, 0);
4968 memset(&listen_addr, 0, sizeof(listen_addr));
4969 listen_addr.sin_family = AF_INET;
4970 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4971 listen_addr.sin_port = 0; /* kernel choses port. */
4972 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4973 sizeof(listen_addr)) == -1)
4974 goto tidy_up_and_fail;
4975 if (PerlSock_listen(listener, 1) == -1)
4976 goto tidy_up_and_fail;
4978 connector = PerlSock_socket(AF_INET, type, 0);
4979 if (connector == -1)
4980 goto tidy_up_and_fail;
4981 /* We want to find out the port number to connect to. */
4982 size = sizeof(connect_addr);
4983 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4985 goto tidy_up_and_fail;
4986 if (size != sizeof(connect_addr))
4987 goto abort_tidy_up_and_fail;
4988 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4989 sizeof(connect_addr)) == -1)
4990 goto tidy_up_and_fail;
4992 size = sizeof(listen_addr);
4993 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4996 goto tidy_up_and_fail;
4997 if (size != sizeof(listen_addr))
4998 goto abort_tidy_up_and_fail;
4999 PerlLIO_close(listener);
5000 /* Now check we are talking to ourself by matching port and host on the
5002 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
5004 goto tidy_up_and_fail;
5005 if (size != sizeof(connect_addr)
5006 || listen_addr.sin_family != connect_addr.sin_family
5007 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
5008 || listen_addr.sin_port != connect_addr.sin_port) {
5009 goto abort_tidy_up_and_fail;
5015 abort_tidy_up_and_fail:
5017 errno = ECONNABORTED; /* This would be the standard thing to do. */
5019 # ifdef ECONNREFUSED
5020 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
5022 errno = ETIMEDOUT; /* Desperation time. */
5027 const int save_errno = errno;
5029 PerlLIO_close(listener);
5030 if (connector != -1)
5031 PerlLIO_close(connector);
5033 PerlLIO_close(acceptor);
5039 /* In any case have a stub so that there's code corresponding
5040 * to the my_socketpair in global.sym. */
5042 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
5043 #ifdef HAS_SOCKETPAIR
5044 return socketpair(family, type, protocol, fd);
5053 =for apidoc sv_nosharing
5055 Dummy routine which "shares" an SV when there is no sharing module present.
5056 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
5057 Exists to avoid test for a NULL function pointer and because it could
5058 potentially warn under some level of strict-ness.
5064 Perl_sv_nosharing(pTHX_ SV *sv)
5066 PERL_UNUSED_CONTEXT;
5067 PERL_UNUSED_ARG(sv);
5071 Perl_parse_unicode_opts(pTHX_ const char **popt)
5073 const char *p = *popt;
5078 opt = (U32) atoi(p);
5081 if (*p && *p != '\n' && *p != '\r')
5082 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5087 case PERL_UNICODE_STDIN:
5088 opt |= PERL_UNICODE_STDIN_FLAG; break;
5089 case PERL_UNICODE_STDOUT:
5090 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5091 case PERL_UNICODE_STDERR:
5092 opt |= PERL_UNICODE_STDERR_FLAG; break;
5093 case PERL_UNICODE_STD:
5094 opt |= PERL_UNICODE_STD_FLAG; break;
5095 case PERL_UNICODE_IN:
5096 opt |= PERL_UNICODE_IN_FLAG; break;
5097 case PERL_UNICODE_OUT:
5098 opt |= PERL_UNICODE_OUT_FLAG; break;
5099 case PERL_UNICODE_INOUT:
5100 opt |= PERL_UNICODE_INOUT_FLAG; break;
5101 case PERL_UNICODE_LOCALE:
5102 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5103 case PERL_UNICODE_ARGV:
5104 opt |= PERL_UNICODE_ARGV_FLAG; break;
5105 case PERL_UNICODE_UTF8CACHEASSERT:
5106 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5108 if (*p != '\n' && *p != '\r')
5110 "Unknown Unicode option letter '%c'", *p);
5116 opt = PERL_UNICODE_DEFAULT_FLAGS;
5118 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5119 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5120 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5132 * This is really just a quick hack which grabs various garbage
5133 * values. It really should be a real hash algorithm which
5134 * spreads the effect of every input bit onto every output bit,
5135 * if someone who knows about such things would bother to write it.
5136 * Might be a good idea to add that function to CORE as well.
5137 * No numbers below come from careful analysis or anything here,
5138 * except they are primes and SEED_C1 > 1E6 to get a full-width
5139 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5140 * probably be bigger too.
5143 # define SEED_C1 1000003
5144 #define SEED_C4 73819
5146 # define SEED_C1 25747
5147 #define SEED_C4 20639
5151 #define SEED_C5 26107
5153 #ifndef PERL_NO_DEV_RANDOM
5158 # include <starlet.h>
5159 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5160 * in 100-ns units, typically incremented ever 10 ms. */
5161 unsigned int when[2];
5163 # ifdef HAS_GETTIMEOFDAY
5164 struct timeval when;
5170 /* This test is an escape hatch, this symbol isn't set by Configure. */
5171 #ifndef PERL_NO_DEV_RANDOM
5172 #ifndef PERL_RANDOM_DEVICE
5173 /* /dev/random isn't used by default because reads from it will block
5174 * if there isn't enough entropy available. You can compile with
5175 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5176 * is enough real entropy to fill the seed. */
5177 # define PERL_RANDOM_DEVICE "/dev/urandom"
5179 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5181 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5190 _ckvmssts(sys$gettim(when));
5191 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5193 # ifdef HAS_GETTIMEOFDAY
5194 PerlProc_gettimeofday(&when,NULL);
5195 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5198 u = (U32)SEED_C1 * when;
5201 u += SEED_C3 * (U32)PerlProc_getpid();
5202 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5203 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5204 u += SEED_C5 * (U32)PTR2UV(&when);
5210 Perl_get_hash_seed(pTHX)
5213 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5219 if (s && isDIGIT(*s))
5220 myseed = (UV)Atoul(s);
5222 #ifdef USE_HASH_SEED_EXPLICIT
5226 /* Compute a random seed */
5227 (void)seedDrand01((Rand_seed_t)seed());
5228 myseed = (UV)(Drand01() * (NV)UV_MAX);
5229 #if RANDBITS < (UVSIZE * 8)
5230 /* Since there are not enough randbits to to reach all
5231 * the bits of a UV, the low bits might need extra
5232 * help. Sum in another random number that will
5233 * fill in the low bits. */
5235 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5236 #endif /* RANDBITS < (UVSIZE * 8) */
5237 if (myseed == 0) { /* Superparanoia. */
5238 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5240 Perl_croak(aTHX_ "Your random numbers are not that random");
5243 PL_rehash_seed_set = TRUE;
5250 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5252 const char * const stashpv = CopSTASHPV(c);
5253 const char * const name = HvNAME_get(hv);
5254 PERL_UNUSED_CONTEXT;
5256 if (stashpv == name)
5258 if (stashpv && name)
5259 if (strEQ(stashpv, name))
5266 #ifdef PERL_GLOBAL_STRUCT
5268 #define PERL_GLOBAL_STRUCT_INIT
5269 #include "opcode.h" /* the ppaddr and check */
5272 Perl_init_global_struct(pTHX)
5274 struct perl_vars *plvarsp = NULL;
5275 # ifdef PERL_GLOBAL_STRUCT
5276 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5277 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5278 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5279 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5280 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5284 plvarsp = PL_VarsPtr;
5285 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5291 # define PERLVAR(var,type) /**/
5292 # define PERLVARA(var,n,type) /**/
5293 # define PERLVARI(var,type,init) plvarsp->var = init;
5294 # define PERLVARIC(var,type,init) plvarsp->var = init;
5295 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5296 # include "perlvars.h"
5302 # ifdef PERL_GLOBAL_STRUCT
5305 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5306 if (!plvarsp->Gppaddr)
5310 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5311 if (!plvarsp->Gcheck)
5313 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5314 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5316 # ifdef PERL_SET_VARS
5317 PERL_SET_VARS(plvarsp);
5319 # undef PERL_GLOBAL_STRUCT_INIT
5324 #endif /* PERL_GLOBAL_STRUCT */
5326 #ifdef PERL_GLOBAL_STRUCT
5329 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5331 # ifdef PERL_GLOBAL_STRUCT
5332 # ifdef PERL_UNSET_VARS
5333 PERL_UNSET_VARS(plvarsp);
5335 free(plvarsp->Gppaddr);
5336 free(plvarsp->Gcheck);
5337 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5343 #endif /* PERL_GLOBAL_STRUCT */
5348 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5350 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5351 * variable PERL_MEM_LOG will be consulted, and if the integer value
5352 * of that is true, the logging will happen. (The default is to
5353 * always log if the PERL_MEM_LOG define was in effect.)
5357 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5358 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5360 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5363 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5364 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5365 * in which case the environment variable PERL_MEM_LOG_FD will be
5366 * consulted for the file descriptor number to use.
5368 #ifndef PERL_MEM_LOG_FD
5369 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5373 Perl_mem_log_alloc(const UV n, const UV typesize, const char *typename, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5375 #ifdef PERL_MEM_LOG_STDERR
5376 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5379 # ifdef PERL_MEM_LOG_ENV
5380 s = getenv("PERL_MEM_LOG");
5381 if (s ? atoi(s) : 0)
5384 /* We can't use SVs or PerlIO for obvious reasons,
5385 * so we'll use stdio and low-level IO instead. */
5386 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5387 # ifdef PERL_MEM_LOG_TIMESTAMP
5389 # ifdef HAS_GETTIMEOFDAY
5390 gettimeofday(&tv, 0);
5392 /* If there are other OS specific ways of hires time than
5393 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5394 * probably that they would be used to fill in the struct
5401 # ifdef PERL_MEM_LOG_TIMESTAMP
5404 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5405 " %s = %"IVdf": %"UVxf"\n",
5406 # ifdef PERL_MEM_LOG_TIMESTAMP
5407 (int)tv.tv_sec, (int)tv.tv_usec,
5409 filename, linenumber, funcname, n, typesize,
5410 typename, n * typesize, PTR2UV(newalloc));
5411 # ifdef PERL_MEM_LOG_ENV_FD
5412 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5413 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5415 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5424 Perl_mem_log_realloc(const UV n, const UV typesize, const char *typename, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
5426 #ifdef PERL_MEM_LOG_STDERR
5427 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5430 # ifdef PERL_MEM_LOG_ENV
5431 s = PerlEnv_getenv("PERL_MEM_LOG");
5432 if (s ? atoi(s) : 0)
5435 /* We can't use SVs or PerlIO for obvious reasons,
5436 * so we'll use stdio and low-level IO instead. */
5437 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5438 # ifdef PERL_MEM_LOG_TIMESTAMP
5440 gettimeofday(&tv, 0);
5446 # ifdef PERL_MEM_LOG_TIMESTAMP
5449 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5450 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5451 # ifdef PERL_MEM_LOG_TIMESTAMP
5452 (int)tv.tv_sec, (int)tv.tv_usec,
5454 filename, linenumber, funcname, n, typesize,
5455 typename, n * typesize, PTR2UV(oldalloc),
5457 # ifdef PERL_MEM_LOG_ENV_FD
5458 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5459 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5461 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5470 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5472 #ifdef PERL_MEM_LOG_STDERR
5473 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5476 # ifdef PERL_MEM_LOG_ENV
5477 s = PerlEnv_getenv("PERL_MEM_LOG");
5478 if (s ? atoi(s) : 0)
5481 /* We can't use SVs or PerlIO for obvious reasons,
5482 * so we'll use stdio and low-level IO instead. */
5483 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5484 # ifdef PERL_MEM_LOG_TIMESTAMP
5486 gettimeofday(&tv, 0);
5492 # ifdef PERL_MEM_LOG_TIMESTAMP
5495 "free: %s:%d:%s: %"UVxf"\n",
5496 # ifdef PERL_MEM_LOG_TIMESTAMP
5497 (int)tv.tv_sec, (int)tv.tv_usec,
5499 filename, linenumber, funcname,
5501 # ifdef PERL_MEM_LOG_ENV_FD
5502 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5503 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5505 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5513 #endif /* PERL_MEM_LOG */
5516 =for apidoc my_sprintf
5518 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5519 the length of the string written to the buffer. Only rare pre-ANSI systems
5520 need the wrapper function - usually this is a direct call to C<sprintf>.
5524 #ifndef SPRINTF_RETURNS_STRLEN
5526 Perl_my_sprintf(char *buffer, const char* pat, ...)
5529 va_start(args, pat);
5530 vsprintf(buffer, pat, args);
5532 return strlen(buffer);
5537 =for apidoc my_snprintf
5539 The C library C<snprintf> functionality, if available and
5540 standards-compliant (uses C<vsnprintf>, actually). However, if the
5541 C<vsnprintf> is not available, will unfortunately use the unsafe
5542 C<vsprintf> which can overrun the buffer (there is an overrun check,
5543 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5544 getting C<vsnprintf>.
5549 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5554 va_start(ap, format);
5555 #ifdef HAS_VSNPRINTF
5556 retval = vsnprintf(buffer, len, format, ap);
5558 retval = vsprintf(buffer, format, ap);
5561 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5562 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5563 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5568 =for apidoc my_vsnprintf
5570 The C library C<vsnprintf> if available and standards-compliant.
5571 However, if if the C<vsnprintf> is not available, will unfortunately
5572 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5573 overrun check, but that may be too late). Consider using
5574 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5579 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5585 Perl_va_copy(ap, apc);
5586 # ifdef HAS_VSNPRINTF
5587 retval = vsnprintf(buffer, len, format, apc);
5589 retval = vsprintf(buffer, format, apc);
5592 # ifdef HAS_VSNPRINTF
5593 retval = vsnprintf(buffer, len, format, ap);
5595 retval = vsprintf(buffer, format, ap);
5597 #endif /* #ifdef NEED_VA_COPY */
5598 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5599 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5600 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5605 Perl_my_clearenv(pTHX)
5608 #if ! defined(PERL_MICRO)
5609 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5611 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5612 # if defined(USE_ENVIRON_ARRAY)
5613 # if defined(USE_ITHREADS)
5614 /* only the parent thread can clobber the process environment */
5615 if (PL_curinterp == aTHX)
5616 # endif /* USE_ITHREADS */
5618 # if ! defined(PERL_USE_SAFE_PUTENV)
5619 if ( !PL_use_safe_putenv) {
5621 if (environ == PL_origenviron)
5622 environ = (char**)safesysmalloc(sizeof(char*));
5624 for (i = 0; environ[i]; i++)
5625 (void)safesysfree(environ[i]);
5628 # else /* PERL_USE_SAFE_PUTENV */
5629 # if defined(HAS_CLEARENV)
5631 # elif defined(HAS_UNSETENV)
5632 int bsiz = 80; /* Most envvar names will be shorter than this. */
5633 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5634 char *buf = (char*)safesysmalloc(bufsiz);
5635 while (*environ != NULL) {
5636 char *e = strchr(*environ, '=');
5637 int l = e ? e - *environ : (int)strlen(*environ);
5639 (void)safesysfree(buf);
5640 bsiz = l + 1; /* + 1 for the \0. */
5641 buf = (char*)safesysmalloc(bufsiz);
5643 my_strlcpy(buf, *environ, l + 1);
5644 (void)unsetenv(buf);
5646 (void)safesysfree(buf);
5647 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5648 /* Just null environ and accept the leakage. */
5650 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5651 # endif /* ! PERL_USE_SAFE_PUTENV */
5653 # endif /* USE_ENVIRON_ARRAY */
5654 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5655 #endif /* PERL_MICRO */
5658 #ifdef PERL_IMPLICIT_CONTEXT
5660 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5661 the global PL_my_cxt_index is incremented, and that value is assigned to
5662 that module's static my_cxt_index (who's address is passed as an arg).
5663 Then, for each interpreter this function is called for, it makes sure a
5664 void* slot is available to hang the static data off, by allocating or
5665 extending the interpreter's PL_my_cxt_list array */
5667 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5669 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5674 /* this module hasn't been allocated an index yet */
5675 MUTEX_LOCK(&PL_my_ctx_mutex);
5676 *index = PL_my_cxt_index++;
5677 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5680 /* make sure the array is big enough */
5681 if (PL_my_cxt_size <= *index) {
5682 if (PL_my_cxt_size) {
5683 while (PL_my_cxt_size <= *index)
5684 PL_my_cxt_size *= 2;
5685 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5688 PL_my_cxt_size = 16;
5689 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5692 /* newSV() allocates one more than needed */
5693 p = (void*)SvPVX(newSV(size-1));
5694 PL_my_cxt_list[*index] = p;
5695 Zero(p, size, char);
5699 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5702 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5707 for (index = 0; index < PL_my_cxt_index; index++) {
5708 const char *key = PL_my_cxt_keys[index];
5709 /* try direct pointer compare first - there are chances to success,
5710 * and it's much faster.
5712 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5719 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5725 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5727 /* this module hasn't been allocated an index yet */
5728 MUTEX_LOCK(&PL_my_ctx_mutex);
5729 index = PL_my_cxt_index++;
5730 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5733 /* make sure the array is big enough */
5734 if (PL_my_cxt_size <= index) {
5735 int old_size = PL_my_cxt_size;
5737 if (PL_my_cxt_size) {
5738 while (PL_my_cxt_size <= index)
5739 PL_my_cxt_size *= 2;
5740 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5741 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5744 PL_my_cxt_size = 16;
5745 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5746 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5748 for (i = old_size; i < PL_my_cxt_size; i++) {
5749 PL_my_cxt_keys[i] = 0;
5750 PL_my_cxt_list[i] = 0;
5753 PL_my_cxt_keys[index] = my_cxt_key;
5754 /* newSV() allocates one more than needed */
5755 p = (void*)SvPVX(newSV(size-1));
5756 PL_my_cxt_list[index] = p;
5757 Zero(p, size, char);
5760 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5761 #endif /* PERL_IMPLICIT_CONTEXT */
5765 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5767 Size_t used, length, copy;
5770 length = strlen(src);
5771 if (size > 0 && used < size - 1) {
5772 copy = (length >= size - used) ? size - used - 1 : length;
5773 memcpy(dst + used, src, copy);
5774 dst[used + copy] = '\0';
5776 return used + length;
5782 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5784 Size_t length, copy;
5786 length = strlen(src);
5788 copy = (length >= size) ? size - 1 : length;
5789 memcpy(dst, src, copy);
5796 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5797 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5798 long _ftol( double ); /* Defined by VC6 C libs. */
5799 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5803 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5806 SV * const dbsv = GvSVn(PL_DBsub);
5807 /* We do not care about using sv to call CV;
5808 * it's for informational purposes only.
5812 if (!PERLDB_SUB_NN) {
5813 GV * const gv = CvGV(cv);
5815 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5816 || strEQ(GvNAME(gv), "END")
5817 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5818 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5819 /* Use GV from the stack as a fallback. */
5820 /* GV is potentially non-unique, or contain different CV. */
5821 SV * const tmp = newRV((SV*)cv);
5822 sv_setsv(dbsv, tmp);
5826 gv_efullname3(dbsv, gv, NULL);
5830 const int type = SvTYPE(dbsv);
5831 if (type < SVt_PVIV && type != SVt_IV)
5832 sv_upgrade(dbsv, SVt_PVIV);
5833 (void)SvIOK_on(dbsv);
5834 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5839 Perl_my_dirfd(pTHX_ DIR * dir) {
5841 /* Most dirfd implementations have problems when passed NULL. */
5846 #elif defined(HAS_DIR_DD_FD)
5849 Perl_die(aTHX_ PL_no_func, "dirfd");
5857 * c-indentation-style: bsd
5859 * indent-tabs-mode: t
5862 * ex: set ts=8 sts=4 sw=4 noet: