version 1.4, 2008/11/25 12:14:02 |
version 1.96, 2010/07/27 13:16:00 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* 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 |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* 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 <stdio.h> |
|
|
#include "libmdocml.h" |
#include "mandoc.h" |
#include "private.h" |
#include "roff.h" |
|
#include "libmandoc.h" |
|
|
#define ROFF_MAXARG 10 |
#define RSTACK_MAX 128 |
|
|
enum roffd { |
#define ROFF_CTL(c) \ |
ROFF_ENTER = 0, |
('.' == (c) || '\'' == (c)) |
ROFF_EXIT |
|
}; |
|
|
|
/* FIXME: prolog roffs can be text roffs, too. */ |
#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 rofftype { |
enum rofft { |
ROFF_COMMENT, |
ROFF_am, |
ROFF_TEXT, |
ROFF_ami, |
ROFF_LAYOUT |
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 |
}; |
}; |
|
|
#define ROFFCALL_ARGS \ |
enum roffrule { |
int tok, struct rofftree *tree, \ |
ROFFRULE_ALLOW, |
const char *argv[], enum roffd type |
ROFFRULE_DENY |
|
}; |
|
|
struct rofftree; |
|
|
|
struct rofftok { |
struct roffstr { |
int (*cb)(ROFFCALL_ARGS); |
char *name; /* key of symbol */ |
enum rofftype type; |
char *string; /* current value */ |
int flags; |
struct roffstr *next; /* next in list */ |
#define ROFF_NESTED (1 << 0) |
|
#define ROFF_PARSED (1 << 1) |
|
#define ROFF_CALLABLE (1 << 2) |
|
#define ROFF_QUOTES (1 << 3) |
|
}; |
}; |
|
|
struct roffarg { |
struct roff { |
int tok; |
struct roffnode *last; /* leaf of stack */ |
int flags; |
mandocmsg msg; /* err/warn/fatal messages */ |
#define ROFF_VALUE (1 << 0) |
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; |
enum rofft tok; /* type of node */ |
struct roffnode *parent; |
struct roffnode *parent; /* up one in stack */ |
size_t line; |
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 { |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
struct roffnode *last; |
enum rofft tok, /* tok of macro */ \ |
time_t date; |
char **bufp, /* input buffer */ \ |
char os[64]; |
size_t *szp, /* size of input buffer */ \ |
char title[64]; |
int ln, /* parse line */ \ |
char section[64]; |
int ppos, /* original pos in buffer */ \ |
char volume[64]; |
int pos, /* current pos in buffer */ \ |
int state; |
int *offs /* reset offset of buffer data */ |
#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) |
|
|
|
roffin roffin; |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
roffblkin roffblkin; |
|
roffout roffout; |
|
roffblkout roffblkout; |
|
|
|
struct md_mbuf *mbuf; /* NULL if !flush. */ |
struct roffmac { |
const struct md_args *args; |
const char *name; /* macro name */ |
const struct md_rbuf *rbuf; |
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; |
}; |
}; |
|
|
static int roff_Dd(ROFFCALL_ARGS); |
static enum rofferr roff_block(ROFF_ARGS); |
static int roff_Dt(ROFFCALL_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static int roff_Os(ROFFCALL_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
|
static enum rofferr roff_cblock(ROFF_ARGS); |
static int roff_layout(ROFFCALL_ARGS); |
static enum rofferr roff_ccond(ROFF_ARGS); |
static int roff_text(ROFFCALL_ARGS); |
static enum rofferr roff_cond(ROFF_ARGS); |
|
static enum rofferr roff_cond_text(ROFF_ARGS); |
static struct roffnode *roffnode_new(int, struct rofftree *); |
static enum rofferr roff_cond_sub(ROFF_ARGS); |
static void roffnode_free(int, struct rofftree *); |
static enum rofferr roff_ds(ROFF_ARGS); |
|
static enum roffrule roff_evalcond(const char *, int *); |
static int rofffindtok(const char *); |
static void roff_freestr(struct roff *); |
static int rofffindarg(const char *); |
static const char *roff_getstrn(const struct roff *, |
static int rofffindcallable(const char *); |
|
static int roffargs(int, char *, char **); |
|
static int roffparse(struct rofftree *, char *, size_t); |
|
static int textparse(const struct rofftree *, |
|
const char *, size_t); |
const char *, size_t); |
|
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() */ |
|
|
static const struct rofftok tokens[ROFF_MAX] = { |
#define ASCII_HI 126 |
{ NULL, ROFF_COMMENT, 0 }, |
#define ASCII_LO 33 |
{ roff_Dd, ROFF_TEXT, 0 }, /* Dd */ |
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
{ roff_Dt, ROFF_TEXT, 0 }, /* Dt */ |
|
{ roff_Os, ROFF_TEXT, 0 }, /* Os */ |
|
{ roff_layout, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
|
{ roff_layout, ROFF_LAYOUT, ROFF_PARSED }, /* Ss XXX */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* Pp */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* D1 */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* Dl */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* Bd */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* Ed */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* Bl */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* El */ |
|
{ roff_layout, ROFF_LAYOUT, 0 }, /* It */ |
|
{ roff_text, ROFF_TEXT, ROFF_PARSED }, /* An */ |
|
{ roff_text, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
|
}; |
|
|
|
/* FIXME: multiple owners? */ |
static struct roffmac *hash[HASHWIDTH]; |
|
|
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
static struct roffmac roffs[ROFF_MAX] = { |
{ ROFF_An, 0 }, /* split */ |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_An, 0 }, /* nosplit */ |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bd, 0 }, /* ragged */ |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bd, 0 }, /* unfilled */ |
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bd, 0 }, /* literal */ |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bd, ROFF_VALUE }, /* file */ |
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bd, ROFF_VALUE }, /* offset */ |
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* bullet */ |
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ ROFF_Bl, 0 }, /* dash */ |
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ ROFF_Bl, 0 }, /* hyphen */ |
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ ROFF_Bl, 0 }, /* item */ |
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ROFF_Bl, 0 }, /* enum */ |
{ "rm", roff_line, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* tag */ |
{ "tr", roff_line, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* diag */ |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* hang */ |
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* ohang */ |
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
{ ROFF_Bl, 0 }, /* inset */ |
|
{ ROFF_Bl, 0 }, /* column */ |
|
}; |
}; |
|
|
static const char *const toknames[ROFF_MAX] = ROFF_NAMES; |
static void roff_free1(struct roff *); |
static const char *const tokargnames[ROFF_ARGMAX] = ROFF_ARGNAMES; |
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 *); |
|
|
|
/* See roff_hash_find() */ |
|
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
|
|
int |
static void |
roff_free(struct rofftree *tree, int flush) |
roff_hash_init(void) |
{ |
{ |
int error; |
struct roffmac *n; |
|
int buc, i; |
|
|
assert(tree->mbuf); |
for (i = 0; i < (int)ROFF_MAX; i++) { |
if ( ! flush) |
assert(roffs[i].name[0] >= ASCII_LO); |
tree->mbuf = NULL; |
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
/* LINTED */ |
buc = ROFF_HASH(roffs[i].name); |
while (tree->last) |
|
if ( ! (*tokens[tree->last->tok].cb) |
|
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
|
/* Disallow flushing. */ |
|
tree->mbuf = NULL; |
|
|
|
error = tree->mbuf ? 0 : 1; |
if (NULL != (n = hash[buc])) { |
|
for ( ; n->next; n = n->next) |
if (tree->mbuf && (ROFF_PRELUDE & tree->state)) { |
/* Do nothing. */ ; |
warnx("%s: prelude never finished", |
n->next = &roffs[i]; |
tree->rbuf->name); |
} else |
error = 1; |
hash[buc] = &roffs[i]; |
} |
} |
|
|
free(tree); |
|
return(error ? 0 : 1); |
|
} |
} |
|
|
|
|
struct rofftree * |
/* |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
const struct md_rbuf *in, roffin textin, |
* the nil-terminated string name could be found. |
roffout textout, roffblkin blkin, roffblkout blkout) |
*/ |
|
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"); |
* libroff has an extremely simple hashtable, for the time |
return(NULL); |
* being, which simply keys on the first character, which must |
} |
* be printable, then walks a chain. It works well enough until |
|
* optimised. |
|
*/ |
|
|
tree->state = ROFF_PRELUDE; |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
tree->args = args; |
return(ROFF_MAX); |
tree->mbuf = out; |
|
tree->rbuf = in; |
|
tree->roffin = textin; |
|
tree->roffout = textout; |
|
tree->roffblkin = blkin; |
|
tree->roffblkout = blkout; |
|
|
|
return(tree); |
buc = ROFF_HASH(p); |
|
|
|
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) { |
assert(r->last); |
warnx("%s: blank line (line %zu)", |
p = r->last; |
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} else if ('.' != *buf) |
|
return(textparse(tree, buf, sz)); |
|
|
|
return(roffparse(tree, buf, sz)); |
if (ROFF_el == p->tok) |
|
if (r->rstackpos > -1) |
|
r->rstackpos--; |
|
|
|
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) |
{ |
{ |
|
struct roffnode *p; |
if (NULL == tree->last) { |
|
warnx("%s: unexpected text (line %zu)", |
if (NULL == (p = calloc(1, sizeof(struct roffnode)))) { |
tree->rbuf->name, |
(*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL); |
tree->rbuf->line); |
|
return(0); |
return(0); |
} else if (NULL == tree->last->parent) { |
|
warnx("%s: disallowed text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
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 |
static void |
roffargs(int tok, char *buf, char **argv) |
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 */ |
void |
for (i = 0; *buf && i < ROFF_MAXARG; i++) { |
roff_reset(struct roff *r) |
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; |
|
|
|
return(ROFF_MAXARG > i); |
roff_free1(r); |
} |
} |
|
|
|
|
static int |
void |
roffparse(struct rofftree *tree, char *buf, size_t sz) |
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) { |
struct roff * |
warnx("%s: malformed line (line %zu)", |
roff_alloc(struct regset *regs, const mandocmsg msg, void *data) |
tree->rbuf->name, |
{ |
tree->rbuf->line); |
struct roff *r; |
|
|
|
if (NULL == (r = calloc(1, sizeof(struct roff)))) { |
|
(*msg)(MANDOCERR_MEM, data, 0, 0, NULL); |
return(0); |
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, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
/* |
r->regs = regs; |
* If this is a non-nestable layout token and we're below a |
r->msg = msg; |
* token of the same type, then recurse upward to the token, |
r->data = data; |
* closing out the interim scopes. |
r->rstackpos = -1; |
* |
|
* If there's a nested token on the chain, then raise an error |
roff_hash_init(); |
* as nested tokens have corresponding "ending" tokens and we're |
return(r); |
* breaking their scope. |
} |
*/ |
|
|
|
node = NULL; |
|
|
|
if (ROFF_LAYOUT == tokens[tok].type && |
/* |
! (ROFF_NESTED & tokens[tok].flags)) { |
* Pre-filter each and every line for reserved words (one beginning with |
for (node = tree->last; node; node = node->parent) { |
* `\*', e.g., `\*(ab'). These must be handled before the actual line |
if (node->tok == tok) |
* 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; |
|
|
|
/* LINTED */ |
|
for (cp = &(*bufp)[pos]; (cpp = strstr(cp, "\\*")); cp++) { |
|
cp = cpp + 2; |
|
switch (*cp) { |
|
case ('('): |
|
cp++; |
|
maxl = 2; |
|
break; |
|
case ('['): |
|
cp++; |
|
maxl = 0; |
|
break; |
|
default: |
|
maxl = 1; |
|
break; |
|
} |
|
|
|
st = cp; |
|
|
|
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { |
|
if ('\0' == *cp) |
|
return(1); /* Error. */ |
|
if (0 == maxl && ']' == *cp) |
break; |
break; |
|
} |
|
|
/* Don't break nested scope. */ |
res = roff_getstrn(r, st, (size_t)i); |
|
|
if ( ! (ROFF_NESTED & tokens[node->tok].flags)) |
if (NULL == res) { |
continue; |
cp -= maxl ? 1 : 0; |
warnx("%s: scope of %s (line %zu) broken by " |
continue; |
"%s (line %zu)", |
|
tree->rbuf->name, |
|
toknames[tok], node->line, |
|
toknames[node->tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
|
ROFF_DEBUG("roff: splicing reserved: [%.*s]\n", i, st); |
|
|
|
nsz = *szp + strlen(res) + 1; |
|
n = mandoc_malloc(nsz); |
|
|
|
*n = '\0'; |
|
|
|
strlcat(n, *bufp, (size_t)(cpp - *bufp + 1)); |
|
strlcat(n, res, nsz); |
|
strlcat(n, cp + (maxl ? 0 : 1), nsz); |
|
|
|
free(*bufp); |
|
|
|
*bufp = n; |
|
*szp = nsz; |
|
return(0); |
} |
} |
|
|
if (node) { |
return(1); |
assert(ROFF_LAYOUT == tokens[tok].type); |
} |
assert( ! (ROFF_NESTED & tokens[tok].flags)); |
|
assert(node->tok == tok); |
|
|
|
/* Clear up to last scoped token. */ |
|
|
|
/* LINTED */ |
enum rofferr |
do { |
roff_parseln(struct roff *r, int ln, char **bufp, |
t = tree->last->tok; |
size_t *szp, int pos, int *offs) |
if ( ! (*tokens[tree->last->tok].cb) |
{ |
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
enum rofft t; |
return(0); |
int ppos; |
} while (t != tok); |
|
|
/* |
|
* Run the reserved-word filter only if we have some reserved |
|
* words to fill in. |
|
*/ |
|
|
|
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. |
|
*/ |
|
|
|
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); |
|
|
|
/* |
|
* If a scope is open, go to the child handler for that macro, |
|
* as it may want to preprocess before doing anything with it. |
|
*/ |
|
|
|
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)); |
} |
} |
|
|
/* Proceed with actual token processing. */ |
/* |
|
* 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. |
|
*/ |
|
|
argvp = (const char **)&argv[1]; |
ppos = pos; |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
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)); |
} |
} |
|
|
|
|
static int |
int |
rofffindarg(const char *name) |
roff_endparse(struct roff *r) |
{ |
{ |
size_t i; |
|
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
if (NULL == r->last) |
|
return(1); |
/* LINTED */ |
return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, |
for (i = 0; i < ROFF_ARGMAX; i++) |
r->last->col, NULL)); |
/* LINTED */ |
|
if (0 == strcmp(name, tokargnames[i])) |
|
return((int)i); |
|
|
|
return(ROFF_ARGMAX); |
|
} |
} |
|
|
|
|
static int |
/* |
rofffindtok(const char *name) |
* 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) |
{ |
{ |
size_t i; |
int j; |
|
char mac[5]; |
|
enum rofft t; |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
assert(ROFF_CTL(buf[*pos])); |
|
(*pos)++; |
|
|
/* LINTED */ |
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
for (i = 0; i < ROFF_MAX; i++) |
(*pos)++; |
/* LINTED */ |
|
if (0 == strncmp(name, toknames[i], 2)) |
if ('\0' == buf[*pos]) |
return((int)i); |
return(ROFF_MAX); |
|
|
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 |
static int |
rofffindcallable(const char *name) |
roff_parse_nat(const char *buf, unsigned int *res) |
{ |
{ |
int c; |
char *ep; |
|
long lval; |
|
|
if (ROFF_MAX == (c = rofffindtok(name))) |
errno = 0; |
return(ROFF_MAX); |
lval = strtol(buf, &ep, 10); |
return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
if (buf[0] == '\0' || *ep != '\0') |
|
return(0); |
|
if ((errno == ERANGE && |
|
(lval == LONG_MAX || lval == LONG_MIN)) || |
|
(lval > INT_MAX || lval < 0)) |
|
return(0); |
|
|
|
*res = (unsigned int)lval; |
|
return(1); |
} |
} |
|
|
|
|
static struct roffnode * |
/* ARGSUSED */ |
roffnode_new(int tokid, struct rofftree *tree) |
static enum rofferr |
|
roff_cblock(ROFF_ARGS) |
{ |
{ |
struct roffnode *p; |
|
|
/* |
if (NULL == (p = malloc(sizeof(struct roffnode)))) { |
* A block-close `..' should only be invoked as a child of an |
warn("malloc"); |
* ignore macro, otherwise raise a warning and just ignore it. |
return(NULL); |
*/ |
|
|
|
if (NULL == r->last) { |
|
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
|
return(ROFF_IGN); |
} |
} |
|
|
p->line = tree->rbuf->line; |
switch (r->last->tok) { |
p->tok = tokid; |
case (ROFF_am): |
p->parent = tree->last; |
/* FALLTHROUGH */ |
tree->last = p; |
case (ROFF_ami): |
return(p); |
/* FALLTHROUGH */ |
|
case (ROFF_am1): |
|
/* FALLTHROUGH */ |
|
case (ROFF_de): |
|
/* FALLTHROUGH */ |
|
case (ROFF_dei): |
|
/* FALLTHROUGH */ |
|
case (ROFF_de1): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ig): |
|
break; |
|
default: |
|
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); |
|
|
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
|
|
} |
} |
|
|
|
|
static void |
static void |
roffnode_free(int tokid, struct rofftree *tree) |
roffnode_cleanscope(struct roff *r) |
{ |
{ |
struct roffnode *p; |
|
|
|
assert(tree->last); |
while (r->last) { |
assert(tree->last->tok == tokid); |
if (--r->last->endspan < 0) |
|
break; |
p = tree->last; |
roffnode_pop(r); |
tree->last = tree->last->parent; |
} |
free(p); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_ccond(ROFF_ARGS) |
{ |
{ |
|
|
if (ROFF_BODY & tree->state) { |
if (NULL == r->last) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
assert(ROFF_PRELUDE_Dd & tree->state); |
return(ROFF_ERR); |
return(roff_text(tok, tree, argv, type)); |
return(ROFF_IGN); |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
switch (r->last->tok) { |
assert( ! (ROFF_BODY & tree->state)); |
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); |
|
} |
|
|
if (ROFF_PRELUDE_Dd & tree->state || |
if (r->last->endspan > -1) { |
ROFF_PRELUDE_Dt & tree->state) { |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
return(ROFF_ERR); |
tree->rbuf->name, tree->rbuf->line); |
return(ROFF_IGN); |
return(0); |
|
} |
} |
|
|
/* TODO: parse date. */ |
if ((*bufp)[pos]) |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
|
return(ROFF_ERR); |
|
|
assert(NULL == tree->last); |
roffnode_pop(r); |
tree->state |= ROFF_PRELUDE_Dd; |
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dt(ROFFCALL_ARGS) |
roff_block(ROFF_ARGS) |
{ |
{ |
|
int sv; |
|
size_t sz; |
|
|
if (ROFF_BODY & tree->state) { |
if (ROFF_ig != tok && '\0' == (*bufp)[pos]) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
assert(ROFF_PRELUDE_Dt & tree->state); |
return(ROFF_ERR); |
return(roff_text(tok, tree, argv, type)); |
return(ROFF_IGN); |
|
} else if (ROFF_ig != tok) { |
|
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
|
pos++; |
|
while (' ' == (*bufp)[pos]) |
|
pos++; |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
if ( ! roffnode_push(r, tok, ln, ppos)) |
assert( ! (ROFF_BODY & tree->state)); |
return(ROFF_ERR); |
|
|
if ( ! (ROFF_PRELUDE_Dd & tree->state) || |
if ('\0' == (*bufp)[pos]) |
(ROFF_PRELUDE_Dt & tree->state)) { |
return(ROFF_IGN); |
warnx("%s: prelude `Dt' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
sv = pos; |
return(0); |
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); |
} |
} |
|
|
/* TODO: parse date. */ |
memcpy(r->last->end, *bufp + sv, sz); |
|
r->last->end[(int)sz] = '\0'; |
|
|
assert(NULL == tree->last); |
if ((*bufp)[pos]) |
tree->state |= ROFF_PRELUDE_Dt; |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
|
return(ROFF_ERR); |
|
|
return(1); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Os(ROFFCALL_ARGS) |
roff_block_sub(ROFF_ARGS) |
{ |
{ |
|
enum rofft t; |
|
int i, j; |
|
|
if (ROFF_EXIT == type) { |
/* |
assert(ROFF_PRELUDE_Os & tree->state); |
* First check whether a custom macro exists at this level. If |
return(roff_layout(tok, tree, argv, type)); |
* it does, then check against it. This is some of groff's |
} else if (ROFF_BODY & tree->state) { |
* stranger behaviours. If we encountered a custom end-scope |
assert( ! (ROFF_PRELUDE & tree->state)); |
* tag and that tag also happens to be a "real" macro, then we |
assert(ROFF_PRELUDE_Os & tree->state); |
* need to try interpreting it again as a real macro. If it's |
return(roff_text(tok, tree, argv, type)); |
* not, then return ignore. Else continue. |
} |
*/ |
|
|
assert(ROFF_PRELUDE & tree->state); |
if (r->last->end) { |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
i = pos + 1; |
! (ROFF_PRELUDE_Dd & tree->state)) { |
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
warnx("%s: prelude `Os' out-of-order (line %zu)", |
i++; |
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); |
|
} |
} |
} |
|
|
/* TODO: extract OS. */ |
/* |
|
* If we have no custom end-query or lookup failed, then try |
|
* pulling it out of the hashtable. |
|
*/ |
|
|
tree->state |= ROFF_PRELUDE_Os; |
ppos = pos; |
tree->state &= ~ROFF_PRELUDE; |
t = roff_parse(*bufp, &pos); |
tree->state |= ROFF_BODY; |
|
|
|
assert(NULL == tree->last); |
/* If we're not a comment-end, then throw it away. */ |
|
if (ROFF_cblock != t) |
|
return(ROFF_IGN); |
|
|
return(roff_layout(tok, tree, argv, type)); |
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
/* ARGUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roffnextopt(const char ***in, char **val) |
roff_block_text(ROFF_ARGS) |
{ |
{ |
const char *arg, **argv; |
|
int v; |
|
|
|
*val = NULL; |
return(ROFF_IGN); |
argv = *in; |
} |
assert(argv); |
|
|
|
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); |
|
|
|
*in = ++argv; |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cond_sub(ROFF_ARGS) |
|
{ |
|
enum rofft t; |
|
enum roffrule rr; |
|
struct roffnode *l; |
|
|
/* FIXME: what if this looks like a roff token or argument? */ |
ppos = pos; |
|
rr = r->last->rule; |
|
|
return(*argv ? v : ROFF_ARGMAX); |
/* |
|
* 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 |
static enum rofferr |
roff_layout(ROFFCALL_ARGS) |
roff_cond_text(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
char *ep, *st; |
char *v, *argvp[ROFF_MAXARG]; |
enum roffrule rr; |
|
|
if (ROFF_PRELUDE & tree->state) { |
rr = r->last->rule; |
warnx("%s: macro `%s' called in prelude (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
if (ROFF_EXIT == type) { |
/* |
roffnode_free(tok, tree); |
* We display the value of the text if out current evaluation |
return((*tree->roffblkout)(tok)); |
* scope permits us to do so. |
} |
*/ |
|
|
i = 0; |
st = &(*bufp)[pos]; |
while (-1 != (c = roffnextopt(&argv, &v))) { |
if (NULL == (ep = strstr(st, "\\}"))) { |
if (ROFF_ARGMAX == c) { |
roffnode_cleanscope(r); |
warnx("%s: error parsing `%s' args (line %zu)", |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
tree->rbuf->name, |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
|
argv++; |
|
} |
} |
|
|
if (NULL == roffnode_new(tok, tree)) |
if (ep == st || (ep > st && '\\' != *(ep - 1))) |
return(0); |
roffnode_pop(r); |
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
roffnode_cleanscope(r); |
return(0); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
} |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
/* TODO: print all tokens. */ |
|
|
|
if ( ! ((*tree->roffout)(tok))) |
static enum roffrule |
return(0); |
roff_evalcond(const char *v, int *pos) |
return((*tree->roffblkin)(tok)); |
{ |
|
|
|
switch (v[*pos]) { |
|
case ('n'): |
|
(*pos)++; |
|
return(ROFFRULE_ALLOW); |
|
case ('e'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
|
/* FALLTHROUGH */ |
|
case ('t'): |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
|
default: |
|
break; |
} |
} |
|
|
while (*argv) { |
while (v[*pos] && ' ' != v[*pos]) |
if (2 >= strlen(*argv) && ROFF_MAX != |
(*pos)++; |
(c = rofffindcallable(*argv))) |
return(ROFFRULE_DENY); |
if ( ! (*tokens[c].cb)(c, tree, |
} |
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
|
argv++; |
|
} |
|
|
|
if ( ! ((*tree->roffout)(tok))) |
/* ARGSUSED */ |
return(0); |
static enum rofferr |
|
roff_line(ROFF_ARGS) |
|
{ |
|
|
return((*tree->roffblkin)(tok)); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_text(ROFFCALL_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
int sv; |
char *v, *argvp[ROFF_MAXARG]; |
enum roffrule rule; |
|
|
if (ROFF_PRELUDE & tree->state) { |
/* Stack overflow! */ |
warnx("%s: macro `%s' called in prelude (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) { |
tree->rbuf->line); |
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
return(0); |
return(ROFF_ERR); |
} |
} |
|
|
i = 0; |
/* First, evaluate the conditional. */ |
while (-1 != (c = roffnextopt(&argv, &v))) { |
|
if (ROFF_ARGMAX == c) { |
if (ROFF_el == tok) { |
warnx("%s: error parsing `%s' args (line %zu)", |
/* |
tree->rbuf->name, |
* An `.el' will get the value of the current rstack |
toknames[tok], |
* entry set in prior `ie' calls or defaults to DENY. |
tree->rbuf->line); |
*/ |
return(0); |
if (r->rstackpos < 0) |
} |
rule = ROFFRULE_DENY; |
argcp[i] = c; |
else |
argvp[i] = v; |
rule = r->rstack[r->rstackpos]; |
argv++; |
} 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); |
} |
} |
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
if ( ! roffnode_push(r, tok, ln, ppos)) |
return(0); |
return(ROFF_ERR); |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
r->last->rule = rule; |
/* TODO: print all tokens. */ |
|
return((*tree->roffout)(tok)); |
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; |
} |
} |
|
|
while (*argv) { |
/* If the parent has false as its rule, then so do we. */ |
if (2 >= strlen(*argv) && ROFF_MAX != |
|
(c = rofffindcallable(*argv))) |
|
if ( ! (*tokens[c].cb)(c, tree, |
|
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) { |
argv++; |
r->last->rule = ROFFRULE_DENY; |
|
ROFF_DEBUG("roff: cond override: %s -> deny\n", |
|
roffs[tok].name); |
} |
} |
|
|
return((*tree->roffout)(tok)); |
/* |
|
* 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[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; |
} |
} |