version 1.1, 2008/11/24 14:24:55 |
version 1.4, 2008/11/25 12:14:02 |
|
|
ROFF_EXIT |
ROFF_EXIT |
}; |
}; |
|
|
|
/* FIXME: prolog roffs can be text roffs, too. */ |
|
|
enum rofftype { |
enum rofftype { |
ROFF_TITLE, |
|
ROFF_COMMENT, |
ROFF_COMMENT, |
ROFF_TEXT, |
ROFF_TEXT, |
ROFF_LAYOUT |
ROFF_LAYOUT |
}; |
}; |
|
|
#define ROFFCALL_ARGS \ |
#define ROFFCALL_ARGS \ |
struct rofftree *tree, const char *argv[], enum roffd type |
int tok, struct rofftree *tree, \ |
|
const char *argv[], enum roffd type |
|
|
struct rofftree; |
struct rofftree; |
|
|
struct rofftok { |
struct rofftok { |
char *name; |
|
int (*cb)(ROFFCALL_ARGS); |
int (*cb)(ROFFCALL_ARGS); |
enum rofftype type; |
enum rofftype type; |
int flags; |
int flags; |
|
|
}; |
}; |
|
|
struct roffarg { |
struct roffarg { |
char *name; |
int tok; |
int flags; |
int flags; |
#define ROFF_VALUE (1 << 0) |
#define ROFF_VALUE (1 << 0) |
}; |
}; |
Line 72 struct roffnode { |
|
Line 73 struct roffnode { |
|
struct rofftree { |
struct rofftree { |
struct roffnode *last; |
struct roffnode *last; |
time_t date; |
time_t date; |
char title[256]; |
char os[64]; |
char section[256]; |
char title[64]; |
char volume[256]; |
char section[64]; |
|
char volume[64]; |
int state; |
int state; |
#define ROFF_PRELUDE (1 << 1) |
#define ROFF_PRELUDE (1 << 1) |
#define ROFF_PRELUDE_Os (1 << 2) |
#define ROFF_PRELUDE_Os (1 << 2) |
#define ROFF_PRELUDE_Dt (1 << 3) |
#define ROFF_PRELUDE_Dt (1 << 3) |
#define ROFF_PRELUDE_Dd (1 << 4) |
#define ROFF_PRELUDE_Dd (1 << 4) |
#define ROFF_BODY (1 << 5) |
#define ROFF_BODY (1 << 5) |
struct md_mbuf *mbuf; /* NULL if ROFF_EXIT and error. */ |
|
|
|
|
roffin roffin; |
|
roffblkin roffblkin; |
|
roffout roffout; |
|
roffblkout roffblkout; |
|
|
|
struct md_mbuf *mbuf; /* NULL if !flush. */ |
const struct md_args *args; |
const struct md_args *args; |
const struct md_rbuf *rbuf; |
const struct md_rbuf *rbuf; |
}; |
}; |
|
|
#define ROFF___ 0 |
|
#define ROFF_Dd 1 |
|
#define ROFF_Dt 2 |
|
#define ROFF_Os 3 |
|
#define ROFF_Sh 4 |
|
#define ROFF_An 5 |
|
#define ROFF_Li 6 |
|
#define ROFF_MAX 7 |
|
|
|
static int roff_Dd(ROFFCALL_ARGS); |
static int roff_Dd(ROFFCALL_ARGS); |
static int roff_Dt(ROFFCALL_ARGS); |
static int roff_Dt(ROFFCALL_ARGS); |
static int roff_Os(ROFFCALL_ARGS); |
static int roff_Os(ROFFCALL_ARGS); |
static int roff_Sh(ROFFCALL_ARGS); |
|
static int roff_An(ROFFCALL_ARGS); |
|
static int roff_Li(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, size_t, |
static int roff_layout(ROFFCALL_ARGS); |
struct rofftree *); |
static int roff_text(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
static void roffnode_free(int, struct rofftree *); |
static void roffnode_free(int, struct rofftree *); |
|
|
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 roffargs(int, char *, char **); |
static int roffargs(int, char *, char **); |
static int roffparse(struct rofftree *, char *, size_t); |
static int roffparse(struct rofftree *, char *, size_t); |
static int textparse(const struct rofftree *, |
static int textparse(const struct rofftree *, |
const char *, size_t); |
const char *, size_t); |
|
|
static void dbg_enter(const struct md_args *, int); |
|
static void dbg_leave(const struct md_args *, int); |
|
|
|
|
static const struct rofftok tokens[ROFF_MAX] = { |
static const struct rofftok tokens[ROFF_MAX] = { |
{ NULL, ROFF_COMMENT, 0 }, |
{ "\\\"", NULL, ROFF_COMMENT, 0 }, |
{ roff_Dd, ROFF_TEXT, 0 }, /* Dd */ |
{ "Dd", roff_Dd, ROFF_TITLE, 0 }, |
{ roff_Dt, ROFF_TEXT, 0 }, /* Dt */ |
{ "Dt", roff_Dt, ROFF_TITLE, 0 }, |
{ roff_Os, ROFF_TEXT, 0 }, /* Os */ |
{ "Os", roff_Os, ROFF_TITLE, 0 }, |
{ roff_layout, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
{ "Sh", roff_Sh, ROFF_LAYOUT, 0 }, |
{ roff_layout, ROFF_LAYOUT, ROFF_PARSED }, /* Ss XXX */ |
{ "An", roff_An, ROFF_TEXT, ROFF_PARSED }, |
{ roff_layout, ROFF_LAYOUT, 0 }, /* Pp */ |
{ "Li", roff_Li, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, |
{ 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 */ |
}; |
}; |
|
|
#define ROFF_Split 0 |
/* FIXME: multiple owners? */ |
#define ROFF_Nosplit 1 |
|
#define ROFF_ARGMAX 2 |
|
|
|
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
{ "split", 0 }, |
{ ROFF_An, 0 }, /* split */ |
{ "nosplit", 0 }, |
{ ROFF_An, 0 }, /* nosplit */ |
|
{ ROFF_Bd, 0 }, /* ragged */ |
|
{ ROFF_Bd, 0 }, /* unfilled */ |
|
{ ROFF_Bd, 0 }, /* literal */ |
|
{ ROFF_Bd, ROFF_VALUE }, /* file */ |
|
{ ROFF_Bd, ROFF_VALUE }, /* offset */ |
|
{ ROFF_Bl, 0 }, /* bullet */ |
|
{ ROFF_Bl, 0 }, /* dash */ |
|
{ ROFF_Bl, 0 }, /* hyphen */ |
|
{ ROFF_Bl, 0 }, /* item */ |
|
{ ROFF_Bl, 0 }, /* enum */ |
|
{ ROFF_Bl, 0 }, /* tag */ |
|
{ ROFF_Bl, 0 }, /* diag */ |
|
{ ROFF_Bl, 0 }, /* hang */ |
|
{ ROFF_Bl, 0 }, /* ohang */ |
|
{ ROFF_Bl, 0 }, /* inset */ |
|
{ ROFF_Bl, 0 }, /* column */ |
}; |
}; |
|
|
|
static const char *const toknames[ROFF_MAX] = ROFF_NAMES; |
|
static const char *const tokargnames[ROFF_ARGMAX] = ROFF_ARGNAMES; |
|
|
|
|
int |
int |
roff_free(struct rofftree *tree, int flush) |
roff_free(struct rofftree *tree, int flush) |
{ |
{ |
Line 150 roff_free(struct rofftree *tree, int flush) |
|
Line 171 roff_free(struct rofftree *tree, int flush) |
|
/* LINTED */ |
/* LINTED */ |
while (tree->last) |
while (tree->last) |
if ( ! (*tokens[tree->last->tok].cb) |
if ( ! (*tokens[tree->last->tok].cb) |
(tree, NULL, ROFF_EXIT)) |
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
/* Disallow flushing. */ |
/* Disallow flushing. */ |
tree->mbuf = NULL; |
tree->mbuf = NULL; |
|
|
Line 169 roff_free(struct rofftree *tree, int flush) |
|
Line 190 roff_free(struct rofftree *tree, int flush) |
|
|
|
struct rofftree * |
struct rofftree * |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
const struct md_rbuf *in) |
const struct md_rbuf *in, roffin textin, |
|
roffout textout, roffblkin blkin, roffblkout blkout) |
{ |
{ |
struct rofftree *tree; |
struct rofftree *tree; |
|
|
Line 182 roff_alloc(const struct md_args *args, struct md_mbuf |
|
Line 204 roff_alloc(const struct md_args *args, struct md_mbuf |
|
tree->args = args; |
tree->args = args; |
tree->mbuf = out; |
tree->mbuf = out; |
tree->rbuf = in; |
tree->rbuf = in; |
|
tree->roffin = textin; |
|
tree->roffout = textout; |
|
tree->roffblkin = blkin; |
|
tree->roffblkout = blkout; |
|
|
return(tree); |
return(tree); |
} |
} |
Line 290 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 316 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
|
|
if ( ! roffargs(tok, buf, argv)) { |
if ( ! roffargs(tok, buf, argv)) { |
warnx("%s: too many arguments to `%s' (line %zu)", |
warnx("%s: too many arguments to `%s' (line %zu)", |
tree->rbuf->name, tokens[tok].name, |
tree->rbuf->name, toknames[tok], |
tree->rbuf->line); |
tree->rbuf->line); |
return(0); |
return(0); |
} |
} |
|
|
/* Domain cross-contamination (and sanity) checks. */ |
|
|
|
switch (tokens[tok].type) { |
|
case (ROFF_TITLE): |
|
if (ROFF_PRELUDE & tree->state) { |
|
assert( ! (ROFF_BODY & tree->state)); |
|
break; |
|
} |
|
assert(ROFF_BODY & tree->state); |
|
warnx("%s: prelude token `%s' in body (line %zu)", |
|
tree->rbuf->name, tokens[tok].name, |
|
tree->rbuf->line); |
|
return(0); |
|
case (ROFF_LAYOUT): |
|
/* FALLTHROUGH */ |
|
case (ROFF_TEXT): |
|
if (ROFF_BODY & tree->state) { |
|
assert( ! (ROFF_PRELUDE & tree->state)); |
|
break; |
|
} |
|
assert(ROFF_PRELUDE & tree->state); |
|
warnx("%s: body token `%s' in prelude (line %zu)", |
|
tree->rbuf->name, tokens[tok].name, |
|
tree->rbuf->line); |
|
return(0); |
|
case (ROFF_COMMENT): |
|
return(1); |
|
default: |
|
abort(); |
|
} |
|
|
|
/* |
/* |
* If this is a non-nestable layout token and we're below a |
* If this is a non-nestable layout token and we're below a |
* token of the same type, then recurse upward to the token, |
* token of the same type, then recurse upward to the token, |
Line 351 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 346 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
warnx("%s: scope of %s (line %zu) broken by " |
warnx("%s: scope of %s (line %zu) broken by " |
"%s (line %zu)", |
"%s (line %zu)", |
tree->rbuf->name, |
tree->rbuf->name, |
tokens[tok].name, |
toknames[tok], node->line, |
node->line, |
toknames[node->tok], |
tokens[node->tok].name, |
|
tree->rbuf->line); |
tree->rbuf->line); |
return(0); |
return(0); |
} |
} |
Line 370 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 364 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
do { |
do { |
t = tree->last->tok; |
t = tree->last->tok; |
if ( ! (*tokens[tree->last->tok].cb) |
if ( ! (*tokens[tree->last->tok].cb) |
(tree, NULL, ROFF_EXIT)) |
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
return(0); |
return(0); |
} while (t != tok); |
} while (t != tok); |
} |
} |
Line 378 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 372 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
/* Proceed with actual token processing. */ |
/* Proceed with actual token processing. */ |
|
|
argvp = (const char **)&argv[1]; |
argvp = (const char **)&argv[1]; |
return((*tokens[tok].cb)(tree, argvp, ROFF_ENTER)); |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
} |
} |
|
|
|
|
Line 392 rofffindarg(const char *name) |
|
Line 386 rofffindarg(const char *name) |
|
/* LINTED */ |
/* LINTED */ |
for (i = 0; i < ROFF_ARGMAX; i++) |
for (i = 0; i < ROFF_ARGMAX; i++) |
/* LINTED */ |
/* LINTED */ |
if (0 == strcmp(name, tokenargs[i].name)) |
if (0 == strcmp(name, tokargnames[i])) |
return((int)i); |
return((int)i); |
|
|
return(ROFF_ARGMAX); |
return(ROFF_ARGMAX); |
Line 409 rofffindtok(const char *name) |
|
Line 403 rofffindtok(const char *name) |
|
/* LINTED */ |
/* LINTED */ |
for (i = 0; i < ROFF_MAX; i++) |
for (i = 0; i < ROFF_MAX; i++) |
/* LINTED */ |
/* LINTED */ |
if (0 == strncmp(name, tokens[i].name, 2)) |
if (0 == strncmp(name, toknames[i], 2)) |
return((int)i); |
return((int)i); |
|
|
return(ROFF_MAX); |
return(ROFF_MAX); |
} |
} |
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
static int |
|
rofffindcallable(const char *name) |
|
{ |
|
int c; |
|
|
|
if (ROFF_MAX == (c = rofffindtok(name))) |
|
return(ROFF_MAX); |
|
return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
|
} |
|
|
|
|
static struct roffnode * |
static struct roffnode * |
roffnode_new(int tokid, size_t line, struct rofftree *tree) |
roffnode_new(int tokid, struct rofftree *tree) |
{ |
{ |
struct roffnode *p; |
struct roffnode *p; |
|
|
Line 427 roffnode_new(int tokid, size_t line, struct rofftree * |
|
Line 431 roffnode_new(int tokid, size_t line, struct rofftree * |
|
return(NULL); |
return(NULL); |
} |
} |
|
|
p->line = line; |
p->line = tree->rbuf->line; |
p->tok = tokid; |
p->tok = tokid; |
p->parent = tree->last; |
p->parent = tree->last; |
tree->last = p; |
tree->last = p; |
Line 449 roffnode_free(int tokid, struct rofftree *tree) |
|
Line 453 roffnode_free(int tokid, struct rofftree *tree) |
|
} |
} |
|
|
|
|
static int dbg_lvl = 0; |
|
|
|
|
|
static void |
|
dbg_enter(const struct md_args *args, int tokid) |
|
{ |
|
int i; |
|
static char buf[72]; |
|
|
|
assert(args); |
|
if ( ! (args->dbg & MD_DBG_TREE)) |
|
return; |
|
assert(tokid >= 0 && tokid <= ROFF_MAX); |
|
|
|
buf[0] = buf[71] = 0; |
|
|
|
switch (tokens[tokid].type) { |
|
case (ROFF_LAYOUT): |
|
(void)strncat(buf, "[body-layout] ", sizeof(buf) - 1); |
|
break; |
|
case (ROFF_TEXT): |
|
(void)strncat(buf, "[ body-text] ", sizeof(buf) - 1); |
|
break; |
|
case (ROFF_TITLE): |
|
(void)strncat(buf, "[ prelude] ", sizeof(buf) - 1); |
|
break; |
|
default: |
|
abort(); |
|
} |
|
|
|
/* LINTED */ |
|
for (i = 0; i < dbg_lvl; i++) |
|
(void)strncat(buf, " ", sizeof(buf) - 1); |
|
|
|
(void)strncat(buf, tokens[tokid].name, sizeof(buf) - 1); |
|
|
|
(void)printf("%s\n", buf); |
|
|
|
dbg_lvl++; |
|
} |
|
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
|
static void |
|
dbg_leave(const struct md_args *args, int tokid) |
|
{ |
|
assert(args); |
|
if ( ! (args->dbg & MD_DBG_TREE)) |
|
return; |
|
|
|
assert(tokid >= 0 && tokid <= ROFF_MAX); |
|
assert(dbg_lvl > 0); |
|
dbg_lvl--; |
|
} |
|
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_Dd(ROFFCALL_ARGS) |
roff_Dd(ROFFCALL_ARGS) |
{ |
{ |
|
|
dbg_enter(tree->args, ROFF_Dd); |
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_PRELUDE & tree->state); |
if (ROFF_PRELUDE_Dt & tree->state || |
assert( ! (ROFF_BODY & tree->state)); |
ROFF_PRELUDE_Dd & tree->state) { |
|
|
if (ROFF_PRELUDE_Dd & tree->state || |
|
ROFF_PRELUDE_Dt & tree->state) { |
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
tree->rbuf->name, tree->rbuf->line); |
tree->rbuf->name, tree->rbuf->line); |
return(0); |
return(0); |
} |
} |
|
|
|
/* TODO: parse date. */ |
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
tree->state |= ROFF_PRELUDE_Dd; |
tree->state |= ROFF_PRELUDE_Dd; |
|
|
dbg_leave(tree->args, ROFF_Dd); |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
|
|
roff_Dt(ROFFCALL_ARGS) |
roff_Dt(ROFFCALL_ARGS) |
{ |
{ |
|
|
dbg_enter(tree->args, ROFF_Dt); |
if (ROFF_BODY & tree->state) { |
|
assert( ! (ROFF_PRELUDE & tree->state)); |
|
assert(ROFF_PRELUDE_Dt & tree->state); |
|
return(roff_text(tok, tree, argv, type)); |
|
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
assert(ROFF_PRELUDE & tree->state); |
|
assert( ! (ROFF_BODY & tree->state)); |
|
|
if ( ! (ROFF_PRELUDE_Dd & tree->state) || |
if ( ! (ROFF_PRELUDE_Dd & tree->state) || |
(ROFF_PRELUDE_Dt & tree->state)) { |
(ROFF_PRELUDE_Dt & tree->state)) { |
warnx("%s: prelude `Dt' out-of-order (line %zu)", |
warnx("%s: prelude `Dt' out-of-order (line %zu)", |
Line 545 roff_Dt(ROFFCALL_ARGS) |
|
Line 504 roff_Dt(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
|
/* TODO: parse date. */ |
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
tree->state |= ROFF_PRELUDE_Dt; |
tree->state |= ROFF_PRELUDE_Dt; |
|
|
dbg_leave(tree->args, ROFF_Dt); |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 560 roff_Os(ROFFCALL_ARGS) |
|
Line 519 roff_Os(ROFFCALL_ARGS) |
|
{ |
{ |
|
|
if (ROFF_EXIT == type) { |
if (ROFF_EXIT == type) { |
roffnode_free(ROFF_Os, tree); |
assert(ROFF_PRELUDE_Os & tree->state); |
dbg_leave(tree->args, ROFF_Os); |
return(roff_layout(tok, tree, argv, type)); |
return(1); |
} else if (ROFF_BODY & tree->state) { |
} |
assert( ! (ROFF_PRELUDE & tree->state)); |
|
assert(ROFF_PRELUDE_Os & tree->state); |
|
return(roff_text(tok, tree, argv, type)); |
|
} |
|
|
dbg_enter(tree->args, ROFF_Os); |
|
|
|
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)) { |
Line 575 roff_Os(ROFFCALL_ARGS) |
|
Line 535 roff_Os(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
assert(NULL == tree->last); |
/* TODO: extract OS. */ |
if (NULL == roffnode_new(ROFF_Os, tree->rbuf->line, tree)) |
|
return(0); |
|
|
|
tree->state |= ROFF_PRELUDE_Os; |
tree->state |= ROFF_PRELUDE_Os; |
tree->state &= ~ROFF_PRELUDE; |
tree->state &= ~ROFF_PRELUDE; |
tree->state |= ROFF_BODY; |
tree->state |= ROFF_BODY; |
|
|
return(1); |
assert(NULL == tree->last); |
} |
|
|
|
|
return(roff_layout(tok, tree, argv, type)); |
/* ARGSUSED */ |
|
static int |
|
roff_Sh(ROFFCALL_ARGS) |
|
{ |
|
|
|
if (ROFF_EXIT == type) { |
|
roffnode_free(ROFF_Sh, tree); |
|
dbg_leave(tree->args, ROFF_Sh); |
|
return(1); |
|
} |
|
|
|
dbg_enter(tree->args, ROFF_Sh); |
|
|
|
if (NULL == roffnode_new(ROFF_Sh, tree->rbuf->line, tree)) |
|
return(0); |
|
|
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGUSED */ |
static int |
static int |
roff_Li(ROFFCALL_ARGS) |
|
{ |
|
|
|
dbg_enter(tree->args, ROFF_Li); |
|
dbg_leave(tree->args, ROFF_Li); |
|
|
|
return(1); |
|
} |
|
|
|
|
|
static int |
|
roffnextopt(const char ***in, char **val) |
roffnextopt(const char ***in, char **val) |
{ |
{ |
const char *arg, **argv; |
const char *arg, **argv; |
Line 648 roffnextopt(const char ***in, char **val) |
|
Line 577 roffnextopt(const char ***in, char **val) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_An(ROFFCALL_ARGS) |
roff_layout(ROFFCALL_ARGS) |
{ |
{ |
int c; |
int i, c, argcp[ROFF_MAXARG]; |
char *val; |
char *v, *argvp[ROFF_MAXARG]; |
|
|
dbg_enter(tree->args, ROFF_An); |
if (ROFF_PRELUDE & tree->state) { |
|
warnx("%s: macro `%s' called in prelude (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
while (-1 != (c = roffnextopt(&argv, &val))) { |
if (ROFF_EXIT == type) { |
switch (c) { |
roffnode_free(tok, tree); |
case (ROFF_Split): |
return((*tree->roffblkout)(tok)); |
/* Process argument. */ |
} |
break; |
|
case (ROFF_Nosplit): |
i = 0; |
/* Process argument. */ |
while (-1 != (c = roffnextopt(&argv, &v))) { |
break; |
if (ROFF_ARGMAX == c) { |
default: |
warnx("%s: error parsing `%s' args (line %zu)", |
warnx("%s: error parsing `An' args (line %zu)", |
|
tree->rbuf->name, |
tree->rbuf->name, |
|
toknames[tok], |
tree->rbuf->line); |
tree->rbuf->line); |
return(0); |
return(0); |
} |
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
argv++; |
argv++; |
} |
} |
|
|
/* Print header. */ |
if (NULL == roffnode_new(tok, tree)) |
|
return(0); |
|
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
|
return(0); |
|
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
/* TODO: print all tokens. */ |
|
|
|
if ( ! ((*tree->roffout)(tok))) |
|
return(0); |
|
return((*tree->roffblkin)(tok)); |
|
} |
|
|
while (*argv) { |
while (*argv) { |
if (/* is_parsable && */ 2 >= strlen(*argv)) { |
if (2 >= strlen(*argv) && ROFF_MAX != |
if (ROFF_MAX != (c = rofffindtok(*argv))) { |
(c = rofffindcallable(*argv))) |
if (ROFF_CALLABLE & tokens[c].flags) { |
if ( ! (*tokens[c].cb)(c, tree, |
/* Call to token. */ |
argv + 1, ROFF_ENTER)) |
if ( ! (*tokens[c].cb)(tree, (const char **)argv + 1, ROFF_ENTER)) |
return(0); |
return(0); |
|
} |
/* TODO: print token. */ |
/* Print token. */ |
argv++; |
} else { |
} |
/* Print token. */ |
|
} |
if ( ! ((*tree->roffout)(tok))) |
} else { |
return(0); |
/* Print token. */ |
|
|
return((*tree->roffblkin)(tok)); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
roff_text(ROFFCALL_ARGS) |
|
{ |
|
int i, c, argcp[ROFF_MAXARG]; |
|
char *v, *argvp[ROFF_MAXARG]; |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
|
warnx("%s: macro `%s' called in prelude (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
i = 0; |
|
while (-1 != (c = roffnextopt(&argv, &v))) { |
|
if (ROFF_ARGMAX == c) { |
|
warnx("%s: error parsing `%s' args (line %zu)", |
|
tree->rbuf->name, |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
} |
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
argv++; |
argv++; |
} |
} |
|
|
/* Print footer. */ |
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
|
return(0); |
|
|
dbg_leave(tree->args, ROFF_An); |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
/* TODO: print all tokens. */ |
|
return((*tree->roffout)(tok)); |
|
} |
|
|
return(1); |
while (*argv) { |
} |
if (2 >= strlen(*argv) && ROFF_MAX != |
|
(c = rofffindcallable(*argv))) |
|
if ( ! (*tokens[c].cb)(c, tree, |
|
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
|
argv++; |
|
} |
|
|
|
return((*tree->roffout)(tok)); |
|
} |