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 const MEM_SIZE total_size = size * count
262 #ifdef PERL_TRACK_MEMPOOL
268 if (total_size > 0xffff) {
269 PerlIO_printf(Perl_error_log,
270 "Allocation too large: %lx\n", total_size) FLUSH;
273 #endif /* HAS_64K_LIMIT */
275 if ((long)size < 0 || (long)count < 0)
276 Perl_croak_nocontext("panic: calloc");
278 #ifdef PERL_TRACK_MEMPOOL
279 /* Have to use malloc() because we've added some space for our tracking
281 ptr = (Malloc_t)PerlMem_malloc(total_size);
283 /* Use calloc() because it might save a memset() if the memory is fresh
284 and clean from the OS. */
285 ptr = (Malloc_t)PerlMem_calloc(count, size);
287 PERL_ALLOC_CHECK(ptr);
288 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));
290 #ifdef PERL_TRACK_MEMPOOL
292 struct perl_memory_debug_header *const header
293 = (struct perl_memory_debug_header *)ptr;
295 memset((void*)ptr, 0, total_size);
296 header->interpreter = aTHX;
297 /* Link us into the list. */
298 header->prev = &PL_memory_debug_header;
299 header->next = PL_memory_debug_header.next;
300 PL_memory_debug_header.next = header;
301 header->next->prev = header;
303 header->size = total_size;
305 ptr = (Malloc_t)((char*)ptr+sTHX);
312 return write_no_mem();
315 /* These must be defined when not using Perl's malloc for binary
320 Malloc_t Perl_malloc (MEM_SIZE nbytes)
323 return (Malloc_t)PerlMem_malloc(nbytes);
326 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
329 return (Malloc_t)PerlMem_calloc(elements, size);
332 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
335 return (Malloc_t)PerlMem_realloc(where, nbytes);
338 Free_t Perl_mfree (Malloc_t where)
346 /* copy a string up to some (non-backslashed) delimiter, if any */
349 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
354 for (tolen = 0; from < fromend; from++, tolen++) {
356 if (from[1] != delim) {
363 else if (*from == delim)
374 /* return ptr to little string in big string, NULL if not found */
375 /* This routine was donated by Corey Satten. */
378 Perl_instr(pTHX_ register const char *big, register const char *little)
389 register const char *s, *x;
392 for (x=big,s=little; *s; /**/ ) {
403 return (char*)(big-1);
408 /* same as instr but allow embedded nulls */
411 Perl_ninstr(pTHX_ const char *big, const char *bigend, const char *little, const char *lend)
417 char first = *little++;
419 bigend -= lend - little;
421 while (big <= bigend) {
424 for (x=big,s=little; s < lend; x++,s++) {
428 return (char*)(big-1);
434 /* reverse of the above--find last substring */
437 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
439 register const char *bigbeg;
440 register const I32 first = *little;
441 register const char * const littleend = lend;
444 if (little >= littleend)
445 return (char*)bigend;
447 big = bigend - (littleend - little++);
448 while (big >= bigbeg) {
449 register const char *s, *x;
452 for (x=big+2,s=little; s < littleend; /**/ ) {
461 return (char*)(big+1);
466 /* As a space optimization, we do not compile tables for strings of length
467 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
468 special-cased in fbm_instr().
470 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
473 =head1 Miscellaneous Functions
475 =for apidoc fbm_compile
477 Analyses the string in order to make fast searches on it using fbm_instr()
478 -- the Boyer-Moore algorithm.
484 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
487 register const U8 *s;
493 if (flags & FBMcf_TAIL) {
494 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
495 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
496 if (mg && mg->mg_len >= 0)
499 s = (U8*)SvPV_force_mutable(sv, len);
500 if (len == 0) /* TAIL might be on a zero-length string. */
502 SvUPGRADE(sv, SVt_PVGV);
507 const unsigned char *sb;
508 const U8 mlen = (len>255) ? 255 : (U8)len;
511 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
513 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
514 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
515 memset((void*)table, mlen, 256);
517 sb = s - mlen + 1; /* first char (maybe) */
519 if (table[*s] == mlen)
524 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
526 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
528 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
529 for (i = 0; i < len; i++) {
530 if (PL_freq[s[i]] < frequency) {
532 frequency = PL_freq[s[i]];
535 BmFLAGS(sv) = (U8)flags;
536 BmRARE(sv) = s[rarest];
537 BmPREVIOUS(sv) = rarest;
538 BmUSEFUL(sv) = 100; /* Initial value */
539 if (flags & FBMcf_TAIL)
541 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
542 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
545 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
546 /* If SvTAIL is actually due to \Z or \z, this gives false positives
550 =for apidoc fbm_instr
552 Returns the location of the SV in the string delimited by C<str> and
553 C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
554 does not have to be fbm_compiled, but the search will not be as fast
561 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
563 register unsigned char *s;
565 register const unsigned char *little
566 = (const unsigned char *)SvPV_const(littlestr,l);
567 register STRLEN littlelen = l;
568 register const I32 multiline = flags & FBMrf_MULTILINE;
570 if ((STRLEN)(bigend - big) < littlelen) {
571 if ( SvTAIL(littlestr)
572 && ((STRLEN)(bigend - big) == littlelen - 1)
574 || (*big == *little &&
575 memEQ((char *)big, (char *)little, littlelen - 1))))
580 if (littlelen <= 2) { /* Special-cased */
582 if (littlelen == 1) {
583 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
584 /* Know that bigend != big. */
585 if (bigend[-1] == '\n')
586 return (char *)(bigend - 1);
587 return (char *) bigend;
595 if (SvTAIL(littlestr))
596 return (char *) bigend;
600 return (char*)big; /* Cannot be SvTAIL! */
603 if (SvTAIL(littlestr) && !multiline) {
604 if (bigend[-1] == '\n' && bigend[-2] == *little)
605 return (char*)bigend - 2;
606 if (bigend[-1] == *little)
607 return (char*)bigend - 1;
611 /* This should be better than FBM if c1 == c2, and almost
612 as good otherwise: maybe better since we do less indirection.
613 And we save a lot of memory by caching no table. */
614 const unsigned char c1 = little[0];
615 const unsigned char c2 = little[1];
620 while (s <= bigend) {
630 goto check_1char_anchor;
641 goto check_1char_anchor;
644 while (s <= bigend) {
649 goto check_1char_anchor;
658 check_1char_anchor: /* One char and anchor! */
659 if (SvTAIL(littlestr) && (*bigend == *little))
660 return (char *)bigend; /* bigend is already decremented. */
663 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
664 s = bigend - littlelen;
665 if (s >= big && bigend[-1] == '\n' && *s == *little
666 /* Automatically of length > 2 */
667 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
669 return (char*)s; /* how sweet it is */
672 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
674 return (char*)s + 1; /* how sweet it is */
678 if (!SvVALID(littlestr)) {
679 char * const b = ninstr((char*)big,(char*)bigend,
680 (char*)little, (char*)little + littlelen);
682 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
683 /* Chop \n from littlestr: */
684 s = bigend - littlelen + 1;
686 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
696 if (littlelen > (STRLEN)(bigend - big))
700 register const unsigned char * const table
701 = little + littlelen + PERL_FBM_TABLE_OFFSET;
702 register const unsigned char *oldlittle;
704 --littlelen; /* Last char found by table lookup */
707 little += littlelen; /* last char */
713 if ((tmp = table[*s])) {
714 if ((s += tmp) < bigend)
718 else { /* less expensive than calling strncmp() */
719 register unsigned char * const olds = s;
724 if (*--s == *--little)
726 s = olds + 1; /* here we pay the price for failure */
728 if (s < bigend) /* fake up continue to outer loop */
737 && (BmFLAGS(littlestr) & FBMcf_TAIL)
738 && memEQ((char *)(bigend - littlelen),
739 (char *)(oldlittle - littlelen), littlelen) )
740 return (char*)bigend - littlelen;
745 /* start_shift, end_shift are positive quantities which give offsets
746 of ends of some substring of bigstr.
747 If "last" we want the last occurrence.
748 old_posp is the way of communication between consequent calls if
749 the next call needs to find the .
750 The initial *old_posp should be -1.
752 Note that we take into account SvTAIL, so one can get extra
753 optimizations if _ALL flag is set.
756 /* If SvTAIL is actually due to \Z or \z, this gives false positives
757 if PL_multiline. In fact if !PL_multiline the authoritative answer
758 is not supported yet. */
761 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
764 register const unsigned char *big;
766 register I32 previous;
768 register const unsigned char *little;
769 register I32 stop_pos;
770 register const unsigned char *littleend;
773 assert(SvTYPE(littlestr) == SVt_PVGV);
774 assert(SvVALID(littlestr));
777 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
778 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
780 if ( BmRARE(littlestr) == '\n'
781 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
782 little = (const unsigned char *)(SvPVX_const(littlestr));
783 littleend = little + SvCUR(littlestr);
790 little = (const unsigned char *)(SvPVX_const(littlestr));
791 littleend = little + SvCUR(littlestr);
793 /* The value of pos we can start at: */
794 previous = BmPREVIOUS(littlestr);
795 big = (const unsigned char *)(SvPVX_const(bigstr));
796 /* The value of pos we can stop at: */
797 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
798 if (previous + start_shift > stop_pos) {
800 stop_pos does not include SvTAIL in the count, so this check is incorrect
801 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
804 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
809 while (pos < previous + start_shift) {
810 if (!(pos += PL_screamnext[pos]))
815 register const unsigned char *s, *x;
816 if (pos >= stop_pos) break;
817 if (big[pos] != first)
819 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
825 if (s == littleend) {
827 if (!last) return (char *)(big+pos);
830 } while ( pos += PL_screamnext[pos] );
832 return (char *)(big+(*old_posp));
834 if (!SvTAIL(littlestr) || (end_shift > 0))
836 /* Ignore the trailing "\n". This code is not microoptimized */
837 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
838 stop_pos = littleend - little; /* Actual littlestr len */
843 && ((stop_pos == 1) ||
844 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
850 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
852 register const U8 *a = (const U8 *)s1;
853 register const U8 *b = (const U8 *)s2;
857 if (*a != *b && *a != PL_fold[*b])
865 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
868 register const U8 *a = (const U8 *)s1;
869 register const U8 *b = (const U8 *)s2;
873 if (*a != *b && *a != PL_fold_locale[*b])
880 /* copy a string to a safe spot */
883 =head1 Memory Management
887 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
888 string which is a duplicate of C<pv>. The size of the string is
889 determined by C<strlen()>. The memory allocated for the new string can
890 be freed with the C<Safefree()> function.
896 Perl_savepv(pTHX_ const char *pv)
903 const STRLEN pvlen = strlen(pv)+1;
904 Newx(newaddr, pvlen, char);
905 return (char*)memcpy(newaddr, pv, pvlen);
909 /* same thing but with a known length */
914 Perl's version of what C<strndup()> would be if it existed. Returns a
915 pointer to a newly allocated string which is a duplicate of the first
916 C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
917 the new string can be freed with the C<Safefree()> function.
923 Perl_savepvn(pTHX_ const char *pv, register I32 len)
925 register char *newaddr;
928 Newx(newaddr,len+1,char);
929 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
931 /* might not be null terminated */
933 return (char *) CopyD(pv,newaddr,len,char);
936 return (char *) ZeroD(newaddr,len+1,char);
941 =for apidoc savesharedpv
943 A version of C<savepv()> which allocates the duplicate string in memory
944 which is shared between threads.
949 Perl_savesharedpv(pTHX_ const char *pv)
951 register char *newaddr;
956 pvlen = strlen(pv)+1;
957 newaddr = (char*)PerlMemShared_malloc(pvlen);
959 return write_no_mem();
961 return (char*)memcpy(newaddr, pv, pvlen);
965 =for apidoc savesharedpvn
967 A version of C<savepvn()> which allocates the duplicate string in memory
968 which is shared between threads. (With the specific difference that a NULL
969 pointer is not acceptable)
974 Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
976 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
979 return write_no_mem();
982 return (char*)memcpy(newaddr, pv, len);
988 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
989 the passed in SV using C<SvPV()>
995 Perl_savesvpv(pTHX_ SV *sv)
998 const char * const pv = SvPV_const(sv, len);
999 register char *newaddr;
1002 Newx(newaddr,len,char);
1003 return (char *) CopyD(pv,newaddr,len,char);
1007 /* the SV for Perl_form() and mess() is not kept in an arena */
1017 return sv_2mortal(newSVpvs(""));
1022 /* Create as PVMG now, to avoid any upgrading later */
1024 Newxz(any, 1, XPVMG);
1025 SvFLAGS(sv) = SVt_PVMG;
1026 SvANY(sv) = (void*)any;
1028 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1033 #if defined(PERL_IMPLICIT_CONTEXT)
1035 Perl_form_nocontext(const char* pat, ...)
1040 va_start(args, pat);
1041 retval = vform(pat, &args);
1045 #endif /* PERL_IMPLICIT_CONTEXT */
1048 =head1 Miscellaneous Functions
1051 Takes a sprintf-style format pattern and conventional
1052 (non-SV) arguments and returns the formatted string.
1054 (char *) Perl_form(pTHX_ const char* pat, ...)
1056 can be used any place a string (char *) is required:
1058 char * s = Perl_form("%d.%d",major,minor);
1060 Uses a single private buffer so if you want to format several strings you
1061 must explicitly copy the earlier strings away (and free the copies when you
1068 Perl_form(pTHX_ const char* pat, ...)
1072 va_start(args, pat);
1073 retval = vform(pat, &args);
1079 Perl_vform(pTHX_ const char *pat, va_list *args)
1081 SV * const sv = mess_alloc();
1082 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1086 #if defined(PERL_IMPLICIT_CONTEXT)
1088 Perl_mess_nocontext(const char *pat, ...)
1093 va_start(args, pat);
1094 retval = vmess(pat, &args);
1098 #endif /* PERL_IMPLICIT_CONTEXT */
1101 Perl_mess(pTHX_ const char *pat, ...)
1105 va_start(args, pat);
1106 retval = vmess(pat, &args);
1112 S_closest_cop(pTHX_ const COP *cop, const OP *o)
1115 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1117 if (!o || o == PL_op)
1120 if (o->op_flags & OPf_KIDS) {
1122 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1125 /* If the OP_NEXTSTATE has been optimised away we can still use it
1126 * the get the file and line number. */
1128 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
1129 cop = (const COP *)kid;
1131 /* Keep searching, and return when we've found something. */
1133 new_cop = closest_cop(cop, kid);
1139 /* Nothing found. */
1145 Perl_vmess(pTHX_ const char *pat, va_list *args)
1148 SV * const sv = mess_alloc();
1150 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
1151 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1153 * Try and find the file and line for PL_op. This will usually be
1154 * PL_curcop, but it might be a cop that has been optimised away. We
1155 * can try to find such a cop by searching through the optree starting
1156 * from the sibling of PL_curcop.
1159 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1164 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1165 OutCopFILE(cop), (IV)CopLINE(cop));
1166 /* Seems that GvIO() can be untrustworthy during global destruction. */
1167 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1168 && IoLINES(GvIOp(PL_last_in_gv)))
1170 const bool line_mode = (RsSIMPLE(PL_rs) &&
1171 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1172 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1173 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1174 line_mode ? "line" : "chunk",
1175 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1178 sv_catpvs(sv, " during global destruction");
1179 sv_catpvs(sv, ".\n");
1185 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1191 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1192 && (io = GvIO(PL_stderrgv))
1193 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1200 SAVESPTR(PL_stderrgv);
1203 PUSHSTACKi(PERLSI_MAGIC);
1207 PUSHs(SvTIED_obj((SV*)io, mg));
1208 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1210 call_method("PRINT", G_SCALAR);
1218 /* SFIO can really mess with your errno */
1219 const int e = errno;
1221 PerlIO * const serr = Perl_error_log;
1223 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1224 (void)PerlIO_flush(serr);
1231 /* Common code used by vcroak, vdie, vwarn and vwarner */
1234 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
1240 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1241 /* sv_2cv might call Perl_croak() or Perl_warner() */
1242 SV * const oldhook = *hook;
1249 cv = sv_2cv(oldhook, &stash, &gv, 0);
1251 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1261 if (warn || message) {
1262 msg = newSVpvn(message, msglen);
1263 SvFLAGS(msg) |= utf8;
1271 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
1275 call_sv((SV*)cv, G_DISCARD);
1284 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1288 const char *message;
1291 SV * const msv = vmess(pat, args);
1292 if (PL_errors && SvCUR(PL_errors)) {
1293 sv_catsv(PL_errors, msv);
1294 message = SvPV_const(PL_errors, *msglen);
1295 SvCUR_set(PL_errors, 0);
1298 message = SvPV_const(msv,*msglen);
1299 *utf8 = SvUTF8(msv);
1305 DEBUG_S(PerlIO_printf(Perl_debug_log,
1306 "%p: die/croak: message = %s\ndiehook = %p\n",
1307 (void*)thr, message, (void*)PL_diehook));
1309 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
1315 Perl_vdie(pTHX_ const char* pat, va_list *args)
1318 const char *message;
1319 const int was_in_eval = PL_in_eval;
1323 DEBUG_S(PerlIO_printf(Perl_debug_log,
1324 "%p: die: curstack = %p, mainstack = %p\n",
1325 (void*)thr, (void*)PL_curstack, (void*)PL_mainstack));
1327 message = vdie_croak_common(pat, args, &msglen, &utf8);
1329 PL_restartop = die_where(message, msglen);
1330 SvFLAGS(ERRSV) |= utf8;
1331 DEBUG_S(PerlIO_printf(Perl_debug_log,
1332 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1333 (void*)thr, (void*)PL_restartop, was_in_eval, (void*)PL_top_env));
1334 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1336 return PL_restartop;
1339 #if defined(PERL_IMPLICIT_CONTEXT)
1341 Perl_die_nocontext(const char* pat, ...)
1346 va_start(args, pat);
1347 o = vdie(pat, &args);
1351 #endif /* PERL_IMPLICIT_CONTEXT */
1354 Perl_die(pTHX_ const char* pat, ...)
1358 va_start(args, pat);
1359 o = vdie(pat, &args);
1365 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1368 const char *message;
1372 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1375 PL_restartop = die_where(message, msglen);
1376 SvFLAGS(ERRSV) |= utf8;
1380 message = SvPVx_const(ERRSV, msglen);
1382 write_to_stderr(message, msglen);
1386 #if defined(PERL_IMPLICIT_CONTEXT)
1388 Perl_croak_nocontext(const char *pat, ...)
1392 va_start(args, pat);
1397 #endif /* PERL_IMPLICIT_CONTEXT */
1400 =head1 Warning and Dieing
1404 This is the XSUB-writer's interface to Perl's C<die> function.
1405 Normally call this function the same way you call the C C<printf>
1406 function. Calling C<croak> returns control directly to Perl,
1407 sidestepping the normal C order of execution. See C<warn>.
1409 If you want to throw an exception object, assign the object to
1410 C<$@> and then pass C<NULL> to croak():
1412 errsv = get_sv("@", TRUE);
1413 sv_setsv(errsv, exception_object);
1420 Perl_croak(pTHX_ const char *pat, ...)
1423 va_start(args, pat);
1430 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1434 SV * const msv = vmess(pat, args);
1435 const I32 utf8 = SvUTF8(msv);
1436 const char * const message = SvPV_const(msv, msglen);
1439 if (vdie_common(message, msglen, utf8, TRUE))
1443 write_to_stderr(message, msglen);
1446 #if defined(PERL_IMPLICIT_CONTEXT)
1448 Perl_warn_nocontext(const char *pat, ...)
1452 va_start(args, pat);
1456 #endif /* PERL_IMPLICIT_CONTEXT */
1461 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1462 function the same way you call the C C<printf> function. See C<croak>.
1468 Perl_warn(pTHX_ const char *pat, ...)
1471 va_start(args, pat);
1476 #if defined(PERL_IMPLICIT_CONTEXT)
1478 Perl_warner_nocontext(U32 err, const char *pat, ...)
1482 va_start(args, pat);
1483 vwarner(err, pat, &args);
1486 #endif /* PERL_IMPLICIT_CONTEXT */
1489 Perl_warner(pTHX_ U32 err, const char* pat,...)
1492 va_start(args, pat);
1493 vwarner(err, pat, &args);
1498 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1501 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
1502 SV * const msv = vmess(pat, args);
1504 const char * const message = SvPV_const(msv, msglen);
1505 const I32 utf8 = SvUTF8(msv);
1509 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
1512 PL_restartop = die_where(message, msglen);
1513 SvFLAGS(ERRSV) |= utf8;
1516 write_to_stderr(message, msglen);
1520 Perl_vwarn(aTHX_ pat, args);
1524 /* implements the ckWARN? macros */
1527 Perl_ckwarn(pTHX_ U32 w)
1533 && PL_curcop->cop_warnings != pWARN_NONE
1535 PL_curcop->cop_warnings == pWARN_ALL
1536 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1537 || (unpackWARN2(w) &&
1538 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1539 || (unpackWARN3(w) &&
1540 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1541 || (unpackWARN4(w) &&
1542 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1547 isLEXWARN_off && PL_dowarn & G_WARN_ON
1552 /* implements the ckWARN?_d macro */
1555 Perl_ckwarn_d(pTHX_ U32 w)
1560 || PL_curcop->cop_warnings == pWARN_ALL
1562 PL_curcop->cop_warnings != pWARN_NONE
1564 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1565 || (unpackWARN2(w) &&
1566 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1567 || (unpackWARN3(w) &&
1568 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1569 || (unpackWARN4(w) &&
1570 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1576 /* Set buffer=NULL to get a new one. */
1578 Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
1580 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
1581 PERL_UNUSED_CONTEXT;
1584 (specialWARN(buffer) ?
1585 PerlMemShared_malloc(len_wanted) :
1586 PerlMemShared_realloc(buffer, len_wanted));
1588 Copy(bits, (buffer + 1), size, char);
1592 /* since we've already done strlen() for both nam and val
1593 * we can use that info to make things faster than
1594 * sprintf(s, "%s=%s", nam, val)
1596 #define my_setenv_format(s, nam, nlen, val, vlen) \
1597 Copy(nam, s, nlen, char); \
1599 Copy(val, s+(nlen+1), vlen, char); \
1600 *(s+(nlen+1+vlen)) = '\0'
1602 #ifdef USE_ENVIRON_ARRAY
1603 /* VMS' my_setenv() is in vms.c */
1604 #if !defined(WIN32) && !defined(NETWARE)
1606 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1610 /* only parent thread can modify process environment */
1611 if (PL_curinterp == aTHX)
1614 #ifndef PERL_USE_SAFE_PUTENV
1615 if (!PL_use_safe_putenv) {
1616 /* most putenv()s leak, so we manipulate environ directly */
1617 register I32 i=setenv_getix(nam); /* where does it go? */
1620 if (environ == PL_origenviron) { /* need we copy environment? */
1626 while (environ[max])
1628 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1629 for (j=0; j<max; j++) { /* copy environment */
1630 const int len = strlen(environ[j]);
1631 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1632 Copy(environ[j], tmpenv[j], len+1, char);
1635 environ = tmpenv; /* tell exec where it is now */
1638 safesysfree(environ[i]);
1639 while (environ[i]) {
1640 environ[i] = environ[i+1];
1645 if (!environ[i]) { /* does not exist yet */
1646 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1647 environ[i+1] = NULL; /* make sure it's null terminated */
1650 safesysfree(environ[i]);
1654 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1655 /* all that work just for this */
1656 my_setenv_format(environ[i], nam, nlen, val, vlen);
1659 # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
1660 # if defined(HAS_UNSETENV)
1662 (void)unsetenv(nam);
1664 (void)setenv(nam, val, 1);
1666 # else /* ! HAS_UNSETENV */
1667 (void)setenv(nam, val, 1);
1668 # endif /* HAS_UNSETENV */
1670 # if defined(HAS_UNSETENV)
1672 (void)unsetenv(nam);
1674 const int nlen = strlen(nam);
1675 const int vlen = strlen(val);
1676 char * const new_env =
1677 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1678 my_setenv_format(new_env, nam, nlen, val, vlen);
1679 (void)putenv(new_env);
1681 # else /* ! HAS_UNSETENV */
1683 const int nlen = strlen(nam);
1689 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1690 /* all that work just for this */
1691 my_setenv_format(new_env, nam, nlen, val, vlen);
1692 (void)putenv(new_env);
1693 # endif /* HAS_UNSETENV */
1694 # endif /* __CYGWIN__ */
1695 #ifndef PERL_USE_SAFE_PUTENV
1701 #else /* WIN32 || NETWARE */
1704 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1707 register char *envstr;
1708 const int nlen = strlen(nam);
1715 Newx(envstr, nlen+vlen+2, char);
1716 my_setenv_format(envstr, nam, nlen, val, vlen);
1717 (void)PerlEnv_putenv(envstr);
1721 #endif /* WIN32 || NETWARE */
1725 Perl_setenv_getix(pTHX_ const char *nam)
1728 register const I32 len = strlen(nam);
1729 PERL_UNUSED_CONTEXT;
1731 for (i = 0; environ[i]; i++) {
1734 strnicmp(environ[i],nam,len) == 0
1736 strnEQ(environ[i],nam,len)
1738 && environ[i][len] == '=')
1739 break; /* strnEQ must come first to avoid */
1740 } /* potential SEGV's */
1743 #endif /* !PERL_MICRO */
1745 #endif /* !VMS && !EPOC*/
1747 #ifdef UNLINK_ALL_VERSIONS
1749 Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
1753 while (PerlLIO_unlink(f) >= 0)
1755 return retries ? 0 : -1;
1759 /* this is a drop-in replacement for bcopy() */
1760 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1762 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1764 char * const retval = to;
1766 if (from - to >= 0) {
1774 *(--to) = *(--from);
1780 /* this is a drop-in replacement for memset() */
1783 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1785 char * const retval = loc;
1793 /* this is a drop-in replacement for bzero() */
1794 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1796 Perl_my_bzero(register char *loc, register I32 len)
1798 char * const retval = loc;
1806 /* this is a drop-in replacement for memcmp() */
1807 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1809 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1811 register const U8 *a = (const U8 *)s1;
1812 register const U8 *b = (const U8 *)s2;
1816 if ((tmp = *a++ - *b++))
1821 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1825 #ifdef USE_CHAR_VSPRINTF
1830 vsprintf(char *dest, const char *pat, char *args)
1834 fakebuf._ptr = dest;
1835 fakebuf._cnt = 32767;
1839 fakebuf._flag = _IOWRT|_IOSTRG;
1840 _doprnt(pat, args, &fakebuf); /* what a kludge */
1841 (void)putc('\0', &fakebuf);
1842 #ifdef USE_CHAR_VSPRINTF
1845 return 0; /* perl doesn't use return value */
1849 #endif /* HAS_VPRINTF */
1852 #if BYTEORDER != 0x4321
1854 Perl_my_swap(pTHX_ short s)
1856 #if (BYTEORDER & 1) == 0
1859 result = ((s & 255) << 8) + ((s >> 8) & 255);
1867 Perl_my_htonl(pTHX_ long l)
1871 char c[sizeof(long)];
1874 #if BYTEORDER == 0x1234
1875 u.c[0] = (l >> 24) & 255;
1876 u.c[1] = (l >> 16) & 255;
1877 u.c[2] = (l >> 8) & 255;
1881 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1882 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1887 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1888 u.c[o & 0xf] = (l >> s) & 255;
1896 Perl_my_ntohl(pTHX_ long l)
1900 char c[sizeof(long)];
1903 #if BYTEORDER == 0x1234
1904 u.c[0] = (l >> 24) & 255;
1905 u.c[1] = (l >> 16) & 255;
1906 u.c[2] = (l >> 8) & 255;
1910 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1911 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1918 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1919 l |= (u.c[o & 0xf] & 255) << s;
1926 #endif /* BYTEORDER != 0x4321 */
1930 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1931 * If these functions are defined,
1932 * the BYTEORDER is neither 0x1234 nor 0x4321.
1933 * However, this is not assumed.
1937 #define HTOLE(name,type) \
1939 name (register type n) \
1943 char c[sizeof(type)]; \
1946 register U32 s = 0; \
1947 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1948 u.c[i] = (n >> s) & 0xFF; \
1953 #define LETOH(name,type) \
1955 name (register type n) \
1959 char c[sizeof(type)]; \
1962 register U32 s = 0; \
1965 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1966 n |= ((type)(u.c[i] & 0xFF)) << s; \
1972 * Big-endian byte order functions.
1975 #define HTOBE(name,type) \
1977 name (register type n) \
1981 char c[sizeof(type)]; \
1984 register U32 s = 8*(sizeof(u.c)-1); \
1985 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1986 u.c[i] = (n >> s) & 0xFF; \
1991 #define BETOH(name,type) \
1993 name (register type n) \
1997 char c[sizeof(type)]; \
2000 register U32 s = 8*(sizeof(u.c)-1); \
2003 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2004 n |= ((type)(u.c[i] & 0xFF)) << s; \
2010 * If we just can't do it...
2013 #define NOT_AVAIL(name,type) \
2015 name (register type n) \
2017 Perl_croak_nocontext(#name "() not available"); \
2018 return n; /* not reached */ \
2022 #if defined(HAS_HTOVS) && !defined(htovs)
2025 #if defined(HAS_HTOVL) && !defined(htovl)
2028 #if defined(HAS_VTOHS) && !defined(vtohs)
2031 #if defined(HAS_VTOHL) && !defined(vtohl)
2035 #ifdef PERL_NEED_MY_HTOLE16
2037 HTOLE(Perl_my_htole16,U16)
2039 NOT_AVAIL(Perl_my_htole16,U16)
2042 #ifdef PERL_NEED_MY_LETOH16
2044 LETOH(Perl_my_letoh16,U16)
2046 NOT_AVAIL(Perl_my_letoh16,U16)
2049 #ifdef PERL_NEED_MY_HTOBE16
2051 HTOBE(Perl_my_htobe16,U16)
2053 NOT_AVAIL(Perl_my_htobe16,U16)
2056 #ifdef PERL_NEED_MY_BETOH16
2058 BETOH(Perl_my_betoh16,U16)
2060 NOT_AVAIL(Perl_my_betoh16,U16)
2064 #ifdef PERL_NEED_MY_HTOLE32
2066 HTOLE(Perl_my_htole32,U32)
2068 NOT_AVAIL(Perl_my_htole32,U32)
2071 #ifdef PERL_NEED_MY_LETOH32
2073 LETOH(Perl_my_letoh32,U32)
2075 NOT_AVAIL(Perl_my_letoh32,U32)
2078 #ifdef PERL_NEED_MY_HTOBE32
2080 HTOBE(Perl_my_htobe32,U32)
2082 NOT_AVAIL(Perl_my_htobe32,U32)
2085 #ifdef PERL_NEED_MY_BETOH32
2087 BETOH(Perl_my_betoh32,U32)
2089 NOT_AVAIL(Perl_my_betoh32,U32)
2093 #ifdef PERL_NEED_MY_HTOLE64
2095 HTOLE(Perl_my_htole64,U64)
2097 NOT_AVAIL(Perl_my_htole64,U64)
2100 #ifdef PERL_NEED_MY_LETOH64
2102 LETOH(Perl_my_letoh64,U64)
2104 NOT_AVAIL(Perl_my_letoh64,U64)
2107 #ifdef PERL_NEED_MY_HTOBE64
2109 HTOBE(Perl_my_htobe64,U64)
2111 NOT_AVAIL(Perl_my_htobe64,U64)
2114 #ifdef PERL_NEED_MY_BETOH64
2116 BETOH(Perl_my_betoh64,U64)
2118 NOT_AVAIL(Perl_my_betoh64,U64)
2122 #ifdef PERL_NEED_MY_HTOLES
2123 HTOLE(Perl_my_htoles,short)
2125 #ifdef PERL_NEED_MY_LETOHS
2126 LETOH(Perl_my_letohs,short)
2128 #ifdef PERL_NEED_MY_HTOBES
2129 HTOBE(Perl_my_htobes,short)
2131 #ifdef PERL_NEED_MY_BETOHS
2132 BETOH(Perl_my_betohs,short)
2135 #ifdef PERL_NEED_MY_HTOLEI
2136 HTOLE(Perl_my_htolei,int)
2138 #ifdef PERL_NEED_MY_LETOHI
2139 LETOH(Perl_my_letohi,int)
2141 #ifdef PERL_NEED_MY_HTOBEI
2142 HTOBE(Perl_my_htobei,int)
2144 #ifdef PERL_NEED_MY_BETOHI
2145 BETOH(Perl_my_betohi,int)
2148 #ifdef PERL_NEED_MY_HTOLEL
2149 HTOLE(Perl_my_htolel,long)
2151 #ifdef PERL_NEED_MY_LETOHL
2152 LETOH(Perl_my_letohl,long)
2154 #ifdef PERL_NEED_MY_HTOBEL
2155 HTOBE(Perl_my_htobel,long)
2157 #ifdef PERL_NEED_MY_BETOHL
2158 BETOH(Perl_my_betohl,long)
2162 Perl_my_swabn(void *ptr, int n)
2164 register char *s = (char *)ptr;
2165 register char *e = s + (n-1);
2168 for (n /= 2; n > 0; s++, e--, n--) {
2176 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2178 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
2181 register I32 This, that;
2187 PERL_FLUSHALL_FOR_CHILD;
2188 This = (*mode == 'w');
2192 taint_proper("Insecure %s%s", "EXEC");
2194 if (PerlProc_pipe(p) < 0)
2196 /* Try for another pipe pair for error return */
2197 if (PerlProc_pipe(pp) >= 0)
2199 while ((pid = PerlProc_fork()) < 0) {
2200 if (errno != EAGAIN) {
2201 PerlLIO_close(p[This]);
2202 PerlLIO_close(p[that]);
2204 PerlLIO_close(pp[0]);
2205 PerlLIO_close(pp[1]);
2217 /* Close parent's end of error status pipe (if any) */
2219 PerlLIO_close(pp[0]);
2220 #if defined(HAS_FCNTL) && defined(F_SETFD)
2221 /* Close error pipe automatically if exec works */
2222 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2225 /* Now dup our end of _the_ pipe to right position */
2226 if (p[THIS] != (*mode == 'r')) {
2227 PerlLIO_dup2(p[THIS], *mode == 'r');
2228 PerlLIO_close(p[THIS]);
2229 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2230 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2233 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
2234 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2235 /* No automatic close - do it by hand */
2242 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2248 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
2254 do_execfree(); /* free any memory malloced by child on fork */
2256 PerlLIO_close(pp[1]);
2257 /* Keep the lower of the two fd numbers */
2258 if (p[that] < p[This]) {
2259 PerlLIO_dup2(p[This], p[that]);
2260 PerlLIO_close(p[This]);
2264 PerlLIO_close(p[that]); /* close child's end of pipe */
2267 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2269 SvUPGRADE(sv,SVt_IV);
2271 PL_forkprocess = pid;
2272 /* If we managed to get status pipe check for exec fail */
2273 if (did_pipes && pid > 0) {
2278 while (n < sizeof(int)) {
2279 n1 = PerlLIO_read(pp[0],
2280 (void*)(((char*)&errkid)+n),
2286 PerlLIO_close(pp[0]);
2288 if (n) { /* Error */
2290 PerlLIO_close(p[This]);
2291 if (n != sizeof(int))
2292 Perl_croak(aTHX_ "panic: kid popen errno read");
2294 pid2 = wait4pid(pid, &status, 0);
2295 } while (pid2 == -1 && errno == EINTR);
2296 errno = errkid; /* Propagate errno from kid */
2301 PerlLIO_close(pp[0]);
2302 return PerlIO_fdopen(p[This], mode);
2304 # ifdef OS2 /* Same, without fork()ing and all extra overhead... */
2305 return my_syspopen4(aTHX_ Nullch, mode, n, args);
2307 Perl_croak(aTHX_ "List form of piped open not implemented");
2308 return (PerlIO *) NULL;
2313 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2314 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2316 Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2320 register I32 This, that;
2323 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2327 PERL_FLUSHALL_FOR_CHILD;
2330 return my_syspopen(aTHX_ cmd,mode);
2333 This = (*mode == 'w');
2335 if (doexec && PL_tainting) {
2337 taint_proper("Insecure %s%s", "EXEC");
2339 if (PerlProc_pipe(p) < 0)
2341 if (doexec && PerlProc_pipe(pp) >= 0)
2343 while ((pid = PerlProc_fork()) < 0) {
2344 if (errno != EAGAIN) {
2345 PerlLIO_close(p[This]);
2346 PerlLIO_close(p[that]);
2348 PerlLIO_close(pp[0]);
2349 PerlLIO_close(pp[1]);
2352 Perl_croak(aTHX_ "Can't fork");
2365 PerlLIO_close(pp[0]);
2366 #if defined(HAS_FCNTL) && defined(F_SETFD)
2367 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2370 if (p[THIS] != (*mode == 'r')) {
2371 PerlLIO_dup2(p[THIS], *mode == 'r');
2372 PerlLIO_close(p[THIS]);
2373 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2374 PerlLIO_close(p[THAT]);
2377 PerlLIO_close(p[THAT]);
2380 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2387 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2392 /* may or may not use the shell */
2393 do_exec3(cmd, pp[1], did_pipes);
2396 #endif /* defined OS2 */
2398 #ifdef PERLIO_USING_CRLF
2399 /* Since we circumvent IO layers when we manipulate low-level
2400 filedescriptors directly, need to manually switch to the
2401 default, binary, low-level mode; see PerlIOBuf_open(). */
2402 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2405 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
2406 SvREADONLY_off(GvSV(tmpgv));
2407 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2408 SvREADONLY_on(GvSV(tmpgv));
2410 #ifdef THREADS_HAVE_PIDS
2411 PL_ppid = (IV)getppid();
2414 #ifdef PERL_USES_PL_PIDSTATUS
2415 hv_clear(PL_pidstatus); /* we have no children */
2421 do_execfree(); /* free any memory malloced by child on vfork */
2423 PerlLIO_close(pp[1]);
2424 if (p[that] < p[This]) {
2425 PerlLIO_dup2(p[This], p[that]);
2426 PerlLIO_close(p[This]);
2430 PerlLIO_close(p[that]);
2433 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2435 SvUPGRADE(sv,SVt_IV);
2437 PL_forkprocess = pid;
2438 if (did_pipes && pid > 0) {
2443 while (n < sizeof(int)) {
2444 n1 = PerlLIO_read(pp[0],
2445 (void*)(((char*)&errkid)+n),
2451 PerlLIO_close(pp[0]);
2453 if (n) { /* Error */
2455 PerlLIO_close(p[This]);
2456 if (n != sizeof(int))
2457 Perl_croak(aTHX_ "panic: kid popen errno read");
2459 pid2 = wait4pid(pid, &status, 0);
2460 } while (pid2 == -1 && errno == EINTR);
2461 errno = errkid; /* Propagate errno from kid */
2466 PerlLIO_close(pp[0]);
2467 return PerlIO_fdopen(p[This], mode);
2470 #if defined(atarist) || defined(EPOC)
2473 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2475 PERL_FLUSHALL_FOR_CHILD;
2476 /* Call system's popen() to get a FILE *, then import it.
2477 used 0 for 2nd parameter to PerlIO_importFILE;
2480 return PerlIO_importFILE(popen(cmd, mode), 0);
2484 FILE *djgpp_popen();
2486 Perl_my_popen((pTHX_ const char *cmd, const char *mode)
2488 PERL_FLUSHALL_FOR_CHILD;
2489 /* Call system's popen() to get a FILE *, then import it.
2490 used 0 for 2nd parameter to PerlIO_importFILE;
2493 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2498 #endif /* !DOSISH */
2500 /* this is called in parent before the fork() */
2502 Perl_atfork_lock(void)
2505 #if defined(USE_ITHREADS)
2506 /* locks must be held in locking order (if any) */
2508 MUTEX_LOCK(&PL_malloc_mutex);
2514 /* this is called in both parent and child after the fork() */
2516 Perl_atfork_unlock(void)
2519 #if defined(USE_ITHREADS)
2520 /* locks must be released in same order as in atfork_lock() */
2522 MUTEX_UNLOCK(&PL_malloc_mutex);
2531 #if defined(HAS_FORK)
2533 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2538 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2539 * handlers elsewhere in the code */
2544 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2545 Perl_croak_nocontext("fork() not available");
2547 #endif /* HAS_FORK */
2552 Perl_dump_fds(pTHX_ char *s)
2557 PerlIO_printf(Perl_debug_log,"%s", s);
2558 for (fd = 0; fd < 32; fd++) {
2559 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2560 PerlIO_printf(Perl_debug_log," %d",fd);
2562 PerlIO_printf(Perl_debug_log,"\n");
2565 #endif /* DUMP_FDS */
2569 dup2(int oldfd, int newfd)
2571 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2574 PerlLIO_close(newfd);
2575 return fcntl(oldfd, F_DUPFD, newfd);
2577 #define DUP2_MAX_FDS 256
2578 int fdtmp[DUP2_MAX_FDS];
2584 PerlLIO_close(newfd);
2585 /* good enough for low fd's... */
2586 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2587 if (fdx >= DUP2_MAX_FDS) {
2595 PerlLIO_close(fdtmp[--fdx]);
2602 #ifdef HAS_SIGACTION
2604 #ifdef MACOS_TRADITIONAL
2605 /* We don't want restart behavior on MacOS */
2610 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2613 struct sigaction act, oact;
2616 /* only "parent" interpreter can diddle signals */
2617 if (PL_curinterp != aTHX)
2618 return (Sighandler_t) SIG_ERR;
2621 act.sa_handler = (void(*)(int))handler;
2622 sigemptyset(&act.sa_mask);
2625 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2626 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2628 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2629 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2630 act.sa_flags |= SA_NOCLDWAIT;
2632 if (sigaction(signo, &act, &oact) == -1)
2633 return (Sighandler_t) SIG_ERR;
2635 return (Sighandler_t) oact.sa_handler;
2639 Perl_rsignal_state(pTHX_ int signo)
2641 struct sigaction oact;
2642 PERL_UNUSED_CONTEXT;
2644 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2645 return (Sighandler_t) SIG_ERR;
2647 return (Sighandler_t) oact.sa_handler;
2651 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2654 struct sigaction act;
2657 /* only "parent" interpreter can diddle signals */
2658 if (PL_curinterp != aTHX)
2662 act.sa_handler = (void(*)(int))handler;
2663 sigemptyset(&act.sa_mask);
2666 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2667 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2669 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2670 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
2671 act.sa_flags |= SA_NOCLDWAIT;
2673 return sigaction(signo, &act, save);
2677 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2681 /* only "parent" interpreter can diddle signals */
2682 if (PL_curinterp != aTHX)
2686 return sigaction(signo, save, (struct sigaction *)NULL);
2689 #else /* !HAS_SIGACTION */
2692 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2694 #if defined(USE_ITHREADS) && !defined(WIN32)
2695 /* only "parent" interpreter can diddle signals */
2696 if (PL_curinterp != aTHX)
2697 return (Sighandler_t) SIG_ERR;
2700 return PerlProc_signal(signo, handler);
2711 Perl_rsignal_state(pTHX_ int signo)
2714 Sighandler_t oldsig;
2716 #if defined(USE_ITHREADS) && !defined(WIN32)
2717 /* only "parent" interpreter can diddle signals */
2718 if (PL_curinterp != aTHX)
2719 return (Sighandler_t) SIG_ERR;
2723 oldsig = PerlProc_signal(signo, sig_trap);
2724 PerlProc_signal(signo, oldsig);
2726 PerlProc_kill(PerlProc_getpid(), signo);
2731 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2733 #if defined(USE_ITHREADS) && !defined(WIN32)
2734 /* only "parent" interpreter can diddle signals */
2735 if (PL_curinterp != aTHX)
2738 *save = PerlProc_signal(signo, handler);
2739 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
2743 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2745 #if defined(USE_ITHREADS) && !defined(WIN32)
2746 /* only "parent" interpreter can diddle signals */
2747 if (PL_curinterp != aTHX)
2750 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
2753 #endif /* !HAS_SIGACTION */
2754 #endif /* !PERL_MICRO */
2756 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2757 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2759 Perl_my_pclose(pTHX_ PerlIO *ptr)
2762 Sigsave_t hstat, istat, qstat;
2768 int saved_errno = 0;
2770 int saved_win32_errno;
2774 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2776 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2778 *svp = &PL_sv_undef;
2780 if (pid == -1) { /* Opened by popen. */
2781 return my_syspclose(ptr);
2784 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2785 saved_errno = errno;
2787 saved_win32_errno = GetLastError();
2791 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2794 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2795 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2796 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
2799 pid2 = wait4pid(pid, &status, 0);
2800 } while (pid2 == -1 && errno == EINTR);
2802 rsignal_restore(SIGHUP, &hstat);
2803 rsignal_restore(SIGINT, &istat);
2804 rsignal_restore(SIGQUIT, &qstat);
2807 SETERRNO(saved_errno, 0);
2810 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2812 #endif /* !DOSISH */
2814 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2816 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2822 #ifdef PERL_USES_PL_PIDSTATUS
2825 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2826 pid, rather than a string form. */
2827 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
2828 if (svp && *svp != &PL_sv_undef) {
2829 *statusp = SvIVX(*svp);
2830 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2838 hv_iterinit(PL_pidstatus);
2839 if ((entry = hv_iternext(PL_pidstatus))) {
2840 SV * const sv = hv_iterval(PL_pidstatus,entry);
2842 const char * const spid = hv_iterkey(entry,&len);
2844 assert (len == sizeof(Pid_t));
2845 memcpy((char *)&pid, spid, len);
2846 *statusp = SvIVX(sv);
2847 /* The hash iterator is currently on this entry, so simply
2848 calling hv_delete would trigger the lazy delete, which on
2849 aggregate does more work, beacuse next call to hv_iterinit()
2850 would spot the flag, and have to call the delete routine,
2851 while in the meantime any new entries can't re-use that
2853 hv_iterinit(PL_pidstatus);
2854 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
2861 # ifdef HAS_WAITPID_RUNTIME
2862 if (!HAS_WAITPID_RUNTIME)
2865 result = PerlProc_waitpid(pid,statusp,flags);
2868 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2869 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
2872 #ifdef PERL_USES_PL_PIDSTATUS
2873 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2878 Perl_croak(aTHX_ "Can't do waitpid with flags");
2880 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2881 pidgone(result,*statusp);
2887 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2890 if (result < 0 && errno == EINTR) {
2895 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2897 #ifdef PERL_USES_PL_PIDSTATUS
2899 Perl_pidgone(pTHX_ Pid_t pid, int status)
2903 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
2904 SvUPGRADE(sv,SVt_IV);
2905 SvIV_set(sv, status);
2910 #if defined(atarist) || defined(OS2) || defined(EPOC)
2913 int /* Cannot prototype with I32
2915 my_syspclose(PerlIO *ptr)
2918 Perl_my_pclose(pTHX_ PerlIO *ptr)
2921 /* Needs work for PerlIO ! */
2922 FILE * const f = PerlIO_findFILE(ptr);
2923 const I32 result = pclose(f);
2924 PerlIO_releaseFILE(ptr,f);
2932 Perl_my_pclose(pTHX_ PerlIO *ptr)
2934 /* Needs work for PerlIO ! */
2935 FILE * const f = PerlIO_findFILE(ptr);
2936 I32 result = djgpp_pclose(f);
2937 result = (result << 8) & 0xff00;
2938 PerlIO_releaseFILE(ptr,f);
2944 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2947 register const char * const frombase = from;
2948 PERL_UNUSED_CONTEXT;
2951 register const char c = *from;
2956 while (count-- > 0) {
2957 for (todo = len; todo > 0; todo--) {
2966 Perl_same_dirent(pTHX_ const char *a, const char *b)
2968 char *fa = strrchr(a,'/');
2969 char *fb = strrchr(b,'/');
2972 SV * const tmpsv = sv_newmortal();
2985 sv_setpvn(tmpsv, ".", 1);
2987 sv_setpvn(tmpsv, a, fa - a);
2988 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2991 sv_setpvn(tmpsv, ".", 1);
2993 sv_setpvn(tmpsv, b, fb - b);
2994 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2996 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2997 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2999 #endif /* !HAS_RENAME */
3002 Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3003 const char *const *const search_ext, I32 flags)
3006 const char *xfound = NULL;
3007 char *xfailed = NULL;
3008 char tmpbuf[MAXPATHLEN];
3012 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3013 # define SEARCH_EXTS ".bat", ".cmd", NULL
3014 # define MAX_EXT_LEN 4
3017 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3018 # define MAX_EXT_LEN 4
3021 # define SEARCH_EXTS ".pl", ".com", NULL
3022 # define MAX_EXT_LEN 4
3024 /* additional extensions to try in each dir if scriptname not found */
3026 static const char *const exts[] = { SEARCH_EXTS };
3027 const char *const *const ext = search_ext ? search_ext : exts;
3028 int extidx = 0, i = 0;
3029 const char *curext = NULL;
3031 PERL_UNUSED_ARG(search_ext);
3032 # define MAX_EXT_LEN 0
3036 * If dosearch is true and if scriptname does not contain path
3037 * delimiters, search the PATH for scriptname.
3039 * If SEARCH_EXTS is also defined, will look for each
3040 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3041 * while searching the PATH.
3043 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3044 * proceeds as follows:
3045 * If DOSISH or VMSISH:
3046 * + look for ./scriptname{,.foo,.bar}
3047 * + search the PATH for scriptname{,.foo,.bar}
3050 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3051 * this will not look in '.' if it's not in the PATH)
3056 # ifdef ALWAYS_DEFTYPES
3057 len = strlen(scriptname);
3058 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
3059 int idx = 0, deftypes = 1;
3062 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
3065 int idx = 0, deftypes = 1;
3068 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
3070 /* The first time through, just add SEARCH_EXTS to whatever we
3071 * already have, so we can check for default file types. */
3073 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
3079 if ((strlen(tmpbuf) + strlen(scriptname)
3080 + MAX_EXT_LEN) >= sizeof tmpbuf)
3081 continue; /* don't search dir with too-long name */
3082 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
3086 if (strEQ(scriptname, "-"))
3088 if (dosearch) { /* Look in '.' first. */
3089 const char *cur = scriptname;
3091 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3093 if (strEQ(ext[i++],curext)) {
3094 extidx = -1; /* already has an ext */
3099 DEBUG_p(PerlIO_printf(Perl_debug_log,
3100 "Looking for %s\n",cur));
3101 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3102 && !S_ISDIR(PL_statbuf.st_mode)) {
3110 if (cur == scriptname) {
3111 len = strlen(scriptname);
3112 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
3114 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3117 } while (extidx >= 0 && ext[extidx] /* try an extension? */
3118 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
3123 #ifdef MACOS_TRADITIONAL
3124 if (dosearch && !strchr(scriptname, ':') &&
3125 (s = PerlEnv_getenv("Commands")))
3127 if (dosearch && !strchr(scriptname, '/')
3129 && !strchr(scriptname, '\\')
3131 && (s = PerlEnv_getenv("PATH")))
3136 PL_bufend = s + strlen(s);
3137 while (s < PL_bufend) {
3138 #ifdef MACOS_TRADITIONAL
3139 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3143 #if defined(atarist) || defined(DOSISH)
3148 && *s != ';'; len++, s++) {
3149 if (len < sizeof tmpbuf)
3152 if (len < sizeof tmpbuf)
3154 #else /* ! (atarist || DOSISH) */
3155 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
3158 #endif /* ! (atarist || DOSISH) */
3159 #endif /* MACOS_TRADITIONAL */
3162 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
3163 continue; /* don't search dir with too-long name */
3164 #ifdef MACOS_TRADITIONAL
3165 if (len && tmpbuf[len - 1] != ':')
3166 tmpbuf[len++] = ':';
3169 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
3170 && tmpbuf[len - 1] != '/'
3171 && tmpbuf[len - 1] != '\\'
3174 tmpbuf[len++] = '/';
3175 if (len == 2 && tmpbuf[0] == '.')
3178 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
3182 len = strlen(tmpbuf);
3183 if (extidx > 0) /* reset after previous loop */
3187 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3188 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
3189 if (S_ISDIR(PL_statbuf.st_mode)) {
3193 } while ( retval < 0 /* not there */
3194 && extidx>=0 && ext[extidx] /* try an extension? */
3195 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
3200 if (S_ISREG(PL_statbuf.st_mode)
3201 && cando(S_IRUSR,TRUE,&PL_statbuf)
3202 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3203 && cando(S_IXUSR,TRUE,&PL_statbuf)
3207 xfound = tmpbuf; /* bingo! */
3211 xfailed = savepv(tmpbuf);
3214 if (!xfound && !seen_dot && !xfailed &&
3215 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
3216 || S_ISDIR(PL_statbuf.st_mode)))
3218 seen_dot = 1; /* Disable message. */
3220 if (flags & 1) { /* do or die? */
3221 Perl_croak(aTHX_ "Can't %s %s%s%s",
3222 (xfailed ? "execute" : "find"),
3223 (xfailed ? xfailed : scriptname),
3224 (xfailed ? "" : " on PATH"),
3225 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3230 scriptname = xfound;
3232 return (scriptname ? savepv(scriptname) : NULL);
3235 #ifndef PERL_GET_CONTEXT_DEFINED
3238 Perl_get_context(void)
3241 #if defined(USE_ITHREADS)
3242 # ifdef OLD_PTHREADS_API
3244 if (pthread_getspecific(PL_thr_key, &t))
3245 Perl_croak_nocontext("panic: pthread_getspecific");
3248 # ifdef I_MACH_CTHREADS
3249 return (void*)cthread_data(cthread_self());
3251 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3260 Perl_set_context(void *t)
3263 #if defined(USE_ITHREADS)
3264 # ifdef I_MACH_CTHREADS
3265 cthread_set_data(cthread_self(), t);
3267 if (pthread_setspecific(PL_thr_key, t))
3268 Perl_croak_nocontext("panic: pthread_setspecific");
3275 #endif /* !PERL_GET_CONTEXT_DEFINED */
3277 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3286 Perl_get_op_names(pTHX)
3288 PERL_UNUSED_CONTEXT;
3289 return (char **)PL_op_name;
3293 Perl_get_op_descs(pTHX)
3295 PERL_UNUSED_CONTEXT;
3296 return (char **)PL_op_desc;
3300 Perl_get_no_modify(pTHX)
3302 PERL_UNUSED_CONTEXT;
3303 return PL_no_modify;
3307 Perl_get_opargs(pTHX)
3309 PERL_UNUSED_CONTEXT;
3310 return (U32 *)PL_opargs;
3314 Perl_get_ppaddr(pTHX)
3317 PERL_UNUSED_CONTEXT;
3318 return (PPADDR_t*)PL_ppaddr;
3321 #ifndef HAS_GETENV_LEN
3323 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3325 char * const env_trans = PerlEnv_getenv(env_elem);
3326 PERL_UNUSED_CONTEXT;
3328 *len = strlen(env_trans);
3335 Perl_get_vtbl(pTHX_ int vtbl_id)
3337 const MGVTBL* result;
3338 PERL_UNUSED_CONTEXT;
3342 result = &PL_vtbl_sv;
3345 result = &PL_vtbl_env;
3347 case want_vtbl_envelem:
3348 result = &PL_vtbl_envelem;
3351 result = &PL_vtbl_sig;
3353 case want_vtbl_sigelem:
3354 result = &PL_vtbl_sigelem;
3356 case want_vtbl_pack:
3357 result = &PL_vtbl_pack;
3359 case want_vtbl_packelem:
3360 result = &PL_vtbl_packelem;
3362 case want_vtbl_dbline:
3363 result = &PL_vtbl_dbline;
3366 result = &PL_vtbl_isa;
3368 case want_vtbl_isaelem:
3369 result = &PL_vtbl_isaelem;
3371 case want_vtbl_arylen:
3372 result = &PL_vtbl_arylen;
3374 case want_vtbl_mglob:
3375 result = &PL_vtbl_mglob;
3377 case want_vtbl_nkeys:
3378 result = &PL_vtbl_nkeys;
3380 case want_vtbl_taint:
3381 result = &PL_vtbl_taint;
3383 case want_vtbl_substr:
3384 result = &PL_vtbl_substr;
3387 result = &PL_vtbl_vec;
3390 result = &PL_vtbl_pos;
3393 result = &PL_vtbl_bm;
3396 result = &PL_vtbl_fm;
3398 case want_vtbl_uvar:
3399 result = &PL_vtbl_uvar;
3401 case want_vtbl_defelem:
3402 result = &PL_vtbl_defelem;
3404 case want_vtbl_regexp:
3405 result = &PL_vtbl_regexp;
3407 case want_vtbl_regdata:
3408 result = &PL_vtbl_regdata;
3410 case want_vtbl_regdatum:
3411 result = &PL_vtbl_regdatum;
3413 #ifdef USE_LOCALE_COLLATE
3414 case want_vtbl_collxfrm:
3415 result = &PL_vtbl_collxfrm;
3418 case want_vtbl_amagic:
3419 result = &PL_vtbl_amagic;
3421 case want_vtbl_amagicelem:
3422 result = &PL_vtbl_amagicelem;
3424 case want_vtbl_backref:
3425 result = &PL_vtbl_backref;
3427 case want_vtbl_utf8:
3428 result = &PL_vtbl_utf8;
3434 return (MGVTBL*)result;
3438 Perl_my_fflush_all(pTHX)
3440 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3441 return PerlIO_flush(NULL);
3443 # if defined(HAS__FWALK)
3444 extern int fflush(FILE *);
3445 /* undocumented, unprototyped, but very useful BSDism */
3446 extern void _fwalk(int (*)(FILE *));
3450 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3452 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3453 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3455 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3456 open_max = sysconf(_SC_OPEN_MAX);
3459 open_max = FOPEN_MAX;
3462 open_max = OPEN_MAX;
3473 for (i = 0; i < open_max; i++)
3474 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3475 STDIO_STREAM_ARRAY[i]._file < open_max &&
3476 STDIO_STREAM_ARRAY[i]._flag)
3477 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3481 SETERRNO(EBADF,RMS_IFI);
3488 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3490 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
3492 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3493 if (ckWARN(WARN_IO)) {
3494 const char * const direction =
3495 (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out");
3497 Perl_warner(aTHX_ packWARN(WARN_IO),
3498 "Filehandle %s opened only for %sput",
3501 Perl_warner(aTHX_ packWARN(WARN_IO),
3502 "Filehandle opened only for %sput", direction);
3509 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3511 warn_type = WARN_CLOSED;
3515 warn_type = WARN_UNOPENED;
3518 if (ckWARN(warn_type)) {
3519 const char * const pars =
3520 (const char *)(OP_IS_FILETEST(op) ? "" : "()");
3521 const char * const func =
3523 (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3524 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3525 op < 0 ? "" : /* handle phoney cases */
3527 const char * const type =
3529 (OP_IS_SOCKET(op) ||
3530 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
3531 "socket" : "filehandle");
3532 if (name && *name) {
3533 Perl_warner(aTHX_ packWARN(warn_type),
3534 "%s%s on %s %s %s", func, pars, vile, type, name);
3535 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3537 aTHX_ packWARN(warn_type),
3538 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3543 Perl_warner(aTHX_ packWARN(warn_type),
3544 "%s%s on %s %s", func, pars, vile, type);
3545 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3547 aTHX_ packWARN(warn_type),
3548 "\t(Are you trying to call %s%s on dirhandle?)\n",
3557 /* in ASCII order, not that it matters */
3558 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3561 Perl_ebcdic_control(pTHX_ int ch)
3569 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3570 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3573 if (ctlp == controllablechars)
3574 return('\177'); /* DEL */
3576 return((unsigned char)(ctlp - controllablechars - 1));
3577 } else { /* Want uncontrol */
3578 if (ch == '\177' || ch == -1)
3580 else if (ch == '\157')
3582 else if (ch == '\174')
3584 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3586 else if (ch == '\155')
3588 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3589 return(controllablechars[ch+1]);
3591 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3596 /* To workaround core dumps from the uninitialised tm_zone we get the
3597 * system to give us a reasonable struct to copy. This fix means that
3598 * strftime uses the tm_zone and tm_gmtoff values returned by
3599 * localtime(time()). That should give the desired result most of the
3600 * time. But probably not always!
3602 * This does not address tzname aspects of NETaa14816.
3607 # ifndef STRUCT_TM_HASZONE
3608 # define STRUCT_TM_HASZONE
3612 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3613 # ifndef HAS_TM_TM_ZONE
3614 # define HAS_TM_TM_ZONE
3619 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3621 #ifdef HAS_TM_TM_ZONE
3623 const struct tm* my_tm;
3625 my_tm = localtime(&now);
3627 Copy(my_tm, ptm, 1, struct tm);
3629 PERL_UNUSED_ARG(ptm);
3634 * mini_mktime - normalise struct tm values without the localtime()
3635 * semantics (and overhead) of mktime().
3638 Perl_mini_mktime(pTHX_ struct tm *ptm)
3642 int month, mday, year, jday;
3643 int odd_cent, odd_year;
3644 PERL_UNUSED_CONTEXT;
3646 #define DAYS_PER_YEAR 365
3647 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3648 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3649 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3650 #define SECS_PER_HOUR (60*60)
3651 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3652 /* parentheses deliberately absent on these two, otherwise they don't work */
3653 #define MONTH_TO_DAYS 153/5
3654 #define DAYS_TO_MONTH 5/153
3655 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3656 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3657 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3658 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3661 * Year/day algorithm notes:
3663 * With a suitable offset for numeric value of the month, one can find
3664 * an offset into the year by considering months to have 30.6 (153/5) days,
3665 * using integer arithmetic (i.e., with truncation). To avoid too much
3666 * messing about with leap days, we consider January and February to be
3667 * the 13th and 14th month of the previous year. After that transformation,
3668 * we need the month index we use to be high by 1 from 'normal human' usage,
3669 * so the month index values we use run from 4 through 15.
3671 * Given that, and the rules for the Gregorian calendar (leap years are those
3672 * divisible by 4 unless also divisible by 100, when they must be divisible
3673 * by 400 instead), we can simply calculate the number of days since some
3674 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3675 * the days we derive from our month index, and adding in the day of the
3676 * month. The value used here is not adjusted for the actual origin which
3677 * it normally would use (1 January A.D. 1), since we're not exposing it.
3678 * We're only building the value so we can turn around and get the
3679 * normalised values for the year, month, day-of-month, and day-of-year.
3681 * For going backward, we need to bias the value we're using so that we find
3682 * the right year value. (Basically, we don't want the contribution of
3683 * March 1st to the number to apply while deriving the year). Having done
3684 * that, we 'count up' the contribution to the year number by accounting for
3685 * full quadracenturies (400-year periods) with their extra leap days, plus
3686 * the contribution from full centuries (to avoid counting in the lost leap
3687 * days), plus the contribution from full quad-years (to count in the normal
3688 * leap days), plus the leftover contribution from any non-leap years.
3689 * At this point, if we were working with an actual leap day, we'll have 0
3690 * days left over. This is also true for March 1st, however. So, we have
3691 * to special-case that result, and (earlier) keep track of the 'odd'
3692 * century and year contributions. If we got 4 extra centuries in a qcent,
3693 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3694 * Otherwise, we add back in the earlier bias we removed (the 123 from
3695 * figuring in March 1st), find the month index (integer division by 30.6),
3696 * and the remainder is the day-of-month. We then have to convert back to
3697 * 'real' months (including fixing January and February from being 14/15 in
3698 * the previous year to being in the proper year). After that, to get
3699 * tm_yday, we work with the normalised year and get a new yearday value for
3700 * January 1st, which we subtract from the yearday value we had earlier,
3701 * representing the date we've re-built. This is done from January 1
3702 * because tm_yday is 0-origin.
3704 * Since POSIX time routines are only guaranteed to work for times since the
3705 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3706 * applies Gregorian calendar rules even to dates before the 16th century
3707 * doesn't bother me. Besides, you'd need cultural context for a given
3708 * date to know whether it was Julian or Gregorian calendar, and that's
3709 * outside the scope for this routine. Since we convert back based on the
3710 * same rules we used to build the yearday, you'll only get strange results
3711 * for input which needed normalising, or for the 'odd' century years which
3712 * were leap years in the Julian calander but not in the Gregorian one.
3713 * I can live with that.
3715 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3716 * that's still outside the scope for POSIX time manipulation, so I don't
3720 year = 1900 + ptm->tm_year;
3721 month = ptm->tm_mon;
3722 mday = ptm->tm_mday;
3723 /* allow given yday with no month & mday to dominate the result */
3724 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3727 jday = 1 + ptm->tm_yday;
3736 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3737 yearday += month*MONTH_TO_DAYS + mday + jday;
3739 * Note that we don't know when leap-seconds were or will be,
3740 * so we have to trust the user if we get something which looks
3741 * like a sensible leap-second. Wild values for seconds will
3742 * be rationalised, however.
3744 if ((unsigned) ptm->tm_sec <= 60) {
3751 secs += 60 * ptm->tm_min;
3752 secs += SECS_PER_HOUR * ptm->tm_hour;
3754 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3755 /* got negative remainder, but need positive time */
3756 /* back off an extra day to compensate */
3757 yearday += (secs/SECS_PER_DAY)-1;
3758 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3761 yearday += (secs/SECS_PER_DAY);
3762 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3765 else if (secs >= SECS_PER_DAY) {
3766 yearday += (secs/SECS_PER_DAY);
3767 secs %= SECS_PER_DAY;
3769 ptm->tm_hour = secs/SECS_PER_HOUR;
3770 secs %= SECS_PER_HOUR;
3771 ptm->tm_min = secs/60;
3773 ptm->tm_sec += secs;
3774 /* done with time of day effects */
3776 * The algorithm for yearday has (so far) left it high by 428.
3777 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3778 * bias it by 123 while trying to figure out what year it
3779 * really represents. Even with this tweak, the reverse
3780 * translation fails for years before A.D. 0001.
3781 * It would still fail for Feb 29, but we catch that one below.
3783 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3784 yearday -= YEAR_ADJUST;
3785 year = (yearday / DAYS_PER_QCENT) * 400;
3786 yearday %= DAYS_PER_QCENT;
3787 odd_cent = yearday / DAYS_PER_CENT;
3788 year += odd_cent * 100;
3789 yearday %= DAYS_PER_CENT;
3790 year += (yearday / DAYS_PER_QYEAR) * 4;
3791 yearday %= DAYS_PER_QYEAR;
3792 odd_year = yearday / DAYS_PER_YEAR;
3794 yearday %= DAYS_PER_YEAR;
3795 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3800 yearday += YEAR_ADJUST; /* recover March 1st crock */
3801 month = yearday*DAYS_TO_MONTH;
3802 yearday -= month*MONTH_TO_DAYS;
3803 /* recover other leap-year adjustment */
3812 ptm->tm_year = year - 1900;
3814 ptm->tm_mday = yearday;
3815 ptm->tm_mon = month;
3819 ptm->tm_mon = month - 1;
3821 /* re-build yearday based on Jan 1 to get tm_yday */
3823 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3824 yearday += 14*MONTH_TO_DAYS + 1;
3825 ptm->tm_yday = jday - yearday;
3826 /* fix tm_wday if not overridden by caller */
3827 if ((unsigned)ptm->tm_wday > 6)
3828 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3832 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)
3840 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3843 mytm.tm_hour = hour;
3844 mytm.tm_mday = mday;
3846 mytm.tm_year = year;
3847 mytm.tm_wday = wday;
3848 mytm.tm_yday = yday;
3849 mytm.tm_isdst = isdst;
3851 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3852 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3857 #ifdef HAS_TM_TM_GMTOFF
3858 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3860 #ifdef HAS_TM_TM_ZONE
3861 mytm.tm_zone = mytm2.tm_zone;
3866 Newx(buf, buflen, char);
3867 len = strftime(buf, buflen, fmt, &mytm);
3869 ** The following is needed to handle to the situation where
3870 ** tmpbuf overflows. Basically we want to allocate a buffer
3871 ** and try repeatedly. The reason why it is so complicated
3872 ** is that getting a return value of 0 from strftime can indicate
3873 ** one of the following:
3874 ** 1. buffer overflowed,
3875 ** 2. illegal conversion specifier, or
3876 ** 3. the format string specifies nothing to be returned(not
3877 ** an error). This could be because format is an empty string
3878 ** or it specifies %p that yields an empty string in some locale.
3879 ** If there is a better way to make it portable, go ahead by
3882 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3885 /* Possibly buf overflowed - try again with a bigger buf */
3886 const int fmtlen = strlen(fmt);
3887 int bufsize = fmtlen + buflen;
3889 Newx(buf, bufsize, char);
3891 buflen = strftime(buf, bufsize, fmt, &mytm);
3892 if (buflen > 0 && buflen < bufsize)
3894 /* heuristic to prevent out-of-memory errors */
3895 if (bufsize > 100*fmtlen) {
3901 Renew(buf, bufsize, char);
3906 Perl_croak(aTHX_ "panic: no strftime");
3912 #define SV_CWD_RETURN_UNDEF \
3913 sv_setsv(sv, &PL_sv_undef); \
3916 #define SV_CWD_ISDOT(dp) \
3917 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3918 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3921 =head1 Miscellaneous Functions
3923 =for apidoc getcwd_sv
3925 Fill the sv with current working directory
3930 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3931 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3932 * getcwd(3) if available
3933 * Comments from the orignal:
3934 * This is a faster version of getcwd. It's also more dangerous
3935 * because you might chdir out of a directory that you can't chdir
3939 Perl_getcwd_sv(pTHX_ register SV *sv)
3943 #ifndef INCOMPLETE_TAINTS
3949 char buf[MAXPATHLEN];
3951 /* Some getcwd()s automatically allocate a buffer of the given
3952 * size from the heap if they are given a NULL buffer pointer.
3953 * The problem is that this behaviour is not portable. */
3954 if (getcwd(buf, sizeof(buf) - 1)) {
3959 sv_setsv(sv, &PL_sv_undef);
3967 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3971 SvUPGRADE(sv, SVt_PV);
3973 if (PerlLIO_lstat(".", &statbuf) < 0) {
3974 SV_CWD_RETURN_UNDEF;
3977 orig_cdev = statbuf.st_dev;
3978 orig_cino = statbuf.st_ino;
3987 if (PerlDir_chdir("..") < 0) {
3988 SV_CWD_RETURN_UNDEF;
3990 if (PerlLIO_stat(".", &statbuf) < 0) {
3991 SV_CWD_RETURN_UNDEF;
3994 cdev = statbuf.st_dev;
3995 cino = statbuf.st_ino;
3997 if (odev == cdev && oino == cino) {
4000 if (!(dir = PerlDir_open("."))) {
4001 SV_CWD_RETURN_UNDEF;
4004 while ((dp = PerlDir_read(dir)) != NULL) {
4006 const int namelen = dp->d_namlen;
4008 const int namelen = strlen(dp->d_name);
4011 if (SV_CWD_ISDOT(dp)) {
4015 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
4016 SV_CWD_RETURN_UNDEF;
4019 tdev = statbuf.st_dev;
4020 tino = statbuf.st_ino;
4021 if (tino == oino && tdev == odev) {
4027 SV_CWD_RETURN_UNDEF;
4030 if (pathlen + namelen + 1 >= MAXPATHLEN) {
4031 SV_CWD_RETURN_UNDEF;
4034 SvGROW(sv, pathlen + namelen + 1);
4038 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
4041 /* prepend current directory to the front */
4043 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
4044 pathlen += (namelen + 1);
4046 #ifdef VOID_CLOSEDIR
4049 if (PerlDir_close(dir) < 0) {
4050 SV_CWD_RETURN_UNDEF;
4056 SvCUR_set(sv, pathlen);
4060 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
4061 SV_CWD_RETURN_UNDEF;
4064 if (PerlLIO_stat(".", &statbuf) < 0) {
4065 SV_CWD_RETURN_UNDEF;
4068 cdev = statbuf.st_dev;
4069 cino = statbuf.st_ino;
4071 if (cdev != orig_cdev || cino != orig_cino) {
4072 Perl_croak(aTHX_ "Unstable directory path, "
4073 "current directory changed unexpectedly");
4085 =for apidoc scan_version
4087 Returns a pointer to the next character after the parsed
4088 version string, as well as upgrading the passed in SV to
4091 Function must be called with an already existing SV like
4094 s = scan_version(s, SV *sv, bool qv);
4096 Performs some preprocessing to the string to ensure that
4097 it has the correct characteristics of a version. Flags the
4098 object if it contains an underscore (which denotes this
4099 is an alpha version). The boolean qv denotes that the version
4100 should be interpreted as if it had multiple decimals, even if
4107 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
4115 AV * const av = newAV();
4116 SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
4117 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4119 #ifndef NODEFAULT_SHAREKEYS
4120 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4123 while (isSPACE(*s)) /* leading whitespace is OK */
4127 s++; /* get past 'v' */
4128 qv = 1; /* force quoted version processing */
4131 start = last = pos = s;
4133 /* pre-scan the input string to check for decimals/underbars */
4134 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
4139 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
4143 else if ( *pos == '_' )
4146 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
4148 width = pos - last - 1; /* natural width of sub-version */
4153 if ( alpha && !saw_period )
4154 Perl_croak(aTHX_ "Invalid version format (alpha without decimal)");
4156 if ( alpha && saw_period && width == 0 )
4157 Perl_croak(aTHX_ "Invalid version format (misplaced _ in number)");
4159 if ( saw_period > 1 )
4160 qv = 1; /* force quoted version processing */
4165 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
4167 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
4168 if ( !qv && width < 3 )
4169 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4171 while (isDIGIT(*pos))
4173 if (!isALPHA(*pos)) {
4179 /* this is atoi() that delimits on underscores */
4180 const char *end = pos;
4184 /* the following if() will only be true after the decimal
4185 * point of a version originally created with a bare
4186 * floating point number, i.e. not quoted in any way
4188 if ( !qv && s > start && saw_period == 1 ) {
4192 rev += (*s - '0') * mult;
4194 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4195 Perl_croak(aTHX_ "Integer overflow in version");
4202 while (--end >= s) {
4204 rev += (*end - '0') * mult;
4206 if ( PERL_ABS(orev) > PERL_ABS(rev) )
4207 Perl_croak(aTHX_ "Integer overflow in version");
4212 /* Append revision */
4213 av_push(av, newSViv(rev));
4216 else if ( *pos == '_' && isDIGIT(pos[1]) )
4218 else if ( isDIGIT(*pos) )
4225 while ( isDIGIT(*pos) )
4230 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4238 if ( qv ) { /* quoted versions always get at least three terms*/
4239 I32 len = av_len(av);
4240 /* This for loop appears to trigger a compiler bug on OS X, as it
4241 loops infinitely. Yes, len is negative. No, it makes no sense.
4242 Compiler in question is:
4243 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4244 for ( len = 2 - len; len > 0; len-- )
4245 av_push((AV *)sv, newSViv(0));
4249 av_push(av, newSViv(0));
4252 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4253 av_push(av, newSViv(0));
4255 /* fix RT#19517 - special case 'undef' as string */
4256 if ( *s == 'u' && strEQ(s,"undef") ) {
4260 /* And finally, store the AV in the hash */
4261 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4266 =for apidoc new_version
4268 Returns a new version object based on the passed in SV:
4270 SV *sv = new_version(SV *ver);
4272 Does not alter the passed in ver SV. See "upg_version" if you
4273 want to upgrade the SV.
4279 Perl_new_version(pTHX_ SV *ver)
4282 SV * const rv = newSV(0);
4283 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4286 AV * const av = newAV();
4288 /* This will get reblessed later if a derived class*/
4289 SV * const hv = newSVrv(rv, "version");
4290 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
4291 #ifndef NODEFAULT_SHAREKEYS
4292 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4298 /* Begin copying all of the elements */
4299 if ( hv_exists((HV *)ver, "qv", 2) )
4300 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4302 if ( hv_exists((HV *)ver, "alpha", 5) )
4303 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4305 if ( hv_exists((HV*)ver, "width", 5 ) )
4307 const I32 width = SvIV(*hv_fetchs((HV*)ver, "width", FALSE));
4308 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4311 sav = (AV *)SvRV(*hv_fetchs((HV*)ver, "version", FALSE));
4312 /* This will get reblessed later if a derived class*/
4313 for ( key = 0; key <= av_len(sav); key++ )
4315 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4316 av_push(av, newSViv(rev));
4319 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
4324 const MAGIC* const mg = SvVSTRING_mg(ver);
4325 if ( mg ) { /* already a v-string */
4326 const STRLEN len = mg->mg_len;
4327 char * const version = savepvn( (const char*)mg->mg_ptr, len);
4328 sv_setpvn(rv,version,len);
4333 sv_setsv(rv,ver); /* make a duplicate */
4338 return upg_version(rv, FALSE);
4342 =for apidoc upg_version
4344 In-place upgrade of the supplied SV to a version object.
4346 SV *sv = upg_version(SV *sv, bool qv);
4348 Returns a pointer to the upgraded SV. Set the boolean qv if you want
4349 to force this SV to be interpreted as an "extended" version.
4355 Perl_upg_version(pTHX_ SV *ver, bool qv)
4357 const char *version, *s;
4362 if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) )
4364 /* may get too much accuracy */
4366 #ifdef USE_LOCALE_NUMERIC
4367 char *loc = setlocale(LC_NUMERIC, "C");
4369 STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver));
4370 #ifdef USE_LOCALE_NUMERIC
4371 setlocale(LC_NUMERIC, loc);
4373 while (tbuf[len-1] == '0' && len > 0) len--;
4374 version = savepvn(tbuf, len);
4377 else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */
4378 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4382 else /* must be a string or something like a string */
4385 version = savepv(SvPV(ver,len));
4387 # if PERL_VERSION > 5
4388 /* This will only be executed for 5.6.0 - 5.8.0 inclusive */
4389 if ( len == 3 && !instr(version,".") && !instr(version,"_") ) {
4390 /* may be a v-string */
4391 SV * const nsv = sv_newmortal();
4395 sv_setpvf(nsv,"%vd",ver);
4396 pos = nver = savepv(SvPV_nolen(nsv));
4398 /* scan the resulting formatted string */
4399 while ( *pos == '.' || isDIGIT(*pos) ) {
4405 /* is definitely a v-string */
4406 if ( saw_period == 2 ) {
4415 s = scan_version(version, ver, qv);
4417 if(ckWARN(WARN_MISC))
4418 Perl_warner(aTHX_ packWARN(WARN_MISC),
4419 "Version string '%s' contains invalid data; "
4420 "ignoring: '%s'", version, s);
4428 Validates that the SV contains a valid version object.
4430 bool vverify(SV *vobj);
4432 Note that it only confirms the bare minimum structure (so as not to get
4433 confused by derived classes which may contain additional hash entries):
4437 =item * The SV contains a [reference to a] hash
4439 =item * The hash contains a "version" key
4441 =item * The "version" key has [a reference to] an AV as its value
4449 Perl_vverify(pTHX_ SV *vs)
4455 /* see if the appropriate elements exist */
4456 if ( SvTYPE(vs) == SVt_PVHV
4457 && hv_exists((HV*)vs, "version", 7)
4458 && (sv = SvRV(*hv_fetchs((HV*)vs, "version", FALSE)))
4459 && SvTYPE(sv) == SVt_PVAV )
4468 Accepts a version object and returns the normalized floating
4469 point representation. Call like:
4473 NOTE: you can pass either the object directly or the SV
4474 contained within the RV.
4480 Perl_vnumify(pTHX_ SV *vs)
4485 SV * const sv = newSV(0);
4491 Perl_croak(aTHX_ "Invalid version object");
4493 /* see if various flags exist */
4494 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4496 if ( hv_exists((HV*)vs, "width", 5 ) )
4497 width = SvIV(*hv_fetchs((HV*)vs, "width", FALSE));
4502 /* attempt to retrieve the version array */
4503 if ( !(av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE)) ) ) {
4515 digit = SvIV(*av_fetch(av, 0, 0));
4516 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
4517 for ( i = 1 ; i < len ; i++ )
4519 digit = SvIV(*av_fetch(av, i, 0));
4521 const int denom = (width == 2 ? 10 : 100);
4522 const div_t term = div((int)PERL_ABS(digit),denom);
4523 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
4526 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4532 digit = SvIV(*av_fetch(av, len, 0));
4533 if ( alpha && width == 3 ) /* alpha version */
4535 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
4539 sv_catpvs(sv, "000");
4547 Accepts a version object and returns the normalized string
4548 representation. Call like:
4552 NOTE: you can pass either the object directly or the SV
4553 contained within the RV.
4559 Perl_vnormal(pTHX_ SV *vs)
4563 SV * const sv = newSV(0);
4569 Perl_croak(aTHX_ "Invalid version object");
4571 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4573 av = (AV *)SvRV(*hv_fetchs((HV*)vs, "version", FALSE));
4581 digit = SvIV(*av_fetch(av, 0, 0));
4582 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
4583 for ( i = 1 ; i < len ; i++ ) {
4584 digit = SvIV(*av_fetch(av, i, 0));
4585 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4590 /* handle last digit specially */
4591 digit = SvIV(*av_fetch(av, len, 0));
4593 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4595 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4598 if ( len <= 2 ) { /* short version, must be at least three */
4599 for ( len = 2 - len; len != 0; len-- )
4606 =for apidoc vstringify
4608 In order to maintain maximum compatibility with earlier versions
4609 of Perl, this function will return either the floating point
4610 notation or the multiple dotted notation, depending on whether
4611 the original version contained 1 or more dots, respectively
4617 Perl_vstringify(pTHX_ SV *vs)
4623 Perl_croak(aTHX_ "Invalid version object");
4625 if ( hv_exists((HV *)vs, "qv", 2) )
4634 Version object aware cmp. Both operands must already have been
4635 converted into version objects.
4641 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4644 bool lalpha = FALSE;
4645 bool ralpha = FALSE;
4654 if ( !vverify(lhv) )
4655 Perl_croak(aTHX_ "Invalid version object");
4657 if ( !vverify(rhv) )
4658 Perl_croak(aTHX_ "Invalid version object");
4660 /* get the left hand term */
4661 lav = (AV *)SvRV(*hv_fetchs((HV*)lhv, "version", FALSE));
4662 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4665 /* and the right hand term */
4666 rav = (AV *)SvRV(*hv_fetchs((HV*)rhv, "version", FALSE));
4667 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4675 while ( i <= m && retval == 0 )
4677 left = SvIV(*av_fetch(lav,i,0));
4678 right = SvIV(*av_fetch(rav,i,0));
4686 /* tiebreaker for alpha with identical terms */
4687 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4689 if ( lalpha && !ralpha )
4693 else if ( ralpha && !lalpha)
4699 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4703 while ( i <= r && retval == 0 )
4705 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4706 retval = -1; /* not a match after all */
4712 while ( i <= l && retval == 0 )
4714 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4715 retval = +1; /* not a match after all */
4723 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4724 # define EMULATE_SOCKETPAIR_UDP
4727 #ifdef EMULATE_SOCKETPAIR_UDP
4729 S_socketpair_udp (int fd[2]) {
4731 /* Fake a datagram socketpair using UDP to localhost. */
4732 int sockets[2] = {-1, -1};
4733 struct sockaddr_in addresses[2];
4735 Sock_size_t size = sizeof(struct sockaddr_in);
4736 unsigned short port;
4739 memset(&addresses, 0, sizeof(addresses));
4742 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4743 if (sockets[i] == -1)
4744 goto tidy_up_and_fail;
4746 addresses[i].sin_family = AF_INET;
4747 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4748 addresses[i].sin_port = 0; /* kernel choses port. */
4749 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4750 sizeof(struct sockaddr_in)) == -1)
4751 goto tidy_up_and_fail;
4754 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4755 for each connect the other socket to it. */
4758 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4760 goto tidy_up_and_fail;
4761 if (size != sizeof(struct sockaddr_in))
4762 goto abort_tidy_up_and_fail;
4763 /* !1 is 0, !0 is 1 */
4764 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4765 sizeof(struct sockaddr_in)) == -1)
4766 goto tidy_up_and_fail;
4769 /* Now we have 2 sockets connected to each other. I don't trust some other
4770 process not to have already sent a packet to us (by random) so send
4771 a packet from each to the other. */
4774 /* I'm going to send my own port number. As a short.
4775 (Who knows if someone somewhere has sin_port as a bitfield and needs
4776 this routine. (I'm assuming crays have socketpair)) */
4777 port = addresses[i].sin_port;
4778 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4779 if (got != sizeof(port)) {
4781 goto tidy_up_and_fail;
4782 goto abort_tidy_up_and_fail;
4786 /* Packets sent. I don't trust them to have arrived though.
4787 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4788 connect to localhost will use a second kernel thread. In 2.6 the
4789 first thread running the connect() returns before the second completes,
4790 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4791 returns 0. Poor programs have tripped up. One poor program's authors'
4792 had a 50-1 reverse stock split. Not sure how connected these were.)
4793 So I don't trust someone not to have an unpredictable UDP stack.
4797 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4798 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4802 FD_SET((unsigned int)sockets[0], &rset);
4803 FD_SET((unsigned int)sockets[1], &rset);
4805 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4806 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4807 || !FD_ISSET(sockets[1], &rset)) {
4808 /* I hope this is portable and appropriate. */
4810 goto tidy_up_and_fail;
4811 goto abort_tidy_up_and_fail;
4815 /* And the paranoia department even now doesn't trust it to have arrive
4816 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4818 struct sockaddr_in readfrom;
4819 unsigned short buffer[2];
4824 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4825 sizeof(buffer), MSG_DONTWAIT,
4826 (struct sockaddr *) &readfrom, &size);
4828 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4830 (struct sockaddr *) &readfrom, &size);
4834 goto tidy_up_and_fail;
4835 if (got != sizeof(port)
4836 || size != sizeof(struct sockaddr_in)
4837 /* Check other socket sent us its port. */
4838 || buffer[0] != (unsigned short) addresses[!i].sin_port
4839 /* Check kernel says we got the datagram from that socket */
4840 || readfrom.sin_family != addresses[!i].sin_family
4841 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4842 || readfrom.sin_port != addresses[!i].sin_port)
4843 goto abort_tidy_up_and_fail;
4846 /* My caller (my_socketpair) has validated that this is non-NULL */
4849 /* I hereby declare this connection open. May God bless all who cross
4853 abort_tidy_up_and_fail:
4854 errno = ECONNABORTED;
4857 const int save_errno = errno;
4858 if (sockets[0] != -1)
4859 PerlLIO_close(sockets[0]);
4860 if (sockets[1] != -1)
4861 PerlLIO_close(sockets[1]);
4866 #endif /* EMULATE_SOCKETPAIR_UDP */
4868 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4870 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4871 /* Stevens says that family must be AF_LOCAL, protocol 0.
4872 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4877 struct sockaddr_in listen_addr;
4878 struct sockaddr_in connect_addr;
4883 || family != AF_UNIX
4886 errno = EAFNOSUPPORT;
4894 #ifdef EMULATE_SOCKETPAIR_UDP
4895 if (type == SOCK_DGRAM)
4896 return S_socketpair_udp(fd);
4899 listener = PerlSock_socket(AF_INET, type, 0);
4902 memset(&listen_addr, 0, sizeof(listen_addr));
4903 listen_addr.sin_family = AF_INET;
4904 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4905 listen_addr.sin_port = 0; /* kernel choses port. */
4906 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4907 sizeof(listen_addr)) == -1)
4908 goto tidy_up_and_fail;
4909 if (PerlSock_listen(listener, 1) == -1)
4910 goto tidy_up_and_fail;
4912 connector = PerlSock_socket(AF_INET, type, 0);
4913 if (connector == -1)
4914 goto tidy_up_and_fail;
4915 /* We want to find out the port number to connect to. */
4916 size = sizeof(connect_addr);
4917 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4919 goto tidy_up_and_fail;
4920 if (size != sizeof(connect_addr))
4921 goto abort_tidy_up_and_fail;
4922 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4923 sizeof(connect_addr)) == -1)
4924 goto tidy_up_and_fail;
4926 size = sizeof(listen_addr);
4927 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4930 goto tidy_up_and_fail;
4931 if (size != sizeof(listen_addr))
4932 goto abort_tidy_up_and_fail;
4933 PerlLIO_close(listener);
4934 /* Now check we are talking to ourself by matching port and host on the
4936 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4938 goto tidy_up_and_fail;
4939 if (size != sizeof(connect_addr)
4940 || listen_addr.sin_family != connect_addr.sin_family
4941 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4942 || listen_addr.sin_port != connect_addr.sin_port) {
4943 goto abort_tidy_up_and_fail;
4949 abort_tidy_up_and_fail:
4951 errno = ECONNABORTED; /* This would be the standard thing to do. */
4953 # ifdef ECONNREFUSED
4954 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4956 errno = ETIMEDOUT; /* Desperation time. */
4961 const int save_errno = errno;
4963 PerlLIO_close(listener);
4964 if (connector != -1)
4965 PerlLIO_close(connector);
4967 PerlLIO_close(acceptor);
4973 /* In any case have a stub so that there's code corresponding
4974 * to the my_socketpair in global.sym. */
4976 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4977 #ifdef HAS_SOCKETPAIR
4978 return socketpair(family, type, protocol, fd);
4987 =for apidoc sv_nosharing
4989 Dummy routine which "shares" an SV when there is no sharing module present.
4990 Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument.
4991 Exists to avoid test for a NULL function pointer and because it could
4992 potentially warn under some level of strict-ness.
4998 Perl_sv_nosharing(pTHX_ SV *sv)
5000 PERL_UNUSED_CONTEXT;
5001 PERL_UNUSED_ARG(sv);
5005 Perl_parse_unicode_opts(pTHX_ const char **popt)
5007 const char *p = *popt;
5012 opt = (U32) atoi(p);
5015 if (*p && *p != '\n' && *p != '\r')
5016 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
5021 case PERL_UNICODE_STDIN:
5022 opt |= PERL_UNICODE_STDIN_FLAG; break;
5023 case PERL_UNICODE_STDOUT:
5024 opt |= PERL_UNICODE_STDOUT_FLAG; break;
5025 case PERL_UNICODE_STDERR:
5026 opt |= PERL_UNICODE_STDERR_FLAG; break;
5027 case PERL_UNICODE_STD:
5028 opt |= PERL_UNICODE_STD_FLAG; break;
5029 case PERL_UNICODE_IN:
5030 opt |= PERL_UNICODE_IN_FLAG; break;
5031 case PERL_UNICODE_OUT:
5032 opt |= PERL_UNICODE_OUT_FLAG; break;
5033 case PERL_UNICODE_INOUT:
5034 opt |= PERL_UNICODE_INOUT_FLAG; break;
5035 case PERL_UNICODE_LOCALE:
5036 opt |= PERL_UNICODE_LOCALE_FLAG; break;
5037 case PERL_UNICODE_ARGV:
5038 opt |= PERL_UNICODE_ARGV_FLAG; break;
5039 case PERL_UNICODE_UTF8CACHEASSERT:
5040 opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break;
5042 if (*p != '\n' && *p != '\r')
5044 "Unknown Unicode option letter '%c'", *p);
5050 opt = PERL_UNICODE_DEFAULT_FLAGS;
5052 if (opt & ~PERL_UNICODE_ALL_FLAGS)
5053 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
5054 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
5066 * This is really just a quick hack which grabs various garbage
5067 * values. It really should be a real hash algorithm which
5068 * spreads the effect of every input bit onto every output bit,
5069 * if someone who knows about such things would bother to write it.
5070 * Might be a good idea to add that function to CORE as well.
5071 * No numbers below come from careful analysis or anything here,
5072 * except they are primes and SEED_C1 > 1E6 to get a full-width
5073 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
5074 * probably be bigger too.
5077 # define SEED_C1 1000003
5078 #define SEED_C4 73819
5080 # define SEED_C1 25747
5081 #define SEED_C4 20639
5085 #define SEED_C5 26107
5087 #ifndef PERL_NO_DEV_RANDOM
5092 # include <starlet.h>
5093 /* when[] = (low 32 bits, high 32 bits) of time since epoch
5094 * in 100-ns units, typically incremented ever 10 ms. */
5095 unsigned int when[2];
5097 # ifdef HAS_GETTIMEOFDAY
5098 struct timeval when;
5104 /* This test is an escape hatch, this symbol isn't set by Configure. */
5105 #ifndef PERL_NO_DEV_RANDOM
5106 #ifndef PERL_RANDOM_DEVICE
5107 /* /dev/random isn't used by default because reads from it will block
5108 * if there isn't enough entropy available. You can compile with
5109 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
5110 * is enough real entropy to fill the seed. */
5111 # define PERL_RANDOM_DEVICE "/dev/urandom"
5113 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
5115 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
5124 _ckvmssts(sys$gettim(when));
5125 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
5127 # ifdef HAS_GETTIMEOFDAY
5128 PerlProc_gettimeofday(&when,NULL);
5129 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
5132 u = (U32)SEED_C1 * when;
5135 u += SEED_C3 * (U32)PerlProc_getpid();
5136 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
5137 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
5138 u += SEED_C5 * (U32)PTR2UV(&when);
5144 Perl_get_hash_seed(pTHX)
5147 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
5153 if (s && isDIGIT(*s))
5154 myseed = (UV)Atoul(s);
5156 #ifdef USE_HASH_SEED_EXPLICIT
5160 /* Compute a random seed */
5161 (void)seedDrand01((Rand_seed_t)seed());
5162 myseed = (UV)(Drand01() * (NV)UV_MAX);
5163 #if RANDBITS < (UVSIZE * 8)
5164 /* Since there are not enough randbits to to reach all
5165 * the bits of a UV, the low bits might need extra
5166 * help. Sum in another random number that will
5167 * fill in the low bits. */
5169 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
5170 #endif /* RANDBITS < (UVSIZE * 8) */
5171 if (myseed == 0) { /* Superparanoia. */
5172 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
5174 Perl_croak(aTHX_ "Your random numbers are not that random");
5177 PL_rehash_seed_set = TRUE;
5184 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
5186 const char * const stashpv = CopSTASHPV(c);
5187 const char * const name = HvNAME_get(hv);
5188 PERL_UNUSED_CONTEXT;
5190 if (stashpv == name)
5192 if (stashpv && name)
5193 if (strEQ(stashpv, name))
5200 #ifdef PERL_GLOBAL_STRUCT
5202 #define PERL_GLOBAL_STRUCT_INIT
5203 #include "opcode.h" /* the ppaddr and check */
5206 Perl_init_global_struct(pTHX)
5208 struct perl_vars *plvarsp = NULL;
5209 # ifdef PERL_GLOBAL_STRUCT
5210 const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
5211 const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
5212 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5213 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
5214 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
5218 plvarsp = PL_VarsPtr;
5219 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
5225 # define PERLVAR(var,type) /**/
5226 # define PERLVARA(var,n,type) /**/
5227 # define PERLVARI(var,type,init) plvarsp->var = init;
5228 # define PERLVARIC(var,type,init) plvarsp->var = init;
5229 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
5230 # include "perlvars.h"
5236 # ifdef PERL_GLOBAL_STRUCT
5239 PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5240 if (!plvarsp->Gppaddr)
5244 PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5245 if (!plvarsp->Gcheck)
5247 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5248 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5250 # ifdef PERL_SET_VARS
5251 PERL_SET_VARS(plvarsp);
5253 # undef PERL_GLOBAL_STRUCT_INIT
5258 #endif /* PERL_GLOBAL_STRUCT */
5260 #ifdef PERL_GLOBAL_STRUCT
5263 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5265 # ifdef PERL_GLOBAL_STRUCT
5266 # ifdef PERL_UNSET_VARS
5267 PERL_UNSET_VARS(plvarsp);
5269 free(plvarsp->Gppaddr);
5270 free(plvarsp->Gcheck);
5271 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
5277 #endif /* PERL_GLOBAL_STRUCT */
5282 * PERL_MEM_LOG: the Perl_mem_log_..() will be compiled.
5284 * PERL_MEM_LOG_ENV: if defined, during run time the environment
5285 * variable PERL_MEM_LOG will be consulted, and if the integer value
5286 * of that is true, the logging will happen. (The default is to
5287 * always log if the PERL_MEM_LOG define was in effect.)
5291 * PERL_MEM_LOG_SPRINTF_BUF_SIZE: size of a (stack-allocated) buffer
5292 * the Perl_mem_log_...() will use (either via sprintf or snprintf).
5294 #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5297 * PERL_MEM_LOG_FD: the file descriptor the Perl_mem_log_...() will
5298 * log to. You can also define in compile time PERL_MEM_LOG_ENV_FD,
5299 * in which case the environment variable PERL_MEM_LOG_FD will be
5300 * consulted for the file descriptor number to use.
5302 #ifndef PERL_MEM_LOG_FD
5303 # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */
5307 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)
5309 #ifdef PERL_MEM_LOG_STDERR
5310 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5313 # ifdef PERL_MEM_LOG_ENV
5314 s = getenv("PERL_MEM_LOG");
5315 if (s ? atoi(s) : 0)
5318 /* We can't use SVs or PerlIO for obvious reasons,
5319 * so we'll use stdio and low-level IO instead. */
5320 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5321 # ifdef PERL_MEM_LOG_TIMESTAMP
5323 # ifdef HAS_GETTIMEOFDAY
5324 gettimeofday(&tv, 0);
5326 /* If there are other OS specific ways of hires time than
5327 * gettimeofday() (see ext/Time/HiRes), the easiest way is
5328 * probably that they would be used to fill in the struct
5335 # ifdef PERL_MEM_LOG_TIMESTAMP
5338 "alloc: %s:%d:%s: %"IVdf" %"UVuf
5339 " %s = %"IVdf": %"UVxf"\n",
5340 # ifdef PERL_MEM_LOG_TIMESTAMP
5341 (int)tv.tv_sec, (int)tv.tv_usec,
5343 filename, linenumber, funcname, n, typesize,
5344 typename, n * typesize, PTR2UV(newalloc));
5345 # ifdef PERL_MEM_LOG_ENV_FD
5346 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5347 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5349 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5358 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)
5360 #ifdef PERL_MEM_LOG_STDERR
5361 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5364 # ifdef PERL_MEM_LOG_ENV
5365 s = PerlEnv_getenv("PERL_MEM_LOG");
5366 if (s ? atoi(s) : 0)
5369 /* We can't use SVs or PerlIO for obvious reasons,
5370 * so we'll use stdio and low-level IO instead. */
5371 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5372 # ifdef PERL_MEM_LOG_TIMESTAMP
5374 gettimeofday(&tv, 0);
5380 # ifdef PERL_MEM_LOG_TIMESTAMP
5383 "realloc: %s:%d:%s: %"IVdf" %"UVuf
5384 " %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5385 # ifdef PERL_MEM_LOG_TIMESTAMP
5386 (int)tv.tv_sec, (int)tv.tv_usec,
5388 filename, linenumber, funcname, n, typesize,
5389 typename, n * typesize, PTR2UV(oldalloc),
5391 # ifdef PERL_MEM_LOG_ENV_FD
5392 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5393 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5395 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5404 Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
5406 #ifdef PERL_MEM_LOG_STDERR
5407 # if defined(PERL_MEM_LOG_ENV) || defined(PERL_MEM_LOG_ENV_FD)
5410 # ifdef PERL_MEM_LOG_ENV
5411 s = PerlEnv_getenv("PERL_MEM_LOG");
5412 if (s ? atoi(s) : 0)
5415 /* We can't use SVs or PerlIO for obvious reasons,
5416 * so we'll use stdio and low-level IO instead. */
5417 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
5418 # ifdef PERL_MEM_LOG_TIMESTAMP
5420 gettimeofday(&tv, 0);
5426 # ifdef PERL_MEM_LOG_TIMESTAMP
5429 "free: %s:%d:%s: %"UVxf"\n",
5430 # ifdef PERL_MEM_LOG_TIMESTAMP
5431 (int)tv.tv_sec, (int)tv.tv_usec,
5433 filename, linenumber, funcname,
5435 # ifdef PERL_MEM_LOG_ENV_FD
5436 s = PerlEnv_getenv("PERL_MEM_LOG_FD");
5437 PerlLIO_write(s ? atoi(s) : PERL_MEM_LOG_FD, buf, len);
5439 PerlLIO_write(PERL_MEM_LOG_FD, buf, len);
5447 #endif /* PERL_MEM_LOG */
5450 =for apidoc my_sprintf
5452 The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5453 the length of the string written to the buffer. Only rare pre-ANSI systems
5454 need the wrapper function - usually this is a direct call to C<sprintf>.
5458 #ifndef SPRINTF_RETURNS_STRLEN
5460 Perl_my_sprintf(char *buffer, const char* pat, ...)
5463 va_start(args, pat);
5464 vsprintf(buffer, pat, args);
5466 return strlen(buffer);
5471 =for apidoc my_snprintf
5473 The C library C<snprintf> functionality, if available and
5474 standards-compliant (uses C<vsnprintf>, actually). However, if the
5475 C<vsnprintf> is not available, will unfortunately use the unsafe
5476 C<vsprintf> which can overrun the buffer (there is an overrun check,
5477 but that may be too late). Consider using C<sv_vcatpvf> instead, or
5478 getting C<vsnprintf>.
5483 Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...)
5488 va_start(ap, format);
5489 #ifdef HAS_VSNPRINTF
5490 retval = vsnprintf(buffer, len, format, ap);
5492 retval = vsprintf(buffer, format, ap);
5495 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5496 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5497 Perl_croak(aTHX_ "panic: my_snprintf buffer overflow");
5502 =for apidoc my_vsnprintf
5504 The C library C<vsnprintf> if available and standards-compliant.
5505 However, if if the C<vsnprintf> is not available, will unfortunately
5506 use the unsafe C<vsprintf> which can overrun the buffer (there is an
5507 overrun check, but that may be too late). Consider using
5508 C<sv_vcatpvf> instead, or getting C<vsnprintf>.
5513 Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap)
5519 Perl_va_copy(ap, apc);
5520 # ifdef HAS_VSNPRINTF
5521 retval = vsnprintf(buffer, len, format, apc);
5523 retval = vsprintf(buffer, format, apc);
5526 # ifdef HAS_VSNPRINTF
5527 retval = vsnprintf(buffer, len, format, ap);
5529 retval = vsprintf(buffer, format, ap);
5531 #endif /* #ifdef NEED_VA_COPY */
5532 /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */
5533 if (retval < 0 || (len > 0 && (Size_t)retval >= len))
5534 Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow");
5539 Perl_my_clearenv(pTHX)
5542 #if ! defined(PERL_MICRO)
5543 # if defined(PERL_IMPLICIT_SYS) || defined(WIN32)
5545 # else /* ! (PERL_IMPLICIT_SYS || WIN32) */
5546 # if defined(USE_ENVIRON_ARRAY)
5547 # if defined(USE_ITHREADS)
5548 /* only the parent thread can clobber the process environment */
5549 if (PL_curinterp == aTHX)
5550 # endif /* USE_ITHREADS */
5552 # if ! defined(PERL_USE_SAFE_PUTENV)
5553 if ( !PL_use_safe_putenv) {
5555 if (environ == PL_origenviron)
5556 environ = (char**)safesysmalloc(sizeof(char*));
5558 for (i = 0; environ[i]; i++)
5559 (void)safesysfree(environ[i]);
5562 # else /* PERL_USE_SAFE_PUTENV */
5563 # if defined(HAS_CLEARENV)
5565 # elif defined(HAS_UNSETENV)
5566 int bsiz = 80; /* Most envvar names will be shorter than this. */
5567 int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */
5568 char *buf = (char*)safesysmalloc(bufsiz);
5569 while (*environ != NULL) {
5570 char *e = strchr(*environ, '=');
5571 int l = e ? e - *environ : (int)strlen(*environ);
5573 (void)safesysfree(buf);
5574 bsiz = l + 1; /* + 1 for the \0. */
5575 buf = (char*)safesysmalloc(bufsiz);
5577 my_strlcpy(buf, *environ, l + 1);
5578 (void)unsetenv(buf);
5580 (void)safesysfree(buf);
5581 # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */
5582 /* Just null environ and accept the leakage. */
5584 # endif /* HAS_CLEARENV || HAS_UNSETENV */
5585 # endif /* ! PERL_USE_SAFE_PUTENV */
5587 # endif /* USE_ENVIRON_ARRAY */
5588 # endif /* PERL_IMPLICIT_SYS || WIN32 */
5589 #endif /* PERL_MICRO */
5592 #ifdef PERL_IMPLICIT_CONTEXT
5594 /* Implements the MY_CXT_INIT macro. The first time a module is loaded,
5595 the global PL_my_cxt_index is incremented, and that value is assigned to
5596 that module's static my_cxt_index (who's address is passed as an arg).
5597 Then, for each interpreter this function is called for, it makes sure a
5598 void* slot is available to hang the static data off, by allocating or
5599 extending the interpreter's PL_my_cxt_list array */
5601 #ifndef PERL_GLOBAL_STRUCT_PRIVATE
5603 Perl_my_cxt_init(pTHX_ int *index, size_t size)
5608 /* this module hasn't been allocated an index yet */
5609 MUTEX_LOCK(&PL_my_ctx_mutex);
5610 *index = PL_my_cxt_index++;
5611 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5614 /* make sure the array is big enough */
5615 if (PL_my_cxt_size <= *index) {
5616 if (PL_my_cxt_size) {
5617 while (PL_my_cxt_size <= *index)
5618 PL_my_cxt_size *= 2;
5619 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5622 PL_my_cxt_size = 16;
5623 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5626 /* newSV() allocates one more than needed */
5627 p = (void*)SvPVX(newSV(size-1));
5628 PL_my_cxt_list[*index] = p;
5629 Zero(p, size, char);
5633 #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5636 Perl_my_cxt_index(pTHX_ const char *my_cxt_key)
5641 for (index = 0; index < PL_my_cxt_index; index++) {
5642 const char *key = PL_my_cxt_keys[index];
5643 /* try direct pointer compare first - there are chances to success,
5644 * and it's much faster.
5646 if ((key == my_cxt_key) || strEQ(key, my_cxt_key))
5653 Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size)
5659 index = Perl_my_cxt_index(aTHX_ my_cxt_key);
5661 /* this module hasn't been allocated an index yet */
5662 MUTEX_LOCK(&PL_my_ctx_mutex);
5663 index = PL_my_cxt_index++;
5664 MUTEX_UNLOCK(&PL_my_ctx_mutex);
5667 /* make sure the array is big enough */
5668 if (PL_my_cxt_size <= index) {
5669 int old_size = PL_my_cxt_size;
5671 if (PL_my_cxt_size) {
5672 while (PL_my_cxt_size <= index)
5673 PL_my_cxt_size *= 2;
5674 Renew(PL_my_cxt_list, PL_my_cxt_size, void *);
5675 Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5678 PL_my_cxt_size = 16;
5679 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
5680 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
5682 for (i = old_size; i < PL_my_cxt_size; i++) {
5683 PL_my_cxt_keys[i] = 0;
5684 PL_my_cxt_list[i] = 0;
5687 PL_my_cxt_keys[index] = my_cxt_key;
5688 /* newSV() allocates one more than needed */
5689 p = (void*)SvPVX(newSV(size-1));
5690 PL_my_cxt_list[index] = p;
5691 Zero(p, size, char);
5694 #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */
5695 #endif /* PERL_IMPLICIT_CONTEXT */
5699 Perl_my_strlcat(char *dst, const char *src, Size_t size)
5701 Size_t used, length, copy;
5704 length = strlen(src);
5705 if (size > 0 && used < size - 1) {
5706 copy = (length >= size - used) ? size - used - 1 : length;
5707 memcpy(dst + used, src, copy);
5708 dst[used + copy] = '\0';
5710 return used + length;
5716 Perl_my_strlcpy(char *dst, const char *src, Size_t size)
5718 Size_t length, copy;
5720 length = strlen(src);
5722 copy = (length >= size) ? size - 1 : length;
5723 memcpy(dst, src, copy);
5730 #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500)
5731 /* VC7 or 7.1, building with pre-VC7 runtime libraries. */
5732 long _ftol( double ); /* Defined by VC6 C libs. */
5733 long _ftol2( double dblSource ) { return _ftol( dblSource ); }
5737 Perl_get_db_sub(pTHX_ SV **svp, CV *cv)
5740 SV * const dbsv = GvSVn(PL_DBsub);
5741 /* We do not care about using sv to call CV;
5742 * it's for informational purposes only.
5746 if (!PERLDB_SUB_NN) {
5747 GV * const gv = CvGV(cv);
5749 if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
5750 || strEQ(GvNAME(gv), "END")
5751 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
5752 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) )))) {
5753 /* Use GV from the stack as a fallback. */
5754 /* GV is potentially non-unique, or contain different CV. */
5755 SV * const tmp = newRV((SV*)cv);
5756 sv_setsv(dbsv, tmp);
5760 gv_efullname3(dbsv, gv, NULL);
5764 const int type = SvTYPE(dbsv);
5765 if (type < SVt_PVIV && type != SVt_IV)
5766 sv_upgrade(dbsv, SVt_PVIV);
5767 (void)SvIOK_on(dbsv);
5768 SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */
5774 * c-indentation-style: bsd
5776 * indent-tabs-mode: t
5779 * ex: set ts=8 sts=4 sw=4 noet: