]> 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
Correctly print `Lk' arguments in -Tascii. Issue raised by Aldis Berzoja.
[mandoc.git] / roff.c
diff --git a/roff.c b/roff.c
index 3e2b765675e29cfb4a47fd2fd4e6ba98b475a297..c21cc025f29d09bdae5ced5774e0348060b2288e 100644 (file)
--- a/roff.c
+++ b/roff.c
@@ -1,701 +1,1104 @@
-/* $Id: roff.c,v 1.1 2008/11/24 14:24:55 kristaps Exp $ */
+/*     $Id: roff.c,v 1.97 2010/07/27 19:56:50 kristaps Exp $ */
 /*
 /*
- * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
+ * Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv>
+ * Copyright (c) 2010 Ingo Schwarze <schwarze@openbsd.org>
  *
  * 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.
  */
  */
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
 #include <assert.h>
 #include <assert.h>
+#include <errno.h>
 #include <ctype.h>
 #include <ctype.h>
-#include <err.h>
+#include <limits.h>
 #include <stdlib.h>
 #include <stdlib.h>
-#include <stdio.h>
 #include <string.h>
 #include <string.h>
-#include <time.h>
-
-#include "libmdocml.h"
-#include "private.h"
-
-#define        ROFF_MAXARG       10
+#include <stdio.h>
 
 
-enum   roffd { 
-       ROFF_ENTER = 0, 
-       ROFF_EXIT 
+#include "mandoc.h"
+#include "roff.h"
+#include "libmandoc.h"
+
+#define        RSTACK_MAX      128
+
+#define        ROFF_CTL(c) \
+       ('.' == (c) || '\'' == (c))
+
+#if 1
+#define        ROFF_DEBUG(fmt, args...) \
+       do { /* Nothing. */ } while (/*CONSTCOND*/ 0)
+#else
+#define        ROFF_DEBUG(fmt, args...) \
+       do { fprintf(stderr, fmt , ##args); } while (/*CONSTCOND*/ 0)
+#endif
+
+enum   rofft {
+       ROFF_am,
+       ROFF_ami,
+       ROFF_am1,
+       ROFF_de,
+       ROFF_dei,
+       ROFF_de1,
+       ROFF_ds,
+       ROFF_el,
+       ROFF_ie,
+       ROFF_if,
+       ROFF_ig,
+       ROFF_rm,
+       ROFF_tr,
+       ROFF_cblock,
+       ROFF_ccond,
+       ROFF_nr,
+       ROFF_MAX
 };
 
 };
 
-enum   rofftype { 
-       ROFF_TITLE, 
-       ROFF_COMMENT, 
-       ROFF_TEXT, 
-       ROFF_LAYOUT 
+enum   roffrule {
+       ROFFRULE_ALLOW,
+       ROFFRULE_DENY
 };
 
 };
 
-#define        ROFFCALL_ARGS \
-       struct rofftree *tree, const char *argv[], enum roffd type
 
 
-struct rofftree;
-
-struct rofftok {
-       char             *name;
-       int             (*cb)(ROFFCALL_ARGS);
-       enum rofftype     type;
-       int               flags;
-#define        ROFF_NESTED      (1 << 0) 
-#define        ROFF_PARSED      (1 << 1)
-#define        ROFF_CALLABLE    (1 << 2)
-#define        ROFF_QUOTES      (1 << 3)
+struct roffstr {
+       char            *name; /* key of symbol */
+       char            *string; /* current value */
+       struct roffstr  *next; /* next in list */
 };
 
 };
 
-struct roffarg {
-       char             *name;
-       int               flags;
-#define        ROFF_VALUE       (1 << 0)
+struct roff {
+       struct roffnode *last; /* leaf of stack */
+       mandocmsg        msg; /* err/warn/fatal messages */
+       void            *data; /* privdata for messages */
+       enum roffrule    rstack[RSTACK_MAX]; /* stack of !`ie' rules */
+       int              rstackpos; /* position in rstack */
+       struct regset   *regs; /* read/writable registers */
+       struct roffstr  *first_string;
 };
 
 struct roffnode {
 };
 
 struct roffnode {
-       int               tok;  
-       struct roffnode  *parent;
-       size_t            line;
+       enum rofft       tok; /* type of node */
+       struct roffnode *parent; /* up one in stack */
+       int              line; /* parse line */
+       int              col; /* parse col */
+       char            *end; /* end-rules: custom token */
+       int              endspan; /* end-rules: next-line or infty */
+       enum roffrule    rule; /* current evaluation rule */
 };
 
 };
 
-struct rofftree {
-       struct roffnode  *last;
-       time_t            date;
-       char              title[256];
-       char              section[256];
-       char              volume[256];
-       int               state;
-#define        ROFF_PRELUDE     (1 << 1)
-#define        ROFF_PRELUDE_Os  (1 << 2)
-#define        ROFF_PRELUDE_Dt  (1 << 3)
-#define        ROFF_PRELUDE_Dd  (1 << 4)
-#define        ROFF_BODY        (1 << 5)
-       struct md_mbuf  *mbuf; /* NULL if ROFF_EXIT and error. */
-
-       const struct md_args    *args;
-       const struct md_rbuf    *rbuf;
+#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; /* process new macro */
+       roffproc         text; /* process as child text of macro */
+       roffproc         sub; /* process as child of macro */
+       int              flags;
+#define        ROFFMAC_STRUCT  (1 << 0) /* always interpret */
+       struct roffmac  *next;
 };
 
 };
 
