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