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
18 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
23 # define SIG_ERR ((Sighandler_t) -1)
26 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
35 /* Put this after #includes because fork and vfork prototypes may
46 # include <sys/file.h>
50 # include <sys/wait.h>
56 static void xstat _((void));
60 static U32 threadnum = 0;
61 #endif /* USE_THREADS */
65 /* paranoid version of malloc */
67 /* NOTE: Do not call the next three routines directly. Use the macros
68 * in handy.h, so that we can easily redefine everything to do tracking of
69 * allocated hunks back to the original New to track down any memory leaks.
70 * XXX This advice seems to be widely ignored :-( --AD August 1996.
74 safemalloc(MEM_SIZE size)
79 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
82 #endif /* HAS_64K_LIMIT */
85 croak("panic: malloc");
87 ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
88 #if !(defined(I286) || defined(atarist))
89 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
91 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
98 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
105 /* paranoid version of realloc */
108 saferealloc(Malloc_t where,MEM_SIZE size)
111 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
113 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
117 PerlIO_printf(PerlIO_stderr(),
118 "Reallocation too large: %lx\n", size) FLUSH;
121 #endif /* HAS_64K_LIMIT */
123 croak("Null realloc");
126 croak("panic: realloc");
128 ptr = realloc(where,size?size:1); /* realloc(0) is NASTY on our system */
130 #if !(defined(I286) || defined(atarist))
132 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,an++);
133 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
137 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,an++);
138 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
147 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
154 /* safe version of free */
157 safefree(Malloc_t where)
159 #if !(defined(I286) || defined(atarist))
160 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,an++));
162 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,an++));
170 /* safe version of calloc */
173 safecalloc(MEM_SIZE count, MEM_SIZE size)
178 if (size * count > 0xffff) {
179 PerlIO_printf(PerlIO_stderr(),
180 "Allocation too large: %lx\n", size * count) FLUSH;
183 #endif /* HAS_64K_LIMIT */
185 if ((long)size < 0 || (long)count < 0)
186 croak("panic: calloc");
189 ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
190 #if !(defined(I286) || defined(atarist))
191 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
193 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
196 memset((void*)ptr, 0, size);
202 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
209 #endif /* !MYMALLOC */
213 #define ALIGN sizeof(long)
216 safexmalloc(I32 x, MEM_SIZE size)
218 register Malloc_t where;
220 where = safemalloc(size + ALIGN);
224 return where + ALIGN;
228 safexrealloc(Malloc_t where, MEM_SIZE size)
230 register Malloc_t new = saferealloc(where - ALIGN, size + ALIGN);
235 safexfree(Malloc_t where)
242 x = where[0] + 100 * where[1];
248 safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
250 register Malloc_t where;
252 where = safexmalloc(x, size * count + ALIGN);
254 memset((void*)where + ALIGN, 0, size * count);
257 return where + ALIGN;
265 for (i = 0; i < MAXXCOUNT; i++) {
266 if (xcount[i] > lastxcount[i]) {
267 PerlIO_printf(PerlIO_stderr(),"%2d %2d\t%ld\n", i / 100, i % 100, xcount[i]);
268 lastxcount[i] = xcount[i];
273 #endif /* LEAKTEST */
275 /* copy a string up to some (non-backslashed) delimiter, if any */
278 delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
281 for (tolen = 0; from < fromend; from++, tolen++) {
283 if (from[1] == delim)
292 else if (*from == delim)
303 /* return ptr to little string in big string, NULL if not found */
304 /* This routine was donated by Corey Satten. */
307 instr(register char *big, register char *little)
309 register char *s, *x;
320 for (x=big,s=little; *s; /**/ ) {
334 /* same as instr but allow embedded nulls */
337 ninstr(register char *big, register char *bigend, char *little, char *lend)
339 register char *s, *x;
340 register I32 first = *little;
341 register char *littleend = lend;
343 if (!first && little >= littleend)
345 if (bigend - big < littleend - little)
347 bigend -= littleend - little++;
348 while (big <= bigend) {
351 for (x=big,s=little; s < littleend; /**/ ) {
363 /* reverse of the above--find last substring */
366 rninstr(register char *big, char *bigend, char *little, char *lend)
368 register char *bigbeg;
369 register char *s, *x;
370 register I32 first = *little;
371 register char *littleend = lend;
373 if (!first && little >= littleend)
376 big = bigend - (littleend - little++);
377 while (big >= bigbeg) {
380 for (x=big+2,s=little; s < littleend; /**/ ) {
393 * Set up for a new ctype locale.
396 perl_new_ctype(char *newctype)
398 #ifdef USE_LOCALE_CTYPE
402 for (i = 0; i < 256; i++) {
404 fold_locale[i] = toLOWER_LC(i);
405 else if (isLOWER_LC(i))
406 fold_locale[i] = toUPPER_LC(i);
411 #endif /* USE_LOCALE_CTYPE */
415 * Set up for a new collation locale.
418 perl_new_collate(char *newcoll)
420 #ifdef USE_LOCALE_COLLATE
423 if (collation_name) {
425 Safefree(collation_name);
426 collation_name = NULL;
427 collation_standard = TRUE;
434 if (! collation_name || strNE(collation_name, newcoll)) {
436 Safefree(collation_name);
437 collation_name = savepv(newcoll);
438 collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
441 /* 2: at most so many chars ('a', 'b'). */
442 /* 50: surely no system expands a char more. */
443 #define XFRMBUFSIZE (2 * 50)
444 char xbuf[XFRMBUFSIZE];
445 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
446 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
447 SSize_t mult = fb - fa;
449 croak("strxfrm() gets absurd");
450 collxfrm_base = (fa > mult) ? (fa - mult) : 0;
451 collxfrm_mult = mult;
455 #endif /* USE_LOCALE_COLLATE */
459 * Set up for a new numeric locale.
462 perl_new_numeric(char *newnum)
464 #ifdef USE_LOCALE_NUMERIC
468 Safefree(numeric_name);
470 numeric_standard = TRUE;
471 numeric_local = TRUE;
476 if (! numeric_name || strNE(numeric_name, newnum)) {
477 Safefree(numeric_name);
478 numeric_name = savepv(newnum);
479 numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
480 numeric_local = TRUE;
483 #endif /* USE_LOCALE_NUMERIC */
487 perl_set_numeric_standard(void)
489 #ifdef USE_LOCALE_NUMERIC
491 if (! numeric_standard) {
492 setlocale(LC_NUMERIC, "C");
493 numeric_standard = TRUE;
494 numeric_local = FALSE;
497 #endif /* USE_LOCALE_NUMERIC */
501 perl_set_numeric_local(void)
503 #ifdef USE_LOCALE_NUMERIC
505 if (! numeric_local) {
506 setlocale(LC_NUMERIC, numeric_name);
507 numeric_standard = FALSE;
508 numeric_local = TRUE;
511 #endif /* USE_LOCALE_NUMERIC */
516 * Initialize locale awareness.
519 perl_init_i18nl10n(int printwarn)
523 * 1 = set ok or not applicable,
524 * 0 = fallback to C locale,
525 * -1 = fallback to C locale failed
530 #ifdef USE_LOCALE_CTYPE
531 char *curctype = NULL;
532 #endif /* USE_LOCALE_CTYPE */
533 #ifdef USE_LOCALE_COLLATE
534 char *curcoll = NULL;
535 #endif /* USE_LOCALE_COLLATE */
536 #ifdef USE_LOCALE_NUMERIC
538 #endif /* USE_LOCALE_NUMERIC */
539 char *lc_all = getenv("LC_ALL");
540 char *lang = getenv("LANG");
541 bool setlocale_failure = FALSE;
543 #ifdef LOCALE_ENVIRON_REQUIRED
546 * Ultrix setlocale(..., "") fails if there are no environment
547 * variables from which to get a locale name.
554 if (setlocale(LC_ALL, ""))
557 setlocale_failure = TRUE;
559 if (!setlocale_failure)
562 #ifdef USE_LOCALE_CTYPE
563 if (! (curctype = setlocale(LC_CTYPE,
564 (!done && (lang || getenv("LC_CTYPE")))
566 setlocale_failure = TRUE;
567 #endif /* USE_LOCALE_CTYPE */
568 #ifdef USE_LOCALE_COLLATE
569 if (! (curcoll = setlocale(LC_COLLATE,
570 (!done && (lang || getenv("LC_COLLATE")))
572 setlocale_failure = TRUE;
573 #endif /* USE_LOCALE_COLLATE */
574 #ifdef USE_LOCALE_NUMERIC
575 if (! (curnum = setlocale(LC_NUMERIC,
576 (!done && (lang || getenv("LC_NUMERIC")))
578 setlocale_failure = TRUE;
579 #endif /* USE_LOCALE_NUMERIC */
582 #else /* !LOCALE_ENVIRON_REQUIRED */
586 if (! setlocale(LC_ALL, ""))
587 setlocale_failure = TRUE;
589 #ifdef USE_LOCALE_CTYPE
590 curctype = setlocale(LC_CTYPE, Nullch);
591 #endif /* USE_LOCALE_CTYPE */
592 #ifdef USE_LOCALE_COLLATE
593 curcoll = setlocale(LC_COLLATE, Nullch);
594 #endif /* USE_LOCALE_COLLATE */
595 #ifdef USE_LOCALE_NUMERIC
596 curnum = setlocale(LC_NUMERIC, Nullch);
597 #endif /* USE_LOCALE_NUMERIC */
602 #ifdef USE_LOCALE_CTYPE
603 if (! (curctype = setlocale(LC_CTYPE, "")))
604 setlocale_failure = TRUE;
605 #endif /* USE_LOCALE_CTYPE */
606 #ifdef USE_LOCALE_COLLATE
607 if (! (curcoll = setlocale(LC_COLLATE, "")))
608 setlocale_failure = TRUE;
609 #endif /* USE_LOCALE_COLLATE */
610 #ifdef USE_LOCALE_NUMERIC
611 if (! (curnum = setlocale(LC_NUMERIC, "")))
612 setlocale_failure = TRUE;
613 #endif /* USE_LOCALE_NUMERIC */
617 #endif /* !LOCALE_ENVIRON_REQUIRED */
619 if (setlocale_failure) {
621 bool locwarn = (printwarn > 1 ||
623 (!(p = getenv("PERL_BADLANG")) || atoi(p)));
628 PerlIO_printf(PerlIO_stderr(),
629 "perl: warning: Setting locale failed.\n");
633 PerlIO_printf(PerlIO_stderr(),
634 "perl: warning: Setting locale failed for the categories:\n\t");
635 #ifdef USE_LOCALE_CTYPE
637 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
638 #endif /* USE_LOCALE_CTYPE */
639 #ifdef USE_LOCALE_COLLATE
641 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
642 #endif /* USE_LOCALE_COLLATE */
643 #ifdef USE_LOCALE_NUMERIC
645 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
646 #endif /* USE_LOCALE_NUMERIC */
647 PerlIO_printf(PerlIO_stderr(), "\n");
651 PerlIO_printf(PerlIO_stderr(),
652 "perl: warning: Please check that your locale settings:\n");
654 PerlIO_printf(PerlIO_stderr(),
655 "\tLC_ALL = %c%s%c,\n",
657 lc_all ? lc_all : "unset",
662 for (e = environ; *e; e++) {
663 if (strnEQ(*e, "LC_", 3)
664 && strnNE(*e, "LC_ALL=", 7)
665 && (p = strchr(*e, '=')))
666 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
667 (int)(p - *e), *e, p + 1);
671 PerlIO_printf(PerlIO_stderr(),
674 lang ? lang : "unset",
677 PerlIO_printf(PerlIO_stderr(),
678 " are supported and installed on your system.\n");
683 if (setlocale(LC_ALL, "C")) {
685 PerlIO_printf(PerlIO_stderr(),
686 "perl: warning: Falling back to the standard locale (\"C\").\n");
691 PerlIO_printf(PerlIO_stderr(),
692 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
699 #ifdef USE_LOCALE_CTYPE
700 || !(curctype || setlocale(LC_CTYPE, "C"))
701 #endif /* USE_LOCALE_CTYPE */
702 #ifdef USE_LOCALE_COLLATE
703 || !(curcoll || setlocale(LC_COLLATE, "C"))
704 #endif /* USE_LOCALE_COLLATE */
705 #ifdef USE_LOCALE_NUMERIC
706 || !(curnum || setlocale(LC_NUMERIC, "C"))
707 #endif /* USE_LOCALE_NUMERIC */
711 PerlIO_printf(PerlIO_stderr(),
712 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
716 #endif /* ! LC_ALL */
718 #ifdef USE_LOCALE_CTYPE
719 curctype = setlocale(LC_CTYPE, Nullch);
720 #endif /* USE_LOCALE_CTYPE */
721 #ifdef USE_LOCALE_COLLATE
722 curcoll = setlocale(LC_COLLATE, Nullch);
723 #endif /* USE_LOCALE_COLLATE */
724 #ifdef USE_LOCALE_NUMERIC
725 curnum = setlocale(LC_NUMERIC, Nullch);
726 #endif /* USE_LOCALE_NUMERIC */
729 #ifdef USE_LOCALE_CTYPE
730 perl_new_ctype(curctype);
731 #endif /* USE_LOCALE_CTYPE */
733 #ifdef USE_LOCALE_COLLATE
734 perl_new_collate(curcoll);
735 #endif /* USE_LOCALE_COLLATE */
737 #ifdef USE_LOCALE_NUMERIC
738 perl_new_numeric(curnum);
739 #endif /* USE_LOCALE_NUMERIC */
741 #endif /* USE_LOCALE */
746 /* Backwards compatibility. */
748 perl_init_i18nl14n(int printwarn)
750 return perl_init_i18nl10n(printwarn);
753 #ifdef USE_LOCALE_COLLATE
756 * mem_collxfrm() is a bit like strxfrm() but with two important
757 * differences. First, it handles embedded NULs. Second, it allocates
758 * a bit more memory than needed for the transformed data itself.
759 * The real transformed data begins at offset sizeof(collationix).
760 * Please see sv_collxfrm() to see how this is used.
763 mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
766 STRLEN xalloc, xin, xout;
768 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
769 /* the +1 is for the terminating NUL. */
771 xalloc = sizeof(collation_ix) + collxfrm_base + (collxfrm_mult * len) + 1;
772 New(171, xbuf, xalloc, char);
776 *(U32*)xbuf = collation_ix;
777 xout = sizeof(collation_ix);
778 for (xin = 0; xin < len; ) {
782 xused = strxfrm(xbuf + xout, s + xin, xalloc - xout);
785 if (xused < xalloc - xout)
787 xalloc = (2 * xalloc) + 1;
788 Renew(xbuf, xalloc, char);
793 xin += strlen(s + xin) + 1;
796 /* Embedded NULs are understood but silently skipped
797 * because they make no sense in locale collation. */
801 *xlen = xout - sizeof(collation_ix);
810 #endif /* USE_LOCALE_COLLATE */
815 register unsigned char *s;
816 register unsigned char *table;
818 register U32 len = SvCUR(sv);
823 return; /* can't have offsets that big */
825 table = (unsigned char*)(SvPVX(sv) + len + 1);
827 for (i = 0; i < 256; i++) {
831 while (s >= (unsigned char*)(SvPVX(sv)))
833 if (table[*s] == len)
837 sv_upgrade(sv, SVt_PVBM);
838 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
841 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
842 for (i = 0; i < len; i++) {
843 if (freq[s[i]] < frequency) {
845 frequency = freq[s[i]];
848 BmRARE(sv) = s[rarest];
849 BmPREVIOUS(sv) = rarest;
850 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
854 fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr)
856 register unsigned char *s;
858 register I32 littlelen;
859 register unsigned char *little;
860 register unsigned char *table;
861 register unsigned char *olds;
862 register unsigned char *oldlittle;
864 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
866 char *l = SvPV(littlestr,len);
869 return ninstr((char*)big,(char*)bigend, l, l + len);
872 littlelen = SvCUR(littlestr);
873 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
874 if (littlelen > bigend - big)
876 little = (unsigned char*)SvPVX(littlestr);
877 s = bigend - littlelen;
878 if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
879 return (char*)s; /* how sweet it is */
880 else if (bigend[-1] == '\n' && little[littlelen-1] != '\n'
883 if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
888 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
889 if (--littlelen >= bigend - big)
892 oldlittle = little = table - 2;
896 if (tmp = table[*s]) {
898 if (bigend - s > tmp) {
903 if ((s += tmp) < bigend)
909 tmp = littlelen; /* less expensive than calling strncmp() */
912 if (*--s == *--little)
914 s = olds + 1; /* here we pay the price for failure */
916 if (s < bigend) /* fake up continue to outer loop */
927 screaminstr(SV *bigstr, SV *littlestr)
929 register unsigned char *s, *x;
930 register unsigned char *big;
932 register I32 previous;
934 register unsigned char *little;
935 register unsigned char *bigend;
936 register unsigned char *littleend;
938 if ((pos = screamfirst[BmRARE(littlestr)]) < 0)
940 little = (unsigned char *)(SvPVX(littlestr));
941 littleend = little + SvCUR(littlestr);
943 previous = BmPREVIOUS(littlestr);
944 big = (unsigned char *)(SvPVX(bigstr));
945 bigend = big + SvCUR(bigstr);
946 while (pos < previous) {
947 if (!(pos += screamnext[pos]))
952 if (big[pos-previous] != first)
954 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
963 return (char *)(big+pos-previous);
964 } while ( pos += screamnext[pos] );
965 #else /* !POINTERRIGOR */
968 if (big[pos] != first)
970 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
979 return (char *)(big+pos);
980 } while ( pos += screamnext[pos] );
981 #endif /* POINTERRIGOR */
986 ibcmp(char *s1, char *s2, register I32 len)
988 register U8 *a = (U8 *)s1;
989 register U8 *b = (U8 *)s2;
991 if (*a != *b && *a != fold[*b])
999 ibcmp_locale(char *s1, char *s2, register I32 len)
1001 register U8 *a = (U8 *)s1;
1002 register U8 *b = (U8 *)s2;
1004 if (*a != *b && *a != fold_locale[*b])
1011 /* copy a string to a safe spot */
1016 register char *newaddr;
1018 New(902,newaddr,strlen(sv)+1,char);
1019 (void)strcpy(newaddr,sv);
1023 /* same thing but with a known length */
1026 savepvn(char *sv, register I32 len)
1028 register char *newaddr;
1030 New(903,newaddr,len+1,char);
1031 Copy(sv,newaddr,len,char); /* might not be null terminated */
1032 newaddr[len] = '\0'; /* is now */
1036 /* the SV for form() and mess() is not kept in an arena */
1044 /* Create as PVMG now, to avoid any upgrading later */
1045 New(905, sv, 1, SV);
1046 Newz(905, any, 1, XPVMG);
1047 SvFLAGS(sv) = SVt_PVMG;
1048 SvANY(sv) = (void*)any;
1049 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1055 form(const char* pat, ...)
1066 va_start(args, pat);
1071 mess_sv = mess_alloc();
1072 sv_vsetpvfn(mess_sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1074 return SvPVX(mess_sv);
1078 mess(const char *pat, va_list *args)
1081 static char dgd[] = " during global destruction.\n";
1084 mess_sv = mess_alloc();
1086 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1087 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1092 if (curcop->cop_line)
1093 sv_catpvf(sv, " at %_ line %ld",
1094 GvSV(curcop->cop_filegv), (long)curcop->cop_line);
1095 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
1096 bool line_mode = (RsSIMPLE(rs) &&
1097 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
1098 sv_catpvf(sv, ", <%s> %s %ld",
1099 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
1100 line_mode ? "line" : "chunk",
1101 (long)IoLINES(GvIOp(last_in_gv)));
1103 sv_catpv(sv, ".\n");
1111 die(const char* pat, ...)
1123 I32 oldrunlevel = runlevel;
1124 int was_in_eval = in_eval;
1130 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1131 "%p: die: curstack = %p, mainstack = %p\n",
1132 thr, curstack, mainstack));
1133 #endif /* USE_THREADS */
1134 /* We have to switch back to mainstack or die_where may try to pop
1135 * the eval block from the wrong stack if die is being called from a
1136 * signal handler. - dkindred@cs.cmu.edu */
1137 if (curstack != mainstack) {
1139 SWITCHSTACK(curstack, mainstack);
1143 va_start(args, pat);
1147 message = mess(pat, &args);
1151 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1152 "%p: die: message = %s\ndiehook = %p\n",
1153 thr, message, diehook));
1154 #endif /* USE_THREADS */
1156 /* sv_2cv might call croak() */
1157 SV *olddiehook = diehook;
1161 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1163 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1168 msg = newSVpv(message, 0);
1175 perl_call_sv((SV*)cv, G_DISCARD);
1181 restartop = die_where(message);
1183 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1184 "%p: die: restartop = %p, was_in_eval = %d, oldrunlevel = %d\n",
1185 thr, restartop, was_in_eval, oldrunlevel));
1186 #endif /* USE_THREADS */
1187 if ((!restartop && was_in_eval) || oldrunlevel > 1)
1194 croak(const char* pat, ...)
1198 croak(pat, va_alist)
1211 va_start(args, pat);
1215 message = mess(pat, &args);
1218 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1219 #endif /* USE_THREADS */
1221 /* sv_2cv might call croak() */
1222 SV *olddiehook = diehook;
1226 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1228 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1233 msg = newSVpv(message, 0);
1240 perl_call_sv((SV*)cv, G_DISCARD);
1246 restartop = die_where(message);
1249 PerlIO_puts(PerlIO_stderr(),message);
1250 (void)PerlIO_flush(PerlIO_stderr());
1256 warn(const char* pat,...)
1271 va_start(args, pat);
1275 message = mess(pat, &args);
1279 /* sv_2cv might call warn() */
1281 SV *oldwarnhook = warnhook;
1285 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1287 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1292 msg = newSVpv(message, 0);
1299 perl_call_sv((SV*)cv, G_DISCARD);
1305 PerlIO_puts(PerlIO_stderr(),message);
1309 (void)PerlIO_flush(PerlIO_stderr());
1312 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1315 my_setenv(char *nam, char *val)
1317 register I32 i=setenv_getix(nam); /* where does it go? */
1319 if (environ == origenviron) { /* need we copy environment? */
1325 for (max = i; environ[max]; max++) ;
1326 New(901,tmpenv, max+2, char*);
1327 for (j=0; j<max; j++) /* copy environment */
1328 tmpenv[j] = savepv(environ[j]);
1329 tmpenv[max] = Nullch;
1330 environ = tmpenv; /* tell exec where it is now */
1333 Safefree(environ[i]);
1334 while (environ[i]) {
1335 environ[i] = environ[i+1];
1340 if (!environ[i]) { /* does not exist yet */
1341 Renew(environ, i+2, char*); /* just expand it a bit */
1342 environ[i+1] = Nullch; /* make sure it's null terminated */
1345 Safefree(environ[i]);
1346 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1348 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1350 /* MS-DOS requires environment variable names to be in uppercase */
1351 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1352 * some utilities and applications may break because they only look
1353 * for upper case strings. (Fixed strupr() bug here.)]
1355 strcpy(environ[i],nam); strupr(environ[i]);
1356 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1360 #else /* if WIN32 */
1363 my_setenv(char *nam,char *val)
1366 #ifdef USE_WIN32_RTL_ENV
1368 register char *envstr;
1369 STRLEN namlen = strlen(nam);
1371 char *oldstr = environ[setenv_getix(nam)];
1373 /* putenv() has totally broken semantics in both the Borland
1374 * and Microsoft CRTLs. They either store the passed pointer in
1375 * the environment without making a copy, or make a copy and don't
1376 * free it. And on top of that, they dont free() old entries that
1377 * are being replaced/deleted. This means the caller must
1378 * free any old entries somehow, or we end up with a memory
1379 * leak every time my_setenv() is called. One might think
1380 * one could directly manipulate environ[], like the UNIX code
1381 * above, but direct changes to environ are not allowed when
1382 * calling putenv(), since the RTLs maintain an internal
1383 * *copy* of environ[]. Bad, bad, *bad* stink.
1394 vallen = strlen(val);
1395 New(904, envstr, namlen + vallen + 3, char);
1396 (void)sprintf(envstr,"%s=%s",nam,val);
1397 (void)putenv(envstr);
1401 Safefree(envstr); /* MSVCRT leaks without this */
1404 #else /* !USE_WIN32_RTL_ENV */
1406 /* The sane way to deal with the environment.
1407 * Has these advantages over putenv() & co.:
1408 * * enables us to store a truly empty value in the
1409 * environment (like in UNIX).
1410 * * we don't have to deal with RTL globals, bugs and leaks.
1412 * Why you may want to enable USE_WIN32_RTL_ENV:
1413 * * environ[] and RTL functions will not reflect changes,
1414 * which might be an issue if extensions want to access
1415 * the env. via RTL. This cuts both ways, since RTL will
1416 * not see changes made by extensions that call the Win32
1417 * functions directly, either.
1420 SetEnvironmentVariable(nam,val);
1428 setenv_getix(char *nam)
1430 register I32 i, len = strlen(nam);
1432 for (i = 0; environ[i]; i++) {
1435 strnicmp(environ[i],nam,len) == 0
1437 strnEQ(environ[i],nam,len)
1439 && environ[i][len] == '=')
1440 break; /* strnEQ must come first to avoid */
1441 } /* potential SEGV's */
1447 #ifdef UNLINK_ALL_VERSIONS
1449 unlnk(f) /* unlink all versions of a file */
1454 for (i = 0; unlink(f) >= 0; i++) ;
1459 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1461 my_bcopy(register char *from,register char *to,register I32 len)
1465 if (from - to >= 0) {
1473 *(--to) = *(--from);
1481 my_memset(loc,ch,len)
1494 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1508 #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1510 my_memcmp(s1,s2,len)
1515 register U8 *a = (U8 *)s1;
1516 register U8 *b = (U8 *)s2;
1520 if (tmp = *a++ - *b++)
1525 #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1527 #if defined(I_STDARG) || defined(I_VARARGS)
1530 #ifdef USE_CHAR_VSPRINTF
1535 vsprintf(dest, pat, args)
1542 fakebuf._ptr = dest;
1543 fakebuf._cnt = 32767;
1547 fakebuf._flag = _IOWRT|_IOSTRG;
1548 _doprnt(pat, args, &fakebuf); /* what a kludge */
1549 (void)putc('\0', &fakebuf);
1550 #ifdef USE_CHAR_VSPRINTF
1553 return 0; /* perl doesn't use return value */
1557 #endif /* HAS_VPRINTF */
1558 #endif /* I_VARARGS || I_STDARGS */
1561 #if BYTEORDER != 0x4321
1563 #ifndef CAN_PROTOTYPE
1570 #if (BYTEORDER & 1) == 0
1573 result = ((s & 255) << 8) + ((s >> 8) & 255);
1581 #ifndef CAN_PROTOTYPE
1590 char c[sizeof(long)];
1593 #if BYTEORDER == 0x1234
1594 u.c[0] = (l >> 24) & 255;
1595 u.c[1] = (l >> 16) & 255;
1596 u.c[2] = (l >> 8) & 255;
1600 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1601 croak("Unknown BYTEORDER\n");
1606 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1607 u.c[o & 0xf] = (l >> s) & 255;
1615 #ifndef CAN_PROTOTYPE
1624 char c[sizeof(long)];
1627 #if BYTEORDER == 0x1234
1628 u.c[0] = (l >> 24) & 255;
1629 u.c[1] = (l >> 16) & 255;
1630 u.c[2] = (l >> 8) & 255;
1634 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1635 croak("Unknown BYTEORDER\n");
1642 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1643 l |= (u.c[o & 0xf] & 255) << s;
1650 #endif /* BYTEORDER != 0x4321 */
1654 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1655 * If these functions are defined,
1656 * the BYTEORDER is neither 0x1234 nor 0x4321.
1657 * However, this is not assumed.
1661 #define HTOV(name,type) \
1668 char c[sizeof(type)]; \
1672 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1673 u.c[i] = (n >> s) & 0xFF; \
1678 #define VTOH(name,type) \
1685 char c[sizeof(type)]; \
1691 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1692 n += (u.c[i] & 0xFF) << s; \
1697 #if defined(HAS_HTOVS) && !defined(htovs)
1700 #if defined(HAS_HTOVL) && !defined(htovl)
1703 #if defined(HAS_VTOHS) && !defined(vtohs)
1706 #if defined(HAS_VTOHL) && !defined(vtohl)
1710 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1711 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
1713 my_popen(char *cmd, char *mode)
1716 register I32 This, that;
1719 I32 doexec = strNE(cmd,"-");
1723 return my_syspopen(cmd,mode);
1728 This = (*mode == 'w');
1730 if (doexec && tainting) {
1732 taint_proper("Insecure %s%s", "EXEC");
1734 while ((pid = (doexec?vfork():fork())) < 0) {
1735 if (errno != EAGAIN) {
1738 croak("Can't fork");
1749 if (p[THIS] != (*mode == 'r')) {
1750 dup2(p[THIS], *mode == 'r');
1754 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1760 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
1763 do_exec(cmd); /* may or may not use the shell */
1767 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1768 sv_setiv(GvSV(tmpgv), (IV)getpid());
1770 hv_clear(pidstatus); /* we have no children */
1775 do_execfree(); /* free any memory malloced by child on vfork */
1777 if (p[that] < p[This]) {
1778 dup2(p[This], p[that]);
1782 sv = *av_fetch(fdpid,p[This],TRUE);
1783 (void)SvUPGRADE(sv,SVt_IV);
1786 return PerlIO_fdopen(p[This], mode);
1789 #if defined(atarist) || defined(DJGPP)
1796 /* Needs work for PerlIO ! */
1797 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1798 return popen(PerlIO_exportFILE(cmd, 0), mode);
1802 #endif /* !DOSISH */
1809 struct stat tmpstatbuf;
1811 PerlIO_printf(PerlIO_stderr(),"%s", s);
1812 for (fd = 0; fd < 32; fd++) {
1813 if (Fstat(fd,&tmpstatbuf) >= 0)
1814 PerlIO_printf(PerlIO_stderr()," %d",fd);
1816 PerlIO_printf(PerlIO_stderr(),"\n");
1826 #if defined(HAS_FCNTL) && defined(F_DUPFD)
1830 return fcntl(oldfd, F_DUPFD, newfd);
1832 #define DUP2_MAX_FDS 256
1833 int fdtmp[DUP2_MAX_FDS];
1840 /* good enough for low fd's... */
1841 while ((fd = dup(oldfd)) != newfd && fd >= 0) {
1842 if (fdx >= DUP2_MAX_FDS) {
1850 close(fdtmp[--fdx]);
1857 #ifdef HAS_SIGACTION
1860 rsignal(int signo, Sighandler_t handler)
1862 struct sigaction act, oact;
1864 act.sa_handler = handler;
1865 sigemptyset(&act.sa_mask);
1868 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1870 if (sigaction(signo, &act, &oact) == -1)
1873 return oact.sa_handler;
1877 rsignal_state(int signo)
1879 struct sigaction oact;
1881 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
1884 return oact.sa_handler;
1888 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
1890 struct sigaction act;
1892 act.sa_handler = handler;
1893 sigemptyset(&act.sa_mask);
1896 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
1898 return sigaction(signo, &act, save);
1902 rsignal_restore(int signo, Sigsave_t *save)
1904 return sigaction(signo, save, (struct sigaction *)NULL);
1907 #else /* !HAS_SIGACTION */
1910 rsignal(int signo, Sighandler_t handler)
1912 return signal(signo, handler);
1915 static int sig_trapped;
1925 rsignal_state(int signo)
1927 Sighandler_t oldsig;
1930 oldsig = signal(signo, sig_trap);
1931 signal(signo, oldsig);
1933 kill(getpid(), signo);
1938 rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
1940 *save = signal(signo, handler);
1941 return (*save == SIG_ERR) ? -1 : 0;
1945 rsignal_restore(int signo, Sigsave_t *save)
1947 return (signal(signo, *save) == SIG_ERR) ? -1 : 0;
1950 #endif /* !HAS_SIGACTION */
1952 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
1953 #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
1955 my_pclose(FILE *ptr)
1957 Sigsave_t hstat, istat, qstat;
1964 int saved_vaxc_errno;
1967 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
1968 pid = (int)SvIVX(*svp);
1972 if (pid == -1) { /* Opened by popen. */
1973 return my_syspclose(ptr);
1976 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
1977 saved_errno = errno;
1979 saved_vaxc_errno = vaxc$errno;
1983 if(kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
1985 rsignal_save(SIGHUP, SIG_IGN, &hstat);
1986 rsignal_save(SIGINT, SIG_IGN, &istat);
1987 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
1989 pid = wait4pid(pid, &status, 0);
1990 } while (pid == -1 && errno == EINTR);
1991 rsignal_restore(SIGHUP, &hstat);
1992 rsignal_restore(SIGINT, &istat);
1993 rsignal_restore(SIGQUIT, &qstat);
1995 SETERRNO(saved_errno, saved_vaxc_errno);
1998 return(pid < 0 ? pid : status == 0 ? 0 : (errno = 0, status));
2000 #endif /* !DOSISH */
2002 #if !defined(DOSISH) || defined(OS2)
2004 wait4pid(int pid, int *statusp, int flags)
2008 char spid[TYPE_CHARS(int)];
2013 sprintf(spid, "%d", pid);
2014 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
2015 if (svp && *svp != &sv_undef) {
2016 *statusp = SvIVX(*svp);
2017 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2024 hv_iterinit(pidstatus);
2025 if (entry = hv_iternext(pidstatus)) {
2026 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2027 sv = hv_iterval(pidstatus,entry);
2028 *statusp = SvIVX(sv);
2029 sprintf(spid, "%d", pid);
2030 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
2035 # ifdef HAS_WAITPID_RUNTIME
2036 if (!HAS_WAITPID_RUNTIME)
2039 return waitpid(pid,statusp,flags);
2041 #if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2042 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2044 #if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2049 croak("Can't do waitpid with flags");
2051 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
2052 pidgone(result,*statusp);
2060 #endif /* !DOSISH */
2064 pidgone(int pid, int status)
2067 char spid[TYPE_CHARS(int)];
2069 sprintf(spid, "%d", pid);
2070 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
2071 (void)SvUPGRADE(sv,SVt_IV);
2076 #if defined(atarist) || defined(OS2) || defined(DJGPP)
2079 int /* Cannot prototype with I32
2088 /* Needs work for PerlIO ! */
2089 FILE *f = PerlIO_findFILE(ptr);
2090 I32 result = pclose(f);
2091 PerlIO_releaseFILE(ptr,f);
2097 repeatcpy(register char *to, register char *from, I32 len, register I32 count)
2100 register char *frombase = from;
2108 while (count-- > 0) {
2109 for (todo = len; todo > 0; todo--) {
2116 #ifndef CASTNEGFLOAT
2124 # define BIGDOUBLE 2147483648.0
2126 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2129 return (unsigned long)f;
2131 return (unsigned long)along;
2138 /* Unfortunately, on some systems the cast_uv() function doesn't
2139 work with the system-supplied definition of ULONG_MAX. The
2140 comparison (f >= ULONG_MAX) always comes out true. It must be a
2141 problem with the compiler constant folding.
2143 In any case, this workaround should be fine on any two's complement
2144 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2146 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2149 /* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2151 -- Kenneth Albanowski <kjahds@kjahds.com>
2155 # define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2163 return (I32) I32_MAX;
2165 return (I32) I32_MIN;
2185 return (UV) MY_UV_MAX;
2197 char *fa = strrchr(a,'/');
2198 char *fb = strrchr(b,'/');
2199 struct stat tmpstatbuf1;
2200 struct stat tmpstatbuf2;
2201 SV *tmpsv = sv_newmortal();
2214 sv_setpv(tmpsv, ".");
2216 sv_setpvn(tmpsv, a, fa - a);
2217 if (Stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2220 sv_setpv(tmpsv, ".");
2222 sv_setpvn(tmpsv, b, fb - b);
2223 if (Stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2225 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2226 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2228 #endif /* !HAS_RENAME */
2231 scan_oct(char *start, I32 len, I32 *retlen)
2233 register char *s = start;
2234 register UV retval = 0;
2235 bool overflowed = FALSE;
2237 while (len && *s >= '0' && *s <= '7') {
2238 register UV n = retval << 3;
2239 if (!overflowed && (n >> 3) != retval) {
2240 warn("Integer overflow in octal number");
2243 retval = n | (*s++ - '0');
2246 if (dowarn && len && (*s == '8' || *s == '9'))
2247 warn("Illegal octal digit ignored");
2248 *retlen = s - start;
2253 scan_hex(char *start, I32 len, I32 *retlen)
2255 register char *s = start;
2256 register UV retval = 0;
2257 bool overflowed = FALSE;
2260 while (len-- && *s && (tmp = strchr((char *) hexdigit, *s))) {
2261 register UV n = retval << 4;
2262 if (!overflowed && (n >> 4) != retval) {
2263 warn("Integer overflow in hex number");
2266 retval = n | ((tmp - hexdigit) & 15);
2269 *retlen = s - start;
2275 /* Very simplistic scheduler for now */
2279 thr = thr->i.next_run;
2290 perl_cond_signal(cp)
2294 perl_cond cond = *cp;
2299 /* Insert t in the runnable queue just ahead of us */
2300 t->i.next_run = thr->i.next_run;
2301 thr->i.next_run->i.prev_run = t;
2302 t->i.prev_run = thr;
2303 thr->i.next_run = t;
2304 thr->i.wait_queue = 0;
2305 /* Remove from the wait queue */
2311 perl_cond_broadcast(cp)
2315 perl_cond cond, cond_next;
2317 for (cond = *cp; cond; cond = cond_next) {
2319 /* Insert t in the runnable queue just ahead of us */
2320 t->i.next_run = thr->i.next_run;
2321 thr->i.next_run->i.prev_run = t;
2322 t->i.prev_run = thr;
2323 thr->i.next_run = t;
2324 thr->i.wait_queue = 0;
2325 /* Remove from the wait queue */
2326 cond_next = cond->next;
2338 if (thr->i.next_run == thr)
2339 croak("panic: perl_cond_wait called by last runnable thread");
2341 New(666, cond, 1, struct perl_wait_queue);
2345 thr->i.wait_queue = cond;
2346 /* Remove ourselves from runnable queue */
2347 thr->i.next_run->i.prev_run = thr->i.prev_run;
2348 thr->i.prev_run->i.next_run = thr->i.next_run;
2350 #endif /* FAKE_THREADS */
2352 #ifdef OLD_PTHREADS_API
2358 if (pthread_getspecific(thr_key, &t))
2359 croak("panic: pthread_getspecific");
2360 return (struct thread *) t;
2362 #endif /* OLD_PTHREADS_API */
2365 condpair_magic(SV *sv)
2369 SvUPGRADE(sv, SVt_PVMG);
2370 mg = mg_find(sv, 'm');
2374 New(53, cp, 1, condpair_t);
2375 MUTEX_INIT(&cp->mutex);
2376 COND_INIT(&cp->owner_cond);
2377 COND_INIT(&cp->cond);
2379 MUTEX_LOCK(&sv_mutex);
2380 mg = mg_find(sv, 'm');
2382 /* someone else beat us to initialising it */
2383 MUTEX_UNLOCK(&sv_mutex);
2384 MUTEX_DESTROY(&cp->mutex);
2385 COND_DESTROY(&cp->owner_cond);
2386 COND_DESTROY(&cp->cond);
2390 sv_magic(sv, Nullsv, 'm', 0, 0);
2392 mg->mg_ptr = (char *)cp;
2393 mg->mg_len = sizeof(cp);
2394 MUTEX_UNLOCK(&sv_mutex);
2395 DEBUG_L(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2396 "%p: condpair_magic %p\n", thr, sv));)
2403 * Make a new perl thread structure using t as a prototype. Some of the
2404 * fields for the new thread are copied from the prototype thread, t,
2405 * so t should not be running in perl at the time this function is
2406 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2407 * thread calling new_struct_thread) clearly satisfies this constraint.
2410 new_struct_thread(struct thread *t)
2417 sv = newSVpv("", 0);
2418 SvGROW(sv, sizeof(struct thread) + 1);
2419 SvCUR_set(sv, sizeof(struct thread));
2420 thr = (Thread) SvPVX(sv);
2421 /* Zero(thr, 1, struct thread); */
2424 memset(thr, 0xab, sizeof(struct thread));
2436 curcop = &compiling;
2437 thr->cvcache = newHV();
2438 thr->magicals = newAV();
2439 thr->specific = newAV();
2440 thr->flags = THRf_R_JOINABLE;
2441 MUTEX_INIT(&thr->mutex);
2443 curcop = t->Tcurcop; /* XXX As good a guess as any? */
2444 defstash = t->Tdefstash; /* XXX maybe these should */
2445 curstash = t->Tcurstash; /* always be set to main? */
2446 /* top_env needs to be non-zero. The particular value doesn't matter */
2447 top_env = t->Ttop_env;
2448 runlevel = 1; /* XXX should be safe ? */
2452 tainted = t->Ttainted;
2453 curpm = t->Tcurpm; /* XXX No PMOP ref count */
2454 nrs = newSVsv(t->Tnrs);
2455 rs = newSVsv(t->Trs);
2456 last_in_gv = (GV*)SvREFCNT_inc(t->Tlast_in_gv);
2457 ofslen = t->Tofslen;
2458 ofs = savepvn(t->Tofs, ofslen);
2459 defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2460 chopset = t->Tchopset;
2461 formtarget = newSVsv(t->Tformtarget);
2462 bodytarget = newSVsv(t->Tbodytarget);
2463 toptarget = newSVsv(t->Ttoptarget);
2465 /* Initialise all per-thread magicals that the template thread used */
2466 svp = AvARRAY(t->magicals);
2467 for (i = 0; i <= AvFILL(t->magicals); i++, svp++) {
2468 if (*svp && *svp != &sv_undef) {
2469 SV *sv = newSVsv(*svp);
2470 av_store(thr->magicals, i, sv);
2471 sv_magic(sv, 0, 0, &per_thread_magicals[i], 1);
2472 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2473 "new_struct_thread: copied magical %d\n",i));
2477 MUTEX_LOCK(&threads_mutex);
2479 thr->tid = ++threadnum;
2480 thr->next = t->next;
2483 thr->next->prev = thr;
2484 MUTEX_UNLOCK(&threads_mutex);
2486 #ifdef HAVE_THREAD_INTERN
2487 init_thread_intern(thr);
2489 thr->self = pthread_self();
2490 #endif /* HAVE_THREAD_INTERN */
2493 #endif /* USE_THREADS */
2497 * This hack is to force load of "huge" support from libm.a
2498 * So it is in perl for (say) POSIX to use.
2499 * Needed for SunOS with Sun's 'acc' for example.