version 1.188, 2013/12/25 00:50:05 |
version 1.205, 2014/04/07 21:00:08 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2011, 2012, 2013 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 |
|
|
#include <string.h> |
#include <string.h> |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
#include "libroff.h" |
#include "libroff.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
|
|
|
|
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_ns, |
ROFF_ns, |
ROFF_ps, |
ROFF_ps, |
ROFF_rm, |
ROFF_rm, |
|
ROFF_rr, |
ROFF_so, |
ROFF_so, |
ROFF_ta, |
ROFF_ta, |
ROFF_tr, |
ROFF_tr, |
|
|
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_DENY, |
|
ROFFRULE_ALLOW |
|
}; |
|
|
|
/* |
/* |
* An incredibly-simple string buffer. |
* An incredibly-simple string buffer. |
*/ |
*/ |
Line 107 struct roffreg { |
|
Line 105 struct roffreg { |
|
}; |
}; |
|
|
struct roff { |
struct roff { |
enum mparset parsetype; /* requested parse type */ |
|
struct mparse *parse; /* parse point */ |
struct mparse *parse; /* parse point */ |
|
int options; /* parse options */ |
struct roffnode *last; /* leaf of stack */ |
struct roffnode *last; /* leaf of stack */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
int rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
char control; /* control character */ |
char control; /* control character */ |
int rstackpos; /* position in rstack */ |
int rstackpos; /* position in rstack */ |
struct roffreg *regtab; /* number registers */ |
struct roffreg *regtab; /* number registers */ |
Line 134 struct roffnode { |
|
Line 132 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 */ \ |
Line 177 static enum rofferr roff_block_text(ROFF_ARGS); |
|
Line 175 static enum rofferr roff_block_text(ROFF_ARGS); |
|
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 int roff_evalcond(const char *, int *); |
|
static int roff_evalnum(const char *, int *, int *, int); |
|
static int roff_evalpar(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_freereg(struct roffreg *); |
static void roff_freestr(struct roffkv *); |
static void roff_freestr(struct roffkv *); |
Line 191 static int roff_getnum(const char *, int *, int *); |
|
Line 192 static int roff_getnum(const char *, int *, int *); |
|
static int roff_getop(const char *, int *, char *); |
static int roff_getop(const char *, int *, char *); |
static int roff_getregn(const struct roff *, |
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 *, |
static const char *roff_getstrn(const struct roff *, |
const char *, size_t); |
const char *, size_t); |
static enum rofferr roff_it(ROFF_ARGS); |
static enum rofferr roff_it(ROFF_ARGS); |
Line 203 static enum rofferr roff_parsetext(char **, size_t *, |
|
Line 205 static enum rofferr roff_parsetext(char **, size_t *, |
|
static enum rofferr roff_res(struct roff *, |
static enum rofferr roff_res(struct roff *, |
char **, size_t *, int, int); |
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 *, |
Line 231 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 234 static struct roffmac roffs[ROFF_MAX] = { |
|
{ "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 }, |
Line 250 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 255 static struct roffmac roffs[ROFF_MAX] = { |
|
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ns", 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 }, |
Line 261 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 267 static struct roffmac roffs[ROFF_MAX] = { |
|
{ "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[] = { |
const char *const __mdoc_reserved[] = { |
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
"Ds", "Dt", "Dv", "Dx", "D1", |
"Dt", "Dv", "Dx", "D1", |
"Ec", "Ed", "Ef", "Ek", "El", "Em", "em", |
"Ec", "Ed", "Ef", "Ek", "El", "Em", |
"En", "Eo", "Eq", "Er", "Es", "Ev", "Ex", |
"En", "Eo", "Er", "Es", "Ev", "Ex", |
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", "LP", |
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", |
"Me", "Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
"Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
"Pa", "Pc", "Pf", "Po", "Pp", "PP", "pp", "Pq", |
"Pa", "Pc", "Pf", "Po", "Pp", "Pq", |
"Qc", "Ql", "Qo", "Qq", "Or", "Rd", "Re", "Rs", "Rv", |
"Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv", |
"Sc", "Sf", "Sh", "SH", "Sm", "So", "Sq", |
"Sc", "Sh", "Sm", "So", "Sq", |
"Ss", "St", "Sx", "Sy", |
"Ss", "St", "Sx", "Sy", |
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
"%A", "%B", "%D", "%I", "%J", "%N", "%O", |
"%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O", |
"%P", "%Q", "%R", "%T", "%U", "%V", |
"%P", "%Q", "%R", "%T", "%U", "%V", |
NULL |
NULL |
}; |
}; |
|
|
|
/* not currently implemented: BT DE DS ME MT PT SY TQ YS */ |
const char *const __man_reserved[] = { |
const char *const __man_reserved[] = { |
"AT", "B", "BI", "BR", "BT", "DE", "DS", "DT", |
"AT", "B", "BI", "BR", "DT", |
"EE", "EN", "EQ", "EX", "HF", "HP", "I", "IB", "IP", "IR", |
"EE", "EN", "EQ", "EX", "HP", "I", "IB", "IP", "IR", |
"LP", "ME", "MT", "OP", "P", "PD", "PP", "PT", |
"LP", "OP", "P", "PD", "PP", |
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", "SY", |
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", |
"TE", "TH", "TP", "TQ", "TS", "T&", "UC", "UE", "UR", "YS", |
"TE", "TH", "TP", "TS", "T&", "UC", "UE", "UR", |
NULL |
NULL |
}; |
}; |
|
|
Line 397 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
Line 404 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
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; |
} |
} |
Line 447 roff_free1(struct roff *r) |
|
Line 454 roff_free1(struct roff *r) |
|
void |
void |
roff_reset(struct roff *r) |
roff_reset(struct roff *r) |
{ |
{ |
int i; |
|
|
|
roff_free1(r); |
roff_free1(r); |
|
|
r->control = 0; |
r->control = 0; |
|
|
for (i = 0; i < PREDEFS_MAX; i++) |
|
roff_setstr(r, predefs[i].name, predefs[i].str, 0); |
|
} |
} |
|
|
|
|
Line 468 roff_free(struct roff *r) |
|
Line 470 roff_free(struct roff *r) |
|
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(enum mparset type, struct mparse *parse) |
roff_alloc(struct mparse *parse, 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->parsetype = type; |
|
r->parse = parse; |
r->parse = parse; |
|
r->options = options; |
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); |
} |
} |
|
|
Line 495 static enum rofferr |
|
Line 493 static enum rofferr |
|
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
{ |
{ |
char ubuf[12]; /* buffer to print the number */ |
char ubuf[12]; /* buffer to print the number */ |
|
const char *start; /* start of the string to process */ |
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 */ |
char *nbuf; /* new buffer to copy bufp to */ |
char *nbuf; /* new buffer to copy bufp to */ |
size_t nsz; /* size of the new buffer */ |
|
size_t maxl; /* expected length of the escape name */ |
size_t maxl; /* expected length of the escape name */ |
size_t naml; /* actual length of the escape name */ |
size_t naml; /* actual length of the escape name */ |
|
size_t ressz; /* size of the replacement string */ |
int expand_count; /* to avoid infinite loops */ |
int expand_count; /* to avoid infinite loops */ |
|
|
expand_count = 0; |
expand_count = 0; |
|
start = *bufp + 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) |
|
continue; |
|
|
|
/* If it is escaped, skip it. */ |
|
|
|
for (cp = stesc - 1; cp >= start; cp--) |
|
if ('\\' != *cp) |
|
break; |
|
|
|
if (0 == (stesc - cp) % 2) { |
|
stesc = cp; |
|
continue; |
|
} |
|
|
/* |
/* |
* The second character must be an asterisk or an n. |
* Everything except user-defined strings and number |
* If it isn't, skip it anyway: It is escaped, |
* registers is only checked, not expanded. |
* so it can't start another escape sequence. |
|
*/ |
*/ |
|
|
if ('\0' == *cp) |
cp = stesc + 1; |
return(ROFF_CONT); |
|
|
|
switch (*cp) { |
switch (*cp) { |
case ('*'): |
case ('*'): |
res = NULL; |
res = NULL; |
|
|
res = ubuf; |
res = ubuf; |
break; |
break; |
default: |
default: |
if (ESCAPE_ERROR != mandoc_escape(&cp, NULL, NULL)) |
if (ESCAPE_ERROR == mandoc_escape(&cp, NULL, NULL)) |
continue; |
mandoc_msg(MANDOCERR_BADESCAPE, r->parse, |
mandoc_msg |
ln, (int)(stesc - *bufp), NULL); |
(MANDOCERR_BADESCAPE, r->parse, |
continue; |
ln, (int)(stesc - *bufp), NULL); |
|
return(ROFF_CONT); |
|
} |
} |
|
|
cp++; |
if (EXPAND_LIMIT < ++expand_count) { |
|
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
/* |
/* |
* The third character decides the length |
* The third character decides the length |
|
|
* Save a pointer to the name. |
* Save a pointer to the name. |
*/ |
*/ |
|
|
switch (*cp) { |
switch (*++cp) { |
case ('\0'): |
case ('\0'): |
return(ROFF_CONT); |
continue; |
case ('('): |
case ('('): |
cp++; |
cp++; |
maxl = 2; |
maxl = 2; |
|
|
(MANDOCERR_BADESCAPE, |
(MANDOCERR_BADESCAPE, |
r->parse, ln, |
r->parse, ln, |
(int)(stesc - *bufp), NULL); |
(int)(stesc - *bufp), NULL); |
return(ROFF_CONT); |
continue; |
} |
} |
if (0 == maxl && ']' == *cp) |
if (0 == maxl && ']' == *cp) |
break; |
break; |
|
|
ln, (int)(stesc - *bufp), NULL); |
ln, (int)(stesc - *bufp), NULL); |
res = ""; |
res = ""; |
} |
} |
|
ressz = strlen(res); |
|
|
/* Replace the escape sequence by the string. */ |
/* Replace the escape sequence by the string. */ |
|
|
pos = stesc - *bufp; |
*szp += ressz + 1; |
|
nbuf = mandoc_malloc(*szp); |
|
|
nsz = *szp + strlen(res) + 1; |
|
nbuf = mandoc_malloc(nsz); |
|
|
|
strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1)); |
strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1)); |
strlcat(nbuf, res, nsz); |
strlcat(nbuf, res, *szp); |
strlcat(nbuf, cp + (maxl ? 0 : 1), nsz); |
strlcat(nbuf, cp + (maxl ? 0 : 1), *szp); |
|
|
free(*bufp); |
/* Prepare for the next replacement. */ |
|
|
|
start = nbuf + pos; |
|
stesc = nbuf + (stesc - *bufp) + ressz; |
|
free(*bufp); |
*bufp = nbuf; |
*bufp = nbuf; |
*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); |
} |
} |
Line 646 roff_parsetext(char **bufp, size_t *szp, int pos, int |
|
Line 652 roff_parsetext(char **bufp, size_t *szp, int pos, int |
|
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 const **)&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) |
if (ESCAPE_ERROR == esc) |
break; |
break; |
continue; |
continue; |
Line 664 roff_parsetext(char **bufp, size_t *szp, int pos, int |
|
Line 669 roff_parsetext(char **bufp, size_t *szp, int pos, int |
|
|
|
/* Spring the input line trap. */ |
/* Spring the input line trap. */ |
if (1 == roffit_lines) { |
if (1 == roffit_lines) { |
isz = asprintf(&p, "%s\n.%s", *bufp, roffit_macro); |
isz = mandoc_asprintf(&p, "%s\n.%s", *bufp, roffit_macro); |
if (-1 == isz) { |
|
perror(NULL); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
free(*bufp); |
free(*bufp); |
*bufp = p; |
*bufp = p; |
*szp = isz + 1; |
*szp = isz + 1; |
Line 793 roff_parse(struct roff *r, const char *buf, int *pos) |
|
Line 794 roff_parse(struct roff *r, const char *buf, int *pos) |
|
'\t' == buf[*pos] || ' ' == buf[*pos]) |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
return(ROFF_MAX); |
return(ROFF_MAX); |
|
|
/* |
/* We stop the macro parse at an escape, tab, space, or nil. */ |
* 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 + 1, " \\\t\0") + 1; |
maclen = strcspn(mac, " \\\t\0"); |
|
|
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); |
Line 869 roffnode_cleanscope(struct roff *r) |
|
Line 866 roffnode_cleanscope(struct roff *r) |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
static void |
static enum rofferr |
roff_ccond(struct roff *r, int ln, int ppos) |
roff_ccond(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->last) { |
if (NULL == r->last) { |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
switch (r->last->tok) { |
switch (r->last->tok) { |
Line 888 roff_ccond(ROFF_ARGS) |
|
Line 884 roff_ccond(ROFF_ARGS) |
|
break; |
break; |
default: |
default: |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
if (r->last->endspan > -1) { |
if (r->last->endspan > -1) { |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
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; |
} |
} |
|
|
|
|
Line 946 roff_block(ROFF_ARGS) |
|
Line 939 roff_block(ROFF_ARGS) |
|
/* |
/* |
* 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 (ROFF_de == tok) |
Line 1036 roff_block_sub(ROFF_ARGS) |
|
Line 1029 roff_block_sub(ROFF_ARGS) |
|
*/ |
*/ |
if (ROFF_cblock != t) { |
if (ROFF_cblock != t) { |
if (ROFF_de == tok) |
if (ROFF_de == tok) |
roff_setstr(r, r->last->name, *bufp + ppos, 1); |
roff_setstr(r, r->last->name, *bufp + ppos, 2); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1052 roff_block_text(ROFF_ARGS) |
|
Line 1045 roff_block_text(ROFF_ARGS) |
|
{ |
{ |
|
|
if (ROFF_de == tok) |
if (ROFF_de == tok) |
roff_setstr(r, r->last->name, *bufp + pos, 1); |
roff_setstr(r, r->last->name, *bufp + pos, 2); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
Line 1063 static enum rofferr |
|
Line 1056 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); |
Line 1076 roff_cond_sub(ROFF_ARGS) |
|
Line 1069 roff_cond_sub(ROFF_ARGS) |
|
*/ |
*/ |
|
|
if ((ROFF_MAX != t) && |
if ((ROFF_MAX != t) && |
(ROFF_ccond == t || ROFFRULE_ALLOW == rr || |
(rr || ROFFMAC_STRUCT & roffs[t].flags)) { |
ROFFMAC_STRUCT & roffs[t].flags)) { |
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc)(r, t, bufp, szp, |
return((*roffs[t].proc)(r, t, bufp, szp, |
ln, ppos, pos, offs)); |
ln, ppos, pos, offs)); |
} |
} |
|
|
/* Always check for the closing delimiter `\}'. */ |
/* |
|
* If `\}' occurs on a macro line without a preceding macro, |
|
* drop the line completely. |
|
*/ |
|
|
ep = &(*bufp)[pos]; |
ep = *bufp + pos; |
while (NULL != (ep = strchr(ep, '\\'))) { |
if ('\\' == ep[0] && '}' == ep[1]) |
if ('}' != *(++ep)) |
rr = 0; |
continue; |
|
|
|
/* |
/* Always check for the closing delimiter `\}'. */ |
* If we're at the end of line, then just chop |
|
* off the \} and resize the buffer. |
|
* If we aren't, then convert it to spaces. |
|
*/ |
|
|
|
if ('\0' == *(ep + 1)) { |
while (NULL != (ep = strchr(ep, '\\'))) { |
*--ep = '\0'; |
if ('}' == *(++ep)) { |
*szp -= 2; |
*ep = '&'; |
} else |
roff_ccond(r, ln, ep - *bufp - 1); |
*(ep - 1) = *ep = ' '; |
} |
|
++ep; |
roff_ccond(r, ROFF_ccond, bufp, szp, |
|
ln, pos, pos + 2, offs); |
|
break; |
|
} |
} |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
return(rr ? ROFF_CONT : ROFF_IGN); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 1114 static enum rofferr |
|
Line 1101 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 = *bufp + pos; |
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
while (NULL != (ep = strchr(ep, '\\'))) { |
ep++; |
if ('}' == *(++ep)) { |
if ('}' != *ep) |
*ep = '&'; |
continue; |
roff_ccond(r, ln, ep - *bufp - 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); |
} |
} |
|
|
|
/* |
|
* 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 |
static int |
roff_getnum(const char *v, int *pos, int *res) |
roff_getnum(const char *v, int *pos, int *res) |
{ |
{ |
Line 1142 roff_getnum(const char *v, int *pos, int *res) |
|
Line 1134 roff_getnum(const char *v, int *pos, int *res) |
|
p++; |
p++; |
|
|
for (*res = 0; isdigit((unsigned char)v[p]); p++) |
for (*res = 0; isdigit((unsigned char)v[p]); p++) |
*res += 10 * *res + v[p] - '0'; |
*res = 10 * *res + v[p] - '0'; |
if (p == *pos + n) |
if (p == *pos + n) |
return 0; |
return 0; |
|
|
Line 1153 roff_getnum(const char *v, int *pos, int *res) |
|
Line 1145 roff_getnum(const char *v, int *pos, int *res) |
|
return 1; |
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 |
static int |
roff_getop(const char *v, int *pos, char *res) |
roff_evalstrcond(const char *v, int *pos) |
{ |
{ |
int e; |
const char *s1, *s2, *s3; |
|
int match; |
|
|
*res = v[*pos]; |
match = 0; |
e = v[*pos + 1] == '='; |
s1 = v + *pos; /* initial delimiter */ |
|
s2 = s1 + 1; /* for scanning the first string */ |
|
s3 = strchr(s2, *s1); /* for scanning the second string */ |
|
|
switch (*res) { |
if (NULL == s3) /* found no middle delimiter */ |
case '=': |
goto out; |
break; |
|
case '>': |
while ('\0' != *++s3) { |
if (e) |
if (*s2 != *s3) { /* mismatch */ |
*res = 'g'; |
s3 = strchr(s3, *s1); |
break; |
break; |
case '<': |
} |
if (e) |
if (*s3 == *s1) { /* found the final delimiter */ |
*res = 'l'; |
match = 1; |
break; |
break; |
default: |
} |
return(0); |
s2++; |
} |
} |
|
|
*pos += 1 + e; |
out: |
|
if (NULL == s3) |
return(*res); |
s3 = strchr(s2, '\0'); |
|
else |
|
s3++; |
|
*pos = s3 - v; |
|
return(match); |
} |
} |
|
|
static enum roffrule |
/* |
|
* Evaluate an optionally negated single character, numerical, |
|
* or string condition. |
|
*/ |
|
static int |
roff_evalcond(const char *v, int *pos) |
roff_evalcond(const char *v, int *pos) |
{ |
{ |
int not, lh, rh; |
int wanttrue, number; |
char op; |
|
|
|
|
if ('!' == v[*pos]) { |
|
wanttrue = 0; |
|
(*pos)++; |
|
} else |
|
wanttrue = 1; |
|
|
switch (v[*pos]) { |
switch (v[*pos]) { |
case ('n'): |
case ('n'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_ALLOW); |
return(wanttrue); |
|
case ('c'): |
|
/* FALLTHROUGH */ |
|
case ('d'): |
|
/* FALLTHROUGH */ |
case ('e'): |
case ('e'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('o'): |
case ('r'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('t'): |
case ('t'): |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_DENY); |
return(!wanttrue); |
case ('!'): |
|
(*pos)++; |
|
not = 1; |
|
break; |
|
default: |
default: |
not = 0; |
|
break; |
break; |
} |
} |
|
|
if (!roff_getnum(v, pos, &lh)) |
if (roff_evalnum(v, pos, &number, 0)) |
return ROFFRULE_DENY; |
return((number > 0) == wanttrue); |
if (!roff_getop(v, pos, &op)) { |
else |
if (lh < 0) |
return(roff_evalstrcond(v, pos) == wanttrue); |
lh = 0; |
|
goto out; |
|
} |
|
if (!roff_getnum(v, pos, &rh)) |
|
return ROFFRULE_DENY; |
|
switch (op) { |
|
case 'g': |
|
lh = lh >= rh; |
|
break; |
|
case 'l': |
|
lh = lh <= rh; |
|
break; |
|
case '=': |
|
lh = lh == rh; |
|
break; |
|
case '>': |
|
lh = lh > rh; |
|
break; |
|
case '<': |
|
lh = lh < rh; |
|
break; |
|
default: |
|
return ROFFRULE_DENY; |
|
} |
|
out: |
|
if (not) |
|
lh = !lh; |
|
return lh ? ROFFRULE_ALLOW : ROFFRULE_DENY; |
|
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 1265 roff_cond(ROFF_ARGS) |
|
Line 1254 roff_cond(ROFF_ARGS) |
|
*/ |
*/ |
|
|
r->last->rule = ROFF_el == tok ? |
r->last->rule = ROFF_el == tok ? |
(r->rstackpos < 0 ? |
(r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : |
ROFFRULE_DENY : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(*bufp, &pos); |
roff_evalcond(*bufp, &pos); |
|
|
/* |
/* |
Line 1280 roff_cond(ROFF_ARGS) |
|
Line 1268 roff_cond(ROFF_ARGS) |
|
r->parse, ln, ppos, NULL); |
r->parse, ln, ppos, NULL); |
return(ROFF_ERR); |
return(ROFF_ERR); |
} |
} |
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. |
Line 1355 roff_ds(ROFF_ARGS) |
|
Line 1341 roff_ds(ROFF_ARGS) |
|
string++; |
string++; |
|
|
/* The rest is the value. */ |
/* The rest is the value. */ |
roff_setstr(r, name, string, 0); |
roff_setstr(r, name, string, ROFF_as == tok); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
/* |
|
* 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) |
|
{ |
|
|
|
*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); |
|
} |
|
|
|
/* |
|
* Evaluate either a parenthesized numeric expression |
|
* or a single signed integer number. |
|
*/ |
|
static int |
|
roff_evalpar(const char *v, int *pos, int *res) |
|
{ |
|
|
|
if ('(' != v[*pos]) |
|
return(roff_getnum(v, pos, res)); |
|
|
|
(*pos)++; |
|
if ( ! roff_evalnum(v, pos, res, 1)) |
|
return(0); |
|
|
|
/* If the trailing parenthesis is missing, ignore the error. */ |
|
if (')' == v[*pos]) |
|
(*pos)++; |
|
|
|
return(1); |
|
} |
|
|
|
/* |
|
* Evaluate a complete numeric expression. |
|
* Proceed left to right, there is no concept of precedence. |
|
*/ |
|
static int |
|
roff_evalnum(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(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(v, pos, &operand2)) |
|
return(0); |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
switch (operator) { |
|
case ('+'): |
|
*res += operand2; |
|
break; |
|
case ('-'): |
|
*res -= operand2; |
|
break; |
|
case ('*'): |
|
*res *= operand2; |
|
break; |
|
case ('/'): |
|
*res /= operand2; |
|
break; |
|
case ('%'): |
|
*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_setreg(struct roff *r, const char *name, int val, char sign) |
roff_setreg(struct roff *r, const char *name, int val, char sign) |
{ |
{ |
Line 1388 roff_setreg(struct roff *r, const char *name, int val, |
|
Line 1562 roff_setreg(struct roff *r, const char *name, int val, |
|
reg->val = val; |
reg->val = val; |
} |
} |
|
|
|
/* |
|
* 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 |
int |
roff_getreg(const struct roff *r, const char *name) |
roff_getreg(const struct roff *r, const char *name) |
{ |
{ |
struct roffreg *reg; |
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) |
for (reg = r->regtab; reg; reg = reg->next) |
if (0 == strcmp(name, reg->key.p)) |
if (0 == strcmp(name, reg->key.p)) |
return(reg->val); |
return(reg->val); |
|
|
roff_getregn(const struct roff *r, const char *name, size_t len) |
roff_getregn(const struct roff *r, const char *name, size_t len) |
{ |
{ |
struct roffreg *reg; |
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) |
for (reg = r->regtab; reg; reg = reg->next) |
if (len == reg->key.sz && |
if (len == reg->key.sz && |
0 == strncmp(name, reg->key.p, len)) |
0 == strncmp(name, reg->key.p, len)) |
Line 1426 roff_freereg(struct roffreg *reg) |
|
Line 1642 roff_freereg(struct roffreg *reg) |
|
} |
} |
} |
} |
|
|
/* 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; |
size_t sz; |
|
int iv; |
int iv; |
char sign; |
char sign; |
|
|
Line 1443 roff_nr(ROFF_ARGS) |
|
Line 1657 roff_nr(ROFF_ARGS) |
|
if ('+' == sign || '-' == sign) |
if ('+' == sign || '-' == sign) |
val++; |
val++; |
|
|
sz = strspn(val, "0123456789"); |
if (roff_evalnum(val, NULL, &iv, 0)) |
iv = sz ? mandoc_strntoi(val, sz, 10) : 0; |
roff_setreg(r, key, iv, sign); |
|
|
roff_setreg(r, key, iv, sign); |
return(ROFF_IGN); |
|
} |
|
|
|
static enum rofferr |
|
roff_rr(ROFF_ARGS) |
|
{ |
|
struct roffreg *reg, **prev; |
|
const char *name; |
|
char *cp; |
|
|
|
cp = *bufp + pos; |
|
name = roff_getname(r, &cp, ln, pos); |
|
|
|
prev = &r->regtab; |
|
while (1) { |
|
reg = *prev; |
|
if (NULL == reg || !strcmp(name, reg->key.p)) |
|
break; |
|
prev = ®->next; |
|
} |
|
if (NULL != reg) { |
|
*prev = reg->next; |
|
free(reg->key.p); |
|
free(reg); |
|
} |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 1498 roff_Dd(ROFF_ARGS) |
|
Line 1735 roff_Dd(ROFF_ARGS) |
|
{ |
{ |
const char *const *cp; |
const char *const *cp; |
|
|
if (MPARSE_MDOC != r->parsetype) |
if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options)) |
for (cp = __mdoc_reserved; *cp; cp++) |
for (cp = __mdoc_reserved; *cp; cp++) |
roff_setstr(r, *cp, NULL, 0); |
roff_setstr(r, *cp, NULL, 0); |
|
|
Line 1511 roff_TH(ROFF_ARGS) |
|
Line 1748 roff_TH(ROFF_ARGS) |
|
{ |
{ |
const char *const *cp; |
const char *const *cp; |
|
|
if (MPARSE_MDOC != r->parsetype) |
if (0 == (MPARSE_QUICK & r->options)) |
for (cp = __man_reserved; *cp; cp++) |
for (cp = __man_reserved; *cp; cp++) |
roff_setstr(r, *cp, NULL, 0); |
roff_setstr(r, *cp, NULL, 0); |
|
|
Line 1813 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
Line 2050 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
|
|
/* |
/* |
* 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; |
Line 1850 roff_setstrn(struct roffkv **r, const char *name, size |
|
Line 2088 roff_setstrn(struct roffkv **r, const char *name, size |
|
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; |
Line 1864 roff_setstrn(struct roffkv **r, const char *name, size |
|
Line 2101 roff_setstrn(struct roffkv **r, const char *name, size |
|
* 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); |
Line 1891 roff_setstrn(struct roffkv **r, const char *name, size |
|
Line 2128 roff_setstrn(struct roffkv **r, const char *name, size |
|
} |
} |
|
|
/* Append terminating bytes. */ |
/* Append terminating bytes. */ |
if (multiline) |
if (1 < append) |
*c++ = '\n'; |
*c++ = '\n'; |
|
|
*c = '\0'; |
*c = '\0'; |
Line 1902 static const char * |
|
Line 2139 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 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); |
} |
} |