| version 1.49, 2008/12/07 16:41:04 |
version 1.282, 2015/10/21 23:51:11 |
|
|
| /* $Id$ */ |
/* $Id$ */ |
| /* |
/* |
| * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008-2012, 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
| |
* Copyright (c) 2010-2015 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> |
#include "config.h" |
| |
|
| #include <sys/types.h> |
#include <sys/types.h> |
| |
|
| #include <assert.h> |
#include <assert.h> |
| #include <ctype.h> |
#include <ctype.h> |
| #include <err.h> |
#include <limits.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 "roff.h" |
| |
#include "libmandoc.h" |
| |
#include "roff_int.h" |
| |
#include "libroff.h" |
| |
|
| /* FIXME: First letters of quoted-text interpreted in rofffindtok. */ |
/* Maximum number of string expansions per line, to break infinite loops. */ |
| /* FIXME: `No' not implemented. */ |
#define EXPAND_LIMIT 1000 |
| /* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */ |
|
| /* TODO: warn about "X section only" macros. */ |
|
| /* 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. */ |
|
| |
|
| |
/* --- data types --------------------------------------------------------- */ |
| |
|
| |
enum rofft { |
| |
ROFF_ab, |
| |
ROFF_ad, |
| |
ROFF_af, |
| |
ROFF_aln, |
| |
ROFF_als, |
| |
ROFF_am, |
| |
ROFF_am1, |
| |
ROFF_ami, |
| |
ROFF_ami1, |
| |
ROFF_as, |
| |
ROFF_as1, |
| |
ROFF_asciify, |
| |
ROFF_backtrace, |
| |
ROFF_bd, |
| |
ROFF_bleedat, |
| |
ROFF_blm, |
| |
ROFF_box, |
| |
ROFF_boxa, |
| |
ROFF_bp, |
| |
ROFF_BP, |
| |
/* MAN_br, MDOC_br */ |
| |
ROFF_break, |
| |
ROFF_breakchar, |
| |
ROFF_brnl, |
| |
ROFF_brp, |
| |
ROFF_brpnl, |
| |
ROFF_c2, |
| |
ROFF_cc, |
| |
ROFF_ce, |
| |
ROFF_cf, |
| |
ROFF_cflags, |
| |
ROFF_ch, |
| |
ROFF_char, |
| |
ROFF_chop, |
| |
ROFF_class, |
| |
ROFF_close, |
| |
ROFF_CL, |
| |
ROFF_color, |
| |
ROFF_composite, |
| |
ROFF_continue, |
| |
ROFF_cp, |
| |
ROFF_cropat, |
| |
ROFF_cs, |
| |
ROFF_cu, |
| |
ROFF_da, |
| |
ROFF_dch, |
| |
ROFF_Dd, |
| |
ROFF_de, |
| |
ROFF_de1, |
| |
ROFF_defcolor, |
| |
ROFF_dei, |
| |
ROFF_dei1, |
| |
ROFF_device, |
| |
ROFF_devicem, |
| |
ROFF_di, |
| |
ROFF_do, |
| |
ROFF_ds, |
| |
ROFF_ds1, |
| |
ROFF_dwh, |
| |
ROFF_dt, |
| |
ROFF_ec, |
| |
ROFF_ecr, |
| |
ROFF_ecs, |
| |
ROFF_el, |
| |
ROFF_em, |
| |
ROFF_EN, |
| |
ROFF_eo, |
| |
ROFF_EP, |
| |
ROFF_EQ, |
| |
ROFF_errprint, |
| |
ROFF_ev, |
| |
ROFF_evc, |
| |
ROFF_ex, |
| |
ROFF_fallback, |
| |
ROFF_fam, |
| |
ROFF_fc, |
| |
ROFF_fchar, |
| |
ROFF_fcolor, |
| |
ROFF_fdeferlig, |
| |
ROFF_feature, |
| |
/* MAN_fi; ignored in mdoc(7) */ |
| |
ROFF_fkern, |
| |
ROFF_fl, |
| |
ROFF_flig, |
| |
ROFF_fp, |
| |
ROFF_fps, |
| |
ROFF_fschar, |
| |
ROFF_fspacewidth, |
| |
ROFF_fspecial, |
| |
/* MAN_ft; ignored in mdoc(7) */ |
| |
ROFF_ftr, |
| |
ROFF_fzoom, |
| |
ROFF_gcolor, |
| |
ROFF_hc, |
| |
ROFF_hcode, |
| |
ROFF_hidechar, |
| |
ROFF_hla, |
| |
ROFF_hlm, |
| |
ROFF_hpf, |
| |
ROFF_hpfa, |
| |
ROFF_hpfcode, |
| |
ROFF_hw, |
| |
ROFF_hy, |
| |
ROFF_hylang, |
| |
ROFF_hylen, |
| |
ROFF_hym, |
| |
ROFF_hypp, |
| |
ROFF_hys, |
| |
ROFF_ie, |
| |
ROFF_if, |
| |
ROFF_ig, |
| |
/* MAN_in; ignored in mdoc(7) */ |
| |
ROFF_index, |
| |
ROFF_it, |
| |
ROFF_itc, |
| |
ROFF_IX, |
| |
ROFF_kern, |
| |
ROFF_kernafter, |
| |
ROFF_kernbefore, |
| |
ROFF_kernpair, |
| |
ROFF_lc, |
| |
ROFF_lc_ctype, |
| |
ROFF_lds, |
| |
ROFF_length, |
| |
ROFF_letadj, |
| |
ROFF_lf, |
| |
ROFF_lg, |
| |
ROFF_lhang, |
| |
ROFF_linetabs, |
| |
/* MAN_ll, MDOC_ll */ |
| |
ROFF_lnr, |
| |
ROFF_lnrf, |
| |
ROFF_lpfx, |
| |
ROFF_ls, |
| |
ROFF_lsm, |
| |
ROFF_lt, |
| |
ROFF_mc, |
| |
ROFF_mediasize, |
| |
ROFF_minss, |
| |
ROFF_mk, |
| |
ROFF_mso, |
| |
ROFF_na, |
| |
ROFF_ne, |
| |
/* MAN_nf; ignored in mdoc(7) */ |
| |
ROFF_nh, |
| |
ROFF_nhychar, |
| |
ROFF_nm, |
| |
ROFF_nn, |
| |
ROFF_nop, |
| |
ROFF_nr, |
| |
ROFF_nrf, |
| |
ROFF_nroff, |
| |
ROFF_ns, |
| |
ROFF_nx, |
| |
ROFF_open, |
| |
ROFF_opena, |
| |
ROFF_os, |
| |
ROFF_output, |
| |
ROFF_padj, |
| |
ROFF_papersize, |
| |
ROFF_pc, |
| |
ROFF_pev, |
| |
ROFF_pi, |
| |
ROFF_PI, |
| |
ROFF_pl, |
| |
ROFF_pm, |
| |
ROFF_pn, |
| |
ROFF_pnr, |
| |
ROFF_po, |
| |
ROFF_ps, |
| |
ROFF_psbb, |
| |
ROFF_pshape, |
| |
ROFF_pso, |
| |
ROFF_ptr, |
| |
ROFF_pvs, |
| |
ROFF_rchar, |
| |
ROFF_rd, |
| |
ROFF_recursionlimit, |
| |
ROFF_return, |
| |
ROFF_rfschar, |
| |
ROFF_rhang, |
| |
ROFF_rj, |
| |
ROFF_rm, |
| |
ROFF_rn, |
| |
ROFF_rnn, |
| |
ROFF_rr, |
| |
ROFF_rs, |
| |
ROFF_rt, |
| |
ROFF_schar, |
| |
ROFF_sentchar, |
| |
ROFF_shc, |
| |
ROFF_shift, |
| |
ROFF_sizes, |
| |
ROFF_so, |
| |
/* MAN_sp, MDOC_sp */ |
| |
ROFF_spacewidth, |
| |
ROFF_special, |
| |
ROFF_spreadwarn, |
| |
ROFF_ss, |
| |
ROFF_sty, |
| |
ROFF_substring, |
| |
ROFF_sv, |
| |
ROFF_sy, |
| |
ROFF_T_, |
| |
ROFF_ta, |
| |
ROFF_tc, |
| |
ROFF_TE, |
| |
ROFF_TH, |
| |
ROFF_ti, |
| |
ROFF_tkf, |
| |
ROFF_tl, |
| |
ROFF_tm, |
| |
ROFF_tm1, |
| |
ROFF_tmc, |
| |
ROFF_tr, |
| |
ROFF_track, |
| |
ROFF_transchar, |
| |
ROFF_trf, |
| |
ROFF_trimat, |
| |
ROFF_trin, |
| |
ROFF_trnt, |
| |
ROFF_troff, |
| |
ROFF_TS, |
| |
ROFF_uf, |
| |
ROFF_ul, |
| |
ROFF_unformat, |
| |
ROFF_unwatch, |
| |
ROFF_unwatchn, |
| |
ROFF_vpt, |
| |
ROFF_vs, |
| |
ROFF_warn, |
| |
ROFF_warnscale, |
| |
ROFF_watch, |
| |
ROFF_watchlength, |
| |
ROFF_watchn, |
| |
ROFF_wh, |
| |
ROFF_while, |
| |
ROFF_write, |
| |
ROFF_writec, |
| |
ROFF_writem, |
| |
ROFF_xflag, |
| |
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 */ |
| |
struct roffnode *last; /* leaf of stack */ |
| |
int *rstack; /* stack of inverted `ie' values */ |
| |
struct roffreg *regtab; /* number registers */ |
| |
struct roffkv *strtab; /* user-defined strings & macros */ |
| |
struct roffkv *xmbtab; /* multi-byte trans table (`tr') */ |
| |
struct roffstr *xtab; /* single-byte trans table (`tr') */ |
| |
const char *current_string; /* value of last called user macro */ |
| |
struct tbl_node *first_tbl; /* first table parsed */ |
| |
struct tbl_node *last_tbl; /* last table parsed */ |
| |
struct tbl_node *tbl; /* current table being parsed */ |
| |
struct eqn_node *last_eqn; /* last equation parsed */ |
| |
struct eqn_node *first_eqn; /* first equation parsed */ |
| |
struct eqn_node *eqn; /* current equation being parsed */ |
| |
int eqn_inline; /* current equation is inline */ |
| |
int options; /* parse options */ |
| |
int rstacksz; /* current size limit of rstack */ |
| |
int rstackpos; /* position in rstack */ |
| |
int format; /* current file in mdoc or man format */ |
| |
int argc; /* number of args of the last macro */ |
| |
char control; /* control character */ |
| |
}; |
| |
|
| 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. */ |
struct buf *buf, /* input buffer */ \ |
| struct tm tm; /* `Dd' results. */ |
int ln, /* parse line */ \ |
| char name[64]; /* `Nm' results. */ |
int ppos, /* original pos in buffer */ \ |
| char os[64]; /* `Os' results. */ |
int pos, /* current pos in buffer */ \ |
| char title[64]; /* `Dt' results. */ |
int *offs /* reset offset of buffer data */ |
| char section[64]; /* `Dt' results. */ |
|
| char volume[64]; /* `Dt' results. */ |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
| int state; |
|
| #define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ |
struct roffmac { |
| #define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
const char *name; /* macro name */ |
| #define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
roffproc proc; /* process new macro */ |
| #define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
roffproc text; /* process as child text of macro */ |
| #define ROFF_BODY (1 << 5) /* In roff body. */ |
roffproc sub; /* process as child of macro */ |
| struct roffcb cb; /* Callbacks. */ |
int flags; |
| void *arg; /* Callbacks' arg. */ |
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
| |
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 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 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 |
/* --- function prototypes ------------------------------------------------ */ |
| roff_free(struct rofftree *tree, int flush) |
|
| |
static enum rofft roffhash_find(const char *, size_t); |
| |
static void roffhash_init(void); |
| |
static void roffnode_cleanscope(struct roff *); |
| |
static void roffnode_pop(struct roff *); |
| |
static void roffnode_push(struct roff *, enum rofft, |
| |
const char *, int, int); |
| |
static enum rofferr roff_block(ROFF_ARGS); |
| |
static enum rofferr roff_block_text(ROFF_ARGS); |
| |
static enum rofferr roff_block_sub(ROFF_ARGS); |
| |
static enum rofferr roff_brp(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 enum rofferr roff_eqndelim(struct roff *, struct buf *, int); |
| |
static int roff_evalcond(struct roff *r, int, char *, int *); |
| |
static int roff_evalnum(struct roff *, int, |
| |
const char *, int *, int *, int); |
| |
static int roff_evalpar(struct roff *, int, |
| |
const char *, int *, int *, int); |
| |
static int roff_evalstrcond(const char *, int *); |
| |
static void roff_free1(struct roff *); |
| |
static void roff_freereg(struct roffreg *); |
| |
static void roff_freestr(struct roffkv *); |
| |
static size_t roff_getname(struct roff *, char **, int, int); |
| |
static int roff_getnum(const char *, int *, int *, 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 struct roff *, |
| |
const char *name); |
| |
static const char *roff_getstrn(const struct roff *, |
| |
const char *, size_t); |
| |
static int roff_hasregn(const struct roff *, |
| |
const char *, size_t); |
| |
static enum rofferr roff_insec(ROFF_ARGS); |
| |
static enum rofferr roff_it(ROFF_ARGS); |
| |
static enum rofferr roff_line_ignore(ROFF_ARGS); |
| |
static void roff_man_alloc1(struct roff_man *); |
| |
static void roff_man_free1(struct roff_man *); |
| |
static enum rofferr roff_nr(ROFF_ARGS); |
| |
static enum rofft roff_parse(struct roff *, char *, int *, |
| |
int, int); |
| |
static enum rofferr roff_parsetext(struct buf *, int, int *); |
| |
static enum rofferr roff_res(struct roff *, struct buf *, int, int); |
| |
static enum rofferr roff_rm(ROFF_ARGS); |
| |
static enum rofferr roff_rr(ROFF_ARGS); |
| |
static void roff_setstr(struct roff *, |
| |
const char *, const char *, int); |
| |
static void roff_setstrn(struct roffkv **, const char *, |
| |
size_t, const char *, size_t, int); |
| |
static enum rofferr roff_so(ROFF_ARGS); |
| |
static enum rofferr roff_tr(ROFF_ARGS); |
| |
static enum rofferr roff_Dd(ROFF_ARGS); |
| |
static enum rofferr roff_TH(ROFF_ARGS); |
| |
static enum rofferr roff_TE(ROFF_ARGS); |
| |
static enum rofferr roff_TS(ROFF_ARGS); |
| |
static enum rofferr roff_EQ(ROFF_ARGS); |
| |
static enum rofferr roff_EN(ROFF_ARGS); |
| |
static enum rofferr roff_T_(ROFF_ARGS); |
| |
static enum rofferr roff_unsupp(ROFF_ARGS); |
| |
static enum rofferr roff_userdef(ROFF_ARGS); |
| |
|
| |
/* --- constant data ------------------------------------------------------ */ |
| |
|
| |
/* See roffhash_find() */ |
| |
|
| |
#define ASCII_HI 126 |
| |
#define ASCII_LO 33 |
| |
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
| |
|
| |
#define ROFFNUM_SCALE (1 << 0) /* Honour scaling in roff_getnum(). */ |
| |
#define ROFFNUM_WHITE (1 << 1) /* Skip whitespace in roff_evalnum(). */ |
| |
|
| |
static struct roffmac *hash[HASHWIDTH]; |
| |
|
| |
static struct roffmac roffs[ROFF_MAX] = { |
| |
{ "ab", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ad", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "af", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "aln", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "als", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "ami1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "as", roff_ds, NULL, NULL, 0, NULL }, |
| |
{ "as1", roff_ds, NULL, NULL, 0, NULL }, |
| |
{ "asciify", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "backtrace", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "bd", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "bleedat", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "blm", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "box", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "boxa", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "bp", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "BP", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "break", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "breakchar", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "brnl", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "brp", roff_brp, NULL, NULL, 0, NULL }, |
| |
{ "brpnl", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "c2", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "cc", roff_cc, NULL, NULL, 0, NULL }, |
| |
{ "ce", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "cf", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "cflags", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ch", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "char", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "chop", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "class", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "close", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "CL", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "color", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "composite", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "continue", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "cp", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "cropat", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "cs", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "cu", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "da", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "dch", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "Dd", roff_Dd, NULL, NULL, 0, NULL }, |
| |
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "defcolor", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "dei1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
| |
{ "device", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "devicem", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "di", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "do", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
| |
{ "ds1", roff_ds, NULL, NULL, 0, NULL }, |
| |
{ "dwh", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "dt", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ec", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ecr", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ecs", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
| |
{ "em", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "EN", roff_EN, NULL, NULL, 0, NULL }, |
| |
{ "eo", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "EP", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "EQ", roff_EQ, NULL, NULL, 0, NULL }, |
| |
{ "errprint", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ev", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "evc", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ex", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "fallback", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fam", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fc", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "fchar", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "fcolor", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fdeferlig", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "feature", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fkern", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fl", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "flig", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fp", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fps", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fschar", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "fspacewidth", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fspecial", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ftr", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "fzoom", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "gcolor", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hc", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hcode", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hidechar", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hla", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hlm", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hpf", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hpfa", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hpfcode", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hw", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hy", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hylang", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hylen", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hym", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hypp", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "hys", 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 }, |
| |
{ "index", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "it", roff_it, NULL, NULL, 0, NULL }, |
| |
{ "itc", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "IX", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "kern", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "kernafter", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "kernbefore", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "kernpair", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "lc", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lc_ctype", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lds", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "length", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "letadj", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "lf", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "lg", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "lhang", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "linetabs", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lnr", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lnrf", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lpfx", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "ls", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "lsm", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "lt", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "mc", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "mediasize", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "minss", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "mk", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "mso", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "na", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ne", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "nh", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "nhychar", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "nm", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "nn", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "nop", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
| |
{ "nrf", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "nroff", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ns", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "nx", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "open", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "opena", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "os", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "output", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "padj", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "papersize", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pc", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pev", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pi", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "PI", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "pl", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pm", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pn", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pnr", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "po", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ps", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "psbb", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "pshape", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "pso", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "ptr", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "pvs", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "rchar", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "rd", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "recursionlimit", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "return", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "rfschar", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "rhang", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "rj", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "rm", roff_rm, NULL, NULL, 0, NULL }, |
| |
{ "rn", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "rnn", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "rr", roff_rr, NULL, NULL, 0, NULL }, |
| |
{ "rs", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "rt", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "schar", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "sentchar", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "shc", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "shift", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "sizes", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "so", roff_so, NULL, NULL, 0, NULL }, |
| |
{ "spacewidth", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "special", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "spreadwarn", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ss", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "sty", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "substring", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "sv", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "sy", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "T&", roff_T_, NULL, NULL, 0, NULL }, |
| |
{ "ta", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "tc", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "TE", roff_TE, NULL, NULL, 0, NULL }, |
| |
{ "TH", roff_TH, NULL, NULL, 0, NULL }, |
| |
{ "ti", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "tkf", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "tl", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "tm", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "tm1", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "tmc", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "tr", roff_tr, NULL, NULL, 0, NULL }, |
| |
{ "track", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "transchar", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "trf", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "trimat", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "trin", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "trnt", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "troff", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "TS", roff_TS, NULL, NULL, 0, NULL }, |
| |
{ "uf", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "ul", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "unformat", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "unwatch", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "unwatchn", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "vpt", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "vs", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "warn", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "warnscale", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "watch", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "watchlength", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "watchn", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ "wh", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "while", roff_unsupp, NULL, NULL, 0, NULL }, |
| |
{ "write", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "writec", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "writem", roff_insec, NULL, NULL, 0, NULL }, |
| |
{ "xflag", roff_line_ignore, NULL, NULL, 0, NULL }, |
| |
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
| |
{ NULL, roff_userdef, NULL, NULL, 0, NULL }, |
| |
}; |
| |
|
| |
/* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */ |
| |
const char *const __mdoc_reserved[] = { |
| |
"Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At", |
| |
"Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq", |
| |
"Brc", "Bro", "Brq", "Bsx", "Bt", "Bx", |
| |
"Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq", |
| |
"Dt", "Dv", "Dx", "D1", |
| |
"Ec", "Ed", "Ef", "Ek", "El", "Em", |
| |
"En", "Eo", "Er", "Es", "Ev", "Ex", |
| |
"Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx", |
| |
"Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", |
| |
"Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx", |
| |
"Oc", "Oo", "Op", "Os", "Ot", "Ox", |
| |
"Pa", "Pc", "Pf", "Po", "Pp", "Pq", |
| |
"Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv", |
| |
"Sc", "Sh", "Sm", "So", "Sq", |
| |
"Ss", "St", "Sx", "Sy", |
| |
"Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr", |
| |
"%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O", |
| |
"%P", "%Q", "%R", "%T", "%U", "%V", |
| |
NULL |
| |
}; |
| |
|
| |
/* not currently implemented: BT DE DS ME MT PT SY TQ YS */ |
| |
const char *const __man_reserved[] = { |
| |
"AT", "B", "BI", "BR", "DT", |
| |
"EE", "EN", "EQ", "EX", "HP", "I", "IB", "IP", "IR", |
| |
"LP", "OP", "P", "PD", "PP", |
| |
"R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", |
| |
"TE", "TH", "TP", "TS", "T&", "UC", "UE", "UR", |
| |
NULL |
| |
}; |
| |
|
| |
/* Array of injected predefined strings. */ |
| |
#define PREDEFS_MAX 38 |
| |
static const struct predef predefs[PREDEFS_MAX] = { |
| |
#include "predefs.in" |
| |
}; |
| |
|
| |
/* See roffhash_find() */ |
| |
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
| |
|
| |
static int roffit_lines; /* number of lines to delay */ |
| |
static char *roffit_macro; /* nil-terminated macro line */ |
| |
|
| |
|
| |
/* --- request table ------------------------------------------------------ */ |
| |
|
| |
static void |
| |
roffhash_init(void) |
| { |
{ |
| int error, t; |
struct roffmac *n; |
| struct roffnode *n; |
int buc, i; |
| |
|
| error = 0; |
for (i = 0; i < (int)ROFF_USERDEF; i++) { |
| |
assert(roffs[i].name[0] >= ASCII_LO); |
| |
assert(roffs[i].name[0] <= ASCII_HI); |
| |
|
| if ( ! flush) |
buc = ROFF_HASH(roffs[i].name); |
| goto end; |
|
| |
|
| error = 1; |
if (NULL != (n = hash[buc])) { |
| |
for ( ; n->next; n = n->next) |
| |
/* Do nothing. */ ; |
| |
n->next = &roffs[i]; |
| |
} else |
| |
hash[buc] = &roffs[i]; |
| |
} |
| |
} |
| |
|
| if (ROFF_PRELUDE & tree->state) { |
/* |
| roff_err(tree, NULL, "prelude never finished"); |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
| goto end; |
* the nil-terminated string name could be found. |
| } |
*/ |
| |
static enum rofft |
| |
roffhash_find(const char *p, size_t s) |
| |
{ |
| |
int buc; |
| |
struct roffmac *n; |
| |
|
| for (n = tree->last; n; n = n->parent) { |
/* |
| if (0 != tokens[n->tok].ctx) |
* libroff has an extremely simple hashtable, for the time |
| continue; |
* being, which simply keys on the first character, which must |
| roff_err(tree, NULL, "closing explicit scope `%s'", |
* be printable, then walks a chain. It works well enough until |
| toknames[n->tok]); |
* optimised. |
| goto end; |
*/ |
| |
|
| |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
| |
return ROFF_MAX; |
| |
|
| |
buc = ROFF_HASH(p); |
| |
|
| |
if (NULL == (n = hash[buc])) |
| |
return ROFF_MAX; |
| |
for ( ; n; n = n->next) |
| |
if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s]) |
| |
return (enum rofft)(n - roffs); |
| |
|
| |
return ROFF_MAX; |
| |
} |
| |
|
| |
/* --- stack of request blocks -------------------------------------------- */ |
| |
|
| |
/* |
| |
* Pop the current node off of the stack of roff instructions currently |
| |
* pending. |
| |
*/ |
| |
static void |
| |
roffnode_pop(struct roff *r) |
| |
{ |
| |
struct roffnode *p; |
| |
|
| |
assert(r->last); |
| |
p = r->last; |
| |
|
| |
r->last = r->last->parent; |
| |
free(p->name); |
| |
free(p->end); |
| |
free(p); |
| |
} |
| |
|
| |
/* |
| |
* 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; |
| |
} |
| |
|
| |
/* --- roff parser state data management ---------------------------------- */ |
| |
|
| |
static void |
| |
roff_free1(struct roff *r) |
| |
{ |
| |
struct tbl_node *tbl; |
| |
struct eqn_node *e; |
| |
int i; |
| |
|
| |
while (NULL != (tbl = r->first_tbl)) { |
| |
r->first_tbl = tbl->next; |
| |
tbl_free(tbl); |
| } |
} |
| |
r->first_tbl = r->last_tbl = r->tbl = NULL; |
| |
|
| while (tree->last) { |
while (NULL != (e = r->first_eqn)) { |
| t = tree->last->tok; |
r->first_eqn = e->next; |
| if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
eqn_free(e); |
| goto end; |
|
| } |
} |
| |
r->first_eqn = r->last_eqn = r->eqn = NULL; |
| |
|
| if ( ! (*tree->cb.rofftail)(tree->arg)) |
while (r->last) |
| goto end; |
roffnode_pop(r); |
| |
|
| error = 0; |
free (r->rstack); |
| |
r->rstack = NULL; |
| |
r->rstacksz = 0; |
| |
r->rstackpos = -1; |
| |
|
| end: |
roff_freereg(r->regtab); |
| |
r->regtab = NULL; |
| |
|
| while (tree->last) |
roff_freestr(r->strtab); |
| roffnode_free(tree); |
roff_freestr(r->xmbtab); |
| |
r->strtab = r->xmbtab = NULL; |
| |
|
| free(tree); |
if (r->xtab) |
| |
for (i = 0; i < 128; i++) |
| return(error ? 0 : 1); |
free(r->xtab[i].p); |
| |
free(r->xtab); |
| |
r->xtab = NULL; |
| } |
} |
| |
|
| |
void |
| |
roff_reset(struct roff *r) |
| |
{ |
| |
|
| struct rofftree * |
roff_free1(r); |
| roff_alloc(const struct roffcb *cb, void *args) |
r->format = r->options & (MPARSE_MDOC | MPARSE_MAN); |
| |
r->control = 0; |
| |
} |
| |
|
| |
void |
| |
roff_free(struct roff *r) |
| { |
{ |
| struct rofftree *tree; |
|
| |
|
| assert(args); |
roff_free1(r); |
| assert(cb); |
free(r); |
| |
} |
| |
|
| if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) |
struct roff * |
| err(1, "calloc"); |
roff_alloc(struct mparse *parse, int options) |
| |
{ |
| |
struct roff *r; |
| |
|
| tree->state = ROFF_PRELUDE; |
r = mandoc_calloc(1, sizeof(struct roff)); |
| tree->arg = args; |
r->parse = parse; |
| |
r->options = options; |
| |
r->format = options & (MPARSE_MDOC | MPARSE_MAN); |
| |
r->rstackpos = -1; |
| |
|
| (void)memcpy(&tree->cb, cb, sizeof(struct roffcb)); |
roffhash_init(); |
| |
|
| return(tree); |
return r; |
| } |
} |
| |
|
| |
/* --- syntax tree state data management ---------------------------------- */ |
| |
|
| int |
static void |
| roff_engine(struct rofftree *tree, char *buf) |
roff_man_free1(struct roff_man *man) |
| { |
{ |
| |
|
| tree->cur = buf; |
if (man->first != NULL) |
| assert(buf); |
roff_node_delete(man, man->first); |
| |
free(man->meta.msec); |
| |
free(man->meta.vol); |
| |
free(man->meta.os); |
| |
free(man->meta.arch); |
| |
free(man->meta.title); |
| |
free(man->meta.name); |
| |
free(man->meta.date); |
| |
} |
| |
|
| if (0 == *buf) { |
static void |
| roff_err(tree, buf, "blank line"); |
roff_man_alloc1(struct roff_man *man) |
| return(0); |
{ |
| } else if ('.' != *buf) |
|
| return(textparse(tree, buf)); |
|
| |
|
| return(roffparse(tree, buf)); |
memset(&man->meta, 0, sizeof(man->meta)); |
| |
man->first = mandoc_calloc(1, sizeof(*man->first)); |
| |
man->first->type = ROFFT_ROOT; |
| |
man->last = man->first; |
| |
man->last_es = NULL; |
| |
man->flags = 0; |
| |
man->macroset = MACROSET_NONE; |
| |
man->lastsec = man->lastnamed = SEC_NONE; |
| |
man->next = ROFF_NEXT_CHILD; |
| } |
} |
| |
|
| |
void |
| |
roff_man_reset(struct roff_man *man) |
| |
{ |
| |
|
| static int |
roff_man_free1(man); |
| textparse(struct rofftree *tree, char *buf) |
roff_man_alloc1(man); |
| |
} |
| |
|
| |
void |
| |
roff_man_free(struct roff_man *man) |
| { |
{ |
| char *bufp; |
|
| |
|
| /* TODO: literal parsing. */ |
roff_man_free1(man); |
| |
free(man); |
| |
} |
| |
|
| if ( ! (ROFF_BODY & tree->state)) { |
struct roff_man * |
| roff_err(tree, buf, "data not in body"); |
roff_man_alloc(struct roff *roff, struct mparse *parse, |
| return(0); |
const char *defos, int quick) |
| } |
{ |
| |
struct roff_man *man; |
| |
|
| /* LINTED */ |
man = mandoc_calloc(1, sizeof(*man)); |
| while (*buf) { |
man->parse = parse; |
| while (*buf && isspace(*buf)) |
man->roff = roff; |
| buf++; |
man->defos = defos; |
| |
man->quick = quick; |
| |
roff_man_alloc1(man); |
| |
return man; |
| |
} |
| |
|
| if (0 == *buf) |
/* --- syntax tree handling ----------------------------------------------- */ |
| break; |
|
| |
|
| bufp = buf++; |
struct roff_node * |
| |
roff_node_alloc(struct roff_man *man, int line, int pos, |
| |
enum roff_type type, int tok) |
| |
{ |
| |
struct roff_node *n; |
| |
|
| while (*buf && ! isspace(*buf)) |
n = mandoc_calloc(1, sizeof(*n)); |
| buf++; |
n->line = line; |
| |
n->pos = pos; |
| |
n->tok = tok; |
| |
n->type = type; |
| |
n->sec = man->lastsec; |
| |
|
| if (0 != *buf) { |
if (man->flags & MDOC_SYNOPSIS) |
| *buf++ = 0; |
n->flags |= MDOC_SYNPRETTY; |
| if ( ! roffdata(tree, 1, bufp)) |
else |
| return(0); |
n->flags &= ~MDOC_SYNPRETTY; |
| continue; |
if (man->flags & MDOC_NEWLINE) |
| } |
n->flags |= MDOC_LINE; |
| |
man->flags &= ~MDOC_NEWLINE; |
| |
|
| if ( ! roffdata(tree, 1, bufp)) |
return n; |
| return(0); |
} |
| |
|
| |
void |
| |
roff_node_append(struct roff_man *man, struct roff_node *n) |
| |
{ |
| |
|
| |
switch (man->next) { |
| |
case ROFF_NEXT_SIBLING: |
| |
if (man->last->next != NULL) { |
| |
n->next = man->last->next; |
| |
man->last->next->prev = n; |
| |
} else |
| |
man->last->parent->last = n; |
| |
man->last->next = n; |
| |
n->prev = man->last; |
| |
n->parent = man->last->parent; |
| break; |
break; |
| |
case ROFF_NEXT_CHILD: |
| |
man->last->child = n; |
| |
n->parent = man->last; |
| |
n->parent->last = n; |
| |
break; |
| |
default: |
| |
abort(); |
| } |
} |
| |
n->parent->nchild++; |
| |
man->last = n; |
| |
|
| return(1); |
switch (n->type) { |
| |
case ROFFT_HEAD: |
| |
n->parent->head = n; |
| |
break; |
| |
case ROFFT_BODY: |
| |
if (n->end != ENDBODY_NOT) |
| |
return; |
| |
n->parent->body = n; |
| |
break; |
| |
case ROFFT_TAIL: |
| |
n->parent->tail = n; |
| |
break; |
| |
default: |
| |
return; |
| |
} |
| |
|
| |
/* |
| |
* Copy over the normalised-data pointer of our parent. Not |
| |
* everybody has one, but copying a null pointer is fine. |
| |
*/ |
| |
|
| |
n->norm = n->parent->norm; |
| |
assert(n->parent->type == ROFFT_BLOCK); |
| } |
} |
| |
|
| |
void |
| |
roff_word_alloc(struct roff_man *man, int line, int pos, const char *word) |
| |
{ |
| |
struct roff_node *n; |
| |
|
| static int |
n = roff_node_alloc(man, line, pos, ROFFT_TEXT, TOKEN_NONE); |
| roffargs(const struct rofftree *tree, |
n->string = roff_strdup(man->roff, word); |
| int tok, char *buf, char **argv) |
roff_node_append(man, n); |
| |
if (man->macroset == MACROSET_MDOC) |
| |
n->flags |= MDOC_VALID | MDOC_ENDED; |
| |
else |
| |
man_valid_post(man); |
| |
man->next = ROFF_NEXT_SIBLING; |
| |
} |
| |
|
| |
void |
| |
roff_word_append(struct roff_man *man, const char *word) |
| { |
{ |
| int i; |
struct roff_node *n; |
| char *p; |
char *addstr, *newstr; |
| |
|
| assert(tok >= 0 && tok < ROFF_MAX); |
n = man->last; |
| assert('.' == *buf); |
addstr = roff_strdup(man->roff, word); |
| |
mandoc_asprintf(&newstr, "%s %s", n->string, addstr); |
| |
free(addstr); |
| |
free(n->string); |
| |
n->string = newstr; |
| |
man->next = ROFF_NEXT_SIBLING; |
| |
} |
| |
|
| p = buf; |
void |
| |
roff_elem_alloc(struct roff_man *man, int line, int pos, int tok) |
| |
{ |
| |
struct roff_node *n; |
| |
|
| /* |
n = roff_node_alloc(man, line, pos, ROFFT_ELEM, tok); |
| * This is an ugly little loop. It parses a line into |
roff_node_append(man, n); |
| * space-delimited tokens. If a quote mark is encountered, a |
man->next = ROFF_NEXT_CHILD; |
| * token is alloted the entire quoted text. If whitespace is |
} |
| * escaped, it's included in the prior alloted token. |
|
| */ |
|
| |
|
| /* LINTED */ |
struct roff_node * |
| for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) { |
roff_block_alloc(struct roff_man *man, int line, int pos, int tok) |
| if ('\"' == *buf) { |
{ |
| argv[i] = ++buf; |
struct roff_node *n; |
| while (*buf && '\"' != *buf) |
|
| buf++; |
|
| if (0 == *buf) { |
|
| roff_err(tree, argv[i], "unclosed " |
|
| "quote in argument " |
|
| "list for `%s'", |
|
| toknames[tok]); |
|
| return(0); |
|
| } |
|
| } else { |
|
| argv[i] = buf++; |
|
| while (*buf) { |
|
| if ( ! isspace(*buf)) { |
|
| buf++; |
|
| continue; |
|
| } |
|
| if (*(buf - 1) == '\\') { |
|
| buf++; |
|
| continue; |
|
| } |
|
| break; |
|
| } |
|
| if (0 == *buf) |
|
| continue; |
|
| } |
|
| *buf++ = 0; |
|
| while (*buf && isspace(*buf)) |
|
| buf++; |
|
| } |
|
| |
|
| assert(i > 0); |
n = roff_node_alloc(man, line, pos, ROFFT_BLOCK, tok); |
| if (ROFF_MAXLINEARG == i && *buf) { |
roff_node_append(man, n); |
| roff_err(tree, p, "too many arguments for `%s'", toknames |
man->next = ROFF_NEXT_CHILD; |
| [tok]); |
return n; |
| return(0); |
} |
| } |
|
| |
|
| argv[i] = NULL; |
struct roff_node * |
| return(1); |
roff_head_alloc(struct roff_man *man, int line, int pos, int tok) |
| |
{ |
| |
struct roff_node *n; |
| |
|
| |
n = roff_node_alloc(man, line, pos, ROFFT_HEAD, tok); |
| |
roff_node_append(man, n); |
| |
man->next = ROFF_NEXT_CHILD; |
| |
return n; |
| } |
} |
| |
|
| |
struct roff_node * |
| |
roff_body_alloc(struct roff_man *man, int line, int pos, int tok) |
| |
{ |
| |
struct roff_node *n; |
| |
|
| static int |
n = roff_node_alloc(man, line, pos, ROFFT_BODY, tok); |
| roffscan(int tok, const int *tokv) |
roff_node_append(man, n); |
| |
man->next = ROFF_NEXT_CHILD; |
| |
return n; |
| |
} |
| |
|
| |
void |
| |
roff_addeqn(struct roff_man *man, const struct eqn *eqn) |
| { |
{ |
| |
struct roff_node *n; |
| |
|
| if (NULL == tokv) |
n = roff_node_alloc(man, eqn->ln, eqn->pos, ROFFT_EQN, TOKEN_NONE); |
| return(1); |
n->eqn = eqn; |
| |
if (eqn->ln > man->last->line) |
| |
n->flags |= MDOC_LINE; |
| |
roff_node_append(man, n); |
| |
man->next = ROFF_NEXT_SIBLING; |
| |
} |
| |
|
| for ( ; ROFF_MAX != *tokv; tokv++) |
void |
| if (tok == *tokv) |
roff_addtbl(struct roff_man *man, const struct tbl_span *tbl) |
| return(1); |
{ |
| |
struct roff_node *n; |
| |
|
| return(0); |
if (man->macroset == MACROSET_MAN) |
| |
man_breakscope(man, TOKEN_NONE); |
| |
n = roff_node_alloc(man, tbl->line, 0, ROFFT_TBL, TOKEN_NONE); |
| |
n->span = tbl; |
| |
roff_node_append(man, n); |
| |
if (man->macroset == MACROSET_MDOC) |
| |
n->flags |= MDOC_VALID | MDOC_ENDED; |
| |
else |
| |
man_valid_post(man); |
| |
man->next = ROFF_NEXT_SIBLING; |
| } |
} |
| |
|
| |
void |
| |
roff_node_unlink(struct roff_man *man, struct roff_node *n) |
| |
{ |
| |
|
| static int |
/* Adjust siblings. */ |
| roffparse(struct rofftree *tree, char *buf) |
|
| |
if (n->prev) |
| |
n->prev->next = n->next; |
| |
if (n->next) |
| |
n->next->prev = n->prev; |
| |
|
| |
/* Adjust parent. */ |
| |
|
| |
if (n->parent != NULL) { |
| |
n->parent->nchild--; |
| |
if (n->parent->child == n) |
| |
n->parent->child = n->next; |
| |
if (n->parent->last == n) |
| |
n->parent->last = n->prev; |
| |
} |
| |
|
| |
/* Adjust parse point. */ |
| |
|
| |
if (man == NULL) |
| |
return; |
| |
if (man->last == n) { |
| |
if (n->prev == NULL) { |
| |
man->last = n->parent; |
| |
man->next = ROFF_NEXT_CHILD; |
| |
} else { |
| |
man->last = n->prev; |
| |
man->next = ROFF_NEXT_SIBLING; |
| |
} |
| |
} |
| |
if (man->first == n) |
| |
man->first = NULL; |
| |
} |
| |
|
| |
void |
| |
roff_node_free(struct roff_node *n) |
| { |
{ |
| int tok, t; |
|
| struct roffnode *n; |
|
| char *argv[ROFF_MAXLINEARG]; |
|
| char **argvp; |
|
| |
|
| if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2)) |
if (n->args != NULL) |
| if (0 == strncmp(buf, ".\\\"", 3)) |
mdoc_argv_free(n->args); |
| return(1); |
if (n->type == ROFFT_BLOCK || n->type == ROFFT_ELEM) |
| |
free(n->norm); |
| |
free(n->string); |
| |
free(n); |
| |
} |
| |
|
| if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
void |
| roff_err(tree, buf + 1, "bogus line macro"); |
roff_node_delete(struct roff_man *man, struct roff_node *n) |
| return(0); |
{ |
| } else if (NULL == tokens[tok].cb) { |
|
| roff_err(tree, buf + 1, "unsupported macro `%s'", |
while (n->child != NULL) |
| toknames[tok]); |
roff_node_delete(man, n->child); |
| return(0); |
assert(n->nchild == 0); |
| |
roff_node_unlink(man, n); |
| |
roff_node_free(n); |
| |
} |
| |
|
| |
void |
| |
deroff(char **dest, const struct roff_node *n) |
| |
{ |
| |
char *cp; |
| |
size_t sz; |
| |
|
| |
if (n->type != ROFFT_TEXT) { |
| |
for (n = n->child; n != NULL; n = n->next) |
| |
deroff(dest, n); |
| |
return; |
| } |
} |
| |
|
| assert(ROFF___ != tok); |
/* Skip leading whitespace and escape sequences. */ |
| if ( ! roffargs(tree, tok, buf, argv)) |
|
| return(0); |
|
| |
|
| argvp = (char **)argv; |
cp = n->string; |
| |
while (*cp != '\0') { |
| |
if ('\\' == *cp) { |
| |
cp++; |
| |
mandoc_escape((const char **)&cp, NULL, NULL); |
| |
} else if (isspace((unsigned char)*cp)) |
| |
cp++; |
| |
else |
| |
break; |
| |
} |
| |
|
| /* |
/* Skip trailing whitespace. */ |
| * Prelude macros break some assumptions, so branch now. |
|
| */ |
|
| |
|
| if (ROFF_PRELUDE & tree->state) { |
|
| assert(NULL == tree->last); |
|
| return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
|
| } |
|
| |
|
| assert(ROFF_BODY & tree->state); |
for (sz = strlen(cp); sz; sz--) |
| |
if ( ! isspace((unsigned char)cp[sz-1])) |
| |
break; |
| |
|
| /* |
/* Skip empty strings. */ |
| * First check that our possible parents and parent's possible |
|
| * children are satisfied. |
|
| */ |
|
| |
|
| if (tree->last && ! roffscan |
if (sz == 0) |
| (tree->last->tok, tokens[tok].parents)) { |
return; |
| roff_err(tree, *argvp, "`%s' has invalid parent `%s'", |
|
| toknames[tok], |
|
| toknames[tree->last->tok]); |
|
| return(0); |
|
| } |
|
| |
|
| if (tree->last && ! roffscan |
if (*dest == NULL) { |
| (tok, tokens[tree->last->tok].children)) { |
*dest = mandoc_strndup(cp, sz); |
| roff_err(tree, *argvp, "`%s' is invalid child of `%s'", |
return; |
| toknames[tok], |
|
| toknames[tree->last->tok]); |
|
| return(0); |
|
| } |
} |
| |
|
| /* |
mandoc_asprintf(&cp, "%s %*s", *dest, (int)sz, cp); |
| * Branch if we're not a layout token. |
free(*dest); |
| */ |
*dest = cp; |
| |
} |
| |
|
| if (ROFF_LAYOUT != tokens[tok].type) |
/* --- main functions of the roff parser ---------------------------------- */ |
| return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
|
| if (0 == tokens[tok].ctx) |
|
| return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
|
| |
|
| /* |
/* |
| * First consider implicit-end tags, like as follows: |
* In the current line, expand escape sequences that tend to get |
| * .Sh SECTION 1 |
* used in numerical expressions and conditional requests. |
| * .Sh SECTION 2 |
* Also check the syntax of the remaining escape sequences. |
| * In this, we want to close the scope of the NAME section. If |
*/ |
| * there's an intermediary implicit-end tag, such as |
static enum rofferr |
| * .Sh SECTION 1 |
roff_res(struct roff *r, struct buf *buf, int ln, int pos) |
| * .Ss Subsection 1 |
{ |
| * .Sh SECTION 2 |
char ubuf[24]; /* buffer to print the number */ |
| * then it must be closed as well. |
const char *start; /* start of the string to process */ |
| */ |
char *stesc; /* start of an escape sequence ('\\') */ |
| |
const char *stnam; /* start of the name, after "[(*" */ |
| |
const char *cp; /* end of the name, e.g. before ']' */ |
| |
const char *res; /* the string to be substituted */ |
| |
char *nbuf; /* new buffer to copy buf->buf to */ |
| |
size_t maxl; /* expected length of the escape name */ |
| |
size_t naml; /* actual length of the escape name */ |
| |
enum mandoc_esc esc; /* type of the escape sequence */ |
| |
int inaml; /* length returned from mandoc_escape() */ |
| |
int expand_count; /* to avoid infinite loops */ |
| |
int npos; /* position in numeric expression */ |
| |
int arg_complete; /* argument not interrupted by eol */ |
| |
char term; /* character terminating the escape */ |
| |
|
| if (tok == tokens[tok].ctx) { |
expand_count = 0; |
| /* |
start = buf->buf + pos; |
| * First search up to the point where we must close. |
stesc = strchr(start, '\0') - 1; |
| * If one doesn't exist, then we can open a new scope. |
while (stesc-- > start) { |
| |
|
| |
/* Search backwards for the next backslash. */ |
| |
|
| |
if (*stesc != '\\') |
| |
continue; |
| |
|
| |
/* If it is escaped, skip it. */ |
| |
|
| |
for (cp = stesc - 1; cp >= start; cp--) |
| |
if (*cp != '\\') |
| |
break; |
| |
|
| |
if ((stesc - cp) % 2 == 0) { |
| |
stesc = (char *)cp; |
| |
continue; |
| |
} |
| |
|
| |
/* Decide whether to expand or to check only. */ |
| |
|
| |
term = '\0'; |
| |
cp = stesc + 1; |
| |
switch (*cp) { |
| |
case '*': |
| |
res = NULL; |
| |
break; |
| |
case 'B': |
| |
case 'w': |
| |
term = cp[1]; |
| |
/* FALLTHROUGH */ |
| |
case 'n': |
| |
res = ubuf; |
| |
break; |
| |
default: |
| |
esc = mandoc_escape(&cp, &stnam, &inaml); |
| |
if (esc == ESCAPE_ERROR || |
| |
(esc == ESCAPE_SPECIAL && |
| |
mchars_spec2cp(stnam, inaml) < 0)) |
| |
mandoc_vmsg(MANDOCERR_ESC_BAD, |
| |
r->parse, ln, (int)(stesc - buf->buf), |
| |
"%.*s", (int)(cp - stesc), stesc); |
| |
continue; |
| |
} |
| |
|
| |
if (EXPAND_LIMIT < ++expand_count) { |
| |
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, |
| |
ln, (int)(stesc - buf->buf), NULL); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
/* |
| |
* The third character decides the length |
| |
* of the name of the string or register. |
| |
* Save a pointer to the name. |
| */ |
*/ |
| |
|
| for (n = tree->last; n; n = n->parent) { |
if (term == '\0') { |
| assert(0 == tokens[n->tok].ctx || |
switch (*++cp) { |
| n->tok == tokens[n->tok].ctx); |
case '\0': |
| if (n->tok == tok) |
maxl = 0; |
| break; |
break; |
| if (ROFF_SHALLOW & tokens[tok].flags) { |
case '(': |
| n = NULL; |
cp++; |
| |
maxl = 2; |
| break; |
break; |
| |
case '[': |
| |
cp++; |
| |
term = ']'; |
| |
maxl = 0; |
| |
break; |
| |
default: |
| |
maxl = 1; |
| |
break; |
| } |
} |
| if (tokens[n->tok].ctx == n->tok) |
} else { |
| |
cp += 2; |
| |
maxl = 0; |
| |
} |
| |
stnam = cp; |
| |
|
| |
/* Advance to the end of the name. */ |
| |
|
| |
naml = 0; |
| |
arg_complete = 1; |
| |
while (maxl == 0 || naml < maxl) { |
| |
if (*cp == '\0') { |
| |
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
| |
ln, (int)(stesc - buf->buf), stesc); |
| |
arg_complete = 0; |
| |
break; |
| |
} |
| |
if (maxl == 0 && *cp == term) { |
| |
cp++; |
| |
break; |
| |
} |
| |
if (*cp++ != '\\' || stesc[1] != 'w') { |
| |
naml++; |
| continue; |
continue; |
| roff_err(tree, *argv, "`%s' breaks `%s' scope", |
} |
| toknames[tok], toknames[n->tok]); |
switch (mandoc_escape(&cp, NULL, NULL)) { |
| return(0); |
case ESCAPE_SPECIAL: |
| |
case ESCAPE_UNICODE: |
| |
case ESCAPE_NUMBERED: |
| |
case ESCAPE_OVERSTRIKE: |
| |
naml++; |
| |
break; |
| |
default: |
| |
break; |
| |
} |
| } |
} |
| |
|
| /* |
/* |
| * Create a new scope, as no previous one exists to |
* Retrieve the replacement string; if it is |
| * close out. |
* undefined, resume searching for escapes. |
| */ |
*/ |
| |
|
| if (NULL == n) |
switch (stesc[1]) { |
| return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
case '*': |
| |
if (arg_complete) |
| |
res = roff_getstrn(r, stnam, naml); |
| |
break; |
| |
case 'B': |
| |
npos = 0; |
| |
ubuf[0] = arg_complete && |
| |
roff_evalnum(r, ln, stnam, &npos, |
| |
NULL, ROFFNUM_SCALE) && |
| |
stnam + npos + 1 == cp ? '1' : '0'; |
| |
ubuf[1] = '\0'; |
| |
break; |
| |
case 'n': |
| |
if (arg_complete) |
| |
(void)snprintf(ubuf, sizeof(ubuf), "%d", |
| |
roff_getregn(r, stnam, naml)); |
| |
else |
| |
ubuf[0] = '\0'; |
| |
break; |
| |
case 'w': |
| |
/* use even incomplete args */ |
| |
(void)snprintf(ubuf, sizeof(ubuf), "%d", |
| |
24 * (int)naml); |
| |
break; |
| |
} |
| |
|
| /* |
if (res == NULL) { |
| * Close out all intermediary scoped blocks, then hang |
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
| * the current scope from our predecessor's parent. |
r->parse, ln, (int)(stesc - buf->buf), |
| */ |
"%.*s", (int)naml, stnam); |
| |
res = ""; |
| |
} else if (buf->sz + strlen(res) > SHRT_MAX) { |
| |
mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, |
| |
ln, (int)(stesc - buf->buf), NULL); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| do { |
/* Replace the escape sequence by the string. */ |
| t = tree->last->tok; |
|
| if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
|
| return(0); |
|
| } while (t != tok); |
|
| |
|
| return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
*stesc = '\0'; |
| |
buf->sz = mandoc_asprintf(&nbuf, "%s%s%s", |
| |
buf->buf, res, cp) + 1; |
| |
|
| |
/* Prepare for the next replacement. */ |
| |
|
| |
start = nbuf + pos; |
| |
stesc = nbuf + (stesc - buf->buf) + strlen(res); |
| |
free(buf->buf); |
| |
buf->buf = nbuf; |
| } |
} |
| |
return ROFF_CONT; |
| |
} |
| |
|
| |
/* |
| |
* Process text streams. |
| |
*/ |
| |
static enum rofferr |
| |
roff_parsetext(struct buf *buf, int pos, int *offs) |
| |
{ |
| |
size_t sz; |
| |
const char *start; |
| |
char *p; |
| |
int isz; |
| |
enum mandoc_esc esc; |
| |
|
| |
/* Spring the input line trap. */ |
| |
|
| |
if (roffit_lines == 1) { |
| |
isz = mandoc_asprintf(&p, "%s\n.%s", buf->buf, roffit_macro); |
| |
free(buf->buf); |
| |
buf->buf = p; |
| |
buf->sz = isz + 1; |
| |
*offs = 0; |
| |
free(roffit_macro); |
| |
roffit_lines = 0; |
| |
return ROFF_REPARSE; |
| |
} else if (roffit_lines > 1) |
| |
--roffit_lines; |
| |
|
| |
/* Convert all breakable hyphens into ASCII_HYPH. */ |
| |
|
| |
start = p = buf->buf + pos; |
| |
|
| |
while (*p != '\0') { |
| |
sz = strcspn(p, "-\\"); |
| |
p += sz; |
| |
|
| |
if (*p == '\0') |
| |
break; |
| |
|
| |
if (*p == '\\') { |
| |
/* Skip over escapes. */ |
| |
p++; |
| |
esc = mandoc_escape((const char **)&p, NULL, NULL); |
| |
if (esc == ESCAPE_ERROR) |
| |
break; |
| |
while (*p == '-') |
| |
p++; |
| |
continue; |
| |
} else if (p == start) { |
| |
p++; |
| |
continue; |
| |
} |
| |
|
| |
if (isalpha((unsigned char)p[-1]) && |
| |
isalpha((unsigned char)p[1])) |
| |
*p = ASCII_HYPH; |
| |
p++; |
| |
} |
| |
return ROFF_CONT; |
| |
} |
| |
|
| |
enum rofferr |
| |
roff_parseln(struct roff *r, int ln, struct buf *buf, int *offs) |
| |
{ |
| |
enum rofft t; |
| |
enum rofferr e; |
| |
int pos; /* parse point */ |
| |
int spos; /* saved parse point for messages */ |
| |
int ppos; /* original offset in buf->buf */ |
| |
int ctl; /* macro line (boolean) */ |
| |
|
| |
ppos = pos = *offs; |
| |
|
| |
/* Handle in-line equation delimiters. */ |
| |
|
| |
if (r->tbl == NULL && |
| |
r->last_eqn != NULL && r->last_eqn->delim && |
| |
(r->eqn == NULL || r->eqn_inline)) { |
| |
e = roff_eqndelim(r, buf, pos); |
| |
if (e == ROFF_REPARSE) |
| |
return e; |
| |
assert(e == ROFF_CONT); |
| |
} |
| |
|
| |
/* Expand some escape sequences. */ |
| |
|
| |
e = roff_res(r, buf, ln, pos); |
| |
if (e == ROFF_IGN) |
| |
return e; |
| |
assert(e == ROFF_CONT); |
| |
|
| |
ctl = roff_getcontrol(r, buf->buf, &pos); |
| |
|
| /* |
/* |
| * Now consider explicit-end tags, where we want to close back |
* First, if a scope is open and we're not a macro, pass the |
| * to a specific tag. Example: |
* text through the macro's filter. |
| * .Bl |
* Equations process all content themselves. |
| * .It Item. |
* Tables process almost all content themselves, but we want |
| * .El |
* to warn about macros before passing it there. |
| * In this, the `El' tag closes out the scope of `Bl'. |
|
| */ |
*/ |
| |
|
| assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx); |
if (r->last != NULL && ! ctl) { |
| |
t = r->last->tok; |
| |
assert(roffs[t].text); |
| |
e = (*roffs[t].text)(r, t, buf, ln, pos, pos, offs); |
| |
assert(e == ROFF_IGN || e == ROFF_CONT); |
| |
if (e != ROFF_CONT) |
| |
return e; |
| |
} |
| |
if (r->eqn != NULL) |
| |
return eqn_read(&r->eqn, ln, buf->buf, ppos, offs); |
| |
if (r->tbl != NULL && ( ! ctl || buf->buf[pos] == '\0')) |
| |
return tbl_read(r->tbl, ln, buf->buf, ppos); |
| |
if ( ! ctl) |
| |
return roff_parsetext(buf, pos, offs); |
| |
|
| /* LINTED */ |
/* Skip empty request lines. */ |
| for (n = tree->last; n; n = n->parent) |
|
| if (n->tok != tokens[tok].ctx) { |
|
| if (n->tok == tokens[n->tok].ctx) |
|
| continue; |
|
| roff_err(tree, *argv, "`%s' breaks `%s' scope", |
|
| toknames[tok], toknames[n->tok]); |
|
| return(0); |
|
| } else |
|
| break; |
|
| |
|
| |
if (buf->buf[pos] == '"') { |
| |
mandoc_msg(MANDOCERR_COMMENT_BAD, r->parse, |
| |
ln, pos, NULL); |
| |
return ROFF_IGN; |
| |
} else if (buf->buf[pos] == '\0') |
| |
return ROFF_IGN; |
| |
|
| if (NULL == n) { |
/* |
| roff_err(tree, *argv, "`%s' has no starting tag `%s'", |
* If a scope is open, go to the child handler for that macro, |
| toknames[tok], |
* as it may want to preprocess before doing anything with it. |
| toknames[tokens[tok].ctx]); |
* Don't do so if an equation is open. |
| return(0); |
*/ |
| |
|
| |
if (r->last) { |
| |
t = r->last->tok; |
| |
assert(roffs[t].sub); |
| |
return (*roffs[t].sub)(r, t, buf, ln, ppos, pos, offs); |
| } |
} |
| |
|
| /* LINTED */ |
/* No scope is open. This is a new request or macro. */ |
| do { |
|
| t = tree->last->tok; |
|
| if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT)) |
|
| return(0); |
|
| } while (t != tokens[tok].ctx); |
|
| |
|
| return(1); |
spos = pos; |
| } |
t = roff_parse(r, buf->buf, &pos, ln, ppos); |
| |
|
| |
/* Tables ignore most macros. */ |
| |
|
| static int |
if (r->tbl != NULL && (t == ROFF_MAX || t == ROFF_TS)) { |
| rofffindarg(const char *name) |
mandoc_msg(MANDOCERR_TBLMACRO, r->parse, |
| { |
ln, pos, buf->buf + spos); |
| size_t i; |
if (t == ROFF_TS) |
| |
return ROFF_IGN; |
| |
while (buf->buf[pos] != '\0' && buf->buf[pos] != ' ') |
| |
pos++; |
| |
while (buf->buf[pos] != '\0' && buf->buf[pos] == ' ') |
| |
pos++; |
| |
return tbl_read(r->tbl, ln, buf->buf, pos); |
| |
} |
| |
|
| /* FIXME: use a table, this is slow but ok for now. */ |
/* |
| |
* This is neither a roff request nor a user-defined macro. |
| |
* Let the standard macro set parsers handle it. |
| |
*/ |
| |
|
| /* LINTED */ |
if (t == ROFF_MAX) |
| for (i = 0; i < ROFF_ARGMAX; i++) |
return ROFF_CONT; |
| /* LINTED */ |
|
| if (0 == strcmp(name, tokargnames[i])) |
/* Execute a roff request or a user defined macro. */ |
| return((int)i); |
|
| |
assert(roffs[t].proc); |
| return(ROFF_ARGMAX); |
return (*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs); |
| } |
} |
| |
|
| |
void |
| |
roff_endparse(struct roff *r) |
| |
{ |
| |
|
| static int |
if (r->last) |
| rofffindtok(const char *buf) |
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
| |
r->last->line, r->last->col, |
| |
roffs[r->last->tok].name); |
| |
|
| |
if (r->eqn) { |
| |
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
| |
r->eqn->eqn.ln, r->eqn->eqn.pos, "EQ"); |
| |
eqn_end(&r->eqn); |
| |
} |
| |
|
| |
if (r->tbl) { |
| |
mandoc_msg(MANDOCERR_BLK_NOEND, r->parse, |
| |
r->tbl->line, r->tbl->pos, "TS"); |
| |
tbl_end(&r->tbl); |
| |
} |
| |
} |
| |
|
| |
/* |
| |
* Parse a roff node's type from the input buffer. This must be in the |
| |
* form of ".foo xxx" in the usual way. |
| |
*/ |
| |
static enum rofft |
| |
roff_parse(struct roff *r, char *buf, int *pos, int ln, int ppos) |
| { |
{ |
| char token[4]; |
char *cp; |
| int i; |
const char *mac; |
| |
size_t maclen; |
| |
enum rofft t; |
| |
|
| for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++) |
cp = buf + *pos; |
| token[i] = *buf; |
|
| |
|
| if (i == 3) |
if ('\0' == *cp || '"' == *cp || '\t' == *cp || ' ' == *cp) |
| return(ROFF_MAX); |
return ROFF_MAX; |
| |
|
| token[i] = 0; |
mac = cp; |
| |
maclen = roff_getname(r, &cp, ln, ppos); |
| |
|
| /* FIXME: use a table, this is slow but ok for now. */ |
t = (r->current_string = roff_getstrn(r, mac, maclen)) |
| |
? ROFF_USERDEF : roffhash_find(mac, maclen); |
| |
|
| /* LINTED */ |
if (ROFF_MAX != t) |
| for (i = 0; i < ROFF_MAX; i++) |
*pos = cp - buf; |
| /* LINTED */ |
|
| if (0 == strcmp(toknames[i], token)) |
|
| return((int)i); |
|
| |
|
| return(ROFF_MAX); |
return t; |
| } |
} |
| |
|
| |
/* --- handling of request blocks ----------------------------------------- */ |
| |
|
| static int |
static enum rofferr |
| roffispunct(const char *p) |
roff_cblock(ROFF_ARGS) |
| { |
{ |
| |
|
| if (0 == *p) |
/* |
| return(0); |
* A block-close `..' should only be invoked as a child of an |
| if (0 != *(p + 1)) |
* ignore macro, otherwise raise a warning and just ignore it. |
| return(0); |
*/ |
| |
|
| switch (*p) { |
if (r->last == NULL) { |
| case('{'): |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| /* FALLTHROUGH */ |
ln, ppos, ".."); |
| case('.'): |
return ROFF_IGN; |
| /* FALLTHROUGH */ |
} |
| case(','): |
|
| /* FALLTHROUGH */ |
switch (r->last->tok) { |
| case(';'): |
case ROFF_am: |
| /* FALLTHROUGH */ |
/* ROFF_am1 is remapped to ROFF_am in roff_block(). */ |
| case(':'): |
case ROFF_ami: |
| /* FALLTHROUGH */ |
case ROFF_de: |
| case('?'): |
/* ROFF_de1 is remapped to ROFF_de in roff_block(). */ |
| /* FALLTHROUGH */ |
case ROFF_dei: |
| case('!'): |
case ROFF_ig: |
| /* FALLTHROUGH */ |
|
| case('('): |
|
| /* FALLTHROUGH */ |
|
| case(')'): |
|
| /* FALLTHROUGH */ |
|
| case('['): |
|
| /* FALLTHROUGH */ |
|
| case(']'): |
|
| /* FALLTHROUGH */ |
|
| case('}'): |
|
| return(1); |
|
| default: |
|
| break; |
break; |
| |
default: |
| |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| |
ln, ppos, ".."); |
| |
return ROFF_IGN; |
| } |
} |
| |
|
| return(0); |
if (buf->buf[pos] != '\0') |
| |
mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, |
| |
".. %s", buf->buf + pos); |
| |
|
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
return ROFF_IGN; |
| |
|
| } |
} |
| |
|
| |
static void |
| |
roffnode_cleanscope(struct roff *r) |
| |
{ |
| |
|
| static int |
while (r->last) { |
| rofffindcallable(const char *name) |
if (--r->last->endspan != 0) |
| |
break; |
| |
roffnode_pop(r); |
| |
} |
| |
} |
| |
|
| |
static void |
| |
roff_ccond(struct roff *r, int ln, int ppos) |
| { |
{ |
| int c; |
|
| |
|
| if (ROFF_MAX == (c = rofffindtok(name))) |
if (NULL == r->last) { |
| return(ROFF_MAX); |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| assert(c >= 0 && c < ROFF_MAX); |
ln, ppos, "\\}"); |
| return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
return; |
| |
} |
| |
|
| |
switch (r->last->tok) { |
| |
case ROFF_el: |
| |
case ROFF_ie: |
| |
case ROFF_if: |
| |
break; |
| |
default: |
| |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| |
ln, ppos, "\\}"); |
| |
return; |
| |
} |
| |
|
| |
if (r->last->endspan > -1) { |
| |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| |
ln, ppos, "\\}"); |
| |
return; |
| |
} |
| |
|
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
return; |
| } |
} |
| |
|
| |
static enum rofferr |
| |
roff_block(ROFF_ARGS) |
| |
{ |
| |
const char *name; |
| |
char *iname, *cp; |
| |
size_t namesz; |
| |
|
| static struct roffnode * |
/* Ignore groff compatibility mode for now. */ |
| roffnode_new(int tokid, struct rofftree *tree) |
|
| |
if (tok == ROFF_de1) |
| |
tok = ROFF_de; |
| |
else if (tok == ROFF_dei1) |
| |
tok = ROFF_dei; |
| |
else if (tok == ROFF_am1) |
| |
tok = ROFF_am; |
| |
else if (tok == ROFF_ami1) |
| |
tok = ROFF_ami; |
| |
|
| |
/* Parse the macro name argument. */ |
| |
|
| |
cp = buf->buf + pos; |
| |
if (tok == ROFF_ig) { |
| |
iname = NULL; |
| |
namesz = 0; |
| |
} else { |
| |
iname = cp; |
| |
namesz = roff_getname(r, &cp, ln, ppos); |
| |
iname[namesz] = '\0'; |
| |
} |
| |
|
| |
/* Resolve the macro name argument if it is indirect. */ |
| |
|
| |
if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { |
| |
if ((name = roff_getstrn(r, iname, namesz)) == NULL) { |
| |
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
| |
r->parse, ln, (int)(iname - buf->buf), |
| |
"%.*s", (int)namesz, iname); |
| |
namesz = 0; |
| |
} else |
| |
namesz = strlen(name); |
| |
} else |
| |
name = iname; |
| |
|
| |
if (namesz == 0 && tok != ROFF_ig) { |
| |
mandoc_msg(MANDOCERR_REQ_EMPTY, r->parse, |
| |
ln, ppos, roffs[tok].name); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
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 (tok == ROFF_de || tok == ROFF_dei) |
| |
roff_setstrn(&r->strtab, name, namesz, "", 0, 0); |
| |
|
| |
if (*cp == '\0') |
| |
return ROFF_IGN; |
| |
|
| |
/* Get the custom end marker. */ |
| |
|
| |
iname = cp; |
| |
namesz = roff_getname(r, &cp, ln, ppos); |
| |
|
| |
/* Resolve the end marker if it is indirect. */ |
| |
|
| |
if (namesz && (tok == ROFF_dei || tok == ROFF_ami)) { |
| |
if ((name = roff_getstrn(r, iname, namesz)) == NULL) { |
| |
mandoc_vmsg(MANDOCERR_STR_UNDEF, |
| |
r->parse, ln, (int)(iname - buf->buf), |
| |
"%.*s", (int)namesz, iname); |
| |
namesz = 0; |
| |
} else |
| |
namesz = strlen(name); |
| |
} else |
| |
name = iname; |
| |
|
| |
if (namesz) |
| |
r->last->end = mandoc_strndup(name, namesz); |
| |
|
| |
if (*cp != '\0') |
| |
mandoc_vmsg(MANDOCERR_ARG_EXCESS, r->parse, |
| |
ln, pos, ".%s ... %s", roffs[tok].name, cp); |
| |
|
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_block_sub(ROFF_ARGS) |
| { |
{ |
| struct roffnode *p; |
enum rofft t; |
| |
int i, j; |
| if (NULL == (p = malloc(sizeof(struct roffnode)))) |
|
| err(1, "malloc"); |
|
| |
|
| p->tok = tokid; |
/* |
| p->parent = tree->last; |
* First check whether a custom macro exists at this level. If |
| tree->last = p; |
* 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. |
| |
*/ |
| |
|
| return(p); |
if (r->last->end) { |
| |
for (i = pos, j = 0; r->last->end[j]; j++, i++) |
| |
if (buf->buf[i] != r->last->end[j]) |
| |
break; |
| |
|
| |
if (r->last->end[j] == '\0' && |
| |
(buf->buf[i] == '\0' || |
| |
buf->buf[i] == ' ' || |
| |
buf->buf[i] == '\t')) { |
| |
roffnode_pop(r); |
| |
roffnode_cleanscope(r); |
| |
|
| |
while (buf->buf[i] == ' ' || buf->buf[i] == '\t') |
| |
i++; |
| |
|
| |
pos = i; |
| |
if (roff_parse(r, buf->buf, &pos, ln, ppos) != |
| |
ROFF_MAX) |
| |
return ROFF_RERUN; |
| |
return ROFF_IGN; |
| |
} |
| |
} |
| |
|
| |
/* |
| |
* If we have no custom end-query or lookup failed, then try |
| |
* pulling it out of the hashtable. |
| |
*/ |
| |
|
| |
t = roff_parse(r, buf->buf, &pos, ln, ppos); |
| |
|
| |
if (t != ROFF_cblock) { |
| |
if (tok != ROFF_ig) |
| |
roff_setstr(r, r->last->name, buf->buf + ppos, 2); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
assert(roffs[t].proc); |
| |
return (*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs); |
| } |
} |
| |
|
| |
static enum rofferr |
| |
roff_block_text(ROFF_ARGS) |
| |
{ |
| |
|
| static int |
if (tok != ROFF_ig) |
| roffargok(int tokid, int argid) |
roff_setstr(r, r->last->name, buf->buf + pos, 2); |
| |
|
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_cond_sub(ROFF_ARGS) |
| { |
{ |
| const int *c; |
enum rofft t; |
| |
char *ep; |
| |
int rr; |
| |
|
| if (NULL == (c = tokens[tokid].args)) |
rr = r->last->rule; |
| return(0); |
roffnode_cleanscope(r); |
| |
t = roff_parse(r, buf->buf, &pos, ln, ppos); |
| |
|
| for ( ; ROFF_ARGMAX != *c; c++) |
/* |
| if (argid == *c) |
* Fully handle known macros when they are structurally |
| return(1); |
* required or when the conditional evaluated to true. |
| |
*/ |
| |
|
| return(0); |
if ((t != ROFF_MAX) && |
| } |
(rr || roffs[t].flags & ROFFMAC_STRUCT)) { |
| |
assert(roffs[t].proc); |
| |
return (*roffs[t].proc)(r, t, buf, ln, ppos, pos, offs); |
| |
} |
| |
|
| |
/* |
| |
* If `\}' occurs on a macro line without a preceding macro, |
| |
* drop the line completely. |
| |
*/ |
| |
|
| static void |
ep = buf->buf + pos; |
| roffnode_free(struct rofftree *tree) |
if (ep[0] == '\\' && ep[1] == '}') |
| |
rr = 0; |
| |
|
| |
/* Always check for the closing delimiter `\}'. */ |
| |
|
| |
while ((ep = strchr(ep, '\\')) != NULL) { |
| |
if (*(++ep) == '}') { |
| |
*ep = '&'; |
| |
roff_ccond(r, ln, ep - buf->buf - 1); |
| |
} |
| |
if (*ep != '\0') |
| |
++ep; |
| |
} |
| |
return rr ? ROFF_CONT : ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_cond_text(ROFF_ARGS) |
| { |
{ |
| struct roffnode *p; |
char *ep; |
| |
int rr; |
| |
|
| assert(tree->last); |
rr = r->last->rule; |
| |
roffnode_cleanscope(r); |
| |
|
| p = tree->last; |
ep = buf->buf + pos; |
| tree->last = tree->last->parent; |
while ((ep = strchr(ep, '\\')) != NULL) { |
| free(p); |
if (*(++ep) == '}') { |
| |
*ep = '&'; |
| |
roff_ccond(r, ln, ep - buf->buf - 1); |
| |
} |
| |
if (*ep != '\0') |
| |
++ep; |
| |
} |
| |
return rr ? ROFF_CONT : ROFF_IGN; |
| } |
} |
| |
|
| |
/* --- handling of numeric and conditional expressions -------------------- */ |
| |
|
| |
/* |
| |
* 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 |
| roffspecial(struct rofftree *tree, int tok, const char *start, |
roff_getnum(const char *v, int *pos, int *res, int flags) |
| const int *argc, const char **argv, |
|
| size_t sz, char **ordp) |
|
| { |
{ |
| |
int myres, scaled, n, p; |
| |
|
| switch (tok) { |
if (NULL == res) |
| case (ROFF_At): |
res = &myres; |
| if (0 == sz) |
|
| break; |
|
| if (0 == strcmp(*ordp, "v6")) |
|
| break; |
|
| else if (0 == strcmp(*ordp, "v7")) |
|
| break; |
|
| else if (0 == strcmp(*ordp, "32v")) |
|
| break; |
|
| else if (0 == strcmp(*ordp, "V.1")) |
|
| break; |
|
| else if (0 == strcmp(*ordp, "V.4")) |
|
| break; |
|
| roff_err(tree, start, "invalid `At' arg"); |
|
| return(0); |
|
| |
|
| case (ROFF_Fn): |
|
| if (0 != sz) |
|
| break; |
|
| roff_err(tree, start, "`%s' expects at least " |
|
| "one arg", toknames[tok]); |
|
| return(0); |
|
| |
|
| case (ROFF_Nm): |
p = *pos; |
| if (0 == sz) { |
n = v[p] == '-'; |
| if (0 == tree->name[0]) { |
if (n || v[p] == '+') |
| roff_err(tree, start, "`Nm' not set"); |
p++; |
| return(0); |
|
| } |
|
| ordp[0] = tree->name; |
|
| ordp[1] = NULL; |
|
| } else if ( ! roffsetname(tree, ordp)) |
|
| return(0); |
|
| break; |
|
| |
|
| case (ROFF_Rv): |
if (flags & ROFFNUM_WHITE) |
| /* FALLTHROUGH*/ |
while (isspace((unsigned char)v[p])) |
| case (ROFF_Sx): |
p++; |
| /* FALLTHROUGH*/ |
|
| case (ROFF_Ex): |
|
| if (1 == sz) |
|
| break; |
|
| roff_err(tree, start, "`%s' expects one arg", |
|
| toknames[tok]); |
|
| return(0); |
|
| |
|
| case (ROFF_Sm): |
for (*res = 0; isdigit((unsigned char)v[p]); p++) |
| if (1 != sz) { |
*res = 10 * *res + v[p] - '0'; |
| roff_err(tree, start, "`Sm' expects one arg"); |
if (p == *pos + n) |
| return(0); |
return 0; |
| } |
|
| |
if (n) |
| if (0 != strcmp(ordp[0], "on") && |
*res = -*res; |
| 0 != strcmp(ordp[0], "off")) { |
|
| roff_err(tree, start, "`Sm' has invalid argument"); |
/* Each number may be followed by one optional scaling unit. */ |
| return(0); |
|
| } |
switch (v[p]) { |
| |
case 'f': |
| |
scaled = *res * 65536; |
| break; |
break; |
| |
case 'i': |
| case (ROFF_Ud): |
scaled = *res * 240; |
| /* FALLTHROUGH */ |
|
| case (ROFF_Ux): |
|
| /* FALLTHROUGH */ |
|
| case (ROFF_Bt): |
|
| if (0 != sz) { |
|
| roff_err(tree, start, "`%s' expects no args", |
|
| toknames[tok]); |
|
| return(0); |
|
| } |
|
| break; |
break; |
| |
case 'c': |
| |
scaled = *res * 240 / 2.54; |
| |
break; |
| |
case 'v': |
| |
case 'P': |
| |
scaled = *res * 40; |
| |
break; |
| |
case 'm': |
| |
case 'n': |
| |
scaled = *res * 24; |
| |
break; |
| |
case 'p': |
| |
scaled = *res * 10 / 3; |
| |
break; |
| |
case 'u': |
| |
scaled = *res; |
| |
break; |
| |
case 'M': |
| |
scaled = *res * 6 / 25; |
| |
break; |
| default: |
default: |
| |
scaled = *res; |
| |
p--; |
| break; |
break; |
| } |
} |
| |
if (flags & ROFFNUM_SCALE) |
| |
*res = scaled; |
| |
|
| return((*tree->cb.roffspecial)(tree->arg, tok, |
*pos = p + 1; |
| tree->cur, argc, argv, ordp)); |
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 |
| roffcall(struct rofftree *tree, int tok, char **argv) |
roff_evalstrcond(const char *v, int *pos) |
| { |
{ |
| |
const char *s1, *s2, *s3; |
| |
int match; |
| |
|
| if (NULL == tokens[tok].cb) { |
match = 0; |
| roff_err(tree, *argv, "unsupported macro `%s'", |
s1 = v + *pos; /* initial delimiter */ |
| toknames[tok]); |
s2 = s1 + 1; /* for scanning the first string */ |
| return(0); |
s3 = strchr(s2, *s1); /* for scanning the second string */ |
| |
|
| |
if (NULL == s3) /* found no middle delimiter */ |
| |
goto out; |
| |
|
| |
while ('\0' != *++s3) { |
| |
if (*s2 != *s3) { /* mismatch */ |
| |
s3 = strchr(s3, *s1); |
| |
break; |
| |
} |
| |
if (*s3 == *s1) { /* found the final delimiter */ |
| |
match = 1; |
| |
break; |
| |
} |
| |
s2++; |
| } |
} |
| if ( ! (*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER)) |
|
| return(0); |
out: |
| return(1); |
if (NULL == s3) |
| |
s3 = strchr(s2, '\0'); |
| |
else if (*s3 != '\0') |
| |
s3++; |
| |
*pos = s3 - v; |
| |
return match; |
| } |
} |
| |
|
| |
/* |
| |
* Evaluate an optionally negated single character, numerical, |
| |
* or string condition. |
| |
*/ |
| static int |
static int |
| roffnextopt(const struct rofftree *tree, int tok, |
roff_evalcond(struct roff *r, int ln, char *v, int *pos) |
| char ***in, char **val) |
|
| { |
{ |
| char *arg, **argv; |
char *cp, *name; |
| int v; |
size_t sz; |
| |
int number, savepos, wanttrue; |
| |
|
| *val = NULL; |
if ('!' == v[*pos]) { |
| argv = *in; |
wanttrue = 0; |
| assert(argv); |
(*pos)++; |
| |
} else |
| |
wanttrue = 1; |
| |
|
| if (NULL == (arg = *argv)) |
switch (v[*pos]) { |
| return(-1); |
case '\0': |
| if ('-' != *arg) |
return 0; |
| return(-1); |
case 'n': |
| |
case 'o': |
| |
(*pos)++; |
| |
return wanttrue; |
| |
case 'c': |
| |
case 'd': |
| |
case 'e': |
| |
case 't': |
| |
case 'v': |
| |
(*pos)++; |
| |
return !wanttrue; |
| |
case 'r': |
| |
cp = name = v + ++*pos; |
| |
sz = roff_getname(r, &cp, ln, *pos); |
| |
*pos = cp - v; |
| |
return (sz && roff_hasregn(r, name, sz)) == wanttrue; |
| |
default: |
| |
break; |
| |
} |
| |
|
| if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) { |
savepos = *pos; |
| roff_warn(tree, arg, "argument-like parameter `%s' to " |
if (roff_evalnum(r, ln, v, pos, &number, ROFFNUM_SCALE)) |
| "`%s'", arg, toknames[tok]); |
return (number > 0) == wanttrue; |
| return(-1); |
else if (*pos == savepos) |
| } |
return roff_evalstrcond(v, pos) == wanttrue; |
| |
else |
| if ( ! roffargok(tok, v)) { |
return 0; |
| 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; |
static enum rofferr |
| |
roff_line_ignore(ROFF_ARGS) |
| |
{ |
| |
|
| if (NULL == *argv) { |
return ROFF_IGN; |
| roff_err(tree, arg, "empty value of `%s' for `%s'", |
} |
| tokargnames[v], toknames[tok]); |
|
| return(ROFF_ARGMAX); |
|
| } |
|
| |
|
| return(v); |
static enum rofferr |
| |
roff_insec(ROFF_ARGS) |
| |
{ |
| |
|
| |
mandoc_msg(MANDOCERR_REQ_INSEC, r->parse, |
| |
ln, ppos, roffs[tok].name); |
| |
return ROFF_IGN; |
| } |
} |
| |
|
| |
static enum rofferr |
| |
roff_unsupp(ROFF_ARGS) |
| |
{ |
| |
|
| static int |
mandoc_msg(MANDOCERR_REQ_UNSUPP, r->parse, |
| roffpurgepunct(struct rofftree *tree, char **argv) |
ln, ppos, roffs[tok].name); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_cond(ROFF_ARGS) |
| { |
{ |
| int i; |
|
| |
|
| i = 0; |
roffnode_push(r, tok, NULL, ln, ppos); |
| while (argv[i]) |
|
| i++; |
|
| assert(i > 0); |
|
| if ( ! roffispunct(argv[--i])) |
|
| return(1); |
|
| while (i >= 0 && roffispunct(argv[i])) |
|
| i--; |
|
| i++; |
|
| |
|
| /* LINTED */ |
/* |
| while (argv[i]) |
* An `.el' has no conditional body: it will consume the value |
| if ( ! roffdata(tree, 0, argv[i++])) |
* of the current rstack entry set in prior `ie' calls or |
| return(0); |
* defaults to DENY. |
| return(1); |
* |
| } |
* If we're not an `el', however, then evaluate the conditional. |
| |
*/ |
| |
|
| |
r->last->rule = tok == ROFF_el ? |
| |
(r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) : |
| |
roff_evalcond(r, ln, buf->buf, &pos); |
| |
|
| static int |
/* |
| roffparseopts(struct rofftree *tree, int tok, |
* An if-else will put the NEGATION of the current evaluated |
| char ***args, int *argc, char **argv) |
* conditional into the stack of rules. |
| { |
*/ |
| int i, c; |
|
| char *v; |
|
| |
|
| i = 0; |
if (tok == ROFF_ie) { |
| |
if (r->rstackpos + 1 == r->rstacksz) { |
| |
r->rstacksz += 16; |
| |
r->rstack = mandoc_reallocarray(r->rstack, |
| |
r->rstacksz, sizeof(int)); |
| |
} |
| |
r->rstack[++r->rstackpos] = !r->last->rule; |
| |
} |
| |
|
| while (-1 != (c = roffnextopt(tree, tok, args, &v))) { |
/* If the parent has false as its rule, then so do we. */ |
| if (ROFF_ARGMAX == c) |
|
| return(0); |
|
| |
|
| argc[i] = c; |
if (r->last->parent && !r->last->parent->rule) |
| argv[i] = v; |
r->last->rule = 0; |
| i++; |
|
| *args = *args + 1; |
/* |
| |
* Determine scope. |
| |
* If there is nothing on the line after the conditional, |
| |
* not even whitespace, use next-line scope. |
| |
*/ |
| |
|
| |
if (buf->buf[pos] == '\0') { |
| |
r->last->endspan = 2; |
| |
goto out; |
| } |
} |
| |
|
| argc[i] = ROFF_ARGMAX; |
while (buf->buf[pos] == ' ') |
| argv[i] = NULL; |
pos++; |
| return(1); |
|
| |
/* An opening brace requests multiline scope. */ |
| |
|
| |
if (buf->buf[pos] == '\\' && buf->buf[pos + 1] == '{') { |
| |
r->last->endspan = -1; |
| |
pos += 2; |
| |
while (buf->buf[pos] == ' ') |
| |
pos++; |
| |
goto out; |
| |
} |
| |
|
| |
/* |
| |
* Anything else following the conditional causes |
| |
* single-line scope. Warn if the scope contains |
| |
* nothing but trailing whitespace. |
| |
*/ |
| |
|
| |
if (buf->buf[pos] == '\0') |
| |
mandoc_msg(MANDOCERR_COND_EMPTY, r->parse, |
| |
ln, ppos, roffs[tok].name); |
| |
|
| |
r->last->endspan = 1; |
| |
|
| |
out: |
| |
*offs = pos; |
| |
return ROFF_RERUN; |
| } |
} |
| |
|
| |
static enum rofferr |
| |
roff_ds(ROFF_ARGS) |
| |
{ |
| |
char *string; |
| |
const char *name; |
| |
size_t namesz; |
| |
|
| |
/* Ignore groff compatibility mode for now. */ |
| |
|
| |
if (tok == ROFF_ds1) |
| |
tok = ROFF_ds; |
| |
else if (tok == ROFF_as1) |
| |
tok = ROFF_as; |
| |
|
| |
/* |
| |
* The first word is the name of the string. |
| |
* If it is empty or terminated by an escape sequence, |
| |
* abort the `ds' request without defining anything. |
| |
*/ |
| |
|
| |
name = string = buf->buf + pos; |
| |
if (*name == '\0') |
| |
return ROFF_IGN; |
| |
|
| |
namesz = roff_getname(r, &string, ln, pos); |
| |
if (name[namesz] == '\\') |
| |
return ROFF_IGN; |
| |
|
| |
/* Read past the initial double-quote, if any. */ |
| |
if (*string == '"') |
| |
string++; |
| |
|
| |
/* The rest is the value. */ |
| |
roff_setstrn(&r->strtab, name, namesz, string, strlen(string), |
| |
ROFF_as == tok); |
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
/* |
| |
* Parse a single operator, one or two characters long. |
| |
* If the operator is recognized, return success and advance the |
| |
* parse point, else return failure and let the parse point unchanged. |
| |
*/ |
| static int |
static int |
| roffdata(struct rofftree *tree, int space, char *buf) |
roff_getop(const char *v, int *pos, char *res) |
| { |
{ |
| |
|
| if (0 == *buf) |
*res = v[*pos]; |
| return(1); |
|
| return((*tree->cb.roffdata)(tree->arg, |
switch (*res) { |
| space != 0, tree->cur, buf)); |
case '+': |
| |
case '-': |
| |
case '*': |
| |
case '/': |
| |
case '%': |
| |
case '&': |
| |
case ':': |
| |
break; |
| |
case '<': |
| |
switch (v[*pos + 1]) { |
| |
case '=': |
| |
*res = 'l'; |
| |
(*pos)++; |
| |
break; |
| |
case '>': |
| |
*res = '!'; |
| |
(*pos)++; |
| |
break; |
| |
case '?': |
| |
*res = 'i'; |
| |
(*pos)++; |
| |
break; |
| |
default: |
| |
break; |
| |
} |
| |
break; |
| |
case '>': |
| |
switch (v[*pos + 1]) { |
| |
case '=': |
| |
*res = 'g'; |
| |
(*pos)++; |
| |
break; |
| |
case '?': |
| |
*res = 'a'; |
| |
(*pos)++; |
| |
break; |
| |
default: |
| |
break; |
| |
} |
| |
break; |
| |
case '=': |
| |
if ('=' == v[*pos + 1]) |
| |
(*pos)++; |
| |
break; |
| |
default: |
| |
return 0; |
| |
} |
| |
(*pos)++; |
| |
|
| |
return *res; |
| } |
} |
| |
|
| |
/* |
| |
* Evaluate either a parenthesized numeric expression |
| |
* or a single signed integer number. |
| |
*/ |
| |
static int |
| |
roff_evalpar(struct roff *r, int ln, |
| |
const char *v, int *pos, int *res, int flags) |
| |
{ |
| |
|
| /* ARGSUSED */ |
if ('(' != v[*pos]) |
| static int |
return roff_getnum(v, pos, res, flags); |
| roff_Dd(ROFFCALL_ARGS) |
|
| |
(*pos)++; |
| |
if ( ! roff_evalnum(r, ln, v, pos, res, flags | ROFFNUM_WHITE)) |
| |
return 0; |
| |
|
| |
/* |
| |
* Omission of the closing parenthesis |
| |
* is an error in validation mode, |
| |
* but ignored in evaluation mode. |
| |
*/ |
| |
|
| |
if (')' == v[*pos]) |
| |
(*pos)++; |
| |
else if (NULL == res) |
| |
return 0; |
| |
|
| |
return 1; |
| |
} |
| |
|
| |
/* |
| |
* Evaluate a complete numeric expression. |
| |
* Proceed left to right, there is no concept of precedence. |
| |
*/ |
| |
static int |
| |
roff_evalnum(struct roff *r, int ln, const char *v, |
| |
int *pos, int *res, int flags) |
| { |
{ |
| time_t t; |
int mypos, operand2; |
| char *p, buf[32]; |
char operator; |
| |
|
| if (ROFF_BODY & tree->state) { |
if (NULL == pos) { |
| assert( ! (ROFF_PRELUDE & tree->state)); |
mypos = 0; |
| assert(ROFF_PRELUDE_Dd & tree->state); |
pos = &mypos; |
| return(roff_text(tok, tree, argv, type)); |
|
| } |
} |
| |
|
| assert(ROFF_PRELUDE & tree->state); |
if (flags & ROFFNUM_WHITE) |
| assert( ! (ROFF_BODY & tree->state)); |
while (isspace((unsigned char)v[*pos])) |
| |
(*pos)++; |
| |
|
| if (ROFF_PRELUDE_Dd & tree->state) { |
if ( ! roff_evalpar(r, ln, v, pos, res, flags)) |
| roff_err(tree, *argv, "repeated `Dd' in prelude"); |
return 0; |
| 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); |
while (1) { |
| |
if (flags & ROFFNUM_WHITE) |
| |
while (isspace((unsigned char)v[*pos])) |
| |
(*pos)++; |
| |
|
| argv++; |
if ( ! roff_getop(v, pos, &operator)) |
| |
break; |
| |
|
| if (0 == strcmp(*argv, "$Mdocdate$")) { |
if (flags & ROFFNUM_WHITE) |
| t = time(NULL); |
while (isspace((unsigned char)v[*pos])) |
| if (NULL == localtime_r(&t, &tree->tm)) |
(*pos)++; |
| err(1, "localtime_r"); |
|
| tree->state |= ROFF_PRELUDE_Dd; |
|
| return(1); |
|
| } |
|
| |
|
| /* Build this from Mdocdate or raw date. */ |
if ( ! roff_evalpar(r, ln, v, pos, &operand2, flags)) |
| |
return 0; |
| buf[0] = 0; |
|
| p = *argv; |
|
| |
|
| if (0 != strcmp(*argv, "$Mdocdate:")) { |
if (flags & ROFFNUM_WHITE) |
| while (*argv) { |
while (isspace((unsigned char)v[*pos])) |
| if (strlcat(buf, *argv++, sizeof(buf)) |
(*pos)++; |
| < sizeof(buf)) |
|
| 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++; |
if (NULL == res) |
| while (*argv && **argv != '$') { |
continue; |
| if (strlcat(buf, *argv++, sizeof(buf)) |
|
| >= sizeof(buf)) { |
switch (operator) { |
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
case '+': |
| return(0); |
*res += operand2; |
| } |
break; |
| if (strlcat(buf, " ", sizeof(buf)) |
case '-': |
| >= sizeof(buf)) { |
*res -= operand2; |
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
break; |
| return(0); |
case '*': |
| |
*res *= operand2; |
| |
break; |
| |
case '/': |
| |
if (operand2 == 0) { |
| |
mandoc_msg(MANDOCERR_DIVZERO, |
| |
r->parse, ln, *pos, v); |
| |
*res = 0; |
| |
break; |
| |
} |
| |
*res /= operand2; |
| |
break; |
| |
case '%': |
| |
if (operand2 == 0) { |
| |
mandoc_msg(MANDOCERR_DIVZERO, |
| |
r->parse, ln, *pos, v); |
| |
*res = 0; |
| |
break; |
| |
} |
| |
*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(); |
| } |
} |
| } |
} |
| if (NULL == *argv) { |
return 1; |
| roff_err(tree, p, "bad `Dd' Mdocdate"); |
} |
| return(0); |
|
| } |
|
| |
|
| if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) { |
/* --- register management ------------------------------------------------ */ |
| roff_err(tree, *argv, "bad `Dd' Mdocdate"); |
|
| return(0); |
void |
| |
roff_setreg(struct roff *r, const char *name, int val, char sign) |
| |
{ |
| |
struct roffreg *reg; |
| |
|
| |
/* Search for an existing register with the same name. */ |
| |
reg = r->regtab; |
| |
|
| |
while (reg && strcmp(name, reg->key.p)) |
| |
reg = reg->next; |
| |
|
| |
if (NULL == reg) { |
| |
/* Create a new register. */ |
| |
reg = mandoc_malloc(sizeof(struct roffreg)); |
| |
reg->key.p = mandoc_strdup(name); |
| |
reg->key.sz = strlen(name); |
| |
reg->val = 0; |
| |
reg->next = r->regtab; |
| |
r->regtab = reg; |
| } |
} |
| |
|
| tree->state |= ROFF_PRELUDE_Dd; |
if ('+' == sign) |
| return(1); |
reg->val += val; |
| |
else if ('-' == sign) |
| |
reg->val -= val; |
| |
else |
| |
reg->val = val; |
| } |
} |
| |
|
| |
/* |
| /* ARGSUSED */ |
* Handle some predefined read-only number registers. |
| static int |
* For now, return -1 if the requested register is not predefined; |
| roff_Dt(ROFFCALL_ARGS) |
* in case a predefined read-only register having the value -1 |
| |
* were to turn up, another special value would have to be chosen. |
| |
*/ |
| |
static int |
| |
roff_getregro(const struct roff *r, const char *name) |
| { |
{ |
| |
|
| if (ROFF_BODY & tree->state) { |
switch (*name) { |
| assert( ! (ROFF_PRELUDE & tree->state)); |
case '$': /* Number of arguments of the last macro evaluated. */ |
| assert(ROFF_PRELUDE_Dt & tree->state); |
return r->argc; |
| return(roff_text(tok, tree, argv, type)); |
case 'A': /* ASCII approximation mode is always off. */ |
| |
return 0; |
| |
case 'g': /* Groff compatibility mode is always on. */ |
| |
return 1; |
| |
case 'H': /* Fixed horizontal resolution. */ |
| |
return 24; |
| |
case 'j': /* Always adjust left margin only. */ |
| |
return 0; |
| |
case 'T': /* Some output device is always defined. */ |
| |
return 1; |
| |
case 'V': /* Fixed vertical resolution. */ |
| |
return 40; |
| |
default: |
| |
return -1; |
| } |
} |
| |
} |
| |
|
| assert(ROFF_PRELUDE & tree->state); |
int |
| assert( ! (ROFF_BODY & tree->state)); |
roff_getreg(const struct roff *r, const char *name) |
| |
{ |
| |
struct roffreg *reg; |
| |
int val; |
| |
|
| if ( ! (ROFF_PRELUDE_Dd & tree->state)) { |
if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) { |
| roff_err(tree, *argv, "out-of-order `Dt' in prelude"); |
val = roff_getregro(r, name + 1); |
| return(0); |
if (-1 != val) |
| } else if (ROFF_PRELUDE_Dt & tree->state) { |
return val; |
| roff_err(tree, *argv, "repeated `Dt' in prelude"); |
|
| return(0); |
|
| } |
} |
| |
|
| argv++; |
for (reg = r->regtab; reg; reg = reg->next) |
| if (NULL == *argv) { |
if (0 == strcmp(name, reg->key.p)) |
| roff_err(tree, *argv, "`Dt' needs document title"); |
return reg->val; |
| return(0); |
|
| } else if (strlcpy(tree->title, *argv, sizeof(tree->title)) |
|
| >= sizeof(tree->title)) { |
|
| roff_err(tree, *argv, "`Dt' document title too long"); |
|
| return(0); |
|
| } |
|
| |
|
| argv++; |
return 0; |
| if (NULL == *argv) { |
} |
| roff_err(tree, *argv, "`Dt' needs section"); |
|
| return(0); |
|
| } else if (strlcpy(tree->section, *argv, sizeof(tree->section)) |
|
| >= sizeof(tree->section)) { |
|
| roff_err(tree, *argv, "`Dt' section too long"); |
|
| return(0); |
|
| } |
|
| |
|
| argv++; |
static int |
| if (NULL == *argv) { |
roff_getregn(const struct roff *r, const char *name, size_t len) |
| tree->volume[0] = 0; |
{ |
| } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume)) |
struct roffreg *reg; |
| >= sizeof(tree->volume)) { |
int val; |
| roff_err(tree, *argv, "`Dt' volume too long"); |
|
| return(0); |
if ('.' == name[0] && 2 == len) { |
| |
val = roff_getregro(r, name + 1); |
| |
if (-1 != val) |
| |
return val; |
| } |
} |
| |
|
| assert(NULL == tree->last); |
for (reg = r->regtab; reg; reg = reg->next) |
| tree->state |= ROFF_PRELUDE_Dt; |
if (len == reg->key.sz && |
| |
0 == strncmp(name, reg->key.p, len)) |
| |
return reg->val; |
| |
|
| return(1); |
return 0; |
| } |
} |
| |
|
| |
|
| static int |
static int |
| roffsetname(struct rofftree *tree, char **ordp) |
roff_hasregn(const struct roff *r, const char *name, size_t len) |
| { |
{ |
| |
struct roffreg *reg; |
| assert(*ordp); |
int val; |
| |
|
| /* FIXME: not all sections can set this. */ |
if ('.' == name[0] && 2 == len) { |
| |
val = roff_getregro(r, name + 1); |
| if (NULL != *(ordp + 1)) { |
if (-1 != val) |
| roff_err(tree, *ordp, "too many `Nm' args"); |
return 1; |
| 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); |
for (reg = r->regtab; reg; reg = reg->next) |
| |
if (len == reg->key.sz && |
| |
0 == strncmp(name, reg->key.p, len)) |
| |
return 1; |
| |
|
| |
return 0; |
| } |
} |
| |
|
| |
static void |
| /* ARGSUSED */ |
roff_freereg(struct roffreg *reg) |
| static int |
|
| roff_Ns(ROFFCALL_ARGS) |
|
| { |
{ |
| int j, c, first; |
struct roffreg *old_reg; |
| char *morep[1]; |
|
| |
|
| first = (*argv++ == tree->cur); |
while (NULL != reg) { |
| morep[0] = NULL; |
free(reg->key.p); |
| |
old_reg = reg; |
| |
reg = reg->next; |
| |
free(old_reg); |
| |
} |
| |
} |
| |
|
| if ( ! roffspecial(tree, tok, *argv, NULL, NULL, 0, morep)) |
static enum rofferr |
| return(0); |
roff_nr(ROFF_ARGS) |
| |
{ |
| |
char *key, *val; |
| |
size_t keysz; |
| |
int iv; |
| |
char sign; |
| |
|
| while (*argv) { |
key = val = buf->buf + pos; |
| if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
if (*key == '\0') |
| if ( ! roffcall(tree, c, argv)) |
return ROFF_IGN; |
| return(0); |
|
| break; |
|
| } |
|
| |
|
| if ( ! roffispunct(*argv)) { |
keysz = roff_getname(r, &val, ln, pos); |
| if ( ! roffdata(tree, 1, *argv++)) |
if (key[keysz] == '\\') |
| return(0); |
return ROFF_IGN; |
| continue; |
key[keysz] = '\0'; |
| } |
|
| |
|
| for (j = 0; argv[j]; j++) |
sign = *val; |
| if ( ! roffispunct(argv[j])) |
if (sign == '+' || sign == '-') |
| break; |
val++; |
| |
|
| if (argv[j]) { |
if (roff_evalnum(r, ln, val, NULL, &iv, ROFFNUM_SCALE)) |
| if ( ! roffdata(tree, 0, *argv++)) |
roff_setreg(r, key, iv, sign); |
| return(0); |
|
| continue; |
|
| } |
|
| |
|
| break; |
return ROFF_IGN; |
| } |
} |
| |
|
| if ( ! first) |
static enum rofferr |
| return(1); |
roff_rr(ROFF_ARGS) |
| |
{ |
| |
struct roffreg *reg, **prev; |
| |
char *name, *cp; |
| |
size_t namesz; |
| |
|
| return(roffpurgepunct(tree, argv)); |
name = cp = buf->buf + pos; |
| |
if (*name == '\0') |
| |
return ROFF_IGN; |
| |
namesz = roff_getname(r, &cp, ln, pos); |
| |
name[namesz] = '\0'; |
| |
|
| |
prev = &r->regtab; |
| |
while (1) { |
| |
reg = *prev; |
| |
if (reg == NULL || !strcmp(name, reg->key.p)) |
| |
break; |
| |
prev = ®->next; |
| |
} |
| |
if (reg != NULL) { |
| |
*prev = reg->next; |
| |
free(reg->key.p); |
| |
free(reg); |
| |
} |
| |
return ROFF_IGN; |
| } |
} |
| |
|
| |
/* --- handler functions for roff requests -------------------------------- */ |
| |
|
| /* ARGSUSED */ |
static enum rofferr |
| static int |
roff_rm(ROFF_ARGS) |
| roff_Os(ROFFCALL_ARGS) |
|
| { |
{ |
| char *p; |
const char *name; |
| |
char *cp; |
| |
size_t namesz; |
| |
|
| if (ROFF_BODY & tree->state) { |
cp = buf->buf + pos; |
| assert( ! (ROFF_PRELUDE & tree->state)); |
while (*cp != '\0') { |
| assert(ROFF_PRELUDE_Os & tree->state); |
name = cp; |
| return(roff_text(tok, tree, argv, type)); |
namesz = roff_getname(r, &cp, ln, (int)(cp - buf->buf)); |
| |
roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0); |
| |
if (name[namesz] == '\\') |
| |
break; |
| } |
} |
| |
return ROFF_IGN; |
| |
} |
| |
|
| assert(ROFF_PRELUDE & tree->state); |
static enum rofferr |
| if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
roff_it(ROFF_ARGS) |
| ! (ROFF_PRELUDE_Dd & tree->state)) { |
{ |
| roff_err(tree, *argv, "out-of-order `Os' in prelude"); |
int iv; |
| return(0); |
|
| |
/* Parse the number of lines. */ |
| |
|
| |
if ( ! roff_evalnum(r, ln, buf->buf, &pos, &iv, 0)) { |
| |
mandoc_msg(MANDOCERR_IT_NONUM, r->parse, |
| |
ln, ppos, buf->buf + 1); |
| |
return ROFF_IGN; |
| } |
} |
| |
|
| tree->os[0] = 0; |
while (isspace((unsigned char)buf->buf[pos])) |
| |
pos++; |
| |
|
| p = *++argv; |
/* |
| |
* Arm the input line trap. |
| |
* Special-casing "an-trap" is an ugly workaround to cope |
| |
* with DocBook stupidly fiddling with man(7) internals. |
| |
*/ |
| |
|
| while (*argv) { |
roffit_lines = iv; |
| if (strlcat(tree->os, *argv++, sizeof(tree->os)) |
roffit_macro = mandoc_strdup(iv != 1 || |
| < sizeof(tree->os)) |
strcmp(buf->buf + pos, "an-trap") ? |
| continue; |
buf->buf + pos : "br"); |
| roff_err(tree, p, "`Os' value too long"); |
return ROFF_IGN; |
| return(0); |
} |
| } |
|
| |
|
| if (0 == tree->os[0]) |
static enum rofferr |
| if (strlcpy(tree->os, "LOCAL", sizeof(tree->os)) |
roff_Dd(ROFF_ARGS) |
| >= sizeof(tree->os)) { |
{ |
| roff_err(tree, p, "`Os' value too long"); |
const char *const *cp; |
| return(0); |
|
| } |
|
| |
|
| tree->state |= ROFF_PRELUDE_Os; |
if ((r->options & (MPARSE_MDOC | MPARSE_QUICK)) == 0) |
| tree->state &= ~ROFF_PRELUDE; |
for (cp = __mdoc_reserved; *cp; cp++) |
| tree->state |= ROFF_BODY; |
roff_setstr(r, *cp, NULL, 0); |
| |
|
| assert(NULL == tree->last); |
if (r->format == 0) |
| |
r->format = MPARSE_MDOC; |
| |
|
| return((*tree->cb.roffhead)(tree->arg, &tree->tm, |
return ROFF_CONT; |
| tree->os, tree->title, tree->section, |
|
| tree->volume)); |
|
| } |
} |
| |
|
| |
static enum rofferr |
| /* ARGSUSED */ |
roff_TH(ROFF_ARGS) |
| static int |
|
| roff_layout(ROFFCALL_ARGS) |
|
| { |
{ |
| int i, c, argcp[ROFF_MAXLINEARG]; |
const char *const *cp; |
| char *argvp[ROFF_MAXLINEARG]; |
|
| |
|
| if (ROFF_PRELUDE & tree->state) { |
if ((r->options & MPARSE_QUICK) == 0) |
| roff_err(tree, *argv, "bad `%s' in prelude", |
for (cp = __man_reserved; *cp; cp++) |
| toknames[tok]); |
roff_setstr(r, *cp, NULL, 0); |
| 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)); |
if (r->format == 0) |
| |
r->format = MPARSE_MAN; |
| |
|
| ++argv; |
return ROFF_CONT; |
| |
} |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
static enum rofferr |
| return(0); |
roff_TE(ROFF_ARGS) |
| if (NULL == roffnode_new(tok, tree)) |
{ |
| return(0); |
|
| |
|
| /* |
if (NULL == r->tbl) |
| * Layouts have two parts: the layout body and header. The |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| * layout header is the trailing text of the line macro, while |
ln, ppos, "TE"); |
| * the layout body is everything following until termination. |
else if ( ! tbl_end(&r->tbl)) { |
| */ |
free(buf->buf); |
| |
buf->buf = mandoc_strdup(".sp"); |
| |
buf->sz = 4; |
| |
return ROFF_REPARSE; |
| |
} |
| |
return ROFF_IGN; |
| |
} |
| |
|
| if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp)) |
static enum rofferr |
| return(0); |
roff_T_(ROFF_ARGS) |
| if (NULL == *argv) |
{ |
| return((*tree->cb.roffblkbodyin) |
|
| (tree->arg, tok, argcp, argvp)); |
|
| |
|
| if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, argvp)) |
if (NULL == r->tbl) |
| return(0); |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, |
| |
ln, ppos, "T&"); |
| |
else |
| |
tbl_restart(ppos, ln, r->tbl); |
| |
|
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
/* |
| |
* Handle in-line equation delimiters. |
| |
*/ |
| |
static enum rofferr |
| |
roff_eqndelim(struct roff *r, struct buf *buf, int pos) |
| |
{ |
| |
char *cp1, *cp2; |
| |
const char *bef_pr, *bef_nl, *mac, *aft_nl, *aft_pr; |
| |
|
| /* |
/* |
| * If there are no parsable parts, then write remaining tokens |
* Outside equations, look for an opening delimiter. |
| * into the layout header and exit. |
* If we are inside an equation, we already know it is |
| |
* in-line, or this function wouldn't have been called; |
| |
* so look for a closing delimiter. |
| */ |
*/ |
| |
|
| if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
cp1 = buf->buf + pos; |
| i = 0; |
cp2 = strchr(cp1, r->eqn == NULL ? |
| while (*argv) |
r->last_eqn->odelim : r->last_eqn->cdelim); |
| if ( ! roffdata(tree, i++, *argv++)) |
if (cp2 == NULL) |
| return(0); |
return ROFF_CONT; |
| |
|
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
*cp2++ = '\0'; |
| return(0); |
bef_pr = bef_nl = aft_nl = aft_pr = ""; |
| return((*tree->cb.roffblkbodyin) |
|
| (tree->arg, tok, argcp, argvp)); |
/* Handle preceding text, protecting whitespace. */ |
| |
|
| |
if (*buf->buf != '\0') { |
| |
if (r->eqn == NULL) |
| |
bef_pr = "\\&"; |
| |
bef_nl = "\n"; |
| } |
} |
| |
|
| /* |
/* |
| * Parsable elements may be in the header (or be the header, for |
* Prepare replacing the delimiter with an equation macro |
| * that matter). Follow the regular parsing rules for these. |
* and drop leading white space from the equation. |
| */ |
*/ |
| |
|
| i = 0; |
if (r->eqn == NULL) { |
| while (*argv) { |
while (*cp2 == ' ') |
| if (ROFF_MAX == (c = rofffindcallable(*argv))) { |
cp2++; |
| assert(tree->arg); |
mac = ".EQ"; |
| if ( ! roffdata(tree, i++, *argv++)) |
} else |
| return(0); |
mac = ".EN"; |
| continue; |
|
| } |
|
| if ( ! roffcall(tree, c, argv)) |
|
| return(0); |
|
| break; |
|
| } |
|
| |
|
| /* |
/* Handle following text, protecting whitespace. */ |
| * If there's trailing punctuation in the header, then write it |
|
| * out now. Here we mimic the behaviour of a line-dominant text |
|
| * macro. |
|
| */ |
|
| |
|
| if (NULL == *argv) { |
if (*cp2 != '\0') { |
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
aft_nl = "\n"; |
| return(0); |
if (r->eqn != NULL) |
| return((*tree->cb.roffblkbodyin) |
aft_pr = "\\&"; |
| (tree->arg, tok, argcp, argvp)); |
|
| } |
} |
| |
|
| /* |
/* Do the actual replacement. */ |
| * Expensive. Scan to the end of line then work backwards until |
|
| * a token isn't punctuation. |
|
| */ |
|
| |
|
| if ( ! roffpurgepunct(tree, argv)) |
buf->sz = mandoc_asprintf(&cp1, "%s%s%s%s%s%s%s", buf->buf, |
| return(0); |
bef_pr, bef_nl, mac, aft_nl, aft_pr, cp2) + 1; |
| |
free(buf->buf); |
| |
buf->buf = cp1; |
| |
|
| if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok)) |
/* Toggle the in-line state of the eqn subsystem. */ |
| return(0); |
|
| return((*tree->cb.roffblkbodyin) |
r->eqn_inline = r->eqn == NULL; |
| (tree->arg, tok, argcp, argvp)); |
return ROFF_REPARSE; |
| } |
} |
| |
|
| |
static enum rofferr |
| /* ARGSUSED */ |
roff_EQ(ROFF_ARGS) |
| static int |
|
| roff_ordered(ROFFCALL_ARGS) |
|
| { |
{ |
| int i, first, c, argcp[ROFF_MAXLINEARG]; |
struct eqn_node *e; |
| char *ordp[ROFF_MAXLINEARG], *p, |
|
| *argvp[ROFF_MAXLINEARG]; |
|
| |
|
| if (ROFF_PRELUDE & tree->state) { |
assert(r->eqn == NULL); |
| roff_err(tree, *argv, "`%s' disallowed in prelude", |
e = eqn_alloc(ppos, ln, r->parse); |
| toknames[tok]); |
|
| return(0); |
|
| } |
|
| |
|
| first = (*argv == tree->cur); |
if (r->last_eqn) { |
| p = *argv++; |
r->last_eqn->next = e; |
| |
e->delim = r->last_eqn->delim; |
| |
e->odelim = r->last_eqn->odelim; |
| |
e->cdelim = r->last_eqn->cdelim; |
| |
} else |
| |
r->first_eqn = r->last_eqn = e; |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
r->eqn = r->last_eqn = e; |
| return(0); |
|
| |
|
| if (NULL == *argv) { |
if (buf->buf[pos] != '\0') |
| ordp[0] = NULL; |
mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos, |
| return(roffspecial(tree, tok, p, argcp, |
".EQ %s", buf->buf + pos); |
| (const char **)argvp, 0, ordp)); |
|
| } |
|
| |
|
| i = 0; |
return ROFF_IGN; |
| while (*argv && i < ROFF_MAXLINEARG) { |
} |
| c = ROFF_PARSED & tokens[tok].flags ? |
|
| rofffindcallable(*argv) : ROFF_MAX; |
|
| |
|
| if (ROFF_MAX == c && ! roffispunct(*argv)) { |
static enum rofferr |
| ordp[i++] = *argv++; |
roff_EN(ROFF_ARGS) |
| continue; |
{ |
| } |
|
| ordp[i] = NULL; |
|
| |
|
| if (ROFF_MAX == c) |
mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, ln, ppos, "EN"); |
| break; |
return ROFF_IGN; |
| |
} |
| |
|
| if ( ! roffspecial(tree, tok, p, argcp, |
static enum rofferr |
| (const char **)argvp, |
roff_TS(ROFF_ARGS) |
| (size_t)i, ordp)) |
{ |
| return(0); |
struct tbl_node *tbl; |
| |
|
| return(roffcall(tree, c, argv)); |
if (r->tbl) { |
| |
mandoc_msg(MANDOCERR_BLK_BROKEN, r->parse, |
| |
ln, ppos, "TS breaks TS"); |
| |
tbl_end(&r->tbl); |
| } |
} |
| |
|
| assert(i != ROFF_MAXLINEARG); |
tbl = tbl_alloc(ppos, ln, r->parse); |
| ordp[i] = NULL; |
|
| |
|
| if ( ! roffspecial(tree, tok, p, argcp, |
if (r->last_tbl) |
| (const char**)argvp, |
r->last_tbl->next = tbl; |
| (size_t)i, ordp)) |
else |
| return(0); |
r->first_tbl = r->last_tbl = tbl; |
| |
|
| /* FIXME: error if there's stuff after the punctuation. */ |
r->tbl = r->last_tbl = tbl; |
| |
return ROFF_IGN; |
| |
} |
| |
|
| if ( ! first || NULL == *argv) |
static enum rofferr |
| return(1); |
roff_brp(ROFF_ARGS) |
| |
{ |
| |
|
| return(roffpurgepunct(tree, argv)); |
buf->buf[pos - 1] = '\0'; |
| |
return ROFF_CONT; |
| } |
} |
| |
|
| |
static enum rofferr |
| |
roff_cc(ROFF_ARGS) |
| |
{ |
| |
const char *p; |
| |
|
| /* ARGSUSED */ |
p = buf->buf + pos; |
| static int |
|
| roff_text(ROFFCALL_ARGS) |
if (*p == '\0' || (r->control = *p++) == '.') |
| |
r->control = 0; |
| |
|
| |
if (*p != '\0') |
| |
mandoc_vmsg(MANDOCERR_ARG_EXCESS, r->parse, |
| |
ln, p - buf->buf, "cc ... %s", p); |
| |
|
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_tr(ROFF_ARGS) |
| { |
{ |
| int i, j, first, c, argcp[ROFF_MAXLINEARG]; |
const char *p, *first, *second; |
| char *argvp[ROFF_MAXLINEARG]; |
size_t fsz, ssz; |
| |
enum mandoc_esc esc; |
| |
|
| if (ROFF_PRELUDE & tree->state) { |
p = buf->buf + pos; |
| roff_err(tree, *argv, "`%s' disallowed in prelude", |
|
| toknames[tok]); |
if (*p == '\0') { |
| return(0); |
mandoc_msg(MANDOCERR_REQ_EMPTY, r->parse, ln, ppos, "tr"); |
| |
return ROFF_IGN; |
| } |
} |
| |
|
| first = (*argv == tree->cur); |
while (*p != '\0') { |
| argv++; |
fsz = ssz = 1; |
| |
|
| if ( ! roffparseopts(tree, tok, &argv, argcp, argvp)) |
first = p++; |
| return(0); |
if (*first == '\\') { |
| if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp)) |
esc = mandoc_escape(&p, NULL, NULL); |
| return(0); |
if (esc == ESCAPE_ERROR) { |
| if (NULL == *argv) |
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
| return((*tree->cb.roffout)(tree->arg, tok)); |
ln, (int)(p - buf->buf), first); |
| |
return ROFF_IGN; |
| |
} |
| |
fsz = (size_t)(p - first); |
| |
} |
| |
|
| if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
second = p++; |
| i = 0; |
if (*second == '\\') { |
| while (*argv) |
esc = mandoc_escape(&p, NULL, NULL); |
| if ( ! roffdata(tree, i++, *argv++)) |
if (esc == ESCAPE_ERROR) { |
| return(0); |
mandoc_msg(MANDOCERR_ESC_BAD, r->parse, |
| |
ln, (int)(p - buf->buf), second); |
| |
return ROFF_IGN; |
| |
} |
| |
ssz = (size_t)(p - second); |
| |
} else if (*second == '\0') { |
| |
mandoc_vmsg(MANDOCERR_TR_ODD, r->parse, |
| |
ln, first - buf->buf, "tr %s", first); |
| |
second = " "; |
| |
p--; |
| |
} |
| |
|
| return((*tree->cb.roffout)(tree->arg, tok)); |
if (fsz > 1) { |
| |
roff_setstrn(&r->xmbtab, first, fsz, |
| |
second, ssz, 0); |
| |
continue; |
| |
} |
| |
|
| |
if (r->xtab == NULL) |
| |
r->xtab = mandoc_calloc(128, |
| |
sizeof(struct roffstr)); |
| |
|
| |
free(r->xtab[(int)*first].p); |
| |
r->xtab[(int)*first].p = mandoc_strndup(second, ssz); |
| |
r->xtab[(int)*first].sz = ssz; |
| } |
} |
| |
|
| |
return ROFF_IGN; |
| |
} |
| |
|
| |
static enum rofferr |
| |
roff_so(ROFF_ARGS) |
| |
{ |
| |
char *name, *cp; |
| |
|
| |
name = buf->buf + pos; |
| |
mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, "so %s", name); |
| |
|
| /* |
/* |
| * Deal with punctuation. Ugly. Work ahead until we encounter |
* Handle `so'. Be EXTREMELY careful, as we shouldn't be |
| * terminating punctuation. If we encounter it and all |
* opening anything that's not in our cwd or anything beneath |
| * subsequent tokens are punctuation, then stop processing (the |
* it. Thus, explicitly disallow traversing up the file-system |
| * line-dominant macro will print these tokens after closure). |
* or using absolute paths. |
| * If the punctuation is followed by non-punctuation, then close |
|
| * and re-open our scope, then continue. |
|
| */ |
*/ |
| |
|
| i = 0; |
if (*name == '/' || strstr(name, "../") || strstr(name, "/..")) { |
| while (*argv) { |
mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos, |
| if (ROFF_MAX != (c = rofffindcallable(*argv))) { |
".so %s", name); |
| if ( ! (ROFF_LSCOPE & tokens[tok].flags)) |
buf->sz = mandoc_asprintf(&cp, |
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
".sp\nSee the file %s.\n.sp", name) + 1; |
| return(0); |
free(buf->buf); |
| |
buf->buf = cp; |
| if ( ! roffcall(tree, c, argv)) |
*offs = 0; |
| return(0); |
return ROFF_REPARSE; |
| |
} |
| if (ROFF_LSCOPE & tokens[tok].flags) |
|
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
*offs = pos; |
| return(0); |
return ROFF_SO; |
| |
} |
| break; |
|
| |
/* --- user defined strings and macros ------------------------------------ */ |
| |
|
| |
static enum rofferr |
| |
roff_userdef(ROFF_ARGS) |
| |
{ |
| |
const char *arg[9], *ap; |
| |
char *cp, *n1, *n2; |
| |
int i, ib, ie; |
| |
size_t asz, rsz; |
| |
|
| |
/* |
| |
* Collect pointers to macro argument strings |
| |
* and NUL-terminate them. |
| |
*/ |
| |
|
| |
r->argc = 0; |
| |
cp = buf->buf + pos; |
| |
for (i = 0; i < 9; i++) { |
| |
if (*cp == '\0') |
| |
arg[i] = ""; |
| |
else { |
| |
arg[i] = mandoc_getarg(r->parse, &cp, ln, &pos); |
| |
r->argc = i + 1; |
| } |
} |
| |
} |
| |
|
| if ( ! roffispunct(*argv)) { |
/* |
| if ( ! roffdata(tree, i++, *argv++)) |
* Expand macro arguments. |
| return(0); |
*/ |
| |
|
| |
buf->sz = strlen(r->current_string) + 1; |
| |
n1 = cp = mandoc_malloc(buf->sz); |
| |
memcpy(n1, r->current_string, buf->sz); |
| |
while (*cp != '\0') { |
| |
|
| |
/* Scan ahead for the next argument invocation. */ |
| |
|
| |
if (*cp++ != '\\') |
| continue; |
continue; |
| |
if (*cp++ != '$') |
| |
continue; |
| |
if (*cp == '*') { /* \\$* inserts all arguments */ |
| |
ib = 0; |
| |
ie = r->argc - 1; |
| |
} else { /* \\$1 .. \\$9 insert one argument */ |
| |
ib = ie = *cp - '1'; |
| |
if (ib < 0 || ib > 8) |
| |
continue; |
| } |
} |
| |
cp -= 2; |
| |
|
| i = 1; |
/* |
| for (j = 0; argv[j]; j++) |
* Determine the size of the expanded argument, |
| if ( ! roffispunct(argv[j])) |
* taking escaping of quotes into account. |
| break; |
*/ |
| |
|
| if (argv[j]) { |
asz = ie > ib ? ie - ib : 0; /* for blanks */ |
| if (ROFF_LSCOPE & tokens[tok].flags) { |
for (i = ib; i <= ie; i++) { |
| if ( ! roffdata(tree, 0, *argv++)) |
for (ap = arg[i]; *ap != '\0'; ap++) { |
| return(0); |
asz++; |
| continue; |
if (*ap == '"') |
| |
asz += 3; |
| } |
} |
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
} |
| return(0); |
if (asz != 3) { |
| if ( ! roffdata(tree, 0, *argv++)) |
|
| return(0); |
|
| if ( ! (*tree->cb.roffin)(tree->arg, tok, |
|
| argcp, argvp)) |
|
| return(0); |
|
| |
|
| i = 0; |
/* |
| continue; |
* Determine the size of the rest of the |
| |
* unexpanded macro, including the NUL. |
| |
*/ |
| |
|
| |
rsz = buf->sz - (cp - n1) - 3; |
| |
|
| |
/* |
| |
* When shrinking, move before |
| |
* releasing the storage. |
| |
*/ |
| |
|
| |
if (asz < 3) |
| |
memmove(cp + asz, cp + 3, rsz); |
| |
|
| |
/* |
| |
* Resize the storage for the macro |
| |
* and readjust the parse pointer. |
| |
*/ |
| |
|
| |
buf->sz += asz - 3; |
| |
n2 = mandoc_realloc(n1, buf->sz); |
| |
cp = n2 + (cp - n1); |
| |
n1 = n2; |
| |
|
| |
/* |
| |
* When growing, make room |
| |
* for the expanded argument. |
| |
*/ |
| |
|
| |
if (asz > 3) |
| |
memmove(cp + asz, cp + 3, rsz); |
| } |
} |
| |
|
| if ( ! (*tree->cb.roffout)(tree->arg, tok)) |
/* Copy the expanded argument, escaping quotes. */ |
| return(0); |
|
| break; |
n2 = cp; |
| |
for (i = ib; i <= ie; i++) { |
| |
for (ap = arg[i]; *ap != '\0'; ap++) { |
| |
if (*ap == '"') { |
| |
memcpy(n2, "\\(dq", 4); |
| |
n2 += 4; |
| |
} else |
| |
*n2++ = *ap; |
| |
} |
| |
if (i < ie) |
| |
*n2++ = ' '; |
| |
} |
| } |
} |
| |
|
| if (NULL == *argv) |
/* |
| return((*tree->cb.roffout)(tree->arg, tok)); |
* Replace the macro invocation |
| if ( ! first) |
* by the expanded macro. |
| return(1); |
*/ |
| |
|
| return(roffpurgepunct(tree, argv)); |
free(buf->buf); |
| |
buf->buf = n1; |
| |
*offs = 0; |
| |
|
| |
return buf->sz > 1 && buf->buf[buf->sz - 2] == '\n' ? |
| |
ROFF_REPARSE : ROFF_APPEND; |
| } |
} |
| |
|
| |
static size_t |
| /* ARGSUSED */ |
roff_getname(struct roff *r, char **cpp, int ln, int pos) |
| static int |
|
| roff_noop(ROFFCALL_ARGS) |
|
| { |
{ |
| |
char *name, *cp; |
| |
size_t namesz; |
| |
|
| return(1); |
name = *cpp; |
| |
if ('\0' == *name) |
| |
return 0; |
| |
|
| |
/* Read until end of name and terminate it with NUL. */ |
| |
for (cp = name; 1; cp++) { |
| |
if ('\0' == *cp || ' ' == *cp) { |
| |
namesz = cp - name; |
| |
break; |
| |
} |
| |
if ('\\' != *cp) |
| |
continue; |
| |
namesz = cp - name; |
| |
if ('{' == cp[1] || '}' == cp[1]) |
| |
break; |
| |
cp++; |
| |
if ('\\' == *cp) |
| |
continue; |
| |
mandoc_vmsg(MANDOCERR_NAMESC, r->parse, ln, pos, |
| |
"%.*s", (int)(cp - name + 1), name); |
| |
mandoc_escape((const char **)&cp, NULL, NULL); |
| |
break; |
| |
} |
| |
|
| |
/* Read past spaces. */ |
| |
while (' ' == *cp) |
| |
cp++; |
| |
|
| |
*cpp = cp; |
| |
return namesz; |
| } |
} |
| |
|
| |
/* |
| |
* Store *string into the user-defined string called *name. |
| |
* To clear an existing entry, call with (*r, *name, NULL, 0). |
| |
* append == 0: replace mode |
| |
* append == 1: single-line append mode |
| |
* append == 2: multiline append mode, append '\n' after each call |
| |
*/ |
| |
static void |
| |
roff_setstr(struct roff *r, const char *name, const char *string, |
| |
int append) |
| |
{ |
| |
|
| /* ARGSUSED */ |
roff_setstrn(&r->strtab, name, strlen(name), string, |
| static int |
string ? strlen(string) : 0, append); |
| roff_depr(ROFFCALL_ARGS) |
} |
| |
|
| |
static void |
| |
roff_setstrn(struct roffkv **r, const char *name, size_t namesz, |
| |
const char *string, size_t stringsz, int append) |
| { |
{ |
| |
struct roffkv *n; |
| |
char *c; |
| |
int i; |
| |
size_t oldch, newch; |
| |
|
| roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]); |
/* Search for an existing string with the same name. */ |
| return(0); |
n = *r; |
| |
|
| |
while (n && (namesz != n->key.sz || |
| |
strncmp(n->key.p, name, namesz))) |
| |
n = n->next; |
| |
|
| |
if (NULL == n) { |
| |
/* Create a new string table entry. */ |
| |
n = mandoc_malloc(sizeof(struct roffkv)); |
| |
n->key.p = mandoc_strndup(name, namesz); |
| |
n->key.sz = namesz; |
| |
n->val.p = NULL; |
| |
n->val.sz = 0; |
| |
n->next = *r; |
| |
*r = n; |
| |
} else if (0 == append) { |
| |
free(n->val.p); |
| |
n->val.p = NULL; |
| |
n->val.sz = 0; |
| |
} |
| |
|
| |
if (NULL == string) |
| |
return; |
| |
|
| |
/* |
| |
* One additional byte for the '\n' in multiline mode, |
| |
* and one for the terminating '\0'. |
| |
*/ |
| |
newch = stringsz + (1 < append ? 2u : 1u); |
| |
|
| |
if (NULL == n->val.p) { |
| |
n->val.p = mandoc_malloc(newch); |
| |
*n->val.p = '\0'; |
| |
oldch = 0; |
| |
} else { |
| |
oldch = n->val.sz; |
| |
n->val.p = mandoc_realloc(n->val.p, oldch + newch); |
| |
} |
| |
|
| |
/* Skip existing content in the destination buffer. */ |
| |
c = n->val.p + (int)oldch; |
| |
|
| |
/* Append new content to the destination buffer. */ |
| |
i = 0; |
| |
while (i < (int)stringsz) { |
| |
/* |
| |
* Rudimentary roff copy mode: |
| |
* Handle escaped backslashes. |
| |
*/ |
| |
if ('\\' == string[i] && '\\' == string[i + 1]) |
| |
i++; |
| |
*c++ = string[i++]; |
| |
} |
| |
|
| |
/* Append terminating bytes. */ |
| |
if (1 < append) |
| |
*c++ = '\n'; |
| |
|
| |
*c = '\0'; |
| |
n->val.sz = (int)(c - n->val.p); |
| } |
} |
| |
|
| |
static const char * |
| |
roff_getstrn(const struct roff *r, const char *name, size_t len) |
| |
{ |
| |
const struct roffkv *n; |
| |
int i; |
| |
|
| |
for (n = r->strtab; n; n = n->next) |
| |
if (0 == strncmp(name, n->key.p, len) && |
| |
'\0' == n->key.p[(int)len]) |
| |
return n->val.p; |
| |
|
| |
for (i = 0; i < PREDEFS_MAX; i++) |
| |
if (0 == strncmp(name, predefs[i].name, len) && |
| |
'\0' == predefs[i].name[(int)len]) |
| |
return predefs[i].str; |
| |
|
| |
return NULL; |
| |
} |
| |
|
| static void |
static void |
| roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...) |
roff_freestr(struct roffkv *r) |
| { |
{ |
| va_list ap; |
struct roffkv *n, *nn; |
| char buf[128]; |
|
| |
|
| va_start(ap, fmt); |
for (n = r; n; n = nn) { |
| (void)vsnprintf(buf, sizeof(buf), fmt, ap); |
free(n->key.p); |
| va_end(ap); |
free(n->val.p); |
| |
nn = n->next; |
| |
free(n); |
| |
} |
| |
} |
| |
|
| (*tree->cb.roffmsg)(tree->arg, |
/* --- accessors and utility functions ------------------------------------ */ |
| ROFF_WARN, tree->cur, pos, buf); |
|
| |
const struct tbl_span * |
| |
roff_span(const struct roff *r) |
| |
{ |
| |
|
| |
return r->tbl ? tbl_span(r->tbl) : NULL; |
| } |
} |
| |
|
| |
const struct eqn * |
| |
roff_eqn(const struct roff *r) |
| |
{ |
| |
|
| static void |
return r->last_eqn ? &r->last_eqn->eqn : NULL; |
| roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...) |
} |
| |
|
| |
/* |
| |
* Duplicate an input string, making the appropriate character |
| |
* conversations (as stipulated by `tr') along the way. |
| |
* Returns a heap-allocated string with all the replacements made. |
| |
*/ |
| |
char * |
| |
roff_strdup(const struct roff *r, const char *p) |
| { |
{ |
| va_list ap; |
const struct roffkv *cp; |
| char buf[128]; |
char *res; |
| |
const char *pp; |
| |
size_t ssz, sz; |
| |
enum mandoc_esc esc; |
| |
|
| va_start(ap, fmt); |
if (NULL == r->xmbtab && NULL == r->xtab) |
| (void)vsnprintf(buf, sizeof(buf), fmt, ap); |
return mandoc_strdup(p); |
| va_end(ap); |
else if ('\0' == *p) |
| |
return mandoc_strdup(""); |
| |
|
| (*tree->cb.roffmsg)(tree->arg, |
/* |
| ROFF_ERROR, tree->cur, pos, buf); |
* Step through each character looking for term matches |
| |
* (remember that a `tr' can be invoked with an escape, which is |
| |
* a glyph but the escape is multi-character). |
| |
* We only do this if the character hash has been initialised |
| |
* and the string is >0 length. |
| |
*/ |
| |
|
| |
res = NULL; |
| |
ssz = 0; |
| |
|
| |
while ('\0' != *p) { |
| |
if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) { |
| |
sz = r->xtab[(int)*p].sz; |
| |
res = mandoc_realloc(res, ssz + sz + 1); |
| |
memcpy(res + ssz, r->xtab[(int)*p].p, sz); |
| |
ssz += sz; |
| |
p++; |
| |
continue; |
| |
} else if ('\\' != *p) { |
| |
res = mandoc_realloc(res, ssz + 2); |
| |
res[ssz++] = *p++; |
| |
continue; |
| |
} |
| |
|
| |
/* Search for term matches. */ |
| |
for (cp = r->xmbtab; cp; cp = cp->next) |
| |
if (0 == strncmp(p, cp->key.p, cp->key.sz)) |
| |
break; |
| |
|
| |
if (NULL != cp) { |
| |
/* |
| |
* A match has been found. |
| |
* Append the match to the array and move |
| |
* forward by its keysize. |
| |
*/ |
| |
res = mandoc_realloc(res, |
| |
ssz + cp->val.sz + 1); |
| |
memcpy(res + ssz, cp->val.p, cp->val.sz); |
| |
ssz += cp->val.sz; |
| |
p += (int)cp->key.sz; |
| |
continue; |
| |
} |
| |
|
| |
/* |
| |
* Handle escapes carefully: we need to copy |
| |
* over just the escape itself, or else we might |
| |
* do replacements within the escape itself. |
| |
* Make sure to pass along the bogus string. |
| |
*/ |
| |
pp = p++; |
| |
esc = mandoc_escape(&p, NULL, NULL); |
| |
if (ESCAPE_ERROR == esc) { |
| |
sz = strlen(pp); |
| |
res = mandoc_realloc(res, ssz + sz + 1); |
| |
memcpy(res + ssz, pp, sz); |
| |
break; |
| |
} |
| |
/* |
| |
* We bail out on bad escapes. |
| |
* No need to warn: we already did so when |
| |
* roff_res() was called. |
| |
*/ |
| |
sz = (int)(p - pp); |
| |
res = mandoc_realloc(res, ssz + sz + 1); |
| |
memcpy(res + ssz, pp, sz); |
| |
ssz += sz; |
| |
} |
| |
|
| |
res[(int)ssz] = '\0'; |
| |
return res; |
| } |
} |
| |
|
| |
int |
| |
roff_getformat(const struct roff *r) |
| |
{ |
| |
|
| |
return r->format; |
| |
} |
| |
|
| |
/* |
| |
* Find out whether a line is a macro line or not. |
| |
* If it is, adjust the current position and return one; if it isn't, |
| |
* return zero and don't change the current position. |
| |
* If the control character has been set with `.cc', then let that grain |
| |
* precedence. |
| |
* This is slighly contrary to groff, where using the non-breaking |
| |
* control character when `cc' has been invoked will cause the |
| |
* non-breaking macro contents to be printed verbatim. |
| |
*/ |
| |
int |
| |
roff_getcontrol(const struct roff *r, const char *cp, int *ppos) |
| |
{ |
| |
int pos; |
| |
|
| |
pos = *ppos; |
| |
|
| |
if (0 != r->control && cp[pos] == r->control) |
| |
pos++; |
| |
else if (0 != r->control) |
| |
return 0; |
| |
else if ('\\' == cp[pos] && '.' == cp[pos + 1]) |
| |
pos += 2; |
| |
else if ('.' == cp[pos] || '\'' == cp[pos]) |
| |
pos++; |
| |
else |
| |
return 0; |
| |
|
| |
while (' ' == cp[pos] || '\t' == cp[pos]) |
| |
pos++; |
| |
|
| |
*ppos = pos; |
| |
return 1; |
| |
} |
![[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