version 1.125, 2011/02/06 20:36:36 |
version 1.171, 2011/09/19 08:34:45 |
|
|
#endif |
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
#include <errno.h> |
|
#include <ctype.h> |
#include <ctype.h> |
#include <limits.h> |
|
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <stdio.h> |
|
|
|
#include "mandoc.h" |
#include "mandoc.h" |
#include "roff.h" |
|
#include "libroff.h" |
#include "libroff.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
|
|
|
/* Maximum number of nested if-else conditionals. */ |
#define RSTACK_MAX 128 |
#define RSTACK_MAX 128 |
|
|
#define ROFF_CTL(c) \ |
/* Maximum number of string expansions per line, to break infinite loops. */ |
('.' == (c) || '\'' == (c)) |
#define EXPAND_LIMIT 1000 |
|
|
enum rofft { |
enum rofft { |
ROFF_ad, |
ROFF_ad, |
|
|
ROFF_EQ, |
ROFF_EQ, |
ROFF_EN, |
ROFF_EN, |
ROFF_cblock, |
ROFF_cblock, |
ROFF_ccond, /* FIXME: remove this. */ |
ROFF_ccond, |
ROFF_USERDEF, |
ROFF_USERDEF, |
ROFF_MAX |
ROFF_MAX |
}; |
}; |
|
|
ROFFRULE_DENY |
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. |
|
*/ |
struct roffstr { |
struct roffstr { |
char *name; /* key of symbol */ |
char *p; /* nil-terminated buffer */ |
char *string; /* current value */ |
size_t sz; /* saved strlen(p) */ |
struct roffstr *next; /* next in list */ |
|
}; |
}; |
|
|
|
/* |
|
* A key-value roffstr pair as part of a singly-linked list. |
|
*/ |
|
struct roffkv { |
|
struct roffstr key; |
|
struct roffstr val; |
|
struct roffkv *next; /* next in list */ |
|
}; |
|
|
struct roff { |
struct roff { |
|
struct mparse *parse; /* parse point */ |
struct roffnode *last; /* leaf of stack */ |
struct roffnode *last; /* leaf of stack */ |
mandocmsg msg; /* err/warn/fatal messages */ |
|
void *data; /* privdata for messages */ |
|
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
int rstackpos; /* position in rstack */ |
int rstackpos; /* position in rstack */ |
struct regset *regs; /* read/writable registers */ |
struct reg regs[REG__MAX]; |
struct roffstr *first_string; /* user-defined strings & macros */ |
struct roffkv *strtab; /* user-defined strings & macros */ |
|
struct roffkv *xmbtab; /* multi-byte trans table (`tr') */ |
|
struct roffstr *xtab; /* single-byte trans table (`tr') */ |
const char *current_string; /* value of last called user macro */ |
const char *current_string; /* value of last called user macro */ |
struct tbl_node *first_tbl; /* first table parsed */ |
struct tbl_node *first_tbl; /* first table parsed */ |
struct tbl_node *last_tbl; /* last table parsed */ |
struct tbl_node *last_tbl; /* last table parsed */ |
Line 132 struct roffmac { |
|
Line 151 struct roffmac { |
|
struct roffmac *next; |
struct roffmac *next; |
}; |
}; |
|
|
|
struct predef { |
|
const char *name; /* predefined input name */ |
|
const char *str; /* replacement symbol */ |
|
}; |
|
|
|
#define PREDEF(__name, __str) \ |
|
{ (__name), (__str) }, |
|
|
|
static enum rofft roffhash_find(const char *, size_t); |
|
static void roffhash_init(void); |
|
static void roffnode_cleanscope(struct roff *); |
|
static void roffnode_pop(struct roff *); |
|
static void roffnode_push(struct roff *, enum rofft, |
|
const char *, int, int); |
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
Line 142 static enum rofferr roff_cond_text(ROFF_ARGS); |
|
Line 175 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 roffrule roff_evalcond(const char *, int *); |
static void roff_freestr(struct roff *); |
static void roff_free1(struct roff *); |
|
static void roff_freestr(struct roffkv *); |
static char *roff_getname(struct roff *, char **, int, int); |
static char *roff_getname(struct roff *, char **, int, int); |
static const char *roff_getstrn(const struct roff *, |
static const char *roff_getstrn(const struct roff *, |
const char *, size_t); |
const char *, size_t); |
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 int roff_res(struct roff *, |
static void roff_openeqn(struct roff *, const char *, |
char **, size_t *, int); |
int, int, const char *); |
|
static enum rofft roff_parse(struct roff *, const char *, int *); |
|
static enum rofferr roff_parsetext(char *); |
|
static void roff_res(struct roff *, |
|
char **, size_t *, int, int); |
static enum rofferr roff_rm(ROFF_ARGS); |
static enum rofferr roff_rm(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 *, |
|
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_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); |
Line 161 static enum rofferr roff_EN(ROFF_ARGS); |
|
Line 202 static enum rofferr roff_EN(ROFF_ARGS); |
|
static enum rofferr roff_T_(ROFF_ARGS); |
static enum rofferr roff_T_(ROFF_ARGS); |
static enum rofferr roff_userdef(ROFF_ARGS); |
static enum rofferr roff_userdef(ROFF_ARGS); |
|
|
/* See roff_hash_find() */ |
/* See roffhash_find() */ |
|
|
#define ASCII_HI 126 |
#define ASCII_HI 126 |
#define ASCII_LO 33 |
#define ASCII_LO 33 |
Line 192 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 233 static struct roffmac roffs[ROFF_MAX] = { |
|
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
{ "rm", roff_rm, 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_line_ignore, NULL, NULL, 0, NULL }, |
{ "tr", roff_tr, 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 }, |
Line 203 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 244 static struct roffmac roffs[ROFF_MAX] = { |
|
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
}; |
}; |
|
|
static void roff_free1(struct roff *); |
/* Array of injected predefined strings. */ |
static enum rofft roff_hash_find(const char *, size_t); |
#define PREDEFS_MAX 38 |
static void roff_hash_init(void); |
static const struct predef predefs[PREDEFS_MAX] = { |
static void roffnode_cleanscope(struct roff *); |
#include "predefs.in" |
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_parse_nat(const char *, unsigned int *); |
|
|
|
/* See roff_hash_find() */ |
/* See roffhash_find() */ |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
|
|
static void |
static void |
roff_hash_init(void) |
roffhash_init(void) |
{ |
{ |
struct roffmac *n; |
struct roffmac *n; |
int buc, i; |
int buc, i; |
Line 237 roff_hash_init(void) |
|
Line 274 roff_hash_init(void) |
|
} |
} |
} |
} |
|
|
|
|
/* |
/* |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* the nil-terminated string name could be found. |
* the nil-terminated string name could be found. |
*/ |
*/ |
static enum rofft |
static enum rofft |
roff_hash_find(const char *p, size_t s) |
roffhash_find(const char *p, size_t s) |
{ |
{ |
int buc; |
int buc; |
struct roffmac *n; |
struct roffmac *n; |
Line 282 roffnode_pop(struct roff *r) |
|
Line 318 roffnode_pop(struct roff *r) |
|
assert(r->last); |
assert(r->last); |
p = r->last; |
p = r->last; |
|
|
if (ROFF_el == p->tok) |
|
if (r->rstackpos > -1) |
|
r->rstackpos--; |
|
|
|
r->last = r->last->parent; |
r->last = r->last->parent; |
free(p->name); |
free(p->name); |
free(p->end); |
free(p->end); |
Line 321 roff_free1(struct roff *r) |
|
Line 353 roff_free1(struct roff *r) |
|
{ |
{ |
struct tbl_node *t; |
struct tbl_node *t; |
struct eqn_node *e; |
struct eqn_node *e; |
|
int i; |
|
|
while (NULL != (t = r->first_tbl)) { |
while (NULL != (t = r->first_tbl)) { |
r->first_tbl = t->next; |
r->first_tbl = t->next; |
Line 339 roff_free1(struct roff *r) |
|
Line 372 roff_free1(struct roff *r) |
|
while (r->last) |
while (r->last) |
roffnode_pop(r); |
roffnode_pop(r); |
|
|
roff_freestr(r); |
roff_freestr(r->strtab); |
} |
roff_freestr(r->xmbtab); |
|
|
|
r->strtab = r->xmbtab = NULL; |
|
|
|
if (r->xtab) |
|
for (i = 0; i < 128; i++) |
|
free(r->xtab[i].p); |
|
|
|
free(r->xtab); |
|
r->xtab = NULL; |
|
} |
|
|
void |
void |
roff_reset(struct roff *r) |
roff_reset(struct roff *r) |
{ |
{ |
|
int i; |
|
|
roff_free1(r); |
roff_free1(r); |
|
|
|
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); |
} |
} |
|
|
|
|
Line 361 roff_free(struct roff *r) |
|
Line 409 roff_free(struct roff *r) |
|
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(struct regset *regs, void *data, const mandocmsg msg) |
roff_alloc(struct mparse *parse) |
{ |
{ |
struct roff *r; |
struct roff *r; |
|
int i; |
|
|
r = mandoc_calloc(1, sizeof(struct roff)); |
r = mandoc_calloc(1, sizeof(struct roff)); |
r->regs = regs; |
r->parse = parse; |
r->msg = msg; |
|
r->data = data; |
|
r->rstackpos = -1; |
r->rstackpos = -1; |
|
|
roff_hash_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 |
* Pre-filter each and every line for reserved words (one beginning with |
* `\*', e.g., `\*(ab'). These must be handled before the actual line |
* `\*', e.g., `\*(ab'). These must be handled before the actual line |
* is processed. |
* is processed. |
|
* This also checks the syntax of regular escapes. |
*/ |
*/ |
static int |
static void |
roff_res(struct roff *r, char **bufp, size_t *szp, int pos) |
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
{ |
{ |
|
enum mandoc_esc esc; |
const char *stesc; /* start of an escape sequence ('\\') */ |
const 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; |
int i, maxl, expand_count; |
size_t nsz; |
size_t nsz; |
char *n; |
char *n; |
|
|
/* Search for a leading backslash and save a pointer to it. */ |
expand_count = 0; |
|
|
|
again: |
cp = *bufp + pos; |
cp = *bufp + pos; |
while (NULL != (cp = strchr(cp, '\\'))) { |
while (NULL != (cp = strchr(cp, '\\'))) { |
stesc = cp++; |
stesc = cp++; |
Line 405 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 458 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
*/ |
*/ |
|
|
if ('\0' == *cp) |
if ('\0' == *cp) |
return(1); |
return; |
if ('*' != *cp++) |
|
continue; |
|
|
|
|
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); |
|
return; |
|
} |
|
|
|
cp++; |
|
|
/* |
/* |
* The third character decides the length |
* The third character decides the length |
* of the name of the string. |
* of the name of the string. |
Line 417 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 482 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
|
|
switch (*cp) { |
switch (*cp) { |
case ('\0'): |
case ('\0'): |
return(1); |
return; |
case ('('): |
case ('('): |
cp++; |
cp++; |
maxl = 2; |
maxl = 2; |
Line 435 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 500 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
/* Advance to the end of the name. */ |
/* Advance to the end of the name. */ |
|
|
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { |
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { |
if ('\0' == *cp) |
if ('\0' == *cp) { |
return(1); /* Error. */ |
mandoc_msg |
|
(MANDOCERR_BADESCAPE, |
|
r->parse, ln, |
|
(int)(stesc - *bufp), NULL); |
|
return; |
|
} |
if (0 == maxl && ']' == *cp) |
if (0 == maxl && ']' == *cp) |
break; |
break; |
} |
} |
Line 449 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 519 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
res = roff_getstrn(r, stnam, (size_t)i); |
res = roff_getstrn(r, stnam, (size_t)i); |
|
|
if (NULL == res) { |
if (NULL == res) { |
cp -= maxl ? 1 : 0; |
mandoc_msg |
continue; |
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
|
res = ""; |
} |
} |
|
|
/* Replace the escape sequence by the string. */ |
/* Replace the escape sequence by the string. */ |
|
|
|
pos = stesc - *bufp; |
|
|
nsz = *szp + strlen(res) + 1; |
nsz = *szp + strlen(res) + 1; |
n = mandoc_malloc(nsz); |
n = mandoc_malloc(nsz); |
|
|
Line 466 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 540 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
|
|
*bufp = n; |
*bufp = n; |
*szp = nsz; |
*szp = nsz; |
return(0); |
|
} |
|
|
|
return(1); |
if (EXPAND_LIMIT >= ++expand_count) |
|
goto again; |
|
|
|
/* Just leave the string unexpanded. */ |
|
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, ln, pos, NULL); |
|
return; |
|
} |
} |
} |
|
|
|
/* |
|
* Process text streams: convert all breakable hyphens into ASCII_HYPH. |
|
*/ |
|
static enum rofferr |
|
roff_parsetext(char *p) |
|
{ |
|
size_t sz; |
|
const char *start; |
|
enum mandoc_esc esc; |
|
|
|
start = p; |
|
|
|
while ('\0' != *p) { |
|
sz = strcspn(p, "-\\"); |
|
p += sz; |
|
|
|
if ('\0' == *p) |
|
break; |
|
|
|
if ('\\' == *p) { |
|
/* Skip over escapes. */ |
|
p++; |
|
esc = mandoc_escape |
|
((const char **)&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) |
|
break; |
|
continue; |
|
} else if (p == start) { |
|
p++; |
|
continue; |
|
} |
|
|
|
if (isalpha((unsigned char)p[-1]) && |
|
isalpha((unsigned char)p[1])) |
|
*p = ASCII_HYPH; |
|
p++; |
|
} |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
enum rofferr |
enum rofferr |
roff_parseln(struct roff *r, int ln, char **bufp, |
roff_parseln(struct roff *r, int ln, char **bufp, |
size_t *szp, int pos, int *offs) |
size_t *szp, int pos, int *offs) |
{ |
{ |
enum rofft t; |
enum rofft t; |
enum rofferr e; |
enum rofferr e; |
int ppos; |
int ppos, ctl; |
|
|
/* |
/* |
* Run the reserved-word filter only if we have some reserved |
* Run the reserved-word filter only if we have some reserved |
* words to fill in. |
* words to fill in. |
*/ |
*/ |
|
|
if (r->first_string && ! roff_res(r, bufp, szp, pos)) |
roff_res(r, bufp, szp, ln, pos); |
return(ROFF_REPARSE); |
|
|
|
|
ppos = pos; |
|
ctl = mandoc_getcontrol(*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 |
* text through the macro's filter. If a scope isn't open and |
* text through the macro's filter. If a scope isn't open and |
Line 497 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 617 roff_parseln(struct roff *r, int ln, char **bufp, |
|
* no matter our state. |
* no matter our state. |
*/ |
*/ |
|
|
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
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) |
Line 506 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 626 roff_parseln(struct roff *r, int ln, char **bufp, |
|
if (ROFF_CONT != e) |
if (ROFF_CONT != e) |
return(e); |
return(e); |
if (r->eqn) |
if (r->eqn) |
return(eqn_read(&r->eqn, ln, *bufp, *offs)); |
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
if (r->tbl) |
if (r->tbl) |
return(tbl_read(r->tbl, ln, *bufp, *offs)); |
return(tbl_read(r->tbl, ln, *bufp, pos)); |
return(ROFF_CONT); |
return(roff_parsetext(*bufp + pos)); |
} else if ( ! ROFF_CTL((*bufp)[pos])) { |
} else if ( ! ctl) { |
if (r->eqn) |
if (r->eqn) |
return(eqn_read(&r->eqn, ln, *bufp, *offs)); |
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
if (r->tbl) |
if (r->tbl) |
return(tbl_read(r->tbl, ln, *bufp, *offs)); |
return(tbl_read(r->tbl, ln, *bufp, pos)); |
return(ROFF_CONT); |
return(roff_parsetext(*bufp + pos)); |
} else if (r->eqn) |
} else if (r->eqn) |
return(eqn_read(&r->eqn, ln, *bufp, *offs)); |
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); |
|
|
/* |
/* |
* 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, |
Line 530 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 650 roff_parseln(struct roff *r, int ln, char **bufp, |
|
assert(roffs[t].sub); |
assert(roffs[t].sub); |
return((*roffs[t].sub) |
return((*roffs[t].sub) |
(r, t, bufp, szp, |
(r, t, bufp, szp, |
ln, pos, pos, offs)); |
ln, ppos, pos, offs)); |
} |
} |
|
|
/* |
/* |
Line 539 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 659 roff_parseln(struct roff *r, int ln, char **bufp, |
|
* the compilers handle it. |
* the compilers handle it. |
*/ |
*/ |
|
|
ppos = pos; |
|
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
return(ROFF_CONT); |
return(ROFF_CONT); |
|
|
Line 555 roff_endparse(struct roff *r) |
|
Line 674 roff_endparse(struct roff *r) |
|
{ |
{ |
|
|
if (r->last) |
if (r->last) |
(*r->msg)(MANDOCERR_SCOPEEXIT, r->data, |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
r->last->line, r->last->col, NULL); |
r->last->line, r->last->col, NULL); |
|
|
if (r->eqn) { |
if (r->eqn) { |
(*r->msg)(MANDOCERR_SCOPEEXIT, r->data, |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
r->eqn->line, r->eqn->pos, NULL); |
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); |
eqn_end(r->eqn); |
eqn_end(&r->eqn); |
r->eqn = NULL; |
|
} |
} |
|
|
if (r->tbl) { |
if (r->tbl) { |
(*r->msg)(MANDOCERR_SCOPEEXIT, r->data, |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
r->tbl->line, r->tbl->pos, NULL); |
r->tbl->line, r->tbl->pos, NULL); |
tbl_end(r->tbl); |
tbl_end(&r->tbl); |
r->tbl = NULL; |
|
} |
} |
} |
} |
|
|
|
|
/* |
/* |
* Parse a roff node's type from the input buffer. This must be in the |
* Parse a roff node's type from the input buffer. This must be in the |
* form of ".foo xxx" in the usual way. |
* form of ".foo xxx" in the usual way. |
Line 585 roff_parse(struct roff *r, const char *buf, int *pos) |
|
Line 701 roff_parse(struct roff *r, const char *buf, int *pos) |
|
size_t maclen; |
size_t maclen; |
enum rofft t; |
enum rofft t; |
|
|
assert(ROFF_CTL(buf[*pos])); |
if ('\0' == buf[*pos] || '"' == buf[*pos] || |
(*pos)++; |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
|
|
while (' ' == buf[*pos] || '\t' == buf[*pos]) |
|
(*pos)++; |
|
|
|
if ('\0' == buf[*pos]) |
|
return(ROFF_MAX); |
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; |
mac = buf + *pos; |
maclen = strcspn(mac, " \\\t\0"); |
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 : roff_hash_find(mac, maclen); |
? ROFF_USERDEF : roffhash_find(mac, maclen); |
|
|
*pos += maclen; |
*pos += (int)maclen; |
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
while (buf[*pos] && ' ' == buf[*pos]) |
(*pos)++; |
(*pos)++; |
|
|
return(t); |
return(t); |
} |
} |
|
|
|
|
static int |
|
roff_parse_nat(const char *buf, unsigned int *res) |
|
{ |
|
char *ep; |
|
long lval; |
|
|
|
errno = 0; |
|
lval = strtol(buf, &ep, 10); |
|
if (buf[0] == '\0' || *ep != '\0') |
|
return(0); |
|
if ((errno == ERANGE && |
|
(lval == LONG_MAX || lval == LONG_MIN)) || |
|
(lval > INT_MAX || lval < 0)) |
|
return(0); |
|
|
|
*res = (unsigned int)lval; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_cblock(ROFF_ARGS) |
roff_cblock(ROFF_ARGS) |
Line 639 roff_cblock(ROFF_ARGS) |
|
Line 736 roff_cblock(ROFF_ARGS) |
|
*/ |
*/ |
|
|
if (NULL == r->last) { |
if (NULL == r->last) { |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 658 roff_cblock(ROFF_ARGS) |
|
Line 755 roff_cblock(ROFF_ARGS) |
|
case (ROFF_ig): |
case (ROFF_ig): |
break; |
break; |
default: |
default: |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
if ((*bufp)[pos]) |
if ((*bufp)[pos]) |
(*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL); |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
Line 690 roff_ccond(ROFF_ARGS) |
|
Line 787 roff_ccond(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->last) { |
if (NULL == r->last) { |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 702 roff_ccond(ROFF_ARGS) |
|
Line 799 roff_ccond(ROFF_ARGS) |
|
case (ROFF_if): |
case (ROFF_if): |
break; |
break; |
default: |
default: |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
if (r->last->endspan > -1) { |
if (r->last->endspan > -1) { |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
if ((*bufp)[pos]) |
if ((*bufp)[pos]) |
(*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL); |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
Line 732 roff_block(ROFF_ARGS) |
|
Line 829 roff_block(ROFF_ARGS) |
|
|
|
if (ROFF_ig != tok) { |
if (ROFF_ig != tok) { |
if ('\0' == (*bufp)[pos]) { |
if ('\0' == (*bufp)[pos]) { |
(*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 746 roff_block(ROFF_ARGS) |
|
Line 843 roff_block(ROFF_ARGS) |
|
if (ROFF_de == tok) |
if (ROFF_de == tok) |
name = *bufp + pos; |
name = *bufp + pos; |
else |
else |
(*r->msg)(MANDOCERR_REQUEST, r->data, ln, ppos, |
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, |
roffs[tok].name); |
roffs[tok].name); |
|
|
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
pos++; |
pos++; |
|
|
while (' ' == (*bufp)[pos]) |
while (isspace((unsigned char)(*bufp)[pos])) |
(*bufp)[pos++] = '\0'; |
(*bufp)[pos++] = '\0'; |
} |
} |
|
|
Line 773 roff_block(ROFF_ARGS) |
|
Line 870 roff_block(ROFF_ARGS) |
|
/* If present, process the custom end-of-line marker. */ |
/* If present, process the custom end-of-line marker. */ |
|
|
sv = pos; |
sv = pos; |
while ((*bufp)[pos] && |
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
' ' != (*bufp)[pos] && |
|
'\t' != (*bufp)[pos]) |
|
pos++; |
pos++; |
|
|
/* |
/* |
Line 796 roff_block(ROFF_ARGS) |
|
Line 891 roff_block(ROFF_ARGS) |
|
r->last->end[(int)sz] = '\0'; |
r->last->end[(int)sz] = '\0'; |
|
|
if ((*bufp)[pos]) |
if ((*bufp)[pos]) |
(*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL); |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
Line 819 roff_block_sub(ROFF_ARGS) |
|
Line 914 roff_block_sub(ROFF_ARGS) |
|
*/ |
*/ |
|
|
if (r->last->end) { |
if (r->last->end) { |
i = pos + 1; |
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
|
i++; |
|
|
|
for (j = 0; r->last->end[j]; j++, i++) |
|
if ((*bufp)[i] != r->last->end[j]) |
if ((*bufp)[i] != r->last->end[j]) |
break; |
break; |
|
|
Line 834 roff_block_sub(ROFF_ARGS) |
|
Line 925 roff_block_sub(ROFF_ARGS) |
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
|
|
|
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
|
i++; |
|
|
|
pos = i; |
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
return(ROFF_RERUN); |
return(ROFF_RERUN); |
return(ROFF_IGN); |
return(ROFF_IGN); |
Line 845 roff_block_sub(ROFF_ARGS) |
|
Line 940 roff_block_sub(ROFF_ARGS) |
|
* pulling it out of the hashtable. |
* pulling it out of the hashtable. |
*/ |
*/ |
|
|
ppos = pos; |
|
t = roff_parse(r, *bufp, &pos); |
t = roff_parse(r, *bufp, &pos); |
|
|
/* |
/* |
Line 882 roff_cond_sub(ROFF_ARGS) |
|
Line 976 roff_cond_sub(ROFF_ARGS) |
|
{ |
{ |
enum rofft t; |
enum rofft t; |
enum roffrule rr; |
enum roffrule rr; |
|
char *ep; |
|
|
ppos = pos; |
|
rr = r->last->rule; |
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
|
/* |
/* |
* Clean out scope. If we've closed ourselves, then don't |
* If the macro is unknown, first check if it contains a closing |
* continue. |
* delimiter `\}'. If it does, close out our scope and return |
|
* the currently-scoped rule (ignore or continue). Else, drop |
|
* into the currently-scoped rule. |
*/ |
*/ |
|
|
roffnode_cleanscope(r); |
|
|
|
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) { |
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) { |
if ('\\' == (*bufp)[pos] && '}' == (*bufp)[pos + 1]) |
ep = &(*bufp)[pos]; |
return(roff_ccond |
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
(r, ROFF_ccond, bufp, szp, |
ep++; |
ln, pos, pos + 2, 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); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
} |
} |
|
|
Line 906 roff_cond_sub(ROFF_ARGS) |
|
Line 1022 roff_cond_sub(ROFF_ARGS) |
|
* if they're either structurally required (such as loops and |
* if they're either structurally required (such as loops and |
* conditionals) or a closing macro. |
* conditionals) or a closing macro. |
*/ |
*/ |
|
|
if (ROFFRULE_DENY == rr) |
if (ROFFRULE_DENY == rr) |
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
if (ROFF_ccond != t) |
if (ROFF_ccond != t) |
Line 916 roff_cond_sub(ROFF_ARGS) |
|
Line 1033 roff_cond_sub(ROFF_ARGS) |
|
ln, ppos, pos, offs)); |
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_cond_text(ROFF_ARGS) |
roff_cond_text(ROFF_ARGS) |
{ |
{ |
char *ep, *st; |
char *ep; |
enum roffrule rr; |
enum roffrule rr; |
|
|
rr = r->last->rule; |
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
|
/* |
ep = &(*bufp)[pos]; |
* We display the value of the text if out current evaluation |
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
* scope permits us to do so. |
ep++; |
*/ |
if ('}' != *ep) |
|
continue; |
/* FIXME: use roff_ccond? */ |
*ep = '&'; |
|
roff_ccond(r, ROFF_ccond, bufp, szp, |
st = &(*bufp)[pos]; |
ln, pos, pos + 2, offs); |
if (NULL == (ep = strstr(st, "\\}"))) { |
|
roffnode_cleanscope(r); |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
} |
} |
|
|
if (ep == st || (ep > st && '\\' != *(ep - 1))) |
|
roffnode_pop(r); |
|
|
|
roffnode_cleanscope(r); |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
} |
} |
|
|
|
|
static enum roffrule |
static enum roffrule |
roff_evalcond(const char *v, int *pos) |
roff_evalcond(const char *v, int *pos) |
{ |
{ |
Line 977 roff_line_ignore(ROFF_ARGS) |
|
Line 1085 roff_line_ignore(ROFF_ARGS) |
|
{ |
{ |
|
|
if (ROFF_it == tok) |
if (ROFF_it == tok) |
(*r->msg)(MANDOCERR_REQUEST, r->data, ln, ppos, "it"); |
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, "it"); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
Line 989 roff_cond(ROFF_ARGS) |
|
Line 1097 roff_cond(ROFF_ARGS) |
|
int sv; |
int sv; |
enum roffrule rule; |
enum roffrule rule; |
|
|
/* Stack overflow! */ |
/* |
|
* An `.el' has no conditional body: it will consume the value |
|
* of the current rstack entry set in prior `ie' calls or |
|
* defaults to DENY. |
|
* |
|
* If we're not an `el', however, then evaluate the conditional. |
|
*/ |
|
|
if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) { |
rule = ROFF_el == tok ? |
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
(r->rstackpos < 0 ? |
return(ROFF_ERR); |
ROFFRULE_DENY : r->rstack[r->rstackpos--]) : |
} |
roff_evalcond(*bufp, &pos); |
|
|
/* First, evaluate the conditional. */ |
|
|
|
if (ROFF_el == tok) { |
|
/* |
|
* An `.el' will get the value of the current rstack |
|
* entry set in prior `ie' calls or defaults to DENY. |
|
*/ |
|
if (r->rstackpos < 0) |
|
rule = ROFFRULE_DENY; |
|
else |
|
rule = r->rstack[r->rstackpos]; |
|
} else |
|
rule = roff_evalcond(*bufp, &pos); |
|
|
|
sv = pos; |
sv = pos; |
|
|
while (' ' == (*bufp)[pos]) |
while (' ' == (*bufp)[pos]) |
pos++; |
pos++; |
|
|
Line 1023 roff_cond(ROFF_ARGS) |
|
Line 1122 roff_cond(ROFF_ARGS) |
|
*/ |
*/ |
|
|
if ('\0' == (*bufp)[pos] && sv != pos) { |
if ('\0' == (*bufp)[pos] && sv != pos) { |
(*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1031 roff_cond(ROFF_ARGS) |
|
Line 1130 roff_cond(ROFF_ARGS) |
|
|
|
r->last->rule = rule; |
r->last->rule = rule; |
|
|
|
/* |
|
* An if-else will put the NEGATION of the current evaluated |
|
* conditional into the stack of rules. |
|
*/ |
|
|
if (ROFF_ie == tok) { |
if (ROFF_ie == tok) { |
/* |
if (r->rstackpos == RSTACK_MAX - 1) { |
* An if-else will put the NEGATION of the current |
mandoc_msg(MANDOCERR_MEM, |
* evaluated conditional into the stack. |
r->parse, ln, ppos, NULL); |
*/ |
return(ROFF_ERR); |
r->rstackpos++; |
} |
if (ROFFRULE_DENY == r->last->rule) |
r->rstack[++r->rstackpos] = |
r->rstack[r->rstackpos] = ROFFRULE_ALLOW; |
ROFFRULE_DENY == r->last->rule ? |
else |
ROFFRULE_ALLOW : ROFFRULE_DENY; |
r->rstack[r->rstackpos] = 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. */ |
Line 1106 roff_ds(ROFF_ARGS) |
|
Line 1209 roff_ds(ROFF_ARGS) |
|
return(ROFF_IGN); |
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 */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_nr(ROFF_ARGS) |
roff_nr(ROFF_ARGS) |
{ |
{ |
const char *key; |
const char *key; |
char *val; |
char *val; |
struct reg *rg; |
int iv; |
|
|
val = *bufp + pos; |
val = *bufp + pos; |
key = roff_getname(r, &val, ln, pos); |
key = roff_getname(r, &val, ln, pos); |
rg = r->regs->regs; |
|
|
|
if (0 == strcmp(key, "nS")) { |
if (0 == strcmp(key, "nS")) { |
rg[(int)REG_nS].set = 1; |
r->regs[(int)REG_nS].set = 1; |
if ( ! roff_parse_nat(val, &rg[(int)REG_nS].v.u)) |
if ((iv = mandoc_strntoi(val, strlen(val), 10)) >= 0) |
rg[(int)REG_nS].v.u = 0; |
r->regs[(int)REG_nS].u = (unsigned)iv; |
|
else |
|
r->regs[(int)REG_nS].u = 0u; |
} |
} |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
Line 1137 roff_rm(ROFF_ARGS) |
|
Line 1261 roff_rm(ROFF_ARGS) |
|
|
|
cp = *bufp + pos; |
cp = *bufp + pos; |
while ('\0' != *cp) { |
while ('\0' != *cp) { |
name = roff_getname(r, &cp, ln, cp - *bufp); |
name = roff_getname(r, &cp, ln, (int)(cp - *bufp)); |
if ('\0' != *name) |
if ('\0' != *name) |
roff_setstr(r, name, NULL, 0); |
roff_setstr(r, name, NULL, 0); |
} |
} |
Line 1150 roff_TE(ROFF_ARGS) |
|
Line 1274 roff_TE(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->tbl) |
if (NULL == r->tbl) |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
else |
else |
tbl_end(r->tbl); |
tbl_end(&r->tbl); |
|
|
r->tbl = NULL; |
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1164 roff_T_(ROFF_ARGS) |
|
Line 1287 roff_T_(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->tbl) |
if (NULL == r->tbl) |
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
else |
else |
tbl_restart(ppos, ln, r->tbl); |
tbl_restart(ppos, ln, r->tbl); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
/* ARGSUSED */ |
#if 0 |
static enum rofferr |
static int |
roff_EQ(ROFF_ARGS) |
roff_closeeqn(struct roff *r) |
{ |
{ |
struct eqn_node *e; |
|
|
|
|
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
|
} |
|
#endif |
|
|
|
static 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); |
assert(NULL == r->eqn); |
e = eqn_alloc(ppos, ln); |
e = eqn_alloc(name, offs, line, r->parse); |
|
|
if (r->last_eqn) |
if (r->last_eqn) |
r->last_eqn->next = e; |
r->last_eqn->next = e; |
Line 1186 roff_EQ(ROFF_ARGS) |
|
Line 1319 roff_EQ(ROFF_ARGS) |
|
r->first_eqn = r->last_eqn = e; |
r->first_eqn = r->last_eqn = e; |
|
|
r->eqn = r->last_eqn = e; |
r->eqn = r->last_eqn = e; |
|
|
|
if (buf) { |
|
poff = 0; |
|
eqn_read(&r->eqn, line, buf, offs, &poff); |
|
} |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_EQ(ROFF_ARGS) |
|
{ |
|
|
|
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1194 static enum rofferr |
|
Line 1340 static enum rofferr |
|
roff_EN(ROFF_ARGS) |
roff_EN(ROFF_ARGS) |
{ |
{ |
|
|
(*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1205 roff_TS(ROFF_ARGS) |
|
Line 1351 roff_TS(ROFF_ARGS) |
|
struct tbl_node *t; |
struct tbl_node *t; |
|
|
if (r->tbl) { |
if (r->tbl) { |
(*r->msg)(MANDOCERR_SCOPEBROKEN, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
tbl_end(r->tbl); |
tbl_end(&r->tbl); |
} |
} |
|
|
t = tbl_alloc(ppos, ln, r->data, r->msg); |
t = tbl_alloc(ppos, ln, r->parse); |
|
|
if (r->last_tbl) |
if (r->last_tbl) |
r->last_tbl->next = t; |
r->last_tbl->next = t; |
Line 1222 roff_TS(ROFF_ARGS) |
|
Line 1368 roff_TS(ROFF_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
|
roff_tr(ROFF_ARGS) |
|
{ |
|
const char *p, *first, *second; |
|
size_t fsz, ssz; |
|
enum mandoc_esc esc; |
|
|
|
p = *bufp + pos; |
|
|
|
if ('\0' == *p) { |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
while ('\0' != *p) { |
|
fsz = ssz = 1; |
|
|
|
first = p++; |
|
if ('\\' == *first) { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
fsz = (size_t)(p - first); |
|
} |
|
|
|
second = p++; |
|
if ('\\' == *second) { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
ssz = (size_t)(p - second); |
|
} else if ('\0' == *second) { |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
second = " "; |
|
p--; |
|
} |
|
|
|
if (fsz > 1) { |
|
roff_setstrn(&r->xmbtab, first, |
|
fsz, second, ssz, 0); |
|
continue; |
|
} |
|
|
|
if (NULL == r->xtab) |
|
r->xtab = mandoc_calloc |
|
(128, sizeof(struct roffstr)); |
|
|
|
free(r->xtab[(int)*first].p); |
|
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); |
|
r->xtab[(int)*first].sz = ssz; |
|
} |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
roff_so(ROFF_ARGS) |
roff_so(ROFF_ARGS) |
{ |
{ |
char *name; |
char *name; |
|
|
(*r->msg)(MANDOCERR_SO, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); |
|
|
/* |
/* |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
Line 1237 roff_so(ROFF_ARGS) |
|
Line 1448 roff_so(ROFF_ARGS) |
|
|
|
name = *bufp + pos; |
name = *bufp + pos; |
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
(*r->msg)(MANDOCERR_SOPATH, r->data, ln, pos, NULL); |
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); |
return(ROFF_ERR); |
return(ROFF_ERR); |
} |
} |
|
|
Line 1260 roff_userdef(ROFF_ARGS) |
|
Line 1471 roff_userdef(ROFF_ARGS) |
|
cp = *bufp + pos; |
cp = *bufp + pos; |
for (i = 0; i < 9; i++) |
for (i = 0; i < 9; i++) |
arg[i] = '\0' == *cp ? "" : |
arg[i] = '\0' == *cp ? "" : |
mandoc_getarg(&cp, r->msg, r->data, ln, &pos); |
mandoc_getarg(r->parse, &cp, ln, &pos); |
|
|
/* |
/* |
* Expand macro arguments. |
* Expand macro arguments. |
Line 1316 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
Line 1527 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
cp++; |
cp++; |
if ('\\' == *cp) |
if ('\\' == *cp) |
continue; |
continue; |
(*r->msg)(MANDOCERR_NAMESC, r->data, ln, pos, NULL); |
mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL); |
*cp = '\0'; |
*cp = '\0'; |
name = cp; |
name = cp; |
} |
} |
|
|
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 multiline) |
{ |
{ |
struct roffstr *n; |
|
char *c; |
|
size_t oldch, newch; |
|
|
|
|
roff_setstrn(&r->strtab, name, strlen(name), string, |
|
string ? strlen(string) : 0, multiline); |
|
} |
|
|
|
static void |
|
roff_setstrn(struct roffkv **r, const char *name, size_t namesz, |
|
const char *string, size_t stringsz, int multiline) |
|
{ |
|
struct roffkv *n; |
|
char *c; |
|
int i; |
|
size_t oldch, newch; |
|
|
/* Search for an existing string with the same name. */ |
/* Search for an existing string with the same name. */ |
n = r->first_string; |
n = *r; |
while (n && strcmp(name, n->name)) |
|
|
while (n && strcmp(name, n->key.p)) |
n = n->next; |
n = n->next; |
|
|
if (NULL == n) { |
if (NULL == n) { |
/* Create a new string table entry. */ |
/* Create a new string table entry. */ |
n = mandoc_malloc(sizeof(struct roffstr)); |
n = mandoc_malloc(sizeof(struct roffkv)); |
n->name = mandoc_strdup(name); |
n->key.p = mandoc_strndup(name, namesz); |
n->string = NULL; |
n->key.sz = namesz; |
n->next = r->first_string; |
n->val.p = NULL; |
r->first_string = n; |
n->val.sz = 0; |
|
n->next = *r; |
|
*r = n; |
} else if (0 == multiline) { |
} else if (0 == multiline) { |
/* In multiline mode, append; else replace. */ |
/* In multiline mode, append; else replace. */ |
free(n->string); |
free(n->val.p); |
n->string = NULL; |
n->val.p = NULL; |
|
n->val.sz = 0; |
} |
} |
|
|
if (NULL == string) |
if (NULL == string) |
Line 1372 roff_setstr(struct roff *r, const char *name, const ch |
|
Line 1597 roff_setstr(struct roff *r, const char *name, const ch |
|
* 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 = strlen(string) + (multiline ? 2 : 1); |
newch = stringsz + (multiline ? 2u : 1u); |
if (NULL == n->string) { |
|
n->string = mandoc_malloc(newch); |
if (NULL == n->val.p) { |
*n->string = '\0'; |
n->val.p = mandoc_malloc(newch); |
|
*n->val.p = '\0'; |
oldch = 0; |
oldch = 0; |
} else { |
} else { |
oldch = strlen(n->string); |
oldch = n->val.sz; |
n->string = mandoc_realloc(n->string, oldch + newch); |
n->val.p = mandoc_realloc(n->val.p, oldch + newch); |
} |
} |
|
|
/* Skip existing content in the destination buffer. */ |
/* Skip existing content in the destination buffer. */ |
c = n->string + oldch; |
c = n->val.p + (int)oldch; |
|
|
/* Append new content to the destination buffer. */ |
/* Append new content to the destination buffer. */ |
while (*string) { |
i = 0; |
|
while (i < (int)stringsz) { |
/* |
/* |
* Rudimentary roff copy mode: |
* Rudimentary roff copy mode: |
* Handle escaped backslashes. |
* Handle escaped backslashes. |
*/ |
*/ |
if ('\\' == *string && '\\' == *(string + 1)) |
if ('\\' == string[i] && '\\' == string[i + 1]) |
string++; |
i++; |
*c++ = *string++; |
*c++ = string[i++]; |
} |
} |
|
|
/* Append terminating bytes. */ |
/* Append terminating bytes. */ |
if (multiline) |
if (multiline) |
*c++ = '\n'; |
*c++ = '\n'; |
|
|
*c = '\0'; |
*c = '\0'; |
|
n->val.sz = (int)(c - n->val.p); |
} |
} |
|
|
static const char * |
static const char * |
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 roffstr *n; |
const struct roffkv *n; |
|
|
n = r->first_string; |
for (n = r->strtab; n; n = n->next) |
while (n && (strncmp(name, n->name, len) || '\0' != n->name[(int)len])) |
if (0 == strncmp(name, n->key.p, len) && |
n = n->next; |
'\0' == n->key.p[(int)len]) |
|
return(n->val.p); |
|
|
return(n ? n->string : NULL); |
return(NULL); |
} |
} |
|
|
static void |
static void |
roff_freestr(struct roff *r) |
roff_freestr(struct roffkv *r) |
{ |
{ |
struct roffstr *n, *nn; |
struct roffkv *n, *nn; |
|
|
for (n = r->first_string; n; n = nn) { |
for (n = r; n; n = nn) { |
free(n->name); |
free(n->key.p); |
free(n->string); |
free(n->val.p); |
nn = n->next; |
nn = n->next; |
free(n); |
free(n); |
} |
} |
|
|
r->first_string = NULL; |
|
} |
} |
|
|
const struct tbl_span * |
const struct tbl_span * |
Line 1441 roff_eqn(const struct roff *r) |
|
Line 1669 roff_eqn(const struct roff *r) |
|
{ |
{ |
|
|
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
|
} |
|
|
|
/* |
|
* Duplicate an input string, making the appropriate character |
|
* conversations (as stipulated by `tr') along the way. |
|
* Returns a heap-allocated string with all the replacements made. |
|
*/ |
|
char * |
|
roff_strdup(const struct roff *r, const char *p) |
|
{ |
|
const struct roffkv *cp; |
|
char *res; |
|
const char *pp; |
|
size_t ssz, sz; |
|
enum mandoc_esc esc; |
|
|
|
if (NULL == r->xmbtab && NULL == r->xtab) |
|
return(mandoc_strdup(p)); |
|
else if ('\0' == *p) |
|
return(mandoc_strdup("")); |
|
|
|
/* |
|
* Step through each character looking for term matches |
|
* (remember that a `tr' can be invoked with an escape, which is |
|
* a glyph but the escape is multi-character). |
|
* We only do this if the character hash has been initialised |
|
* and the string is >0 length. |
|
*/ |
|
|
|
res = NULL; |
|
ssz = 0; |
|
|
|
while ('\0' != *p) { |
|
if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) { |
|
sz = r->xtab[(int)*p].sz; |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, r->xtab[(int)*p].p, sz); |
|
ssz += sz; |
|
p++; |
|
continue; |
|
} else if ('\\' != *p) { |
|
res = mandoc_realloc(res, ssz + 2); |
|
res[ssz++] = *p++; |
|
continue; |
|
} |
|
|
|
/* Search for term matches. */ |
|
for (cp = r->xmbtab; cp; cp = cp->next) |
|
if (0 == strncmp(p, cp->key.p, cp->key.sz)) |
|
break; |
|
|
|
if (NULL != cp) { |
|
/* |
|
* A match has been found. |
|
* Append the match to the array and move |
|
* forward by its keysize. |
|
*/ |
|
res = mandoc_realloc |
|
(res, ssz + cp->val.sz + 1); |
|
memcpy(res + ssz, cp->val.p, cp->val.sz); |
|
ssz += cp->val.sz; |
|
p += (int)cp->key.sz; |
|
continue; |
|
} |
|
|
|
/* |
|
* Handle escapes carefully: we need to copy |
|
* over just the escape itself, or else we might |
|
* do replacements within the escape itself. |
|
* Make sure to pass along the bogus string. |
|
*/ |
|
pp = p++; |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
sz = strlen(pp); |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, pp, sz); |
|
break; |
|
} |
|
/* |
|
* We bail out on bad escapes. |
|
* No need to warn: we already did so when |
|
* roff_res() was called. |
|
*/ |
|
sz = (int)(p - pp); |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, pp, sz); |
|
ssz += sz; |
|
} |
|
|
|
res[(int)ssz] = '\0'; |
|
return(res); |
} |
} |