-#define        ROFF___           0
-#define        ROFF_Dd           1
-#define        ROFF_Dt           2
-#define        ROFF_Os           3
-#define        ROFF_Sh           4
-#define        ROFF_An           5
-#define        ROFF_Li           6
-#define        ROFF_MAX          7
-
-static int               roff_Dd(ROFFCALL_ARGS);
-static int               roff_Dt(ROFFCALL_ARGS);
-static int               roff_Os(ROFFCALL_ARGS);
-static int               roff_Sh(ROFFCALL_ARGS);
-static int               roff_An(ROFFCALL_ARGS);
-static int               roff_Li(ROFFCALL_ARGS);
-
-static struct roffnode  *roffnode_new(int, size_t, 
-                               struct rofftree *);
-static void              roffnode_free(int, struct rofftree *);
-
-static int               rofffindtok(const char *);
-static int               rofffindarg(const char *);
-static int               roffargs(int, char *, char **);
-static int               roffparse(struct rofftree *, char *, size_t);
-static int               textparse(const struct rofftree *,
+static enum rofferr     roff_block(ROFF_ARGS);
+static enum rofferr     roff_block_text(ROFF_ARGS);
+static enum rofferr     roff_block_sub(ROFF_ARGS);
+static enum rofferr     roff_cblock(ROFF_ARGS);
+static enum rofferr     roff_ccond(ROFF_ARGS);
+static enum rofferr     roff_cond(ROFF_ARGS);
+static enum rofferr     roff_cond_text(ROFF_ARGS);
+static enum rofferr     roff_cond_sub(ROFF_ARGS);
+static enum rofferr     roff_ds(ROFF_ARGS);
+static enum roffrule    roff_evalcond(const char *, int *);
+static void             roff_freestr(struct roff *);
+static const char      *roff_getstrn(const struct roff *, 
                                const char *, size_t);
                                const char *, size_t);
