version 1.66, 2009/03/16 23:37:28 |
version 1.99, 2009/08/13 11:43:24 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org> |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* |
* |
* 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. |
|
*/ |
*/ |
#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 "private.h" |
#include "libmdoc.h" |
|
|
/* |
const char *const __mdoc_merrnames[MERRMAX] = { |
* Main caller in the libmdoc library. This begins the parsing routine, |
"trailing whitespace", /* ETAILWS */ |
* handles allocation of data, and so forth. Most of the "work" is done |
"unexpected quoted parameter", /* EQUOTPARM */ |
* in macro.c and validate.c. |
"unterminated quoted parameter", /* EQUOTTERM */ |
*/ |
"system: malloc error", /* EMALLOC */ |
|
"argument parameter suggested", /* EARGVAL */ |
|
"macro disallowed in prologue", /* EBODYPROL */ |
|
"macro disallowed in body", /* EPROLBODY */ |
|
"text disallowed in prologue", /* ETEXTPROL */ |
|
"blank line disallowed", /* ENOBLANK */ |
|
"text parameter too long", /* ETOOLONG */ |
|
"invalid escape sequence", /* EESCAPE */ |
|
"invalid character", /* EPRINT */ |
|
"document has no body", /* ENODAT */ |
|
"document has no prologue", /* ENOPROLOGUE */ |
|
"expected line arguments", /* ELINE */ |
|
"invalid AT&T argument", /* EATT */ |
|
"default name not yet set", /* ENAME */ |
|
"missing list type", /* ELISTTYPE */ |
|
"missing display type", /* EDISPTYPE */ |
|
"too many display types", /* EMULTIDISP */ |
|
"too many list types", /* EMULTILIST */ |
|
"NAME section must be first", /* ESECNAME */ |
|
"badly-formed NAME section", /* ENAMESECINC */ |
|
"argument repeated", /* EARGREP */ |
|
"expected boolean parameter", /* EBOOL */ |
|
"inconsistent column syntax", /* ECOLMIS */ |
|
"nested display invalid", /* ENESTDISP */ |
|
"width argument missing", /* EMISSWIDTH */ |
|
"invalid section for this manual section", /* EWRONGMSEC */ |
|
"section out of conventional order", /* ESECOOO */ |
|
"section repeated", /* ESECREP */ |
|
"invalid standard argument", /* EBADSTAND */ |
|
"multi-line arguments discouraged", /* ENOMULTILINE */ |
|
"multi-line arguments suggested", /* EMULTILINE */ |
|
"line arguments discouraged", /* ENOLINE */ |
|
"prologue macro out of conventional order", /* EPROLOOO */ |
|
"prologue macro repeated", /* EPROLREP */ |
|
"invalid manual section", /* EBADMSEC */ |
|
"invalid section", /* EBADSEC */ |
|
"invalid font mode", /* EFONT */ |
|
"invalid date syntax", /* EBADDATE */ |
|
"invalid number format", /* ENUMFMT */ |
|
"superfluous width argument", /* ENOWIDTH */ |
|
"system: utsname error", /* EUTSNAME */ |
|
"obsolete macro", /* EOBS */ |
|
"end-of-line scope violation", /* EIMPBRK */ |
|
"empty macro ignored", /* EIGNE */ |
|
"unclosed explicit scope", /* EOPEN */ |
|
"unterminated quoted phrase", /* EQUOTPHR */ |
|
"closure macro without prior context", /* ENOCTX */ |
|
"invalid whitespace after control character", /* ESPACE */ |
|
"no description found for library" /* ELIB */ |
|
}; |
|
|
static struct mdoc_node *mdoc_node_alloc(const struct mdoc *); |
|
static int mdoc_node_append(struct mdoc *, |
|
struct mdoc_node *); |
|
|
|
static int parsetext(struct mdoc *, int, char *); |
|
static int parsemacro(struct mdoc *, int, char *); |
|
static int macrowarn(struct mdoc *, int, const char *); |
|
|
|
|
|
const char *const __mdoc_macronames[MDOC_MAX] = { |
const char *const __mdoc_macronames[MDOC_MAX] = { |
"\\\"", "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 71 const char *const __mdoc_macronames[MDOC_MAX] = { |
|
Line 108 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", "Lb", "Ap", |
"Fr", "Ud", "Lb", "Lp", |
"Lp", "Lk", "Mt", "Brq", |
"Lk", "Mt", "Brq", "Bro", |
/* LINTED */ |
/* LINTED */ |
"Bro", "Brc", "\%C", "Es", |
"Brc", "\%C", "Es", "En", |
"En", "Dx" |
/* LINTED */ |
|
"Dx", "\%Q", "br", "sp" |
}; |
}; |
|
|
const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
Line 93 const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
|
Line 131 const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
|
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; |
|
|
|
static void mdoc_free1(struct mdoc *); |
|
static int mdoc_alloc1(struct mdoc *); |
|
static struct mdoc_node *node_alloc(struct mdoc *, int, int, |
|
int, enum mdoc_type); |
|
static int node_append(struct mdoc *, |
|
struct mdoc_node *); |
|
static int parsetext(struct mdoc *, int, char *); |
|
static int parsemacro(struct mdoc *, int, char *); |
|
static int macrowarn(struct mdoc *, int, const char *); |
|
static int pstring(struct mdoc *, int, int, |
|
const char *, size_t); |
|
|
|
#ifdef __linux__ |
|
extern size_t strlcpy(char *, const char *, size_t); |
|
#endif |
|
|
|
|
const struct mdoc_node * |
const struct mdoc_node * |
mdoc_node(const struct mdoc *mdoc) |
mdoc_node(const struct mdoc *m) |
{ |
{ |
|
|
return(mdoc->first); |
return(MDOC_HALT & m->flags ? NULL : m->first); |
} |
} |
|
|
|
|
const struct mdoc_meta * |
const struct mdoc_meta * |
mdoc_meta(const struct mdoc *mdoc) |
mdoc_meta(const struct mdoc *m) |
{ |
{ |
|
|
return(&mdoc->meta); |
return(MDOC_HALT & m->flags ? NULL : &m->meta); |
} |
} |
|
|
|
|
void |
/* |
mdoc_free(struct mdoc *mdoc) |
* Frees volatile resources (parse tree, meta-data, fields). |
|
*/ |
|
static void |
|
mdoc_free1(struct mdoc *mdoc) |
{ |
{ |
|
|
if (mdoc->first) |
if (mdoc->first) |
mdoc_node_freelist(mdoc->first); |
mdoc_node_freelist(mdoc->first); |
if (mdoc->htab) |
|
mdoc_tokhash_free(mdoc->htab); |
|
if (mdoc->meta.title) |
if (mdoc->meta.title) |
free(mdoc->meta.title); |
free(mdoc->meta.title); |
if (mdoc->meta.os) |
if (mdoc->meta.os) |
Line 128 mdoc_free(struct mdoc *mdoc) |
|
Line 183 mdoc_free(struct mdoc *mdoc) |
|
free(mdoc->meta.arch); |
free(mdoc->meta.arch); |
if (mdoc->meta.vol) |
if (mdoc->meta.vol) |
free(mdoc->meta.vol); |
free(mdoc->meta.vol); |
|
} |
|
|
|
|
|
/* |
|
* Allocate all volatile resources (parse tree, meta-data, fields). |
|
*/ |
|
static int |
|
mdoc_alloc1(struct mdoc *mdoc) |
|
{ |
|
|
|
bzero(&mdoc->meta, sizeof(struct mdoc_meta)); |
|
mdoc->flags = 0; |
|
mdoc->lastnamed = mdoc->lastsec = SEC_NONE; |
|
mdoc->last = calloc(1, sizeof(struct mdoc_node)); |
|
if (NULL == mdoc->last) |
|
return(0); |
|
|
|
mdoc->first = mdoc->last; |
|
mdoc->last->type = MDOC_ROOT; |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
|
|
|
|
|
/* |
|
* 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. |
|
*/ |
|
int |
|
mdoc_reset(struct mdoc *mdoc) |
|
{ |
|
|
|
mdoc_free1(mdoc); |
|
return(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_free1(mdoc); |
|
if (mdoc->htab) |
|
mdoc_hash_free(mdoc->htab); |
free(mdoc); |
free(mdoc); |
} |
} |
|
|
|
|
|
/* |
|
* Allocate volatile and non-volatile parse resources. |
|
*/ |
struct mdoc * |
struct mdoc * |
mdoc_alloc(void *data, int pflags, const struct mdoc_cb *cb) |
mdoc_alloc(void *data, int pflags, const struct mdoc_cb *cb) |
{ |
{ |
struct mdoc *p; |
struct mdoc *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc)); |
if (NULL == (p = calloc(1, sizeof(struct mdoc)))) |
|
return(NULL); |
p->data = data; |
|
if (cb) |
if (cb) |
(void)memcpy(&p->cb, cb, sizeof(struct mdoc_cb)); |
(void)memcpy(&p->cb, cb, sizeof(struct mdoc_cb)); |
|
|
p->last = xcalloc(1, sizeof(struct mdoc_node)); |
p->data = data; |
p->last->type = MDOC_ROOT; |
|
p->first = p->last; |
|
p->pflags = pflags; |
p->pflags = pflags; |
p->next = MDOC_NEXT_CHILD; |
|
p->htab = mdoc_tokhash_alloc(); |
|
|
|
return(p); |
if (NULL == (p->htab = mdoc_hash_alloc())) { |
|
free(p); |
|
return(NULL); |
|
} else if (mdoc_alloc1(p)) |
|
return(p); |
|
|
|
free(p); |
|
return(NULL); |
} |
} |
|
|
|
|
|
/* |
|
* Climb back up the parse tree, validating open scopes. Mostly calls |
|
* through to macro_end() in macro.c. |
|
*/ |
int |
int |
mdoc_endparse(struct mdoc *mdoc) |
mdoc_endparse(struct mdoc *m) |
{ |
{ |
|
|
if (MDOC_HALT & mdoc->flags) |
if (MDOC_HALT & m->flags) |
return(0); |
return(0); |
if (NULL == mdoc->first) |
else if (mdoc_macroend(m)) |
return(1); |
return(1); |
|
m->flags |= MDOC_HALT; |
assert(mdoc->last); |
return(0); |
if ( ! macro_end(mdoc)) { |
|
mdoc->flags |= MDOC_HALT; |
|
return(0); |
|
} |
|
return(1); |
|
} |
} |
|
|
|
|
/* |
/* |
* Main parse routine. Parses a single line -- really just hands off to |
* Main parse routine. Parses a single line -- really just hands off to |
* the macro or text parser. |
* the macro (parsemacro()) or text parser (parsetext()). |
*/ |
*/ |
int |
int |
mdoc_parseln(struct mdoc *m, int ln, char *buf) |
mdoc_parseln(struct mdoc *m, int ln, char *buf) |
{ |
{ |
|
|
/* If in error-mode, then we parse no more. */ |
|
|
|
if (MDOC_HALT & m->flags) |
if (MDOC_HALT & m->flags) |
return(0); |
return(0); |
|
|
Line 191 mdoc_parseln(struct mdoc *m, int ln, char *buf) |
|
Line 297 mdoc_parseln(struct mdoc *m, int ln, char *buf) |
|
} |
} |
|
|
|
|
void |
|
mdoc_vmsg(struct mdoc *mdoc, int ln, int pos, const char *fmt, ...) |
|
{ |
|
char buf[256]; |
|
va_list ap; |
|
|
|
if (NULL == mdoc->cb.mdoc_msg) |
|
return; |
|
|
|
va_start(ap, fmt); |
|
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
|
va_end(ap); |
|
(*mdoc->cb.mdoc_msg)(mdoc->data, ln, pos, buf); |
|
} |
|
|
|
|
|
int |
int |
mdoc_verr(struct mdoc *mdoc, int ln, int pos, |
mdoc_verr(struct mdoc *mdoc, int ln, int pos, |
const char *fmt, ...) |
const char *fmt, ...) |
Line 220 mdoc_verr(struct mdoc *mdoc, int ln, int pos, |
|
Line 310 mdoc_verr(struct mdoc *mdoc, int ln, int pos, |
|
va_start(ap, fmt); |
va_start(ap, fmt); |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
va_end(ap); |
va_end(ap); |
|
|
return((*mdoc->cb.mdoc_err)(mdoc->data, ln, pos, buf)); |
return((*mdoc->cb.mdoc_err)(mdoc->data, ln, pos, buf)); |
} |
} |
|
|
|
|
int |
int |
mdoc_vwarn(struct mdoc *mdoc, int ln, int pos, |
mdoc_vwarn(struct mdoc *mdoc, int ln, int pos, const char *fmt, ...) |
enum mdoc_warn type, const char *fmt, ...) |
|
{ |
{ |
char buf[256]; |
char buf[256]; |
va_list ap; |
va_list ap; |
Line 237 mdoc_vwarn(struct mdoc *mdoc, int ln, int pos, |
|
Line 327 mdoc_vwarn(struct mdoc *mdoc, int ln, int pos, |
|
va_start(ap, fmt); |
va_start(ap, fmt); |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
va_end(ap); |
va_end(ap); |
return((*mdoc->cb.mdoc_warn)(mdoc->data, ln, pos, type, buf)); |
|
|
return((*mdoc->cb.mdoc_warn)(mdoc->data, ln, pos, buf)); |
} |
} |
|
|
|
|
int |
int |
mdoc_macro(struct mdoc *m, int tok, |
mdoc_err(struct mdoc *m, int line, int pos, int iserr, enum merr type) |
int ln, int pp, int *pos, char *buf) |
|
{ |
{ |
|
const char *p; |
|
|
/* FIXME - these should happen during validation. */ |
p = __mdoc_merrnames[(int)type]; |
|
assert(p); |
|
|
if (MDOC_PROLOGUE & mdoc_macros[tok].flags && |
if (iserr) |
SEC_PROLOGUE != m->lastnamed) |
return(mdoc_verr(m, line, pos, p)); |
return(mdoc_perr(m, ln, pp, |
|
"disallowed in document body")); |
|
|
|
if ( ! (MDOC_PROLOGUE & mdoc_macros[tok].flags) && |
return(mdoc_vwarn(m, line, pos, p)); |
SEC_PROLOGUE == m->lastnamed) |
} |
return(mdoc_perr(m, ln, pp, |
|
"disallowed in prologue")); |
|
|
|
if (1 != pp && ! (MDOC_CALLABLE & mdoc_macros[tok].flags)) |
|
return(mdoc_perr(m, ln, pp, "%s not callable", |
|
mdoc_macronames[tok])); |
|
|
|
|
int |
|
mdoc_macro(struct mdoc *m, int tok, |
|
int ln, int pp, int *pos, char *buf) |
|
{ |
|
/* |
|
* If we're in the prologue, deny "body" macros. Similarly, if |
|
* we're in the body, deny prologue calls. |
|
*/ |
|
if (MDOC_PROLOGUE & mdoc_macros[tok].flags && |
|
MDOC_PBODY & m->flags) |
|
return(mdoc_perr(m, ln, pp, EPROLBODY)); |
|
if ( ! (MDOC_PROLOGUE & mdoc_macros[tok].flags) && |
|
! (MDOC_PBODY & m->flags)) |
|
return(mdoc_perr(m, ln, pp, EBODYPROL)); |
|
|
return((*mdoc_macros[tok].fp)(m, tok, ln, pp, pos, buf)); |
return((*mdoc_macros[tok].fp)(m, tok, ln, pp, pos, buf)); |
} |
} |
|
|
|
|
static int |
static int |
mdoc_node_append(struct mdoc *mdoc, struct mdoc_node *p) |
node_append(struct mdoc *mdoc, struct mdoc_node *p) |
{ |
{ |
|
|
assert(mdoc->last); |
assert(mdoc->last); |
Line 289 mdoc_node_append(struct mdoc *mdoc, struct mdoc_node * |
|
Line 389 mdoc_node_append(struct mdoc *mdoc, struct mdoc_node * |
|
/* NOTREACHED */ |
/* NOTREACHED */ |
} |
} |
|
|
|
p->parent->nchild++; |
|
|
if ( ! mdoc_valid_pre(mdoc, p)) |
if ( ! mdoc_valid_pre(mdoc, p)) |
return(0); |
return(0); |
|
if ( ! mdoc_action_pre(mdoc, p)) |
|
return(0); |
|
|
switch (p->type) { |
switch (p->type) { |
case (MDOC_HEAD): |
case (MDOC_HEAD): |
Line 310 mdoc_node_append(struct mdoc *mdoc, struct mdoc_node * |
|
Line 414 mdoc_node_append(struct mdoc *mdoc, struct mdoc_node * |
|
} |
} |
|
|
mdoc->last = p; |
mdoc->last = p; |
|
|
|
switch (p->type) { |
|
case (MDOC_TEXT): |
|
if ( ! mdoc_valid_post(mdoc)) |
|
return(0); |
|
if ( ! mdoc_action_post(mdoc)) |
|
return(0); |
|
break; |
|
default: |
|
break; |
|
} |
|
|
return(1); |
return(1); |
} |
} |
|
|
|
|
static struct mdoc_node * |
static struct mdoc_node * |
mdoc_node_alloc(const struct mdoc *mdoc) |
node_alloc(struct mdoc *m, int line, |
|
int pos, int tok, enum mdoc_type type) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = xcalloc(1, sizeof(struct mdoc_node)); |
if (NULL == (p = calloc(1, sizeof(struct mdoc_node)))) { |
p->sec = mdoc->lastsec; |
(void)mdoc_nerr(m, m->last, EMALLOC); |
|
return(NULL); |
|
} |
|
|
|
p->sec = m->lastsec; |
|
p->line = line; |
|
p->pos = pos; |
|
p->tok = tok; |
|
if (MDOC_TEXT != (p->type = type)) |
|
assert(p->tok >= 0); |
|
|
return(p); |
return(p); |
} |
} |
|
|
|
|
int |
int |
mdoc_tail_alloc(struct mdoc *mdoc, int line, int pos, int tok) |
mdoc_tail_alloc(struct mdoc *m, int line, int pos, int tok) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
assert(mdoc->first); |
p = node_alloc(m, line, pos, tok, MDOC_TAIL); |
assert(mdoc->last); |
if (NULL == p) |
|
return(0); |
p = mdoc_node_alloc(mdoc); |
return(node_append(m, p)); |
|
|
p->line = line; |
|
p->pos = pos; |
|
p->type = MDOC_TAIL; |
|
p->tok = tok; |
|
|
|
return(mdoc_node_append(mdoc, p)); |
|
} |
} |
|
|
|
|
int |
int |
mdoc_head_alloc(struct mdoc *mdoc, int line, int pos, int tok) |
mdoc_head_alloc(struct mdoc *m, int line, int pos, int tok) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
assert(mdoc->first); |
assert(m->first); |
assert(mdoc->last); |
assert(m->last); |
|
|
p = mdoc_node_alloc(mdoc); |
p = node_alloc(m, line, pos, tok, MDOC_HEAD); |
|
if (NULL == p) |
p->line = line; |
return(0); |
p->pos = pos; |
return(node_append(m, p)); |
p->type = MDOC_HEAD; |
|
p->tok = tok; |
|
|
|
return(mdoc_node_append(mdoc, p)); |
|
} |
} |
|
|
|
|
int |
int |
mdoc_body_alloc(struct mdoc *mdoc, int line, int pos, int tok) |
mdoc_body_alloc(struct mdoc *m, int line, int pos, int tok) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
assert(mdoc->first); |
p = node_alloc(m, line, pos, tok, MDOC_BODY); |
assert(mdoc->last); |
if (NULL == p) |
|
return(0); |
p = mdoc_node_alloc(mdoc); |
return(node_append(m, p)); |
|
|
p->line = line; |
|
p->pos = pos; |
|
p->type = MDOC_BODY; |
|
p->tok = tok; |
|
|
|
return(mdoc_node_append(mdoc, p)); |
|
} |
} |
|
|
|
|
int |
int |
mdoc_root_alloc(struct mdoc *mdoc) |
mdoc_block_alloc(struct mdoc *m, int line, int pos, |
|
int tok, struct mdoc_arg *args) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = mdoc_node_alloc(mdoc); |
p = node_alloc(m, line, pos, tok, MDOC_BLOCK); |
|
if (NULL == p) |
p->type = MDOC_ROOT; |
return(0); |
|
p->args = args; |
return(mdoc_node_append(mdoc, p)); |
if (p->args) |
|
(args->refcnt)++; |
|
return(node_append(m, p)); |
} |
} |
|
|
|
|
int |
int |
mdoc_block_alloc(struct mdoc *mdoc, int line, int pos, |
mdoc_elem_alloc(struct mdoc *m, int line, int pos, |
int tok, struct mdoc_arg *args) |
int tok, struct mdoc_arg *args) |
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *p; |
|
|
p = mdoc_node_alloc(mdoc); |
p = node_alloc(m, line, pos, tok, MDOC_ELEM); |
|
if (NULL == p) |
p->pos = pos; |
return(0); |
p->line = line; |
|
p->type = MDOC_BLOCK; |
|
p->tok = tok; |
|
p->args = args; |
p->args = args; |
|
if (p->args) |
if (args) |
|
(args->refcnt)++; |
(args->refcnt)++; |
|
return(node_append(m, p)); |
return(mdoc_node_append(mdoc, p)); |
|
} |
} |
|
|
|
|
int |
static int |
mdoc_elem_alloc(struct mdoc *mdoc, int line, int pos, |
pstring(struct mdoc *m, int line, int pos, const char *p, size_t len) |
int tok, struct mdoc_arg *args) |
|
{ |
{ |
struct mdoc_node *p; |
struct mdoc_node *n; |
|
size_t sv; |
|
|
p = mdoc_node_alloc(mdoc); |
n = node_alloc(m, line, pos, -1, MDOC_TEXT); |
|
if (NULL == n) |
|
return(mdoc_nerr(m, m->last, EMALLOC)); |
|
|
p->line = line; |
n->string = malloc(len + 1); |
p->pos = pos; |
if (NULL == n->string) { |
p->type = MDOC_ELEM; |
free(n); |
p->tok = tok; |
return(mdoc_nerr(m, m->last, EMALLOC)); |
p->args = args; |
} |
|
|
if (args) |
sv = strlcpy(n->string, p, len + 1); |
(args->refcnt)++; |
|
|
|
return(mdoc_node_append(mdoc, p)); |
/* Prohibit truncation. */ |
|
assert(sv < len + 1); |
|
|
|
return(node_append(m, n)); |
} |
} |
|
|
|
|
int |
int |
mdoc_word_alloc(struct mdoc *mdoc, |
mdoc_word_alloc(struct mdoc *m, int line, int pos, const char *p) |
int line, int pos, const char *word) |
|
{ |
{ |
struct mdoc_node *p; |
|
|
|
p = mdoc_node_alloc(mdoc); |
return(pstring(m, line, pos, p, strlen(p))); |
|
|
p->line = line; |
|
p->pos = pos; |
|
p->type = MDOC_TEXT; |
|
p->string = xstrdup(word); |
|
|
|
return(mdoc_node_append(mdoc, p)); |
|
} |
} |
|
|
|
|
|
|
mdoc_node_free(struct mdoc_node *p) |
mdoc_node_free(struct mdoc_node *p) |
{ |
{ |
|
|
|
if (p->parent) |
|
p->parent->nchild--; |
if (p->string) |
if (p->string) |
free(p->string); |
free(p->string); |
if (p->args) |
if (p->args) |
Line 476 mdoc_node_freelist(struct mdoc_node *p) |
|
Line 579 mdoc_node_freelist(struct mdoc_node *p) |
|
if (p->next) |
if (p->next) |
mdoc_node_freelist(p->next); |
mdoc_node_freelist(p->next); |
|
|
|
assert(0 == p->nchild); |
mdoc_node_free(p); |
mdoc_node_free(p); |
} |
} |
|
|
Line 485 mdoc_node_freelist(struct mdoc_node *p) |
|
Line 589 mdoc_node_freelist(struct mdoc_node *p) |
|
* control character. |
* control character. |
*/ |
*/ |
static int |
static int |
parsetext(struct mdoc *mdoc, int line, char *buf) |
parsetext(struct mdoc *m, int line, char *buf) |
{ |
{ |
|
int i, j; |
|
|
if (SEC_PROLOGUE == mdoc->lastnamed) |
if (SEC_NONE == m->lastnamed) |
return(mdoc_perr(mdoc, line, 0, |
return(mdoc_perr(m, line, 0, ETEXTPROL)); |
"text disallowed in prologue")); |
|
|
/* |
|
* If in literal mode, then pass the buffer directly to the |
|
* back-end, as it should be preserved as a single term. |
|
*/ |
|
|
if ( ! mdoc_word_alloc(mdoc, line, 0, buf)) |
if (MDOC_LITERAL & m->flags) { |
|
if ( ! mdoc_word_alloc(m, line, 0, buf)) |
|
return(0); |
|
m->next = MDOC_NEXT_SIBLING; |
|
return(1); |
|
} |
|
|
|
/* Disallow blank/white-space lines in non-literal mode. */ |
|
|
|
for (i = 0; ' ' == buf[i]; i++) |
|
/* Skip leading whitespace. */ ; |
|
if (0 == buf[i]) |
|
return(mdoc_perr(m, line, 0, ENOBLANK)); |
|
|
|
/* |
|
* Break apart a free-form line into tokens. Spaces are |
|
* stripped out of the input. |
|
*/ |
|
|
|
for (j = i; buf[i]; i++) { |
|
if (' ' != buf[i]) |
|
continue; |
|
|
|
/* Escaped whitespace. */ |
|
if (i && ' ' == buf[i] && '\\' == buf[i - 1]) |
|
continue; |
|
|
|
buf[i++] = 0; |
|
if ( ! pstring(m, line, j, &buf[j], (size_t)(i - j))) |
|
return(0); |
|
m->next = MDOC_NEXT_SIBLING; |
|
|
|
for ( ; ' ' == buf[i]; i++) |
|
/* Skip trailing whitespace. */ ; |
|
|
|
j = i; |
|
if (0 == buf[i]) |
|
break; |
|
} |
|
|
|
if (j != i && ! pstring(m, line, j, &buf[j], (size_t)(i - j))) |
return(0); |
return(0); |
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
m->next = MDOC_NEXT_SIBLING; |
return(1); |
return(1); |
} |
} |
|
|
|
|
|
|
|
|
static int |
static int |
macrowarn(struct mdoc *m, int ln, const char *buf) |
macrowarn(struct mdoc *m, int ln, const char *buf) |
{ |
{ |
if ( ! (MDOC_IGN_MACRO & m->pflags)) |
if ( ! (MDOC_IGN_MACRO & m->pflags)) |
return(mdoc_perr(m, ln, 1, "unknown macro: %s%s", |
return(mdoc_verr(m, ln, 0, |
|
"unknown macro: %s%s", |
buf, strlen(buf) > 3 ? "..." : "")); |
buf, strlen(buf) > 3 ? "..." : "")); |
return(mdoc_pwarn(m, ln, 1, WARN_SYNTAX, |
return(mdoc_vwarn(m, ln, 0, "unknown macro: %s%s", |
"unknown macro: %s%s", |
|
buf, strlen(buf) > 3 ? "..." : "")); |
buf, strlen(buf) > 3 ? "..." : "")); |
} |
} |
|
|
|
|
|
|
/* |
/* |
* Parse a macro line, that is, a line beginning with the control |
* Parse a macro line, that is, a line beginning with the control |
* character. |
* character. |
Line 523 parsemacro(struct mdoc *m, int ln, char *buf) |
|
Line 673 parsemacro(struct mdoc *m, int ln, char *buf) |
|
int i, c; |
int i, c; |
char mac[5]; |
char mac[5]; |
|
|
/* Comments and empties are quickly ignored. */ |
/* Empty lines are ignored. */ |
|
|
|
/* FIXME: this can accept `. xx' like libman! */ |
|
|
if (0 == buf[1]) |
if (0 == buf[1]) |
return(1); |
return(1); |
|
|
Line 534 parsemacro(struct mdoc *m, int ln, char *buf) |
|
Line 686 parsemacro(struct mdoc *m, int ln, char *buf) |
|
i++; |
i++; |
if (0 == buf[i]) |
if (0 == buf[i]) |
return(1); |
return(1); |
return(mdoc_perr(m, ln, 1, "invalid syntax")); |
return(mdoc_perr(m, ln, 1, ESPACE)); |
} |
} |
|
|
if (buf[1] && '\\' == buf[1]) |
|
if (buf[2] && '\"' == buf[2]) |
|
return(1); |
|
|
|
/* Copy the first word into a nil-terminated buffer. */ |
/* Copy the first word into a nil-terminated buffer. */ |
|
|
for (i = 1; i < 5; i++) { |
for (i = 1; i < 5; i++) { |
Line 558 parsemacro(struct mdoc *m, int ln, char *buf) |
|
Line 706 parsemacro(struct mdoc *m, int ln, char *buf) |
|
return(1); |
return(1); |
} |
} |
|
|
if (MDOC_MAX == (c = mdoc_tokhash_find(m->htab, mac))) { |
if (MDOC_MAX == (c = mdoc_hash_find(m->htab, mac))) { |
if ( ! macrowarn(m, ln, mac)) |
if ( ! macrowarn(m, ln, mac)) |
goto err; |
goto err; |
return(1); |
return(1); |
Line 569 parsemacro(struct mdoc *m, int ln, char *buf) |
|
Line 717 parsemacro(struct mdoc *m, int ln, char *buf) |
|
while (buf[i] && ' ' == buf[i]) |
while (buf[i] && ' ' == buf[i]) |
i++; |
i++; |
|
|
/* Begin recursive parse sequence. */ |
/* |
|
* Begin recursive parse sequence. Since we're at the start of |
|
* the line, we don't need to do callable/parseable checks. |
|
*/ |
if ( ! mdoc_macro(m, c, ln, 1, &i, buf)) |
if ( ! mdoc_macro(m, c, ln, 1, &i, buf)) |
goto err; |
goto err; |
|
|