version 1.8, 2009/03/25 21:46:24 |
version 1.151, 2015/04/02 22:48:17 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org> |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2013, 2014, 2015 Ingo Schwarze <schwarze@openbsd.org> |
|
* Copyright (c) 2011 Joerg Sonnenberger <joerg@netbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
|
#include "config.h" |
|
|
|
#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 <stdlib.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <string.h> |
#include <string.h> |
|
|
|
#include "mandoc_aux.h" |
|
#include "mandoc.h" |
|
#include "roff.h" |
|
#include "man.h" |
|
#include "libmandoc.h" |
#include "libman.h" |
#include "libman.h" |
|
|
const char *const __man_macronames[MAN_MAX] = { |
const char *const __man_macronames[MAN_MAX] = { |
"\\\"", "TH", "SH", "SS", |
"br", "TH", "SH", "SS", |
"TP", "LP", "PP", "P", |
"TP", "LP", "PP", "P", |
"IP", "HP", "SM", "SB", |
"IP", "HP", "SM", "SB", |
"BI", "IB", "BR", "RB", |
"BI", "IB", "BR", "RB", |
"R", "B", "I", "IR" |
"R", "B", "I", "IR", |
|
"RI", "sp", "nf", |
|
"fi", "RE", "RS", "DT", |
|
"UC", "PD", "AT", "in", |
|
"ft", "OP", "EX", "EE", |
|
"UR", "UE", "ll" |
}; |
}; |
|
|
const char * const *man_macronames = __man_macronames; |
const char * const *man_macronames = __man_macronames; |
|
|
static struct man_node *man_node_alloc(int, int, enum man_type); |
|
static int man_node_append(struct man *, |
|
struct man_node *); |
|
static int man_ptext(struct man *, int, char *); |
|
static int man_pmacro(struct man *, int, char *); |
|
static void man_free1(struct man *); |
|
static void man_alloc1(struct man *); |
static void man_alloc1(struct man *); |
|
static void man_breakscope(struct man *, int); |
|
static void man_descope(struct man *, int, int); |
|
static void man_free1(struct man *); |
|
static struct roff_node *man_node_alloc(struct man *, int, int, |
|
enum roff_type, int); |
|
static void man_node_append(struct man *, struct roff_node *); |
|
static void man_node_free(struct roff_node *); |
|
static void man_node_unlink(struct man *, struct roff_node *); |
|
static int man_ptext(struct man *, int, char *, int); |
|
static int man_pmacro(struct man *, int, char *, int); |
|
|
|
|
const struct man_node * |
const struct roff_node * |
man_node(const struct man *m) |
man_node(const struct man *man) |
{ |
{ |
|
|
return(MAN_HALT & m->flags ? NULL : m->first); |
return(man->first); |
} |
} |
|
|
|
|
const struct man_meta * |
const struct man_meta * |
man_meta(const struct man *m) |
man_meta(const struct man *man) |
{ |
{ |
|
|
return(MAN_HALT & m->flags ? NULL : &m->meta); |
return(&man->meta); |
} |
} |
|
|
|
|
void |
void |
man_reset(struct man *man) |
man_reset(struct man *man) |
{ |
{ |
Line 69 man_reset(struct man *man) |
|
Line 84 man_reset(struct man *man) |
|
man_alloc1(man); |
man_alloc1(man); |
} |
} |
|
|
|
|
void |
void |
man_free(struct man *man) |
man_free(struct man *man) |
{ |
{ |
|
|
man_free1(man); |
man_free1(man); |
|
|
if (man->htab) |
|
man_hash_free(man->htab); |
|
free(man); |
free(man); |
} |
} |
|
|
|
|
struct man * |
struct man * |
man_alloc(void *data, int pflags, const struct man_cb *cb) |
man_alloc(struct roff *roff, struct mparse *parse, |
|
const char *defos, int quick) |
{ |
{ |
struct man *p; |
struct man *p; |
|
|
p = calloc(1, sizeof(struct man)); |
p = mandoc_calloc(1, sizeof(struct man)); |
if (NULL == p) |
|
err(1, "calloc"); |
|
|
|
man_alloc1(p); |
man_hash_init(); |
|
p->parse = parse; |
|
p->defos = defos; |
|
p->quick = quick; |
|
p->roff = roff; |
|
|
if (cb) |
man_alloc1(p); |
(void)memcpy(&p->cb, cb, sizeof(struct man_cb)); |
|
|
|
p->htab = man_hash_alloc(); |
|
p->data = data; |
|
p->pflags = pflags; |
|
|
|
return(p); |
return(p); |
} |
} |
|
|
|
void |
int |
man_endparse(struct man *man) |
man_endparse(struct man *m) |
|
{ |
{ |
|
|
if (MAN_HALT & m->flags) |
man_macroend(man); |
return(0); |
|
else if (man_macroend(m)) |
|
return(1); |
|
m->flags |= MAN_HALT; |
|
return(0); |
|
} |
} |
|
|
|
|
int |
int |
man_parseln(struct man *m, int ln, char *buf) |
man_parseln(struct man *man, int ln, char *buf, int offs) |
{ |
{ |
|
|
return('.' == *buf ? |
if (man->last->type != ROFFT_EQN || ln > man->last->line) |
man_pmacro(m, ln, buf) : |
man->flags |= MAN_NEWLINE; |
man_ptext(m, ln, buf)); |
|
|
return (roff_getcontrol(man->roff, buf, &offs) ? |
|
man_pmacro(man, ln, buf, offs) : |
|
man_ptext(man, ln, buf, offs)); |
} |
} |
|
|
|
|
static void |
static void |
man_free1(struct man *man) |
man_free1(struct man *man) |
{ |
{ |
|
|
if (man->first) |
if (man->first) |
man_node_freelist(man->first); |
man_node_delete(man, man->first); |
if (man->meta.title) |
free(man->meta.title); |
free(man->meta.title); |
free(man->meta.source); |
if (man->meta.source) |
free(man->meta.date); |
free(man->meta.source); |
free(man->meta.vol); |
if (man->meta.vol) |
free(man->meta.msec); |
free(man->meta.vol); |
|
} |
} |
|
|
|
|
static void |
static void |
man_alloc1(struct man *m) |
man_alloc1(struct man *man) |
{ |
{ |
|
|
bzero(&m->meta, sizeof(struct man_meta)); |
memset(&man->meta, 0, sizeof(struct man_meta)); |
m->flags = 0; |
man->flags = 0; |
m->last = calloc(1, sizeof(struct man_node)); |
man->last = mandoc_calloc(1, sizeof(*man->last)); |
if (NULL == m->last) |
man->first = man->last; |
err(1, "calloc"); |
man->last->type = ROFFT_ROOT; |
m->first = m->last; |
man->last->tok = MAN_MAX; |
m->last->type = MAN_ROOT; |
man->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
|
} |
} |
|
|
|
|
static int |
static void |
man_node_append(struct man *man, struct man_node *p) |
man_node_append(struct man *man, struct roff_node *p) |
{ |
{ |
|
|
assert(man->last); |
assert(man->last); |
assert(man->first); |
assert(man->first); |
assert(MAN_ROOT != p->type); |
assert(p->type != ROFFT_ROOT); |
|
|
switch (man->next) { |
switch (man->next) { |
case (MAN_NEXT_SIBLING): |
case MAN_NEXT_SIBLING: |
man->last->next = p; |
man->last->next = p; |
p->prev = man->last; |
p->prev = man->last; |
p->parent = man->last->parent; |
p->parent = man->last->parent; |
break; |
break; |
case (MAN_NEXT_CHILD): |
case MAN_NEXT_CHILD: |
man->last->child = p; |
man->last->child = p; |
p->parent = man->last; |
p->parent = man->last; |
break; |
break; |
Line 180 man_node_append(struct man *man, struct man_node *p) |
|
Line 179 man_node_append(struct man *man, struct man_node *p) |
|
/* NOTREACHED */ |
/* NOTREACHED */ |
} |
} |
|
|
man->last = p; |
assert(p->parent); |
|
p->parent->nchild++; |
|
|
switch (p->type) { |
switch (p->type) { |
case (MAN_TEXT): |
case ROFFT_BLOCK: |
if ( ! man_valid_post(man)) |
if (p->tok == MAN_SH || p->tok == MAN_SS) |
return(0); |
man->flags &= ~MAN_LITERAL; |
if ( ! man_action_post(man)) |
|
return(0); |
|
break; |
break; |
|
case ROFFT_HEAD: |
|
assert(p->parent->type == ROFFT_BLOCK); |
|
p->parent->head = p; |
|
break; |
|
case ROFFT_BODY: |
|
assert(p->parent->type == ROFFT_BLOCK); |
|
p->parent->body = p; |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
|
|
return(1); |
man->last = p; |
|
|
|
switch (p->type) { |
|
case ROFFT_TBL: |
|
/* FALLTHROUGH */ |
|
case ROFFT_TEXT: |
|
man_valid_post(man); |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
|
|
|
static struct roff_node * |
static struct man_node * |
man_node_alloc(struct man *man, int line, int pos, |
man_node_alloc(int line, int pos, enum man_type type) |
enum roff_type type, int tok) |
{ |
{ |
struct man_node *p; |
struct roff_node *p; |
|
|
if (NULL == (p = calloc(1, sizeof(struct man_node)))) |
p = mandoc_calloc(1, sizeof(*p)); |
err(1, "malloc"); |
|
p->line = line; |
p->line = line; |
p->pos = pos; |
p->pos = pos; |
p->type = type; |
p->type = type; |
|
p->tok = tok; |
|
|
|
if (man->flags & MAN_NEWLINE) |
|
p->flags |= MAN_LINE; |
|
man->flags &= ~MAN_NEWLINE; |
return(p); |
return(p); |
} |
} |
|
|
|
void |
int |
|
man_elem_alloc(struct man *man, int line, int pos, int tok) |
man_elem_alloc(struct man *man, int line, int pos, int tok) |
{ |
{ |
struct man_node *p; |
struct roff_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_ELEM); |
p = man_node_alloc(man, line, pos, ROFFT_ELEM, tok); |
p->tok = tok; |
man_node_append(man, p); |
|
man->next = MAN_NEXT_CHILD; |
return(man_node_append(man, p)); |
|
} |
} |
|
|
|
void |
|
man_head_alloc(struct man *man, int line, int pos, int tok) |
|
{ |
|
struct roff_node *p; |
|
|
int |
p = man_node_alloc(man, line, pos, ROFFT_HEAD, tok); |
man_word_alloc(struct man *man, |
man_node_append(man, p); |
int line, int pos, const char *word) |
man->next = MAN_NEXT_CHILD; |
|
} |
|
|
|
void |
|
man_body_alloc(struct man *man, int line, int pos, int tok) |
{ |
{ |
struct man_node *p; |
struct roff_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_TEXT); |
p = man_node_alloc(man, line, pos, ROFFT_BODY, tok); |
if (NULL == (p->string = strdup(word))) |
man_node_append(man, p); |
err(1, "strdup"); |
man->next = MAN_NEXT_CHILD; |
|
} |
|
|
return(man_node_append(man, p)); |
void |
|
man_block_alloc(struct man *man, int line, int pos, int tok) |
|
{ |
|
struct roff_node *p; |
|
|
|
p = man_node_alloc(man, line, pos, ROFFT_BLOCK, tok); |
|
man_node_append(man, p); |
|
man->next = MAN_NEXT_CHILD; |
} |
} |
|
|
|
void |
|
man_word_alloc(struct man *man, int line, int pos, const char *word) |
|
{ |
|
struct roff_node *n; |
|
|
|
n = man_node_alloc(man, line, pos, ROFFT_TEXT, MAN_MAX); |
|
n->string = roff_strdup(man->roff, word); |
|
man_node_append(man, n); |
|
man->next = MAN_NEXT_SIBLING; |
|
} |
|
|
void |
void |
man_node_free(struct man_node *p) |
man_word_append(struct man *man, const char *word) |
{ |
{ |
|
struct roff_node *n; |
|
char *addstr, *newstr; |
|
|
if (p->string) |
n = man->last; |
free(p->string); |
addstr = roff_strdup(man->roff, word); |
free(p); |
mandoc_asprintf(&newstr, "%s %s", n->string, addstr); |
|
free(addstr); |
|
free(n->string); |
|
n->string = newstr; |
|
man->next = MAN_NEXT_SIBLING; |
} |
} |
|
|
|
/* |
|
* Free all of the resources held by a node. This does NOT unlink a |
|
* node from its context; for that, see man_node_unlink(). |
|
*/ |
|
static void |
|
man_node_free(struct roff_node *p) |
|
{ |
|
|
|
free(p->string); |
|
free(p); |
|
} |
|
|
void |
void |
man_node_freelist(struct man_node *p) |
man_node_delete(struct man *man, struct roff_node *p) |
{ |
{ |
|
|
if (p->child) |
while (p->child) |
man_node_freelist(p->child); |
man_node_delete(man, p->child); |
if (p->next) |
|
man_node_freelist(p->next); |
|
|
|
|
man_node_unlink(man, p); |
man_node_free(p); |
man_node_free(p); |
} |
} |
|
|
|
void |
|
man_addeqn(struct man *man, const struct eqn *ep) |
|
{ |
|
struct roff_node *n; |
|
|
static int |
n = man_node_alloc(man, ep->ln, ep->pos, ROFFT_EQN, MAN_MAX); |
man_ptext(struct man *m, int line, char *buf) |
n->eqn = ep; |
|
if (ep->ln > man->last->line) |
|
n->flags |= MAN_LINE; |
|
man_node_append(man, n); |
|
man->next = MAN_NEXT_SIBLING; |
|
man_descope(man, ep->ln, ep->pos); |
|
} |
|
|
|
void |
|
man_addspan(struct man *man, const struct tbl_span *sp) |
{ |
{ |
|
struct roff_node *n; |
|
|
if ( ! man_word_alloc(m, line, 0, buf)) |
man_breakscope(man, MAN_MAX); |
return(0); |
n = man_node_alloc(man, sp->line, 0, ROFFT_TBL, MAN_MAX); |
m->next = MAN_NEXT_SIBLING; |
n->span = sp; |
return(1); |
man_node_append(man, n); |
|
man->next = MAN_NEXT_SIBLING; |
|
man_descope(man, sp->line, 0); |
} |
} |
|
|
|
static void |
|
man_descope(struct man *man, int line, int offs) |
|
{ |
|
/* |
|
* Co-ordinate what happens with having a next-line scope open: |
|
* first close out the element scope (if applicable), then close |
|
* out the block scope (also if applicable). |
|
*/ |
|
|
int |
if (man->flags & MAN_ELINE) { |
man_pmacro(struct man *m, int ln, char *buf) |
man->flags &= ~MAN_ELINE; |
|
man_unscope(man, man->last->parent); |
|
} |
|
if ( ! (man->flags & MAN_BLINE)) |
|
return; |
|
man->flags &= ~MAN_BLINE; |
|
man_unscope(man, man->last->parent); |
|
man_body_alloc(man, line, offs, man->last->tok); |
|
} |
|
|
|
static int |
|
man_ptext(struct man *man, int line, char *buf, int offs) |
{ |
{ |
int i, c; |
int i; |
char mac[5]; |
|
|
|
/* Comments and empties are quickly ignored. */ |
/* Literal free-form text whitespace is preserved. */ |
|
|
if (0 == buf[1]) |
if (man->flags & MAN_LITERAL) { |
|
man_word_alloc(man, line, offs, buf + offs); |
|
man_descope(man, line, offs); |
return(1); |
return(1); |
|
} |
|
|
if (' ' == buf[1]) { |
for (i = offs; buf[i] == ' '; i++) |
i = 2; |
/* Skip leading whitespace. */ ; |
while (buf[i] && ' ' == buf[i]) |
|
i++; |
/* |
if (0 == buf[i]) |
* Blank lines are ignored right after headings |
return(1); |
* but add a single vertical space elsewhere. |
return(man_vwarn(m, ln, 0, "invalid syntax")); |
*/ |
|
|
|
if (buf[i] == '\0') { |
|
/* Allocate a blank entry. */ |
|
if (man->last->tok != MAN_SH && |
|
man->last->tok != MAN_SS) { |
|
man_elem_alloc(man, line, offs, MAN_sp); |
|
man->next = MAN_NEXT_SIBLING; |
|
} |
|
return(1); |
} |
} |
|
|
if (buf[1] && '\\' == buf[1]) |
/* |
if (buf[2] && '\"' == buf[2]) |
* Warn if the last un-escaped character is whitespace. Then |
return(1); |
* strip away the remaining spaces (tabs stay!). |
|
*/ |
|
|
/* Copy the first word into a nil-terminated buffer. */ |
i = (int)strlen(buf); |
|
assert(i); |
|
|
for (i = 1; i < 5; i++) { |
if (' ' == buf[i - 1] || '\t' == buf[i - 1]) { |
if (0 == (mac[i - 1] = buf[i])) |
if (i > 1 && '\\' != buf[i - 2]) |
break; |
mandoc_msg(MANDOCERR_SPACE_EOL, man->parse, |
else if (' ' == buf[i]) |
line, i - 1, NULL); |
break; |
|
|
for (--i; i && ' ' == buf[i]; i--) |
|
/* Spin back to non-space. */ ; |
|
|
|
/* Jump ahead of escaped whitespace. */ |
|
i += '\\' == buf[i] ? 2 : 1; |
|
|
|
buf[i] = '\0'; |
} |
} |
|
man_word_alloc(man, line, offs, buf + offs); |
|
|
mac[i - 1] = 0; |
/* |
|
* 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. |
|
*/ |
|
|
if (i == 5 || i <= 1) { |
assert(i); |
if ( ! (MAN_IGN_MACRO & m->pflags)) { |
if (mandoc_eos(buf, (size_t)i)) |
(void)man_verr(m, ln, 1, |
man->last->flags |= MAN_EOS; |
"ill-formed macro: %s", mac); |
|
goto err; |
man_descope(man, line, offs); |
} |
return(1); |
if ( ! man_vwarn(m, ln, 1, "ill-formed macro: %s", mac)) |
} |
goto err; |
|
|
static int |
|
man_pmacro(struct man *man, int ln, char *buf, int offs) |
|
{ |
|
struct roff_node *n; |
|
const char *cp; |
|
int tok; |
|
int i, ppos; |
|
int bline; |
|
char mac[5]; |
|
|
|
ppos = offs; |
|
|
|
/* |
|
* Copy the first word into a nil-terminated buffer. |
|
* Stop when a space, tab, escape, or eoln is encountered. |
|
*/ |
|
|
|
i = 0; |
|
while (i < 4 && strchr(" \t\\", buf[offs]) == NULL) |
|
mac[i++] = buf[offs++]; |
|
|
|
mac[i] = '\0'; |
|
|
|
tok = (i > 0 && i < 4) ? man_hash_find(mac) : MAN_MAX; |
|
|
|
if (tok == MAN_MAX) { |
|
mandoc_msg(MANDOCERR_MACRO, man->parse, |
|
ln, ppos, buf + ppos - 1); |
return(1); |
return(1); |
} |
} |
|
|
if (MAN_MAX == (c = man_hash_find(m->htab, mac))) { |
/* Skip a leading escape sequence or tab. */ |
if ( ! (MAN_IGN_MACRO & m->pflags)) { |
|
(void)man_verr(m, ln, 1, |
switch (buf[offs]) { |
"unknown macro: %s", mac); |
case '\\': |
goto err; |
cp = buf + offs + 1; |
} |
mandoc_escape(&cp, NULL, NULL); |
if ( ! man_vwarn(m, ln, 1, "unknown macro: %s", mac)) |
offs = cp - buf; |
goto err; |
break; |
return(1); |
case '\t': |
|
offs++; |
|
break; |
|
default: |
|
break; |
} |
} |
|
|
/* The macro is sane. Jump to the next word. */ |
/* Jump to the next non-whitespace word. */ |
|
|
while (buf[i] && ' ' == buf[i]) |
while (buf[offs] && buf[offs] == ' ') |
i++; |
offs++; |
|
|
/* Begin recursive parse sequence. */ |
/* |
|
* Trailing whitespace. Note that tabs are allowed to be passed |
|
* into the parser as "text", so we only warn about spaces here. |
|
*/ |
|
|
if ( ! man_macro(m, c, ln, 1, &i, buf)) |
if (buf[offs] == '\0' && buf[offs - 1] == ' ') |
goto err; |
mandoc_msg(MANDOCERR_SPACE_EOL, man->parse, |
|
ln, offs - 1, NULL); |
|
|
return(1); |
/* |
|
* Some macros break next-line scopes; otherwise, remember |
|
* whether we are in next-line scope for a block head. |
|
*/ |
|
|
err: /* Error out. */ |
man_breakscope(man, tok); |
|
bline = man->flags & MAN_BLINE; |
|
|
m->flags |= MAN_HALT; |
/* Call to handler... */ |
return(0); |
|
|
assert(man_macros[tok].fp); |
|
(*man_macros[tok].fp)(man, tok, ln, ppos, &offs, buf); |
|
|
|
/* In quick mode (for mandocdb), abort after the NAME section. */ |
|
|
|
if (man->quick && tok == MAN_SH) { |
|
n = man->last; |
|
if (n->type == ROFFT_BODY && |
|
strcmp(n->prev->child->string, "NAME")) |
|
return(2); |
|
} |
|
|
|
/* |
|
* If we are in a next-line scope for a block head, |
|
* close it out now and switch to the body, |
|
* unless the next-line scope is allowed to continue. |
|
*/ |
|
|
|
if ( ! bline || man->flags & MAN_ELINE || |
|
man_macros[tok].flags & MAN_NSCOPED) |
|
return(1); |
|
|
|
assert(man->flags & MAN_BLINE); |
|
man->flags &= ~MAN_BLINE; |
|
|
|
man_unscope(man, man->last->parent); |
|
man_body_alloc(man, ln, ppos, man->last->tok); |
|
return(1); |
} |
} |
|
|
|
void |
|
man_breakscope(struct man *man, int tok) |
|
{ |
|
struct roff_node *n; |
|
|
int |
/* |
man_verr(struct man *man, int ln, int pos, const char *fmt, ...) |
* An element next line scope is open, |
|
* and the new macro is not allowed inside elements. |
|
* Delete the element that is being broken. |
|
*/ |
|
|
|
if (man->flags & MAN_ELINE && (tok == MAN_MAX || |
|
! (man_macros[tok].flags & MAN_NSCOPED))) { |
|
n = man->last; |
|
assert(n->type != ROFFT_TEXT); |
|
if (man_macros[n->tok].flags & MAN_NSCOPED) |
|
n = n->parent; |
|
|
|
mandoc_vmsg(MANDOCERR_BLK_LINE, man->parse, |
|
n->line, n->pos, "%s breaks %s", |
|
tok == MAN_MAX ? "TS" : man_macronames[tok], |
|
man_macronames[n->tok]); |
|
|
|
man_node_delete(man, n); |
|
man->flags &= ~MAN_ELINE; |
|
} |
|
|
|
/* |
|
* A block header next line scope is open, |
|
* and the new macro is not allowed inside block headers. |
|
* Delete the block that is being broken. |
|
*/ |
|
|
|
if (man->flags & MAN_BLINE && (tok == MAN_MAX || |
|
man_macros[tok].flags & MAN_BSCOPE)) { |
|
n = man->last; |
|
if (n->type == ROFFT_TEXT) |
|
n = n->parent; |
|
if ( ! (man_macros[n->tok].flags & MAN_BSCOPE)) |
|
n = n->parent; |
|
|
|
assert(n->type == ROFFT_HEAD); |
|
n = n->parent; |
|
assert(n->type == ROFFT_BLOCK); |
|
assert(man_macros[n->tok].flags & MAN_SCOPED); |
|
|
|
mandoc_vmsg(MANDOCERR_BLK_LINE, man->parse, |
|
n->line, n->pos, "%s breaks %s", |
|
tok == MAN_MAX ? "TS" : man_macronames[tok], |
|
man_macronames[n->tok]); |
|
|
|
man_node_delete(man, n); |
|
man->flags &= ~MAN_BLINE; |
|
} |
|
} |
|
|
|
/* |
|
* Unlink a node from its context. If "man" is provided, the last parse |
|
* point will also be adjusted accordingly. |
|
*/ |
|
static void |
|
man_node_unlink(struct man *man, struct roff_node *n) |
{ |
{ |
char buf[256]; |
|
va_list ap; |
|
|
|
if (NULL == man->cb.man_err) |
/* Adjust siblings. */ |
return(0); |
|
|
|
va_start(ap, fmt); |
if (n->prev) |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
n->prev->next = n->next; |
va_end(ap); |
if (n->next) |
return((*man->cb.man_err)(man->data, ln, pos, buf)); |
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; |
|
} |
|
|
|
/* Adjust parse point, if applicable. */ |
|
|
|
if (man && man->last == n) { |
|
/*XXX: this can occur when bailing from validation. */ |
|
/*assert(NULL == n->next);*/ |
|
if (n->prev) { |
|
man->last = n->prev; |
|
man->next = MAN_NEXT_SIBLING; |
|
} else { |
|
man->last = n->parent; |
|
man->next = MAN_NEXT_CHILD; |
|
} |
|
} |
|
|
|
if (man && man->first == n) |
|
man->first = NULL; |
} |
} |
|
|
|
const struct mparse * |
|
man_mparse(const struct man *man) |
|
{ |
|
|
int |
assert(man && man->parse); |
man_vwarn(struct man *man, int ln, int pos, const char *fmt, ...) |
return(man->parse); |
|
} |
|
|
|
void |
|
man_deroff(char **dest, const struct roff_node *n) |
{ |
{ |
char buf[256]; |
char *cp; |
va_list ap; |
size_t sz; |
|
|
if (NULL == man->cb.man_warn) |
if (n->type != ROFFT_TEXT) { |
return(0); |
for (n = n->child; n; n = n->next) |
|
man_deroff(dest, n); |
|
return; |
|
} |
|
|
va_start(ap, fmt); |
/* Skip leading whitespace and escape sequences. */ |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
|
va_end(ap); |
|
return((*man->cb.man_warn)(man->data, ln, pos, buf)); |
|
} |
|
|
|
|
cp = n->string; |
|
while ('\0' != *cp) { |
|
if ('\\' == *cp) { |
|
cp++; |
|
mandoc_escape((const char **)&cp, NULL, NULL); |
|
} else if (isspace((unsigned char)*cp)) |
|
cp++; |
|
else |
|
break; |
|
} |
|
|
|
/* Skip trailing whitespace. */ |
|
|
|
for (sz = strlen(cp); sz; sz--) |
|
if (0 == isspace((unsigned char)cp[sz-1])) |
|
break; |
|
|
|
/* Skip empty strings. */ |
|
|
|
if (0 == sz) |
|
return; |
|
|
|
if (NULL == *dest) { |
|
*dest = mandoc_strndup(cp, sz); |
|
return; |
|
} |
|
|
|
mandoc_asprintf(&cp, "%s %*s", *dest, (int)sz, cp); |
|
free(*dest); |
|
*dest = cp; |
|
} |