Annotation of docbook2mdoc/docbook2mdoc.c, Revision 1.141
1.141 ! schwarze 1: /* $Id: docbook2mdoc.c,v 1.140 2019/04/28 15:32:05 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.139 schwarze 24: #include "xmalloc.h"
1.74 schwarze 25: #include "node.h"
1.75 schwarze 26: #include "macro.h"
1.74 schwarze 27: #include "format.h"
28:
29: /*
30: * The implementation of the mdoc(7) formatter.
31: */
1.12 kristaps 32:
1.74 schwarze 33: static void pnode_print(struct format *, struct pnode *);
1.119 schwarze 34: static void pnode_printrefentry(struct format *, struct pnode *);
1.25 kristaps 35:
1.37 kristaps 36:
1.54 schwarze 37: static void
1.93 schwarze 38: pnode_printtext(struct format *f, struct pnode *n)
39: {
1.94 schwarze 40: struct pnode *nn;
1.93 schwarze 41: char *cp;
1.103 schwarze 42: int accept_arg;
1.93 schwarze 43:
1.103 schwarze 44: cp = n->b;
45: accept_arg = f->flags & FMT_ARG;
1.138 schwarze 46: if (f->linestate == LINE_MACRO && !accept_arg &&
47: (n->flags & NFLAG_SPC) == 0) {
1.103 schwarze 48: for (;;) {
49: if (*cp == '\0')
50: return;
51: if (strchr("!),.:;?]", *cp) == NULL)
52: break;
53: printf(" %c", *cp++);
54: }
55: if (isspace((unsigned char)*cp)) {
56: while (isspace((unsigned char)*cp))
57: cp++;
58: macro_close(f);
59: } else {
60: fputs(" Ns", stdout);
61: f->flags &= FMT_IMPL;
62: accept_arg = 1;
63: }
1.94 schwarze 64: }
1.103 schwarze 65: if (f->linestate == LINE_MACRO && !accept_arg &&
66: (f->flags & (FMT_CHILD | FMT_IMPL)) == 0)
67: macro_close(f);
1.94 schwarze 68:
69: /*
70: * Text preceding a macro without intervening whitespace
71: * requires a .Pf macro.
72: * Set the spacing flag to avoid a redundant .Ns macro.
73: */
74:
75: if (f->linestate != LINE_MACRO &&
1.138 schwarze 76: (nn = TAILQ_NEXT(n, child)) != NULL &&
77: (nn->flags & NFLAG_SPC) == 0) {
1.113 schwarze 78: switch (pnode_class(nn->node)) {
79: case CLASS_LINE:
80: case CLASS_ENCL:
81: macro_open(f, "Pf");
82: accept_arg = 1;
83: f->flags |= FMT_CHILD;
1.138 schwarze 84: nn->flags |= NFLAG_SPC;
1.113 schwarze 85: break;
86: default:
87: break;
88: }
1.93 schwarze 89: }
90:
1.103 schwarze 91: switch (f->linestate) {
1.107 schwarze 92: case LINE_NEW:
93: break;
1.103 schwarze 94: case LINE_TEXT:
1.138 schwarze 95: if (n->flags & NFLAG_SPC) {
96: if (n->flags & NFLAG_LINE &&
97: pnode_class(n->node) == CLASS_TEXT)
1.107 schwarze 98: macro_close(f);
99: else
100: putchar(' ');
1.105 schwarze 101: }
1.103 schwarze 102: break;
103: case LINE_MACRO:
1.136 schwarze 104: if (accept_arg == 0)
105: macro_close(f);
1.138 schwarze 106: else if (n->flags & NFLAG_SPC ||
107: (f->flags & FMT_ARG) == 0 ||
1.136 schwarze 108: (nn = TAILQ_PREV(n, pnodeq, child)) == NULL ||
109: pnode_class(nn->node) != CLASS_TEXT)
1.93 schwarze 110: putchar(' ');
1.103 schwarze 111: break;
1.93 schwarze 112: }
113:
114: if (n->node == NODE_ESCAPE) {
115: fputs(n->b, stdout);
1.107 schwarze 116: if (f->linestate == LINE_NEW)
117: f->linestate = LINE_TEXT;
1.93 schwarze 118: return;
119: }
120:
121: /*
122: * Remove the prefix '-' from <option> elements
123: * because the arguments of .Fl macros do not need it.
124: */
125:
126: if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-')
127: cp++;
128:
1.107 schwarze 129: if (f->linestate == LINE_MACRO)
130: macro_addarg(f, cp, 0);
131: else
132: print_text(f, cp, 0);
1.93 schwarze 133: }
134:
135: static void
1.126 schwarze 136: pnode_printimagedata(struct format *f, struct pnode *n)
137: {
138: const char *cp;
139:
140: if ((cp = pnode_getattr_raw(n, ATTRKEY_FILEREF, NULL)) == NULL)
141: cp = pnode_getattr_raw(n, ATTRKEY_ENTITYREF, NULL);
142: if (cp != NULL) {
143: print_text(f, "[image:", ARG_SPACE);
144: print_text(f, cp, ARG_SPACE);
145: print_text(f, "]", 0);
146: } else
147: print_text(f, "[image]", ARG_SPACE);
148: }
149:
150: static void
1.110 schwarze 151: pnode_printrefnamediv(struct format *f, struct pnode *n)
152: {
153: struct pnode *nc, *nn;
154: int comma;
155:
1.130 schwarze 156: f->parastate = PARA_HAVE;
1.110 schwarze 157: macro_line(f, "Sh NAME");
1.130 schwarze 158: f->parastate = PARA_HAVE;
1.110 schwarze 159: comma = 0;
160: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
161: if (nc->node != NODE_REFNAME)
162: continue;
163: if (comma)
164: macro_addarg(f, ",", ARG_SPACE);
165: macro_open(f, "Nm");
166: macro_addnode(f, nc, ARG_SPACE);
167: pnode_unlink(nc);
168: comma = 1;
169: }
170: macro_close(f);
171: }
172:
1.37 kristaps 173: /*
1.10 kristaps 174: * If the SYNOPSIS macro has a superfluous title, kill it.
1.8 kristaps 175: */
1.1 kristaps 176: static void
1.101 schwarze 177: pnode_printrefsynopsisdiv(struct format *f, struct pnode *n)
1.6 kristaps 178: {
1.101 schwarze 179: struct pnode *nc, *nn;
1.6 kristaps 180:
1.101 schwarze 181: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn)
182: if (nc->node == NODE_TITLE)
183: pnode_unlink(nc);
1.71 schwarze 184:
1.130 schwarze 185: f->parastate = PARA_HAVE;
1.101 schwarze 186: macro_line(f, "Sh SYNOPSIS");
1.130 schwarze 187: f->parastate = PARA_HAVE;
1.6 kristaps 188: }
189:
1.8 kristaps 190: /*
191: * Start a hopefully-named `Sh' section.
192: */
1.6 kristaps 193: static void
1.119 schwarze 194: pnode_printsection(struct format *f, struct pnode *n)
1.1 kristaps 195: {
1.115 schwarze 196: struct pnode *nc, *ncc;
1.52 schwarze 197: const char *title;
198: int flags, level;
199:
1.119 schwarze 200: if (n->parent == NULL) {
201: pnode_printrefentry(f, n);
1.56 schwarze 202: return;
1.119 schwarze 203: }
1.56 schwarze 204:
1.101 schwarze 205: level = ++f->level;
1.72 schwarze 206: flags = ARG_SPACE;
1.121 schwarze 207: switch (n->node) {
208: case NODE_PREFACE:
209: case NODE_SECTION:
210: case NODE_APPENDIX:
211: if (level == 1)
212: flags |= ARG_UPPER;
213: break;
214: case NODE_SIMPLESECT:
215: case NODE_LEGALNOTICE:
216: if (level < 2)
217: level = 2;
218: break;
219: default:
220: if (level < 3)
1.52 schwarze 221: level = 3;
1.121 schwarze 222: break;
1.52 schwarze 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);
1.130 schwarze 261: f->parastate = PARA_HAVE;
1.101 schwarze 262: macro_open(f, "Sh");
1.29 kristaps 263: break;
1.62 schwarze 264: case 2:
1.101 schwarze 265: macro_close(f);
1.130 schwarze 266: f->parastate = PARA_HAVE;
1.101 schwarze 267: macro_open(f, "Ss");
1.29 kristaps 268: break;
1.52 schwarze 269: default:
1.130 schwarze 270: if (f->parastate == PARA_MID)
271: f->parastate = PARA_WANT;
1.101 schwarze 272: macro_open(f, "Sy");
1.29 kristaps 273: break;
274: }
1.20 kristaps 275:
1.115 schwarze 276: if (nc != NULL)
1.101 schwarze 277: macro_addnode(f, nc, flags);
1.115 schwarze 278: else
1.101 schwarze 279: macro_addarg(f, title, flags | ARG_QUOTED);
280: macro_close(f);
1.115 schwarze 281:
282: /*
283: * DocBook has no equivalent for -split mode,
284: * so just switch the default in the AUTHORS section.
285: */
286:
287: if (nc != NULL) {
1.130 schwarze 288: if (level == 1 &&
289: (ncc = TAILQ_FIRST(&nc->childq)) != NULL &&
290: ncc->node == NODE_TEXT &&
1.115 schwarze 291: strcasecmp(ncc->b, "AUTHORS") == 0)
292: macro_line(f, "An -nosplit");
293: pnode_unlink(nc);
294: }
1.130 schwarze 295: f->parastate = level > 2 ? PARA_WANT : PARA_HAVE;
1.1 kristaps 296: }
297:
1.8 kristaps 298: /*
299: * Start a reference, extracting the title and volume.
300: */
1.1 kristaps 301: static void
1.101 schwarze 302: pnode_printciterefentry(struct format *f, struct pnode *n)
1.1 kristaps 303: {
1.101 schwarze 304: struct pnode *nc, *title, *manvol;
1.1 kristaps 305:
306: title = manvol = NULL;
1.101 schwarze 307: TAILQ_FOREACH(nc, &n->childq, child) {
308: if (nc->node == NODE_MANVOLNUM)
309: manvol = nc;
310: else if (nc->node == NODE_REFENTRYTITLE)
311: title = nc;
1.69 schwarze 312: }
1.101 schwarze 313: macro_open(f, "Xr");
1.69 schwarze 314: if (title == NULL)
1.101 schwarze 315: macro_addarg(f, "unknown", ARG_SPACE);
1.69 schwarze 316: else
1.101 schwarze 317: macro_addnode(f, title, ARG_SPACE | ARG_SINGLE);
1.69 schwarze 318: if (manvol == NULL)
1.101 schwarze 319: macro_addarg(f, "1", ARG_SPACE);
1.64 schwarze 320: else
1.101 schwarze 321: macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE);
322: pnode_unlinksub(n);
1.1 kristaps 323: }
324:
1.40 kristaps 325: /*
1.41 kristaps 326: * The <mml:mfenced> node is a little peculiar.
327: * First, it can have arbitrary open and closing tokens, which default
328: * to parentheses.
329: * Second, >1 arguments are separated by commas.
330: */
331: static void
1.101 schwarze 332: pnode_printmathfenced(struct format *f, struct pnode *n)
1.41 kristaps 333: {
1.101 schwarze 334: struct pnode *nc;
1.41 kristaps 335:
1.101 schwarze 336: printf("left %s ", pnode_getattr_raw(n, ATTRKEY_OPEN, "("));
1.41 kristaps 337:
1.101 schwarze 338: nc = TAILQ_FIRST(&n->childq);
339: pnode_print(f, nc);
1.41 kristaps 340:
1.101 schwarze 341: while ((nc = TAILQ_NEXT(nc, child)) != NULL) {
1.41 kristaps 342: putchar(',');
1.101 schwarze 343: pnode_print(f, nc);
1.41 kristaps 344: }
1.101 schwarze 345: printf("right %s ", pnode_getattr_raw(n, ATTRKEY_CLOSE, ")"));
346: pnode_unlinksub(n);
1.41 kristaps 347: }
348:
349: /*
1.40 kristaps 350: * These math nodes require special handling because they have infix
351: * syntax, instead of the usual prefix or prefix.
352: * So we need to break up the first and second child node with a
353: * particular eqn(7) word.
354: */
355: static void
1.101 schwarze 356: pnode_printmath(struct format *f, struct pnode *n)
1.40 kristaps 357: {
1.101 schwarze 358: struct pnode *nc;
1.40 kristaps 359:
1.101 schwarze 360: nc = TAILQ_FIRST(&n->childq);
361: pnode_print(f, nc);
1.40 kristaps 362:
1.101 schwarze 363: switch (n->node) {
1.62 schwarze 364: case NODE_MML_MSUP:
1.42 kristaps 365: fputs(" sup ", stdout);
1.40 kristaps 366: break;
1.62 schwarze 367: case NODE_MML_MFRAC:
1.42 kristaps 368: fputs(" over ", stdout);
1.40 kristaps 369: break;
1.62 schwarze 370: case NODE_MML_MSUB:
1.42 kristaps 371: fputs(" sub ", stdout);
1.40 kristaps 372: break;
373: default:
374: break;
375: }
376:
1.101 schwarze 377: nc = TAILQ_NEXT(nc, child);
378: pnode_print(f, nc);
379: pnode_unlinksub(n);
1.40 kristaps 380: }
381:
1.3 kristaps 382: static void
1.101 schwarze 383: pnode_printfuncprototype(struct format *f, struct pnode *n)
1.3 kristaps 384: {
1.132 schwarze 385: struct pnode *fdef, *ftype, *nc, *nn;
1.3 kristaps 386:
1.132 schwarze 387: /*
388: * Extract <funcdef> child and ignore <void> child.
389: * Leave other children in place, to be treated as parameters.
390: */
391:
392: fdef = NULL;
393: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
394: switch (nc->node) {
395: case NODE_FUNCDEF:
396: if (fdef == NULL) {
397: fdef = nc;
398: TAILQ_REMOVE(&n->childq, nc, child);
399: nc->parent = NULL;
400: }
401: break;
402: case NODE_VOID:
403: pnode_unlink(nc);
1.3 kristaps 404: break;
1.132 schwarze 405: default:
406: break;
407: }
408: }
1.3 kristaps 409:
1.132 schwarze 410: /*
411: * If no children are left, the function is void; use .Fn.
412: * Otherwise, use .Fo.
413: */
414:
415: nc = TAILQ_FIRST(&n->childq);
1.86 schwarze 416: if (fdef != NULL) {
1.132 schwarze 417: ftype = TAILQ_FIRST(&fdef->childq);
418: if (ftype != NULL && ftype->node == NODE_TEXT) {
419: macro_argline(f, "Ft", ftype->b);
420: pnode_unlink(ftype);
421: }
422: if (nc == NULL) {
423: macro_open(f, "Fn");
424: macro_addnode(f, fdef, ARG_SPACE | ARG_SINGLE);
425: macro_addarg(f, "void", ARG_SPACE);
426: macro_close(f);
427: } else
428: macro_nodeline(f, "Fo", fdef, ARG_SINGLE);
1.86 schwarze 429: pnode_unlink(fdef);
1.132 schwarze 430: } else if (nc == NULL)
431: macro_line(f, "Fn UNKNOWN void");
432: else
1.101 schwarze 433: macro_line(f, "Fo UNKNOWN");
1.3 kristaps 434:
1.132 schwarze 435: if (nc == NULL)
436: return;
437:
438: while (nc != NULL) {
1.101 schwarze 439: macro_nodeline(f, "Fa", nc, ARG_SINGLE);
1.132 schwarze 440: pnode_unlink(nc);
441: nc = TAILQ_FIRST(&n->childq);
442: }
1.101 schwarze 443: macro_line(f, "Fc");
1.3 kristaps 444: }
445:
1.44 schwarze 446: /*
1.10 kristaps 447: * The <arg> element is more complicated than it should be because text
448: * nodes are treated like ".Ar foo", but non-text nodes need to be
449: * re-sent into the printer (i.e., without the preceding ".Ar").
1.12 kristaps 450: * This also handles the case of "repetition" (or in other words, the
451: * ellipsis following an argument) and optionality.
1.10 kristaps 452: */
1.4 kristaps 453: static void
1.101 schwarze 454: pnode_printarg(struct format *f, struct pnode *n)
1.4 kristaps 455: {
1.101 schwarze 456: struct pnode *nc;
457: struct pattr *a;
1.103 schwarze 458: int isop, isrep, was_impl;
1.12 kristaps 459:
460: isop = 1;
1.103 schwarze 461: isrep = was_impl = 0;
1.101 schwarze 462: TAILQ_FOREACH(a, &n->attrq, child) {
463: if (a->key == ATTRKEY_CHOICE &&
464: (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ))
1.12 kristaps 465: isop = 0;
1.101 schwarze 466: else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT)
1.12 kristaps 467: isrep = 1;
468: }
1.103 schwarze 469: if (isop) {
470: if (f->flags & FMT_IMPL) {
471: was_impl = 1;
472: macro_open(f, "Oo");
473: } else {
474: macro_open(f, "Op");
475: f->flags |= FMT_IMPL;
476: }
477: }
1.101 schwarze 478: TAILQ_FOREACH(nc, &n->childq, child) {
479: if (nc->node == NODE_TEXT)
480: macro_open(f, "Ar");
481: pnode_print(f, nc);
1.10 kristaps 482: }
1.117 schwarze 483: if (isrep && f->linestate == LINE_MACRO)
484: macro_addarg(f, "...", ARG_SPACE);
1.103 schwarze 485: if (isop) {
486: if (was_impl)
487: macro_open(f, "Oc");
488: else
489: f->flags &= ~FMT_IMPL;
490: }
1.101 schwarze 491: pnode_unlinksub(n);
1.4 kristaps 492: }
493:
1.24 kristaps 494: static void
1.101 schwarze 495: pnode_printgroup(struct format *f, struct pnode *n)
1.24 kristaps 496: {
1.117 schwarze 497: struct pnode *nc;
1.101 schwarze 498: struct pattr *a;
1.117 schwarze 499: int bar, isop, isrep, was_impl;
1.24 kristaps 500:
501: isop = 1;
1.117 schwarze 502: isrep = was_impl = 0;
503: TAILQ_FOREACH(a, &n->attrq, child) {
1.101 schwarze 504: if (a->key == ATTRKEY_CHOICE &&
1.117 schwarze 505: (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ))
1.24 kristaps 506: isop = 0;
1.117 schwarze 507: else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT)
508: isrep = 1;
509: }
510: if (isop) {
511: if (f->flags & FMT_IMPL) {
512: was_impl = 1;
513: macro_open(f, "Oo");
514: } else {
515: macro_open(f, "Op");
516: f->flags |= FMT_IMPL;
517: }
518: } else if (isrep) {
519: if (f->flags & FMT_IMPL) {
520: was_impl = 1;
521: macro_open(f, "Bro");
522: } else {
523: macro_open(f, "Brq");
524: f->flags |= FMT_IMPL;
1.24 kristaps 525: }
1.117 schwarze 526: }
527: bar = 0;
1.101 schwarze 528: TAILQ_FOREACH(nc, &n->childq, child) {
1.117 schwarze 529: if (bar && f->linestate == LINE_MACRO)
530: macro_addarg(f, "|", ARG_SPACE);
1.101 schwarze 531: pnode_print(f, nc);
1.117 schwarze 532: bar = 1;
533: }
534: if (isop) {
535: if (was_impl)
536: macro_open(f, "Oc");
537: else
538: f->flags &= ~FMT_IMPL;
539: } else if (isrep) {
540: if (was_impl)
541: macro_open(f, "Brc");
542: else
543: f->flags &= ~FMT_IMPL;
1.24 kristaps 544: }
1.117 schwarze 545: if (isrep && f->linestate == LINE_MACRO)
546: macro_addarg(f, "...", ARG_SPACE);
1.101 schwarze 547: pnode_unlinksub(n);
1.24 kristaps 548: }
549:
1.7 kristaps 550: static void
1.118 schwarze 551: pnode_printsystemitem(struct format *f, struct pnode *n)
552: {
553: switch (pnode_getattr(n, ATTRKEY_CLASS)) {
554: case ATTRVAL_IPADDRESS:
555: break;
556: case ATTRVAL_SYSTEMNAME:
557: macro_open(f, "Pa");
558: break;
559: case ATTRVAL_EVENT:
560: default:
561: macro_open(f, "Sy");
562: break;
563: }
564: }
565:
566: static void
1.78 schwarze 567: pnode_printauthor(struct format *f, struct pnode *n)
568: {
1.101 schwarze 569: struct pnode *nc, *nn;
1.78 schwarze 570: int have_contrib, have_name;
571:
572: /*
573: * Print <contrib> children up front, before the .An scope,
574: * and figure out whether we a name of a person.
575: */
576:
577: have_contrib = have_name = 0;
1.101 schwarze 578: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.78 schwarze 579: switch (nc->node) {
580: case NODE_CONTRIB:
581: if (have_contrib)
582: print_text(f, ",", 0);
583: print_textnode(f, nc);
584: pnode_unlink(nc);
585: have_contrib = 1;
586: break;
587: case NODE_PERSONNAME:
588: have_name = 1;
589: break;
590: default:
591: break;
592: }
593: }
594: if (TAILQ_FIRST(&n->childq) == NULL)
595: return;
596:
597: if (have_contrib)
598: print_text(f, ":", 0);
599:
600: /*
601: * If we have a name, print it in the .An scope and leave
602: * all other content for child handlers, to print after the
603: * scope. Otherwise, print everything in the scope.
604: */
605:
606: macro_open(f, "An");
1.101 schwarze 607: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.78 schwarze 608: if (nc->node == NODE_PERSONNAME || have_name == 0) {
609: macro_addnode(f, nc, ARG_SPACE);
610: pnode_unlink(nc);
611: }
1.80 schwarze 612: }
613:
614: /*
615: * If there is an email address,
616: * print it on the same macro line.
617: */
618:
619: if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) {
1.103 schwarze 620: f->flags |= FMT_CHILD;
1.115 schwarze 621: macro_open(f, "Aq Mt");
622: macro_addnode(f, nc, ARG_SPACE);
1.80 schwarze 623: pnode_unlink(nc);
1.78 schwarze 624: }
625:
626: /*
627: * If there are still unprinted children, end the scope
628: * with a comma. Otherwise, leave the scope open in case
629: * a text node follows that starts with closing punctuation.
630: */
631:
632: if (TAILQ_FIRST(&n->childq) != NULL) {
633: macro_addarg(f, ",", ARG_SPACE);
634: macro_close(f);
635: }
636: }
637:
638: static void
1.129 schwarze 639: pnode_printxref(struct format *f, struct pnode *n)
640: {
641: const char *linkend;
642:
643: linkend = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL);
644: if (linkend != NULL) {
645: macro_open(f, "Sx");
646: macro_addarg(f, linkend, ARG_SPACE);
647: }
648: }
649:
650: static void
1.96 schwarze 651: pnode_printlink(struct format *f, struct pnode *n)
652: {
1.109 schwarze 653: struct pnode *nc;
1.96 schwarze 654: const char *uri, *text;
655:
656: uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL);
657: if (uri != NULL) {
658: if (TAILQ_FIRST(&n->childq) != NULL) {
1.109 schwarze 659: TAILQ_FOREACH(nc, &n->childq, child)
660: pnode_print(f, nc);
1.96 schwarze 661: text = "";
1.109 schwarze 662: } else if ((text = pnode_getattr_raw(n,
663: ATTRKEY_ENDTERM, NULL)) != NULL) {
664: if (f->linestate == LINE_MACRO && f->flags & FMT_ARG)
665: macro_addarg(f, text, ARG_SPACE);
666: else
1.96 schwarze 667: print_text(f, text, ARG_SPACE);
668: }
1.103 schwarze 669: if (text != NULL) {
1.109 schwarze 670: if (f->flags & FMT_IMPL)
671: macro_open(f, "Po");
672: else {
673: macro_open(f, "Pq");
674: f->flags |= FMT_CHILD;
675: }
1.103 schwarze 676: }
1.96 schwarze 677: macro_open(f, "Sx");
678: macro_addarg(f, uri, ARG_SPACE);
1.109 schwarze 679: if (text != NULL && f->flags & FMT_IMPL)
680: macro_open(f, "Pc");
1.96 schwarze 681: pnode_unlinksub(n);
682: return;
683: }
684: uri = pnode_getattr_raw(n, ATTRKEY_XLINK_HREF, NULL);
685: if (uri == NULL)
686: uri = pnode_getattr_raw(n, ATTRKEY_URL, NULL);
687: if (uri != NULL) {
688: macro_open(f, "Lk");
689: macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE);
690: if (TAILQ_FIRST(&n->childq) != NULL)
691: macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
692: pnode_unlinksub(n);
1.128 schwarze 693: }
694: }
695:
696: static void
697: pnode_printolink(struct format *f, struct pnode *n)
698: {
699: const char *uri, *ptr, *local;
700:
701: uri = pnode_getattr_raw(n, ATTRKEY_TARGETDOC, NULL);
702: ptr = pnode_getattr_raw(n, ATTRKEY_TARGETPTR, NULL);
703: local = pnode_getattr_raw(n, ATTRKEY_LOCALINFO, NULL);
704: if (uri == NULL) {
705: uri = ptr;
706: ptr = NULL;
707: }
708: if (uri == NULL) {
709: uri = local;
710: local = NULL;
711: }
712: if (uri == NULL)
1.96 schwarze 713: return;
1.128 schwarze 714:
715: macro_open(f, "Lk");
716: macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE);
717: macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
718: if (ptr != NULL || local != NULL) {
719: macro_close(f);
720: macro_open(f, "Pq");
721: if (ptr != NULL)
722: macro_addarg(f, ptr, ARG_SPACE);
723: if (local != NULL)
724: macro_addarg(f, local, ARG_SPACE);
1.96 schwarze 725: }
1.128 schwarze 726: pnode_unlinksub(n);
1.96 schwarze 727: }
728:
729: static void
1.116 schwarze 730: pnode_printprologue(struct format *f, struct pnode *root)
1.7 kristaps 731: {
1.141 ! schwarze 732: struct pnode *name, *nc;
1.7 kristaps 733:
1.141 ! schwarze 734: nc = TAILQ_FIRST(&root->childq);
! 735: assert(nc->node == NODE_DATE);
! 736: macro_nodeline(f, "Dd", nc, 0);
! 737: pnode_unlink(nc);
1.116 schwarze 738:
739: macro_open(f, "Dt");
1.141 ! schwarze 740: name = TAILQ_FIRST(&root->childq);
! 741: assert(name->node == NODE_REFENTRYTITLE);
! 742: macro_addnode(f, name, ARG_SPACE | ARG_SINGLE | ARG_UPPER);
! 743: TAILQ_REMOVE(&root->childq, name, child);
! 744: name->parent = NULL;
! 745: nc = TAILQ_FIRST(&root->childq);
! 746: assert (nc->node == NODE_MANVOLNUM);
! 747: macro_addnode(f, nc, ARG_SPACE | ARG_SINGLE);
! 748: pnode_unlink(nc);
1.116 schwarze 749:
1.101 schwarze 750: macro_line(f, "Os");
1.116 schwarze 751:
1.141 ! schwarze 752: nc = TAILQ_FIRST(&root->childq);
! 753: if (nc != NULL && nc->node == NODE_TITLE) {
1.116 schwarze 754: macro_line(f, "Sh NAME");
1.141 ! schwarze 755: macro_nodeline(f, "Nm", name, ARG_SINGLE);
! 756: macro_nodeline(f, "Nd", nc, 0);
! 757: pnode_unlink(nc);
1.116 schwarze 758: }
1.119 schwarze 759: pnode_unlink(name);
1.130 schwarze 760: f->parastate = PARA_HAVE;
1.7 kristaps 761: }
762:
1.119 schwarze 763: static void
764: pnode_printrefentry(struct format *f, struct pnode *n)
765: {
766: struct pnode *info, *meta, *nc, *title;
767: struct pnode *match, *later;
768:
769: /* Collect nodes that remained behind when writing the prologue. */
770:
771: meta = NULL;
772: info = pnode_takefirst(n, NODE_BOOKINFO);
773: if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) {
774: pnode_unlink(info);
775: info = NULL;
776: }
777: if (info == NULL) {
778: info = pnode_takefirst(n, NODE_REFENTRYINFO);
779: if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) {
780: pnode_unlink(info);
781: info = NULL;
782: }
1.134 schwarze 783: if (info == NULL)
784: info = pnode_takefirst(n, NODE_INFO);
1.119 schwarze 785: meta = pnode_takefirst(n, NODE_REFMETA);
786: if (meta != NULL && TAILQ_FIRST(&meta->childq) == NULL) {
787: pnode_unlink(meta);
788: meta = NULL;
789: }
790: }
791: if (info == NULL && meta == NULL)
792: return;
793:
794: /*
795: * Find the best place to put this information.
796: * Use the last existing AUTHORS node, if any.
797: * Otherwise, put it behind all standard sections that
798: * conventionally precede AUTHORS, and also behind any
799: * non-standard sections that follow the last of these,
800: * but before the next standard section.
801: */
802:
803: match = later = NULL;
804: TAILQ_FOREACH(nc, &n->childq, child) {
805: switch (nc->node) {
806: case NODE_REFENTRY:
807: case NODE_REFNAMEDIV:
808: case NODE_REFSYNOPSISDIV:
809: case NODE_PREFACE:
810: later = NULL;
811: continue;
812: case NODE_APPENDIX:
813: case NODE_INDEX:
814: if (later == NULL)
815: later = nc;
816: continue;
817: default:
818: break;
819: }
820: if ((title = pnode_findfirst(nc, NODE_TITLE)) == NULL ||
821: (title = TAILQ_FIRST(&title->childq)) == NULL ||
822: title->node != NODE_TEXT)
823: continue;
824: if (strcasecmp(title->b, "AUTHORS") == 0 ||
825: strcasecmp(title->b, "AUTHOR") == 0)
826: match = nc;
827: else if (strcasecmp(title->b, "NAME") == 0 ||
828: strcasecmp(title->b, "SYNOPSIS") == 0 ||
829: strcasecmp(title->b, "DESCRIPTION") == 0 ||
830: strcasecmp(title->b, "RETURN VALUES") == 0 ||
831: strcasecmp(title->b, "ENVIRONMENT") == 0 ||
832: strcasecmp(title->b, "FILES") == 0 ||
833: strcasecmp(title->b, "EXIT STATUS") == 0 ||
834: strcasecmp(title->b, "EXAMPLES") == 0 ||
835: strcasecmp(title->b, "DIAGNOSTICS") == 0 ||
836: strcasecmp(title->b, "ERRORS") == 0 ||
837: strcasecmp(title->b, "SEE ALSO") == 0 ||
838: strcasecmp(title->b, "STANDARDS") == 0 ||
839: strcasecmp(title->b, "HISTORY") == 0)
840: later = NULL;
841: else if ((strcasecmp(title->b, "CAVEATS") == 0 ||
842: strcasecmp(title->b, "BUGS") == 0) &&
843: later == NULL)
844: later = nc;
845: }
846:
847: /*
848: * If no AUTHORS section was found, create one from scratch,
849: * and insert that at the place selected earlier.
850: */
851:
852: if (match == NULL) {
1.139 schwarze 853: match = xcalloc(1, sizeof(*match));
1.119 schwarze 854: match->node = NODE_SECTION;
1.138 schwarze 855: match->flags |= NFLAG_SPC;
1.119 schwarze 856: match->parent = n;
857: TAILQ_INIT(&match->childq);
858: TAILQ_INIT(&match->attrq);
1.139 schwarze 859: nc = pnode_alloc(match);
1.119 schwarze 860: nc->node = NODE_TITLE;
1.138 schwarze 861: nc->flags |= NFLAG_SPC;
1.140 schwarze 862: nc = pnode_alloc_text(nc, "AUTHORS");
1.138 schwarze 863: nc->flags |= NFLAG_SPC;
1.119 schwarze 864: if (later == NULL)
865: TAILQ_INSERT_TAIL(&n->childq, match, child);
866: else
867: TAILQ_INSERT_BEFORE(later, match, child);
868: }
869:
870: /*
871: * Dump the stuff excised at the beginning
872: * into this AUTHORS section.
873: */
874:
875: if (info != NULL)
876: TAILQ_INSERT_TAIL(&match->childq, info, child);
877: if (meta != NULL)
878: TAILQ_INSERT_TAIL(&match->childq, meta, child);
879: }
880:
1.42 kristaps 881: /*
882: * We can have multiple <term> elements within a <varlistentry>, which
883: * we should comma-separate as list headers.
884: */
1.13 kristaps 885: static void
1.101 schwarze 886: pnode_printvarlistentry(struct format *f, struct pnode *n)
1.13 kristaps 887: {
1.133 schwarze 888: struct pnode *nc, *nn, *ncc;
889: int comma;
1.13 kristaps 890:
1.101 schwarze 891: macro_open(f, "It");
1.130 schwarze 892: f->parastate = PARA_HAVE;
1.103 schwarze 893: f->flags |= FMT_IMPL;
1.133 schwarze 894: comma = -1;
1.108 schwarze 895: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
1.101 schwarze 896: if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM)
1.69 schwarze 897: continue;
1.133 schwarze 898: if (comma != -1) {
1.108 schwarze 899: switch (f->linestate) {
900: case LINE_NEW:
901: break;
902: case LINE_TEXT:
903: print_text(f, ",", 0);
904: break;
905: case LINE_MACRO:
1.133 schwarze 906: macro_addarg(f, ",", comma);
1.108 schwarze 907: break;
908: }
909: }
1.130 schwarze 910: f->parastate = PARA_HAVE;
1.133 schwarze 911: comma = (ncc = TAILQ_FIRST(&nc->childq)) == NULL ||
912: pnode_class(ncc->node) == CLASS_TEXT ? 0 : ARG_SPACE;
1.101 schwarze 913: pnode_print(f, nc);
1.108 schwarze 914: pnode_unlink(nc);
1.69 schwarze 915: }
1.101 schwarze 916: macro_close(f);
1.130 schwarze 917: f->parastate = PARA_HAVE;
1.108 schwarze 918: while ((nc = TAILQ_FIRST(&n->childq)) != NULL) {
919: pnode_print(f, nc);
920: pnode_unlink(nc);
921: }
922: macro_close(f);
1.130 schwarze 923: f->parastate = PARA_HAVE;
1.71 schwarze 924: }
925:
926: static void
1.101 schwarze 927: pnode_printtitle(struct format *f, struct pnode *n)
1.71 schwarze 928: {
1.101 schwarze 929: struct pnode *nc, *nn;
1.71 schwarze 930:
1.101 schwarze 931: TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
932: if (nc->node == NODE_TITLE) {
1.130 schwarze 933: if (f->parastate == PARA_MID)
934: f->parastate = PARA_WANT;
935: macro_nodeline(f, "Sy", nc, 0);
1.101 schwarze 936: pnode_unlink(nc);
1.71 schwarze 937: }
938: }
1.13 kristaps 939: }
940:
941: static void
1.101 schwarze 942: pnode_printrow(struct format *f, struct pnode *n)
1.25 kristaps 943: {
1.101 schwarze 944: struct pnode *nc;
1.25 kristaps 945:
1.101 schwarze 946: macro_line(f, "Bl -dash -compact");
947: TAILQ_FOREACH(nc, &n->childq, child) {
948: macro_line(f, "It");
949: pnode_print(f, nc);
1.25 kristaps 950: }
1.101 schwarze 951: macro_line(f, "El");
952: pnode_unlink(n);
1.25 kristaps 953: }
954:
955: static void
1.83 schwarze 956: pnode_printtgroup1(struct format *f, struct pnode *n)
1.16 kristaps 957: {
1.82 schwarze 958: struct pnode *nc;
959:
1.83 schwarze 960: macro_line(f, "Bl -bullet -compact");
1.82 schwarze 961: while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) {
1.83 schwarze 962: macro_line(f, "It");
1.130 schwarze 963: f->parastate = PARA_HAVE;
1.83 schwarze 964: pnode_print(f, nc);
1.130 schwarze 965: f->parastate = PARA_HAVE;
1.82 schwarze 966: pnode_unlink(nc);
967: }
1.83 schwarze 968: macro_line(f, "El");
969: pnode_unlinksub(n);
970: }
971:
972: static void
973: pnode_printtgroup2(struct format *f, struct pnode *n)
974: {
975: struct pnode *nr, *ne;
976:
1.130 schwarze 977: f->parastate = PARA_HAVE;
1.83 schwarze 978: macro_line(f, "Bl -tag -width Ds");
979: while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) {
980: if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL)
981: break;
982: macro_open(f, "It");
1.103 schwarze 983: f->flags |= FMT_IMPL;
1.130 schwarze 984: f->parastate = PARA_HAVE;
1.83 schwarze 985: pnode_print(f, ne);
1.84 schwarze 986: macro_close(f);
1.83 schwarze 987: pnode_unlink(ne);
1.130 schwarze 988: f->parastate = PARA_HAVE;
1.83 schwarze 989: pnode_print(f, nr);
1.130 schwarze 990: f->parastate = PARA_HAVE;
1.83 schwarze 991: pnode_unlink(nr);
992: }
993: macro_line(f, "El");
1.135 schwarze 994: f->parastate = PARA_WANT;
1.82 schwarze 995: pnode_unlinksub(n);
996: }
997:
998: static void
1.83 schwarze 999: pnode_printtgroup(struct format *f, struct pnode *n)
1.82 schwarze 1000: {
1001: struct pnode *nc;
1002:
1003: switch (atoi(pnode_getattr_raw(n, ATTRKEY_COLS, "0"))) {
1004: case 1:
1.83 schwarze 1005: pnode_printtgroup1(f, n);
1006: return;
1007: case 2:
1008: pnode_printtgroup2(f, n);
1.82 schwarze 1009: return;
1010: default:
1011: break;
1012: }
1.16 kristaps 1013:
1.130 schwarze 1014: f->parastate = PARA_HAVE;
1.83 schwarze 1015: macro_line(f, "Bl -ohang");
1.82 schwarze 1016: while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) {
1.83 schwarze 1017: macro_line(f, "It Table Row");
1018: pnode_printrow(f, nc);
1.25 kristaps 1019: }
1.83 schwarze 1020: macro_line(f, "El");
1.135 schwarze 1021: f->parastate = PARA_WANT;
1.82 schwarze 1022: pnode_unlinksub(n);
1.25 kristaps 1023: }
1024:
1025: static void
1.101 schwarze 1026: pnode_printlist(struct format *f, struct pnode *n)
1.25 kristaps 1027: {
1.101 schwarze 1028: struct pnode *nc;
1.16 kristaps 1029:
1.101 schwarze 1030: pnode_printtitle(f, n);
1.130 schwarze 1031: f->parastate = PARA_HAVE;
1.101 schwarze 1032: macro_argline(f, "Bl",
1033: n->node == NODE_ORDEREDLIST ? "-enum" : "-bullet");
1034: TAILQ_FOREACH(nc, &n->childq, child) {
1035: macro_line(f, "It");
1.130 schwarze 1036: f->parastate = PARA_HAVE;
1.101 schwarze 1037: pnode_print(f, nc);
1.130 schwarze 1038: f->parastate = PARA_HAVE;
1.16 kristaps 1039: }
1.101 schwarze 1040: macro_line(f, "El");
1.135 schwarze 1041: f->parastate = PARA_WANT;
1.101 schwarze 1042: pnode_unlinksub(n);
1.16 kristaps 1043: }
1044:
1045: static void
1.101 schwarze 1046: pnode_printvariablelist(struct format *f, struct pnode *n)
1.13 kristaps 1047: {
1.101 schwarze 1048: struct pnode *nc;
1.13 kristaps 1049:
1.101 schwarze 1050: pnode_printtitle(f, n);
1.130 schwarze 1051: f->parastate = PARA_HAVE;
1.101 schwarze 1052: macro_line(f, "Bl -tag -width Ds");
1053: TAILQ_FOREACH(nc, &n->childq, child) {
1054: if (nc->node == NODE_VARLISTENTRY)
1055: pnode_printvarlistentry(f, nc);
1.69 schwarze 1056: else
1.101 schwarze 1057: macro_nodeline(f, "It", nc, 0);
1.69 schwarze 1058: }
1.101 schwarze 1059: macro_line(f, "El");
1.135 schwarze 1060: f->parastate = PARA_WANT;
1.101 schwarze 1061: pnode_unlinksub(n);
1.13 kristaps 1062: }
1063:
1.1 kristaps 1064: /*
1065: * Print a parsed node (or ignore it--whatever).
1066: * This is a recursive function.
1.23 kristaps 1067: * FIXME: if we're in a literal context (<screen> or <programlisting> or
1068: * whatever), don't print inline macros.
1.1 kristaps 1069: */
1070: static void
1.101 schwarze 1071: pnode_print(struct format *f, struct pnode *n)
1.1 kristaps 1072: {
1.102 schwarze 1073: struct pnode *nc, *nn;
1.112 schwarze 1074: int was_impl;
1.1 kristaps 1075:
1.101 schwarze 1076: if (n == NULL)
1.1 kristaps 1077: return;
1078:
1.112 schwarze 1079: was_impl = f->flags & FMT_IMPL;
1.138 schwarze 1080: if (n->flags & NFLAG_SPC)
1.103 schwarze 1081: f->flags &= ~FMT_NOSPC;
1082: else
1083: f->flags |= FMT_NOSPC;
1.1 kristaps 1084:
1.101 schwarze 1085: switch (n->node) {
1.62 schwarze 1086: case NODE_ARG:
1.101 schwarze 1087: pnode_printarg(f, n);
1.4 kristaps 1088: break;
1.62 schwarze 1089: case NODE_AUTHOR:
1.101 schwarze 1090: pnode_printauthor(f, n);
1.50 schwarze 1091: break;
1.62 schwarze 1092: case NODE_AUTHORGROUP:
1.101 schwarze 1093: macro_line(f, "An -split");
1.50 schwarze 1094: break;
1.98 schwarze 1095: case NODE_BLOCKQUOTE:
1.130 schwarze 1096: f->parastate = PARA_HAVE;
1.101 schwarze 1097: macro_line(f, "Bd -ragged -offset indent");
1.130 schwarze 1098: f->parastate = PARA_HAVE;
1.98 schwarze 1099: break;
1.62 schwarze 1100: case NODE_CITEREFENTRY:
1.101 schwarze 1101: pnode_printciterefentry(f, n);
1.1 kristaps 1102: break;
1.68 schwarze 1103: case NODE_CITETITLE:
1.101 schwarze 1104: macro_open(f, "%T");
1.68 schwarze 1105: break;
1.62 schwarze 1106: case NODE_COMMAND:
1.101 schwarze 1107: macro_open(f, "Nm");
1.13 kristaps 1108: break;
1.62 schwarze 1109: case NODE_CONSTANT:
1.101 schwarze 1110: macro_open(f, "Dv");
1.33 kristaps 1111: break;
1.121 schwarze 1112: case NODE_COPYRIGHT:
1113: print_text(f, "Copyright", ARG_SPACE);
1114: fputs(" \\(co", stdout);
1115: break;
1.62 schwarze 1116: case NODE_EDITOR:
1.101 schwarze 1117: print_text(f, "editor:", ARG_SPACE);
1.121 schwarze 1118: pnode_printauthor(f, n);
1.50 schwarze 1119: break;
1.65 schwarze 1120: case NODE_EMAIL:
1.115 schwarze 1121: if (was_impl)
1122: macro_open(f, "Ao Mt");
1123: else {
1124: macro_open(f, "Aq Mt");
1125: f->flags |= FMT_IMPL;
1126: }
1.65 schwarze 1127: break;
1.62 schwarze 1128: case NODE_EMPHASIS:
1129: case NODE_FIRSTTERM:
1.99 schwarze 1130: case NODE_GLOSSTERM:
1.123 schwarze 1131: if ((nc = TAILQ_FIRST(&n->childq)) != NULL &&
1132: pnode_class(nc->node) < CLASS_LINE)
1133: macro_open(f, "Em");
1.130 schwarze 1134: if (n->node == NODE_GLOSSTERM)
1135: f->parastate = PARA_HAVE;
1.1 kristaps 1136: break;
1.62 schwarze 1137: case NODE_ENVAR:
1.101 schwarze 1138: macro_open(f, "Ev");
1.79 schwarze 1139: break;
1.90 schwarze 1140: case NODE_ERRORNAME:
1.101 schwarze 1141: macro_open(f, "Er");
1.90 schwarze 1142: break;
1.62 schwarze 1143: case NODE_FILENAME:
1.101 schwarze 1144: macro_open(f, "Pa");
1.17 kristaps 1145: break;
1.125 schwarze 1146: case NODE_FOOTNOTE:
1147: macro_line(f, "Bo");
1.130 schwarze 1148: f->parastate = PARA_HAVE;
1.125 schwarze 1149: break;
1.62 schwarze 1150: case NODE_FUNCTION:
1.101 schwarze 1151: macro_open(f, "Fn");
1.3 kristaps 1152: break;
1.62 schwarze 1153: case NODE_FUNCPROTOTYPE:
1.101 schwarze 1154: pnode_printfuncprototype(f, n);
1.3 kristaps 1155: break;
1.62 schwarze 1156: case NODE_FUNCSYNOPSISINFO:
1.101 schwarze 1157: macro_open(f, "Fd");
1.126 schwarze 1158: break;
1159: case NODE_IMAGEDATA:
1160: pnode_printimagedata(f, n);
1.16 kristaps 1161: break;
1.62 schwarze 1162: case NODE_INFORMALEQUATION:
1.130 schwarze 1163: f->parastate = PARA_HAVE;
1.111 schwarze 1164: macro_line(f, "Bd -ragged -offset indent");
1.130 schwarze 1165: f->parastate = PARA_HAVE;
1.111 schwarze 1166: /* FALLTHROUGH */
1167: case NODE_INLINEEQUATION:
1.101 schwarze 1168: macro_line(f, "EQ");
1.43 kristaps 1169: break;
1.62 schwarze 1170: case NODE_ITEMIZEDLIST:
1.101 schwarze 1171: pnode_printlist(f, n);
1.24 kristaps 1172: break;
1.62 schwarze 1173: case NODE_GROUP:
1.101 schwarze 1174: pnode_printgroup(f, n);
1.10 kristaps 1175: break;
1.67 schwarze 1176: case NODE_KEYSYM:
1.131 schwarze 1177: case NODE_PRODUCTNAME:
1.101 schwarze 1178: macro_open(f, "Sy");
1.67 schwarze 1179: break;
1.62 schwarze 1180: case NODE_LINK:
1.101 schwarze 1181: pnode_printlink(f, n);
1.96 schwarze 1182: break;
1.62 schwarze 1183: case NODE_LITERAL:
1.122 schwarze 1184: if (n->parent != NULL && n->parent->node == NODE_QUOTE)
1185: macro_open(f, "Li");
1186: else if (was_impl)
1187: macro_open(f, "So Li");
1.112 schwarze 1188: else {
1189: macro_open(f, "Ql");
1190: f->flags |= FMT_IMPL;
1191: }
1.19 kristaps 1192: break;
1.62 schwarze 1193: case NODE_LITERALLAYOUT:
1.101 schwarze 1194: macro_close(f);
1.130 schwarze 1195: f->parastate = PARA_HAVE;
1.101 schwarze 1196: macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) ==
1.66 schwarze 1197: ATTRVAL_MONOSPACED ? "-literal" : "-unfilled");
1.130 schwarze 1198: f->parastate = PARA_HAVE;
1.60 schwarze 1199: break;
1.106 schwarze 1200: case NODE_MARKUP:
1201: macro_open(f, "Ic");
1202: break;
1.62 schwarze 1203: case NODE_MML_MFENCED:
1.101 schwarze 1204: pnode_printmathfenced(f, n);
1.40 kristaps 1205: break;
1.62 schwarze 1206: case NODE_MML_MROW:
1207: case NODE_MML_MI:
1208: case NODE_MML_MN:
1209: case NODE_MML_MO:
1.101 schwarze 1210: if (TAILQ_EMPTY(&n->childq))
1.43 kristaps 1211: break;
1212: fputs(" { ", stdout);
1.40 kristaps 1213: break;
1.62 schwarze 1214: case NODE_MML_MFRAC:
1215: case NODE_MML_MSUB:
1216: case NODE_MML_MSUP:
1.101 schwarze 1217: pnode_printmath(f, n);
1.128 schwarze 1218: break;
1219: case NODE_OLINK:
1220: pnode_printolink(f, n);
1.40 kristaps 1221: break;
1.62 schwarze 1222: case NODE_OPTION:
1.123 schwarze 1223: if ((nc = TAILQ_FIRST(&n->childq)) != NULL &&
1224: pnode_class(nc->node) < CLASS_LINE)
1225: macro_open(f, "Fl");
1.1 kristaps 1226: break;
1.62 schwarze 1227: case NODE_ORDEREDLIST:
1.101 schwarze 1228: pnode_printlist(f, n);
1.25 kristaps 1229: break;
1.62 schwarze 1230: case NODE_PARA:
1.130 schwarze 1231: if (f->parastate == PARA_MID)
1232: f->parastate = PARA_WANT;
1.3 kristaps 1233: break;
1.87 schwarze 1234: case NODE_PARAMDEF:
1.62 schwarze 1235: case NODE_PARAMETER:
1.104 schwarze 1236: /* More often, these appear inside NODE_FUNCPROTOTYPE. */
1237: macro_open(f, "Fa");
1238: macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
1.101 schwarze 1239: pnode_unlinksub(n);
1.1 kristaps 1240: break;
1.62 schwarze 1241: case NODE_QUOTE:
1.127 schwarze 1242: if ((nc = TAILQ_FIRST(&n->childq)) != NULL &&
1243: nc->node == NODE_FILENAME &&
1244: TAILQ_NEXT(nc, child) == NULL) {
1.138 schwarze 1245: if (n->flags & NFLAG_SPC)
1246: nc->flags |= NFLAG_SPC;
1.127 schwarze 1247: } else if (was_impl)
1.112 schwarze 1248: macro_open(f, "Do");
1249: else {
1250: macro_open(f, "Dq");
1251: f->flags |= FMT_IMPL;
1252: }
1.28 kristaps 1253: break;
1.62 schwarze 1254: case NODE_PROGRAMLISTING:
1255: case NODE_SCREEN:
1.88 schwarze 1256: case NODE_SYNOPSIS:
1.130 schwarze 1257: f->parastate = PARA_HAVE;
1.101 schwarze 1258: macro_line(f, "Bd -literal");
1.130 schwarze 1259: f->parastate = PARA_HAVE;
1.118 schwarze 1260: break;
1261: case NODE_SYSTEMITEM:
1262: pnode_printsystemitem(f, n);
1.15 kristaps 1263: break;
1.119 schwarze 1264: case NODE_REFENTRY:
1265: pnode_printrefentry(f, n);
1.1 kristaps 1266: break;
1.62 schwarze 1267: case NODE_REFNAME:
1.110 schwarze 1268: /* More often, these appear inside NODE_REFNAMEDIV. */
1.101 schwarze 1269: macro_open(f, "Nm");
1.10 kristaps 1270: break;
1.62 schwarze 1271: case NODE_REFNAMEDIV:
1.110 schwarze 1272: pnode_printrefnamediv(f, n);
1.1 kristaps 1273: break;
1.62 schwarze 1274: case NODE_REFPURPOSE:
1.101 schwarze 1275: macro_open(f, "Nd");
1.10 kristaps 1276: break;
1.62 schwarze 1277: case NODE_REFSYNOPSISDIV:
1.101 schwarze 1278: pnode_printrefsynopsisdiv(f, n);
1.1 kristaps 1279: break;
1.62 schwarze 1280: case NODE_PREFACE:
1281: case NODE_SECTION:
1.121 schwarze 1282: case NODE_SIMPLESECT:
1.100 schwarze 1283: case NODE_APPENDIX:
1284: case NODE_LEGALNOTICE:
1.62 schwarze 1285: case NODE_NOTE:
1286: case NODE_TIP:
1287: case NODE_CAUTION:
1288: case NODE_WARNING:
1.119 schwarze 1289: pnode_printsection(f, n);
1.1 kristaps 1290: break;
1.62 schwarze 1291: case NODE_REPLACEABLE:
1.101 schwarze 1292: macro_open(f, "Ar");
1.13 kristaps 1293: break;
1.62 schwarze 1294: case NODE_SBR:
1.130 schwarze 1295: if (f->parastate == PARA_MID)
1296: macro_line(f, "br");
1.124 schwarze 1297: break;
1298: case NODE_SUBSCRIPT:
1299: if (f->linestate == LINE_MACRO)
1300: macro_addarg(f, "_", 0);
1301: else
1302: print_text(f, "_", 0);
1303: if ((nc = TAILQ_FIRST(&n->childq)) != NULL)
1.138 schwarze 1304: nc->flags &= ~(NFLAG_LINE | NFLAG_SPC);
1.124 schwarze 1305: break;
1306: case NODE_SUPERSCRIPT:
1307: fputs("\\(ha", stdout);
1308: if ((nc = TAILQ_FIRST(&n->childq)) != NULL)
1.138 schwarze 1309: nc->flags &= ~(NFLAG_LINE | NFLAG_SPC);
1.25 kristaps 1310: break;
1.62 schwarze 1311: case NODE_TEXT:
1.93 schwarze 1312: case NODE_ESCAPE:
1.101 schwarze 1313: pnode_printtext(f, n);
1.1 kristaps 1314: break;
1.82 schwarze 1315: case NODE_TGROUP:
1.101 schwarze 1316: pnode_printtgroup(f, n);
1.82 schwarze 1317: break;
1.62 schwarze 1318: case NODE_TITLE:
1.121 schwarze 1319: case NODE_SUBTITLE:
1.130 schwarze 1320: if (f->parastate == PARA_MID)
1321: f->parastate = PARA_WANT;
1.101 schwarze 1322: macro_nodeline(f, "Sy", n, 0);
1323: pnode_unlinksub(n);
1.50 schwarze 1324: break;
1.62 schwarze 1325: case NODE_TYPE:
1.101 schwarze 1326: macro_open(f, "Vt");
1.39 kristaps 1327: break;
1.62 schwarze 1328: case NODE_VARIABLELIST:
1.101 schwarze 1329: pnode_printvariablelist(f, n);
1.13 kristaps 1330: break;
1.62 schwarze 1331: case NODE_VARNAME:
1.101 schwarze 1332: macro_open(f, "Va");
1.132 schwarze 1333: break;
1334: case NODE_VOID:
1335: print_text(f, "void", ARG_SPACE);
1.129 schwarze 1336: break;
1337: case NODE_XREF:
1338: pnode_printxref(f, n);
1.23 kristaps 1339: break;
1.1 kristaps 1340: default:
1341: break;
1342: }
1343:
1.102 schwarze 1344: TAILQ_FOREACH(nc, &n->childq, child)
1345: pnode_print(f, nc);
1.1 kristaps 1346:
1.101 schwarze 1347: switch (n->node) {
1.115 schwarze 1348: case NODE_EMAIL:
1349: if (was_impl) {
1350: f->flags &= ~FMT_NOSPC;
1351: macro_open(f, "Ac");
1352: } else
1353: f->flags &= ~FMT_IMPL;
1354: break;
1.103 schwarze 1355: case NODE_ESCAPE:
1356: case NODE_TERM:
1357: case NODE_TEXT:
1358: /* Accept more arguments to the previous macro. */
1359: return;
1.125 schwarze 1360: case NODE_FOOTNOTE:
1.130 schwarze 1361: f->parastate = PARA_HAVE;
1.125 schwarze 1362: macro_line(f, "Bc");
1363: break;
1.130 schwarze 1364: case NODE_GLOSSTERM:
1365: f->parastate = PARA_HAVE;
1366: break;
1.62 schwarze 1367: case NODE_INFORMALEQUATION:
1.101 schwarze 1368: macro_line(f, "EN");
1.111 schwarze 1369: macro_line(f, "Ed");
1.40 kristaps 1370: break;
1.62 schwarze 1371: case NODE_INLINEEQUATION:
1.111 schwarze 1372: macro_line(f, "EN");
1.43 kristaps 1373: break;
1.112 schwarze 1374: case NODE_LITERAL:
1.122 schwarze 1375: if (n->parent != NULL && n->parent->node == NODE_QUOTE)
1376: /* nothing */;
1377: else if (was_impl) {
1.115 schwarze 1378: f->flags &= ~FMT_NOSPC;
1.112 schwarze 1379: macro_open(f, "Sc");
1.115 schwarze 1380: } else
1.112 schwarze 1381: f->flags &= ~FMT_IMPL;
1382: break;
1.91 schwarze 1383: case NODE_MEMBER:
1.102 schwarze 1384: if ((nn = TAILQ_NEXT(n, child)) != NULL &&
1385: nn->node != NODE_MEMBER)
1386: nn = NULL;
1.101 schwarze 1387: switch (f->linestate) {
1.91 schwarze 1388: case LINE_TEXT:
1.102 schwarze 1389: if (nn != NULL)
1.101 schwarze 1390: print_text(f, ",", 0);
1.91 schwarze 1391: break;
1392: case LINE_MACRO:
1.102 schwarze 1393: if (nn != NULL)
1.101 schwarze 1394: macro_addarg(f, ",", ARG_SPACE);
1395: macro_close(f);
1.91 schwarze 1396: break;
1397: case LINE_NEW:
1398: break;
1399: }
1400: break;
1.62 schwarze 1401: case NODE_MML_MROW:
1402: case NODE_MML_MI:
1403: case NODE_MML_MN:
1404: case NODE_MML_MO:
1.101 schwarze 1405: if (TAILQ_EMPTY(&n->childq))
1.43 kristaps 1406: break;
1407: fputs(" } ", stdout);
1.40 kristaps 1408: break;
1.130 schwarze 1409: case NODE_PARA:
1410: if (f->parastate == PARA_MID)
1411: f->parastate = PARA_WANT;
1412: break;
1.62 schwarze 1413: case NODE_QUOTE:
1.127 schwarze 1414: if ((nc = TAILQ_FIRST(&n->childq)) != NULL &&
1415: nc->node == NODE_FILENAME &&
1416: TAILQ_NEXT(nc, child) == NULL)
1417: /* nothing */;
1418: else if (was_impl) {
1.115 schwarze 1419: f->flags &= ~FMT_NOSPC;
1.112 schwarze 1420: macro_open(f, "Dc");
1.115 schwarze 1421: } else
1.112 schwarze 1422: f->flags &= ~FMT_IMPL;
1.52 schwarze 1423: break;
1.62 schwarze 1424: case NODE_PREFACE:
1425: case NODE_SECTION:
1.100 schwarze 1426: case NODE_APPENDIX:
1427: case NODE_LEGALNOTICE:
1.62 schwarze 1428: case NODE_NOTE:
1429: case NODE_TIP:
1430: case NODE_CAUTION:
1431: case NODE_WARNING:
1.101 schwarze 1432: f->level--;
1.12 kristaps 1433: break;
1.98 schwarze 1434: case NODE_BLOCKQUOTE:
1.62 schwarze 1435: case NODE_LITERALLAYOUT:
1436: case NODE_PROGRAMLISTING:
1437: case NODE_SCREEN:
1.88 schwarze 1438: case NODE_SYNOPSIS:
1.130 schwarze 1439: f->parastate = PARA_HAVE;
1.101 schwarze 1440: macro_line(f, "Ed");
1.135 schwarze 1441: f->parastate = PARA_WANT;
1.50 schwarze 1442: break;
1.130 schwarze 1443: case NODE_TITLE:
1444: case NODE_SUBTITLE:
1445: f->parastate = PARA_WANT;
1446: break;
1.1 kristaps 1447: default:
1448: break;
1449: }
1.103 schwarze 1450: f->flags &= ~FMT_ARG;
1.1 kristaps 1451: }
1452:
1.74 schwarze 1453: void
1.114 schwarze 1454: ptree_print_mdoc(struct ptree *tree)
1.74 schwarze 1455: {
1456: struct format formatter;
1.1 kristaps 1457:
1.74 schwarze 1458: formatter.level = 0;
1459: formatter.linestate = LINE_NEW;
1.130 schwarze 1460: formatter.parastate = PARA_HAVE;
1.116 schwarze 1461: pnode_printprologue(&formatter, tree->root);
1.74 schwarze 1462: pnode_print(&formatter, tree->root);
1463: if (formatter.linestate != LINE_NEW)
1464: putchar('\n');
1.1 kristaps 1465: }
CVSweb
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to docbook2mdoc.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [cvsweb.bsd.lv] / docbook2mdoc