version 1.16, 2008/11/28 18:15:29 |
version 1.25, 2008/11/30 23:05:57 |
|
|
|
|
/* FIXME: warn about empty lists. */ |
/* FIXME: warn about empty lists. */ |
|
|
/* FIXME: ; : } ) (etc.) after text macros? */ |
/* FIXME: roff_layout and roff_text have identical-ish lower bodies. */ |
|
|
/* FIXME: NAME section needs specific elements. */ |
/* FIXME: NAME section needs specific elements. */ |
|
|
|
|
|
|
#define ROFFCALL_ARGS \ |
#define ROFFCALL_ARGS \ |
int tok, struct rofftree *tree, \ |
int tok, struct rofftree *tree, \ |
const char *argv[], enum roffd type |
char *argv[], enum roffd type |
|
|
struct rofftree; |
struct rofftree; |
|
|
|
|
int flags; |
int flags; |
#define ROFF_PARSED (1 << 0) /* "Parsed". */ |
#define ROFF_PARSED (1 << 0) /* "Parsed". */ |
#define ROFF_CALLABLE (1 << 1) /* "Callable". */ |
#define ROFF_CALLABLE (1 << 1) /* "Callable". */ |
#define ROFF_QUOTES (1 << 2) /* Quoted args. */ |
#define ROFF_SHALLOW (1 << 2) /* Nesting block. */ |
#define ROFF_SHALLOW (1 << 3) /* Nesting block. */ |
|
}; |
}; |
|
|
struct roffarg { |
struct roffarg { |
Line 129 static int roffargs(const struct rofftree *, |
|
Line 128 static int roffargs(const struct rofftree *, |
|
int, char *, char **); |
int, char *, char **); |
static int roffargok(int, int); |
static int roffargok(int, int); |
static int roffnextopt(const struct rofftree *, |
static int roffnextopt(const struct rofftree *, |
int, const char ***, char **); |
int, char ***, char **); |
static int roffparse(struct rofftree *, char *, size_t); |
static int roffparse(struct rofftree *, char *); |
static int textparse(const struct rofftree *, |
static int textparse(const struct rofftree *, char *); |
const char *, size_t); |
|
|
|
|
|
static const int roffarg_An[] = { ROFF_Split, ROFF_Nosplit, |
static const int roffarg_An[] = { ROFF_Split, ROFF_Nosplit, |
Line 178 static const struct rofftok tokens[ROFF_MAX] = { |
|
Line 176 static const struct rofftok tokens[ROFF_MAX] = { |
|
{roff_comment, NULL, NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */ |
{roff_comment, NULL, NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */ |
{ roff_Dd, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dd */ |
{ roff_Dd, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dd */ |
{ roff_Dt, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dt */ |
{ roff_Dt, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dt */ |
{ roff_Os, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_QUOTES }, /* Os */ |
{ roff_Os, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Os */ |
{ roff_layout, NULL, NULL, NULL, ROFF_Sh, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
{ roff_layout, NULL, NULL, NULL, ROFF_Sh, ROFF_LAYOUT, 0 }, /* Sh */ |
{ roff_layout, NULL, NULL, NULL, ROFF_Ss, ROFF_LAYOUT, ROFF_PARSED }, /* Ss */ |
{ roff_layout, NULL, NULL, NULL, ROFF_Ss, ROFF_LAYOUT, 0 }, /* Ss */ |
{ roff_text, NULL, NULL, NULL, ROFF_Pp, ROFF_TEXT, 0 }, /* Pp */ |
{ roff_text, NULL, NULL, NULL, ROFF_Pp, ROFF_TEXT, 0 }, /* Pp */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* D1 */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* D1 */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Dl */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Dl */ |
Line 188 static const struct rofftok tokens[ROFF_MAX] = { |
|
Line 186 static const struct rofftok tokens[ROFF_MAX] = { |
|
{ roff_close, NULL, NULL, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */ |
{ roff_close, NULL, NULL, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */ |
{ roff_layout, roffarg_Bl, NULL, roffchild_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */ |
{ roff_layout, roffarg_Bl, NULL, roffchild_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */ |
{ roff_close, NULL, roffparent_El, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */ |
{ roff_close, NULL, roffparent_El, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */ |
{ roff_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, ROFF_SHALLOW }, /* It */ |
{ roff_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, ROFF_PARSED | ROFF_SHALLOW }, /* It */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ /* FIXME */ |
{ roff_text, roffarg_An, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* An */ |
{ roff_text, roffarg_An, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* An */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_QUOTES }, /* Cd */ /* XXX man.4 only */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ /* XXX man.4 only */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ /* XXX needs arg */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ /* XXX needs arg */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ /* XXX needs arg */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ /* XXX needs arg */ |
Line 206 static const struct rofftok tokens[ROFF_MAX] = { |
|
Line 204 static const struct rofftok tokens[ROFF_MAX] = { |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ /* XXX needs arg */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ /* XXX needs arg */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* In */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* In */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_QUOTES }, /* Nd */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Nd */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ /* FIXME */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ /* FIXME */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */ |
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ot */ /* XXX deprecated */ |
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ot */ /* XXX deprecated */ |
Line 234 static const struct rofftok tokens[ROFF_MAX] = { |
|
Line 232 static const struct rofftok tokens[ROFF_MAX] = { |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */ |
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ /* FIXME */ |
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ /* FIXME */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */ |
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
{roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Db */ |
{roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Db */ |
Line 285 static const int tokenargs[ROFF_ARGMAX] = { |
|
Line 283 static const int tokenargs[ROFF_ARGMAX] = { |
|
0, ROFF_VALUE, ROFF_VALUE, 0, |
0, ROFF_VALUE, ROFF_VALUE, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
|
0, 0, ROFF_VALUE, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
Line 295 static const int tokenargs[ROFF_ARGMAX] = { |
|
Line 294 static const int tokenargs[ROFF_ARGMAX] = { |
|
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, 0, 0, 0, |
|
}; |
}; |
|
|
const char *const toknamesp[ROFF_MAX] = { |
const char *const toknamesp[ROFF_MAX] = { |
Line 309 const char *const toknamesp[ROFF_MAX] = { |
|
Line 307 const char *const toknamesp[ROFF_MAX] = { |
|
"Ic", "In", "Li", "Nd", |
"Ic", "In", "Li", "Nd", |
"Nm", "Op", "Ot", "Pa", |
"Nm", "Op", "Ot", "Pa", |
"Rv", "St", "Va", "Vt", |
"Rv", "St", "Va", "Vt", |
|
/* LINTED */ |
"Xr", "\%A", "\%B", "\%D", |
"Xr", "\%A", "\%B", "\%D", |
|
/* LINTED */ |
"\%I", "\%J", "\%N", "\%O", |
"\%I", "\%J", "\%N", "\%O", |
|
/* LINTED */ |
"\%P", "\%R", "\%T", "\%V", |
"\%P", "\%R", "\%T", "\%V", |
"Ac", "Ao", "Aq", "At", |
"Ac", "Ao", "Aq", "At", |
"Bc", "Bf", "Bo", "Bq", |
"Bc", "Bf", "Bo", "Bq", |
Line 360 roff_free(struct rofftree *tree, int flush) |
|
Line 361 roff_free(struct rofftree *tree, int flush) |
|
int error, t; |
int error, t; |
struct roffnode *n; |
struct roffnode *n; |
|
|
|
error = 0; |
|
|
if ( ! flush) |
if ( ! flush) |
goto end; |
goto end; |
|
|
Line 372 roff_free(struct rofftree *tree, int flush) |
|
Line 375 roff_free(struct rofftree *tree, int flush) |
|
|
|
for (n = tree->last; n->parent; n = n->parent) { |
for (n = tree->last; n->parent; n = n->parent) { |
if (0 != tokens[n->tok].ctx) |
if (0 != tokens[n->tok].ctx) |
break; |
continue; |
roff_warn(tree, NULL, "closing explicit scope `%s'", |
roff_warn(tree, NULL, "closing explicit scope `%s'", |
toknames[n->tok]); |
toknames[n->tok]); |
goto end; |
goto end; |
Line 384 roff_free(struct rofftree *tree, int flush) |
|
Line 387 roff_free(struct rofftree *tree, int flush) |
|
goto end; |
goto end; |
} |
} |
|
|
if ( ! (*tree->cb.roffhead)(tree->arg)) |
|
goto end; |
|
|
|
error = 0; |
error = 0; |
|
|
end: |
end: |
|
|
roffnode_free(tree); |
roffnode_free(tree); |
|
|
free(tree); |
free(tree); |
|
|
return(error ? 0 : 1); |
return(error ? 0 : 1); |
} |
} |
|
|
Line 404 roff_alloc(const struct roffcb *cb, void *args) |
|
Line 405 roff_alloc(const struct roffcb *cb, void *args) |
|
{ |
{ |
struct rofftree *tree; |
struct rofftree *tree; |
|
|
|
assert(args); |
|
assert(cb); |
|
|
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
err(1, "calloc"); |
err(1, "calloc"); |
|
|
Line 412 roff_alloc(const struct roffcb *cb, void *args) |
|
Line 416 roff_alloc(const struct roffcb *cb, void *args) |
|
|
|
(void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
(void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
|
|
if ( ! (*tree->cb.roffhead)(args)) { |
|
free(tree); |
|
return(NULL); |
|
} |
|
|
|
return(tree); |
return(tree); |
} |
} |
|
|
|
|
int |
int |
roff_engine(struct rofftree *tree, char *buf, size_t sz) |
roff_engine(struct rofftree *tree, char *buf) |
{ |
{ |
|
|
tree->cur = NULL; |
tree->cur = buf; |
|
assert(buf); |
|
|
if (0 == sz) { |
if (0 == *buf) { |
roff_warn(tree, buf, "blank line"); |
roff_warn(tree, buf, "blank line"); |
return(0); |
return(0); |
} else if ('.' != *buf) |
} else if ('.' != *buf) |
return(textparse(tree, buf, sz)); |
return(textparse(tree, buf)); |
|
|
return(roffparse(tree, buf, sz)); |
return(roffparse(tree, buf)); |
} |
} |
|
|
|
|
static int |
static int |
textparse(const struct rofftree *tree, const char *buf, size_t sz) |
textparse(const struct rofftree *tree, char *buf) |
{ |
{ |
|
|
/* Print text. */ |
return((*tree->cb.roffdata)(tree->arg, 1, buf)); |
return(1); |
|
} |
} |
|
|
|
|
Line 512 roffscan(int tok, const int *tokv) |
|
Line 511 roffscan(int tok, const int *tokv) |
|
|
|
|
|
static int |
static int |
roffparse(struct rofftree *tree, char *buf, size_t sz) |
roffparse(struct rofftree *tree, char *buf) |
{ |
{ |
int tok, t; |
int tok, t; |
struct roffnode *n; |
struct roffnode *n; |
char *argv[ROFF_MAXARG]; |
char *argv[ROFF_MAXARG]; |
const char **argvp; |
char **argvp; |
|
|
assert(sz > 0); |
if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2)) |
|
if (0 == strncmp(buf, ".\\\"", 3)) |
|
return(1); |
|
|
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
roff_err(tree, buf + 1, "bogus line macro"); |
roff_err(tree, buf + 1, "bogus line macro"); |
Line 528 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 529 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
roff_err(tree, buf + 1, "unsupported macro `%s'", |
roff_err(tree, buf + 1, "unsupported macro `%s'", |
toknames[tok]); |
toknames[tok]); |
return(0); |
return(0); |
} else if (ROFF_COMMENT == tokens[tok].type) |
} |
return(1); |
|
|
assert(ROFF___ != tok); |
if ( ! roffargs(tree, tok, buf, argv)) |
if ( ! roffargs(tree, tok, buf, argv)) |
return(0); |
return(0); |
|
|
argvp = (const char **)argv; |
argvp = (char **)argv; |
|
|
/* |
/* |
* Prelude macros break some assumptions, so branch now. |
* Prelude macros break some assumptions, so branch now. |
Line 561 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 562 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
} |
} |
|
|
if ( ! roffscan(tok, tokens[tree->last->tok].children)) { |
if ( ! roffscan(tok, tokens[tree->last->tok].children)) { |
roff_err(tree, *argvp, "`%s' is invalid child `%s'", |
roff_err(tree, *argvp, "`%s' is invalid child of `%s'", |
toknames[tree->last->tok], |
toknames[tok], |
toknames[tok]); |
toknames[tree->last->tok]); |
return(0); |
return(0); |
} |
} |
|
|
|
|
rofffindtok(const char *buf) |
rofffindtok(const char *buf) |
{ |
{ |
char token[4]; |
char token[4]; |
size_t i; |
int i; |
|
|
for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
token[i] = *buf; |
token[i] = *buf; |
Line 700 rofffindtok(const char *buf) |
|
Line 701 rofffindtok(const char *buf) |
|
|
|
|
|
static int |
static int |
|
roffispunct(const char *p) |
|
{ |
|
|
|
if (0 == *p) |
|
return(0); |
|
if (0 != *(p + 1)) |
|
return(0); |
|
|
|
switch (*p) { |
|
case('{'): |
|
/* FALLTHROUGH */ |
|
case('.'): |
|
/* FALLTHROUGH */ |
|
case(','): |
|
/* FALLTHROUGH */ |
|
case(';'): |
|
/* FALLTHROUGH */ |
|
case(':'): |
|
/* FALLTHROUGH */ |
|
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case('('): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
|
|
return(0); |
|
} |
|
|
|
|
|
static int |
rofffindcallable(const char *name) |
rofffindcallable(const char *name) |
{ |
{ |
int c; |
int c; |
Line 758 roffnode_free(struct rofftree *tree) |
|
Line 801 roffnode_free(struct rofftree *tree) |
|
|
|
static int |
static int |
roffnextopt(const struct rofftree *tree, int tok, |
roffnextopt(const struct rofftree *tree, int tok, |
const char ***in, char **val) |
char ***in, char **val) |
{ |
{ |
const char *arg, **argv; |
char *arg, **argv; |
int v; |
int v; |
|
|
*val = NULL; |
*val = NULL; |
Line 867 roff_Os(ROFFCALL_ARGS) |
|
Line 910 roff_Os(ROFFCALL_ARGS) |
|
{ |
{ |
|
|
if (ROFF_EXIT == type) { |
if (ROFF_EXIT == type) { |
assert(ROFF_PRELUDE_Os & tree->state); |
roffnode_free(tree); |
return(roff_layout(tok, tree, argv, type)); |
return((*tree->cb.rofftail)(tree->arg)); |
} else if (ROFF_BODY & tree->state) { |
} else if (ROFF_BODY & tree->state) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert(ROFF_PRELUDE_Os & tree->state); |
assert(ROFF_PRELUDE_Os & tree->state); |
Line 890 roff_Os(ROFFCALL_ARGS) |
|
Line 933 roff_Os(ROFFCALL_ARGS) |
|
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
|
|
return(roff_layout(tok, tree, argv, type)); |
if (NULL == roffnode_new(tok, tree)) |
|
return(0); |
|
|
|
return((*tree->cb.roffhead)(tree->arg)); |
} |
} |
|
|
|
|
Line 931 roff_layout(ROFFCALL_ARGS) |
|
Line 977 roff_layout(ROFFCALL_ARGS) |
|
if (NULL == roffnode_new(tok, tree)) |
if (NULL == roffnode_new(tok, tree)) |
return(0); |
return(0); |
|
|
|
if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp)) |
|
return(0); |
|
|
|
if (NULL == *argv) |
|
return(1); |
|
|
if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp)) |
if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp)) |
return(0); |
return(0); |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
i = 0; |
while (*argv) { |
while (*argv) { |
if ( ! (*tree->cb.roffdata) |
if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++)) |
(tree->arg, *argv++)) |
|
return(0); |
return(0); |
|
i = 1; |
} |
} |
|
return((*tree->cb.roffout)(tree->arg, tok)); |
if ( ! ((*tree->cb.roffout)(tree->arg, tok))) |
|
return(0); |
|
return((*tree->cb.roffblkin)(tree->arg, tok)); |
|
} |
} |
|
|
|
i = 0; |
while (*argv) { |
while (*argv) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (NULL == tokens[c].cb) { |
if (NULL == tokens[c].cb) { |
Line 959 roff_layout(ROFFCALL_ARGS) |
|
Line 1010 roff_layout(ROFFCALL_ARGS) |
|
break; |
break; |
} |
} |
|
|
if ( ! (*tree->cb.roffdata)(tree->arg, *argv++)) |
assert(tree->arg); |
|
if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++)) |
return(0); |
return(0); |
|
i = 1; |
} |
} |
|
|
if ( ! ((*tree->cb.roffout)(tree->arg, tok))) |
/* |
return(0); |
* If we're the first parser (*argv == tree->cur) then purge out |
return((*tree->cb.roffblkin)(tree->arg, tok)); |
* any additional punctuation, should there be any remaining at |
|
* the end of line. |
|
*/ |
|
|
|
if (ROFF_PARSED & tokens[tok].flags && *argv) { |
|
i = 0; |
|
while (argv[i]) |
|
i++; |
|
|
|
assert(i > 0); |
|
if ( ! roffispunct(argv[--i])) |
|
return((*tree->cb.roffout)(tree->arg, tok)); |
|
|
|
while (i >= 0 && roffispunct(argv[i])) |
|
i--; |
|
|
|
assert(0 != i); |
|
i++; |
|
|
|
/* LINTED */ |
|
while (argv[i]) |
|
if ( ! (*tree->cb.roffdata)(tree->arg, 0, argv[i++])) |
|
return(0); |
|
} |
|
|
|
return((*tree->cb.roffout)(tree->arg, tok)); |
} |
} |
|
|
|
|
Line 973 roff_layout(ROFFCALL_ARGS) |
|
Line 1051 roff_layout(ROFFCALL_ARGS) |
|
static int |
static int |
roff_text(ROFFCALL_ARGS) |
roff_text(ROFFCALL_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
int i, j, first, c, argcp[ROFF_MAXARG]; |
char *v, *argvp[ROFF_MAXARG]; |
char *v, *argvp[ROFF_MAXARG]; |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) { |
Line 982 roff_text(ROFFCALL_ARGS) |
|
Line 1060 roff_text(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
|
/* FIXME: breaks if passed from roff_layout. */ |
|
first = *argv == tree->cur; |
|
|
i = 0; |
i = 0; |
argv++; |
argv++; |
|
|
Line 1002 roff_text(ROFFCALL_ARGS) |
|
Line 1083 roff_text(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
i = 0; |
while (*argv) { |
while (*argv) { |
if ( ! (*tree->cb.roffdata)(tree->arg, *argv++)) |
if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++)) |
return(0); |
return(0); |
|
i = 1; |
} |
} |
return((*tree->cb.roffout)(tree->arg, tok)); |
return((*tree->cb.roffout)(tree->arg, tok)); |
} |
} |
|
|
|
i = 0; |
while (*argv) { |
while (*argv) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
if (NULL == tokens[c].cb) { |
/* |
roff_err(tree, *argv, "unsupported " |
* If all that remains is roff punctuation, then |
"macro `%s'", |
* close out our scope and return. |
toknames[c]); |
*/ |
return(0); |
if (roffispunct(*argv)) { |
|
for (j = 0; argv[j]; j++) |
|
if ( ! roffispunct(argv[j])) |
|
break; |
|
if (NULL == argv[j]) |
|
break; |
|
i = 1; |
} |
} |
if ( ! (*tokens[c].cb)(c, tree, |
|
argv, ROFF_ENTER)) |
if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++)) |
return(0); |
return(0); |
break; |
|
|
i = 1; |
|
continue; |
} |
} |
if ( ! (*tree->cb.roffdata)(tree->arg, *argv++)) |
|
|
/* |
|
* A sub-command has been found. Execute it and |
|
* discontinue parsing for arguments. |
|
*/ |
|
|
|
if (NULL == tokens[c].cb) { |
|
roff_err(tree, *argv, "unsupported macro `%s'", |
|
toknames[c]); |
return(0); |
return(0); |
|
} |
|
|
|
if ( ! (*tokens[c].cb)(c, tree, argv, ROFF_ENTER)) |
|
return(0); |
|
|
|
break; |
} |
} |
|
|
return((*tree->cb.roffout)(tree->arg, tok)); |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
|
|
/* |
|
* If we're the first parser (*argv == tree->cur) then purge out |
|
* any additional punctuation, should there be any remaining at |
|
* the end of line. |
|
*/ |
|
|
|
if (first && *argv) { |
|
i = 0; |
|
while (argv[i]) |
|
i++; |
|
|
|
assert(i > 0); |
|
if ( ! roffispunct(argv[--i])) |
|
return(1); |
|
|
|
while (i >= 0 && roffispunct(argv[i])) |
|
i--; |
|
|
|
assert(0 != i); |
|
i++; |
|
|
|
/* LINTED */ |
|
while (argv[i]) |
|
if ( ! (*tree->cb.roffdata)(tree->arg, 0, argv[i++])) |
|
return(0); |
|
} |
|
|
|
return(1); |
} |
} |
|
|
|
|