BSD 4_4_Lite2 release

[unix-history] / usr / src / usr.bin / sed / compile.c

diff --git a/usr/src/usr.bin/sed/compile.c b/usr/src/usr.bin/sed/compile.c
index 3f7ce92..8ad1b2d 100644 (file)
--- a/usr/src/usr.bin/sed/compile.c
+++ b/usr/src/usr.bin/sed/compile.c
@@ -1,16 +1,42 @@
 /*-
  * Copyright (c) 1992 Diomidis Spinellis.
 /*-
  * Copyright (c) 1992 Diomidis Spinellis.

- * Copyright (c) 1992 The Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1992, 1993
+ *     The Regents of the University of California.  All rights reserved.

  *
  * This code is derived from software contributed to Berkeley by
  * Diomidis Spinellis of Imperial College, University of London.
  *
  *
  * This code is derived from software contributed to Berkeley by
  * Diomidis Spinellis of Imperial College, University of London.
  *

- * %sccs.include.redist.c%
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *     This product includes software developed by the University of
+ *     California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.

  */
 
 #ifndef lint
  */
 
 #ifndef lint

-static char sccsid[] = "@(#)compile.c  5.7 (Berkeley) %G%";
+static char sccsid[] = "@(#)compile.c  8.2 (Berkeley) 4/28/95";

 #endif /* not lint */
 
 #include <sys/types.h>
 #endif /* not lint */
 
 #include <sys/types.h>


@@ -28,6 +54,15 @@ static char sccsid[] = "@(#)compile.c        5.7 (Berkeley) %G%";
 #include "defs.h"
 #include "extern.h"
 
 #include "defs.h"
 #include "extern.h"
 

+#define LHSZ   128
+#define        LHMASK  (LHSZ - 1)
+static struct labhash {
+       struct  labhash *lh_next;
+       u_int   lh_hash;
+       struct  s_command *lh_cmd;
+       int     lh_ref;
+} *labels[LHSZ];
+

 static char     *compile_addr __P((char *, struct s_addr *));
 static char     *compile_delimited __P((char *, char *));
 static char     *compile_flags __P((char *, struct s_subst *));
 static char     *compile_addr __P((char *, struct s_addr *));
 static char     *compile_delimited __P((char *, char *));
 static char     *compile_flags __P((char *, struct s_subst *));


@@ -38,11 +73,11 @@ static char  *compile_tr __P((char *, char **));
 static struct s_command
                **compile_stream __P((char *, struct s_command **, char *));
 static char     *duptoeol __P((char *, char *));
 static struct s_command
                **compile_stream __P((char *, struct s_command **, char *));
 static char     *duptoeol __P((char *, char *));

+static void      enterlabel __P((struct s_command *));

 static struct s_command
 static struct s_command

-                *findlabel __P((struct s_command *, struct s_command *));
-static void      fixuplabel __P((struct s_command *, struct s_command *,
-                       struct s_command *));
-static void      uselabel __P((struct s_command *));
+                *findlabel __P((char *));
+static void      fixuplabel __P((struct s_command *, struct s_command *));
+static void      uselabel __P((void));

 
 /*
  * Command specification.  This is used to drive the command parser.
 
 /*
  * Command specification.  This is used to drive the command parser.


@@ -95,7 +130,8 @@ void
 compile()
 {
        *compile_stream(NULL, &prog, NULL) = NULL;
 compile()
 {
        *compile_stream(NULL, &prog, NULL) = NULL;

-       fixuplabel(prog, prog, NULL);
+       fixuplabel(prog, NULL);
+       uselabel();

        appends = xmalloc(sizeof(struct s_appends) * appendnum);
        match = xmalloc((maxnsub + 1) * sizeof(regmatch_t));
 }
        appends = xmalloc(sizeof(struct s_appends) * appendnum);
        match = xmalloc((maxnsub + 1) * sizeof(regmatch_t));
 }


@@ -136,10 +172,9 @@ semicolon: EATSPACE();
                }
                *link = cmd = xmalloc(sizeof(struct s_command));
                link = &cmd->next;
                }
                *link = cmd = xmalloc(sizeof(struct s_command));
                link = &cmd->next;

-               cmd->lused = cmd->nonsel = cmd->inrange = 0;
+               cmd->nonsel = cmd->inrange = 0;

                /* First parse the addresses */
                naddr = 0;
                /* First parse the addresses */
                naddr = 0;

