version 1.203, 2012/11/17 00:26:33 |
version 1.270, 2018/12/04 02:53:51 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010, 2012 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2010, 2012-2018 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
* copyright notice and this permission notice appear in all copies. |
* copyright notice and this permission notice appear in all copies. |
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
#include "config.h" |
#endif |
|
|
|
#include <sys/types.h> |
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <ctype.h> |
#include <stdarg.h> |
#include <stdarg.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <time.h> |
|
|
#include "mdoc.h" |
#include "mandoc_aux.h" |
#include "mandoc.h" |
#include "mandoc.h" |
#include "libmdoc.h" |
#include "roff.h" |
|
#include "mdoc.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
|
#include "roff_int.h" |
|
#include "libmdoc.h" |
|
|
const char *const __mdoc_macronames[MDOC_MAX] = { |
const char *const __mdoc_argnames[MDOC_ARG_MAX] = { |
"Ap", "Dd", "Dt", "Os", |
|
"Sh", "Ss", "Pp", "D1", |
|
"Dl", "Bd", "Ed", "Bl", |
|
"El", "It", "Ad", "An", |
|
"Ar", "Cd", "Cm", "Dv", |
|
"Er", "Ev", "Ex", "Fa", |
|
"Fd", "Fl", "Fn", "Ft", |
|
"Ic", "In", "Li", "Nd", |
|
"Nm", "Op", "Ot", "Pa", |
|
"Rv", "St", "Va", "Vt", |
|
/* LINTED */ |
|
"Xr", "%A", "%B", "%D", |
|
/* LINTED */ |
|
"%I", "%J", "%N", "%O", |
|
/* LINTED */ |
|
"%P", "%R", "%T", "%V", |
|
"Ac", "Ao", "Aq", "At", |
|
"Bc", "Bf", "Bo", "Bq", |
|
"Bsx", "Bx", "Db", "Dc", |
|
"Do", "Dq", "Ec", "Ef", |
|
"Em", "Eo", "Fx", "Ms", |
|
"No", "Ns", "Nx", "Ox", |
|
"Pc", "Pf", "Po", "Pq", |
|
"Qc", "Ql", "Qo", "Qq", |
|
"Re", "Rs", "Sc", "So", |
|
"Sq", "Sm", "Sx", "Sy", |
|
"Tn", "Ux", "Xc", "Xo", |
|
"Fo", "Fc", "Oo", "Oc", |
|
"Bk", "Ek", "Bt", "Hf", |
|
"Fr", "Ud", "Lb", "Lp", |
|
"Lk", "Mt", "Brq", "Bro", |
|
/* LINTED */ |
|
"Brc", "%C", "Es", "En", |
|
/* LINTED */ |
|
"Dx", "%Q", "br", "sp", |
|
/* LINTED */ |
|
"%U", "Ta" |
|
}; |
|
|
|
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", |
"filled", "words", "emphasis", |
"filled", "words", "emphasis", |
"symbolic", "nested", "centered" |
"symbolic", "nested", "centered" |
}; |
}; |
|
|
const char * const *mdoc_macronames = __mdoc_macronames; |
|
const char * const *mdoc_argnames = __mdoc_argnames; |
const char * const *mdoc_argnames = __mdoc_argnames; |
|
|
static void mdoc_node_free(struct mdoc_node *); |
static int mdoc_ptext(struct roff_man *, int, char *, int); |
static void mdoc_node_unlink(struct mdoc *, |
static int mdoc_pmacro(struct roff_man *, int, char *, int); |
struct mdoc_node *); |
|
static void mdoc_free1(struct mdoc *); |
|
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 * |
|
mdoc_node(const struct mdoc *mdoc) |
|
{ |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
|
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 |
|
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_free1(mdoc); |
|
free(mdoc); |
|
} |
|
|
|
|
|
/* |
|
* Allocate volatile and non-volatile parse resources. |
|
*/ |
|
struct mdoc * |
|
mdoc_alloc(struct roff *roff, struct mparse *parse, char *defos) |
|
{ |
|
struct mdoc *p; |
|
|
|
p = mandoc_calloc(1, sizeof(struct mdoc)); |
|
|
|
p->parse = parse; |
|
p->defos = defos; |
|
p->roff = roff; |
|
|
|
mdoc_hash_init(); |
|
mdoc_alloc1(p); |
|
return(p); |
|
} |
|
|
|
|
|
/* |
|
* Climb back up the parse tree, validating open scopes. Mostly calls |
|
* through to macro_end() in macro.c. |
|
*/ |
|
int |
|
mdoc_endparse(struct mdoc *mdoc) |
|
{ |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
|
if (mdoc_macroend(mdoc)) |
|
return(1); |
|
mdoc->flags |= MDOC_HALT; |
|
return(0); |
|
} |
|
|
|
int |
|
mdoc_addeqn(struct mdoc *mdoc, const struct eqn *ep) |
|
{ |
|
struct mdoc_node *n; |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
|
|
|
/* No text before an initial macro. */ |
|
|
|
if (SEC_NONE == mdoc->lastnamed) { |
|
mdoc_pmsg(mdoc, ep->ln, ep->pos, MANDOCERR_NOTEXT); |
|
return(1); |
|
} |
|
|
|
n = node_alloc(mdoc, ep->ln, ep->pos, MDOC_MAX, MDOC_EQN); |
|
n->eqn = ep; |
|
|
|
if ( ! node_append(mdoc, n)) |
|
return(0); |
|
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
return(1); |
|
} |
|
|
|
int |
|
mdoc_addspan(struct mdoc *mdoc, const struct tbl_span *sp) |
|
{ |
|
struct mdoc_node *n; |
|
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
|
|
|
/* No text before an initial macro. */ |
|
|
|
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; |
|
|
|
if ( ! node_append(mdoc, n)) |
|
return(0); |
|
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
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 (mdoc_pmacro()) or text parser (mdoc_ptext()). |
* the macro (mdoc_pmacro()) or text parser (mdoc_ptext()). |
*/ |
*/ |
int |
int |
mdoc_parseln(struct mdoc *mdoc, int ln, char *buf, int offs) |
mdoc_parseln(struct roff_man *mdoc, int ln, char *buf, int offs) |
{ |
{ |
|
|
assert( ! (MDOC_HALT & mdoc->flags)); |
if (mdoc->last->type != ROFFT_EQN || ln > mdoc->last->line) |
|
mdoc->flags |= MDOC_NEWLINE; |
|
|
mdoc->flags |= MDOC_NEWLINE; |
|
|
|
/* |
/* |
* Let the roff nS register switch SYNOPSIS mode early, |
* Let the roff nS register switch SYNOPSIS mode early, |
* such that the parser knows at all times |
* such that the parser knows at all times |
* whether this mode is on or off. |
* whether this mode is on or off. |
* Note that this mode is also switched by the Sh macro. |
* Note that this mode is also switched by the Sh macro. |
*/ |
*/ |
if (roff_regisset(mdoc->roff, REG_nS)) { |
if (roff_getreg(mdoc->roff, "nS")) |
if (roff_regget(mdoc->roff, REG_nS)) |
mdoc->flags |= MDOC_SYNOPSIS; |
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 |
|
mdoc_macro(MACRO_PROT_ARGS) |
|
{ |
|
assert(tok < MDOC_MAX); |
|
|
|
/* If we're in the body, deny prologue calls. */ |
|
|
|
if (MDOC_PROLOGUE & mdoc_macros[tok].flags && |
|
MDOC_PBODY & mdoc->flags) { |
|
mdoc_pmsg(mdoc, line, ppos, MANDOCERR_BADBODY); |
|
return(1); |
|
} |
|
|
|
/* If we're in the prologue, deny "body" macros. */ |
|
|
|
if ( ! (MDOC_PROLOGUE & mdoc_macros[tok].flags) && |
|
! (MDOC_PBODY & mdoc->flags)) { |
|
mdoc_pmsg(mdoc, line, ppos, MANDOCERR_BADPROLOG); |
|
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 int |
|
node_append(struct mdoc *mdoc, struct mdoc_node *p) |
|
{ |
|
|
|
assert(mdoc->last); |
|
assert(mdoc->first); |
|
assert(MDOC_ROOT != p->type); |
|
|
|
switch (mdoc->next) { |
|
case (MDOC_NEXT_SIBLING): |
|
mdoc->last->next = p; |
|
p->prev = mdoc->last; |
|
p->parent = mdoc->last->parent; |
|
break; |
|
case (MDOC_NEXT_CHILD): |
|
mdoc->last->child = p; |
|
p->parent = mdoc->last; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
|
|
p->parent->nchild++; |
|
|
|
/* |
|
* Copy over the normalised-data pointer of our parent. Not |
|
* everybody has one, but copying a null pointer is fine. |
|
*/ |
|
|
|
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; |
|
default: |
|
break; |
|
} |
|
|
|
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; |
|
case (MDOC_TAIL): |
|
assert(MDOC_BLOCK == p->parent->type); |
|
p->parent->tail = p; |
|
break; |
|
case (MDOC_BODY): |
|
if (p->end) |
|
break; |
|
assert(MDOC_BLOCK == p->parent->type); |
|
p->parent->body = p; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
mdoc->last = p; |
|
|
|
switch (p->type) { |
|
case (MDOC_TBL): |
|
/* FALLTHROUGH */ |
|
case (MDOC_TEXT): |
|
if ( ! mdoc_valid_post(mdoc)) |
|
return(0); |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
return(1); |
|
} |
|
|
|
|
|
static struct mdoc_node * |
|
node_alloc(struct mdoc *mdoc, int line, int pos, |
|
enum mdoct tok, enum mdoc_type type) |
|
{ |
|
struct mdoc_node *p; |
|
|
|
p = mandoc_calloc(1, sizeof(struct mdoc_node)); |
|
p->sec = mdoc->lastsec; |
|
p->line = line; |
|
p->pos = pos; |
|
p->tok = tok; |
|
p->type = type; |
|
|
|
/* Flag analysis. */ |
|
|
|
if (MDOC_SYNOPSIS & mdoc->flags) |
|
p->flags |= MDOC_SYNPRETTY; |
|
else |
else |
p->flags &= ~MDOC_SYNPRETTY; |
mdoc->flags &= ~MDOC_SYNOPSIS; |
if (MDOC_NEWLINE & mdoc->flags) |
|
p->flags |= MDOC_LINE; |
|
mdoc->flags &= ~MDOC_NEWLINE; |
|
|
|
return(p); |
return roff_getcontrol(mdoc->roff, buf, &offs) ? |
|
mdoc_pmacro(mdoc, ln, buf, offs) : |
|
mdoc_ptext(mdoc, ln, buf, offs); |
} |
} |
|
|
|
void |
int |
mdoc_tail_alloc(struct roff_man *mdoc, int line, int pos, enum roff_tok tok) |
mdoc_tail_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
|
{ |
{ |
struct mdoc_node *p; |
struct roff_node *p; |
|
|
p = node_alloc(mdoc, line, pos, tok, MDOC_TAIL); |
p = roff_node_alloc(mdoc, line, pos, ROFFT_TAIL, tok); |
if ( ! node_append(mdoc, p)) |
roff_node_append(mdoc, p); |
return(0); |
mdoc->next = ROFF_NEXT_CHILD; |
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
} |
|
|
|
struct roff_node * |
int |
mdoc_endbody_alloc(struct roff_man *mdoc, int line, int pos, |
mdoc_head_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
enum roff_tok tok, struct roff_node *body) |
{ |
{ |
struct mdoc_node *p; |
struct roff_node *p; |
|
|
assert(mdoc->first); |
body->flags |= NODE_ENDED; |
assert(mdoc->last); |
body->parent->flags |= NODE_ENDED; |
|
p = roff_node_alloc(mdoc, line, pos, ROFFT_BODY, tok); |
p = node_alloc(mdoc, line, pos, tok, MDOC_HEAD); |
p->body = body; |
if ( ! node_append(mdoc, p)) |
|
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
|
|
|
|
|
int |
|
mdoc_body_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok) |
|
{ |
|
struct mdoc_node *p; |
|
|
|
p = node_alloc(mdoc, line, pos, tok, MDOC_BODY); |
|
if ( ! node_append(mdoc, p)) |
|
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
|
|
|
|
|
int |
|
mdoc_endbody_alloc(struct mdoc *mdoc, int line, int pos, enum mdoct tok, |
|
struct mdoc_node *body, enum mdoc_endbody end) |
|
{ |
|
struct mdoc_node *p; |
|
|
|
p = node_alloc(mdoc, line, pos, tok, MDOC_BODY); |
|
p->pending = body; |
|
p->norm = body->norm; |
p->norm = body->norm; |
p->end = end; |
p->end = ENDBODY_SPACE; |
if ( ! node_append(mdoc, p)) |
roff_node_append(mdoc, p); |
return(0); |
mdoc->next = ROFF_NEXT_SIBLING; |
mdoc->next = MDOC_NEXT_SIBLING; |
return p; |
return(1); |
|
} |
} |
|
|
|
struct roff_node * |
int |
mdoc_block_alloc(struct roff_man *mdoc, int line, int pos, |
mdoc_block_alloc(struct mdoc *mdoc, int line, int pos, |
enum roff_tok tok, struct mdoc_arg *args) |
enum mdoct tok, struct mdoc_arg *args) |
|
{ |
{ |
struct mdoc_node *p; |
struct roff_node *p; |
|
|
p = node_alloc(mdoc, line, pos, tok, MDOC_BLOCK); |
p = roff_node_alloc(mdoc, line, pos, ROFFT_BLOCK, tok); |
p->args = args; |
p->args = args; |
if (p->args) |
if (p->args) |
(args->refcnt)++; |
(args->refcnt)++; |
|
|
switch (tok) { |
switch (tok) { |
case (MDOC_Bd): |
case MDOC_Bd: |
/* FALLTHROUGH */ |
case MDOC_Bf: |
case (MDOC_Bf): |
case MDOC_Bl: |
/* FALLTHROUGH */ |
case MDOC_En: |
case (MDOC_Bl): |
case MDOC_Rs: |
/* FALLTHROUGH */ |
|
case (MDOC_Rs): |
|
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
break; |
break; |
default: |
default: |
break; |
break; |
} |
} |
|
roff_node_append(mdoc, p); |
if ( ! node_append(mdoc, p)) |
mdoc->next = ROFF_NEXT_CHILD; |
return(0); |
return p; |
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
} |
|
|
|
void |
int |
mdoc_elem_alloc(struct roff_man *mdoc, int line, int pos, |
mdoc_elem_alloc(struct mdoc *mdoc, int line, int pos, |
enum roff_tok tok, struct mdoc_arg *args) |
enum mdoct tok, struct mdoc_arg *args) |
|
{ |
{ |
struct mdoc_node *p; |
struct roff_node *p; |
|
|
p = node_alloc(mdoc, line, pos, tok, MDOC_ELEM); |
p = roff_node_alloc(mdoc, line, pos, ROFFT_ELEM, tok); |
p->args = args; |
p->args = args; |
if (p->args) |
if (p->args) |
(args->refcnt)++; |
(args->refcnt)++; |
|
|
switch (tok) { |
switch (tok) { |
case (MDOC_An): |
case MDOC_An: |
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
p->norm = mandoc_calloc(1, sizeof(union mdoc_data)); |
break; |
break; |
default: |
default: |
break; |
break; |
} |
} |
|
roff_node_append(mdoc, p); |
if ( ! node_append(mdoc, p)) |
mdoc->next = ROFF_NEXT_CHILD; |
return(0); |
|
mdoc->next = MDOC_NEXT_CHILD; |
|
return(1); |
|
} |
} |
|
|
int |
|
mdoc_word_alloc(struct mdoc *mdoc, int line, int pos, const char *p) |
|
{ |
|
struct mdoc_node *n; |
|
|
|
n = node_alloc(mdoc, line, pos, MDOC_MAX, MDOC_TEXT); |
|
n->string = roff_strdup(mdoc->roff, p); |
|
|
|
if ( ! node_append(mdoc, n)) |
|
return(0); |
|
|
|
mdoc->next = MDOC_NEXT_SIBLING; |
|
return(1); |
|
} |
|
|
|
|
|
static void |
|
mdoc_node_free(struct mdoc_node *p) |
|
{ |
|
|
|
if (MDOC_BLOCK == p->type || MDOC_ELEM == p->type) |
|
free(p->norm); |
|
if (p->string) |
|
free(p->string); |
|
if (p->args) |
|
mdoc_argv_free(p->args); |
|
free(p); |
|
} |
|
|
|
|
|
static void |
|
mdoc_node_unlink(struct mdoc *mdoc, struct mdoc_node *n) |
|
{ |
|
|
|
/* Adjust siblings. */ |
|
|
|
if (n->prev) |
|
n->prev->next = n->next; |
|
if (n->next) |
|
n->next->prev = n->prev; |
|
|
|
/* Adjust parent. */ |
|
|
|
if (n->parent) { |
|
n->parent->nchild--; |
|
if (n->parent->child == n) |
|
n->parent->child = n->prev ? n->prev : n->next; |
|
if (n->parent->last == n) |
|
n->parent->last = n->prev ? n->prev : NULL; |
|
} |
|
|
|
/* 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; |
|
} |
|
} |
|
|
|
if (mdoc && mdoc->first == n) |
|
mdoc->first = NULL; |
|
} |
|
|
|
|
|
void |
|
mdoc_node_delete(struct mdoc *mdoc, struct mdoc_node *p) |
|
{ |
|
|
|
while (p->child) { |
|
assert(p->nchild); |
|
mdoc_node_delete(mdoc, p->child); |
|
} |
|
assert(0 == p->nchild); |
|
|
|
mdoc_node_unlink(mdoc, p); |
|
mdoc_node_free(p); |
|
} |
|
|
|
int |
|
mdoc_node_relink(struct mdoc *mdoc, struct mdoc_node *p) |
|
{ |
|
|
|
mdoc_node_unlink(mdoc, p); |
|
return(node_append(mdoc, p)); |
|
} |
|
|
|
#if 0 |
|
/* |
/* |
* 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) |
|
{ |
|
char *start, *end; |
|
char delim; |
|
|
|
while ('\0' != buf[offs]) { |
|
/* Mark starting position if eqn is set. */ |
|
start = NULL; |
|
if ('\0' != (delim = roff_eqndelim(mdoc->roff))) |
|
if (NULL != (start = strchr(buf + offs, delim))) |
|
*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 |
* Parse free-form text, that is, a line that does not begin with the |
* control character. |
* control character. |
*/ |
*/ |
static int |
static int |
mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int offs) |
mdoc_ptext(struct roff_man *mdoc, int line, char *buf, int offs) |
{ |
{ |
|
struct roff_node *n; |
|
const char *cp, *sp; |
char *c, *ws, *end; |
char *c, *ws, *end; |
struct mdoc_node *n; |
|
|
|
/* No text before an initial macro. */ |
|
|
|
if (SEC_NONE == mdoc->lastnamed) { |
|
mdoc_pmsg(mdoc, line, offs, MANDOCERR_NOTEXT); |
|
return(1); |
|
} |
|
|
|
assert(mdoc->last); |
|
n = mdoc->last; |
n = mdoc->last; |
|
|
/* |
/* |
* Divert directly to list processing if we're encountering a |
* If a column list contains plain text, assume an implicit item |
* columnar MDOC_BLOCK with or without a prior MDOC_BLOCK entry |
* macro. This can happen one or more times at the beginning |
* (a MDOC_BODY means it's already open, in which case we should |
* of such a list, intermixed with non-It mdoc macros and with |
* process within its context in the normal way). |
* nodes generated on the roff level, for example by tbl. |
*/ |
*/ |
|
|
if (MDOC_Bl == n->tok && MDOC_BODY == n->type && |
if ((n->tok == MDOC_Bl && n->type == ROFFT_BODY && |
LIST_column == n->norm->Bl.type) { |
n->end == ENDBODY_NOT && n->norm->Bl.type == LIST_column) || |
/* `Bl' is open without any children. */ |
(n->parent != NULL && n->parent->tok == MDOC_Bl && |
|
n->parent->norm->Bl.type == LIST_column)) { |
mdoc->flags |= MDOC_FREECOL; |
mdoc->flags |= MDOC_FREECOL; |
return(mdoc_macro(mdoc, MDOC_It, line, offs, &offs, buf)); |
(*mdoc_macro(MDOC_It)->fp)(mdoc, MDOC_It, |
|
line, offs, &offs, buf); |
|
return 1; |
} |
} |
|
|
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) |
* Search for the beginning of unescaped trailing whitespace (ws) |
* and for the first character not to be output (end). |
* and for the first character not to be output (end). |
Line 798 mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int |
|
Line 227 mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int |
|
*end = '\0'; |
*end = '\0'; |
|
|
if (ws) |
if (ws) |
mdoc_pmsg(mdoc, line, (int)(ws-buf), MANDOCERR_EOLNSPACE); |
mandoc_msg(MANDOCERR_SPACE_EOL, mdoc->parse, |
|
line, (int)(ws-buf), NULL); |
|
|
if ('\0' == buf[offs] && ! (MDOC_LITERAL & mdoc->flags)) { |
/* |
mdoc_pmsg(mdoc, line, (int)(c-buf), MANDOCERR_NOBLANKLN); |
* Blank lines are allowed in no-fill mode |
|
* and cancel preceding \c, |
|
* but add a single vertical space elsewhere. |
|
*/ |
|
|
/* |
if (buf[offs] == '\0' && ! (mdoc->flags & MDOC_LITERAL)) { |
* Insert a `sp' in the case of a blank line. Technically, |
switch (mdoc->last->type) { |
* blank lines aren't allowed, but enough manuals assume this |
case ROFFT_TEXT: |
* behaviour that we want to work around it. |
sp = mdoc->last->string; |
*/ |
cp = end = strchr(sp, '\0') - 2; |
if ( ! mdoc_elem_alloc(mdoc, line, offs, MDOC_sp, NULL)) |
if (cp < sp || cp[0] != '\\' || cp[1] != 'c') |
return(0); |
break; |
|
while (cp > sp && cp[-1] == '\\') |
mdoc->next = MDOC_NEXT_SIBLING; |
cp--; |
|
if ((end - cp) % 2) |
return(mdoc_valid_post(mdoc)); |
break; |
|
*end = '\0'; |
|
return 1; |
|
default: |
|
break; |
|
} |
|
mandoc_msg(MANDOCERR_FI_BLANK, mdoc->parse, |
|
line, (int)(c - buf), NULL); |
|
roff_elem_alloc(mdoc, line, offs, ROFF_sp); |
|
mdoc->last->flags |= NODE_VALID | NODE_ENDED; |
|
mdoc->next = ROFF_NEXT_SIBLING; |
|
return 1; |
} |
} |
|
|
if ( ! mdoc_word_alloc(mdoc, line, offs, buf+offs)) |
roff_word_alloc(mdoc, line, offs, buf+offs); |
return(0); |
|
|
|
if (MDOC_LITERAL & mdoc->flags) |
if (mdoc->flags & MDOC_LITERAL) |
return(1); |
return 1; |
|
|
/* |
/* |
* End-of-sentence check. If the last character is an unescaped |
* End-of-sentence check. If the last character is an unescaped |
Line 830 mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int |
|
Line 273 mdoc_ptext(struct mdoc *mdoc, int line, char *buf, int |
|
|
|
assert(buf < end); |
assert(buf < end); |
|
|
if (mandoc_eos(buf+offs, (size_t)(end-buf-offs), 0)) |
if (mandoc_eos(buf+offs, (size_t)(end-buf-offs))) |
mdoc->last->flags |= MDOC_EOS; |
mdoc->last->flags |= NODE_EOS; |
|
|
return(1); |
for (c = buf + offs; c != NULL; c = strchr(c + 1, '.')) { |
|
if (c - buf < offs + 2) |
|
continue; |
|
if (end - c < 3) |
|
break; |
|
if (c[1] != ' ' || |
|
isalnum((unsigned char)c[-2]) == 0 || |
|
isalnum((unsigned char)c[-1]) == 0 || |
|
(c[-2] == 'n' && c[-1] == 'c') || |
|
(c[-2] == 'v' && c[-1] == 's')) |
|
continue; |
|
c += 2; |
|
if (*c == ' ') |
|
c++; |
|
if (*c == ' ') |
|
c++; |
|
if (isupper((unsigned char)(*c))) |
|
mandoc_msg(MANDOCERR_EOS, mdoc->parse, |
|
line, (int)(c - buf), NULL); |
|
} |
|
|
|
return 1; |
} |
} |
|
|
|
|
/* |
/* |
* 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. |
*/ |
*/ |
static int |
static int |
mdoc_pmacro(struct mdoc *mdoc, int ln, char *buf, int offs) |
mdoc_pmacro(struct roff_man *mdoc, int ln, char *buf, int offs) |
{ |
{ |
enum mdoct tok; |
struct roff_node *n; |
int i, sv; |
const char *cp; |
char mac[5]; |
size_t sz; |
struct mdoc_node *n; |
enum roff_tok tok; |
|
int sv; |
|
|
/* Empty post-control lines are ignored. */ |
/* Determine the line macro. */ |
|
|
if ('"' == buf[offs]) { |
|
mdoc_pmsg(mdoc, ln, offs, MANDOCERR_BADCOMMENT); |
|
return(1); |
|
} else if ('\0' == buf[offs]) |
|
return(1); |
|
|
|
sv = offs; |
sv = offs; |
|
tok = TOKEN_NONE; |
/* |
for (sz = 0; sz < 4 && strchr(" \t\\", buf[offs]) == NULL; sz++) |
* Copy the first word into a nil-terminated buffer. |
offs++; |
* Stop copying when a tab, space, or eoln is encountered. |
if (sz == 2 || sz == 3) |
*/ |
tok = roffhash_find(mdoc->mdocmac, buf + sv, sz); |
|
if (tok == TOKEN_NONE) { |
i = 0; |
mandoc_msg(MANDOCERR_MACRO, mdoc->parse, |
while (i < 4 && '\0' != buf[offs] && |
ln, sv, buf + sv - 1); |
' ' != buf[offs] && '\t' != buf[offs]) |
return 1; |
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. */ |
/* Skip a leading escape sequence or tab. */ |
|
|
if ('\t' == buf[offs]) |
switch (buf[offs]) { |
|
case '\\': |
|
cp = buf + offs + 1; |
|
mandoc_escape(&cp, NULL, NULL); |
|
offs = cp - buf; |
|
break; |
|
case '\t': |
offs++; |
offs++; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
/* Jump to the next non-whitespace word. */ |
/* Jump to the next non-whitespace word. */ |
|
|
while (buf[offs] && ' ' == buf[offs]) |
while (buf[offs] == ' ') |
offs++; |
offs++; |
|
|
/* |
/* |
* Trailing whitespace. Note that tabs are allowed to be passed |
* Trailing whitespace. Note that tabs are allowed to be passed |
* into the parser as "text", so we only warn about spaces here. |
* into the parser as "text", so we only warn about spaces here. |
*/ |
*/ |
|
|
if ('\0' == buf[offs] && ' ' == buf[offs - 1]) |
if ('\0' == buf[offs] && ' ' == buf[offs - 1]) |
mdoc_pmsg(mdoc, ln, offs - 1, MANDOCERR_EOLNSPACE); |
mandoc_msg(MANDOCERR_SPACE_EOL, mdoc->parse, |
|
ln, offs - 1, NULL); |
|
|
/* |
/* |
* If an initial macro or a list invocation, divert directly |
* If an initial macro or a list invocation, divert directly |
* into macro processing. |
* 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; |
n = mdoc->last; |
assert(mdoc->last); |
if (n == NULL || tok == MDOC_It || tok == MDOC_El) { |
|
(*mdoc_macro(tok)->fp)(mdoc, tok, ln, sv, &offs, buf); |
/* |
return 1; |
* 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' |
* If a column list contains a non-It macro, assume an implicit |
* context (perhaps opened in the above block or in ptext()), |
* item macro. This can happen one or more times at the |
* then open an `It' block context around the parsed macro. |
* beginning of such a list, intermixed with text lines and |
|
* with nodes generated on the roff level, for example by tbl. |
*/ |
*/ |
|
|
if (MDOC_It == n->tok && MDOC_BLOCK == n->type && |
if ((n->tok == MDOC_Bl && n->type == ROFFT_BODY && |
NULL != n->parent && |
n->end == ENDBODY_NOT && n->norm->Bl.type == LIST_column) || |
MDOC_Bl == n->parent->tok && |
(n->parent != NULL && n->parent->tok == MDOC_Bl && |
LIST_column == n->parent->norm->Bl.type) { |
n->parent->norm->Bl.type == LIST_column)) { |
mdoc->flags |= MDOC_FREECOL; |
mdoc->flags |= MDOC_FREECOL; |
if ( ! mdoc_macro(mdoc, MDOC_It, ln, sv, &sv, buf)) |
(*mdoc_macro(MDOC_It)->fp)(mdoc, MDOC_It, ln, sv, &sv, buf); |
goto err; |
return 1; |
return(1); |
|
} |
} |
|
|
/* Normal processing of a macro. */ |
/* Normal processing of a macro. */ |
|
|
if ( ! mdoc_macro(mdoc, tok, ln, sv, &offs, buf)) |
(*mdoc_macro(tok)->fp)(mdoc, tok, ln, sv, &offs, buf); |
goto err; |
|
|
|
return(1); |
/* In quick mode (for mandocdb), abort after the NAME section. */ |
|
|
err: /* Error out. */ |
if (mdoc->quick && MDOC_Sh == tok && |
|
SEC_NAME != mdoc->last->sec) |
|
return 2; |
|
|
mdoc->flags |= MDOC_HALT; |
return 1; |
return(0); |
|
} |
} |
|
|
enum mdelim |
enum mdelim |
Line 958 mdoc_isdelim(const char *p) |
|
Line 401 mdoc_isdelim(const char *p) |
|
{ |
{ |
|
|
if ('\0' == p[0]) |
if ('\0' == p[0]) |
return(DELIM_NONE); |
return DELIM_NONE; |
|
|
if ('\0' == p[1]) |
if ('\0' == p[1]) |
switch (p[0]) { |
switch (p[0]) { |
case('('): |
case '(': |
/* FALLTHROUGH */ |
case '[': |
case('['): |
return DELIM_OPEN; |
return(DELIM_OPEN); |
case '|': |
case('|'): |
return DELIM_MIDDLE; |
return(DELIM_MIDDLE); |
case '.': |
case('.'): |
case ',': |
/* FALLTHROUGH */ |
case ';': |
case(','): |
case ':': |
/* FALLTHROUGH */ |
case '?': |
case(';'): |
case '!': |
/* FALLTHROUGH */ |
case ')': |
case(':'): |
case ']': |
/* FALLTHROUGH */ |
return DELIM_CLOSE; |
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
return(DELIM_CLOSE); |
|
default: |
default: |
return(DELIM_NONE); |
return DELIM_NONE; |
} |
} |
|
|
if ('\\' != p[0]) |
if ('\\' != p[0]) |
return(DELIM_NONE); |
return DELIM_NONE; |
|
|
if (0 == strcmp(p + 1, ".")) |
if (0 == strcmp(p + 1, ".")) |
return(DELIM_CLOSE); |
return DELIM_CLOSE; |
if (0 == strcmp(p + 1, "fR|\\fP")) |
if (0 == strcmp(p + 1, "fR|\\fP")) |
return(DELIM_MIDDLE); |
return DELIM_MIDDLE; |
|
|
return(DELIM_NONE); |
return DELIM_NONE; |
|
} |
|
|
|
void |
|
mdoc_validate(struct roff_man *mdoc) |
|
{ |
|
|
|
mdoc->last = mdoc->first; |
|
mdoc_node_validate(mdoc); |
|
mdoc_state_reset(mdoc); |
} |
} |