Return to roff.c CVS log | Up to [cvsweb.bsd.lv] / mandoc |
version 1.174, 2012/06/12 20:21:04 | version 1.244, 2014/12/18 17:43:41 | ||
---|---|---|---|
|
|
||
/* $Id$ */ | /* $Id$ */ | ||
/* | /* | ||
* Copyright (c) 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> | * Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> | ||
* Copyright (c) 2010, 2011, 2012 Ingo Schwarze <schwarze@openbsd.org> | * Copyright (c) 2010-2014 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 above | * purpose with or without fee is hereby granted, provided that the above | ||
|
|
||
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF | * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF | ||
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. | * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. | ||
*/ | */ | ||
#ifdef HAVE_CONFIG_H | |||
#include "config.h" | #include "config.h" | ||
#endif | |||
#include <sys/types.h> | |||
#include <assert.h> | #include <assert.h> | ||
#include <ctype.h> | #include <ctype.h> | ||
#include <stdio.h> | |||
#include <stdlib.h> | #include <stdlib.h> | ||
#include <string.h> | #include <string.h> | ||
#include "mandoc.h" | #include "mandoc.h" | ||
#include "libroff.h" | #include "mandoc_aux.h" | ||
#include "libmandoc.h" | #include "libmandoc.h" | ||
#include "libroff.h" | |||
/* Maximum number of nested if-else conditionals. */ | /* Maximum number of nested if-else conditionals. */ | ||
#define RSTACK_MAX 128 | #define RSTACK_MAX 128 | ||
|
|
||
ROFF_am, | ROFF_am, | ||
ROFF_ami, | ROFF_ami, | ||
ROFF_am1, | ROFF_am1, | ||
ROFF_as, | |||
ROFF_cc, | ROFF_cc, | ||
ROFF_ce, | |||
ROFF_de, | ROFF_de, | ||
ROFF_dei, | ROFF_dei, | ||
ROFF_de1, | ROFF_de1, | ||
ROFF_ds, | ROFF_ds, | ||
ROFF_el, | ROFF_el, | ||
ROFF_fam, | |||
ROFF_hw, | |||
ROFF_hy, | ROFF_hy, | ||
ROFF_ie, | ROFF_ie, | ||
ROFF_if, | ROFF_if, | ||
|
|
||
ROFF_nh, | ROFF_nh, | ||
ROFF_nr, | ROFF_nr, | ||
ROFF_ns, | ROFF_ns, | ||
ROFF_pl, | |||
ROFF_ps, | ROFF_ps, | ||
ROFF_rm, | ROFF_rm, | ||
ROFF_rr, | |||
ROFF_so, | ROFF_so, | ||
ROFF_ta, | ROFF_ta, | ||
ROFF_tr, | ROFF_tr, | ||
ROFF_Dd, | |||
ROFF_TH, | |||
ROFF_TS, | ROFF_TS, | ||
ROFF_TE, | ROFF_TE, | ||
ROFF_T_, | ROFF_T_, | ||
ROFF_EQ, | ROFF_EQ, | ||
ROFF_EN, | ROFF_EN, | ||
ROFF_cblock, | ROFF_cblock, | ||
ROFF_ccond, | |||
ROFF_USERDEF, | ROFF_USERDEF, | ||
ROFF_MAX | ROFF_MAX | ||
}; | }; | ||
enum roffrule { | |||
ROFFRULE_ALLOW, | |||
ROFFRULE_DENY | |||
}; | |||
/* | /* | ||
* A single register entity. If "set" is zero, the value of the | |||
* 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 */ | |||
}; | |||
/* | |||
* An incredibly-simple string buffer. | * An incredibly-simple string buffer. | ||
*/ | */ | ||
struct roffstr { | struct roffstr { | ||
|
|
||
struct roffkv *next; /* next in list */ | struct roffkv *next; /* next in list */ | ||
}; | }; | ||
/* | |||
* A single number register as part of a singly-linked list. | |||
*/ | |||
struct roffreg { | |||
struct roffstr key; | |||
int val; | |||
struct roffreg *next; | |||
}; | |||
struct roff { | struct roff { | ||
struct mparse *parse; /* parse point */ | struct mparse *parse; /* parse point */ | ||
const struct mchars *mchars; /* character table */ | |||
struct roffnode *last; /* leaf of stack */ | struct roffnode *last; /* leaf of stack */ | ||
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ | int *rstack; /* stack of inverted `ie' values */ | ||
char control; /* control character */ | struct roffreg *regtab; /* number registers */ | ||
int rstackpos; /* position in rstack */ | |||
struct reg regs[REG__MAX]; | |||
struct roffkv *strtab; /* user-defined strings & macros */ | struct roffkv *strtab; /* user-defined strings & macros */ | ||
struct roffkv *xmbtab; /* multi-byte trans table (`tr') */ | struct roffkv *xmbtab; /* multi-byte trans table (`tr') */ | ||
struct roffstr *xtab; /* single-byte trans table (`tr') */ | struct roffstr *xtab; /* single-byte trans table (`tr') */ | ||
|
|
||
struct eqn_node *last_eqn; /* last equation parsed */ | struct eqn_node *last_eqn; /* last equation parsed */ | ||
struct eqn_node *first_eqn; /* first equation parsed */ | struct eqn_node *first_eqn; /* first equation parsed */ | ||
struct eqn_node *eqn; /* current equation being parsed */ | struct eqn_node *eqn; /* current equation being parsed */ | ||
int eqn_inline; /* current equation is inline */ | |||
int options; /* parse options */ | |||
int rstacksz; /* current size limit of rstack */ | |||
int rstackpos; /* position in rstack */ | |||
int format; /* current file in mdoc or man format */ | |||
char control; /* control character */ | |||
}; | }; | ||
struct roffnode { | struct roffnode { | ||
|
|
||
char *name; /* node name, e.g. macro name */ | char *name; /* node name, e.g. macro name */ | ||
char *end; /* end-rules: custom token */ | char *end; /* end-rules: custom token */ | ||
int endspan; /* end-rules: next-line or infty */ | int endspan; /* end-rules: next-line or infty */ | ||
enum roffrule rule; /* current evaluation rule */ | int rule; /* current evaluation rule */ | ||
}; | }; | ||
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ | #define ROFF_ARGS struct roff *r, /* parse ctx */ \ | ||
enum rofft tok, /* tok of macro */ \ | enum rofft tok, /* tok of macro */ \ | ||
char **bufp, /* input buffer */ \ | struct buf *buf, /* input buffer */ \ | ||
size_t *szp, /* size of input buffer */ \ | |||
int ln, /* parse line */ \ | int ln, /* parse line */ \ | ||
int ppos, /* original pos in buffer */ \ | int ppos, /* original pos in buffer */ \ | ||
int pos, /* current pos in buffer */ \ | int pos, /* current pos in buffer */ \ | ||
|
|
||
static enum rofferr roff_block_sub(ROFF_ARGS); | static enum rofferr roff_block_sub(ROFF_ARGS); | ||
static enum rofferr roff_cblock(ROFF_ARGS); | static enum rofferr roff_cblock(ROFF_ARGS); | ||
static enum rofferr roff_cc(ROFF_ARGS); | static enum rofferr roff_cc(ROFF_ARGS); | ||
static enum rofferr roff_ccond(ROFF_ARGS); | static void roff_ccond(struct roff *, int, int); | ||
static enum rofferr roff_cond(ROFF_ARGS); | static enum rofferr roff_cond(ROFF_ARGS); | ||
static enum rofferr roff_cond_text(ROFF_ARGS); | static enum rofferr roff_cond_text(ROFF_ARGS); | ||
static enum rofferr roff_cond_sub(ROFF_ARGS); | static enum rofferr roff_cond_sub(ROFF_ARGS); | ||
static enum rofferr roff_ds(ROFF_ARGS); | static enum rofferr roff_ds(ROFF_ARGS); | ||
static enum roffrule roff_evalcond(const char *, int *); | static enum rofferr roff_eqndelim(struct roff *, struct buf *, int); | ||
static int roff_evalcond(struct roff *r, int, | |||
const char *, int *); | |||
static int roff_evalnum(struct roff *, int, | |||
const char *, int *, int *, int); | |||
static int roff_evalpar(struct roff *, int, | |||
const char *, int *, int *); | |||
static int roff_evalstrcond(const char *, int *); | |||
static void roff_free1(struct roff *); | static void roff_free1(struct roff *); | ||
static void roff_freereg(struct roffreg *); | |||
static void roff_freestr(struct roffkv *); | static void roff_freestr(struct roffkv *); | ||
static char *roff_getname(struct roff *, char **, int, int); | static size_t roff_getname(struct roff *, char **, int, int); | ||
static const char *roff_getstrn(const struct roff *, | static int roff_getnum(const char *, int *, int *); | ||
static int roff_getop(const char *, int *, char *); | |||
static int roff_getregn(const struct roff *, | |||
const char *, size_t); | const char *, size_t); | ||
static int roff_getregro(const char *name); | |||
static const char *roff_getstrn(const struct roff *, | |||
const char *, size_t); | |||
static enum rofferr roff_it(ROFF_ARGS); | |||
static enum rofferr roff_line_ignore(ROFF_ARGS); | static enum rofferr roff_line_ignore(ROFF_ARGS); | ||
static enum rofferr roff_nr(ROFF_ARGS); | static enum rofferr roff_nr(ROFF_ARGS); | ||
static void roff_openeqn(struct roff *, const char *, | static enum rofft roff_parse(struct roff *, char *, int *, | ||
int, int, const char *); | int, int); | ||
static enum rofft roff_parse(struct roff *, const char *, int *); | static enum rofferr roff_parsetext(struct buf *, int, int *); | ||
static enum rofferr roff_parsetext(char *); | static enum rofferr roff_res(struct roff *, struct buf *, int, int); | ||
static enum rofferr roff_res(struct roff *, | |||
char **, size_t *, int, int); | |||
static enum rofferr roff_rm(ROFF_ARGS); | static enum rofferr roff_rm(ROFF_ARGS); | ||
static enum rofferr roff_rr(ROFF_ARGS); | |||
static void roff_setstr(struct roff *, | static void roff_setstr(struct roff *, | ||
const char *, const char *, int); | const char *, const char *, int); | ||
static void roff_setstrn(struct roffkv **, const char *, | static void roff_setstrn(struct roffkv **, const char *, | ||
size_t, const char *, size_t, int); | size_t, const char *, size_t, int); | ||
static enum rofferr roff_so(ROFF_ARGS); | static enum rofferr roff_so(ROFF_ARGS); | ||
static enum rofferr roff_tr(ROFF_ARGS); | static enum rofferr roff_tr(ROFF_ARGS); | ||
static enum rofferr roff_Dd(ROFF_ARGS); | |||
static enum rofferr roff_TH(ROFF_ARGS); | |||
static enum rofferr roff_TE(ROFF_ARGS); | static enum rofferr roff_TE(ROFF_ARGS); | ||
static enum rofferr roff_TS(ROFF_ARGS); | static enum rofferr roff_TS(ROFF_ARGS); | ||
static enum rofferr roff_EQ(ROFF_ARGS); | static enum rofferr roff_EQ(ROFF_ARGS); | ||
|
|
||
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | { "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | ||
{ "ami", 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 }, | { "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | ||
{ "as", roff_ds, NULL, NULL, 0, NULL }, | |||
{ "cc", roff_cc, NULL, NULL, 0, NULL }, | { "cc", roff_cc, NULL, NULL, 0, NULL }, | ||
{ "ce", roff_line_ignore, NULL, NULL, 0, NULL }, | |||
{ "de", 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 }, | { "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | ||
{ "de1", 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 }, | { "ds", roff_ds, NULL, NULL, 0, NULL }, | ||
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, | { "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, | ||
{ "fam", roff_line_ignore, NULL, NULL, 0, NULL }, | |||
{ "hw", roff_line_ignore, NULL, NULL, 0, NULL }, | |||
{ "hy", roff_line_ignore, NULL, NULL, 0, NULL }, | { "hy", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, 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 }, | { "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, | ||
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | { "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, | ||
{ "it", roff_line_ignore, NULL, NULL, 0, NULL }, | { "it", roff_it, NULL, NULL, 0, NULL }, | ||
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, | { "ne", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, | { "nh", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "nr", roff_nr, NULL, NULL, 0, NULL }, | { "nr", roff_nr, NULL, NULL, 0, NULL }, | ||
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, | { "ns", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "pl", roff_line_ignore, NULL, NULL, 0, NULL }, | |||
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, | { "ps", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "rm", roff_rm, NULL, NULL, 0, NULL }, | { "rm", roff_rm, NULL, NULL, 0, NULL }, | ||
{ "rr", roff_rr, NULL, NULL, 0, NULL }, | |||
{ "so", roff_so, NULL, NULL, 0, NULL }, | { "so", roff_so, NULL, NULL, 0, NULL }, | ||
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, | { "ta", roff_line_ignore, NULL, NULL, 0, NULL }, | ||
{ "tr", roff_tr, NULL, NULL, 0, NULL }, | { "tr", roff_tr, NULL, NULL, 0, NULL }, | ||
{ "Dd", roff_Dd, NULL, NULL, 0, NULL }, | |||
{ "TH", roff_TH, NULL, NULL, 0, NULL }, | |||
{ "TS", roff_TS, NULL, NULL, 0, NULL }, | { "TS", roff_TS, NULL, NULL, 0, NULL }, | ||
{ "TE", roff_TE, NULL, NULL, 0, NULL }, | { "TE", roff_TE, NULL, NULL, 0, NULL }, | ||
{ "T&", roff_T_, NULL, NULL, 0, NULL }, | { "T&", roff_T_, NULL, NULL, 0, NULL }, | ||
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, | { "EQ", roff_EQ, NULL, NULL, 0, NULL }, | ||
{ "EN", roff_EN, NULL, NULL, 0, NULL }, | { "EN", roff_EN, NULL, NULL, 0, NULL }, | ||
{ ".", roff_cblock, NULL, NULL, 0, NULL }, | { ".", roff_cblock, NULL, NULL, 0, NULL }, | ||
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, | |||
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, | { NULL, roff_userdef, NULL, NULL, 0, NULL }, | ||
}; | }; | ||
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ | |||
const char *const __mdoc_reserved[] = { | |||
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", | |||
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", | |||
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", | |||
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", | |||
"Dt", "Dv", "Dx", "D1", | |||
"Ec", "Ed", "Ef", "Ek", "El", "Em", | |||
"En", "Eo", "Er", "Es", "Ev", "Ex", | |||
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", | |||
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", | |||
"Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", | |||
"Oc", "Oo", "Op", "Os", "Ot", "Ox", | |||
"Pa", "Pc", "Pf", "Po", "Pp", "Pq", | |||
"Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv", | |||
"Sc", "Sh", "Sm", "So", "Sq", | |||
"Ss", "St", "Sx", "Sy", | |||
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", | |||
"%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O", | |||
"%P", "%Q", "%R", "%T", "%U", "%V", | |||
NULL | |||
}; | |||
/* not currently implemented: BT DE DS ME MT PT SY TQ YS */ | |||
const char *const __man_reserved[] = { | |||
"AT", "B", "BI", "BR", "DT", | |||
"EE", "EN", "EQ", "EX", "HP", "I", "IB", "IP", "IR", | |||
"LP", "OP", "P", "PD", "PP", | |||
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", | |||
"TE", "TH", "TP", "TS", "T&", "UC", "UE", "UR", | |||
NULL | |||
}; | |||
/* Array of injected predefined strings. */ | /* Array of injected predefined strings. */ | ||
#define PREDEFS_MAX 38 | #define PREDEFS_MAX 38 | ||
static const struct predef predefs[PREDEFS_MAX] = { | static const struct predef predefs[PREDEFS_MAX] = { | ||
|
|
||
/* See roffhash_find() */ | /* See roffhash_find() */ | ||
#define ROFF_HASH(p) (p[0] - ASCII_LO) | #define ROFF_HASH(p) (p[0] - ASCII_LO) | ||
static int roffit_lines; /* number of lines to delay */ | |||
static char *roffit_macro; /* nil-terminated macro line */ | |||
static void | static void | ||
roffhash_init(void) | roffhash_init(void) | ||
{ | { | ||
|
|
||
return(ROFF_MAX); | return(ROFF_MAX); | ||
} | } | ||
/* | /* | ||
* Pop the current node off of the stack of roff instructions currently | * Pop the current node off of the stack of roff instructions currently | ||
* pending. | * pending. | ||
|
|
||
struct roffnode *p; | struct roffnode *p; | ||
assert(r->last); | assert(r->last); | ||
p = r->last; | p = r->last; | ||
r->last = r->last->parent; | r->last = r->last->parent; | ||
free(p->name); | free(p->name); | ||
|
|
||
free(p); | free(p); | ||
} | } | ||
/* | /* | ||
* Push a roff node onto the instruction stack. This must later be | * Push a roff node onto the instruction stack. This must later be | ||
* removed with roffnode_pop(). | * removed with roffnode_pop(). | ||
|
|
||
p->parent = r->last; | p->parent = r->last; | ||
p->line = line; | p->line = line; | ||
p->col = col; | p->col = col; | ||
p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY; | p->rule = p->parent ? p->parent->rule : 0; | ||
r->last = p; | r->last = p; | ||
} | } | ||
static void | static void | ||
roff_free1(struct roff *r) | roff_free1(struct roff *r) | ||
{ | { | ||
struct tbl_node *t; | struct tbl_node *tbl; | ||
struct eqn_node *e; | struct eqn_node *e; | ||
int i; | int i; | ||
while (NULL != (t = r->first_tbl)) { | while (NULL != (tbl = r->first_tbl)) { | ||
r->first_tbl = t->next; | r->first_tbl = tbl->next; | ||
tbl_free(t); | tbl_free(tbl); | ||
} | } | ||
r->first_tbl = r->last_tbl = r->tbl = NULL; | r->first_tbl = r->last_tbl = r->tbl = NULL; | ||
while (NULL != (e = r->first_eqn)) { | while (NULL != (e = r->first_eqn)) { | ||
r->first_eqn = e->next; | r->first_eqn = e->next; | ||
eqn_free(e); | eqn_free(e); | ||
} | } | ||
r->first_eqn = r->last_eqn = r->eqn = NULL; | r->first_eqn = r->last_eqn = r->eqn = NULL; | ||
while (r->last) | while (r->last) | ||
roffnode_pop(r); | roffnode_pop(r); | ||
free (r->rstack); | |||
r->rstack = NULL; | |||
r->rstacksz = 0; | |||
r->rstackpos = -1; | |||
roff_freereg(r->regtab); | |||
r->regtab = NULL; | |||
roff_freestr(r->strtab); | roff_freestr(r->strtab); | ||
roff_freestr(r->xmbtab); | roff_freestr(r->xmbtab); | ||
r->strtab = r->xmbtab = NULL; | r->strtab = r->xmbtab = NULL; | ||
if (r->xtab) | if (r->xtab) | ||
for (i = 0; i < 128; i++) | for (i = 0; i < 128; i++) | ||
free(r->xtab[i].p); | free(r->xtab[i].p); | ||
free(r->xtab); | free(r->xtab); | ||
r->xtab = NULL; | r->xtab = NULL; | ||
} | } | ||
|
|
||
void | void | ||
roff_reset(struct roff *r) | roff_reset(struct roff *r) | ||
{ | { | ||
int i; | |||
roff_free1(r); | roff_free1(r); | ||
r->format = r->options & (MPARSE_MDOC | MPARSE_MAN); | |||
r->control = 0; | r->control = 0; | ||
memset(&r->regs, 0, sizeof(struct reg) * REG__MAX); | |||
for (i = 0; i < PREDEFS_MAX; i++) | |||
roff_setstr(r, predefs[i].name, predefs[i].str, 0); | |||
} | } | ||
void | void | ||
roff_free(struct roff *r) | roff_free(struct roff *r) | ||
{ | { | ||
|
|
||
free(r); | free(r); | ||
} | } | ||
struct roff * | struct roff * | ||
roff_alloc(struct mparse *parse) | roff_alloc(struct mparse *parse, const struct mchars *mchars, int options) | ||
{ | { | ||
struct roff *r; | struct roff *r; | ||
int i; | |||
r = mandoc_calloc(1, sizeof(struct roff)); | r = mandoc_calloc(1, sizeof(struct roff)); | ||
r->parse = parse; | r->parse = parse; | ||
r->mchars = mchars; | |||
r->options = options; | |||
r->format = options & (MPARSE_MDOC | MPARSE_MAN); | |||
r->rstackpos = -1; | r->rstackpos = -1; | ||
roffhash_init(); | roffhash_init(); | ||
for (i = 0; i < PREDEFS_MAX; i++) | |||
roff_setstr(r, predefs[i].name, predefs[i].str, 0); | |||
return(r); | return(r); | ||
} | } | ||
/* | /* | ||
* Pre-filter each and every line for reserved words (one beginning with | * In the current line, expand escape sequences that tend to get | ||
* `\*', e.g., `\*(ab'). These must be handled before the actual line | * used in numerical expressions and conditional requests. | ||
* is processed. | * Also check the syntax of the remaining escape sequences. | ||
* This also checks the syntax of regular escapes. | |||
*/ | */ | ||
static enum rofferr | static enum rofferr | ||
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) | roff_res(struct roff *r, struct buf *buf, int ln, int pos) | ||
{ | { | ||
enum mandoc_esc esc; | char ubuf[24]; /* buffer to print the number */ | ||
const char *stesc; /* start of an escape sequence ('\\') */ | const char *start; /* start of the string to process */ | ||
char *stesc; /* start of an escape sequence ('\\') */ | |||
const char *stnam; /* start of the name, after "[(*" */ | const char *stnam; /* start of the name, after "[(*" */ | ||
const char *cp; /* end of the name, e.g. before ']' */ | const char *cp; /* end of the name, e.g. before ']' */ | ||
const char *res; /* the string to be substituted */ | const char *res; /* the string to be substituted */ | ||
int i, maxl, expand_count; | char *nbuf; /* new buffer to copy buf->buf to */ | ||
size_t nsz; | size_t maxl; /* expected length of the escape name */ | ||
char *n; | size_t naml; /* actual length of the escape name */ | ||
enum mandoc_esc esc; /* type of the escape sequence */ | |||
int inaml; /* length returned from mandoc_escape() */ | |||
int expand_count; /* to avoid infinite loops */ | |||
int npos; /* position in numeric expression */ | |||
int arg_complete; /* argument not interrupted by eol */ | |||
char term; /* character terminating the escape */ | |||
expand_count = 0; | expand_count = 0; | ||
start = buf->buf + pos; | |||
stesc = strchr(start, '\0') - 1; | |||
while (stesc-- > start) { | |||
again: | /* Search backwards for the next backslash. */ | ||
cp = *bufp + pos; | |||
while (NULL != (cp = strchr(cp, '\\'))) { | |||
stesc = cp++; | |||
/* | if (*stesc != '\\') | ||
* The second character must be an asterisk. | continue; | ||
* If it isn't, skip it anyway: It is escaped, | |||
* so it can't start another escape sequence. | |||
*/ | |||
if ('\0' == *cp) | /* If it is escaped, skip it. */ | ||
return(ROFF_CONT); | |||
if ('*' != *cp) { | for (cp = stesc - 1; cp >= start; cp--) | ||
res = cp; | if (*cp != '\\') | ||
esc = mandoc_escape(&cp, NULL, NULL); | break; | ||
if (ESCAPE_ERROR != esc) | |||
continue; | if ((stesc - cp) % 2 == 0) { | ||
cp = res; | stesc = (char *)cp; | ||
mandoc_msg | continue; | ||
(MANDOCERR_BADESCAPE, r->parse, | |||
ln, (int)(stesc - *bufp), NULL); | |||
return(ROFF_CONT); | |||
} | } | ||
cp++; | /* Decide whether to expand or to check only. */ | ||
term = '\0'; | |||
cp = stesc + 1; | |||
switch (*cp) { | |||
case '*': | |||
res = NULL; | |||
break; | |||
case 'B': | |||
/* FALLTHROUGH */ | |||
case 'w': | |||
term = cp[1]; | |||
/* FALLTHROUGH */ | |||
case 'n': | |||
res = ubuf; | |||
break; | |||
default: | |||
esc = mandoc_escape(&cp, &stnam, &inaml); | |||
if (esc == ESCAPE_ERROR || | |||
(esc == ESCAPE_SPECIAL && | |||
mchars_spec2cp(r->mchars, stnam, inaml) < 0)) | |||
mandoc_vmsg(MANDOCERR_ESC_BAD, | |||
r->parse, ln, (int)(stesc - buf->buf), | |||
"%.*s", (int)(cp - stesc), stesc); | |||
continue; | |||
} | |||
if (EXPAND_LIMIT < ++expand_count) { | |||
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, | |||
ln, (int)(stesc - buf->buf), NULL); | |||
return(ROFF_IGN); | |||
} | |||
/* | /* | ||
* The third character decides the length | * The third character decides the length | ||
* of the name of the string. | * of the name of the string or register. | ||
* Save a pointer to the name. | * Save a pointer to the name. | ||
*/ | */ | ||
switch (*cp) { | if (term == '\0') { | ||
case ('\0'): | switch (*++cp) { | ||
return(ROFF_CONT); | case '\0': | ||
case ('('): | maxl = 0; | ||
cp++; | break; | ||
maxl = 2; | case '(': | ||
break; | cp++; | ||
case ('['): | maxl = 2; | ||
cp++; | break; | ||
case '[': | |||
cp++; | |||
term = ']'; | |||
maxl = 0; | |||
break; | |||
default: | |||
maxl = 1; | |||
break; | |||
} | |||
} else { | |||
cp += 2; | |||
maxl = 0; | maxl = 0; | ||
break; | |||
default: | |||
maxl = 1; | |||
break; | |||
} | } | ||
stnam = cp; | stnam = cp; | ||
/* Advance to the end of the name. */ | /* Advance to the end of the name. */ | ||
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { | arg_complete = 1; | ||
if ('\0' == *cp) { | for (naml = 0; maxl == 0 || naml < maxl; naml++, cp++) { | ||
mandoc_msg | if (*cp == '\0') { | ||
(MANDOCERR_BADESCAPE, | mandoc_msg(MANDOCERR_ESC_BAD, r->parse, | ||
r->parse, ln, | ln, (int)(stesc - buf->buf), stesc); | ||
(int)(stesc - *bufp), NULL); | arg_complete = 0; | ||
return(ROFF_CONT); | break; | ||
} | } | ||
if (0 == maxl && ']' == *cp) | if (maxl == 0 && *cp == term) { | ||
cp++; | |||
break; | break; | ||
} | |||
} | } | ||
/* | /* | ||
|
|
||
* undefined, resume searching for escapes. | * undefined, resume searching for escapes. | ||
*/ | */ | ||
res = roff_getstrn(r, stnam, (size_t)i); | switch (stesc[1]) { | ||
case '*': | |||
if (arg_complete) | |||
res = roff_getstrn(r, stnam, naml); | |||
break; | |||
case 'B': | |||
npos = 0; | |||
ubuf[0] = arg_complete && | |||
roff_evalnum(r, ln, stnam, &npos, NULL, 0) && | |||
stnam + npos + 1 == cp ? '1' : '0'; | |||
ubuf[1] = '\0'; | |||
break; | |||
case 'n': | |||
if (arg_complete) | |||
(void)snprintf(ubuf, sizeof(ubuf), "%d", | |||
roff_getregn(r, stnam, naml)); | |||
else | |||
ubuf[0] = '\0'; | |||
break; | |||
case 'w': | |||
/* use even incomplete args */ | |||
(void)snprintf(ubuf, sizeof(ubuf), "%d", | |||
24 * (int)naml); | |||
break; | |||
} | |||
if (NULL == res) { | if (res == NULL) { | ||
mandoc_msg | mandoc_vmsg(MANDOCERR_STR_UNDEF, | ||
(MANDOCERR_BADESCAPE, r->parse, | r->parse, ln, (int)(stesc - buf->buf), | ||
ln, (int)(stesc - *bufp), NULL); | "%.*s", (int)naml, stnam); | ||
res = ""; | res = ""; | ||
} | } | ||
/* Replace the escape sequence by the string. */ | /* Replace the escape sequence by the string. */ | ||
pos = stesc - *bufp; | *stesc = '\0'; | ||
buf->sz = mandoc_asprintf(&nbuf, "%s%s%s", | |||
buf->buf, res, cp) + 1; | |||
nsz = *szp + strlen(res) + 1; | /* Prepare for the next replacement. */ | ||
n = mandoc_malloc(nsz); | |||
strlcpy(n, *bufp, (size_t)(stesc - *bufp + 1)); | start = nbuf + pos; | ||
strlcat(n, res, nsz); | stesc = nbuf + (stesc - buf->buf) + strlen(res); | ||
strlcat(n, cp + (maxl ? 0 : 1), nsz); | free(buf->buf); | ||
buf->buf = nbuf; | |||
free(*bufp); | |||
*bufp = n; | |||
*szp = nsz; | |||
if (EXPAND_LIMIT >= ++expand_count) | |||
goto again; | |||
/* Just leave the string unexpanded. */ | |||
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, ln, pos, NULL); | |||
return(ROFF_IGN); | |||
} | } | ||
return(ROFF_CONT); | return(ROFF_CONT); | ||
} | } | ||
/* | /* | ||
* Process text streams: convert all breakable hyphens into ASCII_HYPH. | * Process text streams: | ||
* Convert all breakable hyphens into ASCII_HYPH. | |||
* Decrement and spring input line trap. | |||
*/ | */ | ||
static enum rofferr | static enum rofferr | ||
roff_parsetext(char *p) | roff_parsetext(struct buf *buf, int pos, int *offs) | ||
{ | { | ||
size_t sz; | size_t sz; | ||
const char *start; | const char *start; | ||
char *p; | |||
int isz; | |||
enum mandoc_esc esc; | enum mandoc_esc esc; | ||
start = p; | start = p = buf->buf + pos; | ||
while ('\0' != *p) { | while (*p != '\0') { | ||
sz = strcspn(p, "-\\"); | sz = strcspn(p, "-\\"); | ||
p += sz; | p += sz; | ||
if ('\0' == *p) | if (*p == '\0') | ||
break; | break; | ||
if ('\\' == *p) { | if (*p == '\\') { | ||
/* Skip over escapes. */ | /* Skip over escapes. */ | ||
p++; | p++; | ||
esc = mandoc_escape | esc = mandoc_escape((const char **)&p, NULL, NULL); | ||
((const char **)&p, NULL, NULL); | if (esc == ESCAPE_ERROR) | ||
if (ESCAPE_ERROR == esc) | |||
break; | break; | ||
continue; | continue; | ||
} else if (p == start) { | } else if (p == start) { | ||
|
|
||
p++; | p++; | ||
} | } | ||
/* Spring the input line trap. */ | |||
if (roffit_lines == 1) { | |||
isz = mandoc_asprintf(&p, "%s\n.%s", buf->buf, roffit_macro); | |||
free(buf->buf); | |||
buf->buf = p; | |||
buf->sz = isz + 1; | |||
*offs = 0; | |||
free(roffit_macro); | |||
roffit_lines = 0; | |||
return(ROFF_REPARSE); | |||
} else if (roffit_lines > 1) | |||
--roffit_lines; | |||
return(ROFF_CONT); | return(ROFF_CONT); | ||
} | } | ||
enum rofferr | enum rofferr | ||
roff_parseln(struct roff *r, int ln, char **bufp, | roff_parseln(struct roff *r, int ln, struct buf *buf, int *offs) | ||
size_t *szp, int pos, int *offs) | |||
{ | { | ||
enum rofft t; | enum rofft t; | ||
enum rofferr e; | enum rofferr e; | ||
int ppos, ctl; | int pos; /* parse point */ | ||
int spos; /* saved parse point for messages */ | |||
int ppos; /* original offset in buf->buf */ | |||
int ctl; /* macro line (boolean) */ | |||
/* | ppos = pos = *offs; | ||
* Run the reserved-word filter only if we have some reserved | |||
* words to fill in. | |||
*/ | |||
e = roff_res(r, bufp, szp, ln, pos); | /* Handle in-line equation delimiters. */ | ||
if (ROFF_IGN == e) | |||
if (r->tbl == NULL && | |||
r->last_eqn != NULL && r->last_eqn->delim && | |||
(r->eqn == NULL || r->eqn_inline)) { | |||
e = roff_eqndelim(r, buf, pos); | |||
if (e == ROFF_REPARSE) | |||
return(e); | |||
assert(e == ROFF_CONT); | |||
} | |||
/* Expand some escape sequences. */ | |||
e = roff_res(r, buf, ln, pos); | |||
if (e == ROFF_IGN) | |||
return(e); | return(e); | ||
assert(ROFF_CONT == e); | assert(e == ROFF_CONT); | ||
ppos = pos; | ctl = roff_getcontrol(r, buf->buf, &pos); | ||
ctl = roff_getcontrol(r, *bufp, &pos); | |||
/* | /* | ||
* First, if a scope is open and we're not a macro, pass the | * First, if a scope is open and we're not a macro, pass the | ||
|
|
||
if (r->last && ! ctl) { | if (r->last && ! ctl) { | ||
t = r->last->tok; | t = r->last->tok; | ||
assert(roffs[t].text); | assert(roffs[t].text); | ||
e = (*roffs[t].text) | e = (*roffs[t].text)(r, t, buf, ln, pos, pos, offs); | ||
(r, t, bufp, szp, ln, pos, pos, offs); | assert(e == ROFF_IGN || e == ROFF_CONT); | ||
assert(ROFF_IGN == e || ROFF_CONT == e); | if (e != ROFF_CONT) | ||
if (ROFF_CONT != e) | |||
return(e); | return(e); | ||
if (r->eqn) | } | ||
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); | if (r->eqn) | ||
return(eqn_read(&r->eqn, ln, buf->buf, ppos, offs)); | |||
if ( ! ctl) { | |||
if (r->tbl) | if (r->tbl) | ||
return(tbl_read(r->tbl, ln, *bufp, pos)); | return(tbl_read(r->tbl, ln, buf->buf, pos)); | ||
return(roff_parsetext(*bufp + pos)); | return(roff_parsetext(buf, pos, offs)); | ||
} 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_parsetext(*bufp + pos)); | |||
} else if (r->eqn) | |||
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); | |||
/* Skip empty request lines. */ | |||
if (buf->buf[pos] == '"') { | |||
mandoc_msg(MANDOCERR_COMMENT_BAD, r->parse, | |||
ln, pos, NULL); | |||
return(ROFF_IGN); | |||
} else if (buf->buf[pos] == '\0') | |||
return(ROFF_IGN); | |||
/* | /* | ||
* If a scope is open, go to the child handler for that macro, | * If a scope is open, go to the child handler for that macro, | ||
* as it may want to preprocess before doing anything with it. | * as it may want to preprocess before doing anything with it. | ||
|
|
||
if (r->last) { | if (r->last) { | ||
t = r->last->tok; | t = r->last->tok; | ||
assert(roffs[t].sub); | assert(roffs[t].sub); | ||
return((*roffs[t].sub) | return((*roffs[t].sub)(r, t, buf, ln, ppos, pos, offs)); | ||
(r, t, bufp, szp, | |||
ln, ppos, pos, offs)); | |||
} | } | ||
/* No scope is open. This is a new request or macro. */ | |||
spos = pos; | |||
t = roff_parse(r, buf->buf, &pos, ln, ppos); | |||
/* Tables ignore most macros. */ | |||
if (r->tbl != NULL && (t == ROFF_MAX || t == ROFF_TS)) { | |||
mandoc_msg(MANDOCERR_TBLMACRO, r->parse, | |||
ln, pos, buf->buf + spos); | |||
return(ROFF_IGN); | |||
} | |||
/* | /* | ||
* Lastly, as we've no scope open, try to look up and execute | * This is neither a roff request nor a user-defined macro. | ||
* the new macro. If no macro is found, simply return and let | * Let the standard macro set parsers handle it. | ||
* the compilers handle it. | |||
*/ | */ | ||
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) | if (t == ROFF_MAX) | ||
return(ROFF_CONT); | return(ROFF_CONT); | ||
/* Execute a roff request or a user defined macro. */ | |||
assert(roffs[t].proc); | assert(roffs[t].proc); | ||
return((*roffs[t].proc) | return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); | ||
(r, t, bufp, szp, | |||
ln, ppos, pos, offs)); | |||
} | } | ||
void | void | ||
roff_endparse(struct roff *r) | roff_endparse(struct roff *r) | ||
{ | { | ||
if (r->last) | if (r->last) | ||
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, | mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, | ||
r->last->line, r->last->col, NULL); | r->last->line, r->last->col, | ||
roffs[r->last->tok].name); | |||
if (r->eqn) { | if (r->eqn) { | ||
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, | mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, | ||
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); | r->eqn->eqn.ln, r->eqn->eqn.pos, "EQ"); | ||
eqn_end(&r->eqn); | eqn_end(&r->eqn); | ||
} | } | ||
if (r->tbl) { | if (r->tbl) { | ||
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, | mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, | ||
r->tbl->line, r->tbl->pos, NULL); | r->tbl->line, r->tbl->pos, "TS"); | ||
tbl_end(&r->tbl); | tbl_end(&r->tbl); | ||
} | } | ||
} | } | ||
|
|
||
* form of ".foo xxx" in the usual way. | * form of ".foo xxx" in the usual way. | ||
*/ | */ | ||
static enum rofft | static enum rofft | ||
roff_parse(struct roff *r, const char *buf, int *pos) | roff_parse(struct roff *r, char *buf, int *pos, int ln, int ppos) | ||
{ | { | ||
char *cp; | |||
const char *mac; | const char *mac; | ||
size_t maclen; | size_t maclen; | ||
enum rofft t; | enum rofft t; | ||
if ('\0' == buf[*pos] || '"' == buf[*pos] || | cp = buf + *pos; | ||
'\t' == buf[*pos] || ' ' == buf[*pos]) | |||
if ('\0' == *cp || '"' == *cp || '\t' == *cp || ' ' == *cp) | |||
return(ROFF_MAX); | return(ROFF_MAX); | ||
/* | mac = cp; | ||
* We stop the macro parse at an escape, tab, space, or nil. | maclen = roff_getname(r, &cp, ln, ppos); | ||
* 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)) | t = (r->current_string = roff_getstrn(r, mac, maclen)) | ||
? ROFF_USERDEF : roffhash_find(mac, maclen); | ? ROFF_USERDEF : roffhash_find(mac, maclen); | ||
*pos += (int)maclen; | if (ROFF_MAX != t) | ||
*pos = cp - buf; | |||
while (buf[*pos] && ' ' == buf[*pos]) | |||
(*pos)++; | |||
return(t); | return(t); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_cblock(ROFF_ARGS) | roff_cblock(ROFF_ARGS) | ||
{ | { | ||
|
|
||
* ignore macro, otherwise raise a warning and just ignore it. | * ignore macro, otherwise raise a warning and just ignore it. | ||
*/ | */ | ||
if (NULL == r->last) { | if (r->last == NULL) { | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
ln, ppos, ".."); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
switch (r->last->tok) { | switch (r->last->tok) { | ||
case (ROFF_am): | case ROFF_am: | ||
/* ROFF_am1 is remapped to ROFF_am in roff_block(). */ | |||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_ami): | case ROFF_ami: | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_am1): | case ROFF_de: | ||
/* FALLTHROUGH */ | |||
case (ROFF_de): | |||
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ | /* ROFF_de1 is remapped to ROFF_de in roff_block(). */ | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_dei): | case ROFF_dei: | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_ig): | case ROFF_ig: | ||
break; | break; | ||
default: | default: | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
ln, ppos, ".."); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
if ((*bufp)[pos]) | if (buf->buf[pos] != '\0') | ||
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); | mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, | ||
".. %s", buf->buf + pos); | |||
roffnode_pop(r); | roffnode_pop(r); | ||
roffnode_cleanscope(r); | roffnode_cleanscope(r); | ||
|
|
||
} | } | ||
static void | static void | ||
roffnode_cleanscope(struct roff *r) | roffnode_cleanscope(struct roff *r) | ||
{ | { | ||
|
|
||
} | } | ||
} | } | ||
static void | |||
/* ARGSUSED */ | roff_ccond(struct roff *r, int ln, int ppos) | ||
static enum rofferr | |||
roff_ccond(ROFF_ARGS) | |||
{ | { | ||
if (NULL == r->last) { | if (NULL == r->last) { | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
return(ROFF_IGN); | ln, ppos, "\\}"); | ||
return; | |||
} | } | ||
switch (r->last->tok) { | switch (r->last->tok) { | ||
case (ROFF_el): | case ROFF_el: | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_ie): | case ROFF_ie: | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case (ROFF_if): | case ROFF_if: | ||
break; | break; | ||
default: | default: | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
return(ROFF_IGN); | ln, ppos, "\\}"); | ||
return; | |||
} | } | ||
if (r->last->endspan > -1) { | if (r->last->endspan > -1) { | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
return(ROFF_IGN); | ln, ppos, "\\}"); | ||
return; | |||
} | } | ||
if ((*bufp)[pos]) | |||
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); | |||
roffnode_pop(r); | roffnode_pop(r); | ||
roffnode_cleanscope(r); | roffnode_cleanscope(r); | ||
return(ROFF_IGN); | return; | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_block(ROFF_ARGS) | roff_block(ROFF_ARGS) | ||
{ | { | ||
int sv; | const char *name; | ||
size_t sz; | char *iname, *cp; | ||
char *name; | size_t namesz; | ||
name = NULL; | /* Ignore groff compatibility mode for now. */ | ||
if (ROFF_ig != tok) { | if (tok == ROFF_de1) | ||
if ('\0' == (*bufp)[pos]) { | tok = ROFF_de; | ||
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); | else if (tok == ROFF_am1) | ||
return(ROFF_IGN); | tok = ROFF_am; | ||
} | |||
/* | /* Parse the macro name argument. */ | ||
* Re-write `de1', since we don't really care about | |||
* groff's strange compatibility mode, into `de'. | |||
*/ | |||
if (ROFF_de1 == tok) | cp = buf->buf + pos; | ||
tok = ROFF_de; | if (tok == ROFF_ig) { | ||
if (ROFF_de == tok) | iname = NULL; | ||
name = *bufp + pos; | namesz = 0; | ||
else | } else { | ||
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, | iname = cp; | ||
roffs[tok].name); | namesz = roff_getname(r, &cp, ln, ppos); | ||
iname[namesz] = '\0'; | |||
} | |||
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) | /* Resolve the macro name argument if it is indirect. */ | ||
pos++; | |||
while (isspace((unsigned char)(*bufp)[pos])) | if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { | ||
(*bufp)[pos++] = '\0'; | if ((name = roff_getstrn(r, iname, namesz)) == NULL) { | ||
mandoc_vmsg(MANDOCERR_STR_UNDEF, | |||
r->parse, ln, (int)(iname - buf->buf), | |||
"%.*s", (int)namesz, iname); | |||
namesz = 0; | |||
} else | |||
namesz = strlen(name); | |||
} else | |||
name = iname; | |||
if (namesz == 0 && tok != ROFF_ig) { | |||
mandoc_msg(MANDOCERR_REQ_EMPTY, r->parse, | |||
ln, ppos, roffs[tok].name); | |||
return(ROFF_IGN); | |||
} | } | ||
roffnode_push(r, tok, name, ln, ppos); | roffnode_push(r, tok, name, ln, ppos); | ||
|
|
||
/* | /* | ||
* At the beginning of a `de' macro, clear the existing string | * At the beginning of a `de' macro, clear the existing string | ||
* with the same name, if there is one. New content will be | * with the same name, if there is one. New content will be | ||
* added from roff_block_text() in multiline mode. | * appended from roff_block_text() in multiline mode. | ||
*/ | */ | ||
if (ROFF_de == tok) | if (tok == ROFF_de || tok == ROFF_dei) | ||
roff_setstr(r, name, "", 0); | roff_setstrn(&r->strtab, name, namesz, "", 0, 0); | ||
if ('\0' == (*bufp)[pos]) | if (*cp == '\0') | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
/* If present, process the custom end-of-line marker. */ | /* Get the custom end marker. */ | ||
sv = pos; | iname = cp; | ||
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) | namesz = roff_getname(r, &cp, ln, ppos); | ||
pos++; | |||
/* | /* Resolve the end marker if it is indirect. */ | ||
* 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. | |||
*/ | |||
assert(pos > sv); | if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { | ||
sz = (size_t)(pos - sv); | if ((name = roff_getstrn(r, iname, namesz)) == NULL) { | ||
mandoc_vmsg(MANDOCERR_STR_UNDEF, | |||
r->parse, ln, (int)(iname - buf->buf), | |||
"%.*s", (int)namesz, iname); | |||
namesz = 0; | |||
} else | |||
namesz = strlen(name); | |||
} else | |||
name = iname; | |||
if (1 == sz && '.' == (*bufp)[sv]) | if (namesz) | ||
return(ROFF_IGN); | r->last->end = mandoc_strndup(name, namesz); | ||
r->last->end = mandoc_malloc(sz + 1); | if (*cp != '\0') | ||
mandoc_vmsg(MANDOCERR_ARG_EXCESS, r->parse, | |||
ln, pos, ".%s ... %s", roffs[tok].name, cp); | |||
memcpy(r->last->end, *bufp + sv, sz); | |||
r->last->end[(int)sz] = '\0'; | |||
if ((*bufp)[pos]) | |||
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_block_sub(ROFF_ARGS) | roff_block_sub(ROFF_ARGS) | ||
{ | { | ||
|
|
||
if (r->last->end) { | if (r->last->end) { | ||
for (i = pos, j = 0; r->last->end[j]; j++, i++) | for (i = pos, j = 0; r->last->end[j]; j++, i++) | ||
if ((*bufp)[i] != r->last->end[j]) | if (buf->buf[i] != r->last->end[j]) | ||
break; | break; | ||
if ('\0' == r->last->end[j] && | if (r->last->end[j] == '\0' && | ||
('\0' == (*bufp)[i] || | (buf->buf[i] == '\0' || | ||
' ' == (*bufp)[i] || | buf->buf[i] == ' ' || | ||
'\t' == (*bufp)[i])) { | buf->buf[i] == '\t')) { | ||
roffnode_pop(r); | roffnode_pop(r); | ||
roffnode_cleanscope(r); | roffnode_cleanscope(r); | ||
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) | while (buf->buf[i] == ' ' || buf->buf[i] == '\t') | ||
i++; | i++; | ||
pos = i; | pos = i; | ||
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) | if (roff_parse(r, buf->buf, &pos, ln, ppos) != | ||
ROFF_MAX) | |||
return(ROFF_RERUN); | return(ROFF_RERUN); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
|
|
||
* pulling it out of the hashtable. | * pulling it out of the hashtable. | ||
*/ | */ | ||
t = roff_parse(r, *bufp, &pos); | t = roff_parse(r, buf->buf, &pos, ln, ppos); | ||
/* | if (t != ROFF_cblock) { | ||
* Macros other than block-end are only significant | if (tok != ROFF_ig) | ||
* in `de' blocks; elsewhere, simply throw them away. | roff_setstr(r, r->last->name, buf->buf + ppos, 2); | ||
*/ | |||
if (ROFF_cblock != t) { | |||
if (ROFF_de == tok) | |||
roff_setstr(r, r->last->name, *bufp + ppos, 1); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
assert(roffs[t].proc); | assert(roffs[t].proc); | ||
return((*roffs[t].proc)(r, t, bufp, szp, | return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); | ||
ln, ppos, pos, offs)); | |||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_block_text(ROFF_ARGS) | roff_block_text(ROFF_ARGS) | ||
{ | { | ||
if (ROFF_de == tok) | if (tok != ROFF_ig) | ||
roff_setstr(r, r->last->name, *bufp + pos, 1); | roff_setstr(r, r->last->name, buf->buf + pos, 2); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_cond_sub(ROFF_ARGS) | roff_cond_sub(ROFF_ARGS) | ||
{ | { | ||
enum rofft t; | enum rofft t; | ||
enum roffrule rr; | |||
char *ep; | char *ep; | ||
int rr; | |||
rr = r->last->rule; | rr = r->last->rule; | ||
roffnode_cleanscope(r); | roffnode_cleanscope(r); | ||
t = roff_parse(r, buf->buf, &pos, ln, ppos); | |||
/* | /* | ||
* If the macro is unknown, first check if it contains a closing | * Fully handle known macros when they are structurally | ||
* delimiter `\}'. If it does, close out our scope and return | * required or when the conditional evaluated to true. | ||
* the currently-scoped rule (ignore or continue). Else, drop | |||
* into the currently-scoped rule. | |||
*/ | */ | ||
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) { | if ((t != ROFF_MAX) && | ||
ep = &(*bufp)[pos]; | (rr || roffs[t].flags & ROFFMAC_STRUCT)) { | ||
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { | assert(roffs[t].proc); | ||
ep++; | return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); | ||
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); | |||
} | } | ||
/* | /* | ||
* A denied conditional must evaluate its children if and only | * If `\}' occurs on a macro line without a preceding macro, | ||
* if they're either structurally required (such as loops and | * drop the line completely. | ||
* conditionals) or a closing macro. | |||
*/ | */ | ||
if (ROFFRULE_DENY == rr) | ep = buf->buf + pos; | ||
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) | if (ep[0] == '\\' && ep[1] == '}') | ||
if (ROFF_ccond != t) | rr = 0; | ||
return(ROFF_IGN); | |||
assert(roffs[t].proc); | /* Always check for the closing delimiter `\}'. */ | ||
return((*roffs[t].proc)(r, t, bufp, szp, | |||
ln, ppos, pos, offs)); | while ((ep = strchr(ep, '\\')) != NULL) { | ||
if (*(++ep) == '}') { | |||
*ep = '&'; | |||
roff_ccond(r, ln, ep - buf->buf - 1); | |||
} | |||
++ep; | |||
} | |||
return(rr ? ROFF_CONT : ROFF_IGN); | |||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_cond_text(ROFF_ARGS) | roff_cond_text(ROFF_ARGS) | ||
{ | { | ||
char *ep; | char *ep; | ||
enum roffrule rr; | int rr; | ||
rr = r->last->rule; | rr = r->last->rule; | ||
roffnode_cleanscope(r); | roffnode_cleanscope(r); | ||
ep = &(*bufp)[pos]; | ep = buf->buf + pos; | ||
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { | while ((ep = strchr(ep, '\\')) != NULL) { | ||
ep++; | if (*(++ep) == '}') { | ||
if ('}' != *ep) | *ep = '&'; | ||
continue; | roff_ccond(r, ln, ep - buf->buf - 1); | ||
*ep = '&'; | } | ||
roff_ccond(r, ROFF_ccond, bufp, szp, | ++ep; | ||
ln, pos, pos + 2, offs); | |||
} | } | ||
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); | return(rr ? ROFF_CONT : ROFF_IGN); | ||
} | } | ||
static enum roffrule | /* | ||
roff_evalcond(const char *v, int *pos) | * Parse a single signed integer number. Stop at the first non-digit. | ||
* If there is at least one digit, return success and advance the | |||
* parse point, else return failure and let the parse point unchanged. | |||
* Ignore overflows, treat them just like the C language. | |||
*/ | |||
static int | |||
roff_getnum(const char *v, int *pos, int *res) | |||
{ | { | ||
int myres, n, p; | |||
if (NULL == res) | |||
res = &myres; | |||
p = *pos; | |||
n = v[p] == '-'; | |||
if (n) | |||
p++; | |||
for (*res = 0; isdigit((unsigned char)v[p]); p++) | |||
*res = 10 * *res + v[p] - '0'; | |||
if (p == *pos + n) | |||
return 0; | |||
if (n) | |||
*res = -*res; | |||
*pos = p; | |||
return 1; | |||
} | |||
/* | |||
* Evaluate a string comparison condition. | |||
* The first character is the delimiter. | |||
* Succeed if the string up to its second occurrence | |||
* matches the string up to its third occurence. | |||
* Advance the cursor after the third occurrence | |||
* or lacking that, to the end of the line. | |||
*/ | |||
static int | |||
roff_evalstrcond(const char *v, int *pos) | |||
{ | |||
const char *s1, *s2, *s3; | |||
int match; | |||
match = 0; | |||
s1 = v + *pos; /* initial delimiter */ | |||
s2 = s1 + 1; /* for scanning the first string */ | |||
s3 = strchr(s2, *s1); /* for scanning the second string */ | |||
if (NULL == s3) /* found no middle delimiter */ | |||
goto out; | |||
while ('\0' != *++s3) { | |||
if (*s2 != *s3) { /* mismatch */ | |||
s3 = strchr(s3, *s1); | |||
break; | |||
} | |||
if (*s3 == *s1) { /* found the final delimiter */ | |||
match = 1; | |||
break; | |||
} | |||
s2++; | |||
} | |||
out: | |||
if (NULL == s3) | |||
s3 = strchr(s2, '\0'); | |||
else if (*s3 != '\0') | |||
s3++; | |||
*pos = s3 - v; | |||
return(match); | |||
} | |||
/* | |||
* Evaluate an optionally negated single character, numerical, | |||
* or string condition. | |||
*/ | |||
static int | |||
roff_evalcond(struct roff *r, int ln, const char *v, int *pos) | |||
{ | |||
int number, savepos, wanttrue; | |||
if ('!' == v[*pos]) { | |||
wanttrue = 0; | |||
(*pos)++; | |||
} else | |||
wanttrue = 1; | |||
switch (v[*pos]) { | switch (v[*pos]) { | ||
case ('n'): | case '\0': | ||
return(0); | |||
case 'n': | |||
/* FALLTHROUGH */ | |||
case 'o': | |||
(*pos)++; | (*pos)++; | ||
return(ROFFRULE_ALLOW); | return(wanttrue); | ||
case ('e'): | case 'c': | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case ('o'): | case 'd': | ||
/* FALLTHROUGH */ | /* FALLTHROUGH */ | ||
case ('t'): | case 'e': | ||
/* FALLTHROUGH */ | |||
case 'r': | |||
/* FALLTHROUGH */ | |||
case 't': | |||
/* FALLTHROUGH */ | |||
case 'v': | |||
(*pos)++; | (*pos)++; | ||
return(ROFFRULE_DENY); | return(!wanttrue); | ||
default: | default: | ||
break; | break; | ||
} | } | ||
while (v[*pos] && ' ' != v[*pos]) | savepos = *pos; | ||
(*pos)++; | if (roff_evalnum(r, ln, v, pos, &number, 0)) | ||
return(ROFFRULE_DENY); | return((number > 0) == wanttrue); | ||
else if (*pos == savepos) | |||
return(roff_evalstrcond(v, pos) == wanttrue); | |||
else | |||
return (0); | |||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_line_ignore(ROFF_ARGS) | roff_line_ignore(ROFF_ARGS) | ||
{ | { | ||
if (ROFF_it == tok) | |||
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, "it"); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_cond(ROFF_ARGS) | roff_cond(ROFF_ARGS) | ||
{ | { | ||
roffnode_push(r, tok, NULL, ln, ppos); | roffnode_push(r, tok, NULL, ln, ppos); | ||
/* | /* | ||
* An `.el' has no conditional body: it will consume the value | * An `.el' has no conditional body: it will consume the value | ||
* of the current rstack entry set in prior `ie' calls or | * of the current rstack entry set in prior `ie' calls or | ||
* defaults to DENY. | * defaults to DENY. | ||
* | * | ||
* If we're not an `el', however, then evaluate the conditional. | * If we're not an `el', however, then evaluate the conditional. | ||
*/ | */ | ||
r->last->rule = ROFF_el == tok ? | r->last->rule = tok == ROFF_el ? | ||
(r->rstackpos < 0 ? | (r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : | ||
ROFFRULE_DENY : r->rstack[r->rstackpos--]) : | roff_evalcond(r, ln, buf->buf, &pos); | ||
roff_evalcond(*bufp, &pos); | |||
/* | /* | ||
* An if-else will put the NEGATION of the current evaluated | * An if-else will put the NEGATION of the current evaluated | ||
* conditional into the stack of rules. | * conditional into the stack of rules. | ||
*/ | */ | ||
if (ROFF_ie == tok) { | if (tok == ROFF_ie) { | ||
if (r->rstackpos == RSTACK_MAX - 1) { | if (r->rstackpos + 1 == r->rstacksz) { | ||
mandoc_msg(MANDOCERR_MEM, | r->rstacksz += 16; | ||
r->parse, ln, ppos, NULL); | r->rstack = mandoc_reallocarray(r->rstack, | ||
return(ROFF_ERR); | r->rstacksz, sizeof(int)); | ||
} | } | ||
r->rstack[++r->rstackpos] = | r->rstack[++r->rstackpos] = !r->last->rule; | ||
ROFFRULE_DENY == r->last->rule ? | |||
ROFFRULE_ALLOW : ROFFRULE_DENY; | |||
} | } | ||
/* If the parent has false as its rule, then so do we. */ | /* If the parent has false as its rule, then so do we. */ | ||
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) | if (r->last->parent && !r->last->parent->rule) | ||
r->last->rule = ROFFRULE_DENY; | r->last->rule = 0; | ||
/* | /* | ||
* Determine scope. | * Determine scope. | ||
|
|
||
* not even whitespace, use next-line scope. | * not even whitespace, use next-line scope. | ||
*/ | */ | ||
if ('\0' == (*bufp)[pos]) { | if (buf->buf[pos] == '\0') { | ||
r->last->endspan = 2; | r->last->endspan = 2; | ||
goto out; | goto out; | ||
} | } | ||
while (' ' == (*bufp)[pos]) | while (buf->buf[pos] == ' ') | ||
pos++; | pos++; | ||
/* An opening brace requests multiline scope. */ | /* An opening brace requests multiline scope. */ | ||
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { | if (buf->buf[pos] == '\\' && buf->buf[pos + 1] == '{') { | ||
r->last->endspan = -1; | r->last->endspan = -1; | ||
pos += 2; | pos += 2; | ||
goto out; | goto out; | ||
} | } | ||
/* | /* | ||
* Anything else following the conditional causes | * Anything else following the conditional causes | ||
|
|
||
* nothing but trailing whitespace. | * nothing but trailing whitespace. | ||
*/ | */ | ||
if ('\0' == (*bufp)[pos]) | if (buf->buf[pos] == '\0') | ||
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_COND_EMPTY, r->parse, | ||
ln, ppos, roffs[tok].name); | |||
r->last->endspan = 1; | r->last->endspan = 1; | ||
|
|
||
return(ROFF_RERUN); | return(ROFF_RERUN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_ds(ROFF_ARGS) | roff_ds(ROFF_ARGS) | ||
{ | { | ||
char *name, *string; | char *string; | ||
const char *name; | |||
size_t namesz; | |||
/* | /* | ||
* A symbol is named by the first word following the macro | * The first word is the name of the string. | ||
* invocation up to a space. Its value is anything after the | * If it is empty or terminated by an escape sequence, | ||
* name's trailing whitespace and optional double-quote. Thus, | * abort the `ds' request without defining anything. | ||
* | |||
* [.ds foo "bar " ] | |||
* | |||
* will have `bar " ' as its value. | |||
*/ | */ | ||
string = *bufp + pos; | name = string = buf->buf + pos; | ||
name = roff_getname(r, &string, ln, pos); | if (*name == '\0') | ||
if ('\0' == *name) | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
/* Read past initial double-quote. */ | namesz = roff_getname(r, &string, ln, pos); | ||
if ('"' == *string) | if (name[namesz] == '\\') | ||
return(ROFF_IGN); | |||
/* Read past the initial double-quote, if any. */ | |||
if (*string == '"') | |||
string++; | string++; | ||
/* The rest is the value. */ | /* The rest is the value. */ | ||
roff_setstr(r, name, string, 0); | roff_setstrn(&r->strtab, name, namesz, string, strlen(string), | ||
ROFF_as == tok); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
int | /* | ||
roff_regisset(const struct roff *r, enum regs reg) | * Parse a single operator, one or two characters long. | ||
* If the operator is recognized, return success and advance the | |||
* parse point, else return failure and let the parse point unchanged. | |||
*/ | |||
static int | |||
roff_getop(const char *v, int *pos, char *res) | |||
{ | { | ||
return(r->regs[(int)reg].set); | *res = v[*pos]; | ||
switch (*res) { | |||
case '+': | |||
/* FALLTHROUGH */ | |||
case '-': | |||
/* FALLTHROUGH */ | |||
case '*': | |||
/* FALLTHROUGH */ | |||
case '/': | |||
/* FALLTHROUGH */ | |||
case '%': | |||
/* FALLTHROUGH */ | |||
case '&': | |||
/* FALLTHROUGH */ | |||
case ':': | |||
break; | |||
case '<': | |||
switch (v[*pos + 1]) { | |||
case '=': | |||
*res = 'l'; | |||
(*pos)++; | |||
break; | |||
case '>': | |||
*res = '!'; | |||
(*pos)++; | |||
break; | |||
case '?': | |||
*res = 'i'; | |||
(*pos)++; | |||
break; | |||
default: | |||
break; | |||
} | |||
break; | |||
case '>': | |||
switch (v[*pos + 1]) { | |||
case '=': | |||
*res = 'g'; | |||
(*pos)++; | |||
break; | |||
case '?': | |||
*res = 'a'; | |||
(*pos)++; | |||
break; | |||
default: | |||
break; | |||
} | |||
break; | |||
case '=': | |||
if ('=' == v[*pos + 1]) | |||
(*pos)++; | |||
break; | |||
default: | |||
return(0); | |||
} | |||
(*pos)++; | |||
return(*res); | |||
} | } | ||
unsigned int | /* | ||
roff_regget(const struct roff *r, enum regs reg) | * Evaluate either a parenthesized numeric expression | ||
* or a single signed integer number. | |||
*/ | |||
static int | |||
roff_evalpar(struct roff *r, int ln, | |||
const char *v, int *pos, int *res) | |||
{ | { | ||
return(r->regs[(int)reg].u); | if ('(' != v[*pos]) | ||
return(roff_getnum(v, pos, res)); | |||
(*pos)++; | |||
if ( ! roff_evalnum(r, ln, v, pos, res, 1)) | |||
return(0); | |||
/* | |||
* Omission of the closing parenthesis | |||
* is an error in validation mode, | |||
* but ignored in evaluation mode. | |||
*/ | |||
if (')' == v[*pos]) | |||
(*pos)++; | |||
else if (NULL == res) | |||
return(0); | |||
return(1); | |||
} | } | ||
/* | |||
* Evaluate a complete numeric expression. | |||
* Proceed left to right, there is no concept of precedence. | |||
*/ | |||
static int | |||
roff_evalnum(struct roff *r, int ln, const char *v, | |||
int *pos, int *res, int skipwhite) | |||
{ | |||
int mypos, operand2; | |||
char operator; | |||
if (NULL == pos) { | |||
mypos = 0; | |||
pos = &mypos; | |||
} | |||
if (skipwhite) | |||
while (isspace((unsigned char)v[*pos])) | |||
(*pos)++; | |||
if ( ! roff_evalpar(r, ln, v, pos, res)) | |||
return(0); | |||
while (1) { | |||
if (skipwhite) | |||
while (isspace((unsigned char)v[*pos])) | |||
(*pos)++; | |||
if ( ! roff_getop(v, pos, &operator)) | |||
break; | |||
if (skipwhite) | |||
while (isspace((unsigned char)v[*pos])) | |||
(*pos)++; | |||
if ( ! roff_evalpar(r, ln, v, pos, &operand2)) | |||
return(0); | |||
if (skipwhite) | |||
while (isspace((unsigned char)v[*pos])) | |||
(*pos)++; | |||
if (NULL == res) | |||
continue; | |||
switch (operator) { | |||
case '+': | |||
*res += operand2; | |||
break; | |||
case '-': | |||
*res -= operand2; | |||
break; | |||
case '*': | |||
*res *= operand2; | |||
break; | |||
case '/': | |||
if (operand2 == 0) { | |||
mandoc_msg(MANDOCERR_DIVZERO, | |||
r->parse, ln, *pos, v); | |||
*res = 0; | |||
break; | |||
} | |||
*res /= operand2; | |||
break; | |||
case '%': | |||
if (operand2 == 0) { | |||
mandoc_msg(MANDOCERR_DIVZERO, | |||
r->parse, ln, *pos, v); | |||
*res = 0; | |||
break; | |||
} | |||
*res %= operand2; | |||
break; | |||
case '<': | |||
*res = *res < operand2; | |||
break; | |||
case '>': | |||
*res = *res > operand2; | |||
break; | |||
case 'l': | |||
*res = *res <= operand2; | |||
break; | |||
case 'g': | |||
*res = *res >= operand2; | |||
break; | |||
case '=': | |||
*res = *res == operand2; | |||
break; | |||
case '!': | |||
*res = *res != operand2; | |||
break; | |||
case '&': | |||
*res = *res && operand2; | |||
break; | |||
case ':': | |||
*res = *res || operand2; | |||
break; | |||
case 'i': | |||
if (operand2 < *res) | |||
*res = operand2; | |||
break; | |||
case 'a': | |||
if (operand2 > *res) | |||
*res = operand2; | |||
break; | |||
default: | |||
abort(); | |||
} | |||
} | |||
return(1); | |||
} | |||
void | void | ||
roff_regunset(struct roff *r, enum regs reg) | roff_setreg(struct roff *r, const char *name, int val, char sign) | ||
{ | { | ||
struct roffreg *reg; | |||
r->regs[(int)reg].set = 0; | /* Search for an existing register with the same name. */ | ||
reg = r->regtab; | |||
while (reg && strcmp(name, reg->key.p)) | |||
reg = reg->next; | |||
if (NULL == reg) { | |||
/* Create a new register. */ | |||
reg = mandoc_malloc(sizeof(struct roffreg)); | |||
reg->key.p = mandoc_strdup(name); | |||
reg->key.sz = strlen(name); | |||
reg->val = 0; | |||
reg->next = r->regtab; | |||
r->regtab = reg; | |||
} | |||
if ('+' == sign) | |||
reg->val += val; | |||
else if ('-' == sign) | |||
reg->val -= val; | |||
else | |||
reg->val = val; | |||
} | } | ||
/* ARGSUSED */ | /* | ||
* Handle some predefined read-only number registers. | |||
* For now, return -1 if the requested register is not predefined; | |||
* in case a predefined read-only register having the value -1 | |||
* were to turn up, another special value would have to be chosen. | |||
*/ | |||
static int | |||
roff_getregro(const char *name) | |||
{ | |||
switch (*name) { | |||
case 'A': /* ASCII approximation mode is always off. */ | |||
return(0); | |||
case 'g': /* Groff compatibility mode is always on. */ | |||
return(1); | |||
case 'H': /* Fixed horizontal resolution. */ | |||
return (24); | |||
case 'j': /* Always adjust left margin only. */ | |||
return(0); | |||
case 'T': /* Some output device is always defined. */ | |||
return(1); | |||
case 'V': /* Fixed vertical resolution. */ | |||
return (40); | |||
default: | |||
return (-1); | |||
} | |||
} | |||
int | |||
roff_getreg(const struct roff *r, const char *name) | |||
{ | |||
struct roffreg *reg; | |||
int val; | |||
if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) { | |||
val = roff_getregro(name + 1); | |||
if (-1 != val) | |||
return (val); | |||
} | |||
for (reg = r->regtab; reg; reg = reg->next) | |||
if (0 == strcmp(name, reg->key.p)) | |||
return(reg->val); | |||
return(0); | |||
} | |||
static int | |||
roff_getregn(const struct roff *r, const char *name, size_t len) | |||
{ | |||
struct roffreg *reg; | |||
int val; | |||
if ('.' == name[0] && 2 == len) { | |||
val = roff_getregro(name + 1); | |||
if (-1 != val) | |||
return (val); | |||
} | |||
for (reg = r->regtab; reg; reg = reg->next) | |||
if (len == reg->key.sz && | |||
0 == strncmp(name, reg->key.p, len)) | |||
return(reg->val); | |||
return(0); | |||
} | |||
static void | |||
roff_freereg(struct roffreg *reg) | |||
{ | |||
struct roffreg *old_reg; | |||
while (NULL != reg) { | |||
free(reg->key.p); | |||
old_reg = reg; | |||
reg = reg->next; | |||
free(old_reg); | |||
} | |||
} | |||
static enum rofferr | static enum rofferr | ||
roff_nr(ROFF_ARGS) | roff_nr(ROFF_ARGS) | ||
{ | { | ||
const char *key; | char *key, *val; | ||
char *val; | size_t keysz; | ||
int iv; | int iv; | ||
char sign; | |||
val = *bufp + pos; | key = val = buf->buf + pos; | ||
key = roff_getname(r, &val, ln, pos); | if (*key == '\0') | ||
return(ROFF_IGN); | |||
if (0 == strcmp(key, "nS")) { | keysz = roff_getname(r, &val, ln, pos); | ||
r->regs[(int)REG_nS].set = 1; | if (key[keysz] == '\\') | ||
if ((iv = mandoc_strntoi(val, strlen(val), 10)) >= 0) | return(ROFF_IGN); | ||
r->regs[(int)REG_nS].u = (unsigned)iv; | key[keysz] = '\0'; | ||
else | |||
r->regs[(int)REG_nS].u = 0u; | |||
} | |||
sign = *val; | |||
if (sign == '+' || sign == '-') | |||
val++; | |||
if (roff_evalnum(r, ln, val, NULL, &iv, 0)) | |||
roff_setreg(r, key, iv, sign); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_rr(ROFF_ARGS) | |||
{ | |||
struct roffreg *reg, **prev; | |||
char *name, *cp; | |||
size_t namesz; | |||
name = cp = buf->buf + pos; | |||
if (*name == '\0') | |||
return(ROFF_IGN); | |||
namesz = roff_getname(r, &cp, ln, pos); | |||
name[namesz] = '\0'; | |||
prev = &r->regtab; | |||
while (1) { | |||
reg = *prev; | |||
if (reg == NULL || !strcmp(name, reg->key.p)) | |||
break; | |||
prev = ®->next; | |||
} | |||
if (reg != NULL) { | |||
*prev = reg->next; | |||
free(reg->key.p); | |||
free(reg); | |||
} | |||
return(ROFF_IGN); | |||
} | |||
static enum rofferr | |||
roff_rm(ROFF_ARGS) | roff_rm(ROFF_ARGS) | ||
{ | { | ||
const char *name; | const char *name; | ||
char *cp; | char *cp; | ||
size_t namesz; | |||
cp = *bufp + pos; | cp = buf->buf + pos; | ||
while ('\0' != *cp) { | while (*cp != '\0') { | ||
name = roff_getname(r, &cp, ln, (int)(cp - *bufp)); | name = cp; | ||
if ('\0' != *name) | namesz = roff_getname(r, &cp, ln, (int)(cp - buf->buf)); | ||
roff_setstr(r, name, NULL, 0); | roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0); | ||
if (name[namesz] == '\\') | |||
break; | |||
} | } | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_it(ROFF_ARGS) | |||
{ | |||
char *cp; | |||
size_t len; | |||
int iv; | |||
/* Parse the number of lines. */ | |||
cp = buf->buf + pos; | |||
len = strcspn(cp, " \t"); | |||
cp[len] = '\0'; | |||
if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) { | |||
mandoc_msg(MANDOCERR_IT_NONUM, r->parse, | |||
ln, ppos, buf->buf + 1); | |||
return(ROFF_IGN); | |||
} | |||
cp += len + 1; | |||
/* Arm the input line trap. */ | |||
roffit_lines = iv; | |||
roffit_macro = mandoc_strdup(cp); | |||
return(ROFF_IGN); | |||
} | |||
static enum rofferr | |||
roff_Dd(ROFF_ARGS) | |||
{ | |||
const char *const *cp; | |||
if ((r->options & (MPARSE_MDOC | MPARSE_QUICK)) == 0) | |||
for (cp = __mdoc_reserved; *cp; cp++) | |||
roff_setstr(r, *cp, NULL, 0); | |||
if (r->format == 0) | |||
r->format = MPARSE_MDOC; | |||
return(ROFF_CONT); | |||
} | |||
static enum rofferr | |||
roff_TH(ROFF_ARGS) | |||
{ | |||
const char *const *cp; | |||
if ((r->options & MPARSE_QUICK) == 0) | |||
for (cp = __man_reserved; *cp; cp++) | |||
roff_setstr(r, *cp, NULL, 0); | |||
if (r->format == 0) | |||
r->format = MPARSE_MAN; | |||
return(ROFF_CONT); | |||
} | |||
static enum rofferr | |||
roff_TE(ROFF_ARGS) | roff_TE(ROFF_ARGS) | ||
{ | { | ||
if (NULL == r->tbl) | if (NULL == r->tbl) | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
ln, ppos, "TE"); | |||
else | else | ||
tbl_end(&r->tbl); | tbl_end(&r->tbl); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_T_(ROFF_ARGS) | roff_T_(ROFF_ARGS) | ||
{ | { | ||
if (NULL == r->tbl) | if (NULL == r->tbl) | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, | ||
ln, ppos, "T&"); | |||
else | else | ||
tbl_restart(ppos, ln, r->tbl); | tbl_restart(ppos, ln, r->tbl); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
#if 0 | /* | ||
static int | * Handle in-line equation delimiters. | ||
roff_closeeqn(struct roff *r) | */ | ||
static enum rofferr | |||
roff_eqndelim(struct roff *r, struct buf *buf, int pos) | |||
{ | { | ||
char *cp1, *cp2; | |||
const char *bef_pr, *bef_nl, *mac, *aft_nl, *aft_pr; | |||
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); | /* | ||
} | * Outside equations, look for an opening delimiter. | ||
#endif | * If we are inside an equation, we already know it is | ||
* in-line, or this function wouldn't have been called; | |||
* so look for a closing delimiter. | |||
*/ | |||
static void | cp1 = buf->buf + pos; | ||
roff_openeqn(struct roff *r, const char *name, int line, | cp2 = strchr(cp1, r->eqn == NULL ? | ||
int offs, const char *buf) | r->last_eqn->odelim : r->last_eqn->cdelim); | ||
{ | if (cp2 == NULL) | ||
struct eqn_node *e; | return(ROFF_CONT); | ||
int poff; | |||
assert(NULL == r->eqn); | *cp2++ = '\0'; | ||
e = eqn_alloc(name, offs, line, r->parse); | bef_pr = bef_nl = aft_nl = aft_pr = ""; | ||
if (r->last_eqn) | /* Handle preceding text, protecting whitespace. */ | ||
r->last_eqn->next = e; | |||
else | |||
r->first_eqn = r->last_eqn = e; | |||
r->eqn = r->last_eqn = e; | if (*buf->buf != '\0') { | ||
if (r->eqn == NULL) | |||
bef_pr = "\\&"; | |||
bef_nl = "\n"; | |||
} | |||
if (buf) { | /* | ||
poff = 0; | * Prepare replacing the delimiter with an equation macro | ||
eqn_read(&r->eqn, line, buf, offs, &poff); | * and drop leading white space from the equation. | ||
*/ | |||
if (r->eqn == NULL) { | |||
while (*cp2 == ' ') | |||
cp2++; | |||
mac = ".EQ"; | |||
} else | |||
mac = ".EN"; | |||
/* Handle following text, protecting whitespace. */ | |||
if (*cp2 != '\0') { | |||
aft_nl = "\n"; | |||
if (r->eqn != NULL) | |||
aft_pr = "\\&"; | |||
} | } | ||
/* Do the actual replacement. */ | |||
buf->sz = mandoc_asprintf(&cp1, "%s%s%s%s%s%s%s", buf->buf, | |||
bef_pr, bef_nl, mac, aft_nl, aft_pr, cp2) + 1; | |||
free(buf->buf); | |||
buf->buf = cp1; | |||
/* Toggle the in-line state of the eqn subsystem. */ | |||
r->eqn_inline = r->eqn == NULL; | |||
return(ROFF_REPARSE); | |||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_EQ(ROFF_ARGS) | roff_EQ(ROFF_ARGS) | ||
{ | { | ||
struct eqn_node *e; | |||
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); | assert(r->eqn == NULL); | ||
e = eqn_alloc(ppos, ln, r->parse); | |||
if (r->last_eqn) { | |||
r->last_eqn->next = e; | |||
e->delim = r->last_eqn->delim; | |||
e->odelim = r->last_eqn->odelim; | |||
e->cdelim = r->last_eqn->cdelim; | |||
} else | |||
r->first_eqn = r->last_eqn = e; | |||
r->eqn = r->last_eqn = e; | |||
if (buf->buf[pos] != '\0') | |||
mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, | |||
".EQ %s", buf->buf + pos); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_EN(ROFF_ARGS) | roff_EN(ROFF_ARGS) | ||
{ | { | ||
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, ln, ppos, "EN"); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_TS(ROFF_ARGS) | roff_TS(ROFF_ARGS) | ||
{ | { | ||
struct tbl_node *t; | struct tbl_node *tbl; | ||
if (r->tbl) { | if (r->tbl) { | ||
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_BLK_BROKEN, r->parse, | ||
ln, ppos, "TS breaks TS"); | |||
tbl_end(&r->tbl); | tbl_end(&r->tbl); | ||
} | } | ||
t = tbl_alloc(ppos, ln, r->parse); | tbl = tbl_alloc(ppos, ln, r->parse); | ||
if (r->last_tbl) | if (r->last_tbl) | ||
r->last_tbl->next = t; | r->last_tbl->next = tbl; | ||
else | else | ||
r->first_tbl = r->last_tbl = t; | r->first_tbl = r->last_tbl = tbl; | ||
r->tbl = r->last_tbl = t; | r->tbl = r->last_tbl = tbl; | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_cc(ROFF_ARGS) | roff_cc(ROFF_ARGS) | ||
{ | { | ||
const char *p; | const char *p; | ||
p = *bufp + pos; | p = buf->buf + pos; | ||
if ('\0' == *p || '.' == (r->control = *p++)) | if (*p == '\0' || (r->control = *p++) == '.') | ||
r->control = 0; | r->control = 0; | ||
if ('\0' != *p) | if (*p != '\0') | ||
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_tr(ROFF_ARGS) | roff_tr(ROFF_ARGS) | ||
{ | { | ||
|
|
||
size_t fsz, ssz; | size_t fsz, ssz; | ||
enum mandoc_esc esc; | enum mandoc_esc esc; | ||
p = *bufp + pos; | p = buf->buf + pos; | ||
if ('\0' == *p) { | if (*p == '\0') { | ||
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); | mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); | ||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
while ('\0' != *p) { | while (*p != '\0') { | ||
fsz = ssz = 1; | fsz = ssz = 1; | ||
first = p++; | first = p++; | ||
if ('\\' == *first) { | if (*first == '\\') { | ||
esc = mandoc_escape(&p, NULL, NULL); | esc = mandoc_escape(&p, NULL, NULL); | ||
if (ESCAPE_ERROR == esc) { | if (esc == ESCAPE_ERROR) { | ||
mandoc_msg | mandoc_msg(MANDOCERR_ESC_BAD, r->parse, | ||
(MANDOCERR_BADESCAPE, r->parse, | ln, (int)(p - buf->buf), first); | ||
ln, (int)(p - *bufp), NULL); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
fsz = (size_t)(p - first); | fsz = (size_t)(p - first); | ||
} | } | ||
second = p++; | second = p++; | ||
if ('\\' == *second) { | if (*second == '\\') { | ||
esc = mandoc_escape(&p, NULL, NULL); | esc = mandoc_escape(&p, NULL, NULL); | ||
if (ESCAPE_ERROR == esc) { | if (esc == ESCAPE_ERROR) { | ||
mandoc_msg | mandoc_msg(MANDOCERR_ESC_BAD, r->parse, | ||
(MANDOCERR_BADESCAPE, r->parse, | ln, (int)(p - buf->buf), second); | ||
ln, (int)(p - *bufp), NULL); | |||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
ssz = (size_t)(p - second); | ssz = (size_t)(p - second); | ||
} else if ('\0' == *second) { | } else if (*second == '\0') { | ||
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, | mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, | ||
ln, (int)(p - *bufp), NULL); | ln, (int)(p - buf->buf), NULL); | ||
second = " "; | second = " "; | ||
p--; | p--; | ||
} | } | ||
if (fsz > 1) { | if (fsz > 1) { | ||
roff_setstrn(&r->xmbtab, first, | roff_setstrn(&r->xmbtab, first, fsz, | ||
fsz, second, ssz, 0); | second, ssz, 0); | ||
continue; | continue; | ||
} | } | ||
if (NULL == r->xtab) | if (r->xtab == NULL) | ||
r->xtab = mandoc_calloc | r->xtab = mandoc_calloc(128, | ||
(128, sizeof(struct roffstr)); | sizeof(struct roffstr)); | ||
free(r->xtab[(int)*first].p); | free(r->xtab[(int)*first].p); | ||
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); | r->xtab[(int)*first].p = mandoc_strndup(second, ssz); | ||
|
|
||
return(ROFF_IGN); | return(ROFF_IGN); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_so(ROFF_ARGS) | roff_so(ROFF_ARGS) | ||
{ | { | ||
char *name; | char *name; | ||
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); | name = buf->buf + pos; | ||
mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, "so %s", name); | |||
/* | /* | ||
* Handle `so'. Be EXTREMELY careful, as we shouldn't be | * Handle `so'. Be EXTREMELY careful, as we shouldn't be | ||
|
|
||
* or using absolute paths. | * or using absolute paths. | ||
*/ | */ | ||
name = *bufp + pos; | if (*name == '/' || strstr(name, "../") || strstr(name, "/..")) { | ||
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { | mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos, | ||
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); | ".so %s", name); | ||
return(ROFF_ERR); | return(ROFF_ERR); | ||
} | } | ||
|
|
||
return(ROFF_SO); | return(ROFF_SO); | ||
} | } | ||
/* ARGSUSED */ | |||
static enum rofferr | static enum rofferr | ||
roff_userdef(ROFF_ARGS) | roff_userdef(ROFF_ARGS) | ||
{ | { | ||
|
|
||
/* | /* | ||
* Collect pointers to macro argument strings | * Collect pointers to macro argument strings | ||
* and null-terminate them. | * and NUL-terminate them. | ||
*/ | */ | ||
cp = *bufp + pos; | cp = buf->buf + pos; | ||
for (i = 0; i < 9; i++) | for (i = 0; i < 9; i++) | ||
arg[i] = '\0' == *cp ? "" : | arg[i] = *cp == '\0' ? "" : | ||
mandoc_getarg(r->parse, &cp, ln, &pos); | mandoc_getarg(r->parse, &cp, ln, &pos); | ||
/* | /* | ||
* Expand macro arguments. | * Expand macro arguments. | ||
*/ | */ | ||
*szp = 0; | buf->sz = 0; | ||
n1 = cp = mandoc_strdup(r->current_string); | n1 = cp = mandoc_strdup(r->current_string); | ||
while (NULL != (cp = strstr(cp, "\\$"))) { | while ((cp = strstr(cp, "\\$")) != NULL) { | ||
i = cp[2] - '1'; | i = cp[2] - '1'; | ||
if (0 > i || 8 < i) { | if (0 > i || 8 < i) { | ||
/* Not an argument invocation. */ | /* Not an argument invocation. */ | ||
cp += 2; | cp += 2; | ||
continue; | continue; | ||
} | } | ||
*cp = '\0'; | |||
*szp = strlen(n1) - 3 + strlen(arg[i]) + 1; | buf->sz = mandoc_asprintf(&n2, "%s%s%s", | ||
n2 = mandoc_malloc(*szp); | n1, arg[i], cp + 3) + 1; | ||
strlcpy(n2, n1, (size_t)(cp - n1 + 1)); | |||
strlcat(n2, arg[i], *szp); | |||
strlcat(n2, cp + 3, *szp); | |||
cp = n2 + (cp - n1); | cp = n2 + (cp - n1); | ||
free(n1); | free(n1); | ||
n1 = n2; | n1 = n2; | ||
|
|
||
* Replace the macro invocation | * Replace the macro invocation | ||
* by the expanded macro. | * by the expanded macro. | ||
*/ | */ | ||
free(*bufp); | free(buf->buf); | ||
*bufp = n1; | buf->buf = n1; | ||
if (0 == *szp) | if (buf->sz == 0) | ||
*szp = strlen(*bufp) + 1; | buf->sz = strlen(buf->buf) + 1; | ||
return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ? | return(buf->sz > 1 && buf->buf[buf->sz - 2] == '\n' ? | ||
ROFF_REPARSE : ROFF_APPEND); | ROFF_REPARSE : ROFF_APPEND); | ||
} | } | ||
static char * | static size_t | ||
roff_getname(struct roff *r, char **cpp, int ln, int pos) | roff_getname(struct roff *r, char **cpp, int ln, int pos) | ||
{ | { | ||
char *name, *cp; | char *name, *cp; | ||
size_t namesz; | |||
name = *cpp; | name = *cpp; | ||
if ('\0' == *name) | if ('\0' == *name) | ||
return(name); | return(0); | ||
/* Read until end of name. */ | /* Read until end of name and terminate it with NUL. */ | ||
for (cp = name; '\0' != *cp && ' ' != *cp; cp++) { | for (cp = name; 1; cp++) { | ||
if ('\0' == *cp || ' ' == *cp) { | |||
namesz = cp - name; | |||
break; | |||
} | |||
if ('\\' != *cp) | if ('\\' != *cp) | ||
continue; | continue; | ||
namesz = cp - name; | |||
if ('{' == cp[1] || '}' == cp[1]) | |||
break; | |||
cp++; | cp++; | ||
if ('\\' == *cp) | if ('\\' == *cp) | ||
continue; | continue; | ||
mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL); | mandoc_vmsg(MANDOCERR_NAMESC, r->parse, ln, pos, | ||
*cp = '\0'; | "%.*s", (int)(cp - name + 1), name); | ||
name = cp; | mandoc_escape((const char **)&cp, NULL, NULL); | ||
break; | |||
} | } | ||
/* Nil-terminate name. */ | |||
if ('\0' != *cp) | |||
*(cp++) = '\0'; | |||
/* Read past spaces. */ | /* Read past spaces. */ | ||
while (' ' == *cp) | while (' ' == *cp) | ||
cp++; | cp++; | ||
*cpp = cp; | *cpp = cp; | ||
return(name); | return(namesz); | ||
} | } | ||
/* | /* | ||
* Store *string into the user-defined string called *name. | * 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). | * To clear an existing entry, call with (*r, *name, NULL, 0). | ||
* append == 0: replace mode | |||
* append == 1: single-line append mode | |||
* append == 2: multiline append mode, append '\n' after each call | |||
*/ | */ | ||
static void | static void | ||
roff_setstr(struct roff *r, const char *name, const char *string, | roff_setstr(struct roff *r, const char *name, const char *string, | ||
int multiline) | int append) | ||
{ | { | ||
roff_setstrn(&r->strtab, name, strlen(name), string, | roff_setstrn(&r->strtab, name, strlen(name), string, | ||
string ? strlen(string) : 0, multiline); | string ? strlen(string) : 0, append); | ||
} | } | ||
static void | static void | ||
roff_setstrn(struct roffkv **r, const char *name, size_t namesz, | roff_setstrn(struct roffkv **r, const char *name, size_t namesz, | ||
const char *string, size_t stringsz, int multiline) | const char *string, size_t stringsz, int append) | ||
{ | { | ||
struct roffkv *n; | struct roffkv *n; | ||
char *c; | char *c; | ||
|
|
||
/* Search for an existing string with the same name. */ | /* Search for an existing string with the same name. */ | ||
n = *r; | n = *r; | ||
while (n && strcmp(name, n->key.p)) | while (n && (namesz != n->key.sz || | ||
strncmp(n->key.p, name, namesz))) | |||
n = n->next; | n = n->next; | ||
if (NULL == n) { | if (NULL == n) { | ||
|
|
||
n->val.sz = 0; | n->val.sz = 0; | ||
n->next = *r; | n->next = *r; | ||
*r = n; | *r = n; | ||
} else if (0 == multiline) { | } else if (0 == append) { | ||
/* In multiline mode, append; else replace. */ | |||
free(n->val.p); | free(n->val.p); | ||
n->val.p = NULL; | n->val.p = NULL; | ||
n->val.sz = 0; | n->val.sz = 0; | ||
|
|
||
* One additional byte for the '\n' in multiline mode, | * One additional byte for the '\n' in multiline mode, | ||
* and one for the terminating '\0'. | * and one for the terminating '\0'. | ||
*/ | */ | ||
newch = stringsz + (multiline ? 2u : 1u); | newch = stringsz + (1 < append ? 2u : 1u); | ||
if (NULL == n->val.p) { | if (NULL == n->val.p) { | ||
n->val.p = mandoc_malloc(newch); | n->val.p = mandoc_malloc(newch); | ||
|
|
||
} | } | ||
/* Append terminating bytes. */ | /* Append terminating bytes. */ | ||
if (multiline) | if (1 < append) | ||
*c++ = '\n'; | *c++ = '\n'; | ||
*c = '\0'; | *c = '\0'; | ||
|
|
||
roff_getstrn(const struct roff *r, const char *name, size_t len) | roff_getstrn(const struct roff *r, const char *name, size_t len) | ||
{ | { | ||
const struct roffkv *n; | const struct roffkv *n; | ||
int i; | |||
for (n = r->strtab; n; n = n->next) | for (n = r->strtab; n; n = n->next) | ||
if (0 == strncmp(name, n->key.p, len) && | if (0 == strncmp(name, n->key.p, len) && | ||
'\0' == n->key.p[(int)len]) | '\0' == n->key.p[(int)len]) | ||
return(n->val.p); | return(n->val.p); | ||
for (i = 0; i < PREDEFS_MAX; i++) | |||
if (0 == strncmp(name, predefs[i].name, len) && | |||
'\0' == predefs[i].name[(int)len]) | |||
return(predefs[i].str); | |||
return(NULL); | return(NULL); | ||
} | } | ||
|
|
||
const struct tbl_span * | const struct tbl_span * | ||
roff_span(const struct roff *r) | roff_span(const struct roff *r) | ||
{ | { | ||
return(r->tbl ? tbl_span(r->tbl) : NULL); | return(r->tbl ? tbl_span(r->tbl) : NULL); | ||
} | } | ||
const struct eqn * | const struct eqn * | ||
roff_eqn(const struct roff *r) | roff_eqn(const struct roff *r) | ||
{ | { | ||
return(r->last_eqn ? &r->last_eqn->eqn : NULL); | return(r->last_eqn ? &r->last_eqn->eqn : NULL); | ||
} | } | ||
|
|
||
* Append the match to the array and move | * Append the match to the array and move | ||
* forward by its keysize. | * forward by its keysize. | ||
*/ | */ | ||
res = mandoc_realloc | res = mandoc_realloc(res, | ||
(res, ssz + cp->val.sz + 1); | ssz + cp->val.sz + 1); | ||
memcpy(res + ssz, cp->val.p, cp->val.sz); | memcpy(res + ssz, cp->val.p, cp->val.sz); | ||
ssz += cp->val.sz; | ssz += cp->val.sz; | ||
p += (int)cp->key.sz; | p += (int)cp->key.sz; | ||
|
|
||
memcpy(res + ssz, pp, sz); | memcpy(res + ssz, pp, sz); | ||
break; | break; | ||
} | } | ||
/* | /* | ||
* We bail out on bad escapes. | * We bail out on bad escapes. | ||
* No need to warn: we already did so when | * No need to warn: we already did so when | ||
* roff_res() was called. | * roff_res() was called. | ||
*/ | */ | ||
|
|
||
return(res); | return(res); | ||
} | } | ||
int | |||
roff_getformat(const struct roff *r) | |||
{ | |||
return(r->format); | |||
} | |||
/* | /* | ||
* Find out whether a line is a macro line or not. | * Find out whether a line is a macro line or not. | ||
* If it is, adjust the current position and return one; if it isn't, | * If it is, adjust the current position and return one; if it isn't, | ||
* return zero and don't change the current position. | * return zero and don't change the current position. | ||
* If the control character has been set with `.cc', then let that grain | * If the control character has been set with `.cc', then let that grain |