version 1.53, 2008/12/08 20:32:49 |
version 1.57, 2008/12/10 00:52:46 |
|
|
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <time.h> |
|
|
#include "libmdocml.h" |
|
#include "private.h" |
#include "private.h" |
#include "roff.h" |
#include "roff.h" |
|
|
|
|
/* TODO: warn about empty lists. */ |
/* TODO: warn about empty lists. */ |
/* TODO: (warn) some sections need specific elements. */ |
/* TODO: (warn) some sections need specific elements. */ |
/* TODO: (warn) NAME section has particular order. */ |
/* TODO: (warn) NAME section has particular order. */ |
/* TODO: unify empty-content tags a la <br />. */ |
|
/* TODO: macros with a set number of arguments? */ |
/* TODO: macros with a set number of arguments? */ |
/* TODO: validate Dt macro arguments. */ |
/* TODO: validate Dt macro arguments. */ |
/* FIXME: Bl -diag supposed to ignore callable children. */ |
/* FIXME: Bl -diag supposed to ignore callable children. */ |
/* FIXME: Nm has newline when used in NAME section. */ |
|
|
|
struct roffnode { |
struct roffnode { |
int tok; /* Token id. */ |
int tok; /* Token id. */ |
struct roffnode *parent; /* Parent (or NULL). */ |
struct roffnode *parent; /* Parent (or NULL). */ |
}; |
}; |
|
|
|
enum rofferr { |
|
ERR_ARGEQ1, /* Macro requires arg == 1. */ |
|
ERR_ARGEQ0, /* Macro requires arg == 0. */ |
|
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 rofftree { |
struct roffnode *last; /* Last parsed node. */ |
struct roffnode *last; /* Last parsed node. */ |
char *cur; /* Line start. */ |
char *cur; /* Line start. */ |
Line 59 struct rofftree { |
|
Line 72 struct rofftree { |
|
enum roffmsec section; |
enum roffmsec section; |
char volume[64]; /* `Dt' results. */ |
char volume[64]; /* `Dt' results. */ |
int state; |
int state; |
#define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ |
#define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ /* FIXME: put into asec. */ |
#define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
#define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
#define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
#define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
#define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
#define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
Line 72 struct rofftree { |
|
Line 85 struct rofftree { |
|
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
static struct roffnode *roffnode_new(int, struct rofftree *); |
static void roffnode_free(struct rofftree *); |
static void roffnode_free(struct rofftree *); |
static void roff_warn(const struct rofftree *, |
static int roff_warn(const struct rofftree *, |
const char *, char *, ...); |
const char *, char *, ...); |
static void roff_err(const struct rofftree *, |
static int roff_warnp(const struct rofftree *, |
|
const char *, int, enum rofferr); |
|
static int roff_err(const struct rofftree *, |
const char *, char *, ...); |
const char *, char *, ...); |
|
static int roff_errp(const struct rofftree *, |
|
const char *, int, enum rofferr); |
static int roffpurgepunct(struct rofftree *, char **); |
static int roffpurgepunct(struct rofftree *, char **); |
static int roffscan(int, const int *); |
static int roffscan(int, const int *); |
static int rofffindtok(const char *); |
static int rofffindtok(const char *); |
static int rofffindarg(const char *); |
static int rofffindarg(const char *); |
static int rofffindcallable(const char *); |
static int rofffindcallable(const char *); |
static int roffismsec(const char *); |
|
static int roffissec(const char **); |
|
static int roffispunct(const char *); |
static int roffispunct(const char *); |
static int roffisatt(const char *); |
|
static int roffchecksec(struct rofftree *, |
static int roffchecksec(struct rofftree *, |
const char *, int); |
const char *, int); |
static int roffargs(const struct rofftree *, |
static int roffargs(const struct rofftree *, |
Line 127 roff_free(struct rofftree *tree, int flush) |
|
Line 141 roff_free(struct rofftree *tree, int flush) |
|
error = 1; |
error = 1; |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) { |
roff_err(tree, NULL, "prelude never finished"); |
(void)roff_err(tree, NULL, "prelude never finished"); |
goto end; |
goto end; |
} else if ( ! (ROFFSec_NAME & tree->asec)) { |
} else if ( ! (ROFFSec_NAME & tree->asec)) { |
roff_err(tree, NULL, "missing `NAME' section"); |
(void)roff_err(tree, NULL, "missing `NAME' section"); |
goto end; |
goto end; |
} else if ( ! (ROFFSec_NMASK & tree->asec)) |
} else if ( ! (ROFFSec_NMASK & tree->asec)) |
roff_warn(tree, NULL, "missing suggested `NAME', " |
(void)roff_warn(tree, NULL, "missing suggested `NAME', " |
"`SYNOPSIS', `DESCRIPTION' sections"); |
"`SYNOPSIS', `DESCRIPTION' sections"); |
|
|
for (n = tree->last; n; n = n->parent) { |
for (n = tree->last; n; n = n->parent) { |
if (0 != tokens[n->tok].ctx) |
if (0 != tokens[n->tok].ctx) |
continue; |
continue; |
roff_err(tree, NULL, "closing explicit scope `%s'", |
(void)roff_err(tree, NULL, "closing explicit scope " |
toknames[n->tok]); |
"`%s'", toknames[n->tok]); |
goto end; |
goto end; |
} |
} |
|
|
Line 194 roff_engine(struct rofftree *tree, char *buf) |
|
Line 208 roff_engine(struct rofftree *tree, char *buf) |
|
tree->cur = buf; |
tree->cur = buf; |
assert(buf); |
assert(buf); |
|
|
if (0 == *buf) { |
if (0 == *buf) |
roff_err(tree, buf, "blank line"); |
return(roff_err(tree, buf, "blank line")); |
return(0); |
else if ('.' != *buf) |
} else if ('.' != *buf) |
|
return(textparse(tree, buf)); |
return(textparse(tree, buf)); |
|
|
return(roffparse(tree, buf)); |
return(roffparse(tree, buf)); |
Line 211 textparse(struct rofftree *tree, char *buf) |
|
Line 224 textparse(struct rofftree *tree, char *buf) |
|
|
|
/* TODO: literal parsing. */ |
/* TODO: literal parsing. */ |
|
|
if ( ! (ROFF_BODY & tree->state)) { |
if ( ! (ROFF_BODY & tree->state)) |
roff_err(tree, buf, "data not in body"); |
return(roff_err(tree, buf, "data not in body")); |
return(0); |
|
} |
|
|
|
/* LINTED */ |
/* LINTED */ |
while (*buf) { |
while (*buf) { |
Line 270 roffargs(const struct rofftree *tree, |
|
Line 281 roffargs(const struct rofftree *tree, |
|
argv[i] = ++buf; |
argv[i] = ++buf; |
while (*buf && '\"' != *buf) |
while (*buf && '\"' != *buf) |
buf++; |
buf++; |
if (0 == *buf) { |
if (0 == *buf) |
roff_err(tree, argv[i], "unclosed " |
return(roff_err(tree, argv[i], |
"quote in argument " |
"unclosed quote in arg list")); |
"list for `%s'", |
|
toknames[tok]); |
|
return(0); |
|
} |
|
} else { |
} else { |
argv[i] = buf++; |
argv[i] = buf++; |
while (*buf) { |
while (*buf) { |
Line 299 roffargs(const struct rofftree *tree, |
|
Line 306 roffargs(const struct rofftree *tree, |
|
} |
} |
|
|
assert(i > 0); |
assert(i > 0); |
if (ROFF_MAXLINEARG == i && *buf) { |
if (ROFF_MAXLINEARG == i && *buf) |
roff_err(tree, p, "too many arguments for `%s'", toknames |
return(roff_err(tree, p, "too many args")); |
[tok]); |
|
return(0); |
|
} |
|
|
|
argv[i] = NULL; |
argv[i] = NULL; |
return(1); |
return(1); |
Line 337 roffparse(struct rofftree *tree, char *buf) |
|
Line 341 roffparse(struct rofftree *tree, char *buf) |
|
if (0 == strncmp(buf, ".\\\"", 3)) |
if (0 == strncmp(buf, ".\\\"", 3)) |
return(1); |
return(1); |
|
|
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) |
roff_err(tree, buf, "bogus line macro"); |
return(roff_err(tree, buf, "bogus line macro")); |
|
else if ( ! roffargs(tree, tok, buf, argv)) |
return(0); |
return(0); |
} else if ( ! roffargs(tree, tok, buf, argv)) |
|
return(0); |
|
|
|
argvp = (char **)argv; |
argvp = (char **)argv; |
|
|
Line 362 roffparse(struct rofftree *tree, char *buf) |
|
Line 365 roffparse(struct rofftree *tree, char *buf) |
|
*/ |
*/ |
|
|
if (tree->last && ! roffscan |
if (tree->last && ! roffscan |
(tree->last->tok, tokens[tok].parents)) { |
(tree->last->tok, tokens[tok].parents)) |
roff_err(tree, *argvp, "`%s' has invalid parent `%s'", |
return(roff_err(tree, *argvp, "`%s' has invalid " |
toknames[tok], |
"parent `%s'", toknames[tok], |
toknames[tree->last->tok]); |
toknames[tree->last->tok])); |
return(0); |
|
} |
|
|
|
if (tree->last && ! roffscan |
if (tree->last && ! roffscan |
(tok, tokens[tree->last->tok].children)) { |
(tok, tokens[tree->last->tok].children)) |
roff_err(tree, *argvp, "`%s' is invalid child of `%s'", |
return(roff_err(tree, *argvp, "`%s' has invalid " |
toknames[tok], |
"child `%s'", toknames[tok], |
toknames[tree->last->tok]); |
toknames[tree->last->tok])); |
return(0); |
|
} |
|
|
|
/* |
/* |
* Branch if we're not a layout token. |
* Branch if we're not a layout token. |
Line 415 roffparse(struct rofftree *tree, char *buf) |
|
Line 414 roffparse(struct rofftree *tree, char *buf) |
|
} |
} |
if (tokens[n->tok].ctx == n->tok) |
if (tokens[n->tok].ctx == n->tok) |
continue; |
continue; |
roff_err(tree, *argv, "`%s' breaks `%s' scope", |
return(roff_err(tree, *argv, "`%s' breaks " |
toknames[tok], toknames[n->tok]); |
"scope of prior`%s'", |
return(0); |
toknames[tok], |
|
toknames[n->tok])); |
} |
} |
|
|
/* |
/* |
Line 458 roffparse(struct rofftree *tree, char *buf) |
|
Line 458 roffparse(struct rofftree *tree, char *buf) |
|
if (n->tok != tokens[tok].ctx) { |
if (n->tok != tokens[tok].ctx) { |
if (n->tok == tokens[n->tok].ctx) |
if (n->tok == tokens[n->tok].ctx) |
continue; |
continue; |
roff_err(tree, *argv, "`%s' breaks `%s' scope", |
return(roff_err(tree, *argv, "`%s' breaks " |
toknames[tok], toknames[n->tok]); |
"scope of prior `%s'", |
return(0); |
toknames[tok], |
|
toknames[n->tok])); |
} else |
} else |
break; |
break; |
|
|
|
if (NULL == n) |
|
return(roff_err(tree, *argv, "`%s' has no starting " |
|
"tag `%s'", toknames[tok], |
|
toknames[tokens[tok].ctx])); |
|
|
if (NULL == n) { |
|
roff_err(tree, *argv, "`%s' has no starting tag `%s'", |
|
toknames[tok], |
|
toknames[tokens[tok].ctx]); |
|
return(0); |
|
} |
|
|
|
/* LINTED */ |
/* LINTED */ |
do { |
do { |
t = tree->last->tok; |
t = tree->last->tok; |
Line 592 roffchecksec(struct rofftree *tree, const char *start, |
|
Line 590 roffchecksec(struct rofftree *tree, const char *start, |
|
return(1); |
return(1); |
} |
} |
|
|
roff_warn(tree, start, "section violates conventional order"); |
return(roff_warnp(tree, start, ROFF_Sh, WRN_SECORD)); |
return(1); |
|
} |
} |
|
|
|
|
|
/* FIXME: move this into literals.c (or similar). */ |
static int |
static int |
roffissec(const char **p) |
|
{ |
|
|
|
assert(*p); |
|
if (NULL != *(p + 1)) { |
|
if (NULL != *(p + 2)) |
|
return(ROFFSec_OTHER); |
|
if (0 == strcmp(*p, "RETURN") && |
|
0 == strcmp(*(p + 1), "VALUES")) |
|
return(ROFFSec_RETVAL); |
|
if (0 == strcmp(*p, "SEE") && |
|
0 == strcmp(*(p + 1), "ALSO")) |
|
return(ROFFSec_SEEALSO); |
|
return(ROFFSec_OTHER); |
|
} |
|
|
|
if (0 == strcmp(*p, "NAME")) |
|
return(ROFFSec_NAME); |
|
else if (0 == strcmp(*p, "SYNOPSIS")) |
|
return(ROFFSec_SYNOP); |
|
else if (0 == strcmp(*p, "DESCRIPTION")) |
|
return(ROFFSec_DESC); |
|
else if (0 == strcmp(*p, "ENVIRONMENT")) |
|
return(ROFFSec_ENV); |
|
else if (0 == strcmp(*p, "FILES")) |
|
return(ROFFSec_FILES); |
|
else if (0 == strcmp(*p, "EXAMPLES")) |
|
return(ROFFSec_EX); |
|
else if (0 == strcmp(*p, "DIAGNOSTICS")) |
|
return(ROFFSec_DIAG); |
|
else if (0 == strcmp(*p, "ERRORS")) |
|
return(ROFFSec_ERRS); |
|
else if (0 == strcmp(*p, "STANDARDS")) |
|
return(ROFFSec_STAND); |
|
else if (0 == strcmp(*p, "HISTORY")) |
|
return(ROFFSec_HIST); |
|
else if (0 == strcmp(*p, "AUTHORS")) |
|
return(ROFFSec_AUTH); |
|
else if (0 == strcmp(*p, "CAVEATS")) |
|
return(ROFFSec_CAVEATS); |
|
else if (0 == strcmp(*p, "BUGS")) |
|
return(ROFFSec_BUGS); |
|
|
|
return(ROFFSec_OTHER); |
|
} |
|
|
|
|
|
static int |
|
roffismsec(const char *p) |
|
{ |
|
|
|
if (0 == strcmp(p, "1")) |
|
return(ROFF_MSEC_1); |
|
else if (0 == strcmp(p, "2")) |
|
return(ROFF_MSEC_2); |
|
else if (0 == strcmp(p, "3")) |
|
return(ROFF_MSEC_3); |
|
else if (0 == strcmp(p, "3p")) |
|
return(ROFF_MSEC_3p); |
|
else if (0 == strcmp(p, "4")) |
|
return(ROFF_MSEC_4); |
|
else if (0 == strcmp(p, "5")) |
|
return(ROFF_MSEC_5); |
|
else if (0 == strcmp(p, "6")) |
|
return(ROFF_MSEC_6); |
|
else if (0 == strcmp(p, "7")) |
|
return(ROFF_MSEC_7); |
|
else if (0 == strcmp(p, "8")) |
|
return(ROFF_MSEC_8); |
|
else if (0 == strcmp(p, "9")) |
|
return(ROFF_MSEC_9); |
|
else if (0 == strcmp(p, "unass")) |
|
return(ROFF_MSEC_UNASS); |
|
else if (0 == strcmp(p, "draft")) |
|
return(ROFF_MSEC_DRAFT); |
|
else if (0 == strcmp(p, "paper")) |
|
return(ROFF_MSEC_PAPER); |
|
|
|
return(ROFF_MSEC_MAX); |
|
} |
|
|
|
|
|
static int |
|
roffisatt(const char *p) |
|
{ |
|
|
|
assert(p); |
|
if (0 == strcmp(p, "v1")) |
|
return(1); |
|
else if (0 == strcmp(p, "v2")) |
|
return(1); |
|
else if (0 == strcmp(p, "v3")) |
|
return(1); |
|
else if (0 == strcmp(p, "v6")) |
|
return(1); |
|
else if (0 == strcmp(p, "v7")) |
|
return(1); |
|
else if (0 == strcmp(p, "32v")) |
|
return(1); |
|
else if (0 == strcmp(p, "V.1")) |
|
return(1); |
|
else if (0 == strcmp(p, "V.4")) |
|
return(1); |
|
|
|
return(0); |
|
} |
|
|
|
|
|
static int |
|
roffispunct(const char *p) |
roffispunct(const char *p) |
{ |
{ |
|
|
Line 815 roffspecial(struct rofftree *tree, int tok, const char |
|
Line 704 roffspecial(struct rofftree *tree, int tok, const char |
|
case (ROFF_At): |
case (ROFF_At): |
if (0 == sz) |
if (0 == sz) |
break; |
break; |
if (roffisatt(*ordp)) |
if (ROFF_ATT_MAX != roff_att(*ordp)) |
break; |
break; |
roff_err(tree, *ordp, "invalid `At' arg"); |
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
return(0); |
|
|
|
case (ROFF_Xr): |
case (ROFF_Xr): |
if (2 == sz) { |
if (2 == sz) { |
assert(ordp[1]); |
assert(ordp[1]); |
if (ROFF_MSEC_MAX != roffismsec(ordp[1])) |
if (ROFF_MSEC_MAX != roff_msec(ordp[1])) |
break; |
break; |
roff_warn(tree, start, "invalid `%s' manual " |
if ( ! roff_warn(tree, start, "invalid `%s' manual " |
"section", toknames[tok]); |
"section", toknames[tok])) |
|
return(0); |
} |
} |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
|
|
Line 835 roffspecial(struct rofftree *tree, int tok, const char |
|
Line 724 roffspecial(struct rofftree *tree, int tok, const char |
|
case (ROFF_Fn): |
case (ROFF_Fn): |
if (0 != sz) |
if (0 != sz) |
break; |
break; |
roff_err(tree, start, "`%s' expects at least " |
return(roff_errp(tree, start, tok, ERR_ARGGE1)); |
"one arg", toknames[tok]); |
|
return(0); |
|
|
|
case (ROFF_Nm): |
case (ROFF_Nm): |
if (0 == sz) { |
if (0 == sz) { |
if (0 == tree->name[0]) { |
if (0 != tree->name[0]) { |
roff_err(tree, start, "`Nm' not set"); |
ordp[0] = tree->name; |
return(0); |
ordp[1] = NULL; |
|
break; |
} |
} |
ordp[0] = tree->name; |
return(roff_err(tree, start, "`Nm' not set")); |
ordp[1] = NULL; |
|
} else if ( ! roffsetname(tree, ordp)) |
} else if ( ! roffsetname(tree, ordp)) |
return(0); |
return(0); |
break; |
break; |
Line 856 roffspecial(struct rofftree *tree, int tok, const char |
|
Line 743 roffspecial(struct rofftree *tree, int tok, const char |
|
case (ROFF_Ex): |
case (ROFF_Ex): |
if (1 == sz) |
if (1 == sz) |
break; |
break; |
roff_err(tree, start, "`%s' expects one arg", |
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
toknames[tok]); |
|
return(0); |
|
|
|
case (ROFF_Sm): |
case (ROFF_Sm): |
if (1 != sz) { |
if (1 != sz) |
roff_err(tree, start, "`Sm' expects one arg"); |
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
return(0); |
else if (0 == strcmp(ordp[0], "on") || |
} |
0 == strcmp(ordp[0], "off")) |
|
break; |
if (0 != strcmp(ordp[0], "on") && |
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
0 != strcmp(ordp[0], "off")) { |
|
roff_err(tree, start, "`Sm' has invalid argument"); |
|
return(0); |
|
} |
|
break; |
|
|
|
case (ROFF_Ud): |
case (ROFF_Ud): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_Ux): |
case (ROFF_Ux): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_Bt): |
case (ROFF_Bt): |
if (0 != sz) { |
if (0 == sz) |
roff_err(tree, start, "`%s' expects no args", |
break; |
toknames[tok]); |
return(roff_errp(tree, start, tok, ERR_ARGEQ0)); |
return(0); |
|
} |
|
break; |
|
default: |
default: |
break; |
break; |
} |
} |
Line 908 roffcall(struct rofftree *tree, int tok, char **argv) |
|
Line 785 roffcall(struct rofftree *tree, int tok, char **argv) |
|
int i; |
int i; |
enum roffmsec c; |
enum roffmsec c; |
|
|
if (NULL == tokens[tok].cb) { |
if (NULL == tokens[tok].cb) |
roff_err(tree, *argv, "`%s' is unsupported", |
return(roff_errp(tree, *argv, tok, ERR_NOTSUP)); |
toknames[tok]); |
|
return(0); |
|
} |
|
if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
i = 0; |
i = 0; |
while (ROFF_MSEC_MAX != |
while (ROFF_MSEC_MAX != |
Line 920 roffcall(struct rofftree *tree, int tok, char **argv) |
|
Line 795 roffcall(struct rofftree *tree, int tok, char **argv) |
|
if (c == tree->section) |
if (c == tree->section) |
break; |
break; |
if (ROFF_MSEC_MAX == c) { |
if (ROFF_MSEC_MAX == c) { |
roff_warn(tree, *argv, "`%s' is not a valid " |
if ( ! roff_warn(tree, *argv, "`%s' is not a valid " |
"macro in this manual section", |
"macro in this manual section", |
toknames[tok]); |
toknames[tok])) |
|
return(0); |
} |
} |
} |
} |
|
|
Line 947 roffnextopt(const struct rofftree *tree, int tok, |
|
Line 823 roffnextopt(const struct rofftree *tree, int tok, |
|
return(-1); |
return(-1); |
|
|
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
roff_warn(tree, arg, "argument-like parameter `%s' to " |
if ( ! roff_warn(tree, arg, "argument-like parameter `%s' to " |
"`%s'", arg, toknames[tok]); |
"`%s'", arg, toknames[tok])) |
|
return(ROFF_ARGMAX); |
return(-1); |
return(-1); |
} |
} |
|
|
if ( ! roffargok(tok, v)) { |
if ( ! roffargok(tok, v)) { |
roff_warn(tree, arg, "invalid argument parameter `%s' to " |
if ( ! roff_warn(tree, arg, "invalid argument parameter `%s' to " |
"`%s'", tokargnames[v], toknames[tok]); |
"`%s'", tokargnames[v], toknames[tok])) |
|
return(ROFF_ARGMAX); |
return(-1); |
return(-1); |
} |
} |
|
|
Line 964 roffnextopt(const struct rofftree *tree, int tok, |
|
Line 842 roffnextopt(const struct rofftree *tree, int tok, |
|
*in = ++argv; |
*in = ++argv; |
|
|
if (NULL == *argv) { |
if (NULL == *argv) { |
roff_err(tree, arg, "empty value of `%s' for `%s'", |
(void)roff_err(tree, arg, "empty value of `%s' for `%s'", |
tokargnames[v], toknames[tok]); |
tokargnames[v], toknames[tok]); |
return(ROFF_ARGMAX); |
return(ROFF_ARGMAX); |
} |
} |
Line 1038 roff_Dd(ROFFCALL_ARGS) |
|
Line 916 roff_Dd(ROFFCALL_ARGS) |
|
{ |
{ |
time_t t; |
time_t t; |
char *p, buf[32]; |
char *p, buf[32]; |
|
size_t sz; |
|
|
if (ROFF_BODY & tree->state) { |
if (ROFF_BODY & tree->state) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert( ! (ROFF_PRELUDE & tree->state)); |
Line 1048 roff_Dd(ROFFCALL_ARGS) |
|
Line 927 roff_Dd(ROFFCALL_ARGS) |
|
assert(ROFF_PRELUDE & tree->state); |
assert(ROFF_PRELUDE & tree->state); |
assert( ! (ROFF_BODY & tree->state)); |
assert( ! (ROFF_BODY & tree->state)); |
|
|
if (ROFF_PRELUDE_Dd & tree->state) { |
if (ROFF_PRELUDE_Dd & tree->state) |
roff_err(tree, *argv, "repeated `Dd' in prelude"); |
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
return(0); |
if (ROFF_PRELUDE_Dt & tree->state) |
} else if (ROFF_PRELUDE_Dt & tree->state) { |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
roff_err(tree, *argv, "out-of-order `Dd' in prelude"); |
|
return(0); |
|
} |
|
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
|
|
argv++; |
argv++; |
|
|
|
/* |
|
* This is a bit complex because there are many forms the date |
|
* can be in: it can be simply $Mdocdate$, $Mdocdate <date>$, |
|
* or a raw date. Process accordingly. |
|
*/ |
|
|
if (0 == strcmp(*argv, "$Mdocdate$")) { |
if (0 == strcmp(*argv, "$Mdocdate$")) { |
t = time(NULL); |
t = time(NULL); |
if (NULL == localtime_r(&t, &tree->tm)) |
if (NULL == localtime_r(&t, &tree->tm)) |
Line 1068 roff_Dd(ROFFCALL_ARGS) |
|
Line 950 roff_Dd(ROFFCALL_ARGS) |
|
return(1); |
return(1); |
} |
} |
|
|
/* Build this from Mdocdate or raw date. */ |
|
|
|
buf[0] = 0; |
buf[0] = 0; |
p = *argv; |
p = *argv; |
|
sz = sizeof(buf); |
|
|
if (0 != strcmp(*argv, "$Mdocdate:")) { |
if (0 != strcmp(*argv, "$Mdocdate:")) { |
while (*argv) { |
while (*argv) { |
if (strlcat(buf, *argv++, sizeof(buf)) |
if (strlcat(buf, *argv++, sz) < sz) |
< sizeof(buf)) |
|
continue; |
continue; |
roff_err(tree, p, "bad `Dd' date"); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
return(0); |
|
} |
} |
if (strptime(buf, "%b%d,%Y", &tree->tm)) { |
if (strptime(buf, "%b%d,%Y", &tree->tm)) { |
tree->state |= ROFF_PRELUDE_Dd; |
tree->state |= ROFF_PRELUDE_Dd; |
return(1); |
return(1); |
} |
} |
roff_err(tree, *argv, "bad `Dd' date"); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
return(0); |
|
} |
} |
|
|
argv++; |
argv++; |
|
|
while (*argv && **argv != '$') { |
while (*argv && **argv != '$') { |
if (strlcat(buf, *argv++, sizeof(buf)) |
if (strlcat(buf, *argv++, sz) >= sz) |
>= sizeof(buf)) { |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
roff_err(tree, p, "bad `Dd' Mdocdate"); |
if (strlcat(buf, " ", sz) >= sz) |
return(0); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
} |
|
if (strlcat(buf, " ", sizeof(buf)) |
|
>= sizeof(buf)) { |
|
roff_err(tree, p, "bad `Dd' Mdocdate"); |
|
return(0); |
|
} |
|
} |
} |
if (NULL == *argv) { |
|
roff_err(tree, p, "bad `Dd' Mdocdate"); |
|
return(0); |
|
} |
|
|
|
if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) { |
if (NULL == *argv) |
roff_err(tree, *argv, "bad `Dd' Mdocdate"); |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
return(0); |
if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) |
} |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
|
tree->state |= ROFF_PRELUDE_Dd; |
tree->state |= ROFF_PRELUDE_Dd; |
return(1); |
return(1); |
Line 1121 roff_Dd(ROFFCALL_ARGS) |
|
Line 990 roff_Dd(ROFFCALL_ARGS) |
|
static int |
static int |
roff_Dt(ROFFCALL_ARGS) |
roff_Dt(ROFFCALL_ARGS) |
{ |
{ |
|
size_t sz; |
|
|
if (ROFF_BODY & tree->state) { |
if (ROFF_BODY & tree->state) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert( ! (ROFF_PRELUDE & tree->state)); |
Line 1131 roff_Dt(ROFFCALL_ARGS) |
|
Line 1001 roff_Dt(ROFFCALL_ARGS) |
|
assert(ROFF_PRELUDE & tree->state); |
assert(ROFF_PRELUDE & tree->state); |
assert( ! (ROFF_BODY & tree->state)); |
assert( ! (ROFF_BODY & tree->state)); |
|
|
if ( ! (ROFF_PRELUDE_Dd & tree->state)) { |
if ( ! (ROFF_PRELUDE_Dd & tree->state)) |
roff_err(tree, *argv, "out-of-order `Dt' in prelude"); |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
return(0); |
if (ROFF_PRELUDE_Dt & tree->state) |
} else if (ROFF_PRELUDE_Dt & tree->state) { |
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
roff_err(tree, *argv, "repeated `Dt' in prelude"); |
|
return(0); |
|
} |
|
|
|
argv++; |
argv++; |
if (NULL == *argv) { |
sz = sizeof(tree->title); |
roff_err(tree, *argv, "`Dt' needs document title"); |
|
return(0); |
|
} else if (strlcpy(tree->title, *argv, sizeof(tree->title)) |
|
>= sizeof(tree->title)) { |
|
roff_err(tree, *argv, "`Dt' document title too long"); |
|
return(0); |
|
} |
|
|
|
|
if (NULL == *argv) |
|
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
|
if (strlcpy(tree->title, *argv, sz) >= sz) |
|
return(roff_errp(tree, *argv, tok, ERR_ARGLEN)); |
|
|
argv++; |
argv++; |
if (NULL == *argv) { |
if (NULL == *argv) |
roff_err(tree, *argv, "`Dt' needs section"); |
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
return(0); |
|
} |
|
|
|
if (ROFF_MSEC_MAX == (tree->section = roffismsec(*argv))) { |
if (ROFF_MSEC_MAX == (tree->section = roff_msec(*argv))) |
roff_err(tree, *argv, "bad `Dt' section"); |
return(roff_errp(tree, *argv, tok, ERR_BADARG)); |
return(0); |
|
} |
|
|
|
argv++; |
argv++; |
|
sz = sizeof(tree->volume); |
|
|
if (NULL == *argv) { |
if (NULL == *argv) { |
tree->volume[0] = 0; |
tree->volume[0] = 0; |
} else if (strlcpy(tree->volume, *argv, sizeof(tree->volume)) |
} else if (strlcpy(tree->volume, *argv, sz) >= sz) |
>= sizeof(tree->volume)) { |
return(roff_errp(tree, *argv, tok, ERR_ARGLEN)); |
roff_err(tree, *argv, "`Dt' volume too long"); |
|
return(0); |
|
} |
|
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
tree->state |= ROFF_PRELUDE_Dt; |
tree->state |= ROFF_PRELUDE_Dt; |
Line 1179 roff_Dt(ROFFCALL_ARGS) |
|
Line 1039 roff_Dt(ROFFCALL_ARGS) |
|
static int |
static int |
roffsetname(struct rofftree *tree, char **ordp) |
roffsetname(struct rofftree *tree, char **ordp) |
{ |
{ |
|
size_t sz; |
|
|
assert(*ordp); |
assert(*ordp); |
|
|
/* FIXME: not all sections can set this. */ |
/* FIXME: not all sections can set this. */ |
|
|
if (NULL != *(ordp + 1)) { |
if (NULL != *(ordp + 1)) |
roff_err(tree, *ordp, "too many `Nm' args"); |
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGMNY)); |
return(0); |
|
} |
|
|
|
if (strlcpy(tree->name, *ordp, sizeof(tree->name)) |
sz = sizeof(tree->name); |
>= sizeof(tree->name)) { |
if (strlcpy(tree->name, *ordp, sz) >= sz) |
roff_err(tree, *ordp, "`Nm' arg too long"); |
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGLEN)); |
return(0); |
|
} |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
roff_Os(ROFFCALL_ARGS) |
roff_Os(ROFFCALL_ARGS) |
{ |
{ |
char *p; |
char *p; |
|
size_t sz; |
|
|
if (ROFF_BODY & tree->state) { |
if (ROFF_BODY & tree->state) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert( ! (ROFF_PRELUDE & tree->state)); |
Line 1259 roff_Os(ROFFCALL_ARGS) |
|
Line 1117 roff_Os(ROFFCALL_ARGS) |
|
|
|
assert(ROFF_PRELUDE & tree->state); |
assert(ROFF_PRELUDE & tree->state); |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
! (ROFF_PRELUDE_Dd & tree->state)) { |
! (ROFF_PRELUDE_Dd & tree->state)) |
roff_err(tree, *argv, "out-of-order `Os' in prelude"); |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
return(0); |
|
} |
|
|
|
tree->os[0] = 0; |
tree->os[0] = 0; |
|
|
p = *++argv; |
p = *++argv; |
|
sz = sizeof(tree->os); |
|
|
while (*argv) { |
while (*argv) |
if (strlcat(tree->os, *argv++, sizeof(tree->os)) |
if (strlcat(tree->os, *argv++, sz) >= sz) |
< sizeof(tree->os)) |
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
continue; |
|
roff_err(tree, p, "`Os' value too long"); |
|
return(0); |
|
} |
|
|
|
if (0 == tree->os[0]) |
if (0 == tree->os[0]) |
if (strlcpy(tree->os, "LOCAL", sizeof(tree->os)) |
if (strlcpy(tree->os, "LOCAL", sz) >= sz) |
>= sizeof(tree->os)) { |
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
roff_err(tree, p, "`Os' value too long"); |
|
return(0); |
|
} |
|
|
|
tree->state |= ROFF_PRELUDE_Os; |
tree->state |= ROFF_PRELUDE_Os; |
tree->state &= ~ROFF_PRELUDE; |
tree->state &= ~ROFF_PRELUDE; |
Line 1294 roff_Os(ROFFCALL_ARGS) |
|
Line 1144 roff_Os(ROFFCALL_ARGS) |
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
|
|
return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
tree->os, tree->title, tree->section, |
tree->os, tree->title, |
tree->volume)); |
tree->section, tree->volume)); |
} |
} |
|
|
|
|
|
|
roff_layout(ROFFCALL_ARGS) |
roff_layout(ROFFCALL_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXLINEARG]; |
int i, c, argcp[ROFF_MAXLINEARG]; |
char *argvp[ROFF_MAXLINEARG], *p; |
char *argvp[ROFF_MAXLINEARG]; |
|
|
/* |
/* |
* The roff_layout function is for multi-line macros. A layout |
* The roff_layout function is for multi-line macros. A layout |
Line 1320 roff_layout(ROFFCALL_ARGS) |
|
Line 1170 roff_layout(ROFFCALL_ARGS) |
|
|
|
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) |
roff_err(tree, *argv, "bad `%s' in prelude", |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
toknames[tok]); |
|
return(0); |
if (ROFF_EXIT == type) { |
} else if (ROFF_EXIT == type) { |
|
roffnode_free(tree); |
roffnode_free(tree); |
if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
return(0); |
return(0); |
return((*tree->cb.roffblkout)(tree->arg, tok)); |
return((*tree->cb.roffblkout)(tree->arg, tok)); |
} |
} |
|
|
|
argv++; |
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
|
|
p = *argv++; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
return(0); |
return(0); |
if (NULL == roffnode_new(tok, tree)) |
if (NULL == roffnode_new(tok, tree)) |
Line 1371 roff_layout(ROFFCALL_ARGS) |
|
Line 1219 roff_layout(ROFFCALL_ARGS) |
|
switch (tok) { |
switch (tok) { |
case (ROFF_Sh): |
case (ROFF_Sh): |
if (NULL == *argv) { |
if (NULL == *argv) { |
roff_err(tree, *(argv - 1), |
argv--; |
"`Sh' expects arguments"); |
return(roff_errp(tree, *argv, tok, ERR_ARGGE1)); |
return(0); |
|
} |
} |
tree->csec = roffissec((const char **)argv); |
|
|
tree->csec = roff_sec((const char **)argv); |
|
|
if ( ! (ROFFSec_OTHER & tree->csec) && |
if ( ! (ROFFSec_OTHER & tree->csec) && |
tree->asec & tree->csec) |
tree->asec & tree->csec) |
roff_warn(tree, *argv, "section repeated"); |
if ( ! roff_warn(tree, *argv, "section repeated")) |
if (0 == tree->asec && ! (ROFFSec_NAME & tree->csec)) { |
return(0); |
roff_err(tree, *argv, "`NAME' section " |
|
"must be first"); |
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); |
return(0); |
} else if ( ! roffchecksec(tree, *argv, tree->csec)) |
|
return(0); |
|
|
|
tree->asec |= tree->csec; |
tree->asec |= tree->csec; |
break; |
break; |
Line 1484 roff_ordered(ROFFCALL_ARGS) |
|
Line 1334 roff_ordered(ROFFCALL_ARGS) |
|
* .Xr arg1 arg2 punctuation |
* .Xr arg1 arg2 punctuation |
*/ |
*/ |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) |
roff_err(tree, *argv, "`%s' disallowed in prelude", |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
toknames[tok]); |
|
return(0); |
|
} |
|
|
|
first = (*argv == tree->cur); |
first = (*argv == tree->cur); |
p = *argv++; |
p = *argv++; |
Line 1559 roff_text(ROFFCALL_ARGS) |
|
Line 1406 roff_text(ROFFCALL_ARGS) |
|
* <fl> v W f </fl> ; |
* <fl> v W f </fl> ; |
*/ |
*/ |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) |
roff_err(tree, *argv, "`%s' disallowed in prelude", |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
toknames[tok]); |
|
return(0); |
|
} |
|
|
|
first = (*argv == tree->cur); |
first = (*argv == tree->cur); |
argv++; |
argv++; |
Line 1581 roff_text(ROFFCALL_ARGS) |
|
Line 1425 roff_text(ROFFCALL_ARGS) |
|
while (*argv) |
while (*argv) |
if ( ! roffdata(tree, i++, *argv++)) |
if ( ! roffdata(tree, i++, *argv++)) |
return(0); |
return(0); |
|
|
return((*tree->cb.roffout)(tree->arg, tok)); |
return((*tree->cb.roffout)(tree->arg, tok)); |
} |
} |
|
|
Line 1603 roff_text(ROFFCALL_ARGS) |
|
Line 1446 roff_text(ROFFCALL_ARGS) |
|
|
|
if ( ! roffcall(tree, c, argv)) |
if ( ! roffcall(tree, c, argv)) |
return(0); |
return(0); |
|
|
if (ROFF_LSCOPE & tokens[tok].flags) |
if (ROFF_LSCOPE & tokens[tok].flags) |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
return(0); |
return(0); |
|
|
break; |
break; |
} |
} |
|
|
|
|
roff_depr(ROFFCALL_ARGS) |
roff_depr(ROFFCALL_ARGS) |
{ |
{ |
|
|
roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]); |
return(roff_errp(tree, *argv, tok, ERR_DEPREC)); |
return(0); |
|
} |
} |
|
|
|
|
static void |
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, ...) |
roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...) |
{ |
{ |
va_list ap; |
va_list ap; |
Line 1684 roff_warn(const struct rofftree *tree, const char *pos |
|
Line 1543 roff_warn(const struct rofftree *tree, const char *pos |
|
(void)vsnprintf(buf, sizeof(buf), fmt, ap); |
(void)vsnprintf(buf, sizeof(buf), fmt, ap); |
va_end(ap); |
va_end(ap); |
|
|
(*tree->cb.roffmsg)(tree->arg, |
return((*tree->cb.roffmsg)(tree->arg, |
ROFF_WARN, tree->cur, pos, buf); |
ROFF_WARN, tree->cur, pos, buf)); |
} |
} |
|
|
|
|
static void |
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, ...) |
roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...) |
{ |
{ |
va_list ap; |
va_list ap; |
char buf[128]; |
char buf[128]; |
|
|
va_start(ap, fmt); |
va_start(ap, fmt); |
(void)vsnprintf(buf, sizeof(buf), fmt, ap); |
if (-1 == vsnprintf(buf, sizeof(buf), fmt, ap)) |
|
err(1, "vsnprintf"); |
va_end(ap); |
va_end(ap); |
|
|
(*tree->cb.roffmsg)(tree->arg, |
return((*tree->cb.roffmsg) |
ROFF_ERROR, tree->cur, pos, buf); |
(tree->arg, ROFF_ERROR, tree->cur, pos, buf)); |
} |
} |
|
|