]> git.cameronkatri.com Git - mandoc.git/blobdiff - roff.c
git.ckatri.com / mandoc.git / blobdiff
? search:
summary | shortlog | log | commit | commitdiff | tree
raw | inline | side by side
Add a test case for nesting of .RS/.RE
[mandoc.git] / roff.c
diff --git a/roff.c b/roff.c
index 37d62c041c77e01e667d92a4489339fe7901e903..a6544c9fdadb2b69cf4a0dd9b13ef4d4c0e46404 100644 (file)
--- a/roff.c
+++ b/roff.c
@@ -1,1404 +1,554 @@
-/* $Id: roff.c,v 1.49 2008/12/07 16:41:04 kristaps Exp $ */
+/*     $Id: roff.c,v 1.78 2010/05/16 22:28:33 kristaps Exp $ */
 /*
 /*
- * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
+ * Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv>
  *
  * Permission to use, copy, modify, and distribute this software for any
  *
  * Permission to use, copy, modify, and distribute this software for any
- * purpose with or without fee is hereby granted, provided that the
- * above copyright notice and this permission notice appear in all
- * copies.
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
  *
  *
- * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
- * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
- * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
- * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
- * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
- * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  */
  */
-#include <sys/param.h>
-#include <sys/types.h>
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
 
 #include <assert.h>
 
 #include <assert.h>
-#include <ctype.h>
-#include <err.h>
-#include <stdarg.h>
 #include <stdlib.h>
 #include <stdlib.h>
-#include <stdio.h>
 #include <string.h>
 #include <string.h>
-#include <time.h>
+#include <stdio.h>
 
 
-#include "libmdocml.h"
-#include "private.h"
+#include "mandoc.h"
 #include "roff.h"
 
 #include "roff.h"
 
-/* FIXME: First letters of quoted-text interpreted in rofffindtok. */
-/* FIXME: `No' not implemented. */
-/* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */
-/* TODO: warn about "X section only" macros. */
-/* TODO: warn about empty lists. */
-/* TODO: (warn) some sections need specific elements. */
-/* TODO: (warn) NAME section has particular order. */
-/* TODO: unify empty-content tags a la <br />. */
-/* TODO: macros with a set number of arguments? */
-/* TODO: validate Dt macro arguments. */
-/* FIXME: Bl -diag supposed to ignore callable children. */
-/* FIXME: Nm has newline when used in NAME section. */
+#define        ROFF_CTL(c) \
+       ('.' == (c) || '\'' == (c))
+#if    0
+#define        ROFF_MDEBUG(p, str) \
+       fprintf(stderr, "%s: %s (%d:%d)\n", (str), \
+               roffs[(p)->last->tok].name, \
+               (p)->last->line, (p)->last->col)
+#else
+#define        ROFF_MDEBUG(p, str) while (/* CONSTCOND */ 0)
+#endif
 
 
-struct roffnode {
-       int               tok;                  /* Token id. */
-       struct roffnode  *parent;               /* Parent (or NULL). */
+enum   rofft {
+       ROFF_if,
+       ROFF_ig,
+       ROFF_cblock,
+       ROFF_ccond,
+#if 0
+       ROFF_am,
+       ROFF_ami,
+       ROFF_de,
+       ROFF_dei,
+       ROFF_close,
+#endif
+       ROFF_MAX
 };
 
 };
 
-struct rofftree {
-       struct roffnode  *last;                 /* Last parsed node. */
-       char             *cur;                  /* Line start. */
-       struct tm         tm;                   /* `Dd' results. */
-       char              name[64];             /* `Nm' results. */
-       char              os[64];               /* `Os' results. */
-       char              title[64];            /* `Dt' results. */
-       char              section[64];          /* `Dt' results. */
-       char              volume[64];           /* `Dt' results. */
-       int               state;
-#define        ROFF_PRELUDE     (1 << 1)               /* In roff prelude. */
-#define        ROFF_PRELUDE_Os  (1 << 2)               /* `Os' is parsed. */
-#define        ROFF_PRELUDE_Dt  (1 << 3)               /* `Dt' is parsed. */
-#define        ROFF_PRELUDE_Dd  (1 << 4)               /* `Dd' is parsed. */
-#define        ROFF_BODY        (1 << 5)               /* In roff body. */
-       struct roffcb     cb;                   /* Callbacks. */
-       void             *arg;                  /* Callbacks' arg. */
+struct roff {
+       struct roffnode *last; /* leaf of stack */
+       mandocmsg        msg; /* err/warn/fatal messages */
+       void            *data; /* privdata for messages */
 };
 
 };
 
