3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 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.
60 /* paranoid version of system's malloc() */
63 Perl_safesysmalloc(MEM_SIZE size)
69 PerlIO_printf(Perl_error_log,
70 "Allocation too large: %lx\n", size) FLUSH;
73 #endif /* HAS_64K_LIMIT */
76 Perl_croak_nocontext("panic: malloc");
78 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
79 PERL_ALLOC_CHECK(ptr);
80 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
86 /* Can't use PerlIO to write as it allocates memory */
87 PerlLIO_write(PerlIO_fileno(Perl_error_log),
88 PL_no_mem, strlen(PL_no_mem));
95 /* paranoid version of system's realloc() */
98 Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
102 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
103 Malloc_t PerlMem_realloc();
104 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
108 PerlIO_printf(Perl_error_log,
109 "Reallocation too large: %lx\n", size) FLUSH;
112 #endif /* HAS_64K_LIMIT */
119 return safesysmalloc(size);
122 Perl_croak_nocontext("panic: realloc");
124 ptr = (Malloc_t)PerlMem_realloc(where,size);
125 PERL_ALLOC_CHECK(ptr);
127 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
128 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
135 /* Can't use PerlIO to write as it allocates memory */
136 PerlLIO_write(PerlIO_fileno(Perl_error_log),
137 PL_no_mem, strlen(PL_no_mem));
144 /* safe version of system's free() */
147 Perl_safesysfree(Malloc_t where)
150 #ifdef PERL_IMPLICIT_SYS
153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
159 /* safe version of system's calloc() */
162 Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
168 if (size * count > 0xffff) {
169 PerlIO_printf(Perl_error_log,
170 "Allocation too large: %lx\n", size * count) FLUSH;
173 #endif /* HAS_64K_LIMIT */
175 if ((long)size < 0 || (long)count < 0)
176 Perl_croak_nocontext("panic: calloc");
179 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
180 PERL_ALLOC_CHECK(ptr);
181 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)size));
183 memset((void*)ptr, 0, size);
189 /* Can't use PerlIO to write as it allocates memory */
190 PerlLIO_write(PerlIO_fileno(Perl_error_log),
191 PL_no_mem, strlen(PL_no_mem));
198 /* These must be defined when not using Perl's malloc for binary
203 Malloc_t Perl_malloc (MEM_SIZE nbytes)
206 return (Malloc_t)PerlMem_malloc(nbytes);
209 Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
212 return (Malloc_t)PerlMem_calloc(elements, size);
215 Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
218 return (Malloc_t)PerlMem_realloc(where, nbytes);
221 Free_t Perl_mfree (Malloc_t where)
229 /* copy a string up to some (non-backslashed) delimiter, if any */
232 Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
235 for (tolen = 0; from < fromend; from++, tolen++) {
237 if (from[1] == delim)
246 else if (*from == delim)
257 /* return ptr to little string in big string, NULL if not found */
258 /* This routine was donated by Corey Satten. */
261 Perl_instr(pTHX_ register const char *big, register const char *little)
271 register const char *s, *x;
274 for (x=big,s=little; *s; /**/ ) {
283 return (char*)(big-1);
288 /* same as instr but allow embedded nulls */
291 Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
293 register const I32 first = *little;
294 register const char *littleend = lend;
296 if (!first && little >= littleend)
298 if (bigend - big < littleend - little)
300 bigend -= littleend - little++;
301 while (big <= bigend) {
302 register const char *s, *x;
305 for (x=big,s=little; s < littleend; /**/ ) {
312 return (char*)(big-1);
317 /* reverse of the above--find last substring */
320 Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
322 register const char *bigbeg;
323 register const I32 first = *little;
324 register const char *littleend = lend;
326 if (!first && little >= littleend)
327 return (char*)bigend;
329 big = bigend - (littleend - little++);
330 while (big >= bigbeg) {
331 register const char *s, *x;
334 for (x=big+2,s=little; s < littleend; /**/ ) {
341 return (char*)(big+1);
346 #define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
348 /* As a space optimization, we do not compile tables for strings of length
349 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
350 special-cased in fbm_instr().
352 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
355 =head1 Miscellaneous Functions
357 =for apidoc fbm_compile
359 Analyses the string in order to make fast searches on it using fbm_instr()
360 -- the Boyer-Moore algorithm.
366 Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
368 const register U8 *s;
375 if (flags & FBMcf_TAIL) {
376 MAGIC *mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
377 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
378 if (mg && mg->mg_len >= 0)
381 s = (U8*)SvPV_force_mutable(sv, len);
382 SvUPGRADE(sv, SVt_PVBM);
383 if (len == 0) /* TAIL might be on a zero-length string. */
386 const unsigned char *sb;
387 const U8 mlen = (len>255) ? 255 : (U8)len;
389 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
390 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
391 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
392 memset((void*)table, mlen, 256);
393 table[-1] = (U8)flags;
395 sb = s - mlen + 1; /* first char (maybe) */
397 if (table[*s] == mlen)
402 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
405 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
406 for (i = 0; i < len; i++) {
407 if (PL_freq[s[i]] < frequency) {
409 frequency = PL_freq[s[i]];
412 BmRARE(sv) = s[rarest];
413 BmPREVIOUS(sv) = (U16)rarest;
414 BmUSEFUL(sv) = 100; /* Initial value */
415 if (flags & FBMcf_TAIL)
417 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
418 BmRARE(sv),BmPREVIOUS(sv)));
421 /* If SvTAIL(littlestr), it has a fake '\n' at end. */
422 /* If SvTAIL is actually due to \Z or \z, this gives false positives
426 =for apidoc fbm_instr
428 Returns the location of the SV in the string delimited by C<str> and
429 C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
430 does not have to be fbm_compiled, but the search will not be as fast
437 Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
439 register unsigned char *s;
441 register const unsigned char *little
442 = (const unsigned char *)SvPV_const(littlestr,l);
443 register STRLEN littlelen = l;
444 register const I32 multiline = flags & FBMrf_MULTILINE;
446 if ((STRLEN)(bigend - big) < littlelen) {
447 if ( SvTAIL(littlestr)
448 && ((STRLEN)(bigend - big) == littlelen - 1)
450 || (*big == *little &&
451 memEQ((char *)big, (char *)little, littlelen - 1))))
456 if (littlelen <= 2) { /* Special-cased */
458 if (littlelen == 1) {
459 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
460 /* Know that bigend != big. */
461 if (bigend[-1] == '\n')
462 return (char *)(bigend - 1);
463 return (char *) bigend;
471 if (SvTAIL(littlestr))
472 return (char *) bigend;
476 return (char*)big; /* Cannot be SvTAIL! */
479 if (SvTAIL(littlestr) && !multiline) {
480 if (bigend[-1] == '\n' && bigend[-2] == *little)
481 return (char*)bigend - 2;
482 if (bigend[-1] == *little)
483 return (char*)bigend - 1;
487 /* This should be better than FBM if c1 == c2, and almost
488 as good otherwise: maybe better since we do less indirection.
489 And we save a lot of memory by caching no table. */
490 const unsigned char c1 = little[0];
491 const unsigned char c2 = little[1];
496 while (s <= bigend) {
506 goto check_1char_anchor;
517 goto check_1char_anchor;
520 while (s <= bigend) {
525 goto check_1char_anchor;
534 check_1char_anchor: /* One char and anchor! */
535 if (SvTAIL(littlestr) && (*bigend == *little))
536 return (char *)bigend; /* bigend is already decremented. */
539 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
540 s = bigend - littlelen;
541 if (s >= big && bigend[-1] == '\n' && *s == *little
542 /* Automatically of length > 2 */
543 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
545 return (char*)s; /* how sweet it is */
548 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
550 return (char*)s + 1; /* how sweet it is */
554 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
555 char *b = ninstr((char*)big,(char*)bigend,
556 (char*)little, (char*)little + littlelen);
558 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
559 /* Chop \n from littlestr: */
560 s = bigend - littlelen + 1;
562 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
571 { /* Do actual FBM. */
572 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
573 const register unsigned char *oldlittle;
575 if (littlelen > (STRLEN)(bigend - big))
577 --littlelen; /* Last char found by table lookup */
580 little += littlelen; /* last char */
586 if ((tmp = table[*s])) {
587 if ((s += tmp) < bigend)
591 else { /* less expensive than calling strncmp() */
592 register unsigned char * const olds = s;
597 if (*--s == *--little)
599 s = olds + 1; /* here we pay the price for failure */
601 if (s < bigend) /* fake up continue to outer loop */
609 if ( s == bigend && (table[-1] & FBMcf_TAIL)
610 && memEQ((char *)(bigend - littlelen),
611 (char *)(oldlittle - littlelen), littlelen) )
612 return (char*)bigend - littlelen;
617 /* start_shift, end_shift are positive quantities which give offsets
618 of ends of some substring of bigstr.
619 If "last" we want the last occurrence.
620 old_posp is the way of communication between consequent calls if
621 the next call needs to find the .
622 The initial *old_posp should be -1.
624 Note that we take into account SvTAIL, so one can get extra
625 optimizations if _ALL flag is set.
628 /* If SvTAIL is actually due to \Z or \z, this gives false positives
629 if PL_multiline. In fact if !PL_multiline the authoritative answer
630 is not supported yet. */
633 Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
635 const register unsigned char *big;
637 register I32 previous;
639 const register unsigned char *little;
640 register I32 stop_pos;
641 const register unsigned char *littleend;
645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
648 if ( BmRARE(littlestr) == '\n'
649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
650 little = (const unsigned char *)(SvPVX_const(littlestr));
651 littleend = little + SvCUR(littlestr);
658 little = (const unsigned char *)(SvPVX_const(littlestr));
659 littleend = little + SvCUR(littlestr);
661 /* The value of pos we can start at: */
662 previous = BmPREVIOUS(littlestr);
663 big = (const unsigned char *)(SvPVX_const(bigstr));
664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
666 if (previous + start_shift > stop_pos) {
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
677 while (pos < previous + start_shift) {
678 if (!(pos += PL_screamnext[pos]))
683 const register unsigned char *s, *x;
684 if (pos >= stop_pos) break;
685 if (big[pos] != first)
687 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
693 if (s == littleend) {
695 if (!last) return (char *)(big+pos);
698 } while ( pos += PL_screamnext[pos] );
700 return (char *)(big+(*old_posp));
702 if (!SvTAIL(littlestr) || (end_shift > 0))
704 /* Ignore the trailing "\n". This code is not microoptimized */
705 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
706 stop_pos = littleend - little; /* Actual littlestr len */
711 && ((stop_pos == 1) ||
712 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
718 Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
720 register const U8 *a = (const U8 *)s1;
721 register const U8 *b = (const U8 *)s2;
723 if (*a != *b && *a != PL_fold[*b])
731 Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
734 register const U8 *a = (const U8 *)s1;
735 register const U8 *b = (const U8 *)s2;
737 if (*a != *b && *a != PL_fold_locale[*b])
744 /* copy a string to a safe spot */
747 =head1 Memory Management
751 Perl's version of C<strdup()>. Returns a pointer to a newly allocated
752 string which is a duplicate of C<pv>. The size of the string is
753 determined by C<strlen()>. The memory allocated for the new string can
754 be freed with the C<Safefree()> function.
760 Perl_savepv(pTHX_ const char *pv)
766 const STRLEN pvlen = strlen(pv)+1;
767 New(902,newaddr,pvlen,char);
768 return memcpy(newaddr,pv,pvlen);
773 /* same thing but with a known length */
778 Perl's version of what C<strndup()> would be if it existed. Returns a
779 pointer to a newly allocated string which is a duplicate of the first
780 C<len> bytes from C<pv>. The memory allocated for the new string can be
781 freed with the C<Safefree()> function.
787 Perl_savepvn(pTHX_ const char *pv, register I32 len)
789 register char *newaddr;
791 New(903,newaddr,len+1,char);
792 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
794 /* might not be null terminated */
796 return (char *) CopyD(pv,newaddr,len,char);
799 return (char *) ZeroD(newaddr,len+1,char);
804 =for apidoc savesharedpv
806 A version of C<savepv()> which allocates the duplicate string in memory
807 which is shared between threads.
812 Perl_savesharedpv(pTHX_ const char *pv)
814 register char *newaddr;
819 pvlen = strlen(pv)+1;
820 newaddr = (char*)PerlMemShared_malloc(pvlen);
822 PerlLIO_write(PerlIO_fileno(Perl_error_log),
823 PL_no_mem, strlen(PL_no_mem));
826 return memcpy(newaddr,pv,pvlen);
832 A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
833 the passed in SV using C<SvPV()>
839 Perl_savesvpv(pTHX_ SV *sv)
842 const char *pv = SvPV_const(sv, len);
843 register char *newaddr;
846 New(903,newaddr,len,char);
847 return (char *) CopyD(pv,newaddr,len,char);
851 /* the SV for Perl_form() and mess() is not kept in an arena */
860 return sv_2mortal(newSVpvn("",0));
865 /* Create as PVMG now, to avoid any upgrading later */
867 Newz(905, any, 1, XPVMG);
868 SvFLAGS(sv) = SVt_PVMG;
869 SvANY(sv) = (void*)any;
871 SvREFCNT(sv) = 1 << 30; /* practically infinite */
876 #if defined(PERL_IMPLICIT_CONTEXT)
878 Perl_form_nocontext(const char* pat, ...)
884 retval = vform(pat, &args);
888 #endif /* PERL_IMPLICIT_CONTEXT */
891 =head1 Miscellaneous Functions
894 Takes a sprintf-style format pattern and conventional
895 (non-SV) arguments and returns the formatted string.
897 (char *) Perl_form(pTHX_ const char* pat, ...)
899 can be used any place a string (char *) is required:
901 char * s = Perl_form("%d.%d",major,minor);
903 Uses a single private buffer so if you want to format several strings you
904 must explicitly copy the earlier strings away (and free the copies when you
911 Perl_form(pTHX_ const char* pat, ...)
916 retval = vform(pat, &args);
922 Perl_vform(pTHX_ const char *pat, va_list *args)
924 SV *sv = mess_alloc();
925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
929 #if defined(PERL_IMPLICIT_CONTEXT)
931 Perl_mess_nocontext(const char *pat, ...)
937 retval = vmess(pat, &args);
941 #endif /* PERL_IMPLICIT_CONTEXT */
944 Perl_mess(pTHX_ const char *pat, ...)
949 retval = vmess(pat, &args);
955 S_closest_cop(pTHX_ COP *cop, const OP *o)
957 /* Look for PL_op starting from o. cop is the last COP we've seen. */
959 if (!o || o == PL_op) return cop;
961 if (o->op_flags & OPf_KIDS) {
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
967 /* If the OP_NEXTSTATE has been optimised away we can still use it
968 * the get the file and line number. */
970 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
973 /* Keep searching, and return when we've found something. */
975 new_cop = closest_cop(cop, kid);
976 if (new_cop) return new_cop;
986 Perl_vmess(pTHX_ const char *pat, va_list *args)
988 SV *sv = mess_alloc();
989 static const char dgd[] = " during global destruction.\n";
991 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
992 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
995 * Try and find the file and line for PL_op. This will usually be
996 * PL_curcop, but it might be a cop that has been optimised away. We
997 * can try to find such a cop by searching through the optree starting
998 * from the sibling of PL_curcop.
1001 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
1002 if (!cop) cop = PL_curcop;
1005 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
1006 OutCopFILE(cop), (IV)CopLINE(cop));
1007 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1008 const bool line_mode = (RsSIMPLE(PL_rs) &&
1009 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
1010 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
1011 PL_last_in_gv == PL_argvgv ?
1012 "" : GvNAME(PL_last_in_gv),
1013 line_mode ? "line" : "chunk",
1014 (IV)IoLINES(GvIOp(PL_last_in_gv)));
1016 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1022 Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1028 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1029 && (io = GvIO(PL_stderrgv))
1030 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1037 SAVESPTR(PL_stderrgv);
1038 PL_stderrgv = Nullgv;
1040 PUSHSTACKi(PERLSI_MAGIC);
1044 PUSHs(SvTIED_obj((SV*)io, mg));
1045 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1047 call_method("PRINT", G_SCALAR);
1055 /* SFIO can really mess with your errno */
1056 const int e = errno;
1058 PerlIO * const serr = Perl_error_log;
1060 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1061 (void)PerlIO_flush(serr);
1068 /* Common code used by vcroak, vdie and vwarner */
1071 S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1076 /* sv_2cv might call Perl_croak() */
1077 SV *olddiehook = PL_diehook;
1081 SAVESPTR(PL_diehook);
1082 PL_diehook = Nullsv;
1083 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1085 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1092 msg = newSVpvn(message, msglen);
1093 SvFLAGS(msg) |= utf8;
1101 PUSHSTACKi(PERLSI_DIEHOOK);
1105 call_sv((SV*)cv, G_DISCARD);
1112 S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1116 const char *message;
1119 SV *msv = vmess(pat, args);
1120 if (PL_errors && SvCUR(PL_errors)) {
1121 sv_catsv(PL_errors, msv);
1122 message = SvPV_const(PL_errors, *msglen);
1123 SvCUR_set(PL_errors, 0);
1126 message = SvPV_const(msv,*msglen);
1127 *utf8 = SvUTF8(msv);
1133 DEBUG_S(PerlIO_printf(Perl_debug_log,
1134 "%p: die/croak: message = %s\ndiehook = %p\n",
1135 thr, message, PL_diehook));
1137 S_vdie_common(aTHX_ message, *msglen, *utf8);
1143 Perl_vdie(pTHX_ const char* pat, va_list *args)
1145 const char *message;
1146 const int was_in_eval = PL_in_eval;
1150 DEBUG_S(PerlIO_printf(Perl_debug_log,
1151 "%p: die: curstack = %p, mainstack = %p\n",
1152 thr, PL_curstack, PL_mainstack));
1154 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1156 PL_restartop = die_where(message, msglen);
1157 SvFLAGS(ERRSV) |= utf8;
1158 DEBUG_S(PerlIO_printf(Perl_debug_log,
1159 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1160 thr, PL_restartop, was_in_eval, PL_top_env));
1161 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1163 return PL_restartop;
1166 #if defined(PERL_IMPLICIT_CONTEXT)
1168 Perl_die_nocontext(const char* pat, ...)
1173 va_start(args, pat);
1174 o = vdie(pat, &args);
1178 #endif /* PERL_IMPLICIT_CONTEXT */
1181 Perl_die(pTHX_ const char* pat, ...)
1185 va_start(args, pat);
1186 o = vdie(pat, &args);
1192 Perl_vcroak(pTHX_ const char* pat, va_list *args)
1194 const char *message;
1198 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
1201 PL_restartop = die_where(message, msglen);
1202 SvFLAGS(ERRSV) |= utf8;
1206 message = SvPVx_const(ERRSV, msglen);
1208 write_to_stderr(message, msglen);
1212 #if defined(PERL_IMPLICIT_CONTEXT)
1214 Perl_croak_nocontext(const char *pat, ...)
1218 va_start(args, pat);
1223 #endif /* PERL_IMPLICIT_CONTEXT */
1226 =head1 Warning and Dieing
1230 This is the XSUB-writer's interface to Perl's C<die> function.
1231 Normally call this function the same way you call the C C<printf>
1232 function. Calling C<croak> returns control directly to Perl,
1233 sidestepping the normal C order of execution. See C<warn>.
1235 If you want to throw an exception object, assign the object to
1236 C<$@> and then pass C<Nullch> to croak():
1238 errsv = get_sv("@", TRUE);
1239 sv_setsv(errsv, exception_object);
1246 Perl_croak(pTHX_ const char *pat, ...)
1249 va_start(args, pat);
1256 Perl_vwarn(pTHX_ const char* pat, va_list *args)
1260 SV * const msv = vmess(pat, args);
1261 const I32 utf8 = SvUTF8(msv);
1262 const char * const message = SvPV_const(msv, msglen);
1265 /* sv_2cv might call Perl_warn() */
1266 SV * const oldwarnhook = PL_warnhook;
1272 SAVESPTR(PL_warnhook);
1273 PL_warnhook = Nullsv;
1274 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1276 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1282 msg = newSVpvn(message, msglen);
1283 SvFLAGS(msg) |= utf8;
1287 PUSHSTACKi(PERLSI_WARNHOOK);
1291 call_sv((SV*)cv, G_DISCARD);
1298 write_to_stderr(message, msglen);
1301 #if defined(PERL_IMPLICIT_CONTEXT)
1303 Perl_warn_nocontext(const char *pat, ...)
1307 va_start(args, pat);
1311 #endif /* PERL_IMPLICIT_CONTEXT */
1316 This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1317 function the same way you call the C C<printf> function. See C<croak>.
1323 Perl_warn(pTHX_ const char *pat, ...)
1326 va_start(args, pat);
1331 #if defined(PERL_IMPLICIT_CONTEXT)
1333 Perl_warner_nocontext(U32 err, const char *pat, ...)
1337 va_start(args, pat);
1338 vwarner(err, pat, &args);
1341 #endif /* PERL_IMPLICIT_CONTEXT */
1344 Perl_warner(pTHX_ U32 err, const char* pat,...)
1347 va_start(args, pat);
1348 vwarner(err, pat, &args);
1353 Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1357 SV * const msv = vmess(pat, args);
1359 const char *message = SvPV_const(msv, msglen);
1360 const I32 utf8 = SvUTF8(msv);
1364 S_vdie_common(aTHX_ message, msglen, utf8);
1367 PL_restartop = die_where(message, msglen);
1368 SvFLAGS(ERRSV) |= utf8;
1371 write_to_stderr(message, msglen);
1375 Perl_vwarn(aTHX_ pat, args);
1379 /* since we've already done strlen() for both nam and val
1380 * we can use that info to make things faster than
1381 * sprintf(s, "%s=%s", nam, val)
1383 #define my_setenv_format(s, nam, nlen, val, vlen) \
1384 Copy(nam, s, nlen, char); \
1386 Copy(val, s+(nlen+1), vlen, char); \
1387 *(s+(nlen+1+vlen)) = '\0'
1389 #ifdef USE_ENVIRON_ARRAY
1390 /* VMS' my_setenv() is in vms.c */
1391 #if !defined(WIN32) && !defined(NETWARE)
1393 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1397 /* only parent thread can modify process environment */
1398 if (PL_curinterp == aTHX)
1401 #ifndef PERL_USE_SAFE_PUTENV
1402 if (!PL_use_safe_putenv) {
1403 /* most putenv()s leak, so we manipulate environ directly */
1404 register I32 i=setenv_getix(nam); /* where does it go? */
1407 if (environ == PL_origenviron) { /* need we copy environment? */
1412 for (max = i; environ[max]; max++) ;
1413 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1414 for (j=0; j<max; j++) { /* copy environment */
1415 const int len = strlen(environ[j]);
1416 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1417 Copy(environ[j], tmpenv[j], len+1, char);
1419 tmpenv[max] = Nullch;
1420 environ = tmpenv; /* tell exec where it is now */
1423 safesysfree(environ[i]);
1424 while (environ[i]) {
1425 environ[i] = environ[i+1];
1430 if (!environ[i]) { /* does not exist yet */
1431 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1432 environ[i+1] = Nullch; /* make sure it's null terminated */
1435 safesysfree(environ[i]);
1439 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1440 /* all that work just for this */
1441 my_setenv_format(environ[i], nam, nlen, val, vlen);
1444 # if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
1445 setenv(nam, val, 1);
1448 const int nlen = strlen(nam);
1454 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1455 /* all that work just for this */
1456 my_setenv_format(new_env, nam, nlen, val, vlen);
1457 (void)putenv(new_env);
1458 # endif /* __CYGWIN__ */
1459 #ifndef PERL_USE_SAFE_PUTENV
1465 #else /* WIN32 || NETWARE */
1468 Perl_my_setenv(pTHX_ const char *nam, const char *val)
1471 register char *envstr;
1472 const int nlen = strlen(nam);
1479 New(904, envstr, nlen+vlen+2, char);
1480 my_setenv_format(envstr, nam, nlen, val, vlen);
1481 (void)PerlEnv_putenv(envstr);
1485 #endif /* WIN32 || NETWARE */
1489 Perl_setenv_getix(pTHX_ const char *nam)
1492 const register I32 len = strlen(nam);
1494 for (i = 0; environ[i]; i++) {
1497 strnicmp(environ[i],nam,len) == 0
1499 strnEQ(environ[i],nam,len)
1501 && environ[i][len] == '=')
1502 break; /* strnEQ must come first to avoid */
1503 } /* potential SEGV's */
1506 #endif /* !PERL_MICRO */
1508 #endif /* !VMS && !EPOC*/
1510 #ifdef UNLINK_ALL_VERSIONS
1512 Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
1516 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1521 /* this is a drop-in replacement for bcopy() */
1522 #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
1524 Perl_my_bcopy(register const char *from,register char *to,register I32 len)
1528 if (from - to >= 0) {
1536 *(--to) = *(--from);
1542 /* this is a drop-in replacement for memset() */
1545 Perl_my_memset(register char *loc, register I32 ch, register I32 len)
1555 /* this is a drop-in replacement for bzero() */
1556 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1558 Perl_my_bzero(register char *loc, register I32 len)
1568 /* this is a drop-in replacement for memcmp() */
1569 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1571 Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
1573 register const U8 *a = (const U8 *)s1;
1574 register const U8 *b = (const U8 *)s2;
1578 if ((tmp = *a++ - *b++))
1583 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1587 #ifdef USE_CHAR_VSPRINTF
1592 vsprintf(char *dest, const char *pat, char *args)
1596 fakebuf._ptr = dest;
1597 fakebuf._cnt = 32767;
1601 fakebuf._flag = _IOWRT|_IOSTRG;
1602 _doprnt(pat, args, &fakebuf); /* what a kludge */
1603 (void)putc('\0', &fakebuf);
1604 #ifdef USE_CHAR_VSPRINTF
1607 return 0; /* perl doesn't use return value */
1611 #endif /* HAS_VPRINTF */
1614 #if BYTEORDER != 0x4321
1616 Perl_my_swap(pTHX_ short s)
1618 #if (BYTEORDER & 1) == 0
1621 result = ((s & 255) << 8) + ((s >> 8) & 255);
1629 Perl_my_htonl(pTHX_ long l)
1633 char c[sizeof(long)];
1636 #if BYTEORDER == 0x1234
1637 u.c[0] = (l >> 24) & 255;
1638 u.c[1] = (l >> 16) & 255;
1639 u.c[2] = (l >> 8) & 255;
1643 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1644 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1649 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1650 u.c[o & 0xf] = (l >> s) & 255;
1658 Perl_my_ntohl(pTHX_ long l)
1662 char c[sizeof(long)];
1665 #if BYTEORDER == 0x1234
1666 u.c[0] = (l >> 24) & 255;
1667 u.c[1] = (l >> 16) & 255;
1668 u.c[2] = (l >> 8) & 255;
1672 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1673 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
1680 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1681 l |= (u.c[o & 0xf] & 255) << s;
1688 #endif /* BYTEORDER != 0x4321 */
1692 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1693 * If these functions are defined,
1694 * the BYTEORDER is neither 0x1234 nor 0x4321.
1695 * However, this is not assumed.
1699 #define HTOLE(name,type) \
1701 name (register type n) \
1705 char c[sizeof(type)]; \
1708 register I32 s = 0; \
1709 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1710 u.c[i] = (n >> s) & 0xFF; \
1715 #define LETOH(name,type) \
1717 name (register type n) \
1721 char c[sizeof(type)]; \
1724 register I32 s = 0; \
1727 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1728 n |= ((type)(u.c[i] & 0xFF)) << s; \
1734 * Big-endian byte order functions.
1737 #define HTOBE(name,type) \
1739 name (register type n) \
1743 char c[sizeof(type)]; \
1746 register I32 s = 8*(sizeof(u.c)-1); \
1747 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1748 u.c[i] = (n >> s) & 0xFF; \
1753 #define BETOH(name,type) \
1755 name (register type n) \
1759 char c[sizeof(type)]; \
1762 register I32 s = 8*(sizeof(u.c)-1); \
1765 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1766 n |= ((type)(u.c[i] & 0xFF)) << s; \
1772 * If we just can't do it...
1775 #define NOT_AVAIL(name,type) \
1777 name (register type n) \
1779 Perl_croak_nocontext(#name "() not available"); \
1780 return n; /* not reached */ \
1784 #if defined(HAS_HTOVS) && !defined(htovs)
1787 #if defined(HAS_HTOVL) && !defined(htovl)
1790 #if defined(HAS_VTOHS) && !defined(vtohs)
1793 #if defined(HAS_VTOHL) && !defined(vtohl)
1797 #ifdef PERL_NEED_MY_HTOLE16
1799 HTOLE(Perl_my_htole16,U16)
1801 NOT_AVAIL(Perl_my_htole16,U16)
1804 #ifdef PERL_NEED_MY_LETOH16
1806 LETOH(Perl_my_letoh16,U16)
1808 NOT_AVAIL(Perl_my_letoh16,U16)
1811 #ifdef PERL_NEED_MY_HTOBE16
1813 HTOBE(Perl_my_htobe16,U16)
1815 NOT_AVAIL(Perl_my_htobe16,U16)
1818 #ifdef PERL_NEED_MY_BETOH16
1820 BETOH(Perl_my_betoh16,U16)
1822 NOT_AVAIL(Perl_my_betoh16,U16)
1826 #ifdef PERL_NEED_MY_HTOLE32
1828 HTOLE(Perl_my_htole32,U32)
1830 NOT_AVAIL(Perl_my_htole32,U32)
1833 #ifdef PERL_NEED_MY_LETOH32
1835 LETOH(Perl_my_letoh32,U32)
1837 NOT_AVAIL(Perl_my_letoh32,U32)
1840 #ifdef PERL_NEED_MY_HTOBE32
1842 HTOBE(Perl_my_htobe32,U32)
1844 NOT_AVAIL(Perl_my_htobe32,U32)
1847 #ifdef PERL_NEED_MY_BETOH32
1849 BETOH(Perl_my_betoh32,U32)
1851 NOT_AVAIL(Perl_my_betoh32,U32)
1855 #ifdef PERL_NEED_MY_HTOLE64
1857 HTOLE(Perl_my_htole64,U64)
1859 NOT_AVAIL(Perl_my_htole64,U64)
1862 #ifdef PERL_NEED_MY_LETOH64
1864 LETOH(Perl_my_letoh64,U64)
1866 NOT_AVAIL(Perl_my_letoh64,U64)
1869 #ifdef PERL_NEED_MY_HTOBE64
1871 HTOBE(Perl_my_htobe64,U64)
1873 NOT_AVAIL(Perl_my_htobe64,U64)
1876 #ifdef PERL_NEED_MY_BETOH64
1878 BETOH(Perl_my_betoh64,U64)
1880 NOT_AVAIL(Perl_my_betoh64,U64)
1884 #ifdef PERL_NEED_MY_HTOLES
1885 HTOLE(Perl_my_htoles,short)
1887 #ifdef PERL_NEED_MY_LETOHS
1888 LETOH(Perl_my_letohs,short)
1890 #ifdef PERL_NEED_MY_HTOBES
1891 HTOBE(Perl_my_htobes,short)
1893 #ifdef PERL_NEED_MY_BETOHS
1894 BETOH(Perl_my_betohs,short)
1897 #ifdef PERL_NEED_MY_HTOLEI
1898 HTOLE(Perl_my_htolei,int)
1900 #ifdef PERL_NEED_MY_LETOHI
1901 LETOH(Perl_my_letohi,int)
1903 #ifdef PERL_NEED_MY_HTOBEI
1904 HTOBE(Perl_my_htobei,int)
1906 #ifdef PERL_NEED_MY_BETOHI
1907 BETOH(Perl_my_betohi,int)
1910 #ifdef PERL_NEED_MY_HTOLEL
1911 HTOLE(Perl_my_htolel,long)
1913 #ifdef PERL_NEED_MY_LETOHL
1914 LETOH(Perl_my_letohl,long)
1916 #ifdef PERL_NEED_MY_HTOBEL
1917 HTOBE(Perl_my_htobel,long)
1919 #ifdef PERL_NEED_MY_BETOHL
1920 BETOH(Perl_my_betohl,long)
1924 Perl_my_swabn(void *ptr, int n)
1926 register char *s = (char *)ptr;
1927 register char *e = s + (n-1);
1930 for (n /= 2; n > 0; s++, e--, n--) {
1938 Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1940 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1942 register I32 This, that;
1948 PERL_FLUSHALL_FOR_CHILD;
1949 This = (*mode == 'w');
1953 taint_proper("Insecure %s%s", "EXEC");
1955 if (PerlProc_pipe(p) < 0)
1957 /* Try for another pipe pair for error return */
1958 if (PerlProc_pipe(pp) >= 0)
1960 while ((pid = PerlProc_fork()) < 0) {
1961 if (errno != EAGAIN) {
1962 PerlLIO_close(p[This]);
1963 PerlLIO_close(p[that]);
1965 PerlLIO_close(pp[0]);
1966 PerlLIO_close(pp[1]);
1978 /* Close parent's end of error status pipe (if any) */
1980 PerlLIO_close(pp[0]);
1981 #if defined(HAS_FCNTL) && defined(F_SETFD)
1982 /* Close error pipe automatically if exec works */
1983 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1986 /* Now dup our end of _the_ pipe to right position */
1987 if (p[THIS] != (*mode == 'r')) {
1988 PerlLIO_dup2(p[THIS], *mode == 'r');
1989 PerlLIO_close(p[THIS]);
1990 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
1991 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1994 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1995 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1996 /* No automatic close - do it by hand */
2003 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
2009 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2015 do_execfree(); /* free any memory malloced by child on fork */
2017 PerlLIO_close(pp[1]);
2018 /* Keep the lower of the two fd numbers */
2019 if (p[that] < p[This]) {
2020 PerlLIO_dup2(p[This], p[that]);
2021 PerlLIO_close(p[This]);
2025 PerlLIO_close(p[that]); /* close child's end of pipe */
2028 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2030 SvUPGRADE(sv,SVt_IV);
2032 PL_forkprocess = pid;
2033 /* If we managed to get status pipe check for exec fail */
2034 if (did_pipes && pid > 0) {
2038 while (n < sizeof(int)) {
2039 n1 = PerlLIO_read(pp[0],
2040 (void*)(((char*)&errkid)+n),
2046 PerlLIO_close(pp[0]);
2048 if (n) { /* Error */
2050 PerlLIO_close(p[This]);
2051 if (n != sizeof(int))
2052 Perl_croak(aTHX_ "panic: kid popen errno read");
2054 pid2 = wait4pid(pid, &status, 0);
2055 } while (pid2 == -1 && errno == EINTR);
2056 errno = errkid; /* Propagate errno from kid */
2061 PerlLIO_close(pp[0]);
2062 return PerlIO_fdopen(p[This], mode);
2064 Perl_croak(aTHX_ "List form of piped open not implemented");
2065 return (PerlIO *) NULL;
2069 /* VMS' my_popen() is in VMS.c, same with OS/2. */
2070 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2072 Perl_my_popen(pTHX_ char *cmd, char *mode)
2075 register I32 This, that;
2078 I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
2082 PERL_FLUSHALL_FOR_CHILD;
2085 return my_syspopen(aTHX_ cmd,mode);
2088 This = (*mode == 'w');
2090 if (doexec && PL_tainting) {
2092 taint_proper("Insecure %s%s", "EXEC");
2094 if (PerlProc_pipe(p) < 0)
2096 if (doexec && PerlProc_pipe(pp) >= 0)
2098 while ((pid = PerlProc_fork()) < 0) {
2099 if (errno != EAGAIN) {
2100 PerlLIO_close(p[This]);
2101 PerlLIO_close(p[that]);
2103 PerlLIO_close(pp[0]);
2104 PerlLIO_close(pp[1]);
2107 Perl_croak(aTHX_ "Can't fork");
2120 PerlLIO_close(pp[0]);
2121 #if defined(HAS_FCNTL) && defined(F_SETFD)
2122 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2125 if (p[THIS] != (*mode == 'r')) {
2126 PerlLIO_dup2(p[THIS], *mode == 'r');
2127 PerlLIO_close(p[THIS]);
2128 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2129 PerlLIO_close(p[THAT]);
2132 PerlLIO_close(p[THAT]);
2135 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
2142 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2147 /* may or may not use the shell */
2148 do_exec3(cmd, pp[1], did_pipes);
2151 #endif /* defined OS2 */
2152 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
2153 SvREADONLY_off(GvSV(tmpgv));
2154 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
2155 SvREADONLY_on(GvSV(tmpgv));
2157 #ifdef THREADS_HAVE_PIDS
2158 PL_ppid = (IV)getppid();
2161 hv_clear(PL_pidstatus); /* we have no children */
2166 do_execfree(); /* free any memory malloced by child on vfork */
2168 PerlLIO_close(pp[1]);
2169 if (p[that] < p[This]) {
2170 PerlLIO_dup2(p[This], p[that]);
2171 PerlLIO_close(p[This]);
2175 PerlLIO_close(p[that]);
2178 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2180 SvUPGRADE(sv,SVt_IV);
2182 PL_forkprocess = pid;
2183 if (did_pipes && pid > 0) {
2187 while (n < sizeof(int)) {
2188 n1 = PerlLIO_read(pp[0],
2189 (void*)(((char*)&errkid)+n),
2195 PerlLIO_close(pp[0]);
2197 if (n) { /* Error */
2199 PerlLIO_close(p[This]);
2200 if (n != sizeof(int))
2201 Perl_croak(aTHX_ "panic: kid popen errno read");
2203 pid2 = wait4pid(pid, &status, 0);
2204 } while (pid2 == -1 && errno == EINTR);
2205 errno = errkid; /* Propagate errno from kid */
2210 PerlLIO_close(pp[0]);
2211 return PerlIO_fdopen(p[This], mode);
2214 #if defined(atarist) || defined(EPOC)
2217 Perl_my_popen(pTHX_ char *cmd, char *mode)
2219 PERL_FLUSHALL_FOR_CHILD;
2220 /* Call system's popen() to get a FILE *, then import it.
2221 used 0 for 2nd parameter to PerlIO_importFILE;
2224 return PerlIO_importFILE(popen(cmd, mode), 0);
2228 FILE *djgpp_popen();
2230 Perl_my_popen(pTHX_ char *cmd, char *mode)
2232 PERL_FLUSHALL_FOR_CHILD;
2233 /* Call system's popen() to get a FILE *, then import it.
2234 used 0 for 2nd parameter to PerlIO_importFILE;
2237 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2242 #endif /* !DOSISH */
2244 /* this is called in parent before the fork() */
2246 Perl_atfork_lock(void)
2249 #if defined(USE_ITHREADS)
2250 /* locks must be held in locking order (if any) */
2252 MUTEX_LOCK(&PL_malloc_mutex);
2258 /* this is called in both parent and child after the fork() */
2260 Perl_atfork_unlock(void)
2263 #if defined(USE_ITHREADS)
2264 /* locks must be released in same order as in atfork_lock() */
2266 MUTEX_UNLOCK(&PL_malloc_mutex);
2275 #if defined(HAS_FORK)
2277 #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
2282 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2283 * handlers elsewhere in the code */
2288 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2289 Perl_croak_nocontext("fork() not available");
2291 #endif /* HAS_FORK */
2296 Perl_dump_fds(pTHX_ char *s)
2301 PerlIO_printf(Perl_debug_log,"%s", s);
2302 for (fd = 0; fd < 32; fd++) {
2303 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2304 PerlIO_printf(Perl_debug_log," %d",fd);
2306 PerlIO_printf(Perl_debug_log,"\n");
2309 #endif /* DUMP_FDS */
2313 dup2(int oldfd, int newfd)
2315 #if defined(HAS_FCNTL) && defined(F_DUPFD)
2318 PerlLIO_close(newfd);
2319 return fcntl(oldfd, F_DUPFD, newfd);
2321 #define DUP2_MAX_FDS 256
2322 int fdtmp[DUP2_MAX_FDS];
2328 PerlLIO_close(newfd);
2329 /* good enough for low fd's... */
2330 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2331 if (fdx >= DUP2_MAX_FDS) {
2339 PerlLIO_close(fdtmp[--fdx]);
2346 #ifdef HAS_SIGACTION
2348 #ifdef MACOS_TRADITIONAL
2349 /* We don't want restart behavior on MacOS */
2354 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2357 struct sigaction act, oact;
2360 /* only "parent" interpreter can diddle signals */
2361 if (PL_curinterp != aTHX)
2365 act.sa_handler = handler;
2366 sigemptyset(&act.sa_mask);
2369 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2370 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2372 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2373 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2374 act.sa_flags |= SA_NOCLDWAIT;
2376 if (sigaction(signo, &act, &oact) == -1)
2379 return oact.sa_handler;
2383 Perl_rsignal_state(pTHX_ int signo)
2385 struct sigaction oact;
2387 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2390 return oact.sa_handler;
2394 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2397 struct sigaction act;
2400 /* only "parent" interpreter can diddle signals */
2401 if (PL_curinterp != aTHX)
2405 act.sa_handler = handler;
2406 sigemptyset(&act.sa_mask);
2409 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2410 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2412 #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
2413 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2414 act.sa_flags |= SA_NOCLDWAIT;
2416 return sigaction(signo, &act, save);
2420 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2424 /* only "parent" interpreter can diddle signals */
2425 if (PL_curinterp != aTHX)
2429 return sigaction(signo, save, (struct sigaction *)NULL);
2432 #else /* !HAS_SIGACTION */
2435 Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
2437 #if defined(USE_ITHREADS) && !defined(WIN32)
2438 /* only "parent" interpreter can diddle signals */
2439 if (PL_curinterp != aTHX)
2443 return PerlProc_signal(signo, handler);
2455 Perl_rsignal_state(pTHX_ int signo)
2458 Sighandler_t oldsig;
2460 #if defined(USE_ITHREADS) && !defined(WIN32)
2461 /* only "parent" interpreter can diddle signals */
2462 if (PL_curinterp != aTHX)
2467 oldsig = PerlProc_signal(signo, sig_trap);
2468 PerlProc_signal(signo, oldsig);
2470 PerlProc_kill(PerlProc_getpid(), signo);
2475 Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
2477 #if defined(USE_ITHREADS) && !defined(WIN32)
2478 /* only "parent" interpreter can diddle signals */
2479 if (PL_curinterp != aTHX)
2482 *save = PerlProc_signal(signo, handler);
2483 return (*save == SIG_ERR) ? -1 : 0;
2487 Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
2489 #if defined(USE_ITHREADS) && !defined(WIN32)
2490 /* only "parent" interpreter can diddle signals */
2491 if (PL_curinterp != aTHX)
2494 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2497 #endif /* !HAS_SIGACTION */
2498 #endif /* !PERL_MICRO */
2500 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2501 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
2503 Perl_my_pclose(pTHX_ PerlIO *ptr)
2505 Sigsave_t hstat, istat, qstat;
2511 int saved_errno = 0;
2513 int saved_win32_errno;
2517 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2519 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
2521 *svp = &PL_sv_undef;
2523 if (pid == -1) { /* Opened by popen. */
2524 return my_syspclose(ptr);
2527 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2528 saved_errno = errno;
2530 saved_win32_errno = GetLastError();
2534 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2537 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2538 rsignal_save(SIGINT, SIG_IGN, &istat);
2539 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2542 pid2 = wait4pid(pid, &status, 0);
2543 } while (pid2 == -1 && errno == EINTR);
2545 rsignal_restore(SIGHUP, &hstat);
2546 rsignal_restore(SIGINT, &istat);
2547 rsignal_restore(SIGQUIT, &qstat);
2550 SETERRNO(saved_errno, 0);
2553 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2555 #endif /* !DOSISH */
2557 #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
2559 Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
2564 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2566 char spid[TYPE_CHARS(IV)];
2570 sprintf(spid, "%"IVdf, (IV)pid);
2571 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2572 if (svp && *svp != &PL_sv_undef) {
2573 *statusp = SvIVX(*svp);
2574 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2581 hv_iterinit(PL_pidstatus);
2582 if ((entry = hv_iternext(PL_pidstatus))) {
2583 SV *sv = hv_iterval(PL_pidstatus,entry);
2585 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2586 *statusp = SvIVX(sv);
2587 sprintf(spid, "%"IVdf, (IV)pid);
2588 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2595 # ifdef HAS_WAITPID_RUNTIME
2596 if (!HAS_WAITPID_RUNTIME)
2599 result = PerlProc_waitpid(pid,statusp,flags);
2602 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2603 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2606 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2607 #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
2612 Perl_croak(aTHX_ "Can't do waitpid with flags");
2614 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2615 pidgone(result,*statusp);
2621 #if defined(HAS_WAITPID) || defined(HAS_WAIT4)
2624 if (result < 0 && errno == EINTR) {
2629 #endif /* !DOSISH || OS2 || WIN32 || NETWARE */
2632 Perl_pidgone(pTHX_ Pid_t pid, int status)
2635 char spid[TYPE_CHARS(IV)];
2637 sprintf(spid, "%"IVdf, (IV)pid);
2638 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2639 SvUPGRADE(sv,SVt_IV);
2640 SvIV_set(sv, status);
2644 #if defined(atarist) || defined(OS2) || defined(EPOC)
2647 int /* Cannot prototype with I32
2649 my_syspclose(PerlIO *ptr)
2652 Perl_my_pclose(pTHX_ PerlIO *ptr)
2655 /* Needs work for PerlIO ! */
2656 FILE *f = PerlIO_findFILE(ptr);
2657 I32 result = pclose(f);
2658 PerlIO_releaseFILE(ptr,f);
2666 Perl_my_pclose(pTHX_ PerlIO *ptr)
2668 /* Needs work for PerlIO ! */
2669 FILE *f = PerlIO_findFILE(ptr);
2670 I32 result = djgpp_pclose(f);
2671 result = (result << 8) & 0xff00;
2672 PerlIO_releaseFILE(ptr,f);
2678 Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
2681 register const char *frombase = from;
2684 register const char c = *from;
2689 while (count-- > 0) {
2690 for (todo = len; todo > 0; todo--) {
2699 Perl_same_dirent(pTHX_ const char *a, const char *b)
2701 char *fa = strrchr(a,'/');
2702 char *fb = strrchr(b,'/');
2705 SV *tmpsv = sv_newmortal();
2718 sv_setpvn(tmpsv, ".", 1);
2720 sv_setpvn(tmpsv, a, fa - a);
2721 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
2724 sv_setpvn(tmpsv, ".", 1);
2726 sv_setpvn(tmpsv, b, fb - b);
2727 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
2729 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2730 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2732 #endif /* !HAS_RENAME */
2735 Perl_find_script(pTHX_ const char *scriptname, bool dosearch, const char **search_ext, I32 flags)
2737 const char *xfound = Nullch;
2738 char *xfailed = Nullch;
2739 char tmpbuf[MAXPATHLEN];
2743 #if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2744 # define SEARCH_EXTS ".bat", ".cmd", NULL
2745 # define MAX_EXT_LEN 4
2748 # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2749 # define MAX_EXT_LEN 4
2752 # define SEARCH_EXTS ".pl", ".com", NULL
2753 # define MAX_EXT_LEN 4
2755 /* additional extensions to try in each dir if scriptname not found */
2757 const char *exts[] = { SEARCH_EXTS };
2758 const char **ext = search_ext ? search_ext : exts;
2759 int extidx = 0, i = 0;
2760 const char *curext = Nullch;
2762 PERL_UNUSED_ARG(search_ext);
2763 # define MAX_EXT_LEN 0
2767 * If dosearch is true and if scriptname does not contain path
2768 * delimiters, search the PATH for scriptname.
2770 * If SEARCH_EXTS is also defined, will look for each
2771 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2772 * while searching the PATH.
2774 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2775 * proceeds as follows:
2776 * If DOSISH or VMSISH:
2777 * + look for ./scriptname{,.foo,.bar}
2778 * + search the PATH for scriptname{,.foo,.bar}
2781 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2782 * this will not look in '.' if it's not in the PATH)
2787 # ifdef ALWAYS_DEFTYPES
2788 len = strlen(scriptname);
2789 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2790 int hasdir, idx = 0, deftypes = 1;
2793 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2796 int hasdir, idx = 0, deftypes = 1;
2799 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2801 /* The first time through, just add SEARCH_EXTS to whatever we
2802 * already have, so we can check for default file types. */
2804 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2810 if ((strlen(tmpbuf) + strlen(scriptname)
2811 + MAX_EXT_LEN) >= sizeof tmpbuf)
2812 continue; /* don't search dir with too-long name */
2813 strcat(tmpbuf, scriptname);
2817 if (strEQ(scriptname, "-"))
2819 if (dosearch) { /* Look in '.' first. */
2820 const char *cur = scriptname;
2822 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2824 if (strEQ(ext[i++],curext)) {
2825 extidx = -1; /* already has an ext */
2830 DEBUG_p(PerlIO_printf(Perl_debug_log,
2831 "Looking for %s\n",cur));
2832 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2833 && !S_ISDIR(PL_statbuf.st_mode)) {
2841 if (cur == scriptname) {
2842 len = strlen(scriptname);
2843 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2845 /* FIXME? Convert to memcpy */
2846 cur = strcpy(tmpbuf, scriptname);
2848 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2849 && strcpy(tmpbuf+len, ext[extidx++]));
2854 #ifdef MACOS_TRADITIONAL
2855 if (dosearch && !strchr(scriptname, ':') &&
2856 (s = PerlEnv_getenv("Commands")))
2858 if (dosearch && !strchr(scriptname, '/')
2860 && !strchr(scriptname, '\\')
2862 && (s = PerlEnv_getenv("PATH")))
2867 PL_bufend = s + strlen(s);
2868 while (s < PL_bufend) {
2869 #ifdef MACOS_TRADITIONAL
2870 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2874 #if defined(atarist) || defined(DOSISH)
2879 && *s != ';'; len++, s++) {
2880 if (len < sizeof tmpbuf)
2883 if (len < sizeof tmpbuf)
2885 #else /* ! (atarist || DOSISH) */
2886 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2889 #endif /* ! (atarist || DOSISH) */
2890 #endif /* MACOS_TRADITIONAL */
2893 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2894 continue; /* don't search dir with too-long name */
2895 #ifdef MACOS_TRADITIONAL
2896 if (len && tmpbuf[len - 1] != ':')
2897 tmpbuf[len++] = ':';
2900 # if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2901 && tmpbuf[len - 1] != '/'
2902 && tmpbuf[len - 1] != '\\'
2905 tmpbuf[len++] = '/';
2906 if (len == 2 && tmpbuf[0] == '.')
2909 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2911 (void)strcpy(tmpbuf + len, scriptname);
2915 len = strlen(tmpbuf);
2916 if (extidx > 0) /* reset after previous loop */
2920 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2921 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2922 if (S_ISDIR(PL_statbuf.st_mode)) {
2926 } while ( retval < 0 /* not there */
2927 && extidx>=0 && ext[extidx] /* try an extension? */
2928 && strcpy(tmpbuf+len, ext[extidx++])
2933 if (S_ISREG(PL_statbuf.st_mode)
2934 && cando(S_IRUSR,TRUE,&PL_statbuf)
2935 #if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
2936 && cando(S_IXUSR,TRUE,&PL_statbuf)
2940 xfound = tmpbuf; /* bingo! */
2944 xfailed = savepv(tmpbuf);
2947 if (!xfound && !seen_dot && !xfailed &&
2948 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2949 || S_ISDIR(PL_statbuf.st_mode)))
2951 seen_dot = 1; /* Disable message. */
2953 if (flags & 1) { /* do or die? */
2954 Perl_croak(aTHX_ "Can't %s %s%s%s",
2955 (xfailed ? "execute" : "find"),
2956 (xfailed ? xfailed : scriptname),
2957 (xfailed ? "" : " on PATH"),
2958 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2960 scriptname = Nullch;
2963 scriptname = xfound;
2965 return (scriptname ? savepv(scriptname) : Nullch);
2968 #ifndef PERL_GET_CONTEXT_DEFINED
2971 Perl_get_context(void)
2974 #if defined(USE_ITHREADS)
2975 # ifdef OLD_PTHREADS_API
2977 if (pthread_getspecific(PL_thr_key, &t))
2978 Perl_croak_nocontext("panic: pthread_getspecific");
2981 # ifdef I_MACH_CTHREADS
2982 return (void*)cthread_data(cthread_self());
2984 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2993 Perl_set_context(void *t)
2996 #if defined(USE_ITHREADS)
2997 # ifdef I_MACH_CTHREADS
2998 cthread_set_data(cthread_self(), t);
3000 if (pthread_setspecific(PL_thr_key, t))
3001 Perl_croak_nocontext("panic: pthread_setspecific");
3008 #endif /* !PERL_GET_CONTEXT_DEFINED */
3010 #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
3019 Perl_get_op_names(pTHX)
3021 return (char **)PL_op_name;
3025 Perl_get_op_descs(pTHX)
3027 return (char **)PL_op_desc;
3031 Perl_get_no_modify(pTHX)
3033 return PL_no_modify;
3037 Perl_get_opargs(pTHX)
3039 return (U32 *)PL_opargs;
3043 Perl_get_ppaddr(pTHX)
3046 return (PPADDR_t*)PL_ppaddr;
3049 #ifndef HAS_GETENV_LEN
3051 Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
3053 char * const env_trans = PerlEnv_getenv(env_elem);
3055 *len = strlen(env_trans);
3062 Perl_get_vtbl(pTHX_ int vtbl_id)
3064 const MGVTBL* result = Null(MGVTBL*);
3068 result = &PL_vtbl_sv;
3071 result = &PL_vtbl_env;
3073 case want_vtbl_envelem:
3074 result = &PL_vtbl_envelem;
3077 result = &PL_vtbl_sig;
3079 case want_vtbl_sigelem:
3080 result = &PL_vtbl_sigelem;
3082 case want_vtbl_pack:
3083 result = &PL_vtbl_pack;
3085 case want_vtbl_packelem:
3086 result = &PL_vtbl_packelem;
3088 case want_vtbl_dbline:
3089 result = &PL_vtbl_dbline;
3092 result = &PL_vtbl_isa;
3094 case want_vtbl_isaelem:
3095 result = &PL_vtbl_isaelem;
3097 case want_vtbl_arylen:
3098 result = &PL_vtbl_arylen;
3100 case want_vtbl_glob:
3101 result = &PL_vtbl_glob;
3103 case want_vtbl_mglob:
3104 result = &PL_vtbl_mglob;
3106 case want_vtbl_nkeys:
3107 result = &PL_vtbl_nkeys;
3109 case want_vtbl_taint:
3110 result = &PL_vtbl_taint;
3112 case want_vtbl_substr:
3113 result = &PL_vtbl_substr;
3116 result = &PL_vtbl_vec;
3119 result = &PL_vtbl_pos;
3122 result = &PL_vtbl_bm;
3125 result = &PL_vtbl_fm;
3127 case want_vtbl_uvar:
3128 result = &PL_vtbl_uvar;
3130 case want_vtbl_defelem:
3131 result = &PL_vtbl_defelem;
3133 case want_vtbl_regexp:
3134 result = &PL_vtbl_regexp;
3136 case want_vtbl_regdata:
3137 result = &PL_vtbl_regdata;
3139 case want_vtbl_regdatum:
3140 result = &PL_vtbl_regdatum;
3142 #ifdef USE_LOCALE_COLLATE
3143 case want_vtbl_collxfrm:
3144 result = &PL_vtbl_collxfrm;
3147 case want_vtbl_amagic:
3148 result = &PL_vtbl_amagic;
3150 case want_vtbl_amagicelem:
3151 result = &PL_vtbl_amagicelem;
3153 case want_vtbl_backref:
3154 result = &PL_vtbl_backref;
3156 case want_vtbl_utf8:
3157 result = &PL_vtbl_utf8;
3160 return (MGVTBL*)result;
3164 Perl_my_fflush_all(pTHX)
3166 #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
3167 return PerlIO_flush(NULL);
3169 # if defined(HAS__FWALK)
3170 extern int fflush(FILE *);
3171 /* undocumented, unprototyped, but very useful BSDism */
3172 extern void _fwalk(int (*)(FILE *));
3176 # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
3178 # ifdef PERL_FFLUSH_ALL_FOPEN_MAX
3179 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
3181 # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
3182 open_max = sysconf(_SC_OPEN_MAX);
3185 open_max = FOPEN_MAX;
3188 open_max = OPEN_MAX;
3199 for (i = 0; i < open_max; i++)
3200 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3201 STDIO_STREAM_ARRAY[i]._file < open_max &&
3202 STDIO_STREAM_ARRAY[i]._flag)
3203 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
3207 SETERRNO(EBADF,RMS_IFI);
3214 Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
3217 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3218 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
3220 const char *pars = OP_IS_FILETEST(op) ? "" : "()";
3221 const char *type = OP_IS_SOCKET(op)
3222 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3223 ? "socket" : "filehandle";
3224 const char *name = NULL;
3226 if (gv && isGV(gv)) {
3230 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3231 if (ckWARN(WARN_IO)) {
3232 const char *direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3234 Perl_warner(aTHX_ packWARN(WARN_IO),
3235 "Filehandle %s opened only for %sput",
3238 Perl_warner(aTHX_ packWARN(WARN_IO),
3239 "Filehandle opened only for %sput", direction);
3246 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3248 warn_type = WARN_CLOSED;
3252 warn_type = WARN_UNOPENED;
3255 if (ckWARN(warn_type)) {
3256 if (name && *name) {
3257 Perl_warner(aTHX_ packWARN(warn_type),
3258 "%s%s on %s %s %s", func, pars, vile, type, name);
3259 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3261 aTHX_ packWARN(warn_type),
3262 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3267 Perl_warner(aTHX_ packWARN(warn_type),
3268 "%s%s on %s %s", func, pars, vile, type);
3269 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3271 aTHX_ packWARN(warn_type),
3272 "\t(Are you trying to call %s%s on dirhandle?)\n",
3281 /* in ASCII order, not that it matters */
3282 static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3285 Perl_ebcdic_control(pTHX_ int ch)
3293 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3294 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3297 if (ctlp == controllablechars)
3298 return('\177'); /* DEL */
3300 return((unsigned char)(ctlp - controllablechars - 1));
3301 } else { /* Want uncontrol */
3302 if (ch == '\177' || ch == -1)
3304 else if (ch == '\157')
3306 else if (ch == '\174')
3308 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3310 else if (ch == '\155')
3312 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3313 return(controllablechars[ch+1]);
3315 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3320 /* To workaround core dumps from the uninitialised tm_zone we get the
3321 * system to give us a reasonable struct to copy. This fix means that
3322 * strftime uses the tm_zone and tm_gmtoff values returned by
3323 * localtime(time()). That should give the desired result most of the
3324 * time. But probably not always!
3326 * This does not address tzname aspects of NETaa14816.
3331 # ifndef STRUCT_TM_HASZONE
3332 # define STRUCT_TM_HASZONE
3336 #ifdef STRUCT_TM_HASZONE /* Backward compat */
3337 # ifndef HAS_TM_TM_ZONE
3338 # define HAS_TM_TM_ZONE
3343 Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
3345 #ifdef HAS_TM_TM_ZONE
3347 const struct tm* my_tm;
3349 my_tm = localtime(&now);
3351 Copy(my_tm, ptm, 1, struct tm);
3353 PERL_UNUSED_ARG(ptm);
3358 * mini_mktime - normalise struct tm values without the localtime()
3359 * semantics (and overhead) of mktime().
3362 Perl_mini_mktime(pTHX_ struct tm *ptm)
3366 int month, mday, year, jday;
3367 int odd_cent, odd_year;
3369 #define DAYS_PER_YEAR 365
3370 #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3371 #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3372 #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3373 #define SECS_PER_HOUR (60*60)
3374 #define SECS_PER_DAY (24*SECS_PER_HOUR)
3375 /* parentheses deliberately absent on these two, otherwise they don't work */
3376 #define MONTH_TO_DAYS 153/5
3377 #define DAYS_TO_MONTH 5/153
3378 /* offset to bias by March (month 4) 1st between month/mday & year finding */
3379 #define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3380 /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3381 #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3384 * Year/day algorithm notes:
3386 * With a suitable offset for numeric value of the month, one can find
3387 * an offset into the year by considering months to have 30.6 (153/5) days,
3388 * using integer arithmetic (i.e., with truncation). To avoid too much
3389 * messing about with leap days, we consider January and February to be
3390 * the 13th and 14th month of the previous year. After that transformation,
3391 * we need the month index we use to be high by 1 from 'normal human' usage,
3392 * so the month index values we use run from 4 through 15.
3394 * Given that, and the rules for the Gregorian calendar (leap years are those
3395 * divisible by 4 unless also divisible by 100, when they must be divisible
3396 * by 400 instead), we can simply calculate the number of days since some
3397 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3398 * the days we derive from our month index, and adding in the day of the
3399 * month. The value used here is not adjusted for the actual origin which
3400 * it normally would use (1 January A.D. 1), since we're not exposing it.
3401 * We're only building the value so we can turn around and get the
3402 * normalised values for the year, month, day-of-month, and day-of-year.
3404 * For going backward, we need to bias the value we're using so that we find
3405 * the right year value. (Basically, we don't want the contribution of
3406 * March 1st to the number to apply while deriving the year). Having done
3407 * that, we 'count up' the contribution to the year number by accounting for
3408 * full quadracenturies (400-year periods) with their extra leap days, plus
3409 * the contribution from full centuries (to avoid counting in the lost leap
3410 * days), plus the contribution from full quad-years (to count in the normal
3411 * leap days), plus the leftover contribution from any non-leap years.
3412 * At this point, if we were working with an actual leap day, we'll have 0
3413 * days left over. This is also true for March 1st, however. So, we have
3414 * to special-case that result, and (earlier) keep track of the 'odd'
3415 * century and year contributions. If we got 4 extra centuries in a qcent,
3416 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3417 * Otherwise, we add back in the earlier bias we removed (the 123 from
3418 * figuring in March 1st), find the month index (integer division by 30.6),
3419 * and the remainder is the day-of-month. We then have to convert back to
3420 * 'real' months (including fixing January and February from being 14/15 in
3421 * the previous year to being in the proper year). After that, to get
3422 * tm_yday, we work with the normalised year and get a new yearday value for
3423 * January 1st, which we subtract from the yearday value we had earlier,
3424 * representing the date we've re-built. This is done from January 1
3425 * because tm_yday is 0-origin.
3427 * Since POSIX time routines are only guaranteed to work for times since the
3428 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3429 * applies Gregorian calendar rules even to dates before the 16th century
3430 * doesn't bother me. Besides, you'd need cultural context for a given
3431 * date to know whether it was Julian or Gregorian calendar, and that's
3432 * outside the scope for this routine. Since we convert back based on the
3433 * same rules we used to build the yearday, you'll only get strange results
3434 * for input which needed normalising, or for the 'odd' century years which
3435 * were leap years in the Julian calander but not in the Gregorian one.
3436 * I can live with that.
3438 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3439 * that's still outside the scope for POSIX time manipulation, so I don't
3443 year = 1900 + ptm->tm_year;
3444 month = ptm->tm_mon;
3445 mday = ptm->tm_mday;
3446 /* allow given yday with no month & mday to dominate the result */
3447 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3450 jday = 1 + ptm->tm_yday;
3459 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3460 yearday += month*MONTH_TO_DAYS + mday + jday;
3462 * Note that we don't know when leap-seconds were or will be,
3463 * so we have to trust the user if we get something which looks
3464 * like a sensible leap-second. Wild values for seconds will
3465 * be rationalised, however.
3467 if ((unsigned) ptm->tm_sec <= 60) {
3474 secs += 60 * ptm->tm_min;
3475 secs += SECS_PER_HOUR * ptm->tm_hour;
3477 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3478 /* got negative remainder, but need positive time */
3479 /* back off an extra day to compensate */
3480 yearday += (secs/SECS_PER_DAY)-1;
3481 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3484 yearday += (secs/SECS_PER_DAY);
3485 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3488 else if (secs >= SECS_PER_DAY) {
3489 yearday += (secs/SECS_PER_DAY);
3490 secs %= SECS_PER_DAY;
3492 ptm->tm_hour = secs/SECS_PER_HOUR;
3493 secs %= SECS_PER_HOUR;
3494 ptm->tm_min = secs/60;
3496 ptm->tm_sec += secs;
3497 /* done with time of day effects */
3499 * The algorithm for yearday has (so far) left it high by 428.
3500 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3501 * bias it by 123 while trying to figure out what year it
3502 * really represents. Even with this tweak, the reverse
3503 * translation fails for years before A.D. 0001.
3504 * It would still fail for Feb 29, but we catch that one below.
3506 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3507 yearday -= YEAR_ADJUST;
3508 year = (yearday / DAYS_PER_QCENT) * 400;
3509 yearday %= DAYS_PER_QCENT;
3510 odd_cent = yearday / DAYS_PER_CENT;
3511 year += odd_cent * 100;
3512 yearday %= DAYS_PER_CENT;
3513 year += (yearday / DAYS_PER_QYEAR) * 4;
3514 yearday %= DAYS_PER_QYEAR;
3515 odd_year = yearday / DAYS_PER_YEAR;
3517 yearday %= DAYS_PER_YEAR;
3518 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3523 yearday += YEAR_ADJUST; /* recover March 1st crock */
3524 month = yearday*DAYS_TO_MONTH;
3525 yearday -= month*MONTH_TO_DAYS;
3526 /* recover other leap-year adjustment */
3535 ptm->tm_year = year - 1900;
3537 ptm->tm_mday = yearday;
3538 ptm->tm_mon = month;
3542 ptm->tm_mon = month - 1;
3544 /* re-build yearday based on Jan 1 to get tm_yday */
3546 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3547 yearday += 14*MONTH_TO_DAYS + 1;
3548 ptm->tm_yday = jday - yearday;
3549 /* fix tm_wday if not overridden by caller */
3550 if ((unsigned)ptm->tm_wday > 6)
3551 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3555 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)
3563 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3566 mytm.tm_hour = hour;
3567 mytm.tm_mday = mday;
3569 mytm.tm_year = year;
3570 mytm.tm_wday = wday;
3571 mytm.tm_yday = yday;
3572 mytm.tm_isdst = isdst;
3574 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3575 #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3580 #ifdef HAS_TM_TM_GMTOFF
3581 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3583 #ifdef HAS_TM_TM_ZONE
3584 mytm.tm_zone = mytm2.tm_zone;
3589 New(0, buf, buflen, char);
3590 len = strftime(buf, buflen, fmt, &mytm);
3592 ** The following is needed to handle to the situation where
3593 ** tmpbuf overflows. Basically we want to allocate a buffer
3594 ** and try repeatedly. The reason why it is so complicated
3595 ** is that getting a return value of 0 from strftime can indicate
3596 ** one of the following:
3597 ** 1. buffer overflowed,
3598 ** 2. illegal conversion specifier, or
3599 ** 3. the format string specifies nothing to be returned(not
3600 ** an error). This could be because format is an empty string
3601 ** or it specifies %p that yields an empty string in some locale.
3602 ** If there is a better way to make it portable, go ahead by
3605 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3608 /* Possibly buf overflowed - try again with a bigger buf */
3609 const int fmtlen = strlen(fmt);
3610 const int bufsize = fmtlen + buflen;
3612 New(0, buf, bufsize, char);
3614 buflen = strftime(buf, bufsize, fmt, &mytm);
3615 if (buflen > 0 && buflen < bufsize)
3617 /* heuristic to prevent out-of-memory errors */
3618 if (bufsize > 100*fmtlen) {
3623 Renew(buf, bufsize*2, char);
3628 Perl_croak(aTHX_ "panic: no strftime");
3634 #define SV_CWD_RETURN_UNDEF \
3635 sv_setsv(sv, &PL_sv_undef); \
3638 #define SV_CWD_ISDOT(dp) \
3639 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3640 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3643 =head1 Miscellaneous Functions
3645 =for apidoc getcwd_sv
3647 Fill the sv with current working directory
3652 /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3653 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3654 * getcwd(3) if available
3655 * Comments from the orignal:
3656 * This is a faster version of getcwd. It's also more dangerous
3657 * because you might chdir out of a directory that you can't chdir
3661 Perl_getcwd_sv(pTHX_ register SV *sv)
3665 #ifndef INCOMPLETE_TAINTS
3671 char buf[MAXPATHLEN];
3673 /* Some getcwd()s automatically allocate a buffer of the given
3674 * size from the heap if they are given a NULL buffer pointer.
3675 * The problem is that this behaviour is not portable. */
3676 if (getcwd(buf, sizeof(buf) - 1)) {
3677 sv_setpvn(sv, buf, strlen(buf));
3681 sv_setsv(sv, &PL_sv_undef);
3689 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3693 SvUPGRADE(sv, SVt_PV);
3695 if (PerlLIO_lstat(".", &statbuf) < 0) {
3696 SV_CWD_RETURN_UNDEF;
3699 orig_cdev = statbuf.st_dev;
3700 orig_cino = statbuf.st_ino;
3709 if (PerlDir_chdir("..") < 0) {
3710 SV_CWD_RETURN_UNDEF;
3712 if (PerlLIO_stat(".", &statbuf) < 0) {
3713 SV_CWD_RETURN_UNDEF;
3716 cdev = statbuf.st_dev;
3717 cino = statbuf.st_ino;
3719 if (odev == cdev && oino == cino) {
3722 if (!(dir = PerlDir_open("."))) {
3723 SV_CWD_RETURN_UNDEF;
3726 while ((dp = PerlDir_read(dir)) != NULL) {
3728 const int namelen = dp->d_namlen;
3730 const int namelen = strlen(dp->d_name);
3733 if (SV_CWD_ISDOT(dp)) {
3737 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3738 SV_CWD_RETURN_UNDEF;
3741 tdev = statbuf.st_dev;
3742 tino = statbuf.st_ino;
3743 if (tino == oino && tdev == odev) {
3749 SV_CWD_RETURN_UNDEF;
3752 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3753 SV_CWD_RETURN_UNDEF;
3756 SvGROW(sv, pathlen + namelen + 1);
3760 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3763 /* prepend current directory to the front */
3765 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3766 pathlen += (namelen + 1);
3768 #ifdef VOID_CLOSEDIR
3771 if (PerlDir_close(dir) < 0) {
3772 SV_CWD_RETURN_UNDEF;
3778 SvCUR_set(sv, pathlen);
3782 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3783 SV_CWD_RETURN_UNDEF;
3786 if (PerlLIO_stat(".", &statbuf) < 0) {
3787 SV_CWD_RETURN_UNDEF;
3790 cdev = statbuf.st_dev;
3791 cino = statbuf.st_ino;
3793 if (cdev != orig_cdev || cino != orig_cino) {
3794 Perl_croak(aTHX_ "Unstable directory path, "
3795 "current directory changed unexpectedly");
3807 =for apidoc scan_version
3809 Returns a pointer to the next character after the parsed
3810 version string, as well as upgrading the passed in SV to
3813 Function must be called with an already existing SV like
3816 s = scan_version(s,SV *sv, bool qv);
3818 Performs some preprocessing to the string to ensure that
3819 it has the correct characteristics of a version. Flags the
3820 object if it contains an underscore (which denotes this
3821 is a alpha version). The boolean qv denotes that the version
3822 should be interpreted as if it had multiple decimals, even if
3829 Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
3831 const char *start = s;
3838 SV* hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
3839 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3840 #ifndef NODEFAULT_SHAREKEYS
3841 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3845 s++; /* get past 'v' */
3846 qv = 1; /* force quoted version processing */
3851 /* pre-scan the input string to check for decimals/underbars */
3852 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3857 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
3861 else if ( *pos == '_' )
3864 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
3866 width = pos - last - 1; /* natural width of sub-version */
3871 if ( saw_period > 1 ) {
3872 qv = 1; /* force quoted version processing */
3878 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
3880 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
3882 if ( !qv && width < 3 )
3883 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3885 while (isDIGIT(*pos))
3887 if (!isALPHA(*pos)) {
3893 /* this is atoi() that delimits on underscores */
3894 const char *end = pos;
3898 /* the following if() will only be true after the decimal
3899 * point of a version originally created with a bare
3900 * floating point number, i.e. not quoted in any way
3902 if ( !qv && s > start+1 && saw_period == 1 ) {
3906 rev += (*s - '0') * mult;
3908 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3909 Perl_croak(aTHX_ "Integer overflow in version");
3916 while (--end >= s) {
3918 rev += (*end - '0') * mult;
3920 if ( PERL_ABS(orev) > PERL_ABS(rev) )
3921 Perl_croak(aTHX_ "Integer overflow in version");
3926 /* Append revision */
3927 av_push(av, newSViv(rev));
3928 if ( *pos == '.' && isDIGIT(pos[1]) )
3930 else if ( *pos == '_' && isDIGIT(pos[1]) )
3932 else if ( isDIGIT(*pos) )
3939 while ( isDIGIT(*pos) )
3944 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
3952 if ( qv ) { /* quoted versions always get at least three terms*/
3953 I32 len = av_len(av);
3954 /* This for loop appears to trigger a compiler bug on OS X, as it
3955 loops infinitely. Yes, len is negative. No, it makes no sense.
3956 Compiler in question is:
3957 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
3958 for ( len = 2 - len; len > 0; len-- )
3959 av_push((AV *)sv, newSViv(0));
3963 av_push(av, newSViv(0));
3966 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
3967 av_push(av, newSViv(0));
3969 /* And finally, store the AV in the hash */
3970 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
3975 =for apidoc new_version
3977 Returns a new version object based on the passed in SV:
3979 SV *sv = new_version(SV *ver);
3981 Does not alter the passed in ver SV. See "upg_version" if you
3982 want to upgrade the SV.
3988 Perl_new_version(pTHX_ SV *ver)
3991 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
3994 AV * const av = newAV();
3996 /* This will get reblessed later if a derived class*/
3997 SV* const hv = newSVrv(rv, "version");
3998 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3999 #ifndef NODEFAULT_SHAREKEYS
4000 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4006 /* Begin copying all of the elements */
4007 if ( hv_exists((HV *)ver, "qv", 2) )
4008 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4010 if ( hv_exists((HV *)ver, "alpha", 5) )
4011 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4013 if ( hv_exists((HV*)ver, "width", 5 ) )
4015 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
4016 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
4019 sav = (AV *)*hv_fetch((HV*)ver, "version", 7, FALSE);
4020 /* This will get reblessed later if a derived class*/
4021 for ( key = 0; key <= av_len(sav); key++ )
4023 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4024 av_push(av, newSViv(rev));
4027 hv_store((HV *)hv, "version", 7, (SV *)av, 0);
4031 if ( SvVOK(ver) ) { /* already a v-string */
4033 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4034 const STRLEN len = mg->mg_len;
4035 version = savepvn( (const char*)mg->mg_ptr, len);
4036 sv_setpvn(rv,version,len);
4041 sv_setsv(rv,ver); /* make a duplicate */
4050 =for apidoc upg_version
4052 In-place upgrade of the supplied SV to a version object.
4054 SV *sv = upg_version(SV *sv);
4056 Returns a pointer to the upgraded SV.
4062 Perl_upg_version(pTHX_ SV *ver)
4067 if ( SvNOK(ver) ) /* may get too much accuracy */
4070 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4071 version = savepv(tbuf);
4074 else if ( SvVOK(ver) ) { /* already a v-string */
4075 MAGIC* mg = mg_find(ver,PERL_MAGIC_vstring);
4076 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
4080 else /* must be a string or something like a string */
4082 version = savepv(SvPV_nolen(ver));
4084 (void)scan_version(version, ver, qv);
4093 Accepts a version object and returns the normalized floating
4094 point representation. Call like:
4098 NOTE: you can pass either the object directly or the SV
4099 contained within the RV.
4105 Perl_vnumify(pTHX_ SV *vs)
4110 SV * const sv = newSV(0);
4115 /* see if various flags exist */
4116 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4118 if ( hv_exists((HV*)vs, "width", 5 ) )
4119 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4124 /* attempt to retrieve the version array */
4125 if ( !(av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE) ) ) {
4126 sv_catpvn(sv,"0",1);
4133 sv_catpvn(sv,"0",1);
4137 digit = SvIV(*av_fetch(av, 0, 0));
4138 Perl_sv_setpvf(aTHX_ sv,"%d.", (int)PERL_ABS(digit));
4139 for ( i = 1 ; i < len ; i++ )
4141 digit = SvIV(*av_fetch(av, i, 0));
4143 const int denom = (int)pow(10,(3-width));
4144 const div_t term = div((int)PERL_ABS(digit),denom);
4145 Perl_sv_catpvf(aTHX_ sv,"%0*d_%d", width, term.quot, term.rem);
4148 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4154 digit = SvIV(*av_fetch(av, len, 0));
4155 if ( alpha && width == 3 ) /* alpha version */
4156 Perl_sv_catpv(aTHX_ sv,"_");
4157 /* Don't display additional trailing zeros */
4159 Perl_sv_catpvf(aTHX_ sv,"%0*d", width, (int)digit);
4163 sv_catpvn(sv,"000",3);
4171 Accepts a version object and returns the normalized string
4172 representation. Call like:
4176 NOTE: you can pass either the object directly or the SV
4177 contained within the RV.
4183 Perl_vnormal(pTHX_ SV *vs)
4192 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4194 av = (AV *)*hv_fetch((HV*)vs, "version", 7, FALSE);
4201 digit = SvIV(*av_fetch(av, 0, 0));
4202 Perl_sv_setpvf(aTHX_ sv,"v%"IVdf,(IV)digit);
4203 for ( i = 1 ; i <= len-1 ; i++ ) {
4204 digit = SvIV(*av_fetch(av, i, 0));
4205 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4209 /* handle last digit specially */
4210 digit = SvIV(*av_fetch(av, len, 0));
4212 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
4214 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
4217 if ( len <= 2 ) { /* short version, must be at least three */
4218 for ( len = 2 - len; len != 0; len-- )
4219 sv_catpvn(sv,".0",2);
4226 =for apidoc vstringify
4228 In order to maintain maximum compatibility with earlier versions
4229 of Perl, this function will return either the floating point
4230 notation or the multiple dotted notation, depending on whether
4231 the original version contained 1 or more dots, respectively
4237 Perl_vstringify(pTHX_ SV *vs)
4243 if ( hv_exists((HV *)vs, "qv", 2) )
4255 Version object aware cmp. Both operands must already have been
4256 converted into version objects.
4262 Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
4265 bool lalpha = FALSE;
4266 bool ralpha = FALSE;
4275 /* get the left hand term */
4276 lav = (AV *)*hv_fetch((HV*)lhv, "version", 7, FALSE);
4277 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4280 /* and the right hand term */
4281 rav = (AV *)*hv_fetch((HV*)rhv, "version", 7, FALSE);
4282 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4290 while ( i <= m && retval == 0 )
4292 left = SvIV(*av_fetch(lav,i,0));
4293 right = SvIV(*av_fetch(rav,i,0));
4301 /* tiebreaker for alpha with identical terms */
4302 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4304 if ( lalpha && !ralpha )
4308 else if ( ralpha && !lalpha)
4314 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
4318 while ( i <= r && retval == 0 )
4320 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
4321 retval = -1; /* not a match after all */
4327 while ( i <= l && retval == 0 )
4329 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
4330 retval = +1; /* not a match after all */
4338 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
4339 # define EMULATE_SOCKETPAIR_UDP
4342 #ifdef EMULATE_SOCKETPAIR_UDP
4344 S_socketpair_udp (int fd[2]) {
4346 /* Fake a datagram socketpair using UDP to localhost. */
4347 int sockets[2] = {-1, -1};
4348 struct sockaddr_in addresses[2];
4350 Sock_size_t size = sizeof(struct sockaddr_in);
4351 unsigned short port;
4354 memset(&addresses, 0, sizeof(addresses));
4357 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4358 if (sockets[i] == -1)
4359 goto tidy_up_and_fail;
4361 addresses[i].sin_family = AF_INET;
4362 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4363 addresses[i].sin_port = 0; /* kernel choses port. */
4364 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4365 sizeof(struct sockaddr_in)) == -1)
4366 goto tidy_up_and_fail;
4369 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4370 for each connect the other socket to it. */
4373 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4375 goto tidy_up_and_fail;
4376 if (size != sizeof(struct sockaddr_in))
4377 goto abort_tidy_up_and_fail;
4378 /* !1 is 0, !0 is 1 */
4379 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4380 sizeof(struct sockaddr_in)) == -1)
4381 goto tidy_up_and_fail;
4384 /* Now we have 2 sockets connected to each other. I don't trust some other
4385 process not to have already sent a packet to us (by random) so send
4386 a packet from each to the other. */
4389 /* I'm going to send my own port number. As a short.
4390 (Who knows if someone somewhere has sin_port as a bitfield and needs
4391 this routine. (I'm assuming crays have socketpair)) */
4392 port = addresses[i].sin_port;
4393 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4394 if (got != sizeof(port)) {
4396 goto tidy_up_and_fail;
4397 goto abort_tidy_up_and_fail;
4401 /* Packets sent. I don't trust them to have arrived though.
4402 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4403 connect to localhost will use a second kernel thread. In 2.6 the
4404 first thread running the connect() returns before the second completes,
4405 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4406 returns 0. Poor programs have tripped up. One poor program's authors'
4407 had a 50-1 reverse stock split. Not sure how connected these were.)
4408 So I don't trust someone not to have an unpredictable UDP stack.
4412 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4413 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4417 FD_SET(sockets[0], &rset);
4418 FD_SET(sockets[1], &rset);
4420 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4421 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4422 || !FD_ISSET(sockets[1], &rset)) {
4423 /* I hope this is portable and appropriate. */
4425 goto tidy_up_and_fail;
4426 goto abort_tidy_up_and_fail;
4430 /* And the paranoia department even now doesn't trust it to have arrive
4431 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4433 struct sockaddr_in readfrom;
4434 unsigned short buffer[2];
4439 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4440 sizeof(buffer), MSG_DONTWAIT,
4441 (struct sockaddr *) &readfrom, &size);
4443 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4445 (struct sockaddr *) &readfrom, &size);
4449 goto tidy_up_and_fail;
4450 if (got != sizeof(port)
4451 || size != sizeof(struct sockaddr_in)
4452 /* Check other socket sent us its port. */
4453 || buffer[0] != (unsigned short) addresses[!i].sin_port
4454 /* Check kernel says we got the datagram from that socket */
4455 || readfrom.sin_family != addresses[!i].sin_family
4456 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4457 || readfrom.sin_port != addresses[!i].sin_port)
4458 goto abort_tidy_up_and_fail;
4461 /* My caller (my_socketpair) has validated that this is non-NULL */
4464 /* I hereby declare this connection open. May God bless all who cross
4468 abort_tidy_up_and_fail:
4469 errno = ECONNABORTED;
4472 const int save_errno = errno;
4473 if (sockets[0] != -1)
4474 PerlLIO_close(sockets[0]);
4475 if (sockets[1] != -1)
4476 PerlLIO_close(sockets[1]);
4481 #endif /* EMULATE_SOCKETPAIR_UDP */
4483 #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
4485 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4486 /* Stevens says that family must be AF_LOCAL, protocol 0.
4487 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
4492 struct sockaddr_in listen_addr;
4493 struct sockaddr_in connect_addr;
4498 || family != AF_UNIX
4501 errno = EAFNOSUPPORT;
4509 #ifdef EMULATE_SOCKETPAIR_UDP
4510 if (type == SOCK_DGRAM)
4511 return S_socketpair_udp(fd);
4514 listener = PerlSock_socket(AF_INET, type, 0);
4517 memset(&listen_addr, 0, sizeof(listen_addr));
4518 listen_addr.sin_family = AF_INET;
4519 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4520 listen_addr.sin_port = 0; /* kernel choses port. */
4521 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4522 sizeof(listen_addr)) == -1)
4523 goto tidy_up_and_fail;
4524 if (PerlSock_listen(listener, 1) == -1)
4525 goto tidy_up_and_fail;
4527 connector = PerlSock_socket(AF_INET, type, 0);
4528 if (connector == -1)
4529 goto tidy_up_and_fail;
4530 /* We want to find out the port number to connect to. */
4531 size = sizeof(connect_addr);
4532 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4534 goto tidy_up_and_fail;
4535 if (size != sizeof(connect_addr))
4536 goto abort_tidy_up_and_fail;
4537 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
4538 sizeof(connect_addr)) == -1)
4539 goto tidy_up_and_fail;
4541 size = sizeof(listen_addr);
4542 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4545 goto tidy_up_and_fail;
4546 if (size != sizeof(listen_addr))
4547 goto abort_tidy_up_and_fail;
4548 PerlLIO_close(listener);
4549 /* Now check we are talking to ourself by matching port and host on the
4551 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4553 goto tidy_up_and_fail;
4554 if (size != sizeof(connect_addr)
4555 || listen_addr.sin_family != connect_addr.sin_family
4556 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4557 || listen_addr.sin_port != connect_addr.sin_port) {
4558 goto abort_tidy_up_and_fail;
4564 abort_tidy_up_and_fail:
4566 errno = ECONNABORTED; /* This would be the standard thing to do. */
4568 # ifdef ECONNREFUSED
4569 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4571 errno = ETIMEDOUT; /* Desperation time. */
4576 int save_errno = errno;
4578 PerlLIO_close(listener);
4579 if (connector != -1)
4580 PerlLIO_close(connector);
4582 PerlLIO_close(acceptor);
4588 /* In any case have a stub so that there's code corresponding
4589 * to the my_socketpair in global.sym. */
4591 Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4592 #ifdef HAS_SOCKETPAIR
4593 return socketpair(family, type, protocol, fd);
4602 =for apidoc sv_nosharing
4604 Dummy routine which "shares" an SV when there is no sharing module present.
4605 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4606 some level of strict-ness.
4612 Perl_sv_nosharing(pTHX_ SV *sv)
4614 PERL_UNUSED_ARG(sv);
4618 =for apidoc sv_nolocking
4620 Dummy routine which "locks" an SV when there is no locking module present.
4621 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4622 some level of strict-ness.
4628 Perl_sv_nolocking(pTHX_ SV *sv)
4630 PERL_UNUSED_ARG(sv);
4635 =for apidoc sv_nounlocking
4637 Dummy routine which "unlocks" an SV when there is no locking module present.
4638 Exists to avoid test for a NULL function pointer and because it could potentially warn under
4639 some level of strict-ness.
4645 Perl_sv_nounlocking(pTHX_ SV *sv)
4647 PERL_UNUSED_ARG(sv);
4651 Perl_parse_unicode_opts(pTHX_ const char **popt)
4653 const char *p = *popt;
4658 opt = (U32) atoi(p);
4659 while (isDIGIT(*p)) p++;
4660 if (*p && *p != '\n' && *p != '\r')
4661 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4666 case PERL_UNICODE_STDIN:
4667 opt |= PERL_UNICODE_STDIN_FLAG; break;
4668 case PERL_UNICODE_STDOUT:
4669 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4670 case PERL_UNICODE_STDERR:
4671 opt |= PERL_UNICODE_STDERR_FLAG; break;
4672 case PERL_UNICODE_STD:
4673 opt |= PERL_UNICODE_STD_FLAG; break;
4674 case PERL_UNICODE_IN:
4675 opt |= PERL_UNICODE_IN_FLAG; break;
4676 case PERL_UNICODE_OUT:
4677 opt |= PERL_UNICODE_OUT_FLAG; break;
4678 case PERL_UNICODE_INOUT:
4679 opt |= PERL_UNICODE_INOUT_FLAG; break;
4680 case PERL_UNICODE_LOCALE:
4681 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4682 case PERL_UNICODE_ARGV:
4683 opt |= PERL_UNICODE_ARGV_FLAG; break;
4685 if (*p != '\n' && *p != '\r')
4687 "Unknown Unicode option letter '%c'", *p);
4693 opt = PERL_UNICODE_DEFAULT_FLAGS;
4695 if (opt & ~PERL_UNICODE_ALL_FLAGS)
4696 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
4697 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4708 * This is really just a quick hack which grabs various garbage
4709 * values. It really should be a real hash algorithm which
4710 * spreads the effect of every input bit onto every output bit,
4711 * if someone who knows about such things would bother to write it.
4712 * Might be a good idea to add that function to CORE as well.
4713 * No numbers below come from careful analysis or anything here,
4714 * except they are primes and SEED_C1 > 1E6 to get a full-width
4715 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4716 * probably be bigger too.
4719 # define SEED_C1 1000003
4720 #define SEED_C4 73819
4722 # define SEED_C1 25747
4723 #define SEED_C4 20639
4727 #define SEED_C5 26107
4729 #ifndef PERL_NO_DEV_RANDOM
4734 # include <starlet.h>
4735 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4736 * in 100-ns units, typically incremented ever 10 ms. */
4737 unsigned int when[2];
4739 # ifdef HAS_GETTIMEOFDAY
4740 struct timeval when;
4746 /* This test is an escape hatch, this symbol isn't set by Configure. */
4747 #ifndef PERL_NO_DEV_RANDOM
4748 #ifndef PERL_RANDOM_DEVICE
4749 /* /dev/random isn't used by default because reads from it will block
4750 * if there isn't enough entropy available. You can compile with
4751 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4752 * is enough real entropy to fill the seed. */
4753 # define PERL_RANDOM_DEVICE "/dev/urandom"
4755 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4757 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
4766 _ckvmssts(sys$gettim(when));
4767 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4769 # ifdef HAS_GETTIMEOFDAY
4770 PerlProc_gettimeofday(&when,NULL);
4771 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4774 u = (U32)SEED_C1 * when;
4777 u += SEED_C3 * (U32)PerlProc_getpid();
4778 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4779 #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4780 u += SEED_C5 * (U32)PTR2UV(&when);
4786 Perl_get_hash_seed(pTHX)
4788 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
4792 while (isSPACE(*s)) s++;
4793 if (s && isDIGIT(*s))
4794 myseed = (UV)Atoul(s);
4796 #ifdef USE_HASH_SEED_EXPLICIT
4800 /* Compute a random seed */
4801 (void)seedDrand01((Rand_seed_t)seed());
4802 myseed = (UV)(Drand01() * (NV)UV_MAX);
4803 #if RANDBITS < (UVSIZE * 8)
4804 /* Since there are not enough randbits to to reach all
4805 * the bits of a UV, the low bits might need extra
4806 * help. Sum in another random number that will
4807 * fill in the low bits. */
4809 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4810 #endif /* RANDBITS < (UVSIZE * 8) */
4811 if (myseed == 0) { /* Superparanoia. */
4812 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4814 Perl_croak(aTHX_ "Your random numbers are not that random");
4817 PL_rehash_seed_set = TRUE;
4824 Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4826 const char * const stashpv = CopSTASHPV(c);
4827 const char * const name = HvNAME_get(hv);
4829 if (stashpv == name)
4831 if (stashpv && name)
4832 if (strEQ(stashpv, name))
4839 #ifdef PERL_GLOBAL_STRUCT
4842 Perl_init_global_struct(pTHX)
4844 struct perl_vars *plvarsp = NULL;
4845 #ifdef PERL_GLOBAL_STRUCT
4846 # define PERL_GLOBAL_STRUCT_INIT
4847 # include "opcode.h" /* the ppaddr and check */
4848 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4849 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4850 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4851 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4852 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4856 plvarsp = PL_VarsPtr;
4857 # endif /* PERL_GLOBAL_STRUCT_PRIVATE */
4863 # define PERLVAR(var,type) /**/
4864 # define PERLVARA(var,n,type) /**/
4865 # define PERLVARI(var,type,init) plvarsp->var = init;
4866 # define PERLVARIC(var,type,init) plvarsp->var = init;
4867 # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4868 # include "perlvars.h"
4874 # ifdef PERL_GLOBAL_STRUCT
4875 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4876 if (!plvarsp->Gppaddr)
4878 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
4879 if (!plvarsp->Gcheck)
4881 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
4882 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
4884 # ifdef PERL_SET_VARS
4885 PERL_SET_VARS(plvarsp);
4887 # undef PERL_GLOBAL_STRUCT_INIT
4892 #endif /* PERL_GLOBAL_STRUCT */
4894 #ifdef PERL_GLOBAL_STRUCT
4897 Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
4899 #ifdef PERL_GLOBAL_STRUCT
4900 # ifdef PERL_UNSET_VARS
4901 PERL_UNSET_VARS(plvarsp);
4903 free(plvarsp->Gppaddr);
4904 free(plvarsp->Gcheck);
4905 # ifdef PERL_GLOBAL_STRUCT_PRIVATE
4911 #endif /* PERL_GLOBAL_STRUCT */
4915 * c-indentation-style: bsd
4917 * indent-tabs-mode: t
4920 * ex: set ts=8 sts=4 sw=4 noet: