Annotation of mandoc/tree.c, Revision 1.77
1.77 ! schwarze 1: /* $Id: tree.c,v 1.76 2017/07/07 19:39:30 schwarze Exp $ */
1.1 kristaps 2: /*
1.58 schwarze 3: * Copyright (c) 2008, 2009, 2011, 2014 Kristaps Dzonsons <kristaps@bsd.lv>
1.72 schwarze 4: * Copyright (c) 2013, 2014, 2015, 2017 Ingo Schwarze <schwarze@openbsd.org>
1.1 kristaps 5: *
6: * Permission to use, copy, modify, and distribute this software for any
1.12 kristaps 7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
1.1 kristaps 9: *
1.63 schwarze 10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
1.12 kristaps 11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
1.63 schwarze 12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
1.12 kristaps 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.
1.1 kristaps 17: */
1.19 kristaps 18: #include "config.h"
1.54 schwarze 19:
20: #include <sys/types.h>
1.19 kristaps 21:
1.8 kristaps 22: #include <assert.h>
1.43 kristaps 23: #include <limits.h>
1.8 kristaps 24: #include <stdio.h>
1.1 kristaps 25: #include <stdlib.h>
1.17 kristaps 26: #include <time.h>
1.1 kristaps 27:
1.20 kristaps 28: #include "mandoc.h"
1.63 schwarze 29: #include "roff.h"
1.1 kristaps 30: #include "mdoc.h"
1.10 kristaps 31: #include "man.h"
1.16 kristaps 32: #include "main.h"
1.1 kristaps 33:
1.38 kristaps 34: static void print_box(const struct eqn_box *, int);
1.64 schwarze 35: static void print_man(const struct roff_node *, int);
1.72 schwarze 36: static void print_meta(const struct roff_meta *);
1.64 schwarze 37: static void print_mdoc(const struct roff_node *, int);
1.30 kristaps 38: static void print_span(const struct tbl_span *, int);
1.8 kristaps 39:
40:
1.15 kristaps 41: void
1.65 schwarze 42: tree_mdoc(void *arg, const struct roff_man *mdoc)
1.8 kristaps 43: {
1.72 schwarze 44: print_meta(&mdoc->meta);
45: putchar('\n');
1.66 schwarze 46: print_mdoc(mdoc->first->child, 0);
1.11 kristaps 47: }
48:
1.15 kristaps 49: void
1.65 schwarze 50: tree_man(void *arg, const struct roff_man *man)
1.11 kristaps 51: {
1.72 schwarze 52: print_meta(&man->meta);
53: if (man->meta.hasbody == 0)
54: puts("body = empty");
55: putchar('\n');
56: print_man(man->first->child, 0);
57: }
1.11 kristaps 58:
1.72 schwarze 59: static void
60: print_meta(const struct roff_meta *meta)
61: {
62: if (meta->title != NULL)
63: printf("title = \"%s\"\n", meta->title);
64: if (meta->name != NULL)
65: printf("name = \"%s\"\n", meta->name);
66: if (meta->msec != NULL)
67: printf("sec = \"%s\"\n", meta->msec);
68: if (meta->vol != NULL)
69: printf("vol = \"%s\"\n", meta->vol);
70: if (meta->arch != NULL)
71: printf("arch = \"%s\"\n", meta->arch);
72: if (meta->os != NULL)
73: printf("os = \"%s\"\n", meta->os);
74: if (meta->date != NULL)
75: printf("date = \"%s\"\n", meta->date);
1.8 kristaps 76: }
1.2 kristaps 77:
1.1 kristaps 78: static void
1.64 schwarze 79: print_mdoc(const struct roff_node *n, int indent)
1.1 kristaps 80: {
81: const char *p, *t;
82: int i, j;
1.48 schwarze 83: size_t argc;
1.8 kristaps 84: struct mdoc_argv *argv;
1.1 kristaps 85:
1.61 schwarze 86: if (n == NULL)
87: return;
88:
1.1 kristaps 89: argv = NULL;
1.48 schwarze 90: argc = 0;
1.38 kristaps 91: t = p = NULL;
1.1 kristaps 92:
1.2 kristaps 93: switch (n->type) {
1.63 schwarze 94: case ROFFT_ROOT:
1.2 kristaps 95: t = "root";
96: break;
1.63 schwarze 97: case ROFFT_BLOCK:
1.2 kristaps 98: t = "block";
99: break;
1.63 schwarze 100: case ROFFT_HEAD:
1.68 schwarze 101: t = "head";
1.2 kristaps 102: break;
1.63 schwarze 103: case ROFFT_BODY:
1.23 schwarze 104: if (n->end)
105: t = "body-end";
106: else
1.68 schwarze 107: t = "body";
1.2 kristaps 108: break;
1.63 schwarze 109: case ROFFT_TAIL:
1.68 schwarze 110: t = "tail";
1.2 kristaps 111: break;
1.63 schwarze 112: case ROFFT_ELEM:
1.2 kristaps 113: t = "elem";
114: break;
1.63 schwarze 115: case ROFFT_TEXT:
1.2 kristaps 116: t = "text";
117: break;
1.63 schwarze 118: case ROFFT_TBL:
1.59 schwarze 119: break;
1.63 schwarze 120: case ROFFT_EQN:
1.59 schwarze 121: t = "eqn";
1.33 kristaps 122: break;
1.2 kristaps 123: default:
124: abort();
125: }
1.1 kristaps 126:
127: switch (n->type) {
1.63 schwarze 128: case ROFFT_TEXT:
1.8 kristaps 129: p = n->string;
1.1 kristaps 130: break;
1.63 schwarze 131: case ROFFT_BODY:
1.74 schwarze 132: p = roff_name[n->tok];
1.1 kristaps 133: break;
1.63 schwarze 134: case ROFFT_HEAD:
1.74 schwarze 135: p = roff_name[n->tok];
1.1 kristaps 136: break;
1.63 schwarze 137: case ROFFT_TAIL:
1.74 schwarze 138: p = roff_name[n->tok];
1.1 kristaps 139: break;
1.63 schwarze 140: case ROFFT_ELEM:
1.74 schwarze 141: p = roff_name[n->tok];
1.8 kristaps 142: if (n->args) {
143: argv = n->args->argv;
144: argc = n->args->argc;
145: }
1.1 kristaps 146: break;
1.63 schwarze 147: case ROFFT_BLOCK:
1.74 schwarze 148: p = roff_name[n->tok];
1.8 kristaps 149: if (n->args) {
150: argv = n->args->argv;
151: argc = n->args->argc;
152: }
1.1 kristaps 153: break;
1.63 schwarze 154: case ROFFT_TBL:
1.59 schwarze 155: break;
1.63 schwarze 156: case ROFFT_EQN:
1.59 schwarze 157: p = "EQ";
1.33 kristaps 158: break;
1.63 schwarze 159: case ROFFT_ROOT:
1.1 kristaps 160: p = "root";
161: break;
162: default:
163: abort();
164: }
165:
1.26 kristaps 166: if (n->span) {
1.38 kristaps 167: assert(NULL == p && NULL == t);
1.30 kristaps 168: print_span(n->span, indent);
1.26 kristaps 169: } else {
1.30 kristaps 170: for (i = 0; i < indent; i++)
1.61 schwarze 171: putchar(' ');
1.30 kristaps 172:
1.26 kristaps 173: printf("%s (%s)", p, t);
174:
175: for (i = 0; i < (int)argc; i++) {
176: printf(" -%s", mdoc_argnames[argv[i].arg]);
177: if (argv[i].sz > 0)
178: printf(" [");
179: for (j = 0; j < (int)argv[i].sz; j++)
180: printf(" [%s]", argv[i].value[j]);
181: if (argv[i].sz > 0)
182: printf(" ]");
183: }
1.49 schwarze 184:
185: putchar(' ');
1.71 schwarze 186: if (NODE_DELIMO & n->flags)
1.68 schwarze 187: putchar('(');
1.71 schwarze 188: if (NODE_LINE & n->flags)
1.49 schwarze 189: putchar('*');
1.68 schwarze 190: printf("%d:%d", n->line, n->pos + 1);
1.71 schwarze 191: if (NODE_DELIMC & n->flags)
1.68 schwarze 192: putchar(')');
1.71 schwarze 193: if (NODE_EOS & n->flags)
1.68 schwarze 194: putchar('.');
1.73 schwarze 195: if (NODE_BROKEN & n->flags)
196: printf(" BROKEN");
1.70 schwarze 197: if (NODE_NOSRC & n->flags)
198: printf(" NOSRC");
199: if (NODE_NOPRT & n->flags)
200: printf(" NOPRT");
1.68 schwarze 201: putchar('\n');
1.1 kristaps 202: }
203:
1.59 schwarze 204: if (n->eqn)
1.77 ! schwarze 205: print_box(n->eqn->first, indent + 4);
1.1 kristaps 206: if (n->child)
1.61 schwarze 207: print_mdoc(n->child, indent +
1.63 schwarze 208: (n->type == ROFFT_BLOCK ? 2 : 4));
1.1 kristaps 209: if (n->next)
1.11 kristaps 210: print_mdoc(n->next, indent);
1.1 kristaps 211: }
1.2 kristaps 212:
1.10 kristaps 213: static void
1.64 schwarze 214: print_man(const struct roff_node *n, int indent)
1.10 kristaps 215: {
216: const char *p, *t;
217: int i;
218:
1.61 schwarze 219: if (n == NULL)
220: return;
221:
1.38 kristaps 222: t = p = NULL;
223:
1.10 kristaps 224: switch (n->type) {
1.63 schwarze 225: case ROFFT_ROOT:
1.10 kristaps 226: t = "root";
227: break;
1.63 schwarze 228: case ROFFT_ELEM:
1.10 kristaps 229: t = "elem";
230: break;
1.63 schwarze 231: case ROFFT_TEXT:
1.10 kristaps 232: t = "text";
233: break;
1.63 schwarze 234: case ROFFT_BLOCK:
1.14 kristaps 235: t = "block";
236: break;
1.63 schwarze 237: case ROFFT_HEAD:
1.68 schwarze 238: t = "head";
1.14 kristaps 239: break;
1.63 schwarze 240: case ROFFT_BODY:
1.68 schwarze 241: t = "body";
1.14 kristaps 242: break;
1.63 schwarze 243: case ROFFT_TBL:
1.59 schwarze 244: break;
1.63 schwarze 245: case ROFFT_EQN:
1.59 schwarze 246: t = "eqn";
1.33 kristaps 247: break;
1.10 kristaps 248: default:
249: abort();
250: }
251:
252: switch (n->type) {
1.63 schwarze 253: case ROFFT_TEXT:
1.10 kristaps 254: p = n->string;
255: break;
1.63 schwarze 256: case ROFFT_ELEM:
257: case ROFFT_BLOCK:
258: case ROFFT_HEAD:
259: case ROFFT_BODY:
1.74 schwarze 260: p = roff_name[n->tok];
1.10 kristaps 261: break;
1.63 schwarze 262: case ROFFT_ROOT:
1.10 kristaps 263: p = "root";
1.25 kristaps 264: break;
1.63 schwarze 265: case ROFFT_TBL:
1.59 schwarze 266: break;
1.63 schwarze 267: case ROFFT_EQN:
1.59 schwarze 268: p = "EQ";
1.10 kristaps 269: break;
270: default:
271: abort();
272: }
273:
1.26 kristaps 274: if (n->span) {
1.38 kristaps 275: assert(NULL == p && NULL == t);
1.30 kristaps 276: print_span(n->span, indent);
277: } else {
278: for (i = 0; i < indent; i++)
1.61 schwarze 279: putchar(' ');
1.51 schwarze 280: printf("%s (%s) ", p, t);
1.71 schwarze 281: if (NODE_LINE & n->flags)
1.51 schwarze 282: putchar('*');
1.68 schwarze 283: printf("%d:%d", n->line, n->pos + 1);
1.71 schwarze 284: if (NODE_EOS & n->flags)
1.68 schwarze 285: putchar('.');
286: putchar('\n');
1.30 kristaps 287: }
1.26 kristaps 288:
1.59 schwarze 289: if (n->eqn)
1.77 ! schwarze 290: print_box(n->eqn->first, indent + 4);
1.10 kristaps 291: if (n->child)
1.61 schwarze 292: print_man(n->child, indent +
1.63 schwarze 293: (n->type == ROFFT_BLOCK ? 2 : 4));
1.10 kristaps 294: if (n->next)
1.11 kristaps 295: print_man(n->next, indent);
1.28 kristaps 296: }
297:
298: static void
1.38 kristaps 299: print_box(const struct eqn_box *ep, int indent)
300: {
301: int i;
1.46 kristaps 302: const char *t;
1.38 kristaps 303:
1.57 schwarze 304: static const char *posnames[] = {
305: NULL, "sup", "subsup", "sub",
306: "to", "from", "fromto",
307: "over", "sqrt", NULL };
308:
1.38 kristaps 309: if (NULL == ep)
310: return;
311: for (i = 0; i < indent; i++)
1.61 schwarze 312: putchar(' ');
1.38 kristaps 313:
1.46 kristaps 314: t = NULL;
1.38 kristaps 315: switch (ep->type) {
1.52 schwarze 316: case EQN_LIST:
1.46 kristaps 317: t = "eqn-list";
1.39 kristaps 318: break;
1.52 schwarze 319: case EQN_SUBEXPR:
1.46 kristaps 320: t = "eqn-expr";
1.39 kristaps 321: break;
1.52 schwarze 322: case EQN_TEXT:
1.46 kristaps 323: t = "eqn-text";
1.39 kristaps 324: break;
1.56 kristaps 325: case EQN_PILE:
326: t = "eqn-pile";
327: break;
1.52 schwarze 328: case EQN_MATRIX:
1.46 kristaps 329: t = "eqn-matrix";
1.38 kristaps 330: break;
331: }
1.39 kristaps 332:
1.57 schwarze 333: fputs(t, stdout);
334: if (ep->pos)
335: printf(" pos=%s", posnames[ep->pos]);
336: if (ep->left)
337: printf(" left=\"%s\"", ep->left);
338: if (ep->right)
339: printf(" right=\"%s\"", ep->right);
340: if (ep->top)
341: printf(" top=\"%s\"", ep->top);
342: if (ep->bottom)
343: printf(" bottom=\"%s\"", ep->bottom);
344: if (ep->text)
345: printf(" text=\"%s\"", ep->text);
346: if (ep->font)
347: printf(" font=%d", ep->font);
348: if (ep->size != EQN_DEFSIZE)
349: printf(" size=%d", ep->size);
350: if (ep->expectargs != UINT_MAX && ep->expectargs != ep->args)
351: printf(" badargs=%zu(%zu)", ep->args, ep->expectargs);
352: else if (ep->args)
353: printf(" args=%zu", ep->args);
354: putchar('\n');
1.46 kristaps 355:
1.61 schwarze 356: print_box(ep->first, indent + 4);
1.39 kristaps 357: print_box(ep->next, indent);
1.38 kristaps 358: }
359:
360: static void
1.30 kristaps 361: print_span(const struct tbl_span *sp, int indent)
1.28 kristaps 362: {
363: const struct tbl_dat *dp;
1.30 kristaps 364: int i;
365:
366: for (i = 0; i < indent; i++)
1.61 schwarze 367: putchar(' ');
1.28 kristaps 368:
369: switch (sp->pos) {
1.52 schwarze 370: case TBL_SPAN_HORIZ:
1.28 kristaps 371: putchar('-');
372: return;
1.52 schwarze 373: case TBL_SPAN_DHORIZ:
1.28 kristaps 374: putchar('=');
375: return;
376: default:
377: break;
378: }
379:
380: for (dp = sp->first; dp; dp = dp->next) {
381: switch (dp->pos) {
1.52 schwarze 382: case TBL_DATA_HORIZ:
383: case TBL_DATA_NHORIZ:
1.28 kristaps 384: putchar('-');
385: continue;
1.52 schwarze 386: case TBL_DATA_DHORIZ:
387: case TBL_DATA_NDHORIZ:
1.28 kristaps 388: putchar('=');
389: continue;
390: default:
391: break;
392: }
1.32 kristaps 393: printf("[\"%s\"", dp->string ? dp->string : "");
394: if (dp->spans)
395: printf("(%d)", dp->spans);
396: if (NULL == dp->layout)
397: putchar('*');
398: putchar(']');
1.34 kristaps 399: putchar(' ');
1.28 kristaps 400: }
1.34 kristaps 401:
1.38 kristaps 402: printf("(tbl) %d:1\n", sp->line);
1.10 kristaps 403: }
CVSweb