-static struct roffnode  *roffnode_new(int, struct rofftree *);
-static void              roffnode_free(struct rofftree *);
-static void              roff_warn(const struct rofftree *, 
-                               const char *, char *, ...);
-static void              roff_err(const struct rofftree *, 
-                               const char *, char *, ...);
-static int               roffpurgepunct(struct rofftree *, char **);
-static int               roffscan(int, const int *);
-static int               rofffindtok(const char *);
-static int               rofffindarg(const char *);
-static int               rofffindcallable(const char *);
-static int               roffargs(const struct rofftree *,
-                               int, char *, char **);
-static int               roffargok(int, int);
-static int               roffnextopt(const struct rofftree *,
-                               int, char ***, char **);
-static int               roffparseopts(struct rofftree *, int, 
-                               char ***, int *, char **);
-static int               roffcall(struct rofftree *, int, char **);
-static int               roffparse(struct rofftree *, char *);
-static int               textparse(struct rofftree *, char *);
-static int               roffdata(struct rofftree *, int, char *);
-static int               roffspecial(struct rofftree *, int, 
-                               const char *, const int *,
-                               const char **, size_t, char **);
-static int               roffsetname(struct rofftree *, char **);
-
-#ifdef __linux__ 
-extern size_t            strlcat(char *, const char *, size_t);
-extern size_t            strlcpy(char *, const char *, size_t);
-extern int               vsnprintf(char *, size_t, 
-                               const char *, va_list);
-extern char             *strptime(const char *, const char *,
-                               struct tm *);
-#endif
-
-int
-roff_free(struct rofftree *tree, int flush)
-{
-       int              error, t;
-       struct roffnode *n;
-
-       error = 0;
-
-       if ( ! flush)
-               goto end;
-
-       error = 1;
-
-       if (ROFF_PRELUDE & tree->state) {
-               roff_err(tree, NULL, "prelude never finished");
-               goto end;
-       } 
-
-       for (n = tree->last; n; n = n->parent) {
-               if (0 != tokens[n->tok].ctx) 
-                       continue;
-               roff_err(tree, NULL, "closing explicit scope `%s'", 
-                               toknames[n->tok]);
-               goto end;
-       }
-
-       while (tree->last) {
-               t = tree->last->tok;
-               if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
-                       goto end;
-       }
-
-       if ( ! (*tree->cb.rofftail)(tree->arg))
-               goto end;
-
-       error = 0;
-
-end:
+struct roffnode {
+       enum rofft       tok; /* type of node */
+       struct roffnode *parent; /* up one in stack */
+       char            *end; /* end-token: custom */
+       int              line; /* parse line */
+       int              col; /* parse col */
+       int              endspan;
+};
 
 
-       while (tree->last) 
-               roffnode_free(tree);
+#define        ROFF_ARGS        struct roff *r, /* parse ctx */ \
+                        enum rofft tok, /* tok of macro */ \
+                        char **bufp, /* input buffer */ \
+                        size_t *szp, /* size of input buffer */ \
+                        int ln, /* parse line */ \
+                        int ppos, /* original pos in buffer */ \
+                        int pos, /* current pos in buffer */ \
+                        int *offs /* reset offset of buffer data */
+
+typedef        enum rofferr (*roffproc)(ROFF_ARGS);
+
+struct roffmac {
+       const char      *name; /* macro name */
+       roffproc         proc;
+       roffproc         text;
+};
 
 
-       free(tree);
+static enum rofferr     roff_if(ROFF_ARGS);
+static enum rofferr     roff_if_text(ROFF_ARGS);
+static enum rofferr     roff_ig(ROFF_ARGS);
+static enum rofferr     roff_ig_text(ROFF_ARGS);
+static enum rofferr     roff_cblock(ROFF_ARGS);
+static enum rofferr     roff_ccond(ROFF_ARGS);
+
+const  struct roffmac   roffs[ROFF_MAX] = {
+       { "if", roff_if, roff_if_text },
+       { "ig", roff_ig, roff_ig_text },
+       { ".", roff_cblock, NULL },
+       { "\\}", roff_ccond, NULL },
+};
 
 
-       return(error ? 0 : 1);
-}
+static void             roff_free1(struct roff *);
+static enum rofft       roff_hash_find(const char *);
+static void             roffnode_cleanscope(struct roff *);
+static int              roffnode_push(struct roff *, 
+                               enum rofft, int, int);
+static void             roffnode_pop(struct roff *);
+static enum rofft       roff_parse(const char *, int *);
 
 
 
 
-struct rofftree *
-roff_alloc(const struct roffcb *cb, void *args)
+/*
+ * Look up a roff token by its name.  Returns ROFF_MAX if no macro by
+ * the nil-terminated string name could be found.
+ */
+static enum rofft
+roff_hash_find(const char *p)
 {
 {
-       struct rofftree *tree;
-
-       assert(args);
-       assert(cb);
-
-       if (NULL == (tree = calloc(1, sizeof(struct rofftree))))
-               err(1, "calloc");
+       int              i;
 
 
-       tree->state = ROFF_PRELUDE;
-       tree->arg = args;
+       /* FIXME: make this be fast and efficient. */
 
 
-       (void)memcpy(&tree->cb, cb, sizeof(struct roffcb));
+       for (i = 0; i < (int)ROFF_MAX; i++)
+               if (0 == strcmp(roffs[i].name, p))
+                       return((enum rofft)i);
 
 
-       return(tree);
+       return(ROFF_MAX);
 }
 
 
 }
 
 
-int
-roff_engine(struct rofftree *tree, char *buf)
+/*
+ * Pop the current node off of the stack of roff instructions currently
+ * pending.
+ */
+static void
+roffnode_pop(struct roff *r)
 {
 {
+       struct roffnode *p;
 
 
-       tree->cur = buf;
-       assert(buf);
-
-       if (0 == *buf) {
-               roff_err(tree, buf, "blank line");
-               return(0);
-       } else if ('.' != *buf)
-               return(textparse(tree, buf));
-
-       return(roffparse(tree, buf));
+       assert(r->last);
+       p = r->last; 
+       r->last = r->last->parent;
+       if (p->end)
+               free(p->end);
+       free(p);
 }
 
 
 }
 
 
+/*
+ * Push a roff node onto the instruction stack.  This must later be
+ * removed with roffnode_pop().
+ */
 static int
 static int
-textparse(struct rofftree *tree, char *buf)
+roffnode_push(struct roff *r, enum rofft tok, int line, int col)
 {
 {
-       char            *bufp;
-
-       /* TODO: literal parsing. */
+       struct roffnode *p;
 
 
-       if ( ! (ROFF_BODY & tree->state)) {
-               roff_err(tree, buf, "data not in body");
+       if (NULL == (p = calloc(1, sizeof(struct roffnode)))) {
+               (*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL);
                return(0);
        }
 
                return(0);
        }
 
-       /* LINTED */
-       while (*buf) {
-               while (*buf && isspace(*buf))
-                       buf++;
-
-               if (0 == *buf)
-                       break;
-
-               bufp = buf++;
-
-               while (*buf && ! isspace(*buf))
-                       buf++;
-
-               if (0 != *buf) {
-                       *buf++ = 0;
-                       if ( ! roffdata(tree, 1, bufp))
-                               return(0);
-                       continue;
-               }
-
-               if ( ! roffdata(tree, 1, bufp))
-                       return(0);
-               break;
-       }
+       p->tok = tok;
+       p->parent = r->last;
+       p->line = line;
+       p->col = col;
 
 
+       r->last = p;
        return(1);
 }
 
 
        return(1);
 }
 
 
-static int
-roffargs(const struct rofftree *tree, 
-               int tok, char *buf, char **argv)
+static void
+roff_free1(struct roff *r)
 {
 {
-       int              i;
-       char            *p;
-
-       assert(tok >= 0 && tok < ROFF_MAX);
-       assert('.' == *buf);
 
 
-       p = buf;
-
-       /*
-        * This is an ugly little loop.  It parses a line into
-        * space-delimited tokens.  If a quote mark is encountered, a
-        * token is alloted the entire quoted text.  If whitespace is
-        * escaped, it's included in the prior alloted token.
-        */
-
-       /* LINTED */
-       for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) {
-               if ('\"' == *buf) {
-                       argv[i] = ++buf;
-                       while (*buf && '\"' != *buf)
-                               buf++;
-                       if (0 == *buf) {
-                               roff_err(tree, argv[i], "unclosed "
-                                               "quote in argument "
-                                               "list for `%s'", 
-                                               toknames[tok]);
-                               return(0);
-                       }
-               } else { 
-                       argv[i] = buf++;
-                       while (*buf) {
-                               if ( ! isspace(*buf)) {
-                                       buf++;
-                                       continue;
-                               }
-                               if (*(buf - 1) == '\\') {
-                                       buf++;
-                                       continue;
-                               }
-                               break;
-                       }
-                       if (0 == *buf)
-                               continue;
-               }
-               *buf++ = 0;
-               while (*buf && isspace(*buf))
-                       buf++;
-       }
-
-       assert(i > 0);
-       if (ROFF_MAXLINEARG == i && *buf) {
-               roff_err(tree, p, "too many arguments for `%s'", toknames
-                               [tok]);
-               return(0);
-       }
-
-       argv[i] = NULL;
-       return(1);
+       while (r->last)
+               roffnode_pop(r);
 }
 
 
 }
 
 
-static int
-roffscan(int tok, const int *tokv)
+void
+roff_reset(struct roff *r)
 {
 
 {
 
-       if (NULL == tokv)
-               return(1);
-
-       for ( ; ROFF_MAX != *tokv; tokv++) 
-               if (tok == *tokv)
-                       return(1);
-
-       return(0);
+       roff_free1(r);
 }
 
 
 }
 
 
-static int
-roffparse(struct rofftree *tree, char *buf)
+void
+roff_free(struct roff *r)
 {
 {
-       int               tok, t;
-       struct roffnode  *n;
-       char             *argv[ROFF_MAXLINEARG];
-       char            **argvp;
-
-       if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2))
-               if (0 == strncmp(buf, ".\\\"", 3))
-                       return(1);
 
 
-       if (ROFF_MAX == (tok = rofffindtok(buf + 1))) {
-               roff_err(tree, buf + 1, "bogus line macro");
-               return(0);
-       } else if (NULL == tokens[tok].cb) {
-               roff_err(tree, buf + 1, "unsupported macro `%s'", 
-                               toknames[tok]);
-               return(0);
-       }
-
-       assert(ROFF___ != tok);
-       if ( ! roffargs(tree, tok, buf, argv)) 
-               return(0);
-
-       argvp = (char **)argv;
-
-       /* 
-        * Prelude macros break some assumptions, so branch now. 
-        */
-       
-       if (ROFF_PRELUDE & tree->state) {
-               assert(NULL == tree->last);
-               return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
-       } 
-
-       assert(ROFF_BODY & tree->state);
+       roff_free1(r);
+       free(r);
+}
 
 
-       /* 
-        * First check that our possible parents and parent's possible
-        * children are satisfied.  
-        */
 
 
-       if (tree->last && ! roffscan
-                       (tree->last->tok, tokens[tok].parents)) {
-               roff_err(tree, *argvp, "`%s' has invalid parent `%s'",
-                               toknames[tok], 
-                               toknames[tree->last->tok]);
-               return(0);
-       } 
+struct roff *
+roff_alloc(const mandocmsg msg, void *data)
+{
+       struct roff     *r;
 
 
-       if (tree->last && ! roffscan
-                       (tok, tokens[tree->last->tok].children)) {
-               roff_err(tree, *argvp, "`%s' is invalid child of `%s'",
-                               toknames[tok],
-                               toknames[tree->last->tok]);
+       if (NULL == (r = calloc(1, sizeof(struct roff)))) {
+               (*msg)(MANDOCERR_MEM, data, 0, 0, NULL);
                return(0);
        }
 
                return(0);
        }
 
-       /*
-        * Branch if we're not a layout token.
-        */
+       r->msg = msg;
+       r->data = data;
+       return(r);
+}
 
 
-       if (ROFF_LAYOUT != tokens[tok].type)
-               return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
-       if (0 == tokens[tok].ctx)
-               return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
 
 
-       /*
-        * First consider implicit-end tags, like as follows:
-        *      .Sh SECTION 1
-        *      .Sh SECTION 2
-        * In this, we want to close the scope of the NAME section.  If
-        * there's an intermediary implicit-end tag, such as
-        *      .Sh SECTION 1
-        *      .Ss Subsection 1
-        *      .Sh SECTION 2
-        * then it must be closed as well.
-        */
+enum rofferr
+roff_parseln(struct roff *r, int ln, 
+               char **bufp, size_t *szp, int pos, int *offs)
+{
+       enum rofft       t;
+       int              ppos, i, j, wtf;
 
 
-       if (tok == tokens[tok].ctx) {
-               /* 
-                * First search up to the point where we must close.
-                * If one doesn't exist, then we can open a new scope.
+       if (r->last && ! ROFF_CTL((*bufp)[pos])) {
+               /*
+                * If a scope is open and we're not a macro, pass it
+                * through our text detector and continue as quickly as
+                * possible.
                 */
                 */
-
-               for (n = tree->last; n; n = n->parent) {
-                       assert(0 == tokens[n->tok].ctx ||
-                                       n->tok == tokens[n->tok].ctx);
-                       if (n->tok == tok)
-                               break;
-                       if (ROFF_SHALLOW & tokens[tok].flags) {
-                               n = NULL;
-                               break;
-                       }
-                       if (tokens[n->tok].ctx == n->tok)
-                               continue;
-                       roff_err(tree, *argv, "`%s' breaks `%s' scope",
-                                       toknames[tok], toknames[n->tok]);
-                       return(0);
-               }
-
+               t = r->last->tok;
+               assert(roffs[t].text);
+               return((*roffs[t].text)
+                               (r, t, bufp, szp, ln, pos, pos, offs));
+       } else if ( ! ROFF_CTL((*bufp)[pos]))
                /*
                /*
-                * Create a new scope, as no previous one exists to
-                * close out.
+                * Don't do anything if we're free-form text.
                 */
                 */
+               return(ROFF_CONT);
 
 
-               if (NULL == n)
-                       return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
+       /* A macro-ish line with a possibly-open macro context. */
 
 
-               /* 
-                * Close out all intermediary scoped blocks, then hang
-                * the current scope from our predecessor's parent.
+       wtf = 0;
+
+       if (r->last && r->last->end) {
+               /*
+                * We have a scope open that has a custom end-macro
+                * handler.  Try to match it against the input.
                 */
                 */
+               i = pos + 1;
+               while (' ' == (*bufp)[i] || '\t' == (*bufp)[i])
+                       i++;
 
 
-               do {
-                       t = tree->last->tok;
-                       if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
-                               return(0);
-               } while (t != tok);
+               for (j = 0; r->last->end[j]; j++, i++)
+                       if ((*bufp)[i] != r->last->end[j])
+                               break;
 
 
-               return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
+               if ('\0' == r->last->end[j] && 
+                               ('\0' == (*bufp)[i] ||
+                                ' ' == (*bufp)[i] ||
+                                '\t' == (*bufp)[i])) {
+                       roffnode_pop(r);
+                       roffnode_cleanscope(r);
+                       wtf = 1;
+               }
        }
 
        }
 
-       /*
-        * Now consider explicit-end tags, where we want to close back
-        * to a specific tag.  Example:
-        *      .Bl
-        *      .It Item.
-        *      .El
-        * In this, the `El' tag closes out the scope of `Bl'.
-        */
-
-       assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx);
-
-       /* LINTED */
-       for (n = tree->last; n; n = n->parent)
-               if (n->tok != tokens[tok].ctx) {
-                       if (n->tok == tokens[n->tok].ctx)
-                               continue;
-                       roff_err(tree, *argv, "`%s' breaks `%s' scope",
-                                       toknames[tok], toknames[n->tok]);
-                       return(0);
-               } else
-                       break;
-
+       ppos = pos;
+       if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) {
+               /* 
+                * This is some of groff's stranger behaviours.  If we
+                * encountered a custom end-scope tag and that tag also
+                * happens to be a "real" macro, then we need to try
+                * interpreting it again as a real macro.  If it's not,
+                * then return ignore.  Else continue.
+                */
+               if (wtf)
+                       return(ROFF_IGN);
+               else if (NULL == r->last)
+                       return(ROFF_CONT);
 
 
-       if (NULL == n) {
-               roff_err(tree, *argv, "`%s' has no starting tag `%s'",
-                               toknames[tok], 
-                               toknames[tokens[tok].ctx]);
-               return(0);
+               /* FIXME: this assumes that we ignore!? */
+               return(ROFF_IGN);
        }
 
        }
 
-       /* LINTED */
-       do {
-               t = tree->last->tok;
-               if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
-                       return(0);
-       } while (t != tokens[tok].ctx);
-
-       return(1);
-}
-
-
-static int
-rofffindarg(const char *name)
-{
-       size_t           i;
-
-       /* FIXME: use a table, this is slow but ok for now. */
-
-       /* LINTED */
-       for (i = 0; i < ROFF_ARGMAX; i++)
-               /* LINTED */
-               if (0 == strcmp(name, tokargnames[i]))
-                       return((int)i);
-       
-       return(ROFF_ARGMAX);
-}
-
-
-static int
-rofffindtok(const char *buf)
-{
-       char             token[4];
-       int              i;
-
-       for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++)
-               token[i] = *buf;
-
-       if (i == 3) 
-               return(ROFF_MAX);
-
-       token[i] = 0;
-
-       /* FIXME: use a table, this is slow but ok for now. */
-
-       /* LINTED */
-       for (i = 0; i < ROFF_MAX; i++)
-               /* LINTED */
-               if (0 == strcmp(toknames[i], token))
-                       return((int)i);
-
-       return(ROFF_MAX);
+       assert(roffs[t].proc);
+       return((*roffs[t].proc)
+                       (r, t, bufp, szp, ln, ppos, pos, offs));
 }
 
 
 }
 
 
-static int
-roffispunct(const char *p)
+int
+roff_endparse(struct roff *r)
 {
 
 {
 
-       if (0 == *p)
-               return(0);
-       if (0 != *(p + 1))
-               return(0);
-
-       switch (*p) {
-       case('{'):
-               /* FALLTHROUGH */
-       case('.'):
-               /* FALLTHROUGH */
-       case(','):
-               /* FALLTHROUGH */
-       case(';'):
-               /* FALLTHROUGH */
-       case(':'):
-               /* FALLTHROUGH */
-       case('?'):
-               /* FALLTHROUGH */
-       case('!'):
-               /* FALLTHROUGH */
-       case('('):
-               /* FALLTHROUGH */
-       case(')'):
-               /* FALLTHROUGH */
-       case('['):
-               /* FALLTHROUGH */
-       case(']'):
-               /* FALLTHROUGH */
-       case('}'):
+       if (NULL == r->last)
                return(1);
                return(1);
-       default:
-               break;
-       }
-
-       return(0);
-}
-
-
-static int
-rofffindcallable(const char *name)
-{
-       int              c;
-
-       if (ROFF_MAX == (c = rofffindtok(name)))
-               return(ROFF_MAX);
-       assert(c >= 0 && c < ROFF_MAX);
-       return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX);
+       return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, 
+                               r->last->col, NULL));
 }
 
 
 }
 
 
