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