version 1.48, 2019/03/22 15:38:09 |
version 1.66, 2019/03/23 10:22:23 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2019 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 |
|
|
char *b; /* NUL-terminated buffer for pre-print */ |
char *b; /* NUL-terminated buffer for pre-print */ |
size_t bsz; /* current length of b */ |
size_t bsz; /* current length of b */ |
size_t mbsz; /* max bsz allocation */ |
size_t mbsz; /* max bsz allocation */ |
|
int level; /* header level, starting at 1 */ |
int newln; /* output: are we on a fresh line */ |
int newln; /* output: are we on a fresh line */ |
}; |
}; |
|
|
struct node { |
struct node { |
const char *name; /* docbook element name */ |
const char *name; /* docbook element name */ |
unsigned int flags; |
enum nodeid node; /* docbook element to generate */ |
#define NODE_IGNTEXT 1 /* ignore all contained text */ |
|
}; |
}; |
|
|
TAILQ_HEAD(pnodeq, pnode); |
TAILQ_HEAD(pnodeq, pnode); |
|
|
|
|
static const char *attrkeys[ATTRKEY__MAX] = { |
static const char *attrkeys[ATTRKEY__MAX] = { |
"choice", |
"choice", |
|
"class", |
"close", |
"close", |
"id", |
"id", |
|
"linkend", |
"open", |
"open", |
"rep" |
"rep" |
}; |
}; |
|
|
static const char *attrvals[ATTRVAL__MAX] = { |
static const char *attrvals[ATTRVAL__MAX] = { |
|
"monospaced", |
"norepeat", |
"norepeat", |
"opt", |
"opt", |
"plain", |
"plain", |
Line 90 static const char *attrvals[ATTRVAL__MAX] = { |
|
Line 94 static const char *attrvals[ATTRVAL__MAX] = { |
|
"req" |
"req" |
}; |
}; |
|
|
static const struct node nodes[NODE__MAX] = { |
static const struct node nodes[] = { |
{ NULL, 0 }, |
{ "acronym", NODE_ACRONYM }, |
{ "acronym", 0 }, |
{ "affiliation", NODE_AFFILIATION }, |
{ "anchor", NODE_IGNTEXT }, |
{ "anchor", NODE_ANCHOR }, |
{ "application", 0 }, |
{ "application", NODE_APPLICATION }, |
{ "arg", 0 }, |
{ "arg", NODE_ARG }, |
{ "caution", NODE_IGNTEXT }, |
{ "author", NODE_AUTHOR }, |
{ "citerefentry", NODE_IGNTEXT }, |
{ "authorgroup", NODE_AUTHORGROUP }, |
{ "cmdsynopsis", NODE_IGNTEXT }, |
{ "blockquote", NODE_BLOCKQUOTE }, |
{ "code", 0 }, |
{ "book", NODE_BOOK }, |
{ "colspec", NODE_IGNTEXT }, |
{ "bookinfo", NODE_BOOKINFO }, |
{ "command", 0 }, |
{ "caution", NODE_CAUTION }, |
{ "constant", 0 }, |
{ "chapter", NODE_SECTION }, |
{ "copyright", NODE_IGNTEXT }, |
{ "citerefentry", NODE_CITEREFENTRY }, |
{ "date", 0 }, |
{ "citetitle", NODE_CITETITLE }, |
{ "emphasis", 0 }, |
{ "cmdsynopsis", NODE_CMDSYNOPSIS }, |
{ "entry", 0 }, |
{ "code", NODE_CODE }, |
{ "envar", 0 }, |
{ "colspec", NODE_COLSPEC }, |
{ "fieldsynopsis", NODE_IGNTEXT }, |
{ "command", NODE_COMMAND }, |
{ "filename", 0 }, |
{ "constant", NODE_CONSTANT }, |
{ "funcdef", 0 }, |
{ "copyright", NODE_COPYRIGHT }, |
{ "funcprototype", NODE_IGNTEXT }, |
{ "date", NODE_DATE }, |
{ "funcsynopsis", NODE_IGNTEXT }, |
{ "editor", NODE_EDITOR }, |
{ "funcsynopsisinfo", 0 }, |
{ "email", NODE_EMAIL }, |
{ "function", 0 }, |
{ "emphasis", NODE_EMPHASIS }, |
{ "group", NODE_IGNTEXT }, |
{ "entry", NODE_ENTRY }, |
{ "holder", NODE_IGNTEXT }, |
{ "envar", NODE_ENVAR }, |
{ "info", NODE_IGNTEXT }, |
{ "fieldsynopsis", NODE_FIELDSYNOPSIS }, |
{ "informalequation", NODE_IGNTEXT }, |
{ "filename", NODE_FILENAME }, |
{ "informaltable", NODE_IGNTEXT }, |
{ "firstname", NODE_FIRSTNAME }, |
{ "inlineequation", NODE_IGNTEXT }, |
{ "firstterm", NODE_FIRSTTERM }, |
{ "itemizedlist", NODE_IGNTEXT }, |
{ "footnote", NODE_FOOTNOTE }, |
{ "link", 0 }, |
{ "funcdef", NODE_FUNCDEF }, |
{ "listitem", NODE_IGNTEXT }, |
{ "funcprototype", NODE_FUNCPROTOTYPE }, |
{ "literal", 0 }, |
{ "funcsynopsis", NODE_FUNCSYNOPSIS }, |
{ "manvolnum", 0 }, |
{ "funcsynopsisinfo", NODE_FUNCSYNOPSISINFO }, |
{ "mml:math", NODE_IGNTEXT }, |
{ "function", NODE_FUNCTION }, |
{ "mml:mfenced", 0 }, |
{ "glossterm", NODE_GLOSSTERM }, |
{ "mml:mfrac", 0 }, |
{ "group", NODE_GROUP }, |
{ "mml:mi", 0 }, |
{ "holder", NODE_HOLDER }, |
{ "mml:mn", 0 }, |
{ "index", NODE_INDEX }, |
{ "mml:mo", 0 }, |
{ "indexterm", NODE_INDEXTERM }, |
{ "mml:mrow", 0 }, |
{ "info", NODE_INFO }, |
{ "mml:msub", 0 }, |
{ "informalequation", NODE_INFORMALEQUATION }, |
{ "mml:msup", 0 }, |
{ "informaltable", NODE_INFORMALTABLE }, |
{ "modifier", 0 }, |
{ "inlineequation", NODE_INLINEEQUATION }, |
{ "note", NODE_IGNTEXT }, |
{ "itemizedlist", NODE_ITEMIZEDLIST }, |
{ "option", 0 }, |
{ "keysym", NODE_KEYSYM }, |
{ "orderedlist", NODE_IGNTEXT }, |
{ "legalnotice", NODE_LEGALNOTICE }, |
{ "para", 0 }, |
{ "link", NODE_LINK }, |
{ "paramdef", 0 }, |
{ "listitem", NODE_LISTITEM }, |
{ "parameter", 0 }, |
{ "literal", NODE_LITERAL }, |
{ "programlisting", 0 }, |
{ "literallayout", NODE_LITERALLAYOUT }, |
{ "prompt", 0 }, |
{ "manvolnum", NODE_MANVOLNUM }, |
{ "quote", 0 }, |
{ "member", NODE_MEMBER }, |
{ "refclass", NODE_IGNTEXT }, |
{ "mml:math", NODE_MML_MATH }, |
{ "refdescriptor", NODE_IGNTEXT }, |
{ "mml:mfenced", NODE_MML_MFENCED }, |
{ "refentry", NODE_IGNTEXT }, |
{ "mml:mfrac", NODE_MML_MFRAC }, |
{ "refentryinfo", NODE_IGNTEXT }, |
{ "mml:mi", NODE_MML_MI }, |
{ "refentrytitle", 0 }, |
{ "mml:mn", NODE_MML_MN }, |
{ "refmeta", NODE_IGNTEXT }, |
{ "mml:mo", NODE_MML_MO }, |
{ "refmetainfo", NODE_IGNTEXT }, |
{ "mml:mrow", NODE_MML_MROW }, |
{ "refmiscinfo", NODE_IGNTEXT }, |
{ "mml:msub", NODE_MML_MSUB }, |
{ "refname", 0 }, |
{ "mml:msup", NODE_MML_MSUP }, |
{ "refnamediv", NODE_IGNTEXT }, |
{ "modifier", NODE_MODIFIER }, |
{ "refpurpose", 0 }, |
{ "note", NODE_NOTE }, |
{ "refsect1", NODE_IGNTEXT }, |
{ "option", NODE_OPTION }, |
{ "refsect2", NODE_IGNTEXT }, |
{ "orderedlist", NODE_ORDEREDLIST }, |
{ "refsect3", NODE_IGNTEXT }, |
{ "orgname", NODE_ORGNAME }, |
{ "refsection", NODE_IGNTEXT }, |
{ "othername", NODE_OTHERNAME }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
{ "para", NODE_PARA }, |
{ "replaceable", 0 }, |
{ "paramdef", NODE_PARAMDEF }, |
{ "row", NODE_IGNTEXT }, |
{ "parameter", NODE_PARAMETER }, |
{ "sbr", NODE_IGNTEXT }, |
{ "part", NODE_SECTION }, |
{ "screen", NODE_IGNTEXT }, |
{ "personname", NODE_PERSONNAME }, |
{ "sgmltag", 0 }, |
{ "phrase", NODE_PHRASE }, |
{ "structname", 0 }, |
{ "preface", NODE_PREFACE }, |
{ "synopsis", 0 }, |
{ "primary", NODE_PRIMARY }, |
{ "table", NODE_IGNTEXT }, |
{ "programlisting", NODE_PROGRAMLISTING }, |
{ "tbody", NODE_IGNTEXT }, |
{ "prompt", NODE_PROMPT }, |
{ "term", 0 }, |
{ "quote", NODE_QUOTE }, |
{ NULL, 0 }, |
{ "refclass", NODE_REFCLASS }, |
{ "tfoot", NODE_IGNTEXT }, |
{ "refdescriptor", NODE_REFDESCRIPTOR }, |
{ "tgroup", NODE_IGNTEXT }, |
{ "refentry", NODE_REFENTRY }, |
{ "thead", NODE_IGNTEXT }, |
{ "refentryinfo", NODE_REFENTRYINFO }, |
{ "tip", NODE_IGNTEXT }, |
{ "refentrytitle", NODE_REFENTRYTITLE }, |
{ "title", 0 }, |
{ "refmeta", NODE_REFMETA }, |
{ "trademark", 0 }, |
{ "refmetainfo", NODE_REFMETAINFO }, |
{ "type", 0 }, |
{ "refmiscinfo", NODE_REFMISCINFO }, |
{ "ulink", 0 }, |
{ "refname", NODE_REFNAME }, |
{ "userinput", 0 }, |
{ "refnamediv", NODE_REFNAMEDIV }, |
{ "variablelist", NODE_IGNTEXT }, |
{ "refpurpose", NODE_REFPURPOSE }, |
{ "varlistentry", NODE_IGNTEXT }, |
{ "refsect1", NODE_SECTION }, |
{ "varname", 0 }, |
{ "refsect2", NODE_SECTION }, |
{ "warning", NODE_IGNTEXT }, |
{ "refsect3", NODE_SECTION }, |
{ "wordasword", 0 }, |
{ "refsection", NODE_SECTION }, |
{ "year", NODE_IGNTEXT }, |
{ "refsynopsisdiv", NODE_REFSYNOPSISDIV }, |
|
{ "releaseinfo", NODE_RELEASEINFO }, |
|
{ "replaceable", NODE_REPLACEABLE }, |
|
{ "row", NODE_ROW }, |
|
{ "sbr", NODE_SBR }, |
|
{ "screen", NODE_SCREEN }, |
|
{ "secondary", NODE_SECONDARY }, |
|
{ "sect1", NODE_SECTION }, |
|
{ "sect2", NODE_SECTION }, |
|
{ "section", NODE_SECTION }, |
|
{ "sgmltag", NODE_SGMLTAG }, |
|
{ "simplelist", NODE_SIMPLELIST }, |
|
{ "spanspec", NODE_SPANSPEC }, |
|
{ "structname", NODE_STRUCTNAME }, |
|
{ "subtitle", NODE_SUBTITLE }, |
|
{ "surname", NODE_SURNAME }, |
|
{ "synopsis", NODE_SYNOPSIS }, |
|
{ "table", NODE_TABLE }, |
|
{ "tbody", NODE_TBODY }, |
|
{ "term", NODE_TERM }, |
|
{ "tfoot", NODE_TFOOT }, |
|
{ "tgroup", NODE_TGROUP }, |
|
{ "thead", NODE_THEAD }, |
|
{ "tip", NODE_TIP }, |
|
{ "title", NODE_TITLE }, |
|
{ "trademark", NODE_TRADEMARK }, |
|
{ "type", NODE_TYPE }, |
|
{ "ulink", NODE_ULINK }, |
|
{ "userinput", NODE_USERINPUT }, |
|
{ "variablelist", NODE_VARIABLELIST }, |
|
{ "varlistentry", NODE_VARLISTENTRY }, |
|
{ "varname", NODE_VARNAME }, |
|
{ "warning", NODE_WARNING }, |
|
{ "wordasword", NODE_WORDASWORD }, |
|
{ "year", NODE_YEAR }, |
|
{ NULL, NODE__MAX } |
}; |
}; |
|
|
static int warn = 0; |
static int warn = 0; |
Line 208 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 247 xml_char(void *arg, const XML_Char *p, int sz) |
|
int i; |
int i; |
|
|
/* Stopped or no tree yet. */ |
/* Stopped or no tree yet. */ |
if (ps->stop || NODE_ROOT == ps->node) |
if (ps->stop || ps->node == NODE_ROOT) |
return; |
return; |
|
|
/* Not supposed to be collecting text. */ |
assert(ps->cur != NULL); |
assert(NULL != ps->cur); |
|
if (NODE_IGNTEXT & nodes[ps->node].flags) |
|
return; |
|
|
|
/* |
/* |
* Are we in the midst of processing text? |
* Are we in the midst of processing text? |
Line 223 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 259 xml_char(void *arg, const XML_Char *p, int sz) |
|
* However, don't do so unless we have some non-whitespace to |
* However, don't do so unless we have some non-whitespace to |
* process: strip out all leading whitespace to be sure. |
* process: strip out all leading whitespace to be sure. |
*/ |
*/ |
if (NODE_TEXT != ps->node) { |
if (ps->node != NODE_TEXT) { |
for (i = 0; i < sz; i++) |
for (i = 0; i < sz; i++) |
if ( ! isspace((unsigned char)p[i])) |
if ( ! isspace((unsigned char)p[i])) |
break; |
break; |
Line 232 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 268 xml_char(void *arg, const XML_Char *p, int sz) |
|
p += i; |
p += i; |
sz -= i; |
sz -= i; |
dat = calloc(1, sizeof(struct pnode)); |
dat = calloc(1, sizeof(struct pnode)); |
if (NULL == dat) { |
if (dat == NULL) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = NODE_TEXT; |
dat->node = ps->node = NODE_TEXT; |
Line 243 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 279 xml_char(void *arg, const XML_Char *p, int sz) |
|
TAILQ_INIT(&dat->attrq); |
TAILQ_INIT(&dat->attrq); |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
ps->cur = dat; |
ps->cur = dat; |
assert(NULL != ps->root); |
assert(ps->root != NULL); |
} |
} |
|
|
/* Append to current buffer. */ |
/* Append to current buffer. */ |
assert(sz >= 0); |
assert(sz >= 0); |
ps->cur->b = realloc(ps->cur->b, |
ps->cur->b = realloc(ps->cur->b, |
ps->cur->bsz + (size_t)sz); |
ps->cur->bsz + (size_t)sz); |
if (NULL == ps->cur->b) { |
if (ps->cur->b == NULL) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
ps->cur->bsz += (size_t)sz; |
ps->cur->bsz += (size_t)sz; |
Line 262 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 298 xml_char(void *arg, const XML_Char *p, int sz) |
|
static void |
static void |
pnode_trim(struct pnode *pn) |
pnode_trim(struct pnode *pn) |
{ |
{ |
|
assert(pn->node == NODE_TEXT); |
assert(NODE_TEXT == pn->node); |
|
for ( ; pn->bsz > 0; pn->bsz--) |
for ( ; pn->bsz > 0; pn->bsz--) |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
break; |
break; |
|
|
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
{ |
{ |
struct parse *ps = arg; |
struct parse *ps = arg; |
enum nodeid node; |
const struct node *node; |
enum attrkey key; |
enum attrkey key; |
enum attrval val; |
enum attrval val; |
struct pnode *dat; |
struct pnode *dat; |
Line 295 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 330 xml_elem_start(void *arg, const XML_Char *name, const |
|
const XML_Char **att; |
const XML_Char **att; |
|
|
/* FIXME: find a better way to ditch other namespaces. */ |
/* FIXME: find a better way to ditch other namespaces. */ |
if (ps->stop || 0 == strcmp(name, "xi:include")) |
if (ps->stop || strcmp(name, "xi:include") == 0) |
return; |
return; |
|
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (NODE_TEXT == ps->node) { |
if (ps->node == NODE_TEXT) { |
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
assert(NULL != ps->cur); |
|
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
} |
} |
|
|
for (node = 0; node < NODE__MAX; node++) |
for (node = nodes; node->name != NULL; node++) |
if (NULL == nodes[node].name) |
if (strcmp(node->name, name) == 0) |
continue; |
|
else if (0 == strcmp(nodes[node].name, name)) |
|
break; |
break; |
|
|
if (NODE__MAX == node && NODE_ROOT == ps->node) { |
if (node->name == NULL) { |
return; |
if (ps->node == NODE_ROOT) |
} else if (NODE__MAX == node) { |
return; |
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml), name); |
XML_GetCurrentColumnNumber(ps->xml), name); |
ps->stop = 1; |
ps->stop = 1; |
return; |
return; |
} else if (NODE_ROOT == ps->node && NULL != ps->root) { |
} else if (ps->node == NODE_ROOT && ps->root != NULL) { |
fprintf(stderr, "%s:%zu:%zu: multiple refentries\n", |
fprintf(stderr, "%s:%zu:%zu: multiple refentries\n", |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml)); |
XML_GetCurrentColumnNumber(ps->xml)); |
ps->stop = 1; |
ps->stop = 1; |
return; |
return; |
} else if (NODE_ROOT == ps->node && NODE_REFENTRY != node) |
} |
return; |
|
|
|
if (NODE_INLINEEQUATION == node) |
if (node->node == NODE_INLINEEQUATION) |
ps->flags |= PARSE_EQN; |
ps->flags |= PARSE_EQN; |
|
|
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
if ((dat = calloc(1, sizeof(struct pnode))) == NULL) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = node; |
dat->node = ps->node = node->node; |
dat->parent = ps->cur; |
dat->parent = ps->cur; |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->attrq); |
TAILQ_INIT(&dat->attrq); |
|
|
if (NULL != ps->cur) |
if (ps->cur != NULL) |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
|
|
ps->cur = dat; |
ps->cur = dat; |
if (NULL == ps->root) |
if (ps->root == NULL) |
ps->root = dat; |
ps->root = dat; |
|
|
/* |
/* |
* Process attributes. |
* Process attributes. |
*/ |
*/ |
for (att = atts; NULL != *att; att += 2) { |
for (att = atts; *att != NULL; att += 2) { |
for (key = 0; key < ATTRKEY__MAX; key++) |
for (key = 0; key < ATTRKEY__MAX; key++) |
if (0 == strcmp(*att, attrkeys[key])) |
if (strcmp(*att, attrkeys[key]) == 0) |
break; |
break; |
if (ATTRKEY__MAX == key) { |
if (key == ATTRKEY__MAX) { |
if (warn) |
if (warn) |
fprintf(stderr, "%s:%zu:%zu: warning: " |
fprintf(stderr, "%s:%zu:%zu: warning: " |
"unknown attribute \"%s\"\n", |
"unknown attribute \"%s\"\n", |
Line 366 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 396 xml_elem_start(void *arg, const XML_Char *name, const |
|
XML_GetCurrentColumnNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml), |
*att); |
*att); |
continue; |
continue; |
} else if ( ! isattrkey(node, key)) { |
|
if (warn) |
|
fprintf(stderr, "%s:%zu:%zu: warning: " |
|
"bad attribute \"%s\"\n", |
|
ps->fname, |
|
XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), |
|
*att); |
|
continue; |
|
} |
} |
for (val = 0; val < ATTRVAL__MAX; val++) |
for (val = 0; val < ATTRVAL__MAX; val++) |
if (0 == strcmp(*(att + 1), attrvals[val])) |
if (strcmp(att[1], attrvals[val]) == 0) |
break; |
break; |
if (ATTRVAL__MAX != val && ! isattrval(key, val)) { |
|
if (warn) |
|
fprintf(stderr, "%s:%zu:%zu: warning: " |
|
"bad attribute value \"%s\"\n", |
|
ps->fname, |
|
XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), |
|
*(att + 1)); |
|
continue; |
|
} |
|
pattr = calloc(1, sizeof(struct pattr)); |
pattr = calloc(1, sizeof(struct pattr)); |
pattr->key = key; |
pattr->key = key; |
pattr->val = val; |
pattr->val = val; |
if (ATTRVAL__MAX == val) |
if (val == ATTRVAL__MAX) |
pattr->rawval = strdup(*(att + 1)); |
pattr->rawval = strdup(att[1]); |
TAILQ_INSERT_TAIL(&dat->attrq, pattr, child); |
TAILQ_INSERT_TAIL(&dat->attrq, pattr, child); |
} |
} |
|
|
Line 410 xml_elem_end(void *arg, const XML_Char *name) |
|
Line 421 xml_elem_end(void *arg, const XML_Char *name) |
|
struct parse *ps = arg; |
struct parse *ps = arg; |
|
|
/* FIXME: find a better way to ditch other namespaces. */ |
/* FIXME: find a better way to ditch other namespaces. */ |
if (ps->stop || NODE_ROOT == ps->node) |
if (ps->stop || ps->node == NODE_ROOT) |
return; |
return; |
else if (0 == strcmp(name, "xi:include")) |
else if (strcmp(name, "xi:include") == 0) |
return; |
return; |
|
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (NODE_TEXT == ps->node) { |
if (ps->node == NODE_TEXT) { |
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
assert(NULL != ps->cur); |
|
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
} |
} |
|
|
if (NULL == (ps->cur = ps->cur->parent)) |
if ((ps->cur = ps->cur->parent) == NULL) |
ps->node = NODE_ROOT; |
ps->node = NODE_ROOT; |
else |
else |
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
Line 439 pnode_free(struct pnode *pn) |
|
Line 448 pnode_free(struct pnode *pn) |
|
struct pnode *pp; |
struct pnode *pp; |
struct pattr *ap; |
struct pattr *ap; |
|
|
if (NULL == pn) |
if (pn == NULL) |
return; |
return; |
|
|
while (NULL != (pp = TAILQ_FIRST(&pn->childq))) { |
while ((pp = TAILQ_FIRST(&pn->childq)) != NULL) { |
TAILQ_REMOVE(&pn->childq, pp, child); |
TAILQ_REMOVE(&pn->childq, pp, child); |
pnode_free(pp); |
pnode_free(pp); |
} |
} |
|
|
while (NULL != (ap = TAILQ_FIRST(&pn->attrq))) { |
while ((ap = TAILQ_FIRST(&pn->attrq)) != NULL) { |
TAILQ_REMOVE(&pn->attrq, ap, child); |
TAILQ_REMOVE(&pn->attrq, ap, child); |
free(ap->rawval); |
free(ap->rawval); |
free(ap); |
free(ap); |
Line 463 pnode_free(struct pnode *pn) |
|
Line 472 pnode_free(struct pnode *pn) |
|
static void |
static void |
pnode_unlink(struct pnode *pn) |
pnode_unlink(struct pnode *pn) |
{ |
{ |
|
if (pn->parent != NULL) |
if (NULL != pn->parent) |
|
TAILQ_REMOVE(&pn->parent->childq, pn, child); |
TAILQ_REMOVE(&pn->parent->childq, pn, child); |
pnode_free(pn); |
pnode_free(pn); |
} |
} |
Line 481 pnode_unlinksub(struct pnode *pn) |
|
Line 489 pnode_unlinksub(struct pnode *pn) |
|
} |
} |
|
|
/* |
/* |
|
* Retrieve an enumeration attribute from a node. |
|
* Return ATTRVAL__MAX if the node has no such attribute. |
|
*/ |
|
enum attrval |
|
pnode_getattr(struct pnode *pn, enum attrkey key) |
|
{ |
|
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ap->key == key) |
|
return ap->val; |
|
return ATTRVAL__MAX; |
|
} |
|
|
|
/* |
|
* Retrieve an attribute string from a node. |
|
* Return defval if the node has no such attribute. |
|
*/ |
|
const char * |
|
pnode_getattr_raw(struct pnode *pn, enum attrkey key, const char *defval) |
|
{ |
|
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ap->key == key) |
|
return ap->val == ATTRVAL__MAX ? ap->rawval : |
|
attrvals[ap->val]; |
|
return defval; |
|
} |
|
|
|
/* |
* Reset the lookaside buffer. |
* Reset the lookaside buffer. |
*/ |
*/ |
static void |
static void |
|
|
bufappend(struct parse *p, struct pnode *pn) |
bufappend(struct parse *p, struct pnode *pn) |
{ |
{ |
|
|
assert(NODE_TEXT == pn->node); |
assert(pn->node == NODE_TEXT); |
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
p->mbsz = p->bsz + pn->bsz + 1; |
p->mbsz = p->bsz + pn->bsz + 1; |
if (NULL == (p->b = realloc(p->b, p->mbsz))) { |
if ((p->b = realloc(p->b, p->mbsz)) == NULL) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
} |
} |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
Line 523 bufappend_r(struct parse *p, struct pnode *pn) |
|
Line 562 bufappend_r(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
if (NODE_TEXT == pn->node) |
if (pn->node == NODE_TEXT) |
bufappend(p, pn); |
bufappend(p, pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
bufappend_r(p, pp); |
bufappend_r(p, pp); |
Line 541 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
Line 580 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
res = pp->node == node ? pp : |
res = pp->node == node ? pp : |
pnode_findfirst(pp, node); |
pnode_findfirst(pp, node); |
if (NULL != res) |
if (res != NULL) |
break; |
break; |
} |
} |
|
|
return(res); |
return res; |
} |
} |
|
|
#define MACROLINE_NORM 0 |
#define MACROLINE_NORM 0 |
Line 560 pnode_printmacrolinetext(struct parse *p, struct pnode |
|
Line 599 pnode_printmacrolinetext(struct parse *p, struct pnode |
|
{ |
{ |
char *cp; |
char *cp; |
|
|
if (0 == p->newln && ! (MACROLINE_NOWS & fl)) |
if (p->newln == 0 && (fl & MACROLINE_NOWS) == 0) |
putchar(' '); |
putchar(' '); |
|
|
bufclear(p); |
bufclear(p); |
bufappend_r(p, pn); |
bufappend_r(p, pn); |
|
|
/* Convert all space to spaces. */ |
/* Convert all space to spaces. */ |
for (cp = p->b; '\0' != *cp; cp++) |
for (cp = p->b; *cp != '\0'; cp++) |
if (isspace((unsigned char)*cp)) |
if (isspace((unsigned char)*cp)) |
*cp = ' '; |
*cp = ' '; |
|
|
for (cp = p->b; isspace((unsigned char)*cp); cp++) |
for (cp = p->b; isspace((unsigned char)*cp); cp++) |
/* Spin past whitespace (XXX: necessary?) */ ; |
/* Spin past whitespace (XXX: necessary?) */ ; |
for ( ; '\0' != *cp; cp++) { |
for ( ; *cp != '\0'; cp++) { |
/* Escape us if we look like a macro. */ |
/* Escape us if we look like a macro. */ |
if ((cp == p->b || ' ' == *(cp - 1)) && |
if ((cp == p->b || cp[-1] == ' ') && |
isupper((unsigned char)*cp) && |
isupper((unsigned char)cp[0]) && |
'\0' != *(cp + 1) && |
islower((unsigned char)cp[1]) && |
islower((unsigned char)*(cp + 1)) && |
(cp[2] == '\0' || cp[2] == ' ' || |
('\0' == *(cp + 2) || |
(islower((unsigned char)cp[2]) && |
' ' == *(cp + 2) || |
(cp[3] == '\0' || cp[3] == ' ')))) |
(islower((unsigned char)*(cp + 2)) && |
|
('\0' == *(cp + 3) || |
|
' ' == *(cp + 3))))) |
|
fputs("\\&", stdout); |
fputs("\\&", stdout); |
if (MACROLINE_UPPER & fl) |
if (fl & MACROLINE_UPPER) |
putchar(toupper((unsigned char)*cp)); |
putchar(toupper((unsigned char)*cp)); |
else |
else |
putchar(*cp); |
putchar(*cp); |
/* If we're a character escape, escape us. */ |
/* If we're a character escape, escape us. */ |
if ('\\' == *cp) |
if (*cp == '\\') |
putchar('e'); |
putchar('e'); |
} |
} |
} |
} |
Line 609 pnode_printmacrolinepart(struct parse *p, struct pnode |
|
Line 645 pnode_printmacrolinepart(struct parse *p, struct pnode |
|
static void |
static void |
pnode_printmacroline(struct parse *p, struct pnode *pn) |
pnode_printmacroline(struct parse *p, struct pnode *pn) |
{ |
{ |
|
assert(p->newln == 0); |
assert(0 == p->newln); |
|
pnode_printmacrolinetext(p, pn, 0); |
pnode_printmacrolinetext(p, pn, 0); |
putchar('\n'); |
putchar('\n'); |
p->newln = 1; |
p->newln = 1; |
Line 649 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
Line 684 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
return; |
return; |
|
|
/* No next node or it's not text. */ |
/* No next node or it's not text. */ |
if (NULL == (pn = TAILQ_NEXT(pn, child))) { |
if ((pn = TAILQ_NEXT(pn, child)) == NULL) { |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
return; |
return; |
} else if (NODE_TEXT != pn->node) { |
} else if (pn->node != NODE_TEXT) { |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
return; |
return; |
} |
} |
|
|
/* Only do this for the comma/period. */ |
/* Only do this for the comma/period. */ |
if (pn->bsz > 0 && |
if (pn->bsz > 0 && |
(',' == pn->b[0] || '.' == pn->b[0]) && |
(pn->b[0] == ',' || pn->b[0] == '.') && |
(1 == pn->bsz || isspace((unsigned char)pn->b[1]))) { |
(pn->bsz == 1 || isspace((unsigned char)pn->b[1]))) { |
putchar(' '); |
putchar(' '); |
putchar(pn->b[0]); |
putchar(pn->b[0]); |
pn->b++; |
pn->b++; |
Line 671 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
Line 706 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
p->newln = 1; |
p->newln = 1; |
} |
} |
|
|
|
static void |
|
pnode_printpara(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
assert(p->newln); |
|
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL && |
|
(pp = pn->parent) == NULL) |
|
return; |
|
|
|
switch (pp->node) { |
|
case NODE_ENTRY: |
|
case NODE_LISTITEM: |
|
return; |
|
case NODE_PREFACE: |
|
case NODE_SECTION: |
|
if (p->level < 3) |
|
return; |
|
break; |
|
default: |
|
break; |
|
} |
|
puts(".Pp"); |
|
} |
|
|
/* |
/* |
* If the SYNOPSIS macro has a superfluous title, kill it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
Line 680 pnode_printrefsynopsisdiv(struct parse *p, struct pnod |
|
Line 740 pnode_printrefsynopsisdiv(struct parse *p, struct pnod |
|
struct pnode *pp; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (pp->node == NODE_TITLE) { |
pnode_unlink(pp); |
pnode_unlink(pp); |
return; |
return; |
} |
} |
|
|
pnode_printrefsect(struct parse *p, struct pnode *pn) |
pnode_printrefsect(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
const char *title; |
|
int flags, level; |
|
|
|
if (pn->parent == NULL) |
|
return; |
|
|
|
level = ++p->level; |
|
flags = level == 1 ? MACROLINE_UPPER : 0; |
|
if (level < 3) { |
|
switch (pn->node) { |
|
case NODE_CAUTION: |
|
case NODE_NOTE: |
|
case NODE_TIP: |
|
case NODE_WARNING: |
|
level = 3; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) |
if (pp->node == NODE_TITLE) |
break; |
break; |
|
|
switch (pn->node) { |
if (pp == NULL) { |
case (NODE_REFSECT1): |
switch (pn->node) { |
|
case NODE_PREFACE: |
|
title = "Preface"; |
|
break; |
|
case NODE_CAUTION: |
|
title = "Caution"; |
|
break; |
|
case NODE_NOTE: |
|
title = "Note"; |
|
break; |
|
case NODE_TIP: |
|
title = "Tip"; |
|
break; |
|
case NODE_WARNING: |
|
title = "Warning"; |
|
break; |
|
default: |
|
title = "Unknown"; |
|
break; |
|
} |
|
} |
|
|
|
switch (level) { |
|
case 1: |
fputs(".Sh", stdout); |
fputs(".Sh", stdout); |
break; |
break; |
case (NODE_REFSECT2): |
case 2: |
fputs(".Ss", stdout); |
fputs(".Ss", stdout); |
break; |
break; |
case (NODE_REFSECT3): |
default: |
puts(".Pp"); |
pnode_printpara(p, pn); |
fputs(".Sy", stdout); |
fputs(".Sy", stdout); |
break; |
break; |
case (NODE_NOTE): |
|
/* FALLTHROUGH */ |
|
case (NODE_REFSECTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_TIP): |
|
/* FALLTHROUGH */ |
|
case (NODE_CAUTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_WARNING): |
|
puts(".Pp"); |
|
if (NULL == pp) |
|
return; |
|
fputs(".Em", stdout); |
|
break; |
|
default: |
|
break; |
|
} |
} |
|
|
p->newln = 0; |
if (pp != NULL) { |
|
p->newln = 0; |
if (NULL != pp) { |
pnode_printmacrolinetext(p, pp, flags); |
pnode_printmacrolinetext(p, pp, |
|
NODE_REFSECT1 == pn->node ? |
|
MACROLINE_UPPER : 0); |
|
pnode_printmclose(p, 1); |
pnode_printmclose(p, 1); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} else { |
} else |
puts(NODE_REFSECT1 == pn->node ? |
printf(" %s\n", title); |
"UNKNOWN" : "unknown"); |
|
p->newln = 1; |
|
} |
|
} |
} |
|
|
/* |
/* |
Line 752 pnode_printciterefentry(struct parse *p, struct pnode |
|
Line 833 pnode_printciterefentry(struct parse *p, struct pnode |
|
|
|
title = manvol = NULL; |
title = manvol = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_MANVOLNUM == pp->node) |
if (pp->node == NODE_MANVOLNUM) |
manvol = pp; |
manvol = pp; |
else if (NODE_REFENTRYTITLE == pp->node) |
else if (pp->node == NODE_REFENTRYTITLE) |
title = pp; |
title = pp; |
|
|
if (NULL != title) { |
if (title != NULL) |
pnode_printmacrolinepart(p, title); |
pnode_printmacrolinepart(p, title); |
} else |
else |
fputs(" unknown ", stdout); |
fputs(" unknown ", stdout); |
|
|
if (NULL == manvol) { |
if (manvol == NULL) { |
puts(" 1"); |
puts(" 1"); |
p->newln = 1; |
p->newln = 1; |
} else |
} else |
Line 777 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 858 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
title = manvol = NULL; |
title = manvol = NULL; |
assert(p->newln); |
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_MANVOLNUM == pp->node) |
if (pp->node == NODE_MANVOLNUM) |
manvol = pp; |
manvol = pp; |
else if (NODE_REFENTRYTITLE == pp->node) |
else if (pp->node == NODE_REFENTRYTITLE) |
title = pp; |
title = pp; |
|
|
puts(".Dd $Mdocdate" "$"); |
|
fputs(".Dt", stdout); |
fputs(".Dt", stdout); |
p->newln = 0; |
p->newln = 0; |
|
|
if (NULL != title) |
if (title != NULL) |
pnode_printmacrolinetext(p, title, MACROLINE_UPPER); |
pnode_printmacrolinetext(p, title, MACROLINE_UPPER); |
else |
else |
fputs(" UNKNOWN ", stdout); |
fputs(" UNKNOWN ", stdout); |
|
|
if (NULL == manvol) { |
if (manvol == NULL) { |
puts(" 1"); |
puts(" 1"); |
p->newln = 1; |
p->newln = 1; |
} else |
} else |
pnode_printmacroline(p, manvol); |
pnode_printmacroline(p, manvol); |
|
|
puts(".Os"); |
|
} |
} |
|
|
static void |
static void |
Line 808 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
Line 886 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
assert(p->newln); |
assert(p->newln); |
ftype = func = NULL; |
ftype = func = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TEXT == pp->node) |
if (pp->node == NODE_TEXT) |
ftype = pp; |
ftype = pp; |
else if (NODE_FUNCTION == pp->node) |
else if (pp->node == NODE_FUNCTION) |
func = pp; |
func = pp; |
|
|
if (NULL != ftype) { |
if (ftype != NULL) { |
fputs(".Ft", stdout); |
fputs(".Ft", stdout); |
p->newln = 0; |
p->newln = 0; |
pnode_printmacroline(p, ftype); |
pnode_printmacroline(p, ftype); |
} |
} |
|
|
if (NULL != func) { |
if (func != NULL) { |
fputs(".Fo", stdout); |
fputs(".Fo", stdout); |
p->newln = 0; |
p->newln = 0; |
pnode_printmacroline(p, func); |
pnode_printmacroline(p, func); |
Line 837 pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
Line 915 pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
assert(p->newln); |
assert(p->newln); |
ptype = param = NULL; |
ptype = param = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TEXT == pp->node) |
if (pp->node == NODE_TEXT) |
ptype = pp; |
ptype = pp; |
else if (NODE_PARAMETER == pp->node) |
else if (pp->node == NODE_PARAMETER) |
param = pp; |
param = pp; |
|
|
fputs(".Fa \"", stdout); |
fputs(".Fa \"", stdout); |
p->newln = 0; |
p->newln = 0; |
if (NULL != ptype) { |
if (ptype != NULL) { |
pnode_printmacrolinetext(p, ptype, MACROLINE_NOWS); |
pnode_printmacrolinetext(p, ptype, MACROLINE_NOWS); |
putchar(' '); |
putchar(' '); |
} |
} |
|
|
if (NULL != param) |
if (param != NULL) |
pnode_printmacrolinepart(p, param); |
pnode_printmacrolinepart(p, param); |
|
|
puts("\""); |
puts("\""); |
|
|
pnode_printmathfenced(struct parse *p, struct pnode *pn) |
pnode_printmathfenced(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
printf("left %s ", pnode_getattr_raw(pn, ATTRKEY_OPEN, "(")); |
if (ATTRKEY_OPEN == ap->key) { |
|
printf("left %s ", ap->rawval); |
|
break; |
|
} |
|
if (NULL == ap) |
|
printf("left ( "); |
|
|
|
pp = TAILQ_FIRST(&pn->childq); |
pp = TAILQ_FIRST(&pn->childq); |
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
while (NULL != (pp = TAILQ_NEXT(pp, child))) { |
while ((pp = TAILQ_NEXT(pp, child)) != NULL) { |
putchar(','); |
putchar(','); |
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
if (ATTRKEY_CLOSE == ap->key) { |
|
printf("right %s ", ap->rawval); |
|
break; |
|
} |
|
if (NULL == ap) |
|
printf("right ) "); |
|
} |
} |
|
|
/* |
/* |
Line 908 pnode_printmath(struct parse *p, struct pnode *pn) |
|
Line 973 pnode_printmath(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_MML_MSUP): |
case NODE_MML_MSUP: |
fputs(" sup ", stdout); |
fputs(" sup ", stdout); |
break; |
break; |
case (NODE_MML_MFRAC): |
case NODE_MML_MFRAC: |
fputs(" over ", stdout); |
fputs(" over ", stdout); |
break; |
break; |
case (NODE_MML_MSUB): |
case NODE_MML_MSUB: |
fputs(" sub ", stdout); |
fputs(" sub ", stdout); |
break; |
break; |
default: |
default: |
Line 932 pnode_printfuncprototype(struct parse *p, struct pnode |
|
Line 997 pnode_printfuncprototype(struct parse *p, struct pnode |
|
|
|
assert(p->newln); |
assert(p->newln); |
TAILQ_FOREACH(fdef, &pn->childq, child) |
TAILQ_FOREACH(fdef, &pn->childq, child) |
if (NODE_FUNCDEF == fdef->node) |
if (fdef->node == NODE_FUNCDEF) |
break; |
break; |
|
|
if (NULL != fdef) |
if (fdef != NULL) |
pnode_printfuncdef(p, fdef); |
pnode_printfuncdef(p, fdef); |
else |
else |
puts(".Fo UNKNOWN"); |
puts(".Fo UNKNOWN"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_PARAMDEF == pp->node) |
if (pp->node == NODE_PARAMDEF) |
pnode_printparamdef(p, pp); |
pnode_printparamdef(p, pp); |
|
|
puts(".Fc"); |
puts(".Fc"); |
Line 965 pnode_printarg(struct parse *p, struct pnode *pn) |
|
Line 1030 pnode_printarg(struct parse *p, struct pnode *pn) |
|
isop = 1; |
isop = 1; |
isrep = 0; |
isrep = 0; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) |
if (ATTRKEY_CHOICE == ap->key && |
if (ap->key == ATTRKEY_CHOICE && |
(ATTRVAL_PLAIN == ap->val || |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) |
ATTRVAL_REQ == ap->val)) |
|
isop = 0; |
isop = 0; |
else if (ATTRKEY_REP == ap->key && |
else if (ap->key == ATTRKEY_REP && ap->val == ATTRVAL_REPEAT) |
(ATTRVAL_REPEAT == ap->val)) |
|
isrep = 1; |
isrep = 1; |
|
|
if (isop) { |
if (isop) { |
Line 979 pnode_printarg(struct parse *p, struct pnode *pn) |
|
Line 1042 pnode_printarg(struct parse *p, struct pnode *pn) |
|
} |
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (NODE_TEXT == pp->node) { |
if (pp->node == NODE_TEXT) { |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Ar", stdout); |
fputs("Ar", stdout); |
} |
} |
pnode_print(p, pp); |
pnode_print(p, pp); |
if (NODE_TEXT == pp->node && isrep) |
if (isrep && pp->node == NODE_TEXT) |
fputs("...", stdout); |
fputs("...", stdout); |
} |
} |
} |
} |
Line 998 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
Line 1061 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
|
|
isop = 1; |
isop = 1; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) |
if (ATTRKEY_CHOICE == ap->key && |
if (ap->key == ATTRKEY_CHOICE && |
(ATTRVAL_PLAIN == ap->val || |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) { |
ATTRVAL_REQ == ap->val)) { |
|
isop = 0; |
isop = 0; |
break; |
break; |
} |
} |
Line 1028 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
Line 1090 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_print(p, pp); |
pnode_print(p, pp); |
np = TAILQ_NEXT(pp, child); |
np = TAILQ_NEXT(pp, child); |
while (NULL != np) { |
while (np != NULL) { |
if (pp->node != np->node) |
if (pp->node != np->node) |
break; |
break; |
fputs(" |", stdout); |
fputs(" |", stdout); |
Line 1046 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
Line 1108 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
pp = NULL == p->root ? NULL : |
pp = p->root == NULL ? NULL : |
pnode_findfirst(p->root, NODE_REFMETA); |
pnode_findfirst(p->root, NODE_REFMETA); |
|
|
if (NULL != pp) { |
puts(".Dd $Mdocdate" "$"); |
|
if (pp != NULL) { |
pnode_printrefmeta(p, pp); |
pnode_printrefmeta(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} else { |
} else |
puts(".\\\" Supplying bogus prologue..."); |
printf(".Dt %s 1\n", |
puts(".Dd $Mdocdate" "$"); |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN")); |
puts(".Dt UNKNOWN 1"); |
puts(".Os"); |
puts(".Os"); |
|
} |
|
|
|
if (PARSE_EQN & p->flags) { |
if (p->flags & PARSE_EQN) { |
puts(".EQ"); |
puts(".EQ"); |
puts("delim $$"); |
puts("delim $$"); |
puts(".EN"); |
puts(".EN"); |
Line 1081 pnode_printvarlistentry(struct parse *p, struct pnode |
|
Line 1142 pnode_printvarlistentry(struct parse *p, struct pnode |
|
p->newln = 0; |
p->newln = 0; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TERM == pp->node) { |
if (pp->node == NODE_TERM) { |
if ( ! first) |
if ( ! first) |
putchar(','); |
putchar(','); |
pnode_print(p, pp); |
pnode_print(p, pp); |
Line 1118 pnode_printtable(struct parse *p, struct pnode *pn) |
|
Line 1179 pnode_printtable(struct parse *p, struct pnode *pn) |
|
|
|
assert(p->newln); |
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (pp->node == NODE_TITLE) { |
puts(".Pp"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
assert(p->newln); |
assert(p->newln); |
puts(".Bl -ohang"); |
puts(".Bl -ohang"); |
while (NULL != (pp = pnode_findfirst(pn, NODE_ROW))) { |
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
puts(".It Table Row"); |
puts(".It Table Row"); |
pnode_printrow(p, pp); |
pnode_printrow(p, pp); |
pnode_printmclose(p, 1); |
pnode_printmclose(p, 1); |
Line 1142 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1203 pnode_printlist(struct parse *p, struct pnode *pn) |
|
|
|
assert(p->newln); |
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (pp->node == NODE_TITLE) { |
puts(".Pp"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
assert(p->newln); |
assert(p->newln); |
|
|
if (NODE_ORDEREDLIST == pn->node) |
if (pn->node == NODE_ORDEREDLIST) |
puts(".Bl -enum"); |
puts(".Bl -enum"); |
else |
else |
puts(".Bl -item"); |
puts(".Bl -bullet"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
assert(p->newln); |
assert(p->newln); |
Line 1171 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1232 pnode_printvariablelist(struct parse *p, struct pnode |
|
|
|
assert(p->newln); |
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (pp->node == NODE_TITLE) { |
puts(".Pp"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
Line 1180 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1241 pnode_printvariablelist(struct parse *p, struct pnode |
|
assert(p->newln); |
assert(p->newln); |
puts(".Bl -tag -width Ds"); |
puts(".Bl -tag -width Ds"); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_VARLISTENTRY != pp->node) { |
if (pp->node != NODE_VARLISTENTRY) { |
assert(p->newln); |
assert(p->newln); |
fputs(".It", stdout); |
fputs(".It", stdout); |
pnode_printmacroline(p, pp); |
pnode_printmacroline(p, pp); |
|
|
pnode_print(struct parse *p, struct pnode *pn) |
pnode_print(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
const char *ccp; |
char *cp; |
char *cp; |
int last, sv; |
int last, sv; |
|
|
if (NULL == pn) |
if (pn == NULL) |
return; |
return; |
|
|
sv = p->newln; |
sv = p->newln; |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_APPLICATION): |
case NODE_APPLICATION: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
break; |
break; |
case (NODE_ANCHOR): |
case NODE_ANCHOR: |
/* Don't print anything! */ |
/* Don't print anything! */ |
return; |
return; |
case (NODE_ARG): |
case NODE_ARG: |
pnode_printarg(p, pn); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_CITEREFENTRY): |
case NODE_AUTHOR: |
pnode_printmopen(p); |
pnode_printmopen(p); |
|
fputs("An", stdout); |
|
break; |
|
case NODE_AUTHORGROUP: |
|
assert(p->newln); |
|
puts(".An -split"); |
|
break; |
|
case NODE_BOOKINFO: |
|
assert(p->newln); |
|
puts(".Sh NAME"); |
|
break; |
|
case NODE_CITEREFENTRY: |
|
pnode_printmopen(p); |
fputs("Xr", stdout); |
fputs("Xr", stdout); |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_CODE): |
case NODE_CODE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_COMMAND): |
case NODE_COMMAND: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
break; |
break; |
case (NODE_CONSTANT): |
case NODE_CONSTANT: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Dv", stdout); |
fputs("Dv", stdout); |
break; |
break; |
case (NODE_EMPHASIS): |
case NODE_EDITOR: |
|
puts("editor: "); |
pnode_printmopen(p); |
pnode_printmopen(p); |
|
fputs("An", stdout); |
|
break; |
|
case NODE_EMAIL: |
|
pnode_printmopen(p); |
|
fputs("Aq Mt", stdout); |
|
break; |
|
case NODE_EMPHASIS: |
|
case NODE_FIRSTTERM: |
|
pnode_printmopen(p); |
fputs("Em", stdout); |
fputs("Em", stdout); |
break; |
break; |
case (NODE_ENVAR): |
case NODE_ENVAR: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Ev", stdout); |
fputs("Ev", stdout); |
break; |
break; |
case (NODE_FILENAME): |
case NODE_FILENAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Pa", stdout); |
fputs("Pa", stdout); |
break; |
break; |
case (NODE_FUNCTION): |
case NODE_FUNCTION: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fn", stdout); |
fputs("Fn", stdout); |
break; |
break; |
case (NODE_FUNCPROTOTYPE): |
case NODE_FUNCPROTOTYPE: |
assert(p->newln); |
assert(p->newln); |
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_FUNCSYNOPSISINFO): |
case NODE_FUNCSYNOPSISINFO: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fd", stdout); |
fputs("Fd", stdout); |
break; |
break; |
case (NODE_INFORMALEQUATION): |
case NODE_INDEXTERM: |
|
return; |
|
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
if ( ! p->newln) |
putchar('\n'); |
putchar('\n'); |
puts(".EQ"); |
puts(".EQ"); |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_INLINEEQUATION: |
fputc('$', stdout); |
fputc('$', stdout); |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_ITEMIZEDLIST): |
case NODE_ITEMIZEDLIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_GROUP): |
case NODE_GROUP: |
pnode_printgroup(p, pn); |
pnode_printgroup(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_LITERAL): |
case NODE_LEGALNOTICE: |
|
assert(p->newln); |
|
puts(".Sh LEGAL NOTICE"); |
|
break; |
|
case NODE_LINK: |
|
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
|
if (ccp == NULL) |
|
break; |
pnode_printmopen(p); |
pnode_printmopen(p); |
|
printf("Sx %s\n", ccp); |
|
p->newln = 1; |
|
return; |
|
case NODE_LITERAL: |
|
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_MML_MFENCED): |
case NODE_LITERALLAYOUT: |
|
assert(p->newln); |
|
printf(".Bd %s\n", pnode_getattr(pn, ATTRKEY_CLASS) == |
|
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
|
break; |
|
case NODE_MML_MFENCED: |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_MML_MROW: |
case (NODE_MML_MI): |
case NODE_MML_MI: |
case (NODE_MML_MN): |
case NODE_MML_MN: |
case (NODE_MML_MO): |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&pn->childq)) |
break; |
break; |
fputs(" { ", stdout); |
fputs(" { ", stdout); |
break; |
break; |
case (NODE_MML_MFRAC): |
case NODE_MML_MFRAC: |
case (NODE_MML_MSUB): |
case NODE_MML_MSUB: |
case (NODE_MML_MSUP): |
case NODE_MML_MSUP: |
pnode_printmath(p, pn); |
pnode_printmath(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_OPTION): |
case NODE_OPTION: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fl", stdout); |
fputs("Fl", stdout); |
break; |
break; |
case (NODE_ORDEREDLIST): |
case NODE_ORDEREDLIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_PARA): |
case NODE_PARA: |
assert(p->newln); |
pnode_printpara(p, pn); |
if (NULL != pn->parent && |
|
NODE_LISTITEM == pn->parent->node) |
|
break; |
|
puts(".Pp"); |
|
break; |
break; |
case (NODE_PARAMETER): |
case NODE_PARAMETER: |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fa \"", stdout); |
fputs("Fa \"", stdout); |
Line 1330 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1429 pnode_print(struct parse *p, struct pnode *pn) |
|
fputs("\"", stdout); |
fputs("\"", stdout); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_QUOTE): |
case NODE_QUOTE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Qo", stdout); |
fputs("Qo", stdout); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case NODE_PROGRAMLISTING: |
/* FALLTHROUGH */ |
case NODE_SCREEN: |
case (NODE_SCREEN): |
|
assert(p->newln); |
assert(p->newln); |
puts(".Bd -literal"); |
puts(".Bd -literal"); |
break; |
break; |
case (NODE_REFENTRYINFO): |
case NODE_REFENTRYINFO: |
/* Suppress. */ |
/* Suppress. */ |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_REFMETA): |
case NODE_REFMETA: |
abort(); |
abort(); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
Line 1355 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1453 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmacrolinepart(p, pn); |
pnode_printmacrolinepart(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_REFNAMEDIV): |
case NODE_REFNAMEDIV: |
assert(p->newln); |
assert(p->newln); |
puts(".Sh NAME"); |
puts(".Sh NAME"); |
break; |
break; |
case (NODE_REFPURPOSE): |
case NODE_REFPURPOSE: |
assert(p->newln); |
assert(p->newln); |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nd", stdout); |
fputs("Nd", stdout); |
break; |
break; |
case (NODE_REFSYNOPSISDIV): |
case NODE_REFSYNOPSISDIV: |
assert(p->newln); |
assert(p->newln); |
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
puts(".Sh SYNOPSIS"); |
puts(".Sh SYNOPSIS"); |
break; |
break; |
case (NODE_REFSECT1): |
case NODE_PREFACE: |
/* FALLTHROUGH */ |
case NODE_SECTION: |
case (NODE_REFSECT2): |
case NODE_NOTE: |
/* FALLTHROUGH */ |
case NODE_TIP: |
case (NODE_REFSECT3): |
case NODE_CAUTION: |
/* FALLTHROUGH */ |
case NODE_WARNING: |
case (NODE_REFSECTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_NOTE): |
|
/* FALLTHROUGH */ |
|
case (NODE_TIP): |
|
/* FALLTHROUGH */ |
|
case (NODE_CAUTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_WARNING): |
|
assert(p->newln); |
assert(p->newln); |
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
break; |
break; |
case (NODE_REPLACEABLE): |
case NODE_REPLACEABLE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Ar", stdout); |
fputs("Ar", stdout); |
break; |
break; |
case (NODE_SBR): |
case NODE_SBR: |
assert(p->newln); |
assert(p->newln); |
puts(".br"); |
puts(".br"); |
break; |
break; |
case (NODE_SGMLTAG): |
case NODE_SGMLTAG: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_STRUCTNAME): |
case NODE_STRUCTNAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
break; |
break; |
case (NODE_TABLE): |
case NODE_TABLE: |
/* FALLTHROUGH */ |
case NODE_INFORMALTABLE: |
case (NODE_INFORMALTABLE): |
|
assert(p->newln); |
assert(p->newln); |
pnode_printtable(p, pn); |
pnode_printtable(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_TEXT): |
case NODE_TEXT: |
if (0 == p->newln) |
if (p->newln == 0) |
putchar(' '); |
putchar(' '); |
|
|
bufclear(p); |
bufclear(p); |
bufappend(p, pn); |
bufappend(p, pn); |
|
|
if (0 == p->bsz) { |
if (p->bsz == 0) { |
assert(pn->real != pn->b); |
assert(pn->real != pn->b); |
break; |
break; |
} |
} |
Line 1436 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1524 pnode_print(struct parse *p, struct pnode *pn) |
|
* before the actual flags themselves. |
* before the actual flags themselves. |
* "Fl" does this for us, so remove it. |
* "Fl" does this for us, so remove it. |
*/ |
*/ |
if (NULL != pn->parent && |
if (pn->parent != NULL && |
NODE_OPTION == pn->parent->node && |
pn->parent->node == NODE_OPTION && |
'-' == *cp) |
*cp == '-') |
cp++; |
cp++; |
for (last = '\n'; '\0' != *cp; ) { |
for (last = '\n'; *cp != '\0'; ) { |
if ('\n' == last) { |
if (last == '\n') { |
/* Consume all whitespace. */ |
/* Consume all whitespace. */ |
if (isspace((unsigned char)*cp)) { |
if (isspace((unsigned char)*cp)) { |
while (isspace((unsigned char)*cp)) |
while (isspace((unsigned char)*cp)) |
cp++; |
cp++; |
continue; |
continue; |
} else if ('\'' == *cp || '.' == *cp) |
} else if (*cp == '\'' || *cp == '.') |
fputs("\\&", stdout); |
fputs("\\&", stdout); |
} |
} |
putchar(last = *cp++); |
putchar(last = *cp++); |
/* If we're a character escape, escape us. */ |
/* If we're a character escape, escape us. */ |
if ('\\' == last) |
if (last == '\\') |
putchar('e'); |
putchar('e'); |
} |
} |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_TYPE): |
case NODE_TITLE: |
|
if (pn->parent->node == NODE_BOOKINFO) { |
|
pnode_printmopen(p); |
|
fputs("Nd", stdout); |
|
} |
|
break; |
|
case NODE_TYPE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
break; |
break; |
case (NODE_USERINPUT): |
case NODE_USERINPUT: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_VARIABLELIST): |
case NODE_VARIABLELIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_VARLISTENTRY): |
case NODE_VARLISTENTRY: |
assert(p->newln); |
assert(p->newln); |
pnode_printvarlistentry(p, pn); |
pnode_printvarlistentry(p, pn); |
break; |
break; |
case (NODE_VARNAME): |
case NODE_VARNAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Va", stdout); |
fputs("Va", stdout); |
break; |
break; |
Line 1486 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1580 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_INFORMALEQUATION): |
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
if ( ! p->newln) |
putchar('\n'); |
putchar('\n'); |
puts(".EN"); |
puts(".EN"); |
p->newln = 1; |
p->newln = 1; |
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_INLINEEQUATION: |
fputs("$ ", stdout); |
fputs("$ ", stdout); |
p->newln = sv; |
p->newln = sv; |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_MML_MROW: |
case (NODE_MML_MI): |
case NODE_MML_MI: |
case (NODE_MML_MN): |
case NODE_MML_MN: |
case (NODE_MML_MO): |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&pn->childq)) |
break; |
break; |
fputs(" } ", stdout); |
fputs(" } ", stdout); |
break; |
break; |
case (NODE_APPLICATION): |
case NODE_APPLICATION: |
case (NODE_ARG): |
case NODE_ARG: |
case (NODE_CITEREFENTRY): |
case NODE_AUTHOR: |
case (NODE_CODE): |
case NODE_CITEREFENTRY: |
case (NODE_COMMAND): |
case NODE_CODE: |
case (NODE_CONSTANT): |
case NODE_COMMAND: |
case (NODE_EMPHASIS): |
case NODE_CONSTANT: |
case (NODE_ENVAR): |
case NODE_EDITOR: |
case (NODE_FILENAME): |
case NODE_EMAIL: |
case (NODE_FUNCTION): |
case NODE_EMPHASIS: |
case (NODE_FUNCSYNOPSISINFO): |
case NODE_ENVAR: |
case (NODE_LITERAL): |
case NODE_FILENAME: |
case (NODE_OPTION): |
case NODE_FIRSTTERM: |
case (NODE_PARAMETER): |
case NODE_FUNCTION: |
case (NODE_REPLACEABLE): |
case NODE_FUNCSYNOPSISINFO: |
case (NODE_REFPURPOSE): |
case NODE_LITERAL: |
case (NODE_SGMLTAG): |
case NODE_OPTION: |
case (NODE_STRUCTNAME): |
case NODE_PARAMETER: |
case (NODE_TEXT): |
case NODE_REPLACEABLE: |
case (NODE_TYPE): |
case NODE_REFPURPOSE: |
case (NODE_USERINPUT): |
case NODE_SGMLTAG: |
case (NODE_VARNAME): |
case NODE_STRUCTNAME: |
|
case NODE_TEXT: |
|
case NODE_TYPE: |
|
case NODE_USERINPUT: |
|
case NODE_VARNAME: |
pnode_printmclosepunct(p, pn, sv); |
pnode_printmclosepunct(p, pn, sv); |
break; |
break; |
case (NODE_QUOTE): |
case NODE_QUOTE: |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
sv = p->newln; |
sv = p->newln; |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Qc", stdout); |
fputs("Qc", stdout); |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_REFNAME: |
/* |
/* |
* If we're in the NAME macro and we have multiple |
* If we're in the NAME macro and we have multiple |
* <refname> macros in sequence, then print out a |
* <refname> macros in sequence, then print out a |
* trailing comma before the newline. |
* trailing comma before the newline. |
*/ |
*/ |
if (NULL != pn->parent && |
if (pn->parent != NULL && |
NODE_REFNAMEDIV == pn->parent->node && |
pn->parent->node == NODE_REFNAMEDIV && |
NULL != TAILQ_NEXT(pn, child) && |
TAILQ_NEXT(pn, child) != NULL && |
NODE_REFNAME == TAILQ_NEXT(pn, child)->node) |
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
fputs(" ,", stdout); |
fputs(" ,", stdout); |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case NODE_PREFACE: |
/* FALLTHROUGH */ |
case NODE_SECTION: |
case (NODE_SCREEN): |
case NODE_NOTE: |
|
case NODE_TIP: |
|
case NODE_CAUTION: |
|
case NODE_WARNING: |
|
p->level--; |
|
break; |
|
case NODE_LITERALLAYOUT: |
|
case NODE_PROGRAMLISTING: |
|
case NODE_SCREEN: |
assert(p->newln); |
assert(p->newln); |
puts(".Ed"); |
puts(".Ed"); |
p->newln = 1; |
p->newln = 1; |
break; |
break; |
|
case NODE_TITLE: |
|
if (pn->parent->node == NODE_BOOKINFO) { |
|
pnode_printmclose(p, 1); |
|
puts(".Sh AUTHORS"); |
|
} |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
Line 1583 readfile(XML_Parser xp, int fd, |
|
Line 1695 readfile(XML_Parser xp, int fd, |
|
XML_SetUserData(xp, &p); |
XML_SetUserData(xp, &p); |
|
|
while ((ssz = read(fd, b, bsz)) >= 0) { |
while ((ssz = read(fd, b, bsz)) >= 0) { |
if (0 == (rc = XML_Parse(xp, b, ssz, 0 == ssz))) |
if ((rc = XML_Parse(xp, b, ssz, 0 == ssz)) == 0) |
fprintf(stderr, "%s:%zu:%zu: %s\n", fn, |
fprintf(stderr, "%s:%zu:%zu: %s\n", fn, |
XML_GetCurrentLineNumber(xp), |
XML_GetCurrentLineNumber(xp), |
XML_GetCurrentColumnNumber(xp), |
XML_GetCurrentColumnNumber(xp), |
Line 1600 readfile(XML_Parser xp, int fd, |
|
Line 1712 readfile(XML_Parser xp, int fd, |
|
pnode_print(&p, p.root); |
pnode_print(&p, p.root); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
free(p.b); |
return(0 != rc && ! p.stop); |
return rc != 0 && p.stop == 0; |
} |
} |
|
|
/* Read error has occured. */ |
/* Read error has occured. */ |
perror(fn); |
perror(fn); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
free(p.b); |
return(0); |
return 0; |
} |
} |
|
|
int |
int |
Line 1628 main(int argc, char *argv[]) |
|
Line 1740 main(int argc, char *argv[]) |
|
fname = "-"; |
fname = "-"; |
xp = NULL; |
xp = NULL; |
buf = NULL; |
buf = NULL; |
rc = 0; |
rc = 1; |
|
|
while (-1 != (ch = getopt(argc, argv, "W"))) |
while ((ch = getopt(argc, argv, "W")) != -1) |
switch (ch) { |
switch (ch) { |
case ('W'): |
case 'W': |
warn = 1; |
warn = 1; |
break; |
break; |
default: |
default: |
Line 1649 main(int argc, char *argv[]) |
|
Line 1761 main(int argc, char *argv[]) |
|
fname = argv[0]; |
fname = argv[0]; |
|
|
/* Read from stdin or a file. */ |
/* Read from stdin or a file. */ |
fd = 0 == strcmp(fname, "-") ? |
fd = strcmp(fname, "-") == 0 ? |
STDIN_FILENO : open(fname, O_RDONLY, 0); |
STDIN_FILENO : open(fname, O_RDONLY, 0); |
|
|
/* |
/* |
Line 1658 main(int argc, char *argv[]) |
|
Line 1770 main(int argc, char *argv[]) |
|
* Create the parser context. |
* Create the parser context. |
* Dive directly into the parse. |
* Dive directly into the parse. |
*/ |
*/ |
if (-1 == fd) |
if (fd == -1) |
perror(fname); |
perror(fname); |
else if (NULL == (buf = malloc(4096))) |
else if ((buf = malloc(4096)) == NULL) |
perror(NULL); |
perror(NULL); |
else if (NULL == (xp = XML_ParserCreate(NULL))) |
else if ((xp = XML_ParserCreate(NULL)) == NULL) |
perror(NULL); |
perror(NULL); |
else if ( ! readfile(xp, fd, buf, 4096, fname)) |
else if (readfile(xp, fd, buf, 4096, fname)) |
rc = 1; |
rc = 0; |
|
|
XML_ParserFree(xp); |
XML_ParserFree(xp); |
free(buf); |
free(buf); |
if (STDIN_FILENO != fd) |
if (fd != STDIN_FILENO) |
close(fd); |
close(fd); |
return(rc ? EXIT_SUCCESS : EXIT_FAILURE); |
return rc; |
|
|
usage: |
usage: |
fprintf(stderr, "usage: %s [-W] [input_filename]\n", progname); |
fprintf(stderr, "usage: %s [-W] [input_filename]\n", progname); |
return(EXIT_FAILURE); |
return 1; |
} |
} |