perl 3.0 patch #4 Patch #2 continued

[perl5.git] / util.c

diff --git a/util.c b/util.c
index b0b78f1..e267578 100644 (file)
--- a/util.c
+++ b/util.c
@@ -1,28 +1,46 @@
-/* $Header: util.c,v 1.0 87/12/18 13:06:30 root Exp $
+/* $Header: util.c,v 3.0.1.1 89/11/11 05:06:13 lwall Locked $
+ *
+ *    Copyright (c) 1989, Larry Wall
+ *
+ *    You may distribute under the terms of the GNU General Public License
+ *    as specified in the README file that comes with the perl 3.0 kit.

  *
  * $Log:       util.c,v $
  *
  * $Log:       util.c,v $

- * Revision 1.0  87/12/18  13:06:30  root
- * Initial revision
+ * Revision 3.0.1.1  89/11/11  05:06:13  lwall
+ * patch2: made dup2 a little better
+ * 
+ * Revision 3.0  89/10/18  15:32:43  lwall
+ * 3.0 baseline

  * 
  */
 
  * 
  */
 

-#include <stdio.h>
-
-#include "handy.h"

 #include "EXTERN.h"
 #include "EXTERN.h"

-#include "search.h"

 #include "perl.h"
 #include "perl.h"

-#include "INTERN.h"
-#include "util.h"
+#include "errno.h"
+#include <signal.h>
+
+#ifdef I_VFORK
+#  include <vfork.h>
+#endif
+
+#ifdef I_VARARGS
+#  include <varargs.h>
+#endif

 
 #define FLUSH
 
 #define FLUSH

-#define MEM_SIZE unsigned int

 
 static char nomem[] = "Out of memory!\n";
 
 /* paranoid version of malloc */
 
 
 static char nomem[] = "Out of memory!\n";
 
 /* paranoid version of malloc */
 

+#ifdef DEBUGGING

 static int an = 0;
 static int an = 0;

+#endif
+
+/* NOTE:  Do not call the next three routines directly.  Use the macros
+ * in handy.h, so that we can easily redefine everything to do tracking of
+ * allocated hunks back to the original New to track down any memory leaks.
+ */

 
 char *
 safemalloc(size)
 
 char *
 safemalloc(size)


@@ -33,8 +51,13 @@ MEM_SIZE size;
 
     ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
 #ifdef DEBUGGING
 
     ptr = malloc(size?size:1); /* malloc(0) is NASTY on our system */
 #ifdef DEBUGGING

+#  ifndef I286

     if (debug & 128)
        fprintf(stderr,"0x%x: (%05d) malloc %d bytes\n",ptr,an++,size);
     if (debug & 128)
        fprintf(stderr,"0x%x: (%05d) malloc %d bytes\n",ptr,an++,size);

+#  else
+    if (debug & 128)
+       fprintf(stderr,"0x%lx: (%05d) malloc %d bytes\n",ptr,an++,size);
+#  endif

 #endif
     if (ptr != Nullch)
        return ptr;
 #endif
     if (ptr != Nullch)
        return ptr;


@@ -43,6 +66,9 @@ MEM_SIZE size;
        exit(1);
     }
     /*NOTREACHED*/
        exit(1);
     }
     /*NOTREACHED*/

+#ifdef lint
+    return ptr;
+#endif

 }
 
 /* paranoid version of realloc */
 }
 
 /* paranoid version of realloc */


@@ -55,12 +81,21 @@ MEM_SIZE size;
     char *ptr;
     char *realloc();
 
     char *ptr;
     char *realloc();
 

+    if (!where)
+       fatal("Null realloc");

     ptr = realloc(where,size?size:1);  /* realloc(0) is NASTY on our system */
 #ifdef DEBUGGING
     ptr = realloc(where,size?size:1);  /* realloc(0) is NASTY on our system */
 #ifdef DEBUGGING

+#  ifndef I286

     if (debug & 128) {
        fprintf(stderr,"0x%x: (%05d) rfree\n",where,an++);
        fprintf(stderr,"0x%x: (%05d) realloc %d bytes\n",ptr,an++,size);
     }
     if (debug & 128) {
        fprintf(stderr,"0x%x: (%05d) rfree\n",where,an++);
        fprintf(stderr,"0x%x: (%05d) realloc %d bytes\n",ptr,an++,size);
     }

+#  else
+    if (debug & 128) {
+       fprintf(stderr,"0x%lx: (%05d) rfree\n",where,an++);
+       fprintf(stderr,"0x%lx: (%05d) realloc %d bytes\n",ptr,an++,size);
+    }
+#  endif

 #endif
     if (ptr != Nullch)
        return ptr;
 #endif
     if (ptr != Nullch)
        return ptr;


@@ -69,102 +104,544 @@ MEM_SIZE size;
        exit(1);
     }
     /*NOTREACHED*/
        exit(1);
     }
     /*NOTREACHED*/

+#ifdef lint
+    return ptr;
+#endif

 }
 
 /* safe version of free */
 
 }
 
 /* safe version of free */
 

