version 1.151, 2011/07/25 15:37:00 |
version 1.205, 2014/04/07 21:00:08 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2011 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2010-2014 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
|
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
#include "libroff.h" |
#include "libroff.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
|
|
/* Maximum number of nested if-else conditionals. */ |
/* Maximum number of nested if-else conditionals. */ |
#define RSTACK_MAX 128 |
#define RSTACK_MAX 128 |
|
|
|
/* Maximum number of string expansions per line, to break infinite loops. */ |
|
#define EXPAND_LIMIT 1000 |
|
|
enum rofft { |
enum rofft { |
ROFF_ad, |
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_hy, |
ROFF_ie, |
ROFF_ie, |
ROFF_if, |
ROFF_if, |
|
|
ROFF_ns, |
ROFF_ns, |
ROFF_ps, |
ROFF_ps, |
ROFF_rm, |
ROFF_rm, |
|
ROFF_rr, |
ROFF_so, |
ROFF_so, |
ROFF_ta, |
ROFF_ta, |
ROFF_tr, |
ROFF_tr, |
|
ROFF_Dd, |
|
ROFF_TH, |
ROFF_TS, |
ROFF_TS, |
ROFF_TE, |
ROFF_TE, |
ROFF_T_, |
ROFF_T_, |
ROFF_EQ, |
ROFF_EQ, |
ROFF_EN, |
ROFF_EN, |
ROFF_cblock, |
ROFF_cblock, |
ROFF_ccond, |
|
ROFF_USERDEF, |
ROFF_USERDEF, |
ROFF_MAX |
ROFF_MAX |
}; |
}; |
|
|
enum roffrule { |
/* |
ROFFRULE_ALLOW, |
* An incredibly-simple string buffer. |
ROFFRULE_DENY |
*/ |
|
struct roffstr { |
|
char *p; /* nil-terminated buffer */ |
|
size_t sz; /* saved strlen(p) */ |
}; |
}; |
|
|
/* |
/* |
* A single register entity. If "set" is zero, the value of the |
* A key-value roffstr pair as part of a singly-linked list. |
* register should be the default one, which is per-register. |
|
* Registers are assumed to be unsigned ints for now. |
|
*/ |
*/ |
struct reg { |
struct roffkv { |
int set; /* whether set or not */ |
struct roffstr key; |
unsigned int u; /* unsigned integer */ |
struct roffstr val; |
|
struct roffkv *next; /* next in list */ |
}; |
}; |
|
|
struct roffstr { |
/* |
char *name; /* key of symbol */ |
* A single number register as part of a singly-linked list. |
char *string; /* current value */ |
*/ |
struct roffstr *next; /* next in list */ |
struct roffreg { |
|
struct roffstr key; |
|
int val; |
|
struct roffreg *next; |
}; |
}; |
|
|
struct roff { |
struct roff { |
struct mparse *parse; /* parse point */ |
struct mparse *parse; /* parse point */ |
|
int options; /* parse options */ |
struct roffnode *last; /* leaf of stack */ |
struct roffnode *last; /* leaf of stack */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
int rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
|
char control; /* control character */ |
int rstackpos; /* position in rstack */ |
int rstackpos; /* position in rstack */ |
struct reg regs[REG__MAX]; |
struct roffreg *regtab; /* number registers */ |
struct roffstr *first_string; /* user-defined strings & macros */ |
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 */ |
const char *current_string; /* value of last called user macro */ |
struct tbl_node *first_tbl; /* first table parsed */ |
struct tbl_node *first_tbl; /* first table parsed */ |
struct tbl_node *last_tbl; /* last table parsed */ |
struct tbl_node *last_tbl; /* last table parsed */ |
Line 111 struct roffnode { |
|
Line 132 struct roffnode { |
|
char *name; /* node name, e.g. macro name */ |
char *name; /* node name, e.g. macro name */ |
char *end; /* end-rules: custom token */ |
char *end; /* end-rules: custom token */ |
int endspan; /* end-rules: next-line or infty */ |
int endspan; /* end-rules: next-line or infty */ |
enum roffrule rule; /* current evaluation rule */ |
int rule; /* current evaluation rule */ |
}; |
}; |
|
|
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
|
|
#define PREDEF(__name, __str) \ |
#define PREDEF(__name, __str) \ |
{ (__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 roffrule roff_evalcond(const char *, int *); |
static int roff_evalcond(const char *, int *); |
static void roff_freestr(struct roff *); |
static int roff_evalnum(const char *, int *, int *, int); |
|
static int roff_evalpar(const char *, int *, int *); |
|
static int roff_evalstrcond(const char *, int *); |
|
static void roff_free1(struct roff *); |
|
static void roff_freereg(struct roffreg *); |
|
static void roff_freestr(struct roffkv *); |
static char *roff_getname(struct roff *, char **, int, int); |
static 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 *, |
static const char *roff_getstrn(const struct roff *, |
const char *, size_t); |
const char *, size_t); |
|
static enum rofferr roff_it(ROFF_ARGS); |
static enum rofferr roff_line_ignore(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 int roff_res(struct roff *, |
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); |
char **, size_t *, int, int); |
static enum rofferr roff_rm(ROFF_ARGS); |
static enum rofferr roff_rm(ROFF_ARGS); |
|
static enum rofferr roff_rr(ROFF_ARGS); |
static void roff_setstr(struct roff *, |
static void roff_setstr(struct roff *, |
const char *, const char *, int); |
const char *, const char *, int); |
|
static void roff_setstrn(struct roffkv **, const char *, |
|
size_t, const char *, size_t, int); |
static enum rofferr roff_so(ROFF_ARGS); |
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_TE(ROFF_ARGS); |
static enum rofferr roff_TS(ROFF_ARGS); |
static enum rofferr roff_TS(ROFF_ARGS); |
static enum rofferr roff_EQ(ROFF_ARGS); |
static enum rofferr roff_EQ(ROFF_ARGS); |
Line 172 static enum rofferr roff_EN(ROFF_ARGS); |
|
Line 221 static enum rofferr roff_EN(ROFF_ARGS); |
|
static enum rofferr roff_T_(ROFF_ARGS); |
static enum rofferr roff_T_(ROFF_ARGS); |
static enum rofferr roff_userdef(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 185 static struct roffmac roffs[ROFF_MAX] = { |
|
Line 234 static struct roffmac roffs[ROFF_MAX] = { |
|
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "as", roff_ds, NULL, NULL, 0, NULL }, |
|
{ "cc", roff_cc, NULL, NULL, 0, NULL }, |
|
{ "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 }, |
{ "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 }, |
{ "it", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "it", roff_it, NULL, NULL, 0, NULL }, |
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "nh", roff_line_ignore, 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 }, |
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
|
{ "rr", roff_rr, NULL, NULL, 0, NULL }, |
{ "so", roff_so, NULL, NULL, 0, NULL }, |
{ "so", roff_so, NULL, NULL, 0, NULL }, |
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, |
{ "tr", roff_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 }, |
{ "TS", roff_TS, NULL, NULL, 0, NULL }, |
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, |
|
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
}; |
}; |
|
|
|
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ |
|
const char *const __mdoc_reserved[] = { |
|
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
|
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
|
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
|
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
|
"Dt", "Dv", "Dx", "D1", |
|
"Ec", "Ed", "Ef", "Ek", "El", "Em", |
|
"En", "Eo", "Er", "Es", "Ev", "Ex", |
|
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
|
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", |
|
"Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
|
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
|
"Pa", "Pc", "Pf", "Po", "Pp", "Pq", |
|
"Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv", |
|
"Sc", "Sh", "Sm", "So", "Sq", |
|
"Ss", "St", "Sx", "Sy", |
|
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
|
"%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O", |
|
"%P", "%Q", "%R", "%T", "%U", "%V", |
|
NULL |
|
}; |
|
|
|
/* 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. */ |
/* Array of injected predefined strings. */ |
#define PREDEFS_MAX 38 |
#define PREDEFS_MAX 38 |
static const struct predef predefs[PREDEFS_MAX] = { |
static const struct predef predefs[PREDEFS_MAX] = { |
#include "predefs.in" |
#include "predefs.in" |
}; |
}; |
|
|
static void roff_free1(struct roff *); |
/* See roffhash_find() */ |
static enum rofft roff_hash_find(const char *, size_t); |
|
static void roff_hash_init(void); |
|
static void roffnode_cleanscope(struct roff *); |
|
static void roffnode_push(struct roff *, enum rofft, |
|
const char *, int, int); |
|
static void roffnode_pop(struct roff *); |
|
static enum rofft roff_parse(struct roff *, const char *, int *); |
|
|
|
/* See roff_hash_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; |
Line 258 roff_hash_init(void) |
|
Line 341 roff_hash_init(void) |
|
* 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, size_t s) |
roffhash_find(const char *p, size_t s) |
{ |
{ |
int buc; |
int buc; |
struct roffmac *n; |
struct roffmac *n; |
Line 321 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
Line 404 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
p->parent = r->last; |
p->parent = r->last; |
p->line = line; |
p->line = line; |
p->col = col; |
p->col = col; |
p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY; |
p->rule = p->parent ? p->parent->rule : 0; |
|
|
r->last = p; |
r->last = p; |
} |
} |
Line 330 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
Line 413 roffnode_push(struct roff *r, enum rofft tok, const ch |
|
static void |
static void |
roff_free1(struct roff *r) |
roff_free1(struct roff *r) |
{ |
{ |
struct tbl_node *t; |
struct tbl_node *tbl; |
struct eqn_node *e; |
struct eqn_node *e; |
|
int i; |
|
|
while (NULL != (t = r->first_tbl)) { |
while (NULL != (tbl = r->first_tbl)) { |
r->first_tbl = t->next; |
r->first_tbl = tbl->next; |
tbl_free(t); |
tbl_free(tbl); |
} |
} |
|
|
r->first_tbl = r->last_tbl = r->tbl = NULL; |
r->first_tbl = r->last_tbl = r->tbl = NULL; |
Line 350 roff_free1(struct roff *r) |
|
Line 434 roff_free1(struct roff *r) |
|
while (r->last) |
while (r->last) |
roffnode_pop(r); |
roffnode_pop(r); |
|
|
roff_freestr(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) |
{ |
{ |
int i; |
|
|
|
roff_free1(r); |
roff_free1(r); |
|
r->control = 0; |
memset(&r->regs, 0, sizeof(struct reg) * REG__MAX); |
|
|
|
for (i = 0; i < PREDEFS_MAX; i++) |
|
roff_setstr(r, predefs[i].name, predefs[i].str, 0); |
|
} |
} |
|
|
|
|
Line 378 roff_free(struct roff *r) |
|
Line 470 roff_free(struct roff *r) |
|
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(struct mparse *parse) |
roff_alloc(struct mparse *parse, int options) |
{ |
{ |
struct roff *r; |
struct roff *r; |
int i; |
|
|
|
r = mandoc_calloc(1, sizeof(struct roff)); |
r = mandoc_calloc(1, sizeof(struct roff)); |
r->parse = parse; |
r->parse = parse; |
|
r->options = options; |
r->rstackpos = -1; |
r->rstackpos = -1; |
|
|
roff_hash_init(); |
roffhash_init(); |
|
|
for (i = 0; i < PREDEFS_MAX; i++) |
|
roff_setstr(r, predefs[i].name, predefs[i].str, 0); |
|
|
|
return(r); |
return(r); |
} |
} |
|
|
|
|
/* |
/* |
* Pre-filter each and every line for reserved words (one beginning with |
* In the current line, expand user-defined strings ("\*") |
* `\*', e.g., `\*(ab'). These must be handled before the actual line |
* and references to number registers ("\n"). |
* is processed. |
* Also check the syntax of other escape sequences. |
*/ |
*/ |
static int |
static enum rofferr |
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos) |
{ |
{ |
|
char ubuf[12]; /* buffer to print the number */ |
|
const char *start; /* start of the string to process */ |
const char *stesc; /* start of an escape sequence ('\\') */ |
const char *stesc; /* start of an escape sequence ('\\') */ |
const char *stnam; /* start of the name, after "[(*" */ |
const char *stnam; /* start of the name, after "[(*" */ |
const char *cp; /* end of the name, e.g. before ']' */ |
const char *cp; /* end of the name, e.g. before ']' */ |
const char *res; /* the string to be substituted */ |
const char *res; /* the string to be substituted */ |
int i, maxl; |
char *nbuf; /* new buffer to copy bufp to */ |
size_t nsz; |
size_t maxl; /* expected length of the escape name */ |
char *n; |
size_t naml; /* actual length of the escape name */ |
|
size_t ressz; /* size of the replacement string */ |
|
int expand_count; /* to avoid infinite loops */ |
|
|
/* Search for a leading backslash and save a pointer to it. */ |
expand_count = 0; |
|
start = *bufp + pos; |
|
stesc = strchr(start, '\0') - 1; |
|
while (stesc-- > start) { |
|
|
cp = *bufp + pos; |
/* Search backwards for the next backslash. */ |
while (NULL != (cp = strchr(cp, '\\'))) { |
|
stesc = cp++; |
|
|
|
|
if ('\\' != *stesc) |
|
continue; |
|
|
|
/* If it is escaped, skip it. */ |
|
|
|
for (cp = stesc - 1; cp >= start; cp--) |
|
if ('\\' != *cp) |
|
break; |
|
|
|
if (0 == (stesc - cp) % 2) { |
|
stesc = cp; |
|
continue; |
|
} |
|
|
/* |
/* |
* The second character must be an asterisk. |
* Everything except user-defined strings and number |
* If it isn't, skip it anyway: It is escaped, |
* registers is only checked, not expanded. |
* so it can't start another escape sequence. |
|
*/ |
*/ |
|
|
if ('\0' == *cp) |
cp = stesc + 1; |
return(1); |
switch (*cp) { |
if ('*' != *cp++) |
case ('*'): |
|
res = NULL; |
|
break; |
|
case ('n'): |
|
res = ubuf; |
|
break; |
|
default: |
|
if (ESCAPE_ERROR == mandoc_escape(&cp, NULL, NULL)) |
|
mandoc_msg(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
continue; |
continue; |
|
} |
|
|
|
if (EXPAND_LIMIT < ++expand_count) { |
|
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
/* |
/* |
* The third character decides the length |
* The third character decides the length |
* of the name of the string. |
* of the name of the string or register. |
* Save a pointer to the name. |
* Save a pointer to the name. |
*/ |
*/ |
|
|
switch (*cp) { |
switch (*++cp) { |
case ('\0'): |
case ('\0'): |
return(1); |
continue; |
case ('('): |
case ('('): |
cp++; |
cp++; |
maxl = 2; |
maxl = 2; |
Line 454 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 576 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
|
|
/* Advance to the end of the name. */ |
/* Advance to the end of the name. */ |
|
|
for (i = 0; 0 == maxl || i < maxl; i++, cp++) { |
for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) { |
if ('\0' == *cp) |
if ('\0' == *cp) { |
return(1); /* Error. */ |
mandoc_msg |
|
(MANDOCERR_BADESCAPE, |
|
r->parse, ln, |
|
(int)(stesc - *bufp), NULL); |
|
continue; |
|
} |
if (0 == maxl && ']' == *cp) |
if (0 == maxl && ']' == *cp) |
break; |
break; |
} |
} |
Line 466 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
Line 593 roff_res(struct roff *r, char **bufp, size_t *szp, int |
|
* undefined, resume searching for escapes. |
* undefined, resume searching for escapes. |
*/ |
*/ |
|
|
res = roff_getstrn(r, stnam, (size_t)i); |
if (NULL == res) |
|
res = roff_getstrn(r, stnam, naml); |
|
else |
|
snprintf(ubuf, sizeof(ubuf), "%d", |
|
roff_getregn(r, stnam, naml)); |
|
|
if (NULL == res) { |
if (NULL == res) { |
/* TODO: keep track of the correct position. */ |
mandoc_msg |
mandoc_msg(MANDOCERR_BADESCAPE, r->parse, ln, pos, NULL); |
(MANDOCERR_BADESCAPE, r->parse, |
|
ln, (int)(stesc - *bufp), NULL); |
res = ""; |
res = ""; |
} |
} |
|
ressz = strlen(res); |
|
|
/* Replace the escape sequence by the string. */ |
/* Replace the escape sequence by the string. */ |
|
|
nsz = *szp + strlen(res) + 1; |
*szp += ressz + 1; |
n = mandoc_malloc(nsz); |
nbuf = mandoc_malloc(*szp); |
|
|
strlcpy(n, *bufp, (size_t)(stesc - *bufp + 1)); |
strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1)); |
strlcat(n, res, nsz); |
strlcat(nbuf, res, *szp); |
strlcat(n, cp + (maxl ? 0 : 1), nsz); |
strlcat(nbuf, cp + (maxl ? 0 : 1), *szp); |
|
|
|
/* Prepare for the next replacement. */ |
|
|
|
start = nbuf + pos; |
|
stesc = nbuf + (stesc - *bufp) + ressz; |
free(*bufp); |
free(*bufp); |
|
*bufp = nbuf; |
|
} |
|
return(ROFF_CONT); |
|
} |
|
|
*bufp = n; |
/* |
*szp = nsz; |
* Process text streams: |
return(0); |
* 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++; |
} |
} |
|
|
return(1); |
/* Spring the input line trap. */ |
|
if (1 == roffit_lines) { |
|
isz = mandoc_asprintf(&p, "%s\n.%s", *bufp, roffit_macro); |
|
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 |
enum rofferr |
roff_parseln(struct roff *r, int ln, char **bufp, |
roff_parseln(struct roff *r, int ln, char **bufp, |
size_t *szp, int pos, int *offs) |
size_t *szp, int pos, int *offs) |
Line 507 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 695 roff_parseln(struct roff *r, int ln, char **bufp, |
|
* words to fill in. |
* words to fill in. |
*/ |
*/ |
|
|
if (r->first_string && ! roff_res(r, bufp, szp, ln, pos)) |
e = roff_res(r, bufp, szp, ln, pos); |
return(ROFF_REPARSE); |
if (ROFF_IGN == e) |
|
return(e); |
|
assert(ROFF_CONT == e); |
|
|
ppos = pos; |
ppos = pos; |
ctl = mandoc_getcontrol(*bufp, &pos); |
ctl = roff_getcontrol(r, *bufp, &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 |
Line 529 roff_parseln(struct roff *r, int ln, char **bufp, |
|
Line 719 roff_parseln(struct roff *r, int ln, char **bufp, |
|
assert(ROFF_IGN == e || ROFF_CONT == e); |
assert(ROFF_IGN == e || ROFF_CONT == e); |
if (ROFF_CONT != e) |
if (ROFF_CONT != e) |
return(e); |
return(e); |
if (r->eqn) |
} |
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); |
|
if ( ! ctl) { |
if (r->tbl) |
if (r->tbl) |
return(tbl_read(r->tbl, ln, *bufp, pos)); |
return(tbl_read(r->tbl, ln, *bufp, pos)); |
return(ROFF_CONT); |
return(roff_parsetext(bufp, szp, pos, offs)); |
} else if ( ! ctl) { |
} |
if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, pos, offs)); |
|
if (r->tbl) |
|
return(tbl_read(r->tbl, ln, *bufp, pos)); |
|
return(ROFF_CONT); |
|
} else if (r->eqn) |
|
return(eqn_read(&r->eqn, ln, *bufp, ppos, offs)); |
|
|
|
/* |
/* |
* If a scope is open, go to the child handler for that macro, |
* If a scope is open, go to the child handler for that macro, |
Line 609 roff_parse(struct roff *r, const char *buf, int *pos) |
|
Line 794 roff_parse(struct roff *r, const char *buf, int *pos) |
|
'\t' == buf[*pos] || ' ' == buf[*pos]) |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
return(ROFF_MAX); |
return(ROFF_MAX); |
|
|
/* |
/* We stop the macro parse at an escape, tab, space, or nil. */ |
* We stop the macro parse at an escape, tab, space, or nil. |
|
* However, `\}' is also a valid macro, so make sure we don't |
|
* clobber it by seeing the `\' as the end of token. |
|
*/ |
|
|
|
mac = buf + *pos; |
mac = buf + *pos; |
maclen = strcspn(mac + 1, " \\\t\0") + 1; |
maclen = strcspn(mac, " \\\t\0"); |
|
|
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
? ROFF_USERDEF : roff_hash_find(mac, maclen); |
? ROFF_USERDEF : roffhash_find(mac, maclen); |
|
|
*pos += (int)maclen; |
*pos += (int)maclen; |
|
|
Line 678 roffnode_cleanscope(struct roff *r) |
|
Line 859 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); |
} |
} |
} |
} |
|
|
|
|
/* ARGSUSED */ |
static void |
static enum rofferr |
roff_ccond(struct roff *r, int ln, int ppos) |
roff_ccond(ROFF_ARGS) |
|
{ |
{ |
|
|
if (NULL == r->last) { |
if (NULL == r->last) { |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
switch (r->last->tok) { |
switch (r->last->tok) { |
Line 704 roff_ccond(ROFF_ARGS) |
|
Line 884 roff_ccond(ROFF_ARGS) |
|
break; |
break; |
default: |
default: |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
if (r->last->endspan > -1) { |
if (r->last->endspan > -1) { |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
if ((*bufp)[pos]) |
|
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
|
|
|
roffnode_pop(r); |
roffnode_pop(r); |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
return(ROFF_IGN); |
return; |
} |
} |
|
|
|
|
Line 762 roff_block(ROFF_ARGS) |
|
Line 939 roff_block(ROFF_ARGS) |
|
/* |
/* |
* At the beginning of a `de' macro, clear the existing string |
* At the beginning of a `de' macro, clear the existing string |
* with the same name, if there is one. New content will be |
* with the same name, if there is one. New content will be |
* added from roff_block_text() in multiline mode. |
* appended from roff_block_text() in multiline mode. |
*/ |
*/ |
|
|
if (ROFF_de == tok) |
if (ROFF_de == tok) |
Line 852 roff_block_sub(ROFF_ARGS) |
|
Line 1029 roff_block_sub(ROFF_ARGS) |
|
*/ |
*/ |
if (ROFF_cblock != t) { |
if (ROFF_cblock != t) { |
if (ROFF_de == tok) |
if (ROFF_de == tok) |
roff_setstr(r, r->last->name, *bufp + ppos, 1); |
roff_setstr(r, r->last->name, *bufp + ppos, 2); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 868 roff_block_text(ROFF_ARGS) |
|
Line 1045 roff_block_text(ROFF_ARGS) |
|
{ |
{ |
|
|
if (ROFF_de == tok) |
if (ROFF_de == tok) |
roff_setstr(r, r->last->name, *bufp + pos, 1); |
roff_setstr(r, r->last->name, *bufp + pos, 2); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
Line 879 static enum rofferr |
|
Line 1056 static enum rofferr |
|
roff_cond_sub(ROFF_ARGS) |
roff_cond_sub(ROFF_ARGS) |
{ |
{ |
enum rofft t; |
enum rofft t; |
enum roffrule rr; |
|
char *ep; |
char *ep; |
|
int rr; |
|
|
rr = r->last->rule; |
rr = r->last->rule; |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
|
t = roff_parse(r, *bufp, &pos); |
|
|
/* |
/* |
* If the macro is unknown, first check if it contains a closing |
* Fully handle known macros when they are structurally |
* delimiter `\}'. If it does, close out our scope and return |
* required or when the conditional evaluated to true. |
* the currently-scoped rule (ignore or continue). Else, drop |
|
* into the currently-scoped rule. |
|
*/ |
*/ |
|
|
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) { |
if ((ROFF_MAX != t) && |
ep = &(*bufp)[pos]; |
(rr || ROFFMAC_STRUCT & roffs[t].flags)) { |
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
assert(roffs[t].proc); |
ep++; |
return((*roffs[t].proc)(r, t, bufp, szp, |
if ('}' != *ep) |
ln, ppos, pos, offs)); |
continue; |
|
|
|
/* |
|
* Make the \} go away. |
|
* This is a little haphazard, as it's not quite |
|
* clear how nroff does this. |
|
* If we're at the end of line, then just chop |
|
* off the \} and resize the buffer. |
|
* If we aren't, then conver it to spaces. |
|
*/ |
|
|
|
if ('\0' == *(ep + 1)) { |
|
*--ep = '\0'; |
|
*szp -= 2; |
|
} else |
|
*(ep - 1) = *ep = ' '; |
|
|
|
roff_ccond(r, ROFF_ccond, bufp, szp, |
|
ln, pos, pos + 2, offs); |
|
break; |
|
} |
|
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) |
ep = *bufp + pos; |
if ( ! (ROFFMAC_STRUCT & roffs[t].flags)) |
if ('\\' == ep[0] && '}' == ep[1]) |
if (ROFF_ccond != t) |
rr = 0; |
return(ROFF_IGN); |
|
|
|
assert(roffs[t].proc); |
/* Always check for the closing delimiter `\}'. */ |
return((*roffs[t].proc)(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
while (NULL != (ep = strchr(ep, '\\'))) { |
|
if ('}' == *(++ep)) { |
|
*ep = '&'; |
|
roff_ccond(r, ln, ep - *bufp - 1); |
|
} |
|
++ep; |
|
} |
|
return(rr ? ROFF_CONT : ROFF_IGN); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 942 static enum rofferr |
|
Line 1101 static enum rofferr |
|
roff_cond_text(ROFF_ARGS) |
roff_cond_text(ROFF_ARGS) |
{ |
{ |
char *ep; |
char *ep; |
enum roffrule rr; |
int rr; |
|
|
rr = r->last->rule; |
rr = r->last->rule; |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
|
|
ep = &(*bufp)[pos]; |
ep = *bufp + pos; |
for ( ; NULL != (ep = strchr(ep, '\\')); ep++) { |
while (NULL != (ep = strchr(ep, '\\'))) { |
ep++; |
if ('}' == *(++ep)) { |
if ('}' != *ep) |
*ep = '&'; |
continue; |
roff_ccond(r, ln, ep - *bufp - 1); |
*ep = '&'; |
} |
roff_ccond(r, ROFF_ccond, bufp, szp, |
++ep; |
ln, pos, pos + 2, offs); |
|
} |
} |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
return(rr ? ROFF_CONT : ROFF_IGN); |
} |
} |
|
|
static enum roffrule |
/* |
|
* Parse a single signed integer number. Stop at the first non-digit. |
|
* If there is at least one digit, return success and advance the |
|
* parse point, else return failure and let the parse point unchanged. |
|
* Ignore overflows, treat them just like the C language. |
|
*/ |
|
static int |
|
roff_getnum(const char *v, int *pos, int *res) |
|
{ |
|
int 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; |
|
} |
|
|
|
/* |
|
* Evaluate a string comparison condition. |
|
* The first character is the delimiter. |
|
* Succeed if the string up to its second occurrence |
|
* matches the string up to its third occurence. |
|
* Advance the cursor after the third occurrence |
|
* or lacking that, to the end of the line. |
|
*/ |
|
static int |
|
roff_evalstrcond(const char *v, int *pos) |
|
{ |
|
const char *s1, *s2, *s3; |
|
int match; |
|
|
|
match = 0; |
|
s1 = v + *pos; /* initial delimiter */ |
|
s2 = s1 + 1; /* for scanning the first string */ |
|
s3 = strchr(s2, *s1); /* for scanning the second string */ |
|
|
|
if (NULL == s3) /* found no middle delimiter */ |
|
goto out; |
|
|
|
while ('\0' != *++s3) { |
|
if (*s2 != *s3) { /* mismatch */ |
|
s3 = strchr(s3, *s1); |
|
break; |
|
} |
|
if (*s3 == *s1) { /* found the final delimiter */ |
|
match = 1; |
|
break; |
|
} |
|
s2++; |
|
} |
|
|
|
out: |
|
if (NULL == s3) |
|
s3 = strchr(s2, '\0'); |
|
else |
|
s3++; |
|
*pos = s3 - v; |
|
return(match); |
|
} |
|
|
|
/* |
|
* Evaluate an optionally negated single character, numerical, |
|
* or string condition. |
|
*/ |
|
static int |
roff_evalcond(const char *v, int *pos) |
roff_evalcond(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 ('n'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_ALLOW); |
return(wanttrue); |
|
case ('c'): |
|
/* FALLTHROUGH */ |
|
case ('d'): |
|
/* FALLTHROUGH */ |
case ('e'): |
case ('e'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('o'): |
case ('r'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('t'): |
case ('t'): |
(*pos)++; |
(*pos)++; |
return(ROFFRULE_DENY); |
return(!wanttrue); |
default: |
default: |
break; |
break; |
} |
} |
|
|
while (v[*pos] && ' ' != v[*pos]) |
if (roff_evalnum(v, pos, &number, 0)) |
(*pos)++; |
return((number > 0) == wanttrue); |
return(ROFFRULE_DENY); |
else |
|
return(roff_evalstrcond(v, pos) == wanttrue); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
Line 988 static enum rofferr |
|
Line 1235 static enum rofferr |
|
roff_line_ignore(ROFF_ARGS) |
roff_line_ignore(ROFF_ARGS) |
{ |
{ |
|
|
if (ROFF_it == tok) |
|
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, "it"); |
|
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
Line 998 roff_line_ignore(ROFF_ARGS) |
|
Line 1242 roff_line_ignore(ROFF_ARGS) |
|
static enum rofferr |
static enum rofferr |
roff_cond(ROFF_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
int sv; |
|
enum roffrule rule; |
|
|
|
|
roffnode_push(r, tok, NULL, ln, ppos); |
|
|
/* |
/* |
* An `.el' has no conditional body: it will consume the value |
* An `.el' has no conditional body: it will consume the value |
* of the current rstack entry set in prior `ie' calls or |
* of the current rstack entry set in prior `ie' calls or |
Line 1009 roff_cond(ROFF_ARGS) |
|
Line 1253 roff_cond(ROFF_ARGS) |
|
* If we're not an `el', however, then evaluate the conditional. |
* If we're not an `el', however, then evaluate the conditional. |
*/ |
*/ |
|
|
rule = ROFF_el == tok ? |
r->last->rule = ROFF_el == tok ? |
(r->rstackpos < 0 ? |
(r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : |
ROFFRULE_DENY : r->rstack[r->rstackpos--]) : |
|
roff_evalcond(*bufp, &pos); |
roff_evalcond(*bufp, &pos); |
|
|
sv = pos; |
|
while (' ' == (*bufp)[pos]) |
|
pos++; |
|
|
|
/* |
/* |
* Roff is weird. If we have just white-space after the |
|
* conditional, it's considered the BODY and we exit without |
|
* really doing anything. Warn about this. It's probably |
|
* wrong. |
|
*/ |
|
|
|
if ('\0' == (*bufp)[pos] && sv != pos) { |
|
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
|
return(ROFF_IGN); |
|
} |
|
|
|
roffnode_push(r, tok, NULL, ln, ppos); |
|
|
|
r->last->rule = rule; |
|
|
|
/* |
|
* An if-else will put the NEGATION of the current evaluated |
* An if-else will put the NEGATION of the current evaluated |
* conditional into the stack of rules. |
* conditional into the stack of rules. |
*/ |
*/ |
Line 1045 roff_cond(ROFF_ARGS) |
|
Line 1268 roff_cond(ROFF_ARGS) |
|
r->parse, ln, ppos, NULL); |
r->parse, ln, ppos, NULL); |
return(ROFF_ERR); |
return(ROFF_ERR); |
} |
} |
r->rstack[++r->rstackpos] = |
r->rstack[++r->rstackpos] = !r->last->rule; |
ROFFRULE_DENY == r->last->rule ? |
|
ROFFRULE_ALLOW : ROFFRULE_DENY; |
|
} |
} |
|
|
/* If the parent has false as its rule, then so do we. */ |
/* If the parent has false as its rule, then so do we. */ |
|
|
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) |
if (r->last->parent && !r->last->parent->rule) |
r->last->rule = ROFFRULE_DENY; |
r->last->rule = 0; |
|
|
/* |
/* |
* Determine scope. If we're invoked with "\{" trailing the |
* Determine scope. |
* conditional, then we're in a multiline scope. Else our scope |
* If there is nothing on the line after the conditional, |
* expires on the next line. |
* not even whitespace, use next-line scope. |
*/ |
*/ |
|
|
r->last->endspan = 1; |
if ('\0' == (*bufp)[pos]) { |
|
r->last->endspan = 2; |
|
goto out; |
|
} |
|
|
|
while (' ' == (*bufp)[pos]) |
|
pos++; |
|
|
|
/* An opening brace requests multiline scope. */ |
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
r->last->endspan = -1; |
r->last->endspan = -1; |
pos += 2; |
pos += 2; |
|
goto out; |
} |
} |
|
|
/* |
/* |
* If there are no arguments on the line, the next-line scope is |
* Anything else following the conditional causes |
* assumed. |
* 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); |
|
|
/* Otherwise re-run the roff parser after recalculating. */ |
r->last->endspan = 1; |
|
|
|
out: |
*offs = pos; |
*offs = pos; |
return(ROFF_RERUN); |
return(ROFF_RERUN); |
} |
} |
Line 1109 roff_ds(ROFF_ARGS) |
|
Line 1341 roff_ds(ROFF_ARGS) |
|
string++; |
string++; |
|
|
/* The rest is the value. */ |
/* The rest is the value. */ |
roff_setstr(r, name, string, 0); |
roff_setstr(r, name, string, ROFF_as == tok); |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
int |
/* |
roff_regisset(const struct roff *r, enum regs reg) |
* 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) |
{ |
{ |
|
|
return(r->regs[(int)reg].set); |
*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); |
} |
} |
|
|
unsigned int |
/* |
roff_regget(const struct roff *r, enum regs reg) |
* Evaluate either a parenthesized numeric expression |
|
* or a single signed integer number. |
|
*/ |
|
static int |
|
roff_evalpar(const char *v, int *pos, int *res) |
{ |
{ |
|
|
return(r->regs[(int)reg].u); |
if ('(' != v[*pos]) |
|
return(roff_getnum(v, pos, res)); |
|
|
|
(*pos)++; |
|
if ( ! roff_evalnum(v, pos, res, 1)) |
|
return(0); |
|
|
|
/* If the trailing parenthesis is missing, ignore the error. */ |
|
if (')' == v[*pos]) |
|
(*pos)++; |
|
|
|
return(1); |
} |
} |
|
|
|
/* |
|
* Evaluate a complete numeric expression. |
|
* Proceed left to right, there is no concept of precedence. |
|
*/ |
|
static int |
|
roff_evalnum(const char *v, int *pos, int *res, int skipwhite) |
|
{ |
|
int mypos, operand2; |
|
char operator; |
|
|
|
if (NULL == pos) { |
|
mypos = 0; |
|
pos = &mypos; |
|
} |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_evalpar(v, pos, res)) |
|
return(0); |
|
|
|
while (1) { |
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_getop(v, pos, &operator)) |
|
break; |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
if ( ! roff_evalpar(v, pos, &operand2)) |
|
return(0); |
|
|
|
if (skipwhite) |
|
while (isspace((unsigned char)v[*pos])) |
|
(*pos)++; |
|
|
|
switch (operator) { |
|
case ('+'): |
|
*res += operand2; |
|
break; |
|
case ('-'): |
|
*res -= operand2; |
|
break; |
|
case ('*'): |
|
*res *= operand2; |
|
break; |
|
case ('/'): |
|
*res /= operand2; |
|
break; |
|
case ('%'): |
|
*res %= operand2; |
|
break; |
|
case ('<'): |
|
*res = *res < operand2; |
|
break; |
|
case ('>'): |
|
*res = *res > operand2; |
|
break; |
|
case ('l'): |
|
*res = *res <= operand2; |
|
break; |
|
case ('g'): |
|
*res = *res >= operand2; |
|
break; |
|
case ('='): |
|
*res = *res == operand2; |
|
break; |
|
case ('!'): |
|
*res = *res != operand2; |
|
break; |
|
case ('&'): |
|
*res = *res && operand2; |
|
break; |
|
case (':'): |
|
*res = *res || operand2; |
|
break; |
|
case ('i'): |
|
if (operand2 < *res) |
|
*res = operand2; |
|
break; |
|
case ('a'): |
|
if (operand2 > *res) |
|
*res = operand2; |
|
break; |
|
default: |
|
abort(); |
|
} |
|
} |
|
return(1); |
|
} |
|
|
void |
void |
roff_regunset(struct roff *r, enum regs reg) |
roff_setreg(struct roff *r, const char *name, int val, char sign) |
{ |
{ |
|
struct roffreg *reg; |
|
|
r->regs[(int)reg].set = 0; |
/* 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; |
} |
} |
|
|
/* ARGSUSED */ |
/* |
|
* 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_nr(ROFF_ARGS) |
roff_nr(ROFF_ARGS) |
{ |
{ |
const char *key; |
const char *key; |
char *val; |
char *val; |
int iv; |
int iv; |
|
char sign; |
|
|
val = *bufp + pos; |
val = *bufp + pos; |
key = roff_getname(r, &val, ln, pos); |
key = roff_getname(r, &val, ln, pos); |
|
|
if (0 == strcmp(key, "nS")) { |
sign = *val; |
r->regs[(int)REG_nS].set = 1; |
if ('+' == sign || '-' == sign) |
if ((iv = mandoc_strntoi(val, strlen(val), 10)) >= 0) |
val++; |
r->regs[(int)REG_nS].u = (unsigned)iv; |
|
else |
|
r->regs[(int)REG_nS].u = 0u; |
|
} |
|
|
|
|
if (roff_evalnum(val, NULL, &iv, 0)) |
|
roff_setreg(r, key, iv, sign); |
|
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
|
static enum rofferr |
|
roff_rr(ROFF_ARGS) |
|
{ |
|
struct roffreg *reg, **prev; |
|
const char *name; |
|
char *cp; |
|
|
|
cp = *bufp + pos; |
|
name = roff_getname(r, &cp, ln, pos); |
|
|
|
prev = &r->regtab; |
|
while (1) { |
|
reg = *prev; |
|
if (NULL == reg || !strcmp(name, reg->key.p)) |
|
break; |
|
prev = ®->next; |
|
} |
|
if (NULL != reg) { |
|
*prev = reg->next; |
|
free(reg->key.p); |
|
free(reg); |
|
} |
|
return(ROFF_IGN); |
|
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_rm(ROFF_ARGS) |
roff_rm(ROFF_ARGS) |
Line 1174 roff_rm(ROFF_ARGS) |
|
Line 1706 roff_rm(ROFF_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
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); |
|
} |
|
cp += len + 1; |
|
|
|
/* Arm the input line trap. */ |
|
roffit_lines = iv; |
|
roffit_macro = mandoc_strdup(cp); |
|
return(ROFF_IGN); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_Dd(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
|
if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options)) |
|
for (cp = __mdoc_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_TH(ROFF_ARGS) |
|
{ |
|
const char *const *cp; |
|
|
|
if (0 == (MPARSE_QUICK & r->options)) |
|
for (cp = __man_reserved; *cp; cp++) |
|
roff_setstr(r, *cp, NULL, 0); |
|
|
|
return(ROFF_CONT); |
|
} |
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
roff_TE(ROFF_ARGS) |
roff_TE(ROFF_ARGS) |
{ |
{ |
|
|
Line 1198 roff_T_(ROFF_ARGS) |
|
Line 1781 roff_T_(ROFF_ARGS) |
|
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
int |
#if 0 |
|
static int |
roff_closeeqn(struct roff *r) |
roff_closeeqn(struct roff *r) |
{ |
{ |
|
|
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
} |
} |
|
#endif |
|
|
void |
static void |
roff_openeqn(struct roff *r, const char *name, int line, |
roff_openeqn(struct roff *r, const char *name, int line, |
int offs, const char *buf) |
int offs, const char *buf) |
{ |
{ |
Line 1250 roff_EN(ROFF_ARGS) |
|
Line 1835 roff_EN(ROFF_ARGS) |
|
static enum rofferr |
static enum rofferr |
roff_TS(ROFF_ARGS) |
roff_TS(ROFF_ARGS) |
{ |
{ |
struct tbl_node *t; |
struct tbl_node *tbl; |
|
|
if (r->tbl) { |
if (r->tbl) { |
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
tbl_end(&r->tbl); |
tbl_end(&r->tbl); |
} |
} |
|
|
t = tbl_alloc(ppos, ln, r->parse); |
tbl = tbl_alloc(ppos, ln, r->parse); |
|
|
if (r->last_tbl) |
if (r->last_tbl) |
r->last_tbl->next = t; |
r->last_tbl->next = tbl; |
else |
else |
r->first_tbl = r->last_tbl = t; |
r->first_tbl = r->last_tbl = tbl; |
|
|
r->tbl = r->last_tbl = t; |
r->tbl = r->last_tbl = tbl; |
return(ROFF_IGN); |
return(ROFF_IGN); |
} |
} |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
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) |
roff_so(ROFF_ARGS) |
{ |
{ |
char *name; |
char *name; |
Line 1303 roff_userdef(ROFF_ARGS) |
|
Line 1970 roff_userdef(ROFF_ARGS) |
|
|
|
/* |
/* |
* Collect pointers to macro argument strings |
* Collect pointers to macro argument strings |
* and null-terminate them. |
* and NUL-terminate them. |
*/ |
*/ |
cp = *bufp + pos; |
cp = *bufp + pos; |
for (i = 0; i < 9; i++) |
for (i = 0; i < 9; i++) |
Line 1383 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
Line 2050 roff_getname(struct roff *r, char **cpp, int ln, int p |
|
|
|
/* |
/* |
* Store *string into the user-defined string called *name. |
* Store *string into the user-defined string called *name. |
* In multiline mode, append to an existing entry and append '\n'; |
|
* else replace the existing entry, if there is one. |
|
* To clear an existing entry, call with (*r, *name, NULL, 0). |
* To clear an existing entry, call with (*r, *name, NULL, 0). |
|
* append == 0: replace mode |
|
* append == 1: single-line append mode |
|
* append == 2: multiline append mode, append '\n' after each call |
*/ |
*/ |
static void |
static void |
roff_setstr(struct roff *r, const char *name, const char *string, |
roff_setstr(struct roff *r, const char *name, const char *string, |
int multiline) |
int append) |
{ |
{ |
struct roffstr *n; |
|
char *c; |
|
size_t oldch, newch; |
|
|
|
|
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. */ |
/* Search for an existing string with the same name. */ |
n = r->first_string; |
n = *r; |
while (n && strcmp(name, n->name)) |
|
|
while (n && strcmp(name, n->key.p)) |
n = n->next; |
n = n->next; |
|
|
if (NULL == n) { |
if (NULL == n) { |
/* Create a new string table entry. */ |
/* Create a new string table entry. */ |
n = mandoc_malloc(sizeof(struct roffstr)); |
n = mandoc_malloc(sizeof(struct roffkv)); |
n->name = mandoc_strdup(name); |
n->key.p = mandoc_strndup(name, namesz); |
n->string = NULL; |
n->key.sz = namesz; |
n->next = r->first_string; |
n->val.p = NULL; |
r->first_string = n; |
n->val.sz = 0; |
} else if (0 == multiline) { |
n->next = *r; |
/* In multiline mode, append; else replace. */ |
*r = n; |
free(n->string); |
} else if (0 == append) { |
n->string = NULL; |
free(n->val.p); |
|
n->val.p = NULL; |
|
n->val.sz = 0; |
} |
} |
|
|
if (NULL == string) |
if (NULL == string) |
Line 1420 roff_setstr(struct roff *r, const char *name, const ch |
|
Line 2101 roff_setstr(struct roff *r, const char *name, const ch |
|
* One additional byte for the '\n' in multiline mode, |
* One additional byte for the '\n' in multiline mode, |
* and one for the terminating '\0'. |
* and one for the terminating '\0'. |
*/ |
*/ |
newch = strlen(string) + (multiline ? 2u : 1u); |
newch = stringsz + (1 < append ? 2u : 1u); |
if (NULL == n->string) { |
|
n->string = mandoc_malloc(newch); |
if (NULL == n->val.p) { |
*n->string = '\0'; |
n->val.p = mandoc_malloc(newch); |
|
*n->val.p = '\0'; |
oldch = 0; |
oldch = 0; |
} else { |
} else { |
oldch = strlen(n->string); |
oldch = n->val.sz; |
n->string = mandoc_realloc(n->string, oldch + newch); |
n->val.p = mandoc_realloc(n->val.p, oldch + newch); |
} |
} |
|
|
/* Skip existing content in the destination buffer. */ |
/* Skip existing content in the destination buffer. */ |
c = n->string + (int)oldch; |
c = n->val.p + (int)oldch; |
|
|
/* Append new content to the destination buffer. */ |
/* Append new content to the destination buffer. */ |
while (*string) { |
i = 0; |
|
while (i < (int)stringsz) { |
/* |
/* |
* Rudimentary roff copy mode: |
* Rudimentary roff copy mode: |
* Handle escaped backslashes. |
* Handle escaped backslashes. |
*/ |
*/ |
if ('\\' == *string && '\\' == *(string + 1)) |
if ('\\' == string[i] && '\\' == string[i + 1]) |
string++; |
i++; |
*c++ = *string++; |
*c++ = string[i++]; |
} |
} |
|
|
/* Append terminating bytes. */ |
/* Append terminating bytes. */ |
if (multiline) |
if (1 < append) |
*c++ = '\n'; |
*c++ = '\n'; |
|
|
*c = '\0'; |
*c = '\0'; |
|
n->val.sz = (int)(c - n->val.p); |
} |
} |
|
|
static const char * |
static const char * |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
{ |
{ |
const struct roffstr *n; |
const struct roffkv *n; |
|
int i; |
|
|
n = r->first_string; |
for (n = r->strtab; n; n = n->next) |
while (n && (strncmp(name, n->name, len) || '\0' != n->name[(int)len])) |
if (0 == strncmp(name, n->key.p, len) && |
n = n->next; |
'\0' == n->key.p[(int)len]) |
|
return(n->val.p); |
|
|
return(n ? n->string : NULL); |
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 |
static void |
roff_freestr(struct roff *r) |
roff_freestr(struct roffkv *r) |
{ |
{ |
struct roffstr *n, *nn; |
struct roffkv *n, *nn; |
|
|
for (n = r->first_string; n; n = nn) { |
for (n = r; n; n = nn) { |
free(n->name); |
free(n->key.p); |
free(n->string); |
free(n->val.p); |
nn = n->next; |
nn = n->next; |
free(n); |
free(n); |
} |
} |
|
|
r->first_string = NULL; |
|
} |
} |
|
|
const struct tbl_span * |
const struct tbl_span * |
Line 1491 roff_eqn(const struct roff *r) |
|
Line 2181 roff_eqn(const struct roff *r) |
|
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
} |
} |
|
|
char |
/* |
roff_eqndelim(const struct roff *r) |
* 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; |
|
|
return('\0'); |
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); |
} |
} |