version 1.5, 2014/03/28 10:03:36 |
version 1.79, 2019/04/02 15:53:02 |
|
|
/* $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 |
|
|
* 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 "node.h" |
* All recognised node types. |
#include "macro.h" |
*/ |
#include "format.h" |
enum nodeid { |
|
NODE_ROOT = 0, /* Must comes first. */ |
|
/* Alpha-ordered hereafter. */ |
|
NODE_ARG, |
|
NODE_CITEREFENTRY, |
|
NODE_CMDSYNOPSIS, |
|
NODE_CODE, |
|
NODE_COMMAND, |
|
NODE_FUNCDEF, |
|
NODE_FUNCPROTOTYPE, |
|
NODE_FUNCSYNOPSIS, |
|
NODE_FUNCSYNOPSISINFO, |
|
NODE_FUNCTION, |
|
NODE_MANVOLNUM, |
|
NODE_OPTION, |
|
NODE_PARA, |
|
NODE_PARAMDEF, |
|
NODE_PARAMETER, |
|
NODE_PROGRAMLISTING, |
|
NODE_REFCLASS, |
|
NODE_REFDESCRIPTOR, |
|
NODE_REFENTRY, |
|
NODE_REFENTRYTITLE, |
|
NODE_REFMETA, |
|
NODE_REFMISCINFO, |
|
NODE_REFNAME, |
|
NODE_REFNAMEDIV, |
|
NODE_REFPURPOSE, |
|
NODE_REFSECT1, |
|
NODE_REFSYNOPSISDIV, |
|
NODE_SYNOPSIS, |
|
NODE_TEXT, |
|
NODE_TITLE, |
|
NODE__MAX |
|
}; |
|
|
|
/* |
/* |
* Global parse state. |
* The implementation of the mdoc(7) formatter. |
* Keep this as simple and small as possible. |
|
*/ |
*/ |
struct parse { |
|
enum nodeid node; /* current (NODE_ROOT if pre-tree) */ |
|
int stop; /* should we stop now? */ |
|
struct pnode *root; /* root of parse tree */ |
|
struct pnode *cur; /* current node in tree */ |
|
char *b; |
|
size_t bsz; |
|
size_t mbsz; |
|
}; |
|
|
|
struct node { |
static void pnode_print(struct format *, struct pnode *); |
const char *name; |
|
unsigned int flags; |
|
#define NODE_IGNTEXT 1 /* ignore all contained text */ |
|
}; |
|
|
|
TAILQ_HEAD(pnodeq, pnode); |
|
|
|
struct pnode { |
static void |
enum nodeid node; /* node type */ |
pnode_printpara(struct format *p, struct pnode *pn) |
char *b; /* binary data buffer */ |
|
size_t bsz; /* data buffer size */ |
|
struct pnode *parent; /* parent (or NULL if top) */ |
|
struct pnodeq childq; /* queue of children */ |
|
TAILQ_ENTRY(pnode) child; |
|
}; |
|
|
|
static const struct node nodes[NODE__MAX] = { |
|
{ NULL, 0 }, |
|
{ "arg", 0 }, |
|
{ "citerefentry", NODE_IGNTEXT }, |
|
{ "cmdsynopsis", NODE_IGNTEXT }, |
|
{ "code", 0 }, |
|
{ "command", 0 }, |
|
{ "funcdef", 0 }, |
|
{ "funcprototype", NODE_IGNTEXT }, |
|
{ "funcsynopsis", NODE_IGNTEXT }, |
|
{ "funcsynopsisinfo", 0 }, |
|
{ "function", 0 }, |
|
{ "manvolnum", 0 }, |
|
{ "option", 0 }, |
|
{ "para", 0 }, |
|
{ "paramdef", 0 }, |
|
{ "parameter", 0 }, |
|
{ "programlisting", 0 }, |
|
{ "refclass", NODE_IGNTEXT }, |
|
{ "refdescriptor", NODE_IGNTEXT }, |
|
{ "refentry", NODE_IGNTEXT }, |
|
{ "refentrytitle", 0 }, |
|
{ "refmeta", NODE_IGNTEXT }, |
|
{ "refmiscinfo", NODE_IGNTEXT }, |
|
{ "refname", 0 }, |
|
{ "refnamediv", NODE_IGNTEXT }, |
|
{ "refpurpose", 0 }, |
|
{ "refsect1", 0 }, |
|
{ "refsynopsisdiv", NODE_IGNTEXT }, |
|
{ "synopsis", 0 }, |
|
{ NULL, 0 }, |
|
{ "title", 0 }, |
|
}; |
|
|
|
/* |
|
* Look up whether "parent" is a valid parent for "node". |
|
*/ |
|
static int |
|
isparent(enum nodeid node, enum nodeid parent) |
|
{ |
{ |
|
struct pnode *pp; |
|
|
switch (node) { |
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL && |
case (NODE_ROOT): |
(pp = pn->parent) == NULL) |
return(0); |
return; |
case (NODE_ARG): |
|
switch (parent) { |
switch (pp->node) { |
case (NODE_ARG): |
case NODE_ENTRY: |
case (NODE_CMDSYNOPSIS): |
case NODE_LISTITEM: |
return(1); |
return; |
default: |
case NODE_PREFACE: |
break; |
case NODE_SECTION: |
} |
if (p->level < 3) |
return(0); |
return; |
case (NODE_CITEREFENTRY): |
|
switch (parent) { |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_CMDSYNOPSIS): |
|
switch (parent) { |
|
case (NODE_PARA): |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSYNOPSISDIV): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_CODE): |
|
switch (parent) { |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_COMMAND): |
|
switch (parent) { |
|
case (NODE_CMDSYNOPSIS): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_FUNCDEF): |
|
return(NODE_FUNCPROTOTYPE == parent); |
|
case (NODE_FUNCPROTOTYPE): |
|
return(NODE_FUNCSYNOPSIS == parent); |
|
case (NODE_FUNCSYNOPSIS): |
|
switch (parent) { |
|
case (NODE_PARA): |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSYNOPSISDIV): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_FUNCSYNOPSISINFO): |
|
return(NODE_FUNCSYNOPSIS == parent); |
|
case (NODE_FUNCTION): |
|
switch (parent) { |
|
case (NODE_CODE): |
|
case (NODE_FUNCDEF): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_MANVOLNUM): |
|
switch (parent) { |
|
case (NODE_CITEREFENTRY): |
|
case (NODE_REFMETA): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_OPTION): |
|
switch (parent) { |
|
case (NODE_ARG): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_PARA): |
|
switch (parent) { |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSYNOPSISDIV): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_PARAMDEF): |
|
return(NODE_FUNCPROTOTYPE == parent); |
|
case (NODE_PARAMETER): |
|
switch (parent) { |
|
case (NODE_CODE): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_PARA): |
|
case (NODE_PARAMDEF): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_PROGRAMLISTING): |
|
switch (parent) { |
|
case (NODE_PARA): |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSYNOPSISDIV): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_REFCLASS): |
|
return(parent == NODE_REFNAMEDIV); |
|
case (NODE_REFDESCRIPTOR): |
|
return(parent == NODE_REFNAMEDIV); |
|
case (NODE_REFENTRY): |
|
return(parent == NODE_ROOT); |
|
case (NODE_REFENTRYTITLE): |
|
switch (parent) { |
|
case (NODE_CITEREFENTRY): |
|
case (NODE_REFMETA): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
case (NODE_REFMETA): |
|
return(parent == NODE_REFENTRY); |
|
case (NODE_REFMISCINFO): |
|
return(parent == NODE_REFMETA); |
|
case (NODE_REFNAME): |
|
return(parent == NODE_REFNAMEDIV); |
|
case (NODE_REFNAMEDIV): |
|
return(parent == NODE_REFENTRY); |
|
case (NODE_REFPURPOSE): |
|
return(parent == NODE_REFNAMEDIV); |
|
case (NODE_REFSECT1): |
|
return(parent == NODE_REFENTRY); |
|
case (NODE_REFSYNOPSISDIV): |
|
return(parent == NODE_REFENTRY); |
|
case (NODE_SYNOPSIS): |
|
switch (parent) { |
|
case (NODE_REFSYNOPSISDIV): |
|
case (NODE_REFSECT1): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_TITLE): |
|
switch (parent) { |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSYNOPSISDIV): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
|
case (NODE_TEXT): |
|
return(1); |
|
case (NODE__MAX): |
|
break; |
break; |
|
default: |
|
break; |
} |
} |
|
macro_line(p, "Pp"); |
abort(); |
|
return(0); |
|
} |
} |
|
|
|
/* |
|
* If the SYNOPSIS macro has a superfluous title, kill it. |
|
*/ |
static void |
static void |
xml_char(void *arg, const XML_Char *p, int sz) |
pnode_printrefsynopsisdiv(struct format *p, struct pnode *pn) |
{ |
{ |
struct parse *ps = arg; |
struct pnode *pp, *pq; |
struct pnode *dat; |
|
int i; |
|
|
|
/* Stopped or no tree yet. */ |
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) |
if (ps->stop || NODE_ROOT == ps->node) |
if (pp->node == NODE_TITLE) |
return; |
pnode_unlink(pp); |
|
|
/* Not supposed to be collecting text. */ |
macro_line(p, "Sh SYNOPSIS"); |
assert(NULL != ps->cur); |
|
if (NODE_IGNTEXT & nodes[ps->node].flags) |
|
return; |
|
|
|
/* |
|
* Are we in the midst of processing text? |
|
* 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! |
|
*/ |
|
if (NODE_TEXT != ps->node) { |
|
for (i = 0; i < sz; i++) |
|
if ( ! isspace((int)p[i])) |
|
break; |
|
if (i == sz) |
|
return; |
|
dat = calloc(1, sizeof(struct pnode)); |
|
if (NULL == dat) { |
|
perror(NULL); |
|
exit(EXIT_FAILURE); |
|
} |
|
|
|
dat->node = ps->node = NODE_TEXT; |
|
dat->parent = ps->cur; |
|
TAILQ_INIT(&dat->childq); |
|
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
|
ps->cur = dat; |
|
assert(NULL != ps->root); |
|
|
|
} |
|
|
|
/* Append to current buffer. */ |
|
assert(sz >= 0); |
|
ps->cur->b = realloc(ps->cur->b, |
|
ps->cur->bsz + (size_t)sz); |
|
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; |
|
} |
} |
|
|
/* |
/* |
* Begin an element. |
* Start a hopefully-named `Sh' section. |
* First, look for the element. |
|
* If we don't find it and we're not parsing, keep going. |
|
* If we don't find it (and we're parsing), puke and exit. |
|
* If we find it but we're not parsing yet (i.e., it's not a refentry |
|
* and thus out of context), keep going. |
|
* If we're at the root and already have a tree, puke and exit. |
|
* Make sure that the element is in the right context. |
|
* Lastly, put the node onto our parse tree and continue. |
|
*/ |
*/ |
static void |
static void |
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
pnode_printrefsect(struct format *p, struct pnode *pn) |
{ |
{ |
struct parse *ps = arg; |
struct pnode *pp; |
enum nodeid node; |
const char *title; |
struct pnode *dat; |
int flags, level; |
|
|
if (ps->stop) |
if (pn->parent == NULL) |
return; |
return; |
|
|
/* Close out text node, if applicable... */ |
level = ++p->level; |
if (NODE_TEXT == ps->node) { |
flags = ARG_SPACE; |
assert(NULL != ps->cur); |
if (level == 1) |
ps->cur = ps->cur->parent; |
flags |= ARG_UPPER; |
assert(NULL != ps->cur); |
if (level < 3) { |
ps->node = ps->cur->node; |
switch (pn->node) { |
|
case NODE_CAUTION: |
|
case NODE_NOTE: |
|
case NODE_TIP: |
|
case NODE_WARNING: |
|
level = 3; |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
|
|
for (node = 0; node < NODE__MAX; node++) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NULL == nodes[node].name) |
if (pp->node == NODE_TITLE) |
continue; |
|
else if (0 == strcmp(nodes[node].name, name)) |
|
break; |
break; |
|
|
if (NODE__MAX == node && NODE_ROOT == ps->node) { |
if (pp == NULL) { |
fprintf(stderr, "%s: ignoring node\n", name); |
switch (pn->node) { |
return; |
case NODE_PREFACE: |
} else if (NODE__MAX == node) { |
title = "Preface"; |
fprintf(stderr, "%s: unknown node\n", name); |
break; |
ps->stop = 1; |
case NODE_CAUTION: |
return; |
title = "Caution"; |
} else if (NODE_ROOT == ps->node && NULL != ps->root) { |
break; |
fprintf(stderr, "%s: reentering?\n", name); |
case NODE_NOTE: |
ps->stop = 1; |
title = "Note"; |
return; |
break; |
} else if (NODE_ROOT == ps->node && NODE_REFENTRY != node) { |
case NODE_TIP: |
fprintf(stderr, "%s: known node w/o context\n", name); |
title = "Tip"; |
return; |
break; |
} else if ( ! isparent(node, ps->node)) { |
case NODE_WARNING: |
fprintf(stderr, "%s: bad parent\n", name); |
title = "Warning"; |
ps->stop = 1; |
break; |
return; |
default: |
|
title = "Unknown"; |
|
break; |
|
} |
} |
} |
|
|
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
switch (level) { |
perror(NULL); |
case 1: |
exit(EXIT_FAILURE); |
macro_open(p, "Sh"); |
|
break; |
|
case 2: |
|
macro_open(p, "Ss"); |
|
break; |
|
default: |
|
pnode_printpara(p, pn); |
|
macro_open(p, "Sy"); |
|
break; |
} |
} |
|
|
dat->node = ps->node = node; |
if (pp != NULL) { |
dat->parent = ps->cur; |
macro_addnode(p, pp, flags); |
TAILQ_INIT(&dat->childq); |
pnode_unlink(pp); |
|
} else |
if (NULL != ps->cur) |
macro_addarg(p, title, ARG_SPACE | ARG_QUOTED); |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
macro_close(p); |
|
|
ps->cur = dat; |
|
if (NULL == ps->root) |
|
ps->root = dat; |
|
} |
} |
|
|
/* |
/* |
* Roll up the parse tree. |
* Start a reference, extracting the title and volume. |
* Does nothing else special. |
|
* 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_printciterefentry(struct format *p, struct pnode *pn) |
{ |
{ |
struct parse *ps = arg; |
struct pnode *pp, *title, *manvol; |
|
|
if (ps->stop || NODE_ROOT == ps->node) |
title = manvol = NULL; |
return; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (pp->node == NODE_MANVOLNUM) |
/* Close out text node, if applicable... */ |
manvol = pp; |
if (NODE_TEXT == ps->node) { |
else if (pp->node == NODE_REFENTRYTITLE) |
assert(NULL != ps->cur); |
title = pp; |
ps->cur = ps->cur->parent; |
|
assert(NULL != ps->cur); |
|
ps->node = ps->cur->node; |
|
} |
} |
|
macro_open(p, "Xr"); |
if (NULL == (ps->cur = ps->cur->parent)) |
if (title == NULL) |
ps->node = NODE_ROOT; |
macro_addarg(p, "unknown", ARG_SPACE); |
else |
else |
ps->node = ps->cur->node; |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE); |
|
if (manvol == NULL) |
|
macro_addarg(p, "1", ARG_SPACE); |
|
else |
|
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
|
macro_close(p); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
pnode_free(struct pnode *pn) |
pnode_printrefmeta(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp, *title, *manvol; |
|
|
if (NULL == pn) |
title = manvol = NULL; |
return; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (pp->node == NODE_MANVOLNUM) |
while (NULL != (pp = TAILQ_FIRST(&pn->childq))) { |
manvol = pp; |
TAILQ_REMOVE(&pn->childq, pp, child); |
else if (pp->node == NODE_REFENTRYTITLE) |
pnode_free(pp); |
title = pp; |
} |
} |
|
macro_open(p, "Dt"); |
free(pn->b); |
if (title == NULL) |
free(pn); |
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
|
else |
|
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
if (manvol == NULL) |
|
macro_addarg(p, "1", ARG_SPACE); |
|
else |
|
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
|
macro_close(p); |
|
pnode_unlink(pn); |
} |
} |
|
|
static void |
static void |
pnode_unlink(struct pnode *pn) |
pnode_printfuncdef(struct format *p, struct pnode *pn) |
{ |
{ |
|
struct pnode *pp, *ftype, *func; |
|
|
if (NULL != pn->parent) |
ftype = func = NULL; |
TAILQ_REMOVE(&pn->parent->childq, pn, child); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_free(pn); |
if (pp->node == NODE_TEXT) |
|
ftype = pp; |
|
else if (pp->node == NODE_FUNCTION) |
|
func = pp; |
|
} |
|
if (ftype != NULL) |
|
macro_argline(p, "Ft", ftype->b); |
|
macro_open(p, "Fo"); |
|
if (func == NULL) |
|
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
|
else |
|
macro_addnode(p, func, ARG_SPACE | ARG_SINGLE); |
|
macro_close(p); |
} |
} |
|
|
|
/* |
|
* 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_unlinksub(struct pnode *pn) |
pnode_printmathfenced(struct format *p, struct pnode *pn) |
{ |
{ |
|
struct pnode *pp; |
|
|
while ( ! TAILQ_EMPTY(&pn->childq)) |
printf("left %s ", pnode_getattr_raw(pn, ATTRKEY_OPEN, "(")); |
pnode_unlink(TAILQ_FIRST(&pn->childq)); |
|
} |
|
|
|
static void |
pp = TAILQ_FIRST(&pn->childq); |
bufclear(struct parse *p) |
pnode_print(p, pp); |
{ |
|
|
|
p->b[p->bsz = 0] = '\0'; |
while ((pp = TAILQ_NEXT(pp, child)) != NULL) { |
|
putchar(','); |
|
pnode_print(p, pp); |
|
} |
|
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
|
/* |
|
* These math nodes require special handling because they have infix |
|
* 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 |
bufappend(struct parse *p, struct pnode *pn) |
pnode_printmath(struct format *p, struct pnode *pn) |
{ |
{ |
|
struct pnode *pp; |
|
|
assert(NODE_TEXT == pn->node); |
pp = TAILQ_FIRST(&pn->childq); |
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
pnode_print(p, pp); |
p->mbsz = p->bsz + pn->bsz + 1; |
|
if (NULL == (p->b = realloc(p->b, p->mbsz))) { |
switch (pn->node) { |
perror(NULL); |
case NODE_MML_MSUP: |
exit(EXIT_FAILURE); |
fputs(" sup ", stdout); |
} |
break; |
|
case NODE_MML_MFRAC: |
|
fputs(" over ", stdout); |
|
break; |
|
case NODE_MML_MSUB: |
|
fputs(" sub ", stdout); |
|
break; |
|
default: |
|
break; |
} |
} |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
|
p->bsz += pn->bsz; |
pp = TAILQ_NEXT(pp, child); |
p->b[p->bsz] = '\0'; |
pnode_print(p, pp); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
bufappend_r(struct parse *p, struct pnode *pn) |
pnode_printfuncprototype(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp, *fdef; |
|
|
if (NODE_TEXT == pn->node) |
TAILQ_FOREACH(fdef, &pn->childq, child) |
bufappend(p, pn); |
if (fdef->node == NODE_FUNCDEF) |
|
break; |
|
|
|
if (fdef != NULL) |
|
pnode_printfuncdef(p, fdef); |
|
else |
|
macro_line(p, "Fo UNKNOWN"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
bufappend_r(p, pp); |
if (pp->node == NODE_PARAMDEF) |
|
macro_nodeline(p, "Fa", pp, ARG_SINGLE); |
|
|
|
macro_line(p, "Fc"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
* Print text presumably on a macro line. |
* The <arg> element is more complicated than it should be because text |
* Ignore any child macros. |
* nodes are treated like ".Ar foo", but non-text nodes need to be |
* Convert all whitespace to regular spaces. |
* 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_printmacrolinepart(struct parse *p, struct pnode *pn) |
pnode_printarg(struct format *p, struct pnode *pn) |
{ |
{ |
char *cp; |
struct pnode *pp; |
|
struct pattr *ap; |
|
int isop, isrep; |
|
|
bufclear(p); |
isop = 1; |
bufappend_r(p, pn); |
isrep = 0; |
|
TAILQ_FOREACH(ap, &pn->attrq, child) { |
|
if (ap->key == ATTRKEY_CHOICE && |
|
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) |
|
isop = 0; |
|
else if (ap->key == ATTRKEY_REP && ap->val == ATTRVAL_REPEAT) |
|
isrep = 1; |
|
} |
|
if (isop) |
|
macro_open(p, "Op"); |
|
|
/* Convert all space to spaces. */ |
TAILQ_FOREACH(pp, &pn->childq, child) { |
for (cp = p->b; '\0' != *cp; cp++) |
if (pp->node == NODE_TEXT) |
if (isspace((int)*cp)) |
macro_open(p, "Ar"); |
*cp = ' '; |
pnode_print(p, pp); |
|
if (isrep && pp->node == NODE_TEXT) |
for (cp = p->b; isspace((int)*cp); cp++) |
macro_addarg(p, "...", ARG_SPACE); |
/* Spin past whitespace (XXX: necessary?) */ ; |
|
for ( ; '\0' != *cp; cp++) { |
|
/* Escape us if we look like a macro. */ |
|
if ((cp == p->b || ' ' == *(cp - 1)) && |
|
isupper((int)*cp) && |
|
'\0' != *(cp + 1) && |
|
islower((int)*(cp + 1)) && |
|
('\0' == *(cp + 2) || |
|
' ' == *(cp + 2) || |
|
(islower((int)*(cp + 2)) && |
|
('\0' == *(cp + 3) || |
|
' ' == *(cp + 3))))) |
|
fputs("\\&", stdout); |
|
putchar(*cp); |
|
/* If we're a character escape, escape us. */ |
|
if ('\\' == *cp) |
|
putchar('e'); |
|
} |
} |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
|
* Just pnode_printmacrolinepart() but with a newline. |
|
* If no text, just the newline. |
|
*/ |
|
static void |
static void |
pnode_printmacroline(struct parse *p, struct pnode *pn) |
pnode_printgroup(struct format *p, struct pnode *pn) |
{ |
{ |
|
struct pnode *pp, *np; |
|
struct pattr *ap; |
|
int isop, sv; |
|
|
pnode_printmacrolinepart(p, pn); |
isop = 1; |
putchar('\n'); |
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ap->key == ATTRKEY_CHOICE && |
|
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) { |
|
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->linestate == LINE_NEW; |
|
if (isop) |
|
macro_open(p, "Op"); |
|
else if (sv) |
|
macro_open(p, "No"); |
|
|
|
/* |
|
* 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 (np != NULL) { |
|
if (pp->node != np->node) |
|
break; |
|
macro_addarg(p, "|", ARG_SPACE); |
|
macro_addnode(p, np, ARG_SPACE); |
|
pp = np; |
|
np = TAILQ_NEXT(np, child); |
|
} |
|
} |
|
if (sv) |
|
macro_close(p); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
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, *ncn; |
|
int have_contrib, have_name; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
/* |
if (NODE_TITLE == pp->node) |
* Print <contrib> children up front, before the .An scope, |
|
* and figure out whether we a name of a person. |
|
*/ |
|
|
|
have_contrib = have_name = 0; |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, ncn) { |
|
switch (nc->node) { |
|
case NODE_CONTRIB: |
|
if (have_contrib) |
|
print_text(f, ",", 0); |
|
print_textnode(f, nc); |
|
pnode_unlink(nc); |
|
have_contrib = 1; |
break; |
break; |
|
case NODE_PERSONNAME: |
|
have_name = 1; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
if (TAILQ_FIRST(&n->childq) == NULL) |
|
return; |
|
|
fputs(".Sh ", stdout); |
if (have_contrib) |
|
print_text(f, ":", 0); |
|
|
if (NULL != pp) { |
/* |
pnode_printmacroline(p, pp); |
* If we have a name, print it in the .An scope and leave |
pnode_unlink(pp); |
* all other content for child handlers, to print after the |
} else |
* scope. Otherwise, print everything in the scope. |
puts("UNKNOWN"); |
*/ |
|
|
|
macro_open(f, "An"); |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, ncn) { |
|
if (nc->node == NODE_PERSONNAME || have_name == 0) { |
|
macro_addnode(f, nc, ARG_SPACE); |
|
pnode_unlink(nc); |
|
} |
|
} |
|
|
|
/* |
|
* If there are still unprinted children, end the scope |
|
* with a comma. Otherwise, leave the scope open in case |
|
* a text node follows that starts with closing punctuation. |
|
*/ |
|
|
|
if (TAILQ_FIRST(&n->childq) != NULL) { |
|
macro_addarg(f, ",", ARG_SPACE); |
|
macro_close(f); |
|
} |
} |
} |
|
|
static void |
static void |
pnode_printciterefentry(struct parse *p, struct pnode *pn) |
pnode_printprologue(struct format *p, struct ptree *tree) |
{ |
{ |
struct pnode *pp, *title, *manvol; |
struct pnode *refmeta; |
|
|
title = manvol = NULL; |
refmeta = tree->root == NULL ? NULL : |
TAILQ_FOREACH(pp, &pn->childq, child) |
pnode_findfirst(tree->root, NODE_REFMETA); |
if (NODE_MANVOLNUM == pp->node) |
|
manvol = pp; |
|
else if (NODE_REFENTRYTITLE == pp->node) |
|
title = pp; |
|
|
|
fputs(".Xr ", stdout); |
macro_line(p, "Dd $Mdocdate" "$"); |
|
if (refmeta == NULL) { |
if (NULL != title) { |
macro_open(p, "Dt"); |
pnode_printmacrolinepart(p, title); |
macro_addarg(p, |
putchar(' '); |
pnode_getattr_raw(tree->root, ATTRKEY_ID, "UNKNOWN"), |
|
ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
macro_addarg(p, "1", ARG_SPACE); |
|
macro_close(p); |
} else |
} else |
fputs("unknown ", stdout); |
pnode_printrefmeta(p, refmeta); |
|
macro_line(p, "Os"); |
|
|
if (NULL != manvol) |
if (tree->flags & TREE_EQN) { |
pnode_printmacroline(p, manvol); |
macro_line(p, "EQ"); |
else |
print_text(p, "delim $$", 0); |
puts("1"); |
macro_line(p, "EN"); |
|
} |
} |
} |
|
|
|
/* |
|
* We can have multiple <term> elements within a <varlistentry>, which |
|
* we should comma-separate as list headers. |
|
*/ |
static void |
static void |
pnode_printrefmeta(struct parse *p, struct pnode *pn) |
pnode_printvarlistentry(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp, *title, *manvol; |
struct pnode *pp; |
|
int first = 1; |
|
|
title = manvol = NULL; |
macro_open(p, "It"); |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (pp->node != NODE_TERM) |
|
continue; |
|
if ( ! first) |
|
macro_addarg(p, ",", 0); |
|
pnode_print(p, pp); |
|
first = 0; |
|
} |
|
macro_close(p); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_MANVOLNUM == pp->node) |
if (pp->node != NODE_TERM) |
manvol = pp; |
pnode_print(p, pp); |
else if (NODE_REFENTRYTITLE == pp->node) |
pnode_unlinksub(pn); |
title = pp; |
|
|
|
puts(".Dd $Mdocdate" "$"); |
|
fputs(".Dt ", stdout); |
|
|
|
if (NULL != title) { |
|
pnode_printmacrolinepart(p, title); |
|
putchar(' '); |
|
} else |
|
fputs("UNKNOWN ", stdout); |
|
|
|
if (NULL != manvol) |
|
pnode_printmacroline(p, manvol); |
|
else |
|
puts("1"); |
|
|
|
puts(".Os"); |
|
} |
} |
|
|
static void |
static void |
pnode_printfuncdef(struct parse *p, struct pnode *pn) |
pnode_printtitle(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp, *ftype, *func; |
struct pnode *pp, *pq; |
|
|
ftype = func = NULL; |
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) { |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (pp->node == NODE_TITLE) { |
if (NODE_TEXT == pp->node) |
pnode_printpara(p, pp); |
ftype = pp; |
pnode_print(p, pp); |
else if (NODE_FUNCTION == pp->node) |
pnode_unlink(pp); |
func = pp; |
} |
|
|
if (NULL != ftype) { |
|
fputs(".Ft ", stdout); |
|
pnode_printmacroline(p, ftype); |
|
} |
} |
|
|
if (NULL != func) { |
|
fputs(".Fo ", stdout); |
|
pnode_printmacroline(p, func); |
|
} else |
|
puts(".Fo UNKNOWN"); |
|
} |
} |
|
|
static void |
static void |
pnode_printparamdef(struct parse *p, struct pnode *pn) |
pnode_printrow(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp, *ptype, *param; |
struct pnode *pp; |
|
|
ptype = param = NULL; |
macro_line(p, "Bl -dash -compact"); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (NODE_TEXT == pp->node) |
macro_line(p, "It"); |
ptype = pp; |
pnode_print(p, pp); |
else if (NODE_PARAMETER == pp->node) |
|
param = pp; |
|
|
|
fputs(".Fa \"", stdout); |
|
if (NULL != ptype) { |
|
pnode_printmacrolinepart(p, ptype); |
|
putchar(' '); |
|
} |
} |
|
macro_line(p, "El"); |
|
pnode_unlink(pn); |
|
} |
|
|
if (NULL != param) |
static void |
pnode_printmacrolinepart(p, param); |
pnode_printtable(struct format *p, struct pnode *pn) |
else |
{ |
fputs("UNKNOWN", stdout); |
struct pnode *pp; |
|
|
puts("\""); |
pnode_printtitle(p, pn); |
|
macro_line(p, "Bl -ohang"); |
|
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
|
macro_line(p, "It Table Row"); |
|
pnode_printrow(p, pp); |
|
} |
|
macro_line(p, "El"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
pnode_printfuncprototype(struct parse *p, struct pnode *pn) |
pnode_printlist(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp, *fdef; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(fdef, &pn->childq, child) |
pnode_printtitle(p, pn); |
if (NODE_FUNCDEF == fdef->node) |
macro_argline(p, "Bl", |
break; |
pn->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (NULL != fdef) |
macro_line(p, "It"); |
pnode_printfuncdef(p, fdef); |
pnode_print(p, pp); |
else |
} |
puts(".Fo UNKNOWN"); |
macro_line(p, "El"); |
|
pnode_unlinksub(pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_PARAMDEF == pp->node) |
|
pnode_printparamdef(p, pp); |
|
|
|
puts(".Fc"); |
|
} |
} |
|
|
/* TODO: handle "optional" values. */ |
|
static void |
static void |
pnode_printarg(struct parse *p, struct pnode *pn, int nested) |
pnode_printvariablelist(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
int sv = nested; |
|
|
|
if ( ! nested) |
pnode_printtitle(p, pn); |
fputs(".", stdout); |
macro_line(p, "Bl -tag -width Ds"); |
nested = 1; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (pp->node == NODE_VARLISTENTRY) |
if (NODE_OPTION == pp->node) { |
pnode_print(p, pp); |
fputs("Fl ", stdout); |
else |
pnode_printmacrolinepart(p, pp); |
macro_nodeline(p, "It", pp, 0); |
} else if (NODE_TEXT == pp->node) { |
} |
fputs("Ar ", stdout); |
macro_line(p, "El"); |
pnode_printmacrolinepart(p, pp); |
pnode_unlinksub(pn); |
} else if (NODE_ARG == pp->node) |
|
pnode_printarg(p, pp, nested); |
|
|
|
if ( ! sv) |
|
puts(""); |
|
} |
} |
|
|
/* |
/* |
* 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. |
* FIXME: macro line continuation? |
* FIXME: if we're in a literal context (<screen> or <programlisting> or |
|
* whatever), don't print inline macros. |
*/ |
*/ |
static void |
static void |
pnode_print(struct parse *p, struct pnode *pn) |
pnode_print(struct format *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
const char *ccp; |
char *cp; |
char *cp; |
int last; |
int last; |
|
enum linestate sv; |
|
|
if (NULL == pn) |
if (pn == NULL) |
return; |
return; |
|
|
if (NODE_TEXT != pn->node && NODE_ROOT != pn->node) |
sv = p->linestate; |
printf(".\\\" %s\n", nodes[pn->node].name); |
|
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_ARG): |
case NODE_APPLICATION: |
pnode_printarg(p, pn, 0); |
macro_open(p, "Nm"); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_CITEREFENTRY): |
case NODE_ARG: |
|
pnode_printarg(p, pn); |
|
break; |
|
case NODE_AUTHOR: |
|
pnode_printauthor(p, pn); |
|
break; |
|
case NODE_AUTHORGROUP: |
|
macro_line(p, "An -split"); |
|
break; |
|
case NODE_BOOKINFO: |
|
macro_line(p, "Sh NAME"); |
|
break; |
|
case NODE_CITEREFENTRY: |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_CODE): |
case NODE_CITETITLE: |
fputs(".Li ", stdout); |
macro_open(p, "%T"); |
pnode_printmacroline(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_COMMAND): |
case NODE_CODE: |
fputs(".Nm ", stdout); |
macro_open(p, "Li"); |
pnode_printmacroline(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCTION): |
case NODE_COMMAND: |
fputs(".Fn ", stdout); |
macro_open(p, "Nm"); |
pnode_printmacroline(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCPROTOTYPE): |
case NODE_CONSTANT: |
|
macro_open(p, "Dv"); |
|
break; |
|
case NODE_EDITOR: |
|
print_text(p, "editor:", ARG_SPACE); |
|
macro_open(p, "An"); |
|
break; |
|
case NODE_EMAIL: |
|
macro_open(p, "Aq Mt"); |
|
break; |
|
case NODE_EMPHASIS: |
|
case NODE_FIRSTTERM: |
|
macro_open(p, "Em"); |
|
break; |
|
case NODE_ENVAR: |
|
macro_open(p, "Ev"); |
|
break; |
|
case NODE_ESCAPE: |
|
if (p->linestate == LINE_NEW) |
|
p->linestate = LINE_TEXT; |
|
else |
|
putchar(' '); |
|
fputs(pn->b, stdout); |
|
break; |
|
case NODE_FILENAME: |
|
macro_open(p, "Pa"); |
|
break; |
|
case NODE_FUNCTION: |
|
macro_open(p, "Fn"); |
|
break; |
|
case NODE_FUNCPROTOTYPE: |
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCSYNOPSISINFO): |
case NODE_FUNCSYNOPSISINFO: |
fputs(".Fd ", stdout); |
macro_open(p, "Fd"); |
pnode_printmacroline(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_PARA): |
case NODE_INFORMALEQUATION: |
/* FIXME: not always. */ |
macro_line(p, "EQ"); |
puts(".Pp"); |
|
break; |
break; |
case (NODE_PARAMETER): |
case NODE_INLINEEQUATION: |
fputs(".Fa \"", stdout); |
if (p->linestate == LINE_NEW) |
pnode_printmacrolinepart(p, pn); |
p->linestate = LINE_TEXT; |
puts("\""); |
putchar('$'); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_PROGRAMLISTING): |
case NODE_ITEMIZEDLIST: |
puts(".Bd -literal"); |
pnode_printlist(p, pn); |
break; |
break; |
case (NODE_REFMETA): |
case NODE_GROUP: |
pnode_printrefmeta(p, pn); |
pnode_printgroup(p, pn); |
|
break; |
|
case NODE_KEYSYM: |
|
macro_open(p, "Sy"); |
|
break; |
|
case NODE_LEGALNOTICE: |
|
macro_line(p, "Sh LEGAL NOTICE"); |
|
break; |
|
case NODE_LINK: |
|
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
|
if (ccp == NULL) |
|
break; |
|
macro_argline(p, "Sx", ccp); |
|
return; |
|
case NODE_LITERAL: |
|
macro_open(p, "Li"); |
|
break; |
|
case NODE_LITERALLAYOUT: |
|
macro_argline(p, "Bd", pnode_getattr(pn, ATTRKEY_CLASS) == |
|
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
|
break; |
|
case NODE_MML_MFENCED: |
|
pnode_printmathfenced(p, pn); |
|
break; |
|
case NODE_MML_MROW: |
|
case NODE_MML_MI: |
|
case NODE_MML_MN: |
|
case NODE_MML_MO: |
|
if (TAILQ_EMPTY(&pn->childq)) |
|
break; |
|
fputs(" { ", stdout); |
|
break; |
|
case NODE_MML_MFRAC: |
|
case NODE_MML_MSUB: |
|
case NODE_MML_MSUP: |
|
pnode_printmath(p, pn); |
|
break; |
|
case NODE_OPTION: |
|
macro_open(p, "Fl"); |
|
break; |
|
case NODE_ORDEREDLIST: |
|
pnode_printlist(p, pn); |
|
break; |
|
case NODE_PARA: |
|
pnode_printpara(p, pn); |
|
break; |
|
case NODE_PARAMETER: |
|
macro_nodeline(p, "Fa", pn, ARG_SINGLE); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_QUOTE: |
fputs(".Nm ", stdout); |
macro_open(p, "Qo"); |
pnode_printmacroline(p, pn); |
break; |
|
case NODE_PROGRAMLISTING: |
|
case NODE_SCREEN: |
|
macro_line(p, "Bd -literal"); |
|
break; |
|
case NODE_REFENTRYINFO: |
|
/* Suppress. */ |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
return; |
|
case (NODE_REFNAMEDIV): |
|
puts(".Sh NAME"); |
|
break; |
break; |
case (NODE_REFPURPOSE): |
case NODE_REFMETA: |
fputs(".Nd ", stdout); |
abort(); |
pnode_printmacroline(p, pn); |
break; |
|
case NODE_REFNAME: |
|
/* Suppress non-text children... */ |
|
macro_open(p, "Nm"); |
|
macro_addnode(p, pn, ARG_SPACE | ARG_SINGLE); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
return; |
|
case (NODE_REFSYNOPSISDIV): |
|
puts(".Sh SYNOPSIS"); |
|
break; |
break; |
case (NODE_REFSECT1): |
case NODE_REFNAMEDIV: |
|
macro_line(p, "Sh NAME"); |
|
break; |
|
case NODE_REFPURPOSE: |
|
macro_open(p, "Nd"); |
|
break; |
|
case NODE_REFSYNOPSISDIV: |
|
pnode_printrefsynopsisdiv(p, pn); |
|
break; |
|
case NODE_PREFACE: |
|
case NODE_SECTION: |
|
case NODE_NOTE: |
|
case NODE_TIP: |
|
case NODE_CAUTION: |
|
case NODE_WARNING: |
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
break; |
break; |
case (NODE_TEXT): |
case NODE_REPLACEABLE: |
bufclear(p); |
macro_open(p, "Ar"); |
bufappend(p, pn); |
break; |
|
case NODE_SBR: |
|
macro_line(p, "br"); |
|
break; |
|
case NODE_SGMLTAG: |
|
macro_open(p, "Li"); |
|
break; |
|
case NODE_STRUCTNAME: |
|
macro_open(p, "Vt"); |
|
break; |
|
case NODE_TABLE: |
|
case NODE_INFORMALTABLE: |
|
pnode_printtable(p, pn); |
|
break; |
|
case NODE_TEXT: |
|
if (pn->bsz == 0) { |
|
assert(pn->real != pn->b); |
|
break; |
|
} |
|
if (p->linestate == LINE_NEW) |
|
p->linestate = LINE_TEXT; |
|
else |
|
putchar(' '); |
|
|
/* |
/* |
* Output all characters, squeezing out whitespace |
* Output all characters, squeezing out whitespace |
* between newlines. |
* between newlines. |
* XXX: all whitespace, including tabs (?). |
* XXX: all whitespace, including tabs (?). |
* Remember to escape control characters and escapes. |
* Remember to escape control characters and escapes. |
*/ |
*/ |
for (last = '\n', cp = p->b; '\0' != *cp; ) { |
cp = pn->b; |
if ('\n' == last) { |
|
|
/* |
|
* There's often a superfluous "-" in its <option> tags |
|
* before the actual flags themselves. |
|
* "Fl" does this for us, so remove it. |
|
*/ |
|
if (pn->parent != NULL && |
|
pn->parent->node == NODE_OPTION && |
|
*cp == '-') |
|
cp++; |
|
for (last = '\n'; *cp != '\0'; ) { |
|
if (last == '\n') { |
/* Consume all whitespace. */ |
/* Consume all whitespace. */ |
if (isspace((int)*cp)) { |
if (isspace((unsigned char)*cp)) { |
while (isspace((int)*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'); |
} |
} |
if ('\n' != last) |
|
putchar('\n'); |
|
break; |
break; |
|
case NODE_TITLE: |
|
if (pn->parent->node == NODE_BOOKINFO) |
|
macro_open(p, "Nd"); |
|
break; |
|
case NODE_TYPE: |
|
macro_open(p, "Vt"); |
|
break; |
|
case NODE_USERINPUT: |
|
macro_open(p, "Li"); |
|
break; |
|
case NODE_VARIABLELIST: |
|
pnode_printvariablelist(p, pn); |
|
break; |
|
case NODE_VARLISTENTRY: |
|
pnode_printvarlistentry(p, pn); |
|
break; |
|
case NODE_VARNAME: |
|
macro_open(p, "Va"); |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
Line 927 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 847 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_PROGRAMLISTING): |
case NODE_INFORMALEQUATION: |
puts(".Ed"); |
macro_line(p, "EN"); |
break; |
break; |
|
case NODE_INLINEEQUATION: |
|
fputs("$ ", stdout); |
|
p->linestate = sv; |
|
break; |
|
case NODE_MML_MROW: |
|
case NODE_MML_MI: |
|
case NODE_MML_MN: |
|
case NODE_MML_MO: |
|
if (TAILQ_EMPTY(&pn->childq)) |
|
break; |
|
fputs(" } ", stdout); |
|
break; |
|
case NODE_APPLICATION: |
|
case NODE_ARG: |
|
case NODE_AUTHOR: |
|
case NODE_CITEREFENTRY: |
|
case NODE_CITETITLE: |
|
case NODE_CODE: |
|
case NODE_COMMAND: |
|
case NODE_CONSTANT: |
|
case NODE_EDITOR: |
|
case NODE_EMAIL: |
|
case NODE_EMPHASIS: |
|
case NODE_ENVAR: |
|
case NODE_FILENAME: |
|
case NODE_FIRSTTERM: |
|
case NODE_FUNCTION: |
|
case NODE_FUNCSYNOPSISINFO: |
|
case NODE_KEYSYM: |
|
case NODE_LITERAL: |
|
case NODE_OPTION: |
|
case NODE_PARAMETER: |
|
case NODE_REPLACEABLE: |
|
case NODE_REFPURPOSE: |
|
case NODE_SGMLTAG: |
|
case NODE_STRUCTNAME: |
|
case NODE_TYPE: |
|
case NODE_USERINPUT: |
|
case NODE_VARNAME: |
|
if (sv != LINE_MACRO && p->linestate == LINE_MACRO) |
|
macro_closepunct(p, pn); |
|
break; |
|
case NODE_QUOTE: |
|
if (sv == LINE_NEW) |
|
macro_close(p); |
|
sv = p->linestate; |
|
macro_open(p, "Qc"); |
|
if (sv == LINE_NEW) |
|
macro_close(p); |
|
break; |
|
case NODE_REFNAME: |
|
/* |
|
* If we're in the NAME macro and we have multiple |
|
* <refname> macros in sequence, then print out a |
|
* trailing comma before the newline. |
|
*/ |
|
if (pn->parent != NULL && |
|
pn->parent->node == NODE_REFNAMEDIV && |
|
TAILQ_NEXT(pn, child) != NULL && |
|
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
|
macro_addarg(p, ",", ARG_SPACE); |
|
if (sv == LINE_NEW) |
|
macro_close(p); |
|
break; |
|
case NODE_PREFACE: |
|
case NODE_SECTION: |
|
case NODE_NOTE: |
|
case NODE_TIP: |
|
case NODE_CAUTION: |
|
case NODE_WARNING: |
|
p->level--; |
|
break; |
|
case NODE_LITERALLAYOUT: |
|
case NODE_PROGRAMLISTING: |
|
case NODE_SCREEN: |
|
macro_line(p, "Ed"); |
|
break; |
|
case NODE_TITLE: |
|
if (pn->parent->node == NODE_BOOKINFO) |
|
macro_line(p, "Sh AUTHORS"); |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
} |
} |
|
|
/* |
void |
* Loop around the read buffer until we've drained it of all data. |
ptree_print(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); |
pnode_printprologue(&formatter, tree); |
|
pnode_print(&formatter, tree->root); |
XML_SetCharacterDataHandler(xp, xml_char); |
if (formatter.linestate != LINE_NEW) |
XML_SetElementHandler(xp, xml_elem_start, xml_elem_end); |
putchar('\n'); |
XML_SetUserData(xp, &p); |
|
|
|
while ((ssz = read(fd, b, bsz)) >= 0) { |
|
if (0 == (rc = XML_Parse(xp, b, ssz, 0 == ssz))) |
|
fprintf(stderr, "%s: %s\n", fn, |
|
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. |
|
*/ |
|
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; |
|
|
|
fname = "-"; |
|
xp = NULL; |
|
buf = NULL; |
|
rc = 0; |
|
|
|
if (-1 != getopt(argc, argv, "")) |
|
return(EXIT_FAILURE); |
|
|
|
argc -= optind; |
|
argv += optind; |
|
|
|
if (argc > 1) |
|
return(EXIT_FAILURE); |
|
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); |
|
} |
} |