+void

 safefree(where)
 char *where;
 {
 #ifdef DEBUGGING
 safefree(where)
 char *where;
 {
 #ifdef DEBUGGING

+#  ifndef I286

     if (debug & 128)
        fprintf(stderr,"0x%x: (%05d) free\n",where,an++);
     if (debug & 128)
        fprintf(stderr,"0x%x: (%05d) free\n",where,an++);

+#  else
+    if (debug & 128)
+       fprintf(stderr,"0x%lx: (%05d) free\n",where,an++);
+#  endif

 #endif
 #endif

-    free(where);
+    if (where) {
+       free(where);
+    }

 }
 
 }
 

-/* safe version of string copy */
+#ifdef LEAKTEST
+
+#define ALIGN sizeof(long)

 
 char *
 
 char *

-safecpy(to,from,len)
-char *to;
-register char *from;
-register int len;
+safexmalloc(x,size)
+int x;
+MEM_SIZE size;

 {
 {

-    register char *dest = to;
+    register char *where;

 
 

-    if (from != Nullch) 
-       for (len--; len && (*dest++ = *from++); len--) ;
-    *dest = '\0';
-    return to;
+    where = safemalloc(size + ALIGN);
+    xcount[x]++;
+    where[0] = x % 100;
+    where[1] = x / 100;
+    return where + ALIGN;

 }
 
 }
 

-#ifdef undef
-/* safe version of string concatenate, with \n deletion and space padding */
-

 char *
 char *

-safecat(to,from,len)
-char *to;
-register char *from;
-register int len;
+safexrealloc(where,size)
+char *where;
+MEM_SIZE size;
+{
+    return saferealloc(where - ALIGN, size + ALIGN) + ALIGN;
+}
+
+void
+safexfree(where)
+char *where;
+{
+    int x;
+
+    if (!where)
+       return;
+    where -= ALIGN;
+    x = where[0] + 100 * where[1];
+    xcount[x]--;
+    safefree(where);
+}
+
+xstat()

 {
 {

-    register char *dest = to;
+    register int i;

 
 

-    len--;                             /* leave room for null */
-    if (*dest) {
-       while (len && *dest++) len--;
-       if (len) {
-           len--;
-           *(dest-1) = ' ';
+    for (i = 0; i < MAXXCOUNT; i++) {
+       if (xcount[i] != lastxcount[i]) {
+           fprintf(stderr,"%2d %2d\t%ld\n", i / 100, i % 100, xcount[i]);
+           lastxcount[i] = xcount[i];

        }
     }
        }
     }

-    if (from != Nullch)
-       while (len && (*dest++ = *from++)) len--;
-    if (len)
-       dest--;
-    if (*(dest-1) == '\n')
-       dest--;
-    *dest = '\0';
-    return to;

 }
 }

-#endif
+
+#endif /* LEAKTEST */

 
 /* copy a string up to some (non-backslashed) delimiter, if any */
 
 char *
 
 /* copy a string up to some (non-backslashed) delimiter, if any */
 
 char *

-cpytill(to,from,delim)
+cpytill(to,from,fromend,delim,retlen)

 register char *to, *from;
 register char *to, *from;

+register char *fromend;

 register int delim;
 register int delim;

+int *retlen;

 {
 {

-    for (; *from; from++,to++) {
-       if (*from == '\\' && from[1] == delim)
-           from++;
+    char *origto = to;
+
+    for (; from < fromend; from++,to++) {
+       if (*from == '\\') {
+           if (from[1] == delim)
+               from++;
+           else if (from[1] == '\\')
+               *to++ = *from++;
+       }

        else if (*from == delim)
            break;
        *to = *from;
     }
     *to = '\0';
        else if (*from == delim)
            break;
        *to = *from;
     }
     *to = '\0';

+    *retlen = to - origto;

     return from;
 }
 
 /* return ptr to little string in big string, NULL if not found */
     return from;
 }
 
 /* return ptr to little string in big string, NULL if not found */

+/* This routine was donated by Corey Satten. */

 
 char *
 instr(big, little)
 
 char *
 instr(big, little)

