version 1.12, 2008/11/27 16:54:58 |
version 1.51, 2008/12/08 12:46:28 |
|
|
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
|
#include <sys/param.h> |
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
#include <err.h> |
|
|
|
|
#include "libmdocml.h" |
#include "libmdocml.h" |
#include "private.h" |
#include "private.h" |
|
#include "roff.h" |
|
|
/* FIXME: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
/* FIXME: First letters of quoted-text interpreted in rofffindtok. */ |
|
/* FIXME: `No' not implemented. */ |
|
/* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
|
/* TODO: warn about "X section only" macros. */ |
|
/* TODO: warn about empty lists. */ |
|
/* TODO: (warn) some sections need specific elements. */ |
|
/* TODO: (warn) NAME section has particular order. */ |
|
/* TODO: unify empty-content tags a la <br />. */ |
|
/* TODO: macros with a set number of arguments? */ |
|
/* TODO: validate Dt macro arguments. */ |
|
/* FIXME: Bl -diag supposed to ignore callable children. */ |
|
/* FIXME: Nm has newline when used in NAME section. */ |
|
|
/* FIXME: warn about "X section only" macros. */ |
|
|
|
/* FIXME: warn about empty lists. */ |
|
|
|
/* FIXME: ; : } ) (etc.) after text macros? */ |
|
|
|
/* FIXME: NAME section needs specific elements. */ |
|
|
|
#define ROFF_MAXARG 32 |
|
|
|
enum roffd { |
|
ROFF_ENTER = 0, |
|
ROFF_EXIT |
|
}; |
|
|
|
enum rofftype { |
|
ROFF_COMMENT, |
|
ROFF_TEXT, |
|
ROFF_LAYOUT, |
|
ROFF_SPECIAL |
|
}; |
|
|
|
#define ROFFCALL_ARGS \ |
|
int tok, struct rofftree *tree, \ |
|
const char *argv[], enum roffd type |
|
|
|
struct rofftree; |
|
|
|
struct rofftok { |
|
int (*cb)(ROFFCALL_ARGS); /* Callback. */ |
|
const int *args; /* Args (or NULL). */ |
|
const int *parents; |
|
const int *children; |
|
int ctx; |
|
enum rofftype type; /* Type of macro. */ |
|
int flags; |
|
#define ROFF_PARSED (1 << 0) /* "Parsed". */ |
|
#define ROFF_CALLABLE (1 << 1) /* "Callable". */ |
|
#define ROFF_QUOTES (1 << 2) /* Quoted args. */ |
|
#define ROFF_SHALLOW (1 << 3) /* Nesting block. */ |
|
}; |
|
|
|
struct roffarg { |
|
int flags; |
|
#define ROFF_VALUE (1 << 0) /* Has a value. */ |
|
}; |
|
|
|
struct roffnode { |
struct roffnode { |
int tok; /* Token id. */ |
int tok; /* Token id. */ |
struct roffnode *parent; /* Parent (or NULL). */ |
struct roffnode *parent; /* Parent (or NULL). */ |
size_t line; /* Parsed at line. */ |
|
}; |
}; |
|
|
struct rofftree { |
struct rofftree { |
struct roffnode *last; /* Last parsed node. */ |
struct roffnode *last; /* Last parsed node. */ |
time_t date; /* `Dd' results. */ |
char *cur; /* Line start. */ |
char *cur; |
struct tm tm; /* `Dd' results. */ |
|
char name[64]; /* `Nm' results. */ |
char os[64]; /* `Os' results. */ |
char os[64]; /* `Os' results. */ |
char title[64]; /* `Dt' results. */ |
char title[64]; /* `Dt' results. */ |
char section[64]; /* `Dt' results. */ |
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: if we had prev ptrs, this wouldn't be necessary. */ |
|
#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. */ |
#define ROFF_BODY (1 << 5) /* In roff body. */ |
#define ROFF_BODY (1 << 5) /* In roff body. */ |
struct md_mbuf *mbuf; /* Output (or NULL). */ |
struct roffcb cb; /* Callbacks. */ |
const struct md_args *args; /* Global args. */ |
void *arg; /* Callbacks' arg. */ |
const struct md_rbuf *rbuf; /* Input. */ |
|
const struct roffcb *cb; |
|
}; |
}; |
|
|
static int roff_Dd(ROFFCALL_ARGS); |
|
static int roff_Dt(ROFFCALL_ARGS); |
|
static int roff_Os(ROFFCALL_ARGS); |
|
|
|
static int roff_layout(ROFFCALL_ARGS); |
|
static int roff_text(ROFFCALL_ARGS); |
|
static int roff_comment(ROFFCALL_ARGS); |
|
static int roff_close(ROFFCALL_ARGS); |
|
static int roff_special(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
static struct roffnode *roffnode_new(int, struct rofftree *); |
static void roffnode_free(int, struct rofftree *); |
static void roffnode_free(struct rofftree *); |
|
|
static void roff_warn(const struct rofftree *, |
static void roff_warn(const struct rofftree *, |
const char *, char *, ...); |
const char *, char *, ...); |
static void roff_err(const struct rofftree *, |
static void roff_err(const struct rofftree *, |
const char *, char *, ...); |
const char *, 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 roffispunct(const char *); |
static int roffargs(const struct rofftree *, |
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 roffparseopts(struct rofftree *, int, |
static int textparse(const struct rofftree *, |
char ***, int *, char **); |
const char *, size_t); |
static int roffcall(struct rofftree *, int, char **); |
|
static int roffexit(struct rofftree *, int); |
|
static int roffparse(struct rofftree *, char *); |
|
static int textparse(struct rofftree *, char *); |
|
static int roffdata(struct rofftree *, int, char *); |
|
static int roffspecial(struct rofftree *, int, |
|
const char *, const int *, |
|
const char **, size_t, char **); |
|
static int roffsetname(struct rofftree *, char **); |
|
|
|
#ifdef __linux__ |
|
extern size_t strlcat(char *, const char *, size_t); |
|
extern size_t strlcpy(char *, const char *, size_t); |
|
extern int vsnprintf(char *, size_t, |
|
const char *, va_list); |
|
extern char *strptime(const char *, const char *, |
|
struct tm *); |
|
#endif |
|
|
static const int roffarg_An[] = { ROFF_Split, ROFF_Nosplit, |
int |
ROFF_ARGMAX }; |
roff_free(struct rofftree *tree, int flush) |
static const int roffarg_Bd[] = { ROFF_Ragged, ROFF_Unfilled, |
{ |
ROFF_Literal, ROFF_File, ROFF_Offset, ROFF_Filled, |
int error, t; |
ROFF_Compact, ROFF_ARGMAX }; |
struct roffnode *n; |
static const int roffarg_Bk[] = { ROFF_Words, ROFF_ARGMAX }; |
|
static const int roffarg_Ex[] = { ROFF_Std, ROFF_ARGMAX }; |
|
static const int roffarg_Rv[] = { ROFF_Std, ROFF_ARGMAX }; |
|
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_Width, ROFF_Compact, ROFF_ARGMAX }; |
|
static const int roffarg_St[] = { |
|
ROFF_p1003_1_88, ROFF_p1003_1_90, ROFF_p1003_1_96, |
|
ROFF_p1003_1_2001, ROFF_p1003_1_2004, ROFF_p1003_1, |
|
ROFF_p1003_1b, ROFF_p1003_1b_93, ROFF_p1003_1c_95, |
|
ROFF_p1003_1g_2000, ROFF_p1003_2_92, ROFF_p1387_2_95, |
|
ROFF_p1003_2, ROFF_p1387_2, ROFF_isoC_90, ROFF_isoC_amd1, |
|
ROFF_isoC_tcor1, ROFF_isoC_tcor2, ROFF_isoC_99, ROFF_ansiC, |
|
ROFF_ansiC_89, ROFF_ansiC_99, ROFF_ieee754, ROFF_iso8802_3, |
|
ROFF_xpg3, ROFF_xpg4, ROFF_xpg4_2, ROFF_xpg4_3, ROFF_xbd5, |
|
ROFF_xcu5, ROFF_xsh5, ROFF_xns5, ROFF_xns5_2d2_0, |
|
ROFF_xcurses4_2, ROFF_susv2, ROFF_susv3, ROFF_svid4, |
|
ROFF_ARGMAX }; |
|
|
|
static const int roffchild_Bl[] = { ROFF_It, ROFF_El, ROFF_MAX }; |
error = 0; |
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 }; |
if ( ! flush) |
static const int roffparent_Fc[] = { ROFF_Fo, ROFF_Fa, ROFF_MAX }; |
goto end; |
static const int roffparent_Oc[] = { ROFF_Oo, ROFF_Oc, ROFF_MAX }; |
|
static const int roffparent_It[] = { ROFF_Bl, ROFF_It, ROFF_MAX }; |
|
static const int roffparent_Re[] = { ROFF_Rs, ROFF_MAX }; |
|
|
|
/* Table of all known tokens. */ |
error = 1; |
static const struct rofftok tokens[ROFF_MAX] = |
|
{ |
|
{roff_comment, NULL, NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */ |
|
{ roff_Dd, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dd */ |
|
{ roff_Dt, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dt */ |
|
{ roff_Os, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_QUOTES }, /* Os */ |
|
{ roff_layout, NULL, NULL, NULL, ROFF_Sh, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
|
{ roff_layout, NULL, NULL, NULL, ROFF_Ss, ROFF_LAYOUT, ROFF_PARSED }, /* Ss */ |
|
{ 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 }, /* Dl */ |
|
{ roff_layout, roffarg_Bd, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bd */ |
|
{ roff_close, NULL, NULL, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */ |
|
{ 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_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, ROFF_SHALLOW }, /* It */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ |
|
{ 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_QUOTES }, /* 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 }, /* 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 }, /* Ev */ /* XXX needs arg */ |
|
{ roff_text, roffarg_Ex, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ex */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ /* XXX needs arg */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Fd */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fn */ /* XXX needs arg */ /* FIXME */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ft */ |
|
{ 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, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_QUOTES }, /* 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 }, /* Op */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ot */ /* XXX deprecated */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */ |
|
{ roff_text, roffarg_Rv, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Rv */ |
|
{ roff_text, roffarg_St, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ /* XXX needs arg */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xr */ /* XXX needs arg */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %D */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %N */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %O */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %P */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %R */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %V */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* 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_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 }, /* Bsx */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
|
{roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Db */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */ |
|
{ 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 }, /* 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_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_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 */ |
|
{ roff_text, 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 }, /* 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 */ |
|
{ roff_layout, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qq */ |
|
{ roff_close, NULL, roffparent_Re, NULL, ROFF_Rs, ROFF_LAYOUT, 0 }, /* Re */ |
|
{ roff_layout, NULL, NULL, roffchild_Rs, 0, ROFF_LAYOUT, 0 }, /* Rs */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sq */ |
|
{roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Sm */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */ |
|
{ roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ux */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */ |
|
{ roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Fo */ |
|
{ roff_close, NULL, roffparent_Fc, NULL, ROFF_Fo, ROFF_LAYOUT, 0 }, /* Fc */ |
|
{ roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Oo */ |
|
{ roff_close, NULL, roffparent_Oc, NULL, ROFF_Oo, ROFF_LAYOUT, 0 }, /* Oc */ |
|
{ roff_layout, roffarg_Bk, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bk */ |
|
{ roff_close, NULL, NULL, NULL, ROFF_Bk, ROFF_LAYOUT, 0 }, /* Ek */ |
|
}; |
|
|
|
/* Table of all known token arguments. */ |
if (ROFF_PRELUDE & tree->state) { |
static const int tokenargs[ROFF_ARGMAX] = |
roff_err(tree, NULL, "prelude never finished"); |
{ |
goto end; |
0, 0, 0, 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, 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, 0, 0, |
|
0, 0, 0, 0, |
|
}; |
|
|
|
const char *const toknamesp[ROFF_MAX] = |
for (n = tree->last; n; n = n->parent) { |
{ |
if (0 != tokens[n->tok].ctx) |
"\\\"", "Dd", "Dt", "Os", |
continue; |
"Sh", "Ss", "Pp", "D1", |
roff_err(tree, NULL, "closing explicit scope `%s'", |
"Dl", "Bd", "Ed", "Bl", |
toknames[n->tok]); |
"El", "It", "Ad", "An", |
goto end; |
"Ar", "Cd", "Cm", "Dv", |
} |
"Er", "Ev", "Ex", "Fa", |
|
"Fd", "Fl", "Fn", "Ft", |
|
"Ic", "In", "Li", "Nd", |
|
"Nm", "Op", "Ot", "Pa", |
|
"Rv", "St", "Va", "Vt", |
|
"Xr", "\%A", "\%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", "Xo", |
|
"Fo", "Fc", "Oo", "Oc", |
|
"Bk", "Ek", |
|
}; |
|
|
|
const char *const tokargnamesp[ROFF_ARGMAX] = |
while (tree->last) { |
{ |
t = tree->last->tok; |
"split", "nosplit", "ragged", |
if ( ! roffexit(tree, t)) |
"unfilled", "literal", "file", |
goto end; |
"offset", "bullet", "dash", |
} |
"hyphen", "item", "enum", |
|
"tag", "diag", "hang", |
|
"ohang", "inset", "column", |
|
"width", "compact", "std", |
|
"p1003.1-88", "p1003.1-90", "p1003.1-96", |
|
"p1003.1-2001", "p1003.1-2004", "p1003.1", |
|
"p1003.1b", "p1003.1b-93", "p1003.1c-95", |
|
"p1003.1g-2000", "p1003.2-92", "p1387.2-95", |
|
"p1003.2", "p1387.2", "isoC-90", |
|
"isoC-amd1", "isoC-tcor1", "isoC-tcor2", |
|
"isoC-99", "ansiC", "ansiC-89", |
|
"ansiC-99", "ieee754", "iso8802-3", |
|
"xpg3", "xpg4", "xpg4.2", |
|
"xpg4.3", "xbd5", "xcu5", |
|
"xsh5", "xns5", "xns5.2d2.0", |
|
"xcurses4.2", "susv2", "susv3", |
|
"svid4", "filled", "words", |
|
}; |
|
|
|
|
if ( ! (*tree->cb.rofftail)(tree->arg)) |
|
goto end; |
|
|
const char *const *toknames = toknamesp; |
error = 0; |
const char *const *tokargnames = tokargnamesp; |
|
|
|
|
end: |
|
|
int |
while (tree->last) |
roff_free(struct rofftree *tree, int flush) |
roffnode_free(tree); |
{ |
|
int error; |
|
|
|
assert(tree->mbuf); |
|
if ( ! flush) |
|
tree->mbuf = NULL; |
|
|
|
/* LINTED */ |
|
while (tree->last) |
|
if ( ! (*tokens[tree->last->tok].cb) |
|
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
|
/* Disallow flushing. */ |
|
tree->mbuf = NULL; |
|
|
|
error = tree->mbuf ? 0 : 1; |
|
|
|
if (tree->mbuf && (ROFF_PRELUDE & tree->state)) { |
|
/*roff_warn(tree, "prelude never finished");*/ |
|
error = 1; |
|
} |
|
|
|
free(tree); |
free(tree); |
|
|
return(error ? 0 : 1); |
return(error ? 0 : 1); |
} |
} |
|
|
|
|
struct rofftree * |
struct rofftree * |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
roff_alloc(const struct roffcb *cb, void *args) |
const struct md_rbuf *in, const struct roffcb *cb) |
|
{ |
{ |
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"); |
|
|
tree->state = ROFF_PRELUDE; |
tree->state = ROFF_PRELUDE; |
tree->args = args; |
tree->arg = args; |
tree->mbuf = out; |
tree->section = ROFF_MSEC_MAX; |
tree->rbuf = in; |
|
tree->cb = cb; |
|
|
|
|
(void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
|
|
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 = buf; |
tree->cur = buf; |
|
assert(buf); |
|
|
if (0 == sz) { |
if (0 == *buf) { |
roff_warn(tree, buf, "blank line"); |
roff_err(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(struct rofftree *tree, char *buf) |
{ |
{ |
|
char *bufp; |
/* Print text. */ |
|
|
/* TODO: literal parsing. */ |
|
|
|
if ( ! (ROFF_BODY & tree->state)) { |
|
roff_err(tree, buf, "data not in body"); |
|
return(0); |
|
} |
|
|
|
/* LINTED */ |
|
while (*buf) { |
|
while (*buf && isspace(*buf)) |
|
buf++; |
|
|
|
if (0 == *buf) |
|
break; |
|
|
|
bufp = buf++; |
|
|
|
while (*buf && ! isspace(*buf)) |
|
buf++; |
|
|
|
if (0 != *buf) { |
|
*buf++ = 0; |
|
if ( ! roffdata(tree, 1, bufp)) |
|
return(0); |
|
continue; |
|
} |
|
|
|
if ( ! roffdata(tree, 1, bufp)) |
|
return(0); |
|
break; |
|
} |
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 444 roffargs(const struct rofftree *tree, |
|
Line 247 roffargs(const struct rofftree *tree, |
|
|
|
p = buf; |
p = buf; |
|
|
|
/* |
|
* This is an ugly little loop. It parses a line into |
|
* space-delimited tokens. If a quote mark is encountered, a |
|
* token is alloted the entire quoted text. If whitespace is |
|
* escaped, it's included in the prior alloted token. |
|
*/ |
|
|
/* LINTED */ |
/* LINTED */ |
for (i = 0; *buf && i < ROFF_MAXARG; i++) { |
for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) { |
if ('\"' == *buf) { |
if ('\"' == *buf) { |
argv[i] = ++buf; |
argv[i] = ++buf; |
while (*buf && '\"' != *buf) |
while (*buf && '\"' != *buf) |
buf++; |
buf++; |
if (0 == *buf) { |
if (0 == *buf) { |
roff_err(tree, p, argv[i], "unclosed " |
roff_err(tree, argv[i], "unclosed " |
"quote in argument " |
"quote in argument " |
"list for `%s'", |
"list for `%s'", |
toknames[tok]); |
toknames[tok]); |
Line 459 roffargs(const struct rofftree *tree, |
|
Line 269 roffargs(const struct rofftree *tree, |
|
} |
} |
} else { |
} else { |
argv[i] = buf++; |
argv[i] = buf++; |
while (*buf && ! isspace(*buf)) |
while (*buf) { |
buf++; |
if ( ! isspace(*buf)) { |
|
buf++; |
|
continue; |
|
} |
|
if (*(buf - 1) == '\\') { |
|
buf++; |
|
continue; |
|
} |
|
break; |
|
} |
if (0 == *buf) |
if (0 == *buf) |
continue; |
continue; |
} |
} |
Line 468 roffargs(const struct rofftree *tree, |
|
Line 287 roffargs(const struct rofftree *tree, |
|
while (*buf && isspace(*buf)) |
while (*buf && isspace(*buf)) |
buf++; |
buf++; |
} |
} |
|
|
assert(i > 0); |
assert(i > 0); |
if (ROFF_MAXARG == i && *buf) { |
if (ROFF_MAXLINEARG == i && *buf) { |
roff_err(tree, p, p, "too many arguments for `%s'", toknames |
roff_err(tree, p, "too many arguments for `%s'", toknames |
[tok]); |
[tok]); |
return(0); |
return(0); |
} |
} |
Line 481 roffargs(const struct rofftree *tree, |
|
Line 300 roffargs(const struct rofftree *tree, |
|
} |
} |
|
|
|
|
/* XXX */ |
|
static int |
static int |
roffscan(int tok, const int *tokv) |
roffscan(int tok, const int *tokv) |
{ |
{ |
Line 498 roffscan(int tok, const int *tokv) |
|
Line 316 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_MAXLINEARG]; |
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"); |
return(0); |
return(0); |
} else if (NULL == tokens[tok].cb) { |
} else if ( ! roffargs(tree, tok, buf, argv)) |
roff_err(tree, buf + 1, "unsupported macro `%s'", |
|
toknames[tok]); |
|
return(0); |
return(0); |
} else if (ROFF_COMMENT == tokens[tok].type) |
|
return(1); |
|
|
|
if ( ! roffargs(tree, tok, buf, argv)) |
|
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 528 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 341 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) { |
assert(NULL == tree->last); |
assert(NULL == tree->last); |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(roffcall(tree, tok, argvp)); |
} else |
} |
assert(tree->last); |
|
|
|
assert(ROFF_BODY & tree->state); |
assert(ROFF_BODY & tree->state); |
|
|
Line 539 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 351 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
* children are satisfied. |
* children are satisfied. |
*/ |
*/ |
|
|
if ( ! roffscan(tree->last->tok, tokens[tok].parents)) { |
if (tree->last && ! roffscan |
warnx("%s: invalid parent `%s' for `%s' (line %zu)", |
(tree->last->tok, tokens[tok].parents)) { |
tree->rbuf->name, |
roff_err(tree, *argvp, "`%s' has invalid parent `%s'", |
toknames[tree->last->tok], |
toknames[tok], |
toknames[tok], tree->rbuf->line); |
toknames[tree->last->tok]); |
return(0); |
return(0); |
} |
} |
|
|
if ( ! roffscan(tok, tokens[tree->last->tok].children)) { |
if (tree->last && ! roffscan |
warnx("%s: invalid child `%s' for `%s' (line %zu)", |
(tok, tokens[tree->last->tok].children)) { |
tree->rbuf->name, toknames[tok], |
roff_err(tree, *argvp, "`%s' is invalid child of `%s'", |
toknames[tree->last->tok], |
toknames[tok], |
tree->rbuf->line); |
toknames[tree->last->tok]); |
return(0); |
return(0); |
} |
} |
|
|
Line 560 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 372 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
*/ |
*/ |
|
|
if (ROFF_LAYOUT != tokens[tok].type) |
if (ROFF_LAYOUT != tokens[tok].type) |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(roffcall(tree, tok, argvp)); |
|
|
/* |
|
* Check our scope rules. |
|
*/ |
|
|
|
if (0 == tokens[tok].ctx) |
if (0 == tokens[tok].ctx) |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(roffcall(tree, tok, argvp)); |
|
|
/* |
/* |
* First consider implicit-end tags, like as follows: |
* First consider implicit-end tags, like as follows: |
Line 596 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 403 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
n = NULL; |
n = NULL; |
break; |
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 604 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 416 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
*/ |
*/ |
|
|
if (NULL == n) |
if (NULL == n) |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(roffcall(tree, tok, argvp)); |
|
|
/* |
/* |
* Close out all intermediary scoped blocks, then hang |
* Close out all intermediary scoped blocks, then hang |
Line 613 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 425 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
|
|
do { |
do { |
t = tree->last->tok; |
t = tree->last->tok; |
if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
if ( ! roffexit(tree, t)) |
return(0); |
return(0); |
} while (t != tok); |
} while (t != tok); |
|
|
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(roffcall(tree, tok, argvp)); |
} |
} |
|
|
/* |
/* |
Line 629 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
Line 441 roffparse(struct rofftree *tree, char *buf, size_t sz) |
|
* In this, the `El' tag closes out the scope of `Bl'. |
* In this, the `El' tag closes out the scope of `Bl'. |
*/ |
*/ |
|
|
assert(tree->last); |
|
assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
|
|
|
/* LINTED */ |
|
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 { |
do { |
t = tree->last->tok; |
t = tree->last->tok; |
if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
if ( ! roffexit(tree, t)) |
return(0); |
return(0); |
} while (t != tokens[tok].ctx); |
} while (t != tokens[tok].ctx); |
|
|
assert(tree->last); |
|
return(1); |
return(1); |
} |
} |
|
|
|
|
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 687 rofffindtok(const char *buf) |
|
Line 517 rofffindtok(const char *buf) |
|
|
|
|
|
static int |
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 |
|
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 706 roffnode_new(int tokid, struct rofftree *tree) |
|
Line 613 roffnode_new(int tokid, struct rofftree *tree) |
|
if (NULL == (p = malloc(sizeof(struct roffnode)))) |
if (NULL == (p = malloc(sizeof(struct roffnode)))) |
err(1, "malloc"); |
err(1, "malloc"); |
|
|
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 732 roffargok(int tokid, int argid) |
|
Line 638 roffargok(int tokid, int argid) |
|
|
|
|
|
static void |
static void |
roffnode_free(int tokid, struct rofftree *tree) |
roffnode_free(struct rofftree *tree) |
{ |
{ |
struct roffnode *p; |
struct roffnode *p; |
|
|
assert(tree->last); |
assert(tree->last); |
assert(tree->last->tok == tokid); |
|
|
|
p = tree->last; |
p = tree->last; |
tree->last = tree->last->parent; |
tree->last = tree->last->parent; |
Line 746 roffnode_free(int tokid, struct rofftree *tree) |
|
Line 651 roffnode_free(int tokid, struct rofftree *tree) |
|
|
|
|
|
static int |
static int |
|
roffspecial(struct rofftree *tree, int tok, const char *start, |
|
const int *argc, const char **argv, |
|
size_t sz, char **ordp) |
|
{ |
|
|
|
switch (tok) { |
|
case (ROFF_At): |
|
if (0 == sz) |
|
break; |
|
if (0 == strcmp(*ordp, "v6")) |
|
break; |
|
else if (0 == strcmp(*ordp, "v7")) |
|
break; |
|
else if (0 == strcmp(*ordp, "32v")) |
|
break; |
|
else if (0 == strcmp(*ordp, "V.1")) |
|
break; |
|
else if (0 == strcmp(*ordp, "V.4")) |
|
break; |
|
roff_err(tree, start, "invalid `At' arg"); |
|
return(0); |
|
|
|
case (ROFF_Xr): |
|
if (2 == sz) { |
|
assert(ordp[1]); |
|
if (ROFF_MSEC_MAX != roffismsec(ordp[1])) |
|
break; |
|
roff_warn(tree, start, "invalid `%s' manual " |
|
"section", toknames[tok]); |
|
} |
|
/* FALLTHROUGH */ |
|
|
|
case (ROFF_Fn): |
|
if (0 != sz) |
|
break; |
|
roff_err(tree, start, "`%s' expects at least " |
|
"one arg", toknames[tok]); |
|
return(0); |
|
|
|
case (ROFF_Nm): |
|
if (0 == sz) { |
|
if (0 == tree->name[0]) { |
|
roff_err(tree, start, "`Nm' not set"); |
|
return(0); |
|
} |
|
ordp[0] = tree->name; |
|
ordp[1] = NULL; |
|
} else if ( ! roffsetname(tree, ordp)) |
|
return(0); |
|
break; |
|
|
|
case (ROFF_Rv): |
|
/* FALLTHROUGH*/ |
|
case (ROFF_Sx): |
|
/* FALLTHROUGH*/ |
|
case (ROFF_Ex): |
|
if (1 == sz) |
|
break; |
|
roff_err(tree, start, "`%s' expects one arg", |
|
toknames[tok]); |
|
return(0); |
|
|
|
case (ROFF_Sm): |
|
if (1 != sz) { |
|
roff_err(tree, start, "`Sm' expects one arg"); |
|
return(0); |
|
} |
|
|
|
if (0 != strcmp(ordp[0], "on") && |
|
0 != strcmp(ordp[0], "off")) { |
|
roff_err(tree, start, "`Sm' has invalid argument"); |
|
return(0); |
|
} |
|
break; |
|
|
|
case (ROFF_Ud): |
|
/* FALLTHROUGH */ |
|
case (ROFF_Ux): |
|
/* FALLTHROUGH */ |
|
case (ROFF_Bt): |
|
if (0 != sz) { |
|
roff_err(tree, start, "`%s' expects no args", |
|
toknames[tok]); |
|
return(0); |
|
} |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
return((*tree->cb.roffspecial)(tree->arg, tok, tree->cur, |
|
argc, argv, (const char **)ordp)); |
|
} |
|
|
|
|
|
static int |
|
roffexit(struct rofftree *tree, int tok) |
|
{ |
|
|
|
assert(tokens[tok].cb); |
|
return((*tokens[tok].cb)(tok, tree, NULL, ROFF_EXIT)); |
|
} |
|
|
|
|
|
static int |
|
roffcall(struct rofftree *tree, int tok, char **argv) |
|
{ |
|
int i; |
|
enum roffmsec c; |
|
|
|
if (NULL == tokens[tok].cb) { |
|
roff_err(tree, *argv, "`%s' is unsupported", |
|
toknames[tok]); |
|
return(0); |
|
} |
|
if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
|
i = 0; |
|
while (ROFF_MSEC_MAX != |
|
(c = tokens[tok].sections[i++])) |
|
if (c == tree->section) |
|
break; |
|
if (ROFF_MSEC_MAX == c) { |
|
roff_warn(tree, *argv, "`%s' is not a valid " |
|
"macro in this manual section", |
|
toknames[tok]); |
|
} |
|
} |
|
|
|
return((*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER)); |
|
} |
|
|
|
|
|
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 763 roffnextopt(const struct rofftree *tree, int tok, |
|
Line 801 roffnextopt(const struct rofftree *tree, int tok, |
|
|
|
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
roff_warn(tree, arg, "argument-like parameter `%s' to " |
roff_warn(tree, arg, "argument-like parameter `%s' to " |
"`%s'", &arg[1], toknames[tok]); |
"`%s'", arg, toknames[tok]); |
return(-1); |
return(-1); |
} |
} |
|
|
Line 788 roffnextopt(const struct rofftree *tree, int tok, |
|
Line 826 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 ( ! roffdata(tree, 0, argv[i++])) |
|
return(0); |
|
return(1); |
|
} |
|
|
|
|
|
static int |
|
roffparseopts(struct rofftree *tree, int tok, |
|
char ***args, int *argc, char **argv) |
|
{ |
|
int i, c; |
|
char *v; |
|
|
|
i = 0; |
|
|
|
while (-1 != (c = roffnextopt(tree, tok, args, &v))) { |
|
if (ROFF_ARGMAX == c) |
|
return(0); |
|
|
|
argc[i] = c; |
|
argv[i] = v; |
|
i++; |
|
*args = *args + 1; |
|
} |
|
|
|
argc[i] = ROFF_ARGMAX; |
|
argv[i] = NULL; |
|
return(1); |
|
} |
|
|
|
|
|
static int |
|
roffdata(struct rofftree *tree, int space, char *buf) |
|
{ |
|
|
|
if (0 == *buf) |
|
return(1); |
|
return((*tree->cb.roffdata)(tree->arg, |
|
space != 0, tree->cur, buf)); |
|
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_Dd(ROFFCALL_ARGS) |
roff_Dd(ROFFCALL_ARGS) |
{ |
{ |
|
time_t t; |
|
char *p, buf[32]; |
|
|
if (ROFF_BODY & tree->state) { |
if (ROFF_BODY & tree->state) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
assert( ! (ROFF_PRELUDE & tree->state)); |
Line 810 roff_Dd(ROFFCALL_ARGS) |
|
Line 909 roff_Dd(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
/* TODO: parse date. */ |
|
|
|
assert(NULL == tree->last); |
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); |
return(1); |
} |
} |
|
|
Line 841 roff_Dt(ROFFCALL_ARGS) |
|
Line 992 roff_Dt(ROFFCALL_ARGS) |
|
return(0); |
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); |
|
} |
|
|
|
if (ROFF_MSEC_MAX == (tree->section = roffismsec(*argv))) { |
|
roff_err(tree, *argv, "bad `Dt' section"); |
|
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); |
assert(NULL == tree->last); |
tree->state |= ROFF_PRELUDE_Dt; |
tree->state |= ROFF_PRELUDE_Dt; |
|
|
Line 850 roff_Dt(ROFFCALL_ARGS) |
|
Line 1029 roff_Dt(ROFFCALL_ARGS) |
|
} |
} |
|
|
|
|
|
static int |
|
roffsetname(struct rofftree *tree, char **ordp) |
|
{ |
|
|
|
assert(*ordp); |
|
|
|
/* FIXME: not all sections can set this. */ |
|
|
|
if (NULL != *(ordp + 1)) { |
|
roff_err(tree, *ordp, "too many `Nm' args"); |
|
return(0); |
|
} |
|
|
|
if (strlcpy(tree->name, *ordp, sizeof(tree->name)) |
|
>= sizeof(tree->name)) { |
|
roff_err(tree, *ordp, "`Nm' arg too long"); |
|
return(0); |
|
} |
|
|
|
return(1); |
|
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
|
roff_Ns(ROFFCALL_ARGS) |
|
{ |
|
int j, c, first; |
|
char *morep[1]; |
|
|
|
first = (*argv++ == tree->cur); |
|
morep[0] = NULL; |
|
|
|
if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep)) |
|
return(0); |
|
|
|
while (*argv) { |
|
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
|
if ( ! roffcall(tree, c, argv)) |
|
return(0); |
|
break; |
|
} |
|
|
|
if ( ! roffispunct(*argv)) { |
|
if ( ! roffdata(tree, 1, *argv++)) |
|
return(0); |
|
continue; |
|
} |
|
|
|
for (j = 0; argv[j]; j++) |
|
if ( ! roffispunct(argv[j])) |
|
break; |
|
|
|
if (argv[j]) { |
|
if ( ! roffdata(tree, 0, *argv++)) |
|
return(0); |
|
continue; |
|
} |
|
|
|
break; |
|
} |
|
|
|
if ( ! first) |
|
return(1); |
|
|
|
return(roffpurgepunct(tree, argv)); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
roff_Os(ROFFCALL_ARGS) |
roff_Os(ROFFCALL_ARGS) |
{ |
{ |
|
char *p; |
|
|
if (ROFF_EXIT == type) { |
if (ROFF_BODY & tree->state) { |
assert(ROFF_PRELUDE_Os & tree->state); |
|
return(roff_layout(tok, tree, argv, type)); |
|
} 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); |
return(roff_text(tok, tree, argv, type)); |
return(roff_text(tok, tree, argv, type)); |
Line 871 roff_Os(ROFFCALL_ARGS) |
|
Line 1117 roff_Os(ROFFCALL_ARGS) |
|
return(0); |
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_Os; |
tree->state &= ~ROFF_PRELUDE; |
tree->state &= ~ROFF_PRELUDE; |
tree->state |= ROFF_BODY; |
tree->state |= ROFF_BODY; |
|
|
|
assert(ROFF_MSEC_MAX != tree->section); |
|
assert(0 != tree->title[0]); |
|
assert(0 != tree->os[0]); |
|
|
assert(NULL == tree->last); |
assert(NULL == tree->last); |
|
|
return(roff_layout(tok, tree, argv, type)); |
return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
|
tree->os, tree->title, tree->section, |
|
tree->volume)); |
} |
} |
|
|
|
|
Line 887 roff_Os(ROFFCALL_ARGS) |
|
Line 1156 roff_Os(ROFFCALL_ARGS) |
|
static int |
static int |
roff_layout(ROFFCALL_ARGS) |
roff_layout(ROFFCALL_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
int i, c, argcp[ROFF_MAXLINEARG]; |
char *v, *argvp[ROFF_MAXARG]; |
char *argvp[ROFF_MAXLINEARG]; |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) { |
roff_err(tree, *argv, "`%s' disallowed in prelude", |
roff_err(tree, *argv, "bad `%s' in prelude", |
toknames[tok]); |
toknames[tok]); |
return(0); |
return(0); |
} |
} else if (ROFF_EXIT == type) { |
|
roffnode_free(tree); |
if (ROFF_EXIT == type) { |
if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
roffnode_free(tok, tree); |
return(0); |
return((*tree->cb->roffblkout)(tok)); |
return((*tree->cb.roffblkout)(tree->arg, tok)); |
} |
} |
|
|
i = 0; |
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
argv++; |
|
|
|
while (-1 != (c = roffnextopt(tree, tok, &argv, &v))) { |
++argv; |
if (ROFF_ARGMAX == c) |
|
return(0); |
|
|
|
argcp[i] = c; |
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
argvp[i] = v; |
return(0); |
i++; |
if (NULL == roffnode_new(tok, tree)) |
argv++; |
return(0); |
} |
|
|
|
argcp[i] = ROFF_ARGMAX; |
/* |
argvp[i] = NULL; |
* Layouts have two parts: the layout body and header. The |
|
* layout header is the trailing text of the line macro, while |
|
* the layout body is everything following until termination. |
|
*/ |
|
|
if (NULL == roffnode_new(tok, tree)) |
if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, |
|
(const char **)argvp)) |
return(0); |
return(0); |
|
if (NULL == *argv) |
|
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
|
|
if ( ! (*tree->cb->roffin)(tok, argcp, argvp)) |
if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, |
|
(const char **)argvp)) |
return(0); |
return(0); |
|
|
|
/* |
|
* If there are no parsable parts, then write remaining tokens |
|
* into the layout header and exit. |
|
*/ |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
i = 0; |
|
while (*argv) |
|
if ( ! roffdata(tree, i++, *argv++)) |
|
return(0); |
|
|
/* TODO: print all tokens. */ |
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
|
if ( ! ((*tree->cb->roffout)(tok))) |
|
return(0); |
return(0); |
return((*tree->cb->roffblkin)(tok)); |
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
} |
} |
|
|
|
/* |
|
* Parsable elements may be in the header (or be the header, for |
|
* that matter). Follow the regular parsing rules for these. |
|
*/ |
|
|
|
i = 0; |
while (*argv) { |
while (*argv) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
if (NULL == tokens[c].cb) { |
assert(tree->arg); |
roff_err(tree, *argv, "unsupported " |
if ( ! roffdata(tree, i++, *argv++)) |
"macro `%s'", |
|
toknames[c]); |
|
return(0); |
return(0); |
} |
continue; |
if ( ! (*tokens[c].cb)(c, tree, |
|
argv, ROFF_ENTER)) |
|
return(0); |
|
} |
} |
|
if ( ! roffcall(tree, c, argv)) |
|
return(0); |
|
break; |
|
} |
|
|
/* TODO: print token. */ |
/* |
|
* If there's trailing punctuation in the header, then write it |
|
* out now. Here we mimic the behaviour of a line-dominant text |
|
* macro. |
|
*/ |
|
|
argv++; |
if (NULL == *argv) { |
|
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
return(0); |
|
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
} |
} |
|
|
if ( ! ((*tree->cb->roffout)(tok))) |
/* |
|
* Expensive. Scan to the end of line then work backwards until |
|
* a token isn't punctuation. |
|
*/ |
|
|
|
if ( ! roffpurgepunct(tree, argv)) |
return(0); |
return(0); |
|
|
return((*tree->cb->roffblkin)(tok)); |
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
return(0); |
|
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_text(ROFFCALL_ARGS) |
roff_ordered(ROFFCALL_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
int i, first, c, argcp[ROFF_MAXLINEARG]; |
char *v, *argvp[ROFF_MAXARG]; |
char *ordp[ROFF_MAXLINEARG], *p, |
|
*argvp[ROFF_MAXLINEARG]; |
|
|
if (ROFF_PRELUDE & tree->state) { |
if (ROFF_PRELUDE & tree->state) { |
roff_err(tree, *argv, "`%s' disallowed in prelude", |
roff_err(tree, *argv, "`%s' disallowed in prelude", |
Line 970 roff_text(ROFFCALL_ARGS) |
|
Line 1277 roff_text(ROFFCALL_ARGS) |
|
return(0); |
return(0); |
} |
} |
|
|
|
first = (*argv == tree->cur); |
|
p = *argv++; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
|
return(0); |
|
|
|
if (NULL == *argv) { |
|
ordp[0] = NULL; |
|
return(roffspecial(tree, tok, p, argcp, |
|
(const char **)argvp, 0, ordp)); |
|
} |
|
|
i = 0; |
i = 0; |
argv++; |
while (*argv && i < ROFF_MAXLINEARG) { |
|
c = ROFF_PARSED & tokens[tok].flags ? |
|
rofffindcallable(*argv) : ROFF_MAX; |
|
|
while (-1 != (c = roffnextopt(tree, tok, &argv, &v))) { |
if (ROFF_MAX == c && ! roffispunct(*argv)) { |
if (ROFF_ARGMAX == c) |
ordp[i++] = *argv++; |
|
continue; |
|
} |
|
ordp[i] = NULL; |
|
|
|
if (ROFF_MAX == c) |
|
break; |
|
|
|
if ( ! roffspecial(tree, tok, p, argcp, |
|
(const char **)argvp, |
|
(size_t)i, ordp)) |
return(0); |
return(0); |
|
|
argcp[i] = c; |
return(roffcall(tree, c, argv)); |
argvp[i] = v; |
|
i++; |
|
argv++; |
|
} |
} |
|
|
argcp[i] = ROFF_ARGMAX; |
assert(i != ROFF_MAXLINEARG); |
argvp[i] = NULL; |
ordp[i] = NULL; |
|
|
if ( ! (*tree->cb->roffin)(tok, argcp, argvp)) |
if ( ! roffspecial(tree, tok, p, argcp, |
|
(const char**)argvp, |
|
(size_t)i, ordp)) |
return(0); |
return(0); |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
/* FIXME: error if there's stuff after the punctuation. */ |
|
|
/* TODO: print all tokens. */ |
if ( ! first || NULL == *argv) |
|
return(1); |
|
|
return((*tree->cb->roffout)(tok)); |
return(roffpurgepunct(tree, argv)); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
roff_text(ROFFCALL_ARGS) |
|
{ |
|
int i, j, first, c, argcp[ROFF_MAXLINEARG]; |
|
char *argvp[ROFF_MAXLINEARG]; |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
|
roff_err(tree, *argv, "`%s' disallowed in prelude", |
|
toknames[tok]); |
|
return(0); |
} |
} |
|
|
|
first = (*argv == tree->cur); |
|
argv++; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
|
return(0); |
|
if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, |
|
(const char **)argvp)) |
|
return(0); |
|
if (NULL == *argv) |
|
return((*tree->cb.roffout)(tree->arg, tok)); |
|
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
i = 0; |
|
while (*argv) |
|
if ( ! roffdata(tree, i++, *argv++)) |
|
return(0); |
|
|
|
return((*tree->cb.roffout)(tree->arg, tok)); |
|
} |
|
|
|
/* |
|
* Deal with punctuation. Ugly. Work ahead until we encounter |
|
* terminating punctuation. If we encounter it and all |
|
* subsequent tokens are punctuation, then stop processing (the |
|
* line-dominant macro will print these tokens after closure). |
|
* If the punctuation is followed by non-punctuation, then close |
|
* and re-open our scope, then continue. |
|
*/ |
|
|
|
i = 0; |
while (*argv) { |
while (*argv) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (NULL == tokens[c].cb) { |
if ( ! (ROFF_LSCOPE & tokens[tok].flags)) |
roff_err(tree, *argv, "unsupported " |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
"macro `%s'", |
return(0); |
toknames[c]); |
|
|
if ( ! roffcall(tree, c, argv)) |
return(0); |
return(0); |
} |
|
if ( ! (*tokens[c].cb)(c, tree, |
if (ROFF_LSCOPE & tokens[tok].flags) |
argv, ROFF_ENTER)) |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
|
|
break; |
|
} |
|
|
|
if ( ! roffispunct(*argv)) { |
|
if ( ! roffdata(tree, i++, *argv++)) |
return(0); |
return(0); |
|
continue; |
} |
} |
|
|
/* TODO: print token. */ |
i = 1; |
|
for (j = 0; argv[j]; j++) |
|
if ( ! roffispunct(argv[j])) |
|
break; |
|
|
argv++; |
if (argv[j]) { |
} |
if (ROFF_LSCOPE & tokens[tok].flags) { |
|
if ( ! roffdata(tree, 0, *argv++)) |
|
return(0); |
|
continue; |
|
} |
|
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
if ( ! roffdata(tree, 0, *argv++)) |
|
return(0); |
|
if ( ! (*tree->cb.roffin)(tree->arg, tok, |
|
argcp, |
|
(const char **)argvp)) |
|
return(0); |
|
|
return((*tree->cb->roffout)(tok)); |
i = 0; |
} |
continue; |
|
} |
|
|
|
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
break; |
|
} |
|
|
/* ARGSUSED */ |
if (NULL == *argv) |
static int |
return((*tree->cb.roffout)(tree->arg, tok)); |
roff_comment(ROFFCALL_ARGS) |
if ( ! first) |
{ |
return(1); |
|
|
return(1); |
return(roffpurgepunct(tree, argv)); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_close(ROFFCALL_ARGS) |
roff_noop(ROFFCALL_ARGS) |
{ |
{ |
|
|
return(1); |
return(1); |
Line 1038 roff_close(ROFFCALL_ARGS) |
|
Line 1442 roff_close(ROFFCALL_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
roff_special(ROFFCALL_ARGS) |
roff_depr(ROFFCALL_ARGS) |
{ |
{ |
|
|
return((*tree->cb->roffspecial)(tok)); |
roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]); |
|
return(0); |
} |
} |
|
|
|
|
Line 1055 roff_warn(const struct rofftree *tree, const char *pos |
|
Line 1460 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->args, ROFF_WARN, tree->cur, pos, |
(*tree->cb.roffmsg)(tree->arg, |
tree->rbuf->name, tree->rbuf->line, buf); |
ROFF_WARN, tree->cur, pos, buf); |
} |
} |
|
|
|
|
Line 1070 roff_err(const struct rofftree *tree, const char *pos, |
|
Line 1475 roff_err(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->args, ROFF_ERROR, tree->cur, pos, |
(*tree->cb.roffmsg)(tree->arg, |
tree->rbuf->name, tree->rbuf->line, buf); |
ROFF_ERROR, tree->cur, pos, buf); |
} |
} |
|
|