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