-char *big, *little;
-
+register char *big;
+register char *little;

 {
 {

-    register char *t, *s, *x;
+    register char *s, *x;
+    register int first;

 
 

-    for (t = big; *t; t++) {
-       for (x=t,s=little; *s; x++,s++) {
+    if (!little)
+       return big;
+    first = *little++;
+    if (!first)
+       return big;
+    while (*big) {
+       if (*big++ != first)
+           continue;
+       for (x=big,s=little; *s; /**/ ) {

            if (!*x)
                return Nullch;
            if (!*x)
                return Nullch;

-           if (*s != *x)
+           if (*s++ != *x++) {
+               s--;

                break;
                break;

+           }

        }
        if (!*s)
        }
        if (!*s)

-           return t;
+           return big-1;
+    }
+    return Nullch;
+}
+
+/* same as instr but allow embedded nulls */
+
+char *
+ninstr(big, bigend, little, lend)
+register char *big;
+register char *bigend;
+char *little;
+char *lend;
+{
+    register char *s, *x;
+    register int first = *little;
+    register char *littleend = lend;
+
+    if (!first && little > littleend)
+       return big;
+    bigend -= littleend - little++;
+    while (big <= bigend) {
+       if (*big++ != first)
+           continue;
+       for (x=big,s=little; s < littleend; /**/ ) {
+           if (*s++ != *x++) {
+               s--;
+               break;
+           }
+       }
+       if (s >= littleend)
+           return big-1;
+    }
+    return Nullch;
+}
+
+/* reverse of the above--find last substring */
+
+char *
+rninstr(big, bigend, little, lend)
+register char *big;
+char *bigend;
+char *little;
+char *lend;
+{
+    register char *bigbeg;
+    register char *s, *x;
+    register int first = *little;
+    register char *littleend = lend;
+
+    if (!first && little > littleend)
+       return bigend;
+    bigbeg = big;
+    big = bigend - (littleend - little++);
+    while (big >= bigbeg) {
+       if (*big-- != first)
+           continue;
+       for (x=big+2,s=little; s < littleend; /**/ ) {
+           if (*s++ != *x++) {
+               s--;
+               break;
+           }
+       }
+       if (s >= littleend)
+           return big+1;
+    }
+    return Nullch;
+}
+
+unsigned char fold[] = {
+       0,      1,      2,      3,      4,      5,      6,      7,
+       8,      9,      10,     11,     12,     13,     14,     15,
+       16,     17,     18,     19,     20,     21,     22,     23,
+       24,     25,     26,     27,     28,     29,     30,     31,
+       32,     33,     34,     35,     36,     37,     38,     39,
+       40,     41,     42,     43,     44,     45,     46,     47,
+       48,     49,     50,     51,     52,     53,     54,     55,
+       56,     57,     58,     59,     60,     61,     62,     63,
+       64,     'a',    'b',    'c',    'd',    'e',    'f',    'g',
+       'h',    'i',    'j',    'k',    'l',    'm',    'n',    'o',
+       'p',    'q',    'r',    's',    't',    'u',    'v',    'w',
+       'x',    'y',    'z',    91,     92,     93,     94,     95,
+       96,     'A',    'B',    'C',    'D',    'E',    'F',    'G',
+       'H',    'I',    'J',    'K',    'L',    'M',    'N',    'O',
+       'P',    'Q',    'R',    'S',    'T',    'U',    'V',    'W',
+       'X',    'Y',    'Z',    123,    124,    125,    126,    127,
+       128,    129,    130,    131,    132,    133,    134,    135,
+       136,    137,    138,    139,    140,    141,    142,    143,
+       144,    145,    146,    147,    148,    149,    150,    151,
+       152,    153,    154,    155,    156,    157,    158,    159,
+       160,    161,    162,    163,    164,    165,    166,    167,
+       168,    169,    170,    171,    172,    173,    174,    175,
+       176,    177,    178,    179,    180,    181,    182,    183,
+       184,    185,    186,    187,    188,    189,    190,    191,
+       192,    193,    194,    195,    196,    197,    198,    199,
+       200,    201,    202,    203,    204,    205,    206,    207,
+       208,    209,    210,    211,    212,    213,    214,    215,
+       216,    217,    218,    219,    220,    221,    222,    223,    
+       224,    225,    226,    227,    228,    229,    230,    231,
+       232,    233,    234,    235,    236,    237,    238,    239,
+       240,    241,    242,    243,    244,    245,    246,    247,
+       248,    249,    250,    251,    252,    253,    254,    255
+};
+
+static unsigned char freq[] = {
+       1,      2,      84,     151,    154,    155,    156,    157,
+       165,    246,    250,    3,      158,    7,      18,     29,
+       40,     51,     62,     73,     85,     96,     107,    118,
+       129,    140,    147,    148,    149,    150,    152,    153,
+       255,    182,    224,    205,    174,    176,    180,    217,
+       233,    232,    236,    187,    235,    228,    234,    226,
+       222,    219,    211,    195,    188,    193,    185,    184,
+       191,    183,    201,    229,    181,    220,    194,    162,
+       163,    208,    186,    202,    200,    218,    198,    179,
+       178,    214,    166,    170,    207,    199,    209,    206,
+       204,    160,    212,    216,    215,    192,    175,    173,
+       243,    172,    161,    190,    203,    189,    164,    230,
+       167,    248,    227,    244,    242,    255,    241,    231,
+       240,    253,    169,    210,    245,    237,    249,    247,
+       239,    168,    252,    251,    254,    238,    223,    221,
+       213,    225,    177,    197,    171,    196,    159,    4,
+       5,      6,      8,      9,      10,     11,     12,     13,
+       14,     15,     16,     17,     19,     20,     21,     22,
+       23,     24,     25,     26,     27,     28,     30,     31,
+       32,     33,     34,     35,     36,     37,     38,     39,
+       41,     42,     43,     44,     45,     46,     47,     48,
+       49,     50,     52,     53,     54,     55,     56,     57,
+       58,     59,     60,     61,     63,     64,     65,     66,
+       67,     68,     69,     70,     71,     72,     74,     75,
+       76,     77,     78,     79,     80,     81,     82,     83,
+       86,     87,     88,     89,     90,     91,     92,     93,
+       94,     95,     97,     98,     99,     100,    101,    102,
+       103,    104,    105,    106,    108,    109,    110,    111,
+       112,    113,    114,    115,    116,    117,    119,    120,
+       121,    122,    123,    124,    125,    126,    127,    128,
+       130,    131,    132,    133,    134,    135,    136,    137,
+       138,    139,    141,    142,    143,    144,    145,    146
+};
+
+void
+fbmcompile(str, iflag)
+STR *str;
+int iflag;
+{
+    register unsigned char *s;
+    register unsigned char *table;
+    register int i;
+    register int len = str->str_cur;
+    int rarest = 0;
+    int frequency = 256;
+
+    str_grow(str,len+258);
+#ifndef lint
+    table = (unsigned char*)(str->str_ptr + len + 1);
+#else
+    table = Null(unsigned char*);
+#endif
+    s = table - 2;
+    for (i = 0; i < 256; i++) {
+       table[i] = len;
+    }
+    i = 0;
+#ifndef lint
+    while (s >= (unsigned char*)(str->str_ptr))
+#endif
+    {
+       if (table[*s] == len) {
+#ifndef pdp11
+           if (iflag)
+               table[*s] = table[fold[*s]] = i;
+#else
+           if (iflag) {
+               int j;
+               j = fold[*s];
+               table[j] = i;
+               table[*s] = i;
+           }
+#endif /* pdp11 */
+           else
+               table[*s] = i;
+       }
+       s--,i++;
+    }
+    str->str_pok |= SP_FBM;            /* deep magic */
+
+#ifndef lint
+    s = (unsigned char*)(str->str_ptr);                /* deeper magic */
+#else
+    s = Null(unsigned char*);
+#endif
+    if (iflag) {
+       register int tmp, foldtmp;
+       str->str_pok |= SP_CASEFOLD;
+       for (i = 0; i < len; i++) {
+           tmp=freq[s[i]];
+           foldtmp=freq[fold[s[i]]];
+           if (tmp < frequency && foldtmp < frequency) {
+               rarest = i;
+               /* choose most frequent among the two */
+               frequency = (tmp > foldtmp) ? tmp : foldtmp;
+           }
+       }
+    }
+    else {
+       for (i = 0; i < len; i++) {
+           if (freq[s[i]] < frequency) {
+               rarest = i;
+               frequency = freq[s[i]];
+           }
+       }
+    }
+    str->str_rare = s[rarest];
+    str->str_state = rarest;
+#ifdef DEBUGGING
+    if (debug & 512)
+       fprintf(stderr,"rarest char %c at %d\n",str->str_rare, str->str_state);
+#endif
+}
+
+char *
+fbminstr(big, bigend, littlestr)
+unsigned char *big;
+register unsigned char *bigend;
+STR *littlestr;
+{
+    register unsigned char *s;
+    register int tmp;
+    register int littlelen;
+    register unsigned char *little;
+    register unsigned char *table;
+    register unsigned char *olds;
+    register unsigned char *oldlittle;
+
+#ifndef lint
+    if (!(littlestr->str_pok & SP_FBM))
+       return instr((char*)big,littlestr->str_ptr);
+#endif
+
+    littlelen = littlestr->str_cur;
+#ifndef lint
+    if (littlestr->str_pok & SP_TAIL && !multiline) {  /* tail anchored? */
+       little = (unsigned char*)littlestr->str_ptr;
+       if (littlestr->str_pok & SP_CASEFOLD) { /* oops, fake it */
+           big = bigend - littlelen;           /* just start near end */
+           if (bigend[-1] == '\n' && little[littlelen-1] != '\n')
+               big--;
+       }
+       else {
+           s = bigend - littlelen;
+           if (*s == *little && bcmp(s,little,littlelen)==0)
+               return (char*)s;                /* how sweet it is */
+           else if (bigend[-1] == '\n' && little[littlelen-1] != '\n') {
+                   s--;
+               if (*s == *little && bcmp(s,little,littlelen)==0)
+                   return (char*)s;
+           }
+           return Nullch;
+       }
+    }
+    table = (unsigned char*)(littlestr->str_ptr + littlelen + 1);
+#else
+    table = Null(unsigned char*);
+#endif
+    s = big + --littlelen;
+    oldlittle = little = table - 2;
+    if (littlestr->str_pok & SP_CASEFOLD) {    /* case insensitive? */
+       while (s < bigend) {
+         top1:
+           if (tmp = table[*s]) {
+               s += tmp;
+           }
+           else {
+               tmp = littlelen;        /* less expensive than calling strncmp() */
+               olds = s;
+               while (tmp--) {
+                   if (*--s == *--little || fold[*s] == *little)
+                       continue;
+                   s = olds + 1;       /* here we pay the price for failure */
+                   little = oldlittle;
+                   if (s < bigend)     /* fake up continue to outer loop */
+                       goto top1;
+                   return Nullch;
+               }
+#ifndef lint
+               return (char *)s;
+#endif
+           }
+       }
+    }
+    else {
+       while (s < bigend) {
+         top2:
+           if (tmp = table[*s]) {
+               s += tmp;
+           }
+           else {
+               tmp = littlelen;        /* less expensive than calling strncmp() */
+               olds = s;
+               while (tmp--) {
+                   if (*--s == *--little)
+                       continue;
+                   s = olds + 1;       /* here we pay the price for failure */
+                   little = oldlittle;
+                   if (s < bigend)     /* fake up continue to outer loop */
+                       goto top2;
+                   return Nullch;
+               }
+#ifndef lint
+               return (char *)s;
+#endif
+           }
+       }
+    }
+    return Nullch;
+}
+
+char *
+screaminstr(bigstr, littlestr)
+STR *bigstr;
+STR *littlestr;
+{
+    register unsigned char *s, *x;
+    register unsigned char *big;
+    register int pos;
+    register int previous;
+    register int first;
+    register unsigned char *little;
+    register unsigned char *bigend;
+    register unsigned char *littleend;
+
+    if ((pos = screamfirst[littlestr->str_rare]) < 0) 
+       return Nullch;
+#ifndef lint
+    little = (unsigned char *)(littlestr->str_ptr);
+#else
+    little = Null(unsigned char *);
+#endif
+    littleend = little + littlestr->str_cur;
+    first = *little++;
+    previous = littlestr->str_state;
+#ifndef lint
+    big = (unsigned char *)(bigstr->str_ptr);
+#else
+    big = Null(unsigned char*);
+#endif
+    bigend = big + bigstr->str_cur;
+    big -= previous;
+    while (pos < previous) {
+#ifndef lint
+       if (!(pos += screamnext[pos]))
+#endif
+           return Nullch;
+    }
+    if (littlestr->str_pok & SP_CASEFOLD) {    /* case insignificant? */
+       do {
+           if (big[pos] != first && big[pos] != fold[first])
+               continue;
+           for (x=big+pos+1,s=little; s < littleend; /**/ ) {
+               if (x >= bigend)
+                   return Nullch;
+               if (*s++ != *x++ && fold[*(s-1)] != *(x-1)) {
+                   s--;
+                   break;
+               }
+           }
+           if (s == littleend)
+#ifndef lint
+               return (char *)(big+pos);
+#else
+               return Nullch;
+#endif
+       } while (
+#ifndef lint
+               pos += screamnext[pos]  /* does this goof up anywhere? */
+#else
+               pos += screamnext[0]
+#endif
+           );
+    }
+    else {
+       do {
+           if (big[pos] != first)
+               continue;
+           for (x=big+pos+1,s=little; s < littleend; /**/ ) {
+               if (x >= bigend)
+                   return Nullch;
+               if (*s++ != *x++) {
+                   s--;
+                   break;
+               }
+           }
+           if (s == littleend)
+#ifndef lint
+               return (char *)(big+pos);
+#else
+               return Nullch;
+#endif
+       } while (
+#ifndef lint
+               pos += screamnext[pos]
+#else
+               pos += screamnext[0]
+#endif
+           );

     }
     return Nullch;
 }
     }
     return Nullch;
 }


