Annotation of docbook2mdoc/docbook2mdoc.c, Revision 1.116
1.116 ! schwarze 1: /* $Id: docbook2mdoc.c,v 1.115 2019/04/12 21:37:07 schwarze Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv>
1.50 schwarze 4: * Copyright (c) 2019 Ingo Schwarze <schwarze@openbsd.org>
1.1 kristaps 5: *
6: * Permission to use, copy, modify, and distribute this software for any
7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
9: *
10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
13: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17: */
18: #include <assert.h>
19: #include <ctype.h>
20: #include <stdio.h>
21: #include <stdlib.h>
1.103 schwarze 22: #include <string.h>
1.1 kristaps 23:
1.74 schwarze 24: #include "node.h"
1.75 schwarze 25: #include "macro.h"
1.74 schwarze 26: #include "format.h"
27:
28: /*
29: * The implementation of the mdoc(7) formatter.
30: */
1.12 kristaps 31:
1.74 schwarze 32: static void pnode_print(struct format *, struct pnode *);
1.25 kristaps 33:
1.37 kristaps 34:
1.54 schwarze 35: static void
1.93 schwarze 36: pnode_printtext(struct format *f, struct pnode *n)
37: {
1.94 schwarze 38: struct pnode *nn;
1.93 schwarze 39: char *cp;
1.103 schwarze 40: int accept_arg;
1.93 schwarze 41:
1.103 schwarze 42: cp = n->b;
43: accept_arg = f->flags & FMT_ARG;
1.107 schwarze 44: if (f->linestate == LINE_MACRO && !n->spc && !accept_arg) {
1.103 schwarze 45: for (;;) {
46: if (*cp == '\0')
47: return;
48: if (strchr("!),.:;?]", *cp) == NULL)
49: break;
50: printf(" %c", *cp++);
51: }
52: if (isspace((unsigned char)*cp)) {
53: while (isspace((unsigned char)*cp))
54: cp++;
55: macro_close(f);
56: } else {
57: fputs(" Ns", stdout);
58: f->flags &= FMT_IMPL;
59: accept_arg = 1;
60: }
1.94 schwarze 61: }
1.103 schwarze 62: if (f->linestate == LINE_MACRO && !accept_arg &&
63: (f->flags & (FMT_CHILD | FMT_IMPL)) == 0)
64: macro_close(f);
1.94 schwarze 65:
66: /*
67: * Text preceding a macro without intervening whitespace
68: * requires a .Pf macro.
69: * Set the spacing flag to avoid a redundant .Ns macro.
70: */
71:
72: if (f->linestate != LINE_MACRO &&
1.113 schwarze 73: (nn = TAILQ_NEXT(n, child)) != NULL && nn->spc == 0) {
74: switch (pnode_class(nn->node)) {
75: case CLASS_LINE:
76: case CLASS_ENCL:
77: macro_open(f, "Pf");
78: accept_arg = 1;
79: f->flags |= FMT_CHILD;
80: nn->spc = 1;
81: break;
82: default:
83: break;
84: }
1.93 schwarze 85: }
86:
1.103 schwarze 87: switch (f->linestate) {
1.107 schwarze 88: case LINE_NEW:
89: break;
1.103 schwarze 90: case LINE_TEXT:
1.105 schwarze 91: if (n->spc) {
1.107 schwarze 92: if (n->node == NODE_TEXT)
93: macro_close(f);
94: else
95: putchar(' ');
1.105 schwarze 96: }
1.103 schwarze 97: break;
98: case LINE_MACRO:
1.107 schwarze 99: if (accept_arg)
1.93 schwarze 100: putchar(' ');
1.107 schwarze 101: else
102: macro_close(f);
1.103 schwarze 103: break;
1.93 schwarze 104: }
105:
106: if (n->node == NODE_ESCAPE) {
107: fputs(n->b, stdout);
1.107 schwarze 108: if (f->linestate == LINE_NEW)
109: f->linestate = LINE_TEXT;
1.93 schwarze 110: return;
111: }
112:
113: /*
114: * Remove the prefix '-' from <option> elements
115: * because the arguments of .Fl macros do not need it.
116: */
117:
118: if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-')
119: cp++;
120:
1.107 schwarze 121: if (f->linestate == LINE_MACRO)
122: macro_addarg(f, cp, 0);
123: else
124: print_text(f, cp, 0);
1.93 schwarze 125: }
126:
127: static void
1.101 schwarze 128: pnode_printpara(struct format *f, struct pnode *n)
1.54 schwarze 129: {
1.101 schwarze 130: struct pnode *np;
1.54 schwarze 131:
1.101 schwarze 132: if (n->parent == NULL)
1.54 schwarze 133: return;
134:
1.101 schwarze 135: if ((np = TAILQ_PREV(n, pnodeq, child)) == NULL)
136: np = n->parent;
1.97 schwarze 137:
1.103 schwarze 138: f->flags = 0;
139:
1.101 schwarze 140: switch (np->node) {
1.61 schwarze 141: case NODE_ENTRY:
1.99 schwarze 142: case NODE_GLOSSTERM:
1.61 schwarze 143: case NODE_LISTITEM:
1.99 schwarze 144: case NODE_TERM:
1.61 schwarze 145: return;
1.100 schwarze 146: case NODE_APPENDIX:
147: case NODE_LEGALNOTICE:
1.61 schwarze 148: case NODE_PREFACE:
149: case NODE_SECTION:
1.101 schwarze 150: if (f->level < 3)
1.61 schwarze 151: return;
152: break;
153: default:
154: break;
155: }
1.101 schwarze 156: macro_line(f, "Pp");
1.54 schwarze 157: }
158:
1.110 schwarze 159: static void
160: pnode_printrefnamediv(struct format *f, struct pnode *n)
161: {
162: struct pnode *nc, *nn;
163: int comma;
164:
165: macro_line(f, "Sh NAME");
166: comma = 0;
167: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
168: if (nc->node != NODE_REFNAME)
169: continue;
170: if (comma)
171: macro_addarg(f, ",", ARG_SPACE);
172: macro_open(f, "Nm");
173: macro_addnode(f, nc, ARG_SPACE);
174: pnode_unlink(nc);
175: comma = 1;
176: }
177: macro_close(f);
178: }
179:
1.37 kristaps 180: /*
1.10 kristaps 181: * If the SYNOPSIS macro has a superfluous title, kill it.
1.8 kristaps 182: */
1.1 kristaps 183: static void
1.101 schwarze 184: pnode_printrefsynopsisdiv(struct format *f, struct pnode *n)
1.6 kristaps 185: {
1.101 schwarze 186: struct pnode *nc, *nn;
1.6 kristaps 187:
1.101 schwarze 188: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn)
189: if (nc->node == NODE_TITLE)
190: pnode_unlink(nc);
1.71 schwarze 191:
1.101 schwarze 192: macro_line(f, "Sh SYNOPSIS");
1.6 kristaps 193: }
194:
1.8 kristaps 195: /*
196: * Start a hopefully-named `Sh' section.
197: */
1.6 kristaps 198: static void
1.101 schwarze 199: pnode_printrefsect(struct format *f, struct pnode *n)
1.1 kristaps 200: {
1.115 schwarze 201: struct pnode *nc, *ncc;
1.52 schwarze 202: const char *title;
203: int flags, level;
204:
1.101 schwarze 205: if (n->parent == NULL)
1.56 schwarze 206: return;
207:
1.101 schwarze 208: level = ++f->level;
1.72 schwarze 209: flags = ARG_SPACE;
210: if (level == 1)
211: flags |= ARG_UPPER;
1.64 schwarze 212: if (level < 3) {
1.101 schwarze 213: switch (n->node) {
1.62 schwarze 214: case NODE_CAUTION:
215: case NODE_NOTE:
216: case NODE_TIP:
217: case NODE_WARNING:
1.52 schwarze 218: level = 3;
219: break;
220: default:
221: break;
222: }
223: }
1.1 kristaps 224:
1.101 schwarze 225: TAILQ_FOREACH(nc, &n->childq, child)
226: if (nc->node == NODE_TITLE)
1.1 kristaps 227: break;
228:
1.101 schwarze 229: if (nc == NULL) {
230: switch (n->node) {
1.62 schwarze 231: case NODE_PREFACE:
1.52 schwarze 232: title = "Preface";
233: break;
1.100 schwarze 234: case NODE_APPENDIX:
235: title = "Appendix";
236: break;
237: case NODE_LEGALNOTICE:
238: title = "Legal Notice";
239: break;
1.62 schwarze 240: case NODE_CAUTION:
1.52 schwarze 241: title = "Caution";
242: break;
1.62 schwarze 243: case NODE_NOTE:
1.52 schwarze 244: title = "Note";
245: break;
1.62 schwarze 246: case NODE_TIP:
1.52 schwarze 247: title = "Tip";
248: break;
1.62 schwarze 249: case NODE_WARNING:
1.52 schwarze 250: title = "Warning";
251: break;
252: default:
253: title = "Unknown";
254: break;
255: }
256: }
257:
258: switch (level) {
1.62 schwarze 259: case 1:
1.101 schwarze 260: macro_close(f);
261: macro_open(f, "Sh");
1.29 kristaps 262: break;
1.62 schwarze 263: case 2:
1.101 schwarze 264: macro_close(f);
265: macro_open(f, "Ss");
1.29 kristaps 266: break;
1.52 schwarze 267: default:
1.101 schwarze 268: pnode_printpara(f, n);
269: macro_open(f, "Sy");
1.29 kristaps 270: break;
271: }
1.20 kristaps 272:
1.115 schwarze 273: if (nc != NULL)
1.101 schwarze 274: macro_addnode(f, nc, flags);
1.115 schwarze 275: else
1.101 schwarze 276: macro_addarg(f, title, flags | ARG_QUOTED);
277: macro_close(f);
1.115 schwarze 278:
279: /*
280: * DocBook has no equivalent for -split mode,
281: * so just switch the default in the AUTHORS section.
282: */
283:
284: if (nc != NULL) {
285: ncc = TAILQ_FIRST(&nc->childq);
286: if (ncc != NULL && ncc->node == NODE_TEXT &&
287: strcasecmp(ncc->b, "AUTHORS") == 0)
288: macro_line(f, "An -nosplit");
289: pnode_unlink(nc);
290: }
1.1 kristaps 291: }
292:
1.8 kristaps 293: /*
294: * Start a reference, extracting the title and volume.
295: */
1.1 kristaps 296: static void
1.101 schwarze 297: pnode_printciterefentry(struct format *f, struct pnode *n)
1.1 kristaps 298: {
1.101 schwarze 299: struct pnode *nc, *title, *manvol;
1.1 kristaps 300:
301: title = manvol = NULL;
1.101 schwarze 302: TAILQ_FOREACH(nc, &n->childq, child) {
303: if (nc->node == NODE_MANVOLNUM)
304: manvol = nc;
305: else if (nc->node == NODE_REFENTRYTITLE)
306: title = nc;
1.69 schwarze 307: }
1.101 schwarze 308: macro_open(f, "Xr");
1.69 schwarze 309: if (title == NULL)
1.101 schwarze 310: macro_addarg(f, "unknown", ARG_SPACE);
1.69 schwarze 311: else
1.101 schwarze 312: macro_addnode(f, title, ARG_SPACE | ARG_SINGLE);
1.69 schwarze 313: if (manvol == NULL)
1.101 schwarze 314: macro_addarg(f, "1", ARG_SPACE);
1.64 schwarze 315: else
1.101 schwarze 316: macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE);
317: pnode_unlinksub(n);
1.1 kristaps 318: }
319:
320: static void
1.86 schwarze 321: pnode_printfuncdef(struct format *f, struct pnode *n)
1.3 kristaps 322: {
1.86 schwarze 323: struct pnode *nc;
1.3 kristaps 324:
1.86 schwarze 325: nc = TAILQ_FIRST(&n->childq);
326: if (nc != NULL && nc->node == NODE_TEXT) {
327: macro_argline(f, "Ft", nc->b);
328: pnode_unlink(nc);
1.13 kristaps 329: }
1.86 schwarze 330: macro_nodeline(f, "Fo", n, ARG_SINGLE);
331: pnode_unlinksub(n);
1.3 kristaps 332: }
333:
1.40 kristaps 334: /*
1.41 kristaps 335: * The <mml:mfenced> node is a little peculiar.
336: * First, it can have arbitrary open and closing tokens, which default
337: * to parentheses.
338: * Second, >1 arguments are separated by commas.
339: */
340: static void
1.101 schwarze 341: pnode_printmathfenced(struct format *f, struct pnode *n)
1.41 kristaps 342: {
1.101 schwarze 343: struct pnode *nc;
1.41 kristaps 344:
1.101 schwarze 345: printf("left %s ", pnode_getattr_raw(n, ATTRKEY_OPEN, "("));
1.41 kristaps 346:
1.101 schwarze 347: nc = TAILQ_FIRST(&n->childq);
348: pnode_print(f, nc);
1.41 kristaps 349:
1.101 schwarze 350: while ((nc = TAILQ_NEXT(nc, child)) != NULL) {
1.41 kristaps 351: putchar(',');
1.101 schwarze 352: pnode_print(f, nc);
1.41 kristaps 353: }
1.101 schwarze 354: printf("right %s ", pnode_getattr_raw(n, ATTRKEY_CLOSE, ")"));
355: pnode_unlinksub(n);
1.41 kristaps 356: }
357:
358: /*
1.40 kristaps 359: * These math nodes require special handling because they have infix
360: * syntax, instead of the usual prefix or prefix.
361: * So we need to break up the first and second child node with a
362: * particular eqn(7) word.
363: */
364: static void
1.101 schwarze 365: pnode_printmath(struct format *f, struct pnode *n)
1.40 kristaps 366: {
1.101 schwarze 367: struct pnode *nc;
1.40 kristaps 368:
1.101 schwarze 369: nc = TAILQ_FIRST(&n->childq);
370: pnode_print(f, nc);
1.40 kristaps 371:
1.101 schwarze 372: switch (n->node) {
1.62 schwarze 373: case NODE_MML_MSUP:
1.42 kristaps 374: fputs(" sup ", stdout);
1.40 kristaps 375: break;
1.62 schwarze 376: case NODE_MML_MFRAC:
1.42 kristaps 377: fputs(" over ", stdout);
1.40 kristaps 378: break;
1.62 schwarze 379: case NODE_MML_MSUB:
1.42 kristaps 380: fputs(" sub ", stdout);
1.40 kristaps 381: break;
382: default:
383: break;
384: }
385:
1.101 schwarze 386: nc = TAILQ_NEXT(nc, child);
387: pnode_print(f, nc);
388: pnode_unlinksub(n);
1.40 kristaps 389: }
390:
1.3 kristaps 391: static void
1.101 schwarze 392: pnode_printfuncprototype(struct format *f, struct pnode *n)
1.3 kristaps 393: {
1.101 schwarze 394: struct pnode *nc, *fdef;
1.3 kristaps 395:
1.101 schwarze 396: TAILQ_FOREACH(fdef, &n->childq, child)
1.64 schwarze 397: if (fdef->node == NODE_FUNCDEF)
1.3 kristaps 398: break;
399:
1.86 schwarze 400: if (fdef != NULL) {
1.101 schwarze 401: pnode_printfuncdef(f, fdef);
1.86 schwarze 402: pnode_unlink(fdef);
403: } else
1.101 schwarze 404: macro_line(f, "Fo UNKNOWN");
1.3 kristaps 405:
1.101 schwarze 406: TAILQ_FOREACH(nc, &n->childq, child)
407: macro_nodeline(f, "Fa", nc, ARG_SINGLE);
1.3 kristaps 408:
1.101 schwarze 409: macro_line(f, "Fc");
410: pnode_unlinksub(n);
1.3 kristaps 411: }
412:
1.44 schwarze 413: /*
1.10 kristaps 414: * The <arg> element is more complicated than it should be because text
415: * nodes are treated like ".Ar foo", but non-text nodes need to be
416: * re-sent into the printer (i.e., without the preceding ".Ar").
1.12 kristaps 417: * This also handles the case of "repetition" (or in other words, the
418: * ellipsis following an argument) and optionality.
1.10 kristaps 419: */
1.4 kristaps 420: static void
1.101 schwarze 421: pnode_printarg(struct format *f, struct pnode *n)
1.4 kristaps 422: {
1.101 schwarze 423: struct pnode *nc;
424: struct pattr *a;
1.103 schwarze 425: int isop, isrep, was_impl;
1.12 kristaps 426:
427: isop = 1;
1.103 schwarze 428: isrep = was_impl = 0;
1.101 schwarze 429: TAILQ_FOREACH(a, &n->attrq, child) {
430: if (a->key == ATTRKEY_CHOICE &&
431: (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ))
1.12 kristaps 432: isop = 0;
1.101 schwarze 433: else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT)
1.12 kristaps 434: isrep = 1;
435: }
1.103 schwarze 436: if (isop) {
437: if (f->flags & FMT_IMPL) {
438: was_impl = 1;
439: macro_open(f, "Oo");
440: } else {
441: macro_open(f, "Op");
442: f->flags |= FMT_IMPL;
443: }
444: }
1.4 kristaps 445:
1.101 schwarze 446: TAILQ_FOREACH(nc, &n->childq, child) {
447: if (nc->node == NODE_TEXT)
448: macro_open(f, "Ar");
449: pnode_print(f, nc);
450: if (isrep && nc->node == NODE_TEXT)
451: macro_addarg(f, "...", ARG_SPACE);
1.10 kristaps 452: }
1.103 schwarze 453: if (isop) {
454: if (was_impl)
455: macro_open(f, "Oc");
456: else
457: f->flags &= ~FMT_IMPL;
458: }
1.101 schwarze 459: pnode_unlinksub(n);
1.4 kristaps 460: }
461:
1.24 kristaps 462: static void
1.101 schwarze 463: pnode_printgroup(struct format *f, struct pnode *n)
1.24 kristaps 464: {
1.101 schwarze 465: struct pnode *nc, *nn;
466: struct pattr *a;
1.24 kristaps 467: int isop, sv;
468:
469: isop = 1;
1.101 schwarze 470: TAILQ_FOREACH(a, &n->attrq, child)
471: if (a->key == ATTRKEY_CHOICE &&
472: (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) {
1.24 kristaps 473: isop = 0;
474: break;
475: }
476:
1.44 schwarze 477: /*
1.24 kristaps 478: * Make sure we're on a macro line.
479: * This will prevent pnode_print() for putting us on a
480: * subsequent line.
481: */
1.101 schwarze 482: sv = f->linestate == LINE_NEW;
1.44 schwarze 483: if (isop)
1.101 schwarze 484: macro_open(f, "Op");
1.24 kristaps 485: else if (sv)
1.101 schwarze 486: macro_open(f, "No");
1.103 schwarze 487: f->flags |= FMT_IMPL;
1.24 kristaps 488:
489: /*
490: * Keep on printing text separated by the vertical bar as long
491: * as we're within the same origin node as the group.
492: * This is kind of a nightmare.
493: * Eh, DocBook...
494: * FIXME: if there's a "Fl", we don't cut off the leading "-"
495: * like we do in pnode_print().
496: */
1.101 schwarze 497: TAILQ_FOREACH(nc, &n->childq, child) {
498: pnode_print(f, nc);
499: nn = TAILQ_NEXT(nc, child);
500: while (nn != NULL) {
501: if (nc->node != nn->node)
1.24 kristaps 502: break;
1.101 schwarze 503: macro_addarg(f, "|", ARG_SPACE);
504: macro_addnode(f, nn, ARG_SPACE);
505: nc = nn;
506: nn = TAILQ_NEXT(nn, child);
1.24 kristaps 507: }
508: }
1.69 schwarze 509: if (sv)
1.101 schwarze 510: macro_close(f);
1.103 schwarze 511: f->flags &= ~FMT_IMPL;
1.101 schwarze 512: pnode_unlinksub(n);
1.24 kristaps 513: }
514:
1.7 kristaps 515: static void
1.78 schwarze 516: pnode_printauthor(struct format *f, struct pnode *n)
517: {
1.101 schwarze 518: struct pnode *nc, *nn;
1.78 schwarze 519: int have_contrib, have_name;
520:
521: /*
522: * Print <contrib> children up front, before the .An scope,
523: * and figure out whether we a name of a person.
524: */
525:
526: have_contrib = have_name = 0;
1.101 schwarze 527: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.78 schwarze 528: switch (nc->node) {
529: case NODE_CONTRIB:
530: if (have_contrib)
531: print_text(f, ",", 0);
532: print_textnode(f, nc);
533: pnode_unlink(nc);
534: have_contrib = 1;
535: break;
536: case NODE_PERSONNAME:
537: have_name = 1;
538: break;
539: default:
540: break;
541: }
542: }
543: if (TAILQ_FIRST(&n->childq) == NULL)
544: return;
545:
546: if (have_contrib)
547: print_text(f, ":", 0);
548:
549: /*
550: * If we have a name, print it in the .An scope and leave
551: * all other content for child handlers, to print after the
552: * scope. Otherwise, print everything in the scope.
553: */
554:
555: macro_open(f, "An");
1.101 schwarze 556: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.78 schwarze 557: if (nc->node == NODE_PERSONNAME || have_name == 0) {
558: macro_addnode(f, nc, ARG_SPACE);
559: pnode_unlink(nc);
560: }
1.80 schwarze 561: }
562:
563: /*
564: * If there is an email address,
565: * print it on the same macro line.
566: */
567:
568: if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) {
1.103 schwarze 569: f->flags |= FMT_CHILD;
1.115 schwarze 570: macro_open(f, "Aq Mt");
571: macro_addnode(f, nc, ARG_SPACE);
1.80 schwarze 572: pnode_unlink(nc);
1.78 schwarze 573: }
574:
575: /*
576: * If there are still unprinted children, end the scope
577: * with a comma. Otherwise, leave the scope open in case
578: * a text node follows that starts with closing punctuation.
579: */
580:
581: if (TAILQ_FIRST(&n->childq) != NULL) {
582: macro_addarg(f, ",", ARG_SPACE);
583: macro_close(f);
584: }
585: }
586:
587: static void
1.96 schwarze 588: pnode_printlink(struct format *f, struct pnode *n)
589: {
1.109 schwarze 590: struct pnode *nc;
1.96 schwarze 591: const char *uri, *text;
592:
593: uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL);
594: if (uri != NULL) {
595: if (TAILQ_FIRST(&n->childq) != NULL) {
1.109 schwarze 596: TAILQ_FOREACH(nc, &n->childq, child)
597: pnode_print(f, nc);
1.96 schwarze 598: text = "";
1.109 schwarze 599: } else if ((text = pnode_getattr_raw(n,
600: ATTRKEY_ENDTERM, NULL)) != NULL) {
601: if (f->linestate == LINE_MACRO && f->flags & FMT_ARG)
602: macro_addarg(f, text, ARG_SPACE);
603: else
1.96 schwarze 604: print_text(f, text, ARG_SPACE);
605: }
1.103 schwarze 606: if (text != NULL) {
1.109 schwarze 607: if (f->flags & FMT_IMPL)
608: macro_open(f, "Po");
609: else {
610: macro_open(f, "Pq");
611: f->flags |= FMT_CHILD;
612: }
1.103 schwarze 613: }
1.96 schwarze 614: macro_open(f, "Sx");
615: macro_addarg(f, uri, ARG_SPACE);
1.109 schwarze 616: if (text != NULL && f->flags & FMT_IMPL)
617: macro_open(f, "Pc");
1.96 schwarze 618: pnode_unlinksub(n);
619: return;
620: }
621: uri = pnode_getattr_raw(n, ATTRKEY_XLINK_HREF, NULL);
622: if (uri == NULL)
623: uri = pnode_getattr_raw(n, ATTRKEY_URL, NULL);
624: if (uri != NULL) {
625: macro_open(f, "Lk");
626: macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE);
627: if (TAILQ_FIRST(&n->childq) != NULL)
628: macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
629: pnode_unlinksub(n);
630: return;
631: }
632: }
633:
634: static void
1.116 ! schwarze 635: pnode_printprologue(struct format *f, struct pnode *root)
1.7 kristaps 636: {
1.116 ! schwarze 637: struct pnode *date, *refmeta, *name, *vol, *descr, *nc;
! 638: const char *sname;
1.7 kristaps 639:
1.116 ! schwarze 640: /* Collect information. */
1.9 kristaps 641:
1.116 ! schwarze 642: if ((date = pnode_takefirst(root, NODE_PUBDATE)) == NULL)
! 643: date = pnode_takefirst(root, NODE_DATE);
! 644:
! 645: name = vol = NULL;
! 646: if ((refmeta = pnode_takefirst(root, NODE_REFMETA)) != NULL) {
! 647: TAILQ_FOREACH(nc, &refmeta->childq, child) {
! 648: switch (nc->node) {
! 649: case NODE_REFENTRYTITLE:
! 650: name = nc;
! 651: break;
! 652: case NODE_MANVOLNUM:
! 653: vol = nc;
! 654: break;
! 655: default:
! 656: break;
! 657: }
! 658: }
! 659: }
! 660:
! 661: if (pnode_findfirst(root, NODE_REFNAMEDIV) == NULL &&
! 662: ((nc = pnode_findfirst(root, NODE_BOOKINFO)) != NULL ||
! 663: (nc = pnode_findfirst(root, NODE_REFENTRYINFO)) != NULL))
! 664: descr = pnode_takefirst(nc, NODE_TITLE);
! 665: else
! 666: descr = NULL;
! 667:
! 668: /* Print prologue. */
! 669:
! 670: if (date == NULL)
! 671: macro_line(f, "Dd $Mdocdate" "$");
! 672: else
! 673: macro_nodeline(f, "Dd", date, 0);
! 674:
! 675: macro_open(f, "Dt");
! 676: if (name == NULL) {
! 677: sname = pnode_getattr_raw(root, ATTRKEY_ID, "UNKNOWN");
! 678: macro_addarg(f, sname, ARG_SPACE | ARG_SINGLE | ARG_UPPER);
! 679: } else
! 680: macro_addnode(f, name, ARG_SPACE | ARG_SINGLE | ARG_UPPER);
! 681: if (vol == NULL)
1.101 schwarze 682: macro_addarg(f, "1", ARG_SPACE);
1.116 ! schwarze 683: else
! 684: macro_addnode(f, vol, ARG_SPACE | ARG_SINGLE);
! 685:
1.101 schwarze 686: macro_line(f, "Os");
1.116 ! schwarze 687:
! 688: if (descr != NULL) {
! 689: macro_line(f, "Sh NAME");
! 690: if (name == NULL)
! 691: macro_argline(f, "Nm", sname);
! 692: else
! 693: macro_nodeline(f, "Nm", name, ARG_SINGLE);
! 694: macro_nodeline(f, "Nd", descr, 0);
! 695: }
! 696:
! 697: /* Clean up. */
! 698:
! 699: pnode_unlink(date);
! 700: pnode_unlink(refmeta);
! 701: pnode_unlink(descr);
1.7 kristaps 702: }
703:
1.42 kristaps 704: /*
705: * We can have multiple <term> elements within a <varlistentry>, which
706: * we should comma-separate as list headers.
707: */
1.13 kristaps 708: static void
1.101 schwarze 709: pnode_printvarlistentry(struct format *f, struct pnode *n)
1.13 kristaps 710: {
1.108 schwarze 711: struct pnode *nc, *nn;
1.42 kristaps 712: int first = 1;
1.13 kristaps 713:
1.101 schwarze 714: macro_open(f, "It");
1.103 schwarze 715: f->flags |= FMT_IMPL;
1.108 schwarze 716: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.101 schwarze 717: if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM)
1.69 schwarze 718: continue;
1.108 schwarze 719: if (first == 0) {
720: switch (f->linestate) {
721: case LINE_NEW:
722: break;
723: case LINE_TEXT:
724: print_text(f, ",", 0);
725: break;
726: case LINE_MACRO:
727: macro_addarg(f, ",", 0);
728: break;
729: }
730: }
1.101 schwarze 731: pnode_print(f, nc);
1.108 schwarze 732: pnode_unlink(nc);
1.69 schwarze 733: first = 0;
734: }
1.101 schwarze 735: macro_close(f);
1.108 schwarze 736: while ((nc = TAILQ_FIRST(&n->childq)) != NULL) {
737: pnode_print(f, nc);
738: pnode_unlink(nc);
739: }
740: macro_close(f);
1.71 schwarze 741: }
742:
743: static void
1.101 schwarze 744: pnode_printtitle(struct format *f, struct pnode *n)
1.71 schwarze 745: {
1.101 schwarze 746: struct pnode *nc, *nn;
1.71 schwarze 747:
1.101 schwarze 748: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
749: if (nc->node == NODE_TITLE) {
750: pnode_printpara(f, nc);
751: pnode_print(f, nc);
752: pnode_unlink(nc);
1.71 schwarze 753: }
754: }
1.13 kristaps 755: }
756:
757: static void
1.101 schwarze 758: pnode_printrow(struct format *f, struct pnode *n)
1.25 kristaps 759: {
1.101 schwarze 760: struct pnode *nc;
1.25 kristaps 761:
1.101 schwarze 762: macro_line(f, "Bl -dash -compact");
763: TAILQ_FOREACH(nc, &n->childq, child) {
764: macro_line(f, "It");
765: pnode_print(f, nc);
1.25 kristaps 766: }
1.101 schwarze 767: macro_line(f, "El");
768: pnode_unlink(n);
1.25 kristaps 769: }
770:
771: static void
1.83 schwarze 772: pnode_printtgroup1(struct format *f, struct pnode *n)
1.16 kristaps 773: {
1.82 schwarze 774: struct pnode *nc;
775:
1.83 schwarze 776: macro_line(f, "Bl -bullet -compact");
1.82 schwarze 777: while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) {
1.83 schwarze 778: macro_line(f, "It");
779: pnode_print(f, nc);
1.82 schwarze 780: pnode_unlink(nc);
781: }
1.83 schwarze 782: macro_line(f, "El");
783: pnode_unlinksub(n);
784: }
785:
786: static void
787: pnode_printtgroup2(struct format *f, struct pnode *n)
788: {
789: struct pnode *nr, *ne;
790:
791: macro_line(f, "Bl -tag -width Ds");
792: while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) {
793: if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL)
794: break;
795: macro_open(f, "It");
1.103 schwarze 796: f->flags |= FMT_IMPL;
1.83 schwarze 797: pnode_print(f, ne);
1.84 schwarze 798: macro_close(f);
1.83 schwarze 799: pnode_unlink(ne);
800: pnode_print(f, nr);
801: pnode_unlink(nr);
802: }
803: macro_line(f, "El");
1.82 schwarze 804: pnode_unlinksub(n);
805: }
806:
807: static void
1.83 schwarze 808: pnode_printtgroup(struct format *f, struct pnode *n)
1.82 schwarze 809: {
810: struct pnode *nc;
811:
812: switch (atoi(pnode_getattr_raw(n, ATTRKEY_COLS, "0"))) {
813: case 1:
1.83 schwarze 814: pnode_printtgroup1(f, n);
815: return;
816: case 2:
817: pnode_printtgroup2(f, n);
1.82 schwarze 818: return;
819: default:
820: break;
821: }
1.16 kristaps 822:
1.83 schwarze 823: macro_line(f, "Bl -ohang");
1.82 schwarze 824: while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) {
1.83 schwarze 825: macro_line(f, "It Table Row");
826: pnode_printrow(f, nc);
1.25 kristaps 827: }
1.83 schwarze 828: macro_line(f, "El");
1.82 schwarze 829: pnode_unlinksub(n);
1.25 kristaps 830: }
831:
832: static void
1.101 schwarze 833: pnode_printlist(struct format *f, struct pnode *n)
1.25 kristaps 834: {
1.101 schwarze 835: struct pnode *nc;
1.16 kristaps 836:
1.101 schwarze 837: pnode_printtitle(f, n);
838: macro_argline(f, "Bl",
839: n->node == NODE_ORDEREDLIST ? "-enum" : "-bullet");
840: TAILQ_FOREACH(nc, &n->childq, child) {
841: macro_line(f, "It");
842: pnode_print(f, nc);
1.16 kristaps 843: }
1.101 schwarze 844: macro_line(f, "El");
845: pnode_unlinksub(n);
1.16 kristaps 846: }
847:
848: static void
1.101 schwarze 849: pnode_printvariablelist(struct format *f, struct pnode *n)
1.13 kristaps 850: {
1.101 schwarze 851: struct pnode *nc;
1.13 kristaps 852:
1.101 schwarze 853: pnode_printtitle(f, n);
854: macro_line(f, "Bl -tag -width Ds");
855: TAILQ_FOREACH(nc, &n->childq, child) {
856: if (nc->node == NODE_VARLISTENTRY)
857: pnode_printvarlistentry(f, nc);
1.69 schwarze 858: else
1.101 schwarze 859: macro_nodeline(f, "It", nc, 0);
1.69 schwarze 860: }
1.101 schwarze 861: macro_line(f, "El");
862: pnode_unlinksub(n);
1.13 kristaps 863: }
864:
1.1 kristaps 865: /*
866: * Print a parsed node (or ignore it--whatever).
867: * This is a recursive function.
1.23 kristaps 868: * FIXME: if we're in a literal context (<screen> or <programlisting> or
869: * whatever), don't print inline macros.
1.1 kristaps 870: */
871: static void
1.101 schwarze 872: pnode_print(struct format *f, struct pnode *n)
1.1 kristaps 873: {
1.102 schwarze 874: struct pnode *nc, *nn;
1.112 schwarze 875: int was_impl;
1.1 kristaps 876:
1.101 schwarze 877: if (n == NULL)
1.1 kristaps 878: return;
879:
1.112 schwarze 880: was_impl = f->flags & FMT_IMPL;
1.103 schwarze 881: if (n->spc)
882: f->flags &= ~FMT_NOSPC;
883: else
884: f->flags |= FMT_NOSPC;
1.1 kristaps 885:
1.101 schwarze 886: switch (n->node) {
1.62 schwarze 887: case NODE_APPLICATION:
1.101 schwarze 888: macro_open(f, "Nm");
1.27 kristaps 889: break;
1.62 schwarze 890: case NODE_ARG:
1.101 schwarze 891: pnode_printarg(f, n);
1.4 kristaps 892: break;
1.62 schwarze 893: case NODE_AUTHOR:
1.101 schwarze 894: pnode_printauthor(f, n);
1.50 schwarze 895: break;
1.62 schwarze 896: case NODE_AUTHORGROUP:
1.101 schwarze 897: macro_line(f, "An -split");
1.50 schwarze 898: break;
1.98 schwarze 899: case NODE_BLOCKQUOTE:
1.101 schwarze 900: macro_line(f, "Bd -ragged -offset indent");
1.98 schwarze 901: break;
1.62 schwarze 902: case NODE_CITEREFENTRY:
1.101 schwarze 903: pnode_printciterefentry(f, n);
1.1 kristaps 904: break;
1.68 schwarze 905: case NODE_CITETITLE:
1.101 schwarze 906: macro_open(f, "%T");
1.68 schwarze 907: break;
1.62 schwarze 908: case NODE_COMMAND:
1.101 schwarze 909: macro_open(f, "Nm");
1.13 kristaps 910: break;
1.62 schwarze 911: case NODE_CONSTANT:
1.101 schwarze 912: macro_open(f, "Dv");
1.33 kristaps 913: break;
1.62 schwarze 914: case NODE_EDITOR:
1.101 schwarze 915: print_text(f, "editor:", ARG_SPACE);
916: macro_open(f, "An");
1.50 schwarze 917: break;
1.65 schwarze 918: case NODE_EMAIL:
1.115 schwarze 919: if (was_impl)
920: macro_open(f, "Ao Mt");
921: else {
922: macro_open(f, "Aq Mt");
923: f->flags |= FMT_IMPL;
924: }
1.65 schwarze 925: break;
1.62 schwarze 926: case NODE_EMPHASIS:
927: case NODE_FIRSTTERM:
1.99 schwarze 928: case NODE_GLOSSTERM:
1.101 schwarze 929: macro_open(f, "Em");
1.1 kristaps 930: break;
1.62 schwarze 931: case NODE_ENVAR:
1.101 schwarze 932: macro_open(f, "Ev");
1.79 schwarze 933: break;
1.90 schwarze 934: case NODE_ERRORNAME:
1.101 schwarze 935: macro_open(f, "Er");
1.90 schwarze 936: break;
1.62 schwarze 937: case NODE_FILENAME:
1.101 schwarze 938: macro_open(f, "Pa");
1.17 kristaps 939: break;
1.62 schwarze 940: case NODE_FUNCTION:
1.101 schwarze 941: macro_open(f, "Fn");
1.3 kristaps 942: break;
1.62 schwarze 943: case NODE_FUNCPROTOTYPE:
1.101 schwarze 944: pnode_printfuncprototype(f, n);
1.3 kristaps 945: break;
1.62 schwarze 946: case NODE_FUNCSYNOPSISINFO:
1.101 schwarze 947: macro_open(f, "Fd");
1.16 kristaps 948: break;
1.62 schwarze 949: case NODE_INFORMALEQUATION:
1.111 schwarze 950: macro_line(f, "Bd -ragged -offset indent");
951: /* FALLTHROUGH */
952: case NODE_INLINEEQUATION:
1.101 schwarze 953: macro_line(f, "EQ");
1.43 kristaps 954: break;
1.62 schwarze 955: case NODE_ITEMIZEDLIST:
1.101 schwarze 956: pnode_printlist(f, n);
1.24 kristaps 957: break;
1.62 schwarze 958: case NODE_GROUP:
1.101 schwarze 959: pnode_printgroup(f, n);
1.10 kristaps 960: break;
1.67 schwarze 961: case NODE_KEYSYM:
1.101 schwarze 962: macro_open(f, "Sy");
1.67 schwarze 963: break;
1.62 schwarze 964: case NODE_LINK:
1.101 schwarze 965: pnode_printlink(f, n);
1.96 schwarze 966: break;
1.62 schwarze 967: case NODE_LITERAL:
1.112 schwarze 968: if (was_impl)
969: macro_open(f, "So");
970: else {
971: macro_open(f, "Ql");
972: f->flags |= FMT_IMPL;
973: }
1.19 kristaps 974: break;
1.62 schwarze 975: case NODE_LITERALLAYOUT:
1.101 schwarze 976: macro_close(f);
977: macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) ==
1.66 schwarze 978: ATTRVAL_MONOSPACED ? "-literal" : "-unfilled");
1.60 schwarze 979: break;
1.106 schwarze 980: case NODE_MARKUP:
981: macro_open(f, "Ic");
982: break;
1.62 schwarze 983: case NODE_MML_MFENCED:
1.101 schwarze 984: pnode_printmathfenced(f, n);
1.40 kristaps 985: break;
1.62 schwarze 986: case NODE_MML_MROW:
987: case NODE_MML_MI:
988: case NODE_MML_MN:
989: case NODE_MML_MO:
1.101 schwarze 990: if (TAILQ_EMPTY(&n->childq))
1.43 kristaps 991: break;
992: fputs(" { ", stdout);
1.40 kristaps 993: break;
1.62 schwarze 994: case NODE_MML_MFRAC:
995: case NODE_MML_MSUB:
996: case NODE_MML_MSUP:
1.101 schwarze 997: pnode_printmath(f, n);
1.40 kristaps 998: break;
1.62 schwarze 999: case NODE_OPTION:
1.101 schwarze 1000: macro_open(f, "Fl");
1.1 kristaps 1001: break;
1.62 schwarze 1002: case NODE_ORDEREDLIST:
1.101 schwarze 1003: pnode_printlist(f, n);
1.25 kristaps 1004: break;
1.62 schwarze 1005: case NODE_PARA:
1.101 schwarze 1006: pnode_printpara(f, n);
1.3 kristaps 1007: break;
1.87 schwarze 1008: case NODE_PARAMDEF:
1.62 schwarze 1009: case NODE_PARAMETER:
1.104 schwarze 1010: /* More often, these appear inside NODE_FUNCPROTOTYPE. */
1011: macro_open(f, "Fa");
1012: macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
1.101 schwarze 1013: pnode_unlinksub(n);
1.1 kristaps 1014: break;
1.62 schwarze 1015: case NODE_QUOTE:
1.112 schwarze 1016: if (was_impl)
1017: macro_open(f, "Do");
1018: else {
1019: macro_open(f, "Dq");
1020: f->flags |= FMT_IMPL;
1021: }
1.28 kristaps 1022: break;
1.62 schwarze 1023: case NODE_PROGRAMLISTING:
1024: case NODE_SCREEN:
1.88 schwarze 1025: case NODE_SYNOPSIS:
1.101 schwarze 1026: macro_line(f, "Bd -literal");
1.15 kristaps 1027: break;
1.62 schwarze 1028: case NODE_REFENTRYINFO:
1.15 kristaps 1029: /* Suppress. */
1.101 schwarze 1030: pnode_unlinksub(n);
1.1 kristaps 1031: break;
1.62 schwarze 1032: case NODE_REFNAME:
1.110 schwarze 1033: /* More often, these appear inside NODE_REFNAMEDIV. */
1.101 schwarze 1034: macro_open(f, "Nm");
1.10 kristaps 1035: break;
1.62 schwarze 1036: case NODE_REFNAMEDIV:
1.110 schwarze 1037: pnode_printrefnamediv(f, n);
1.1 kristaps 1038: break;
1.62 schwarze 1039: case NODE_REFPURPOSE:
1.101 schwarze 1040: macro_open(f, "Nd");
1.10 kristaps 1041: break;
1.62 schwarze 1042: case NODE_REFSYNOPSISDIV:
1.101 schwarze 1043: pnode_printrefsynopsisdiv(f, n);
1.1 kristaps 1044: break;
1.62 schwarze 1045: case NODE_PREFACE:
1046: case NODE_SECTION:
1.100 schwarze 1047: case NODE_APPENDIX:
1048: case NODE_LEGALNOTICE:
1.62 schwarze 1049: case NODE_NOTE:
1050: case NODE_TIP:
1051: case NODE_CAUTION:
1052: case NODE_WARNING:
1.101 schwarze 1053: pnode_printrefsect(f, n);
1.1 kristaps 1054: break;
1.62 schwarze 1055: case NODE_REPLACEABLE:
1.101 schwarze 1056: macro_open(f, "Ar");
1.13 kristaps 1057: break;
1.62 schwarze 1058: case NODE_SBR:
1.101 schwarze 1059: macro_line(f, "br");
1.25 kristaps 1060: break;
1.62 schwarze 1061: case NODE_TEXT:
1.93 schwarze 1062: case NODE_ESCAPE:
1.101 schwarze 1063: pnode_printtext(f, n);
1.1 kristaps 1064: break;
1.82 schwarze 1065: case NODE_TGROUP:
1.101 schwarze 1066: pnode_printtgroup(f, n);
1.82 schwarze 1067: break;
1.62 schwarze 1068: case NODE_TITLE:
1.101 schwarze 1069: pnode_printpara(f, n);
1070: macro_nodeline(f, "Sy", n, 0);
1071: pnode_unlinksub(n);
1.50 schwarze 1072: break;
1.62 schwarze 1073: case NODE_TYPE:
1.101 schwarze 1074: macro_open(f, "Vt");
1.39 kristaps 1075: break;
1.62 schwarze 1076: case NODE_VARIABLELIST:
1.101 schwarze 1077: pnode_printvariablelist(f, n);
1.13 kristaps 1078: break;
1.62 schwarze 1079: case NODE_VARNAME:
1.101 schwarze 1080: macro_open(f, "Va");
1.23 kristaps 1081: break;
1.1 kristaps 1082: default:
1083: break;
1084: }
1085:
1.102 schwarze 1086: TAILQ_FOREACH(nc, &n->childq, child)
1087: pnode_print(f, nc);
1.1 kristaps 1088:
1.101 schwarze 1089: switch (n->node) {
1.115 schwarze 1090: case NODE_EMAIL:
1091: if (was_impl) {
1092: f->flags &= ~FMT_NOSPC;
1093: macro_open(f, "Ac");
1094: } else
1095: f->flags &= ~FMT_IMPL;
1096: break;
1.103 schwarze 1097: case NODE_ESCAPE:
1098: case NODE_TERM:
1099: case NODE_TEXT:
1100: /* Accept more arguments to the previous macro. */
1101: return;
1.62 schwarze 1102: case NODE_INFORMALEQUATION:
1.101 schwarze 1103: macro_line(f, "EN");
1.111 schwarze 1104: macro_line(f, "Ed");
1.40 kristaps 1105: break;
1.62 schwarze 1106: case NODE_INLINEEQUATION:
1.111 schwarze 1107: macro_line(f, "EN");
1.43 kristaps 1108: break;
1.112 schwarze 1109: case NODE_LITERAL:
1.115 schwarze 1110: if (was_impl) {
1111: f->flags &= ~FMT_NOSPC;
1.112 schwarze 1112: macro_open(f, "Sc");
1.115 schwarze 1113: } else
1.112 schwarze 1114: f->flags &= ~FMT_IMPL;
1115: break;
1.91 schwarze 1116: case NODE_MEMBER:
1.102 schwarze 1117: if ((nn = TAILQ_NEXT(n, child)) != NULL &&
1118: nn->node != NODE_MEMBER)
1119: nn = NULL;
1.101 schwarze 1120: switch (f->linestate) {
1.91 schwarze 1121: case LINE_TEXT:
1.102 schwarze 1122: if (nn != NULL)
1.101 schwarze 1123: print_text(f, ",", 0);
1.91 schwarze 1124: break;
1125: case LINE_MACRO:
1.102 schwarze 1126: if (nn != NULL)
1.101 schwarze 1127: macro_addarg(f, ",", ARG_SPACE);
1128: macro_close(f);
1.91 schwarze 1129: break;
1130: case LINE_NEW:
1131: break;
1132: }
1133: break;
1.62 schwarze 1134: case NODE_MML_MROW:
1135: case NODE_MML_MI:
1136: case NODE_MML_MN:
1137: case NODE_MML_MO:
1.101 schwarze 1138: if (TAILQ_EMPTY(&n->childq))
1.43 kristaps 1139: break;
1140: fputs(" } ", stdout);
1.40 kristaps 1141: break;
1.62 schwarze 1142: case NODE_QUOTE:
1.115 schwarze 1143: if (was_impl) {
1144: f->flags &= ~FMT_NOSPC;
1.112 schwarze 1145: macro_open(f, "Dc");
1.115 schwarze 1146: } else
1.112 schwarze 1147: f->flags &= ~FMT_IMPL;
1.52 schwarze 1148: break;
1.62 schwarze 1149: case NODE_PREFACE:
1150: case NODE_SECTION:
1.100 schwarze 1151: case NODE_APPENDIX:
1152: case NODE_LEGALNOTICE:
1.62 schwarze 1153: case NODE_NOTE:
1154: case NODE_TIP:
1155: case NODE_CAUTION:
1156: case NODE_WARNING:
1.101 schwarze 1157: f->level--;
1.12 kristaps 1158: break;
1.98 schwarze 1159: case NODE_BLOCKQUOTE:
1.62 schwarze 1160: case NODE_LITERALLAYOUT:
1161: case NODE_PROGRAMLISTING:
1162: case NODE_SCREEN:
1.88 schwarze 1163: case NODE_SYNOPSIS:
1.101 schwarze 1164: macro_line(f, "Ed");
1.50 schwarze 1165: break;
1.1 kristaps 1166: default:
1167: break;
1168: }
1.103 schwarze 1169: f->flags &= ~FMT_ARG;
1.1 kristaps 1170: }
1171:
1.74 schwarze 1172: void
1.114 schwarze 1173: ptree_print_mdoc(struct ptree *tree)
1.74 schwarze 1174: {
1175: struct format formatter;
1.1 kristaps 1176:
1.74 schwarze 1177: formatter.level = 0;
1178: formatter.linestate = LINE_NEW;
1.116 ! schwarze 1179: pnode_printprologue(&formatter, tree->root);
1.74 schwarze 1180: pnode_print(&formatter, tree->root);
1181: if (formatter.linestate != LINE_NEW)
1182: putchar('\n');
1.1 kristaps 1183: }
CVSweb