-static struct roffnode *
-roffnode_new(int tokid, struct rofftree *tree)
-{
-       struct roffnode *p;
-       
-       if (NULL == (p = malloc(sizeof(struct roffnode))))
-               err(1, "malloc");
-
-       p->tok = tokid;
-       p->parent = tree->last;
-       tree->last = p;
-
-       return(p);
-}
-
-
-static int
-roffargok(int tokid, int argid)
-{
-       const int       *c;
-
-       if (NULL == (c = tokens[tokid].args))
-               return(0);
-
-       for ( ; ROFF_ARGMAX != *c; c++) 
-               if (argid == *c)
-                       return(1);
-
-       return(0);
-}
-
-
-static void
-roffnode_free(struct rofftree *tree)
+/*
+ * Parse a roff node's type from the input buffer.  This must be in the
+ * form of ".foo xxx" in the usual way.
+ */
+static enum rofft
+roff_parse(const char *buf, int *pos)
 {
 {
-       struct roffnode *p;
-
-       assert(tree->last);
+       int              j;
+       char             mac[5];
+       enum rofft       t;
 
 
-       p = tree->last;
-       tree->last = tree->last->parent;
-       free(p);
-}
+       assert(ROFF_CTL(buf[*pos]));
+       (*pos)++;
 
 
+       while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos]))
+               (*pos)++;
 
 
-static int
-roffspecial(struct rofftree *tree, int tok, const char *start, 
-               const int *argc, const char **argv, 
-               size_t sz, char **ordp)
-{
+       if ('\0' == buf[*pos])
+               return(ROFF_MAX);
 
 
-       switch (tok) {
-       case (ROFF_At):
-               if (0 == sz)
-                       break;
-               if (0 == strcmp(*ordp, "v6"))
-                       break;
-               else if (0 == strcmp(*ordp, "v7")) 
+       for (j = 0; j < 4; j++, (*pos)++)
+               if ('\0' == (mac[j] = buf[*pos]))
                        break;
                        break;
-               else if (0 == strcmp(*ordp, "32v"))
+               else if (' ' == buf[*pos])
                        break;
                        break;
-               else if (0 == strcmp(*ordp, "V.1"))
-                       break;
-               else if (0 == strcmp(*ordp, "V.4"))
-                       break;
-               roff_err(tree, start, "invalid `At' arg");
-               return(0);
-       
-       case (ROFF_Fn):
-               if (0 != sz) 
-                       break;
-               roff_err(tree, start, "`%s' expects at least "
-                               "one arg", toknames[tok]);
-               return(0);
-
-       case (ROFF_Nm):
-               if (0 == sz) {
-                       if (0 == tree->name[0]) {
-                               roff_err(tree, start, "`Nm' not set");
-                               return(0);
-                       }
-                       ordp[0] = tree->name;
-                       ordp[1] = NULL;
-               } else if ( ! roffsetname(tree, ordp))
-                       return(0);
-               break;
-
-       case (ROFF_Rv):
-               /* FALLTHROUGH*/
-       case (ROFF_Sx):
-               /* FALLTHROUGH*/
-       case (ROFF_Ex):
-               if (1 == sz) 
-                       break;
-               roff_err(tree, start, "`%s' expects one arg", 
-                               toknames[tok]);
-               return(0);
 
 
-       case (ROFF_Sm):
-               if (1 != sz) {
-                       roff_err(tree, start, "`Sm' expects one arg");
-                       return(0);
-               } 
-               
-               if (0 != strcmp(ordp[0], "on") &&
-                               0 != strcmp(ordp[0], "off")) {
-                       roff_err(tree, start, "`Sm' has invalid argument");
-                       return(0);
-               }
-               break;
-       
-       case (ROFF_Ud):
-               /* FALLTHROUGH */
-       case (ROFF_Ux):
-               /* FALLTHROUGH */
-       case (ROFF_Bt):
-               if (0 != sz) {
-                       roff_err(tree, start, "`%s' expects no args",
-                                       toknames[tok]);
-                       return(0);
-               }
-               break;
-       default:
-               break;
-       }
+       if (j == 4 || j < 1)
+               return(ROFF_MAX);
 
 
-       return((*tree->cb.roffspecial)(tree->arg, tok, 
-                               tree->cur, argc, argv, ordp));
-}
+       mac[j] = '\0';
 
 
+       if (ROFF_MAX == (t = roff_hash_find(mac)))
+               return(t);
 
 
-static int
-roffcall(struct rofftree *tree, int tok, char **argv)
-{
+       while (buf[*pos] && ' ' == buf[*pos])
+               (*pos)++;
 
 
-       if (NULL == tokens[tok].cb) {
-               roff_err(tree, *argv, "unsupported macro `%s'", 
-                               toknames[tok]);
-               return(0);
-       }
-       if ( ! (*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER))
-               return(0);
-       return(1);
+       return(t);
 }
 
 
 }
 
 
-static int
-roffnextopt(const struct rofftree *tree, int tok, 
-               char ***in, char **val)
+/* ARGSUSED */
+static enum rofferr
+roff_cblock(ROFF_ARGS)
 {
 {
-       char            *arg, **argv;
-       int              v;
-
-       *val = NULL;
-       argv = *in;
-       assert(argv);
-
-       if (NULL == (arg = *argv))
-               return(-1);
-       if ('-' != *arg)
-               return(-1);
-
-       if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) {
-               roff_warn(tree, arg, "argument-like parameter `%s' to "
-                               "`%s'", arg, toknames[tok]);
-               return(-1);
-       } 
-       
-       if ( ! roffargok(tok, v)) {
-               roff_warn(tree, arg, "invalid argument parameter `%s' to "
-                               "`%s'", tokargnames[v], toknames[tok]);
-               return(-1);
-       } 
-       
-       if ( ! (ROFF_VALUE & tokenargs[v]))
-               return(v);
-
-       *in = ++argv;
-
-       if (NULL == *argv) {
-               roff_err(tree, arg, "empty value of `%s' for `%s'",
-                               tokargnames[v], toknames[tok]);
-               return(ROFF_ARGMAX);
+
+       if (NULL == r->last) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       return(v);
-}
+       if (ROFF_ig != r->last->tok) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
+       }
 
 
+       if ((*bufp)[pos])
+               if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL))
+                       return(ROFF_ERR);
 
 
-static int
-roffpurgepunct(struct rofftree *tree, char **argv)
-{
-       int              i;
+       ROFF_MDEBUG(r, "closing ignore block");
+       roffnode_pop(r);
+       roffnode_cleanscope(r);
+       return(ROFF_IGN);
 
 
-       i = 0;
-       while (argv[i])
-               i++;
-       assert(i > 0);
-       if ( ! roffispunct(argv[--i]))
-               return(1);
-       while (i >= 0 && roffispunct(argv[i]))
-               i--;
-       i++;
-
-       /* LINTED */
-       while (argv[i])
-               if ( ! roffdata(tree, 0, argv[i++]))
-                       return(0);
-       return(1);
 }
 
 
 }
 
 