@@ -175,12 +652,28 @@ char *
 savestr(str)
 char *str;
 {
 savestr(str)
 char *str;
 {

-    register char *newaddr = safemalloc((MEM_SIZE)(strlen(str)+1));
+    register char *newaddr;

 
 

+    New(902,newaddr,strlen(str)+1,char);

     (void)strcpy(newaddr,str);
     return newaddr;
 }
 
     (void)strcpy(newaddr,str);
     return newaddr;
 }
 

+/* same thing but with a known length */
+
+char *
+nsavestr(str, len)
+char *str;
+register int len;
+{
+    register char *newaddr;
+
+    New(903,newaddr,len+1,char);
+    (void)bcopy(str,newaddr,len);      /* might not be null terminated */
+    newaddr[len] = '\0';               /* is now */
+    return newaddr;
+}
+

 /* grow a static string to at least a certain length */
 
 void
 /* grow a static string to at least a certain length */
 
 void


@@ -191,25 +684,171 @@ int newlen;
 {
     if (newlen > *curlen) {            /* need more room? */
        if (*curlen)
 {
     if (newlen > *curlen) {            /* need more room? */
        if (*curlen)

-           *strptr = saferealloc(*strptr,(MEM_SIZE)newlen);
+           Renew(*strptr,newlen,char);

        else
        else

-           *strptr = safemalloc((MEM_SIZE)newlen);
+           New(905,*strptr,newlen,char);

        *curlen = newlen;
     }
 }
 
        *curlen = newlen;
     }
 }
 

