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