Commit | Line | Data |
---|---|---|
a0d0e21e | 1 | /* util.c |
a687059c | 2 | * |
1129b882 NC |
3 | * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, |
4 | * 2002, 2003, 2004, 2005, 2006, 2007, 2008 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 | /* | |
4ac71550 TC |
12 | * 'Very useful, no doubt, that was to Saruman; yet it seems that he was |
13 | * not content.' --Gandalf to Pippin | |
14 | * | |
15 | * [p.598 of _The Lord of the Rings_, III/xi: "The Palantír"] | |
a0d0e21e | 16 | */ |
8d063cd8 | 17 | |
166f8a29 DM |
18 | /* This file contains assorted utility routines. |
19 | * Which is a polite way of saying any stuff that people couldn't think of | |
20 | * a better place for. Amongst other things, it includes the warning and | |
21 | * dieing stuff, plus wrappers for malloc code. | |
22 | */ | |
23 | ||
8d063cd8 | 24 | #include "EXTERN.h" |
864dbfa3 | 25 | #define PERL_IN_UTIL_C |
8d063cd8 | 26 | #include "perl.h" |
62b28dd9 | 27 | |
64ca3a65 | 28 | #ifndef PERL_MICRO |
a687059c | 29 | #include <signal.h> |
36477c24 | 30 | #ifndef SIG_ERR |
31 | # define SIG_ERR ((Sighandler_t) -1) | |
32 | #endif | |
64ca3a65 | 33 | #endif |
36477c24 | 34 | |
172d2248 OS |
35 | #ifdef __Lynx__ |
36 | /* Missing protos on LynxOS */ | |
37 | int putenv(char *); | |
38 | #endif | |
39 | ||
ff68c719 | 40 | #ifdef I_SYS_WAIT |
41 | # include <sys/wait.h> | |
42 | #endif | |
43 | ||
868439a2 JH |
44 | #ifdef HAS_SELECT |
45 | # ifdef I_SYS_SELECT | |
46 | # include <sys/select.h> | |
47 | # endif | |
48 | #endif | |
49 | ||
8d063cd8 | 50 | #define FLUSH |
8d063cd8 | 51 | |
16cebae2 GS |
52 | #if defined(HAS_FCNTL) && defined(F_SETFD) && !defined(FD_CLOEXEC) |
53 | # define FD_CLOEXEC 1 /* NeXT needs this */ | |
54 | #endif | |
55 | ||
a687059c LW |
56 | /* NOTE: Do not call the next three routines directly. Use the macros |
57 | * in handy.h, so that we can easily redefine everything to do tracking of | |
58 | * allocated hunks back to the original New to track down any memory leaks. | |
20cec16a | 59 | * XXX This advice seems to be widely ignored :-( --AD August 1996. |
a687059c LW |
60 | */ |
61 | ||
ca8d8976 NC |
62 | static char * |
63 | S_write_no_mem(pTHX) | |
64 | { | |
97aff369 | 65 | dVAR; |
ca8d8976 NC |
66 | /* Can't use PerlIO to write as it allocates memory */ |
67 | PerlLIO_write(PerlIO_fileno(Perl_error_log), | |
68 | PL_no_mem, strlen(PL_no_mem)); | |
69 | my_exit(1); | |
1f440eb2 | 70 | NORETURN_FUNCTION_END; |
ca8d8976 NC |
71 | } |
72 | ||
26fa51c3 AMS |
73 | /* paranoid version of system's malloc() */ |
74 | ||
bd4080b3 | 75 | Malloc_t |
4f63d024 | 76 | Perl_safesysmalloc(MEM_SIZE size) |
8d063cd8 | 77 | { |
54aff467 | 78 | dTHX; |
bd4080b3 | 79 | Malloc_t ptr; |
55497cff | 80 | #ifdef HAS_64K_LIMIT |
62b28dd9 | 81 | if (size > 0xffff) { |
bf49b057 | 82 | PerlIO_printf(Perl_error_log, |
16cebae2 | 83 | "Allocation too large: %lx\n", size) FLUSH; |
54aff467 | 84 | my_exit(1); |
62b28dd9 | 85 | } |
55497cff | 86 | #endif /* HAS_64K_LIMIT */ |
e8dda941 JD |
87 | #ifdef PERL_TRACK_MEMPOOL |
88 | size += sTHX; | |
89 | #endif | |
34de22dd LW |
90 | #ifdef DEBUGGING |
91 | if ((long)size < 0) | |
4f63d024 | 92 | Perl_croak_nocontext("panic: malloc"); |
34de22dd | 93 | #endif |
12ae5dfc | 94 | ptr = (Malloc_t)PerlMem_malloc(size?size:1); /* malloc(0) is NASTY on our system */ |
da927450 | 95 | PERL_ALLOC_CHECK(ptr); |
97835f67 | 96 | DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) malloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size)); |
bd61b366 | 97 | if (ptr != NULL) { |
e8dda941 | 98 | #ifdef PERL_TRACK_MEMPOOL |
7cb608b5 NC |
99 | struct perl_memory_debug_header *const header |
100 | = (struct perl_memory_debug_header *)ptr; | |
9a083ecf NC |
101 | #endif |
102 | ||
103 | #ifdef PERL_POISON | |
7e337ee0 | 104 | PoisonNew(((char *)ptr), size, char); |
9a083ecf | 105 | #endif |
7cb608b5 | 106 | |
9a083ecf | 107 | #ifdef PERL_TRACK_MEMPOOL |
7cb608b5 NC |
108 | header->interpreter = aTHX; |
109 | /* Link us into the list. */ | |
110 | header->prev = &PL_memory_debug_header; | |
111 | header->next = PL_memory_debug_header.next; | |
112 | PL_memory_debug_header.next = header; | |
113 | header->next->prev = header; | |
cd1541b2 | 114 | # ifdef PERL_POISON |
7cb608b5 | 115 | header->size = size; |
cd1541b2 | 116 | # endif |
e8dda941 JD |
117 | ptr = (Malloc_t)((char*)ptr+sTHX); |
118 | #endif | |
8d063cd8 | 119 | return ptr; |
e8dda941 | 120 | } |
3280af22 | 121 | else if (PL_nomemok) |
bd61b366 | 122 | return NULL; |
8d063cd8 | 123 | else { |
0bd48802 | 124 | return write_no_mem(); |
8d063cd8 LW |
125 | } |
126 | /*NOTREACHED*/ | |
127 | } | |
128 | ||
f2517201 | 129 | /* paranoid version of system's realloc() */ |
8d063cd8 | 130 | |
bd4080b3 | 131 | Malloc_t |
4f63d024 | 132 | Perl_safesysrealloc(Malloc_t where,MEM_SIZE size) |
8d063cd8 | 133 | { |
54aff467 | 134 | dTHX; |
bd4080b3 | 135 | Malloc_t ptr; |
9a34ef1d | 136 | #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) && !defined(PERL_MICRO) |
6ad3d225 | 137 | Malloc_t PerlMem_realloc(); |
ecfc5424 | 138 | #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */ |
8d063cd8 | 139 | |
a1d180c4 | 140 | #ifdef HAS_64K_LIMIT |
5f05dabc | 141 | if (size > 0xffff) { |
bf49b057 | 142 | PerlIO_printf(Perl_error_log, |
5f05dabc | 143 | "Reallocation too large: %lx\n", size) FLUSH; |
54aff467 | 144 | my_exit(1); |
5f05dabc | 145 | } |
55497cff | 146 | #endif /* HAS_64K_LIMIT */ |
7614df0c | 147 | if (!size) { |
f2517201 | 148 | safesysfree(where); |
7614df0c JD |
149 | return NULL; |
150 | } | |
151 | ||
378cc40b | 152 | if (!where) |
f2517201 | 153 | return safesysmalloc(size); |
e8dda941 JD |
154 | #ifdef PERL_TRACK_MEMPOOL |
155 | where = (Malloc_t)((char*)where-sTHX); | |
156 | size += sTHX; | |
7cb608b5 NC |
157 | { |
158 | struct perl_memory_debug_header *const header | |
159 | = (struct perl_memory_debug_header *)where; | |
160 | ||
161 | if (header->interpreter != aTHX) { | |
162 | Perl_croak_nocontext("panic: realloc from wrong pool"); | |
163 | } | |
164 | assert(header->next->prev == header); | |
165 | assert(header->prev->next == header); | |
cd1541b2 | 166 | # ifdef PERL_POISON |
7cb608b5 NC |
167 | if (header->size > size) { |
168 | const MEM_SIZE freed_up = header->size - size; | |
169 | char *start_of_freed = ((char *)where) + size; | |
7e337ee0 | 170 | PoisonFree(start_of_freed, freed_up, char); |
7cb608b5 NC |
171 | } |
172 | header->size = size; | |
cd1541b2 | 173 | # endif |
7cb608b5 | 174 | } |
e8dda941 | 175 | #endif |
34de22dd LW |
176 | #ifdef DEBUGGING |
177 | if ((long)size < 0) | |
4f63d024 | 178 | Perl_croak_nocontext("panic: realloc"); |
34de22dd | 179 | #endif |
12ae5dfc | 180 | ptr = (Malloc_t)PerlMem_realloc(where,size); |
da927450 | 181 | PERL_ALLOC_CHECK(ptr); |
a1d180c4 | 182 | |
4fd0a9b8 NC |
183 | /* MUST do this fixup first, before doing ANYTHING else, as anything else |
184 | might allocate memory/free/move memory, and until we do the fixup, it | |
185 | may well be chasing (and writing to) free memory. */ | |
e8dda941 | 186 | #ifdef PERL_TRACK_MEMPOOL |
4fd0a9b8 | 187 | if (ptr != NULL) { |
7cb608b5 NC |
188 | struct perl_memory_debug_header *const header |
189 | = (struct perl_memory_debug_header *)ptr; | |
190 | ||
9a083ecf NC |
191 | # ifdef PERL_POISON |
192 | if (header->size < size) { | |
193 | const MEM_SIZE fresh = size - header->size; | |
194 | char *start_of_fresh = ((char *)ptr) + size; | |
7e337ee0 | 195 | PoisonNew(start_of_fresh, fresh, char); |
9a083ecf NC |
196 | } |
197 | # endif | |
198 | ||
7cb608b5 NC |
199 | header->next->prev = header; |
200 | header->prev->next = header; | |
201 | ||
e8dda941 | 202 | ptr = (Malloc_t)((char*)ptr+sTHX); |
4fd0a9b8 | 203 | } |
e8dda941 | 204 | #endif |
4fd0a9b8 NC |
205 | |
206 | /* In particular, must do that fixup above before logging anything via | |
207 | *printf(), as it can reallocate memory, which can cause SEGVs. */ | |
208 | ||
209 | DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) rfree\n",PTR2UV(where),(long)PL_an++)); | |
210 | DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) realloc %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)size)); | |
211 | ||
212 | ||
213 | if (ptr != NULL) { | |
8d063cd8 | 214 | return ptr; |
e8dda941 | 215 | } |
3280af22 | 216 | else if (PL_nomemok) |
bd61b366 | 217 | return NULL; |
8d063cd8 | 218 | else { |
0bd48802 | 219 | return write_no_mem(); |
8d063cd8 LW |
220 | } |
221 | /*NOTREACHED*/ | |
222 | } | |
223 | ||
f2517201 | 224 | /* safe version of system's free() */ |
8d063cd8 | 225 | |
54310121 | 226 | Free_t |
4f63d024 | 227 | Perl_safesysfree(Malloc_t where) |
8d063cd8 | 228 | { |
e8dda941 | 229 | #if defined(PERL_IMPLICIT_SYS) || defined(PERL_TRACK_MEMPOOL) |
54aff467 | 230 | dTHX; |
97aff369 JH |
231 | #else |
232 | dVAR; | |
155aba94 | 233 | #endif |
97835f67 | 234 | DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) free\n",PTR2UV(where),(long)PL_an++)); |
378cc40b | 235 | if (where) { |
e8dda941 JD |
236 | #ifdef PERL_TRACK_MEMPOOL |
237 | where = (Malloc_t)((char*)where-sTHX); | |
cd1541b2 | 238 | { |
7cb608b5 NC |
239 | struct perl_memory_debug_header *const header |
240 | = (struct perl_memory_debug_header *)where; | |
241 | ||
242 | if (header->interpreter != aTHX) { | |
243 | Perl_croak_nocontext("panic: free from wrong pool"); | |
244 | } | |
245 | if (!header->prev) { | |
cd1541b2 NC |
246 | Perl_croak_nocontext("panic: duplicate free"); |
247 | } | |
7cb608b5 NC |
248 | if (!(header->next) || header->next->prev != header |
249 | || header->prev->next != header) { | |
250 | Perl_croak_nocontext("panic: bad free"); | |
cd1541b2 | 251 | } |
7cb608b5 NC |
252 | /* Unlink us from the chain. */ |
253 | header->next->prev = header->prev; | |
254 | header->prev->next = header->next; | |
255 | # ifdef PERL_POISON | |
7e337ee0 | 256 | PoisonNew(where, header->size, char); |
cd1541b2 | 257 | # endif |
7cb608b5 NC |
258 | /* Trigger the duplicate free warning. */ |
259 | header->next = NULL; | |
260 | } | |
e8dda941 | 261 | #endif |
6ad3d225 | 262 | PerlMem_free(where); |
378cc40b | 263 | } |
8d063cd8 LW |
264 | } |
265 | ||
f2517201 | 266 | /* safe version of system's calloc() */ |
1050c9ca | 267 | |
bd4080b3 | 268 | Malloc_t |
4f63d024 | 269 | Perl_safesyscalloc(MEM_SIZE count, MEM_SIZE size) |
1050c9ca | 270 | { |
54aff467 | 271 | dTHX; |
bd4080b3 | 272 | Malloc_t ptr; |
ad7244db | 273 | MEM_SIZE total_size = 0; |
1050c9ca | 274 | |
ad7244db | 275 | /* Even though calloc() for zero bytes is strange, be robust. */ |
19a94d75 | 276 | if (size && (count <= MEM_SIZE_MAX / size)) |
ad7244db JH |
277 | total_size = size * count; |
278 | else | |
f1f66076 | 279 | Perl_croak_nocontext("%s", PL_memory_wrap); |
ad7244db | 280 | #ifdef PERL_TRACK_MEMPOOL |
19a94d75 | 281 | if (sTHX <= MEM_SIZE_MAX - (MEM_SIZE)total_size) |
ad7244db JH |
282 | total_size += sTHX; |
283 | else | |
f1f66076 | 284 | Perl_croak_nocontext("%s", PL_memory_wrap); |
ad7244db | 285 | #endif |
55497cff | 286 | #ifdef HAS_64K_LIMIT |
e1a95402 | 287 | if (total_size > 0xffff) { |
bf49b057 | 288 | PerlIO_printf(Perl_error_log, |
e1a95402 | 289 | "Allocation too large: %lx\n", total_size) FLUSH; |
54aff467 | 290 | my_exit(1); |
5f05dabc | 291 | } |
55497cff | 292 | #endif /* HAS_64K_LIMIT */ |
1050c9ca | 293 | #ifdef DEBUGGING |
294 | if ((long)size < 0 || (long)count < 0) | |
4f63d024 | 295 | Perl_croak_nocontext("panic: calloc"); |
1050c9ca | 296 | #endif |
e8dda941 | 297 | #ifdef PERL_TRACK_MEMPOOL |
e1a95402 NC |
298 | /* Have to use malloc() because we've added some space for our tracking |
299 | header. */ | |
ad7244db JH |
300 | /* malloc(0) is non-portable. */ |
301 | ptr = (Malloc_t)PerlMem_malloc(total_size ? total_size : 1); | |
e1a95402 NC |
302 | #else |
303 | /* Use calloc() because it might save a memset() if the memory is fresh | |
304 | and clean from the OS. */ | |
ad7244db JH |
305 | if (count && size) |
306 | ptr = (Malloc_t)PerlMem_calloc(count, size); | |
307 | else /* calloc(0) is non-portable. */ | |
308 | ptr = (Malloc_t)PerlMem_calloc(count ? count : 1, size ? size : 1); | |
e8dda941 | 309 | #endif |
da927450 | 310 | PERL_ALLOC_CHECK(ptr); |
e1a95402 | 311 | DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) calloc %ld x %ld bytes\n",PTR2UV(ptr),(long)PL_an++,(long)count,(long)total_size)); |
bd61b366 | 312 | if (ptr != NULL) { |
e8dda941 | 313 | #ifdef PERL_TRACK_MEMPOOL |
7cb608b5 NC |
314 | { |
315 | struct perl_memory_debug_header *const header | |
316 | = (struct perl_memory_debug_header *)ptr; | |
317 | ||
e1a95402 | 318 | memset((void*)ptr, 0, total_size); |
7cb608b5 NC |
319 | header->interpreter = aTHX; |
320 | /* Link us into the list. */ | |
321 | header->prev = &PL_memory_debug_header; | |
322 | header->next = PL_memory_debug_header.next; | |
323 | PL_memory_debug_header.next = header; | |
324 | header->next->prev = header; | |
cd1541b2 | 325 | # ifdef PERL_POISON |
e1a95402 | 326 | header->size = total_size; |
cd1541b2 | 327 | # endif |
7cb608b5 NC |
328 | ptr = (Malloc_t)((char*)ptr+sTHX); |
329 | } | |
e8dda941 | 330 | #endif |
1050c9ca | 331 | return ptr; |
332 | } | |
3280af22 | 333 | else if (PL_nomemok) |
bd61b366 | 334 | return NULL; |
0bd48802 | 335 | return write_no_mem(); |
1050c9ca | 336 | } |
337 | ||
cae6d0e5 GS |
338 | /* These must be defined when not using Perl's malloc for binary |
339 | * compatibility */ | |
340 | ||
341 | #ifndef MYMALLOC | |
342 | ||
343 | Malloc_t Perl_malloc (MEM_SIZE nbytes) | |
344 | { | |
345 | dTHXs; | |
077a72a9 | 346 | return (Malloc_t)PerlMem_malloc(nbytes); |
cae6d0e5 GS |
347 | } |
348 | ||
349 | Malloc_t Perl_calloc (MEM_SIZE elements, MEM_SIZE size) | |
350 | { | |
351 | dTHXs; | |
077a72a9 | 352 | return (Malloc_t)PerlMem_calloc(elements, size); |
cae6d0e5 GS |
353 | } |
354 | ||
355 | Malloc_t Perl_realloc (Malloc_t where, MEM_SIZE nbytes) | |
356 | { | |
357 | dTHXs; | |
077a72a9 | 358 | return (Malloc_t)PerlMem_realloc(where, nbytes); |
cae6d0e5 GS |
359 | } |
360 | ||
361 | Free_t Perl_mfree (Malloc_t where) | |
362 | { | |
363 | dTHXs; | |
364 | PerlMem_free(where); | |
365 | } | |
366 | ||
367 | #endif | |
368 | ||
8d063cd8 LW |
369 | /* copy a string up to some (non-backslashed) delimiter, if any */ |
370 | ||
371 | char * | |
04c9e624 | 372 | Perl_delimcpy(register char *to, register const char *toend, register const char *from, register const char *fromend, register int delim, I32 *retlen) |
8d063cd8 | 373 | { |
fc36a67e | 374 | register I32 tolen; |
35da51f7 | 375 | |
7918f24d NC |
376 | PERL_ARGS_ASSERT_DELIMCPY; |
377 | ||
fc36a67e | 378 | for (tolen = 0; from < fromend; from++, tolen++) { |
378cc40b | 379 | if (*from == '\\') { |
35da51f7 | 380 | if (from[1] != delim) { |
fc36a67e | 381 | if (to < toend) |
382 | *to++ = *from; | |
383 | tolen++; | |
fc36a67e | 384 | } |
35da51f7 | 385 | from++; |
378cc40b | 386 | } |
bedebaa5 | 387 | else if (*from == delim) |
8d063cd8 | 388 | break; |
fc36a67e | 389 | if (to < toend) |
390 | *to++ = *from; | |
8d063cd8 | 391 | } |
bedebaa5 CS |
392 | if (to < toend) |
393 | *to = '\0'; | |
fc36a67e | 394 | *retlen = tolen; |
73d840c0 | 395 | return (char *)from; |
8d063cd8 LW |
396 | } |
397 | ||
398 | /* return ptr to little string in big string, NULL if not found */ | |
378cc40b | 399 | /* This routine was donated by Corey Satten. */ |
8d063cd8 LW |
400 | |
401 | char * | |
04c9e624 | 402 | Perl_instr(register const char *big, register const char *little) |
378cc40b | 403 | { |
79072805 | 404 | register I32 first; |
378cc40b | 405 | |
7918f24d NC |
406 | PERL_ARGS_ASSERT_INSTR; |
407 | ||
a687059c | 408 | if (!little) |
08105a92 | 409 | return (char*)big; |
a687059c | 410 | first = *little++; |
378cc40b | 411 | if (!first) |
08105a92 | 412 | return (char*)big; |
378cc40b | 413 | while (*big) { |
66a1b24b | 414 | register const char *s, *x; |
378cc40b LW |
415 | if (*big++ != first) |
416 | continue; | |
417 | for (x=big,s=little; *s; /**/ ) { | |
418 | if (!*x) | |
bd61b366 | 419 | return NULL; |
4fc877ac | 420 | if (*s != *x) |
378cc40b | 421 | break; |
4fc877ac AL |
422 | else { |
423 | s++; | |
424 | x++; | |
378cc40b LW |
425 | } |
426 | } | |
427 | if (!*s) | |
08105a92 | 428 | return (char*)(big-1); |
378cc40b | 429 | } |
bd61b366 | 430 | return NULL; |
378cc40b | 431 | } |
8d063cd8 | 432 | |
a687059c LW |
433 | /* same as instr but allow embedded nulls */ |
434 | ||
435 | char * | |
04c9e624 | 436 | Perl_ninstr(const char *big, const char *bigend, const char *little, const char *lend) |
8d063cd8 | 437 | { |
7918f24d | 438 | PERL_ARGS_ASSERT_NINSTR; |
4c8626be GA |
439 | if (little >= lend) |
440 | return (char*)big; | |
441 | { | |
8ba22ff4 | 442 | const char first = *little; |
4c8626be | 443 | const char *s, *x; |
8ba22ff4 | 444 | bigend -= lend - little++; |
4c8626be GA |
445 | OUTER: |
446 | while (big <= bigend) { | |
b0ca24ee JH |
447 | if (*big++ == first) { |
448 | for (x=big,s=little; s < lend; x++,s++) { | |
449 | if (*s != *x) | |
450 | goto OUTER; | |
451 | } | |
452 | return (char*)(big-1); | |
4c8626be | 453 | } |
4c8626be | 454 | } |
378cc40b | 455 | } |
bd61b366 | 456 | return NULL; |
a687059c LW |
457 | } |
458 | ||
459 | /* reverse of the above--find last substring */ | |
460 | ||
461 | char * | |
04c9e624 | 462 | Perl_rninstr(register const char *big, const char *bigend, const char *little, const char *lend) |
a687059c | 463 | { |
08105a92 | 464 | register const char *bigbeg; |
e1ec3a88 | 465 | register const I32 first = *little; |
7452cf6a | 466 | register const char * const littleend = lend; |
a687059c | 467 | |
7918f24d NC |
468 | PERL_ARGS_ASSERT_RNINSTR; |
469 | ||
260d78c9 | 470 | if (little >= littleend) |
08105a92 | 471 | return (char*)bigend; |
a687059c LW |
472 | bigbeg = big; |
473 | big = bigend - (littleend - little++); | |
474 | while (big >= bigbeg) { | |
66a1b24b | 475 | register const char *s, *x; |
a687059c LW |
476 | if (*big-- != first) |
477 | continue; | |
478 | for (x=big+2,s=little; s < littleend; /**/ ) { | |
4fc877ac | 479 | if (*s != *x) |
a687059c | 480 | break; |
4fc877ac AL |
481 | else { |
482 | x++; | |
483 | s++; | |
a687059c LW |
484 | } |
485 | } | |
486 | if (s >= littleend) | |
08105a92 | 487 | return (char*)(big+1); |
378cc40b | 488 | } |
bd61b366 | 489 | return NULL; |
378cc40b | 490 | } |
a687059c | 491 | |
cf93c79d IZ |
492 | /* As a space optimization, we do not compile tables for strings of length |
493 | 0 and 1, and for strings of length 2 unless FBMcf_TAIL. These are | |
494 | special-cased in fbm_instr(). | |
495 | ||
496 | If FBMcf_TAIL, the table is created as if the string has a trailing \n. */ | |
497 | ||
954c1994 | 498 | /* |
ccfc67b7 JH |
499 | =head1 Miscellaneous Functions |
500 | ||
954c1994 GS |
501 | =for apidoc fbm_compile |
502 | ||
503 | Analyses the string in order to make fast searches on it using fbm_instr() | |
504 | -- the Boyer-Moore algorithm. | |
505 | ||
506 | =cut | |
507 | */ | |
508 | ||
378cc40b | 509 | void |
7506f9c3 | 510 | Perl_fbm_compile(pTHX_ SV *sv, U32 flags) |
378cc40b | 511 | { |
97aff369 | 512 | dVAR; |
0d46e09a | 513 | register const U8 *s; |
79072805 | 514 | register U32 i; |
0b71040e | 515 | STRLEN len; |
cb742848 | 516 | U32 rarest = 0; |
79072805 LW |
517 | U32 frequency = 256; |
518 | ||
7918f24d NC |
519 | PERL_ARGS_ASSERT_FBM_COMPILE; |
520 | ||
c517dc2b | 521 | if (flags & FBMcf_TAIL) { |
890ce7af | 522 | MAGIC * const mg = SvUTF8(sv) && SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL; |
396482e1 | 523 | sv_catpvs(sv, "\n"); /* Taken into account in fbm_instr() */ |
c517dc2b JH |
524 | if (mg && mg->mg_len >= 0) |
525 | mg->mg_len++; | |
526 | } | |
9cbe880b | 527 | s = (U8*)SvPV_force_mutable(sv, len); |
d1be9408 | 528 | if (len == 0) /* TAIL might be on a zero-length string. */ |
cf93c79d | 529 | return; |
cecf5685 | 530 | SvUPGRADE(sv, SVt_PVGV); |
78d0cf80 | 531 | SvIOK_off(sv); |
8eeaf79a NC |
532 | SvNOK_off(sv); |
533 | SvVALID_on(sv); | |
02128f11 | 534 | if (len > 2) { |
9cbe880b | 535 | const unsigned char *sb; |
66a1b24b | 536 | const U8 mlen = (len>255) ? 255 : (U8)len; |
890ce7af | 537 | register U8 *table; |
cf93c79d | 538 | |
d8419e03 NC |
539 | Sv_Grow(sv, len + 256 + PERL_FBM_TABLE_OFFSET); |
540 | table | |
541 | = (unsigned char*)(SvPVX_mutable(sv) + len + PERL_FBM_TABLE_OFFSET); | |
542 | s = table - 1 - PERL_FBM_TABLE_OFFSET; /* last char */ | |
7506f9c3 | 543 | memset((void*)table, mlen, 256); |
02128f11 | 544 | i = 0; |
7506f9c3 | 545 | sb = s - mlen + 1; /* first char (maybe) */ |
cf93c79d IZ |
546 | while (s >= sb) { |
547 | if (table[*s] == mlen) | |
7506f9c3 | 548 | table[*s] = (U8)i; |
cf93c79d IZ |
549 | s--, i++; |
550 | } | |
d0688fc4 NC |
551 | } else { |
552 | Sv_Grow(sv, len + PERL_FBM_TABLE_OFFSET); | |
378cc40b | 553 | } |
a0714e2c | 554 | sv_magic(sv, NULL, PERL_MAGIC_bm, NULL, 0); /* deep magic */ |
378cc40b | 555 | |
9cbe880b | 556 | s = (const unsigned char*)(SvPVX_const(sv)); /* deeper magic */ |
bbce6d69 | 557 | for (i = 0; i < len; i++) { |
22c35a8c | 558 | if (PL_freq[s[i]] < frequency) { |
bbce6d69 | 559 | rarest = i; |
22c35a8c | 560 | frequency = PL_freq[s[i]]; |
378cc40b LW |
561 | } |
562 | } | |
610460f9 | 563 | BmFLAGS(sv) = (U8)flags; |
79072805 | 564 | BmRARE(sv) = s[rarest]; |
44a10c71 | 565 | BmPREVIOUS(sv) = rarest; |
cf93c79d IZ |
566 | BmUSEFUL(sv) = 100; /* Initial value */ |
567 | if (flags & FBMcf_TAIL) | |
568 | SvTAIL_on(sv); | |
8eeaf79a NC |
569 | DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %lu\n", |
570 | BmRARE(sv),(unsigned long)BmPREVIOUS(sv))); | |
378cc40b LW |
571 | } |
572 | ||
cf93c79d IZ |
573 | /* If SvTAIL(littlestr), it has a fake '\n' at end. */ |
574 | /* If SvTAIL is actually due to \Z or \z, this gives false positives | |
575 | if multiline */ | |
576 | ||
954c1994 GS |
577 | /* |
578 | =for apidoc fbm_instr | |
579 | ||
580 | Returns the location of the SV in the string delimited by C<str> and | |
bd61b366 | 581 | C<strend>. It returns C<NULL> if the string can't be found. The C<sv> |
954c1994 GS |
582 | does not have to be fbm_compiled, but the search will not be as fast |
583 | then. | |
584 | ||
585 | =cut | |
586 | */ | |
587 | ||
378cc40b | 588 | char * |
864dbfa3 | 589 | Perl_fbm_instr(pTHX_ unsigned char *big, register unsigned char *bigend, SV *littlestr, U32 flags) |
378cc40b | 590 | { |
a687059c | 591 | register unsigned char *s; |
cf93c79d | 592 | STRLEN l; |
9cbe880b NC |
593 | register const unsigned char *little |
594 | = (const unsigned char *)SvPV_const(littlestr,l); | |
cf93c79d | 595 | register STRLEN littlelen = l; |
e1ec3a88 | 596 | register const I32 multiline = flags & FBMrf_MULTILINE; |
cf93c79d | 597 | |
7918f24d NC |
598 | PERL_ARGS_ASSERT_FBM_INSTR; |
599 | ||
eb160463 | 600 | if ((STRLEN)(bigend - big) < littlelen) { |
a1d180c4 | 601 | if ( SvTAIL(littlestr) |
eb160463 | 602 | && ((STRLEN)(bigend - big) == littlelen - 1) |
a1d180c4 | 603 | && (littlelen == 1 |
12ae5dfc | 604 | || (*big == *little && |
27da23d5 | 605 | memEQ((char *)big, (char *)little, littlelen - 1)))) |
cf93c79d | 606 | return (char*)big; |
bd61b366 | 607 | return NULL; |
cf93c79d | 608 | } |
378cc40b | 609 | |
cf93c79d | 610 | if (littlelen <= 2) { /* Special-cased */ |
cf93c79d IZ |
611 | |
612 | if (littlelen == 1) { | |
613 | if (SvTAIL(littlestr) && !multiline) { /* Anchor only! */ | |
614 | /* Know that bigend != big. */ | |
615 | if (bigend[-1] == '\n') | |
616 | return (char *)(bigend - 1); | |
617 | return (char *) bigend; | |
618 | } | |
619 | s = big; | |
620 | while (s < bigend) { | |
621 | if (*s == *little) | |
622 | return (char *)s; | |
623 | s++; | |
624 | } | |
625 | if (SvTAIL(littlestr)) | |
626 | return (char *) bigend; | |
bd61b366 | 627 | return NULL; |
cf93c79d IZ |
628 | } |
629 | if (!littlelen) | |
630 | return (char*)big; /* Cannot be SvTAIL! */ | |
631 | ||
632 | /* littlelen is 2 */ | |
633 | if (SvTAIL(littlestr) && !multiline) { | |
634 | if (bigend[-1] == '\n' && bigend[-2] == *little) | |
635 | return (char*)bigend - 2; | |
636 | if (bigend[-1] == *little) | |
637 | return (char*)bigend - 1; | |
bd61b366 | 638 | return NULL; |
cf93c79d IZ |
639 | } |
640 | { | |
641 | /* This should be better than FBM if c1 == c2, and almost | |
642 | as good otherwise: maybe better since we do less indirection. | |
643 | And we save a lot of memory by caching no table. */ | |
66a1b24b AL |
644 | const unsigned char c1 = little[0]; |
645 | const unsigned char c2 = little[1]; | |
cf93c79d IZ |
646 | |
647 | s = big + 1; | |
648 | bigend--; | |
649 | if (c1 != c2) { | |
650 | while (s <= bigend) { | |
651 | if (s[0] == c2) { | |
652 | if (s[-1] == c1) | |
653 | return (char*)s - 1; | |
654 | s += 2; | |
655 | continue; | |
3fe6f2dc | 656 | } |
cf93c79d IZ |
657 | next_chars: |
658 | if (s[0] == c1) { | |
659 | if (s == bigend) | |
660 | goto check_1char_anchor; | |
661 | if (s[1] == c2) | |
662 | return (char*)s; | |
663 | else { | |
664 | s++; | |
665 | goto next_chars; | |
666 | } | |
667 | } | |
668 | else | |
669 | s += 2; | |
670 | } | |
671 | goto check_1char_anchor; | |
672 | } | |
673 | /* Now c1 == c2 */ | |
674 | while (s <= bigend) { | |
675 | if (s[0] == c1) { | |
676 | if (s[-1] == c1) | |
677 | return (char*)s - 1; | |
678 | if (s == bigend) | |
679 | goto check_1char_anchor; | |
680 | if (s[1] == c1) | |
681 | return (char*)s; | |
682 | s += 3; | |
02128f11 | 683 | } |
c277df42 | 684 | else |
cf93c79d | 685 | s += 2; |
c277df42 | 686 | } |
c277df42 | 687 | } |
cf93c79d IZ |
688 | check_1char_anchor: /* One char and anchor! */ |
689 | if (SvTAIL(littlestr) && (*bigend == *little)) | |
690 | return (char *)bigend; /* bigend is already decremented. */ | |
bd61b366 | 691 | return NULL; |
d48672a2 | 692 | } |
cf93c79d | 693 | if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */ |
bbce6d69 | 694 | s = bigend - littlelen; |
a1d180c4 | 695 | if (s >= big && bigend[-1] == '\n' && *s == *little |
cf93c79d IZ |
696 | /* Automatically of length > 2 */ |
697 | && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2)) | |
7506f9c3 | 698 | { |
bbce6d69 | 699 | return (char*)s; /* how sweet it is */ |
7506f9c3 GS |
700 | } |
701 | if (s[1] == *little | |
702 | && memEQ((char*)s + 2, (char*)little + 1, littlelen - 2)) | |
703 | { | |
cf93c79d | 704 | return (char*)s + 1; /* how sweet it is */ |
7506f9c3 | 705 | } |
bd61b366 | 706 | return NULL; |
02128f11 | 707 | } |
cecf5685 | 708 | if (!SvVALID(littlestr)) { |
c4420975 | 709 | char * const b = ninstr((char*)big,(char*)bigend, |
cf93c79d IZ |
710 | (char*)little, (char*)little + littlelen); |
711 | ||
712 | if (!b && SvTAIL(littlestr)) { /* Automatically multiline! */ | |
713 | /* Chop \n from littlestr: */ | |
714 | s = bigend - littlelen + 1; | |
7506f9c3 GS |
715 | if (*s == *little |
716 | && memEQ((char*)s + 1, (char*)little + 1, littlelen - 2)) | |
717 | { | |
3fe6f2dc | 718 | return (char*)s; |
7506f9c3 | 719 | } |
bd61b366 | 720 | return NULL; |
a687059c | 721 | } |
cf93c79d | 722 | return b; |
a687059c | 723 | } |
a1d180c4 | 724 | |
3566a07d NC |
725 | /* Do actual FBM. */ |
726 | if (littlelen > (STRLEN)(bigend - big)) | |
727 | return NULL; | |
728 | ||
729 | { | |
d8419e03 NC |
730 | register const unsigned char * const table |
731 | = little + littlelen + PERL_FBM_TABLE_OFFSET; | |
0d46e09a | 732 | register const unsigned char *oldlittle; |
cf93c79d | 733 | |
cf93c79d IZ |
734 | --littlelen; /* Last char found by table lookup */ |
735 | ||
736 | s = big + littlelen; | |
737 | little += littlelen; /* last char */ | |
738 | oldlittle = little; | |
739 | if (s < bigend) { | |
740 | register I32 tmp; | |
741 | ||
742 | top2: | |
7506f9c3 | 743 | if ((tmp = table[*s])) { |
cf93c79d | 744 | if ((s += tmp) < bigend) |
62b28dd9 | 745 | goto top2; |
cf93c79d IZ |
746 | goto check_end; |
747 | } | |
748 | else { /* less expensive than calling strncmp() */ | |
66a1b24b | 749 | register unsigned char * const olds = s; |
cf93c79d IZ |
750 | |
751 | tmp = littlelen; | |
752 | ||
753 | while (tmp--) { | |
754 | if (*--s == *--little) | |
755 | continue; | |
cf93c79d IZ |
756 | s = olds + 1; /* here we pay the price for failure */ |
757 | little = oldlittle; | |
758 | if (s < bigend) /* fake up continue to outer loop */ | |
759 | goto top2; | |
760 | goto check_end; | |
761 | } | |
762 | return (char *)s; | |
a687059c | 763 | } |
378cc40b | 764 | } |
cf93c79d | 765 | check_end: |
c8029a41 | 766 | if ( s == bigend |
8eeaf79a | 767 | && (BmFLAGS(littlestr) & FBMcf_TAIL) |
12ae5dfc JH |
768 | && memEQ((char *)(bigend - littlelen), |
769 | (char *)(oldlittle - littlelen), littlelen) ) | |
cf93c79d | 770 | return (char*)bigend - littlelen; |
bd61b366 | 771 | return NULL; |
378cc40b | 772 | } |
378cc40b LW |
773 | } |
774 | ||
c277df42 IZ |
775 | /* start_shift, end_shift are positive quantities which give offsets |
776 | of ends of some substring of bigstr. | |
a0288114 | 777 | If "last" we want the last occurrence. |
c277df42 | 778 | old_posp is the way of communication between consequent calls if |
a1d180c4 | 779 | the next call needs to find the . |
c277df42 | 780 | The initial *old_posp should be -1. |
cf93c79d IZ |
781 | |
782 | Note that we take into account SvTAIL, so one can get extra | |
783 | optimizations if _ALL flag is set. | |
c277df42 IZ |
784 | */ |
785 | ||
cf93c79d | 786 | /* If SvTAIL is actually due to \Z or \z, this gives false positives |
26fa51c3 | 787 | if PL_multiline. In fact if !PL_multiline the authoritative answer |
cf93c79d IZ |
788 | is not supported yet. */ |
789 | ||
378cc40b | 790 | char * |
864dbfa3 | 791 | Perl_screaminstr(pTHX_ SV *bigstr, SV *littlestr, I32 start_shift, I32 end_shift, I32 *old_posp, I32 last) |
378cc40b | 792 | { |
97aff369 | 793 | dVAR; |
0d46e09a | 794 | register const unsigned char *big; |
79072805 LW |
795 | register I32 pos; |
796 | register I32 previous; | |
797 | register I32 first; | |
0d46e09a | 798 | register const unsigned char *little; |
c277df42 | 799 | register I32 stop_pos; |
0d46e09a | 800 | register const unsigned char *littleend; |
c277df42 | 801 | I32 found = 0; |
378cc40b | 802 | |
7918f24d NC |
803 | PERL_ARGS_ASSERT_SCREAMINSTR; |
804 | ||
cecf5685 NC |
805 | assert(SvTYPE(littlestr) == SVt_PVGV); |
806 | assert(SvVALID(littlestr)); | |
d372c834 | 807 | |
c277df42 | 808 | if (*old_posp == -1 |
3280af22 | 809 | ? (pos = PL_screamfirst[BmRARE(littlestr)]) < 0 |
cf93c79d IZ |
810 | : (((pos = *old_posp), pos += PL_screamnext[pos]) == 0)) { |
811 | cant_find: | |
a1d180c4 | 812 | if ( BmRARE(littlestr) == '\n' |
85c508c3 | 813 | && BmPREVIOUS(littlestr) == SvCUR(littlestr) - 1) { |
cfd0369c | 814 | little = (const unsigned char *)(SvPVX_const(littlestr)); |
cf93c79d IZ |
815 | littleend = little + SvCUR(littlestr); |
816 | first = *little++; | |
817 | goto check_tail; | |
818 | } | |
bd61b366 | 819 | return NULL; |
cf93c79d IZ |
820 | } |
821 | ||
cfd0369c | 822 | little = (const unsigned char *)(SvPVX_const(littlestr)); |
79072805 | 823 | littleend = little + SvCUR(littlestr); |
378cc40b | 824 | first = *little++; |
c277df42 | 825 | /* The value of pos we can start at: */ |
79072805 | 826 | previous = BmPREVIOUS(littlestr); |
cfd0369c | 827 | big = (const unsigned char *)(SvPVX_const(bigstr)); |
c277df42 IZ |
828 | /* The value of pos we can stop at: */ |
829 | stop_pos = SvCUR(bigstr) - end_shift - (SvCUR(littlestr) - 1 - previous); | |
cf93c79d | 830 | if (previous + start_shift > stop_pos) { |
0fe87f7c HS |
831 | /* |
832 | stop_pos does not include SvTAIL in the count, so this check is incorrect | |
833 | (I think) - see [ID 20010618.006] and t/op/study.t. HVDS 2001/06/19 | |
834 | */ | |
835 | #if 0 | |
cf93c79d IZ |
836 | if (previous + start_shift == stop_pos + 1) /* A fake '\n'? */ |
837 | goto check_tail; | |
0fe87f7c | 838 | #endif |
bd61b366 | 839 | return NULL; |
cf93c79d | 840 | } |
c277df42 | 841 | while (pos < previous + start_shift) { |
3280af22 | 842 | if (!(pos += PL_screamnext[pos])) |
cf93c79d | 843 | goto cant_find; |
378cc40b | 844 | } |
de3bb511 | 845 | big -= previous; |
bbce6d69 | 846 | do { |
0d46e09a | 847 | register const unsigned char *s, *x; |
ef64f398 | 848 | if (pos >= stop_pos) break; |
bbce6d69 | 849 | if (big[pos] != first) |
850 | continue; | |
851 | for (x=big+pos+1,s=little; s < littleend; /**/ ) { | |
bbce6d69 | 852 | if (*s++ != *x++) { |
853 | s--; | |
854 | break; | |
378cc40b | 855 | } |
bbce6d69 | 856 | } |
c277df42 IZ |
857 | if (s == littleend) { |
858 | *old_posp = pos; | |
859 | if (!last) return (char *)(big+pos); | |
860 | found = 1; | |
861 | } | |
3280af22 | 862 | } while ( pos += PL_screamnext[pos] ); |
a1d180c4 | 863 | if (last && found) |
cf93c79d | 864 | return (char *)(big+(*old_posp)); |
cf93c79d IZ |
865 | check_tail: |
866 | if (!SvTAIL(littlestr) || (end_shift > 0)) | |
bd61b366 | 867 | return NULL; |
cf93c79d | 868 | /* Ignore the trailing "\n". This code is not microoptimized */ |
cfd0369c | 869 | big = (const unsigned char *)(SvPVX_const(bigstr) + SvCUR(bigstr)); |
cf93c79d IZ |
870 | stop_pos = littleend - little; /* Actual littlestr len */ |
871 | if (stop_pos == 0) | |
872 | return (char*)big; | |
873 | big -= stop_pos; | |
874 | if (*big == first | |
12ae5dfc JH |
875 | && ((stop_pos == 1) || |
876 | memEQ((char *)(big + 1), (char *)little, stop_pos - 1))) | |
cf93c79d | 877 | return (char*)big; |
bd61b366 | 878 | return NULL; |
8d063cd8 LW |
879 | } |
880 | ||
79072805 | 881 | I32 |
04c9e624 | 882 | Perl_ibcmp(const char *s1, const char *s2, register I32 len) |
79072805 | 883 | { |
e1ec3a88 AL |
884 | register const U8 *a = (const U8 *)s1; |
885 | register const U8 *b = (const U8 *)s2; | |
96a5add6 | 886 | |
7918f24d NC |
887 | PERL_ARGS_ASSERT_IBCMP; |
888 | ||
79072805 | 889 | while (len--) { |
22c35a8c | 890 | if (*a != *b && *a != PL_fold[*b]) |
bbce6d69 | 891 | return 1; |
892 | a++,b++; | |
893 | } | |
894 | return 0; | |
895 | } | |
896 | ||
897 | I32 | |
04c9e624 | 898 | Perl_ibcmp_locale(const char *s1, const char *s2, register I32 len) |
bbce6d69 | 899 | { |
27da23d5 | 900 | dVAR; |
e1ec3a88 AL |
901 | register const U8 *a = (const U8 *)s1; |
902 | register const U8 *b = (const U8 *)s2; | |
96a5add6 | 903 | |
7918f24d NC |
904 | PERL_ARGS_ASSERT_IBCMP_LOCALE; |
905 | ||
bbce6d69 | 906 | while (len--) { |
22c35a8c | 907 | if (*a != *b && *a != PL_fold_locale[*b]) |
bbce6d69 | 908 | return 1; |
909 | a++,b++; | |
79072805 LW |
910 | } |
911 | return 0; | |
912 | } | |
913 | ||
8d063cd8 LW |
914 | /* copy a string to a safe spot */ |
915 | ||
954c1994 | 916 | /* |
ccfc67b7 JH |
917 | =head1 Memory Management |
918 | ||
954c1994 GS |
919 | =for apidoc savepv |
920 | ||
61a925ed AMS |
921 | Perl's version of C<strdup()>. Returns a pointer to a newly allocated |
922 | string which is a duplicate of C<pv>. The size of the string is | |
923 | determined by C<strlen()>. The memory allocated for the new string can | |
924 | be freed with the C<Safefree()> function. | |
954c1994 GS |
925 | |
926 | =cut | |
927 | */ | |
928 | ||
8d063cd8 | 929 | char * |
efdfce31 | 930 | Perl_savepv(pTHX_ const char *pv) |
8d063cd8 | 931 | { |
96a5add6 | 932 | PERL_UNUSED_CONTEXT; |
e90e2364 | 933 | if (!pv) |
bd61b366 | 934 | return NULL; |
66a1b24b AL |
935 | else { |
936 | char *newaddr; | |
937 | const STRLEN pvlen = strlen(pv)+1; | |
10edeb5d JH |
938 | Newx(newaddr, pvlen, char); |
939 | return (char*)memcpy(newaddr, pv, pvlen); | |
66a1b24b | 940 | } |
8d063cd8 LW |
941 | } |
942 | ||
a687059c LW |
943 | /* same thing but with a known length */ |
944 | ||
954c1994 GS |
945 | /* |
946 | =for apidoc savepvn | |
947 | ||
61a925ed AMS |
948 | Perl's version of what C<strndup()> would be if it existed. Returns a |
949 | pointer to a newly allocated string which is a duplicate of the first | |
cbf82dd0 NC |
950 | C<len> bytes from C<pv>, plus a trailing NUL byte. The memory allocated for |
951 | the new string can be freed with the C<Safefree()> function. | |
954c1994 GS |
952 | |
953 | =cut | |
954 | */ | |
955 | ||
a687059c | 956 | char * |
efdfce31 | 957 | Perl_savepvn(pTHX_ const char *pv, register I32 len) |
a687059c LW |
958 | { |
959 | register char *newaddr; | |
96a5add6 | 960 | PERL_UNUSED_CONTEXT; |
a687059c | 961 | |
a02a5408 | 962 | Newx(newaddr,len+1,char); |
92110913 | 963 | /* Give a meaning to NULL pointer mainly for the use in sv_magic() */ |
efdfce31 | 964 | if (pv) { |
e90e2364 NC |
965 | /* might not be null terminated */ |
966 | newaddr[len] = '\0'; | |
07409e01 | 967 | return (char *) CopyD(pv,newaddr,len,char); |
92110913 NIS |
968 | } |
969 | else { | |
07409e01 | 970 | return (char *) ZeroD(newaddr,len+1,char); |
92110913 | 971 | } |
a687059c LW |
972 | } |
973 | ||
05ec9bb3 NIS |
974 | /* |
975 | =for apidoc savesharedpv | |
976 | ||
61a925ed AMS |
977 | A version of C<savepv()> which allocates the duplicate string in memory |
978 | which is shared between threads. | |
05ec9bb3 NIS |
979 | |
980 | =cut | |
981 | */ | |
982 | char * | |
efdfce31 | 983 | Perl_savesharedpv(pTHX_ const char *pv) |
05ec9bb3 | 984 | { |
e90e2364 | 985 | register char *newaddr; |
490a0e98 | 986 | STRLEN pvlen; |
e90e2364 | 987 | if (!pv) |
bd61b366 | 988 | return NULL; |
e90e2364 | 989 | |
490a0e98 NC |
990 | pvlen = strlen(pv)+1; |
991 | newaddr = (char*)PerlMemShared_malloc(pvlen); | |
e90e2364 | 992 | if (!newaddr) { |
0bd48802 | 993 | return write_no_mem(); |
05ec9bb3 | 994 | } |
10edeb5d | 995 | return (char*)memcpy(newaddr, pv, pvlen); |
05ec9bb3 NIS |
996 | } |
997 | ||
2e0de35c | 998 | /* |
d9095cec NC |
999 | =for apidoc savesharedpvn |
1000 | ||
1001 | A version of C<savepvn()> which allocates the duplicate string in memory | |
1002 | which is shared between threads. (With the specific difference that a NULL | |
1003 | pointer is not acceptable) | |
1004 | ||
1005 | =cut | |
1006 | */ | |
1007 | char * | |
1008 | Perl_savesharedpvn(pTHX_ const char *const pv, const STRLEN len) | |
1009 | { | |
1010 | char *const newaddr = (char*)PerlMemShared_malloc(len + 1); | |
7918f24d NC |
1011 | |
1012 | PERL_ARGS_ASSERT_SAVESHAREDPVN; | |
1013 | ||
d9095cec NC |
1014 | if (!newaddr) { |
1015 | return write_no_mem(); | |
1016 | } | |
1017 | newaddr[len] = '\0'; | |
1018 | return (char*)memcpy(newaddr, pv, len); | |
1019 | } | |
1020 | ||
1021 | /* | |
2e0de35c NC |
1022 | =for apidoc savesvpv |
1023 | ||
6832267f | 1024 | A version of C<savepv()>/C<savepvn()> which gets the string to duplicate from |
2e0de35c NC |
1025 | the passed in SV using C<SvPV()> |
1026 | ||
1027 | =cut | |
1028 | */ | |
1029 | ||
1030 | char * | |
1031 | Perl_savesvpv(pTHX_ SV *sv) | |
1032 | { | |
1033 | STRLEN len; | |
7452cf6a | 1034 | const char * const pv = SvPV_const(sv, len); |
2e0de35c NC |
1035 | register char *newaddr; |
1036 | ||
7918f24d NC |
1037 | PERL_ARGS_ASSERT_SAVESVPV; |
1038 | ||
26866f99 | 1039 | ++len; |
a02a5408 | 1040 | Newx(newaddr,len,char); |
07409e01 | 1041 | return (char *) CopyD(pv,newaddr,len,char); |
2e0de35c | 1042 | } |
05ec9bb3 NIS |
1043 | |
1044 | ||
cea2e8a9 | 1045 | /* the SV for Perl_form() and mess() is not kept in an arena */ |
fc36a67e | 1046 | |
76e3520e | 1047 | STATIC SV * |
cea2e8a9 | 1048 | S_mess_alloc(pTHX) |
fc36a67e | 1049 | { |
97aff369 | 1050 | dVAR; |
fc36a67e | 1051 | SV *sv; |
1052 | XPVMG *any; | |
1053 | ||
e72dc28c | 1054 | if (!PL_dirty) |
84bafc02 | 1055 | return newSVpvs_flags("", SVs_TEMP); |
e72dc28c | 1056 | |
0372dbb6 GS |
1057 | if (PL_mess_sv) |
1058 | return PL_mess_sv; | |
1059 | ||
fc36a67e | 1060 | /* Create as PVMG now, to avoid any upgrading later */ |
a02a5408 JC |
1061 | Newx(sv, 1, SV); |
1062 | Newxz(any, 1, XPVMG); | |
fc36a67e | 1063 | SvFLAGS(sv) = SVt_PVMG; |
1064 | SvANY(sv) = (void*)any; | |
6136c704 | 1065 | SvPV_set(sv, NULL); |
fc36a67e | 1066 | SvREFCNT(sv) = 1 << 30; /* practically infinite */ |
e72dc28c | 1067 | PL_mess_sv = sv; |
fc36a67e | 1068 | return sv; |
1069 | } | |
1070 | ||
c5be433b | 1071 | #if defined(PERL_IMPLICIT_CONTEXT) |
cea2e8a9 GS |
1072 | char * |
1073 | Perl_form_nocontext(const char* pat, ...) | |
1074 | { | |
1075 | dTHX; | |
c5be433b | 1076 | char *retval; |
cea2e8a9 | 1077 | va_list args; |
7918f24d | 1078 | PERL_ARGS_ASSERT_FORM_NOCONTEXT; |
cea2e8a9 | 1079 | va_start(args, pat); |
c5be433b | 1080 | retval = vform(pat, &args); |
cea2e8a9 | 1081 | va_end(args); |
c5be433b | 1082 | return retval; |
cea2e8a9 | 1083 | } |
c5be433b | 1084 | #endif /* PERL_IMPLICIT_CONTEXT */ |
cea2e8a9 | 1085 | |
7c9e965c | 1086 | /* |
ccfc67b7 | 1087 | =head1 Miscellaneous Functions |
7c9e965c JP |
1088 | =for apidoc form |
1089 | ||
1090 | Takes a sprintf-style format pattern and conventional | |
1091 | (non-SV) arguments and returns the formatted string. | |
1092 | ||
1093 | (char *) Perl_form(pTHX_ const char* pat, ...) | |
1094 | ||
1095 | can be used any place a string (char *) is required: | |
1096 | ||
1097 | char * s = Perl_form("%d.%d",major,minor); | |
1098 | ||
1099 | Uses a single private buffer so if you want to format several strings you | |
1100 | must explicitly copy the earlier strings away (and free the copies when you | |
1101 | are done). | |
1102 | ||
1103 | =cut | |
1104 | */ | |
1105 | ||
8990e307 | 1106 | char * |
864dbfa3 | 1107 | Perl_form(pTHX_ const char* pat, ...) |
8990e307 | 1108 | { |
c5be433b | 1109 | char *retval; |
46fc3d4c | 1110 | va_list args; |
7918f24d | 1111 | PERL_ARGS_ASSERT_FORM; |
46fc3d4c | 1112 | va_start(args, pat); |
c5be433b | 1113 | retval = vform(pat, &args); |
46fc3d4c | 1114 | va_end(args); |
c5be433b GS |
1115 | return retval; |
1116 | } | |
1117 | ||
1118 | char * | |
1119 | Perl_vform(pTHX_ const char *pat, va_list *args) | |
1120 | { | |
2d03de9c | 1121 | SV * const sv = mess_alloc(); |
7918f24d | 1122 | PERL_ARGS_ASSERT_VFORM; |
4608196e | 1123 | sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL); |
e72dc28c | 1124 | return SvPVX(sv); |
46fc3d4c | 1125 | } |
a687059c | 1126 | |
c5df3096 Z |
1127 | /* |
1128 | =for apidoc Am|SV *|mess|const char *pat|... | |
1129 | ||
1130 | Take a sprintf-style format pattern and argument list. These are used to | |
1131 | generate a string message. If the message does not end with a newline, | |
1132 | then it will be extended with some indication of the current location | |
1133 | in the code, as described for L</mess_sv>. | |
1134 | ||
1135 | Normally, the resulting message is returned in a new mortal SV. | |
1136 | During global destruction a single SV may be shared between uses of | |
1137 | this function. | |
1138 | ||
1139 | =cut | |
1140 | */ | |
1141 | ||
5a844595 GS |
1142 | #if defined(PERL_IMPLICIT_CONTEXT) |
1143 | SV * | |
1144 | Perl_mess_nocontext(const char *pat, ...) | |
1145 | { | |
1146 | dTHX; | |
1147 | SV *retval; | |
1148 | va_list args; | |
7918f24d | 1149 | PERL_ARGS_ASSERT_MESS_NOCONTEXT; |
5a844595 GS |
1150 | va_start(args, pat); |
1151 | retval = vmess(pat, &args); | |
1152 | va_end(args); | |
1153 | return retval; | |
1154 | } | |
1155 | #endif /* PERL_IMPLICIT_CONTEXT */ | |
1156 | ||
06bf62c7 | 1157 | SV * |
5a844595 GS |
1158 | Perl_mess(pTHX_ const char *pat, ...) |
1159 | { | |
1160 | SV *retval; | |
1161 | va_list args; | |
7918f24d | 1162 | PERL_ARGS_ASSERT_MESS; |
5a844595 GS |
1163 | va_start(args, pat); |
1164 | retval = vmess(pat, &args); | |
1165 | va_end(args); | |
1166 | return retval; | |
1167 | } | |
1168 | ||
5f66b61c AL |
1169 | STATIC const COP* |
1170 | S_closest_cop(pTHX_ const COP *cop, const OP *o) | |
ae7d165c | 1171 | { |
97aff369 | 1172 | dVAR; |
ae7d165c PJ |
1173 | /* Look for PL_op starting from o. cop is the last COP we've seen. */ |
1174 | ||
7918f24d NC |
1175 | PERL_ARGS_ASSERT_CLOSEST_COP; |
1176 | ||
fabdb6c0 AL |
1177 | if (!o || o == PL_op) |
1178 | return cop; | |
ae7d165c PJ |
1179 | |
1180 | if (o->op_flags & OPf_KIDS) { | |
5f66b61c | 1181 | const OP *kid; |
fabdb6c0 | 1182 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) { |
5f66b61c | 1183 | const COP *new_cop; |
ae7d165c PJ |
1184 | |
1185 | /* If the OP_NEXTSTATE has been optimised away we can still use it | |
1186 | * the get the file and line number. */ | |
1187 | ||
1188 | if (kid->op_type == OP_NULL && kid->op_targ == OP_NEXTSTATE) | |
5f66b61c | 1189 | cop = (const COP *)kid; |
ae7d165c PJ |
1190 | |
1191 | /* Keep searching, and return when we've found something. */ | |
1192 | ||
1193 | new_cop = closest_cop(cop, kid); | |
fabdb6c0 AL |
1194 | if (new_cop) |
1195 | return new_cop; | |
ae7d165c PJ |
1196 | } |
1197 | } | |
1198 | ||
1199 | /* Nothing found. */ | |
1200 | ||
5f66b61c | 1201 | return NULL; |
ae7d165c PJ |
1202 | } |
1203 | ||
c5df3096 Z |
1204 | /* |
1205 | =for apidoc Am|SV *|mess_sv|SV *basemsg|bool consume | |
1206 | ||
1207 | Expands a message, intended for the user, to include an indication of | |
1208 | the current location in the code, if the message does not already appear | |
1209 | to be complete. | |
1210 | ||
1211 | C<basemsg> is the initial message or object. If it is a reference, it | |
1212 | will be used as-is and will be the result of this function. Otherwise it | |
1213 | is used as a string, and if it already ends with a newline, it is taken | |
1214 | to be complete, and the result of this function will be the same string. | |
1215 | If the message does not end with a newline, then a segment such as C<at | |
1216 | foo.pl line 37> will be appended, and possibly other clauses indicating | |
1217 | the current state of execution. The resulting message will end with a | |
1218 | dot and a newline. | |
1219 | ||
1220 | Normally, the resulting message is returned in a new mortal SV. | |
1221 | During global destruction a single SV may be shared between uses of this | |
1222 | function. If C<consume> is true, then the function is permitted (but not | |
1223 | required) to modify and return C<basemsg> instead of allocating a new SV. | |
1224 | ||
1225 | =cut | |
1226 | */ | |
1227 | ||
5a844595 | 1228 | SV * |
c5df3096 | 1229 | Perl_mess_sv(pTHX_ SV *basemsg, bool consume) |
46fc3d4c | 1230 | { |
97aff369 | 1231 | dVAR; |
c5df3096 | 1232 | SV *sv; |
46fc3d4c | 1233 | |
c5df3096 Z |
1234 | PERL_ARGS_ASSERT_MESS_SV; |
1235 | ||
1236 | if (SvROK(basemsg)) { | |
1237 | if (consume) { | |
1238 | sv = basemsg; | |
1239 | } | |
1240 | else { | |
1241 | sv = mess_alloc(); | |
1242 | sv_setsv(sv, basemsg); | |
1243 | } | |
1244 | return sv; | |
1245 | } | |
1246 | ||
1247 | if (SvPOK(basemsg) && consume) { | |
1248 | sv = basemsg; | |
1249 | } | |
1250 | else { | |
1251 | sv = mess_alloc(); | |
1252 | sv_copypv(sv, basemsg); | |
1253 | } | |
7918f24d | 1254 | |
46fc3d4c | 1255 | if (!SvCUR(sv) || *(SvEND(sv) - 1) != '\n') { |
ae7d165c PJ |
1256 | /* |
1257 | * Try and find the file and line for PL_op. This will usually be | |
1258 | * PL_curcop, but it might be a cop that has been optimised away. We | |
1259 | * can try to find such a cop by searching through the optree starting | |
1260 | * from the sibling of PL_curcop. | |
1261 | */ | |
1262 | ||
e1ec3a88 | 1263 | const COP *cop = closest_cop(PL_curcop, PL_curcop->op_sibling); |
5f66b61c AL |
1264 | if (!cop) |
1265 | cop = PL_curcop; | |
ae7d165c PJ |
1266 | |
1267 | if (CopLINE(cop)) | |
ed094faf | 1268 | Perl_sv_catpvf(aTHX_ sv, " at %s line %"IVdf, |
3aed30dc | 1269 | OutCopFILE(cop), (IV)CopLINE(cop)); |
191f87d5 DH |
1270 | /* Seems that GvIO() can be untrustworthy during global destruction. */ |
1271 | if (GvIO(PL_last_in_gv) && (SvTYPE(GvIOp(PL_last_in_gv)) == SVt_PVIO) | |
1272 | && IoLINES(GvIOp(PL_last_in_gv))) | |
1273 | { | |
e1ec3a88 | 1274 | const bool line_mode = (RsSIMPLE(PL_rs) && |
95a20fc0 | 1275 | SvCUR(PL_rs) == 1 && *SvPVX_const(PL_rs) == '\n'); |
57def98f | 1276 | Perl_sv_catpvf(aTHX_ sv, ", <%s> %s %"IVdf, |
5f66b61c | 1277 | PL_last_in_gv == PL_argvgv ? "" : GvNAME(PL_last_in_gv), |
edc2eac3 JH |
1278 | line_mode ? "line" : "chunk", |
1279 | (IV)IoLINES(GvIOp(PL_last_in_gv))); | |
a687059c | 1280 | } |
5f66b61c AL |
1281 | if (PL_dirty) |
1282 | sv_catpvs(sv, " during global destruction"); | |
1283 | sv_catpvs(sv, ".\n"); | |
a687059c | 1284 | } |
06bf62c7 | 1285 | return sv; |
a687059c LW |
1286 | } |
1287 | ||
c5df3096 Z |
1288 | /* |
1289 | =for apidoc Am|SV *|vmess|const char *pat|va_list *args | |
1290 | ||
1291 | C<pat> and C<args> are a sprintf-style format pattern and encapsulated | |
1292 | argument list. These are used to generate a string message. If the | |
1293 | message does not end with a newline, then it will be extended with | |
1294 | some indication of the current location in the code, as described for | |
1295 | L</mess_sv>. | |
1296 | ||
1297 | Normally, the resulting message is returned in a new mortal SV. | |
1298 | During global destruction a single SV may be shared between uses of | |
1299 | this function. | |
1300 | ||
1301 | =cut | |
1302 | */ | |
1303 | ||
1304 | SV * | |
1305 | Perl_vmess(pTHX_ const char *pat, va_list *args) | |
1306 | { | |
1307 | dVAR; | |
1308 | SV * const sv = mess_alloc(); | |
1309 | ||
1310 | PERL_ARGS_ASSERT_VMESS; | |
1311 | ||
1312 | sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL); | |
1313 | return mess_sv(sv, 1); | |
1314 | } | |
1315 | ||
7ff03255 | 1316 | void |
7d0994e0 | 1317 | Perl_write_to_stderr(pTHX_ SV* msv) |
7ff03255 | 1318 | { |
27da23d5 | 1319 | dVAR; |
7ff03255 SG |
1320 | IO *io; |
1321 | MAGIC *mg; | |
1322 | ||
7918f24d NC |
1323 | PERL_ARGS_ASSERT_WRITE_TO_STDERR; |
1324 | ||
7ff03255 SG |
1325 | if (PL_stderrgv && SvREFCNT(PL_stderrgv) |
1326 | && (io = GvIO(PL_stderrgv)) | |
daba3364 | 1327 | && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar))) |
7ff03255 SG |
1328 | { |
1329 | dSP; | |
1330 | ENTER; | |
1331 | SAVETMPS; | |
1332 | ||
1333 | save_re_context(); | |
1334 | SAVESPTR(PL_stderrgv); | |
a0714e2c | 1335 | PL_stderrgv = NULL; |
7ff03255 SG |
1336 | |
1337 | PUSHSTACKi(PERLSI_MAGIC); | |
1338 | ||
1339 | PUSHMARK(SP); | |
1340 | EXTEND(SP,2); | |
daba3364 | 1341 | PUSHs(SvTIED_obj(MUTABLE_SV(io), mg)); |
7d0994e0 | 1342 | PUSHs(msv); |
7ff03255 SG |
1343 | PUTBACK; |
1344 | call_method("PRINT", G_SCALAR); | |
1345 | ||
1346 | POPSTACK; | |
1347 | FREETMPS; | |
1348 | LEAVE; | |
1349 | } | |
1350 | else { | |
1351 | #ifdef USE_SFIO | |
1352 | /* SFIO can really mess with your errno */ | |
4ee39169 | 1353 | dSAVED_ERRNO; |
7ff03255 | 1354 | #endif |
53c1dcc0 | 1355 | PerlIO * const serr = Perl_error_log; |
7d0994e0 GG |
1356 | STRLEN msglen; |
1357 | const char* message = SvPVx_const(msv, msglen); | |
7ff03255 SG |
1358 | |
1359 | PERL_WRITE_MSG_TO_CONSOLE(serr, message, msglen); | |
1360 | (void)PerlIO_flush(serr); | |
1361 | #ifdef USE_SFIO | |
4ee39169 | 1362 | RESTORE_ERRNO; |
7ff03255 SG |
1363 | #endif |
1364 | } | |
1365 | } | |
1366 | ||
c5df3096 Z |
1367 | /* |
1368 | =head1 Warning and Dieing | |
1369 | */ | |
1370 | ||
1371 | /* Common code used in dieing and warning */ | |
1372 | ||
1373 | STATIC SV * | |
1374 | S_with_queued_errors(pTHX_ SV *ex) | |
1375 | { | |
1376 | PERL_ARGS_ASSERT_WITH_QUEUED_ERRORS; | |
1377 | if (PL_errors && SvCUR(PL_errors) && !SvROK(ex)) { | |
1378 | sv_catsv(PL_errors, ex); | |
1379 | ex = sv_mortalcopy(PL_errors); | |
1380 | SvCUR_set(PL_errors, 0); | |
1381 | } | |
1382 | return ex; | |
1383 | } | |
3ab1ac99 | 1384 | |
46d9c920 | 1385 | STATIC bool |
c5df3096 | 1386 | S_invoke_exception_hook(pTHX_ SV *ex, bool warn) |
63315e18 | 1387 | { |
97aff369 | 1388 | dVAR; |
63315e18 NC |
1389 | HV *stash; |
1390 | GV *gv; | |
1391 | CV *cv; | |
46d9c920 NC |
1392 | SV **const hook = warn ? &PL_warnhook : &PL_diehook; |
1393 | /* sv_2cv might call Perl_croak() or Perl_warner() */ | |
1394 | SV * const oldhook = *hook; | |
1395 | ||
c5df3096 Z |
1396 | if (!oldhook) |
1397 | return FALSE; | |
63315e18 | 1398 | |
63315e18 | 1399 | ENTER; |
46d9c920 NC |
1400 | SAVESPTR(*hook); |
1401 | *hook = NULL; | |
1402 | cv = sv_2cv(oldhook, &stash, &gv, 0); | |
63315e18 NC |
1403 | LEAVE; |
1404 | if (cv && !CvDEPTH(cv) && (CvROOT(cv) || CvXSUB(cv))) { | |
1405 | dSP; | |
c5df3096 | 1406 | SV *exarg; |
63315e18 NC |
1407 | |
1408 | ENTER; | |
1409 | save_re_context(); | |
46d9c920 NC |
1410 | if (warn) { |
1411 | SAVESPTR(*hook); | |
1412 | *hook = NULL; | |
1413 | } | |
c5df3096 Z |
1414 | exarg = newSVsv(ex); |
1415 | SvREADONLY_on(exarg); | |
1416 | SAVEFREESV(exarg); | |
63315e18 | 1417 | |
46d9c920 | 1418 | PUSHSTACKi(warn ? PERLSI_WARNHOOK : PERLSI_DIEHOOK); |
63315e18 | 1419 | PUSHMARK(SP); |
c5df3096 | 1420 | XPUSHs(exarg); |
63315e18 | 1421 | PUTBACK; |
daba3364 | 1422 | call_sv(MUTABLE_SV(cv), G_DISCARD); |
63315e18 NC |
1423 | POPSTACK; |
1424 | LEAVE; | |
46d9c920 | 1425 | return TRUE; |
63315e18 | 1426 | } |
46d9c920 | 1427 | return FALSE; |
63315e18 NC |
1428 | } |
1429 | ||
c5df3096 Z |
1430 | /* |
1431 | =for apidoc Am|OP *|die_sv|SV *baseex | |
e07360fa | 1432 | |
c5df3096 Z |
1433 | Behaves the same as L</croak_sv>, except for the return type. |
1434 | It should be used only where the C<OP *> return type is required. | |
1435 | The function never actually returns. | |
e07360fa | 1436 | |
c5df3096 Z |
1437 | =cut |
1438 | */ | |
e07360fa | 1439 | |
c5df3096 Z |
1440 | OP * |
1441 | Perl_die_sv(pTHX_ SV *baseex) | |
36477c24 | 1442 | { |
c5df3096 Z |
1443 | PERL_ARGS_ASSERT_DIE_SV; |
1444 | croak_sv(baseex); | |
ad09800f GG |
1445 | /* NOTREACHED */ |
1446 | return NULL; | |
36477c24 | 1447 | } |
1448 | ||
c5df3096 Z |
1449 | /* |
1450 | =for apidoc Am|OP *|die|const char *pat|... | |
1451 | ||
1452 | Behaves the same as L</croak>, except for the return type. | |
1453 | It should be used only where the C<OP *> return type is required. | |
1454 | The function never actually returns. | |
1455 | ||
1456 | =cut | |
1457 | */ | |
1458 | ||
c5be433b | 1459 | #if defined(PERL_IMPLICIT_CONTEXT) |
cea2e8a9 GS |
1460 | OP * |
1461 | Perl_die_nocontext(const char* pat, ...) | |
a687059c | 1462 | { |
cea2e8a9 | 1463 | dTHX; |
a687059c | 1464 | va_list args; |
cea2e8a9 | 1465 | va_start(args, pat); |
c5df3096 Z |
1466 | vcroak(pat, &args); |
1467 | /* NOTREACHED */ | |
cea2e8a9 | 1468 | va_end(args); |
c5df3096 | 1469 | return NULL; |
cea2e8a9 | 1470 | } |
c5be433b | 1471 | #endif /* PERL_IMPLICIT_CONTEXT */ |
cea2e8a9 GS |
1472 | |
1473 | OP * | |
1474 | Perl_die(pTHX_ const char* pat, ...) | |
1475 | { | |
cea2e8a9 GS |
1476 | va_list args; |
1477 | va_start(args, pat); | |
c5df3096 Z |
1478 | vcroak(pat, &args); |
1479 | /* NOTREACHED */ | |
cea2e8a9 | 1480 | va_end(args); |
c5df3096 | 1481 | return NULL; |
cea2e8a9 GS |
1482 | } |
1483 | ||
c5df3096 Z |
1484 | /* |
1485 | =for apidoc Am|void|croak_sv|SV *baseex | |
1486 | ||
1487 | This is an XS interface to Perl's C<die> function. | |
1488 | ||
1489 | C<baseex> is the error message or object. If it is a reference, it | |
1490 | will be used as-is. Otherwise it is used as a string, and if it does | |
1491 | not end with a newline then it will be extended with some indication of | |
1492 | the current location in the code, as described for L</mess_sv>. | |
1493 | ||
1494 | The error message or object will be used as an exception, by default | |
1495 | returning control to the nearest enclosing C<eval>, but subject to | |
1496 | modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak_sv> | |
1497 | function never returns normally. | |
1498 | ||
1499 | To die with a simple string message, the L</croak> function may be | |
1500 | more convenient. | |
1501 | ||
1502 | =cut | |
1503 | */ | |
1504 | ||
c5be433b | 1505 | void |
c5df3096 | 1506 | Perl_croak_sv(pTHX_ SV *baseex) |
cea2e8a9 | 1507 | { |
c5df3096 Z |
1508 | SV *ex = with_queued_errors(mess_sv(baseex, 0)); |
1509 | PERL_ARGS_ASSERT_CROAK_SV; | |
1510 | invoke_exception_hook(ex, FALSE); | |
1511 | die_unwind(ex); | |
1512 | } | |
1513 | ||
1514 | /* | |
1515 | =for apidoc Am|void|vcroak|const char *pat|va_list *args | |
1516 | ||
1517 | This is an XS interface to Perl's C<die> function. | |
1518 | ||
1519 | C<pat> and C<args> are a sprintf-style format pattern and encapsulated | |
1520 | argument list. These are used to generate a string message. If the | |
1521 | message does not end with a newline, then it will be extended with | |
1522 | some indication of the current location in the code, as described for | |
1523 | L</mess_sv>. | |
1524 | ||
1525 | The error message will be used as an exception, by default | |
1526 | returning control to the nearest enclosing C<eval>, but subject to | |
1527 | modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak> | |
1528 | function never returns normally. | |
a687059c | 1529 | |
c5df3096 Z |
1530 | For historical reasons, if C<pat> is null then the contents of C<ERRSV> |
1531 | (C<$@>) will be used as an error message or object instead of building an | |
1532 | error message from arguments. If you want to throw a non-string object, | |
1533 | or build an error message in an SV yourself, it is preferable to use | |
1534 | the L</croak_sv> function, which does not involve clobbering C<ERRSV>. | |
5a844595 | 1535 | |
c5df3096 Z |
1536 | =cut |
1537 | */ | |
1538 | ||
1539 | void | |
1540 | Perl_vcroak(pTHX_ const char* pat, va_list *args) | |
1541 | { | |
1542 | SV *ex = with_queued_errors(pat ? vmess(pat, args) : mess_sv(ERRSV, 0)); | |
1543 | invoke_exception_hook(ex, FALSE); | |
1544 | die_unwind(ex); | |
a687059c LW |
1545 | } |
1546 | ||
c5df3096 Z |
1547 | /* |
1548 | =for apidoc Am|void|croak|const char *pat|... | |
1549 | ||
1550 | This is an XS interface to Perl's C<die> function. | |
1551 | ||
1552 | Take a sprintf-style format pattern and argument list. These are used to | |
1553 | generate a string message. If the message does not end with a newline, | |
1554 | then it will be extended with some indication of the current location | |
1555 | in the code, as described for L</mess_sv>. | |
1556 | ||
1557 | The error message will be used as an exception, by default | |
1558 | returning control to the nearest enclosing C<eval>, but subject to | |
1559 | modification by a C<$SIG{__DIE__}> handler. In any case, the C<croak> | |
1560 | function never returns normally. | |
1561 | ||
1562 | For historical reasons, if C<pat> is null then the contents of C<ERRSV> | |
1563 | (C<$@>) will be used as an error message or object instead of building an | |
1564 | error message from arguments. If you want to throw a non-string object, | |
1565 | or build an error message in an SV yourself, it is preferable to use | |
1566 | the L</croak_sv> function, which does not involve clobbering C<ERRSV>. | |
1567 | ||
1568 | =cut | |
1569 | */ | |
1570 | ||
c5be433b | 1571 | #if defined(PERL_IMPLICIT_CONTEXT) |
8990e307 | 1572 | void |
cea2e8a9 | 1573 | Perl_croak_nocontext(const char *pat, ...) |
a687059c | 1574 | { |
cea2e8a9 | 1575 | dTHX; |
a687059c | 1576 | va_list args; |
cea2e8a9 | 1577 | va_start(args, pat); |
c5be433b | 1578 | vcroak(pat, &args); |
cea2e8a9 GS |
1579 | /* NOTREACHED */ |
1580 | va_end(args); | |
1581 | } | |
1582 | #endif /* PERL_IMPLICIT_CONTEXT */ | |
1583 | ||
c5df3096 Z |
1584 | void |
1585 | Perl_croak(pTHX_ const char *pat, ...) | |
1586 | { | |
1587 | va_list args; | |
1588 | va_start(args, pat); | |
1589 | vcroak(pat, &args); | |
1590 | /* NOTREACHED */ | |
1591 | va_end(args); | |
1592 | } | |
1593 | ||
954c1994 | 1594 | /* |
c5df3096 | 1595 | =for apidoc Am|void|warn_sv|SV *baseex |
ccfc67b7 | 1596 | |
c5df3096 | 1597 | This is an XS interface to Perl's C<warn> function. |
954c1994 | 1598 | |
c5df3096 Z |
1599 | C<baseex> is the error message or object. If it is a reference, it |
1600 | will be used as-is. Otherwise it is used as a string, and if it does | |
1601 | not end with a newline then it will be extended with some indication of | |
1602 | the current location in the code, as described for L</mess_sv>. | |
9983fa3c | 1603 | |
c5df3096 Z |
1604 | The error message or object will by default be written to standard error, |
1605 | but this is subject to modification by a C<$SIG{__WARN__}> handler. | |
9983fa3c | 1606 | |
c5df3096 Z |
1607 | To warn with a simple string message, the L</warn> function may be |
1608 | more convenient. | |
954c1994 GS |
1609 | |
1610 | =cut | |
1611 | */ | |
1612 | ||
cea2e8a9 | 1613 | void |
c5df3096 | 1614 | Perl_warn_sv(pTHX_ SV *baseex) |
cea2e8a9 | 1615 | { |
c5df3096 Z |
1616 | SV *ex = mess_sv(baseex, 0); |
1617 | PERL_ARGS_ASSERT_WARN_SV; | |
1618 | if (!invoke_exception_hook(ex, TRUE)) | |
1619 | write_to_stderr(ex); | |
cea2e8a9 GS |
1620 | } |
1621 | ||
c5df3096 Z |
1622 | /* |
1623 | =for apidoc Am|void|vwarn|const char *pat|va_list *args | |
1624 | ||
1625 | This is an XS interface to Perl's C<warn> function. | |
1626 | ||
1627 | C<pat> and C<args> are a sprintf-style format pattern and encapsulated | |
1628 | argument list. These are used to generate a string message. If the | |
1629 | message does not end with a newline, then it will be extended with | |
1630 | some indication of the current location in the code, as described for | |
1631 | L</mess_sv>. | |
1632 | ||
1633 | The error message or object will by default be written to standard error, | |
1634 | but this is subject to modification by a C<$SIG{__WARN__}> handler. | |
1635 | ||
1636 | Unlike with L</vcroak>, C<pat> is not permitted to be null. | |
1637 | ||
1638 | =cut | |
1639 | */ | |
1640 | ||
c5be433b GS |
1641 | void |
1642 | Perl_vwarn(pTHX_ const char* pat, va_list *args) | |
cea2e8a9 | 1643 | { |
c5df3096 | 1644 | SV *ex = vmess(pat, args); |
7918f24d | 1645 | PERL_ARGS_ASSERT_VWARN; |
c5df3096 Z |
1646 | if (!invoke_exception_hook(ex, TRUE)) |
1647 | write_to_stderr(ex); | |
1648 | } | |
7918f24d | 1649 | |
c5df3096 Z |
1650 | /* |
1651 | =for apidoc Am|void|warn|const char *pat|... | |
87582a92 | 1652 | |
c5df3096 Z |
1653 | This is an XS interface to Perl's C<warn> function. |
1654 | ||
1655 | Take a sprintf-style format pattern and argument list. These are used to | |
1656 | generate a string message. If the message does not end with a newline, | |
1657 | then it will be extended with some indication of the current location | |
1658 | in the code, as described for L</mess_sv>. | |
1659 | ||
1660 | The error message or object will by default be written to standard error, | |
1661 | but this is subject to modification by a C<$SIG{__WARN__}> handler. | |
1662 | ||
1663 | Unlike with L</croak>, C<pat> is not permitted to be null. | |
1664 | ||
1665 | =cut | |
1666 | */ | |
8d063cd8 | 1667 | |
c5be433b | 1668 | #if defined(PERL_IMPLICIT_CONTEXT) |
cea2e8a9 GS |
1669 | void |
1670 | Perl_warn_nocontext(const char *pat, ...) | |
1671 | { | |
1672 | dTHX; | |
1673 | va_list args; | |
7918f24d | 1674 | PERL_ARGS_ASSERT_WARN_NOCONTEXT; |
cea2e8a9 | 1675 | va_start(args, pat); |
c5be433b | 1676 | vwarn(pat, &args); |
cea2e8a9 GS |
1677 | va_end(args); |
1678 | } | |
1679 | #endif /* PERL_IMPLICIT_CONTEXT */ | |
1680 | ||
1681 | void | |
1682 | Perl_warn(pTHX_ const char *pat, ...) | |
1683 | { | |
1684 | va_list args; | |
7918f24d | 1685 | PERL_ARGS_ASSERT_WARN; |
cea2e8a9 | 1686 | va_start(args, pat); |
c5be433b | 1687 | vwarn(pat, &args); |
cea2e8a9 GS |
1688 | va_end(args); |
1689 | } | |
1690 | ||
c5be433b GS |
1691 | #if defined(PERL_IMPLICIT_CONTEXT) |
1692 | void | |
1693 | Perl_warner_nocontext(U32 err, const char *pat, ...) | |
1694 | { | |
27da23d5 | 1695 | dTHX; |
c5be433b | 1696 | va_list args; |
7918f24d | 1697 | PERL_ARGS_ASSERT_WARNER_NOCONTEXT; |
c5be433b GS |
1698 | va_start(args, pat); |
1699 | vwarner(err, pat, &args); | |
1700 | va_end(args); | |
1701 | } | |
1702 | #endif /* PERL_IMPLICIT_CONTEXT */ | |
1703 | ||
599cee73 | 1704 | void |
9b387841 NC |
1705 | Perl_ck_warner_d(pTHX_ U32 err, const char* pat, ...) |
1706 | { | |
1707 | PERL_ARGS_ASSERT_CK_WARNER_D; | |
1708 | ||
1709 | if (Perl_ckwarn_d(aTHX_ err)) { | |
1710 | va_list args; | |
1711 | va_start(args, pat); | |
1712 | vwarner(err, pat, &args); | |
1713 | va_end(args); | |
1714 | } | |
1715 | } | |
1716 | ||
1717 | void | |
a2a5de95 NC |
1718 | Perl_ck_warner(pTHX_ U32 err, const char* pat, ...) |
1719 | { | |
1720 | PERL_ARGS_ASSERT_CK_WARNER; | |
1721 | ||
1722 | if (Perl_ckwarn(aTHX_ err)) { | |
1723 | va_list args; | |
1724 | va_start(args, pat); | |
1725 | vwarner(err, pat, &args); | |
1726 | va_end(args); | |
1727 | } | |
1728 | } | |
1729 | ||
1730 | void | |
864dbfa3 | 1731 | Perl_warner(pTHX_ U32 err, const char* pat,...) |
599cee73 PM |
1732 | { |
1733 | va_list args; | |
7918f24d | 1734 | PERL_ARGS_ASSERT_WARNER; |
c5be433b GS |
1735 | va_start(args, pat); |
1736 | vwarner(err, pat, &args); | |
1737 | va_end(args); | |
1738 | } | |
1739 | ||
1740 | void | |
1741 | Perl_vwarner(pTHX_ U32 err, const char* pat, va_list* args) | |
1742 | { | |
27da23d5 | 1743 | dVAR; |
7918f24d | 1744 | PERL_ARGS_ASSERT_VWARNER; |
5f2d9966 | 1745 | if (PL_warnhook == PERL_WARNHOOK_FATAL || ckDEAD(err)) { |
a3b680e6 | 1746 | SV * const msv = vmess(pat, args); |
599cee73 | 1747 | |
c5df3096 Z |
1748 | invoke_exception_hook(msv, FALSE); |
1749 | die_unwind(msv); | |
599cee73 PM |
1750 | } |
1751 | else { | |
d13b0d77 | 1752 | Perl_vwarn(aTHX_ pat, args); |
599cee73 PM |
1753 | } |
1754 | } | |
1755 | ||
f54ba1c2 DM |
1756 | /* implements the ckWARN? macros */ |
1757 | ||
1758 | bool | |
1759 | Perl_ckwarn(pTHX_ U32 w) | |
1760 | { | |
97aff369 | 1761 | dVAR; |
ad287e37 NC |
1762 | /* If lexical warnings have not been set, use $^W. */ |
1763 | if (isLEXWARN_off) | |
1764 | return PL_dowarn & G_WARN_ON; | |
1765 | ||
26c7b074 | 1766 | return ckwarn_common(w); |
f54ba1c2 DM |
1767 | } |
1768 | ||
1769 | /* implements the ckWARN?_d macro */ | |
1770 | ||
1771 | bool | |
1772 | Perl_ckwarn_d(pTHX_ U32 w) | |
1773 | { | |
97aff369 | 1774 | dVAR; |
ad287e37 NC |
1775 | /* If lexical warnings have not been set then default classes warn. */ |
1776 | if (isLEXWARN_off) | |
1777 | return TRUE; | |
1778 | ||
26c7b074 NC |
1779 | return ckwarn_common(w); |
1780 | } | |
1781 | ||
1782 | static bool | |
1783 | S_ckwarn_common(pTHX_ U32 w) | |
1784 | { | |
ad287e37 NC |
1785 | if (PL_curcop->cop_warnings == pWARN_ALL) |
1786 | return TRUE; | |
1787 | ||
1788 | if (PL_curcop->cop_warnings == pWARN_NONE) | |
1789 | return FALSE; | |
1790 | ||
98fe6610 NC |
1791 | /* Check the assumption that at least the first slot is non-zero. */ |
1792 | assert(unpackWARN1(w)); | |
1793 | ||
1794 | /* Check the assumption that it is valid to stop as soon as a zero slot is | |
1795 | seen. */ | |
1796 | if (!unpackWARN2(w)) { | |
1797 | assert(!unpackWARN3(w)); | |
1798 | assert(!unpackWARN4(w)); | |
1799 | } else if (!unpackWARN3(w)) { | |
1800 | assert(!unpackWARN4(w)); | |
1801 | } | |
1802 | ||
26c7b074 NC |
1803 | /* Right, dealt with all the special cases, which are implemented as non- |
1804 | pointers, so there is a pointer to a real warnings mask. */ | |
98fe6610 NC |
1805 | do { |
1806 | if (isWARN_on(PL_curcop->cop_warnings, unpackWARN1(w))) | |
1807 | return TRUE; | |
1808 | } while (w >>= WARNshift); | |
1809 | ||
1810 | return FALSE; | |
f54ba1c2 DM |
1811 | } |
1812 | ||
72dc9ed5 NC |
1813 | /* Set buffer=NULL to get a new one. */ |
1814 | STRLEN * | |
8ee4cf24 | 1815 | Perl_new_warnings_bitfield(pTHX_ STRLEN *buffer, const char *const bits, |
72dc9ed5 NC |
1816 | STRLEN size) { |
1817 | const MEM_SIZE len_wanted = sizeof(STRLEN) + size; | |
35da51f7 | 1818 | PERL_UNUSED_CONTEXT; |
7918f24d | 1819 | PERL_ARGS_ASSERT_NEW_WARNINGS_BITFIELD; |
72dc9ed5 | 1820 | |
10edeb5d JH |
1821 | buffer = (STRLEN*) |
1822 | (specialWARN(buffer) ? | |
1823 | PerlMemShared_malloc(len_wanted) : | |
1824 | PerlMemShared_realloc(buffer, len_wanted)); | |
72dc9ed5 NC |
1825 | buffer[0] = size; |
1826 | Copy(bits, (buffer + 1), size, char); | |
1827 | return buffer; | |
1828 | } | |
f54ba1c2 | 1829 | |
e6587932 DM |
1830 | /* since we've already done strlen() for both nam and val |
1831 | * we can use that info to make things faster than | |
1832 | * sprintf(s, "%s=%s", nam, val) | |
1833 | */ | |
1834 | #define my_setenv_format(s, nam, nlen, val, vlen) \ | |
1835 | Copy(nam, s, nlen, char); \ | |
1836 | *(s+nlen) = '='; \ | |
1837 | Copy(val, s+(nlen+1), vlen, char); \ | |
1838 | *(s+(nlen+1+vlen)) = '\0' | |
1839 | ||
c5d12488 JH |
1840 | #ifdef USE_ENVIRON_ARRAY |
1841 | /* VMS' my_setenv() is in vms.c */ | |
1842 | #if !defined(WIN32) && !defined(NETWARE) | |
8d063cd8 | 1843 | void |
e1ec3a88 | 1844 | Perl_my_setenv(pTHX_ const char *nam, const char *val) |
8d063cd8 | 1845 | { |
27da23d5 | 1846 | dVAR; |
4efc5df6 GS |
1847 | #ifdef USE_ITHREADS |
1848 | /* only parent thread can modify process environment */ | |
1849 | if (PL_curinterp == aTHX) | |
1850 | #endif | |
1851 | { | |
f2517201 | 1852 | #ifndef PERL_USE_SAFE_PUTENV |
50acdf95 | 1853 | if (!PL_use_safe_putenv) { |
c5d12488 | 1854 | /* most putenv()s leak, so we manipulate environ directly */ |
3a9222be JH |
1855 | register I32 i; |
1856 | register const I32 len = strlen(nam); | |
c5d12488 JH |
1857 | int nlen, vlen; |
1858 | ||
3a9222be JH |
1859 | /* where does it go? */ |
1860 | for (i = 0; environ[i]; i++) { | |
1861 | if (strnEQ(environ[i],nam,len) && environ[i][len] == '=') | |
1862 | break; | |
1863 | } | |
1864 | ||
c5d12488 JH |
1865 | if (environ == PL_origenviron) { /* need we copy environment? */ |
1866 | I32 j; | |
1867 | I32 max; | |
1868 | char **tmpenv; | |
1869 | ||
1870 | max = i; | |
1871 | while (environ[max]) | |
1872 | max++; | |
1873 | tmpenv = (char**)safesysmalloc((max+2) * sizeof(char*)); | |
1874 | for (j=0; j<max; j++) { /* copy environment */ | |
1875 | const int len = strlen(environ[j]); | |
1876 | tmpenv[j] = (char*)safesysmalloc((len+1)*sizeof(char)); | |
1877 | Copy(environ[j], tmpenv[j], len+1, char); | |
1878 | } | |
1879 | tmpenv[max] = NULL; | |
1880 | environ = tmpenv; /* tell exec where it is now */ | |
1881 | } | |
1882 | if (!val) { | |
1883 | safesysfree(environ[i]); | |
1884 | while (environ[i]) { | |
1885 | environ[i] = environ[i+1]; | |
1886 | i++; | |
a687059c | 1887 | } |
c5d12488 JH |
1888 | return; |
1889 | } | |
1890 | if (!environ[i]) { /* does not exist yet */ | |
1891 | environ = (char**)safesysrealloc(environ, (i+2) * sizeof(char*)); | |
1892 | environ[i+1] = NULL; /* make sure it's null terminated */ | |
1893 | } | |
1894 | else | |
1895 | safesysfree(environ[i]); | |
1896 | nlen = strlen(nam); | |
1897 | vlen = strlen(val); | |
1898 | ||
1899 | environ[i] = (char*)safesysmalloc((nlen+vlen+2) * sizeof(char)); | |
1900 | /* all that work just for this */ | |
1901 | my_setenv_format(environ[i], nam, nlen, val, vlen); | |
50acdf95 | 1902 | } else { |
c5d12488 | 1903 | # endif |
7ee146b1 | 1904 | # if defined(__CYGWIN__) || defined(EPOC) || defined(__SYMBIAN32__) || defined(__riscos__) |
88f5bc07 AB |
1905 | # if defined(HAS_UNSETENV) |
1906 | if (val == NULL) { | |
1907 | (void)unsetenv(nam); | |
1908 | } else { | |
1909 | (void)setenv(nam, val, 1); | |
1910 | } | |
1911 | # else /* ! HAS_UNSETENV */ | |
1912 | (void)setenv(nam, val, 1); | |
1913 | # endif /* HAS_UNSETENV */ | |
47dafe4d | 1914 | # else |
88f5bc07 AB |
1915 | # if defined(HAS_UNSETENV) |
1916 | if (val == NULL) { | |
1917 | (void)unsetenv(nam); | |
1918 | } else { | |
c4420975 AL |
1919 | const int nlen = strlen(nam); |
1920 | const int vlen = strlen(val); | |
1921 | char * const new_env = | |
88f5bc07 AB |
1922 | (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char)); |
1923 | my_setenv_format(new_env, nam, nlen, val, vlen); | |
1924 | (void)putenv(new_env); | |
1925 | } | |
1926 | # else /* ! HAS_UNSETENV */ | |
1927 | char *new_env; | |
c4420975 AL |
1928 | const int nlen = strlen(nam); |
1929 | int vlen; | |
88f5bc07 AB |
1930 | if (!val) { |
1931 | val = ""; | |
1932 | } | |
1933 | vlen = strlen(val); | |
1934 | new_env = (char*)safesysmalloc((nlen + vlen + 2) * sizeof(char)); | |
1935 | /* all that work just for this */ | |
1936 | my_setenv_format(new_env, nam, nlen, val, vlen); | |
1937 | (void)putenv(new_env); | |
1938 | # endif /* HAS_UNSETENV */ | |
47dafe4d | 1939 | # endif /* __CYGWIN__ */ |
50acdf95 MS |
1940 | #ifndef PERL_USE_SAFE_PUTENV |
1941 | } | |
1942 | #endif | |
4efc5df6 | 1943 | } |
8d063cd8 LW |
1944 | } |
1945 | ||
c5d12488 | 1946 | #else /* WIN32 || NETWARE */ |
68dc0745 | 1947 | |
1948 | void | |
72229eff | 1949 | Perl_my_setenv(pTHX_ const char *nam, const char *val) |
68dc0745 | 1950 | { |
27da23d5 | 1951 | dVAR; |
c5d12488 JH |
1952 | register char *envstr; |
1953 | const int nlen = strlen(nam); | |
1954 | int vlen; | |
e6587932 | 1955 | |
c5d12488 JH |
1956 | if (!val) { |
1957 | val = ""; | |
ac5c734f | 1958 | } |
c5d12488 JH |
1959 | vlen = strlen(val); |
1960 | Newx(envstr, nlen+vlen+2, char); | |
1961 | my_setenv_format(envstr, nam, nlen, val, vlen); | |
1962 | (void)PerlEnv_putenv(envstr); | |
1963 | Safefree(envstr); | |
3e3baf6d TB |
1964 | } |
1965 | ||
c5d12488 | 1966 | #endif /* WIN32 || NETWARE */ |
3e3baf6d | 1967 | |
c5d12488 | 1968 | #endif /* !VMS && !EPOC*/ |
378cc40b | 1969 | |
16d20bd9 | 1970 | #ifdef UNLINK_ALL_VERSIONS |
79072805 | 1971 | I32 |
6e732051 | 1972 | Perl_unlnk(pTHX_ const char *f) /* unlink all versions of a file */ |
378cc40b | 1973 | { |
35da51f7 | 1974 | I32 retries = 0; |
378cc40b | 1975 | |
7918f24d NC |
1976 | PERL_ARGS_ASSERT_UNLNK; |
1977 | ||
35da51f7 AL |
1978 | while (PerlLIO_unlink(f) >= 0) |
1979 | retries++; | |
1980 | return retries ? 0 : -1; | |
378cc40b LW |
1981 | } |
1982 | #endif | |
1983 | ||
7a3f2258 | 1984 | /* this is a drop-in replacement for bcopy() */ |
2253333f | 1985 | #if (!defined(HAS_MEMCPY) && !defined(HAS_BCOPY)) || (!defined(HAS_MEMMOVE) && !defined(HAS_SAFE_MEMCPY) && !defined(HAS_SAFE_BCOPY)) |
378cc40b | 1986 | char * |
7a3f2258 | 1987 | Perl_my_bcopy(register const char *from,register char *to,register I32 len) |
378cc40b | 1988 | { |
2d03de9c | 1989 | char * const retval = to; |
378cc40b | 1990 | |
7918f24d NC |
1991 | PERL_ARGS_ASSERT_MY_BCOPY; |
1992 | ||
7c0587c8 LW |
1993 | if (from - to >= 0) { |
1994 | while (len--) | |
1995 | *to++ = *from++; | |
1996 | } | |
1997 | else { | |
1998 | to += len; | |
1999 | from += len; | |
2000 | while (len--) | |
faf8582f | 2001 | *(--to) = *(--from); |
7c0587c8 | 2002 | } |
378cc40b LW |
2003 | return retval; |
2004 | } | |
ffed7fef | 2005 | #endif |
378cc40b | 2006 | |
7a3f2258 | 2007 | /* this is a drop-in replacement for memset() */ |
fc36a67e | 2008 | #ifndef HAS_MEMSET |
2009 | void * | |
7a3f2258 | 2010 | Perl_my_memset(register char *loc, register I32 ch, register I32 len) |
fc36a67e | 2011 | { |
2d03de9c | 2012 | char * const retval = loc; |
fc36a67e | 2013 | |
7918f24d NC |
2014 | PERL_ARGS_ASSERT_MY_MEMSET; |
2015 | ||
fc36a67e | 2016 | while (len--) |
2017 | *loc++ = ch; | |
2018 | return retval; | |
2019 | } | |
2020 | #endif | |
2021 | ||
7a3f2258 | 2022 | /* this is a drop-in replacement for bzero() */ |
7c0587c8 | 2023 | #if !defined(HAS_BZERO) && !defined(HAS_MEMSET) |
378cc40b | 2024 | char * |
7a3f2258 | 2025 | Perl_my_bzero(register char *loc, register I32 len) |
378cc40b | 2026 | { |
2d03de9c | 2027 | char * const retval = loc; |
378cc40b | 2028 | |
7918f24d NC |
2029 | PERL_ARGS_ASSERT_MY_BZERO; |
2030 | ||
378cc40b LW |
2031 | while (len--) |
2032 | *loc++ = 0; | |
2033 | return retval; | |
2034 | } | |
2035 | #endif | |
7c0587c8 | 2036 | |
7a3f2258 | 2037 | /* this is a drop-in replacement for memcmp() */ |
36477c24 | 2038 | #if !defined(HAS_MEMCMP) || !defined(HAS_SANE_MEMCMP) |
79072805 | 2039 | I32 |
7a3f2258 | 2040 | Perl_my_memcmp(const char *s1, const char *s2, register I32 len) |
7c0587c8 | 2041 | { |
e1ec3a88 AL |
2042 | register const U8 *a = (const U8 *)s1; |
2043 | register const U8 *b = (const U8 *)s2; | |
79072805 | 2044 | register I32 tmp; |
7c0587c8 | 2045 | |
7918f24d NC |
2046 | PERL_ARGS_ASSERT_MY_MEMCMP; |
2047 | ||
7c0587c8 | 2048 | while (len--) { |
27da23d5 | 2049 | if ((tmp = *a++ - *b++)) |
7c0587c8 LW |
2050 | return tmp; |
2051 | } | |
2052 | return 0; | |
2053 | } | |
36477c24 | 2054 | #endif /* !HAS_MEMCMP || !HAS_SANE_MEMCMP */ |
a687059c | 2055 | |
fe14fcc3 | 2056 | #ifndef HAS_VPRINTF |
d05d9be5 AD |
2057 | /* This vsprintf replacement should generally never get used, since |
2058 | vsprintf was available in both System V and BSD 2.11. (There may | |
2059 | be some cross-compilation or embedded set-ups where it is needed, | |
2060 | however.) | |
2061 | ||
2062 | If you encounter a problem in this function, it's probably a symptom | |
2063 | that Configure failed to detect your system's vprintf() function. | |
2064 | See the section on "item vsprintf" in the INSTALL file. | |
2065 | ||
2066 | This version may compile on systems with BSD-ish <stdio.h>, | |
2067 | but probably won't on others. | |
2068 | */ | |
a687059c | 2069 | |
85e6fe83 | 2070 | #ifdef USE_CHAR_VSPRINTF |
a687059c LW |
2071 | char * |
2072 | #else | |
2073 | int | |
2074 | #endif | |
d05d9be5 | 2075 | vsprintf(char *dest, const char *pat, void *args) |
a687059c LW |
2076 | { |
2077 | FILE fakebuf; | |
2078 | ||
d05d9be5 AD |
2079 | #if defined(STDIO_PTR_LVALUE) && defined(STDIO_CNT_LVALUE) |
2080 | FILE_ptr(&fakebuf) = (STDCHAR *) dest; | |
2081 | FILE_cnt(&fakebuf) = 32767; | |
2082 | #else | |
2083 | /* These probably won't compile -- If you really need | |
2084 | this, you'll have to figure out some other method. */ | |
a687059c LW |
2085 | fakebuf._ptr = dest; |
2086 | fakebuf._cnt = 32767; | |
d05d9be5 | 2087 | #endif |
35c8bce7 LW |
2088 | #ifndef _IOSTRG |
2089 | #define _IOSTRG 0 | |
2090 | #endif | |
a687059c LW |
2091 | fakebuf._flag = _IOWRT|_IOSTRG; |
2092 | _doprnt(pat, args, &fakebuf); /* what a kludge */ | |
d05d9be5 AD |
2093 | #if defined(STDIO_PTR_LVALUE) |
2094 | *(FILE_ptr(&fakebuf)++) = '\0'; | |
2095 | #else | |
2096 | /* PerlIO has probably #defined away fputc, but we want it here. */ | |
2097 | # ifdef fputc | |
2098 | # undef fputc /* XXX Should really restore it later */ | |
2099 | # endif | |
2100 | (void)fputc('\0', &fakebuf); | |
2101 | #endif | |
85e6fe83 | 2102 | #ifdef USE_CHAR_VSPRINTF |
a687059c LW |
2103 | return(dest); |
2104 | #else | |
2105 | return 0; /* perl doesn't use return value */ | |
2106 | #endif | |
2107 | } | |
2108 | ||
fe14fcc3 | 2109 | #endif /* HAS_VPRINTF */ |
a687059c LW |
2110 | |
2111 | #ifdef MYSWAP | |
ffed7fef | 2112 | #if BYTEORDER != 0x4321 |
a687059c | 2113 | short |
864dbfa3 | 2114 | Perl_my_swap(pTHX_ short s) |
a687059c LW |
2115 | { |
2116 | #if (BYTEORDER & 1) == 0 | |
2117 | short result; | |
2118 | ||
2119 | result = ((s & 255) << 8) + ((s >> 8) & 255); | |
2120 | return result; | |
2121 | #else | |
2122 | return s; | |
2123 | #endif | |
2124 | } | |
2125 | ||
2126 | long | |
864dbfa3 | 2127 | Perl_my_htonl(pTHX_ long l) |
a687059c LW |
2128 | { |
2129 | union { | |
2130 | long result; | |
ffed7fef | 2131 | char c[sizeof(long)]; |
a687059c LW |
2132 | } u; |
2133 | ||
cef6ea9d JH |
2134 | #if BYTEORDER == 0x1234 || BYTEORDER == 0x12345678 |
2135 | #if BYTEORDER == 0x12345678 | |
2136 | u.result = 0; | |
2137 | #endif | |
a687059c LW |
2138 | u.c[0] = (l >> 24) & 255; |
2139 | u.c[1] = (l >> 16) & 255; | |
2140 | u.c[2] = (l >> 8) & 255; | |
2141 | u.c[3] = l & 255; | |
2142 | return u.result; | |
2143 | #else | |
ffed7fef | 2144 | #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf) |
cea2e8a9 | 2145 | Perl_croak(aTHX_ "Unknown BYTEORDER\n"); |
a687059c | 2146 | #else |
79072805 LW |
2147 | register I32 o; |
2148 | register I32 s; | |
a687059c | 2149 | |
ffed7fef LW |
2150 | for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) { |
2151 | u.c[o & 0xf] = (l >> s) & 255; | |
a687059c LW |
2152 | } |
2153 | return u.result; | |
2154 | #endif | |
2155 | #endif | |
2156 | } | |
2157 | ||
2158 | long | |
864dbfa3 | 2159 | Perl_my_ntohl(pTHX_ long l) |
a687059c LW |
2160 | { |
2161 | union { | |
2162 | long l; | |
ffed7fef | 2163 | char c[sizeof(long)]; |
a687059c LW |
2164 | } u; |
2165 | ||
ffed7fef | 2166 | #if BYTEORDER == 0x1234 |
a687059c LW |
2167 | u.c[0] = (l >> 24) & 255; |
2168 | u.c[1] = (l >> 16) & 255; | |
2169 | u.c[2] = (l >> 8) & 255; | |
2170 | u.c[3] = l & 255; | |
2171 | return u.l; | |
2172 | #else | |
ffed7fef | 2173 | #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf) |
cea2e8a9 | 2174 | Perl_croak(aTHX_ "Unknown BYTEORDER\n"); |
a687059c | 2175 | #else |
79072805 LW |
2176 | register I32 o; |
2177 | register I32 s; | |
a687059c LW |
2178 | |
2179 | u.l = l; | |
2180 | l = 0; | |
ffed7fef LW |
2181 | for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) { |
2182 | l |= (u.c[o & 0xf] & 255) << s; | |
a687059c LW |
2183 | } |
2184 | return l; | |
2185 | #endif | |
2186 | #endif | |
2187 | } | |
2188 | ||
ffed7fef | 2189 | #endif /* BYTEORDER != 0x4321 */ |
988174c1 LW |
2190 | #endif /* MYSWAP */ |
2191 | ||
2192 | /* | |
2193 | * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'. | |
2194 | * If these functions are defined, | |
2195 | * the BYTEORDER is neither 0x1234 nor 0x4321. | |
2196 | * However, this is not assumed. | |
2197 | * -DWS | |
2198 | */ | |
2199 | ||
1109a392 | 2200 | #define HTOLE(name,type) \ |
988174c1 | 2201 | type \ |
ba106d47 | 2202 | name (register type n) \ |
988174c1 LW |
2203 | { \ |
2204 | union { \ | |
2205 | type value; \ | |
2206 | char c[sizeof(type)]; \ | |
2207 | } u; \ | |
bb7a0f54 MHM |
2208 | register U32 i; \ |
2209 | register U32 s = 0; \ | |
1109a392 | 2210 | for (i = 0; i < sizeof(u.c); i++, s += 8) { \ |
988174c1 LW |
2211 | u.c[i] = (n >> s) & 0xFF; \ |
2212 | } \ | |
2213 | return u.value; \ | |
2214 | } | |
2215 | ||
1109a392 | 2216 | #define LETOH(name,type) \ |
988174c1 | 2217 | type \ |
ba106d47 | 2218 | name (register type n) \ |
988174c1 LW |
2219 | { \ |
2220 | union { \ | |
2221 | type value; \ | |
2222 | char c[sizeof(type)]; \ | |
2223 | } u; \ | |
bb7a0f54 MHM |
2224 | register U32 i; \ |
2225 | register U32 s = 0; \ | |
988174c1 LW |
2226 | u.value = n; \ |
2227 | n = 0; \ | |
1109a392 MHM |
2228 | for (i = 0; i < sizeof(u.c); i++, s += 8) { \ |
2229 | n |= ((type)(u.c[i] & 0xFF)) << s; \ | |
988174c1 LW |
2230 | } \ |
2231 | return n; \ | |
2232 | } | |
2233 | ||
1109a392 MHM |
2234 | /* |
2235 | * Big-endian byte order functions. | |
2236 | */ | |
2237 | ||
2238 | #define HTOBE(name,type) \ | |
2239 | type \ | |
2240 | name (register type n) \ | |
2241 | { \ | |
2242 | union { \ | |
2243 | type value; \ | |
2244 | char c[sizeof(type)]; \ | |
2245 | } u; \ | |
bb7a0f54 MHM |
2246 | register U32 i; \ |
2247 | register U32 s = 8*(sizeof(u.c)-1); \ | |
1109a392 MHM |
2248 | for (i = 0; i < sizeof(u.c); i++, s -= 8) { \ |
2249 | u.c[i] = (n >> s) & 0xFF; \ | |
2250 | } \ | |
2251 | return u.value; \ | |
2252 | } | |
2253 | ||
2254 | #define BETOH(name,type) \ | |
2255 | type \ | |
2256 | name (register type n) \ | |
2257 | { \ | |
2258 | union { \ | |
2259 | type value; \ | |
2260 | char c[sizeof(type)]; \ | |
2261 | } u; \ | |
bb7a0f54 MHM |
2262 | register U32 i; \ |
2263 | register U32 s = 8*(sizeof(u.c)-1); \ | |
1109a392 MHM |
2264 | u.value = n; \ |
2265 | n = 0; \ | |
2266 | for (i = 0; i < sizeof(u.c); i++, s -= 8) { \ | |
2267 | n |= ((type)(u.c[i] & 0xFF)) << s; \ | |
2268 | } \ | |
2269 | return n; \ | |
2270 | } | |
2271 | ||
2272 | /* | |
2273 | * If we just can't do it... | |
2274 | */ | |
2275 | ||
2276 | #define NOT_AVAIL(name,type) \ | |
2277 | type \ | |
2278 | name (register type n) \ | |
2279 | { \ | |
2280 | Perl_croak_nocontext(#name "() not available"); \ | |
2281 | return n; /* not reached */ \ | |
2282 | } | |
2283 | ||
2284 | ||
988174c1 | 2285 | #if defined(HAS_HTOVS) && !defined(htovs) |
1109a392 | 2286 | HTOLE(htovs,short) |
988174c1 LW |
2287 | #endif |
2288 | #if defined(HAS_HTOVL) && !defined(htovl) | |
1109a392 | 2289 | HTOLE(htovl,long) |
988174c1 LW |
2290 | #endif |
2291 | #if defined(HAS_VTOHS) && !defined(vtohs) | |
1109a392 | 2292 | LETOH(vtohs,short) |
988174c1 LW |
2293 | #endif |
2294 | #if defined(HAS_VTOHL) && !defined(vtohl) | |
1109a392 MHM |
2295 | LETOH(vtohl,long) |
2296 | #endif | |
2297 | ||
2298 | #ifdef PERL_NEED_MY_HTOLE16 | |
2299 | # if U16SIZE == 2 | |
2300 | HTOLE(Perl_my_htole16,U16) | |
2301 | # else | |
2302 | NOT_AVAIL(Perl_my_htole16,U16) | |
2303 | # endif | |
2304 | #endif | |
2305 | #ifdef PERL_NEED_MY_LETOH16 | |
2306 | # if U16SIZE == 2 | |
2307 | LETOH(Perl_my_letoh16,U16) | |
2308 | # else | |
2309 | NOT_AVAIL(Perl_my_letoh16,U16) | |
2310 | # endif | |
2311 | #endif | |
2312 | #ifdef PERL_NEED_MY_HTOBE16 | |
2313 | # if U16SIZE == 2 | |
2314 | HTOBE(Perl_my_htobe16,U16) | |
2315 | # else | |
2316 | NOT_AVAIL(Perl_my_htobe16,U16) | |
2317 | # endif | |
2318 | #endif | |
2319 | #ifdef PERL_NEED_MY_BETOH16 | |
2320 | # if U16SIZE == 2 | |
2321 | BETOH(Perl_my_betoh16,U16) | |
2322 | # else | |
2323 | NOT_AVAIL(Perl_my_betoh16,U16) | |
2324 | # endif | |
2325 | #endif | |
2326 | ||
2327 | #ifdef PERL_NEED_MY_HTOLE32 | |
2328 | # if U32SIZE == 4 | |
2329 | HTOLE(Perl_my_htole32,U32) | |
2330 | # else | |
2331 | NOT_AVAIL(Perl_my_htole32,U32) | |
2332 | # endif | |
2333 | #endif | |
2334 | #ifdef PERL_NEED_MY_LETOH32 | |
2335 | # if U32SIZE == 4 | |
2336 | LETOH(Perl_my_letoh32,U32) | |
2337 | # else | |
2338 | NOT_AVAIL(Perl_my_letoh32,U32) | |
2339 | # endif | |
2340 | #endif | |
2341 | #ifdef PERL_NEED_MY_HTOBE32 | |
2342 | # if U32SIZE == 4 | |
2343 | HTOBE(Perl_my_htobe32,U32) | |
2344 | # else | |
2345 | NOT_AVAIL(Perl_my_htobe32,U32) | |
2346 | # endif | |
2347 | #endif | |
2348 | #ifdef PERL_NEED_MY_BETOH32 | |
2349 | # if U32SIZE == 4 | |
2350 | BETOH(Perl_my_betoh32,U32) | |
2351 | # else | |
2352 | NOT_AVAIL(Perl_my_betoh32,U32) | |
2353 | # endif | |
2354 | #endif | |
2355 | ||
2356 | #ifdef PERL_NEED_MY_HTOLE64 | |
2357 | # if U64SIZE == 8 | |
2358 | HTOLE(Perl_my_htole64,U64) | |
2359 | # else | |
2360 | NOT_AVAIL(Perl_my_htole64,U64) | |
2361 | # endif | |
2362 | #endif | |
2363 | #ifdef PERL_NEED_MY_LETOH64 | |
2364 | # if U64SIZE == 8 | |
2365 | LETOH(Perl_my_letoh64,U64) | |
2366 | # else | |
2367 | NOT_AVAIL(Perl_my_letoh64,U64) | |
2368 | # endif | |
2369 | #endif | |
2370 | #ifdef PERL_NEED_MY_HTOBE64 | |
2371 | # if U64SIZE == 8 | |
2372 | HTOBE(Perl_my_htobe64,U64) | |
2373 | # else | |
2374 | NOT_AVAIL(Perl_my_htobe64,U64) | |
2375 | # endif | |
2376 | #endif | |
2377 | #ifdef PERL_NEED_MY_BETOH64 | |
2378 | # if U64SIZE == 8 | |
2379 | BETOH(Perl_my_betoh64,U64) | |
2380 | # else | |
2381 | NOT_AVAIL(Perl_my_betoh64,U64) | |
2382 | # endif | |
988174c1 | 2383 | #endif |
a687059c | 2384 | |
1109a392 MHM |
2385 | #ifdef PERL_NEED_MY_HTOLES |
2386 | HTOLE(Perl_my_htoles,short) | |
2387 | #endif | |
2388 | #ifdef PERL_NEED_MY_LETOHS | |
2389 | LETOH(Perl_my_letohs,short) | |
2390 | #endif | |
2391 | #ifdef PERL_NEED_MY_HTOBES | |
2392 | HTOBE(Perl_my_htobes,short) | |
2393 | #endif | |
2394 | #ifdef PERL_NEED_MY_BETOHS | |
2395 | BETOH(Perl_my_betohs,short) | |
2396 | #endif | |
2397 | ||
2398 | #ifdef PERL_NEED_MY_HTOLEI | |
2399 | HTOLE(Perl_my_htolei,int) | |
2400 | #endif | |
2401 | #ifdef PERL_NEED_MY_LETOHI | |
2402 | LETOH(Perl_my_letohi,int) | |
2403 | #endif | |
2404 | #ifdef PERL_NEED_MY_HTOBEI | |
2405 | HTOBE(Perl_my_htobei,int) | |
2406 | #endif | |
2407 | #ifdef PERL_NEED_MY_BETOHI | |
2408 | BETOH(Perl_my_betohi,int) | |
2409 | #endif | |
2410 | ||
2411 | #ifdef PERL_NEED_MY_HTOLEL | |
2412 | HTOLE(Perl_my_htolel,long) | |
2413 | #endif | |
2414 | #ifdef PERL_NEED_MY_LETOHL | |
2415 | LETOH(Perl_my_letohl,long) | |
2416 | #endif | |
2417 | #ifdef PERL_NEED_MY_HTOBEL | |
2418 | HTOBE(Perl_my_htobel,long) | |
2419 | #endif | |
2420 | #ifdef PERL_NEED_MY_BETOHL | |
2421 | BETOH(Perl_my_betohl,long) | |
2422 | #endif | |
2423 | ||
2424 | void | |
2425 | Perl_my_swabn(void *ptr, int n) | |
2426 | { | |
2427 | register char *s = (char *)ptr; | |
2428 | register char *e = s + (n-1); | |
2429 | register char tc; | |
2430 | ||
7918f24d NC |
2431 | PERL_ARGS_ASSERT_MY_SWABN; |
2432 | ||
1109a392 MHM |
2433 | for (n /= 2; n > 0; s++, e--, n--) { |
2434 | tc = *s; | |
2435 | *s = *e; | |
2436 | *e = tc; | |
2437 | } | |
2438 | } | |
2439 | ||
4a7d1889 | 2440 | PerlIO * |
c9289b7b | 2441 | Perl_my_popen_list(pTHX_ const char *mode, int n, SV **args) |
4a7d1889 | 2442 | { |
e37778c2 | 2443 | #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(OS2) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(NETWARE) && !defined(__LIBCATAMOUNT__) |
97aff369 | 2444 | dVAR; |
1f852d0d NIS |
2445 | int p[2]; |
2446 | register I32 This, that; | |
2447 | register Pid_t pid; | |
2448 | SV *sv; | |
2449 | I32 did_pipes = 0; | |
2450 | int pp[2]; | |
2451 | ||
7918f24d NC |
2452 | PERL_ARGS_ASSERT_MY_POPEN_LIST; |
2453 | ||
1f852d0d NIS |
2454 | PERL_FLUSHALL_FOR_CHILD; |
2455 | This = (*mode == 'w'); | |
2456 | that = !This; | |
2457 | if (PL_tainting) { | |
2458 | taint_env(); | |
2459 | taint_proper("Insecure %s%s", "EXEC"); | |
2460 | } | |
2461 | if (PerlProc_pipe(p) < 0) | |
4608196e | 2462 | return NULL; |
1f852d0d NIS |
2463 | /* Try for another pipe pair for error return */ |
2464 | if (PerlProc_pipe(pp) >= 0) | |
2465 | did_pipes = 1; | |
52e18b1f | 2466 | while ((pid = PerlProc_fork()) < 0) { |
1f852d0d NIS |
2467 | if (errno != EAGAIN) { |
2468 | PerlLIO_close(p[This]); | |
4e6dfe71 | 2469 | PerlLIO_close(p[that]); |
1f852d0d NIS |
2470 | if (did_pipes) { |
2471 | PerlLIO_close(pp[0]); | |
2472 | PerlLIO_close(pp[1]); | |
2473 | } | |
4608196e | 2474 | return NULL; |
1f852d0d | 2475 | } |
a2a5de95 | 2476 | Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds"); |
1f852d0d NIS |
2477 | sleep(5); |
2478 | } | |
2479 | if (pid == 0) { | |
2480 | /* Child */ | |
1f852d0d NIS |
2481 | #undef THIS |
2482 | #undef THAT | |
2483 | #define THIS that | |
2484 | #define THAT This | |
1f852d0d NIS |
2485 | /* Close parent's end of error status pipe (if any) */ |
2486 | if (did_pipes) { | |
2487 | PerlLIO_close(pp[0]); | |
2488 | #if defined(HAS_FCNTL) && defined(F_SETFD) | |
2489 | /* Close error pipe automatically if exec works */ | |
2490 | fcntl(pp[1], F_SETFD, FD_CLOEXEC); | |
2491 | #endif | |
2492 | } | |
2493 | /* Now dup our end of _the_ pipe to right position */ | |
2494 | if (p[THIS] != (*mode == 'r')) { | |
2495 | PerlLIO_dup2(p[THIS], *mode == 'r'); | |
2496 | PerlLIO_close(p[THIS]); | |
4e6dfe71 GS |
2497 | if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */ |
2498 | PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */ | |
1f852d0d | 2499 | } |
4e6dfe71 GS |
2500 | else |
2501 | PerlLIO_close(p[THAT]); /* close parent's end of _the_ pipe */ | |
1f852d0d NIS |
2502 | #if !defined(HAS_FCNTL) || !defined(F_SETFD) |
2503 | /* No automatic close - do it by hand */ | |
b7953727 JH |
2504 | # ifndef NOFILE |
2505 | # define NOFILE 20 | |
2506 | # endif | |
a080fe3d NIS |
2507 | { |
2508 | int fd; | |
2509 | ||
2510 | for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) { | |
3aed30dc | 2511 | if (fd != pp[1]) |
a080fe3d NIS |
2512 | PerlLIO_close(fd); |
2513 | } | |
1f852d0d NIS |
2514 | } |
2515 | #endif | |
a0714e2c | 2516 | do_aexec5(NULL, args-1, args-1+n, pp[1], did_pipes); |
1f852d0d NIS |
2517 | PerlProc__exit(1); |
2518 | #undef THIS | |
2519 | #undef THAT | |
2520 | } | |
2521 | /* Parent */ | |
52e18b1f | 2522 | do_execfree(); /* free any memory malloced by child on fork */ |
1f852d0d NIS |
2523 | if (did_pipes) |
2524 | PerlLIO_close(pp[1]); | |
2525 | /* Keep the lower of the two fd numbers */ | |
2526 | if (p[that] < p[This]) { | |
2527 | PerlLIO_dup2(p[This], p[that]); | |
2528 | PerlLIO_close(p[This]); | |
2529 | p[This] = p[that]; | |
2530 | } | |
4e6dfe71 GS |
2531 | else |
2532 | PerlLIO_close(p[that]); /* close child's end of pipe */ | |
2533 | ||
1f852d0d | 2534 | sv = *av_fetch(PL_fdpid,p[This],TRUE); |
862a34c6 | 2535 | SvUPGRADE(sv,SVt_IV); |
45977657 | 2536 | SvIV_set(sv, pid); |
1f852d0d NIS |
2537 | PL_forkprocess = pid; |
2538 | /* If we managed to get status pipe check for exec fail */ | |
2539 | if (did_pipes && pid > 0) { | |
2540 | int errkid; | |
bb7a0f54 MHM |
2541 | unsigned n = 0; |
2542 | SSize_t n1; | |
1f852d0d NIS |
2543 | |
2544 | while (n < sizeof(int)) { | |
2545 | n1 = PerlLIO_read(pp[0], | |
2546 | (void*)(((char*)&errkid)+n), | |
2547 | (sizeof(int)) - n); | |
2548 | if (n1 <= 0) | |
2549 | break; | |
2550 | n += n1; | |
2551 | } | |
2552 | PerlLIO_close(pp[0]); | |
2553 | did_pipes = 0; | |
2554 | if (n) { /* Error */ | |
2555 | int pid2, status; | |
8c51524e | 2556 | PerlLIO_close(p[This]); |
1f852d0d NIS |
2557 | if (n != sizeof(int)) |
2558 | Perl_croak(aTHX_ "panic: kid popen errno read"); | |
2559 | do { | |
2560 | pid2 = wait4pid(pid, &status, 0); | |
2561 | } while (pid2 == -1 && errno == EINTR); | |
2562 | errno = errkid; /* Propagate errno from kid */ | |
4608196e | 2563 | return NULL; |
1f852d0d NIS |
2564 | } |
2565 | } | |
2566 | if (did_pipes) | |
2567 | PerlLIO_close(pp[0]); | |
2568 | return PerlIO_fdopen(p[This], mode); | |
2569 | #else | |
9d419b5f | 2570 | # ifdef OS2 /* Same, without fork()ing and all extra overhead... */ |
4e205ed6 | 2571 | return my_syspopen4(aTHX_ NULL, mode, n, args); |
9d419b5f | 2572 | # else |
4a7d1889 NIS |
2573 | Perl_croak(aTHX_ "List form of piped open not implemented"); |
2574 | return (PerlIO *) NULL; | |
9d419b5f | 2575 | # endif |
1f852d0d | 2576 | #endif |
4a7d1889 NIS |
2577 | } |
2578 | ||
5f05dabc | 2579 | /* VMS' my_popen() is in VMS.c, same with OS/2. */ |
e37778c2 | 2580 | #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__) |
760ac839 | 2581 | PerlIO * |
3dd43144 | 2582 | Perl_my_popen(pTHX_ const char *cmd, const char *mode) |
a687059c | 2583 | { |
97aff369 | 2584 | dVAR; |
a687059c | 2585 | int p[2]; |
8ac85365 | 2586 | register I32 This, that; |
d8a83dd3 | 2587 | register Pid_t pid; |
79072805 | 2588 | SV *sv; |
bfce84ec | 2589 | const I32 doexec = !(*cmd == '-' && cmd[1] == '\0'); |
e446cec8 IZ |
2590 | I32 did_pipes = 0; |
2591 | int pp[2]; | |
a687059c | 2592 | |
7918f24d NC |
2593 | PERL_ARGS_ASSERT_MY_POPEN; |
2594 | ||
45bc9206 | 2595 | PERL_FLUSHALL_FOR_CHILD; |
ddcf38b7 IZ |
2596 | #ifdef OS2 |
2597 | if (doexec) { | |
23da6c43 | 2598 | return my_syspopen(aTHX_ cmd,mode); |
ddcf38b7 | 2599 | } |
a1d180c4 | 2600 | #endif |
8ac85365 NIS |
2601 | This = (*mode == 'w'); |
2602 | that = !This; | |
3280af22 | 2603 | if (doexec && PL_tainting) { |
bbce6d69 | 2604 | taint_env(); |
2605 | taint_proper("Insecure %s%s", "EXEC"); | |
d48672a2 | 2606 | } |
c2267164 | 2607 | if (PerlProc_pipe(p) < 0) |
4608196e | 2608 | return NULL; |
e446cec8 IZ |
2609 | if (doexec && PerlProc_pipe(pp) >= 0) |
2610 | did_pipes = 1; | |
52e18b1f | 2611 | while ((pid = PerlProc_fork()) < 0) { |
a687059c | 2612 | if (errno != EAGAIN) { |
6ad3d225 | 2613 | PerlLIO_close(p[This]); |
b5ac89c3 | 2614 | PerlLIO_close(p[that]); |
e446cec8 IZ |
2615 | if (did_pipes) { |
2616 | PerlLIO_close(pp[0]); | |
2617 | PerlLIO_close(pp[1]); | |
2618 | } | |
a687059c | 2619 | if (!doexec) |
b3647a36 | 2620 | Perl_croak(aTHX_ "Can't fork: %s", Strerror(errno)); |
4608196e | 2621 | return NULL; |
a687059c | 2622 | } |
a2a5de95 | 2623 | Perl_ck_warner(aTHX_ packWARN(WARN_PIPE), "Can't fork, trying again in 5 seconds"); |
a687059c LW |
2624 | sleep(5); |
2625 | } | |
2626 | if (pid == 0) { | |
79072805 LW |
2627 | GV* tmpgv; |
2628 | ||
30ac6d9b GS |
2629 | #undef THIS |
2630 | #undef THAT | |
a687059c | 2631 | #define THIS that |
8ac85365 | 2632 | #define THAT This |
e446cec8 IZ |
2633 | if (did_pipes) { |
2634 | PerlLIO_close(pp[0]); | |
2635 | #if defined(HAS_FCNTL) && defined(F_SETFD) | |
2636 | fcntl(pp[1], F_SETFD, FD_CLOEXEC); | |
2637 | #endif | |
2638 | } | |
a687059c | 2639 | if (p[THIS] != (*mode == 'r')) { |
6ad3d225 GS |
2640 | PerlLIO_dup2(p[THIS], *mode == 'r'); |
2641 | PerlLIO_close(p[THIS]); | |
b5ac89c3 NIS |
2642 | if (p[THAT] != (*mode == 'r')) /* if dup2() didn't close it */ |
2643 | PerlLIO_close(p[THAT]); | |
a687059c | 2644 | } |
b5ac89c3 NIS |
2645 | else |
2646 | PerlLIO_close(p[THAT]); | |
4435c477 | 2647 | #ifndef OS2 |
a687059c | 2648 | if (doexec) { |
a0d0e21e | 2649 | #if !defined(HAS_FCNTL) || !defined(F_SETFD) |
ae986130 LW |
2650 | #ifndef NOFILE |
2651 | #define NOFILE 20 | |
2652 | #endif | |
a080fe3d | 2653 | { |
3aed30dc | 2654 | int fd; |
a080fe3d NIS |
2655 | |
2656 | for (fd = PL_maxsysfd + 1; fd < NOFILE; fd++) | |
2657 | if (fd != pp[1]) | |
3aed30dc | 2658 | PerlLIO_close(fd); |
a080fe3d | 2659 | } |
ae986130 | 2660 | #endif |
a080fe3d NIS |
2661 | /* may or may not use the shell */ |
2662 | do_exec3(cmd, pp[1], did_pipes); | |
6ad3d225 | 2663 | PerlProc__exit(1); |
a687059c | 2664 | } |
4435c477 | 2665 | #endif /* defined OS2 */ |
713cef20 IZ |
2666 | |
2667 | #ifdef PERLIO_USING_CRLF | |
2668 | /* Since we circumvent IO layers when we manipulate low-level | |
2669 | filedescriptors directly, need to manually switch to the | |
2670 | default, binary, low-level mode; see PerlIOBuf_open(). */ | |
2671 | PerlLIO_setmode((*mode == 'r'), O_BINARY); | |
2672 | #endif | |
2673 | ||
fafc274c | 2674 | if ((tmpgv = gv_fetchpvs("$", GV_ADD|GV_NOTQUAL, SVt_PV))) { |
4d76a344 | 2675 | SvREADONLY_off(GvSV(tmpgv)); |
7766f137 | 2676 | sv_setiv(GvSV(tmpgv), PerlProc_getpid()); |
4d76a344 RGS |
2677 | SvREADONLY_on(GvSV(tmpgv)); |
2678 | } | |
2679 | #ifdef THREADS_HAVE_PIDS | |
2680 | PL_ppid = (IV)getppid(); | |
2681 | #endif | |
3280af22 | 2682 | PL_forkprocess = 0; |
ca0c25f6 | 2683 | #ifdef PERL_USES_PL_PIDSTATUS |
3280af22 | 2684 | hv_clear(PL_pidstatus); /* we have no children */ |
ca0c25f6 | 2685 | #endif |
4608196e | 2686 | return NULL; |
a687059c LW |
2687 | #undef THIS |
2688 | #undef THAT | |
2689 | } | |
b5ac89c3 | 2690 | do_execfree(); /* free any memory malloced by child on vfork */ |
e446cec8 IZ |
2691 | if (did_pipes) |
2692 | PerlLIO_close(pp[1]); | |
8ac85365 | 2693 | if (p[that] < p[This]) { |
6ad3d225 GS |
2694 | PerlLIO_dup2(p[This], p[that]); |
2695 | PerlLIO_close(p[This]); | |
8ac85365 | 2696 | p[This] = p[that]; |
62b28dd9 | 2697 | } |
b5ac89c3 NIS |
2698 | else |
2699 | PerlLIO_close(p[that]); | |
2700 | ||
3280af22 | 2701 | sv = *av_fetch(PL_fdpid,p[This],TRUE); |
862a34c6 | 2702 | SvUPGRADE(sv,SVt_IV); |
45977657 | 2703 | SvIV_set(sv, pid); |
3280af22 | 2704 | PL_forkprocess = pid; |
e446cec8 IZ |
2705 | if (did_pipes && pid > 0) { |
2706 | int errkid; | |
bb7a0f54 MHM |
2707 | unsigned n = 0; |
2708 | SSize_t n1; | |
e446cec8 IZ |
2709 | |
2710 | while (n < sizeof(int)) { | |
2711 | n1 = PerlLIO_read(pp[0], | |
2712 | (void*)(((char*)&errkid)+n), | |
2713 | (sizeof(int)) - n); | |
2714 | if (n1 <= 0) | |
2715 | break; | |
2716 | n += n1; | |
2717 | } | |
2f96c702 IZ |
2718 | PerlLIO_close(pp[0]); |
2719 | did_pipes = 0; | |
e446cec8 | 2720 | if (n) { /* Error */ |
faa466a7 | 2721 | int pid2, status; |
8c51524e | 2722 | PerlLIO_close(p[This]); |
e446cec8 | 2723 | if (n != sizeof(int)) |
cea2e8a9 | 2724 | Perl_croak(aTHX_ "panic: kid popen errno read"); |
faa466a7 RG |
2725 | do { |
2726 | pid2 = wait4pid(pid, &status, 0); | |
2727 | } while (pid2 == -1 && errno == EINTR); | |
e446cec8 | 2728 | errno = errkid; /* Propagate errno from kid */ |
4608196e | 2729 | return NULL; |
e446cec8 IZ |
2730 | } |
2731 | } | |
2732 | if (did_pipes) | |
2733 | PerlLIO_close(pp[0]); | |
8ac85365 | 2734 | return PerlIO_fdopen(p[This], mode); |
a687059c | 2735 | } |
7c0587c8 | 2736 | #else |
85ca448a | 2737 | #if defined(atarist) || defined(EPOC) |
7c0587c8 | 2738 | FILE *popen(); |
760ac839 | 2739 | PerlIO * |
cef6ea9d | 2740 | Perl_my_popen(pTHX_ const char *cmd, const char *mode) |
7c0587c8 | 2741 | { |
7918f24d | 2742 | PERL_ARGS_ASSERT_MY_POPEN; |
45bc9206 | 2743 | PERL_FLUSHALL_FOR_CHILD; |
a1d180c4 NIS |
2744 | /* Call system's popen() to get a FILE *, then import it. |
2745 | used 0 for 2nd parameter to PerlIO_importFILE; | |
2746 | apparently not used | |
2747 | */ | |
2748 | return PerlIO_importFILE(popen(cmd, mode), 0); | |
7c0587c8 | 2749 | } |
2b96b0a5 JH |
2750 | #else |
2751 | #if defined(DJGPP) | |
2752 | FILE *djgpp_popen(); | |
2753 | PerlIO * | |
cef6ea9d | 2754 | Perl_my_popen(pTHX_ const char *cmd, const char *mode) |
2b96b0a5 JH |
2755 | { |
2756 | PERL_FLUSHALL_FOR_CHILD; | |
2757 | /* Call system's popen() to get a FILE *, then import it. | |
2758 | used 0 for 2nd parameter to PerlIO_importFILE; | |
2759 | apparently not used | |
2760 | */ | |
2761 | return PerlIO_importFILE(djgpp_popen(cmd, mode), 0); | |
2762 | } | |
9c12f1e5 RGS |
2763 | #else |
2764 | #if defined(__LIBCATAMOUNT__) | |
2765 | PerlIO * | |
2766 | Perl_my_popen(pTHX_ const char *cmd, const char *mode) | |
2767 | { | |
2768 | return NULL; | |
2769 | } | |
2770 | #endif | |
2b96b0a5 | 2771 | #endif |
7c0587c8 LW |
2772 | #endif |
2773 | ||
2774 | #endif /* !DOSISH */ | |
a687059c | 2775 | |
52e18b1f GS |
2776 | /* this is called in parent before the fork() */ |
2777 | void | |
2778 | Perl_atfork_lock(void) | |
2779 | { | |
27da23d5 | 2780 | dVAR; |
3db8f154 | 2781 | #if defined(USE_ITHREADS) |
52e18b1f GS |
2782 | /* locks must be held in locking order (if any) */ |
2783 | # ifdef MYMALLOC | |
2784 | MUTEX_LOCK(&PL_malloc_mutex); | |
2785 | # endif | |
2786 | OP_REFCNT_LOCK; | |
2787 | #endif | |
2788 | } | |
2789 | ||
2790 | /* this is called in both parent and child after the fork() */ | |
2791 | void | |
2792 | Perl_atfork_unlock(void) | |
2793 | { | |
27da23d5 | 2794 | dVAR; |
3db8f154 | 2795 | #if defined(USE_ITHREADS) |
52e18b1f GS |
2796 | /* locks must be released in same order as in atfork_lock() */ |
2797 | # ifdef MYMALLOC | |
2798 | MUTEX_UNLOCK(&PL_malloc_mutex); | |
2799 | # endif | |
2800 | OP_REFCNT_UNLOCK; | |
2801 | #endif | |
2802 | } | |
2803 | ||
2804 | Pid_t | |
2805 | Perl_my_fork(void) | |
2806 | { | |
2807 | #if defined(HAS_FORK) | |
2808 | Pid_t pid; | |
3db8f154 | 2809 | #if defined(USE_ITHREADS) && !defined(HAS_PTHREAD_ATFORK) |
52e18b1f GS |
2810 | atfork_lock(); |
2811 | pid = fork(); | |
2812 | atfork_unlock(); | |
2813 | #else | |
2814 | /* atfork_lock() and atfork_unlock() are installed as pthread_atfork() | |
2815 | * handlers elsewhere in the code */ | |
2816 | pid = fork(); | |
2817 | #endif | |
2818 | return pid; | |
2819 | #else | |
2820 | /* this "canna happen" since nothing should be calling here if !HAS_FORK */ | |
2821 | Perl_croak_nocontext("fork() not available"); | |
b961a566 | 2822 | return 0; |
52e18b1f GS |
2823 | #endif /* HAS_FORK */ |
2824 | } | |
2825 | ||
748a9306 | 2826 | #ifdef DUMP_FDS |
35ff7856 | 2827 | void |
c9289b7b | 2828 | Perl_dump_fds(pTHX_ const char *const s) |
ae986130 LW |
2829 | { |
2830 | int fd; | |
c623ac67 | 2831 | Stat_t tmpstatbuf; |
ae986130 | 2832 | |
7918f24d NC |
2833 | PERL_ARGS_ASSERT_DUMP_FDS; |
2834 | ||
bf49b057 | 2835 | PerlIO_printf(Perl_debug_log,"%s", s); |
ae986130 | 2836 | for (fd = 0; fd < 32; fd++) { |
6ad3d225 | 2837 | if (PerlLIO_fstat(fd,&tmpstatbuf) >= 0) |
bf49b057 | 2838 | PerlIO_printf(Perl_debug_log," %d",fd); |
ae986130 | 2839 | } |
bf49b057 | 2840 | PerlIO_printf(Perl_debug_log,"\n"); |
27da23d5 | 2841 | return; |
ae986130 | 2842 | } |
35ff7856 | 2843 | #endif /* DUMP_FDS */ |
ae986130 | 2844 | |
fe14fcc3 | 2845 | #ifndef HAS_DUP2 |
fec02dd3 | 2846 | int |
ba106d47 | 2847 | dup2(int oldfd, int newfd) |
a687059c | 2848 | { |
a0d0e21e | 2849 | #if defined(HAS_FCNTL) && defined(F_DUPFD) |
fec02dd3 AD |
2850 | if (oldfd == newfd) |
2851 | return oldfd; | |
6ad3d225 | 2852 | PerlLIO_close(newfd); |
fec02dd3 | 2853 | return fcntl(oldfd, F_DUPFD, newfd); |
62b28dd9 | 2854 | #else |
fc36a67e | 2855 | #define DUP2_MAX_FDS 256 |
2856 | int fdtmp[DUP2_MAX_FDS]; | |
79072805 | 2857 | I32 fdx = 0; |
ae986130 LW |
2858 | int fd; |
2859 | ||
fe14fcc3 | 2860 | if (oldfd == newfd) |
fec02dd3 | 2861 | return oldfd; |
6ad3d225 | 2862 | PerlLIO_close(newfd); |
fc36a67e | 2863 | /* good enough for low fd's... */ |
6ad3d225 | 2864 | while ((fd = PerlLIO_dup(oldfd)) != newfd && fd >= 0) { |
fc36a67e | 2865 | if (fdx >= DUP2_MAX_FDS) { |
6ad3d225 | 2866 | PerlLIO_close(fd); |
fc36a67e | 2867 | fd = -1; |
2868 | break; | |
2869 | } | |
ae986130 | 2870 | fdtmp[fdx++] = fd; |
fc36a67e | 2871 | } |
ae986130 | 2872 | while (fdx > 0) |
6ad3d225 | 2873 | PerlLIO_close(fdtmp[--fdx]); |
fec02dd3 | 2874 | return fd; |
62b28dd9 | 2875 | #endif |
a687059c LW |
2876 | } |
2877 | #endif | |
2878 | ||
64ca3a65 | 2879 | #ifndef PERL_MICRO |
ff68c719 | 2880 | #ifdef HAS_SIGACTION |
2881 | ||
2882 | Sighandler_t | |
864dbfa3 | 2883 | Perl_rsignal(pTHX_ int signo, Sighandler_t handler) |
ff68c719 | 2884 | { |
27da23d5 | 2885 | dVAR; |
ff68c719 | 2886 | struct sigaction act, oact; |
2887 | ||
a10b1e10 JH |
2888 | #ifdef USE_ITHREADS |
2889 | /* only "parent" interpreter can diddle signals */ | |
2890 | if (PL_curinterp != aTHX) | |
8aad04aa | 2891 | return (Sighandler_t) SIG_ERR; |
a10b1e10 JH |
2892 | #endif |
2893 | ||
8aad04aa | 2894 | act.sa_handler = (void(*)(int))handler; |
ff68c719 | 2895 | sigemptyset(&act.sa_mask); |
2896 | act.sa_flags = 0; | |
2897 | #ifdef SA_RESTART | |
4ffa73a3 JH |
2898 | if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG) |
2899 | act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */ | |
0a8e0eff | 2900 | #endif |
358837b8 | 2901 | #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */ |
8aad04aa | 2902 | if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN) |
85264bed CS |
2903 | act.sa_flags |= SA_NOCLDWAIT; |
2904 | #endif | |
ff68c719 | 2905 | if (sigaction(signo, &act, &oact) == -1) |
8aad04aa | 2906 | return (Sighandler_t) SIG_ERR; |
ff68c719 | 2907 | else |
8aad04aa | 2908 | return (Sighandler_t) oact.sa_handler; |
ff68c719 | 2909 | } |
2910 | ||
2911 | Sighandler_t | |
864dbfa3 | 2912 | Perl_rsignal_state(pTHX_ int signo) |
ff68c719 | 2913 | { |
2914 | struct sigaction oact; | |
96a5add6 | 2915 | PERL_UNUSED_CONTEXT; |
ff68c719 | 2916 | |
2917 | if (sigaction(signo, (struct sigaction *)NULL, &oact) == -1) | |
8aad04aa | 2918 | return (Sighandler_t) SIG_ERR; |
ff68c719 | 2919 | else |
8aad04aa | 2920 | return (Sighandler_t) oact.sa_handler; |
ff68c719 | 2921 | } |
2922 | ||
2923 | int | |
864dbfa3 | 2924 | Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save) |
ff68c719 | 2925 | { |
27da23d5 | 2926 | dVAR; |
ff68c719 | 2927 | struct sigaction act; |
2928 | ||
7918f24d NC |
2929 | PERL_ARGS_ASSERT_RSIGNAL_SAVE; |
2930 | ||
a10b1e10 JH |
2931 | #ifdef USE_ITHREADS |
2932 | /* only "parent" interpreter can diddle signals */ | |
2933 | if (PL_curinterp != aTHX) | |
2934 | return -1; | |
2935 | #endif | |
2936 | ||
8aad04aa | 2937 | act.sa_handler = (void(*)(int))handler; |
ff68c719 | 2938 | sigemptyset(&act.sa_mask); |
2939 | act.sa_flags = 0; | |
2940 | #ifdef SA_RESTART | |
4ffa73a3 JH |
2941 | if (PL_signals & PERL_SIGNALS_UNSAFE_FLAG) |
2942 | act.sa_flags |= SA_RESTART; /* SVR4, 4.3+BSD */ | |
0a8e0eff | 2943 | #endif |
36b5d377 | 2944 | #if defined(SA_NOCLDWAIT) && !defined(BSDish) /* See [perl #18849] */ |
8aad04aa | 2945 | if (signo == SIGCHLD && handler == (Sighandler_t) SIG_IGN) |
85264bed CS |
2946 | act.sa_flags |= SA_NOCLDWAIT; |
2947 | #endif | |
ff68c719 | 2948 | return sigaction(signo, &act, save); |
2949 | } | |
2950 | ||
2951 | int | |
864dbfa3 | 2952 | Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save) |
ff68c719 | 2953 | { |
27da23d5 | 2954 | dVAR; |
a10b1e10 JH |
2955 | #ifdef USE_ITHREADS |
2956 | /* only "parent" interpreter can diddle signals */ | |
2957 | if (PL_curinterp != aTHX) | |
2958 | return -1; | |
2959 | #endif | |
2960 | ||
ff68c719 | 2961 | return sigaction(signo, save, (struct sigaction *)NULL); |
2962 | } | |
2963 | ||
2964 | #else /* !HAS_SIGACTION */ | |
2965 | ||
2966 | Sighandler_t | |
864dbfa3 | 2967 | Perl_rsignal(pTHX_ int signo, Sighandler_t handler) |
ff68c719 | 2968 | { |
39f1703b | 2969 | #if defined(USE_ITHREADS) && !defined(WIN32) |
a10b1e10 JH |
2970 | /* only "parent" interpreter can diddle signals */ |
2971 | if (PL_curinterp != aTHX) | |
8aad04aa | 2972 | return (Sighandler_t) SIG_ERR; |
a10b1e10 JH |
2973 | #endif |
2974 | ||
6ad3d225 | 2975 | return PerlProc_signal(signo, handler); |
ff68c719 | 2976 | } |
2977 | ||
fabdb6c0 | 2978 | static Signal_t |
4e35701f | 2979 | sig_trap(int signo) |
ff68c719 | 2980 | { |
27da23d5 JH |
2981 | dVAR; |
2982 | PL_sig_trapped++; | |
ff68c719 | 2983 | } |
2984 | ||
2985 | Sighandler_t | |
864dbfa3 | 2986 | Perl_rsignal_state(pTHX_ int signo) |
ff68c719 | 2987 | { |
27da23d5 | 2988 | dVAR; |
ff68c719 | 2989 | Sighandler_t oldsig; |
2990 | ||
39f1703b | 2991 | #if defined(USE_ITHREADS) && !defined(WIN32) |
a10b1e10 JH |
2992 | /* only "parent" interpreter can diddle signals */ |
2993 | if (PL_curinterp != aTHX) | |
8aad04aa | 2994 | return (Sighandler_t) SIG_ERR; |
a10b1e10 JH |
2995 | #endif |
2996 | ||
27da23d5 | 2997 | PL_sig_trapped = 0; |
6ad3d225 GS |
2998 | oldsig = PerlProc_signal(signo, sig_trap); |
2999 | PerlProc_signal(signo, oldsig); | |
27da23d5 | 3000 | if (PL_sig_trapped) |
3aed30dc | 3001 | PerlProc_kill(PerlProc_getpid(), signo); |
ff68c719 | 3002 | return oldsig; |
3003 | } | |
3004 | ||
3005 | int | |
864dbfa3 | 3006 | Perl_rsignal_save(pTHX_ int signo, Sighandler_t handler, Sigsave_t *save) |
ff68c719 | 3007 | { |
39f1703b | 3008 | #if defined(USE_ITHREADS) && !defined(WIN32) |
a10b1e10 JH |
3009 | /* only "parent" interpreter can diddle signals */ |
3010 | if (PL_curinterp != aTHX) | |
3011 | return -1; | |
3012 | #endif | |
6ad3d225 | 3013 | *save = PerlProc_signal(signo, handler); |
8aad04aa | 3014 | return (*save == (Sighandler_t) SIG_ERR) ? -1 : 0; |
ff68c719 | 3015 | } |
3016 | ||
3017 | int | |
864dbfa3 | 3018 | Perl_rsignal_restore(pTHX_ int signo, Sigsave_t *save) |
ff68c719 | 3019 | { |
39f1703b | 3020 | #if defined(USE_ITHREADS) && !defined(WIN32) |
a10b1e10 JH |
3021 | /* only "parent" interpreter can diddle signals */ |
3022 | if (PL_curinterp != aTHX) | |
3023 | return -1; | |
3024 | #endif | |
8aad04aa | 3025 | return (PerlProc_signal(signo, *save) == (Sighandler_t) SIG_ERR) ? -1 : 0; |
ff68c719 | 3026 | } |
3027 | ||
3028 | #endif /* !HAS_SIGACTION */ | |
64ca3a65 | 3029 | #endif /* !PERL_MICRO */ |
ff68c719 | 3030 | |
5f05dabc | 3031 | /* VMS' my_pclose() is in VMS.c; same with OS/2 */ |
e37778c2 | 3032 | #if (!defined(DOSISH) || defined(HAS_FORK) || defined(AMIGAOS)) && !defined(VMS) && !defined(__OPEN_VM) && !defined(EPOC) && !defined(__LIBCATAMOUNT__) |
79072805 | 3033 | I32 |
864dbfa3 | 3034 | Perl_my_pclose(pTHX_ PerlIO *ptr) |
a687059c | 3035 | { |
97aff369 | 3036 | dVAR; |
ff68c719 | 3037 | Sigsave_t hstat, istat, qstat; |
a687059c | 3038 | int status; |
a0d0e21e | 3039 | SV **svp; |
d8a83dd3 JH |
3040 | Pid_t pid; |
3041 | Pid_t pid2; | |
03136e13 | 3042 | bool close_failed; |
4ee39169 | 3043 | dSAVEDERRNO; |
a687059c | 3044 | |
3280af22 | 3045 | svp = av_fetch(PL_fdpid,PerlIO_fileno(ptr),TRUE); |
25d92023 | 3046 | pid = (SvTYPE(*svp) == SVt_IV) ? SvIVX(*svp) : -1; |
a0d0e21e | 3047 | SvREFCNT_dec(*svp); |
3280af22 | 3048 | *svp = &PL_sv_undef; |
ddcf38b7 IZ |
3049 | #ifdef OS2 |
3050 | if (pid == -1) { /* Opened by popen. */ | |
3051 | return my_syspclose(ptr); | |
3052 | } | |
a1d180c4 | 3053 | #endif |
f1618b10 CS |
3054 | close_failed = (PerlIO_close(ptr) == EOF); |
3055 | SAVE_ERRNO; | |
7c0587c8 | 3056 | #ifdef UTS |
6ad3d225 | 3057 | if(PerlProc_kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */ |
7c0587c8 | 3058 | #endif |
64ca3a65 | 3059 | #ifndef PERL_MICRO |
8aad04aa JH |
3060 | rsignal_save(SIGHUP, (Sighandler_t) SIG_IGN, &hstat); |
3061 | rsignal_save(SIGINT, (Sighandler_t) SIG_IGN, &istat); | |
3062 | rsignal_save(SIGQUIT, (Sighandler_t) SIG_IGN, &qstat); | |
64ca3a65 | 3063 | #endif |
748a9306 | 3064 | do { |
1d3434b8 GS |
3065 | pid2 = wait4pid(pid, &status, 0); |
3066 | } while (pid2 == -1 && errno == EINTR); | |
64ca3a65 | 3067 | #ifndef PERL_MICRO |
ff68c719 | 3068 | rsignal_restore(SIGHUP, &hstat); |
3069 | rsignal_restore(SIGINT, &istat); | |
3070 | rsignal_restore(SIGQUIT, &qstat); | |
64ca3a65 | 3071 | #endif |
03136e13 | 3072 | if (close_failed) { |
4ee39169 | 3073 | RESTORE_ERRNO; |
03136e13 CS |
3074 | return -1; |
3075 | } | |
1d3434b8 | 3076 | return(pid2 < 0 ? pid2 : status == 0 ? 0 : (errno = 0, status)); |
20188a90 | 3077 | } |
9c12f1e5 RGS |
3078 | #else |
3079 | #if defined(__LIBCATAMOUNT__) | |
3080 | I32 | |
3081 | Perl_my_pclose(pTHX_ PerlIO *ptr) | |
3082 | { | |
3083 | return -1; | |
3084 | } | |
3085 | #endif | |
4633a7c4 LW |
3086 | #endif /* !DOSISH */ |
3087 | ||
e37778c2 | 3088 | #if (!defined(DOSISH) || defined(OS2) || defined(WIN32) || defined(NETWARE)) && !defined(__LIBCATAMOUNT__) |
79072805 | 3089 | I32 |
d8a83dd3 | 3090 | Perl_wait4pid(pTHX_ Pid_t pid, int *statusp, int flags) |
20188a90 | 3091 | { |
97aff369 | 3092 | dVAR; |
27da23d5 | 3093 | I32 result = 0; |
7918f24d | 3094 | PERL_ARGS_ASSERT_WAIT4PID; |
b7953727 JH |
3095 | if (!pid) |
3096 | return -1; | |
ca0c25f6 | 3097 | #ifdef PERL_USES_PL_PIDSTATUS |
b7953727 | 3098 | { |
3aed30dc | 3099 | if (pid > 0) { |
12072db5 NC |
3100 | /* The keys in PL_pidstatus are now the raw 4 (or 8) bytes of the |
3101 | pid, rather than a string form. */ | |
c4420975 | 3102 | SV * const * const svp = hv_fetch(PL_pidstatus,(const char*) &pid,sizeof(Pid_t),FALSE); |
3aed30dc HS |
3103 | if (svp && *svp != &PL_sv_undef) { |
3104 | *statusp = SvIVX(*svp); | |
12072db5 NC |
3105 | (void)hv_delete(PL_pidstatus,(const char*) &pid,sizeof(Pid_t), |
3106 | G_DISCARD); | |
3aed30dc HS |
3107 | return pid; |
3108 | } | |
3109 | } | |
3110 | else { | |
3111 | HE *entry; | |
3112 | ||
3113 | hv_iterinit(PL_pidstatus); | |
3114 | if ((entry = hv_iternext(PL_pidstatus))) { | |
c4420975 | 3115 | SV * const sv = hv_iterval(PL_pidstatus,entry); |
7ea75b61 | 3116 | I32 len; |
0bcc34c2 | 3117 | const char * const spid = hv_iterkey(entry,&len); |
27da23d5 | 3118 | |
12072db5 NC |
3119 | assert (len == sizeof(Pid_t)); |
3120 | memcpy((char *)&pid, spid, len); | |
3aed30dc | 3121 | *statusp = SvIVX(sv); |
7b9a3241 NC |
3122 | /* The hash iterator is currently on this entry, so simply |
3123 | calling hv_delete would trigger the lazy delete, which on | |
3124 | aggregate does more work, beacuse next call to hv_iterinit() | |
3125 | would spot the flag, and have to call the delete routine, | |
3126 | while in the meantime any new entries can't re-use that | |
3127 | memory. */ | |
3128 | hv_iterinit(PL_pidstatus); | |
7ea75b61 | 3129 | (void)hv_delete(PL_pidstatus,spid,len,G_DISCARD); |
3aed30dc HS |
3130 | return pid; |
3131 | } | |
20188a90 LW |
3132 | } |
3133 | } | |
68a29c53 | 3134 | #endif |
79072805 | 3135 | #ifdef HAS_WAITPID |
367f3c24 IZ |
3136 | # ifdef HAS_WAITPID_RUNTIME |
3137 | if (!HAS_WAITPID_RUNTIME) | |
3138 | goto hard_way; | |
3139 | # endif | |
cddd4526 | 3140 | result = PerlProc_waitpid(pid,statusp,flags); |
dfcfdb64 | 3141 | goto finish; |
367f3c24 IZ |
3142 | #endif |
3143 | #if !defined(HAS_WAITPID) && defined(HAS_WAIT4) | |
4608196e | 3144 | result = wait4((pid==-1)?0:pid,statusp,flags,NULL); |
dfcfdb64 | 3145 | goto finish; |
367f3c24 | 3146 | #endif |
ca0c25f6 | 3147 | #ifdef PERL_USES_PL_PIDSTATUS |
27da23d5 | 3148 | #if defined(HAS_WAITPID) && defined(HAS_WAITPID_RUNTIME) |
367f3c24 | 3149 | hard_way: |
27da23d5 | 3150 | #endif |
a0d0e21e | 3151 | { |
a0d0e21e | 3152 | if (flags) |
cea2e8a9 | 3153 | Perl_croak(aTHX_ "Can't do waitpid with flags"); |
a0d0e21e | 3154 | else { |
76e3520e | 3155 | while ((result = PerlProc_wait(statusp)) != pid && pid > 0 && result >= 0) |
a0d0e21e LW |
3156 | pidgone(result,*statusp); |
3157 | if (result < 0) | |
3158 | *statusp = -1; | |
3159 | } | |
a687059c LW |
3160 | } |
3161 | #endif | |
27da23d5 | 3162 | #if defined(HAS_WAITPID) || defined(HAS_WAIT4) |
dfcfdb64 | 3163 | finish: |
27da23d5 | 3164 | #endif |
cddd4526 NIS |
3165 | if (result < 0 && errno == EINTR) { |
3166 | PERL_ASYNC_CHECK(); | |
48dbb59e | 3167 | errno = EINTR; /* reset in case a signal handler changed $! */ |
cddd4526 NIS |
3168 | } |
3169 | return result; | |
a687059c | 3170 | } |
2986a63f | 3171 | #endif /* !DOSISH || OS2 || WIN32 || NETWARE */ |
a687059c | 3172 | |
ca0c25f6 | 3173 | #ifdef PERL_USES_PL_PIDSTATUS |
7c0587c8 | 3174 | void |
ed4173ef | 3175 | S_pidgone(pTHX_ Pid_t pid, int status) |
a687059c | 3176 | { |
79072805 | 3177 | register SV *sv; |
a687059c | 3178 | |
12072db5 | 3179 | sv = *hv_fetch(PL_pidstatus,(const char*)&pid,sizeof(Pid_t),TRUE); |
862a34c6 | 3180 | SvUPGRADE(sv,SVt_IV); |
45977657 | 3181 | SvIV_set(sv, status); |
20188a90 | 3182 | return; |
a687059c | 3183 | } |
ca0c25f6 | 3184 | #endif |
a687059c | 3185 | |
85ca448a | 3186 | #if defined(atarist) || defined(OS2) || defined(EPOC) |
7c0587c8 | 3187 | int pclose(); |
ddcf38b7 IZ |
3188 | #ifdef HAS_FORK |
3189 | int /* Cannot prototype with I32 | |
3190 | in os2ish.h. */ | |
ba106d47 | 3191 | my_syspclose(PerlIO *ptr) |
ddcf38b7 | 3192 | #else |
79072805 | 3193 | I32 |
864dbfa3 | 3194 | Perl_my_pclose(pTHX_ PerlIO *ptr) |
a1d180c4 | 3195 | #endif |
a687059c | 3196 | { |
760ac839 | 3197 | /* Needs work for PerlIO ! */ |
c4420975 | 3198 | FILE * const f = PerlIO_findFILE(ptr); |
7452cf6a | 3199 | const I32 result = pclose(f); |
2b96b0a5 JH |
3200 | PerlIO_releaseFILE(ptr,f); |
3201 | return result; | |
3202 | } | |
3203 | #endif | |
3204 | ||
933fea7f | 3205 | #if defined(DJGPP) |
2b96b0a5 JH |
3206 | int djgpp_pclose(); |
3207 | I32 | |
3208 | Perl_my_pclose(pTHX_ PerlIO *ptr) | |
3209 | { | |
3210 | /* Needs work for PerlIO ! */ | |
c4420975 | 3211 | FILE * const f = PerlIO_findFILE(ptr); |
2b96b0a5 | 3212 | I32 result = djgpp_pclose(f); |
933fea7f | 3213 | result = (result << 8) & 0xff00; |
760ac839 LW |
3214 | PerlIO_releaseFILE(ptr,f); |
3215 | return result; | |
a687059c | 3216 | } |
7c0587c8 | 3217 | #endif |
9f68db38 | 3218 | |
16fa5c11 | 3219 | #define PERL_REPEATCPY_LINEAR 4 |
9f68db38 | 3220 | void |
16fa5c11 | 3221 | Perl_repeatcpy(register char *to, register const char *from, I32 len, register I32 count) |
9f68db38 | 3222 | { |
7918f24d NC |
3223 | PERL_ARGS_ASSERT_REPEATCPY; |
3224 | ||
16fa5c11 VP |
3225 | if (len == 1) |
3226 | memset(to, *from, count); | |
3227 | else if (count) { | |
3228 | register char *p = to; | |
3229 | I32 items, linear, half; | |
3230 | ||
3231 | linear = count < PERL_REPEATCPY_LINEAR ? count : PERL_REPEATCPY_LINEAR; | |
3232 | for (items = 0; items < linear; ++items) { | |
3233 | register const char *q = from; | |
3234 | I32 todo; | |
3235 | for (todo = len; todo > 0; todo--) | |
3236 | *p++ = *q++; | |
3237 | } | |
3238 | ||
3239 | half = count / 2; | |
3240 | while (items <= half) { | |
3241 | I32 size = items * len; | |
3242 | memcpy(p, to, size); | |
3243 | p += size; | |
3244 | items *= 2; | |
9f68db38 | 3245 | } |
16fa5c11 VP |
3246 | |
3247 | if (count > items) | |
3248 | memcpy(p, to, (count - items) * len); | |
9f68db38 LW |
3249 | } |
3250 | } | |
0f85fab0 | 3251 | |
fe14fcc3 | 3252 | #ifndef HAS_RENAME |
79072805 | 3253 | I32 |
4373e329 | 3254 | Perl_same_dirent(pTHX_ const char *a, const char *b) |
62b28dd9 | 3255 | { |
93a17b20 LW |
3256 | char *fa = strrchr(a,'/'); |
3257 | char *fb = strrchr(b,'/'); | |
c623ac67 GS |
3258 | Stat_t tmpstatbuf1; |
3259 | Stat_t tmpstatbuf2; | |
c4420975 | 3260 | SV * const tmpsv = sv_newmortal(); |
62b28dd9 | 3261 | |
7918f24d NC |
3262 | PERL_ARGS_ASSERT_SAME_DIRENT; |
3263 | ||
62b28dd9 LW |
3264 | if (fa) |
3265 | fa++; | |
3266 | else | |
3267 | fa = a; | |
3268 | if (fb) | |
3269 | fb++; | |
3270 | else | |
3271 | fb = b; | |
3272 | if (strNE(a,b)) | |
3273 | return FALSE; | |
3274 | if (fa == a) | |
76f68e9b | 3275 | sv_setpvs(tmpsv, "."); |
62b28dd9 | 3276 | else |
46fc3d4c | 3277 | sv_setpvn(tmpsv, a, fa - a); |
95a20fc0 | 3278 | if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf1) < 0) |
62b28dd9 LW |
3279 | return FALSE; |
3280 | if (fb == b) | |
76f68e9b | 3281 | sv_setpvs(tmpsv, "."); |
62b28dd9 | 3282 | else |
46fc3d4c | 3283 | sv_setpvn(tmpsv, b, fb - b); |
95a20fc0 | 3284 | if (PerlLIO_stat(SvPVX_const(tmpsv), &tmpstatbuf2) < 0) |
62b28dd9 LW |
3285 | return FALSE; |
3286 | return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev && | |
3287 | tmpstatbuf1.st_ino == tmpstatbuf2.st_ino; | |
3288 | } | |
fe14fcc3 LW |
3289 | #endif /* !HAS_RENAME */ |
3290 | ||
491527d0 | 3291 | char* |
7f315aed NC |
3292 | Perl_find_script(pTHX_ const char *scriptname, bool dosearch, |
3293 | const char *const *const search_ext, I32 flags) | |
491527d0 | 3294 | { |
97aff369 | 3295 | dVAR; |
bd61b366 SS |
3296 | const char *xfound = NULL; |
3297 | char *xfailed = NULL; | |
0f31cffe | 3298 | char tmpbuf[MAXPATHLEN]; |
491527d0 | 3299 | register char *s; |
5f74f29c | 3300 | I32 len = 0; |
491527d0 | 3301 | int retval; |
39a02377 | 3302 | char *bufend; |
491527d0 GS |
3303 | #if defined(DOSISH) && !defined(OS2) && !defined(atarist) |
3304 | # define SEARCH_EXTS ".bat", ".cmd", NULL | |
3305 | # define MAX_EXT_LEN 4 | |
3306 | #endif | |
3307 | #ifdef OS2 | |
3308 | # define SEARCH_EXTS ".cmd", ".btm", ".bat", ".pl", NULL | |
3309 | # define MAX_EXT_LEN 4 | |
3310 | #endif | |
3311 | #ifdef VMS | |
3312 | # define SEARCH_EXTS ".pl", ".com", NULL | |
3313 | # define MAX_EXT_LEN 4 | |
3314 | #endif | |
3315 | /* additional extensions to try in each dir if scriptname not found */ | |
3316 | #ifdef SEARCH_EXTS | |
0bcc34c2 | 3317 | static const char *const exts[] = { SEARCH_EXTS }; |
7f315aed | 3318 | const char *const *const ext = search_ext ? search_ext : exts; |
491527d0 | 3319 | int extidx = 0, i = 0; |
bd61b366 | 3320 | const char *curext = NULL; |
491527d0 | 3321 | #else |
53c1dcc0 | 3322 | PERL_UNUSED_ARG(search_ext); |
491527d0 GS |
3323 | # define MAX_EXT_LEN 0 |
3324 | #endif | |
3325 | ||
7918f24d NC |
3326 | PERL_ARGS_ASSERT_FIND_SCRIPT; |
3327 | ||
491527d0 GS |
3328 | /* |
3329 | * If dosearch is true and if scriptname does not contain path | |
3330 | * delimiters, search the PATH for scriptname. | |
3331 | * | |
3332 | * If SEARCH_EXTS is also defined, will look for each | |
3333 | * scriptname{SEARCH_EXTS} whenever scriptname is not found | |
3334 | * while searching the PATH. | |
3335 | * | |
3336 | * Assuming SEARCH_EXTS is C<".foo",".bar",NULL>, PATH search | |
3337 | * proceeds as follows: | |
3338 | * If DOSISH or VMSISH: | |
3339 | * + look for ./scriptname{,.foo,.bar} | |
3340 | * + search the PATH for scriptname{,.foo,.bar} | |
3341 | * | |
3342 | * If !DOSISH: | |
3343 | * + look *only* in the PATH for scriptname{,.foo,.bar} (note | |
3344 | * this will not look in '.' if it's not in the PATH) | |
3345 | */ | |
84486fc6 | 3346 | tmpbuf[0] = '\0'; |
491527d0 GS |
3347 | |
3348 | #ifdef VMS | |
3349 | # ifdef ALWAYS_DEFTYPES | |
3350 | len = strlen(scriptname); | |
3351 | if (!(len == 1 && *scriptname == '-') && scriptname[len-1] != ':') { | |
c4420975 | 3352 | int idx = 0, deftypes = 1; |
491527d0 GS |
3353 | bool seen_dot = 1; |
3354 | ||
bd61b366 | 3355 | const int hasdir = !dosearch || (strpbrk(scriptname,":[</") != NULL); |
491527d0 GS |
3356 | # else |
3357 | if (dosearch) { | |
c4420975 | 3358 | int idx = 0, deftypes = 1; |
491527d0 GS |
3359 | bool seen_dot = 1; |
3360 | ||
bd61b366 | 3361 | const int hasdir = (strpbrk(scriptname,":[</") != NULL); |
491527d0 GS |
3362 | # endif |
3363 | /* The first time through, just add SEARCH_EXTS to whatever we | |
3364 | * already have, so we can check for default file types. */ | |
3365 | while (deftypes || | |
84486fc6 | 3366 | (!hasdir && my_trnlnm("DCL$PATH",tmpbuf,idx++)) ) |
491527d0 GS |
3367 | { |
3368 | if (deftypes) { | |
3369 | deftypes = 0; | |
84486fc6 | 3370 | *tmpbuf = '\0'; |
491527d0 | 3371 | } |
84486fc6 GS |
3372 | if ((strlen(tmpbuf) + strlen(scriptname) |
3373 | + MAX_EXT_LEN) >= sizeof tmpbuf) | |
491527d0 | 3374 | continue; /* don't search dir with too-long name */ |
6fca0082 | 3375 | my_strlcat(tmpbuf, scriptname, sizeof(tmpbuf)); |
491527d0 GS |
3376 | #else /* !VMS */ |
3377 | ||
3378 | #ifdef DOSISH | |
3379 | if (strEQ(scriptname, "-")) | |
3380 | dosearch = 0; | |
3381 | if (dosearch) { /* Look in '.' first. */ | |
fe2774ed | 3382 | const char *cur = scriptname; |
491527d0 GS |
3383 | #ifdef SEARCH_EXTS |
3384 | if ((curext = strrchr(scriptname,'.'))) /* possible current ext */ | |
3385 | while (ext[i]) | |
3386 | if (strEQ(ext[i++],curext)) { | |
3387 | extidx = -1; /* already has an ext */ | |
3388 | break; | |
3389 | } | |
3390 | do { | |
3391 | #endif | |
3392 | DEBUG_p(PerlIO_printf(Perl_debug_log, | |
3393 | "Looking for %s\n",cur)); | |
017f25f1 IZ |
3394 | if (PerlLIO_stat(cur,&PL_statbuf) >= 0 |
3395 | && !S_ISDIR(PL_statbuf.st_mode)) { | |
491527d0 GS |
3396 | dosearch = 0; |
3397 | scriptname = cur; | |
3398 | #ifdef SEARCH_EXTS | |
3399 | break; | |
3400 | #endif | |
3401 | } | |
3402 | #ifdef SEARCH_EXTS | |
3403 | if (cur == scriptname) { | |
3404 | len = strlen(scriptname); | |
84486fc6 | 3405 | if (len+MAX_EXT_LEN+1 >= sizeof(tmpbuf)) |
491527d0 | 3406 | break; |
9e4425f7 SH |
3407 | my_strlcpy(tmpbuf, scriptname, sizeof(tmpbuf)); |
3408 | cur = tmpbuf; | |
491527d0 GS |
3409 | } |
3410 | } while (extidx >= 0 && ext[extidx] /* try an extension? */ | |
6fca0082 | 3411 | && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len)); |
491527d0 GS |
3412 | #endif |
3413 | } | |
3414 | #endif | |
3415 | ||
3416 | if (dosearch && !strchr(scriptname, '/') | |
3417 | #ifdef DOSISH | |
3418 | && !strchr(scriptname, '\\') | |
3419 | #endif | |
cd39f2b6 | 3420 | && (s = PerlEnv_getenv("PATH"))) |
cd39f2b6 | 3421 | { |
491527d0 | 3422 | bool seen_dot = 0; |
92f0c265 | 3423 | |
39a02377 DM |
3424 | bufend = s + strlen(s); |
3425 | while (s < bufend) { | |
491527d0 GS |
3426 | #if defined(atarist) || defined(DOSISH) |
3427 | for (len = 0; *s | |
3428 | # ifdef atarist | |
3429 | && *s != ',' | |
3430 | # endif | |
3431 | && *s != ';'; len++, s++) { | |
84486fc6 GS |
3432 | if (len < sizeof tmpbuf) |
3433 | tmpbuf[len] = *s; | |
491527d0 | 3434 | } |
84486fc6 GS |
3435 | if (len < sizeof tmpbuf) |
3436 | tmpbuf[len] = '\0'; | |
491527d0 | 3437 | #else /* ! (atarist || DOSISH) */ |
39a02377 | 3438 | s = delimcpy(tmpbuf, tmpbuf + sizeof tmpbuf, s, bufend, |
491527d0 GS |
3439 | ':', |
3440 | &len); | |
3441 | #endif /* ! (atarist || DOSISH) */ | |
39a02377 | 3442 | if (s < bufend) |
491527d0 | 3443 | s++; |
84486fc6 | 3444 | if (len + 1 + strlen(scriptname) + MAX_EXT_LEN >= sizeof tmpbuf) |
491527d0 GS |
3445 | continue; /* don't search dir with too-long name */ |
3446 | if (len | |
cd86ed9d | 3447 | # if defined(atarist) || defined(DOSISH) |
84486fc6 GS |
3448 | && tmpbuf[len - 1] != '/' |
3449 | && tmpbuf[len - 1] != '\\' | |
490a0e98 | 3450 | # endif |
491527d0 | 3451 | ) |
84486fc6 GS |
3452 | tmpbuf[len++] = '/'; |
3453 | if (len == 2 && tmpbuf[0] == '.') | |
491527d0 | 3454 | seen_dot = 1; |
28f0d0ec | 3455 | (void)my_strlcpy(tmpbuf + len, scriptname, sizeof(tmpbuf) - len); |
491527d0 GS |
3456 | #endif /* !VMS */ |
3457 | ||
3458 | #ifdef SEARCH_EXTS | |
84486fc6 | 3459 | len = strlen(tmpbuf); |
491527d0 GS |
3460 | if (extidx > 0) /* reset after previous loop */ |
3461 | extidx = 0; | |
3462 | do { | |
3463 | #endif | |
84486fc6 | 3464 | DEBUG_p(PerlIO_printf(Perl_debug_log, "Looking for %s\n",tmpbuf)); |
3280af22 | 3465 | retval = PerlLIO_stat(tmpbuf,&PL_statbuf); |
017f25f1 IZ |
3466 | if (S_ISDIR(PL_statbuf.st_mode)) { |
3467 | retval = -1; | |
3468 | } | |
491527d0 GS |
3469 | #ifdef SEARCH_EXTS |
3470 | } while ( retval < 0 /* not there */ | |
3471 | && extidx>=0 && ext[extidx] /* try an extension? */ | |
6fca0082 | 3472 | && my_strlcpy(tmpbuf+len, ext[extidx++], sizeof(tmpbuf) - len) |
491527d0 GS |
3473 | ); |
3474 | #endif | |
3475 | if (retval < 0) | |
3476 | continue; | |
3280af22 NIS |
3477 | if (S_ISREG(PL_statbuf.st_mode) |
3478 | && cando(S_IRUSR,TRUE,&PL_statbuf) | |
e37778c2 | 3479 | #if !defined(DOSISH) |
3280af22 | 3480 | && cando(S_IXUSR,TRUE,&PL_statbuf) |
491527d0 GS |
3481 | #endif |
3482 | ) | |
3483 | { | |
3aed30dc | 3484 | xfound = tmpbuf; /* bingo! */ |
491527d0 GS |
3485 | break; |
3486 | } | |
3487 | if (!xfailed) | |
84486fc6 | 3488 | xfailed = savepv(tmpbuf); |
491527d0 GS |
3489 | } |
3490 | #ifndef DOSISH | |
017f25f1 | 3491 | if (!xfound && !seen_dot && !xfailed && |
a1d180c4 | 3492 | (PerlLIO_stat(scriptname,&PL_statbuf) < 0 |
017f25f1 | 3493 | || S_ISDIR(PL_statbuf.st_mode))) |
491527d0 GS |
3494 | #endif |
3495 | seen_dot = 1; /* Disable message. */ | |
9ccb31f9 GS |
3496 | if (!xfound) { |
3497 | if (flags & 1) { /* do or die? */ | |
3aed30dc | 3498 | Perl_croak(aTHX_ "Can't %s %s%s%s", |
9ccb31f9 GS |
3499 | (xfailed ? "execute" : "find"), |
3500 | (xfailed ? xfailed : scriptname), | |
3501 | (xfailed ? "" : " on PATH"), | |
3502 | (xfailed || seen_dot) ? "" : ", '.' not in PATH"); | |
3503 | } | |
bd61b366 | 3504 | scriptname = NULL; |
9ccb31f9 | 3505 | } |
43c5f42d | 3506 | Safefree(xfailed); |
491527d0 GS |
3507 | scriptname = xfound; |
3508 | } | |
bd61b366 | 3509 | return (scriptname ? savepv(scriptname) : NULL); |
491527d0 GS |
3510 | } |
3511 | ||
ba869deb GS |
3512 | #ifndef PERL_GET_CONTEXT_DEFINED |
3513 | ||
3514 | void * | |
3515 | Perl_get_context(void) | |
3516 | { | |
27da23d5 | 3517 | dVAR; |
3db8f154 | 3518 | #if defined(USE_ITHREADS) |
ba869deb GS |
3519 | # ifdef OLD_PTHREADS_API |
3520 | pthread_addr_t t; | |
3521 | if (pthread_getspecific(PL_thr_key, &t)) | |
3522 | Perl_croak_nocontext("panic: pthread_getspecific"); | |
3523 | return (void*)t; | |
3524 | # else | |
bce813aa | 3525 | # ifdef I_MACH_CTHREADS |
8b8b35ab | 3526 | return (void*)cthread_data(cthread_self()); |
bce813aa | 3527 | # else |
8b8b35ab JH |
3528 | return (void*)PTHREAD_GETSPECIFIC(PL_thr_key); |
3529 | # endif | |
c44d3fdb | 3530 | # endif |
ba869deb GS |
3531 | #else |
3532 | return (void*)NULL; | |
3533 | #endif | |
3534 | } | |
3535 | ||
3536 | void | |
3537 | Perl_set_context(void *t) | |
3538 | { | |
8772537c | 3539 | dVAR; |
7918f24d | 3540 | PERL_ARGS_ASSERT_SET_CONTEXT; |
3db8f154 | 3541 | #if defined(USE_ITHREADS) |
c44d3fdb GS |
3542 | # ifdef I_MACH_CTHREADS |
3543 | cthread_set_data(cthread_self(), t); | |
3544 | # else | |
ba869deb GS |
3545 | if (pthread_setspecific(PL_thr_key, t)) |
3546 | Perl_croak_nocontext("panic: pthread_setspecific"); | |
c44d3fdb | 3547 | # endif |
b464bac0 | 3548 | #else |
8772537c | 3549 | PERL_UNUSED_ARG(t); |
ba869deb GS |
3550 | #endif |
3551 | } | |
3552 | ||
3553 | #endif /* !PERL_GET_CONTEXT_DEFINED */ | |
491527d0 | 3554 | |
27da23d5 | 3555 | #if defined(PERL_GLOBAL_STRUCT) && !defined(PERL_GLOBAL_STRUCT_PRIVATE) |
22239a37 | 3556 | struct perl_vars * |
864dbfa3 | 3557 | Perl_GetVars(pTHX) |
22239a37 | 3558 | { |
533c011a | 3559 | return &PL_Vars; |
22239a37 | 3560 | } |
31fb1209 NIS |
3561 | #endif |
3562 | ||
1cb0ed9b | 3563 | char ** |
864dbfa3 | 3564 | Perl_get_op_names(pTHX) |
31fb1209 | 3565 | { |
96a5add6 AL |
3566 | PERL_UNUSED_CONTEXT; |
3567 | return (char **)PL_op_name; | |
31fb1209 NIS |
3568 | } |
3569 | ||
1cb0ed9b | 3570 | char ** |
864dbfa3 | 3571 | Perl_get_op_descs(pTHX) |
31fb1209 | 3572 | { |
96a5add6 AL |
3573 | PERL_UNUSED_CONTEXT; |
3574 | return (char **)PL_op_desc; | |
31fb1209 | 3575 | } |
9e6b2b00 | 3576 | |
e1ec3a88 | 3577 | const char * |
864dbfa3 | 3578 | Perl_get_no_modify(pTHX) |
9e6b2b00 | 3579 | { |
96a5add6 AL |
3580 | PERL_UNUSED_CONTEXT; |
3581 | return PL_no_modify; | |
9e6b2b00 GS |
3582 | } |
3583 | ||
3584 | U32 * | |
864dbfa3 | 3585 | Perl_get_opargs(pTHX) |
9e6b2b00 | 3586 | { |
96a5add6 AL |
3587 | PERL_UNUSED_CONTEXT; |
3588 | return (U32 *)PL_opargs; | |
9e6b2b00 | 3589 | } |
51aa15f3 | 3590 | |
0cb96387 GS |
3591 | PPADDR_t* |
3592 | Perl_get_ppaddr(pTHX) | |
3593 | { | |
96a5add6 AL |
3594 | dVAR; |
3595 | PERL_UNUSED_CONTEXT; | |
3596 | return (PPADDR_t*)PL_ppaddr; | |
0cb96387 GS |
3597 | } |
3598 | ||
a6c40364 GS |
3599 | #ifndef HAS_GETENV_LEN |
3600 | char * | |
bf4acbe4 | 3601 | Perl_getenv_len(pTHX_ const char *env_elem, unsigned long *len) |
a6c40364 | 3602 | { |
8772537c | 3603 | char * const env_trans = PerlEnv_getenv(env_elem); |
96a5add6 | 3604 | PERL_UNUSED_CONTEXT; |
7918f24d | 3605 | PERL_ARGS_ASSERT_GETENV_LEN; |
a6c40364 GS |
3606 | if (env_trans) |
3607 | *len = strlen(env_trans); | |
3608 | return env_trans; | |
f675dbe5 CB |
3609 | } |
3610 | #endif | |
3611 | ||
dc9e4912 GS |
3612 | |
3613 | MGVTBL* | |
864dbfa3 | 3614 | Perl_get_vtbl(pTHX_ int vtbl_id) |
dc9e4912 | 3615 | { |
7452cf6a | 3616 | const MGVTBL* result; |
96a5add6 | 3617 | PERL_UNUSED_CONTEXT; |
dc9e4912 GS |
3618 | |
3619 | switch(vtbl_id) { | |
3620 | case want_vtbl_sv: | |
3621 | result = &PL_vtbl_sv; | |
3622 | break; | |
3623 | case want_vtbl_env: | |
3624 | result = &PL_vtbl_env; | |
3625 | break; | |
3626 | case want_vtbl_envelem: | |
3627 | result = &PL_vtbl_envelem; | |
3628 | break; | |
3629 | case want_vtbl_sig: | |
3630 | result = &PL_vtbl_sig; | |
3631 | break; | |
3632 | case want_vtbl_sigelem: | |
3633 | result = &PL_vtbl_sigelem; | |
3634 | break; | |
3635 | case want_vtbl_pack: | |
3636 | result = &PL_vtbl_pack; | |
3637 | break; | |
3638 | case want_vtbl_packelem: | |
3639 | result = &PL_vtbl_packelem; | |
3640 | break; | |
3641 | case want_vtbl_dbline: | |
3642 | result = &PL_vtbl_dbline; | |
3643 | break; | |
3644 | case want_vtbl_isa: | |
3645 | result = &PL_vtbl_isa; | |
3646 | break; | |
3647 | case want_vtbl_isaelem: | |
3648 | result = &PL_vtbl_isaelem; | |
3649 | break; | |
3650 | case want_vtbl_arylen: | |
3651 | result = &PL_vtbl_arylen; | |
3652 | break; | |
dc9e4912 GS |
3653 | case want_vtbl_mglob: |
3654 | result = &PL_vtbl_mglob; | |
3655 | break; | |
3656 | case want_vtbl_nkeys: | |
3657 | result = &PL_vtbl_nkeys; | |
3658 | break; | |
3659 | case want_vtbl_taint: | |
3660 | result = &PL_vtbl_taint; | |
3661 | break; | |
3662 | case want_vtbl_substr: | |
3663 | result = &PL_vtbl_substr; | |
3664 | break; | |
3665 | case want_vtbl_vec: | |
3666 | result = &PL_vtbl_vec; | |
3667 | break; | |
3668 | case want_vtbl_pos: | |
3669 | result = &PL_vtbl_pos; | |
3670 | break; | |
3671 | case want_vtbl_bm: | |
3672 | result = &PL_vtbl_bm; | |
3673 | break; | |
3674 | case want_vtbl_fm: | |
3675 | result = &PL_vtbl_fm; | |
3676 | break; | |
3677 | case want_vtbl_uvar: | |
3678 | result = &PL_vtbl_uvar; | |
3679 | break; | |
dc9e4912 GS |
3680 | case want_vtbl_defelem: |
3681 | result = &PL_vtbl_defelem; | |
3682 | break; | |
3683 | case want_vtbl_regexp: | |
3684 | result = &PL_vtbl_regexp; | |
3685 | break; | |
3686 | case want_vtbl_regdata: | |
3687 | result = &PL_vtbl_regdata; | |
3688 | break; | |
3689 | case want_vtbl_regdatum: | |
3690 | result = &PL_vtbl_regdatum; | |
3691 | break; | |
3c90161d | 3692 | #ifdef USE_LOCALE_COLLATE |
dc9e4912 GS |
3693 | case want_vtbl_collxfrm: |
3694 | result = &PL_vtbl_collxfrm; | |
3695 | break; | |
3c90161d | 3696 | #endif |
dc9e4912 GS |
3697 | case want_vtbl_amagic: |
3698 | result = &PL_vtbl_amagic; | |
3699 | break; | |
3700 | case want_vtbl_amagicelem: | |
3701 | result = &PL_vtbl_amagicelem; | |
3702 | break; | |
810b8aa5 GS |
3703 | case want_vtbl_backref: |
3704 | result = &PL_vtbl_backref; | |
3705 | break; | |
7e8c5dac HS |
3706 | case want_vtbl_utf8: |
3707 | result = &PL_vtbl_utf8; | |
3708 | break; | |
7452cf6a | 3709 | default: |
4608196e | 3710 | result = NULL; |
7452cf6a | 3711 | break; |
dc9e4912 | 3712 | } |
27da23d5 | 3713 | return (MGVTBL*)result; |
dc9e4912 GS |
3714 | } |
3715 | ||
767df6a1 | 3716 | I32 |
864dbfa3 | 3717 | Perl_my_fflush_all(pTHX) |
767df6a1 | 3718 | { |
f800e14d | 3719 | #if defined(USE_PERLIO) || defined(FFLUSH_NULL) || defined(USE_SFIO) |
ce720889 | 3720 | return PerlIO_flush(NULL); |
767df6a1 | 3721 | #else |
8fbdfb7c | 3722 | # if defined(HAS__FWALK) |
f13a2bc0 | 3723 | extern int fflush(FILE *); |
74cac757 JH |
3724 | /* undocumented, unprototyped, but very useful BSDism */ |
3725 | extern void _fwalk(int (*)(FILE *)); | |
8fbdfb7c | 3726 | _fwalk(&fflush); |
74cac757 | 3727 | return 0; |
8fa7f367 | 3728 | # else |
8fbdfb7c | 3729 | # if defined(FFLUSH_ALL) && defined(HAS_STDIO_STREAM_ARRAY) |
8fa7f367 | 3730 | long open_max = -1; |
8fbdfb7c | 3731 | # ifdef PERL_FFLUSH_ALL_FOPEN_MAX |
d2201af2 | 3732 | open_max = PERL_FFLUSH_ALL_FOPEN_MAX; |
8fbdfb7c | 3733 | # else |
8fa7f367 | 3734 | # if defined(HAS_SYSCONF) && defined(_SC_OPEN_MAX) |
767df6a1 | 3735 | open_max = sysconf(_SC_OPEN_MAX); |
8fa7f367 JH |
3736 | # else |
3737 | # ifdef FOPEN_MAX | |
74cac757 | 3738 | open_max = FOPEN_MAX; |
8fa7f367 JH |
3739 | # else |
3740 | # ifdef OPEN_MAX | |
74cac757 | 3741 | open_max = OPEN_MAX; |
8fa7f367 JH |
3742 | # else |
3743 | # ifdef _NFILE | |
d2201af2 | 3744 | open_max = _NFILE; |
8fa7f367 JH |
3745 | # endif |
3746 | # endif | |
74cac757 | 3747 | # endif |
767df6a1 JH |
3748 | # endif |
3749 | # endif | |
767df6a1 JH |
3750 | if (open_max > 0) { |
3751 | long i; | |
3752 | for (i = 0; i < open_max; i++) | |
d2201af2 AD |
3753 | if (STDIO_STREAM_ARRAY[i]._file >= 0 && |
3754 | STDIO_STREAM_ARRAY[i]._file < open_max && | |
3755 | STDIO_STREAM_ARRAY[i]._flag) | |
3756 | PerlIO_flush(&STDIO_STREAM_ARRAY[i]); | |
767df6a1 JH |
3757 | return 0; |
3758 | } | |
8fbdfb7c | 3759 | # endif |
93189314 | 3760 | SETERRNO(EBADF,RMS_IFI); |
767df6a1 | 3761 | return EOF; |
74cac757 | 3762 | # endif |
767df6a1 JH |
3763 | #endif |
3764 | } | |
097ee67d | 3765 | |
69282e91 | 3766 | void |
e1ec3a88 | 3767 | Perl_report_evil_fh(pTHX_ const GV *gv, const IO *io, I32 op) |
bc37a18f | 3768 | { |
b64e5050 | 3769 | const char * const name = gv && isGV(gv) ? GvENAME(gv) : NULL; |
66fc2fa5 | 3770 | |
4c80c0b2 | 3771 | if (op == OP_phoney_OUTPUT_ONLY || op == OP_phoney_INPUT_ONLY) { |
3aed30dc | 3772 | if (ckWARN(WARN_IO)) { |
10edeb5d JH |
3773 | const char * const direction = |
3774 | (const char *)((op == OP_phoney_INPUT_ONLY) ? "in" : "out"); | |
3aed30dc HS |
3775 | if (name && *name) |
3776 | Perl_warner(aTHX_ packWARN(WARN_IO), | |
3777 | "Filehandle %s opened only for %sput", | |
fd322ea4 | 3778 | name, direction); |
3aed30dc HS |
3779 | else |
3780 | Perl_warner(aTHX_ packWARN(WARN_IO), | |
fd322ea4 | 3781 | "Filehandle opened only for %sput", direction); |
3aed30dc | 3782 | } |
2dd78f96 JH |
3783 | } |
3784 | else { | |
e1ec3a88 | 3785 | const char *vile; |
3aed30dc HS |
3786 | I32 warn_type; |
3787 | ||
3788 | if (gv && io && IoTYPE(io) == IoTYPE_CLOSED) { | |
3789 | vile = "closed"; | |
3790 | warn_type = WARN_CLOSED; | |
3791 | } | |
3792 | else { | |
3793 | vile = "unopened"; | |
3794 | warn_type = WARN_UNOPENED; | |
3795 | } | |
3796 | ||
3797 | if (ckWARN(warn_type)) { | |
10edeb5d JH |
3798 | const char * const pars = |
3799 | (const char *)(OP_IS_FILETEST(op) ? "" : "()"); | |
f0a09b71 | 3800 | const char * const func = |
10edeb5d JH |
3801 | (const char *) |
3802 | (op == OP_READLINE ? "readline" : /* "<HANDLE>" not nice */ | |
3803 | op == OP_LEAVEWRITE ? "write" : /* "write exit" not nice */ | |
3804 | op < 0 ? "" : /* handle phoney cases */ | |
3805 | PL_op_desc[op]); | |
3806 | const char * const type = | |
3807 | (const char *) | |
3808 | (OP_IS_SOCKET(op) || | |
3809 | (gv && io && IoTYPE(io) == IoTYPE_SOCKET) ? | |
3810 | "socket" : "filehandle"); | |
3aed30dc HS |
3811 | if (name && *name) { |
3812 | Perl_warner(aTHX_ packWARN(warn_type), | |
3813 | "%s%s on %s %s %s", func, pars, vile, type, name); | |
3814 | if (io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP)) | |
3815 | Perl_warner( | |
3816 | aTHX_ packWARN(warn_type), | |
3817 | "\t(Are you trying to call %s%s on dirhandle %s?)\n", | |
3818 | func, pars, name | |
3819 | ); | |
3820 | } | |
3821 | else { | |
3822 | Perl_warner(aTHX_ packWARN(warn_type), | |
3823 | "%s%s on %s %s", func, pars, vile, type); | |
3824 | if (gv && io && IoDIRP(io) && !(IoFLAGS(io) & IOf_FAKE_DIRP)) | |
3825 | Perl_warner( | |
3826 | aTHX_ packWARN(warn_type), | |
3827 | "\t(Are you trying to call %s%s on dirhandle?)\n", | |
3828 | func, pars | |
3829 | ); | |
3830 | } | |
3831 | } | |
bc37a18f | 3832 | } |
69282e91 | 3833 | } |
a926ef6b | 3834 | |
f9d13529 KW |
3835 | /* XXX Add documentation after final interface and behavior is decided */ |
3836 | /* May want to show context for error, so would pass Perl_bslash_c(pTHX_ const char* current, const char* start, const bool output_warning) | |
3837 | U8 source = *current; | |
3838 | ||
3839 | May want to add eg, WARN_REGEX | |
3840 | */ | |
3841 | ||
3842 | char | |
3843 | Perl_grok_bslash_c(pTHX_ const char source, const bool output_warning) | |
3844 | { | |
3845 | ||
3846 | U8 result; | |
3847 | ||
3848 | if (! isASCII(source)) { | |
3849 | Perl_croak(aTHX_ "Character following \"\\c\" must be ASCII"); | |
3850 | } | |
3851 | ||
3852 | result = toCTRL(source); | |
3853 | if (! isCNTRL(result)) { | |
3854 | if (source == '{') { | |
3855 | Perl_croak(aTHX_ "It is proposed that \"\\c{\" no longer be valid. It has historically evaluated to\n \";\". If you disagree with this proposal, send email to perl5-porters@perl.org\nOtherwise, or in the meantime, you can work around this failure by changing\n\"\\c{\" to \";\""); | |
3856 | } | |
3857 | else if (output_warning) { | |
3858 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), | |
3859 | "\"\\c%c\" more clearly written simply as \"%c\"", | |
3860 | source, | |
3861 | result); | |
3862 | } | |
3863 | } | |
3864 | ||
3865 | return result; | |
3866 | } | |
3867 | ||
f6adc668 | 3868 | /* To workaround core dumps from the uninitialised tm_zone we get the |
e72cf795 JH |
3869 | * system to give us a reasonable struct to copy. This fix means that |
3870 | * strftime uses the tm_zone and tm_gmtoff values returned by | |
3871 | * localtime(time()). That should give the desired result most of the | |
3872 | * time. But probably not always! | |
3873 | * | |
f6adc668 JH |
3874 | * This does not address tzname aspects of NETaa14816. |
3875 | * | |
e72cf795 | 3876 | */ |
f6adc668 | 3877 | |
e72cf795 JH |
3878 | #ifdef HAS_GNULIBC |
3879 | # ifndef STRUCT_TM_HASZONE | |
3880 | # define STRUCT_TM_HASZONE | |
3881 | # endif | |
3882 | #endif | |
3883 | ||
f6adc668 JH |
3884 | #ifdef STRUCT_TM_HASZONE /* Backward compat */ |
3885 | # ifndef HAS_TM_TM_ZONE | |
3886 | # define HAS_TM_TM_ZONE | |
3887 | # endif | |
3888 | #endif | |
3889 | ||
e72cf795 | 3890 | void |
f1208910 | 3891 | Perl_init_tm(pTHX_ struct tm *ptm) /* see mktime, strftime and asctime */ |
e72cf795 | 3892 | { |
f6adc668 | 3893 | #ifdef HAS_TM_TM_ZONE |
e72cf795 | 3894 | Time_t now; |
1b6737cc | 3895 | const struct tm* my_tm; |
7918f24d | 3896 | PERL_ARGS_ASSERT_INIT_TM; |
e72cf795 | 3897 | (void)time(&now); |
82c57498 | 3898 | my_tm = localtime(&now); |
ca46b8ee SP |
3899 | if (my_tm) |
3900 | Copy(my_tm, ptm, 1, struct tm); | |
1b6737cc | 3901 | #else |
7918f24d | 3902 | PERL_ARGS_ASSERT_INIT_TM; |
1b6737cc | 3903 | PERL_UNUSED_ARG(ptm); |
e72cf795 JH |
3904 | #endif |
3905 | } | |
3906 | ||
3907 | /* | |
3908 | * mini_mktime - normalise struct tm values without the localtime() | |
3909 | * semantics (and overhead) of mktime(). | |
3910 | */ | |
3911 | void | |
f1208910 | 3912 | Perl_mini_mktime(pTHX_ struct tm *ptm) |
e72cf795 JH |
3913 | { |
3914 | int yearday; | |
3915 | int secs; | |
3916 | int month, mday, year, jday; | |
3917 | int odd_cent, odd_year; | |
96a5add6 | 3918 | PERL_UNUSED_CONTEXT; |
e72cf795 | 3919 | |
7918f24d NC |
3920 | PERL_ARGS_ASSERT_MINI_MKTIME; |
3921 | ||
e72cf795 JH |
3922 | #define DAYS_PER_YEAR 365 |
3923 | #define DAYS_PER_QYEAR (4*DAYS_PER_YEAR+1) | |
3924 | #define DAYS_PER_CENT (25*DAYS_PER_QYEAR-1) | |
3925 | #define DAYS_PER_QCENT (4*DAYS_PER_CENT+1) | |
3926 | #define SECS_PER_HOUR (60*60) | |
3927 | #define SECS_PER_DAY (24*SECS_PER_HOUR) | |
3928 | /* parentheses deliberately absent on these two, otherwise they don't work */ | |
3929 | #define MONTH_TO_DAYS 153/5 | |
3930 | #define DAYS_TO_MONTH 5/153 | |
3931 | /* offset to bias by March (month 4) 1st between month/mday & year finding */ | |
3932 | #define YEAR_ADJUST (4*MONTH_TO_DAYS+1) | |
3933 | /* as used here, the algorithm leaves Sunday as day 1 unless we adjust it */ | |
3934 | #define WEEKDAY_BIAS 6 /* (1+6)%7 makes Sunday 0 again */ | |
3935 | ||
3936 | /* | |
3937 | * Year/day algorithm notes: | |
3938 | * | |
3939 | * With a suitable offset for numeric value of the month, one can find | |
3940 | * an offset into the year by considering months to have 30.6 (153/5) days, | |
3941 | * using integer arithmetic (i.e., with truncation). To avoid too much | |
3942 | * messing about with leap days, we consider January and February to be | |
3943 | * the 13th and 14th month of the previous year. After that transformation, | |
3944 | * we need the month index we use to be high by 1 from 'normal human' usage, | |
3945 | * so the month index values we use run from 4 through 15. | |
3946 | * | |
3947 | * Given that, and the rules for the Gregorian calendar (leap years are those | |
3948 | * divisible by 4 unless also divisible by 100, when they must be divisible | |
3949 | * by 400 instead), we can simply calculate the number of days since some | |
3950 | * arbitrary 'beginning of time' by futzing with the (adjusted) year number, | |
3951 | * the days we derive from our month index, and adding in the day of the | |
3952 | * month. The value used here is not adjusted for the actual origin which | |
3953 | * it normally would use (1 January A.D. 1), since we're not exposing it. | |
3954 | * We're only building the value so we can turn around and get the | |
3955 | * normalised values for the year, month, day-of-month, and day-of-year. | |
3956 | * | |
3957 | * For going backward, we need to bias the value we're using so that we find | |
3958 | * the right year value. (Basically, we don't want the contribution of | |
3959 | * March 1st to the number to apply while deriving the year). Having done | |
3960 | * that, we 'count up' the contribution to the year number by accounting for | |
3961 | * full quadracenturies (400-year periods) with their extra leap days, plus | |
3962 | * the contribution from full centuries (to avoid counting in the lost leap | |
3963 | * days), plus the contribution from full quad-years (to count in the normal | |
3964 | * leap days), plus the leftover contribution from any non-leap years. | |
3965 | * At this point, if we were working with an actual leap day, we'll have 0 | |
3966 | * days left over. This is also true for March 1st, however. So, we have | |
3967 | * to special-case that result, and (earlier) keep track of the 'odd' | |
3968 | * century and year contributions. If we got 4 extra centuries in a qcent, | |
3969 | * or 4 extra years in a qyear, then it's a leap day and we call it 29 Feb. | |
3970 | * Otherwise, we add back in the earlier bias we removed (the 123 from | |
3971 | * figuring in March 1st), find the month index (integer division by 30.6), | |
3972 | * and the remainder is the day-of-month. We then have to convert back to | |
3973 | * 'real' months (including fixing January and February from being 14/15 in | |
3974 | * the previous year to being in the proper year). After that, to get | |
3975 | * tm_yday, we work with the normalised year and get a new yearday value for | |
3976 | * January 1st, which we subtract from the yearday value we had earlier, | |
3977 | * representing the date we've re-built. This is done from January 1 | |
3978 | * because tm_yday is 0-origin. | |
3979 | * | |
3980 | * Since POSIX time routines are only guaranteed to work for times since the | |
3981 | * UNIX epoch (00:00:00 1 Jan 1970 UTC), the fact that this algorithm | |
3982 | * applies Gregorian calendar rules even to dates before the 16th century | |
3983 | * doesn't bother me. Besides, you'd need cultural context for a given | |
3984 | * date to know whether it was Julian or Gregorian calendar, and that's | |
3985 | * outside the scope for this routine. Since we convert back based on the | |
3986 | * same rules we used to build the yearday, you'll only get strange results | |
3987 | * for input which needed normalising, or for the 'odd' century years which | |
3988 | * were leap years in the Julian calander but not in the Gregorian one. | |
3989 | * I can live with that. | |
3990 | * | |
3991 | * This algorithm also fails to handle years before A.D. 1 gracefully, but | |
3992 | * that's still outside the scope for POSIX time manipulation, so I don't | |
3993 | * care. | |
3994 | */ | |
3995 | ||
3996 | year = 1900 + ptm->tm_year; | |
3997 | month = ptm->tm_mon; | |
3998 | mday = ptm->tm_mday; | |
3999 | /* allow given yday with no month & mday to dominate the result */ | |
4000 | if (ptm->tm_yday >= 0 && mday <= 0 && month <= 0) { | |
4001 | month = 0; | |
4002 | mday = 0; | |
4003 | jday = 1 + ptm->tm_yday; | |
4004 | } | |
4005 | else { | |
4006 | jday = 0; | |
4007 | } | |
4008 | if (month >= 2) | |
4009 | month+=2; | |
4010 | else | |
4011 | month+=14, year--; | |
4012 | yearday = DAYS_PER_YEAR * year + year/4 - year/100 + year/400; | |
4013 | yearday += month*MONTH_TO_DAYS + mday + jday; | |
4014 | /* | |
4015 | * Note that we don't know when leap-seconds were or will be, | |
4016 | * so we have to trust the user if we get something which looks | |
4017 | * like a sensible leap-second. Wild values for seconds will | |
4018 | * be rationalised, however. | |
4019 | */ | |
4020 | if ((unsigned) ptm->tm_sec <= 60) { | |
4021 | secs = 0; | |
4022 | } | |
4023 | else { | |
4024 | secs = ptm->tm_sec; | |
4025 | ptm->tm_sec = 0; | |
4026 | } | |
4027 | secs += 60 * ptm->tm_min; | |
4028 | secs += SECS_PER_HOUR * ptm->tm_hour; | |
4029 | if (secs < 0) { | |
4030 | if (secs-(secs/SECS_PER_DAY*SECS_PER_DAY) < 0) { | |
4031 | /* got negative remainder, but need positive time */ | |
4032 | /* back off an extra day to compensate */ | |
4033 | yearday += (secs/SECS_PER_DAY)-1; | |
4034 | secs -= SECS_PER_DAY * (secs/SECS_PER_DAY - 1); | |
4035 | } | |
4036 | else { | |
4037 | yearday += (secs/SECS_PER_DAY); | |
4038 | secs -= SECS_PER_DAY * (secs/SECS_PER_DAY); | |
4039 | } | |
4040 | } | |
4041 | else if (secs >= SECS_PER_DAY) { | |
4042 | yearday += (secs/SECS_PER_DAY); | |
4043 | secs %= SECS_PER_DAY; | |
4044 | } | |
4045 | ptm->tm_hour = secs/SECS_PER_HOUR; | |
4046 | secs %= SECS_PER_HOUR; | |
4047 | ptm->tm_min = secs/60; | |
4048 | secs %= 60; | |
4049 | ptm->tm_sec += secs; | |
4050 | /* done with time of day effects */ | |
4051 | /* | |
4052 | * The algorithm for yearday has (so far) left it high by 428. | |
4053 | * To avoid mistaking a legitimate Feb 29 as Mar 1, we need to | |
4054 | * bias it by 123 while trying to figure out what year it | |
4055 | * really represents. Even with this tweak, the reverse | |
4056 | * translation fails for years before A.D. 0001. | |
4057 | * It would still fail for Feb 29, but we catch that one below. | |
4058 | */ | |
4059 | jday = yearday; /* save for later fixup vis-a-vis Jan 1 */ | |
4060 | yearday -= YEAR_ADJUST; | |
4061 | year = (yearday / DAYS_PER_QCENT) * 400; | |
4062 | yearday %= DAYS_PER_QCENT; | |
4063 | odd_cent = yearday / DAYS_PER_CENT; | |
4064 | year += odd_cent * 100; | |
4065 | yearday %= DAYS_PER_CENT; | |
4066 | year += (yearday / DAYS_PER_QYEAR) * 4; | |
4067 | yearday %= DAYS_PER_QYEAR; | |
4068 | odd_year = yearday / DAYS_PER_YEAR; | |
4069 | year += odd_year; | |
4070 | yearday %= DAYS_PER_YEAR; | |
4071 | if (!yearday && (odd_cent==4 || odd_year==4)) { /* catch Feb 29 */ | |
4072 | month = 1; | |
4073 | yearday = 29; | |
4074 | } | |
4075 | else { | |
4076 | yearday += YEAR_ADJUST; /* recover March 1st crock */ | |
4077 | month = yearday*DAYS_TO_MONTH; | |
4078 | yearday -= month*MONTH_TO_DAYS; | |
4079 | /* recover other leap-year adjustment */ | |
4080 | if (month > 13) { | |
4081 | month-=14; | |
4082 | year++; | |
4083 | } | |
4084 | else { | |
4085 | month-=2; | |
4086 | } | |
4087 | } | |
4088 | ptm->tm_year = year - 1900; | |
4089 | if (yearday) { | |
4090 | ptm->tm_mday = yearday; | |
4091 | ptm->tm_mon = month; | |
4092 | } | |
4093 | else { | |
4094 | ptm->tm_mday = 31; | |
4095 | ptm->tm_mon = month - 1; | |
4096 | } | |
4097 | /* re-build yearday based on Jan 1 to get tm_yday */ | |
4098 | year--; | |
4099 | yearday = year*DAYS_PER_YEAR + year/4 - year/100 + year/400; | |
4100 | yearday += 14*MONTH_TO_DAYS + 1; | |
4101 | ptm->tm_yday = jday - yearday; | |
4102 | /* fix tm_wday if not overridden by caller */ | |
4103 | if ((unsigned)ptm->tm_wday > 6) | |
4104 | ptm->tm_wday = (jday + WEEKDAY_BIAS) % 7; | |
4105 | } | |
b3c85772 JH |
4106 | |
4107 | char * | |
e1ec3a88 | 4108 | Perl_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 |
4109 | { |
4110 | #ifdef HAS_STRFTIME | |
4111 | char *buf; | |
4112 | int buflen; | |
4113 | struct tm mytm; | |
4114 | int len; | |
4115 | ||
7918f24d NC |
4116 | PERL_ARGS_ASSERT_MY_STRFTIME; |
4117 | ||
b3c85772 JH |
4118 | init_tm(&mytm); /* XXX workaround - see init_tm() above */ |
4119 | mytm.tm_sec = sec; | |
4120 | mytm.tm_min = min; | |
4121 | mytm.tm_hour = hour; | |
4122 | mytm.tm_mday = mday; | |
4123 | mytm.tm_mon = mon; | |
4124 | mytm.tm_year = year; | |
4125 | mytm.tm_wday = wday; | |
4126 | mytm.tm_yday = yday; | |
4127 | mytm.tm_isdst = isdst; | |
4128 | mini_mktime(&mytm); | |
c473feec SR |
4129 | /* use libc to get the values for tm_gmtoff and tm_zone [perl #18238] */ |
4130 | #if defined(HAS_MKTIME) && (defined(HAS_TM_TM_GMTOFF) || defined(HAS_TM_TM_ZONE)) | |
4131 | STMT_START { | |
4132 | struct tm mytm2; | |
4133 | mytm2 = mytm; | |
4134 | mktime(&mytm2); | |
4135 | #ifdef HAS_TM_TM_GMTOFF | |
4136 | mytm.tm_gmtoff = mytm2.tm_gmtoff; | |
4137 | #endif | |
4138 | #ifdef HAS_TM_TM_ZONE | |
4139 | mytm.tm_zone = mytm2.tm_zone; | |
4140 | #endif | |
4141 | } STMT_END; | |
4142 | #endif | |
b3c85772 | 4143 | buflen = 64; |
a02a5408 | 4144 | Newx(buf, buflen, char); |
b3c85772 JH |
4145 | len = strftime(buf, buflen, fmt, &mytm); |
4146 | /* | |
877f6a72 | 4147 | ** The following is needed to handle to the situation where |
b3c85772 JH |
4148 | ** tmpbuf overflows. Basically we want to allocate a buffer |
4149 | ** and try repeatedly. The reason why it is so complicated | |
4150 | ** is that getting a return value of 0 from strftime can indicate | |
4151 | ** one of the following: | |
4152 | ** 1. buffer overflowed, | |
4153 | ** 2. illegal conversion specifier, or | |
4154 | ** 3. the format string specifies nothing to be returned(not | |
4155 | ** an error). This could be because format is an empty string | |
4156 | ** or it specifies %p that yields an empty string in some locale. | |
4157 | ** If there is a better way to make it portable, go ahead by | |
4158 | ** all means. | |
4159 | */ | |
4160 | if ((len > 0 && len < buflen) || (len == 0 && *fmt == '\0')) | |
4161 | return buf; | |
4162 | else { | |
4163 | /* Possibly buf overflowed - try again with a bigger buf */ | |
e1ec3a88 | 4164 | const int fmtlen = strlen(fmt); |
7743c307 | 4165 | int bufsize = fmtlen + buflen; |
877f6a72 | 4166 | |
a02a5408 | 4167 | Newx(buf, bufsize, char); |
b3c85772 JH |
4168 | while (buf) { |
4169 | buflen = strftime(buf, bufsize, fmt, &mytm); | |
4170 | if (buflen > 0 && buflen < bufsize) | |
4171 | break; | |
4172 | /* heuristic to prevent out-of-memory errors */ | |
4173 | if (bufsize > 100*fmtlen) { | |
4174 | Safefree(buf); | |
4175 | buf = NULL; | |
4176 | break; | |
4177 | } | |
7743c307 SH |
4178 | bufsize *= 2; |
4179 | Renew(buf, bufsize, char); | |
b3c85772 JH |
4180 | } |
4181 | return buf; | |
4182 | } | |
4183 | #else | |
4184 | Perl_croak(aTHX_ "panic: no strftime"); | |
27da23d5 | 4185 | return NULL; |
b3c85772 JH |
4186 | #endif |
4187 | } | |
4188 | ||
877f6a72 NIS |
4189 | |
4190 | #define SV_CWD_RETURN_UNDEF \ | |
4191 | sv_setsv(sv, &PL_sv_undef); \ | |
4192 | return FALSE | |
4193 | ||
4194 | #define SV_CWD_ISDOT(dp) \ | |
4195 | (dp->d_name[0] == '.' && (dp->d_name[1] == '\0' || \ | |
3aed30dc | 4196 | (dp->d_name[1] == '.' && dp->d_name[2] == '\0'))) |
877f6a72 NIS |
4197 | |
4198 | /* | |
ccfc67b7 JH |
4199 | =head1 Miscellaneous Functions |
4200 | ||
89423764 | 4201 | =for apidoc getcwd_sv |
877f6a72 NIS |
4202 | |
4203 | Fill the sv with current working directory | |
4204 | ||
4205 | =cut | |
4206 | */ | |
4207 | ||
4208 | /* Originally written in Perl by John Bazik; rewritten in C by Ben Sugars. | |
4209 | * rewritten again by dougm, optimized for use with xs TARG, and to prefer | |
4210 | * getcwd(3) if available | |
4211 | * Comments from the orignal: | |
4212 | * This is a faster version of getcwd. It's also more dangerous | |
4213 | * because you might chdir out of a directory that you can't chdir | |
4214 | * back into. */ | |
4215 | ||
877f6a72 | 4216 | int |
89423764 | 4217 | Perl_getcwd_sv(pTHX_ register SV *sv) |
877f6a72 NIS |
4218 | { |
4219 | #ifndef PERL_MICRO | |
97aff369 | 4220 | dVAR; |
ea715489 JH |
4221 | #ifndef INCOMPLETE_TAINTS |
4222 | SvTAINTED_on(sv); | |
4223 | #endif | |
4224 | ||
7918f24d NC |
4225 | PERL_ARGS_ASSERT_GETCWD_SV; |
4226 | ||
8f95b30d JH |
4227 | #ifdef HAS_GETCWD |
4228 | { | |
60e110a8 DM |
4229 | char buf[MAXPATHLEN]; |
4230 | ||
3aed30dc | 4231 | /* Some getcwd()s automatically allocate a buffer of the given |
60e110a8 DM |
4232 | * size from the heap if they are given a NULL buffer pointer. |
4233 | * The problem is that this behaviour is not portable. */ | |
3aed30dc | 4234 | if (getcwd(buf, sizeof(buf) - 1)) { |
42d9b98d | 4235 | sv_setpv(sv, buf); |
3aed30dc HS |
4236 | return TRUE; |
4237 | } | |
4238 | else { | |
4239 | sv_setsv(sv, &PL_sv_undef); | |
4240 | return FALSE; | |
4241 | } | |
8f95b30d JH |
4242 | } |
4243 | ||
4244 | #else | |
4245 | ||
c623ac67 | 4246 | Stat_t statbuf; |
877f6a72 | 4247 | int orig_cdev, orig_cino, cdev, cino, odev, oino, tdev, tino; |
4373e329 | 4248 | int pathlen=0; |
877f6a72 | 4249 | Direntry_t *dp; |
877f6a72 | 4250 | |
862a34c6 | 4251 | SvUPGRADE(sv, SVt_PV); |
877f6a72 | 4252 | |
877f6a72 | 4253 | if (PerlLIO_lstat(".", &statbuf) < 0) { |
3aed30dc | 4254 | SV_CWD_RETURN_UNDEF; |
877f6a72 NIS |
4255 | } |
4256 | ||
4257 | orig_cdev = statbuf.st_dev; | |
4258 | orig_cino = statbuf.st_ino; | |
4259 | cdev = orig_cdev; | |
4260 | cino = orig_cino; | |
4261 | ||
4262 | for (;;) { | |
4373e329 | 4263 | DIR *dir; |
f56ed502 | 4264 | int namelen; |
3aed30dc HS |
4265 | odev = cdev; |
4266 | oino = cino; | |
4267 | ||
4268 | if (PerlDir_chdir("..") < 0) { | |
4269 | SV_CWD_RETURN_UNDEF; | |
4270 | } | |
4271 | if (PerlLIO_stat(".", &statbuf) < 0) { | |
4272 | SV_CWD_RETURN_UNDEF; | |
4273 | } | |
4274 | ||
4275 | cdev = statbuf.st_dev; | |
4276 | cino = statbuf.st_ino; | |
4277 | ||
4278 | if (odev == cdev && oino == cino) { | |
4279 | break; | |
4280 | } | |
4281 | if (!(dir = PerlDir_open("."))) { | |
4282 | SV_CWD_RETURN_UNDEF; | |
4283 | } | |
4284 | ||
4285 | while ((dp = PerlDir_read(dir)) != NULL) { | |
877f6a72 | 4286 | #ifdef DIRNAMLEN |
f56ed502 | 4287 | namelen = dp->d_namlen; |
877f6a72 | 4288 | #else |
f56ed502 | 4289 | namelen = strlen(dp->d_name); |
877f6a72 | 4290 | #endif |
3aed30dc HS |
4291 | /* skip . and .. */ |
4292 | if (SV_CWD_ISDOT(dp)) { | |
4293 | continue; | |
4294 | } | |
4295 | ||
4296 | if (PerlLIO_lstat(dp->d_name, &statbuf) < 0) { | |
4297 | SV_CWD_RETURN_UNDEF; | |
4298 | } | |
4299 | ||
4300 | tdev = statbuf.st_dev; | |
4301 | tino = statbuf.st_ino; | |
4302 | if (tino == oino && tdev == odev) { | |
4303 | break; | |
4304 | } | |
cb5953d6 JH |
4305 | } |
4306 | ||
3aed30dc HS |
4307 | if (!dp) { |
4308 | SV_CWD_RETURN_UNDEF; | |
4309 | } | |
4310 | ||
4311 | if (pathlen + namelen + 1 >= MAXPATHLEN) { | |
4312 | SV_CWD_RETURN_UNDEF; | |
4313 | } | |
877f6a72 | 4314 | |
3aed30dc HS |
4315 | SvGROW(sv, pathlen + namelen + 1); |
4316 | ||
4317 | if (pathlen) { | |
4318 | /* shift down */ | |
95a20fc0 | 4319 | Move(SvPVX_const(sv), SvPVX(sv) + namelen + 1, pathlen, char); |
3aed30dc | 4320 | } |
877f6a72 | 4321 | |
3aed30dc HS |
4322 | /* prepend current directory to the front */ |
4323 | *SvPVX(sv) = '/'; | |
4324 | Move(dp->d_name, SvPVX(sv)+1, namelen, char); | |
4325 | pathlen += (namelen + 1); | |
877f6a72 NIS |
4326 | |
4327 | #ifdef VOID_CLOSEDIR | |
3aed30dc | 4328 | PerlDir_close(dir); |
877f6a72 | 4329 | #else |
3aed30dc HS |
4330 | if (PerlDir_close(dir) < 0) { |
4331 | SV_CWD_RETURN_UNDEF; | |
4332 | } | |
877f6a72 NIS |
4333 | #endif |
4334 | } | |
4335 | ||
60e110a8 | 4336 | if (pathlen) { |
3aed30dc HS |
4337 | SvCUR_set(sv, pathlen); |
4338 | *SvEND(sv) = '\0'; | |
4339 | SvPOK_only(sv); | |
877f6a72 | 4340 | |
95a20fc0 | 4341 | if (PerlDir_chdir(SvPVX_const(sv)) < 0) { |
3aed30dc HS |
4342 | SV_CWD_RETURN_UNDEF; |
4343 | } | |
877f6a72 NIS |
4344 | } |
4345 | if (PerlLIO_stat(".", &statbuf) < 0) { | |
3aed30dc | 4346 | SV_CWD_RETURN_UNDEF; |
877f6a72 NIS |
4347 | } |
4348 | ||
4349 | cdev = statbuf.st_dev; | |
4350 | cino = statbuf.st_ino; | |
4351 | ||
4352 | if (cdev != orig_cdev || cino != orig_cino) { | |
3aed30dc HS |
4353 | Perl_croak(aTHX_ "Unstable directory path, " |
4354 | "current directory changed unexpectedly"); | |
877f6a72 | 4355 | } |
877f6a72 NIS |
4356 | |
4357 | return TRUE; | |
793b8d8e JH |
4358 | #endif |
4359 | ||
877f6a72 NIS |
4360 | #else |
4361 | return FALSE; | |
4362 | #endif | |
4363 | } | |
4364 | ||
c812d146 | 4365 | #define VERSION_MAX 0x7FFFFFFF |
91152fc1 | 4366 | |
22f16304 RU |
4367 | /* |
4368 | =for apidoc prescan_version | |
4369 | ||
4370 | =cut | |
4371 | */ | |
91152fc1 DG |
4372 | const char * |
4373 | Perl_prescan_version(pTHX_ const char *s, bool strict, | |
4374 | const char **errstr, | |
4375 | bool *sqv, int *ssaw_decimal, int *swidth, bool *salpha) { | |
4376 | bool qv = (sqv ? *sqv : FALSE); | |
4377 | int width = 3; | |
4378 | int saw_decimal = 0; | |
4379 | bool alpha = FALSE; | |
4380 | const char *d = s; | |
4381 | ||
4382 | PERL_ARGS_ASSERT_PRESCAN_VERSION; | |
4383 | ||
4384 | if (qv && isDIGIT(*d)) | |
4385 | goto dotted_decimal_version; | |
4386 | ||
4387 | if (*d == 'v') { /* explicit v-string */ | |
4388 | d++; | |
4389 | if (isDIGIT(*d)) { | |
4390 | qv = TRUE; | |
4391 | } | |
4392 | else { /* degenerate v-string */ | |
4393 | /* requires v1.2.3 */ | |
4394 | BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)"); | |
4395 | } | |
4396 | ||
4397 | dotted_decimal_version: | |
4398 | if (strict && d[0] == '0' && isDIGIT(d[1])) { | |
4399 | /* no leading zeros allowed */ | |
4400 | BADVERSION(s,errstr,"Invalid version format (no leading zeros)"); | |
4401 | } | |
4402 | ||
4403 | while (isDIGIT(*d)) /* integer part */ | |
4404 | d++; | |
4405 | ||
4406 | if (*d == '.') | |
4407 | { | |
4408 | saw_decimal++; | |
4409 | d++; /* decimal point */ | |
4410 | } | |
4411 | else | |
4412 | { | |
4413 | if (strict) { | |
4414 | /* require v1.2.3 */ | |
4415 | BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)"); | |
4416 | } | |
4417 | else { | |
4418 | goto version_prescan_finish; | |
4419 | } | |
4420 | } | |
4421 | ||
4422 | { | |
4423 | int i = 0; | |
4424 | int j = 0; | |
4425 | while (isDIGIT(*d)) { /* just keep reading */ | |
4426 | i++; | |
4427 | while (isDIGIT(*d)) { | |
4428 | d++; j++; | |
4429 | /* maximum 3 digits between decimal */ | |
4430 | if (strict && j > 3) { | |
4431 | BADVERSION(s,errstr,"Invalid version format (maximum 3 digits between decimals)"); | |
4432 | } | |
4433 | } | |
4434 | if (*d == '_') { | |
4435 | if (strict) { | |
4436 | BADVERSION(s,errstr,"Invalid version format (no underscores)"); | |
4437 | } | |
4438 | if ( alpha ) { | |
4439 | BADVERSION(s,errstr,"Invalid version format (multiple underscores)"); | |
4440 | } | |
4441 | d++; | |
4442 | alpha = TRUE; | |
4443 | } | |
4444 | else if (*d == '.') { | |
4445 | if (alpha) { | |
4446 | BADVERSION(s,errstr,"Invalid version format (underscores before decimal)"); | |
4447 | } | |
4448 | saw_decimal++; | |
4449 | d++; | |
4450 | } | |
4451 | else if (!isDIGIT(*d)) { | |
4452 | break; | |
4453 | } | |
4454 | j = 0; | |
4455 | } | |
4456 | ||
4457 | if (strict && i < 2) { | |
4458 | /* requires v1.2.3 */ | |
4459 | BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions require at least three parts)"); | |
4460 | } | |
4461 | } | |
4462 | } /* end if dotted-decimal */ | |
4463 | else | |
4464 | { /* decimal versions */ | |
4465 | /* special strict case for leading '.' or '0' */ | |
4466 | if (strict) { | |
4467 | if (*d == '.') { | |
4468 | BADVERSION(s,errstr,"Invalid version format (0 before decimal required)"); | |
4469 | } | |
4470 | if (*d == '0' && isDIGIT(d[1])) { | |
4471 | BADVERSION(s,errstr,"Invalid version format (no leading zeros)"); | |
4472 | } | |
4473 | } | |
4474 | ||
4475 | /* consume all of the integer part */ | |
4476 | while (isDIGIT(*d)) | |
4477 | d++; | |
4478 | ||
4479 | /* look for a fractional part */ | |
4480 | if (*d == '.') { | |
4481 | /* we found it, so consume it */ | |
4482 | saw_decimal++; | |
4483 | d++; | |
4484 | } | |
4485 | else if (!*d || *d == ';' || isSPACE(*d) || *d == '}') { | |
4486 | if ( d == s ) { | |
4487 | /* found nothing */ | |
4488 | BADVERSION(s,errstr,"Invalid version format (version required)"); | |
4489 | } | |
4490 | /* found just an integer */ | |
4491 | goto version_prescan_finish; | |
4492 | } | |
4493 | else if ( d == s ) { | |
4494 | /* didn't find either integer or period */ | |
4495 | BADVERSION(s,errstr,"Invalid version format (non-numeric data)"); | |
4496 | } | |
4497 | else if (*d == '_') { | |
4498 | /* underscore can't come after integer part */ | |
4499 | if (strict) { | |
4500 | BADVERSION(s,errstr,"Invalid version format (no underscores)"); | |
4501 | } | |
4502 | else if (isDIGIT(d[1])) { | |
4503 | BADVERSION(s,errstr,"Invalid version format (alpha without decimal)"); | |
4504 | } | |
4505 | else { | |
4506 | BADVERSION(s,errstr,"Invalid version format (misplaced underscore)"); | |
4507 | } | |
4508 | } | |
4509 | else { | |
4510 | /* anything else after integer part is just invalid data */ | |
4511 | BADVERSION(s,errstr,"Invalid version format (non-numeric data)"); | |
4512 | } | |
4513 | ||
4514 | /* scan the fractional part after the decimal point*/ | |
4515 | ||
4516 | if (!isDIGIT(*d) && (strict || ! (!*d || *d == ';' || isSPACE(*d) || *d == '}') )) { | |
4517 | /* strict or lax-but-not-the-end */ | |
4518 | BADVERSION(s,errstr,"Invalid version format (fractional part required)"); | |
4519 | } | |
4520 | ||
4521 | while (isDIGIT(*d)) { | |
4522 | d++; | |
4523 | if (*d == '.' && isDIGIT(d[-1])) { | |
4524 | if (alpha) { | |
4525 | BADVERSION(s,errstr,"Invalid version format (underscores before decimal)"); | |
4526 | } | |
4527 | if (strict) { | |
4528 | BADVERSION(s,errstr,"Invalid version format (dotted-decimal versions must begin with 'v')"); | |
4529 | } | |
4530 | d = (char *)s; /* start all over again */ | |
4531 | qv = TRUE; | |
4532 | goto dotted_decimal_version; | |
4533 | } | |
4534 | if (*d == '_') { | |
4535 | if (strict) { | |
4536 | BADVERSION(s,errstr,"Invalid version format (no underscores)"); | |
4537 | } | |
4538 | if ( alpha ) { | |
4539 | BADVERSION(s,errstr,"Invalid version format (multiple underscores)"); | |
4540 | } | |
4541 | if ( ! isDIGIT(d[1]) ) { | |
4542 | BADVERSION(s,errstr,"Invalid version format (misplaced underscore)"); | |
4543 | } | |
4544 | d++; | |
4545 | alpha = TRUE; | |
4546 | } | |
4547 | } | |
4548 | } | |
4549 | ||
4550 | version_prescan_finish: | |
4551 | while (isSPACE(*d)) | |
4552 | d++; | |
4553 | ||
4554 | if (!isDIGIT(*d) && (! (!*d || *d == ';' || *d == '}') )) { | |
4555 | /* trailing non-numeric data */ | |
4556 | BADVERSION(s,errstr,"Invalid version format (non-numeric data)"); | |
4557 | } | |
4558 | ||
4559 | if (sqv) | |
4560 | *sqv = qv; | |
4561 | if (swidth) | |
4562 | *swidth = width; | |
4563 | if (ssaw_decimal) | |
4564 | *ssaw_decimal = saw_decimal; | |
4565 | if (salpha) | |
4566 | *salpha = alpha; | |
4567 | return d; | |
4568 | } | |
4569 | ||
f4758303 | 4570 | /* |
b0f01acb JP |
4571 | =for apidoc scan_version |
4572 | ||
4573 | Returns a pointer to the next character after the parsed | |
4574 | version string, as well as upgrading the passed in SV to | |
4575 | an RV. | |
4576 | ||
4577 | Function must be called with an already existing SV like | |
4578 | ||
137d6fc0 | 4579 | sv = newSV(0); |
abc25d8c | 4580 | s = scan_version(s, SV *sv, bool qv); |
b0f01acb JP |
4581 | |
4582 | Performs some preprocessing to the string to ensure that | |
4583 | it has the correct characteristics of a version. Flags the | |
4584 | object if it contains an underscore (which denotes this | |
abc25d8c | 4585 | is an alpha version). The boolean qv denotes that the version |
137d6fc0 JP |
4586 | should be interpreted as if it had multiple decimals, even if |
4587 | it doesn't. | |
b0f01acb JP |
4588 | |
4589 | =cut | |
4590 | */ | |
4591 | ||
9137345a | 4592 | const char * |
e1ec3a88 | 4593 | Perl_scan_version(pTHX_ const char *s, SV *rv, bool qv) |
b0f01acb | 4594 | { |
e0218a61 | 4595 | const char *start; |
9137345a JP |
4596 | const char *pos; |
4597 | const char *last; | |
91152fc1 DG |
4598 | const char *errstr = NULL; |
4599 | int saw_decimal = 0; | |
9137345a | 4600 | int width = 3; |
91152fc1 | 4601 | bool alpha = FALSE; |
c812d146 | 4602 | bool vinf = FALSE; |
7452cf6a AL |
4603 | AV * const av = newAV(); |
4604 | SV * const hv = newSVrv(rv, "version"); /* create an SV and upgrade the RV */ | |
7918f24d NC |
4605 | |
4606 | PERL_ARGS_ASSERT_SCAN_VERSION; | |
4607 | ||
9137345a | 4608 | (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */ |
cb5772bb | 4609 | |
91152fc1 DG |
4610 | #ifndef NODEFAULT_SHAREKEYS |
4611 | HvSHAREKEYS_on(hv); /* key-sharing on by default */ | |
4612 | #endif | |
4613 | ||
e0218a61 JP |
4614 | while (isSPACE(*s)) /* leading whitespace is OK */ |
4615 | s++; | |
4616 | ||
91152fc1 DG |
4617 | last = prescan_version(s, FALSE, &errstr, &qv, &saw_decimal, &width, &alpha); |
4618 | if (errstr) { | |
4619 | /* "undef" is a special case and not an error */ | |
4620 | if ( ! ( *s == 'u' && strEQ(s,"undef")) ) { | |
4621 | Perl_croak(aTHX_ "%s", errstr); | |
46314c13 | 4622 | } |
ad63d80f | 4623 | } |
ad63d80f | 4624 | |
91152fc1 DG |
4625 | start = s; |
4626 | if (*s == 'v') | |
4627 | s++; | |
9137345a JP |
4628 | pos = s; |
4629 | ||
4630 | if ( qv ) | |
ef8f7699 | 4631 | (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(qv)); |
cb5772bb | 4632 | if ( alpha ) |
ef8f7699 | 4633 | (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(alpha)); |
9137345a | 4634 | if ( !qv && width < 3 ) |
ef8f7699 | 4635 | (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width)); |
9137345a | 4636 | |
ad63d80f | 4637 | while (isDIGIT(*pos)) |
46314c13 | 4638 | pos++; |
ad63d80f JP |
4639 | if (!isALPHA(*pos)) { |
4640 | I32 rev; | |
4641 | ||
ad63d80f JP |
4642 | for (;;) { |
4643 | rev = 0; | |
4644 | { | |
129318bd | 4645 | /* this is atoi() that delimits on underscores */ |
9137345a | 4646 | const char *end = pos; |
129318bd | 4647 | I32 mult = 1; |
c812d146 | 4648 | I32 orev; |
9137345a | 4649 | |
129318bd JP |
4650 | /* the following if() will only be true after the decimal |
4651 | * point of a version originally created with a bare | |
4652 | * floating point number, i.e. not quoted in any way | |
4653 | */ | |
91152fc1 | 4654 | if ( !qv && s > start && saw_decimal == 1 ) { |
c76df65e | 4655 | mult *= 100; |
129318bd | 4656 | while ( s < end ) { |
c812d146 | 4657 | orev = rev; |
129318bd JP |
4658 | rev += (*s - '0') * mult; |
4659 | mult /= 10; | |
c812d146 JP |
4660 | if ( (PERL_ABS(orev) > PERL_ABS(rev)) |
4661 | || (PERL_ABS(rev) > VERSION_MAX )) { | |
a2a5de95 NC |
4662 | Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW), |
4663 | "Integer overflow in version %d",VERSION_MAX); | |
c812d146 JP |
4664 | s = end - 1; |
4665 | rev = VERSION_MAX; | |
4666 | vinf = 1; | |
4667 | } | |
129318bd | 4668 | s++; |
9137345a JP |
4669 | if ( *s == '_' ) |
4670 | s++; | |
129318bd JP |
4671 | } |
4672 | } | |
4673 | else { | |
4674 | while (--end >= s) { | |
c812d146 | 4675 | orev = rev; |
129318bd JP |
4676 | rev += (*end - '0') * mult; |
4677 | mult *= 10; | |
c812d146 JP |
4678 | if ( (PERL_ABS(orev) > PERL_ABS(rev)) |
4679 | || (PERL_ABS(rev) > VERSION_MAX )) { | |
a2a5de95 NC |
4680 | Perl_ck_warner(aTHX_ packWARN(WARN_OVERFLOW), |
4681 | "Integer overflow in version"); | |
c812d146 JP |
4682 | end = s - 1; |
4683 | rev = VERSION_MAX; | |
4684 | vinf = 1; | |
4685 | } | |
129318bd JP |
4686 | } |
4687 | } | |
4688 | } | |
9137345a | 4689 | |
129318bd | 4690 | /* Append revision */ |
9137345a | 4691 | av_push(av, newSViv(rev)); |
c812d146 JP |
4692 | if ( vinf ) { |
4693 | s = last; | |
4694 | break; | |
4695 | } | |
4696 | else if ( *pos == '.' ) | |
9137345a JP |
4697 | s = ++pos; |
4698 | else if ( *pos == '_' && isDIGIT(pos[1]) ) | |
ad63d80f | 4699 | s = ++pos; |
f941e658 JP |
4700 | else if ( *pos == ',' && isDIGIT(pos[1]) ) |
4701 | s = ++pos; | |
ad63d80f JP |
4702 | else if ( isDIGIT(*pos) ) |
4703 | s = pos; | |
b0f01acb | 4704 | else { |
ad63d80f JP |
4705 | s = pos; |
4706 | break; | |
4707 | } | |
9137345a JP |
4708 | if ( qv ) { |
4709 | while ( isDIGIT(*pos) ) | |
4710 | pos++; | |
4711 | } | |
4712 | else { | |
4713 | int digits = 0; | |
4714 | while ( ( isDIGIT(*pos) || *pos == '_' ) && digits < 3 ) { | |
4715 | if ( *pos != '_' ) | |
4716 | digits++; | |
4717 | pos++; | |
4718 | } | |
b0f01acb JP |
4719 | } |
4720 | } | |
4721 | } | |
9137345a JP |
4722 | if ( qv ) { /* quoted versions always get at least three terms*/ |
4723 | I32 len = av_len(av); | |
4edfc503 NC |
4724 | /* This for loop appears to trigger a compiler bug on OS X, as it |
4725 | loops infinitely. Yes, len is negative. No, it makes no sense. | |
4726 | Compiler in question is: | |
4727 | gcc version 3.3 20030304 (Apple Computer, Inc. build 1640) | |
4728 | for ( len = 2 - len; len > 0; len-- ) | |
502c6561 | 4729 | av_push(MUTABLE_AV(sv), newSViv(0)); |
4edfc503 NC |
4730 | */ |
4731 | len = 2 - len; | |
4732 | while (len-- > 0) | |
9137345a | 4733 | av_push(av, newSViv(0)); |
b9381830 | 4734 | } |
9137345a | 4735 | |
8cb289bd | 4736 | /* need to save off the current version string for later */ |
c812d146 JP |
4737 | if ( vinf ) { |
4738 | SV * orig = newSVpvn("v.Inf", sizeof("v.Inf")-1); | |
ef8f7699 NC |
4739 | (void)hv_stores(MUTABLE_HV(hv), "original", orig); |
4740 | (void)hv_stores(MUTABLE_HV(hv), "vinf", newSViv(1)); | |
c812d146 JP |
4741 | } |
4742 | else if ( s > start ) { | |
8cb289bd | 4743 | SV * orig = newSVpvn(start,s-start); |
91152fc1 | 4744 | if ( qv && saw_decimal == 1 && *start != 'v' ) { |
8cb289bd RGS |
4745 | /* need to insert a v to be consistent */ |
4746 | sv_insert(orig, 0, 0, "v", 1); | |
4747 | } | |
ef8f7699 | 4748 | (void)hv_stores(MUTABLE_HV(hv), "original", orig); |
8cb289bd RGS |
4749 | } |
4750 | else { | |
76f68e9b | 4751 | (void)hv_stores(MUTABLE_HV(hv), "original", newSVpvs("0")); |
9137345a | 4752 | av_push(av, newSViv(0)); |
8cb289bd RGS |
4753 | } |
4754 | ||
4755 | /* And finally, store the AV in the hash */ | |
daba3364 | 4756 | (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av))); |
9137345a | 4757 | |
92dcf8ce JP |
4758 | /* fix RT#19517 - special case 'undef' as string */ |
4759 | if ( *s == 'u' && strEQ(s,"undef") ) { | |
4760 | s += 5; | |
4761 | } | |
4762 | ||
9137345a | 4763 | return s; |
b0f01acb JP |
4764 | } |
4765 | ||
4766 | /* | |
4767 | =for apidoc new_version | |
4768 | ||
4769 | Returns a new version object based on the passed in SV: | |
4770 | ||
4771 | SV *sv = new_version(SV *ver); | |
4772 | ||
4773 | Does not alter the passed in ver SV. See "upg_version" if you | |
4774 | want to upgrade the SV. | |
4775 | ||
4776 | =cut | |
4777 | */ | |
4778 | ||
4779 | SV * | |
4780 | Perl_new_version(pTHX_ SV *ver) | |
4781 | { | |
97aff369 | 4782 | dVAR; |
2d03de9c | 4783 | SV * const rv = newSV(0); |
7918f24d | 4784 | PERL_ARGS_ASSERT_NEW_VERSION; |
d7aa5382 JP |
4785 | if ( sv_derived_from(ver,"version") ) /* can just copy directly */ |
4786 | { | |
4787 | I32 key; | |
53c1dcc0 | 4788 | AV * const av = newAV(); |
9137345a JP |
4789 | AV *sav; |
4790 | /* This will get reblessed later if a derived class*/ | |
e0218a61 | 4791 | SV * const hv = newSVrv(rv, "version"); |
9137345a | 4792 | (void)sv_upgrade(hv, SVt_PVHV); /* needs to be an HV type */ |
91152fc1 DG |
4793 | #ifndef NODEFAULT_SHAREKEYS |
4794 | HvSHAREKEYS_on(hv); /* key-sharing on by default */ | |
4795 | #endif | |
9137345a JP |
4796 | |
4797 | if ( SvROK(ver) ) | |
4798 | ver = SvRV(ver); | |
4799 | ||
4800 | /* Begin copying all of the elements */ | |
ef8f7699 NC |
4801 | if ( hv_exists(MUTABLE_HV(ver), "qv", 2) ) |
4802 | (void)hv_stores(MUTABLE_HV(hv), "qv", newSViv(1)); | |
9137345a | 4803 | |
ef8f7699 NC |
4804 | if ( hv_exists(MUTABLE_HV(ver), "alpha", 5) ) |
4805 | (void)hv_stores(MUTABLE_HV(hv), "alpha", newSViv(1)); | |
9137345a | 4806 | |
ef8f7699 | 4807 | if ( hv_exists(MUTABLE_HV(ver), "width", 5 ) ) |
d7aa5382 | 4808 | { |
ef8f7699 NC |
4809 | const I32 width = SvIV(*hv_fetchs(MUTABLE_HV(ver), "width", FALSE)); |
4810 | (void)hv_stores(MUTABLE_HV(hv), "width", newSViv(width)); | |
d7aa5382 | 4811 | } |
9137345a | 4812 | |
ef8f7699 | 4813 | if ( hv_exists(MUTABLE_HV(ver), "original", 8 ) ) |
8cb289bd | 4814 | { |
ef8f7699 NC |
4815 | SV * pv = *hv_fetchs(MUTABLE_HV(ver), "original", FALSE); |
4816 | (void)hv_stores(MUTABLE_HV(hv), "original", newSVsv(pv)); | |
8cb289bd RGS |
4817 | } |
4818 | ||
502c6561 | 4819 | sav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(ver), "version", FALSE))); |
9137345a JP |
4820 | /* This will get reblessed later if a derived class*/ |
4821 | for ( key = 0; key <= av_len(sav); key++ ) | |
4822 | { | |
4823 | const I32 rev = SvIV(*av_fetch(sav, key, FALSE)); | |
4824 | av_push(av, newSViv(rev)); | |
4825 | } | |
4826 | ||
daba3364 | 4827 | (void)hv_stores(MUTABLE_HV(hv), "version", newRV_noinc(MUTABLE_SV(av))); |
d7aa5382 JP |
4828 | return rv; |
4829 | } | |
ad63d80f | 4830 | #ifdef SvVOK |
4f2da183 | 4831 | { |
3c21775b | 4832 | const MAGIC* const mg = SvVSTRING_mg(ver); |
4f2da183 NC |
4833 | if ( mg ) { /* already a v-string */ |
4834 | const STRLEN len = mg->mg_len; | |
4835 | char * const version = savepvn( (const char*)mg->mg_ptr, len); | |
4836 | sv_setpvn(rv,version,len); | |
8cb289bd | 4837 | /* this is for consistency with the pure Perl class */ |
91152fc1 | 4838 | if ( isDIGIT(*version) ) |
8cb289bd | 4839 | sv_insert(rv, 0, 0, "v", 1); |
4f2da183 NC |
4840 | Safefree(version); |
4841 | } | |
4842 | else { | |
ad63d80f | 4843 | #endif |
4f2da183 | 4844 | sv_setsv(rv,ver); /* make a duplicate */ |
137d6fc0 | 4845 | #ifdef SvVOK |
4f2da183 | 4846 | } |
26ec6fc3 | 4847 | } |
137d6fc0 | 4848 | #endif |
ac0e6a2f | 4849 | return upg_version(rv, FALSE); |
b0f01acb JP |
4850 | } |
4851 | ||
4852 | /* | |
4853 | =for apidoc upg_version | |
4854 | ||
4855 | In-place upgrade of the supplied SV to a version object. | |
4856 | ||
ac0e6a2f | 4857 | SV *sv = upg_version(SV *sv, bool qv); |
b0f01acb | 4858 | |
ac0e6a2f RGS |
4859 | Returns a pointer to the upgraded SV. Set the boolean qv if you want |
4860 | to force this SV to be interpreted as an "extended" version. | |
b0f01acb JP |
4861 | |
4862 | =cut | |
4863 | */ | |
4864 | ||
4865 | SV * | |
ac0e6a2f | 4866 | Perl_upg_version(pTHX_ SV *ver, bool qv) |
b0f01acb | 4867 | { |
cd57dc11 | 4868 | const char *version, *s; |
4f2da183 NC |
4869 | #ifdef SvVOK |
4870 | const MAGIC *mg; | |
4871 | #endif | |
137d6fc0 | 4872 | |
7918f24d NC |
4873 | PERL_ARGS_ASSERT_UPG_VERSION; |
4874 | ||
ac0e6a2f | 4875 | if ( SvNOK(ver) && !( SvPOK(ver) && sv_len(ver) == 3 ) ) |
137d6fc0 | 4876 | { |
ac0e6a2f | 4877 | /* may get too much accuracy */ |
137d6fc0 | 4878 | char tbuf[64]; |
b5b5a8f0 RGS |
4879 | #ifdef USE_LOCALE_NUMERIC |
4880 | char *loc = setlocale(LC_NUMERIC, "C"); | |
4881 | #endif | |
63e3af20 | 4882 | STRLEN len = my_snprintf(tbuf, sizeof(tbuf), "%.9"NVff, SvNVX(ver)); |
b5b5a8f0 RGS |
4883 | #ifdef USE_LOCALE_NUMERIC |
4884 | setlocale(LC_NUMERIC, loc); | |
4885 | #endif | |
c8a14fb6 | 4886 | while (tbuf[len-1] == '0' && len > 0) len--; |
8cb289bd | 4887 | if ( tbuf[len-1] == '.' ) len--; /* eat the trailing decimal */ |
86c11942 | 4888 | version = savepvn(tbuf, len); |
137d6fc0 | 4889 | } |
ad63d80f | 4890 | #ifdef SvVOK |
666cce26 | 4891 | else if ( (mg = SvVSTRING_mg(ver)) ) { /* already a v-string */ |
ad63d80f | 4892 | version = savepvn( (const char*)mg->mg_ptr,mg->mg_len ); |
91152fc1 | 4893 | qv = TRUE; |
b0f01acb | 4894 | } |
ad63d80f | 4895 | #endif |
137d6fc0 JP |
4896 | else /* must be a string or something like a string */ |
4897 | { | |
ac0e6a2f RGS |
4898 | STRLEN len; |
4899 | version = savepv(SvPV(ver,len)); | |
4900 | #ifndef SvVOK | |
4901 | # if PERL_VERSION > 5 | |
4902 | /* This will only be executed for 5.6.0 - 5.8.0 inclusive */ | |
91152fc1 DG |
4903 | if ( len >= 3 && !instr(version,".") && !instr(version,"_") |
4904 | && !(*version == 'u' && strEQ(version, "undef")) | |
4905 | && (*version < '0' || *version > '9') ) { | |
ac0e6a2f RGS |
4906 | /* may be a v-string */ |
4907 | SV * const nsv = sv_newmortal(); | |
4908 | const char *nver; | |
4909 | const char *pos; | |
91152fc1 | 4910 | int saw_decimal = 0; |
8cb289bd | 4911 | sv_setpvf(nsv,"v%vd",ver); |
ac0e6a2f RGS |
4912 | pos = nver = savepv(SvPV_nolen(nsv)); |
4913 | ||
4914 | /* scan the resulting formatted string */ | |
8cb289bd | 4915 | pos++; /* skip the leading 'v' */ |
ac0e6a2f RGS |
4916 | while ( *pos == '.' || isDIGIT(*pos) ) { |
4917 | if ( *pos == '.' ) | |
91152fc1 | 4918 | saw_decimal++ ; |
ac0e6a2f RGS |
4919 | pos++; |
4920 | } | |
4921 | ||
4922 | /* is definitely a v-string */ | |
91152fc1 | 4923 | if ( saw_decimal >= 2 ) { |
ac0e6a2f RGS |
4924 | Safefree(version); |
4925 | version = nver; | |
4926 | } | |
4927 | } | |
4928 | # endif | |
4929 | #endif | |
137d6fc0 | 4930 | } |
92dcf8ce | 4931 | |
cd57dc11 | 4932 | s = scan_version(version, ver, qv); |
808ee47e | 4933 | if ( *s != '\0' ) |
a2a5de95 NC |
4934 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), |
4935 | "Version string '%s' contains invalid data; " | |
4936 | "ignoring: '%s'", version, s); | |
137d6fc0 | 4937 | Safefree(version); |
ad63d80f | 4938 | return ver; |
b0f01acb JP |
4939 | } |
4940 | ||
e0218a61 JP |
4941 | /* |
4942 | =for apidoc vverify | |
4943 | ||
4944 | Validates that the SV contains a valid version object. | |
4945 | ||
4946 | bool vverify(SV *vobj); | |
4947 | ||
4948 | Note that it only confirms the bare minimum structure (so as not to get | |
4949 | confused by derived classes which may contain additional hash entries): | |
4950 | ||
4951 | =over 4 | |
4952 | ||
cb5772bb | 4953 | =item * The SV contains a [reference to a] hash |
e0218a61 JP |
4954 | |
4955 | =item * The hash contains a "version" key | |
4956 | ||
cb5772bb | 4957 | =item * The "version" key has [a reference to] an AV as its value |
e0218a61 JP |
4958 | |
4959 | =back | |
4960 | ||
4961 | =cut | |
4962 | */ | |
4963 | ||
4964 | bool | |
4965 | Perl_vverify(pTHX_ SV *vs) | |
4966 | { | |
4967 | SV *sv; | |
7918f24d NC |
4968 | |
4969 | PERL_ARGS_ASSERT_VVERIFY; | |
4970 | ||
e0218a61 JP |
4971 | if ( SvROK(vs) ) |
4972 | vs = SvRV(vs); | |
4973 | ||
4974 | /* see if the appropriate elements exist */ | |
4975 | if ( SvTYPE(vs) == SVt_PVHV | |
ef8f7699 NC |
4976 | && hv_exists(MUTABLE_HV(vs), "version", 7) |
4977 | && (sv = SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) | |
e0218a61 JP |
4978 | && SvTYPE(sv) == SVt_PVAV ) |
4979 | return TRUE; | |
4980 | else | |
4981 | return FALSE; | |
4982 | } | |
b0f01acb JP |
4983 | |
4984 | /* | |
4985 | =for apidoc vnumify | |
4986 | ||
ad63d80f JP |
4987 | Accepts a version object and returns the normalized floating |
4988 | point representation. Call like: | |
b0f01acb | 4989 | |
ad63d80f | 4990 | sv = vnumify(rv); |
b0f01acb | 4991 | |
ad63d80f JP |
4992 | NOTE: you can pass either the object directly or the SV |
4993 | contained within the RV. | |
b0f01acb JP |
4994 | |
4995 | =cut | |
4996 | */ | |
4997 | ||
4998 | SV * | |
ad63d80f | 4999 | Perl_vnumify(pTHX_ SV *vs) |
b0f01acb | 5000 | { |
ad63d80f | 5001 | I32 i, len, digit; |
9137345a JP |
5002 | int width; |
5003 | bool alpha = FALSE; | |
cb4a3036 | 5004 | SV *sv; |
9137345a | 5005 | AV *av; |
7918f24d NC |
5006 | |
5007 | PERL_ARGS_ASSERT_VNUMIFY; | |
5008 | ||
ad63d80f JP |
5009 | if ( SvROK(vs) ) |
5010 | vs = SvRV(vs); | |
9137345a | 5011 | |
e0218a61 JP |
5012 | if ( !vverify(vs) ) |
5013 | Perl_croak(aTHX_ "Invalid version object"); | |
5014 | ||
9137345a | 5015 | /* see if various flags exist */ |
ef8f7699 | 5016 | if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) ) |
9137345a | 5017 | alpha = TRUE; |
ef8f7699 NC |
5018 | if ( hv_exists(MUTABLE_HV(vs), "width", 5 ) ) |
5019 | width = SvIV(*hv_fetchs(MUTABLE_HV(vs), "width", FALSE)); | |
9137345a JP |
5020 | else |
5021 | width = 3; | |
5022 | ||
5023 | ||
5024 | /* attempt to retrieve the version array */ | |
502c6561 | 5025 | if ( !(av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))) ) ) { |
cb4a3036 | 5026 | return newSVpvs("0"); |
9137345a JP |
5027 | } |
5028 | ||
5029 | len = av_len(av); | |
46314c13 JP |
5030 | if ( len == -1 ) |
5031 | { | |
cb4a3036 | 5032 | return newSVpvs("0"); |
46314c13 | 5033 | } |
9137345a JP |
5034 | |
5035 | digit = SvIV(*av_fetch(av, 0, 0)); | |
cb4a3036 | 5036 | sv = Perl_newSVpvf(aTHX_ "%d.", (int)PERL_ABS(digit)); |
13f8f398 | 5037 | for ( i = 1 ; i < len ; i++ ) |
b0f01acb | 5038 | { |
9137345a JP |
5039 | digit = SvIV(*av_fetch(av, i, 0)); |
5040 | if ( width < 3 ) { | |
43eaf59d | 5041 | const int denom = (width == 2 ? 10 : 100); |
53c1dcc0 | 5042 | const div_t term = div((int)PERL_ABS(digit),denom); |
261fcdab | 5043 | Perl_sv_catpvf(aTHX_ sv, "%0*d_%d", width, term.quot, term.rem); |
9137345a JP |
5044 | } |
5045 | else { | |
261fcdab | 5046 | Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit); |
9137345a | 5047 | } |
b0f01acb | 5048 | } |
13f8f398 JP |
5049 | |
5050 | if ( len > 0 ) | |
5051 | { | |
9137345a JP |
5052 | digit = SvIV(*av_fetch(av, len, 0)); |
5053 | if ( alpha && width == 3 ) /* alpha version */ | |
396482e1 | 5054 | sv_catpvs(sv,"_"); |
261fcdab | 5055 | Perl_sv_catpvf(aTHX_ sv, "%0*d", width, (int)digit); |
13f8f398 | 5056 | } |
e0218a61 | 5057 | else /* len == 0 */ |
13f8f398 | 5058 | { |
396482e1 | 5059 | sv_catpvs(sv, "000"); |
13f8f398 | 5060 | } |
b0f01acb JP |
5061 | return sv; |
5062 | } | |
5063 | ||
5064 | /* | |
b9381830 | 5065 | =for apidoc vnormal |
b0f01acb | 5066 | |
ad63d80f JP |
5067 | Accepts a version object and returns the normalized string |
5068 | representation. Call like: | |
b0f01acb | 5069 | |
b9381830 | 5070 | sv = vnormal(rv); |
b0f01acb | 5071 | |
ad63d80f JP |
5072 | NOTE: you can pass either the object directly or the SV |
5073 | contained within the RV. | |
b0f01acb JP |
5074 | |
5075 | =cut | |
5076 | */ | |
5077 | ||
5078 | SV * | |
b9381830 | 5079 | Perl_vnormal(pTHX_ SV *vs) |
b0f01acb | 5080 | { |
ad63d80f | 5081 | I32 i, len, digit; |
9137345a | 5082 | bool alpha = FALSE; |
cb4a3036 | 5083 | SV *sv; |
9137345a | 5084 | AV *av; |
7918f24d NC |
5085 | |
5086 | PERL_ARGS_ASSERT_VNORMAL; | |
5087 | ||
ad63d80f JP |
5088 | if ( SvROK(vs) ) |
5089 | vs = SvRV(vs); | |
9137345a | 5090 | |
e0218a61 JP |
5091 | if ( !vverify(vs) ) |
5092 | Perl_croak(aTHX_ "Invalid version object"); | |
5093 | ||
ef8f7699 | 5094 | if ( hv_exists(MUTABLE_HV(vs), "alpha", 5 ) ) |
9137345a | 5095 | alpha = TRUE; |
502c6561 | 5096 | av = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(vs), "version", FALSE))); |
9137345a JP |
5097 | |
5098 | len = av_len(av); | |
e0218a61 JP |
5099 | if ( len == -1 ) |
5100 | { | |
cb4a3036 | 5101 | return newSVpvs(""); |
46314c13 | 5102 | } |
9137345a | 5103 | digit = SvIV(*av_fetch(av, 0, 0)); |
cb4a3036 | 5104 | sv = Perl_newSVpvf(aTHX_ "v%"IVdf, (IV)digit); |
cb5772bb | 5105 | for ( i = 1 ; i < len ; i++ ) { |
9137345a | 5106 | digit = SvIV(*av_fetch(av, i, 0)); |
261fcdab | 5107 | Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit); |
9137345a JP |
5108 | } |
5109 | ||
e0218a61 JP |
5110 | if ( len > 0 ) |
5111 | { | |
9137345a JP |
5112 | /* handle last digit specially */ |
5113 | digit = SvIV(*av_fetch(av, len, 0)); | |
5114 | if ( alpha ) | |
261fcdab | 5115 | Perl_sv_catpvf(aTHX_ sv, "_%"IVdf, (IV)digit); |
ad63d80f | 5116 | else |
261fcdab | 5117 | Perl_sv_catpvf(aTHX_ sv, ".%"IVdf, (IV)digit); |
b0f01acb | 5118 | } |
9137345a | 5119 | |
137d6fc0 JP |
5120 | if ( len <= 2 ) { /* short version, must be at least three */ |
5121 | for ( len = 2 - len; len != 0; len-- ) | |
396482e1 | 5122 | sv_catpvs(sv,".0"); |
137d6fc0 | 5123 | } |
b0f01acb | 5124 | return sv; |
9137345a | 5125 | } |
b0f01acb | 5126 | |
ad63d80f | 5127 | /* |
b9381830 JP |
5128 | =for apidoc vstringify |
5129 | ||
5130 | In order to maintain maximum compatibility with earlier versions | |
5131 | of Perl, this function will return either the floating point | |
5132 | notation or the multiple dotted notation, depending on whether | |
5133 | the original version contained 1 or more dots, respectively | |
5134 | ||
5135 | =cut | |
5136 | */ | |
5137 | ||
5138 | SV * | |
5139 | Perl_vstringify(pTHX_ SV *vs) | |
5140 | { | |
7918f24d NC |
5141 | PERL_ARGS_ASSERT_VSTRINGIFY; |
5142 | ||
b9381830 JP |
5143 | if ( SvROK(vs) ) |
5144 | vs = SvRV(vs); | |
219bf418 | 5145 | |
e0218a61 JP |
5146 | if ( !vverify(vs) ) |
5147 | Perl_croak(aTHX_ "Invalid version object"); | |
5148 | ||
ef8f7699 | 5149 | if (hv_exists(MUTABLE_HV(vs), "original", sizeof("original") - 1)) { |
219bf418 | 5150 | SV *pv; |
ef8f7699 | 5151 | pv = *hv_fetchs(MUTABLE_HV(vs), "original", FALSE); |
219bf418 RGS |
5152 | if ( SvPOK(pv) ) |
5153 | return newSVsv(pv); | |
5154 | else | |
5155 | return &PL_sv_undef; | |
5156 | } | |
5157 | else { | |
ef8f7699 | 5158 | if ( hv_exists(MUTABLE_HV(vs), "qv", 2) ) |
219bf418 RGS |
5159 | return vnormal(vs); |
5160 | else | |
5161 | return vnumify(vs); | |
5162 | } | |
b9381830 JP |
5163 | } |
5164 | ||
5165 | /* | |
ad63d80f JP |
5166 | =for apidoc vcmp |
5167 | ||
5168 | Version object aware cmp. Both operands must already have been | |
5169 | converted into version objects. | |
5170 | ||
5171 | =cut | |
5172 | */ | |
5173 | ||
5174 | int | |
9137345a | 5175 | Perl_vcmp(pTHX_ SV *lhv, SV *rhv) |
ad63d80f JP |
5176 | { |
5177 | I32 i,l,m,r,retval; | |
9137345a JP |
5178 | bool lalpha = FALSE; |
5179 | bool ralpha = FALSE; | |
5180 | I32 left = 0; | |
5181 | I32 right = 0; | |
5182 | AV *lav, *rav; | |
7918f24d NC |
5183 | |
5184 | PERL_ARGS_ASSERT_VCMP; | |
5185 | ||
9137345a JP |
5186 | if ( SvROK(lhv) ) |
5187 | lhv = SvRV(lhv); | |
5188 | if ( SvROK(rhv) ) | |
5189 | rhv = SvRV(rhv); | |
5190 | ||
e0218a61 JP |
5191 | if ( !vverify(lhv) ) |
5192 | Perl_croak(aTHX_ "Invalid version object"); | |
5193 | ||
5194 | if ( !vverify(rhv) ) | |
5195 | Perl_croak(aTHX_ "Invalid version object"); | |
5196 | ||
9137345a | 5197 | /* get the left hand term */ |
502c6561 | 5198 | lav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(lhv), "version", FALSE))); |
ef8f7699 | 5199 | if ( hv_exists(MUTABLE_HV(lhv), "alpha", 5 ) ) |
9137345a JP |
5200 | lalpha = TRUE; |
5201 | ||
5202 | /* and the right hand term */ | |
502c6561 | 5203 | rav = MUTABLE_AV(SvRV(*hv_fetchs(MUTABLE_HV(rhv), "version", FALSE))); |
ef8f7699 | 5204 | if ( hv_exists(MUTABLE_HV(rhv), "alpha", 5 ) ) |
9137345a JP |
5205 | ralpha = TRUE; |
5206 | ||
5207 | l = av_len(lav); | |
5208 | r = av_len(rav); | |
ad63d80f JP |
5209 | m = l < r ? l : r; |
5210 | retval = 0; | |
5211 | i = 0; | |
5212 | while ( i <= m && retval == 0 ) | |
5213 | { | |
9137345a JP |
5214 | left = SvIV(*av_fetch(lav,i,0)); |
5215 | right = SvIV(*av_fetch(rav,i,0)); | |
5216 | if ( left < right ) | |
ad63d80f | 5217 | retval = -1; |
9137345a | 5218 | if ( left > right ) |
ad63d80f JP |
5219 | retval = +1; |
5220 | i++; | |
5221 | } | |
5222 | ||
9137345a JP |
5223 | /* tiebreaker for alpha with identical terms */ |
5224 | if ( retval == 0 && l == r && left == right && ( lalpha || ralpha ) ) | |
5225 | { | |
5226 | if ( lalpha && !ralpha ) | |
5227 | { | |
5228 | retval = -1; | |
5229 | } | |
5230 | else if ( ralpha && !lalpha) | |
5231 | { | |
5232 | retval = +1; | |
5233 | } | |
5234 | } | |
5235 | ||
137d6fc0 | 5236 | if ( l != r && retval == 0 ) /* possible match except for trailing 0's */ |
129318bd | 5237 | { |
137d6fc0 | 5238 | if ( l < r ) |
129318bd | 5239 | { |
137d6fc0 JP |
5240 | while ( i <= r && retval == 0 ) |
5241 | { | |
9137345a | 5242 | if ( SvIV(*av_fetch(rav,i,0)) != 0 ) |
137d6fc0 JP |
5243 | retval = -1; /* not a match after all */ |
5244 | i++; | |
5245 | } | |
5246 | } | |
5247 | else | |
5248 | { | |
5249 | while ( i <= l && retval == 0 ) | |
5250 | { | |
9137345a | 5251 | if ( SvIV(*av_fetch(lav,i,0)) != 0 ) |
137d6fc0 JP |
5252 | retval = +1; /* not a match after all */ |
5253 | i++; | |
5254 | } | |
129318bd JP |
5255 | } |
5256 | } | |
ad63d80f JP |
5257 | return retval; |
5258 | } | |
5259 | ||
c95c94b1 | 5260 | #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) && defined(SOCK_DGRAM) && defined(HAS_SELECT) |
2bc69dc4 NIS |
5261 | # define EMULATE_SOCKETPAIR_UDP |
5262 | #endif | |
5263 | ||
5264 | #ifdef EMULATE_SOCKETPAIR_UDP | |
02fc2eee NC |
5265 | static int |
5266 | S_socketpair_udp (int fd[2]) { | |
e10bb1e9 | 5267 | dTHX; |
02fc2eee NC |
5268 | /* Fake a datagram socketpair using UDP to localhost. */ |
5269 | int sockets[2] = {-1, -1}; | |
5270 | struct sockaddr_in addresses[2]; | |
5271 | int i; | |
3aed30dc | 5272 | Sock_size_t size = sizeof(struct sockaddr_in); |
ae92b34e | 5273 | unsigned short port; |
02fc2eee NC |
5274 | int got; |
5275 | ||
3aed30dc | 5276 | memset(&addresses, 0, sizeof(addresses)); |
02fc2eee NC |
5277 | i = 1; |
5278 | do { | |
3aed30dc HS |
5279 | sockets[i] = PerlSock_socket(AF_INET, SOCK_DGRAM, PF_INET); |
5280 | if (sockets[i] == -1) | |
5281 | goto tidy_up_and_fail; | |
5282 | ||
5283 | addresses[i].sin_family = AF_INET; | |
5284 | addresses[i].sin_addr.s_addr = htonl(INADDR_LOOPBACK); | |
5285 | addresses[i].sin_port = 0; /* kernel choses port. */ | |
5286 | if (PerlSock_bind(sockets[i], (struct sockaddr *) &addresses[i], | |
5287 | sizeof(struct sockaddr_in)) == -1) | |
5288 | goto tidy_up_and_fail; | |
02fc2eee NC |
5289 | } while (i--); |
5290 | ||
5291 | /* Now have 2 UDP sockets. Find out which port each is connected to, and | |
5292 | for each connect the other socket to it. */ | |
5293 | i = 1; | |
5294 | do { | |
3aed30dc HS |
5295 | if (PerlSock_getsockname(sockets[i], (struct sockaddr *) &addresses[i], |
5296 | &size) == -1) | |
5297 | goto tidy_up_and_fail; | |
5298 | if (size != sizeof(struct sockaddr_in)) | |
5299 | goto abort_tidy_up_and_fail; | |
5300 | /* !1 is 0, !0 is 1 */ | |
5301 | if (PerlSock_connect(sockets[!i], (struct sockaddr *) &addresses[i], | |
5302 | sizeof(struct sockaddr_in)) == -1) | |
5303 | goto tidy_up_and_fail; | |
02fc2eee NC |
5304 | } while (i--); |
5305 | ||
5306 | /* Now we have 2 sockets connected to each other. I don't trust some other | |
5307 | process not to have already sent a packet to us (by random) so send | |
5308 | a packet from each to the other. */ | |
5309 | i = 1; | |
5310 | do { | |
3aed30dc HS |
5311 | /* I'm going to send my own port number. As a short. |
5312 | (Who knows if someone somewhere has sin_port as a bitfield and needs | |
5313 | this routine. (I'm assuming crays have socketpair)) */ | |
5314 | port = addresses[i].sin_port; | |
5315 | got = PerlLIO_write(sockets[i], &port, sizeof(port)); | |
5316 | if (got != sizeof(port)) { | |
5317 | if (got == -1) | |
5318 | goto tidy_up_and_fail; | |
5319 | goto abort_tidy_up_and_fail; | |
5320 | } | |
02fc2eee NC |
5321 | } while (i--); |
5322 | ||
5323 | /* Packets sent. I don't trust them to have arrived though. | |
5324 | (As I understand it Solaris TCP stack is multithreaded. Non-blocking | |
5325 | connect to localhost will use a second kernel thread. In 2.6 the | |
5326 | first thread running the connect() returns before the second completes, | |
5327 | so EINPROGRESS> In 2.7 the improved stack is faster and connect() | |
5328 | returns 0. Poor programs have tripped up. One poor program's authors' | |
5329 | had a 50-1 reverse stock split. Not sure how connected these were.) | |
5330 | So I don't trust someone not to have an unpredictable UDP stack. | |
5331 | */ | |
5332 | ||
5333 | { | |
3aed30dc HS |
5334 | struct timeval waitfor = {0, 100000}; /* You have 0.1 seconds */ |
5335 | int max = sockets[1] > sockets[0] ? sockets[1] : sockets[0]; | |
5336 | fd_set rset; | |
5337 | ||
5338 | FD_ZERO(&rset); | |
ea407a0c NC |
5339 | FD_SET((unsigned int)sockets[0], &rset); |
5340 | FD_SET((unsigned int)sockets[1], &rset); | |
3aed30dc HS |
5341 | |
5342 | got = PerlSock_select(max + 1, &rset, NULL, NULL, &waitfor); | |
5343 | if (got != 2 || !FD_ISSET(sockets[0], &rset) | |
5344 | || !FD_ISSET(sockets[1], &rset)) { | |
5345 | /* I hope this is portable and appropriate. */ | |
5346 | if (got == -1) | |
5347 | goto tidy_up_and_fail; | |
5348 | goto abort_tidy_up_and_fail; | |
5349 | } | |
02fc2eee | 5350 | } |
f4758303 | 5351 | |
02fc2eee NC |
5352 | /* And the paranoia department even now doesn't trust it to have arrive |
5353 | (hence MSG_DONTWAIT). Or that what arrives was sent by us. */ | |
5354 | { | |
3aed30dc HS |
5355 | struct sockaddr_in readfrom; |
5356 | unsigned short buffer[2]; | |
02fc2eee | 5357 | |
3aed30dc HS |
5358 | i = 1; |
5359 | do { | |
02fc2eee | 5360 | #ifdef MSG_DONTWAIT |
3aed30dc HS |
5361 | got = PerlSock_recvfrom(sockets[i], (char *) &buffer, |
5362 | sizeof(buffer), MSG_DONTWAIT, | |
5363 | (struct sockaddr *) &readfrom, &size); | |
02fc2eee | 5364 | #else |
3aed30dc HS |
5365 | got = PerlSock_recvfrom(sockets[i], (char *) &buffer, |
5366 | sizeof(buffer), 0, | |
5367 | (struct sockaddr *) &readfrom, &size); | |
e10bb1e9 | 5368 | #endif |
02fc2eee | 5369 | |
3aed30dc HS |
5370 | if (got == -1) |
5371 | goto tidy_up_and_fail; | |
5372 | if (got != sizeof(port) | |
5373 | || size != sizeof(struct sockaddr_in) | |
5374 | /* Check other socket sent us its port. */ | |
5375 | || buffer[0] != (unsigned short) addresses[!i].sin_port | |
5376 | /* Check kernel says we got the datagram from that socket */ | |
5377 | || readfrom.sin_family != addresses[!i].sin_family | |
5378 | || readfrom.sin_addr.s_addr != addresses[!i].sin_addr.s_addr | |
5379 | || readfrom.sin_port != addresses[!i].sin_port) | |
5380 | goto abort_tidy_up_and_fail; | |
5381 | } while (i--); | |
02fc2eee NC |
5382 | } |
5383 | /* My caller (my_socketpair) has validated that this is non-NULL */ | |
5384 | fd[0] = sockets[0]; | |
5385 | fd[1] = sockets[1]; | |
5386 | /* I hereby declare this connection open. May God bless all who cross | |
5387 | her. */ | |
5388 | return 0; | |
5389 | ||
5390 | abort_tidy_up_and_fail: | |
5391 | errno = ECONNABORTED; | |
5392 | tidy_up_and_fail: | |
5393 | { | |
4ee39169 | 5394 | dSAVE_ERRNO; |
3aed30dc HS |
5395 | if (sockets[0] != -1) |
5396 | PerlLIO_close(sockets[0]); | |
5397 | if (sockets[1] != -1) | |
5398 | PerlLIO_close(sockets[1]); | |
4ee39169 | 5399 | RESTORE_ERRNO; |
3aed30dc | 5400 | return -1; |
02fc2eee NC |
5401 | } |
5402 | } | |
85ca448a | 5403 | #endif /* EMULATE_SOCKETPAIR_UDP */ |
02fc2eee | 5404 | |
b5ac89c3 | 5405 | #if !defined(HAS_SOCKETPAIR) && defined(HAS_SOCKET) && defined(AF_INET) && defined(PF_INET) |
02fc2eee NC |
5406 | int |
5407 | Perl_my_socketpair (int family, int type, int protocol, int fd[2]) { | |
5408 | /* Stevens says that family must be AF_LOCAL, protocol 0. | |
2948e0bd | 5409 | I'm going to enforce that, then ignore it, and use TCP (or UDP). */ |
e10bb1e9 | 5410 | dTHX; |
02fc2eee NC |
5411 | int listener = -1; |
5412 | int connector = -1; | |
5413 | int acceptor = -1; | |
5414 | struct sockaddr_in listen_addr; | |
5415 | struct sockaddr_in connect_addr; | |
5416 | Sock_size_t size; | |
5417 | ||
50458334 JH |
5418 | if (protocol |
5419 | #ifdef AF_UNIX | |
5420 | || family != AF_UNIX | |
5421 | #endif | |
3aed30dc HS |
5422 | ) { |
5423 | errno = EAFNOSUPPORT; | |
5424 | return -1; | |
02fc2eee | 5425 | } |
2948e0bd | 5426 | if (!fd) { |
3aed30dc HS |
5427 | errno = EINVAL; |
5428 | return -1; | |
2948e0bd | 5429 | } |
02fc2eee | 5430 | |
2bc69dc4 | 5431 | #ifdef EMULATE_SOCKETPAIR_UDP |
02fc2eee | 5432 | if (type == SOCK_DGRAM) |
3aed30dc | 5433 | return S_socketpair_udp(fd); |
2bc69dc4 | 5434 | #endif |
02fc2eee | 5435 | |
3aed30dc | 5436 | listener = PerlSock_socket(AF_INET, type, 0); |
02fc2eee | 5437 | if (listener == -1) |
3aed30dc HS |
5438 | return -1; |
5439 | memset(&listen_addr, 0, sizeof(listen_addr)); | |
02fc2eee | 5440 | listen_addr.sin_family = AF_INET; |
3aed30dc | 5441 | listen_addr.sin_addr.s_addr = htonl(INADDR_LOOPBACK); |
02fc2eee | 5442 | listen_addr.sin_port = 0; /* kernel choses port. */ |
3aed30dc HS |
5443 | if (PerlSock_bind(listener, (struct sockaddr *) &listen_addr, |
5444 | sizeof(listen_addr)) == -1) | |
5445 | goto tidy_up_and_fail; | |
e10bb1e9 | 5446 | if (PerlSock_listen(listener, 1) == -1) |
3aed30dc | 5447 | goto tidy_up_and_fail; |
02fc2eee | 5448 | |
3aed30dc | 5449 | connector = PerlSock_socket(AF_INET, type, 0); |
02fc2eee | 5450 | if (connector == -1) |
3aed30dc | 5451 | goto tidy_up_and_fail; |
02fc2eee | 5452 | /* We want to find out the port number to connect to. */ |
3aed30dc HS |
5453 | size = sizeof(connect_addr); |
5454 | if (PerlSock_getsockname(listener, (struct sockaddr *) &connect_addr, | |
5455 | &size) == -1) | |
5456 | goto tidy_up_and_fail; | |
5457 | if (size != sizeof(connect_addr)) | |
5458 | goto abort_tidy_up_and_fail; | |
e10bb1e9 | 5459 | if (PerlSock_connect(connector, (struct sockaddr *) &connect_addr, |
3aed30dc HS |
5460 | sizeof(connect_addr)) == -1) |
5461 | goto tidy_up_and_fail; | |
02fc2eee | 5462 | |
3aed30dc HS |
5463 | size = sizeof(listen_addr); |
5464 | acceptor = PerlSock_accept(listener, (struct sockaddr *) &listen_addr, | |
5465 | &size); | |
02fc2eee | 5466 | if (acceptor == -1) |
3aed30dc HS |
5467 | goto tidy_up_and_fail; |
5468 | if (size != sizeof(listen_addr)) | |
5469 | goto abort_tidy_up_and_fail; | |
5470 | PerlLIO_close(listener); | |
02fc2eee NC |
5471 | /* Now check we are talking to ourself by matching port and host on the |
5472 | two sockets. */ | |
3aed30dc HS |
5473 | if (PerlSock_getsockname(connector, (struct sockaddr *) &connect_addr, |
5474 | &size) == -1) | |
5475 | goto tidy_up_and_fail; | |
5476 | if (size != sizeof(connect_addr) | |
5477 | || listen_addr.sin_family != connect_addr.sin_family | |
5478 | || listen_addr.sin_addr.s_addr != connect_addr.sin_addr.s_addr | |
5479 | || listen_addr.sin_port != connect_addr.sin_port) { | |
5480 | goto abort_tidy_up_and_fail; | |
02fc2eee NC |
5481 | } |
5482 | fd[0] = connector; | |
5483 | fd[1] = acceptor; | |
5484 | return 0; | |
5485 | ||
5486 | abort_tidy_up_and_fail: | |
27da23d5 JH |
5487 | #ifdef ECONNABORTED |
5488 | errno = ECONNABORTED; /* This would be the standard thing to do. */ | |
5489 | #else | |
5490 | # ifdef ECONNREFUSED | |
5491 | errno = ECONNREFUSED; /* E.g. Symbian does not have ECONNABORTED. */ | |
5492 | # else | |
5493 | errno = ETIMEDOUT; /* Desperation time. */ | |
5494 | # endif | |
5495 | #endif | |
02fc2eee NC |
5496 | tidy_up_and_fail: |
5497 | { | |
4ee39169 | 5498 | dSAVE_ERRNO; |
3aed30dc HS |
5499 | if (listener != -1) |
5500 | PerlLIO_close(listener); | |
5501 | if (connector != -1) | |
5502 | PerlLIO_close(connector); | |
5503 | if (acceptor != -1) | |
5504 | PerlLIO_close(acceptor); | |
4ee39169 | 5505 | RESTORE_ERRNO; |
3aed30dc | 5506 | return -1; |
02fc2eee NC |
5507 | } |
5508 | } | |
85ca448a | 5509 | #else |
48ea76d1 JH |
5510 | /* In any case have a stub so that there's code corresponding |
5511 | * to the my_socketpair in global.sym. */ | |
5512 | int | |
5513 | Perl_my_socketpair (int family, int type, int protocol, int fd[2]) { | |
daf16542 | 5514 | #ifdef HAS_SOCKETPAIR |
48ea76d1 | 5515 | return socketpair(family, type, protocol, fd); |
daf16542 JH |
5516 | #else |
5517 | return -1; | |
5518 | #endif | |
48ea76d1 JH |
5519 | } |
5520 | #endif | |
5521 | ||
68795e93 NIS |
5522 | /* |
5523 | ||
5524 | =for apidoc sv_nosharing | |
5525 | ||
5526 | Dummy routine which "shares" an SV when there is no sharing module present. | |
d5b2b27b NC |
5527 | Or "locks" it. Or "unlocks" it. In other words, ignores its single SV argument. |
5528 | Exists to avoid test for a NULL function pointer and because it could | |
5529 | potentially warn under some level of strict-ness. | |
68795e93 NIS |
5530 | |
5531 | =cut | |
5532 | */ | |
5533 | ||
5534 | void | |
5535 | Perl_sv_nosharing(pTHX_ SV *sv) | |
5536 | { | |
96a5add6 | 5537 | PERL_UNUSED_CONTEXT; |
53c1dcc0 | 5538 | PERL_UNUSED_ARG(sv); |
68795e93 NIS |
5539 | } |
5540 | ||
eba16661 JH |
5541 | /* |
5542 | ||
5543 | =for apidoc sv_destroyable | |
5544 | ||
5545 | Dummy routine which reports that object can be destroyed when there is no | |
5546 | sharing module present. It ignores its single SV argument, and returns | |
5547 | 'true'. Exists to avoid test for a NULL function pointer and because it | |
5548 | could potentially warn under some level of strict-ness. | |
5549 | ||
5550 | =cut | |
5551 | */ | |
5552 | ||
5553 | bool | |
5554 | Perl_sv_destroyable(pTHX_ SV *sv) | |
5555 | { | |
5556 | PERL_UNUSED_CONTEXT; | |
5557 | PERL_UNUSED_ARG(sv); | |
5558 | return TRUE; | |
5559 | } | |
5560 | ||
a05d7ebb | 5561 | U32 |
e1ec3a88 | 5562 | Perl_parse_unicode_opts(pTHX_ const char **popt) |
a05d7ebb | 5563 | { |
e1ec3a88 | 5564 | const char *p = *popt; |
a05d7ebb JH |
5565 | U32 opt = 0; |
5566 | ||
7918f24d NC |
5567 | PERL_ARGS_ASSERT_PARSE_UNICODE_OPTS; |
5568 | ||
a05d7ebb JH |
5569 | if (*p) { |
5570 | if (isDIGIT(*p)) { | |
5571 | opt = (U32) atoi(p); | |
35da51f7 AL |
5572 | while (isDIGIT(*p)) |
5573 | p++; | |
7c91f477 | 5574 | if (*p && *p != '\n' && *p != '\r') |
a05d7ebb JH |
5575 | Perl_croak(aTHX_ "Unknown Unicode option letter '%c'", *p); |
5576 | } | |
5577 | else { | |
5578 | for (; *p; p++) { | |
5579 | switch (*p) { | |
5580 | case PERL_UNICODE_STDIN: | |
5581 | opt |= PERL_UNICODE_STDIN_FLAG; break; | |
5582 | case PERL_UNICODE_STDOUT: | |
5583 | opt |= PERL_UNICODE_STDOUT_FLAG; break; | |
5584 | case PERL_UNICODE_STDERR: | |
5585 | opt |= PERL_UNICODE_STDERR_FLAG; break; | |
5586 | case PERL_UNICODE_STD: | |
5587 | opt |= PERL_UNICODE_STD_FLAG; break; | |
5588 | case PERL_UNICODE_IN: | |
5589 | opt |= PERL_UNICODE_IN_FLAG; break; | |
5590 | case PERL_UNICODE_OUT: | |
5591 | opt |= PERL_UNICODE_OUT_FLAG; break; | |
5592 | case PERL_UNICODE_INOUT: | |
5593 | opt |= PERL_UNICODE_INOUT_FLAG; break; | |
5594 | case PERL_UNICODE_LOCALE: | |
5595 | opt |= PERL_UNICODE_LOCALE_FLAG; break; | |
5596 | case PERL_UNICODE_ARGV: | |
5597 | opt |= PERL_UNICODE_ARGV_FLAG; break; | |
5a22a2bb NC |
5598 | case PERL_UNICODE_UTF8CACHEASSERT: |
5599 | opt |= PERL_UNICODE_UTF8CACHEASSERT_FLAG; break; | |
a05d7ebb | 5600 | default: |
7c91f477 JH |
5601 | if (*p != '\n' && *p != '\r') |
5602 | Perl_croak(aTHX_ | |
5603 | "Unknown Unicode option letter '%c'", *p); | |
a05d7ebb JH |
5604 | } |
5605 | } | |
5606 | } | |
5607 | } | |
5608 | else | |
5609 | opt = PERL_UNICODE_DEFAULT_FLAGS; | |
5610 | ||
5611 | if (opt & ~PERL_UNICODE_ALL_FLAGS) | |
06e66572 | 5612 | Perl_croak(aTHX_ "Unknown Unicode option value %"UVuf, |
a05d7ebb JH |
5613 | (UV) (opt & ~PERL_UNICODE_ALL_FLAGS)); |
5614 | ||
5615 | *popt = p; | |
5616 | ||
5617 | return opt; | |
5618 | } | |
5619 | ||
132efe8b JH |
5620 | U32 |
5621 | Perl_seed(pTHX) | |
5622 | { | |
97aff369 | 5623 | dVAR; |
132efe8b JH |
5624 | /* |
5625 | * This is really just a quick hack which grabs various garbage | |
5626 | * values. It really should be a real hash algorithm which | |
5627 | * spreads the effect of every input bit onto every output bit, | |
5628 | * if someone who knows about such things would bother to write it. | |
5629 | * Might be a good idea to add that function to CORE as well. | |
5630 | * No numbers below come from careful analysis or anything here, | |
5631 | * except they are primes and SEED_C1 > 1E6 to get a full-width | |
5632 | * value from (tv_sec * SEED_C1 + tv_usec). The multipliers should | |
5633 | * probably be bigger too. | |
5634 | */ | |
5635 | #if RANDBITS > 16 | |
5636 | # define SEED_C1 1000003 | |
5637 | #define SEED_C4 73819 | |
5638 | #else | |
5639 | # define SEED_C1 25747 | |
5640 | #define SEED_C4 20639 | |
5641 | #endif | |
5642 | #define SEED_C2 3 | |
5643 | #define SEED_C3 269 | |
5644 | #define SEED_C5 26107 | |
5645 | ||
5646 | #ifndef PERL_NO_DEV_RANDOM | |
5647 | int fd; | |
5648 | #endif | |
5649 | U32 u; | |
5650 | #ifdef VMS | |
5651 | # include <starlet.h> | |
5652 | /* when[] = (low 32 bits, high 32 bits) of time since epoch | |
5653 | * in 100-ns units, typically incremented ever 10 ms. */ | |
5654 | unsigned int when[2]; | |
5655 | #else | |
5656 | # ifdef HAS_GETTIMEOFDAY | |
5657 | struct timeval when; | |
5658 | # else | |
5659 | Time_t when; | |
5660 | # endif | |
5661 | #endif | |
5662 | ||
5663 | /* This test is an escape hatch, this symbol isn't set by Configure. */ | |
5664 | #ifndef PERL_NO_DEV_RANDOM | |
5665 | #ifndef PERL_RANDOM_DEVICE | |
5666 | /* /dev/random isn't used by default because reads from it will block | |
5667 | * if there isn't enough entropy available. You can compile with | |
5668 | * PERL_RANDOM_DEVICE to it if you'd prefer Perl to block until there | |
5669 | * is enough real entropy to fill the seed. */ | |
5670 | # define PERL_RANDOM_DEVICE "/dev/urandom" | |
5671 | #endif | |
5672 | fd = PerlLIO_open(PERL_RANDOM_DEVICE, 0); | |
5673 | if (fd != -1) { | |
27da23d5 | 5674 | if (PerlLIO_read(fd, (void*)&u, sizeof u) != sizeof u) |
132efe8b JH |
5675 | u = 0; |
5676 | PerlLIO_close(fd); | |
5677 | if (u) | |
5678 | return u; | |
5679 | } | |
5680 | #endif | |
5681 | ||
5682 | #ifdef VMS | |
5683 | _ckvmssts(sys$gettim(when)); | |
5684 | u = (U32)SEED_C1 * when[0] + (U32)SEED_C2 * when[1]; | |
5685 | #else | |
5686 | # ifdef HAS_GETTIMEOFDAY | |
5687 | PerlProc_gettimeofday(&when,NULL); | |
5688 | u = (U32)SEED_C1 * when.tv_sec + (U32)SEED_C2 * when.tv_usec; | |
5689 | # else | |
5690 | (void)time(&when); | |
5691 | u = (U32)SEED_C1 * when; | |
5692 | # endif | |
5693 | #endif | |
5694 | u += SEED_C3 * (U32)PerlProc_getpid(); | |
5695 | u += SEED_C4 * (U32)PTR2UV(PL_stack_sp); | |
5696 | #ifndef PLAN9 /* XXX Plan9 assembler chokes on this; fix needed */ | |
5697 | u += SEED_C5 * (U32)PTR2UV(&when); | |
5698 | #endif | |
5699 | return u; | |
5700 | } | |
5701 | ||
bed60192 | 5702 | UV |
a783c5f4 | 5703 | Perl_get_hash_seed(pTHX) |
bed60192 | 5704 | { |
97aff369 | 5705 | dVAR; |
e1ec3a88 | 5706 | const char *s = PerlEnv_getenv("PERL_HASH_SEED"); |
bed60192 JH |
5707 | UV myseed = 0; |
5708 | ||
5709 | if (s) | |
35da51f7 AL |
5710 | while (isSPACE(*s)) |
5711 | s++; | |
bed60192 JH |
5712 | if (s && isDIGIT(*s)) |
5713 | myseed = (UV)Atoul(s); | |
5714 | else | |
5715 | #ifdef USE_HASH_SEED_EXPLICIT | |
5716 | if (s) | |
5717 | #endif | |
5718 | { | |
5719 | /* Compute a random seed */ | |
5720 | (void)seedDrand01((Rand_seed_t)seed()); | |
bed60192 JH |
5721 | myseed = (UV)(Drand01() * (NV)UV_MAX); |
5722 | #if RANDBITS < (UVSIZE * 8) | |
5723 | /* Since there are not enough randbits to to reach all | |
5724 | * the bits of a UV, the low bits might need extra | |
5725 | * help. Sum in another random number that will | |
5726 | * fill in the low bits. */ | |
5727 | myseed += | |
fa58a56f | 5728 | (UV)(Drand01() * (NV)((((UV)1) << ((UVSIZE * 8 - RANDBITS))) - 1)); |
bed60192 | 5729 | #endif /* RANDBITS < (UVSIZE * 8) */ |
6cfd5ea7 JH |
5730 | if (myseed == 0) { /* Superparanoia. */ |
5731 | myseed = (UV)(Drand01() * (NV)UV_MAX); /* One more chance. */ | |
5732 | if (myseed == 0) | |
5733 | Perl_croak(aTHX_ "Your random numbers are not that random"); | |
5734 | } | |
bed60192 | 5735 | } |
008fb0c0 | 5736 | PL_rehash_seed_set = TRUE; |
bed60192 JH |
5737 | |
5738 | return myseed; | |
5739 | } | |
27da23d5 | 5740 | |
ed221c57 AL |
5741 | #ifdef USE_ITHREADS |
5742 | bool | |
5743 | Perl_stashpv_hvname_match(pTHX_ const COP *c, const HV *hv) | |
5744 | { | |
5745 | const char * const stashpv = CopSTASHPV(c); | |
5746 | const char * const name = HvNAME_get(hv); | |
96a5add6 | 5747 | PERL_UNUSED_CONTEXT; |
7918f24d | 5748 | PERL_ARGS_ASSERT_STASHPV_HVNAME_MATCH; |
ed221c57 AL |
5749 | |
5750 | if (stashpv == name) | |
5751 | return TRUE; | |
5752 | if (stashpv && name) | |
5753 | if (strEQ(stashpv, name)) | |
5754 | return TRUE; | |
5755 | return FALSE; | |
5756 | } | |
5757 | #endif | |
5758 | ||
5759 | ||
27da23d5 JH |
5760 | #ifdef PERL_GLOBAL_STRUCT |
5761 | ||
bae1192d JH |
5762 | #define PERL_GLOBAL_STRUCT_INIT |
5763 | #include "opcode.h" /* the ppaddr and check */ | |
5764 | ||
27da23d5 JH |
5765 | struct perl_vars * |
5766 | Perl_init_global_struct(pTHX) | |
5767 | { | |
5768 | struct perl_vars *plvarsp = NULL; | |
bae1192d | 5769 | # ifdef PERL_GLOBAL_STRUCT |
7452cf6a AL |
5770 | const IV nppaddr = sizeof(Gppaddr)/sizeof(Perl_ppaddr_t); |
5771 | const IV ncheck = sizeof(Gcheck) /sizeof(Perl_check_t); | |
27da23d5 JH |
5772 | # ifdef PERL_GLOBAL_STRUCT_PRIVATE |
5773 | /* PerlMem_malloc() because can't use even safesysmalloc() this early. */ | |
5774 | plvarsp = (struct perl_vars*)PerlMem_malloc(sizeof(struct perl_vars)); | |
5775 | if (!plvarsp) | |
5776 | exit(1); | |
5777 | # else | |
5778 | plvarsp = PL_VarsPtr; | |
5779 | # endif /* PERL_GLOBAL_STRUCT_PRIVATE */ | |
aadb217d JH |
5780 | # undef PERLVAR |
5781 | # undef PERLVARA | |
5782 | # undef PERLVARI | |
5783 | # undef PERLVARIC | |
5784 | # undef PERLVARISC | |
27da23d5 JH |
5785 | # define PERLVAR(var,type) /**/ |
5786 | # define PERLVARA(var,n,type) /**/ | |
5787 | # define PERLVARI(var,type,init) plvarsp->var = init; | |
5788 | # define PERLVARIC(var,type,init) plvarsp->var = init; | |
5789 | # define PERLVARISC(var,init) Copy(init, plvarsp->var, sizeof(init), char); | |
5790 | # include "perlvars.h" | |
5791 | # undef PERLVAR | |
5792 | # undef PERLVARA | |
5793 | # undef PERLVARI | |
5794 | # undef PERLVARIC | |
5795 | # undef PERLVARISC | |
5796 | # ifdef PERL_GLOBAL_STRUCT | |
bae1192d JH |
5797 | plvarsp->Gppaddr = |
5798 | (Perl_ppaddr_t*) | |
5799 | PerlMem_malloc(nppaddr * sizeof(Perl_ppaddr_t)); | |
27da23d5 JH |
5800 | if (!plvarsp->Gppaddr) |
5801 | exit(1); | |
bae1192d JH |
5802 | plvarsp->Gcheck = |
5803 | (Perl_check_t*) | |
5804 | PerlMem_malloc(ncheck * sizeof(Perl_check_t)); | |
27da23d5 JH |
5805 | if (!plvarsp->Gcheck) |
5806 | exit(1); | |
5807 | Copy(Gppaddr, plvarsp->Gppaddr, nppaddr, Perl_ppaddr_t); | |
5808 | Copy(Gcheck, plvarsp->Gcheck, ncheck, Perl_check_t); | |
5809 | # endif | |
5810 | # ifdef PERL_SET_VARS | |
5811 | PERL_SET_VARS(plvarsp); | |
5812 | # endif | |
bae1192d JH |
5813 | # undef PERL_GLOBAL_STRUCT_INIT |
5814 | # endif | |
27da23d5 JH |
5815 | return plvarsp; |
5816 | } | |
5817 | ||
5818 | #endif /* PERL_GLOBAL_STRUCT */ | |
5819 | ||
5820 | #ifdef PERL_GLOBAL_STRUCT | |
5821 | ||
5822 | void | |
5823 | Perl_free_global_struct(pTHX_ struct perl_vars *plvarsp) | |
5824 | { | |
7918f24d | 5825 | PERL_ARGS_ASSERT_FREE_GLOBAL_STRUCT; |
bae1192d | 5826 | # ifdef PERL_GLOBAL_STRUCT |
27da23d5 JH |
5827 | # ifdef PERL_UNSET_VARS |
5828 | PERL_UNSET_VARS(plvarsp); | |
5829 | # endif | |
5830 | free(plvarsp->Gppaddr); | |
5831 | free(plvarsp->Gcheck); | |
bae1192d | 5832 | # ifdef PERL_GLOBAL_STRUCT_PRIVATE |
27da23d5 | 5833 | free(plvarsp); |
bae1192d JH |
5834 | # endif |
5835 | # endif | |
27da23d5 JH |
5836 | } |
5837 | ||
5838 | #endif /* PERL_GLOBAL_STRUCT */ | |
5839 | ||
fe4f188c JH |
5840 | #ifdef PERL_MEM_LOG |
5841 | ||
1cd8acb5 | 5842 | /* -DPERL_MEM_LOG: the Perl_mem_log_..() is compiled, including the |
73d1d973 JC |
5843 | * the default implementation, unless -DPERL_MEM_LOG_NOIMPL is also |
5844 | * given, and you supply your own implementation. | |
65ceff02 | 5845 | * |
2e5b5004 | 5846 | * The default implementation reads a single env var, PERL_MEM_LOG, |
1cd8acb5 JC |
5847 | * expecting one or more of the following: |
5848 | * | |
5849 | * \d+ - fd fd to write to : must be 1st (atoi) | |
2e5b5004 | 5850 | * 'm' - memlog was PERL_MEM_LOG=1 |
1cd8acb5 JC |
5851 | * 's' - svlog was PERL_SV_LOG=1 |
5852 | * 't' - timestamp was PERL_MEM_LOG_TIMESTAMP=1 | |
0b0ab801 | 5853 | * |
1cd8acb5 JC |
5854 | * This makes the logger controllable enough that it can reasonably be |
5855 | * added to the system perl. | |
65ceff02 JH |
5856 | */ |
5857 | ||
1cd8acb5 | 5858 | /* -DPERL_MEM_LOG_SPRINTF_BUF_SIZE=X: size of a (stack-allocated) buffer |
65ceff02 JH |
5859 | * the Perl_mem_log_...() will use (either via sprintf or snprintf). |
5860 | */ | |
e352bcff JH |
5861 | #define PERL_MEM_LOG_SPRINTF_BUF_SIZE 128 |
5862 | ||
1cd8acb5 JC |
5863 | /* -DPERL_MEM_LOG_FD=N: the file descriptor the Perl_mem_log_...() |
5864 | * writes to. In the default logger, this is settable at runtime. | |
65ceff02 JH |
5865 | */ |
5866 | #ifndef PERL_MEM_LOG_FD | |
5867 | # define PERL_MEM_LOG_FD 2 /* If STDERR is too boring for you. */ | |
5868 | #endif | |
5869 | ||
73d1d973 | 5870 | #ifndef PERL_MEM_LOG_NOIMPL |
d7a2c63c MHM |
5871 | |
5872 | # ifdef DEBUG_LEAKING_SCALARS | |
5873 | # define SV_LOG_SERIAL_FMT " [%lu]" | |
5874 | # define _SV_LOG_SERIAL_ARG(sv) , (unsigned long) (sv)->sv_debug_serial | |
5875 | # else | |
5876 | # define SV_LOG_SERIAL_FMT | |
5877 | # define _SV_LOG_SERIAL_ARG(sv) | |
5878 | # endif | |
5879 | ||
0b0ab801 | 5880 | static void |
73d1d973 JC |
5881 | S_mem_log_common(enum mem_log_type mlt, const UV n, |
5882 | const UV typesize, const char *type_name, const SV *sv, | |
5883 | Malloc_t oldalloc, Malloc_t newalloc, | |
5884 | const char *filename, const int linenumber, | |
5885 | const char *funcname) | |
0b0ab801 | 5886 | { |
1cd8acb5 | 5887 | const char *pmlenv; |
4ca7bcef | 5888 | |
1cd8acb5 | 5889 | PERL_ARGS_ASSERT_MEM_LOG_COMMON; |
4ca7bcef | 5890 | |
1cd8acb5 JC |
5891 | pmlenv = PerlEnv_getenv("PERL_MEM_LOG"); |
5892 | if (!pmlenv) | |
5893 | return; | |
5894 | if (mlt < MLT_NEW_SV ? strchr(pmlenv,'m') : strchr(pmlenv,'s')) | |
65ceff02 JH |
5895 | { |
5896 | /* We can't use SVs or PerlIO for obvious reasons, | |
5897 | * so we'll use stdio and low-level IO instead. */ | |
5898 | char buf[PERL_MEM_LOG_SPRINTF_BUF_SIZE]; | |
1cd8acb5 | 5899 | |
5b692037 | 5900 | # ifdef HAS_GETTIMEOFDAY |
0b0ab801 MHM |
5901 | # define MEM_LOG_TIME_FMT "%10d.%06d: " |
5902 | # define MEM_LOG_TIME_ARG (int)tv.tv_sec, (int)tv.tv_usec | |
5903 | struct timeval tv; | |
65ceff02 | 5904 | gettimeofday(&tv, 0); |
0b0ab801 MHM |
5905 | # else |
5906 | # define MEM_LOG_TIME_FMT "%10d: " | |
5907 | # define MEM_LOG_TIME_ARG (int)when | |
5908 | Time_t when; | |
5909 | (void)time(&when); | |
5b692037 JH |
5910 | # endif |
5911 | /* If there are other OS specific ways of hires time than | |
40d04ec4 | 5912 | * gettimeofday() (see ext/Time-HiRes), the easiest way is |
5b692037 JH |
5913 | * probably that they would be used to fill in the struct |
5914 | * timeval. */ | |
65ceff02 | 5915 | { |
0b0ab801 | 5916 | STRLEN len; |
1cd8acb5 JC |
5917 | int fd = atoi(pmlenv); |
5918 | if (!fd) | |
5919 | fd = PERL_MEM_LOG_FD; | |
0b0ab801 | 5920 | |
1cd8acb5 | 5921 | if (strchr(pmlenv, 't')) { |
0b0ab801 MHM |
5922 | len = my_snprintf(buf, sizeof(buf), |
5923 | MEM_LOG_TIME_FMT, MEM_LOG_TIME_ARG); | |
5924 | PerlLIO_write(fd, buf, len); | |
5925 | } | |
0b0ab801 MHM |
5926 | switch (mlt) { |
5927 | case MLT_ALLOC: | |
5928 | len = my_snprintf(buf, sizeof(buf), | |
5929 | "alloc: %s:%d:%s: %"IVdf" %"UVuf | |
5930 | " %s = %"IVdf": %"UVxf"\n", | |
5931 | filename, linenumber, funcname, n, typesize, | |
bef8a128 | 5932 | type_name, n * typesize, PTR2UV(newalloc)); |
0b0ab801 MHM |
5933 | break; |
5934 | case MLT_REALLOC: | |
5935 | len = my_snprintf(buf, sizeof(buf), | |
5936 | "realloc: %s:%d:%s: %"IVdf" %"UVuf | |
5937 | " %s = %"IVdf": %"UVxf" -> %"UVxf"\n", | |
5938 | filename, linenumber, funcname, n, typesize, | |
bef8a128 | 5939 | type_name, n * typesize, PTR2UV(oldalloc), |
0b0ab801 MHM |
5940 | PTR2UV(newalloc)); |
5941 | break; | |
5942 | case MLT_FREE: | |
5943 | len = my_snprintf(buf, sizeof(buf), | |
5944 | "free: %s:%d:%s: %"UVxf"\n", | |
5945 | filename, linenumber, funcname, | |
5946 | PTR2UV(oldalloc)); | |
5947 | break; | |
d7a2c63c MHM |
5948 | case MLT_NEW_SV: |
5949 | case MLT_DEL_SV: | |
5950 | len = my_snprintf(buf, sizeof(buf), | |
5951 | "%s_SV: %s:%d:%s: %"UVxf SV_LOG_SERIAL_FMT "\n", | |
5952 | mlt == MLT_NEW_SV ? "new" : "del", | |
5953 | filename, linenumber, funcname, | |
5954 | PTR2UV(sv) _SV_LOG_SERIAL_ARG(sv)); | |
5955 | break; | |
73d1d973 JC |
5956 | default: |
5957 | len = 0; | |
0b0ab801 MHM |
5958 | } |
5959 | PerlLIO_write(fd, buf, len); | |
65ceff02 JH |
5960 | } |
5961 | } | |
0b0ab801 | 5962 | } |
73d1d973 JC |
5963 | #endif /* !PERL_MEM_LOG_NOIMPL */ |
5964 | ||
5965 | #ifndef PERL_MEM_LOG_NOIMPL | |
5966 | # define \ | |
5967 | mem_log_common_if(alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) \ | |
5968 | mem_log_common (alty, num, tysz, tynm, sv, oal, nal, flnm, ln, fnnm) | |
5969 | #else | |
5970 | /* this is suboptimal, but bug compatible. User is providing their | |
5971 | own implemenation, but is getting these functions anyway, and they | |
5972 | do nothing. But _NOIMPL users should be able to cope or fix */ | |
5973 | # define \ | |
5974 | mem_log_common_if(alty, num, tysz, tynm, u, oal, nal, flnm, ln, fnnm) \ | |
5975 | /* mem_log_common_if_PERL_MEM_LOG_NOIMPL */ | |
0b0ab801 MHM |
5976 | #endif |
5977 | ||
5978 | Malloc_t | |
73d1d973 JC |
5979 | Perl_mem_log_alloc(const UV n, const UV typesize, const char *type_name, |
5980 | Malloc_t newalloc, | |
5981 | const char *filename, const int linenumber, | |
5982 | const char *funcname) | |
5983 | { | |
5984 | mem_log_common_if(MLT_ALLOC, n, typesize, type_name, | |
5985 | NULL, NULL, newalloc, | |
5986 | filename, linenumber, funcname); | |
fe4f188c JH |
5987 | return newalloc; |
5988 | } | |
5989 | ||
5990 | Malloc_t | |
73d1d973 JC |
5991 | Perl_mem_log_realloc(const UV n, const UV typesize, const char *type_name, |
5992 | Malloc_t oldalloc, Malloc_t newalloc, | |
5993 | const char *filename, const int linenumber, | |
5994 | const char *funcname) | |
5995 | { | |
5996 | mem_log_common_if(MLT_REALLOC, n, typesize, type_name, | |
5997 | NULL, oldalloc, newalloc, | |
5998 | filename, linenumber, funcname); | |
fe4f188c JH |
5999 | return newalloc; |
6000 | } | |
6001 | ||
6002 | Malloc_t | |
73d1d973 JC |
6003 | Perl_mem_log_free(Malloc_t oldalloc, |
6004 | const char *filename, const int linenumber, | |
6005 | const char *funcname) | |
fe4f188c | 6006 | { |
73d1d973 JC |
6007 | mem_log_common_if(MLT_FREE, 0, 0, "", NULL, oldalloc, NULL, |
6008 | filename, linenumber, funcname); | |
fe4f188c JH |
6009 | return oldalloc; |
6010 | } | |
6011 | ||
d7a2c63c | 6012 | void |
73d1d973 JC |
6013 | Perl_mem_log_new_sv(const SV *sv, |
6014 | const char *filename, const int linenumber, | |
6015 | const char *funcname) | |
d7a2c63c | 6016 | { |
73d1d973 JC |
6017 | mem_log_common_if(MLT_NEW_SV, 0, 0, "", sv, NULL, NULL, |
6018 | filename, linenumber, funcname); | |
d7a2c63c MHM |
6019 | } |
6020 | ||
6021 | void | |
73d1d973 JC |
6022 | Perl_mem_log_del_sv(const SV *sv, |
6023 | const char *filename, const int linenumber, | |
6024 | const char *funcname) | |
d7a2c63c | 6025 | { |
73d1d973 JC |
6026 | mem_log_common_if(MLT_DEL_SV, 0, 0, "", sv, NULL, NULL, |
6027 | filename, linenumber, funcname); | |
d7a2c63c MHM |
6028 | } |
6029 | ||
fe4f188c JH |
6030 | #endif /* PERL_MEM_LOG */ |
6031 | ||
66610fdd | 6032 | /* |
ce582cee NC |
6033 | =for apidoc my_sprintf |
6034 | ||
6035 | The C library C<sprintf>, wrapped if necessary, to ensure that it will return | |
6036 | the length of the string written to the buffer. Only rare pre-ANSI systems | |
6037 | need the wrapper function - usually this is a direct call to C<sprintf>. | |
6038 | ||
6039 | =cut | |
6040 | */ | |
6041 | #ifndef SPRINTF_RETURNS_STRLEN | |
6042 | int | |
6043 | Perl_my_sprintf(char *buffer, const char* pat, ...) | |
6044 | { | |
6045 | va_list args; | |
7918f24d | 6046 | PERL_ARGS_ASSERT_MY_SPRINTF; |
ce582cee NC |
6047 | va_start(args, pat); |
6048 | vsprintf(buffer, pat, args); | |
6049 | va_end(args); | |
6050 | return strlen(buffer); | |
6051 | } | |
6052 | #endif | |
6053 | ||
d9fad198 JH |
6054 | /* |
6055 | =for apidoc my_snprintf | |
6056 | ||
6057 | The C library C<snprintf> functionality, if available and | |
5b692037 | 6058 | standards-compliant (uses C<vsnprintf>, actually). However, if the |
d9fad198 | 6059 | C<vsnprintf> is not available, will unfortunately use the unsafe |
5b692037 JH |
6060 | C<vsprintf> which can overrun the buffer (there is an overrun check, |
6061 | but that may be too late). Consider using C<sv_vcatpvf> instead, or | |
6062 | getting C<vsnprintf>. | |
d9fad198 JH |
6063 | |
6064 | =cut | |
6065 | */ | |
6066 | int | |
6067 | Perl_my_snprintf(char *buffer, const Size_t len, const char *format, ...) | |
d9fad198 JH |
6068 | { |
6069 | dTHX; | |
6070 | int retval; | |
6071 | va_list ap; | |
7918f24d | 6072 | PERL_ARGS_ASSERT_MY_SNPRINTF; |
d9fad198 | 6073 | va_start(ap, format); |
5b692037 | 6074 | #ifdef HAS_VSNPRINTF |
d9fad198 JH |
6075 | retval = vsnprintf(buffer, len, format, ap); |
6076 | #else | |
6077 | retval = vsprintf(buffer, format, ap); | |
6078 | #endif | |
6079 | va_end(ap); | |
1208b3dd | 6080 | /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */ |
625dac9d | 6081 | if (retval < 0 || (len > 0 && (Size_t)retval >= len)) |
5b692037 | 6082 | Perl_croak(aTHX_ "panic: my_snprintf buffer overflow"); |
d9fad198 JH |
6083 | return retval; |
6084 | } | |
6085 | ||
6086 | /* | |
6087 | =for apidoc my_vsnprintf | |
6088 | ||
5b692037 JH |
6089 | The C library C<vsnprintf> if available and standards-compliant. |
6090 | However, if if the C<vsnprintf> is not available, will unfortunately | |
6091 | use the unsafe C<vsprintf> which can overrun the buffer (there is an | |
6092 | overrun check, but that may be too late). Consider using | |
6093 | C<sv_vcatpvf> instead, or getting C<vsnprintf>. | |
d9fad198 JH |
6094 | |
6095 | =cut | |
6096 | */ | |
6097 | int | |
6098 | Perl_my_vsnprintf(char *buffer, const Size_t len, const char *format, va_list ap) | |
d9fad198 JH |
6099 | { |
6100 | dTHX; | |
6101 | int retval; | |
d9fad198 JH |
6102 | #ifdef NEED_VA_COPY |
6103 | va_list apc; | |
7918f24d NC |
6104 | |
6105 | PERL_ARGS_ASSERT_MY_VSNPRINTF; | |
6106 | ||
239fec62 | 6107 | Perl_va_copy(ap, apc); |
5b692037 | 6108 | # ifdef HAS_VSNPRINTF |
d9fad198 JH |
6109 | retval = vsnprintf(buffer, len, format, apc); |
6110 | # else | |
6111 | retval = vsprintf(buffer, format, apc); | |
6112 | # endif | |
6113 | #else | |
5b692037 | 6114 | # ifdef HAS_VSNPRINTF |
d9fad198 JH |
6115 | retval = vsnprintf(buffer, len, format, ap); |
6116 | # else | |
6117 | retval = vsprintf(buffer, format, ap); | |
6118 | # endif | |
5b692037 | 6119 | #endif /* #ifdef NEED_VA_COPY */ |
1208b3dd | 6120 | /* vsnprintf() shows failure with >= len, vsprintf() with < 0 */ |
625dac9d | 6121 | if (retval < 0 || (len > 0 && (Size_t)retval >= len)) |
5b692037 | 6122 | Perl_croak(aTHX_ "panic: my_vsnprintf buffer overflow"); |
d9fad198 JH |
6123 | return retval; |
6124 | } | |
6125 | ||
b0269e46 AB |
6126 | void |
6127 | Perl_my_clearenv(pTHX) | |
6128 | { | |
6129 | dVAR; | |
6130 | #if ! defined(PERL_MICRO) | |
6131 | # if defined(PERL_IMPLICIT_SYS) || defined(WIN32) | |
6132 | PerlEnv_clearenv(); | |
6133 | # else /* ! (PERL_IMPLICIT_SYS || WIN32) */ | |
6134 | # if defined(USE_ENVIRON_ARRAY) | |
6135 | # if defined(USE_ITHREADS) | |
6136 | /* only the parent thread can clobber the process environment */ | |
6137 | if (PL_curinterp == aTHX) | |
6138 | # endif /* USE_ITHREADS */ | |
6139 | { | |
6140 | # if ! defined(PERL_USE_SAFE_PUTENV) | |
6141 | if ( !PL_use_safe_putenv) { | |
6142 | I32 i; | |
6143 | if (environ == PL_origenviron) | |
6144 | environ = (char**)safesysmalloc(sizeof(char*)); | |
6145 | else | |
6146 | for (i = 0; environ[i]; i++) | |
6147 | (void)safesysfree(environ[i]); | |
6148 | } | |
6149 | environ[0] = NULL; | |
6150 | # else /* PERL_USE_SAFE_PUTENV */ | |
6151 | # if defined(HAS_CLEARENV) | |
6152 | (void)clearenv(); | |
6153 | # elif defined(HAS_UNSETENV) | |
6154 | int bsiz = 80; /* Most envvar names will be shorter than this. */ | |
d1307786 JH |
6155 | int bufsiz = bsiz * sizeof(char); /* sizeof(char) paranoid? */ |
6156 | char *buf = (char*)safesysmalloc(bufsiz); | |
b0269e46 AB |
6157 | while (*environ != NULL) { |
6158 | char *e = strchr(*environ, '='); | |
b57a0404 | 6159 | int l = e ? e - *environ : (int)strlen(*environ); |
b0269e46 AB |
6160 | if (bsiz < l + 1) { |
6161 | (void)safesysfree(buf); | |
1bdfa2de | 6162 | bsiz = l + 1; /* + 1 for the \0. */ |
d1307786 | 6163 | buf = (char*)safesysmalloc(bufsiz); |
b0269e46 | 6164 | } |
82d8bb49 NC |
6165 | memcpy(buf, *environ, l); |
6166 | buf[l] = '\0'; | |
b0269e46 AB |
6167 | (void)unsetenv(buf); |
6168 | } | |
6169 | (void)safesysfree(buf); | |
6170 | # else /* ! HAS_CLEARENV && ! HAS_UNSETENV */ | |
6171 | /* Just null environ and accept the leakage. */ | |
6172 | *environ = NULL; | |
6173 | # endif /* HAS_CLEARENV || HAS_UNSETENV */ | |
6174 | # endif /* ! PERL_USE_SAFE_PUTENV */ | |
6175 | } | |
6176 | # endif /* USE_ENVIRON_ARRAY */ | |
6177 | # endif /* PERL_IMPLICIT_SYS || WIN32 */ | |
6178 | #endif /* PERL_MICRO */ | |
6179 | } | |
6180 | ||
f16dd614 DM |
6181 | #ifdef PERL_IMPLICIT_CONTEXT |
6182 | ||
53d44271 | 6183 | /* Implements the MY_CXT_INIT macro. The first time a module is loaded, |
f16dd614 DM |
6184 | the global PL_my_cxt_index is incremented, and that value is assigned to |
6185 | that module's static my_cxt_index (who's address is passed as an arg). | |
6186 | Then, for each interpreter this function is called for, it makes sure a | |
6187 | void* slot is available to hang the static data off, by allocating or | |
6188 | extending the interpreter's PL_my_cxt_list array */ | |
6189 | ||
53d44271 | 6190 | #ifndef PERL_GLOBAL_STRUCT_PRIVATE |
f16dd614 DM |
6191 | void * |
6192 | Perl_my_cxt_init(pTHX_ int *index, size_t size) | |
6193 | { | |
97aff369 | 6194 | dVAR; |
f16dd614 | 6195 | void *p; |
7918f24d | 6196 | PERL_ARGS_ASSERT_MY_CXT_INIT; |
f16dd614 DM |
6197 | if (*index == -1) { |
6198 | /* this module hasn't been allocated an index yet */ | |
8703a9a4 | 6199 | #if defined(USE_ITHREADS) |
f16dd614 | 6200 | MUTEX_LOCK(&PL_my_ctx_mutex); |
8703a9a4 | 6201 | #endif |
f16dd614 | 6202 | *index = PL_my_cxt_index++; |
8703a9a4 | 6203 | #if defined(USE_ITHREADS) |
f16dd614 | 6204 | MUTEX_UNLOCK(&PL_my_ctx_mutex); |
8703a9a4 | 6205 | #endif |
f16dd614 DM |
6206 | } |
6207 | ||
6208 | /* make sure the array is big enough */ | |
4c901e72 DM |
6209 | if (PL_my_cxt_size <= *index) { |
6210 | if (PL_my_cxt_size) { | |
6211 | while (PL_my_cxt_size <= *index) | |
f16dd614 DM |
6212 | PL_my_cxt_size *= 2; |
6213 | Renew(PL_my_cxt_list, PL_my_cxt_size, void *); | |
6214 | } | |
6215 | else { | |
6216 | PL_my_cxt_size = 16; | |
6217 | Newx(PL_my_cxt_list, PL_my_cxt_size, void *); | |
6218 | } | |
6219 | } | |
6220 | /* newSV() allocates one more than needed */ | |
6221 | p = (void*)SvPVX(newSV(size-1)); | |
6222 | PL_my_cxt_list[*index] = p; | |
6223 | Zero(p, size, char); | |
6224 | return p; | |
6225 | } | |
53d44271 JH |
6226 | |
6227 | #else /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */ | |
6228 | ||
6229 | int | |
6230 | Perl_my_cxt_index(pTHX_ const char *my_cxt_key) | |
6231 | { | |
6232 | dVAR; | |
6233 | int index; | |
6234 | ||
7918f24d NC |
6235 | PERL_ARGS_ASSERT_MY_CXT_INDEX; |
6236 | ||
53d44271 JH |
6237 | for (index = 0; index < PL_my_cxt_index; index++) { |
6238 | const char *key = PL_my_cxt_keys[index]; | |
6239 | /* try direct pointer compare first - there are chances to success, | |
6240 | * and it's much faster. | |
6241 | */ | |
6242 | if ((key == my_cxt_key) || strEQ(key, my_cxt_key)) | |
6243 | return index; | |
6244 | } | |
6245 | return -1; | |
6246 | } | |
6247 | ||
6248 | void * | |
6249 | Perl_my_cxt_init(pTHX_ const char *my_cxt_key, size_t size) | |
6250 | { | |
6251 | dVAR; | |
6252 | void *p; | |
6253 | int index; | |
6254 | ||
7918f24d NC |
6255 | PERL_ARGS_ASSERT_MY_CXT_INIT; |
6256 | ||
53d44271 JH |
6257 | index = Perl_my_cxt_index(aTHX_ my_cxt_key); |
6258 | if (index == -1) { | |
6259 | /* this module hasn't been allocated an index yet */ | |
8703a9a4 | 6260 | #if defined(USE_ITHREADS) |
53d44271 | 6261 | MUTEX_LOCK(&PL_my_ctx_mutex); |
8703a9a4 | 6262 | #endif |
53d44271 | 6263 | index = PL_my_cxt_index++; |
8703a9a4 | 6264 | #if defined(USE_ITHREADS) |
53d44271 | 6265 | MUTEX_UNLOCK(&PL_my_ctx_mutex); |
8703a9a4 | 6266 | #endif |
53d44271 JH |
6267 | } |
6268 | ||
6269 | /* make sure the array is big enough */ | |
6270 | if (PL_my_cxt_size <= index) { | |
6271 | int old_size = PL_my_cxt_size; | |
6272 | int i; | |
6273 | if (PL_my_cxt_size) { | |
6274 | while (PL_my_cxt_size <= index) | |
6275 | PL_my_cxt_size *= 2; | |
6276 | Renew(PL_my_cxt_list, PL_my_cxt_size, void *); | |
6277 | Renew(PL_my_cxt_keys, PL_my_cxt_size, const char *); | |
6278 | } | |
6279 | else { | |
6280 | PL_my_cxt_size = 16; | |
6281 | Newx(PL_my_cxt_list, PL_my_cxt_size, void *); | |
6282 | Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *); | |
6283 | } | |
6284 | for (i = old_size; i < PL_my_cxt_size; i++) { | |
6285 | PL_my_cxt_keys[i] = 0; | |
6286 | PL_my_cxt_list[i] = 0; | |
6287 | } | |
6288 | } | |
6289 | PL_my_cxt_keys[index] = my_cxt_key; | |
6290 | /* newSV() allocates one more than needed */ | |
6291 | p = (void*)SvPVX(newSV(size-1)); | |
6292 | PL_my_cxt_list[index] = p; | |
6293 | Zero(p, size, char); | |
6294 | return p; | |
6295 | } | |
6296 | #endif /* #ifndef PERL_GLOBAL_STRUCT_PRIVATE */ | |
6297 | #endif /* PERL_IMPLICIT_CONTEXT */ | |
f16dd614 | 6298 | |
a6cc4119 SP |
6299 | #ifndef HAS_STRLCAT |
6300 | Size_t | |
6301 | Perl_my_strlcat(char *dst, const char *src, Size_t size) | |
6302 | { | |
6303 | Size_t used, length, copy; | |
6304 | ||
6305 | used = strlen(dst); | |
6306 | length = strlen(src); | |
6307 | if (size > 0 && used < size - 1) { | |
6308 | copy = (length >= size - used) ? size - used - 1 : length; | |
6309 | memcpy(dst + used, src, copy); | |
6310 | dst[used + copy] = '\0'; | |
6311 | } | |
6312 | return used + length; | |
6313 | } | |
6314 | #endif | |
6315 | ||
6316 | #ifndef HAS_STRLCPY | |
6317 | Size_t | |
6318 | Perl_my_strlcpy(char *dst, const char *src, Size_t size) | |
6319 | { | |
6320 | Size_t length, copy; | |
6321 | ||
6322 | length = strlen(src); | |
6323 | if (size > 0) { | |
6324 | copy = (length >= size) ? size - 1 : length; | |
6325 | memcpy(dst, src, copy); | |
6326 | dst[copy] = '\0'; | |
6327 | } | |
6328 | return length; | |
6329 | } | |
6330 | #endif | |
6331 | ||
17dd9954 JH |
6332 | #if defined(_MSC_VER) && (_MSC_VER >= 1300) && (_MSC_VER < 1400) && (WINVER < 0x0500) |
6333 | /* VC7 or 7.1, building with pre-VC7 runtime libraries. */ | |
6334 | long _ftol( double ); /* Defined by VC6 C libs. */ | |
6335 | long _ftol2( double dblSource ) { return _ftol( dblSource ); } | |
6336 | #endif | |
6337 | ||
c51f309c NC |
6338 | void |
6339 | Perl_get_db_sub(pTHX_ SV **svp, CV *cv) | |
6340 | { | |
6341 | dVAR; | |
6342 | SV * const dbsv = GvSVn(PL_DBsub); | |
6343 | /* We do not care about using sv to call CV; | |
6344 | * it's for informational purposes only. | |
6345 | */ | |
6346 | ||
7918f24d NC |
6347 | PERL_ARGS_ASSERT_GET_DB_SUB; |
6348 | ||
c51f309c NC |
6349 | save_item(dbsv); |
6350 | if (!PERLDB_SUB_NN) { | |
6351 | GV * const gv = CvGV(cv); | |
6352 | ||
6353 | if ( svp && ((CvFLAGS(cv) & (CVf_ANON | CVf_CLONED)) | |
6354 | || strEQ(GvNAME(gv), "END") | |
6355 | || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */ | |
159b6efe NC |
6356 | !( (SvTYPE(*svp) == SVt_PVGV) |
6357 | && (GvCV((const GV *)*svp) == cv) )))) { | |
c51f309c NC |
6358 | /* Use GV from the stack as a fallback. */ |
6359 | /* GV is potentially non-unique, or contain different CV. */ | |
daba3364 | 6360 | SV * const tmp = newRV(MUTABLE_SV(cv)); |
c51f309c NC |
6361 | sv_setsv(dbsv, tmp); |
6362 | SvREFCNT_dec(tmp); | |
6363 | } | |
6364 | else { | |
6365 | gv_efullname3(dbsv, gv, NULL); | |
6366 | } | |
6367 | } | |
6368 | else { | |
6369 | const int type = SvTYPE(dbsv); | |
6370 | if (type < SVt_PVIV && type != SVt_IV) | |
6371 | sv_upgrade(dbsv, SVt_PVIV); | |
6372 | (void)SvIOK_on(dbsv); | |
6373 | SvIV_set(dbsv, PTR2IV(cv)); /* Do it the quickest way */ | |
6374 | } | |
6375 | } | |
6376 | ||
3497a01f | 6377 | int |
08ea85eb | 6378 | Perl_my_dirfd(pTHX_ DIR * dir) { |
3497a01f SP |
6379 | |
6380 | /* Most dirfd implementations have problems when passed NULL. */ | |
6381 | if(!dir) | |
6382 | return -1; | |
6383 | #ifdef HAS_DIRFD | |
6384 | return dirfd(dir); | |
6385 | #elif defined(HAS_DIR_DD_FD) | |
6386 | return dir->dd_fd; | |
6387 | #else | |
6388 | Perl_die(aTHX_ PL_no_func, "dirfd"); | |
6389 | /* NOT REACHED */ | |
6390 | return 0; | |
6391 | #endif | |
6392 | } | |
6393 | ||
f7e71195 AB |
6394 | REGEXP * |
6395 | Perl_get_re_arg(pTHX_ SV *sv) { | |
f7e71195 AB |
6396 | |
6397 | if (sv) { | |
6398 | if (SvMAGICAL(sv)) | |
6399 | mg_get(sv); | |
df052ff8 BM |
6400 | if (SvROK(sv)) |
6401 | sv = MUTABLE_SV(SvRV(sv)); | |
6402 | if (SvTYPE(sv) == SVt_REGEXP) | |
6403 | return (REGEXP*) sv; | |
f7e71195 AB |
6404 | } |
6405 | ||
6406 | return NULL; | |
6407 | } | |
6408 | ||
ce582cee | 6409 | /* |
66610fdd RGS |
6410 | * Local variables: |
6411 | * c-indentation-style: bsd | |
6412 | * c-basic-offset: 4 | |
6413 | * indent-tabs-mode: t | |
6414 | * End: | |
6415 | * | |
37442d52 RGS |
6416 | * ex: set ts=8 sts=4 sw=4 noet: |
6417 | */ |