-               cmd->a1 = cmd->a2 = NULL;

 
 /* Valid characters to start an address */
 #define        addrchar(c)     (strchr("0123456789/\\$", (c)))
 
 /* Valid characters to start an address */
 #define        addrchar(c)     (strchr("0123456789/\\$", (c)))


@@ -149,16 +184,18 @@ semicolon:        EATSPACE();
                        p = compile_addr(p, cmd->a1);
                        EATSPACE();                             /* EXTENSION */
                        if (*p == ',') {
                        p = compile_addr(p, cmd->a1);
                        EATSPACE();                             /* EXTENSION */
                        if (*p == ',') {

-                               naddr++;

                                p++;
                                EATSPACE();                     /* EXTENSION */
                                p++;
                                EATSPACE();                     /* EXTENSION */

+                               naddr++;

                                cmd->a2 = xmalloc(sizeof(struct s_addr));
                                p = compile_addr(p, cmd->a2);
                                cmd->a2 = xmalloc(sizeof(struct s_addr));
                                p = compile_addr(p, cmd->a2);

-                       }
-               }
+                               EATSPACE();
+                       } else
+                               cmd->a2 = 0;
+               } else
+                       cmd->a1 = cmd->a2 = 0;

 
 nonsel:                /* Now parse the command */
 
 nonsel:                /* Now parse the command */

-               EATSPACE();

                if (!*p)
                        err(COMPILE, "command expected");
                cmd->code = *p;
                if (!*p)
                        err(COMPILE, "command expected");
                cmd->code = *p;


@@ -172,8 +209,9 @@ nonsel:             /* Now parse the command */
 "command %c expects up to %d address(es), found %d", *p, fp->naddr, naddr);
                switch (fp->args) {
                case NONSEL:                    /* ! */
 "command %c expects up to %d address(es), found %d", *p, fp->naddr, naddr);
                switch (fp->args) {
                case NONSEL:                    /* ! */

-                       cmd->nonsel = ! cmd->nonsel;

                        p++;
                        p++;

+                       EATSPACE();
+                       cmd->nonsel = ! cmd->nonsel;

                        goto nonsel;
                case GROUP:                     /* { */
                        p++;
                        goto nonsel;
                case GROUP:                     /* { */
                        p++;


@@ -185,6 +223,12 @@ nonsel:            /* Now parse the command */
                        *compile_stream("}", &cmd->u.c, p) = cmd2;
                        cmd->next = cmd2;
                        link = &cmd2->next;
                        *compile_stream("}", &cmd->u.c, p) = cmd2;
                        cmd->next = cmd2;
                        link = &cmd2->next;

+                       /*
+                        * Short-circuit command processing, since end of
+                        * group is really just a noop.
+                        */
+                       cmd2->nonsel = 1;
+                       cmd2->a1 = cmd2->a2 = 0;

                        break;
                case EMPTY:             /* d D g G h H l n N p P q x = \0 */
                        p++;
                        break;
                case EMPTY:             /* d D g G h H l n N p P q x = \0 */
                        p++;


@@ -248,6 +292,7 @@ nonsel:             /* Now parse the command */
                        cmd->t = duptoeol(p, "label");
                        if (strlen(p) == 0)
                                err(COMPILE, "empty label");
                        cmd->t = duptoeol(p, "label");
                        if (strlen(p) == 0)
                                err(COMPILE, "empty label");

+                       enterlabel(cmd);

                        break;
                case SUBST:                     /* s */
                        p++;
                        break;
                case SUBST:                     /* s */
                        p++;


@@ -629,44 +674,64 @@ duptoeol(s, ctype)
 }
 
 /*
 }
 
 /*

- * Convert goto label names to addresses.  Detect unused and duplicate labels.
- * Set appendnum to the number of a and r commands in the script.  Free the
- * memory used by labels in b and t commands (but not by :).  Root is a pointer
- * to the script linked list; cp points to the search start.
+ * Convert goto label names to addresses, and count a and r commands, in
+ * the given subset of the script.  Free the memory used by labels in b
+ * and t commands (but not by :).

  *
  * TODO: Remove } nodes
  */
 static void
  *
  * TODO: Remove } nodes
  */
 static void