-
-static void              dbg_enter(const struct md_args *, int);
-static void              dbg_leave(const struct md_args *, int);
-
-
-static const struct rofftok tokens[ROFF_MAX] = {
-       { "\\\"",    NULL, ROFF_COMMENT, 0 },
-       {   "Dd", roff_Dd, ROFF_TITLE, 0 },
-       {   "Dt", roff_Dt, ROFF_TITLE, 0 },
-       {   "Os", roff_Os, ROFF_TITLE, 0 },
-       {   "Sh", roff_Sh, ROFF_LAYOUT, 0 },
-       {   "An", roff_An, ROFF_TEXT, ROFF_PARSED },
-       {   "Li", roff_Li, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE },
+static enum rofferr     roff_line(ROFF_ARGS);
+static enum rofferr     roff_nr(ROFF_ARGS);
+static int              roff_res(struct roff *, 
+                               char **, size_t *, int);
+static void             roff_setstr(struct roff *,
+                               const char *, const char *);
+
+/* See roff_hash_find() */
+
+#define        ASCII_HI         126
+#define        ASCII_LO         33
+#define        HASHWIDTH       (ASCII_HI - ASCII_LO + 1)
+
+static struct roffmac  *hash[HASHWIDTH];
+
+static struct roffmac   roffs[ROFF_MAX] = {
+       { "am", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "de", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "ds", roff_ds, NULL, NULL, 0, NULL },
+       { "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
+       { "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
+       { "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
+       { "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL },
+       { "rm", roff_line, NULL, NULL, 0, NULL },
+       { "tr", roff_line, NULL, NULL, 0, NULL },
+       { ".", roff_cblock, NULL, NULL, 0, NULL },
+       { "\\}", roff_ccond, NULL, NULL, 0, NULL },
+       { "nr", roff_nr, NULL, NULL, 0, NULL },
 };
 
 };
 
-#define        ROFF_Split        0
-#define        ROFF_Nosplit      1
-#define        ROFF_ARGMAX       2
+static void             roff_free1(struct roff *);
+static enum rofft       roff_hash_find(const char *);
+static void             roff_hash_init(void);
+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 *);
+static int              roff_parse_nat(const char *, unsigned int *);
 
 
-static const struct roffarg tokenargs[ROFF_ARGMAX] = {
-       {  "split",     0 },
-       {  "nosplit",   0 },
-};
+/* See roff_hash_find() */
+#define        ROFF_HASH(p)    (p[0] - ASCII_LO)
 
 
-
-int
-roff_free(struct rofftree *tree, int flush)
+static void
+roff_hash_init(void)
 {
 {
-       int              error;
+       struct roffmac   *n;
+       int               buc, i;
 
 
-       assert(tree->mbuf);
-       if ( ! flush)
-               tree->mbuf = NULL;
+       for (i = 0; i < (int)ROFF_MAX; i++) {
+               assert(roffs[i].name[0] >= ASCII_LO);
+               assert(roffs[i].name[0] <= ASCII_HI);
 
 
-       /* LINTED */
-       while (tree->last)
-               if ( ! (*tokens[tree->last->tok].cb)
-                               (tree, NULL, ROFF_EXIT))
-                       /* Disallow flushing. */
-                       tree->mbuf = NULL;
-
-       error = tree->mbuf ? 0 : 1;
-
-       if (tree->mbuf && (ROFF_PRELUDE & tree->state)) {
-               warnx("%s: prelude never finished", 
-                               tree->rbuf->name);
-               error = 1;
-       }
+               buc = ROFF_HASH(roffs[i].name);
 
 
-       free(tree);
-       return(error ? 0 : 1);
+               if (NULL != (n = hash[buc])) {
+                       for ( ; n->next; n = n->next)
+                               /* Do nothing. */ ;
+                       n->next = &roffs[i];
+               } else
+                       hash[buc] = &roffs[i];
+       }
 }
 
 
 }
 
 
-struct rofftree *
-roff_alloc(const struct md_args *args, struct md_mbuf *out, 
-               const struct md_rbuf *in)
+/*
+ * 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;
+       int              buc;
+       struct roffmac  *n;
 
 
-       if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) {
-               warn("malloc");
-               return(NULL);
-       }
+       /*
+        * libroff has an extremely simple hashtable, for the time
+        * being, which simply keys on the first character, which must
+        * be printable, then walks a chain.  It works well enough until
+        * optimised.
+        */
+
+       if (p[0] < ASCII_LO || p[0] > ASCII_HI)
+               return(ROFF_MAX);
 
 
-       tree->state = ROFF_PRELUDE;
-       tree->args = args;
-       tree->mbuf = out;
-       tree->rbuf = in;
+       buc = ROFF_HASH(p);
 
 
-       return(tree);
+       if (NULL == (n = hash[buc]))
+               return(ROFF_MAX);
+       for ( ; n; n = n->next)
+               if (0 == strcmp(n->name, p))
+                       return((enum rofft)(n - roffs));
+
+       return(ROFF_MAX);
 }
 
 
 }
 
 
-int
-roff_engine(struct rofftree *tree, char *buf, size_t sz)
+/*
+ * Pop the current node off of the stack of roff instructions currently
+ * pending.
+ */
+static void
+roffnode_pop(struct roff *r)
 {
 {
+       struct roffnode *p;
 
 
-       if (0 == sz) {
-               warnx("%s: blank line (line %zu)", 
-                               tree->rbuf->name, 
-                               tree->rbuf->line);
-               return(0);
-       } else if ('.' != *buf)
-               return(textparse(tree, buf, sz));
+       assert(r->last);
+       p = r->last; 
+
+       if (ROFF_el == p->tok)
+               if (r->rstackpos > -1)
+                       r->rstackpos--;
 
 
-       return(roffparse(tree, buf, sz));
+       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(const struct rofftree *tree, const char *buf, size_t sz)
+roffnode_push(struct roff *r, enum rofft tok, int line, int col)
 {
 {
-       
-       if (NULL == tree->last) {
-               warnx("%s: unexpected text (line %zu)",
-                               tree->rbuf->name, 
-                               tree->rbuf->line);
-               return(0);
-       } else if (NULL == tree->last->parent) {
-               warnx("%s: disallowed text (line %zu)",
-                               tree->rbuf->name, 
-                               tree->rbuf->line);
+       struct roffnode *p;
+
+       if (NULL == (p = calloc(1, sizeof(struct roffnode)))) {
+               (*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL);
                return(0);
        }
 
                return(0);
        }
 
-       /* Print text. */
+       p->tok = tok;
+       p->parent = r->last;
+       p->line = line;
+       p->col = col;
+       p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY;
 
 
+       r->last = p;
        return(1);
 }
 
 
        return(1);
 }
 
 
-static int
-roffargs(int tok, char *buf, char **argv)
+static void
+roff_free1(struct roff *r)
 {
 {
-       int              i;
 
 
-       (void)tok;/* FIXME: quotable strings? */
+       while (r->last)
+               roffnode_pop(r);
+       roff_freestr(r);
+}
 
 
-       assert(tok >= 0 && tok < ROFF_MAX);
-       assert('.' == *buf);
 
 
-       /* LINTED */
-       for (i = 0; *buf && i < ROFF_MAXARG; i++) {
-               argv[i] = buf++;
-               while (*buf && ! isspace(*buf))
-                       buf++;
-               if (0 == *buf) {
-                       continue;
-               }
-               *buf++ = 0;
-               while (*buf && isspace(*buf))
-                       buf++;
-       }
-       
-       assert(i > 0);
-       if (i < ROFF_MAXARG)
-               argv[i] = NULL;
+void
+roff_reset(struct roff *r)
+{
 
 
-       return(ROFF_MAXARG > i);
+       roff_free1(r);
 }
 
 
 }
 
 
-static int
-roffparse(struct rofftree *tree, char *buf, size_t sz)
+void
+roff_free(struct roff *r)
 {
 {
-       int               tok, t;
-       struct roffnode  *node;
-       char             *argv[ROFF_MAXARG];
-       const char      **argvp;
 
 
-       assert(sz > 0);
+       roff_free1(r);
+       free(r);
+}
 
 
-       /*
-        * Extract the token identifier from the buffer.  If there's no
-        * callback for the token (comment, etc.) then exit immediately.
-        * We don't do any error handling (yet), so if the token doesn't
-        * exist, die.
-        */
 
 
-       if (3 > sz) {
-               warnx("%s: malformed line (line %zu)", 
-                               tree->rbuf->name, 
-                               tree->rbuf->line);
-               return(0);
-       } else if (ROFF_MAX == (tok = rofffindtok(buf + 1))) {
-               warnx("%s: unknown line token `%c%c' (line %zu)",
-                               tree->rbuf->name, 
-                               *(buf + 1), *(buf + 2), 
-                               tree->rbuf->line);
-               return(0);
-       } else if (ROFF_COMMENT == tokens[tok].type) 
-               /* Ignore comment tokens. */
-               return(1);
-       
-       if ( ! roffargs(tok, buf, argv)) {
-               warnx("%s: too many arguments to `%s' (line %zu)",
-                               tree->rbuf->name, tokens[tok].name, 
-                               tree->rbuf->line);
+struct roff *
+roff_alloc(struct regset *regs, const mandocmsg msg, void *data)
+{
+       struct roff     *r;
+
+       if (NULL == (r = calloc(1, sizeof(struct roff)))) {
+               (*msg)(MANDOCERR_MEM, data, 0, 0, NULL);
                return(0);
        }
 
                return(0);
        }
 
-       /* Domain cross-contamination (and sanity) checks. */
+       r->regs = regs;
+       r->msg = msg;
+       r->data = data;
+       r->rstackpos = -1;
+       
+       roff_hash_init();
+       return(r);
+}
+
+
+/*
+ * Pre-filter each and every line for reserved words (one beginning with
+ * `\*', e.g., `\*(ab').  These must be handled before the actual line
+ * is processed. 
+ */
+static int
+roff_res(struct roff *r, char **bufp, size_t *szp, int pos)
+{
+       const char      *cp, *cpp, *st, *res;
+       int              i, maxl;
+       size_t           nsz;
+       char            *n;
 
 
-       switch (tokens[tok].type) {
-       case (ROFF_TITLE):
-               if (ROFF_PRELUDE & tree->state) {
-                       assert( ! (ROFF_BODY & tree->state));
+       /* LINTED */
+       for (cp = &(*bufp)[pos]; (cpp = strstr(cp, "\\*")); cp++) {
+               cp = cpp + 2;
+               switch (*cp) {
+               case ('('):
+                       cp++;
+                       maxl = 2;
                        break;
                        break;
-               }
-               assert(ROFF_BODY & tree->state);
-               warnx("%s: prelude token `%s' in body (line %zu)",
-                               tree->rbuf->name, tokens[tok].name, 
-                               tree->rbuf->line);
-               return(0);
-       case (ROFF_LAYOUT):
-               /* FALLTHROUGH */
-       case (ROFF_TEXT):
-               if (ROFF_BODY & tree->state) {
-                       assert( ! (ROFF_PRELUDE & tree->state));
+               case ('['):
+                       cp++;
+                       maxl = 0;
+                       break;
+               default:
+                       maxl = 1;
                        break;
                }
                        break;
                }
-               assert(ROFF_PRELUDE & tree->state);
-               warnx("%s: body token `%s' in prelude (line %zu)",
-                               tree->rbuf->name, tokens[tok].name, 
-                               tree->rbuf->line);
-               return(0);
-       case (ROFF_COMMENT):
-               return(1);
-       default:
-               abort();
-       }
-
-       /*
-        * If this is a non-nestable layout token and we're below a
-        * token of the same type, then recurse upward to the token,
-        * closing out the interim scopes.
-        *
-        * If there's a nested token on the chain, then raise an error
-        * as nested tokens have corresponding "ending" tokens and we're
-        * breaking their scope.
-        */
 
 
-       node = NULL;
+               st = cp;
 
 
-       if (ROFF_LAYOUT == tokens[tok].type && 
-                       ! (ROFF_NESTED & tokens[tok].flags)) {
-               for (node = tree->last; node; node = node->parent) {
-                       if (node->tok == tok)
+               for (i = 0; 0 == maxl || i < maxl; i++, cp++) {
+                       if ('\0' == *cp)
+                               return(1); /* Error. */
+                       if (0 == maxl && ']' == *cp)
                                break;
                                break;
+               }
+
+               res = roff_getstrn(r, st, (size_t)i);
 
 
-                       /* Don't break nested scope. */
-
-                       if ( ! (ROFF_NESTED & tokens[node->tok].flags))
-                               continue;
-                       warnx("%s: scope of %s (line %zu) broken by "
-                                       "%s (line %zu)", 
-                                       tree->rbuf->name, 
-                                       tokens[tok].name,
-                                       node->line, 
-                                       tokens[node->tok].name,
-                                       tree->rbuf->line);
-                       return(0);
+               if (NULL == res) {
+                       cp -= maxl ? 1 : 0;
+                       continue;
                }
                }
-       }
 
 
-       if (node) {
-               assert(ROFF_LAYOUT == tokens[tok].type);
-               assert( ! (ROFF_NESTED & tokens[tok].flags));
-               assert(node->tok == tok);
+               ROFF_DEBUG("roff: splicing reserved: [%.*s]\n", i, st);
 
 
-               /* Clear up to last scoped token. */
+               nsz = *szp + strlen(res) + 1;
+               n = mandoc_malloc(nsz);
 
 
-               /* LINTED */
-               do {
-                       t = tree->last->tok;
-                       if ( ! (*tokens[tree->last->tok].cb)
-                                       (tree, NULL, ROFF_EXIT))
-                               return(0);
-               } while (t != tok);
-       }
+               *n = '\0';
 
 
-       /* Proceed with actual token processing. */
+               strlcat(n, *bufp, (size_t)(cpp - *bufp + 1));
+               strlcat(n, res, nsz);
+               strlcat(n, cp + (maxl ? 0 : 1), nsz);
 
 
-       argvp = (const char **)&argv[1];
-       return((*tokens[tok].cb)(tree, argvp, ROFF_ENTER));
+               free(*bufp);
+
+               *bufp = n;
+               *szp = nsz;
+               return(0);
+       }
+
+       return(1);
 }
 
 
 }
 
 
-static int
-rofffindarg(const char *name)
+enum rofferr
+roff_parseln(struct roff *r, int ln, char **bufp, 
+               size_t *szp, int pos, int *offs)
 {
 {
-       size_t           i;
+       enum rofft       t;
+       int              ppos;
 
 
-       /* FIXME: use a table, this is slow but ok for now. */
+       /*
+        * Run the reserved-word filter only if we have some reserved
+        * words to fill in.
+        */
 
 
-       /* LINTED */
-       for (i = 0; i < ROFF_ARGMAX; i++)
-               /* LINTED */
-               if (0 == strcmp(name, tokenargs[i].name))
-                       return((int)i);
-       
-       return(ROFF_ARGMAX);
-}
+       if (r->first_string && ! roff_res(r, bufp, szp, pos))
+               return(ROFF_RERUN);
 
 
+       /*
+        * First, if a scope is open and we're not a macro, pass the
+        * text through the macro's filter.  If a scope isn't open and
+        * we're not a macro, just let it through.
+        */
 
 
-static int
-rofffindtok(const char *name)
-{
-       size_t           i;
+       if (r->last && ! ROFF_CTL((*bufp)[pos])) {
+               t = r->last->tok;
+               assert(roffs[t].text);
+               ROFF_DEBUG("roff: intercept scoped text: %s, [%s]\n", 
+                               roffs[t].name, &(*bufp)[pos]);
+               return((*roffs[t].text)
+                               (r, t, bufp, szp, 
+                                ln, pos, pos, offs));
+       } else if ( ! ROFF_CTL((*bufp)[pos]))
+               return(ROFF_CONT);
 
 
-       /* FIXME: use a table, this is slow but ok for now. */
+       /*
+        * If a scope is open, go to the child handler for that macro,
+        * as it may want to preprocess before doing anything with it.
+        */
 
 
-       /* LINTED */
-       for (i = 0; i < ROFF_MAX; i++)
-               /* LINTED */
-               if (0 == strncmp(name, tokens[i].name, 2))
-                       return((int)i);
-       
-       return(ROFF_MAX);
+       if (r->last) {
+               t = r->last->tok;
+               assert(roffs[t].sub);
+               ROFF_DEBUG("roff: intercept scoped context: %s\n", 
+                               roffs[t].name);
+               return((*roffs[t].sub)
+                               (r, t, bufp, szp, 
+                                ln, pos, pos, offs));
+       }
+
+       /*
+        * Lastly, as we've no scope open, try to look up and execute
+        * the new macro.  If no macro is found, simply return and let
+        * the compilers handle it.
+        */
+
+       ppos = pos;
+       if (ROFF_MAX == (t = roff_parse(*bufp, &pos)))
+               return(ROFF_CONT);
+
+       ROFF_DEBUG("roff: intercept new-scope: %s, [%s]\n", 
+                       roffs[t].name, &(*bufp)[pos]);
+       assert(roffs[t].proc);
+       return((*roffs[t].proc)
+                       (r, t, bufp, szp, 
+                        ln, ppos, pos, offs));
 }
 
 
 }
 
 
-/* FIXME: accept only struct rofftree *. */
-static struct roffnode *
-roffnode_new(int tokid, size_t line, struct rofftree *tree)
+int
+roff_endparse(struct roff *r)
 {
 {
-       struct roffnode *p;
-       
-       if (NULL == (p = malloc(sizeof(struct roffnode)))) {
-               warn("malloc");
-               return(NULL);
-       }
 
 
-       p->line = line;
-       p->tok = tokid;
-       p->parent = tree->last;
-       tree->last = p;
-       return(p);
+       if (NULL == r->last)
+               return(1);
+       return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, 
+                               r->last->col, NULL));
 }
 
 
 }
 
 
-static void
-roffnode_free(int tokid, 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;
+       int              j;
+       char             mac[5];
+       enum rofft       t;
 
 
-       assert(tree->last);
-       assert(tree->last->tok == tokid);
+       assert(ROFF_CTL(buf[*pos]));
+       (*pos)++;
 
 
-       p = tree->last;
-       tree->last = tree->last->parent;
-       free(p);
+       while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos]))
+               (*pos)++;
+
+       if ('\0' == buf[*pos])
+               return(ROFF_MAX);
+
+       for (j = 0; j < 4; j++, (*pos)++)
+               if ('\0' == (mac[j] = buf[*pos]))
+                       break;
+               else if (' ' == buf[*pos] || (j && '\\' == buf[*pos]))
+                       break;
+
+       if (j == 4 || j < 1)
+               return(ROFF_MAX);
+
+       mac[j] = '\0';
+
+       if (ROFF_MAX == (t = roff_hash_find(mac)))
+               return(t);
+
+       while (buf[*pos] && ' ' == buf[*pos])
+               (*pos)++;
+
+       return(t);
 }
 
 
 }
 
 
