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