| version 1.53, 2008/12/08 20:32:49 |
version 1.206, 2014/04/08 01:37:27 |
|
|
| /* $Id$ */ |
/* $Id$ */ |
| /* |
/* |
| * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv> |
| |
* Copyright (c) 2010-2014 Ingo Schwarze <schwarze@openbsd.org> |
| * |
* |
| * Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
| * purpose with or without fee is hereby granted, provided that the |
* purpose with or without fee is hereby granted, provided that the above |
| * above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
| * copies. |
|
| * |
* |
| * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
| * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
| * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
| * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
| * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
| * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
| * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
| * PERFORMANCE OF THIS SOFTWARE. |
|
| */ |
*/ |
| #include <sys/param.h> |
#ifdef HAVE_CONFIG_H |
| #include <sys/types.h> |
#include "config.h" |
| |
#endif |
| |
|
| #include <assert.h> |
#include <assert.h> |
| #include <ctype.h> |
#include <ctype.h> |
| #include <err.h> |
|
| #include <stdarg.h> |
|
| #include <stdlib.h> |
|
| #include <stdio.h> |
#include <stdio.h> |
| |
#include <stdlib.h> |
| #include <string.h> |
#include <string.h> |
| #include <time.h> |
|
| |
|
| #include "libmdocml.h" |
#include "mandoc.h" |
| #include "private.h" |
#include "mandoc_aux.h" |
| #include "roff.h" |
#include "libroff.h" |
| |
#include "libmandoc.h" |
| |
|
| /* FIXME: First letters of quoted-text interpreted in rofffindtok. */ |
/* Maximum number of nested if-else conditionals. */ |
| /* FIXME: `No' not implemented. */ |
#define RSTACK_MAX 128 |
| /* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
|
| /* TODO: warn about empty lists. */ |
|
| /* TODO: (warn) some sections need specific elements. */ |
|
| /* TODO: (warn) NAME section has particular order. */ |
|
| /* TODO: unify empty-content tags a la <br />. */ |
|
| /* TODO: macros with a set number of arguments? */ |
|
| /* TODO: validate Dt macro arguments. */ |
|
| /* FIXME: Bl -diag supposed to ignore callable children. */ |
|
| /* FIXME: Nm has newline when used in NAME section. */ |
|
| |
|
| |
/* Maximum number of string expansions per line, to break infinite loops. */ |
| |
#define EXPAND_LIMIT 1000 |
| |
|
| |
enum rofft { |
| |
ROFF_ad, |
| |
ROFF_am, |
| |
ROFF_ami, |
| |
ROFF_am1, |
| |
ROFF_as, |
| |
ROFF_cc, |
| |
ROFF_ce, |
| |
ROFF_de, |
| |
ROFF_dei, |
| |
ROFF_de1, |
| |
ROFF_ds, |
| |
ROFF_el, |
| |
ROFF_fam, |
| |
ROFF_hw, |
| |
ROFF_hy, |
| |
ROFF_ie, |
| |
ROFF_if, |
| |
ROFF_ig, |
| |
ROFF_it, |
| |
ROFF_ne, |
| |
ROFF_nh, |
| |
ROFF_nr, |
| |
ROFF_ns, |
| |
ROFF_ps, |
| |
ROFF_rm, |
| |
ROFF_rr, |
| |
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 |
| |
}; |
| |
|
| |
/* |
| |
* 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 mparse *parse; /* parse point */ |
| |
int options; /* parse options */ |
| |
struct roffnode *last; /* leaf of stack */ |
| |
int rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
| |
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 { |
| int tok; /* Token id. */ |
enum rofft tok; /* type of node */ |
| struct roffnode *parent; /* Parent (or NULL). */ |
struct roffnode *parent; /* up one in stack */ |
| |
int line; /* parse line */ |
| |
int col; /* parse col */ |
| |
char *name; /* node name, e.g. macro name */ |
| |
char *end; /* end-rules: custom token */ |
| |
int endspan; /* end-rules: next-line or infty */ |
| |
int rule; /* current evaluation rule */ |
| }; |
}; |
| |
|
| struct rofftree { |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
| struct roffnode *last; /* Last parsed node. */ |
enum rofft tok, /* tok of macro */ \ |
| char *cur; /* Line start. */ |
char **bufp, /* input buffer */ \ |
| struct tm tm; /* `Dd' results. */ |
size_t *szp, /* size of input buffer */ \ |
| char name[64]; /* `Nm' results. */ |
int ln, /* parse line */ \ |
| char os[64]; /* `Os' results. */ |
int ppos, /* original pos in buffer */ \ |
| char title[64]; /* `Dt' results. */ |
int pos, /* current pos in buffer */ \ |
| enum roffmsec section; |
int *offs /* reset offset of buffer data */ |
| char volume[64]; /* `Dt' results. */ |
|
| int state; |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
| #define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ |
|
| #define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
struct roffmac { |
| #define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
const char *name; /* macro name */ |
| #define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
roffproc proc; /* process new macro */ |
| #define ROFF_BODY (1 << 5) /* In roff body. */ |
roffproc text; /* process as child text of macro */ |
| struct roffcb cb; /* Callbacks. */ |
roffproc sub; /* process as child of macro */ |
| void *arg; /* Callbacks' arg. */ |
int flags; |
| int csec; /* Current section. */ |
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
| int asec; /* Thus-far sections. */ |
struct roffmac *next; |
| }; |
}; |
| |
|
| static struct roffnode *roffnode_new(int, struct rofftree *); |
struct predef { |
| static void roffnode_free(struct rofftree *); |
const char *name; /* predefined input name */ |
| static void roff_warn(const struct rofftree *, |
const char *str; /* replacement symbol */ |
| const char *, char *, ...); |
}; |
| static void roff_err(const struct rofftree *, |
|
| const char *, char *, ...); |
|
| static int roffpurgepunct(struct rofftree *, char **); |
|
| static int roffscan(int, const int *); |
|
| static int rofffindtok(const char *); |
|
| static int rofffindarg(const char *); |
|
| static int rofffindcallable(const char *); |
|
| static int roffismsec(const char *); |
|
| static int roffissec(const char **); |
|
| static int roffispunct(const char *); |
|
| static int roffisatt(const char *); |
|
| static int roffchecksec(struct rofftree *, |
|
| const char *, int); |
|
| static int roffargs(const struct rofftree *, |
|
| int, char *, char **); |
|
| static int roffargok(int, int); |
|
| static int roffnextopt(const struct rofftree *, |
|
| int, char ***, char **); |
|
| static int roffparseopts(struct rofftree *, int, |
|
| char ***, int *, char **); |
|
| static int roffcall(struct rofftree *, int, char **); |
|
| static int roffexit(struct rofftree *, int); |
|
| static int roffparse(struct rofftree *, char *); |
|
| static int textparse(struct rofftree *, char *); |
|
| static int roffdata(struct rofftree *, int, char *); |
|
| static int roffspecial(struct rofftree *, int, |
|
| const char *, const int *, |
|
| const char **, size_t, char **); |
|
| static int roffsetname(struct rofftree *, char **); |
|
| |
|
| #ifdef __linux__ |
#define PREDEF(__name, __str) \ |
| extern size_t strlcat(char *, const char *, size_t); |
{ (__name), (__str) }, |
| extern size_t strlcpy(char *, const char *, size_t); |
|
| extern int vsnprintf(char *, size_t, |
|
| const char *, va_list); |
|
| extern char *strptime(const char *, const char *, |
|
| struct tm *); |
|
| #endif |
|
| |
|
| int |
static enum rofft roffhash_find(const char *, size_t); |
| roff_free(struct rofftree *tree, int flush) |
static void roffhash_init(void); |
| { |
static void roffnode_cleanscope(struct roff *); |
| int error, t; |
static void roffnode_pop(struct roff *); |
| struct roffnode *n; |
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_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 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 enum rofferr roff_rr(ROFF_ARGS); |
| |
static void roff_setstr(struct roff *, |
| |
const char *, const char *, int); |
| |
static void roff_setstrn(struct roffkv **, const char *, |
| |
size_t, const char *, size_t, int); |
| |
static enum rofferr roff_so(ROFF_ARGS); |
| |
static enum rofferr roff_tr(ROFF_ARGS); |
| |
static enum rofferr roff_Dd(ROFF_ARGS); |
| |
static enum rofferr roff_TH(ROFF_ARGS); |
| |
static enum rofferr roff_TE(ROFF_ARGS); |
| |
static enum rofferr roff_TS(ROFF_ARGS); |
| |
static enum rofferr roff_EQ(ROFF_ARGS); |
| |
static enum rofferr roff_EN(ROFF_ARGS); |
| |
static enum rofferr roff_T_(ROFF_ARGS); |
| |
static enum rofferr roff_userdef(ROFF_ARGS); |
| |
|
| error = 0; |
/* See roffhash_find() */ |
| |
|
| if ( ! flush) |
#define ASCII_HI 126 |
| goto end; |
#define ASCII_LO 33 |
| |
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
| |
|
| error = 1; |
static struct roffmac *hash[HASHWIDTH]; |
| |
|
| if (ROFF_PRELUDE & tree->state) { |
static struct roffmac roffs[ROFF_MAX] = { |
| roff_err(tree, NULL, "prelude never finished"); |
{ "ad", roff_line_ignore, NULL, NULL, 0, NULL }, |
| goto end; |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| } else if ( ! (ROFFSec_NAME & tree->asec)) { |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| roff_err(tree, NULL, "missing `NAME' section"); |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| goto end; |
{ "as", roff_ds, NULL, NULL, 0, NULL }, |
| } else if ( ! (ROFFSec_NMASK & tree->asec)) |
{ "cc", roff_cc, NULL, NULL, 0, NULL }, |
| roff_warn(tree, NULL, "missing suggested `NAME', " |
{ "ce", roff_line_ignore, NULL, NULL, 0, NULL }, |
| "`SYNOPSIS', `DESCRIPTION' sections"); |
{ "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 }, |
| |
{ "rr", roff_rr, NULL, NULL, 0, NULL }, |
| |
{ "so", roff_so, NULL, NULL, 0, NULL }, |
| |
{ "ta", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "tr", roff_tr, NULL, NULL, 0, NULL }, |
| |
{ "Dd", roff_Dd, NULL, NULL, 0, NULL }, |
| |
{ "TH", roff_TH, NULL, NULL, 0, NULL }, |
| |
{ "TS", roff_TS, NULL, NULL, 0, NULL }, |
| |
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
| |
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
| |
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
| |
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
| |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
| |
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
| |
}; |
| |
|
| for (n = tree->last; n; n = n->parent) { |
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ |
| if (0 != tokens[n->tok].ctx) |
const char *const __mdoc_reserved[] = { |
| continue; |
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
| roff_err(tree, NULL, "closing explicit scope `%s'", |
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
| toknames[n->tok]); |
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
| goto end; |
"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 |
| |
}; |
| |
|
| while (tree->last) { |
/* not currently implemented: BT DE DS ME MT PT SY TQ YS */ |
| t = tree->last->tok; |
const char *const __man_reserved[] = { |
| if ( ! roffexit(tree, t)) |
"AT", "B", "BI", "BR", "DT", |
| goto end; |
"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 |
| |
}; |
| |
|
| if ( ! (*tree->cb.rofftail)(tree->arg)) |
/* Array of injected predefined strings. */ |
| goto end; |
#define PREDEFS_MAX 38 |
| |
static const struct predef predefs[PREDEFS_MAX] = { |
| |
#include "predefs.in" |
| |
}; |
| |
|
| error = 0; |
/* See roffhash_find() */ |
| |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
| |
|
| end: |
static int roffit_lines; /* number of lines to delay */ |
| |
static char *roffit_macro; /* nil-terminated macro line */ |
| |
|
| while (tree->last) |
static void |
| roffnode_free(tree); |
roffhash_init(void) |
| |
{ |
| |
struct roffmac *n; |
| |
int buc, i; |
| |
|
| free(tree); |
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
| |
assert(roffs[i].name[0] >= ASCII_LO); |
| |
assert(roffs[i].name[0] <= ASCII_HI); |
| |
|
| return(error ? 0 : 1); |
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]; |
| |
} |
| } |
} |
| |
|
| |
/* |
| struct rofftree * |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
| roff_alloc(const struct roffcb *cb, void *args) |
* the nil-terminated string name could be found. |
| |
*/ |
| |
static enum rofft |
| |
roffhash_find(const char *p, size_t s) |
| { |
{ |
| struct rofftree *tree; |
int buc; |
| |
struct roffmac *n; |
| |
|
| assert(args); |
/* |
| assert(cb); |
* libroff has an extremely simple hashtable, for the time |
| |
* being, which simply keys on the first character, which must |
| |
* be printable, then walks a chain. It works well enough until |
| |
* optimised. |
| |
*/ |
| |
|
| if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
| err(1, "calloc"); |
return(ROFF_MAX); |
| |
|
| tree->state = ROFF_PRELUDE; |
buc = ROFF_HASH(p); |
| tree->arg = args; |
|
| tree->section = ROFF_MSEC_MAX; |
|
| |
|
| (void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
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(tree); |
return(ROFF_MAX); |
| } |
} |
| |
|
| |
|
| int |
/* |
| roff_engine(struct rofftree *tree, char *buf) |
* Pop the current node off of the stack of roff instructions currently |
| |
* pending. |
| |
*/ |
| |
static void |
| |
roffnode_pop(struct roff *r) |
| { |
{ |
| |
struct roffnode *p; |
| |
|
| tree->cur = buf; |
assert(r->last); |
| assert(buf); |
p = r->last; |
| |
|
| if (0 == *buf) { |
r->last = r->last->parent; |
| roff_err(tree, buf, "blank line"); |
free(p->name); |
| return(0); |
free(p->end); |
| } else if ('.' != *buf) |
free(p); |
| return(textparse(tree, buf)); |
} |
| |
|
| return(roffparse(tree, buf)); |
|
| |
/* |
| |
* Push a roff node onto the instruction stack. This must later be |
| |
* removed with roffnode_pop(). |
| |
*/ |
| |
static void |
| |
roffnode_push(struct roff *r, enum rofft tok, const char *name, |
| |
int line, int col) |
| |
{ |
| |
struct roffnode *p; |
| |
|
| |
p = mandoc_calloc(1, sizeof(struct roffnode)); |
| |
p->tok = tok; |
| |
if (name) |
| |
p->name = mandoc_strdup(name); |
| |
p->parent = r->last; |
| |
p->line = line; |
| |
p->col = col; |
| |
p->rule = p->parent ? p->parent->rule : 0; |
| |
|
| |
r->last = p; |
| } |
} |
| |
|
| |
|
| static int |
static void |
| textparse(struct rofftree *tree, char *buf) |
roff_free1(struct roff *r) |
| { |
{ |
| char *bufp; |
struct tbl_node *tbl; |
| |
struct eqn_node *e; |
| |
int i; |
| |
|
| /* TODO: literal parsing. */ |
while (NULL != (tbl = r->first_tbl)) { |
| |
r->first_tbl = tbl->next; |
| |
tbl_free(tbl); |
| |
} |
| |
|
| if ( ! (ROFF_BODY & tree->state)) { |
r->first_tbl = r->last_tbl = r->tbl = NULL; |
| roff_err(tree, buf, "data not in body"); |
|
| return(0); |
while (NULL != (e = r->first_eqn)) { |
| |
r->first_eqn = e->next; |
| |
eqn_free(e); |
| } |
} |
| |
|
| /* LINTED */ |
r->first_eqn = r->last_eqn = r->eqn = NULL; |
| while (*buf) { |
|
| while (*buf && isspace(*buf)) |
|
| buf++; |
|
| |
|
| if (0 == *buf) |
while (r->last) |
| break; |
roffnode_pop(r); |
| |
|
| bufp = buf++; |
roff_freestr(r->strtab); |
| |
roff_freestr(r->xmbtab); |
| |
|
| while (*buf && ! isspace(*buf)) |
r->strtab = r->xmbtab = NULL; |
| buf++; |
|
| |
|
| if (0 != *buf) { |
roff_freereg(r->regtab); |
| *buf++ = 0; |
|
| if ( ! roffdata(tree, 1, bufp)) |
|
| return(0); |
|
| continue; |
|
| } |
|
| |
|
| if ( ! roffdata(tree, 1, bufp)) |
r->regtab = NULL; |
| return(0); |
|
| break; |
|
| } |
|
| |
|
| return(1); |
if (r->xtab) |
| |
for (i = 0; i < 128; i++) |
| |
free(r->xtab[i].p); |
| |
|
| |
free(r->xtab); |
| |
r->xtab = NULL; |
| } |
} |
| |
|
| |
void |
| |
roff_reset(struct roff *r) |
| |
{ |
| |
|
| static int |
roff_free1(r); |
| roffargs(const struct rofftree *tree, |
r->control = 0; |
| int tok, char *buf, char **argv) |
} |
| |
|
| |
|
| |
void |
| |
roff_free(struct roff *r) |
| { |
{ |
| int i; |
|
| char *p; |
|
| |
|
| assert(tok >= 0 && tok < ROFF_MAX); |
roff_free1(r); |
| assert('.' == *buf); |
free(r); |
| |
} |
| |
|
| p = buf; |
|
| |
|
| /* |
struct roff * |
| * This is an ugly little loop. It parses a line into |
roff_alloc(struct mparse *parse, int options) |
| * space-delimited tokens. If a quote mark is encountered, a |
{ |
| * token is alloted the entire quoted text. If whitespace is |
struct roff *r; |
| * escaped, it's included in the prior alloted token. |
|
| */ |
|
| |
|
| /* LINTED */ |
r = mandoc_calloc(1, sizeof(struct roff)); |
| for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) { |
r->parse = parse; |
| if ('\"' == *buf) { |
r->options = options; |
| argv[i] = ++buf; |
r->rstackpos = -1; |
| while (*buf && '\"' != *buf) |
|
| buf++; |
roffhash_init(); |
| if (0 == *buf) { |
|
| roff_err(tree, argv[i], "unclosed " |
return(r); |
| "quote in argument " |
} |
| "list for `%s'", |
|
| toknames[tok]); |
/* |
| return(0); |
* In the current line, expand escape sequences that tend to get |
| |
* used in numerical expressions and conditional requests. |
| |
* Also check the syntax of the remaining escape sequences. |
| |
*/ |
| |
static enum rofferr |
| |
roff_res(struct roff *r, 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 *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 maxl; /* expected length of the escape name */ |
| |
size_t naml; /* actual length of the escape name */ |
| |
size_t ressz; /* size of the replacement string */ |
| |
int expand_count; /* to avoid infinite loops */ |
| |
int npos; /* position in numeric expression */ |
| |
int irc; /* return code from roff_evalnum() */ |
| |
char term; /* character terminating the escape */ |
| |
|
| |
expand_count = 0; |
| |
start = *bufp + pos; |
| |
stesc = strchr(start, '\0') - 1; |
| |
while (stesc-- > start) { |
| |
|
| |
/* Search backwards for the next backslash. */ |
| |
|
| |
if ('\\' != *stesc) |
| |
continue; |
| |
|
| |
/* If it is escaped, skip it. */ |
| |
|
| |
for (cp = stesc - 1; cp >= start; cp--) |
| |
if ('\\' != *cp) |
| |
break; |
| |
|
| |
if (0 == (stesc - cp) % 2) { |
| |
stesc = cp; |
| |
continue; |
| |
} |
| |
|
| |
/* Decide whether to expand or to check only. */ |
| |
|
| |
term = '\0'; |
| |
cp = stesc + 1; |
| |
switch (*cp) { |
| |
case ('*'): |
| |
res = NULL; |
| |
break; |
| |
case ('B'): |
| |
/* FALLTHROUGH */ |
| |
case ('w'): |
| |
term = cp[1]; |
| |
/* FALLTHROUGH */ |
| |
case ('n'): |
| |
res = ubuf; |
| |
break; |
| |
default: |
| |
if (ESCAPE_ERROR == mandoc_escape(&cp, NULL, NULL)) |
| |
mandoc_msg(MANDOCERR_BADESCAPE, r->parse, |
| |
ln, (int)(stesc - *bufp), NULL); |
| |
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 |
| |
* of the name of the string or register. |
| |
* Save a pointer to the name. |
| |
*/ |
| |
|
| |
if ('\0' == term) { |
| |
switch (*++cp) { |
| |
case ('\0'): |
| |
maxl = 0; |
| |
break; |
| |
case ('('): |
| |
cp++; |
| |
maxl = 2; |
| |
break; |
| |
case ('['): |
| |
cp++; |
| |
term = ']'; |
| |
maxl = 0; |
| |
break; |
| |
default: |
| |
maxl = 1; |
| |
break; |
| } |
} |
| } else { |
} else { |
| argv[i] = buf++; |
cp += 2; |
| while (*buf) { |
maxl = 0; |
| if ( ! isspace(*buf)) { |
} |
| buf++; |
stnam = cp; |
| continue; |
|
| } |
/* Advance to the end of the name. */ |
| if (*(buf - 1) == '\\') { |
|
| buf++; |
for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) { |
| continue; |
if ('\0' == *cp) { |
| } |
mandoc_msg |
| |
(MANDOCERR_BADESCAPE, |
| |
r->parse, ln, |
| |
(int)(stesc - *bufp), NULL); |
| break; |
break; |
| } |
} |
| if (0 == *buf) |
if (0 == maxl && *cp == term) { |
| continue; |
cp++; |
| |
break; |
| |
} |
| } |
} |
| *buf++ = 0; |
|
| while (*buf && isspace(*buf)) |
|
| buf++; |
|
| } |
|
| |
|
| assert(i > 0); |
/* |
| if (ROFF_MAXLINEARG == i && *buf) { |
* Retrieve the replacement string; if it is |
| roff_err(tree, p, "too many arguments for `%s'", toknames |
* undefined, resume searching for escapes. |
| [tok]); |
*/ |
| return(0); |
|
| } |
|
| |
|
| argv[i] = NULL; |
switch (stesc[1]) { |
| return(1); |
case ('*'): |
| } |
res = roff_getstrn(r, stnam, naml); |
| |
break; |
| |
case ('B'): |
| |
npos = 0; |
| |
irc = roff_evalnum(stnam, &npos, NULL, 0); |
| |
ubuf[0] = irc && stnam + npos + 1 == cp |
| |
? '1' : '0'; |
| |
ubuf[1] = '\0'; |
| |
break; |
| |
case ('n'): |
| |
snprintf(ubuf, sizeof(ubuf), "%d", |
| |
roff_getregn(r, stnam, naml)); |
| |
break; |
| |
case ('w'): |
| |
snprintf(ubuf, sizeof(ubuf), "%d", |
| |
24 * (int)naml); |
| |
break; |
| |
} |
| |
|
| |
if (NULL == res) { |
| |
mandoc_msg |
| |
(MANDOCERR_BADESCAPE, r->parse, |
| |
ln, (int)(stesc - *bufp), NULL); |
| |
res = ""; |
| |
} |
| |
ressz = strlen(res); |
| |
|
| static int |
/* Replace the escape sequence by the string. */ |
| roffscan(int tok, const int *tokv) |
|
| { |
|
| |
|
| if (NULL == tokv) |
*szp += ressz + 1; |
| return(1); |
nbuf = mandoc_malloc(*szp); |
| |
|
| for ( ; ROFF_MAX != *tokv; tokv++) |
strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1)); |
| if (tok == *tokv) |
strlcat(nbuf, res, *szp); |
| return(1); |
strlcat(nbuf, cp, *szp); |
| |
|
| return(0); |
/* Prepare for the next replacement. */ |
| |
|
| |
start = nbuf + pos; |
| |
stesc = nbuf + (stesc - *bufp) + ressz; |
| |
free(*bufp); |
| |
*bufp = nbuf; |
| |
} |
| |
return(ROFF_CONT); |
| } |
} |
| |
|
| |
/* |
| static int |
* Process text streams: |
| roffparse(struct rofftree *tree, char *buf) |
* 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) |
| { |
{ |
| int tok, t; |
size_t sz; |
| struct roffnode *n; |
const char *start; |
| char *argv[ROFF_MAXLINEARG]; |
char *p; |
| char **argvp; |
int isz; |
| |
enum mandoc_esc esc; |
| |
|
| if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2)) |
start = p = *bufp + pos; |
| if (0 == strncmp(buf, ".\\\"", 3)) |
|
| return(1); |
|
| |
|
| if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
while ('\0' != *p) { |
| roff_err(tree, buf, "bogus line macro"); |
sz = strcspn(p, "-\\"); |
| return(0); |
p += sz; |
| } else if ( ! roffargs(tree, tok, buf, argv)) |
|
| return(0); |
|
| |
|
| argvp = (char **)argv; |
if ('\0' == *p) |
| |
break; |
| |
|
| /* |
if ('\\' == *p) { |
| * Prelude macros break some assumptions, so branch now. |
/* Skip over escapes. */ |
| */ |
p++; |
| |
esc = mandoc_escape((const char **)&p, NULL, NULL); |
| if (ROFF_PRELUDE & tree->state) { |
if (ESCAPE_ERROR == esc) |
| assert(NULL == tree->last); |
break; |
| return(roffcall(tree, tok, argvp)); |
continue; |
| } |
} else if (p == start) { |
| |
p++; |
| |
continue; |
| |
} |
| |
|
| assert(ROFF_BODY & tree->state); |
if (isalpha((unsigned char)p[-1]) && |
| |
isalpha((unsigned char)p[1])) |
| |
*p = ASCII_HYPH; |
| |
p++; |
| |
} |
| |
|
| /* |
/* Spring the input line trap. */ |
| * First check that our possible parents and parent's possible |
if (1 == roffit_lines) { |
| * children are satisfied. |
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 |
| |
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. |
| */ |
*/ |
| |
|
| if (tree->last && ! roffscan |
e = roff_res(r, bufp, szp, ln, pos); |
| (tree->last->tok, tokens[tok].parents)) { |
if (ROFF_IGN == e) |
| roff_err(tree, *argvp, "`%s' has invalid parent `%s'", |
return(e); |
| toknames[tok], |
assert(ROFF_CONT == e); |
| toknames[tree->last->tok]); |
|
| return(0); |
|
| } |
|
| |
|
| if (tree->last && ! roffscan |
ppos = pos; |
| (tok, tokens[tree->last->tok].children)) { |
ctl = roff_getcontrol(r, *bufp, &pos); |
| roff_err(tree, *argvp, "`%s' is invalid child of `%s'", |
|
| toknames[tok], |
/* |
| toknames[tree->last->tok]); |
* First, if a scope is open and we're not a macro, pass the |
| return(0); |
* 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)); |
| |
} |
| |
|
| /* |
/* |
| * Branch if we're not a layout token. |
* 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 (ROFF_LAYOUT != tokens[tok].type) |
if (r->last) { |
| return(roffcall(tree, tok, argvp)); |
t = r->last->tok; |
| if (0 == tokens[tok].ctx) |
assert(roffs[t].sub); |
| return(roffcall(tree, tok, argvp)); |
return((*roffs[t].sub) |
| |
(r, t, bufp, szp, |
| |
ln, ppos, pos, offs)); |
| |
} |
| |
|
| /* |
/* |
| * First consider implicit-end tags, like as follows: |
* Lastly, as we've no scope open, try to look up and execute |
| * .Sh SECTION 1 |
* the new macro. If no macro is found, simply return and let |
| * .Sh SECTION 2 |
* the compilers handle it. |
| * In this, we want to close the scope of the NAME section. If |
|
| * there's an intermediary implicit-end tag, such as |
|
| * .Sh SECTION 1 |
|
| * .Ss Subsection 1 |
|
| * .Sh SECTION 2 |
|
| * then it must be closed as well. |
|
| */ |
*/ |
| |
|
| if (tok == tokens[tok].ctx) { |
if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) |
| /* |
return(ROFF_CONT); |
| * First search up to the point where we must close. |
|
| * If one doesn't exist, then we can open a new scope. |
|
| */ |
|
| |
|
| for (n = tree->last; n; n = n->parent) { |
assert(roffs[t].proc); |
| assert(0 == tokens[n->tok].ctx || |
return((*roffs[t].proc) |
| n->tok == tokens[n->tok].ctx); |
(r, t, bufp, szp, |
| if (n->tok == tok) |
ln, ppos, pos, offs)); |
| break; |
} |
| if (ROFF_SHALLOW & tokens[tok].flags) { |
|
| n = NULL; |
|
| break; |
|
| } |
|
| if (tokens[n->tok].ctx == n->tok) |
|
| continue; |
|
| roff_err(tree, *argv, "`%s' breaks `%s' scope", |
|
| toknames[tok], toknames[n->tok]); |
|
| return(0); |
|
| } |
|
| |
|
| /* |
|
| * Create a new scope, as no previous one exists to |
|
| * close out. |
|
| */ |
|
| |
|
| if (NULL == n) |
void |
| return(roffcall(tree, tok, argvp)); |
roff_endparse(struct roff *r) |
| |
{ |
| |
|
| /* |
if (r->last) |
| * Close out all intermediary scoped blocks, then hang |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
| * the current scope from our predecessor's parent. |
r->last->line, r->last->col, NULL); |
| */ |
|
| |
|
| do { |
if (r->eqn) { |
| t = tree->last->tok; |
mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse, |
| if ( ! roffexit(tree, t)) |
r->eqn->eqn.ln, r->eqn->eqn.pos, NULL); |
| return(0); |
eqn_end(&r->eqn); |
| } while (t != tok); |
} |
| |
|
| return(roffcall(tree, tok, argvp)); |
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 |
| |
* form of ".foo xxx" in the usual way. |
| |
*/ |
| |
static enum rofft |
| |
roff_parse(struct roff *r, const char *buf, int *pos) |
| |
{ |
| |
const char *mac; |
| |
size_t maclen; |
| |
enum rofft t; |
| |
|
| |
if ('\0' == buf[*pos] || '"' == buf[*pos] || |
| |
'\t' == buf[*pos] || ' ' == buf[*pos]) |
| |
return(ROFF_MAX); |
| |
|
| |
/* We stop the macro parse at an escape, tab, space, or nil. */ |
| |
|
| |
mac = buf + *pos; |
| |
maclen = strcspn(mac, " \\\t\0"); |
| |
|
| |
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
| |
? ROFF_USERDEF : roffhash_find(mac, maclen); |
| |
|
| |
*pos += (int)maclen; |
| |
|
| |
while (buf[*pos] && ' ' == buf[*pos]) |
| |
(*pos)++; |
| |
|
| |
return(t); |
| |
} |
| |
|
| |
/* ARGSUSED */ |
| |
static enum rofferr |
| |
roff_cblock(ROFF_ARGS) |
| |
{ |
| |
|
| /* |
/* |
| * Now consider explicit-end tags, where we want to close back |
* A block-close `..' should only be invoked as a child of an |
| * to a specific tag. Example: |
* ignore macro, otherwise raise a warning and just ignore it. |
| * .Bl |
|
| * .It Item. |
|
| * .El |
|
| * In this, the `El' tag closes out the scope of `Bl'. |
|
| */ |
*/ |
| |
|
| assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
if (NULL == r->last) { |
| |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
return(ROFF_IGN); |
| |
} |
| |
|
| /* LINTED */ |
switch (r->last->tok) { |
| for (n = tree->last; n; n = n->parent) |
case (ROFF_am): |
| if (n->tok != tokens[tok].ctx) { |
/* FALLTHROUGH */ |
| if (n->tok == tokens[n->tok].ctx) |
case (ROFF_ami): |
| continue; |
/* FALLTHROUGH */ |
| roff_err(tree, *argv, "`%s' breaks `%s' scope", |
case (ROFF_am1): |
| toknames[tok], toknames[n->tok]); |
/* FALLTHROUGH */ |
| return(0); |
case (ROFF_de): |
| } else |
/* 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); |
| |
} |
| |
|
| |
if ((*bufp)[pos]) |
| |
mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL); |
| |
|
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
return(ROFF_IGN); |
| |
|
| |
} |
| |
|
| |
|
| |
static void |
| |
roffnode_cleanscope(struct roff *r) |
| |
{ |
| |
|
| |
while (r->last) { |
| |
if (--r->last->endspan != 0) |
| break; |
break; |
| |
roffnode_pop(r); |
| |
} |
| |
} |
| |
|
| |
|
| if (NULL == n) { |
static void |
| roff_err(tree, *argv, "`%s' has no starting tag `%s'", |
roff_ccond(struct roff *r, int ln, int ppos) |
| toknames[tok], |
{ |
| toknames[tokens[tok].ctx]); |
|
| return(0); |
if (NULL == r->last) { |
| |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
return; |
| } |
} |
| |
|
| /* LINTED */ |
switch (r->last->tok) { |
| do { |
case (ROFF_el): |
| t = tree->last->tok; |
/* FALLTHROUGH */ |
| if ( ! roffexit(tree, t)) |
case (ROFF_ie): |
| return(0); |
/* FALLTHROUGH */ |
| } while (t != tokens[tok].ctx); |
case (ROFF_if): |
| |
break; |
| |
default: |
| |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
return; |
| |
} |
| |
|
| return(1); |
if (r->last->endspan > -1) { |
| |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
return; |
| |
} |
| |
|
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
return; |
| } |
} |
| |
|
| |
|
| static int |
/* ARGSUSED */ |
| rofffindarg(const char *name) |
static enum rofferr |
| |
roff_block(ROFF_ARGS) |
| { |
{ |
| size_t i; |
int sv; |
| |
size_t sz; |
| |
char *name; |
| |
|
| /* FIXME: use a table, this is slow but ok for now. */ |
name = NULL; |
| |
|
| /* LINTED */ |
if (ROFF_ig != tok) { |
| for (i = 0; i < ROFF_ARGMAX; i++) |
if ('\0' == (*bufp)[pos]) { |
| /* LINTED */ |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
| if (0 == strcmp(name, tokargnames[i])) |
return(ROFF_IGN); |
| return((int)i); |
} |
| |
|
| return(ROFF_ARGMAX); |
/* |
| |
* Re-write `de1', since we don't really care about |
| |
* groff's strange compatibility mode, into `de'. |
| |
*/ |
| |
|
| |
if (ROFF_de1 == tok) |
| |
tok = ROFF_de; |
| |
if (ROFF_de == tok) |
| |
name = *bufp + pos; |
| |
else |
| |
mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos, |
| |
roffs[tok].name); |
| |
|
| |
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); |
| |
|
| |
/* If present, process the custom end-of-line marker. */ |
| |
|
| |
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); |
| |
|
| |
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); |
| } |
} |
| |
|
| |
|
| static int |
/* ARGSUSED */ |
| rofffindtok(const char *buf) |
static enum rofferr |
| |
roff_block_sub(ROFF_ARGS) |
| { |
{ |
| char token[4]; |
enum rofft t; |
| int i; |
int i, j; |
| |
|
| for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
/* |
| token[i] = *buf; |
* 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 (i == 3) |
if (r->last->end) { |
| return(ROFF_MAX); |
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
| |
if ((*bufp)[i] != r->last->end[j]) |
| |
break; |
| |
|
| token[i] = 0; |
if ('\0' == r->last->end[j] && |
| |
('\0' == (*bufp)[i] || |
| |
' ' == (*bufp)[i] || |
| |
'\t' == (*bufp)[i])) { |
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
|
| /* FIXME: use a table, this is slow but ok for now. */ |
while (' ' == (*bufp)[i] || '\t' == (*bufp)[i]) |
| |
i++; |
| |
|
| /* LINTED */ |
pos = i; |
| for (i = 0; i < ROFF_MAX; i++) |
if (ROFF_MAX != roff_parse(r, *bufp, &pos)) |
| /* LINTED */ |
return(ROFF_RERUN); |
| if (0 == strcmp(toknames[i], token)) |
return(ROFF_IGN); |
| return((int)i); |
} |
| |
} |
| |
|
| return(ROFF_MAX); |
/* |
| |
* If we have no custom end-query or lookup failed, then try |
| |
* pulling it out of the hashtable. |
| |
*/ |
| |
|
| |
t = roff_parse(r, *bufp, &pos); |
| |
|
| |
/* |
| |
* Macros other than block-end are only significant |
| |
* in `de' blocks; elsewhere, simply throw them away. |
| |
*/ |
| |
if (ROFF_cblock != t) { |
| |
if (ROFF_de == tok) |
| |
roff_setstr(r, r->last->name, *bufp + ppos, 2); |
| |
return(ROFF_IGN); |
| |
} |
| |
|
| |
assert(roffs[t].proc); |
| |
return((*roffs[t].proc)(r, t, bufp, szp, |
| |
ln, ppos, pos, offs)); |
| } |
} |
| |
|
| |
|
| static int |
/* ARGSUSED */ |
| roffchecksec(struct rofftree *tree, const char *start, int sec) |
static enum rofferr |
| |
roff_block_text(ROFF_ARGS) |
| { |
{ |
| int prior; |
|
| |
|
| switch (sec) { |
if (ROFF_de == tok) |
| case(ROFFSec_SYNOP): |
roff_setstr(r, r->last->name, *bufp + pos, 2); |
| if ((prior = ROFFSec_NAME) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_DESC): |
|
| if ((prior = ROFFSec_SYNOP) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_RETVAL): |
|
| if ((prior = ROFFSec_DESC) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_ENV): |
|
| if ((prior = ROFFSec_RETVAL) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_FILES): |
|
| if ((prior = ROFFSec_ENV) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_EX): |
|
| if ((prior = ROFFSec_FILES) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_DIAG): |
|
| if ((prior = ROFFSec_EX) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_ERRS): |
|
| if ((prior = ROFFSec_DIAG) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_SEEALSO): |
|
| if ((prior = ROFFSec_ERRS) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_STAND): |
|
| if ((prior = ROFFSec_SEEALSO) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_HIST): |
|
| if ((prior = ROFFSec_STAND) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_AUTH): |
|
| if ((prior = ROFFSec_HIST) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_CAVEATS): |
|
| if ((prior = ROFFSec_AUTH) & tree->asec) |
|
| return(1); |
|
| break; |
|
| case(ROFFSec_BUGS): |
|
| if ((prior = ROFFSec_CAVEATS) & tree->asec) |
|
| return(1); |
|
| break; |
|
| default: |
|
| return(1); |
|
| } |
|
| |
|
| roff_warn(tree, start, "section violates conventional order"); |
return(ROFF_IGN); |
| return(1); |
|
| } |
} |
| |
|
| |
|
| static int |
/* ARGSUSED */ |
| roffissec(const char **p) |
static enum rofferr |
| |
roff_cond_sub(ROFF_ARGS) |
| { |
{ |
| |
enum rofft t; |
| |
char *ep; |
| |
int rr; |
| |
|
| assert(*p); |
rr = r->last->rule; |
| if (NULL != *(p + 1)) { |
roffnode_cleanscope(r); |
| if (NULL != *(p + 2)) |
t = roff_parse(r, *bufp, &pos); |
| return(ROFFSec_OTHER); |
|
| if (0 == strcmp(*p, "RETURN") && |
/* |
| 0 == strcmp(*(p + 1), "VALUES")) |
* Fully handle known macros when they are structurally |
| return(ROFFSec_RETVAL); |
* required or when the conditional evaluated to true. |
| if (0 == strcmp(*p, "SEE") && |
*/ |
| 0 == strcmp(*(p + 1), "ALSO")) |
|
| return(ROFFSec_SEEALSO); |
if ((ROFF_MAX != t) && |
| return(ROFFSec_OTHER); |
(rr || ROFFMAC_STRUCT & roffs[t].flags)) { |
| |
assert(roffs[t].proc); |
| |
return((*roffs[t].proc)(r, t, bufp, szp, |
| |
ln, ppos, pos, offs)); |
| } |
} |
| |
|
| if (0 == strcmp(*p, "NAME")) |
/* |
| return(ROFFSec_NAME); |
* If `\}' occurs on a macro line without a preceding macro, |
| else if (0 == strcmp(*p, "SYNOPSIS")) |
* drop the line completely. |
| return(ROFFSec_SYNOP); |
*/ |
| else if (0 == strcmp(*p, "DESCRIPTION")) |
|
| return(ROFFSec_DESC); |
|
| else if (0 == strcmp(*p, "ENVIRONMENT")) |
|
| return(ROFFSec_ENV); |
|
| else if (0 == strcmp(*p, "FILES")) |
|
| return(ROFFSec_FILES); |
|
| else if (0 == strcmp(*p, "EXAMPLES")) |
|
| return(ROFFSec_EX); |
|
| else if (0 == strcmp(*p, "DIAGNOSTICS")) |
|
| return(ROFFSec_DIAG); |
|
| else if (0 == strcmp(*p, "ERRORS")) |
|
| return(ROFFSec_ERRS); |
|
| else if (0 == strcmp(*p, "STANDARDS")) |
|
| return(ROFFSec_STAND); |
|
| else if (0 == strcmp(*p, "HISTORY")) |
|
| return(ROFFSec_HIST); |
|
| else if (0 == strcmp(*p, "AUTHORS")) |
|
| return(ROFFSec_AUTH); |
|
| else if (0 == strcmp(*p, "CAVEATS")) |
|
| return(ROFFSec_CAVEATS); |
|
| else if (0 == strcmp(*p, "BUGS")) |
|
| return(ROFFSec_BUGS); |
|
| |
|
| return(ROFFSec_OTHER); |
ep = *bufp + pos; |
| |
if ('\\' == ep[0] && '}' == ep[1]) |
| |
rr = 0; |
| |
|
| |
/* Always check for the closing delimiter `\}'. */ |
| |
|
| |
while (NULL != (ep = strchr(ep, '\\'))) { |
| |
if ('}' == *(++ep)) { |
| |
*ep = '&'; |
| |
roff_ccond(r, ln, ep - *bufp - 1); |
| |
} |
| |
++ep; |
| |
} |
| |
return(rr ? ROFF_CONT : ROFF_IGN); |
| } |
} |
| |
|
| |
/* ARGSUSED */ |
| |
static enum rofferr |
| |
roff_cond_text(ROFF_ARGS) |
| |
{ |
| |
char *ep; |
| |
int rr; |
| |
|
| |
rr = r->last->rule; |
| |
roffnode_cleanscope(r); |
| |
|
| |
ep = *bufp + pos; |
| |
while (NULL != (ep = strchr(ep, '\\'))) { |
| |
if ('}' == *(++ep)) { |
| |
*ep = '&'; |
| |
roff_ccond(r, ln, ep - *bufp - 1); |
| |
} |
| |
++ep; |
| |
} |
| |
return(rr ? ROFF_CONT : ROFF_IGN); |
| |
} |
| |
|
| |
/* |
| |
* 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 |
static int |
| roffismsec(const char *p) |
roff_getnum(const char *v, int *pos, int *res) |
| { |
{ |
| |
int myres, n, p; |
| |
|
| if (0 == strcmp(p, "1")) |
if (NULL == res) |
| return(ROFF_MSEC_1); |
res = &myres; |
| else if (0 == strcmp(p, "2")) |
|
| return(ROFF_MSEC_2); |
|
| else if (0 == strcmp(p, "3")) |
|
| return(ROFF_MSEC_3); |
|
| else if (0 == strcmp(p, "3p")) |
|
| return(ROFF_MSEC_3p); |
|
| else if (0 == strcmp(p, "4")) |
|
| return(ROFF_MSEC_4); |
|
| else if (0 == strcmp(p, "5")) |
|
| return(ROFF_MSEC_5); |
|
| else if (0 == strcmp(p, "6")) |
|
| return(ROFF_MSEC_6); |
|
| else if (0 == strcmp(p, "7")) |
|
| return(ROFF_MSEC_7); |
|
| else if (0 == strcmp(p, "8")) |
|
| return(ROFF_MSEC_8); |
|
| else if (0 == strcmp(p, "9")) |
|
| return(ROFF_MSEC_9); |
|
| else if (0 == strcmp(p, "unass")) |
|
| return(ROFF_MSEC_UNASS); |
|
| else if (0 == strcmp(p, "draft")) |
|
| return(ROFF_MSEC_DRAFT); |
|
| else if (0 == strcmp(p, "paper")) |
|
| return(ROFF_MSEC_PAPER); |
|
| |
|
| return(ROFF_MSEC_MAX); |
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 |
static int |
| roffisatt(const char *p) |
roff_evalstrcond(const char *v, int *pos) |
| { |
{ |
| |
const char *s1, *s2, *s3; |
| |
int match; |
| |
|
| assert(p); |
match = 0; |
| if (0 == strcmp(p, "v1")) |
s1 = v + *pos; /* initial delimiter */ |
| return(1); |
s2 = s1 + 1; /* for scanning the first string */ |
| else if (0 == strcmp(p, "v2")) |
s3 = strchr(s2, *s1); /* for scanning the second string */ |
| return(1); |
|
| else if (0 == strcmp(p, "v3")) |
|
| return(1); |
|
| else if (0 == strcmp(p, "v6")) |
|
| return(1); |
|
| else if (0 == strcmp(p, "v7")) |
|
| return(1); |
|
| else if (0 == strcmp(p, "32v")) |
|
| return(1); |
|
| else if (0 == strcmp(p, "V.1")) |
|
| return(1); |
|
| else if (0 == strcmp(p, "V.4")) |
|
| return(1); |
|
| |
|
| return(0); |
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 |
static int |
| roffispunct(const char *p) |
roff_evalcond(const char *v, int *pos) |
| { |
{ |
| |
int wanttrue, number; |
| |
|
| if (0 == *p) |
if ('!' == v[*pos]) { |
| return(0); |
wanttrue = 0; |
| if (0 != *(p + 1)) |
(*pos)++; |
| return(0); |
} else |
| |
wanttrue = 1; |
| |
|
| switch (*p) { |
switch (v[*pos]) { |
| case('{'): |
case ('n'): |
| /* FALLTHROUGH */ |
/* FALLTHROUGH */ |
| case('.'): |
case ('o'): |
| |
(*pos)++; |
| |
return(wanttrue); |
| |
case ('c'): |
| /* FALLTHROUGH */ |
/* FALLTHROUGH */ |
| case(','): |
case ('d'): |
| /* FALLTHROUGH */ |
/* FALLTHROUGH */ |
| case(';'): |
case ('e'): |
| /* FALLTHROUGH */ |
/* FALLTHROUGH */ |
| case(':'): |
case ('r'): |
| /* FALLTHROUGH */ |
/* FALLTHROUGH */ |
| case('?'): |
case ('t'): |
| /* FALLTHROUGH */ |
(*pos)++; |
| case('!'): |
return(!wanttrue); |
| /* FALLTHROUGH */ |
|
| case('('): |
|
| /* FALLTHROUGH */ |
|
| case(')'): |
|
| /* FALLTHROUGH */ |
|
| case('['): |
|
| /* FALLTHROUGH */ |
|
| case(']'): |
|
| /* FALLTHROUGH */ |
|
| case('}'): |
|
| return(1); |
|
| default: |
default: |
| break; |
break; |
| } |
} |
| |
|
| return(0); |
if (roff_evalnum(v, pos, &number, 0)) |
| |
return((number > 0) == wanttrue); |
| |
else |
| |
return(roff_evalstrcond(v, pos) == wanttrue); |
| } |
} |
| |
|
| |
/* ARGSUSED */ |
| static int |
static enum rofferr |
| rofffindcallable(const char *name) |
roff_line_ignore(ROFF_ARGS) |
| { |
{ |
| int c; |
|
| |
|
| if (ROFF_MAX == (c = rofffindtok(name))) |
return(ROFF_IGN); |
| return(ROFF_MAX); |
|
| assert(c >= 0 && c < ROFF_MAX); |
|
| return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
|
| } |
} |
| |
|
| |
/* ARGSUSED */ |
| static struct roffnode * |
static enum rofferr |
| roffnode_new(int tokid, struct rofftree *tree) |
roff_cond(ROFF_ARGS) |
| { |
{ |
| struct roffnode *p; |
|
| |
|
| if (NULL == (p = malloc(sizeof(struct roffnode)))) |
|
| err(1, "malloc"); |
|
| |
|
| p->tok = tokid; |
roffnode_push(r, tok, NULL, ln, ppos); |
| p->parent = tree->last; |
|
| tree->last = p; |
|
| |
|
| return(p); |
/* |
| } |
* 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); |
| |
|
| static int |
/* |
| roffargok(int tokid, int argid) |
* An if-else will put the NEGATION of the current evaluated |
| { |
* conditional into the stack of rules. |
| const int *c; |
*/ |
| |
|
| if (NULL == (c = tokens[tokid].args)) |
if (ROFF_ie == tok) { |
| return(0); |
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; |
| |
} |
| |
|
| for ( ; ROFF_ARGMAX != *c; c++) |
/* If the parent has false as its rule, then so do we. */ |
| if (argid == *c) |
|
| return(1); |
|
| |
|
| return(0); |
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]) |
| |
pos++; |
| |
|
| |
/* An opening brace requests multiline scope. */ |
| |
|
| |
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
| |
r->last->endspan = -1; |
| |
pos += 2; |
| |
goto out; |
| |
} |
| |
|
| |
/* |
| |
* Anything else following the conditional causes |
| |
* single-line scope. Warn if the scope contains |
| |
* nothing but trailing whitespace. |
| |
*/ |
| |
|
| |
if ('\0' == (*bufp)[pos]) |
| |
mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL); |
| |
|
| |
r->last->endspan = 1; |
| |
|
| |
out: |
| |
*offs = pos; |
| |
return(ROFF_RERUN); |
| } |
} |
| |
|
| |
|
| static void |
/* ARGSUSED */ |
| roffnode_free(struct rofftree *tree) |
static enum rofferr |
| |
roff_ds(ROFF_ARGS) |
| { |
{ |
| struct roffnode *p; |
char *name, *string; |
| |
|
| assert(tree->last); |
/* |
| |
* A symbol is named by the first word following the macro |
| |
* 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. |
| |
*/ |
| |
|
| p = tree->last; |
string = *bufp + pos; |
| tree->last = tree->last->parent; |
name = roff_getname(r, &string, ln, pos); |
| free(p); |
if ('\0' == *name) |
| } |
return(ROFF_IGN); |
| |
|
| |
/* Read past initial double-quote. */ |
| |
if ('"' == *string) |
| |
string++; |
| |
|
| |
/* The rest is the value. */ |
| |
roff_setstr(r, name, string, ROFF_as == tok); |
| |
return(ROFF_IGN); |
| |
} |
| |
|
| |
/* |
| |
* Parse a single operator, one or two characters long. |
| |
* If the operator is recognized, return success and advance the |
| |
* parse point, else return failure and let the parse point unchanged. |
| |
*/ |
| static int |
static int |
| roffspecial(struct rofftree *tree, int tok, const char *start, |
roff_getop(const char *v, int *pos, char *res) |
| const int *argc, const char **argv, |
|
| size_t sz, char **ordp) |
|
| { |
{ |
| |
|
| switch (tok) { |
*res = v[*pos]; |
| case (ROFF_At): |
|
| if (0 == sz) |
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; |
break; |
| if (roffisatt(*ordp)) |
case ('>'): |
| |
*res = '!'; |
| |
(*pos)++; |
| break; |
break; |
| roff_err(tree, *ordp, "invalid `At' arg"); |
case ('?'): |
| return(0); |
*res = 'i'; |
| |
(*pos)++; |
| case (ROFF_Xr): |
|
| if (2 == sz) { |
|
| assert(ordp[1]); |
|
| if (ROFF_MSEC_MAX != roffismsec(ordp[1])) |
|
| break; |
|
| roff_warn(tree, start, "invalid `%s' manual " |
|
| "section", toknames[tok]); |
|
| } |
|
| /* FALLTHROUGH */ |
|
| |
|
| case (ROFF_Sx): |
|
| /* FALLTHROUGH*/ |
|
| case (ROFF_Fn): |
|
| if (0 != sz) |
|
| break; |
break; |
| roff_err(tree, start, "`%s' expects at least " |
default: |
| "one arg", toknames[tok]); |
|
| return(0); |
|
| |
|
| case (ROFF_Nm): |
|
| if (0 == sz) { |
|
| if (0 == tree->name[0]) { |
|
| roff_err(tree, start, "`Nm' not set"); |
|
| return(0); |
|
| } |
|
| ordp[0] = tree->name; |
|
| ordp[1] = NULL; |
|
| } else if ( ! roffsetname(tree, ordp)) |
|
| return(0); |
|
| break; |
|
| |
|
| case (ROFF_Rv): |
|
| /* FALLTHROUGH*/ |
|
| case (ROFF_Ex): |
|
| if (1 == sz) |
|
| break; |
break; |
| roff_err(tree, start, "`%s' expects one arg", |
|
| toknames[tok]); |
|
| return(0); |
|
| |
|
| case (ROFF_Sm): |
|
| if (1 != sz) { |
|
| roff_err(tree, start, "`Sm' expects one arg"); |
|
| return(0); |
|
| } |
|
| |
|
| if (0 != strcmp(ordp[0], "on") && |
|
| 0 != strcmp(ordp[0], "off")) { |
|
| roff_err(tree, start, "`Sm' has invalid argument"); |
|
| return(0); |
|
| } |
} |
| break; |
break; |
| |
case '>': |
| case (ROFF_Ud): |
switch (v[*pos + 1]) { |
| /* FALLTHROUGH */ |
case ('='): |
| case (ROFF_Ux): |
*res = 'g'; |
| /* FALLTHROUGH */ |
(*pos)++; |
| case (ROFF_Bt): |
break; |
| if (0 != sz) { |
case ('?'): |
| roff_err(tree, start, "`%s' expects no args", |
*res = 'a'; |
| toknames[tok]); |
(*pos)++; |
| return(0); |
break; |
| |
default: |
| |
break; |
| } |
} |
| break; |
break; |
| default: |
case '=': |
| |
if ('=' == v[*pos + 1]) |
| |
(*pos)++; |
| break; |
break; |
| |
default: |
| |
return(0); |
| } |
} |
| |
(*pos)++; |
| |
|
| return((*tree->cb.roffspecial)(tree->arg, tok, tree->cur, |
return(*res); |
| argc, argv, (const char **)ordp)); |
|
| } |
} |
| |
|
| |
/* |
| |
* Evaluate either a parenthesized numeric expression |
| |
* or a single signed integer number. |
| |
*/ |
| static int |
static int |
| roffexit(struct rofftree *tree, int tok) |
roff_evalpar(const char *v, int *pos, int *res) |
| { |
{ |
| |
|
| assert(tokens[tok].cb); |
if ('(' != v[*pos]) |
| return((*tokens[tok].cb)(tok, tree, NULL, ROFF_EXIT)); |
return(roff_getnum(v, pos, res)); |
| } |
|
| |
|
| |
(*pos)++; |
| |
if ( ! roff_evalnum(v, pos, res, 1)) |
| |
return(0); |
| |
|
| static int |
/* |
| roffcall(struct rofftree *tree, int tok, char **argv) |
* Omission of the closing parenthesis |
| { |
* is an error in validation mode, |
| int i; |
* but ignored in evaluation mode. |
| enum roffmsec c; |
*/ |
| |
|
| if (NULL == tokens[tok].cb) { |
if (')' == v[*pos]) |
| roff_err(tree, *argv, "`%s' is unsupported", |
(*pos)++; |
| toknames[tok]); |
else if (NULL == res) |
| return(0); |
return(0); |
| } |
|
| if (tokens[tok].sections && ROFF_MSEC_MAX != tree->section) { |
|
| i = 0; |
|
| while (ROFF_MSEC_MAX != |
|
| (c = tokens[tok].sections[i++])) |
|
| if (c == tree->section) |
|
| break; |
|
| if (ROFF_MSEC_MAX == c) { |
|
| roff_warn(tree, *argv, "`%s' is not a valid " |
|
| "macro in this manual section", |
|
| toknames[tok]); |
|
| } |
|
| } |
|
| |
|
| return((*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER)); |
return(1); |
| } |
} |
| |
|
| |
/* |
| |
* Evaluate a complete numeric expression. |
| |
* Proceed left to right, there is no concept of precedence. |
| |
*/ |
| static int |
static int |
| roffnextopt(const struct rofftree *tree, int tok, |
roff_evalnum(const char *v, int *pos, int *res, int skipwhite) |
| char ***in, char **val) |
|
| { |
{ |
| char *arg, **argv; |
int mypos, operand2; |
| int v; |
char operator; |
| |
|
| *val = NULL; |
if (NULL == pos) { |
| argv = *in; |
mypos = 0; |
| assert(argv); |
pos = &mypos; |
| |
} |
| |
|
| if (NULL == (arg = *argv)) |
if (skipwhite) |
| return(-1); |
while (isspace((unsigned char)v[*pos])) |
| if ('-' != *arg) |
(*pos)++; |
| return(-1); |
|
| |
|
| if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
if ( ! roff_evalpar(v, pos, res)) |
| roff_warn(tree, arg, "argument-like parameter `%s' to " |
return(0); |
| "`%s'", arg, toknames[tok]); |
|
| return(-1); |
|
| } |
|
| |
|
| if ( ! roffargok(tok, v)) { |
|
| roff_warn(tree, arg, "invalid argument parameter `%s' to " |
|
| "`%s'", tokargnames[v], toknames[tok]); |
|
| return(-1); |
|
| } |
|
| |
|
| if ( ! (ROFF_VALUE & tokenargs[v])) |
|
| return(v); |
|
| |
|
| *in = ++argv; |
while (1) { |
| |
if (skipwhite) |
| |
while (isspace((unsigned char)v[*pos])) |
| |
(*pos)++; |
| |
|
| if (NULL == *argv) { |
if ( ! roff_getop(v, pos, &operator)) |
| roff_err(tree, arg, "empty value of `%s' for `%s'", |
break; |
| tokargnames[v], toknames[tok]); |
|
| return(ROFF_ARGMAX); |
|
| } |
|
| |
|
| return(v); |
if (skipwhite) |
| } |
while (isspace((unsigned char)v[*pos])) |
| |
(*pos)++; |
| |
|
| |
if ( ! roff_evalpar(v, pos, &operand2)) |
| |
return(0); |
| |
|
| static int |
if (skipwhite) |
| roffpurgepunct(struct rofftree *tree, char **argv) |
while (isspace((unsigned char)v[*pos])) |
| { |
(*pos)++; |
| int i; |
|
| |
|
| i = 0; |
if (NULL == res) |
| while (argv[i]) |
continue; |
| i++; |
|
| assert(i > 0); |
|
| if ( ! roffispunct(argv[--i])) |
|
| return(1); |
|
| while (i >= 0 && roffispunct(argv[i])) |
|
| i--; |
|
| i++; |
|
| |
|
| /* LINTED */ |
switch (operator) { |
| while (argv[i]) |
case ('+'): |
| if ( ! roffdata(tree, 0, argv[i++])) |
*res += operand2; |
| return(0); |
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); |
return(1); |
| } |
} |
| |
|
| |
void |
| static int |
roff_setreg(struct roff *r, const char *name, int val, char sign) |
| roffparseopts(struct rofftree *tree, int tok, |
|
| char ***args, int *argc, char **argv) |
|
| { |
{ |
| int i, c; |
struct roffreg *reg; |
| char *v; |
|
| |
|
| i = 0; |
/* Search for an existing register with the same name. */ |
| |
reg = r->regtab; |
| |
|
| while (-1 != (c = roffnextopt(tree, tok, args, &v))) { |
while (reg && strcmp(name, reg->key.p)) |
| if (ROFF_ARGMAX == c) |
reg = reg->next; |
| return(0); |
|
| |
|
| argc[i] = c; |
if (NULL == reg) { |
| argv[i] = v; |
/* Create a new register. */ |
| i++; |
reg = mandoc_malloc(sizeof(struct roffreg)); |
| *args = *args + 1; |
reg->key.p = mandoc_strdup(name); |
| |
reg->key.sz = strlen(name); |
| |
reg->val = 0; |
| |
reg->next = r->regtab; |
| |
r->regtab = reg; |
| } |
} |
| |
|
| argc[i] = ROFF_ARGMAX; |
if ('+' == sign) |
| argv[i] = NULL; |
reg->val += val; |
| return(1); |
else if ('-' == sign) |
| |
reg->val -= val; |
| |
else |
| |
reg->val = val; |
| } |
} |
| |
|
| |
/* |
| |
* Handle some predefined read-only number registers. |
| |
* For now, return -1 if the requested register is not predefined; |
| |
* in case a predefined read-only register having the value -1 |
| |
* were to turn up, another special value would have to be chosen. |
| |
*/ |
| static int |
static int |
| roffdata(struct rofftree *tree, int space, char *buf) |
roff_getregro(const char *name) |
| { |
{ |
| |
|
| if (0 == *buf) |
switch (*name) { |
| |
case ('A'): /* ASCII approximation mode is always off. */ |
| |
return(0); |
| |
case ('g'): /* Groff compatibility mode is always on. */ |
| return(1); |
return(1); |
| return((*tree->cb.roffdata)(tree->arg, |
case ('H'): /* Fixed horizontal resolution. */ |
| space != 0, tree->cur, buf)); |
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 |
| /* ARGSUSED */ |
roff_getreg(const struct roff *r, const char *name) |
| static int |
|
| roff_Dd(ROFFCALL_ARGS) |
|
| { |
{ |
| time_t t; |
struct roffreg *reg; |
| char *p, buf[32]; |
int val; |
| |
|
| if (ROFF_BODY & tree->state) { |
if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) { |
| assert( ! (ROFF_PRELUDE & tree->state)); |
val = roff_getregro(name + 1); |
| assert(ROFF_PRELUDE_Dd & tree->state); |
if (-1 != val) |
| return(roff_text(tok, tree, argv, type)); |
return (val); |
| } |
} |
| |
|
| assert(ROFF_PRELUDE & tree->state); |
for (reg = r->regtab; reg; reg = reg->next) |
| assert( ! (ROFF_BODY & tree->state)); |
if (0 == strcmp(name, reg->key.p)) |
| |
return(reg->val); |
| |
|
| if (ROFF_PRELUDE_Dd & tree->state) { |
return(0); |
| roff_err(tree, *argv, "repeated `Dd' in prelude"); |
} |
| return(0); |
|
| } else if (ROFF_PRELUDE_Dt & tree->state) { |
|
| roff_err(tree, *argv, "out-of-order `Dd' in prelude"); |
|
| return(0); |
|
| } |
|
| |
|
| assert(NULL == tree->last); |
static int |
| |
roff_getregn(const struct roff *r, const char *name, size_t len) |
| |
{ |
| |
struct roffreg *reg; |
| |
int val; |
| |
|
| argv++; |
if ('.' == name[0] && 2 == len) { |
| |
val = roff_getregro(name + 1); |
| |
if (-1 != val) |
| |
return (val); |
| |
} |
| |
|
| if (0 == strcmp(*argv, "$Mdocdate$")) { |
for (reg = r->regtab; reg; reg = reg->next) |
| t = time(NULL); |
if (len == reg->key.sz && |
| if (NULL == localtime_r(&t, &tree->tm)) |
0 == strncmp(name, reg->key.p, len)) |
| err(1, "localtime_r"); |
return(reg->val); |
| tree->state |= ROFF_PRELUDE_Dd; |
|
| return(1); |
|
| } |
|
| |
|
| /* Build this from Mdocdate or raw date. */ |
return(0); |
| |
} |
| buf[0] = 0; |
|
| p = *argv; |
|
| |
|
| if (0 != strcmp(*argv, "$Mdocdate:")) { |
static void |
| while (*argv) { |
roff_freereg(struct roffreg *reg) |
| if (strlcat(buf, *argv++, sizeof(buf)) |
{ |
| < sizeof(buf)) |
struct roffreg *old_reg; |
| continue; |
|
| roff_err(tree, p, "bad `Dd' date"); |
|
| return(0); |
|
| } |
|
| if (strptime(buf, "%b%d,%Y", &tree->tm)) { |
|
| tree->state |= ROFF_PRELUDE_Dd; |
|
| return(1); |
|
| } |
|
| roff_err(tree, *argv, "bad `Dd' date"); |
|
| return(0); |
|
| } |
|
| |
|
| argv++; |
while (NULL != reg) { |
| while (*argv && **argv != '$') { |
free(reg->key.p); |
| if (strlcat(buf, *argv++, sizeof(buf)) |
old_reg = reg; |
| >= sizeof(buf)) { |
reg = reg->next; |
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
free(old_reg); |
| return(0); |
|
| } |
|
| if (strlcat(buf, " ", sizeof(buf)) |
|
| >= sizeof(buf)) { |
|
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
|
| return(0); |
|
| } |
|
| } |
} |
| if (NULL == *argv) { |
} |
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
|
| return(0); |
|
| } |
|
| |
|
| if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) { |
static enum rofferr |
| roff_err(tree, *argv, "bad `Dd' Mdocdate"); |
roff_nr(ROFF_ARGS) |
| return(0); |
{ |
| } |
const char *key; |
| |
char *val; |
| |
int iv; |
| |
char sign; |
| |
|
| tree->state |= ROFF_PRELUDE_Dd; |
val = *bufp + pos; |
| return(1); |
key = roff_getname(r, &val, ln, pos); |
| |
|
| |
sign = *val; |
| |
if ('+' == sign || '-' == sign) |
| |
val++; |
| |
|
| |
if (roff_evalnum(val, NULL, &iv, 0)) |
| |
roff_setreg(r, key, iv, sign); |
| |
|
| |
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 int |
static enum rofferr |
| roff_Dt(ROFFCALL_ARGS) |
roff_rm(ROFF_ARGS) |
| { |
{ |
| |
const char *name; |
| |
char *cp; |
| |
|
| if (ROFF_BODY & tree->state) { |
cp = *bufp + pos; |
| assert( ! (ROFF_PRELUDE & tree->state)); |
while ('\0' != *cp) { |
| assert(ROFF_PRELUDE_Dt & tree->state); |
name = roff_getname(r, &cp, ln, (int)(cp - *bufp)); |
| return(roff_text(tok, tree, argv, type)); |
if ('\0' != *name) |
| |
roff_setstr(r, name, NULL, 0); |
| } |
} |
| |
return(ROFF_IGN); |
| |
} |
| |
|
| assert(ROFF_PRELUDE & tree->state); |
/* ARGSUSED */ |
| assert( ! (ROFF_BODY & tree->state)); |
static enum rofferr |
| |
roff_it(ROFF_ARGS) |
| |
{ |
| |
char *cp; |
| |
size_t len; |
| |
int iv; |
| |
|
| if ( ! (ROFF_PRELUDE_Dd & tree->state)) { |
/* Parse the number of lines. */ |
| roff_err(tree, *argv, "out-of-order `Dt' in prelude"); |
cp = *bufp + pos; |
| return(0); |
len = strcspn(cp, " \t"); |
| } else if (ROFF_PRELUDE_Dt & tree->state) { |
cp[len] = '\0'; |
| roff_err(tree, *argv, "repeated `Dt' in prelude"); |
if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) { |
| return(0); |
mandoc_msg(MANDOCERR_NUMERIC, r->parse, |
| |
ln, ppos, *bufp + 1); |
| |
return(ROFF_IGN); |
| } |
} |
| |
cp += len + 1; |
| |
|
| argv++; |
/* Arm the input line trap. */ |
| if (NULL == *argv) { |
roffit_lines = iv; |
| roff_err(tree, *argv, "`Dt' needs document title"); |
roffit_macro = mandoc_strdup(cp); |
| return(0); |
return(ROFF_IGN); |
| } else if (strlcpy(tree->title, *argv, sizeof(tree->title)) |
} |
| >= sizeof(tree->title)) { |
|
| roff_err(tree, *argv, "`Dt' document title too long"); |
|
| return(0); |
|
| } |
|
| |
|
| argv++; |
/* ARGSUSED */ |
| if (NULL == *argv) { |
static enum rofferr |
| roff_err(tree, *argv, "`Dt' needs section"); |
roff_Dd(ROFF_ARGS) |
| return(0); |
{ |
| } |
const char *const *cp; |
| |
|
| if (ROFF_MSEC_MAX == (tree->section = roffismsec(*argv))) { |
if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options)) |
| roff_err(tree, *argv, "bad `Dt' section"); |
for (cp = __mdoc_reserved; *cp; cp++) |
| return(0); |
roff_setstr(r, *cp, NULL, 0); |
| } |
|
| |
|
| argv++; |
return(ROFF_CONT); |
| if (NULL == *argv) { |
} |
| tree->volume[0] = 0; |
|
| } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume)) |
|
| >= sizeof(tree->volume)) { |
|
| roff_err(tree, *argv, "`Dt' volume too long"); |
|
| return(0); |
|
| } |
|
| |
|
| assert(NULL == tree->last); |
/* ARGSUSED */ |
| tree->state |= ROFF_PRELUDE_Dt; |
static enum rofferr |
| |
roff_TH(ROFF_ARGS) |
| |
{ |
| |
const char *const *cp; |
| |
|
| return(1); |
if (0 == (MPARSE_QUICK & r->options)) |
| |
for (cp = __man_reserved; *cp; cp++) |
| |
roff_setstr(r, *cp, NULL, 0); |
| |
|
| |
return(ROFF_CONT); |
| } |
} |
| |
|
| |
/* ARGSUSED */ |
| static int |
static enum rofferr |
| roffsetname(struct rofftree *tree, char **ordp) |
roff_TE(ROFF_ARGS) |
| { |
{ |
| |
|
| assert(*ordp); |
|
| |
|
| /* FIXME: not all sections can set this. */ |
if (NULL == r->tbl) |
| |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
else |
| |
tbl_end(&r->tbl); |
| |
|
| if (NULL != *(ordp + 1)) { |
return(ROFF_IGN); |
| roff_err(tree, *ordp, "too many `Nm' args"); |
|
| return(0); |
|
| } |
|
| |
|
| if (strlcpy(tree->name, *ordp, sizeof(tree->name)) |
|
| >= sizeof(tree->name)) { |
|
| roff_err(tree, *ordp, "`Nm' arg too long"); |
|
| return(0); |
|
| } |
|
| |
|
| return(1); |
|
| } |
} |
| |
|
| |
|
| /* ARGSUSED */ |
/* ARGSUSED */ |
| static int |
static enum rofferr |
| roff_Ns(ROFFCALL_ARGS) |
roff_T_(ROFF_ARGS) |
| { |
{ |
| int j, c, first; |
|
| char *morep[1]; |
|
| |
|
| first = (*argv++ == tree->cur); |
if (NULL == r->tbl) |
| morep[0] = NULL; |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
else |
| |
tbl_restart(ppos, ln, r->tbl); |
| |
|
| if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep)) |
return(ROFF_IGN); |
| return(0); |
} |
| |
|
| while (*argv) { |
#if 0 |
| if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
static int |
| if ( ! roffcall(tree, c, argv)) |
roff_closeeqn(struct roff *r) |
| return(0); |
{ |
| break; |
|
| } |
|
| |
|
| if ( ! roffispunct(*argv)) { |
return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0); |
| if ( ! roffdata(tree, 1, *argv++)) |
} |
| return(0); |
#endif |
| continue; |
|
| } |
|
| |
|
| for (j = 0; argv[j]; j++) |
static void |
| if ( ! roffispunct(argv[j])) |
roff_openeqn(struct roff *r, const char *name, int line, |
| break; |
int offs, const char *buf) |
| |
{ |
| |
struct eqn_node *e; |
| |
int poff; |
| |
|
| if (argv[j]) { |
assert(NULL == r->eqn); |
| if ( ! roffdata(tree, 0, *argv++)) |
e = eqn_alloc(name, offs, line, r->parse); |
| return(0); |
|
| continue; |
|
| } |
|
| |
|
| break; |
if (r->last_eqn) |
| } |
r->last_eqn->next = e; |
| |
else |
| |
r->first_eqn = r->last_eqn = e; |
| |
|
| if ( ! first) |
r->eqn = r->last_eqn = e; |
| return(1); |
|
| |
|
| return(roffpurgepunct(tree, argv)); |
if (buf) { |
| |
poff = 0; |
| |
eqn_read(&r->eqn, line, buf, offs, &poff); |
| |
} |
| } |
} |
| |
|
| |
|
| /* ARGSUSED */ |
/* ARGSUSED */ |
| static int |
static enum rofferr |
| roff_Os(ROFFCALL_ARGS) |
roff_EQ(ROFF_ARGS) |
| { |
{ |
| char *p; |
|
| |
|
| if (ROFF_BODY & tree->state) { |
roff_openeqn(r, *bufp + pos, ln, ppos, NULL); |
| assert( ! (ROFF_PRELUDE & tree->state)); |
return(ROFF_IGN); |
| assert(ROFF_PRELUDE_Os & tree->state); |
} |
| return(roff_text(tok, tree, argv, type)); |
|
| } |
|
| |
|
| assert(ROFF_PRELUDE & tree->state); |
/* ARGSUSED */ |
| if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
static enum rofferr |
| ! (ROFF_PRELUDE_Dd & tree->state)) { |
roff_EN(ROFF_ARGS) |
| roff_err(tree, *argv, "out-of-order `Os' in prelude"); |
{ |
| return(0); |
|
| } |
|
| |
|
| tree->os[0] = 0; |
mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL); |
| |
return(ROFF_IGN); |
| |
} |
| |
|
| p = *++argv; |
/* ARGSUSED */ |
| |
static enum rofferr |
| |
roff_TS(ROFF_ARGS) |
| |
{ |
| |
struct tbl_node *tbl; |
| |
|
| while (*argv) { |
if (r->tbl) { |
| if (strlcat(tree->os, *argv++, sizeof(tree->os)) |
mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL); |
| < sizeof(tree->os)) |
tbl_end(&r->tbl); |
| continue; |
|
| roff_err(tree, p, "`Os' value too long"); |
|
| return(0); |
|
| } |
} |
| |
|
| if (0 == tree->os[0]) |
tbl = tbl_alloc(ppos, ln, r->parse); |
| if (strlcpy(tree->os, "LOCAL", sizeof(tree->os)) |
|
| >= sizeof(tree->os)) { |
|
| roff_err(tree, p, "`Os' value too long"); |
|
| return(0); |
|
| } |
|
| |
|
| tree->state |= ROFF_PRELUDE_Os; |
if (r->last_tbl) |
| tree->state &= ~ROFF_PRELUDE; |
r->last_tbl->next = tbl; |
| tree->state |= ROFF_BODY; |
else |
| |
r->first_tbl = r->last_tbl = tbl; |
| |
|
| assert(ROFF_MSEC_MAX != tree->section); |
r->tbl = r->last_tbl = tbl; |
| assert(0 != tree->title[0]); |
return(ROFF_IGN); |
| assert(0 != tree->os[0]); |
|
| |
|
| assert(NULL == tree->last); |
|
| |
|
| return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
|
| tree->os, tree->title, tree->section, |
|
| tree->volume)); |
|
| } |
} |
| |
|
| |
|
| /* ARGSUSED */ |
/* ARGSUSED */ |
| static int |
static enum rofferr |
| roff_layout(ROFFCALL_ARGS) |
roff_cc(ROFF_ARGS) |
| { |
{ |
| int i, c, argcp[ROFF_MAXLINEARG]; |
const char *p; |
| char *argvp[ROFF_MAXLINEARG], *p; |
|
| |
|
| /* |
p = *bufp + pos; |
| * The roff_layout function is for multi-line macros. A layout |
|
| * has a start and end point, which is either declared |
|
| * explicitly or implicitly. An explicit start and end is |
|
| * embodied by `.Bl' and `.El', with the former being the start |
|
| * and the latter being an end. The `.Sh' and `.Ss' tags, on |
|
| * the other hand, are implicit. The scope of a layout is the |
|
| * space between start and end. Explicit layouts may not close |
|
| * out implicit ones and vice versa; implicit layouts may close |
|
| * out other implicit layouts. |
|
| */ |
|
| |
|
| assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
if ('\0' == *p || '.' == (r->control = *p++)) |
| |
r->control = 0; |
| |
|
| if (ROFF_PRELUDE & tree->state) { |
if ('\0' != *p) |
| roff_err(tree, *argv, "bad `%s' in prelude", |
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
| toknames[tok]); |
|
| return(0); |
|
| } else if (ROFF_EXIT == type) { |
|
| roffnode_free(tree); |
|
| if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok)) |
|
| return(0); |
|
| return((*tree->cb.roffblkout)(tree->arg, tok)); |
|
| } |
|
| |
|
| assert( ! (ROFF_CALLABLE & tokens[tok].flags)); |
return(ROFF_IGN); |
| |
} |
| |
|
| p = *argv++; |
/* ARGSUSED */ |
| |
static enum rofferr |
| |
roff_tr(ROFF_ARGS) |
| |
{ |
| |
const char *p, *first, *second; |
| |
size_t fsz, ssz; |
| |
enum mandoc_esc esc; |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
p = *bufp + pos; |
| return(0); |
|
| if (NULL == roffnode_new(tok, tree)) |
|
| return(0); |
|
| |
|
| /* |
if ('\0' == *p) { |
| * Layouts have two parts: the layout body and header. The |
mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL); |
| * layout header is the trailing text of the line macro, while |
return(ROFF_IGN); |
| * the layout body is everything following until termination. |
} |
| * Example: |
|
| * |
|
| * .It Fl f ) ; |
|
| * Bar. |
|
| * |
|
| * ...Produces... |
|
| * |
|
| * <block> |
|
| * <head> |
|
| * <!Fl f!> ; |
|
| * </head> |
|
| * |
|
| * <body> |
|
| * Bar. |
|
| * </body> |
|
| * </block> |
|
| */ |
|
| |
|
| if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, |
while ('\0' != *p) { |
| (const char **)argvp)) |
fsz = ssz = 1; |
| return(0); |
|
| |
|
| /* +++ Begin run macro-specific hooks over argv. */ |
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); |
| |
} |
| |
|
| switch (tok) { |
second = p++; |
| case (ROFF_Sh): |
if ('\\' == *second) { |
| if (NULL == *argv) { |
esc = mandoc_escape(&p, NULL, NULL); |
| roff_err(tree, *(argv - 1), |
if (ESCAPE_ERROR == esc) { |
| "`Sh' expects arguments"); |
mandoc_msg |
| return(0); |
(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--; |
| } |
} |
| tree->csec = roffissec((const char **)argv); |
|
| if ( ! (ROFFSec_OTHER & tree->csec) && |
|
| tree->asec & tree->csec) |
|
| roff_warn(tree, *argv, "section repeated"); |
|
| if (0 == tree->asec && ! (ROFFSec_NAME & tree->csec)) { |
|
| roff_err(tree, *argv, "`NAME' section " |
|
| "must be first"); |
|
| return(0); |
|
| } else if ( ! roffchecksec(tree, *argv, tree->csec)) |
|
| return(0); |
|
| |
|
| tree->asec |= tree->csec; |
if (fsz > 1) { |
| break; |
roff_setstrn(&r->xmbtab, first, |
| default: |
fsz, second, ssz, 0); |
| break; |
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; |
| } |
} |
| |
|
| /* --- End run macro-specific hooks over argv. */ |
return(ROFF_IGN); |
| |
} |
| |
|
| if (NULL == *argv) |
/* ARGSUSED */ |
| return((*tree->cb.roffblkbodyin) |
static enum rofferr |
| (tree->arg, tok, argcp, |
roff_so(ROFF_ARGS) |
| (const char **)argvp)); |
{ |
| |
char *name; |
| |
|
| if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, |
mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL); |
| (const char **)argvp)) |
|
| return(0); |
|
| |
|
| /* |
/* |
| * If there are no parsable parts, then write remaining tokens |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
| * into the layout header and exit. |
* opening anything that's not in our cwd or anything beneath |
| |
* it. Thus, explicitly disallow traversing up the file-system |
| |
* or using absolute paths. |
| */ |
*/ |
| |
|
| if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
name = *bufp + pos; |
| i = 0; |
if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) { |
| while (*argv) |
mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL); |
| if ( ! roffdata(tree, i++, *argv++)) |
return(ROFF_ERR); |
| return(0); |
|
| |
|
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
| return(0); |
|
| return((*tree->cb.roffblkbodyin)(tree->arg, tok, argcp, |
|
| (const char **)argvp)); |
|
| } |
} |
| |
|
| |
*offs = pos; |
| |
return(ROFF_SO); |
| |
} |
| |
|
| |
/* ARGSUSED */ |
| |
static enum rofferr |
| |
roff_userdef(ROFF_ARGS) |
| |
{ |
| |
const char *arg[9]; |
| |
char *cp, *n1, *n2; |
| |
int i; |
| |
|
| /* |
/* |
| * Parsable elements may be in the header (or be the header, for |
* Collect pointers to macro argument strings |
| * that matter). Follow the regular parsing rules for these. |
* and NUL-terminate them. |
| */ |
*/ |
| |
cp = *bufp + pos; |
| |
for (i = 0; i < 9; i++) |
| |
arg[i] = '\0' == *cp ? "" : |
| |
mandoc_getarg(r->parse, &cp, ln, &pos); |
| |
|
| i = 0; |
/* |
| while (*argv) { |
* Expand macro arguments. |
| if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
*/ |
| assert(tree->arg); |
*szp = 0; |
| if ( ! roffdata(tree, i++, *argv++)) |
n1 = cp = mandoc_strdup(r->current_string); |
| return(0); |
while (NULL != (cp = strstr(cp, "\\$"))) { |
| |
i = cp[2] - '1'; |
| |
if (0 > i || 8 < i) { |
| |
/* Not an argument invocation. */ |
| |
cp += 2; |
| continue; |
continue; |
| } |
} |
| if ( ! roffcall(tree, c, argv)) |
|
| return(0); |
|
| break; |
|
| } |
|
| |
|
| /* |
*szp = strlen(n1) - 3 + strlen(arg[i]) + 1; |
| * If there's trailing punctuation in the header, then write it |
n2 = mandoc_malloc(*szp); |
| * out now. Here we mimic the behaviour of a line-dominant text |
|
| * macro. |
|
| */ |
|
| |
|
| if (NULL == *argv) { |
strlcpy(n2, n1, (size_t)(cp - n1 + 1)); |
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
strlcat(n2, arg[i], *szp); |
| return(0); |
strlcat(n2, cp + 3, *szp); |
| return((*tree->cb.roffblkbodyin) |
|
| (tree->arg, tok, argcp, |
cp = n2 + (cp - n1); |
| (const char **)argvp)); |
free(n1); |
| |
n1 = n2; |
| } |
} |
| |
|
| /* |
/* |
| * Expensive. Scan to the end of line then work backwards until |
* Replace the macro invocation |
| * a token isn't punctuation. |
* by the expanded macro. |
| */ |
*/ |
| |
free(*bufp); |
| |
*bufp = n1; |
| |
if (0 == *szp) |
| |
*szp = strlen(*bufp) + 1; |
| |
|
| if ( ! roffpurgepunct(tree, argv)) |
return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ? |
| return(0); |
ROFF_REPARSE : ROFF_APPEND); |
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
|
| return(0); |
|
| return((*tree->cb.roffblkbodyin)(tree->arg, |
|
| tok, argcp, (const char **)argvp)); |
|
| } |
} |
| |
|
| |
static char * |
| /* ARGSUSED */ |
roff_getname(struct roff *r, char **cpp, int ln, int pos) |
| static int |
|
| roff_ordered(ROFFCALL_ARGS) |
|
| { |
{ |
| int i, first, c, argcp[ROFF_MAXLINEARG]; |
char *name, *cp; |
| char *ordp[ROFF_MAXLINEARG], *p, |
|
| *argvp[ROFF_MAXLINEARG]; |
|
| |
|
| /* |
name = *cpp; |
| * Ordered macros pass their arguments directly to handlers, |
if ('\0' == *name) |
| * instead of considering it free-form text. Thus, the |
return(name); |
| * following macro looks as follows: |
|
| * |
|
| * .Xr foo 1 ) , |
|
| * |
|
| * .Xr arg1 arg2 punctuation |
|
| */ |
|
| |
|
| if (ROFF_PRELUDE & tree->state) { |
/* Read until end of name. */ |
| roff_err(tree, *argv, "`%s' disallowed in prelude", |
for (cp = name; '\0' != *cp && ' ' != *cp; cp++) { |
| toknames[tok]); |
if ('\\' != *cp) |
| return(0); |
continue; |
| |
cp++; |
| |
if ('\\' == *cp) |
| |
continue; |
| |
mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL); |
| |
*cp = '\0'; |
| |
name = cp; |
| } |
} |
| |
|
| first = (*argv == tree->cur); |
/* Nil-terminate name. */ |
| p = *argv++; |
if ('\0' != *cp) |
| ordp[0] = NULL; |
*(cp++) = '\0'; |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
/* Read past spaces. */ |
| return(0); |
while (' ' == *cp) |
| |
cp++; |
| |
|
| if (NULL == *argv) |
*cpp = cp; |
| return(roffspecial(tree, tok, p, argcp, |
return(name); |
| (const char **)argvp, 0, ordp)); |
} |
| |
|
| i = 0; |
/* |
| while (*argv && i < ROFF_MAXLINEARG) { |
* Store *string into the user-defined string called *name. |
| c = ROFF_PARSED & tokens[tok].flags ? |
* To clear an existing entry, call with (*r, *name, NULL, 0). |
| rofffindcallable(*argv) : ROFF_MAX; |
* 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) |
| |
{ |
| |
|
| if (ROFF_MAX == c && ! roffispunct(*argv)) { |
roff_setstrn(&r->strtab, name, strlen(name), string, |
| ordp[i++] = *argv++; |
string ? strlen(string) : 0, append); |
| continue; |
} |
| } |
|
| ordp[i] = NULL; |
|
| |
|
| if (ROFF_MAX == c) |
static void |
| break; |
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; |
| |
|
| if ( ! roffspecial(tree, tok, p, argcp, |
/* Search for an existing string with the same name. */ |
| (const char **)argvp, |
n = *r; |
| (size_t)i, ordp)) |
|
| return(0); |
|
| |
|
| return(roffcall(tree, c, argv)); |
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; |
| } |
} |
| |
|
| assert(i != ROFF_MAXLINEARG); |
if (NULL == string) |
| ordp[i] = NULL; |
return; |
| |
|
| if ( ! roffspecial(tree, tok, p, argcp, |
/* |
| (const char**)argvp, |
* One additional byte for the '\n' in multiline mode, |
| (size_t)i, ordp)) |
* and one for the terminating '\0'. |
| return(0); |
*/ |
| |
newch = stringsz + (1 < append ? 2u : 1u); |
| |
|
| /* FIXME: error if there's stuff after the punctuation. */ |
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); |
| |
} |
| |
|
| if ( ! first || NULL == *argv) |
/* Skip existing content in the destination buffer. */ |
| return(1); |
c = n->val.p + (int)oldch; |
| |
|
| return(roffpurgepunct(tree, argv)); |
/* 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'; |
| |
|
| /* ARGSUSED */ |
*c = '\0'; |
| static int |
n->val.sz = (int)(c - n->val.p); |
| roff_text(ROFFCALL_ARGS) |
} |
| |
|
| |
static const char * |
| |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
| { |
{ |
| int i, j, first, c, argcp[ROFF_MAXLINEARG]; |
const struct roffkv *n; |
| char *argvp[ROFF_MAXLINEARG]; |
int i; |
| |
|
| /* |
for (n = r->strtab; n; n = n->next) |
| * Text macros are similar to special tokens, except that |
if (0 == strncmp(name, n->key.p, len) && |
| * arguments are instead flushed as pure data: we're only |
'\0' == n->key.p[(int)len]) |
| * concerned with the macro and its arguments. Example: |
return(n->val.p); |
| * |
|
| * .Fl v W f ; |
|
| * |
|
| * ...Produces... |
|
| * |
|
| * <fl> v W f </fl> ; |
|
| */ |
|
| |
|
| if (ROFF_PRELUDE & tree->state) { |
for (i = 0; i < PREDEFS_MAX; i++) |
| roff_err(tree, *argv, "`%s' disallowed in prelude", |
if (0 == strncmp(name, predefs[i].name, len) && |
| toknames[tok]); |
'\0' == predefs[i].name[(int)len]) |
| return(0); |
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); |
| } |
} |
| |
} |
| |
|
| first = (*argv == tree->cur); |
const struct tbl_span * |
| argv++; |
roff_span(const struct roff *r) |
| |
{ |
| |
|
| |
return(r->tbl ? tbl_span(r->tbl) : NULL); |
| |
} |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
const struct eqn * |
| return(0); |
roff_eqn(const struct roff *r) |
| if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, |
{ |
| (const char **)argvp)) |
|
| return(0); |
return(r->last_eqn ? &r->last_eqn->eqn : NULL); |
| if (NULL == *argv) |
} |
| return((*tree->cb.roffout)(tree->arg, tok)); |
|
| |
|
| if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
/* |
| i = 0; |
* Duplicate an input string, making the appropriate character |
| while (*argv) |
* conversations (as stipulated by `tr') along the way. |
| if ( ! roffdata(tree, i++, *argv++)) |
* Returns a heap-allocated string with all the replacements made. |
| return(0); |
*/ |
| |
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((*tree->cb.roffout)(tree->arg, tok)); |
if (NULL == r->xmbtab && NULL == r->xtab) |
| } |
return(mandoc_strdup(p)); |
| |
else if ('\0' == *p) |
| |
return(mandoc_strdup("")); |
| |
|
| /* |
/* |
| * Deal with punctuation. Ugly. Work ahead until we encounter |
* Step through each character looking for term matches |
| * terminating punctuation. If we encounter it and all |
* (remember that a `tr' can be invoked with an escape, which is |
| * subsequent tokens are punctuation, then stop processing (the |
* a glyph but the escape is multi-character). |
| * line-dominant macro will print these tokens after closure). |
* We only do this if the character hash has been initialised |
| * If the punctuation is followed by non-punctuation, then close |
* and the string is >0 length. |
| * and re-open our scope, then continue. |
|
| */ |
*/ |
| |
|
| i = 0; |
res = NULL; |
| while (*argv) { |
ssz = 0; |
| if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
|
| if ( ! (ROFF_LSCOPE & tokens[tok].flags)) |
|
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
| return(0); |
|
| |
|
| if ( ! roffcall(tree, c, argv)) |
|
| return(0); |
|
| |
|
| if (ROFF_LSCOPE & tokens[tok].flags) |
|
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
|
| return(0); |
|
| |
|
| break; |
|
| } |
|
| |
|
| if ( ! roffispunct(*argv)) { |
while ('\0' != *p) { |
| if ( ! roffdata(tree, i++, *argv++)) |
if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) { |
| return(0); |
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; |
continue; |
| |
} else if ('\\' != *p) { |
| |
res = mandoc_realloc(res, ssz + 2); |
| |
res[ssz++] = *p++; |
| |
continue; |
| } |
} |
| |
|
| i = 1; |
/* Search for term matches. */ |
| for (j = 0; argv[j]; j++) |
for (cp = r->xmbtab; cp; cp = cp->next) |
| if ( ! roffispunct(argv[j])) |
if (0 == strncmp(p, cp->key.p, cp->key.sz)) |
| break; |
break; |
| |
|
| if (argv[j]) { |
if (NULL != cp) { |
| if (ROFF_LSCOPE & tokens[tok].flags) { |
/* |
| if ( ! roffdata(tree, 0, *argv++)) |
* A match has been found. |
| return(0); |
* Append the match to the array and move |
| continue; |
* forward by its keysize. |
| } |
*/ |
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
res = mandoc_realloc |
| return(0); |
(res, ssz + cp->val.sz + 1); |
| if ( ! roffdata(tree, 0, *argv++)) |
memcpy(res + ssz, cp->val.p, cp->val.sz); |
| return(0); |
ssz += cp->val.sz; |
| if ( ! (*tree->cb.roffin)(tree->arg, tok, |
p += (int)cp->key.sz; |
| argcp, |
|
| (const char **)argvp)) |
|
| return(0); |
|
| |
|
| i = 0; |
|
| continue; |
continue; |
| } |
} |
| |
|
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
/* |
| return(0); |
* Handle escapes carefully: we need to copy |
| break; |
* 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; |
| } |
} |
| |
|
| if (NULL == *argv) |
res[(int)ssz] = '\0'; |
| return((*tree->cb.roffout)(tree->arg, tok)); |
return(res); |
| if ( ! first) |
|
| return(1); |
|
| |
|
| return(roffpurgepunct(tree, argv)); |
|
| } |
} |
| |
|
| |
/* |
| /* ARGSUSED */ |
* Find out whether a line is a macro line or not. |
| static int |
* If it is, adjust the current position and return one; if it isn't, |
| roff_noop(ROFFCALL_ARGS) |
* 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; |
| |
|
| return(1); |
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); |
| |
|
| /* ARGSUSED */ |
while (' ' == cp[pos] || '\t' == cp[pos]) |
| static int |
pos++; |
| roff_depr(ROFFCALL_ARGS) |
|
| { |
|
| |
|
| roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]); |
*ppos = pos; |
| return(0); |
return(1); |
| } |
} |
| |
|
| |
|
| static void |
|
| roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...) |
|
| { |
|
| va_list ap; |
|
| char buf[128]; |
|
| |
|
| va_start(ap, fmt); |
|
| (void)vsnprintf(buf, sizeof(buf), fmt, ap); |
|
| va_end(ap); |
|
| |
|
| (*tree->cb.roffmsg)(tree->arg, |
|
| ROFF_WARN, tree->cur, pos, buf); |
|
| } |
|
| |
|
| |
|
| static void |
|
| roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...) |
|
| { |
|
| va_list ap; |
|
| char buf[128]; |
|
| |
|
| va_start(ap, fmt); |
|
| (void)vsnprintf(buf, sizeof(buf), fmt, ap); |
|
| va_end(ap); |
|
| |
|
| (*tree->cb.roffmsg)(tree->arg, |
|
| ROFF_ERROR, tree->cur, pos, buf); |
|
| } |
|
| |
|
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to roff.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [cvsweb.bsd.lv] / mandoc