-static int dbg_lvl = 0;
+static int
+roff_parse_nat(const char *buf, unsigned int *res)
+{
+       char            *ep;
+       long             lval;
 
 
+       errno = 0;
+       lval = strtol(buf, &ep, 10);
+       if (buf[0] == '\0' || *ep != '\0')
+               return(0);
+       if ((errno == ERANGE && 
+                       (lval == LONG_MAX || lval == LONG_MIN)) ||
+                       (lval > INT_MAX || lval < 0))
+               return(0);
 
 
-static void
-dbg_enter(const struct md_args *args, int tokid)
+       *res = (unsigned int)lval;
+       return(1);
+}
+
+
+/* ARGSUSED */
+static enum rofferr
+roff_cblock(ROFF_ARGS)
 {
 {
-       int              i;
-       static char      buf[72];
 
 
-       assert(args);
-       if ( ! (args->dbg & MD_DBG_TREE))
-               return;
-       assert(tokid >= 0 && tokid <= ROFF_MAX);
+       /*
+        * A block-close `..' should only be invoked as a child of an
+        * ignore macro, otherwise raise a warning and just ignore it.
+        */
 
 
-       buf[0] = buf[71] = 0;
+       if (NULL == r->last) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
+       }
 
 
-       switch (tokens[tokid].type) {
-       case (ROFF_LAYOUT):
-               (void)strncat(buf, "[body-layout] ", sizeof(buf) - 1);
-               break;
-       case (ROFF_TEXT):
-               (void)strncat(buf, "[  body-text] ", sizeof(buf) - 1);
-               break;
-       case (ROFF_TITLE):
-               (void)strncat(buf, "[    prelude] ", sizeof(buf) - 1);
+       switch (r->last->tok) {
+       case (ROFF_am):
+               /* FALLTHROUGH */
+       case (ROFF_ami):
+               /* FALLTHROUGH */
+       case (ROFF_am1):
+               /* FALLTHROUGH */
+       case (ROFF_de):
+               /* FALLTHROUGH */
+       case (ROFF_dei):
+               /* FALLTHROUGH */
+       case (ROFF_de1):
+               /* FALLTHROUGH */
+       case (ROFF_ig):
                break;
        default:
                break;
        default:
-               abort();
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       /* LINTED */
-       for (i = 0; i < dbg_lvl; i++)
-               (void)strncat(buf, "  ", sizeof(buf) - 1);
+       if ((*bufp)[pos])
+               if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL))
+                       return(ROFF_ERR);
 
 
-       (void)strncat(buf, tokens[tokid].name, sizeof(buf) - 1);
+       roffnode_pop(r);
+       roffnode_cleanscope(r);
+       return(ROFF_IGN);
 
 
-       (void)printf("%s\n", buf);
-
-       dbg_lvl++;
 }
 
 
 }
 
 
