3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
12 * not content." --Gandalf
19 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
24 # define SIG_ERR ((Sighandler_t) -1)
27 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
36 /* Put this after #includes because fork and vfork prototypes may
47 # include <sys/file.h>
51 # include <sys/wait.h>
57 static void xstat _((void));
62 /* paranoid version of malloc */
64 /* NOTE: Do not call the next three routines directly. Use the macros
65 * in handy.h, so that we can easily redefine everything to do tracking of
66 * allocated hunks back to the original New to track down any memory leaks.
67 * XXX This advice seems to be widely ignored :-( --AD August 1996.
71 safemalloc(MEM_SIZE size)
76 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
79 #endif /* HAS_64K_LIMIT */
82 croak("panic: malloc");
84 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
85 #if !(defined(I286) || defined(atarist))
86 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
88 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
95 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
102 /* paranoid version of realloc */
105 saferealloc(Malloc_t where,MEM_SIZE size)
108 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
109 Malloc_t PerlMem_realloc();
110 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
114 PerlIO_printf(PerlIO_stderr(),
115 "Reallocation too large: %lx\n", size) FLUSH;
118 #endif /* HAS_64K_LIMIT */
120 croak("Null realloc");
123 croak("panic: realloc");
125 ptr = PerlMem_realloc(where,size?size:1); /* realloc(0) is NASTY on our system */
127 #if !(defined(I286) || defined(atarist))
129 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,an++);
130 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
134 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,an++);
135 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
144 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
151 /* safe version of free */
154 safefree(Malloc_t where)
156 #if !(defined(I286) || defined(atarist))
157 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,an++));
159 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,an++));
167 /* safe version of calloc */
170 safecalloc(MEM_SIZE count, MEM_SIZE size)
175 if (size * count > 0xffff) {
176 PerlIO_printf(PerlIO_stderr(),
177 "Allocation too large: %lx\n", size * count) FLUSH;
180 #endif /* HAS_64K_LIMIT */
182 if ((long)size < 0 || (long)count < 0)
183 croak("panic: calloc");
186 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
187 #if !(defined(I286) || defined(atarist))
188 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
190 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
193 memset((void*)ptr, 0, size);
199 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
206 #endif /* !MYMALLOC */
210 #define ALIGN sizeof(long)
213 safexmalloc(I32 x, MEM_SIZE size)
215 register Malloc_t where;
217 where = safemalloc(size + ALIGN);
221 return where + ALIGN;
225 safexrealloc(Malloc_t where, MEM_SIZE size)
227 register Malloc_t new = saferealloc(where - ALIGN, size + ALIGN);
232 safexfree(Malloc_t where)
239 x = where[0] + 100 * where[1];
245 safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
247 register Malloc_t where;
249 where = safexmalloc(x, size * count + ALIGN);
251 memset((void*)where + ALIGN, 0, size * count);
254 return where + ALIGN;
262 for (i = 0; i < MAXXCOUNT; i++) {
263 if (xcount[i] > lastxcount[i]) {
264 PerlIO_printf(PerlIO_stderr(),"%2d %2d\t%ld\n", i / 100, i % 100, xcount[i]);
265 lastxcount[i] = xcount[i];
270 #endif /* LEAKTEST */
272 /* copy a string up to some (non-backslashed) delimiter, if any */
275 delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
278 for (tolen = 0; from < fromend; from++, tolen++) {
280 if (from[1] == delim)
289 else if (*from == delim)
300 /* return ptr to little string in big string, NULL if not found */
301 /* This routine was donated by Corey Satten. */
304 instr(register char *big, register char *little)
306 register char *s, *x;
317 for (x=big,s=little; *s; /**/ ) {
331 /* same as instr but allow embedded nulls */
334 ninstr(register char *big, register char *bigend, char *little, char *lend)
336 register char *s, *x;
337 register I32 first = *little;
338 register char *littleend = lend;
340 if (!first && little >= littleend)
342 if (bigend - big < littleend - little)
344 bigend -= littleend - little++;
345 while (big <= bigend) {
348 for (x=big,s=little; s < littleend; /**/ ) {
360 /* reverse of the above--find last substring */
363 rninstr(register char *big, char *bigend, char *little, char *lend)
365 register char *bigbeg;
366 register char *s, *x;
367 register I32 first = *little;
368 register char *littleend = lend;
370 if (!first && little >= littleend)
373 big = bigend - (littleend - little++);
374 while (big >= bigbeg) {
377 for (x=big+2,s=little; s < littleend; /**/ ) {
390 * Set up for a new ctype locale.
393 perl_new_ctype(char *newctype)
395 #ifdef USE_LOCALE_CTYPE
399 for (i = 0; i < 256; i++) {
401 fold_locale[i] = toLOWER_LC(i);
402 else if (isLOWER_LC(i))
403 fold_locale[i] = toUPPER_LC(i);
408 #endif /* USE_LOCALE_CTYPE */
412 * Set up for a new collation locale.
415 perl_new_collate(char *newcoll)
417 #ifdef USE_LOCALE_COLLATE
420 if (collation_name) {
422 Safefree(collation_name);
423 collation_name = NULL;
424 collation_standard = TRUE;
431 if (! collation_name || strNE(collation_name, newcoll)) {
433 Safefree(collation_name);
434 collation_name = savepv(newcoll);
435 collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
438 /* 2: at most so many chars ('a', 'b'). */
439 /* 50: surely no system expands a char more. */
440 #define XFRMBUFSIZE (2 * 50)
441 char xbuf[XFRMBUFSIZE];
442 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
443 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
444 SSize_t mult = fb - fa;
446 croak("strxfrm() gets absurd");
447 collxfrm_base = (fa > mult) ? (fa - mult) : 0;
448 collxfrm_mult = mult;
452 #endif /* USE_LOCALE_COLLATE */
456 * Set up for a new numeric locale.
459 perl_new_numeric(char *newnum)
461 #ifdef USE_LOCALE_NUMERIC
465 Safefree(numeric_name);
467 numeric_standard = TRUE;
468 numeric_local = TRUE;
473 if (! numeric_name || strNE(numeric_name, newnum)) {
474 Safefree(numeric_name);
475 numeric_name = savepv(newnum);
476 numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
477 numeric_local = TRUE;
480 #endif /* USE_LOCALE_NUMERIC */
484 perl_set_numeric_standard(void)
486 #ifdef USE_LOCALE_NUMERIC
488 if (! numeric_standard) {
489 setlocale(LC_NUMERIC, "C");
490 numeric_standard = TRUE;
491 numeric_local = FALSE;
494 #endif /* USE_LOCALE_NUMERIC */
498 perl_set_numeric_local(void)
500 #ifdef USE_LOCALE_NUMERIC
502 if (! numeric_local) {
503 setlocale(LC_NUMERIC, numeric_name);
504 numeric_standard = FALSE;
505 numeric_local = TRUE;
508 #endif /* USE_LOCALE_NUMERIC */
513 * Initialize locale awareness.
516 perl_init_i18nl10n(int printwarn)
520 * 1 = set ok or not applicable,
521 * 0 = fallback to C locale,
522 * -1 = fallback to C locale failed
527 #ifdef USE_LOCALE_CTYPE
528 char *curctype = NULL;
529 #endif /* USE_LOCALE_CTYPE */
530 #ifdef USE_LOCALE_COLLATE
531 char *curcoll = NULL;
532 #endif /* USE_LOCALE_COLLATE */
533 #ifdef USE_LOCALE_NUMERIC
535 #endif /* USE_LOCALE_NUMERIC */
536 char *lc_all = PerlEnv_getenv("LC_ALL");
537 char *lang = PerlEnv_getenv("LANG");
538 bool setlocale_failure = FALSE;
540 #ifdef LOCALE_ENVIRON_REQUIRED
543 * Ultrix setlocale(..., "") fails if there are no environment
544 * variables from which to get a locale name.
551 if (setlocale(LC_ALL, ""))
554 setlocale_failure = TRUE;
556 if (!setlocale_failure)
559 #ifdef USE_LOCALE_CTYPE
560 if (! (curctype = setlocale(LC_CTYPE,
561 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
563 setlocale_failure = TRUE;
564 #endif /* USE_LOCALE_CTYPE */
565 #ifdef USE_LOCALE_COLLATE
566 if (! (curcoll = setlocale(LC_COLLATE,
567 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
569 setlocale_failure = TRUE;
570 #endif /* USE_LOCALE_COLLATE */
571 #ifdef USE_LOCALE_NUMERIC
572 if (! (curnum = setlocale(LC_NUMERIC,
573 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
575 setlocale_failure = TRUE;
576 #endif /* USE_LOCALE_NUMERIC */
579 #else /* !LOCALE_ENVIRON_REQUIRED */
583 if (! setlocale(LC_ALL, ""))
584 setlocale_failure = TRUE;
586 #ifdef USE_LOCALE_CTYPE
587 curctype = setlocale(LC_CTYPE, Nullch);
588 #endif /* USE_LOCALE_CTYPE */
589 #ifdef USE_LOCALE_COLLATE
590 curcoll = setlocale(LC_COLLATE, Nullch);
591 #endif /* USE_LOCALE_COLLATE */
592 #ifdef USE_LOCALE_NUMERIC
593 curnum = setlocale(LC_NUMERIC, Nullch);
594 #endif /* USE_LOCALE_NUMERIC */
599 #ifdef USE_LOCALE_CTYPE
600 if (! (curctype = setlocale(LC_CTYPE, "")))
601 setlocale_failure = TRUE;
602 #endif /* USE_LOCALE_CTYPE */
603 #ifdef USE_LOCALE_COLLATE
604 if (! (curcoll = setlocale(LC_COLLATE, "")))
605 setlocale_failure = TRUE;
606 #endif /* USE_LOCALE_COLLATE */
607 #ifdef USE_LOCALE_NUMERIC
608 if (! (curnum = setlocale(LC_NUMERIC, "")))
609 setlocale_failure = TRUE;
610 #endif /* USE_LOCALE_NUMERIC */
614 #endif /* !LOCALE_ENVIRON_REQUIRED */
616 if (setlocale_failure) {
618 bool locwarn = (printwarn > 1 ||
620 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
625 PerlIO_printf(PerlIO_stderr(),
626 "perl: warning: Setting locale failed.\n");
630 PerlIO_printf(PerlIO_stderr(),
631 "perl: warning: Setting locale failed for the categories:\n\t");
632 #ifdef USE_LOCALE_CTYPE
634 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
635 #endif /* USE_LOCALE_CTYPE */
636 #ifdef USE_LOCALE_COLLATE
638 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
639 #endif /* USE_LOCALE_COLLATE */
640 #ifdef USE_LOCALE_NUMERIC
642 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
643 #endif /* USE_LOCALE_NUMERIC */
644 PerlIO_printf(PerlIO_stderr(), "\n");
648 PerlIO_printf(PerlIO_stderr(),
649 "perl: warning: Please check that your locale settings:\n");
651 PerlIO_printf(PerlIO_stderr(),
652 "\tLC_ALL = %c%s%c,\n",
654 lc_all ? lc_all : "unset",
659 for (e = environ; *e; e++) {
660 if (strnEQ(*e, "LC_", 3)
661 && strnNE(*e, "LC_ALL=", 7)
662 && (p = strchr(*e, '=')))
663 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
664 (int)(p - *e), *e, p + 1);
668 PerlIO_printf(PerlIO_stderr(),
671 lang ? lang : "unset",
674 PerlIO_printf(PerlIO_stderr(),
675 " are supported and installed on your system.\n");
680 if (setlocale(LC_ALL, "C")) {
682 PerlIO_printf(PerlIO_stderr(),
683 "perl: warning: Falling back to the standard locale (\"C\").\n");
688 PerlIO_printf(PerlIO_stderr(),
689 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
696 #ifdef USE_LOCALE_CTYPE
697 || !(curctype || setlocale(LC_CTYPE, "C"))
698 #endif /* USE_LOCALE_CTYPE */
699 #ifdef USE_LOCALE_COLLATE
700 || !(curcoll || setlocale(LC_COLLATE, "C"))
701 #endif /* USE_LOCALE_COLLATE */
702 #ifdef USE_LOCALE_NUMERIC
703 || !(curnum || setlocale(LC_NUMERIC, "C"))
704 #endif /* USE_LOCALE_NUMERIC */
708 PerlIO_printf(PerlIO_stderr(),
709 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
713 #endif /* ! LC_ALL */
715 #ifdef USE_LOCALE_CTYPE
716 curctype = setlocale(LC_CTYPE, Nullch);
717 #endif /* USE_LOCALE_CTYPE */
718 #ifdef USE_LOCALE_COLLATE
719 curcoll = setlocale(LC_COLLATE, Nullch);
720 #endif /* USE_LOCALE_COLLATE */
721 #ifdef USE_LOCALE_NUMERIC
722 curnum = setlocale(LC_NUMERIC, Nullch);
723 #endif /* USE_LOCALE_NUMERIC */
726 #ifdef USE_LOCALE_CTYPE
727 perl_new_ctype(curctype);
728 #endif /* USE_LOCALE_CTYPE */
730 #ifdef USE_LOCALE_COLLATE
731 perl_new_collate(curcoll);
732 #endif /* USE_LOCALE_COLLATE */
734 #ifdef USE_LOCALE_NUMERIC
735 perl_new_numeric(curnum);
736 #endif /* USE_LOCALE_NUMERIC */
738 #endif /* USE_LOCALE */
743 /* Backwards compatibility. */
745 perl_init_i18nl14n(int printwarn)
747 return perl_init_i18nl10n(printwarn);
750 #ifdef USE_LOCALE_COLLATE
753 * mem_collxfrm() is a bit like strxfrm() but with two important
754 * differences. First, it handles embedded NULs. Second, it allocates
755 * a bit more memory than needed for the transformed data itself.
756 * The real transformed data begins at offset sizeof(collationix).
757 * Please see sv_collxfrm() to see how this is used.
760 mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
763 STRLEN xalloc, xin, xout;
765 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
766 /* the +1 is for the terminating NUL. */
768 xalloc = sizeof(collation_ix) + collxfrm_base + (collxfrm_mult * len) + 1;
769 New(171, xbuf, xalloc, char);
773 *(U32*)xbuf = collation_ix;
774 xout = sizeof(collation_ix);
775 for (xin = 0; xin < len; ) {
779 xused = strxfrm(xbuf + xout, s + xin, xalloc - xout);
782 if (xused < xalloc - xout)
784 xalloc = (2 * xalloc) + 1;
785 Renew(xbuf, xalloc, char);
790 xin += strlen(s + xin) + 1;
793 /* Embedded NULs are understood but silently skipped
794 * because they make no sense in locale collation. */
798 *xlen = xout - sizeof(collation_ix);
807 #endif /* USE_LOCALE_COLLATE */
812 register unsigned char *s;
813 register unsigned char *table;
815 register U32 len = SvCUR(sv);
819 sv_upgrade(sv, SVt_PVBM);
820 if (len > 255 || len == 0) /* TAIL might be on on a zero-length string. */
821 return; /* can't have offsets that big */
823 Sv_Grow(sv,len + 258);
824 table = (unsigned char*)(SvPVX(sv) + len + 1);
826 for (i = 0; i < 256; i++) {
830 while (s >= (unsigned char*)(SvPVX(sv)))
832 if (table[*s] == len)
837 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
840 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
841 for (i = 0; i < len; i++) {
842 if (freq[s[i]] < frequency) {
844 frequency = freq[s[i]];
847 BmRARE(sv) = s[rarest];
848 BmPREVIOUS(sv) = rarest;
849 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
853 fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr)
855 register unsigned char *s;
857 register I32 littlelen;
858 register unsigned char *little;
859 register unsigned char *table;
860 register unsigned char *olds;
861 register unsigned char *oldlittle;
863 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
865 char *l = SvPV(littlestr,len);
867 if (SvTAIL(littlestr)) { /* Can be only 0-len constant
868 substr => we can ignore SvVALID */
871 if ((s = (unsigned char*)ninstr((char*)big, (char*)bigend,
876 if (bigend > big && bigend[-1] == '\n')
877 return (char *)(bigend - 1);
879 return (char *) bigend;
883 return ninstr((char*)big,(char*)bigend, l, l + len);
886 littlelen = SvCUR(littlestr);
887 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
888 if (littlelen > bigend - big)
890 little = (unsigned char*)SvPVX(littlestr);
891 s = bigend - littlelen;
893 && bigend[-1] == '\n'
894 && s[-1] == *little && memEQ((char*)s - 1,(char*)little,littlelen))
895 return (char*)s - 1; /* how sweet it is */
896 else if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
897 return (char*)s; /* how sweet it is */
900 if (littlelen <= 2) {
901 unsigned char c1 = (unsigned char)SvPVX(littlestr)[0];
902 unsigned char c2 = (unsigned char)SvPVX(littlestr)[1];
903 /* This may do extra comparisons if littlelen == 2, but this
904 should be hidden in the noise since we do less indirection. */
908 while (s <= bigend) {
910 && (littlelen == 1 || s[1] == c2)
911 && (!SvTAIL(littlestr)
913 || s[littlelen] == '\n')) /* Automatically multiline */
921 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
922 if (--littlelen >= bigend - big)
925 oldlittle = little = table - 2;
929 if (tmp = table[*s]) {
931 if (bigend - s > tmp) {
936 if ((s += tmp) < bigend)
942 tmp = littlelen; /* less expensive than calling strncmp() */
945 if (*--s == *--little)
948 s = olds + 1; /* here we pay the price for failure */
950 if (s < bigend) /* fake up continue to outer loop */
954 if (SvTAIL(littlestr) /* automatically multiline */
955 && olds + 1 != bigend
964 /* start_shift, end_shift are positive quantities which give offsets
965 of ends of some substring of bigstr.
966 If `last' we want the last occurence.
967 old_posp is the way of communication between consequent calls if
968 the next call needs to find the .
969 The initial *old_posp should be -1.
970 Note that we do not take into account SvTAIL, so it may give wrong
971 positives if _ALL flag is set.
975 screaminstr(SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
977 register unsigned char *s, *x;
978 register unsigned char *big;
980 register I32 previous;
982 register unsigned char *little;
983 register I32 stop_pos;
984 register unsigned char *littleend;
988 ? (pos = screamfirst[BmRARE(littlestr)]) < 0
989 : (((pos = *old_posp), pos += screamnext[pos]) == 0))
991 little = (unsigned char *)(SvPVX(littlestr));
992 littleend = little + SvCUR(littlestr);
994 /* The value of pos we can start at: */
995 previous = BmPREVIOUS(littlestr);
996 big = (unsigned char *)(SvPVX(bigstr));
997 /* The value of pos we can stop at: */
998 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
999 if (previous + start_shift > stop_pos) return Nullch;
1000 while (pos < previous + start_shift) {
1001 if (!(pos += screamnext[pos]))
1006 if (pos >= stop_pos) return Nullch;
1007 if (big[pos-previous] != first)
1009 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1015 if (s == littleend) {
1017 if (!last) return (char *)(big+pos-previous);
1020 } while ( pos += screamnext[pos] );
1021 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1022 #else /* !POINTERRIGOR */
1025 if (pos >= stop_pos) return Nullch;
1026 if (big[pos] != first)
1028 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1034 if (s == littleend) {
1036 if (!last) return (char *)(big+pos);
1039 } while ( pos += screamnext[pos] );
1040 return (last && found) ? (char *)(big+(*old_posp)) : Nullch;
1041 #endif /* POINTERRIGOR */
1045 ibcmp(char *s1, char *s2, register I32 len)
1047 register U8 *a = (U8 *)s1;
1048 register U8 *b = (U8 *)s2;
1050 if (*a != *b && *a != fold[*b])
1058 ibcmp_locale(char *s1, char *s2, register I32 len)
1060 register U8 *a = (U8 *)s1;
1061 register U8 *b = (U8 *)s2;
1063 if (*a != *b && *a != fold_locale[*b])
1070 /* copy a string to a safe spot */
1075 register char *newaddr;
1077 New(902,newaddr,strlen(sv)+1,char);
1078 (void)strcpy(newaddr,sv);
1082 /* same thing but with a known length */
1085 savepvn(char *sv, register I32 len)
1087 register char *newaddr;
1089 New(903,newaddr,len+1,char);
1090 Copy(sv,newaddr,len,char); /* might not be null terminated */
1091 newaddr[len] = '\0'; /* is now */
1095 /* the SV for form() and mess() is not kept in an arena */
1103 /* Create as PVMG now, to avoid any upgrading later */
1104 New(905, sv, 1, SV);
1105 Newz(905, any, 1, XPVMG);
1106 SvFLAGS(sv) = SVt_PVMG;
1107 SvANY(sv) = (void*)any;
1108 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1114 form(const char* pat, ...)
1125 va_start(args, pat);
1130 mess_sv = mess_alloc();
1131 sv_vsetpvfn(mess_sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1133 return SvPVX(mess_sv);
1137 mess(const char *pat, va_list *args)
1140 static char dgd[] = " during global destruction.\n";
1143 mess_sv = mess_alloc();
1145 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1146 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1151 if (curcop->cop_line)
1152 sv_catpvf(sv, " at %_ line %ld",
1153 GvSV(curcop->cop_filegv), (long)curcop->cop_line);
1154 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
1155 bool line_mode = (RsSIMPLE(rs) &&
1156 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
1157 sv_catpvf(sv, ", <%s> %s %ld",
1158 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
1159 line_mode ? "line" : "chunk",
1160 (long)IoLINES(GvIOp(last_in_gv)));
1162 sv_catpv(sv, ".\n");
1170 die(const char* pat, ...)
1182 int was_in_eval = in_eval;
1188 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1189 "%p: die: curstack = %p, mainstack = %p\n",
1190 thr, curstack, mainstack));
1191 #endif /* USE_THREADS */
1192 /* We have to switch back to mainstack or die_where may try to pop
1193 * the eval block from the wrong stack if die is being called from a
1194 * signal handler. - dkindred@cs.cmu.edu */
1195 if (curstack != mainstack) {
1197 SWITCHSTACK(curstack, mainstack);
1201 va_start(args, pat);
1205 message = mess(pat, &args);
1209 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1210 "%p: die: message = %s\ndiehook = %p\n",
1211 thr, message, diehook));
1212 #endif /* USE_THREADS */
1214 /* sv_2cv might call croak() */
1215 SV *olddiehook = diehook;
1219 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1221 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1226 msg = newSVpv(message, 0);
1233 perl_call_sv((SV*)cv, G_DISCARD);
1239 restartop = die_where(message);
1241 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1242 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1243 thr, restartop, was_in_eval, top_env));
1244 #endif /* USE_THREADS */
1245 if ((!restartop && was_in_eval) || top_env->je_prev)
1252 croak(const char* pat, ...)
1256 croak(pat, va_alist)
1269 va_start(args, pat);
1273 message = mess(pat, &args);
1276 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1277 #endif /* USE_THREADS */
1279 /* sv_2cv might call croak() */
1280 SV *olddiehook = diehook;
1284 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1286 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1291 msg = newSVpv(message, 0);
1298 perl_call_sv((SV*)cv, G_DISCARD);
1304 restartop = die_where(message);
1307 PerlIO_puts(PerlIO_stderr(),message);
1308 (void)PerlIO_flush(PerlIO_stderr());
1314 warn(const char* pat,...)
1329 va_start(args, pat);
1333 message = mess(pat, &args);
1337 /* sv_2cv might call warn() */
1339 SV *oldwarnhook = warnhook;
1343 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1345 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1350 msg = newSVpv(message, 0);
1357 perl_call_sv((SV*)cv, G_DISCARD);
1363 PerlIO_puts(PerlIO_stderr(),message);
1367 (void)PerlIO_flush(PerlIO_stderr());
1370 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1373 my_setenv(char *nam, char *val)
1375 register I32 i=setenv_getix(nam); /* where does it go? */
1377 if (environ == origenviron) { /* need we copy environment? */
1383 for (max = i; environ[max]; max++) ;
1384 New(901,tmpenv, max+2, char*);
1385 for (j=0; j<max; j++) /* copy environment */
1386 tmpenv[j] = savepv(environ[j]);
1387 tmpenv[max] = Nullch;
1388 environ = tmpenv; /* tell exec where it is now */
1391 Safefree(environ[i]);
1392 while (environ[i]) {
1393 environ[i] = environ[i+1];
1398 if (!environ[i]) { /* does not exist yet */
1399 Renew(environ, i+2, char*); /* just expand it a bit */
1400 environ[i+1] = Nullch; /* make sure it's null terminated */
1403 Safefree(environ[i]);
1404 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1406 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1408 /* MS-DOS requires environment variable names to be in uppercase */
1409 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1410 * some utilities and applications may break because they only look
1411 * for upper case strings. (Fixed strupr() bug here.)]
1413 strcpy(environ[i],nam); strupr(environ[i]);
1414 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1418 #else /* if WIN32 */
1421 my_setenv(char *nam,char *val)
1424 #ifdef USE_WIN32_RTL_ENV
1426 register char *envstr;
1427 STRLEN namlen = strlen(nam);
1429 char *oldstr = environ[setenv_getix(nam)];
1431 /* putenv() has totally broken semantics in both the Borland
1432 * and Microsoft CRTLs. They either store the passed pointer in
1433 * the environment without making a copy, or make a copy and don't
1434 * free it. And on top of that, they dont free() old entries that
1435 * are being replaced/deleted. This means the caller must
1436 * free any old entries somehow, or we end up with a memory
1437 * leak every time my_setenv() is called. One might think
1438 * one could directly manipulate environ[], like the UNIX code
1439 * above, but direct changes to environ are not allowed when
1440 * calling putenv(), since the RTLs maintain an internal
1441 * *copy* of environ[]. Bad, bad, *bad* stink.
1452 vallen = strlen(val);
1453 New(904, envstr, namlen + vallen + 3, char);
1454 (void)sprintf(envstr,"%s=%s",nam,val);
1455 (void)PerlEnv_putenv(envstr);
1459 Safefree(envstr); /* MSVCRT leaks without this */
1462 #else /* !USE_WIN32_RTL_ENV */
1464 /* The sane way to deal with the environment.
1465 * Has these advantages over putenv() & co.:
1466 * * enables us to store a truly empty value in the
1467 * environment (like in UNIX).
1468 * * we don't have to deal with RTL globals, bugs and leaks.
1470 * Why you may want to enable USE_WIN32_RTL_ENV:
1471 * * environ[] and RTL functions will not reflect changes,
1472 * which might be an issue if extensions want to access
1473 * the env. via RTL. This cuts both ways, since RTL will
1474 * not see changes made by extensions that call the Win32
1475 * functions directly, either.
1478 SetEnvironmentVariable(nam,val);
1486 setenv_getix(char *nam)
1488 register I32 i, len = strlen(nam);
1490 for (i = 0; environ[i]; i++) {
1493 strnicmp(environ[i],nam,len) == 0
1495 strnEQ(environ[i],nam,len)
1497 && environ[i][len] == '=')
1498 break; /* strnEQ must come first to avoid */
1499 } /* potential SEGV's */
1505 #ifdef UNLINK_ALL_VERSIONS
1507 unlnk(f) /* unlink all versions of a file */
1512 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1517 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1519 my_bcopy(register char *from,register char *to,register I32 len)
1523 if (from - to >= 0) {
1531 *(--to) = *(--from);
1539 my_memset(loc,ch,len)
1552 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1566 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1568 my_memcmp(s1,s2,len)
1573 register U8 *a = (U8 *)s1;
1574 register U8 *b = (U8 *)s2;
1578 if (tmp = *a++ - *b++)
1583 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1585 #if defined(I_STDARG) || defined(I_VARARGS)
1588 #ifdef USE_CHAR_VSPRINTF
1593 vsprintf(dest, pat, args)
1600 fakebuf._ptr = dest;
1601 fakebuf._cnt = 32767;
1605 fakebuf._flag = _IOWRT|_IOSTRG;
1606 _doprnt(pat, args, &fakebuf); /* what a kludge */
1607 (void)putc('\0', &fakebuf);
1608 #ifdef USE_CHAR_VSPRINTF
1611 return 0; /* perl doesn't use return value */
1615 #endif /* HAS_VPRINTF */
1616 #endif /* I_VARARGS || I_STDARGS */
1619 #if BYTEORDER != 0x4321
1621 #ifndef CAN_PROTOTYPE
1628 #if (BYTEORDER & 1) == 0
1631 result = ((s & 255) << 8) + ((s >> 8) & 255);
1639 #ifndef CAN_PROTOTYPE
1648 char c[sizeof(long)];
1651 #if BYTEORDER == 0x1234
1652 u.c[0] = (l >> 24) & 255;
1653 u.c[1] = (l >> 16) & 255;
1654 u.c[2] = (l >> 8) & 255;
1658 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1659 croak("Unknown BYTEORDER\n");
1664 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1665 u.c[o & 0xf] = (l >> s) & 255;
1673 #ifndef CAN_PROTOTYPE
1682 char c[sizeof(long)];
1685 #if BYTEORDER == 0x1234
1686 u.c[0] = (l >> 24) & 255;
1687 u.c[1] = (l >> 16) & 255;
1688 u.c[2] = (l >> 8) & 255;
1692 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1693 croak("Unknown BYTEORDER\n");
1700 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1701 l |= (u.c[o & 0xf] & 255) << s;
1708 #endif /* BYTEORDER != 0x4321 */
1712 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1713 * If these functions are defined,
1714 * the BYTEORDER is neither 0x1234 nor 0x4321.
1715 * However, this is not assumed.
1719 #define HTOV(name,type) \
1726 char c[sizeof(type)]; \
1730 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1731 u.c[i] = (n >> s) & 0xFF; \
1736 #define VTOH(name,type) \
1743 char c[sizeof(type)]; \
1749 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1750 n += (u.c[i] & 0xFF) << s; \
1755 #if defined(HAS_HTOVS) && !defined(htovs)
1758 #if defined(HAS_HTOVL) && !defined(htovl)
1761 #if defined(HAS_VTOHS) && !defined(vtohs)
1764 #if defined(HAS_VTOHL) && !defined(vtohl)
1768 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1769 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
1771 my_popen(char *cmd, char *mode)
1774 register I32 This, that;
1777 I32 doexec = strNE(cmd,"-");
1781 return my_syspopen(cmd,mode);
1784 if (PerlProc_pipe(p) < 0)
1786 This = (*mode == 'w');
1788 if (doexec && tainting) {
1790 taint_proper("Insecure %s%s", "EXEC");
1792 while ((pid = (doexec?vfork():fork())) < 0) {
1793 if (errno != EAGAIN) {
1794 PerlLIO_close(p[This]);
1796 croak("Can't fork");
1806 PerlLIO_close(p[THAT]);
1807 if (p[THIS] != (*mode == 'r')) {
1808 PerlLIO_dup2(p[THIS], *mode == 'r');
1809 PerlLIO_close(p[THIS]);
1812 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1818 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
1821 do_exec(cmd); /* may or may not use the shell */
1825 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1826 sv_setiv(GvSV(tmpgv), (IV)getpid());
1828 hv_clear(pidstatus); /* we have no children */
1833 do_execfree(); /* free any memory malloced by child on vfork */
1834 PerlLIO_close(p[that]);
1835 if (p[that] < p[This]) {
1836 PerlLIO_dup2(p[This], p[that]);
1837 PerlLIO_close(p[This]);
1840 sv = *av_fetch(fdpid,p[This],TRUE);
1841 (void)SvUPGRADE(sv,SVt_IV);
1844 return PerlIO_fdopen(p[This], mode);
1847 #if defined(atarist) || defined(DJGPP)
1854 /* Needs work for PerlIO ! */
1855 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1856 return popen(PerlIO_exportFILE(cmd, 0), mode);
1860 #endif /* !DOSISH */
1867 struct stat tmpstatbuf;
1869 PerlIO_printf(PerlIO_stderr(),"%s", s);
1870 for (fd = 0; fd < 32; fd++) {
1871 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
1872 PerlIO_printf(PerlIO_stderr()," %d",fd);
1874 PerlIO_printf(PerlIO_stderr(),"\n");
1884 #if defined(HAS_FCNTL) && defined(F_DUPFD)
1887 PerlLIO_close(newfd);
1888 return fcntl(oldfd, F_DUPFD, newfd);
1890 #define DUP2_MAX_FDS 256
1891 int fdtmp[DUP2_MAX_FDS];
1897 PerlLIO_close(newfd);
1898 /* good enough for low fd's... */
1899 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
1900 if (fdx >= DUP2_MAX_FDS) {
1908 PerlLIO_close(fdtmp[--fdx]);
1915 #ifdef HAS_SIGACTION
1918 rsignal(int signo, Sighandler_t handler)
1920 struct sigaction act, oact;
1922 act.sa_handler = handler;
1923 sigemptyset(&act.sa_mask);
1926 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1928 if (sigaction(signo, &act, &oact) == -1)
1931 return oact.sa_handler;
1935 rsignal_state(int signo)
1937 struct sigaction oact;
1939 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
1942 return oact.sa_handler;
1946 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
1948 struct sigaction act;
1950 act.sa_handler = handler;
1951 sigemptyset(&act.sa_mask);
1954 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1956 return sigaction(signo, &act, save);
1960 rsignal_restore(int signo, Sigsave_t *save)
1962 return sigaction(signo, save, (struct sigaction *)NULL);
1965 #else /* !HAS_SIGACTION */
1968 rsignal(int signo, Sighandler_t handler)
1970 return PerlProc_signal(signo, handler);
1973 static int sig_trapped;
1983 rsignal_state(int signo)
1985 Sighandler_t oldsig;
1988 oldsig = PerlProc_signal(signo, sig_trap);
1989 PerlProc_signal(signo, oldsig);
1991 PerlProc_kill(getpid(), signo);
1996 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
1998 *save = PerlProc_signal(signo, handler);
1999 return (*save == SIG_ERR) ? -1 : 0;
2003 rsignal_restore(int signo, Sigsave_t *save)
2005 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2008 #endif /* !HAS_SIGACTION */
2010 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2011 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
2013 my_pclose(PerlIO *ptr)
2015 Sigsave_t hstat, istat, qstat;
2022 int saved_vaxc_errno;
2025 int saved_win32_errno;
2028 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
2029 pid = (int)SvIVX(*svp);
2033 if (pid == -1) { /* Opened by popen. */
2034 return my_syspclose(ptr);
2037 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2038 saved_errno = errno;
2040 saved_vaxc_errno = vaxc$errno;
2043 saved_win32_errno = GetLastError();
2047 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2049 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2050 rsignal_save(SIGINT, SIG_IGN, &istat);
2051 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2053 pid = wait4pid(pid, &status, 0);
2054 } while (pid == -1 && errno == EINTR);
2055 rsignal_restore(SIGHUP, &hstat);
2056 rsignal_restore(SIGINT, &istat);
2057 rsignal_restore(SIGQUIT, &qstat);
2059 SETERRNO(saved_errno, saved_vaxc_errno);
2062 return(pid < 0 ? pid : status == 0 ? 0 : (errno = 0, status));
2064 #endif /* !DOSISH */
2066 #if !defined(DOSISH) || defined(OS2) || defined(WIN32)
2068 wait4pid(int pid, int *statusp, int flags)
2072 char spid[TYPE_CHARS(int)];
2077 sprintf(spid, "%d", pid);
2078 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
2079 if (svp && *svp != &sv_undef) {
2080 *statusp = SvIVX(*svp);
2081 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2088 hv_iterinit(pidstatus);
2089 if (entry = hv_iternext(pidstatus)) {
2090 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2091 sv = hv_iterval(pidstatus,entry);
2092 *statusp = SvIVX(sv);
2093 sprintf(spid, "%d", pid);
2094 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2099 # ifdef HAS_WAITPID_RUNTIME
2100 if (!HAS_WAITPID_RUNTIME)
2103 return waitpid(pid,statusp,flags);
2105 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2106 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2108 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2113 croak("Can't do waitpid with flags");
2115 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
2116 pidgone(result,*statusp);
2124 #endif /* !DOSISH || OS2 || WIN32 */
2128 pidgone(int pid, int status)
2131 char spid[TYPE_CHARS(int)];
2133 sprintf(spid, "%d", pid);
2134 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
2135 (void)SvUPGRADE(sv,SVt_IV);
2140 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2143 int /* Cannot prototype with I32
2152 /* Needs work for PerlIO ! */
2153 FILE *f = PerlIO_findFILE(ptr);
2154 I32 result = pclose(f);
2155 PerlIO_releaseFILE(ptr,f);
2161 repeatcpy(register char *to, register char *from, I32 len, register I32 count)
2164 register char *frombase = from;
2172 while (count-- > 0) {
2173 for (todo = len; todo > 0; todo--) {
2180 #ifndef CASTNEGFLOAT
2188 # define BIGDOUBLE 2147483648.0
2190 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2193 return (unsigned long)f;
2195 return (unsigned long)along;
2202 /* Unfortunately, on some systems the cast_uv() function doesn't
2203 work with the system-supplied definition of ULONG_MAX. The
2204 comparison (f >= ULONG_MAX) always comes out true. It must be a
2205 problem with the compiler constant folding.
2207 In any case, this workaround should be fine on any two's complement
2208 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2210 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2213 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2215 -- Kenneth Albanowski <kjahds@kjahds.com>
2219 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2227 return (I32) I32_MAX;
2229 return (I32) I32_MIN;
2249 return (UV) MY_UV_MAX;
2261 char *fa = strrchr(a,'/');
2262 char *fb = strrchr(b,'/');
2263 struct stat tmpstatbuf1;
2264 struct stat tmpstatbuf2;
2265 SV *tmpsv = sv_newmortal();
2278 sv_setpv(tmpsv, ".");
2280 sv_setpvn(tmpsv, a, fa - a);
2281 if (Stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2284 sv_setpv(tmpsv, ".");
2286 sv_setpvn(tmpsv, b, fb - b);
2287 if (Stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2289 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2290 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2292 #endif /* !HAS_RENAME */
2295 scan_oct(char *start, I32 len, I32 *retlen)
2297 register char *s = start;
2298 register UV retval = 0;
2299 bool overflowed = FALSE;
2301 while (len && *s >= '0' && *s <= '7') {
2302 register UV n = retval << 3;
2303 if (!overflowed && (n >> 3) != retval) {
2304 warn("Integer overflow in octal number");
2307 retval = n | (*s++ - '0');
2310 if (dowarn && len && (*s == '8' || *s == '9'))
2311 warn("Illegal octal digit ignored");
2312 *retlen = s - start;
2317 scan_hex(char *start, I32 len, I32 *retlen)
2319 register char *s = start;
2320 register UV retval = 0;
2321 bool overflowed = FALSE;
2324 while (len-- && *s && (tmp = strchr((char *) hexdigit, *s))) {
2325 register UV n = retval << 4;
2326 if (!overflowed && (n >> 4) != retval) {
2327 warn("Integer overflow in hex number");
2330 retval = n | ((tmp - hexdigit) & 15);
2333 *retlen = s - start;
2339 /* Very simplistic scheduler for now */
2343 thr = thr->i.next_run;
2354 perl_cond_signal(cp)
2358 perl_cond cond = *cp;
2363 /* Insert t in the runnable queue just ahead of us */
2364 t->i.next_run = thr->i.next_run;
2365 thr->i.next_run->i.prev_run = t;
2366 t->i.prev_run = thr;
2367 thr->i.next_run = t;
2368 thr->i.wait_queue = 0;
2369 /* Remove from the wait queue */
2375 perl_cond_broadcast(cp)
2379 perl_cond cond, cond_next;
2381 for (cond = *cp; cond; cond = cond_next) {
2383 /* Insert t in the runnable queue just ahead of us */
2384 t->i.next_run = thr->i.next_run;
2385 thr->i.next_run->i.prev_run = t;
2386 t->i.prev_run = thr;
2387 thr->i.next_run = t;
2388 thr->i.wait_queue = 0;
2389 /* Remove from the wait queue */
2390 cond_next = cond->next;
2402 if (thr->i.next_run == thr)
2403 croak("panic: perl_cond_wait called by last runnable thread");
2405 New(666, cond, 1, struct perl_wait_queue);
2409 thr->i.wait_queue = cond;
2410 /* Remove ourselves from runnable queue */
2411 thr->i.next_run->i.prev_run = thr->i.prev_run;
2412 thr->i.prev_run->i.next_run = thr->i.next_run;
2414 #endif /* FAKE_THREADS */
2416 #ifdef OLD_PTHREADS_API
2417 struct perl_thread *
2422 if (pthread_getspecific(thr_key, &t))
2423 croak("panic: pthread_getspecific");
2424 return (struct perl_thread *) t;
2426 #endif /* OLD_PTHREADS_API */
2429 condpair_magic(SV *sv)
2433 SvUPGRADE(sv, SVt_PVMG);
2434 mg = mg_find(sv, 'm');
2438 New(53, cp, 1, condpair_t);
2439 MUTEX_INIT(&cp->mutex);
2440 COND_INIT(&cp->owner_cond);
2441 COND_INIT(&cp->cond);
2444 mg = mg_find(sv, 'm');
2446 /* someone else beat us to initialising it */
2448 MUTEX_DESTROY(&cp->mutex);
2449 COND_DESTROY(&cp->owner_cond);
2450 COND_DESTROY(&cp->cond);
2454 sv_magic(sv, Nullsv, 'm', 0, 0);
2456 mg->mg_ptr = (char *)cp;
2457 mg->mg_len = sizeof(cp);
2459 DEBUG_L(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2460 "%p: condpair_magic %p\n", thr, sv));)
2467 * Make a new perl thread structure using t as a prototype. Some of the
2468 * fields for the new thread are copied from the prototype thread, t,
2469 * so t should not be running in perl at the time this function is
2470 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2471 * thread calling new_struct_thread) clearly satisfies this constraint.
2473 struct perl_thread *
2474 new_struct_thread(struct perl_thread *t)
2476 struct perl_thread *thr;
2481 sv = newSVpv("", 0);
2482 SvGROW(sv, sizeof(struct perl_thread) + 1);
2483 SvCUR_set(sv, sizeof(struct perl_thread));
2484 thr = (Thread) SvPVX(sv);
2486 memset(thr, 0xab, sizeof(struct perl_thread));
2498 curcop = &compiling;
2499 thr->cvcache = newHV();
2500 thr->threadsv = newAV();
2501 thr->specific = newAV();
2502 thr->errsv = newSVpv("", 0);
2503 thr->errhv = newHV();
2504 thr->flags = THRf_R_JOINABLE;
2505 MUTEX_INIT(&thr->mutex);
2507 curcop = t->Tcurcop; /* XXX As good a guess as any? */
2508 defstash = t->Tdefstash; /* XXX maybe these should */
2509 curstash = t->Tcurstash; /* always be set to main? */
2512 /* top_env needs to be non-zero. It points to an area
2513 in which longjmp() stuff is stored, as C callstack
2514 info there at least is thread specific this has to
2515 be per-thread. Otherwise a 'die' in a thread gives
2516 that thread the C stack of last thread to do an eval {}!
2517 See comments in scope.h
2518 Initialize top entry (as in perl.c for main thread)
2520 start_env.je_prev = NULL;
2521 start_env.je_ret = -1;
2522 start_env.je_mustcatch = TRUE;
2523 top_env = &start_env;
2528 tainted = t->Ttainted;
2529 curpm = t->Tcurpm; /* XXX No PMOP ref count */
2530 nrs = newSVsv(t->Tnrs);
2531 rs = newSVsv(t->Trs);
2532 last_in_gv = (GV*)SvREFCNT_inc(t->Tlast_in_gv);
2533 ofslen = t->Tofslen;
2534 ofs = savepvn(t->Tofs, ofslen);
2535 defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2536 chopset = t->Tchopset;
2537 formtarget = newSVsv(t->Tformtarget);
2538 bodytarget = newSVsv(t->Tbodytarget);
2539 toptarget = newSVsv(t->Ttoptarget);
2541 /* Initialise all per-thread SVs that the template thread used */
2542 svp = AvARRAY(t->threadsv);
2543 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2544 if (*svp && *svp != &sv_undef) {
2545 SV *sv = newSVsv(*svp);
2546 av_store(thr->threadsv, i, sv);
2547 sv_magic(sv, 0, 0, &threadsv_names[i], 1);
2548 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2549 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
2552 thr->threadsvp = AvARRAY(thr->threadsv);
2554 MUTEX_LOCK(&threads_mutex);
2556 thr->tid = ++threadnum;
2557 thr->next = t->next;
2560 thr->next->prev = thr;
2561 MUTEX_UNLOCK(&threads_mutex);
2563 #ifdef HAVE_THREAD_INTERN
2564 init_thread_intern(thr);
2565 #endif /* HAVE_THREAD_INTERN */
2568 #endif /* USE_THREADS */
2572 * This hack is to force load of "huge" support from libm.a
2573 * So it is in perl for (say) POSIX to use.
2574 * Needed for SunOS with Sun's 'acc' for example.
2583 #ifdef PERL_GLOBAL_STRUCT