version 1.93, 2010/07/04 22:04:04 |
version 1.240, 2014/12/15 23:43:26 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2010-2014 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
* copyright notice and this permission notice appear in all copies. |
* copyright notice and this permission notice appear in all copies. |
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
#include "config.h" |
#endif |
|
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <errno.h> |
|
#include <ctype.h> |
#include <ctype.h> |
#include <limits.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <stdio.h> |
|
|
|
#include "mandoc.h" |
#include "mandoc.h" |
#include "regs.h" |
#include "mandoc_aux.h" |
#include "roff.h" |
#include "libmandoc.h" |
|
#include "libroff.h" |
|
|
|
/* Maximum number of nested if-else conditionals. */ |
#define RSTACK_MAX 128 |
#define RSTACK_MAX 128 |
|
|
#define ROFF_CTL(c) \ |
/* Maximum number of string expansions per line, to break infinite loops. */ |
('.' == (c) || '\'' == (c)) |
#define EXPAND_LIMIT 1000 |
|
|
#if 1 |
|
#define ROFF_DEBUG(fmt, args...) \ |
|
do { /* Nothing. */ } while (/*CONSTCOND*/ 0) |
|
#else |
|
#define ROFF_DEBUG(fmt, args...) \ |
|
do { fprintf(stderr, fmt , ##args); } while (/*CONSTCOND*/ 0) |
|
#endif |
|
|
|
enum rofft { |
enum rofft { |
|
ROFF_ad, |
ROFF_am, |
ROFF_am, |
ROFF_ami, |
ROFF_ami, |
ROFF_am1, |
ROFF_am1, |
|
ROFF_as, |
|
ROFF_cc, |
|
ROFF_ce, |
ROFF_de, |
ROFF_de, |
ROFF_dei, |
ROFF_dei, |
ROFF_de1, |
ROFF_de1, |
ROFF_ds, |
ROFF_ds, |
ROFF_el, |
ROFF_el, |
|
ROFF_fam, |
|
ROFF_hw, |
|
ROFF_hy, |
ROFF_ie, |
ROFF_ie, |
ROFF_if, |
ROFF_if, |
ROFF_ig, |
ROFF_ig, |
|
ROFF_it, |
|
ROFF_ne, |
|
ROFF_nh, |
|
ROFF_nr, |
|
ROFF_ns, |
|
ROFF_pl, |
|
ROFF_ps, |
ROFF_rm, |
ROFF_rm, |
|
ROFF_rr, |
|
ROFF_so, |
|
ROFF_ta, |
ROFF_tr, |
ROFF_tr, |
|
ROFF_Dd, |
|
ROFF_TH, |
|
ROFF_TS, |
|
ROFF_TE, |
|
ROFF_T_, |
|
ROFF_EQ, |
|
ROFF_EN, |
ROFF_cblock, |
ROFF_cblock, |
ROFF_ccond, |
ROFF_USERDEF, |
ROFF_nr, |
|
ROFF_MAX |
ROFF_MAX |
}; |
}; |
|
|
enum roffrule { |
/* |
ROFFRULE_ALLOW, |
* An incredibly-simple string buffer. |
ROFFRULE_DENY |
*/ |
|
struct roffstr { |
|
char *p; /* nil-terminated buffer */ |
|
size_t sz; /* saved strlen(p) */ |
}; |
}; |
|
|
|
/* |
|
* A key-value roffstr pair as part of a singly-linked list. |
|
*/ |
|
struct roffkv { |
|
struct roffstr key; |
|
struct roffstr val; |
|
struct roffkv *next; /* next in list */ |
|
}; |
|
|
|
/* |
|
* A single number register as part of a singly-linked list. |
|
*/ |
|
struct roffreg { |
|
struct roffstr key; |
|
int val; |
|
struct roffreg *next; |
|
}; |
|
|
struct roff { |
struct roff { |
|
struct mparse *parse; /* parse point */ |
|
const struct mchars *mchars; /* character table */ |
struct roffnode *last; /* leaf of stack */ |
struct roffnode *last; /* leaf of stack */ |
mandocmsg msg; /* err/warn/fatal messages */ |
int *rstack; /* stack of inverted `ie' values */ |
void *data; /* privdata for messages */ |
struct roffreg *regtab; /* number registers */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
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 eqn_inline; /* current equation is inline */ |
|
int options; /* parse options */ |
|
int rstacksz; /* current size limit of rstack */ |
int rstackpos; /* position in rstack */ |
int rstackpos; /* position in rstack */ |
struct regset *regs; /* read/writable registers */ |
int format; /* current file in mdoc or man format */ |
|
char control; /* control character */ |
}; |
}; |
|
|
struct roffnode { |
struct roffnode { |
Line 83 struct roffnode { |
|
Line 134 struct roffnode { |
|
struct roffnode *parent; /* up one in stack */ |
struct roffnode *parent; /* up one in stack */ |
int line; /* parse line */ |
int line; /* parse line */ |
int col; /* parse col */ |
int col; /* parse col */ |
|
char *name; /* node name, e.g. macro name */ |
char *end; /* end-rules: custom token */ |
char *end; /* end-rules: custom token */ |
int endspan; /* end-rules: next-line or infty */ |
int endspan; /* end-rules: next-line or infty */ |
enum roffrule rule; /* current evaluation rule */ |
int rule; /* current evaluation rule */ |
}; |
}; |
|
|
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
enum rofft tok, /* tok of macro */ \ |
enum rofft tok, /* tok of macro */ \ |
char **bufp, /* input buffer */ \ |
struct buf *buf, /* input buffer */ \ |
size_t *szp, /* size of input buffer */ \ |
|
int ln, /* parse line */ \ |
int ln, /* parse line */ \ |
int ppos, /* original pos in buffer */ \ |
int ppos, /* original pos in buffer */ \ |
int pos, /* current pos in buffer */ \ |
int pos, /* current pos in buffer */ \ |
Line 109 struct roffmac { |
|
Line 160 struct roffmac { |
|
struct roffmac *next; |
struct roffmac *next; |
}; |
}; |
|
|
struct roffstr { |
struct predef { |
char *name; |
const char *name; /* predefined input name */ |
char *string; |
const char *str; /* replacement symbol */ |
struct roffstr *next; |
}; |
} *first_string; |
|
|
|
|
#define PREDEF(__name, __str) \ |
|
{ (__name), (__str) }, |
|
|
|
static enum rofft roffhash_find(const char *, size_t); |
|
static void roffhash_init(void); |
|
static void roffnode_cleanscope(struct roff *); |
|
static void roffnode_pop(struct roff *); |
|
static void roffnode_push(struct roff *, enum rofft, |
|
const char *, int, int); |
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
static enum rofferr roff_cblock(ROFF_ARGS); |
static enum rofferr roff_cblock(ROFF_ARGS); |
static enum rofferr roff_ccond(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(ROFF_ARGS); |
static enum rofferr roff_cond_text(ROFF_ARGS); |
static enum rofferr roff_cond_text(ROFF_ARGS); |
static enum rofferr roff_cond_sub(ROFF_ARGS); |
static enum rofferr roff_cond_sub(ROFF_ARGS); |
static enum rofferr roff_ds(ROFF_ARGS); |
static enum rofferr roff_ds(ROFF_ARGS); |
static enum rofferr roff_line(ROFF_ARGS); |
static enum rofferr roff_eqndelim(struct roff *, struct buf *, int); |
|
static int roff_evalcond(struct roff *r, int, |
|
const char *, int *); |
|
static int roff_evalnum(struct roff *, int, |
|
const char *, int *, int *, int); |
|
static int roff_evalpar(struct roff *, int, |
|
const char *, int *, int *); |
|
static int roff_evalstrcond(const char *, int *); |
|
static void roff_free1(struct roff *); |
|
static void roff_freereg(struct roffreg *); |
|
static void roff_freestr(struct roffkv *); |
|
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 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 enum rofferr roff_nr(ROFF_ARGS); |
static enum roffrule roff_evalcond(const char *, int *); |
static enum rofft roff_parse(struct roff *, char *, int *, |
|
int, int); |
|
static enum rofferr roff_parsetext(struct buf *, int, int *); |
|
static enum rofferr roff_res(struct roff *, struct buf *, 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); |
|
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); |
|
|
/* See roff_hash_find() */ |
/* See roffhash_find() */ |
|
|
#define ASCII_HI 126 |
#define ASCII_HI 126 |
#define ASCII_LO 33 |
#define ASCII_LO 33 |
Line 137 static enum roffrule roff_evalcond(const char *, int |
|
Line 236 static enum roffrule roff_evalcond(const char *, int |
|
static struct roffmac *hash[HASHWIDTH]; |
static struct roffmac *hash[HASHWIDTH]; |
|
|
static struct roffmac roffs[ROFF_MAX] = { |
static struct roffmac roffs[ROFF_MAX] = { |
|
{ "ad", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "as", roff_ds, NULL, NULL, 0, NULL }, |
|
{ "cc", roff_cc, NULL, NULL, 0, NULL }, |
|
{ "ce", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "fam", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "hw", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "hy", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "rm", roff_line, NULL, NULL, 0, NULL }, |
{ "it", roff_it, NULL, NULL, 0, NULL }, |
{ "tr", roff_line, NULL, NULL, 0, NULL }, |
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, |
|
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
|
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
|
{ "pl", 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 }, |
|
{ "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 }, |
}; |
}; |
|
|
static void roff_free1(struct roff *); |
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ |
static enum rofft roff_hash_find(const char *); |
const char *const __mdoc_reserved[] = { |
static void roff_hash_init(void); |
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
static void roffnode_cleanscope(struct roff *); |
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
static int roffnode_push(struct roff *, |
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
enum rofft, int, int); |
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
static void roffnode_pop(struct roff *); |
"Dt", "Dv", "Dx", "D1", |
static enum rofft roff_parse(const char *, int *); |
"Ec", "Ed", "Ef", "Ek", "El", "Em", |
static int roff_parse_nat(const char *, unsigned int *); |
"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 |
|
}; |
|
|
/* See roff_hash_find() */ |
/* 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" |
|
}; |
|
|
|
/* See roffhash_find() */ |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
|
|
|
static int roffit_lines; /* number of lines to delay */ |
|
static char *roffit_macro; /* nil-terminated macro line */ |
|
|
|
|
static void |
static void |
roff_hash_init(void) |
roffhash_init(void) |
{ |
{ |
struct roffmac *n; |
struct roffmac *n; |
int buc, i; |
int buc, i; |
|
|
for (i = 0; i < (int)ROFF_MAX; i++) { |
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
assert(roffs[i].name[0] >= ASCII_LO); |
assert(roffs[i].name[0] >= ASCII_LO); |
assert(roffs[i].name[0] <= ASCII_HI); |
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
Line 189 roff_hash_init(void) |
|
Line 344 roff_hash_init(void) |
|
} |
} |
} |
} |
|
|
|
|
/* |
/* |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* the nil-terminated string name could be found. |
* the nil-terminated string name could be found. |
*/ |
*/ |
static enum rofft |
static enum rofft |
roff_hash_find(const char *p) |
roffhash_find(const char *p, size_t s) |
{ |
{ |
int buc; |
int buc; |
struct roffmac *n; |
struct roffmac *n; |
Line 215 roff_hash_find(const char *p) |
|
Line 369 roff_hash_find(const char *p) |
|
if (NULL == (n = hash[buc])) |
if (NULL == (n = hash[buc])) |
return(ROFF_MAX); |
return(ROFF_MAX); |
for ( ; n; n = n->next) |
for ( ; n; n = n->next) |
if (0 == strcmp(n->name, p)) |
if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s]) |
return((enum rofft)(n - roffs)); |
return((enum rofft)(n - roffs)); |
|
|
return(ROFF_MAX); |
return(ROFF_MAX); |
} |
} |
|
|
|
|
/* |
/* |
* Pop the current node off of the stack of roff instructions currently |
* Pop the current node off of the stack of roff instructions currently |
* pending. |
* pending. |
Line 232 roffnode_pop(struct roff *r) |
|
Line 385 roffnode_pop(struct roff *r) |
|
struct roffnode *p; |
struct roffnode *p; |
|
|
assert(r->last); |
assert(r->last); |
p = r->last; |
p = r->last; |
|
|
if (ROFF_el == p->tok) |
|
if (r->rstackpos > -1) |
|
r->rstackpos--; |
|
|
|
r->last = r->last->parent; |
r->last = r->last->parent; |
if (p->end) |
free(p->name); |
free(p->end); |
free(p->end); |
free(p); |
free(p); |
} |
} |
|
|
|
|
/* |
/* |
* Push a roff node onto the instruction stack. This must later be |
* Push a roff node onto the instruction stack. This must later be |
* removed with roffnode_pop(). |
* removed with roffnode_pop(). |
*/ |
*/ |
static int |
static void |
roffnode_push(struct roff *r, enum rofft tok, int line, int col) |
roffnode_push(struct roff *r, enum rofft tok, const char *name, |
|
int line, int col) |
{ |
{ |
struct roffnode *p; |
struct roffnode *p; |
|
|
if (NULL == (p = calloc(1, sizeof(struct roffnode)))) { |
p = mandoc_calloc(1, sizeof(struct roffnode)); |
(*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL); |
|
return(0); |
|
} |
|
|
|
p->tok = tok; |
p->tok = tok; |
|
if (name) |
|
p->name = mandoc_strdup(name); |
p->parent = r->last; |
p->parent = r->last; |
p->line = line; |
p->line = line; |
p->col = col; |
p->col = col; |
p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY; |
p->rule = p->parent ? p->parent->rule : 0; |
|
|
r->last = p; |
r->last = p; |
return(1); |
|
} |
} |
|
|
|
|
static void |
static void |
roff_free1(struct roff *r) |
roff_free1(struct roff *r) |
{ |
{ |
|
struct tbl_node *tbl; |
|
struct eqn_node *e; |
|
int i; |
|
|
|
while (NULL != (tbl = r->first_tbl)) { |
|
r->first_tbl = tbl->next; |
|
tbl_free(tbl); |
|
} |
|
r->first_tbl = r->last_tbl = r->tbl = NULL; |
|
|
|
while (NULL != (e = r->first_eqn)) { |
|
r->first_eqn = e->next; |
|
eqn_free(e); |
|
} |
|
r->first_eqn = r->last_eqn = r->eqn = NULL; |
|
|
while (r->last) |
while (r->last) |
roffnode_pop(r); |
roffnode_pop(r); |
roff_freestr(); |
|
} |
|
|
|
|
free (r->rstack); |
|
r->rstack = NULL; |
|
r->rstacksz = 0; |
|
r->rstackpos = -1; |
|
|
|
roff_freereg(r->regtab); |
|
r->regtab = NULL; |
|
|
|
roff_freestr(r->strtab); |
|
roff_freestr(r->xmbtab); |
|
r->strtab = r->xmbtab = NULL; |
|
|
|
if (r->xtab) |
|
for (i = 0; i < 128; i++) |
|
free(r->xtab[i].p); |
|
free(r->xtab); |
|
r->xtab = NULL; |
|
} |
|
|
void |
void |
roff_reset(struct roff *r) |
roff_reset(struct roff *r) |
{ |
{ |
|
|
roff_free1(r); |
roff_free1(r); |
|
r->format = r->options & (MPARSE_MDOC | MPARSE_MAN); |
|
r->control = 0; |
} |
} |
|
|
|
|
void |
void |
roff_free(struct roff *r) |
roff_free(struct roff *r) |
{ |
{ |
Line 296 roff_free(struct roff *r) |
|
Line 473 roff_free(struct roff *r) |
|
free(r); |
free(r); |
} |
} |
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(struct regset *regs, const mandocmsg msg, void *data) |
roff_alloc(struct mparse *parse, const struct mchars *mchars, int options) |
{ |
{ |
struct roff *r; |
struct roff *r; |
|
|
if (NULL == (r = calloc(1, sizeof(struct roff)))) { |
r = mandoc_calloc(1, sizeof(struct roff)); |
(*msg)(MANDOCERR_MEM, data, 0, 0, NULL); |
r->parse = parse; |
return(0); |
r->mchars = mchars; |
} |
r->options = options; |
|
r->format = options & (MPARSE_MDOC | MPARSE_MAN); |
r->regs = regs; |
|
r->msg = msg; |
|
r->data = data; |
|
r->rstackpos = -1; |
r->rstackpos = -1; |
|
|
roff_hash_init(); |
roffhash_init(); |
|
|
return(r); |
return(r); |
} |
} |
|
|
|
/* |
|
* In the current line, expand escape sequences that tend to get |
|
* used in numerical expressions and conditional requests. |
|
* Also check the syntax of the remaining escape sequences. |
|
*/ |
|
static enum rofferr |
|
roff_res(struct roff *r, struct buf *buf, int ln, int pos) |
|
{ |
|
char ubuf[24]; /* buffer to print the number */ |
|
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 buf->buf to */ |
|
size_t maxl; /* expected length of the escape name */ |
|
size_t naml; /* actual length of the escape name */ |
|
enum mandoc_esc esc; /* type of the escape sequence */ |
|
int inaml; /* length returned from mandoc_escape() */ |
|
int expand_count; /* to avoid infinite loops */ |
|
int npos; /* position in numeric expression */ |
|
int arg_complete; /* argument not interrupted by eol */ |
|
char term; /* character terminating the escape */ |
|
|
|
expand_count = 0; |
|
start = buf->buf + pos; |
|
stesc = strchr(start, '\0') - 1; |
|
while (stesc-- > start) { |
|
|
|
/* Search backwards for the next backslash. */ |
|
|
|
if (*stesc != '\\') |
|
continue; |
|
|
|
/* If it is escaped, skip it. */ |
|
|
|
for (cp = stesc - 1; cp >= start; cp--) |
|
if (*cp != '\\') |
|
break; |
|
|
|
if ((stesc - cp) % 2 == 0) { |
|
stesc = (char *)cp; |
|
continue; |
|
} |
|
|
|
/* Decide whether to expand or to check only. */ |
|
|
|
term = '\0'; |
|
cp = stesc + 1; |
|
switch (*cp) { |
|
case '*': |
|
res = NULL; |
|
break; |
|
case 'B': |
|
/* FALLTHROUGH */ |
|
case 'w': |
|
term = cp[1]; |
|
/* FALLTHROUGH */ |
|
case 'n': |
|
res = ubuf; |
|
break; |
|
default: |
|
esc = mandoc_escape(&cp, &stnam, &inaml); |
|
if (esc == ESCAPE_ERROR || |
|
(esc == ESCAPE_SPECIAL && |
|
mchars_spec2cp(r->mchars, stnam, inaml) < 0)) |
|
mandoc_vmsg(MANDOCERR_ESC_BAD, |
|
r->parse, ln, (int)(stesc - buf->buf), |
|
"%.*s", (int)(cp - stesc), stesc); |
|
continue; |
|
} |
|
|
|
if (EXPAND_LIMIT < ++expand_count) { |
|
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, |
|
ln, (int)(stesc - buf->buf), NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* |
|
* The third character decides the length |
|
* of the name of the string or register. |
|
* Save a pointer to the name. |
|
*/ |
|
|
|
if (term == '\0') { |
|
switch (*++cp) { |
|
case '\0': |
|
maxl = 0; |
|
break; |
|
case '(': |
|
cp++; |
|
maxl = 2; |
|
break; |
|
case '[': |
|
cp++; |
|
term = ']'; |
|
maxl = 0; |
|
break; |
|
default: |
|
maxl = 1; |
|
break; |
|
} |
|
} else { |
|
cp += 2; |
|
maxl = 0; |
|
} |
|
stnam = cp; |
|
|
|
/* Advance to the end of the name. */ |
|
|
|
arg_complete = 1; |
|
for (naml = 0; maxl == 0 || naml < maxl; naml++, cp++) { |
|
if (*cp == '\0') { |
|
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
|
ln, (int)(stesc - buf->buf), stesc); |
|
arg_complete = 0; |
|
break; |
|
} |
|
if (maxl == 0 && *cp == term) { |
|
cp++; |
|
break; |
|
} |
|
} |
|
|
|
/* |
|
* Retrieve the replacement string; if it is |
|
* undefined, resume searching for escapes. |
|
*/ |
|
|
|
switch (stesc[1]) { |
|
case '*': |
|
if (arg_complete) |
|
res = roff_getstrn(r, stnam, naml); |
|
break; |
|
case 'B': |
|
npos = 0; |
|
ubuf[0] = arg_complete && |
|
roff_evalnum(r, ln, stnam, &npos, NULL, 0) && |
|
stnam + npos + 1 == cp ? '1' : '0'; |
|
ubuf[1] = '\0'; |
|
break; |
|
case 'n': |
|
if (arg_complete) |
|
(void)snprintf(ubuf, sizeof(ubuf), "%d", |
|
roff_getregn(r, stnam, naml)); |
|
else |
|
ubuf[0] = '\0'; |
|
break; |
|
case 'w': |
|
/* use even incomplete args */ |
|
(void)snprintf(ubuf, sizeof(ubuf), "%d", |
|
24 * (int)naml); |
|
break; |
|
} |
|
|
|
if (res == NULL) { |
|
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
|
r->parse, ln, (int)(stesc - buf->buf), |
|
"%.*s", (int)naml, stnam); |
|
res = ""; |
|
} |
|
|
|
/* Replace the escape sequence by the string. */ |
|
|
|
*stesc = '\0'; |
|
buf->sz = mandoc_asprintf(&nbuf, "%s%s%s", |
|
buf->buf, res, cp) + 1; |
|
|
|
/* Prepare for the next replacement. */ |
|
|
|
start = nbuf + pos; |
|
stesc = nbuf + (stesc - buf->buf) + strlen(res); |
|
free(buf->buf); |
|
buf->buf = nbuf; |
|
} |
|
return(ROFF_CONT); |
|
} |
|
|
|
/* |
|
* Process text streams: |
|
* Convert all breakable hyphens into ASCII_HYPH. |
|
* Decrement and spring input line trap. |
|
*/ |
|
static enum rofferr |
|
roff_parsetext(struct buf *buf, int pos, int *offs) |
|
{ |
|
size_t sz; |
|
const char *start; |
|
char *p; |
|
int isz; |
|
enum mandoc_esc esc; |
|
|
|
start = p = buf->buf + pos; |
|
|
|
while (*p != '\0') { |
|
sz = strcspn(p, "-\\"); |
|
p += sz; |
|
|
|
if (*p == '\0') |
|
break; |
|
|
|
if (*p == '\\') { |
|
/* Skip over escapes. */ |
|
p++; |
|
esc = mandoc_escape((const char **)&p, NULL, NULL); |
|
if (esc == ESCAPE_ERROR) |
|
break; |
|
continue; |
|
} else if (p == start) { |
|
p++; |
|
continue; |
|
} |
|
|
|
if (isalpha((unsigned char)p[-1]) && |
|
isalpha((unsigned char)p[1])) |
|
*p = ASCII_HYPH; |
|
p++; |
|
} |
|
|
|
/* Spring the input line trap. */ |
|
if (roffit_lines == 1) { |
|
isz = mandoc_asprintf(&p, "%s\n.%s", buf->buf, roffit_macro); |
|
free(buf->buf); |
|
buf->buf = p; |
|
buf->sz = isz + 1; |
|
*offs = 0; |
|
free(roffit_macro); |
|
roffit_lines = 0; |
|
return(ROFF_REPARSE); |
|
} else if (roffit_lines > 1) |
|
--roffit_lines; |
|
return(ROFF_CONT); |
|
} |
|
|
enum rofferr |
enum rofferr |
roff_parseln(struct roff *r, int ln, char **bufp, |
roff_parseln(struct roff *r, int ln, struct buf *buf, int *offs) |
size_t *szp, int pos, int *offs) |
|
{ |
{ |
enum rofft t; |
enum rofft t; |
int ppos; |
enum rofferr e; |
|
int pos; /* parse point */ |
|
int ppos; /* original offset in buf->buf */ |
|
int ctl; /* macro line (boolean) */ |
|
|
|
ppos = pos = *offs; |
|
|
|
/* Handle in-line equation delimiters. */ |
|
|
|
if (r->tbl == NULL && |
|
r->last_eqn != NULL && r->last_eqn->delim && |
|
(r->eqn == NULL || r->eqn_inline)) { |
|
e = roff_eqndelim(r, buf, pos); |
|
if (e == ROFF_REPARSE) |
|
return(e); |
|
assert(e == ROFF_CONT); |
|
} |
|
|
|
/* Expand some escape sequences. */ |
|
|
|
e = roff_res(r, buf, ln, pos); |
|
if (e == ROFF_IGN) |
|
return(e); |
|
assert(e == ROFF_CONT); |
|
|
|
ctl = roff_getcontrol(r, buf->buf, &pos); |
|
|
/* |
/* |
* First, if a scope is open and we're not a macro, pass the |
* First, if a scope is open and we're not a macro, pass the |
* text through the macro's filter. If a scope isn't open and |
* text through the macro's filter. If a scope isn't open and |
* we're not a macro, just let it through. |
* we're not a macro, just let it through. |
|
* Finally, if there's an equation scope open, divert it into it |
|
* no matter our state. |
*/ |
*/ |
|
|
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
if (r->last && ! ctl) { |
t = r->last->tok; |
t = r->last->tok; |
assert(roffs[t].text); |
assert(roffs[t].text); |
ROFF_DEBUG("roff: intercept scoped text: %s, [%s]\n", |
e = (*roffs[t].text)(r, t, buf, ln, pos, pos, offs); |
roffs[t].name, &(*bufp)[pos]); |
assert(e == ROFF_IGN || e == ROFF_CONT); |
return((*roffs[t].text) |
if (e != ROFF_CONT) |
(r, t, bufp, szp, |
return(e); |
ln, pos, pos, offs)); |
|
} else if ( ! ROFF_CTL((*bufp)[pos])) { |
|
ROFF_DEBUG("roff: pass non-scoped text: [%s]\n", |
|
&(*bufp)[pos]); |
|
return(ROFF_CONT); |
|
} |
} |
|
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, buf->buf, ppos, offs)); |
|
if ( ! ctl) { |
|
if (r->tbl) |
|
return(tbl_read(r->tbl, ln, buf->buf, pos)); |
|
return(roff_parsetext(buf, pos, offs)); |
|
} |
|
|
|
/* Skip empty request lines. */ |
|
|
|
if (buf->buf[pos] == '"') { |
|
mandoc_msg(MANDOCERR_COMMENT_BAD, r->parse, |
|
ln, pos, NULL); |
|
return(ROFF_IGN); |
|
} else if (buf->buf[pos] == '\0') |
|
return(ROFF_IGN); |
|
|
/* |
/* |
* If a scope is open, go to the child handler for that macro, |
* If a scope is open, go to the child handler for that macro, |
* as it may want to preprocess before doing anything with it. |
* as it may want to preprocess before doing anything with it. |
|
* Don't do so if an equation is open. |
*/ |
*/ |
|
|
if (r->last) { |
if (r->last) { |
t = r->last->tok; |
t = r->last->tok; |
assert(roffs[t].sub); |
assert(roffs[t].sub); |
ROFF_DEBUG("roff: intercept scoped context: %s\n", |
return((*roffs[t].sub)(r, t, buf, ln, ppos, pos, offs)); |
roffs[t].name); |
|
return((*roffs[t].sub) |
|
(r, t, bufp, szp, |
|
ln, pos, pos, offs)); |
|
} |
} |
|
|
/* |
/* |
Line 365 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 806 roff_parseln(struct roff *r, int ln, char **bufp, |
|
* the compilers handle it. |
* the compilers handle it. |
*/ |
*/ |
|
|
ppos = pos; |
if ((t = roff_parse(r, buf->buf, &pos, ln, ppos)) == ROFF_MAX) |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) { |
|
ROFF_DEBUG("roff: pass non-scoped non-macro: [%s]\n", |
|
&(*bufp)[pos]); |
|
return(ROFF_CONT); |
return(ROFF_CONT); |
} |
|
|
|
ROFF_DEBUG("roff: intercept new-scope: %s, [%s]\n", |
|
roffs[t].name, &(*bufp)[pos]); |
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc) |
return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); |
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
|
} |
} |
|
|
|
void |
int |
|
roff_endparse(struct roff *r) |
roff_endparse(struct roff *r) |
{ |
{ |
|
|
if (NULL == r->last) |
if (r->last) |
return(1); |
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, |
r->last->line, r->last->col, |
r->last->col, NULL)); |
roffs[r->last->tok].name); |
} |
|
|
|
|
if (r->eqn) { |
|
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
|
r->eqn->eqn.ln, r->eqn->eqn.pos, "EQ"); |
|
eqn_end(&r->eqn); |
|
} |
|
|
|
if (r->tbl) { |
|
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
|
r->tbl->line, r->tbl->pos, "TS"); |
|
tbl_end(&r->tbl); |
|
} |
|
} |
|
|
/* |
/* |
* Parse a roff node's type from the input buffer. This must be in the |
* Parse a roff node's type from the input buffer. This must be in the |
* form of ".foo xxx" in the usual way. |
* form of ".foo xxx" in the usual way. |
*/ |
*/ |
static enum rofft |
static enum rofft |
roff_parse(const char *buf, int *pos) |
roff_parse(struct roff *r, char *buf, int *pos, int ln, int ppos) |
{ |
{ |
int j; |
char *cp; |
char mac[5]; |
const char *mac; |
|
size_t maclen; |
enum rofft t; |
enum rofft t; |
|
|
assert(ROFF_CTL(buf[*pos])); |
cp = buf + *pos; |
(*pos)++; |
|
|
|
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
if ('\0' == *cp || '"' == *cp || '\t' == *cp || ' ' == *cp) |
(*pos)++; |
|
|
|
if ('\0' == buf[*pos]) |
|
return(ROFF_MAX); |
return(ROFF_MAX); |
|
|
for (j = 0; j < 4; j++, (*pos)++) |
mac = cp; |
if ('\0' == (mac[j] = buf[*pos])) |
maclen = roff_getname(r, &cp, ln, ppos); |
break; |
|
else if (' ' == buf[*pos] || (j && '\\' == buf[*pos])) |
|
break; |
|
|
|
if (j == 4 || j < 1) |
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
return(ROFF_MAX); |
? ROFF_USERDEF : roffhash_find(mac, maclen); |
|
|
mac[j] = '\0'; |
if (ROFF_MAX != t) |
|
*pos = cp - buf; |
|
|
if (ROFF_MAX == (t = roff_hash_find(mac))) |
|
return(t); |
|
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
|
(*pos)++; |
|
|
|
return(t); |
return(t); |
} |
} |
|
|
|
|
static int |
|
roff_parse_nat(const char *buf, unsigned int *res) |
|
{ |
|
char *ep; |
|
long lval; |
|
|
|
errno = 0; |
|
lval = strtol(buf, &ep, 10); |
|
if (buf[0] == '\0' || *ep != '\0') |
|
return(0); |
|
if ((errno == ERANGE && |
|
(lval == LONG_MAX || lval == LONG_MIN)) || |
|
(lval > INT_MAX || lval < 0)) |
|
return(0); |
|
|
|
*res = (unsigned int)lval; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_cblock(ROFF_ARGS) |
roff_cblock(ROFF_ARGS) |
{ |
{ |
Line 463 roff_cblock(ROFF_ARGS) |
|
Line 873 roff_cblock(ROFF_ARGS) |
|
* ignore macro, otherwise raise a warning and just ignore it. |
* ignore macro, otherwise raise a warning and just ignore it. |
*/ |
*/ |
|
|
if (NULL == r->last) { |
if (r->last == NULL) { |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
return(ROFF_ERR); |
ln, ppos, ".."); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
switch (r->last->tok) { |
switch (r->last->tok) { |
case (ROFF_am): |
case ROFF_am: |
|
/* ROFF_am1 is remapped to ROFF_am in roff_block(). */ |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_ami): |
case ROFF_ami: |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_am1): |
case ROFF_de: |
|
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_de): |
case ROFF_dei: |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_dei): |
case ROFF_ig: |
/* FALLTHROUGH */ |
|
case (ROFF_de1): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ig): |
|
break; |
break; |
default: |
default: |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
return(ROFF_ERR); |
ln, ppos, ".."); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
if ((*bufp)[pos]) |
if (buf->buf[pos] != '\0') |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, |
return(ROFF_ERR); |
".. %s", buf->buf + pos); |
|
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
Line 500 roff_cblock(ROFF_ARGS) |
|
Line 908 roff_cblock(ROFF_ARGS) |
|
|
|
} |
} |
|
|
|
|
static void |
static void |
roffnode_cleanscope(struct roff *r) |
roffnode_cleanscope(struct roff *r) |
{ |
{ |
|
|
while (r->last) { |
while (r->last) { |
if (--r->last->endspan < 0) |
if (--r->last->endspan != 0) |
break; |
break; |
roffnode_pop(r); |
roffnode_pop(r); |
} |
} |
} |
} |
|
|
|
static void |
/* ARGSUSED */ |
roff_ccond(struct roff *r, int ln, int ppos) |
static enum rofferr |
|
roff_ccond(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->last) { |
if (NULL == r->last) { |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
return(ROFF_ERR); |
ln, ppos, "\\}"); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
switch (r->last->tok) { |
switch (r->last->tok) { |
case (ROFF_el): |
case ROFF_el: |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_ie): |
case ROFF_ie: |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (ROFF_if): |
case ROFF_if: |
break; |
break; |
default: |
default: |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
return(ROFF_ERR); |
ln, ppos, "\\}"); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
if (r->last->endspan > -1) { |
if (r->last->endspan > -1) { |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
return(ROFF_ERR); |
ln, ppos, "\\}"); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
if ((*bufp)[pos]) |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
|
return(ROFF_ERR); |
|
|
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_block(ROFF_ARGS) |
roff_block(ROFF_ARGS) |
{ |
{ |
int sv; |
const char *name; |
size_t sz; |
char *iname, *cp; |
|
size_t namesz; |
|
|
if (ROFF_ig != tok && '\0' == (*bufp)[pos]) { |
/* Ignore groff compatibility mode for now. */ |
if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
if (tok == ROFF_de1) |
return(ROFF_IGN); |
tok = ROFF_de; |
} else if (ROFF_ig != tok) { |
else if (tok == ROFF_am1) |
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
tok = ROFF_am; |
pos++; |
|
while (' ' == (*bufp)[pos]) |
/* Parse the macro name argument. */ |
pos++; |
|
|
cp = buf->buf + pos; |
|
if (tok == ROFF_ig) { |
|
iname = NULL; |
|
namesz = 0; |
|
} else { |
|
iname = cp; |
|
namesz = roff_getname(r, &cp, ln, ppos); |
|
iname[namesz] = '\0'; |
} |
} |
|
|
if ( ! roffnode_push(r, tok, ln, ppos)) |
/* Resolve the macro name argument if it is indirect. */ |
return(ROFF_ERR); |
|
|
|
if ('\0' == (*bufp)[pos]) |
if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { |
|
if ((name = roff_getstrn(r, iname, namesz)) == NULL) { |
|
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
|
r->parse, ln, (int)(iname - buf->buf), |
|
"%.*s", (int)namesz, iname); |
|
namesz = 0; |
|
} else |
|
namesz = strlen(name); |
|
} else |
|
name = iname; |
|
|
|
if (namesz == 0 && tok != ROFF_ig) { |
|
mandoc_msg(MANDOCERR_REQ_EMPTY, r->parse, |
|
ln, ppos, roffs[tok].name); |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
} |
|
|
sv = pos; |
roffnode_push(r, tok, name, ln, ppos); |
while ((*bufp)[pos] && ' ' != (*bufp)[pos] && |
|
'\t' != (*bufp)[pos]) |
|
pos++; |
|
|
|
/* |
/* |
* Note: groff does NOT like escape characters in the input. |
* At the beginning of a `de' macro, clear the existing string |
* Instead of detecting this, we're just going to let it fly and |
* with the same name, if there is one. New content will be |
* to hell with it. |
* appended from roff_block_text() in multiline mode. |
*/ |
*/ |
|
|
assert(pos > sv); |
if (tok == ROFF_de || tok == ROFF_dei) |
sz = (size_t)(pos - sv); |
roff_setstrn(&r->strtab, name, namesz, "", 0, 0); |
|
|
if (1 == sz && '.' == (*bufp)[sv]) |
if (*cp == '\0') |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
r->last->end = malloc(sz + 1); |
/* Get the custom end marker. */ |
|
|
if (NULL == r->last->end) { |
iname = cp; |
(*r->msg)(MANDOCERR_MEM, r->data, ln, pos, NULL); |
namesz = roff_getname(r, &cp, ln, ppos); |
return(ROFF_ERR); |
|
} |
|
|
|
memcpy(r->last->end, *bufp + sv, sz); |
/* Resolve the end marker if it is indirect. */ |
r->last->end[(int)sz] = '\0'; |
|
|
|
if ((*bufp)[pos]) |
if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
if ((name = roff_getstrn(r, iname, namesz)) == NULL) { |
return(ROFF_ERR); |
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
|
r->parse, ln, (int)(iname - buf->buf), |
|
"%.*s", (int)namesz, iname); |
|
namesz = 0; |
|
} else |
|
namesz = strlen(name); |
|
} else |
|
name = iname; |
|
|
|
if (namesz) |
|
r->last->end = mandoc_strndup(name, namesz); |
|
|
|
if (*cp != '\0') |
|
mandoc_vmsg(MANDOCERR_ARG_EXCESS, r->parse, |
|
ln, pos, ".%s ... %s", roffs[tok].name, cp); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_block_sub(ROFF_ARGS) |
roff_block_sub(ROFF_ARGS) |
{ |
{ |
Line 629 roff_block_sub(ROFF_ARGS) |
|
Line 1056 roff_block_sub(ROFF_ARGS) |
|
*/ |
*/ |
|
|
if (r->last->end) { |
if (r->last->end) { |
i = pos + 1; |
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
if (buf->buf[i] != r->last->end[j]) |
i++; |
|
|
|
for (j = 0; r->last->end[j]; j++, i++) |
|
if ((*bufp)[i] != r->last->end[j]) |
|
break; |
break; |
|
|
if ('\0' == r->last->end[j] && |
if (r->last->end[j] == '\0' && |
('\0' == (*bufp)[i] || |
(buf->buf[i] == '\0' || |
' ' == (*bufp)[i] || |
buf->buf[i] == ' ' || |
'\t' == (*bufp)[i])) { |
buf->buf[i] == '\t')) { |
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
|
|
if (ROFF_MAX != roff_parse(*bufp, &pos)) |
while (buf->buf[i] == ' ' || buf->buf[i] == '\t') |
|
i++; |
|
|
|
pos = i; |
|
if (roff_parse(r, buf->buf, &pos, ln, ppos) != |
|
ROFF_MAX) |
return(ROFF_RERUN); |
return(ROFF_RERUN); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
Line 655 roff_block_sub(ROFF_ARGS) |
|
Line 1083 roff_block_sub(ROFF_ARGS) |
|
* pulling it out of the hashtable. |
* pulling it out of the hashtable. |
*/ |
*/ |
|
|
ppos = pos; |
t = roff_parse(r, buf->buf, &pos, ln, ppos); |
t = roff_parse(*bufp, &pos); |
|
|
|
/* If we're not a comment-end, then throw it away. */ |
if (t != ROFF_cblock) { |
if (ROFF_cblock != t) |
if (tok != ROFF_ig) |
|
roff_setstr(r, r->last->name, buf->buf + ppos, 2); |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
} |
|
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc)(r, t, bufp, szp, |
return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); |
ln, ppos, pos, offs)); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_block_text(ROFF_ARGS) |
roff_block_text(ROFF_ARGS) |
{ |
{ |
|
|
|
if (tok != ROFF_ig) |
|
roff_setstr(r, r->last->name, buf->buf + pos, 2); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_cond_sub(ROFF_ARGS) |
roff_cond_sub(ROFF_ARGS) |
{ |
{ |
enum rofft t; |
enum rofft t; |
enum roffrule rr; |
char *ep; |
struct roffnode *l; |
int rr; |
|
|
ppos = pos; |
|
rr = r->last->rule; |
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
t = roff_parse(r, buf->buf, &pos, ln, ppos); |
|
|
/* |
/* |
* Clean out scope. If we've closed ourselves, then don't |
* Fully handle known macros when they are structurally |
* continue. |
* required or when the conditional evaluated to true. |
*/ |
*/ |
|
|
l = r->last; |
if ((t != ROFF_MAX) && |
roffnode_cleanscope(r); |
(rr || roffs[t].flags & ROFFMAC_STRUCT)) { |
|
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs)); |
|
} |
|
|
if (l != r->last) |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
|
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
|
/* |
/* |
* A denied conditional must evaluate its children if and only |
* If `\}' occurs on a macro line without a preceding macro, |
* if they're either structurally required (such as loops and |
* drop the line completely. |
* conditionals) or a closing macro. |
|
*/ |
*/ |
if (ROFFRULE_DENY == rr) |
|
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
|
if (ROFF_ccond != t) |
|
return(ROFF_IGN); |
|
|
|
assert(roffs[t].proc); |
ep = buf->buf + pos; |
return((*roffs[t].proc)(r, t, bufp, szp, |
if (ep[0] == '\\' && ep[1] == '}') |
ln, ppos, pos, offs)); |
rr = 0; |
} |
|
|
|
|
/* Always check for the closing delimiter `\}'. */ |
|
|
/* ARGSUSED */ |
while ((ep = strchr(ep, '\\')) != NULL) { |
|
if (*(++ep) == '}') { |
|
*ep = '&'; |
|
roff_ccond(r, ln, ep - buf->buf - 1); |
|
} |
|
++ep; |
|
} |
|
return(rr ? ROFF_CONT : ROFF_IGN); |
|
} |
|
|
static enum rofferr |
static enum rofferr |
roff_cond_text(ROFF_ARGS) |
roff_cond_text(ROFF_ARGS) |
{ |
{ |
char *ep, *st; |
char *ep; |
enum roffrule rr; |
int rr; |
|
|
rr = r->last->rule; |
rr = r->last->rule; |
|
roffnode_cleanscope(r); |
|
|
/* |
ep = buf->buf + pos; |
* We display the value of the text if out current evaluation |
while ((ep = strchr(ep, '\\')) != NULL) { |
* scope permits us to do so. |
if (*(++ep) == '}') { |
*/ |
*ep = '&'; |
|
roff_ccond(r, ln, ep - buf->buf - 1); |
st = &(*bufp)[pos]; |
} |
if (NULL == (ep = strstr(st, "\\}"))) { |
++ep; |
roffnode_cleanscope(r); |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
} |
} |
|
return(rr ? ROFF_CONT : ROFF_IGN); |
|
} |
|
|
if (ep == st || (ep > st && '\\' != *(ep - 1))) |
/* |
roffnode_pop(r); |
* 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; |
|
|
roffnode_cleanscope(r); |
if (NULL == res) |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
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; |
|
|
static enum roffrule |
match = 0; |
roff_evalcond(const char *v, int *pos) |
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(struct roff *r, int ln, const char *v, int *pos) |
{ |
{ |
|
int wanttrue, number; |
|
|
|
if ('!' == v[*pos]) { |
|
wanttrue = 0; |
|
(*pos)++; |
|
} else |
|
wanttrue = 1; |
|
|
switch (v[*pos]) { |
switch (v[*pos]) { |
case ('n'): |
case '\0': |
|
return(0); |
|
case 'n': |
|
/* FALLTHROUGH */ |
|
case 'o': |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_ALLOW); |
return(wanttrue); |
case ('e'): |
case 'c': |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('o'): |
case 'd': |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('t'): |
case 'e': |
|
/* FALLTHROUGH */ |
|
case 'r': |
|
/* FALLTHROUGH */ |
|
case 't': |
|
/* FALLTHROUGH */ |
|
case 'v': |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_DENY); |
return(!wanttrue); |
default: |
default: |
break; |
break; |
} |
} |
|
|
while (v[*pos] && ' ' != v[*pos]) |
if (roff_evalnum(r, ln, v, pos, &number, 0)) |
(*pos)++; |
return((number > 0) == wanttrue); |
return(ROFFRULE_DENY); |
else |
|
return(roff_evalstrcond(v, pos) == wanttrue); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_line(ROFF_ARGS) |
roff_line_ignore(ROFF_ARGS) |
{ |
{ |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
static enum rofferr |
roff_cond(ROFF_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
int sv; |
|
enum roffrule rule; |
|
|
|
/* Stack overflow! */ |
roffnode_push(r, tok, NULL, ln, ppos); |
|
|
if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) { |
/* |
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
* An `.el' has no conditional body: it will consume the value |
return(ROFF_ERR); |
* 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. |
|
*/ |
|
|
/* First, evaluate the conditional. */ |
r->last->rule = tok == ROFF_el ? |
|
(r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(r, ln, buf->buf, &pos); |
|
|
if (ROFF_el == tok) { |
|
/* |
|
* An `.el' will get the value of the current rstack |
|
* entry set in prior `ie' calls or defaults to DENY. |
|
*/ |
|
if (r->rstackpos < 0) |
|
rule = ROFFRULE_DENY; |
|
else |
|
rule = r->rstack[r->rstackpos]; |
|
} else |
|
rule = roff_evalcond(*bufp, &pos); |
|
|
|
sv = pos; |
|
|
|
while (' ' == (*bufp)[pos]) |
|
pos++; |
|
|
|
/* |
/* |
* Roff is weird. If we have just white-space after the |
* An if-else will put the NEGATION of the current evaluated |
* conditional, it's considered the BODY and we exit without |
* conditional into the stack of rules. |
* really doing anything. Warn about this. It's probably |
|
* wrong. |
|
*/ |
*/ |
|
|
if ('\0' == (*bufp)[pos] && sv != pos) { |
if (tok == ROFF_ie) { |
if ((*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
if (r->rstackpos + 1 == r->rstacksz) { |
return(ROFF_IGN); |
r->rstacksz += 16; |
return(ROFF_ERR); |
r->rstack = mandoc_reallocarray(r->rstack, |
|
r->rstacksz, sizeof(int)); |
|
} |
|
r->rstack[++r->rstackpos] = !r->last->rule; |
} |
} |
|
|
if ( ! roffnode_push(r, tok, ln, ppos)) |
/* If the parent has false as its rule, then so do we. */ |
return(ROFF_ERR); |
|
|
|
r->last->rule = rule; |
if (r->last->parent && !r->last->parent->rule) |
|
r->last->rule = 0; |
|
|
ROFF_DEBUG("roff: cond: %s -> %s\n", roffs[tok].name, |
/* |
ROFFRULE_ALLOW == rule ? "allow" : "deny"); |
* Determine scope. |
|
* If there is nothing on the line after the conditional, |
|
* not even whitespace, use next-line scope. |
|
*/ |
|
|
if (ROFF_ie == tok) { |
if (buf->buf[pos] == '\0') { |
/* |
r->last->endspan = 2; |
* An if-else will put the NEGATION of the current |
goto out; |
* evaluated conditional into the stack. |
|
*/ |
|
r->rstackpos++; |
|
if (ROFFRULE_DENY == r->last->rule) |
|
r->rstack[r->rstackpos] = ROFFRULE_ALLOW; |
|
else |
|
r->rstack[r->rstackpos] = ROFFRULE_DENY; |
|
} |
} |
|
|
/* If the parent has false as its rule, then so do we. */ |
while (buf->buf[pos] == ' ') |
|
pos++; |
|
|
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) { |
/* An opening brace requests multiline scope. */ |
r->last->rule = ROFFRULE_DENY; |
|
ROFF_DEBUG("roff: cond override: %s -> deny\n", |
if (buf->buf[pos] == '\\' && buf->buf[pos + 1] == '{') { |
roffs[tok].name); |
r->last->endspan = -1; |
|
pos += 2; |
|
goto out; |
} |
} |
|
|
/* |
/* |
* Determine scope. If we're invoked with "\{" trailing the |
* Anything else following the conditional causes |
* conditional, then we're in a multiline scope. Else our scope |
* single-line scope. Warn if the scope contains |
* expires on the next line. |
* nothing but trailing whitespace. |
*/ |
*/ |
|
|
|
if (buf->buf[pos] == '\0') |
|
mandoc_msg(MANDOCERR_COND_EMPTY, r->parse, |
|
ln, ppos, roffs[tok].name); |
|
|
r->last->endspan = 1; |
r->last->endspan = 1; |
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
out: |
r->last->endspan = -1; |
*offs = pos; |
pos += 2; |
return(ROFF_RERUN); |
ROFF_DEBUG("roff: cond-scope: %s, multi-line\n", |
} |
roffs[tok].name); |
|
} else |
|
ROFF_DEBUG("roff: cond-scope: %s, one-line\n", |
|
roffs[tok].name); |
|
|
|
|
static enum rofferr |
|
roff_ds(ROFF_ARGS) |
|
{ |
|
char *string; |
|
const char *name; |
|
size_t namesz; |
|
|
/* |
/* |
* If there are no arguments on the line, the next-line scope is |
* The first word is the name of the string. |
* assumed. |
* If it is empty or terminated by an escape sequence, |
|
* abort the `ds' request without defining anything. |
*/ |
*/ |
|
|
if ('\0' == (*bufp)[pos]) |
name = string = buf->buf + pos; |
|
if (*name == '\0') |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
/* Otherwise re-run the roff parser after recalculating. */ |
namesz = roff_getname(r, &string, ln, pos); |
|
if (name[namesz] == '\\') |
|
return(ROFF_IGN); |
|
|
*offs = pos; |
/* Read past the initial double-quote, if any. */ |
return(ROFF_RERUN); |
if (*string == '"') |
|
string++; |
|
|
|
/* The rest is the value. */ |
|
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) |
|
{ |
|
|
/* ARGSUSED */ |
*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(struct roff *r, int ln, |
|
const char *v, int *pos, int *res) |
|
{ |
|
|
|
if ('(' != v[*pos]) |
|
return(roff_getnum(v, pos, res)); |
|
|
|
(*pos)++; |
|
if ( ! roff_evalnum(r, ln, v, pos, res, 1)) |
|
return(0); |
|
|
|
/* |
|
* Omission of the closing parenthesis |
|
* is an error in validation mode, |
|
* but ignored in evaluation mode. |
|
*/ |
|
|
|
if (')' == v[*pos]) |
|
(*pos)++; |
|
else if (NULL == res) |
|
return(0); |
|
|
|
return(1); |
|
} |
|
|
|
/* |
|
* Evaluate a complete numeric expression. |
|
* Proceed left to right, there is no concept of precedence. |
|
*/ |
|
static int |
|
roff_evalnum(struct roff *r, int ln, const char *v, |
|
int *pos, int *res, int skipwhite) |
|
{ |
|
int mypos, operand2; |
|
char operator; |
|
|
|
if (NULL == pos) { |
|
mypos = 0; |
|
pos = &mypos; |
|
} |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_evalpar(r, ln, v, pos, res)) |
|
return(0); |
|
|
|
while (1) { |
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_getop(v, pos, &operator)) |
|
break; |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_evalpar(r, ln, v, pos, &operand2)) |
|
return(0); |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if (NULL == res) |
|
continue; |
|
|
|
switch (operator) { |
|
case '+': |
|
*res += operand2; |
|
break; |
|
case '-': |
|
*res -= operand2; |
|
break; |
|
case '*': |
|
*res *= operand2; |
|
break; |
|
case '/': |
|
if (0 == operand2) { |
|
mandoc_msg(MANDOCERR_DIVZERO, |
|
r->parse, ln, *pos, v); |
|
*res = 0; |
|
break; |
|
} |
|
*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, char sign) |
|
{ |
|
struct roffreg *reg; |
|
|
|
/* Search for an existing register with the same name. */ |
|
reg = r->regtab; |
|
|
|
while (reg && strcmp(name, reg->key.p)) |
|
reg = reg->next; |
|
|
|
if (NULL == reg) { |
|
/* Create a new register. */ |
|
reg = mandoc_malloc(sizeof(struct roffreg)); |
|
reg->key.p = mandoc_strdup(name); |
|
reg->key.sz = strlen(name); |
|
reg->val = 0; |
|
reg->next = r->regtab; |
|
r->regtab = reg; |
|
} |
|
|
|
if ('+' == sign) |
|
reg->val += val; |
|
else if ('-' == sign) |
|
reg->val -= val; |
|
else |
|
reg->val = val; |
|
} |
|
|
|
/* |
|
* Handle some predefined read-only number registers. |
|
* For now, return -1 if the requested register is not predefined; |
|
* in case a predefined read-only register having the value -1 |
|
* were to turn up, another special value would have to be chosen. |
|
*/ |
|
static int |
|
roff_getregro(const char *name) |
|
{ |
|
|
|
switch (*name) { |
|
case 'A': /* ASCII approximation mode is always off. */ |
|
return(0); |
|
case 'g': /* Groff compatibility mode is always on. */ |
|
return(1); |
|
case 'H': /* Fixed horizontal resolution. */ |
|
return (24); |
|
case 'j': /* Always adjust left margin only. */ |
|
return(0); |
|
case 'T': /* Some output device is always defined. */ |
|
return(1); |
|
case 'V': /* Fixed vertical resolution. */ |
|
return (40); |
|
default: |
|
return (-1); |
|
} |
|
} |
|
|
|
int |
|
roff_getreg(const struct roff *r, const char *name) |
|
{ |
|
struct roffreg *reg; |
|
int val; |
|
|
|
if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) { |
|
val = roff_getregro(name + 1); |
|
if (-1 != val) |
|
return (val); |
|
} |
|
|
|
for (reg = r->regtab; reg; reg = reg->next) |
|
if (0 == strcmp(name, reg->key.p)) |
|
return(reg->val); |
|
|
|
return(0); |
|
} |
|
|
|
static int |
|
roff_getregn(const struct roff *r, const char *name, size_t len) |
|
{ |
|
struct roffreg *reg; |
|
int val; |
|
|
|
if ('.' == name[0] && 2 == len) { |
|
val = roff_getregro(name + 1); |
|
if (-1 != val) |
|
return (val); |
|
} |
|
|
|
for (reg = r->regtab; reg; reg = reg->next) |
|
if (len == reg->key.sz && |
|
0 == strncmp(name, reg->key.p, len)) |
|
return(reg->val); |
|
|
|
return(0); |
|
} |
|
|
|
static void |
|
roff_freereg(struct roffreg *reg) |
|
{ |
|
struct roffreg *old_reg; |
|
|
|
while (NULL != reg) { |
|
free(reg->key.p); |
|
old_reg = reg; |
|
reg = reg->next; |
|
free(old_reg); |
|
} |
|
} |
|
|
static enum rofferr |
static enum rofferr |
roff_ds(ROFF_ARGS) |
roff_nr(ROFF_ARGS) |
{ |
{ |
char *name, *string, *end; |
char *key, *val; |
|
size_t keysz; |
|
int iv; |
|
char sign; |
|
|
name = *bufp + pos; |
key = val = buf->buf + pos; |
if ('\0' == *name) |
if (*key == '\0') |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
string = name; |
keysz = roff_getname(r, &val, ln, pos); |
while (*string && ' ' != *string) |
if (key[keysz] == '\\') |
string++; |
return(ROFF_IGN); |
if (*string) |
key[keysz] = '\0'; |
*(string++) = NULL; |
|
if (*string && '"' == *string) |
sign = *val; |
string++; |
if (sign == '+' || sign == '-') |
while (*string && ' ' == *string) |
val++; |
string++; |
|
end = string; |
if (roff_evalnum(r, ln, val, NULL, &iv, 0)) |
while (*end) |
roff_setreg(r, key, iv, sign); |
end++; |
|
if (string < end) { |
return(ROFF_IGN); |
end--; |
} |
if (*end == '"') |
|
*end = '\0'; |
static enum rofferr |
|
roff_rr(ROFF_ARGS) |
|
{ |
|
struct roffreg *reg, **prev; |
|
char *name, *cp; |
|
size_t namesz; |
|
|
|
name = cp = buf->buf + pos; |
|
if (*name == '\0') |
|
return(ROFF_IGN); |
|
namesz = roff_getname(r, &cp, ln, pos); |
|
name[namesz] = '\0'; |
|
|
|
prev = &r->regtab; |
|
while (1) { |
|
reg = *prev; |
|
if (reg == NULL || !strcmp(name, reg->key.p)) |
|
break; |
|
prev = ®->next; |
} |
} |
|
if (reg != NULL) { |
|
*prev = reg->next; |
|
free(reg->key.p); |
|
free(reg); |
|
} |
|
return(ROFF_IGN); |
|
} |
|
|
roff_setstr(name, string); |
static enum rofferr |
|
roff_rm(ROFF_ARGS) |
|
{ |
|
const char *name; |
|
char *cp; |
|
size_t namesz; |
|
|
|
cp = buf->buf + pos; |
|
while (*cp != '\0') { |
|
name = cp; |
|
namesz = roff_getname(r, &cp, ln, (int)(cp - buf->buf)); |
|
roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0); |
|
if (name[namesz] == '\\') |
|
break; |
|
} |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
static enum rofferr |
|
roff_it(ROFF_ARGS) |
|
{ |
|
char *cp; |
|
size_t len; |
|
int iv; |
|
|
/* ARGSUSED */ |
/* Parse the number of lines. */ |
|
cp = buf->buf + pos; |
|
len = strcspn(cp, " \t"); |
|
cp[len] = '\0'; |
|
if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) { |
|
mandoc_msg(MANDOCERR_IT_NONUM, r->parse, |
|
ln, ppos, buf->buf + 1); |
|
return(ROFF_IGN); |
|
} |
|
cp += len + 1; |
|
|
|
/* Arm the input line trap. */ |
|
roffit_lines = iv; |
|
roffit_macro = mandoc_strdup(cp); |
|
return(ROFF_IGN); |
|
} |
|
|
static enum rofferr |
static enum rofferr |
roff_nr(ROFF_ARGS) |
roff_Dd(ROFF_ARGS) |
{ |
{ |
const char *key, *val; |
const char *const *cp; |
struct reg *rg; |
|
|
|
key = &(*bufp)[pos]; |
if ((r->options & (MPARSE_MDOC | MPARSE_QUICK)) == 0) |
rg = r->regs->regs; |
for (cp = __mdoc_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
/* Parse register request. */ |
if (r->format == 0) |
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
r->format = MPARSE_MDOC; |
pos++; |
|
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
static enum rofferr |
|
roff_TH(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
|
if ((r->options & MPARSE_QUICK) == 0) |
|
for (cp = __man_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
|
if (r->format == 0) |
|
r->format = MPARSE_MAN; |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
static enum rofferr |
|
roff_TE(ROFF_ARGS) |
|
{ |
|
|
|
if (NULL == r->tbl) |
|
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
|
ln, ppos, "TE"); |
|
else |
|
tbl_end(&r->tbl); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
static enum rofferr |
|
roff_T_(ROFF_ARGS) |
|
{ |
|
|
|
if (NULL == r->tbl) |
|
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
|
ln, ppos, "T&"); |
|
else |
|
tbl_restart(ppos, ln, r->tbl); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* |
|
* Handle in-line equation delimiters. |
|
*/ |
|
static enum rofferr |
|
roff_eqndelim(struct roff *r, struct buf *buf, int pos) |
|
{ |
|
char *cp1, *cp2; |
|
const char *bef_pr, *bef_nl, *mac, *aft_nl, *aft_pr; |
|
|
/* |
/* |
* Set our nil terminator. Because this line is going to be |
* Outside equations, look for an opening delimiter. |
* ignored anyway, we can munge it as we please. |
* If we are inside an equation, we already know it is |
|
* in-line, or this function wouldn't have been called; |
|
* so look for a closing delimiter. |
*/ |
*/ |
if ((*bufp)[pos]) |
|
(*bufp)[pos++] = '\0'; |
|
|
|
/* Skip whitespace to register token. */ |
cp1 = buf->buf + pos; |
while ((*bufp)[pos] && ' ' == (*bufp)[pos]) |
cp2 = strchr(cp1, r->eqn == NULL ? |
pos++; |
r->last_eqn->odelim : r->last_eqn->cdelim); |
|
if (cp2 == NULL) |
|
return(ROFF_CONT); |
|
|
val = &(*bufp)[pos]; |
*cp2++ = '\0'; |
|
bef_pr = bef_nl = aft_nl = aft_pr = ""; |
|
|
/* Process register token. */ |
/* Handle preceding text, protecting whitespace. */ |
|
|
if (0 == strcmp(key, "nS")) { |
if (*buf->buf != '\0') { |
rg[(int)REG_nS].set = 1; |
if (r->eqn == NULL) |
if ( ! roff_parse_nat(val, &rg[(int)REG_nS].v.u)) |
bef_pr = "\\&"; |
rg[(int)REG_nS].v.u = 0; |
bef_nl = "\n"; |
|
} |
|
|
ROFF_DEBUG("roff: register nS: %u\n", |
/* |
rg[(int)REG_nS].v.u); |
* Prepare replacing the delimiter with an equation macro |
|
* and drop leading white space from the equation. |
|
*/ |
|
|
|
if (r->eqn == NULL) { |
|
while (*cp2 == ' ') |
|
cp2++; |
|
mac = ".EQ"; |
} else |
} else |
ROFF_DEBUG("roff: ignoring register: %s\n", key); |
mac = ".EN"; |
|
|
|
/* Handle following text, protecting whitespace. */ |
|
|
|
if (*cp2 != '\0') { |
|
aft_nl = "\n"; |
|
if (r->eqn != NULL) |
|
aft_pr = "\\&"; |
|
} |
|
|
|
/* Do the actual replacement. */ |
|
|
|
buf->sz = mandoc_asprintf(&cp1, "%s%s%s%s%s%s%s", buf->buf, |
|
bef_pr, bef_nl, mac, aft_nl, aft_pr, cp2) + 1; |
|
free(buf->buf); |
|
buf->buf = cp1; |
|
|
|
/* Toggle the in-line state of the eqn subsystem. */ |
|
|
|
r->eqn_inline = r->eqn == NULL; |
|
return(ROFF_REPARSE); |
|
} |
|
|
|
static enum rofferr |
|
roff_EQ(ROFF_ARGS) |
|
{ |
|
struct eqn_node *e; |
|
|
|
assert(r->eqn == NULL); |
|
e = eqn_alloc(ppos, ln, r->parse); |
|
|
|
if (r->last_eqn) { |
|
r->last_eqn->next = e; |
|
e->delim = r->last_eqn->delim; |
|
e->odelim = r->last_eqn->odelim; |
|
e->cdelim = r->last_eqn->cdelim; |
|
} else |
|
r->first_eqn = r->last_eqn = e; |
|
|
|
r->eqn = r->last_eqn = e; |
|
|
|
if (buf->buf[pos] != '\0') |
|
mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, |
|
".EQ %s", buf->buf + pos); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
static enum rofferr |
|
roff_EN(ROFF_ARGS) |
|
{ |
|
|
char * |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, ln, ppos, "EN"); |
roff_setstr(const char *name, const char *string) |
return(ROFF_IGN); |
|
} |
|
|
|
static enum rofferr |
|
roff_TS(ROFF_ARGS) |
{ |
{ |
struct roffstr *n; |
struct tbl_node *tbl; |
char *namecopy; |
|
|
|
n = first_string; |
if (r->tbl) { |
while (n && strcmp(name, n->name)) |
mandoc_msg(MANDOCERR_BLK_BROKEN, r->parse, |
n = n->next; |
ln, ppos, "TS breaks TS"); |
if (n) { |
tbl_end(&r->tbl); |
free(n->string); |
|
} else { |
|
if (NULL == (namecopy = strdup(name))) |
|
return(NULL); |
|
if (NULL == (n = malloc(sizeof(struct roffstr)))) { |
|
free(n); |
|
return(NULL); |
|
} |
|
n->name = namecopy; |
|
n->next = first_string; |
|
first_string = n; |
|
} |
} |
if (string) |
|
n->string = strdup(string); |
tbl = tbl_alloc(ppos, ln, r->parse); |
|
|
|
if (r->last_tbl) |
|
r->last_tbl->next = tbl; |
else |
else |
n->string = NULL; |
r->first_tbl = r->last_tbl = tbl; |
return(n->string); |
|
|
r->tbl = r->last_tbl = tbl; |
|
return(ROFF_IGN); |
} |
} |
|
|
char * |
static enum rofferr |
roff_getstr(const char *name) |
roff_cc(ROFF_ARGS) |
{ |
{ |
struct roffstr *n; |
const char *p; |
|
|
n = first_string; |
p = buf->buf + pos; |
while (n && strcmp(name, n->name)) |
|
n = n->next; |
if (*p == '\0' || (r->control = *p++) == '.') |
if (n) |
r->control = 0; |
return(n->string); |
|
else |
if (*p != '\0') |
return(NULL); |
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
|
|
|
return(ROFF_IGN); |
} |
} |
|
|
char * |
static enum rofferr |
roff_getstrn(const char *name, size_t len) |
roff_tr(ROFF_ARGS) |
{ |
{ |
struct roffstr *n; |
const char *p, *first, *second; |
|
size_t fsz, ssz; |
|
enum mandoc_esc esc; |
|
|
n = first_string; |
p = buf->buf + pos; |
while (n && (strncmp(name, n->name, len) || '\0' != n->name[len])) |
|
|
if (*p == '\0') { |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
while (*p != '\0') { |
|
fsz = ssz = 1; |
|
|
|
first = p++; |
|
if (*first == '\\') { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (esc == ESCAPE_ERROR) { |
|
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
|
ln, (int)(p - buf->buf), first); |
|
return(ROFF_IGN); |
|
} |
|
fsz = (size_t)(p - first); |
|
} |
|
|
|
second = p++; |
|
if (*second == '\\') { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (esc == ESCAPE_ERROR) { |
|
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
|
ln, (int)(p - buf->buf), second); |
|
return(ROFF_IGN); |
|
} |
|
ssz = (size_t)(p - second); |
|
} else if (*second == '\0') { |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, |
|
ln, (int)(p - buf->buf), NULL); |
|
second = " "; |
|
p--; |
|
} |
|
|
|
if (fsz > 1) { |
|
roff_setstrn(&r->xmbtab, first, fsz, |
|
second, ssz, 0); |
|
continue; |
|
} |
|
|
|
if (r->xtab == NULL) |
|
r->xtab = mandoc_calloc(128, |
|
sizeof(struct roffstr)); |
|
|
|
free(r->xtab[(int)*first].p); |
|
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); |
|
r->xtab[(int)*first].sz = ssz; |
|
} |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
static enum rofferr |
|
roff_so(ROFF_ARGS) |
|
{ |
|
char *name; |
|
|
|
name = buf->buf + pos; |
|
mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, "so %s", name); |
|
|
|
/* |
|
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
|
* 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 (*name == '/' || strstr(name, "../") || strstr(name, "/..")) { |
|
mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos, |
|
".so %s", name); |
|
return(ROFF_ERR); |
|
} |
|
|
|
*offs = pos; |
|
return(ROFF_SO); |
|
} |
|
|
|
static enum rofferr |
|
roff_userdef(ROFF_ARGS) |
|
{ |
|
const char *arg[9]; |
|
char *cp, *n1, *n2; |
|
int i; |
|
|
|
/* |
|
* Collect pointers to macro argument strings |
|
* and NUL-terminate them. |
|
*/ |
|
cp = buf->buf + pos; |
|
for (i = 0; i < 9; i++) |
|
arg[i] = *cp == '\0' ? "" : |
|
mandoc_getarg(r->parse, &cp, ln, &pos); |
|
|
|
/* |
|
* Expand macro arguments. |
|
*/ |
|
buf->sz = 0; |
|
n1 = cp = mandoc_strdup(r->current_string); |
|
while ((cp = strstr(cp, "\\$")) != NULL) { |
|
i = cp[2] - '1'; |
|
if (0 > i || 8 < i) { |
|
/* Not an argument invocation. */ |
|
cp += 2; |
|
continue; |
|
} |
|
*cp = '\0'; |
|
buf->sz = mandoc_asprintf(&n2, "%s%s%s", |
|
n1, arg[i], cp + 3) + 1; |
|
cp = n2 + (cp - n1); |
|
free(n1); |
|
n1 = n2; |
|
} |
|
|
|
/* |
|
* Replace the macro invocation |
|
* by the expanded macro. |
|
*/ |
|
free(buf->buf); |
|
buf->buf = n1; |
|
if (buf->sz == 0) |
|
buf->sz = strlen(buf->buf) + 1; |
|
|
|
return(buf->sz > 1 && buf->buf[buf->sz - 2] == '\n' ? |
|
ROFF_REPARSE : ROFF_APPEND); |
|
} |
|
|
|
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(0); |
|
|
|
/* Read until end of name and terminate it with NUL. */ |
|
for (cp = name; 1; cp++) { |
|
if ('\0' == *cp || ' ' == *cp) { |
|
namesz = cp - name; |
|
break; |
|
} |
|
if ('\\' != *cp) |
|
continue; |
|
namesz = cp - name; |
|
if ('{' == cp[1] || '}' == cp[1]) |
|
break; |
|
cp++; |
|
if ('\\' == *cp) |
|
continue; |
|
mandoc_vmsg(MANDOCERR_NAMESC, r->parse, ln, pos, |
|
"%.*s", (int)(cp - name + 1), name); |
|
mandoc_escape((const char **)&cp, NULL, NULL); |
|
break; |
|
} |
|
|
|
/* Read past spaces. */ |
|
while (' ' == *cp) |
|
cp++; |
|
|
|
*cpp = cp; |
|
return(namesz); |
|
} |
|
|
|
/* |
|
* 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) |
|
{ |
|
|
|
roff_setstrn(&r->strtab, name, strlen(name), string, |
|
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 append) |
|
{ |
|
struct roffkv *n; |
|
char *c; |
|
int i; |
|
size_t oldch, newch; |
|
|
|
/* Search for an existing string with the same name. */ |
|
n = *r; |
|
|
|
while (n && (namesz != n->key.sz || |
|
strncmp(n->key.p, name, namesz))) |
n = n->next; |
n = n->next; |
if (n) |
|
return(n->string); |
if (NULL == n) { |
else |
/* Create a new string table entry. */ |
return(NULL); |
n = mandoc_malloc(sizeof(struct roffkv)); |
|
n->key.p = mandoc_strndup(name, namesz); |
|
n->key.sz = namesz; |
|
n->val.p = NULL; |
|
n->val.sz = 0; |
|
n->next = *r; |
|
*r = n; |
|
} else if (0 == append) { |
|
free(n->val.p); |
|
n->val.p = NULL; |
|
n->val.sz = 0; |
|
} |
|
|
|
if (NULL == string) |
|
return; |
|
|
|
/* |
|
* One additional byte for the '\n' in multiline mode, |
|
* and one for the terminating '\0'. |
|
*/ |
|
newch = stringsz + (1 < append ? 2u : 1u); |
|
|
|
if (NULL == n->val.p) { |
|
n->val.p = mandoc_malloc(newch); |
|
*n->val.p = '\0'; |
|
oldch = 0; |
|
} else { |
|
oldch = n->val.sz; |
|
n->val.p = mandoc_realloc(n->val.p, oldch + newch); |
|
} |
|
|
|
/* Skip existing content in the destination buffer. */ |
|
c = n->val.p + (int)oldch; |
|
|
|
/* Append new content to the destination buffer. */ |
|
i = 0; |
|
while (i < (int)stringsz) { |
|
/* |
|
* Rudimentary roff copy mode: |
|
* Handle escaped backslashes. |
|
*/ |
|
if ('\\' == string[i] && '\\' == string[i + 1]) |
|
i++; |
|
*c++ = string[i++]; |
|
} |
|
|
|
/* Append terminating bytes. */ |
|
if (1 < append) |
|
*c++ = '\n'; |
|
|
|
*c = '\0'; |
|
n->val.sz = (int)(c - n->val.p); |
} |
} |
|
|
void |
static const char * |
roff_freestr(void) |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
{ |
{ |
struct roffstr *n, *nn; |
const struct roffkv *n; |
|
int i; |
|
|
for (n = first_string; n; n = nn) { |
for (n = r->strtab; n; n = n->next) |
free(n->name); |
if (0 == strncmp(name, n->key.p, len) && |
free(n->string); |
'\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); |
|
} |
|
|
|
static void |
|
roff_freestr(struct roffkv *r) |
|
{ |
|
struct roffkv *n, *nn; |
|
|
|
for (n = r; n; n = nn) { |
|
free(n->key.p); |
|
free(n->val.p); |
nn = n->next; |
nn = n->next; |
free(n); |
free(n); |
} |
} |
first_string = NULL; |
} |
|
|
|
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); |
|
} |
|
|
|
/* |
|
* Duplicate an input string, making the appropriate character |
|
* conversations (as stipulated by `tr') along the way. |
|
* Returns a heap-allocated string with all the replacements made. |
|
*/ |
|
char * |
|
roff_strdup(const struct roff *r, const char *p) |
|
{ |
|
const struct roffkv *cp; |
|
char *res; |
|
const char *pp; |
|
size_t ssz, sz; |
|
enum mandoc_esc esc; |
|
|
|
if (NULL == r->xmbtab && NULL == r->xtab) |
|
return(mandoc_strdup(p)); |
|
else if ('\0' == *p) |
|
return(mandoc_strdup("")); |
|
|
|
/* |
|
* Step through each character looking for term matches |
|
* (remember that a `tr' can be invoked with an escape, which is |
|
* a glyph but the escape is multi-character). |
|
* We only do this if the character hash has been initialised |
|
* and the string is >0 length. |
|
*/ |
|
|
|
res = NULL; |
|
ssz = 0; |
|
|
|
while ('\0' != *p) { |
|
if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) { |
|
sz = r->xtab[(int)*p].sz; |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, r->xtab[(int)*p].p, sz); |
|
ssz += sz; |
|
p++; |
|
continue; |
|
} else if ('\\' != *p) { |
|
res = mandoc_realloc(res, ssz + 2); |
|
res[ssz++] = *p++; |
|
continue; |
|
} |
|
|
|
/* Search for term matches. */ |
|
for (cp = r->xmbtab; cp; cp = cp->next) |
|
if (0 == strncmp(p, cp->key.p, cp->key.sz)) |
|
break; |
|
|
|
if (NULL != cp) { |
|
/* |
|
* A match has been found. |
|
* Append the match to the array and move |
|
* forward by its keysize. |
|
*/ |
|
res = mandoc_realloc(res, |
|
ssz + cp->val.sz + 1); |
|
memcpy(res + ssz, cp->val.p, cp->val.sz); |
|
ssz += cp->val.sz; |
|
p += (int)cp->key.sz; |
|
continue; |
|
} |
|
|
|
/* |
|
* Handle escapes carefully: we need to copy |
|
* over just the escape itself, or else we might |
|
* do replacements within the escape itself. |
|
* Make sure to pass along the bogus string. |
|
*/ |
|
pp = p++; |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
sz = strlen(pp); |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, pp, sz); |
|
break; |
|
} |
|
/* |
|
* We bail out on bad escapes. |
|
* No need to warn: we already did so when |
|
* roff_res() was called. |
|
*/ |
|
sz = (int)(p - pp); |
|
res = mandoc_realloc(res, ssz + sz + 1); |
|
memcpy(res + ssz, pp, sz); |
|
ssz += sz; |
|
} |
|
|
|
res[(int)ssz] = '\0'; |
|
return(res); |
|
} |
|
|
|
int |
|
roff_getformat(const struct roff *r) |
|
{ |
|
|
|
return(r->format); |
|
} |
|
|
|
/* |
|
* 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 |
|
* 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) |
|
{ |
|
int pos; |
|
|
|
pos = *ppos; |
|
|
|
if (0 != r->control && cp[pos] == r->control) |
|
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); |
} |
} |