version 1.64, 2019/03/22 19:07:07 |
version 1.73, 2019/03/25 23:14:44 |
|
|
|
|
#include "extern.h" |
#include "extern.h" |
|
|
|
enum linestate { |
|
LINE_NEW = 0, |
|
LINE_TEXT, |
|
LINE_MACRO |
|
}; |
|
|
/* |
/* |
* Global parse state. |
* Global parse state. |
* Keep this as simple and small as possible. |
* Keep this as simple and small as possible. |
*/ |
*/ |
struct parse { |
struct parse { |
XML_Parser xml; |
XML_Parser xml; |
enum nodeid node; /* current (NODE_ROOT if pre-tree) */ |
|
const char *fname; /* filename */ |
const char *fname; /* filename */ |
int stop; /* should we stop now? */ |
int stop; /* should we stop now? */ |
#define PARSE_EQN 1 |
#define PARSE_EQN 1 |
unsigned int flags; /* document-wide flags */ |
unsigned int flags; /* document-wide flags */ |
struct pnode *root; /* root of parse tree */ |
struct pnode *root; /* root of parse tree */ |
struct pnode *cur; /* current node in 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 level; /* header level, starting at 1 */ |
int newln; /* output: are we on a fresh line */ |
enum linestate linestate; |
}; |
}; |
|
|
struct node { |
struct node { |
Line 117 static const struct node nodes[] = { |
|
Line 119 static const struct node nodes[] = { |
|
{ "copyright", NODE_COPYRIGHT }, |
{ "copyright", NODE_COPYRIGHT }, |
{ "date", NODE_DATE }, |
{ "date", NODE_DATE }, |
{ "editor", NODE_EDITOR }, |
{ "editor", NODE_EDITOR }, |
|
{ "email", NODE_EMAIL }, |
{ "emphasis", NODE_EMPHASIS }, |
{ "emphasis", NODE_EMPHASIS }, |
{ "entry", NODE_ENTRY }, |
{ "entry", NODE_ENTRY }, |
{ "envar", NODE_ENVAR }, |
{ "envar", NODE_ENVAR }, |
Line 167 static const struct node nodes[] = { |
|
Line 170 static const struct node nodes[] = { |
|
{ "paramdef", NODE_PARAMDEF }, |
{ "paramdef", NODE_PARAMDEF }, |
{ "parameter", NODE_PARAMETER }, |
{ "parameter", NODE_PARAMETER }, |
{ "part", NODE_SECTION }, |
{ "part", NODE_SECTION }, |
|
{ "personname", NODE_PERSONNAME }, |
{ "phrase", NODE_PHRASE }, |
{ "phrase", NODE_PHRASE }, |
{ "preface", NODE_PREFACE }, |
{ "preface", NODE_PREFACE }, |
{ "primary", NODE_PRIMARY }, |
{ "primary", NODE_PRIMARY }, |
Line 244 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 248 xml_char(void *arg, const XML_Char *p, int sz) |
|
struct pnode *dat; |
struct pnode *dat; |
int i; |
int i; |
|
|
/* Stopped or no tree yet. */ |
if (ps->stop) |
if (ps->stop || ps->node == NODE_ROOT) |
|
return; |
return; |
|
|
assert(ps->cur != NULL); |
|
|
|
/* |
/* |
* Are we in the midst of processing text? |
* Are we in the midst of processing text? |
* If we're not processing text right now, then create a text |
* If we're not processing text right now, then create a text |
Line 257 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 258 xml_char(void *arg, const XML_Char *p, int sz) |
|
* However, don't do so unless we have some non-whitespace to |
* However, don't do so unless we have some non-whitespace to |
* process: strip out all leading whitespace to be sure. |
* process: strip out all leading whitespace to be sure. |
*/ |
*/ |
if (ps->node != NODE_TEXT) { |
if (ps->cur->node != NODE_TEXT) { |
for (i = 0; i < sz; i++) |
for (i = 0; i < sz; i++) |
if ( ! isspace((unsigned char)p[i])) |
if ( ! isspace((unsigned char)p[i])) |
break; |
break; |
Line 265 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 266 xml_char(void *arg, const XML_Char *p, int sz) |
|
return; |
return; |
p += i; |
p += i; |
sz -= i; |
sz -= i; |
dat = calloc(1, sizeof(struct pnode)); |
dat = calloc(1, sizeof(*dat)); |
if (dat == NULL) { |
if (dat == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = NODE_TEXT; |
dat->node = NODE_TEXT; |
dat->parent = ps->cur; |
dat->parent = ps->cur; |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->attrq); |
TAILQ_INIT(&dat->attrq); |
Line 282 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 283 xml_char(void *arg, const XML_Char *p, int sz) |
|
|
|
/* Append to current buffer. */ |
/* Append to current buffer. */ |
assert(sz >= 0); |
assert(sz >= 0); |
ps->cur->b = realloc(ps->cur->b, |
ps->cur->b = realloc(ps->cur->b, ps->cur->bsz + sz + 1); |
ps->cur->bsz + (size_t)sz); |
|
if (ps->cur->b == NULL) { |
if (ps->cur->b == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
} |
} |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
ps->cur->bsz += (size_t)sz; |
ps->cur->bsz += sz; |
|
ps->cur->b[ps->cur->bsz] = '\0'; |
ps->cur->real = ps->cur->b; |
ps->cur->real = ps->cur->b; |
} |
} |
|
|
|
|
pnode_trim(struct pnode *pn) |
pnode_trim(struct pnode *pn) |
{ |
{ |
assert(pn->node == NODE_TEXT); |
assert(pn->node == NODE_TEXT); |
for ( ; pn->bsz > 0; pn->bsz--) |
for (; pn->bsz > 0; pn->b[--pn->bsz] = '\0') |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
break; |
break; |
} |
} |
Line 332 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 333 xml_elem_start(void *arg, const XML_Char *name, const |
|
return; |
return; |
|
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (ps->node == NODE_TEXT) { |
if (ps->cur != NULL && ps->cur->node == NODE_TEXT) { |
pnode_trim(ps->cur); |
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
ps->node = ps->cur->node; |
|
} |
} |
|
|
for (node = nodes; node->name != NULL; node++) |
for (node = nodes; node->name != NULL; node++) |
Line 343 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 343 xml_elem_start(void *arg, const XML_Char *name, const |
|
break; |
break; |
|
|
if (node->name == NULL) { |
if (node->name == NULL) { |
if (ps->node == NODE_ROOT) |
|
return; |
|
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml), name); |
XML_GetCurrentColumnNumber(ps->xml), name); |
ps->stop = 1; |
ps->stop = 1; |
return; |
return; |
} else if (ps->node == NODE_ROOT && ps->root != NULL) { |
|
fprintf(stderr, "%s:%zu:%zu: multiple refentries\n", |
|
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml)); |
|
ps->stop = 1; |
|
return; |
|
} |
} |
|
|
if (node->node == NODE_INLINEEQUATION) |
if (node->node == NODE_INLINEEQUATION) |
ps->flags |= PARSE_EQN; |
ps->flags |= PARSE_EQN; |
|
|
if ((dat = calloc(1, sizeof(struct pnode))) == NULL) { |
if ((dat = calloc(1, sizeof(*dat))) == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = node->node; |
dat->node = node->node; |
dat->parent = ps->cur; |
dat->parent = ps->cur; |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->attrq); |
TAILQ_INIT(&dat->attrq); |
Line 398 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 390 xml_elem_start(void *arg, const XML_Char *name, const |
|
for (val = 0; val < ATTRVAL__MAX; val++) |
for (val = 0; val < ATTRVAL__MAX; val++) |
if (strcmp(att[1], attrvals[val]) == 0) |
if (strcmp(att[1], attrvals[val]) == 0) |
break; |
break; |
pattr = calloc(1, sizeof(struct pattr)); |
pattr = calloc(1, sizeof(*pattr)); |
pattr->key = key; |
pattr->key = key; |
pattr->val = val; |
pattr->val = val; |
if (val == ATTRVAL__MAX) |
if (val == ATTRVAL__MAX) |
pattr->rawval = strdup(att[1]); |
pattr->rawval = strdup(att[1]); |
TAILQ_INSERT_TAIL(&dat->attrq, pattr, child); |
TAILQ_INSERT_TAIL(&dat->attrq, pattr, child); |
} |
} |
|
|
} |
} |
|
|
/* |
/* |
* Roll up the parse tree. |
* Roll up the parse tree. |
* If we're at a text node, roll that one up first. |
* 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) |
xml_elem_end(void *arg, const XML_Char *name) |
{ |
{ |
struct parse *ps = arg; |
struct parse *ps = arg; |
|
|
|
if (ps->stop) |
|
return; |
|
|
/* FIXME: find a better way to ditch other namespaces. */ |
/* FIXME: find a better way to ditch other namespaces. */ |
if (ps->stop || ps->node == NODE_ROOT) |
if (strcmp(name, "xi:include") == 0) |
return; |
return; |
else if (strcmp(name, "xi:include") == 0) |
|
return; |
|
|
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (ps->node == NODE_TEXT) { |
if (ps->cur->node == NODE_TEXT) { |
pnode_trim(ps->cur); |
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
ps->node = ps->cur->node; |
|
} |
} |
|
ps->cur = ps->cur->parent; |
if ((ps->cur = ps->cur->parent) == NULL) |
|
ps->node = NODE_ROOT; |
|
else |
|
ps->node = ps->cur->node; |
|
} |
} |
|
|
/* |
/* |
Line 495 pnode_getattr(struct pnode *pn, enum attrkey key) |
|
Line 481 pnode_getattr(struct pnode *pn, enum attrkey key) |
|
{ |
{ |
struct pattr *ap; |
struct pattr *ap; |
|
|
|
if (pn == NULL) |
|
return ATTRVAL__MAX; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) |
if (ap->key == key) |
if (ap->key == key) |
return ap->val; |
return ap->val; |
Line 510 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
Line 498 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
{ |
{ |
struct pattr *ap; |
struct pattr *ap; |
|
|
|
if (pn == NULL) |
|
return defval; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) |
if (ap->key == key) |
if (ap->key == key) |
return ap->val == ATTRVAL__MAX ? ap->rawval : |
return ap->val == ATTRVAL__MAX ? ap->rawval : |
Line 518 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
Line 508 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
} |
} |
|
|
/* |
/* |
* Reset the lookaside buffer. |
|
*/ |
|
static void |
|
bufclear(struct parse *p) |
|
{ |
|
|
|
p->b[p->bsz = 0] = '\0'; |
|
} |
|
|
|
/* |
|
* Append NODE_TEXT contents to the current buffer, reallocating its |
|
* size if necessary. |
|
* The buffer is ALWAYS NUL-terminated. |
|
*/ |
|
static void |
|
bufappend(struct parse *p, struct pnode *pn) |
|
{ |
|
|
|
assert(pn->node == NODE_TEXT); |
|
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
|
p->mbsz = p->bsz + pn->bsz + 1; |
|
if ((p->b = realloc(p->b, p->mbsz)) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
} |
|
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
|
p->bsz += pn->bsz; |
|
p->b[p->bsz] = '\0'; |
|
} |
|
|
|
/* |
|
* Recursively append all NODE_TEXT nodes to the buffer. |
|
* This descends into non-text nodes, but doesn't do anything beyond |
|
* them. |
|
* In other words, this is a recursive text grok. |
|
*/ |
|
static void |
|
bufappend_r(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
if (pn->node == NODE_TEXT) |
|
bufappend(p, pn); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
bufappend_r(p, pp); |
|
} |
|
|
|
/* |
|
* Recursively search and return the first instance of "node". |
* Recursively search and return the first instance of "node". |
*/ |
*/ |
static struct pnode * |
static struct pnode * |
Line 585 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
Line 526 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
return res; |
return res; |
} |
} |
|
|
#define MACROLINE_NORM 0 |
static void |
#define MACROLINE_UPPER 1 |
macro_open(struct parse *p, const char *name) |
#define MACROLINE_NOWS 2 |
{ |
|
switch (p->linestate) { |
|
case LINE_TEXT: |
|
putchar('\n'); |
|
/* FALLTHROUGH */ |
|
case LINE_NEW: |
|
putchar('.'); |
|
p->linestate = LINE_MACRO; |
|
break; |
|
case LINE_MACRO: |
|
putchar(' '); |
|
break; |
|
} |
|
fputs(name, stdout); |
|
} |
|
|
|
static void |
|
macro_close(struct parse *p) |
|
{ |
|
assert(p->linestate == LINE_MACRO); |
|
putchar('\n'); |
|
p->linestate = LINE_NEW; |
|
} |
|
|
|
static void |
|
macro_line(struct parse *p, const char *name) |
|
{ |
|
macro_open(p, name); |
|
macro_close(p); |
|
} |
|
|
|
#define ARG_SPACE 1 /* Insert whitespace before this argument. */ |
|
#define ARG_SINGLE 2 /* Quote argument if it contains whitespace. */ |
|
#define ARG_QUOTED 4 /* We are already in a quoted argument. */ |
|
#define ARG_UPPER 8 /* Covert argument to upper case. */ |
/* |
/* |
* Recursively print text presumably on a macro line. |
* Print an argument string on a macro line, collapsing whitespace. |
* Convert all whitespace to regular spaces. |
|
*/ |
*/ |
static void |
static void |
pnode_printmacrolinetext(struct parse *p, struct pnode *pn, int fl) |
macro_addarg(struct parse *p, const char *arg, int flags) |
{ |
{ |
char *cp; |
const char *cp; |
|
|
if (p->newln == 0 && (fl & MACROLINE_NOWS) == 0) |
assert(p->linestate == LINE_MACRO); |
putchar(' '); |
|
|
|
bufclear(p); |
/* Quote if requested and necessary. */ |
bufappend_r(p, pn); |
|
|
|
/* Convert all space to spaces. */ |
if ((flags & (ARG_SINGLE | ARG_QUOTED)) == ARG_SINGLE) { |
for (cp = p->b; *cp != '\0'; cp++) |
for (cp = arg; *cp != '\0'; cp++) |
if (isspace((unsigned char)*cp)) |
if (isspace((unsigned char)*cp)) |
*cp = ' '; |
break; |
|
if (*cp != '\0') { |
|
if (flags & ARG_SPACE) { |
|
putchar(' '); |
|
flags &= ~ ARG_SPACE; |
|
} |
|
putchar('"'); |
|
flags = ARG_QUOTED; |
|
} |
|
} |
|
|
for (cp = p->b; isspace((unsigned char)*cp); cp++) |
for (cp = arg; *cp != '\0'; cp++) { |
/* Spin past whitespace (XXX: necessary?) */ ; |
|
for ( ; *cp != '\0'; cp++) { |
/* Collapse whitespace. */ |
|
|
|
if (isspace((unsigned char)*cp)) { |
|
flags |= ARG_SPACE; |
|
continue; |
|
} else if (flags & ARG_SPACE) { |
|
putchar(' '); |
|
flags &= ~ ARG_SPACE; |
|
} |
|
|
/* Escape us if we look like a macro. */ |
/* Escape us if we look like a macro. */ |
if ((cp == p->b || cp[-1] == ' ') && |
|
|
if ((flags & ARG_QUOTED) == 0 && |
|
(cp == arg || isspace((unsigned char)cp[-1])) && |
isupper((unsigned char)cp[0]) && |
isupper((unsigned char)cp[0]) && |
islower((unsigned char)cp[1]) && |
islower((unsigned char)cp[1]) && |
(cp[2] == '\0' || cp[2] == ' ' || |
(cp[2] == '\0' || cp[2] == ' ' || |
(islower((unsigned char)cp[2]) && |
(islower((unsigned char)cp[2]) && |
(cp[3] == '\0' || cp[3] == ' ')))) |
(cp[3] == '\0' || cp[3] == ' ')))) |
fputs("\\&", stdout); |
fputs("\\&", stdout); |
if (fl & MACROLINE_UPPER) |
|
|
if (*cp == '"') |
|
fputs("\\(dq", stdout); |
|
else if (flags & ARG_UPPER) |
putchar(toupper((unsigned char)*cp)); |
putchar(toupper((unsigned char)*cp)); |
else |
else |
putchar(*cp); |
putchar(*cp); |
/* If we're a character escape, escape us. */ |
|
if (*cp == '\\') |
if (*cp == '\\') |
putchar('e'); |
putchar('e'); |
} |
} |
} |
} |
|
|
static void |
static void |
pnode_printmacrolinepart(struct parse *p, struct pnode *pn) |
macro_argline(struct parse *p, const char *name, const char *arg) |
{ |
{ |
|
macro_open(p, name); |
pnode_printmacrolinetext(p, pn, 0); |
macro_addarg(p, arg, ARG_SPACE); |
|
macro_close(p); |
} |
} |
|
|
/* |
/* |
* Just pnode_printmacrolinepart() but with a newline. |
* Recursively append text from the children of a node to a macro line. |
* If no text, just the newline. |
|
*/ |
*/ |
static void |
static void |
pnode_printmacroline(struct parse *p, struct pnode *pn) |
macro_addnode(struct parse *p, struct pnode *pn, int flags) |
{ |
{ |
assert(p->newln == 0); |
int quote_now; |
pnode_printmacrolinetext(p, pn, 0); |
|
putchar('\n'); |
|
p->newln = 1; |
|
} |
|
|
|
static void |
assert(p->linestate == LINE_MACRO); |
pnode_printmopen(struct parse *p) |
|
{ |
/* |
if (p->newln) { |
* If the only child is a text node, just add that text, |
putchar('.'); |
* letting macro_addarg() decide about quoting. |
p->newln = 0; |
*/ |
} else |
|
putchar(' '); |
pn = TAILQ_FIRST(&pn->childq); |
|
if (pn != NULL && pn->node == NODE_TEXT && |
|
TAILQ_NEXT(pn, child) == NULL) { |
|
macro_addarg(p, pn->b, flags); |
|
return; |
|
} |
|
|
|
/* |
|
* If we want the argument quoted and are not already |
|
* in a quoted context, quote now. |
|
*/ |
|
|
|
quote_now = 0; |
|
if (flags & ARG_SINGLE) { |
|
if ((flags & ARG_QUOTED) == 0) { |
|
if (flags & ARG_SPACE) { |
|
putchar(' '); |
|
flags &= ~ARG_SPACE; |
|
} |
|
putchar('"'); |
|
flags |= ARG_QUOTED; |
|
quote_now = 1; |
|
} |
|
flags &= ~ARG_SINGLE; |
|
} |
|
|
|
/* |
|
* Iterate to child and sibling nodes, |
|
* inserting whitespace between nodes. |
|
*/ |
|
|
|
while (pn != NULL) { |
|
if (pn->node == NODE_TEXT) |
|
macro_addarg(p, pn->b, flags); |
|
else |
|
macro_addnode(p, pn, flags); |
|
pn = TAILQ_NEXT(pn, child); |
|
flags |= ARG_SPACE; |
|
} |
|
if (quote_now) |
|
putchar('"'); |
} |
} |
|
|
static void |
static void |
pnode_printmclose(struct parse *p, int sv) |
macro_nodeline(struct parse *p, const char *name, struct pnode *pn, int flags) |
{ |
{ |
|
macro_open(p, name); |
if (sv && ! p->newln) { |
macro_addnode(p, pn, ARG_SPACE | flags); |
putchar('\n'); |
macro_close(p); |
p->newln = 1; |
|
} |
|
} |
} |
|
|
/* |
/* |
* Like pnode_printmclose() except we look to the next node, and, if |
* If the next node is a text node starting with closing punctuation, |
* found, see if it starts with punctuation. |
* emit the closing punctuation as a trailing macro argument. |
* If it does, then we print that punctuation before the newline. |
|
*/ |
*/ |
static void |
static void |
pnode_printmclosepunct(struct parse *p, struct pnode *pn, int sv) |
macro_closepunct(struct parse *p, struct pnode *pn) |
{ |
{ |
/* We wouldn't have done anything anyway. */ |
if ((pn = TAILQ_NEXT(pn, child)) != NULL && |
if ( ! (sv && ! p->newln)) |
pn->node == NODE_TEXT && pn->bsz > 0 && |
return; |
|
|
|
/* No next node or it's not text. */ |
|
if ((pn = TAILQ_NEXT(pn, child)) == NULL) { |
|
pnode_printmclose(p, sv); |
|
return; |
|
} else if (pn->node != NODE_TEXT) { |
|
pnode_printmclose(p, sv); |
|
return; |
|
} |
|
|
|
/* Only do this for the comma/period. */ |
|
if (pn->bsz > 0 && |
|
(pn->b[0] == ',' || pn->b[0] == '.') && |
(pn->b[0] == ',' || pn->b[0] == '.') && |
(pn->bsz == 1 || isspace((unsigned char)pn->b[1]))) { |
(pn->bsz == 1 || isspace((unsigned char)pn->b[1]))) { |
putchar(' '); |
putchar(' '); |
Line 699 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
Line 713 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
pn->b++; |
pn->b++; |
pn->bsz--; |
pn->bsz--; |
} |
} |
|
macro_close(p); |
|
} |
|
|
putchar('\n'); |
static void |
p->newln = 1; |
print_text(struct parse *p, const char *word) |
|
{ |
|
switch (p->linestate) { |
|
case LINE_NEW: |
|
break; |
|
case LINE_TEXT: |
|
putchar(' '); |
|
break; |
|
case LINE_MACRO: |
|
macro_close(p); |
|
break; |
|
} |
|
fputs(word, stdout); |
|
p->linestate = LINE_TEXT; |
} |
} |
|
|
static void |
static void |
Line 709 pnode_printpara(struct parse *p, struct pnode *pn) |
|
Line 738 pnode_printpara(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
assert(p->newln); |
|
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL && |
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL && |
(pp = pn->parent) == NULL) |
(pp = pn->parent) == NULL) |
return; |
return; |
Line 726 pnode_printpara(struct parse *p, struct pnode *pn) |
|
Line 754 pnode_printpara(struct parse *p, struct pnode *pn) |
|
default: |
default: |
break; |
break; |
} |
} |
puts(".Pp"); |
macro_line(p, "Pp"); |
} |
} |
|
|
/* |
/* |
Line 735 pnode_printpara(struct parse *p, struct pnode *pn) |
|
Line 763 pnode_printpara(struct parse *p, struct pnode *pn) |
|
static void |
static void |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp, *pq; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) |
if (pp->node == NODE_TITLE) { |
if (pp->node == NODE_TITLE) |
pnode_unlink(pp); |
pnode_unlink(pp); |
return; |
|
} |
macro_line(p, "Sh SYNOPSIS"); |
} |
} |
|
|
/* |
/* |
Line 758 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 786 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
return; |
return; |
|
|
level = ++p->level; |
level = ++p->level; |
flags = level == 1 ? MACROLINE_UPPER : 0; |
flags = ARG_SPACE; |
|
if (level == 1) |
|
flags |= ARG_UPPER; |
if (level < 3) { |
if (level < 3) { |
switch (pn->node) { |
switch (pn->node) { |
case NODE_CAUTION: |
case NODE_CAUTION: |
Line 801 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 831 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
|
|
switch (level) { |
switch (level) { |
case 1: |
case 1: |
fputs(".Sh", stdout); |
macro_open(p, "Sh"); |
break; |
break; |
case 2: |
case 2: |
fputs(".Ss", stdout); |
macro_open(p, "Ss"); |
break; |
break; |
default: |
default: |
pnode_printpara(p, pn); |
pnode_printpara(p, pn); |
fputs(".Sy", stdout); |
macro_open(p, "Sy"); |
break; |
break; |
} |
} |
|
|
if (pp != NULL) { |
if (pp != NULL) { |
p->newln = 0; |
macro_addnode(p, pp, flags); |
pnode_printmacrolinetext(p, pp, flags); |
|
pnode_printmclose(p, 1); |
|
pnode_unlink(pp); |
pnode_unlink(pp); |
} else |
} else |
printf(" %s\n", title); |
macro_addarg(p, title, ARG_SPACE | ARG_QUOTED); |
|
macro_close(p); |
} |
} |
|
|
/* |
/* |
Line 830 pnode_printciterefentry(struct parse *p, struct pnode |
|
Line 859 pnode_printciterefentry(struct parse *p, struct pnode |
|
struct pnode *pp, *title, *manvol; |
struct pnode *pp, *title, *manvol; |
|
|
title = manvol = NULL; |
title = manvol = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (pp->node == NODE_MANVOLNUM) |
if (pp->node == NODE_MANVOLNUM) |
manvol = pp; |
manvol = pp; |
else if (pp->node == NODE_REFENTRYTITLE) |
else if (pp->node == NODE_REFENTRYTITLE) |
title = pp; |
title = pp; |
|
} |
if (title != NULL) |
macro_open(p, "Xr"); |
pnode_printmacrolinepart(p, title); |
if (title == NULL) |
|
macro_addarg(p, "unknown", ARG_SPACE); |
else |
else |
fputs(" unknown ", stdout); |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE); |
|
if (manvol == NULL) |
if (manvol == NULL) { |
macro_addarg(p, "1", ARG_SPACE); |
puts(" 1"); |
else |
p->newln = 1; |
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
} else |
macro_close(p); |
pnode_printmacrolinepart(p, manvol); |
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 854 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 884 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
struct pnode *pp, *title, *manvol; |
struct pnode *pp, *title, *manvol; |
|
|
title = manvol = NULL; |
title = manvol = NULL; |
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (pp->node == NODE_MANVOLNUM) |
if (pp->node == NODE_MANVOLNUM) |
manvol = pp; |
manvol = pp; |
else if (pp->node == NODE_REFENTRYTITLE) |
else if (pp->node == NODE_REFENTRYTITLE) |
title = pp; |
title = pp; |
|
} |
fputs(".Dt", stdout); |
macro_open(p, "Dt"); |
p->newln = 0; |
if (title == NULL) |
|
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
if (title != NULL) |
|
pnode_printmacrolinetext(p, title, MACROLINE_UPPER); |
|
else |
else |
fputs(" UNKNOWN ", stdout); |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
if (manvol == NULL) |
if (manvol == NULL) { |
macro_addarg(p, "1", ARG_SPACE); |
puts(" 1"); |
else |
p->newln = 1; |
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
} else |
macro_close(p); |
pnode_printmacroline(p, manvol); |
pnode_unlink(pn); |
} |
} |
|
|
static void |
static void |
Line 881 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
Line 908 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp, *ftype, *func; |
struct pnode *pp, *ftype, *func; |
|
|
assert(p->newln); |
|
ftype = func = NULL; |
ftype = func = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (pp->node == NODE_TEXT) |
if (pp->node == NODE_TEXT) |
ftype = pp; |
ftype = pp; |
else if (pp->node == NODE_FUNCTION) |
else if (pp->node == NODE_FUNCTION) |
func = pp; |
func = pp; |
|
|
if (ftype != NULL) { |
|
fputs(".Ft", stdout); |
|
p->newln = 0; |
|
pnode_printmacroline(p, ftype); |
|
} |
} |
|
if (ftype != NULL) |
if (func != NULL) { |
macro_argline(p, "Ft", ftype->b); |
fputs(".Fo", stdout); |
macro_open(p, "Fo"); |
p->newln = 0; |
if (func == NULL) |
pnode_printmacroline(p, func); |
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
} else { |
else |
puts(".Fo UNKNOWN"); |
macro_addnode(p, func, ARG_SPACE | ARG_SINGLE); |
p->newln = 1; |
macro_close(p); |
} |
|
} |
} |
|
|
static void |
|
pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *ptype, *param; |
|
|
|
assert(p->newln); |
|
ptype = param = NULL; |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (pp->node == NODE_TEXT) |
|
ptype = pp; |
|
else if (pp->node == NODE_PARAMETER) |
|
param = pp; |
|
|
|
fputs(".Fa \"", stdout); |
|
p->newln = 0; |
|
if (ptype != NULL) { |
|
pnode_printmacrolinetext(p, ptype, MACROLINE_NOWS); |
|
putchar(' '); |
|
} |
|
|
|
if (param != NULL) |
|
pnode_printmacrolinepart(p, param); |
|
|
|
puts("\""); |
|
p->newln = 1; |
|
} |
|
|
|
/* |
/* |
* The <mml:mfenced> node is a little peculiar. |
* The <mml:mfenced> node is a little peculiar. |
* First, it can have arbitrary open and closing tokens, which default |
* First, it can have arbitrary open and closing tokens, which default |
Line 952 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
Line 945 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
putchar(','); |
putchar(','); |
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
|
|
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
Line 986 pnode_printmath(struct parse *p, struct pnode *pn) |
|
Line 979 pnode_printmath(struct parse *p, struct pnode *pn) |
|
|
|
pp = TAILQ_NEXT(pp, child); |
pp = TAILQ_NEXT(pp, child); |
pnode_print(p, pp); |
pnode_print(p, pp); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 993 pnode_printfuncprototype(struct parse *p, struct pnode |
|
Line 987 pnode_printfuncprototype(struct parse *p, struct pnode |
|
{ |
{ |
struct pnode *pp, *fdef; |
struct pnode *pp, *fdef; |
|
|
assert(p->newln); |
|
TAILQ_FOREACH(fdef, &pn->childq, child) |
TAILQ_FOREACH(fdef, &pn->childq, child) |
if (fdef->node == NODE_FUNCDEF) |
if (fdef->node == NODE_FUNCDEF) |
break; |
break; |
Line 1001 pnode_printfuncprototype(struct parse *p, struct pnode |
|
Line 994 pnode_printfuncprototype(struct parse *p, struct pnode |
|
if (fdef != NULL) |
if (fdef != NULL) |
pnode_printfuncdef(p, fdef); |
pnode_printfuncdef(p, fdef); |
else |
else |
puts(".Fo UNKNOWN"); |
macro_line(p, "Fo UNKNOWN"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (pp->node == NODE_PARAMDEF) |
if (pp->node == NODE_PARAMDEF) |
pnode_printparamdef(p, pp); |
macro_nodeline(p, "Fa", pp, ARG_SINGLE); |
|
|
puts(".Fc"); |
macro_line(p, "Fc"); |
p->newln = 1; |
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
Line 1027 pnode_printarg(struct parse *p, struct pnode *pn) |
|
Line 1020 pnode_printarg(struct parse *p, struct pnode *pn) |
|
|
|
isop = 1; |
isop = 1; |
isrep = 0; |
isrep = 0; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) { |
if (ap->key == ATTRKEY_CHOICE && |
if (ap->key == ATTRKEY_CHOICE && |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) |
isop = 0; |
isop = 0; |
else if (ap->key == ATTRKEY_REP && ap->val == ATTRVAL_REPEAT) |
else if (ap->key == ATTRKEY_REP && ap->val == ATTRVAL_REPEAT) |
isrep = 1; |
isrep = 1; |
|
|
if (isop) { |
|
pnode_printmopen(p); |
|
fputs("Op", stdout); |
|
} |
} |
|
if (isop) |
|
macro_open(p, "Op"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (pp->node == NODE_TEXT) { |
if (pp->node == NODE_TEXT) |
pnode_printmopen(p); |
macro_open(p, "Ar"); |
fputs("Ar", stdout); |
|
} |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
if (isrep && pp->node == NODE_TEXT) |
if (isrep && pp->node == NODE_TEXT) |
fputs("...", stdout); |
macro_addarg(p, "...", ARG_SPACE); |
} |
} |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1070 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
Line 1060 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
* This will prevent pnode_print() for putting us on a |
* This will prevent pnode_print() for putting us on a |
* subsequent line. |
* subsequent line. |
*/ |
*/ |
sv = p->newln; |
sv = p->linestate == LINE_NEW; |
pnode_printmopen(p); |
|
if (isop) |
if (isop) |
fputs("Op", stdout); |
macro_open(p, "Op"); |
else if (sv) |
else if (sv) |
fputs("No", stdout); |
macro_open(p, "No"); |
|
|
/* |
/* |
* Keep on printing text separated by the vertical bar as long |
* Keep on printing text separated by the vertical bar as long |
Line 1091 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
Line 1080 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
while (np != NULL) { |
while (np != NULL) { |
if (pp->node != np->node) |
if (pp->node != np->node) |
break; |
break; |
fputs(" |", stdout); |
macro_addarg(p, "|", ARG_SPACE); |
pnode_printmacrolinepart(p, np); |
macro_addnode(p, np, ARG_SPACE); |
pp = np; |
pp = np; |
np = TAILQ_NEXT(np, child); |
np = TAILQ_NEXT(np, child); |
} |
} |
} |
} |
|
if (sv) |
pnode_printmclose(p, sv); |
macro_close(p); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1109 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
Line 1099 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
pp = p->root == NULL ? NULL : |
pp = p->root == NULL ? NULL : |
pnode_findfirst(p->root, NODE_REFMETA); |
pnode_findfirst(p->root, NODE_REFMETA); |
|
|
puts(".Dd $Mdocdate" "$"); |
macro_line(p, "Dd $Mdocdate" "$"); |
if (pp != NULL) { |
if (pp != NULL) |
pnode_printrefmeta(p, pp); |
pnode_printrefmeta(p, pp); |
pnode_unlink(pp); |
else { |
} else |
macro_open(p, "Dt"); |
printf(".Dt %s 1\n", |
macro_addarg(p, |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN")); |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN"), |
puts(".Os"); |
ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
macro_addarg(p, "1", ARG_SPACE); |
|
macro_close(p); |
|
} |
|
macro_line(p, "Os"); |
|
|
if (p->flags & PARSE_EQN) { |
if (p->flags & PARSE_EQN) { |
puts(".EQ"); |
macro_line(p, "EQ"); |
puts("delim $$"); |
print_text(p, "delim $$"); |
puts(".EN"); |
macro_line(p, "EN"); |
} |
} |
} |
} |
|
|
Line 1135 pnode_printvarlistentry(struct parse *p, struct pnode |
|
Line 1129 pnode_printvarlistentry(struct parse *p, struct pnode |
|
struct pnode *pp; |
struct pnode *pp; |
int first = 1; |
int first = 1; |
|
|
assert(p->newln); |
macro_open(p, "It"); |
fputs(".It", stdout); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
p->newln = 0; |
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 (pp->node == NODE_TERM) { |
if (pp->node != NODE_TERM) |
if ( ! first) |
|
putchar(','); |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlinksub(pn); |
first = 0; |
} |
} else |
|
break; |
|
|
|
putchar('\n'); |
static void |
p->newln = 1; |
pnode_printtitle(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *pq; |
|
|
|
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) { |
|
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
} |
} |
} |
|
|
static void |
static void |
Line 1158 pnode_printrow(struct parse *p, struct pnode *pn) |
|
Line 1164 pnode_printrow(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
puts(".Bl -dash -compact"); |
macro_line(p, "Bl -dash -compact"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
assert(p->newln); |
macro_line(p, "It"); |
puts(".It"); |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_printmclose(p, 1); |
|
} |
} |
assert(p->newln); |
macro_line(p, "El"); |
puts(".El"); |
pnode_unlink(pn); |
} |
} |
|
|
static void |
static void |
Line 1175 pnode_printtable(struct parse *p, struct pnode *pn) |
|
Line 1178 pnode_printtable(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
assert(p->newln); |
pnode_printtitle(p, pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
macro_line(p, "Bl -ohang"); |
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
assert(p->newln); |
|
puts(".Bl -ohang"); |
|
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
puts(".It Table Row"); |
macro_line(p, "It Table Row"); |
pnode_printrow(p, pp); |
pnode_printrow(p, pp); |
pnode_printmclose(p, 1); |
|
pnode_unlink(pp); |
|
} |
} |
assert(p->newln); |
macro_line(p, "El"); |
puts(".El"); |
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1199 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1193 pnode_printlist(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
assert(p->newln); |
pnode_printtitle(p, pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
macro_argline(p, "Bl", |
if (pp->node == NODE_TITLE) { |
pn->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
assert(p->newln); |
|
|
|
if (pn->node == NODE_ORDEREDLIST) |
|
puts(".Bl -enum"); |
|
else |
|
puts(".Bl -bullet"); |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
assert(p->newln); |
macro_line(p, "It"); |
puts(".It"); |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_printmclose(p, 1); |
|
} |
} |
assert(p->newln); |
macro_line(p, "El"); |
puts(".El"); |
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1228 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1209 pnode_printvariablelist(struct parse *p, struct pnode |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
assert(p->newln); |
pnode_printtitle(p, pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
macro_line(p, "Bl -tag -width Ds"); |
if (pp->node == NODE_TITLE) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_printpara(p, pp); |
if (pp->node == NODE_VARLISTENTRY) |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
else |
} |
macro_nodeline(p, "It", pp, 0); |
|
} |
assert(p->newln); |
macro_line(p, "El"); |
puts(".Bl -tag -width Ds"); |
pnode_unlinksub(pn); |
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (pp->node != NODE_VARLISTENTRY) { |
|
assert(p->newln); |
|
fputs(".It", stdout); |
|
pnode_printmacroline(p, pp); |
|
} else { |
|
assert(p->newln); |
|
pnode_print(p, pp); |
|
} |
|
assert(p->newln); |
|
puts(".El"); |
|
} |
} |
|
|
/* |
/* |
Line 1263 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1233 pnode_print(struct parse *p, struct pnode *pn) |
|
struct pnode *pp; |
struct pnode *pp; |
const char *ccp; |
const char *ccp; |
char *cp; |
char *cp; |
int last, sv; |
int last; |
|
enum linestate sv; |
|
|
if (pn == NULL) |
if (pn == NULL) |
return; |
return; |
|
|
sv = p->newln; |
sv = p->linestate; |
|
|
switch (pn->node) { |
switch (pn->node) { |
case NODE_APPLICATION: |
case NODE_APPLICATION: |
pnode_printmopen(p); |
macro_open(p, "Nm"); |
fputs("Nm", stdout); |
|
break; |
break; |
case NODE_ANCHOR: |
case NODE_ANCHOR: |
/* Don't print anything! */ |
/* Don't print anything! */ |
return; |
return; |
case NODE_ARG: |
case NODE_ARG: |
pnode_printarg(p, pn); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_AUTHOR: |
case NODE_AUTHOR: |
pnode_printmopen(p); |
macro_open(p, "An"); |
fputs("An", stdout); |
|
break; |
break; |
case NODE_AUTHORGROUP: |
case NODE_AUTHORGROUP: |
assert(p->newln); |
macro_line(p, "An -split"); |
puts(".An -split"); |
|
break; |
break; |
case NODE_BOOKINFO: |
case NODE_BOOKINFO: |
assert(p->newln); |
macro_line(p, "Sh NAME"); |
puts(".Sh NAME"); |
|
break; |
break; |
case NODE_CITEREFENTRY: |
case NODE_CITEREFENTRY: |
pnode_printmopen(p); |
|
fputs("Xr", stdout); |
|
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
|
case NODE_CITETITLE: |
|
macro_open(p, "%T"); |
|
break; |
case NODE_CODE: |
case NODE_CODE: |
pnode_printmopen(p); |
macro_open(p, "Li"); |
fputs("Li", stdout); |
|
break; |
break; |
case NODE_COMMAND: |
case NODE_COMMAND: |
pnode_printmopen(p); |
macro_open(p, "Nm"); |
fputs("Nm", stdout); |
|
break; |
break; |
case NODE_CONSTANT: |
case NODE_CONSTANT: |
pnode_printmopen(p); |
macro_open(p, "Dv"); |
fputs("Dv", stdout); |
|
break; |
break; |
case NODE_EDITOR: |
case NODE_EDITOR: |
puts("editor: "); |
print_text(p, "editor:"); |
pnode_printmopen(p); |
macro_open(p, "An"); |
fputs("An", stdout); |
|
break; |
break; |
|
case NODE_EMAIL: |
|
macro_open(p, "Aq Mt"); |
|
break; |
case NODE_EMPHASIS: |
case NODE_EMPHASIS: |
case NODE_FIRSTTERM: |
case NODE_FIRSTTERM: |
pnode_printmopen(p); |
macro_open(p, "Em"); |
fputs("Em", stdout); |
|
break; |
break; |
case NODE_ENVAR: |
case NODE_ENVAR: |
pnode_printmopen(p); |
macro_open(p, "Ev"); |
fputs("Ev", stdout); |
|
break; |
break; |
case NODE_FILENAME: |
case NODE_FILENAME: |
pnode_printmopen(p); |
macro_open(p, "Pa"); |
fputs("Pa", stdout); |
|
break; |
break; |
case NODE_FUNCTION: |
case NODE_FUNCTION: |
pnode_printmopen(p); |
macro_open(p, "Fn"); |
fputs("Fn", stdout); |
|
break; |
break; |
case NODE_FUNCPROTOTYPE: |
case NODE_FUNCPROTOTYPE: |
assert(p->newln); |
|
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_FUNCSYNOPSISINFO: |
case NODE_FUNCSYNOPSISINFO: |
pnode_printmopen(p); |
macro_open(p, "Fd"); |
fputs("Fd", stdout); |
|
break; |
break; |
case NODE_INDEXTERM: |
case NODE_INDEXTERM: |
return; |
return; |
case NODE_INFORMALEQUATION: |
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
macro_line(p, "EQ"); |
putchar('\n'); |
|
puts(".EQ"); |
|
p->newln = 0; |
|
break; |
break; |
case NODE_INLINEEQUATION: |
case NODE_INLINEEQUATION: |
fputc('$', stdout); |
if (p->linestate == LINE_NEW) |
p->newln = 0; |
p->linestate = LINE_TEXT; |
|
putchar('$'); |
break; |
break; |
case NODE_ITEMIZEDLIST: |
case NODE_ITEMIZEDLIST: |
assert(p->newln); |
|
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_GROUP: |
case NODE_GROUP: |
pnode_printgroup(p, pn); |
pnode_printgroup(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
|
case NODE_KEYSYM: |
|
macro_open(p, "Sy"); |
|
break; |
case NODE_LEGALNOTICE: |
case NODE_LEGALNOTICE: |
assert(p->newln); |
macro_line(p, "Sh LEGAL NOTICE"); |
puts(".Sh LEGAL NOTICE"); |
|
break; |
break; |
case NODE_LINK: |
case NODE_LINK: |
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
if (ccp == NULL) |
if (ccp == NULL) |
break; |
break; |
pnode_printmopen(p); |
macro_argline(p, "Sx", ccp); |
printf("Sx %s\n", ccp); |
|
p->newln = 1; |
|
return; |
return; |
case NODE_LITERAL: |
case NODE_LITERAL: |
pnode_printmopen(p); |
macro_open(p, "Li"); |
fputs("Li", stdout); |
|
break; |
break; |
case NODE_LITERALLAYOUT: |
case NODE_LITERALLAYOUT: |
assert(p->newln); |
macro_argline(p, "Bd", pnode_getattr(pn, ATTRKEY_CLASS) == |
puts(".Bd -literal"); |
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
break; |
break; |
case NODE_MML_MFENCED: |
case NODE_MML_MFENCED: |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_MML_MROW: |
case NODE_MML_MROW: |
case NODE_MML_MI: |
case NODE_MML_MI: |
Line 1400 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1351 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_MML_MSUB: |
case NODE_MML_MSUB: |
case NODE_MML_MSUP: |
case NODE_MML_MSUP: |
pnode_printmath(p, pn); |
pnode_printmath(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_OPTION: |
case NODE_OPTION: |
pnode_printmopen(p); |
macro_open(p, "Fl"); |
fputs("Fl", stdout); |
|
break; |
break; |
case NODE_ORDEREDLIST: |
case NODE_ORDEREDLIST: |
assert(p->newln); |
|
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_PARA: |
case NODE_PARA: |
pnode_printpara(p, pn); |
pnode_printpara(p, pn); |
break; |
break; |
case NODE_PARAMETER: |
case NODE_PARAMETER: |
/* Suppress non-text children... */ |
macro_nodeline(p, "Fa", pn, ARG_SINGLE); |
pnode_printmopen(p); |
|
fputs("Fa \"", stdout); |
|
pnode_printmacrolinetext(p, pn, MACROLINE_NOWS); |
|
fputs("\"", stdout); |
|
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
pnode_printmopen(p); |
macro_open(p, "Qo"); |
fputs("Qo", stdout); |
|
break; |
break; |
case NODE_PROGRAMLISTING: |
case NODE_PROGRAMLISTING: |
case NODE_SCREEN: |
case NODE_SCREEN: |
assert(p->newln); |
macro_line(p, "Bd -literal"); |
printf(".Bd %s\n", pnode_getattr(pn, ATTRKEY_CLASS) == |
|
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
|
break; |
break; |
case NODE_REFENTRYINFO: |
case NODE_REFENTRYINFO: |
/* Suppress. */ |
/* Suppress. */ |
Line 1441 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1381 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_REFNAME: |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
pnode_printmopen(p); |
macro_open(p, "Nm"); |
fputs("Nm", stdout); |
macro_addnode(p, pn, ARG_SPACE | ARG_SINGLE); |
p->newln = 0; |
|
pnode_printmacrolinepart(p, pn); |
|
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case NODE_REFNAMEDIV: |
case NODE_REFNAMEDIV: |
assert(p->newln); |
macro_line(p, "Sh NAME"); |
puts(".Sh NAME"); |
|
break; |
break; |
case NODE_REFPURPOSE: |
case NODE_REFPURPOSE: |
assert(p->newln); |
macro_open(p, "Nd"); |
pnode_printmopen(p); |
|
fputs("Nd", stdout); |
|
break; |
break; |
case NODE_REFSYNOPSISDIV: |
case NODE_REFSYNOPSISDIV: |
assert(p->newln); |
|
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
puts(".Sh SYNOPSIS"); |
|
break; |
break; |
case NODE_PREFACE: |
case NODE_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
Line 1467 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1400 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_TIP: |
case NODE_TIP: |
case NODE_CAUTION: |
case NODE_CAUTION: |
case NODE_WARNING: |
case NODE_WARNING: |
assert(p->newln); |
|
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
break; |
break; |
case NODE_REPLACEABLE: |
case NODE_REPLACEABLE: |
pnode_printmopen(p); |
macro_open(p, "Ar"); |
fputs("Ar", stdout); |
|
break; |
break; |
case NODE_SBR: |
case NODE_SBR: |
assert(p->newln); |
macro_line(p, "br"); |
puts(".br"); |
|
break; |
break; |
case NODE_SGMLTAG: |
case NODE_SGMLTAG: |
pnode_printmopen(p); |
macro_open(p, "Li"); |
fputs("Li", stdout); |
|
break; |
break; |
case NODE_STRUCTNAME: |
case NODE_STRUCTNAME: |
pnode_printmopen(p); |
macro_open(p, "Vt"); |
fputs("Vt", stdout); |
|
break; |
break; |
case NODE_TABLE: |
case NODE_TABLE: |
case NODE_INFORMALTABLE: |
case NODE_INFORMALTABLE: |
assert(p->newln); |
|
pnode_printtable(p, pn); |
pnode_printtable(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_TEXT: |
case NODE_TEXT: |
if (p->newln == 0) |
if (pn->bsz == 0) { |
putchar(' '); |
|
|
|
bufclear(p); |
|
bufappend(p, pn); |
|
|
|
if (p->bsz == 0) { |
|
assert(pn->real != pn->b); |
assert(pn->real != pn->b); |
break; |
break; |
} |
} |
|
if (p->linestate == LINE_NEW) |
|
p->linestate = LINE_TEXT; |
|
else |
|
putchar(' '); |
|
|
/* |
/* |
* Output all characters, squeezing out whitespace |
* Output all characters, squeezing out whitespace |
Line 1510 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1434 pnode_print(struct parse *p, struct pnode *pn) |
|
* XXX: all whitespace, including tabs (?). |
* XXX: all whitespace, including tabs (?). |
* Remember to escape control characters and escapes. |
* Remember to escape control characters and escapes. |
*/ |
*/ |
assert(p->bsz); |
cp = pn->b; |
cp = p->b; |
|
|
|
/* |
/* |
* There's often a superfluous "-" in its <option> tags |
* There's often a superfluous "-" in its <option> tags |
Line 1537 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1460 pnode_print(struct parse *p, struct pnode *pn) |
|
if (last == '\\') |
if (last == '\\') |
putchar('e'); |
putchar('e'); |
} |
} |
p->newln = 0; |
|
break; |
break; |
case NODE_TITLE: |
case NODE_TITLE: |
if (pn->parent->node == NODE_BOOKINFO) { |
if (pn->parent->node == NODE_BOOKINFO) |
pnode_printmopen(p); |
macro_open(p, "Nd"); |
fputs("Nd", stdout); |
|
} |
|
break; |
break; |
case NODE_TYPE: |
case NODE_TYPE: |
pnode_printmopen(p); |
macro_open(p, "Vt"); |
fputs("Vt", stdout); |
|
break; |
break; |
case NODE_USERINPUT: |
case NODE_USERINPUT: |
pnode_printmopen(p); |
macro_open(p, "Li"); |
fputs("Li", stdout); |
|
break; |
break; |
case NODE_VARIABLELIST: |
case NODE_VARIABLELIST: |
assert(p->newln); |
|
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_VARLISTENTRY: |
case NODE_VARLISTENTRY: |
assert(p->newln); |
|
pnode_printvarlistentry(p, pn); |
pnode_printvarlistentry(p, pn); |
break; |
break; |
case NODE_VARNAME: |
case NODE_VARNAME: |
pnode_printmopen(p); |
macro_open(p, "Va"); |
fputs("Va", stdout); |
|
break; |
break; |
default: |
default: |
break; |
break; |
Line 1575 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1489 pnode_print(struct parse *p, struct pnode *pn) |
|
|
|
switch (pn->node) { |
switch (pn->node) { |
case NODE_INFORMALEQUATION: |
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
macro_line(p, "EN"); |
putchar('\n'); |
|
puts(".EN"); |
|
p->newln = 1; |
|
break; |
break; |
case NODE_INLINEEQUATION: |
case NODE_INLINEEQUATION: |
fputs("$ ", stdout); |
fputs("$ ", stdout); |
p->newln = sv; |
p->linestate = sv; |
break; |
break; |
case NODE_MML_MROW: |
case NODE_MML_MROW: |
case NODE_MML_MI: |
case NODE_MML_MI: |
Line 1596 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1507 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_ARG: |
case NODE_ARG: |
case NODE_AUTHOR: |
case NODE_AUTHOR: |
case NODE_CITEREFENTRY: |
case NODE_CITEREFENTRY: |
|
case NODE_CITETITLE: |
case NODE_CODE: |
case NODE_CODE: |
case NODE_COMMAND: |
case NODE_COMMAND: |
case NODE_CONSTANT: |
case NODE_CONSTANT: |
case NODE_EDITOR: |
case NODE_EDITOR: |
|
case NODE_EMAIL: |
case NODE_EMPHASIS: |
case NODE_EMPHASIS: |
case NODE_ENVAR: |
case NODE_ENVAR: |
case NODE_FILENAME: |
case NODE_FILENAME: |
case NODE_FIRSTTERM: |
case NODE_FIRSTTERM: |
case NODE_FUNCTION: |
case NODE_FUNCTION: |
case NODE_FUNCSYNOPSISINFO: |
case NODE_FUNCSYNOPSISINFO: |
|
case NODE_KEYSYM: |
case NODE_LITERAL: |
case NODE_LITERAL: |
case NODE_OPTION: |
case NODE_OPTION: |
case NODE_PARAMETER: |
case NODE_PARAMETER: |
Line 1613 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1527 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_REFPURPOSE: |
case NODE_REFPURPOSE: |
case NODE_SGMLTAG: |
case NODE_SGMLTAG: |
case NODE_STRUCTNAME: |
case NODE_STRUCTNAME: |
case NODE_TEXT: |
|
case NODE_TYPE: |
case NODE_TYPE: |
case NODE_USERINPUT: |
case NODE_USERINPUT: |
case NODE_VARNAME: |
case NODE_VARNAME: |
pnode_printmclosepunct(p, pn, sv); |
if (sv != LINE_MACRO && p->linestate == LINE_MACRO) |
|
macro_closepunct(p, pn); |
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
pnode_printmclose(p, sv); |
if (sv == LINE_NEW) |
sv = p->newln; |
macro_close(p); |
pnode_printmopen(p); |
sv = p->linestate; |
fputs("Qc", stdout); |
macro_open(p, "Qc"); |
pnode_printmclose(p, sv); |
if (sv == LINE_NEW) |
|
macro_close(p); |
break; |
break; |
case NODE_REFNAME: |
case NODE_REFNAME: |
/* |
/* |
Line 1636 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1551 pnode_print(struct parse *p, struct pnode *pn) |
|
pn->parent->node == NODE_REFNAMEDIV && |
pn->parent->node == NODE_REFNAMEDIV && |
TAILQ_NEXT(pn, child) != NULL && |
TAILQ_NEXT(pn, child) != NULL && |
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
fputs(" ,", stdout); |
macro_addarg(p, ",", ARG_SPACE); |
pnode_printmclose(p, sv); |
if (sv == LINE_NEW) |
|
macro_close(p); |
break; |
break; |
case NODE_PREFACE: |
case NODE_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
Line 1650 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1566 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_LITERALLAYOUT: |
case NODE_LITERALLAYOUT: |
case NODE_PROGRAMLISTING: |
case NODE_PROGRAMLISTING: |
case NODE_SCREEN: |
case NODE_SCREEN: |
assert(p->newln); |
macro_line(p, "Ed"); |
puts(".Ed"); |
|
p->newln = 1; |
|
break; |
break; |
case NODE_TITLE: |
case NODE_TITLE: |
if (pn->parent->node == NODE_BOOKINFO) { |
if (pn->parent->node == NODE_BOOKINFO) |
pnode_printmclose(p, 1); |
macro_line(p, "Sh AUTHORS"); |
puts(".Sh AUTHORS"); |
|
} |
|
break; |
break; |
default: |
default: |
break; |
break; |
Line 1677 readfile(XML_Parser xp, int fd, |
|
Line 1589 readfile(XML_Parser xp, int fd, |
|
int rc; |
int rc; |
ssize_t ssz; |
ssize_t ssz; |
|
|
memset(&p, 0, sizeof(struct parse)); |
memset(&p, 0, sizeof(p)); |
|
|
p.b = malloc(p.bsz = p.mbsz = 1024); |
|
p.fname = fn; |
p.fname = fn; |
p.xml = xp; |
p.xml = xp; |
|
|
Line 1700 readfile(XML_Parser xp, int fd, |
|
Line 1610 readfile(XML_Parser xp, int fd, |
|
* Exit when we've read all or errors have occured |
* Exit when we've read all or errors have occured |
* during the parse sequence. |
* during the parse sequence. |
*/ |
*/ |
p.newln = 1; |
p.linestate = LINE_NEW; |
pnode_printprologue(&p, p.root); |
pnode_printprologue(&p, p.root); |
pnode_print(&p, p.root); |
pnode_print(&p, p.root); |
|
if (p.linestate != LINE_NEW) |
|
putchar('\n'); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
|
return rc != 0 && p.stop == 0; |
return rc != 0 && p.stop == 0; |
} |
} |
|
|
/* Read error has occured. */ |
/* Read error has occured. */ |
perror(fn); |
perror(fn); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
|
return 0; |
return 0; |
} |
} |
|
|