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
Doc/style fixes pointed out by Gisle
[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
27da23d5 1498# if defined(__CYGWIN__) || defined(EPOC) || defined(SYMBIAN)
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;
7b0972df 2644 sprintf(spid, "%"IVdf, (IV)pid);
3aed30dc
HS		 2645 svp = hv_fetch(PL_pidstatus,spid,strlen(spid),FALSE);
2646 if (svp && *svp != &PL_sv_undef) {
2647 *statusp = SvIVX(*svp);
2648 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2649 return pid;
2650 }
2651 }
2652 else {
2653 HE *entry;
2654
2655 hv_iterinit(PL_pidstatus);
2656 if ((entry = hv_iternext(PL_pidstatus))) {
27da23d5
JH		 2657 SV *sv = hv_iterval(PL_pidstatus,entry);
2658
3aed30dc 2659 pid = atoi(hv_iterkey(entry,(I32*)statusp));
3aed30dc
HS		 2660 *statusp = SvIVX(sv);
2661 sprintf(spid, "%"IVdf, (IV)pid);
2662 (void)hv_delete(PL_pidstatus,spid,strlen(spid),G_DISCARD);
2663 return pid;
2664 }
20188a90
LW		 2665 }
2666 }
68a29c53 2667#endif
79072805 2668#ifdef HAS_WAITPID
367f3c24
IZ		 2669# ifdef HAS_WAITPID_RUNTIME
2670 if (!HAS_WAITPID_RUNTIME)
2671 goto hard_way;
2672# endif
cddd4526 2673 result = PerlProc_waitpid(pid,statusp,flags);
dfcfdb64 2674 goto finish;
367f3c24
IZ		 2675#endif
2676#if !defined(HAS_WAITPID) && defined(HAS_WAIT4)
cddd4526 2677 result = wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
dfcfdb64 2678 goto finish;
367f3c24
IZ		 2679#endif
2680#if !defined(HAS_WAITPID) && !defined(HAS_WAIT4) || defined(HAS_WAITPID_RUNTIME)
27da23d5 2681#if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME)
367f3c24 2682 hard_way:
27da23d5 2683#endif
a0d0e21e 2684 {
a0d0e21e 2685 if (flags)
cea2e8a9 2686 Perl_croak(aTHX_ "Can't do waitpid with flags");
a0d0e21e 2687 else {
76e3520e 2688 while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0)
a0d0e21e
LW		 2689 pidgone(result,*statusp);
2690 if (result < 0)
2691 *statusp = -1;
2692 }
a687059c
LW		 2693 }
2694#endif
27da23d5 2695#if defined(HAS_WAITPID) || defined(HAS_WAIT4)
dfcfdb64 2696 finish:
27da23d5 2697#endif
cddd4526
NIS		 2698 if (result < 0 && errno == EINTR) {
2699 PERL_ASYNC_CHECK();
2700 }
2701 return result;
a687059c 2702}
2986a63f 2703#endif /* !DOSISH || OS2 || WIN32 || NETWARE */
a687059c 2704
7c0587c8 2705void
d8a83dd3 2706Perl_pidgone(pTHX_ Pid_t pid, int status)
a687059c 2707{
79072805 2708 register SV *sv;
cf28e18a 2709 char spid[TYPE_CHARS(IV)];
a687059c 2710
7b0972df 2711 sprintf(spid, "%"IVdf, (IV)pid);
3280af22 2712 sv = *hv_fetch(PL_pidstatus,spid,strlen(spid),TRUE);
862a34c6 2713 SvUPGRADE(sv,SVt_IV);
45977657 2714 SvIV_set(sv, status);
20188a90 2715 return;
a687059c
LW		 2716}
2717
85ca448a 2718#if defined(atarist) || defined(OS2) || defined(EPOC)
7c0587c8 2719int pclose();
ddcf38b7
IZ		 2720#ifdef HAS_FORK
2721int /* Cannot prototype with I32
2722 in os2ish.h. */
ba106d47 2723my_syspclose(PerlIO *ptr)
ddcf38b7 2724#else
79072805 2725I32
864dbfa3 2726Perl_my_pclose(pTHX_ PerlIO *ptr)
a1d180c4 2727#endif
a687059c 2728{
760ac839
LW		 2729 /* Needs work for PerlIO ! */
2730 FILE *f = PerlIO_findFILE(ptr);
2731 I32 result = pclose(f);
2b96b0a5
JH		 2732 PerlIO_releaseFILE(ptr,f);
2733 return result;
2734}
2735#endif
2736
933fea7f 2737#if defined(DJGPP)
2b96b0a5
JH		 2738int djgpp_pclose();
2739I32
2740Perl_my_pclose(pTHX_ PerlIO *ptr)
2741{
2742 /* Needs work for PerlIO ! */
2743 FILE *f = PerlIO_findFILE(ptr);
2744 I32 result = djgpp_pclose(f);
933fea7f 2745 result = (result << 8) & 0xff00;
760ac839
LW		 2746 PerlIO_releaseFILE(ptr,f);
2747 return result;
a687059c 2748}
7c0587c8 2749#endif
9f68db38
LW		 2750
2751void
864dbfa3 2752Perl_repeatcpy(pTHX_ register char *to, register const char *from, I32 len, register I32 count)
9f68db38 2753{
79072805 2754 register I32 todo;
08105a92 2755 register const char *frombase = from;
9f68db38
LW		 2756
2757 if (len == 1) {
08105a92 2758 register const char c = *from;
9f68db38 2759 while (count-- > 0)
5926133d 2760 *to++ = c;
9f68db38
LW		 2761 return;
2762 }
2763 while (count-- > 0) {
2764 for (todo = len; todo > 0; todo--) {
2765 *to++ = *from++;
2766 }
2767 from = frombase;
2768 }
2769}
0f85fab0 2770
fe14fcc3 2771#ifndef HAS_RENAME
79072805 2772I32
4373e329 2773Perl_same_dirent(pTHX_ const char *a, const char *b)
62b28dd9 2774{
93a17b20
LW		 2775 char *fa = strrchr(a,'/');
2776 char *fb = strrchr(b,'/');
c623ac67
GS		 2777 Stat_t tmpstatbuf1;
2778 Stat_t tmpstatbuf2;
46fc3d4c 2779 SV *tmpsv = sv_newmortal();
62b28dd9
LW		 2780
2781 if (fa)
2782 fa++;
2783 else
2784 fa = a;
2785 if (fb)
2786 fb++;
2787 else
2788 fb = b;
2789 if (strNE(a,b))
2790 return FALSE;
2791 if (fa == a)
616d8c9c 2792 sv_setpvn(tmpsv, ".", 1);
62b28dd9 2793 else
46fc3d4c 2794 sv_setpvn(tmpsv, a, fa - a);
95a20fc0 2795 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0)
62b28dd9
LW		 2796 return FALSE;
2797 if (fb == b)
616d8c9c 2798 sv_setpvn(tmpsv, ".", 1);
62b28dd9 2799 else
46fc3d4c 2800 sv_setpvn(tmpsv, b, fb - b);
95a20fc0 2801 if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0)
62b28dd9
LW		 2802 return FALSE;
2803 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
2804 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
2805}
fe14fcc3
LW		 2806#endif /* !HAS_RENAME */
2807
491527d0 2808char*
7f315aed
NC		 2809Perl_find_script(pTHX_ const char *scriptname, bool dosearch,
2810 const char *const *const search_ext, I32 flags)
491527d0 2811{
e1ec3a88 2812 const char *xfound = Nullch;
491527d0 2813 char *xfailed = Nullch;
0f31cffe 2814 char tmpbuf[MAXPATHLEN];
491527d0 2815 register char *s;
5f74f29c 2816 I32 len = 0;
491527d0
GS		 2817 int retval;
2818#if defined(DOSISH) && !defined(OS2) && !defined(atarist)
2819# define SEARCH_EXTS ".bat", ".cmd", NULL
2820# define MAX_EXT_LEN 4
2821#endif
2822#ifdef OS2
2823# define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL
2824# define MAX_EXT_LEN 4
2825#endif
2826#ifdef VMS
2827# define SEARCH_EXTS ".pl", ".com", NULL
2828# define MAX_EXT_LEN 4
2829#endif
2830 /* additional extensions to try in each dir if scriptname not found */
2831#ifdef SEARCH_EXTS
7f315aed
NC		 2832 const char *const exts[] = { SEARCH_EXTS };
2833 const char *const *const ext = search_ext ? search_ext : exts;
491527d0 2834 int extidx = 0, i = 0;
e1ec3a88 2835 const char *curext = Nullch;
491527d0 2836#else
53c1dcc0 2837 PERL_UNUSED_ARG(search_ext);
491527d0
GS		 2838# define MAX_EXT_LEN 0
2839#endif
2840
2841 /*
2842 * If dosearch is true and if scriptname does not contain path
2843 * delimiters, search the PATH for scriptname.
2844 *
2845 * If SEARCH_EXTS is also defined, will look for each
2846 * scriptname{SEARCH_EXTS} whenever scriptname is not found
2847 * while searching the PATH.
2848 *
2849 * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search
2850 * proceeds as follows:
2851 * If DOSISH or VMSISH:
2852 * + look for ./scriptname{,.foo,.bar}
2853 * + search the PATH for scriptname{,.foo,.bar}
2854 *
2855 * If !DOSISH:
2856 * + look *only* in the PATH for scriptname{,.foo,.bar} (note
2857 * this will not look in '.' if it's not in the PATH)
2858 */
84486fc6 2859 tmpbuf[0] = '\0';
491527d0
GS		 2860
2861#ifdef VMS
2862# ifdef ALWAYS_DEFTYPES
2863 len = strlen(scriptname);
2864 if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') {
2865 int hasdir, idx = 0, deftypes = 1;
2866 bool seen_dot = 1;
2867
2868 hasdir = !dosearch || (strpbrk(scriptname,":[</") != Nullch) ;
2869# else
2870 if (dosearch) {
2871 int hasdir, idx = 0, deftypes = 1;
2872 bool seen_dot = 1;
2873
2874 hasdir = (strpbrk(scriptname,":[</") != Nullch) ;
2875# endif
2876 /* The first time through, just add SEARCH_EXTS to whatever we
2877 * already have, so we can check for default file types. */
2878 while (deftypes ||
84486fc6 2879 (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) )
491527d0
GS		 2880 {
2881 if (deftypes) {
2882 deftypes = 0;
84486fc6 2883 *tmpbuf = '\0';
491527d0 2884 }
84486fc6
GS		 2885 if ((strlen(tmpbuf) + strlen(scriptname)
2886 + MAX_EXT_LEN) >= sizeof tmpbuf)
491527d0 2887 continue; /* don't search dir with too-long name */
84486fc6 2888 strcat(tmpbuf, scriptname);
491527d0
GS		 2889#else /* !VMS */
2890
2891#ifdef DOSISH
2892 if (strEQ(scriptname, "-"))
2893 dosearch = 0;
2894 if (dosearch) { /* Look in '.' first. */
fe2774ed 2895 const char *cur = scriptname;
491527d0
GS		 2896#ifdef SEARCH_EXTS
2897 if ((curext = strrchr(scriptname,'.'))) /* possible current ext */
2898 while (ext[i])
2899 if (strEQ(ext[i++],curext)) {
2900 extidx = -1; /* already has an ext */
2901 break;
2902 }
2903 do {
2904#endif
2905 DEBUG_p(PerlIO_printf(Perl_debug_log,
2906 "Looking for %s\n",cur));
017f25f1
IZ		 2907 if (PerlLIO_stat(cur,&PL_statbuf) >= 0
2908 && !S_ISDIR(PL_statbuf.st_mode)) {
491527d0
GS		 2909 dosearch = 0;
2910 scriptname = cur;
2911#ifdef SEARCH_EXTS
2912 break;
2913#endif
2914 }
2915#ifdef SEARCH_EXTS
2916 if (cur == scriptname) {
2917 len = strlen(scriptname);
84486fc6 2918 if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf))
491527d0 2919 break;
490a0e98 2920 /* FIXME? Convert to memcpy */
84486fc6 2921 cur = strcpy(tmpbuf, scriptname);
491527d0
GS		 2922 }
2923 } while (extidx >= 0 && ext[extidx] /* try an extension? */
84486fc6 2924 && strcpy(tmpbuf+len, ext[extidx++]));
491527d0
GS		 2925#endif
2926 }
2927#endif
2928
cd39f2b6
JH		 2929#ifdef MACOS_TRADITIONAL
2930 if (dosearch && !strchr(scriptname, ':') &&
2931 (s = PerlEnv_getenv("Commands")))
2932#else
491527d0
GS		 2933 if (dosearch && !strchr(scriptname, '/')
2934#ifdef DOSISH
2935 && !strchr(scriptname, '\\')
2936#endif
cd39f2b6
JH		 2937 && (s = PerlEnv_getenv("PATH")))
2938#endif
2939 {
491527d0 2940 bool seen_dot = 0;
92f0c265 2941
3280af22
NIS		 2942 PL_bufend = s + strlen(s);
2943 while (s < PL_bufend) {
cd39f2b6
JH		 2944#ifdef MACOS_TRADITIONAL
2945 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
2946 ',',
2947 &len);
2948#else
491527d0
GS		 2949#if defined(atarist) || defined(DOSISH)
2950 for (len = 0; *s
2951# ifdef atarist
2952 && *s != ','
2953# endif
2954 && *s != ';'; len++, s++) {
84486fc6
GS		 2955 if (len < sizeof tmpbuf)
2956 tmpbuf[len] = *s;
491527d0 2957 }
84486fc6
GS		 2958 if (len < sizeof tmpbuf)
2959 tmpbuf[len] = '\0';
491527d0 2960#else /* ! (atarist || DOSISH) */
3280af22 2961 s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, PL_bufend,
491527d0
GS		 2962 ':',
2963 &len);
2964#endif /* ! (atarist || DOSISH) */
cd39f2b6 2965#endif /* MACOS_TRADITIONAL */
3280af22 2966 if (s < PL_bufend)
491527d0 2967 s++;
84486fc6 2968 if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf)
491527d0 2969 continue; /* don't search dir with too-long name */
cd39f2b6
JH		 2970#ifdef MACOS_TRADITIONAL
2971 if (len && tmpbuf[len - 1] != ':')
2972 tmpbuf[len++] = ':';
2973#else
491527d0 2974 if (len
490a0e98 2975# if defined(atarist) || defined(__MINT__) || defined(DOSISH)
84486fc6
GS		 2976 && tmpbuf[len - 1] != '/'
2977 && tmpbuf[len - 1] != '\\'
490a0e98 2978# endif
491527d0 2979 )
84486fc6
GS		 2980 tmpbuf[len++] = '/';
2981 if (len == 2 && tmpbuf[0] == '.')
491527d0 2982 seen_dot = 1;
cd39f2b6 2983#endif
490a0e98
NC		 2984 /* FIXME? Convert to memcpy by storing previous strlen(scriptname)
2985 */
84486fc6 2986 (void)strcpy(tmpbuf + len, scriptname);
491527d0
GS		 2987#endif /* !VMS */
2988
2989#ifdef SEARCH_EXTS
84486fc6 2990 len = strlen(tmpbuf);
491527d0
GS		 2991 if (extidx > 0) /* reset after previous loop */
2992 extidx = 0;
2993 do {
2994#endif
84486fc6 2995 DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf));
3280af22 2996 retval = PerlLIO_stat(tmpbuf,&PL_statbuf);
017f25f1
IZ		 2997 if (S_ISDIR(PL_statbuf.st_mode)) {
2998 retval = -1;
2999 }
491527d0
GS		 3000#ifdef SEARCH_EXTS
3001 } while ( retval < 0 /* not there */
3002 && extidx>=0 && ext[extidx] /* try an extension? */
84486fc6 3003 && strcpy(tmpbuf+len, ext[extidx++])
491527d0
GS		 3004 );
3005#endif
3006 if (retval < 0)
3007 continue;
3280af22
NIS		 3008 if (S_ISREG(PL_statbuf.st_mode)
3009 && cando(S_IRUSR,TRUE,&PL_statbuf)
73811745 3010#if !defined(DOSISH) && !defined(MACOS_TRADITIONAL)
3280af22 3011 && cando(S_IXUSR,TRUE,&PL_statbuf)
491527d0
GS		 3012#endif
3013 )
3014 {
3aed30dc 3015 xfound = tmpbuf; /* bingo! */
491527d0
GS		 3016 break;
3017 }
3018 if (!xfailed)
84486fc6 3019 xfailed = savepv(tmpbuf);
491527d0
GS		 3020 }
3021#ifndef DOSISH
017f25f1 3022 if (!xfound && !seen_dot && !xfailed &&
a1d180c4 3023 (PerlLIO_stat(scriptname,&PL_statbuf) < 0
017f25f1 3024 || S_ISDIR(PL_statbuf.st_mode)))
491527d0
GS		 3025#endif
3026 seen_dot = 1; /* Disable message. */
9ccb31f9
GS		 3027 if (!xfound) {
3028 if (flags & 1) { /* do or die? */
3aed30dc 3029 Perl_croak(aTHX_ "Can't %s %s%s%s",
9ccb31f9
GS		 3030 (xfailed ? "execute" : "find"),
3031 (xfailed ? xfailed : scriptname),
3032 (xfailed ? "" : " on PATH"),
3033 (xfailed || seen_dot) ? "" : ", '.' not in PATH");
3034 }
3035 scriptname = Nullch;
3036 }
43c5f42d 3037 Safefree(xfailed);
491527d0
GS		 3038 scriptname = xfound;
3039 }
9ccb31f9 3040 return (scriptname ? savepv(scriptname) : Nullch);
491527d0
GS		 3041}
3042
ba869deb
GS		 3043#ifndef PERL_GET_CONTEXT_DEFINED
3044
3045void *
3046Perl_get_context(void)
3047{
27da23d5 3048 dVAR;
3db8f154 3049#if defined(USE_ITHREADS)
ba869deb
GS		 3050# ifdef OLD_PTHREADS_API
3051 pthread_addr_t t;
3052 if (pthread_getspecific(PL_thr_key, &t))
3053 Perl_croak_nocontext("panic: pthread_getspecific");
3054 return (void*)t;
3055# else
bce813aa 3056# ifdef I_MACH_CTHREADS
8b8b35ab 3057 return (void*)cthread_data(cthread_self());
bce813aa 3058# else
8b8b35ab
JH		 3059 return (void*)PTHREAD_GETSPECIFIC(PL_thr_key);
3060# endif
c44d3fdb 3061# endif
ba869deb
GS		 3062#else
3063 return (void*)NULL;
3064#endif
3065}
3066
3067void
3068Perl_set_context(void *t)
3069{
8772537c 3070 dVAR;
3db8f154 3071#if defined(USE_ITHREADS)
c44d3fdb
GS		 3072# ifdef I_MACH_CTHREADS
3073 cthread_set_data(cthread_self(), t);
3074# else
ba869deb
GS		 3075 if (pthread_setspecific(PL_thr_key, t))
3076 Perl_croak_nocontext("panic: pthread_setspecific");
c44d3fdb 3077# endif
b464bac0 3078#else
8772537c 3079 PERL_UNUSED_ARG(t);
ba869deb
GS		 3080#endif
3081}
3082
3083#endif /* !PERL_GET_CONTEXT_DEFINED */
491527d0 3084
27da23d5 3085#if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
22239a37 3086struct perl_vars *
864dbfa3 3087Perl_GetVars(pTHX)
22239a37 3088{
533c011a 3089 return &PL_Vars;
22239a37 3090}
31fb1209
NIS		 3091#endif
3092
1cb0ed9b 3093char **
864dbfa3 3094Perl_get_op_names(pTHX)
31fb1209 3095{
27da23d5 3096 return (char **)PL_op_name;
31fb1209
NIS		 3097}
3098
1cb0ed9b 3099char **
864dbfa3 3100Perl_get_op_descs(pTHX)
31fb1209 3101{
27da23d5 3102 return (char **)PL_op_desc;
31fb1209 3103}
9e6b2b00 3104
e1ec3a88 3105const char *
864dbfa3 3106Perl_get_no_modify(pTHX)
9e6b2b00 3107{
e1ec3a88 3108 return PL_no_modify;
9e6b2b00
GS		 3109}
3110
3111U32 *
864dbfa3 3112Perl_get_opargs(pTHX)
9e6b2b00 3113{
27da23d5 3114 return (U32 *)PL_opargs;
9e6b2b00 3115}
51aa15f3 3116
0cb96387
GS		 3117PPADDR_t*
3118Perl_get_ppaddr(pTHX)
3119{
27da23d5 3120 dVAR;
12ae5dfc 3121 return (PPADDR_t*)PL_ppaddr;
0cb96387
GS		 3122}
3123
a6c40364
GS		 3124#ifndef HAS_GETENV_LEN
3125char *
bf4acbe4 3126Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len)
a6c40364 3127{
8772537c 3128 char * const env_trans = PerlEnv_getenv(env_elem);
a6c40364
GS		 3129 if (env_trans)
3130 *len = strlen(env_trans);
3131 return env_trans;
f675dbe5
CB		 3132}
3133#endif
3134
dc9e4912
GS		 3135
3136MGVTBL*
864dbfa3 3137Perl_get_vtbl(pTHX_ int vtbl_id)
dc9e4912 3138{
27da23d5 3139 const MGVTBL* result = Null(MGVTBL*);
dc9e4912
GS		 3140
3141 switch(vtbl_id) {
3142 case want_vtbl_sv:
3143 result = &PL_vtbl_sv;
3144 break;
3145 case want_vtbl_env:
3146 result = &PL_vtbl_env;
3147 break;
3148 case want_vtbl_envelem:
3149 result = &PL_vtbl_envelem;
3150 break;
3151 case want_vtbl_sig:
3152 result = &PL_vtbl_sig;
3153 break;
3154 case want_vtbl_sigelem:
3155 result = &PL_vtbl_sigelem;
3156 break;
3157 case want_vtbl_pack:
3158 result = &PL_vtbl_pack;
3159 break;
3160 case want_vtbl_packelem:
3161 result = &PL_vtbl_packelem;
3162 break;
3163 case want_vtbl_dbline:
3164 result = &PL_vtbl_dbline;
3165 break;
3166 case want_vtbl_isa:
3167 result = &PL_vtbl_isa;
3168 break;
3169 case want_vtbl_isaelem:
3170 result = &PL_vtbl_isaelem;
3171 break;
3172 case want_vtbl_arylen:
3173 result = &PL_vtbl_arylen;
3174 break;
3175 case want_vtbl_glob:
3176 result = &PL_vtbl_glob;
3177 break;
3178 case want_vtbl_mglob:
3179 result = &PL_vtbl_mglob;
3180 break;
3181 case want_vtbl_nkeys:
3182 result = &PL_vtbl_nkeys;
3183 break;
3184 case want_vtbl_taint:
3185 result = &PL_vtbl_taint;
3186 break;
3187 case want_vtbl_substr:
3188 result = &PL_vtbl_substr;
3189 break;
3190 case want_vtbl_vec:
3191 result = &PL_vtbl_vec;
3192 break;
3193 case want_vtbl_pos:
3194 result = &PL_vtbl_pos;
3195 break;
3196 case want_vtbl_bm:
3197 result = &PL_vtbl_bm;
3198 break;
3199 case want_vtbl_fm:
3200 result = &PL_vtbl_fm;
3201 break;
3202 case want_vtbl_uvar:
3203 result = &PL_vtbl_uvar;
3204 break;
dc9e4912
GS		 3205 case want_vtbl_defelem:
3206 result = &PL_vtbl_defelem;
3207 break;
3208 case want_vtbl_regexp:
3209 result = &PL_vtbl_regexp;
3210 break;
3211 case want_vtbl_regdata:
3212 result = &PL_vtbl_regdata;
3213 break;
3214 case want_vtbl_regdatum:
3215 result = &PL_vtbl_regdatum;
3216 break;
3c90161d 3217#ifdef USE_LOCALE_COLLATE
dc9e4912
GS		 3218 case want_vtbl_collxfrm:
3219 result = &PL_vtbl_collxfrm;
3220 break;
3c90161d 3221#endif
dc9e4912
GS		 3222 case want_vtbl_amagic:
3223 result = &PL_vtbl_amagic;
3224 break;
3225 case want_vtbl_amagicelem:
3226 result = &PL_vtbl_amagicelem;
3227 break;
810b8aa5
GS		 3228 case want_vtbl_backref:
3229 result = &PL_vtbl_backref;
3230 break;
7e8c5dac
HS		 3231 case want_vtbl_utf8:
3232 result = &PL_vtbl_utf8;
3233 break;
dc9e4912 3234 }
27da23d5 3235 return (MGVTBL*)result;
dc9e4912
GS		 3236}
3237
767df6a1 3238I32
864dbfa3 3239Perl_my_fflush_all(pTHX)
767df6a1 3240{
f800e14d 3241#if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO)
ce720889 3242 return PerlIO_flush(NULL);
767df6a1 3243#else
8fbdfb7c 3244# if defined(HAS__FWALK)
f13a2bc0 3245 extern int fflush(FILE *);
74cac757
JH		 3246 /* undocumented, unprototyped, but very useful BSDism */
3247 extern void _fwalk(int (*)(FILE *));
8fbdfb7c 3248 _fwalk(&fflush);
74cac757 3249 return 0;
8fa7f367 3250# else
8fbdfb7c 3251# if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY)
8fa7f367 3252 long open_max = -1;
8fbdfb7c 3253# ifdef PERL_FFLUSH_ALL_FOPEN_MAX
d2201af2 3254 open_max = PERL_FFLUSH_ALL_FOPEN_MAX;
8fbdfb7c 3255# else
8fa7f367 3256# if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX)
767df6a1 3257 open_max = sysconf(_SC_OPEN_MAX);
8fa7f367
JH		 3258# else
3259# ifdef FOPEN_MAX
74cac757 3260 open_max = FOPEN_MAX;
8fa7f367
JH		 3261# else
3262# ifdef OPEN_MAX
74cac757 3263 open_max = OPEN_MAX;
8fa7f367
JH		 3264# else
3265# ifdef _NFILE
d2201af2 3266 open_max = _NFILE;
8fa7f367
JH		 3267# endif
3268# endif
74cac757 3269# endif
767df6a1
JH		 3270# endif
3271# endif
767df6a1
JH		 3272 if (open_max > 0) {
3273 long i;
3274 for (i = 0; i < open_max; i++)
d2201af2
AD		 3275 if (STDIO_STREAM_ARRAY[i]._file >= 0 &&
3276 STDIO_STREAM_ARRAY[i]._file < open_max &&
3277 STDIO_STREAM_ARRAY[i]._flag)
3278 PerlIO_flush(&STDIO_STREAM_ARRAY[i]);
767df6a1
JH		 3279 return 0;
3280 }
8fbdfb7c 3281# endif
93189314 3282 SETERRNO(EBADF,RMS_IFI);
767df6a1 3283 return EOF;
74cac757 3284# endif
767df6a1
JH		 3285#endif
3286}
097ee67d 3287
69282e91 3288void
e1ec3a88 3289Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op)
bc37a18f 3290{
b64e5050 3291 const char * const func =
66fc2fa5
JH		 3292 op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */
3293 op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */
bc37a18f 3294 PL_op_desc[op];
b64e5050
AL		 3295 const char * const pars = OP_IS_FILETEST(op) ? "" : "()";
3296 const char * const type = OP_IS_SOCKET(op)
3aed30dc
HS		 3297 || (gv && io && IoTYPE(io) == IoTYPE_SOCKET)
3298 ? "socket" : "filehandle";
b64e5050 3299 const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL;
66fc2fa5 3300
4c80c0b2 3301 if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) {
3aed30dc 3302 if (ckWARN(WARN_IO)) {
b64e5050 3303 const char * const direction = (op == OP_phoney_INPUT_ONLY) ? "in" : "out";
3aed30dc
HS		 3304 if (name && *name)
3305 Perl_warner(aTHX_ packWARN(WARN_IO),
3306 "Filehandle %s opened only for %sput",
fd322ea4 3307 name, direction);
3aed30dc
HS		 3308 else
3309 Perl_warner(aTHX_ packWARN(WARN_IO),
fd322ea4 3310 "Filehandle opened only for %sput", direction);
3aed30dc 3311 }
2dd78f96
JH		 3312 }
3313 else {
e1ec3a88 3314 const char *vile;
3aed30dc
HS		 3315 I32 warn_type;
3316
3317 if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) {
3318 vile = "closed";
3319 warn_type = WARN_CLOSED;
3320 }
3321 else {
3322 vile = "unopened";
3323 warn_type = WARN_UNOPENED;
3324 }
3325
3326 if (ckWARN(warn_type)) {
3327 if (name && *name) {
3328 Perl_warner(aTHX_ packWARN(warn_type),
3329 "%s%s on %s %s %s", func, pars, vile, type, name);
3330 if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3331 Perl_warner(
3332 aTHX_ packWARN(warn_type),
3333 "\t(Are you trying to call %s%s on dirhandle %s?)\n",
3334 func, pars, name
3335 );
3336 }
3337 else {
3338 Perl_warner(aTHX_ packWARN(warn_type),
3339 "%s%s on %s %s", func, pars, vile, type);
3340 if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP))
3341 Perl_warner(
3342 aTHX_ packWARN(warn_type),
3343 "\t(Are you trying to call %s%s on dirhandle?)\n",
3344 func, pars
3345 );
3346 }
3347 }
bc37a18f 3348 }
69282e91 3349}
a926ef6b
JH		 3350
3351#ifdef EBCDIC
cbebf344
JH		 3352/* in ASCII order, not that it matters */
3353static const char controllablechars[] = "?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_";
3354
a926ef6b
JH		 3355int
3356Perl_ebcdic_control(pTHX_ int ch)
3357{
3aed30dc 3358 if (ch > 'a') {
e1ec3a88 3359 const char *ctlp;
3aed30dc
HS		 3360
3361 if (islower(ch))
3362 ch = toupper(ch);
3363
3364 if ((ctlp = strchr(controllablechars, ch)) == 0) {
3365 Perl_die(aTHX_ "unrecognised control character '%c'\n", ch);
a926ef6b 3366 }
3aed30dc
HS		 3367
3368 if (ctlp == controllablechars)
3369 return('\177'); /* DEL */
3370 else
3371 return((unsigned char)(ctlp - controllablechars - 1));
3372 } else { /* Want uncontrol */
3373 if (ch == '\177' || ch == -1)
3374 return('?');
3375 else if (ch == '\157')
3376 return('\177');
3377 else if (ch == '\174')
3378 return('\000');
3379 else if (ch == '^') /* '\137' in 1047, '\260' in 819 */
3380 return('\036');
3381 else if (ch == '\155')
3382 return('\037');
3383 else if (0 < ch && ch < (sizeof(controllablechars) - 1))
3384 return(controllablechars[ch+1]);
3385 else
3386 Perl_die(aTHX_ "invalid control request: '\\%03o'\n", ch & 0xFF);
3387 }
a926ef6b
JH		 3388}
3389#endif
e72cf795 3390
f6adc668 3391/* To workaround core dumps from the uninitialised tm_zone we get the
e72cf795
JH		 3392 * system to give us a reasonable struct to copy. This fix means that
3393 * strftime uses the tm_zone and tm_gmtoff values returned by
3394 * localtime(time()). That should give the desired result most of the
3395 * time. But probably not always!
3396 *
f6adc668
JH		 3397 * This does not address tzname aspects of NETaa14816.
3398 *
e72cf795 3399 */
f6adc668 3400
e72cf795
JH		 3401#ifdef HAS_GNULIBC
3402# ifndef STRUCT_TM_HASZONE
3403# define STRUCT_TM_HASZONE
3404# endif
3405#endif
3406
f6adc668
JH		 3407#ifdef STRUCT_TM_HASZONE /* Backward compat */
3408# ifndef HAS_TM_TM_ZONE
3409# define HAS_TM_TM_ZONE
3410# endif
3411#endif
3412
e72cf795 3413void
f1208910 3414Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */
e72cf795 3415{
f6adc668 3416#ifdef HAS_TM_TM_ZONE
e72cf795 3417 Time_t now;
1b6737cc 3418 const struct tm* my_tm;
e72cf795 3419 (void)time(&now);
82c57498 3420 my_tm = localtime(&now);
ca46b8ee
SP		 3421 if (my_tm)
3422 Copy(my_tm, ptm, 1, struct tm);
1b6737cc
AL		 3423#else
3424 PERL_UNUSED_ARG(ptm);
e72cf795
JH		 3425#endif
3426}
3427
3428/*
3429 * mini_mktime - normalise struct tm values without the localtime()
3430 * semantics (and overhead) of mktime().
3431 */
3432void
f1208910 3433Perl_mini_mktime(pTHX_ struct tm *ptm)
e72cf795
JH		 3434{
3435 int yearday;
3436 int secs;
3437 int month, mday, year, jday;
3438 int odd_cent, odd_year;
3439
3440#define DAYS_PER_YEAR 365
3441#define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1)
3442#define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1)
3443#define DAYS_PER_QCENT (4*DAYS_PER_CENT+1)
3444#define SECS_PER_HOUR (60*60)
3445#define SECS_PER_DAY (24*SECS_PER_HOUR)
3446/* parentheses deliberately absent on these two, otherwise they don't work */
3447#define MONTH_TO_DAYS 153/5
3448#define DAYS_TO_MONTH 5/153
3449/* offset to bias by March (month 4) 1st between month/mday & year finding */
3450#define YEAR_ADJUST (4*MONTH_TO_DAYS+1)
3451/* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */
3452#define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */
3453
3454/*
3455 * Year/day algorithm notes:
3456 *
3457 * With a suitable offset for numeric value of the month, one can find
3458 * an offset into the year by considering months to have 30.6 (153/5) days,
3459 * using integer arithmetic (i.e., with truncation). To avoid too much
3460 * messing about with leap days, we consider January and February to be
3461 * the 13th and 14th month of the previous year. After that transformation,
3462 * we need the month index we use to be high by 1 from 'normal human' usage,
3463 * so the month index values we use run from 4 through 15.
3464 *
3465 * Given that, and the rules for the Gregorian calendar (leap years are those
3466 * divisible by 4 unless also divisible by 100, when they must be divisible
3467 * by 400 instead), we can simply calculate the number of days since some
3468 * arbitrary 'beginning of time' by futzing with the (adjusted) year number,
3469 * the days we derive from our month index, and adding in the day of the
3470 * month. The value used here is not adjusted for the actual origin which
3471 * it normally would use (1 January A.D. 1), since we're not exposing it.
3472 * We're only building the value so we can turn around and get the
3473 * normalised values for the year, month, day-of-month, and day-of-year.
3474 *
3475 * For going backward, we need to bias the value we're using so that we find
3476 * the right year value. (Basically, we don't want the contribution of
3477 * March 1st to the number to apply while deriving the year). Having done
3478 * that, we 'count up' the contribution to the year number by accounting for
3479 * full quadracenturies (400-year periods) with their extra leap days, plus
3480 * the contribution from full centuries (to avoid counting in the lost leap
3481 * days), plus the contribution from full quad-years (to count in the normal
3482 * leap days), plus the leftover contribution from any non-leap years.
3483 * At this point, if we were working with an actual leap day, we'll have 0
3484 * days left over. This is also true for March 1st, however. So, we have
3485 * to special-case that result, and (earlier) keep track of the 'odd'
3486 * century and year contributions. If we got 4 extra centuries in a qcent,
3487 * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb.
3488 * Otherwise, we add back in the earlier bias we removed (the 123 from
3489 * figuring in March 1st), find the month index (integer division by 30.6),
3490 * and the remainder is the day-of-month. We then have to convert back to
3491 * 'real' months (including fixing January and February from being 14/15 in
3492 * the previous year to being in the proper year). After that, to get
3493 * tm_yday, we work with the normalised year and get a new yearday value for
3494 * January 1st, which we subtract from the yearday value we had earlier,
3495 * representing the date we've re-built. This is done from January 1
3496 * because tm_yday is 0-origin.
3497 *
3498 * Since POSIX time routines are only guaranteed to work for times since the
3499 * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm
3500 * applies Gregorian calendar rules even to dates before the 16th century
3501 * doesn't bother me. Besides, you'd need cultural context for a given
3502 * date to know whether it was Julian or Gregorian calendar, and that's
3503 * outside the scope for this routine. Since we convert back based on the
3504 * same rules we used to build the yearday, you'll only get strange results
3505 * for input which needed normalising, or for the 'odd' century years which
3506 * were leap years in the Julian calander but not in the Gregorian one.
3507 * I can live with that.
3508 *
3509 * This algorithm also fails to handle years before A.D. 1 gracefully, but
3510 * that's still outside the scope for POSIX time manipulation, so I don't
3511 * care.
3512 */
3513
3514 year = 1900 + ptm->tm_year;
3515 month = ptm->tm_mon;
3516 mday = ptm->tm_mday;
3517 /* allow given yday with no month & mday to dominate the result */
3518 if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) {
3519 month = 0;
3520 mday = 0;
3521 jday = 1 + ptm->tm_yday;
3522 }
3523 else {
3524 jday = 0;
3525 }
3526 if (month >= 2)
3527 month+=2;
3528 else
3529 month+=14, year--;
3530 yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400;
3531 yearday += month*MONTH_TO_DAYS + mday + jday;
3532 /*
3533 * Note that we don't know when leap-seconds were or will be,
3534 * so we have to trust the user if we get something which looks
3535 * like a sensible leap-second. Wild values for seconds will
3536 * be rationalised, however.
3537 */
3538 if ((unsigned) ptm->tm_sec <= 60) {
3539 secs = 0;
3540 }
3541 else {
3542 secs = ptm->tm_sec;
3543 ptm->tm_sec = 0;
3544 }
3545 secs += 60 * ptm->tm_min;
3546 secs += SECS_PER_HOUR * ptm->tm_hour;
3547 if (secs < 0) {
3548 if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) {
3549 /* got negative remainder, but need positive time */
3550 /* back off an extra day to compensate */
3551 yearday += (secs/SECS_PER_DAY)-1;
3552 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1);
3553 }
3554 else {
3555 yearday += (secs/SECS_PER_DAY);
3556 secs -= SECS_PER_DAY * (secs/SECS_PER_DAY);
3557 }
3558 }
3559 else if (secs >= SECS_PER_DAY) {
3560 yearday += (secs/SECS_PER_DAY);
3561 secs %= SECS_PER_DAY;
3562 }
3563 ptm->tm_hour = secs/SECS_PER_HOUR;
3564 secs %= SECS_PER_HOUR;
3565 ptm->tm_min = secs/60;
3566 secs %= 60;
3567 ptm->tm_sec += secs;
3568 /* done with time of day effects */
3569 /*
3570 * The algorithm for yearday has (so far) left it high by 428.
3571 * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to
3572 * bias it by 123 while trying to figure out what year it
3573 * really represents. Even with this tweak, the reverse
3574 * translation fails for years before A.D. 0001.
3575 * It would still fail for Feb 29, but we catch that one below.
3576 */
3577 jday = yearday; /* save for later fixup vis-a-vis Jan 1 */
3578 yearday -= YEAR_ADJUST;
3579 year = (yearday / DAYS_PER_QCENT) * 400;
3580 yearday %= DAYS_PER_QCENT;
3581 odd_cent = yearday / DAYS_PER_CENT;
3582 year += odd_cent * 100;
3583 yearday %= DAYS_PER_CENT;
3584 year += (yearday / DAYS_PER_QYEAR) * 4;
3585 yearday %= DAYS_PER_QYEAR;
3586 odd_year = yearday / DAYS_PER_YEAR;
3587 year += odd_year;
3588 yearday %= DAYS_PER_YEAR;
3589 if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */
3590 month = 1;
3591 yearday = 29;
3592 }
3593 else {
3594 yearday += YEAR_ADJUST; /* recover March 1st crock */
3595 month = yearday*DAYS_TO_MONTH;
3596 yearday -= month*MONTH_TO_DAYS;
3597 /* recover other leap-year adjustment */
3598 if (month > 13) {
3599 month-=14;
3600 year++;
3601 }
3602 else {
3603 month-=2;
3604 }
3605 }
3606 ptm->tm_year = year - 1900;
3607 if (yearday) {
3608 ptm->tm_mday = yearday;
3609 ptm->tm_mon = month;
3610 }
3611 else {
3612 ptm->tm_mday = 31;
3613 ptm->tm_mon = month - 1;
3614 }
3615 /* re-build yearday based on Jan 1 to get tm_yday */
3616 year--;
3617 yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400;
3618 yearday += 14*MONTH_TO_DAYS + 1;
3619 ptm->tm_yday = jday - yearday;
3620 /* fix tm_wday if not overridden by caller */
3621 if ((unsigned)ptm->tm_wday > 6)
3622 ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7;
3623}
b3c85772
JH		 3624
3625char *
e1ec3a88 3626Perl_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		 3627{
3628#ifdef HAS_STRFTIME
3629 char *buf;
3630 int buflen;
3631 struct tm mytm;
3632 int len;
3633
3634 init_tm(&mytm); /* XXX workaround - see init_tm() above */
3635 mytm.tm_sec = sec;
3636 mytm.tm_min = min;
3637 mytm.tm_hour = hour;
3638 mytm.tm_mday = mday;
3639 mytm.tm_mon = mon;
3640 mytm.tm_year = year;
3641 mytm.tm_wday = wday;
3642 mytm.tm_yday = yday;
3643 mytm.tm_isdst = isdst;
3644 mini_mktime(&mytm);
c473feec
SR		 3645 /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */
3646#if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE))
3647 STMT_START {
3648 struct tm mytm2;
3649 mytm2 = mytm;
3650 mktime(&mytm2);
3651#ifdef HAS_TM_TM_GMTOFF
3652 mytm.tm_gmtoff = mytm2.tm_gmtoff;
3653#endif
3654#ifdef HAS_TM_TM_ZONE
3655 mytm.tm_zone = mytm2.tm_zone;
3656#endif
3657 } STMT_END;
3658#endif
b3c85772 3659 buflen = 64;
a02a5408 3660 Newx(buf, buflen, char);
b3c85772
JH		 3661 len = strftime(buf, buflen, fmt, &mytm);
3662 /*
877f6a72 3663 ** The following is needed to handle to the situation where
b3c85772
JH		 3664 ** tmpbuf overflows. Basically we want to allocate a buffer
3665 ** and try repeatedly. The reason why it is so complicated
3666 ** is that getting a return value of 0 from strftime can indicate
3667 ** one of the following:
3668 ** 1. buffer overflowed,
3669 ** 2. illegal conversion specifier, or
3670 ** 3. the format string specifies nothing to be returned(not
3671 ** an error). This could be because format is an empty string
3672 ** or it specifies %p that yields an empty string in some locale.
3673 ** If there is a better way to make it portable, go ahead by
3674 ** all means.
3675 */
3676 if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0'))
3677 return buf;
3678 else {
3679 /* Possibly buf overflowed - try again with a bigger buf */
e1ec3a88
AL		 3680 const int fmtlen = strlen(fmt);
3681 const int bufsize = fmtlen + buflen;
877f6a72 3682
a02a5408 3683 Newx(buf, bufsize, char);
b3c85772
JH		 3684 while (buf) {
3685 buflen = strftime(buf, bufsize, fmt, &mytm);
3686 if (buflen > 0 && buflen < bufsize)
3687 break;
3688 /* heuristic to prevent out-of-memory errors */
3689 if (bufsize > 100*fmtlen) {
3690 Safefree(buf);
3691 buf = NULL;
3692 break;
3693 }
e1ec3a88 3694 Renew(buf, bufsize*2, char);
b3c85772
JH		 3695 }
3696 return buf;
3697 }
3698#else
3699 Perl_croak(aTHX_ "panic: no strftime");
27da23d5 3700 return NULL;
b3c85772
JH		 3701#endif
3702}
3703
877f6a72
NIS		 3704
3705#define SV_CWD_RETURN_UNDEF \
3706sv_setsv(sv, &PL_sv_undef); \
3707return FALSE
3708
3709#define SV_CWD_ISDOT(dp) \
3710 (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \
3aed30dc 3711 (dp->d_name[1] == '.' && dp->d_name[2] == '\0')))
877f6a72
NIS		 3712
3713/*
ccfc67b7
JH		 3714=head1 Miscellaneous Functions
3715
89423764 3716=for apidoc getcwd_sv
877f6a72
NIS		 3717
3718Fill the sv with current working directory
3719
3720=cut
3721*/
3722
3723/* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars.
3724 * rewritten again by dougm, optimized for use with xs TARG, and to prefer
3725 * getcwd(3) if available
3726 * Comments from the orignal:
3727 * This is a faster version of getcwd. It's also more dangerous
3728 * because you might chdir out of a directory that you can't chdir
3729 * back into. */
3730
877f6a72 3731int
89423764 3732Perl_getcwd_sv(pTHX_ register SV *sv)
877f6a72
NIS		 3733{
3734#ifndef PERL_MICRO
3735
ea715489
JH		 3736#ifndef INCOMPLETE_TAINTS
3737 SvTAINTED_on(sv);
3738#endif
3739
8f95b30d
JH		 3740#ifdef HAS_GETCWD
3741 {
60e110a8
DM		 3742 char buf[MAXPATHLEN];
3743
3aed30dc 3744 /* Some getcwd()s automatically allocate a buffer of the given
60e110a8
DM		 3745 * size from the heap if they are given a NULL buffer pointer.
3746 * The problem is that this behaviour is not portable. */
3aed30dc 3747 if (getcwd(buf, sizeof(buf) - 1)) {
4373e329 3748 sv_setpvn(sv, buf, strlen(buf));
3aed30dc
HS		 3749 return TRUE;
3750 }
3751 else {
3752 sv_setsv(sv, &PL_sv_undef);
3753 return FALSE;
3754 }
8f95b30d
JH		 3755 }
3756
3757#else
3758
c623ac67 3759 Stat_t statbuf;
877f6a72 3760 int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino;
4373e329 3761 int pathlen=0;
877f6a72 3762 Direntry_t *dp;
877f6a72 3763
862a34c6 3764 SvUPGRADE(sv, SVt_PV);
877f6a72 3765
877f6a72 3766 if (PerlLIO_lstat(".", &statbuf) < 0) {
3aed30dc 3767 SV_CWD_RETURN_UNDEF;
877f6a72
NIS		 3768 }
3769
3770 orig_cdev = statbuf.st_dev;
3771 orig_cino = statbuf.st_ino;
3772 cdev = orig_cdev;
3773 cino = orig_cino;
3774
3775 for (;;) {
4373e329 3776 DIR *dir;
3aed30dc
HS		 3777 odev = cdev;
3778 oino = cino;
3779
3780 if (PerlDir_chdir("..") < 0) {
3781 SV_CWD_RETURN_UNDEF;
3782 }
3783 if (PerlLIO_stat(".", &statbuf) < 0) {
3784 SV_CWD_RETURN_UNDEF;
3785 }
3786
3787 cdev = statbuf.st_dev;
3788 cino = statbuf.st_ino;
3789
3790 if (odev == cdev && oino == cino) {
3791 break;
3792 }
3793 if (!(dir = PerlDir_open("."))) {
3794 SV_CWD_RETURN_UNDEF;
3795 }
3796
3797 while ((dp = PerlDir_read(dir)) != NULL) {
877f6a72 3798#ifdef DIRNAMLEN
4373e329 3799 const int namelen = dp->d_namlen;
877f6a72 3800#else
4373e329 3801 const int namelen = strlen(dp->d_name);
877f6a72 3802#endif
3aed30dc
HS		 3803 /* skip . and .. */
3804 if (SV_CWD_ISDOT(dp)) {
3805 continue;
3806 }
3807
3808 if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) {
3809 SV_CWD_RETURN_UNDEF;
3810 }
3811
3812 tdev = statbuf.st_dev;
3813 tino = statbuf.st_ino;
3814 if (tino == oino && tdev == odev) {
3815 break;
3816 }
cb5953d6
JH		 3817 }
3818
3aed30dc
HS		 3819 if (!dp) {
3820 SV_CWD_RETURN_UNDEF;
3821 }
3822
3823 if (pathlen + namelen + 1 >= MAXPATHLEN) {
3824 SV_CWD_RETURN_UNDEF;
3825 }
877f6a72 3826
3aed30dc
HS		 3827 SvGROW(sv, pathlen + namelen + 1);
3828
3829 if (pathlen) {
3830 /* shift down */
95a20fc0 3831 Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char);
3aed30dc 3832 }
877f6a72 3833
3aed30dc
HS		 3834 /* prepend current directory to the front */
3835 *SvPVX(sv) = '/';
3836 Move(dp->d_name, SvPVX(sv)+1, namelen, char);
3837 pathlen += (namelen + 1);
877f6a72
NIS		 3838
3839#ifdef VOID_CLOSEDIR
3aed30dc 3840 PerlDir_close(dir);
877f6a72 3841#else
3aed30dc
HS		 3842 if (PerlDir_close(dir) < 0) {
3843 SV_CWD_RETURN_UNDEF;
3844 }
877f6a72
NIS		 3845#endif
3846 }
3847
60e110a8 3848 if (pathlen) {
3aed30dc
HS		 3849 SvCUR_set(sv, pathlen);
3850 *SvEND(sv) = '\0';
3851 SvPOK_only(sv);
877f6a72 3852
95a20fc0 3853 if (PerlDir_chdir(SvPVX_const(sv)) < 0) {
3aed30dc
HS		 3854 SV_CWD_RETURN_UNDEF;
3855 }
877f6a72
NIS		 3856 }
3857 if (PerlLIO_stat(".", &statbuf) < 0) {
3aed30dc 3858 SV_CWD_RETURN_UNDEF;
877f6a72
NIS		 3859 }
3860
3861 cdev = statbuf.st_dev;
3862 cino = statbuf.st_ino;
3863
3864 if (cdev != orig_cdev || cino != orig_cino) {
3aed30dc
HS		 3865 Perl_croak(aTHX_ "Unstable directory path, "
3866 "current directory changed unexpectedly");
877f6a72 3867 }
877f6a72
NIS		 3868
3869 return TRUE;
793b8d8e
JH		 3870#endif
3871
877f6a72
NIS		 3872#else
3873 return FALSE;
3874#endif
3875}
3876
f4758303 3877/*
b0f01acb
JP		 3878=for apidoc scan_version
3879
3880Returns a pointer to the next character after the parsed
3881version string, as well as upgrading the passed in SV to
3882an RV.
3883
3884Function must be called with an already existing SV like
3885
137d6fc0
JP		 3886 sv = newSV(0);
3887 s = scan_version(s,SV *sv, bool qv);
b0f01acb
JP		 3888
3889Performs some preprocessing to the string to ensure that
3890it has the correct characteristics of a version. Flags the
3891object if it contains an underscore (which denotes this
137d6fc0
JP		 3892is a alpha version). The boolean qv denotes that the version
3893should be interpreted as if it had multiple decimals, even if
3894it doesn't.
b0f01acb
JP		 3895
3896=cut
3897*/
3898
9137345a 3899const char *
e1ec3a88 3900Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv)
b0f01acb 3901{
e0218a61 3902 const char *start;
9137345a
JP		 3903 const char *pos;
3904 const char *last;
3905 int saw_period = 0;
cb5772bb 3906 int alpha = 0;
9137345a
JP		 3907 int width = 3;
3908 AV *av = newAV();
cb5772bb 3909 SV *hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */
9137345a 3910 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
cb5772bb 3911
3a242bf8
NC		 3912#ifndef NODEFAULT_SHAREKEYS
3913 HvSHAREKEYS_on(hv); /* key-sharing on by default */
3914#endif
9137345a 3915
e0218a61
JP		 3916 while (isSPACE(*s)) /* leading whitespace is OK */
3917 s++;
3918
9137345a
JP		 3919 if (*s == 'v') {
3920 s++; /* get past 'v' */
3921 qv = 1; /* force quoted version processing */
3922 }
3923
e0218a61 3924 start = last = pos = s;
9137345a
JP		 3925
3926 /* pre-scan the input string to check for decimals/underbars */
ad63d80f
JP		 3927 while ( *pos == '.' || *pos == '_' || isDIGIT(*pos) )
3928 {
3929 if ( *pos == '.' )
3930 {
cb5772bb 3931 if ( alpha )
5f89c282 3932 Perl_croak(aTHX_ "Invalid version format (underscores before decimal)");
ad63d80f 3933 saw_period++ ;
9137345a 3934 last = pos;
46314c13 3935 }
ad63d80f
JP		 3936 else if ( *pos == '_' )
3937 {
cb5772bb 3938 if ( alpha )
5f89c282 3939 Perl_croak(aTHX_ "Invalid version format (multiple underscores)");
cb5772bb 3940 alpha = 1;
9137345a 3941 width = pos - last - 1; /* natural width of sub-version */
ad63d80f
JP		 3942 }
3943 pos++;
3944 }
ad63d80f 3945
e0218a61 3946 if ( saw_period > 1 )
137d6fc0 3947 qv = 1; /* force quoted version processing */
9137345a
JP		 3948
3949 pos = s;
3950
3951 if ( qv )
cb5772bb
RGS		 3952 hv_store((HV *)hv, "qv", 2, newSViv(qv), 0);
3953 if ( alpha )
3954 hv_store((HV *)hv, "alpha", 5, newSViv(alpha), 0);
9137345a
JP		 3955 if ( !qv && width < 3 )
3956 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
3957
ad63d80f 3958 while (isDIGIT(*pos))
46314c13 3959 pos++;
ad63d80f
JP		 3960 if (!isALPHA(*pos)) {
3961 I32 rev;
3962
ad63d80f
JP		 3963 for (;;) {
3964 rev = 0;
3965 {
129318bd 3966 /* this is atoi() that delimits on underscores */
9137345a 3967 const char *end = pos;
129318bd
JP		 3968 I32 mult = 1;
3969 I32 orev;
9137345a 3970
129318bd
JP		 3971 /* the following if() will only be true after the decimal
3972 * point of a version originally created with a bare
3973 * floating point number, i.e. not quoted in any way
3974 */
e0218a61 3975 if ( !qv && s > start && saw_period == 1 ) {
c76df65e 3976 mult *= 100;
129318bd
JP		 3977 while ( s < end ) {
3978 orev = rev;
3979 rev += (*s - '0') * mult;
3980 mult /= 10;
32fdb065 3981 if ( PERL_ABS(orev) > PERL_ABS(rev) )
129318bd
JP		 3982 Perl_croak(aTHX_ "Integer overflow in version");
3983 s++;
9137345a
JP		 3984 if ( *s == '_' )
3985 s++;
129318bd
JP		 3986 }
3987 }
3988 else {
3989 while (--end >= s) {
3990 orev = rev;
3991 rev += (*end - '0') * mult;
3992 mult *= 10;
32fdb065 3993 if ( PERL_ABS(orev) > PERL_ABS(rev) )
129318bd
JP		 3994 Perl_croak(aTHX_ "Integer overflow in version");
3995 }
3996 }
3997 }
9137345a 3998
129318bd 3999 /* Append revision */
9137345a
JP		 4000 av_push(av, newSViv(rev));
4001 if ( *pos == '.' && isDIGIT(pos[1]) )
4002 s = ++pos;
4003 else if ( *pos == '_' && isDIGIT(pos[1]) )
ad63d80f
JP		 4004 s = ++pos;
4005 else if ( isDIGIT(*pos) )
4006 s = pos;
b0f01acb 4007 else {
ad63d80f
JP		 4008 s = pos;
4009 break;
4010 }
9137345a
JP		 4011 if ( qv ) {
4012 while ( isDIGIT(*pos) )
4013 pos++;
4014 }
4015 else {
4016 int digits = 0;
4017 while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) {
4018 if ( *pos != '_' )
4019 digits++;
4020 pos++;
4021 }
b0f01acb
JP		 4022 }
4023 }
4024 }
9137345a
JP		 4025 if ( qv ) { /* quoted versions always get at least three terms*/
4026 I32 len = av_len(av);
4edfc503
NC		 4027 /* This for loop appears to trigger a compiler bug on OS X, as it
4028 loops infinitely. Yes, len is negative. No, it makes no sense.
4029 Compiler in question is:
4030 gcc version 3.3 20030304 (Apple Computer, Inc. build 1640)
4031 for ( len = 2 - len; len > 0; len-- )
4032 av_push((AV *)sv, newSViv(0));
4033 */
4034 len = 2 - len;
4035 while (len-- > 0)
9137345a 4036 av_push(av, newSViv(0));
b9381830 4037 }
9137345a
JP		 4038
4039 if ( av_len(av) == -1 ) /* oops, someone forgot to pass a value */
4040 av_push(av, newSViv(0));
4041
4042 /* And finally, store the AV in the hash */
cb5772bb 4043 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
9137345a 4044 return s;
b0f01acb
JP		 4045}
4046
4047/*
4048=for apidoc new_version
4049
4050Returns a new version object based on the passed in SV:
4051
4052 SV *sv = new_version(SV *ver);
4053
4054Does not alter the passed in ver SV. See "upg_version" if you
4055want to upgrade the SV.
4056
4057=cut
4058*/
4059
4060SV *
4061Perl_new_version(pTHX_ SV *ver)
4062{
2d03de9c 4063 SV * const rv = newSV(0);
d7aa5382
JP		 4064 if ( sv_derived_from(ver,"version") ) /* can just copy directly */
4065 {
4066 I32 key;
53c1dcc0 4067 AV * const av = newAV();
9137345a
JP		 4068 AV *sav;
4069 /* This will get reblessed later if a derived class*/
e0218a61 4070 SV * const hv = newSVrv(rv, "version");
9137345a 4071 (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */
3a242bf8
NC		 4072#ifndef NODEFAULT_SHAREKEYS
4073 HvSHAREKEYS_on(hv); /* key-sharing on by default */
4074#endif
9137345a
JP		 4075
4076 if ( SvROK(ver) )
4077 ver = SvRV(ver);
4078
4079 /* Begin copying all of the elements */
4080 if ( hv_exists((HV *)ver, "qv", 2) )
4081 hv_store((HV *)hv, "qv", 2, &PL_sv_yes, 0);
4082
4083 if ( hv_exists((HV *)ver, "alpha", 5) )
4084 hv_store((HV *)hv, "alpha", 5, &PL_sv_yes, 0);
4085
4086 if ( hv_exists((HV*)ver, "width", 5 ) )
d7aa5382 4087 {
53c1dcc0 4088 const I32 width = SvIV(*hv_fetch((HV*)ver, "width", 5, FALSE));
9137345a 4089 hv_store((HV *)hv, "width", 5, newSViv(width), 0);
d7aa5382 4090 }
9137345a 4091
cb5772bb 4092 sav = (AV *)SvRV(*hv_fetch((HV*)ver, "version", 7, FALSE));
9137345a
JP		 4093 /* This will get reblessed later if a derived class*/
4094 for ( key = 0; key <= av_len(sav); key++ )
4095 {
4096 const I32 rev = SvIV(*av_fetch(sav, key, FALSE));
4097 av_push(av, newSViv(rev));
4098 }
4099
cb5772bb 4100 hv_store((HV *)hv, "version", 7, newRV_noinc((SV *)av), 0);
d7aa5382
JP		 4101 return rv;
4102 }
ad63d80f 4103#ifdef SvVOK
137d6fc0 4104 if ( SvVOK(ver) ) { /* already a v-string */
e0218a61 4105 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
a4d60858 4106 const STRLEN len = mg->mg_len;
2d03de9c 4107 char * const version = savepvn( (const char*)mg->mg_ptr, len);
a4d60858 4108 sv_setpvn(rv,version,len);
137d6fc0 4109 Safefree(version);
b0f01acb 4110 }
137d6fc0 4111 else {
ad63d80f 4112#endif
137d6fc0
JP		 4113 sv_setsv(rv,ver); /* make a duplicate */
4114#ifdef SvVOK
26ec6fc3 4115 }
137d6fc0
JP		 4116#endif
4117 upg_version(rv);
b0f01acb
JP		 4118 return rv;
4119}
4120
4121/*
4122=for apidoc upg_version
4123
4124In-place upgrade of the supplied SV to a version object.
4125
4126 SV *sv = upg_version(SV *sv);
4127
4128Returns a pointer to the upgraded SV.
4129
4130=cut
4131*/
4132
4133SV *
ad63d80f 4134Perl_upg_version(pTHX_ SV *ver)
b0f01acb 4135{
137d6fc0
JP		 4136 char *version;
4137 bool qv = 0;
4138
4139 if ( SvNOK(ver) ) /* may get too much accuracy */
4140 {
4141 char tbuf[64];
4142 sprintf(tbuf,"%.9"NVgf, SvNVX(ver));
4143 version = savepv(tbuf);
4144 }
ad63d80f 4145#ifdef SvVOK
137d6fc0 4146 else if ( SvVOK(ver) ) { /* already a v-string */
2d03de9c 4147 const MAGIC* const mg = mg_find(ver,PERL_MAGIC_vstring);
ad63d80f 4148 version = savepvn( (const char*)mg->mg_ptr,mg->mg_len );
137d6fc0 4149 qv = 1;
b0f01acb 4150 }
ad63d80f 4151#endif
137d6fc0
JP		 4152 else /* must be a string or something like a string */
4153 {
9137345a 4154 version = savepv(SvPV_nolen(ver));
137d6fc0
JP		 4155 }
4156 (void)scan_version(version, ver, qv);
4157 Safefree(version);
ad63d80f 4158 return ver;
b0f01acb
JP		 4159}
4160
e0218a61
JP		 4161/*
4162=for apidoc vverify
4163
4164Validates that the SV contains a valid version object.
4165
4166 bool vverify(SV *vobj);
4167
4168Note that it only confirms the bare minimum structure (so as not to get
4169confused by derived classes which may contain additional hash entries):
4170
4171=over 4
4172
cb5772bb 4173=item * The SV contains a [reference to a] hash
e0218a61
JP		 4174
4175=item * The hash contains a "version" key
4176
cb5772bb 4177=item * The "version" key has [a reference to] an AV as its value
e0218a61
JP		 4178
4179=back
4180
4181=cut
4182*/
4183
4184bool
4185Perl_vverify(pTHX_ SV *vs)
4186{
4187 SV *sv;
4188 if ( SvROK(vs) )
4189 vs = SvRV(vs);
4190
4191 /* see if the appropriate elements exist */
4192 if ( SvTYPE(vs) == SVt_PVHV
4193 && hv_exists((HV*)vs, "version", 7)
cb5772bb 4194 && (sv = SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)))
e0218a61
JP		 4195 && SvTYPE(sv) == SVt_PVAV )
4196 return TRUE;
4197 else
4198 return FALSE;
4199}
b0f01acb
JP		 4200
4201/*
4202=for apidoc vnumify
4203
ad63d80f
JP		 4204Accepts a version object and returns the normalized floating
4205point representation. Call like:
b0f01acb 4206
ad63d80f 4207 sv = vnumify(rv);
b0f01acb 4208
ad63d80f
JP		 4209NOTE: you can pass either the object directly or the SV
4210contained within the RV.
b0f01acb
JP		 4211
4212=cut
4213*/
4214
4215SV *
ad63d80f 4216Perl_vnumify(pTHX_ SV *vs)
b0f01acb 4217{
ad63d80f 4218 I32 i, len, digit;
9137345a
JP		 4219 int width;
4220 bool alpha = FALSE;
53c1dcc0 4221 SV * const sv = newSV(0);
9137345a 4222 AV *av;
ad63d80f
JP		 4223 if ( SvROK(vs) )
4224 vs = SvRV(vs);
9137345a 4225
e0218a61
JP		 4226 if ( !vverify(vs) )
4227 Perl_croak(aTHX_ "Invalid version object");
4228
9137345a
JP		 4229 /* see if various flags exist */
4230 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4231 alpha = TRUE;
4232 if ( hv_exists((HV*)vs, "width", 5 ) )
4233 width = SvIV(*hv_fetch((HV*)vs, "width", 5, FALSE));
4234 else
4235 width = 3;
4236
4237
4238 /* attempt to retrieve the version array */
cb5772bb 4239 if ( !(av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE)) ) ) {
53c1dcc0 4240 sv_catpvn(sv,"0",1);
9137345a
JP		 4241 return sv;
4242 }
4243
4244 len = av_len(av);
46314c13
JP		 4245 if ( len == -1 )
4246 {
b66123c5 4247 sv_catpvn(sv,"0",1);
46314c13
JP		 4248 return sv;
4249 }
9137345a
JP		 4250
4251 digit = SvIV(*av_fetch(av, 0, 0));
261fcdab 4252 Perl_sv_setpvf(aTHX_ sv, "%d.", (int)PERL_ABS(digit));
13f8f398 4253 for ( i = 1 ; i < len ; i++ )
b0f01acb 4254 {
9137345a
JP		 4255 digit = SvIV(*av_fetch(av, i, 0));
4256 if ( width < 3 ) {
53c1dcc0
AL		 4257 const int denom = (int)pow(10,(3-width));
4258 const div_t term = div((int)PERL_ABS(digit),denom);
261fcdab 4259 Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem);
9137345a
JP		 4260 }
4261 else {
261fcdab 4262 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
9137345a 4263 }
b0f01acb 4264 }
13f8f398
JP		 4265
4266 if ( len > 0 )
4267 {
9137345a
JP		 4268 digit = SvIV(*av_fetch(av, len, 0));
4269 if ( alpha && width == 3 ) /* alpha version */
e0218a61 4270 sv_catpvn(sv,"_",1);
261fcdab 4271 Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit);
13f8f398 4272 }
e0218a61 4273 else /* len == 0 */
13f8f398 4274 {
e0218a61 4275 sv_catpvn(sv,"000",3);
13f8f398 4276 }
b0f01acb
JP		 4277 return sv;
4278}
4279
4280/*
b9381830 4281=for apidoc vnormal
b0f01acb 4282
ad63d80f
JP		 4283Accepts a version object and returns the normalized string
4284representation. Call like:
b0f01acb 4285
b9381830 4286 sv = vnormal(rv);
b0f01acb 4287
ad63d80f
JP		 4288NOTE: you can pass either the object directly or the SV
4289contained within the RV.
b0f01acb
JP		 4290
4291=cut
4292*/
4293
4294SV *
b9381830 4295Perl_vnormal(pTHX_ SV *vs)
b0f01acb 4296{
ad63d80f 4297 I32 i, len, digit;
9137345a 4298 bool alpha = FALSE;
2d03de9c 4299 SV * const sv = newSV(0);
9137345a 4300 AV *av;
ad63d80f
JP		 4301 if ( SvROK(vs) )
4302 vs = SvRV(vs);
9137345a 4303
e0218a61
JP		 4304 if ( !vverify(vs) )
4305 Perl_croak(aTHX_ "Invalid version object");
4306
9137345a
JP		 4307 if ( hv_exists((HV*)vs, "alpha", 5 ) )
4308 alpha = TRUE;
cb5772bb 4309 av = (AV *)SvRV(*hv_fetch((HV*)vs, "version", 7, FALSE));
9137345a
JP		 4310
4311 len = av_len(av);
e0218a61
JP		 4312 if ( len == -1 )
4313 {
b66123c5 4314 sv_catpvn(sv,"",0);
46314c13
JP		 4315 return sv;
4316 }
9137345a 4317 digit = SvIV(*av_fetch(av, 0, 0));
261fcdab 4318 Perl_sv_setpvf(aTHX_ sv, "v%"IVdf, (IV)digit);
cb5772bb 4319 for ( i = 1 ; i < len ; i++ ) {
9137345a 4320 digit = SvIV(*av_fetch(av, i, 0));
261fcdab 4321 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
9137345a
JP		 4322 }
4323
e0218a61
JP		 4324 if ( len > 0 )
4325 {
9137345a
JP		 4326 /* handle last digit specially */
4327 digit = SvIV(*av_fetch(av, len, 0));
4328 if ( alpha )
261fcdab 4329 Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit);
ad63d80f 4330 else
261fcdab 4331 Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit);
b0f01acb 4332 }
9137345a 4333
137d6fc0
JP		 4334 if ( len <= 2 ) { /* short version, must be at least three */
4335 for ( len = 2 - len; len != 0; len-- )
b66123c5 4336 sv_catpvn(sv,".0",2);
137d6fc0 4337 }
b0f01acb 4338 return sv;
9137345a 4339}
b0f01acb 4340
ad63d80f 4341/*
b9381830
JP		 4342=for apidoc vstringify
4343
4344In order to maintain maximum compatibility with earlier versions
4345of Perl, this function will return either the floating point
4346notation or the multiple dotted notation, depending on whether
4347the original version contained 1 or more dots, respectively
4348
4349=cut
4350*/
4351
4352SV *
4353Perl_vstringify(pTHX_ SV *vs)
4354{
b9381830
JP		 4355 if ( SvROK(vs) )
4356 vs = SvRV(vs);
e0218a61
JP		 4357
4358 if ( !vverify(vs) )
4359 Perl_croak(aTHX_ "Invalid version object");
4360
9137345a 4361 if ( hv_exists((HV *)vs, "qv", 2) )
cb5772bb 4362 return vnormal(vs);
9137345a 4363 else
cb5772bb 4364 return vnumify(vs);
b9381830
JP		 4365}
4366
4367/*
ad63d80f
JP		 4368=for apidoc vcmp
4369
4370Version object aware cmp. Both operands must already have been
4371converted into version objects.
4372
4373=cut
4374*/
4375
4376int
9137345a 4377Perl_vcmp(pTHX_ SV *lhv, SV *rhv)
ad63d80f
JP		 4378{
4379 I32 i,l,m,r,retval;
9137345a
JP		 4380 bool lalpha = FALSE;
4381 bool ralpha = FALSE;
4382 I32 left = 0;
4383 I32 right = 0;
4384 AV *lav, *rav;
4385 if ( SvROK(lhv) )
4386 lhv = SvRV(lhv);
4387 if ( SvROK(rhv) )
4388 rhv = SvRV(rhv);
4389
e0218a61
JP		 4390 if ( !vverify(lhv) )
4391 Perl_croak(aTHX_ "Invalid version object");
4392
4393 if ( !vverify(rhv) )
4394 Perl_croak(aTHX_ "Invalid version object");
4395
9137345a 4396 /* get the left hand term */
cb5772bb 4397 lav = (AV *)SvRV(*hv_fetch((HV*)lhv, "version", 7, FALSE));
9137345a
JP		 4398 if ( hv_exists((HV*)lhv, "alpha", 5 ) )
4399 lalpha = TRUE;
4400
4401 /* and the right hand term */
cb5772bb 4402 rav = (AV *)SvRV(*hv_fetch((HV*)rhv, "version", 7, FALSE));
9137345a
JP		 4403 if ( hv_exists((HV*)rhv, "alpha", 5 ) )
4404 ralpha = TRUE;
4405
4406 l = av_len(lav);
4407 r = av_len(rav);
ad63d80f
JP		 4408 m = l < r ? l : r;
4409 retval = 0;
4410 i = 0;
4411 while ( i <= m && retval == 0 )
4412 {
9137345a
JP		 4413 left = SvIV(*av_fetch(lav,i,0));
4414 right = SvIV(*av_fetch(rav,i,0));
4415 if ( left < right )
ad63d80f 4416 retval = -1;
9137345a 4417 if ( left > right )
ad63d80f
JP		 4418 retval = +1;
4419 i++;
4420 }
4421
9137345a
JP		 4422 /* tiebreaker for alpha with identical terms */
4423 if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) )
4424 {
4425 if ( lalpha && !ralpha )
4426 {
4427 retval = -1;
4428 }
4429 else if ( ralpha && !lalpha)
4430 {
4431 retval = +1;
4432 }
4433 }
4434
137d6fc0 4435 if ( l != r && retval == 0 ) /* possible match except for trailing 0's */
129318bd 4436 {
137d6fc0 4437 if ( l < r )
129318bd 4438 {
137d6fc0
JP		 4439 while ( i <= r && retval == 0 )
4440 {
9137345a 4441 if ( SvIV(*av_fetch(rav,i,0)) != 0 )
137d6fc0
JP		 4442 retval = -1; /* not a match after all */
4443 i++;
4444 }
4445 }
4446 else
4447 {
4448 while ( i <= l && retval == 0 )
4449 {
9137345a 4450 if ( SvIV(*av_fetch(lav,i,0)) != 0 )
137d6fc0
JP		 4451 retval = +1; /* not a match after all */
4452 i++;
4453 }
129318bd
JP		 4454 }
4455 }
ad63d80f
JP		 4456 return retval;
4457}
4458
c95c94b1 4459#if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT)
2bc69dc4
NIS		 4460# define EMULATE_SOCKETPAIR_UDP
4461#endif
4462
4463#ifdef EMULATE_SOCKETPAIR_UDP
02fc2eee
NC		 4464static int
4465S_socketpair_udp (int fd[2]) {
e10bb1e9 4466 dTHX;
02fc2eee
NC		 4467 /* Fake a datagram socketpair using UDP to localhost. */
4468 int sockets[2] = {-1, -1};
4469 struct sockaddr_in addresses[2];
4470 int i;
3aed30dc 4471 Sock_size_t size = sizeof(struct sockaddr_in);
ae92b34e 4472 unsigned short port;
02fc2eee
NC		 4473 int got;
4474
3aed30dc 4475 memset(&addresses, 0, sizeof(addresses));
02fc2eee
NC		 4476 i = 1;
4477 do {
3aed30dc
HS		 4478 sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET);
4479 if (sockets[i] == -1)
4480 goto tidy_up_and_fail;
4481
4482 addresses[i].sin_family = AF_INET;
4483 addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK);
4484 addresses[i].sin_port = 0; /* kernel choses port. */
4485 if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i],
4486 sizeof(struct sockaddr_in)) == -1)
4487 goto tidy_up_and_fail;
02fc2eee
NC		 4488 } while (i--);
4489
4490 /* Now have 2 UDP sockets. Find out which port each is connected to, and
4491 for each connect the other socket to it. */
4492 i = 1;
4493 do {
3aed30dc
HS		 4494 if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i],
4495 &size) == -1)
4496 goto tidy_up_and_fail;
4497 if (size != sizeof(struct sockaddr_in))
4498 goto abort_tidy_up_and_fail;
4499 /* !1 is 0, !0 is 1 */
4500 if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i],
4501 sizeof(struct sockaddr_in)) == -1)
4502 goto tidy_up_and_fail;
02fc2eee
NC		 4503 } while (i--);
4504
4505 /* Now we have 2 sockets connected to each other. I don't trust some other
4506 process not to have already sent a packet to us (by random) so send
4507 a packet from each to the other. */
4508 i = 1;
4509 do {
3aed30dc
HS		 4510 /* I'm going to send my own port number. As a short.
4511 (Who knows if someone somewhere has sin_port as a bitfield and needs
4512 this routine. (I'm assuming crays have socketpair)) */
4513 port = addresses[i].sin_port;
4514 got = PerlLIO_write(sockets[i], &port, sizeof(port));
4515 if (got != sizeof(port)) {
4516 if (got == -1)
4517 goto tidy_up_and_fail;
4518 goto abort_tidy_up_and_fail;
4519 }
02fc2eee
NC		 4520 } while (i--);
4521
4522 /* Packets sent. I don't trust them to have arrived though.
4523 (As I understand it Solaris TCP stack is multithreaded. Non-blocking
4524 connect to localhost will use a second kernel thread. In 2.6 the
4525 first thread running the connect() returns before the second completes,
4526 so EINPROGRESS> In 2.7 the improved stack is faster and connect()
4527 returns 0. Poor programs have tripped up. One poor program's authors'
4528 had a 50-1 reverse stock split. Not sure how connected these were.)
4529 So I don't trust someone not to have an unpredictable UDP stack.
4530 */
4531
4532 {
3aed30dc
HS		 4533 struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */
4534 int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0];
4535 fd_set rset;
4536
4537 FD_ZERO(&rset);
4538 FD_SET(sockets[0], &rset);
4539 FD_SET(sockets[1], &rset);
4540
4541 got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor);
4542 if (got != 2 || !FD_ISSET(sockets[0], &rset)
4543 || !FD_ISSET(sockets[1], &rset)) {
4544 /* I hope this is portable and appropriate. */
4545 if (got == -1)
4546 goto tidy_up_and_fail;
4547 goto abort_tidy_up_and_fail;
4548 }
02fc2eee 4549 }
f4758303 4550
02fc2eee
NC		 4551 /* And the paranoia department even now doesn't trust it to have arrive
4552 (hence MSG_DONTWAIT). Or that what arrives was sent by us. */
4553 {
3aed30dc
HS		 4554 struct sockaddr_in readfrom;
4555 unsigned short buffer[2];
02fc2eee 4556
3aed30dc
HS		 4557 i = 1;
4558 do {
02fc2eee 4559#ifdef MSG_DONTWAIT
3aed30dc
HS		 4560 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4561 sizeof(buffer), MSG_DONTWAIT,
4562 (struct sockaddr *) &readfrom, &size);
02fc2eee 4563#else
3aed30dc
HS		 4564 got = PerlSock_recvfrom(sockets[i], (char *) &buffer,
4565 sizeof(buffer), 0,
4566 (struct sockaddr *) &readfrom, &size);
e10bb1e9 4567#endif
02fc2eee 4568
3aed30dc
HS		 4569 if (got == -1)
4570 goto tidy_up_and_fail;
4571 if (got != sizeof(port)
4572 || size != sizeof(struct sockaddr_in)
4573 /* Check other socket sent us its port. */
4574 || buffer[0] != (unsigned short) addresses[!i].sin_port
4575 /* Check kernel says we got the datagram from that socket */
4576 || readfrom.sin_family != addresses[!i].sin_family
4577 || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr
4578 || readfrom.sin_port != addresses[!i].sin_port)
4579 goto abort_tidy_up_and_fail;
4580 } while (i--);
02fc2eee
NC		 4581 }
4582 /* My caller (my_socketpair) has validated that this is non-NULL */
4583 fd[0] = sockets[0];
4584 fd[1] = sockets[1];
4585 /* I hereby declare this connection open. May God bless all who cross
4586 her. */
4587 return 0;
4588
4589 abort_tidy_up_and_fail:
4590 errno = ECONNABORTED;
4591 tidy_up_and_fail:
4592 {
4373e329 4593 const int save_errno = errno;
3aed30dc
HS		 4594 if (sockets[0] != -1)
4595 PerlLIO_close(sockets[0]);
4596 if (sockets[1] != -1)
4597 PerlLIO_close(sockets[1]);
4598 errno = save_errno;
4599 return -1;
02fc2eee
NC		 4600 }
4601}
85ca448a 4602#endif /* EMULATE_SOCKETPAIR_UDP */
02fc2eee 4603
b5ac89c3 4604#if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET)
02fc2eee
NC		 4605int
4606Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
4607 /* Stevens says that family must be AF_LOCAL, protocol 0.
2948e0bd 4608 I'm going to enforce that, then ignore it, and use TCP (or UDP). */
e10bb1e9 4609 dTHX;
02fc2eee
NC		 4610 int listener = -1;
4611 int connector = -1;
4612 int acceptor = -1;
4613 struct sockaddr_in listen_addr;
4614 struct sockaddr_in connect_addr;
4615 Sock_size_t size;
4616
50458334
JH		 4617 if (protocol
4618#ifdef AF_UNIX
4619 || family != AF_UNIX
4620#endif
3aed30dc
HS		 4621 ) {
4622 errno = EAFNOSUPPORT;
4623 return -1;
02fc2eee 4624 }
2948e0bd 4625 if (!fd) {
3aed30dc
HS		 4626 errno = EINVAL;
4627 return -1;
2948e0bd 4628 }
02fc2eee 4629
2bc69dc4 4630#ifdef EMULATE_SOCKETPAIR_UDP
02fc2eee 4631 if (type == SOCK_DGRAM)
3aed30dc 4632 return S_socketpair_udp(fd);
2bc69dc4 4633#endif
02fc2eee 4634
3aed30dc 4635 listener = PerlSock_socket(AF_INET, type, 0);
02fc2eee 4636 if (listener == -1)
3aed30dc
HS		 4637 return -1;
4638 memset(&listen_addr, 0, sizeof(listen_addr));
02fc2eee 4639 listen_addr.sin_family = AF_INET;
3aed30dc 4640 listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
02fc2eee 4641 listen_addr.sin_port = 0; /* kernel choses port. */
3aed30dc
HS		 4642 if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr,
4643 sizeof(listen_addr)) == -1)
4644 goto tidy_up_and_fail;
e10bb1e9 4645 if (PerlSock_listen(listener, 1) == -1)
3aed30dc 4646 goto tidy_up_and_fail;
02fc2eee 4647
3aed30dc 4648 connector = PerlSock_socket(AF_INET, type, 0);
02fc2eee 4649 if (connector == -1)
3aed30dc 4650 goto tidy_up_and_fail;
02fc2eee 4651 /* We want to find out the port number to connect to. */
3aed30dc
HS		 4652 size = sizeof(connect_addr);
4653 if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr,
4654 &size) == -1)
4655 goto tidy_up_and_fail;
4656 if (size != sizeof(connect_addr))
4657 goto abort_tidy_up_and_fail;
e10bb1e9 4658 if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr,
3aed30dc
HS		 4659 sizeof(connect_addr)) == -1)
4660 goto tidy_up_and_fail;
02fc2eee 4661
3aed30dc
HS		 4662 size = sizeof(listen_addr);
4663 acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr,
4664 &size);
02fc2eee 4665 if (acceptor == -1)
3aed30dc
HS		 4666 goto tidy_up_and_fail;
4667 if (size != sizeof(listen_addr))
4668 goto abort_tidy_up_and_fail;
4669 PerlLIO_close(listener);
02fc2eee
NC		 4670 /* Now check we are talking to ourself by matching port and host on the
4671 two sockets. */
3aed30dc
HS		 4672 if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr,
4673 &size) == -1)
4674 goto tidy_up_and_fail;
4675 if (size != sizeof(connect_addr)
4676 || listen_addr.sin_family != connect_addr.sin_family
4677 || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr
4678 || listen_addr.sin_port != connect_addr.sin_port) {
4679 goto abort_tidy_up_and_fail;
02fc2eee
NC		 4680 }
4681 fd[0] = connector;
4682 fd[1] = acceptor;
4683 return 0;
4684
4685 abort_tidy_up_and_fail:
27da23d5
JH		 4686#ifdef ECONNABORTED
4687 errno = ECONNABORTED; /* This would be the standard thing to do. */
4688#else
4689# ifdef ECONNREFUSED
4690 errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */
4691# else
4692 errno = ETIMEDOUT; /* Desperation time. */
4693# endif
4694#endif
02fc2eee
NC		 4695 tidy_up_and_fail:
4696 {
3aed30dc
HS		 4697 int save_errno = errno;
4698 if (listener != -1)
4699 PerlLIO_close(listener);
4700 if (connector != -1)
4701 PerlLIO_close(connector);
4702 if (acceptor != -1)
4703 PerlLIO_close(acceptor);
4704 errno = save_errno;
4705 return -1;
02fc2eee
NC		 4706 }
4707}
85ca448a 4708#else
48ea76d1
JH		 4709/* In any case have a stub so that there's code corresponding
4710 * to the my_socketpair in global.sym. */
4711int
4712Perl_my_socketpair (int family, int type, int protocol, int fd[2]) {
daf16542 4713#ifdef HAS_SOCKETPAIR
48ea76d1 4714 return socketpair(family, type, protocol, fd);
daf16542
JH		 4715#else
4716 return -1;
4717#endif
48ea76d1
JH		 4718}
4719#endif
4720
68795e93
NIS		 4721/*
4722
4723=for apidoc sv_nosharing
4724
4725Dummy routine which "shares" an SV when there is no sharing module present.
4726Exists to avoid test for a NULL function pointer and because it could potentially warn under
4727some level of strict-ness.
4728
4729=cut
4730*/
4731
4732void
4733Perl_sv_nosharing(pTHX_ SV *sv)
4734{
53c1dcc0 4735 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4736}
4737
4738/*
4739=for apidoc sv_nolocking
4740
4741Dummy routine which "locks" an SV when there is no locking module present.
4742Exists to avoid test for a NULL function pointer and because it could potentially warn under
4743some level of strict-ness.
4744
4745=cut
4746*/
4747
4748void
4749Perl_sv_nolocking(pTHX_ SV *sv)
4750{
53c1dcc0 4751 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4752}
4753
4754
4755/*
4756=for apidoc sv_nounlocking
4757
4758Dummy routine which "unlocks" an SV when there is no locking module present.
4759Exists to avoid test for a NULL function pointer and because it could potentially warn under
4760some level of strict-ness.
4761
4762=cut
4763*/
4764
4765void
4766Perl_sv_nounlocking(pTHX_ SV *sv)
4767{
53c1dcc0 4768 PERL_UNUSED_ARG(sv);
68795e93
NIS		 4769}
4770
a05d7ebb 4771U32
e1ec3a88 4772Perl_parse_unicode_opts(pTHX_ const char **popt)
a05d7ebb 4773{
e1ec3a88 4774 const char *p = *popt;
a05d7ebb
JH		 4775 U32 opt = 0;
4776
4777 if (*p) {
4778 if (isDIGIT(*p)) {
4779 opt = (U32) atoi(p);
4780 while (isDIGIT(*p)) p++;
7c91f477 4781 if (*p && *p != '\n' && *p != '\r')
a05d7ebb
JH		 4782 Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p);
4783 }
4784 else {
4785 for (; *p; p++) {
4786 switch (*p) {
4787 case PERL_UNICODE_STDIN:
4788 opt |= PERL_UNICODE_STDIN_FLAG; break;
4789 case PERL_UNICODE_STDOUT:
4790 opt |= PERL_UNICODE_STDOUT_FLAG; break;
4791 case PERL_UNICODE_STDERR:
4792 opt |= PERL_UNICODE_STDERR_FLAG; break;
4793 case PERL_UNICODE_STD:
4794 opt |= PERL_UNICODE_STD_FLAG; break;
4795 case PERL_UNICODE_IN:
4796 opt |= PERL_UNICODE_IN_FLAG; break;
4797 case PERL_UNICODE_OUT:
4798 opt |= PERL_UNICODE_OUT_FLAG; break;
4799 case PERL_UNICODE_INOUT:
4800 opt |= PERL_UNICODE_INOUT_FLAG; break;
4801 case PERL_UNICODE_LOCALE:
4802 opt |= PERL_UNICODE_LOCALE_FLAG; break;
4803 case PERL_UNICODE_ARGV:
4804 opt |= PERL_UNICODE_ARGV_FLAG; break;
4805 default:
7c91f477
JH		 4806 if (*p != '\n' && *p != '\r')
4807 Perl_croak(aTHX_
4808 "Unknown Unicode option letter '%c'", *p);
a05d7ebb
JH		 4809 }
4810 }
4811 }
4812 }
4813 else
4814 opt = PERL_UNICODE_DEFAULT_FLAGS;
4815
4816 if (opt & ~PERL_UNICODE_ALL_FLAGS)
06e66572 4817 Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf,
a05d7ebb
JH		 4818 (UV) (opt & ~PERL_UNICODE_ALL_FLAGS));
4819
4820 *popt = p;
4821
4822 return opt;
4823}
4824
132efe8b
JH		 4825U32
4826Perl_seed(pTHX)
4827{
4828 /*
4829 * This is really just a quick hack which grabs various garbage
4830 * values. It really should be a real hash algorithm which
4831 * spreads the effect of every input bit onto every output bit,
4832 * if someone who knows about such things would bother to write it.
4833 * Might be a good idea to add that function to CORE as well.
4834 * No numbers below come from careful analysis or anything here,
4835 * except they are primes and SEED_C1 > 1E6 to get a full-width
4836 * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should
4837 * probably be bigger too.
4838 */
4839#if RANDBITS > 16
4840# define SEED_C1 1000003
4841#define SEED_C4 73819
4842#else
4843# define SEED_C1 25747
4844#define SEED_C4 20639
4845#endif
4846#define SEED_C2 3
4847#define SEED_C3 269
4848#define SEED_C5 26107
4849
4850#ifndef PERL_NO_DEV_RANDOM
4851 int fd;
4852#endif
4853 U32 u;
4854#ifdef VMS
4855# include <starlet.h>
4856 /* when[] = (low 32 bits, high 32 bits) of time since epoch
4857 * in 100-ns units, typically incremented ever 10 ms. */
4858 unsigned int when[2];
4859#else
4860# ifdef HAS_GETTIMEOFDAY
4861 struct timeval when;
4862# else
4863 Time_t when;
4864# endif
4865#endif
4866
4867/* This test is an escape hatch, this symbol isn't set by Configure. */
4868#ifndef PERL_NO_DEV_RANDOM
4869#ifndef PERL_RANDOM_DEVICE
4870 /* /dev/random isn't used by default because reads from it will block
4871 * if there isn't enough entropy available. You can compile with
4872 * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there
4873 * is enough real entropy to fill the seed. */
4874# define PERL_RANDOM_DEVICE "/dev/urandom"
4875#endif
4876 fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0);
4877 if (fd != -1) {
27da23d5 4878 if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u)
132efe8b
JH		 4879 u = 0;
4880 PerlLIO_close(fd);
4881 if (u)
4882 return u;
4883 }
4884#endif
4885
4886#ifdef VMS
4887 _ckvmssts(sys$gettim(when));
4888 u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1];
4889#else
4890# ifdef HAS_GETTIMEOFDAY
4891 PerlProc_gettimeofday(&when,NULL);
4892 u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec;
4893# else
4894 (void)time(&when);
4895 u = (U32)SEED_C1 * when;
4896# endif
4897#endif
4898 u += SEED_C3 * (U32)PerlProc_getpid();
4899 u += SEED_C4 * (U32)PTR2UV(PL_stack_sp);
4900#ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */
4901 u += SEED_C5 * (U32)PTR2UV(&when);
4902#endif
4903 return u;
4904}
4905
bed60192 4906UV
a783c5f4 4907Perl_get_hash_seed(pTHX)
bed60192 4908{
e1ec3a88 4909 const char *s = PerlEnv_getenv("PERL_HASH_SEED");
bed60192
JH		 4910 UV myseed = 0;
4911
4912 if (s)
4913 while (isSPACE(*s)) s++;
4914 if (s && isDIGIT(*s))
4915 myseed = (UV)Atoul(s);
4916 else
4917#ifdef USE_HASH_SEED_EXPLICIT
4918 if (s)
4919#endif
4920 {
4921 /* Compute a random seed */
4922 (void)seedDrand01((Rand_seed_t)seed());
bed60192
JH		 4923 myseed = (UV)(Drand01() * (NV)UV_MAX);
4924#if RANDBITS < (UVSIZE * 8)
4925 /* Since there are not enough randbits to to reach all
4926 * the bits of a UV, the low bits might need extra
4927 * help. Sum in another random number that will
4928 * fill in the low bits. */
4929 myseed +=
4930 (UV)(Drand01() * (NV)((1 << ((UVSIZE * 8 - RANDBITS))) - 1));
4931#endif /* RANDBITS < (UVSIZE * 8) */
6cfd5ea7
JH		 4932 if (myseed == 0) { /* Superparanoia. */
4933 myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */
4934 if (myseed == 0)
4935 Perl_croak(aTHX_ "Your random numbers are not that random");
4936 }
bed60192 4937 }
008fb0c0 4938 PL_rehash_seed_set = TRUE;
bed60192
JH		 4939
4940 return myseed;
4941}
27da23d5 4942
ed221c57
AL		 4943#ifdef USE_ITHREADS
4944bool
4945Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv)
4946{
4947 const char * const stashpv = CopSTASHPV(c);
4948 const char * const name = HvNAME_get(hv);
4949
4950 if (stashpv == name)
4951 return TRUE;
4952 if (stashpv && name)
4953 if (strEQ(stashpv, name))
4954 return TRUE;
4955 return FALSE;
4956}
4957#endif
4958
4959
27da23d5
JH		 4960#ifdef PERL_GLOBAL_STRUCT
4961
4962struct perl_vars *
4963Perl_init_global_struct(pTHX)
4964{
4965 struct perl_vars *plvarsp = NULL;
4966#ifdef PERL_GLOBAL_STRUCT
4967# define PERL_GLOBAL_STRUCT_INIT
4968# include "opcode.h" /* the ppaddr and check */
4969 IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t);
4970 IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t);
4971# ifdef PERL_GLOBAL_STRUCT_PRIVATE
4972 /* PerlMem_malloc() because can't use even safesysmalloc() this early. */
4973 plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars));
4974 if (!plvarsp)
4975 exit(1);
4976# else
4977 plvarsp = PL_VarsPtr;
4978# endif /* PERL_GLOBAL_STRUCT_PRIVATE */
aadb217d
JH		 4979# undef PERLVAR
4980# undef PERLVARA
4981# undef PERLVARI
4982# undef PERLVARIC
4983# undef PERLVARISC
27da23d5
JH		 4984# define PERLVAR(var,type) /**/
4985# define PERLVARA(var,n,type) /**/
4986# define PERLVARI(var,type,init) plvarsp->var = init;
4987# define PERLVARIC(var,type,init) plvarsp->var = init;
4988# define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char);
4989# include "perlvars.h"
4990# undef PERLVAR
4991# undef PERLVARA
4992# undef PERLVARI
4993# undef PERLVARIC
4994# undef PERLVARISC
4995# ifdef PERL_GLOBAL_STRUCT
4996 plvarsp->Gppaddr = PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t));
4997 if (!plvarsp->Gppaddr)
4998 exit(1);
4999 plvarsp->Gcheck = PerlMem_malloc(ncheck * sizeof(Perl_check_t));
5000 if (!plvarsp->Gcheck)
5001 exit(1);
5002 Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t);
5003 Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t);
5004# endif
5005# ifdef PERL_SET_VARS
5006 PERL_SET_VARS(plvarsp);
5007# endif
5008# undef PERL_GLOBAL_STRUCT_INIT
5009#endif
5010 return plvarsp;
5011}
5012
5013#endif /* PERL_GLOBAL_STRUCT */
5014
5015#ifdef PERL_GLOBAL_STRUCT
5016
5017void
5018Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp)
5019{
5020#ifdef PERL_GLOBAL_STRUCT
5021# ifdef PERL_UNSET_VARS
5022 PERL_UNSET_VARS(plvarsp);
5023# endif
5024 free(plvarsp->Gppaddr);
5025 free(plvarsp->Gcheck);
5026# ifdef PERL_GLOBAL_STRUCT_PRIVATE
5027 free(plvarsp);
5028# endif
5029#endif
5030}
5031
5032#endif /* PERL_GLOBAL_STRUCT */
5033
fe4f188c
JH		 5034#ifdef PERL_MEM_LOG
5035
e352bcff
JH		 5036#define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128
5037
fe4f188c 5038Malloc_t
46c6c7e2 5039Perl_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		 5040{
5041#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5042 /* We can't use PerlIO for obvious reasons. */
5043 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
fe4f188c 5044 sprintf(buf,
46c6c7e2
JH		 5045 "alloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf"\n",
5046 filename, linenumber, funcname,
5047 n, typesize, typename, n * typesize, PTR2UV(newalloc));
e352bcff 5048 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5049#endif
5050 return newalloc;
5051}
5052
5053Malloc_t
46c6c7e2 5054Perl_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		 5055{
5056#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5057 /* We can't use PerlIO for obvious reasons. */
5058 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
fe4f188c 5059 sprintf(buf,
46c6c7e2
JH		 5060 "realloc: %s:%d:%s: %"IVdf" %"UVuf" %s = %"IVdf": %"UVxf" -> %"UVxf"\n",
5061 filename, linenumber, funcname,
5062 n, typesize, typename, n * typesize, PTR2UV(oldalloc), PTR2UV(newalloc));
e352bcff 5063 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5064#endif
5065 return newalloc;
5066}
5067
5068Malloc_t
46c6c7e2 5069Perl_mem_log_free(Malloc_t oldalloc, const char *filename, const int linenumber, const char *funcname)
fe4f188c
JH		 5070{
5071#ifdef PERL_MEM_LOG_STDERR
e352bcff
JH		 5072 /* We can't use PerlIO for obvious reasons. */
5073 char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE];
46c6c7e2
JH		 5074 sprintf(buf, "free: %s:%d:%s: %"UVxf"\n",
5075 filename, linenumber, funcname, PTR2UV(oldalloc));
e352bcff 5076 PerlLIO_write(2, buf, strlen(buf));
fe4f188c
JH		 5077#endif
5078 return oldalloc;
5079}
5080
5081#endif /* PERL_MEM_LOG */
5082
66610fdd
RGS		 5083/*
5084 * Local variables:
5085 * c-indentation-style: bsd
5086 * c-basic-offset: 4
5087 * indent-tabs-mode: t
5088 * End:
5089 *
37442d52
RGS		 5090 * ex: set ts=8 sts=4 sw=4 noet:
5091 */
Unnamed repository; edit this file 'description' to name the repository.