-/* FIXME: accept only struct rofftree *. */
 static void
 static void
-dbg_leave(const struct md_args *args, int tokid)
+roffnode_cleanscope(struct roff *r)
 {
 {
-       assert(args);
-       if ( ! (args->dbg & MD_DBG_TREE))
-               return;
 
 
-       assert(tokid >= 0 && tokid <= ROFF_MAX);
-       assert(dbg_lvl > 0);
-       dbg_lvl--;
+       while (r->last) {
+               if (--r->last->endspan < 0)
+                       break;
+               roffnode_pop(r);
+       }
 }
 
 
 }
 
 
-/* FIXME: accept only struct rofftree *. */
 /* ARGSUSED */
 /* ARGSUSED */
-static int
-roff_Dd(ROFFCALL_ARGS)
+static enum rofferr
+roff_ccond(ROFF_ARGS)
 {
 
 {
 
-       dbg_enter(tree->args, ROFF_Dd);
+       if (NULL == r->last) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
+       }
 
 
-       assert(ROFF_PRELUDE & tree->state);
-       if (ROFF_PRELUDE_Dt & tree->state ||
-                       ROFF_PRELUDE_Dd & tree->state) {
-               warnx("%s: prelude `Dd' out-of-order (line %zu)",
-                               tree->rbuf->name, tree->rbuf->line);
-               return(0);
+       switch (r->last->tok) {
+       case (ROFF_el):
+               /* FALLTHROUGH */
+       case (ROFF_ie):
+               /* FALLTHROUGH */
+       case (ROFF_if):
+               break;
+       default:
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
        }
 
        }
 
-       assert(NULL == tree->last);
-       tree->state |= ROFF_PRELUDE_Dd;
+       if (r->last->endspan > -1) {
+               if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
+       }
 
 
-       dbg_leave(tree->args, ROFF_Dd);
+       if ((*bufp)[pos])
+               if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL))
+                       return(ROFF_ERR);
 
 
-       return(1);
+       roffnode_pop(r);
+       roffnode_cleanscope(r);
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Dt(ROFFCALL_ARGS)
+static enum rofferr
+roff_block(ROFF_ARGS)
 {
 {
+       int             sv;
+       size_t          sz;
+
+       if (ROFF_ig != tok && '\0' == (*bufp)[pos]) {
+               if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL))
+                       return(ROFF_ERR);
+               return(ROFF_IGN);
+       } else if (ROFF_ig != tok) {
+               while ((*bufp)[pos] && ' ' != (*bufp)[pos])
+                       pos++;
+               while (' ' == (*bufp)[pos])
+                       pos++;
+       }
 
 
-       dbg_enter(tree->args, ROFF_Dt);
+       if ( ! roffnode_push(r, tok, ln, ppos))
+               return(ROFF_ERR);
 
 
-       assert(ROFF_PRELUDE & tree->state);
-       if ( ! (ROFF_PRELUDE_Dd & tree->state) ||
-                       (ROFF_PRELUDE_Dt & tree->state)) {
-               warnx("%s: prelude `Dt' out-of-order (line %zu)",
-                               tree->rbuf->name, tree->rbuf->line);
-               return(0);
+       if ('\0' == (*bufp)[pos])
+               return(ROFF_IGN);
+
+       sv = pos;
+       while ((*bufp)[pos] && ' ' != (*bufp)[pos] && 
+                       '\t' != (*bufp)[pos])
+               pos++;
+
+       /*
+        * 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(pos > sv);
+       sz = (size_t)(pos - sv);
+
+       if (1 == sz && '.' == (*bufp)[sv])
+               return(ROFF_IGN);
+
+       r->last->end = malloc(sz + 1);
+
+       if (NULL == r->last->end) {
+               (*r->msg)(MANDOCERR_MEM, r->data, ln, pos, NULL);
+               return(ROFF_ERR);
        }
 
        }
 
-       assert(NULL == tree->last);
-       tree->state |= ROFF_PRELUDE_Dt;
+       memcpy(r->last->end, *bufp + sv, sz);
+       r->last->end[(int)sz] = '\0';
 
 
-       dbg_leave(tree->args, ROFF_Dt);
+       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_Os(ROFFCALL_ARGS)
+static enum rofferr
+roff_block_sub(ROFF_ARGS)
 {
 {
+       enum rofft      t;
+       int             i, j;
 
 
-       if (ROFF_EXIT == type) {
-               roffnode_free(ROFF_Os, tree);
-               dbg_leave(tree->args, ROFF_Os);
-               return(1);
-       } 
+       /*
+        * First check whether a custom macro exists at this level.  If
+        * it does, then check against it.  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.
+        */
 
 
-       dbg_enter(tree->args, ROFF_Os);
+       if (r->last->end) {
+               i = pos + 1;
+               while (' ' == (*bufp)[i] || '\t' == (*bufp)[i])
+                       i++;
 
 
-       assert(ROFF_PRELUDE & tree->state);
-       if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
-                       ! (ROFF_PRELUDE_Dd & tree->state)) {
-               warnx("%s: prelude `Os' out-of-order (line %zu)",
-                               tree->rbuf->name, tree->rbuf->line);
-               return(0);
+               for (j = 0; r->last->end[j]; j++, i++)
+                       if ((*bufp)[i] != r->last->end[j])
+                               break;
+
+               if ('\0' == r->last->end[j] && 
+                               ('\0' == (*bufp)[i] ||
+                                ' ' == (*bufp)[i] ||
+                                '\t' == (*bufp)[i])) {
+                       roffnode_pop(r);
+                       roffnode_cleanscope(r);
+
+                       if (ROFF_MAX != roff_parse(*bufp, &pos))
+                               return(ROFF_RERUN);
+                       return(ROFF_IGN);
+               }
        }
 
        }
 