+extern int errno;
+
+#ifndef VARARGS
+/*VARARGS1*/
+mess(pat,a1,a2,a3,a4)
+char *pat;
+long a1, a2, a3, a4;
+{
+    char *s;
+
+    s = buf;
+    (void)sprintf(s,pat,a1,a2,a3,a4);
+    s += strlen(s);
+    if (s[-1] != '\n') {
+       if (line) {
+           (void)sprintf(s," at %s line %ld",
+             in_eval?filename:origfilename, (long)line);
+           s += strlen(s);
+       }
+       if (last_in_stab &&
+           stab_io(last_in_stab) &&
+           stab_io(last_in_stab)->lines ) {
+           (void)sprintf(s,", <%s> line %ld",
+             last_in_stab == argvstab ? "" : stab_name(last_in_stab),
+             (long)stab_io(last_in_stab)->lines);
+           s += strlen(s);
+       }
+       (void)strcpy(s,".\n");
+    }
+}
+

 /*VARARGS1*/
 fatal(pat,a1,a2,a3,a4)
 char *pat;
 /*VARARGS1*/
 fatal(pat,a1,a2,a3,a4)
 char *pat;

+long a1, a2, a3, a4;

 {
     extern FILE *e_fp;
     extern char *e_tmpname;
 
 {
     extern FILE *e_fp;
     extern char *e_tmpname;
 

-    fprintf(stderr,pat,a1,a2,a3,a4);
+    mess(pat,a1,a2,a3,a4);
+    if (in_eval) {
+       str_set(stab_val(stabent("@",TRUE)),buf);
+       longjmp(eval_env,1);
+    }
+    fputs(buf,stderr);
+    (void)fflush(stderr);

     if (e_fp)
     if (e_fp)

-       UNLINK(e_tmpname);
-    exit(1);
+       (void)UNLINK(e_tmpname);
+    statusvalue >>= 8;
+    exit(errno?errno:(statusvalue?statusvalue:255));
+}
+
+/*VARARGS1*/
+warn(pat,a1,a2,a3,a4)
+char *pat;
+long a1, a2, a3, a4;
+{
+    mess(pat,a1,a2,a3,a4);
+    fputs(buf,stderr);
+#ifdef LEAKTEST
+#ifdef DEBUGGING
+    if (debug & 4096)
+       xstat();
+#endif
+#endif
+    (void)fflush(stderr);
+}
+#else
+/*VARARGS0*/
+mess(args)
+va_list args;
+{
+    char *pat;
+    char *s;
+#ifdef CHARVSPRINTF
+    char *vsprintf();
+#else
+    int vsprintf();
+#endif
+
+    s = buf;
+#ifdef lint
+    pat = Nullch;
+#else
+    pat = va_arg(args, char *);
+#endif
+    (void) vsprintf(s,pat,args);
+
+    s += strlen(s);
+    if (s[-1] != '\n') {
+       if (line) {
+           (void)sprintf(s," at %s line %ld",
+             in_eval?filename:origfilename, (long)line);
+           s += strlen(s);
+       }
+       if (last_in_stab &&
+           stab_io(last_in_stab) &&
+           stab_io(last_in_stab)->lines ) {
+           (void)sprintf(s,", <%s> line %ld",
+             last_in_stab == argvstab ? "" : last_in_stab->str_magic->str_ptr,
+             (long)stab_io(last_in_stab)->lines);
+           s += strlen(s);
+       }
+       (void)strcpy(s,".\n");
+    }
+}
+
+/*VARARGS0*/
+fatal(va_alist)
+va_dcl
+{
+    va_list args;
+    extern FILE *e_fp;
+    extern char *e_tmpname;
+
+#ifndef lint
+    va_start(args);
+#else
+    args = 0;
+#endif
+    mess(args);
+    va_end(args);
+    if (in_eval) {
+       str_set(stab_val(stabent("@",TRUE)),buf);
+       longjmp(eval_env,1);
+    }
+    fputs(buf,stderr);
+    (void)fflush(stderr);
+    if (e_fp)
+       (void)UNLINK(e_tmpname);
+    statusvalue >>= 8;
+    exit((int)(errno?errno:(statusvalue?statusvalue:255)));
+}
+
+/*VARARGS0*/
+warn(va_alist)
+va_dcl
+{
+    va_list args;
+
+#ifndef lint
+    va_start(args);
+#else
+    args = 0;
+#endif
+    mess(args);
+    va_end(args);
+
+    fputs(buf,stderr);
+#ifdef LEAKTEST
+#ifdef DEBUGGING
+    if (debug & 4096)
+       xstat();
+#endif
+#endif
+    (void)fflush(stderr);

 }
 }