-static int
-roffparseopts(struct rofftree *tree, int tok, 
-               char ***args, int *argc, char **argv)
+static void
+roffnode_cleanscope(struct roff *r)
 {
 {
-       int              i, c;
-       char            *v;
 
 
-       i = 0;
-
-       while (-1 != (c = roffnextopt(tree, tok, args, &v))) {
-               if (ROFF_ARGMAX == c) 
-                       return(0);
-
-               argc[i] = c;
-               argv[i] = v;
-               i++;
-               *args = *args + 1;
+       while (r->last) {
+               if (--r->last->endspan < 0)
+                       break;
+               ROFF_MDEBUG(r, "closing implicit scope");
+               roffnode_pop(r);
        }
        }
-
-       argc[i] = ROFF_ARGMAX;
-       argv[i] = NULL;
-       return(1);
-}
-
-
-static int
-roffdata(struct rofftree *tree, int space, char *buf)
-{
-
-       if (0 == *buf)
-               return(1);
-       return((*tree->cb.roffdata)(tree->arg, 
-                               space != 0, tree->cur, buf));
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Dd(ROFFCALL_ARGS)
+static enum rofferr
+roff_ccond(ROFF_ARGS)
 {
 {
-       time_t           t;
-       char            *p, buf[32];
-
-       if (ROFF_BODY & tree->state) {
-               assert( ! (ROFF_PRELUDE & tree->state));
-               assert(ROFF_PRELUDE_Dd & tree->state);
-               return(roff_text(tok, tree, argv, type));
-       }
-
-       assert(ROFF_PRELUDE & tree->state);
-       assert( ! (ROFF_BODY & tree->state));
 
 
-       if (ROFF_PRELUDE_Dd & tree->state) {
-               roff_err(tree, *argv, "repeated `Dd' in prelude");
-               return(0);
-       } else if (ROFF_PRELUDE_Dt & tree->state) {
-               roff_err(tree, *argv, "out-of-order `Dd' in prelude");
-               return(0);
+       if (NULL == r->last) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       assert(NULL == tree->last);
-
-       argv++;
-
-       if (0 == strcmp(*argv, "$Mdocdate: December 7 2008 $")) {
-               t = time(NULL);
-               if (NULL == localtime_r(&t, &tree->tm))
-                       err(1, "localtime_r");
-               tree->state |= ROFF_PRELUDE_Dd;
-               return(1);
-       } 
-
-       /* Build this from Mdocdate or raw date. */
-       
-       buf[0] = 0;
-       p = *argv;
-
-       if (0 != strcmp(*argv, "$Mdocdate:")) {
-               while (*argv) {
-                       if (strlcat(buf, *argv++, sizeof(buf))
-                                       < sizeof(buf)) 
-                               continue;
-                       roff_err(tree, p, "bad `Dd' date");
-                       return(0);
-               }
-               if (strptime(buf, "%b%d,%Y", &tree->tm)) {
-                       tree->state |= ROFF_PRELUDE_Dd;
-                       return(1);
-               }
-               roff_err(tree, *argv, "bad `Dd' date");
-               return(0);
+       if (ROFF_if != r->last->tok) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       argv++;
-       while (*argv && **argv != '$') {
-               if (strlcat(buf, *argv++, sizeof(buf))
-                               >= sizeof(buf)) {
-                       roff_err(tree, p, "bad `Dd' Mdocdate");
-                       return(0);
-               } 
-               if (strlcat(buf, " ", sizeof(buf))
-                               >= sizeof(buf)) {
-                       roff_err(tree, p, "bad `Dd' Mdocdate");
-                       return(0);
-               }
-       }
-       if (NULL == *argv) {
-               roff_err(tree, p, "bad `Dd' Mdocdate");
-               return(0);
+       if (r->last->endspan > -1) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) {
-               roff_err(tree, *argv, "bad `Dd' Mdocdate");
-               return(0);
-       }
+       if ((*bufp)[pos])
+               if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL))
+                       return(ROFF_ERR);
 
 
-       tree->state |= ROFF_PRELUDE_Dd;
-       return(1);
+       ROFF_MDEBUG(r, "closing explicit scope");
+       roffnode_pop(r);
+       roffnode_cleanscope(r);
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Dt(ROFFCALL_ARGS)
+static enum rofferr
+roff_ig(ROFF_ARGS)
 {
 {
+       int             sv;
+       size_t          sz;
 
 
-       if (ROFF_BODY & tree->state) {
-               assert( ! (ROFF_PRELUDE & tree->state));
-               assert(ROFF_PRELUDE_Dt & tree->state);
-               return(roff_text(tok, tree, argv, type));
-       }
-
-       assert(ROFF_PRELUDE & tree->state);
-       assert( ! (ROFF_BODY & tree->state));
-
-       if ( ! (ROFF_PRELUDE_Dd & tree->state)) {
-               roff_err(tree, *argv, "out-of-order `Dt' in prelude");
-               return(0);
-       } else if (ROFF_PRELUDE_Dt & tree->state) {
-               roff_err(tree, *argv, "repeated `Dt' in prelude");
-               return(0);
-       }
+       if ( ! roffnode_push(r, tok, ln, ppos))
+               return(ROFF_ERR);
 
 
-       argv++;
-       if (NULL == *argv) {
-               roff_err(tree, *argv, "`Dt' needs document title");
-               return(0);
-       } else if (strlcpy(tree->title, *argv, sizeof(tree->title))
-                       >= sizeof(tree->title)) {
-               roff_err(tree, *argv, "`Dt' document title too long");
-               return(0);
+       if ('\0' == (*bufp)[pos]) {
+               ROFF_MDEBUG(r, "opening ignore block");
+               return(ROFF_IGN);
        }
 
        }
 
-       argv++;
-       if (NULL == *argv) {
-               roff_err(tree, *argv, "`Dt' needs section");
-               return(0);
-       } else if (strlcpy(tree->section, *argv, sizeof(tree->section))
-                       >= sizeof(tree->section)) {
-               roff_err(tree, *argv, "`Dt' section too long");
-               return(0);
-       }
+       sv = pos;
+       while ((*bufp)[pos] && ' ' != (*bufp)[pos] && 
+                       '\t' != (*bufp)[pos])
+               pos++;
 
 
-       argv++;
-       if (NULL == *argv) {
-               tree->volume[0] = 0;
-       } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume))
-                       >= sizeof(tree->volume)) {
-               roff_err(tree, *argv, "`Dt' volume too long");
-               return(0);
-       }
+       /*
+        * Note: groff does NOT like escape characters in the input.
+        * Instead of detecting this, we're just going to let it fly and
+        * to hell with it.
+        */
 
 
-       assert(NULL == tree->last);
-       tree->state |= ROFF_PRELUDE_Dt;
+       assert(pos > sv);
+       sz = (size_t)(pos - sv);
 
 
-       return(1);
-}
+       r->last->end = malloc(sz + 1);
 
 
+       if (NULL == r->last->end) {
+               (*r->msg)(MANDOCERR_MEM, r->data, ln, pos, NULL);
+               return(ROFF_ERR);
+       }
 
 
-static int
-roffsetname(struct rofftree *tree, char **ordp)
-{
-       
-       assert(*ordp);
+       memcpy(r->last->end, *bufp + sv, sz);
+       r->last->end[(int)sz] = '\0';
 
 
-       /* FIXME: not all sections can set this. */
+       ROFF_MDEBUG(r, "opening explicit ignore block");
 
 
-       if (NULL != *(ordp + 1)) {
-               roff_err(tree, *ordp, "too many `Nm' args");
-               return(0);
-       } 
-       
-       if (strlcpy(tree->name, *ordp, sizeof(tree->name)) 
-                       >= sizeof(tree->name)) {
-               roff_err(tree, *ordp, "`Nm' arg too long");
-               return(0);
-       }
+       if ((*bufp)[pos])
+               if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL))
+                       return(ROFF_ERR);
 
 
-       return(1);
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Ns(ROFFCALL_ARGS)
+static enum rofferr
+roff_ig_text(ROFF_ARGS)
 {
 {
-       int              j, c, first;
-       char            *morep[1];
-
-       first = (*argv++ == tree->cur);
-       morep[0] = NULL;
-
-       if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep))
-               return(0);
-
-       while (*argv) {
-               if (ROFF_MAX != (c = rofffindcallable(*argv))) {
-                       if ( ! roffcall(tree, c, argv))
-                               return(0);
-                       break;
-               }
-
-               if ( ! roffispunct(*argv)) {
-                       if ( ! roffdata(tree, 1, *argv++))
-                               return(0);
-                       continue;
-               }
-
-               for (j = 0; argv[j]; j++)
-                       if ( ! roffispunct(argv[j]))
-                               break;
-
-               if (argv[j]) {
-                       if ( ! roffdata(tree, 0, *argv++))
-                               return(0);
-                       continue;
-               }
 
 
-               break;
-       }
-
-       if ( ! first)
-               return(1);
-
-       return(roffpurgepunct(tree, argv));
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Os(ROFFCALL_ARGS)
+static enum rofferr
+roff_if_text(ROFF_ARGS)
 {
 {
-       char            *p;
+       char            *ep, *st;
 
 
-       if (ROFF_BODY & tree->state) {
-               assert( ! (ROFF_PRELUDE & tree->state));
-               assert(ROFF_PRELUDE_Os & tree->state);
-               return(roff_text(tok, tree, argv, type));
+       st = &(*bufp)[pos];
+       if (NULL == (ep = strstr(st, "\\}"))) {
+               roffnode_cleanscope(r);
+               return(ROFF_IGN);
        }
 
        }
 
-       assert(ROFF_PRELUDE & tree->state);
-       if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
-                       ! (ROFF_PRELUDE_Dd & tree->state)) {
-               roff_err(tree, *argv, "out-of-order `Os' in prelude");
-               return(0);
+       if (ep > st && '\\' != *(ep - 1)) {
+               ROFF_MDEBUG(r, "closing explicit scope (in-line)");
+               roffnode_pop(r);
        }
 
        }
 
-       tree->os[0] = 0;
-
-       p = *++argv;
-
-       while (*argv) {
-               if (strlcat(tree->os, *argv++, sizeof(tree->os))
-                               < sizeof(tree->os)) 
-                       continue;
-               roff_err(tree, p, "`Os' value too long");
-               return(0);
-       }
-
-       if (0 == tree->os[0])
-               if (strlcpy(tree->os, "LOCAL", sizeof(tree->os))
-                               >= sizeof(tree->os)) {
-                       roff_err(tree, p, "`Os' value too long");
-                       return(0);
-               }
-
-       tree->state |= ROFF_PRELUDE_Os;
-       tree->state &= ~ROFF_PRELUDE;
-       tree->state |= ROFF_BODY;
-
-       assert(NULL == tree->last);
-
-       return((*tree->cb.roffhead)(tree->arg, &tree->tm,
-                               tree->os, tree->title, tree->section,
-                               tree->volume));
+       roffnode_cleanscope(r);
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_layout(ROFFCALL_ARGS) 
+static enum rofferr
+roff_if(ROFF_ARGS)
 {
 {
-       int              i, c, argcp[ROFF_MAXLINEARG];
-       char            *argvp[ROFF_MAXLINEARG];
-
-       if (ROFF_PRELUDE & tree->state) {
-               roff_err(tree, *argv, "bad `%s' in prelude", 
-                               toknames[tok]);
-               return(0);
-       } else if (ROFF_EXIT == type) {
-               roffnode_free(tree);
-               if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok))
-                       return(0);
-               return((*tree->cb.roffblkout)(tree->arg, tok));
-       } 
-
-       assert( ! (ROFF_CALLABLE & tokens[tok].flags));
-
-       ++argv;
-
-       if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
-               return(0);
-       if (NULL == roffnode_new(tok, tree))
-               return(0);
+       int              sv;
 
        /*
 
        /*
-        * Layouts have two parts: the layout body and header.  The
-        * layout header is the trailing text of the line macro, while
-        * the layout body is everything following until termination.
+        * Read ahead past the conditional.
+        * FIXME: this does not work, as conditionals don't end on
+        * whitespace, but are parsed according to a formal grammar.
+        * It's good enough for now, however.
         */
 
         */
 
-       if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp))
-               return(0);
-       if (NULL == *argv)
-               return((*tree->cb.roffblkbodyin)
-                               (tree->arg, tok, argcp, argvp));
+       while ((*bufp)[pos] && ' ' != (*bufp)[pos])
+               pos++;
 
 
-       if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, argvp))
-               return(0);
+       sv = pos;
+       while (' ' == (*bufp)[pos])
+               pos++;
 
        /*
 
        /*
-        * If there are no parsable parts, then write remaining tokens
-        * into the layout header and exit.
+        * Roff is weird.  If we have just white-space after the
+        * conditional, it's considered the BODY and we exit without
+        * really doing anything.  Warn about this.  It's probably
+        * wrong.
         */
 
         */
 
