version 1.60, 2019/03/22 17:01:10 |
version 1.144, 2019/05/01 11:34:19 |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#include <sys/queue.h> |
|
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <expat.h> |
|
#include <fcntl.h> |
|
#include <getopt.h> |
|
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <unistd.h> |
|
|
|
#include "extern.h" |
#include "xmalloc.h" |
|
#include "node.h" |
|
#include "macro.h" |
|
#include "format.h" |
|
|
/* |
/* |
* Global parse state. |
* The implementation of the mdoc(7) formatter. |
* Keep this as simple and small as possible. |
|
*/ |
*/ |
struct parse { |
|
XML_Parser xml; |
|
enum nodeid node; /* current (NODE_ROOT if pre-tree) */ |
|
const char *fname; /* filename */ |
|
int stop; /* should we stop now? */ |
|
#define PARSE_EQN 1 |
|
unsigned int flags; /* document-wide flags */ |
|
struct pnode *root; /* root of parse tree */ |
|
struct pnode *cur; /* current node in tree */ |
|
char *b; /* NUL-terminated buffer for pre-print */ |
|
size_t bsz; /* current length of b */ |
|
size_t mbsz; /* max bsz allocation */ |
|
int level; /* header level, starting at 1 */ |
|
int newln; /* output: are we on a fresh line */ |
|
}; |
|
|
|
struct node { |
static void pnode_print(struct format *, struct pnode *); |
const char *name; /* docbook element name */ |
|
enum nodeid node; /* docbook element to generate */ |
|
}; |
|
|
|
TAILQ_HEAD(pnodeq, pnode); |
|
TAILQ_HEAD(pattrq, pattr); |
|
|
|
struct pattr { |
|
enum attrkey key; |
|
enum attrval val; |
|
char *rawval; |
|
TAILQ_ENTRY(pattr) child; |
|
}; |
|
|
|
struct pnode { |
|
enum nodeid node; /* node type */ |
|
char *b; /* binary data buffer */ |
|
char *real; /* store for "b" */ |
|
size_t bsz; /* data buffer size */ |
|
struct pnode *parent; /* parent (or NULL if top) */ |
|
struct pnodeq childq; /* queue of children */ |
|
struct pattrq attrq; /* attributes of node */ |
|
TAILQ_ENTRY(pnode) child; |
|
}; |
|
|
|
static const char *attrkeys[ATTRKEY__MAX] = { |
|
"choice", |
|
"class", |
|
"close", |
|
"id", |
|
"linkend", |
|
"open", |
|
"rep" |
|
}; |
|
|
|
static const char *attrvals[ATTRVAL__MAX] = { |
|
"monospaced", |
|
"norepeat", |
|
"opt", |
|
"plain", |
|
"repeat", |
|
"req" |
|
}; |
|
|
|
static const struct node nodes[] = { |
|
{ "acronym", NODE_ACRONYM }, |
|
{ "affiliation", NODE_AFFILIATION }, |
|
{ "anchor", NODE_ANCHOR }, |
|
{ "application", NODE_APPLICATION }, |
|
{ "arg", NODE_ARG }, |
|
{ "author", NODE_AUTHOR }, |
|
{ "authorgroup", NODE_AUTHORGROUP }, |
|
{ "blockquote", NODE_BLOCKQUOTE }, |
|
{ "book", NODE_BOOK }, |
|
{ "bookinfo", NODE_BOOKINFO }, |
|
{ "caution", NODE_CAUTION }, |
|
{ "chapter", NODE_SECTION }, |
|
{ "citerefentry", NODE_CITEREFENTRY }, |
|
{ "citetitle", NODE_CITETITLE }, |
|
{ "cmdsynopsis", NODE_CMDSYNOPSIS }, |
|
{ "code", NODE_CODE }, |
|
{ "colspec", NODE_COLSPEC }, |
|
{ "command", NODE_COMMAND }, |
|
{ "constant", NODE_CONSTANT }, |
|
{ "copyright", NODE_COPYRIGHT }, |
|
{ "date", NODE_DATE }, |
|
{ "editor", NODE_EDITOR }, |
|
{ "emphasis", NODE_EMPHASIS }, |
|
{ "entry", NODE_ENTRY }, |
|
{ "envar", NODE_ENVAR }, |
|
{ "fieldsynopsis", NODE_FIELDSYNOPSIS }, |
|
{ "filename", NODE_FILENAME }, |
|
{ "firstname", NODE_FIRSTNAME }, |
|
{ "firstterm", NODE_FIRSTTERM }, |
|
{ "footnote", NODE_FOOTNOTE }, |
|
{ "funcdef", NODE_FUNCDEF }, |
|
{ "funcprototype", NODE_FUNCPROTOTYPE }, |
|
{ "funcsynopsis", NODE_FUNCSYNOPSIS }, |
|
{ "funcsynopsisinfo", NODE_FUNCSYNOPSISINFO }, |
|
{ "function", NODE_FUNCTION }, |
|
{ "glossterm", NODE_GLOSSTERM }, |
|
{ "group", NODE_GROUP }, |
|
{ "holder", NODE_HOLDER }, |
|
{ "index", NODE_INDEX }, |
|
{ "indexterm", NODE_INDEXTERM }, |
|
{ "info", NODE_INFO }, |
|
{ "informalequation", NODE_INFORMALEQUATION }, |
|
{ "informaltable", NODE_INFORMALTABLE }, |
|
{ "inlineequation", NODE_INLINEEQUATION }, |
|
{ "itemizedlist", NODE_ITEMIZEDLIST }, |
|
{ "keysym", NODE_KEYSYM }, |
|
{ "legalnotice", NODE_LEGALNOTICE }, |
|
{ "link", NODE_LINK }, |
|
{ "listitem", NODE_LISTITEM }, |
|
{ "literal", NODE_LITERAL }, |
|
{ "literallayout", NODE_LITERALLAYOUT }, |
|
{ "manvolnum", NODE_MANVOLNUM }, |
|
{ "member", NODE_MEMBER }, |
|
{ "mml:math", NODE_MML_MATH }, |
|
{ "mml:mfenced", NODE_MML_MFENCED }, |
|
{ "mml:mfrac", NODE_MML_MFRAC }, |
|
{ "mml:mi", NODE_MML_MI }, |
|
{ "mml:mn", NODE_MML_MN }, |
|
{ "mml:mo", NODE_MML_MO }, |
|
{ "mml:mrow", NODE_MML_MROW }, |
|
{ "mml:msub", NODE_MML_MSUB }, |
|
{ "mml:msup", NODE_MML_MSUP }, |
|
{ "modifier", NODE_MODIFIER }, |
|
{ "note", NODE_NOTE }, |
|
{ "option", NODE_OPTION }, |
|
{ "orderedlist", NODE_ORDEREDLIST }, |
|
{ "orgname", NODE_ORGNAME }, |
|
{ "othername", NODE_OTHERNAME }, |
|
{ "para", NODE_PARA }, |
|
{ "paramdef", NODE_PARAMDEF }, |
|
{ "parameter", NODE_PARAMETER }, |
|
{ "part", NODE_SECTION }, |
|
{ "phrase", NODE_PHRASE }, |
|
{ "preface", NODE_PREFACE }, |
|
{ "primary", NODE_PRIMARY }, |
|
{ "programlisting", NODE_PROGRAMLISTING }, |
|
{ "prompt", NODE_PROMPT }, |
|
{ "quote", NODE_QUOTE }, |
|
{ "refclass", NODE_REFCLASS }, |
|
{ "refdescriptor", NODE_REFDESCRIPTOR }, |
|
{ "refentry", NODE_REFENTRY }, |
|
{ "refentryinfo", NODE_REFENTRYINFO }, |
|
{ "refentrytitle", NODE_REFENTRYTITLE }, |
|
{ "refmeta", NODE_REFMETA }, |
|
{ "refmetainfo", NODE_REFMETAINFO }, |
|
{ "refmiscinfo", NODE_REFMISCINFO }, |
|
{ "refname", NODE_REFNAME }, |
|
{ "refnamediv", NODE_REFNAMEDIV }, |
|
{ "refpurpose", NODE_REFPURPOSE }, |
|
{ "refsect1", NODE_SECTION }, |
|
{ "refsect2", NODE_SECTION }, |
|
{ "refsect3", NODE_SECTION }, |
|
{ "refsection", NODE_SECTION }, |
|
{ "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 void |
static void |
pnode_print(struct parse *p, struct pnode *pn); |
pnode_printtext(struct format *f, struct pnode *n) |
|
|
/* |
|
* Process a stream of characters. |
|
* We store text as nodes in and of themselves. |
|
* If a text node is already open, append to it. |
|
* If it's not open, open one under the current context. |
|
*/ |
|
static void |
|
xml_char(void *arg, const XML_Char *p, int sz) |
|
{ |
{ |
struct parse *ps = arg; |
struct pnode *nn; |
struct pnode *dat; |
char *cp; |
int i; |
int accept_arg; |
|
|
/* Stopped or no tree yet. */ |
cp = n->b; |
if (ps->stop || NODE_ROOT == ps->node) |
accept_arg = f->flags & FMT_ARG; |
return; |
if (f->linestate == LINE_MACRO && !accept_arg && |
|
(n->flags & NFLAG_SPC) == 0) { |
assert(NULL != ps->cur); |
for (;;) { |
|
if (*cp == '\0') |
/* |
return; |
* Are we in the midst of processing text? |
if (strchr("!),.:;?]", *cp) == NULL) |
* If we're not processing text right now, then create a text |
|
* node for doing so. |
|
* However, don't do so unless we have some non-whitespace to |
|
* process: strip out all leading whitespace to be sure. |
|
*/ |
|
if (NODE_TEXT != ps->node) { |
|
for (i = 0; i < sz; i++) |
|
if ( ! isspace((unsigned char)p[i])) |
|
break; |
break; |
if (i == sz) |
printf(" %c", *cp++); |
return; |
|
p += i; |
|
sz -= i; |
|
dat = calloc(1, sizeof(struct pnode)); |
|
if (NULL == dat) { |
|
perror(NULL); |
|
exit(EXIT_FAILURE); |
|
} |
} |
|
if (isspace((unsigned char)*cp)) { |
dat->node = ps->node = NODE_TEXT; |
while (isspace((unsigned char)*cp)) |
dat->parent = ps->cur; |
cp++; |
TAILQ_INIT(&dat->childq); |
macro_close(f); |
TAILQ_INIT(&dat->attrq); |
} else { |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
fputs(" Ns", stdout); |
ps->cur = dat; |
f->flags &= FMT_IMPL; |
assert(NULL != ps->root); |
accept_arg = 1; |
|
} |
} |
} |
|
if (f->linestate == LINE_MACRO && !accept_arg && |
|
(f->flags & (FMT_CHILD | FMT_IMPL)) == 0) |
|
macro_close(f); |
|
|
/* Append to current buffer. */ |
/* |
assert(sz >= 0); |
* Text preceding a macro without intervening whitespace |
ps->cur->b = realloc(ps->cur->b, |
* requires a .Pf macro. |
ps->cur->bsz + (size_t)sz); |
* Set the spacing flag to avoid a redundant .Ns macro. |
if (NULL == ps->cur->b) { |
*/ |
perror(NULL); |
|
exit(EXIT_FAILURE); |
|
} |
|
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
|
ps->cur->bsz += (size_t)sz; |
|
ps->cur->real = ps->cur->b; |
|
} |
|
|
|
static void |
if (f->linestate != LINE_MACRO && |
pnode_trim(struct pnode *pn) |
(nn = TAILQ_NEXT(n, child)) != NULL && |
{ |
(nn->flags & NFLAG_SPC) == 0) { |
|
switch (pnode_class(nn->node)) { |
assert(NODE_TEXT == pn->node); |
case CLASS_LINE: |
for ( ; pn->bsz > 0; pn->bsz--) |
case CLASS_ENCL: |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
macro_open(f, "Pf"); |
|
accept_arg = 1; |
|
f->flags |= FMT_CHILD; |
|
nn->flags |= NFLAG_SPC; |
break; |
break; |
} |
default: |
|
break; |
|
} |
|
} |
|
|
/* |
switch (f->linestate) { |
* Begin an element. |
case LINE_NEW: |
* First, look for the element. |
break; |
* If we don't find it and we're not parsing, keep going. |
case LINE_TEXT: |
* If we don't find it and we're parsing, puke and exit. |
if (n->flags & NFLAG_SPC) { |
* If we find it but we're not parsing yet (i.e., it's not a refentry |
if (n->flags & NFLAG_LINE && |
* and thus out of context), keep going. |
pnode_class(n->node) == CLASS_TEXT) |
* If we find it and we're at the root and already have a tree, puke and |
macro_close(f); |
* exit (FIXME: I don't think this is right?). |
else |
* If we find it but we're parsing a text node, close out the text node, |
putchar(' '); |
* return to its parent, and keep going. |
} |
* Make sure that the element is in the right context. |
break; |
* Lastly, put the node onto our parse tree and continue. |
case LINE_MACRO: |
*/ |
if (accept_arg == 0) |
static void |
macro_close(f); |
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
else if (n->flags & NFLAG_SPC || |
{ |
(f->flags & FMT_ARG) == 0 || |
struct parse *ps = arg; |
(nn = TAILQ_PREV(n, pnodeq, child)) == NULL || |
const struct node *node; |
pnode_class(nn->node) != CLASS_TEXT) |
enum attrkey key; |
putchar(' '); |
enum attrval val; |
break; |
struct pnode *dat; |
|
struct pattr *pattr; |
|
const XML_Char **att; |
|
|
|
/* FIXME: find a better way to ditch other namespaces. */ |
|
if (ps->stop || 0 == strcmp(name, "xi:include")) |
|
return; |
|
|
|
/* Close out text node, if applicable... */ |
|
if (NODE_TEXT == ps->node) { |
|
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
|
ps->cur = ps->cur->parent; |
|
assert(NULL != ps->cur); |
|
ps->node = ps->cur->node; |
|
} |
} |
|
|
for (node = nodes; NULL != node->name; node++) |
if (n->node == NODE_ESCAPE) { |
if (0 == strcmp(node->name, name)) |
fputs(n->b, stdout); |
break; |
if (f->linestate == LINE_NEW) |
|
f->linestate = LINE_TEXT; |
if (NULL == node->name) { |
|
if (NODE_ROOT == ps->node) |
|
return; |
|
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
|
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), name); |
|
ps->stop = 1; |
|
return; |
return; |
} else if (NODE_ROOT == ps->node && NULL != ps->root) { |
|
fprintf(stderr, "%s:%zu:%zu: multiple refentries\n", |
|
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml)); |
|
ps->stop = 1; |
|
return; |
|
} |
} |
|
|
if (NODE_INLINEEQUATION == node->node) |
|
ps->flags |= PARSE_EQN; |
|
|
|
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
|
perror(NULL); |
|
exit(EXIT_FAILURE); |
|
} |
|
|
|
dat->node = ps->node = node->node; |
|
dat->parent = ps->cur; |
|
TAILQ_INIT(&dat->childq); |
|
TAILQ_INIT(&dat->attrq); |
|
|
|
if (NULL != ps->cur) |
|
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
|
|
|
ps->cur = dat; |
|
if (NULL == ps->root) |
|
ps->root = dat; |
|
|
|
/* |
/* |
* Process attributes. |
* Remove the prefix '-' from <option> elements |
|
* because the arguments of .Fl macros do not need it. |
*/ |
*/ |
for (att = atts; NULL != *att; att += 2) { |
|
for (key = 0; key < ATTRKEY__MAX; key++) |
|
if (0 == strcmp(*att, attrkeys[key])) |
|
break; |
|
if (ATTRKEY__MAX == key) { |
|
if (warn) |
|
fprintf(stderr, "%s:%zu:%zu: warning: " |
|
"unknown attribute \"%s\"\n", |
|
ps->fname, |
|
XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), |
|
*att); |
|
continue; |
|
} |
|
for (val = 0; val < ATTRVAL__MAX; val++) |
|
if (0 == strcmp(*(att + 1), attrvals[val])) |
|
break; |
|
pattr = calloc(1, sizeof(struct pattr)); |
|
pattr->key = key; |
|
pattr->val = val; |
|
if (ATTRVAL__MAX == val) |
|
pattr->rawval = strdup(*(att + 1)); |
|
TAILQ_INSERT_TAIL(&dat->attrq, pattr, child); |
|
} |
|
|
|
|
if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-') |
|
cp++; |
|
|
|
if (f->linestate == LINE_MACRO) |
|
macro_addarg(f, cp, 0); |
|
else |
|
print_text(f, cp, 0); |
} |
} |
|
|
/* |
|
* Roll up the parse tree. |
|
* If we're at a text node, roll that one up first. |
|
* If we hit the root, then assign ourselves as the NODE_ROOT. |
|
*/ |
|
static void |
static void |
xml_elem_end(void *arg, const XML_Char *name) |
pnode_printimagedata(struct format *f, struct pnode *n) |
{ |
{ |
struct parse *ps = arg; |
const char *cp; |
|
|
/* FIXME: find a better way to ditch other namespaces. */ |
if ((cp = pnode_getattr_raw(n, ATTRKEY_FILEREF, NULL)) == NULL) |
if (ps->stop || NODE_ROOT == ps->node) |
cp = pnode_getattr_raw(n, ATTRKEY_ENTITYREF, NULL); |
return; |
if (cp != NULL) { |
else if (0 == strcmp(name, "xi:include")) |
print_text(f, "[image:", ARG_SPACE); |
return; |
print_text(f, cp, ARG_SPACE); |
|
print_text(f, "]", 0); |
/* Close out text node, if applicable... */ |
} else |
if (NODE_TEXT == ps->node) { |
print_text(f, "[image]", ARG_SPACE); |
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
|
ps->cur = ps->cur->parent; |
|
assert(NULL != ps->cur); |
|
ps->node = ps->cur->node; |
|
} |
|
|
|
if (NULL == (ps->cur = ps->cur->parent)) |
|
ps->node = NODE_ROOT; |
|
else |
|
ps->node = ps->cur->node; |
|
} |
} |
|
|
/* |
|
* Recursively free a node (NULL is ok). |
|
*/ |
|
static void |
static void |
pnode_free(struct pnode *pn) |
pnode_printrefnamediv(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn; |
struct pattr *ap; |
int comma; |
|
|
if (NULL == pn) |
f->parastate = PARA_HAVE; |
return; |
macro_line(f, "Sh NAME"); |
|
f->parastate = PARA_HAVE; |
while (NULL != (pp = TAILQ_FIRST(&pn->childq))) { |
comma = 0; |
TAILQ_REMOVE(&pn->childq, pp, child); |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
pnode_free(pp); |
if (nc->node != NODE_REFNAME) |
|
continue; |
|
if (comma) |
|
macro_addarg(f, ",", ARG_SPACE); |
|
macro_open(f, "Nm"); |
|
macro_addnode(f, nc, ARG_SPACE); |
|
pnode_unlink(nc); |
|
comma = 1; |
} |
} |
|
macro_close(f); |
while (NULL != (ap = TAILQ_FIRST(&pn->attrq))) { |
|
TAILQ_REMOVE(&pn->attrq, ap, child); |
|
free(ap->rawval); |
|
free(ap); |
|
} |
|
|
|
free(pn->real); |
|
free(pn); |
|
} |
} |
|
|
/* |
/* |
* Unlink a node from its parent and pnode_free() it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
static void |
static void |
pnode_unlink(struct pnode *pn) |
pnode_printrefsynopsisdiv(struct format *f, struct pnode *n) |
{ |
{ |
|
struct pnode *nc, *nn; |
|
|
if (NULL != pn->parent) |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) |
TAILQ_REMOVE(&pn->parent->childq, pn, child); |
if (nc->node == NODE_TITLE) |
pnode_free(pn); |
pnode_unlink(nc); |
|
|
|
f->parastate = PARA_HAVE; |
|
macro_line(f, "Sh SYNOPSIS"); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
/* |
/* |
* Unlink all children of a node and pnode_free() them. |
* Start a hopefully-named `Sh' section. |
*/ |
*/ |
static void |
static void |
pnode_unlinksub(struct pnode *pn) |
pnode_printsection(struct format *f, struct pnode *n) |
{ |
{ |
|
struct pnode *nc, *ncc; |
|
int flags, level; |
|
|
while ( ! TAILQ_EMPTY(&pn->childq)) |
if (n->parent == NULL) |
pnode_unlink(TAILQ_FIRST(&pn->childq)); |
return; |
} |
|
|
|
/* |
level = ++f->level; |
* Retrieve an enumeration attribute from a node. |
flags = ARG_SPACE; |
* Return ATTRVAL__MAX if the node has no such attribute. |
switch (n->node) { |
*/ |
case NODE_SECTION: |
enum attrval |
case NODE_APPENDIX: |
pnode_getattr(struct pnode *pn, enum attrkey key) |
if (level == 1) |
{ |
flags |= ARG_UPPER; |
struct pattr *ap; |
break; |
|
case NODE_SIMPLESECT: |
|
if (level < 2) |
|
level = 2; |
|
break; |
|
case NODE_NOTE: |
|
if (level < 3) |
|
level = 3; |
|
break; |
|
default: |
|
abort(); |
|
} |
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(nc, &n->childq, child) |
if (ap->key == key) |
if (nc->node == NODE_TITLE) |
return ap->val; |
break; |
return(ATTRVAL__MAX); |
|
} |
|
|
|
/* |
switch (level) { |
* Retrieve an attribute string from a node. |
case 1: |
* Return defval if the node has no such attribute. |
macro_close(f); |
*/ |
f->parastate = PARA_HAVE; |
const char * |
macro_open(f, "Sh"); |
pnode_getattr_raw(struct pnode *pn, enum attrkey key, const char *defval) |
break; |
{ |
case 2: |
struct pattr *ap; |
macro_close(f); |
|
f->parastate = PARA_HAVE; |
|
macro_open(f, "Ss"); |
|
break; |
|
default: |
|
if (f->parastate == PARA_MID) |
|
f->parastate = PARA_WANT; |
|
macro_open(f, "Sy"); |
|
break; |
|
} |
|
macro_addnode(f, nc, flags); |
|
macro_close(f); |
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
/* |
if (ap->key == key) |
* DocBook has no equivalent for -split mode, |
return ATTRVAL__MAX == ap->val ? ap->rawval : |
* so just switch the default in the AUTHORS section. |
attrvals[ap->val]; |
*/ |
return(defval); |
|
} |
|
|
|
/* |
if (nc != NULL) { |
* Reset the lookaside buffer. |
if (level == 1 && |
*/ |
(ncc = TAILQ_FIRST(&nc->childq)) != NULL && |
static void |
ncc->node == NODE_TEXT && |
bufclear(struct parse *p) |
strcasecmp(ncc->b, "AUTHORS") == 0) |
{ |
macro_line(f, "An -nosplit"); |
|
pnode_unlink(nc); |
p->b[p->bsz = 0] = '\0'; |
} |
|
f->parastate = level > 2 ? PARA_WANT : PARA_HAVE; |
} |
} |
|
|
/* |
/* |
* Append NODE_TEXT contents to the current buffer, reallocating its |
* Start a reference, extracting the title and volume. |
* size if necessary. |
|
* The buffer is ALWAYS NUL-terminated. |
|
*/ |
*/ |
static void |
static void |
bufappend(struct parse *p, struct pnode *pn) |
pnode_printciterefentry(struct format *f, struct pnode *n) |
{ |
{ |
|
struct pnode *nc, *title, *manvol; |
|
|
assert(NODE_TEXT == pn->node); |
title = manvol = NULL; |
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
TAILQ_FOREACH(nc, &n->childq, child) { |
p->mbsz = p->bsz + pn->bsz + 1; |
if (nc->node == NODE_MANVOLNUM) |
if (NULL == (p->b = realloc(p->b, p->mbsz))) { |
manvol = nc; |
perror(NULL); |
else if (nc->node == NODE_REFENTRYTITLE) |
exit(EXIT_FAILURE); |
title = nc; |
} |
|
} |
} |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
macro_open(f, "Xr"); |
p->bsz += pn->bsz; |
if (title == NULL) |
p->b[p->bsz] = '\0'; |
macro_addarg(f, "unknown", ARG_SPACE); |
|
else |
|
macro_addnode(f, title, ARG_SPACE | ARG_SINGLE); |
|
if (manvol == NULL) |
|
macro_addarg(f, "1", ARG_SPACE); |
|
else |
|
macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(n); |
} |
} |
|
|
/* |
/* |
* Recursively append all NODE_TEXT nodes to the buffer. |
* The <mml:mfenced> node is a little peculiar. |
* This descends into non-text nodes, but doesn't do anything beyond |
* First, it can have arbitrary open and closing tokens, which default |
* them. |
* to parentheses. |
* In other words, this is a recursive text grok. |
* Second, >1 arguments are separated by commas. |
*/ |
*/ |
static void |
static void |
bufappend_r(struct parse *p, struct pnode *pn) |
pnode_printmathfenced(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
if (NODE_TEXT == pn->node) |
printf("left %s ", pnode_getattr_raw(n, ATTRKEY_OPEN, "(")); |
bufappend(p, pn); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
bufappend_r(p, pp); |
|
} |
|
|
|
/* |
nc = TAILQ_FIRST(&n->childq); |
* Recursively search and return the first instance of "node". |
pnode_print(f, nc); |
*/ |
|
static struct pnode * |
|
pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
{ |
|
struct pnode *pp, *res; |
|
|
|
res = NULL; |
while ((nc = TAILQ_NEXT(nc, child)) != NULL) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
putchar(','); |
res = pp->node == node ? pp : |
pnode_print(f, nc); |
pnode_findfirst(pp, node); |
|
if (NULL != res) |
|
break; |
|
} |
} |
|
printf("right %s ", pnode_getattr_raw(n, ATTRKEY_CLOSE, ")")); |
return(res); |
pnode_unlinksub(n); |
} |
} |
|
|
#define MACROLINE_NORM 0 |
|
#define MACROLINE_UPPER 1 |
|
#define MACROLINE_NOWS 2 |
|
/* |
/* |
* Recursively print text presumably on a macro line. |
* These math nodes require special handling because they have infix |
* Convert all whitespace to regular spaces. |
* syntax, instead of the usual prefix or prefix. |
|
* So we need to break up the first and second child node with a |
|
* particular eqn(7) word. |
*/ |
*/ |
static void |
static void |
pnode_printmacrolinetext(struct parse *p, struct pnode *pn, int fl) |
pnode_printmath(struct format *f, struct pnode *n) |
{ |
{ |
char *cp; |
struct pnode *nc; |
|
|
if (0 == p->newln && ! (MACROLINE_NOWS & fl)) |
nc = TAILQ_FIRST(&n->childq); |
putchar(' '); |
pnode_print(f, nc); |
|
|
bufclear(p); |
switch (n->node) { |
bufappend_r(p, pn); |
case NODE_MML_MSUP: |
|
fputs(" sup ", stdout); |
/* Convert all space to spaces. */ |
break; |
for (cp = p->b; '\0' != *cp; cp++) |
case NODE_MML_MFRAC: |
if (isspace((unsigned char)*cp)) |
fputs(" over ", stdout); |
*cp = ' '; |
break; |
|
case NODE_MML_MSUB: |
for (cp = p->b; isspace((unsigned char)*cp); cp++) |
fputs(" sub ", stdout); |
/* Spin past whitespace (XXX: necessary?) */ ; |
break; |
for ( ; '\0' != *cp; cp++) { |
default: |
/* Escape us if we look like a macro. */ |
break; |
if ((cp == p->b || ' ' == *(cp - 1)) && |
|
isupper((unsigned char)*cp) && |
|
'\0' != *(cp + 1) && |
|
islower((unsigned char)*(cp + 1)) && |
|
('\0' == *(cp + 2) || |
|
' ' == *(cp + 2) || |
|
(islower((unsigned char)*(cp + 2)) && |
|
('\0' == *(cp + 3) || |
|
' ' == *(cp + 3))))) |
|
fputs("\\&", stdout); |
|
if (MACROLINE_UPPER & fl) |
|
putchar(toupper((unsigned char)*cp)); |
|
else |
|
putchar(*cp); |
|
/* If we're a character escape, escape us. */ |
|
if ('\\' == *cp) |
|
putchar('e'); |
|
} |
} |
|
|
|
nc = TAILQ_NEXT(nc, child); |
|
pnode_print(f, nc); |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printmacrolinepart(struct parse *p, struct pnode *pn) |
pnode_printfuncprototype(struct format *f, struct pnode *n) |
{ |
{ |
|
struct pnode *fdef, *ftype, *nc, *nn; |
|
|
pnode_printmacrolinetext(p, pn, 0); |
/* |
} |
* Extract <funcdef> child and ignore <void> child. |
|
* Leave other children in place, to be treated as parameters. |
|
*/ |
|
|
/* |
fdef = NULL; |
* Just pnode_printmacrolinepart() but with a newline. |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
* If no text, just the newline. |
switch (nc->node) { |
*/ |
case NODE_FUNCDEF: |
static void |
if (fdef == NULL) { |
pnode_printmacroline(struct parse *p, struct pnode *pn) |
fdef = nc; |
{ |
TAILQ_REMOVE(&n->childq, nc, child); |
|
nc->parent = NULL; |
|
} |
|
break; |
|
case NODE_VOID: |
|
pnode_unlink(nc); |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
assert(0 == p->newln); |
/* |
pnode_printmacrolinetext(p, pn, 0); |
* If no children are left, the function is void; use .Fn. |
putchar('\n'); |
* Otherwise, use .Fo. |
p->newln = 1; |
*/ |
} |
|
|
|
static void |
nc = TAILQ_FIRST(&n->childq); |
pnode_printmopen(struct parse *p) |
if (fdef != NULL) { |
{ |
ftype = TAILQ_FIRST(&fdef->childq); |
if (p->newln) { |
if (ftype != NULL && ftype->node == NODE_TEXT) { |
putchar('.'); |
macro_argline(f, "Ft", ftype->b); |
p->newln = 0; |
pnode_unlink(ftype); |
} else |
} |
putchar(' '); |
if (nc == NULL) { |
} |
macro_open(f, "Fn"); |
|
macro_addnode(f, fdef, ARG_SPACE | ARG_SINGLE); |
|
macro_addarg(f, "void", ARG_SPACE); |
|
macro_close(f); |
|
} else |
|
macro_nodeline(f, "Fo", fdef, ARG_SINGLE); |
|
pnode_unlink(fdef); |
|
} else if (nc == NULL) |
|
macro_line(f, "Fn UNKNOWN void"); |
|
else |
|
macro_line(f, "Fo UNKNOWN"); |
|
|
static void |
if (nc == NULL) |
pnode_printmclose(struct parse *p, int sv) |
return; |
{ |
|
|
|
if (sv && ! p->newln) { |
while (nc != NULL) { |
putchar('\n'); |
macro_nodeline(f, "Fa", nc, ARG_SINGLE); |
p->newln = 1; |
pnode_unlink(nc); |
|
nc = TAILQ_FIRST(&n->childq); |
} |
} |
|
macro_line(f, "Fc"); |
} |
} |
|
|
/* |
/* |
* Like pnode_printmclose() except we look to the next node, and, if |
* The <arg> element is more complicated than it should be because text |
* found, see if it starts with punctuation. |
* nodes are treated like ".Ar foo", but non-text nodes need to be |
* If it does, then we print that punctuation before the newline. |
* re-sent into the printer (i.e., without the preceding ".Ar"). |
|
* This also handles the case of "repetition" (or in other words, the |
|
* ellipsis following an argument) and optionality. |
*/ |
*/ |
static void |
static void |
pnode_printmclosepunct(struct parse *p, struct pnode *pn, int sv) |
pnode_printarg(struct format *f, struct pnode *n) |
{ |
{ |
/* We wouldn't have done anything anyway. */ |
struct pnode *nc; |
if ( ! (sv && ! p->newln)) |
struct pattr *a; |
return; |
int isop, isrep, was_impl; |
|
|
/* No next node or it's not text. */ |
isop = 1; |
if (NULL == (pn = TAILQ_NEXT(pn, child))) { |
isrep = was_impl = 0; |
pnode_printmclose(p, sv); |
TAILQ_FOREACH(a, &n->attrq, child) { |
return; |
if (a->key == ATTRKEY_CHOICE && |
} else if (NODE_TEXT != pn->node) { |
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
pnode_printmclose(p, sv); |
isop = 0; |
return; |
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
|
isrep = 1; |
} |
} |
|
if (isop) { |
/* Only do this for the comma/period. */ |
if (f->flags & FMT_IMPL) { |
if (pn->bsz > 0 && |
was_impl = 1; |
(',' == pn->b[0] || '.' == pn->b[0]) && |
macro_open(f, "Oo"); |
(1 == pn->bsz || isspace((unsigned char)pn->b[1]))) { |
} else { |
putchar(' '); |
macro_open(f, "Op"); |
putchar(pn->b[0]); |
f->flags |= FMT_IMPL; |
pn->b++; |
} |
pn->bsz--; |
|
} |
} |
|
TAILQ_FOREACH(nc, &n->childq, child) { |
putchar('\n'); |
if (nc->node == NODE_TEXT) |
p->newln = 1; |
macro_open(f, "Ar"); |
|
pnode_print(f, nc); |
|
} |
|
if (isrep && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "...", ARG_SPACE); |
|
if (isop) { |
|
if (was_impl) |
|
macro_open(f, "Oc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printpara(struct parse *p, struct pnode *pn) |
pnode_printgroup(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
struct pattr *a; |
|
int bar, isop, isrep, was_impl; |
|
|
assert(p->newln); |
isop = 1; |
if (NULL == pn->parent || NODE_LISTITEM == pn->parent->node) |
isrep = was_impl = 0; |
return; |
TAILQ_FOREACH(a, &n->attrq, child) { |
|
if (a->key == ATTRKEY_CHOICE && |
pp = TAILQ_PREV(pn, pnodeq, child); |
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
if (NULL == pp) |
isop = 0; |
pp = pn->parent; |
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
if ((NODE_SECTION != pp->node && NODE_PREFACE != pp->node) || |
isrep = 1; |
2 < p->level) |
} |
puts(".Pp"); |
if (isop) { |
|
if (f->flags & FMT_IMPL) { |
|
was_impl = 1; |
|
macro_open(f, "Oo"); |
|
} else { |
|
macro_open(f, "Op"); |
|
f->flags |= FMT_IMPL; |
|
} |
|
} else if (isrep) { |
|
if (f->flags & FMT_IMPL) { |
|
was_impl = 1; |
|
macro_open(f, "Bro"); |
|
} else { |
|
macro_open(f, "Brq"); |
|
f->flags |= FMT_IMPL; |
|
} |
|
} |
|
bar = 0; |
|
TAILQ_FOREACH(nc, &n->childq, child) { |
|
if (bar && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "|", ARG_SPACE); |
|
pnode_print(f, nc); |
|
bar = 1; |
|
} |
|
if (isop) { |
|
if (was_impl) |
|
macro_open(f, "Oc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} else if (isrep) { |
|
if (was_impl) |
|
macro_open(f, "Brc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} |
|
if (isrep && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "...", ARG_SPACE); |
|
pnode_unlinksub(n); |
} |
} |
|
|
/* |
|
* If the SYNOPSIS macro has a superfluous title, kill it. |
|
*/ |
|
static void |
static void |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
pnode_printsystemitem(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
switch (pnode_getattr(n, ATTRKEY_CLASS)) { |
|
case ATTRVAL_IPADDRESS: |
TAILQ_FOREACH(pp, &pn->childq, child) |
break; |
if (NODE_TITLE == pp->node) { |
case ATTRVAL_SYSTEMNAME: |
pnode_unlink(pp); |
macro_open(f, "Pa"); |
return; |
break; |
} |
case ATTRVAL_EVENT: |
|
default: |
|
macro_open(f, "Sy"); |
|
break; |
|
} |
} |
} |
|
|
/* |
|
* Start a hopefully-named `Sh' section. |
|
*/ |
|
static void |
static void |
pnode_printrefsect(struct parse *p, struct pnode *pn) |
pnode_printauthor(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn; |
const char *title; |
int have_contrib, have_name; |
int flags, level; |
|
|
|
if (NULL == pn->parent) |
/* |
return; |
* Print <contrib> children up front, before the .An scope, |
|
* and figure out whether we a name of a person. |
|
*/ |
|
|
level = ++p->level; |
have_contrib = have_name = 0; |
flags = 1 == level ? MACROLINE_UPPER : 0; |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
if (3 > level) { |
switch (nc->node) { |
switch (pn->node) { |
case NODE_CONTRIB: |
case (NODE_CAUTION): |
if (have_contrib) |
case (NODE_NOTE): |
print_text(f, ",", 0); |
case (NODE_TIP): |
print_textnode(f, nc); |
case (NODE_WARNING): |
pnode_unlink(nc); |
level = 3; |
have_contrib = 1; |
break; |
break; |
|
case NODE_PERSONNAME: |
|
have_name = 1; |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
} |
} |
|
if (TAILQ_FIRST(&n->childq) == NULL) |
|
return; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
if (have_contrib) |
if (NODE_TITLE == pp->node) |
print_text(f, ":", 0); |
break; |
|
|
|
if (NULL == pp) { |
/* |
switch (pn->node) { |
* If we have a name, print it in the .An scope and leave |
case (NODE_PREFACE): |
* all other content for child handlers, to print after the |
title = "Preface"; |
* scope. Otherwise, print everything in the scope. |
break; |
*/ |
case (NODE_CAUTION): |
|
title = "Caution"; |
macro_open(f, "An"); |
break; |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
case (NODE_NOTE): |
if (nc->node == NODE_PERSONNAME || have_name == 0) { |
title = "Note"; |
macro_addnode(f, nc, ARG_SPACE); |
break; |
pnode_unlink(nc); |
case (NODE_TIP): |
|
title = "Tip"; |
|
break; |
|
case (NODE_WARNING): |
|
title = "Warning"; |
|
break; |
|
default: |
|
title = "Unknown"; |
|
break; |
|
} |
} |
} |
} |
|
|
switch (level) { |
/* |
case (1): |
* If there is an email address, |
fputs(".Sh", stdout); |
* print it on the same macro line. |
break; |
*/ |
case (2): |
|
fputs(".Ss", stdout); |
if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) { |
break; |
f->flags |= FMT_CHILD; |
default: |
macro_open(f, "Aq Mt"); |
pnode_printpara(p, pn); |
macro_addnode(f, nc, ARG_SPACE); |
fputs(".Sy", stdout); |
pnode_unlink(nc); |
break; |
|
} |
} |
|
|
if (NULL != pp) { |
/* |
p->newln = 0; |
* If there are still unprinted children, end the scope |
pnode_printmacrolinetext(p, pp, flags); |
* with a comma. Otherwise, leave the scope open in case |
pnode_printmclose(p, 1); |
* a text node follows that starts with closing punctuation. |
pnode_unlink(pp); |
*/ |
} else |
|
printf(" %s\n", title); |
|
} |
|
|
|
/* |
if (TAILQ_FIRST(&n->childq) != NULL) { |
* Start a reference, extracting the title and volume. |
macro_addarg(f, ",", ARG_SPACE); |
*/ |
macro_close(f); |
static void |
} |
pnode_printciterefentry(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *title, *manvol; |
|
|
|
title = manvol = NULL; |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_MANVOLNUM == pp->node) |
|
manvol = pp; |
|
else if (NODE_REFENTRYTITLE == pp->node) |
|
title = pp; |
|
|
|
if (NULL != title) { |
|
pnode_printmacrolinepart(p, title); |
|
} else |
|
fputs(" unknown ", stdout); |
|
|
|
if (NULL == manvol) { |
|
puts(" 1"); |
|
p->newln = 1; |
|
} else |
|
pnode_printmacrolinepart(p, manvol); |
|
} |
} |
|
|
static void |
static void |
pnode_printrefmeta(struct parse *p, struct pnode *pn) |
pnode_printxref(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *title, *manvol; |
const char *linkend; |
|
|
title = manvol = NULL; |
linkend = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL); |
assert(p->newln); |
if (linkend != NULL) { |
TAILQ_FOREACH(pp, &pn->childq, child) |
macro_open(f, "Sx"); |
if (NODE_MANVOLNUM == pp->node) |
macro_addarg(f, linkend, ARG_SPACE); |
manvol = pp; |
} |
else if (NODE_REFENTRYTITLE == pp->node) |
|
title = pp; |
|
|
|
fputs(".Dt", stdout); |
|
p->newln = 0; |
|
|
|
if (NULL != title) |
|
pnode_printmacrolinetext(p, title, MACROLINE_UPPER); |
|
else |
|
fputs(" UNKNOWN ", stdout); |
|
|
|
if (NULL == manvol) { |
|
puts(" 1"); |
|
p->newln = 1; |
|
} else |
|
pnode_printmacroline(p, manvol); |
|
} |
} |
|
|
static void |
static void |
pnode_printfuncdef(struct parse *p, struct pnode *pn) |
pnode_printlink(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *ftype, *func; |
struct pnode *nc; |
|
const char *uri, *text; |
|
|
assert(p->newln); |
uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL); |
ftype = func = NULL; |
if (uri != NULL) { |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (TAILQ_FIRST(&n->childq) != NULL) { |
if (NODE_TEXT == pp->node) |
TAILQ_FOREACH(nc, &n->childq, child) |
ftype = pp; |
pnode_print(f, nc); |
else if (NODE_FUNCTION == pp->node) |
text = ""; |
func = pp; |
} else if ((text = pnode_getattr_raw(n, |
|
ATTRKEY_ENDTERM, NULL)) != NULL) { |
if (NULL != ftype) { |
if (f->linestate == LINE_MACRO && f->flags & FMT_ARG) |
fputs(".Ft", stdout); |
macro_addarg(f, text, ARG_SPACE); |
p->newln = 0; |
else |
pnode_printmacroline(p, ftype); |
print_text(f, text, ARG_SPACE); |
|
} |
|
if (text != NULL) { |
|
if (f->flags & FMT_IMPL) |
|
macro_open(f, "Po"); |
|
else { |
|
macro_open(f, "Pq"); |
|
f->flags |= FMT_CHILD; |
|
} |
|
} |
|
macro_open(f, "Sx"); |
|
macro_addarg(f, uri, ARG_SPACE); |
|
if (text != NULL && f->flags & FMT_IMPL) |
|
macro_open(f, "Pc"); |
|
pnode_unlinksub(n); |
|
return; |
} |
} |
|
uri = pnode_getattr_raw(n, ATTRKEY_XLINK_HREF, NULL); |
if (NULL != func) { |
if (uri == NULL) |
fputs(".Fo", stdout); |
uri = pnode_getattr_raw(n, ATTRKEY_URL, NULL); |
p->newln = 0; |
if (uri != NULL) { |
pnode_printmacroline(p, func); |
macro_open(f, "Lk"); |
} else { |
macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE); |
puts(".Fo UNKNOWN"); |
if (TAILQ_FIRST(&n->childq) != NULL) |
p->newln = 1; |
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(n); |
} |
} |
} |
} |
|
|
static void |
static void |
pnode_printparamdef(struct parse *p, struct pnode *pn) |
pnode_printolink(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *ptype, *param; |
const char *uri, *ptr, *local; |
|
|
assert(p->newln); |
uri = pnode_getattr_raw(n, ATTRKEY_TARGETDOC, NULL); |
ptype = param = NULL; |
ptr = pnode_getattr_raw(n, ATTRKEY_TARGETPTR, NULL); |
TAILQ_FOREACH(pp, &pn->childq, child) |
local = pnode_getattr_raw(n, ATTRKEY_LOCALINFO, NULL); |
if (NODE_TEXT == pp->node) |
if (uri == NULL) { |
ptype = pp; |
uri = ptr; |
else if (NODE_PARAMETER == pp->node) |
ptr = NULL; |
param = pp; |
|
|
|
fputs(".Fa \"", stdout); |
|
p->newln = 0; |
|
if (NULL != ptype) { |
|
pnode_printmacrolinetext(p, ptype, MACROLINE_NOWS); |
|
putchar(' '); |
|
} |
} |
|
if (uri == NULL) { |
|
uri = local; |
|
local = NULL; |
|
} |
|
if (uri == NULL) |
|
return; |
|
|
if (NULL != param) |
macro_open(f, "Lk"); |
pnode_printmacrolinepart(p, param); |
macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE); |
|
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
puts("\""); |
if (ptr != NULL || local != NULL) { |
p->newln = 1; |
macro_close(f); |
|
macro_open(f, "Pq"); |
|
if (ptr != NULL) |
|
macro_addarg(f, ptr, ARG_SPACE); |
|
if (local != NULL) |
|
macro_addarg(f, local, ARG_SPACE); |
|
} |
|
pnode_unlinksub(n); |
} |
} |
|
|
/* |
|
* The <mml:mfenced> node is a little peculiar. |
|
* First, it can have arbitrary open and closing tokens, which default |
|
* to parentheses. |
|
* Second, >1 arguments are separated by commas. |
|
*/ |
|
static void |
static void |
pnode_printmathfenced(struct parse *p, struct pnode *pn) |
pnode_printprologue(struct format *f, struct pnode *root) |
{ |
{ |
struct pnode *pp; |
struct pnode *name, *nc; |
|
|
printf("left %s ", pnode_getattr_raw(pn, ATTRKEY_OPEN, "(")); |
nc = TAILQ_FIRST(&root->childq); |
|
assert(nc->node == NODE_DATE); |
|
macro_nodeline(f, "Dd", nc, 0); |
|
pnode_unlink(nc); |
|
|
pp = TAILQ_FIRST(&pn->childq); |
macro_open(f, "Dt"); |
pnode_print(p, pp); |
name = TAILQ_FIRST(&root->childq); |
|
assert(name->node == NODE_REFENTRYTITLE); |
|
macro_addnode(f, name, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
TAILQ_REMOVE(&root->childq, name, child); |
|
name->parent = NULL; |
|
nc = TAILQ_FIRST(&root->childq); |
|
assert (nc->node == NODE_MANVOLNUM); |
|
macro_addnode(f, nc, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlink(nc); |
|
|
while (NULL != (pp = TAILQ_NEXT(pp, child))) { |
macro_line(f, "Os"); |
putchar(','); |
|
pnode_print(p, pp); |
|
} |
|
|
|
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
nc = TAILQ_FIRST(&root->childq); |
|
if (nc != NULL && nc->node == NODE_TITLE) { |
|
macro_line(f, "Sh NAME"); |
|
macro_nodeline(f, "Nm", name, ARG_SINGLE); |
|
macro_nodeline(f, "Nd", nc, 0); |
|
pnode_unlink(nc); |
|
} |
|
pnode_unlink(name); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
/* |
/* |
* These math nodes require special handling because they have infix |
* We can have multiple <term> elements within a <varlistentry>, which |
* syntax, instead of the usual prefix or prefix. |
* we should comma-separate as list headers. |
* So we need to break up the first and second child node with a |
|
* particular eqn(7) word. |
|
*/ |
*/ |
static void |
static void |
pnode_printmath(struct parse *p, struct pnode *pn) |
pnode_printvarlistentry(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn, *ncc; |
|
int comma; |
|
|
pp = TAILQ_FIRST(&pn->childq); |
macro_open(f, "It"); |
pnode_print(p, pp); |
f->parastate = PARA_HAVE; |
|
f->flags |= FMT_IMPL; |
switch (pn->node) { |
comma = -1; |
case (NODE_MML_MSUP): |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
fputs(" sup ", stdout); |
if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM) |
break; |
continue; |
case (NODE_MML_MFRAC): |
if (comma != -1) { |
fputs(" over ", stdout); |
switch (f->linestate) { |
break; |
case LINE_NEW: |
case (NODE_MML_MSUB): |
break; |
fputs(" sub ", stdout); |
case LINE_TEXT: |
break; |
print_text(f, ",", 0); |
default: |
break; |
break; |
case LINE_MACRO: |
|
macro_addarg(f, ",", comma); |
|
break; |
|
} |
|
} |
|
f->parastate = PARA_HAVE; |
|
comma = (ncc = TAILQ_FIRST(&nc->childq)) == NULL || |
|
pnode_class(ncc->node) == CLASS_TEXT ? 0 : ARG_SPACE; |
|
pnode_print(f, nc); |
|
pnode_unlink(nc); |
} |
} |
|
macro_close(f); |
pp = TAILQ_NEXT(pp, child); |
f->parastate = PARA_HAVE; |
pnode_print(p, pp); |
while ((nc = TAILQ_FIRST(&n->childq)) != NULL) { |
|
pnode_print(f, nc); |
|
pnode_unlink(nc); |
|
} |
|
macro_close(f); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
static void |
static void |
pnode_printfuncprototype(struct parse *p, struct pnode *pn) |
pnode_printtitle(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *fdef; |
struct pnode *nc, *nn; |
|
|
assert(p->newln); |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
TAILQ_FOREACH(fdef, &pn->childq, child) |
if (nc->node == NODE_TITLE) { |
if (NODE_FUNCDEF == fdef->node) |
if (f->parastate == PARA_MID) |
break; |
f->parastate = PARA_WANT; |
|
macro_nodeline(f, "Sy", nc, 0); |
if (NULL != fdef) |
pnode_unlink(nc); |
pnode_printfuncdef(p, fdef); |
|
else |
|
puts(".Fo UNKNOWN"); |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_PARAMDEF == pp->node) |
|
pnode_printparamdef(p, pp); |
|
|
|
puts(".Fc"); |
|
p->newln = 1; |
|
} |
|
|
|
/* |
|
* The <arg> element is more complicated than it should be because text |
|
* nodes are treated like ".Ar foo", but non-text nodes need to be |
|
* re-sent into the printer (i.e., without the preceding ".Ar"). |
|
* This also handles the case of "repetition" (or in other words, the |
|
* ellipsis following an argument) and optionality. |
|
*/ |
|
static void |
|
pnode_printarg(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
struct pattr *ap; |
|
int isop, isrep; |
|
|
|
isop = 1; |
|
isrep = 0; |
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ATTRKEY_CHOICE == ap->key && |
|
(ATTRVAL_PLAIN == ap->val || |
|
ATTRVAL_REQ == ap->val)) |
|
isop = 0; |
|
else if (ATTRKEY_REP == ap->key && |
|
(ATTRVAL_REPEAT == ap->val)) |
|
isrep = 1; |
|
|
|
if (isop) { |
|
pnode_printmopen(p); |
|
fputs("Op", stdout); |
|
} |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (NODE_TEXT == pp->node) { |
|
pnode_printmopen(p); |
|
fputs("Ar", stdout); |
|
} |
} |
pnode_print(p, pp); |
|
if (NODE_TEXT == pp->node && isrep) |
|
fputs("...", stdout); |
|
} |
} |
} |
} |
|
|
static void |
static void |
pnode_printgroup(struct parse *p, struct pnode *pn) |
pnode_printrow(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *np; |
struct pnode *nc; |
struct pattr *ap; |
|
int isop, sv; |
|
|
|
isop = 1; |
macro_line(f, "Bl -dash -compact"); |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(nc, &n->childq, child) { |
if (ATTRKEY_CHOICE == ap->key && |
macro_line(f, "It"); |
(ATTRVAL_PLAIN == ap->val || |
pnode_print(f, nc); |
ATTRVAL_REQ == ap->val)) { |
|
isop = 0; |
|
break; |
|
} |
|
|
|
/* |
|
* Make sure we're on a macro line. |
|
* This will prevent pnode_print() for putting us on a |
|
* subsequent line. |
|
*/ |
|
sv = p->newln; |
|
pnode_printmopen(p); |
|
if (isop) |
|
fputs("Op", stdout); |
|
else if (sv) |
|
fputs("No", stdout); |
|
|
|
/* |
|
* Keep on printing text separated by the vertical bar as long |
|
* as we're within the same origin node as the group. |
|
* This is kind of a nightmare. |
|
* Eh, DocBook... |
|
* FIXME: if there's a "Fl", we don't cut off the leading "-" |
|
* like we do in pnode_print(). |
|
*/ |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
pnode_print(p, pp); |
|
np = TAILQ_NEXT(pp, child); |
|
while (NULL != np) { |
|
if (pp->node != np->node) |
|
break; |
|
fputs(" |", stdout); |
|
pnode_printmacrolinepart(p, np); |
|
pp = np; |
|
np = TAILQ_NEXT(np, child); |
|
} |
|
} |
} |
|
macro_line(f, "El"); |
pnode_printmclose(p, sv); |
pnode_unlink(n); |
} |
} |
|
|
static void |
static void |
pnode_printprologue(struct parse *p, struct pnode *pn) |
pnode_printtgroup1(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
pp = NULL == p->root ? NULL : |
macro_line(f, "Bl -bullet -compact"); |
pnode_findfirst(p->root, NODE_REFMETA); |
while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) { |
|
macro_line(f, "It"); |
puts(".Dd $Mdocdate" "$"); |
f->parastate = PARA_HAVE; |
if (NULL != pp) { |
pnode_print(f, nc); |
pnode_printrefmeta(p, pp); |
f->parastate = PARA_HAVE; |
pnode_unlink(pp); |
pnode_unlink(nc); |
} else |
|
printf(".Dt %s 1\n", |
|
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN")); |
|
puts(".Os"); |
|
|
|
if (PARSE_EQN & p->flags) { |
|
puts(".EQ"); |
|
puts("delim $$"); |
|
puts(".EN"); |
|
} |
} |
|
macro_line(f, "El"); |
|
pnode_unlinksub(n); |
} |
} |
|
|
/* |
|
* We can have multiple <term> elements within a <varlistentry>, which |
|
* we should comma-separate as list headers. |
|
*/ |
|
static void |
static void |
pnode_printvarlistentry(struct parse *p, struct pnode *pn) |
pnode_printtgroup2(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nr, *ne; |
int first = 1; |
|
|
|
assert(p->newln); |
f->parastate = PARA_HAVE; |
fputs(".It", stdout); |
macro_line(f, "Bl -tag -width Ds"); |
p->newln = 0; |
while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) { |
|
if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL) |
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_TERM == pp->node) { |
|
if ( ! first) |
|
putchar(','); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
first = 0; |
|
} else |
|
break; |
break; |
|
macro_open(f, "It"); |
putchar('\n'); |
f->flags |= FMT_IMPL; |
p->newln = 1; |
f->parastate = PARA_HAVE; |
|
pnode_print(f, ne); |
|
macro_close(f); |
|
pnode_unlink(ne); |
|
f->parastate = PARA_HAVE; |
|
pnode_print(f, nr); |
|
f->parastate = PARA_HAVE; |
|
pnode_unlink(nr); |
|
} |
|
macro_line(f, "El"); |
|
f->parastate = PARA_WANT; |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printrow(struct parse *p, struct pnode *pn) |
pnode_printtgroup(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
puts(".Bl -dash -compact"); |
switch (atoi(pnode_getattr_raw(n, ATTRKEY_COLS, "0"))) { |
|
case 1: |
|
pnode_printtgroup1(f, n); |
|
return; |
|
case 2: |
|
pnode_printtgroup2(f, n); |
|
return; |
|
default: |
|
break; |
|
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
f->parastate = PARA_HAVE; |
assert(p->newln); |
macro_line(f, "Bl -ohang"); |
puts(".It"); |
while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) { |
pnode_print(p, pp); |
macro_line(f, "It Table Row"); |
pnode_printmclose(p, 1); |
pnode_printrow(f, nc); |
} |
} |
assert(p->newln); |
macro_line(f, "El"); |
puts(".El"); |
f->parastate = PARA_WANT; |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printtable(struct parse *p, struct pnode *pn) |
pnode_printlist(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
assert(p->newln); |
pnode_printtitle(f, n); |
TAILQ_FOREACH(pp, &pn->childq, child) |
f->parastate = PARA_HAVE; |
if (NODE_TITLE == pp->node) { |
macro_argline(f, "Bl", |
pnode_printpara(p, pp); |
n->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
pnode_print(p, pp); |
TAILQ_FOREACH(nc, &n->childq, child) { |
pnode_unlink(pp); |
macro_line(f, "It"); |
} |
f->parastate = PARA_HAVE; |
assert(p->newln); |
pnode_print(f, nc); |
puts(".Bl -ohang"); |
f->parastate = PARA_HAVE; |
while (NULL != (pp = pnode_findfirst(pn, NODE_ROW))) { |
|
puts(".It Table Row"); |
|
pnode_printrow(p, pp); |
|
pnode_printmclose(p, 1); |
|
pnode_unlink(pp); |
|
} |
} |
assert(p->newln); |
macro_line(f, "El"); |
puts(".El"); |
f->parastate = PARA_WANT; |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printlist(struct parse *p, struct pnode *pn) |
pnode_printvariablelist(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
assert(p->newln); |
pnode_printtitle(f, n); |
TAILQ_FOREACH(pp, &pn->childq, child) |
f->parastate = PARA_HAVE; |
if (NODE_TITLE == pp->node) { |
macro_line(f, "Bl -tag -width Ds"); |
pnode_printpara(p, pp); |
TAILQ_FOREACH(nc, &n->childq, child) { |
pnode_print(p, pp); |
if (nc->node == NODE_VARLISTENTRY) |
pnode_unlink(pp); |
pnode_printvarlistentry(f, nc); |
} |
else |
assert(p->newln); |
macro_nodeline(f, "It", nc, 0); |
|
|
if (NODE_ORDEREDLIST == pn->node) |
|
puts(".Bl -enum"); |
|
else |
|
puts(".Bl -bullet"); |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
assert(p->newln); |
|
puts(".It"); |
|
pnode_print(p, pp); |
|
pnode_printmclose(p, 1); |
|
} |
} |
assert(p->newln); |
macro_line(f, "El"); |
puts(".El"); |
f->parastate = PARA_WANT; |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
|
pnode_printvariablelist(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
assert(p->newln); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_TITLE == pp->node) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
|
|
assert(p->newln); |
|
puts(".Bl -tag -width Ds"); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_VARLISTENTRY != pp->node) { |
|
assert(p->newln); |
|
fputs(".It", stdout); |
|
pnode_printmacroline(p, pp); |
|
} else { |
|
assert(p->newln); |
|
pnode_print(p, pp); |
|
} |
|
assert(p->newln); |
|
puts(".El"); |
|
} |
|
|
|
/* |
/* |
* Print a parsed node (or ignore it--whatever). |
* Print a parsed node (or ignore it--whatever). |
* This is a recursive function. |
* This is a recursive function. |
Line 1263 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 913 pnode_printvariablelist(struct parse *p, struct pnode |
|
* whatever), don't print inline macros. |
* whatever), don't print inline macros. |
*/ |
*/ |
static void |
static void |
pnode_print(struct parse *p, struct pnode *pn) |
pnode_print(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn; |
const char *ccp; |
int was_impl; |
char *cp; |
|
int last, sv; |
|
|
|
if (NULL == pn) |
if (n == NULL) |
return; |
return; |
|
|
sv = p->newln; |
was_impl = f->flags & FMT_IMPL; |
|
if (n->flags & NFLAG_SPC) |
|
f->flags &= ~FMT_NOSPC; |
|
else |
|
f->flags |= FMT_NOSPC; |
|
|
/* XXX fprintf(stderr, "NODE %s\n", nodes[pn->node].name); */ |
switch (n->node) { |
switch (pn->node) { |
case NODE_ARG: |
case (NODE_APPLICATION): |
pnode_printarg(f, n); |
pnode_printmopen(p); |
|
fputs("Nm", stdout); |
|
break; |
break; |
case (NODE_ANCHOR): |
case NODE_AUTHOR: |
/* Don't print anything! */ |
pnode_printauthor(f, n); |
return; |
|
case (NODE_ARG): |
|
pnode_printarg(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_AUTHOR): |
case NODE_AUTHORGROUP: |
pnode_printmopen(p); |
macro_line(f, "An -split"); |
fputs("An", stdout); |
|
break; |
break; |
case (NODE_AUTHORGROUP): |
case NODE_BLOCKQUOTE: |
assert(p->newln); |
f->parastate = PARA_HAVE; |
puts(".An -split"); |
macro_line(f, "Bd -ragged -offset indent"); |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case (NODE_BOOKINFO): |
case NODE_CITEREFENTRY: |
assert(p->newln); |
pnode_printciterefentry(f, n); |
puts(".Sh NAME"); |
|
break; |
break; |
case (NODE_CITEREFENTRY): |
case NODE_CITETITLE: |
pnode_printmopen(p); |
macro_open(f, "%T"); |
fputs("Xr", stdout); |
|
pnode_printciterefentry(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_CODE): |
case NODE_COMMAND: |
pnode_printmopen(p); |
macro_open(f, "Nm"); |
fputs("Li", stdout); |
|
break; |
break; |
case (NODE_COMMAND): |
case NODE_CONSTANT: |
pnode_printmopen(p); |
macro_open(f, "Dv"); |
fputs("Nm", stdout); |
|
break; |
break; |
case (NODE_CONSTANT): |
case NODE_COPYRIGHT: |
pnode_printmopen(p); |
print_text(f, "Copyright", ARG_SPACE); |
fputs("Dv", stdout); |
fputs(" \\(co", stdout); |
break; |
break; |
case (NODE_EDITOR): |
case NODE_EDITOR: |
puts("editor: "); |
print_text(f, "editor:", ARG_SPACE); |
pnode_printmopen(p); |
pnode_printauthor(f, n); |
fputs("An", stdout); |
|
break; |
break; |
case (NODE_EMPHASIS): |
case NODE_EMAIL: |
case (NODE_FIRSTTERM): |
if (was_impl) |
pnode_printmopen(p); |
macro_open(f, "Ao Mt"); |
fputs("Em", stdout); |
else { |
|
macro_open(f, "Aq Mt"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case (NODE_ENVAR): |
case NODE_EMPHASIS: |
pnode_printmopen(p); |
case NODE_FIRSTTERM: |
fputs("Ev", stdout); |
case NODE_GLOSSTERM: |
|
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
|
pnode_class(nc->node) < CLASS_LINE) |
|
macro_open(f, "Em"); |
|
if (n->node == NODE_GLOSSTERM) |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case (NODE_FILENAME): |
case NODE_ENVAR: |
pnode_printmopen(p); |
macro_open(f, "Ev"); |
fputs("Pa", stdout); |
|
break; |
break; |
case (NODE_FUNCTION): |
case NODE_ERRORNAME: |
pnode_printmopen(p); |
macro_open(f, "Er"); |
fputs("Fn", stdout); |
|
break; |
break; |
case (NODE_FUNCPROTOTYPE): |
case NODE_FILENAME: |
assert(p->newln); |
macro_open(f, "Pa"); |
pnode_printfuncprototype(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCSYNOPSISINFO): |
case NODE_FOOTNOTE: |
pnode_printmopen(p); |
macro_line(f, "Bo"); |
fputs("Fd", stdout); |
f->parastate = PARA_HAVE; |
break; |
break; |
case (NODE_INDEXTERM): |
case NODE_FUNCTION: |
return; |
macro_open(f, "Fn"); |
case (NODE_INFORMALEQUATION): |
|
if ( ! p->newln) |
|
putchar('\n'); |
|
puts(".EQ"); |
|
p->newln = 0; |
|
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_FUNCPROTOTYPE: |
fputc('$', stdout); |
pnode_printfuncprototype(f, n); |
p->newln = 0; |
|
break; |
break; |
case (NODE_ITEMIZEDLIST): |
case NODE_FUNCSYNOPSISINFO: |
assert(p->newln); |
macro_open(f, "Fd"); |
pnode_printlist(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_GROUP): |
case NODE_IMAGEDATA: |
pnode_printgroup(p, pn); |
pnode_printimagedata(f, n); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_LEGALNOTICE): |
case NODE_INFORMALEQUATION: |
assert(p->newln); |
f->parastate = PARA_HAVE; |
puts(".Sh LEGAL NOTICE"); |
macro_line(f, "Bd -ragged -offset indent"); |
|
f->parastate = PARA_HAVE; |
|
/* FALLTHROUGH */ |
|
case NODE_INLINEEQUATION: |
|
macro_line(f, "EQ"); |
break; |
break; |
case (NODE_LINK): |
case NODE_ITEMIZEDLIST: |
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
pnode_printlist(f, n); |
if (NULL == ccp) |
|
break; |
|
pnode_printmopen(p); |
|
printf("Sx %s\n", ccp); |
|
p->newln = 1; |
|
return; |
|
case (NODE_LITERAL): |
|
pnode_printmopen(p); |
|
fputs("Li", stdout); |
|
break; |
break; |
case (NODE_LITERALLAYOUT): |
case NODE_GROUP: |
assert(p->newln); |
pnode_printgroup(f, n); |
puts(".Bd -literal"); |
|
break; |
break; |
case (NODE_MML_MFENCED): |
case NODE_KEYSYM: |
pnode_printmathfenced(p, pn); |
case NODE_PRODUCTNAME: |
pnode_unlinksub(pn); |
macro_open(f, "Sy"); |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_LINK: |
case (NODE_MML_MI): |
pnode_printlink(f, n); |
case (NODE_MML_MN): |
break; |
case (NODE_MML_MO): |
case NODE_LITERAL: |
if (TAILQ_EMPTY(&pn->childq)) |
if (n->parent != NULL && n->parent->node == NODE_QUOTE) |
|
macro_open(f, "Li"); |
|
else if (was_impl) |
|
macro_open(f, "So Li"); |
|
else { |
|
macro_open(f, "Ql"); |
|
f->flags |= FMT_IMPL; |
|
} |
|
break; |
|
case NODE_LITERALLAYOUT: |
|
macro_close(f); |
|
f->parastate = PARA_HAVE; |
|
macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) == |
|
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
|
f->parastate = PARA_HAVE; |
|
break; |
|
case NODE_MARKUP: |
|
macro_open(f, "Ic"); |
|
break; |
|
case NODE_MML_MFENCED: |
|
pnode_printmathfenced(f, n); |
|
break; |
|
case NODE_MML_MROW: |
|
case NODE_MML_MI: |
|
case NODE_MML_MN: |
|
case NODE_MML_MO: |
|
if (TAILQ_EMPTY(&n->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(f, n); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_OPTION): |
case NODE_OLINK: |
pnode_printmopen(p); |
pnode_printolink(f, n); |
fputs("Fl", stdout); |
|
break; |
break; |
case (NODE_ORDEREDLIST): |
case NODE_OPTION: |
assert(p->newln); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
pnode_printlist(p, pn); |
pnode_class(nc->node) < CLASS_LINE) |
pnode_unlinksub(pn); |
macro_open(f, "Fl"); |
break; |
break; |
case (NODE_PARA): |
case NODE_ORDEREDLIST: |
pnode_printpara(p, pn); |
pnode_printlist(f, n); |
break; |
break; |
case (NODE_PARAMETER): |
case NODE_PARA: |
/* Suppress non-text children... */ |
if (f->parastate == PARA_MID) |
pnode_printmopen(p); |
f->parastate = PARA_WANT; |
fputs("Fa \"", stdout); |
|
pnode_printmacrolinetext(p, pn, MACROLINE_NOWS); |
|
fputs("\"", stdout); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_QUOTE): |
case NODE_PARAMDEF: |
pnode_printmopen(p); |
case NODE_PARAMETER: |
fputs("Qo", stdout); |
/* More often, these appear inside NODE_FUNCPROTOTYPE. */ |
|
macro_open(f, "Fa"); |
|
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(n); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case NODE_QUOTE: |
case (NODE_SCREEN): |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
assert(p->newln); |
nc->node == NODE_FILENAME && |
printf(".Bd %s\n", ATTRVAL_MONOSPACED == |
TAILQ_NEXT(nc, child) == NULL) { |
pnode_getattr(pn, ATTRKEY_CLASS) ? |
if (n->flags & NFLAG_SPC) |
"-literal" : "-unfilled"); |
nc->flags |= NFLAG_SPC; |
|
} else if (was_impl) |
|
macro_open(f, "Do"); |
|
else { |
|
macro_open(f, "Dq"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case (NODE_REFENTRYINFO): |
case NODE_PROGRAMLISTING: |
/* Suppress. */ |
case NODE_SCREEN: |
pnode_unlinksub(pn); |
case NODE_SYNOPSIS: |
|
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bd -literal"); |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case (NODE_REFMETA): |
case NODE_SYSTEMITEM: |
abort(); |
pnode_printsystemitem(f, n); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* More often, these appear inside NODE_REFNAMEDIV. */ |
pnode_printmopen(p); |
macro_open(f, "Nm"); |
fputs("Nm", stdout); |
|
p->newln = 0; |
|
pnode_printmacrolinepart(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_REFNAMEDIV): |
case NODE_REFNAMEDIV: |
assert(p->newln); |
pnode_printrefnamediv(f, n); |
puts(".Sh NAME"); |
|
break; |
break; |
case (NODE_REFPURPOSE): |
case NODE_REFPURPOSE: |
assert(p->newln); |
macro_open(f, "Nd"); |
pnode_printmopen(p); |
|
fputs("Nd", stdout); |
|
break; |
break; |
case (NODE_REFSYNOPSISDIV): |
case NODE_REFSYNOPSISDIV: |
assert(p->newln); |
pnode_printrefsynopsisdiv(f, n); |
pnode_printrefsynopsisdiv(p, pn); |
|
puts(".Sh SYNOPSIS"); |
|
break; |
break; |
case (NODE_PREFACE): |
case NODE_SECTION: |
case (NODE_SECTION): |
case NODE_SIMPLESECT: |
case (NODE_NOTE): |
case NODE_APPENDIX: |
case (NODE_TIP): |
case NODE_NOTE: |
case (NODE_CAUTION): |
pnode_printsection(f, n); |
case (NODE_WARNING): |
|
assert(p->newln); |
|
pnode_printrefsect(p, pn); |
|
break; |
break; |
case (NODE_REPLACEABLE): |
case NODE_REPLACEABLE: |
pnode_printmopen(p); |
macro_open(f, "Ar"); |
fputs("Ar", stdout); |
|
break; |
break; |
case (NODE_SBR): |
case NODE_SBR: |
assert(p->newln); |
if (f->parastate == PARA_MID) |
puts(".br"); |
macro_line(f, "br"); |
break; |
break; |
case (NODE_SGMLTAG): |
case NODE_SUBSCRIPT: |
pnode_printmopen(p); |
if (f->linestate == LINE_MACRO) |
fputs("Li", stdout); |
macro_addarg(f, "_", 0); |
|
else |
|
print_text(f, "_", 0); |
|
if ((nc = TAILQ_FIRST(&n->childq)) != NULL) |
|
nc->flags &= ~(NFLAG_LINE | NFLAG_SPC); |
break; |
break; |
case (NODE_STRUCTNAME): |
case NODE_SUPERSCRIPT: |
pnode_printmopen(p); |
fputs("\\(ha", stdout); |
fputs("Vt", stdout); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL) |
|
nc->flags &= ~(NFLAG_LINE | NFLAG_SPC); |
break; |
break; |
case (NODE_TABLE): |
case NODE_TEXT: |
/* FALLTHROUGH */ |
case NODE_ESCAPE: |
case (NODE_INFORMALTABLE): |
pnode_printtext(f, n); |
assert(p->newln); |
|
pnode_printtable(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_TEXT): |
case NODE_TGROUP: |
if (0 == p->newln) |
pnode_printtgroup(f, n); |
putchar(' '); |
|
|
|
bufclear(p); |
|
bufappend(p, pn); |
|
|
|
if (0 == p->bsz) { |
|
assert(pn->real != pn->b); |
|
break; |
|
} |
|
|
|
/* |
|
* Output all characters, squeezing out whitespace |
|
* between newlines. |
|
* XXX: all whitespace, including tabs (?). |
|
* Remember to escape control characters and escapes. |
|
*/ |
|
assert(p->bsz); |
|
cp = p->b; |
|
|
|
/* |
|
* There's often a superfluous "-" in its <option> tags |
|
* before the actual flags themselves. |
|
* "Fl" does this for us, so remove it. |
|
*/ |
|
if (NULL != pn->parent && |
|
NODE_OPTION == pn->parent->node && |
|
'-' == *cp) |
|
cp++; |
|
for (last = '\n'; '\0' != *cp; ) { |
|
if ('\n' == last) { |
|
/* Consume all whitespace. */ |
|
if (isspace((unsigned char)*cp)) { |
|
while (isspace((unsigned char)*cp)) |
|
cp++; |
|
continue; |
|
} else if ('\'' == *cp || '.' == *cp) |
|
fputs("\\&", stdout); |
|
} |
|
putchar(last = *cp++); |
|
/* If we're a character escape, escape us. */ |
|
if ('\\' == last) |
|
putchar('e'); |
|
} |
|
p->newln = 0; |
|
break; |
break; |
case (NODE_TITLE): |
case NODE_TITLE: |
if (pn->parent->node == NODE_BOOKINFO) { |
case NODE_SUBTITLE: |
pnode_printmopen(p); |
if (f->parastate == PARA_MID) |
fputs("Nd", stdout); |
f->parastate = PARA_WANT; |
} |
macro_nodeline(f, "Sy", n, 0); |
|
pnode_unlinksub(n); |
break; |
break; |
case (NODE_TYPE): |
case NODE_TYPE: |
pnode_printmopen(p); |
macro_open(f, "Vt"); |
fputs("Vt", stdout); |
|
break; |
break; |
case (NODE_USERINPUT): |
case NODE_VARIABLELIST: |
pnode_printmopen(p); |
pnode_printvariablelist(f, n); |
fputs("Li", stdout); |
|
break; |
break; |
case (NODE_VARIABLELIST): |
case NODE_VARNAME: |
assert(p->newln); |
macro_open(f, "Va"); |
pnode_printvariablelist(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_VARLISTENTRY): |
case NODE_VOID: |
assert(p->newln); |
print_text(f, "void", ARG_SPACE); |
pnode_printvarlistentry(p, pn); |
|
break; |
break; |
case (NODE_VARNAME): |
case NODE_XREF: |
pnode_printmopen(p); |
pnode_printxref(f, n); |
fputs("Va", stdout); |
|
break; |
break; |
|
case NODE_CAUTION: |
|
case NODE_LEGALNOTICE: |
|
case NODE_PREFACE: |
|
case NODE_TIP: |
|
case NODE_WARNING: |
|
abort(); |
default: |
default: |
break; |
break; |
} |
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(nc, &n->childq, child) |
pnode_print(p, pp); |
pnode_print(f, nc); |
|
|
switch (pn->node) { |
switch (n->node) { |
case (NODE_INFORMALEQUATION): |
case NODE_EMAIL: |
if ( ! p->newln) |
if (was_impl) { |
putchar('\n'); |
f->flags &= ~FMT_NOSPC; |
puts(".EN"); |
macro_open(f, "Ac"); |
p->newln = 1; |
} else |
|
f->flags &= ~FMT_IMPL; |
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_ESCAPE: |
fputs("$ ", stdout); |
case NODE_TERM: |
p->newln = sv; |
case NODE_TEXT: |
|
/* Accept more arguments to the previous macro. */ |
|
return; |
|
case NODE_FOOTNOTE: |
|
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bc"); |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_GLOSSTERM: |
case (NODE_MML_MI): |
f->parastate = PARA_HAVE; |
case (NODE_MML_MN): |
break; |
case (NODE_MML_MO): |
case NODE_INFORMALEQUATION: |
if (TAILQ_EMPTY(&pn->childq)) |
macro_line(f, "EN"); |
|
macro_line(f, "Ed"); |
|
break; |
|
case NODE_INLINEEQUATION: |
|
macro_line(f, "EN"); |
|
break; |
|
case NODE_LITERAL: |
|
if (n->parent != NULL && n->parent->node == NODE_QUOTE) |
|
/* nothing */; |
|
else if (was_impl) { |
|
f->flags &= ~FMT_NOSPC; |
|
macro_open(f, "Sc"); |
|
} else |
|
f->flags &= ~FMT_IMPL; |
|
break; |
|
case NODE_MEMBER: |
|
if ((nn = TAILQ_NEXT(n, child)) != NULL && |
|
nn->node != NODE_MEMBER) |
|
nn = NULL; |
|
switch (f->linestate) { |
|
case LINE_TEXT: |
|
if (nn != NULL) |
|
print_text(f, ",", 0); |
break; |
break; |
|
case LINE_MACRO: |
|
if (nn != NULL) |
|
macro_addarg(f, ",", ARG_SPACE); |
|
macro_close(f); |
|
break; |
|
case LINE_NEW: |
|
break; |
|
} |
|
break; |
|
case NODE_MML_MROW: |
|
case NODE_MML_MI: |
|
case NODE_MML_MN: |
|
case NODE_MML_MO: |
|
if (TAILQ_EMPTY(&n->childq)) |
|
break; |
fputs(" } ", stdout); |
fputs(" } ", stdout); |
break; |
break; |
case (NODE_APPLICATION): |
case NODE_PARA: |
case (NODE_ARG): |
if (f->parastate == PARA_MID) |
case (NODE_AUTHOR): |
f->parastate = PARA_WANT; |
case (NODE_CITEREFENTRY): |
|
case (NODE_CODE): |
|
case (NODE_COMMAND): |
|
case (NODE_CONSTANT): |
|
case (NODE_EDITOR): |
|
case (NODE_EMPHASIS): |
|
case (NODE_ENVAR): |
|
case (NODE_FILENAME): |
|
case (NODE_FIRSTTERM): |
|
case (NODE_FUNCTION): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_LITERAL): |
|
case (NODE_OPTION): |
|
case (NODE_PARAMETER): |
|
case (NODE_REPLACEABLE): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SGMLTAG): |
|
case (NODE_STRUCTNAME): |
|
case (NODE_TEXT): |
|
case (NODE_TYPE): |
|
case (NODE_USERINPUT): |
|
case (NODE_VARNAME): |
|
pnode_printmclosepunct(p, pn, sv); |
|
break; |
break; |
case (NODE_QUOTE): |
case NODE_QUOTE: |
pnode_printmclose(p, sv); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
sv = p->newln; |
nc->node == NODE_FILENAME && |
pnode_printmopen(p); |
TAILQ_NEXT(nc, child) == NULL) |
fputs("Qc", stdout); |
/* nothing */; |
pnode_printmclose(p, sv); |
else if (was_impl) { |
|
f->flags &= ~FMT_NOSPC; |
|
macro_open(f, "Dc"); |
|
} else |
|
f->flags &= ~FMT_IMPL; |
break; |
break; |
case (NODE_REFNAME): |
case NODE_SECTION: |
/* |
case NODE_SIMPLESECT: |
* If we're in the NAME macro and we have multiple |
case NODE_APPENDIX: |
* <refname> macros in sequence, then print out a |
case NODE_NOTE: |
* trailing comma before the newline. |
if (n->parent != NULL) |
*/ |
f->level--; |
if (NULL != pn->parent && |
|
NODE_REFNAMEDIV == pn->parent->node && |
|
NULL != TAILQ_NEXT(pn, child) && |
|
NODE_REFNAME == TAILQ_NEXT(pn, child)->node) |
|
fputs(" ,", stdout); |
|
pnode_printmclose(p, sv); |
|
break; |
break; |
case (NODE_PREFACE): |
case NODE_BLOCKQUOTE: |
case (NODE_SECTION): |
case NODE_LITERALLAYOUT: |
case (NODE_NOTE): |
case NODE_PROGRAMLISTING: |
case (NODE_TIP): |
case NODE_SCREEN: |
case (NODE_CAUTION): |
case NODE_SYNOPSIS: |
case (NODE_WARNING): |
f->parastate = PARA_HAVE; |
p->level--; |
macro_line(f, "Ed"); |
|
f->parastate = PARA_WANT; |
break; |
break; |
case (NODE_LITERALLAYOUT): |
case NODE_TITLE: |
/* FALLTHROUGH */ |
case NODE_SUBTITLE: |
case (NODE_PROGRAMLISTING): |
f->parastate = PARA_WANT; |
/* FALLTHROUGH */ |
|
case (NODE_SCREEN): |
|
assert(p->newln); |
|
puts(".Ed"); |
|
p->newln = 1; |
|
break; |
break; |
case (NODE_TITLE): |
case NODE_YEAR: |
if (pn->parent->node == NODE_BOOKINFO) { |
if ((nn = TAILQ_NEXT(n, child)) != NULL && |
pnode_printmclose(p, 1); |
nn->node == NODE_YEAR && |
puts(".Sh AUTHORS"); |
f->linestate == LINE_TEXT) { |
|
print_text(f, ",", 0); |
|
nn->flags |= NFLAG_SPC; |
|
if ((nc = TAILQ_FIRST(&nn->childq)) != NULL) |
|
nc->flags |= NFLAG_SPC; |
} |
} |
break; |
|
default: |
default: |
break; |
break; |
} |
} |
|
f->flags &= ~FMT_ARG; |
} |
} |
|
|
/* |
void |
* Loop around the read buffer until we've drained it of all data. |
ptree_print_mdoc(struct ptree *tree) |
* Invoke the parser context with each buffer fill. |
|
*/ |
|
static int |
|
readfile(XML_Parser xp, int fd, |
|
char *b, size_t bsz, const char *fn) |
|
{ |
{ |
struct parse p; |
struct format formatter; |
int rc; |
|
ssize_t ssz; |
|
|
|
memset(&p, 0, sizeof(struct parse)); |
formatter.level = 0; |
|
formatter.linestate = LINE_NEW; |
p.b = malloc(p.bsz = p.mbsz = 1024); |
formatter.parastate = PARA_HAVE; |
p.fname = fn; |
pnode_printprologue(&formatter, tree->root); |
p.xml = xp; |
pnode_print(&formatter, tree->root); |
|
if (formatter.linestate != LINE_NEW) |
XML_SetCharacterDataHandler(xp, xml_char); |
putchar('\n'); |
XML_SetElementHandler(xp, xml_elem_start, xml_elem_end); |
|
XML_SetUserData(xp, &p); |
|
|
|
while ((ssz = read(fd, b, bsz)) >= 0) { |
|
if (0 == (rc = XML_Parse(xp, b, ssz, 0 == ssz))) |
|
fprintf(stderr, "%s:%zu:%zu: %s\n", fn, |
|
XML_GetCurrentLineNumber(xp), |
|
XML_GetCurrentColumnNumber(xp), |
|
XML_ErrorString |
|
(XML_GetErrorCode(xp))); |
|
else if ( ! p.stop && ssz > 0) |
|
continue; |
|
/* |
|
* Exit when we've read all or errors have occured |
|
* during the parse sequence. |
|
*/ |
|
p.newln = 1; |
|
pnode_printprologue(&p, p.root); |
|
pnode_print(&p, p.root); |
|
pnode_free(p.root); |
|
free(p.b); |
|
return(0 != rc && ! p.stop); |
|
} |
|
|
|
/* Read error has occured. */ |
|
perror(fn); |
|
pnode_free(p.root); |
|
free(p.b); |
|
return(0); |
|
} |
|
|
|
int |
|
main(int argc, char *argv[]) |
|
{ |
|
XML_Parser xp; |
|
const char *fname; |
|
char *buf; |
|
int fd, rc, ch; |
|
const char *progname; |
|
|
|
progname = strrchr(argv[0], '/'); |
|
if (progname == NULL) |
|
progname = argv[0]; |
|
else |
|
++progname; |
|
|
|
fname = "-"; |
|
xp = NULL; |
|
buf = NULL; |
|
rc = 0; |
|
|
|
while (-1 != (ch = getopt(argc, argv, "W"))) |
|
switch (ch) { |
|
case ('W'): |
|
warn = 1; |
|
break; |
|
default: |
|
goto usage; |
|
} |
|
|
|
argc -= optind; |
|
argv += optind; |
|
|
|
if (argc > 1) { |
|
fprintf(stderr, "%s: Too many arguments\n", argv[1]); |
|
goto usage; |
|
} else if (argc > 0) |
|
fname = argv[0]; |
|
|
|
/* Read from stdin or a file. */ |
|
fd = 0 == strcmp(fname, "-") ? |
|
STDIN_FILENO : open(fname, O_RDONLY, 0); |
|
|
|
/* |
|
* Open file for reading. |
|
* Allocate a read buffer. |
|
* Create the parser context. |
|
* Dive directly into the parse. |
|
*/ |
|
if (-1 == fd) |
|
perror(fname); |
|
else if (NULL == (buf = malloc(4096))) |
|
perror(NULL); |
|
else if (NULL == (xp = XML_ParserCreate(NULL))) |
|
perror(NULL); |
|
else if ( ! readfile(xp, fd, buf, 4096, fname)) |
|
rc = 1; |
|
|
|
XML_ParserFree(xp); |
|
free(buf); |
|
if (STDIN_FILENO != fd) |
|
close(fd); |
|
return(rc ? EXIT_SUCCESS : EXIT_FAILURE); |
|
|
|
usage: |
|
fprintf(stderr, "usage: %s [-W] [input_filename]\n", progname); |
|
return(EXIT_FAILURE); |
|
} |
} |