-       assert(NULL == tree->last);
-       if (NULL == roffnode_new(ROFF_Os, tree->rbuf->line, tree))
-               return(0);
+       /*
+        * If we have no custom end-query or lookup failed, then try
+        * pulling it out of the hashtable.
+        */
 
 
-       tree->state |= ROFF_PRELUDE_Os;
-       tree->state &= ~ROFF_PRELUDE;
-       tree->state |= ROFF_BODY;
+       ppos = pos;
+       t = roff_parse(*bufp, &pos);
 
 
-       return(1);
+       /* If we're not a comment-end, then throw it away. */
+       if (ROFF_cblock != t)
+               return(ROFF_IGN);
+
+       assert(roffs[t].proc);
+       return((*roffs[t].proc)(r, t, bufp, szp, 
+                               ln, ppos, pos, offs));
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Sh(ROFFCALL_ARGS)
+static enum rofferr
+roff_block_text(ROFF_ARGS)
 {
 
 {
 
-       if (ROFF_EXIT == type) {
-               roffnode_free(ROFF_Sh, tree);
-               dbg_leave(tree->args, ROFF_Sh);
-               return(1);
-       } 
+       return(ROFF_IGN);
+}
 
 
-       dbg_enter(tree->args, ROFF_Sh);
 
 
-       if (NULL == roffnode_new(ROFF_Sh, tree->rbuf->line, tree))
-               return(0);
+/* ARGSUSED */
+static enum rofferr
+roff_cond_sub(ROFF_ARGS)
+{
+       enum rofft       t;
+       enum roffrule    rr;
+       struct roffnode *l;
 
 
-       return(1);
+       ppos = pos;
+       rr = r->last->rule;
+
+       /* 
+        * Clean out scope.  If we've closed ourselves, then don't
+        * continue. 
+        */
+
+       l = r->last;
+       roffnode_cleanscope(r);
+
+       if (l != r->last)
+               return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
+
+       if (ROFF_MAX == (t = roff_parse(*bufp, &pos)))
+               return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
+
+       /*
+        * A denied conditional must evaluate its children if and only
+        * if they're either structurally required (such as loops and
+        * conditionals) or a closing macro.
+        */
+       if (ROFFRULE_DENY == rr)
+               if ( ! (ROFFMAC_STRUCT & roffs[t].flags))
+                       if (ROFF_ccond != t)
+                               return(ROFF_IGN);
+
+       assert(roffs[t].proc);
+       return((*roffs[t].proc)(r, t, bufp, szp, 
+                               ln, ppos, pos, offs));
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_Li(ROFFCALL_ARGS) 
+static enum rofferr
+roff_cond_text(ROFF_ARGS)
 {
 {
+       char            *ep, *st;
+       enum roffrule    rr;
 
 
-       dbg_enter(tree->args, ROFF_Li);
-       dbg_leave(tree->args, ROFF_Li);
+       rr = r->last->rule;
 
 
-       return(1);
+       /*
+        * We display the value of the text if out current evaluation
+        * scope permits us to do so.
+        */
+
+       st = &(*bufp)[pos];
+       if (NULL == (ep = strstr(st, "\\}"))) {
+               roffnode_cleanscope(r);
+               return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
+       }
+
+       if (ep == st || (ep > st && '\\' != *(ep - 1)))
+               roffnode_pop(r);
+
+       roffnode_cleanscope(r);
+       return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
 }
 
 
 }
 
 
-static int
-roffnextopt(const char ***in, char **val)
+static enum roffrule
+roff_evalcond(const char *v, int *pos)
 {
 {
-       const char      *arg, **argv;
-       int              v;
 
 
-       *val = NULL;
-       argv = *in;
-       assert(argv);
+       switch (v[*pos]) {
+       case ('n'):
+               (*pos)++;
+               return(ROFFRULE_ALLOW);
+       case ('e'):
+               /* FALLTHROUGH */
+       case ('o'):
+               /* FALLTHROUGH */
+       case ('t'):
+               (*pos)++;
+               return(ROFFRULE_DENY);
+       default:
+               break;
+       }
 
 
-       if (NULL == (arg = *argv))
-               return(-1);
-       if ('-' != *arg)
-               return(-1);
-       if (ROFF_ARGMAX == (v = rofffindarg(&arg[1])))
-               return(-1);
-       if ( ! (ROFF_VALUE & tokenargs[v].flags))
-               return(v);
+       while (v[*pos] && ' ' != v[*pos])
+               (*pos)++;
+       return(ROFFRULE_DENY);
+}
 
 
-       *in = ++argv;
 
 
-       /* FIXME: what if this looks like a roff token or argument? */
+/* ARGSUSED */
+static enum rofferr
+roff_line(ROFF_ARGS)
+{
 
 
-       return(*argv ? v : ROFF_ARGMAX);
+       return(ROFF_IGN);
 }
 
 
 /* ARGSUSED */
 }
 
 
 /* ARGSUSED */
-static int
-roff_An(ROFFCALL_ARGS) 
+static enum rofferr
+roff_cond(ROFF_ARGS)
 {
 {
-       int              c;
-       char            *val;
+       int              sv;
+       enum roffrule    rule;
 
 
-       dbg_enter(tree->args, ROFF_An);
+       /* Stack overflow! */
 
 
-       while (-1 != (c = roffnextopt(&argv, &val))) {
-               switch (c) {
-               case (ROFF_Split):
-                       /* Process argument. */
-                       break;
-               case (ROFF_Nosplit):
-                       /* Process argument. */
-                       break;
-               default:
-                       warnx("%s: error parsing `An' args (line %zu)", 
-                                       tree->rbuf->name, 
-                                       tree->rbuf->line);
-                       return(0);
-               }
-               argv++;
+       if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) {
+               (*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL);
+               return(ROFF_ERR);
        }
 
        }
 
-       /* Print header. */
-  
-       while (*argv) {
-               if (/* is_parsable && */ 2 >= strlen(*argv)) {
-                       if (ROFF_MAX != (c = rofffindtok(*argv))) {
-                               if (ROFF_CALLABLE & tokens[c].flags) {
-                                       /* Call to token. */
-                                       if ( ! (*tokens[c].cb)(tree, (const char **)argv + 1, ROFF_ENTER))
-                                               return(0);
-                               } 
-                               /* Print token. */
-                       } else {
-                               /* Print token. */
-                       }
-               } else {
-                       /* Print token. */
-               }
-               argv++;
+       /* First, evaluate the conditional. */
+
+       if (ROFF_el == tok) {
+               /* 
+                * An `.el' will get the value of the current rstack
+                * entry set in prior `ie' calls or defaults to DENY.
+                */
+               if (r->rstackpos < 0)
+                       rule = ROFFRULE_DENY;
+               else
+                       rule = r->rstack[r->rstackpos];
+       } else
+               rule = roff_evalcond(*bufp, &pos);
+
+       sv = pos;
+
+       while (' ' == (*bufp)[pos])
+               pos++;
+
+       /*
+        * 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 ('\0' == (*bufp)[pos] && sv != pos) {
+               if ((*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL))
+                       return(ROFF_IGN);
+               return(ROFF_ERR);
        }
 
        }
 
-       /* Print footer. */
+       if ( ! roffnode_push(r, tok, ln, ppos))
+               return(ROFF_ERR);
 
 
-       dbg_leave(tree->args, ROFF_An);
+       r->last->rule = rule;
 
 
-       return(1);
+       ROFF_DEBUG("roff: cond: %s -> %s\n", roffs[tok].name, 
+                       ROFFRULE_ALLOW == rule ?  "allow" : "deny");
+
+       if (ROFF_ie == tok) {
+               /*
+                * An if-else will put the NEGATION of the current
+                * evaluated conditional into the stack.
+                */
+               r->rstackpos++;
+               if (ROFFRULE_DENY == r->last->rule)
+                       r->rstack[r->rstackpos] = ROFFRULE_ALLOW;
+               else
+                       r->rstack[r->rstackpos] = ROFFRULE_DENY;
+       }
+
+       /* If the parent has false as its rule, then so do we. */
+
+       if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) {
+               r->last->rule = ROFFRULE_DENY;
+               ROFF_DEBUG("roff: cond override: %s -> deny\n",
+                               roffs[tok].name);
+       }
+
+       /*
+        * Determine scope.  If we're invoked with "\{" trailing the
+        * conditional, then we're in a multiline scope.  Else our scope
+        * expires on the next line.
+        */
+
+       r->last->endspan = 1;
+
+       if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) {
+               r->last->endspan = -1;
+               pos += 2;
+               ROFF_DEBUG("roff: cond-scope: %s, multi-line\n", 
+                               roffs[tok].name);
+       } else
+               ROFF_DEBUG("roff: cond-scope: %s, one-line\n", 
+                               roffs[tok].name);
+
+       /*
+        * If there are no arguments on the line, the next-line scope is
+        * assumed.
+        */
+
+       if ('\0' == (*bufp)[pos])
+               return(ROFF_IGN);
+
+       /* Otherwise re-run the roff parser after recalculating. */
+
+       *offs = pos;
+       return(ROFF_RERUN);
 }
 
 }
 
