version 1.6, 2008/12/28 21:25:09 |
version 1.217, 2014/07/02 03:48:07 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2010, 2012, 2013, 2014 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS 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 AUTHOR 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. |
|
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
|
#include <stdarg.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 "private.h" |
#include "mdoc.h" |
|
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
|
#include "libmdoc.h" |
|
#include "libmandoc.h" |
|
|
const char *const __mdoc_macronames[MDOC_MAX] = { |
const char *const __mdoc_macronames[MDOC_MAX + 1] = { |
"\\\"", "Dd", "Dt", "Os", |
"Ap", "Dd", "Dt", "Os", |
"Sh", "Ss", "Pp", "D1", |
"Sh", "Ss", "Pp", "D1", |
"Dl", "Bd", "Ed", "Bl", |
"Dl", "Bd", "Ed", "Bl", |
"El", "It", "Ad", "An", |
"El", "It", "Ad", "An", |
Line 37 const char *const __mdoc_macronames[MDOC_MAX] = { |
|
Line 46 const char *const __mdoc_macronames[MDOC_MAX] = { |
|
"Ic", "In", "Li", "Nd", |
"Ic", "In", "Li", "Nd", |
"Nm", "Op", "Ot", "Pa", |
"Nm", "Op", "Ot", "Pa", |
"Rv", "St", "Va", "Vt", |
"Rv", "St", "Va", "Vt", |
/* LINTED */ |
"Xr", "%A", "%B", "%D", |
"Xr", "\%A", "\%B", "\%D", |
"%I", "%J", "%N", "%O", |
/* LINTED */ |
"%P", "%R", "%T", "%V", |
"\%I", "\%J", "\%N", "\%O", |
|
/* LINTED */ |
|
"\%P", "\%R", "\%T", "\%V", |
|
"Ac", "Ao", "Aq", "At", |
"Ac", "Ao", "Aq", "At", |
"Bc", "Bf", "Bo", "Bq", |
"Bc", "Bf", "Bo", "Bq", |
"Bsx", "Bx", "Db", "Dc", |
"Bsx", "Bx", "Db", "Dc", |
Line 56 const char *const __mdoc_macronames[MDOC_MAX] = { |
|
Line 62 const char *const __mdoc_macronames[MDOC_MAX] = { |
|
"Tn", "Ux", "Xc", "Xo", |
"Tn", "Ux", "Xc", "Xo", |
"Fo", "Fc", "Oo", "Oc", |
"Fo", "Fc", "Oo", "Oc", |
"Bk", "Ek", "Bt", "Hf", |
"Bk", "Ek", "Bt", "Hf", |
"Fr", "Ud", |
"Fr", "Ud", "Lb", "Lp", |
|
"Lk", "Mt", "Brq", "Bro", |
|
"Brc", "%C", "Es", "En", |
|
"Dx", "%Q", "br", "sp", |
|
"%U", "Ta", "ll", "text", |
}; |
}; |
|
|
const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
"split", "nosplit", "ragged", |
"split", "nosplit", "ragged", |
"unfilled", "literal", "file", |
"unfilled", "literal", "file", |
"offset", "bullet", "dash", |
"offset", "bullet", "dash", |
"hyphen", "item", "enum", |
"hyphen", "item", "enum", |
"tag", "diag", "hang", |
"tag", "diag", "hang", |
"ohang", "inset", "column", |
"ohang", "inset", "column", |
"width", "compact", "std", |
"width", "compact", "std", |
"p1003.1-88", "p1003.1-90", "p1003.1-96", |
"filled", "words", "emphasis", |
"p1003.1-2001", "p1003.1-2004", "p1003.1", |
"symbolic", "nested", "centered" |
"p1003.1b", "p1003.1b-93", "p1003.1c-95", |
|
"p1003.1g-2000", "p1003.2-92", "p1387.2-95", |
|
"p1003.2", "p1387.2", "isoC-90", |
|
"isoC-amd1", "isoC-tcor1", "isoC-tcor2", |
|
"isoC-99", "ansiC", "ansiC-89", |
|
"ansiC-99", "ieee754", "iso8802-3", |
|
"xpg3", "xpg4", "xpg4.2", |
|
"xpg4.3", "xbd5", "xcu5", |
|
"xsh5", "xns5", "xns5.2d2.0", |
|
"xcurses4.2", "susv2", "susv3", |
|
"svid4", "filled", "words", |
|
}; |
}; |
|
|
const struct mdoc_macro __mdoc_macros[MDOC_MAX] = { |
|
{ NULL, 0 }, /* \" */ |
|
{ macro_prologue_ddate, 0 }, /* Dd */ |
|
{ macro_prologue_dtitle, 0 }, /* Dt */ |
|
{ macro_prologue_os, 0 }, /* Os */ |
|
{ macro_scoped_implicit, 0 }, /* Sh */ |
|
{ macro_scoped_implicit, 0 }, /* Ss */ |
|
{ macro_text, 0 }, /* Pp */ |
|
{ macro_scoped_line, 0 }, /* D1 */ |
|
{ macro_scoped_line, 0 }, /* Dl */ |
|
{ macro_scoped_explicit, MDOC_EXPLICIT }, /* Bd */ |
|
{ macro_scoped_explicit, 0 }, /* Ed */ |
|
{ macro_scoped_explicit, MDOC_EXPLICIT }, /* Bl */ |
|
{ macro_scoped_explicit, 0 }, /* El */ |
|
{ NULL, 0 }, /* It */ |
|
{ macro_text, MDOC_CALLABLE }, /* Ad */ |
|
{ NULL, 0 }, /* An */ |
|
{ macro_text, MDOC_CALLABLE }, /* Ar */ |
|
{ NULL, 0 }, /* Cd */ |
|
{ macro_text, MDOC_CALLABLE }, /* Cm */ |
|
{ macro_text, MDOC_CALLABLE }, /* Dv */ |
|
{ macro_text, MDOC_CALLABLE }, /* Er */ |
|
{ macro_text, MDOC_CALLABLE }, /* Ev */ |
|
{ NULL, 0 }, /* Ex */ |
|
{ macro_text, MDOC_CALLABLE }, /* Fa */ |
|
{ NULL, 0 }, /* Fd */ |
|
{ macro_text, MDOC_CALLABLE }, /* Fl */ |
|
{ NULL, 0 }, /* Fn */ |
|
{ macro_text, 0 }, /* Ft */ |
|
{ macro_text, MDOC_CALLABLE }, /* Ic */ |
|
{ NULL, 0 }, /* In */ |
|
{ macro_text, MDOC_CALLABLE }, /* Li */ |
|
{ NULL, 0 }, /* Nd */ |
|
{ NULL, 0 }, /* Nm */ |
|
{ NULL, 0 }, /* Op */ |
|
{ NULL, 0 }, /* Ot */ |
|
{ macro_text, MDOC_CALLABLE }, /* Pa */ |
|
{ NULL, 0 }, /* Rv */ |
|
{ NULL, 0 }, /* St */ |
|
{ macro_text, MDOC_CALLABLE }, /* Va */ |
|
{ macro_text, MDOC_CALLABLE }, /* Vt */ |
|
{ NULL, 0 }, /* Xr */ |
|
{ NULL, 0 }, /* %A */ |
|
{ NULL, 0 }, /* %B */ |
|
{ NULL, 0 }, /* %D */ |
|
{ NULL, 0 }, /* %I */ |
|
{ NULL, 0 }, /* %J */ |
|
{ NULL, 0 }, /* %N */ |
|
{ NULL, 0 }, /* %O */ |
|
{ NULL, 0 }, /* %P */ |
|
{ NULL, 0 }, /* %R */ |
|
{ NULL, 0 }, /* %T */ |
|
{ NULL, 0 }, /* %V */ |
|
{ NULL, 0 }, /* Ac */ |
|
{ NULL, 0 }, /* Ao */ |
|
{ NULL, 0 }, /* Aq */ |
|
{ NULL, 0 }, /* At */ |
|
{ NULL, 0 }, /* Bc */ |
|
{ NULL, 0 }, /* Bf */ |
|
{ NULL, 0 }, /* Bo */ |
|
{ NULL, 0 }, /* Bq */ |
|
{ NULL, 0 }, /* Bsx */ |
|
{ NULL, 0 }, /* Bx */ |
|
{ NULL, 0 }, /* Db */ |
|
{ NULL, 0 }, /* Dc */ |
|
{ NULL, 0 }, /* Do */ |
|
{ NULL, 0 }, /* Dq */ |
|
{ NULL, 0 }, /* Ec */ |
|
{ NULL, 0 }, /* Ef */ |
|
{ macro_text, MDOC_CALLABLE }, /* Em */ |
|
{ NULL, 0 }, /* Eo */ |
|
{ NULL, 0 }, /* Fx */ |
|
{ macro_text, 0 }, /* Ms */ |
|
{ NULL, 0 }, /* No */ |
|
{ NULL, 0 }, /* Ns */ |
|
{ NULL, 0 }, /* Nx */ |
|
{ NULL, 0 }, /* Ox */ |
|
{ NULL, 0 }, /* Pc */ |
|
{ NULL, 0 }, /* Pf */ |
|
{ NULL, 0 }, /* Po */ |
|
{ NULL, 0 }, /* Pq */ |
|
{ NULL, 0 }, /* Qc */ |
|
{ NULL, 0 }, /* Ql */ |
|
{ NULL, 0 }, /* Qo */ |
|
{ macro_scoped_pline, MDOC_CALLABLE }, /* Qq */ |
|
{ NULL, 0 }, /* Re */ |
|
{ NULL, 0 }, /* Rs */ |
|
{ NULL, 0 }, /* Sc */ |
|
{ NULL, 0 }, /* So */ |
|
{ NULL, 0 }, /* Sq */ |
|
{ NULL, 0 }, /* Sm */ |
|
{ NULL, 0 }, /* Sx */ |
|
{ NULL, 0 }, /* Sy */ |
|
{ macro_text, MDOC_CALLABLE }, /* Tn */ |
|
{ NULL, 0 }, /* Ux */ |
|
{ NULL, 0 }, /* Xc */ |
|
{ NULL, 0 }, /* Xo */ |
|
{ NULL, 0 }, /* Fo */ |
|
{ NULL, 0 }, /* Fc */ |
|
{ NULL, 0 }, /* Oo */ |
|
{ NULL, 0 }, /* Oc */ |
|
{ NULL, 0 }, /* Bk */ |
|
{ NULL, 0 }, /* Ek */ |
|
{ NULL, 0 }, /* Bt */ |
|
{ NULL, 0 }, /* Hf */ |
|
{ NULL, 0 }, /* Fr */ |
|
{ NULL, 0 }, /* Ud */ |
|
}; |
|
|
|
const char * const *mdoc_macronames = __mdoc_macronames; |
const char * const *mdoc_macronames = __mdoc_macronames; |
const char * const *mdoc_argnames = __mdoc_argnames; |
const char * const *mdoc_argnames = __mdoc_argnames; |
const struct mdoc_macro * const mdoc_macros = __mdoc_macros; |
|
|
|
|
static void mdoc_node_free(struct mdoc_node *); |
static struct mdoc_arg *argdup(size_t, const struct mdoc_arg *); |
static void mdoc_node_unlink(struct mdoc *, |
static void argfree(size_t, struct mdoc_arg *); |
|
static void argcpy(struct mdoc_arg *, |
|
const struct mdoc_arg *); |
|
static char **paramdup(size_t, const char **); |
|
static void paramfree(size_t, char **); |
|
|
|
static void mdoc_node_freelist(struct mdoc_node *); |
|
static void mdoc_node_append(struct mdoc *, int, |
|
struct mdoc_node *); |
struct mdoc_node *); |
static void mdoc_elem_free(struct mdoc_elem *); |
static void mdoc_free1(struct mdoc *); |
static void mdoc_text_free(struct mdoc_text *); |
static void mdoc_alloc1(struct mdoc *); |
|
static struct mdoc_node *node_alloc(struct mdoc *, int, int, |
|
enum mdoct, enum mdoc_type); |
|
static int node_append(struct mdoc *, |
|
struct mdoc_node *); |
|
#if 0 |
|
static int mdoc_preptext(struct mdoc *, int, char *, int); |
|
#endif |
|
static int mdoc_ptext(struct mdoc *, int, char *, int); |
|
static int mdoc_pmacro(struct mdoc *, int, char *, int); |
|
|
|
|
const struct mdoc_node * |
const struct mdoc_node * |
mdoc_result(struct mdoc *mdoc) |
mdoc_node(const struct mdoc *mdoc) |
{ |
{ |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
return(mdoc->first); |
return(mdoc->first); |
} |
} |
|
|
|
const struct mdoc_meta * |
|
mdoc_meta(const struct mdoc *mdoc) |
|
{ |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
|
return(&mdoc->meta); |
|
} |
|
|
|
/* |
|
* Frees volatile resources (parse tree, meta-data, fields). |
|
*/ |
|
static void |
|
mdoc_free1(struct mdoc *mdoc) |
|
{ |
|
|
|
if (mdoc->first) |
|
mdoc_node_delete(mdoc, mdoc->first); |
|
if (mdoc->meta.title) |
|
free(mdoc->meta.title); |
|
if (mdoc->meta.os) |
|
free(mdoc->meta.os); |
|
if (mdoc->meta.name) |
|
free(mdoc->meta.name); |
|
if (mdoc->meta.arch) |
|
free(mdoc->meta.arch); |
|
if (mdoc->meta.vol) |
|
free(mdoc->meta.vol); |
|
if (mdoc->meta.msec) |
|
free(mdoc->meta.msec); |
|
if (mdoc->meta.date) |
|
free(mdoc->meta.date); |
|
} |
|
|
|
/* |
|
* Allocate all volatile resources (parse tree, meta-data, fields). |
|
*/ |
|
static void |
|
mdoc_alloc1(struct mdoc *mdoc) |
|
{ |
|
|
|
memset(&mdoc->meta, 0, sizeof(struct mdoc_meta)); |
|
mdoc->flags = 0; |
|
mdoc->lastnamed = mdoc->lastsec = SEC_NONE; |
|
mdoc->last = mandoc_calloc(1, sizeof(struct mdoc_node)); |
|
mdoc->first = mdoc->last; |
|
mdoc->last->type = MDOC_ROOT; |
|
mdoc->last->tok = MDOC_MAX; |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
} |
|
|
|
/* |
|
* Free up volatile resources (see mdoc_free1()) then re-initialises the |
|
* data with mdoc_alloc1(). After invocation, parse data has been reset |
|
* and the parser is ready for re-invocation on a new tree; however, |
|
* cross-parse non-volatile data is kept intact. |
|
*/ |
void |
void |
|
mdoc_reset(struct mdoc *mdoc) |
|
{ |
|
|
|
mdoc_free1(mdoc); |
|
mdoc_alloc1(mdoc); |
|
} |
|
|
|
/* |
|
* Completely free up all volatile and non-volatile parse resources. |
|
* After invocation, the pointer is no longer usable. |
|
*/ |
|
void |
mdoc_free(struct mdoc *mdoc) |
mdoc_free(struct mdoc *mdoc) |
{ |
{ |
|
|
if (mdoc->first) |
mdoc_free1(mdoc); |
mdoc_node_freelist(mdoc->first); |
|
if (mdoc->htab) |
|
mdoc_tokhash_free(mdoc->htab); |
|
|
|
free(mdoc); |
free(mdoc); |
} |
} |
|
|
|
/* |
|
* Allocate volatile and non-volatile parse resources. |
|
*/ |
struct mdoc * |
struct mdoc * |
mdoc_alloc(void *data, const struct mdoc_cb *cb) |
mdoc_alloc(struct roff *roff, struct mparse *parse, |
|
char *defos, int quick) |
{ |
{ |
struct mdoc *p; |
struct mdoc *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc)); |
p = mandoc_calloc(1, sizeof(struct mdoc)); |
|
|
p->data = data; |
p->parse = parse; |
(void)memcpy(&p->cb, cb, sizeof(struct mdoc_cb)); |
p->defos = defos; |
|
p->quick = quick; |
|
p->roff = roff; |
|
|
p->htab = mdoc_tokhash_alloc(); |
mdoc_hash_init(); |
|
mdoc_alloc1(p); |
return(p); |
return(p); |
} |
} |
|
|
|
/* |
|
* Climb back up the parse tree, validating open scopes. Mostly calls |
|
* through to macro_end() in macro.c. |
|
*/ |
int |
int |
mdoc_parseln(struct mdoc *mdoc, char *buf) |
mdoc_endparse(struct mdoc *mdoc) |
{ |
{ |
int c, i; |
|
char tmp[5]; |
|
|
|
if ('.' != *buf) { |
assert( ! (MDOC_HALT & mdoc->flags)); |
mdoc_word_alloc(mdoc, 0, buf); |
if (mdoc_macroend(mdoc)) |
return(1); |
return(1); |
} |
mdoc->flags |= MDOC_HALT; |
|
return(0); |
|
} |
|
|
if (buf[1] && '\\' == buf[1]) |
int |
if (buf[2] && '\"' == buf[2]) |
mdoc_addeqn(struct mdoc *mdoc, const struct eqn *ep) |
return(1); |
{ |
|
struct mdoc_node *n; |
|
|
i = 1; |
assert( ! (MDOC_HALT & mdoc->flags)); |
while (buf[i] && ! isspace(buf[i]) && i < (int)sizeof(tmp)) |
|
i++; |
|
|
|
if (i == (int)sizeof(tmp)) |
/* No text before an initial macro. */ |
return(mdoc_err(mdoc, -1, 1, ERR_MACRO_NOTSUP)); |
|
else if (i <= 2) |
|
return(mdoc_err(mdoc, -1, 1, ERR_MACRO_NOTSUP)); |
|
|
|
i--; |
if (SEC_NONE == mdoc->lastnamed) { |
|
mdoc_pmsg(mdoc, ep->ln, ep->pos, MANDOCERR_NOTEXT); |
|
return(1); |
|
} |
|
|
(void)memcpy(tmp, buf + 1, (size_t)i); |
n = node_alloc(mdoc, ep->ln, ep->pos, MDOC_MAX, MDOC_EQN); |
tmp[i++] = 0; |
n->eqn = ep; |
|
|
if (MDOC_MAX == (c = mdoc_find(mdoc, tmp))) |
if ( ! node_append(mdoc, n)) |
return(mdoc_err(mdoc, c, 1, ERR_MACRO_NOTSUP)); |
return(0); |
|
|
while (buf[i] && isspace(buf[i])) |
mdoc->next = MDOC_NEXT_SIBLING; |
i++; |
return(1); |
|
|
return(mdoc_macro(mdoc, c, 1, &i, buf)); |
|
} |
} |
|
|
|
int |
void |
mdoc_addspan(struct mdoc *mdoc, const struct tbl_span *sp) |
mdoc_msg(struct mdoc *mdoc, int pos, const char *fmt, ...) |
|
{ |
{ |
va_list ap; |
struct mdoc_node *n; |
char buf[256]; |
|
|
|
if (NULL == mdoc->cb.mdoc_msg) |
assert( ! (MDOC_HALT & mdoc->flags)); |
return; |
|
|
|
va_start(ap, fmt); |
/* No text before an initial macro. */ |
(void)vsnprintf(buf, sizeof(buf), fmt, ap); |
|
va_end(ap); |
|
|
|
(*mdoc->cb.mdoc_msg)(mdoc->data, pos, buf); |
if (SEC_NONE == mdoc->lastnamed) { |
} |
mdoc_pmsg(mdoc, sp->line, 0, MANDOCERR_NOTEXT); |
|
return(1); |
|
} |
|
|
|
n = node_alloc(mdoc, sp->line, 0, MDOC_MAX, MDOC_TBL); |
|
n->span = sp; |
|
|
int |
if ( ! node_append(mdoc, n)) |
mdoc_err(struct mdoc *mdoc, int tok, int pos, enum mdoc_err type) |
|
{ |
|
|
|
if (NULL == mdoc->cb.mdoc_err) |
|
return(0); |
return(0); |
return((*mdoc->cb.mdoc_err)(mdoc->data, tok, pos, type)); |
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
return(1); |
} |
} |
|
|
|
/* |
|
* Main parse routine. Parses a single line -- really just hands off to |
|
* the macro (mdoc_pmacro()) or text parser (mdoc_ptext()). |
|
*/ |
int |
int |
mdoc_warn(struct mdoc *mdoc, int tok, int pos, enum mdoc_warn type) |
mdoc_parseln(struct mdoc *mdoc, int ln, char *buf, int offs) |
{ |
{ |
|
|
if (NULL == mdoc->cb.mdoc_warn) |
assert( ! (MDOC_HALT & mdoc->flags)); |
return(0); |
|
return((*mdoc->cb.mdoc_warn)(mdoc->data, tok, pos, type)); |
|
} |
|
|
|
|
mdoc->flags |= MDOC_NEWLINE; |
|
|
|
/* |
|
* Let the roff nS register switch SYNOPSIS mode early, |
|
* such that the parser knows at all times |
|
* whether this mode is on or off. |
|
* Note that this mode is also switched by the Sh macro. |
|
*/ |
|
if (roff_getreg(mdoc->roff, "nS")) |
|
mdoc->flags |= MDOC_SYNOPSIS; |
|
else |
|
mdoc->flags &= ~MDOC_SYNOPSIS; |
|
|
|
return(roff_getcontrol(mdoc->roff, buf, &offs) ? |
|
mdoc_pmacro(mdoc, ln, buf, offs) : |
|
mdoc_ptext(mdoc, ln, buf, offs)); |
|
} |
|
|
int |
int |
mdoc_macro(struct mdoc *mdoc, int tok, int ppos, int *pos, char *buf) |
mdoc_macro(MACRO_PROT_ARGS) |
{ |
{ |
|
assert(tok < MDOC_MAX); |
|
|
if (NULL == (mdoc_macros[tok].fp)) { |
/* If we're in the body, deny prologue calls. */ |
(void)mdoc_err(mdoc, tok, ppos, ERR_MACRO_NOTSUP); |
|
return(0); |
|
} |
|
|
|
if (1 != ppos && ! (MDOC_CALLABLE & mdoc_macros[tok].flags)) { |
if (MDOC_PROLOGUE & mdoc_macros[tok].flags && |
(void)mdoc_err(mdoc, tok, ppos, ERR_MACRO_NOTCALL); |
MDOC_PBODY & mdoc->flags) { |
return(0); |
mandoc_vmsg(MANDOCERR_PROLOG_ONLY, mdoc->parse, |
|
line, ppos, "%s", mdoc_macronames[tok]); |
|
return(1); |
} |
} |
|
|
/*mdoc_msg(mdoc, ppos, "calling `%s'", mdoc_macronames[tok]);*/ |
/* If we're in the prologue, deny "body" macros. */ |
|
|
return((*mdoc_macros[tok].fp)(mdoc, tok, ppos, pos, buf)); |
if ( ! (MDOC_PROLOGUE & mdoc_macros[tok].flags) && |
|
! (MDOC_PBODY & mdoc->flags)) { |
|
mandoc_vmsg(MANDOCERR_PROLOG_BAD, mdoc->parse, |
|
line, ppos, "%s", mdoc_macronames[tok]); |
|
if (NULL == mdoc->meta.msec) |
|
mdoc->meta.msec = mandoc_strdup("1"); |
|
if (NULL == mdoc->meta.title) |
|
mdoc->meta.title = mandoc_strdup("UNKNOWN"); |
|
if (NULL == mdoc->meta.vol) |
|
mdoc->meta.vol = mandoc_strdup("LOCAL"); |
|
if (NULL == mdoc->meta.os) |
|
mdoc->meta.os = mandoc_strdup("LOCAL"); |
|
if (NULL == mdoc->meta.date) |
|
mdoc->meta.date = mandoc_normdate |
|
(mdoc->parse, NULL, line, ppos); |
|
mdoc->flags |= MDOC_PBODY; |
|
} |
|
|
|
return((*mdoc_macros[tok].fp)(mdoc, tok, line, ppos, pos, buf)); |
} |
} |
|
|
|
|
static void |
static int |
mdoc_node_append(struct mdoc *mdoc, int pos, struct mdoc_node *p) |
node_append(struct mdoc *mdoc, struct mdoc_node *p) |
{ |
{ |
const char *nn, *on, *nt, *ot, *act; |
|
|
|
switch (p->type) { |
assert(mdoc->last); |
case (MDOC_TEXT): |
assert(mdoc->first); |
nn = p->data.text.string; |
assert(MDOC_ROOT != p->type); |
nt = "text"; |
|
|
switch (mdoc->next) { |
|
case MDOC_NEXT_SIBLING: |
|
mdoc->last->next = p; |
|
p->prev = mdoc->last; |
|
p->parent = mdoc->last->parent; |
break; |
break; |
case (MDOC_BODY): |
case MDOC_NEXT_CHILD: |
nn = mdoc_macronames[p->data.body.tok]; |
mdoc->last->child = p; |
nt = "body"; |
p->parent = mdoc->last; |
break; |
break; |
case (MDOC_ELEM): |
|
nn = mdoc_macronames[p->data.elem.tok]; |
|
nt = "elem"; |
|
break; |
|
case (MDOC_HEAD): |
|
nn = mdoc_macronames[p->data.head.tok]; |
|
nt = "head"; |
|
break; |
|
case (MDOC_BLOCK): |
|
nn = mdoc_macronames[p->data.block.tok]; |
|
nt = "block"; |
|
break; |
|
default: |
default: |
abort(); |
abort(); |
/* NOTREACHED */ |
/* NOTREACHED */ |
} |
} |
|
|
if (NULL == mdoc->first) { |
p->parent->nchild++; |
assert(NULL == mdoc->last); |
|
mdoc->first = p; |
|
mdoc->last = p; |
|
mdoc_msg(mdoc, pos, "parse: root %s `%s'", nt, nn); |
|
return; |
|
} |
|
|
|
switch (mdoc->last->type) { |
/* |
case (MDOC_TEXT): |
* Copy over the normalised-data pointer of our parent. Not |
on = "<text>"; |
* everybody has one, but copying a null pointer is fine. |
ot = "text"; |
*/ |
|
|
|
switch (p->type) { |
|
case MDOC_BODY: |
|
if (ENDBODY_NOT != p->end) |
|
break; |
|
/* FALLTHROUGH */ |
|
case MDOC_TAIL: |
|
/* FALLTHROUGH */ |
|
case MDOC_HEAD: |
|
p->norm = p->parent->norm; |
break; |
break; |
case (MDOC_BODY): |
default: |
on = mdoc_macronames[mdoc->last->data.body.tok]; |
|
ot = "body"; |
|
break; |
break; |
case (MDOC_ELEM): |
} |
on = mdoc_macronames[mdoc->last->data.elem.tok]; |
|
ot = "elem"; |
if ( ! mdoc_valid_pre(mdoc, p)) |
|
return(0); |
|
|
|
switch (p->type) { |
|
case MDOC_HEAD: |
|
assert(MDOC_BLOCK == p->parent->type); |
|
p->parent->head = p; |
break; |
break; |
case (MDOC_HEAD): |
case MDOC_TAIL: |
on = mdoc_macronames[mdoc->last->data.head.tok]; |
assert(MDOC_BLOCK == p->parent->type); |
ot = "head"; |
p->parent->tail = p; |
break; |
break; |
case (MDOC_BLOCK): |
case MDOC_BODY: |
on = mdoc_macronames[mdoc->last->data.block.tok]; |
if (p->end) |
ot = "block"; |
break; |
|
assert(MDOC_BLOCK == p->parent->type); |
|
p->parent->body = p; |
break; |
break; |
default: |
default: |
abort(); |
break; |
/* NOTREACHED */ |
|
} |
} |
|
|
|
mdoc->last = p; |
|
|
switch (p->type) { |
switch (p->type) { |
case (MDOC_BODY): |
case MDOC_TBL: |
p->parent = mdoc->last->parent; |
/* FALLTHROUGH */ |
mdoc->last->next = p; |
case MDOC_TEXT: |
p->prev = mdoc->last; |
if ( ! mdoc_valid_post(mdoc)) |
act = "sibling"; |
return(0); |
break; |
break; |
|
|
case (MDOC_HEAD): |
|
assert(mdoc->last->type == MDOC_BLOCK); |
|
p->parent = mdoc->last; |
|
mdoc->last->child = p; |
|
act = "child"; |
|
break; |
|
|
|
default: |
default: |
switch (mdoc->last->type) { |
|
case (MDOC_BODY): |
|
/* FALLTHROUGH */ |
|
case (MDOC_HEAD): |
|
p->parent = mdoc->last; |
|
mdoc->last->child = p; |
|
act = "child"; |
|
break; |
|
default: |
|
p->parent = mdoc->last->parent; |
|
p->prev = mdoc->last; |
|
mdoc->last->next = p; |
|
act = "sibling"; |
|
break; |
|
} |
|
break; |
break; |
} |
} |
|
|
mdoc_msg(mdoc, pos, "parse: %s `%s' %s %s `%s'", |
return(1); |
nt, nn, act, ot, on); |
|
mdoc->last = p; |
|
} |
} |
|
|
|
static struct mdoc_node * |
/* FIXME: deprecate paramsz, params. */ |
node_alloc(struct mdoc *mdoc, int line, int pos, |
void |
enum mdoct tok, enum mdoc_type type) |
mdoc_head_alloc(struct mdoc *mdoc, int pos, int tok, |
|
size_t paramsz, const char **params) |
|
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
assert(mdoc->first); |
p = mandoc_calloc(1, sizeof(struct mdoc_node)); |
assert(mdoc->last); |
p->sec = mdoc->lastsec; |
assert(mdoc->last->type == MDOC_BLOCK); |
p->line = line; |
assert(mdoc->last->data.block.tok == tok); |
p->pos = pos; |
|
p->lastline = line; |
|
p->tok = tok; |
|
p->type = type; |
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
/* Flag analysis. */ |
p->type = MDOC_HEAD; |
|
p->data.head.tok = tok; |
|
p->data.head.sz = paramsz; |
|
p->data.head.args = paramdup(paramsz, params); |
|
|
|
mdoc_node_append(mdoc, pos, p); |
if (MDOC_SYNOPSIS & mdoc->flags) |
|
p->flags |= MDOC_SYNPRETTY; |
|
else |
|
p->flags &= ~MDOC_SYNPRETTY; |
|
if (MDOC_NEWLINE & mdoc->flags) |
|
p->flags |= MDOC_LINE; |
|
mdoc->flags &= ~MDOC_NEWLINE; |
|
|
|
return(p); |
} |
} |
|
|
|
int |
|
mdoc_tail_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
|
{ |
|
struct mdoc_node *p; |
|
|
void |
p = node_alloc(mdoc, line, pos, tok, MDOC_TAIL); |
mdoc_body_alloc(struct mdoc *mdoc, int pos, int tok) |
if ( ! node_append(mdoc, p)) |
|
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
|
|
|
int |
|
mdoc_head_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
assert(mdoc->first); |
assert(mdoc->first); |
assert(mdoc->last); |
assert(mdoc->last); |
assert((mdoc->last->type == MDOC_BLOCK) || |
|
(mdoc->last->type == MDOC_HEAD)); |
|
if (mdoc->last->type == MDOC_BLOCK) |
|
assert(mdoc->last->data.block.tok == tok); |
|
else |
|
assert(mdoc->last->data.head.tok == tok); |
|
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
p = node_alloc(mdoc, line, pos, tok, MDOC_HEAD); |
|
if ( ! node_append(mdoc, p)) |
p->type = MDOC_BODY; |
return(0); |
p->data.body.tok = tok; |
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
mdoc_node_append(mdoc, pos, p); |
|
} |
} |
|
|
|
int |
void |
mdoc_body_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
mdoc_block_alloc(struct mdoc *mdoc, int pos, int tok, |
|
size_t argsz, const struct mdoc_arg *args) |
|
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
p = node_alloc(mdoc, line, pos, tok, MDOC_BODY); |
|
if ( ! node_append(mdoc, p)) |
p->type = MDOC_BLOCK; |
return(0); |
p->data.block.tok = tok; |
mdoc->next = MDOC_NEXT_CHILD; |
p->data.block.argc = argsz; |
return(1); |
p->data.block.argv = argdup(argsz, args); |
|
|
|
mdoc_node_append(mdoc, pos, p); |
|
} |
} |
|
|
|
int |
void |
mdoc_endbody_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok, |
mdoc_elem_alloc(struct mdoc *mdoc, int pos, int tok, |
struct mdoc_node *body, enum mdoc_endbody end) |
size_t argsz, const struct mdoc_arg *args, |
|
size_t paramsz, const char **params) |
|
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
p = node_alloc(mdoc, line, pos, tok, MDOC_BODY); |
p->type = MDOC_ELEM; |
p->pending = body; |
p->data.elem.tok = tok; |
p->norm = body->norm; |
p->data.elem.sz = paramsz; |
p->end = end; |
p->data.elem.args = paramdup(paramsz, params); |
if ( ! node_append(mdoc, p)) |
p->data.elem.argc = argsz; |
return(0); |
p->data.elem.argv = argdup(argsz, args); |
mdoc->next = MDOC_NEXT_SIBLING; |
|
return(1); |
mdoc_node_append(mdoc, pos, p); |
|
} |
} |
|
|
|
int |
void |
mdoc_block_alloc(struct mdoc *mdoc, int line, int pos, |
mdoc_word_alloc(struct mdoc *mdoc, int pos, const char *word) |
enum mdoct tok, struct mdoc_arg *args) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
p = node_alloc(mdoc, line, pos, tok, MDOC_BLOCK); |
p->type = MDOC_TEXT; |
p->args = args; |
p->data.text.string = xstrdup(word); |
if (p->args) |
|
(args->refcnt)++; |
|
|
mdoc_node_append(mdoc, pos, p); |
switch (tok) { |
|
case MDOC_Bd: |
|
/* FALLTHROUGH */ |
|
case MDOC_Bf: |
|
/* FALLTHROUGH */ |
|
case MDOC_Bl: |
|
/* FALLTHROUGH */ |
|
case MDOC_En: |
|
/* FALLTHROUGH */ |
|
case MDOC_Rs: |
|
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
if ( ! node_append(mdoc, p)) |
|
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
} |
} |
|
|
|
int |
static void |
mdoc_elem_alloc(struct mdoc *mdoc, int line, int pos, |
argfree(size_t sz, struct mdoc_arg *p) |
enum mdoct tok, struct mdoc_arg *args) |
{ |
{ |
int i, j; |
struct mdoc_node *p; |
|
|
if (0 == sz) |
p = node_alloc(mdoc, line, pos, tok, MDOC_ELEM); |
return; |
p->args = args; |
|
if (p->args) |
|
(args->refcnt)++; |
|
|
assert(p); |
switch (tok) { |
/* LINTED */ |
case MDOC_An: |
for (i = 0; i < (int)sz; i++) |
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
if (p[i].sz > 0) { |
break; |
assert(p[i].value); |
default: |
/* LINTED */ |
break; |
for (j = 0; j < (int)p[i].sz; j++) |
} |
free(p[i].value[j]); |
|
} |
if ( ! node_append(mdoc, p)) |
free(p); |
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
} |
} |
|
|
|
int |
static void |
mdoc_word_alloc(struct mdoc *mdoc, int line, int pos, const char *p) |
mdoc_elem_free(struct mdoc_elem *p) |
|
{ |
{ |
|
struct mdoc_node *n; |
|
|
paramfree(p->sz, p->args); |
n = node_alloc(mdoc, line, pos, MDOC_MAX, MDOC_TEXT); |
argfree(p->argc, p->argv); |
n->string = roff_strdup(mdoc->roff, p); |
} |
|
|
|
|
if ( ! node_append(mdoc, n)) |
|
return(0); |
|
|
static void |
mdoc->next = MDOC_NEXT_SIBLING; |
mdoc_block_free(struct mdoc_block *p) |
return(1); |
|
} |
|
|
|
void |
|
mdoc_word_append(struct mdoc *mdoc, const char *p) |
{ |
{ |
|
struct mdoc_node *n; |
|
char *addstr, *newstr; |
|
|
argfree(p->argc, p->argv); |
n = mdoc->last; |
|
addstr = roff_strdup(mdoc->roff, p); |
|
mandoc_asprintf(&newstr, "%s %s", n->string, addstr); |
|
free(addstr); |
|
free(n->string); |
|
n->string = newstr; |
|
mdoc->next = MDOC_NEXT_SIBLING; |
} |
} |
|
|
|
|
static void |
static void |
mdoc_text_free(struct mdoc_text *p) |
mdoc_node_free(struct mdoc_node *p) |
{ |
{ |
|
|
|
if (MDOC_BLOCK == p->type || MDOC_ELEM == p->type) |
|
free(p->norm); |
if (p->string) |
if (p->string) |
free(p->string); |
free(p->string); |
|
if (p->args) |
|
mdoc_argv_free(p->args); |
|
free(p); |
} |
} |
|
|
|
|
static void |
static void |
mdoc_head_free(struct mdoc_head *p) |
mdoc_node_unlink(struct mdoc *mdoc, struct mdoc_node *n) |
{ |
{ |
|
|
paramfree(p->sz, p->args); |
/* Adjust siblings. */ |
} |
|
|
|
|
if (n->prev) |
|
n->prev->next = n->next; |
|
if (n->next) |
|
n->next->prev = n->prev; |
|
|
void |
/* Adjust parent. */ |
mdoc_node_free(struct mdoc_node *p) |
|
{ |
|
|
|
switch (p->type) { |
if (n->parent) { |
case (MDOC_TEXT): |
n->parent->nchild--; |
mdoc_text_free(&p->data.text); |
if (n->parent->child == n) |
break; |
n->parent->child = n->prev ? n->prev : n->next; |
case (MDOC_ELEM): |
if (n->parent->last == n) |
mdoc_elem_free(&p->data.elem); |
n->parent->last = n->prev ? n->prev : NULL; |
break; |
|
case (MDOC_BLOCK): |
|
mdoc_block_free(&p->data.block); |
|
break; |
|
case (MDOC_HEAD): |
|
mdoc_head_free(&p->data.head); |
|
break; |
|
default: |
|
break; |
|
} |
} |
|
|
free(p); |
/* Adjust parse point, if applicable. */ |
} |
|
|
|
|
if (mdoc && mdoc->last == n) { |
|
if (n->prev) { |
|
mdoc->last = n->prev; |
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
} else { |
|
mdoc->last = n->parent; |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
} |
|
} |
|
|
static void |
if (mdoc && mdoc->first == n) |
mdoc_node_freelist(struct mdoc_node *p) |
mdoc->first = NULL; |
|
} |
|
|
|
void |
|
mdoc_node_delete(struct mdoc *mdoc, struct mdoc_node *p) |
{ |
{ |
|
|
if (p->child) |
while (p->child) { |
mdoc_node_freelist(p->child); |
assert(p->nchild); |
if (p->next) |
mdoc_node_delete(mdoc, p->child); |
mdoc_node_freelist(p->next); |
} |
|
assert(0 == p->nchild); |
|
|
|
mdoc_node_unlink(mdoc, p); |
mdoc_node_free(p); |
mdoc_node_free(p); |
} |
} |
|
|
|
|
int |
int |
mdoc_find(const struct mdoc *mdoc, const char *key) |
mdoc_node_relink(struct mdoc *mdoc, struct mdoc_node *p) |
{ |
{ |
|
|
return(mdoc_tokhash_find(mdoc->htab, key)); |
mdoc_node_unlink(mdoc, p); |
|
return(node_append(mdoc, p)); |
} |
} |
|
|
|
#if 0 |
static void |
/* |
argcpy(struct mdoc_arg *dst, const struct mdoc_arg *src) |
* Pre-treat a text line. |
|
* Text lines can consist of equations, which must be handled apart from |
|
* the regular text. |
|
* Thus, use this function to step through a line checking if it has any |
|
* equations embedded in it. |
|
* This must handle multiple equations AND equations that do not end at |
|
* the end-of-line, i.e., will re-enter in the next roff parse. |
|
*/ |
|
static int |
|
mdoc_preptext(struct mdoc *mdoc, int line, char *buf, int offs) |
{ |
{ |
int i; |
char *start, *end; |
|
char delim; |
|
|
dst->arg = src->arg; |
while ('\0' != buf[offs]) { |
if (0 == (dst->sz = src->sz)) |
/* Mark starting position if eqn is set. */ |
return; |
start = NULL; |
dst->value = xcalloc(dst->sz, sizeof(char *)); |
if ('\0' != (delim = roff_eqndelim(mdoc->roff))) |
for (i = 0; i < (int)dst->sz; i++) |
if (NULL != (start = strchr(buf + offs, delim))) |
dst->value[i] = xstrdup(src->value[i]); |
*start++ = '\0'; |
|
|
|
/* Parse text as normal. */ |
|
if ( ! mdoc_ptext(mdoc, line, buf, offs)) |
|
return(0); |
|
|
|
/* Continue only if an equation exists. */ |
|
if (NULL == start) |
|
break; |
|
|
|
/* Read past the end of the equation. */ |
|
offs += start - (buf + offs); |
|
assert(start == &buf[offs]); |
|
if (NULL != (end = strchr(buf + offs, delim))) { |
|
*end++ = '\0'; |
|
while (' ' == *end) |
|
end++; |
|
} |
|
|
|
/* Parse the equation itself. */ |
|
roff_openeqn(mdoc->roff, NULL, line, offs, buf); |
|
|
|
/* Process a finished equation? */ |
|
if (roff_closeeqn(mdoc->roff)) |
|
if ( ! mdoc_addeqn(mdoc, roff_eqn(mdoc->roff))) |
|
return(0); |
|
offs += (end - (buf + offs)); |
|
} |
|
|
|
return(1); |
} |
} |
|
#endif |
|
|
|
/* |
|
* Parse free-form text, that is, a line that does not begin with the |
|
* control character. |
|
*/ |
|
static int |
|
mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int offs) |
|
{ |
|
char *c, *ws, *end; |
|
struct mdoc_node *n; |
|
|
static struct mdoc_arg * |
/* No text before an initial macro. */ |
argdup(size_t argsz, const struct mdoc_arg *args) |
|
|
if (SEC_NONE == mdoc->lastnamed) { |
|
mdoc_pmsg(mdoc, line, offs, MANDOCERR_NOTEXT); |
|
return(1); |
|
} |
|
|
|
assert(mdoc->last); |
|
n = mdoc->last; |
|
|
|
/* |
|
* Divert directly to list processing if we're encountering a |
|
* columnar MDOC_BLOCK with or without a prior MDOC_BLOCK entry |
|
* (a MDOC_BODY means it's already open, in which case we should |
|
* process within its context in the normal way). |
|
*/ |
|
|
|
if (MDOC_Bl == n->tok && MDOC_BODY == n->type && |
|
LIST_column == n->norm->Bl.type) { |
|
/* `Bl' is open without any children. */ |
|
mdoc->flags |= MDOC_FREECOL; |
|
return(mdoc_macro(mdoc, MDOC_It, line, offs, &offs, buf)); |
|
} |
|
|
|
if (MDOC_It == n->tok && MDOC_BLOCK == n->type && |
|
NULL != n->parent && |
|
MDOC_Bl == n->parent->tok && |
|
LIST_column == n->parent->norm->Bl.type) { |
|
/* `Bl' has block-level `It' children. */ |
|
mdoc->flags |= MDOC_FREECOL; |
|
return(mdoc_macro(mdoc, MDOC_It, line, offs, &offs, buf)); |
|
} |
|
|
|
/* |
|
* Search for the beginning of unescaped trailing whitespace (ws) |
|
* and for the first character not to be output (end). |
|
*/ |
|
|
|
/* FIXME: replace with strcspn(). */ |
|
ws = NULL; |
|
for (c = end = buf + offs; *c; c++) { |
|
switch (*c) { |
|
case ' ': |
|
if (NULL == ws) |
|
ws = c; |
|
continue; |
|
case '\t': |
|
/* |
|
* Always warn about trailing tabs, |
|
* even outside literal context, |
|
* where they should be put on the next line. |
|
*/ |
|
if (NULL == ws) |
|
ws = c; |
|
/* |
|
* Strip trailing tabs in literal context only; |
|
* outside, they affect the next line. |
|
*/ |
|
if (MDOC_LITERAL & mdoc->flags) |
|
continue; |
|
break; |
|
case '\\': |
|
/* Skip the escaped character, too, if any. */ |
|
if (c[1]) |
|
c++; |
|
/* FALLTHROUGH */ |
|
default: |
|
ws = NULL; |
|
break; |
|
} |
|
end = c + 1; |
|
} |
|
*end = '\0'; |
|
|
|
if (ws) |
|
mdoc_pmsg(mdoc, line, (int)(ws-buf), MANDOCERR_EOLNSPACE); |
|
|
|
if ('\0' == buf[offs] && ! (MDOC_LITERAL & mdoc->flags)) { |
|
mdoc_pmsg(mdoc, line, (int)(c-buf), MANDOCERR_NOBLANKLN); |
|
|
|
/* |
|
* Insert a `sp' in the case of a blank line. Technically, |
|
* blank lines aren't allowed, but enough manuals assume this |
|
* behaviour that we want to work around it. |
|
*/ |
|
if ( ! mdoc_elem_alloc(mdoc, line, offs, MDOC_sp, NULL)) |
|
return(0); |
|
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
|
|
return(mdoc_valid_post(mdoc)); |
|
} |
|
|
|
if ( ! mdoc_word_alloc(mdoc, line, offs, buf+offs)) |
|
return(0); |
|
|
|
if (MDOC_LITERAL & mdoc->flags) |
|
return(1); |
|
|
|
/* |
|
* End-of-sentence check. If the last character is an unescaped |
|
* EOS character, then flag the node as being the end of a |
|
* sentence. The front-end will know how to interpret this. |
|
*/ |
|
|
|
assert(buf < end); |
|
|
|
if (mandoc_eos(buf+offs, (size_t)(end-buf-offs))) |
|
mdoc->last->flags |= MDOC_EOS; |
|
|
|
return(1); |
|
} |
|
|
|
/* |
|
* Parse a macro line, that is, a line beginning with the control |
|
* character. |
|
*/ |
|
static int |
|
mdoc_pmacro(struct mdoc *mdoc, int ln, char *buf, int offs) |
{ |
{ |
struct mdoc_arg *pp; |
enum mdoct tok; |
int i; |
int i, sv; |
|
char mac[5]; |
|
struct mdoc_node *n; |
|
|
if (0 == argsz) |
/* Empty post-control lines are ignored. */ |
return(NULL); |
|
|
|
pp = xcalloc((size_t)argsz, sizeof(struct mdoc_arg)); |
if ('"' == buf[offs]) { |
for (i = 0; i < (int)argsz; i++) |
mdoc_pmsg(mdoc, ln, offs, MANDOCERR_BADCOMMENT); |
argcpy(&pp[i], &args[i]); |
return(1); |
|
} else if ('\0' == buf[offs]) |
|
return(1); |
|
|
return(pp); |
sv = offs; |
|
|
|
/* |
|
* Copy the first word into a nil-terminated buffer. |
|
* Stop copying when a tab, space, or eoln is encountered. |
|
*/ |
|
|
|
i = 0; |
|
while (i < 4 && '\0' != buf[offs] && ' ' != buf[offs] && |
|
'\t' != buf[offs]) |
|
mac[i++] = buf[offs++]; |
|
|
|
mac[i] = '\0'; |
|
|
|
tok = (i > 1 && i < 4) ? mdoc_hash_find(mac) : MDOC_MAX; |
|
|
|
if (MDOC_MAX == tok) { |
|
mandoc_vmsg(MANDOCERR_MACRO, mdoc->parse, |
|
ln, sv, "%s", buf + sv - 1); |
|
return(1); |
|
} |
|
|
|
/* Disregard the first trailing tab, if applicable. */ |
|
|
|
if ('\t' == buf[offs]) |
|
offs++; |
|
|
|
/* Jump to the next non-whitespace word. */ |
|
|
|
while (buf[offs] && ' ' == buf[offs]) |
|
offs++; |
|
|
|
/* |
|
* Trailing whitespace. Note that tabs are allowed to be passed |
|
* into the parser as "text", so we only warn about spaces here. |
|
*/ |
|
|
|
if ('\0' == buf[offs] && ' ' == buf[offs - 1]) |
|
mdoc_pmsg(mdoc, ln, offs - 1, MANDOCERR_EOLNSPACE); |
|
|
|
/* |
|
* If an initial macro or a list invocation, divert directly |
|
* into macro processing. |
|
*/ |
|
|
|
if (NULL == mdoc->last || MDOC_It == tok || MDOC_El == tok) { |
|
if ( ! mdoc_macro(mdoc, tok, ln, sv, &offs, buf)) |
|
goto err; |
|
return(1); |
|
} |
|
|
|
n = mdoc->last; |
|
assert(mdoc->last); |
|
|
|
/* |
|
* If the first macro of a `Bl -column', open an `It' block |
|
* context around the parsed macro. |
|
*/ |
|
|
|
if (MDOC_Bl == n->tok && MDOC_BODY == n->type && |
|
LIST_column == n->norm->Bl.type) { |
|
mdoc->flags |= MDOC_FREECOL; |
|
if ( ! mdoc_macro(mdoc, MDOC_It, ln, sv, &sv, buf)) |
|
goto err; |
|
return(1); |
|
} |
|
|
|
/* |
|
* If we're following a block-level `It' within a `Bl -column' |
|
* context (perhaps opened in the above block or in ptext()), |
|
* then open an `It' block context around the parsed macro. |
|
*/ |
|
|
|
if (MDOC_It == n->tok && MDOC_BLOCK == n->type && |
|
NULL != n->parent && |
|
MDOC_Bl == n->parent->tok && |
|
LIST_column == n->parent->norm->Bl.type) { |
|
mdoc->flags |= MDOC_FREECOL; |
|
if ( ! mdoc_macro(mdoc, MDOC_It, ln, sv, &sv, buf)) |
|
goto err; |
|
return(1); |
|
} |
|
|
|
/* Normal processing of a macro. */ |
|
|
|
if ( ! mdoc_macro(mdoc, tok, ln, sv, &offs, buf)) |
|
goto err; |
|
|
|
/* In quick mode (for mandocdb), abort after the NAME section. */ |
|
|
|
if (mdoc->quick && MDOC_Sh == tok && |
|
SEC_NAME != mdoc->last->sec) |
|
return(2); |
|
|
|
return(1); |
|
|
|
err: /* Error out. */ |
|
|
|
mdoc->flags |= MDOC_HALT; |
|
return(0); |
} |
} |
|
|
|
enum mdelim |
|
mdoc_isdelim(const char *p) |
|
{ |
|
|
static void |
if ('\0' == p[0]) |
paramfree(size_t sz, char **p) |
return(DELIM_NONE); |
|
|
|
if ('\0' == p[1]) |
|
switch (p[0]) { |
|
case '(': |
|
/* FALLTHROUGH */ |
|
case '[': |
|
return(DELIM_OPEN); |
|
case '|': |
|
return(DELIM_MIDDLE); |
|
case '.': |
|
/* FALLTHROUGH */ |
|
case ',': |
|
/* FALLTHROUGH */ |
|
case ';': |
|
/* FALLTHROUGH */ |
|
case ':': |
|
/* FALLTHROUGH */ |
|
case '?': |
|
/* FALLTHROUGH */ |
|
case '!': |
|
/* FALLTHROUGH */ |
|
case ')': |
|
/* FALLTHROUGH */ |
|
case ']': |
|
return(DELIM_CLOSE); |
|
default: |
|
return(DELIM_NONE); |
|
} |
|
|
|
if ('\\' != p[0]) |
|
return(DELIM_NONE); |
|
|
|
if (0 == strcmp(p + 1, ".")) |
|
return(DELIM_CLOSE); |
|
if (0 == strcmp(p + 1, "fR|\\fP")) |
|
return(DELIM_MIDDLE); |
|
|
|
return(DELIM_NONE); |
|
} |
|
|
|
void |
|
mdoc_deroff(char **dest, const struct mdoc_node *n) |
{ |
{ |
int i; |
char *cp; |
|
size_t sz; |
|
|
if (0 == sz) |
if (MDOC_TEXT != n->type) { |
|
for (n = n->child; n; n = n->next) |
|
mdoc_deroff(dest, n); |
return; |
return; |
|
} |
|
|
assert(p); |
/* Skip leading whitespace. */ |
/* LINTED */ |
|
for (i = 0; i < (int)sz; i++) |
|
free(p[i]); |
|
free(p); |
|
} |
|
|
|
|
for (cp = n->string; '\0' != *cp; cp++) |
|
if (0 == isspace((unsigned char)*cp)) |
|
break; |
|
|
static char ** |
/* Skip trailing whitespace. */ |
paramdup(size_t sz, const char **p) |
|
{ |
|
char **pp; |
|
int i; |
|
|
|
|
for (sz = strlen(cp); sz; sz--) |
|
if (0 == isspace((unsigned char)cp[sz-1])) |
|
break; |
|
|
|
/* Skip empty strings. */ |
|
|
if (0 == sz) |
if (0 == sz) |
return(NULL); |
return; |
|
|
pp = xcalloc(sz, sizeof(char *)); |
if (NULL == *dest) { |
for (i = 0; i < (int)sz; i++) |
*dest = mandoc_strndup(cp, sz); |
pp[i] = xstrdup(p[i]); |
return; |
|
} |
|
|
return(pp); |
mandoc_asprintf(&cp, "%s %*s", *dest, (int)sz, cp); |
|
free(*dest); |
|
*dest = cp; |
} |
} |