3 * Copyright (c) 1991-1994, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "Very useful, no doubt, that was to Saruman; yet it seems that he was
12 * not content." --Gandalf
18 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
22 /* Omit this -- it causes too much grief on mixed systems.
32 /* Put this after #includes because fork and vfork prototypes may
43 # include <sys/file.h>
49 static void xstat _((void));
54 /* paranoid version of malloc */
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.
72 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size) FLUSH;
78 croak("panic: malloc");
80 ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
81 #if !(defined(I286) || defined(atarist))
82 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%x: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
84 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) malloc %ld bytes\n",ptr,an++,(long)size));
91 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
97 /* paranoid version of realloc */
100 saferealloc(where,size)
109 #if !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE)
111 #endif /* !defined(STANDARD_C) && !defined(HAS_REALLOC_PROTOTYPE) */
115 PerlIO_printf(PerlIO_stderr(), "Reallocation too large: %lx\n", size) FLUSH;
120 croak("Null realloc");
123 croak("panic: realloc");
125 ptr = realloc(where,size?size:1); /* realloc(0) is NASTY on our system */
127 #if !(defined(I286) || defined(atarist))
129 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) rfree\n",where,an++);
130 PerlIO_printf(Perl_debug_log, "0x%x: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
134 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) rfree\n",where,an++);
135 PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) realloc %ld bytes\n",ptr,an++,(long)size);
144 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
150 /* safe version of free */
156 #if !(defined(I286) || defined(atarist))
157 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%x: (%05d) free\n",where,an++));
159 DEBUG_m( PerlIO_printf(Perl_debug_log, "0x%lx: (%05d) free\n",where,an++));
167 /* safe version of calloc */
170 safecalloc(count, size)
177 if (size * count > 0xffff) {
178 PerlIO_printf(PerlIO_stderr(), "Allocation too large: %lx\n", size * count) FLUSH;
183 if ((long)size < 0 || (long)count < 0)
184 croak("panic: calloc");
186 #if !(defined(I286) || defined(atarist))
187 DEBUG_m(PerlIO_printf(PerlIO_stderr(), "0x%x: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
189 DEBUG_m(PerlIO_printf(PerlIO_stderr(), "0x%lx: (%05d) calloc %ld x %ld bytes\n",ptr,an++,(long)count,(long)size));
192 ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
194 memset((void*)ptr, 0, size);
200 PerlIO_puts(PerlIO_stderr(),no_mem) FLUSH;
206 #endif /* !safemalloc */
210 #define ALIGN sizeof(long)
217 register char *where;
219 where = safemalloc(size + ALIGN);
223 return where + ALIGN;
227 safexrealloc(where,size)
231 register char *new = saferealloc(where - ALIGN, size + ALIGN);
244 x = where[0] + 100 * where[1];
250 safexcalloc(x,count,size)
255 register char *where;
257 where = safexmalloc(x, size * count + ALIGN);
259 memset((void*)where + ALIGN, 0, size * count);
262 return where + ALIGN;
270 for (i = 0; i < MAXXCOUNT; i++) {
271 if (xcount[i] > lastxcount[i]) {
272 PerlIO_printf(PerlIO_stderr(),"%2d %2d\t%ld\n", i / 100, i % 100, xcount[i]);
273 lastxcount[i] = xcount[i];
278 #endif /* LEAKTEST */
280 /* copy a string up to some (non-backslashed) delimiter, if any */
283 cpytill(to,from,fromend,delim,retlen)
286 register char *fromend;
292 for (; from < fromend; from++,to++) {
294 if (from[1] == delim)
296 else if (from[1] == '\\')
299 else if (*from == delim)
304 *retlen = to - origto;
308 /* return ptr to little string in big string, NULL if not found */
309 /* This routine was donated by Corey Satten. */
314 register char *little;
316 register char *s, *x;
327 for (x=big,s=little; *s; /**/ ) {
341 /* same as instr but allow embedded nulls */
344 ninstr(big, bigend, little, lend)
346 register char *bigend;
350 register char *s, *x;
351 register I32 first = *little;
352 register char *littleend = lend;
354 if (!first && little >= littleend)
356 if (bigend - big < littleend - little)
358 bigend -= littleend - little++;
359 while (big <= bigend) {
362 for (x=big,s=little; s < littleend; /**/ ) {
374 /* reverse of the above--find last substring */
377 rninstr(big, bigend, little, lend)
383 register char *bigbeg;
384 register char *s, *x;
385 register I32 first = *little;
386 register char *littleend = lend;
388 if (!first && little >= littleend)
391 big = bigend - (littleend - little++);
392 while (big >= bigbeg) {
395 for (x=big+2,s=little; s < littleend; /**/ ) {
407 /* Initialize locale (and the fold[] array).*/
409 perl_init_i18nl10n(printwarn)
414 * 1 = set ok or not applicable,
415 * 0 = fallback to C locale,
416 * -1 = fallback to C locale failed
418 #if defined(HAS_SETLOCALE) && defined(LC_CTYPE)
419 char * lang = getenv("LANG");
420 char * lc_all = getenv("LC_ALL");
421 char * lc_ctype = getenv("LC_CTYPE");
424 if (setlocale(LC_CTYPE, "") == NULL && (lc_all || lc_ctype || lang)) {
426 PerlIO_printf(PerlIO_stderr(), "warning: setlocale(LC_CTYPE, \"\") failed.\n");
427 PerlIO_printf(PerlIO_stderr(),
428 "warning: LC_ALL = \"%s\", LC_CTYPE = \"%s\", LANG = \"%s\",\n",
429 lc_all ? lc_all : "(null)",
430 lc_ctype ? lc_ctype : "(null)",
431 lang ? lang : "(null)"
433 PerlIO_printf(PerlIO_stderr(), "warning: falling back to the \"C\" locale.\n");
436 if (setlocale(LC_CTYPE, "C") == NULL)
440 for (i = 0; i < 256; i++) {
441 if (isUPPER(i)) fold[i] = toLOWER(i);
442 else if (isLOWER(i)) fold[i] = toUPPER(i);
450 fbm_compile(sv, iflag)
454 register unsigned char *s;
455 register unsigned char *table;
457 register U32 len = SvCUR(sv);
462 return; /* can't have offsets that big */
464 table = (unsigned char*)(SvPVX(sv) + len + 1);
466 for (i = 0; i < 256; i++) {
470 while (s >= (unsigned char*)(SvPVX(sv)))
472 if (table[*s] == len) {
475 table[*s] = table[fold[*s]] = i;
489 sv_upgrade(sv, SVt_PVBM);
490 sv_magic(sv, Nullsv, 'B', Nullch, 0); /* deep magic */
493 s = (unsigned char*)(SvPVX(sv)); /* deeper magic */
495 register U32 tmp, foldtmp;
497 for (i = 0; i < len; i++) {
499 foldtmp=freq[fold[s[i]]];
500 if (tmp < frequency && foldtmp < frequency) {
502 /* choose most frequent among the two */
503 frequency = (tmp > foldtmp) ? tmp : foldtmp;
508 for (i = 0; i < len; i++) {
509 if (freq[s[i]] < frequency) {
511 frequency = freq[s[i]];
515 BmRARE(sv) = s[rarest];
516 BmPREVIOUS(sv) = rarest;
517 DEBUG_r(PerlIO_printf(Perl_debug_log, "rarest char %c at %d\n",BmRARE(sv),BmPREVIOUS(sv)));
521 fbm_instr(big, bigend, littlestr)
523 register unsigned char *bigend;
526 register unsigned char *s;
528 register I32 littlelen;
529 register unsigned char *little;
530 register unsigned char *table;
531 register unsigned char *olds;
532 register unsigned char *oldlittle;
534 if (SvTYPE(littlestr) != SVt_PVBM || !SvVALID(littlestr)) {
536 char *l = SvPV(littlestr,len);
539 return ninstr((char*)big,(char*)bigend, l, l + len);
542 littlelen = SvCUR(littlestr);
543 if (SvTAIL(littlestr) && !multiline) { /* tail anchored? */
544 if (littlelen > bigend - big)
546 little = (unsigned char*)SvPVX(littlestr);
547 if (SvCASEFOLD(littlestr)) { /* oops, fake it */
548 big = bigend - littlelen; /* just start near end */
549 if (bigend[-1] == '\n' && little[littlelen-1] != '\n')
553 s = bigend - littlelen;
554 if (*s == *little && bcmp((char*)s,(char*)little,littlelen)==0)
555 return (char*)s; /* how sweet it is */
556 else if (bigend[-1] == '\n' && little[littlelen-1] != '\n'
559 if (*s == *little && bcmp((char*)s,(char*)little,littlelen)==0)
565 table = (unsigned char*)(SvPVX(littlestr) + littlelen + 1);
566 if (--littlelen >= bigend - big)
569 oldlittle = little = table - 2;
570 if (SvCASEFOLD(littlestr)) { /* case insensitive? */
574 if (tmp = table[*s]) {
576 if (bigend - s > tmp) {
581 if ((s += tmp) < bigend)
587 tmp = littlelen; /* less expensive than calling strncmp() */
590 if (*--s == *--little || fold[*s] == *little)
592 s = olds + 1; /* here we pay the price for failure */
594 if (s < bigend) /* fake up continue to outer loop */
606 if (tmp = table[*s]) {
608 if (bigend - s > tmp) {
613 if ((s += tmp) < bigend)
619 tmp = littlelen; /* less expensive than calling strncmp() */
622 if (*--s == *--little)
624 s = olds + 1; /* here we pay the price for failure */
626 if (s < bigend) /* fake up continue to outer loop */
638 screaminstr(bigstr, littlestr)
642 register unsigned char *s, *x;
643 register unsigned char *big;
645 register I32 previous;
647 register unsigned char *little;
648 register unsigned char *bigend;
649 register unsigned char *littleend;
651 if ((pos = screamfirst[BmRARE(littlestr)]) < 0)
653 little = (unsigned char *)(SvPVX(littlestr));
654 littleend = little + SvCUR(littlestr);
656 previous = BmPREVIOUS(littlestr);
657 big = (unsigned char *)(SvPVX(bigstr));
658 bigend = big + SvCUR(bigstr);
659 while (pos < previous) {
660 if (!(pos += screamnext[pos]))
664 if (SvCASEFOLD(littlestr)) { /* case insignificant? */
666 if (big[pos-previous] != first && big[pos-previous] != fold[first])
668 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
671 if (*s++ != *x++ && fold[*(s-1)] != *(x-1)) {
677 return (char *)(big+pos-previous);
679 pos += screamnext[pos] /* does this goof up anywhere? */
684 if (big[pos-previous] != first)
686 for (x=big+pos+1-previous,s=little; s < littleend; /**/ ) {
695 return (char *)(big+pos-previous);
696 } while ( pos += screamnext[pos] );
698 #else /* !POINTERRIGOR */
700 if (SvCASEFOLD(littlestr)) { /* case insignificant? */
702 if (big[pos] != first && big[pos] != fold[first])
704 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
707 if (*s++ != *x++ && fold[*(s-1)] != *(x-1)) {
713 return (char *)(big+pos);
715 pos += screamnext[pos] /* does this goof up anywhere? */
720 if (big[pos] != first)
722 for (x=big+pos+1,s=little; s < littleend; /**/ ) {
731 return (char *)(big+pos);
733 pos += screamnext[pos]
736 #endif /* POINTERRIGOR */
751 if (fold[*a++] == *b++)
758 /* copy a string to a safe spot */
764 register char *newaddr;
766 New(902,newaddr,strlen(sv)+1,char);
767 (void)strcpy(newaddr,sv);
771 /* same thing but with a known length */
778 register char *newaddr;
780 New(903,newaddr,len+1,char);
781 Copy(sv,newaddr,len,char); /* might not be null terminated */
782 newaddr[len] = '\0'; /* is now */
786 #if !defined(I_STDARG) && !defined(I_VARARGS)
789 * Fallback on the old hackers way of doing varargs
794 mess(pat,a1,a2,a3,a4)
800 I32 usermess = strEQ(pat,"%s");
805 tmpstr = sv_newmortal();
806 sv_setpv(tmpstr, (char*)a1);
807 *s++ = SvPVX(tmpstr)[SvCUR(tmpstr)-1];
810 (void)sprintf(s,pat,a1,a2,a3,a4);
816 strcpy(s, " during global destruction.\n");
818 if (curcop->cop_line) {
819 (void)sprintf(s," at %s line %ld",
820 SvPVX(GvSV(curcop->cop_filegv)), (long)curcop->cop_line);
823 if (GvIO(last_in_gv) &&
824 IoLINES(GvIOp(last_in_gv)) ) {
825 (void)sprintf(s,", <%s> %s %ld",
826 last_in_gv == argvgv ? "" : GvENAME(last_in_gv),
827 strEQ(rs,"\n") ? "line" : "chunk",
828 (long)IoLINES(GvIOp(last_in_gv)));
831 (void)strcpy(s,".\n");
835 sv_catpv(tmpstr,buf+1);
838 if (s - s_start >= sizeof(buf)) { /* Ooops! */
840 PerlIO_puts(PerlIO_stderr(), SvPVX(tmpstr));
842 PerlIO_puts(PerlIO_stderr(), buf);
843 PerlIO_puts(PerlIO_stderr(),"panic: message overflow - memory corrupted!\n");
847 return SvPVX(tmpstr);
853 void croak(pat,a1,a2,a3,a4)
863 message = mess(pat,a1,a2,a3,a4);
864 if (diehook && (cv = sv_2cv(diehook, &stash, &gv, 0)) && !CvDEPTH(cv)) {
869 PUSHs(sv_2mortal(newSVpv(message,0)));
871 perl_call_sv((SV*)cv, G_DISCARD);
874 restartop = die_where(message);
875 Siglongjmp(top_env, 3);
877 PerlIO_puts(PerlIO_stderr(),message);
878 (void)PerlIO_flush(PerlIO_stderr());
884 (void)UNLINK(e_tmpname);
888 statusvalue = SHIFTSTATUS(statusvalue);
890 my_exit((U32)vaxc$errno?vaxc$errno:errno?errno:statusvalue?statusvalue:SS$_ABORT);
892 my_exit((U32)((errno&255)?errno:((statusvalue&255)?statusvalue:255)));
897 void warn(pat,a1,a2,a3,a4)
907 message = mess(pat,a1,a2,a3,a4);
908 if (warnhook && (cv = sv_2cv(warnhook, &stash, &gv, 0)) && !CvDEPTH(cv)) {
913 PUSHs(sv_2mortal(newSVpv(message,0)));
915 perl_call_sv((SV*)cv, G_DISCARD);
918 PerlIO_puts(PerlIO_stderr(),message);
922 (void)Fflush(PerlIO_stderr());
926 #else /* !defined(I_STDARG) && !defined(I_VARARGS) */
930 mess(char *pat, va_list *args)
944 #ifdef USE_CHAR_VSPRINTF
952 usermess = strEQ(pat, "%s");
954 tmpstr = sv_newmortal();
955 sv_setpv(tmpstr, va_arg(*args, char *));
956 *s++ = SvPVX(tmpstr)[SvCUR(tmpstr)-1];
959 (void) vsprintf(s,pat,*args);
966 strcpy(s, " during global destruction.\n");
968 if (curcop->cop_line) {
969 (void)sprintf(s," at %s line %ld",
970 SvPVX(GvSV(curcop->cop_filegv)), (long)curcop->cop_line);
973 if (GvIO(last_in_gv) && IoLINES(GvIOp(last_in_gv))) {
974 bool line_mode = (RsSIMPLE(rs) &&
975 SvLEN(rs) == 1 && *SvPVX(rs) == '\n');
976 (void)sprintf(s,", <%s> %s %ld",
977 last_in_gv == argvgv ? "" : GvNAME(last_in_gv),
978 line_mode ? "line" : "chunk",
979 (long)IoLINES(GvIOp(last_in_gv)));
982 (void)strcpy(s,".\n");
986 sv_catpv(tmpstr,buf+1);
989 if (s - s_start >= sizeof(buf)) { /* Ooops! */
991 PerlIO_puts(PerlIO_stderr(), SvPVX(tmpstr));
993 PerlIO_puts(PerlIO_stderr(), buf);
994 PerlIO_puts(PerlIO_stderr(), "panic: message overflow - memory corrupted!\n");
998 return SvPVX(tmpstr);
1005 croak(char* pat, ...)
1009 croak(pat, va_alist)
1021 va_start(args, pat);
1025 message = mess(pat, &args);
1027 if (diehook && (cv = sv_2cv(diehook, &stash, &gv, 0)) && !CvDEPTH(cv)) {
1032 PUSHs(sv_2mortal(newSVpv(message,0)));
1034 perl_call_sv((SV*)cv, G_DISCARD);
1037 restartop = die_where(message);
1038 Siglongjmp(top_env, 3);
1040 PerlIO_puts(PerlIO_stderr(),message);
1041 (void)PerlIO_flush(PerlIO_stderr());
1047 (void)UNLINK(e_tmpname);
1048 Safefree(e_tmpname);
1051 statusvalue = SHIFTSTATUS(statusvalue);
1053 my_exit((U32)(vaxc$errno?vaxc$errno:(statusvalue?statusvalue:44)));
1055 my_exit((U32)((errno&255)?errno:((statusvalue&255)?statusvalue:255)));
1076 va_start(args, pat);
1080 message = mess(pat, &args);
1083 if (warnhook && (cv = sv_2cv(warnhook, &stash, &gv, 0)) && !CvDEPTH(cv)) {
1088 PUSHs(sv_2mortal(newSVpv(message,0)));
1090 perl_call_sv((SV*)cv, G_DISCARD);
1093 PerlIO_puts(PerlIO_stderr(),message);
1097 (void)PerlIO_flush(PerlIO_stderr());
1100 #endif /* !defined(I_STDARG) && !defined(I_VARARGS) */
1102 #ifndef VMS /* VMS' my_setenv() is in VMS.c */
1107 register I32 i=setenv_getix(nam); /* where does it go? */
1109 if (environ == origenviron) { /* need we copy environment? */
1115 for (max = i; environ[max]; max++) ;
1116 New(901,tmpenv, max+2, char*);
1117 for (j=0; j<max; j++) /* copy environment */
1118 tmpenv[j] = savepv(environ[j]);
1119 tmpenv[max] = Nullch;
1120 environ = tmpenv; /* tell exec where it is now */
1123 while (environ[i]) {
1124 environ[i] = environ[i+1];
1129 if (!environ[i]) { /* does not exist yet */
1130 Renew(environ, i+2, char*); /* just expand it a bit */
1131 environ[i+1] = Nullch; /* make sure it's null terminated */
1134 Safefree(environ[i]);
1135 New(904, environ[i], strlen(nam) + strlen(val) + 2, char);
1137 (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
1139 /* MS-DOS requires environment variable names to be in uppercase */
1140 /* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
1141 * some utilities and applications may break because they only look
1142 * for upper case strings. (Fixed strupr() bug here.)]
1144 strcpy(environ[i],nam); strupr(environ[i]);
1145 (void)sprintf(environ[i] + strlen(nam),"=%s",val);
1153 register I32 i, len = strlen(nam);
1155 for (i = 0; environ[i]; i++) {
1156 if (strnEQ(environ[i],nam,len) && environ[i][len] == '=')
1157 break; /* strnEQ must come first to avoid */
1158 } /* potential SEGV's */
1163 #ifdef UNLINK_ALL_VERSIONS
1165 unlnk(f) /* unlink all versions of a file */
1170 for (i = 0; unlink(f) >= 0; i++) ;
1175 #if !defined(HAS_BCOPY) || !defined(HAS_SAFE_BCOPY)
1177 my_bcopy(from,to,len)
1178 register char *from;
1184 if (from - to >= 0) {
1192 *(--to) = *(--from);
1198 #if !defined(HAS_BZERO) && !defined(HAS_MEMSET)
1214 my_memcmp(s1,s2,len)
1215 register unsigned char *s1;
1216 register unsigned char *s2;
1222 if (tmp = *s1++ - *s2++)
1227 #endif /* HAS_MEMCMP */
1229 #if defined(I_STDARG) || defined(I_VARARGS)
1232 #ifdef USE_CHAR_VSPRINTF
1237 vsprintf(dest, pat, args)
1238 char *dest, *pat, *args;
1242 fakebuf._ptr = dest;
1243 fakebuf._cnt = 32767;
1247 fakebuf._flag = _IOWRT|_IOSTRG;
1248 _doprnt(pat, args, &fakebuf); /* what a kludge */
1249 (void)putc('\0', &fakebuf);
1250 #ifdef USE_CHAR_VSPRINTF
1253 return 0; /* perl doesn't use return value */
1257 #endif /* HAS_VPRINTF */
1258 #endif /* I_VARARGS || I_STDARGS */
1261 #if BYTEORDER != 0x4321
1263 #ifndef CAN_PROTOTYPE
1270 #if (BYTEORDER & 1) == 0
1273 result = ((s & 255) << 8) + ((s >> 8) & 255);
1281 #ifndef CAN_PROTOTYPE
1290 char c[sizeof(long)];
1293 #if BYTEORDER == 0x1234
1294 u.c[0] = (l >> 24) & 255;
1295 u.c[1] = (l >> 16) & 255;
1296 u.c[2] = (l >> 8) & 255;
1300 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1301 croak("Unknown BYTEORDER\n");
1306 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1307 u.c[o & 0xf] = (l >> s) & 255;
1315 #ifndef CAN_PROTOTYPE
1324 char c[sizeof(long)];
1327 #if BYTEORDER == 0x1234
1328 u.c[0] = (l >> 24) & 255;
1329 u.c[1] = (l >> 16) & 255;
1330 u.c[2] = (l >> 8) & 255;
1334 #if ((BYTEORDER - 0x1111) & 0x444) || !(BYTEORDER & 0xf)
1335 croak("Unknown BYTEORDER\n");
1342 for (o = BYTEORDER - 0x1111, s = 0; s < (sizeof(long)*8); o >>= 4, s += 8) {
1343 l |= (u.c[o & 0xf] & 255) << s;
1350 #endif /* BYTEORDER != 0x4321 */
1354 * Little-endian byte order functions - 'v' for 'VAX', or 'reVerse'.
1355 * If these functions are defined,
1356 * the BYTEORDER is neither 0x1234 nor 0x4321.
1357 * However, this is not assumed.
1361 #define HTOV(name,type) \
1368 char c[sizeof(type)]; \
1372 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1373 u.c[i] = (n >> s) & 0xFF; \
1378 #define VTOH(name,type) \
1385 char c[sizeof(type)]; \
1391 for (i = 0, s = 0; i < sizeof(u.c); i++, s += 8) { \
1392 n += (u.c[i] & 0xFF) << s; \
1397 #if defined(HAS_HTOVS) && !defined(htovs)
1400 #if defined(HAS_HTOVL) && !defined(htovl)
1403 #if defined(HAS_VTOHS) && !defined(vtohs)
1406 #if defined(HAS_VTOHL) && !defined(vtohl)
1410 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) /* VMS' my_popen() is in
1411 VMS.c, same with OS/2. */
1418 register I32 this, that;
1421 I32 doexec = strNE(cmd,"-");
1425 this = (*mode == 'w');
1430 taint_proper("Insecure %s%s", "EXEC");
1433 while ((pid = (doexec?vfork():fork())) < 0) {
1434 if (errno != EAGAIN) {
1437 croak("Can't fork");
1448 if (p[THIS] != (*mode == 'r')) {
1449 dup2(p[THIS], *mode == 'r');
1453 #if !defined(HAS_FCNTL) || !defined(F_SETFD)
1459 for (fd = maxsysfd + 1; fd < NOFILE; fd++)
1462 do_exec(cmd); /* may or may not use the shell */
1466 if (tmpgv = gv_fetchpv("$",TRUE, SVt_PV))
1467 sv_setiv(GvSV(tmpgv),(I32)getpid());
1469 hv_clear(pidstatus); /* we have no children */
1474 do_execfree(); /* free any memory malloced by child on vfork */
1476 if (p[that] < p[this]) {
1477 dup2(p[this], p[that]);
1481 sv = *av_fetch(fdpid,p[this],TRUE);
1482 (void)SvUPGRADE(sv,SVt_IV);
1485 return PerlIO_fdopen(p[this], mode);
1488 #if defined(atarist)
1495 /* Needs work for PerlIO ! */
1496 return popen(PerlIO_exportFILE(cmd), mode);
1500 #endif /* !DOSISH */
1507 struct stat tmpstatbuf;
1509 PerlIO_printf(PerlIO_stderr(),"%s", s);
1510 for (fd = 0; fd < 32; fd++) {
1511 if (Fstat(fd,&tmpstatbuf) >= 0)
1512 PerlIO_printf(PerlIO_stderr()," %d",fd);
1514 PerlIO_printf(PerlIO_stderr(),"\n");
1524 #if defined(HAS_FCNTL) && defined(F_DUPFD)
1528 return fcntl(oldfd, F_DUPFD, newfd);
1537 while ((fd = dup(oldfd)) != newfd && fd >= 0) /* good enough for low fd's */
1540 close(fdtmp[--fdx]);
1546 #if (!defined(DOSISH) || defined(HAS_FORK)) && !defined(VMS) /* VMS' my_popen() is in VMS.c */
1551 Signal_t (*hstat)(), (*istat)(), (*qstat)();
1556 svp = av_fetch(fdpid,PerlIO_fileno(ptr),TRUE);
1557 pid = (int)SvIVX(*svp);
1562 if(kill(pid, 0) < 0) { return(pid); } /* HOM 12/23/91 */
1564 hstat = signal(SIGHUP, SIG_IGN);
1565 istat = signal(SIGINT, SIG_IGN);
1566 qstat = signal(SIGQUIT, SIG_IGN);
1568 pid = wait4pid(pid, &status, 0);
1569 } while (pid == -1 && errno == EINTR);
1570 signal(SIGHUP, hstat);
1571 signal(SIGINT, istat);
1572 signal(SIGQUIT, qstat);
1573 return(pid < 0 ? pid : status);
1575 #endif /* !DOSISH */
1577 #if !defined(DOSISH) || defined(OS2)
1579 wait4pid(pid,statusp,flags)
1591 sprintf(spid, "%d", pid);
1592 svp = hv_fetch(pidstatus,spid,strlen(spid),FALSE);
1593 if (svp && *svp != &sv_undef) {
1594 *statusp = SvIVX(*svp);
1595 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
1602 hv_iterinit(pidstatus);
1603 if (entry = hv_iternext(pidstatus)) {
1604 pid = atoi(hv_iterkey(entry,(I32*)statusp));
1605 sv = hv_iterval(pidstatus,entry);
1606 *statusp = SvIVX(sv);
1607 sprintf(spid, "%d", pid);
1608 (void)hv_delete(pidstatus,spid,strlen(spid),G_DISCARD);
1613 return waitpid(pid,statusp,flags);
1616 return wait4((pid==-1)?0:pid,statusp,flags,Null(struct rusage *));
1621 croak("Can't do waitpid with flags");
1623 while ((result = wait(statusp)) != pid && pid > 0 && result >= 0)
1624 pidgone(result,*statusp);
1633 #endif /* !DOSISH */
1644 sprintf(spid, "%d", pid);
1645 sv = *hv_fetch(pidstatus,spid,strlen(spid),TRUE);
1646 (void)SvUPGRADE(sv,SVt_IV);
1651 #if defined(atarist) || (defined(OS2) && !defined(HAS_FORK))
1657 /* Needs work for PerlIO ! */
1658 FILE *f = PerlIO_findFILE(ptr);
1659 I32 result = pclose(f);
1660 PerlIO_releaseFILE(ptr,f);
1666 repeatcpy(to,from,len,count)
1668 register char *from;
1673 register char *frombase = from;
1681 while (count-- > 0) {
1682 for (todo = len; todo > 0; todo--) {
1689 #ifndef CASTNEGFLOAT
1697 # define BIGDOUBLE 2147483648.0
1699 return (unsigned long)(f-(long)(f/BIGDOUBLE)*BIGDOUBLE)|0x80000000;
1702 return (unsigned long)f;
1704 return (unsigned long)along;
1711 /* Unfortunately, on some systems the cast_uv() function doesn't
1712 work with the system-supplied definition of ULONG_MAX. The
1713 comparison (f >= ULONG_MAX) always comes out true. It must be a
1714 problem with the compiler constant folding.
1716 In any case, this workaround should be fine on any two's complement
1717 system. If it's not, supply a '-DMY_ULONG_MAX=whatever' in your
1719 --Andy Dougherty <doughera@lafcol.lafayette.edu>
1721 #ifndef MY_ULONG_MAX
1722 # define MY_ULONG_MAX ((UV)PERL_LONG_MAX * (UV)2 + (UV)1)
1729 if (f >= PERL_LONG_MAX)
1730 return (I32) PERL_LONG_MAX;
1731 if (f <= PERL_LONG_MIN)
1732 return (I32) PERL_LONG_MIN;
1740 if (f >= PERL_LONG_MAX)
1741 return (IV) PERL_LONG_MAX;
1742 if (f <= PERL_LONG_MIN)
1743 return (IV) PERL_LONG_MIN;
1751 if (f >= MY_ULONG_MAX)
1752 return (UV) MY_ULONG_MAX;
1764 char *fa = strrchr(a,'/');
1765 char *fb = strrchr(b,'/');
1766 struct stat tmpstatbuf1;
1767 struct stat tmpstatbuf2;
1769 #define MAXPATHLEN 1024
1771 char tmpbuf[MAXPATHLEN+1];
1786 strncpy(tmpbuf, a, fa - a);
1787 if (Stat(tmpbuf, &tmpstatbuf1) < 0)
1792 strncpy(tmpbuf, b, fb - b);
1793 if (Stat(tmpbuf, &tmpstatbuf2) < 0)
1795 return tmpstatbuf1.st_dev == tmpstatbuf2.st_dev &&
1796 tmpstatbuf1.st_ino == tmpstatbuf2.st_ino;
1798 #endif /* !HAS_RENAME */
1801 scan_oct(start, len, retlen)
1806 register char *s = start;
1807 register unsigned long retval = 0;
1809 while (len && *s >= '0' && *s <= '7') {
1811 retval |= *s++ - '0';
1814 if (dowarn && len && (*s == '8' || *s == '9'))
1815 warn("Illegal octal digit ignored");
1816 *retlen = s - start;
1821 scan_hex(start, len, retlen)
1826 register char *s = start;
1827 register unsigned long retval = 0;
1830 while (len-- && *s && (tmp = strchr(hexdigit, *s))) {
1832 retval |= (tmp - hexdigit) & 15;
1835 *retlen = s - start;
1842 * This hack is to force load of "huge" support from libm.a
1843 * So it is in perl for (say) POSIX to use.
1844 * Needed for SunOS with Sun's 'acc' for example.