+#endif

 
 static bool firstsetenv = TRUE;
 extern char **environ;
 
 static bool firstsetenv = TRUE;
 extern char **environ;


@@ -220,33 +859,32 @@ char *nam, *val;
 {
     register int i=envix(nam);         /* where does it go? */
 
 {
     register int i=envix(nam);         /* where does it go? */
 

+    if (!val) {
+       while (environ[i]) {
+           environ[i] = environ[i+1];
+           i++;
+       }
+       return;
+    }

     if (!environ[i]) {                 /* does not exist yet */
        if (firstsetenv) {              /* need we copy environment? */
            int j;
     if (!environ[i]) {                 /* does not exist yet */
        if (firstsetenv) {              /* need we copy environment? */
            int j;

-#ifndef lint
-           char **tmpenv = (char**)    /* point our wand at memory */
-               safemalloc((i+2) * sizeof(char*));
-#else
-           char **tmpenv = Null(char **);
-#endif /* lint */
-    
+           char **tmpenv;
+
+           New(901,tmpenv, i+2, char*);

            firstsetenv = FALSE;
            for (j=0; j<i; j++)         /* copy environment */
                tmpenv[j] = environ[j];
            environ = tmpenv;           /* tell exec where it is now */
        }
            firstsetenv = FALSE;
            for (j=0; j<i; j++)         /* copy environment */
                tmpenv[j] = environ[j];
            environ = tmpenv;           /* tell exec where it is now */
        }

-#ifndef lint

        else
        else

-           environ = (char**) saferealloc((char*) environ,
-               (i+2) * sizeof(char*));
-                                       /* just expand it a bit */
-#endif /* lint */
+           Renew(environ, i+2, char*); /* just expand it a bit */

        environ[i+1] = Nullch;  /* make sure it's null terminated */
     }
        environ[i+1] = Nullch;  /* make sure it's null terminated */
     }

-    environ[i] = safemalloc(strlen(nam) + strlen(val) + 2);
+    New(904, environ[i], strlen(nam) + strlen(val) + 2, char);

                                        /* this may or may not be in */
                                        /* the old environ structure */
                                        /* this may or may not be in */
                                        /* the old environ structure */

-    sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */
+    (void)sprintf(environ[i],"%s=%s",nam,val);/* all that work just for this */

 }
 
 int
 }
 
 int