-       if ( ! (ROFF_PARSED & tokens[tok].flags)) {
-               i = 0;
-               while (*argv)
-                       if ( ! roffdata(tree, i++, *argv++))
-                               return(0);
-
-               if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
-                       return(0);
-               return((*tree->cb.roffblkbodyin)
-                               (tree->arg, tok, argcp, argvp));
+       if ('\0' == (*bufp)[pos] && sv != pos) {
+               if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       /*
-        * Parsable elements may be in the header (or be the header, for
-        * that matter).  Follow the regular parsing rules for these.
-        */
+       if ( ! roffnode_push(r, tok, ln, ppos))
+               return(ROFF_ERR);
 
 
-       i = 0;
-       while (*argv) {
-               if (ROFF_MAX == (c = rofffindcallable(*argv))) {
-                       assert(tree->arg);
-                       if ( ! roffdata(tree, i++, *argv++))
-                               return(0);
-                       continue;
-               }
-               if ( ! roffcall(tree, c, argv))
-                       return(0);
-               break;
-       }
+       /* Don't evaluate: just assume NO. */
 
 
-       /* 
-        * If there's trailing punctuation in the header, then write it
-        * out now.  Here we mimic the behaviour of a line-dominant text
-        * macro.
-        */
+       r->last->endspan = 1;
 
 
-       if (NULL == *argv) {
-               if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
-                       return(0);
-               return((*tree->cb.roffblkbodyin)
-                               (tree->arg, tok, argcp, argvp));
-       }
+       if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) {
+               ROFF_MDEBUG(r, "opening explicit scope");
+               r->last->endspan = -1;
+               pos += 2;
+       } else
+               ROFF_MDEBUG(r, "opening implicit scope");
 
        /*
 
        /*
-        * Expensive.  Scan to the end of line then work backwards until
-        * a token isn't punctuation.
+        * If there are no arguments on the line, the next-line scope is
+        * assumed.
         */
 
         */
 
-       if ( ! roffpurgepunct(tree, argv))
-               return(0);
-
-       if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
-               return(0);
-       return((*tree->cb.roffblkbodyin)
-                       (tree->arg, tok, argcp, argvp));
-}
-
-
-/* ARGSUSED */
-static int
-roff_ordered(ROFFCALL_ARGS) 
-{
-       int              i, first, c, argcp[ROFF_MAXLINEARG];
-       char            *ordp[ROFF_MAXLINEARG], *p,
-                       *argvp[ROFF_MAXLINEARG];
-
-       if (ROFF_PRELUDE & tree->state) {
-               roff_err(tree, *argv, "`%s' disallowed in prelude", 
-                               toknames[tok]);
-               return(0);
-       }
-
-       first = (*argv == tree->cur);
-       p = *argv++;
-
-       if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
-               return(0);
-
-       if (NULL == *argv) {
-               ordp[0] = NULL;
-               return(roffspecial(tree, tok, p, argcp, 
-                                       (const char **)argvp, 0, ordp));
-       }
-
-       i = 0;
-       while (*argv && i < ROFF_MAXLINEARG) {
-               c = ROFF_PARSED & tokens[tok].flags ?
-                       rofffindcallable(*argv) : ROFF_MAX;
-
-               if (ROFF_MAX == c && ! roffispunct(*argv)) {
-                       ordp[i++] = *argv++;
-                       continue;
-               }
-               ordp[i] = NULL;
-
-               if (ROFF_MAX == c)
-                       break;
+       if ('\0' == (*bufp)[pos])
+               return(ROFF_IGN);
 
 
-               if ( ! roffspecial(tree, tok, p, argcp, 
-                                       (const char **)argvp,
-                                       (size_t)i, ordp))
-                       return(0);
+       /* Otherwise re-run the roff parser after recalculating. */
 
 
-               return(roffcall(tree, c, argv));
-       }
-
-       assert(i != ROFF_MAXLINEARG);
-       ordp[i] = NULL;
-
-       if ( ! roffspecial(tree, tok, p, argcp, 
-                               (const char**)argvp,
-                               (size_t)i, ordp))
-               return(0);
-
-       /* FIXME: error if there's stuff after the punctuation. */
-
-       if ( ! first || NULL == *argv)
-               return(1);
-
-       return(roffpurgepunct(tree, argv));
+       *offs = pos;
+       return(ROFF_RERUN);
 }
 }
