version 1.55, 2008/12/09 17:09:12 |
version 1.88, 2010/06/10 21:42:02 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* 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 |
* 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. |
|
*/ |
*/ |
#include <sys/param.h> |
#ifdef HAVE_CONFIG_H |
#include <sys/types.h> |
#include "config.h" |
|
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.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 "private.h" |
#include "mandoc.h" |
#include "roff.h" |
#include "roff.h" |
|
|
/* FIXME: First letters of quoted-text interpreted in rofffindtok. */ |
#define RSTACK_MAX 128 |
/* FIXME: `No' not implemented. */ |
|
/* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
|
/* TODO: warn about empty lists. */ |
|
/* TODO: (warn) some sections need specific elements. */ |
|
/* TODO: (warn) NAME section has particular order. */ |
|
/* TODO: macros with a set number of arguments? */ |
|
/* TODO: validate Dt macro arguments. */ |
|
/* FIXME: Bl -diag supposed to ignore callable children. */ |
|
|
|
struct roffnode { |
#define ROFF_CTL(c) \ |
int tok; /* Token id. */ |
('.' == (c) || '\'' == (c)) |
struct roffnode *parent; /* Parent (or NULL). */ |
|
|
#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_MAX |
}; |
}; |
|
|
enum rofferr { |
enum roffrule { |
ERR_ARGEQ1, /* Macro requires arg == 1. */ |
ROFFRULE_ALLOW, |
ERR_ARGEQ0, /* Macro requires arg == 0. */ |
ROFFRULE_DENY |
ERR_ARGGE1, /* Macro requires arg >= 1. */ |
|
ERR_ARGGE2, /* Macro requires arg >= 2. */ |
|
ERR_ARGLEN, /* Macro argument too long. */ |
|
ERR_BADARG, /* Macro has bad arg. */ |
|
ERR_ARGMNY, /* Too many macro arguments. */ |
|
ERR_NOTSUP, /* Macro not supported. */ |
|
ERR_DEPREC, /* Macro deprecated. */ |
|
ERR_PR_OOO, /* Prelude macro bad order. */ |
|
ERR_PR_REP, /* Prelude macro repeated. */ |
|
ERR_NOT_PR, /* Not allowed in prelude. */ |
|
WRN_SECORD, /* Sections out-of-order. */ |
|
}; |
}; |
|
|
struct rofftree { |
struct roff { |
struct roffnode *last; /* Last parsed node. */ |
struct roffnode *last; /* leaf of stack */ |
char *cur; /* Line start. */ |
mandocmsg msg; /* err/warn/fatal messages */ |
struct tm tm; /* `Dd' results. */ |
void *data; /* privdata for messages */ |
char name[64]; /* `Nm' results. */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
char os[64]; /* `Os' results. */ |
int rstackpos; /* position in rstack */ |
char title[64]; /* `Dt' results. */ |
|
enum roffmsec section; |
|
char volume[64]; /* `Dt' results. */ |
|
int state; |
|
#define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ /* FIXME: put into asec. */ |
|
#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. */ |
|
int csec; /* Current section. */ |
|
int asec; /* Thus-far sections. */ |
|
}; |
}; |
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
struct roffnode { |
static void roffnode_free(struct rofftree *); |
enum rofft tok; /* type of node */ |
static int roff_warn(const struct rofftree *, |
struct roffnode *parent; /* up one in stack */ |
const char *, char *, ...); |
int line; /* parse line */ |
static int roff_warnp(const struct rofftree *, |
int col; /* parse col */ |
const char *, int, enum rofferr); |
char *end; /* end-rules: custom token */ |
static int roff_err(const struct rofftree *, |
int endspan; /* end-rules: next-line or infty */ |
const char *, char *, ...); |
enum roffrule rule; /* current evaluation rule */ |
static int roff_errp(const struct rofftree *, |
}; |
const char *, int, enum rofferr); |
|
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 roffispunct(const char *); |
|
static int roffchecksec(struct rofftree *, |
|
const char *, int); |
|
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 roffexit(struct rofftree *, int); |
|
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__ |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
extern size_t strlcat(char *, const char *, size_t); |
enum rofft tok, /* tok of macro */ \ |
extern size_t strlcpy(char *, const char *, size_t); |
char **bufp, /* input buffer */ \ |
extern int vsnprintf(char *, size_t, |
size_t *szp, /* size of input buffer */ \ |
const char *, va_list); |
int ln, /* parse line */ \ |
extern char *strptime(const char *, const char *, |
int ppos, /* original pos in buffer */ \ |
struct tm *); |
int pos, /* current pos in buffer */ \ |
#endif |
int *offs /* reset offset of buffer data */ |
|
|
int |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
roff_free(struct rofftree *tree, int flush) |
|
{ |
|
int error, t; |
|
struct roffnode *n; |
|
|
|
error = 0; |
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; |
|
}; |
|
|
if ( ! flush) |
static enum rofferr roff_block(ROFF_ARGS); |
goto end; |
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 roffrule roff_evalcond(const char *, int *); |
|
static enum rofferr roff_line(ROFF_ARGS); |
|
|
error = 1; |
/* See roff_hash_find() */ |
|
|
if (ROFF_PRELUDE & tree->state) { |
#define ASCII_HI 126 |
(void)roff_err(tree, NULL, "prelude never finished"); |
#define ASCII_LO 33 |
goto end; |
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
} else if ( ! (ROFFSec_NAME & tree->asec)) { |
|
(void)roff_err(tree, NULL, "missing `NAME' section"); |
|
goto end; |
|
} else if ( ! (ROFFSec_NMASK & tree->asec)) |
|
(void)roff_warn(tree, NULL, "missing suggested `NAME', " |
|
"`SYNOPSIS', `DESCRIPTION' sections"); |
|
|
|
for (n = tree->last; n; n = n->parent) { |
static struct roffmac *hash[HASHWIDTH]; |
if (0 != tokens[n->tok].ctx) |
|
continue; |
|
(void)roff_err(tree, NULL, "closing explicit scope " |
|
"`%s'", toknames[n->tok]); |
|
goto end; |
|
} |
|
|
|
while (tree->last) { |
static struct roffmac roffs[ROFF_MAX] = { |
t = tree->last->tok; |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
if ( ! roffexit(tree, t)) |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
goto end; |
{ "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_line, 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 }, |
|
}; |
|
|
if ( ! (*tree->cb.rofftail)(tree->arg)) |
static void roff_free1(struct roff *); |
goto end; |
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 *); |
|
|
error = 0; |
/* See roff_hash_find() */ |
|
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
|
|
end: |
static void |
|
roff_hash_init(void) |
|
{ |
|
struct roffmac *n; |
|
int buc, i; |
|
|
while (tree->last) |
for (i = 0; i < (int)ROFF_MAX; i++) { |
roffnode_free(tree); |
assert(roffs[i].name[0] >= ASCII_LO); |
|
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
free(tree); |
buc = ROFF_HASH(roffs[i].name); |
|
|
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 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; |
int buc; |
|
struct roffmac *n; |
|
|
assert(args); |
/* |
assert(cb); |
* 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 (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
err(1, "calloc"); |
return(ROFF_MAX); |
|
|
tree->state = ROFF_PRELUDE; |
buc = ROFF_HASH(p); |
tree->arg = args; |
|
tree->section = ROFF_MSEC_MAX; |
|
|
|
(void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
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(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(r->last); |
assert(buf); |
p = r->last; |
|
|
if (0 == *buf) |
if (ROFF_el == p->tok) |
return(roff_err(tree, buf, "blank line")); |
if (r->rstackpos > -1) |
else if ('.' != *buf) |
r->rstackpos--; |
return(textparse(tree, buf)); |
|
|
|
return(roffparse(tree, buf)); |
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; |
struct roffnode *p; |
|
|
/* TODO: literal parsing. */ |
if (NULL == (p = calloc(1, sizeof(struct roffnode)))) { |
|
(*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL); |
if ( ! (ROFF_BODY & tree->state)) |
return(0); |
return(roff_err(tree, buf, "data not in body")); |
|
|
|
/* 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; |
|
p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY; |
|
|
|
r->last = p; |
return(1); |
return(1); |
} |
} |
|
|
|
|
static int |
static void |
roffargs(const struct rofftree *tree, |
roff_free1(struct roff *r) |
int tok, char *buf, char **argv) |
|
{ |
{ |
int i; |
|
char *p; |
|
|
|
assert(tok >= 0 && tok < ROFF_MAX); |
while (r->last) |
assert('.' == *buf); |
roffnode_pop(r); |
|
} |
|
|
p = buf; |
|
|
|
/* |
void |
* This is an ugly little loop. It parses a line into |
roff_reset(struct roff *r) |
* 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 */ |
roff_free1(r); |
for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) { |
|
if ('\"' == *buf) { |
|
argv[i] = ++buf; |
|
while (*buf && '\"' != *buf) |
|
buf++; |
|
if (0 == *buf) |
|
return(roff_err(tree, argv[i], |
|
"unclosed quote in arg list")); |
|
} 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) |
|
return(roff_err(tree, p, "too many args")); |
|
|
|
argv[i] = NULL; |
|
return(1); |
|
} |
} |
|
|
|
|
static int |
void |
roffscan(int tok, const int *tokv) |
roff_free(struct roff *r) |
{ |
{ |
|
|
if (NULL == tokv) |
roff_free1(r); |
return(1); |
free(r); |
|
|
for ( ; ROFF_MAX != *tokv; tokv++) |
|
if (tok == *tokv) |
|
return(1); |
|
|
|
return(0); |
|
} |
} |
|
|
|
|
static int |
struct roff * |
roffparse(struct rofftree *tree, char *buf) |
roff_alloc(const mandocmsg msg, void *data) |
{ |
{ |
int tok, t; |
struct roff *r; |
struct roffnode *n; |
|
char *argv[ROFF_MAXLINEARG]; |
|
char **argvp; |
|
|
|
if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2)) |
if (NULL == (r = calloc(1, sizeof(struct roff)))) { |
if (0 == strncmp(buf, ".\\\"", 3)) |
(*msg)(MANDOCERR_MEM, data, 0, 0, NULL); |
return(1); |
|
|
|
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) |
|
return(roff_err(tree, buf, "bogus line macro")); |
|
else if ( ! roffargs(tree, tok, buf, argv)) |
|
return(0); |
return(0); |
|
} |
|
|
argvp = (char **)argv; |
r->msg = msg; |
|
r->data = data; |
/* |
r->rstackpos = -1; |
* Prelude macros break some assumptions, so branch now. |
|
*/ |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
roff_hash_init(); |
assert(NULL == tree->last); |
return(r); |
return(roffcall(tree, tok, argvp)); |
} |
} |
|
|
|
assert(ROFF_BODY & tree->state); |
|
|
|
/* |
enum rofferr |
* First check that our possible parents and parent's possible |
roff_parseln(struct roff *r, int ln, |
* children are satisfied. |
char **bufp, size_t *szp, int pos, int *offs) |
*/ |
{ |
|
enum rofft t; |
|
int ppos; |
|
|
if (tree->last && ! roffscan |
|
(tree->last->tok, tokens[tok].parents)) |
|
return(roff_err(tree, *argvp, "`%s' has invalid " |
|
"parent `%s'", toknames[tok], |
|
toknames[tree->last->tok])); |
|
|
|
if (tree->last && ! roffscan |
|
(tok, tokens[tree->last->tok].children)) |
|
return(roff_err(tree, *argvp, "`%s' has invalid " |
|
"child `%s'", toknames[tok], |
|
toknames[tree->last->tok])); |
|
|
|
/* |
/* |
* Branch if we're not a layout token. |
* 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 (ROFF_LAYOUT != tokens[tok].type) |
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
return(roffcall(tree, tok, argvp)); |
t = r->last->tok; |
if (0 == tokens[tok].ctx) |
assert(roffs[t].text); |
return(roffcall(tree, tok, argvp)); |
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])) { |
|
ROFF_DEBUG("roff: pass non-scoped text: [%s]\n", |
|
&(*bufp)[pos]); |
|
return(ROFF_CONT); |
|
} |
|
|
/* |
/* |
* First consider implicit-end tags, like as follows: |
* If a scope is open, go to the child handler for that macro, |
* .Sh SECTION 1 |
* as it may want to preprocess before doing anything with it. |
* .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. |
|
*/ |
*/ |
|
|
if (tok == tokens[tok].ctx) { |
if (r->last) { |
/* |
t = r->last->tok; |
* First search up to the point where we must close. |
assert(roffs[t].sub); |
* If one doesn't exist, then we can open a new scope. |
ROFF_DEBUG("roff: intercept scoped context: %s\n", |
*/ |
roffs[t].name); |
|
return((*roffs[t].sub) |
for (n = tree->last; n; n = n->parent) { |
(r, t, bufp, szp, ln, pos, pos, offs)); |
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; |
|
return(roff_err(tree, *argv, "`%s' breaks " |
|
"scope of prior`%s'", |
|
toknames[tok], |
|
toknames[n->tok])); |
|
} |
|
|
|
/* |
|
* Create a new scope, as no previous one exists to |
|
* close out. |
|
*/ |
|
|
|
if (NULL == n) |
|
return(roffcall(tree, tok, argvp)); |
|
|
|
/* |
|
* Close out all intermediary scoped blocks, then hang |
|
* the current scope from our predecessor's parent. |
|
*/ |
|
|
|
do { |
|
t = tree->last->tok; |
|
if ( ! roffexit(tree, t)) |
|
return(0); |
|
} while (t != tok); |
|
|
|
return(roffcall(tree, tok, argvp)); |
|
} |
} |
|
|
/* |
/* |
* Now consider explicit-end tags, where we want to close back |
* Lastly, as we've no scope open, try to look up and execute |
* to a specific tag. Example: |
* the new macro. If no macro is found, simply return and let |
* .Bl |
* the compilers handle it. |
* .It Item. |
|
* .El |
|
* In this, the `El' tag closes out the scope of `Bl'. |
|
*/ |
*/ |
|
|
assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
ppos = pos; |
|
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) { |
|
ROFF_DEBUG("roff: pass non-scoped non-macro: [%s]\n", |
|
&(*bufp)[pos]); |
|
return(ROFF_CONT); |
|
} |
|
|
/* LINTED */ |
ROFF_DEBUG("roff: intercept new-scope: %s, [%s]\n", |
for (n = tree->last; n; n = n->parent) |
roffs[t].name, &(*bufp)[pos]); |
if (n->tok != tokens[tok].ctx) { |
assert(roffs[t].proc); |
if (n->tok == tokens[n->tok].ctx) |
return((*roffs[t].proc) |
continue; |
(r, t, bufp, szp, ln, ppos, pos, offs)); |
return(roff_err(tree, *argv, "`%s' breaks " |
|
"scope of prior `%s'", |
|
toknames[tok], |
|
toknames[n->tok])); |
|
} else |
|
break; |
|
|
|
if (NULL == n) |
|
return(roff_err(tree, *argv, "`%s' has no starting " |
|
"tag `%s'", toknames[tok], |
|
toknames[tokens[tok].ctx])); |
|
|
|
/* LINTED */ |
|
do { |
|
t = tree->last->tok; |
|
if ( ! roffexit(tree, t)) |
|
return(0); |
|
} while (t != tokens[tok].ctx); |
|
|
|
return(1); |
|
} |
} |
|
|
|
|
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 *buf) |
* 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) |
{ |
{ |
char token[4]; |
int j; |
int i; |
char mac[5]; |
|
enum rofft t; |
|
|
for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
assert(ROFF_CTL(buf[*pos])); |
token[i] = *buf; |
(*pos)++; |
|
|
if (i == 3) |
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
|
(*pos)++; |
|
|
|
if ('\0' == buf[*pos]) |
return(ROFF_MAX); |
return(ROFF_MAX); |
|
|
token[i] = 0; |
for (j = 0; j < 4; j++, (*pos)++) |
|
if ('\0' == (mac[j] = buf[*pos])) |
|
break; |
|
else if (' ' == buf[*pos] || (j && '\\' == buf[*pos])) |
|
break; |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
if (j == 4 || j < 1) |
|
return(ROFF_MAX); |
|
|
/* LINTED */ |
mac[j] = '\0'; |
for (i = 0; i < ROFF_MAX; i++) |
|
/* LINTED */ |
|
if (0 == strcmp(toknames[i], token)) |
|
return((int)i); |
|
|
|
return(ROFF_MAX); |
if (ROFF_MAX == (t = roff_hash_find(mac))) |
} |
return(t); |
|
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
|
(*pos)++; |
|
|
static int |
return(t); |
roffchecksec(struct rofftree *tree, const char *start, int sec) |
|
{ |
|
int prior; |
|
|
|
switch (sec) { |
|
case(ROFFSec_SYNOP): |
|
if ((prior = ROFFSec_NAME) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_DESC): |
|
if ((prior = ROFFSec_SYNOP) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_RETVAL): |
|
if ((prior = ROFFSec_DESC) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_ENV): |
|
if ((prior = ROFFSec_RETVAL) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_FILES): |
|
if ((prior = ROFFSec_ENV) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_EX): |
|
if ((prior = ROFFSec_FILES) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_DIAG): |
|
if ((prior = ROFFSec_EX) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_ERRS): |
|
if ((prior = ROFFSec_DIAG) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_SEEALSO): |
|
if ((prior = ROFFSec_ERRS) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_STAND): |
|
if ((prior = ROFFSec_SEEALSO) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_HIST): |
|
if ((prior = ROFFSec_STAND) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_AUTH): |
|
if ((prior = ROFFSec_HIST) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_CAVEATS): |
|
if ((prior = ROFFSec_AUTH) & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_BUGS): |
|
if ((prior = ROFFSec_CAVEATS) & tree->asec) |
|
return(1); |
|
break; |
|
default: |
|
return(1); |
|
} |
|
|
|
return(roff_warnp(tree, start, ROFF_Sh, WRN_SECORD)); |
|
} |
} |
|
|
|
|
/* FIXME: move this into literals.c (or similar). */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roffispunct(const char *p) |
roff_cblock(ROFF_ARGS) |
{ |
{ |
|
|
if (0 == *p) |
/* |
return(0); |
* A block-close `..' should only be invoked as a child of an |
if (0 != *(p + 1)) |
* ignore macro, otherwise raise a warning and just ignore it. |
return(0); |
*/ |
|
|
switch (*p) { |
if (NULL == r->last) { |
case('{'): |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
|
return(ROFF_IGN); |
|
} |
|
|
|
switch (r->last->tok) { |
|
case (ROFF_am): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case('.'): |
case (ROFF_ami): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(','): |
case (ROFF_am1): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(';'): |
case (ROFF_de): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(':'): |
case (ROFF_dei): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case('?'): |
case (ROFF_de1): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case('!'): |
case (ROFF_ig): |
/* FALLTHROUGH */ |
|
case('('): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
return(1); |
|
default: |
|
break; |
break; |
|
default: |
|
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
|
return(ROFF_IGN); |
} |
} |
|
|
return(0); |
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 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); |
|
} |
} |
|
|
|
|
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 |
static void |
roffnode_free(struct rofftree *tree) |
roffnode_cleanscope(struct roff *r) |
{ |
{ |
struct roffnode *p; |
|
|
|
assert(tree->last); |
while (r->last) { |
|
if (--r->last->endspan < 0) |
p = tree->last; |
break; |
tree->last = tree->last->parent; |
roffnode_pop(r); |
free(p); |
} |
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffspecial(struct rofftree *tree, int tok, const char *start, |
static enum rofferr |
const int *argc, const char **argv, |
roff_ccond(ROFF_ARGS) |
size_t sz, char **ordp) |
|
{ |
{ |
|
|
switch (tok) { |
if (NULL == r->last) { |
case (ROFF_At): |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
if (0 == sz) |
return(ROFF_ERR); |
break; |
return(ROFF_IGN); |
if (ROFF_ATT_MAX == roff_att(*ordp)) |
} |
break; |
|
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
|
|
|
case (ROFF_Xr): |
|
if (2 == sz) { |
|
assert(ordp[1]); |
|
if (ROFF_MSEC_MAX != roff_msec(ordp[1])) |
|
break; |
|
if ( ! roff_warn(tree, start, "invalid `%s' manual " |
|
"section", toknames[tok])) |
|
return(0); |
|
} |
|
/* FALLTHROUGH */ |
|
|
|
case (ROFF_Sx): |
switch (r->last->tok) { |
/* FALLTHROUGH*/ |
case (ROFF_el): |
case (ROFF_Fn): |
|
if (0 != sz) |
|
break; |
|
return(roff_errp(tree, start, tok, ERR_ARGGE1)); |
|
|
|
case (ROFF_Nm): |
|
if (0 == sz) { |
|
if (0 != tree->name[0]) { |
|
ordp[0] = tree->name; |
|
ordp[1] = NULL; |
|
break; |
|
} |
|
return(roff_err(tree, start, "`Nm' not set")); |
|
} else if ( ! roffsetname(tree, ordp)) |
|
return(0); |
|
break; |
|
|
|
case (ROFF_Rv): |
|
/* FALLTHROUGH*/ |
|
case (ROFF_Ex): |
|
if (1 == sz) |
|
break; |
|
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
|
|
|
case (ROFF_Sm): |
|
if (1 != sz) |
|
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
|
else if (0 == strcmp(ordp[0], "on") || |
|
0 == strcmp(ordp[0], "off")) |
|
break; |
|
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
|
|
|
case (ROFF_Ud): |
|
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_Ux): |
case (ROFF_ie): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_Bt): |
case (ROFF_if): |
if (0 == sz) |
|
break; |
|
return(roff_errp(tree, start, tok, ERR_ARGEQ0)); |
|
default: |
|
break; |
break; |
|
default: |
|
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
|
return(ROFF_IGN); |
} |
} |
|
|
return((*tree->cb.roffspecial)(tree->arg, tok, tree->cur, |
if (r->last->endspan > -1) { |
argc, argv, (const char **)ordp)); |
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 |
roffnode_pop(r); |
roffexit(struct rofftree *tree, int tok) |
roffnode_cleanscope(r); |
{ |
return(ROFF_IGN); |
|
|
assert(tokens[tok].cb); |
|
return((*tokens[tok].cb)(tok, tree, NULL, ROFF_EXIT)); |
|
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffcall(struct rofftree *tree, int tok, char **argv) |
static enum rofferr |
|
roff_block(ROFF_ARGS) |
{ |
{ |
int i; |
int sv; |
enum roffmsec c; |
size_t sz; |
|
|
if (NULL == tokens[tok].cb) |
if (ROFF_ig != tok && '\0' == (*bufp)[pos]) { |
return(roff_errp(tree, *argv, tok, ERR_NOTSUP)); |
if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
return(ROFF_IGN); |
i = 0; |
} else if (ROFF_ig != tok) { |
while (ROFF_MSEC_MAX != |
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
(c = tokens[tok].sections[i++])) |
pos++; |
if (c == tree->section) |
while (' ' == (*bufp)[pos]) |
break; |
pos++; |
if (ROFF_MSEC_MAX == c) { |
|
if ( ! roff_warn(tree, *argv, "`%s' is not a valid " |
|
"macro in this manual section", |
|
toknames[tok])) |
|
return(0); |
|
} |
|
} |
} |
|
|
return((*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER)); |
if ( ! roffnode_push(r, tok, ln, ppos)) |
} |
return(ROFF_ERR); |
|
|
|
if ('\0' == (*bufp)[pos]) |
|
return(ROFF_IGN); |
|
|
static int |
sv = pos; |
roffnextopt(const struct rofftree *tree, int tok, |
while ((*bufp)[pos] && ' ' != (*bufp)[pos] && |
char ***in, char **val) |
'\t' != (*bufp)[pos]) |
{ |
pos++; |
char *arg, **argv; |
|
int v; |
|
|
|
*val = NULL; |
/* |
argv = *in; |
* Note: groff does NOT like escape characters in the input. |
assert(argv); |
* Instead of detecting this, we're just going to let it fly and |
|
* to hell with it. |
|
*/ |
|
|
if (NULL == (arg = *argv)) |
assert(pos > sv); |
return(-1); |
sz = (size_t)(pos - sv); |
if ('-' != *arg) |
|
return(-1); |
|
|
|
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
if (1 == sz && '.' == (*bufp)[sv]) |
if ( ! roff_warn(tree, arg, "argument-like parameter `%s' to " |
return(ROFF_IGN); |
"`%s'", arg, toknames[tok])) |
|
return(ROFF_ARGMAX); |
|
return(-1); |
|
} |
|
|
|
if ( ! roffargok(tok, v)) { |
|
if ( ! roff_warn(tree, arg, "invalid argument parameter `%s' to " |
|
"`%s'", tokargnames[v], toknames[tok])) |
|
return(ROFF_ARGMAX); |
|
return(-1); |
|
} |
|
|
|
if ( ! (ROFF_VALUE & tokenargs[v])) |
|
return(v); |
|
|
|
*in = ++argv; |
r->last->end = malloc(sz + 1); |
|
|
if (NULL == *argv) { |
if (NULL == r->last->end) { |
(void)roff_err(tree, arg, "empty value of `%s' for `%s'", |
(*r->msg)(MANDOCERR_MEM, r->data, ln, pos, NULL); |
tokargnames[v], toknames[tok]); |
return(ROFF_ERR); |
return(ROFF_ARGMAX); |
|
} |
} |
|
|
return(v); |
memcpy(r->last->end, *bufp + sv, sz); |
} |
r->last->end[(int)sz] = '\0'; |
|
|
|
if ((*bufp)[pos]) |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
|
return(ROFF_ERR); |
|
|
static int |
return(ROFF_IGN); |
roffpurgepunct(struct rofftree *tree, char **argv) |
|
{ |
|
int i; |
|
|
|
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) |
|
{ |
|
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; |
|
} |
|
|
|
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 |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_block_sub(ROFF_ARGS) |
{ |
{ |
time_t t; |
enum rofft t; |
char *p, buf[32]; |
int i, j; |
size_t sz; |
|
|
|
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) |
|
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
|
if (ROFF_PRELUDE_Dt & tree->state) |
|
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
|
|
|
assert(NULL == tree->last); |
|
|
|
argv++; |
|
|
|
/* |
/* |
* This is a bit complex because there are many forms the date |
* First check whether a custom macro exists at this level. If |
* can be in: it can be simply $Mdocdate$, $Mdocdate <date>$, |
* it does, then check against it. This is some of groff's |
* or a raw date. Process accordingly. |
* 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 (0 == strcmp(*argv, "$Mdocdate$")) { |
if (r->last->end) { |
t = time(NULL); |
i = pos + 1; |
if (NULL == localtime_r(&t, &tree->tm)) |
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
err(1, "localtime_r"); |
i++; |
tree->state |= ROFF_PRELUDE_Dd; |
|
return(1); |
|
} |
|
|
|
buf[0] = 0; |
for (j = 0; r->last->end[j]; j++, i++) |
p = *argv; |
if ((*bufp)[i] != r->last->end[j]) |
sz = sizeof(buf); |
break; |
|
|
if (0 != strcmp(*argv, "$Mdocdate:")) { |
if ('\0' == r->last->end[j] && |
while (*argv) { |
('\0' == (*bufp)[i] || |
if (strlcat(buf, *argv++, sz) < sz) |
' ' == (*bufp)[i] || |
continue; |
'\t' == (*bufp)[i])) { |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
|
|
if (ROFF_MAX != roff_parse(*bufp, &pos)) |
|
return(ROFF_RERUN); |
|
return(ROFF_IGN); |
} |
} |
if (strptime(buf, "%b%d,%Y", &tree->tm)) { |
|
tree->state |= ROFF_PRELUDE_Dd; |
|
return(1); |
|
} |
|
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
} |
} |
|
|
argv++; |
/* |
|
* If we have no custom end-query or lookup failed, then try |
|
* pulling it out of the hashtable. |
|
*/ |
|
|
while (*argv && **argv != '$') { |
ppos = pos; |
if (strlcat(buf, *argv++, sz) >= sz) |
t = roff_parse(*bufp, &pos); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
if (strlcat(buf, " ", sz) >= sz) |
|
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
} |
|
|
|
if (NULL == *argv) |
/* If we're not a comment-end, then throw it away. */ |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
if (ROFF_cblock != t) |
if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) |
return(ROFF_IGN); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
|
|
tree->state |= ROFF_PRELUDE_Dd; |
assert(roffs[t].proc); |
return(1); |
return((*roffs[t].proc)(r, t, bufp, |
|
szp, ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dt(ROFFCALL_ARGS) |
roff_block_text(ROFF_ARGS) |
{ |
{ |
size_t sz; |
|
|
|
if (ROFF_BODY & tree->state) { |
return(ROFF_IGN); |
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)) |
/* ARGSUSED */ |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
static enum rofferr |
if (ROFF_PRELUDE_Dt & tree->state) |
roff_cond_sub(ROFF_ARGS) |
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
{ |
|
enum rofft t; |
|
enum roffrule rr; |
|
struct roffnode *l; |
|
|
argv++; |
ppos = pos; |
sz = sizeof(tree->title); |
rr = r->last->rule; |
|
|
if (NULL == *argv) |
/* |
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
* Clean out scope. If we've closed ourselves, then don't |
if (strlcpy(tree->title, *argv, sz) >= sz) |
* continue. |
return(roff_errp(tree, *argv, tok, ERR_ARGLEN)); |
*/ |
|
|
argv++; |
l = r->last; |
if (NULL == *argv) |
roffnode_cleanscope(r); |
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
|
|
|
if (ROFF_MSEC_MAX == (tree->section = roff_msec(*argv))) |
if (l != r->last) |
return(roff_errp(tree, *argv, tok, ERR_BADARG)); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
argv++; |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
sz = sizeof(tree->volume); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
if (NULL == *argv) { |
/* |
tree->volume[0] = 0; |
* A denied conditional must evaluate its children if and only |
} else if (strlcpy(tree->volume, *argv, sz) >= sz) |
* if they're either structurally required (such as loops and |
return(roff_errp(tree, *argv, tok, ERR_ARGLEN)); |
* conditionals) or a closing macro. |
|
*/ |
|
if (ROFFRULE_DENY == rr) |
|
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
|
if (ROFF_ccond != t) |
|
return(ROFF_IGN); |
|
|
assert(NULL == tree->last); |
assert(roffs[t].proc); |
tree->state |= ROFF_PRELUDE_Dt; |
return((*roffs[t].proc) |
|
(r, t, bufp, szp, ln, ppos, pos, offs)); |
return(1); |
|
} |
} |
|
|
|
|
static int |
|
roffsetname(struct rofftree *tree, char **ordp) |
|
{ |
|
size_t sz; |
|
|
|
assert(*ordp); |
|
|
|
/* FIXME: not all sections can set this. */ |
|
|
|
if (NULL != *(ordp + 1)) |
|
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGMNY)); |
|
|
|
sz = sizeof(tree->name); |
|
if (strlcpy(tree->name, *ordp, sz) >= sz) |
|
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGLEN)); |
|
|
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Ns(ROFFCALL_ARGS) |
roff_cond_text(ROFF_ARGS) |
{ |
{ |
int j, c, first; |
char *ep, *st; |
char *morep[1]; |
enum roffrule rr; |
|
|
first = (*argv++ == tree->cur); |
rr = r->last->rule; |
morep[0] = NULL; |
|
|
|
if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep)) |
/* |
return(0); |
* We display the value of the text if out current evaluation |
|
* scope permits us to do so. |
|
*/ |
|
|
while (*argv) { |
st = &(*bufp)[pos]; |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (NULL == (ep = strstr(st, "\\}"))) { |
if ( ! roffcall(tree, c, argv)) |
roffnode_cleanscope(r); |
return(0); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
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) |
if (ep == st || (ep > st && '\\' != *(ep - 1))) |
return(1); |
roffnode_pop(r); |
|
|
return(roffpurgepunct(tree, argv)); |
roffnode_cleanscope(r); |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
static enum roffrule |
static int |
roff_evalcond(const char *v, int *pos) |
roff_Os(ROFFCALL_ARGS) |
|
{ |
{ |
char *p; |
|
size_t sz; |
|
|
|
if (ROFF_BODY & tree->state) { |
switch (v[*pos]) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
case ('n'): |
assert(ROFF_PRELUDE_Os & tree->state); |
(*pos)++; |
return(roff_text(tok, tree, argv, type)); |
return(ROFFRULE_ALLOW); |
|
case ('e'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
|
/* FALLTHROUGH */ |
|
case ('t'): |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
|
default: |
|
break; |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
while (v[*pos] && ' ' != v[*pos]) |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
(*pos)++; |
! (ROFF_PRELUDE_Dd & tree->state)) |
return(ROFFRULE_DENY); |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
|
|
|
tree->os[0] = 0; |
|
|
|
p = *++argv; |
|
sz = sizeof(tree->os); |
|
|
|
while (*argv) |
|
if (strlcat(tree->os, *argv++, sz) >= sz) |
|
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
|
|
|
if (0 == tree->os[0]) |
|
if (strlcpy(tree->os, "LOCAL", sz) >= sz) |
|
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
|
|
|
tree->state |= ROFF_PRELUDE_Os; |
|
tree->state &= ~ROFF_PRELUDE; |
|
tree->state |= ROFF_BODY; |
|
|
|
assert(ROFF_MSEC_MAX != tree->section); |
|
assert(0 != tree->title[0]); |
|
assert(0 != tree->os[0]); |
|
|
|
assert(NULL == tree->last); |
|
|
|
return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
|
tree->os, tree->title, |
|
tree->section, tree->volume)); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_layout(ROFFCALL_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXLINEARG]; |
int sv; |
char *argvp[ROFF_MAXLINEARG], *p; |
enum roffrule rule; |
|
|
/* |
/* Stack overflow! */ |
* The roff_layout function is for multi-line macros. A layout |
|
* has a start and end point, which is either declared |
|
* explicitly or implicitly. An explicit start and end is |
|
* embodied by `.Bl' and `.El', with the former being the start |
|
* and the latter being an end. The `.Sh' and `.Ss' tags, on |
|
* the other hand, are implicit. The scope of a layout is the |
|
* space between start and end. Explicit layouts may not close |
|
* out implicit ones and vice versa; implicit layouts may close |
|
* out other implicit layouts. |
|
*/ |
|
|
|
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) { |
|
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
|
return(ROFF_ERR); |
|
} |
|
|
if (ROFF_PRELUDE & tree->state) |
/* First, evaluate the conditional. */ |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
|
|
|
if (ROFF_EXIT == type) { |
if (ROFF_el == tok) { |
roffnode_free(tree); |
/* |
if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
* An `.el' will get the value of the current rstack |
return(0); |
* entry set in prior `ie' calls or defaults to DENY. |
return((*tree->cb.roffblkout)(tree->arg, tok)); |
*/ |
} |
if (r->rstackpos < 0) |
|
rule = ROFFRULE_DENY; |
|
else |
|
rule = r->rstack[r->rstackpos]; |
|
} else |
|
rule = roff_evalcond(*bufp, &pos); |
|
|
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
sv = pos; |
|
|
p = *argv++; |
while (' ' == (*bufp)[pos]) |
|
pos++; |
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
|
return(0); |
|
if (NULL == roffnode_new(tok, tree)) |
|
return(0); |
|
|
|
/* |
/* |
* Layouts have two parts: the layout body and header. The |
* Roff is weird. If we have just white-space after the |
* layout header is the trailing text of the line macro, while |
* conditional, it's considered the BODY and we exit without |
* the layout body is everything following until termination. |
* really doing anything. Warn about this. It's probably |
* Example: |
* wrong. |
* |
|
* .It Fl f ) ; |
|
* Bar. |
|
* |
|
* ...Produces... |
|
* |
|
* <block> |
|
* <head> |
|
* <!Fl f!> ; |
|
* </head> |
|
* |
|
* <body> |
|
* Bar. |
|
* </body> |
|
* </block> |
|
*/ |
*/ |
|
|
if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, |
if ('\0' == (*bufp)[pos] && sv != pos) { |
(const char **)argvp)) |
if ((*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
return(0); |
return(ROFF_IGN); |
|
return(ROFF_ERR); |
/* +++ Begin run macro-specific hooks over argv. */ |
|
|
|
switch (tok) { |
|
case (ROFF_Sh): |
|
if (NULL == *argv) { |
|
argv--; |
|
return(roff_errp(tree, *argv, tok, ERR_ARGGE1)); |
|
} |
|
|
|
tree->csec = roff_sec((const char **)argv); |
|
|
|
if ( ! (ROFFSec_OTHER & tree->csec) && |
|
tree->asec & tree->csec) |
|
if ( ! roff_warn(tree, *argv, "section repeated")) |
|
return(0); |
|
|
|
if (0 == tree->asec && ! (ROFFSec_NAME & tree->csec)) |
|
return(roff_err(tree, *argv, "`NAME' section " |
|
"must be first")); |
|
if ( ! roffchecksec(tree, *argv, tree->csec)) |
|
return(0); |
|
|
|
tree->asec |= tree->csec; |
|
break; |
|
default: |
|
break; |
|
} |
} |
|
|
/* --- End run macro-specific hooks over argv. */ |
if ( ! roffnode_push(r, tok, ln, ppos)) |
|
return(ROFF_ERR); |
|
|
if (NULL == *argv) |
r->last->rule = rule; |
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
|
|
|
if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, |
ROFF_DEBUG("roff: cond: %s -> %s\n", roffs[tok].name, |
(const char **)argvp)) |
ROFFRULE_ALLOW == rule ? "allow" : "deny"); |
return(0); |
|
|
|
/* |
if (ROFF_ie == tok) { |
* If there are no parsable parts, then write remaining tokens |
/* |
* into the layout header and exit. |
* An if-else will put the NEGATION of the current |
*/ |
* evaluated conditional into the stack. |
|
*/ |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
r->rstackpos++; |
i = 0; |
if (ROFFRULE_DENY == r->last->rule) |
while (*argv) |
r->rstack[r->rstackpos] = ROFFRULE_ALLOW; |
if ( ! roffdata(tree, i++, *argv++)) |
else |
return(0); |
r->rstack[r->rstackpos] = ROFFRULE_DENY; |
|
|
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
return(0); |
|
return((*tree->cb.roffblkbodyin)(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
|
} |
} |
|
|
/* |
/* If the parent has false as its rule, then so do we. */ |
* Parsable elements may be in the header (or be the header, for |
|
* that matter). Follow the regular parsing rules for these. |
|
*/ |
|
|
|
i = 0; |
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) { |
while (*argv) { |
r->last->rule = ROFFRULE_DENY; |
if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
ROFF_DEBUG("roff: cond override: %s -> deny\n", |
assert(tree->arg); |
roffs[tok].name); |
if ( ! roffdata(tree, i++, *argv++)) |
|
return(0); |
|
continue; |
|
} |
|
if ( ! roffcall(tree, c, argv)) |
|
return(0); |
|
break; |
|
} |
} |
|
|
/* |
|
* If there's trailing punctuation in the header, then write it |
|
* out now. Here we mimic the behaviour of a line-dominant text |
|
* macro. |
|
*/ |
|
|
|
if (NULL == *argv) { |
|
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
return(0); |
|
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
|
} |
|
|
|
/* |
/* |
* Expensive. Scan to the end of line then work backwards until |
* Determine scope. If we're invoked with "\{" trailing the |
* a token isn't punctuation. |
* conditional, then we're in a multiline scope. Else our scope |
|
* expires on the next line. |
*/ |
*/ |
|
|
if ( ! roffpurgepunct(tree, argv)) |
r->last->endspan = 1; |
return(0); |
|
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
return(0); |
|
return((*tree->cb.roffblkbodyin)(tree->arg, |
|
tok, argcp, (const char **)argvp)); |
|
} |
|
|
|
|
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); |
|
|
/* ARGSUSED */ |
|
static int |
|
roff_ordered(ROFFCALL_ARGS) |
|
{ |
|
int i, first, c, argcp[ROFF_MAXLINEARG]; |
|
char *ordp[ROFF_MAXLINEARG], *p, |
|
*argvp[ROFF_MAXLINEARG]; |
|
|
|
/* |
/* |
* Ordered macros pass their arguments directly to handlers, |
* If there are no arguments on the line, the next-line scope is |
* instead of considering it free-form text. Thus, the |
* assumed. |
* following macro looks as follows: |
|
* |
|
* .Xr foo 1 ) , |
|
* |
|
* .Xr arg1 arg2 punctuation |
|
*/ |
*/ |
|
|
if (ROFF_PRELUDE & tree->state) |
if ('\0' == (*bufp)[pos]) |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
return(ROFF_IGN); |
|
|
first = (*argv == tree->cur); |
/* Otherwise re-run the roff parser after recalculating. */ |
p = *argv++; |
|
ordp[0] = NULL; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
*offs = pos; |
return(0); |
return(ROFF_RERUN); |
|
|
if (NULL == *argv) |
|
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 ( ! roffspecial(tree, tok, p, argcp, |
|
(const char **)argvp, |
|
(size_t)i, ordp)) |
|
return(0); |
|
|
|
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)); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_text(ROFFCALL_ARGS) |
roff_line(ROFF_ARGS) |
{ |
{ |
int i, j, first, c, argcp[ROFF_MAXLINEARG]; |
|
char *argvp[ROFF_MAXLINEARG]; |
|
|
|
/* |
return(ROFF_IGN); |
* Text macros are similar to special tokens, except that |
|
* arguments are instead flushed as pure data: we're only |
|
* concerned with the macro and its arguments. Example: |
|
* |
|
* .Fl v W f ; |
|
* |
|
* ...Produces... |
|
* |
|
* <fl> v W f </fl> ; |
|
*/ |
|
|
|
if (ROFF_PRELUDE & tree->state) |
|
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
|
|
|
first = (*argv == tree->cur); |
|
argv++; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
|
return(0); |
|
if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, |
|
(const char **)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, |
|
(const char **)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) |
|
{ |
|
|
|
return(roff_errp(tree, *argv, tok, ERR_DEPREC)); |
|
} |
|
|
|
|
|
static int |
|
roff_warnp(const struct rofftree *tree, const char *pos, |
|
int tok, enum rofferr type) |
|
{ |
|
char *p; |
|
|
|
switch (type) { |
|
case (WRN_SECORD): |
|
p = "section at `%s' out of order"; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
|
|
return(roff_warn(tree, pos, p, toknames[tok])); |
|
} |
|
|
|
|
|
static int |
|
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); |
|
|
|
return((*tree->cb.roffmsg)(tree->arg, |
|
ROFF_WARN, tree->cur, pos, buf)); |
|
} |
|
|
|
|
|
static int |
|
roff_errp(const struct rofftree *tree, const char *pos, |
|
int tok, enum rofferr type) |
|
{ |
|
char *p; |
|
|
|
switch (type) { |
|
case (ERR_ARGEQ1): |
|
p = "`%s' expects exactly one argument"; |
|
break; |
|
case (ERR_ARGEQ0): |
|
p = "`%s' expects exactly zero arguments"; |
|
break; |
|
case (ERR_ARGGE1): |
|
p = "`%s' expects one or more arguments"; |
|
break; |
|
case (ERR_ARGGE2): |
|
p = "`%s' expects two or more arguments"; |
|
break; |
|
case (ERR_BADARG): |
|
p = "invalid argument for `%s'"; |
|
break; |
|
case (ERR_NOTSUP): |
|
p = "macro `%s' is not supported"; |
|
break; |
|
case(ERR_PR_OOO): |
|
p = "prelude macro `%s' is out of order"; |
|
break; |
|
case(ERR_PR_REP): |
|
p = "prelude macro `%s' repeated"; |
|
break; |
|
case(ERR_ARGLEN): |
|
p = "macro argument for `%s' is too long"; |
|
break; |
|
case(ERR_DEPREC): |
|
p = "macro `%s' is deprecated"; |
|
break; |
|
case(ERR_NOT_PR): |
|
p = "macro `%s' disallowed in prelude"; |
|
break; |
|
case(ERR_ARGMNY): |
|
p = "too many arguments for macro `%s'"; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
|
|
return(roff_err(tree, pos, p, toknames[tok])); |
|
} |
|
|
|
|
|
static int |
|
roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...) |
|
{ |
|
va_list ap; |
|
char buf[128]; |
|
|
|
va_start(ap, fmt); |
|
if (-1 == vsnprintf(buf, sizeof(buf), fmt, ap)) |
|
err(1, "vsnprintf"); |
|
va_end(ap); |
|
|
|
return((*tree->cb.roffmsg) |
|
(tree->arg, ROFF_ERROR, tree->cur, pos, buf)); |
|
} |
|
|
|