-fixuplabel(root, cp, end)
-       struct s_command *root, *cp, *end;
+fixuplabel(cp, end)
+       struct s_command *cp, *end;

 {
 
        for (; cp != end; cp = cp->next)
                switch (cp->code) {
 {
 
        for (; cp != end; cp = cp->next)
                switch (cp->code) {

-               case ':':
-                       if (findlabel(cp, root))
-                               err(COMPILE2, "duplicate label %s", cp->t);
-                       break;

                case 'a':
                case 'r':
                        appendnum++;
                        break;
                case 'b':
                case 't':
                case 'a':
                case 'r':
                        appendnum++;
                        break;
                case 'b':
                case 't':

+                       /* Resolve branch target. */

                        if (cp->t == NULL) {
                                cp->u.c = NULL;
                                break;
                        }
                        if (cp->t == NULL) {
                                cp->u.c = NULL;
                                break;
                        }

-                       if ((cp->u.c = findlabel(cp, root)) == NULL)
+                       if ((cp->u.c = findlabel(cp->t)) == NULL)

                                err(COMPILE2, "undefined label '%s'", cp->t);
                                err(COMPILE2, "undefined label '%s'", cp->t);

-                       cp->u.c->lused = 1;

                        free(cp->t);
                        break;
                case '{':
                        free(cp->t);
                        break;
                case '{':

-                       fixuplabel(root, cp->u.c, cp->next);
+                       /* Do interior commands. */
+                       fixuplabel(cp->u.c, cp->next);

                        break;
                }
                        break;
                }

-       uselabel(root);
+}
+
+/*
+ * Associate the given command label for later lookup.
+ */
+static void
+enterlabel(cp)
+       struct s_command *cp;
+{
+       register struct labhash **lhp, *lh;
+       register u_char *p;
+       register u_int h, c;
+
+       for (h = 0, p = (u_char *)cp->t; (c = *p) != 0; p++)
+               h = (h << 5) + h + c;
+       lhp = &labels[h & LHMASK];
+       for (lh = *lhp; lh != NULL; lh = lh->lh_next)
+               if (lh->lh_hash == h && strcmp(cp->t, lh->lh_cmd->t) == 0)
+                       err(COMPILE2, "duplicate label '%s'", cp->t);
+       lh = xmalloc(sizeof *lh);
+       lh->lh_next = *lhp;
+       lh->lh_hash = h;
+       lh->lh_cmd = cp;
+       lh->lh_ref = 0;
+       *lhp = lh;

 }
 
 /*
 }
 
 /*


@@ -674,33 +739,41 @@ fixuplabel(root, cp, end)
  * list cp.  L is excluded from the search.  Return NULL if not found.
  */
 static struct s_command *
  * list cp.  L is excluded from the search.  Return NULL if not found.
  */
 static struct s_command *

-findlabel(l, cp)
-       struct s_command *l, *cp;
+findlabel(name)
+       char *name;

 {
 {

-       struct s_command *r;
-
-       for (; cp; cp = cp->next) {
-               if (cp->code == ':' && cp != l && strcmp(l->t, cp->t) == 0)
-                       return (cp);
-               if (cp->code == '{' && (r = findlabel(l, cp->u.c)))
-                       return (r);
+       register struct labhash *lh;
+       register u_char *p;
+       register u_int h, c;
+
+       for (h = 0, p = (u_char *)name; (c = *p) != 0; p++)
+               h = (h << 5) + h + c;
+       for (lh = labels[h & LHMASK]; lh != NULL; lh = lh->lh_next) {
+               if (lh->lh_hash == h && strcmp(name, lh->lh_cmd->t) == 0) {
+                       lh->lh_ref = 1;
+                       return (lh->lh_cmd);
+               }

        }
        return (NULL);
 }
 
 /* 
        }
        return (NULL);
 }
 
 /* 

- * Find any unused labels.  This is because we want to warn the user if they
- * accidentally put whitespace on a label name causing it be a different label
- * than they intended.
+ * Warn about any unused labels.  As a side effect, release the label hash
+ * table space.

  */
 static void
  */
 static void

-uselabel(cp)
-       struct s_command *cp;
+uselabel()

 {
 {

-       for (; cp; cp = cp->next) {
-               if (cp->code == ':' && cp->lused == 0)
-                       err(WARNING, "unused label '%s'", cp->t);
-               if (cp->code == '{')
-                       uselabel(cp->u.c);
+       register struct labhash *lh, *next;
+       register int i;
+
+       for (i = 0; i < LHSZ; i++) {
+               for (lh = labels[i]; lh != NULL; lh = next) {
+                       next = lh->lh_next;
+                       if (!lh->lh_ref)
+                               err(WARNING, "unused label '%s'",
+                                   lh->lh_cmd->t);
+                       free(lh);
+               }

        }
 }
        }
 }