-
-
-/* ARGSUSED */
-static int
-roff_text(ROFFCALL_ARGS) 
-{
-       int              i, j, first, c, argcp[ROFF_MAXLINEARG];
-       char            *argvp[ROFF_MAXLINEARG];
-
-       if (ROFF_PRELUDE & tree->state) {
-               roff_err(tree, *argv, "`%s' disallowed in prelude", 
-                               toknames[tok]);
-               return(0);
-       }
-
-       first = (*argv == tree->cur);
-       argv++;
-
-       if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
-               return(0);
-       if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
-               return(0);
-       if (NULL == *argv)
-               return((*tree->cb.roffout)(tree->arg, tok));
-
-       if ( ! (ROFF_PARSED & tokens[tok].flags)) {
-               i = 0;
-               while (*argv)
-                       if ( ! roffdata(tree, i++, *argv++))
-                               return(0);
-
-               return((*tree->cb.roffout)(tree->arg, tok));
-       }
-
-       /*
-        * Deal with punctuation.  Ugly.  Work ahead until we encounter
-        * terminating punctuation.  If we encounter it and all
-        * subsequent tokens are punctuation, then stop processing (the
-        * line-dominant macro will print these tokens after closure).
-        * If the punctuation is followed by non-punctuation, then close
-        * and re-open our scope, then continue.
-        */
-
-       i = 0;
-       while (*argv) {
-               if (ROFF_MAX != (c = rofffindcallable(*argv))) {
-                       if ( ! (ROFF_LSCOPE & tokens[tok].flags))
-                               if ( ! (*tree->cb.roffout)(tree->arg, tok))
-                                       return(0);
-       
-                       if ( ! roffcall(tree, c, argv))
-                               return(0);
-       
-                       if (ROFF_LSCOPE & tokens[tok].flags)
-                               if ( ! (*tree->cb.roffout)(tree->arg, tok))
-                                       return(0);
-       
-                       break;
-               }
-
-               if ( ! roffispunct(*argv)) {
-                       if ( ! roffdata(tree, i++, *argv++))
-                               return(0);
-                       continue;
-               }
-
-               i = 1;
-               for (j = 0; argv[j]; j++)
-                       if ( ! roffispunct(argv[j]))
-                               break;
-
-               if (argv[j]) {
-                       if (ROFF_LSCOPE & tokens[tok].flags) {
-                               if ( ! roffdata(tree, 0, *argv++))
-                                       return(0);
-                               continue;
-                       }
-                       if ( ! (*tree->cb.roffout)(tree->arg, tok))
-                               return(0);
-                       if ( ! roffdata(tree, 0, *argv++))
-                               return(0);
-                       if ( ! (*tree->cb.roffin)(tree->arg, tok,
-                                               argcp, argvp))
-                               return(0);
-
-                       i = 0;
-                       continue;
-               }
-
-               if ( ! (*tree->cb.roffout)(tree->arg, tok))
-                       return(0);
-               break;
-       }
-
-       if (NULL == *argv)
-               return((*tree->cb.roffout)(tree->arg, tok));
-       if ( ! first)
-               return(1);
-
-       return(roffpurgepunct(tree, argv));
-}
-
-
-/* ARGSUSED */
-static int
-roff_noop(ROFFCALL_ARGS)
-{
-
-       return(1);
-}
-
-
-/* ARGSUSED */
-static int
-roff_depr(ROFFCALL_ARGS)
-{
-
-       roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]);
-       return(0);
-}
-
-
-static void
-roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...)
-{
-       va_list          ap;
-       char             buf[128];
-
-       va_start(ap, fmt);
-       (void)vsnprintf(buf, sizeof(buf), fmt, ap);
-       va_end(ap);
-
-       (*tree->cb.roffmsg)(tree->arg, 
-                       ROFF_WARN, tree->cur, pos, buf);
-}
-
-
-static void
-roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...)
-{
-       va_list          ap;
-       char             buf[128];
-
-       va_start(ap, fmt);
-       (void)vsnprintf(buf, sizeof(buf), fmt, ap);
-       va_end(ap);
-
-       (*tree->cb.roffmsg)(tree->arg, 
-                       ROFF_ERROR, tree->cur, pos, buf);
-}
-
A git conversion mirror of mandoc.bsd.lv