This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
regen regnodes.h
[perl5.git] / util.c
... / ...
CommitLineData
1/* util.c
2 *
3 * Copyright (c) 1991-1999, Larry Wall
4 *
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.
7 *
8 */
9
10/*
11 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
12 * not content." --Gandalf
13 */
14
15#include "EXTERN.h"
16#include "perl.h"
17
18#if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
19#include <signal.h>
20#endif
21
22#ifndef SIG_ERR
23# define SIG_ERR ((Sighandler_t) -1)
24#endif
25
26/* XXX If this causes problems, set i_unistd=undef in the hint file. */
27#ifdef I_UNISTD
28# include <unistd.h>
29#endif
30
31#ifdef I_VFORK
32# include <vfork.h>
33#endif
34
35/* Put this after #includes because fork and vfork prototypes may
36 conflict.
37*/
38#ifndef HAS_VFORK
39# define vfork fork
40#endif
41
42#ifdef I_FCNTL
43# include <fcntl.h>
44#endif
45#ifdef I_SYS_FILE
46# include <sys/file.h>
47#endif
48
49#ifdef I_SYS_WAIT
50# include <sys/wait.h>
51#endif
52
53#define FLUSH
54
55#ifdef LEAKTEST
56
57static void xstat _((int));
58long xcount[MAXXCOUNT];
59long lastxcount[MAXXCOUNT];
60long xycount[MAXXCOUNT][MAXYCOUNT];
61long lastxycount[MAXXCOUNT][MAXYCOUNT];
62
63#endif
64
65/* paranoid version of system's malloc() */
66
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.
71 */
72
73Malloc_t
74safesysmalloc(MEM_SIZE size)
75{
76 Malloc_t ptr;
77#ifdef HAS_64K_LIMIT
78 if (size > 0xffff) {
79 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
80 my_exit(1);
81 }
82#endif /* HAS_64K_LIMIT */
83#ifdef DEBUGGING
84 if ((long)size < 0)
85 croak("panic: malloc");
86#endif
87 ptr = PerlMem_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,PL_an++,(long)size));
90#else
91 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,PL_an++,(long)size));
92#endif
93 if (ptr != Nullch)
94 return ptr;
95 else if (PL_nomemok)
96 return Nullch;
97 else {
98 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
99 my_exit(1);
100 return Nullch;
101 }
102 /*NOTREACHED*/
103}
104
105/* paranoid version of system's realloc() */
106
107Malloc_t
108safesysrealloc(Malloc_t where,MEM_SIZE size)
109{
110 Malloc_t ptr;
111#if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
112 Malloc_t PerlMem_realloc();
113#endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
114
115#ifdef HAS_64K_LIMIT
116 if (size > 0xffff) {
117 PerlIO_printf(PerlIO_stderr(),
118 "Reallocation too large: %lx\n", size) FLUSH;
119 my_exit(1);
120 }
121#endif /* HAS_64K_LIMIT */
122 if (!size) {
123 safesysfree(where);
124 return NULL;
125 }
126
127 if (!where)
128 return safesysmalloc(size);
129#ifdef DEBUGGING
130 if ((long)size < 0)
131 croak("panic: realloc");
132#endif
133 ptr = PerlMem_realloc(where,size);
134
135#if !(defined(I286) || defined(atarist))
136 DEBUG_m( {
137 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,PL_an++);
138 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
139 } )
140#else
141 DEBUG_m( {
142 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,PL_an++);
143 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,PL_an++,(long)size);
144 } )
145#endif
146
147 if (ptr != Nullch)
148 return ptr;
149 else if (PL_nomemok)
150 return Nullch;
151 else {
152 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
153 my_exit(1);
154 return Nullch;
155 }
156 /*NOTREACHED*/
157}
158
159/* safe version of system's free() */
160
161Free_t
162safesysfree(Malloc_t where)
163{
164#if !(defined(I286) || defined(atarist))
165 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,PL_an++));
166#else
167 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,PL_an++));
168#endif
169 if (where) {
170 /*SUPPRESS 701*/
171 PerlMem_free(where);
172 }
173}
174
175/* safe version of system's calloc() */
176
177Malloc_t
178safesyscalloc(MEM_SIZE count, MEM_SIZE size)
179{
180 Malloc_t ptr;
181
182#ifdef HAS_64K_LIMIT
183 if (size * count > 0xffff) {
184 PerlIO_printf(PerlIO_stderr(),
185 "Allocation too large: %lx\n", size * count) FLUSH;
186 my_exit(1);
187 }
188#endif /* HAS_64K_LIMIT */
189#ifdef DEBUGGING
190 if ((long)size < 0 || (long)count < 0)
191 croak("panic: calloc");
192#endif
193 size *= count;
194 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
195#if !(defined(I286) || defined(atarist))
196 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
197#else
198 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,PL_an++,(long)count,(long)size));
199#endif
200 if (ptr != Nullch) {
201 memset((void*)ptr, 0, size);
202 return ptr;
203 }
204 else if (PL_nomemok)
205 return Nullch;
206 else {
207 PerlIO_puts(PerlIO_stderr(),PL_no_mem) FLUSH;
208 my_exit(1);
209 return Nullch;
210 }
211 /*NOTREACHED*/
212}
213
214#ifdef LEAKTEST
215
216struct mem_test_strut {
217 union {
218 long type;
219 char c[2];
220 } u;
221 long size;
222};
223
224# define ALIGN sizeof(struct mem_test_strut)
225
226# define sizeof_chunk(ch) (((struct mem_test_strut*) (ch))->size)
227# define typeof_chunk(ch) \
228 (((struct mem_test_strut*) (ch))->u.c[0] + ((struct mem_test_strut*) (ch))->u.c[1]*100)
229# define set_typeof_chunk(ch,t) \
230 (((struct mem_test_strut*) (ch))->u.c[0] = t % 100, ((struct mem_test_strut*) (ch))->u.c[1] = t / 100)
231#define SIZE_TO_Y(size) ( (size) > MAXY_SIZE \
232 ? MAXYCOUNT - 1 \
233 : ( (size) > 40 \
234 ? ((size) - 1)/8 + 5 \
235 : ((size) - 1)/4))
236
237Malloc_t
238safexmalloc(I32 x, MEM_SIZE size)
239{
240 register char* where = (char*)safemalloc(size + ALIGN);
241
242 xcount[x] += size;
243 xycount[x][SIZE_TO_Y(size)]++;
244 set_typeof_chunk(where, x);
245 sizeof_chunk(where) = size;
246 return (Malloc_t)(where + ALIGN);
247}
248
249Malloc_t
250safexrealloc(Malloc_t wh, MEM_SIZE size)
251{
252 char *where = (char*)wh;
253
254 if (!wh)
255 return safexmalloc(0,size);
256
257 {
258 MEM_SIZE old = sizeof_chunk(where - ALIGN);
259 int t = typeof_chunk(where - ALIGN);
260 register char* new = (char*)saferealloc(where - ALIGN, size + ALIGN);
261
262 xycount[t][SIZE_TO_Y(old)]--;
263 xycount[t][SIZE_TO_Y(size)]++;
264 xcount[t] += size - old;
265 sizeof_chunk(new) = size;
266 return (Malloc_t)(new + ALIGN);
267 }
268}
269
270void
271safexfree(Malloc_t wh)
272{
273 I32 x;
274 char *where = (char*)wh;
275 MEM_SIZE size;
276
277 if (!where)
278 return;
279 where -= ALIGN;
280 size = sizeof_chunk(where);
281 x = where[0] + 100 * where[1];
282 xcount[x] -= size;
283 xycount[x][SIZE_TO_Y(size)]--;
284 safefree(where);
285}
286
287Malloc_t
288safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
289{
290 register char * where = (char*)safexmalloc(x, size * count + ALIGN);
291 xcount[x] += size;
292 xycount[x][SIZE_TO_Y(size)]++;
293 memset((void*)(where + ALIGN), 0, size * count);
294 set_typeof_chunk(where, x);
295 sizeof_chunk(where) = size;
296 return (Malloc_t)(where + ALIGN);
297}
298
299static void
300xstat(int flag)
301{
302 register I32 i, j, total = 0;
303 I32 subtot[MAXYCOUNT];
304
305 for (j = 0; j < MAXYCOUNT; j++) {
306 subtot[j] = 0;
307 }
308
309 PerlIO_printf(PerlIO_stderr(), " Id subtot 4 8 12 16 20 24 28 32 36 40 48 56 64 72 80 80+\n", total);
310 for (i = 0; i < MAXXCOUNT; i++) {
311 total += xcount[i];
312 for (j = 0; j < MAXYCOUNT; j++) {
313 subtot[j] += xycount[i][j];
314 }
315 if (flag == 0
316 ? xcount[i] /* Have something */
317 : (flag == 2
318 ? xcount[i] != lastxcount[i] /* Changed */
319 : xcount[i] > lastxcount[i])) { /* Growed */
320 PerlIO_printf(PerlIO_stderr(),"%2d %02d %7ld ", i / 100, i % 100,
321 flag == 2 ? xcount[i] - lastxcount[i] : xcount[i]);
322 lastxcount[i] = xcount[i];
323 for (j = 0; j < MAXYCOUNT; j++) {
324 if ( flag == 0
325 ? xycount[i][j] /* Have something */
326 : (flag == 2
327 ? xycount[i][j] != lastxycount[i][j] /* Changed */
328 : xycount[i][j] > lastxycount[i][j])) { /* Growed */
329 PerlIO_printf(PerlIO_stderr(),"%3ld ",
330 flag == 2
331 ? xycount[i][j] - lastxycount[i][j]
332 : xycount[i][j]);
333 lastxycount[i][j] = xycount[i][j];
334 } else {
335 PerlIO_printf(PerlIO_stderr(), " . ", xycount[i][j]);
336 }
337 }
338 PerlIO_printf(PerlIO_stderr(), "\n");
339 }
340 }
341 if (flag != 2) {
342 PerlIO_printf(PerlIO_stderr(), "Total %7ld ", total);
343 for (j = 0; j < MAXYCOUNT; j++) {
344 if (subtot[j]) {
345 PerlIO_printf(PerlIO_stderr(), "%3ld ", subtot[j]);
346 } else {
347 PerlIO_printf(PerlIO_stderr(), " . ");
348 }
349 }
350 PerlIO_printf(PerlIO_stderr(), "\n");
351 }
352}
353
354#endif /* LEAKTEST */
355
356/* copy a string up to some (non-backslashed) delimiter, if any */
357
358char *
359delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
360{
361 register I32 tolen;
362 for (tolen = 0; from < fromend; from++, tolen++) {
363 if (*from == '\\') {
364 if (from[1] == delim)
365 from++;
366 else {
367 if (to < toend)
368 *to++ = *from;
369 tolen++;
370 from++;
371 }
372 }
373 else if (*from == delim)
374 break;
375 if (to < toend)
376 *to++ = *from;
377 }
378 if (to < toend)
379 *to = '\0';
380 *retlen = tolen;
381 return from;
382}
383
384/* return ptr to little string in big string, NULL if not found */
385/* This routine was donated by Corey Satten. */
386
387char *
388instr(register const char *big, register const char *little)
389{
390 register const char *s, *x;
391 register I32 first;
392
393 if (!little)
394 return (char*)big;
395 first = *little++;
396 if (!first)
397 return (char*)big;
398 while (*big) {
399 if (*big++ != first)
400 continue;
401 for (x=big,s=little; *s; /**/ ) {
402 if (!*x)
403 return Nullch;
404 if (*s++ != *x++) {
405 s--;
406 break;
407 }
408 }
409 if (!*s)
410 return (char*)(big-1);
411 }
412 return Nullch;
413}
414
415/* same as instr but allow embedded nulls */
416
417char *
418ninstr(register const char *big, register const char *bigend, const char *little, const char *lend)
419{
420 register const char *s, *x;
421 register I32 first = *little;
422 register const char *littleend = lend;
423
424 if (!first && little >= littleend)
425 return (char*)big;
426 if (bigend - big < littleend - little)
427 return Nullch;
428 bigend -= littleend - little++;
429 while (big <= bigend) {
430 if (*big++ != first)
431 continue;
432 for (x=big,s=little; s < littleend; /**/ ) {
433 if (*s++ != *x++) {
434 s--;
435 break;
436 }
437 }
438 if (s >= littleend)
439 return (char*)(big-1);
440 }
441 return Nullch;
442}
443
444/* reverse of the above--find last substring */
445
446char *
447rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
448{
449 register const char *bigbeg;
450 register const char *s, *x;
451 register I32 first = *little;
452 register const char *littleend = lend;
453
454 if (!first && little >= littleend)
455 return (char*)bigend;
456 bigbeg = big;
457 big = bigend - (littleend - little++);
458 while (big >= bigbeg) {
459 if (*big-- != first)
460 continue;
461 for (x=big+2,s=little; s < littleend; /**/ ) {
462 if (*s++ != *x++) {
463 s--;
464 break;
465 }
466 }
467 if (s >= littleend)
468 return (char*)(big+1);
469 }
470 return Nullch;
471}
472
473/*
474 * Set up for a new ctype locale.
475 */
476void
477perl_new_ctype(const char *newctype)
478{
479#ifdef USE_LOCALE_CTYPE
480
481 int i;
482
483 for (i = 0; i < 256; i++) {
484 if (isUPPER_LC(i))
485 PL_fold_locale[i] = toLOWER_LC(i);
486 else if (isLOWER_LC(i))
487 PL_fold_locale[i] = toUPPER_LC(i);
488 else
489 PL_fold_locale[i] = i;
490 }
491
492#endif /* USE_LOCALE_CTYPE */
493}
494
495/*
496 * Set up for a new collation locale.
497 */
498void
499perl_new_collate(const char *newcoll)
500{
501#ifdef USE_LOCALE_COLLATE
502
503 if (! newcoll) {
504 if (PL_collation_name) {
505 ++PL_collation_ix;
506 Safefree(PL_collation_name);
507 PL_collation_name = NULL;
508 PL_collation_standard = TRUE;
509 PL_collxfrm_base = 0;
510 PL_collxfrm_mult = 2;
511 }
512 return;
513 }
514
515 if (! PL_collation_name || strNE(PL_collation_name, newcoll)) {
516 ++PL_collation_ix;
517 Safefree(PL_collation_name);
518 PL_collation_name = savepv(newcoll);
519 PL_collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
520
521 {
522 /* 2: at most so many chars ('a', 'b'). */
523 /* 50: surely no system expands a char more. */
524#define XFRMBUFSIZE (2 * 50)
525 char xbuf[XFRMBUFSIZE];
526 Size_t fa = strxfrm(xbuf, "a", XFRMBUFSIZE);
527 Size_t fb = strxfrm(xbuf, "ab", XFRMBUFSIZE);
528 SSize_t mult = fb - fa;
529 if (mult < 1)
530 croak("strxfrm() gets absurd");
531 PL_collxfrm_base = (fa > mult) ? (fa - mult) : 0;
532 PL_collxfrm_mult = mult;
533 }
534 }
535
536#endif /* USE_LOCALE_COLLATE */
537}
538
539/*
540 * Set up for a new numeric locale.
541 */
542void
543perl_new_numeric(const char *newnum)
544{
545#ifdef USE_LOCALE_NUMERIC
546
547 if (! newnum) {
548 if (PL_numeric_name) {
549 Safefree(PL_numeric_name);
550 PL_numeric_name = NULL;
551 PL_numeric_standard = TRUE;
552 PL_numeric_local = TRUE;
553 }
554 return;
555 }
556
557 if (! PL_numeric_name || strNE(PL_numeric_name, newnum)) {
558 Safefree(PL_numeric_name);
559 PL_numeric_name = savepv(newnum);
560 PL_numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
561 PL_numeric_local = TRUE;
562 }
563
564#endif /* USE_LOCALE_NUMERIC */
565}
566
567void
568perl_set_numeric_standard(void)
569{
570#ifdef USE_LOCALE_NUMERIC
571
572 if (! PL_numeric_standard) {
573 setlocale(LC_NUMERIC, "C");
574 PL_numeric_standard = TRUE;
575 PL_numeric_local = FALSE;
576 }
577
578#endif /* USE_LOCALE_NUMERIC */
579}
580
581void
582perl_set_numeric_local(void)
583{
584#ifdef USE_LOCALE_NUMERIC
585
586 if (! PL_numeric_local) {
587 setlocale(LC_NUMERIC, PL_numeric_name);
588 PL_numeric_standard = FALSE;
589 PL_numeric_local = TRUE;
590 }
591
592#endif /* USE_LOCALE_NUMERIC */
593}
594
595
596/*
597 * Initialize locale awareness.
598 */
599int
600perl_init_i18nl10n(int printwarn)
601{
602 int ok = 1;
603 /* returns
604 * 1 = set ok or not applicable,
605 * 0 = fallback to C locale,
606 * -1 = fallback to C locale failed
607 */
608
609#ifdef USE_LOCALE
610
611#ifdef USE_LOCALE_CTYPE
612 char *curctype = NULL;
613#endif /* USE_LOCALE_CTYPE */
614#ifdef USE_LOCALE_COLLATE
615 char *curcoll = NULL;
616#endif /* USE_LOCALE_COLLATE */
617#ifdef USE_LOCALE_NUMERIC
618 char *curnum = NULL;
619#endif /* USE_LOCALE_NUMERIC */
620#ifdef __GLIBC__
621 char *language = PerlEnv_getenv("LANGUAGE");
622#endif
623 char *lc_all = PerlEnv_getenv("LC_ALL");
624 char *lang = PerlEnv_getenv("LANG");
625 bool setlocale_failure = FALSE;
626
627#ifdef LOCALE_ENVIRON_REQUIRED
628
629 /*
630 * Ultrix setlocale(..., "") fails if there are no environment
631 * variables from which to get a locale name.
632 */
633
634 bool done = FALSE;
635
636#ifdef LC_ALL
637 if (lang) {
638 if (setlocale(LC_ALL, ""))
639 done = TRUE;
640 else
641 setlocale_failure = TRUE;
642 }
643 if (!setlocale_failure) {
644#ifdef USE_LOCALE_CTYPE
645 if (! (curctype =
646 setlocale(LC_CTYPE,
647 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
648 ? "" : Nullch)))
649 setlocale_failure = TRUE;
650#endif /* USE_LOCALE_CTYPE */
651#ifdef USE_LOCALE_COLLATE
652 if (! (curcoll =
653 setlocale(LC_COLLATE,
654 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
655 ? "" : Nullch)))
656 setlocale_failure = TRUE;
657#endif /* USE_LOCALE_COLLATE */
658#ifdef USE_LOCALE_NUMERIC
659 if (! (curnum =
660 setlocale(LC_NUMERIC,
661 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
662 ? "" : Nullch)))
663 setlocale_failure = TRUE;
664#endif /* USE_LOCALE_NUMERIC */
665 }
666
667#endif /* LC_ALL */
668
669#endif /* !LOCALE_ENVIRON_REQUIRED */
670
671#ifdef LC_ALL
672 if (! setlocale(LC_ALL, ""))
673 setlocale_failure = TRUE;
674#endif /* LC_ALL */
675
676 if (!setlocale_failure) {
677#ifdef USE_LOCALE_CTYPE
678 if (! (curctype = setlocale(LC_CTYPE, "")))
679 setlocale_failure = TRUE;
680#endif /* USE_LOCALE_CTYPE */
681#ifdef USE_LOCALE_COLLATE
682 if (! (curcoll = setlocale(LC_COLLATE, "")))
683 setlocale_failure = TRUE;
684#endif /* USE_LOCALE_COLLATE */
685#ifdef USE_LOCALE_NUMERIC
686 if (! (curnum = setlocale(LC_NUMERIC, "")))
687 setlocale_failure = TRUE;
688#endif /* USE_LOCALE_NUMERIC */
689 }
690
691 if (setlocale_failure) {
692 char *p;
693 bool locwarn = (printwarn > 1 ||
694 printwarn &&
695 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
696
697 if (locwarn) {
698#ifdef LC_ALL
699
700 PerlIO_printf(PerlIO_stderr(),
701 "perl: warning: Setting locale failed.\n");
702
703#else /* !LC_ALL */
704
705 PerlIO_printf(PerlIO_stderr(),
706 "perl: warning: Setting locale failed for the categories:\n\t");
707#ifdef USE_LOCALE_CTYPE
708 if (! curctype)
709 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
710#endif /* USE_LOCALE_CTYPE */
711#ifdef USE_LOCALE_COLLATE
712 if (! curcoll)
713 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
714#endif /* USE_LOCALE_COLLATE */
715#ifdef USE_LOCALE_NUMERIC
716 if (! curnum)
717 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
718#endif /* USE_LOCALE_NUMERIC */
719 PerlIO_printf(PerlIO_stderr(), "\n");
720
721#endif /* LC_ALL */
722
723 PerlIO_printf(PerlIO_stderr(),
724 "perl: warning: Please check that your locale settings:\n");
725
726#ifdef __GLIBC__
727 PerlIO_printf(PerlIO_stderr(),
728 "\tLANGUAGE = %c%s%c,\n",
729 language ? '"' : '(',
730 language ? language : "unset",
731 language ? '"' : ')');
732#endif
733
734 PerlIO_printf(PerlIO_stderr(),
735 "\tLC_ALL = %c%s%c,\n",
736 lc_all ? '"' : '(',
737 lc_all ? lc_all : "unset",
738 lc_all ? '"' : ')');
739
740 {
741 char **e;
742 for (e = environ; *e; e++) {
743 if (strnEQ(*e, "LC_", 3)
744 && strnNE(*e, "LC_ALL=", 7)
745 && (p = strchr(*e, '=')))
746 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
747 (int)(p - *e), *e, p + 1);
748 }
749 }
750
751 PerlIO_printf(PerlIO_stderr(),
752 "\tLANG = %c%s%c\n",
753 lang ? '"' : '(',
754 lang ? lang : "unset",
755 lang ? '"' : ')');
756
757 PerlIO_printf(PerlIO_stderr(),
758 " are supported and installed on your system.\n");
759 }
760
761#ifdef LC_ALL
762
763 if (setlocale(LC_ALL, "C")) {
764 if (locwarn)
765 PerlIO_printf(PerlIO_stderr(),
766 "perl: warning: Falling back to the standard locale (\"C\").\n");
767 ok = 0;
768 }
769 else {
770 if (locwarn)
771 PerlIO_printf(PerlIO_stderr(),
772 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
773 ok = -1;
774 }
775
776#else /* ! LC_ALL */
777
778 if (0
779#ifdef USE_LOCALE_CTYPE
780 || !(curctype || setlocale(LC_CTYPE, "C"))
781#endif /* USE_LOCALE_CTYPE */
782#ifdef USE_LOCALE_COLLATE
783 || !(curcoll || setlocale(LC_COLLATE, "C"))
784#endif /* USE_LOCALE_COLLATE */
785#ifdef USE_LOCALE_NUMERIC
786 || !(curnum || setlocale(LC_NUMERIC, "C"))
787#endif /* USE_LOCALE_NUMERIC */
788 )
789 {
790 if (locwarn)
791 PerlIO_printf(PerlIO_stderr(),
792 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
793 ok = -1;
794 }
795
796#endif /* ! LC_ALL */
797
798#ifdef USE_LOCALE_CTYPE
799 curctype = setlocale(LC_CTYPE, Nullch);
800#endif /* USE_LOCALE_CTYPE */
801#ifdef USE_LOCALE_COLLATE
802 curcoll = setlocale(LC_COLLATE, Nullch);
803#endif /* USE_LOCALE_COLLATE */
804#ifdef USE_LOCALE_NUMERIC
805 curnum = setlocale(LC_NUMERIC, Nullch);
806#endif /* USE_LOCALE_NUMERIC */
807 }
808
809#ifdef USE_LOCALE_CTYPE
810 perl_new_ctype(curctype);
811#endif /* USE_LOCALE_CTYPE */
812
813#ifdef USE_LOCALE_COLLATE
814 perl_new_collate(curcoll);
815#endif /* USE_LOCALE_COLLATE */
816
817#ifdef USE_LOCALE_NUMERIC
818 perl_new_numeric(curnum);
819#endif /* USE_LOCALE_NUMERIC */
820
821#endif /* USE_LOCALE */
822
823 return ok;
824}
825
826/* Backwards compatibility. */
827int
828perl_init_i18nl14n(int printwarn)
829{
830 return perl_init_i18nl10n(printwarn);
831}
832
833#ifdef USE_LOCALE_COLLATE
834
835/*
836 * mem_collxfrm() is a bit like strxfrm() but with two important
837 * differences. First, it handles embedded NULs. Second, it allocates
838 * a bit more memory than needed for the transformed data itself.
839 * The real transformed data begins at offset sizeof(collationix).
840 * Please see sv_collxfrm() to see how this is used.
841 */
842char *
843mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
844{
845 char *xbuf;
846 STRLEN xAlloc, xin, xout; /* xalloc is a reserved word in VC */
847
848 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
849 /* the +1 is for the terminating NUL. */
850
851 xAlloc = sizeof(PL_collation_ix) + PL_collxfrm_base + (PL_collxfrm_mult * len) + 1;
852 New(171, xbuf, xAlloc, char);
853 if (! xbuf)
854 goto bad;
855
856 *(U32*)xbuf = PL_collation_ix;
857 xout = sizeof(PL_collation_ix);
858 for (xin = 0; xin < len; ) {
859 SSize_t xused;
860
861 for (;;) {
862 xused = strxfrm(xbuf + xout, s + xin, xAlloc - xout);
863 if (xused == -1)
864 goto bad;
865 if (xused < xAlloc - xout)
866 break;
867 xAlloc = (2 * xAlloc) + 1;
868 Renew(xbuf, xAlloc, char);
869 if (! xbuf)
870 goto bad;
871 }
872
873 xin += strlen(s + xin) + 1;
874 xout += xused;
875
876 /* Embedded NULs are understood but silently skipped
877 * because they make no sense in locale collation. */
878 }
879
880 xbuf[xout] = '\0';
881 *xlen = xout - sizeof(PL_collation_ix);
882 return xbuf;
883
884 bad:
885 Safefree(xbuf);
886 *xlen = 0;
887 return NULL;
888}
889
890#endif /* USE_LOCALE_COLLATE */
891
892void
893fbm_compile(SV *sv, U32 flags /* not used yet */)
894{
895 register U8 *s;
896 register U8 *table;
897 register U32 i;
898 STRLEN len;
899 I32 rarest = 0;
900 U32 frequency = 256;
901
902 s = (U8*)SvPV_force(sv, len);
903 (void)SvUPGRADE(sv, SVt_PVBM);
904 if (len > 255 || len == 0) /* TAIL might be on on a zero-length string. */
905 return; /* can't have offsets that big */
906 if (len > 2) {
907 Sv_Grow(sv,len + 258);
908 table = (unsigned char*)(SvPVX(sv) + len + 1);
909 s = table - 2;
910 for (i = 0; i < 256; i++) {
911 table[i] = len;
912 }
913 i = 0;
914 while (s >= (unsigned char*)(SvPVX(sv)))
915 {
916 if (table[*s] == len)
917 table[*s] = i;
918 s--,i++;
919 }
920 }
921 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
922 SvVALID_on(sv);
923
924 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
925 for (i = 0; i < len; i++) {
926 if (PL_freq[s[i]] < frequency) {
927 rarest = i;
928 frequency = PL_freq[s[i]];
929 }
930 }
931 BmRARE(sv) = s[rarest];
932 BmPREVIOUS(sv) = rarest;
933 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
934}
935
936char *
937fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
938{
939 register unsigned char *s;
940 register I32 tmp;
941 register I32 littlelen;
942 register unsigned char *little;
943 register unsigned char *table;
944 register unsigned char *olds;
945 register unsigned char *oldlittle;
946
947 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
948 STRLEN len;
949 char *l = SvPV(littlestr,len);
950 if (!len) {
951 if (SvTAIL(littlestr)) { /* Can be only 0-len constant
952 substr => we can ignore SvVALID */
953 if (PL_multiline) {
954 char *t = "\n";
955 if ((s = (unsigned char*)ninstr((char*)big, (char*)bigend,
956 t, t + len))) {
957 return (char*)s;
958 }
959 }
960 if (bigend > big && bigend[-1] == '\n')
961 return (char *)(bigend - 1);
962 else
963 return (char *) bigend;
964 }
965 return (char*)big;
966 }
967 return ninstr((char*)big,(char*)bigend, l, l + len);
968 }
969
970 littlelen = SvCUR(littlestr);
971 if (SvTAIL(littlestr) && !PL_multiline) { /* tail anchored? */
972 if (littlelen > bigend - big)
973 return Nullch;
974 little = (unsigned char*)SvPVX(littlestr);
975 s = bigend - littlelen;
976 if (s > big
977 && bigend[-1] == '\n'
978 && s[-1] == *little && memEQ((char*)s - 1,(char*)little,littlelen))
979 return (char*)s - 1; /* how sweet it is */
980 else if (*s == *little && memEQ((char*)s,(char*)little,littlelen))
981 return (char*)s; /* how sweet it is */
982 return Nullch;
983 }
984 if (littlelen <= 2) {
985 unsigned char c1 = (unsigned char)SvPVX(littlestr)[0];
986 unsigned char c2 = (unsigned char)SvPVX(littlestr)[1];
987 /* This may do extra comparisons if littlelen == 2, but this
988 should be hidden in the noise since we do less indirection. */
989
990 s = big;
991 bigend -= littlelen;
992 while (s <= bigend) {
993 if (s[0] == c1
994 && (littlelen == 1 || s[1] == c2)
995 && (!SvTAIL(littlestr)
996 || s == bigend
997 || s[littlelen] == '\n')) /* Automatically multiline */
998 {
999 return (char*)s;
1000 }
1001 s++;
1002 }
1003 return Nullch;
1004 }
1005 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
1006 if (--littlelen >= bigend - big)
1007 return Nullch;
1008 s = big + littlelen;
1009 oldlittle = little = table - 2;
1010 if (s < bigend) {
1011 top2:
1012 /*SUPPRESS 560*/
1013 if (tmp = table[*s]) {
1014#ifdef POINTERRIGOR
1015 if (bigend - s > tmp) {
1016 s += tmp;
1017 goto top2;
1018 }
1019#else
1020 if ((s += tmp) < bigend)
1021 goto top2;
1022#endif
1023 return Nullch;
1024 }
1025 else {
1026 tmp = littlelen; /* less expensive than calling strncmp() */
1027 olds = s;
1028 while (tmp--) {
1029 if (*--s == *--little)
1030 continue;
1031 differ:
1032 s = olds + 1; /* here we pay the price for failure */
1033 little = oldlittle;
1034 if (s < bigend) /* fake up continue to outer loop */
1035 goto top2;
1036 return Nullch;
1037 }
1038 if (SvTAIL(littlestr) /* automatically multiline */
1039 && olds + 1 != bigend
1040 && olds[1] != '\n')
1041 goto differ;
1042 return (char *)s;
1043 }
1044 }
1045 return Nullch;
1046}
1047
1048/* start_shift, end_shift are positive quantities which give offsets
1049 of ends of some substring of bigstr.
1050 If `last' we want the last occurence.
1051 old_posp is the way of communication between consequent calls if
1052 the next call needs to find the .
1053 The initial *old_posp should be -1.
1054 Note that we do not take into account SvTAIL, so it may give wrong
1055 positives if _ALL flag is set.
1056 */
1057
1058char *
1059screaminstr(SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
1060{
1061 dTHR;
1062 register unsigned char *s, *x;
1063 register unsigned char *big;
1064 register I32 pos;
1065 register I32 previous;
1066 register I32 first;
1067 register unsigned char *little;
1068 register I32 stop_pos;
1069 register unsigned char *littleend;
1070 I32 found = 0;
1071
1072 if (*old_posp == -1
1073 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
1074 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0))
1075 return Nullch;
1076 little = (unsigned char *)(SvPVX(littlestr));
1077 littleend = little + SvCUR(littlestr);
1078 first = *little++;
1079 /* The value of pos we can start at: */
1080 previous = BmPREVIOUS(littlestr);
1081 big = (unsigned char *)(SvPVX(bigstr));
1082 /* The value of pos we can stop at: */
1083 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1084 if (previous + start_shift > stop_pos) return Nullch;
1085 while (pos < previous + start_shift) {
1086 if (!(pos += PL_screamnext[pos]))
1087 return Nullch;
1088 }
1089#ifdef POINTERRIGOR
1090 do {
1091 if (pos >= stop_pos) break;
1092 if (big[pos-previous] != first)
1093 continue;
1094 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
1095 if (*s++ != *x++) {
1096 s--;
1097 break;
1098 }
1099 }
1100 if (s == littleend) {
1101 *old_posp = pos;
1102 if (!last) return (char *)(big+pos-previous);
1103 found = 1;
1104 }
1105 } while ( pos += PL_screamnext[pos] );
1106 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
1107#else /* !POINTERRIGOR */
1108 big -= previous;
1109 do {
1110 if (pos >= stop_pos) break;
1111 if (big[pos] != first)
1112 continue;
1113 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
1114 if (*s++ != *x++) {
1115 s--;
1116 break;
1117 }
1118 }
1119 if (s == littleend) {
1120 *old_posp = pos;
1121 if (!last) return (char *)(big+pos);
1122 found = 1;
1123 }
1124 } while ( pos += PL_screamnext[pos] );
1125 return (last && found) ? (char *)(big+(*old_posp)) : Nullch;
1126#endif /* POINTERRIGOR */
1127}
1128
1129I32
1130ibcmp(const char *s1, const char *s2, register I32 len)
1131{
1132 register U8 *a = (U8 *)s1;
1133 register U8 *b = (U8 *)s2;
1134 while (len--) {
1135 if (*a != *b && *a != PL_fold[*b])
1136 return 1;
1137 a++,b++;
1138 }
1139 return 0;
1140}
1141
1142I32
1143ibcmp_locale(const char *s1, const char *s2, register I32 len)
1144{
1145 register U8 *a = (U8 *)s1;
1146 register U8 *b = (U8 *)s2;
1147 while (len--) {
1148 if (*a != *b && *a != PL_fold_locale[*b])
1149 return 1;
1150 a++,b++;
1151 }
1152 return 0;
1153}
1154
1155/* copy a string to a safe spot */
1156
1157char *
1158savepv(const char *sv)
1159{
1160 register char *newaddr;
1161
1162 New(902,newaddr,strlen(sv)+1,char);
1163 (void)strcpy(newaddr,sv);
1164 return newaddr;
1165}
1166
1167/* same thing but with a known length */
1168
1169char *
1170savepvn(const char *sv, register I32 len)
1171{
1172 register char *newaddr;
1173
1174 New(903,newaddr,len+1,char);
1175 Copy(sv,newaddr,len,char); /* might not be null terminated */
1176 newaddr[len] = '\0'; /* is now */
1177 return newaddr;
1178}
1179
1180/* the SV for form() and mess() is not kept in an arena */
1181
1182STATIC SV *
1183mess_alloc(void)
1184{
1185 dTHR;
1186 SV *sv;
1187 XPVMG *any;
1188
1189 if (!PL_dirty)
1190 return sv_2mortal(newSVpvn("",0));
1191
1192 if (PL_mess_sv)
1193 return PL_mess_sv;
1194
1195 /* Create as PVMG now, to avoid any upgrading later */
1196 New(905, sv, 1, SV);
1197 Newz(905, any, 1, XPVMG);
1198 SvFLAGS(sv) = SVt_PVMG;
1199 SvANY(sv) = (void*)any;
1200 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1201 PL_mess_sv = sv;
1202 return sv;
1203}
1204
1205char *
1206form(const char* pat, ...)
1207{
1208 SV *sv = mess_alloc();
1209 va_list args;
1210 va_start(args, pat);
1211 sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
1212 va_end(args);
1213 return SvPVX(sv);
1214}
1215
1216SV *
1217mess(const char *pat, va_list *args)
1218{
1219 SV *sv = mess_alloc();
1220 static char dgd[] = " during global destruction.\n";
1221
1222 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
1223 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
1224 dTHR;
1225 if (PL_curcop->cop_line)
1226 sv_catpvf(sv, " at %_ line %ld",
1227 GvSV(PL_curcop->cop_filegv), (long)PL_curcop->cop_line);
1228 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
1229 bool line_mode = (RsSIMPLE(PL_rs) &&
1230 SvCUR(PL_rs) == 1 && *SvPVX(PL_rs) == '\n');
1231 sv_catpvf(sv, ", <%s> %s %ld",
1232 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
1233 line_mode ? "line" : "chunk",
1234 (long)IoLINES(GvIOp(PL_last_in_gv)));
1235 }
1236 sv_catpv(sv, PL_dirty ? dgd : ".\n");
1237 }
1238 return sv;
1239}
1240
1241OP *
1242die(const char* pat, ...)
1243{
1244 dTHR;
1245 va_list args;
1246 char *message;
1247 int was_in_eval = PL_in_eval;
1248 HV *stash;
1249 GV *gv;
1250 CV *cv;
1251 SV *msv;
1252 STRLEN msglen;
1253
1254 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1255 "%p: die: curstack = %p, mainstack = %p\n",
1256 thr, PL_curstack, PL_mainstack));
1257
1258 va_start(args, pat);
1259 if (pat) {
1260 msv = mess(pat, &args);
1261 message = SvPV(msv,msglen);
1262 }
1263 else {
1264 message = Nullch;
1265 }
1266 va_end(args);
1267
1268 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1269 "%p: die: message = %s\ndiehook = %p\n",
1270 thr, message, PL_diehook));
1271 if (PL_diehook) {
1272 /* sv_2cv might call croak() */
1273 SV *olddiehook = PL_diehook;
1274 ENTER;
1275 SAVESPTR(PL_diehook);
1276 PL_diehook = Nullsv;
1277 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1278 LEAVE;
1279 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1280 dSP;
1281 SV *msg;
1282
1283 ENTER;
1284 if (message) {
1285 msg = newSVpvn(message, msglen);
1286 SvREADONLY_on(msg);
1287 SAVEFREESV(msg);
1288 }
1289 else {
1290 msg = ERRSV;
1291 }
1292
1293 PUSHSTACKi(PERLSI_DIEHOOK);
1294 PUSHMARK(SP);
1295 XPUSHs(msg);
1296 PUTBACK;
1297 perl_call_sv((SV*)cv, G_DISCARD);
1298 POPSTACK;
1299 LEAVE;
1300 }
1301 }
1302
1303 PL_restartop = die_where(message, msglen);
1304 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
1305 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1306 thr, PL_restartop, was_in_eval, PL_top_env));
1307 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
1308 JMPENV_JUMP(3);
1309 return PL_restartop;
1310}
1311
1312void
1313croak(const char* pat, ...)
1314{
1315 dTHR;
1316 va_list args;
1317 char *message;
1318 HV *stash;
1319 GV *gv;
1320 CV *cv;
1321 SV *msv;
1322 STRLEN msglen;
1323
1324 va_start(args, pat);
1325 msv = mess(pat, &args);
1326 message = SvPV(msv,msglen);
1327 va_end(args);
1328 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1329 if (PL_diehook) {
1330 /* sv_2cv might call croak() */
1331 SV *olddiehook = PL_diehook;
1332 ENTER;
1333 SAVESPTR(PL_diehook);
1334 PL_diehook = Nullsv;
1335 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1336 LEAVE;
1337 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1338 dSP;
1339 SV *msg;
1340
1341 ENTER;
1342 msg = newSVpvn(message, msglen);
1343 SvREADONLY_on(msg);
1344 SAVEFREESV(msg);
1345
1346 PUSHSTACKi(PERLSI_DIEHOOK);
1347 PUSHMARK(SP);
1348 XPUSHs(msg);
1349 PUTBACK;
1350 perl_call_sv((SV*)cv, G_DISCARD);
1351 POPSTACK;
1352 LEAVE;
1353 }
1354 }
1355 if (PL_in_eval) {
1356 PL_restartop = die_where(message, msglen);
1357 JMPENV_JUMP(3);
1358 }
1359 {
1360#ifdef USE_SFIO
1361 /* SFIO can really mess with your errno */
1362 int e = errno;
1363#endif
1364 PerlIO_write(PerlIO_stderr(), message, msglen);
1365 (void)PerlIO_flush(PerlIO_stderr());
1366#ifdef USE_SFIO
1367 errno = e;
1368#endif
1369 }
1370 my_failure_exit();
1371}
1372
1373void
1374warn(const char* pat,...)
1375{
1376 va_list args;
1377 char *message;
1378 HV *stash;
1379 GV *gv;
1380 CV *cv;
1381 SV *msv;
1382 STRLEN msglen;
1383
1384 va_start(args, pat);
1385 msv = mess(pat, &args);
1386 message = SvPV(msv, msglen);
1387 va_end(args);
1388
1389 if (PL_warnhook) {
1390 /* sv_2cv might call warn() */
1391 dTHR;
1392 SV *oldwarnhook = PL_warnhook;
1393 ENTER;
1394 SAVESPTR(PL_warnhook);
1395 PL_warnhook = Nullsv;
1396 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1397 LEAVE;
1398 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1399 dSP;
1400 SV *msg;
1401
1402 ENTER;
1403 msg = newSVpvn(message, msglen);
1404 SvREADONLY_on(msg);
1405 SAVEFREESV(msg);
1406
1407 PUSHSTACKi(PERLSI_WARNHOOK);
1408 PUSHMARK(SP);
1409 XPUSHs(msg);
1410 PUTBACK;
1411 perl_call_sv((SV*)cv, G_DISCARD);
1412 POPSTACK;
1413 LEAVE;
1414 return;
1415 }
1416 }
1417 PerlIO_write(PerlIO_stderr(), message, msglen);
1418#ifdef LEAKTEST
1419 DEBUG_L(*message == '!'
1420 ? (xstat(message[1]=='!'
1421 ? (message[2]=='!' ? 2 : 1)
1422 : 0)
1423 , 0)
1424 : 0);
1425#endif
1426 (void)PerlIO_flush(PerlIO_stderr());
1427}
1428
1429void
1430warner(U32 err, const char* pat,...)
1431{
1432 dTHR;
1433 va_list args;
1434 char *message;
1435 HV *stash;
1436 GV *gv;
1437 CV *cv;
1438 SV *msv;
1439 STRLEN msglen;
1440
1441 va_start(args, pat);
1442 msv = mess(pat, &args);
1443 message = SvPV(msv, msglen);
1444 va_end(args);
1445
1446 if (ckDEAD(err)) {
1447#ifdef USE_THREADS
1448 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
1449#endif /* USE_THREADS */
1450 if (PL_diehook) {
1451 /* sv_2cv might call croak() */
1452 SV *olddiehook = PL_diehook;
1453 ENTER;
1454 SAVESPTR(PL_diehook);
1455 PL_diehook = Nullsv;
1456 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1457 LEAVE;
1458 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1459 dSP;
1460 SV *msg;
1461
1462 ENTER;
1463 msg = newSVpvn(message, msglen);
1464 SvREADONLY_on(msg);
1465 SAVEFREESV(msg);
1466
1467 PUSHMARK(sp);
1468 XPUSHs(msg);
1469 PUTBACK;
1470 perl_call_sv((SV*)cv, G_DISCARD);
1471
1472 LEAVE;
1473 }
1474 }
1475 if (PL_in_eval) {
1476 PL_restartop = die_where(message, msglen);
1477 JMPENV_JUMP(3);
1478 }
1479 PerlIO_write(PerlIO_stderr(), message, msglen);
1480 (void)PerlIO_flush(PerlIO_stderr());
1481 my_failure_exit();
1482
1483 }
1484 else {
1485 if (PL_warnhook) {
1486 /* sv_2cv might call warn() */
1487 dTHR;
1488 SV *oldwarnhook = PL_warnhook;
1489 ENTER;
1490 SAVESPTR(PL_warnhook);
1491 PL_warnhook = Nullsv;
1492 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1493 LEAVE;
1494 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1495 dSP;
1496 SV *msg;
1497
1498 ENTER;
1499 msg = newSVpvn(message, msglen);
1500 SvREADONLY_on(msg);
1501 SAVEFREESV(msg);
1502
1503 PUSHMARK(sp);
1504 XPUSHs(msg);
1505 PUTBACK;
1506 perl_call_sv((SV*)cv, G_DISCARD);
1507
1508 LEAVE;
1509 return;
1510 }
1511 }
1512 PerlIO_write(PerlIO_stderr(), message, msglen);
1513#ifdef LEAKTEST
1514 DEBUG_L(xstat());
1515#endif
1516 (void)PerlIO_flush(PerlIO_stderr());
1517 }
1518}
1519
1520#ifndef VMS /* VMS' my_setenv() is in VMS.c */
1521#ifndef WIN32
1522void
1523my_setenv(char *nam, char *val)
1524{
1525#ifndef PERL_USE_SAFE_PUTENV
1526 /* most putenv()s leak, so we manipulate environ directly */
1527 register I32 i=setenv_getix(nam); /* where does it go? */
1528
1529 if (environ == PL_origenviron) { /* need we copy environment? */
1530 I32 j;
1531 I32 max;
1532 char **tmpenv;
1533
1534 /*SUPPRESS 530*/
1535 for (max = i; environ[max]; max++) ;
1536 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1537 for (j=0; j<max; j++) { /* copy environment */
1538 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1539 strcpy(tmpenv[j], environ[j]);
1540 }
1541 tmpenv[max] = Nullch;
1542 environ = tmpenv; /* tell exec where it is now */
1543 }
1544 if (!val) {
1545 safesysfree(environ[i]);
1546 while (environ[i]) {
1547 environ[i] = environ[i+1];
1548 i++;
1549 }
1550 return;
1551 }
1552 if (!environ[i]) { /* does not exist yet */
1553 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1554 environ[i+1] = Nullch; /* make sure it's null terminated */
1555 }
1556 else
1557 safesysfree(environ[i]);
1558 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1559
1560#ifndef MSDOS
1561 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1562#else
1563 /* MS-DOS requires environment variable names to be in uppercase */
1564 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1565 * some utilities and applications may break because they only look
1566 * for upper case strings. (Fixed strupr() bug here.)]
1567 */
1568 strcpy(environ[i],nam); strupr(environ[i]);
1569 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1570#endif /* MSDOS */
1571
1572#else /* PERL_USE_SAFE_PUTENV */
1573 char *new_env;
1574
1575 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
1576#ifndef MSDOS
1577 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
1578#else
1579 strcpy(new_env,nam); strupr(new_env);
1580 (void)sprintf(new_env + strlen(nam),"=%s",val);
1581#endif
1582 (void)putenv(new_env);
1583#endif /* PERL_USE_SAFE_PUTENV */
1584}
1585
1586#else /* if WIN32 */
1587
1588void
1589my_setenv(char *nam,char *val)
1590{
1591
1592#ifdef USE_WIN32_RTL_ENV
1593
1594 register char *envstr;
1595 STRLEN namlen = strlen(nam);
1596 STRLEN vallen;
1597 char *oldstr = environ[setenv_getix(nam)];
1598
1599 /* putenv() has totally broken semantics in both the Borland
1600 * and Microsoft CRTLs. They either store the passed pointer in
1601 * the environment without making a copy, or make a copy and don't
1602 * free it. And on top of that, they dont free() old entries that
1603 * are being replaced/deleted. This means the caller must
1604 * free any old entries somehow, or we end up with a memory
1605 * leak every time my_setenv() is called. One might think
1606 * one could directly manipulate environ[], like the UNIX code
1607 * above, but direct changes to environ are not allowed when
1608 * calling putenv(), since the RTLs maintain an internal
1609 * *copy* of environ[]. Bad, bad, *bad* stink.
1610 * GSAR 97-06-07
1611 */
1612
1613 if (!val) {
1614 if (!oldstr)
1615 return;
1616 val = "";
1617 vallen = 0;
1618 }
1619 else
1620 vallen = strlen(val);
1621 envstr = (char*)safesysmalloc((namlen + vallen + 3) * sizeof(char));
1622 (void)sprintf(envstr,"%s=%s",nam,val);
1623 (void)PerlEnv_putenv(envstr);
1624 if (oldstr)
1625 safesysfree(oldstr);
1626#ifdef _MSC_VER
1627 safesysfree(envstr); /* MSVCRT leaks without this */
1628#endif
1629
1630#else /* !USE_WIN32_RTL_ENV */
1631
1632 register char *envstr;
1633 STRLEN len = strlen(nam) + 3;
1634 if (!val) {
1635 val = "";
1636 }
1637 len += strlen(val);
1638 New(904, envstr, len, char);
1639 (void)sprintf(envstr,"%s=%s",nam,val);
1640 (void)PerlEnv_putenv(envstr);
1641 Safefree(envstr);
1642
1643#endif
1644}
1645
1646#endif /* WIN32 */
1647
1648I32
1649setenv_getix(char *nam)
1650{
1651 register I32 i, len = strlen(nam);
1652
1653 for (i = 0; environ[i]; i++) {
1654 if (
1655#ifdef WIN32
1656 strnicmp(environ[i],nam,len) == 0
1657#else
1658 strnEQ(environ[i],nam,len)
1659#endif
1660 && environ[i][len] == '=')
1661 break; /* strnEQ must come first to avoid */
1662 } /* potential SEGV's */
1663 return i;
1664}
1665
1666#endif /* !VMS */
1667
1668#ifdef UNLINK_ALL_VERSIONS
1669I32
1670unlnk(f) /* unlink all versions of a file */
1671char *f;
1672{
1673 I32 i;
1674
1675 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
1676 return i ? 0 : -1;
1677}
1678#endif
1679
1680#if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1681char *
1682my_bcopy(register const char *from,register char *to,register I32 len)
1683{
1684 char *retval = to;
1685
1686 if (from - to >= 0) {
1687 while (len--)
1688 *to++ = *from++;
1689 }
1690 else {
1691 to += len;
1692 from += len;
1693 while (len--)
1694 *(--to) = *(--from);
1695 }
1696 return retval;
1697}
1698#endif
1699
1700#ifndef HAS_MEMSET
1701void *
1702my_memset(register char *loc, register I32 ch, register I32 len)
1703{
1704 char *retval = loc;
1705
1706 while (len--)
1707 *loc++ = ch;
1708 return retval;
1709}
1710#endif
1711
1712#if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1713char *
1714my_bzero(register char *loc, register I32 len)
1715{
1716 char *retval = loc;
1717
1718 while (len--)
1719 *loc++ = 0;
1720 return retval;
1721}
1722#endif
1723
1724#if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
1725I32
1726my_memcmp(const char *s1, const char *s2, register I32 len)
1727{
1728 register U8 *a = (U8 *)s1;
1729 register U8 *b = (U8 *)s2;
1730 register I32 tmp;
1731
1732 while (len--) {
1733 if (tmp = *a++ - *b++)
1734 return tmp;
1735 }
1736 return 0;
1737}
1738#endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
1739
1740#ifndef HAS_VPRINTF
1741
1742#ifdef USE_CHAR_VSPRINTF
1743char *
1744#else
1745int
1746#endif
1747vsprintf(char *dest, const char *pat, char *args)
1748{
1749 FILE fakebuf;
1750
1751 fakebuf._ptr = dest;
1752 fakebuf._cnt = 32767;
1753#ifndef _IOSTRG
1754#define _IOSTRG 0
1755#endif
1756 fakebuf._flag = _IOWRT|_IOSTRG;
1757 _doprnt(pat, args, &fakebuf); /* what a kludge */
1758 (void)putc('\0', &fakebuf);
1759#ifdef USE_CHAR_VSPRINTF
1760 return(dest);
1761#else
1762 return 0; /* perl doesn't use return value */
1763#endif
1764}
1765
1766#endif /* HAS_VPRINTF */
1767
1768#ifdef MYSWAP
1769#if BYTEORDER != 0x4321
1770short
1771my_swap(short s)
1772{
1773#if (BYTEORDER & 1) == 0
1774 short result;
1775
1776 result = ((s & 255) << 8) + ((s >> 8) & 255);
1777 return result;
1778#else
1779 return s;
1780#endif
1781}
1782
1783long
1784my_htonl(long l)
1785{
1786 union {
1787 long result;
1788 char c[sizeof(long)];
1789 } u;
1790
1791#if BYTEORDER == 0x1234
1792 u.c[0] = (l >> 24) & 255;
1793 u.c[1] = (l >> 16) & 255;
1794 u.c[2] = (l >> 8) & 255;
1795 u.c[3] = l & 255;
1796 return u.result;
1797#else
1798#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1799 croak("Unknown BYTEORDER\n");
1800#else
1801 register I32 o;
1802 register I32 s;
1803
1804 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1805 u.c[o & 0xf] = (l >> s) & 255;
1806 }
1807 return u.result;
1808#endif
1809#endif
1810}
1811
1812long
1813my_ntohl(long l)
1814{
1815 union {
1816 long l;
1817 char c[sizeof(long)];
1818 } u;
1819
1820#if BYTEORDER == 0x1234
1821 u.c[0] = (l >> 24) & 255;
1822 u.c[1] = (l >> 16) & 255;
1823 u.c[2] = (l >> 8) & 255;
1824 u.c[3] = l & 255;
1825 return u.l;
1826#else
1827#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1828 croak("Unknown BYTEORDER\n");
1829#else
1830 register I32 o;
1831 register I32 s;
1832
1833 u.l = l;
1834 l = 0;
1835 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1836 l |= (u.c[o & 0xf] & 255) << s;
1837 }
1838 return l;
1839#endif
1840#endif
1841}
1842
1843#endif /* BYTEORDER != 0x4321 */
1844#endif /* MYSWAP */
1845
1846/*
1847 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1848 * If these functions are defined,
1849 * the BYTEORDER is neither 0x1234 nor 0x4321.
1850 * However, this is not assumed.
1851 * -DWS
1852 */
1853
1854#define HTOV(name,type) \
1855 type \
1856 name (n) \
1857 register type n; \
1858 { \
1859 union { \
1860 type value; \
1861 char c[sizeof(type)]; \
1862 } u; \
1863 register I32 i; \
1864 register I32 s; \
1865 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1866 u.c[i] = (n >> s) & 0xFF; \
1867 } \
1868 return u.value; \
1869 }
1870
1871#define VTOH(name,type) \
1872 type \
1873 name (n) \
1874 register type n; \
1875 { \
1876 union { \
1877 type value; \
1878 char c[sizeof(type)]; \
1879 } u; \
1880 register I32 i; \
1881 register I32 s; \
1882 u.value = n; \
1883 n = 0; \
1884 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1885 n += (u.c[i] & 0xFF) << s; \
1886 } \
1887 return n; \
1888 }
1889
1890#if defined(HAS_HTOVS) && !defined(htovs)
1891HTOV(htovs,short)
1892#endif
1893#if defined(HAS_HTOVL) && !defined(htovl)
1894HTOV(htovl,long)
1895#endif
1896#if defined(HAS_VTOHS) && !defined(vtohs)
1897VTOH(vtohs,short)
1898#endif
1899#if defined(HAS_VTOHL) && !defined(vtohl)
1900VTOH(vtohl,long)
1901#endif
1902
1903 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1904#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM)
1905PerlIO *
1906my_popen(char *cmd, char *mode)
1907{
1908 int p[2];
1909 register I32 This, that;
1910 register I32 pid;
1911 SV *sv;
1912 I32 doexec = strNE(cmd,"-");
1913 I32 did_pipes = 0;
1914 int pp[2];
1915
1916 PERL_FLUSHALL_FOR_CHILD;
1917#ifdef OS2
1918 if (doexec) {
1919 return my_syspopen(cmd,mode);
1920 }
1921#endif
1922 This = (*mode == 'w');
1923 that = !This;
1924 if (doexec && PL_tainting) {
1925 taint_env();
1926 taint_proper("Insecure %s%s", "EXEC");
1927 }
1928 if (PerlProc_pipe(p) < 0)
1929 return Nullfp;
1930 if (doexec && PerlProc_pipe(pp) >= 0)
1931 did_pipes = 1;
1932 while ((pid = (doexec?vfork():fork())) < 0) {
1933 if (errno != EAGAIN) {
1934 PerlLIO_close(p[This]);
1935 if (did_pipes) {
1936 PerlLIO_close(pp[0]);
1937 PerlLIO_close(pp[1]);
1938 }
1939 if (!doexec)
1940 croak("Can't fork");
1941 return Nullfp;
1942 }
1943 sleep(5);
1944 }
1945 if (pid == 0) {
1946 GV* tmpgv;
1947
1948#undef THIS
1949#undef THAT
1950#define THIS that
1951#define THAT This
1952 PerlLIO_close(p[THAT]);
1953 if (did_pipes) {
1954 PerlLIO_close(pp[0]);
1955#if defined(HAS_FCNTL) && defined(F_SETFD)
1956 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1957#endif
1958 }
1959 if (p[THIS] != (*mode == 'r')) {
1960 PerlLIO_dup2(p[THIS], *mode == 'r');
1961 PerlLIO_close(p[THIS]);
1962 }
1963 if (doexec) {
1964#if !defined(HAS_FCNTL) || !defined(F_SETFD)
1965 int fd;
1966
1967#ifndef NOFILE
1968#define NOFILE 20
1969#endif
1970 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
1971 if (fd != pp[1])
1972 PerlLIO_close(fd);
1973#endif
1974 do_exec3(cmd,pp[1],did_pipes); /* may or may not use the shell */
1975 PerlProc__exit(1);
1976 }
1977 /*SUPPRESS 560*/
1978 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1979 sv_setiv(GvSV(tmpgv), (IV)getpid());
1980 PL_forkprocess = 0;
1981 hv_clear(PL_pidstatus); /* we have no children */
1982 return Nullfp;
1983#undef THIS
1984#undef THAT
1985 }
1986 do_execfree(); /* free any memory malloced by child on vfork */
1987 PerlLIO_close(p[that]);
1988 if (did_pipes)
1989 PerlLIO_close(pp[1]);
1990 if (p[that] < p[This]) {
1991 PerlLIO_dup2(p[This], p[that]);
1992 PerlLIO_close(p[This]);
1993 p[This] = p[that];
1994 }
1995 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1996 (void)SvUPGRADE(sv,SVt_IV);
1997 SvIVX(sv) = pid;
1998 PL_forkprocess = pid;
1999 if (did_pipes && pid > 0) {
2000 int errkid;
2001 int n = 0, n1;
2002
2003 while (n < sizeof(int)) {
2004 n1 = PerlLIO_read(pp[0],
2005 (void*)(((char*)&errkid)+n),
2006 (sizeof(int)) - n);
2007 if (n1 <= 0)
2008 break;
2009 n += n1;
2010 }
2011 if (n) { /* Error */
2012 if (n != sizeof(int))
2013 croak("panic: kid popen errno read");
2014 PerlLIO_close(pp[0]);
2015 errno = errkid; /* Propagate errno from kid */
2016 return Nullfp;
2017 }
2018 }
2019 if (did_pipes)
2020 PerlLIO_close(pp[0]);
2021 return PerlIO_fdopen(p[This], mode);
2022}
2023#else
2024#if defined(atarist) || defined(DJGPP)
2025FILE *popen();
2026PerlIO *
2027my_popen(char *cmd, char *mode)
2028{
2029 /* Needs work for PerlIO ! */
2030 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
2031 PERL_FLUSHALL_FOR_CHILD;
2032 return popen(PerlIO_exportFILE(cmd, 0), mode);
2033}
2034#endif
2035
2036#endif /* !DOSISH */
2037
2038#ifdef DUMP_FDS
2039void
2040dump_fds(char *s)
2041{
2042 int fd;
2043 struct stat tmpstatbuf;
2044
2045 PerlIO_printf(PerlIO_stderr(),"%s", s);
2046 for (fd = 0; fd < 32; fd++) {
2047 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
2048 PerlIO_printf(PerlIO_stderr()," %d",fd);
2049 }
2050 PerlIO_printf(PerlIO_stderr(),"\n");
2051}
2052#endif /* DUMP_FDS */
2053
2054#ifndef HAS_DUP2
2055int
2056dup2(oldfd,newfd)
2057int oldfd;
2058int newfd;
2059{
2060#if defined(HAS_FCNTL) && defined(F_DUPFD)
2061 if (oldfd == newfd)
2062 return oldfd;
2063 PerlLIO_close(newfd);
2064 return fcntl(oldfd, F_DUPFD, newfd);
2065#else
2066#define DUP2_MAX_FDS 256
2067 int fdtmp[DUP2_MAX_FDS];
2068 I32 fdx = 0;
2069 int fd;
2070
2071 if (oldfd == newfd)
2072 return oldfd;
2073 PerlLIO_close(newfd);
2074 /* good enough for low fd's... */
2075 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
2076 if (fdx >= DUP2_MAX_FDS) {
2077 PerlLIO_close(fd);
2078 fd = -1;
2079 break;
2080 }
2081 fdtmp[fdx++] = fd;
2082 }
2083 while (fdx > 0)
2084 PerlLIO_close(fdtmp[--fdx]);
2085 return fd;
2086#endif
2087}
2088#endif
2089
2090
2091#ifdef HAS_SIGACTION
2092
2093Sighandler_t
2094rsignal(int signo, Sighandler_t handler)
2095{
2096 struct sigaction act, oact;
2097
2098 act.sa_handler = handler;
2099 sigemptyset(&act.sa_mask);
2100 act.sa_flags = 0;
2101#ifdef SA_RESTART
2102 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2103#endif
2104#ifdef SA_NOCLDWAIT
2105 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2106 act.sa_flags |= SA_NOCLDWAIT;
2107#endif
2108 if (sigaction(signo, &act, &oact) == -1)
2109 return SIG_ERR;
2110 else
2111 return oact.sa_handler;
2112}
2113
2114Sighandler_t
2115rsignal_state(int signo)
2116{
2117 struct sigaction oact;
2118
2119 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2120 return SIG_ERR;
2121 else
2122 return oact.sa_handler;
2123}
2124
2125int
2126rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2127{
2128 struct sigaction act;
2129
2130 act.sa_handler = handler;
2131 sigemptyset(&act.sa_mask);
2132 act.sa_flags = 0;
2133#ifdef SA_RESTART
2134 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2135#endif
2136#ifdef SA_NOCLDWAIT
2137 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2138 act.sa_flags |= SA_NOCLDWAIT;
2139#endif
2140 return sigaction(signo, &act, save);
2141}
2142
2143int
2144rsignal_restore(int signo, Sigsave_t *save)
2145{
2146 return sigaction(signo, save, (struct sigaction *)NULL);
2147}
2148
2149#else /* !HAS_SIGACTION */
2150
2151Sighandler_t
2152rsignal(int signo, Sighandler_t handler)
2153{
2154 return PerlProc_signal(signo, handler);
2155}
2156
2157static int sig_trapped;
2158
2159static
2160Signal_t
2161sig_trap(int signo)
2162{
2163 sig_trapped++;
2164}
2165
2166Sighandler_t
2167rsignal_state(int signo)
2168{
2169 Sighandler_t oldsig;
2170
2171 sig_trapped = 0;
2172 oldsig = PerlProc_signal(signo, sig_trap);
2173 PerlProc_signal(signo, oldsig);
2174 if (sig_trapped)
2175 PerlProc_kill(getpid(), signo);
2176 return oldsig;
2177}
2178
2179int
2180rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
2181{
2182 *save = PerlProc_signal(signo, handler);
2183 return (*save == SIG_ERR) ? -1 : 0;
2184}
2185
2186int
2187rsignal_restore(int signo, Sigsave_t *save)
2188{
2189 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
2190}
2191
2192#endif /* !HAS_SIGACTION */
2193
2194 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2195#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM)
2196I32
2197my_pclose(PerlIO *ptr)
2198{
2199 Sigsave_t hstat, istat, qstat;
2200 int status;
2201 SV **svp;
2202 int pid;
2203 int pid2;
2204 bool close_failed;
2205 int saved_errno;
2206#ifdef VMS
2207 int saved_vaxc_errno;
2208#endif
2209#ifdef WIN32
2210 int saved_win32_errno;
2211#endif
2212
2213 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
2214 pid = (int)SvIVX(*svp);
2215 SvREFCNT_dec(*svp);
2216 *svp = &PL_sv_undef;
2217#ifdef OS2
2218 if (pid == -1) { /* Opened by popen. */
2219 return my_syspclose(ptr);
2220 }
2221#endif
2222 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2223 saved_errno = errno;
2224#ifdef VMS
2225 saved_vaxc_errno = vaxc$errno;
2226#endif
2227#ifdef WIN32
2228 saved_win32_errno = GetLastError();
2229#endif
2230 }
2231#ifdef UTS
2232 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
2233#endif
2234 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2235 rsignal_save(SIGINT, SIG_IGN, &istat);
2236 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
2237 do {
2238 pid2 = wait4pid(pid, &status, 0);
2239 } while (pid2 == -1 && errno == EINTR);
2240 rsignal_restore(SIGHUP, &hstat);
2241 rsignal_restore(SIGINT, &istat);
2242 rsignal_restore(SIGQUIT, &qstat);
2243 if (close_failed) {
2244 SETERRNO(saved_errno, saved_vaxc_errno);
2245 return -1;
2246 }
2247 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
2248}
2249#endif /* !DOSISH */
2250
2251#if !defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(CYGWIN32)
2252I32
2253wait4pid(int pid, int *statusp, int flags)
2254{
2255 SV *sv;
2256 SV** svp;
2257 char spid[TYPE_CHARS(int)];
2258
2259 if (!pid)
2260 return -1;
2261 if (pid > 0) {
2262 sprintf(spid, "%d", pid);
2263 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2264 if (svp && *svp != &PL_sv_undef) {
2265 *statusp = SvIVX(*svp);
2266 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2267 return pid;
2268 }
2269 }
2270 else {
2271 HE *entry;
2272
2273 hv_iterinit(PL_pidstatus);
2274 if (entry = hv_iternext(PL_pidstatus)) {
2275 pid = atoi(hv_iterkey(entry,(I32*)statusp));
2276 sv = hv_iterval(PL_pidstatus,entry);
2277 *statusp = SvIVX(sv);
2278 sprintf(spid, "%d", pid);
2279 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2280 return pid;
2281 }
2282 }
2283#ifdef HAS_WAITPID
2284# ifdef HAS_WAITPID_RUNTIME
2285 if (!HAS_WAITPID_RUNTIME)
2286 goto hard_way;
2287# endif
2288 return PerlProc_waitpid(pid,statusp,flags);
2289#endif
2290#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
2291 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
2292#endif
2293#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2294 hard_way:
2295 {
2296 I32 result;
2297 if (flags)
2298 croak("Can't do waitpid with flags");
2299 else {
2300 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
2301 pidgone(result,*statusp);
2302 if (result < 0)
2303 *statusp = -1;
2304 }
2305 return result;
2306 }
2307#endif
2308}
2309#endif /* !DOSISH || OS2 || WIN32 */
2310
2311void
2312/*SUPPRESS 590*/
2313pidgone(int pid, int status)
2314{
2315 register SV *sv;
2316 char spid[TYPE_CHARS(int)];
2317
2318 sprintf(spid, "%d", pid);
2319 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
2320 (void)SvUPGRADE(sv,SVt_IV);
2321 SvIVX(sv) = status;
2322 return;
2323}
2324
2325#if defined(atarist) || defined(OS2) || defined(DJGPP)
2326int pclose();
2327#ifdef HAS_FORK
2328int /* Cannot prototype with I32
2329 in os2ish.h. */
2330my_syspclose(ptr)
2331#else
2332I32
2333my_pclose(ptr)
2334#endif
2335PerlIO *ptr;
2336{
2337 /* Needs work for PerlIO ! */
2338 FILE *f = PerlIO_findFILE(ptr);
2339 I32 result = pclose(f);
2340 PerlIO_releaseFILE(ptr,f);
2341 return result;
2342}
2343#endif
2344
2345void
2346repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
2347{
2348 register I32 todo;
2349 register const char *frombase = from;
2350
2351 if (len == 1) {
2352 register const char c = *from;
2353 while (count-- > 0)
2354 *to++ = c;
2355 return;
2356 }
2357 while (count-- > 0) {
2358 for (todo = len; todo > 0; todo--) {
2359 *to++ = *from++;
2360 }
2361 from = frombase;
2362 }
2363}
2364
2365U32
2366cast_ulong(double f)
2367{
2368 long along;
2369
2370#if CASTFLAGS & 2
2371# define BIGDOUBLE 2147483648.0
2372 if (f >= BIGDOUBLE)
2373 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2374#endif
2375 if (f >= 0.0)
2376 return (unsigned long)f;
2377 along = (long)f;
2378 return (unsigned long)along;
2379}
2380# undef BIGDOUBLE
2381
2382/* Unfortunately, on some systems the cast_uv() function doesn't
2383 work with the system-supplied definition of ULONG_MAX. The
2384 comparison (f >= ULONG_MAX) always comes out true. It must be a
2385 problem with the compiler constant folding.
2386
2387 In any case, this workaround should be fine on any two's complement
2388 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2389 ccflags.
2390 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2391*/
2392
2393/* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2394 of LONG_(MIN/MAX).
2395 -- Kenneth Albanowski <kjahds@kjahds.com>
2396*/
2397
2398#ifndef MY_UV_MAX
2399# define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
2400#endif
2401
2402I32
2403cast_i32(double f)
2404{
2405 if (f >= I32_MAX)
2406 return (I32) I32_MAX;
2407 if (f <= I32_MIN)
2408 return (I32) I32_MIN;
2409 return (I32) f;
2410}
2411
2412IV
2413cast_iv(double f)
2414{
2415 if (f >= IV_MAX) {
2416 UV uv;
2417
2418 if (f >= (double)UV_MAX)
2419 return (IV) UV_MAX;
2420 uv = (UV) f;
2421 return (IV)uv;
2422 }
2423 if (f <= IV_MIN)
2424 return (IV) IV_MIN;
2425 return (IV) f;
2426}
2427
2428UV
2429cast_uv(double f)
2430{
2431 if (f >= MY_UV_MAX)
2432 return (UV) MY_UV_MAX;
2433 if (f < 0) {
2434 IV iv;
2435
2436 if (f < IV_MIN)
2437 return (UV)IV_MIN;
2438 iv = (IV) f;
2439 return (UV) iv;
2440 }
2441 return (UV) f;
2442}
2443
2444#ifndef HAS_RENAME
2445I32
2446same_dirent(char *a, char *b)
2447{
2448 char *fa = strrchr(a,'/');
2449 char *fb = strrchr(b,'/');
2450 struct stat tmpstatbuf1;
2451 struct stat tmpstatbuf2;
2452 SV *tmpsv = sv_newmortal();
2453
2454 if (fa)
2455 fa++;
2456 else
2457 fa = a;
2458 if (fb)
2459 fb++;
2460 else
2461 fb = b;
2462 if (strNE(a,b))
2463 return FALSE;
2464 if (fa == a)
2465 sv_setpv(tmpsv, ".");
2466 else
2467 sv_setpvn(tmpsv, a, fa - a);
2468 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
2469 return FALSE;
2470 if (fb == b)
2471 sv_setpv(tmpsv, ".");
2472 else
2473 sv_setpvn(tmpsv, b, fb - b);
2474 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
2475 return FALSE;
2476 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2477 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2478}
2479#endif /* !HAS_RENAME */
2480
2481UV
2482scan_bin(char *start, I32 len, I32 *retlen)
2483{
2484 register char *s = start;
2485 register UV retval = 0;
2486 bool overflowed = FALSE;
2487 while (len && *s >= '0' && *s <= '1') {
2488 register UV n = retval << 1;
2489 if (!overflowed && (n >> 1) != retval) {
2490 warn("Integer overflow in binary number");
2491 overflowed = TRUE;
2492 }
2493 retval = n | (*s++ - '0');
2494 len--;
2495 }
2496 if (len && (*s >= '2' && *s <= '9')) {
2497 dTHR;
2498 if (ckWARN(WARN_UNSAFE))
2499 warner(WARN_UNSAFE, "Illegal binary digit '%c' ignored", *s);
2500 }
2501 *retlen = s - start;
2502 return retval;
2503}
2504UV
2505scan_oct(char *start, I32 len, I32 *retlen)
2506{
2507 register char *s = start;
2508 register UV retval = 0;
2509 bool overflowed = FALSE;
2510
2511 while (len && *s >= '0' && *s <= '7') {
2512 register UV n = retval << 3;
2513 if (!overflowed && (n >> 3) != retval) {
2514 warn("Integer overflow in octal number");
2515 overflowed = TRUE;
2516 }
2517 retval = n | (*s++ - '0');
2518 len--;
2519 }
2520 if (len && (*s == '8' || *s == '9')) {
2521 dTHR;
2522 if (ckWARN(WARN_OCTAL))
2523 warner(WARN_OCTAL, "Illegal octal digit '%c' ignored", *s);
2524 }
2525 *retlen = s - start;
2526 return retval;
2527}
2528
2529UV
2530scan_hex(char *start, I32 len, I32 *retlen)
2531{
2532 register char *s = start;
2533 register UV retval = 0;
2534 bool overflowed = FALSE;
2535 char *tmp = s;
2536 register UV n;
2537
2538 while (len-- && *s) {
2539 tmp = strchr((char *) PL_hexdigit, *s++);
2540 if (!tmp) {
2541 if (*(s-1) == '_' || (*(s-1) == 'x' && retval == 0))
2542 continue;
2543 else {
2544 dTHR;
2545 --s;
2546 if (ckWARN(WARN_UNSAFE))
2547 warner(WARN_UNSAFE,"Illegal hex digit '%c' ignored", *s);
2548 break;
2549 }
2550 }
2551 n = retval << 4;
2552 if (!overflowed && (n >> 4) != retval) {
2553 warn("Integer overflow in hex number");
2554 overflowed = TRUE;
2555 }
2556 retval = n | ((tmp - PL_hexdigit) & 15);
2557 }
2558 *retlen = s - start;
2559 return retval;
2560}
2561
2562char*
2563find_script(char *scriptname, bool dosearch, char **search_ext, I32 flags)
2564{
2565 dTHR;
2566 char *xfound = Nullch;
2567 char *xfailed = Nullch;
2568 char tmpbuf[MAXPATHLEN];
2569 register char *s;
2570 I32 len;
2571 int retval;
2572#if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2573# define SEARCH_EXTS ".bat", ".cmd", NULL
2574# define MAX_EXT_LEN 4
2575#endif
2576#ifdef OS2
2577# define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2578# define MAX_EXT_LEN 4
2579#endif
2580#ifdef VMS
2581# define SEARCH_EXTS ".pl", ".com", NULL
2582# define MAX_EXT_LEN 4
2583#endif
2584 /* additional extensions to try in each dir if scriptname not found */
2585#ifdef SEARCH_EXTS
2586 char *exts[] = { SEARCH_EXTS };
2587 char **ext = search_ext ? search_ext : exts;
2588 int extidx = 0, i = 0;
2589 char *curext = Nullch;
2590#else
2591# define MAX_EXT_LEN 0
2592#endif
2593
2594 /*
2595 * If dosearch is true and if scriptname does not contain path
2596 * delimiters, search the PATH for scriptname.
2597 *
2598 * If SEARCH_EXTS is also defined, will look for each
2599 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2600 * while searching the PATH.
2601 *
2602 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2603 * proceeds as follows:
2604 * If DOSISH or VMSISH:
2605 * + look for ./scriptname{,.foo,.bar}
2606 * + search the PATH for scriptname{,.foo,.bar}
2607 *
2608 * If !DOSISH:
2609 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2610 * this will not look in '.' if it's not in the PATH)
2611 */
2612 tmpbuf[0] = '\0';
2613
2614#ifdef VMS
2615# ifdef ALWAYS_DEFTYPES
2616 len = strlen(scriptname);
2617 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2618 int hasdir, idx = 0, deftypes = 1;
2619 bool seen_dot = 1;
2620
2621 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2622# else
2623 if (dosearch) {
2624 int hasdir, idx = 0, deftypes = 1;
2625 bool seen_dot = 1;
2626
2627 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2628# endif
2629 /* The first time through, just add SEARCH_EXTS to whatever we
2630 * already have, so we can check for default file types. */
2631 while (deftypes ||
2632 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
2633 {
2634 if (deftypes) {
2635 deftypes = 0;
2636 *tmpbuf = '\0';
2637 }
2638 if ((strlen(tmpbuf) + strlen(scriptname)
2639 + MAX_EXT_LEN) >= sizeof tmpbuf)
2640 continue; /* don't search dir with too-long name */
2641 strcat(tmpbuf, scriptname);
2642#else /* !VMS */
2643
2644#ifdef DOSISH
2645 if (strEQ(scriptname, "-"))
2646 dosearch = 0;
2647 if (dosearch) { /* Look in '.' first. */
2648 char *cur = scriptname;
2649#ifdef SEARCH_EXTS
2650 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2651 while (ext[i])
2652 if (strEQ(ext[i++],curext)) {
2653 extidx = -1; /* already has an ext */
2654 break;
2655 }
2656 do {
2657#endif
2658 DEBUG_p(PerlIO_printf(Perl_debug_log,
2659 "Looking for %s\n",cur));
2660 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2661 && !S_ISDIR(PL_statbuf.st_mode)) {
2662 dosearch = 0;
2663 scriptname = cur;
2664#ifdef SEARCH_EXTS
2665 break;
2666#endif
2667 }
2668#ifdef SEARCH_EXTS
2669 if (cur == scriptname) {
2670 len = strlen(scriptname);
2671 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
2672 break;
2673 cur = strcpy(tmpbuf, scriptname);
2674 }
2675 } while (extidx >= 0 && ext[extidx] /* try an extension? */
2676 && strcpy(tmpbuf+len, ext[extidx++]));
2677#endif
2678 }
2679#endif
2680
2681 if (dosearch && !strchr(scriptname, '/')
2682#ifdef DOSISH
2683 && !strchr(scriptname, '\\')
2684#endif
2685 && (s = PerlEnv_getenv("PATH"))) {
2686 bool seen_dot = 0;
2687
2688 PL_bufend = s + strlen(s);
2689 while (s < PL_bufend) {
2690#if defined(atarist) || defined(DOSISH)
2691 for (len = 0; *s
2692# ifdef atarist
2693 && *s != ','
2694# endif
2695 && *s != ';'; len++, s++) {
2696 if (len < sizeof tmpbuf)
2697 tmpbuf[len] = *s;
2698 }
2699 if (len < sizeof tmpbuf)
2700 tmpbuf[len] = '\0';
2701#else /* ! (atarist || DOSISH) */
2702 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2703 ':',
2704 &len);
2705#endif /* ! (atarist || DOSISH) */
2706 if (s < PL_bufend)
2707 s++;
2708 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
2709 continue; /* don't search dir with too-long name */
2710 if (len
2711#if defined(atarist) || defined(__MINT__) || defined(DOSISH)
2712 && tmpbuf[len - 1] != '/'
2713 && tmpbuf[len - 1] != '\\'
2714#endif
2715 )
2716 tmpbuf[len++] = '/';
2717 if (len == 2 && tmpbuf[0] == '.')
2718 seen_dot = 1;
2719 (void)strcpy(tmpbuf + len, scriptname);
2720#endif /* !VMS */
2721
2722#ifdef SEARCH_EXTS
2723 len = strlen(tmpbuf);
2724 if (extidx > 0) /* reset after previous loop */
2725 extidx = 0;
2726 do {
2727#endif
2728 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
2729 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
2730 if (S_ISDIR(PL_statbuf.st_mode)) {
2731 retval = -1;
2732 }
2733#ifdef SEARCH_EXTS
2734 } while ( retval < 0 /* not there */
2735 && extidx>=0 && ext[extidx] /* try an extension? */
2736 && strcpy(tmpbuf+len, ext[extidx++])
2737 );
2738#endif
2739 if (retval < 0)
2740 continue;
2741 if (S_ISREG(PL_statbuf.st_mode)
2742 && cando(S_IRUSR,TRUE,&PL_statbuf)
2743#ifndef DOSISH
2744 && cando(S_IXUSR,TRUE,&PL_statbuf)
2745#endif
2746 )
2747 {
2748 xfound = tmpbuf; /* bingo! */
2749 break;
2750 }
2751 if (!xfailed)
2752 xfailed = savepv(tmpbuf);
2753 }
2754#ifndef DOSISH
2755 if (!xfound && !seen_dot && !xfailed &&
2756 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
2757 || S_ISDIR(PL_statbuf.st_mode)))
2758#endif
2759 seen_dot = 1; /* Disable message. */
2760 if (!xfound) {
2761 if (flags & 1) { /* do or die? */
2762 croak("Can't %s %s%s%s",
2763 (xfailed ? "execute" : "find"),
2764 (xfailed ? xfailed : scriptname),
2765 (xfailed ? "" : " on PATH"),
2766 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2767 }
2768 scriptname = Nullch;
2769 }
2770 if (xfailed)
2771 Safefree(xfailed);
2772 scriptname = xfound;
2773 }
2774 return (scriptname ? savepv(scriptname) : Nullch);
2775}
2776
2777
2778#ifdef USE_THREADS
2779#ifdef FAKE_THREADS
2780/* Very simplistic scheduler for now */
2781void
2782schedule(void)
2783{
2784 thr = thr->i.next_run;
2785}
2786
2787void
2788perl_cond_init(perl_cond *cp)
2789{
2790 *cp = 0;
2791}
2792
2793void
2794perl_cond_signal(perl_cond *cp)
2795{
2796 perl_os_thread t;
2797 perl_cond cond = *cp;
2798
2799 if (!cond)
2800 return;
2801 t = cond->thread;
2802 /* Insert t in the runnable queue just ahead of us */
2803 t->i.next_run = thr->i.next_run;
2804 thr->i.next_run->i.prev_run = t;
2805 t->i.prev_run = thr;
2806 thr->i.next_run = t;
2807 thr->i.wait_queue = 0;
2808 /* Remove from the wait queue */
2809 *cp = cond->next;
2810 Safefree(cond);
2811}
2812
2813void
2814perl_cond_broadcast(perl_cond *cp)
2815{
2816 perl_os_thread t;
2817 perl_cond cond, cond_next;
2818
2819 for (cond = *cp; cond; cond = cond_next) {
2820 t = cond->thread;
2821 /* Insert t in the runnable queue just ahead of us */
2822 t->i.next_run = thr->i.next_run;
2823 thr->i.next_run->i.prev_run = t;
2824 t->i.prev_run = thr;
2825 thr->i.next_run = t;
2826 thr->i.wait_queue = 0;
2827 /* Remove from the wait queue */
2828 cond_next = cond->next;
2829 Safefree(cond);
2830 }
2831 *cp = 0;
2832}
2833
2834void
2835perl_cond_wait(perl_cond *cp)
2836{
2837 perl_cond cond;
2838
2839 if (thr->i.next_run == thr)
2840 croak("panic: perl_cond_wait called by last runnable thread");
2841
2842 New(666, cond, 1, struct perl_wait_queue);
2843 cond->thread = thr;
2844 cond->next = *cp;
2845 *cp = cond;
2846 thr->i.wait_queue = cond;
2847 /* Remove ourselves from runnable queue */
2848 thr->i.next_run->i.prev_run = thr->i.prev_run;
2849 thr->i.prev_run->i.next_run = thr->i.next_run;
2850}
2851#endif /* FAKE_THREADS */
2852
2853#ifdef PTHREAD_GETSPECIFIC_INT
2854struct perl_thread *
2855getTHR _((void))
2856{
2857 pthread_addr_t t;
2858
2859 if (pthread_getspecific(PL_thr_key, &t))
2860 croak("panic: pthread_getspecific");
2861 return (struct perl_thread *) t;
2862}
2863#endif
2864
2865MAGIC *
2866condpair_magic(SV *sv)
2867{
2868 MAGIC *mg;
2869
2870 SvUPGRADE(sv, SVt_PVMG);
2871 mg = mg_find(sv, 'm');
2872 if (!mg) {
2873 condpair_t *cp;
2874
2875 New(53, cp, 1, condpair_t);
2876 MUTEX_INIT(&cp->mutex);
2877 COND_INIT(&cp->owner_cond);
2878 COND_INIT(&cp->cond);
2879 cp->owner = 0;
2880 MUTEX_LOCK(&PL_cred_mutex); /* XXX need separate mutex? */
2881 mg = mg_find(sv, 'm');
2882 if (mg) {
2883 /* someone else beat us to initialising it */
2884 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
2885 MUTEX_DESTROY(&cp->mutex);
2886 COND_DESTROY(&cp->owner_cond);
2887 COND_DESTROY(&cp->cond);
2888 Safefree(cp);
2889 }
2890 else {
2891 sv_magic(sv, Nullsv, 'm', 0, 0);
2892 mg = SvMAGIC(sv);
2893 mg->mg_ptr = (char *)cp;
2894 mg->mg_len = sizeof(cp);
2895 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX need separate mutex? */
2896 DEBUG_S(WITH_THR(PerlIO_printf(PerlIO_stderr(),
2897 "%p: condpair_magic %p\n", thr, sv));)
2898 }
2899 }
2900 return mg;
2901}
2902
2903/*
2904 * Make a new perl thread structure using t as a prototype. Some of the
2905 * fields for the new thread are copied from the prototype thread, t,
2906 * so t should not be running in perl at the time this function is
2907 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2908 * thread calling new_struct_thread) clearly satisfies this constraint.
2909 */
2910struct perl_thread *
2911new_struct_thread(struct perl_thread *t)
2912{
2913 struct perl_thread *thr;
2914 SV *sv;
2915 SV **svp;
2916 I32 i;
2917
2918 sv = newSVpvn("", 0);
2919 SvGROW(sv, sizeof(struct perl_thread) + 1);
2920 SvCUR_set(sv, sizeof(struct perl_thread));
2921 thr = (Thread) SvPVX(sv);
2922#ifdef DEBUGGING
2923 memset(thr, 0xab, sizeof(struct perl_thread));
2924 PL_markstack = 0;
2925 PL_scopestack = 0;
2926 PL_savestack = 0;
2927 PL_retstack = 0;
2928 PL_dirty = 0;
2929 PL_localizing = 0;
2930 Zero(&PL_hv_fetch_ent_mh, 1, HE);
2931#else
2932 Zero(thr, 1, struct perl_thread);
2933#endif
2934
2935 thr->oursv = sv;
2936 init_stacks(ARGS);
2937
2938 PL_curcop = &PL_compiling;
2939 thr->cvcache = newHV();
2940 thr->threadsv = newAV();
2941 thr->specific = newAV();
2942 thr->errsv = newSVpvn("", 0);
2943 thr->errhv = newHV();
2944 thr->flags = THRf_R_JOINABLE;
2945 MUTEX_INIT(&thr->mutex);
2946
2947 /* top_env needs to be non-zero. It points to an area
2948 in which longjmp() stuff is stored, as C callstack
2949 info there at least is thread specific this has to
2950 be per-thread. Otherwise a 'die' in a thread gives
2951 that thread the C stack of last thread to do an eval {}!
2952 See comments in scope.h
2953 Initialize top entry (as in perl.c for main thread)
2954 */
2955 PL_start_env.je_prev = NULL;
2956 PL_start_env.je_ret = -1;
2957 PL_start_env.je_mustcatch = TRUE;
2958 PL_top_env = &PL_start_env;
2959
2960 PL_in_eval = FALSE;
2961 PL_restartop = 0;
2962
2963 PL_statname = NEWSV(66,0);
2964 PL_maxscream = -1;
2965 PL_regcompp = FUNC_NAME_TO_PTR(pregcomp);
2966 PL_regexecp = FUNC_NAME_TO_PTR(regexec_flags);
2967 PL_regindent = 0;
2968 PL_reginterp_cnt = 0;
2969 PL_lastscream = Nullsv;
2970 PL_screamfirst = 0;
2971 PL_screamnext = 0;
2972 PL_reg_start_tmp = 0;
2973 PL_reg_start_tmpl = 0;
2974
2975 /* parent thread's data needs to be locked while we make copy */
2976 MUTEX_LOCK(&t->mutex);
2977
2978 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
2979 PL_defstash = t->Tdefstash; /* XXX maybe these should */
2980 PL_curstash = t->Tcurstash; /* always be set to main? */
2981
2982 PL_tainted = t->Ttainted;
2983 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
2984 PL_nrs = newSVsv(t->Tnrs);
2985 PL_rs = SvREFCNT_inc(PL_nrs);
2986 PL_last_in_gv = Nullgv;
2987 PL_ofslen = t->Tofslen;
2988 PL_ofs = savepvn(t->Tofs, PL_ofslen);
2989 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2990 PL_chopset = t->Tchopset;
2991 PL_formtarget = newSVsv(t->Tformtarget);
2992 PL_bodytarget = newSVsv(t->Tbodytarget);
2993 PL_toptarget = newSVsv(t->Ttoptarget);
2994
2995 /* Initialise all per-thread SVs that the template thread used */
2996 svp = AvARRAY(t->threadsv);
2997 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
2998 if (*svp && *svp != &PL_sv_undef) {
2999 SV *sv = newSVsv(*svp);
3000 av_store(thr->threadsv, i, sv);
3001 sv_magic(sv, 0, 0, &PL_threadsv_names[i], 1);
3002 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
3003 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
3004 }
3005 }
3006 thr->threadsvp = AvARRAY(thr->threadsv);
3007
3008 MUTEX_LOCK(&PL_threads_mutex);
3009 PL_nthreads++;
3010 thr->tid = ++PL_threadnum;
3011 thr->next = t->next;
3012 thr->prev = t;
3013 t->next = thr;
3014 thr->next->prev = thr;
3015 MUTEX_UNLOCK(&PL_threads_mutex);
3016
3017 /* done copying parent's state */
3018 MUTEX_UNLOCK(&t->mutex);
3019
3020#ifdef HAVE_THREAD_INTERN
3021 init_thread_intern(thr);
3022#endif /* HAVE_THREAD_INTERN */
3023 return thr;
3024}
3025#endif /* USE_THREADS */
3026
3027#ifdef HUGE_VAL
3028/*
3029 * This hack is to force load of "huge" support from libm.a
3030 * So it is in perl for (say) POSIX to use.
3031 * Needed for SunOS with Sun's 'acc' for example.
3032 */
3033double
3034Perl_huge(void)
3035{
3036 return HUGE_VAL;
3037}
3038#endif
3039
3040#ifdef PERL_GLOBAL_STRUCT
3041struct perl_vars *
3042Perl_GetVars(void)
3043{
3044 return &PL_Vars;
3045}
3046#endif
3047
3048char **
3049get_op_names(void)
3050{
3051 return PL_op_name;
3052}
3053
3054char **
3055get_op_descs(void)
3056{
3057 return PL_op_desc;
3058}
3059
3060char *
3061get_no_modify(void)
3062{
3063 return (char*)PL_no_modify;
3064}
3065
3066U32 *
3067get_opargs(void)
3068{
3069 return PL_opargs;
3070}
3071
3072SV **
3073get_specialsv_list(void)
3074{
3075 return PL_specialsv_list;
3076}
3077
3078#ifndef HAS_GETENV_SV
3079SV *
3080getenv_sv(char *env_elem)
3081{
3082 char *env_trans;
3083 SV *temp_sv;
3084 if ((env_trans = PerlEnv_getenv(env_elem)) != Nullch) {
3085 temp_sv = newSVpv(env_trans, strlen(env_trans));
3086 return temp_sv;
3087 } else {
3088 return &PL_sv_undef;
3089 }
3090}
3091#endif
3092
3093
3094MGVTBL*
3095get_vtbl(int vtbl_id)
3096{
3097 MGVTBL* result = Null(MGVTBL*);
3098
3099 switch(vtbl_id) {
3100 case want_vtbl_sv:
3101 result = &PL_vtbl_sv;
3102 break;
3103 case want_vtbl_env:
3104 result = &PL_vtbl_env;
3105 break;
3106 case want_vtbl_envelem:
3107 result = &PL_vtbl_envelem;
3108 break;
3109 case want_vtbl_sig:
3110 result = &PL_vtbl_sig;
3111 break;
3112 case want_vtbl_sigelem:
3113 result = &PL_vtbl_sigelem;
3114 break;
3115 case want_vtbl_pack:
3116 result = &PL_vtbl_pack;
3117 break;
3118 case want_vtbl_packelem:
3119 result = &PL_vtbl_packelem;
3120 break;
3121 case want_vtbl_dbline:
3122 result = &PL_vtbl_dbline;
3123 break;
3124 case want_vtbl_isa:
3125 result = &PL_vtbl_isa;
3126 break;
3127 case want_vtbl_isaelem:
3128 result = &PL_vtbl_isaelem;
3129 break;
3130 case want_vtbl_arylen:
3131 result = &PL_vtbl_arylen;
3132 break;
3133 case want_vtbl_glob:
3134 result = &PL_vtbl_glob;
3135 break;
3136 case want_vtbl_mglob:
3137 result = &PL_vtbl_mglob;
3138 break;
3139 case want_vtbl_nkeys:
3140 result = &PL_vtbl_nkeys;
3141 break;
3142 case want_vtbl_taint:
3143 result = &PL_vtbl_taint;
3144 break;
3145 case want_vtbl_substr:
3146 result = &PL_vtbl_substr;
3147 break;
3148 case want_vtbl_vec:
3149 result = &PL_vtbl_vec;
3150 break;
3151 case want_vtbl_pos:
3152 result = &PL_vtbl_pos;
3153 break;
3154 case want_vtbl_bm:
3155 result = &PL_vtbl_bm;
3156 break;
3157 case want_vtbl_fm:
3158 result = &PL_vtbl_fm;
3159 break;
3160 case want_vtbl_uvar:
3161 result = &PL_vtbl_uvar;
3162 break;
3163#ifdef USE_THREADS
3164 case want_vtbl_mutex:
3165 result = &PL_vtbl_mutex;
3166 break;
3167#endif
3168 case want_vtbl_defelem:
3169 result = &PL_vtbl_defelem;
3170 break;
3171 case want_vtbl_regexp:
3172 result = &PL_vtbl_regexp;
3173 break;
3174 case want_vtbl_regdata:
3175 result = &PL_vtbl_regdata;
3176 break;
3177 case want_vtbl_regdatum:
3178 result = &PL_vtbl_regdatum;
3179 break;
3180#ifdef USE_LOCALE_COLLATE
3181 case want_vtbl_collxfrm:
3182 result = &PL_vtbl_collxfrm;
3183 break;
3184#endif
3185 case want_vtbl_amagic:
3186 result = &PL_vtbl_amagic;
3187 break;
3188 case want_vtbl_amagicelem:
3189 result = &PL_vtbl_amagicelem;
3190 break;
3191 }
3192 return result;
3193}
3194