version 1.63, 2008/12/10 16:03:12 |
version 1.200, 2014/03/20 02:57:28 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* 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 |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
#include <sys/param.h> |
#ifdef HAVE_CONFIG_H |
#include <sys/types.h> |
#include "config.h" |
|
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
|
#include <stdarg.h> |
|
#include <stdlib.h> |
|
#include <stdio.h> |
#include <stdio.h> |
|
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <time.h> |
|
|
|
#include "private.h" |
#include "mandoc.h" |
#include "roff.h" |
#include "libroff.h" |
|
#include "libmandoc.h" |
|
|
/* FIXME: First letters of quoted-text interpreted in rofffindtok. */ |
/* Maximum number of nested if-else conditionals. */ |
/* FIXME: `No' not implemented. */ |
#define RSTACK_MAX 128 |
/* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
|
/* TODO: warn about empty lists. */ |
|
/* TODO: (warn) some sections need specific elements. */ |
|
/* TODO: (warn) NAME section has particular order. */ |
|
/* TODO: macros with a set number of arguments? */ |
|
/* FIXME: Bl -diag supposed to ignore callable children. */ |
|
|
|
struct roffnode { |
/* Maximum number of string expansions per line, to break infinite loops. */ |
int tok; /* Token id. */ |
#define EXPAND_LIMIT 1000 |
struct roffnode *parent; /* Parent (or NULL). */ |
|
|
enum rofft { |
|
ROFF_ad, |
|
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, |
|
ROFF_ig, |
|
ROFF_it, |
|
ROFF_ne, |
|
ROFF_nh, |
|
ROFF_nr, |
|
ROFF_ns, |
|
ROFF_ps, |
|
ROFF_rm, |
|
ROFF_so, |
|
ROFF_ta, |
|
ROFF_tr, |
|
ROFF_Dd, |
|
ROFF_TH, |
|
ROFF_TS, |
|
ROFF_TE, |
|
ROFF_T_, |
|
ROFF_EQ, |
|
ROFF_EN, |
|
ROFF_cblock, |
|
ROFF_USERDEF, |
|
ROFF_MAX |
}; |
}; |
|
|
enum rofferr { |
/* |
ERR_ARGEQ1, /* Macro requires arg == 1. */ |
* An incredibly-simple string buffer. |
ERR_ARGEQ0, /* Macro requires arg == 0. */ |
*/ |
ERR_ARGGE1, /* Macro requires arg >= 1. */ |
struct roffstr { |
ERR_ARGGE2, /* Macro requires arg >= 2. */ |
char *p; /* nil-terminated buffer */ |
ERR_ARGLEN, /* Macro argument too long. */ |
size_t sz; /* saved strlen(p) */ |
ERR_BADARG, /* Macro has bad arg. */ |
|
ERR_ARGMNY, /* Too many macro arguments. */ |
|
ERR_NOTSUP, /* Macro not supported. */ |
|
ERR_DEPREC, /* Macro deprecated. */ |
|
ERR_PR_OOO, /* Prelude macro bad order. */ |
|
ERR_PR_REP, /* Prelude macro repeated. */ |
|
ERR_NOT_PR, /* Not allowed in prelude. */ |
|
WRN_SECORD /* Sections out-of-order. */ |
|
}; |
}; |
|
|
struct rofftree { |
/* |
struct roffnode *last; /* Last parsed node. */ |
* A key-value roffstr pair as part of a singly-linked list. |
char *cur; /* Line start. */ |
*/ |
struct tm tm; /* `Dd' results. */ |
struct roffkv { |
char name[64]; /* `Nm' results. */ |
struct roffstr key; |
char os[64]; /* `Os' results. */ |
struct roffstr val; |
char title[64]; /* `Dt' results. */ |
struct roffkv *next; /* next in list */ |
enum roffmsec section; |
|
enum roffvol volume; |
|
struct roffcb cb; /* Callbacks. */ |
|
void *arg; /* Callbacks' arg. */ |
|
int csec; /* Current section. */ |
|
int asec; /* Thus-far sections. */ |
|
}; |
}; |
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
/* |
static void roffnode_free(struct rofftree *); |
* A single number register as part of a singly-linked list. |
static int roff_warn(const struct rofftree *, |
*/ |
const char *, char *, ...); |
struct roffreg { |
static int roff_warnp(const struct rofftree *, |
struct roffstr key; |
const char *, int, enum rofferr); |
int val; |
static int roff_err(const struct rofftree *, |
struct roffreg *next; |
const char *, char *, ...); |
}; |
static int roff_errp(const struct rofftree *, |
|
const char *, int, enum rofferr); |
|
static int roffpurgepunct(struct rofftree *, char **); |
|
static int roffscan(int, const int *); |
|
static int rofffindtok(const char *); |
|
static int rofffindarg(const char *); |
|
static int rofffindcallable(const char *); |
|
static int roffispunct(const char *); |
|
static int roffchecksec(struct rofftree *, |
|
const char *, int, int); |
|
static int roffargs(const struct rofftree *, |
|
int, char *, char **); |
|
static int roffargok(int, int); |
|
static int roffnextopt(const struct rofftree *, |
|
int, char ***, char **); |
|
static int roffparseopts(struct rofftree *, int, |
|
char ***, int *, char **); |
|
static int roffcall(struct rofftree *, int, char **); |
|
static int roffexit(struct rofftree *, int); |
|
static int roffparse(struct rofftree *, char *); |
|
static int textparse(struct rofftree *, char *); |
|
static int roffdata(struct rofftree *, int, char *); |
|
static int roffspecial(struct rofftree *, int, |
|
const char *, const int *, |
|
const char **, size_t, char **); |
|
static int roffsetname(struct rofftree *, char **); |
|
|
|
#ifdef __linux__ |
struct roff { |
extern size_t strlcat(char *, const char *, size_t); |
struct mparse *parse; /* parse point */ |
extern size_t strlcpy(char *, const char *, size_t); |
int options; /* parse options */ |
extern int vsnprintf(char *, size_t, |
struct roffnode *last; /* leaf of stack */ |
const char *, va_list); |
int rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
extern char *strptime(const char *, const char *, |
char control; /* control character */ |
struct tm *); |
int rstackpos; /* position in rstack */ |
#endif |
struct roffreg *regtab; /* number registers */ |
|
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 */ |
|
struct tbl_node *first_tbl; /* first table parsed */ |
|
struct tbl_node *last_tbl; /* last table parsed */ |
|
struct tbl_node *tbl; /* current table being parsed */ |
|
struct eqn_node *last_eqn; /* last equation parsed */ |
|
struct eqn_node *first_eqn; /* first equation parsed */ |
|
struct eqn_node *eqn; /* current equation being parsed */ |
|
}; |
|
|
int |
struct roffnode { |
roff_free(struct rofftree *tree, int flush) |
enum rofft tok; /* type of node */ |
{ |
struct roffnode *parent; /* up one in stack */ |
int error, t; |
int line; /* parse line */ |
struct roffnode *n; |
int col; /* parse col */ |
|
char *name; /* node name, e.g. macro name */ |
|
char *end; /* end-rules: custom token */ |
|
int endspan; /* end-rules: next-line or infty */ |
|
int rule; /* current evaluation rule */ |
|
}; |
|
|
error = 0; |
#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 */ \ |
|
int pos, /* current pos in buffer */ \ |
|
int *offs /* reset offset of buffer data */ |
|
|
if ( ! flush) |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
goto end; |
|
|
|
error = 1; |
struct roffmac { |
|
const char *name; /* macro name */ |
|
roffproc proc; /* process new macro */ |
|
roffproc text; /* process as child text of macro */ |
|
roffproc sub; /* process as child of macro */ |
|
int flags; |
|
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
|
struct roffmac *next; |
|
}; |
|
|
if ( ! (ROFFSec_NAME & tree->asec)) { |
struct predef { |
(void)roff_err(tree, NULL, "missing `NAME' section"); |
const char *name; /* predefined input name */ |
goto end; |
const char *str; /* replacement symbol */ |
} else if ( ! (ROFFSec_NMASK & tree->asec)) |
}; |
(void)roff_warn(tree, NULL, "missing suggested `NAME', " |
|
"`SYNOPSIS', `DESCRIPTION' sections"); |
|
|
|
for (n = tree->last; n; n = n->parent) { |
#define PREDEF(__name, __str) \ |
if (0 != tokens[n->tok].ctx) |
{ (__name), (__str) }, |
continue; |
|
(void)roff_err(tree, NULL, "closing explicit scope " |
|
"`%s'", toknames[n->tok]); |
|
goto end; |
|
} |
|
|
|
while (tree->last) { |
static enum rofft roffhash_find(const char *, size_t); |
t = tree->last->tok; |
static void roffhash_init(void); |
if ( ! roffexit(tree, t)) |
static void roffnode_cleanscope(struct roff *); |
goto end; |
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_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 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 int roff_evalcond(const char *, 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 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 int roff_getregro(const char *name); |
|
static const char *roff_getstrn(const struct roff *, |
|
const char *, size_t); |
|
static enum rofferr roff_it(ROFF_ARGS); |
|
static enum rofferr roff_line_ignore(ROFF_ARGS); |
|
static enum rofferr roff_nr(ROFF_ARGS); |
|
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 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); |
|
static enum rofferr roff_Dd(ROFF_ARGS); |
|
static enum rofferr roff_TH(ROFF_ARGS); |
|
static enum rofferr roff_TE(ROFF_ARGS); |
|
static enum rofferr roff_TS(ROFF_ARGS); |
|
static enum rofferr roff_EQ(ROFF_ARGS); |
|
static enum rofferr roff_EN(ROFF_ARGS); |
|
static enum rofferr roff_T_(ROFF_ARGS); |
|
static enum rofferr roff_userdef(ROFF_ARGS); |
|
|
if ( ! (*tree->cb.rofftail)(tree->arg, &tree->tm, |
/* See roffhash_find() */ |
tree->os, tree->title, |
|
tree->section, tree->volume)) |
|
goto end; |
|
|
|
error = 0; |
#define ASCII_HI 126 |
|
#define ASCII_LO 33 |
|
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
|
|
end: |
static struct roffmac *hash[HASHWIDTH]; |
|
|
while (tree->last) |
static struct roffmac roffs[ROFF_MAX] = { |
roffnode_free(tree); |
{ "ad", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "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 }, |
|
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "it", roff_it, NULL, NULL, 0, NULL }, |
|
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
|
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
|
{ "so", roff_so, NULL, NULL, 0, NULL }, |
|
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "tr", roff_tr, NULL, NULL, 0, NULL }, |
|
{ "Dd", roff_Dd, NULL, NULL, 0, NULL }, |
|
{ "TH", roff_TH, NULL, NULL, 0, NULL }, |
|
{ "TS", roff_TS, NULL, NULL, 0, NULL }, |
|
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
|
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
|
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
|
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
|
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
|
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
|
}; |
|
|
free(tree); |
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ |
|
const char *const __mdoc_reserved[] = { |
|
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
|
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
|
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
|
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
|
"Dt", "Dv", "Dx", "D1", |
|
"Ec", "Ed", "Ef", "Ek", "El", "Em", |
|
"En", "Eo", "Er", "Es", "Ev", "Ex", |
|
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
|
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", |
|
"Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
|
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
|
"Pa", "Pc", "Pf", "Po", "Pp", "Pq", |
|
"Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv", |
|
"Sc", "Sh", "Sm", "So", "Sq", |
|
"Ss", "St", "Sx", "Sy", |
|
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
|
"%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O", |
|
"%P", "%Q", "%R", "%T", "%U", "%V", |
|
NULL |
|
}; |
|
|
return(error ? 0 : 1); |
/* not currently implemented: BT DE DS ME MT PT SY TQ YS */ |
} |
const char *const __man_reserved[] = { |
|
"AT", "B", "BI", "BR", "DT", |
|
"EE", "EN", "EQ", "EX", "HP", "I", "IB", "IP", "IR", |
|
"LP", "OP", "P", "PD", "PP", |
|
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", |
|
"TE", "TH", "TP", "TS", "T&", "UC", "UE", "UR", |
|
NULL |
|
}; |
|
|
|
/* Array of injected predefined strings. */ |
|
#define PREDEFS_MAX 38 |
|
static const struct predef predefs[PREDEFS_MAX] = { |
|
#include "predefs.in" |
|
}; |
|
|
struct rofftree * |
/* See roffhash_find() */ |
roff_alloc(const struct roffcb *cb, void *args) |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
{ |
|
struct rofftree *tree; |
|
|
|
assert(args); |
static int roffit_lines; /* number of lines to delay */ |
assert(cb); |
static char *roffit_macro; /* nil-terminated macro line */ |
|
|
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
static void |
err(1, "calloc"); |
roffhash_init(void) |
|
{ |
|
struct roffmac *n; |
|
int buc, i; |
|
|
tree->arg = args; |
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
tree->section = ROFF_MSEC_MAX; |
assert(roffs[i].name[0] >= ASCII_LO); |
|
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
(void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
buc = ROFF_HASH(roffs[i].name); |
|
|
return(tree); |
if (NULL != (n = hash[buc])) { |
|
for ( ; n->next; n = n->next) |
|
/* Do nothing. */ ; |
|
n->next = &roffs[i]; |
|
} else |
|
hash[buc] = &roffs[i]; |
|
} |
} |
} |
|
|
|
/* |
int |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
roff_engine(struct rofftree *tree, char *buf) |
* the nil-terminated string name could be found. |
|
*/ |
|
static enum rofft |
|
roffhash_find(const char *p, size_t s) |
{ |
{ |
|
int buc; |
|
struct roffmac *n; |
|
|
tree->cur = buf; |
/* |
assert(buf); |
* libroff has an extremely simple hashtable, for the time |
|
* being, which simply keys on the first character, which must |
|
* be printable, then walks a chain. It works well enough until |
|
* optimised. |
|
*/ |
|
|
if (0 == *buf) |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
return(roff_err(tree, buf, "blank line")); |
return(ROFF_MAX); |
else if ('.' != *buf) |
|
return(textparse(tree, buf)); |
|
|
|
return(roffparse(tree, buf)); |
buc = ROFF_HASH(p); |
|
|
|
if (NULL == (n = hash[buc])) |
|
return(ROFF_MAX); |
|
for ( ; n; n = n->next) |
|
if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s]) |
|
return((enum rofft)(n - roffs)); |
|
|
|
return(ROFF_MAX); |
} |
} |
|
|
|
|
static int |
/* |
textparse(struct rofftree *tree, char *buf) |
* Pop the current node off of the stack of roff instructions currently |
|
* pending. |
|
*/ |
|
static void |
|
roffnode_pop(struct roff *r) |
{ |
{ |
char *bufp; |
struct roffnode *p; |
|
|
/* TODO: literal parsing. */ |
assert(r->last); |
|
p = r->last; |
|
|
if ( ! (ROFFSec_NAME & tree->asec)) |
r->last = r->last->parent; |
return(roff_err(tree, buf, "data before `NAME' section")); |
free(p->name); |
|
free(p->end); |
|
free(p); |
|
} |
|
|
/* LINTED */ |
|
while (*buf) { |
|
while (*buf && isspace(*buf)) |
|
buf++; |
|
|
|
if (0 == *buf) |
/* |
break; |
* Push a roff node onto the instruction stack. This must later be |
|
* removed with roffnode_pop(). |
|
*/ |
|
static void |
|
roffnode_push(struct roff *r, enum rofft tok, const char *name, |
|
int line, int col) |
|
{ |
|
struct roffnode *p; |
|
|
bufp = buf++; |
p = mandoc_calloc(1, sizeof(struct roffnode)); |
|
p->tok = tok; |
|
if (name) |
|
p->name = mandoc_strdup(name); |
|
p->parent = r->last; |
|
p->line = line; |
|
p->col = col; |
|
p->rule = p->parent ? p->parent->rule : 0; |
|
|
while (*buf && ! isspace(*buf)) |
r->last = p; |
buf++; |
|
|
|
if (0 != *buf) { |
|
*buf++ = 0; |
|
if ( ! roffdata(tree, 1, bufp)) |
|
return(0); |
|
continue; |
|
} |
|
|
|
if ( ! roffdata(tree, 1, bufp)) |
|
return(0); |
|
break; |
|
} |
|
|
|
return(1); |
|
} |
} |
|
|
|
|
static int |
static void |
roffargs(const struct rofftree *tree, |
roff_free1(struct roff *r) |
int tok, char *buf, char **argv) |
|
{ |
{ |
|
struct tbl_node *tbl; |
|
struct eqn_node *e; |
int i; |
int i; |
char *p; |
|
|
|
assert(tok >= 0 && tok < ROFF_MAX); |
while (NULL != (tbl = r->first_tbl)) { |
assert('.' == *buf); |
r->first_tbl = tbl->next; |
|
tbl_free(tbl); |
|
} |
|
|
p = buf; |
r->first_tbl = r->last_tbl = r->tbl = NULL; |
|
|
/* |
while (NULL != (e = r->first_eqn)) { |
* This is an ugly little loop. It parses a line into |
r->first_eqn = e->next; |
* space-delimited tokens. If a quote mark is encountered, a |
eqn_free(e); |
* token is alloted the entire quoted text. If whitespace is |
|
* escaped, it's included in the prior alloted token. |
|
*/ |
|
|
|
/* LINTED */ |
|
for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) { |
|
if ('\"' == *buf) { |
|
argv[i] = ++buf; |
|
while (*buf && '\"' != *buf) |
|
buf++; |
|
if (0 == *buf) |
|
return(roff_err(tree, argv[i], |
|
"unclosed quote in arg list")); |
|
} else { |
|
argv[i] = buf++; |
|
while (*buf) { |
|
if ( ! isspace(*buf)) { |
|
buf++; |
|
continue; |
|
} |
|
if (*(buf - 1) == '\\') { |
|
buf++; |
|
continue; |
|
} |
|
break; |
|
} |
|
if (0 == *buf) |
|
continue; |
|
} |
|
*buf++ = 0; |
|
while (*buf && isspace(*buf)) |
|
buf++; |
|
} |
} |
|
|
assert(i > 0); |
r->first_eqn = r->last_eqn = r->eqn = NULL; |
if (ROFF_MAXLINEARG == i && *buf) |
|
return(roff_err(tree, p, "too many args")); |
|
|
|
argv[i] = NULL; |
while (r->last) |
return(1); |
roffnode_pop(r); |
} |
|
|
|
|
roff_freestr(r->strtab); |
|
roff_freestr(r->xmbtab); |
|
|
static int |
r->strtab = r->xmbtab = NULL; |
roffscan(int tok, const int *tokv) |
|
{ |
|
|
|
if (NULL == tokv) |
roff_freereg(r->regtab); |
return(1); |
|
|
|
for ( ; ROFF_MAX != *tokv; tokv++) |
r->regtab = NULL; |
if (tok == *tokv) |
|
return(1); |
|
|
|
return(0); |
if (r->xtab) |
|
for (i = 0; i < 128; i++) |
|
free(r->xtab[i].p); |
|
|
|
free(r->xtab); |
|
r->xtab = NULL; |
} |
} |
|
|
|
void |
|
roff_reset(struct roff *r) |
|
{ |
|
|
static int |
roff_free1(r); |
roffparse(struct rofftree *tree, char *buf) |
r->control = 0; |
|
} |
|
|
|
|
|
void |
|
roff_free(struct roff *r) |
{ |
{ |
int tok, t; |
|
struct roffnode *n; |
|
char *argv[ROFF_MAXLINEARG]; |
|
char **argvp; |
|
|
|
if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2)) |
roff_free1(r); |
if (0 == strncmp(buf, ".\\\"", 3)) |
free(r); |
return(1); |
} |
|
|
if (ROFF_MAX == (tok = rofffindtok(buf + 1))) |
|
return(roff_err(tree, buf, "bogus line macro")); |
|
else if ( ! roffargs(tree, tok, buf, argv)) |
|
return(0); |
|
|
|
argvp = (char **)argv; |
struct roff * |
|
roff_alloc(struct mparse *parse, int options) |
|
{ |
|
struct roff *r; |
|
|
/* |
r = mandoc_calloc(1, sizeof(struct roff)); |
* Prelude macros break some assumptions, so branch now. |
r->parse = parse; |
*/ |
r->options = options; |
|
r->rstackpos = -1; |
|
|
if ( ! (ROFFSec_PR_Dd & tree->asec)) { |
roffhash_init(); |
assert(NULL == tree->last); |
|
return(roffcall(tree, tok, argvp)); |
|
} |
|
|
|
/* |
return(r); |
* First check that our possible parents and parent's possible |
} |
* children are satisfied. |
|
*/ |
|
|
|
if (tree->last && ! roffscan |
/* |
(tree->last->tok, tokens[tok].parents)) |
* In the current line, expand user-defined strings ("\*") |
return(roff_err(tree, *argvp, "`%s' has invalid " |
* and references to number registers ("\n"). |
"parent `%s'", toknames[tok], |
* Also check the syntax of other escape sequences. |
toknames[tree->last->tok])); |
*/ |
|
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 */ |
|
const char *stesc; /* start of an escape sequence ('\\') */ |
|
const char *stnam; /* start of the name, after "[(*" */ |
|
const char *cp; /* end of the name, e.g. before ']' */ |
|
const char *res; /* the string to be substituted */ |
|
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 */ |
|
|
if (tree->last && ! roffscan |
expand_count = 0; |
(tok, tokens[tree->last->tok].children)) |
|
return(roff_err(tree, *argvp, "`%s' has invalid " |
|
"child `%s'", toknames[tok], |
|
toknames[tree->last->tok])); |
|
|
|
/* |
again: |
* Branch if we're not a layout token. |
cp = *bufp + pos; |
*/ |
while (NULL != (cp = strchr(cp, '\\'))) { |
|
stesc = cp++; |
|
|
if (ROFF_LAYOUT != tokens[tok].type) |
/* |
return(roffcall(tree, tok, argvp)); |
* The second character must be an asterisk or an n. |
if (0 == tokens[tok].ctx) |
* If it isn't, skip it anyway: It is escaped, |
return(roffcall(tree, tok, argvp)); |
* so it can't start another escape sequence. |
|
*/ |
|
|
/* |
if ('\0' == *cp) |
* First consider implicit-end tags, like as follows: |
return(ROFF_CONT); |
* .Sh SECTION 1 |
|
* .Sh SECTION 2 |
|
* In this, we want to close the scope of the NAME section. If |
|
* there's an intermediary implicit-end tag, such as |
|
* .Sh SECTION 1 |
|
* .Ss Subsection 1 |
|
* .Sh SECTION 2 |
|
* then it must be closed as well. |
|
*/ |
|
|
|
if (tok == tokens[tok].ctx) { |
switch (*cp) { |
/* |
case ('*'): |
* First search up to the point where we must close. |
res = NULL; |
* If one doesn't exist, then we can open a new scope. |
break; |
|
case ('n'): |
|
res = ubuf; |
|
break; |
|
default: |
|
if (ESCAPE_ERROR != mandoc_escape(&cp, NULL, NULL)) |
|
continue; |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
|
return(ROFF_CONT); |
|
} |
|
|
|
cp++; |
|
|
|
/* |
|
* The third character decides the length |
|
* of the name of the string or register. |
|
* Save a pointer to the name. |
*/ |
*/ |
|
|
for (n = tree->last; n; n = n->parent) { |
switch (*cp) { |
assert(0 == tokens[n->tok].ctx || |
case ('\0'): |
n->tok == tokens[n->tok].ctx); |
return(ROFF_CONT); |
if (n->tok == tok) |
case ('('): |
break; |
cp++; |
if (ROFF_SHALLOW & tokens[tok].flags) { |
maxl = 2; |
n = NULL; |
break; |
break; |
case ('['): |
|
cp++; |
|
maxl = 0; |
|
break; |
|
default: |
|
maxl = 1; |
|
break; |
|
} |
|
stnam = cp; |
|
|
|
/* Advance to the end of the name. */ |
|
|
|
for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) { |
|
if ('\0' == *cp) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, |
|
r->parse, ln, |
|
(int)(stesc - *bufp), NULL); |
|
return(ROFF_CONT); |
} |
} |
if (tokens[n->tok].ctx == n->tok) |
if (0 == maxl && ']' == *cp) |
continue; |
break; |
return(roff_err(tree, *argv, "`%s' breaks " |
|
"scope of prior`%s'", |
|
toknames[tok], |
|
toknames[n->tok])); |
|
} |
} |
|
|
/* |
/* |
* Create a new scope, as no previous one exists to |
* Retrieve the replacement string; if it is |
* close out. |
* undefined, resume searching for escapes. |
*/ |
*/ |
|
|
if (NULL == n) |
if (NULL == res) |
return(roffcall(tree, tok, argvp)); |
res = roff_getstrn(r, stnam, naml); |
|
else |
|
snprintf(ubuf, sizeof(ubuf), "%d", |
|
roff_getregn(r, stnam, naml)); |
|
|
/* |
if (NULL == res) { |
* Close out all intermediary scoped blocks, then hang |
mandoc_msg |
* the current scope from our predecessor's parent. |
(MANDOCERR_BADESCAPE, r->parse, |
*/ |
ln, (int)(stesc - *bufp), NULL); |
|
res = ""; |
|
} |
|
|
do { |
/* Replace the escape sequence by the string. */ |
t = tree->last->tok; |
|
if ( ! roffexit(tree, t)) |
|
return(0); |
|
} while (t != tok); |
|
|
|
return(roffcall(tree, tok, argvp)); |
pos = stesc - *bufp; |
|
|
|
nsz = *szp + strlen(res) + 1; |
|
nbuf = mandoc_malloc(nsz); |
|
|
|
strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1)); |
|
strlcat(nbuf, res, nsz); |
|
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); |
|
} |
|
|
/* |
/* |
* Now consider explicit-end tags, where we want to close back |
* Process text streams: |
* to a specific tag. Example: |
* Convert all breakable hyphens into ASCII_HYPH. |
* .Bl |
* Decrement and spring input line trap. |
* .It Item. |
*/ |
* .El |
static enum rofferr |
* In this, the `El' tag closes out the scope of `Bl'. |
roff_parsetext(char **bufp, size_t *szp, int pos, int *offs) |
*/ |
{ |
|
size_t sz; |
|
const char *start; |
|
char *p; |
|
int isz; |
|
enum mandoc_esc esc; |
|
|
assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
start = p = *bufp + pos; |
|
|
/* LINTED */ |
while ('\0' != *p) { |
for (n = tree->last; n; n = n->parent) |
sz = strcspn(p, "-\\"); |
if (n->tok != tokens[tok].ctx) { |
p += sz; |
if (n->tok == tokens[n->tok].ctx) |
|
continue; |
if ('\0' == *p) |
return(roff_err(tree, *argv, "`%s' breaks " |
|
"scope of prior `%s'", |
|
toknames[tok], |
|
toknames[n->tok])); |
|
} else |
|
break; |
break; |
|
|
if (NULL == n) |
if ('\\' == *p) { |
return(roff_err(tree, *argv, "`%s' has no starting " |
/* Skip over escapes. */ |
"tag `%s'", toknames[tok], |
p++; |
toknames[tokens[tok].ctx])); |
esc = mandoc_escape((const char **)&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) |
|
break; |
|
continue; |
|
} else if (p == start) { |
|
p++; |
|
continue; |
|
} |
|
|
/* LINTED */ |
if (isalpha((unsigned char)p[-1]) && |
do { |
isalpha((unsigned char)p[1])) |
t = tree->last->tok; |
*p = ASCII_HYPH; |
if ( ! roffexit(tree, t)) |
p++; |
return(0); |
} |
} while (t != tokens[tok].ctx); |
|
|
|
return(1); |
/* Spring the input line trap. */ |
|
if (1 == roffit_lines) { |
|
isz = asprintf(&p, "%s\n.%s", *bufp, roffit_macro); |
|
if (-1 == isz) { |
|
perror(NULL); |
|
exit((int)MANDOCLEVEL_SYSERR); |
|
} |
|
free(*bufp); |
|
*bufp = p; |
|
*szp = isz + 1; |
|
*offs = 0; |
|
free(roffit_macro); |
|
roffit_lines = 0; |
|
return(ROFF_REPARSE); |
|
} else if (1 < roffit_lines) |
|
--roffit_lines; |
|
return(ROFF_CONT); |
} |
} |
|
|
|
enum rofferr |
static int |
roff_parseln(struct roff *r, int ln, char **bufp, |
rofffindarg(const char *name) |
size_t *szp, int pos, int *offs) |
{ |
{ |
size_t i; |
enum rofft t; |
|
enum rofferr e; |
|
int ppos, ctl; |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
/* |
|
* Run the reserved-word filter only if we have some reserved |
|
* words to fill in. |
|
*/ |
|
|
/* LINTED */ |
e = roff_res(r, bufp, szp, ln, pos); |
for (i = 0; i < ROFF_ARGMAX; i++) |
if (ROFF_IGN == e) |
/* LINTED */ |
return(e); |
if (0 == strcmp(name, tokargnames[i])) |
assert(ROFF_CONT == e); |
return((int)i); |
|
|
|
return(ROFF_ARGMAX); |
|
} |
|
|
|
|
ppos = pos; |
|
ctl = roff_getcontrol(r, *bufp, &pos); |
|
|
static int |
/* |
rofffindtok(const char *buf) |
* 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 |
char token[4]; |
* we're not a macro, just let it through. |
int i; |
* Finally, if there's an equation scope open, divert it into it |
|
* no matter our state. |
|
*/ |
|
|
for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
if (r->last && ! ctl) { |
token[i] = *buf; |
t = r->last->tok; |
|
assert(roffs[t].text); |
|
e = (*roffs[t].text) |
|
(r, t, bufp, szp, ln, pos, pos, offs); |
|
assert(ROFF_IGN == e || ROFF_CONT == e); |
|
if (ROFF_CONT != e) |
|
return(e); |
|
} |
|
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); |
|
if ( ! ctl) { |
|
if (r->tbl) |
|
return(tbl_read(r->tbl, ln, *bufp, pos)); |
|
return(roff_parsetext(bufp, szp, pos, offs)); |
|
} |
|
|
if (i == 3) |
/* |
return(ROFF_MAX); |
* If a scope is open, go to the child handler for that macro, |
|
* as it may want to preprocess before doing anything with it. |
|
* Don't do so if an equation is open. |
|
*/ |
|
|
token[i] = 0; |
if (r->last) { |
|
t = r->last->tok; |
|
assert(roffs[t].sub); |
|
return((*roffs[t].sub) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
|
} |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
/* |
|
* Lastly, as we've no scope open, try to look up and execute |
|
* the new macro. If no macro is found, simply return and let |
|
* the compilers handle it. |
|
*/ |
|
|
/* LINTED */ |
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
for (i = 0; i < ROFF_MAX; i++) |
return(ROFF_CONT); |
/* LINTED */ |
|
if (0 == strcmp(toknames[i], token)) |
|
return((int)i); |
|
|
|
return(ROFF_MAX); |
assert(roffs[t].proc); |
|
return((*roffs[t].proc) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
static int |
void |
roffchecksec(struct rofftree *tree, |
roff_endparse(struct roff *r) |
const char *start, int sec, int fail) |
|
{ |
{ |
|
|
switch (sec) { |
if (r->last) |
case(ROFFSec_PR_Dd): |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
return(1); |
r->last->line, r->last->col, NULL); |
case(ROFFSec_PR_Dt): |
|
if (ROFFSec_PR_Dd & tree->asec) |
if (r->eqn) { |
return(1); |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
break; |
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); |
case(ROFFSec_PR_Os): |
eqn_end(&r->eqn); |
if (ROFFSec_PR_Dt & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_NAME): |
|
if (ROFFSec_PR_Os & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_SYNOP): |
|
if (ROFFSec_NAME & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_DESC): |
|
if (ROFFSec_SYNOP & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_RETVAL): |
|
if (ROFFSec_DESC & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_ENV): |
|
if (ROFFSec_RETVAL & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_FILES): |
|
if (ROFFSec_ENV & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_EX): |
|
if (ROFFSec_FILES & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_DIAG): |
|
if (ROFFSec_EX & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_ERRS): |
|
if (ROFFSec_DIAG & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_SEEALSO): |
|
if (ROFFSec_ERRS & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_STAND): |
|
if (ROFFSec_SEEALSO & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_HIST): |
|
if (ROFFSec_STAND & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_AUTH): |
|
if (ROFFSec_HIST & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_CAVEATS): |
|
if (ROFFSec_AUTH & tree->asec) |
|
return(1); |
|
break; |
|
case(ROFFSec_BUGS): |
|
if (ROFFSec_CAVEATS & tree->asec) |
|
return(1); |
|
break; |
|
default: |
|
return(1); |
|
} |
} |
|
|
if (fail) |
if (r->tbl) { |
return(0); |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
return(roff_warnp(tree, start, ROFF_Sh, WRN_SECORD)); |
r->tbl->line, r->tbl->pos, NULL); |
|
tbl_end(&r->tbl); |
|
} |
} |
} |
|
|
|
/* |
|
* Parse a roff node's type from the input buffer. This must be in the |
|
* form of ".foo xxx" in the usual way. |
|
*/ |
|
static enum rofft |
|
roff_parse(struct roff *r, const char *buf, int *pos) |
|
{ |
|
const char *mac; |
|
size_t maclen; |
|
enum rofft t; |
|
|
static int |
if ('\0' == buf[*pos] || '"' == buf[*pos] || |
roffispunct(const char *p) |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
|
return(ROFF_MAX); |
|
|
|
/* We stop the macro parse at an escape, tab, space, or nil. */ |
|
|
|
mac = buf + *pos; |
|
maclen = strcspn(mac, " \\\t\0"); |
|
|
|
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
|
? ROFF_USERDEF : roffhash_find(mac, maclen); |
|
|
|
*pos += (int)maclen; |
|
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
|
(*pos)++; |
|
|
|
return(t); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cblock(ROFF_ARGS) |
{ |
{ |
|
|
if (0 == *p) |
/* |
return(0); |
* A block-close `..' should only be invoked as a child of an |
if (0 != *(p + 1)) |
* ignore macro, otherwise raise a warning and just ignore it. |
return(0); |
*/ |
|
|
switch (*p) { |
if (NULL == r->last) { |
case('{'): |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
switch (r->last->tok) { |
|
case (ROFF_am): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case('.'): |
case (ROFF_ami): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(','): |
case (ROFF_am1): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(';'): |
case (ROFF_de): |
|
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case(':'): |
case (ROFF_dei): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case('?'): |
case (ROFF_ig): |
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case('('): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
return(1); |
|
default: |
|
break; |
break; |
|
default: |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
} |
} |
|
|
return(0); |
if ((*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
|
|
} |
} |
|
|
|
|
static int |
static void |
rofffindcallable(const char *name) |
roffnode_cleanscope(struct roff *r) |
{ |
{ |
int c; |
|
|
|
if (ROFF_MAX == (c = rofffindtok(name))) |
while (r->last) { |
return(ROFF_MAX); |
if (--r->last->endspan != 0) |
assert(c >= 0 && c < ROFF_MAX); |
break; |
return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
roffnode_pop(r); |
|
} |
} |
} |
|
|
|
|
static struct roffnode * |
static void |
roffnode_new(int tokid, struct rofftree *tree) |
roff_ccond(struct roff *r, int ln, int ppos) |
{ |
{ |
struct roffnode *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct roffnode)))) |
|
err(1, "malloc"); |
|
|
|
p->tok = tokid; |
if (NULL == r->last) { |
p->parent = tree->last; |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
tree->last = p; |
return; |
|
} |
|
|
return(p); |
switch (r->last->tok) { |
|
case (ROFF_el): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ie): |
|
/* FALLTHROUGH */ |
|
case (ROFF_if): |
|
break; |
|
default: |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return; |
|
} |
|
|
|
if (r->last->endspan > -1) { |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return; |
|
} |
|
|
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return; |
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffargok(int tokid, int argid) |
static enum rofferr |
|
roff_block(ROFF_ARGS) |
{ |
{ |
const int *c; |
int sv; |
|
size_t sz; |
|
char *name; |
|
|
if (NULL == (c = tokens[tokid].args)) |
name = NULL; |
return(0); |
|
|
|
for ( ; ROFF_ARGMAX != *c; c++) |
if (ROFF_ig != tok) { |
if (argid == *c) |
if ('\0' == (*bufp)[pos]) { |
return(1); |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
return(0); |
/* |
} |
* Re-write `de1', since we don't really care about |
|
* groff's strange compatibility mode, into `de'. |
|
*/ |
|
|
|
if (ROFF_de1 == tok) |
|
tok = ROFF_de; |
|
if (ROFF_de == tok) |
|
name = *bufp + pos; |
|
else |
|
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, |
|
roffs[tok].name); |
|
|
static void |
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
roffnode_free(struct rofftree *tree) |
pos++; |
{ |
|
struct roffnode *p; |
|
|
|
assert(tree->last); |
while (isspace((unsigned char)(*bufp)[pos])) |
|
(*bufp)[pos++] = '\0'; |
|
} |
|
|
p = tree->last; |
roffnode_push(r, tok, name, ln, ppos); |
tree->last = tree->last->parent; |
|
free(p); |
|
} |
|
|
|
|
/* |
|
* At the beginning of a `de' macro, clear the existing string |
|
* with the same name, if there is one. New content will be |
|
* appended from roff_block_text() in multiline mode. |
|
*/ |
|
|
static int |
if (ROFF_de == tok) |
roffspecial(struct rofftree *tree, int tok, const char *start, |
roff_setstr(r, name, "", 0); |
const int *argc, const char **argv, |
|
size_t sz, char **ordp) |
|
{ |
|
|
|
switch (tok) { |
if ('\0' == (*bufp)[pos]) |
case (ROFF_At): |
return(ROFF_IGN); |
if (0 == sz) |
|
break; |
|
if (ROFF_ATT_MAX != roff_att(*ordp)) |
|
break; |
|
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
|
|
|
case (ROFF_Xr): |
|
if (2 == sz) { |
|
assert(ordp[1]); |
|
if (ROFF_MSEC_MAX != roff_msec(ordp[1])) |
|
break; |
|
if ( ! roff_warn(tree, start, "invalid `%s' manual " |
|
"section", toknames[tok])) |
|
return(0); |
|
} |
|
/* FALLTHROUGH */ |
|
|
|
case (ROFF_Sx): |
/* If present, process the custom end-of-line marker. */ |
/* FALLTHROUGH*/ |
|
case (ROFF_Fn): |
|
if (0 != sz) |
|
break; |
|
return(roff_errp(tree, start, tok, ERR_ARGGE1)); |
|
|
|
case (ROFF_Nm): |
sv = pos; |
if (0 == sz) { |
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
if (0 != tree->name[0]) { |
pos++; |
ordp[0] = tree->name; |
|
ordp[1] = NULL; |
|
break; |
|
} |
|
return(roff_err(tree, start, "`Nm' not set")); |
|
} else if ( ! roffsetname(tree, ordp)) |
|
return(0); |
|
break; |
|
|
|
case (ROFF_Rv): |
/* |
/* FALLTHROUGH*/ |
* Note: groff does NOT like escape characters in the input. |
case (ROFF_Ex): |
* Instead of detecting this, we're just going to let it fly and |
if (1 == sz) |
* to hell with it. |
break; |
*/ |
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
|
|
|
case (ROFF_Sm): |
assert(pos > sv); |
if (1 != sz) |
sz = (size_t)(pos - sv); |
return(roff_errp(tree, start, tok, ERR_ARGEQ1)); |
|
else if (0 == strcmp(ordp[0], "on") || |
|
0 == strcmp(ordp[0], "off")) |
|
break; |
|
return(roff_errp(tree, *ordp, tok, ERR_BADARG)); |
|
|
|
case (ROFF_Ud): |
|
/* FALLTHROUGH */ |
|
case (ROFF_Ux): |
|
/* FALLTHROUGH */ |
|
case (ROFF_Bt): |
|
if (0 == sz) |
|
break; |
|
return(roff_errp(tree, start, tok, ERR_ARGEQ0)); |
|
default: |
|
break; |
|
} |
|
|
|
return((*tree->cb.roffspecial)(tree->arg, tok, tree->cur, |
if (1 == sz && '.' == (*bufp)[sv]) |
argc, argv, (const char **)ordp)); |
return(ROFF_IGN); |
} |
|
|
|
|
r->last->end = mandoc_malloc(sz + 1); |
|
|
static int |
memcpy(r->last->end, *bufp + sv, sz); |
roffexit(struct rofftree *tree, int tok) |
r->last->end[(int)sz] = '\0'; |
{ |
|
|
|
assert(tokens[tok].cb); |
if ((*bufp)[pos]) |
return((*tokens[tok].cb)(tok, tree, NULL, ROFF_EXIT)); |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffcall(struct rofftree *tree, int tok, char **argv) |
static enum rofferr |
|
roff_block_sub(ROFF_ARGS) |
{ |
{ |
int i; |
enum rofft t; |
enum roffmsec c; |
int i, j; |
|
|
if (NULL == tokens[tok].cb) |
/* |
return(roff_errp(tree, *argv, tok, ERR_NOTSUP)); |
* First check whether a custom macro exists at this level. If |
|
* it does, then check against it. This is some of groff's |
|
* stranger behaviours. If we encountered a custom end-scope |
|
* tag and that tag also happens to be a "real" macro, then we |
|
* need to try interpreting it again as a real macro. If it's |
|
* not, then return ignore. Else continue. |
|
*/ |
|
|
if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
if (r->last->end) { |
i = 0; |
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
while (ROFF_MSEC_MAX != |
if ((*bufp)[i] != r->last->end[j]) |
(c = tokens[tok].sections[i++])) |
|
if (c == tree->section) |
|
break; |
break; |
if (ROFF_MSEC_MAX == c) { |
|
if ( ! roff_warn(tree, *argv, "`%s' is not a valid " |
if ('\0' == r->last->end[j] && |
"macro in this manual section", |
('\0' == (*bufp)[i] || |
toknames[tok])) |
' ' == (*bufp)[i] || |
return(0); |
'\t' == (*bufp)[i])) { |
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
|
|
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
|
i++; |
|
|
|
pos = i; |
|
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
|
return(ROFF_RERUN); |
|
return(ROFF_IGN); |
} |
} |
} |
} |
|
|
return((*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER)); |
/* |
|
* If we have no custom end-query or lookup failed, then try |
|
* pulling it out of the hashtable. |
|
*/ |
|
|
|
t = roff_parse(r, *bufp, &pos); |
|
|
|
/* |
|
* Macros other than block-end are only significant |
|
* in `de' blocks; elsewhere, simply throw them away. |
|
*/ |
|
if (ROFF_cblock != t) { |
|
if (ROFF_de == tok) |
|
roff_setstr(r, r->last->name, *bufp + ppos, 2); |
|
return(ROFF_IGN); |
|
} |
|
|
|
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
static int |
/* ARGSUSED */ |
roffnextopt(const struct rofftree *tree, int tok, |
static enum rofferr |
char ***in, char **val) |
roff_block_text(ROFF_ARGS) |
{ |
{ |
char *arg, **argv; |
|
int v; |
|
|
|
*val = NULL; |
if (ROFF_de == tok) |
argv = *in; |
roff_setstr(r, r->last->name, *bufp + pos, 2); |
assert(argv); |
|
|
|
if (NULL == (arg = *argv)) |
return(ROFF_IGN); |
return(-1); |
} |
if ('-' != *arg) |
|
return(-1); |
|
|
|
if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
|
if ( ! roff_warn(tree, arg, "argument-like parameter `%s' to " |
|
"`%s'", arg, toknames[tok])) |
|
return(ROFF_ARGMAX); |
|
return(-1); |
|
} |
|
|
|
if ( ! roffargok(tok, v)) { |
|
if ( ! roff_warn(tree, arg, "invalid argument parameter `%s' to " |
|
"`%s'", tokargnames[v], toknames[tok])) |
|
return(ROFF_ARGMAX); |
|
return(-1); |
|
} |
|
|
|
if ( ! (ROFF_VALUE & tokenargs[v])) |
|
return(v); |
|
|
|
*in = ++argv; |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cond_sub(ROFF_ARGS) |
|
{ |
|
enum rofft t; |
|
char *ep; |
|
int rr; |
|
|
if (NULL == *argv) { |
rr = r->last->rule; |
(void)roff_err(tree, arg, "empty value of `%s' for `%s'", |
roffnode_cleanscope(r); |
tokargnames[v], toknames[tok]); |
t = roff_parse(r, *bufp, &pos); |
return(ROFF_ARGMAX); |
|
|
/* |
|
* Fully handle known macros when they are structurally |
|
* required or when the conditional evaluated to true. |
|
*/ |
|
|
|
if ((ROFF_MAX != t) && |
|
(rr || ROFFMAC_STRUCT & roffs[t].flags)) { |
|
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
return(v); |
/* |
|
* If `\}' occurs on a macro line without a preceding macro, |
|
* drop the line completely. |
|
*/ |
|
|
|
ep = *bufp + pos; |
|
if ('\\' == ep[0] && '}' == ep[1]) |
|
rr = 0; |
|
|
|
/* Always check for the closing delimiter `\}'. */ |
|
|
|
while (NULL != (ep = strchr(ep, '\\'))) { |
|
if ('}' == *(++ep)) { |
|
*ep = '&'; |
|
roff_ccond(r, ln, ep - *bufp - 1); |
|
} |
|
++ep; |
|
} |
|
return(rr ? ROFF_CONT : ROFF_IGN); |
} |
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cond_text(ROFF_ARGS) |
|
{ |
|
char *ep; |
|
int rr; |
|
|
|
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
|
|
ep = *bufp + pos; |
|
while (NULL != (ep = strchr(ep, '\\'))) { |
|
if ('}' == *(++ep)) { |
|
*ep = '&'; |
|
roff_ccond(r, ln, ep - *bufp - 1); |
|
} |
|
++ep; |
|
} |
|
return(rr ? ROFF_CONT : ROFF_IGN); |
|
} |
|
|
static int |
static int |
roffpurgepunct(struct rofftree *tree, char **argv) |
roff_getnum(const char *v, int *pos, int *res) |
{ |
{ |
int i; |
int p, n; |
|
|
i = 0; |
p = *pos; |
while (argv[i]) |
n = v[p] == '-'; |
i++; |
if (n) |
assert(i > 0); |
p++; |
if ( ! roffispunct(argv[--i])) |
|
return(1); |
|
while (i >= 0 && roffispunct(argv[i])) |
|
i--; |
|
i++; |
|
|
|
/* LINTED */ |
for (*res = 0; isdigit((unsigned char)v[p]); p++) |
while (argv[i]) |
*res += 10 * *res + v[p] - '0'; |
if ( ! roffdata(tree, 0, argv[i++])) |
if (p == *pos + n) |
return(0); |
return 0; |
return(1); |
|
|
if (n) |
|
*res = -*res; |
|
|
|
*pos = p; |
|
return 1; |
} |
} |
|
|
|
static int |
|
roff_getop(const char *v, int *pos, char *res) |
|
{ |
|
int e; |
|
|
|
*res = v[*pos]; |
|
e = v[*pos + 1] == '='; |
|
|
|
switch (*res) { |
|
case '=': |
|
break; |
|
case '>': |
|
if (e) |
|
*res = 'g'; |
|
break; |
|
case '<': |
|
if (e) |
|
*res = 'l'; |
|
break; |
|
default: |
|
return(0); |
|
} |
|
|
|
*pos += 1 + e; |
|
|
|
return(*res); |
|
} |
|
|
|
/* |
|
* 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 |
roffparseopts(struct rofftree *tree, int tok, |
roff_evalstrcond(const char *v, int *pos) |
char ***args, int *argc, char **argv) |
|
{ |
{ |
int i, c; |
const char *s1, *s2, *s3; |
char *v; |
int match; |
|
|
i = 0; |
match = 0; |
|
s1 = v + *pos; /* initial delimiter */ |
|
s2 = s1 + 1; /* for scanning the first string */ |
|
s3 = strchr(s2, *s1); /* for scanning the second string */ |
|
|
while (-1 != (c = roffnextopt(tree, tok, args, &v))) { |
if (NULL == s3) /* found no middle delimiter */ |
if (ROFF_ARGMAX == c) |
goto out; |
return(0); |
|
|
|
argc[i] = c; |
while ('\0' != *++s3) { |
argv[i] = v; |
if (*s2 != *s3) { /* mismatch */ |
i++; |
s3 = strchr(s3, *s1); |
*args = *args + 1; |
break; |
|
} |
|
if (*s3 == *s1) { /* found the final delimiter */ |
|
match = 1; |
|
break; |
|
} |
|
s2++; |
} |
} |
|
|
argc[i] = ROFF_ARGMAX; |
out: |
argv[i] = NULL; |
if (NULL == s3) |
return(1); |
s3 = strchr(s2, '\0'); |
|
else |
|
s3++; |
|
*pos = s3 - v; |
|
return(match); |
} |
} |
|
|
|
|
static int |
static int |
roffdata(struct rofftree *tree, int space, char *buf) |
roff_evalcond(const char *v, int *pos) |
{ |
{ |
|
int wanttrue, lh, rh; |
|
char op; |
|
|
if (0 == *buf) |
if ('!' == v[*pos]) { |
return(1); |
wanttrue = 0; |
return((*tree->cb.roffdata)(tree->arg, |
(*pos)++; |
space != 0, tree->cur, buf)); |
} else |
|
wanttrue = 1; |
|
|
|
switch (v[*pos]) { |
|
case ('n'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
|
(*pos)++; |
|
return(wanttrue); |
|
case ('c'): |
|
/* FALLTHROUGH */ |
|
case ('d'): |
|
/* FALLTHROUGH */ |
|
case ('e'): |
|
/* FALLTHROUGH */ |
|
case ('r'): |
|
/* FALLTHROUGH */ |
|
case ('t'): |
|
(*pos)++; |
|
return(!wanttrue); |
|
default: |
|
break; |
|
} |
|
|
|
if (!roff_getnum(v, pos, &lh)) |
|
return(roff_evalstrcond(v, pos) == wanttrue); |
|
if (!roff_getop(v, pos, &op)) |
|
return((lh > 0) == wanttrue); |
|
if (!roff_getnum(v, pos, &rh)) |
|
return(0); |
|
|
|
switch (op) { |
|
case 'g': |
|
return((lh >= rh) == wanttrue); |
|
case 'l': |
|
return((lh <= rh) == wanttrue); |
|
case '=': |
|
return((lh == rh) == wanttrue); |
|
case '>': |
|
return((lh > rh) == wanttrue); |
|
case '<': |
|
return((lh < rh) == wanttrue); |
|
default: |
|
return(0); |
|
} |
} |
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_line_ignore(ROFF_ARGS) |
|
{ |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
time_t t; |
|
char *p, buf[32]; |
|
size_t sz; |
|
|
|
if (ROFFSec_PR_Os & tree->asec) |
roffnode_push(r, tok, NULL, ln, ppos); |
return(roff_text(tok, tree, argv, type)); |
|
if (ROFFSec_PR_Dd & tree->asec) |
|
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
|
if ( ! roffchecksec(tree, *argv, ROFFSec_PR_Dd, 1)) |
|
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
|
|
|
assert(NULL == tree->last); |
/* |
argv++; |
* An `.el' has no conditional body: it will consume the value |
tree->asec |= (tree->csec = ROFFSec_PR_Dd); |
* 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 ? 0 : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(*bufp, &pos); |
|
|
/* |
/* |
* This is a bit complex because there are many forms the date |
* An if-else will put the NEGATION of the current evaluated |
* can be in: it can be simply $Mdocdate$, $Mdocdate <date>$, |
* conditional into the stack of rules. |
* or a raw date. Process accordingly. |
|
*/ |
*/ |
|
|
if (0 == strcmp(*argv, "$Mdocdate$")) { |
if (ROFF_ie == tok) { |
t = time(NULL); |
if (r->rstackpos == RSTACK_MAX - 1) { |
if (NULL == localtime_r(&t, &tree->tm)) |
mandoc_msg(MANDOCERR_MEM, |
err(1, "localtime_r"); |
r->parse, ln, ppos, NULL); |
return(1); |
return(ROFF_ERR); |
} |
|
|
|
buf[0] = 0; |
|
p = *argv; |
|
sz = sizeof(buf); |
|
|
|
if (0 != strcmp(*argv, "$Mdocdate:")) { |
|
while (*argv) { |
|
if (strlcat(buf, *argv++, sz) < sz) |
|
continue; |
|
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
} |
} |
if (strptime(buf, "%b%d,%Y", &tree->tm)) |
r->rstack[++r->rstackpos] = !r->last->rule; |
return(1); |
|
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
} |
} |
|
|
argv++; |
/* If the parent has false as its rule, then so do we. */ |
|
|
while (*argv && **argv != '$') { |
if (r->last->parent && !r->last->parent->rule) |
if (strlcat(buf, *argv++, sz) >= sz) |
r->last->rule = 0; |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
if (strlcat(buf, " ", sz) >= sz) |
/* |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
* Determine scope. |
|
* If there is nothing on the line after the conditional, |
|
* not even whitespace, use next-line scope. |
|
*/ |
|
|
|
if ('\0' == (*bufp)[pos]) { |
|
r->last->endspan = 2; |
|
goto out; |
} |
} |
|
|
if (NULL == *argv) |
while (' ' == (*bufp)[pos]) |
return(roff_errp(tree, p, tok, ERR_BADARG)); |
pos++; |
if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) |
|
return(roff_errp(tree, p, tok, ERR_BADARG)); |
|
|
|
return(1); |
/* An opening brace requests multiline scope. */ |
|
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
|
r->last->endspan = -1; |
|
pos += 2; |
|
goto out; |
|
} |
|
|
|
/* |
|
* Anything else following the conditional causes |
|
* single-line scope. Warn if the scope contains |
|
* nothing but trailing whitespace. |
|
*/ |
|
|
|
if ('\0' == (*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
|
|
r->last->endspan = 1; |
|
|
|
out: |
|
*offs = pos; |
|
return(ROFF_RERUN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dt(ROFFCALL_ARGS) |
roff_ds(ROFF_ARGS) |
{ |
{ |
size_t sz; |
char *name, *string; |
|
|
if (ROFFSec_PR_Os & tree->asec) |
/* |
return(roff_text(tok, tree, argv, type)); |
* A symbol is named by the first word following the macro |
if (ROFFSec_PR_Dt & tree->asec) |
* invocation up to a space. Its value is anything after the |
return(roff_errp(tree, *argv, tok, ERR_PR_REP)); |
* name's trailing whitespace and optional double-quote. Thus, |
if ( ! roffchecksec(tree, *argv, ROFFSec_PR_Dt, 1)) |
* |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
* [.ds foo "bar " ] |
|
* |
|
* will have `bar " ' as its value. |
|
*/ |
|
|
argv++; |
string = *bufp + pos; |
tree->asec |= (tree->csec = ROFFSec_PR_Dt); |
name = roff_getname(r, &string, ln, pos); |
sz = sizeof(tree->title); |
if ('\0' == *name) |
|
return(ROFF_IGN); |
|
|
if (NULL == *argv) |
/* Read past initial double-quote. */ |
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
if ('"' == *string) |
if (strlcpy(tree->title, *argv, sz) >= sz) |
string++; |
return(roff_errp(tree, *argv, tok, ERR_ARGLEN)); |
|
|
|
argv++; |
/* The rest is the value. */ |
if (NULL == *argv) |
roff_setstr(r, name, string, ROFF_as == tok); |
return(roff_errp(tree, *argv, tok, ERR_ARGGE2)); |
return(ROFF_IGN); |
|
} |
|
|
if (ROFF_MSEC_MAX == (tree->section = roff_msec(*argv))) |
void |
return(roff_errp(tree, *argv, tok, ERR_BADARG)); |
roff_setreg(struct roff *r, const char *name, int val, char sign) |
|
{ |
|
struct roffreg *reg; |
|
|
argv++; |
/* Search for an existing register with the same name. */ |
|
reg = r->regtab; |
|
|
if (NULL == *argv) { |
while (reg && strcmp(name, reg->key.p)) |
switch (tree->section) { |
reg = reg->next; |
case(ROFF_MSEC_1): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_6): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_7): |
|
tree->volume = ROFF_VOL_URM; |
|
break; |
|
case(ROFF_MSEC_2): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_3): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_3p): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_4): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_5): |
|
tree->volume = ROFF_VOL_PRM; |
|
break; |
|
case(ROFF_MSEC_8): |
|
tree->volume = ROFF_VOL_PRM; |
|
break; |
|
case(ROFF_MSEC_9): |
|
tree->volume = ROFF_VOL_KM; |
|
break; |
|
case(ROFF_MSEC_UNASS): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_DRAFT): |
|
/* FALLTHROUGH */ |
|
case(ROFF_MSEC_PAPER): |
|
tree->volume = ROFF_VOL_NONE; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
} else if (ROFF_VOL_MAX == (tree->volume = roff_vol(*argv))) |
|
return(roff_errp(tree, *argv, tok, ERR_BADARG)); |
|
|
|
assert(NULL == tree->last); |
if (NULL == reg) { |
|
/* Create a new register. */ |
|
reg = mandoc_malloc(sizeof(struct roffreg)); |
|
reg->key.p = mandoc_strdup(name); |
|
reg->key.sz = strlen(name); |
|
reg->val = 0; |
|
reg->next = r->regtab; |
|
r->regtab = reg; |
|
} |
|
|
return(1); |
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); |
|
|
|
return(0); |
|
} |
|
|
static int |
static int |
roffsetname(struct rofftree *tree, char **ordp) |
roff_getregn(const struct roff *r, const char *name, size_t len) |
{ |
{ |
size_t sz; |
struct roffreg *reg; |
|
int val; |
assert(*ordp); |
|
|
|
/* FIXME: not all sections can set this. */ |
if ('.' == name[0] && 2 == len) { |
|
val = roff_getregro(name + 1); |
|
if (-1 != val) |
|
return (val); |
|
} |
|
|
if (NULL != *(ordp + 1)) |
for (reg = r->regtab; reg; reg = reg->next) |
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGMNY)); |
if (len == reg->key.sz && |
|
0 == strncmp(name, reg->key.p, len)) |
sz = sizeof(tree->name); |
return(reg->val); |
if (strlcpy(tree->name, *ordp, sz) >= sz) |
|
return(roff_errp(tree, *ordp, ROFF_Nm, ERR_ARGLEN)); |
|
|
|
return(1); |
return(0); |
} |
} |
|
|
|
static void |
|
roff_freereg(struct roffreg *reg) |
|
{ |
|
struct roffreg *old_reg; |
|
|
|
while (NULL != reg) { |
|
free(reg->key.p); |
|
old_reg = reg; |
|
reg = reg->next; |
|
free(old_reg); |
|
} |
|
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Ns(ROFFCALL_ARGS) |
roff_nr(ROFF_ARGS) |
{ |
{ |
int j, c, first; |
const char *key; |
char *morep[1]; |
char *val; |
|
size_t sz; |
|
int iv; |
|
char sign; |
|
|
first = (*argv++ == tree->cur); |
val = *bufp + pos; |
morep[0] = NULL; |
key = roff_getname(r, &val, ln, pos); |
|
|
if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep)) |
sign = *val; |
return(0); |
if ('+' == sign || '-' == sign) |
|
val++; |
|
|
while (*argv) { |
sz = strspn(val, "0123456789"); |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
iv = sz ? mandoc_strntoi(val, sz, 10) : 0; |
if ( ! roffcall(tree, c, argv)) |
|
return(0); |
|
break; |
|
} |
|
|
|
if ( ! roffispunct(*argv)) { |
roff_setreg(r, key, iv, sign); |
if ( ! roffdata(tree, 1, *argv++)) |
|
return(0); |
|
continue; |
|
} |
|
|
|
for (j = 0; argv[j]; j++) |
return(ROFF_IGN); |
if ( ! roffispunct(argv[j])) |
} |
break; |
|
|
|
if (argv[j]) { |
/* ARGSUSED */ |
if ( ! roffdata(tree, 0, *argv++)) |
static enum rofferr |
return(0); |
roff_rm(ROFF_ARGS) |
continue; |
{ |
} |
const char *name; |
|
char *cp; |
|
|
break; |
cp = *bufp + pos; |
|
while ('\0' != *cp) { |
|
name = roff_getname(r, &cp, ln, (int)(cp - *bufp)); |
|
if ('\0' != *name) |
|
roff_setstr(r, name, NULL, 0); |
} |
} |
|
return(ROFF_IGN); |
|
} |
|
|
if ( ! first) |
/* ARGSUSED */ |
return(1); |
static enum rofferr |
|
roff_it(ROFF_ARGS) |
|
{ |
|
char *cp; |
|
size_t len; |
|
int iv; |
|
|
return(roffpurgepunct(tree, argv)); |
/* Parse the number of lines. */ |
|
cp = *bufp + pos; |
|
len = strcspn(cp, " \t"); |
|
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; |
|
|
|
/* Arm the input line trap. */ |
|
roffit_lines = iv; |
|
roffit_macro = mandoc_strdup(cp); |
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Os(ROFFCALL_ARGS) |
roff_Dd(ROFF_ARGS) |
{ |
{ |
char *p; |
const char *const *cp; |
size_t sz; |
|
|
|
if (ROFFSec_PR_Os & tree->asec) |
if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options)) |
return(roff_text(tok, tree, argv, type)); |
for (cp = __mdoc_reserved; *cp; cp++) |
if ( ! roffchecksec(tree, *argv, ROFFSec_PR_Os, 1)) |
roff_setstr(r, *cp, NULL, 0); |
return(roff_errp(tree, *argv, tok, ERR_PR_OOO)); |
|
|
|
p = *++argv; |
return(ROFF_CONT); |
sz = sizeof(tree->os); |
} |
tree->asec |= (tree->csec = ROFFSec_PR_Os); |
|
|
|
tree->os[0] = 0; |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TH(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
while (*argv) |
if (0 == (MPARSE_QUICK & r->options)) |
if (strlcat(tree->os, *argv++, sz) >= sz) |
for (cp = __man_reserved; *cp; cp++) |
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
roff_setstr(r, *cp, NULL, 0); |
|
|
if (0 == tree->os[0]) |
return(ROFF_CONT); |
if (strlcpy(tree->os, "LOCAL", sz) >= sz) |
} |
return(roff_errp(tree, p, tok, ERR_ARGLEN)); |
|
|
|
assert(ROFF_MSEC_MAX != tree->section); |
/* ARGSUSED */ |
assert(0 != tree->title[0]); |
static enum rofferr |
assert(0 != tree->os[0]); |
roff_TE(ROFF_ARGS) |
|
{ |
|
|
assert(NULL == tree->last); |
if (NULL == r->tbl) |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
else |
|
tbl_end(&r->tbl); |
|
|
return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
return(ROFF_IGN); |
tree->os, tree->title, |
|
tree->section, tree->volume)); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_layout(ROFFCALL_ARGS) |
roff_T_(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXLINEARG]; |
|
char *argvp[ROFF_MAXLINEARG], *p; |
|
|
|
/* |
if (NULL == r->tbl) |
* The roff_layout function is for multi-line macros. A layout |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
* has a start and end point, which is either declared |
else |
* explicitly or implicitly. An explicit start and end is |
tbl_restart(ppos, ln, r->tbl); |
* embodied by `.Bl' and `.El', with the former being the start |
|
* and the latter being an end. The `.Sh' and `.Ss' tags, on |
|
* the other hand, are implicit. The scope of a layout is the |
|
* space between start and end. Explicit layouts may not close |
|
* out implicit ones and vice versa; implicit layouts may close |
|
* out other implicit layouts. |
|
*/ |
|
|
|
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
return(ROFF_IGN); |
|
} |
|
|
if ( ! (ROFFSec_PR_Os & tree->asec)) |
#if 0 |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
static int |
|
roff_closeeqn(struct roff *r) |
|
{ |
|
|
if (ROFF_EXIT == type) { |
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
roffnode_free(tree); |
} |
if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
#endif |
return(0); |
|
return((*tree->cb.roffblkout)(tree->arg, tok)); |
|
} |
|
|
|
p = *argv++; |
static void |
assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
roff_openeqn(struct roff *r, const char *name, int line, |
|
int offs, const char *buf) |
|
{ |
|
struct eqn_node *e; |
|
int poff; |
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
assert(NULL == r->eqn); |
return(0); |
e = eqn_alloc(name, offs, line, r->parse); |
if (NULL == roffnode_new(tok, tree)) |
|
return(0); |
|
|
|
/* |
if (r->last_eqn) |
* Layouts have two parts: the layout body and header. The |
r->last_eqn->next = e; |
* layout header is the trailing text of the line macro, while |
else |
* the layout body is everything following until termination. |
r->first_eqn = r->last_eqn = e; |
* Example: |
|
* |
|
* .It Fl f ) ; |
|
* Bar. |
|
* |
|
* ...Produces... |
|
* |
|
* <block> |
|
* <head> |
|
* <!Fl f!> ; |
|
* </head> |
|
* |
|
* <body> |
|
* Bar. |
|
* </body> |
|
* </block> |
|
*/ |
|
|
|
if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, |
r->eqn = r->last_eqn = e; |
(const char **)argvp)) |
|
return(0); |
|
|
|
/* +++ Begin run macro-specific hooks over argv. */ |
if (buf) { |
|
poff = 0; |
|
eqn_read(&r->eqn, line, buf, offs, &poff); |
|
} |
|
} |
|
|
switch (tok) { |
/* ARGSUSED */ |
case (ROFF_Sh): |
static enum rofferr |
if (NULL == *argv) { |
roff_EQ(ROFF_ARGS) |
argv--; |
{ |
return(roff_errp(tree, *argv, tok, ERR_ARGGE1)); |
|
} |
|
|
|
tree->csec = roff_sec((const char **)argv); |
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
if ( ! (ROFFSec_OTHER & tree->csec) && |
/* ARGSUSED */ |
tree->asec & tree->csec) |
static enum rofferr |
if ( ! roff_warn(tree, *argv, "section repeated")) |
roff_EN(ROFF_ARGS) |
return(0); |
{ |
|
|
if (0 == tree->asec && ! (ROFFSec_NAME & tree->csec)) |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(roff_err(tree, *argv, "`NAME' section " |
return(ROFF_IGN); |
"must be first")); |
} |
if ( ! roffchecksec(tree, *argv, tree->csec, 0)) |
|
return(0); |
|
|
|
tree->asec |= tree->csec; |
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TS(ROFF_ARGS) |
|
{ |
|
struct tbl_node *tbl; |
|
|
if ( ! roffspecial(tree, tok, p, argcp, |
if (r->tbl) { |
(const char **)argvp, 0, argv)) |
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
return(0); |
tbl_end(&r->tbl); |
break; |
|
default: |
|
break; |
|
} |
} |
|
|
/* --- End run macro-specific hooks over argv. */ |
tbl = tbl_alloc(ppos, ln, r->parse); |
|
|
if (NULL == *argv) |
if (r->last_tbl) |
return((*tree->cb.roffblkbodyin) |
r->last_tbl->next = tbl; |
(tree->arg, tok, argcp, |
else |
(const char **)argvp)); |
r->first_tbl = r->last_tbl = tbl; |
|
|
if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, |
r->tbl = r->last_tbl = tbl; |
(const char **)argvp)) |
return(ROFF_IGN); |
return(0); |
} |
|
|
/* |
/* ARGSUSED */ |
* If there are no parsable parts, then write remaining tokens |
static enum rofferr |
* into the layout header and exit. |
roff_cc(ROFF_ARGS) |
*/ |
{ |
|
const char *p; |
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
p = *bufp + pos; |
i = 0; |
|
while (*argv) |
|
if ( ! roffdata(tree, i++, *argv++)) |
|
return(0); |
|
|
|
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
if ('\0' == *p || '.' == (r->control = *p++)) |
return(0); |
r->control = 0; |
return((*tree->cb.roffblkbodyin)(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
if ('\0' != *p) |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
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) { |
* Parsable elements may be in the header (or be the header, for |
fsz = ssz = 1; |
* that matter). Follow the regular parsing rules for these. |
|
*/ |
|
|
|
i = 0; |
first = p++; |
while (*argv) { |
if ('\\' == *first) { |
if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
esc = mandoc_escape(&p, NULL, NULL); |
assert(tree->arg); |
if (ESCAPE_ERROR == esc) { |
if ( ! roffdata(tree, i++, *argv++)) |
mandoc_msg |
return(0); |
(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; |
continue; |
} |
} |
if ( ! roffcall(tree, c, argv)) |
|
return(0); |
|
break; |
|
} |
|
|
|
/* |
if (NULL == r->xtab) |
* If there's trailing punctuation in the header, then write it |
r->xtab = mandoc_calloc |
* out now. Here we mimic the behaviour of a line-dominant text |
(128, sizeof(struct roffstr)); |
* macro. |
|
*/ |
|
|
|
if (NULL == *argv) { |
free(r->xtab[(int)*first].p); |
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); |
return(0); |
r->xtab[(int)*first].sz = ssz; |
return((*tree->cb.roffblkbodyin) |
|
(tree->arg, tok, argcp, |
|
(const char **)argvp)); |
|
} |
} |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_so(ROFF_ARGS) |
|
{ |
|
char *name; |
|
|
|
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); |
|
|
/* |
/* |
* Expensive. Scan to the end of line then work backwards until |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
* a token isn't punctuation. |
* opening anything that's not in our cwd or anything beneath |
|
* it. Thus, explicitly disallow traversing up the file-system |
|
* or using absolute paths. |
*/ |
*/ |
|
|
if ( ! roffpurgepunct(tree, argv)) |
name = *bufp + pos; |
return(0); |
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); |
return(0); |
return(ROFF_ERR); |
return((*tree->cb.roffblkbodyin)(tree->arg, |
} |
tok, argcp, (const char **)argvp)); |
|
|
*offs = pos; |
|
return(ROFF_SO); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_ordered(ROFFCALL_ARGS) |
roff_userdef(ROFF_ARGS) |
{ |
{ |
int i, first, c, argcp[ROFF_MAXLINEARG]; |
const char *arg[9]; |
char *ordp[ROFF_MAXLINEARG], *p, |
char *cp, *n1, *n2; |
*argvp[ROFF_MAXLINEARG]; |
int i; |
|
|
/* |
/* |
* Ordered macros pass their arguments directly to handlers, |
* Collect pointers to macro argument strings |
* instead of considering it free-form text. Thus, the |
* and NUL-terminate them. |
* following macro looks as follows: |
|
* |
|
* .Xr foo 1 ) , |
|
* |
|
* .Xr arg1 arg2 punctuation |
|
*/ |
*/ |
|
cp = *bufp + pos; |
|
for (i = 0; i < 9; i++) |
|
arg[i] = '\0' == *cp ? "" : |
|
mandoc_getarg(r->parse, &cp, ln, &pos); |
|
|
if ( ! (ROFFSec_PR_Os & tree->asec)) |
/* |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
* Expand macro arguments. |
|
*/ |
|
*szp = 0; |
|
n1 = cp = mandoc_strdup(r->current_string); |
|
while (NULL != (cp = strstr(cp, "\\$"))) { |
|
i = cp[2] - '1'; |
|
if (0 > i || 8 < i) { |
|
/* Not an argument invocation. */ |
|
cp += 2; |
|
continue; |
|
} |
|
|
first = (*argv == tree->cur); |
*szp = strlen(n1) - 3 + strlen(arg[i]) + 1; |
p = *argv++; |
n2 = mandoc_malloc(*szp); |
ordp[0] = NULL; |
|
|
|
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
strlcpy(n2, n1, (size_t)(cp - n1 + 1)); |
return(0); |
strlcat(n2, arg[i], *szp); |
|
strlcat(n2, cp + 3, *szp); |
|
|
if (NULL == *argv) |
cp = n2 + (cp - n1); |
return(roffspecial(tree, tok, p, argcp, |
free(n1); |
(const char **)argvp, 0, ordp)); |
n1 = n2; |
|
} |
|
|
i = 0; |
/* |
while (*argv && i < ROFF_MAXLINEARG) { |
* Replace the macro invocation |
c = ROFF_PARSED & tokens[tok].flags ? |
* by the expanded macro. |
rofffindcallable(*argv) : ROFF_MAX; |
*/ |
|
free(*bufp); |
|
*bufp = n1; |
|
if (0 == *szp) |
|
*szp = strlen(*bufp) + 1; |
|
|
if (ROFF_MAX == c && ! roffispunct(*argv)) { |
return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ? |
ordp[i++] = *argv++; |
ROFF_REPARSE : ROFF_APPEND); |
continue; |
} |
} |
|
ordp[i] = NULL; |
|
|
|
if (ROFF_MAX == c) |
static char * |
break; |
roff_getname(struct roff *r, char **cpp, int ln, int pos) |
|
{ |
|
char *name, *cp; |
|
|
if ( ! roffspecial(tree, tok, p, argcp, |
name = *cpp; |
(const char **)argvp, |
if ('\0' == *name) |
(size_t)i, ordp)) |
return(name); |
return(0); |
|
|
|
return(roffcall(tree, c, argv)); |
/* Read until end of name. */ |
|
for (cp = name; '\0' != *cp && ' ' != *cp; cp++) { |
|
if ('\\' != *cp) |
|
continue; |
|
cp++; |
|
if ('\\' == *cp) |
|
continue; |
|
mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL); |
|
*cp = '\0'; |
|
name = cp; |
} |
} |
|
|
assert(i != ROFF_MAXLINEARG); |
/* Nil-terminate name. */ |
ordp[i] = NULL; |
if ('\0' != *cp) |
|
*(cp++) = '\0'; |
|
|
if ( ! roffspecial(tree, tok, p, argcp, |
/* Read past spaces. */ |
(const char**)argvp, |
while (' ' == *cp) |
(size_t)i, ordp)) |
cp++; |
return(0); |
|
|
|
/* FIXME: error if there's stuff after the punctuation. */ |
*cpp = cp; |
|
return(name); |
|
} |
|
|
if ( ! first || NULL == *argv) |
/* |
return(1); |
* Store *string into the user-defined string called *name. |
|
* 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 append) |
|
{ |
|
|
return(roffpurgepunct(tree, argv)); |
roff_setstrn(&r->strtab, name, strlen(name), string, |
|
string ? strlen(string) : 0, append); |
} |
} |
|
|
|
static void |
/* ARGSUSED */ |
roff_setstrn(struct roffkv **r, const char *name, size_t namesz, |
static int |
const char *string, size_t stringsz, int append) |
roff_text(ROFFCALL_ARGS) |
|
{ |
{ |
int i, j, first, c, argcp[ROFF_MAXLINEARG]; |
struct roffkv *n; |
char *argvp[ROFF_MAXLINEARG]; |
char *c; |
|
int i; |
|
size_t oldch, newch; |
|
|
/* |
/* Search for an existing string with the same name. */ |
* Text macros are similar to special tokens, except that |
n = *r; |
* arguments are instead flushed as pure data: we're only |
|
* concerned with the macro and its arguments. Example: |
|
* |
|
* .Fl v W f ; |
|
* |
|
* ...Produces... |
|
* |
|
* <fl> v W f </fl> ; |
|
*/ |
|
|
|
if ( ! (ROFFSec_PR_Os & tree->asec)) |
while (n && strcmp(name, n->key.p)) |
return(roff_errp(tree, *argv, tok, ERR_NOT_PR)); |
n = n->next; |
|
|
first = (*argv == tree->cur); |
if (NULL == n) { |
argv++; |
/* Create a new string table entry. */ |
|
n = mandoc_malloc(sizeof(struct roffkv)); |
if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
n->key.p = mandoc_strndup(name, namesz); |
return(0); |
n->key.sz = namesz; |
if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, |
n->val.p = NULL; |
(const char **)argvp)) |
n->val.sz = 0; |
return(0); |
n->next = *r; |
if (NULL == *argv) |
*r = n; |
return((*tree->cb.roffout)(tree->arg, tok)); |
} else if (0 == append) { |
|
free(n->val.p); |
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
n->val.p = NULL; |
i = 0; |
n->val.sz = 0; |
while (*argv) |
|
if ( ! roffdata(tree, i++, *argv++)) |
|
return(0); |
|
return((*tree->cb.roffout)(tree->arg, tok)); |
|
} |
} |
|
|
|
if (NULL == string) |
|
return; |
|
|
/* |
/* |
* Deal with punctuation. Ugly. Work ahead until we encounter |
* One additional byte for the '\n' in multiline mode, |
* terminating punctuation. If we encounter it and all |
* and one for the terminating '\0'. |
* subsequent tokens are punctuation, then stop processing (the |
|
* line-dominant macro will print these tokens after closure). |
|
* If the punctuation is followed by non-punctuation, then close |
|
* and re-open our scope, then continue. |
|
*/ |
*/ |
|
newch = stringsz + (1 < append ? 2u : 1u); |
|
|
i = 0; |
if (NULL == n->val.p) { |
while (*argv) { |
n->val.p = mandoc_malloc(newch); |
if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
*n->val.p = '\0'; |
if ( ! (ROFF_LSCOPE & tokens[tok].flags)) |
oldch = 0; |
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
} else { |
return(0); |
oldch = n->val.sz; |
|
n->val.p = mandoc_realloc(n->val.p, oldch + newch); |
if ( ! roffcall(tree, c, argv)) |
} |
return(0); |
|
if (ROFF_LSCOPE & tokens[tok].flags) |
|
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
break; |
|
} |
|
|
|
if ( ! roffispunct(*argv)) { |
/* Skip existing content in the destination buffer. */ |
if ( ! roffdata(tree, i++, *argv++)) |
c = n->val.p + (int)oldch; |
return(0); |
|
continue; |
|
} |
|
|
|
i = 1; |
/* Append new content to the destination buffer. */ |
for (j = 0; argv[j]; j++) |
i = 0; |
if ( ! roffispunct(argv[j])) |
while (i < (int)stringsz) { |
break; |
/* |
|
* Rudimentary roff copy mode: |
if (argv[j]) { |
* Handle escaped backslashes. |
if (ROFF_LSCOPE & tokens[tok].flags) { |
*/ |
if ( ! roffdata(tree, 0, *argv++)) |
if ('\\' == string[i] && '\\' == string[i + 1]) |
return(0); |
i++; |
continue; |
*c++ = string[i++]; |
} |
|
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
if ( ! roffdata(tree, 0, *argv++)) |
|
return(0); |
|
if ( ! (*tree->cb.roffin)(tree->arg, tok, |
|
argcp, |
|
(const char **)argvp)) |
|
return(0); |
|
|
|
i = 0; |
|
continue; |
|
} |
|
|
|
if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
return(0); |
|
break; |
|
} |
} |
|
|
if (NULL == *argv) |
/* Append terminating bytes. */ |
return((*tree->cb.roffout)(tree->arg, tok)); |
if (1 < append) |
if ( ! first) |
*c++ = '\n'; |
return(1); |
|
|
|
return(roffpurgepunct(tree, argv)); |
*c = '\0'; |
|
n->val.sz = (int)(c - n->val.p); |
} |
} |
|
|
|
static const char * |
/* ARGSUSED */ |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
static int |
|
roff_noop(ROFFCALL_ARGS) |
|
{ |
{ |
|
const struct roffkv *n; |
|
int i; |
|
|
return(1); |
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); |
|
|
/* ARGSUSED */ |
return(NULL); |
static int |
|
roff_depr(ROFFCALL_ARGS) |
|
{ |
|
|
|
return(roff_errp(tree, *argv, tok, ERR_DEPREC)); |
|
} |
} |
|
|
|
static void |
static int |
roff_freestr(struct roffkv *r) |
roff_warnp(const struct rofftree *tree, const char *pos, |
|
int tok, enum rofferr type) |
|
{ |
{ |
char *p; |
struct roffkv *n, *nn; |
|
|
switch (type) { |
for (n = r; n; n = nn) { |
case (WRN_SECORD): |
free(n->key.p); |
p = "section at `%s' out of order"; |
free(n->val.p); |
break; |
nn = n->next; |
default: |
free(n); |
abort(); |
|
/* NOTREACHED */ |
|
} |
} |
|
} |
|
|
return(roff_warn(tree, pos, p, toknames[tok])); |
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); |
|
} |
|
|
static int |
/* |
roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...) |
* 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) |
{ |
{ |
va_list ap; |
const struct roffkv *cp; |
char buf[128]; |
char *res; |
|
const char *pp; |
|
size_t ssz, sz; |
|
enum mandoc_esc esc; |
|
|
va_start(ap, fmt); |
if (NULL == r->xmbtab && NULL == r->xtab) |
(void)vsnprintf(buf, sizeof(buf), fmt, ap); |
return(mandoc_strdup(p)); |
va_end(ap); |
else if ('\0' == *p) |
|
return(mandoc_strdup("")); |
|
|
return((*tree->cb.roffmsg)(tree->arg, |
/* |
ROFF_WARN, tree->cur, pos, buf)); |
* 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; |
|
|
static int |
while ('\0' != *p) { |
roff_errp(const struct rofftree *tree, const char *pos, |
if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) { |
int tok, enum rofferr type) |
sz = r->xtab[(int)*p].sz; |
{ |
res = mandoc_realloc(res, ssz + sz + 1); |
char *p; |
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; |
|
} |
|
|
switch (type) { |
/* Search for term matches. */ |
case (ERR_ARGEQ1): |
for (cp = r->xmbtab; cp; cp = cp->next) |
p = "`%s' expects exactly one argument"; |
if (0 == strncmp(p, cp->key.p, cp->key.sz)) |
break; |
break; |
case (ERR_ARGEQ0): |
|
p = "`%s' expects exactly zero arguments"; |
if (NULL != cp) { |
break; |
/* |
case (ERR_ARGGE1): |
* A match has been found. |
p = "`%s' expects one or more arguments"; |
* Append the match to the array and move |
break; |
* forward by its keysize. |
case (ERR_ARGGE2): |
*/ |
p = "`%s' expects two or more arguments"; |
res = mandoc_realloc |
break; |
(res, ssz + cp->val.sz + 1); |
case (ERR_BADARG): |
memcpy(res + ssz, cp->val.p, cp->val.sz); |
p = "invalid argument for `%s'"; |
ssz += cp->val.sz; |
break; |
p += (int)cp->key.sz; |
case (ERR_NOTSUP): |
continue; |
p = "macro `%s' is not supported"; |
} |
break; |
|
case(ERR_PR_OOO): |
/* |
p = "prelude macro `%s' is out of order"; |
* Handle escapes carefully: we need to copy |
break; |
* over just the escape itself, or else we might |
case(ERR_PR_REP): |
* do replacements within the escape itself. |
p = "prelude macro `%s' repeated"; |
* Make sure to pass along the bogus string. |
break; |
*/ |
case(ERR_ARGLEN): |
pp = p++; |
p = "macro argument for `%s' is too long"; |
esc = mandoc_escape(&p, NULL, NULL); |
break; |
if (ESCAPE_ERROR == esc) { |
case(ERR_DEPREC): |
sz = strlen(pp); |
p = "macro `%s' is deprecated"; |
res = mandoc_realloc(res, ssz + sz + 1); |
break; |
memcpy(res + ssz, pp, sz); |
case(ERR_NOT_PR): |
break; |
p = "macro `%s' disallowed in prelude"; |
} |
break; |
/* |
case(ERR_ARGMNY): |
* We bail out on bad escapes. |
p = "too many arguments for macro `%s'"; |
* No need to warn: we already did so when |
break; |
* roff_res() was called. |
default: |
*/ |
abort(); |
sz = (int)(p - pp); |
/* NOTREACHED */ |
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, pp, sz); |
|
ssz += sz; |
} |
} |
|
|
return(roff_err(tree, pos, p, toknames[tok])); |
res[(int)ssz] = '\0'; |
|
return(res); |
} |
} |
|
|
|
/* |
static int |
* Find out whether a line is a macro line or not. |
roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...) |
* 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 |
|
* precedence. |
|
* This is slighly contrary to groff, where using the non-breaking |
|
* control character when `cc' has been invoked will cause the |
|
* non-breaking macro contents to be printed verbatim. |
|
*/ |
|
int |
|
roff_getcontrol(const struct roff *r, const char *cp, int *ppos) |
{ |
{ |
va_list ap; |
int pos; |
char buf[128]; |
|
|
|
va_start(ap, fmt); |
pos = *ppos; |
if (-1 == vsnprintf(buf, sizeof(buf), fmt, ap)) |
|
err(1, "vsnprintf"); |
|
va_end(ap); |
|
|
|
return((*tree->cb.roffmsg) |
if (0 != r->control && cp[pos] == r->control) |
(tree->arg, ROFF_ERROR, tree->cur, pos, buf)); |
pos++; |
} |
else if (0 != r->control) |
|
return(0); |
|
else if ('\\' == cp[pos] && '.' == cp[pos + 1]) |
|
pos += 2; |
|
else if ('.' == cp[pos] || '\'' == cp[pos]) |
|
pos++; |
|
else |
|
return(0); |
|
|
|
while (' ' == cp[pos] || '\t' == cp[pos]) |
|
pos++; |
|
|
|
*ppos = pos; |
|
return(1); |
|
} |