version 1.53, 2010/03/23 21:50:43 |
version 1.97, 2011/01/12 10:43:22 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* |
* |
* 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 |
|
|
#include <sys/types.h> |
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.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.h" |
#include "libman.h" |
#include "libman.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
|
|
const char *const __man_merrnames[WERRMAX] = { |
|
"invalid character", /* WNPRINT */ |
|
"invalid manual section", /* WMSEC */ |
|
"invalid date format", /* WDATE */ |
|
"scope of prior line violated", /* WLNSCOPE */ |
|
"over-zealous prior line scope violation", /* WLNSCOPE2 */ |
|
"trailing whitespace", /* WTSPACE */ |
|
"unterminated quoted parameter", /* WTQUOTE */ |
|
"document has no body", /* WNODATA */ |
|
"document has no title/section", /* WNOTITLE */ |
|
"invalid escape sequence", /* WESCAPE */ |
|
"invalid number format", /* WNUMFMT */ |
|
"expected block head arguments", /* WHEADARGS */ |
|
"expected block body arguments", /* WBODYARGS */ |
|
"expected empty block head", /* WNHEADARGS */ |
|
"ill-formed macro", /* WMACROFORM */ |
|
"scope open on exit", /* WEXITSCOPE */ |
|
"no scope context", /* WNOSCOPE */ |
|
"literal context already open", /* WOLITERAL */ |
|
"no literal context open" /* WNLITERAL */ |
|
}; |
|
|
|
const char *const __man_macronames[MAN_MAX] = { |
const char *const __man_macronames[MAN_MAX] = { |
"br", "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", "na", "i", "sp", |
"RI", "na", "sp", "nf", |
"nf", "fi", "r", "RE", |
"fi", "RE", "RS", "DT", |
"RS", "DT", "UC", "PD", |
"UC", "PD", "AT", "in", |
"Sp", "Vb", "Ve", |
"ft" |
}; |
}; |
|
|
const char * const *man_macronames = __man_macronames; |
const char * const *man_macronames = __man_macronames; |
|
|
static struct man_node *man_node_alloc(int, int, |
static struct man_node *man_node_alloc(struct man *, int, int, |
enum man_type, enum mant); |
enum man_type, enum mant); |
static int man_node_append(struct man *, |
static int man_node_append(struct man *, |
struct man_node *); |
struct man_node *); |
static int man_ptext(struct man *, int, char *); |
static int man_span_alloc(struct man *, |
static int man_pmacro(struct man *, int, char *); |
const struct tbl_span *); |
|
static void man_node_free(struct man_node *); |
|
static void man_node_unlink(struct man *, |
|
struct man_node *); |
|
static int man_ptext(struct man *, int, char *, int); |
|
static int man_pmacro(struct man *, int, char *, int); |
static void man_free1(struct man *); |
static void man_free1(struct man *); |
static void man_alloc1(struct man *); |
static void man_alloc1(struct man *); |
static int pstring(struct man *, int, int, |
static int man_descope(struct man *, int, int); |
const char *, size_t); |
|
static int macrowarn(struct man *, int, const char *); |
|
|
|
|
|
const struct man_node * |
const struct man_node * |
man_node(const struct man *m) |
man_node(const struct man *m) |
{ |
{ |
|
|
return(MAN_HALT & m->flags ? NULL : m->first); |
assert( ! (MAN_HALT & m->flags)); |
|
return(m->first); |
} |
} |
|
|
|
|
Line 91 const struct man_meta * |
|
Line 73 const struct man_meta * |
|
man_meta(const struct man *m) |
man_meta(const struct man *m) |
{ |
{ |
|
|
return(MAN_HALT & m->flags ? NULL : &m->meta); |
assert( ! (MAN_HALT & m->flags)); |
|
return(&m->meta); |
} |
} |
|
|
|
|
Line 114 man_free(struct man *man) |
|
Line 97 man_free(struct man *man) |
|
|
|
|
|
struct man * |
struct man * |
man_alloc(void *data, int pflags, const struct man_cb *cb) |
man_alloc(struct regset *regs, void *data, mandocmsg msg) |
{ |
{ |
struct man *p; |
struct man *p; |
|
|
p = mandoc_calloc(1, sizeof(struct man)); |
p = mandoc_calloc(1, sizeof(struct man)); |
|
|
if (cb) |
|
memcpy(&p->cb, cb, sizeof(struct man_cb)); |
|
|
|
man_hash_init(); |
man_hash_init(); |
p->data = data; |
p->data = data; |
p->pflags = pflags; |
p->msg = msg; |
|
p->regs = regs; |
|
|
man_alloc1(p); |
man_alloc1(p); |
return(p); |
return(p); |
|
|
man_endparse(struct man *m) |
man_endparse(struct man *m) |
{ |
{ |
|
|
if (MAN_HALT & m->flags) |
assert( ! (MAN_HALT & m->flags)); |
return(0); |
if (man_macroend(m)) |
else if (man_macroend(m)) |
|
return(1); |
return(1); |
m->flags |= MAN_HALT; |
m->flags |= MAN_HALT; |
return(0); |
return(0); |
Line 146 man_endparse(struct man *m) |
|
Line 126 man_endparse(struct man *m) |
|
|
|
|
|
int |
int |
man_parseln(struct man *m, int ln, char *buf) |
man_parseln(struct man *m, int ln, char *buf, int offs) |
{ |
{ |
|
|
return('.' == *buf ? |
m->flags |= MAN_NEWLINE; |
man_pmacro(m, ln, buf) : |
|
man_ptext(m, ln, buf)); |
assert( ! (MAN_HALT & m->flags)); |
|
return(('.' == buf[offs] || '\'' == buf[offs]) ? |
|
man_pmacro(m, ln, buf, offs) : |
|
man_ptext(m, ln, buf, offs)); |
} |
} |
|
|
|
|
Line 160 man_free1(struct man *man) |
|
Line 143 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) |
if (man->meta.title) |
free(man->meta.title); |
free(man->meta.title); |
if (man->meta.source) |
if (man->meta.source) |
free(man->meta.source); |
free(man->meta.source); |
|
if (man->meta.rawdate) |
|
free(man->meta.rawdate); |
if (man->meta.vol) |
if (man->meta.vol) |
free(man->meta.vol); |
free(man->meta.vol); |
|
if (man->meta.msec) |
|
free(man->meta.msec); |
} |
} |
|
|
|
|
Line 179 man_alloc1(struct man *m) |
|
Line 166 man_alloc1(struct man *m) |
|
m->last = mandoc_calloc(1, sizeof(struct man_node)); |
m->last = mandoc_calloc(1, sizeof(struct man_node)); |
m->first = m->last; |
m->first = m->last; |
m->last->type = MAN_ROOT; |
m->last->type = MAN_ROOT; |
|
m->last->tok = MAN_MAX; |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
} |
} |
|
|
Line 206 man_node_append(struct man *man, struct man_node *p) |
|
Line 194 man_node_append(struct man *man, struct man_node *p) |
|
/* NOTREACHED */ |
/* NOTREACHED */ |
} |
} |
|
|
|
assert(p->parent); |
p->parent->nchild++; |
p->parent->nchild++; |
|
|
if ( ! man_valid_pre(man, p)) |
if ( ! man_valid_pre(man, p)) |
Line 227 man_node_append(struct man *man, struct man_node *p) |
|
Line 216 man_node_append(struct man *man, struct man_node *p) |
|
man->last = p; |
man->last = p; |
|
|
switch (p->type) { |
switch (p->type) { |
|
case (MAN_TBL): |
|
/* FALLTHROUGH */ |
case (MAN_TEXT): |
case (MAN_TEXT): |
if ( ! man_valid_post(man)) |
if ( ! man_valid_post(man)) |
return(0); |
return(0); |
if ( ! man_action_post(man)) |
|
return(0); |
|
break; |
break; |
default: |
default: |
break; |
break; |
Line 242 man_node_append(struct man *man, struct man_node *p) |
|
Line 231 man_node_append(struct man *man, struct man_node *p) |
|
|
|
|
|
static struct man_node * |
static struct man_node * |
man_node_alloc(int line, int pos, enum man_type type, enum mant tok) |
man_node_alloc(struct man *m, int line, int pos, |
|
enum man_type type, enum mant tok) |
{ |
{ |
struct man_node *p; |
struct man_node *p; |
|
|
Line 251 man_node_alloc(int line, int pos, enum man_type type, |
|
Line 241 man_node_alloc(int line, int pos, enum man_type type, |
|
p->pos = pos; |
p->pos = pos; |
p->type = type; |
p->type = type; |
p->tok = tok; |
p->tok = tok; |
|
|
|
if (MAN_NEWLINE & m->flags) |
|
p->flags |= MAN_LINE; |
|
m->flags &= ~MAN_NEWLINE; |
return(p); |
return(p); |
} |
} |
|
|
Line 260 man_elem_alloc(struct man *m, int line, int pos, enum |
|
Line 254 man_elem_alloc(struct man *m, int line, int pos, enum |
|
{ |
{ |
struct man_node *p; |
struct man_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_ELEM, tok); |
p = man_node_alloc(m, line, pos, MAN_ELEM, tok); |
if ( ! man_node_append(m, p)) |
if ( ! man_node_append(m, p)) |
return(0); |
return(0); |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
Line 273 man_head_alloc(struct man *m, int line, int pos, enum |
|
Line 267 man_head_alloc(struct man *m, int line, int pos, enum |
|
{ |
{ |
struct man_node *p; |
struct man_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_HEAD, tok); |
p = man_node_alloc(m, line, pos, MAN_HEAD, tok); |
if ( ! man_node_append(m, p)) |
if ( ! man_node_append(m, p)) |
return(0); |
return(0); |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
Line 286 man_body_alloc(struct man *m, int line, int pos, enum |
|
Line 280 man_body_alloc(struct man *m, int line, int pos, enum |
|
{ |
{ |
struct man_node *p; |
struct man_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_BODY, tok); |
p = man_node_alloc(m, line, pos, MAN_BODY, tok); |
if ( ! man_node_append(m, p)) |
if ( ! man_node_append(m, p)) |
return(0); |
return(0); |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
Line 299 man_block_alloc(struct man *m, int line, int pos, enum |
|
Line 293 man_block_alloc(struct man *m, int line, int pos, enum |
|
{ |
{ |
struct man_node *p; |
struct man_node *p; |
|
|
p = man_node_alloc(line, pos, MAN_BLOCK, tok); |
p = man_node_alloc(m, line, pos, MAN_BLOCK, tok); |
if ( ! man_node_append(m, p)) |
if ( ! man_node_append(m, p)) |
return(0); |
return(0); |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
return(1); |
return(1); |
} |
} |
|
|
|
|
static int |
static int |
pstring(struct man *m, int line, int pos, |
man_span_alloc(struct man *m, const struct tbl_span *span) |
const char *p, size_t len) |
|
{ |
{ |
struct man_node *n; |
struct man_node *n; |
size_t sv; |
|
|
|
n = man_node_alloc(line, pos, MAN_TEXT, MAN_MAX); |
/* FIXME: grab from span */ |
n->string = mandoc_malloc(len + 1); |
n = man_node_alloc(m, 0, 0, MAN_TBL, MAN_MAX); |
sv = strlcpy(n->string, p, len + 1); |
n->span = span; |
|
|
/* Prohibit truncation. */ |
|
assert(sv < len + 1); |
|
|
|
if ( ! man_node_append(m, n)) |
if ( ! man_node_append(m, n)) |
return(0); |
return(0); |
|
|
m->next = MAN_NEXT_SIBLING; |
m->next = MAN_NEXT_SIBLING; |
return(1); |
return(1); |
} |
} |
|
|
|
|
int |
int |
man_word_alloc(struct man *m, int line, int pos, const char *word) |
man_word_alloc(struct man *m, int line, int pos, const char *word) |
{ |
{ |
|
struct man_node *n; |
|
size_t sv, len; |
|
|
return(pstring(m, line, pos, word, strlen(word))); |
len = strlen(word); |
|
|
|
n = man_node_alloc(m, line, pos, MAN_TEXT, MAN_MAX); |
|
n->string = mandoc_malloc(len + 1); |
|
sv = strlcpy(n->string, word, len + 1); |
|
|
|
/* Prohibit truncation. */ |
|
assert(sv < len + 1); |
|
|
|
if ( ! man_node_append(m, n)) |
|
return(0); |
|
|
|
m->next = MAN_NEXT_SIBLING; |
|
return(1); |
} |
} |
|
|
|
|
void |
/* |
|
* 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 man_node *p) |
man_node_free(struct man_node *p) |
{ |
{ |
|
|
if (p->string) |
if (p->string) |
free(p->string); |
free(p->string); |
if (p->parent) |
|
p->parent->nchild--; |
|
free(p); |
free(p); |
} |
} |
|
|
|
|
void |
void |
man_node_freelist(struct man_node *p) |
man_node_delete(struct man *m, struct man_node *p) |
{ |
{ |
struct man_node *n; |
|
|
|
if (p->child) |
while (p->child) |
man_node_freelist(p->child); |
man_node_delete(m, p->child); |
assert(0 == p->nchild); |
|
n = p->next; |
man_node_unlink(m, p); |
man_node_free(p); |
man_node_free(p); |
if (n) |
|
man_node_freelist(n); |
|
} |
} |
|
|
|
|
|
int |
|
man_addspan(struct man *m, const struct tbl_span *sp) |
|
{ |
|
|
|
assert( ! (MAN_HALT & m->flags)); |
|
if ( ! man_span_alloc(m, sp)) |
|
return(0); |
|
return(man_descope(m, 0, 0)); |
|
} |
|
|
static int |
static int |
man_ptext(struct man *m, int line, char *buf) |
man_descope(struct man *m, int line, int offs) |
{ |
{ |
int i, j; |
/* |
char sv; |
* 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). |
|
*/ |
|
|
|
if (MAN_ELINE & m->flags) { |
|
m->flags &= ~MAN_ELINE; |
|
if ( ! man_unscope(m, m->last->parent, MANDOCERR_MAX)) |
|
return(0); |
|
} |
|
|
|
if ( ! (MAN_BLINE & m->flags)) |
|
return(1); |
|
m->flags &= ~MAN_BLINE; |
|
|
|
if ( ! man_unscope(m, m->last->parent, MANDOCERR_MAX)) |
|
return(0); |
|
return(man_body_alloc(m, line, offs, m->last->tok)); |
|
} |
|
|
|
|
|
static int |
|
man_ptext(struct man *m, int line, char *buf, int offs) |
|
{ |
|
int i; |
|
|
|
/* Ignore bogus comments. */ |
|
|
|
if ('\\' == buf[offs] && |
|
'.' == buf[offs + 1] && |
|
'"' == buf[offs + 2]) { |
|
man_pmsg(m, line, offs, MANDOCERR_BADCOMMENT); |
|
return(1); |
|
} |
|
|
/* Literal free-form text whitespace is preserved. */ |
/* Literal free-form text whitespace is preserved. */ |
|
|
if (MAN_LITERAL & m->flags) { |
if (MAN_LITERAL & m->flags) { |
if ( ! man_word_alloc(m, line, 0, buf)) |
if ( ! man_word_alloc(m, line, offs, buf + offs)) |
return(0); |
return(0); |
goto descope; |
return(man_descope(m, line, offs)); |
} |
} |
|
|
/* First de-chunk and allocate words. */ |
/* Pump blank lines directly into the backend. */ |
|
|
for (i = 0; ' ' == buf[i]; i++) |
for (i = offs; ' ' == buf[i]; i++) |
/* Skip leading whitespace. */ ; |
/* Skip leading whitespace. */ ; |
|
|
if ('\0' == buf[i]) { |
if ('\0' == buf[i]) { |
/* Trailing whitespace? */ |
/* Allocate a blank entry. */ |
if (i && ' ' == buf[i - 1]) |
if ( ! man_word_alloc(m, line, offs, "")) |
if ( ! man_pwarn(m, line, i - 1, WTSPACE)) |
|
return(0); |
|
if ( ! pstring(m, line, 0, &buf[i], 0)) |
|
return(0); |
return(0); |
goto descope; |
return(man_descope(m, line, offs)); |
} |
} |
|
|
for (j = i; buf[i]; i++) { |
/* |
if (' ' != buf[i]) |
* Warn if the last un-escaped character is whitespace. Then |
continue; |
* strip away the remaining spaces (tabs stay!). |
|
*/ |
|
|
/* Escaped whitespace. */ |
i = (int)strlen(buf); |
if (i && ' ' == buf[i] && '\\' == buf[i - 1]) |
assert(i); |
continue; |
|
|
|
sv = buf[i]; |
if (' ' == buf[i - 1] || '\t' == buf[i - 1]) { |
buf[i++] = '\0'; |
if (i > 1 && '\\' != buf[i - 2]) |
|
man_pmsg(m, line, i - 1, MANDOCERR_EOLNSPACE); |
|
|
if ( ! pstring(m, line, j, &buf[j], (size_t)(i - j))) |
for (--i; i && ' ' == buf[i]; i--) |
return(0); |
/* Spin back to non-space. */ ; |
|
|
/* Trailing whitespace? Check at overwritten byte. */ |
/* Jump ahead of escaped whitespace. */ |
|
i += '\\' == buf[i] ? 2 : 1; |
|
|
if (' ' == sv && '\0' == buf[i]) |
buf[i] = '\0'; |
if ( ! man_pwarn(m, line, i - 1, WTSPACE)) |
|
return(0); |
|
|
|
for ( ; ' ' == buf[i]; i++) |
|
/* Skip trailing whitespace. */ ; |
|
|
|
j = i; |
|
|
|
/* Trailing whitespace? */ |
|
|
|
if (' ' == buf[i - 1] && '\0' == buf[i]) |
|
if ( ! man_pwarn(m, line, i - 1, WTSPACE)) |
|
return(0); |
|
|
|
if ('\0' == buf[i]) |
|
break; |
|
} |
} |
|
|
if (j != i && ! pstring(m, line, j, &buf[j], (size_t)(i - j))) |
if ( ! man_word_alloc(m, line, offs, buf + offs)) |
return(0); |
return(0); |
|
|
descope: |
|
|
|
/* |
/* |
* Co-ordinate what happens with having a next-line scope open: |
* End-of-sentence check. If the last character is an unescaped |
* first close out the element scope (if applicable), then close |
* EOS character, then flag the node as being the end of a |
* out the block scope (also if applicable). |
* sentence. The front-end will know how to interpret this. |
*/ |
*/ |
|
|
if (MAN_ELINE & m->flags) { |
assert(i); |
m->flags &= ~MAN_ELINE; |
if (mandoc_eos(buf, (size_t)i, 0)) |
if ( ! man_unscope(m, m->last->parent)) |
m->last->flags |= MAN_EOS; |
return(0); |
|
} |
|
|
|
if ( ! (MAN_BLINE & m->flags)) |
return(man_descope(m, line, offs)); |
return(1); |
|
m->flags &= ~MAN_BLINE; |
|
|
|
if ( ! man_unscope(m, m->last->parent)) |
|
return(0); |
|
return(man_body_alloc(m, line, 0, m->last->tok)); |
|
} |
} |
|
|
|
|
static int |
static int |
macrowarn(struct man *m, int ln, const char *buf) |
man_pmacro(struct man *m, int ln, char *buf, int offs) |
{ |
{ |
if ( ! (MAN_IGN_MACRO & m->pflags)) |
int i, j, ppos; |
return(man_verr(m, ln, 0, |
|
"unknown macro: %s%s", |
|
buf, strlen(buf) > 3 ? "..." : "")); |
|
return(man_vwarn(m, ln, 0, "unknown macro: %s%s", |
|
buf, strlen(buf) > 3 ? "..." : "")); |
|
} |
|
|
|
|
|
int |
|
man_pmacro(struct man *m, int ln, char *buf) |
|
{ |
|
int i, j, ppos, fl; |
|
enum mant tok; |
enum mant tok; |
char mac[5]; |
char mac[5]; |
struct man_node *n; |
struct man_node *n; |
|
|
/* Comments and empties are quickly ignored. */ |
/* Comments and empties are quickly ignored. */ |
|
|
fl = m->flags; |
offs++; |
|
|
if ('\0' == buf[1]) |
if ('\0' == buf[offs]) |
return(1); |
return(1); |
|
|
i = 1; |
i = offs; |
|
|
if (' ' == buf[i]) { |
/* |
|
* Skip whitespace between the control character and initial |
|
* text. "Whitespace" is both spaces and tabs. |
|
*/ |
|
|
|
if (' ' == buf[i] || '\t' == buf[i]) { |
i++; |
i++; |
while (buf[i] && ' ' == buf[i]) |
while (buf[i] && (' ' == buf[i] || '\t' == buf[i])) |
i++; |
i++; |
if ('\0' == buf[i]) |
if ('\0' == buf[i]) |
goto out; |
goto out; |
Line 493 man_pmacro(struct man *m, int ln, char *buf) |
|
Line 504 man_pmacro(struct man *m, int ln, char *buf) |
|
|
|
ppos = i; |
ppos = i; |
|
|
/* Copy the first word into a nil-terminated buffer. */ |
/* |
|
* Copy the first word into a nil-terminated buffer. |
|
* Stop copying when a tab, space, or eoln is encountered. |
|
*/ |
|
|
for (j = 0; j < 4; j++, i++) { |
j = 0; |
if ('\0' == (mac[j] = buf[i])) |
while (j < 4 && '\0' != buf[i] && ' ' != buf[i] && '\t' != buf[i]) |
break; |
mac[j++] = buf[i++]; |
else if (' ' == buf[i]) |
|
break; |
|
|
|
/* Check for invalid characters. */ |
|
|
|
if (isgraph((u_char)buf[i])) |
|
continue; |
|
return(man_perr(m, ln, i, WNPRINT)); |
|
} |
|
|
|
mac[j] = '\0'; |
mac[j] = '\0'; |
|
|
if (j == 4 || j < 1) { |
tok = (j > 0 && j < 4) ? man_hash_find(mac) : MAN_MAX; |
if ( ! (MAN_IGN_MACRO & m->pflags)) { |
if (MAN_MAX == tok) { |
(void)man_perr(m, ln, ppos, WMACROFORM); |
man_vmsg(m, MANDOCERR_MACRO, ln, ppos, "%s", buf + ppos - 1); |
goto err; |
|
} |
|
if ( ! man_pwarn(m, ln, ppos, WMACROFORM)) |
|
goto err; |
|
return(1); |
return(1); |
} |
} |
|
|
if (MAN_MAX == (tok = man_hash_find(mac))) { |
|
if ( ! macrowarn(m, ln, mac)) |
|
goto err; |
|
return(1); |
|
} |
|
|
|
/* The macro is sane. Jump to the next word. */ |
/* The macro is sane. Jump to the next word. */ |
|
|
while (buf[i] && ' ' == buf[i]) |
while (buf[i] && ' ' == buf[i]) |
i++; |
i++; |
|
|
/* Trailing whitespace? */ |
/* |
|
* 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[i] && ' ' == buf[i - 1]) |
if ('\0' == buf[i] && ' ' == buf[i - 1]) |
if ( ! man_pwarn(m, ln, i - 1, WTSPACE)) |
man_pmsg(m, ln, i - 1, MANDOCERR_EOLNSPACE); |
goto err; |
|
|
|
/* |
/* |
* Remove prior ELINE macro, as it's being clobbering by a new |
* Remove prior ELINE macro, as it's being clobbered by a new |
* macro. Note that NSCOPED macros do not close out ELINE |
* macro. Note that NSCOPED macros do not close out ELINE |
* macros---they don't print text---so we let those slip by. |
* macros---they don't print text---so we let those slip by. |
*/ |
*/ |
|
|
if ( ! (MAN_NSCOPED & man_macros[tok].flags) && |
if ( ! (MAN_NSCOPED & man_macros[tok].flags) && |
m->flags & MAN_ELINE) { |
m->flags & MAN_ELINE) { |
assert(MAN_TEXT != m->last->type); |
|
|
|
/* |
|
* This occurs in the following construction: |
|
* .B |
|
* .br |
|
* .B |
|
* .br |
|
* I hate man macros. |
|
* Flat-out disallow this madness. |
|
*/ |
|
if (MAN_NSCOPED & man_macros[m->last->tok].flags) |
|
return(man_perr(m, ln, ppos, WLNSCOPE)); |
|
|
|
n = m->last; |
n = m->last; |
|
assert(MAN_TEXT != n->type); |
|
|
assert(n); |
/* Remove repeated NSCOPED macros causing ELINE. */ |
assert(NULL == n->child); |
|
assert(0 == n->nchild); |
|
|
|
if ( ! man_nwarn(m, n, WLNSCOPE)) |
if (MAN_NSCOPED & man_macros[n->tok].flags) |
return(0); |
n = n->parent; |
|
|
man_node_unlink(m, n); |
man_vmsg(m, MANDOCERR_LINESCOPE, n->line, n->pos, |
man_node_free(n); |
"%s", man_macronames[n->tok]); |
|
|
|
man_node_delete(m, n); |
m->flags &= ~MAN_ELINE; |
m->flags &= ~MAN_ELINE; |
} |
} |
|
|
/* Begin recursive parse sequence. */ |
/* |
|
* Save the fact that we're in the next-line for a block. In |
|
* this way, embedded roff instructions can "remember" state |
|
* when they exit. |
|
*/ |
|
|
assert(man_macros[tok].fp); |
if (MAN_BLINE & m->flags) |
|
m->flags |= MAN_BPLINE; |
|
|
|
/* Call to handler... */ |
|
|
|
assert(man_macros[tok].fp); |
if ( ! (*man_macros[tok].fp)(m, tok, ln, ppos, &i, buf)) |
if ( ! (*man_macros[tok].fp)(m, tok, ln, ppos, &i, buf)) |
goto err; |
goto err; |
|
|
|
|
* above-parsed macro, so return. |
* above-parsed macro, so return. |
*/ |
*/ |
|
|
if ( ! (MAN_BLINE & fl)) { |
if ( ! (MAN_BPLINE & m->flags)) { |
m->flags &= ~MAN_ILINE; |
m->flags &= ~MAN_ILINE; |
return(1); |
return(1); |
} |
} |
|
m->flags &= ~MAN_BPLINE; |
|
|
/* |
/* |
* If we're in a block scope, then allow this macro to slip by |
* If we're in a block scope, then allow this macro to slip by |
|
|
assert(MAN_BLINE & m->flags); |
assert(MAN_BLINE & m->flags); |
m->flags &= ~MAN_BLINE; |
m->flags &= ~MAN_BLINE; |
|
|
if ( ! man_unscope(m, m->last->parent)) |
if ( ! man_unscope(m, m->last->parent, MANDOCERR_MAX)) |
return(0); |
return(0); |
return(man_body_alloc(m, ln, 0, m->last->tok)); |
return(man_body_alloc(m, ln, offs, m->last->tok)); |
|
|
err: /* Error out. */ |
err: /* Error out. */ |
|
|
Line 626 err: /* Error out. */ |
|
Line 618 err: /* Error out. */ |
|
|
|
|
|
int |
int |
man_verr(struct man *man, int ln, int pos, const char *fmt, ...) |
man_vmsg(struct man *man, enum mandocerr t, |
|
int ln, int pos, const char *fmt, ...) |
{ |
{ |
char buf[256]; |
char buf[256]; |
va_list ap; |
va_list ap; |
|
|
if (NULL == man->cb.man_err) |
|
return(0); |
|
|
|
va_start(ap, fmt); |
va_start(ap, fmt); |
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
vsnprintf(buf, sizeof(buf) - 1, fmt, ap); |
va_end(ap); |
va_end(ap); |
return((*man->cb.man_err)(man->data, ln, pos, buf)); |
return((*man->msg)(t, man->data, ln, pos, buf)); |
} |
} |
|
|
|
|
int |
/* |
man_vwarn(struct man *man, int ln, int pos, const char *fmt, ...) |
* Unlink a node from its context. If "m" is provided, the last parse |
|
* point will also be adjusted accordingly. |
|
*/ |
|
static void |
|
man_node_unlink(struct man *m, struct man_node *n) |
{ |
{ |
char buf[256]; |
|
va_list ap; |
|
|
|
if (NULL == man->cb.man_warn) |
/* 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_warn)(man->data, ln, pos, buf)); |
n->next->prev = n->prev; |
} |
|
|
|
|
/* Adjust parent. */ |
|
|
int |
if (n->parent) { |
man_err(struct man *m, int line, int pos, int iserr, enum merr type) |
n->parent->nchild--; |
{ |
if (n->parent->child == n) |
const char *p; |
n->parent->child = n->prev ? n->prev : n->next; |
|
} |
p = __man_merrnames[(int)type]; |
|
assert(p); |
|
|
|
if (iserr) |
/* Adjust parse point, if applicable. */ |
return(man_verr(m, line, pos, p)); |
|
|
|
return(man_vwarn(m, line, pos, p)); |
if (m && m->last == n) { |
} |
/*XXX: this can occur when bailing from validation. */ |
|
/*assert(NULL == n->next);*/ |
|
if (n->prev) { |
void |
|
man_node_unlink(struct man *m, struct man_node *n) |
|
{ |
|
|
|
if (n->prev) { |
|
n->prev->next = n->next; |
|
if (m->last == n) { |
|
assert(NULL == n->next); |
|
m->last = n->prev; |
m->last = n->prev; |
m->next = MAN_NEXT_SIBLING; |
m->next = MAN_NEXT_SIBLING; |
} |
} else { |
} else { |
|
n->parent->child = n->next; |
|
if (m->last == n) { |
|
assert(NULL == n->next); |
|
m->last = n->parent; |
m->last = n->parent; |
m->next = MAN_NEXT_CHILD; |
m->next = MAN_NEXT_CHILD; |
} |
} |
} |
} |
|
|
if (n->next) |
if (m && m->first == n) |
n->next->prev = n->prev; |
m->first = NULL; |
} |
} |