@@ -261,3 +899,333 @@ char *nam;
     }                                  /* potential SEGV's */
     return i;
 }
     }                                  /* potential SEGV's */
     return i;
 }

+
+#ifdef EUNICE
+unlnk(f)       /* unlink all versions of a file */
+char *f;
+{
+    int i;
+
+    for (i = 0; unlink(f) >= 0; i++) ;
+    return i ? 0 : -1;
+}
+#endif
+
+#ifndef BCOPY
+#ifndef MEMCPY
+char *
+bcopy(from,to,len)
+register char *from;
+register char *to;
+register int len;
+{
+    char *retval = to;
+
+    while (len--)
+       *to++ = *from++;
+    return retval;
+}
+
+char *
+bzero(loc,len)
+register char *loc;
+register int len;
+{
+    char *retval = loc;
+
+    while (len--)
+       *loc++ = 0;
+    return retval;
+}
+#endif
+#endif
+
+#ifdef VARARGS
+#ifndef VPRINTF
+
+#ifdef CHARVSPRINTF
+char *
+#else
+int
+#endif
+vsprintf(dest, pat, args)
+char *dest, *pat, *args;
+{
+    FILE fakebuf;
+
+    fakebuf._ptr = dest;
+    fakebuf._cnt = 32767;
+    fakebuf._flag = _IOWRT|_IOSTRG;
+    _doprnt(pat, args, &fakebuf);      /* what a kludge */
+    (void)putc('\0', &fakebuf);
+#ifdef CHARVSPRINTF
+    return(dest);
+#else
+    return 0;          /* perl doesn't use return value */
+#endif
+}
+
+#ifdef DEBUGGING
+int
+vfprintf(fd, pat, args)
+FILE *fd;
+char *pat, *args;
+{
+    _doprnt(pat, args, fd);
+    return 0;          /* wrong, but perl doesn't use the return value */
+}
+#endif
+#endif /* VPRINTF */
+#endif /* VARARGS */
+
+#ifdef MYSWAP
+#if BYTEORDER != 04321
+short
+my_swap(s)
+short s;
+{
+#if (BYTEORDER & 1) == 0
+    short result;
+
+    result = ((s & 255) << 8) + ((s >> 8) & 255);
+    return result;
+#else
+    return s;
+#endif
+}
+
+long
+htonl(l)
+register long l;
+{
+    union {
+       long result;
+       char c[4];
+    } u;
+
+#if BYTEORDER == 01234
+    u.c[0] = (l >> 24) & 255;
+    u.c[1] = (l >> 16) & 255;
+    u.c[2] = (l >> 8) & 255;
+    u.c[3] = l & 255;
+    return u.result;
+#else
+#if ((BYTEORDER - 01111) & 0444) || !(BYTEORDER & 7)
+    fatal("Unknown BYTEORDER\n");
+#else
+    register int o;
+    register int s;
+
+    for (o = BYTEORDER - 01111, s = 0; s < 32; o >>= 3, s += 8) {
+       u.c[o & 7] = (l >> s) & 255;
+    }
+    return u.result;
+#endif
+#endif
+}
+
+long
+ntohl(l)
+register long l;
+{
+    union {
+       long l;
+       char c[4];
+    } u;
+
+#if BYTEORDER == 01234
+    u.c[0] = (l >> 24) & 255;
+    u.c[1] = (l >> 16) & 255;
+    u.c[2] = (l >> 8) & 255;
+    u.c[3] = l & 255;
+    return u.l;
+#else
+#if ((BYTEORDER - 01111) & 0444) || !(BYTEORDER & 7)
+    fatal("Unknown BYTEORDER\n");
+#else
+    register int o;
+    register int s;
+
+    u.l = l;
+    l = 0;
+    for (o = BYTEORDER - 01111, s = 0; s < 32; o >>= 3, s += 8) {
+       l |= (u.c[o & 7] & 255) << s;
+    }
+    return l;
+#endif
+#endif
+}
+
+#endif /* BYTEORDER != 04321 */
+#endif /* HTONS */
+
+FILE *
+mypopen(cmd,mode)
+char   *cmd;
+char   *mode;
+{
+    int p[2];
+    register int this, that;
+    register int pid;
+    STR *str;
+    int doexec = strNE(cmd,"-");
+
+    if (pipe(p) < 0)
+       return Nullfp;
+    this = (*mode == 'w');
+    that = !this;
+    while ((pid = (doexec?vfork():fork())) < 0) {
+       if (errno != EAGAIN) {
+           close(p[this]);
+           if (!doexec)
+               fatal("Can't fork");
+           return Nullfp;
+       }
+       sleep(5);
+    }
+    if (pid == 0) {
+#define THIS that
+#define THAT this
+       close(p[THAT]);
+       if (p[THIS] != (*mode == 'r')) {
+           dup2(p[THIS], *mode == 'r');
+           close(p[THIS]);
+       }
+       if (doexec) {
+#if !defined(FCNTL) || !defined(F_SETFD)
+           int fd;
+
+#ifndef NOFILE
+#define NOFILE 20
+#endif
+           for (fd = 3; fd < NOFILE; fd++)
+               close(fd);
+#endif
+           do_exec(cmd);       /* may or may not use the shell */
+           _exit(1);
+       }
+       if (tmpstab = stabent("$",allstabs))
+           str_numset(STAB_STR(tmpstab),(double)getpid());
+       return Nullfp;
+#undef THIS
+#undef THAT
+    }
+    close(p[that]);
+    str = afetch(pidstatary,p[this],TRUE);
+    str_numset(str,(double)pid);
+    str->str_cur = 0;
+    forkprocess = pid;
+    return fdopen(p[this], mode);
+}
+
+#ifdef NOTDEF
+dumpfds(s)
+char *s;
+{
+    int fd;
+    struct stat tmpstatbuf;
+
+    fprintf(stderr,"%s", s);
+    for (fd = 0; fd < 32; fd++) {
+       if (fstat(fd,&tmpstatbuf) >= 0)
+           fprintf(stderr," %d",fd);
+    }
+    fprintf(stderr,"\n");
+}
+#endif
+
+#ifndef DUP2
+dup2(oldfd,newfd)
+int oldfd;
+int newfd;
+{
+    int fdtmp[10];
+    int fdx = 0;
+    int fd;
+
+    close(newfd);
+    while ((fd = dup(oldfd)) != newfd) /* good enough for low fd's */
+       fdtmp[fdx++] = fd;
+    while (fdx > 0)
+       close(fdtmp[--fdx]);
+}
+#endif
+
+int
+mypclose(ptr)
+FILE *ptr;
+{
+    register int result;
+#ifdef VOIDSIG
+    void (*hstat)(), (*istat)(), (*qstat)();
+#else
+    int (*hstat)(), (*istat)(), (*qstat)();
+#endif
+    int status;
+    STR *str;
+    register int pid;
+
+    str = afetch(pidstatary,fileno(ptr),TRUE);
+    fclose(ptr);
+    pid = (int)str_gnum(str);
+    if (!pid)
+       return -1;
+    hstat = signal(SIGHUP, SIG_IGN);
+    istat = signal(SIGINT, SIG_IGN);
+    qstat = signal(SIGQUIT, SIG_IGN);
+#ifdef WAIT4
+    if (wait4(pid,&status,0,Null(struct rusage *)) < 0)
+       status = -1;
+#else
+    if (pid < 0)               /* already exited? */
+       status = str->str_cur;
+    else {
+       while ((result = wait(&status)) != pid && result >= 0)
+           pidgone(result,status);
+       if (result < 0)
+           status = -1;
+    }
+#endif
+    signal(SIGHUP, hstat);
+    signal(SIGINT, istat);
+    signal(SIGQUIT, qstat);
+    str_numset(str,0.0);
+    return(status);
+}
+
+pidgone(pid,status)
+int pid;
+int status;
+{
+#ifdef WAIT4
+    return;
+#else
+    register int count;
+    register STR *str;
+
+    for (count = pidstatary->ary_fill; count >= 0; --count) {
+       if ((str = afetch(pidstatary,count,FALSE)) &&
+         ((int)str->str_u.str_nval) == pid) {
+           str_numset(str, -str->str_u.str_nval);
+           str->str_cur = status;
+           return;
+       }
+    }
+#endif
+}
+
+#ifndef MEMCMP
+memcmp(s1,s2,len)
+register unsigned char *s1;
+register unsigned char *s2;
+register int len;
+{
+    register int tmp;
+
+    while (len--) {
+       if (tmp = *s1++ - *s2++)
+           return tmp;
+    }
+    return 0;
+}
+#endif /* MEMCMP */