This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
remove unnecessary (always true) condition in S_vdie
[perl5.git] / util.c
CommitLineData
a0d0e21e 1/* util.c
a687059c 2 *
1129b882
NC
3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
4 * 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
a687059c 5 *
d48672a2
LW
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8d063cd8 8 *
8d063cd8 9 */
a0d0e21e
LW
10
11/*
4ac71550
TC
12 * 'Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content.' --Gandalf to Pippin
14 *
15 * [p.598 of _The Lord of the Rings_, III/xi: "The Palantír"]
a0d0e21e 16 */
8d063cd8 17
166f8a29
DM
18/* This file contains assorted utility routines.
19 * Which is a polite way of saying any stuff that people couldn't think of
20 * a better place for. Amongst other things, it includes the warning and
21 * dieing stuff, plus wrappers for malloc code.
22 */
23
8d063cd8 24#include "EXTERN.h"
864dbfa3 25#define PERL_IN_UTIL_C
8d063cd8 26#include "perl.h"
62b28dd9 27
64ca3a65 28#ifndef PERL_MICRO
a687059c 29#include <signal.h>
36477c24
PP
30#ifndef SIG_ERR
31# define SIG_ERR ((Sighandler_t) -1)
32#endif
64ca3a65 33#endif
36477c24 34
172d2248
OS
35#ifdef __Lynx__
36/* Missing protos on LynxOS */
37int putenv(char *);
38#endif
39
ff68c719
PP
40#ifdef I_SYS_WAIT
41# include <sys/wait.h>
42#endif
43
868439a2
JH
44#ifdef HAS_SELECT
45# ifdef I_SYS_SELECT
46# include <sys/select.h>
47# endif
48#endif
49
8d063cd8 50#define FLUSH
8d063cd8 51
16cebae2
GS
52#if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
53# define FD_CLOEXEC 1 /* NeXT needs this */
54#endif
55
a687059c
LW
56/* NOTE: Do not call the next three routines directly. Use the macros
57 * in handy.h, so that we can easily redefine everything to do tracking of
58 * allocated hunks back to the original New to track down any memory leaks.
20cec16a 59 * XXX This advice seems to be widely ignored :-( --AD August 1996.
a687059c
LW
60 */
61
ca8d8976
NC
62static char *
63S_write_no_mem(pTHX)
64{
97aff369 65 dVAR;
ca8d8976
NC
66 /* Can't use PerlIO to write as it allocates memory */
67 PerlLIO_write(PerlIO_fileno(Perl_error_log),
68 PL_no_mem, strlen(PL_no_mem));
69 my_exit(1);
1f440eb2 70 NORETURN_FUNCTION_END;
ca8d8976
NC
71}
72
26fa51c3
AMS
73/* paranoid version of system's malloc() */
74
bd4080b3 75Malloc_t
4f63d024 76Perl_safesysmalloc(MEM_SIZE size)
8d063cd8 77{
54aff467 78 dTHX;
bd4080b3 79 Malloc_t ptr;
55497cff 80#ifdef HAS_64K_LIMIT
62b28dd9 81 if (size > 0xffff) {
bf49b057 82 PerlIO_printf(Perl_error_log,
16cebae2 83 "Allocation too large: %lx\n", size) FLUSH;
54aff467 84 my_exit(1);
62b28dd9 85 }
55497cff 86#endif /* HAS_64K_LIMIT */
e8dda941
JD
87#ifdef PERL_TRACK_MEMPOOL
88 size += sTHX;
89#endif
34de22dd
LW
90#ifdef DEBUGGING
91 if ((long)size < 0)
4f63d024 92 Perl_croak_nocontext("panic: malloc");
34de22dd 93#endif
12ae5dfc 94 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
da927450 95 PERL_ALLOC_CHECK(ptr);
97835f67 96 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
bd61b366 97 if (ptr != NULL) {
e8dda941 98#ifdef PERL_TRACK_MEMPOOL
7cb608b5
NC
99 struct perl_memory_debug_header *const header
100 = (struct perl_memory_debug_header *)ptr;
9a083ecf
NC
101#endif
102
103#ifdef PERL_POISON
7e337ee0 104 PoisonNew(((char *)ptr), size, char);
9a083ecf 105#endif
7cb608b5 106
9a083ecf 107#ifdef PERL_TRACK_MEMPOOL
7cb608b5
NC
108 header->interpreter = aTHX;
109 /* Link us into the list. */
110 header->prev = &PL_memory_debug_header;
111 header->next = PL_memory_debug_header.next;
112 PL_memory_debug_header.next = header;
113 header->next->prev = header;
cd1541b2 114# ifdef PERL_POISON
7cb608b5 115 header->size = size;
cd1541b2 116# endif
e8dda941
JD
117 ptr = (Malloc_t)((char*)ptr+sTHX);
118#endif
8d063cd8 119 return ptr;
e8dda941 120}
3280af22 121 else if (PL_nomemok)
bd61b366 122 return NULL;
8d063cd8 123 else {
0bd48802 124 return write_no_mem();
8d063cd8
LW
125 }
126 /*NOTREACHED*/
127}
128
f2517201 129/* paranoid version of system's realloc() */
8d063cd8 130
bd4080b3 131Malloc_t
4f63d024 132Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
8d063cd8 133{
54aff467 134 dTHX;
bd4080b3 135 Malloc_t ptr;
9a34ef1d 136#if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
6ad3d225 137 Malloc_t PerlMem_realloc();
ecfc5424 138#endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
8d063cd8 139
a1d180c4 140#ifdef HAS_64K_LIMIT
5f05dabc 141 if (size > 0xffff) {
bf49b057 142 PerlIO_printf(Perl_error_log,
5f05dabc 143 "Reallocation too large: %lx\n", size) FLUSH;
54aff467 144 my_exit(1);
5f05dabc 145 }
55497cff 146#endif /* HAS_64K_LIMIT */
7614df0c 147 if (!size) {
f2517201 148 safesysfree(where);
7614df0c
JD
149 return NULL;
150 }
151
378cc40b 152 if (!where)
f2517201 153 return safesysmalloc(size);
e8dda941
JD
154#ifdef PERL_TRACK_MEMPOOL
155 where = (Malloc_t)((char*)where-sTHX);
156 size += sTHX;
7cb608b5
NC
157 {
158 struct perl_memory_debug_header *const header
159 = (struct perl_memory_debug_header *)where;
160
161 if (header->interpreter != aTHX) {
162 Perl_croak_nocontext("panic: realloc from wrong pool");
163 }
164 assert(header->next->prev == header);
165 assert(header->prev->next == header);
cd1541b2 166# ifdef PERL_POISON
7cb608b5
NC
167 if (header->size > size) {
168 const MEM_SIZE freed_up = header->size - size;
169 char *start_of_freed = ((char *)where) + size;
7e337ee0 170 PoisonFree(start_of_freed, freed_up, char);
7cb608b5
NC
171 }
172 header->size = size;
cd1541b2 173# endif
7cb608b5 174 }
e8dda941 175#endif
34de22dd
LW
176#ifdef DEBUGGING
177 if ((long)size < 0)
4f63d024 178 Perl_croak_nocontext("panic: realloc");
34de22dd 179#endif
12ae5dfc 180 ptr = (Malloc_t)PerlMem_realloc(where,size);
da927450 181 PERL_ALLOC_CHECK(ptr);
a1d180c4 182
4fd0a9b8
NC
183 /* MUST do this fixup first, before doing ANYTHING else, as anything else
184 might allocate memory/free/move memory, and until we do the fixup, it
185 may well be chasing (and writing to) free memory. */
e8dda941 186#ifdef PERL_TRACK_MEMPOOL
4fd0a9b8 187 if (ptr != NULL) {
7cb608b5
NC
188 struct perl_memory_debug_header *const header
189 = (struct perl_memory_debug_header *)ptr;
190
9a083ecf
NC
191# ifdef PERL_POISON
192 if (header->size < size) {
193 const MEM_SIZE fresh = size - header->size;
194 char *start_of_fresh = ((char *)ptr) + size;
7e337ee0 195 PoisonNew(start_of_fresh, fresh, char);
9a083ecf
NC
196 }
197# endif
198
7cb608b5
NC
199 header->next->prev = header;
200 header->prev->next = header;
201
e8dda941 202 ptr = (Malloc_t)((char*)ptr+sTHX);
4fd0a9b8 203 }
e8dda941 204#endif
4fd0a9b8
NC
205
206 /* In particular, must do that fixup above before logging anything via
207 *printf(), as it can reallocate memory, which can cause SEGVs. */
208
209 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
210 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
211
212
213 if (ptr != NULL) {
8d063cd8 214 return ptr;
e8dda941 215 }
3280af22 216 else if (PL_nomemok)
bd61b366 217 return NULL;
8d063cd8 218 else {
0bd48802 219 return write_no_mem();
8d063cd8
LW
220 }
221 /*NOTREACHED*/
222}
223
f2517201 224/* safe version of system's free() */
8d063cd8 225
54310121 226Free_t
4f63d024 227Perl_safesysfree(Malloc_t where)
8d063cd8 228{
e8dda941 229#if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL)
54aff467 230 dTHX;
97aff369
JH
231#else
232 dVAR;
155aba94 233#endif
97835f67 234 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
378cc40b 235 if (where) {
e8dda941
JD
236#ifdef PERL_TRACK_MEMPOOL
237 where = (Malloc_t)((char*)where-sTHX);
cd1541b2 238 {
7cb608b5
NC
239 struct perl_memory_debug_header *const header
240 = (struct perl_memory_debug_header *)where;
241
242 if (header->interpreter != aTHX) {
243 Perl_croak_nocontext("panic: free from wrong pool");
244 }
245 if (!header->prev) {
cd1541b2
NC
246 Perl_croak_nocontext("panic: duplicate free");
247 }
7cb608b5
NC
248 if (!(header->next) || header->next->prev != header
249 || header->prev->next != header) {
250 Perl_croak_nocontext("panic: bad free");
cd1541b2 251 }
7cb608b5
NC
252 /* Unlink us from the chain. */
253 header->next->prev = header->prev;
254 header->prev->next = header->next;
255# ifdef PERL_POISON
7e337ee0 256 PoisonNew(where, header->size, char);
cd1541b2 257# endif
7cb608b5
NC
258 /* Trigger the duplicate free warning. */
259 header->next = NULL;
260 }
e8dda941 261#endif
6ad3d225 262 PerlMem_free(where);
378cc40b 263 }
8d063cd8
LW
264}
265
f2517201 266/* safe version of system's calloc() */
1050c9ca 267
bd4080b3 268Malloc_t
4f63d024 269Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
1050c9ca 270{
54aff467 271 dTHX;
bd4080b3 272 Malloc_t ptr;
ad7244db 273 MEM_SIZE total_size = 0;
1050c9ca 274
ad7244db 275 /* Even though calloc() for zero bytes is strange, be robust. */
19a94d75 276 if (size && (count <= MEM_SIZE_MAX / size))
ad7244db
JH
277 total_size = size * count;
278 else
f1f66076 279 Perl_croak_nocontext("%s", PL_memory_wrap);
ad7244db 280#ifdef PERL_TRACK_MEMPOOL
19a94d75 281 if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size)
ad7244db
JH
282 total_size += sTHX;
283 else
f1f66076 284 Perl_croak_nocontext("%s", PL_memory_wrap);
ad7244db 285#endif
55497cff 286#ifdef HAS_64K_LIMIT
e1a95402 287 if (total_size > 0xffff) {
bf49b057 288 PerlIO_printf(Perl_error_log,
e1a95402 289 "Allocation too large: %lx\n", total_size) FLUSH;
54aff467 290 my_exit(1);
5f05dabc 291 }
55497cff 292#endif /* HAS_64K_LIMIT */
1050c9ca
PP
293#ifdef DEBUGGING
294 if ((long)size < 0 || (long)count < 0)
4f63d024 295 Perl_croak_nocontext("panic: calloc");
1050c9ca 296#endif
e8dda941 297#ifdef PERL_TRACK_MEMPOOL
e1a95402
NC
298 /* Have to use malloc() because we've added some space for our tracking
299 header. */
ad7244db
JH
300 /* malloc(0) is non-portable. */
301 ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1);
e1a95402
NC
302#else
303 /* Use calloc() because it might save a memset() if the memory is fresh
304 and clean from the OS. */
ad7244db
JH
305 if (count && size)
306 ptr = (Malloc_t)PerlMem_calloc(count, size);
307 else /* calloc(0) is non-portable. */
308 ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1);
e8dda941 309#endif
da927450 310 PERL_ALLOC_CHECK(ptr);
e1a95402 311 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)total_size));
bd61b366 312 if (ptr != NULL) {
e8dda941 313#ifdef PERL_TRACK_MEMPOOL
7cb608b5
NC
314 {
315 struct perl_memory_debug_header *const header
316 = (struct perl_memory_debug_header *)ptr;
317
e1a95402 318 memset((void*)ptr, 0, total_size);
7cb608b5
NC
319 header->interpreter = aTHX;
320 /* Link us into the list. */
321 header->prev = &PL_memory_debug_header;
322 header->next = PL_memory_debug_header.next;
323 PL_memory_debug_header.next = header;
324 header->next->prev = header;
cd1541b2 325# ifdef PERL_POISON
e1a95402 326 header->size = total_size;
cd1541b2 327# endif
7cb608b5
NC
328 ptr = (Malloc_t)((char*)ptr+sTHX);
329 }
e8dda941 330#endif
1050c9ca
PP
331 return ptr;
332 }
3280af22 333 else if (PL_nomemok)
bd61b366 334 return NULL;
0bd48802 335 return write_no_mem();
1050c9ca
PP
336}
337
cae6d0e5
GS
338/* These must be defined when not using Perl's malloc for binary
339 * compatibility */
340
341#ifndef MYMALLOC
342
343Malloc_t Perl_malloc (MEM_SIZE nbytes)
344{
345 dTHXs;
077a72a9 346 return (Malloc_t)PerlMem_malloc(nbytes);
cae6d0e5
GS
347}
348
349Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
350{
351 dTHXs;
077a72a9 352 return (Malloc_t)PerlMem_calloc(elements, size);
cae6d0e5
GS
353}
354
355Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
356{
357 dTHXs;
077a72a9 358 return (Malloc_t)PerlMem_realloc(where, nbytes);
cae6d0e5
GS
359}
360
361Free_t Perl_mfree (Malloc_t where)
362{
363 dTHXs;
364 PerlMem_free(where);
365}
366
367#endif
368
8d063cd8
LW
369/* copy a string up to some (non-backslashed) delimiter, if any */
370
371char *
04c9e624 372Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
8d063cd8 373{
fc36a67e 374 register I32 tolen;
35da51f7 375
7918f24d
NC
376 PERL_ARGS_ASSERT_DELIMCPY;
377
fc36a67e 378 for (tolen = 0; from < fromend; from++, tolen++) {
378cc40b 379 if (*from == '\\') {
35da51f7 380 if (from[1] != delim) {
fc36a67e
PP
381 if (to < toend)
382 *to++ = *from;
383 tolen++;
fc36a67e 384 }
35da51f7 385 from++;
378cc40b 386 }
bedebaa5 387 else if (*from == delim)
8d063cd8 388 break;
fc36a67e
PP
389 if (to < toend)
390 *to++ = *from;
8d063cd8 391 }
bedebaa5
CS
392 if (to < toend)
393 *to = '\0';
fc36a67e 394 *retlen = tolen;
73d840c0 395 return (char *)from;
8d063cd8
LW
396}
397
398/* return ptr to little string in big string, NULL if not found */
378cc40b 399/* This routine was donated by Corey Satten. */
8d063cd8
LW
400
401char *
04c9e624 402Perl_instr(register const char *big, register const char *little)
378cc40b 403{
79072805 404 register I32 first;
378cc40b 405
7918f24d
NC
406 PERL_ARGS_ASSERT_INSTR;
407
a687059c 408 if (!little)
08105a92 409 return (char*)big;
a687059c 410 first = *little++;
378cc40b 411 if (!first)
08105a92 412 return (char*)big;
378cc40b 413 while (*big) {
66a1b24b 414 register const char *s, *x;
378cc40b
LW
415 if (*big++ != first)
416 continue;
417 for (x=big,s=little; *s; /**/ ) {
418 if (!*x)
bd61b366 419 return NULL;
4fc877ac 420 if (*s != *x)
378cc40b 421 break;
4fc877ac
AL
422 else {
423 s++;
424 x++;
378cc40b
LW
425 }
426 }
427 if (!*s)
08105a92 428 return (char*)(big-1);
378cc40b 429 }
bd61b366 430 return NULL;
378cc40b 431}
8d063cd8 432
a687059c
LW
433/* same as instr but allow embedded nulls */
434
435char *
04c9e624 436Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend)
8d063cd8 437{
7918f24d 438 PERL_ARGS_ASSERT_NINSTR;
4c8626be
GA
439 if (little >= lend)
440 return (char*)big;
441 {
8ba22ff4 442 const char first = *little;
4c8626be 443 const char *s, *x;
8ba22ff4 444 bigend -= lend - little++;
4c8626be
GA
445 OUTER:
446 while (big <= bigend) {
b0ca24ee
JH
447 if (*big++ == first) {
448 for (x=big,s=little; s < lend; x++,s++) {
449 if (*s != *x)
450 goto OUTER;
451 }
452 return (char*)(big-1);
4c8626be 453 }
4c8626be 454 }
378cc40b 455 }
bd61b366 456 return NULL;
a687059c
LW
457}
458
459/* reverse of the above--find last substring */
460
461char *
04c9e624 462Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend)
a687059c 463{
08105a92 464 register const char *bigbeg;
e1ec3a88 465 register const I32 first = *little;
7452cf6a 466 register const char * const littleend = lend;
a687059c 467
7918f24d
NC
468 PERL_ARGS_ASSERT_RNINSTR;
469
260d78c9 470 if (little >= littleend)
08105a92 471 return (char*)bigend;
a687059c
LW
472 bigbeg = big;
473 big = bigend - (littleend - little++);
474 while (big >= bigbeg) {
66a1b24b 475 register const char *s, *x;
a687059c
LW
476 if (*big-- != first)
477 continue;
478 for (x=big+2,s=little; s < littleend; /**/ ) {
4fc877ac 479 if (*s != *x)
a687059c 480 break;
4fc877ac
AL
481 else {
482 x++;
483 s++;
a687059c
LW
484 }
485 }
486 if (s >= littleend)
08105a92 487 return (char*)(big+1);
378cc40b 488 }
bd61b366 489 return NULL;
378cc40b 490}
a687059c 491
cf93c79d
IZ
492/* As a space optimization, we do not compile tables for strings of length
493 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
494 special-cased in fbm_instr().
495
496 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
497
954c1994 498/*
ccfc67b7
JH
499=head1 Miscellaneous Functions
500
954c1994
GS
501=for apidoc fbm_compile
502
503Analyses the string in order to make fast searches on it using fbm_instr()
504-- the Boyer-Moore algorithm.
505
506=cut
507*/
508
378cc40b 509void
7506f9c3 510Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
378cc40b 511{
97aff369 512 dVAR;
0d46e09a 513 register const U8 *s;
79072805 514 register U32 i;
0b71040e 515 STRLEN len;
cb742848 516 U32 rarest = 0;
79072805
LW
517 U32 frequency = 256;
518
7918f24d
NC
519 PERL_ARGS_ASSERT_FBM_COMPILE;
520
c517dc2b 521 if (flags & FBMcf_TAIL) {
890ce7af 522 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
396482e1 523 sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */
c517dc2b
JH
524 if (mg && mg->mg_len >= 0)
525 mg->mg_len++;
526 }
9cbe880b 527 s = (U8*)SvPV_force_mutable(sv, len);
d1be9408 528 if (len == 0) /* TAIL might be on a zero-length string. */
cf93c79d 529 return;
cecf5685 530 SvUPGRADE(sv, SVt_PVGV);
78d0cf80 531 SvIOK_off(sv);
8eeaf79a
NC
532 SvNOK_off(sv);
533 SvVALID_on(sv);
02128f11 534 if (len > 2) {
9cbe880b 535 const unsigned char *sb;
66a1b24b 536 const U8 mlen = (len>255) ? 255 : (U8)len;
890ce7af 537 register U8 *table;
cf93c79d 538
d8419e03
NC
539 Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET);
540 table
541 = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET);
542 s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */
7506f9c3 543 memset((void*)table, mlen, 256);
02128f11 544 i = 0;
7506f9c3 545 sb = s - mlen + 1; /* first char (maybe) */
cf93c79d
IZ
546 while (s >= sb) {
547 if (table[*s] == mlen)
7506f9c3 548 table[*s] = (U8)i;
cf93c79d
IZ
549 s--, i++;
550 }
d0688fc4
NC
551 } else {
552 Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET);
378cc40b 553 }
a0714e2c 554 sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */
378cc40b 555
9cbe880b 556 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
bbce6d69 557 for (i = 0; i < len; i++) {
22c35a8c 558 if (PL_freq[s[i]] < frequency) {
bbce6d69 559 rarest = i;
22c35a8c 560 frequency = PL_freq[s[i]];
378cc40b
LW
561 }
562 }
610460f9 563 BmFLAGS(sv) = (U8)flags;
79072805 564 BmRARE(sv) = s[rarest];
44a10c71 565 BmPREVIOUS(sv) = rarest;
cf93c79d
IZ
566 BmUSEFUL(sv) = 100; /* Initial value */
567 if (flags & FBMcf_TAIL)
568 SvTAIL_on(sv);
8eeaf79a
NC
569 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n",
570 BmRARE(sv),(unsigned long)BmPREVIOUS(sv)));
378cc40b
LW
571}
572
cf93c79d
IZ
573/* If SvTAIL(littlestr), it has a fake '\n' at end. */
574/* If SvTAIL is actually due to \Z or \z, this gives false positives
575 if multiline */
576
954c1994
GS
577/*
578=for apidoc fbm_instr
579
580Returns the location of the SV in the string delimited by C<str> and
bd61b366 581C<strend>. It returns C<NULL> if the string can't be found. The C<sv>
954c1994
GS
582does not have to be fbm_compiled, but the search will not be as fast
583then.
584
585=cut
586*/
587
378cc40b 588char *
864dbfa3 589Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
378cc40b 590{
a687059c 591 register unsigned char *s;
cf93c79d 592 STRLEN l;
9cbe880b
NC
593 register const unsigned char *little
594 = (const unsigned char *)SvPV_const(littlestr,l);
cf93c79d 595 register STRLEN littlelen = l;
e1ec3a88 596 register const I32 multiline = flags & FBMrf_MULTILINE;
cf93c79d 597
7918f24d
NC
598 PERL_ARGS_ASSERT_FBM_INSTR;
599
eb160463 600 if ((STRLEN)(bigend - big) < littlelen) {
a1d180c4 601 if ( SvTAIL(littlestr)
eb160463 602 && ((STRLEN)(bigend - big) == littlelen - 1)
a1d180c4 603 && (littlelen == 1
12ae5dfc 604 || (*big == *little &&
27da23d5 605 memEQ((char *)big, (char *)little, littlelen - 1))))
cf93c79d 606 return (char*)big;
bd61b366 607 return NULL;
cf93c79d 608 }
378cc40b 609
cf93c79d 610 if (littlelen <= 2) { /* Special-cased */
cf93c79d
IZ
611
612 if (littlelen == 1) {
613 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
614 /* Know that bigend != big. */
615 if (bigend[-1] == '\n')
616 return (char *)(bigend - 1);
617 return (char *) bigend;
618 }
619 s = big;
620 while (s < bigend) {
621 if (*s == *little)
622 return (char *)s;
623 s++;
624 }
625 if (SvTAIL(littlestr))
626 return (char *) bigend;
bd61b366 627 return NULL;
cf93c79d
IZ
628 }
629 if (!littlelen)
630 return (char*)big; /* Cannot be SvTAIL! */
631
632 /* littlelen is 2 */
633 if (SvTAIL(littlestr) && !multiline) {
634 if (bigend[-1] == '\n' && bigend[-2] == *little)
635 return (char*)bigend - 2;
636 if (bigend[-1] == *little)
637 return (char*)bigend - 1;
bd61b366 638 return NULL;
cf93c79d
IZ
639 }
640 {
641 /* This should be better than FBM if c1 == c2, and almost
642 as good otherwise: maybe better since we do less indirection.
643 And we save a lot of memory by caching no table. */
66a1b24b
AL
644 const unsigned char c1 = little[0];
645 const unsigned char c2 = little[1];
cf93c79d
IZ
646
647 s = big + 1;
648 bigend--;
649 if (c1 != c2) {
650 while (s <= bigend) {
651 if (s[0] == c2) {
652 if (s[-1] == c1)
653 return (char*)s - 1;
654 s += 2;
655 continue;
3fe6f2dc 656 }
cf93c79d
IZ
657 next_chars:
658 if (s[0] == c1) {
659 if (s == bigend)
660 goto check_1char_anchor;
661 if (s[1] == c2)
662 return (char*)s;
663 else {
664 s++;
665 goto next_chars;
666 }
667 }
668 else
669 s += 2;
670 }
671 goto check_1char_anchor;
672 }
673 /* Now c1 == c2 */
674 while (s <= bigend) {
675 if (s[0] == c1) {
676 if (s[-1] == c1)
677 return (char*)s - 1;
678 if (s == bigend)
679 goto check_1char_anchor;
680 if (s[1] == c1)
681 return (char*)s;
682 s += 3;
02128f11 683 }
c277df42 684 else
cf93c79d 685 s += 2;
c277df42 686 }
c277df42 687 }
cf93c79d
IZ
688 check_1char_anchor: /* One char and anchor! */
689 if (SvTAIL(littlestr) && (*bigend == *little))
690 return (char *)bigend; /* bigend is already decremented. */
bd61b366 691 return NULL;
d48672a2 692 }
cf93c79d 693 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
bbce6d69 694 s = bigend - littlelen;
a1d180c4 695 if (s >= big && bigend[-1] == '\n' && *s == *little
cf93c79d
IZ
696 /* Automatically of length > 2 */
697 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
7506f9c3 698 {
bbce6d69 699 return (char*)s; /* how sweet it is */
7506f9c3
GS
700 }
701 if (s[1] == *little
702 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
703 {
cf93c79d 704 return (char*)s + 1; /* how sweet it is */
7506f9c3 705 }
bd61b366 706 return NULL;
02128f11 707 }
cecf5685 708 if (!SvVALID(littlestr)) {
c4420975 709 char * const b = ninstr((char*)big,(char*)bigend,
cf93c79d
IZ
710 (char*)little, (char*)little + littlelen);
711
712 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
713 /* Chop \n from littlestr: */
714 s = bigend - littlelen + 1;
7506f9c3
GS
715 if (*s == *little
716 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
717 {
3fe6f2dc 718 return (char*)s;
7506f9c3 719 }
bd61b366 720 return NULL;
a687059c 721 }
cf93c79d 722 return b;
a687059c 723 }
a1d180c4 724
3566a07d
NC
725 /* Do actual FBM. */
726 if (littlelen > (STRLEN)(bigend - big))
727 return NULL;
728
729 {
d8419e03
NC
730 register const unsigned char * const table
731 = little + littlelen + PERL_FBM_TABLE_OFFSET;
0d46e09a 732 register const unsigned char *oldlittle;
cf93c79d 733
cf93c79d
IZ
734 --littlelen; /* Last char found by table lookup */
735
736 s = big + littlelen;
737 little += littlelen; /* last char */
738 oldlittle = little;
739 if (s < bigend) {
740 register I32 tmp;
741
742 top2:
7506f9c3 743 if ((tmp = table[*s])) {
cf93c79d 744 if ((s += tmp) < bigend)
62b28dd9 745 goto top2;
cf93c79d
IZ
746 goto check_end;
747 }
748 else { /* less expensive than calling strncmp() */
66a1b24b 749 register unsigned char * const olds = s;
cf93c79d
IZ
750
751 tmp = littlelen;
752
753 while (tmp--) {
754 if (*--s == *--little)
755 continue;
cf93c79d
IZ
756 s = olds + 1; /* here we pay the price for failure */
757 little = oldlittle;
758 if (s < bigend) /* fake up continue to outer loop */
759 goto top2;
760 goto check_end;
761 }
762 return (char *)s;
a687059c 763 }
378cc40b 764 }
cf93c79d 765 check_end:
c8029a41 766 if ( s == bigend
8eeaf79a 767 && (BmFLAGS(littlestr) & FBMcf_TAIL)
12ae5dfc
JH
768 && memEQ((char *)(bigend - littlelen),
769 (char *)(oldlittle - littlelen), littlelen) )
cf93c79d 770 return (char*)bigend - littlelen;
bd61b366 771 return NULL;
378cc40b 772 }
378cc40b
LW
773}
774
c277df42
IZ
775/* start_shift, end_shift are positive quantities which give offsets
776 of ends of some substring of bigstr.
a0288114 777 If "last" we want the last occurrence.
c277df42 778 old_posp is the way of communication between consequent calls if
a1d180c4 779 the next call needs to find the .
c277df42 780 The initial *old_posp should be -1.
cf93c79d
IZ
781
782 Note that we take into account SvTAIL, so one can get extra
783 optimizations if _ALL flag is set.
c277df42
IZ
784 */
785
cf93c79d 786/* If SvTAIL is actually due to \Z or \z, this gives false positives
26fa51c3 787 if PL_multiline. In fact if !PL_multiline the authoritative answer
cf93c79d
IZ
788 is not supported yet. */
789
378cc40b 790char *
864dbfa3 791Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
378cc40b 792{
97aff369 793 dVAR;
0d46e09a 794 register const unsigned char *big;
79072805
LW
795 register I32 pos;
796 register I32 previous;
797 register I32 first;
0d46e09a 798 register const unsigned char *little;
c277df42 799 register I32 stop_pos;
0d46e09a 800 register const unsigned char *littleend;
c277df42 801 I32 found = 0;
378cc40b 802
7918f24d
NC
803 PERL_ARGS_ASSERT_SCREAMINSTR;
804
cecf5685
NC
805 assert(SvTYPE(littlestr) == SVt_PVGV);
806 assert(SvVALID(littlestr));
d372c834 807
c277df42 808 if (*old_posp == -1
3280af22 809 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
cf93c79d
IZ
810 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
811 cant_find:
a1d180c4 812 if ( BmRARE(littlestr) == '\n'
85c508c3 813 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
cfd0369c 814 little = (const unsigned char *)(SvPVX_const(littlestr));
cf93c79d
IZ
815 littleend = little + SvCUR(littlestr);
816 first = *little++;
817 goto check_tail;
818 }
bd61b366 819 return NULL;
cf93c79d
IZ
820 }
821
cfd0369c 822 little = (const unsigned char *)(SvPVX_const(littlestr));
79072805 823 littleend = little + SvCUR(littlestr);
378cc40b 824 first = *little++;
c277df42 825 /* The value of pos we can start at: */
79072805 826 previous = BmPREVIOUS(littlestr);
cfd0369c 827 big = (const unsigned char *)(SvPVX_const(bigstr));
c277df42
IZ
828 /* The value of pos we can stop at: */
829 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
cf93c79d 830 if (previous + start_shift > stop_pos) {
0fe87f7c
HS
831/*
832 stop_pos does not include SvTAIL in the count, so this check is incorrect
833 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
834*/
835#if 0
cf93c79d
IZ
836 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
837 goto check_tail;
0fe87f7c 838#endif
bd61b366 839 return NULL;
cf93c79d 840 }
c277df42 841 while (pos < previous + start_shift) {
3280af22 842 if (!(pos += PL_screamnext[pos]))
cf93c79d 843 goto cant_find;
378cc40b 844 }
de3bb511 845 big -= previous;
bbce6d69 846 do {
0d46e09a 847 register const unsigned char *s, *x;
ef64f398 848 if (pos >= stop_pos) break;
bbce6d69
PP
849 if (big[pos] != first)
850 continue;
851 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
bbce6d69
PP
852 if (*s++ != *x++) {
853 s--;
854 break;
378cc40b 855 }
bbce6d69 856 }
c277df42
IZ
857 if (s == littleend) {
858 *old_posp = pos;
859 if (!last) return (char *)(big+pos);
860 found = 1;
861 }
3280af22 862 } while ( pos += PL_screamnext[pos] );
a1d180c4 863 if (last && found)
cf93c79d 864 return (char *)(big+(*old_posp));
cf93c79d
IZ
865 check_tail:
866 if (!SvTAIL(littlestr) || (end_shift > 0))
bd61b366 867 return NULL;
cf93c79d 868 /* Ignore the trailing "\n". This code is not microoptimized */
cfd0369c 869 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
cf93c79d
IZ
870 stop_pos = littleend - little; /* Actual littlestr len */
871 if (stop_pos == 0)
872 return (char*)big;
873 big -= stop_pos;
874 if (*big == first
12ae5dfc
JH
875 && ((stop_pos == 1) ||
876 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
cf93c79d 877 return (char*)big;
bd61b366 878 return NULL;
8d063cd8
LW
879}
880
79072805 881I32
04c9e624 882Perl_ibcmp(const char *s1, const char *s2, register I32 len)
79072805 883{
e1ec3a88
AL
884 register const U8 *a = (const U8 *)s1;
885 register const U8 *b = (const U8 *)s2;
96a5add6 886
7918f24d
NC
887 PERL_ARGS_ASSERT_IBCMP;
888
79072805 889 while (len--) {
22c35a8c 890 if (*a != *b && *a != PL_fold[*b])
bbce6d69
PP
891 return 1;
892 a++,b++;
893 }
894 return 0;
895}
896
897I32
04c9e624 898Perl_ibcmp_locale(const char *s1, const char *s2, register I32 len)
bbce6d69 899{
27da23d5 900 dVAR;
e1ec3a88
AL
901 register const U8 *a = (const U8 *)s1;
902 register const U8 *b = (const U8 *)s2;
96a5add6 903
7918f24d
NC
904 PERL_ARGS_ASSERT_IBCMP_LOCALE;
905
bbce6d69 906 while (len--) {
22c35a8c 907 if (*a != *b && *a != PL_fold_locale[*b])
bbce6d69
PP
908 return 1;
909 a++,b++;
79072805
LW
910 }
911 return 0;
912}
913
8d063cd8
LW
914/* copy a string to a safe spot */
915
954c1994 916/*
ccfc67b7
JH
917=head1 Memory Management
918
954c1994
GS
919=for apidoc savepv
920
61a925ed
AMS
921Perl's version of C<strdup()>. Returns a pointer to a newly allocated
922string which is a duplicate of C<pv>. The size of the string is
923determined by C<strlen()>. The memory allocated for the new string can
924be freed with the C<Safefree()> function.
954c1994
GS
925
926=cut
927*/
928
8d063cd8 929char *
efdfce31 930Perl_savepv(pTHX_ const char *pv)
8d063cd8 931{
96a5add6 932 PERL_UNUSED_CONTEXT;
e90e2364 933 if (!pv)
bd61b366 934 return NULL;
66a1b24b
AL
935 else {
936 char *newaddr;
937 const STRLEN pvlen = strlen(pv)+1;
10edeb5d
JH
938 Newx(newaddr, pvlen, char);
939 return (char*)memcpy(newaddr, pv, pvlen);
66a1b24b 940 }
8d063cd8
LW
941}
942
a687059c
LW
943/* same thing but with a known length */
944
954c1994
GS
945/*
946=for apidoc savepvn
947
61a925ed
AMS
948Perl's version of what C<strndup()> would be if it existed. Returns a
949pointer to a newly allocated string which is a duplicate of the first
cbf82dd0
NC
950C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for
951the new string can be freed with the C<Safefree()> function.
954c1994
GS
952
953=cut
954*/
955
a687059c 956char *
efdfce31 957Perl_savepvn(pTHX_ const char *pv, register I32 len)
a687059c
LW
958{
959 register char *newaddr;
96a5add6 960 PERL_UNUSED_CONTEXT;
a687059c 961
a02a5408 962 Newx(newaddr,len+1,char);
92110913 963 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
efdfce31 964 if (pv) {
e90e2364
NC
965 /* might not be null terminated */
966 newaddr[len] = '\0';
07409e01 967 return (char *) CopyD(pv,newaddr,len,char);
92110913
NIS
968 }
969 else {
07409e01 970 return (char *) ZeroD(newaddr,len+1,char);
92110913 971 }
a687059c
LW
972}
973
05ec9bb3
NIS
974/*
975=for apidoc savesharedpv
976
61a925ed
AMS
977A version of C<savepv()> which allocates the duplicate string in memory
978which is shared between threads.
05ec9bb3
NIS
979
980=cut
981*/
982char *
efdfce31 983Perl_savesharedpv(pTHX_ const char *pv)
05ec9bb3 984{
e90e2364 985 register char *newaddr;
490a0e98 986 STRLEN pvlen;
e90e2364 987 if (!pv)
bd61b366 988 return NULL;
e90e2364 989
490a0e98
NC
990 pvlen = strlen(pv)+1;
991 newaddr = (char*)PerlMemShared_malloc(pvlen);
e90e2364 992 if (!newaddr) {
0bd48802 993 return write_no_mem();
05ec9bb3 994 }
10edeb5d 995 return (char*)memcpy(newaddr, pv, pvlen);
05ec9bb3
NIS
996}
997
2e0de35c 998/*
d9095cec
NC
999=for apidoc savesharedpvn
1000
1001A version of C<savepvn()> which allocates the duplicate string in memory
1002which is shared between threads. (With the specific difference that a NULL
1003pointer is not acceptable)
1004
1005=cut
1006*/
1007char *
1008Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len)
1009{
1010 char *const newaddr = (char*)PerlMemShared_malloc(len + 1);
7918f24d
NC
1011
1012 PERL_ARGS_ASSERT_SAVESHAREDPVN;
1013
d9095cec
NC
1014 if (!newaddr) {
1015 return write_no_mem();
1016 }
1017 newaddr[len] = '\0';
1018 return (char*)memcpy(newaddr, pv, len);
1019}
1020
1021/*
2e0de35c
NC
1022=for apidoc savesvpv
1023
6832267f 1024A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
2e0de35c
NC
1025the passed in SV using C<SvPV()>
1026
1027=cut
1028*/
1029
1030char *
1031Perl_savesvpv(pTHX_ SV *sv)
1032{
1033 STRLEN len;
7452cf6a 1034 const char * const pv = SvPV_const(sv, len);
2e0de35c
NC
1035 register char *newaddr;
1036
7918f24d
NC
1037 PERL_ARGS_ASSERT_SAVESVPV;
1038
26866f99 1039 ++len;
a02a5408 1040 Newx(newaddr,len,char);
07409e01 1041 return (char *) CopyD(pv,newaddr,len,char);
2e0de35c 1042}
05ec9bb3
NIS
1043
1044
cea2e8a9 1045/* the SV for Perl_form() and mess() is not kept in an arena */
fc36a67e 1046
76e3520e 1047STATIC SV *
cea2e8a9 1048S_mess_alloc(pTHX)
fc36a67e 1049{
97aff369 1050 dVAR;
fc36a67e
PP
1051 SV *sv;
1052 XPVMG *any;
1053
e72dc28c 1054 if (!PL_dirty)
84bafc02 1055 return newSVpvs_flags("", SVs_TEMP);
e72dc28c 1056
0372dbb6
GS
1057 if (PL_mess_sv)
1058 return PL_mess_sv;
1059
fc36a67e 1060 /* Create as PVMG now, to avoid any upgrading later */
a02a5408
JC
1061 Newx(sv, 1, SV);
1062 Newxz(any, 1, XPVMG);
fc36a67e
PP
1063 SvFLAGS(sv) = SVt_PVMG;
1064 SvANY(sv) = (void*)any;
6136c704 1065 SvPV_set(sv, NULL);
fc36a67e 1066 SvREFCNT(sv) = 1 << 30; /* practically infinite */
e72dc28c 1067 PL_mess_sv = sv;
fc36a67e
PP
1068 return sv;
1069}
1070
c5be433b 1071#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS
1072char *
1073Perl_form_nocontext(const char* pat, ...)
1074{
1075 dTHX;
c5be433b 1076 char *retval;
cea2e8a9 1077 va_list args;
7918f24d 1078 PERL_ARGS_ASSERT_FORM_NOCONTEXT;
cea2e8a9 1079 va_start(args, pat);
c5be433b 1080 retval = vform(pat, &args);
cea2e8a9 1081 va_end(args);
c5be433b 1082 return retval;
cea2e8a9 1083}
c5be433b 1084#endif /* PERL_IMPLICIT_CONTEXT */
cea2e8a9 1085
7c9e965c 1086/*
ccfc67b7 1087=head1 Miscellaneous Functions
7c9e965c
JP
1088=for apidoc form
1089
1090Takes a sprintf-style format pattern and conventional
1091(non-SV) arguments and returns the formatted string.
1092
1093 (char *) Perl_form(pTHX_ const char* pat, ...)
1094
1095can be used any place a string (char *) is required:
1096
1097 char * s = Perl_form("%d.%d",major,minor);
1098
1099Uses a single private buffer so if you want to format several strings you
1100must explicitly copy the earlier strings away (and free the copies when you
1101are done).
1102
1103=cut
1104*/
1105
8990e307 1106char *
864dbfa3 1107Perl_form(pTHX_ const char* pat, ...)
8990e307 1108{
c5be433b 1109 char *retval;
46fc3d4c 1110 va_list args;
7918f24d 1111 PERL_ARGS_ASSERT_FORM;
46fc3d4c 1112 va_start(args, pat);
c5be433b 1113 retval = vform(pat, &args);
46fc3d4c 1114 va_end(args);
c5be433b
GS
1115 return retval;
1116}
1117
1118char *
1119Perl_vform(pTHX_ const char *pat, va_list *args)
1120{
2d03de9c 1121 SV * const sv = mess_alloc();
7918f24d 1122 PERL_ARGS_ASSERT_VFORM;
4608196e 1123 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
e72dc28c 1124 return SvPVX(sv);
46fc3d4c 1125}
a687059c 1126
5a844595
GS
1127#if defined(PERL_IMPLICIT_CONTEXT)
1128SV *
1129Perl_mess_nocontext(const char *pat, ...)
1130{
1131 dTHX;
1132 SV *retval;
1133 va_list args;
7918f24d 1134 PERL_ARGS_ASSERT_MESS_NOCONTEXT;
5a844595
GS
1135 va_start(args, pat);
1136 retval = vmess(pat, &args);
1137 va_end(args);
1138 return retval;
1139}
1140#endif /* PERL_IMPLICIT_CONTEXT */
1141
06bf62c7 1142SV *
5a844595
GS
1143Perl_mess(pTHX_ const char *pat, ...)
1144{
1145 SV *retval;
1146 va_list args;
7918f24d 1147 PERL_ARGS_ASSERT_MESS;
5a844595
GS
1148 va_start(args, pat);
1149 retval = vmess(pat, &args);
1150 va_end(args);
1151 return retval;
1152}
1153
5f66b61c
AL
1154STATIC const COP*
1155S_closest_cop(pTHX_ const COP *cop, const OP *o)
ae7d165c 1156{
97aff369 1157 dVAR;
ae7d165c
PJ
1158 /* Look for PL_op starting from o. cop is the last COP we've seen. */
1159
7918f24d
NC
1160 PERL_ARGS_ASSERT_CLOSEST_COP;
1161
fabdb6c0
AL
1162 if (!o || o == PL_op)
1163 return cop;
ae7d165c
PJ
1164
1165 if (o->op_flags & OPf_KIDS) {
5f66b61c 1166 const OP *kid;
fabdb6c0 1167 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
5f66b61c 1168 const COP *new_cop;
ae7d165c
PJ
1169
1170 /* If the OP_NEXTSTATE has been optimised away we can still use it
1171 * the get the file and line number. */
1172
1173 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
5f66b61c 1174 cop = (const COP *)kid;
ae7d165c
PJ
1175
1176 /* Keep searching, and return when we've found something. */
1177
1178 new_cop = closest_cop(cop, kid);
fabdb6c0
AL
1179 if (new_cop)
1180 return new_cop;
ae7d165c
PJ
1181 }
1182 }
1183
1184 /* Nothing found. */
1185
5f66b61c 1186 return NULL;
ae7d165c
PJ
1187}
1188
5a844595
GS
1189SV *
1190Perl_vmess(pTHX_ const char *pat, va_list *args)
46fc3d4c 1191{
97aff369 1192 dVAR;
c4420975 1193 SV * const sv = mess_alloc();
46fc3d4c 1194
7918f24d
NC
1195 PERL_ARGS_ASSERT_VMESS;
1196
5f66b61c 1197 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
46fc3d4c 1198 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
ae7d165c
PJ
1199 /*
1200 * Try and find the file and line for PL_op. This will usually be
1201 * PL_curcop, but it might be a cop that has been optimised away. We
1202 * can try to find such a cop by searching through the optree starting
1203 * from the sibling of PL_curcop.
1204 */
1205
e1ec3a88 1206 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
5f66b61c
AL
1207 if (!cop)
1208 cop = PL_curcop;
ae7d165c
PJ
1209
1210 if (CopLINE(cop))
ed094faf 1211 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
3aed30dc 1212 OutCopFILE(cop), (IV)CopLINE(cop));
191f87d5
DH
1213 /* Seems that GvIO() can be untrustworthy during global destruction. */
1214 if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO)
1215 && IoLINES(GvIOp(PL_last_in_gv)))
1216 {
e1ec3a88 1217 const bool line_mode = (RsSIMPLE(PL_rs) &&
95a20fc0 1218 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
57def98f 1219 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
5f66b61c 1220 PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv),
edc2eac3
JH
1221 line_mode ? "line" : "chunk",
1222 (IV)IoLINES(GvIOp(PL_last_in_gv)));
a687059c 1223 }
5f66b61c
AL
1224 if (PL_dirty)
1225 sv_catpvs(sv, " during global destruction");
1226 sv_catpvs(sv, ".\n");
a687059c 1227 }
06bf62c7 1228 return sv;
a687059c
LW
1229}
1230
7ff03255
SG
1231void
1232Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1233{
27da23d5 1234 dVAR;
7ff03255
SG
1235 IO *io;
1236 MAGIC *mg;
1237
7918f24d
NC
1238 PERL_ARGS_ASSERT_WRITE_TO_STDERR;
1239
7ff03255
SG
1240 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1241 && (io = GvIO(PL_stderrgv))
daba3364 1242 && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar)))
7ff03255
SG
1243 {
1244 dSP;
1245 ENTER;
1246 SAVETMPS;
1247
1248 save_re_context();
1249 SAVESPTR(PL_stderrgv);
a0714e2c 1250 PL_stderrgv = NULL;
7ff03255
SG
1251
1252 PUSHSTACKi(PERLSI_MAGIC);
1253
1254 PUSHMARK(SP);
1255 EXTEND(SP,2);
daba3364 1256 PUSHs(SvTIED_obj(MUTABLE_SV(io), mg));
6e449a3a 1257 mPUSHp(message, msglen);
7ff03255
SG
1258 PUTBACK;
1259 call_method("PRINT", G_SCALAR);
1260
1261 POPSTACK;
1262 FREETMPS;
1263 LEAVE;
1264 }
1265 else {
1266#ifdef USE_SFIO
1267 /* SFIO can really mess with your errno */
4ee39169 1268 dSAVED_ERRNO;
7ff03255 1269#endif
53c1dcc0 1270 PerlIO * const serr = Perl_error_log;
7ff03255
SG
1271
1272 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1273 (void)PerlIO_flush(serr);
1274#ifdef USE_SFIO
4ee39169 1275 RESTORE_ERRNO;
7ff03255
SG
1276#endif
1277 }
1278}
1279
46d9c920 1280/* Common code used by vcroak, vdie, vwarn and vwarner */
3ab1ac99 1281
46d9c920
NC
1282STATIC bool
1283S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8, bool warn)
63315e18 1284{
97aff369 1285 dVAR;
63315e18
NC
1286 HV *stash;
1287 GV *gv;
1288 CV *cv;
46d9c920
NC
1289 SV **const hook = warn ? &PL_warnhook : &PL_diehook;
1290 /* sv_2cv might call Perl_croak() or Perl_warner() */
1291 SV * const oldhook = *hook;
1292
1293 assert(oldhook);
63315e18 1294
63315e18 1295 ENTER;
46d9c920
NC
1296 SAVESPTR(*hook);
1297 *hook = NULL;
1298 cv = sv_2cv(oldhook, &stash, &gv, 0);
63315e18
NC
1299 LEAVE;
1300 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1301 dSP;
1302 SV *msg;
1303
1304 ENTER;
1305 save_re_context();
46d9c920
NC
1306 if (warn) {
1307 SAVESPTR(*hook);
1308 *hook = NULL;
1309 }
1310 if (warn || message) {
740cce10 1311 msg = newSVpvn_flags(message, msglen, utf8);
63315e18
NC
1312 SvREADONLY_on(msg);
1313 SAVEFREESV(msg);
1314 }
1315 else {
1316 msg = ERRSV;
1317 }
1318
46d9c920 1319 PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK);
63315e18
NC
1320 PUSHMARK(SP);
1321 XPUSHs(msg);
1322 PUTBACK;
daba3364 1323 call_sv(MUTABLE_SV(cv), G_DISCARD);
63315e18
NC
1324 POPSTACK;
1325 LEAVE;
46d9c920 1326 return TRUE;
63315e18 1327 }
46d9c920 1328 return FALSE;
63315e18
NC
1329}
1330
cfd0369c 1331STATIC const char *
e07360fa
AT
1332S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1333 I32* utf8)
1334{
1335 dVAR;
cfd0369c 1336 const char *message;
e07360fa
AT
1337
1338 if (pat) {
890ce7af 1339 SV * const msv = vmess(pat, args);
e07360fa
AT
1340 if (PL_errors && SvCUR(PL_errors)) {
1341 sv_catsv(PL_errors, msv);
cfd0369c 1342 message = SvPV_const(PL_errors, *msglen);
e07360fa
AT
1343 SvCUR_set(PL_errors, 0);
1344 }
1345 else
cfd0369c 1346 message = SvPV_const(msv,*msglen);
e07360fa
AT
1347 *utf8 = SvUTF8(msv);
1348 }
1349 else {
bd61b366 1350 message = NULL;
e07360fa
AT
1351 }
1352
e07360fa 1353 if (PL_diehook) {
46d9c920 1354 S_vdie_common(aTHX_ message, *msglen, *utf8, FALSE);
e07360fa
AT
1355 }
1356 return message;
1357}
1358
1f676739 1359static OP *
e3cf49e2 1360S_vdie(pTHX_ const char* pat, va_list *args)
36477c24 1361{
97aff369 1362 dVAR;
73d840c0 1363 const char *message;
e1ec3a88 1364 const int was_in_eval = PL_in_eval;
06bf62c7 1365 STRLEN msglen;
ff882698 1366 I32 utf8 = 0;
36477c24 1367
890ce7af 1368 message = vdie_croak_common(pat, args, &msglen, &utf8);
36477c24 1369
06bf62c7 1370 PL_restartop = die_where(message, msglen);
ff882698 1371 SvFLAGS(ERRSV) |= utf8;
ad09800f
GG
1372 JMPENV_JUMP(3);
1373 /* NOTREACHED */
1374 return NULL;
36477c24
PP
1375}
1376
c5be433b 1377#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS
1378OP *
1379Perl_die_nocontext(const char* pat, ...)
a687059c 1380{
cea2e8a9
GS
1381 dTHX;
1382 OP *o;
a687059c 1383 va_list args;
cea2e8a9 1384 va_start(args, pat);
c5be433b 1385 o = vdie(pat, &args);
cea2e8a9
GS
1386 va_end(args);
1387 return o;
1388}
c5be433b 1389#endif /* PERL_IMPLICIT_CONTEXT */
cea2e8a9
GS
1390
1391OP *
1392Perl_die(pTHX_ const char* pat, ...)
1393{
1394 OP *o;
1395 va_list args;
1396 va_start(args, pat);
c5be433b 1397 o = vdie(pat, &args);
cea2e8a9
GS
1398 va_end(args);
1399 return o;
1400}
1401
c5be433b
GS
1402void
1403Perl_vcroak(pTHX_ const char* pat, va_list *args)
cea2e8a9 1404{
97aff369 1405 dVAR;
73d840c0 1406 const char *message;
06bf62c7 1407 STRLEN msglen;
ff882698 1408 I32 utf8 = 0;
a687059c 1409
3ab1ac99 1410 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
5a844595 1411
3280af22 1412 if (PL_in_eval) {
06bf62c7 1413 PL_restartop = die_where(message, msglen);
ff882698 1414 SvFLAGS(ERRSV) |= utf8;
6224f72b 1415 JMPENV_JUMP(3);
a0d0e21e 1416 }
84414e3e 1417 else if (!message)
cfd0369c 1418 message = SvPVx_const(ERRSV, msglen);
84414e3e 1419
7ff03255 1420 write_to_stderr(message, msglen);
f86702cc 1421 my_failure_exit();
a687059c
LW
1422}
1423
c5be433b 1424#if defined(PERL_IMPLICIT_CONTEXT)
8990e307 1425void
cea2e8a9 1426Perl_croak_nocontext(const char *pat, ...)
a687059c 1427{
cea2e8a9 1428 dTHX;
a687059c 1429 va_list args;
cea2e8a9 1430 va_start(args, pat);
c5be433b 1431 vcroak(pat, &args);
cea2e8a9
GS
1432 /* NOTREACHED */
1433 va_end(args);
1434}
1435#endif /* PERL_IMPLICIT_CONTEXT */
1436
954c1994 1437/*
ccfc67b7
JH
1438=head1 Warning and Dieing
1439
954c1994
GS
1440=for apidoc croak
1441
9983fa3c 1442This is the XSUB-writer's interface to Perl's C<die> function.
966353fd
MF
1443Normally call this function the same way you call the C C<printf>
1444function. Calling C<croak> returns control directly to Perl,
1445sidestepping the normal C order of execution. See C<warn>.
9983fa3c
GS
1446
1447If you want to throw an exception object, assign the object to
bd61b366 1448C<$@> and then pass C<NULL> to croak():
9983fa3c 1449
64ace3f8 1450 errsv = get_sv("@", GV_ADD);
9983fa3c 1451 sv_setsv(errsv, exception_object);
bd61b366 1452 croak(NULL);
954c1994
GS
1453
1454=cut
1455*/
1456
cea2e8a9
GS
1457void
1458Perl_croak(pTHX_ const char *pat, ...)
1459{
1460 va_list args;
1461 va_start(args, pat);
c5be433b 1462 vcroak(pat, &args);
cea2e8a9
GS
1463 /* NOTREACHED */
1464 va_end(args);
1465}
1466
c5be433b
GS
1467void
1468Perl_vwarn(pTHX_ const char* pat, va_list *args)
cea2e8a9 1469{
27da23d5 1470 dVAR;
06bf62c7 1471 STRLEN msglen;
53c1dcc0
AL
1472 SV * const msv = vmess(pat, args);
1473 const I32 utf8 = SvUTF8(msv);
1474 const char * const message = SvPV_const(msv, msglen);
a687059c 1475
7918f24d
NC
1476 PERL_ARGS_ASSERT_VWARN;
1477
3280af22 1478 if (PL_warnhook) {
46d9c920 1479 if (vdie_common(message, msglen, utf8, TRUE))
20cec16a 1480 return;
748a9306 1481 }
87582a92 1482
7ff03255 1483 write_to_stderr(message, msglen);
a687059c 1484}
8d063cd8 1485
c5be433b 1486#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS
1487void
1488Perl_warn_nocontext(const char *pat, ...)
1489{
1490 dTHX;
1491 va_list args;
7918f24d 1492 PERL_ARGS_ASSERT_WARN_NOCONTEXT;
cea2e8a9 1493 va_start(args, pat);
c5be433b 1494 vwarn(pat, &args);
cea2e8a9
GS
1495 va_end(args);
1496}
1497#endif /* PERL_IMPLICIT_CONTEXT */
1498
954c1994
GS
1499/*
1500=for apidoc warn
1501
966353fd
MF
1502This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1503function the same way you call the C C<printf> function. See C<croak>.
954c1994
GS
1504
1505=cut
1506*/
1507
cea2e8a9
GS
1508void
1509Perl_warn(pTHX_ const char *pat, ...)
1510{
1511 va_list args;
7918f24d 1512 PERL_ARGS_ASSERT_WARN;
cea2e8a9 1513 va_start(args, pat);
c5be433b 1514 vwarn(pat, &args);
cea2e8a9
GS
1515 va_end(args);
1516}
1517
c5be433b
GS
1518#if defined(PERL_IMPLICIT_CONTEXT)
1519void
1520Perl_warner_nocontext(U32 err, const char *pat, ...)
1521{
27da23d5 1522 dTHX;
c5be433b 1523 va_list args;
7918f24d 1524 PERL_ARGS_ASSERT_WARNER_NOCONTEXT;
c5be433b
GS
1525 va_start(args, pat);
1526 vwarner(err, pat, &args);
1527 va_end(args);
1528}
1529#endif /* PERL_IMPLICIT_CONTEXT */
1530
599cee73 1531void
9b387841
NC
1532Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...)
1533{
1534 PERL_ARGS_ASSERT_CK_WARNER_D;
1535
1536 if (Perl_ckwarn_d(aTHX_ err)) {
1537 va_list args;
1538 va_start(args, pat);
1539 vwarner(err, pat, &args);
1540 va_end(args);
1541 }
1542}
1543
1544void
a2a5de95
NC
1545Perl_ck_warner(pTHX_ U32 err, const char* pat, ...)
1546{
1547 PERL_ARGS_ASSERT_CK_WARNER;
1548
1549 if (Perl_ckwarn(aTHX_ err)) {
1550 va_list args;
1551 va_start(args, pat);
1552 vwarner(err, pat, &args);
1553 va_end(args);
1554 }
1555}
1556
1557void
864dbfa3 1558Perl_warner(pTHX_ U32 err, const char* pat,...)
599cee73
PM
1559{
1560 va_list args;
7918f24d 1561 PERL_ARGS_ASSERT_WARNER;
c5be433b
GS
1562 va_start(args, pat);
1563 vwarner(err, pat, &args);
1564 va_end(args);
1565}
1566
1567void
1568Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1569{
27da23d5 1570 dVAR;
7918f24d 1571 PERL_ARGS_ASSERT_VWARNER;
5f2d9966 1572 if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) {
a3b680e6 1573 SV * const msv = vmess(pat, args);
d13b0d77 1574 STRLEN msglen;
7452cf6a 1575 const char * const message = SvPV_const(msv, msglen);
a3b680e6 1576 const I32 utf8 = SvUTF8(msv);
599cee73 1577
3aed30dc 1578 if (PL_diehook) {
63315e18 1579 assert(message);
46d9c920 1580 S_vdie_common(aTHX_ message, msglen, utf8, FALSE);
3aed30dc
HS
1581 }
1582 if (PL_in_eval) {
1583 PL_restartop = die_where(message, msglen);
ff882698 1584 SvFLAGS(ERRSV) |= utf8;
3aed30dc
HS
1585 JMPENV_JUMP(3);
1586 }
7ff03255 1587 write_to_stderr(message, msglen);
3aed30dc 1588 my_failure_exit();
599cee73
PM
1589 }
1590 else {
d13b0d77 1591 Perl_vwarn(aTHX_ pat, args);
599cee73
PM
1592 }
1593}
1594
f54ba1c2
DM
1595/* implements the ckWARN? macros */
1596
1597bool
1598Perl_ckwarn(pTHX_ U32 w)
1599{
97aff369 1600 dVAR;
ad287e37
NC
1601 /* If lexical warnings have not been set, use $^W. */
1602 if (isLEXWARN_off)
1603 return PL_dowarn & G_WARN_ON;
1604
26c7b074 1605 return ckwarn_common(w);
f54ba1c2
DM
1606}
1607
1608/* implements the ckWARN?_d macro */
1609
1610bool
1611Perl_ckwarn_d(pTHX_ U32 w)
1612{
97aff369 1613 dVAR;
ad287e37
NC
1614 /* If lexical warnings have not been set then default classes warn. */
1615 if (isLEXWARN_off)
1616 return TRUE;
1617
26c7b074
NC
1618 return ckwarn_common(w);
1619}
1620
1621static bool
1622S_ckwarn_common(pTHX_ U32 w)
1623{
ad287e37
NC
1624 if (PL_curcop->cop_warnings == pWARN_ALL)
1625 return TRUE;
1626
1627 if (PL_curcop->cop_warnings == pWARN_NONE)
1628 return FALSE;
1629
98fe6610
NC
1630 /* Check the assumption that at least the first slot is non-zero. */
1631 assert(unpackWARN1(w));
1632
1633 /* Check the assumption that it is valid to stop as soon as a zero slot is
1634 seen. */
1635 if (!unpackWARN2(w)) {
1636 assert(!unpackWARN3(w));
1637 assert(!unpackWARN4(w));
1638 } else if (!unpackWARN3(w)) {
1639 assert(!unpackWARN4(w));
1640 }
1641
26c7b074
NC
1642 /* Right, dealt with all the special cases, which are implemented as non-
1643 pointers, so there is a pointer to a real warnings mask. */
98fe6610
NC
1644 do {
1645 if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w)))
1646 return TRUE;
1647 } while (w >>= WARNshift);
1648
1649 return FALSE;
f54ba1c2
DM
1650}
1651
72dc9ed5
NC
1652/* Set buffer=NULL to get a new one. */
1653STRLEN *
8ee4cf24 1654Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits,
72dc9ed5
NC
1655 STRLEN size) {
1656 const MEM_SIZE len_wanted = sizeof(STRLEN) + size;
35da51f7 1657 PERL_UNUSED_CONTEXT;
7918f24d 1658 PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD;
72dc9ed5 1659
10edeb5d
JH
1660 buffer = (STRLEN*)
1661 (specialWARN(buffer) ?
1662 PerlMemShared_malloc(len_wanted) :
1663 PerlMemShared_realloc(buffer, len_wanted));
72dc9ed5
NC
1664 buffer[0] = size;
1665 Copy(bits, (buffer + 1), size, char);
1666 return buffer;
1667}
f54ba1c2 1668
e6587932
DM
1669/* since we've already done strlen() for both nam and val
1670 * we can use that info to make things faster than
1671 * sprintf(s, "%s=%s", nam, val)
1672 */
1673#define my_setenv_format(s, nam, nlen, val, vlen) \
1674 Copy(nam, s, nlen, char); \
1675 *(s+nlen) = '='; \
1676 Copy(val, s+(nlen+1), vlen, char); \
1677 *(s+(nlen+1+vlen)) = '\0'
1678
c5d12488
JH
1679#ifdef USE_ENVIRON_ARRAY
1680 /* VMS' my_setenv() is in vms.c */
1681#if !defined(WIN32) && !defined(NETWARE)
8d063cd8 1682void
e1ec3a88 1683Perl_my_setenv(pTHX_ const char *nam, const char *val)
8d063cd8 1684{
27da23d5 1685 dVAR;
4efc5df6
GS
1686#ifdef USE_ITHREADS
1687 /* only parent thread can modify process environment */
1688 if (PL_curinterp == aTHX)
1689#endif
1690 {
f2517201 1691#ifndef PERL_USE_SAFE_PUTENV
50acdf95 1692 if (!PL_use_safe_putenv) {
c5d12488 1693 /* most putenv()s leak, so we manipulate environ directly */
3a9222be
JH
1694 register I32 i;
1695 register const I32 len = strlen(nam);
c5d12488
JH
1696 int nlen, vlen;
1697
3a9222be
JH
1698 /* where does it go? */
1699 for (i = 0; environ[i]; i++) {
1700 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1701 break;
1702 }
1703
c5d12488
JH
1704 if (environ == PL_origenviron) { /* need we copy environment? */
1705 I32 j;
1706 I32 max;
1707 char **tmpenv;
1708
1709 max = i;
1710 while (environ[max])
1711 max++;
1712 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1713 for (j=0; j<max; j++) { /* copy environment */
1714 const int len = strlen(environ[j]);
1715 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1716 Copy(environ[j], tmpenv[j], len+1, char);
1717 }
1718 tmpenv[max] = NULL;
1719 environ = tmpenv; /* tell exec where it is now */
1720 }
1721 if (!val) {
1722 safesysfree(environ[i]);
1723 while (environ[i]) {
1724 environ[i] = environ[i+1];
1725 i++;
a687059c 1726 }
c5d12488
JH
1727 return;
1728 }
1729 if (!environ[i]) { /* does not exist yet */
1730 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
1731 environ[i+1] = NULL; /* make sure it's null terminated */
1732 }
1733 else
1734 safesysfree(environ[i]);
1735 nlen = strlen(nam);
1736 vlen = strlen(val);
1737
1738 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1739 /* all that work just for this */
1740 my_setenv_format(environ[i], nam, nlen, val, vlen);
50acdf95 1741 } else {
c5d12488 1742# endif
7ee146b1 1743# if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__)
88f5bc07
AB
1744# if defined(HAS_UNSETENV)
1745 if (val == NULL) {
1746 (void)unsetenv(nam);
1747 } else {
1748 (void)setenv(nam, val, 1);
1749 }
1750# else /* ! HAS_UNSETENV */
1751 (void)setenv(nam, val, 1);
1752# endif /* HAS_UNSETENV */
47dafe4d 1753# else
88f5bc07
AB
1754# if defined(HAS_UNSETENV)
1755 if (val == NULL) {
1756 (void)unsetenv(nam);
1757 } else {
c4420975
AL
1758 const int nlen = strlen(nam);
1759 const int vlen = strlen(val);
1760 char * const new_env =
88f5bc07
AB
1761 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1762 my_setenv_format(new_env, nam, nlen, val, vlen);
1763 (void)putenv(new_env);
1764 }
1765# else /* ! HAS_UNSETENV */
1766 char *new_env;
c4420975
AL
1767 const int nlen = strlen(nam);
1768 int vlen;
88f5bc07
AB
1769 if (!val) {
1770 val = "";
1771 }
1772 vlen = strlen(val);
1773 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1774 /* all that work just for this */
1775 my_setenv_format(new_env, nam, nlen, val, vlen);
1776 (void)putenv(new_env);
1777# endif /* HAS_UNSETENV */
47dafe4d 1778# endif /* __CYGWIN__ */
50acdf95
MS
1779#ifndef PERL_USE_SAFE_PUTENV
1780 }
1781#endif
4efc5df6 1782 }
8d063cd8
LW
1783}
1784
c5d12488 1785#else /* WIN32 || NETWARE */
68dc0745
PP
1786
1787void
72229eff 1788Perl_my_setenv(pTHX_ const char *nam, const char *val)
68dc0745 1789{
27da23d5 1790 dVAR;
c5d12488
JH
1791 register char *envstr;
1792 const int nlen = strlen(nam);
1793 int vlen;
e6587932 1794
c5d12488
JH
1795 if (!val) {
1796 val = "";
ac5c734f 1797 }
c5d12488
JH
1798 vlen = strlen(val);
1799 Newx(envstr, nlen+vlen+2, char);
1800 my_setenv_format(envstr, nam, nlen, val, vlen);
1801 (void)PerlEnv_putenv(envstr);
1802 Safefree(envstr);
3e3baf6d
TB
1803}
1804
c5d12488 1805#endif /* WIN32 || NETWARE */
3e3baf6d 1806
c5d12488 1807#endif /* !VMS && !EPOC*/
378cc40b 1808
16d20bd9 1809#ifdef UNLINK_ALL_VERSIONS
79072805 1810I32
6e732051 1811Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
378cc40b 1812{
35da51f7 1813 I32 retries = 0;
378cc40b 1814
7918f24d
NC
1815 PERL_ARGS_ASSERT_UNLNK;
1816
35da51f7
AL
1817 while (PerlLIO_unlink(f) >= 0)
1818 retries++;
1819 return retries ? 0 : -1;
378cc40b
LW
1820}
1821#endif
1822
7a3f2258 1823/* this is a drop-in replacement for bcopy() */
2253333f 1824#if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
378cc40b 1825char *
7a3f2258 1826Perl_my_bcopy(register const char *from,register char *to,register I32 len)
378cc40b 1827{
2d03de9c 1828 char * const retval = to;
378cc40b 1829
7918f24d
NC
1830 PERL_ARGS_ASSERT_MY_BCOPY;
1831
7c0587c8
LW
1832 if (from - to >= 0) {
1833 while (len--)
1834 *to++ = *from++;
1835 }
1836 else {
1837 to += len;
1838 from += len;
1839 while (len--)
faf8582f 1840 *(--to) = *(--from);
7c0587c8 1841 }
378cc40b
LW
1842 return retval;
1843}
ffed7fef 1844#endif
378cc40b 1845
7a3f2258 1846/* this is a drop-in replacement for memset() */
fc36a67e
PP
1847#ifndef HAS_MEMSET
1848void *
7a3f2258 1849Perl_my_memset(register char *loc, register I32 ch, register I32 len)
fc36a67e 1850{
2d03de9c 1851 char * const retval = loc;
fc36a67e 1852
7918f24d
NC
1853 PERL_ARGS_ASSERT_MY_MEMSET;
1854
fc36a67e
PP
1855 while (len--)
1856 *loc++ = ch;
1857 return retval;
1858}
1859#endif
1860
7a3f2258 1861/* this is a drop-in replacement for bzero() */
7c0587c8 1862#if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
378cc40b 1863char *
7a3f2258 1864Perl_my_bzero(register char *loc, register I32 len)
378cc40b 1865{
2d03de9c 1866 char * const retval = loc;
378cc40b 1867
7918f24d
NC
1868 PERL_ARGS_ASSERT_MY_BZERO;
1869
378cc40b
LW
1870 while (len--)
1871 *loc++ = 0;
1872 return retval;
1873}
1874#endif
7c0587c8 1875
7a3f2258 1876/* this is a drop-in replacement for memcmp() */
36477c24 1877#if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
79072805 1878I32
7a3f2258 1879Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
7c0587c8 1880{
e1ec3a88
AL
1881 register const U8 *a = (const U8 *)s1;
1882 register const U8 *b = (const U8 *)s2;
79072805 1883 register I32 tmp;
7c0587c8 1884
7918f24d
NC
1885 PERL_ARGS_ASSERT_MY_MEMCMP;
1886
7c0587c8 1887 while (len--) {
27da23d5 1888 if ((tmp = *a++ - *b++))
7c0587c8
LW
1889 return tmp;
1890 }
1891 return 0;
1892}
36477c24 1893#endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
a687059c 1894
fe14fcc3 1895#ifndef HAS_VPRINTF
d05d9be5
AD
1896/* This vsprintf replacement should generally never get used, since
1897 vsprintf was available in both System V and BSD 2.11. (There may
1898 be some cross-compilation or embedded set-ups where it is needed,
1899 however.)
1900
1901 If you encounter a problem in this function, it's probably a symptom
1902 that Configure failed to detect your system's vprintf() function.
1903 See the section on "item vsprintf" in the INSTALL file.
1904
1905 This version may compile on systems with BSD-ish <stdio.h>,
1906 but probably won't on others.
1907*/
a687059c 1908
85e6fe83 1909#ifdef USE_CHAR_VSPRINTF
a687059c
LW
1910char *
1911#else
1912int
1913#endif
d05d9be5 1914vsprintf(char *dest, const char *pat, void *args)
a687059c
LW
1915{
1916 FILE fakebuf;
1917
d05d9be5
AD
1918#if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE)
1919 FILE_ptr(&fakebuf) = (STDCHAR *) dest;
1920 FILE_cnt(&fakebuf) = 32767;
1921#else
1922 /* These probably won't compile -- If you really need
1923 this, you'll have to figure out some other method. */
a687059c
LW
1924 fakebuf._ptr = dest;
1925 fakebuf._cnt = 32767;
d05d9be5 1926#endif
35c8bce7
LW
1927#ifndef _IOSTRG
1928#define _IOSTRG 0
1929#endif
a687059c
LW
1930 fakebuf._flag = _IOWRT|_IOSTRG;
1931 _doprnt(pat, args, &fakebuf); /* what a kludge */
d05d9be5
AD
1932#if defined(STDIO_PTR_LVALUE)
1933 *(FILE_ptr(&fakebuf)++) = '\0';
1934#else
1935 /* PerlIO has probably #defined away fputc, but we want it here. */
1936# ifdef fputc
1937# undef fputc /* XXX Should really restore it later */
1938# endif
1939 (void)fputc('\0', &fakebuf);
1940#endif
85e6fe83 1941#ifdef USE_CHAR_VSPRINTF
a687059c
LW
1942 return(dest);
1943#else
1944 return 0; /* perl doesn't use return value */
1945#endif
1946}
1947
fe14fcc3 1948#endif /* HAS_VPRINTF */
a687059c
LW
1949
1950#ifdef MYSWAP
ffed7fef 1951#if BYTEORDER != 0x4321
a687059c 1952short
864dbfa3 1953Perl_my_swap(pTHX_ short s)
a687059c
LW
1954{
1955#if (BYTEORDER & 1) == 0
1956 short result;
1957
1958 result = ((s & 255) << 8) + ((s >> 8) & 255);
1959 return result;
1960#else
1961 return s;
1962#endif
1963}
1964
1965long
864dbfa3 1966Perl_my_htonl(pTHX_ long l)
a687059c
LW
1967{
1968 union {
1969 long result;
ffed7fef 1970 char c[sizeof(long)];
a687059c
LW
1971 } u;
1972
cef6ea9d
JH
1973#if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678
1974#if BYTEORDER == 0x12345678
1975 u.result = 0;
1976#endif
a687059c
LW
1977 u.c[0] = (l >> 24) & 255;
1978 u.c[1] = (l >> 16) & 255;
1979 u.c[2] = (l >> 8) & 255;
1980 u.c[3] = l & 255;
1981 return u.result;
1982#else
ffed7fef 1983#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 1984 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 1985#else
79072805
LW
1986 register I32 o;
1987 register I32 s;
a687059c 1988
ffed7fef
LW
1989 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1990 u.c[o & 0xf] = (l >> s) & 255;
a687059c
LW
1991 }
1992 return u.result;
1993#endif
1994#endif
1995}
1996
1997long
864dbfa3 1998Perl_my_ntohl(pTHX_ long l)
a687059c
LW
1999{
2000 union {
2001 long l;
ffed7fef 2002 char c[sizeof(long)];
a687059c
LW
2003 } u;
2004
ffed7fef 2005#if BYTEORDER == 0x1234
a687059c
LW
2006 u.c[0] = (l >> 24) & 255;
2007 u.c[1] = (l >> 16) & 255;
2008 u.c[2] = (l >> 8) & 255;
2009 u.c[3] = l & 255;
2010 return u.l;
2011#else
ffed7fef 2012#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 2013 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 2014#else
79072805
LW
2015 register I32 o;
2016 register I32 s;
a687059c
LW
2017
2018 u.l = l;
2019 l = 0;
ffed7fef
LW
2020 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
2021 l |= (u.c[o & 0xf] & 255) << s;
a687059c
LW
2022 }
2023 return l;
2024#endif
2025#endif
2026}
2027
ffed7fef 2028#endif /* BYTEORDER != 0x4321 */
988174c1
LW
2029#endif /* MYSWAP */
2030
2031/*
2032 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
2033 * If these functions are defined,
2034 * the BYTEORDER is neither 0x1234 nor 0x4321.
2035 * However, this is not assumed.
2036 * -DWS
2037 */
2038
1109a392 2039#define HTOLE(name,type) \
988174c1 2040 type \
ba106d47 2041 name (register type n) \
988174c1
LW
2042 { \
2043 union { \
2044 type value; \
2045 char c[sizeof(type)]; \
2046 } u; \
bb7a0f54
MHM
2047 register U32 i; \
2048 register U32 s = 0; \
1109a392 2049 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
988174c1
LW
2050 u.c[i] = (n >> s) & 0xFF; \
2051 } \
2052 return u.value; \
2053 }
2054
1109a392 2055#define LETOH(name,type) \
988174c1 2056 type \
ba106d47 2057 name (register type n) \
988174c1
LW
2058 { \
2059 union { \
2060 type value; \
2061 char c[sizeof(type)]; \
2062 } u; \
bb7a0f54
MHM
2063 register U32 i; \
2064 register U32 s = 0; \
988174c1
LW
2065 u.value = n; \
2066 n = 0; \
1109a392
MHM
2067 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
2068 n |= ((type)(u.c[i] & 0xFF)) << s; \
988174c1
LW
2069 } \
2070 return n; \
2071 }
2072
1109a392
MHM
2073/*
2074 * Big-endian byte order functions.
2075 */
2076
2077#define HTOBE(name,type) \
2078 type \
2079 name (register type n) \
2080 { \
2081 union { \
2082 type value; \
2083 char c[sizeof(type)]; \
2084 } u; \
bb7a0f54
MHM
2085 register U32 i; \
2086 register U32 s = 8*(sizeof(u.c)-1); \
1109a392
MHM
2087 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2088 u.c[i] = (n >> s) & 0xFF; \
2089 } \
2090 return u.value; \
2091 }
2092
2093#define BETOH(name,type) \
2094 type \
2095 name (register type n) \
2096 { \
2097 union { \
2098 type value; \
2099 char c[sizeof(type)]; \
2100 } u; \
bb7a0f54
MHM
2101 register U32 i; \
2102 register U32 s = 8*(sizeof(u.c)-1); \
1109a392
MHM
2103 u.value = n; \
2104 n = 0; \
2105 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
2106 n |= ((type)(u.c[i] & 0xFF)) << s; \
2107 } \
2108 return n; \
2109 }
2110
2111/*
2112 * If we just can't do it...
2113 */
2114
2115#define NOT_AVAIL(name,type) \
2116 type \
2117 name (register type n) \
2118 { \
2119 Perl_croak_nocontext(#name "() not available"); \
2120 return n; /* not reached */ \
2121 }
2122
2123
988174c1 2124#if defined(HAS_HTOVS) && !defined(htovs)
1109a392 2125HTOLE(htovs,short)
988174c1
LW
2126#endif
2127#if defined(HAS_HTOVL) && !defined(htovl)
1109a392 2128HTOLE(htovl,long)
988174c1
LW
2129#endif
2130#if defined(HAS_VTOHS) && !defined(vtohs)
1109a392 2131LETOH(vtohs,short)
988174c1
LW
2132#endif
2133#if defined(HAS_VTOHL) && !defined(vtohl)
1109a392
MHM
2134LETOH(vtohl,long)
2135#endif
2136
2137#ifdef PERL_NEED_MY_HTOLE16
2138# if U16SIZE == 2
2139HTOLE(Perl_my_htole16,U16)
2140# else
2141NOT_AVAIL(Perl_my_htole16,U16)
2142# endif
2143#endif
2144#ifdef PERL_NEED_MY_LETOH16
2145# if U16SIZE == 2
2146LETOH(Perl_my_letoh16,U16)
2147# else
2148NOT_AVAIL(Perl_my_letoh16,U16)
2149# endif
2150#endif
2151#ifdef PERL_NEED_MY_HTOBE16
2152# if U16SIZE == 2
2153HTOBE(Perl_my_htobe16,U16)
2154# else
2155NOT_AVAIL(Perl_my_htobe16,U16)
2156# endif
2157#endif
2158#ifdef PERL_NEED_MY_BETOH16
2159# if U16SIZE == 2
2160BETOH(Perl_my_betoh16,U16)
2161# else
2162NOT_AVAIL(Perl_my_betoh16,U16)
2163# endif
2164#endif
2165
2166#ifdef PERL_NEED_MY_HTOLE32
2167# if U32SIZE == 4
2168HTOLE(Perl_my_htole32,U32)
2169# else
2170NOT_AVAIL(Perl_my_htole32,U32)
2171# endif
2172#endif
2173#ifdef PERL_NEED_MY_LETOH32
2174# if U32SIZE == 4
2175LETOH(Perl_my_letoh32,U32)
2176# else
2177NOT_AVAIL(Perl_my_letoh32,U32)
2178# endif
2179#endif
2180#ifdef PERL_NEED_MY_HTOBE32
2181# if U32SIZE == 4
2182HTOBE(Perl_my_htobe32,U32)
2183# else
2184NOT_AVAIL(Perl_my_htobe32,U32)
2185# endif
2186#endif
2187#ifdef PERL_NEED_MY_BETOH32
2188# if U32SIZE == 4
2189BETOH(Perl_my_betoh32,U32)
2190# else
2191NOT_AVAIL(Perl_my_betoh32,U32)
2192# endif
2193#endif
2194
2195#ifdef PERL_NEED_MY_HTOLE64
2196# if U64SIZE == 8
2197HTOLE(Perl_my_htole64,U64)
2198# else
2199NOT_AVAIL(Perl_my_htole64,U64)
2200# endif
2201#endif
2202#ifdef PERL_NEED_MY_LETOH64
2203# if U64SIZE == 8
2204LETOH(Perl_my_letoh64,U64)
2205# else
2206NOT_AVAIL(Perl_my_letoh64,U64)
2207# endif
2208#endif
2209#ifdef PERL_NEED_MY_HTOBE64
2210# if U64SIZE == 8
2211HTOBE(Perl_my_htobe64,U64)
2212# else
2213NOT_AVAIL(Perl_my_htobe64,U64)
2214# endif
2215#endif
2216#ifdef PERL_NEED_MY_BETOH64
2217# if U64SIZE == 8
2218BETOH(Perl_my_betoh64,U64)
2219# else
2220NOT_AVAIL(Perl_my_betoh64,U64)
2221# endif
988174c1 2222#endif
a687059c 2223
1109a392
MHM
2224#ifdef PERL_NEED_MY_HTOLES
2225HTOLE(Perl_my_htoles,short)
2226#endif
2227#ifdef PERL_NEED_MY_LETOHS
2228LETOH(Perl_my_letohs,short)
2229#endif
2230#ifdef PERL_NEED_MY_HTOBES
2231HTOBE(Perl_my_htobes,short)
2232#endif
2233#ifdef PERL_NEED_MY_BETOHS
2234BETOH(Perl_my_betohs,short)
2235#endif
2236
2237#ifdef PERL_NEED_MY_HTOLEI
2238HTOLE(Perl_my_htolei,int)
2239#endif
2240#ifdef PERL_NEED_MY_LETOHI
2241LETOH(Perl_my_letohi,int)
2242#endif
2243#ifdef PERL_NEED_MY_HTOBEI
2244HTOBE(Perl_my_htobei,int)
2245#endif
2246#ifdef PERL_NEED_MY_BETOHI
2247BETOH(Perl_my_betohi,int)
2248#endif
2249
2250#ifdef PERL_NEED_MY_HTOLEL
2251HTOLE(Perl_my_htolel,long)
2252#endif
2253#ifdef PERL_NEED_MY_LETOHL
2254LETOH(Perl_my_letohl,long)
2255#endif
2256#ifdef PERL_NEED_MY_HTOBEL
2257HTOBE(Perl_my_htobel,long)
2258#endif
2259#ifdef PERL_NEED_MY_BETOHL
2260BETOH(Perl_my_betohl,long)
2261#endif
2262
2263void
2264Perl_my_swabn(void *ptr, int n)
2265{
2266 register char *s = (char *)ptr;
2267 register char *e = s + (n-1);
2268 register char tc;
2269
7918f24d
NC
2270 PERL_ARGS_ASSERT_MY_SWABN;
2271
1109a392
MHM
2272 for (n /= 2; n > 0; s++, e--, n--) {
2273 tc = *s;
2274 *s = *e;
2275 *e = tc;
2276 }
2277}
2278
4a7d1889 2279PerlIO *
c9289b7b 2280Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args)
4a7d1889 2281{
e37778c2 2282#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__)
97aff369 2283 dVAR;
1f852d0d
NIS
2284 int p[2];
2285 register I32 This, that;
2286 register Pid_t pid;
2287 SV *sv;
2288 I32 did_pipes = 0;
2289 int pp[2];
2290
7918f24d
NC
2291 PERL_ARGS_ASSERT_MY_POPEN_LIST;
2292
1f852d0d
NIS
2293 PERL_FLUSHALL_FOR_CHILD;
2294 This = (*mode == 'w');
2295 that = !This;
2296 if (PL_tainting) {
2297 taint_env();
2298 taint_proper("Insecure %s%s", "EXEC");
2299 }
2300 if (PerlProc_pipe(p) < 0)
4608196e 2301 return NULL;
1f852d0d
NIS
2302 /* Try for another pipe pair for error return */
2303 if (PerlProc_pipe(pp) >= 0)
2304 did_pipes = 1;
52e18b1f 2305 while ((pid = PerlProc_fork()) < 0) {
1f852d0d
NIS
2306 if (errno != EAGAIN) {
2307 PerlLIO_close(p[This]);
4e6dfe71 2308 PerlLIO_close(p[that]);
1f852d0d
NIS
2309 if (did_pipes) {
2310 PerlLIO_close(pp[0]);
2311 PerlLIO_close(pp[1]);
2312 }
4608196e 2313 return NULL;
1f852d0d 2314 }
a2a5de95 2315 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
1f852d0d
NIS
2316 sleep(5);
2317 }
2318 if (pid == 0) {
2319 /* Child */
1f852d0d
NIS
2320#undef THIS
2321#undef THAT
2322#define THIS that
2323#define THAT This
1f852d0d
NIS
2324 /* Close parent's end of error status pipe (if any) */
2325 if (did_pipes) {
2326 PerlLIO_close(pp[0]);
2327#if defined(HAS_FCNTL) && defined(F_SETFD)
2328 /* Close error pipe automatically if exec works */
2329 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2330#endif
2331 }
2332 /* Now dup our end of _the_ pipe to right position */
2333 if (p[THIS] != (*mode == 'r')) {
2334 PerlLIO_dup2(p[THIS], *mode == 'r');
2335 PerlLIO_close(p[THIS]);
4e6dfe71
GS
2336 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2337 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1f852d0d 2338 }
4e6dfe71
GS
2339 else
2340 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1f852d0d
NIS
2341#if !defined(HAS_FCNTL) || !defined(F_SETFD)
2342 /* No automatic close - do it by hand */
b7953727
JH
2343# ifndef NOFILE
2344# define NOFILE 20
2345# endif
a080fe3d
NIS
2346 {
2347 int fd;
2348
2349 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
3aed30dc 2350 if (fd != pp[1])
a080fe3d
NIS
2351 PerlLIO_close(fd);
2352 }
1f852d0d
NIS
2353 }
2354#endif
a0714e2c 2355 do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes);
1f852d0d
NIS
2356 PerlProc__exit(1);
2357#undef THIS
2358#undef THAT
2359 }
2360 /* Parent */
52e18b1f 2361 do_execfree(); /* free any memory malloced by child on fork */
1f852d0d
NIS
2362 if (did_pipes)
2363 PerlLIO_close(pp[1]);
2364 /* Keep the lower of the two fd numbers */
2365 if (p[that] < p[This]) {
2366 PerlLIO_dup2(p[This], p[that]);
2367 PerlLIO_close(p[This]);
2368 p[This] = p[that];
2369 }
4e6dfe71
GS
2370 else
2371 PerlLIO_close(p[that]); /* close child's end of pipe */
2372
1f852d0d 2373 sv = *av_fetch(PL_fdpid,p[This],TRUE);
862a34c6 2374 SvUPGRADE(sv,SVt_IV);
45977657 2375 SvIV_set(sv, pid);
1f852d0d
NIS
2376 PL_forkprocess = pid;
2377 /* If we managed to get status pipe check for exec fail */
2378 if (did_pipes && pid > 0) {
2379 int errkid;
bb7a0f54
MHM
2380 unsigned n = 0;
2381 SSize_t n1;
1f852d0d
NIS
2382
2383 while (n < sizeof(int)) {
2384 n1 = PerlLIO_read(pp[0],
2385 (void*)(((char*)&errkid)+n),
2386 (sizeof(int)) - n);
2387 if (n1 <= 0)
2388 break;
2389 n += n1;
2390 }
2391 PerlLIO_close(pp[0]);
2392 did_pipes = 0;
2393 if (n) { /* Error */
2394 int pid2, status;
8c51524e 2395 PerlLIO_close(p[This]);
1f852d0d
NIS
2396 if (n != sizeof(int))
2397 Perl_croak(aTHX_ "panic: kid popen errno read");
2398 do {
2399 pid2 = wait4pid(pid, &status, 0);
2400 } while (pid2 == -1 && errno == EINTR);
2401 errno = errkid; /* Propagate errno from kid */
4608196e 2402 return NULL;
1f852d0d
NIS
2403 }
2404 }
2405 if (did_pipes)
2406 PerlLIO_close(pp[0]);
2407 return PerlIO_fdopen(p[This], mode);
2408#else
9d419b5f 2409# ifdef OS2 /* Same, without fork()ing and all extra overhead... */
4e205ed6 2410 return my_syspopen4(aTHX_ NULL, mode, n, args);
9d419b5f 2411# else
4a7d1889
NIS
2412 Perl_croak(aTHX_ "List form of piped open not implemented");
2413 return (PerlIO *) NULL;
9d419b5f 2414# endif
1f852d0d 2415#endif
4a7d1889
NIS
2416}
2417
5f05dabc 2418 /* VMS' my_popen() is in VMS.c, same with OS/2. */
e37778c2 2419#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
760ac839 2420PerlIO *
3dd43144 2421Perl_my_popen(pTHX_ const char *cmd, const char *mode)
a687059c 2422{
97aff369 2423 dVAR;
a687059c 2424 int p[2];
8ac85365 2425 register I32 This, that;
d8a83dd3 2426 register Pid_t pid;
79072805 2427 SV *sv;
bfce84ec 2428 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
e446cec8
IZ
2429 I32 did_pipes = 0;
2430 int pp[2];
a687059c 2431
7918f24d
NC
2432 PERL_ARGS_ASSERT_MY_POPEN;
2433
45bc9206 2434 PERL_FLUSHALL_FOR_CHILD;
ddcf38b7
IZ
2435#ifdef OS2
2436 if (doexec) {
23da6c43 2437 return my_syspopen(aTHX_ cmd,mode);
ddcf38b7 2438 }
a1d180c4 2439#endif
8ac85365
NIS
2440 This = (*mode == 'w');
2441 that = !This;
3280af22 2442 if (doexec && PL_tainting) {
bbce6d69
PP
2443 taint_env();
2444 taint_proper("Insecure %s%s", "EXEC");
d48672a2 2445 }
c2267164 2446 if (PerlProc_pipe(p) < 0)
4608196e 2447 return NULL;
e446cec8
IZ
2448 if (doexec && PerlProc_pipe(pp) >= 0)
2449 did_pipes = 1;
52e18b1f 2450 while ((pid = PerlProc_fork()) < 0) {
a687059c 2451 if (errno != EAGAIN) {
6ad3d225 2452 PerlLIO_close(p[This]);
b5ac89c3 2453 PerlLIO_close(p[that]);
e446cec8
IZ
2454 if (did_pipes) {
2455 PerlLIO_close(pp[0]);
2456 PerlLIO_close(pp[1]);
2457 }
a687059c 2458 if (!doexec)
b3647a36 2459 Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno));
4608196e 2460 return NULL;
a687059c 2461 }
a2a5de95 2462 Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds");
a687059c
LW
2463 sleep(5);
2464 }
2465 if (pid == 0) {
79072805
LW
2466 GV* tmpgv;
2467
30ac6d9b
GS
2468#undef THIS
2469#undef THAT
a687059c 2470#define THIS that
8ac85365 2471#define THAT This
e446cec8
IZ
2472 if (did_pipes) {
2473 PerlLIO_close(pp[0]);
2474#if defined(HAS_FCNTL) && defined(F_SETFD)
2475 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2476#endif
2477 }
a687059c 2478 if (p[THIS] != (*mode == 'r')) {
6ad3d225
GS
2479 PerlLIO_dup2(p[THIS], *mode == 'r');
2480 PerlLIO_close(p[THIS]);
b5ac89c3
NIS
2481 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2482 PerlLIO_close(p[THAT]);
a687059c 2483 }
b5ac89c3
NIS
2484 else
2485 PerlLIO_close(p[THAT]);
4435c477 2486#ifndef OS2
a687059c 2487 if (doexec) {
a0d0e21e 2488#if !defined(HAS_FCNTL) || !defined(F_SETFD)
ae986130
LW
2489#ifndef NOFILE
2490#define NOFILE 20
2491#endif
a080fe3d 2492 {
3aed30dc 2493 int fd;
a080fe3d
NIS
2494
2495 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2496 if (fd != pp[1])
3aed30dc 2497 PerlLIO_close(fd);
a080fe3d 2498 }
ae986130 2499#endif
a080fe3d
NIS
2500 /* may or may not use the shell */
2501 do_exec3(cmd, pp[1], did_pipes);
6ad3d225 2502 PerlProc__exit(1);
a687059c 2503 }
4435c477 2504#endif /* defined OS2 */
713cef20
IZ
2505
2506#ifdef PERLIO_USING_CRLF
2507 /* Since we circumvent IO layers when we manipulate low-level
2508 filedescriptors directly, need to manually switch to the
2509 default, binary, low-level mode; see PerlIOBuf_open(). */
2510 PerlLIO_setmode((*mode == 'r'), O_BINARY);
2511#endif
2512
fafc274c 2513 if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) {
4d76a344 2514 SvREADONLY_off(GvSV(tmpgv));
7766f137 2515 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
4d76a344
RGS
2516 SvREADONLY_on(GvSV(tmpgv));
2517 }
2518#ifdef THREADS_HAVE_PIDS
2519 PL_ppid = (IV)getppid();
2520#endif
3280af22 2521 PL_forkprocess = 0;
ca0c25f6 2522#ifdef PERL_USES_PL_PIDSTATUS
3280af22 2523 hv_clear(PL_pidstatus); /* we have no children */
ca0c25f6 2524#endif
4608196e 2525 return NULL;
a687059c
LW
2526#undef THIS
2527#undef THAT
2528 }
b5ac89c3 2529 do_execfree(); /* free any memory malloced by child on vfork */
e446cec8
IZ
2530 if (did_pipes)
2531 PerlLIO_close(pp[1]);
8ac85365 2532 if (p[that] < p[This]) {
6ad3d225
GS
2533 PerlLIO_dup2(p[This], p[that]);
2534 PerlLIO_close(p[This]);
8ac85365 2535 p[This] = p[that];
62b28dd9 2536 }
b5ac89c3
NIS
2537 else
2538 PerlLIO_close(p[that]);
2539
3280af22 2540 sv = *av_fetch(PL_fdpid,p[This],TRUE);
862a34c6 2541 SvUPGRADE(sv,SVt_IV);
45977657 2542 SvIV_set(sv, pid);
3280af22 2543 PL_forkprocess = pid;
e446cec8
IZ
2544 if (did_pipes && pid > 0) {
2545 int errkid;
bb7a0f54
MHM
2546 unsigned n = 0;
2547 SSize_t n1;
e446cec8
IZ
2548
2549 while (n < sizeof(int)) {
2550 n1 = PerlLIO_read(pp[0],
2551 (void*)(((char*)&errkid)+n),
2552 (sizeof(int)) - n);
2553 if (n1 <= 0)
2554 break;
2555 n += n1;
2556 }
2f96c702
IZ
2557 PerlLIO_close(pp[0]);
2558 did_pipes = 0;
e446cec8 2559 if (n) { /* Error */
faa466a7 2560 int pid2, status;
8c51524e 2561 PerlLIO_close(p[This]);
e446cec8 2562 if (n != sizeof(int))
cea2e8a9 2563 Perl_croak(aTHX_ "panic: kid popen errno read");
faa466a7
RG
2564 do {
2565 pid2 = wait4pid(pid, &status, 0);
2566 } while (pid2 == -1 && errno == EINTR);
e446cec8 2567 errno = errkid; /* Propagate errno from kid */
4608196e 2568 return NULL;
e446cec8
IZ
2569 }
2570 }
2571 if (did_pipes)
2572 PerlLIO_close(pp[0]);
8ac85365 2573 return PerlIO_fdopen(p[This], mode);
a687059c 2574}
7c0587c8 2575#else
85ca448a 2576#if defined(atarist) || defined(EPOC)
7c0587c8 2577FILE *popen();
760ac839 2578PerlIO *
cef6ea9d 2579Perl_my_popen(pTHX_ const char *cmd, const char *mode)
7c0587c8 2580{
7918f24d 2581 PERL_ARGS_ASSERT_MY_POPEN;
45bc9206 2582 PERL_FLUSHALL_FOR_CHILD;
a1d180c4
NIS
2583 /* Call system's popen() to get a FILE *, then import it.
2584 used 0 for 2nd parameter to PerlIO_importFILE;
2585 apparently not used
2586 */
2587 return PerlIO_importFILE(popen(cmd, mode), 0);
7c0587c8 2588}
2b96b0a5
JH
2589#else
2590#if defined(DJGPP)
2591FILE *djgpp_popen();
2592PerlIO *
cef6ea9d 2593Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2b96b0a5
JH
2594{
2595 PERL_FLUSHALL_FOR_CHILD;
2596 /* Call system's popen() to get a FILE *, then import it.
2597 used 0 for 2nd parameter to PerlIO_importFILE;
2598 apparently not used
2599 */
2600 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2601}
9c12f1e5
RGS
2602#else
2603#if defined(__LIBCATAMOUNT__)
2604PerlIO *
2605Perl_my_popen(pTHX_ const char *cmd, const char *mode)
2606{
2607 return NULL;
2608}
2609#endif
2b96b0a5 2610#endif
7c0587c8
LW
2611#endif
2612
2613#endif /* !DOSISH */
a687059c 2614
52e18b1f
GS
2615/* this is called in parent before the fork() */
2616void
2617Perl_atfork_lock(void)
2618{
27da23d5 2619 dVAR;
3db8f154 2620#if defined(USE_ITHREADS)
52e18b1f
GS
2621 /* locks must be held in locking order (if any) */
2622# ifdef MYMALLOC
2623 MUTEX_LOCK(&PL_malloc_mutex);
2624# endif
2625 OP_REFCNT_LOCK;
2626#endif
2627}
2628
2629/* this is called in both parent and child after the fork() */
2630void
2631Perl_atfork_unlock(void)
2632{
27da23d5 2633 dVAR;
3db8f154 2634#if defined(USE_ITHREADS)
52e18b1f
GS
2635 /* locks must be released in same order as in atfork_lock() */
2636# ifdef MYMALLOC
2637 MUTEX_UNLOCK(&PL_malloc_mutex);
2638# endif
2639 OP_REFCNT_UNLOCK;
2640#endif
2641}
2642
2643Pid_t
2644Perl_my_fork(void)
2645{
2646#if defined(HAS_FORK)
2647 Pid_t pid;
3db8f154 2648#if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
52e18b1f
GS
2649 atfork_lock();
2650 pid = fork();
2651 atfork_unlock();
2652#else
2653 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2654 * handlers elsewhere in the code */
2655 pid = fork();
2656#endif
2657 return pid;
2658#else
2659 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2660 Perl_croak_nocontext("fork() not available");
b961a566 2661 return 0;
52e18b1f
GS
2662#endif /* HAS_FORK */
2663}
2664
748a9306 2665#ifdef DUMP_FDS
35ff7856 2666void
c9289b7b 2667Perl_dump_fds(pTHX_ const char *const s)
ae986130
LW
2668{
2669 int fd;
c623ac67 2670 Stat_t tmpstatbuf;
ae986130 2671
7918f24d
NC
2672 PERL_ARGS_ASSERT_DUMP_FDS;
2673
bf49b057 2674 PerlIO_printf(Perl_debug_log,"%s", s);
ae986130 2675 for (fd = 0; fd < 32; fd++) {
6ad3d225 2676 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
bf49b057 2677 PerlIO_printf(Perl_debug_log," %d",fd);
ae986130 2678 }
bf49b057 2679 PerlIO_printf(Perl_debug_log,"\n");
27da23d5 2680 return;
ae986130 2681}
35ff7856 2682#endif /* DUMP_FDS */
ae986130 2683
fe14fcc3 2684#ifndef HAS_DUP2
fec02dd3 2685int
ba106d47 2686dup2(int oldfd, int newfd)
a687059c 2687{
a0d0e21e 2688#if defined(HAS_FCNTL) && defined(F_DUPFD)
fec02dd3
AD
2689 if (oldfd == newfd)
2690 return oldfd;
6ad3d225 2691 PerlLIO_close(newfd);
fec02dd3 2692 return fcntl(oldfd, F_DUPFD, newfd);
62b28dd9 2693#else
fc36a67e
PP
2694#define DUP2_MAX_FDS 256
2695 int fdtmp[DUP2_MAX_FDS];
79072805 2696 I32 fdx = 0;
ae986130
LW
2697 int fd;
2698
fe14fcc3 2699 if (oldfd == newfd)
fec02dd3 2700 return oldfd;
6ad3d225 2701 PerlLIO_close(newfd);
fc36a67e 2702 /* good enough for low fd's... */
6ad3d225 2703 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
fc36a67e 2704 if (fdx >= DUP2_MAX_FDS) {
6ad3d225 2705 PerlLIO_close(fd);
fc36a67e
PP
2706 fd = -1;
2707 break;
2708 }
ae986130 2709 fdtmp[fdx++] = fd;
fc36a67e 2710 }
ae986130 2711 while (fdx > 0)
6ad3d225 2712 PerlLIO_close(fdtmp[--fdx]);
fec02dd3 2713 return fd;
62b28dd9 2714#endif
a687059c
LW
2715}
2716#endif
2717
64ca3a65 2718#ifndef PERL_MICRO
ff68c719
PP
2719#ifdef HAS_SIGACTION
2720
2721Sighandler_t
864dbfa3 2722Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2723{
27da23d5 2724 dVAR;
ff68c719
PP
2725 struct sigaction act, oact;
2726
a10b1e10
JH
2727#ifdef USE_ITHREADS
2728 /* only "parent" interpreter can diddle signals */
2729 if (PL_curinterp != aTHX)
8aad04aa 2730 return (Sighandler_t) SIG_ERR;
a10b1e10
JH
2731#endif
2732
8aad04aa 2733 act.sa_handler = (void(*)(int))handler;
ff68c719
PP
2734 sigemptyset(&act.sa_mask);
2735 act.sa_flags = 0;
2736#ifdef SA_RESTART
4ffa73a3
JH
2737 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2738 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
0a8e0eff 2739#endif
358837b8 2740#if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
8aad04aa 2741 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
85264bed
CS
2742 act.sa_flags |= SA_NOCLDWAIT;
2743#endif
ff68c719 2744 if (sigaction(signo, &act, &oact) == -1)
8aad04aa 2745 return (Sighandler_t) SIG_ERR;
ff68c719 2746 else
8aad04aa 2747 return (Sighandler_t) oact.sa_handler;
ff68c719
PP
2748}
2749
2750Sighandler_t
864dbfa3 2751Perl_rsignal_state(pTHX_ int signo)
ff68c719
PP
2752{
2753 struct sigaction oact;
96a5add6 2754 PERL_UNUSED_CONTEXT;
ff68c719
PP
2755
2756 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
8aad04aa 2757 return (Sighandler_t) SIG_ERR;
ff68c719 2758 else
8aad04aa 2759 return (Sighandler_t) oact.sa_handler;
ff68c719
PP
2760}
2761
2762int
864dbfa3 2763Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2764{
27da23d5 2765 dVAR;
ff68c719
PP
2766 struct sigaction act;
2767
7918f24d
NC
2768 PERL_ARGS_ASSERT_RSIGNAL_SAVE;
2769
a10b1e10
JH
2770#ifdef USE_ITHREADS
2771 /* only "parent" interpreter can diddle signals */
2772 if (PL_curinterp != aTHX)
2773 return -1;
2774#endif
2775
8aad04aa 2776 act.sa_handler = (void(*)(int))handler;
ff68c719
PP
2777 sigemptyset(&act.sa_mask);
2778 act.sa_flags = 0;
2779#ifdef SA_RESTART
4ffa73a3
JH
2780 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2781 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
0a8e0eff 2782#endif
36b5d377 2783#if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
8aad04aa 2784 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
85264bed
CS
2785 act.sa_flags |= SA_NOCLDWAIT;
2786#endif
ff68c719
PP
2787 return sigaction(signo, &act, save);
2788}
2789
2790int
864dbfa3 2791Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2792{
27da23d5 2793 dVAR;
a10b1e10
JH
2794#ifdef USE_ITHREADS
2795 /* only "parent" interpreter can diddle signals */
2796 if (PL_curinterp != aTHX)
2797 return -1;
2798#endif
2799
ff68c719
PP
2800 return sigaction(signo, save, (struct sigaction *)NULL);
2801}
2802
2803#else /* !HAS_SIGACTION */
2804
2805Sighandler_t
864dbfa3 2806Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2807{
39f1703b 2808#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH
2809 /* only "parent" interpreter can diddle signals */
2810 if (PL_curinterp != aTHX)
8aad04aa 2811 return (Sighandler_t) SIG_ERR;
a10b1e10
JH
2812#endif
2813
6ad3d225 2814 return PerlProc_signal(signo, handler);
ff68c719
PP
2815}
2816
fabdb6c0 2817static Signal_t
4e35701f 2818sig_trap(int signo)
ff68c719 2819{
27da23d5
JH
2820 dVAR;
2821 PL_sig_trapped++;
ff68c719
PP
2822}
2823
2824Sighandler_t
864dbfa3 2825Perl_rsignal_state(pTHX_ int signo)
ff68c719 2826{
27da23d5 2827 dVAR;
ff68c719
PP
2828 Sighandler_t oldsig;
2829
39f1703b 2830#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH
2831 /* only "parent" interpreter can diddle signals */
2832 if (PL_curinterp != aTHX)
8aad04aa 2833 return (Sighandler_t) SIG_ERR;
a10b1e10
JH
2834#endif
2835
27da23d5 2836 PL_sig_trapped = 0;
6ad3d225
GS
2837 oldsig = PerlProc_signal(signo, sig_trap);
2838 PerlProc_signal(signo, oldsig);
27da23d5 2839 if (PL_sig_trapped)
3aed30dc 2840 PerlProc_kill(PerlProc_getpid(), signo);
ff68c719
PP
2841 return oldsig;
2842}
2843
2844int
864dbfa3 2845Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2846{
39f1703b 2847#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH
2848 /* only "parent" interpreter can diddle signals */
2849 if (PL_curinterp != aTHX)
2850 return -1;
2851#endif
6ad3d225 2852 *save = PerlProc_signal(signo, handler);
8aad04aa 2853 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
ff68c719
PP
2854}
2855
2856int
864dbfa3 2857Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2858{
39f1703b 2859#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH
2860 /* only "parent" interpreter can diddle signals */
2861 if (PL_curinterp != aTHX)
2862 return -1;
2863#endif
8aad04aa 2864 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
ff68c719
PP
2865}
2866
2867#endif /* !HAS_SIGACTION */
64ca3a65 2868#endif /* !PERL_MICRO */
ff68c719 2869
5f05dabc 2870 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
e37778c2 2871#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__)
79072805 2872I32
864dbfa3 2873Perl_my_pclose(pTHX_ PerlIO *ptr)
a687059c 2874{
97aff369 2875 dVAR;
ff68c719 2876 Sigsave_t hstat, istat, qstat;
a687059c 2877 int status;
a0d0e21e 2878 SV **svp;
d8a83dd3
JH
2879 Pid_t pid;
2880 Pid_t pid2;
03136e13 2881 bool close_failed;
4ee39169 2882 dSAVEDERRNO;
a687059c 2883
3280af22 2884 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
25d92023 2885 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
a0d0e21e 2886 SvREFCNT_dec(*svp);
3280af22 2887 *svp = &PL_sv_undef;
ddcf38b7
IZ
2888#ifdef OS2
2889 if (pid == -1) { /* Opened by popen. */
2890 return my_syspclose(ptr);
2891 }
a1d180c4 2892#endif
f1618b10
CS
2893 close_failed = (PerlIO_close(ptr) == EOF);
2894 SAVE_ERRNO;
7c0587c8 2895#ifdef UTS
6ad3d225 2896 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
7c0587c8 2897#endif
64ca3a65 2898#ifndef PERL_MICRO
8aad04aa
JH
2899 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2900 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2901 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
64ca3a65 2902#endif
748a9306 2903 do {
1d3434b8
GS
2904 pid2 = wait4pid(pid, &status, 0);
2905 } while (pid2 == -1 && errno == EINTR);
64ca3a65 2906#ifndef PERL_MICRO
ff68c719
PP
2907 rsignal_restore(SIGHUP, &hstat);
2908 rsignal_restore(SIGINT, &istat);
2909 rsignal_restore(SIGQUIT, &qstat);
64ca3a65 2910#endif
03136e13 2911 if (close_failed) {
4ee39169 2912 RESTORE_ERRNO;
03136e13
CS
2913 return -1;
2914 }
1d3434b8 2915 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
20188a90 2916}
9c12f1e5
RGS
2917#else
2918#if defined(__LIBCATAMOUNT__)
2919I32
2920Perl_my_pclose(pTHX_ PerlIO *ptr)
2921{
2922 return -1;
2923}
2924#endif
4633a7c4
LW
2925#endif /* !DOSISH */
2926
e37778c2 2927#if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__)
79072805 2928I32
d8a83dd3 2929Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
20188a90 2930{
97aff369 2931 dVAR;
27da23d5 2932 I32 result = 0;
7918f24d 2933 PERL_ARGS_ASSERT_WAIT4PID;
b7953727
JH
2934 if (!pid)
2935 return -1;
ca0c25f6 2936#ifdef PERL_USES_PL_PIDSTATUS
b7953727 2937 {
3aed30dc 2938 if (pid > 0) {
12072db5
NC
2939 /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the
2940 pid, rather than a string form. */
c4420975 2941 SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE);
3aed30dc
HS
2942 if (svp && *svp != &PL_sv_undef) {
2943 *statusp = SvIVX(*svp);
12072db5
NC
2944 (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),
2945 G_DISCARD);
3aed30dc
HS
2946 return pid;
2947 }
2948 }
2949 else {
2950 HE *entry;
2951
2952 hv_iterinit(PL_pidstatus);
2953 if ((entry = hv_iternext(PL_pidstatus))) {
c4420975 2954 SV * const sv = hv_iterval(PL_pidstatus,entry);
7ea75b61 2955 I32 len;
0bcc34c2 2956 const char * const spid = hv_iterkey(entry,&len);
27da23d5 2957
12072db5
NC
2958 assert (len == sizeof(Pid_t));
2959 memcpy((char *)&pid, spid, len);
3aed30dc 2960 *statusp = SvIVX(sv);
7b9a3241
NC
2961 /* The hash iterator is currently on this entry, so simply
2962 calling hv_delete would trigger the lazy delete, which on
2963 aggregate does more work, beacuse next call to hv_iterinit()
2964 would spot the flag, and have to call the delete routine,
2965 while in the meantime any new entries can't re-use that
2966 memory. */
2967 hv_iterinit(PL_pidstatus);
7ea75b61 2968 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3aed30dc
HS
2969 return pid;
2970 }
20188a90
LW
2971 }
2972 }
68a29c53 2973#endif
79072805 2974#ifdef HAS_WAITPID
367f3c24
IZ
2975# ifdef HAS_WAITPID_RUNTIME
2976 if (!HAS_WAITPID_RUNTIME)
2977 goto hard_way;
2978# endif
cddd4526 2979 result = PerlProc_waitpid(pid,statusp,flags);
dfcfdb64 2980 goto finish;
367f3c24
IZ
2981#endif
2982#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
4608196e 2983 result = wait4((pid==-1)?0:pid,statusp,flags,NULL);
dfcfdb64 2984 goto finish;
367f3c24 2985#endif
ca0c25f6 2986#ifdef PERL_USES_PL_PIDSTATUS
27da23d5 2987#if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
367f3c24 2988 hard_way:
27da23d5 2989#endif
a0d0e21e 2990 {
a0d0e21e 2991 if (flags)
cea2e8a9 2992 Perl_croak(aTHX_ "Can't do waitpid with flags");
a0d0e21e 2993 else {
76e3520e 2994 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
a0d0e21e
LW
2995 pidgone(result,*statusp);
2996 if (result < 0)
2997 *statusp = -1;
2998 }
a687059c
LW
2999 }
3000#endif
27da23d5 3001#if defined(HAS_WAITPID) || defined(HAS_WAIT4)
dfcfdb64 3002 finish:
27da23d5 3003#endif
cddd4526
NIS
3004 if (result < 0 && errno == EINTR) {
3005 PERL_ASYNC_CHECK();
48dbb59e 3006 errno = EINTR; /* reset in case a signal handler changed $! */
cddd4526
NIS
3007 }
3008 return result;
a687059c 3009}
2986a63f 3010#endif /* !DOSISH || OS2 || WIN32 || NETWARE */
a687059c 3011
ca0c25f6 3012#ifdef PERL_USES_PL_PIDSTATUS
7c0587c8 3013void
ed4173ef 3014S_pidgone(pTHX_ Pid_t pid, int status)
a687059c 3015{
79072805 3016 register SV *sv;
a687059c 3017
12072db5 3018 sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE);
862a34c6 3019 SvUPGRADE(sv,SVt_IV);
45977657 3020 SvIV_set(sv, status);
20188a90 3021 return;
a687059c 3022}
ca0c25f6 3023#endif
a687059c 3024
85ca448a 3025#if defined(atarist) || defined(OS2) || defined(EPOC)
7c0587c8 3026int pclose();
ddcf38b7
IZ
3027#ifdef HAS_FORK
3028int /* Cannot prototype with I32
3029 in os2ish.h. */
ba106d47 3030my_syspclose(PerlIO *ptr)
ddcf38b7 3031#else
79072805 3032I32
864dbfa3 3033Perl_my_pclose(pTHX_ PerlIO *ptr)
a1d180c4 3034#endif
a687059c 3035{
760ac839 3036 /* Needs work for PerlIO ! */
c4420975 3037 FILE * const f = PerlIO_findFILE(ptr);
7452cf6a 3038 const I32 result = pclose(f);
2b96b0a5
JH
3039 PerlIO_releaseFILE(ptr,f);
3040 return result;
3041}
3042#endif
3043
933fea7f 3044#if defined(DJGPP)
2b96b0a5
JH
3045int djgpp_pclose();
3046I32
3047Perl_my_pclose(pTHX_ PerlIO *ptr)
3048{
3049 /* Needs work for PerlIO ! */
c4420975 3050 FILE * const f = PerlIO_findFILE(ptr);
2b96b0a5 3051 I32 result = djgpp_pclose(f);
933fea7f 3052 result = (result << 8) & 0xff00;
760ac839
LW
3053 PerlIO_releaseFILE(ptr,f);
3054 return result;
a687059c 3055}
7c0587c8 3056#endif
9f68db38 3057
16fa5c11 3058#define PERL_REPEATCPY_LINEAR 4
9f68db38 3059void
16fa5c11 3060Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count)
9f68db38 3061{
7918f24d
NC
3062 PERL_ARGS_ASSERT_REPEATCPY;
3063
16fa5c11
VP
3064 if (len == 1)
3065 memset(to, *from, count);
3066 else if (count) {
3067 register char *p = to;
3068 I32 items, linear, half;
3069
3070 linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR;
3071 for (items = 0; items < linear; ++items) {
3072 register const char *q = from;
3073 I32 todo;
3074 for (todo = len; todo > 0; todo--)
3075 *p++ = *q++;
3076 }
3077
3078 half = count / 2;
3079 while (items <= half) {
3080 I32 size = items * len;
3081 memcpy(p, to, size);
3082 p += size;
3083 items *= 2;
9f68db38 3084 }
16fa5c11
VP
3085
3086 if (count > items)
3087 memcpy(p, to, (count - items) * len);
9f68db38
LW
3088 }
3089}
0f85fab0 3090
fe14fcc3 3091#ifndef HAS_RENAME
79072805 3092I32
4373e329 3093Perl_same_dirent(pTHX_ const char *a, const char *b)
62b28dd9 3094{
93a17b20
LW
3095 char *fa = strrchr(a,'/');
3096 char *fb = strrchr(b,'/');
c623ac67
GS
3097 Stat_t tmpstatbuf1;
3098 Stat_t tmpstatbuf2;
c4420975 3099 SV * const tmpsv = sv_newmortal();
62b28dd9 3100
7918f24d
NC
3101 PERL_ARGS_ASSERT_SAME_DIRENT;
3102
62b28dd9
LW
3103 if (fa)
3104 fa++;
3105 else
3106 fa = a;
3107 if (fb)
3108 fb++;
3109 else
3110 fb = b;
3111 if (strNE(a,b))
3112 return FALSE;
3113 if (fa == a)
76f68e9b 3114 sv_setpvs(tmpsv, ".");
62b28dd9 3115 else
46fc3d4c 3116 sv_setpvn(tmpsv, a, fa - a);
95a20fc0 3117 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
62b28dd9
LW
3118 return FALSE;
3119 if (fb == b)
76f68e9b 3120 sv_setpvs(tmpsv, ".");
62b28dd9 3121 else
46fc3d4c 3122 sv_setpvn(tmpsv, b, fb - b);
95a20fc0 3123 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
62b28dd9
LW
3124 return FALSE;
3125 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
3126 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
3127}
fe14fcc3
LW
3128#endif /* !HAS_RENAME */
3129
491527d0 3130char*
7f315aed
NC
3131Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
3132 const char *const *const search_ext, I32 flags)
491527d0 3133{
97aff369 3134 dVAR;
bd61b366
SS
3135 const char *xfound = NULL;
3136 char *xfailed = NULL;
0f31cffe 3137 char tmpbuf[MAXPATHLEN];
491527d0 3138 register char *s;
5f74f29c 3139 I32 len = 0;
491527d0 3140 int retval;
39a02377 3141 char *bufend;
491527d0
GS
3142#if defined(DOSISH) && !defined(OS2) && !defined(atarist)
3143# define SEARCH_EXTS ".bat", ".cmd", NULL
3144# define MAX_EXT_LEN 4
3145#endif
3146#ifdef OS2
3147# define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
3148# define MAX_EXT_LEN 4
3149#endif
3150#ifdef VMS
3151# define SEARCH_EXTS ".pl", ".com", NULL
3152# define MAX_EXT_LEN 4
3153#endif
3154 /* additional extensions to try in each dir if scriptname not found */
3155#ifdef SEARCH_EXTS
0bcc34c2 3156 static const char *const exts[] = { SEARCH_EXTS };
7f315aed 3157 const char *const *const ext = search_ext ? search_ext : exts;
491527d0 3158 int extidx = 0, i = 0;
bd61b366 3159 const char *curext = NULL;
491527d0 3160#else
53c1dcc0 3161 PERL_UNUSED_ARG(search_ext);
491527d0
GS
3162# define MAX_EXT_LEN 0
3163#endif
3164
7918f24d
NC
3165 PERL_ARGS_ASSERT_FIND_SCRIPT;
3166
491527d0
GS
3167 /*
3168 * If dosearch is true and if scriptname does not contain path
3169 * delimiters, search the PATH for scriptname.
3170 *
3171 * If SEARCH_EXTS is also defined, will look for each
3172 * scriptname{SEARCH_EXTS} whenever scriptname is not found
3173 * while searching the PATH.
3174 *
3175 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
3176 * proceeds as follows:
3177 * If DOSISH or VMSISH:
3178 * + look for ./scriptname{,.foo,.bar}
3179 * + search the PATH for scriptname{,.foo,.bar}
3180 *
3181 * If !DOSISH:
3182 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
3183 * this will not look in '.' if it's not in the PATH)
3184 */
84486fc6 3185 tmpbuf[0] = '\0';
491527d0
GS
3186
3187#ifdef VMS
3188# ifdef ALWAYS_DEFTYPES
3189 len = strlen(scriptname);
3190 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
c4420975 3191 int idx = 0, deftypes = 1;
491527d0
GS
3192 bool seen_dot = 1;
3193
bd61b366 3194 const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL);
491527d0
GS
3195# else
3196 if (dosearch) {
c4420975 3197 int idx = 0, deftypes = 1;
491527d0
GS
3198 bool seen_dot = 1;
3199
bd61b366 3200 const int hasdir = (strpbrk(scriptname,":[</") != NULL);
491527d0
GS
3201# endif
3202 /* The first time through, just add SEARCH_EXTS to whatever we
3203 * already have, so we can check for default file types. */
3204 while (deftypes ||
84486fc6 3205 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
491527d0
GS
3206 {
3207 if (deftypes) {
3208 deftypes = 0;
84486fc6 3209 *tmpbuf = '\0';
491527d0 3210 }
84486fc6
GS
3211 if ((strlen(tmpbuf) + strlen(scriptname)
3212 + MAX_EXT_LEN) >= sizeof tmpbuf)
491527d0 3213 continue; /* don't search dir with too-long name */
6fca0082 3214 my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf));
491527d0
GS
3215#else /* !VMS */
3216
3217#ifdef DOSISH
3218 if (strEQ(scriptname, "-"))
3219 dosearch = 0;
3220 if (dosearch) { /* Look in '.' first. */
fe2774ed 3221 const char *cur = scriptname;
491527d0
GS
3222#ifdef SEARCH_EXTS
3223 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
3224 while (ext[i])
3225 if (strEQ(ext[i++],curext)) {
3226 extidx = -1; /* already has an ext */
3227 break;
3228 }
3229 do {
3230#endif
3231 DEBUG_p(PerlIO_printf(Perl_debug_log,
3232 "Looking for %s\n",cur));
017f25f1
IZ
3233 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
3234 && !S_ISDIR(PL_statbuf.st_mode)) {
491527d0
GS
3235 dosearch = 0;
3236 scriptname = cur;
3237#ifdef SEARCH_EXTS
3238 break;
3239#endif
3240 }
3241#ifdef SEARCH_EXTS
3242 if (cur == scriptname) {
3243 len = strlen(scriptname);
84486fc6 3244 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
491527d0 3245 break;
9e4425f7
SH
3246 my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf));
3247 cur = tmpbuf;
491527d0
GS
3248 }
3249 } while (extidx >= 0 && ext[extidx] /* try an extension? */
6fca0082 3250 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len));
491527d0
GS
3251#endif
3252 }
3253#endif
3254
3255 if (dosearch && !strchr(scriptname, '/')
3256#ifdef DOSISH
3257 && !strchr(scriptname, '\\')
3258#endif
cd39f2b6 3259 && (s = PerlEnv_getenv("PATH")))
cd39f2b6 3260 {
491527d0 3261 bool seen_dot = 0;
92f0c265 3262
39a02377
DM
3263 bufend = s + strlen(s);
3264 while (s < bufend) {
491527d0
GS
3265#if defined(atarist) || defined(DOSISH)
3266 for (len = 0; *s
3267# ifdef atarist
3268 && *s != ','
3269# endif
3270 && *s != ';'; len++, s++) {
84486fc6
GS
3271 if (len < sizeof tmpbuf)
3272 tmpbuf[len] = *s;
491527d0 3273 }
84486fc6
GS
3274 if (len < sizeof tmpbuf)
3275 tmpbuf[len] = '\0';
491527d0 3276#else /* ! (atarist || DOSISH) */
39a02377 3277 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend,
491527d0
GS
3278 ':',
3279 &len);
3280#endif /* ! (atarist || DOSISH) */
39a02377 3281 if (s < bufend)
491527d0 3282 s++;
84486fc6 3283 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
491527d0
GS
3284 continue; /* don't search dir with too-long name */
3285 if (len
cd86ed9d 3286# if defined(atarist) || defined(DOSISH)
84486fc6
GS
3287 && tmpbuf[len - 1] != '/'
3288 && tmpbuf[len - 1] != '\\'
490a0e98 3289# endif
491527d0 3290 )
84486fc6
GS
3291 tmpbuf[len++] = '/';
3292 if (len == 2 && tmpbuf[0] == '.')
491527d0 3293 seen_dot = 1;
28f0d0ec 3294 (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len);
491527d0
GS
3295#endif /* !VMS */
3296
3297#ifdef SEARCH_EXTS
84486fc6 3298 len = strlen(tmpbuf);
491527d0
GS
3299 if (extidx > 0) /* reset after previous loop */
3300 extidx = 0;
3301 do {
3302#endif
84486fc6 3303 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3280af22 3304 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
017f25f1
IZ
3305 if (S_ISDIR(PL_statbuf.st_mode)) {
3306 retval = -1;
3307 }
491527d0
GS
3308#ifdef SEARCH_EXTS
3309 } while ( retval < 0 /* not there */
3310 && extidx>=0 && ext[extidx] /* try an extension? */
6fca0082 3311 && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)
491527d0
GS
3312 );
3313#endif
3314 if (retval < 0)
3315 continue;
3280af22
NIS
3316 if (S_ISREG(PL_statbuf.st_mode)
3317 && cando(S_IRUSR,TRUE,&PL_statbuf)
e37778c2 3318#if !defined(DOSISH)
3280af22 3319 && cando(S_IXUSR,TRUE,&PL_statbuf)
491527d0
GS
3320#endif
3321 )
3322 {
3aed30dc 3323 xfound = tmpbuf; /* bingo! */
491527d0
GS
3324 break;
3325 }
3326 if (!xfailed)
84486fc6 3327 xfailed = savepv(tmpbuf);
491527d0
GS
3328 }
3329#ifndef DOSISH
017f25f1 3330 if (!xfound && !seen_dot && !xfailed &&
a1d180c4 3331 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
017f25f1 3332 || S_ISDIR(PL_statbuf.st_mode)))
491527d0
GS
3333#endif
3334 seen_dot = 1; /* Disable message. */
9ccb31f9
GS
3335 if (!xfound) {
3336 if (flags & 1) { /* do or die? */
3aed30dc 3337 Perl_croak(aTHX_ "Can't %s %s%s%s",
9ccb31f9
GS
3338 (xfailed ? "execute" : "find"),
3339 (xfailed ? xfailed : scriptname),
3340 (xfailed ? "" : " on PATH"),
3341 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3342 }
bd61b366 3343 scriptname = NULL;
9ccb31f9 3344 }
43c5f42d 3345 Safefree(xfailed);
491527d0
GS
3346 scriptname = xfound;
3347 }
bd61b366 3348 return (scriptname ? savepv(scriptname) : NULL);
491527d0
GS
3349}
3350
ba869deb
GS
3351#ifndef PERL_GET_CONTEXT_DEFINED
3352
3353void *
3354Perl_get_context(void)
3355{
27da23d5 3356 dVAR;
3db8f154 3357#if defined(USE_ITHREADS)
ba869deb
GS
3358# ifdef OLD_PTHREADS_API
3359 pthread_addr_t t;
3360 if (pthread_getspecific(PL_thr_key, &t))
3361 Perl_croak_nocontext("panic: pthread_getspecific");
3362 return (void*)t;
3363# else
bce813aa 3364# ifdef I_MACH_CTHREADS
8b8b35ab 3365 return (void*)cthread_data(cthread_self());
bce813aa 3366# else
8b8b35ab
JH
3367 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3368# endif
c44d3fdb 3369# endif
ba869deb
GS
3370#else
3371 return (void*)NULL;
3372#endif
3373}
3374
3375void
3376Perl_set_context(void *t)
3377{
8772537c 3378 dVAR;
7918f24d 3379 PERL_ARGS_ASSERT_SET_CONTEXT;
3db8f154 3380#if defined(USE_ITHREADS)
c44d3fdb
GS
3381# ifdef I_MACH_CTHREADS
3382 cthread_set_data(cthread_self(), t);
3383# else
ba869deb
GS
3384 if (pthread_setspecific(PL_thr_key, t))
3385 Perl_croak_nocontext("panic: pthread_setspecific");
c44d3fdb 3386# endif
b464bac0 3387#else
8772537c 3388 PERL_UNUSED_ARG(t);
ba869deb
GS
3389#endif
3390}
3391
3392#endif /* !PERL_GET_CONTEXT_DEFINED */
491527d0 3393
27da23d5 3394#if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
22239a37 3395struct perl_vars *
864dbfa3 3396Perl_GetVars(pTHX)
22239a37 3397{
533c011a 3398 return &PL_Vars;
22239a37 3399}
31fb1209
NIS
3400#endif
3401
1cb0ed9b 3402char **
864dbfa3 3403Perl_get_op_names(pTHX)
31fb1209 3404{
96a5add6
AL
3405 PERL_UNUSED_CONTEXT;
3406 return (char **)PL_op_name;
31fb1209
NIS
3407}
3408
1cb0ed9b 3409char **
864dbfa3 3410Perl_get_op_descs(pTHX)
31fb1209 3411{
96a5add6
AL
3412 PERL_UNUSED_CONTEXT;
3413 return (char **)PL_op_desc;
31fb1209 3414}
9e6b2b00 3415
e1ec3a88 3416const char *
864dbfa3 3417Perl_get_no_modify(pTHX)
9e6b2b00 3418{
96a5add6
AL
3419 PERL_UNUSED_CONTEXT;
3420 return PL_no_modify;
9e6b2b00
GS
3421}
3422
3423U32 *
864dbfa3 3424Perl_get_opargs(pTHX)
9e6b2b00 3425{
96a5add6
AL
3426 PERL_UNUSED_CONTEXT;
3427 return (U32 *)PL_opargs;
9e6b2b00 3428}
51aa15f3 3429
0cb96387
GS
3430PPADDR_t*
3431Perl_get_ppaddr(pTHX)
3432{
96a5add6
AL
3433 dVAR;
3434 PERL_UNUSED_CONTEXT;
3435 return (PPADDR_t*)PL_ppaddr;
0cb96387
GS
3436}
3437
a6c40364
GS
3438#ifndef HAS_GETENV_LEN
3439char *
bf4acbe4 3440Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
a6c40364 3441{
8772537c 3442 char * const env_trans = PerlEnv_getenv(env_elem);
96a5add6 3443 PERL_UNUSED_CONTEXT;
7918f24d 3444 PERL_ARGS_ASSERT_GETENV_LEN;
a6c40364
GS
3445 if (env_trans)
3446 *len = strlen(env_trans);
3447 return env_trans;
f675dbe5
CB
3448}
3449#endif
3450
dc9e4912
GS
3451
3452MGVTBL*
864dbfa3 3453Perl_get_vtbl(pTHX_ int vtbl_id)
dc9e4912 3454{
7452cf6a 3455 const MGVTBL* result;
96a5add6 3456 PERL_UNUSED_CONTEXT;
dc9e4912
GS
3457
3458 switch(vtbl_id) {
3459 case want_vtbl_sv:
3460 result = &PL_vtbl_sv;
3461 break;
3462 case want_vtbl_env:
3463 result = &PL_vtbl_env;
3464 break;
3465 case want_vtbl_envelem:
3466 result = &PL_vtbl_envelem;
3467 break;
3468 case want_vtbl_sig:
3469 result = &PL_vtbl_sig;
3470 break;
3471 case want_vtbl_sigelem:
3472 result = &PL_vtbl_sigelem;
3473 break;
3474 case want_vtbl_pack:
3475 result = &PL_vtbl_pack;
3476 break;
3477 case want_vtbl_packelem:
3478 result = &PL_vtbl_packelem;
3479 break;
3480 case want_vtbl_dbline:
3481 result = &PL_vtbl_dbline;
3482 break;
3483 case want_vtbl_isa:
3484 result = &PL_vtbl_isa;
3485 break;
3486 case want_vtbl_isaelem:
3487 result = &PL_vtbl_isaelem;
3488 break;
3489 case want_vtbl_arylen:
3490 result = &PL_vtbl_arylen;
3491 break;
dc9e4912
GS
3492 case want_vtbl_mglob:
3493 result = &PL_vtbl_mglob;
3494 break;
3495 case want_vtbl_nkeys:
3496 result = &PL_vtbl_nkeys;
3497 break;
3498 case want_vtbl_taint:
3499 result = &PL_vtbl_taint;
3500 break;
3501 case want_vtbl_substr:
3502 result = &PL_vtbl_substr;
3503 break;
3504 case want_vtbl_vec:
3505 result = &PL_vtbl_vec;
3506 break;
3507 case want_vtbl_pos:
3508 result = &PL_vtbl_pos;
3509 break;
3510 case want_vtbl_bm:
3511 result = &PL_vtbl_bm;
3512 break;
3513 case want_vtbl_fm:
3514 result = &PL_vtbl_fm;
3515 break;
3516 case want_vtbl_uvar:
3517 result = &PL_vtbl_uvar;
3518 break;
dc9e4912
GS
3519 case want_vtbl_defelem:
3520 result = &PL_vtbl_defelem;
3521 break;
3522 case want_vtbl_regexp:
3523 result = &PL_vtbl_regexp;
3524 break;
3525 case want_vtbl_regdata:
3526 result = &PL_vtbl_regdata;
3527 break;
3528 case want_vtbl_regdatum:
3529 result = &PL_vtbl_regdatum;
3530 break;
3c90161d 3531#ifdef USE_LOCALE_COLLATE
dc9e4912
GS
3532 case want_vtbl_collxfrm:
3533 result = &PL_vtbl_collxfrm;
3534 break;
3c90161d 3535#endif
dc9e4912
GS
3536 case want_vtbl_amagic:
3537 result = &PL_vtbl_amagic;
3538 break;
3539 case want_vtbl_amagicelem:
3540 result = &PL_vtbl_amagicelem;
3541 break;
810b8aa5
GS
3542 case want_vtbl_backref:
3543 result = &PL_vtbl_backref;
3544 break;
7e8c5dac
HS
3545 case want_vtbl_utf8:
3546 result = &PL_vtbl_utf8;
3547 break;
7452cf6a 3548 default:
4608196e 3549 result = NULL;
7452cf6a 3550 break;
dc9e4912 3551 }
27da23d5 3552 return (MGVTBL*)result;
dc9e4912
GS
3553}
3554
767df6a1 3555I32
864dbfa3 3556Perl_my_fflush_all(pTHX)
767df6a1 3557{
f800e14d 3558#if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
ce720889 3559 return PerlIO_flush(NULL);
767df6a1 3560#else
8fbdfb7c 3561# if defined(HAS__FWALK)
f13a2bc0 3562 extern int fflush(FILE *);
74cac757
JH
3563 /* undocumented, unprototyped, but very useful BSDism */
3564 extern void _fwalk(int (*)(FILE *));
8fbdfb7c 3565 _fwalk(&fflush);
74cac757 3566 return 0;
8fa7f367 3567# else
8fbdfb7c 3568# if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
8fa7f367 3569 long open_max = -1;
8fbdfb7c 3570# ifdef PERL_FFLUSH_ALL_FOPEN_MAX
d2201af2 3571 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
8fbdfb7c 3572# else
8fa7f367 3573# if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
767df6a1 3574 open_max = sysconf(_SC_OPEN_MAX);
8fa7f367
JH
3575# else
3576# ifdef FOPEN_MAX
74cac757 3577 open_max = FO