version 1.75, 2010/05/16 13:49:23 |
version 1.198, 2014/03/08 04:43:54 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* 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 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 |
|
|
#endif |
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <ctype.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 "roff.h" |
#include "libroff.h" |
|
#include "libmandoc.h" |
|
|
#define ROFF_CTL(c) \ |
/* Maximum number of nested if-else conditionals. */ |
('.' == (c) || '\'' == (c)) |
#define RSTACK_MAX 128 |
#ifdef ROFF_DEBUG |
|
#define ROFF_MDEBUG(p, str) \ |
|
fprintf(stderr, "%s: %s (%d:%d)\n", (str), \ |
|
roffs[(p)->last->tok].name, \ |
|
(p)->last->line, (p)->last->col) |
|
#else |
|
#define ROFF_MDEBUG(p, str) while (/* CONSTCOND */ 0) |
|
#endif |
|
|
|
|
/* Maximum number of string expansions per line, to break infinite loops. */ |
|
#define EXPAND_LIMIT 1000 |
|
|
enum rofft { |
enum rofft { |
ROFF_if, |
ROFF_ad, |
ROFF_ccond, |
|
#if 0 |
|
ROFF_am, |
ROFF_am, |
ROFF_ami, |
ROFF_ami, |
|
ROFF_am1, |
|
ROFF_as, |
|
ROFF_cc, |
|
ROFF_ce, |
ROFF_de, |
ROFF_de, |
ROFF_dei, |
ROFF_dei, |
|
ROFF_de1, |
|
ROFF_ds, |
|
ROFF_el, |
|
ROFF_fam, |
|
ROFF_hw, |
|
ROFF_hy, |
|
ROFF_ie, |
|
ROFF_if, |
ROFF_ig, |
ROFF_ig, |
ROFF_close, |
ROFF_it, |
#endif |
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 |
ROFF_MAX |
}; |
}; |
|
|
|
/* |
|
* An incredibly-simple string buffer. |
|
*/ |
|
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 { |
|
enum mparset parsetype; /* requested parse type */ |
|
struct mparse *parse; /* parse point */ |
|
int quick; /* skip standard macro deletion */ |
struct roffnode *last; /* leaf of stack */ |
struct roffnode *last; /* leaf of stack */ |
mandocmsg msg; /* err/warn/fatal messages */ |
int rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
void *data; /* privdata for messages */ |
char control; /* control character */ |
|
int rstackpos; /* position in rstack */ |
|
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 */ |
}; |
}; |
|
|
struct roffnode { |
struct roffnode { |
enum rofft tok; /* type of node */ |
enum rofft tok; /* type of node */ |
struct roffnode *parent; /* up one in stack */ |
struct roffnode *parent; /* up one in stack */ |
char *end; /* end-token: custom */ |
|
int line; /* parse line */ |
int line; /* parse line */ |
int col; /* parse col */ |
int col; /* parse col */ |
int endspan; |
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 */ |
}; |
}; |
|
|
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
Line 79 typedef enum rofferr (*roffproc)(ROFF_ARGS); |
|
Line 147 typedef enum rofferr (*roffproc)(ROFF_ARGS); |
|
|
|
struct roffmac { |
struct roffmac { |
const char *name; /* macro name */ |
const char *name; /* macro name */ |
roffproc proc; |
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; |
}; |
}; |
|
|
static enum rofferr roff_if(ROFF_ARGS); |
struct predef { |
static enum rofferr roff_ccond(ROFF_ARGS); |
const char *name; /* predefined input name */ |
#if 0 |
const char *str; /* replacement symbol */ |
static enum rofferr roff_new_close(ROFF_ARGS); |
|
static enum rofferr roff_new_ig(ROFF_ARGS); |
|
static enum rofferr roff_sub_ig(ROFF_ARGS); |
|
#endif |
|
|
|
const struct roffmac roffs[ROFF_MAX] = { |
|
{ "if", roff_if }, |
|
{ "\\}", roff_ccond }, |
|
#if 0 |
|
{ "am", roff_sub_ig, roff_new_ig }, |
|
{ "ami", roff_sub_ig, roff_new_ig }, |
|
{ "de", roff_sub_ig, roff_new_ig }, |
|
{ "dei", roff_sub_ig, roff_new_ig }, |
|
{ "ig", roff_sub_ig, roff_new_ig }, |
|
{ ".", NULL, roff_new_close }, |
|
#endif |
|
}; |
}; |
|
|
static void roff_free1(struct roff *); |
#define PREDEF(__name, __str) \ |
static enum rofft roff_hash_find(const char *); |
{ (__name), (__str) }, |
static int roffnode_push(struct roff *, |
|
enum rofft, int, int); |
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_pop(struct roff *); |
static enum rofft roff_parse(const char *, int *); |
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); |
|
|
|
/* See roffhash_find() */ |
|
|
|
#define ASCII_HI 126 |
|
#define ASCII_LO 33 |
|
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
|
|
|
static struct roffmac *hash[HASHWIDTH]; |
|
|
|
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 }, |
|
{ "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 }, |
|
}; |
|
|
|
const char *const __mdoc_reserved[] = { |
|
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
|
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
|
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
|
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
|
"Ds", "Dt", "Dv", "Dx", "D1", |
|
"Ec", "Ed", "Ef", "Ek", "El", "Em", "em", |
|
"En", "Eo", "Eq", "Er", "Es", "Ev", "Ex", |
|
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
|
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", "LP", |
|
"Me", "Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
|
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
|
"Pa", "Pc", "Pf", "Po", "Pp", "PP", "pp", "Pq", |
|
"Qc", "Ql", "Qo", "Qq", "Or", "Rd", "Re", "Rs", "Rv", |
|
"Sc", "Sf", "Sh", "SH", "Sm", "So", "Sq", |
|
"Ss", "St", "Sx", "Sy", |
|
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
|
"%A", "%B", "%D", "%I", "%J", "%N", "%O", |
|
"%P", "%Q", "%R", "%T", "%U", "%V", |
|
NULL |
|
}; |
|
|
|
const char *const __man_reserved[] = { |
|
"AT", "B", "BI", "BR", "BT", "DE", "DS", "DT", |
|
"EE", "EN", "EQ", "EX", "HF", "HP", "I", "IB", "IP", "IR", |
|
"LP", "ME", "MT", "OP", "P", "PD", "PP", "PT", |
|
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", "SY", |
|
"TE", "TH", "TP", "TQ", "TS", "T&", "UC", "UE", "UR", "YS", |
|
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) |
|
|
|
static int roffit_lines; /* number of lines to delay */ |
|
static char *roffit_macro; /* nil-terminated macro line */ |
|
|
|
static void |
|
roffhash_init(void) |
|
{ |
|
struct roffmac *n; |
|
int buc, i; |
|
|
|
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
|
assert(roffs[i].name[0] >= ASCII_LO); |
|
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
|
buc = ROFF_HASH(roffs[i].name); |
|
|
|
if (NULL != (n = hash[buc])) { |
|
for ( ; n->next; n = n->next) |
|
/* Do nothing. */ ; |
|
n->next = &roffs[i]; |
|
} else |
|
hash[buc] = &roffs[i]; |
|
} |
|
} |
|
|
/* |
/* |
* 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 i; |
int buc; |
|
struct roffmac *n; |
|
|
/* FIXME: make this be fast and efficient. */ |
/* |
|
* 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. |
|
*/ |
|
|
for (i = 0; i < (int)ROFF_MAX; i++) |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
if (0 == strcmp(roffs[i].name, p)) |
return(ROFF_MAX); |
return((enum rofft)i); |
|
|
|
|
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); |
return(ROFF_MAX); |
} |
} |
|
|
Line 141 roffnode_pop(struct roff *r) |
|
Line 372 roffnode_pop(struct roff *r) |
|
|
|
assert(r->last); |
assert(r->last); |
p = r->last; |
p = r->last; |
|
|
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); |
} |
} |
|
|
Line 152 roffnode_pop(struct roff *r) |
|
Line 384 roffnode_pop(struct roff *r) |
|
* 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 : 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(r->strtab); |
|
roff_freestr(r->xmbtab); |
|
|
|
r->strtab = r->xmbtab = NULL; |
|
|
|
roff_freereg(r->regtab); |
|
|
|
r->regtab = 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->control = 0; |
} |
} |
|
|
|
|
Line 199 roff_free(struct roff *r) |
|
Line 463 roff_free(struct roff *r) |
|
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(const mandocmsg msg, void *data) |
roff_alloc(enum mparset type, struct mparse *parse, int quick) |
{ |
{ |
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->parsetype = type; |
return(0); |
r->parse = parse; |
} |
r->quick = quick; |
|
r->rstackpos = -1; |
|
|
|
roffhash_init(); |
|
|
r->msg = msg; |
|
r->data = data; |
|
return(r); |
return(r); |
} |
} |
|
|
|
/* |
enum rofferr |
* In the current line, expand user-defined strings ("\*") |
roff_parseln(struct roff *r, int ln, |
* and references to number registers ("\n"). |
char **bufp, size_t *szp, int pos, int *offs) |
* Also check the syntax of other escape sequences. |
|
*/ |
|
static enum rofferr |
|
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
{ |
{ |
enum rofft t; |
char ubuf[12]; /* buffer to print the number */ |
int ppos; |
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 */ |
|
|
/* Return when in free text without a context. */ |
expand_count = 0; |
|
|
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
again: |
/* XXX: this assumes we're just discarding. */ |
cp = *bufp + pos; |
while (r->last) { |
while (NULL != (cp = strchr(cp, '\\'))) { |
if (r->last->endspan-- < 0) |
stesc = cp++; |
|
|
|
/* |
|
* The second character must be an asterisk or an n. |
|
* If it isn't, skip it anyway: It is escaped, |
|
* so it can't start another escape sequence. |
|
*/ |
|
|
|
if ('\0' == *cp) |
|
return(ROFF_CONT); |
|
|
|
switch (*cp) { |
|
case ('*'): |
|
res = NULL; |
|
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. |
|
*/ |
|
|
|
switch (*cp) { |
|
case ('\0'): |
|
return(ROFF_CONT); |
|
case ('('): |
|
cp++; |
|
maxl = 2; |
|
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 (0 == maxl && ']' == *cp) |
break; |
break; |
ROFF_MDEBUG(r, "closing implicit scope"); |
|
roffnode_pop(r); |
|
} |
} |
|
|
|
/* |
|
* Retrieve the replacement string; if it is |
|
* undefined, resume searching for escapes. |
|
*/ |
|
|
|
if (NULL == res) |
|
res = roff_getstrn(r, stnam, naml); |
|
else |
|
snprintf(ubuf, sizeof(ubuf), "%d", |
|
roff_getregn(r, stnam, naml)); |
|
|
|
if (NULL == res) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
|
res = ""; |
|
} |
|
|
|
/* Replace the escape sequence by the string. */ |
|
|
|
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_IGN); |
} else if ( ! ROFF_CTL((*bufp)[pos])) |
} |
return(ROFF_CONT); |
return(ROFF_CONT); |
|
} |
|
|
/* There's nothing on the stack: make us anew. */ |
/* |
|
* Process text streams: |
|
* Convert all breakable hyphens into ASCII_HYPH. |
|
* Decrement and spring input line trap. |
|
*/ |
|
static enum rofferr |
|
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; |
|
|
|
start = p = *bufp + pos; |
|
|
|
while ('\0' != *p) { |
|
sz = strcspn(p, "-\\"); |
|
p += sz; |
|
|
|
if ('\0' == *p) |
|
break; |
|
|
|
if ('\\' == *p) { |
|
/* Skip over escapes. */ |
|
p++; |
|
esc = mandoc_escape((const char **)&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) |
|
break; |
|
continue; |
|
} else if (p == start) { |
|
p++; |
|
continue; |
|
} |
|
|
|
if (isalpha((unsigned char)p[-1]) && |
|
isalpha((unsigned char)p[1])) |
|
*p = ASCII_HYPH; |
|
p++; |
|
} |
|
|
|
/* 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 |
|
roff_parseln(struct roff *r, int ln, char **bufp, |
|
size_t *szp, int pos, int *offs) |
|
{ |
|
enum rofft t; |
|
enum rofferr e; |
|
int ppos, ctl; |
|
|
|
/* |
|
* Run the reserved-word filter only if we have some reserved |
|
* words to fill in. |
|
*/ |
|
|
|
e = roff_res(r, bufp, szp, ln, pos); |
|
if (ROFF_IGN == e) |
|
return(e); |
|
assert(ROFF_CONT == e); |
|
|
ppos = pos; |
ppos = pos; |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
ctl = roff_getcontrol(r, *bufp, &pos); |
|
|
|
/* |
|
* 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 |
|
* 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 && ! ctl) { |
|
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 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. |
|
*/ |
|
|
|
if (r->last) { |
|
t = r->last->tok; |
|
assert(roffs[t].sub); |
|
return((*roffs[t].sub) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
|
} |
|
|
|
/* |
|
* 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. |
|
*/ |
|
|
|
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
return(ROFF_CONT); |
return(ROFF_CONT); |
|
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc)(r, t, bufp, szp, ln, ppos, pos, offs)); |
return((*roffs[t].proc) |
|
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
int |
void |
roff_endparse(struct roff *r) |
roff_endparse(struct roff *r) |
{ |
{ |
|
|
if (NULL == r->last) |
if (r->last) |
return(1); |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, |
r->last->line, r->last->col, NULL); |
r->last->col, NULL)); |
|
} |
|
|
|
|
if (r->eqn) { |
|
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
|
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); |
|
eqn_end(&r->eqn); |
|
} |
|
|
|
if (r->tbl) { |
|
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
|
r->tbl->line, r->tbl->pos, NULL); |
|
tbl_end(&r->tbl); |
|
} |
|
} |
|
|
/* |
/* |
* 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, const char *buf, int *pos) |
{ |
{ |
int j; |
const char *mac; |
char mac[5]; |
size_t maclen; |
enum rofft t; |
enum rofft t; |
|
|
assert(ROFF_CTL(buf[*pos])); |
if ('\0' == buf[*pos] || '"' == buf[*pos] || |
(*pos)++; |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
|
|
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
|
(*pos)++; |
|
|
|
if ('\0' == buf[*pos]) |
|
return(ROFF_MAX); |
return(ROFF_MAX); |
|
|
for (j = 0; j < 4; j++, (*pos)++) |
/* We stop the macro parse at an escape, tab, space, or nil. */ |
if ('\0' == (mac[j] = buf[*pos])) |
|
break; |
|
else if (' ' == buf[*pos]) |
|
break; |
|
|
|
if (j == 4 || j < 1) |
mac = buf + *pos; |
return(ROFF_MAX); |
maclen = strcspn(mac, " \\\t\0"); |
|
|
mac[j] = '\0'; |
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
|
? ROFF_USERDEF : roffhash_find(mac, maclen); |
|
|
if (ROFF_MAX == (t = roff_hash_find(mac))) |
*pos += (int)maclen; |
return(t); |
|
|
|
while (buf[*pos] && ' ' == buf[*pos]) |
while (buf[*pos] && ' ' == buf[*pos]) |
(*pos)++; |
(*pos)++; |
Line 297 roff_parse(const char *buf, int *pos) |
|
Line 800 roff_parse(const char *buf, int *pos) |
|
return(t); |
return(t); |
} |
} |
|
|
|
|
#if 0 |
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_sub_ig(ROFF_ARGS) |
roff_cblock(ROFF_ARGS) |
{ |
{ |
int i, j; |
|
|
|
/* Ignore free-text lines. */ |
/* |
|
* A block-close `..' should only be invoked as a child of an |
|
* ignore macro, otherwise raise a warning and just ignore it. |
|
*/ |
|
|
if ('.' != (*bufp)[ppos] && '\'' != (*bufp)[ppos]) |
if (NULL == r->last) { |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
} |
|
|
if (r->last->end) { |
switch (r->last->tok) { |
i = ppos + 1; |
case (ROFF_am): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ami): |
|
/* FALLTHROUGH */ |
|
case (ROFF_am1): |
|
/* FALLTHROUGH */ |
|
case (ROFF_de): |
|
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ |
|
/* FALLTHROUGH */ |
|
case (ROFF_dei): |
|
/* FALLTHROUGH */ |
|
case (ROFF_ig): |
|
break; |
|
default: |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
while ((*bufp)[i] && ' ' == (*bufp)[i]) |
if ((*bufp)[pos]) |
i++; |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
for (j = 0; r->last->end[j]; i++, j++) |
roffnode_pop(r); |
if ((*bufp)[i] != r->last->end[j]) |
roffnode_cleanscope(r); |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
if (r->last->end[j]) |
} |
|
|
|
|
|
static void |
|
roffnode_cleanscope(struct roff *r) |
|
{ |
|
|
|
while (r->last) { |
|
if (--r->last->endspan != 0) |
|
break; |
|
roffnode_pop(r); |
|
} |
|
} |
|
|
|
|
|
static void |
|
roff_ccond(struct roff *r, int ln, int ppos) |
|
{ |
|
|
|
if (NULL == r->last) { |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return; |
|
} |
|
|
|
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; |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_block(ROFF_ARGS) |
|
{ |
|
int sv; |
|
size_t sz; |
|
char *name; |
|
|
|
name = NULL; |
|
|
|
if (ROFF_ig != tok) { |
|
if ('\0' == (*bufp)[pos]) { |
|
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return(ROFF_IGN); |
if ((*bufp)[i] && ' ' != (*bufp)[i]) |
} |
return(ROFF_IGN); |
|
|
|
while (' ' == (*bufp)[i]) |
/* |
i++; |
* Re-write `de1', since we don't really care about |
|
* groff's strange compatibility mode, into `de'. |
|
*/ |
|
|
} else if (ROFF_close != roff_parse(*bufp, &i)) |
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); |
|
|
|
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
|
pos++; |
|
|
|
while (isspace((unsigned char)(*bufp)[pos])) |
|
(*bufp)[pos++] = '\0'; |
|
} |
|
|
|
roffnode_push(r, tok, name, ln, ppos); |
|
|
|
/* |
|
* 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. |
|
*/ |
|
|
|
if (ROFF_de == tok) |
|
roff_setstr(r, name, "", 0); |
|
|
|
if ('\0' == (*bufp)[pos]) |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
roffnode_pop(r); |
/* If present, process the custom end-of-line marker. */ |
|
|
if ('\0' == (*bufp)[i]) |
sv = pos; |
|
while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos])) |
|
pos++; |
|
|
|
/* |
|
* Note: groff does NOT like escape characters in the input. |
|
* Instead of detecting this, we're just going to let it fly and |
|
* to hell with it. |
|
*/ |
|
|
|
assert(pos > sv); |
|
sz = (size_t)(pos - sv); |
|
|
|
if (1 == sz && '.' == (*bufp)[sv]) |
return(ROFF_IGN); |
return(ROFF_IGN); |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, i, NULL)) |
|
return(ROFF_ERR); |
|
|
|
|
r->last->end = mandoc_malloc(sz + 1); |
|
|
|
memcpy(r->last->end, *bufp + sv, sz); |
|
r->last->end[(int)sz] = '\0'; |
|
|
|
if ((*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_new_close(ROFF_ARGS) |
roff_block_sub(ROFF_ARGS) |
{ |
{ |
|
enum rofft t; |
|
int i, j; |
|
|
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
/* |
return(ROFF_ERR); |
* 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 (r->last->end) { |
|
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
|
if ((*bufp)[i] != r->last->end[j]) |
|
break; |
|
|
|
if ('\0' == r->last->end[j] && |
|
('\0' == (*bufp)[i] || |
|
' ' == (*bufp)[i] || |
|
'\t' == (*bufp)[i])) { |
|
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
|
|
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
|
i++; |
|
|
|
pos = i; |
|
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
|
return(ROFF_RERUN); |
|
return(ROFF_IGN); |
|
} |
|
} |
|
|
|
/* |
|
* 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)); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_block_text(ROFF_ARGS) |
|
{ |
|
|
|
if (ROFF_de == tok) |
|
roff_setstr(r, r->last->name, *bufp + pos, 2); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
#endif |
|
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_ccond(ROFF_ARGS) |
roff_cond_sub(ROFF_ARGS) |
{ |
{ |
|
enum rofft t; |
|
char *ep; |
|
int rr; |
|
|
if (NULL == r->last || ROFF_if != r->last->tok || r->last->endspan > -1) { |
rr = r->last->rule; |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
roffnode_cleanscope(r); |
return(ROFF_ERR); |
t = roff_parse(r, *bufp, &pos); |
return(ROFF_IGN); |
|
|
/* |
|
* 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)); |
} |
} |
|
|
ROFF_MDEBUG(r, "closing explicit scope"); |
/* |
roffnode_pop(r); |
* If `\}' occurs on a macro line without a preceding macro, |
|
* drop the line completely. |
|
*/ |
|
|
while (r->last) { |
ep = *bufp + pos; |
if (--r->last->endspan < 0) |
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 |
|
roff_getnum(const char *v, int *pos, int *res) |
|
{ |
|
int p, n; |
|
|
|
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; |
|
} |
|
|
|
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 |
|
roff_evalstrcond(const char *v, int *pos) |
|
{ |
|
const char *s1, *s2, *s3; |
|
int match; |
|
|
|
match = 0; |
|
s1 = v + *pos; /* initial delimiter */ |
|
s2 = s1 + 1; /* for scanning the first string */ |
|
s3 = strchr(s2, *s1); /* for scanning the second string */ |
|
|
|
if (NULL == s3) /* found no middle delimiter */ |
|
goto out; |
|
|
|
while ('\0' != *++s3) { |
|
if (*s2 != *s3) { /* mismatch */ |
|
s3 = strchr(s3, *s1); |
break; |
break; |
|
} |
|
if (*s3 == *s1) { /* found the final delimiter */ |
|
match = 1; |
|
break; |
|
} |
|
s2++; |
|
} |
|
|
ROFF_MDEBUG(r, "closing implicit scope"); |
out: |
roffnode_pop(r); |
if (NULL == s3) |
|
s3 = strchr(s2, '\0'); |
|
else |
|
s3++; |
|
*pos = s3 - v; |
|
return(match); |
|
} |
|
|
|
static int |
|
roff_evalcond(const char *v, int *pos) |
|
{ |
|
int wanttrue, lh, rh; |
|
char op; |
|
|
|
if ('!' == v[*pos]) { |
|
wanttrue = 0; |
|
(*pos)++; |
|
} 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; |
} |
} |
|
|
return(ROFF_IGN); |
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 enum rofferr |
static enum rofferr |
roff_if(ROFF_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
|
|
|
roffnode_push(r, tok, NULL, ln, ppos); |
|
|
|
/* |
|
* An `.el' has no conditional body: it will consume the value |
|
* of the current rstack entry set in prior `ie' calls or |
|
* defaults to DENY. |
|
* |
|
* If we're not an `el', however, then evaluate the conditional. |
|
*/ |
|
|
|
r->last->rule = ROFF_el == tok ? |
|
(r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(*bufp, &pos); |
|
|
/* |
/* |
* Read ahead past the conditional. |
* An if-else will put the NEGATION of the current evaluated |
* FIXME: this does not work, as conditionals don't end on |
* conditional into the stack of rules. |
* whitespace, but are parsed according to a formal grammar. |
|
* It's good enough for now, however. |
|
*/ |
*/ |
|
|
if ( ! roffnode_push(r, tok, ln, ppos)) |
if (ROFF_ie == tok) { |
return(ROFF_ERR); |
if (r->rstackpos == RSTACK_MAX - 1) { |
|
mandoc_msg(MANDOCERR_MEM, |
|
r->parse, ln, ppos, NULL); |
|
return(ROFF_ERR); |
|
} |
|
r->rstack[++r->rstackpos] = !r->last->rule; |
|
} |
|
|
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
/* If the parent has false as its rule, then so do we. */ |
pos++; |
|
|
if (r->last->parent && !r->last->parent->rule) |
|
r->last->rule = 0; |
|
|
|
/* |
|
* 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; |
|
} |
|
|
while (' ' == (*bufp)[pos]) |
while (' ' == (*bufp)[pos]) |
pos++; |
pos++; |
|
|
/* Don't evaluate: just assume NO. */ |
/* An opening brace requests multiline scope. */ |
|
|
r->last->endspan = 1; |
|
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
ROFF_MDEBUG(r, "opening explicit scope"); |
|
r->last->endspan = -1; |
r->last->endspan = -1; |
pos += 2; |
pos += 2; |
} else |
goto out; |
ROFF_MDEBUG(r, "opening implicit scope"); |
} |
|
|
|
/* |
|
* Anything else following the conditional causes |
|
* single-line scope. Warn if the scope contains |
|
* nothing but trailing whitespace. |
|
*/ |
|
|
if ('\0' == (*bufp)[pos]) |
if ('\0' == (*bufp)[pos]) |
return(ROFF_IGN); |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
|
|
r->last->endspan = 1; |
|
|
|
out: |
*offs = pos; |
*offs = pos; |
return(ROFF_RERUN); |
return(ROFF_RERUN); |
} |
} |
|
|
|
|
#if 0 |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_new_ig(ROFF_ARGS) |
roff_ds(ROFF_ARGS) |
{ |
{ |
int i; |
char *name, *string; |
|
|
if ( ! roffnode_push(r, tok, ln, ppos)) |
|
return(ROFF_ERR); |
|
|
|
/* |
/* |
* Other macros (not `ig') using this routine have additional |
* A symbol is named by the first word following the macro |
* crap here that we discard. |
* invocation up to a space. Its value is anything after the |
|
* name's trailing whitespace and optional double-quote. Thus, |
|
* |
|
* [.ds foo "bar " ] |
|
* |
|
* will have `bar " ' as its value. |
*/ |
*/ |
|
|
if (ROFF_ig != tok) { |
string = *bufp + pos; |
while ((*bufp)[ppos] && ' ' != (*bufp)[ppos]) |
name = roff_getname(r, &string, ln, pos); |
ppos++; |
if ('\0' == *name) |
while (' ' == (*bufp)[ppos]) |
return(ROFF_IGN); |
ppos++; |
|
|
/* Read past initial double-quote. */ |
|
if ('"' == *string) |
|
string++; |
|
|
|
/* The rest is the value. */ |
|
roff_setstr(r, name, string, ROFF_as == tok); |
|
return(ROFF_IGN); |
|
} |
|
|
|
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; |
} |
} |
|
|
i = (int)ppos; |
if ('+' == sign) |
|
reg->val += val; |
|
else if ('-' == sign) |
|
reg->val -= val; |
|
else |
|
reg->val = val; |
|
} |
|
|
while ((*bufp)[i] && ' ' != (*bufp)[i]) |
/* |
i++; |
* 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) |
|
{ |
|
|
if (i == (int)ppos) |
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); |
|
} |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_nr(ROFF_ARGS) |
|
{ |
|
const char *key; |
|
char *val; |
|
size_t sz; |
|
int iv; |
|
char sign; |
|
|
|
val = *bufp + pos; |
|
key = roff_getname(r, &val, ln, pos); |
|
|
|
sign = *val; |
|
if ('+' == sign || '-' == sign) |
|
val++; |
|
|
|
sz = strspn(val, "0123456789"); |
|
iv = sz ? mandoc_strntoi(val, sz, 10) : 0; |
|
|
|
roff_setreg(r, key, iv, sign); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_rm(ROFF_ARGS) |
|
{ |
|
const char *name; |
|
char *cp; |
|
|
|
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); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_it(ROFF_ARGS) |
|
{ |
|
char *cp; |
|
size_t len; |
|
int iv; |
|
|
|
/* 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); |
return(ROFF_IGN); |
|
} |
|
cp += len + 1; |
|
|
if ((*bufp)[i]) |
/* Arm the input line trap. */ |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, i, NULL)) |
roffit_lines = iv; |
return(ROFF_ERR); |
roffit_macro = mandoc_strdup(cp); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_Dd(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
|
if (0 == r->quick && MPARSE_MDOC != r->parsetype) |
|
for (cp = __mdoc_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TH(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
|
if (0 == r->quick && MPARSE_MDOC != r->parsetype) |
|
for (cp = __man_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TE(ROFF_ARGS) |
|
{ |
|
|
|
if (NULL == r->tbl) |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
else |
|
tbl_end(&r->tbl); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_T_(ROFF_ARGS) |
|
{ |
|
|
|
if (NULL == r->tbl) |
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
else |
|
tbl_restart(ppos, ln, r->tbl); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
#if 0 |
|
static int |
|
roff_closeeqn(struct roff *r) |
|
{ |
|
|
|
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
|
} |
|
#endif |
|
|
|
static void |
|
roff_openeqn(struct roff *r, const char *name, int line, |
|
int offs, const char *buf) |
|
{ |
|
struct eqn_node *e; |
|
int poff; |
|
|
|
assert(NULL == r->eqn); |
|
e = eqn_alloc(name, offs, line, r->parse); |
|
|
|
if (r->last_eqn) |
|
r->last_eqn->next = e; |
|
else |
|
r->first_eqn = r->last_eqn = e; |
|
|
|
r->eqn = r->last_eqn = e; |
|
|
|
if (buf) { |
|
poff = 0; |
|
eqn_read(&r->eqn, line, buf, offs, &poff); |
|
} |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_EQ(ROFF_ARGS) |
|
{ |
|
|
|
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_EN(ROFF_ARGS) |
|
{ |
|
|
|
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TS(ROFF_ARGS) |
|
{ |
|
struct tbl_node *tbl; |
|
|
|
if (r->tbl) { |
|
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
|
tbl_end(&r->tbl); |
|
} |
|
|
|
tbl = tbl_alloc(ppos, ln, r->parse); |
|
|
|
if (r->last_tbl) |
|
r->last_tbl->next = tbl; |
|
else |
|
r->first_tbl = r->last_tbl = tbl; |
|
|
|
r->tbl = r->last_tbl = tbl; |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_cc(ROFF_ARGS) |
|
{ |
|
const char *p; |
|
|
|
p = *bufp + pos; |
|
|
|
if ('\0' == *p || '.' == (r->control = *p++)) |
|
r->control = 0; |
|
|
|
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) { |
|
fsz = ssz = 1; |
|
|
|
first = p++; |
|
if ('\\' == *first) { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
fsz = (size_t)(p - first); |
|
} |
|
|
|
second = p++; |
|
if ('\\' == *second) { |
|
esc = mandoc_escape(&p, NULL, NULL); |
|
if (ESCAPE_ERROR == esc) { |
|
mandoc_msg |
|
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
ssz = (size_t)(p - second); |
|
} else if ('\0' == *second) { |
|
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, |
|
ln, (int)(p - *bufp), NULL); |
|
second = " "; |
|
p--; |
|
} |
|
|
|
if (fsz > 1) { |
|
roff_setstrn(&r->xmbtab, first, |
|
fsz, second, ssz, 0); |
|
continue; |
|
} |
|
|
|
if (NULL == r->xtab) |
|
r->xtab = mandoc_calloc |
|
(128, sizeof(struct roffstr)); |
|
|
|
free(r->xtab[(int)*first].p); |
|
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); |
|
r->xtab[(int)*first].sz = ssz; |
|
} |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_so(ROFF_ARGS) |
|
{ |
|
char *name; |
|
|
|
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); |
|
|
/* |
/* |
* If the macro has arguments, the first argument (up to the |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
* next whitespace) is interpreted as an argument marking the |
* opening anything that's not in our cwd or anything beneath |
* macro close. Thus, `.ig foo' will close at `.foo'. |
* it. Thus, explicitly disallow traversing up the file-system |
* |
* or using absolute paths. |
* NOTE: the closing macro `.foo' in the above case is not |
|
* allowed to have leading spaces with old groff! Thus `.foo' |
|
* != `. foo'. Oh yeah, everything after the `.foo' is lost. |
|
* Merry fucking Christmas. |
|
*/ |
*/ |
|
|
r->last->end = malloc((size_t)(i - ppos) + 1); |
name = *bufp + pos; |
if (NULL == r->last->end) { |
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); |
return(ROFF_ERR); |
return(ROFF_ERR); |
} |
} |
|
|
memcpy(r->last->end, &(*bufp)[ppos], (size_t)(i - ppos)); |
*offs = pos; |
r->last->end[i - ppos] = '\0'; |
return(ROFF_SO); |
|
} |
|
|
return(ROFF_IGN); |
/* ARGSUSED */ |
|
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 = *bufp + pos; |
|
for (i = 0; i < 9; i++) |
|
arg[i] = '\0' == *cp ? "" : |
|
mandoc_getarg(r->parse, &cp, ln, &pos); |
|
|
|
/* |
|
* 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; |
|
} |
|
|
|
*szp = strlen(n1) - 3 + strlen(arg[i]) + 1; |
|
n2 = mandoc_malloc(*szp); |
|
|
|
strlcpy(n2, n1, (size_t)(cp - n1 + 1)); |
|
strlcat(n2, arg[i], *szp); |
|
strlcat(n2, cp + 3, *szp); |
|
|
|
cp = n2 + (cp - n1); |
|
free(n1); |
|
n1 = n2; |
|
} |
|
|
|
/* |
|
* Replace the macro invocation |
|
* by the expanded macro. |
|
*/ |
|
free(*bufp); |
|
*bufp = n1; |
|
if (0 == *szp) |
|
*szp = strlen(*bufp) + 1; |
|
|
|
return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ? |
|
ROFF_REPARSE : ROFF_APPEND); |
} |
} |
#endif |
|
|
static char * |
|
roff_getname(struct roff *r, char **cpp, int ln, int pos) |
|
{ |
|
char *name, *cp; |
|
|
|
name = *cpp; |
|
if ('\0' == *name) |
|
return(name); |
|
|
|
/* 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; |
|
} |
|
|
|
/* Nil-terminate name. */ |
|
if ('\0' != *cp) |
|
*(cp++) = '\0'; |
|
|
|
/* Read past spaces. */ |
|
while (' ' == *cp) |
|
cp++; |
|
|
|
*cpp = cp; |
|
return(name); |
|
} |
|
|
|
/* |
|
* 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 && strcmp(name, n->key.p)) |
|
n = n->next; |
|
|
|
if (NULL == n) { |
|
/* Create a new string table entry. */ |
|
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); |
|
} |
|
|
|
static const char * |
|
roff_getstrn(const struct roff *r, const char *name, size_t len) |
|
{ |
|
const struct roffkv *n; |
|
int i; |
|
|
|
for (n = r->strtab; n; n = n->next) |
|
if (0 == strncmp(name, n->key.p, len) && |
|
'\0' == n->key.p[(int)len]) |
|
return(n->val.p); |
|
|
|
for (i = 0; i < PREDEFS_MAX; i++) |
|
if (0 == strncmp(name, predefs[i].name, len) && |
|
'\0' == predefs[i].name[(int)len]) |
|
return(predefs[i].str); |
|
|
|
return(NULL); |
|
} |
|
|
|
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; |
|
free(n); |
|
} |
|
} |
|
|
|
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); |
|
} |
|
|
|
/* |
|
* 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); |
|
} |