mandoc/roff.c - diff

Return to roff.c CVS log

Up to [cvsweb.bsd.lv] / mandoc

Diff for /mandoc/roff.c between version 1.181 and 1.212

version 1.181, 2013/10/05 22:15:03

version 1.212, 2014/06/29 22:14:10

Line 1

/* $Id$ */

* Permission to use, copy, modify, and distribute this software for any

* purpose with or without fee is hereby granted, provided that the above

Line 26

#include <string.h>

#include "mandoc.h"

#include "mandoc_aux.h"

#include "libroff.h"

#include "libmandoc.h"

Line 40 enum rofft {

Line 41 enum rofft {

ROFF_am,

ROFF_ami,

ROFF_am1,

ROFF_as,

ROFF_cc,

ROFF_ce,

ROFF_de,

ROFF_dei,

ROFF_de1,

ROFF_ds,

ROFF_el,

ROFF_fam,

ROFF_hw,

ROFF_hy,

ROFF_ie,

ROFF_if,

Line 57 enum rofft {

Line 62 enum rofft {

ROFF_ns,

ROFF_ps,

ROFF_rm,

ROFF_rr,

ROFF_so,

ROFF_ta,

ROFF_tr,

Line 68 enum rofft {

Line 74 enum rofft {

ROFF_EQ,

ROFF_EN,

ROFF_cblock,

ROFF_ccond,

ROFF_USERDEF,

ROFF_MAX

};

enum roffrule {

ROFFRULE_ALLOW,

ROFFRULE_DENY

};

* An incredibly-simple string buffer.

Line 105 struct roffreg {

};

struct roff {

enum mparset parsetype; /* requested parse type */

struct mparse *parse; /* parse point */

int options; /* parse options */

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 */

int rstackpos; /* position in rstack */

struct roffreg *regtab; /* number registers */

Line 132 struct roffnode {

char *name; /* node name, e.g. macro name */

char *end; /* end-rules: custom token */

int endspan; /* end-rules: next-line or infty */

enum roffrule rule; /* current evaluation rule */

int rule; /* current evaluation rule */

};

#define ROFF_ARGS struct roff *r, /* parse ctx */ \

enum rofft tok, /* tok of macro */ \

char **bufp, /* input buffer */ \

size_t *szp, /* size of input buffer */ \

int ln, /* parse line */ \

int ppos, /* original pos in buffer */ \

Line 175 static enum rofferr roff_block_text(ROFF_ARGS);

static enum rofferr roff_block_sub(ROFF_ARGS);

static enum rofferr roff_cblock(ROFF_ARGS);

static enum rofferr roff_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_text(ROFF_ARGS);

static enum rofferr roff_cond_sub(ROFF_ARGS);

static enum rofferr roff_ds(ROFF_ARGS);

static enum roffrule roff_evalcond(const char *, int *);

static 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_freereg(struct roffreg *);

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 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);

static const char *roff_getstrn(const struct roff *,

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);

Line 196 static void roff_openeqn(struct roff *, const char *

Line 202 static void roff_openeqn(struct roff *, const char *

int, int, const char *);

static enum rofft roff_parse(struct roff *, const char *, int *);

static enum rofferr roff_parsetext(char **, size_t *, 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_rr(ROFF_ARGS);

static void roff_setstr(struct roff *,

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_tr(ROFF_ARGS);

Line 227 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 },

{ "ami", 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 },

{ "ce", roff_line_ignore, NULL, NULL, 0, NULL },

{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL },

{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL },

{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL },

{ "ds", roff_ds, NULL, NULL, 0, NULL },

{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },

{ "fam", roff_line_ignore, NULL, NULL, 0, NULL },

{ "hw", 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 },

{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },

Line 244 static struct roffmac roffs[ROFF_MAX] = {

Line 255 static struct roffmac roffs[ROFF_MAX] = {

{ "ns", roff_line_ignore, NULL, NULL, 0, NULL },

{ "ps", roff_line_ignore, 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 },

{ "ta", roff_line_ignore, NULL, NULL, 0, NULL },

{ "tr", roff_tr, NULL, NULL, 0, NULL },

Line 255 static struct roffmac roffs[ROFF_MAX] = {

Line 267 static struct roffmac roffs[ROFF_MAX] = {

{ "EQ", roff_EQ, NULL, NULL, 0, NULL },

{ "EN", roff_EN, NULL, NULL, 0, NULL },

{ ".", roff_cblock, NULL, NULL, 0, NULL },

{ "\\}", roff_ccond, NULL, NULL, 0, NULL },

{ NULL, roff_userdef, NULL, NULL, 0, NULL },

};

/* 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",

"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",

"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",

"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",

"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",

NULL

};

/* not currently implemented: BT DE DS ME MT PT SY TQ YS */

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

};

Line 302 static const struct predef predefs[PREDEFS_MAX] = {

Line 315 static const struct predef predefs[PREDEFS_MAX] = {

static int roffit_lines; /* number of lines to delay */

static char *roffit_macro; /* nil-terminated macro line */

static void

roffhash_init(void)

{

Line 354 roffhash_find(const char *p, size_t s)

Line 368 roffhash_find(const char *p, size_t s)

return(ROFF_MAX);

}

* Pop the current node off of the stack of roff instructions currently

* pending.

Line 365 roffnode_pop(struct roff *r)

Line 378 roffnode_pop(struct roff *r)

struct roffnode *p;

assert(r->last);

p = r->last;

r->last = r->last->parent;

free(p->name);

Line 373 roffnode_pop(struct roff *r)

Line 386 roffnode_pop(struct roff *r)

free(p);

}

* Push a roff node onto the instruction stack. This must later be

* removed with roffnode_pop().

Line 391 roffnode_push(struct roff *r, enum rofft tok, const ch

Line 403 roffnode_push(struct roff *r, enum rofft tok, const ch

p->parent = r->last;

p->line = line;

p->col = col;

p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY;

p->rule = p->parent ? p->parent->rule : 0;

r->last = p;

}

static void

roff_free1(struct roff *r)

{

Line 441 roff_free1(struct roff *r)

Line 452 roff_free1(struct roff *r)

void

roff_reset(struct roff *r)

{

int i;

roff_free1(r);

r->control = 0;

for (i = 0; i < PREDEFS_MAX; i++)

roff_setstr(r, predefs[i].name, predefs[i].str, 0);

}

void

roff_free(struct roff *r)

{

Line 460 roff_free(struct roff *r)

Line 465 roff_free(struct roff *r)

free(r);

}

struct roff *

roff_alloc(enum mparset type, struct mparse *parse)

roff_alloc(struct mparse *parse, int options)

{

struct roff *r;

int i;

r = mandoc_calloc(1, sizeof(struct roff));

r->parsetype = type;

r->parse = parse;

r->options = options;

r->rstackpos = -1;

roffhash_init();

for (i = 0; i < PREDEFS_MAX; i++)

roff_setstr(r, predefs[i].name, predefs[i].str, 0);

return(r);

}

* In the current line, expand user-defined strings ("\*")

* In the current line, expand escape sequences that tend to get

* and references to number registers ("\n").

* used in numerical expressions and conditional requests.

* Also check the syntax of other escape sequences.

* Also check the syntax of the remaining escape sequences.

static enum rofferr

roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos)

{

char ubuf[12]; /* buffer to print the number */

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 *cp; /* end of the name, e.g. before ']' */

const char *res; /* the string to be substituted */

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 naml; /* actual length of the escape name */

int expand_count; /* to avoid infinite loops */

int npos; /* position in numeric expression */

int irc; /* return code from roff_evalnum() */

char term; /* character terminating the escape */

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)

* The second character must be an asterisk or an n.

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);

for (cp = stesc - 1; cp >= start; cp--)

if ('\\' != *cp)

break;

if (0 == (stesc - cp) % 2) {

stesc = (char *)cp;

continue;

}

/* Decide whether to expand or to check only. */

term = '\0';

cp = stesc + 1;

switch (*cp) {

case ('*'):

case '*':

res = NULL;

break;

case ('n'):

case 'B':

/* FALLTHROUGH */

case 'w':

term = cp[1];

/* FALLTHROUGH */

case 'n':

res = ubuf;

break;

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

Line 539 again:

Line 558 again:

* Save a pointer to the name.

switch (*cp) {

if ('\0' == term) {

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;

break;

default:

maxl = 1;

break;

}

stnam = cp;

Line 560 again:

Line 586 again:

for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) {

if ('\0' == *cp) {

mandoc_msg

mandoc_msg(MANDOCERR_BADESCAPE, r->parse,

(MANDOCERR_BADESCAPE,

ln, (int)(stesc - *bufp), NULL);

r->parse, ln,

break;

(int)(stesc - *bufp), NULL);

return(ROFF_CONT);

}

if (0 == maxl && ']' == *cp)

if (0 == maxl && *cp == term) {

cp++;

break;

}

Line 575 again:

Line 601 again:

* undefined, resume searching for escapes.

if (NULL == res)

switch (stesc[1]) {

case '*':

res = roff_getstrn(r, stnam, naml);

else

break;

snprintf(ubuf, sizeof(ubuf), "%d",

case 'B':

npos = 0;

irc = roff_evalnum(stnam, &npos, NULL, 0);

ubuf[0] = irc && stnam + npos + 1 == cp

? '1' : '0';

ubuf[1] = '\0';

break;

case 'n':

(void)snprintf(ubuf, sizeof(ubuf), "%d",

roff_getregn(r, stnam, naml));

break;

case 'w':

(void)snprintf(ubuf, sizeof(ubuf), "%d",

24 * (int)naml);

break;

}

if (NULL == res) {

mandoc_msg

mandoc_msg(MANDOCERR_BADESCAPE, r->parse,

(MANDOCERR_BADESCAPE, r->parse,

ln, (int)(stesc - *bufp), NULL);

res = "";

}

/* Replace the escape sequence by the string. */

pos = stesc - *bufp;

*stesc = '\0';

*szp = mandoc_asprintf(&nbuf, "%s%s%s",

*bufp, res, cp) + 1;

nsz = *szp + strlen(res) + 1;

/* Prepare for the next replacement. */

nbuf = mandoc_malloc(nsz);

strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1));

start = nbuf + pos;

strlcat(nbuf, res, nsz);

stesc = nbuf + (stesc - *bufp) + strlen(res);

strlcat(nbuf, cp + (maxl ? 0 : 1), nsz);

free(*bufp);

*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);

}

Line 640 roff_parsetext(char **bufp, size_t *szp, int pos, int

Line 670 roff_parsetext(char **bufp, size_t *szp, int pos, int

if ('\\' == *p) {

/* Skip over escapes. */

p++;

esc = mandoc_escape

esc = mandoc_escape((const char **)&p, NULL, NULL);

((const char const **)&p, NULL, NULL);

if (ESCAPE_ERROR == esc)

break;

continue;

Line 658 roff_parsetext(char **bufp, size_t *szp, int pos, int

Line 687 roff_parsetext(char **bufp, size_t *szp, int pos, int

/* Spring the input line trap. */

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);

*bufp = p;

*szp = isz + 1;

Line 676 roff_parsetext(char **bufp, size_t *szp, int pos, int

Line 701 roff_parsetext(char **bufp, size_t *szp, int pos, int

}

enum rofferr

roff_parseln(struct roff *r, int ln, char **bufp,

size_t *szp, int pos, int *offs)

{

enum rofft t;

Line 707 roff_parseln(struct roff *r, int ln, char **bufp,

Line 732 roff_parseln(struct roff *r, int ln, char **bufp,

if (r->last && ! ctl) {

t = r->last->tok;

assert(roffs[t].text);

e = (*roffs[t].text)

e = (*roffs[t].text)(r, t, bufp, szp, ln, pos, pos, offs);

(r, t, bufp, szp, ln, pos, pos, offs);

assert(ROFF_IGN == e || ROFF_CONT == e);

if (ROFF_CONT != e)

return(e);

if (r->eqn)

}

return(eqn_read(&r->eqn, ln, *bufp, pos, offs));

if (r->eqn)

return(eqn_read(&r->eqn, ln, *bufp, ppos, offs));

if ( ! ctl) {

if (r->tbl)

return(tbl_read(r->tbl, ln, *bufp, pos));

return(roff_parsetext(bufp, szp, 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, szp, pos, offs));

} else if (r->eqn)

return(eqn_read(&r->eqn, ln, *bufp, ppos, offs));

* If a scope is open, go to the child handler for that macro,

Line 735 roff_parseln(struct roff *r, int ln, char **bufp,

Line 754 roff_parseln(struct roff *r, int ln, char **bufp,

if (r->last) {

t = r->last->tok;

assert(roffs[t].sub);

return((*roffs[t].sub)

return((*roffs[t].sub)(r, t, bufp, szp,

(r, t, bufp, szp,

ln, ppos, pos, offs));

}

Line 750 roff_parseln(struct roff *r, int ln, char **bufp,

Line 768 roff_parseln(struct roff *r, int ln, char **bufp,

return(ROFF_CONT);

assert(roffs[t].proc);

return((*roffs[t].proc)

return((*roffs[t].proc)(r, t, bufp, szp, ln, ppos, pos, offs));

(r, t, bufp, szp,

ln, ppos, pos, offs));

}

void

roff_endparse(struct roff *r)

{

if (r->last)

mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,

r->last->line, r->last->col, NULL);

if (r->eqn) {

mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,

r->eqn->eqn.ln, r->eqn->eqn.pos, NULL);

eqn_end(&r->eqn);

}

if (r->tbl) {

mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,

r->tbl->line, r->tbl->pos, NULL);

tbl_end(&r->tbl);

}

Line 788 roff_parse(struct roff *r, const char *buf, int *pos)

Line 803 roff_parse(struct roff *r, const char *buf, int *pos)

size_t maclen;

enum rofft t;

if ('\0' == buf[*pos] || '"' == buf[*pos] ||

'\t' == buf[*pos] || ' ' == buf[*pos])

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;

maclen = strcspn(mac + 1, " \\\t\0") + 1;

maclen = strcspn(mac, " \\\t\0");

t = (r->current_string = roff_getstrn(r, mac, maclen))

? ROFF_USERDEF : roffhash_find(mac, maclen);

Line 812 roff_parse(struct roff *r, const char *buf, int *pos)

Line 823 roff_parse(struct roff *r, const char *buf, int *pos)

return(t);

}

/* ARGSUSED */

static enum rofferr

roff_cblock(ROFF_ARGS)

{

Line 828 roff_cblock(ROFF_ARGS)

Line 838 roff_cblock(ROFF_ARGS)

}

switch (r->last->tok) {

case (ROFF_am):

case ROFF_am:

/* FALLTHROUGH */

case (ROFF_ami):

case ROFF_ami:

/* FALLTHROUGH */

case (ROFF_am1):

case ROFF_am1:

/* FALLTHROUGH */

case (ROFF_de):

case ROFF_de:

/* ROFF_de1 is remapped to ROFF_de in roff_block(). */

/* FALLTHROUGH */

case (ROFF_dei):

case ROFF_dei:

/* FALLTHROUGH */

case (ROFF_ig):

case ROFF_ig:

break;

default:

mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);

Line 855 roff_cblock(ROFF_ARGS)

Line 865 roff_cblock(ROFF_ARGS)

}

static void

roffnode_cleanscope(struct roff *r)

{

Line 867 roffnode_cleanscope(struct roff *r)

Line 876 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) {

mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);

return(ROFF_IGN);

return;

}

switch (r->last->tok) {

case (ROFF_el):

case ROFF_el:

/* FALLTHROUGH */

case (ROFF_ie):

case ROFF_ie:

/* FALLTHROUGH */

case (ROFF_if):

case ROFF_if:

break;

default:

mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);

return(ROFF_IGN);

return;

}

if (r->last->endspan > -1) {

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_cleanscope(r);

return(ROFF_IGN);

return;

}

/* ARGSUSED */

static enum rofferr

roff_block(ROFF_ARGS)

{

Line 945 roff_block(ROFF_ARGS)

Line 947 roff_block(ROFF_ARGS)

* At the beginning of a `de' macro, clear the existing string

* with the same name, if there is one. New content will be

* added from roff_block_text() in multiline mode.

* appended from roff_block_text() in multiline mode.

if (ROFF_de == tok)

Line 983 roff_block(ROFF_ARGS)

Line 985 roff_block(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_block_sub(ROFF_ARGS)

{

Line 1005 roff_block_sub(ROFF_ARGS)

if ((*bufp)[i] != r->last->end[j])

break;

if ('\0' == r->last->end[j] &&

('\0' == (*bufp)[i] ||

' ' == (*bufp)[i] ||

'\t' == (*bufp)[i])) {

roffnode_pop(r);

roffnode_cleanscope(r);

Line 1035 roff_block_sub(ROFF_ARGS)

if (ROFF_cblock != t) {

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);

}

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));

}

/* ARGSUSED */

static enum rofferr

roff_block_text(ROFF_ARGS)

{

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);

}

/* ARGSUSED */

static enum rofferr

roff_cond_sub(ROFF_ARGS)

{

enum rofft t;

enum roffrule rr;

char *ep;

int rr;

rr = r->last->rule;

roffnode_cleanscope(r);

Line 1075 roff_cond_sub(ROFF_ARGS)

Line 1070 roff_cond_sub(ROFF_ARGS)

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);

return((*roffs[t].proc)(r, t, bufp, szp,

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 */

static enum rofferr

roff_cond_text(ROFF_ARGS)

{

char *ep;

enum roffrule rr;

int rr;

rr = r->last->rule;

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);

}

static enum roffrule

* 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

s3++;

*pos = s3 - v;

return(match);

}

* Evaluate an optionally negated single character, numerical,

* or string condition.

static int

roff_evalcond(const char *v, int *pos)

{

int wanttrue, number;

if ('!' == v[*pos]) {

wanttrue = 0;

(*pos)++;

} else

wanttrue = 1;

switch (v[*pos]) {

case ('n'):

case 'n':

/* FALLTHROUGH */

case 'o':

(*pos)++;

return(ROFFRULE_ALLOW);

return(wanttrue);

case ('e'):

case 'c':

/* FALLTHROUGH */

case ('o'):

case 'd':

/* FALLTHROUGH */

case ('t'):

case 'e':

/* FALLTHROUGH */

case 'r':

/* FALLTHROUGH */

case 't':

(*pos)++;

return(ROFFRULE_DENY);

return(!wanttrue);

default:

break;

}

while (v[*pos] && ' ' != v[*pos])

if (roff_evalnum(v, pos, &number, 0))

(*pos)++;

return((number > 0) == wanttrue);

return(ROFFRULE_DENY);

else

return(roff_evalstrcond(v, pos) == wanttrue);

}

/* ARGSUSED */

static enum rofferr

roff_line_ignore(ROFF_ARGS)

{

Line 1162 roff_line_ignore(ROFF_ARGS)

Line 1240 roff_line_ignore(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_cond(ROFF_ARGS)

{

roffnode_push(r, tok, NULL, ln, ppos);

* 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.

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);

* An if-else will put the NEGATION of the current evaluated

Line 1189 roff_cond(ROFF_ARGS)

Line 1265 roff_cond(ROFF_ARGS)

if (ROFF_ie == tok) {

if (r->rstackpos == RSTACK_MAX - 1) {

mandoc_msg(MANDOCERR_MEM,

r->parse, ln, ppos, NULL);

return(ROFF_ERR);

}

r->rstack[++r->rstackpos] =

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 (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.

Line 1223 roff_cond(ROFF_ARGS)

Line 1297 roff_cond(ROFF_ARGS)

r->last->endspan = -1;

pos += 2;

goto out;

}

* Anything else following the conditional causes

Line 1241 out:

Line 1315 out:

return(ROFF_RERUN);

}

/* ARGSUSED */

static enum rofferr

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 = *bufp + pos;

name = roff_getname(r, &string, ln, pos);

if ('\0' == *name)

return(ROFF_IGN);

/* Read past initial double-quote. */

namesz = roff_getname(r, &string, ln, pos);

if ('\\' == name[namesz])

return(ROFF_IGN);

/* Read past the initial double-quote, if any. */

if ('"' == *string)

string++;

/* 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);

}

* 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);

* 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(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)++;

if (NULL == res)

continue;

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

roff_setreg(struct roff *r, const char *name, int val)

roff_setreg(struct roff *r, const char *name, int val, char sign)

{

struct roffreg *reg;

Line 1288 roff_setreg(struct roff *r, const char *name, int val)

Line 1560 roff_setreg(struct roff *r, const char *name, int val)

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;

}

reg->val = val;

if ('+' == sign)

reg->val += val;

else if ('-' == sign)

reg->val -= val;

else

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

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);

Line 1311 static int

Line 1624 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))

Line 1333 roff_freereg(struct roffreg *reg)

Line 1653 roff_freereg(struct roffreg *reg)

}

/* ARGSUSED */

static enum rofferr

roff_nr(ROFF_ARGS)

{

const char *key;

char *key, *val;

char *val;

size_t keysz;

int iv;

char sign;

val = *bufp + pos;

key = val = *bufp + pos;

key = roff_getname(r, &val, ln, pos);

if ('\0' == *key)

return(ROFF_IGN);

iv = mandoc_strntoi(val, strlen(val), 10);

keysz = roff_getname(r, &val, ln, pos);

if ('\\' == key[keysz])

return(ROFF_IGN);

key[keysz] = '\0';

roff_setreg(r, key, iv);

sign = *val;

if ('+' == sign || '-' == sign)

val++;

if (roff_evalnum(val, NULL, &iv, 0))

roff_setreg(r, key, iv, sign);

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_rr(ROFF_ARGS)

{

struct roffreg *reg, **prev;

char *name, *cp;

size_t namesz;

name = cp = *bufp + pos;

if ('\0' == *name)

return(ROFF_IGN);

namesz = roff_getname(r, &cp, ln, pos);

name[namesz] = '\0';

prev = &r->regtab;

while (1) {

reg = *prev;

if (NULL == reg || !strcmp(name, reg->key.p))

break;

prev = &reg->next;

}

if (NULL != reg) {

*prev = reg->next;

free(reg->key.p);

free(reg);

}

return(ROFF_IGN);

}

static enum rofferr

roff_rm(ROFF_ARGS)

{

const char *name;

char *cp;

size_t namesz;

cp = *bufp + pos;

while ('\0' != *cp) {

name = roff_getname(r, &cp, ln, (int)(cp - *bufp));

name = cp;

if ('\0' != *name)

namesz = roff_getname(r, &cp, ln, (int)(cp - *bufp));

roff_setstr(r, name, NULL, 0);

roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0);

if ('\\' == name[namesz])

break;

}

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_it(ROFF_ARGS)

{

Line 1381 roff_it(ROFF_ARGS)

Line 1739 roff_it(ROFF_ARGS)

cp[len] = '\0';

if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) {

mandoc_msg(MANDOCERR_NUMERIC, r->parse,

ln, ppos, *bufp + 1);

return(ROFF_IGN);

}

cp += len + 1;

Line 1392 roff_it(ROFF_ARGS)

Line 1750 roff_it(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_Dd(ROFF_ARGS)

{

const char *const *cp;

if (MPARSE_MDOC != r->parsetype)

if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options))

for (cp = __mdoc_reserved; *cp; cp++)

roff_setstr(r, *cp, NULL, 0);

return(ROFF_CONT);

}

/* ARGSUSED */

static enum rofferr

roff_TH(ROFF_ARGS)

{

const char *const *cp;

if (MPARSE_MDOC != r->parsetype)

if (0 == (MPARSE_QUICK & r->options))

for (cp = __man_reserved; *cp; cp++)

roff_setstr(r, *cp, NULL, 0);

return(ROFF_CONT);

}

/* ARGSUSED */

static enum rofferr

roff_TE(ROFF_ARGS)

{

Line 1431 roff_TE(ROFF_ARGS)

Line 1786 roff_TE(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_T_(ROFF_ARGS)

{

Line 1454 roff_closeeqn(struct roff *r)

Line 1808 roff_closeeqn(struct roff *r)

#endif

static void

roff_openeqn(struct roff *r, const char *name, int line,

int offs, const char *buf)

{

struct eqn_node *e;

Line 1476 roff_openeqn(struct roff *r, const char *name, int lin

Line 1830 roff_openeqn(struct roff *r, const char *name, int lin

}

/* ARGSUSED */

static enum rofferr

roff_EQ(ROFF_ARGS)

{

Line 1485 roff_EQ(ROFF_ARGS)

Line 1838 roff_EQ(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_EN(ROFF_ARGS)

{

Line 1494 roff_EN(ROFF_ARGS)

Line 1846 roff_EN(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_TS(ROFF_ARGS)

{

Line 1516 roff_TS(ROFF_ARGS)

Line 1867 roff_TS(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_cc(ROFF_ARGS)

{

Line 1533 roff_cc(ROFF_ARGS)

Line 1883 roff_cc(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_tr(ROFF_ARGS)

{

Line 1555 roff_tr(ROFF_ARGS)

Line 1904 roff_tr(ROFF_ARGS)

if ('\\' == *first) {

esc = mandoc_escape(&p, NULL, NULL);

if (ESCAPE_ERROR == esc) {

mandoc_msg

mandoc_msg(MANDOCERR_BADESCAPE,

(MANDOCERR_BADESCAPE, r->parse,

r->parse, ln,

ln, (int)(p - *bufp), NULL);

(int)(p - *bufp), NULL);

return(ROFF_IGN);

}

fsz = (size_t)(p - first);

Line 1567 roff_tr(ROFF_ARGS)

Line 1916 roff_tr(ROFF_ARGS)

if ('\\' == *second) {

esc = mandoc_escape(&p, NULL, NULL);

if (ESCAPE_ERROR == esc) {

mandoc_msg

mandoc_msg(MANDOCERR_BADESCAPE,

(MANDOCERR_BADESCAPE, r->parse,

r->parse, ln,

ln, (int)(p - *bufp), NULL);

(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,

roff_setstrn(&r->xmbtab, first, fsz,

fsz, second, ssz, 0);

second, ssz, 0);

continue;

}

if (NULL == r->xtab)

r->xtab = mandoc_calloc

r->xtab = mandoc_calloc(128,

(128, sizeof(struct roffstr));

sizeof(struct roffstr));

free(r->xtab[(int)*first].p);

r->xtab[(int)*first].p = mandoc_strndup(second, ssz);

Line 1598 roff_tr(ROFF_ARGS)

Line 1947 roff_tr(ROFF_ARGS)

return(ROFF_IGN);

}

/* ARGSUSED */

static enum rofferr

roff_so(ROFF_ARGS)

{

char *name;

mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL);

name = *bufp + pos;

mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, ".so %s", name);

* Handle `so'. Be EXTREMELY careful, as we shouldn't be

Line 1613 roff_so(ROFF_ARGS)

Line 1962 roff_so(ROFF_ARGS)

* or using absolute paths.

name = *bufp + pos;

if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) {

mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL);

mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos,

".so %s", name);

return(ROFF_ERR);

}

Line 1623 roff_so(ROFF_ARGS)

Line 1972 roff_so(ROFF_ARGS)

return(ROFF_SO);

}

/* ARGSUSED */

static enum rofferr

roff_userdef(ROFF_ARGS)

{

Line 1633 roff_userdef(ROFF_ARGS)

Line 1981 roff_userdef(ROFF_ARGS)

* Collect pointers to macro argument strings

* and null-terminate them.

* and NUL-terminate them.

cp = *bufp + pos;

for (i = 0; i < 9; i++)

Line 1652 roff_userdef(ROFF_ARGS)

Line 2000 roff_userdef(ROFF_ARGS)

cp += 2;

continue;

}

*cp = '\0';

*szp = strlen(n1) - 3 + strlen(arg[i]) + 1;

*szp = 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);

free(n1);

n1 = n2;

Line 1678 roff_userdef(ROFF_ARGS)

Line 2021 roff_userdef(ROFF_ARGS)

ROFF_REPARSE : ROFF_APPEND);

}

static char *

static size_t

roff_getname(struct roff *r, char **cpp, int ln, int pos)

{

char *name, *cp;

size_t namesz;

name = *cpp;

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)

continue;

cp++;

if ('\\' == *cp)

continue;

namesz = cp - name - 1;

mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL);

*cp = '\0';

mandoc_escape((const char **)&cp, NULL, NULL);

name = cp;

break;

}

/* Nil-terminate name. */

if ('\0' != *cp)

*(cp++) = '\0';

/* Read past spaces. */

while (' ' == *cp)

cp++;

*cpp = cp;

return(name);

return(namesz);

}

* 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).

* append == 0: replace mode

* append == 1: single-line append mode

* append == 2: multiline append mode, append '\n' after each call

static void

roff_setstr(struct roff *r, const char *name, const char *string,

int multiline)

int append)

{

roff_setstrn(&r->strtab, name, strlen(name), string,

string ? strlen(string) : 0, multiline);

string ? strlen(string) : 0, append);

}

static void

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;

char *c;

Line 1738 roff_setstrn(struct roffkv **r, const char *name, size

Line 2084 roff_setstrn(struct roffkv **r, const char *name, size

/* Search for an existing string with the same name. */

n = *r;

while (n && strcmp(name, n->key.p))

while (n && (namesz != n->key.sz ||

strncmp(n->key.p, name, namesz)))

n = n->next;

if (NULL == n) {

Line 1750 roff_setstrn(struct roffkv **r, const char *name, size

Line 2097 roff_setstrn(struct roffkv **r, const char *name, size

n->val.sz = 0;

n->next = *r;

*r = n;

} else if (0 == multiline) {

} else if (0 == append) {

/* In multiline mode, append; else replace. */

free(n->val.p);

n->val.p = NULL;

n->val.sz = 0;

Line 1764 roff_setstrn(struct roffkv **r, const char *name, size

Line 2110 roff_setstrn(struct roffkv **r, const char *name, size

* One additional byte for the '\n' in multiline mode,

* and one for the terminating '\0'.

newch = stringsz + (multiline ? 2u : 1u);

newch = stringsz + (1 < append ? 2u : 1u);

if (NULL == n->val.p) {

n->val.p = mandoc_malloc(newch);

Line 1791 roff_setstrn(struct roffkv **r, const char *name, size

Line 2137 roff_setstrn(struct roffkv **r, const char *name, size

}

/* Append terminating bytes. */

if (multiline)

if (1 < append)

*c++ = '\n';

*c = '\0';

Line 1802 static const char *

Line 2148 static const char *

roff_getstrn(const struct roff *r, const char *name, size_t len)

{

const struct roffkv *n;

int i;

for (n = r->strtab; n; n = n->next)

if (0 == strncmp(name, n->key.p, len) &&

'\0' == n->key.p[(int)len])

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);

}

Line 1827 roff_freestr(struct roffkv *r)

Line 2179 roff_freestr(struct roffkv *r)

const struct tbl_span *

roff_span(const struct roff *r)

{

return(r->tbl ? tbl_span(r->tbl) : NULL);

}

const struct eqn *

roff_eqn(const struct roff *r)

{

return(r->last_eqn ? &r->last_eqn->eqn : NULL);

}

Line 1893 roff_strdup(const struct roff *r, const char *p)

Line 2245 roff_strdup(const struct roff *r, const char *p)

* Append the match to the array and move

* 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);

ssz += cp->val.sz;

p += (int)cp->key.sz;

Line 1915 roff_strdup(const struct roff *r, const char *p)

Line 2267 roff_strdup(const struct roff *r, const char *p)

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.

Line 1931 roff_strdup(const struct roff *r, const char *p)

Line 2283 roff_strdup(const struct roff *r, const char *p)

}

* 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,

* return zero and don't change the current position.

* If the control character has been set with `.cc', then let that grain

CVSweb