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
Back out change #25839, and apply :
[perl5.git] / util.c
CommitLineData
a0d0e21e 1/* util.c
a687059c 2 *
4bb101f2 3 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999,
770526c1 4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
a687059c 5 *
d48672a2
LW		 6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8d063cd8 8 *
8d063cd8 9 */
a0d0e21e
LW		 10
11/*
12 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
13 * not content." --Gandalf
14 */
8d063cd8 15
166f8a29
DM		 16/* This file contains assorted utility routines.
17 * Which is a polite way of saying any stuff that people couldn't think of
18 * a better place for. Amongst other things, it includes the warning and
19 * dieing stuff, plus wrappers for malloc code.
20 */
21
8d063cd8 22#include "EXTERN.h"
864dbfa3 23#define PERL_IN_UTIL_C
8d063cd8 24#include "perl.h"
62b28dd9 25
64ca3a65 26#ifndef PERL_MICRO
a687059c 27#include <signal.h>
36477c24 28#ifndef SIG_ERR
29# define SIG_ERR ((Sighandler_t) -1)
30#endif
64ca3a65 31#endif
36477c24 32
172d2248
OS		 33#ifdef __Lynx__
34/* Missing protos on LynxOS */
35int putenv(char *);
36#endif
37
ff68c719 38#ifdef I_SYS_WAIT
39# include <sys/wait.h>
40#endif
41
868439a2
JH		 42#ifdef HAS_SELECT
43# ifdef I_SYS_SELECT
44# include <sys/select.h>
45# endif
46#endif
47
8d063cd8 48#define FLUSH
8d063cd8 49
16cebae2
GS		 50#if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC)
51# define FD_CLOEXEC 1 /* NeXT needs this */
52#endif
53
a687059c
LW		 54/* NOTE: Do not call the next three routines directly. Use the macros
55 * in handy.h, so that we can easily redefine everything to do tracking of
56 * allocated hunks back to the original New to track down any memory leaks.
20cec16a 57 * XXX This advice seems to be widely ignored :-( --AD August 1996.
a687059c
LW		 58 */
59
26fa51c3
AMS		 60/* paranoid version of system's malloc() */
61
bd4080b3 62Malloc_t
4f63d024 63Perl_safesysmalloc(MEM_SIZE size)
8d063cd8 64{
54aff467 65 dTHX;
bd4080b3 66 Malloc_t ptr;
55497cff 67#ifdef HAS_64K_LIMIT
62b28dd9 68 if (size > 0xffff) {
bf49b057 69 PerlIO_printf(Perl_error_log,
16cebae2 70 "Allocation too large: %lx\n", size) FLUSH;
54aff467 71 my_exit(1);
62b28dd9 72 }
55497cff 73#endif /* HAS_64K_LIMIT */
34de22dd
LW		 74#ifdef DEBUGGING
75 if ((long)size < 0)
4f63d024 76 Perl_croak_nocontext("panic: malloc");
34de22dd 77#endif
12ae5dfc 78 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
da927450 79 PERL_ALLOC_CHECK(ptr);
97835f67 80 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
8d063cd8
LW		 81 if (ptr != Nullch)
82 return ptr;
3280af22 83 else if (PL_nomemok)
7c0587c8 84 return Nullch;
8d063cd8 85 else {
e0767201
GA		 86 /* Can't use PerlIO to write as it allocates memory */
87 PerlLIO_write(PerlIO_fileno(Perl_error_log),
88 PL_no_mem, strlen(PL_no_mem));
54aff467 89 my_exit(1);
3aed30dc 90 return Nullch;
8d063cd8
LW		 91 }
92 /*NOTREACHED*/
93}
94
f2517201 95/* paranoid version of system's realloc() */
8d063cd8 96
bd4080b3 97Malloc_t
4f63d024 98Perl_safesysrealloc(Malloc_t where,MEM_SIZE size)
8d063cd8 99{
54aff467 100 dTHX;
bd4080b3 101 Malloc_t ptr;
9a34ef1d 102#if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO)
6ad3d225 103 Malloc_t PerlMem_realloc();
ecfc5424 104#endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
8d063cd8 105
a1d180c4 106#ifdef HAS_64K_LIMIT
5f05dabc 107 if (size > 0xffff) {
bf49b057 108 PerlIO_printf(Perl_error_log,
5f05dabc 109 "Reallocation too large: %lx\n", size) FLUSH;
54aff467 110 my_exit(1);
5f05dabc 111 }
55497cff 112#endif /* HAS_64K_LIMIT */
7614df0c 113 if (!size) {
f2517201 114 safesysfree(where);
7614df0c
JD		 115 return NULL;
116 }
117
378cc40b 118 if (!where)
f2517201 119 return safesysmalloc(size);
34de22dd
LW		 120#ifdef DEBUGGING
121 if ((long)size < 0)
4f63d024 122 Perl_croak_nocontext("panic: realloc");
34de22dd 123#endif
12ae5dfc 124 ptr = (Malloc_t)PerlMem_realloc(where,size);
da927450 125 PERL_ALLOC_CHECK(ptr);
a1d180c4 126
97835f67
JH		 127 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++));
128 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size));
79072805 129
8d063cd8
LW		 130 if (ptr != Nullch)
131 return ptr;
3280af22 132 else if (PL_nomemok)
7c0587c8 133 return Nullch;
8d063cd8 134 else {
e0767201
GA		 135 /* Can't use PerlIO to write as it allocates memory */
136 PerlLIO_write(PerlIO_fileno(Perl_error_log),
137 PL_no_mem, strlen(PL_no_mem));
54aff467 138 my_exit(1);
4e35701f 139 return Nullch;
8d063cd8
LW		 140 }
141 /*NOTREACHED*/
142}
143
f2517201 144/* safe version of system's free() */
8d063cd8 145
54310121 146Free_t
4f63d024 147Perl_safesysfree(Malloc_t where)
8d063cd8 148{
27da23d5 149 dVAR;
155aba94 150#ifdef PERL_IMPLICIT_SYS
54aff467 151 dTHX;
155aba94 152#endif
97835f67 153 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++));
378cc40b 154 if (where) {
6ad3d225 155 PerlMem_free(where);
378cc40b 156 }
8d063cd8
LW		 157}
158
f2517201 159/* safe version of system's calloc() */
1050c9ca 160
bd4080b3 161Malloc_t
4f63d024 162Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size)
1050c9ca 163{
54aff467 164 dTHX;
bd4080b3 165 Malloc_t ptr;
1050c9ca 166
55497cff 167#ifdef HAS_64K_LIMIT
5f05dabc 168 if (size * count > 0xffff) {
bf49b057 169 PerlIO_printf(Perl_error_log,
5f05dabc 170 "Allocation too large: %lx\n", size * count) FLUSH;
54aff467 171 my_exit(1);
5f05dabc 172 }
55497cff 173#endif /* HAS_64K_LIMIT */
1050c9ca 174#ifdef DEBUGGING
175 if ((long)size < 0 || (long)count < 0)
4f63d024 176 Perl_croak_nocontext("panic: calloc");
1050c9ca 177#endif
0b7c1c42 178 size *= count;
12ae5dfc 179 ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */
da927450 180 PERL_ALLOC_CHECK(ptr);
97835f67 181 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 182 if (ptr != Nullch) {
183 memset((void*)ptr, 0, size);
184 return ptr;
185 }
3280af22 186 else if (PL_nomemok)
1050c9ca 187 return Nullch;
188 else {
e0767201
GA		 189 /* Can't use PerlIO to write as it allocates memory */
190 PerlLIO_write(PerlIO_fileno(Perl_error_log),
191 PL_no_mem, strlen(PL_no_mem));
54aff467 192 my_exit(1);
4e35701f 193 return Nullch;
1050c9ca 194 }
195 /*NOTREACHED*/
196}
197
cae6d0e5
GS		 198/* These must be defined when not using Perl's malloc for binary
199 * compatibility */
200
201#ifndef MYMALLOC
202
203Malloc_t Perl_malloc (MEM_SIZE nbytes)
204{
205 dTHXs;
077a72a9 206 return (Malloc_t)PerlMem_malloc(nbytes);
cae6d0e5
GS		 207}
208
209Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size)
210{
211 dTHXs;
077a72a9 212 return (Malloc_t)PerlMem_calloc(elements, size);
cae6d0e5
GS		 213}
214
215Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes)
216{
217 dTHXs;
077a72a9 218 return (Malloc_t)PerlMem_realloc(where, nbytes);
cae6d0e5
GS		 219}
220
221Free_t Perl_mfree (Malloc_t where)
222{
223 dTHXs;
224 PerlMem_free(where);
225}
226
227#endif
228
8d063cd8
LW		 229/* copy a string up to some (non-backslashed) delimiter, if any */
230
231char *
e1ec3a88 232Perl_delimcpy(pTHX_ register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen)
8d063cd8 233{
fc36a67e 234 register I32 tolen;
235 for (tolen = 0; from < fromend; from++, tolen++) {
378cc40b
LW		 236 if (*from == '\\') {
237 if (from[1] == delim)
238 from++;
fc36a67e 239 else {
240 if (to < toend)
241 *to++ = *from;
242 tolen++;
243 from++;
244 }
378cc40b 245 }
bedebaa5 246 else if (*from == delim)
8d063cd8 247 break;
fc36a67e 248 if (to < toend)
249 *to++ = *from;
8d063cd8 250 }
bedebaa5
CS		 251 if (to < toend)
252 *to = '\0';
fc36a67e 253 *retlen = tolen;
73d840c0 254 return (char *)from;
8d063cd8
LW		 255}
256
257/* return ptr to little string in big string, NULL if not found */
378cc40b 258/* This routine was donated by Corey Satten. */
8d063cd8
LW		 259
260char *
864dbfa3 261Perl_instr(pTHX_ register const char *big, register const char *little)
378cc40b 262{
79072805 263 register I32 first;
378cc40b 264
a687059c 265 if (!little)
08105a92 266 return (char*)big;
a687059c 267 first = *little++;
378cc40b 268 if (!first)
08105a92 269 return (char*)big;
378cc40b 270 while (*big) {
66a1b24b 271 register const char *s, *x;
378cc40b
LW		 272 if (*big++ != first)
273 continue;
274 for (x=big,s=little; *s; /**/ ) {
275 if (!*x)
276 return Nullch;
277 if (*s++ != *x++) {
278 s--;
279 break;
280 }
281 }
282 if (!*s)
08105a92 283 return (char*)(big-1);
378cc40b
LW		 284 }
285 return Nullch;
286}
8d063cd8 287
a687059c
LW		 288/* same as instr but allow embedded nulls */
289
290char *
864dbfa3 291Perl_ninstr(pTHX_ register const char *big, register const char *bigend, const char *little, const char *lend)
8d063cd8 292{
e1ec3a88 293 register const I32 first = *little;
08105a92 294 register const char *littleend = lend;
378cc40b 295
a0d0e21e 296 if (!first && little >= littleend)
08105a92 297 return (char*)big;
de3bb511
LW		 298 if (bigend - big < littleend - little)
299 return Nullch;
a687059c
LW		 300 bigend -= littleend - little++;
301 while (big <= bigend) {
66a1b24b 302 register const char *s, *x;
a687059c
LW		 303 if (*big++ != first)
304 continue;
305 for (x=big,s=little; s < littleend; /**/ ) {
306 if (*s++ != *x++) {
307 s--;
308 break;
309 }
310 }
311 if (s >= littleend)
08105a92 312 return (char*)(big-1);
378cc40b 313 }
a687059c
LW		 314 return Nullch;
315}
316
317/* reverse of the above--find last substring */
318
319char *
864dbfa3 320Perl_rninstr(pTHX_ register const char *big, const char *bigend, const char *little, const char *lend)
a687059c 321{
08105a92 322 register const char *bigbeg;
e1ec3a88 323 register const I32 first = *little;
08105a92 324 register const char *littleend = lend;
a687059c 325
a0d0e21e 326 if (!first && little >= littleend)
08105a92 327 return (char*)bigend;
a687059c
LW		 328 bigbeg = big;
329 big = bigend - (littleend - little++);
330 while (big >= bigbeg) {
66a1b24b 331 register const char *s, *x;
a687059c
LW		 332 if (*big-- != first)
333 continue;
334 for (x=big+2,s=little; s < littleend; /**/ ) {
335 if (*s++ != *x++) {
336 s--;
337 break;
338 }
339 }
340 if (s >= littleend)
08105a92 341 return (char*)(big+1);
378cc40b 342 }
a687059c 343 return Nullch;
378cc40b 344}
a687059c 345
cf93c79d
IZ		 346#define FBM_TABLE_OFFSET 2 /* Number of bytes between EOS and table*/
347
348/* As a space optimization, we do not compile tables for strings of length
349 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are
350 special-cased in fbm_instr().
351
352 If FBMcf_TAIL, the table is created as if the string has a trailing \n. */
353
954c1994 354/*
ccfc67b7
JH		 355=head1 Miscellaneous Functions
356
954c1994
GS		 357=for apidoc fbm_compile
358
359Analyses the string in order to make fast searches on it using fbm_instr()
360-- the Boyer-Moore algorithm.
361
362=cut
363*/
364
378cc40b 365void
7506f9c3 366Perl_fbm_compile(pTHX_ SV *sv, U32 flags)
378cc40b 367{
0d46e09a 368 register const U8 *s;
79072805 369 register U32 i;
0b71040e 370 STRLEN len;
79072805
LW		 371 I32 rarest = 0;
372 U32 frequency = 256;
373
c517dc2b 374 if (flags & FBMcf_TAIL) {
890ce7af 375 MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
cf93c79d 376 sv_catpvn(sv, "\n", 1); /* Taken into account in fbm_instr() */
c517dc2b
JH		 377 if (mg && mg->mg_len >= 0)
378 mg->mg_len++;
379 }
9cbe880b 380 s = (U8*)SvPV_force_mutable(sv, len);
862a34c6 381 SvUPGRADE(sv, SVt_PVBM);
d1be9408 382 if (len == 0) /* TAIL might be on a zero-length string. */
cf93c79d 383 return;
02128f11 384 if (len > 2) {
9cbe880b 385 const unsigned char *sb;
66a1b24b 386 const U8 mlen = (len>255) ? 255 : (U8)len;
890ce7af 387 register U8 *table;
cf93c79d 388
7506f9c3 389 Sv_Grow(sv, len + 256 + FBM_TABLE_OFFSET);
9cbe880b 390 table = (unsigned char*)(SvPVX_mutable(sv) + len + FBM_TABLE_OFFSET);
7506f9c3
GS		 391 s = table - 1 - FBM_TABLE_OFFSET; /* last char */
392 memset((void*)table, mlen, 256);
393 table[-1] = (U8)flags;
02128f11 394 i = 0;
7506f9c3 395 sb = s - mlen + 1; /* first char (maybe) */
cf93c79d
IZ		 396 while (s >= sb) {
397 if (table[*s] == mlen)
7506f9c3 398 table[*s] = (U8)i;
cf93c79d
IZ		 399 s--, i++;
400 }
378cc40b 401 }
14befaf4 402 sv_magic(sv, Nullsv, PERL_MAGIC_bm, Nullch, 0); /* deep magic */
79072805 403 SvVALID_on(sv);
378cc40b 404
9cbe880b 405 s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */
bbce6d69 406 for (i = 0; i < len; i++) {
22c35a8c 407 if (PL_freq[s[i]] < frequency) {
bbce6d69 408 rarest = i;
22c35a8c 409 frequency = PL_freq[s[i]];
378cc40b
LW		 410 }
411 }
79072805 412 BmRARE(sv) = s[rarest];
eb160463 413 BmPREVIOUS(sv) = (U16)rarest;
cf93c79d
IZ		 414 BmUSEFUL(sv) = 100; /* Initial value */
415 if (flags & FBMcf_TAIL)
416 SvTAIL_on(sv);
7506f9c3
GS		 417 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",
418 BmRARE(sv),BmPREVIOUS(sv)));
378cc40b
LW		 419}
420
cf93c79d
IZ		 421/* If SvTAIL(littlestr), it has a fake '\n' at end. */
422/* If SvTAIL is actually due to \Z or \z, this gives false positives
423 if multiline */
424
954c1994
GS		 425/*
426=for apidoc fbm_instr
427
428Returns the location of the SV in the string delimited by C<str> and
429C<strend>. It returns C<Nullch> if the string can't be found. The C<sv>
430does not have to be fbm_compiled, but the search will not be as fast
431then.
432
433=cut
434*/
435
378cc40b 436char *
864dbfa3 437Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags)
378cc40b 438{
a687059c 439 register unsigned char *s;
cf93c79d 440 STRLEN l;
9cbe880b
NC		 441 register const unsigned char *little
442 = (const unsigned char *)SvPV_const(littlestr,l);
cf93c79d 443 register STRLEN littlelen = l;
e1ec3a88 444 register const I32 multiline = flags & FBMrf_MULTILINE;
cf93c79d 445
eb160463 446 if ((STRLEN)(bigend - big) < littlelen) {
a1d180c4 447 if ( SvTAIL(littlestr)
eb160463 448 && ((STRLEN)(bigend - big) == littlelen - 1)
a1d180c4 449 && (littlelen == 1
12ae5dfc 450 || (*big == *little &&
27da23d5 451 memEQ((char *)big, (char *)little, littlelen - 1))))
cf93c79d
IZ		 452 return (char*)big;
453 return Nullch;
454 }
378cc40b 455
cf93c79d 456 if (littlelen <= 2) { /* Special-cased */
cf93c79d
IZ		 457
458 if (littlelen == 1) {
459 if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */
460 /* Know that bigend != big. */
461 if (bigend[-1] == '\n')
462 return (char *)(bigend - 1);
463 return (char *) bigend;
464 }
465 s = big;
466 while (s < bigend) {
467 if (*s == *little)
468 return (char *)s;
469 s++;
470 }
471 if (SvTAIL(littlestr))
472 return (char *) bigend;
473 return Nullch;
474 }
475 if (!littlelen)
476 return (char*)big; /* Cannot be SvTAIL! */
477
478 /* littlelen is 2 */
479 if (SvTAIL(littlestr) && !multiline) {
480 if (bigend[-1] == '\n' && bigend[-2] == *little)
481 return (char*)bigend - 2;
482 if (bigend[-1] == *little)
483 return (char*)bigend - 1;
484 return Nullch;
485 }
486 {
487 /* This should be better than FBM if c1 == c2, and almost
488 as good otherwise: maybe better since we do less indirection.
489 And we save a lot of memory by caching no table. */
66a1b24b
AL		 490 const unsigned char c1 = little[0];
491 const unsigned char c2 = little[1];
cf93c79d
IZ		 492
493 s = big + 1;
494 bigend--;
495 if (c1 != c2) {
496 while (s <= bigend) {
497 if (s[0] == c2) {
498 if (s[-1] == c1)
499 return (char*)s - 1;
500 s += 2;
501 continue;
3fe6f2dc 502 }
cf93c79d
IZ		 503 next_chars:
504 if (s[0] == c1) {
505 if (s == bigend)
506 goto check_1char_anchor;
507 if (s[1] == c2)
508 return (char*)s;
509 else {
510 s++;
511 goto next_chars;
512 }
513 }
514 else
515 s += 2;
516 }
517 goto check_1char_anchor;
518 }
519 /* Now c1 == c2 */
520 while (s <= bigend) {
521 if (s[0] == c1) {
522 if (s[-1] == c1)
523 return (char*)s - 1;
524 if (s == bigend)
525 goto check_1char_anchor;
526 if (s[1] == c1)
527 return (char*)s;
528 s += 3;
02128f11 529 }
c277df42 530 else
cf93c79d 531 s += 2;
c277df42 532 }
c277df42 533 }
cf93c79d
IZ		 534 check_1char_anchor: /* One char and anchor! */
535 if (SvTAIL(littlestr) && (*bigend == *little))
536 return (char *)bigend; /* bigend is already decremented. */
537 return Nullch;
d48672a2 538 }
cf93c79d 539 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
bbce6d69 540 s = bigend - littlelen;
a1d180c4 541 if (s >= big && bigend[-1] == '\n' && *s == *little
cf93c79d
IZ		 542 /* Automatically of length > 2 */
543 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
7506f9c3 544 {
bbce6d69 545 return (char*)s; /* how sweet it is */
7506f9c3
GS		 546 }
547 if (s[1] == *little
548 && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2))
549 {
cf93c79d 550 return (char*)s + 1; /* how sweet it is */
7506f9c3 551 }
02128f11
IZ		 552 return Nullch;
553 }
cf93c79d
IZ		 554 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
555 char *b = ninstr((char*)big,(char*)bigend,
556 (char*)little, (char*)little + littlelen);
557
558 if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */
559 /* Chop \n from littlestr: */
560 s = bigend - littlelen + 1;
7506f9c3
GS		 561 if (*s == *little
562 && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2))
563 {
3fe6f2dc 564 return (char*)s;
7506f9c3 565 }
cf93c79d 566 return Nullch;
a687059c 567 }
cf93c79d 568 return b;
a687059c 569 }
a1d180c4 570
cf93c79d 571 { /* Do actual FBM. */
e1ec3a88 572 register const unsigned char *table = little + littlelen + FBM_TABLE_OFFSET;
0d46e09a 573 register const unsigned char *oldlittle;
cf93c79d 574
eb160463 575 if (littlelen > (STRLEN)(bigend - big))
cf93c79d
IZ		 576 return Nullch;
577 --littlelen; /* Last char found by table lookup */
578
579 s = big + littlelen;
580 little += littlelen; /* last char */
581 oldlittle = little;
582 if (s < bigend) {
583 register I32 tmp;
584
585 top2:
7506f9c3 586 if ((tmp = table[*s])) {
cf93c79d 587 if ((s += tmp) < bigend)
62b28dd9 588 goto top2;
cf93c79d
IZ		 589 goto check_end;
590 }
591 else { /* less expensive than calling strncmp() */
66a1b24b 592 register unsigned char * const olds = s;
cf93c79d
IZ		 593
594 tmp = littlelen;
595
596 while (tmp--) {
597 if (*--s == *--little)
598 continue;
cf93c79d
IZ		 599 s = olds + 1; /* here we pay the price for failure */
600 little = oldlittle;
601 if (s < bigend) /* fake up continue to outer loop */
602 goto top2;
603 goto check_end;
604 }
605 return (char *)s;
a687059c 606 }
378cc40b 607 }
cf93c79d
IZ		 608 check_end:
609 if ( s == bigend && (table[-1] & FBMcf_TAIL)
12ae5dfc
JH		 610 && memEQ((char *)(bigend - littlelen),
611 (char *)(oldlittle - littlelen), littlelen) )
cf93c79d
IZ		 612 return (char*)bigend - littlelen;
613 return Nullch;
378cc40b 614 }
378cc40b
LW		 615}
616
c277df42
IZ		 617/* start_shift, end_shift are positive quantities which give offsets
618 of ends of some substring of bigstr.
a0288114 619 If "last" we want the last occurrence.
c277df42 620 old_posp is the way of communication between consequent calls if
a1d180c4 621 the next call needs to find the .
c277df42 622 The initial *old_posp should be -1.
cf93c79d
IZ		 623
624 Note that we take into account SvTAIL, so one can get extra
625 optimizations if _ALL flag is set.
c277df42
IZ		 626 */
627
cf93c79d 628/* If SvTAIL is actually due to \Z or \z, this gives false positives
26fa51c3 629 if PL_multiline. In fact if !PL_multiline the authoritative answer
cf93c79d
IZ		 630 is not supported yet. */
631
378cc40b 632char *
864dbfa3 633Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last)
378cc40b 634{
0d46e09a 635 register const unsigned char *big;
79072805
LW		 636 register I32 pos;
637 register I32 previous;
638 register I32 first;
0d46e09a 639 register const unsigned char *little;
c277df42 640 register I32 stop_pos;
0d46e09a 641 register const unsigned char *littleend;
c277df42 642 I32 found = 0;
378cc40b 643
c277df42 644 if (*old_posp == -1
3280af22 645 ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0
cf93c79d
IZ		 646 : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) {
647 cant_find:
a1d180c4 648 if ( BmRARE(littlestr) == '\n'
cf93c79d 649 && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) {
cfd0369c 650 little = (const unsigned char *)(SvPVX_const(littlestr));
cf93c79d
IZ		 651 littleend = little + SvCUR(littlestr);
652 first = *little++;
653 goto check_tail;
654 }
378cc40b 655 return Nullch;
cf93c79d
IZ		 656 }
657
cfd0369c 658 little = (const unsigned char *)(SvPVX_const(littlestr));
79072805 659 littleend = little + SvCUR(littlestr);
378cc40b 660 first = *little++;
c277df42 661 /* The value of pos we can start at: */
79072805 662 previous = BmPREVIOUS(littlestr);
cfd0369c 663 big = (const unsigned char *)(SvPVX_const(bigstr));
c277df42
IZ		 664 /* The value of pos we can stop at: */
665 stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous);
cf93c79d 666 if (previous + start_shift > stop_pos) {
0fe87f7c
HS		 667/*
668 stop_pos does not include SvTAIL in the count, so this check is incorrect
669 (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19
670*/
671#if 0
cf93c79d
IZ		 672 if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */
673 goto check_tail;
0fe87f7c 674#endif
cf93c79d
IZ		 675 return Nullch;
676 }
c277df42 677 while (pos < previous + start_shift) {
3280af22 678 if (!(pos += PL_screamnext[pos]))
cf93c79d 679 goto cant_find;
378cc40b 680 }
de3bb511 681 big -= previous;
bbce6d69 682 do {
0d46e09a 683 register const unsigned char *s, *x;
ef64f398 684 if (pos >= stop_pos) break;
bbce6d69 685 if (big[pos] != first)
686 continue;
687 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
bbce6d69 688 if (*s++ != *x++) {
689 s--;
690 break;
378cc40b 691 }
bbce6d69 692 }
c277df42
IZ		 693 if (s == littleend) {
694 *old_posp = pos;
695 if (!last) return (char *)(big+pos);
696 found = 1;
697 }
3280af22 698 } while ( pos += PL_screamnext[pos] );
a1d180c4 699 if (last && found)
cf93c79d 700 return (char *)(big+(*old_posp));
cf93c79d
IZ		 701 check_tail:
702 if (!SvTAIL(littlestr) || (end_shift > 0))
703 return Nullch;
704 /* Ignore the trailing "\n". This code is not microoptimized */
cfd0369c 705 big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr));
cf93c79d
IZ		 706 stop_pos = littleend - little; /* Actual littlestr len */
707 if (stop_pos == 0)
708 return (char*)big;
709 big -= stop_pos;
710 if (*big == first
12ae5dfc
JH		 711 && ((stop_pos == 1) ||
712 memEQ((char *)(big + 1), (char *)little, stop_pos - 1)))
cf93c79d
IZ		 713 return (char*)big;
714 return Nullch;
8d063cd8
LW		 715}
716
79072805 717I32
864dbfa3 718Perl_ibcmp(pTHX_ const char *s1, const char *s2, register I32 len)
79072805 719{
e1ec3a88
AL		 720 register const U8 *a = (const U8 *)s1;
721 register const U8 *b = (const U8 *)s2;
79072805 722 while (len--) {
22c35a8c 723 if (*a != *b && *a != PL_fold[*b])
bbce6d69 724 return 1;
725 a++,b++;
726 }
727 return 0;
728}
729
730I32
864dbfa3 731Perl_ibcmp_locale(pTHX_ const char *s1, const char *s2, register I32 len)
bbce6d69 732{
27da23d5 733 dVAR;
e1ec3a88
AL		 734 register const U8 *a = (const U8 *)s1;
735 register const U8 *b = (const U8 *)s2;
bbce6d69 736 while (len--) {
22c35a8c 737 if (*a != *b && *a != PL_fold_locale[*b])
bbce6d69 738 return 1;
739 a++,b++;
79072805
LW		 740 }
741 return 0;
742}
743
8d063cd8
LW		 744/* copy a string to a safe spot */
745
954c1994 746/*
ccfc67b7
JH		 747=head1 Memory Management
748
954c1994
GS		 749=for apidoc savepv
750
61a925ed
AMS		 751Perl's version of C<strdup()>. Returns a pointer to a newly allocated
752string which is a duplicate of C<pv>. The size of the string is
753determined by C<strlen()>. The memory allocated for the new string can
754be freed with the C<Safefree()> function.
954c1994
GS		 755
756=cut
757*/
758
8d063cd8 759char *
efdfce31 760Perl_savepv(pTHX_ const char *pv)
8d063cd8 761{
e90e2364
NC		 762 if (!pv)
763 return Nullch;
66a1b24b
AL		 764 else {
765 char *newaddr;
766 const STRLEN pvlen = strlen(pv)+1;
a02a5408 767 Newx(newaddr,pvlen,char);
490a0e98 768 return memcpy(newaddr,pv,pvlen);
66a1b24b 769 }
e90e2364 770
8d063cd8
LW		 771}
772
a687059c
LW		 773/* same thing but with a known length */
774
954c1994
GS		 775/*
776=for apidoc savepvn
777
61a925ed
AMS		 778Perl's version of what C<strndup()> would be if it existed. Returns a
779pointer to a newly allocated string which is a duplicate of the first
780C<len> bytes from C<pv>. The memory allocated for the new string can be
781freed with the C<Safefree()> function.
954c1994
GS		 782
783=cut
784*/
785
a687059c 786char *
efdfce31 787Perl_savepvn(pTHX_ const char *pv, register I32 len)
a687059c
LW		 788{
789 register char *newaddr;
790
a02a5408 791 Newx(newaddr,len+1,char);
92110913 792 /* Give a meaning to NULL pointer mainly for the use in sv_magic() */
efdfce31 793 if (pv) {
e90e2364
NC		 794 /* might not be null terminated */
795 newaddr[len] = '\0';
07409e01 796 return (char *) CopyD(pv,newaddr,len,char);
92110913
NIS		 797 }
798 else {
07409e01 799 return (char *) ZeroD(newaddr,len+1,char);
92110913 800 }
a687059c
LW		 801}
802
05ec9bb3
NIS		 803/*
804=for apidoc savesharedpv
805
61a925ed
AMS		 806A version of C<savepv()> which allocates the duplicate string in memory
807which is shared between threads.
05ec9bb3
NIS		 808
809=cut
810*/
811char *
efdfce31 812Perl_savesharedpv(pTHX_ const char *pv)
05ec9bb3 813{
e90e2364 814 register char *newaddr;
490a0e98 815 STRLEN pvlen;
e90e2364
NC		 816 if (!pv)
817 return Nullch;
818
490a0e98
NC		 819 pvlen = strlen(pv)+1;
820 newaddr = (char*)PerlMemShared_malloc(pvlen);
e90e2364
NC		 821 if (!newaddr) {
822 PerlLIO_write(PerlIO_fileno(Perl_error_log),
823 PL_no_mem, strlen(PL_no_mem));
824 my_exit(1);
05ec9bb3 825 }
490a0e98 826 return memcpy(newaddr,pv,pvlen);
05ec9bb3
NIS		 827}
828
2e0de35c
NC		 829/*
830=for apidoc savesvpv
831
6832267f 832A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from
2e0de35c
NC		 833the passed in SV using C<SvPV()>
834
835=cut
836*/
837
838char *
839Perl_savesvpv(pTHX_ SV *sv)
840{
841 STRLEN len;
e62f0680 842 const char *pv = SvPV_const(sv, len);
2e0de35c
NC		 843 register char *newaddr;
844
26866f99 845 ++len;
a02a5408 846 Newx(newaddr,len,char);
07409e01 847 return (char *) CopyD(pv,newaddr,len,char);
2e0de35c 848}
05ec9bb3
NIS		 849
850
cea2e8a9 851/* the SV for Perl_form() and mess() is not kept in an arena */
fc36a67e 852
76e3520e 853STATIC SV *
cea2e8a9 854S_mess_alloc(pTHX)
fc36a67e 855{
856 SV *sv;
857 XPVMG *any;
858
e72dc28c
GS		 859 if (!PL_dirty)
860 return sv_2mortal(newSVpvn("",0));
861
0372dbb6
GS		 862 if (PL_mess_sv)
863 return PL_mess_sv;
864
fc36a67e 865 /* Create as PVMG now, to avoid any upgrading later */
a02a5408
JC		 866 Newx(sv, 1, SV);
867 Newxz(any, 1, XPVMG);
fc36a67e 868 SvFLAGS(sv) = SVt_PVMG;
869 SvANY(sv) = (void*)any;
cace1726 870 SvPV_set(sv, 0);
fc36a67e 871 SvREFCNT(sv) = 1 << 30; /* practically infinite */
e72dc28c 872 PL_mess_sv = sv;
fc36a67e 873 return sv;
874}
875
c5be433b 876#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS		 877char *
878Perl_form_nocontext(const char* pat, ...)
879{
880 dTHX;
c5be433b 881 char *retval;
cea2e8a9
GS		 882 va_list args;
883 va_start(args, pat);
c5be433b 884 retval = vform(pat, &args);
cea2e8a9 885 va_end(args);
c5be433b 886 return retval;
cea2e8a9 887}
c5be433b 888#endif /* PERL_IMPLICIT_CONTEXT */
cea2e8a9 889
7c9e965c 890/*
ccfc67b7 891=head1 Miscellaneous Functions
7c9e965c
JP		 892=for apidoc form
893
894Takes a sprintf-style format pattern and conventional
895(non-SV) arguments and returns the formatted string.
896
897 (char *) Perl_form(pTHX_ const char* pat, ...)
898
899can be used any place a string (char *) is required:
900
901 char * s = Perl_form("%d.%d",major,minor);
902
903Uses a single private buffer so if you want to format several strings you
904must explicitly copy the earlier strings away (and free the copies when you
905are done).
906
907=cut
908*/
909
8990e307 910char *
864dbfa3 911Perl_form(pTHX_ const char* pat, ...)
8990e307 912{
c5be433b 913 char *retval;
46fc3d4c 914 va_list args;
46fc3d4c 915 va_start(args, pat);
c5be433b 916 retval = vform(pat, &args);
46fc3d4c 917 va_end(args);
c5be433b
GS		 918 return retval;
919}
920
921char *
922Perl_vform(pTHX_ const char *pat, va_list *args)
923{
2d03de9c 924 SV * const sv = mess_alloc();
c5be433b 925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
e72dc28c 926 return SvPVX(sv);
46fc3d4c 927}
a687059c 928
5a844595
GS		 929#if defined(PERL_IMPLICIT_CONTEXT)
930SV *
931Perl_mess_nocontext(const char *pat, ...)
932{
933 dTHX;
934 SV *retval;
935 va_list args;
936 va_start(args, pat);
937 retval = vmess(pat, &args);
938 va_end(args);
939 return retval;
940}
941#endif /* PERL_IMPLICIT_CONTEXT */
942
06bf62c7 943SV *
5a844595
GS		 944Perl_mess(pTHX_ const char *pat, ...)
945{
946 SV *retval;
947 va_list args;
948 va_start(args, pat);
949 retval = vmess(pat, &args);
950 va_end(args);
951 return retval;
952}
953
ae7d165c 954STATIC COP*
8772537c 955S_closest_cop(pTHX_ COP *cop, const OP *o)
ae7d165c
PJ		 956{
957 /* Look for PL_op starting from o. cop is the last COP we've seen. */
958
959 if (!o || o == PL_op) return cop;
960
961 if (o->op_flags & OPf_KIDS) {
962 OP *kid;
963 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
964 {
965 COP *new_cop;
966
967 /* If the OP_NEXTSTATE has been optimised away we can still use it
968 * the get the file and line number. */
969
970 if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE)
971 cop = (COP *)kid;
972
973 /* Keep searching, and return when we've found something. */
974
975 new_cop = closest_cop(cop, kid);
976 if (new_cop) return new_cop;
977 }
978 }
979
980 /* Nothing found. */
981
8772537c 982 return Null(COP *);
ae7d165c
PJ		 983}
984
5a844595
GS		 985SV *
986Perl_vmess(pTHX_ const char *pat, va_list *args)
46fc3d4c 987{
e72dc28c 988 SV *sv = mess_alloc();
27da23d5 989 static const char dgd[] = " during global destruction.\n";
46fc3d4c 990
fc36a67e 991 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
46fc3d4c 992 if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') {
ae7d165c
PJ		 993
994 /*
995 * Try and find the file and line for PL_op. This will usually be
996 * PL_curcop, but it might be a cop that has been optimised away. We
997 * can try to find such a cop by searching through the optree starting
998 * from the sibling of PL_curcop.
999 */
1000
e1ec3a88 1001 const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling);
ae7d165c
PJ		 1002 if (!cop) cop = PL_curcop;
1003
1004 if (CopLINE(cop))
ed094faf 1005 Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf,
3aed30dc 1006 OutCopFILE(cop), (IV)CopLINE(cop));
2035c5e8 1007 if (GvIO(PL_last_in_gv) && IoLINES(GvIOp(PL_last_in_gv))) {
e1ec3a88 1008 const bool line_mode = (RsSIMPLE(PL_rs) &&
95a20fc0 1009 SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n');
57def98f 1010 Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf,
edc2eac3
JH		 1011 PL_last_in_gv == PL_argvgv ?
1012 "" : GvNAME(PL_last_in_gv),
1013 line_mode ? "line" : "chunk",
1014 (IV)IoLINES(GvIOp(PL_last_in_gv)));
a687059c 1015 }
515f54a1 1016 sv_catpv(sv, PL_dirty ? dgd : ".\n");
a687059c 1017 }
06bf62c7 1018 return sv;
a687059c
LW		 1019}
1020
7ff03255
SG		 1021void
1022Perl_write_to_stderr(pTHX_ const char* message, int msglen)
1023{
27da23d5 1024 dVAR;
7ff03255
SG		 1025 IO *io;
1026 MAGIC *mg;
1027
1028 if (PL_stderrgv && SvREFCNT(PL_stderrgv)
1029 && (io = GvIO(PL_stderrgv))
1030 && (mg = SvTIED_mg((SV*)io, PERL_MAGIC_tiedscalar)))
1031 {
1032 dSP;
1033 ENTER;
1034 SAVETMPS;
1035
1036 save_re_context();
1037 SAVESPTR(PL_stderrgv);
1038 PL_stderrgv = Nullgv;
1039
1040 PUSHSTACKi(PERLSI_MAGIC);
1041
1042 PUSHMARK(SP);
1043 EXTEND(SP,2);
1044 PUSHs(SvTIED_obj((SV*)io, mg));
1045 PUSHs(sv_2mortal(newSVpvn(message, msglen)));
1046 PUTBACK;
1047 call_method("PRINT", G_SCALAR);
1048
1049 POPSTACK;
1050 FREETMPS;
1051 LEAVE;
1052 }
1053 else {
1054#ifdef USE_SFIO
1055 /* SFIO can really mess with your errno */
53c1dcc0 1056 const int e = errno;
7ff03255 1057#endif
53c1dcc0 1058 PerlIO * const serr = Perl_error_log;
7ff03255
SG		 1059
1060 PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen);
1061 (void)PerlIO_flush(serr);
1062#ifdef USE_SFIO
1063 errno = e;
1064#endif
1065 }
1066}
1067
3ab1ac99
NC		 1068/* Common code used by vcroak, vdie and vwarner */
1069
e07360fa 1070STATIC void
63315e18
NC		 1071S_vdie_common(pTHX_ const char *message, STRLEN msglen, I32 utf8)
1072{
1073 HV *stash;
1074 GV *gv;
1075 CV *cv;
1076 /* sv_2cv might call Perl_croak() */
890ce7af 1077 SV * const olddiehook = PL_diehook;
63315e18
NC		 1078
1079 assert(PL_diehook);
1080 ENTER;
1081 SAVESPTR(PL_diehook);
1082 PL_diehook = Nullsv;
1083 cv = sv_2cv(olddiehook, &stash, &gv, 0);
1084 LEAVE;
1085 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
1086 dSP;
1087 SV *msg;
1088
1089 ENTER;
1090 save_re_context();
1091 if (message) {
1092 msg = newSVpvn(message, msglen);
1093 SvFLAGS(msg) |= utf8;
1094 SvREADONLY_on(msg);
1095 SAVEFREESV(msg);
1096 }
1097 else {
1098 msg = ERRSV;
1099 }
1100
1101 PUSHSTACKi(PERLSI_DIEHOOK);
1102 PUSHMARK(SP);
1103 XPUSHs(msg);
1104 PUTBACK;
1105 call_sv((SV*)cv, G_DISCARD);
1106 POPSTACK;
1107 LEAVE;
1108 }
1109}
1110
cfd0369c 1111STATIC const char *
e07360fa
AT		 1112S_vdie_croak_common(pTHX_ const char* pat, va_list* args, STRLEN* msglen,
1113 I32* utf8)
1114{
1115 dVAR;
cfd0369c 1116 const char *message;
e07360fa
AT		 1117
1118 if (pat) {
890ce7af 1119 SV * const msv = vmess(pat, args);
e07360fa
AT		 1120 if (PL_errors && SvCUR(PL_errors)) {
1121 sv_catsv(PL_errors, msv);
cfd0369c 1122 message = SvPV_const(PL_errors, *msglen);
e07360fa
AT		 1123 SvCUR_set(PL_errors, 0);
1124 }
1125 else
cfd0369c 1126 message = SvPV_const(msv,*msglen);
e07360fa
AT		 1127 *utf8 = SvUTF8(msv);
1128 }
1129 else {
1130 message = Nullch;
1131 }
1132
1133 DEBUG_S(PerlIO_printf(Perl_debug_log,
1134 "%p: die/croak: message = %s\ndiehook = %p\n",
1135 thr, message, PL_diehook));
1136 if (PL_diehook) {
1137 S_vdie_common(aTHX_ message, *msglen, *utf8);
1138 }
1139 return message;
1140}
1141
c5be433b
GS		 1142OP *
1143Perl_vdie(pTHX_ const char* pat, va_list *args)
36477c24 1144{
73d840c0 1145 const char *message;
e1ec3a88 1146 const int was_in_eval = PL_in_eval;
06bf62c7 1147 STRLEN msglen;
ff882698 1148 I32 utf8 = 0;
36477c24 1149
bf49b057 1150 DEBUG_S(PerlIO_printf(Perl_debug_log,
199100c8 1151 "%p: die: curstack = %p, mainstack = %p\n",
533c011a 1152 thr, PL_curstack, PL_mainstack));
36477c24 1153
890ce7af 1154 message = vdie_croak_common(pat, args, &msglen, &utf8);
36477c24 1155
06bf62c7 1156 PL_restartop = die_where(message, msglen);
ff882698 1157 SvFLAGS(ERRSV) |= utf8;
bf49b057 1158 DEBUG_S(PerlIO_printf(Perl_debug_log,
7c06b590 1159 "%p: die: restartop = %p, was_in_eval = %d, top_env = %p\n",
533c011a 1160 thr, PL_restartop, was_in_eval, PL_top_env));
3280af22 1161 if ((!PL_restartop && was_in_eval) || PL_top_env->je_prev)
6224f72b 1162 JMPENV_JUMP(3);
3280af22 1163 return PL_restartop;
36477c24 1164}
1165
c5be433b 1166#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS		 1167OP *
1168Perl_die_nocontext(const char* pat, ...)
a687059c 1169{
cea2e8a9
GS		 1170 dTHX;
1171 OP *o;
a687059c 1172 va_list args;
cea2e8a9 1173 va_start(args, pat);
c5be433b 1174 o = vdie(pat, &args);
cea2e8a9
GS		 1175 va_end(args);
1176 return o;
1177}
c5be433b 1178#endif /* PERL_IMPLICIT_CONTEXT */
cea2e8a9
GS		 1179
1180OP *
1181Perl_die(pTHX_ const char* pat, ...)
1182{
1183 OP *o;
1184 va_list args;
1185 va_start(args, pat);
c5be433b 1186 o = vdie(pat, &args);
cea2e8a9
GS		 1187 va_end(args);
1188 return o;
1189}
1190
c5be433b
GS		 1191void
1192Perl_vcroak(pTHX_ const char* pat, va_list *args)
cea2e8a9 1193{
73d840c0 1194 const char *message;
06bf62c7 1195 STRLEN msglen;
ff882698 1196 I32 utf8 = 0;
a687059c 1197
3ab1ac99 1198 message = S_vdie_croak_common(aTHX_ pat, args, &msglen, &utf8);
5a844595 1199
3280af22 1200 if (PL_in_eval) {
06bf62c7 1201 PL_restartop = die_where(message, msglen);
ff882698 1202 SvFLAGS(ERRSV) |= utf8;
6224f72b 1203 JMPENV_JUMP(3);
a0d0e21e 1204 }
84414e3e 1205 else if (!message)
cfd0369c 1206 message = SvPVx_const(ERRSV, msglen);
84414e3e 1207
7ff03255 1208 write_to_stderr(message, msglen);
f86702cc 1209 my_failure_exit();
a687059c
LW		 1210}
1211
c5be433b 1212#if defined(PERL_IMPLICIT_CONTEXT)
8990e307 1213void
cea2e8a9 1214Perl_croak_nocontext(const char *pat, ...)
a687059c 1215{
cea2e8a9 1216 dTHX;
a687059c 1217 va_list args;
cea2e8a9 1218 va_start(args, pat);
c5be433b 1219 vcroak(pat, &args);
cea2e8a9
GS		 1220 /* NOTREACHED */
1221 va_end(args);
1222}
1223#endif /* PERL_IMPLICIT_CONTEXT */
1224
954c1994 1225/*
ccfc67b7
JH		 1226=head1 Warning and Dieing
1227
954c1994
GS		 1228=for apidoc croak
1229
9983fa3c 1230This is the XSUB-writer's interface to Perl's C<die> function.
966353fd
MF		 1231Normally call this function the same way you call the C C<printf>
1232function. Calling C<croak> returns control directly to Perl,
1233sidestepping the normal C order of execution. See C<warn>.
9983fa3c
GS		 1234
1235If you want to throw an exception object, assign the object to
1236C<$@> and then pass C<Nullch> to croak():
1237
1238 errsv = get_sv("@", TRUE);
1239 sv_setsv(errsv, exception_object);
1240 croak(Nullch);
954c1994
GS		 1241
1242=cut
1243*/
1244
cea2e8a9
GS		 1245void
1246Perl_croak(pTHX_ const char *pat, ...)
1247{
1248 va_list args;
1249 va_start(args, pat);
c5be433b 1250 vcroak(pat, &args);
cea2e8a9
GS		 1251 /* NOTREACHED */
1252 va_end(args);
1253}
1254
c5be433b
GS		 1255void
1256Perl_vwarn(pTHX_ const char* pat, va_list *args)
cea2e8a9 1257{
27da23d5 1258 dVAR;
06bf62c7 1259 STRLEN msglen;
53c1dcc0
AL		 1260 SV * const msv = vmess(pat, args);
1261 const I32 utf8 = SvUTF8(msv);
1262 const char * const message = SvPV_const(msv, msglen);
a687059c 1263
3280af22 1264 if (PL_warnhook) {
cea2e8a9 1265 /* sv_2cv might call Perl_warn() */
53c1dcc0
AL		 1266 SV * const oldwarnhook = PL_warnhook;
1267 CV * cv;
1268 HV * stash;
1269 GV * gv;
1270
1738f5c4 1271 ENTER;
3280af22
NIS		 1272 SAVESPTR(PL_warnhook);
1273 PL_warnhook = Nullsv;
20cec16a 1274 cv = sv_2cv(oldwarnhook, &stash, &gv, 0);
1738f5c4
CS		 1275 LEAVE;
1276 if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) {
20cec16a 1277 dSP;
774d564b 1278 SV *msg;
1279
1280 ENTER;
c5be5b4d
DM		 1281 SAVESPTR(PL_warnhook);
1282 PL_warnhook = Nullsv;
3a1f2dc9 1283 save_re_context();
06bf62c7 1284 msg = newSVpvn(message, msglen);
ff882698 1285 SvFLAGS(msg) |= utf8;
774d564b 1286 SvREADONLY_on(msg);
1287 SAVEFREESV(msg);
1288
e788e7d3 1289 PUSHSTACKi(PERLSI_WARNHOOK);
924508f0 1290 PUSHMARK(SP);
774d564b 1291 XPUSHs(msg);
20cec16a 1292 PUTBACK;
864dbfa3 1293 call_sv((SV*)cv, G_DISCARD);
d3acc0f7 1294 POPSTACK;
774d564b 1295 LEAVE;
20cec16a 1296 return;
1297 }
748a9306 1298 }
87582a92 1299
7ff03255 1300 write_to_stderr(message, msglen);
a687059c 1301}
8d063cd8 1302
c5be433b 1303#if defined(PERL_IMPLICIT_CONTEXT)
cea2e8a9
GS		 1304void
1305Perl_warn_nocontext(const char *pat, ...)
1306{
1307 dTHX;
1308 va_list args;
1309 va_start(args, pat);
c5be433b 1310 vwarn(pat, &args);
cea2e8a9
GS		 1311 va_end(args);
1312}
1313#endif /* PERL_IMPLICIT_CONTEXT */
1314
954c1994
GS		 1315/*
1316=for apidoc warn
1317
966353fd
MF		 1318This is the XSUB-writer's interface to Perl's C<warn> function. Call this
1319function the same way you call the C C<printf> function. See C<croak>.
954c1994
GS		 1320
1321=cut
1322*/
1323
cea2e8a9
GS		 1324void
1325Perl_warn(pTHX_ const char *pat, ...)
1326{
1327 va_list args;
1328 va_start(args, pat);
c5be433b 1329 vwarn(pat, &args);
cea2e8a9
GS		 1330 va_end(args);
1331}
1332
c5be433b
GS		 1333#if defined(PERL_IMPLICIT_CONTEXT)
1334void
1335Perl_warner_nocontext(U32 err, const char *pat, ...)
1336{
27da23d5 1337 dTHX;
c5be433b
GS		 1338 va_list args;
1339 va_start(args, pat);
1340 vwarner(err, pat, &args);
1341 va_end(args);
1342}
1343#endif /* PERL_IMPLICIT_CONTEXT */
1344
599cee73 1345void
864dbfa3 1346Perl_warner(pTHX_ U32 err, const char* pat,...)
599cee73
PM		 1347{
1348 va_list args;
c5be433b
GS		 1349 va_start(args, pat);
1350 vwarner(err, pat, &args);
1351 va_end(args);
1352}
1353
1354void
1355Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args)
1356{
27da23d5 1357 dVAR;
d13b0d77 1358 if (ckDEAD(err)) {
a3b680e6 1359 SV * const msv = vmess(pat, args);
d13b0d77 1360 STRLEN msglen;
cfd0369c 1361 const char *message = SvPV_const(msv, msglen);
a3b680e6 1362 const I32 utf8 = SvUTF8(msv);
599cee73 1363
3aed30dc 1364 if (PL_diehook) {
63315e18
NC		 1365 assert(message);
1366 S_vdie_common(aTHX_ message, msglen, utf8);
3aed30dc
HS		 1367 }
1368 if (PL_in_eval) {
1369 PL_restartop = die_where(message, msglen);
ff882698 1370 SvFLAGS(ERRSV) |= utf8;
3aed30dc
HS		 1371 JMPENV_JUMP(3);
1372 }
7ff03255 1373 write_to_stderr(message, msglen);
3aed30dc 1374 my_failure_exit();
599cee73
PM		 1375 }
1376 else {
d13b0d77 1377 Perl_vwarn(aTHX_ pat, args);
599cee73
PM		 1378 }
1379}
1380
f54ba1c2
DM		 1381/* implements the ckWARN? macros */
1382
1383bool
1384Perl_ckwarn(pTHX_ U32 w)
1385{
1386 return
1387 (
1388 isLEXWARN_on
1389 && PL_curcop->cop_warnings != pWARN_NONE
1390 && (
1391 PL_curcop->cop_warnings == pWARN_ALL
1392 || isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1393 || (unpackWARN2(w) &&
1394 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1395 || (unpackWARN3(w) &&
1396 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1397 || (unpackWARN4(w) &&
1398 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1399 )
1400 )
1401 ||
1402 (
1403 isLEXWARN_off && PL_dowarn & G_WARN_ON
1404 )
1405 ;
1406}
1407
1408/* implements the ckWARN?_d macro */
1409
1410bool
1411Perl_ckwarn_d(pTHX_ U32 w)
1412{
1413 return
1414 isLEXWARN_off
1415 || PL_curcop->cop_warnings == pWARN_ALL
1416 || (
1417 PL_curcop->cop_warnings != pWARN_NONE
1418 && (
1419 isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))
1420 || (unpackWARN2(w) &&
1421 isWARN_on(PL_curcop->cop_warnings, unpackWARN2(w)))
1422 || (unpackWARN3(w) &&
1423 isWARN_on(PL_curcop->cop_warnings, unpackWARN3(w)))
1424 || (unpackWARN4(w) &&
1425 isWARN_on(PL_curcop->cop_warnings, unpackWARN4(w)))
1426 )
1427 )
1428 ;
1429}
1430
1431
1432
e6587932
DM		 1433/* since we've already done strlen() for both nam and val
1434 * we can use that info to make things faster than
1435 * sprintf(s, "%s=%s", nam, val)
1436 */
1437#define my_setenv_format(s, nam, nlen, val, vlen) \
1438 Copy(nam, s, nlen, char); \
1439 *(s+nlen) = '='; \
1440 Copy(val, s+(nlen+1), vlen, char); \
1441 *(s+(nlen+1+vlen)) = '\0'
1442
13b6e58c 1443#ifdef USE_ENVIRON_ARRAY
eccd403f 1444 /* VMS' my_setenv() is in vms.c */
2986a63f 1445#if !defined(WIN32) && !defined(NETWARE)
8d063cd8 1446void
e1ec3a88 1447Perl_my_setenv(pTHX_ const char *nam, const char *val)
8d063cd8 1448{
27da23d5 1449 dVAR;
4efc5df6
GS		 1450#ifdef USE_ITHREADS
1451 /* only parent thread can modify process environment */
1452 if (PL_curinterp == aTHX)
1453#endif
1454 {
f2517201 1455#ifndef PERL_USE_SAFE_PUTENV
50acdf95 1456 if (!PL_use_safe_putenv) {
f2517201 1457 /* most putenv()s leak, so we manipulate environ directly */
79072805 1458 register I32 i=setenv_getix(nam); /* where does it go? */
e6587932 1459 int nlen, vlen;
8d063cd8 1460
3280af22 1461 if (environ == PL_origenviron) { /* need we copy environment? */
79072805
LW		 1462 I32 j;
1463 I32 max;
fe14fcc3
LW		 1464 char **tmpenv;
1465
1466 for (max = i; environ[max]; max++) ;
f2517201
GS		 1467 tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*));
1468 for (j=0; j<max; j++) { /* copy environment */
e1ec3a88 1469 const int len = strlen(environ[j]);
3aed30dc
HS		 1470 tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char));
1471 Copy(environ[j], tmpenv[j], len+1, char);
f2517201 1472 }
fe14fcc3
LW		 1473 tmpenv[max] = Nullch;
1474 environ = tmpenv; /* tell exec where it is now */
1475 }
a687059c 1476 if (!val) {
f2517201 1477 safesysfree(environ[i]);
a687059c
LW		 1478 while (environ[i]) {
1479 environ[i] = environ[i+1];
1480 i++;
1481 }
1482 return;
1483 }
8d063cd8 1484 if (!environ[i]) { /* does not exist yet */
f2517201 1485 environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*));
8d063cd8
LW		 1486 environ[i+1] = Nullch; /* make sure it's null terminated */
1487 }
fe14fcc3 1488 else
f2517201 1489 safesysfree(environ[i]);
e6587932
DM		 1490 nlen = strlen(nam);
1491 vlen = strlen(val);
f2517201 1492
e6587932
DM		 1493 environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char));
1494 /* all that work just for this */
1495 my_setenv_format(environ[i], nam, nlen, val, vlen);
50acdf95
MS		 1496 } else {
1497# endif
a0fd4948 1498# if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__)
88f5bc07
AB		 1499# if defined(HAS_UNSETENV)
1500 if (val == NULL) {
1501 (void)unsetenv(nam);
1502 } else {
1503 (void)setenv(nam, val, 1);
1504 }
1505# else /* ! HAS_UNSETENV */
1506 (void)setenv(nam, val, 1);
1507# endif /* HAS_UNSETENV */
47dafe4d 1508# else
88f5bc07
AB		 1509# if defined(HAS_UNSETENV)
1510 if (val == NULL) {
1511 (void)unsetenv(nam);
1512 } else {
1513 int nlen = strlen(nam);
1514 int vlen = strlen(val);
1515 char *new_env =
1516 (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1517 my_setenv_format(new_env, nam, nlen, val, vlen);
1518 (void)putenv(new_env);
1519 }
1520# else /* ! HAS_UNSETENV */
1521 char *new_env;
1522 int nlen = strlen(nam), vlen;
1523 if (!val) {
1524 val = "";
1525 }
1526 vlen = strlen(val);
1527 new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char));
1528 /* all that work just for this */
1529 my_setenv_format(new_env, nam, nlen, val, vlen);
1530 (void)putenv(new_env);
1531# endif /* HAS_UNSETENV */
47dafe4d 1532# endif /* __CYGWIN__ */
50acdf95
MS		 1533#ifndef PERL_USE_SAFE_PUTENV
1534 }
1535#endif
4efc5df6 1536 }
8d063cd8
LW		 1537}
1538
2986a63f 1539#else /* WIN32 || NETWARE */
68dc0745 1540
1541void
72229eff 1542Perl_my_setenv(pTHX_ const char *nam, const char *val)
68dc0745 1543{
27da23d5 1544 dVAR;
ac5c734f 1545 register char *envstr;
e1ec3a88
AL		 1546 const int nlen = strlen(nam);
1547 int vlen;
e6587932 1548
ac5c734f
GS		 1549 if (!val) {
1550 val = "";
1551 }
e6587932 1552 vlen = strlen(val);
a02a5408 1553 Newx(envstr, nlen+vlen+2, char);
e6587932 1554 my_setenv_format(envstr, nam, nlen, val, vlen);
ac5c734f
GS		 1555 (void)PerlEnv_putenv(envstr);
1556 Safefree(envstr);
3e3baf6d
TB		 1557}
1558
2986a63f 1559#endif /* WIN32 || NETWARE */
3e3baf6d 1560
2f42fcb0 1561#ifndef PERL_MICRO
3e3baf6d 1562I32
e1ec3a88 1563Perl_setenv_getix(pTHX_ const char *nam)
3e3baf6d 1564{
53c1dcc0 1565 register I32 i;
0d46e09a 1566 register const I32 len = strlen(nam);
3e3baf6d
TB		 1567
1568 for (i = 0; environ[i]; i++) {
1569 if (
1570#ifdef WIN32
1571 strnicmp(environ[i],nam,len) == 0
1572#else
1573 strnEQ(environ[i],nam,len)
1574#endif
1575 && environ[i][len] == '=')
1576 break; /* strnEQ must come first to avoid */
1577 } /* potential SEGV's */
1578 return i;
68dc0745 1579}
2f42fcb0 1580#endif /* !PERL_MICRO */
68dc0745 1581
ed79a026 1582#endif /* !VMS && !EPOC*/
378cc40b 1583
16d20bd9 1584#ifdef UNLINK_ALL_VERSIONS
79072805 1585I32
6e732051 1586Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */
378cc40b 1587{
79072805 1588 I32 i;
378cc40b 1589
6ad3d225 1590 for (i = 0; PerlLIO_unlink(f) >= 0; i++) ;
378cc40b
LW		 1591 return i ? 0 : -1;
1592}
1593#endif
1594
7a3f2258 1595/* this is a drop-in replacement for bcopy() */
2253333f 1596#if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY))
378cc40b 1597char *
7a3f2258 1598Perl_my_bcopy(register const char *from,register char *to,register I32 len)
378cc40b 1599{
2d03de9c 1600 char * const retval = to;
378cc40b 1601
7c0587c8
LW		 1602 if (from - to >= 0) {
1603 while (len--)
1604 *to++ = *from++;
1605 }
1606 else {
1607 to += len;
1608 from += len;
1609 while (len--)
faf8582f 1610 *(--to) = *(--from);
7c0587c8 1611 }
378cc40b
LW		 1612 return retval;
1613}
ffed7fef 1614#endif
378cc40b 1615
7a3f2258 1616/* this is a drop-in replacement for memset() */
fc36a67e 1617#ifndef HAS_MEMSET
1618void *
7a3f2258 1619Perl_my_memset(register char *loc, register I32 ch, register I32 len)
fc36a67e 1620{
2d03de9c 1621 char * const retval = loc;
fc36a67e 1622
1623 while (len--)
1624 *loc++ = ch;
1625 return retval;
1626}
1627#endif
1628
7a3f2258 1629/* this is a drop-in replacement for bzero() */
7c0587c8 1630#if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
378cc40b 1631char *
7a3f2258 1632Perl_my_bzero(register char *loc, register I32 len)
378cc40b 1633{
2d03de9c 1634 char * const retval = loc;
378cc40b
LW		 1635
1636 while (len--)
1637 *loc++ = 0;
1638 return retval;
1639}
1640#endif
7c0587c8 1641
7a3f2258 1642/* this is a drop-in replacement for memcmp() */
36477c24 1643#if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP)
79072805 1644I32
7a3f2258 1645Perl_my_memcmp(const char *s1, const char *s2, register I32 len)
7c0587c8 1646{
e1ec3a88
AL		 1647 register const U8 *a = (const U8 *)s1;
1648 register const U8 *b = (const U8 *)s2;
79072805 1649 register I32 tmp;
7c0587c8
LW		 1650
1651 while (len--) {
27da23d5 1652 if ((tmp = *a++ - *b++))
7c0587c8
LW		 1653 return tmp;
1654 }
1655 return 0;
1656}
36477c24 1657#endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */
a687059c 1658
fe14fcc3 1659#ifndef HAS_VPRINTF
a687059c 1660
85e6fe83 1661#ifdef USE_CHAR_VSPRINTF
a687059c
LW		 1662char *
1663#else
1664int
1665#endif
08105a92 1666vsprintf(char *dest, const char *pat, char *args)
a687059c
LW		 1667{
1668 FILE fakebuf;
1669
1670 fakebuf._ptr = dest;
1671 fakebuf._cnt = 32767;
35c8bce7
LW		 1672#ifndef _IOSTRG
1673#define _IOSTRG 0
1674#endif
a687059c
LW		 1675 fakebuf._flag = _IOWRT|_IOSTRG;
1676 _doprnt(pat, args, &fakebuf); /* what a kludge */
1677 (void)putc('\0', &fakebuf);
85e6fe83 1678#ifdef USE_CHAR_VSPRINTF
a687059c
LW		 1679 return(dest);
1680#else
1681 return 0; /* perl doesn't use return value */
1682#endif
1683}
1684
fe14fcc3 1685#endif /* HAS_VPRINTF */
a687059c
LW		 1686
1687#ifdef MYSWAP
ffed7fef 1688#if BYTEORDER != 0x4321
a687059c 1689short
864dbfa3 1690Perl_my_swap(pTHX_ short s)
a687059c
LW		 1691{
1692#if (BYTEORDER & 1) == 0
1693 short result;
1694
1695 result = ((s & 255) << 8) + ((s >> 8) & 255);
1696 return result;
1697#else
1698 return s;
1699#endif
1700}
1701
1702long
864dbfa3 1703Perl_my_htonl(pTHX_ long l)
a687059c
LW		 1704{
1705 union {
1706 long result;
ffed7fef 1707 char c[sizeof(long)];
a687059c
LW		 1708 } u;
1709
ffed7fef 1710#if BYTEORDER == 0x1234
a687059c
LW		 1711 u.c[0] = (l >> 24) & 255;
1712 u.c[1] = (l >> 16) & 255;
1713 u.c[2] = (l >> 8) & 255;
1714 u.c[3] = l & 255;
1715 return u.result;
1716#else
ffed7fef 1717#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 1718 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 1719#else
79072805
LW		 1720 register I32 o;
1721 register I32 s;
a687059c 1722
ffed7fef
LW		 1723 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1724 u.c[o & 0xf] = (l >> s) & 255;
a687059c
LW		 1725 }
1726 return u.result;
1727#endif
1728#endif
1729}
1730
1731long
864dbfa3 1732Perl_my_ntohl(pTHX_ long l)
a687059c
LW		 1733{
1734 union {
1735 long l;
ffed7fef 1736 char c[sizeof(long)];
a687059c
LW		 1737 } u;
1738
ffed7fef 1739#if BYTEORDER == 0x1234
a687059c
LW		 1740 u.c[0] = (l >> 24) & 255;
1741 u.c[1] = (l >> 16) & 255;
1742 u.c[2] = (l >> 8) & 255;
1743 u.c[3] = l & 255;
1744 return u.l;
1745#else
ffed7fef 1746#if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
cea2e8a9 1747 Perl_croak(aTHX_ "Unknown BYTEORDER\n");
a687059c 1748#else
79072805
LW		 1749 register I32 o;
1750 register I32 s;
a687059c
LW		 1751
1752 u.l = l;
1753 l = 0;
ffed7fef
LW		 1754 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1755 l |= (u.c[o & 0xf] & 255) << s;
a687059c
LW		 1756 }
1757 return l;
1758#endif
1759#endif
1760}
1761
ffed7fef 1762#endif /* BYTEORDER != 0x4321 */
988174c1
LW		 1763#endif /* MYSWAP */
1764
1765/*
1766 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1767 * If these functions are defined,
1768 * the BYTEORDER is neither 0x1234 nor 0x4321.
1769 * However, this is not assumed.
1770 * -DWS
1771 */
1772
1109a392 1773#define HTOLE(name,type) \
988174c1 1774 type \
ba106d47 1775 name (register type n) \
988174c1
LW		 1776 { \
1777 union { \
1778 type value; \
1779 char c[sizeof(type)]; \
1780 } u; \
79072805 1781 register I32 i; \
1109a392
MHM		 1782 register I32 s = 0; \
1783 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
988174c1
LW		 1784 u.c[i] = (n >> s) & 0xFF; \
1785 } \
1786 return u.value; \
1787 }
1788
1109a392 1789#define LETOH(name,type) \
988174c1 1790 type \
ba106d47 1791 name (register type n) \
988174c1
LW		 1792 { \
1793 union { \
1794 type value; \
1795 char c[sizeof(type)]; \
1796 } u; \
79072805 1797 register I32 i; \
1109a392 1798 register I32 s = 0; \
988174c1
LW		 1799 u.value = n; \
1800 n = 0; \
1109a392
MHM		 1801 for (i = 0; i < sizeof(u.c); i++, s += 8) { \
1802 n |= ((type)(u.c[i] & 0xFF)) << s; \
988174c1
LW		 1803 } \
1804 return n; \
1805 }
1806
1109a392
MHM		 1807/*
1808 * Big-endian byte order functions.
1809 */
1810
1811#define HTOBE(name,type) \
1812 type \
1813 name (register type n) \
1814 { \
1815 union { \
1816 type value; \
1817 char c[sizeof(type)]; \
1818 } u; \
1819 register I32 i; \
1820 register I32 s = 8*(sizeof(u.c)-1); \
1821 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1822 u.c[i] = (n >> s) & 0xFF; \
1823 } \
1824 return u.value; \
1825 }
1826
1827#define BETOH(name,type) \
1828 type \
1829 name (register type n) \
1830 { \
1831 union { \
1832 type value; \
1833 char c[sizeof(type)]; \
1834 } u; \
1835 register I32 i; \
1836 register I32 s = 8*(sizeof(u.c)-1); \
1837 u.value = n; \
1838 n = 0; \
1839 for (i = 0; i < sizeof(u.c); i++, s -= 8) { \
1840 n |= ((type)(u.c[i] & 0xFF)) << s; \
1841 } \
1842 return n; \
1843 }
1844
1845/*
1846 * If we just can't do it...
1847 */
1848
1849#define NOT_AVAIL(name,type) \
1850 type \
1851 name (register type n) \
1852 { \
1853 Perl_croak_nocontext(#name "() not available"); \
1854 return n; /* not reached */ \
1855 }
1856
1857
988174c1 1858#if defined(HAS_HTOVS) && !defined(htovs)
1109a392 1859HTOLE(htovs,short)
988174c1
LW		 1860#endif
1861#if defined(HAS_HTOVL) && !defined(htovl)
1109a392 1862HTOLE(htovl,long)
988174c1
LW		 1863#endif
1864#if defined(HAS_VTOHS) && !defined(vtohs)
1109a392 1865LETOH(vtohs,short)
988174c1
LW		 1866#endif
1867#if defined(HAS_VTOHL) && !defined(vtohl)
1109a392
MHM		 1868LETOH(vtohl,long)
1869#endif
1870
1871#ifdef PERL_NEED_MY_HTOLE16
1872# if U16SIZE == 2
1873HTOLE(Perl_my_htole16,U16)
1874# else
1875NOT_AVAIL(Perl_my_htole16,U16)
1876# endif
1877#endif
1878#ifdef PERL_NEED_MY_LETOH16
1879# if U16SIZE == 2
1880LETOH(Perl_my_letoh16,U16)
1881# else
1882NOT_AVAIL(Perl_my_letoh16,U16)
1883# endif
1884#endif
1885#ifdef PERL_NEED_MY_HTOBE16
1886# if U16SIZE == 2
1887HTOBE(Perl_my_htobe16,U16)
1888# else
1889NOT_AVAIL(Perl_my_htobe16,U16)
1890# endif
1891#endif
1892#ifdef PERL_NEED_MY_BETOH16
1893# if U16SIZE == 2
1894BETOH(Perl_my_betoh16,U16)
1895# else
1896NOT_AVAIL(Perl_my_betoh16,U16)
1897# endif
1898#endif
1899
1900#ifdef PERL_NEED_MY_HTOLE32
1901# if U32SIZE == 4
1902HTOLE(Perl_my_htole32,U32)
1903# else
1904NOT_AVAIL(Perl_my_htole32,U32)
1905# endif
1906#endif
1907#ifdef PERL_NEED_MY_LETOH32
1908# if U32SIZE == 4
1909LETOH(Perl_my_letoh32,U32)
1910# else
1911NOT_AVAIL(Perl_my_letoh32,U32)
1912# endif
1913#endif
1914#ifdef PERL_NEED_MY_HTOBE32
1915# if U32SIZE == 4
1916HTOBE(Perl_my_htobe32,U32)
1917# else
1918NOT_AVAIL(Perl_my_htobe32,U32)
1919# endif
1920#endif
1921#ifdef PERL_NEED_MY_BETOH32
1922# if U32SIZE == 4
1923BETOH(Perl_my_betoh32,U32)
1924# else
1925NOT_AVAIL(Perl_my_betoh32,U32)
1926# endif
1927#endif
1928
1929#ifdef PERL_NEED_MY_HTOLE64
1930# if U64SIZE == 8
1931HTOLE(Perl_my_htole64,U64)
1932# else
1933NOT_AVAIL(Perl_my_htole64,U64)
1934# endif
1935#endif
1936#ifdef PERL_NEED_MY_LETOH64
1937# if U64SIZE == 8
1938LETOH(Perl_my_letoh64,U64)
1939# else
1940NOT_AVAIL(Perl_my_letoh64,U64)
1941# endif
1942#endif
1943#ifdef PERL_NEED_MY_HTOBE64
1944# if U64SIZE == 8
1945HTOBE(Perl_my_htobe64,U64)
1946# else
1947NOT_AVAIL(Perl_my_htobe64,U64)
1948# endif
1949#endif
1950#ifdef PERL_NEED_MY_BETOH64
1951# if U64SIZE == 8
1952BETOH(Perl_my_betoh64,U64)
1953# else
1954NOT_AVAIL(Perl_my_betoh64,U64)
1955# endif
988174c1 1956#endif
a687059c 1957
1109a392
MHM		 1958#ifdef PERL_NEED_MY_HTOLES
1959HTOLE(Perl_my_htoles,short)
1960#endif
1961#ifdef PERL_NEED_MY_LETOHS
1962LETOH(Perl_my_letohs,short)
1963#endif
1964#ifdef PERL_NEED_MY_HTOBES
1965HTOBE(Perl_my_htobes,short)
1966#endif
1967#ifdef PERL_NEED_MY_BETOHS
1968BETOH(Perl_my_betohs,short)
1969#endif
1970
1971#ifdef PERL_NEED_MY_HTOLEI
1972HTOLE(Perl_my_htolei,int)
1973#endif
1974#ifdef PERL_NEED_MY_LETOHI
1975LETOH(Perl_my_letohi,int)
1976#endif
1977#ifdef PERL_NEED_MY_HTOBEI
1978HTOBE(Perl_my_htobei,int)
1979#endif
1980#ifdef PERL_NEED_MY_BETOHI
1981BETOH(Perl_my_betohi,int)
1982#endif
1983
1984#ifdef PERL_NEED_MY_HTOLEL
1985HTOLE(Perl_my_htolel,long)
1986#endif
1987#ifdef PERL_NEED_MY_LETOHL
1988LETOH(Perl_my_letohl,long)
1989#endif
1990#ifdef PERL_NEED_MY_HTOBEL
1991HTOBE(Perl_my_htobel,long)
1992#endif
1993#ifdef PERL_NEED_MY_BETOHL
1994BETOH(Perl_my_betohl,long)
1995#endif
1996
1997void
1998Perl_my_swabn(void *ptr, int n)
1999{
2000 register char *s = (char *)ptr;
2001 register char *e = s + (n-1);
2002 register char tc;
2003
2004 for (n /= 2; n > 0; s++, e--, n--) {
2005 tc = *s;
2006 *s = *e;
2007 *e = tc;
2008 }
2009}
2010
4a7d1889
NIS		 2011PerlIO *
2012Perl_my_popen_list(pTHX_ char *mode, int n, SV **args)
2013{
2986a63f 2014#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL) && !defined(NETWARE)
1f852d0d
NIS		 2015 int p[2];
2016 register I32 This, that;
2017 register Pid_t pid;
2018 SV *sv;
2019 I32 did_pipes = 0;
2020 int pp[2];
2021
2022 PERL_FLUSHALL_FOR_CHILD;
2023 This = (*mode == 'w');
2024 that = !This;
2025 if (PL_tainting) {
2026 taint_env();
2027 taint_proper("Insecure %s%s", "EXEC");
2028 }
2029 if (PerlProc_pipe(p) < 0)
2030 return Nullfp;
2031 /* Try for another pipe pair for error return */
2032 if (PerlProc_pipe(pp) >= 0)
2033 did_pipes = 1;
52e18b1f 2034 while ((pid = PerlProc_fork()) < 0) {
1f852d0d
NIS		 2035 if (errno != EAGAIN) {
2036 PerlLIO_close(p[This]);
4e6dfe71 2037 PerlLIO_close(p[that]);
1f852d0d
NIS		 2038 if (did_pipes) {
2039 PerlLIO_close(pp[0]);
2040 PerlLIO_close(pp[1]);
2041 }
2042 return Nullfp;
2043 }
2044 sleep(5);
2045 }
2046 if (pid == 0) {
2047 /* Child */
1f852d0d
NIS		 2048#undef THIS
2049#undef THAT
2050#define THIS that
2051#define THAT This
1f852d0d
NIS		 2052 /* Close parent's end of error status pipe (if any) */
2053 if (did_pipes) {
2054 PerlLIO_close(pp[0]);
2055#if defined(HAS_FCNTL) && defined(F_SETFD)
2056 /* Close error pipe automatically if exec works */
2057 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2058#endif
2059 }
2060 /* Now dup our end of _the_ pipe to right position */
2061 if (p[THIS] != (*mode == 'r')) {
2062 PerlLIO_dup2(p[THIS], *mode == 'r');
2063 PerlLIO_close(p[THIS]);
4e6dfe71
GS		 2064 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2065 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1f852d0d 2066 }
4e6dfe71
GS		 2067 else
2068 PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */
1f852d0d
NIS		 2069#if !defined(HAS_FCNTL) || !defined(F_SETFD)
2070 /* No automatic close - do it by hand */
b7953727
JH		 2071# ifndef NOFILE
2072# define NOFILE 20
2073# endif
a080fe3d
NIS		 2074 {
2075 int fd;
2076
2077 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) {
3aed30dc 2078 if (fd != pp[1])
a080fe3d
NIS		 2079 PerlLIO_close(fd);
2080 }
1f852d0d
NIS		 2081 }
2082#endif
2083 do_aexec5(Nullsv, args-1, args-1+n, pp[1], did_pipes);
2084 PerlProc__exit(1);
2085#undef THIS
2086#undef THAT
2087 }
2088 /* Parent */
52e18b1f 2089 do_execfree(); /* free any memory malloced by child on fork */
1f852d0d
NIS		 2090 if (did_pipes)
2091 PerlLIO_close(pp[1]);
2092 /* Keep the lower of the two fd numbers */
2093 if (p[that] < p[This]) {
2094 PerlLIO_dup2(p[This], p[that]);
2095 PerlLIO_close(p[This]);
2096 p[This] = p[that];
2097 }
4e6dfe71
GS		 2098 else
2099 PerlLIO_close(p[that]); /* close child's end of pipe */
2100
1f852d0d
NIS		 2101 LOCK_FDPID_MUTEX;
2102 sv = *av_fetch(PL_fdpid,p[This],TRUE);
2103 UNLOCK_FDPID_MUTEX;
862a34c6 2104 SvUPGRADE(sv,SVt_IV);
45977657 2105 SvIV_set(sv, pid);
1f852d0d
NIS		 2106 PL_forkprocess = pid;
2107 /* If we managed to get status pipe check for exec fail */
2108 if (did_pipes && pid > 0) {
2109 int errkid;
2110 int n = 0, n1;
2111
2112 while (n < sizeof(int)) {
2113 n1 = PerlLIO_read(pp[0],
2114 (void*)(((char*)&errkid)+n),
2115 (sizeof(int)) - n);
2116 if (n1 <= 0)
2117 break;
2118 n += n1;
2119 }
2120 PerlLIO_close(pp[0]);
2121 did_pipes = 0;
2122 if (n) { /* Error */
2123 int pid2, status;
8c51524e 2124 PerlLIO_close(p[This]);
1f852d0d
NIS		 2125 if (n != sizeof(int))
2126 Perl_croak(aTHX_ "panic: kid popen errno read");
2127 do {
2128 pid2 = wait4pid(pid, &status, 0);
2129 } while (pid2 == -1 && errno == EINTR);
2130 errno = errkid; /* Propagate errno from kid */
2131 return Nullfp;
2132 }
2133 }
2134 if (did_pipes)
2135 PerlLIO_close(pp[0]);
2136 return PerlIO_fdopen(p[This], mode);
2137#else
4a7d1889
NIS		 2138 Perl_croak(aTHX_ "List form of piped open not implemented");
2139 return (PerlIO *) NULL;
1f852d0d 2140#endif
4a7d1889
NIS		 2141}
2142
5f05dabc 2143 /* VMS' my_popen() is in VMS.c, same with OS/2. */
cd39f2b6 2144#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
760ac839 2145PerlIO *
3dd43144 2146Perl_my_popen(pTHX_ const char *cmd, const char *mode)
a687059c
LW		 2147{
2148 int p[2];
8ac85365 2149 register I32 This, that;
d8a83dd3 2150 register Pid_t pid;
79072805 2151 SV *sv;
bfce84ec 2152 const I32 doexec = !(*cmd == '-' && cmd[1] == '\0');
e446cec8
IZ		 2153 I32 did_pipes = 0;
2154 int pp[2];
a687059c 2155
45bc9206 2156 PERL_FLUSHALL_FOR_CHILD;
ddcf38b7
IZ		 2157#ifdef OS2
2158 if (doexec) {
23da6c43 2159 return my_syspopen(aTHX_ cmd,mode);
ddcf38b7 2160 }
a1d180c4 2161#endif
8ac85365
NIS		 2162 This = (*mode == 'w');
2163 that = !This;
3280af22 2164 if (doexec && PL_tainting) {
bbce6d69 2165 taint_env();
2166 taint_proper("Insecure %s%s", "EXEC");
d48672a2 2167 }
c2267164
IZ		 2168 if (PerlProc_pipe(p) < 0)
2169 return Nullfp;
e446cec8
IZ		 2170 if (doexec && PerlProc_pipe(pp) >= 0)
2171 did_pipes = 1;
52e18b1f 2172 while ((pid = PerlProc_fork()) < 0) {
a687059c 2173 if (errno != EAGAIN) {
6ad3d225 2174 PerlLIO_close(p[This]);
b5ac89c3 2175 PerlLIO_close(p[that]);
e446cec8
IZ		 2176 if (did_pipes) {
2177 PerlLIO_close(pp[0]);
2178 PerlLIO_close(pp[1]);
2179 }
a687059c 2180 if (!doexec)
cea2e8a9 2181 Perl_croak(aTHX_ "Can't fork");
a687059c
LW		 2182 return Nullfp;
2183 }
2184 sleep(5);
2185 }
2186 if (pid == 0) {
79072805
LW		 2187 GV* tmpgv;
2188
30ac6d9b
GS		 2189#undef THIS
2190#undef THAT
a687059c 2191#define THIS that
8ac85365 2192#define THAT This
e446cec8
IZ		 2193 if (did_pipes) {
2194 PerlLIO_close(pp[0]);
2195#if defined(HAS_FCNTL) && defined(F_SETFD)
2196 fcntl(pp[1], F_SETFD, FD_CLOEXEC);
2197#endif
2198 }
a687059c 2199 if (p[THIS] != (*mode == 'r')) {
6ad3d225
GS		 2200 PerlLIO_dup2(p[THIS], *mode == 'r');
2201 PerlLIO_close(p[THIS]);
b5ac89c3
NIS		 2202 if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */
2203 PerlLIO_close(p[THAT]);
a687059c 2204 }
b5ac89c3
NIS		 2205 else
2206 PerlLIO_close(p[THAT]);
4435c477 2207#ifndef OS2
a687059c 2208 if (doexec) {
a0d0e21e 2209#if !defined(HAS_FCNTL) || !defined(F_SETFD)
ae986130
LW		 2210#ifndef NOFILE
2211#define NOFILE 20
2212#endif
a080fe3d 2213 {
3aed30dc 2214 int fd;
a080fe3d
NIS		 2215
2216 for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++)
2217 if (fd != pp[1])
3aed30dc 2218 PerlLIO_close(fd);
a080fe3d 2219 }
ae986130 2220#endif
a080fe3d
NIS		 2221 /* may or may not use the shell */
2222 do_exec3(cmd, pp[1], did_pipes);
6ad3d225 2223 PerlProc__exit(1);
a687059c 2224 }
4435c477 2225#endif /* defined OS2 */
306196c3 2226 if ((tmpgv = gv_fetchpv("$",TRUE, SVt_PV))) {
4d76a344 2227 SvREADONLY_off(GvSV(tmpgv));
7766f137 2228 sv_setiv(GvSV(tmpgv), PerlProc_getpid());
4d76a344
RGS		 2229 SvREADONLY_on(GvSV(tmpgv));
2230 }
2231#ifdef THREADS_HAVE_PIDS
2232 PL_ppid = (IV)getppid();
2233#endif
3280af22
NIS		 2234 PL_forkprocess = 0;
2235 hv_clear(PL_pidstatus); /* we have no children */
a687059c
LW		 2236 return Nullfp;
2237#undef THIS
2238#undef THAT
2239 }
b5ac89c3 2240 do_execfree(); /* free any memory malloced by child on vfork */
e446cec8
IZ		 2241 if (did_pipes)
2242 PerlLIO_close(pp[1]);
8ac85365 2243 if (p[that] < p[This]) {
6ad3d225
GS		 2244 PerlLIO_dup2(p[This], p[that]);
2245 PerlLIO_close(p[This]);
8ac85365 2246 p[This] = p[that];
62b28dd9 2247 }
b5ac89c3
NIS		 2248 else
2249 PerlLIO_close(p[that]);
2250
4755096e 2251 LOCK_FDPID_MUTEX;
3280af22 2252 sv = *av_fetch(PL_fdpid,p[This],TRUE);
4755096e 2253 UNLOCK_FDPID_MUTEX;
862a34c6 2254 SvUPGRADE(sv,SVt_IV);
45977657 2255 SvIV_set(sv, pid);
3280af22 2256 PL_forkprocess = pid;
e446cec8
IZ		 2257 if (did_pipes && pid > 0) {
2258 int errkid;
2259 int n = 0, n1;
2260
2261 while (n < sizeof(int)) {
2262 n1 = PerlLIO_read(pp[0],
2263 (void*)(((char*)&errkid)+n),
2264 (sizeof(int)) - n);
2265 if (n1 <= 0)
2266 break;
2267 n += n1;
2268 }
2f96c702
IZ		 2269 PerlLIO_close(pp[0]);
2270 did_pipes = 0;
e446cec8 2271 if (n) { /* Error */
faa466a7 2272 int pid2, status;
8c51524e 2273 PerlLIO_close(p[This]);
e446cec8 2274 if (n != sizeof(int))
cea2e8a9 2275 Perl_croak(aTHX_ "panic: kid popen errno read");
faa466a7
RG		 2276 do {
2277 pid2 = wait4pid(pid, &status, 0);
2278 } while (pid2 == -1 && errno == EINTR);
e446cec8
IZ		 2279 errno = errkid; /* Propagate errno from kid */
2280 return Nullfp;
2281 }
2282 }
2283 if (did_pipes)
2284 PerlLIO_close(pp[0]);
8ac85365 2285 return PerlIO_fdopen(p[This], mode);
a687059c 2286}
7c0587c8 2287#else
85ca448a 2288#if defined(atarist) || defined(EPOC)
7c0587c8 2289FILE *popen();
760ac839 2290PerlIO *
864dbfa3 2291Perl_my_popen(pTHX_ char *cmd, char *mode)
7c0587c8 2292{
45bc9206 2293 PERL_FLUSHALL_FOR_CHILD;
a1d180c4
NIS		 2294 /* Call system's popen() to get a FILE *, then import it.
2295 used 0 for 2nd parameter to PerlIO_importFILE;
2296 apparently not used
2297 */
2298 return PerlIO_importFILE(popen(cmd, mode), 0);
7c0587c8 2299}
2b96b0a5
JH		 2300#else
2301#if defined(DJGPP)
2302FILE *djgpp_popen();
2303PerlIO *
2304Perl_my_popen(pTHX_ char *cmd, char *mode)
2305{
2306 PERL_FLUSHALL_FOR_CHILD;
2307 /* Call system's popen() to get a FILE *, then import it.
2308 used 0 for 2nd parameter to PerlIO_importFILE;
2309 apparently not used
2310 */
2311 return PerlIO_importFILE(djgpp_popen(cmd, mode), 0);
2312}
2313#endif
7c0587c8
LW		 2314#endif
2315
2316#endif /* !DOSISH */
a687059c 2317
52e18b1f
GS		 2318/* this is called in parent before the fork() */
2319void
2320Perl_atfork_lock(void)
2321{
27da23d5 2322 dVAR;
3db8f154 2323#if defined(USE_ITHREADS)
52e18b1f
GS		 2324 /* locks must be held in locking order (if any) */
2325# ifdef MYMALLOC
2326 MUTEX_LOCK(&PL_malloc_mutex);
2327# endif
2328 OP_REFCNT_LOCK;
2329#endif
2330}
2331
2332/* this is called in both parent and child after the fork() */
2333void
2334Perl_atfork_unlock(void)
2335{
27da23d5 2336 dVAR;
3db8f154 2337#if defined(USE_ITHREADS)
52e18b1f
GS		 2338 /* locks must be released in same order as in atfork_lock() */
2339# ifdef MYMALLOC
2340 MUTEX_UNLOCK(&PL_malloc_mutex);
2341# endif
2342 OP_REFCNT_UNLOCK;
2343#endif
2344}
2345
2346Pid_t
2347Perl_my_fork(void)
2348{
2349#if defined(HAS_FORK)
2350 Pid_t pid;
3db8f154 2351#if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK)
52e18b1f
GS		 2352 atfork_lock();
2353 pid = fork();
2354 atfork_unlock();
2355#else
2356 /* atfork_lock() and atfork_unlock() are installed as pthread_atfork()
2357 * handlers elsewhere in the code */
2358 pid = fork();
2359#endif
2360 return pid;
2361#else
2362 /* this "canna happen" since nothing should be calling here if !HAS_FORK */
2363 Perl_croak_nocontext("fork() not available");
b961a566 2364 return 0;
52e18b1f
GS		 2365#endif /* HAS_FORK */
2366}
2367
748a9306 2368#ifdef DUMP_FDS
35ff7856 2369void
864dbfa3 2370Perl_dump_fds(pTHX_ char *s)
ae986130
LW		 2371{
2372 int fd;
c623ac67 2373 Stat_t tmpstatbuf;
ae986130 2374
bf49b057 2375 PerlIO_printf(Perl_debug_log,"%s", s);
ae986130 2376 for (fd = 0; fd < 32; fd++) {
6ad3d225 2377 if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0)
bf49b057 2378 PerlIO_printf(Perl_debug_log," %d",fd);
ae986130 2379 }
bf49b057 2380 PerlIO_printf(Perl_debug_log,"\n");
27da23d5 2381 return;
ae986130 2382}
35ff7856 2383#endif /* DUMP_FDS */
ae986130 2384
fe14fcc3 2385#ifndef HAS_DUP2
fec02dd3 2386int
ba106d47 2387dup2(int oldfd, int newfd)
a687059c 2388{
a0d0e21e 2389#if defined(HAS_FCNTL) && defined(F_DUPFD)
fec02dd3
AD		 2390 if (oldfd == newfd)
2391 return oldfd;
6ad3d225 2392 PerlLIO_close(newfd);
fec02dd3 2393 return fcntl(oldfd, F_DUPFD, newfd);
62b28dd9 2394#else
fc36a67e 2395#define DUP2_MAX_FDS 256
2396 int fdtmp[DUP2_MAX_FDS];
79072805 2397 I32 fdx = 0;
ae986130
LW		 2398 int fd;
2399
fe14fcc3 2400 if (oldfd == newfd)
fec02dd3 2401 return oldfd;
6ad3d225 2402 PerlLIO_close(newfd);
fc36a67e 2403 /* good enough for low fd's... */
6ad3d225 2404 while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) {
fc36a67e 2405 if (fdx >= DUP2_MAX_FDS) {
6ad3d225 2406 PerlLIO_close(fd);
fc36a67e 2407 fd = -1;
2408 break;
2409 }
ae986130 2410 fdtmp[fdx++] = fd;
fc36a67e 2411 }
ae986130 2412 while (fdx > 0)
6ad3d225 2413 PerlLIO_close(fdtmp[--fdx]);
fec02dd3 2414 return fd;
62b28dd9 2415#endif
a687059c
LW		 2416}
2417#endif
2418
64ca3a65 2419#ifndef PERL_MICRO
ff68c719 2420#ifdef HAS_SIGACTION
2421
abea2c45
HS		 2422#ifdef MACOS_TRADITIONAL
2423/* We don't want restart behavior on MacOS */
2424#undef SA_RESTART
2425#endif
2426
ff68c719 2427Sighandler_t
864dbfa3 2428Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2429{
27da23d5 2430 dVAR;
ff68c719 2431 struct sigaction act, oact;
2432
a10b1e10
JH		 2433#ifdef USE_ITHREADS
2434 /* only "parent" interpreter can diddle signals */
2435 if (PL_curinterp != aTHX)
8aad04aa 2436 return (Sighandler_t) SIG_ERR;
a10b1e10
JH		 2437#endif
2438
8aad04aa 2439 act.sa_handler = (void(*)(int))handler;
ff68c719 2440 sigemptyset(&act.sa_mask);
2441 act.sa_flags = 0;
2442#ifdef SA_RESTART
4ffa73a3
JH		 2443 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2444 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
0a8e0eff 2445#endif
358837b8 2446#if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
8aad04aa 2447 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
85264bed
CS		 2448 act.sa_flags |= SA_NOCLDWAIT;
2449#endif
ff68c719 2450 if (sigaction(signo, &act, &oact) == -1)
8aad04aa 2451 return (Sighandler_t) SIG_ERR;
ff68c719 2452 else
8aad04aa 2453 return (Sighandler_t) oact.sa_handler;
ff68c719 2454}
2455
2456Sighandler_t
864dbfa3 2457Perl_rsignal_state(pTHX_ int signo)
ff68c719 2458{
2459 struct sigaction oact;
2460
2461 if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1)
8aad04aa 2462 return (Sighandler_t) SIG_ERR;
ff68c719 2463 else
8aad04aa 2464 return (Sighandler_t) oact.sa_handler;
ff68c719 2465}
2466
2467int
864dbfa3 2468Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2469{
27da23d5 2470 dVAR;
ff68c719 2471 struct sigaction act;
2472
a10b1e10
JH		 2473#ifdef USE_ITHREADS
2474 /* only "parent" interpreter can diddle signals */
2475 if (PL_curinterp != aTHX)
2476 return -1;
2477#endif
2478
8aad04aa 2479 act.sa_handler = (void(*)(int))handler;
ff68c719 2480 sigemptyset(&act.sa_mask);
2481 act.sa_flags = 0;
2482#ifdef SA_RESTART
4ffa73a3
JH		 2483 if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG)
2484 act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */
0a8e0eff 2485#endif
36b5d377 2486#if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */
8aad04aa 2487 if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN)
85264bed
CS		 2488 act.sa_flags |= SA_NOCLDWAIT;
2489#endif
ff68c719 2490 return sigaction(signo, &act, save);
2491}
2492
2493int
864dbfa3 2494Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2495{
27da23d5 2496 dVAR;
a10b1e10
JH		 2497#ifdef USE_ITHREADS
2498 /* only "parent" interpreter can diddle signals */
2499 if (PL_curinterp != aTHX)
2500 return -1;
2501#endif
2502
ff68c719 2503 return sigaction(signo, save, (struct sigaction *)NULL);
2504}
2505
2506#else /* !HAS_SIGACTION */
2507
2508Sighandler_t
864dbfa3 2509Perl_rsignal(pTHX_ int signo, Sighandler_t handler)
ff68c719 2510{
39f1703b 2511#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH		 2512 /* only "parent" interpreter can diddle signals */
2513 if (PL_curinterp != aTHX)
8aad04aa 2514 return (Sighandler_t) SIG_ERR;
a10b1e10
JH		 2515#endif
2516
6ad3d225 2517 return PerlProc_signal(signo, handler);
ff68c719 2518}
2519
ff68c719 2520static
2521Signal_t
4e35701f 2522sig_trap(int signo)
ff68c719 2523{
27da23d5
JH		 2524 dVAR;
2525 PL_sig_trapped++;
ff68c719 2526}
2527
2528Sighandler_t
864dbfa3 2529Perl_rsignal_state(pTHX_ int signo)
ff68c719 2530{
27da23d5 2531 dVAR;
ff68c719 2532 Sighandler_t oldsig;
2533
39f1703b 2534#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH		 2535 /* only "parent" interpreter can diddle signals */
2536 if (PL_curinterp != aTHX)
8aad04aa 2537 return (Sighandler_t) SIG_ERR;
a10b1e10
JH		 2538#endif
2539
27da23d5 2540 PL_sig_trapped = 0;
6ad3d225
GS		 2541 oldsig = PerlProc_signal(signo, sig_trap);
2542 PerlProc_signal(signo, oldsig);
27da23d5 2543 if (PL_sig_trapped)
3aed30dc 2544 PerlProc_kill(PerlProc_getpid(), signo);
ff68c719 2545 return oldsig;
2546}
2547
2548int
864dbfa3 2549Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save)
ff68c719 2550{
39f1703b 2551#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH		 2552 /* only "parent" interpreter can diddle signals */
2553 if (PL_curinterp != aTHX)
2554 return -1;
2555#endif
6ad3d225 2556 *save = PerlProc_signal(signo, handler);
8aad04aa 2557 return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0;
ff68c719 2558}
2559
2560int
864dbfa3 2561Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save)
ff68c719 2562{
39f1703b 2563#if defined(USE_ITHREADS) && !defined(WIN32)
a10b1e10
JH		 2564 /* only "parent" interpreter can diddle signals */
2565 if (PL_curinterp != aTHX)
2566 return -1;
2567#endif
8aad04aa 2568 return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0;
ff68c719 2569}
2570
2571#endif /* !HAS_SIGACTION */
64ca3a65 2572#endif /* !PERL_MICRO */
ff68c719 2573
5f05dabc 2574 /* VMS' my_pclose() is in VMS.c; same with OS/2 */
cd39f2b6 2575#if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(MACOS_TRADITIONAL)
79072805 2576I32
864dbfa3 2577Perl_my_pclose(pTHX_ PerlIO *ptr)
a687059c 2578{
ff68c719 2579 Sigsave_t hstat, istat, qstat;
a687059c 2580 int status;
a0d0e21e 2581 SV **svp;
d8a83dd3
JH		 2582 Pid_t pid;
2583 Pid_t pid2;
03136e13 2584 bool close_failed;
b7953727 2585 int saved_errno = 0;
22fae026
TM		 2586#ifdef WIN32
2587 int saved_win32_errno;
2588#endif
a687059c 2589
4755096e 2590 LOCK_FDPID_MUTEX;
3280af22 2591 svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE);
4755096e 2592 UNLOCK_FDPID_MUTEX;
25d92023 2593 pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1;
a0d0e21e 2594 SvREFCNT_dec(*svp);
3280af22 2595 *svp = &PL_sv_undef;
ddcf38b7
IZ		 2596#ifdef OS2
2597 if (pid == -1) { /* Opened by popen. */
2598 return my_syspclose(ptr);
2599 }
a1d180c4 2600#endif
03136e13
CS		 2601 if ((close_failed = (PerlIO_close(ptr) == EOF))) {
2602 saved_errno = errno;
22fae026
TM		 2603#ifdef WIN32
2604 saved_win32_errno = GetLastError();
2605#endif
03136e13 2606 }
7c0587c8 2607#ifdef UTS
6ad3d225 2608 if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
7c0587c8 2609#endif
64ca3a65 2610#ifndef PERL_MICRO
8aad04aa
JH		 2611 rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat);
2612 rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat);
2613 rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat);
64ca3a65 2614#endif
748a9306 2615 do {
1d3434b8
GS		 2616 pid2 = wait4pid(pid, &status, 0);
2617 } while (pid2 == -1 && errno == EINTR);
64ca3a65 2618#ifndef PERL_MICRO
ff68c719 2619 rsignal_restore(SIGHUP, &hstat);
2620 rsignal_restore(SIGINT, &istat);
2621 rsignal_restore(SIGQUIT, &qstat);
64ca3a65 2622#endif
03136e13 2623 if (close_failed) {
ce6e1103 2624 SETERRNO(saved_errno, 0);
03136e13
CS		 2625 return -1;
2626 }
1d3434b8 2627 return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status));
20188a90 2628}
4633a7c4
LW		 2629#endif /* !DOSISH */
2630
2986a63f 2631#if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(MACOS_TRADITIONAL)
79072805 2632I32
d8a83dd3 2633Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags)
20188a90 2634{
27da23d5 2635 I32 result = 0;
b7953727
JH		 2636 if (!pid)
2637 return -1;
2638#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
2639 {
cf28e18a 2640 char spid[TYPE_CHARS(IV)];
20188a90 2641
3aed30dc 2642 if (pid > 0) {
27da23d5 2643 SV** svp;
7ea75b61
NC		 2644 const I32 len = my_sprintf(spid, "%"IVdf, (IV)pid);
2645
2646 svp = hv_fetch(PL_pidstatus,spid,len,FALSE);
3aed30dc
HS		 2647 if (svp && *svp != &PL_sv_undef) {
2648 *statusp = SvIVX(*svp);
2649 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2650 return pid;
2651 }
2652 }
2653 else {
2654 HE *entry;
2655
2656 hv_iterinit(PL_pidstatus);
2657 if ((entry = hv_iternext(PL_pidstatus))) {
27da23d5 2658 SV *sv = hv_iterval(PL_pidstatus,entry);
7ea75b61 2659 I32 len;
27da23d5 2660
3aed30dc 2661 pid = atoi(hv_iterkey(entry,(I32*)statusp));
3aed30dc 2662 *statusp = SvIVX(sv);
7ea75b61 2663 len = my_sprintf(spid, "%"IVdf, (IV)pid);
7b9a3241
NC		 2664 /* The hash iterator is currently on this entry, so simply
2665 calling hv_delete would trigger the lazy delete, which on
2666 aggregate does more work, beacuse next call to hv_iterinit()
2667 would spot the flag, and have to call the delete routine,
2668 while in the meantime any new entries can't re-use that
2669 memory. */
2670 hv_iterinit(PL_pidstatus);
7ea75b61 2671 (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD);
3aed30dc
HS		 2672 return pid;
2673 }
20188a90
LW		 2674 }
2675 }
68a29c53 2676#endif
79072805 2677#ifdef HAS_WAITPID
367f3c24
IZ		 2678# ifdef HAS_WAITPID_RUNTIME
2679 if (!HAS_WAITPID_RUNTIME)
2680 goto hard_way;
2681# endif
cddd4526 2682 result = PerlProc_waitpid(pid,statusp,flags);
dfcfdb64 2683 goto finish;
367f3c24
IZ		 2684#endif
2685#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
cddd4526 2686 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
dfcfdb64 2687 goto finish;
367f3c24
IZ		 2688#endif
2689#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
27da23d5 2690#if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
367f3c24 2691 hard_way:
27da23d5 2692#endif
a0d0e21e 2693 {
a0d0e21e 2694 if (flags)
cea2e8a9 2695 Perl_croak(aTHX_ "Can't do waitpid with flags");
a0d0e21e 2696 else {
76e3520e 2697 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
a0d0e21e
LW		 2698 pidgone(result,*statusp);
2699 if (result < 0)
2700 *statusp = -1;
2701 }
a687059c
LW		 2702 }
2703#endif
27da23d5 2704#if defined(HAS_WAITPID) || defined(HAS_WAIT4)
dfcfdb64 2705 finish:
27da23d5 2706#endif
cddd4526
NIS		 2707 if (result < 0 && errno == EINTR) {
2708 PERL_ASYNC_CHECK();
2709 }
2710 return result;
a687059c 2711}
2986a63f 2712#endif /* !DOSISH || OS2 || WIN32 || NETWARE */
a687059c 2713
7c0587c8 2714void
d8a83dd3 2715Perl_pidgone(pTHX_ Pid_t pid, int status)
a687059c 2716{
79072805 2717 register SV *sv;
cf28e18a 2718 char spid[TYPE_CHARS(IV)];
7ea75b61 2719 const size_t len = my_sprintf(spid, "%"IVdf, (IV)pid);
a687059c 2720
ce582cee 2721 sv = *hv_fetch(PL_pidstatus,spid,len,TRUE);
862a34c6 2722 SvUPGRADE(sv,SVt_IV);
45977657 2723 SvIV_set(sv, status);
20188a90 2724 return;
a687059c
LW		 2725}
2726
85ca448a 2727#if defined(atarist) || defined(OS2) || defined(EPOC)
7c0587c8 2728int pclose();
ddcf38b7
IZ		 2729#ifdef HAS_FORK
2730int /* Cannot prototype with I32
2731 in os2ish.h. */
ba106d47 2732my_syspclose(PerlIO *ptr)
ddcf38b7 2733#else
79072805 2734I32
864dbfa3 2735Perl_my_pclose(pTHX_ PerlIO *ptr)
a1d180c4 2736#endif
a687059c 2737{
760ac839
LW		 2738 /* Needs work for PerlIO ! */
2739 FILE *f = PerlIO_findFILE(ptr);
2740 I32 result = pclose(f);
2b96b0a5
JH		 2741 PerlIO_releaseFILE(ptr,f);
2742 return result;
2743}
2744#endif
2745
933fea7f 2746#if defined(DJGPP)
2b96b0a5
JH		 2747int djgpp_pclose();
2748I32
2749Perl_my_pclose(pTHX_ PerlIO *ptr)
2750{
2751 /* Needs work for PerlIO ! */
2752 FILE *f = PerlIO_findFILE(ptr);
2753 I32 result = djgpp_pclose(f);
933fea7f 2754 result = (result << 8) & 0xff00;
760ac839
LW		 2755 PerlIO_releaseFILE(ptr,f);
2756 return result;
a687059c 2757}
7c0587c8 2758#endif
9f68db38
LW		 2759
2760void
864dbfa3 2761Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
9f68db38 2762{
79072805 2763 register I32 todo;
08105a92 2764 register const char *frombase = from;
9f68db38
LW		 2765
2766 if (len == 1) {
08105a92 2767 register const char c = *from;
9f68db38 2768 while (count-- > 0)
5926133d 2769 *to++ = c;
9f68db38
LW		 2770 return;
2771 }
2772 while (count-- > 0) {
2773 for (todo = len; todo > 0; todo--) {
2774 *to++ = *from++;
2775 }
2776 from = frombase;
2777 }
2778}
0f85fab0 2779
fe14fcc3 2780#ifndef HAS_RENAME
79072805 2781I32
4373e329 2782Perl_same_dirent(pTHX_ const char *a, const char *b)
62b28dd9 2783{
93a17b20
LW		 2784 char *fa = strrchr(a,'/');
2785 char *fb = strrchr(b,'/');
c623ac67
GS		 2786 Stat_t tmpstatbuf1;
2787 Stat_t tmpstatbuf2;
46fc3d4c 2788 SV *tmpsv = sv_newmortal();
62b28dd9
LW		 2789
2790 if (fa)
2791 fa++;
2792 else
2793 fa = a;
2794 if (fb)
2795 fb++;
2796 else
2797 fb = b;
2798 if (strNE(a,b))
2799 return FALSE;
2800 if (fa == a)
616d8c9c 2801 sv_setpvn(tmpsv, ".", 1);
62b28dd9 2802 else
46fc3d4c 2803 sv_setpvn(tmpsv, a, fa - a);
95a20fc0 2804 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
62b28dd9
LW		 2805 return FALSE;
2806 if (fb == b)
616d8c9c 2807 sv_setpvn(tmpsv, ".", 1);
62b28dd9 2808 else
46fc3d4c 2809 sv_setpvn(tmpsv, b, fb - b);
95a20fc0 2810 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
62b28dd9
LW		 2811 return FALSE;
2812 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2813 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2814}
fe14fcc3
LW		 2815#endif /* !HAS_RENAME */
2816
491527d0 2817char*
7f315aed
NC		 2818Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2819 const char *const *const search_ext, I32 flags)
491527d0 2820{
e1ec3a88 2821 const char *xfound = Nullch;
491527d0 2822 char *xfailed = Nullch;
0f31cffe 2823 char tmpbuf[MAXPATHLEN];
491527d0 2824 register char *s;
5f74f29c 2825 I32 len = 0;
491527d0
GS		 2826 int retval;
2827#if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2828# define SEARCH_EXTS ".bat", ".cmd", NULL
2829# define MAX_EXT_LEN 4
2830#endif
2831#ifdef OS2
2832# define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2833# define MAX_EXT_LEN 4
2834#endif
2835#ifdef VMS
2836# define SEARCH_EXTS ".pl", ".com", NULL
2837# define MAX_EXT_LEN 4
2838#endif
2839 /* additional extensions to try in each dir if scriptname not found */
2840#ifdef SEARCH_EXTS
7f315aed
NC		 2841 const char *const exts[] = { SEARCH_EXTS };
2842 const char *const *const ext = search_ext ? search_ext : exts;
491527d0 2843 int extidx = 0, i = 0;
e1ec3a88 2844 const char *curext = Nullch;
491527d0 2845#else
53c1dcc0 2846 PERL_UNUSED_ARG(search_ext);
491527d0
GS		 2847# define MAX_EXT_LEN 0
2848#endif
2849
2850 /*
2851 * If dosearch is true and if scriptname does not contain path
2852 * delimiters, search the PATH for scriptname.
2853 *
2854 * If SEARCH_EXTS is also defined, will look for each
2855 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2856 * while searching the PATH.
2857 *
2858 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2859 * proceeds as follows:
2860 * If DOSISH or VMSISH:
2861 * + look for ./scriptname{,.foo,.bar}
2862 * + search the PATH for scriptname{,.foo,.bar}
2863 *
2864 * If !DOSISH:
2865 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2866 * this will not look in '.' if it's not in the PATH)
2867 */
84486fc6 2868 tmpbuf[0] = '\0';
491527d0
GS		 2869
2870#ifdef VMS
2871# ifdef ALWAYS_DEFTYPES
2872 len = strlen(scriptname);
2873 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2874 int hasdir, idx = 0, deftypes = 1;
2875 bool seen_dot = 1;
2876
2877 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2878# else
2879 if (dosearch) {
2880 int hasdir, idx = 0, deftypes = 1;
2881 bool seen_dot = 1;
2882
2883 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2884# endif
2885 /* The first time through, just add SEARCH_EXTS to whatever we
2886 * already have, so we can check for default file types. */
2887 while (deftypes ||
84486fc6 2888 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
491527d0
GS		 2889 {
2890 if (deftypes) {
2891 deftypes = 0;
84486fc6 2892 *tmpbuf = '\0';
491527d0 2893 }
84486fc6
GS		 2894 if ((strlen(tmpbuf) + strlen(scriptname)
2895 + MAX_EXT_LEN) >= sizeof tmpbuf)
491527d0 2896 continue; /* don't search dir with too-long name */
84486fc6 2897 strcat(tmpbuf, scriptname);
491527d0
GS		 2898#else /* !VMS */
2899
2900#ifdef DOSISH
2901 if (strEQ(scriptname, "-"))
2902 dosearch = 0;
2903 if (dosearch) { /* Look in '.' first. */
fe2774ed 2904 const char *cur = scriptname;
491527d0
GS		 2905#ifdef SEARCH_EXTS
2906 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2907 while (ext[i])
2908 if (strEQ(ext[i++],curext)) {
2909 extidx = -1; /* already has an ext */
2910 break;
2911 }
2912 do {
2913#endif
2914 DEBUG_p(PerlIO_printf(Perl_debug_log,
2915 "Looking for %s\n",cur));
017f25f1
IZ		 2916 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2917 && !S_ISDIR(PL_statbuf.st_mode)) {
491527d0
GS		 2918 dosearch = 0;
2919 scriptname = cur;
2920#ifdef SEARCH_EXTS
2921 break;
2922#endif
2923 }
2924#ifdef SEARCH_EXTS
2925 if (cur == scriptname) {
2926 len = strlen(scriptname);
84486fc6 2927 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
491527d0 2928 break;
490a0e98 2929 /* FIXME? Convert to memcpy */
84486fc6 2930 cur = strcpy(tmpbuf, scriptname);
491527d0
GS		 2931 }
2932 } while (extidx >= 0 && ext[extidx] /* try an extension? */
84486fc6 2933 && strcpy(tmpbuf+len, ext[extidx++]));
491527d0
GS		 2934#endif
2935 }
2936#endif
2937
cd39f2b6
JH		 2938#ifdef MACOS_TRADITIONAL
2939 if (dosearch && !strchr(scriptname, ':') &&
2940 (s = PerlEnv_getenv("Commands")))
2941#else
491527d0
GS		 2942 if (dosearch && !strchr(scriptname, '/')
2943#ifdef DOSISH
2944 && !strchr(scriptname, '\\')
2945#endif
cd39f2b6
JH		 2946 && (s = PerlEnv_getenv("PATH")))
2947#endif
2948 {
491527d0 2949 bool seen_dot = 0;
92f0c265 2950
3280af22
NIS		 2951 PL_bufend = s + strlen(s);
2952 while (s < PL_bufend) {
cd39f2b6
JH		 2953#ifdef MACOS_TRADITIONAL
2954 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2955 ',',
2956 &len);
2957#else
491527d0
GS		 2958#if defined(atarist) || defined(DOSISH)
2959 for (len = 0; *s
2960# ifdef atarist
2961 && *s != ','
2962# endif
2963 && *s != ';'; len++, s++) {
84486fc6
GS		 2964 if (len < sizeof tmpbuf)
2965 tmpbuf[len] = *s;
491527d0 2966 }
84486fc6
GS		 2967 if (len < sizeof tmpbuf)
2968 tmpbuf[len] = '\0';
491527d0 2969#else /* ! (atarist || DOSISH) */
3280af22 2970 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
491527d0
GS		 2971 ':',
2972 &len);
2973#endif /* ! (atarist || DOSISH) */
cd39f2b6 2974#endif /* MACOS_TRADITIONAL */
3280af22 2975 if (s < PL_bufend)
491527d0 2976 s++;
84486fc6 2977 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
491527d0 2978 continue; /* don't search dir with too-long name */
cd39f2b6
JH		 2979#ifdef MACOS_TRADITIONAL
2980 if (len && tmpbuf[len - 1] != ':')
2981 tmpbuf[len++] = ':';
2982#else
491527d0 2983 if (len
490a0e98 2984# if defined(atarist) || defined(__MINT__) || defined(DOSISH)
84486fc6
GS		 2985 && tmpbuf[len - 1] != '/'
2986 && tmpbuf[len - 1] != '\\'
490a0e98 2987# endif
491527d0 2988 )
84486fc6
GS		 2989 tmpbuf[len++] = '/';
2990 if (len == 2 && tmpbuf[0] == '.')
491527d0 2991 seen_dot = 1;
cd39f2b6 2992#endif
490a0e98
NC		 2993 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2994 */
84486fc6 2995 (void)strcpy(tmpbuf + len, scriptname);
491527d0
GS		 2996#endif /* !VMS */
2997
2998#ifdef SEARCH_EXTS
84486fc6 2999 len = strlen(tmpbuf);
491527d0
GS		 3000 if (extidx > 0) /* reset after previous loop */
3001 extidx = 0;
3002 do {
3003#endif
84486fc6 3004 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3280af22 3005 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
017f25f1
IZ		 3006 if (S_ISDIR(PL_statbuf.st_mode)) {
3007 retval = -1;
3008 }
491527d0
GS		 3009#ifdef SEARCH_EXTS
3010 } while ( retval < 0 /* not there */
3011 && extidx>=0 && ext[extidx] /* try an extension? */
84486fc6 3012 && strcpy(tmpbuf+len, ext[extidx++])
491527d0
GS		 3013 );
3014#endif
3015 if (retval < 0)
3016 continue;
3280af22
NIS		 3017 if (S_ISREG(PL_statbuf.st_mode)
3018 && cando(S_IRUSR,TRUE,&PL_statbuf)
73811745 3019#if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3280af22 3020 && cando(S_IXUSR,TRUE,&PL_statbuf)
491527d0
GS		 3021#endif
3022 )
3023 {
3aed30dc 3024 xfound = tmpbuf; /* bingo! */
491527d0
GS		 3025 break;
3026 }
3027 if (!xfailed)
84486fc6 3028 xfailed = savepv(tmpbuf);
491527d0
GS		 3029 }
3030#ifndef DOSISH
017f25f1 3031 if (!xfound && !seen_dot && !xfailed &&
a1d180c4 3032 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
017f25f1 3033 || S_ISDIR(PL_statbuf.st_mode)))
491527d0
GS		 3034#endif
3035 seen_dot = 1; /* Disable message. */
9ccb31f9
GS		 3036 if (!xfound) {
3037 if (flags & 1) { /* do or die? */
3aed30dc 3038 Perl_croak(aTHX_ "Can't %s %s%s%s",
9ccb31f9
GS		 3039 (xfailed ? "execute" : "find"),
3040 (xfailed ? xfailed : scriptname),
3041 (xfailed ? "" : " on PATH"),
3042 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3043 }
3044 scriptname = Nullch;
3045 }
43c5f42d 3046 Safefree(xfailed);
491527d0
GS		 3047 scriptname = xfound;
3048 }
9ccb31f9 3049 return (scriptname ? savepv(scriptname) : Nullch);
491527d0
GS		 3050}
3051
ba869deb
GS		 3052#ifndef PERL_GET_CONTEXT_DEFINED
3053
3054void *
3055Perl_get_context(void)
3056{
27da23d5 3057 dVAR;
3db8f154 3058#if defined(USE_ITHREADS)
ba869deb
GS		 3059# ifdef OLD_PTHREADS_API
3060 pthread_addr_t t;
3061 if (pthread_getspecific(PL_thr_key, &t))
3062 Perl_croak_nocontext("panic: pthread_getspecific");
3063 return (void*)t;
3064# else
bce813aa 3065# ifdef I_MACH_CTHREADS
8b8b35ab 3066 return (void*)cthread_data(cthread_self());
bce813aa 3067# else
8b8b35ab
JH		 3068 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3069# endif
c44d3fdb 3070# endif
ba869deb
GS		 3071#else
3072 return (void*)NULL;
3073#endif
3074}
3075
3076void
3077Perl_set_context(void *t)
3078{
8772537c 3079 dVAR;
3db8f154 3080#if defined(USE_ITHREADS)
c44d3fdb
GS		 3081# ifdef I_MACH_CTHREADS
3082 cthread_set_data(cthread_self(), t);
3083# else
ba869deb
GS		 3084 if (pthread_setspecific(PL_thr_key, t))
3085 Perl_croak_nocontext("panic: pthread_setspecific");
c44d3fdb 3086# endif
b464bac0 3087#else
8772537c 3088 PERL_UNUSED_ARG(t);
ba869deb
GS		 3089#endif
3090}
3091
3092#endif /* !PERL_GET_CONTEXT_DEFINED */
491527d0 3093
27da23d5 3094#if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
22239a37 3095struct perl_vars *
864dbfa3 3096Perl_GetVars(pTHX)
22239a37 3097{
533c011a 3098 return &PL_Vars;
22239a37 3099}
31fb1209
NIS		 3100#endif
3101
1cb0ed9b 3102char **
864dbfa3 3103Perl_get_op_names(pTHX)
31fb1209 3104{
27da23d5 3105 return (char **)PL_op_name;
31fb1209
NIS		 3106}
3107
1cb0ed9b 3108char **
864dbfa3 3109Perl_get_op_descs(pTHX)
31fb1209 3110{
27da23d5 3111 return (char **)PL_op_desc;
31fb1209 3112}
9e6b2b00 3113
e1ec3a88 3114const char *
864dbfa3 3115Perl_get_no_modify(pTHX)
9e6b2b00 3116{
e1ec3a88 3117 return PL_no_modify;
9e6b2b00
GS		 3118}
3119
3120U32 *
864dbfa3 3121Perl_get_opargs(pTHX)
9e6b2b00 3122{
27da23d5 3123 return (U32 *)PL_opargs;
9e6b2b00 3124}
51aa15f3 3125
0cb96387
GS		 3126PPADDR_t*
3127Perl_get_ppaddr(pTHX)
3128{
27da23d5 3129 dVAR;
12ae5dfc 3130 return (PPADDR_t*)PL_ppaddr;
0cb96387
GS		 3131}
3132
a6c40364
GS		 3133#ifndef HAS_GETENV_LEN
3134char *
bf4acbe4 3135Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
a6c40364 3136{
8772537c 3137 char * const env_trans = PerlEnv_getenv(env_elem);
a6c40364
GS		 3138 if (env_trans)
3139 *len = strlen(env_trans);
3140 return env_trans;
f675dbe5
CB		 3141}
3142#endif
3143
dc9e4912
GS		 3144
3145MGVTBL*
864dbfa3 3146Perl_get_vtbl(pTHX_ int vtbl_id)
dc9e4912 3147{
27da23d5 3148 const MGVTBL* result = Null(MGVTBL*);
dc9e4912
GS		 3149
3150 switch(vtbl_id) {
3151 case want_vtbl_sv:
3152 result = &PL_vtbl_sv;
3153 break;
3154 case want_vtbl_env:
3155 result = &PL_vtbl_env;
3156 break;
3157 case want_vtbl_envelem:
3158 result = &PL_vtbl_envelem;
3159 break;
3160 case want_vtbl_sig:
3161 result = &PL_vtbl_sig;
3162 break;
3163 case want_vtbl_sigelem:
3164 result = &PL_vtbl_sigelem;
3165 break;
3166 case want_vtbl_pack:
3167 result = &PL_vtbl_pack;
3168 break;
3169 case want_vtbl_packelem:
3170 result = &PL_vtbl_packelem;
3171 break;
3172 case want_vtbl_dbline:
3173 result = &PL_vtbl_dbline;
3174 break;
3175 case want_vtbl_isa:
3176 result = &PL_vtbl_isa;
3177 break;
3178 case want_vtbl_isaelem:
3179 result = &PL_vtbl_isaelem;
3180 break;
3181 case want_vtbl_arylen:
3182 result = &PL_vtbl_arylen;
3183 break;
3184 case want_vtbl_glob:
3185 result = &PL_vtbl_glob;
3186 break;
3187 case want_vtbl_mglob:
3188 result = &PL_vtbl_mglob;
3189 break;
3190 case want_vtbl_nkeys:
3191 result = &PL_vtbl_nkeys;
3192 break;
3193 case want_vtbl_taint:
3194 result = &PL_vtbl_taint;
3195 break;
3196 case want_vtbl_substr:
3197 result = &PL_vtbl_substr;
3198 break;
3199 case want_vtbl_vec:
3200 result = &PL_vtbl_vec;
3201 break;
3202 case want_vtbl_pos:
3203 result = &PL_vtbl_pos;
3204 break;
3205 case want_vtbl_bm:
3206 result = &PL_vtbl_bm;
3207 break;
3208 case want_vtbl_fm:
3209 result = &PL_vtbl_fm;
3210 break;
3211 case want_vtbl_uvar:
3212 result = &PL_vtbl_uvar;
3213 break;
dc9e4912
GS		 3214 case want_vtbl_defelem:
3215 result = &PL_vtbl_defelem;
3216 break;
3217 case want_vtbl_regexp:
3218 result = &PL_vtbl_regexp;
3219 break;
3220 case want_vtbl_regdata:
3221 result = &PL_vtbl_regdata;
3222 break;
3223 case want_vtbl_regdatum:
3224 result = &PL_vtbl_regdatum;
3225 break;
3c90161d 3226#ifdef USE_LOCALE_COLLATE
dc9e4912
GS		 3227 case want_vtbl_collxfrm:
3228 result = &PL_vtbl_collxfrm;
3229 break;
3c90161d 3230#endif
dc9e4912
GS		 3231 case want_vtbl_amagic:
3232 result = &PL_vtbl_amagic;
3233 break;
3234 case want_vtbl_amagicelem:
3235 result = &PL_vtbl_amagicelem;
3236 break;
810b8aa5
GS		 3237 case want_vtbl_backref:
3238 result = &PL_vtbl_backref;
3239 break;
7e8c5dac
HS		 3240 case want_vtbl_utf8:
3241 result = &PL_vtbl_utf8;
3242 break;
dc9e4912 3243 }
27da23d5 3244 return (MGVTBL*)result;
dc9e4912
GS		 3245}
3246
767df6a1 3247I32
864dbfa3 3248Perl_my_fflush_all(pTHX)
767df6a1 3249{
f800e14d 3250#if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
ce720889 3251 return PerlIO_flush(NULL);
767df6a1 3252#else
8fbdfb7c 3253# if defined(HAS__FWALK)
f13a2bc0 3254 extern int fflush(FILE *);
74cac757
JH		 3255 /* undocumented, unprototyped, but very useful BSDism */
3256 extern void _fwalk(int (*)(FILE *));
8fbdfb7c 3257 _fwalk(&fflush);
74cac757 3258 return 0;
8fa7f367 3259# else
8fbdfb7c 3260# if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
8fa7f367 3261 long open_max = -1;
8fbdfb7c 3262# ifdef PERL_FFLUSH_ALL_FOPEN_MAX
d2201af2 3263 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
8fbdfb7c 3264# else
8fa7f367 3265# if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
767df6a1 3266 open_max = sysconf(_SC_OPEN_MAX);
8fa7f367
JH		 3267# else
3268# ifdef FOPEN_MAX
74cac757 3269 open_max = FOPEN_MAX;
8fa7f367
JH		 3270# else
3271# ifdef OPEN_MAX
74cac757 3272 open_max = OPEN_MAX;
8fa7f367
JH		 3273# else
3274# ifdef _NFILE
d2201af2 3275 open_max = _NFILE;
8fa7f367
JH		 3276# endif
3277# endif
74cac757 3278# endif
767df6a1
JH		 3279# endif
3280# endif
767df6a1
JH		 3281 if (open_max > 0) {
3282 long i;
3283 for (i = 0; i < open_max; i++)
d2201af2
AD		 3284 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3285 STDIO_STREAM_ARRAY[i]._file < open_max &&
3286 STDIO_STREAM_ARRAY[i]._flag)
3287 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
767df6a1
JH		 3288 return 0;
3289 }
8fbdfb7c 3290# endif
93189314 3291 SETERRNO(EBADF,RMS_IFI);
767df6a1 3292 return EOF;
74cac757 3293# endif
767df6a1
JH		 3294#endif
3295}
097ee67d 3296
69282e91 3297void
e1ec3a88 3298Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
bc37a18f 3299{
b64e5050 3300 const char * const func =
66fc2fa5
JH		 3301 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3302 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
bc37a18f 3303 PL_op_desc[op];
b64e5050
AL		 3304 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3305 const char * const type = OP_IS_SOCKET(op)
3aed30dc
HS		 3306 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3307 ? "socket" : "filehandle";
b64e5050 3308 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
66fc2fa5 3309
4c80c0b2 3310 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3aed30dc 3311 if (ckWARN(WARN_IO)) {
b64e5050 3312 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3aed30dc
HS		 3313 if (name && *name)
3314 Perl_warner(aTHX_ packWARN(WARN_IO),
3315 "Filehandle %s opened only for %sput",
fd322ea4 3316 name, direction);
3aed30dc
HS		 3317 else
3318 Perl_warner(aTHX_ packWARN(WARN_IO),
fd322ea4 3319 "Filehandle opened only for %sput", direction);
3aed30dc 3320 }
2dd78f96
JH		 3321 }
3322 else {
e1ec3a88 3323 const char *vile;
3aed30dc
HS		 3324 I32 warn_type;
3325
3326 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3327 vile = "closed";
3328 warn_type = WARN_CLOSED;
3329 }
3330 else {
3331 vile = "unopened";
3332 warn_type = WARN_UNOPENED;
3333 }
3334
3335 if (ckWARN(warn_type)) {
3336 if (name && *name) {
3337 Perl_warner(aTHX_ packWARN(warn_type),
3338 "%s%s on %s %s %s", func, pars, vile, type, name);
3339 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3340 Perl_warner(
3341 aTHX_ packWARN(warn_type),
3342 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3343 func, pars, name
3344 );
3345 }
3346 else {
3347 Perl_warner(aTHX_ packWARN(warn_type),
3348 "%s%s on %s %s", func, pars, vile, type);
3349 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3350 Perl_warner(
3351 aTHX_ packWARN(warn_type),
3352 "\t(Are you trying to call %s%s on dirhandle?)\n",
3353 func, pars
3354 );
3355 }
3356 }
bc37a18f 3357 }
69282e91 3358}
a926ef6b
JH		 3359
3360#ifdef EBCDIC
cbebf344
JH		 3361/* in ASCII order, not that it matters */
3362static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3363
a926ef6b
JH		 3364int
3365Perl_ebcdic_control(pTHX_ int ch)
3366{
3aed30dc 3367 if (ch > 'a') {
e1ec3a88 3368 const char *ctlp;
3aed30dc
HS		 3369
3370 if (islower(ch))
3371 ch = toupper(ch);
3372
3373 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3374 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
a926ef6b 3375 }
3aed30dc
HS		 3376
3377 if (ctlp == controllablechars)
3378 return('\177'); /* DEL */
3379 else
3380 return((unsigned char)(ctlp - controllablechars - 1));
3381 } else { /* Want uncontrol */
3382 if (ch == '\177' || ch == -1)
3383 return('?');
3384 else if (ch == '\157')
3385 return('\177');
3386 else if (ch == '\174')
3387 return('\000');
3388 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3389 return('\036');
3390 else if (ch == '\155')
3391 return('\037');
3392 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3393 return(controllablechars[ch+1]);
3394 else
3395 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3396 }
a926ef6b
JH		 3397}
3398#endif
e72cf795 3399
f6adc668 3400/* To workaround core dumps from the uninitialised tm_zone we get the
e72cf795
JH		 3401 * system to give us a reasonable struct to copy. This fix means that
3402 * strftime uses the tm_zone and tm_gmtoff values returned by
3403 * localtime(time()). That should give the desired result most of the
3404 * time. But probably not always!
3405 *
f6adc668
JH		 3406 * This does not address tzname aspects of NETaa14816.
3407 *
e72cf795 3408 */
f6adc668 3409
e72cf795
JH		 3410#ifdef HAS_GNULIBC
3411# ifndef STRUCT_TM_HASZONE
3412# define STRUCT_TM_HASZONE
3413# endif
3414#endif
3415
f6adc668
JH		 3416#ifdef STRUCT_TM_HASZONE /* Backward compat */
3417# ifndef HAS_TM_TM_ZONE
3418# define HAS_TM_TM_ZONE
3419# endif
3420#endif
3421
e72cf795 3422void
f1208910 3423Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
e72cf795 3424{
f6adc668 3425#ifdef HAS_TM_TM_ZONE
e72cf795 3426 Time_t now;
1b6737cc 3427 const struct tm* my_tm;
e72cf795 3428 (void)time(&now);
82c57498 3429 my_tm = localtime(&now);
ca46b8ee
SP		 3430 if (my_tm)
3431 Copy(my_tm, ptm, 1, struct tm);
1b6737cc
AL		 3432#else
3433 PERL_UNUSED_ARG(ptm);
e72cf795
JH		 3434#endif
3435}
3436
3437/*
3438 * mini_mktime - normalise struct tm values without the localtime()
3439 * semantics (and overhead) of mktime().
3440 */
3441void
f1208910 3442Perl_mini_mktime(pTHX_ struct tm *ptm)
e72cf795
JH		 3443{
3444 int yearday;
3445 int secs;
3446 int month, mday, year, jday;
3447 int odd_cent, odd_year;
3448
3449#define DAYS_PER_YEAR 365
3450#define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3451#define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3452#define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3453#define SECS_PER_HOUR (60*60)
3454#define SECS_PER_DAY (24*SECS_PER_HOUR)
3455/* parentheses deliberately absent on these two, otherwise they don't work */
3456#define MONTH_TO_DAYS 153/5
3457#define DAYS_TO_MONTH 5/153
3458/* offset to bias by March (month 4) 1st between month/mday & year finding */
3459#define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3460/* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3461#define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3462
3463/*
3464 * Year/day algorithm notes:
3465 *
3466 * With a suitable offset for numeric value of the month, one can find
3467 * an offset into the year by considering months to have 30.6 (153/5) days,
3468 * using integer arithmetic (i.e., with truncation). To avoid too much
3469 * messing about with leap days, we consider January and February to be
3470 * the 13th and 14th month of the previous year. After that transformation,
3471 * we need the month index we use to be high by 1 from 'normal human' usage,
3472 * so the month index values we use run from 4 through 15.
3473 *
3474 * Given that, and the rules for the Gregorian calendar (leap years are those
3475 * divisible by 4 unless also divisible by 100, when they must be divisible
3476 * by 400 instead), we can simply calculate the number of days since some
3477 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3478 * the days we derive from our month index, and adding in the day of the
3479 * month. The value used here is not adjusted for the actual origin which
3480 * it normally would use (1 January A.D. 1), since we're not exposing it.
3481 * We're only building the value so we can turn around and get the
3482 * normalised values for the year, month, day-of-month, and day-of-year.
3483 *
3484 * For going backward, we need to bias the value we're using so that we find
3485 * the right year value. (Basically, we don't want the contribution of
3486 * March 1st to the number to apply while deriving the year). Having done
3487 * that, we 'count up' the contribution to the year number by accounting for
3488 * full quadracenturies (400-year periods) with their extra leap days, plus
3489 * the contribution from full centuries (to avoid counting in the lost leap
3490 * days), plus the contribution from full quad-years (to count in the normal
3491 * leap days), plus the leftover contribution from any non-leap years.
3492 * At this point, if we were working with an actual leap day, we'll have 0
3493 * days left over. This is also true for March 1st, however. So, we have
3494 * to special-case that result, and (earlier) keep track of the 'odd'
3495 * century and year contributions. If we got 4 extra centuries in a qcent,
3496 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3497 * Otherwise, we add back in the earlier bias we removed (the 123 from
3498 * figuring in March 1st), find the month index (integer division by 30.6),
3499 * and the remainder is the day-of-month. We then have to convert back to
3500 * 'real' months (including fixing January and February from being 14/15 in
3501 * the previous year to being in the proper year). After that, to get
3502 * tm_yday, we work with the normalised year and get a new yearday value for
3503 * January 1st, which we subtract from the yearday value we had earlier,
3504 * representing the date we've re-built. This is done from January 1
3505 * because tm_yday is 0-origin.
3506 *
3507 * Since POSIX time routines are only guaranteed to work for times since the
3508 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3509 * applies Gregorian calendar rules even to dates before the 16th century
3510 * doesn't bother me. Besides, you'd need cultural context for a given
3511 * date to know whether it was Julian or Gregorian calendar, and that's
3512 * outside the scope for this routine. Since we convert back based on the
3513 * same rules we used to build the yearday, you'll only get strange results
3514 * for input which needed normalising, or for the 'odd' century years which
3515 * were leap years in the Julian calander but not in the Gregorian one.
3516 * I can live with that.
3517 *
3518 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3519 * that's still outside the scope for POSIX time manipulation, so I don't
3520 * care.
3521 */
3522
3523 year = 1900 + ptm->tm_year;
3524 month = ptm->tm_mon;
3525 mday = ptm->tm_mday;
3526 /* allow given yday with no month & mday to dominate the result */
3527 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3528 month = 0;
3529 mday = 0;
3530 jday = 1 + ptm->tm_yday;
3531 }
3532 else {
3533 jday = 0;
3534 }
3535 if (month >= 2)
3536 month+=2;
3537 else
3538 month+=14, year--;
3539 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3540 yearday += month*MONTH_TO_DAYS + mday + jday;
3541 /*
3542 * Note that we don't know when leap-seconds were or will be,
3543 * so we have to trust the user if we get something which looks
3544 * like a sensible leap-second. Wild values for seconds will
3545 * be rationalised, however.
3546 */
3547 if ((unsigned) ptm->tm_sec <= 60) {
3548 secs = 0;
3549 }
3550 else {
3551 secs = ptm->tm_sec;
3552 ptm->tm_sec = 0;
3553 }
3554 secs += 60 * ptm->tm_min;
3555 secs += SECS_PER_HOUR * ptm->tm_hour;
3556 if (secs < 0) {
3557 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3558 /* got negative remainder, but need positive time */
3559 /* back off an extra day to compensate */
3560 yearday += (secs/SECS_PER_DAY)-1;
3561 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3562 }
3563 else {
3564 yearday += (secs/SECS_PER_DAY);
3565 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3566 }
3567 }
3568 else if (secs >= SECS_PER_DAY) {
3569 yearday += (secs/SECS_PER_DAY);
3570 secs %= SECS_PER_DAY;
3571 }
3572 ptm->tm_hour = secs/SECS_PER_HOUR;
3573 secs %= SECS_PER_HOUR;
3574 ptm->tm_min = secs/60;
3575 secs %= 60;
3576 ptm->tm_sec += secs;
3577 /* done with time of day effects */
3578 /*
3579 * The algorithm for yearday has (so far) left it high by 428.
3580 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3581 * bias it by 123 while trying to figure out what year it
3582 * really represents. Even with this tweak, the reverse
3583 * translation fails for years before A.D. 0001.
3584 * It would still fail for Feb 29, but we catch that one below.
3585 */
3586 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3587 yearday -= YEAR_ADJUST;
3588 year = (yearday / DAYS_PER_QCENT) * 400;
3589 yearday %= DAYS_PER_QCENT;
3590 odd_cent = yearday / DAYS_PER_CENT;
3591 year += odd_cent * 100;
3592 yearday %= DAYS_PER_CENT;
3593 year += (yearday / DAYS_PER_QYEAR) * 4;
3594 yearday %= DAYS_PER_QYEAR;
3595 odd_year = yearday / DAYS_PER_YEAR;
3596 year += odd_year;
3597 yearday %= DAYS_PER_YEAR;
3598 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3599 month = 1;
3600 yearday = 29;
3601 }
3602 else {
3603 yearday += YEAR_ADJUST; /* recover March 1st crock */
3604 month = yearday*DAYS_TO_MONTH;
3605 yearday -= month*MONTH_TO_DAYS;
3606 /* recover other leap-year adjustment */
3607 if (month > 13) {
3608 month-=14;
3609 year++;
3610 }
3611 else {
3612 month-=2;
3613 }
3614 }
3615 ptm->tm_year = year - 1900;
3616 if (yearday) {
3617 ptm->tm_mday = yearday;
3618 ptm->tm_mon = month;
3619 }
3620 else {
3621 ptm->tm_mday = 31;
3622 ptm->tm_mon = month - 1;
3623 }
3624 /* re-build yearday based on Jan 1 to get tm_yday */
3625 year--;
3626 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3627 yearday += 14*MONTH_TO_DAYS + 1;
3628 ptm->tm_yday = jday - yearday;
3629 /* fix tm_wday if not overridden by caller */
3630 if ((unsigned)ptm->tm_wday > 6)
3631 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3632}
b3c85772
JH		 3633
3634char *
e1ec3a88 3635Perl_my_strftime(pTHX_ const char *fmt, int sec, int min, int hour, int mday, int mon, int year, int wday, int yday, int isdst)
b3c85772
JH		 3636{
3637#ifdef HAS_STRFTIME
3638 char *buf;
3639 int buflen;
3640 struct tm mytm;
3641 int len;
3642
3643 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3644 mytm.tm_sec = sec;
3645 mytm.tm_min = min;
3646 mytm.tm_hour = hour;
3647 mytm.tm_mday = mday;
3648 mytm.tm_mon = mon;
3649 mytm.tm_year = year;
3650 mytm.tm_wday = wday;
3651 mytm.tm_yday = yday;
3652 mytm.tm_isdst = isdst;
3653 mini_mktime(&mytm);
c473feec
SR		 3654 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3655#if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3656 STMT_START {
3657 struct tm mytm2;
3658 mytm2 = mytm;
3659 mktime(&mytm2);
3660#ifdef HAS_TM_TM_GMTOFF
3661 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3662#endif
3663#ifdef HAS_TM_TM_ZONE
3664 mytm.tm_zone = mytm2.tm_zone;
3665#endif
3666 } STMT_END;
3667#endif
b3c85772 3668 buflen = 64;
a02a5408 3669 Newx(buf, buflen, char);
b3c85772
JH		 3670 len = strftime(buf, buflen, fmt, &mytm);
3671 /*
877f6a72 3672 ** The following is needed to handle to the situation where
b3c85772
JH		 3673 ** tmpbuf overflows. Basically we want to allocate a buffer
3674 ** and try repeatedly. The reason why it is so complicated
3675 ** is that getting a return value of 0 from strftime can indicate
3676 ** one of the following:
3677 ** 1. buffer overflowed,
3678 ** 2. illegal conversion specifier, or
3679 ** 3. the format string specifies nothing to be returned(not
3680 ** an error). This could be because format is an empty string
3681 ** or it specifies %p that yields an empty string in some locale.
3682 ** If there is a better way to make it portable, go ahead by
3683 ** all means.
3684 */
3685 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3686 return buf;
3687 else {
3688 /* Possibly buf overflowed - try again with a bigger buf */
e1ec3a88
AL		 3689 const int fmtlen = strlen(fmt);
3690 const int bufsize = fmtlen + buflen;
877f6a72 3691
a02a5408 3692 Newx(buf, bufsize, char);
b3c85772
JH		 3693 while (buf) {
3694 buflen = strftime(buf, bufsize, fmt, &mytm);
3695 if (buflen > 0 && buflen < bufsize)
3696 break;
3697 /* heuristic to prevent out-of-memory errors */
3698 if (bufsize > 100*fmtlen) {
3699 Safefree(buf);
3700 buf = NULL;
3701 break;
3702 }
e1ec3a88 3703 Renew(buf, bufsize*2, char);
b3c85772
JH		 3704 }
3705 return buf;
3706 }
3707#else
3708 Perl_croak(aTHX_ "panic: no strftime");
27da23d5 3709 return NULL;
b3c85772
JH		 3710#endif
3711}
3712
877f6a72
NIS		 3713
3714#define SV_CWD_RETURN_UNDEF \
3715sv_setsv(sv, &PL_sv_undef); \
3716return FALSE
3717
3718#define SV_CWD_ISDOT(dp) \
3719 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3aed30dc 3720 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
877f6a72
NIS		 3721
3722/*
ccfc67b7
JH		 3723=head1 Miscellaneous Functions
3724
89423764 3725=for apidoc getcwd_sv
877f6a72
NIS		 3726
3727Fill the sv with current working directory
3728
3729=cut
3730*/
3731
3732/* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3733 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3734 * getcwd(3) if available
3735 * Comments from the orignal:
3736 * This is a faster version of getcwd. It's also more dangerous
3737 * because you might chdir out of a directory that you can't chdir
3738 * back into. */
3739
877f6a72 3740int
89423764 3741Perl_getcwd_sv(pTHX_ register SV *sv)
877f6a72
NIS		 3742{
3743#ifndef PERL_MICRO
3744
ea715489
JH		 3745#ifndef INCOMPLETE_TAINTS
3746 SvTAINTED_on(sv);
3747#endif
3748
8f95b30d
JH		 3749#ifdef HAS_GETCWD
3750 {
60e110a8
DM		 3751 char buf[MAXPATHLEN];
3752
3aed30dc 3753 /* Some getcwd()s automatically allocate a buffer of the given
60e110a8
DM		 3754 * size from the heap if they are given a NULL buffer pointer.
3755 * The problem is that this behaviour is not portable. */
3aed30dc 3756 if (getcwd(buf, sizeof(buf) - 1)) {
4373e329 3757 sv_setpvn(sv, buf, strlen(buf));
3aed30dc
HS		 3758 return TRUE;
3759 }
3760 else {
3761 sv_setsv(sv, &PL_sv_undef);
3762 return FALSE;
3763 }
8f95b30d
JH		 3764 }
3765
3766#else
3767
c623ac67 3768 Stat_t statbuf;
877f6a72 3769 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4373e329 3770 int pathlen=0;
877f6a72 3771 Direntry_t *dp;
877f6a72 3772
862a34c6 3773 SvUPGRADE(sv, SVt_PV);
877f6a72 3774
877f6a72 3775 if (PerlLIO_lstat(".", &statbuf) < 0) {
3aed30dc 3776 SV_CWD_RETURN_UNDEF;
877f6a72
NIS		 3777 }
3778
3779 orig_cdev = statbuf.st_dev;
3780 orig_cino = statbuf.st_ino;
3781 cdev = orig_cdev;
3782 cino = orig_cino;
3783
3784 for (;;) {
4373e329 3785 DIR *dir;
3aed30dc
HS		 3786 odev = cdev;
3787 oino = cino;
3788
3789 if (PerlDir_chdir("..") < 0) {
3790 SV_CWD_RETURN_UNDEF;
3791 }
3792 if (PerlLIO_stat(".", &statbuf) < 0) {
3793 SV_CWD_RETURN_UNDEF;
3794 }
3795
3796 cdev = statbuf.st_dev;
3797 cino = statbuf.st_ino;
3798
3799 if (odev == cdev && oino == cino) {
3800 break;
3801 }
3802 if (!(dir = PerlDir_open("."))) {
3803 SV_CWD_RETURN_UNDEF;
3804 }
3805
3806 while ((dp = PerlDir_read(dir)) != NULL) {
877f6a72 3807#ifdef DIRNAMLEN
4373e329 3808 const int namelen = dp->d_namlen;
877f6a72 3809#else
4373e329 3810 const int namelen = strlen(dp->d_name);
877f6a72 3811#endif
3aed30dc
HS		 3812 /* skip . and .. */
3813 if (SV_CWD_ISDOT(dp)) {
3814 continue;
3815 }
3816
3817 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3818 SV_CWD_RETURN_UNDEF;
3819 }
3820
3821 tdev = statbuf.st_dev;
3822 tino = statbuf.st_ino;
3823 if (tino == oino && tdev == odev) {
3824 break;
3825 }
cb5953d6
JH		 3826 }
3827
3aed30dc
HS		 3828 if (!dp) {
3829 SV_CWD_RETURN_UNDEF;
3830 }
3831
3832 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3833 SV_CWD_RETURN_UNDEF;
3834 }
877f6a72 3835
3aed30dc
HS		 3836 SvGROW(sv, pathlen + namelen + 1);
3837
3838 if (pathlen) {
3839 /* shift down */
95a20fc0 3840 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3aed30dc 3841 }
877f6a72 3842
3aed30dc
HS		 3843 /* prepend current directory to the front */
3844 *SvPVX(sv) = '/';
3845 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3846 pathlen += (namelen + 1);
877f6a72
NIS		 3847
3848#ifdef VOID_CLOSEDIR
3aed30dc 3849 PerlDir_close(dir);
877f6a72 3850#else
3aed30dc
HS		 3851 if (PerlDir_close(dir) < 0) {
3852 SV_CWD_RETURN_UNDEF;
3853 }
877f6a72
NIS		 3854#endif
3855 }
3856
60e110a8 3857 if (pathlen) {
3aed30dc
HS		 3858 SvCUR_set(sv, pathlen);
3859 *SvEND(sv) = '\0';
3860 SvPOK_only(sv);
877f6a72 3861
95a20fc0 3862 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3aed30dc
HS		 3863 SV_CWD_RETURN_UNDEF;
3864 }
877f6a72
NIS		 3865 }
3866 if (PerlLIO_stat(".", &statbuf) < 0) {
3aed30dc 3867 SV_CWD_RETURN_UNDEF;
877f6a72
NIS		 3868 }
3869
3870 cdev = statbuf.st_dev;
3871 cino = statbuf.st_ino;
3872
3873 if (cdev != orig_cdev || cino != orig_cino) {
3aed30dc
HS		 3874 Perl_croak(aTHX_ "Unstable directory path, "
3875 "current directory changed unexpectedly");
877f6a72 3876 }
877f6a72
NIS		 3877
3878 return TRUE;
793b8d8e
JH		 3879#endif
3880
877f6a72
NIS		 3881#else
3882 return FALSE;
3883#endif
3884}
3885
f4758303 3886/*
b0f01acb
JP		 3887=for apidoc scan_version
3888
3889Returns a pointer to the next character after the parsed
3890version string, as well as upgrading the passed in SV to
3891an RV.
3892
3893Function must be called with an already existing SV like
3894
137d6fc0
JP		 3895 sv = newSV(0);
3896 s = scan_version(s,SV *sv, bool qv);
b0f01acb
JP		 3897
3898Performs some preprocessing to the string to ensure that
3899it has the correct characteristics of a version. Flags the
3900object if it contains an underscore (which denotes this
137d6fc0
JP		 3901is a alpha version). The boolean qv denotes that the version
3902should be interpreted as if it had multiple decimals, even if
3903it doesn't.
b0f01acb
JP		 3904
3905=cut
3906*/
3907
9137345a 3908const char *
e1ec3a88 3909Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
b0f01acb 3910{
e0218a61 3911 const char *start;
9137345a
JP		 3912 const char *pos;
3913 const char *last;
3914 int saw_period = 0;
cb5772bb 3915 int alpha = 0;
9137345a
JP		 3916 int width = 3;
3917 AV *av = newAV();
cb5772bb 3918 SV *hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
9137345a 3919 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
cb5772bb 3920
3a242bf8
NC		 3921#ifndef NODEFAULT_SHAREKEYS
3922 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3923#endif
9137345a 3924
e0218a61
JP		 3925 while (isSPACE(*s)) /* leading whitespace is OK */
3926 s++;
3927
9137345a
JP		 3928 if (*s == 'v') {
3929 s++; /* get past 'v' */
3930 qv = 1; /* force quoted version processing */
3931 }
3932
e0218a61 3933 start = last = pos = s;
9137345a
JP		 3934
3935 /* pre-scan the input string to check for decimals/underbars */
ad63d80f
JP		 3936 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3937 {
3938 if ( *pos == '.' )
3939 {
cb5772bb 3940 if ( alpha )
5f89c282 3941 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
ad63d80f 3942 saw_period++ ;
9137345a 3943 last = pos;
46314c13 3944 }
ad63d80f
JP		 3945 else if ( *pos == '_' )
3946 {
cb5772bb 3947 if ( alpha )
5f89c282 3948 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
cb5772bb 3949 alpha = 1;
9137345a 3950 width = pos - last - 1; /* natural width of sub-version */
ad63d80f
JP		 3951 }
3952 pos++;
3953 }
ad63d80f 3954
e0218a61 3955 if ( saw_period > 1 )
137d6fc0 3956 qv = 1; /* force quoted version processing */
9137345a
JP		 3957
3958 pos = s;
3959
3960 if ( qv )
cb5772bb
RGS		 3961 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
3962 if ( alpha )
3963 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
9137345a
JP		 3964 if ( !qv && width < 3 )
3965 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3966
ad63d80f 3967 while (isDIGIT(*pos))
46314c13 3968 pos++;
ad63d80f
JP		 3969 if (!isALPHA(*pos)) {
3970 I32 rev;
3971
ad63d80f
JP		 3972 for (;;) {
3973 rev = 0;
3974 {
129318bd 3975 /* this is atoi() that delimits on underscores */
9137345a 3976 const char *end = pos;
129318bd
JP		 3977 I32 mult = 1;
3978 I32 orev;
9137345a 3979
129318bd
JP		 3980 /* the following if() will only be true after the decimal
3981 * point of a version originally created with a bare
3982 * floating point number, i.e. not quoted in any way
3983 */
e0218a61 3984 if ( !qv && s > start && saw_period == 1 ) {
c76df65e 3985 mult *= 100;
129318bd
JP		 3986 while ( s < end ) {
3987 orev = rev;
3988 rev += (*s - '0') * mult;
3989 mult /= 10;
32fdb065 3990 if ( PERL_ABS(orev) > PERL_ABS(rev) )
129318bd
JP		 3991 Perl_croak(aTHX_ "Integer overflow in version");
3992 s++;
9137345a
JP		 3993 if ( *s == '_' )
3994 s++;
129318bd
JP		 3995 }
3996 }
3997 else {
3998 while (--end >= s) {
3999 orev = rev;
4000 rev += (*end - '0') * mult;
4001 mult *= 10;
32fdb065 4002 if ( PERL_ABS(orev) > PERL_ABS(rev) )
129318bd
JP		 4003 Perl_croak(aTHX_ "Integer overflow in version");
4004 }
4005 }
4006 }
9137345a 4007
129318bd 4008 /* Append revision */
9137345a
JP		 4009 av_push(av, newSViv(rev));
4010 if ( *pos == '.' && isDIGIT(pos[1]) )
4011 s = ++pos;
4012 else if ( *pos == '_' && isDIGIT(pos[1]) )
ad63d80f
JP		 4013 s = ++pos;
4014 else if ( isDIGIT(*pos) )
4015 s = pos;
b0f01acb 4016 else {
ad63d80f
JP		 4017 s = pos;
4018 break;
4019 }
9137345a
JP		 4020 if ( qv ) {
4021 while ( isDIGIT(*pos) )
4022 pos++;
4023 }
4024 else {
4025 int digits = 0;
4026 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4027 if ( *pos != '_' )
4028 digits++;
4029 pos++;
4030 }
b0f01acb
JP		 4031 }
4032 }
4033 }
9137345a
JP		 4034 if ( qv ) { /* quoted versions always get at least three terms*/
4035 I32 len = av_len(av);
4edfc503
NC		 4036 /* This for loop appears to trigger a compiler bug on OS X, as it
4037 loops infinitely. Yes, len is negative. No, it makes no sense.
4038 Compiler in question is:
4039 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4040 for ( len = 2 - len; len > 0; len-- )
4041 av_push((AV *)sv, newSViv(0));
4042 */
4043 len = 2 - len;
4044 while (len-- > 0)
9137345a 4045 av_push(av, newSViv(0));
b9381830 4046 }
9137345a
JP		 4047
4048 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4049 av_push(av, newSViv(0));
4050
4051 /* And finally, store the AV in the hash */
cb5772bb 4052 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
9137345a 4053 return s;
b0f01acb
JP		 4054}
4055
4056/*
4057=for apidoc new_version
4058
4059Returns a new version object based on the passed in SV:
4060
4061 SV *sv = new_version(SV *ver);
4062
4063Does not alter the passed in ver SV. See "upg_version" if you
4064want to upgrade the SV.
4065
4066=cut
4067*/
4068
4069SV *
4070Perl_new_version(pTHX_ SV *ver)
4071{
2d03de9c 4072 SV * const rv = newSV(0);
d7aa5382
JP		 4073 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4074 {
4075 I32 key;
53c1dcc0 4076 AV * const av = newAV();
9137345a
JP		 4077 AV *sav;
4078 /* This will get reblessed later if a derived class*/
e0218a61 4079 SV * const hv = newSVrv(rv, "version");
9137345a 4080 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3a242bf8
NC		 4081#ifndef NODEFAULT_SHAREKEYS
4082 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4083#endif
9137345a
JP		 4084
4085 if ( SvROK(ver) )
4086 ver = SvRV(ver);
4087
4088 /* Begin copying all of the elements */
4089 if ( hv_exists((HV *)ver, "qv", 2) )
4090 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4091
4092 if ( hv_exists((HV *)ver, "alpha", 5) )
4093 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4094
4095 if ( hv_exists((HV*)ver, "width", 5 ) )
d7aa5382 4096 {
53c1dcc0 4097 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
9137345a 4098 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
d7aa5382 4099 }
9137345a 4100
cb5772bb 4101 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
9137345a
JP		 4102 /* This will get reblessed later if a derived class*/
4103 for ( key = 0; key <= av_len(sav); key++ )
4104 {
4105 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4106 av_push(av, newSViv(rev));
4107 }
4108
cb5772bb 4109 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
d7aa5382
JP		 4110 return rv;
4111 }
ad63d80f 4112#ifdef SvVOK
137d6fc0 4113 if ( SvVOK(ver) ) { /* already a v-string */
e0218a61 4114 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
a4d60858 4115 const STRLEN len = mg->mg_len;
2d03de9c 4116 char * const version = savepvn( (const char*)mg->mg_ptr, len);
a4d60858 4117 sv_setpvn(rv,version,len);
137d6fc0 4118 Safefree(version);
b0f01acb 4119 }
137d6fc0 4120 else {
ad63d80f 4121#endif
137d6fc0
JP		 4122 sv_setsv(rv,ver); /* make a duplicate */
4123#ifdef SvVOK
26ec6fc3 4124 }
137d6fc0
JP		 4125#endif
4126 upg_version(rv);
b0f01acb
JP		 4127 return rv;
4128}
4129
4130/*
4131=for apidoc upg_version
4132
4133In-place upgrade of the supplied SV to a version object.
4134
4135 SV *sv = upg_version(SV *sv);
4136
4137Returns a pointer to the upgraded SV.
4138
4139=cut
4140*/
4141
4142SV *
ad63d80f 4143Perl_upg_version(pTHX_ SV *ver)
b0f01acb 4144{
137d6fc0
JP		 4145 char *version;
4146 bool qv = 0;
4147
4148 if ( SvNOK(ver) ) /* may get too much accuracy */
4149 {
4150 char tbuf[64];
4151 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4152 version = savepv(tbuf);
4153 }
ad63d80f 4154#ifdef SvVOK
137d6fc0 4155 else if ( SvVOK(ver) ) { /* already a v-string */
2d03de9c 4156 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
ad63d80f 4157 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
137d6fc0 4158 qv = 1;
b0f01acb 4159 }
ad63d80f 4160#endif
137d6fc0
JP		 4161 else /* must be a string or something like a string */
4162 {
9137345a 4163 version = savepv(SvPV_nolen(ver));
137d6fc0
JP		 4164 }
4165 (void)scan_version(version, ver, qv);
4166 Safefree(version);
ad63d80f 4167 return ver;
b0f01acb
JP		 4168}
4169
e0218a61
JP		 4170/*
4171=for apidoc vverify
4172
4173Validates that the SV contains a valid version object.
4174
4175 bool vverify(SV *vobj);
4176
4177Note that it only confirms the bare minimum structure (so as not to get
4178confused by derived classes which may contain additional hash entries):
4179
4180=over 4
4181
cb5772bb 4182=item * The SV contains a [reference to a] hash
e0218a61
JP		 4183
4184=item * The hash contains a "version" key
4185
cb5772bb 4186=item * The "version" key has [a reference to] an AV as its value
e0218a61
JP		 4187
4188=back
4189
4190=cut
4191*/
4192
4193bool
4194Perl_vverify(pTHX_ SV *vs)
4195{
4196 SV *sv;
4197 if ( SvROK(vs) )
4198 vs = SvRV(vs);
4199
4200 /* see if the appropriate elements exist */
4201 if ( SvTYPE(vs) == SVt_PVHV
4202 && hv_exists((HV*)vs, "version", 7)
cb5772bb 4203 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
e0218a61
JP		 4204 && SvTYPE(sv) == SVt_PVAV )
4205 return TRUE;
4206 else
4207 return FALSE;
4208}
b0f01acb
JP		 4209
4210/*
4211=for apidoc vnumify
4212
ad63d80f
JP		 4213Accepts a version object and returns the normalized floating
4214point representation. Call like:
b0f01acb 4215
ad63d80f 4216 sv = vnumify(rv);
b0f01acb 4217
ad63d80f
JP		 4218NOTE: you can pass either the object directly or the SV
4219contained within the RV.
b0f01acb
JP		 4220
4221=cut
4222*/
4223
4224SV *
ad63d80f 4225Perl_vnumify(pTHX_ SV *vs)
b0f01acb 4226{
ad63d80f 4227 I32 i, len, digit;
9137345a
JP		 4228 int width;
4229 bool alpha = FALSE;
53c1dcc0 4230 SV * const sv = newSV(0);
9137345a 4231 AV *av;
ad63d80f
JP		 4232 if ( SvROK(vs) )
4233 vs = SvRV(vs);
9137345a 4234
e0218a61
JP		 4235 if ( !vverify(vs) )
4236 Perl_croak(aTHX_ "Invalid version object");
4237
9137345a
JP		 4238 /* see if various flags exist */
4239 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4240 alpha = TRUE;
4241 if ( hv_exists((HV*)vs, "width", 5 ) )
4242 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4243 else
4244 width = 3;
4245
4246
4247 /* attempt to retrieve the version array */
cb5772bb 4248 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
53c1dcc0 4249 sv_catpvn(sv,"0",1);
9137345a
JP		 4250 return sv;
4251 }
4252
4253 len = av_len(av);
46314c13
JP		 4254 if ( len == -1 )
4255 {
b66123c5 4256 sv_catpvn(sv,"0",1);
46314c13
JP		 4257 return sv;
4258 }
9137345a
JP		 4259
4260 digit = SvIV(*av_fetch(av, 0, 0));
261fcdab 4261 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
13f8f398 4262 for ( i = 1 ; i < len ; i++ )
b0f01acb 4263 {
9137345a
JP		 4264 digit = SvIV(*av_fetch(av, i, 0));
4265 if ( width < 3 ) {
53c1dcc0
AL		 4266 const int denom = (int)pow(10,(3-width));
4267 const div_t term = div((int)PERL_ABS(digit),denom);
261fcdab 4268 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
9137345a
JP		 4269 }
4270 else {
261fcdab 4271 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
9137345a 4272 }
b0f01acb 4273 }
13f8f398
JP		 4274
4275 if ( len > 0 )
4276 {
9137345a
JP		 4277 digit = SvIV(*av_fetch(av, len, 0));
4278 if ( alpha && width == 3 ) /* alpha version */
e0218a61 4279 sv_catpvn(sv,"_",1);
261fcdab 4280 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
13f8f398 4281 }
e0218a61 4282 else /* len == 0 */
13f8f398 4283 {
e0218a61 4284 sv_catpvn(sv,"000",3);
13f8f398 4285 }
b0f01acb
JP		 4286 return sv;
4287}
4288
4289/*
b9381830 4290=for apidoc vnormal
b0f01acb 4291
ad63d80f
JP		 4292Accepts a version object and returns the normalized string
4293representation. Call like:
b0f01acb 4294
b9381830 4295 sv = vnormal(rv);
b0f01acb 4296
ad63d80f
JP		 4297NOTE: you can pass either the object directly or the SV
4298contained within the RV.
b0f01acb
JP		 4299
4300=cut
4301*/
4302
4303SV *
b9381830 4304Perl_vnormal(pTHX_ SV *vs)
b0f01acb 4305{
ad63d80f 4306 I32 i, len, digit;
9137345a 4307 bool alpha = FALSE;
2d03de9c 4308 SV * const sv = newSV(0);
9137345a 4309 AV *av;
ad63d80f
JP		 4310 if ( SvROK(vs) )
4311 vs = SvRV(vs);
9137345a 4312
e0218a61
JP		 4313 if ( !vverify(vs) )
4314 Perl_croak(aTHX_ "Invalid version object");
4315
9137345a
JP		 4316 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4317 alpha = TRUE;
cb5772bb 4318 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
9137345a
JP		 4319
4320 len = av_len(av);
e0218a61
JP		 4321 if ( len == -1 )
4322 {
b66123c5 4323 sv_catpvn(sv,"",0);
46314c13
JP		 4324 return sv;
4325 }
9137345a 4326 digit = SvIV(*av_fetch(av, 0, 0));
261fcdab 4327 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
cb5772bb 4328 for ( i = 1 ; i < len ; i++ ) {
9137345a 4329 digit = SvIV(*av_fetch(av, i, 0));
261fcdab 4330 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
9137345a
JP		 4331 }
4332
e0218a61
JP		 4333 if ( len > 0 )
4334 {
9137345a
JP		 4335 /* handle last digit specially */
4336 digit = SvIV(*av_fetch(av, len, 0));
4337 if ( alpha )
261fcdab 4338 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
ad63d80f 4339 else
261fcdab 4340 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
b0f01acb 4341 }
9137345a 4342
137d6fc0
JP		 4343 if ( len <= 2 ) { /* short version, must be at least three */
4344 for ( len = 2 - len; len != 0; len-- )
b66123c5 4345 sv_catpvn(sv,".0",2);
137d6fc0 4346 }
b0f01acb 4347 return sv;
9137345a 4348}
b0f01acb 4349
ad63d80f 4350/*
b9381830
JP		 4351=for apidoc vstringify
4352
4353In order to maintain maximum compatibility with earlier versions
4354of Perl, this function will return either the floating point
4355notation or the multiple dotted notation, depending on whether
4356the original version contained 1 or more dots, respectively
4357
4358=cut
4359*/
4360
4361SV *
4362Perl_vstringify(pTHX_ SV *vs)
4363{
b9381830
JP		 4364 if ( SvROK(vs) )
4365 vs = SvRV(vs);
e0218a61
JP		 4366
4367 if ( !vverify(vs) )
4368 Perl_croak(aTHX_ "Invalid version object");
4369
9137345a 4370 if ( hv_exists((HV *)vs, "qv", 2) )
cb5772bb 4371 return vnormal(vs);
9137345a 4372 else
cb5772bb 4373 return vnumify(vs);
b9381830
JP		 4374}
4375
4376/*
ad63d80f
JP		 4377=for apidoc vcmp
4378
4379Version object aware cmp. Both operands must already have been
4380converted into version objects.
4381
4382=cut
4383*/
4384
4385int
9137345a 4386Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
ad63d80f
JP		 4387{
4388 I32 i,l,m,r,retval;
9137345a
JP		 4389 bool lalpha = FALSE;
4390 bool ralpha = FALSE;
4391 I32 left = 0;
4392 I32 right = 0;
4393 AV *lav, *rav;
4394 if ( SvROK(lhv) )
4395 lhv = SvRV(lhv);
4396 if ( SvROK(rhv) )
4397 rhv = SvRV(rhv);
4398
e0218a61
JP		 4399 if ( !vverify(lhv) )
4400 Perl_croak(aTHX_ "Invalid version object");
4401
4402 if ( !vverify(rhv) )
4403 Perl_croak(aTHX_ "Invalid version object");
4404
9137345a 4405 /* get the left hand term */
cb5772bb 4406 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
9137345a
JP		 4407 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4408 lalpha = TRUE;
4409
4410 /* and the right hand term */
cb5772bb 4411 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
9137345a
JP		 4412 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4413 ralpha = TRUE;
4414
4415 l = av_len(lav);
4416 r = av_len(rav);
ad63d80f
JP		 4417 m = l < r ? l : r;
4418 retval = 0;
4419 i = 0;
4420 while ( i <= m && retval == 0 )
4421 {
9137345a
JP		 4422 left = SvIV(*av_fetch(lav,i,0));
4423 right = SvIV(*av_fetch(rav,i,0));
4424 if ( left < right )
ad63d80f 4425 retval = -1;
9137345a 4426 if ( left > right )
ad63d80f
JP		 4427 retval = +1;
4428 i++;
4429 }
4430
9137345a
JP		 4431 /* tiebreaker for alpha with identical terms */
4432 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4433 {
4434 if ( lalpha && !ralpha )
4435 {
4436 retval = -1;
4437 }
4438 else if ( ralpha && !lalpha)
4439 {
4440 retval = +1;
4441 }
4442 }
4443
137d6fc0 4444 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
129318bd 4445 {
137d6fc0 4446 if ( l < r )
129318bd 4447 {
137d6fc0
JP		 4448 while ( i <= r && retval == 0 )
4449 {
9137345a 4450 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
137d6fc0
JP		 4451 retval = -1; /* not a match after all */
4452 i++;
4453 }
4454 }
4455 else
4456 {
4457 while ( i <= l && retval == 0 )
4458 {
9137345a 4459 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
137d6fc0
JP		 4460 retval = +1; /* not a match after all */
4461 i++;
4462 }
129318bd
JP		 4463 }
4464 }
ad63d80f
JP		 4465 return retval;
4466}
4467
c95c94b1 4468#if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
2bc69dc4
NIS		 4469# define EMULATE_SOCKETPAIR_UDP
4470#endif
4471
4472#ifdef EMULATE_SOCKETPAIR_UDP
02fc2eee
NC		 4473static int
4474S_socketpair_udp (int fd[2]) {
e10bb1e9 4475 dTHX;
02fc2eee
NC		 4476 /* Fake a datagram socketpair using UDP to localhost. */
4477 int sockets[2] = {-1, -1};
4478 struct sockaddr_in addresses[2];
4479 int i;
3aed30dc 4480 Sock_size_t size = sizeof(struct sockaddr_in);
ae92b34e 4481 unsigned short port;
02fc2eee
NC		 4482 int got;
4483
3aed30dc 4484 memset(&addresses, 0, sizeof(addresses));
02fc2eee
NC		 4485 i = 1;
4486 do {
3aed30dc
HS		 4487 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4488 if (sockets[i] == -1)
4489 goto tidy_up_and_fail;
4490
4491 addresses[i].sin_family = AF_INET;
4492 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4493 addresses[i].sin_port = 0; /* kernel choses port. */
4494 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4495 sizeof(struct sockaddr_in)) == -1)
4496 goto tidy_up_and_fail;
02fc2eee
NC		 4497 } while (i--);
4498
4499 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4500 for each connect the other socket to it. */
4501 i = 1;
4502 do {
3aed30dc
HS		 4503 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4504 &size) == -1)
4505 goto tidy_up_and_fail;
4506 if (size != sizeof(struct sockaddr_in))
4507 goto abort_tidy_up_and_fail;
4508 /* !1 is 0, !0 is 1 */
4509 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4510 sizeof(struct sockaddr_in)) == -1)
4511 goto tidy_up_and_fail;
02fc2eee
NC		 4512 } while (i--);
4513
4514 /* Now we have 2 sockets connected to each other. I don't trust some other
4515 process not to have already sent a packet to us (by random) so send
4516 a packet from each to the other. */
4517 i = 1;
4518 do {
3aed30dc
HS		 4519 /* I'm going to send my own port number. As a short.
4520 (Who knows if someone somewhere has sin_port as a bitfield and needs
4521 this routine. (I'm assuming crays have socketpair)) */
4522 port = addresses[i].sin_port;
4523 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4524 if (got != sizeof(port)) {
4525 if (got == -1)
4526 goto tidy_up_and_fail;
4527 goto abort_tidy_up_and_fail;
4528 }
02fc2eee
NC		 4529 } while (i--);
4530
4531 /* Packets sent. I don't trust them to have arrived though.
4532 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4533 connect to localhost will use a second kernel thread. In 2.6 the
4534 first thread running the connect() returns before the second completes,
4535 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4536 returns 0. Poor programs have tripped up. One poor program's authors'
4537 had a 50-1 reverse stock split. Not sure how connected these were.)
4538 So I don't trust someone not to have an unpredictable UDP stack.
4539 */
4540
4541 {
3aed30dc
HS		 4542 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4543 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4544 fd_set rset;
4545
4546 FD_ZERO(&rset);
4547 FD_SET(sockets[0], &rset);
4548 FD_SET(sockets[1], &rset);
4549
4550 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4551 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4552 || !FD_ISSET(sockets[1], &rset)) {
4553 /* I hope this is portable and appropriate. */
4554 if (got == -1)
4555 goto tidy_up_and_fail;
4556 goto abort_tidy_up_and_fail;
4557 }
02fc2eee 4558 }
f4758303 4559
02fc2eee
NC		 4560 /* And the paranoia department even now doesn't trust it to have arrive
4561 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4562 {
3aed30dc
HS		 4563 struct sockaddr_in readfrom;
4564 unsigned short buffer[2];
02fc2eee 4565
3aed30dc
HS		 4566 i = 1;
4567 do {
02fc2eee 4568#ifdef MSG_DONTWAIT
3aed30dc
HS		 4569 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4570 sizeof(buffer), MSG_DONTWAIT,
4571 (struct sockaddr *) &readfrom, &size);
02fc2eee 4572#else
3aed30dc
HS		 4573 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4574 sizeof(buffer), 0,
4575 (struct sockaddr *) &readfrom, &size);
e10bb1e9 4576#endif
02fc2eee 4577
3aed30dc
HS		 4578 if (got == -1)
4579 goto tidy_up_and_fail;
4580 if (got != sizeof(port)
4581 || size != sizeof(struct sockaddr_in)
4582 /* Check other socket sent us its port. */
4583 || buffer[0] != (unsigned short) addresses[!i].sin_port
4584 /* Check kernel says we got the datagram from that socket */
4585 || readfrom.sin_family != addresses[!i].sin_family
4586 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4587 || readfrom.sin_port != addresses[!i].sin_port)
4588 goto abort_tidy_up_and_fail;
4589 } while (i--);
02fc2eee
NC		 4590 }
4591 /* My caller (my_socketpair) has validated that this is non-NULL */
4592 fd[0] = sockets[0];
4593 fd[1] = sockets[1];
4594 /* I hereby declare this connection open. May God bless all who cross
4595 her. */
4596 return 0;
4597
4598 abort_tidy_up_and_fail:
4599 errno = ECONNABORTED;
4600 tidy_up_and_fail:
4601 {
4373e329 4602 const int save_errno = errno;
3aed30dc
HS		 4603 if (sockets[0] != -1)
4604 PerlLIO_close(sockets[0]);
4605 if (sockets[1] != -1)
4606 PerlLIO_close(sockets[1]);
4607 errno = save_errno;
4608 return -1;
02fc2eee
NC		 4609 }
4610}
85ca448a 4611#endif /* EMULATE_SOCKETPAIR_UDP */
02fc2eee 4612
b5ac89c3 4613#if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
02fc2eee
NC		 4614int
4615Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4616 /* Stevens says that family must be AF_LOCAL, protocol 0.
2948e0bd 4617 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
e10bb1e9 4618 dTHX;
02fc2eee
NC		 4619 int listener = -1;
4620 int connector = -1;
4621 int acceptor = -1;
4622 struct sockaddr_in listen_addr;
4623 struct sockaddr_in connect_addr;
4624 Sock_size_t size;
4625
50458334
JH		 4626 if (protocol
4627#ifdef AF_UNIX
4628 || family != AF_UNIX
4629#endif
3aed30dc
HS		 4630 ) {
4631 errno = EAFNOSUPPORT;
4632 return -1;
02fc2eee 4633 }
2948e0bd 4634 if (!fd) {
3aed30dc
HS		 4635 errno = EINVAL;
4636 return -1;
2948e0bd 4637 }
02fc2eee 4638
2bc69dc4 4639#ifdef EMULATE_SOCKETPAIR_UDP
02fc2eee 4640 if (type == SOCK_DGRAM)
3aed30dc 4641 return S_socketpair_udp(fd);
2bc69dc4 4642#endif
02fc2eee 4643
3aed30dc 4644 listener = PerlSock_socket(AF_INET, type, 0);
02fc2eee 4645 if (listener == -1)
3aed30dc
HS		 4646 return -1;
4647 memset(&listen_addr, 0, sizeof(listen_addr));
02fc2eee 4648 listen_addr.sin_family = AF_INET;
3aed30dc 4649 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
02fc2eee 4650 listen_addr.sin_port = 0; /* kernel choses port. */
3aed30dc
HS		 4651 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4652 sizeof(listen_addr)) == -1)
4653 goto tidy_up_and_fail;
e10bb1e9 4654 if (PerlSock_listen(listener, 1) == -1)
3aed30dc 4655 goto tidy_up_and_fail;
02fc2eee 4656
3aed30dc 4657 connector = PerlSock_socket(AF_INET, type, 0);
02fc2eee 4658 if (connector == -1)
3aed30dc 4659 goto tidy_up_and_fail;
02fc2eee 4660 /* We want to find out the port number to connect to. */
3aed30dc
HS		 4661 size = sizeof(connect_addr);
4662 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4663 &size) == -1)
4664 goto tidy_up_and_fail;
4665 if (size != sizeof(connect_addr))
4666 goto abort_tidy_up_and_fail;
e10bb1e9 4667 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
3aed30dc
HS		 4668 sizeof(connect_addr)) == -1)
4669 goto tidy_up_and_fail;
02fc2eee 4670
3aed30dc
HS		 4671 size = sizeof(listen_addr);
4672 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4673 &size);
02fc2eee 4674 if (acceptor == -1)
3aed30dc
HS		 4675 goto tidy_up_and_fail;
4676 if (size != sizeof(listen_addr))
4677 goto abort_tidy_up_and_fail;
4678 PerlLIO_close(listener);
02fc2eee
NC		 4679 /* Now check we are talking to ourself by matching port and host on the
4680 two sockets. */
3aed30dc
HS		 4681 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4682 &size) == -1)
4683 goto tidy_up_and_fail;
4684 if (size != sizeof(connect_addr)
4685 || listen_addr.sin_family != connect_addr.sin_family
4686 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4687 || listen_addr.sin_port != connect_addr.sin_port) {
4688 goto abort_tidy_up_and_fail;
02fc2eee
NC		 4689 }
4690 fd[0] = connector;
4691 fd[1] = acceptor;
4692 return 0;
4693
4694 abort_tidy_up_and_fail:
27da23d5
JH		 4695#ifdef ECONNABORTED
4696 errno = ECONNABORTED; /* This would be the standard thing to do. */
4697#else
4698# ifdef ECONNREFUSED
4699 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4700# else
4701 errno = ETIMEDOUT; /* Desperation time. */
4702# endif
4703#endif
02fc2eee
NC		 4704 tidy_up_and_fail:
4705 {
3aed30dc
HS		 4706 int save_errno = errno;
4707 if (listener != -1)
4708 PerlLIO_close(listener);
4709 if (connector != -1)
4710 PerlLIO_close(connector);
4711 if (acceptor != -1)
4712 PerlLIO_close(acceptor);
4713 errno = save_errno;
4714 return -1;
02fc2eee
NC		 4715 }
4716}
85ca448a 4717#else
48ea76d1
JH		 4718/* In any case have a stub so that there's code corresponding
4719 * to the my_socketpair in global.sym. */
4720int
4721Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
daf16542 4722#ifdef HAS_SOCKETPAIR
48ea76d1 4723 return socketpair(family, type, protocol, fd);
daf16542
JH		 4724#else
4725 return -1;
4726#endif
48ea76d1
JH		 4727}
4728#endif
4729
68795e93
NIS		 4730/*
4731
4732=for apidoc sv_nosharing
4733
4734Dummy routine which "shares" an SV when there is no sharing module present.
4735Exists to avoid test for a NULL function pointer and because it could potentially warn under
4736some level of strict-ness.
4737
4738=cut
4739*/
4740
4741void
4742Perl_sv_nosharing(pTHX_ SV *sv)
4743{
53c1dcc0 4744 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4745}
4746
4747/*
4748=for apidoc sv_nolocking
4749
4750Dummy routine which "locks" an SV when there is no locking module present.
4751Exists to avoid test for a NULL function pointer and because it could potentially warn under
4752some level of strict-ness.
4753
4754=cut
4755*/
4756
4757void
4758Perl_sv_nolocking(pTHX_ SV *sv)
4759{
53c1dcc0 4760 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4761}
4762
4763
4764/*
4765=for apidoc sv_nounlocking
4766
4767Dummy routine which "unlocks" an SV when there is no locking module present.
4768Exists to avoid test for a NULL function pointer and because it could potentially warn under
4769some level of strict-ness.
4770
4771=cut
4772*/
4773
4774void
4775Perl_sv_nounlocking(pTHX_ SV *sv)
4776{
53c1dcc0 4777 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4778}
4779
a05d7ebb 4780U32
e1ec3a88 4781Perl_parse_unicode_opts(pTHX_ const char **popt)
a05d7ebb 4782{
e1ec3a88 4783 const char *p = *popt;
a05d7ebb
JH		 4784 U32 opt = 0;
4785
4786 if (*p) {
4787 if (isDIGIT(*p)) {
4788 opt = (U32) atoi(p);
4789 while (isDIGIT(*p)) p++;
7c91f477 4790 if (*p && *p != '\n' && *p != '\r')
a05d7ebb
JH		 4791 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4792 }
4793 else {
4794 for (; *p; p++) {
4795 switch (*p) {
4796 case PERL_UNICODE_STDIN:
4797 opt |= PERL_UNICODE_STDIN_FLAG; break;
4798 case PERL_UNICODE_STDOUT:
4799 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4800 case PERL_UNICODE_STDERR:
4801 opt |= PERL_UNICODE_STDERR_FLAG; break;
4802 case PERL_UNICODE_STD:
4803 opt |= PERL_UNICODE_STD_FLAG; break;
4804 case PERL_UNICODE_IN:
4805 opt |= PERL_UNICODE_IN_FLAG; break;
4806 case PERL_UNICODE_OUT:
4807 opt |= PERL_UNICODE_OUT_FLAG; break;
4808 case PERL_UNICODE_INOUT:
4809 opt |= PERL_UNICODE_INOUT_FLAG; break;
4810 case PERL_UNICODE_LOCALE:
4811 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4812 case PERL_UNICODE_ARGV:
4813 opt |= PERL_UNICODE_ARGV_FLAG; break;
4814 default:
7c91f477
JH		 4815 if (*p != '\n' && *p != '\r')
4816 Perl_croak(aTHX_
4817 "Unknown Unicode option letter '%c'", *p);
a05d7ebb
JH		 4818 }
4819 }
4820 }
4821 }
4822 else
4823 opt = PERL_UNICODE_DEFAULT_FLAGS;
4824
4825 if (opt & ~PERL_UNICODE_ALL_FLAGS)
06e66572 4826 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
a05d7ebb
JH		 4827 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4828
4829 *popt = p;
4830
4831 return opt;
4832}
4833
132efe8b
JH		 4834U32
4835Perl_seed(pTHX)
4836{
4837 /*
4838 * This is really just a quick hack which grabs various garbage
4839 * values. It really should be a real hash algorithm which
4840 * spreads the effect of every input bit onto every output bit,
4841 * if someone who knows about such things would bother to write it.
4842 * Might be a good idea to add that function to CORE as well.
4843 * No numbers below come from careful analysis or anything here,
4844 * except they are primes and SEED_C1 > 1E6 to get a full-width
4845 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4846 * probably be bigger too.
4847 */
4848#if RANDBITS > 16
4849# define SEED_C1 1000003
4850#define SEED_C4 73819
4851#else
4852# define SEED_C1 25747
4853#define SEED_C4 20639
4854#endif
4855#define SEED_C2 3
4856#define SEED_C3 269
4857#define SEED_C5 26107
4858
4859#ifndef PERL_NO_DEV_RANDOM
4860 int fd;
4861#endif
4862 U32 u;
4863#ifdef VMS
4864# include <starlet.h>
4865 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4866 * in 100-ns units, typically incremented ever 10 ms. */
4867 unsigned int when[2];
4868#else
4869# ifdef HAS_GETTIMEOFDAY
4870 struct timeval when;
4871# else
4872 Time_t when;
4873# endif
4874#endif
4875
4876/* This test is an escape hatch, this symbol isn't set by Configure. */
4877#ifndef PERL_NO_DEV_RANDOM
4878#ifndef PERL_RANDOM_DEVICE
4879 /* /dev/random isn't used by default because reads from it will block
4880 * if there isn't enough entropy available. You can compile with
4881 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4882 * is enough real entropy to fill the seed. */
4883# define PERL_RANDOM_DEVICE "/dev/urandom"
4884#endif
4885 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4886 if (fd != -1) {
27da23d5 4887 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
132efe8b
JH		 4888 u = 0;
4889 PerlLIO_close(fd);
4890 if (u)
4891 return u;
4892 }
4893#endif
4894
4895#ifdef VMS
4896 _ckvmssts(sys$gettim(when));
4897 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4898#else
4899# ifdef HAS_GETTIMEOFDAY
4900 PerlProc_gettimeofday(&when,NULL);
4901 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4902# else
4903 (void)time(&when);
4904 u = (U32)SEED_C1 * when;
4905# endif
4906#endif
4907 u += SEED_C3 * (U32)PerlProc_getpid();
4908 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4909#ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4910 u += SEED_C5 * (U32)PTR2UV(&when);
4911#endif
4912 return u;
4913}
4914
bed60192 4915UV
a783c5f4 4916Perl_get_hash_seed(pTHX)
bed60192 4917{
e1ec3a88 4918 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
bed60192
JH		 4919 UV myseed = 0;
4920
4921 if (s)
4922 while (isSPACE(*s)) s++;
4923 if (s && isDIGIT(*s))
4924 myseed = (UV)Atoul(s);
4925 else
4926#ifdef USE_HASH_SEED_EXPLICIT
4927 if (s)
4928#endif
4929 {
4930 /* Compute a random seed */
4931 (void)seedDrand01((Rand_seed_t)seed());
bed60192
JH		 4932 myseed = (UV)(Drand01() * (NV)UV_MAX);
4933#if RANDBITS < (UVSIZE * 8)
4934 /* Since there are not enough randbits to to reach all
4935 * the bits of a UV, the low bits might need extra
4936 * help. Sum in another random number that will
4937 * fill in the low bits. */
4938 myseed +=
4939 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4940#endif /* RANDBITS < (UVSIZE * 8) */
6cfd5ea7
JH		 4941 if (myseed == 0) { /* Superparanoia. */
4942 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4943 if (myseed == 0)
4944 Perl_croak(aTHX_ "Your random numbers are not that random");
4945 }
bed60192 4946 }
008fb0c0 4947 PL_rehash_seed_set = TRUE;
bed60192
JH		 4948
4949 return myseed;
4950}
27da23d5 4951
ed221c57
AL		 4952#ifdef USE_ITHREADS
4953bool
4954Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4955{
4956 const char * const stashpv = CopSTASHPV(c);
4957 const char * const name = HvNAME_get(hv);
4958
4959 if (stashpv == name)
4960 return TRUE;
4961 if (stashpv && name)
4962 if (strEQ(stashpv, name))
4963 return TRUE;
4964 return FALSE;
4965}
4966#endif
4967
4968
27da23d5
JH		 4969#ifdef PERL_GLOBAL_STRUCT
4970
4971struct perl_vars *
4972Perl_init_global_struct(pTHX)
4973{
4974 struct perl_vars *plvarsp = NULL;
4975#ifdef PERL_GLOBAL_STRUCT
4976# define PERL_GLOBAL_STRUCT_INIT
4977# include "opcode.h" /* the ppaddr and check */
4978 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4979 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4980# ifdef PERL_GLOBAL_STRUCT_PRIVATE
4981 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4982 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4983 if (!plvarsp)
4984 exit(1);
4985# else
4986 plvarsp = PL_VarsPtr;
4987# endif /* PERL_GLOBAL_STRUCT_PRIVATE */
aadb217d
JH		 4988# undef PERLVAR
4989# undef PERLVARA
4990# undef PERLVARI
4991# undef PERLVARIC
4992# undef PERLVARISC
27da23d5
JH		 4993# define PERLVAR(var,type) /**/
4994# define PERLVARA(var,n,type) /**/
4995# define PERLVARI(var,type,init) plvarsp->var = init;
4996# define PERLVARIC(var,type,init) plvarsp->var = init;
4997# define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4998# include "perlvars.h"
4999# undef PERLVAR
5000# undef PERLVARA
5001# undef PERLVARI
5002# undef PERLVARIC
5003# undef PERLVARISC
5004# ifdef PERL_GLOBAL_STRUCT
5005 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
5006 if (!plvarsp->Gppaddr)
5007 exit(1);
5008 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5009 if (!plvarsp->Gcheck)
5010 exit(1);
5011 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5012 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5013# endif
5014# ifdef PERL_SET_VARS
5015 PERL_SET_VARS(plvarsp);
5016# endif
5017# undef PERL_GLOBAL_STRUCT_INIT
5018#endif
5019 return plvarsp;
5020}
5021
5022#endif /* PERL_GLOBAL_STRUCT */
5023
5024#ifdef PERL_GLOBAL_STRUCT
5025
5026void
5027Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5028{
5029#ifdef PERL_GLOBAL_STRUCT
5030# ifdef PERL_UNSET_VARS
5031 PERL_UNSET_VARS(plvarsp);
5032# endif
5033 free(plvarsp->Gppaddr);
5034 free(plvarsp->Gcheck);
5035# ifdef PERL_GLOBAL_STRUCT_PRIVATE
5036 free(plvarsp);
5037# endif
5038#endif
5039}
5040
5041#endif /* PERL_GLOBAL_STRUCT */
5042
fe4f188c
JH		 5043#ifdef PERL_MEM_LOG
5044
e352bcff
JH		 5045#define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5046
fe4f188c 5047Malloc_t
46c6c7e2 5048Perl_mem_log_alloc(const UV n, const UV typesize, const char *typename, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
fe4f188c
JH		 5049{
5050#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5051 /* We can't use PerlIO for obvious reasons. */
5052 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
fe4f188c 5053 sprintf(buf,
46c6c7e2
JH		 5054 "alloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf"\n",
5055 filename, linenumber, funcname,
5056 n, typesize, typename, n * typesize, PTR2UV(newalloc));
e352bcff 5057 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5058#endif
5059 return newalloc;
5060}
5061
5062Malloc_t
46c6c7e2 5063Perl_mem_log_realloc(const UV n, const UV typesize, const char *typename, Malloc_t oldalloc, Malloc_t newalloc, const char *filename, const int linenumber, const char *funcname)
fe4f188c
JH		 5064{
5065#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5066 /* We can't use PerlIO for obvious reasons. */
5067 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
fe4f188c 5068 sprintf(buf,
46c6c7e2
JH		 5069 "realloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5070 filename, linenumber, funcname,
5071 n, typesize, typename, n * typesize, PTR2UV(oldalloc), PTR2UV(newalloc));
e352bcff 5072 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5073#endif
5074 return newalloc;
5075}
5076
5077Malloc_t
46c6c7e2 5078Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
fe4f188c
JH		 5079{
5080#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5081 /* We can't use PerlIO for obvious reasons. */
5082 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
46c6c7e2
JH		 5083 sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5084 filename, linenumber, funcname, PTR2UV(oldalloc));
e352bcff 5085 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5086#endif
5087 return oldalloc;
5088}
5089
5090#endif /* PERL_MEM_LOG */
5091
66610fdd 5092/*
ce582cee
NC		 5093=for apidoc my_sprintf
5094
5095The C library C<sprintf>, wrapped if necessary, to ensure that it will return
5096the length of the string written to the buffer. Only rare pre-ANSI systems
5097need the wrapper function - usually this is a direct call to C<sprintf>.
5098
5099=cut
5100*/
5101#ifndef SPRINTF_RETURNS_STRLEN
5102int
5103Perl_my_sprintf(char *buffer, const char* pat, ...)
5104{
5105 va_list args;
5106 va_start(args, pat);
5107 vsprintf(buffer, pat, args);
5108 va_end(args);
5109 return strlen(buffer);
5110}
5111#endif
5112
5113/*
66610fdd
RGS		 5114 * Local variables:
5115 * c-indentation-style: bsd
5116 * c-basic-offset: 4
5117 * indent-tabs-mode: t
5118 * End:
5119 *
37442d52
RGS		 5120 * ex: set ts=8 sts=4 sw=4 noet:
5121 */
Unnamed repository; edit this file 'description' to name the repository.