version 1.1, 2008/11/24 14:24:55 |
version 1.5, 2008/11/25 16:49:57 |
|
|
|
|
#define ROFF_MAXARG 10 |
#define ROFF_MAXARG 10 |
|
|
|
/* Whether we're entering or leaving a roff scope. */ |
enum roffd { |
enum roffd { |
ROFF_ENTER = 0, |
ROFF_ENTER = 0, |
ROFF_EXIT |
ROFF_EXIT |
}; |
}; |
|
|
|
/* The type of a macro (see mdoc(7) for more). */ |
enum rofftype { |
enum rofftype { |
ROFF_TITLE, |
|
ROFF_COMMENT, |
ROFF_COMMENT, |
ROFF_TEXT, |
ROFF_TEXT, |
ROFF_LAYOUT |
ROFF_LAYOUT |
}; |
}; |
|
|
|
/* Arguments passed to a macro callback. */ |
#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; |
|
|
|
/* Describes a roff token (like D1 or Sh). */ |
struct rofftok { |
struct rofftok { |
char *name; |
int (*cb)(ROFFCALL_ARGS); /* Callback. */ |
int (*cb)(ROFFCALL_ARGS); |
const int *args; /* Args (or NULL). */ |
enum rofftype type; |
enum rofftype type; /* Type of macro. */ |
|
int symm; /* FIXME */ |
int flags; |
int flags; |
#define ROFF_NESTED (1 << 0) |
#define ROFF_NESTED (1 << 0) /* Nested-layout. */ |
#define ROFF_PARSED (1 << 1) |
#define ROFF_PARSED (1 << 1) /* "Parsed". */ |
#define ROFF_CALLABLE (1 << 2) |
#define ROFF_CALLABLE (1 << 2) /* "Callable". */ |
#define ROFF_QUOTES (1 << 3) |
#define ROFF_QUOTES (1 << 3) /* Quoted args. */ |
}; |
}; |
|
|
|
/* An argument to a roff token (like -split or -enum). */ |
struct roffarg { |
struct roffarg { |
char *name; |
|
int flags; |
int flags; |
#define ROFF_VALUE (1 << 0) |
#define ROFF_VALUE (1 << 0) /* Has a value. */ |
}; |
}; |
|
|
|
/* mdocml remembers only the current parse node and the chain leading to |
|
* the document root (scopes). |
|
*/ |
struct roffnode { |
struct roffnode { |
int tok; |
int tok; /* Token id. */ |
struct roffnode *parent; |
struct roffnode *parent; /* Parent (or NULL). */ |
size_t line; |
size_t line; /* Parsed at line. */ |
}; |
}; |
|
|
|
/* State of file parse. */ |
struct rofftree { |
struct rofftree { |
struct roffnode *last; |
struct roffnode *last; /* Last parsed node. */ |
time_t date; |
time_t date; /* `Dd' results. */ |
char title[256]; |
char os[64]; /* `Os' results. */ |
char section[256]; |
char title[64]; /* `Dt' results. */ |
char volume[256]; |
char section[64]; /* `Dt' results. */ |
|
char volume[64]; /* `Dt' results. */ |
int state; |
int state; |
#define ROFF_PRELUDE (1 << 1) |
#define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ |
#define ROFF_PRELUDE_Os (1 << 2) |
/* FIXME: if we had prev ptrs, this wouldn't be necessary. */ |
#define ROFF_PRELUDE_Dt (1 << 3) |
#define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
#define ROFF_PRELUDE_Dd (1 << 4) |
#define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
#define ROFF_BODY (1 << 5) |
#define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
struct md_mbuf *mbuf; /* NULL if ROFF_EXIT and error. */ |
#define ROFF_BODY (1 << 5) /* In roff body. */ |
|
roffin roffin; /* Text-macro cb. */ |
const struct md_args *args; |
roffblkin roffblkin; /* Block-macro cb. */ |
const struct md_rbuf *rbuf; |
roffout roffout; /* Text-macro cb. */ |
|
roffblkout roffblkout; /* Block-macro cb. */ |
|
struct md_mbuf *mbuf; /* Output (or NULL). */ |
|
const struct md_args *args; /* Global args. */ |
|
const struct md_rbuf *rbuf; /* Input. */ |
}; |
}; |
|
|
#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_layout(ROFFCALL_ARGS); |
static int roff_An(ROFFCALL_ARGS); |
static int roff_text(ROFFCALL_ARGS); |
static int roff_Li(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, size_t, |
static struct roffnode *roffnode_new(int, struct rofftree *); |
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 roffargok(int, int); |
|
static int roffnextopt(int, const 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); |
/* Arguments for `An' macro. */ |
static void dbg_leave(const struct md_args *, int); |
static const int roffarg_An[] = { |
|
ROFF_Split, ROFF_Nosplit, ROFF_ARGMAX }; |
|
/* Arguments for `Bd' macro. */ |
|
static const int roffarg_Bd[] = { |
|
ROFF_Ragged, ROFF_Unfilled, ROFF_Literal, ROFF_File, |
|
ROFF_Offset, ROFF_ARGMAX }; |
|
/* Arguments for `Bl' macro. */ |
|
static const int roffarg_Bl[] = { |
|
ROFF_Bullet, ROFF_Dash, ROFF_Hyphen, ROFF_Item, ROFF_Enum, |
|
ROFF_Tag, ROFF_Diag, ROFF_Hang, ROFF_Ohang, ROFF_Inset, |
|
ROFF_Column, ROFF_Offset, ROFF_ARGMAX }; |
|
|
|
/* FIXME: a big list of fixes that must occur. |
|
* |
|
* (1) Distinction not between ROFF_TEXT and ROFF_LAYOUT, but instead |
|
* ROFF_ATOM and ROFF_NODE, which designate line spacing. If |
|
* ROFF_ATOM, we need not remember any state. |
|
* |
|
* (2) Have a maybe-NULL list of possible subsequent children for each |
|
* node. Bl, e.g., can only have It children (roffparse). |
|
* |
|
* (3) Have a maybe-NULL list of possible parents for each node. It, |
|
* e.g., can only have Bl as a parent (roffparse). |
|
* |
|
* (N.B. If (2) were complete, (3) wouldn't be necessary.) |
|
* |
|
* (4) Scope rules. If Pp exists, it closes the scope out from the |
|
* previous Pp (if it exists). Same with Sh and Ss. If El exists, |
|
* it closes out Bl and interim It. |
|
* |
|
* (5) Nesting. Sh cannot be any descendant of Sh. Bl, however, can be |
|
* nested within an It. |
|
* |
|
* Once that's done, we're golden. |
|
*/ |
|
|
static const struct rofftok tokens[ROFF_MAX] = { |
/* Table of all known tokens. */ |
{ "\\\"", NULL, ROFF_COMMENT, 0 }, |
static const struct rofftok tokens[ROFF_MAX] = { |
{ "Dd", roff_Dd, ROFF_TITLE, 0 }, |
{ NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */ |
{ "Dt", roff_Dt, ROFF_TITLE, 0 }, |
{ roff_Dd, NULL, 0, ROFF_TEXT, 0 }, /* Dd */ |
{ "Os", roff_Os, ROFF_TITLE, 0 }, |
{ roff_Dt, NULL, 0, ROFF_TEXT, 0 }, /* Dt */ |
{ "Sh", roff_Sh, ROFF_LAYOUT, 0 }, |
{ roff_Os, NULL, 0, ROFF_TEXT, 0 }, /* Os */ |
{ "An", roff_An, ROFF_TEXT, ROFF_PARSED }, |
{ roff_layout, NULL, ROFF_Sh, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
{ "Li", roff_Li, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, |
{ roff_layout, NULL, ROFF_Ss, ROFF_LAYOUT, ROFF_PARSED }, /* Ss */ |
|
{ roff_layout, NULL, ROFF_Pp, ROFF_LAYOUT, 0 }, /* Pp */ |
|
{ roff_layout, NULL, 0, ROFF_TEXT, 0 }, /* D1 */ |
|
{ roff_layout, NULL, 0, ROFF_TEXT, 0 }, /* Dl */ |
|
{ roff_layout, roffarg_Bd, 0, ROFF_LAYOUT, 0 }, /* Bd */ |
|
{ roff_layout, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */ |
|
{ roff_layout, roffarg_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */ |
|
{ roff_layout, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */ |
|
{ roff_layout, NULL, ROFF_It, ROFF_LAYOUT, 0 }, /* It */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ |
|
{ roff_text, roffarg_An, 0, ROFF_TEXT, ROFF_PARSED }, /* An */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ev */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ex */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Fd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fn */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ft */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* In */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Nd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ot */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Rv */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xr */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %D */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %N */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %O */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %P */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %R */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %V */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Aq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* At */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Db */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Ef */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ms */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* No */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Re */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Rs */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Sm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ux */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */ |
}; |
}; |
|
|
#define ROFF_Split 0 |
/* Table of all known token arguments. */ |
#define ROFF_Nosplit 1 |
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
#define ROFF_ARGMAX 2 |
{ 0 }, /* split */ |
|
{ 0 }, /* nosplit */ |
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
{ 0 }, /* ragged */ |
{ "split", 0 }, |
{ 0 }, /* unfilled */ |
{ "nosplit", 0 }, |
{ 0 }, /* literal */ |
|
{ ROFF_VALUE }, /* file */ |
|
{ ROFF_VALUE }, /* offset */ |
|
{ 0 }, /* bullet */ |
|
{ 0 }, /* dash */ |
|
{ 0 }, /* hyphen */ |
|
{ 0 }, /* item */ |
|
{ 0 }, /* enum */ |
|
{ 0 }, /* tag */ |
|
{ 0 }, /* diag */ |
|
{ 0 }, /* hang */ |
|
{ 0 }, /* ohang */ |
|
{ 0 }, /* inset */ |
|
{ 0 }, /* column */ |
|
{ 0 }, /* width */ |
|
{ 0 }, /* compact */ |
}; |
}; |
|
|
|
const char *const toknamesp[ROFF_MAX] = |
|
{ |
|
"\\\"", |
|
"Dd", /* Title macros. */ |
|
"Dt", |
|
"Os", |
|
"Sh", /* Layout macros */ |
|
"Ss", |
|
"Pp", |
|
"D1", |
|
"Dl", |
|
"Bd", |
|
"Ed", |
|
"Bl", |
|
"El", |
|
"It", |
|
"Ad", /* Text macros. */ |
|
"An", |
|
"Ar", |
|
"Cd", |
|
"Cm", |
|
"Dr", |
|
"Er", |
|
"Ev", |
|
"Ex", |
|
"Fa", |
|
"Fd", |
|
"Fl", |
|
"Fn", |
|
"Ft", |
|
"Ex", |
|
"Ic", |
|
"In", |
|
"Li", |
|
"Nd", |
|
"Nm", |
|
"Op", |
|
"Ot", |
|
"Pa", |
|
"Rv", |
|
"St", |
|
"Va", |
|
"Vt", |
|
"Xr", |
|
"\%A", /* General text macros. */ |
|
"\%B", |
|
"\%D", |
|
"\%I", |
|
"\%J", |
|
"\%N", |
|
"\%O", |
|
"\%P", |
|
"\%R", |
|
"\%T", |
|
"\%V", |
|
"Ac", |
|
"Ao", |
|
"Aq", |
|
"At", |
|
"Bc", |
|
"Bf", |
|
"Bo", |
|
"Bq", |
|
"Bsx", |
|
"Bx", |
|
"Db", |
|
"Dc", |
|
"Do", |
|
"Dq", |
|
"Ec", |
|
"Ef", |
|
"Em", |
|
"Eo", |
|
"Fx", |
|
"Ms", |
|
"No", |
|
"Ns", |
|
"Nx", |
|
"Ox", |
|
"Pc", |
|
"Pf", |
|
"Po", |
|
"Pq", |
|
"Qc", |
|
"Ql", |
|
"Qo", |
|
"Qq", |
|
"Re", |
|
"Rs", |
|
"Sc", |
|
"So", |
|
"Sq", |
|
"Sm", |
|
"Sx", |
|
"Sy", |
|
"Tn", |
|
"Ux", |
|
"Xc", /* FIXME: do not support! */ |
|
"Xo", /* FIXME: do not support! */ |
|
}; |
|
|
|
const char *const tokargnamesp[ROFF_ARGMAX] = |
|
{ |
|
"split", |
|
"nosplit", |
|
"ragged", |
|
"unfilled", |
|
"literal", |
|
"file", |
|
"offset", |
|
"bullet", |
|
"dash", |
|
"hyphen", |
|
"item", |
|
"enum", |
|
"tag", |
|
"diag", |
|
"hang", |
|
"ohang", |
|
"inset", |
|
"column", |
|
"width", |
|
"compact", |
|
}; |
|
|
|
const char *const *toknames = toknamesp; |
|
const char *const *tokargnames = tokargnamesp; |
|
|
|
|
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 422 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 441 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 455 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 278 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 555 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
tree->rbuf->name, |
tree->rbuf->name, |
tree->rbuf->line); |
tree->rbuf->line); |
return(0); |
return(0); |
|
|
|
/* FIXME: .Bsx is three letters! */ |
} else if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
} else if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
warnx("%s: unknown line token `%c%c' (line %zu)", |
warnx("%s: unknown line token `%c%c' (line %zu)", |
tree->rbuf->name, |
tree->rbuf->name, |
Line 290 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 569 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 599 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 617 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 625 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 639 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 656 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 684 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 435 roffnode_new(int tokid, size_t line, struct rofftree * |
|
Line 692 roffnode_new(int tokid, size_t line, struct rofftree * |
|
} |
} |
|
|
|
|
|
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(int tokid, struct rofftree *tree) |
roffnode_free(int tokid, struct rofftree *tree) |
{ |
{ |
Line 449 roffnode_free(int tokid, struct rofftree *tree) |
|
Line 722 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 773 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 788 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 804 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) |
roffnextopt(int tok, const char ***in, char **val) |
{ |
{ |
|
|
dbg_enter(tree->args, ROFF_Li); |
|
dbg_leave(tree->args, ROFF_Li); |
|
|
|
return(1); |
|
} |
|
|
|
|
|
static int |
|
roffnextopt(const char ***in, char **val) |
|
{ |
|
const char *arg, **argv; |
const char *arg, **argv; |
int v; |
int v; |
|
|
Line 633 roffnextopt(const char ***in, char **val) |
|
Line 831 roffnextopt(const char ***in, char **val) |
|
return(-1); |
return(-1); |
if ('-' != *arg) |
if ('-' != *arg) |
return(-1); |
return(-1); |
|
|
|
/* FIXME: should we let this slide... ? */ |
|
|
if (ROFF_ARGMAX == (v = rofffindarg(&arg[1]))) |
if (ROFF_ARGMAX == (v = rofffindarg(&arg[1]))) |
return(-1); |
return(-1); |
|
|
|
/* FIXME: should we let this slide... ? */ |
|
|
|
if ( ! roffargok(tok, v)) |
|
return(-1); |
if ( ! (ROFF_VALUE & tokenargs[v].flags)) |
if ( ! (ROFF_VALUE & tokenargs[v].flags)) |
return(v); |
return(v); |
|
|
Line 648 roffnextopt(const char ***in, char **val) |
|
Line 854 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. */ |
|
break; |
while (-1 != (c = roffnextopt(tok, &argv, &v))) { |
default: |
if (ROFF_ARGMAX == c) { |
warnx("%s: error parsing `An' args (line %zu)", |
warnx("%s: error parsing `%s' args (line %zu)", |
tree->rbuf->name, |
tree->rbuf->name, |
|
toknames[tok], |
tree->rbuf->line); |
tree->rbuf->line); |
return(0); |
return(0); |
|
} else if ( ! roffargok(tok, c)) { |
|
warnx("%s: arg `%s' not for `%s' (line %zu)", |
|
tree->rbuf->name, |
|
tokargnames[c], |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
} |
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
|
i++; |
argv++; |
argv++; |
} |
} |
|
|
/* Print header. */ |
argcp[i] = ROFF_ARGMAX; |
|
argvp[i] = NULL; |
|
|
|
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. */ |
|
} else { |
|
/* Print token. */ |
|
} |
|
} else { |
|
/* Print token. */ |
|
} |
|
argv++; |
argv++; |
} |
} |
|
|
/* Print footer. */ |
if ( ! ((*tree->roffout)(tok))) |
|
return(0); |
|
|
dbg_leave(tree->args, ROFF_An); |
return((*tree->roffblkin)(tok)); |
|
|
return(1); |
|
} |
} |
|
|
|
|
|
/* 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(tok, &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; |
|
i++; |
|
argv++; |
|
} |
|
|
|
argcp[i] = ROFF_ARGMAX; |
|
argvp[i] = NULL; |
|
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
|
return(0); |
|
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
/* TODO: print all tokens. */ |
|
return((*tree->roffout)(tok)); |
|
} |
|
|
|
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)); |
|
} |