version 1.101, 2019/04/10 14:22:37 |
version 1.112, 2019/04/12 12:07:26 |
|
|
#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" |
Line 36 pnode_printtext(struct format *f, struct pnode *n) |
|
Line 37 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 53 pnode_printtext(struct format *f, struct pnode *n) |
|
Line 73 pnode_printtext(struct format *f, struct pnode *n) |
|
(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)) { |
(nn->node != NODE_TEXT && nn->node != NODE_ESCAPE)) { |
macro_open(f, "Pf"); |
macro_open(f, "Pf"); |
|
accept_arg = 1; |
|
f->flags |= FMT_CHILD; |
nn->spc = 1; |
nn->spc = 1; |
} |
} |
|
|
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 109 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 |
Line 109 pnode_printpara(struct format *f, struct pnode *n) |
|
Line 129 pnode_printpara(struct format *f, struct pnode *n) |
|
if ((np = TAILQ_PREV(n, pnodeq, child)) == NULL) |
if ((np = TAILQ_PREV(n, pnodeq, child)) == NULL) |
np = n->parent; |
np = n->parent; |
|
|
|
f->flags = 0; |
|
|
switch (np->node) { |
switch (np->node) { |
case NODE_ENTRY: |
case NODE_ENTRY: |
case NODE_GLOSSTERM: |
case NODE_GLOSSTERM: |
Line 128 pnode_printpara(struct format *f, struct pnode *n) |
|
Line 150 pnode_printpara(struct format *f, struct pnode *n) |
|
macro_line(f, "Pp"); |
macro_line(f, "Pp"); |
} |
} |
|
|
|
static void |
|
pnode_printrefnamediv(struct format *f, struct pnode *n) |
|
{ |
|
struct pnode *nc, *nn; |
|
int comma; |
|
|
|
macro_line(f, "Sh NAME"); |
|
comma = 0; |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
|
if (nc->node != NODE_REFNAME) |
|
continue; |
|
if (comma) |
|
macro_addarg(f, ",", ARG_SPACE); |
|
macro_open(f, "Nm"); |
|
macro_addnode(f, nc, ARG_SPACE); |
|
pnode_unlink(nc); |
|
comma = 1; |
|
} |
|
macro_close(f); |
|
} |
|
|
/* |
/* |
* If the SYNOPSIS macro has a superfluous title, kill it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
Line 387 pnode_printarg(struct format *f, struct pnode *n) |
|
Line 430 pnode_printarg(struct format *f, struct pnode *n) |
|
{ |
{ |
struct pnode *nc; |
struct pnode *nc; |
struct pattr *a; |
struct pattr *a; |
int isop, isrep; |
int isop, isrep, was_impl; |
|
|
isop = 1; |
isop = 1; |
isrep = 0; |
isrep = was_impl = 0; |
TAILQ_FOREACH(a, &n->attrq, child) { |
TAILQ_FOREACH(a, &n->attrq, child) { |
if (a->key == ATTRKEY_CHOICE && |
if (a->key == ATTRKEY_CHOICE && |
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
(a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) |
Line 398 pnode_printarg(struct format *f, struct pnode *n) |
|
Line 441 pnode_printarg(struct format *f, struct pnode *n) |
|
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT) |
isrep = 1; |
isrep = 1; |
} |
} |
if (isop) |
if (isop) { |
macro_open(f, "Op"); |
if (f->flags & FMT_IMPL) { |
|
was_impl = 1; |
|
macro_open(f, "Oo"); |
|
} else { |
|
macro_open(f, "Op"); |
|
f->flags |= FMT_IMPL; |
|
} |
|
} |
|
|
TAILQ_FOREACH(nc, &n->childq, child) { |
TAILQ_FOREACH(nc, &n->childq, child) { |
if (nc->node == NODE_TEXT) |
if (nc->node == NODE_TEXT) |
Line 408 pnode_printarg(struct format *f, struct pnode *n) |
|
Line 458 pnode_printarg(struct format *f, struct pnode *n) |
|
if (isrep && nc->node == NODE_TEXT) |
if (isrep && nc->node == NODE_TEXT) |
macro_addarg(f, "...", ARG_SPACE); |
macro_addarg(f, "...", ARG_SPACE); |
} |
} |
|
if (isop) { |
|
if (was_impl) |
|
macro_open(f, "Oc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
} |
pnode_unlinksub(n); |
pnode_unlinksub(n); |
} |
} |
|
|
Line 436 pnode_printgroup(struct format *f, struct pnode *n) |
|
Line 492 pnode_printgroup(struct format *f, struct pnode *n) |
|
macro_open(f, "Op"); |
macro_open(f, "Op"); |
else if (sv) |
else if (sv) |
macro_open(f, "No"); |
macro_open(f, "No"); |
|
f->flags |= FMT_IMPL; |
|
|
/* |
/* |
* Keep on printing text separated by the vertical bar as long |
* Keep on printing text separated by the vertical bar as long |
Line 459 pnode_printgroup(struct format *f, struct pnode *n) |
|
Line 516 pnode_printgroup(struct format *f, struct pnode *n) |
|
} |
} |
if (sv) |
if (sv) |
macro_close(f); |
macro_close(f); |
|
f->flags &= ~FMT_IMPL; |
pnode_unlinksub(n); |
pnode_unlinksub(n); |
} |
} |
|
|
Line 516 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 574 pnode_printauthor(struct format *f, struct pnode *n) |
|
*/ |
*/ |
|
|
if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) { |
if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) { |
|
f->flags |= FMT_CHILD; |
pnode_print(f, nc); |
pnode_print(f, nc); |
pnode_unlink(nc); |
pnode_unlink(nc); |
} |
} |
Line 535 pnode_printauthor(struct format *f, struct pnode *n) |
|
Line 594 pnode_printauthor(struct format *f, struct pnode *n) |
|
static void |
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 586 pnode_printprologue(struct format *f, struct ptree *tr |
|
Line 657 pnode_printprologue(struct format *f, struct ptree *tr |
|
} else |
} else |
pnode_printrefmeta(f, refmeta); |
pnode_printrefmeta(f, refmeta); |
macro_line(f, "Os"); |
macro_line(f, "Os"); |
|
|
if (tree->flags & TREE_EQN) { |
|
macro_line(f, "EQ"); |
|
print_text(f, "delim $$", 0); |
|
macro_line(f, "EN"); |
|
} |
|
} |
} |
|
|
/* |
/* |
Line 601 pnode_printprologue(struct format *f, struct ptree *tr |
|
Line 666 pnode_printprologue(struct format *f, struct ptree *tr |
|
static void |
static void |
pnode_printvarlistentry(struct format *f, struct pnode *n) |
pnode_printvarlistentry(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *nc; |
struct pnode *nc, *nn; |
int first = 1; |
int first = 1; |
|
|
macro_close(f); |
|
macro_open(f, "It"); |
macro_open(f, "It"); |
TAILQ_FOREACH(nc, &n->childq, child) { |
f->flags |= FMT_IMPL; |
|
TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) { |
if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM) |
if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM) |
continue; |
continue; |
if ( ! first) |
if (first == 0) { |
macro_addarg(f, ",", 0); |
switch (f->linestate) { |
|
case LINE_NEW: |
|
break; |
|
case LINE_TEXT: |
|
print_text(f, ",", 0); |
|
break; |
|
case LINE_MACRO: |
|
macro_addarg(f, ",", 0); |
|
break; |
|
} |
|
} |
pnode_print(f, nc); |
pnode_print(f, nc); |
|
pnode_unlink(nc); |
first = 0; |
first = 0; |
} |
} |
macro_close(f); |
macro_close(f); |
TAILQ_FOREACH(nc, &n->childq, child) |
while ((nc = TAILQ_FIRST(&n->childq)) != NULL) { |
if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM) |
pnode_print(f, nc); |
pnode_print(f, nc); |
pnode_unlink(nc); |
pnode_unlinksub(n); |
} |
|
macro_close(f); |
} |
} |
|
|
static void |
static void |
Line 673 pnode_printtgroup2(struct format *f, struct pnode *n) |
|
Line 750 pnode_printtgroup2(struct format *f, struct pnode *n) |
|
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; |
pnode_print(f, ne); |
pnode_print(f, ne); |
macro_close(f); |
macro_close(f); |
pnode_unlink(ne); |
pnode_unlink(ne); |
Line 752 pnode_printvariablelist(struct format *f, struct pnode |
|
Line 829 pnode_printvariablelist(struct format *f, struct pnode |
|
static void |
static void |
pnode_print(struct format *f, struct pnode *n) |
pnode_print(struct format *f, struct pnode *n) |
{ |
{ |
struct pnode *pp; |
struct pnode *nc, *nn; |
enum linestate sv; |
int was_impl; |
|
|
if (n == NULL) |
if (n == NULL) |
return; |
return; |
|
|
f->spc = n->spc; |
was_impl = f->flags & FMT_IMPL; |
sv = f->linestate; |
if (n->spc) |
|
f->flags &= ~FMT_NOSPC; |
|
else |
|
f->flags |= FMT_NOSPC; |
|
|
switch (n->node) { |
switch (n->node) { |
case NODE_APPLICATION: |
case NODE_APPLICATION: |
Line 794 pnode_print(struct format *f, struct pnode *n) |
|
Line 874 pnode_print(struct format *f, struct pnode *n) |
|
break; |
break; |
case NODE_EDITOR: |
case NODE_EDITOR: |
print_text(f, "editor:", ARG_SPACE); |
print_text(f, "editor:", ARG_SPACE); |
sv = LINE_TEXT; |
|
macro_open(f, "An"); |
macro_open(f, "An"); |
break; |
break; |
case NODE_EMAIL: |
case NODE_EMAIL: |
Line 824 pnode_print(struct format *f, struct pnode *n) |
|
Line 903 pnode_print(struct format *f, struct pnode *n) |
|
macro_open(f, "Fd"); |
macro_open(f, "Fd"); |
break; |
break; |
case NODE_INFORMALEQUATION: |
case NODE_INFORMALEQUATION: |
|
macro_line(f, "Bd -ragged -offset indent"); |
|
/* FALLTHROUGH */ |
|
case NODE_INLINEEQUATION: |
macro_line(f, "EQ"); |
macro_line(f, "EQ"); |
break; |
break; |
case NODE_INLINEEQUATION: |
|
if (f->linestate == LINE_NEW) |
|
f->linestate = LINE_TEXT; |
|
putchar('$'); |
|
break; |
|
case NODE_ITEMIZEDLIST: |
case NODE_ITEMIZEDLIST: |
pnode_printlist(f, n); |
pnode_printlist(f, n); |
break; |
break; |
Line 844 pnode_print(struct format *f, struct pnode *n) |
|
Line 921 pnode_print(struct format *f, struct pnode *n) |
|
pnode_printlink(f, n); |
pnode_printlink(f, n); |
break; |
break; |
case NODE_LITERAL: |
case NODE_LITERAL: |
macro_open(f, "Ql"); |
if (was_impl) |
|
macro_open(f, "So"); |
|
else { |
|
macro_open(f, "Ql"); |
|
f->flags |= FMT_IMPL; |
|
} |
break; |
break; |
case NODE_LITERALLAYOUT: |
case NODE_LITERALLAYOUT: |
macro_close(f); |
macro_close(f); |
macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) == |
macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) == |
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
ATTRVAL_MONOSPACED ? "-literal" : "-unfilled"); |
break; |
break; |
|
case NODE_MARKUP: |
|
macro_open(f, "Ic"); |
|
break; |
case NODE_MML_MFENCED: |
case NODE_MML_MFENCED: |
pnode_printmathfenced(f, n); |
pnode_printmathfenced(f, n); |
break; |
break; |
Line 878 pnode_print(struct format *f, struct pnode *n) |
|
Line 963 pnode_print(struct format *f, struct pnode *n) |
|
break; |
break; |
case NODE_PARAMDEF: |
case NODE_PARAMDEF: |
case NODE_PARAMETER: |
case NODE_PARAMETER: |
macro_nodeline(f, "Fa", n, ARG_SINGLE); |
/* More often, these appear inside NODE_FUNCPROTOTYPE. */ |
|
macro_open(f, "Fa"); |
|
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
pnode_unlinksub(n); |
pnode_unlinksub(n); |
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
macro_open(f, "Qo"); |
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: |
Line 894 pnode_print(struct format *f, struct pnode *n) |
|
Line 986 pnode_print(struct format *f, struct pnode *n) |
|
pnode_unlinksub(n); |
pnode_unlinksub(n); |
break; |
break; |
case NODE_REFNAME: |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* More often, these appear inside NODE_REFNAMEDIV. */ |
macro_open(f, "Nm"); |
macro_open(f, "Nm"); |
macro_addnode(f, n, ARG_SPACE | ARG_SINGLE); |
|
pnode_unlinksub(n); |
|
break; |
break; |
case NODE_REFNAMEDIV: |
case NODE_REFNAMEDIV: |
macro_line(f, "Sh NAME"); |
pnode_printrefnamediv(f, n); |
break; |
break; |
case NODE_REFPURPOSE: |
case NODE_REFPURPOSE: |
macro_open(f, "Nd"); |
macro_open(f, "Nd"); |
Line 924 pnode_print(struct format *f, struct pnode *n) |
|
Line 1014 pnode_print(struct format *f, struct pnode *n) |
|
case NODE_SBR: |
case NODE_SBR: |
macro_line(f, "br"); |
macro_line(f, "br"); |
break; |
break; |
case NODE_SGMLTAG: |
|
macro_open(f, "Ic"); |
|
break; |
|
case NODE_TEXT: |
case NODE_TEXT: |
case NODE_ESCAPE: |
case NODE_ESCAPE: |
pnode_printtext(f, n); |
pnode_printtext(f, n); |
Line 957 pnode_print(struct format *f, struct pnode *n) |
|
Line 1044 pnode_print(struct format *f, struct pnode *n) |
|
break; |
break; |
} |
} |
|
|
TAILQ_FOREACH(pp, &n->childq, child) |
TAILQ_FOREACH(nc, &n->childq, child) |
pnode_print(f, pp); |
pnode_print(f, nc); |
|
|
switch (n->node) { |
switch (n->node) { |
|
case NODE_ESCAPE: |
|
case NODE_TERM: |
|
case NODE_TEXT: |
|
/* Accept more arguments to the previous macro. */ |
|
return; |
case NODE_INFORMALEQUATION: |
case NODE_INFORMALEQUATION: |
macro_line(f, "EN"); |
macro_line(f, "EN"); |
|
macro_line(f, "Ed"); |
break; |
break; |
case NODE_INLINEEQUATION: |
case NODE_INLINEEQUATION: |
fputs("$ ", stdout); |
macro_line(f, "EN"); |
f->linestate = sv; |
|
break; |
break; |
|
case NODE_LITERAL: |
|
if (was_impl) |
|
macro_open(f, "Sc"); |
|
else |
|
f->flags &= ~FMT_IMPL; |
|
break; |
case NODE_MEMBER: |
case NODE_MEMBER: |
if ((pp = TAILQ_NEXT(n, child)) != NULL && |
if ((nn = TAILQ_NEXT(n, child)) != NULL && |
pp->node != NODE_MEMBER) |
nn->node != NODE_MEMBER) |
pp = NULL; |
nn = NULL; |
switch (f->linestate) { |
switch (f->linestate) { |
case LINE_TEXT: |
case LINE_TEXT: |
if (pp != NULL) |
if (nn != NULL) |
print_text(f, ",", 0); |
print_text(f, ",", 0); |
break; |
break; |
case LINE_MACRO: |
case LINE_MACRO: |
if (pp != NULL) |
if (nn != NULL) |
macro_addarg(f, ",", ARG_SPACE); |
macro_addarg(f, ",", ARG_SPACE); |
macro_close(f); |
macro_close(f); |
break; |
break; |
Line 994 pnode_print(struct format *f, struct pnode *n) |
|
Line 1092 pnode_print(struct format *f, struct pnode *n) |
|
break; |
break; |
fputs(" } ", stdout); |
fputs(" } ", stdout); |
break; |
break; |
case NODE_APPLICATION: |
|
case NODE_ARG: |
|
case NODE_AUTHOR: |
|
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 && f->linestate == LINE_MACRO && |
|
(n->parent == NULL || n->parent->node != NODE_MEMBER)) |
|
macro_closepunct(f, n); |
|
break; |
|
case NODE_QUOTE: |
case NODE_QUOTE: |
if (sv == LINE_NEW) |
if (was_impl) |
macro_close(f); |
macro_open(f, "Dc"); |
sv = f->linestate; |
else |
macro_open(f, "Qc"); |
f->flags &= ~FMT_IMPL; |
if (sv == LINE_NEW) |
|
macro_close(f); |
|
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 (n->parent != NULL && |
|
n->parent->node == NODE_REFNAMEDIV && |
|
TAILQ_NEXT(n, child) != NULL && |
|
TAILQ_NEXT(n, child)->node == NODE_REFNAME) |
|
macro_addarg(f, ",", ARG_SPACE); |
|
if (sv == LINE_NEW) |
|
macro_close(f); |
|
break; |
|
case NODE_PREFACE: |
case NODE_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
case NODE_APPENDIX: |
case NODE_APPENDIX: |
Line 1071 pnode_print(struct format *f, struct pnode *n) |
|
Line 1123 pnode_print(struct format *f, struct pnode *n) |
|
default: |
default: |
break; |
break; |
} |
} |
|
f->flags &= ~FMT_ARG; |
} |
} |
|
|
void |
void |