version 1.6, 2008/11/26 16:50:34 |
version 1.153, 2011/07/26 14:24:06 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2010, 2011 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
|
#include <stdlib.h> |
#include <stdlib.h> |
#include <stdio.h> |
|
#include <string.h> |
#include <string.h> |
#include <time.h> |
|
|
|
#include "libmdocml.h" |
#include "mandoc.h" |
#include "private.h" |
#include "libroff.h" |
|
#include "libmandoc.h" |
|
|
/* FIXME: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
/* Maximum number of nested if-else conditionals. */ |
|
#define RSTACK_MAX 128 |
|
|
/* FIXME: warn about empty lists. */ |
enum rofft { |
|
ROFF_ad, |
|
ROFF_am, |
|
ROFF_ami, |
|
ROFF_am1, |
|
ROFF_de, |
|
ROFF_dei, |
|
ROFF_de1, |
|
ROFF_ds, |
|
ROFF_el, |
|
ROFF_hy, |
|
ROFF_ie, |
|
ROFF_if, |
|
ROFF_ig, |
|
ROFF_it, |
|
ROFF_ne, |
|
ROFF_nh, |
|
ROFF_nr, |
|
ROFF_ns, |
|
ROFF_ps, |
|
ROFF_rm, |
|
ROFF_so, |
|
ROFF_ta, |
|
ROFF_tr, |
|
ROFF_TS, |
|
ROFF_TE, |
|
ROFF_T_, |
|
ROFF_EQ, |
|
ROFF_EN, |
|
ROFF_cblock, |
|
ROFF_ccond, |
|
ROFF_USERDEF, |
|
ROFF_MAX |
|
}; |
|
|
#define ROFF_MAXARG 10 |
enum roffrule { |
|
ROFFRULE_ALLOW, |
|
ROFFRULE_DENY |
|
}; |
|
|
enum roffd { |
/* |
ROFF_ENTER = 0, |
* A single register entity. If "set" is zero, the value of the |
ROFF_EXIT |
* register should be the default one, which is per-register. |
|
* Registers are assumed to be unsigned ints for now. |
|
*/ |
|
struct reg { |
|
int set; /* whether set or not */ |
|
unsigned int u; /* unsigned integer */ |
}; |
}; |
|
|
enum rofftype { |
struct roffstr { |
ROFF_COMMENT, |
char *name; /* key of symbol */ |
ROFF_TEXT, |
char *string; /* current value */ |
ROFF_LAYOUT |
struct roffstr *next; /* next in list */ |
}; |
}; |
|
|
#define ROFFCALL_ARGS \ |
struct roff { |
int tok, struct rofftree *tree, \ |
struct mparse *parse; /* parse point */ |
const char *argv[], enum roffd type |
struct roffnode *last; /* leaf of stack */ |
|
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
|
int rstackpos; /* position in rstack */ |
|
struct reg regs[REG__MAX]; |
|
struct roffstr *first_string; /* user-defined strings & macros */ |
|
const char *current_string; /* value of last called user macro */ |
|
struct tbl_node *first_tbl; /* first table parsed */ |
|
struct tbl_node *last_tbl; /* last table parsed */ |
|
struct tbl_node *tbl; /* current table being parsed */ |
|
struct eqn_node *last_eqn; /* last equation parsed */ |
|
struct eqn_node *first_eqn; /* first equation parsed */ |
|
struct eqn_node *eqn; /* current equation being parsed */ |
|
}; |
|
|
struct rofftree; |
struct roffnode { |
|
enum rofft tok; /* type of node */ |
|
struct roffnode *parent; /* up one in stack */ |
|
int line; /* parse line */ |
|
int col; /* parse col */ |
|
char *name; /* node name, e.g. macro name */ |
|
char *end; /* end-rules: custom token */ |
|
int endspan; /* end-rules: next-line or infty */ |
|
enum roffrule rule; /* current evaluation rule */ |
|
}; |
|
|
struct rofftok { |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
int (*cb)(ROFFCALL_ARGS); /* Callback. */ |
enum rofft tok, /* tok of macro */ \ |
const int *args; /* Args (or NULL). */ |
char **bufp, /* input buffer */ \ |
const int *parents; |
size_t *szp, /* size of input buffer */ \ |
const int *children; |
int ln, /* parse line */ \ |
int ctx; |
int ppos, /* original pos in buffer */ \ |
enum rofftype type; /* Type of macro. */ |
int pos, /* current pos in buffer */ \ |
int flags; |
int *offs /* reset offset of buffer data */ |
#define ROFF_NESTED (1 << 0) /* Nested-layout. */ |
|
#define ROFF_PARSED (1 << 1) /* "Parsed". */ |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
#define ROFF_CALLABLE (1 << 2) /* "Callable". */ |
|
#define ROFF_QUOTES (1 << 3) /* Quoted args. */ |
struct roffmac { |
|
const char *name; /* macro name */ |
|
roffproc proc; /* process new macro */ |
|
roffproc text; /* process as child text of macro */ |
|
roffproc sub; /* process as child of macro */ |
|
int flags; |
|
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
|
struct roffmac *next; |
}; |
}; |
|
|
struct roffarg { |
struct predef { |
int flags; |
const char *name; /* predefined input name */ |
#define ROFF_VALUE (1 << 0) /* Has a value. */ |
const char *str; /* replacement symbol */ |
}; |
}; |
|
|
struct roffnode { |
#define PREDEF(__name, __str) \ |
int tok; /* Token id. */ |
{ (__name), (__str) }, |
struct roffnode *parent; /* Parent (or NULL). */ |
|
size_t line; /* Parsed at line. */ |
static enum rofferr roff_block(ROFF_ARGS); |
|
static enum rofferr roff_block_text(ROFF_ARGS); |
|
static enum rofferr roff_block_sub(ROFF_ARGS); |
|
static enum rofferr roff_cblock(ROFF_ARGS); |
|
static enum rofferr roff_ccond(ROFF_ARGS); |
|
static enum rofferr roff_cond(ROFF_ARGS); |
|
static enum rofferr roff_cond_text(ROFF_ARGS); |
|
static enum rofferr roff_cond_sub(ROFF_ARGS); |
|
static enum rofferr roff_ds(ROFF_ARGS); |
|
static enum roffrule roff_evalcond(const char *, int *); |
|
static void roff_freestr(struct roff *); |
|
static char *roff_getname(struct roff *, char **, int, int); |
|
static const char *roff_getstrn(const struct roff *, |
|
const char *, size_t); |
|
static enum rofferr roff_line_ignore(ROFF_ARGS); |
|
static enum rofferr roff_nr(ROFF_ARGS); |
|
static int roff_res(struct roff *, |
|
char **, size_t *, int, int); |
|
static enum rofferr roff_rm(ROFF_ARGS); |
|
static void roff_setstr(struct roff *, |
|
const char *, const char *, int); |
|
static enum rofferr roff_so(ROFF_ARGS); |
|
static enum rofferr roff_TE(ROFF_ARGS); |
|
static enum rofferr roff_TS(ROFF_ARGS); |
|
static enum rofferr roff_EQ(ROFF_ARGS); |
|
static enum rofferr roff_EN(ROFF_ARGS); |
|
static enum rofferr roff_T_(ROFF_ARGS); |
|
static enum rofferr roff_userdef(ROFF_ARGS); |
|
|
|
/* See roff_hash_find() */ |
|
|
|
#define ASCII_HI 126 |
|
#define ASCII_LO 33 |
|
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
|
|
|
static struct roffmac *hash[HASHWIDTH]; |
|
|
|
static struct roffmac roffs[ROFF_MAX] = { |
|
{ "ad", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
|
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "hy", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "it", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
|
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
|
{ "so", roff_so, NULL, NULL, 0, NULL }, |
|
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "tr", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "TS", roff_TS, NULL, NULL, 0, NULL }, |
|
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
|
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
|
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
|
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
|
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
|
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, |
|
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
}; |
}; |
|
|
struct rofftree { |
/* Array of injected predefined strings. */ |
struct roffnode *last; /* Last parsed node. */ |
#define PREDEFS_MAX 38 |
time_t date; /* `Dd' results. */ |
static const struct predef predefs[PREDEFS_MAX] = { |
char os[64]; /* `Os' results. */ |
#include "predefs.in" |
char title[64]; /* `Dt' results. */ |
|
char section[64]; /* `Dt' results. */ |
|
char volume[64]; /* `Dt' results. */ |
|
int state; |
|
#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_Dt (1 << 3) /* `Dt' is parsed. */ |
|
#define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
|
#define ROFF_BODY (1 << 5) /* In roff body. */ |
|
struct md_mbuf *mbuf; /* Output (or NULL). */ |
|
const struct md_args *args; /* Global args. */ |
|
const struct md_rbuf *rbuf; /* Input. */ |
|
const struct roffcb *cb; |
|
}; |
}; |
|
|
static int roff_Dd(ROFFCALL_ARGS); |
static void roff_free1(struct roff *); |
static int roff_Dt(ROFFCALL_ARGS); |
static enum rofft roff_hash_find(const char *, size_t); |
static int roff_Os(ROFFCALL_ARGS); |
static void roff_hash_init(void); |
|
static void roffnode_cleanscope(struct roff *); |
|
static void roffnode_push(struct roff *, enum rofft, |
|
const char *, int, int); |
|
static void roffnode_pop(struct roff *); |
|
static enum rofft roff_parse(struct roff *, const char *, int *); |
|
|
static int roff_layout(ROFFCALL_ARGS); |
/* See roff_hash_find() */ |
static int roff_text(ROFFCALL_ARGS); |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
static int roff_comment(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
static void |
static void roffnode_free(int, struct rofftree *); |
roff_hash_init(void) |
|
{ |
|
struct roffmac *n; |
|
int buc, i; |
|
|
static int rofffindtok(const char *); |
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
static int rofffindarg(const char *); |
assert(roffs[i].name[0] >= ASCII_LO); |
static int rofffindcallable(const char *); |
assert(roffs[i].name[0] <= ASCII_HI); |
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 textparse(const struct rofftree *, |
|
const char *, size_t); |
|
|
|
|
buc = ROFF_HASH(roffs[i].name); |
|
|
static const int roffarg_An[] = { |
if (NULL != (n = hash[buc])) { |
ROFF_Split, ROFF_Nosplit, ROFF_ARGMAX }; |
for ( ; n->next; n = n->next) |
|
/* Do nothing. */ ; |
|
n->next = &roffs[i]; |
|
} else |
|
hash[buc] = &roffs[i]; |
|
} |
|
} |
|
|
static const int roffarg_Bd[] = { |
/* |
ROFF_Ragged, ROFF_Unfilled, ROFF_Literal, ROFF_File, |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
ROFF_Offset, ROFF_ARGMAX }; |
* the nil-terminated string name could be found. |
|
*/ |
|
static enum rofft |
|
roff_hash_find(const char *p, size_t s) |
|
{ |
|
int buc; |
|
struct roffmac *n; |
|
|
static const int roffarg_Bl[] = { |
/* |
ROFF_Bullet, ROFF_Dash, ROFF_Hyphen, ROFF_Item, ROFF_Enum, |
* libroff has an extremely simple hashtable, for the time |
ROFF_Tag, ROFF_Diag, ROFF_Hang, ROFF_Ohang, ROFF_Inset, |
* being, which simply keys on the first character, which must |
ROFF_Column, ROFF_Offset, ROFF_ARGMAX }; |
* be printable, then walks a chain. It works well enough until |
|
* optimised. |
|
*/ |
|
|
static const int roffchild_Bl[] = { ROFF_It, ROFF_El, ROFF_MAX }; |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
|
return(ROFF_MAX); |
|
|
static const int roffparent_El[] = { ROFF_Bl, ROFF_It, ROFF_MAX }; |
buc = ROFF_HASH(p); |
|
|
static const int roffparent_It[] = { ROFF_Bl, ROFF_MAX }; |
if (NULL == (n = hash[buc])) |
|
return(ROFF_MAX); |
|
for ( ; n; n = n->next) |
|
if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s]) |
|
return((enum rofft)(n - roffs)); |
|
|
/* Table of all known tokens. */ |
return(ROFF_MAX); |
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, 0 }, /* 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 */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* D1 */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dl */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bd */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Ed */ |
|
{ roff_layout, roffarg_Bl, NULL, roffchild_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */ |
|
{ roff_layout, NULL, roffparent_El, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */ |
|
{ roff_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, 0 }, /* It */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* An */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ev */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ex */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Fd */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fn */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ft */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* In */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Nd */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ot */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Rv */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xr */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %D */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %N */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %O */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %P */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %R */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %V */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Aq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* At */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Db */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ef */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */ |
|
{ NULL, 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 */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Re */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Rs */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sq */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Sm */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */ |
|
{ NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */ |
|
{ NULL, 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 */ |
|
}; |
|
|
|
/* Table of all known token arguments. */ |
|
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
|
{ 0 }, /* split */ |
|
{ 0 }, /* nosplit */ |
|
{ 0 }, /* ragged */ |
|
{ 0 }, /* unfilled */ |
|
{ 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] = |
/* |
{ |
* Pop the current node off of the stack of roff instructions currently |
"\\\"", |
* pending. |
"Dd", /* Title macros. */ |
*/ |
"Dt", |
static void |
"Os", |
roffnode_pop(struct roff *r) |
"Sh", /* Layout macros */ |
{ |
"Ss", |
struct roffnode *p; |
"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] = |
assert(r->last); |
{ |
p = r->last; |
"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; |
r->last = r->last->parent; |
const char *const *tokargnames = tokargnamesp; |
free(p->name); |
|
free(p->end); |
|
free(p); |
|
} |
|
|
|
|
int |
/* |
roff_free(struct rofftree *tree, int flush) |
* Push a roff node onto the instruction stack. This must later be |
|
* removed with roffnode_pop(). |
|
*/ |
|
static void |
|
roffnode_push(struct roff *r, enum rofft tok, const char *name, |
|
int line, int col) |
{ |
{ |
int error; |
struct roffnode *p; |
|
|
assert(tree->mbuf); |
p = mandoc_calloc(1, sizeof(struct roffnode)); |
if ( ! flush) |
p->tok = tok; |
tree->mbuf = NULL; |
if (name) |
|
p->name = mandoc_strdup(name); |
|
p->parent = r->last; |
|
p->line = line; |
|
p->col = col; |
|
p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY; |
|
|
/* LINTED */ |
r->last = p; |
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)) { |
static void |
warnx("%s: prelude never finished", |
roff_free1(struct roff *r) |
tree->rbuf->name); |
{ |
error = 1; |
struct tbl_node *t; |
|
struct eqn_node *e; |
|
|
|
while (NULL != (t = r->first_tbl)) { |
|
r->first_tbl = t->next; |
|
tbl_free(t); |
} |
} |
|
|
free(tree); |
r->first_tbl = r->last_tbl = r->tbl = NULL; |
return(error ? 0 : 1); |
|
|
while (NULL != (e = r->first_eqn)) { |
|
r->first_eqn = e->next; |
|
eqn_free(e); |
|
} |
|
|
|
r->first_eqn = r->last_eqn = r->eqn = NULL; |
|
|
|
while (r->last) |
|
roffnode_pop(r); |
|
|
|
roff_freestr(r); |
} |
} |
|
|
|
|
struct rofftree * |
void |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
roff_reset(struct roff *r) |
const struct md_rbuf *in, const struct roffcb *cb) |
|
{ |
{ |
struct rofftree *tree; |
int i; |
|
|
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) { |
roff_free1(r); |
warn("malloc"); |
|
return(NULL); |
|
} |
|
|
|
tree->state = ROFF_PRELUDE; |
memset(&r->regs, 0, sizeof(struct reg) * REG__MAX); |
tree->args = args; |
|
tree->mbuf = out; |
|
tree->rbuf = in; |
|
tree->cb = cb; |
|
|
|
return(tree); |
for (i = 0; i < PREDEFS_MAX; i++) |
|
roff_setstr(r, predefs[i].name, predefs[i].str, 0); |
} |
} |
|
|
|
|
int |
void |
roff_engine(struct rofftree *tree, char *buf, size_t sz) |
roff_free(struct roff *r) |
{ |
{ |
|
|
if (0 == sz) { |
roff_free1(r); |
warnx("%s: blank line (line %zu)", |
free(r); |
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} else if ('.' != *buf) |
|
return(textparse(tree, buf, sz)); |
|
|
|
return(roffparse(tree, buf, sz)); |
|
} |
} |
|
|
|
|
static int |
struct roff * |
textparse(const struct rofftree *tree, const char *buf, size_t sz) |
roff_alloc(struct mparse *parse) |
{ |
{ |
|
struct roff *r; |
|
int i; |
|
|
|
r = mandoc_calloc(1, sizeof(struct roff)); |
|
r->parse = parse; |
|
r->rstackpos = -1; |
|
|
if (NULL == tree->last) { |
roff_hash_init(); |
warnx("%s: unexpected text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} else if (NULL == tree->last->parent) { |
|
warnx("%s: disallowed text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
/* Print text. */ |
for (i = 0; i < PREDEFS_MAX; i++) |
|
roff_setstr(r, predefs[i].name, predefs[i].str, 0); |
|
|
return(1); |
return(r); |
} |
} |
|
|
|
/* |
|
* Pre-filter each and every line for reserved words (one beginning with |
|
* `\*', e.g., `\*(ab'). These must be handled before the actual line |
|
* is processed. |
|
* This also checks the syntax of regular escapes. |
|
*/ |
static int |
static int |
roffargs(int tok, char *buf, char **argv) |
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
{ |
{ |
int i; |
enum mandoc_esc esc; |
|
const char *stesc; /* start of an escape sequence ('\\') */ |
|
const char *stnam; /* start of the name, after "[(*" */ |
|
const char *cp; /* end of the name, e.g. before ']' */ |
|
const char *res; /* the string to be substituted */ |
|
int i, maxl; |
|
size_t nsz; |
|
char *n; |
|
|
(void)tok;/* FIXME: quotable strings? */ |
/* Search for a leading backslash and save a pointer to it. */ |
|
|
assert(tok >= 0 && tok < ROFF_MAX); |
cp = *bufp + pos; |
assert('.' == *buf); |
while (NULL != (cp = strchr(cp, '\\'))) { |
|
stesc = cp++; |
|
|
/* LINTED */ |
/* |
for (i = 0; *buf && i < ROFF_MAXARG; i++) { |
* The second character must be an asterisk. |
argv[i] = buf++; |
* If it isn't, skip it anyway: It is escaped, |
while (*buf && ! isspace(*buf)) |
* so it can't start another escape sequence. |
buf++; |
*/ |
if (0 == *buf) { |
|
|
if ('\0' == *cp) |
|
return(1); |
|
|
|
if ('*' != *cp) { |
|
res = cp; |
|
esc = mandoc_escape(&cp, NULL, NULL); |
|
if (ESCAPE_ERROR != esc) |
|
continue; |
|
cp = res; |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
continue; |
continue; |
} |
} |
*buf++ = 0; |
|
while (*buf && isspace(*buf)) |
|
buf++; |
|
} |
|
|
|
assert(i > 0); |
|
if (i < ROFF_MAXARG) |
|
argv[i] = NULL; |
|
|
|
return(ROFF_MAXARG > i); |
cp++; |
} |
|
|
|
|
/* |
|
* The third character decides the length |
|
* of the name of the string. |
|
* Save a pointer to the name. |
|
*/ |
|
|
/* XXX */ |
switch (*cp) { |
static int |
case ('\0'): |
roffscan(int tok, const int *tokv) |
|
{ |
|
if (NULL == tokv) |
|
return(1); |
|
|
|
for ( ; ROFF_MAX != *tokv; tokv++) |
|
if (tok == *tokv) |
|
return(1); |
return(1); |
|
case ('('): |
|
cp++; |
|
maxl = 2; |
|
break; |
|
case ('['): |
|
cp++; |
|
maxl = 0; |
|
break; |
|
default: |
|
maxl = 1; |
|
break; |
|
} |
|
stnam = cp; |
|
|
return(0); |
/* Advance to the end of the name. */ |
} |
|
|
|
|
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { |
|
if ('\0' == *cp) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, |
|
r->parse, ln, |
|
(int)(stesc - *bufp), NULL); |
|
return(1); |
|
} |
|
if (0 == maxl && ']' == *cp) |
|
break; |
|
} |
|
|
static int |
/* |
roffparse(struct rofftree *tree, char *buf, size_t sz) |
* Retrieve the replacement string; if it is |
{ |
* undefined, resume searching for escapes. |
int tok, t; |
*/ |
struct roffnode *n; |
|
char *argv[ROFF_MAXARG]; |
|
const char **argvp; |
|
|
|
assert(sz > 0); |
res = roff_getstrn(r, stnam, (size_t)i); |
|
|
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
if (NULL == res) { |
warnx("%s: unknown line macro (line %zu)", |
mandoc_msg |
tree->rbuf->name, tree->rbuf->line); |
(MANDOCERR_BADESCAPE, r->parse, |
return(0); |
ln, (int)(stesc - *bufp), NULL); |
} else if (NULL == tokens[tok].cb) { |
res = ""; |
warnx("%s: macro `%s' not supported (line %zu)", |
} |
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} else if (ROFF_COMMENT == tokens[tok].type) |
|
return(1); |
|
|
|
if ( ! roffargs(tok, buf, argv)) { |
|
warnx("%s: too many args to `%s' (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} else |
|
argvp = (const char **)argv + 1; |
|
|
|
/* |
/* Replace the escape sequence by the string. */ |
* Prelude macros break some assumptions: branch now. |
|
*/ |
|
|
|
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); |
nsz = *szp + strlen(res) + 1; |
|
n = mandoc_malloc(nsz); |
|
|
/* |
strlcpy(n, *bufp, (size_t)(stesc - *bufp + 1)); |
* First check that our possible parents and parent's possible |
strlcat(n, res, nsz); |
* children are satisfied. |
strlcat(n, cp + (maxl ? 0 : 1), nsz); |
*/ |
|
|
|
if ( ! roffscan(tree->last->tok, tokens[tok].parents)) { |
free(*bufp); |
warnx("%s: invalid parent `%s' for `%s' (line %zu)", |
|
tree->rbuf->name, |
|
toknames[tree->last->tok], |
|
toknames[tok], tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
if ( ! roffscan(tok, tokens[tree->last->tok].children)) { |
*bufp = n; |
warnx("%s: invalid child `%s' for `%s' (line %zu)", |
*szp = nsz; |
tree->rbuf->name, toknames[tok], |
|
toknames[tree->last->tok], |
|
tree->rbuf->line); |
|
return(0); |
return(0); |
} |
} |
|
|
|
return(1); |
|
} |
|
|
|
enum rofferr |
|
roff_parseln(struct roff *r, int ln, char **bufp, |
|
size_t *szp, int pos, int *offs) |
|
{ |
|
enum rofft t; |
|
enum rofferr e; |
|
int ppos, ctl; |
|
|
/* |
/* |
* Branch if we're not a layout token. |
* Run the reserved-word filter only if we have some reserved |
|
* words to fill in. |
*/ |
*/ |
|
|
if (ROFF_LAYOUT != tokens[tok].type) |
if ( ! roff_res(r, bufp, szp, ln, pos)) |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
return(ROFF_REPARSE); |
|
|
/* |
ppos = pos; |
* Check our scope rules. |
ctl = mandoc_getcontrol(*bufp, &pos); |
|
|
|
/* |
|
* First, if a scope is open and we're not a macro, pass the |
|
* text through the macro's filter. If a scope isn't open and |
|
* we're not a macro, just let it through. |
|
* Finally, if there's an equation scope open, divert it into it |
|
* no matter our state. |
*/ |
*/ |
|
|
if (0 == tokens[tok].ctx) |
if (r->last && ! ctl) { |
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
t = r->last->tok; |
|
assert(roffs[t].text); |
|
e = (*roffs[t].text) |
|
(r, t, bufp, szp, ln, pos, pos, offs); |
|
assert(ROFF_IGN == e || ROFF_CONT == e); |
|
if (ROFF_CONT != e) |
|
return(e); |
|
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
|
if (r->tbl) |
|
return(tbl_read(r->tbl, ln, *bufp, pos)); |
|
return(ROFF_CONT); |
|
} else if ( ! ctl) { |
|
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
|
if (r->tbl) |
|
return(tbl_read(r->tbl, ln, *bufp, pos)); |
|
return(ROFF_CONT); |
|
} else if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); |
|
|
if (tok == tokens[tok].ctx) { |
/* |
for (n = tree->last; n; n = n->parent) { |
* If a scope is open, go to the child handler for that macro, |
assert(0 == tokens[n->tok].ctx || |
* as it may want to preprocess before doing anything with it. |
n->tok == tokens[n->tok].ctx); |
* Don't do so if an equation is open. |
if (n->tok == tok) |
*/ |
break; |
|
} |
|
if (NULL == n) { |
|
#ifdef DEBUG |
|
(void)printf("scope: new `%s'\n", |
|
toknames[tok]); |
|
#endif |
|
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
|
} |
|
do { |
|
t = tree->last->tok; |
|
#ifdef DEBUG |
|
(void)printf("scope: closing `%s'\n", |
|
toknames[t]); |
|
#endif |
|
if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
|
return(0); |
|
} while (t != tok); |
|
|
|
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
if (r->last) { |
|
t = r->last->tok; |
|
assert(roffs[t].sub); |
|
return((*roffs[t].sub) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
/* |
|
* Lastly, as we've no scope open, try to look up and execute |
|
* the new macro. If no macro is found, simply return and let |
|
* the compilers handle it. |
|
*/ |
|
|
do { |
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
t = tree->last->tok; |
return(ROFF_CONT); |
#ifdef DEBUG |
|
(void)printf("scope: closing `%s'\n", toknames[t]); |
|
#endif |
|
if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
|
return(0); |
|
} while (t != tokens[tok].ctx); |
|
|
|
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
assert(roffs[t].proc); |
|
return((*roffs[t].proc) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
static int |
void |
rofffindarg(const char *name) |
roff_endparse(struct roff *r) |
{ |
{ |
size_t i; |
|
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
if (r->last) |
|
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
|
r->last->line, r->last->col, NULL); |
|
|
/* LINTED */ |
if (r->eqn) { |
for (i = 0; i < ROFF_ARGMAX; i++) |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
/* LINTED */ |
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); |
if (0 == strcmp(name, tokargnames[i])) |
eqn_end(&r->eqn); |
return((int)i); |
} |
|
|
return(ROFF_ARGMAX); |
if (r->tbl) { |
|
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
|
r->tbl->line, r->tbl->pos, NULL); |
|
tbl_end(&r->tbl); |
|
} |
} |
} |
|
|
|
/* |
|
* Parse a roff node's type from the input buffer. This must be in the |
|
* form of ".foo xxx" in the usual way. |
|
*/ |
|
static enum rofft |
|
roff_parse(struct roff *r, const char *buf, int *pos) |
|
{ |
|
const char *mac; |
|
size_t maclen; |
|
enum rofft t; |
|
|
static int |
if ('\0' == buf[*pos] || '"' == buf[*pos] || |
rofffindtok(const char *buf) |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
|
return(ROFF_MAX); |
|
|
|
/* |
|
* We stop the macro parse at an escape, tab, space, or nil. |
|
* However, `\}' is also a valid macro, so make sure we don't |
|
* clobber it by seeing the `\' as the end of token. |
|
*/ |
|
|
|
mac = buf + *pos; |
|
maclen = strcspn(mac + 1, " \\\t\0") + 1; |
|
|
|
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
|
? ROFF_USERDEF : roff_hash_find(mac, maclen); |
|
|
|
*pos += (int)maclen; |
|
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
|
(*pos)++; |
|
|
|
return(t); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cblock(ROFF_ARGS) |
{ |
{ |
char token[4]; |
|
size_t i; |
|
|
|
for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
/* |
token[i] = *buf; |
* A block-close `..' should only be invoked as a child of an |
|
* ignore macro, otherwise raise a warning and just ignore it. |
|
*/ |
|
|
if (i == 3) { |
if (NULL == r->last) { |
#ifdef DEBUG |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
(void)printf("lookup: macro too long: `%s'\n", buf); |
return(ROFF_IGN); |
#endif |
|
return(ROFF_MAX); |
|
} |
} |
|
|
token[i] = 0; |
switch (r->last->tok) { |
|
case (ROFF_am): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ami): |
|
/* FALLTHROUGH */ |
|
case (ROFF_am1): |
|
/* FALLTHROUGH */ |
|
case (ROFF_de): |
|
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ |
|
/* FALLTHROUGH */ |
|
case (ROFF_dei): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ig): |
|
break; |
|
default: |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
#ifdef DEBUG |
if ((*bufp)[pos]) |
(void)printf("lookup: `%s'\n", token); |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
#endif |
|
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
|
|
/* LINTED */ |
|
for (i = 0; i < ROFF_MAX; i++) |
|
/* LINTED */ |
|
if (0 == strcmp(toknames[i], token)) |
|
return((int)i); |
|
|
|
return(ROFF_MAX); |
|
} |
} |
|
|
|
|
static int |
static void |
rofffindcallable(const char *name) |
roffnode_cleanscope(struct roff *r) |
{ |
{ |
int c; |
|
|
|
if (ROFF_MAX == (c = rofffindtok(name))) |
while (r->last) { |
return(ROFF_MAX); |
if (--r->last->endspan < 0) |
return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
break; |
|
roffnode_pop(r); |
|
} |
} |
} |
|
|
|
|
static struct roffnode * |
/* ARGSUSED */ |
roffnode_new(int tokid, struct rofftree *tree) |
static enum rofferr |
|
roff_ccond(ROFF_ARGS) |
{ |
{ |
struct roffnode *p; |
|
|
if (NULL == r->last) { |
if (NULL == (p = malloc(sizeof(struct roffnode)))) { |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
warn("malloc"); |
return(ROFF_IGN); |
return(NULL); |
|
} |
} |
|
|
p->line = tree->rbuf->line; |
switch (r->last->tok) { |
p->tok = tokid; |
case (ROFF_el): |
p->parent = tree->last; |
/* FALLTHROUGH */ |
tree->last = p; |
case (ROFF_ie): |
return(p); |
/* FALLTHROUGH */ |
|
case (ROFF_if): |
|
break; |
|
default: |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
if (r->last->endspan > -1) { |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
if ((*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffargok(int tokid, int argid) |
static enum rofferr |
|
roff_block(ROFF_ARGS) |
{ |
{ |
const int *c; |
int sv; |
|
size_t sz; |
|
char *name; |
|
|
if (NULL == (c = tokens[tokid].args)) |
name = NULL; |
return(0); |
|
|
|
for ( ; ROFF_ARGMAX != *c; c++) |
if (ROFF_ig != tok) { |
if (argid == *c) |
if ('\0' == (*bufp)[pos]) { |
return(1); |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
return(0); |
/* |
} |
* Re-write `de1', since we don't really care about |
|
* groff's strange compatibility mode, into `de'. |
|
*/ |
|
|
|
if (ROFF_de1 == tok) |
|
tok = ROFF_de; |
|
if (ROFF_de == tok) |
|
name = *bufp + pos; |
|
else |
|
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, |
|
roffs[tok].name); |
|
|
static void |
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
roffnode_free(int tokid, struct rofftree *tree) |
pos++; |
{ |
|
struct roffnode *p; |
|
|
|
assert(tree->last); |
while (isspace((unsigned char)(*bufp)[pos])) |
assert(tree->last->tok == tokid); |
(*bufp)[pos++] = '\0'; |
|
} |
|
|
p = tree->last; |
roffnode_push(r, tok, name, ln, ppos); |
tree->last = tree->last->parent; |
|
free(p); |
|
} |
|
|
|
|
/* |
|
* At the beginning of a `de' macro, clear the existing string |
|
* with the same name, if there is one. New content will be |
|
* added from roff_block_text() in multiline mode. |
|
*/ |
|
|
static int |
if (ROFF_de == tok) |
roffnextopt(int tok, const char ***in, char **val) |
roff_setstr(r, name, "", 0); |
{ |
|
const char *arg, **argv; |
|
int v; |
|
|
|
*val = NULL; |
if ('\0' == (*bufp)[pos]) |
argv = *in; |
return(ROFF_IGN); |
assert(argv); |
|
|
|
if (NULL == (arg = *argv)) |
/* If present, process the custom end-of-line marker. */ |
return(-1); |
|
if ('-' != *arg) |
|
return(-1); |
|
|
|
/* FIXME: should we let this slide... ? */ |
sv = pos; |
|
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
|
pos++; |
|
|
if (ROFF_ARGMAX == (v = rofffindarg(&arg[1]))) |
/* |
return(-1); |
* Note: groff does NOT like escape characters in the input. |
|
* Instead of detecting this, we're just going to let it fly and |
|
* to hell with it. |
|
*/ |
|
|
/* FIXME: should we let this slide... ? */ |
assert(pos > sv); |
|
sz = (size_t)(pos - sv); |
|
|
if ( ! roffargok(tok, v)) |
if (1 == sz && '.' == (*bufp)[sv]) |
return(-1); |
return(ROFF_IGN); |
if ( ! (ROFF_VALUE & tokenargs[v].flags)) |
|
return(v); |
|
|
|
*in = ++argv; |
r->last->end = mandoc_malloc(sz + 1); |
|
|
/* FIXME: what if this looks like a roff token or argument? */ |
memcpy(r->last->end, *bufp + sv, sz); |
|
r->last->end[(int)sz] = '\0'; |
|
|
return(*argv ? v : ROFF_ARGMAX); |
if ((*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_block_sub(ROFF_ARGS) |
{ |
{ |
|
enum rofft t; |
|
int i, j; |
|
|
if (ROFF_BODY & tree->state) { |
/* |
assert( ! (ROFF_PRELUDE & tree->state)); |
* First check whether a custom macro exists at this level. If |
assert(ROFF_PRELUDE_Dd & tree->state); |
* it does, then check against it. This is some of groff's |
return(roff_text(tok, tree, argv, type)); |
* stranger behaviours. If we encountered a custom end-scope |
|
* tag and that tag also happens to be a "real" macro, then we |
|
* need to try interpreting it again as a real macro. If it's |
|
* not, then return ignore. Else continue. |
|
*/ |
|
|
|
if (r->last->end) { |
|
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
|
if ((*bufp)[i] != r->last->end[j]) |
|
break; |
|
|
|
if ('\0' == r->last->end[j] && |
|
('\0' == (*bufp)[i] || |
|
' ' == (*bufp)[i] || |
|
'\t' == (*bufp)[i])) { |
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
|
|
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
|
i++; |
|
|
|
pos = i; |
|
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
|
return(ROFF_RERUN); |
|
return(ROFF_IGN); |
|
} |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
/* |
assert( ! (ROFF_BODY & tree->state)); |
* If we have no custom end-query or lookup failed, then try |
|
* pulling it out of the hashtable. |
|
*/ |
|
|
if (ROFF_PRELUDE_Dd & tree->state) { |
t = roff_parse(r, *bufp, &pos); |
warnx("%s: prelude `Dd' repeated (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
/* |
return(0); |
* Macros other than block-end are only significant |
} else if (ROFF_PRELUDE_Dt & tree->state) { |
* in `de' blocks; elsewhere, simply throw them away. |
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
*/ |
tree->rbuf->name, tree->rbuf->line); |
if (ROFF_cblock != t) { |
return(0); |
if (ROFF_de == tok) |
|
roff_setstr(r, r->last->name, *bufp + ppos, 1); |
|
return(ROFF_IGN); |
} |
} |
|
|
/* TODO: parse date. */ |
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
|
} |
|
|
assert(NULL == tree->last); |
|
tree->state |= ROFF_PRELUDE_Dd; |
|
|
|
return(1); |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_block_text(ROFF_ARGS) |
|
{ |
|
|
|
if (ROFF_de == tok) |
|
roff_setstr(r, r->last->name, *bufp + pos, 1); |
|
|
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dt(ROFFCALL_ARGS) |
roff_cond_sub(ROFF_ARGS) |
{ |
{ |
|
enum rofft t; |
|
enum roffrule rr; |
|
char *ep; |
|
|
if (ROFF_BODY & tree->state) { |
rr = r->last->rule; |
assert( ! (ROFF_PRELUDE & tree->state)); |
roffnode_cleanscope(r); |
assert(ROFF_PRELUDE_Dt & tree->state); |
|
return(roff_text(tok, tree, argv, type)); |
/* |
|
* If the macro is unknown, first check if it contains a closing |
|
* delimiter `\}'. If it does, close out our scope and return |
|
* the currently-scoped rule (ignore or continue). Else, drop |
|
* into the currently-scoped rule. |
|
*/ |
|
|
|
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) { |
|
ep = &(*bufp)[pos]; |
|
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
|
ep++; |
|
if ('}' != *ep) |
|
continue; |
|
|
|
/* |
|
* Make the \} go away. |
|
* This is a little haphazard, as it's not quite |
|
* clear how nroff does this. |
|
* If we're at the end of line, then just chop |
|
* off the \} and resize the buffer. |
|
* If we aren't, then conver it to spaces. |
|
*/ |
|
|
|
if ('\0' == *(ep + 1)) { |
|
*--ep = '\0'; |
|
*szp -= 2; |
|
} else |
|
*(ep - 1) = *ep = ' '; |
|
|
|
roff_ccond(r, ROFF_ccond, bufp, szp, |
|
ln, pos, pos + 2, offs); |
|
break; |
|
} |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
/* |
assert( ! (ROFF_BODY & tree->state)); |
* A denied conditional must evaluate its children if and only |
|
* if they're either structurally required (such as loops and |
|
* conditionals) or a closing macro. |
|
*/ |
|
|
if ( ! (ROFF_PRELUDE_Dd & tree->state)) { |
if (ROFFRULE_DENY == rr) |
warnx("%s: prelude `Dt' out-of-order (line %zu)", |
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
tree->rbuf->name, tree->rbuf->line); |
if (ROFF_ccond != t) |
return(0); |
return(ROFF_IGN); |
} else if (ROFF_PRELUDE_Dt & tree->state) { |
|
warnx("%s: prelude `Dt' repeated (line %zu)", |
assert(roffs[t].proc); |
tree->rbuf->name, tree->rbuf->line); |
return((*roffs[t].proc)(r, t, bufp, szp, |
return(0); |
ln, ppos, pos, offs)); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cond_text(ROFF_ARGS) |
|
{ |
|
char *ep; |
|
enum roffrule rr; |
|
|
|
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
|
|
ep = &(*bufp)[pos]; |
|
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
|
ep++; |
|
if ('}' != *ep) |
|
continue; |
|
*ep = '&'; |
|
roff_ccond(r, ROFF_ccond, bufp, szp, |
|
ln, pos, pos + 2, offs); |
} |
} |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
} |
|
|
/* TODO: parse date. */ |
static enum roffrule |
|
roff_evalcond(const char *v, int *pos) |
|
{ |
|
|
assert(NULL == tree->last); |
switch (v[*pos]) { |
tree->state |= ROFF_PRELUDE_Dt; |
case ('n'): |
|
(*pos)++; |
|
return(ROFFRULE_ALLOW); |
|
case ('e'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
|
/* FALLTHROUGH */ |
|
case ('t'): |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
|
default: |
|
break; |
|
} |
|
|
return(1); |
while (v[*pos] && ' ' != v[*pos]) |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
} |
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_line_ignore(ROFF_ARGS) |
|
{ |
|
|
|
if (ROFF_it == tok) |
|
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, "it"); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Os(ROFFCALL_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
|
int sv; |
|
enum roffrule rule; |
|
|
if (ROFF_EXIT == type) { |
/* |
assert(ROFF_PRELUDE_Os & tree->state); |
* An `.el' has no conditional body: it will consume the value |
return(roff_layout(tok, tree, argv, type)); |
* of the current rstack entry set in prior `ie' calls or |
} else if (ROFF_BODY & tree->state) { |
* defaults to DENY. |
assert( ! (ROFF_PRELUDE & tree->state)); |
* |
assert(ROFF_PRELUDE_Os & tree->state); |
* If we're not an `el', however, then evaluate the conditional. |
return(roff_text(tok, tree, argv, type)); |
*/ |
|
|
|
rule = ROFF_el == tok ? |
|
(r->rstackpos < 0 ? |
|
ROFFRULE_DENY : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(*bufp, &pos); |
|
|
|
sv = pos; |
|
while (' ' == (*bufp)[pos]) |
|
pos++; |
|
|
|
/* |
|
* Roff is weird. If we have just white-space after the |
|
* conditional, it's considered the BODY and we exit without |
|
* really doing anything. Warn about this. It's probably |
|
* wrong. |
|
*/ |
|
|
|
if ('\0' == (*bufp)[pos] && sv != pos) { |
|
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
roffnode_push(r, tok, NULL, ln, ppos); |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
|
! (ROFF_PRELUDE_Dd & tree->state)) { |
r->last->rule = rule; |
warnx("%s: prelude `Os' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
/* |
return(0); |
* An if-else will put the NEGATION of the current evaluated |
|
* conditional into the stack of rules. |
|
*/ |
|
|
|
if (ROFF_ie == tok) { |
|
if (r->rstackpos == RSTACK_MAX - 1) { |
|
mandoc_msg(MANDOCERR_MEM, |
|
r->parse, ln, ppos, NULL); |
|
return(ROFF_ERR); |
|
} |
|
r->rstack[++r->rstackpos] = |
|
ROFFRULE_DENY == r->last->rule ? |
|
ROFFRULE_ALLOW : ROFFRULE_DENY; |
} |
} |
|
|
/* TODO: extract OS. */ |
/* If the parent has false as its rule, then so do we. */ |
|
|
tree->state |= ROFF_PRELUDE_Os; |
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) |
tree->state &= ~ROFF_PRELUDE; |
r->last->rule = ROFFRULE_DENY; |
tree->state |= ROFF_BODY; |
|
|
|
assert(NULL == tree->last); |
/* |
|
* Determine scope. If we're invoked with "\{" trailing the |
|
* conditional, then we're in a multiline scope. Else our scope |
|
* expires on the next line. |
|
*/ |
|
|
return(roff_layout(tok, tree, argv, type)); |
r->last->endspan = 1; |
|
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
|
r->last->endspan = -1; |
|
pos += 2; |
|
} |
|
|
|
/* |
|
* If there are no arguments on the line, the next-line scope is |
|
* assumed. |
|
*/ |
|
|
|
if ('\0' == (*bufp)[pos]) |
|
return(ROFF_IGN); |
|
|
|
/* Otherwise re-run the roff parser after recalculating. */ |
|
|
|
*offs = pos; |
|
return(ROFF_RERUN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_layout(ROFFCALL_ARGS) |
roff_ds(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
char *name, *string; |
char *v, *argvp[ROFF_MAXARG]; |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
/* |
warnx("%s: macro `%s' called in prelude (line %zu)", |
* A symbol is named by the first word following the macro |
tree->rbuf->name, |
* invocation up to a space. Its value is anything after the |
toknames[tok], |
* name's trailing whitespace and optional double-quote. Thus, |
tree->rbuf->line); |
* |
return(0); |
* [.ds foo "bar " ] |
|
* |
|
* will have `bar " ' as its value. |
|
*/ |
|
|
|
string = *bufp + pos; |
|
name = roff_getname(r, &string, ln, pos); |
|
if ('\0' == *name) |
|
return(ROFF_IGN); |
|
|
|
/* Read past initial double-quote. */ |
|
if ('"' == *string) |
|
string++; |
|
|
|
/* The rest is the value. */ |
|
roff_setstr(r, name, string, 0); |
|
return(ROFF_IGN); |
|
} |
|
|
|
int |
|
roff_regisset(const struct roff *r, enum regs reg) |
|
{ |
|
|
|
return(r->regs[(int)reg].set); |
|
} |
|
|
|
unsigned int |
|
roff_regget(const struct roff *r, enum regs reg) |
|
{ |
|
|
|
return(r->regs[(int)reg].u); |
|
} |
|
|
|
void |
|
roff_regunset(struct roff *r, enum regs reg) |
|
{ |
|
|
|
r->regs[(int)reg].set = 0; |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_nr(ROFF_ARGS) |
|
{ |
|
const char *key; |
|
char *val; |
|
int iv; |
|
|
|
val = *bufp + pos; |
|
key = roff_getname(r, &val, ln, pos); |
|
|
|
if (0 == strcmp(key, "nS")) { |
|
r->regs[(int)REG_nS].set = 1; |
|
if ((iv = mandoc_strntoi(val, strlen(val), 10)) >= 0) |
|
r->regs[(int)REG_nS].u = (unsigned)iv; |
|
else |
|
r->regs[(int)REG_nS].u = 0u; |
} |
} |
|
|
if (ROFF_EXIT == type) { |
return(ROFF_IGN); |
roffnode_free(tok, tree); |
} |
return((*tree->cb->roffblkout)(tok)); |
|
} |
|
|
|
i = 0; |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_rm(ROFF_ARGS) |
|
{ |
|
const char *name; |
|
char *cp; |
|
|
while (-1 != (c = roffnextopt(tok, &argv, &v))) { |
cp = *bufp + pos; |
if (ROFF_ARGMAX == c) { |
while ('\0' != *cp) { |
warnx("%s: error parsing `%s' args (line %zu)", |
name = roff_getname(r, &cp, ln, (int)(cp - *bufp)); |
tree->rbuf->name, |
if ('\0' != *name) |
toknames[tok], |
roff_setstr(r, name, NULL, 0); |
tree->rbuf->line); |
|
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++; |
|
} |
} |
|
return(ROFF_IGN); |
|
} |
|
|
argcp[i] = ROFF_ARGMAX; |
/* ARGSUSED */ |
argvp[i] = NULL; |
static enum rofferr |
|
roff_TE(ROFF_ARGS) |
|
{ |
|
|
if (NULL == roffnode_new(tok, tree)) |
if (NULL == r->tbl) |
return(0); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
else |
|
tbl_end(&r->tbl); |
|
|
if ( ! (*tree->cb->roffin)(tok, argcp, argvp)) |
return(ROFF_IGN); |
return(0); |
} |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
/* ARGSUSED */ |
/* TODO: print all tokens. */ |
static enum rofferr |
|
roff_T_(ROFF_ARGS) |
|
{ |
|
|
if ( ! ((*tree->cb->roffout)(tok))) |
if (NULL == r->tbl) |
return(0); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return((*tree->cb->roffblkin)(tok)); |
else |
|
tbl_restart(ppos, ln, r->tbl); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
int |
|
roff_closeeqn(struct roff *r) |
|
{ |
|
|
|
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
|
} |
|
|
|
void |
|
roff_openeqn(struct roff *r, const char *name, int line, |
|
int offs, const char *buf) |
|
{ |
|
struct eqn_node *e; |
|
int poff; |
|
|
|
assert(NULL == r->eqn); |
|
e = eqn_alloc(name, offs, line, r->parse); |
|
|
|
if (r->last_eqn) |
|
r->last_eqn->next = e; |
|
else |
|
r->first_eqn = r->last_eqn = e; |
|
|
|
r->eqn = r->last_eqn = e; |
|
|
|
if (buf) { |
|
poff = 0; |
|
eqn_read(&r->eqn, line, buf, offs, &poff); |
} |
} |
|
} |
|
|
while (*argv) { |
/* ARGSUSED */ |
if (2 >= strlen(*argv) && ROFF_MAX != |
static enum rofferr |
(c = rofffindcallable(*argv))) |
roff_EQ(ROFF_ARGS) |
if ( ! (*tokens[c].cb)(c, tree, |
{ |
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); |
argv++; |
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_EN(ROFF_ARGS) |
|
{ |
|
|
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TS(ROFF_ARGS) |
|
{ |
|
struct tbl_node *t; |
|
|
|
if (r->tbl) { |
|
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
|
tbl_end(&r->tbl); |
} |
} |
|
|
if ( ! ((*tree->cb->roffout)(tok))) |
t = tbl_alloc(ppos, ln, r->parse); |
return(0); |
|
|
|
return((*tree->cb->roffblkin)(tok)); |
if (r->last_tbl) |
|
r->last_tbl->next = t; |
|
else |
|
r->first_tbl = r->last_tbl = t; |
|
|
|
r->tbl = r->last_tbl = t; |
|
return(ROFF_IGN); |
} |
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_so(ROFF_ARGS) |
|
{ |
|
char *name; |
|
|
|
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); |
|
|
|
/* |
|
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
|
* opening anything that's not in our cwd or anything beneath |
|
* it. Thus, explicitly disallow traversing up the file-system |
|
* or using absolute paths. |
|
*/ |
|
|
|
name = *bufp + pos; |
|
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
|
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); |
|
return(ROFF_ERR); |
|
} |
|
|
|
*offs = pos; |
|
return(ROFF_SO); |
|
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_text(ROFFCALL_ARGS) |
roff_userdef(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
const char *arg[9]; |
char *v, *argvp[ROFF_MAXARG]; |
char *cp, *n1, *n2; |
|
int i; |
|
|
if (ROFF_PRELUDE & tree->state) { |
/* |
warnx("%s: macro `%s' called in prelude (line %zu)", |
* Collect pointers to macro argument strings |
tree->rbuf->name, |
* and null-terminate them. |
toknames[tok], |
*/ |
tree->rbuf->line); |
cp = *bufp + pos; |
return(0); |
for (i = 0; i < 9; i++) |
|
arg[i] = '\0' == *cp ? "" : |
|
mandoc_getarg(r->parse, &cp, ln, &pos); |
|
|
|
/* |
|
* Expand macro arguments. |
|
*/ |
|
*szp = 0; |
|
n1 = cp = mandoc_strdup(r->current_string); |
|
while (NULL != (cp = strstr(cp, "\\$"))) { |
|
i = cp[2] - '1'; |
|
if (0 > i || 8 < i) { |
|
/* Not an argument invocation. */ |
|
cp += 2; |
|
continue; |
|
} |
|
|
|
*szp = strlen(n1) - 3 + strlen(arg[i]) + 1; |
|
n2 = mandoc_malloc(*szp); |
|
|
|
strlcpy(n2, n1, (size_t)(cp - n1 + 1)); |
|
strlcat(n2, arg[i], *szp); |
|
strlcat(n2, cp + 3, *szp); |
|
|
|
cp = n2 + (cp - n1); |
|
free(n1); |
|
n1 = n2; |
} |
} |
|
|
i = 0; |
/* |
|
* Replace the macro invocation |
|
* by the expanded macro. |
|
*/ |
|
free(*bufp); |
|
*bufp = n1; |
|
if (0 == *szp) |
|
*szp = strlen(*bufp) + 1; |
|
|
while (-1 != (c = roffnextopt(tok, &argv, &v))) { |
return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ? |
if (ROFF_ARGMAX == c) { |
ROFF_REPARSE : ROFF_APPEND); |
warnx("%s: error parsing `%s' args (line %zu)", |
} |
tree->rbuf->name, |
|
toknames[tok], |
static char * |
tree->rbuf->line); |
roff_getname(struct roff *r, char **cpp, int ln, int pos) |
return(0); |
{ |
} |
char *name, *cp; |
argcp[i] = c; |
|
argvp[i] = v; |
name = *cpp; |
i++; |
if ('\0' == *name) |
argv++; |
return(name); |
|
|
|
/* Read until end of name. */ |
|
for (cp = name; '\0' != *cp && ' ' != *cp; cp++) { |
|
if ('\\' != *cp) |
|
continue; |
|
cp++; |
|
if ('\\' == *cp) |
|
continue; |
|
mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL); |
|
*cp = '\0'; |
|
name = cp; |
} |
} |
|
|
argcp[i] = ROFF_ARGMAX; |
/* Nil-terminate name. */ |
argvp[i] = NULL; |
if ('\0' != *cp) |
|
*(cp++) = '\0'; |
|
|
if ( ! (*tree->cb->roffin)(tok, argcp, argvp)) |
/* Read past spaces. */ |
return(0); |
while (' ' == *cp) |
|
cp++; |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
*cpp = cp; |
/* TODO: print all tokens. */ |
return(name); |
return((*tree->cb->roffout)(tok)); |
} |
|
|
|
/* |
|
* Store *string into the user-defined string called *name. |
|
* In multiline mode, append to an existing entry and append '\n'; |
|
* else replace the existing entry, if there is one. |
|
* To clear an existing entry, call with (*r, *name, NULL, 0). |
|
*/ |
|
static void |
|
roff_setstr(struct roff *r, const char *name, const char *string, |
|
int multiline) |
|
{ |
|
struct roffstr *n; |
|
char *c; |
|
size_t oldch, newch; |
|
|
|
/* Search for an existing string with the same name. */ |
|
n = r->first_string; |
|
while (n && strcmp(name, n->name)) |
|
n = n->next; |
|
|
|
if (NULL == n) { |
|
/* Create a new string table entry. */ |
|
n = mandoc_malloc(sizeof(struct roffstr)); |
|
n->name = mandoc_strdup(name); |
|
n->string = NULL; |
|
n->next = r->first_string; |
|
r->first_string = n; |
|
} else if (0 == multiline) { |
|
/* In multiline mode, append; else replace. */ |
|
free(n->string); |
|
n->string = NULL; |
} |
} |
|
|
while (*argv) { |
if (NULL == string) |
if (2 >= strlen(*argv) && ROFF_MAX != |
return; |
(c = rofffindcallable(*argv))) |
|
if ( ! (*tokens[c].cb)(c, tree, |
|
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
/* |
argv++; |
* One additional byte for the '\n' in multiline mode, |
|
* and one for the terminating '\0'. |
|
*/ |
|
newch = strlen(string) + (multiline ? 2u : 1u); |
|
if (NULL == n->string) { |
|
n->string = mandoc_malloc(newch); |
|
*n->string = '\0'; |
|
oldch = 0; |
|
} else { |
|
oldch = strlen(n->string); |
|
n->string = mandoc_realloc(n->string, oldch + newch); |
} |
} |
|
|
return((*tree->cb->roffout)(tok)); |
/* Skip existing content in the destination buffer. */ |
|
c = n->string + (int)oldch; |
|
|
|
/* Append new content to the destination buffer. */ |
|
while (*string) { |
|
/* |
|
* Rudimentary roff copy mode: |
|
* Handle escaped backslashes. |
|
*/ |
|
if ('\\' == *string && '\\' == *(string + 1)) |
|
string++; |
|
*c++ = *string++; |
|
} |
|
|
|
/* Append terminating bytes. */ |
|
if (multiline) |
|
*c++ = '\n'; |
|
*c = '\0'; |
} |
} |
|
|
|
static const char * |
|
roff_getstrn(const struct roff *r, const char *name, size_t len) |
|
{ |
|
const struct roffstr *n; |
|
|
/* ARGUSED */ |
n = r->first_string; |
static int |
while (n && (strncmp(name, n->name, len) || '\0' != n->name[(int)len])) |
roff_comment(ROFFCALL_ARGS) |
n = n->next; |
|
|
|
return(n ? n->string : NULL); |
|
} |
|
|
|
static void |
|
roff_freestr(struct roff *r) |
{ |
{ |
|
struct roffstr *n, *nn; |
|
|
return(1); |
for (n = r->first_string; n; n = nn) { |
|
free(n->name); |
|
free(n->string); |
|
nn = n->next; |
|
free(n); |
|
} |
|
|
|
r->first_string = NULL; |
|
} |
|
|
|
const struct tbl_span * |
|
roff_span(const struct roff *r) |
|
{ |
|
|
|
return(r->tbl ? tbl_span(r->tbl) : NULL); |
|
} |
|
|
|
const struct eqn * |
|
roff_eqn(const struct roff *r) |
|
{ |
|
|
|
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
|
} |
|
|
|
char |
|
roff_eqndelim(const struct roff *r) |
|
{ |
|
|
|
return('\0'); |
} |
} |