+
+/* ARGSUSED */
+static enum rofferr
+roff_ds(ROFF_ARGS)
+{
+       char            *name, *string;
+
+       /*
+        * A symbol is named by the first word following the macro
+        * invocation up to a space.  Its value is anything after the
+        * name's trailing whitespace and optional double-quote.  Thus,
+        *
+        *  [.ds foo "bar  "     ]
+        *
+        * will have `bar  "     ' as its value.
+        */
+
+       name = *bufp + pos;
+       if ('\0' == *name)
+               return(ROFF_IGN);
+
+       string = name;
+       /* Read until end of name. */
+       while (*string && ' ' != *string)
+               string++;
+
+       /* Nil-terminate name. */
+       if (*string)
+               *(string++) = '\0';
+       
+       /* Read past spaces. */
+       while (*string && ' ' == *string)
+               string++;
+
+       /* Read passed initial double-quote. */
+       if (*string && '"' == *string)
+               string++;
+
+       /* The rest is the value. */
+       roff_setstr(r, name, string);
+       return(ROFF_IGN);
+}
+
+
+/* ARGSUSED */
+static enum rofferr
+roff_nr(ROFF_ARGS)
+{
+       const char      *key, *val;
+       struct reg      *rg;
+
+       key = &(*bufp)[pos];
+       rg = r->regs->regs;
+
+       /* Parse register request. */
+       while ((*bufp)[pos] && ' ' != (*bufp)[pos])
+               pos++;
+
+       /*
+        * Set our nil terminator.  Because this line is going to be
+        * ignored anyway, we can munge it as we please.
+        */
+       if ((*bufp)[pos])
+               (*bufp)[pos++] = '\0';
+
+       /* Skip whitespace to register token. */
+       while ((*bufp)[pos] && ' ' == (*bufp)[pos])
+               pos++;
+
+       val = &(*bufp)[pos];
+
+       /* Process register token. */
+
+       if (0 == strcmp(key, "nS")) {
+               rg[(int)REG_nS].set = 1;
+               if ( ! roff_parse_nat(val, &rg[(int)REG_nS].v.u))
+                       rg[(int)REG_nS].v.u = 0;
+
+               ROFF_DEBUG("roff: register nS: %u\n", 
+                               rg[(int)REG_nS].v.u);
+       } else
+               ROFF_DEBUG("roff: ignoring register: %s\n", key);
+
+       return(ROFF_IGN);
+}
+
+
+static void
+roff_setstr(struct roff *r, const char *name, const char *string)
+{
+       struct roffstr   *n;
+       char             *namecopy;
+
+       n = r->first_string;
+       while (n && strcmp(name, n->name))
+               n = n->next;
+
+       if (NULL == n) {
+               namecopy = mandoc_strdup(name);
+               n = mandoc_malloc(sizeof(struct roffstr));
+               n->name = namecopy;
+               n->next = r->first_string;
+               r->first_string = n;
+       } else
+               free(n->string);
+
+       ROFF_DEBUG("roff: new symbol: [%s] = [%s]\n", name, string);
+       n->string = string ? strdup(string) : NULL;
+}
+
+
+static const char *
+roff_getstrn(const struct roff *r, const char *name, size_t len)
+{
+       const struct roffstr *n;
+
+       n = r->first_string;
+       while (n && (strncmp(name, n->name, len) || '\0' != n->name[(int)len]))
+               n = n->next;
+
+       return(n ? n->string : NULL);
+}
+
+
+static void
+roff_freestr(struct roff *r)
+{
+       struct roffstr   *n, *nn;
+
+       for (n = r->first_string; n; n = nn) {
+               free(n->name);
+               free(n->string);
+               nn = n->next;
+               free(n);
+       }
+
+       r->first_string = NULL;
+}
A git conversion mirror of mandoc.bsd.lv