This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Config_60-03-04.diff patch for 5.004_60
[perl5.git] / util.c
CommitLineData
a0d0e21e 1/* util.c
a687059c 2 *
9607fc9c 3 * Copyright (c) 1991-1997, Larry Wall
a687059c 4 *
d48672a2
LW
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.
8d063cd8 7 *
8d063cd8 8 */
a0d0e21e
LW
9
10/*
11 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
12 * not content." --Gandalf
13 */
8d063cd8 14
8d063cd8 15#include "EXTERN.h"
8d063cd8 16#include "perl.h"
31da6858 17#include "perlmem.h"
62b28dd9 18
6eb13c3b 19#if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
a687059c 20#include <signal.h>
62b28dd9 21#endif
a687059c 22
36477c24
PP
23#ifndef SIG_ERR
24# define SIG_ERR ((Sighandler_t) -1)
25#endif
26
bd4080b3 27/* XXX If this causes problems, set i_unistd=undef in the hint file. */
85e6fe83 28#ifdef I_UNISTD
8990e307
LW
29# include <unistd.h>
30#endif
31
a687059c
LW
32#ifdef I_VFORK
33# include <vfork.h>
34#endif
35
94b6baf5
AD
36/* Put this after #includes because fork and vfork prototypes may
37 conflict.
38*/
39#ifndef HAS_VFORK
40# define vfork fork
41#endif
42
fe14fcc3
LW
43#ifdef I_FCNTL
44# include <fcntl.h>
45#endif
46#ifdef I_SYS_FILE
47# include <sys/file.h>
48#endif
49
ff68c719
PP
50#ifdef I_SYS_WAIT
51# include <sys/wait.h>
52#endif
53
8d063cd8 54#define FLUSH
8d063cd8 55
a0d0e21e 56#ifdef LEAKTEST
8c52afec
IZ
57
58static void xstat _((int));
59long xcount[MAXXCOUNT];
60long lastxcount[MAXXCOUNT];
61long xycount[MAXXCOUNT][MAXYCOUNT];
62long lastxycount[MAXXCOUNT][MAXYCOUNT];
63
a0d0e21e
LW
64#endif
65
55497cff 66#ifndef MYMALLOC
de3bb511 67
8d063cd8
LW
68/* paranoid version of malloc */
69
a687059c
LW
70/* NOTE: Do not call the next three routines directly. Use the macros
71 * in handy.h, so that we can easily redefine everything to do tracking of
72 * allocated hunks back to the original New to track down any memory leaks.
20cec16a 73 * XXX This advice seems to be widely ignored :-( --AD August 1996.
a687059c
LW
74 */
75
bd4080b3 76Malloc_t
f0f333f4 77safemalloc(MEM_SIZE size)
8d063cd8 78{
bd4080b3 79 Malloc_t ptr;
55497cff 80#ifdef HAS_64K_LIMIT
62b28dd9 81 if (size > 0xffff) {
760ac839 82 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
79072805 83 my_exit(1);
62b28dd9 84 }
55497cff 85#endif /* HAS_64K_LIMIT */
34de22dd
LW
86#ifdef DEBUGGING
87 if ((long)size < 0)
463ee0b2 88 croak("panic: malloc");
34de22dd 89#endif
3028581b 90 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
79072805 91#if !(defined(I286) || defined(atarist))
760ac839 92 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
79072805 93#else
760ac839 94 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
8d063cd8
LW
95#endif
96 if (ptr != Nullch)
97 return ptr;
7c0587c8
LW
98 else if (nomemok)
99 return Nullch;
8d063cd8 100 else {
760ac839 101 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
79072805 102 my_exit(1);
4e35701f 103 return Nullch;
8d063cd8
LW
104 }
105 /*NOTREACHED*/
106}
107
108/* paranoid version of realloc */
109
bd4080b3 110Malloc_t
f0f333f4 111saferealloc(Malloc_t where,MEM_SIZE size)
8d063cd8 112{
bd4080b3 113 Malloc_t ptr;
ecfc5424 114#if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
3028581b 115 Malloc_t PerlMem_realloc();
ecfc5424 116#endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
8d063cd8 117
55497cff 118#ifdef HAS_64K_LIMIT
5f05dabc
PP
119 if (size > 0xffff) {
120 PerlIO_printf(PerlIO_stderr(),
121 "Reallocation too large: %lx\n", size) FLUSH;
122 my_exit(1);
123 }
55497cff 124#endif /* HAS_64K_LIMIT */
378cc40b 125 if (!where)
463ee0b2 126 croak("Null realloc");
34de22dd
LW
127#ifdef DEBUGGING
128 if ((long)size < 0)
463ee0b2 129 croak("panic: realloc");
34de22dd 130#endif
3028581b 131 ptr = PerlMem_realloc(where,size?size:1); /* realloc(0) is NASTY on our system */
79072805
LW
132
133#if !(defined(I286) || defined(atarist))
134 DEBUG_m( {
760ac839
LW
135 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,an++);
136 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
79072805
LW
137 } )
138#else
139 DEBUG_m( {
760ac839
LW
140 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,an++);
141 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
79072805 142 } )
8d063cd8 143#endif
79072805 144
8d063cd8
LW
145 if (ptr != Nullch)
146 return ptr;
7c0587c8
LW
147 else if (nomemok)
148 return Nullch;
8d063cd8 149 else {
760ac839 150 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
79072805 151 my_exit(1);
4e35701f 152 return Nullch;
8d063cd8
LW
153 }
154 /*NOTREACHED*/
155}
156
157/* safe version of free */
158
54310121 159Free_t
f0f333f4 160safefree(Malloc_t where)
8d063cd8 161{
79072805 162#if !(defined(I286) || defined(atarist))
f0f333f4 163 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",(char *) where,an++));
79072805 164#else
f0f333f4 165 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",(char *) where,an++));
8d063cd8 166#endif
378cc40b 167 if (where) {
de3bb511 168 /*SUPPRESS 701*/
3028581b 169 PerlMem_free(where);
378cc40b 170 }
8d063cd8
LW
171}
172
1050c9ca
PP
173/* safe version of calloc */
174
bd4080b3 175Malloc_t
f0f333f4 176safecalloc(MEM_SIZE count, MEM_SIZE size)
1050c9ca 177{
bd4080b3 178 Malloc_t ptr;
1050c9ca 179
55497cff 180#ifdef HAS_64K_LIMIT
5f05dabc
PP
181 if (size * count > 0xffff) {
182 PerlIO_printf(PerlIO_stderr(),
183 "Allocation too large: %lx\n", size * count) FLUSH;
184 my_exit(1);
185 }
55497cff 186#endif /* HAS_64K_LIMIT */
1050c9ca
PP
187#ifdef DEBUGGING
188 if ((long)size < 0 || (long)count < 0)
189 croak("panic: calloc");
190#endif
0b7c1c42 191 size *= count;
3028581b 192 ptr = PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
1050c9ca 193#if !(defined(I286) || defined(atarist))
fb73857a 194 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
1050c9ca 195#else
fb73857a 196 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
1050c9ca 197#endif
1050c9ca
PP
198 if (ptr != Nullch) {
199 memset((void*)ptr, 0, size);
200 return ptr;
201 }
202 else if (nomemok)
203 return Nullch;
204 else {
760ac839 205 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
1050c9ca 206 my_exit(1);
4e35701f 207 return Nullch;
1050c9ca
PP
208 }
209 /*NOTREACHED*/
210}
211
55497cff 212#endif /* !MYMALLOC */
de3bb511 213
a687059c
LW
214#ifdef LEAKTEST
215
8c52afec
IZ
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))
8d063cd8 236
bd4080b3 237Malloc_t
f0f333f4 238safexmalloc(I32 x, MEM_SIZE size)
8d063cd8 239{
8c52afec 240 register char* where = (char*)safemalloc(size + ALIGN);
8d063cd8 241
8c52afec
IZ
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);
8d063cd8 247}
8d063cd8 248
bd4080b3 249Malloc_t
8c52afec 250safexrealloc(Malloc_t wh, MEM_SIZE size)
a687059c 251{
8c52afec
IZ
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 }
a687059c
LW
268}
269
270void
8c52afec 271safexfree(Malloc_t wh)
a687059c 272{
79072805 273 I32 x;
8c52afec
IZ
274 char *where = (char*)wh;
275 MEM_SIZE size;
276
a687059c
LW
277 if (!where)
278 return;
279 where -= ALIGN;
8c52afec 280 size = sizeof_chunk(where);
a687059c 281 x = where[0] + 100 * where[1];
8c52afec
IZ
282 xcount[x] -= size;
283 xycount[x][SIZE_TO_Y(size)]--;
a687059c
LW
284 safefree(where);
285}
286
bd4080b3 287Malloc_t
f0f333f4 288safexcalloc(I32 x,MEM_SIZE count, MEM_SIZE size)
1050c9ca 289{
8c52afec
IZ
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);
1050c9ca
PP
297}
298
7c0587c8 299static void
8c52afec 300xstat(int flag)
8d063cd8 301{
8c52afec
IZ
302 register I32 i, j, total = 0;
303 I32 subtot[MAXYCOUNT];
8d063cd8 304
8c52afec
IZ
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);
a687059c 310 for (i = 0; i < MAXXCOUNT; i++) {
8c52afec
IZ
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]);
a687059c 322 lastxcount[i] = xcount[i];
8c52afec
IZ
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 }
8d063cd8 349 }
8c52afec 350 PerlIO_printf(PerlIO_stderr(), "\n");
8d063cd8 351 }
8d063cd8 352}
a687059c
LW
353
354#endif /* LEAKTEST */
8d063cd8
LW
355
356/* copy a string up to some (non-backslashed) delimiter, if any */
357
358char *
8ac85365 359delimcpy(register char *to, register char *toend, register char *from, register char *fromend, register int delim, I32 *retlen)
8d063cd8 360{
fc36a67e
PP
361 register I32 tolen;
362 for (tolen = 0; from < fromend; from++, tolen++) {
378cc40b
LW
363 if (*from == '\\') {
364 if (from[1] == delim)
365 from++;
fc36a67e
PP
366 else {
367 if (to < toend)
368 *to++ = *from;
369 tolen++;
370 from++;
371 }
378cc40b 372 }
bedebaa5 373 else if (*from == delim)
8d063cd8 374 break;
fc36a67e
PP
375 if (to < toend)
376 *to++ = *from;
8d063cd8 377 }
bedebaa5
CS
378 if (to < toend)
379 *to = '\0';
fc36a67e 380 *retlen = tolen;
8d063cd8
LW
381 return from;
382}
383
384/* return ptr to little string in big string, NULL if not found */
378cc40b 385/* This routine was donated by Corey Satten. */
8d063cd8
LW
386
387char *
8ac85365 388instr(register char *big, register char *little)
378cc40b
LW
389{
390 register char *s, *x;
79072805 391 register I32 first;
378cc40b 392
a687059c
LW
393 if (!little)
394 return big;
395 first = *little++;
378cc40b
LW
396 if (!first)
397 return 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 big-1;
411 }
412 return Nullch;
413}
8d063cd8 414
a687059c
LW
415/* same as instr but allow embedded nulls */
416
417char *
8ac85365 418ninstr(register char *big, register char *bigend, char *little, char *lend)
8d063cd8 419{
a687059c 420 register char *s, *x;
79072805 421 register I32 first = *little;
a687059c 422 register char *littleend = lend;
378cc40b 423
a0d0e21e 424 if (!first && little >= littleend)
a687059c 425 return big;
de3bb511
LW
426 if (bigend - big < littleend - little)
427 return Nullch;
a687059c
LW
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 big-1;
378cc40b 440 }
a687059c
LW
441 return Nullch;
442}
443
444/* reverse of the above--find last substring */
445
446char *
8ac85365 447rninstr(register char *big, char *bigend, char *little, char *lend)
a687059c
LW
448{
449 register char *bigbeg;
450 register char *s, *x;
79072805 451 register I32 first = *little;
a687059c
LW
452 register char *littleend = lend;
453
a0d0e21e 454 if (!first && little >= littleend)
a687059c
LW
455 return 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 big+1;
378cc40b 469 }
a687059c 470 return Nullch;
378cc40b 471}
a687059c 472
bbce6d69
PP
473/*
474 * Set up for a new ctype locale.
475 */
55497cff 476void
8ac85365 477perl_new_ctype(char *newctype)
ef7eada9 478{
36477c24
PP
479#ifdef USE_LOCALE_CTYPE
480
bbce6d69 481 int i;
ef7eada9 482
bbce6d69
PP
483 for (i = 0; i < 256; i++) {
484 if (isUPPER_LC(i))
485 fold_locale[i] = toLOWER_LC(i);
486 else if (isLOWER_LC(i))
487 fold_locale[i] = toUPPER_LC(i);
488 else
489 fold_locale[i] = i;
490 }
bbce6d69 491
36477c24
PP
492#endif /* USE_LOCALE_CTYPE */
493}
bbce6d69
PP
494
495/*
496 * Set up for a new collation locale.
497 */
498void
8ac85365 499perl_new_collate(char *newcoll)
bbce6d69 500{
36477c24
PP
501#ifdef USE_LOCALE_COLLATE
502
bbce6d69
PP
503 if (! newcoll) {
504 if (collation_name) {
505 ++collation_ix;
506 Safefree(collation_name);
507 collation_name = NULL;
508 collation_standard = TRUE;
bbce6d69
PP
509 collxfrm_base = 0;
510 collxfrm_mult = 2;
bbce6d69
PP
511 }
512 return;
513 }
514
515 if (! collation_name || strNE(collation_name, newcoll)) {
516 ++collation_ix;
517 Safefree(collation_name);
518 collation_name = savepv(newcoll);
ff68c719 519 collation_standard = (strEQ(newcoll, "C") || strEQ(newcoll, "POSIX"));
bbce6d69 520
bbce6d69
PP
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 collxfrm_base = (fa > mult) ? (fa - mult) : 0;
532 collxfrm_mult = mult;
533 }
bbce6d69 534 }
bbce6d69 535
36477c24
PP
536#endif /* USE_LOCALE_COLLATE */
537}
bbce6d69
PP
538
539/*
540 * Set up for a new numeric locale.
541 */
542void
8ac85365 543perl_new_numeric(char *newnum)
bbce6d69 544{
36477c24
PP
545#ifdef USE_LOCALE_NUMERIC
546
bbce6d69
PP
547 if (! newnum) {
548 if (numeric_name) {
549 Safefree(numeric_name);
550 numeric_name = NULL;
551 numeric_standard = TRUE;
552 numeric_local = TRUE;
553 }
554 return;
555 }
556
557 if (! numeric_name || strNE(numeric_name, newnum)) {
558 Safefree(numeric_name);
559 numeric_name = savepv(newnum);
ff68c719 560 numeric_standard = (strEQ(newnum, "C") || strEQ(newnum, "POSIX"));
bbce6d69
PP
561 numeric_local = TRUE;
562 }
36477c24
PP
563
564#endif /* USE_LOCALE_NUMERIC */
bbce6d69
PP
565}
566
567void
8ac85365 568perl_set_numeric_standard(void)
bbce6d69 569{
5f05dabc
PP
570#ifdef USE_LOCALE_NUMERIC
571
bbce6d69
PP
572 if (! numeric_standard) {
573 setlocale(LC_NUMERIC, "C");
574 numeric_standard = TRUE;
575 numeric_local = FALSE;
576 }
5f05dabc
PP
577
578#endif /* USE_LOCALE_NUMERIC */
bbce6d69
PP
579}
580
581void
8ac85365 582perl_set_numeric_local(void)
bbce6d69 583{
5f05dabc
PP
584#ifdef USE_LOCALE_NUMERIC
585
bbce6d69
PP
586 if (! numeric_local) {
587 setlocale(LC_NUMERIC, numeric_name);
588 numeric_standard = FALSE;
589 numeric_local = TRUE;
590 }
bbce6d69 591
36477c24 592#endif /* USE_LOCALE_NUMERIC */
5f05dabc 593}
36477c24 594
bbce6d69 595
36477c24
PP
596/*
597 * Initialize locale awareness.
598 */
f0c5b223 599int
8ac85365 600perl_init_i18nl10n(int printwarn)
f0c5b223
TB
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 */
bbce6d69 608
36477c24 609#ifdef USE_LOCALE
bbce6d69 610
36477c24 611#ifdef USE_LOCALE_CTYPE
bbce6d69 612 char *curctype = NULL;
36477c24
PP
613#endif /* USE_LOCALE_CTYPE */
614#ifdef USE_LOCALE_COLLATE
bbce6d69 615 char *curcoll = NULL;
36477c24
PP
616#endif /* USE_LOCALE_COLLATE */
617#ifdef USE_LOCALE_NUMERIC
bbce6d69 618 char *curnum = NULL;
36477c24 619#endif /* USE_LOCALE_NUMERIC */
5fd9e9a4
GS
620 char *lc_all = PerlEnv_getenv("LC_ALL");
621 char *lang = PerlEnv_getenv("LANG");
bbce6d69 622 bool setlocale_failure = FALSE;
f0c5b223 623
02b32252
CS
624#ifdef LOCALE_ENVIRON_REQUIRED
625
626 /*
627 * Ultrix setlocale(..., "") fails if there are no environment
628 * variables from which to get a locale name.
629 */
630
631 bool done = FALSE;
632
633#ifdef LC_ALL
634 if (lang) {
635 if (setlocale(LC_ALL, ""))
636 done = TRUE;
637 else
638 setlocale_failure = TRUE;
639 }
640 if (!setlocale_failure)
641#endif /* LC_ALL */
642 {
643#ifdef USE_LOCALE_CTYPE
644 if (! (curctype = setlocale(LC_CTYPE,
5fd9e9a4 645 (!done && (lang || PerlEnv_getenv("LC_CTYPE")))
02b32252
CS
646 ? "" : Nullch)))
647 setlocale_failure = TRUE;
648#endif /* USE_LOCALE_CTYPE */
649#ifdef USE_LOCALE_COLLATE
650 if (! (curcoll = setlocale(LC_COLLATE,
5fd9e9a4 651 (!done && (lang || PerlEnv_getenv("LC_COLLATE")))
02b32252
CS
652 ? "" : Nullch)))
653 setlocale_failure = TRUE;
654#endif /* USE_LOCALE_COLLATE */
655#ifdef USE_LOCALE_NUMERIC
656 if (! (curnum = setlocale(LC_NUMERIC,
5fd9e9a4 657 (!done && (lang || PerlEnv_getenv("LC_NUMERIC")))
02b32252
CS
658 ? "" : Nullch)))
659 setlocale_failure = TRUE;
660#endif /* USE_LOCALE_NUMERIC */
661 }
662
663#else /* !LOCALE_ENVIRON_REQUIRED */
664
bbce6d69 665#ifdef LC_ALL
5f05dabc 666
bbce6d69
PP
667 if (! setlocale(LC_ALL, ""))
668 setlocale_failure = TRUE;
5f05dabc
PP
669 else {
670#ifdef USE_LOCALE_CTYPE
671 curctype = setlocale(LC_CTYPE, Nullch);
672#endif /* USE_LOCALE_CTYPE */
673#ifdef USE_LOCALE_COLLATE
674 curcoll = setlocale(LC_COLLATE, Nullch);
675#endif /* USE_LOCALE_COLLATE */
676#ifdef USE_LOCALE_NUMERIC
677 curnum = setlocale(LC_NUMERIC, Nullch);
678#endif /* USE_LOCALE_NUMERIC */
679 }
680
681#else /* !LC_ALL */
bbce6d69 682
36477c24 683#ifdef USE_LOCALE_CTYPE
5f05dabc 684 if (! (curctype = setlocale(LC_CTYPE, "")))
bbce6d69 685 setlocale_failure = TRUE;
36477c24
PP
686#endif /* USE_LOCALE_CTYPE */
687#ifdef USE_LOCALE_COLLATE
5f05dabc 688 if (! (curcoll = setlocale(LC_COLLATE, "")))
bbce6d69 689 setlocale_failure = TRUE;
36477c24
PP
690#endif /* USE_LOCALE_COLLATE */
691#ifdef USE_LOCALE_NUMERIC
5f05dabc 692 if (! (curnum = setlocale(LC_NUMERIC, "")))
bbce6d69 693 setlocale_failure = TRUE;
36477c24 694#endif /* USE_LOCALE_NUMERIC */
bbce6d69 695
5f05dabc
PP
696#endif /* LC_ALL */
697
02b32252
CS
698#endif /* !LOCALE_ENVIRON_REQUIRED */
699
5f05dabc
PP
700 if (setlocale_failure) {
701 char *p;
702 bool locwarn = (printwarn > 1 ||
703 printwarn &&
5fd9e9a4 704 (!(p = PerlEnv_getenv("PERL_BADLANG")) || atoi(p)));
20cec16a 705
5f05dabc
PP
706 if (locwarn) {
707#ifdef LC_ALL
708
709 PerlIO_printf(PerlIO_stderr(),
710 "perl: warning: Setting locale failed.\n");
711
712#else /* !LC_ALL */
713
ef7eada9 714 PerlIO_printf(PerlIO_stderr(),
bbce6d69 715 "perl: warning: Setting locale failed for the categories:\n\t");
36477c24 716#ifdef USE_LOCALE_CTYPE
bbce6d69 717 if (! curctype)
5f05dabc 718 PerlIO_printf(PerlIO_stderr(), "LC_CTYPE ");
36477c24
PP
719#endif /* USE_LOCALE_CTYPE */
720#ifdef USE_LOCALE_COLLATE
bbce6d69 721 if (! curcoll)
5f05dabc 722 PerlIO_printf(PerlIO_stderr(), "LC_COLLATE ");
36477c24
PP
723#endif /* USE_LOCALE_COLLATE */
724#ifdef USE_LOCALE_NUMERIC
bbce6d69 725 if (! curnum)
5f05dabc 726 PerlIO_printf(PerlIO_stderr(), "LC_NUMERIC ");
36477c24 727#endif /* USE_LOCALE_NUMERIC */
bbce6d69
PP
728 PerlIO_printf(PerlIO_stderr(), "\n");
729
5f05dabc
PP
730#endif /* LC_ALL */
731
760ac839 732 PerlIO_printf(PerlIO_stderr(),
bbce6d69 733 "perl: warning: Please check that your locale settings:\n");
ef7eada9
JH
734
735 PerlIO_printf(PerlIO_stderr(),
bbce6d69
PP
736 "\tLC_ALL = %c%s%c,\n",
737 lc_all ? '"' : '(',
738 lc_all ? lc_all : "unset",
739 lc_all ? '"' : ')');
5f05dabc
PP
740
741 {
742 char **e;
743 for (e = environ; *e; e++) {
744 if (strnEQ(*e, "LC_", 3)
745 && strnNE(*e, "LC_ALL=", 7)
746 && (p = strchr(*e, '=')))
747 PerlIO_printf(PerlIO_stderr(), "\t%.*s = \"%s\",\n",
fb73857a 748 (int)(p - *e), *e, p + 1);
5f05dabc
PP
749 }
750 }
751
ef7eada9 752 PerlIO_printf(PerlIO_stderr(),
bbce6d69 753 "\tLANG = %c%s%c\n",
5f05dabc 754 lang ? '"' : '(',
bbce6d69
PP
755 lang ? lang : "unset",
756 lang ? '"' : ')');
ef7eada9 757
bbce6d69
PP
758 PerlIO_printf(PerlIO_stderr(),
759 " are supported and installed on your system.\n");
5f05dabc 760 }
ef7eada9 761
5f05dabc
PP
762#ifdef LC_ALL
763
764 if (setlocale(LC_ALL, "C")) {
765 if (locwarn)
766 PerlIO_printf(PerlIO_stderr(),
767 "perl: warning: Falling back to the standard locale (\"C\").\n");
bbce6d69 768 ok = 0;
ef7eada9 769 }
5f05dabc
PP
770 else {
771 if (locwarn)
772 PerlIO_printf(PerlIO_stderr(),
773 "perl: warning: Failed to fall back to the standard locale (\"C\").\n");
774 ok = -1;
775 }
bbce6d69 776
5f05dabc
PP
777#else /* ! LC_ALL */
778
779 if (0
36477c24 780#ifdef USE_LOCALE_CTYPE
5f05dabc 781 || !(curctype || setlocale(LC_CTYPE, "C"))
36477c24
PP
782#endif /* USE_LOCALE_CTYPE */
783#ifdef USE_LOCALE_COLLATE
5f05dabc 784 || !(curcoll || setlocale(LC_COLLATE, "C"))
36477c24
PP
785#endif /* USE_LOCALE_COLLATE */
786#ifdef USE_LOCALE_NUMERIC
5f05dabc 787 || !(curnum || setlocale(LC_NUMERIC, "C"))
36477c24 788#endif /* USE_LOCALE_NUMERIC */
5f05dabc
PP
789 )
790 {
791 if (locwarn)
bbce6d69 792 PerlIO_printf(PerlIO_stderr(),
5f05dabc
PP
793 "perl: warning: Cannot fall back to the standard locale (\"C\").\n");
794 ok = -1;
bbce6d69 795 }
5f05dabc 796
bbce6d69 797#endif /* ! LC_ALL */
5f05dabc
PP
798
799#ifdef USE_LOCALE_CTYPE
800 curctype = setlocale(LC_CTYPE, Nullch);
801#endif /* USE_LOCALE_CTYPE */
802#ifdef USE_LOCALE_COLLATE
803 curcoll = setlocale(LC_COLLATE, Nullch);
804#endif /* USE_LOCALE_COLLATE */
805#ifdef USE_LOCALE_NUMERIC
806 curnum = setlocale(LC_NUMERIC, Nullch);
807#endif /* USE_LOCALE_NUMERIC */
ef7eada9
JH
808 }
809
36477c24 810#ifdef USE_LOCALE_CTYPE
bbce6d69 811 perl_new_ctype(curctype);
36477c24 812#endif /* USE_LOCALE_CTYPE */
bbce6d69 813
36477c24 814#ifdef USE_LOCALE_COLLATE
bbce6d69 815 perl_new_collate(curcoll);
36477c24 816#endif /* USE_LOCALE_COLLATE */
bbce6d69 817
36477c24 818#ifdef USE_LOCALE_NUMERIC
bbce6d69 819 perl_new_numeric(curnum);
36477c24 820#endif /* USE_LOCALE_NUMERIC */
ef7eada9 821
36477c24 822#endif /* USE_LOCALE */
ef7eada9 823
f0c5b223
TB
824 return ok;
825}
826
bbce6d69
PP
827/* Backwards compatibility. */
828int
8ac85365 829perl_init_i18nl14n(int printwarn)
bbce6d69 830{
5f05dabc 831 return perl_init_i18nl10n(printwarn);
bbce6d69 832}
ef7eada9 833
36477c24 834#ifdef USE_LOCALE_COLLATE
ef7eada9 835
bbce6d69
PP
836/*
837 * mem_collxfrm() is a bit like strxfrm() but with two important
838 * differences. First, it handles embedded NULs. Second, it allocates
839 * a bit more memory than needed for the transformed data itself.
840 * The real transformed data begins at offset sizeof(collationix).
841 * Please see sv_collxfrm() to see how this is used.
842 */
843char *
8ac85365 844mem_collxfrm(const char *s, STRLEN len, STRLEN *xlen)
bbce6d69
PP
845{
846 char *xbuf;
847 STRLEN xalloc, xin, xout;
848
849 /* the first sizeof(collationix) bytes are used by sv_collxfrm(). */
850 /* the +1 is for the terminating NUL. */
851
852 xalloc = sizeof(collation_ix) + collxfrm_base + (collxfrm_mult * len) + 1;
853 New(171, xbuf, xalloc, char);
854 if (! xbuf)
855 goto bad;
856
857 *(U32*)xbuf = collation_ix;
858 xout = sizeof(collation_ix);
859 for (xin = 0; xin < len; ) {
860 SSize_t xused;
861
862 for (;;) {
863 xused = strxfrm(xbuf + xout, s + xin, xalloc - xout);
864 if (xused == -1)
865 goto bad;
866 if (xused < xalloc - xout)
867 break;
868 xalloc = (2 * xalloc) + 1;
869 Renew(xbuf, xalloc, char);
870 if (! xbuf)
871 goto bad;
872 }
ef7eada9 873
bbce6d69
PP
874 xin += strlen(s + xin) + 1;
875 xout += xused;
876
877 /* Embedded NULs are understood but silently skipped
878 * because they make no sense in locale collation. */
879 }
ef7eada9 880
bbce6d69
PP
881 xbuf[xout] = '\0';
882 *xlen = xout - sizeof(collation_ix);
883 return xbuf;
884
885 bad:
886 Safefree(xbuf);
887 *xlen = 0;
888 return NULL;
ef7eada9
JH
889}
890
36477c24 891#endif /* USE_LOCALE_COLLATE */
bbce6d69 892
378cc40b 893void
8ac85365 894fbm_compile(SV *sv)
378cc40b 895{
a687059c
LW
896 register unsigned char *s;
897 register unsigned char *table;
79072805
LW
898 register U32 i;
899 register U32 len = SvCUR(sv);
900 I32 rarest = 0;
901 U32 frequency = 256;
902
c277df42
IZ
903 sv_upgrade(sv, SVt_PVBM);
904 if (len > 255 || len == 0) /* TAIL might be on on a zero-length string. */
748a9306 905 return; /* can't have offsets that big */
02128f11
IZ
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 }
378cc40b 920 }
bbce6d69 921 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
79072805 922 SvVALID_on(sv);
378cc40b 923
463ee0b2 924 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
bbce6d69
PP
925 for (i = 0; i < len; i++) {
926 if (freq[s[i]] < frequency) {
927 rarest = i;
928 frequency = freq[s[i]];
378cc40b
LW
929 }
930 }
79072805
LW
931 BmRARE(sv) = s[rarest];
932 BmPREVIOUS(sv) = rarest;
760ac839 933 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
378cc40b
LW
934}
935
378cc40b 936char *
8ac85365 937fbm_instr(unsigned char *big, register unsigned char *bigend, SV *littlestr)
378cc40b 938{
a687059c 939 register unsigned char *s;
79072805
LW
940 register I32 tmp;
941 register I32 littlelen;
a687059c
LW
942 register unsigned char *little;
943 register unsigned char *table;
944 register unsigned char *olds;
945 register unsigned char *oldlittle;
378cc40b 946
79072805 947 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
a0d0e21e
LW
948 STRLEN len;
949 char *l = SvPV(littlestr,len);
c277df42 950 if (!len) {
02128f11
IZ
951 if (SvTAIL(littlestr)) { /* Can be only 0-len constant
952 substr => we can ignore SvVALID */
953 if (multiline) {
954 char *t = "\n";
3fe6f2dc
MB
955 if ((s = (unsigned char*)ninstr((char*)big, (char*)bigend,
956 t, t + len))) {
957 return (char*)s;
958 }
02128f11 959 }
c277df42 960 if (bigend > big && bigend[-1] == '\n')
161b471a 961 return (char *)(bigend - 1);
c277df42 962 else
161b471a 963 return (char *) bigend;
c277df42 964 }
d48672a2 965 return (char*)big;
c277df42 966 }
a0d0e21e 967 return ninstr((char*)big,(char*)bigend, l, l + len);
d48672a2 968 }
378cc40b 969
79072805
LW
970 littlelen = SvCUR(littlestr);
971 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
0f85fab0
LW
972 if (littlelen > bigend - big)
973 return Nullch;
463ee0b2 974 little = (unsigned char*)SvPVX(littlestr);
bbce6d69 975 s = bigend - littlelen;
02128f11
IZ
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))
bbce6d69 981 return (char*)s; /* how sweet it is */
02128f11
IZ
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 */
3fe6f2dc
MB
998 {
999 return (char*)s;
1000 }
02128f11 1001 s++;
a687059c 1002 }
bbce6d69 1003 return Nullch;
a687059c 1004 }
463ee0b2 1005 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
62b28dd9
LW
1006 if (--littlelen >= bigend - big)
1007 return Nullch;
1008 s = big + littlelen;
a687059c 1009 oldlittle = little = table - 2;
bbce6d69
PP
1010 if (s < bigend) {
1011 top2:
1012 /*SUPPRESS 560*/
1013 if (tmp = table[*s]) {
62b28dd9 1014#ifdef POINTERRIGOR
bbce6d69
PP
1015 if (bigend - s > tmp) {
1016 s += tmp;
1017 goto top2;
1018 }
62b28dd9 1019#else
bbce6d69
PP
1020 if ((s += tmp) < bigend)
1021 goto top2;
62b28dd9 1022#endif
bbce6d69 1023 return Nullch;
a687059c 1024 }
bbce6d69
PP
1025 else {
1026 tmp = littlelen; /* less expensive than calling strncmp() */
1027 olds = s;
1028 while (tmp--) {
1029 if (*--s == *--little)
1030 continue;
c277df42 1031 differ:
bbce6d69
PP
1032 s = olds + 1; /* here we pay the price for failure */
1033 little = oldlittle;
1034 if (s < bigend) /* fake up continue to outer loop */
62b28dd9 1035 goto top2;
62b28dd9 1036 return Nullch;
a687059c 1037 }
c277df42
IZ
1038 if (SvTAIL(littlestr) /* automatically multiline */
1039 && olds + 1 != bigend
1040 && olds[1] != '\n')
1041 goto differ;
bbce6d69 1042 return (char *)s;
378cc40b
LW
1043 }
1044 }
1045 return Nullch;
1046}
1047
c277df42
IZ
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
378cc40b 1058char *
c277df42 1059screaminstr(SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
378cc40b 1060{
a687059c
LW
1061 register unsigned char *s, *x;
1062 register unsigned char *big;
79072805
LW
1063 register I32 pos;
1064 register I32 previous;
1065 register I32 first;
a687059c 1066 register unsigned char *little;
c277df42 1067 register I32 stop_pos;
a687059c 1068 register unsigned char *littleend;
c277df42 1069 I32 found = 0;
378cc40b 1070
c277df42
IZ
1071 if (*old_posp == -1
1072 ? (pos = screamfirst[BmRARE(littlestr)]) < 0
1073 : (((pos = *old_posp), pos += screamnext[pos]) == 0))
378cc40b 1074 return Nullch;
463ee0b2 1075 little = (unsigned char *)(SvPVX(littlestr));
79072805 1076 littleend = little + SvCUR(littlestr);
378cc40b 1077 first = *little++;
c277df42 1078 /* The value of pos we can start at: */
79072805 1079 previous = BmPREVIOUS(littlestr);
463ee0b2 1080 big = (unsigned char *)(SvPVX(bigstr));
c277df42
IZ
1081 /* The value of pos we can stop at: */
1082 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
1083 if (previous + start_shift > stop_pos) return Nullch;
1084 while (pos < previous + start_shift) {
378cc40b
LW
1085 if (!(pos += screamnext[pos]))
1086 return Nullch;
1087 }
de3bb511 1088#ifdef POINTERRIGOR
bbce6d69 1089 do {
c277df42 1090 if (pos >= stop_pos) return Nullch;
bbce6d69
PP
1091 if (big[pos-previous] != first)
1092 continue;
1093 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
bbce6d69
PP
1094 if (*s++ != *x++) {
1095 s--;
1096 break;
de3bb511 1097 }
bbce6d69 1098 }
c277df42
IZ
1099 if (s == littleend) {
1100 *old_posp = pos;
1101 if (!last) return (char *)(big+pos-previous);
1102 found = 1;
1103 }
bbce6d69 1104 } while ( pos += screamnext[pos] );
c277df42 1105 return (last && found) ? (char *)(big+(*old_posp)-previous) : Nullch;
de3bb511
LW
1106#else /* !POINTERRIGOR */
1107 big -= previous;
bbce6d69 1108 do {
c277df42 1109 if (pos >= stop_pos) return Nullch;
bbce6d69
PP
1110 if (big[pos] != first)
1111 continue;
1112 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
bbce6d69
PP
1113 if (*s++ != *x++) {
1114 s--;
1115 break;
378cc40b 1116 }
bbce6d69 1117 }
c277df42
IZ
1118 if (s == littleend) {
1119 *old_posp = pos;
1120 if (!last) return (char *)(big+pos);
1121 found = 1;
1122 }
bbce6d69 1123 } while ( pos += screamnext[pos] );
c277df42 1124 return (last && found) ? (char *)(big+(*old_posp)) : Nullch;
de3bb511 1125#endif /* POINTERRIGOR */
8d063cd8
LW
1126}
1127
79072805 1128I32
8ac85365 1129ibcmp(char *s1, char *s2, register I32 len)
79072805 1130{
bbce6d69
PP
1131 register U8 *a = (U8 *)s1;
1132 register U8 *b = (U8 *)s2;
79072805 1133 while (len--) {
bbce6d69
PP
1134 if (*a != *b && *a != fold[*b])
1135 return 1;
1136 a++,b++;
1137 }
1138 return 0;
1139}
1140
1141I32
8ac85365 1142ibcmp_locale(char *s1, char *s2, register I32 len)
bbce6d69
PP
1143{
1144 register U8 *a = (U8 *)s1;
1145 register U8 *b = (U8 *)s2;
1146 while (len--) {
1147 if (*a != *b && *a != fold_locale[*b])
1148 return 1;
1149 a++,b++;
79072805
LW
1150 }
1151 return 0;
1152}
1153
8d063cd8
LW
1154/* copy a string to a safe spot */
1155
1156char *
8ac85365 1157savepv(char *sv)
8d063cd8 1158{
a687059c 1159 register char *newaddr;
8d063cd8 1160
79072805
LW
1161 New(902,newaddr,strlen(sv)+1,char);
1162 (void)strcpy(newaddr,sv);
8d063cd8
LW
1163 return newaddr;
1164}
1165
a687059c
LW
1166/* same thing but with a known length */
1167
1168char *
8ac85365 1169savepvn(char *sv, register I32 len)
a687059c
LW
1170{
1171 register char *newaddr;
1172
1173 New(903,newaddr,len+1,char);
79072805 1174 Copy(sv,newaddr,len,char); /* might not be null terminated */
a687059c
LW
1175 newaddr[len] = '\0'; /* is now */
1176 return newaddr;
1177}
1178
fc36a67e
PP
1179/* the SV for form() and mess() is not kept in an arena */
1180
1181static SV *
8ac85365 1182mess_alloc(void)
fc36a67e
PP
1183{
1184 SV *sv;
1185 XPVMG *any;
1186
1187 /* Create as PVMG now, to avoid any upgrading later */
1188 New(905, sv, 1, SV);
1189 Newz(905, any, 1, XPVMG);
1190 SvFLAGS(sv) = SVt_PVMG;
1191 SvANY(sv) = (void*)any;
1192 SvREFCNT(sv) = 1 << 30; /* practically infinite */
1193 return sv;
1194}
1195
a0d0e21e 1196#ifdef I_STDARG
8990e307 1197char *
46fc3d4c 1198form(const char* pat, ...)
a687059c
LW
1199#else
1200/*VARARGS0*/
de3bb511 1201char *
46fc3d4c 1202form(pat, va_alist)
71be2cbc 1203 const char *pat;
46fc3d4c 1204 va_dcl
8990e307
LW
1205#endif
1206{
46fc3d4c
PP
1207 va_list args;
1208#ifdef I_STDARG
1209 va_start(args, pat);
a687059c 1210#else
46fc3d4c 1211 va_start(args);
d48672a2 1212#endif
fc36a67e
PP
1213 if (!mess_sv)
1214 mess_sv = mess_alloc();
1215 sv_vsetpvfn(mess_sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
46fc3d4c 1216 va_end(args);
fc36a67e 1217 return SvPVX(mess_sv);
46fc3d4c 1218}
a687059c 1219
46fc3d4c 1220char *
8ac85365 1221mess(const char *pat, va_list *args)
46fc3d4c
PP
1222{
1223 SV *sv;
1224 static char dgd[] = " during global destruction.\n";
1225
46fc3d4c 1226 if (!mess_sv)
fc36a67e 1227 mess_sv = mess_alloc();
46fc3d4c 1228 sv = mess_sv;
fc36a67e 1229 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
46fc3d4c 1230 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
e858de61 1231 dTHR;
2304df62 1232 if (dirty)
46fc3d4c 1233 sv_catpv(sv, dgd);
2304df62 1234 else {
46fc3d4c 1235 if (curcop->cop_line)
fc36a67e 1236 sv_catpvf(sv, " at %_ line %ld",
46fc3d4c 1237 GvSV(curcop->cop_filegv), (long)curcop->cop_line);
c07a80fd
PP
1238 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
1239 bool line_mode = (RsSIMPLE(rs) &&
1240 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
46fc3d4c
PP
1241 sv_catpvf(sv, ", <%s> %s %ld",
1242 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
1243 line_mode ? "line" : "chunk",
1244 (long)IoLINES(GvIOp(last_in_gv)));
2304df62 1245 }
46fc3d4c 1246 sv_catpv(sv, ".\n");
a687059c 1247 }
a687059c 1248 }
46fc3d4c 1249 return SvPVX(sv);
a687059c
LW
1250}
1251
ecfc5424 1252#ifdef I_STDARG
36477c24 1253OP *
71be2cbc 1254die(const char* pat, ...)
36477c24
PP
1255#else
1256/*VARARGS0*/
1257OP *
1258die(pat, va_alist)
71be2cbc 1259 const char *pat;
36477c24
PP
1260 va_dcl
1261#endif
1262{
5dc0d613 1263 dTHR;
36477c24
PP
1264 va_list args;
1265 char *message;
36477c24
PP
1266 int was_in_eval = in_eval;
1267 HV *stash;
1268 GV *gv;
1269 CV *cv;
1270
57d3b86d 1271#ifdef USE_THREADS
199100c8
MB
1272 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1273 "%p: die: curstack = %p, mainstack = %p\n",
1274 thr, curstack, mainstack));
57d3b86d 1275#endif /* USE_THREADS */
36477c24
PP
1276 /* We have to switch back to mainstack or die_where may try to pop
1277 * the eval block from the wrong stack if die is being called from a
1278 * signal handler. - dkindred@cs.cmu.edu */
1279 if (curstack != mainstack) {
1280 dSP;
1281 SWITCHSTACK(curstack, mainstack);
1282 }
1283
1284#ifdef I_STDARG
1285 va_start(args, pat);
1286#else
1287 va_start(args);
1288#endif
1289 message = mess(pat, &args);
1290 va_end(args);
1291
57d3b86d 1292#ifdef USE_THREADS
199100c8
MB
1293 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1294 "%p: die: message = %s\ndiehook = %p\n",
1295 thr, message, diehook));
57d3b86d 1296#endif /* USE_THREADS */
1738f5c4
CS
1297 if (diehook) {
1298 /* sv_2cv might call croak() */
1299 SV *olddiehook = diehook;
1300 ENTER;
1301 SAVESPTR(diehook);
1302 diehook = Nullsv;
1303 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1304 LEAVE;
1305 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1306 dSP;
774d564b
PP
1307 SV *msg;
1308
1309 ENTER;
1310 msg = newSVpv(message, 0);
1311 SvREADONLY_on(msg);
1312 SAVEFREESV(msg);
1738f5c4
CS
1313
1314 PUSHMARK(sp);
1315 XPUSHs(msg);
1316 PUTBACK;
1317 perl_call_sv((SV*)cv, G_DISCARD);
1318
774d564b 1319 LEAVE;
1738f5c4 1320 }
36477c24
PP
1321 }
1322
1323 restartop = die_where(message);
57d3b86d 1324#ifdef USE_THREADS
d9f997d7 1325 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
7c06b590
GS
1326 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
1327 thr, restartop, was_in_eval, top_env));
57d3b86d 1328#endif /* USE_THREADS */
7c06b590 1329 if ((!restartop && was_in_eval) || top_env->je_prev)
54310121 1330 JMPENV_JUMP(3);
36477c24
PP
1331 return restartop;
1332}
1333
1334#ifdef I_STDARG
79072805 1335void
71be2cbc 1336croak(const char* pat, ...)
463ee0b2 1337#else
8990e307
LW
1338/*VARARGS0*/
1339void
1340croak(pat, va_alist)
1341 char *pat;
1342 va_dcl
463ee0b2 1343#endif
a687059c 1344{
11343788 1345 dTHR;
a687059c 1346 va_list args;
de3bb511 1347 char *message;
748a9306
LW
1348 HV *stash;
1349 GV *gv;
1350 CV *cv;
a687059c 1351
a0d0e21e 1352#ifdef I_STDARG
8990e307
LW
1353 va_start(args, pat);
1354#else
a687059c 1355 va_start(args);
8990e307 1356#endif
2304df62 1357 message = mess(pat, &args);
a687059c 1358 va_end(args);
11343788 1359#ifdef USE_THREADS
d9f997d7 1360 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "croak: 0x%lx %s", (unsigned long) thr, message));
11343788 1361#endif /* USE_THREADS */
20cec16a 1362 if (diehook) {
1738f5c4 1363 /* sv_2cv might call croak() */
20cec16a 1364 SV *olddiehook = diehook;
1738f5c4
CS
1365 ENTER;
1366 SAVESPTR(diehook);
1367 diehook = Nullsv;
20cec16a 1368 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1738f5c4
CS
1369 LEAVE;
1370 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
20cec16a 1371 dSP;
774d564b
PP
1372 SV *msg;
1373
1374 ENTER;
1375 msg = newSVpv(message, 0);
1376 SvREADONLY_on(msg);
1377 SAVEFREESV(msg);
20cec16a
PP
1378
1379 PUSHMARK(sp);
1738f5c4 1380 XPUSHs(msg);
20cec16a
PP
1381 PUTBACK;
1382 perl_call_sv((SV*)cv, G_DISCARD);
36477c24 1383
774d564b 1384 LEAVE;
20cec16a 1385 }
748a9306 1386 }
a0d0e21e
LW
1387 if (in_eval) {
1388 restartop = die_where(message);
54310121 1389 JMPENV_JUMP(3);
a0d0e21e 1390 }
760ac839
LW
1391 PerlIO_puts(PerlIO_stderr(),message);
1392 (void)PerlIO_flush(PerlIO_stderr());
f86702cc 1393 my_failure_exit();
a687059c
LW
1394}
1395
8990e307 1396void
ecfc5424 1397#ifdef I_STDARG
71be2cbc 1398warn(const char* pat,...)
463ee0b2 1399#else
8990e307
LW
1400/*VARARGS0*/
1401warn(pat,va_alist)
71be2cbc 1402 const char *pat;
8990e307 1403 va_dcl
463ee0b2 1404#endif
a687059c
LW
1405{
1406 va_list args;
de3bb511 1407 char *message;
748a9306
LW
1408 HV *stash;
1409 GV *gv;
1410 CV *cv;
a687059c 1411
a0d0e21e 1412#ifdef I_STDARG
8990e307
LW
1413 va_start(args, pat);
1414#else
a687059c 1415 va_start(args);
8990e307 1416#endif
2304df62 1417 message = mess(pat, &args);
a687059c
LW
1418 va_end(args);
1419
20cec16a 1420 if (warnhook) {
1738f5c4 1421 /* sv_2cv might call warn() */
11343788 1422 dTHR;
20cec16a 1423 SV *oldwarnhook = warnhook;
1738f5c4
CS
1424 ENTER;
1425 SAVESPTR(warnhook);
1426 warnhook = Nullsv;
20cec16a 1427 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1738f5c4
CS
1428 LEAVE;
1429 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
20cec16a 1430 dSP;
774d564b
PP
1431 SV *msg;
1432
1433 ENTER;
1434 msg = newSVpv(message, 0);
1435 SvREADONLY_on(msg);
1436 SAVEFREESV(msg);
1437
20cec16a 1438 PUSHMARK(sp);
774d564b 1439 XPUSHs(msg);
20cec16a
PP
1440 PUTBACK;
1441 perl_call_sv((SV*)cv, G_DISCARD);
774d564b
PP
1442
1443 LEAVE;
20cec16a
PP
1444 return;
1445 }
748a9306 1446 }
20cec16a 1447 PerlIO_puts(PerlIO_stderr(),message);
a687059c 1448#ifdef LEAKTEST
8c52afec
IZ
1449 DEBUG_L(*message == '!'
1450 ? (xstat(message[1]=='!'
1451 ? (message[2]=='!' ? 2 : 1)
1452 : 0)
1453 , 0)
1454 : 0);
a687059c 1455#endif
20cec16a 1456 (void)PerlIO_flush(PerlIO_stderr());
a687059c 1457}
8d063cd8 1458
a0d0e21e 1459#ifndef VMS /* VMS' my_setenv() is in VMS.c */
3e3baf6d 1460#ifndef WIN32
8d063cd8 1461void
8ac85365 1462my_setenv(char *nam, char *val)
8d063cd8 1463{
79072805 1464 register I32 i=setenv_getix(nam); /* where does it go? */
8d063cd8 1465
fe14fcc3 1466 if (environ == origenviron) { /* need we copy environment? */
79072805
LW
1467 I32 j;
1468 I32 max;
fe14fcc3
LW
1469 char **tmpenv;
1470
de3bb511 1471 /*SUPPRESS 530*/
fe14fcc3
LW
1472 for (max = i; environ[max]; max++) ;
1473 New(901,tmpenv, max+2, char*);
1474 for (j=0; j<max; j++) /* copy environment */
a0d0e21e 1475 tmpenv[j] = savepv(environ[j]);
fe14fcc3
LW
1476 tmpenv[max] = Nullch;
1477 environ = tmpenv; /* tell exec where it is now */
1478 }
a687059c 1479 if (!val) {
e5ebf479 1480 Safefree(environ[i]);
a687059c
LW
1481 while (environ[i]) {
1482 environ[i] = environ[i+1];
1483 i++;
1484 }
1485 return;
1486 }
8d063cd8 1487 if (!environ[i]) { /* does not exist yet */
fe14fcc3 1488 Renew(environ, i+2, char*); /* just expand it a bit */
8d063cd8
LW
1489 environ[i+1] = Nullch; /* make sure it's null terminated */
1490 }
fe14fcc3
LW
1491 else
1492 Safefree(environ[i]);
a687059c 1493 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
62b28dd9 1494#ifndef MSDOS
a687059c 1495 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
62b28dd9
LW
1496#else
1497 /* MS-DOS requires environment variable names to be in uppercase */
fe14fcc3
LW
1498 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1499 * some utilities and applications may break because they only look
1500 * for upper case strings. (Fixed strupr() bug here.)]
1501 */
1502 strcpy(environ[i],nam); strupr(environ[i]);
62b28dd9
LW
1503 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1504#endif /* MSDOS */
8d063cd8
LW
1505}
1506
3e3baf6d 1507#else /* if WIN32 */
68dc0745
PP
1508
1509void
4e35701f 1510my_setenv(char *nam,char *val)
68dc0745 1511{
3e3baf6d
TB
1512
1513#ifdef USE_WIN32_RTL_ENV
1514
68dc0745
PP
1515 register char *envstr;
1516 STRLEN namlen = strlen(nam);
3e3baf6d
TB
1517 STRLEN vallen;
1518 char *oldstr = environ[setenv_getix(nam)];
1519
1520 /* putenv() has totally broken semantics in both the Borland
1521 * and Microsoft CRTLs. They either store the passed pointer in
1522 * the environment without making a copy, or make a copy and don't
1523 * free it. And on top of that, they dont free() old entries that
1524 * are being replaced/deleted. This means the caller must
1525 * free any old entries somehow, or we end up with a memory
1526 * leak every time my_setenv() is called. One might think
1527 * one could directly manipulate environ[], like the UNIX code
1528 * above, but direct changes to environ are not allowed when
1529 * calling putenv(), since the RTLs maintain an internal
1530 * *copy* of environ[]. Bad, bad, *bad* stink.
1531 * GSAR 97-06-07
1532 */
68dc0745 1533
3e3baf6d
TB
1534 if (!val) {
1535 if (!oldstr)
1536 return;
1537 val = "";
1538 vallen = 0;
1539 }
1540 else
1541 vallen = strlen(val);
fc36a67e 1542 New(904, envstr, namlen + vallen + 3, char);
68dc0745 1543 (void)sprintf(envstr,"%s=%s",nam,val);
5fd9e9a4 1544 (void)PerlEnv_putenv(envstr);
3e3baf6d
TB
1545 if (oldstr)
1546 Safefree(oldstr);
1547#ifdef _MSC_VER
1548 Safefree(envstr); /* MSVCRT leaks without this */
1549#endif
1550
1551#else /* !USE_WIN32_RTL_ENV */
1552
1553 /* The sane way to deal with the environment.
1554 * Has these advantages over putenv() & co.:
1555 * * enables us to store a truly empty value in the
1556 * environment (like in UNIX).
1557 * * we don't have to deal with RTL globals, bugs and leaks.
1558 * * Much faster.
1559 * Why you may want to enable USE_WIN32_RTL_ENV:
1560 * * environ[] and RTL functions will not reflect changes,
1561 * which might be an issue if extensions want to access
1562 * the env. via RTL. This cuts both ways, since RTL will
1563 * not see changes made by extensions that call the Win32
1564 * functions directly, either.
1565 * GSAR 97-06-07
1566 */
1567 SetEnvironmentVariable(nam,val);
1568
1569#endif
1570}
1571
1572#endif /* WIN32 */
1573
1574I32
8ac85365 1575setenv_getix(char *nam)
3e3baf6d
TB
1576{
1577 register I32 i, len = strlen(nam);
1578
1579 for (i = 0; environ[i]; i++) {
1580 if (
1581#ifdef WIN32
1582 strnicmp(environ[i],nam,len) == 0
1583#else
1584 strnEQ(environ[i],nam,len)
1585#endif
1586 && environ[i][len] == '=')
1587 break; /* strnEQ must come first to avoid */
1588 } /* potential SEGV's */
1589 return i;
68dc0745
PP
1590}
1591
a0d0e21e 1592#endif /* !VMS */
378cc40b 1593
16d20bd9 1594#ifdef UNLINK_ALL_VERSIONS
79072805 1595I32
378cc40b
LW
1596unlnk(f) /* unlink all versions of a file */
1597char *f;
1598{
79072805 1599 I32 i;
378cc40b 1600
3028581b 1601 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
378cc40b
LW
1602 return i ? 0 : -1;
1603}
1604#endif
1605
85e6fe83 1606#if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
378cc40b 1607char *
4e35701f 1608my_bcopy(register char *from,register char *to,register I32 len)
378cc40b
LW
1609{
1610 char *retval = to;
1611
7c0587c8
LW
1612 if (from - to >= 0) {
1613 while (len--)
1614 *to++ = *from++;
1615 }
1616 else {
1617 to += len;
1618 from += len;
1619 while (len--)
faf8582f 1620 *(--to) = *(--from);
7c0587c8 1621 }
378cc40b
LW
1622 return retval;
1623}
ffed7fef 1624#endif
378cc40b 1625
fc36a67e
PP
1626#ifndef HAS_MEMSET
1627void *
1628my_memset(loc,ch,len)
1629register char *loc;
1630register I32 ch;
1631register I32 len;
1632{
1633 char *retval = loc;
1634
1635 while (len--)
1636 *loc++ = ch;
1637 return retval;
1638}
1639#endif
1640
7c0587c8 1641#if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
378cc40b 1642char *
7c0587c8 1643my_bzero(loc,len)
378cc40b 1644register char *loc;
79072805 1645register I32 len;
378cc40b
LW
1646{
1647 char *retval = loc;
1648
1649 while (len--)
1650 *loc++ = 0;
1651 return retval;
1652}
1653#endif
7c0587c8 1654
36477c24 1655#if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
79072805 1656I32
7c0587c8 1657my_memcmp(s1,s2,len)
36477c24
PP
1658char *s1;
1659char *s2;
79072805 1660register I32 len;
7c0587c8 1661{
36477c24
PP
1662 register U8 *a = (U8 *)s1;
1663 register U8 *b = (U8 *)s2;
79072805 1664 register I32 tmp;
7c0587c8
LW
1665
1666 while (len--) {
36477c24 1667 if (tmp = *a++ - *b++)
7c0587c8
LW
1668 return tmp;
1669 }
1670 return 0;
1671}
36477c24 1672#endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
a687059c 1673
4633a7c4 1674#if defined(I_STDARG) || defined(I_VARARGS)
fe14fcc3 1675#ifndef HAS_VPRINTF
a687059c 1676
85e6fe83 1677#ifdef USE_CHAR_VSPRINTF
a687059c
LW
1678char *
1679#else
1680int
1681#endif
1682vsprintf(dest, pat, args)
71be2cbc
PP
1683char *dest;
1684const char *pat;
1685char *args;
a687059c
LW
1686{
1687 FILE fakebuf;
1688
1689 fakebuf._ptr = dest;
1690 fakebuf._cnt = 32767;
35c8bce7
LW
1691#ifndef _IOSTRG
1692#define _IOSTRG 0
1693#endif
a687059c
LW
1694 fakebuf._flag = _IOWRT|_IOSTRG;
1695 _doprnt(pat, args, &fakebuf); /* what a kludge */
1696 (void)putc('\0', &fakebuf);
85e6fe83 1697#ifdef USE_CHAR_VSPRINTF
a687059c
LW
1698 return(dest);
1699#else
1700 return 0; /* perl doesn't use return value */
1701#endif
1702}
1703
fe14fcc3 1704#endif /* HAS_VPRINTF */
4633a7c4 1705#endif /* I_VARARGS || I_STDARGS */
a687059c
LW
1706
1707#ifdef MYSWAP
ffed7fef 1708#if BYTEORDER != 0x4321
a687059c 1709short
748a9306 1710my_swap(short s)
a687059c
LW
1711{
1712#if (BYTEORDER & 1) == 0
1713 short result;
1714
1715 result = ((s & 255) << 8) + ((s >> 8) & 255);
1716 return result;
1717#else
1718 return s;
1719#endif
1720}
1721
1722long
748a9306 1723my_htonl(long l)
a687059c
LW
1724{
1725 union {
1726 long result;
ffed7fef 1727 char c[sizeof(long)];
a687059c
LW
1728 } u;
1729
ffed7fef 1730#if BYTEORDER == 0x1234
a687059c
LW
1731 u.c[0] = (l >> 24) & 255;
1732 u.c[1] = (l >> 16) & 255;
1733 u.c[2] = (l >> 8) & 255;
1734 u.c[3] = l & 255;
1735 return u.result;
1736#else
ffed7fef 1737#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
463ee0b2 1738 croak("Unknown BYTEORDER\n");
a687059c 1739#else
79072805
LW
1740 register I32 o;
1741 register I32 s;
a687059c 1742
ffed7fef
LW
1743 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1744 u.c[o & 0xf] = (l >> s) & 255;
a687059c
LW
1745 }
1746 return u.result;
1747#endif
1748#endif
1749}
1750
1751long
748a9306 1752my_ntohl(long l)
a687059c
LW
1753{
1754 union {
1755 long l;
ffed7fef 1756 char c[sizeof(long)];
a687059c
LW
1757 } u;
1758
ffed7fef 1759#if BYTEORDER == 0x1234
a687059c
LW
1760 u.c[0] = (l >> 24) & 255;
1761 u.c[1] = (l >> 16) & 255;
1762 u.c[2] = (l >> 8) & 255;
1763 u.c[3] = l & 255;
1764 return u.l;
1765#else
ffed7fef 1766#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
463ee0b2 1767 croak("Unknown BYTEORDER\n");
a687059c 1768#else
79072805
LW
1769 register I32 o;
1770 register I32 s;
a687059c
LW
1771
1772 u.l = l;
1773 l = 0;
ffed7fef
LW
1774 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1775 l |= (u.c[o & 0xf] & 255) << s;
a687059c
LW
1776 }
1777 return l;
1778#endif
1779#endif
1780}
1781
ffed7fef 1782#endif /* BYTEORDER != 0x4321 */
988174c1
LW
1783#endif /* MYSWAP */
1784
1785/*
1786 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1787 * If these functions are defined,
1788 * the BYTEORDER is neither 0x1234 nor 0x4321.
1789 * However, this is not assumed.
1790 * -DWS
1791 */
1792
1793#define HTOV(name,type) \
1794 type \
1795 name (n) \
1796 register type n; \
1797 { \
1798 union { \
1799 type value; \
1800 char c[sizeof(type)]; \
1801 } u; \
79072805
LW
1802 register I32 i; \
1803 register I32 s; \
988174c1
LW
1804 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1805 u.c[i] = (n >> s) & 0xFF; \
1806 } \
1807 return u.value; \
1808 }
1809
1810#define VTOH(name,type) \
1811 type \
1812 name (n) \
1813 register type n; \
1814 { \
1815 union { \
1816 type value; \
1817 char c[sizeof(type)]; \
1818 } u; \
79072805
LW
1819 register I32 i; \
1820 register I32 s; \
988174c1
LW
1821 u.value = n; \
1822 n = 0; \
1823 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1824 n += (u.c[i] & 0xFF) << s; \
1825 } \
1826 return n; \
1827 }
1828
1829#if defined(HAS_HTOVS) && !defined(htovs)
1830HTOV(htovs,short)
1831#endif
1832#if defined(HAS_HTOVL) && !defined(htovl)
1833HTOV(htovl,long)
1834#endif
1835#if defined(HAS_VTOHS) && !defined(vtohs)
1836VTOH(vtohs,short)
1837#endif
1838#if defined(HAS_VTOHL) && !defined(vtohl)
1839VTOH(vtohl,long)
1840#endif
a687059c 1841
5f05dabc
PP
1842 /* VMS' my_popen() is in VMS.c, same with OS/2. */
1843#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
760ac839 1844PerlIO *
8ac85365 1845my_popen(char *cmd, char *mode)
a687059c
LW
1846{
1847 int p[2];
8ac85365 1848 register I32 This, that;
79072805
LW
1849 register I32 pid;
1850 SV *sv;
1738f5c4 1851 I32 doexec = strNE(cmd,"-");
a687059c 1852
ddcf38b7
IZ
1853#ifdef OS2
1854 if (doexec) {
1855 return my_syspopen(cmd,mode);
1856 }
1857#endif
3028581b 1858 if (PerlProc_pipe(p) < 0)
a687059c 1859 return Nullfp;
8ac85365
NIS
1860 This = (*mode == 'w');
1861 that = !This;
bbce6d69
PP
1862 if (doexec && tainting) {
1863 taint_env();
1864 taint_proper("Insecure %s%s", "EXEC");
d48672a2 1865 }
a687059c
LW
1866 while ((pid = (doexec?vfork():fork())) < 0) {
1867 if (errno != EAGAIN) {
3028581b 1868 PerlLIO_close(p[This]);
a687059c 1869 if (!doexec)
463ee0b2 1870 croak("Can't fork");
a687059c
LW
1871 return Nullfp;
1872 }
1873 sleep(5);
1874 }
1875 if (pid == 0) {
79072805
LW
1876 GV* tmpgv;
1877
a687059c 1878#define THIS that
8ac85365 1879#define THAT This
3028581b 1880 PerlLIO_close(p[THAT]);
a687059c 1881 if (p[THIS] != (*mode == 'r')) {
3028581b
GS
1882 PerlLIO_dup2(p[THIS], *mode == 'r');
1883 PerlLIO_close(p[THIS]);
a687059c
LW
1884 }
1885 if (doexec) {
a0d0e21e 1886#if !defined(HAS_FCNTL) || !defined(F_SETFD)
ae986130
LW
1887 int fd;
1888
1889#ifndef NOFILE
1890#define NOFILE 20
1891#endif
d48672a2 1892 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
3028581b 1893 PerlLIO_close(fd);
ae986130 1894#endif
a687059c 1895 do_exec(cmd); /* may or may not use the shell */
3028581b 1896 PerlProc__exit(1);
a687059c 1897 }
de3bb511 1898 /*SUPPRESS 560*/
85e6fe83 1899 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1e422769 1900 sv_setiv(GvSV(tmpgv), (IV)getpid());
9f68db38 1901 forkprocess = 0;
463ee0b2 1902 hv_clear(pidstatus); /* we have no children */
a687059c
LW
1903 return Nullfp;
1904#undef THIS
1905#undef THAT
1906 }
62b28dd9 1907 do_execfree(); /* free any memory malloced by child on vfork */
3028581b 1908 PerlLIO_close(p[that]);
8ac85365 1909 if (p[that] < p[This]) {
3028581b
GS
1910 PerlLIO_dup2(p[This], p[that]);
1911 PerlLIO_close(p[This]);
8ac85365 1912 p[This] = p[that];
62b28dd9 1913 }
8ac85365 1914 sv = *av_fetch(fdpid,p[This],TRUE);
a0d0e21e 1915 (void)SvUPGRADE(sv,SVt_IV);
463ee0b2 1916 SvIVX(sv) = pid;
a687059c 1917 forkprocess = pid;
8ac85365 1918 return PerlIO_fdopen(p[This], mode);
a687059c 1919}
7c0587c8 1920#else
55497cff 1921#if defined(atarist) || defined(DJGPP)
7c0587c8 1922FILE *popen();
760ac839 1923PerlIO *
79072805 1924my_popen(cmd,mode)
7c0587c8
LW
1925char *cmd;
1926char *mode;
1927{
760ac839 1928 /* Needs work for PerlIO ! */
55497cff
PP
1929 /* used 0 for 2nd parameter to PerlIO-exportFILE; apparently not used */
1930 return popen(PerlIO_exportFILE(cmd, 0), mode);
7c0587c8
LW
1931}
1932#endif
1933
1934#endif /* !DOSISH */
a687059c 1935
748a9306 1936#ifdef DUMP_FDS
79072805 1937dump_fds(s)
ae986130
LW
1938char *s;
1939{
1940 int fd;
1941 struct stat tmpstatbuf;
1942
760ac839 1943 PerlIO_printf(PerlIO_stderr(),"%s", s);
ae986130 1944 for (fd = 0; fd < 32; fd++) {
3028581b 1945 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
760ac839 1946 PerlIO_printf(PerlIO_stderr()," %d",fd);
ae986130 1947 }
760ac839 1948 PerlIO_printf(PerlIO_stderr(),"\n");
ae986130
LW
1949}
1950#endif
1951
fe14fcc3 1952#ifndef HAS_DUP2
fec02dd3 1953int
a687059c
LW
1954dup2(oldfd,newfd)
1955int oldfd;
1956int newfd;
1957{
a0d0e21e 1958#if defined(HAS_FCNTL) && defined(F_DUPFD)
fec02dd3
AD
1959 if (oldfd == newfd)
1960 return oldfd;
3028581b 1961 PerlLIO_close(newfd);
fec02dd3 1962 return fcntl(oldfd, F_DUPFD, newfd);
62b28dd9 1963#else
fc36a67e
PP
1964#define DUP2_MAX_FDS 256
1965 int fdtmp[DUP2_MAX_FDS];
79072805 1966 I32 fdx = 0;
ae986130
LW
1967 int fd;
1968
fe14fcc3 1969 if (oldfd == newfd)
fec02dd3 1970 return oldfd;
3028581b 1971 PerlLIO_close(newfd);
fc36a67e 1972 /* good enough for low fd's... */
3028581b 1973 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
fc36a67e 1974 if (fdx >= DUP2_MAX_FDS) {
3028581b 1975 PerlLIO_close(fd);
fc36a67e
PP
1976 fd = -1;
1977 break;
1978 }
ae986130 1979 fdtmp[fdx++] = fd;
fc36a67e 1980 }
ae986130 1981 while (fdx > 0)
3028581b 1982 PerlLIO_close(fdtmp[--fdx]);
fec02dd3 1983 return fd;
62b28dd9 1984#endif
a687059c
LW
1985}
1986#endif
1987
ff68c719
PP
1988
1989#ifdef HAS_SIGACTION
1990
1991Sighandler_t
8ac85365 1992rsignal(int signo, Sighandler_t handler)
ff68c719
PP
1993{
1994 struct sigaction act, oact;
1995
1996 act.sa_handler = handler;
1997 sigemptyset(&act.sa_mask);
1998 act.sa_flags = 0;
1999#ifdef SA_RESTART
2000 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2001#endif
2002 if (sigaction(signo, &act, &oact) == -1)
36477c24 2003 return SIG_ERR;
ff68c719 2004 else
36477c24 2005 return oact.sa_handler;
ff68c719
PP
2006}
2007
2008Sighandler_t
8ac85365 2009rsignal_state(int signo)
ff68c719
PP
2010{
2011 struct sigaction oact;
2012
2013 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2014 return SIG_ERR;
2015 else
2016 return oact.sa_handler;
2017}
2018
2019int
8ac85365 2020rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719
PP
2021{
2022 struct sigaction act;
2023
2024 act.sa_handler = handler;
2025 sigemptyset(&act.sa_mask);
2026 act.sa_flags = 0;
2027#ifdef SA_RESTART
2028 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2029#endif
2030 return sigaction(signo, &act, save);
2031}
2032
2033int
8ac85365 2034rsignal_restore(int signo, Sigsave_t *save)
ff68c719
PP
2035{
2036 return sigaction(signo, save, (struct sigaction *)NULL);
2037}
2038
2039#else /* !HAS_SIGACTION */
2040
2041Sighandler_t
4e35701f 2042rsignal(int signo, Sighandler_t handler)
ff68c719 2043{
3028581b 2044 return PerlProc_signal(signo, handler);
ff68c719
PP
2045}
2046
2047static int sig_trapped;
2048
2049static
2050Signal_t
4e35701f 2051sig_trap(int signo)
ff68c719
PP
2052{
2053 sig_trapped++;
2054}
2055
2056Sighandler_t
4e35701f 2057rsignal_state(int signo)
ff68c719
PP
2058{
2059 Sighandler_t oldsig;
2060
2061 sig_trapped = 0;
3028581b
GS
2062 oldsig = PerlProc_signal(signo, sig_trap);
2063 PerlProc_signal(signo, oldsig);
ff68c719 2064 if (sig_trapped)
3028581b 2065 PerlProc_kill(getpid(), signo);
ff68c719
PP
2066 return oldsig;
2067}
2068
2069int
4e35701f 2070rsignal_save(int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2071{
3028581b 2072 *save = PerlProc_signal(signo, handler);
ff68c719
PP
2073 return (*save == SIG_ERR) ? -1 : 0;
2074}
2075
2076int
4e35701f 2077rsignal_restore(int signo, Sigsave_t *save)
ff68c719 2078{
3028581b 2079 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
ff68c719
PP
2080}
2081
2082#endif /* !HAS_SIGACTION */
2083
5f05dabc
PP
2084 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
2085#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS)
79072805 2086I32
6acef3b7 2087my_pclose(PerlIO *ptr)
a687059c 2088{
ff68c719 2089 Sigsave_t hstat, istat, qstat;
a687059c 2090 int status;
a0d0e21e 2091 SV **svp;
20188a90 2092 int pid;
03136e13
CS
2093 bool close_failed;
2094 int saved_errno;
2095#ifdef VMS
2096 int saved_vaxc_errno;
2097#endif
22fae026
TM
2098#ifdef WIN32
2099 int saved_win32_errno;
2100#endif
a687059c 2101
760ac839 2102 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
748a9306 2103 pid = (int)SvIVX(*svp);
a0d0e21e
LW
2104 SvREFCNT_dec(*svp);
2105 *svp = &sv_undef;
ddcf38b7
IZ
2106#ifdef OS2
2107 if (pid == -1) { /* Opened by popen. */
2108 return my_syspclose(ptr);
2109 }
2110#endif
03136e13
CS
2111 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2112 saved_errno = errno;
2113#ifdef VMS
2114 saved_vaxc_errno = vaxc$errno;
2115#endif
22fae026
TM
2116#ifdef WIN32
2117 saved_win32_errno = GetLastError();
2118#endif
03136e13 2119 }
7c0587c8 2120#ifdef UTS
3028581b 2121 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
7c0587c8 2122#endif
ff68c719
PP
2123 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2124 rsignal_save(SIGINT, SIG_IGN, &istat);
2125 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
748a9306
LW
2126 do {
2127 pid = wait4pid(pid, &status, 0);
2128 } while (pid == -1 && errno == EINTR);
ff68c719
PP
2129 rsignal_restore(SIGHUP, &hstat);
2130 rsignal_restore(SIGINT, &istat);
2131 rsignal_restore(SIGQUIT, &qstat);
03136e13
CS
2132 if (close_failed) {
2133 SETERRNO(saved_errno, saved_vaxc_errno);
2134 return -1;
2135 }
2136 return(pid < 0 ? pid : status == 0 ? 0 : (errno = 0, status));
20188a90 2137}
4633a7c4
LW
2138#endif /* !DOSISH */
2139
2d7a9237 2140#if !defined(DOSISH) || defined(OS2) || defined(WIN32)
79072805 2141I32
8ac85365 2142wait4pid(int pid, int *statusp, int flags)
20188a90 2143{
79072805
LW
2144 SV *sv;
2145 SV** svp;
fc36a67e 2146 char spid[TYPE_CHARS(int)];
20188a90
LW
2147
2148 if (!pid)
2149 return -1;
20188a90
LW
2150 if (pid > 0) {
2151 sprintf(spid, "%d", pid);
79072805
LW
2152 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
2153 if (svp && *svp != &sv_undef) {
463ee0b2 2154 *statusp = SvIVX(*svp);
748a9306 2155 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
20188a90
LW
2156 return pid;
2157 }
2158 }
2159 else {
79072805 2160 HE *entry;
20188a90 2161
79072805
LW
2162 hv_iterinit(pidstatus);
2163 if (entry = hv_iternext(pidstatus)) {
a0d0e21e 2164 pid = atoi(hv_iterkey(entry,(I32*)statusp));
79072805 2165 sv = hv_iterval(pidstatus,entry);
463ee0b2 2166 *statusp = SvIVX(sv);
20188a90 2167 sprintf(spid, "%d", pid);
748a9306 2168 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
20188a90
LW
2169 return pid;
2170 }
2171 }
79072805 2172#ifdef HAS_WAITPID
367f3c24
IZ
2173# ifdef HAS_WAITPID_RUNTIME
2174 if (!HAS_WAITPID_RUNTIME)
2175 goto hard_way;
2176# endif
79072805 2177 return waitpid(pid,statusp,flags);
367f3c24
IZ
2178#endif
2179#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
a0d0e21e 2180 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
367f3c24
IZ
2181#endif
2182#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2183 hard_way:
a0d0e21e
LW
2184 {
2185 I32 result;
2186 if (flags)
2187 croak("Can't do waitpid with flags");
2188 else {
2189 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
2190 pidgone(result,*statusp);
2191 if (result < 0)
2192 *statusp = -1;
2193 }
2194 return result;
a687059c
LW
2195 }
2196#endif
a687059c 2197}
2d7a9237 2198#endif /* !DOSISH || OS2 || WIN32 */
a687059c 2199
7c0587c8 2200void
de3bb511 2201/*SUPPRESS 590*/
8ac85365 2202pidgone(int pid, int status)
a687059c 2203{
79072805 2204 register SV *sv;
fc36a67e 2205 char spid[TYPE_CHARS(int)];
a687059c 2206
20188a90 2207 sprintf(spid, "%d", pid);
79072805 2208 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
a0d0e21e 2209 (void)SvUPGRADE(sv,SVt_IV);
463ee0b2 2210 SvIVX(sv) = status;
20188a90 2211 return;
a687059c
LW
2212}
2213
55497cff 2214#if defined(atarist) || defined(OS2) || defined(DJGPP)
7c0587c8 2215int pclose();
ddcf38b7
IZ
2216#ifdef HAS_FORK
2217int /* Cannot prototype with I32
2218 in os2ish.h. */
2219my_syspclose(ptr)
2220#else
79072805
LW
2221I32
2222my_pclose(ptr)
ddcf38b7 2223#endif
760ac839 2224PerlIO *ptr;
a687059c 2225{
760ac839
LW
2226 /* Needs work for PerlIO ! */
2227 FILE *f = PerlIO_findFILE(ptr);
2228 I32 result = pclose(f);
2229 PerlIO_releaseFILE(ptr,f);
2230 return result;
a687059c 2231}
7c0587c8 2232#endif
9f68db38
LW
2233
2234void
8ac85365 2235repeatcpy(register char *to, register char *from, I32 len, register I32 count)
9f68db38 2236{
79072805 2237 register I32 todo;
9f68db38
LW
2238 register char *frombase = from;
2239
2240 if (len == 1) {
2241 todo = *from;
2242 while (count-- > 0)
2243 *to++ = todo;
2244 return;
2245 }
2246 while (count-- > 0) {
2247 for (todo = len; todo > 0; todo--) {
2248 *to++ = *from++;
2249 }
2250 from = frombase;
2251 }
2252}
0f85fab0
LW
2253
2254#ifndef CASTNEGFLOAT
463ee0b2 2255U32
79072805 2256cast_ulong(f)
0f85fab0
LW
2257double f;
2258{
2259 long along;
2260
27e2fb84 2261#if CASTFLAGS & 2
34de22dd
LW
2262# define BIGDOUBLE 2147483648.0
2263 if (f >= BIGDOUBLE)
2264 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
2265#endif
0f85fab0
LW
2266 if (f >= 0.0)
2267 return (unsigned long)f;
2268 along = (long)f;
2269 return (unsigned long)along;
2270}
ed6116ce
LW
2271# undef BIGDOUBLE
2272#endif
2273
2274#ifndef CASTI32
5d94fbed 2275
5d94fbed
AD
2276/* Unfortunately, on some systems the cast_uv() function doesn't
2277 work with the system-supplied definition of ULONG_MAX. The
2278 comparison (f >= ULONG_MAX) always comes out true. It must be a
2279 problem with the compiler constant folding.
2280
2281 In any case, this workaround should be fine on any two's complement
2282 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
2283 ccflags.
2284 --Andy Dougherty <doughera@lafcol.lafayette.edu>
2285*/
1eb770ff
PP
2286
2287/* Code modified to prefer proper named type ranges, I32, IV, or UV, instead
2288 of LONG_(MIN/MAX).
2289 -- Kenneth Albanowski <kjahds@kjahds.com>
2290*/
2291
20cec16a
PP
2292#ifndef MY_UV_MAX
2293# define MY_UV_MAX ((UV)IV_MAX * (UV)2 + (UV)1)
5d94fbed
AD
2294#endif
2295
ed6116ce
LW
2296I32
2297cast_i32(f)
2298double f;
2299{
20cec16a
PP
2300 if (f >= I32_MAX)
2301 return (I32) I32_MAX;
2302 if (f <= I32_MIN)
2303 return (I32) I32_MIN;
ed6116ce
LW
2304 return (I32) f;
2305}
a0d0e21e
LW
2306
2307IV
2308cast_iv(f)
2309double f;
2310{
20cec16a
PP
2311 if (f >= IV_MAX)
2312 return (IV) IV_MAX;
2313 if (f <= IV_MIN)
2314 return (IV) IV_MIN;
a0d0e21e
LW
2315 return (IV) f;
2316}
5d94fbed
AD
2317
2318UV
2319cast_uv(f)
2320double f;
2321{
20cec16a
PP
2322 if (f >= MY_UV_MAX)
2323 return (UV) MY_UV_MAX;
5d94fbed
AD
2324 return (UV) f;
2325}
2326
0f85fab0 2327#endif
62b28dd9 2328
fe14fcc3 2329#ifndef HAS_RENAME
79072805 2330I32
62b28dd9
LW
2331same_dirent(a,b)
2332char *a;
2333char *b;
2334{
93a17b20
LW
2335 char *fa = strrchr(a,'/');
2336 char *fb = strrchr(b,'/');
62b28dd9
LW
2337 struct stat tmpstatbuf1;
2338 struct stat tmpstatbuf2;
46fc3d4c 2339 SV *tmpsv = sv_newmortal();
62b28dd9
LW
2340
2341 if (fa)
2342 fa++;
2343 else
2344 fa = a;
2345 if (fb)
2346 fb++;
2347 else
2348 fb = b;
2349 if (strNE(a,b))
2350 return FALSE;
2351 if (fa == a)
46fc3d4c 2352 sv_setpv(tmpsv, ".");
62b28dd9 2353 else
46fc3d4c
PP
2354 sv_setpvn(tmpsv, a, fa - a);
2355 if (Stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
62b28dd9
LW
2356 return FALSE;
2357 if (fb == b)
46fc3d4c 2358 sv_setpv(tmpsv, ".");
62b28dd9 2359 else
46fc3d4c
PP
2360 sv_setpvn(tmpsv, b, fb - b);
2361 if (Stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
62b28dd9
LW
2362 return FALSE;
2363 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2364 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2365}
fe14fcc3
LW
2366#endif /* !HAS_RENAME */
2367
55497cff 2368UV
8ac85365 2369scan_oct(char *start, I32 len, I32 *retlen)
fe14fcc3
LW
2370{
2371 register char *s = start;
55497cff
PP
2372 register UV retval = 0;
2373 bool overflowed = FALSE;
fe14fcc3 2374
748a9306 2375 while (len && *s >= '0' && *s <= '7') {
55497cff
PP
2376 register UV n = retval << 3;
2377 if (!overflowed && (n >> 3) != retval) {
2378 warn("Integer overflow in octal number");
2379 overflowed = TRUE;
2380 }
2381 retval = n | (*s++ - '0');
748a9306 2382 len--;
fe14fcc3 2383 }
748a9306
LW
2384 if (dowarn && len && (*s == '8' || *s == '9'))
2385 warn("Illegal octal digit ignored");
fe14fcc3
LW
2386 *retlen = s - start;
2387 return retval;
2388}
2389
71be2cbc 2390UV
8ac85365 2391scan_hex(char *start, I32 len, I32 *retlen)
fe14fcc3
LW
2392{
2393 register char *s = start;
55497cff
PP
2394 register UV retval = 0;
2395 bool overflowed = FALSE;
fe14fcc3
LW
2396 char *tmp;
2397
4e35701f 2398 while (len-- && *s && (tmp = strchr((char *) hexdigit, *s))) {
55497cff
PP
2399 register UV n = retval << 4;
2400 if (!overflowed && (n >> 4) != retval) {
2401 warn("Integer overflow in hex number");
2402 overflowed = TRUE;
2403 }
4e35701f 2404 retval = n | ((tmp - hexdigit) & 15);
fe14fcc3
LW
2405 s++;
2406 }
2407 *retlen = s - start;
2408 return retval;
2409}
760ac839 2410
11343788 2411#ifdef USE_THREADS
12ca11f6
MB
2412#ifdef FAKE_THREADS
2413/* Very simplistic scheduler for now */
2414void
2415schedule(void)
2416{
c7848ba1 2417 thr = thr->i.next_run;
12ca11f6
MB
2418}
2419
2420void
2421perl_cond_init(cp)
2422perl_cond *cp;
2423{
2424 *cp = 0;
2425}
2426
2427void
2428perl_cond_signal(cp)
2429perl_cond *cp;
2430{
51dd5992 2431 perl_os_thread t;
12ca11f6
MB
2432 perl_cond cond = *cp;
2433
2434 if (!cond)
2435 return;
2436 t = cond->thread;
2437 /* Insert t in the runnable queue just ahead of us */
c7848ba1
MB
2438 t->i.next_run = thr->i.next_run;
2439 thr->i.next_run->i.prev_run = t;
2440 t->i.prev_run = thr;
2441 thr->i.next_run = t;
2442 thr->i.wait_queue = 0;
12ca11f6
MB
2443 /* Remove from the wait queue */
2444 *cp = cond->next;
2445 Safefree(cond);
2446}
2447
2448void
2449perl_cond_broadcast(cp)
2450perl_cond *cp;
2451{
51dd5992 2452 perl_os_thread t;
12ca11f6
MB
2453 perl_cond cond, cond_next;
2454
2455 for (cond = *cp; cond; cond = cond_next) {
2456 t = cond->thread;
2457 /* Insert t in the runnable queue just ahead of us */
c7848ba1
MB
2458 t->i.next_run = thr->i.next_run;
2459 thr->i.next_run->i.prev_run = t;
2460 t->i.prev_run = thr;
2461 thr->i.next_run = t;
2462 thr->i.wait_queue = 0;
12ca11f6
MB
2463 /* Remove from the wait queue */
2464 cond_next = cond->next;
2465 Safefree(cond);
2466 }
2467 *cp = 0;
2468}
2469
2470void
2471perl_cond_wait(cp)
2472perl_cond *cp;
2473{
2474 perl_cond cond;
2475
c7848ba1 2476 if (thr->i.next_run == thr)
12ca11f6
MB
2477 croak("panic: perl_cond_wait called by last runnable thread");
2478
0f15f207 2479 New(666, cond, 1, struct perl_wait_queue);
12ca11f6
MB
2480 cond->thread = thr;
2481 cond->next = *cp;
2482 *cp = cond;
c7848ba1 2483 thr->i.wait_queue = cond;
12ca11f6 2484 /* Remove ourselves from runnable queue */
c7848ba1
MB
2485 thr->i.next_run->i.prev_run = thr->i.prev_run;
2486 thr->i.prev_run->i.next_run = thr->i.next_run;
12ca11f6
MB
2487}
2488#endif /* FAKE_THREADS */
2489
11343788 2490#ifdef OLD_PTHREADS_API
52e1cb5e 2491struct perl_thread *
11343788
MB
2492getTHR _((void))
2493{
2494 pthread_addr_t t;
2495
2496 if (pthread_getspecific(thr_key, &t))
2497 croak("panic: pthread_getspecific");
52e1cb5e 2498 return (struct perl_thread *) t;
11343788
MB
2499}
2500#endif /* OLD_PTHREADS_API */
f93b4edd
MB
2501
2502MAGIC *
8ac85365 2503condpair_magic(SV *sv)
f93b4edd
MB
2504{
2505 MAGIC *mg;
2506
2507 SvUPGRADE(sv, SVt_PVMG);
2508 mg = mg_find(sv, 'm');
2509 if (!mg) {
2510 condpair_t *cp;
2511
2512 New(53, cp, 1, condpair_t);
2513 MUTEX_INIT(&cp->mutex);
2514 COND_INIT(&cp->owner_cond);
2515 COND_INIT(&cp->cond);
2516 cp->owner = 0;
940cb80d 2517 LOCK_SV_MUTEX;
f93b4edd
MB
2518 mg = mg_find(sv, 'm');
2519 if (mg) {
2520 /* someone else beat us to initialising it */
940cb80d 2521 UNLOCK_SV_MUTEX;
f93b4edd
MB
2522 MUTEX_DESTROY(&cp->mutex);
2523 COND_DESTROY(&cp->owner_cond);
2524 COND_DESTROY(&cp->cond);
2525 Safefree(cp);
2526 }
2527 else {
2528 sv_magic(sv, Nullsv, 'm', 0, 0);
2529 mg = SvMAGIC(sv);
2530 mg->mg_ptr = (char *)cp;
2531 mg->mg_len = sizeof(cp);
940cb80d 2532 UNLOCK_SV_MUTEX;
bc1f4c86 2533 DEBUG_L(WITH_THR(PerlIO_printf(PerlIO_stderr(),
c7848ba1 2534 "%p: condpair_magic %p\n", thr, sv));)
f93b4edd
MB
2535 }
2536 }
2537 return mg;
2538}
a863c7d1
MB
2539
2540/*
199100c8
MB
2541 * Make a new perl thread structure using t as a prototype. Some of the
2542 * fields for the new thread are copied from the prototype thread, t,
2543 * so t should not be running in perl at the time this function is
2544 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2545 * thread calling new_struct_thread) clearly satisfies this constraint.
a863c7d1 2546 */
52e1cb5e
JH
2547struct perl_thread *
2548new_struct_thread(struct perl_thread *t)
a863c7d1 2549{
52e1cb5e 2550 struct perl_thread *thr;
a863c7d1 2551 SV *sv;
199100c8
MB
2552 SV **svp;
2553 I32 i;
2554
2555 sv = newSVpv("", 0);
52e1cb5e
JH
2556 SvGROW(sv, sizeof(struct perl_thread) + 1);
2557 SvCUR_set(sv, sizeof(struct perl_thread));
199100c8 2558 thr = (Thread) SvPVX(sv);
199100c8 2559 /* debug */
52e1cb5e 2560 memset(thr, 0xab, sizeof(struct perl_thread));
199100c8
MB
2561 markstack = 0;
2562 scopestack = 0;
2563 savestack = 0;
2564 retstack = 0;
2565 dirty = 0;
2566 localizing = 0;
2567 /* end debug */
2568
2569 thr->oursv = sv;
d55594ae 2570 init_stacks(ARGS);
a863c7d1 2571
a863c7d1 2572 curcop = &compiling;
199100c8 2573 thr->cvcache = newHV();
54b9620d 2574 thr->threadsv = newAV();
a863c7d1 2575 thr->specific = newAV();
38a03e6e
MB
2576 thr->errsv = newSVpv("", 0);
2577 thr->errhv = newHV();
a863c7d1
MB
2578 thr->flags = THRf_R_JOINABLE;
2579 MUTEX_INIT(&thr->mutex);
199100c8
MB
2580
2581 curcop = t->Tcurcop; /* XXX As good a guess as any? */
2582 defstash = t->Tdefstash; /* XXX maybe these should */
2583 curstash = t->Tcurstash; /* always be set to main? */
d55594ae
GS
2584
2585
2586 /* top_env needs to be non-zero. It points to an area
2587 in which longjmp() stuff is stored, as C callstack
2588 info there at least is thread specific this has to
2589 be per-thread. Otherwise a 'die' in a thread gives
2590 that thread the C stack of last thread to do an eval {}!
2591 See comments in scope.h
2592 Initialize top entry (as in perl.c for main thread)
2593 */
2594 start_env.je_prev = NULL;
2595 start_env.je_ret = -1;
2596 start_env.je_mustcatch = TRUE;
2597 top_env = &start_env;
2598
199100c8
MB
2599 in_eval = FALSE;
2600 restartop = 0;
2601
2602 tainted = t->Ttainted;
2603 curpm = t->Tcurpm; /* XXX No PMOP ref count */
2604 nrs = newSVsv(t->Tnrs);
2605 rs = newSVsv(t->Trs);
2606 last_in_gv = (GV*)SvREFCNT_inc(t->Tlast_in_gv);
2607 ofslen = t->Tofslen;
2608 ofs = savepvn(t->Tofs, ofslen);
2609 defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
2610 chopset = t->Tchopset;
2611 formtarget = newSVsv(t->Tformtarget);
2612 bodytarget = newSVsv(t->Tbodytarget);
2613 toptarget = newSVsv(t->Ttoptarget);
2614
54b9620d
MB
2615 /* Initialise all per-thread SVs that the template thread used */
2616 svp = AvARRAY(t->threadsv);
93965878 2617 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
199100c8
MB
2618 if (*svp && *svp != &sv_undef) {
2619 SV *sv = newSVsv(*svp);
54b9620d
MB
2620 av_store(thr->threadsv, i, sv);
2621 sv_magic(sv, 0, 0, &threadsv_names[i], 1);
199100c8 2622 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
54b9620d 2623 "new_struct_thread: copied threadsv %d %p->%p\n",i, t, thr));
199100c8
MB
2624 }
2625 }
940cb80d 2626 thr->threadsvp = AvARRAY(thr->threadsv);
199100c8 2627
a863c7d1
MB
2628 MUTEX_LOCK(&threads_mutex);
2629 nthreads++;
199100c8
MB
2630 thr->tid = ++threadnum;
2631 thr->next = t->next;
2632 thr->prev = t;
2633 t->next = thr;
2634 thr->next->prev = thr;
a863c7d1
MB
2635 MUTEX_UNLOCK(&threads_mutex);
2636
2637#ifdef HAVE_THREAD_INTERN
2638 init_thread_intern(thr);
a863c7d1 2639#endif /* HAVE_THREAD_INTERN */
a863c7d1
MB
2640 return thr;
2641}
11343788 2642#endif /* USE_THREADS */
760ac839
LW
2643
2644#ifdef HUGE_VAL
2645/*
2646 * This hack is to force load of "huge" support from libm.a
2647 * So it is in perl for (say) POSIX to use.
2648 * Needed for SunOS with Sun's 'acc' for example.
2649 */
2650double
8ac85365 2651Perl_huge(void)
760ac839
LW
2652{
2653 return HUGE_VAL;
2654}
2655#endif
4e35701f 2656
22239a37
NIS
2657#ifdef PERL_GLOBAL_STRUCT
2658struct perl_vars *
2659Perl_GetVars(void)
2660{
2661 return &Perl_Vars;
2662}
31fb1209
NIS
2663#endif
2664
2665char **
2666get_op_names(void)
2667{
2668 return op_name;
2669}
2670
2671char **
2672get_op_descs(void)
2673{
2674 return op_desc;
2675}