This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
https://perl5.git.perl.org / perl5.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Newline trouble.
[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 24#ifndef SIG_ERR
25# define SIG_ERR ((Sighandler_t) -1)
26#endif
64ca3a65 27#endif
36477c24 28
ff68c719 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 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 172 if (ptr != Nullch) {
173 memset((void*)ptr, 0, size);
174 return ptr;
175 }
3280af22 176 else if (PL_nomemok)
1050c9ca 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 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 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 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 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 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);
cf93c79d
IZ		 507 if (len == 0) /* TAIL might be on on a zero-length string. */
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 813 if (big[pos] != first)
814 continue;
815 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
bbce6d69 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 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 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 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 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 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 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 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 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 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 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 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 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 1312 SV *msg;
1313
1314 ENTER;
3a1f2dc9 1315 save_re_context();
06bf62c7 1316 msg = newSVpvn(message, msglen);
774d564b 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 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
13b6e58c
JH		 1499#ifdef USE_ENVIRON_ARRAY
1500 /* VMS' and EPOC's my_setenv() is in vms.c and epoc.c */
2986a63f 1501#if !defined(WIN32) && !defined(NETWARE)
8d063cd8 1502void
864dbfa3 1503Perl_my_setenv(pTHX_ char *nam, char *val)
8d063cd8 1504{
f2517201
GS		 1505#ifndef PERL_USE_SAFE_PUTENV
1506 /* most putenv()s leak, so we manipulate environ directly */
79072805 1507 register I32 i=setenv_getix(nam); /* where does it go? */
8d063cd8 1508
3280af22 1509 if (environ == PL_origenviron) { /* need we copy environment? */
79072805
LW		 1510 I32 j;
1511 I32 max;
fe14fcc3
LW		 1512 char **tmpenv;
1513
de3bb511 1514 /*SUPPRESS 530*/
fe14fcc3 1515 for (max = i; environ[max]; max++) ;
f2517201
GS		 1516 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1517 for (j=0; j<max; j++) { /* copy environment */
1518 tmpenv[j] = (char*)safesysmalloc((strlen(environ[j])+1)*sizeof(char));
1519 strcpy(tmpenv[j], environ[j]);
1520 }
fe14fcc3
LW		 1521 tmpenv[max] = Nullch;
1522 environ = tmpenv; /* tell exec where it is now */
1523 }
a687059c 1524 if (!val) {
f2517201 1525 safesysfree(environ[i]);
a687059c
LW		 1526 while (environ[i]) {
1527 environ[i] = environ[i+1];
1528 i++;
1529 }
1530 return;
1531 }
8d063cd8 1532 if (!environ[i]) { /* does not exist yet */
f2517201 1533 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
8d063cd8
LW		 1534 environ[i+1] = Nullch; /* make sure it's null terminated */
1535 }
fe14fcc3 1536 else
f2517201
GS		 1537 safesysfree(environ[i]);
1538 environ[i] = (char*)safesysmalloc((strlen(nam)+strlen(val)+2) * sizeof(char));
1539
a687059c 1540 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
f2517201
GS		 1541
1542#else /* PERL_USE_SAFE_PUTENV */
47dafe4d
EF		 1543# if defined(__CYGWIN__)
1544 setenv(nam, val, 1);
1545# else
f2517201
GS		 1546 char *new_env;
1547
1548 new_env = (char*)safesysmalloc((strlen(nam) + strlen(val) + 2) * sizeof(char));
f2517201 1549 (void)sprintf(new_env,"%s=%s",nam,val);/* all that work just for this */
f2517201 1550 (void)putenv(new_env);
47dafe4d 1551# endif /* __CYGWIN__ */
f2517201 1552#endif /* PERL_USE_SAFE_PUTENV */
8d063cd8
LW		 1553}
1554
2986a63f 1555#else /* WIN32 || NETWARE */
68dc0745 1556
1557void
864dbfa3 1558Perl_my_setenv(pTHX_ char *nam,char *val)
68dc0745 1559{
ac5c734f
GS		 1560 register char *envstr;
1561 STRLEN len = strlen(nam) + 3;
1562 if (!val) {
1563 val = "";
1564 }
1565 len += strlen(val);
1566 New(904, envstr, len, char);
1567 (void)sprintf(envstr,"%s=%s",nam,val);
1568 (void)PerlEnv_putenv(envstr);
1569 Safefree(envstr);
3e3baf6d
TB		 1570}
1571
2986a63f 1572#endif /* WIN32 || NETWARE */
3e3baf6d
TB		 1573
1574I32
864dbfa3 1575Perl_setenv_getix(pTHX_ char *nam)
3e3baf6d
TB		 1576{
1577 register I32 i, len = strlen(nam);
1578
1579 for (i = 0; environ[i]; i++) {
1580 if (
1581#ifdef WIN32
1582 strnicmp(environ[i],nam,len) == 0
1583#else
1584 strnEQ(environ[i],nam,len)
1585#endif
1586 && environ[i][len] == '=')
1587 break; /* strnEQ must come first to avoid */
1588 } /* potential SEGV's */
1589 return i;
68dc0745 1590}
1591
ed79a026 1592#endif /* !VMS && !EPOC*/
378cc40b 1593
16d20bd9 1594#ifdef UNLINK_ALL_VERSIONS
79072805 1595I32
864dbfa3 1596Perl_unlnk(pTHX_ char *f) /* unlink all versions of a file */
378cc40b 1597{
79072805 1598 I32 i;
378cc40b 1599
6ad3d225 1600 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
378cc40b
LW		 1601 return i ? 0 : -1;
1602}
1603#endif
1604
7a3f2258 1605/* this is a drop-in replacement for bcopy() */
2253333f 1606#if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
378cc40b 1607char *
7a3f2258 1608Perl_my_bcopy(register const char *from,register char *to,register I32 len)
378cc40b
LW		 1609{
1610 char *retval = to;
1611
7c0587c8
LW		 1612 if (from - to >= 0) {
1613 while (len--)
1614 *to++ = *from++;
1615 }
1616 else {
1617 to += len;
1618 from += len;
1619 while (len--)
faf8582f 1620 *(--to) = *(--from);
7c0587c8 1621 }
378cc40b
LW		 1622 return retval;
1623}
ffed7fef 1624#endif
378cc40b 1625
7a3f2258 1626/* this is a drop-in replacement for memset() */
fc36a67e 1627#ifndef HAS_MEMSET
1628void *
7a3f2258 1629Perl_my_memset(register char *loc, register I32 ch, register I32 len)
fc36a67e 1630{
1631 char *retval = loc;
1632
1633 while (len--)
1634 *loc++ = ch;
1635 return retval;
1636}
1637#endif
1638
7a3f2258 1639/* this is a drop-in replacement for bzero() */
7c0587c8 1640#if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
378cc40b 1641char *
7a3f2258 1642Perl_my_bzero(register char *loc, register I32 len)
378cc40b
LW		 1643{
1644 char *retval = loc;
1645
1646 while (len--)
1647 *loc++ = 0;
1648 return retval;
1649}
1650#endif
7c0587c8 1651
7a3f2258 1652/* this is a drop-in replacement for memcmp() */
36477c24 1653#if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
79072805 1654I32
7a3f2258 1655Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
7c0587c8 1656{
36477c24 1657 register U8 *a = (U8 *)s1;
1658 register U8 *b = (U8 *)s2;
79072805 1659 register I32 tmp;
7c0587c8
LW		 1660
1661 while (len--) {
36477c24 1662 if (tmp = *a++ - *b++)
7c0587c8
LW		 1663 return tmp;
1664 }
1665 return 0;
1666}
36477c24 1667#endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
a687059c 1668
fe14fcc3 1669#ifndef HAS_VPRINTF
a687059c 1670
85e6fe83 1671#ifdef USE_CHAR_VSPRINTF
a687059c
LW		 1672char *
1673#else
1674int
1675#endif
08105a92 1676vsprintf(char *dest, const char *pat, char *args)
a687059c
LW		 1677{
1678 FILE fakebuf;
1679
1680 fakebuf._ptr = dest;
1681 fakebuf._cnt = 32767;
35c8bce7
LW		 1682#ifndef _IOSTRG
1683#define _IOSTRG 0
1684#endif
a687059c
LW		 1685 fakebuf._flag = _IOWRT|_IOSTRG;
1686 _doprnt(pat, args, &fakebuf); /* what a kludge */
1687 (void)putc('\0', &fakebuf);
85e6fe83 1688#ifdef USE_CHAR_VSPRINTF
a687059c
LW		 1689 return(dest);
1690#else
1691 return 0; /* perl doesn't use return value */
1692#endif
1693}
1694
fe14fcc3 1695#endif /* HAS_VPRINTF */
a687059c
LW		 1696
1697#ifdef MYSWAP
ffed7fef 1698#if BYTEORDER != 0x4321
a687059c 1699short
864dbfa3 1700Perl_my_swap(pTHX_ short s)
a687059c
LW		 1701{
1702#if (BYTEORDER & 1) == 0
1703 short result;
1704
1705 result = ((s & 255) << 8) + ((s >> 8) & 255);
1706 return result;
1707#else
1708 return s;
1709#endif
1710}
1711
1712long
864dbfa3 1713Perl_my_htonl(pTHX_ long l)
a687059c
LW		 1714{
1715 union {
1716 long result;
ffed7fef 1717 char c[sizeof(long)];
a687059c
LW		 1718 } u;
1719
ffed7fef 1720#if BYTEORDER == 0x1234
a687059c
LW		 1721 u.c[0] = (l >> 24) & 255;
1722 u.c[1] = (l >> 16) & 255;
1723 u.c[2] = (l >> 8) & 255;
1724 u.c[3] = l & 255;
1725 return u.result;
1726#else
ffed7fef 1727#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 1728 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 1729#else
79072805
LW		 1730 register I32 o;
1731 register I32 s;
a687059c 1732
ffed7fef
LW		 1733 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1734 u.c[o & 0xf] = (l >> s) & 255;
a687059c
LW		 1735 }
1736 return u.result;
1737#endif
1738#endif
1739}
1740
1741long
864dbfa3 1742Perl_my_ntohl(pTHX_ long l)
a687059c
LW		 1743{
1744 union {
1745 long l;
ffed7fef 1746 char c[sizeof(long)];
a687059c
LW		 1747 } u;
1748
ffed7fef 1749#if BYTEORDER == 0x1234
a687059c
LW		 1750 u.c[0] = (l >> 24) & 255;
1751 u.c[1] = (l >> 16) & 255;
1752 u.c[2] = (l >> 8) & 255;
1753 u.c[3] = l & 255;
1754 return u.l;
1755#else
ffed7fef 1756#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 1757 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 1758#else
79072805
LW		 1759 register I32 o;
1760 register I32 s;
a687059c
LW		 1761
1762 u.l = l;
1763 l = 0;
ffed7fef
LW		 1764 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1765 l |= (u.c[o & 0xf] & 255) << s;
a687059c
LW		 1766 }
1767 return l;
1768#endif
1769#endif
1770}
1771
ffed7fef 1772#endif /* BYTEORDER != 0x4321 */
988174c1
LW		 1773#endif /* MYSWAP */
1774
1775/*
1776 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1777 * If these functions are defined,
1778 * the BYTEORDER is neither 0x1234 nor 0x4321.
1779 * However, this is not assumed.
1780 * -DWS
1781 */
1782
1783#define HTOV(name,type) \
1784 type \
ba106d47 1785 name (register type n) \
988174c1
LW		 1786 { \
1787 union { \
1788 type value; \
1789 char c[sizeof(type)]; \
1790 } u; \
79072805
LW		 1791 register I32 i; \
1792 register I32 s; \
988174c1
LW		 1793 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1794 u.c[i] = (n >> s) & 0xFF; \
1795 } \
1796 return u.value; \
1797 }
1798
1799#define VTOH(name,type) \
1800 type \
ba106d47 1801 name (register type n) \
988174c1
LW		 1802 { \
1803 union { \
1804 type value; \
1805 char c[sizeof(type)]; \
1806 } u; \
79072805
LW		 1807 register I32 i; \
1808 register I32 s; \
988174c1
LW		 1809 u.value = n; \
1810 n = 0; \
1811 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1812 n += (u.c[i] & 0xFF) << s; \
1813 } \
1814 return n; \
1815 }
1816
1817#if defined(HAS_HTOVS) && !defined(htovs)
1818HTOV(htovs,short)
1819#endif
1820#if defined(HAS_HTOVL) && !defined(htovl)
1821HTOV(htovl,long)
1822#endif
1823#if defined(HAS_VTOHS) && !defined(vtohs)
1824VTOH(vtohs,short)
1825#endif
1826#if defined(HAS_VTOHL) && !defined(vtohl)
1827VTOH(vtohl,long)
1828#endif
a687059c 1829
4a7d1889
NIS		 1830PerlIO *
1831Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
1832{
2986a63f 1833#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1f852d0d
NIS		 1834 int p[2];
1835 register I32 This, that;
1836 register Pid_t pid;
1837 SV *sv;
1838 I32 did_pipes = 0;
1839 int pp[2];
1840
1841 PERL_FLUSHALL_FOR_CHILD;
1842 This = (*mode == 'w');
1843 that = !This;
1844 if (PL_tainting) {
1845 taint_env();
1846 taint_proper("Insecure %s%s", "EXEC");
1847 }
1848 if (PerlProc_pipe(p) < 0)
1849 return Nullfp;
1850 /* Try for another pipe pair for error return */
1851 if (PerlProc_pipe(pp) >= 0)
1852 did_pipes = 1;
52e18b1f 1853 while ((pid = PerlProc_fork()) < 0) {
1f852d0d
NIS		 1854 if (errno != EAGAIN) {
1855 PerlLIO_close(p[This]);
1856 if (did_pipes) {
1857 PerlLIO_close(pp[0]);
1858 PerlLIO_close(pp[1]);
1859 }
1860 return Nullfp;
1861 }
1862 sleep(5);
1863 }
1864 if (pid == 0) {
1865 /* Child */
1f852d0d
NIS		 1866#undef THIS
1867#undef THAT
1868#define THIS that
1869#define THAT This
1870 /* Close parent's end of _the_ pipe */
1871 PerlLIO_close(p[THAT]);
1872 /* Close parent's end of error status pipe (if any) */
1873 if (did_pipes) {
1874 PerlLIO_close(pp[0]);
1875#if defined(HAS_FCNTL) && defined(F_SETFD)
1876 /* Close error pipe automatically if exec works */
1877 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
1878#endif
1879 }
1880 /* Now dup our end of _the_ pipe to right position */
1881 if (p[THIS] != (*mode == 'r')) {
1882 PerlLIO_dup2(p[THIS], *mode == 'r');
1883 PerlLIO_close(p[THIS]);
1884 }
1885#if !defined(HAS_FCNTL) || !defined(F_SETFD)
1886 /* No automatic close - do it by hand */
b7953727
JH		 1887# ifndef NOFILE
1888# define NOFILE 20
1889# endif
a080fe3d
NIS		 1890 {
1891 int fd;
1892
1893 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
1894 if (fd != pp[1])
1895 PerlLIO_close(fd);
1896 }
1f852d0d
NIS		 1897 }
1898#endif
1899 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
1900 PerlProc__exit(1);
1901#undef THIS
1902#undef THAT
1903 }
1904 /* Parent */
52e18b1f 1905 do_execfree(); /* free any memory malloced by child on fork */
1f852d0d
NIS		 1906 /* Close child's end of pipe */
1907 PerlLIO_close(p[that]);
1908 if (did_pipes)
1909 PerlLIO_close(pp[1]);
1910 /* Keep the lower of the two fd numbers */
1911 if (p[that] < p[This]) {
1912 PerlLIO_dup2(p[This], p[that]);
1913 PerlLIO_close(p[This]);
1914 p[This] = p[that];
1915 }
1916 LOCK_FDPID_MUTEX;
1917 sv = *av_fetch(PL_fdpid,p[This],TRUE);
1918 UNLOCK_FDPID_MUTEX;
1919 (void)SvUPGRADE(sv,SVt_IV);
1920 SvIVX(sv) = pid;
1921 PL_forkprocess = pid;
1922 /* If we managed to get status pipe check for exec fail */
1923 if (did_pipes && pid > 0) {
1924 int errkid;
1925 int n = 0, n1;
1926
1927 while (n < sizeof(int)) {
1928 n1 = PerlLIO_read(pp[0],
1929 (void*)(((char*)&errkid)+n),
1930 (sizeof(int)) - n);
1931 if (n1 <= 0)
1932 break;
1933 n += n1;
1934 }
1935 PerlLIO_close(pp[0]);
1936 did_pipes = 0;
1937 if (n) { /* Error */
1938 int pid2, status;
1939 if (n != sizeof(int))
1940 Perl_croak(aTHX_ "panic: kid popen errno read");
1941 do {
1942 pid2 = wait4pid(pid, &status, 0);
1943 } while (pid2 == -1 && errno == EINTR);
1944 errno = errkid; /* Propagate errno from kid */
1945 return Nullfp;
1946 }
1947 }
1948 if (did_pipes)
1949 PerlLIO_close(pp[0]);
1950 return PerlIO_fdopen(p[This], mode);
1951#else
4a7d1889
NIS		 1952 Perl_croak(aTHX_ "List form of piped open not implemented");
1953 return (PerlIO *) NULL;
1f852d0d 1954#endif
4a7d1889
NIS		 1955}
1956
5f05dabc 1957 /* VMS' my_popen() is in VMS.c, same with OS/2. */
cd39f2b6 1958#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
760ac839 1959PerlIO *
864dbfa3 1960Perl_my_popen(pTHX_ char *cmd, char *mode)
a687059c
LW		 1961{
1962 int p[2];
8ac85365 1963 register I32 This, that;
d8a83dd3 1964 register Pid_t pid;
79072805 1965 SV *sv;
1738f5c4 1966 I32 doexec = strNE(cmd,"-");
e446cec8
IZ		 1967 I32 did_pipes = 0;
1968 int pp[2];
a687059c 1969
45bc9206 1970 PERL_FLUSHALL_FOR_CHILD;
ddcf38b7
IZ		 1971#ifdef OS2
1972 if (doexec) {
23da6c43 1973 return my_syspopen(aTHX_ cmd,mode);
ddcf38b7 1974 }
a1d180c4 1975#endif
8ac85365
NIS		 1976 This = (*mode == 'w');
1977 that = !This;
3280af22 1978 if (doexec && PL_tainting) {
bbce6d69 1979 taint_env();
1980 taint_proper("Insecure %s%s", "EXEC");
d48672a2 1981 }
c2267164
IZ		 1982 if (PerlProc_pipe(p) < 0)
1983 return Nullfp;
e446cec8
IZ		 1984 if (doexec && PerlProc_pipe(pp) >= 0)
1985 did_pipes = 1;
52e18b1f 1986 while ((pid = PerlProc_fork()) < 0) {
a687059c 1987 if (errno != EAGAIN) {
6ad3d225 1988 PerlLIO_close(p[This]);
e446cec8
IZ		 1989 if (did_pipes) {
1990 PerlLIO_close(pp[0]);
1991 PerlLIO_close(pp[1]);
1992 }
a687059c 1993 if (!doexec)
cea2e8a9 1994 Perl_croak(aTHX_ "Can't fork");
a687059c
LW		 1995 return Nullfp;
1996 }
1997 sleep(5);
1998 }
1999 if (pid == 0) {
79072805
LW		 2000 GV* tmpgv;
2001
30ac6d9b
GS		 2002#undef THIS
2003#undef THAT
a687059c 2004#define THIS that
8ac85365 2005#define THAT This
6ad3d225 2006 PerlLIO_close(p[THAT]);
e446cec8
IZ		 2007 if (did_pipes) {
2008 PerlLIO_close(pp[0]);
2009#if defined(HAS_FCNTL) && defined(F_SETFD)
2010 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2011#endif
2012 }
a687059c 2013 if (p[THIS] != (*mode == 'r')) {
6ad3d225
GS		 2014 PerlLIO_dup2(p[THIS], *mode == 'r');
2015 PerlLIO_close(p[THIS]);
a687059c 2016 }
4435c477 2017#ifndef OS2
a687059c 2018 if (doexec) {
a0d0e21e 2019#if !defined(HAS_FCNTL) || !defined(F_SETFD)
ae986130
LW		 2020 int fd;
2021
2022#ifndef NOFILE
2023#define NOFILE 20
2024#endif
a080fe3d
NIS		 2025 {
2026 int fd;
2027
2028 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2029 if (fd != pp[1])
2030 PerlLIO_close(fd);
2031 }
ae986130 2032#endif
a080fe3d
NIS		 2033 /* may or may not use the shell */
2034 do_exec3(cmd, pp[1], did_pipes);
6ad3d225 2035 PerlProc__exit(1);
a687059c 2036 }
4435c477 2037#endif /* defined OS2 */
de3bb511 2038 /*SUPPRESS 560*/
155aba94 2039 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV)))
7766f137 2040 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
3280af22
NIS		 2041 PL_forkprocess = 0;
2042 hv_clear(PL_pidstatus); /* we have no children */
a687059c
LW		 2043 return Nullfp;
2044#undef THIS
2045#undef THAT
2046 }
52e18b1f 2047 do_execfree(); /* free any memory malloced by child on fork */
6ad3d225 2048 PerlLIO_close(p[that]);
e446cec8
IZ		 2049 if (did_pipes)
2050 PerlLIO_close(pp[1]);
8ac85365 2051 if (p[that] < p[This]) {
6ad3d225
GS		 2052 PerlLIO_dup2(p[This], p[that]);
2053 PerlLIO_close(p[This]);
8ac85365 2054 p[This] = p[that];
62b28dd9 2055 }
4755096e 2056 LOCK_FDPID_MUTEX;
3280af22 2057 sv = *av_fetch(PL_fdpid,p[This],TRUE);
4755096e 2058 UNLOCK_FDPID_MUTEX;
a0d0e21e 2059 (void)SvUPGRADE(sv,SVt_IV);
463ee0b2 2060 SvIVX(sv) = pid;
3280af22 2061 PL_forkprocess = pid;
e446cec8
IZ		 2062 if (did_pipes && pid > 0) {
2063 int errkid;
2064 int n = 0, n1;
2065
2066 while (n < sizeof(int)) {
2067 n1 = PerlLIO_read(pp[0],
2068 (void*)(((char*)&errkid)+n),
2069 (sizeof(int)) - n);
2070 if (n1 <= 0)
2071 break;
2072 n += n1;
2073 }
2f96c702
IZ		 2074 PerlLIO_close(pp[0]);
2075 did_pipes = 0;
e446cec8 2076 if (n) { /* Error */
faa466a7 2077 int pid2, status;
e446cec8 2078 if (n != sizeof(int))
cea2e8a9 2079 Perl_croak(aTHX_ "panic: kid popen errno read");
faa466a7
RG		 2080 do {
2081 pid2 = wait4pid(pid, &status, 0);
2082 } while (pid2 == -1 && errno == EINTR);
e446cec8
IZ		 2083 errno = errkid; /* Propagate errno from kid */
2084 return Nullfp;
2085 }
2086 }
2087 if (did_pipes)
2088 PerlLIO_close(pp[0]);
8ac85365 2089 return PerlIO_fdopen(p[This], mode);
a687059c 2090}
7c0587c8 2091#else
2b96b0a5 2092#if defined(atarist)
7c0587c8 2093FILE *popen();
760ac839 2094PerlIO *
864dbfa3 2095Perl_my_popen(pTHX_ char *cmd, char *mode)
7c0587c8 2096{
45bc9206 2097 PERL_FLUSHALL_FOR_CHILD;
a1d180c4
NIS		 2098 /* Call system's popen() to get a FILE *, then import it.
2099 used 0 for 2nd parameter to PerlIO_importFILE;
2100 apparently not used
2101 */
2102 return PerlIO_importFILE(popen(cmd, mode), 0);
7c0587c8 2103}
2b96b0a5
JH		 2104#else
2105#if defined(DJGPP)
2106FILE *djgpp_popen();
2107PerlIO *
2108Perl_my_popen(pTHX_ char *cmd, char *mode)
2109{
2110 PERL_FLUSHALL_FOR_CHILD;
2111 /* Call system's popen() to get a FILE *, then import it.
2112 used 0 for 2nd parameter to PerlIO_importFILE;
2113 apparently not used
2114 */
2115 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2116}
2117#endif
7c0587c8
LW		 2118#endif
2119
2120#endif /* !DOSISH */
a687059c 2121
52e18b1f
GS		 2122/* this is called in parent before the fork() */
2123void
2124Perl_atfork_lock(void)
2125{
4d1ff10f 2126#if defined(USE_5005THREADS) || defined(USE_ITHREADS)
52e18b1f
GS		 2127 /* locks must be held in locking order (if any) */
2128# ifdef MYMALLOC
2129 MUTEX_LOCK(&PL_malloc_mutex);
2130# endif
2131 OP_REFCNT_LOCK;
2132#endif
2133}
2134
2135/* this is called in both parent and child after the fork() */
2136void
2137Perl_atfork_unlock(void)
2138{
4d1ff10f 2139#if defined(USE_5005THREADS) || defined(USE_ITHREADS)
52e18b1f
GS		 2140 /* locks must be released in same order as in atfork_lock() */
2141# ifdef MYMALLOC
2142 MUTEX_UNLOCK(&PL_malloc_mutex);
2143# endif
2144 OP_REFCNT_UNLOCK;
2145#endif
2146}
2147
2148Pid_t
2149Perl_my_fork(void)
2150{
2151#if defined(HAS_FORK)
2152 Pid_t pid;
4d1ff10f 2153#if (defined(USE_5005THREADS) || defined(USE_ITHREADS)) && !defined(HAS_PTHREAD_ATFORK)
52e18b1f
GS		 2154 atfork_lock();
2155 pid = fork();
2156 atfork_unlock();
2157#else
2158 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2159 * handlers elsewhere in the code */
2160 pid = fork();
2161#endif
2162 return pid;
2163#else
2164 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2165 Perl_croak_nocontext("fork() not available");
b961a566 2166 return 0;
52e18b1f
GS		 2167#endif /* HAS_FORK */
2168}
2169
748a9306 2170#ifdef DUMP_FDS
35ff7856 2171void
864dbfa3 2172Perl_dump_fds(pTHX_ char *s)
ae986130
LW		 2173{
2174 int fd;
2175 struct stat tmpstatbuf;
2176
bf49b057 2177 PerlIO_printf(Perl_debug_log,"%s", s);
ae986130 2178 for (fd = 0; fd < 32; fd++) {
6ad3d225 2179 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
bf49b057 2180 PerlIO_printf(Perl_debug_log," %d",fd);
ae986130 2181 }
bf49b057 2182 PerlIO_printf(Perl_debug_log,"\n");
ae986130 2183}
35ff7856 2184#endif /* DUMP_FDS */
ae986130 2185
fe14fcc3 2186#ifndef HAS_DUP2
fec02dd3 2187int
ba106d47 2188dup2(int oldfd, int newfd)
a687059c 2189{
a0d0e21e 2190#if defined(HAS_FCNTL) && defined(F_DUPFD)
fec02dd3
AD		 2191 if (oldfd == newfd)
2192 return oldfd;
6ad3d225 2193 PerlLIO_close(newfd);
fec02dd3 2194 return fcntl(oldfd, F_DUPFD, newfd);
62b28dd9 2195#else
fc36a67e 2196#define DUP2_MAX_FDS 256
2197 int fdtmp[DUP2_MAX_FDS];
79072805 2198 I32 fdx = 0;
ae986130
LW		 2199 int fd;
2200
fe14fcc3 2201 if (oldfd == newfd)
fec02dd3 2202 return oldfd;
6ad3d225 2203 PerlLIO_close(newfd);
fc36a67e 2204 /* good enough for low fd's... */
6ad3d225 2205 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
fc36a67e 2206 if (fdx >= DUP2_MAX_FDS) {
6ad3d225 2207 PerlLIO_close(fd);
fc36a67e 2208 fd = -1;
2209 break;
2210 }
ae986130 2211 fdtmp[fdx++] = fd;
fc36a67e 2212 }
ae986130 2213 while (fdx > 0)
6ad3d225 2214 PerlLIO_close(fdtmp[--fdx]);
fec02dd3 2215 return fd;
62b28dd9 2216#endif
a687059c
LW		 2217}
2218#endif
2219
64ca3a65 2220#ifndef PERL_MICRO
ff68c719 2221#ifdef HAS_SIGACTION
2222
2223Sighandler_t
864dbfa3 2224Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2225{
2226 struct sigaction act, oact;
2227
2228 act.sa_handler = handler;
2229 sigemptyset(&act.sa_mask);
2230 act.sa_flags = 0;
2231#ifdef SA_RESTART
0a8e0eff 2232#if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
ff68c719 2233 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2234#endif
0a8e0eff 2235#endif
85264bed
CS		 2236#ifdef SA_NOCLDWAIT
2237 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2238 act.sa_flags |= SA_NOCLDWAIT;
2239#endif
ff68c719 2240 if (sigaction(signo, &act, &oact) == -1)
36477c24 2241 return SIG_ERR;
ff68c719 2242 else
36477c24 2243 return oact.sa_handler;
ff68c719 2244}
2245
2246Sighandler_t
864dbfa3 2247Perl_rsignal_state(pTHX_ int signo)
ff68c719 2248{
2249 struct sigaction oact;
2250
2251 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
2252 return SIG_ERR;
2253 else
2254 return oact.sa_handler;
2255}
2256
2257int
864dbfa3 2258Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2259{
2260 struct sigaction act;
2261
2262 act.sa_handler = handler;
2263 sigemptyset(&act.sa_mask);
2264 act.sa_flags = 0;
2265#ifdef SA_RESTART
0a8e0eff 2266#if !defined(USE_PERLIO) || defined(PERL_OLD_SIGNALS)
ff68c719 2267 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
2268#endif
0a8e0eff 2269#endif
85264bed
CS		 2270#ifdef SA_NOCLDWAIT
2271 if (signo == SIGCHLD && handler == (Sighandler_t)SIG_IGN)
2272 act.sa_flags |= SA_NOCLDWAIT;
2273#endif
ff68c719 2274 return sigaction(signo, &act, save);
2275}
2276
2277int
864dbfa3 2278Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2279{
2280 return sigaction(signo, save, (struct sigaction *)NULL);
2281}
2282
2283#else /* !HAS_SIGACTION */
2284
2285Sighandler_t
864dbfa3 2286Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2287{
6ad3d225 2288 return PerlProc_signal(signo, handler);
ff68c719 2289}
2290
df3728a2
JH		 2291static int sig_trapped; /* XXX signals are process-wide anyway, so we
2292 ignore the implications of this for threading */
ff68c719 2293
2294static
2295Signal_t
4e35701f 2296sig_trap(int signo)
ff68c719 2297{
2298 sig_trapped++;
2299}
2300
2301Sighandler_t
864dbfa3 2302Perl_rsignal_state(pTHX_ int signo)
ff68c719 2303{
2304 Sighandler_t oldsig;
2305
2306 sig_trapped = 0;
6ad3d225
GS		 2307 oldsig = PerlProc_signal(signo, sig_trap);
2308 PerlProc_signal(signo, oldsig);
ff68c719 2309 if (sig_trapped)
7766f137 2310 PerlProc_kill(PerlProc_getpid(), signo);
ff68c719 2311 return oldsig;
2312}
2313
2314int
864dbfa3 2315Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2316{
6ad3d225 2317 *save = PerlProc_signal(signo, handler);
ff68c719 2318 return (*save == SIG_ERR) ? -1 : 0;
2319}
2320
2321int
864dbfa3 2322Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2323{
6ad3d225 2324 return (PerlProc_signal(signo, *save) == SIG_ERR) ? -1 : 0;
ff68c719 2325}
2326
2327#endif /* !HAS_SIGACTION */
64ca3a65 2328#endif /* !PERL_MICRO */
ff68c719 2329
5f05dabc 2330 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
cd39f2b6 2331#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
79072805 2332I32
864dbfa3 2333Perl_my_pclose(pTHX_ PerlIO *ptr)
a687059c 2334{
ff68c719 2335 Sigsave_t hstat, istat, qstat;
a687059c 2336 int status;
a0d0e21e 2337 SV **svp;
d8a83dd3
JH		 2338 Pid_t pid;
2339 Pid_t pid2;
03136e13 2340 bool close_failed;
b7953727 2341 int saved_errno = 0;
03136e13
CS		 2342#ifdef VMS
2343 int saved_vaxc_errno;
2344#endif
22fae026
TM		 2345#ifdef WIN32
2346 int saved_win32_errno;
2347#endif
a687059c 2348
4755096e 2349 LOCK_FDPID_MUTEX;
3280af22 2350 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
4755096e 2351 UNLOCK_FDPID_MUTEX;
25d92023 2352 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
a0d0e21e 2353 SvREFCNT_dec(*svp);
3280af22 2354 *svp = &PL_sv_undef;
ddcf38b7
IZ		 2355#ifdef OS2
2356 if (pid == -1) { /* Opened by popen. */
2357 return my_syspclose(ptr);
2358 }
a1d180c4 2359#endif
03136e13
CS		 2360 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2361 saved_errno = errno;
2362#ifdef VMS
2363 saved_vaxc_errno = vaxc$errno;
2364#endif
22fae026
TM		 2365#ifdef WIN32
2366 saved_win32_errno = GetLastError();
2367#endif
03136e13 2368 }
7c0587c8 2369#ifdef UTS
6ad3d225 2370 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
7c0587c8 2371#endif
64ca3a65 2372#ifndef PERL_MICRO
ff68c719 2373 rsignal_save(SIGHUP, SIG_IGN, &hstat);
2374 rsignal_save(SIGINT, SIG_IGN, &istat);
2375 rsignal_save(SIGQUIT, SIG_IGN, &qstat);
64ca3a65 2376#endif
748a9306 2377 do {
1d3434b8
GS		 2378 pid2 = wait4pid(pid, &status, 0);
2379 } while (pid2 == -1 && errno == EINTR);
64ca3a65 2380#ifndef PERL_MICRO
ff68c719 2381 rsignal_restore(SIGHUP, &hstat);
2382 rsignal_restore(SIGINT, &istat);
2383 rsignal_restore(SIGQUIT, &qstat);
64ca3a65 2384#endif
03136e13
CS		 2385 if (close_failed) {
2386 SETERRNO(saved_errno, saved_vaxc_errno);
2387 return -1;
2388 }
1d3434b8 2389 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
20188a90 2390}
4633a7c4
LW		 2391#endif /* !DOSISH */
2392
2986a63f 2393#if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
79072805 2394I32
d8a83dd3 2395Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
20188a90 2396{
b7953727
JH		 2397 if (!pid)
2398 return -1;
2399#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2400 {
79072805
LW		 2401 SV *sv;
2402 SV** svp;
fc36a67e 2403 char spid[TYPE_CHARS(int)];
20188a90 2404
20188a90 2405 if (pid > 0) {
7b0972df 2406 sprintf(spid, "%"IVdf, (IV)pid);
3280af22
NIS		 2407 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2408 if (svp && *svp != &PL_sv_undef) {
463ee0b2 2409 *statusp = SvIVX(*svp);
3280af22 2410 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
20188a90
LW		 2411 return pid;
2412 }
2413 }
2414 else {
79072805 2415 HE *entry;
20188a90 2416
3280af22 2417 hv_iterinit(PL_pidstatus);
155aba94 2418 if ((entry = hv_iternext(PL_pidstatus))) {
a0d0e21e 2419 pid = atoi(hv_iterkey(entry,(I32*)statusp));
3280af22 2420 sv = hv_iterval(PL_pidstatus,entry);
463ee0b2 2421 *statusp = SvIVX(sv);
7b0972df 2422 sprintf(spid, "%"IVdf, (IV)pid);
3280af22 2423 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
20188a90
LW		 2424 return pid;
2425 }
b7953727 2426 }
20188a90 2427 }
68a29c53 2428#endif
79072805 2429#ifdef HAS_WAITPID
367f3c24
IZ		 2430# ifdef HAS_WAITPID_RUNTIME
2431 if (!HAS_WAITPID_RUNTIME)
2432 goto hard_way;
2433# endif
f55ee38a 2434 return PerlProc_waitpid(pid,statusp,flags);
367f3c24
IZ		 2435#endif
2436#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
a0d0e21e 2437 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
367f3c24
IZ		 2438#endif
2439#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2440 hard_way:
a0d0e21e
LW		 2441 {
2442 I32 result;
2443 if (flags)
cea2e8a9 2444 Perl_croak(aTHX_ "Can't do waitpid with flags");
a0d0e21e 2445 else {
76e3520e 2446 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
a0d0e21e
LW		 2447 pidgone(result,*statusp);
2448 if (result < 0)
2449 *statusp = -1;
2450 }
2451 return result;
a687059c
LW		 2452 }
2453#endif
a687059c 2454}
2986a63f 2455#endif /* !DOSISH || OS2 || WIN32 || NETWARE */
a687059c 2456
7c0587c8 2457void
de3bb511 2458/*SUPPRESS 590*/
d8a83dd3 2459Perl_pidgone(pTHX_ Pid_t pid, int status)
a687059c 2460{
79072805 2461 register SV *sv;
fc36a67e 2462 char spid[TYPE_CHARS(int)];
a687059c 2463
7b0972df 2464 sprintf(spid, "%"IVdf, (IV)pid);
3280af22 2465 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
a0d0e21e 2466 (void)SvUPGRADE(sv,SVt_IV);
463ee0b2 2467 SvIVX(sv) = status;
20188a90 2468 return;
a687059c
LW		 2469}
2470
2b96b0a5 2471#if defined(atarist) || defined(OS2)
7c0587c8 2472int pclose();
ddcf38b7
IZ		 2473#ifdef HAS_FORK
2474int /* Cannot prototype with I32
2475 in os2ish.h. */
ba106d47 2476my_syspclose(PerlIO *ptr)
ddcf38b7 2477#else
79072805 2478I32
864dbfa3 2479Perl_my_pclose(pTHX_ PerlIO *ptr)
a1d180c4 2480#endif
a687059c 2481{
760ac839
LW		 2482 /* Needs work for PerlIO ! */
2483 FILE *f = PerlIO_findFILE(ptr);
2484 I32 result = pclose(f);
2b96b0a5
JH		 2485 PerlIO_releaseFILE(ptr,f);
2486 return result;
2487}
2488#endif
2489
933fea7f 2490#if defined(DJGPP)
2b96b0a5
JH		 2491int djgpp_pclose();
2492I32
2493Perl_my_pclose(pTHX_ PerlIO *ptr)
2494{
2495 /* Needs work for PerlIO ! */
2496 FILE *f = PerlIO_findFILE(ptr);
2497 I32 result = djgpp_pclose(f);
933fea7f 2498 result = (result << 8) & 0xff00;
760ac839
LW		 2499 PerlIO_releaseFILE(ptr,f);
2500 return result;
a687059c 2501}
7c0587c8 2502#endif
9f68db38
LW		 2503
2504void
864dbfa3 2505Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
9f68db38 2506{
79072805 2507 register I32 todo;
08105a92 2508 register const char *frombase = from;
9f68db38
LW		 2509
2510 if (len == 1) {
08105a92 2511 register const char c = *from;
9f68db38 2512 while (count-- > 0)
5926133d 2513 *to++ = c;
9f68db38
LW		 2514 return;
2515 }
2516 while (count-- > 0) {
2517 for (todo = len; todo > 0; todo--) {
2518 *to++ = *from++;
2519 }
2520 from = frombase;
2521 }
2522}
0f85fab0 2523
fe14fcc3 2524#ifndef HAS_RENAME
79072805 2525I32
864dbfa3 2526Perl_same_dirent(pTHX_ char *a, char *b)
62b28dd9 2527{
93a17b20
LW		 2528 char *fa = strrchr(a,'/');
2529 char *fb = strrchr(b,'/');
62b28dd9
LW		 2530 struct stat tmpstatbuf1;
2531 struct stat tmpstatbuf2;
46fc3d4c 2532 SV *tmpsv = sv_newmortal();
62b28dd9
LW		 2533
2534 if (fa)
2535 fa++;
2536 else
2537 fa = a;
2538 if (fb)
2539 fb++;
2540 else
2541 fb = b;
2542 if (strNE(a,b))
2543 return FALSE;
2544 if (fa == a)
46fc3d4c 2545 sv_setpv(tmpsv, ".");
62b28dd9 2546 else
46fc3d4c 2547 sv_setpvn(tmpsv, a, fa - a);
c6ed36e1 2548 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf1) < 0)
62b28dd9
LW		 2549 return FALSE;
2550 if (fb == b)
46fc3d4c 2551 sv_setpv(tmpsv, ".");
62b28dd9 2552 else
46fc3d4c 2553 sv_setpvn(tmpsv, b, fb - b);
c6ed36e1 2554 if (PerlLIO_stat(SvPVX(tmpsv), &tmpstatbuf2) < 0)
62b28dd9
LW		 2555 return FALSE;
2556 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2557 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2558}
fe14fcc3
LW		 2559#endif /* !HAS_RENAME */
2560
491527d0 2561char*
864dbfa3 2562Perl_find_script(pTHX_ char *scriptname, bool dosearch, char **search_ext, I32 flags)
491527d0 2563{
491527d0
GS		 2564 char *xfound = Nullch;
2565 char *xfailed = Nullch;
0f31cffe 2566 char tmpbuf[MAXPATHLEN];
491527d0
GS		 2567 register char *s;
2568 I32 len;
2569 int retval;
2570#if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2571# define SEARCH_EXTS ".bat", ".cmd", NULL
2572# define MAX_EXT_LEN 4
2573#endif
2574#ifdef OS2
2575# define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2576# define MAX_EXT_LEN 4
2577#endif
2578#ifdef VMS
2579# define SEARCH_EXTS ".pl", ".com", NULL
2580# define MAX_EXT_LEN 4
2581#endif
2582 /* additional extensions to try in each dir if scriptname not found */
2583#ifdef SEARCH_EXTS
2584 char *exts[] = { SEARCH_EXTS };
2585 char **ext = search_ext ? search_ext : exts;
2586 int extidx = 0, i = 0;
2587 char *curext = Nullch;
2588#else
2589# define MAX_EXT_LEN 0
2590#endif
2591
2592 /*
2593 * If dosearch is true and if scriptname does not contain path
2594 * delimiters, search the PATH for scriptname.
2595 *
2596 * If SEARCH_EXTS is also defined, will look for each
2597 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2598 * while searching the PATH.
2599 *
2600 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2601 * proceeds as follows:
2602 * If DOSISH or VMSISH:
2603 * + look for ./scriptname{,.foo,.bar}
2604 * + search the PATH for scriptname{,.foo,.bar}
2605 *
2606 * If !DOSISH:
2607 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2608 * this will not look in '.' if it's not in the PATH)
2609 */
84486fc6 2610 tmpbuf[0] = '\0';
491527d0
GS		 2611
2612#ifdef VMS
2613# ifdef ALWAYS_DEFTYPES
2614 len = strlen(scriptname);
2615 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2616 int hasdir, idx = 0, deftypes = 1;
2617 bool seen_dot = 1;
2618
2619 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2620# else
2621 if (dosearch) {
2622 int hasdir, idx = 0, deftypes = 1;
2623 bool seen_dot = 1;
2624
2625 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2626# endif
2627 /* The first time through, just add SEARCH_EXTS to whatever we
2628 * already have, so we can check for default file types. */
2629 while (deftypes ||
84486fc6 2630 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
491527d0
GS		 2631 {
2632 if (deftypes) {
2633 deftypes = 0;
84486fc6 2634 *tmpbuf = '\0';
491527d0 2635 }
84486fc6
GS		 2636 if ((strlen(tmpbuf) + strlen(scriptname)
2637 + MAX_EXT_LEN) >= sizeof tmpbuf)
491527d0 2638 continue; /* don't search dir with too-long name */
84486fc6 2639 strcat(tmpbuf, scriptname);
491527d0
GS		 2640#else /* !VMS */
2641
2642#ifdef DOSISH
2643 if (strEQ(scriptname, "-"))
2644 dosearch = 0;
2645 if (dosearch) { /* Look in '.' first. */
2646 char *cur = scriptname;
2647#ifdef SEARCH_EXTS
2648 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2649 while (ext[i])
2650 if (strEQ(ext[i++],curext)) {
2651 extidx = -1; /* already has an ext */
2652 break;
2653 }
2654 do {
2655#endif
2656 DEBUG_p(PerlIO_printf(Perl_debug_log,
2657 "Looking for %s\n",cur));
017f25f1
IZ		 2658 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2659 && !S_ISDIR(PL_statbuf.st_mode)) {
491527d0
GS		 2660 dosearch = 0;
2661 scriptname = cur;
2662#ifdef SEARCH_EXTS
2663 break;
2664#endif
2665 }
2666#ifdef SEARCH_EXTS
2667 if (cur == scriptname) {
2668 len = strlen(scriptname);
84486fc6 2669 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
491527d0 2670 break;
84486fc6 2671 cur = strcpy(tmpbuf, scriptname);
491527d0
GS		 2672 }
2673 } while (extidx >= 0 && ext[extidx] /* try an extension? */
84486fc6 2674 && strcpy(tmpbuf+len, ext[extidx++]));
491527d0
GS		 2675#endif
2676 }
2677#endif
2678
cd39f2b6
JH		 2679#ifdef MACOS_TRADITIONAL
2680 if (dosearch && !strchr(scriptname, ':') &&
2681 (s = PerlEnv_getenv("Commands")))
2682#else
491527d0
GS		 2683 if (dosearch && !strchr(scriptname, '/')
2684#ifdef DOSISH
2685 && !strchr(scriptname, '\\')
2686#endif
cd39f2b6
JH		 2687 && (s = PerlEnv_getenv("PATH")))
2688#endif
2689 {
491527d0
GS		 2690 bool seen_dot = 0;
2691
3280af22
NIS		 2692 PL_bufend = s + strlen(s);
2693 while (s < PL_bufend) {
cd39f2b6
JH		 2694#ifdef MACOS_TRADITIONAL
2695 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2696 ',',
2697 &len);
2698#else
491527d0
GS		 2699#if defined(atarist) || defined(DOSISH)
2700 for (len = 0; *s
2701# ifdef atarist
2702 && *s != ','
2703# endif
2704 && *s != ';'; len++, s++) {
84486fc6
GS		 2705 if (len < sizeof tmpbuf)
2706 tmpbuf[len] = *s;
491527d0 2707 }
84486fc6
GS		 2708 if (len < sizeof tmpbuf)
2709 tmpbuf[len] = '\0';
491527d0 2710#else /* ! (atarist || DOSISH) */
3280af22 2711 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
491527d0
GS		 2712 ':',
2713 &len);
2714#endif /* ! (atarist || DOSISH) */
cd39f2b6 2715#endif /* MACOS_TRADITIONAL */
3280af22 2716 if (s < PL_bufend)
491527d0 2717 s++;
84486fc6 2718 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
491527d0 2719 continue; /* don't search dir with too-long name */
cd39f2b6
JH		 2720#ifdef MACOS_TRADITIONAL
2721 if (len && tmpbuf[len - 1] != ':')
2722 tmpbuf[len++] = ':';
2723#else
491527d0 2724 if (len
61ae2fbf 2725#if defined(atarist) || defined(__MINT__) || defined(DOSISH)
84486fc6
GS		 2726 && tmpbuf[len - 1] != '/'
2727 && tmpbuf[len - 1] != '\\'
491527d0
GS		 2728#endif
2729 )
84486fc6
GS		 2730 tmpbuf[len++] = '/';
2731 if (len == 2 && tmpbuf[0] == '.')
491527d0 2732 seen_dot = 1;
cd39f2b6 2733#endif
84486fc6 2734 (void)strcpy(tmpbuf + len, scriptname);
491527d0
GS		 2735#endif /* !VMS */
2736
2737#ifdef SEARCH_EXTS
84486fc6 2738 len = strlen(tmpbuf);
491527d0
GS		 2739 if (extidx > 0) /* reset after previous loop */
2740 extidx = 0;
2741 do {
2742#endif
84486fc6 2743 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3280af22 2744 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
017f25f1
IZ		 2745 if (S_ISDIR(PL_statbuf.st_mode)) {
2746 retval = -1;
2747 }
491527d0
GS		 2748#ifdef SEARCH_EXTS
2749 } while ( retval < 0 /* not there */
2750 && extidx>=0 && ext[extidx] /* try an extension? */
84486fc6 2751 && strcpy(tmpbuf+len, ext[extidx++])
491527d0
GS		 2752 );
2753#endif
2754 if (retval < 0)
2755 continue;
3280af22
NIS		 2756 if (S_ISREG(PL_statbuf.st_mode)
2757 && cando(S_IRUSR,TRUE,&PL_statbuf)
73811745 2758#if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3280af22 2759 && cando(S_IXUSR,TRUE,&PL_statbuf)
491527d0
GS		 2760#endif
2761 )
2762 {
84486fc6 2763 xfound = tmpbuf; /* bingo! */
491527d0
GS		 2764 break;
2765 }
2766 if (!xfailed)
84486fc6 2767 xfailed = savepv(tmpbuf);
491527d0
GS		 2768 }
2769#ifndef DOSISH
017f25f1 2770 if (!xfound && !seen_dot && !xfailed &&
a1d180c4 2771 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
017f25f1 2772 || S_ISDIR(PL_statbuf.st_mode)))
491527d0
GS		 2773#endif
2774 seen_dot = 1; /* Disable message. */
9ccb31f9
GS		 2775 if (!xfound) {
2776 if (flags & 1) { /* do or die? */
cea2e8a9 2777 Perl_croak(aTHX_ "Can't %s %s%s%s",
9ccb31f9
GS		 2778 (xfailed ? "execute" : "find"),
2779 (xfailed ? xfailed : scriptname),
2780 (xfailed ? "" : " on PATH"),
2781 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
2782 }
2783 scriptname = Nullch;
2784 }
491527d0
GS		 2785 if (xfailed)
2786 Safefree(xfailed);
2787 scriptname = xfound;
2788 }
9ccb31f9 2789 return (scriptname ? savepv(scriptname) : Nullch);
491527d0
GS		 2790}
2791
ba869deb
GS		 2792#ifndef PERL_GET_CONTEXT_DEFINED
2793
2794void *
2795Perl_get_context(void)
2796{
4d1ff10f 2797#if defined(USE_5005THREADS) || defined(USE_ITHREADS)
ba869deb
GS		 2798# ifdef OLD_PTHREADS_API
2799 pthread_addr_t t;
2800 if (pthread_getspecific(PL_thr_key, &t))
2801 Perl_croak_nocontext("panic: pthread_getspecific");
2802 return (void*)t;
2803# else
bce813aa 2804# ifdef I_MACH_CTHREADS
8b8b35ab 2805 return (void*)cthread_data(cthread_self());
bce813aa 2806# else
8b8b35ab
JH		 2807 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
2808# endif
c44d3fdb 2809# endif
ba869deb
GS		 2810#else
2811 return (void*)NULL;
2812#endif
2813}
2814
2815void
2816Perl_set_context(void *t)
2817{
4d1ff10f 2818#if defined(USE_5005THREADS) || defined(USE_ITHREADS)
c44d3fdb
GS		 2819# ifdef I_MACH_CTHREADS
2820 cthread_set_data(cthread_self(), t);
2821# else
ba869deb
GS		 2822 if (pthread_setspecific(PL_thr_key, t))
2823 Perl_croak_nocontext("panic: pthread_setspecific");
c44d3fdb 2824# endif
ba869deb
GS		 2825#endif
2826}
2827
2828#endif /* !PERL_GET_CONTEXT_DEFINED */
491527d0 2829
4d1ff10f 2830#ifdef USE_5005THREADS
ba869deb 2831
12ca11f6
MB		 2832#ifdef FAKE_THREADS
2833/* Very simplistic scheduler for now */
2834void
2835schedule(void)
2836{
c7848ba1 2837 thr = thr->i.next_run;
12ca11f6
MB		 2838}
2839
2840void
864dbfa3 2841Perl_cond_init(pTHX_ perl_cond *cp)
12ca11f6
MB		 2842{
2843 *cp = 0;
2844}
2845
2846void
864dbfa3 2847Perl_cond_signal(pTHX_ perl_cond *cp)
12ca11f6 2848{
51dd5992 2849 perl_os_thread t;
12ca11f6 2850 perl_cond cond = *cp;
a1d180c4 2851
12ca11f6
MB		 2852 if (!cond)
2853 return;
2854 t = cond->thread;
2855 /* Insert t in the runnable queue just ahead of us */
c7848ba1
MB		 2856 t->i.next_run = thr->i.next_run;
2857 thr->i.next_run->i.prev_run = t;
2858 t->i.prev_run = thr;
2859 thr->i.next_run = t;
2860 thr->i.wait_queue = 0;
12ca11f6
MB		 2861 /* Remove from the wait queue */
2862 *cp = cond->next;
2863 Safefree(cond);
2864}
2865
2866void
864dbfa3 2867Perl_cond_broadcast(pTHX_ perl_cond *cp)
12ca11f6 2868{
51dd5992 2869 perl_os_thread t;
12ca11f6 2870 perl_cond cond, cond_next;
a1d180c4 2871
12ca11f6
MB		 2872 for (cond = *cp; cond; cond = cond_next) {
2873 t = cond->thread;
2874 /* Insert t in the runnable queue just ahead of us */
c7848ba1
MB		 2875 t->i.next_run = thr->i.next_run;
2876 thr->i.next_run->i.prev_run = t;
2877 t->i.prev_run = thr;
2878 thr->i.next_run = t;
2879 thr->i.wait_queue = 0;
12ca11f6
MB		 2880 /* Remove from the wait queue */
2881 cond_next = cond->next;
2882 Safefree(cond);
2883 }
2884 *cp = 0;
2885}
2886
2887void
864dbfa3 2888Perl_cond_wait(pTHX_ perl_cond *cp)
12ca11f6
MB		 2889{
2890 perl_cond cond;
2891
c7848ba1 2892 if (thr->i.next_run == thr)
cea2e8a9 2893 Perl_croak(aTHX_ "panic: perl_cond_wait called by last runnable thread");
a1d180c4 2894
0f15f207 2895 New(666, cond, 1, struct perl_wait_queue);
12ca11f6
MB		 2896 cond->thread = thr;
2897 cond->next = *cp;
2898 *cp = cond;
c7848ba1 2899 thr->i.wait_queue = cond;
12ca11f6 2900 /* Remove ourselves from runnable queue */
c7848ba1
MB		 2901 thr->i.next_run->i.prev_run = thr->i.prev_run;
2902 thr->i.prev_run->i.next_run = thr->i.next_run;
12ca11f6
MB		 2903}
2904#endif /* FAKE_THREADS */
2905
f93b4edd 2906MAGIC *
864dbfa3 2907Perl_condpair_magic(pTHX_ SV *sv)
f93b4edd
MB		 2908{
2909 MAGIC *mg;
a1d180c4 2910
3e209e71 2911 (void)SvUPGRADE(sv, SVt_PVMG);
14befaf4 2912 mg = mg_find(sv, PERL_MAGIC_mutex);
f93b4edd
MB		 2913 if (!mg) {
2914 condpair_t *cp;
2915
2916 New(53, cp, 1, condpair_t);
2917 MUTEX_INIT(&cp->mutex);
2918 COND_INIT(&cp->owner_cond);
2919 COND_INIT(&cp->cond);
2920 cp->owner = 0;
1feb2720 2921 LOCK_CRED_MUTEX; /* XXX need separate mutex? */
14befaf4 2922 mg = mg_find(sv, PERL_MAGIC_mutex);
f93b4edd
MB		 2923 if (mg) {
2924 /* someone else beat us to initialising it */
1feb2720 2925 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
f93b4edd
MB		 2926 MUTEX_DESTROY(&cp->mutex);
2927 COND_DESTROY(&cp->owner_cond);
2928 COND_DESTROY(&cp->cond);
2929 Safefree(cp);
2930 }
2931 else {
14befaf4 2932 sv_magic(sv, Nullsv, PERL_MAGIC_mutex, 0, 0);
f93b4edd
MB		 2933 mg = SvMAGIC(sv);
2934 mg->mg_ptr = (char *)cp;
565764a8 2935 mg->mg_len = sizeof(cp);
1feb2720 2936 UNLOCK_CRED_MUTEX; /* XXX need separate mutex? */
bf49b057 2937 DEBUG_S(WITH_THR(PerlIO_printf(Perl_debug_log,
a674cc95 2938 "%p: condpair_magic %p\n", thr, sv)));
f93b4edd
MB		 2939 }
2940 }
2941 return mg;
2942}
a863c7d1 2943
3d35f11b 2944SV *
4755096e 2945Perl_sv_lock(pTHX_ SV *osv)
3d35f11b
GS		 2946{
2947 MAGIC *mg;
2948 SV *sv = osv;
2949
631cfb58 2950 LOCK_SV_LOCK_MUTEX;
3d35f11b
GS		 2951 if (SvROK(sv)) {
2952 sv = SvRV(sv);
3d35f11b
GS		 2953 }
2954
2955 mg = condpair_magic(sv);
2956 MUTEX_LOCK(MgMUTEXP(mg));
2957 if (MgOWNER(mg) == thr)
2958 MUTEX_UNLOCK(MgMUTEXP(mg));
4755096e 2959 else {
3d35f11b
GS		 2960 while (MgOWNER(mg))
2961 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2962 MgOWNER(mg) = thr;
4755096e
GS		 2963 DEBUG_S(PerlIO_printf(Perl_debug_log,
2964 "0x%"UVxf": Perl_lock lock 0x%"UVxf"\n",
a674cc95 2965 PTR2UV(thr), PTR2UV(sv)));
3d35f11b
GS		 2966 MUTEX_UNLOCK(MgMUTEXP(mg));
2967 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2968 }
631cfb58 2969 UNLOCK_SV_LOCK_MUTEX;
4755096e 2970 return sv;
3d35f11b
GS		 2971}
2972
a863c7d1 2973/*
199100c8
MB		 2974 * Make a new perl thread structure using t as a prototype. Some of the
2975 * fields for the new thread are copied from the prototype thread, t,
2976 * so t should not be running in perl at the time this function is
2977 * called. The use by ext/Thread/Thread.xs in core perl (where t is the
2978 * thread calling new_struct_thread) clearly satisfies this constraint.
a863c7d1 2979 */
52e1cb5e 2980struct perl_thread *
864dbfa3 2981Perl_new_struct_thread(pTHX_ struct perl_thread *t)
a863c7d1 2982{
c5be433b 2983#if !defined(PERL_IMPLICIT_CONTEXT)
52e1cb5e 2984 struct perl_thread *thr;
cea2e8a9 2985#endif
a863c7d1 2986 SV *sv;
199100c8
MB		 2987 SV **svp;
2988 I32 i;
2989
79cb57f6 2990 sv = newSVpvn("", 0);
52e1cb5e
JH		 2991 SvGROW(sv, sizeof(struct perl_thread) + 1);
2992 SvCUR_set(sv, sizeof(struct perl_thread));
199100c8 2993 thr = (Thread) SvPVX(sv);
949ced2d 2994#ifdef DEBUGGING
52e1cb5e 2995 memset(thr, 0xab, sizeof(struct perl_thread));
533c011a
NIS		 2996 PL_markstack = 0;
2997 PL_scopestack = 0;
2998 PL_savestack = 0;
2999 PL_retstack = 0;
3000 PL_dirty = 0;
3001 PL_localizing = 0;
949ced2d 3002 Zero(&PL_hv_fetch_ent_mh, 1, HE);
d0e9ca0c
HS		 3003 PL_efloatbuf = (char*)NULL;
3004 PL_efloatsize = 0;
949ced2d
GS		 3005#else
3006 Zero(thr, 1, struct perl_thread);
3007#endif
199100c8
MB		 3008
3009 thr->oursv = sv;
cea2e8a9 3010 init_stacks();
a863c7d1 3011
533c011a 3012 PL_curcop = &PL_compiling;
c5be433b 3013 thr->interp = t->interp;
199100c8 3014 thr->cvcache = newHV();
54b9620d 3015 thr->threadsv = newAV();
a863c7d1 3016 thr->specific = newAV();
79cb57f6 3017 thr->errsv = newSVpvn("", 0);
a863c7d1 3018 thr->flags = THRf_R_JOINABLE;
8dcd6f7b 3019 thr->thr_done = 0;
a863c7d1 3020 MUTEX_INIT(&thr->mutex);
199100c8 3021
5c831c24 3022 JMPENV_BOOTSTRAP;
533c011a 3023
6dc8a9e4 3024 PL_in_eval = EVAL_NULL; /* ~(EVAL_INEVAL|EVAL_WARNONLY|EVAL_KEEPERR|EVAL_INREQUIRE) */
533c011a
NIS		 3025 PL_restartop = 0;
3026
b099ddc0 3027 PL_statname = NEWSV(66,0);
5a844595 3028 PL_errors = newSVpvn("", 0);
b099ddc0 3029 PL_maxscream = -1;
0b94c7bb
GS		 3030 PL_regcompp = MEMBER_TO_FPTR(Perl_pregcomp);
3031 PL_regexecp = MEMBER_TO_FPTR(Perl_regexec_flags);
3032 PL_regint_start = MEMBER_TO_FPTR(Perl_re_intuit_start);
3033 PL_regint_string = MEMBER_TO_FPTR(Perl_re_intuit_string);
3034 PL_regfree = MEMBER_TO_FPTR(Perl_pregfree);
b099ddc0
GS		 3035 PL_regindent = 0;
3036 PL_reginterp_cnt = 0;
3037 PL_lastscream = Nullsv;
3038 PL_screamfirst = 0;
3039 PL_screamnext = 0;
3040 PL_reg_start_tmp = 0;
3041 PL_reg_start_tmpl = 0;
14ed4b74 3042 PL_reg_poscache = Nullch;
b099ddc0 3043
a2efc822
SC		 3044 PL_peepp = MEMBER_TO_FPTR(Perl_peep);
3045
b099ddc0
GS		 3046 /* parent thread's data needs to be locked while we make copy */
3047 MUTEX_LOCK(&t->mutex);
3048
14dd3ad8 3049#ifdef PERL_FLEXIBLE_EXCEPTIONS
312caa8e 3050 PL_protect = t->Tprotect;
14dd3ad8 3051#endif
312caa8e 3052
b099ddc0
GS		 3053 PL_curcop = t->Tcurcop; /* XXX As good a guess as any? */
3054 PL_defstash = t->Tdefstash; /* XXX maybe these should */
3055 PL_curstash = t->Tcurstash; /* always be set to main? */
3056
6b88bc9c 3057 PL_tainted = t->Ttainted;
84fee439 3058 PL_curpm = t->Tcurpm; /* XXX No PMOP ref count */
8bfdd7d9 3059 PL_rs = newSVsv(t->Trs);
84fee439 3060 PL_last_in_gv = Nullgv;
7d3de3d5 3061 PL_ofs_sv = t->Tofs_sv ? SvREFCNT_inc(PL_ofs_sv) : Nullsv;
84fee439
NIS		 3062 PL_defoutgv = (GV*)SvREFCNT_inc(t->Tdefoutgv);
3063 PL_chopset = t->Tchopset;
84fee439
NIS		 3064 PL_bodytarget = newSVsv(t->Tbodytarget);
3065 PL_toptarget = newSVsv(t->Ttoptarget);
5c831c24
GS		 3066 if (t->Tformtarget == t->Ttoptarget)
3067 PL_formtarget = PL_toptarget;
3068 else
3069 PL_formtarget = PL_bodytarget;
533c011a 3070
54b9620d
MB		 3071 /* Initialise all per-thread SVs that the template thread used */
3072 svp = AvARRAY(t->threadsv);
93965878 3073 for (i = 0; i <= AvFILLp(t->threadsv); i++, svp++) {
533c011a 3074 if (*svp && *svp != &PL_sv_undef) {
199100c8 3075 SV *sv = newSVsv(*svp);
54b9620d 3076 av_store(thr->threadsv, i, sv);
14befaf4 3077 sv_magic(sv, 0, PERL_MAGIC_sv, &PL_threadsv_names[i], 1);
bf49b057 3078 DEBUG_S(PerlIO_printf(Perl_debug_log,
f1dbda3d
JH		 3079 "new_struct_thread: copied threadsv %"IVdf" %p->%p\n",
3080 (IV)i, t, thr));
199100c8 3081 }
a1d180c4 3082 }
940cb80d 3083 thr->threadsvp = AvARRAY(thr->threadsv);
199100c8 3084
533c011a
NIS		 3085 MUTEX_LOCK(&PL_threads_mutex);
3086 PL_nthreads++;
3087 thr->tid = ++PL_threadnum;
199100c8
MB		 3088 thr->next = t->next;
3089 thr->prev = t;
3090 t->next = thr;
3091 thr->next->prev = thr;
533c011a 3092 MUTEX_UNLOCK(&PL_threads_mutex);
a863c7d1 3093
b099ddc0
GS		 3094 /* done copying parent's state */
3095 MUTEX_UNLOCK(&t->mutex);
3096
a863c7d1 3097#ifdef HAVE_THREAD_INTERN
4f63d024 3098 Perl_init_thread_intern(thr);
a863c7d1 3099#endif /* HAVE_THREAD_INTERN */
a863c7d1
MB		 3100 return thr;
3101}
4d1ff10f 3102#endif /* USE_5005THREADS */
760ac839 3103
22239a37
NIS		 3104#ifdef PERL_GLOBAL_STRUCT
3105struct perl_vars *
864dbfa3 3106Perl_GetVars(pTHX)
22239a37 3107{
533c011a 3108 return &PL_Vars;
22239a37 3109}
31fb1209
NIS		 3110#endif
3111
3112char **
864dbfa3 3113Perl_get_op_names(pTHX)
31fb1209 3114{
22c35a8c 3115 return PL_op_name;
31fb1209
NIS		 3116}
3117
3118char **
864dbfa3 3119Perl_get_op_descs(pTHX)
31fb1209 3120{
22c35a8c 3121 return PL_op_desc;
31fb1209 3122}
9e6b2b00
GS		 3123
3124char *
864dbfa3 3125Perl_get_no_modify(pTHX)
9e6b2b00 3126{
22c35a8c 3127 return (char*)PL_no_modify;
9e6b2b00
GS		 3128}
3129
3130U32 *
864dbfa3 3131Perl_get_opargs(pTHX)
9e6b2b00 3132{
22c35a8c 3133 return PL_opargs;
9e6b2b00 3134}
51aa15f3 3135
0cb96387
GS		 3136PPADDR_t*
3137Perl_get_ppaddr(pTHX)
3138{
12ae5dfc 3139 return (PPADDR_t*)PL_ppaddr;
0cb96387
GS		 3140}
3141
a6c40364
GS		 3142#ifndef HAS_GETENV_LEN
3143char *
bf4acbe4 3144Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
a6c40364
GS		 3145{
3146 char *env_trans = PerlEnv_getenv(env_elem);
3147 if (env_trans)
3148 *len = strlen(env_trans);
3149 return env_trans;
f675dbe5
CB		 3150}
3151#endif
3152
dc9e4912
GS		 3153
3154MGVTBL*
864dbfa3 3155Perl_get_vtbl(pTHX_ int vtbl_id)
dc9e4912
GS		 3156{
3157 MGVTBL* result = Null(MGVTBL*);
3158
3159 switch(vtbl_id) {
3160 case want_vtbl_sv:
3161 result = &PL_vtbl_sv;
3162 break;
3163 case want_vtbl_env:
3164 result = &PL_vtbl_env;
3165 break;
3166 case want_vtbl_envelem:
3167 result = &PL_vtbl_envelem;
3168 break;
3169 case want_vtbl_sig:
3170 result = &PL_vtbl_sig;
3171 break;
3172 case want_vtbl_sigelem:
3173 result = &PL_vtbl_sigelem;
3174 break;
3175 case want_vtbl_pack:
3176 result = &PL_vtbl_pack;
3177 break;
3178 case want_vtbl_packelem:
3179 result = &PL_vtbl_packelem;
3180 break;
3181 case want_vtbl_dbline:
3182 result = &PL_vtbl_dbline;
3183 break;
3184 case want_vtbl_isa:
3185 result = &PL_vtbl_isa;
3186 break;
3187 case want_vtbl_isaelem:
3188 result = &PL_vtbl_isaelem;
3189 break;
3190 case want_vtbl_arylen:
3191 result = &PL_vtbl_arylen;
3192 break;
3193 case want_vtbl_glob:
3194 result = &PL_vtbl_glob;
3195 break;
3196 case want_vtbl_mglob:
3197 result = &PL_vtbl_mglob;
3198 break;
3199 case want_vtbl_nkeys:
3200 result = &PL_vtbl_nkeys;
3201 break;
3202 case want_vtbl_taint:
3203 result = &PL_vtbl_taint;
3204 break;
3205 case want_vtbl_substr:
3206 result = &PL_vtbl_substr;
3207 break;
3208 case want_vtbl_vec:
3209 result = &PL_vtbl_vec;
3210 break;
3211 case want_vtbl_pos:
3212 result = &PL_vtbl_pos;
3213 break;
3214 case want_vtbl_bm:
3215 result = &PL_vtbl_bm;
3216 break;
3217 case want_vtbl_fm:
3218 result = &PL_vtbl_fm;
3219 break;
3220 case want_vtbl_uvar:
3221 result = &PL_vtbl_uvar;
3222 break;
4d1ff10f 3223#ifdef USE_5005THREADS
dc9e4912
GS		 3224 case want_vtbl_mutex:
3225 result = &PL_vtbl_mutex;
3226 break;
3227#endif
3228 case want_vtbl_defelem:
3229 result = &PL_vtbl_defelem;
3230 break;
3231 case want_vtbl_regexp:
3232 result = &PL_vtbl_regexp;
3233 break;
3234 case want_vtbl_regdata:
3235 result = &PL_vtbl_regdata;
3236 break;
3237 case want_vtbl_regdatum:
3238 result = &PL_vtbl_regdatum;
3239 break;
3c90161d 3240#ifdef USE_LOCALE_COLLATE
dc9e4912
GS		 3241 case want_vtbl_collxfrm:
3242 result = &PL_vtbl_collxfrm;
3243 break;
3c90161d 3244#endif
dc9e4912
GS		 3245 case want_vtbl_amagic:
3246 result = &PL_vtbl_amagic;
3247 break;
3248 case want_vtbl_amagicelem:
3249 result = &PL_vtbl_amagicelem;
3250 break;
810b8aa5
GS		 3251 case want_vtbl_backref:
3252 result = &PL_vtbl_backref;
3253 break;
dc9e4912
GS		 3254 }
3255 return result;
3256}
3257
767df6a1 3258I32
864dbfa3 3259Perl_my_fflush_all(pTHX)
767df6a1 3260{
8fbdfb7c 3261#if defined(FFLUSH_NULL)
ce720889 3262 return PerlIO_flush(NULL);
767df6a1 3263#else
8fbdfb7c 3264# if defined(HAS__FWALK)
74cac757
JH		 3265 /* undocumented, unprototyped, but very useful BSDism */
3266 extern void _fwalk(int (*)(FILE *));
8fbdfb7c 3267 _fwalk(&fflush);
74cac757 3268 return 0;
8fa7f367 3269# else
8fbdfb7c 3270# if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
8fa7f367 3271 long open_max = -1;
8fbdfb7c 3272# ifdef PERL_FFLUSH_ALL_FOPEN_MAX
d2201af2 3273 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
8fbdfb7c 3274# else
8fa7f367 3275# if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
767df6a1 3276 open_max = sysconf(_SC_OPEN_MAX);
8fa7f367
JH		 3277# else
3278# ifdef FOPEN_MAX
74cac757 3279 open_max = FOPEN_MAX;
8fa7f367
JH		 3280# else
3281# ifdef OPEN_MAX
74cac757 3282 open_max = OPEN_MAX;
8fa7f367
JH		 3283# else
3284# ifdef _NFILE
d2201af2 3285 open_max = _NFILE;
8fa7f367
JH		 3286# endif
3287# endif
74cac757 3288# endif
767df6a1
JH		 3289# endif
3290# endif
767df6a1
JH		 3291 if (open_max > 0) {
3292 long i;
3293 for (i = 0; i < open_max; i++)
d2201af2
AD		 3294 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3295 STDIO_STREAM_ARRAY[i]._file < open_max &&
3296 STDIO_STREAM_ARRAY[i]._flag)
3297 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
767df6a1
JH		 3298 return 0;
3299 }
8fbdfb7c 3300# endif
767df6a1
JH		 3301 SETERRNO(EBADF,RMS$_IFI);
3302 return EOF;
74cac757 3303# endif
767df6a1
JH		 3304#endif
3305}
097ee67d 3306
69282e91 3307void
bc37a18f
RG		 3308Perl_report_evil_fh(pTHX_ GV *gv, IO *io, I32 op)
3309{
9c0fcd4f 3310 char *vile;
4e34385f 3311 I32 warn_type;
bc37a18f 3312 char *func =
66fc2fa5
JH		 3313 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3314 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
bc37a18f
RG		 3315 PL_op_desc[op];
3316 char *pars = OP_IS_FILETEST(op) ? "" : "()";
21865922
JH		 3317 char *type = OP_IS_SOCKET(op) ||
3318 (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ?
2dd78f96 3319 "socket" : "filehandle";
9c0fcd4f 3320 char *name = NULL;
bc37a18f 3321
21865922 3322 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
9c0fcd4f 3323 vile = "closed";
4e34385f 3324 warn_type = WARN_CLOSED;
2dd78f96
JH		 3325 }
3326 else {
9c0fcd4f 3327 vile = "unopened";
4e34385f 3328 warn_type = WARN_UNOPENED;
9c0fcd4f 3329 }
bc37a18f 3330
66fc2fa5
JH		 3331 if (gv && isGV(gv)) {
3332 SV *sv = sv_newmortal();
3333 gv_efullname4(sv, gv, Nullch, FALSE);
3334 name = SvPVX(sv);
3335 }
3336
4c80c0b2
NC		 3337 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3338 if (name && *name)
3339 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for %sput",
7889fe52 3340 name,
4c80c0b2
NC		 3341 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3342 else
3343 Perl_warner(aTHX_ WARN_IO, "Filehandle opened only for %sput",
3344 (op == OP_phoney_INPUT_ONLY ? "in" : "out"));
3345 } else if (name && *name) {
4e34385f 3346 Perl_warner(aTHX_ warn_type,
9c0fcd4f 3347 "%s%s on %s %s %s", func, pars, vile, type, name);
3e11456d 3348 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
4e34385f 3349 Perl_warner(aTHX_ warn_type,
bc37a18f
RG		 3350 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3351 func, pars, name);
2dd78f96
JH		 3352 }
3353 else {
4e34385f 3354 Perl_warner(aTHX_ warn_type,
9c0fcd4f 3355 "%s%s on %s %s", func, pars, vile, type);
21865922 3356 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
4e34385f 3357 Perl_warner(aTHX_ warn_type,
bc37a18f
RG		 3358 "\t(Are you trying to call %s%s on dirhandle?)\n",
3359 func, pars);
3360 }
69282e91 3361}
a926ef6b
JH		 3362
3363#ifdef EBCDIC
cbebf344
JH		 3364/* in ASCII order, not that it matters */
3365static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3366
a926ef6b
JH		 3367int
3368Perl_ebcdic_control(pTHX_ int ch)
3369{
3370 if (ch > 'a') {
3371 char *ctlp;
4a7d1889 3372
a926ef6b
JH		 3373 if (islower(ch))
3374 ch = toupper(ch);
4a7d1889 3375
a926ef6b
JH		 3376 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3377 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
3378 }
4a7d1889 3379
a926ef6b
JH		 3380 if (ctlp == controllablechars)
3381 return('\177'); /* DEL */
3382 else
3383 return((unsigned char)(ctlp - controllablechars - 1));
3384 } else { /* Want uncontrol */
3385 if (ch == '\177' || ch == -1)
3386 return('?');
3387 else if (ch == '\157')
3388 return('\177');
3389 else if (ch == '\174')
3390 return('\000');
3391 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3392 return('\036');
3393 else if (ch == '\155')
3394 return('\037');
3395 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3396 return(controllablechars[ch+1]);
3397 else
3398 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3399 }
3400}
3401#endif
e72cf795 3402
e72cf795
JH		 3403/* XXX struct tm on some systems (SunOS4/BSD) contains extra (non POSIX)
3404 * fields for which we don't have Configure support yet:
3405 * char *tm_zone; -- abbreviation of timezone name
3406 * long tm_gmtoff; -- offset from GMT in seconds
3407 * To workaround core dumps from the uninitialised tm_zone we get the
3408 * system to give us a reasonable struct to copy. This fix means that
3409 * strftime uses the tm_zone and tm_gmtoff values returned by
3410 * localtime(time()). That should give the desired result most of the
3411 * time. But probably not always!
3412 *
3413 * This is a temporary workaround to be removed once Configure
3414 * support is added and NETaa14816 is considered in full.
3415 * It does not address tzname aspects of NETaa14816.
3416 */
3417#ifdef HAS_GNULIBC
3418# ifndef STRUCT_TM_HASZONE
3419# define STRUCT_TM_HASZONE
3420# endif
3421#endif
3422
3423void
f1208910 3424Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
e72cf795
JH		 3425{
3426#ifdef STRUCT_TM_HASZONE
3427 Time_t now;
3428 (void)time(&now);
3429 Copy(localtime(&now), ptm, 1, struct tm);
3430#endif
3431}
3432
3433/*
3434 * mini_mktime - normalise struct tm values without the localtime()
3435 * semantics (and overhead) of mktime().
3436 */
3437void
f1208910 3438Perl_mini_mktime(pTHX_ struct tm *ptm)
e72cf795
JH		 3439{
3440 int yearday;
3441 int secs;
3442 int month, mday, year, jday;
3443 int odd_cent, odd_year;
3444
3445#define DAYS_PER_YEAR 365
3446#define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3447#define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3448#define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3449#define SECS_PER_HOUR (60*60)
3450#define SECS_PER_DAY (24*SECS_PER_HOUR)
3451/* parentheses deliberately absent on these two, otherwise they don't work */
3452#define MONTH_TO_DAYS 153/5
3453#define DAYS_TO_MONTH 5/153
3454/* offset to bias by March (month 4) 1st between month/mday & year finding */
3455#define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3456/* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3457#define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3458
3459/*
3460 * Year/day algorithm notes:
3461 *
3462 * With a suitable offset for numeric value of the month, one can find
3463 * an offset into the year by considering months to have 30.6 (153/5) days,
3464 * using integer arithmetic (i.e., with truncation). To avoid too much
3465 * messing about with leap days, we consider January and February to be
3466 * the 13th and 14th month of the previous year. After that transformation,
3467 * we need the month index we use to be high by 1 from 'normal human' usage,
3468 * so the month index values we use run from 4 through 15.
3469 *
3470 * Given that, and the rules for the Gregorian calendar (leap years are those
3471 * divisible by 4 unless also divisible by 100, when they must be divisible
3472 * by 400 instead), we can simply calculate the number of days since some
3473 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3474 * the days we derive from our month index, and adding in the day of the
3475 * month. The value used here is not adjusted for the actual origin which
3476 * it normally would use (1 January A.D. 1), since we're not exposing it.
3477 * We're only building the value so we can turn around and get the
3478 * normalised values for the year, month, day-of-month, and day-of-year.
3479 *
3480 * For going backward, we need to bias the value we're using so that we find
3481 * the right year value. (Basically, we don't want the contribution of
3482 * March 1st to the number to apply while deriving the year). Having done
3483 * that, we 'count up' the contribution to the year number by accounting for
3484 * full quadracenturies (400-year periods) with their extra leap days, plus
3485 * the contribution from full centuries (to avoid counting in the lost leap
3486 * days), plus the contribution from full quad-years (to count in the normal
3487 * leap days), plus the leftover contribution from any non-leap years.
3488 * At this point, if we were working with an actual leap day, we'll have 0
3489 * days left over. This is also true for March 1st, however. So, we have
3490 * to special-case that result, and (earlier) keep track of the 'odd'
3491 * century and year contributions. If we got 4 extra centuries in a qcent,
3492 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3493 * Otherwise, we add back in the earlier bias we removed (the 123 from
3494 * figuring in March 1st), find the month index (integer division by 30.6),
3495 * and the remainder is the day-of-month. We then have to convert back to
3496 * 'real' months (including fixing January and February from being 14/15 in
3497 * the previous year to being in the proper year). After that, to get
3498 * tm_yday, we work with the normalised year and get a new yearday value for
3499 * January 1st, which we subtract from the yearday value we had earlier,
3500 * representing the date we've re-built. This is done from January 1
3501 * because tm_yday is 0-origin.
3502 *
3503 * Since POSIX time routines are only guaranteed to work for times since the
3504 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3505 * applies Gregorian calendar rules even to dates before the 16th century
3506 * doesn't bother me. Besides, you'd need cultural context for a given
3507 * date to know whether it was Julian or Gregorian calendar, and that's
3508 * outside the scope for this routine. Since we convert back based on the
3509 * same rules we used to build the yearday, you'll only get strange results
3510 * for input which needed normalising, or for the 'odd' century years which
3511 * were leap years in the Julian calander but not in the Gregorian one.
3512 * I can live with that.
3513 *
3514 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3515 * that's still outside the scope for POSIX time manipulation, so I don't
3516 * care.
3517 */
3518
3519 year = 1900 + ptm->tm_year;
3520 month = ptm->tm_mon;
3521 mday = ptm->tm_mday;
3522 /* allow given yday with no month & mday to dominate the result */
3523 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3524 month = 0;
3525 mday = 0;
3526 jday = 1 + ptm->tm_yday;
3527 }
3528 else {
3529 jday = 0;
3530 }
3531 if (month >= 2)
3532 month+=2;
3533 else
3534 month+=14, year--;
3535 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3536 yearday += month*MONTH_TO_DAYS + mday + jday;
3537 /*
3538 * Note that we don't know when leap-seconds were or will be,
3539 * so we have to trust the user if we get something which looks
3540 * like a sensible leap-second. Wild values for seconds will
3541 * be rationalised, however.
3542 */
3543 if ((unsigned) ptm->tm_sec <= 60) {
3544 secs = 0;
3545 }
3546 else {
3547 secs = ptm->tm_sec;
3548 ptm->tm_sec = 0;
3549 }
3550 secs += 60 * ptm->tm_min;
3551 secs += SECS_PER_HOUR * ptm->tm_hour;
3552 if (secs < 0) {
3553 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3554 /* got negative remainder, but need positive time */
3555 /* back off an extra day to compensate */
3556 yearday += (secs/SECS_PER_DAY)-1;
3557 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3558 }
3559 else {
3560 yearday += (secs/SECS_PER_DAY);
3561 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3562 }
3563 }
3564 else if (secs >= SECS_PER_DAY) {
3565 yearday += (secs/SECS_PER_DAY);
3566 secs %= SECS_PER_DAY;
3567 }
3568 ptm->tm_hour = secs/SECS_PER_HOUR;
3569 secs %= SECS_PER_HOUR;
3570 ptm->tm_min = secs/60;
3571 secs %= 60;
3572 ptm->tm_sec += secs;
3573 /* done with time of day effects */
3574 /*
3575 * The algorithm for yearday has (so far) left it high by 428.
3576 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3577 * bias it by 123 while trying to figure out what year it
3578 * really represents. Even with this tweak, the reverse
3579 * translation fails for years before A.D. 0001.
3580 * It would still fail for Feb 29, but we catch that one below.
3581 */
3582 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3583 yearday -= YEAR_ADJUST;
3584 year = (yearday / DAYS_PER_QCENT) * 400;
3585 yearday %= DAYS_PER_QCENT;
3586 odd_cent = yearday / DAYS_PER_CENT;
3587 year += odd_cent * 100;
3588 yearday %= DAYS_PER_CENT;
3589 year += (yearday / DAYS_PER_QYEAR) * 4;
3590 yearday %= DAYS_PER_QYEAR;
3591 odd_year = yearday / DAYS_PER_YEAR;
3592 year += odd_year;
3593 yearday %= DAYS_PER_YEAR;
3594 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3595 month = 1;
3596 yearday = 29;
3597 }
3598 else {
3599 yearday += YEAR_ADJUST; /* recover March 1st crock */
3600 month = yearday*DAYS_TO_MONTH;
3601 yearday -= month*MONTH_TO_DAYS;
3602 /* recover other leap-year adjustment */
3603 if (month > 13) {
3604 month-=14;
3605 year++;
3606 }
3607 else {
3608 month-=2;
3609 }
3610 }
3611 ptm->tm_year = year - 1900;
3612 if (yearday) {
3613 ptm->tm_mday = yearday;
3614 ptm->tm_mon = month;
3615 }
3616 else {
3617 ptm->tm_mday = 31;
3618 ptm->tm_mon = month - 1;
3619 }
3620 /* re-build yearday based on Jan 1 to get tm_yday */
3621 year--;
3622 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3623 yearday += 14*MONTH_TO_DAYS + 1;
3624 ptm->tm_yday = jday - yearday;
3625 /* fix tm_wday if not overridden by caller */
3626 if ((unsigned)ptm->tm_wday > 6)
3627 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3628}
b3c85772
JH		 3629
3630char *
f1208910 3631Perl_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		 3632{
3633#ifdef HAS_STRFTIME
3634 char *buf;
3635 int buflen;
3636 struct tm mytm;
3637 int len;
3638
3639 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3640 mytm.tm_sec = sec;
3641 mytm.tm_min = min;
3642 mytm.tm_hour = hour;
3643 mytm.tm_mday = mday;
3644 mytm.tm_mon = mon;
3645 mytm.tm_year = year;
3646 mytm.tm_wday = wday;
3647 mytm.tm_yday = yday;
3648 mytm.tm_isdst = isdst;
3649 mini_mktime(&mytm);
3650 buflen = 64;
3651 New(0, buf, buflen, char);
3652 len = strftime(buf, buflen, fmt, &mytm);
3653 /*
877f6a72 3654 ** The following is needed to handle to the situation where
b3c85772
JH		 3655 ** tmpbuf overflows. Basically we want to allocate a buffer
3656 ** and try repeatedly. The reason why it is so complicated
3657 ** is that getting a return value of 0 from strftime can indicate
3658 ** one of the following:
3659 ** 1. buffer overflowed,
3660 ** 2. illegal conversion specifier, or
3661 ** 3. the format string specifies nothing to be returned(not
3662 ** an error). This could be because format is an empty string
3663 ** or it specifies %p that yields an empty string in some locale.
3664 ** If there is a better way to make it portable, go ahead by
3665 ** all means.
3666 */
3667 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3668 return buf;
3669 else {
3670 /* Possibly buf overflowed - try again with a bigger buf */
3671 int fmtlen = strlen(fmt);
3672 int bufsize = fmtlen + buflen;
877f6a72 3673
b3c85772
JH		 3674 New(0, buf, bufsize, char);
3675 while (buf) {
3676 buflen = strftime(buf, bufsize, fmt, &mytm);
3677 if (buflen > 0 && buflen < bufsize)
3678 break;
3679 /* heuristic to prevent out-of-memory errors */
3680 if (bufsize > 100*fmtlen) {
3681 Safefree(buf);
3682 buf = NULL;
3683 break;
3684 }
3685 bufsize *= 2;
3686 Renew(buf, bufsize, char);
3687 }
3688 return buf;
3689 }
3690#else
3691 Perl_croak(aTHX_ "panic: no strftime");
3692#endif
3693}
3694
877f6a72
NIS		 3695
3696#define SV_CWD_RETURN_UNDEF \
3697sv_setsv(sv, &PL_sv_undef); \
3698return FALSE
3699
3700#define SV_CWD_ISDOT(dp) \
3701 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3702 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
3703
3704/*
89423764 3705=for apidoc getcwd_sv
877f6a72
NIS		 3706
3707Fill the sv with current working directory
3708
3709=cut
3710*/
3711
3712/* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3713 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3714 * getcwd(3) if available
3715 * Comments from the orignal:
3716 * This is a faster version of getcwd. It's also more dangerous
3717 * because you might chdir out of a directory that you can't chdir
3718 * back into. */
3719
877f6a72 3720int
89423764 3721Perl_getcwd_sv(pTHX_ register SV *sv)
877f6a72
NIS		 3722{
3723#ifndef PERL_MICRO
3724
ea715489
JH		 3725#ifndef INCOMPLETE_TAINTS
3726 SvTAINTED_on(sv);
3727#endif
3728
8f95b30d
JH		 3729#ifdef HAS_GETCWD
3730 {
60e110a8
DM		 3731 char buf[MAXPATHLEN];
3732
3733 /* Some getcwd()s automatically allocate a buffer of the given
3734 * size from the heap if they are given a NULL buffer pointer.
3735 * The problem is that this behaviour is not portable. */
3736 if (getcwd(buf, sizeof(buf) - 1)) {
3737 STRLEN len = strlen(buf);
3738 sv_setpvn(sv, buf, len);
3739 return TRUE;
3740 }
3741 else {
3742 sv_setsv(sv, &PL_sv_undef);
3743 return FALSE;
3744 }
8f95b30d
JH		 3745 }
3746
3747#else
3748
877f6a72
NIS		 3749 struct stat statbuf;
3750 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
3751 int namelen, pathlen=0;
3752 DIR *dir;
3753 Direntry_t *dp;
877f6a72
NIS		 3754
3755 (void)SvUPGRADE(sv, SVt_PV);
3756
877f6a72 3757 if (PerlLIO_lstat(".", &statbuf) < 0) {
a87ab2eb 3758 SV_CWD_RETURN_UNDEF;
877f6a72
NIS		 3759 }
3760
3761 orig_cdev = statbuf.st_dev;
3762 orig_cino = statbuf.st_ino;
3763 cdev = orig_cdev;
3764 cino = orig_cino;
3765
3766 for (;;) {
3767 odev = cdev;
3768 oino = cino;
3769
3770 if (PerlDir_chdir("..") < 0) {
3771 SV_CWD_RETURN_UNDEF;
3772 }
3773 if (PerlLIO_stat(".", &statbuf) < 0) {
3774 SV_CWD_RETURN_UNDEF;
3775 }
3776
3777 cdev = statbuf.st_dev;
3778 cino = statbuf.st_ino;
3779
3780 if (odev == cdev && oino == cino) {
3781 break;
3782 }
3783 if (!(dir = PerlDir_open("."))) {
3784 SV_CWD_RETURN_UNDEF;
3785 }
3786
3787 while ((dp = PerlDir_read(dir)) != NULL) {
3788#ifdef DIRNAMLEN
3789 namelen = dp->d_namlen;
3790#else
3791 namelen = strlen(dp->d_name);
3792#endif
3793 /* skip . and .. */
a87ab2eb 3794 if (SV_CWD_ISDOT(dp)) {
877f6a72
NIS		 3795 continue;
3796 }
3797
3798 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3799 SV_CWD_RETURN_UNDEF;
3800 }
3801
3802 tdev = statbuf.st_dev;
3803 tino = statbuf.st_ino;
3804 if (tino == oino && tdev == odev) {
3805 break;
3806 }
3807 }
3808
3809 if (!dp) {
3810 SV_CWD_RETURN_UNDEF;
3811 }
3812
cb5953d6
JH		 3813 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3814 SV_CWD_RETURN_UNDEF;
3815 }
3816
877f6a72
NIS		 3817 SvGROW(sv, pathlen + namelen + 1);
3818
3819 if (pathlen) {
3820 /* shift down */
3821 Move(SvPVX(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3822 }
3823
3824 /* prepend current directory to the front */
3825 *SvPVX(sv) = '/';
3826 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3827 pathlen += (namelen + 1);
3828
3829#ifdef VOID_CLOSEDIR
3830 PerlDir_close(dir);
3831#else
3832 if (PerlDir_close(dir) < 0) {
3833 SV_CWD_RETURN_UNDEF;
3834 }
3835#endif
3836 }
3837
60e110a8
DM		 3838 if (pathlen) {
3839 SvCUR_set(sv, pathlen);
3840 *SvEND(sv) = '\0';
3841 SvPOK_only(sv);
877f6a72 3842
2a45baea 3843 if (PerlDir_chdir(SvPVX(sv)) < 0) {
60e110a8
DM		 3844 SV_CWD_RETURN_UNDEF;
3845 }
877f6a72
NIS		 3846 }
3847 if (PerlLIO_stat(".", &statbuf) < 0) {
3848 SV_CWD_RETURN_UNDEF;
3849 }
3850
3851 cdev = statbuf.st_dev;
3852 cino = statbuf.st_ino;
3853
3854 if (cdev != orig_cdev || cino != orig_cino) {
3855 Perl_croak(aTHX_ "Unstable directory path, "
3856 "current directory changed unexpectedly");
3857 }
3858#endif
3859
3860 return TRUE;
3861#else
3862 return FALSE;
3863#endif
3864}
3865
Unnamed repository; edit this file 'description' to name the repository.