version 1.100, 2019/04/07 19:33:27 |
version 1.134, 2019/04/23 22:25:28 |
|
|
#include <ctype.h> |
#include <ctype.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
|
#include <string.h> |
|
|
#include "node.h" |
#include "node.h" |
#include "macro.h" |
#include "macro.h" |
|
|
*/ |
*/ |
|
|
static void pnode_print(struct format *, struct pnode *); |
static void pnode_print(struct format *, struct pnode *); |
|
static void pnode_printrefentry(struct format *, struct pnode *); |
|
|
|
|
static void |
static void |
Line 36 pnode_printtext(struct format *f, struct pnode *n) |
|
Line 38 pnode_printtext(struct format *f, struct pnode *n) |
|
{ |
{ |
struct pnode *nn; |
struct pnode *nn; |
char *cp; |
char *cp; |
char last; |
int accept_arg; |
|
|
if (n->bsz == 0) { |
cp = n->b; |
assert(n->real < n->b); |
accept_arg = f->flags & FMT_ARG; |
return; |
if (f->linestate == LINE_MACRO && !n->spc && !accept_arg) { |
|
for (;;) { |
|
if (*cp == '\0') |
|
return; |
|
if (strchr("!),.:;?]", *cp) == NULL) |
|
break; |
|
printf(" %c", *cp++); |
|
} |
|
if (isspace((unsigned char)*cp)) { |
|
while (isspace((unsigned char)*cp)) |
|
cp++; |
|
macro_close(f); |
|
} else { |
|
fputs(" Ns", stdout); |
|
f->flags &= FMT_IMPL; |
|
accept_arg = 1; |
|
} |
} |
} |
|
if (f->linestate == LINE_MACRO && !accept_arg && |
|
(f->flags & (FMT_CHILD | FMT_IMPL)) == 0) |
|
macro_close(f); |
|
|
/* |
/* |
* Text preceding a macro without intervening whitespace |
* Text preceding a macro without intervening whitespace |
Line 50 pnode_printtext(struct format *f, struct pnode *n) |
|
Line 71 pnode_printtext(struct format *f, struct pnode *n) |
|
*/ |
*/ |
|
|
if (f->linestate != LINE_MACRO && |
if (f->linestate != LINE_MACRO && |
(nn = TAILQ_NEXT(n, child)) != NULL && nn->spc == 0 && |
(nn = TAILQ_NEXT(n, child)) != NULL && nn->spc == 0) { |
(nn->node != NODE_TEXT && nn->node != NODE_ESCAPE)) { |
switch (pnode_class(nn->node)) { |
macro_open(f, "Pf"); |
case CLASS_LINE: |
nn->spc = 1; |
case CLASS_ENCL: |
|
macro_open(f, "Pf"); |
|
accept_arg = 1; |
|
f->flags |= FMT_CHILD; |
|
nn->spc = 1; |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
|
|
if (f->linestate == LINE_NEW) { |
switch (f->linestate) { |
last = '\n'; |
case LINE_NEW: |
f->linestate = LINE_TEXT; |
break; |
} else { |
case LINE_TEXT: |
last = ' '; |
if (n->spc) { |
if (n->spc || f->linestate == LINE_MACRO) |
if (n->node == NODE_TEXT) |
|
macro_close(f); |
|
else |
|
putchar(' '); |
|
} |
|
break; |
|
case LINE_MACRO: |
|
if (accept_arg) |
putchar(' '); |
putchar(' '); |
|
else |
|
macro_close(f); |
|
break; |
} |
} |
|
|
if (n->node == NODE_ESCAPE) { |
if (n->node == NODE_ESCAPE) { |
fputs(n->b, stdout); |
fputs(n->b, stdout); |
|
if (f->linestate == LINE_NEW) |
|
f->linestate = LINE_TEXT; |
return; |
return; |
} |
} |
|
|
Line 75 pnode_printtext(struct format *f, struct pnode *n) |
|
Line 116 pnode_printtext(struct format *f, struct pnode *n) |
|
* because the arguments of .Fl macros do not need it. |
* because the arguments of .Fl macros do not need it. |
*/ |
*/ |
|
|
cp = n->b; |
|
if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-') |
if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-') |
cp++; |
cp++; |
|
|
/* |
if (f->linestate == LINE_MACRO) |
* Print the text, skipping whitespace on new lines, |
macro_addarg(f, cp, 0); |
* escaping control characters on new lines, |
else |
* and escaping backslashes. |
print_text(f, cp, 0); |
*/ |
|
|
|
for (; *cp != '\0'; cp++) { |
|
if (last == '\n') { |
|
if (isspace((unsigned char)*cp)) |
|
continue; |
|
if (*cp == '\'' || *cp == '.') |
|
fputs("\\&", stdout); |
|
} |
|
putchar(last = *cp); |
|
if (last == '\\') |
|
putchar('e'); |
|
} |
|
} |
} |
|
|
static void |
static void |
pnode_printpara(struct format *p, struct pnode *pn) |
pnode_printimagedata(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
const char *cp; |
|
|
if (pn->parent == NULL) |
if ((cp = pnode_getattr_raw(n, ATTRKEY_FILEREF, NULL)) == NULL) |
return; |
cp = pnode_getattr_raw(n, ATTRKEY_ENTITYREF, NULL); |
|
if (cp != NULL) { |
|
print_text(f, "[image:", ARG_SPACE); |
|
print_text(f, cp, ARG_SPACE); |
|
print_text(f, "]", 0); |
|
} else |
|
print_text(f, "[image]", ARG_SPACE); |
|
} |
|
|
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL) |
static void |
pp = pn->parent; |
pnode_printrefnamediv(struct format *f, struct pnode *n) |
|
{ |
|
struct pnode *nc, *nn; |
|
int comma; |
|
|
switch (pp->node) { |
f->parastate = PARA_HAVE; |
case NODE_ENTRY: |
macro_line(f, "Sh NAME"); |
case NODE_GLOSSTERM: |
f->parastate = PARA_HAVE; |
case NODE_LISTITEM: |
comma = 0; |
case NODE_TERM: |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
return; |
if (nc->node != NODE_REFNAME) |
case NODE_APPENDIX: |
continue; |
case NODE_LEGALNOTICE: |
if (comma) |
case NODE_PREFACE: |
macro_addarg(f, ",", ARG_SPACE); |
case NODE_SECTION: |
macro_open(f, "Nm"); |
if (p->level < 3) |
macro_addnode(f, nc, ARG_SPACE); |
return; |
pnode_unlink(nc); |
break; |
comma = 1; |
default: |
|
break; |
|
} |
} |
macro_line(p, "Pp"); |
macro_close(f); |
} |
} |
|
|
/* |
/* |
* If the SYNOPSIS macro has a superfluous title, kill it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
static void |
static void |
pnode_printrefsynopsisdiv(struct format *p, struct pnode *pn) |
pnode_printrefsynopsisdiv(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *pq; |
struct pnode *nc, *nn; |
|
|
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) |
if (pp->node == NODE_TITLE) |
if (nc->node == NODE_TITLE) |
pnode_unlink(pp); |
pnode_unlink(nc); |
|
|
macro_line(p, "Sh SYNOPSIS"); |
f->parastate = PARA_HAVE; |
|
macro_line(f, "Sh SYNOPSIS"); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
/* |
/* |
* Start a hopefully-named `Sh' section. |
* Start a hopefully-named `Sh' section. |
*/ |
*/ |
static void |
static void |
pnode_printrefsect(struct format *p, struct pnode *pn) |
pnode_printsection(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *ncc; |
const char *title; |
const char *title; |
int flags, level; |
int flags, level; |
|
|
if (pn->parent == NULL) |
if (n->parent == NULL) { |
|
pnode_printrefentry(f, n); |
return; |
return; |
|
} |
|
|
level = ++p->level; |
level = ++f->level; |
flags = ARG_SPACE; |
flags = ARG_SPACE; |
if (level == 1) |
switch (n->node) { |
flags |= ARG_UPPER; |
case NODE_PREFACE: |
if (level < 3) { |
case NODE_SECTION: |
switch (pn->node) { |
case NODE_APPENDIX: |
case NODE_CAUTION: |
if (level == 1) |
case NODE_NOTE: |
flags |= ARG_UPPER; |
case NODE_TIP: |
break; |
case NODE_WARNING: |
case NODE_SIMPLESECT: |
|
case NODE_LEGALNOTICE: |
|
if (level < 2) |
|
level = 2; |
|
break; |
|
default: |
|
if (level < 3) |
level = 3; |
level = 3; |
break; |
break; |
default: |
|
break; |
|
} |
|
} |
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(nc, &n->childq, child) |
if (pp->node == NODE_TITLE) |
if (nc->node == NODE_TITLE) |
break; |
break; |
|
|
if (pp == NULL) { |
if (nc == NULL) { |
switch (pn->node) { |
switch (n->node) { |
case NODE_PREFACE: |
case NODE_PREFACE: |
title = "Preface"; |
title = "Preface"; |
break; |
break; |
Line 208 pnode_printrefsect(struct format *p, struct pnode *pn) |
|
Line 250 pnode_printrefsect(struct format *p, struct pnode *pn) |
|
|
|
switch (level) { |
switch (level) { |
case 1: |
case 1: |
macro_close(p); |
macro_close(f); |
macro_open(p, "Sh"); |
f->parastate = PARA_HAVE; |
|
macro_open(f, "Sh"); |
break; |
break; |
case 2: |
case 2: |
macro_close(p); |
macro_close(f); |
macro_open(p, "Ss"); |
f->parastate = PARA_HAVE; |
|
macro_open(f, "Ss"); |
break; |
break; |
default: |
default: |
pnode_printpara(p, pn); |
if (f->parastate == PARA_MID) |
macro_open(p, "Sy"); |
f->parastate = PARA_WANT; |
|
macro_open(f, "Sy"); |
break; |
break; |
} |
} |
|
|
if (pp != NULL) { |
if (nc != NULL) |
macro_addnode(p, pp, flags); |
macro_addnode(f, nc, flags); |
pnode_unlink(pp); |
else |
} else |
macro_addarg(f, title, flags | ARG_QUOTED); |
macro_addarg(p, title, flags | ARG_QUOTED); |
macro_close(f); |
macro_close(p); |
|
|
/* |
|
* DocBook has no equivalent for -split mode, |
|
* so just switch the default in the AUTHORS section. |
|
*/ |
|
|
|
if (nc != NULL) { |
|
if (level == 1 && |
|
(ncc = TAILQ_FIRST(&nc->childq)) != NULL && |
|
ncc->node == NODE_TEXT && |
|
strcasecmp(ncc->b, "AUTHORS") == 0) |
|
macro_line(f, "An -nosplit"); |
|
pnode_unlink(nc); |
|
} |
|
f->parastate = level > 2 ? PARA_WANT : PARA_HAVE; |
} |
} |
|
|
/* |
/* |
* Start a reference, extracting the title and volume. |
* Start a reference, extracting the title and volume. |
*/ |
*/ |
static void |
static void |
pnode_printciterefentry(struct format *p, struct pnode *pn) |
pnode_printciterefentry(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *title, *manvol; |
struct pnode *nc, *title, *manvol; |
|
|
title = manvol = NULL; |
title = manvol = NULL; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(nc, &n->childq, child) { |
if (pp->node == NODE_MANVOLNUM) |
if (nc->node == NODE_MANVOLNUM) |
manvol = pp; |
manvol = nc; |
else if (pp->node == NODE_REFENTRYTITLE) |
else if (nc->node == NODE_REFENTRYTITLE) |
title = pp; |
title = nc; |
} |
} |
macro_open(p, "Xr"); |
macro_open(f, "Xr"); |
if (title == NULL) |
if (title == NULL) |
macro_addarg(p, "unknown", ARG_SPACE); |
macro_addarg(f, "unknown", ARG_SPACE); |
else |
else |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE); |
macro_addnode(f, title, ARG_SPACE | ARG_SINGLE); |
if (manvol == NULL) |
if (manvol == NULL) |
macro_addarg(p, "1", ARG_SPACE); |
macro_addarg(f, "1", ARG_SPACE); |
else |
else |
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE); |
pnode_unlinksub(pn); |
|
} |
|
|
|
static void |
|
pnode_printrefmeta(struct format *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *title, *manvol; |
|
|
|
title = manvol = NULL; |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (pp->node == NODE_MANVOLNUM) |
|
manvol = pp; |
|
else if (pp->node == NODE_REFENTRYTITLE) |
|
title = pp; |
|
} |
|
macro_close(p); |
|
macro_open(p, "Dt"); |
|
if (title == NULL) |
|
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 |
|
pnode_printfuncdef(struct format *f, struct pnode *n) |
|
{ |
|
struct pnode *nc; |
|
|
|
nc = TAILQ_FIRST(&n->childq); |
|
if (nc != NULL && nc->node == NODE_TEXT) { |
|
macro_argline(f, "Ft", nc->b); |
|
pnode_unlink(nc); |
|
} |
|
macro_nodeline(f, "Fo", n, ARG_SINGLE); |
|
pnode_unlinksub(n); |
pnode_unlinksub(n); |
} |
} |
|
|
Line 303 pnode_printfuncdef(struct format *f, struct pnode *n) |
|
Line 322 pnode_printfuncdef(struct format *f, struct pnode *n) |
|
* Second, >1 arguments are separated by commas. |
* Second, >1 arguments are separated by commas. |
*/ |
*/ |
static void |
static void |
pnode_printmathfenced(struct format *p, struct pnode *pn) |
pnode_printmathfenced(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
printf("left %s ", pnode_getattr_raw(pn, ATTRKEY_OPEN, "(")); |
printf("left %s ", pnode_getattr_raw(n, ATTRKEY_OPEN, "(")); |
|
|
pp = TAILQ_FIRST(&pn->childq); |
nc = TAILQ_FIRST(&n->childq); |
pnode_print(p, pp); |
pnode_print(f, nc); |
|
|
while ((pp = TAILQ_NEXT(pp, child)) != NULL) { |
while ((nc = TAILQ_NEXT(nc, child)) != NULL) { |
putchar(','); |
putchar(','); |
pnode_print(p, pp); |
pnode_print(f, nc); |
} |
} |
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
printf("right %s ", pnode_getattr_raw(n, ATTRKEY_CLOSE, ")")); |
pnode_unlinksub(pn); |
pnode_unlinksub(n); |
} |
} |
|
|
/* |
/* |
Line 327 pnode_printmathfenced(struct format *p, struct pnode * |
|
Line 346 pnode_printmathfenced(struct format *p, struct pnode * |
|
* particular eqn(7) word. |
* particular eqn(7) word. |
*/ |
*/ |
static void |
static void |
pnode_printmath(struct format *p, struct pnode *pn) |
pnode_printmath(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
pp = TAILQ_FIRST(&pn->childq); |
nc = TAILQ_FIRST(&n->childq); |
pnode_print(p, pp); |
pnode_print(f, nc); |
|
|
switch (pn->node) { |
switch (n->node) { |
case NODE_MML_MSUP: |
case NODE_MML_MSUP: |
fputs(" sup ", stdout); |
fputs(" sup ", stdout); |
break; |
break; |
Line 348 pnode_printmath(struct format *p, struct pnode *pn) |
|
Line 367 pnode_printmath(struct format *p, struct pnode *pn) |
|
break; |
break; |
} |
} |
|
|
pp = TAILQ_NEXT(pp, child); |
nc = TAILQ_NEXT(nc, child); |
pnode_print(p, pp); |
pnode_print(f, nc); |
pnode_unlinksub(pn); |
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printfuncprototype(struct format *p, struct pnode *pn) |
pnode_printfuncprototype(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *fdef; |
struct pnode *fdef, *ftype, *nc, *nn; |
|
|
TAILQ_FOREACH(fdef, &pn->childq, child) |
/* |
if (fdef->node == NODE_FUNCDEF) |
* Extract <funcdef> child and ignore <void> child. |
|
* Leave other children in place, to be treated as parameters. |
|
*/ |
|
|
|
fdef = NULL; |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
|
switch (nc->node) { |
|
case NODE_FUNCDEF: |
|
if (fdef == NULL) { |
|
fdef = nc; |
|
TAILQ_REMOVE(&n->childq, nc, child); |
|
nc->parent = NULL; |
|
} |
break; |
break; |
|
case NODE_VOID: |
|
pnode_unlink(nc); |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
|
/* |
|
* If no children are left, the function is void; use .Fn. |
|
* Otherwise, use .Fo. |
|
*/ |
|
|
|
nc = TAILQ_FIRST(&n->childq); |
if (fdef != NULL) { |
if (fdef != NULL) { |
pnode_printfuncdef(p, fdef); |
ftype = TAILQ_FIRST(&fdef->childq); |
|
if (ftype != NULL && ftype->node == NODE_TEXT) { |
|
macro_argline(f, "Ft", ftype->b); |
|
pnode_unlink(ftype); |
|
} |
|
if (nc == NULL) { |
|
macro_open(f, "Fn"); |
|
macro_addnode(f, fdef, ARG_SPACE | ARG_SINGLE); |
|
macro_addarg(f, "void", ARG_SPACE); |
|
macro_close(f); |
|
} else |
|
macro_nodeline(f, "Fo", fdef, ARG_SINGLE); |
pnode_unlink(fdef); |
pnode_unlink(fdef); |
} else |
} else if (nc == NULL) |
macro_line(p, "Fo UNKNOWN"); |
macro_line(f, "Fn UNKNOWN void"); |
|
else |
|
macro_line(f, "Fo UNKNOWN"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
if (nc == NULL) |
macro_nodeline(p, "Fa", pp, ARG_SINGLE); |
return; |
|
|
macro_line(p, "Fc"); |
while (nc != NULL) { |
pnode_unlinksub(pn); |
macro_nodeline(f, "Fa", nc, ARG_SINGLE); |
|
pnode_unlink(nc); |
|
nc = TAILQ_FIRST(&n->childq); |
|
} |
|
macro_line(f, "Fc"); |
} |
} |
|
|
/* |
/* |
Line 383 pnode_printfuncprototype(struct format *p, struct pnod |
|
Line 444 pnode_printfuncprototype(struct format *p, struct pnod |
|
* ellipsis following an argument) and optionality. |
* ellipsis following an argument) and optionality. |
*/ |
*/ |
static void |
static void |
pnode_printarg(struct format *p, struct pnode *pn) |
pnode_printarg(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
struct pattr *ap; |
struct pattr *a; |
int isop, isrep; |
int isop, isrep, was_impl; |
|
|
isop = 1; |
isop = 1; |
isrep = 0; |
isrep = was_impl = 0; |
TAILQ_FOREACH(ap, &pn->attrq, child) { |
TAILQ_FOREACH(a, &n->attrq, child) { |
if (ap->key == ATTRKEY_CHOICE && |
if (a->key == ATTRKEY_CHOICE && |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) |
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
isop = 0; |
isop = 0; |
else if (ap->key == ATTRKEY_REP && ap->val == ATTRVAL_REPEAT) |
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
isrep = 1; |
isrep = 1; |
} |
} |
if (isop) |
if (isop) { |
macro_open(p, "Op"); |
if (f->flags & FMT_IMPL) { |
|
was_impl = 1; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
macro_open(f, "Oo"); |
if (pp->node == NODE_TEXT) |
} else { |
macro_open(p, "Ar"); |
macro_open(f, "Op"); |
pnode_print(p, pp); |
f->flags |= FMT_IMPL; |
if (isrep && pp->node == NODE_TEXT) |
} |
macro_addarg(p, "...", ARG_SPACE); |
|
} |
} |
pnode_unlinksub(pn); |
TAILQ_FOREACH(nc, &n->childq, child) { |
|
if (nc->node == NODE_TEXT) |
|
macro_open(f, "Ar"); |
|
pnode_print(f, nc); |
|
} |
|
if (isrep && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "...", ARG_SPACE); |
|
if (isop) { |
|
if (was_impl) |
|
macro_open(f, "Oc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printgroup(struct format *p, struct pnode *pn) |
pnode_printgroup(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *np; |
struct pnode *nc; |
struct pattr *ap; |
struct pattr *a; |
int isop, sv; |
int bar, isop, isrep, was_impl; |
|
|
isop = 1; |
isop = 1; |
TAILQ_FOREACH(ap, &pn->attrq, child) |
isrep = was_impl = 0; |
if (ap->key == ATTRKEY_CHOICE && |
TAILQ_FOREACH(a, &n->attrq, child) { |
(ap->val == ATTRVAL_PLAIN || ap->val == ATTRVAL_REQ)) { |
if (a->key == ATTRKEY_CHOICE && |
|
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
isop = 0; |
isop = 0; |
break; |
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
|
isrep = 1; |
|
} |
|
if (isop) { |
|
if (f->flags & FMT_IMPL) { |
|
was_impl = 1; |
|
macro_open(f, "Oo"); |
|
} else { |
|
macro_open(f, "Op"); |
|
f->flags |= FMT_IMPL; |
} |
} |
|
} else if (isrep) { |
/* |
if (f->flags & FMT_IMPL) { |
* Make sure we're on a macro line. |
was_impl = 1; |
* This will prevent pnode_print() for putting us on a |
macro_open(f, "Bro"); |
* subsequent line. |
} else { |
*/ |
macro_open(f, "Brq"); |
sv = p->linestate == LINE_NEW; |
f->flags |= FMT_IMPL; |
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) |
bar = 0; |
macro_close(p); |
TAILQ_FOREACH(nc, &n->childq, child) { |
pnode_unlinksub(pn); |
if (bar && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "|", ARG_SPACE); |
|
pnode_print(f, nc); |
|
bar = 1; |
|
} |
|
if (isop) { |
|
if (was_impl) |
|
macro_open(f, "Oc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} else if (isrep) { |
|
if (was_impl) |
|
macro_open(f, "Brc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} |
|
if (isrep && f->linestate == LINE_MACRO) |
|
macro_addarg(f, "...", ARG_SPACE); |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
|
pnode_printsystemitem(struct format *f, struct pnode *n) |
|
{ |
|
switch (pnode_getattr(n, ATTRKEY_CLASS)) { |
|
case ATTRVAL_IPADDRESS: |
|
break; |
|
case ATTRVAL_SYSTEMNAME: |
|
macro_open(f, "Pa"); |
|
break; |
|
case ATTRVAL_EVENT: |
|
default: |
|
macro_open(f, "Sy"); |
|
break; |
|
} |
|
} |
|
|
|
static void |
pnode_printauthor(struct format *f, struct pnode *n) |
pnode_printauthor(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *nc, *ncn; |
struct pnode *nc, *nn; |
int have_contrib, have_name; |
int have_contrib, have_name; |
|
|
/* |
/* |
Line 474 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 568 pnode_printauthor(struct format *f, struct pnode *n) |
|
*/ |
*/ |
|
|
have_contrib = have_name = 0; |
have_contrib = have_name = 0; |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, ncn) { |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
switch (nc->node) { |
switch (nc->node) { |
case NODE_CONTRIB: |
case NODE_CONTRIB: |
if (have_contrib) |
if (have_contrib) |
Line 503 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 597 pnode_printauthor(struct format *f, struct pnode *n) |
|
*/ |
*/ |
|
|
macro_open(f, "An"); |
macro_open(f, "An"); |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, ncn) { |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
if (nc->node == NODE_PERSONNAME || have_name == 0) { |
if (nc->node == NODE_PERSONNAME || have_name == 0) { |
macro_addnode(f, nc, ARG_SPACE); |
macro_addnode(f, nc, ARG_SPACE); |
pnode_unlink(nc); |
pnode_unlink(nc); |
Line 516 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 610 pnode_printauthor(struct format *f, struct pnode *n) |
|
*/ |
*/ |
|
|
if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) { |
if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) { |
pnode_print(f, nc); |
f->flags |= FMT_CHILD; |
|
macro_open(f, "Aq Mt"); |
|
macro_addnode(f, nc, ARG_SPACE); |
pnode_unlink(nc); |
pnode_unlink(nc); |
} |
} |
|
|
Line 533 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 629 pnode_printauthor(struct format *f, struct pnode *n) |
|
} |
} |
|
|
static void |
static void |
|
pnode_printxref(struct format *f, struct pnode *n) |
|
{ |
|
const char *linkend; |
|
|
|
linkend = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL); |
|
if (linkend != NULL) { |
|
macro_open(f, "Sx"); |
|
macro_addarg(f, linkend, ARG_SPACE); |
|
} |
|
} |
|
|
|
static void |
pnode_printlink(struct format *f, struct pnode *n) |
pnode_printlink(struct format *f, struct pnode *n) |
{ |
{ |
|
struct pnode *nc; |
const char *uri, *text; |
const char *uri, *text; |
|
|
uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL); |
uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL); |
if (uri != NULL) { |
if (uri != NULL) { |
if (TAILQ_FIRST(&n->childq) != NULL) { |
if (TAILQ_FIRST(&n->childq) != NULL) { |
print_textnode(f, n); |
TAILQ_FOREACH(nc, &n->childq, child) |
|
pnode_print(f, nc); |
text = ""; |
text = ""; |
} else { |
} else if ((text = pnode_getattr_raw(n, |
text = pnode_getattr_raw(n, ATTRKEY_ENDTERM, NULL); |
ATTRKEY_ENDTERM, NULL)) != NULL) { |
if (text != NULL) |
if (f->linestate == LINE_MACRO && f->flags & FMT_ARG) |
|
macro_addarg(f, text, ARG_SPACE); |
|
else |
print_text(f, text, ARG_SPACE); |
print_text(f, text, ARG_SPACE); |
} |
} |
if (text != NULL) |
if (text != NULL) { |
macro_open(f, "Pq"); |
if (f->flags & FMT_IMPL) |
|
macro_open(f, "Po"); |
|
else { |
|
macro_open(f, "Pq"); |
|
f->flags |= FMT_CHILD; |
|
} |
|
} |
macro_open(f, "Sx"); |
macro_open(f, "Sx"); |
macro_addarg(f, uri, ARG_SPACE); |
macro_addarg(f, uri, ARG_SPACE); |
|
if (text != NULL && f->flags & FMT_IMPL) |
|
macro_open(f, "Pc"); |
pnode_unlinksub(n); |
pnode_unlinksub(n); |
return; |
return; |
} |
} |
Line 563 pnode_printlink(struct format *f, struct pnode *n) |
|
Line 683 pnode_printlink(struct format *f, struct pnode *n) |
|
if (TAILQ_FIRST(&n->childq) != NULL) |
if (TAILQ_FIRST(&n->childq) != NULL) |
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
pnode_unlinksub(n); |
pnode_unlinksub(n); |
|
} |
|
} |
|
|
|
static void |
|
pnode_printolink(struct format *f, struct pnode *n) |
|
{ |
|
const char *uri, *ptr, *local; |
|
|
|
uri = pnode_getattr_raw(n, ATTRKEY_TARGETDOC, NULL); |
|
ptr = pnode_getattr_raw(n, ATTRKEY_TARGETPTR, NULL); |
|
local = pnode_getattr_raw(n, ATTRKEY_LOCALINFO, NULL); |
|
if (uri == NULL) { |
|
uri = ptr; |
|
ptr = NULL; |
|
} |
|
if (uri == NULL) { |
|
uri = local; |
|
local = NULL; |
|
} |
|
if (uri == NULL) |
return; |
return; |
|
|
|
macro_open(f, "Lk"); |
|
macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE); |
|
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
|
if (ptr != NULL || local != NULL) { |
|
macro_close(f); |
|
macro_open(f, "Pq"); |
|
if (ptr != NULL) |
|
macro_addarg(f, ptr, ARG_SPACE); |
|
if (local != NULL) |
|
macro_addarg(f, local, ARG_SPACE); |
} |
} |
|
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printprologue(struct format *p, struct ptree *tree) |
pnode_printprologue(struct format *f, struct pnode *root) |
{ |
{ |
struct pnode *refmeta; |
struct pnode *date, *refmeta, *name, *vol, *descr, *nc, *nn; |
|
const char *sname; |
|
|
refmeta = tree->root == NULL ? NULL : |
/* Collect information. */ |
pnode_findfirst(tree->root, NODE_REFMETA); |
|
|
|
macro_line(p, "Dd $Mdocdate" "$"); |
if ((date = pnode_takefirst(root, NODE_PUBDATE)) == NULL) |
if (refmeta == NULL) { |
date = pnode_takefirst(root, NODE_DATE); |
macro_open(p, "Dt"); |
|
macro_addarg(p, |
name = vol = NULL; |
pnode_getattr_raw(tree->root, ATTRKEY_ID, "UNKNOWN"), |
if ((refmeta = pnode_findfirst(root, NODE_REFMETA)) != NULL) { |
ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
TAILQ_FOREACH_SAFE(nc, &refmeta->childq, child, nn) { |
macro_addarg(p, "1", ARG_SPACE); |
switch (nc->node) { |
macro_close(p); |
case NODE_REFENTRYTITLE: |
|
name = nc; |
|
break; |
|
case NODE_MANVOLNUM: |
|
vol = nc; |
|
break; |
|
default: |
|
continue; |
|
} |
|
TAILQ_REMOVE(&refmeta->childq, nc, child); |
|
} |
|
} |
|
|
|
if (pnode_findfirst(root, NODE_REFNAMEDIV) == NULL && |
|
((nc = pnode_findfirst(root, NODE_BOOKINFO)) != NULL || |
|
(nc = pnode_findfirst(root, NODE_REFENTRYINFO)) != NULL)) |
|
descr = pnode_takefirst(nc, NODE_TITLE); |
|
else |
|
descr = NULL; |
|
|
|
/* Print prologue. */ |
|
|
|
if (date == NULL) |
|
macro_line(f, "Dd $Mdocdate" "$"); |
|
else |
|
macro_nodeline(f, "Dd", date, 0); |
|
|
|
macro_open(f, "Dt"); |
|
if (name == NULL) { |
|
sname = pnode_getattr_raw(root, ATTRKEY_ID, "UNKNOWN"); |
|
macro_addarg(f, sname, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
} else |
} else |
pnode_printrefmeta(p, refmeta); |
macro_addnode(f, name, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
macro_line(p, "Os"); |
if (vol == NULL) |
|
macro_addarg(f, "1", ARG_SPACE); |
|
else |
|
macro_addnode(f, vol, ARG_SPACE | ARG_SINGLE); |
|
|
if (tree->flags & TREE_EQN) { |
macro_line(f, "Os"); |
macro_line(p, "EQ"); |
|
print_text(p, "delim $$", 0); |
if (descr != NULL) { |
macro_line(p, "EN"); |
macro_line(f, "Sh NAME"); |
|
if (name == NULL) |
|
macro_argline(f, "Nm", sname); |
|
else |
|
macro_nodeline(f, "Nm", name, ARG_SINGLE); |
|
macro_nodeline(f, "Nd", descr, 0); |
} |
} |
|
|
|
/* Clean up. */ |
|
|
|
pnode_unlink(date); |
|
pnode_unlink(name); |
|
pnode_unlink(vol); |
|
pnode_unlink(descr); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
|
static void |
|
pnode_printrefentry(struct format *f, struct pnode *n) |
|
{ |
|
struct pnode *info, *meta, *nc, *title; |
|
struct pnode *match, *later; |
|
|
|
/* Collect nodes that remained behind when writing the prologue. */ |
|
|
|
meta = NULL; |
|
info = pnode_takefirst(n, NODE_BOOKINFO); |
|
if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) { |
|
pnode_unlink(info); |
|
info = NULL; |
|
} |
|
if (info == NULL) { |
|
info = pnode_takefirst(n, NODE_REFENTRYINFO); |
|
if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) { |
|
pnode_unlink(info); |
|
info = NULL; |
|
} |
|
if (info == NULL) |
|
info = pnode_takefirst(n, NODE_INFO); |
|
meta = pnode_takefirst(n, NODE_REFMETA); |
|
if (meta != NULL && TAILQ_FIRST(&meta->childq) == NULL) { |
|
pnode_unlink(meta); |
|
meta = NULL; |
|
} |
|
} |
|
if (info == NULL && meta == NULL) |
|
return; |
|
|
|
/* |
|
* Find the best place to put this information. |
|
* Use the last existing AUTHORS node, if any. |
|
* Otherwise, put it behind all standard sections that |
|
* conventionally precede AUTHORS, and also behind any |
|
* non-standard sections that follow the last of these, |
|
* but before the next standard section. |
|
*/ |
|
|
|
match = later = NULL; |
|
TAILQ_FOREACH(nc, &n->childq, child) { |
|
switch (nc->node) { |
|
case NODE_REFENTRY: |
|
case NODE_REFNAMEDIV: |
|
case NODE_REFSYNOPSISDIV: |
|
case NODE_PREFACE: |
|
later = NULL; |
|
continue; |
|
case NODE_APPENDIX: |
|
case NODE_INDEX: |
|
if (later == NULL) |
|
later = nc; |
|
continue; |
|
default: |
|
break; |
|
} |
|
if ((title = pnode_findfirst(nc, NODE_TITLE)) == NULL || |
|
(title = TAILQ_FIRST(&title->childq)) == NULL || |
|
title->node != NODE_TEXT) |
|
continue; |
|
if (strcasecmp(title->b, "AUTHORS") == 0 || |
|
strcasecmp(title->b, "AUTHOR") == 0) |
|
match = nc; |
|
else if (strcasecmp(title->b, "NAME") == 0 || |
|
strcasecmp(title->b, "SYNOPSIS") == 0 || |
|
strcasecmp(title->b, "DESCRIPTION") == 0 || |
|
strcasecmp(title->b, "RETURN VALUES") == 0 || |
|
strcasecmp(title->b, "ENVIRONMENT") == 0 || |
|
strcasecmp(title->b, "FILES") == 0 || |
|
strcasecmp(title->b, "EXIT STATUS") == 0 || |
|
strcasecmp(title->b, "EXAMPLES") == 0 || |
|
strcasecmp(title->b, "DIAGNOSTICS") == 0 || |
|
strcasecmp(title->b, "ERRORS") == 0 || |
|
strcasecmp(title->b, "SEE ALSO") == 0 || |
|
strcasecmp(title->b, "STANDARDS") == 0 || |
|
strcasecmp(title->b, "HISTORY") == 0) |
|
later = NULL; |
|
else if ((strcasecmp(title->b, "CAVEATS") == 0 || |
|
strcasecmp(title->b, "BUGS") == 0) && |
|
later == NULL) |
|
later = nc; |
|
} |
|
|
|
/* |
|
* If no AUTHORS section was found, create one from scratch, |
|
* and insert that at the place selected earlier. |
|
*/ |
|
|
|
if (match == NULL) { |
|
if ((match = calloc(1, sizeof(*match))) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
match->node = NODE_SECTION; |
|
match->spc = 1; |
|
match->parent = n; |
|
TAILQ_INIT(&match->childq); |
|
TAILQ_INIT(&match->attrq); |
|
if ((nc = pnode_alloc(match)) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
nc->node = NODE_TITLE; |
|
nc->spc = 1; |
|
if ((nc = pnode_alloc(nc)) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
nc->node = NODE_TEXT; |
|
if ((nc->b = strdup("AUTHORS")) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
nc->spc = 1; |
|
if (later == NULL) |
|
TAILQ_INSERT_TAIL(&n->childq, match, child); |
|
else |
|
TAILQ_INSERT_BEFORE(later, match, child); |
|
} |
|
|
|
/* |
|
* Dump the stuff excised at the beginning |
|
* into this AUTHORS section. |
|
*/ |
|
|
|
if (info != NULL) |
|
TAILQ_INSERT_TAIL(&match->childq, info, child); |
|
if (meta != NULL) |
|
TAILQ_INSERT_TAIL(&match->childq, meta, child); |
|
} |
|
|
/* |
/* |
* We can have multiple <term> elements within a <varlistentry>, which |
* We can have multiple <term> elements within a <varlistentry>, which |
* we should comma-separate as list headers. |
* we should comma-separate as list headers. |
*/ |
*/ |
static void |
static void |
pnode_printvarlistentry(struct format *p, struct pnode *pn) |
pnode_printvarlistentry(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn, *ncc; |
int first = 1; |
int comma; |
|
|
macro_close(p); |
macro_open(f, "It"); |
macro_open(p, "It"); |
f->parastate = PARA_HAVE; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
f->flags |= FMT_IMPL; |
if (pp->node != NODE_TERM && pp->node != NODE_GLOSSTERM) |
comma = -1; |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
|
if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM) |
continue; |
continue; |
if ( ! first) |
if (comma != -1) { |
macro_addarg(p, ",", 0); |
switch (f->linestate) { |
pnode_print(p, pp); |
case LINE_NEW: |
first = 0; |
break; |
|
case LINE_TEXT: |
|
print_text(f, ",", 0); |
|
break; |
|
case LINE_MACRO: |
|
macro_addarg(f, ",", comma); |
|
break; |
|
} |
|
} |
|
f->parastate = PARA_HAVE; |
|
comma = (ncc = TAILQ_FIRST(&nc->childq)) == NULL || |
|
pnode_class(ncc->node) == CLASS_TEXT ? 0 : ARG_SPACE; |
|
pnode_print(f, nc); |
|
pnode_unlink(nc); |
} |
} |
macro_close(p); |
macro_close(f); |
TAILQ_FOREACH(pp, &pn->childq, child) |
f->parastate = PARA_HAVE; |
if (pp->node != NODE_TERM && pp->node != NODE_GLOSSTERM) |
while ((nc = TAILQ_FIRST(&n->childq)) != NULL) { |
pnode_print(p, pp); |
pnode_print(f, nc); |
pnode_unlinksub(pn); |
pnode_unlink(nc); |
|
} |
|
macro_close(f); |
|
f->parastate = PARA_HAVE; |
} |
} |
|
|
static void |
static void |
pnode_printtitle(struct format *p, struct pnode *pn) |
pnode_printtitle(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp, *pq; |
struct pnode *nc, *nn; |
|
|
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) { |
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
if (pp->node == NODE_TITLE) { |
if (nc->node == NODE_TITLE) { |
pnode_printpara(p, pp); |
if (f->parastate == PARA_MID) |
pnode_print(p, pp); |
f->parastate = PARA_WANT; |
pnode_unlink(pp); |
macro_nodeline(f, "Sy", nc, 0); |
|
pnode_unlink(nc); |
} |
} |
} |
} |
} |
} |
|
|
static void |
static void |
pnode_printrow(struct format *p, struct pnode *pn) |
pnode_printrow(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
macro_line(p, "Bl -dash -compact"); |
macro_line(f, "Bl -dash -compact"); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(nc, &n->childq, child) { |
macro_line(p, "It"); |
macro_line(f, "It"); |
pnode_print(p, pp); |
pnode_print(f, nc); |
} |
} |
macro_line(p, "El"); |
macro_line(f, "El"); |
pnode_unlink(pn); |
pnode_unlink(n); |
} |
} |
|
|
static void |
static void |
Line 657 pnode_printtgroup1(struct format *f, struct pnode *n) |
|
Line 1006 pnode_printtgroup1(struct format *f, struct pnode *n) |
|
macro_line(f, "Bl -bullet -compact"); |
macro_line(f, "Bl -bullet -compact"); |
while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) { |
while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) { |
macro_line(f, "It"); |
macro_line(f, "It"); |
|
f->parastate = PARA_HAVE; |
pnode_print(f, nc); |
pnode_print(f, nc); |
|
f->parastate = PARA_HAVE; |
pnode_unlink(nc); |
pnode_unlink(nc); |
} |
} |
macro_line(f, "El"); |
macro_line(f, "El"); |
Line 669 pnode_printtgroup2(struct format *f, struct pnode *n) |
|
Line 1020 pnode_printtgroup2(struct format *f, struct pnode *n) |
|
{ |
{ |
struct pnode *nr, *ne; |
struct pnode *nr, *ne; |
|
|
|
f->parastate = PARA_HAVE; |
macro_line(f, "Bl -tag -width Ds"); |
macro_line(f, "Bl -tag -width Ds"); |
while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) { |
while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) { |
if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL) |
if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL) |
break; |
break; |
macro_close(f); |
|
macro_open(f, "It"); |
macro_open(f, "It"); |
|
f->flags |= FMT_IMPL; |
|
f->parastate = PARA_HAVE; |
pnode_print(f, ne); |
pnode_print(f, ne); |
macro_close(f); |
macro_close(f); |
pnode_unlink(ne); |
pnode_unlink(ne); |
|
f->parastate = PARA_HAVE; |
pnode_print(f, nr); |
pnode_print(f, nr); |
|
f->parastate = PARA_HAVE; |
pnode_unlink(nr); |
pnode_unlink(nr); |
} |
} |
macro_line(f, "El"); |
macro_line(f, "El"); |
Line 701 pnode_printtgroup(struct format *f, struct pnode *n) |
|
Line 1056 pnode_printtgroup(struct format *f, struct pnode *n) |
|
break; |
break; |
} |
} |
|
|
|
f->parastate = PARA_HAVE; |
macro_line(f, "Bl -ohang"); |
macro_line(f, "Bl -ohang"); |
while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) { |
while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) { |
macro_line(f, "It Table Row"); |
macro_line(f, "It Table Row"); |
Line 711 pnode_printtgroup(struct format *f, struct pnode *n) |
|
Line 1067 pnode_printtgroup(struct format *f, struct pnode *n) |
|
} |
} |
|
|
static void |
static void |
pnode_printlist(struct format *p, struct pnode *pn) |
pnode_printlist(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
pnode_printtitle(p, pn); |
pnode_printtitle(f, n); |
macro_argline(p, "Bl", |
f->parastate = PARA_HAVE; |
pn->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
macro_argline(f, "Bl", |
TAILQ_FOREACH(pp, &pn->childq, child) { |
n->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
macro_line(p, "It"); |
TAILQ_FOREACH(nc, &n->childq, child) { |
pnode_print(p, pp); |
macro_line(f, "It"); |
|
f->parastate = PARA_HAVE; |
|
pnode_print(f, nc); |
|
f->parastate = PARA_HAVE; |
} |
} |
macro_line(p, "El"); |
macro_line(f, "El"); |
pnode_unlinksub(pn); |
pnode_unlinksub(n); |
} |
} |
|
|
static void |
static void |
pnode_printvariablelist(struct format *p, struct pnode *pn) |
pnode_printvariablelist(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc; |
|
|
pnode_printtitle(p, pn); |
pnode_printtitle(f, n); |
macro_line(p, "Bl -tag -width Ds"); |
f->parastate = PARA_HAVE; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
macro_line(f, "Bl -tag -width Ds"); |
if (pp->node == NODE_VARLISTENTRY) |
TAILQ_FOREACH(nc, &n->childq, child) { |
pnode_printvarlistentry(p, pp); |
if (nc->node == NODE_VARLISTENTRY) |
|
pnode_printvarlistentry(f, nc); |
else |
else |
macro_nodeline(p, "It", pp, 0); |
macro_nodeline(f, "It", nc, 0); |
} |
} |
macro_line(p, "El"); |
macro_line(f, "El"); |
pnode_unlinksub(pn); |
pnode_unlinksub(n); |
} |
} |
|
|
/* |
/* |
Line 750 pnode_printvariablelist(struct format *p, struct pnode |
|
Line 1110 pnode_printvariablelist(struct format *p, struct pnode |
|
* whatever), don't print inline macros. |
* whatever), don't print inline macros. |
*/ |
*/ |
static void |
static void |
pnode_print(struct format *p, struct pnode *pn) |
pnode_print(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn; |
enum linestate sv; |
int was_impl; |
|
|
if (pn == NULL) |
if (n == NULL) |
return; |
return; |
|
|
p->spc = pn->spc; |
was_impl = f->flags & FMT_IMPL; |
sv = p->linestate; |
if (n->spc) |
|
f->flags &= ~FMT_NOSPC; |
|
else |
|
f->flags |= FMT_NOSPC; |
|
|
switch (pn->node) { |
switch (n->node) { |
case NODE_APPLICATION: |
|
macro_open(p, "Nm"); |
|
break; |
|
case NODE_ARG: |
case NODE_ARG: |
pnode_printarg(p, pn); |
pnode_printarg(f, n); |
break; |
break; |
case NODE_AUTHOR: |
case NODE_AUTHOR: |
pnode_printauthor(p, pn); |
pnode_printauthor(f, n); |
break; |
break; |
case NODE_AUTHORGROUP: |
case NODE_AUTHORGROUP: |
macro_line(p, "An -split"); |
macro_line(f, "An -split"); |
break; |
break; |
case NODE_BLOCKQUOTE: |
case NODE_BLOCKQUOTE: |
macro_line(p, "Bd -ragged -offset indent"); |
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bd -ragged -offset indent"); |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case NODE_BOOKINFO: |
|
macro_line(p, "Sh NAME"); |
|
break; |
|
case NODE_CITEREFENTRY: |
case NODE_CITEREFENTRY: |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(f, n); |
break; |
break; |
case NODE_CITETITLE: |
case NODE_CITETITLE: |
macro_open(p, "%T"); |
macro_open(f, "%T"); |
break; |
break; |
case NODE_COMMAND: |
case NODE_COMMAND: |
macro_open(p, "Nm"); |
macro_open(f, "Nm"); |
break; |
break; |
case NODE_CONSTANT: |
case NODE_CONSTANT: |
macro_open(p, "Dv"); |
macro_open(f, "Dv"); |
break; |
break; |
|
case NODE_COPYRIGHT: |
|
print_text(f, "Copyright", ARG_SPACE); |
|
fputs(" \\(co", stdout); |
|
break; |
case NODE_EDITOR: |
case NODE_EDITOR: |
print_text(p, "editor:", ARG_SPACE); |
print_text(f, "editor:", ARG_SPACE); |
sv = LINE_TEXT; |
pnode_printauthor(f, n); |
macro_open(p, "An"); |
|
break; |
break; |
case NODE_EMAIL: |
case NODE_EMAIL: |
macro_open(p, "Aq Mt"); |
if (was_impl) |
|
macro_open(f, "Ao Mt"); |
|
else { |
|
macro_open(f, "Aq Mt"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case NODE_EMPHASIS: |
case NODE_EMPHASIS: |
case NODE_FIRSTTERM: |
case NODE_FIRSTTERM: |
case NODE_GLOSSTERM: |
case NODE_GLOSSTERM: |
macro_open(p, "Em"); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
|
pnode_class(nc->node) < CLASS_LINE) |
|
macro_open(f, "Em"); |
|
if (n->node == NODE_GLOSSTERM) |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case NODE_ENVAR: |
case NODE_ENVAR: |
macro_open(p, "Ev"); |
macro_open(f, "Ev"); |
break; |
break; |
case NODE_ERRORNAME: |
case NODE_ERRORNAME: |
macro_open(p, "Er"); |
macro_open(f, "Er"); |
break; |
break; |
case NODE_FILENAME: |
case NODE_FILENAME: |
macro_open(p, "Pa"); |
macro_open(f, "Pa"); |
break; |
break; |
|
case NODE_FOOTNOTE: |
|
macro_line(f, "Bo"); |
|
f->parastate = PARA_HAVE; |
|
break; |
case NODE_FUNCTION: |
case NODE_FUNCTION: |
macro_open(p, "Fn"); |
macro_open(f, "Fn"); |
break; |
break; |
case NODE_FUNCPROTOTYPE: |
case NODE_FUNCPROTOTYPE: |
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(f, n); |
break; |
break; |
case NODE_FUNCSYNOPSISINFO: |
case NODE_FUNCSYNOPSISINFO: |
macro_open(p, "Fd"); |
macro_open(f, "Fd"); |
break; |
break; |
case NODE_INFORMALEQUATION: |
case NODE_IMAGEDATA: |
macro_line(p, "EQ"); |
pnode_printimagedata(f, n); |
break; |
break; |
|
case NODE_INFORMALEQUATION: |
|
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bd -ragged -offset indent"); |
|
f->parastate = PARA_HAVE; |
|
/* FALLTHROUGH */ |
case NODE_INLINEEQUATION: |
case NODE_INLINEEQUATION: |
if (p->linestate == LINE_NEW) |
macro_line(f, "EQ"); |
p->linestate = LINE_TEXT; |
|
putchar('$'); |
|
break; |
break; |
case NODE_ITEMIZEDLIST: |
case NODE_ITEMIZEDLIST: |
pnode_printlist(p, pn); |
pnode_printlist(f, n); |
break; |
break; |
case NODE_GROUP: |
case NODE_GROUP: |
pnode_printgroup(p, pn); |
pnode_printgroup(f, n); |
break; |
break; |
case NODE_KEYSYM: |
case NODE_KEYSYM: |
macro_open(p, "Sy"); |
case NODE_PRODUCTNAME: |
|
macro_open(f, "Sy"); |
break; |
break; |
case NODE_LINK: |
case NODE_LINK: |
pnode_printlink(p, pn); |
pnode_printlink(f, n); |
break; |
break; |
case NODE_LITERAL: |
case NODE_LITERAL: |
macro_open(p, "Ql"); |
if (n->parent != NULL && n->parent->node == NODE_QUOTE) |
|
macro_open(f, "Li"); |
|
else if (was_impl) |
|
macro_open(f, "So Li"); |
|
else { |
|
macro_open(f, "Ql"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case NODE_LITERALLAYOUT: |
case NODE_LITERALLAYOUT: |
macro_close(p); |
macro_close(f); |
macro_argline(p, "Bd", pnode_getattr(pn, ATTRKEY_CLASS) == |
f->parastate = PARA_HAVE; |
|
macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) == |
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
|
f->parastate = PARA_HAVE; |
break; |
break; |
|
case NODE_MARKUP: |
|
macro_open(f, "Ic"); |
|
break; |
case NODE_MML_MFENCED: |
case NODE_MML_MFENCED: |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(f, n); |
break; |
break; |
case NODE_MML_MROW: |
case NODE_MML_MROW: |
case NODE_MML_MI: |
case NODE_MML_MI: |
case NODE_MML_MN: |
case NODE_MML_MN: |
case NODE_MML_MO: |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&n->childq)) |
break; |
break; |
fputs(" { ", stdout); |
fputs(" { ", stdout); |
break; |
break; |
case NODE_MML_MFRAC: |
case NODE_MML_MFRAC: |
case NODE_MML_MSUB: |
case NODE_MML_MSUB: |
case NODE_MML_MSUP: |
case NODE_MML_MSUP: |
pnode_printmath(p, pn); |
pnode_printmath(f, n); |
break; |
break; |
|
case NODE_OLINK: |
|
pnode_printolink(f, n); |
|
break; |
case NODE_OPTION: |
case NODE_OPTION: |
macro_open(p, "Fl"); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
|
pnode_class(nc->node) < CLASS_LINE) |
|
macro_open(f, "Fl"); |
break; |
break; |
case NODE_ORDEREDLIST: |
case NODE_ORDEREDLIST: |
pnode_printlist(p, pn); |
pnode_printlist(f, n); |
break; |
break; |
case NODE_PARA: |
case NODE_PARA: |
pnode_printpara(p, pn); |
if (f->parastate == PARA_MID) |
|
f->parastate = PARA_WANT; |
break; |
break; |
case NODE_PARAMDEF: |
case NODE_PARAMDEF: |
case NODE_PARAMETER: |
case NODE_PARAMETER: |
macro_nodeline(p, "Fa", pn, ARG_SINGLE); |
/* More often, these appear inside NODE_FUNCPROTOTYPE. */ |
pnode_unlinksub(pn); |
macro_open(f, "Fa"); |
|
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(n); |
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
macro_open(p, "Qo"); |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
|
nc->node == NODE_FILENAME && |
|
TAILQ_NEXT(nc, child) == NULL) { |
|
if (n->spc) |
|
nc->spc = 1; |
|
} else if (was_impl) |
|
macro_open(f, "Do"); |
|
else { |
|
macro_open(f, "Dq"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case NODE_PROGRAMLISTING: |
case NODE_PROGRAMLISTING: |
case NODE_SCREEN: |
case NODE_SCREEN: |
case NODE_SYNOPSIS: |
case NODE_SYNOPSIS: |
macro_line(p, "Bd -literal"); |
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bd -literal"); |
|
f->parastate = PARA_HAVE; |
break; |
break; |
case NODE_REFENTRYINFO: |
case NODE_SYSTEMITEM: |
/* Suppress. */ |
pnode_printsystemitem(f, n); |
pnode_unlinksub(pn); |
|
break; |
break; |
|
case NODE_REFENTRY: |
|
pnode_printrefentry(f, n); |
|
break; |
case NODE_REFNAME: |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* More often, these appear inside NODE_REFNAMEDIV. */ |
macro_open(p, "Nm"); |
macro_open(f, "Nm"); |
macro_addnode(p, pn, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_REFNAMEDIV: |
case NODE_REFNAMEDIV: |
macro_line(p, "Sh NAME"); |
pnode_printrefnamediv(f, n); |
break; |
break; |
case NODE_REFPURPOSE: |
case NODE_REFPURPOSE: |
macro_open(p, "Nd"); |
macro_open(f, "Nd"); |
break; |
break; |
case NODE_REFSYNOPSISDIV: |
case NODE_REFSYNOPSISDIV: |
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(f, n); |
break; |
break; |
case NODE_PREFACE: |
case NODE_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
|
case NODE_SIMPLESECT: |
case NODE_APPENDIX: |
case NODE_APPENDIX: |
case NODE_LEGALNOTICE: |
case NODE_LEGALNOTICE: |
case NODE_NOTE: |
case NODE_NOTE: |
case NODE_TIP: |
case NODE_TIP: |
case NODE_CAUTION: |
case NODE_CAUTION: |
case NODE_WARNING: |
case NODE_WARNING: |
pnode_printrefsect(p, pn); |
pnode_printsection(f, n); |
break; |
break; |
case NODE_REPLACEABLE: |
case NODE_REPLACEABLE: |
macro_open(p, "Ar"); |
macro_open(f, "Ar"); |
break; |
break; |
case NODE_SBR: |
case NODE_SBR: |
macro_line(p, "br"); |
if (f->parastate == PARA_MID) |
|
macro_line(f, "br"); |
break; |
break; |
case NODE_SGMLTAG: |
case NODE_SUBSCRIPT: |
macro_open(p, "Ic"); |
if (f->linestate == LINE_MACRO) |
|
macro_addarg(f, "_", 0); |
|
else |
|
print_text(f, "_", 0); |
|
if ((nc = TAILQ_FIRST(&n->childq)) != NULL) |
|
nc->spc = 0; |
break; |
break; |
|
case NODE_SUPERSCRIPT: |
|
fputs("\\(ha", stdout); |
|
if ((nc = TAILQ_FIRST(&n->childq)) != NULL) |
|
nc->spc = 0; |
|
break; |
case NODE_TEXT: |
case NODE_TEXT: |
case NODE_ESCAPE: |
case NODE_ESCAPE: |
pnode_printtext(p, pn); |
pnode_printtext(f, n); |
break; |
break; |
case NODE_TGROUP: |
case NODE_TGROUP: |
pnode_printtgroup(p, pn); |
pnode_printtgroup(f, n); |
break; |
break; |
case NODE_TITLE: |
case NODE_TITLE: |
if (pn->parent != NULL && |
case NODE_SUBTITLE: |
pn->parent->node == NODE_BOOKINFO) { |
if (f->parastate == PARA_MID) |
macro_open(p, "Nd"); |
f->parastate = PARA_WANT; |
break; |
macro_nodeline(f, "Sy", n, 0); |
} |
pnode_unlinksub(n); |
pnode_printpara(p, pn); |
|
macro_nodeline(p, "Sy", pn, 0); |
|
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_TYPE: |
case NODE_TYPE: |
macro_open(p, "Vt"); |
macro_open(f, "Vt"); |
break; |
break; |
case NODE_VARIABLELIST: |
case NODE_VARIABLELIST: |
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(f, n); |
break; |
break; |
case NODE_VARNAME: |
case NODE_VARNAME: |
macro_open(p, "Va"); |
macro_open(f, "Va"); |
break; |
break; |
|
case NODE_VOID: |
|
print_text(f, "void", ARG_SPACE); |
|
break; |
|
case NODE_XREF: |
|
pnode_printxref(f, n); |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(nc, &n->childq, child) |
pnode_print(p, pp); |
pnode_print(f, nc); |
|
|
switch (pn->node) { |
switch (n->node) { |
|
case NODE_EMAIL: |
|
if (was_impl) { |
|
f->flags &= ~FMT_NOSPC; |
|
macro_open(f, "Ac"); |
|
} else |
|
f->flags &= ~FMT_IMPL; |
|
break; |
|
case NODE_ESCAPE: |
|
case NODE_TERM: |
|
case NODE_TEXT: |
|
/* Accept more arguments to the previous macro. */ |
|
return; |
|
case NODE_FOOTNOTE: |
|
f->parastate = PARA_HAVE; |
|
macro_line(f, "Bc"); |
|
break; |
|
case NODE_GLOSSTERM: |
|
f->parastate = PARA_HAVE; |
|
break; |
case NODE_INFORMALEQUATION: |
case NODE_INFORMALEQUATION: |
macro_line(p, "EN"); |
macro_line(f, "EN"); |
|
macro_line(f, "Ed"); |
break; |
break; |
case NODE_INLINEEQUATION: |
case NODE_INLINEEQUATION: |
fputs("$ ", stdout); |
macro_line(f, "EN"); |
p->linestate = sv; |
|
break; |
break; |
|
case NODE_LITERAL: |
|
if (n->parent != NULL && n->parent->node == NODE_QUOTE) |
|
/* nothing */; |
|
else if (was_impl) { |
|
f->flags &= ~FMT_NOSPC; |
|
macro_open(f, "Sc"); |
|
} else |
|
f->flags &= ~FMT_IMPL; |
|
break; |
case NODE_MEMBER: |
case NODE_MEMBER: |
if ((pp = TAILQ_NEXT(pn, child)) != NULL && |
if ((nn = TAILQ_NEXT(n, child)) != NULL && |
pp->node != NODE_MEMBER) |
nn->node != NODE_MEMBER) |
pp = NULL; |
nn = NULL; |
switch (p->linestate) { |
switch (f->linestate) { |
case LINE_TEXT: |
case LINE_TEXT: |
if (pp != NULL) |
if (nn != NULL) |
print_text(p, ",", 0); |
print_text(f, ",", 0); |
break; |
break; |
case LINE_MACRO: |
case LINE_MACRO: |
if (pp != NULL) |
if (nn != NULL) |
macro_addarg(p, ",", ARG_SPACE); |
macro_addarg(f, ",", ARG_SPACE); |
macro_close(p); |
macro_close(f); |
break; |
break; |
case LINE_NEW: |
case LINE_NEW: |
break; |
break; |
Line 990 pnode_print(struct format *p, struct pnode *pn) |
|
Line 1444 pnode_print(struct format *p, struct pnode *pn) |
|
case NODE_MML_MI: |
case NODE_MML_MI: |
case NODE_MML_MN: |
case NODE_MML_MN: |
case NODE_MML_MO: |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&n->childq)) |
break; |
break; |
fputs(" } ", stdout); |
fputs(" } ", stdout); |
break; |
break; |
case NODE_APPLICATION: |
case NODE_PARA: |
case NODE_ARG: |
if (f->parastate == PARA_MID) |
case NODE_AUTHOR: |
f->parastate = PARA_WANT; |
case NODE_CITEREFENTRY: |
|
case NODE_CITETITLE: |
|
case NODE_COMMAND: |
|
case NODE_CONSTANT: |
|
case NODE_EDITOR: |
|
case NODE_EMAIL: |
|
case NODE_EMPHASIS: |
|
case NODE_ENVAR: |
|
case NODE_ERRORNAME: |
|
case NODE_FILENAME: |
|
case NODE_FIRSTTERM: |
|
case NODE_FUNCTION: |
|
case NODE_FUNCSYNOPSISINFO: |
|
case NODE_KEYSYM: |
|
case NODE_LINK: |
|
case NODE_LITERAL: |
|
case NODE_OPTION: |
|
case NODE_PARAMETER: |
|
case NODE_REPLACEABLE: |
|
case NODE_REFPURPOSE: |
|
case NODE_SGMLTAG: |
|
case NODE_TYPE: |
|
case NODE_VARNAME: |
|
if (sv != LINE_MACRO && p->linestate == LINE_MACRO && |
|
(pn->parent == NULL || pn->parent->node != NODE_MEMBER)) |
|
macro_closepunct(p, pn); |
|
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
if (sv == LINE_NEW) |
if ((nc = TAILQ_FIRST(&n->childq)) != NULL && |
macro_close(p); |
nc->node == NODE_FILENAME && |
sv = p->linestate; |
TAILQ_NEXT(nc, child) == NULL) |
macro_open(p, "Qc"); |
/* nothing */; |
if (sv == LINE_NEW) |
else if (was_impl) { |
macro_close(p); |
f->flags &= ~FMT_NOSPC; |
|
macro_open(f, "Dc"); |
|
} else |
|
f->flags &= ~FMT_IMPL; |
break; |
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_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
case NODE_APPENDIX: |
case NODE_APPENDIX: |
Line 1054 pnode_print(struct format *p, struct pnode *pn) |
|
Line 1471 pnode_print(struct format *p, struct pnode *pn) |
|
case NODE_TIP: |
case NODE_TIP: |
case NODE_CAUTION: |
case NODE_CAUTION: |
case NODE_WARNING: |
case NODE_WARNING: |
p->level--; |
f->level--; |
break; |
break; |
case NODE_BLOCKQUOTE: |
case NODE_BLOCKQUOTE: |
case NODE_LITERALLAYOUT: |
case NODE_LITERALLAYOUT: |
case NODE_PROGRAMLISTING: |
case NODE_PROGRAMLISTING: |
case NODE_SCREEN: |
case NODE_SCREEN: |
case NODE_SYNOPSIS: |
case NODE_SYNOPSIS: |
macro_line(p, "Ed"); |
f->parastate = PARA_HAVE; |
|
macro_line(f, "Ed"); |
break; |
break; |
case NODE_TITLE: |
case NODE_TITLE: |
if (pn->parent != NULL && |
case NODE_SUBTITLE: |
pn->parent->node == NODE_BOOKINFO) |
f->parastate = PARA_WANT; |
macro_line(p, "Sh AUTHORS"); |
|
break; |
break; |
default: |
default: |
break; |
break; |
} |
} |
|
f->flags &= ~FMT_ARG; |
} |
} |
|
|
void |
void |
ptree_print(struct ptree *tree) |
ptree_print_mdoc(struct ptree *tree) |
{ |
{ |
struct format formatter; |
struct format formatter; |
|
|
formatter.level = 0; |
formatter.level = 0; |
formatter.linestate = LINE_NEW; |
formatter.linestate = LINE_NEW; |
pnode_printprologue(&formatter, tree); |
formatter.parastate = PARA_HAVE; |
|
pnode_printprologue(&formatter, tree->root); |
pnode_print(&formatter, tree->root); |
pnode_print(&formatter, tree->root); |
if (formatter.linestate != LINE_NEW) |
if (formatter.linestate != LINE_NEW) |
putchar('\n'); |
putchar('\n'); |