mandoc/roff.c - diff

Return to roff.c CVS log

Up to [cvsweb.bsd.lv] / mandoc

Diff for /mandoc/roff.c between version 1.27 and 1.31

version 1.27, 2008/12/01 15:32:36

version 1.31, 2008/12/02 00:10:37

Line 16

* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR

* PERFORMANCE OF THIS SOFTWARE.

#include <sys/param.h>

#include <assert.h>

#include <ctype.h>

#include <err.h>

Line 90 struct rofftree {

Line 92 struct rofftree {

struct roffnode *last; /* Last parsed node. */

char *cur;

time_t date; /* `Dd' results. */

struct tm tm; /* `Dd' results. */

char os[64]; /* `Os' results. */

char title[64]; /* `Dt' results. */

char section[64]; /* `Dt' results. */

Line 110 struct rofftree {

Line 112 struct rofftree {

static int roff_Dd(ROFFCALL_ARGS);

static int roff_Dt(ROFFCALL_ARGS);

static int roff_Os(ROFFCALL_ARGS);

static int roff_Ns(ROFFCALL_ARGS);

static int roff_layout(ROFFCALL_ARGS);

static int roff_text(ROFFCALL_ARGS);

Line 124 static void roff_warn(const struct rofftree *,

Line 127 static void roff_warn(const struct rofftree *,

static void roff_err(const struct rofftree *,

const char *, char *, ...);

static int roffpurgepunct(struct rofftree *, char **);

static int roffscan(int, const int *);

static int rofffindtok(const char *);

static int rofffindarg(const char *);

Line 166 static const int roffarg_St[] = {

Line 170 static const int roffarg_St[] = {

static const int roffchild_Bl[] = { ROFF_It, ROFF_El, ROFF_MAX };

static const int roffchild_Fo[] = { ROFF_Fa, ROFF_Fc, ROFF_MAX };

static const int roffchild_Oo[] = { ROFF_Op, ROFF_Oc, ROFF_MAX };

static const int roffchild_Rs[] = { ROFF_Re, ROFF__A, ROFF__B,

ROFF__D, ROFF__I, ROFF__J, ROFF__N, ROFF__O, ROFF__P,

ROFF__R, ROFF__T, ROFF__V, ROFF_MAX };

static const int roffparent_El[] = { ROFF_Bl, ROFF_It, ROFF_MAX };

static const int roffparent_Fc[] = { ROFF_Fo, ROFF_Fa, ROFF_MAX };

static const int roffparent_Oc[] = { ROFF_Oo, ROFF_Oc, ROFF_MAX };

static const int roffparent_Oc[] = { ROFF_Oo, ROFF_MAX };

static const int roffparent_It[] = { ROFF_Bl, ROFF_It, ROFF_MAX };

static const int roffparent_Re[] = { ROFF_Rs, ROFF_MAX };

Line 236 static const struct rofftok tokens[ROFF_MAX] = {

Line 239 static const struct rofftok tokens[ROFF_MAX] = {

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Aq */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* At */ /* XXX at most 2 args */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ /* FIXME */

{ roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 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 | ROFF_LSCOPE }, /* Bq */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */

Line 246 static const struct rofftok tokens[ROFF_MAX] = {

Line 249 static const struct rofftok tokens[ROFF_MAX] = {

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Dq */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ef */ /* FIXME */

{ roff_noop, NULL, NULL, NULL, ROFF_Bf, ROFF_LAYOUT, 0 }, /* Ef */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ /* XXX needs arg */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ms */

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* No */

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */

{ roff_Ns, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */

{ roff_text, NULL, NULL, NULL, 0, ROFF_LAYOUT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Pq */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */

{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */

Line 277 static const struct rofftok tokens[ROFF_MAX] = {

Line 280 static const struct rofftok tokens[ROFF_MAX] = {

{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */

{ roff_layout, NULL, NULL, roffchild_Fo, 0, ROFF_LAYOUT, 0 }, /* Fo */

{ roff_noop, NULL, roffparent_Fc, NULL, ROFF_Fo, ROFF_LAYOUT, 0 }, /* Fc */

{ roff_layout, NULL, NULL, roffchild_Oo, 0, ROFF_LAYOUT, 0 }, /* Oo */

{ roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Oo */

{ roff_noop, NULL, roffparent_Oc, NULL, ROFF_Oo, ROFF_LAYOUT, 0 }, /* Oc */

{ roff_layout, roffarg_Bk, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bk */

{ roff_noop, NULL, NULL, NULL, ROFF_Bk, ROFF_LAYOUT, 0 }, /* Ek */

Line 380 roff_free(struct rofftree *tree, int flush)

Line 383 roff_free(struct rofftree *tree, int flush)

error = 1;

if (ROFF_PRELUDE & tree->state) {

roff_warn(tree, NULL, "prelude never finished");

roff_err(tree, NULL, "prelude never finished");

goto end;

}

for (n = tree->last; n->parent; n = n->parent) {

for (n = tree->last; n; n = n->parent) {

if (0 != tokens[n->tok].ctx)

continue;

roff_warn(tree, NULL, "closing explicit scope `%s'",

roff_err(tree, NULL, "closing explicit scope `%s'",

toknames[n->tok]);

goto end;

}

Line 398 roff_free(struct rofftree *tree, int flush)

Line 401 roff_free(struct rofftree *tree, int flush)

goto end;

}

if ( ! (*tree->cb.rofftail)(tree->arg))

goto end;

error = 0;

end:

Line 439 roff_engine(struct rofftree *tree, char *buf)

Line 445 roff_engine(struct rofftree *tree, char *buf)

assert(buf);

if (0 == *buf) {

roff_warn(tree, buf, "blank line");

roff_err(tree, buf, "blank line");

return(0);

} else if ('.' != *buf)

return(textparse(tree, buf));

Line 452 static int

Line 458 static int

textparse(const struct rofftree *tree, char *buf)

{

if ( ! (ROFF_BODY & tree->state)) {

roff_err(tree, buf, "data not in body");

return(0);

}

return((*tree->cb.roffdata)(tree->arg, 1, buf));

}

Line 554 roffparse(struct rofftree *tree, char *buf)

Line 564 roffparse(struct rofftree *tree, char *buf)

if (ROFF_PRELUDE & tree->state) {

assert(NULL == tree->last);

return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));

} else

}

assert(tree->last);

assert(ROFF_BODY & tree->state);

Line 564 roffparse(struct rofftree *tree, char *buf)

Line 573 roffparse(struct rofftree *tree, char *buf)

* children are satisfied.

if ( ! roffscan(tree->last->tok, tokens[tok].parents)) {

if (tree->last && ! roffscan

(tree->last->tok, tokens[tok].parents)) {

roff_err(tree, *argvp, "`%s' has invalid parent `%s'",

toknames[tok],

toknames[tree->last->tok]);

return(0);

}

if ( ! roffscan(tok, tokens[tree->last->tok].children)) {

if (tree->last && ! roffscan

(tok, tokens[tree->last->tok].children)) {

roff_err(tree, *argvp, "`%s' is invalid child of `%s'",

toknames[tok],

toknames[tree->last->tok]);

Line 614 roffparse(struct rofftree *tree, char *buf)

Line 625 roffparse(struct rofftree *tree, char *buf)

n = NULL;

break;

}

if (tokens[n->tok].ctx == n->tok)

continue;

roff_err(tree, *argv, "`%s' breaks `%s' scope",

toknames[tok], toknames[n->tok]);

return(0);

}

Line 647 roffparse(struct rofftree *tree, char *buf)

Line 663 roffparse(struct rofftree *tree, char *buf)

* In this, the `El' tag closes out the scope of `Bl'.

assert(tree->last);

assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx);

for (n = tree->last; n; n = n->parent)

if (n->tok != tokens[tok].ctx) {

if (n->tok == tokens[n->tok].ctx)

continue;

roff_err(tree, *argv, "`%s' breaks `%s' scope",

toknames[tok], toknames[n->tok]);

return(0);

} else

break;

if (NULL == n) {

roff_err(tree, *argv, "`%s' has no starting tag `%s'",

toknames[tok],

toknames[tokens[tok].ctx]);

return(0);

}

/* LINTED */

do {

t = tree->last->tok;

Line 657 roffparse(struct rofftree *tree, char *buf)

Line 690 roffparse(struct rofftree *tree, char *buf)

return(0);

} while (t != tokens[tok].ctx);

assert(tree->last);

return(1);

}

Line 848 roffnextopt(const struct rofftree *tree, int tok,

Line 880 roffnextopt(const struct rofftree *tree, int tok,

static int

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 ( ! (*tree->cb.roffdata)(tree->arg, 0, argv[i++]))

return(0);

return(1);

}

static int

roffparseopts(struct rofftree *tree, int tok,

char ***args, int *argc, char **argv)

{

Line 876 roffparseopts(struct rofftree *tree, int tok,

Line 931 roffparseopts(struct rofftree *tree, int tok,

static int

roff_Dd(ROFFCALL_ARGS)

{

time_t t;

char *p, buf[32];

if (ROFF_BODY & tree->state) {

assert( ! (ROFF_PRELUDE & tree->state));

Line 894 roff_Dd(ROFFCALL_ARGS)

Line 951 roff_Dd(ROFFCALL_ARGS)

return(0);

}

/* TODO: parse date. */

assert(NULL == tree->last);

tree->state |= ROFF_PRELUDE_Dd;

argv++;

if (0 == strcmp(*argv, "$Mdocdate$")) {

t = time(NULL);

if (NULL == localtime_r(&t, &tree->tm))

err(1, "localtime_r");

tree->state |= ROFF_PRELUDE_Dd;

return(1);

}

/* Build this from Mdocdate or raw date. */

buf[0] = 0;

p = *argv;

if (0 != strcmp(*argv, "$Mdocdate:")) {

while (*argv) {

if (strlcat(buf, *argv++, sizeof(buf))

< sizeof(buf))

continue;

roff_err(tree, p, "bad `Dd' date");

return(0);

}

if (strptime(buf, "%b%d,%Y", &tree->tm)) {

tree->state |= ROFF_PRELUDE_Dd;

return(1);

}

roff_err(tree, *argv, "bad `Dd' date");

return(0);

}

argv++;

while (*argv && **argv != '$') {

if (strlcat(buf, *argv++, sizeof(buf))

>= sizeof(buf)) {

roff_err(tree, p, "bad `Dd' Mdocdate");

return(0);

}

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)) {

roff_err(tree, *argv, "bad `Dd' Mdocdate");

return(0);

}

tree->state |= ROFF_PRELUDE_Dd;

return(1);

}

Line 925 roff_Dt(ROFFCALL_ARGS)

Line 1034 roff_Dt(ROFFCALL_ARGS)

return(0);

}

/* TODO: parse date. */

argv++;

if (NULL == *argv) {

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);

}

argv++;

if (NULL == *argv) {

roff_err(tree, *argv, "`Dt' needs section");

return(0);

} else if (strlcpy(tree->section, *argv, sizeof(tree->section))

>= sizeof(tree->section)) {

roff_err(tree, *argv, "`Dt' section too long");

return(0);

}

argv++;

if (NULL == *argv) {

tree->volume[0] = 0;

} else if (strlcpy(tree->volume, *argv, sizeof(tree->volume))

>= sizeof(tree->volume)) {

roff_err(tree, *argv, "`Dt' volume too long");

return(0);

}

assert(NULL == tree->last);

tree->state |= ROFF_PRELUDE_Dt;

Line 936 roff_Dt(ROFFCALL_ARGS)

Line 1072 roff_Dt(ROFFCALL_ARGS)

/* ARGSUSED */

static int

roff_Ns(ROFFCALL_ARGS)

{

int j, c, first;

first = (*argv == tree->cur);

argv++;

if (ROFF_MAX != (c = rofffindcallable(*argv))) {

if (NULL == tokens[c].cb) {

roff_err(tree, *argv, "unsupported macro `%s'",

toknames[c]);

return(0);

}

if ( ! (*tree->cb.roffspecial)(tree->arg, tok))

return(0);

if ( ! (*tokens[c].cb)(c, tree, argv, ROFF_ENTER))

return(0);

if ( ! first)

return(1);

return(roffpurgepunct(tree, argv));

}

if ( ! (*tree->cb.roffdata)(tree->arg, 0, *argv++))

return(0);

while (*argv) {

if (ROFF_MAX == (c = rofffindcallable(*argv))) {

if ( ! roffispunct(*argv)) {

if ( ! (*tree->cb.roffdata)

(tree->arg, 1, *argv++))

return(0);

continue;

}

/* FIXME: this is identical to that of

* roff_text. */

/* See if only punctuation remains. */

for (j = 0; argv[j]; j++)

if ( ! roffispunct(argv[j]))

break;

if (argv[j]) {

if ( ! (*tree->cb.roffdata)

(tree->arg, 0, *argv++))

return(0);

continue;

}

/* Only punctuation remains. */

break;

}

if (NULL == tokens[c].cb) {

roff_err(tree, *argv, "unsupported macro `%s'",

toknames[c]);

return(0);

}

if ( ! (*tokens[c].cb)(c, tree, argv, ROFF_ENTER))

return(0);

break;

}

if ( ! first)

return(1);

return(roffpurgepunct(tree, argv));

}

/* ARGSUSED */

static int

roff_Os(ROFFCALL_ARGS)

{

char *p;

if (ROFF_EXIT == type) {

if (ROFF_BODY & tree->state) {

roffnode_free(tree);

return((*tree->cb.rofftail)(tree->arg));

} else if (ROFF_BODY & tree->state) {

assert( ! (ROFF_PRELUDE & tree->state));

assert(ROFF_PRELUDE_Os & tree->state);

return(roff_text(tok, tree, argv, type));

Line 955 roff_Os(ROFFCALL_ARGS)

Line 1162 roff_Os(ROFFCALL_ARGS)

return(0);

}

/* TODO: extract OS. */

tree->os[0] = 0;

p = *++argv;

while (*argv) {

if (strlcat(tree->os, *argv++, sizeof(tree->os))

< sizeof(tree->os))

continue;

roff_err(tree, p, "`Os' value too long");

return(0);

}

if (0 == tree->os[0])

if (strlcpy(tree->os, "LOCAL", sizeof(tree->os))

>= sizeof(tree->os)) {

roff_err(tree, p, "`Os' value too long");

return(0);

}

tree->state |= ROFF_PRELUDE_Os;

tree->state &= ~ROFF_PRELUDE;

tree->state |= ROFF_BODY;

assert(NULL == tree->last);

if (NULL == roffnode_new(tok, tree))

return(0);

return((*tree->cb.roffhead)(tree->arg));

}

Line 1065 roff_layout(ROFFCALL_ARGS)

Line 1286 roff_layout(ROFFCALL_ARGS)

* a token isn't punctuation.

i = 0;

if ( ! roffpurgepunct(tree, argv))

while (argv[i])

return(0);

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 1192 roff_text(ROFFCALL_ARGS)

Line 1397 roff_text(ROFFCALL_ARGS)

if ( ! first)

return(1);

return(roffpurgepunct(tree, argv));

* We're the line-dominant macro. Check if there's remaining

* punctuation. If there is, then flush it out before exiting.

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);

}

CVSweb