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