Annotation of docbook2mdoc/docbook2mdoc.c, Revision 1.34
1.34 ! kristaps 1: /* $Id: docbook2mdoc.c,v 1.33 2014/04/30 09:26:10 kristaps Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
17: #include <sys/queue.h>
18:
19: #include <assert.h>
20: #include <ctype.h>
21: #include <expat.h>
22: #include <fcntl.h>
23: #include <getopt.h>
24: #include <stdio.h>
25: #include <stdlib.h>
26: #include <string.h>
1.7 kristaps 27: #include <unistd.h>
1.1 kristaps 28:
1.13 kristaps 29: #include "extern.h"
1.12 kristaps 30:
31: /*
1.1 kristaps 32: * Global parse state.
33: * Keep this as simple and small as possible.
34: */
35: struct parse {
1.12 kristaps 36: XML_Parser xml;
1.1 kristaps 37: enum nodeid node; /* current (NODE_ROOT if pre-tree) */
1.12 kristaps 38: const char *fname; /* filename */
1.1 kristaps 39: int stop; /* should we stop now? */
40: struct pnode *root; /* root of parse tree */
41: struct pnode *cur; /* current node in tree */
1.8 kristaps 42: char *b; /* nil-terminated buffer for pre-print */
43: size_t bsz; /* current length of b */
44: size_t mbsz; /* max bsz allocation */
1.10 kristaps 45: int newln; /* output: are we on a fresh line */
1.1 kristaps 46: };
47:
48: struct node {
1.8 kristaps 49: const char *name; /* docbook element name */
1.1 kristaps 50: unsigned int flags;
51: #define NODE_IGNTEXT 1 /* ignore all contained text */
52: };
53:
54: TAILQ_HEAD(pnodeq, pnode);
1.12 kristaps 55: TAILQ_HEAD(pattrq, pattr);
56:
57: struct pattr {
58: enum attrkey key;
59: enum attrval val;
60: char *rawval;
61: TAILQ_ENTRY(pattr) child;
62: };
1.1 kristaps 63:
64: struct pnode {
65: enum nodeid node; /* node type */
66: char *b; /* binary data buffer */
67: size_t bsz; /* data buffer size */
68: struct pnode *parent; /* parent (or NULL if top) */
69: struct pnodeq childq; /* queue of children */
1.12 kristaps 70: struct pattrq attrq; /* attributes of node */
1.1 kristaps 71: TAILQ_ENTRY(pnode) child;
72: };
73:
1.12 kristaps 74: static const char *attrkeys[ATTRKEY__MAX] = {
75: "choice",
76: "id",
77: "rep"
78: };
79:
80: static const char *attrvals[ATTRVAL__MAX] = {
81: "norepeat",
82: "opt",
83: "plain",
84: "repeat",
85: "req"
86: };
87:
1.1 kristaps 88: static const struct node nodes[NODE__MAX] = {
89: { NULL, 0 },
1.21 kristaps 90: { "acronym", 0 },
1.30 kristaps 91: { "anchor", NODE_IGNTEXT },
1.27 kristaps 92: { "application", 0 },
1.4 kristaps 93: { "arg", 0 },
1.29 kristaps 94: { "caution", NODE_IGNTEXT },
1.1 kristaps 95: { "citerefentry", NODE_IGNTEXT },
1.4 kristaps 96: { "cmdsynopsis", NODE_IGNTEXT },
1.1 kristaps 97: { "code", 0 },
1.4 kristaps 98: { "command", 0 },
1.32 kristaps 99: { "constant", 0 },
100: { "copyright", NODE_IGNTEXT },
1.15 kristaps 101: { "date", 0 },
1.13 kristaps 102: { "emphasis", 0 },
1.25 kristaps 103: { "entry", 0 },
1.21 kristaps 104: { "envar", 0 },
1.17 kristaps 105: { "filename", 0 },
1.3 kristaps 106: { "funcdef", 0 },
107: { "funcprototype", NODE_IGNTEXT },
1.1 kristaps 108: { "funcsynopsis", NODE_IGNTEXT },
109: { "funcsynopsisinfo", 0 },
1.3 kristaps 110: { "function", 0 },
1.32 kristaps 111: { "group", NODE_IGNTEXT },
112: { "holder", NODE_IGNTEXT },
113: { "info", NODE_IGNTEXT },
1.16 kristaps 114: { "itemizedlist", NODE_IGNTEXT },
1.14 kristaps 115: { "link", 0 },
1.13 kristaps 116: { "listitem", NODE_IGNTEXT },
1.19 kristaps 117: { "literal", 0 },
1.1 kristaps 118: { "manvolnum", 0 },
1.29 kristaps 119: { "note", NODE_IGNTEXT },
1.4 kristaps 120: { "option", 0 },
1.21 kristaps 121: { "orderedlist", NODE_IGNTEXT },
1.1 kristaps 122: { "para", 0 },
1.3 kristaps 123: { "paramdef", 0 },
124: { "parameter", 0 },
1.1 kristaps 125: { "programlisting", 0 },
1.22 kristaps 126: { "prompt", 0 },
1.28 kristaps 127: { "quote", 0 },
1.1 kristaps 128: { "refclass", NODE_IGNTEXT },
129: { "refdescriptor", NODE_IGNTEXT },
130: { "refentry", NODE_IGNTEXT },
1.15 kristaps 131: { "refentryinfo", NODE_IGNTEXT },
1.1 kristaps 132: { "refentrytitle", 0 },
133: { "refmeta", NODE_IGNTEXT },
134: { "refmiscinfo", NODE_IGNTEXT },
135: { "refname", 0 },
136: { "refnamediv", NODE_IGNTEXT },
137: { "refpurpose", 0 },
1.20 kristaps 138: { "refsect1", NODE_IGNTEXT },
139: { "refsect2", NODE_IGNTEXT },
1.29 kristaps 140: { "refsect3", NODE_IGNTEXT },
141: { "refsection", NODE_IGNTEXT },
1.1 kristaps 142: { "refsynopsisdiv", NODE_IGNTEXT },
1.13 kristaps 143: { "replaceable", 0 },
1.25 kristaps 144: { "row", NODE_IGNTEXT },
1.19 kristaps 145: { "sbr", NODE_IGNTEXT },
1.22 kristaps 146: { "screen", NODE_IGNTEXT },
1.30 kristaps 147: { "sgmltag", 0 },
1.8 kristaps 148: { "structname", 0 },
1.1 kristaps 149: { "synopsis", 0 },
1.25 kristaps 150: { "table", NODE_IGNTEXT },
151: { "tbody", NODE_IGNTEXT },
1.13 kristaps 152: { "term", 0 },
1.1 kristaps 153: { NULL, 0 },
1.25 kristaps 154: { "tfoot", NODE_IGNTEXT },
155: { "tgroup", NODE_IGNTEXT },
156: { "thead", NODE_IGNTEXT },
1.29 kristaps 157: { "tip", NODE_IGNTEXT },
1.1 kristaps 158: { "title", 0 },
1.33 kristaps 159: { "trademark", 0 },
1.14 kristaps 160: { "ulink", 0 },
1.23 kristaps 161: { "userinput", 0 },
1.13 kristaps 162: { "variablelist", NODE_IGNTEXT },
163: { "varlistentry", NODE_IGNTEXT },
1.26 kristaps 164: { "varname", 0 },
1.29 kristaps 165: { "warning", NODE_IGNTEXT },
1.30 kristaps 166: { "wordasword", 0 },
1.32 kristaps 167: { "year", NODE_IGNTEXT },
1.1 kristaps 168: };
169:
1.10 kristaps 170: static void
171: pnode_print(struct parse *p, struct pnode *pn);
172:
1.8 kristaps 173: /*
174: * Process a stream of characters.
175: * We store text as nodes in and of themselves.
176: * If a text node is already open, append to it.
177: * If it's not open, open one under the current context.
178: */
1.1 kristaps 179: static void
180: xml_char(void *arg, const XML_Char *p, int sz)
181: {
182: struct parse *ps = arg;
183: struct pnode *dat;
1.4 kristaps 184: int i;
1.1 kristaps 185:
186: /* Stopped or no tree yet. */
187: if (ps->stop || NODE_ROOT == ps->node)
188: return;
189:
190: /* Not supposed to be collecting text. */
191: assert(NULL != ps->cur);
192: if (NODE_IGNTEXT & nodes[ps->node].flags)
193: return;
194:
195: /*
196: * Are we in the midst of processing text?
197: * If we're not processing text right now, then create a text
198: * node for doing so.
1.4 kristaps 199: * However, don't do so unless we have some non-whitespace to
1.10 kristaps 200: * process: strip out all leading whitespace to be sure.
1.1 kristaps 201: */
202: if (NODE_TEXT != ps->node) {
1.4 kristaps 203: for (i = 0; i < sz; i++)
204: if ( ! isspace((int)p[i]))
205: break;
206: if (i == sz)
207: return;
1.10 kristaps 208: p += i;
209: sz -= i;
1.1 kristaps 210: dat = calloc(1, sizeof(struct pnode));
211: if (NULL == dat) {
212: perror(NULL);
213: exit(EXIT_FAILURE);
214: }
215:
216: dat->node = ps->node = NODE_TEXT;
217: dat->parent = ps->cur;
218: TAILQ_INIT(&dat->childq);
1.12 kristaps 219: TAILQ_INIT(&dat->attrq);
1.1 kristaps 220: TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child);
221: ps->cur = dat;
222: assert(NULL != ps->root);
223: }
224:
225: /* Append to current buffer. */
226: assert(sz >= 0);
227: ps->cur->b = realloc(ps->cur->b,
228: ps->cur->bsz + (size_t)sz);
229: if (NULL == ps->cur->b) {
230: perror(NULL);
231: exit(EXIT_FAILURE);
232: }
233: memcpy(ps->cur->b + ps->cur->bsz, p, sz);
234: ps->cur->bsz += (size_t)sz;
235: }
236:
1.10 kristaps 237: static void
238: pnode_trim(struct pnode *pn)
239: {
240:
241: assert(NODE_TEXT == pn->node);
242: for ( ; pn->bsz > 0; pn->bsz--)
243: if ( ! isspace((int)pn->b[pn->bsz - 1]))
244: break;
245: }
246:
1.1 kristaps 247: /*
248: * Begin an element.
249: * First, look for the element.
250: * If we don't find it and we're not parsing, keep going.
1.8 kristaps 251: * If we don't find it and we're parsing, puke and exit.
1.1 kristaps 252: * If we find it but we're not parsing yet (i.e., it's not a refentry
253: * and thus out of context), keep going.
1.8 kristaps 254: * If we find it and we're at the root and already have a tree, puke and
255: * exit (FIXME: I don't think this is right?).
256: * If we find it but we're parsing a text node, close out the text node,
257: * return to its parent, and keep going.
1.1 kristaps 258: * Make sure that the element is in the right context.
259: * Lastly, put the node onto our parse tree and continue.
260: */
261: static void
262: xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts)
263: {
1.12 kristaps 264: struct parse *ps = arg;
265: enum nodeid node;
266: enum attrkey key;
267: enum attrval val;
268: struct pnode *dat;
269: struct pattr *pattr;
270: const XML_Char **att;
1.1 kristaps 271:
272: if (ps->stop)
273: return;
274:
275: /* Close out text node, if applicable... */
276: if (NODE_TEXT == ps->node) {
277: assert(NULL != ps->cur);
1.10 kristaps 278: pnode_trim(ps->cur);
1.1 kristaps 279: ps->cur = ps->cur->parent;
280: assert(NULL != ps->cur);
281: ps->node = ps->cur->node;
282: }
283:
284: for (node = 0; node < NODE__MAX; node++)
285: if (NULL == nodes[node].name)
286: continue;
287: else if (0 == strcmp(nodes[node].name, name))
288: break;
289:
290: if (NODE__MAX == node && NODE_ROOT == ps->node) {
291: return;
292: } else if (NODE__MAX == node) {
1.12 kristaps 293: fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n",
294: ps->fname, XML_GetCurrentLineNumber(ps->xml),
295: XML_GetCurrentColumnNumber(ps->xml), name);
1.1 kristaps 296: ps->stop = 1;
297: return;
298: } else if (NODE_ROOT == ps->node && NULL != ps->root) {
1.12 kristaps 299: fprintf(stderr, "%s:%zu:%zu: multiple refentries\n",
300: ps->fname, XML_GetCurrentLineNumber(ps->xml),
301: XML_GetCurrentColumnNumber(ps->xml));
1.1 kristaps 302: ps->stop = 1;
303: return;
304: } else if (NODE_ROOT == ps->node && NODE_REFENTRY != node) {
305: return;
306: } else if ( ! isparent(node, ps->node)) {
1.13 kristaps 307: fprintf(stderr, "%s:%zu:%zu: bad parent \"%s\" "
308: "of node \"%s\"\n",
1.12 kristaps 309: ps->fname, XML_GetCurrentLineNumber(ps->xml),
310: XML_GetCurrentColumnNumber(ps->xml),
311: NULL == nodes[ps->node].name ?
1.13 kristaps 312: "(none)" : nodes[ps->node].name,
313: NULL == nodes[node].name ?
314: "(none)" : nodes[node].name);
1.1 kristaps 315: ps->stop = 1;
316: return;
317: }
318:
319: if (NULL == (dat = calloc(1, sizeof(struct pnode)))) {
320: perror(NULL);
321: exit(EXIT_FAILURE);
322: }
323:
324: dat->node = ps->node = node;
325: dat->parent = ps->cur;
326: TAILQ_INIT(&dat->childq);
1.12 kristaps 327: TAILQ_INIT(&dat->attrq);
1.1 kristaps 328:
329: if (NULL != ps->cur)
330: TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child);
331:
332: ps->cur = dat;
333: if (NULL == ps->root)
334: ps->root = dat;
1.12 kristaps 335:
336: /*
337: * Process attributes.
338: */
339: for (att = atts; NULL != *att; att += 2) {
340: for (key = 0; key < ATTRKEY__MAX; key++)
341: if (0 == strcmp(*att, attrkeys[key]))
342: break;
343: if (ATTRKEY__MAX == key) {
1.31 kristaps 344: fprintf(stderr, "%s:%zu:%zu: warning: "
345: "unknown attribute \"%s\"\n",
346: ps->fname,
1.12 kristaps 347: XML_GetCurrentLineNumber(ps->xml),
348: XML_GetCurrentColumnNumber(ps->xml),
349: *att);
350: continue;
351: } else if ( ! isattrkey(node, key)) {
1.31 kristaps 352: fprintf(stderr, "%s:%zu:%zu: warning: "
353: "bad attribute \"%s\"\n",
354: ps->fname,
1.12 kristaps 355: XML_GetCurrentLineNumber(ps->xml),
356: XML_GetCurrentColumnNumber(ps->xml),
357: *att);
358: continue;
359: }
360: for (val = 0; val < ATTRVAL__MAX; val++)
361: if (0 == strcmp(*(att + 1), attrvals[val]))
362: break;
363: if (ATTRVAL__MAX != val && ! isattrval(key, val)) {
1.31 kristaps 364: fprintf(stderr, "%s:%zu:%zu: warning: "
365: "bad attribute value \"%s\"\n",
366: ps->fname,
1.12 kristaps 367: XML_GetCurrentLineNumber(ps->xml),
368: XML_GetCurrentColumnNumber(ps->xml),
369: *(att + 1));
370: continue;
371: }
372: pattr = calloc(1, sizeof(struct pattr));
373: pattr->key = key;
374: pattr->val = val;
375: if (ATTRVAL__MAX == val)
376: pattr->rawval = strdup(*(att + 1));
377: TAILQ_INSERT_TAIL(&dat->attrq, pattr, child);
378: }
379:
1.1 kristaps 380: }
381:
382: /*
383: * Roll up the parse tree.
1.8 kristaps 384: * If we're at a text node, roll that one up first.
1.1 kristaps 385: * If we hit the root, then assign ourselves as the NODE_ROOT.
386: */
387: static void
388: xml_elem_end(void *arg, const XML_Char *name)
389: {
390: struct parse *ps = arg;
391:
392: if (ps->stop || NODE_ROOT == ps->node)
393: return;
394:
395: /* Close out text node, if applicable... */
396: if (NODE_TEXT == ps->node) {
397: assert(NULL != ps->cur);
1.10 kristaps 398: pnode_trim(ps->cur);
1.1 kristaps 399: ps->cur = ps->cur->parent;
400: assert(NULL != ps->cur);
401: ps->node = ps->cur->node;
402: }
403:
404: if (NULL == (ps->cur = ps->cur->parent))
405: ps->node = NODE_ROOT;
406: else
407: ps->node = ps->cur->node;
408: }
409:
1.8 kristaps 410: /*
411: * Recursively free a node (NULL is ok).
412: */
1.1 kristaps 413: static void
414: pnode_free(struct pnode *pn)
415: {
416: struct pnode *pp;
1.12 kristaps 417: struct pattr *ap;
1.1 kristaps 418:
419: if (NULL == pn)
420: return;
421:
422: while (NULL != (pp = TAILQ_FIRST(&pn->childq))) {
423: TAILQ_REMOVE(&pn->childq, pp, child);
424: pnode_free(pp);
425: }
426:
1.12 kristaps 427: while (NULL != (ap = TAILQ_FIRST(&pn->attrq))) {
428: TAILQ_REMOVE(&pn->attrq, ap, child);
429: free(ap->rawval);
430: free(ap);
431: }
432:
1.1 kristaps 433: free(pn->b);
434: free(pn);
435: }
436:
1.8 kristaps 437: /*
438: * Unlink a node from its parent and pnode_free() it.
439: */
1.1 kristaps 440: static void
441: pnode_unlink(struct pnode *pn)
442: {
443:
444: if (NULL != pn->parent)
445: TAILQ_REMOVE(&pn->parent->childq, pn, child);
446: pnode_free(pn);
447: }
448:
1.8 kristaps 449: /*
450: * Unlink all children of a node and pnode_free() them.
451: */
1.1 kristaps 452: static void
1.4 kristaps 453: pnode_unlinksub(struct pnode *pn)
454: {
455:
456: while ( ! TAILQ_EMPTY(&pn->childq))
457: pnode_unlink(TAILQ_FIRST(&pn->childq));
458: }
459:
1.8 kristaps 460: /*
461: * Reset the lookaside buffer.
462: */
1.4 kristaps 463: static void
1.1 kristaps 464: bufclear(struct parse *p)
465: {
466:
467: p->b[p->bsz = 0] = '\0';
468: }
469:
1.8 kristaps 470: /*
471: * Append NODE_TEXT contents to the current buffer, reallocating its
472: * size if necessary.
473: * The buffer is ALWAYS nil-terminated.
474: */
1.1 kristaps 475: static void
476: bufappend(struct parse *p, struct pnode *pn)
477: {
478:
479: assert(NODE_TEXT == pn->node);
480: if (p->bsz + pn->bsz + 1 > p->mbsz) {
481: p->mbsz = p->bsz + pn->bsz + 1;
482: if (NULL == (p->b = realloc(p->b, p->mbsz))) {
483: perror(NULL);
484: exit(EXIT_FAILURE);
485: }
486: }
487: memcpy(p->b + p->bsz, pn->b, pn->bsz);
488: p->bsz += pn->bsz;
489: p->b[p->bsz] = '\0';
490: }
491:
1.8 kristaps 492: /*
493: * Recursively append all NODE_TEXT nodes to the buffer.
494: * This descends into non-text nodes, but doesn't do anything beyond
495: * them.
496: * In other words, this is a recursive text grok.
497: */
1.3 kristaps 498: static void
499: bufappend_r(struct parse *p, struct pnode *pn)
500: {
501: struct pnode *pp;
502:
503: if (NODE_TEXT == pn->node)
504: bufappend(p, pn);
505: TAILQ_FOREACH(pp, &pn->childq, child)
506: bufappend_r(p, pp);
507: }
508:
1.25 kristaps 509: /*
510: * Recursively search and return the first instance of "node".
511: */
512: static struct pnode *
513: pnode_findfirst(struct pnode *pn, enum nodeid node)
514: {
515: struct pnode *pp, *res;
516:
517: res = NULL;
518: TAILQ_FOREACH(pp, &pn->childq, child) {
519: res = pp->node == node ? pp :
520: pnode_findfirst(pp, node);
521: if (NULL != res)
522: break;
523: }
524:
525: return(res);
526: }
527:
1.12 kristaps 528: #define MACROLINE_NORM 0
529: #define MACROLINE_UPPER 1
1.32 kristaps 530: #define MACROLINE_NOWS 2
1.1 kristaps 531: /*
1.8 kristaps 532: * Recursively print text presumably on a macro line.
1.1 kristaps 533: * Convert all whitespace to regular spaces.
534: */
535: static void
1.12 kristaps 536: pnode_printmacrolinetext(struct parse *p, struct pnode *pn, int fl)
1.1 kristaps 537: {
538: char *cp;
539:
1.32 kristaps 540: if (0 == p->newln && ! (MACROLINE_NOWS & fl))
1.13 kristaps 541: putchar(' ');
542:
1.1 kristaps 543: bufclear(p);
1.3 kristaps 544: bufappend_r(p, pn);
1.1 kristaps 545:
546: /* Convert all space to spaces. */
547: for (cp = p->b; '\0' != *cp; cp++)
548: if (isspace((int)*cp))
549: *cp = ' ';
550:
551: for (cp = p->b; isspace((int)*cp); cp++)
1.4 kristaps 552: /* Spin past whitespace (XXX: necessary?) */ ;
1.1 kristaps 553: for ( ; '\0' != *cp; cp++) {
554: /* Escape us if we look like a macro. */
555: if ((cp == p->b || ' ' == *(cp - 1)) &&
556: isupper((int)*cp) &&
557: '\0' != *(cp + 1) &&
558: islower((int)*(cp + 1)) &&
559: ('\0' == *(cp + 2) ||
560: ' ' == *(cp + 2) ||
561: (islower((int)*(cp + 2)) &&
562: ('\0' == *(cp + 3) ||
563: ' ' == *(cp + 3)))))
564: fputs("\\&", stdout);
1.12 kristaps 565: if (MACROLINE_UPPER & fl)
566: putchar(toupper((int)*cp));
567: else
568: putchar((int)*cp);
1.1 kristaps 569: /* If we're a character escape, escape us. */
570: if ('\\' == *cp)
571: putchar('e');
572: }
573: }
574:
1.12 kristaps 575: static void
576: pnode_printmacrolinepart(struct parse *p, struct pnode *pn)
577: {
578:
579: pnode_printmacrolinetext(p, pn, 0);
580: }
581:
1.1 kristaps 582: /*
583: * Just pnode_printmacrolinepart() but with a newline.
584: * If no text, just the newline.
585: */
586: static void
587: pnode_printmacroline(struct parse *p, struct pnode *pn)
588: {
589:
1.13 kristaps 590: assert(0 == p->newln);
1.12 kristaps 591: pnode_printmacrolinetext(p, pn, 0);
1.1 kristaps 592: putchar('\n');
1.13 kristaps 593: p->newln = 1;
1.1 kristaps 594: }
595:
1.10 kristaps 596: static void
597: pnode_printmopen(struct parse *p)
598: {
599: if (p->newln) {
600: putchar('.');
601: p->newln = 0;
602: } else
603: putchar(' ');
604: }
605:
606: static void
607: pnode_printmclose(struct parse *p, int sv)
608: {
609:
610: if (sv && ! p->newln) {
611: putchar('\n');
612: p->newln = 1;
613: }
614: }
615:
1.8 kristaps 616: /*
1.10 kristaps 617: * If the SYNOPSIS macro has a superfluous title, kill it.
1.8 kristaps 618: */
1.1 kristaps 619: static void
1.6 kristaps 620: pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn)
621: {
622: struct pnode *pp;
623:
1.10 kristaps 624: TAILQ_FOREACH(pp, &pn->childq, child)
1.6 kristaps 625: if (NODE_TITLE == pp->node) {
626: pnode_unlink(pp);
1.10 kristaps 627: return;
1.6 kristaps 628: }
629: }
630:
1.8 kristaps 631: /*
632: * Start a hopefully-named `Sh' section.
633: */
1.6 kristaps 634: static void
1.1 kristaps 635: pnode_printrefsect(struct parse *p, struct pnode *pn)
636: {
637: struct pnode *pp;
638:
639: TAILQ_FOREACH(pp, &pn->childq, child)
640: if (NODE_TITLE == pp->node)
641: break;
642:
1.29 kristaps 643: switch (pn->node) {
644: case (NODE_REFSECT1):
1.20 kristaps 645: fputs(".Sh", stdout);
1.29 kristaps 646: break;
647: case (NODE_REFSECT2):
1.20 kristaps 648: fputs(".Ss", stdout);
1.29 kristaps 649: break;
650: case (NODE_REFSECT3):
651: puts(".Pp");
652: fputs(".Sy", stdout);
653: break;
654: case (NODE_NOTE):
655: /* FALLTHROUGH */
656: case (NODE_REFSECTION):
657: /* FALLTHROUGH */
658: case (NODE_TIP):
659: /* FALLTHROUGH */
660: case (NODE_CAUTION):
661: /* FALLTHROUGH */
662: case (NODE_WARNING):
663: puts(".Pp");
664: if (NULL == pp)
665: return;
666: fputs(".Em", stdout);
667: break;
668: default:
669: break;
670: }
1.20 kristaps 671:
1.13 kristaps 672: p->newln = 0;
1.4 kristaps 673:
1.5 kristaps 674: if (NULL != pp) {
1.20 kristaps 675: pnode_printmacrolinetext(p, pp,
676: NODE_REFSECT1 == pn->node ?
677: MACROLINE_UPPER : 0);
1.18 kristaps 678: pnode_printmclose(p, 1);
1.5 kristaps 679: pnode_unlink(pp);
1.13 kristaps 680: } else {
1.29 kristaps 681: puts(NODE_REFSECT1 == pn->node ?
682: "UNKNOWN" : "unknown");
1.13 kristaps 683: p->newln = 1;
684: }
1.1 kristaps 685: }
686:
1.8 kristaps 687: /*
688: * Start a reference, extracting the title and volume.
689: */
1.1 kristaps 690: static void
691: pnode_printciterefentry(struct parse *p, struct pnode *pn)
692: {
693: struct pnode *pp, *title, *manvol;
694:
695: title = manvol = NULL;
696: TAILQ_FOREACH(pp, &pn->childq, child)
697: if (NODE_MANVOLNUM == pp->node)
698: manvol = pp;
699: else if (NODE_REFENTRYTITLE == pp->node)
700: title = pp;
701:
702: if (NULL != title) {
703: pnode_printmacrolinepart(p, title);
704: } else
1.13 kristaps 705: fputs(" unknown ", stdout);
1.4 kristaps 706:
1.13 kristaps 707: if (NULL == manvol) {
708: puts(" 1");
709: p->newln = 1;
710: } else
1.34 ! kristaps 711: pnode_printmacrolinepart(p, manvol);
1.1 kristaps 712: }
713:
714: static void
715: pnode_printrefmeta(struct parse *p, struct pnode *pn)
716: {
717: struct pnode *pp, *title, *manvol;
718:
719: title = manvol = NULL;
1.13 kristaps 720: assert(p->newln);
1.1 kristaps 721: TAILQ_FOREACH(pp, &pn->childq, child)
722: if (NODE_MANVOLNUM == pp->node)
723: manvol = pp;
724: else if (NODE_REFENTRYTITLE == pp->node)
725: title = pp;
726:
1.2 kristaps 727: puts(".Dd $Mdocdate" "$");
1.13 kristaps 728: fputs(".Dt", stdout);
729: p->newln = 0;
1.1 kristaps 730:
1.13 kristaps 731: if (NULL != title)
1.12 kristaps 732: pnode_printmacrolinetext(p, title, MACROLINE_UPPER);
1.13 kristaps 733: else
734: fputs(" UNKNOWN ", stdout);
735:
736: if (NULL == manvol) {
737: puts(" 1");
738: p->newln = 1;
1.1 kristaps 739: } else
740: pnode_printmacroline(p, manvol);
741:
742: puts(".Os");
743: }
744:
1.3 kristaps 745: static void
746: pnode_printfuncdef(struct parse *p, struct pnode *pn)
747: {
748: struct pnode *pp, *ftype, *func;
749:
1.13 kristaps 750: assert(p->newln);
1.3 kristaps 751: ftype = func = NULL;
752: TAILQ_FOREACH(pp, &pn->childq, child)
753: if (NODE_TEXT == pp->node)
754: ftype = pp;
755: else if (NODE_FUNCTION == pp->node)
756: func = pp;
757:
758: if (NULL != ftype) {
1.13 kristaps 759: fputs(".Ft", stdout);
760: p->newln = 0;
1.3 kristaps 761: pnode_printmacroline(p, ftype);
762: }
763:
764: if (NULL != func) {
1.13 kristaps 765: fputs(".Fo", stdout);
766: p->newln = 0;
1.3 kristaps 767: pnode_printmacroline(p, func);
1.13 kristaps 768: } else {
1.3 kristaps 769: puts(".Fo UNKNOWN");
1.13 kristaps 770: p->newln = 1;
771: }
1.3 kristaps 772: }
773:
774: static void
775: pnode_printparamdef(struct parse *p, struct pnode *pn)
776: {
777: struct pnode *pp, *ptype, *param;
778:
1.13 kristaps 779: assert(p->newln);
1.3 kristaps 780: ptype = param = NULL;
781: TAILQ_FOREACH(pp, &pn->childq, child)
782: if (NODE_TEXT == pp->node)
783: ptype = pp;
784: else if (NODE_PARAMETER == pp->node)
785: param = pp;
786:
787: fputs(".Fa \"", stdout);
1.13 kristaps 788: p->newln = 0;
1.3 kristaps 789: if (NULL != ptype) {
1.32 kristaps 790: pnode_printmacrolinetext(p, ptype, MACROLINE_NOWS);
1.3 kristaps 791: putchar(' ');
792: }
793:
794: if (NULL != param)
795: pnode_printmacrolinepart(p, param);
796:
797: puts("\"");
1.13 kristaps 798: p->newln = 1;
1.3 kristaps 799: }
800:
801: static void
802: pnode_printfuncprototype(struct parse *p, struct pnode *pn)
803: {
804: struct pnode *pp, *fdef;
805:
1.13 kristaps 806: assert(p->newln);
1.3 kristaps 807: TAILQ_FOREACH(fdef, &pn->childq, child)
808: if (NODE_FUNCDEF == fdef->node)
809: break;
810:
1.4 kristaps 811: if (NULL != fdef)
1.3 kristaps 812: pnode_printfuncdef(p, fdef);
1.4 kristaps 813: else
1.3 kristaps 814: puts(".Fo UNKNOWN");
815:
1.4 kristaps 816: TAILQ_FOREACH(pp, &pn->childq, child)
1.3 kristaps 817: if (NODE_PARAMDEF == pp->node)
818: pnode_printparamdef(p, pp);
819:
820: puts(".Fc");
1.13 kristaps 821: p->newln = 1;
1.3 kristaps 822: }
823:
1.10 kristaps 824: /*
825: * The <arg> element is more complicated than it should be because text
826: * nodes are treated like ".Ar foo", but non-text nodes need to be
827: * re-sent into the printer (i.e., without the preceding ".Ar").
1.12 kristaps 828: * This also handles the case of "repetition" (or in other words, the
829: * ellipsis following an argument) and optionality.
1.10 kristaps 830: */
1.4 kristaps 831: static void
1.10 kristaps 832: pnode_printarg(struct parse *p, struct pnode *pn)
1.4 kristaps 833: {
834: struct pnode *pp;
1.12 kristaps 835: struct pattr *ap;
836: int isop, isrep;
837:
838: isop = 1;
839: isrep = 0;
840: TAILQ_FOREACH(ap, &pn->attrq, child)
841: if (ATTRKEY_CHOICE == ap->key &&
842: (ATTRVAL_PLAIN == ap->val ||
843: ATTRVAL_REQ == ap->val))
844: isop = 0;
845: else if (ATTRKEY_REP == ap->key &&
846: (ATTRVAL_REPEAT == ap->val))
847: isrep = 1;
848:
849: if (isop) {
850: pnode_printmopen(p);
1.13 kristaps 851: fputs("Op", stdout);
1.12 kristaps 852: }
1.4 kristaps 853:
1.10 kristaps 854: TAILQ_FOREACH(pp, &pn->childq, child) {
855: if (NODE_TEXT == pp->node) {
856: pnode_printmopen(p);
1.13 kristaps 857: fputs("Ar", stdout);
1.10 kristaps 858: }
859: pnode_print(p, pp);
1.12 kristaps 860: if (NODE_TEXT == pp->node && isrep)
861: fputs("...", stdout);
1.10 kristaps 862: }
1.4 kristaps 863: }
864:
1.24 kristaps 865: static void
866: pnode_printgroup(struct parse *p, struct pnode *pn)
867: {
868: struct pnode *pp, *np;
869: struct pattr *ap;
870: int isop, sv;
871:
872: isop = 1;
873: TAILQ_FOREACH(ap, &pn->attrq, child)
874: if (ATTRKEY_CHOICE == ap->key &&
875: (ATTRVAL_PLAIN == ap->val ||
876: ATTRVAL_REQ == ap->val)) {
877: isop = 0;
878: break;
879: }
880:
881: /*
882: * Make sure we're on a macro line.
883: * This will prevent pnode_print() for putting us on a
884: * subsequent line.
885: */
886: sv = p->newln;
887: pnode_printmopen(p);
888: if (isop)
889: fputs("Op", stdout);
890: else if (sv)
891: fputs("No", stdout);
892:
893: /*
894: * Keep on printing text separated by the vertical bar as long
895: * as we're within the same origin node as the group.
896: * This is kind of a nightmare.
897: * Eh, DocBook...
898: * FIXME: if there's a "Fl", we don't cut off the leading "-"
899: * like we do in pnode_print().
900: */
901: TAILQ_FOREACH(pp, &pn->childq, child) {
902: pnode_print(p, pp);
903: np = TAILQ_NEXT(pp, child);
904: while (NULL != np) {
905: if (pp->node != np->node)
906: break;
907: fputs(" |", stdout);
908: pnode_printmacrolinepart(p, np);
909: pp = np;
910: np = TAILQ_NEXT(np, child);
911: }
912: }
913:
914: pnode_printmclose(p, sv);
915: }
916:
1.7 kristaps 917: static void
918: pnode_printprologue(struct parse *p, struct pnode *pn)
919: {
920: struct pnode *pp;
921:
1.9 kristaps 922: pp = NULL == p->root ? NULL :
923: pnode_findfirst(p->root, NODE_REFMETA);
924:
925: if (NULL != pp) {
1.7 kristaps 926: pnode_printrefmeta(p, pp);
927: pnode_unlink(pp);
928: } else {
929: puts(".\\\" Supplying bogus prologue...");
930: puts(".Dd $Mdocdate" "$");
931: puts(".Dt UNKNOWN 1");
932: puts(".Os");
933: }
934: }
935:
1.13 kristaps 936: static void
937: pnode_printvarlistentry(struct parse *p, struct pnode *pn)
938: {
939: struct pnode *pp;
940:
941: assert(p->newln);
942: TAILQ_FOREACH(pp, &pn->childq, child)
943: if (NODE_TERM == pp->node) {
1.33 kristaps 944: assert(p->newln);
1.13 kristaps 945: fputs(".It", stdout);
946: p->newln = 0;
947: pnode_print(p, pp);
948: pnode_unlink(pp);
1.16 kristaps 949: pnode_printmclose(p, 1);
1.13 kristaps 950: return;
951: }
952:
953: puts(".It");
954: p->newln = 1;
955: }
956:
957: static void
1.25 kristaps 958: pnode_printrow(struct parse *p, struct pnode *pn)
959: {
960: struct pnode *pp;
961:
962: puts(".Bl -dash -compact");
963:
964: TAILQ_FOREACH(pp, &pn->childq, child) {
965: assert(p->newln);
966: puts(".It");
967: pnode_print(p, pp);
968: pnode_printmclose(p, 1);
969: }
970: assert(p->newln);
971: puts(".El");
972: }
973:
974: static void
975: pnode_printtable(struct parse *p, struct pnode *pn)
1.16 kristaps 976: {
977: struct pnode *pp;
978:
979: assert(p->newln);
980: TAILQ_FOREACH(pp, &pn->childq, child)
981: if (NODE_TITLE == pp->node) {
982: puts(".Pp");
983: pnode_print(p, pp);
984: pnode_unlink(pp);
985: }
1.25 kristaps 986: assert(p->newln);
987: puts(".Bl -ohang");
988: while (NULL != (pp = pnode_findfirst(pn, NODE_ROW))) {
989: puts(".It Table Row");
990: pnode_printrow(p, pp);
991: pnode_printmclose(p, 1);
992: pnode_unlink(pp);
993: }
994: assert(p->newln);
995: puts(".El");
996: }
997:
998: static void
999: pnode_printlist(struct parse *p, struct pnode *pn)
1000: {
1001: struct pnode *pp;
1.16 kristaps 1002:
1003: assert(p->newln);
1.25 kristaps 1004: TAILQ_FOREACH(pp, &pn->childq, child)
1005: if (NODE_TITLE == pp->node) {
1006: puts(".Pp");
1007: pnode_print(p, pp);
1008: pnode_unlink(pp);
1009: }
1010: assert(p->newln);
1.21 kristaps 1011:
1012: if (NODE_ORDEREDLIST == pn->node)
1013: puts(".Bl -enum");
1014: else
1015: puts(".Bl -item");
1016:
1.16 kristaps 1017: TAILQ_FOREACH(pp, &pn->childq, child) {
1018: assert(p->newln);
1019: puts(".It");
1020: pnode_print(p, pp);
1021: pnode_printmclose(p, 1);
1022: }
1023: assert(p->newln);
1024: puts(".El");
1025: }
1026:
1027: static void
1.13 kristaps 1028: pnode_printvariablelist(struct parse *p, struct pnode *pn)
1029: {
1030: struct pnode *pp;
1031:
1032: assert(p->newln);
1033: TAILQ_FOREACH(pp, &pn->childq, child)
1034: if (NODE_TITLE == pp->node) {
1035: puts(".Pp");
1036: pnode_print(p, pp);
1037: pnode_unlink(pp);
1038: }
1039:
1040: assert(p->newln);
1041: puts(".Bl -tag -width Ds");
1042: TAILQ_FOREACH(pp, &pn->childq, child)
1043: if (NODE_VARLISTENTRY != pp->node) {
1044: assert(p->newln);
1045: fputs(".It", stdout);
1046: pnode_printmacroline(p, pp);
1047: } else {
1048: assert(p->newln);
1049: pnode_print(p, pp);
1050: }
1051: assert(p->newln);
1052: puts(".El");
1053: }
1054:
1.1 kristaps 1055: /*
1056: * Print a parsed node (or ignore it--whatever).
1057: * This is a recursive function.
1.23 kristaps 1058: * FIXME: if we're in a literal context (<screen> or <programlisting> or
1059: * whatever), don't print inline macros.
1.1 kristaps 1060: */
1061: static void
1062: pnode_print(struct parse *p, struct pnode *pn)
1063: {
1064: struct pnode *pp;
1065: char *cp;
1.10 kristaps 1066: int last, sv;
1.1 kristaps 1067:
1068: if (NULL == pn)
1069: return;
1070:
1.10 kristaps 1071: sv = p->newln;
1.1 kristaps 1072:
1073: switch (pn->node) {
1.27 kristaps 1074: case (NODE_APPLICATION):
1075: pnode_printmopen(p);
1076: fputs("Nm", stdout);
1077: break;
1.30 kristaps 1078: case (NODE_ANCHOR):
1079: /* Don't print anything! */
1080: return;
1.4 kristaps 1081: case (NODE_ARG):
1.10 kristaps 1082: pnode_printarg(p, pn);
1.4 kristaps 1083: pnode_unlinksub(pn);
1084: break;
1.1 kristaps 1085: case (NODE_CITEREFENTRY):
1.34 ! kristaps 1086: pnode_printmopen(p);
! 1087: fputs("Xr", stdout);
1.1 kristaps 1088: pnode_printciterefentry(p, pn);
1.4 kristaps 1089: pnode_unlinksub(pn);
1.1 kristaps 1090: break;
1091: case (NODE_CODE):
1.10 kristaps 1092: pnode_printmopen(p);
1.13 kristaps 1093: fputs("Li", stdout);
1.4 kristaps 1094: break;
1095: case (NODE_COMMAND):
1.10 kristaps 1096: pnode_printmopen(p);
1.13 kristaps 1097: fputs("Nm", stdout);
1098: break;
1.33 kristaps 1099: case (NODE_CONSTANT):
1100: pnode_printmopen(p);
1101: fputs("Dv", stdout);
1102: break;
1.13 kristaps 1103: case (NODE_EMPHASIS):
1104: pnode_printmopen(p);
1105: fputs("Em", stdout);
1.1 kristaps 1106: break;
1.21 kristaps 1107: case (NODE_ENVAR):
1108: pnode_printmopen(p);
1109: fputs("Ev", stdout);
1110: break;
1.17 kristaps 1111: case (NODE_FILENAME):
1112: pnode_printmopen(p);
1113: fputs("Pa", stdout);
1114: break;
1.3 kristaps 1115: case (NODE_FUNCTION):
1.10 kristaps 1116: pnode_printmopen(p);
1.13 kristaps 1117: fputs("Fn", stdout);
1.3 kristaps 1118: break;
1119: case (NODE_FUNCPROTOTYPE):
1.10 kristaps 1120: assert(p->newln);
1.3 kristaps 1121: pnode_printfuncprototype(p, pn);
1.4 kristaps 1122: pnode_unlinksub(pn);
1.3 kristaps 1123: break;
1.1 kristaps 1124: case (NODE_FUNCSYNOPSISINFO):
1.10 kristaps 1125: pnode_printmopen(p);
1.13 kristaps 1126: fputs("Fd", stdout);
1.16 kristaps 1127: break;
1128: case (NODE_ITEMIZEDLIST):
1129: assert(p->newln);
1.25 kristaps 1130: pnode_printlist(p, pn);
1131: pnode_unlinksub(pn);
1.24 kristaps 1132: break;
1133: case (NODE_GROUP):
1134: pnode_printgroup(p, pn);
1135: pnode_unlinksub(pn);
1.10 kristaps 1136: break;
1.19 kristaps 1137: case (NODE_LITERAL):
1138: pnode_printmopen(p);
1139: fputs("Li", stdout);
1140: break;
1.10 kristaps 1141: case (NODE_OPTION):
1142: pnode_printmopen(p);
1.13 kristaps 1143: fputs("Fl", stdout);
1.1 kristaps 1144: break;
1.25 kristaps 1145: case (NODE_ORDEREDLIST):
1146: assert(p->newln);
1147: pnode_printlist(p, pn);
1148: pnode_unlinksub(pn);
1149: break;
1.1 kristaps 1150: case (NODE_PARA):
1.10 kristaps 1151: assert(p->newln);
1.13 kristaps 1152: if (NULL != pn->parent &&
1153: NODE_LISTITEM == pn->parent->node)
1154: break;
1.1 kristaps 1155: puts(".Pp");
1.3 kristaps 1156: break;
1157: case (NODE_PARAMETER):
1.10 kristaps 1158: /* Suppress non-text children... */
1159: pnode_printmopen(p);
1160: fputs("Fa \"", stdout);
1.32 kristaps 1161: pnode_printmacrolinetext(p, pn, MACROLINE_NOWS);
1162: fputs("\"", stdout);
1.4 kristaps 1163: pnode_unlinksub(pn);
1.1 kristaps 1164: break;
1.28 kristaps 1165: case (NODE_QUOTE):
1166: pnode_printmopen(p);
1167: fputs("Qo", stdout);
1168: break;
1.1 kristaps 1169: case (NODE_PROGRAMLISTING):
1.22 kristaps 1170: /* FALLTHROUGH */
1171: case (NODE_SCREEN):
1.10 kristaps 1172: assert(p->newln);
1.1 kristaps 1173: puts(".Bd -literal");
1.15 kristaps 1174: break;
1175: case (NODE_REFENTRYINFO):
1176: /* Suppress. */
1177: pnode_unlinksub(pn);
1.1 kristaps 1178: break;
1179: case (NODE_REFMETA):
1.7 kristaps 1180: abort();
1.1 kristaps 1181: break;
1182: case (NODE_REFNAME):
1.10 kristaps 1183: /* Suppress non-text children... */
1184: pnode_printmopen(p);
1.13 kristaps 1185: fputs("Nm", stdout);
1186: p->newln = 0;
1.10 kristaps 1187: pnode_printmacrolinepart(p, pn);
1.4 kristaps 1188: pnode_unlinksub(pn);
1.10 kristaps 1189: break;
1.1 kristaps 1190: case (NODE_REFNAMEDIV):
1.10 kristaps 1191: assert(p->newln);
1.1 kristaps 1192: puts(".Sh NAME");
1193: break;
1194: case (NODE_REFPURPOSE):
1.10 kristaps 1195: assert(p->newln);
1.13 kristaps 1196: pnode_printmopen(p);
1197: fputs("Nd", stdout);
1.10 kristaps 1198: break;
1.1 kristaps 1199: case (NODE_REFSYNOPSISDIV):
1.10 kristaps 1200: assert(p->newln);
1.6 kristaps 1201: pnode_printrefsynopsisdiv(p, pn);
1.10 kristaps 1202: puts(".Sh SYNOPSIS");
1.1 kristaps 1203: break;
1204: case (NODE_REFSECT1):
1.20 kristaps 1205: /* FALLTHROUGH */
1206: case (NODE_REFSECT2):
1.29 kristaps 1207: /* FALLTHROUGH */
1208: case (NODE_REFSECT3):
1209: /* FALLTHROUGH */
1210: case (NODE_REFSECTION):
1211: /* FALLTHROUGH */
1212: case (NODE_NOTE):
1213: /* FALLTHROUGH */
1214: case (NODE_TIP):
1215: /* FALLTHROUGH */
1216: case (NODE_CAUTION):
1217: /* FALLTHROUGH */
1218: case (NODE_WARNING):
1.10 kristaps 1219: assert(p->newln);
1.1 kristaps 1220: pnode_printrefsect(p, pn);
1221: break;
1.13 kristaps 1222: case (NODE_REPLACEABLE):
1223: pnode_printmopen(p);
1224: fputs("Ar", stdout);
1225: break;
1.19 kristaps 1226: case (NODE_SBR):
1227: assert(p->newln);
1228: puts(".br");
1229: break;
1.30 kristaps 1230: case (NODE_SGMLTAG):
1231: pnode_printmopen(p);
1232: fputs("Li", stdout);
1233: break;
1.8 kristaps 1234: case (NODE_STRUCTNAME):
1.10 kristaps 1235: pnode_printmopen(p);
1.13 kristaps 1236: fputs("Vt", stdout);
1.25 kristaps 1237: break;
1238: case (NODE_TABLE):
1239: assert(p->newln);
1240: pnode_printtable(p, pn);
1241: pnode_unlinksub(pn);
1.10 kristaps 1242: break;
1.1 kristaps 1243: case (NODE_TEXT):
1.13 kristaps 1244: if (0 == p->newln)
1245: putchar(' ');
1.1 kristaps 1246: bufclear(p);
1247: bufappend(p, pn);
1248: /*
1249: * Output all characters, squeezing out whitespace
1250: * between newlines.
1251: * XXX: all whitespace, including tabs (?).
1252: * Remember to escape control characters and escapes.
1253: */
1.10 kristaps 1254: assert(p->bsz);
1.20 kristaps 1255: cp = p->b;
1256: /*
1257: * There's often a superfluous "-" in its <option> tags
1258: * before the actual flags themselves.
1259: * "Fl" does this for us, so remove it.
1260: */
1261: if (NULL != pn->parent &&
1262: NODE_OPTION == pn->parent->node &&
1263: '-' == *cp)
1264: cp++;
1265: for (last = '\n'; '\0' != *cp; ) {
1.1 kristaps 1266: if ('\n' == last) {
1267: /* Consume all whitespace. */
1268: if (isspace((int)*cp)) {
1269: while (isspace((int)*cp))
1270: cp++;
1271: continue;
1272: } else if ('\'' == *cp || '.' == *cp)
1273: fputs("\\&", stdout);
1274: }
1275: putchar(last = *cp++);
1276: /* If we're a character escape, escape us. */
1277: if ('\\' == last)
1278: putchar('e');
1279: }
1.10 kristaps 1280: p->newln = 0;
1.1 kristaps 1281: break;
1.26 kristaps 1282: case (NODE_USERINPUT):
1283: pnode_printmopen(p);
1284: fputs("Li", stdout);
1285: break;
1.13 kristaps 1286: case (NODE_VARIABLELIST):
1287: assert(p->newln);
1288: pnode_printvariablelist(p, pn);
1289: pnode_unlinksub(pn);
1290: break;
1291: case (NODE_VARLISTENTRY):
1292: assert(p->newln);
1293: pnode_printvarlistentry(p, pn);
1294: break;
1.26 kristaps 1295: case (NODE_VARNAME):
1.23 kristaps 1296: pnode_printmopen(p);
1.26 kristaps 1297: fputs("Va", stdout);
1.23 kristaps 1298: break;
1.1 kristaps 1299: default:
1300: break;
1301: }
1302:
1303: TAILQ_FOREACH(pp, &pn->childq, child)
1304: pnode_print(p, pp);
1305:
1306: switch (pn->node) {
1.27 kristaps 1307: case (NODE_APPLICATION):
1.10 kristaps 1308: case (NODE_ARG):
1.34 ! kristaps 1309: case (NODE_CITEREFENTRY):
1.10 kristaps 1310: case (NODE_CODE):
1311: case (NODE_COMMAND):
1.33 kristaps 1312: case (NODE_CONSTANT):
1.13 kristaps 1313: case (NODE_EMPHASIS):
1.21 kristaps 1314: case (NODE_ENVAR):
1.17 kristaps 1315: case (NODE_FILENAME):
1.10 kristaps 1316: case (NODE_FUNCTION):
1317: case (NODE_FUNCSYNOPSISINFO):
1.19 kristaps 1318: case (NODE_LITERAL):
1.10 kristaps 1319: case (NODE_OPTION):
1320: case (NODE_PARAMETER):
1.13 kristaps 1321: case (NODE_REPLACEABLE):
1322: case (NODE_REFPURPOSE):
1.30 kristaps 1323: case (NODE_SGMLTAG):
1.10 kristaps 1324: case (NODE_STRUCTNAME):
1325: case (NODE_TEXT):
1.23 kristaps 1326: case (NODE_USERINPUT):
1.26 kristaps 1327: case (NODE_VARNAME):
1.28 kristaps 1328: pnode_printmclose(p, sv);
1329: break;
1330: case (NODE_QUOTE):
1331: pnode_printmclose(p, sv);
1332: sv = p->newln;
1333: pnode_printmopen(p);
1334: fputs("Qc", stdout);
1.10 kristaps 1335: pnode_printmclose(p, sv);
1336: break;
1.12 kristaps 1337: case (NODE_REFNAME):
1338: /*
1339: * If we're in the NAME macro and we have multiple
1340: * <refname> macros in sequence, then print out a
1341: * trailing comma before the newline.
1342: */
1343: if (NULL != pn->parent &&
1344: NODE_REFNAMEDIV == pn->parent->node &&
1345: NULL != TAILQ_NEXT(pn, child) &&
1346: NODE_REFNAME == TAILQ_NEXT(pn, child)->node)
1347: fputs(" ,", stdout);
1348: pnode_printmclose(p, sv);
1349: break;
1.1 kristaps 1350: case (NODE_PROGRAMLISTING):
1.22 kristaps 1351: /* FALLTHROUGH */
1352: case (NODE_SCREEN):
1.10 kristaps 1353: assert(p->newln);
1.1 kristaps 1354: puts(".Ed");
1.10 kristaps 1355: p->newln = 1;
1.1 kristaps 1356: break;
1357: default:
1358: break;
1359: }
1360: }
1361:
1362: /*
1363: * Loop around the read buffer until we've drained it of all data.
1364: * Invoke the parser context with each buffer fill.
1365: */
1366: static int
1367: readfile(XML_Parser xp, int fd,
1368: char *b, size_t bsz, const char *fn)
1369: {
1370: struct parse p;
1371: int rc;
1372: ssize_t ssz;
1373:
1374: memset(&p, 0, sizeof(struct parse));
1375:
1376: p.b = malloc(p.bsz = p.mbsz = 1024);
1.12 kristaps 1377: p.fname = fn;
1378: p.xml = xp;
1.1 kristaps 1379:
1380: XML_SetCharacterDataHandler(xp, xml_char);
1381: XML_SetElementHandler(xp, xml_elem_start, xml_elem_end);
1382: XML_SetUserData(xp, &p);
1383:
1384: while ((ssz = read(fd, b, bsz)) >= 0) {
1385: if (0 == (rc = XML_Parse(xp, b, ssz, 0 == ssz)))
1.30 kristaps 1386: fprintf(stderr, "%s:%zu:%zu: %s\n", fn,
1387: XML_GetCurrentLineNumber(xp),
1388: XML_GetCurrentColumnNumber(xp),
1.1 kristaps 1389: XML_ErrorString
1390: (XML_GetErrorCode(xp)));
1391: else if ( ! p.stop && ssz > 0)
1392: continue;
1393: /*
1394: * Exit when we've read all or errors have occured
1395: * during the parse sequence.
1396: */
1.10 kristaps 1397: p.newln = 1;
1.7 kristaps 1398: pnode_printprologue(&p, p.root);
1.1 kristaps 1399: pnode_print(&p, p.root);
1400: pnode_free(p.root);
1401: free(p.b);
1402: return(0 != rc && ! p.stop);
1403: }
1404:
1405: /* Read error has occured. */
1406: perror(fn);
1407: pnode_free(p.root);
1408: free(p.b);
1409: return(0);
1410: }
1411:
1412: int
1413: main(int argc, char *argv[])
1414: {
1415: XML_Parser xp;
1416: const char *fname;
1417: char *buf;
1418: int fd, rc;
1419:
1420: fname = "-";
1421: xp = NULL;
1422: buf = NULL;
1423: rc = 0;
1424:
1425: if (-1 != getopt(argc, argv, ""))
1426: return(EXIT_FAILURE);
1427:
1428: argc -= optind;
1429: argv += optind;
1430:
1431: if (argc > 1)
1432: return(EXIT_FAILURE);
1433: else if (argc > 0)
1434: fname = argv[0];
1435:
1436: /* Read from stdin or a file. */
1437: fd = 0 == strcmp(fname, "-") ?
1438: STDIN_FILENO : open(fname, O_RDONLY, 0);
1439:
1440: /*
1441: * Open file for reading.
1442: * Allocate a read buffer.
1443: * Create the parser context.
1444: * Dive directly into the parse.
1445: */
1446: if (-1 == fd)
1447: perror(fname);
1448: else if (NULL == (buf = malloc(4096)))
1449: perror(NULL);
1450: else if (NULL == (xp = XML_ParserCreate(NULL)))
1451: perror(NULL);
1452: else if ( ! readfile(xp, fd, buf, 4096, fname))
1453: rc = 1;
1454:
1455: XML_ParserFree(xp);
1456: free(buf);
1457: if (STDIN_FILENO != fd)
1458: close(fd);
1459: return(rc ? EXIT_SUCCESS : EXIT_FAILURE);
1460: }
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