Annotation of mandoc/roff.c, Revision 1.45
1.45 ! kristaps 1: /* $Id: roff.c,v 1.44 2008/12/06 13:18:44 kristaps Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
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
7: * above copyright notice and this permission notice appear in all
8: * copies.
9: *
10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
11: * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
12: * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
13: * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
14: * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
15: * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
16: * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
17: * PERFORMANCE OF THIS SOFTWARE.
18: */
1.30 kristaps 19: #include <sys/param.h>
1.33 kristaps 20: #include <sys/types.h>
1.30 kristaps 21:
1.1 kristaps 22: #include <assert.h>
23: #include <ctype.h>
24: #include <err.h>
1.12 kristaps 25: #include <stdarg.h>
1.1 kristaps 26: #include <stdlib.h>
27: #include <stdio.h>
28: #include <string.h>
29: #include <time.h>
30:
31: #include "libmdocml.h"
32: #include "private.h"
1.43 kristaps 33: #include "roff.h"
1.1 kristaps 34:
1.33 kristaps 35: /* FIXME: First letters of quoted-text interpreted in rofffindtok. */
36: /* FIXME: `No' not implemented. */
1.27 kristaps 37: /* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */
38: /* TODO: warn about "X section only" macros. */
39: /* TODO: warn about empty lists. */
40: /* TODO: (warn) some sections need specific elements. */
41: /* TODO: (warn) NAME section has particular order. */
42: /* TODO: unify empty-content tags a la <br />. */
43: /* TODO: macros with a set number of arguments? */
1.36 kristaps 44: /* TODO: validate Dt macro arguments. */
1.43 kristaps 45: /* FIXME: Bl -diag supposed to ignore callable children. */
46: /* FIXME: Nm has newline when used in NAME section. */
1.1 kristaps 47:
48: struct roffnode {
1.5 kristaps 49: int tok; /* Token id. */
50: struct roffnode *parent; /* Parent (or NULL). */
1.1 kristaps 51: };
52:
53: struct rofftree {
1.5 kristaps 54: struct roffnode *last; /* Last parsed node. */
1.32 kristaps 55: char *cur; /* Line start. */
1.30 kristaps 56: struct tm tm; /* `Dd' results. */
1.42 kristaps 57: char name[64]; /* `Nm' results. */
1.5 kristaps 58: char os[64]; /* `Os' results. */
59: char title[64]; /* `Dt' results. */
60: char section[64]; /* `Dt' results. */
61: char volume[64]; /* `Dt' results. */
1.1 kristaps 62: int state;
1.5 kristaps 63: #define ROFF_PRELUDE (1 << 1) /* In roff prelude. */
64: #define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */
65: #define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */
66: #define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */
67: #define ROFF_BODY (1 << 5) /* In roff body. */
1.32 kristaps 68: struct roffcb cb; /* Callbacks. */
69: void *arg; /* Callbacks' arg. */
1.1 kristaps 70: };
71:
1.4 kristaps 72: static struct roffnode *roffnode_new(int, struct rofftree *);
1.15 kristaps 73: static void roffnode_free(struct rofftree *);
1.12 kristaps 74: static void roff_warn(const struct rofftree *,
75: const char *, char *, ...);
76: static void roff_err(const struct rofftree *,
77: const char *, char *, ...);
1.31 kristaps 78: static int roffpurgepunct(struct rofftree *, char **);
1.7 kristaps 79: static int roffscan(int, const int *);
1.1 kristaps 80: static int rofffindtok(const char *);
81: static int rofffindarg(const char *);
1.2 kristaps 82: static int rofffindcallable(const char *);
1.10 kristaps 83: static int roffargs(const struct rofftree *,
84: int, char *, char **);
1.5 kristaps 85: static int roffargok(int, int);
1.12 kristaps 86: static int roffnextopt(const struct rofftree *,
1.18 kristaps 87: int, char ***, char **);
1.27 kristaps 88: static int roffparseopts(struct rofftree *, int,
89: char ***, int *, char **);
1.33 kristaps 90: static int roffcall(struct rofftree *, int, char **);
1.17 kristaps 91: static int roffparse(struct rofftree *, char *);
1.37 kristaps 92: static int textparse(struct rofftree *, char *);
93: static int roffdata(struct rofftree *, int, char *);
1.44 kristaps 94: static int roffspecial(struct rofftree *, int,
95: const char *, size_t, char **);
1.42 kristaps 96: static int roffsetname(struct rofftree *, char **);
1.1 kristaps 97:
1.35 kristaps 98: #ifdef __linux__
99: extern size_t strlcat(char *, const char *, size_t);
100: extern size_t strlcpy(char *, const char *, size_t);
1.33 kristaps 101: extern int vsnprintf(char *, size_t,
102: const char *, va_list);
103: extern char *strptime(const char *, const char *,
104: struct tm *);
105: #endif
106:
1.1 kristaps 107: int
108: roff_free(struct rofftree *tree, int flush)
109: {
1.16 kristaps 110: int error, t;
1.15 kristaps 111: struct roffnode *n;
1.1 kristaps 112:
1.17 kristaps 113: error = 0;
114:
1.16 kristaps 115: if ( ! flush)
116: goto end;
1.1 kristaps 117:
1.16 kristaps 118: error = 1;
1.1 kristaps 119:
1.16 kristaps 120: if (ROFF_PRELUDE & tree->state) {
1.28 kristaps 121: roff_err(tree, NULL, "prelude never finished");
1.16 kristaps 122: goto end;
123: }
124:
1.28 kristaps 125: for (n = tree->last; n; n = n->parent) {
1.16 kristaps 126: if (0 != tokens[n->tok].ctx)
1.17 kristaps 127: continue;
1.28 kristaps 128: roff_err(tree, NULL, "closing explicit scope `%s'",
1.16 kristaps 129: toknames[n->tok]);
130: goto end;
131: }
132:
133: while (tree->last) {
134: t = tree->last->tok;
135: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
136: goto end;
1.1 kristaps 137: }
138:
1.30 kristaps 139: if ( ! (*tree->cb.rofftail)(tree->arg))
140: goto end;
141:
1.16 kristaps 142: error = 0;
143:
144: end:
145:
1.15 kristaps 146: while (tree->last)
147: roffnode_free(tree);
148:
1.1 kristaps 149: free(tree);
1.17 kristaps 150:
1.1 kristaps 151: return(error ? 0 : 1);
152: }
153:
154:
155: struct rofftree *
1.15 kristaps 156: roff_alloc(const struct roffcb *cb, void *args)
1.1 kristaps 157: {
158: struct rofftree *tree;
159:
1.17 kristaps 160: assert(args);
161: assert(cb);
162:
1.12 kristaps 163: if (NULL == (tree = calloc(1, sizeof(struct rofftree))))
164: err(1, "calloc");
1.1 kristaps 165:
166: tree->state = ROFF_PRELUDE;
1.15 kristaps 167: tree->arg = args;
168:
169: (void)memcpy(&tree->cb, cb, sizeof(struct roffcb));
1.1 kristaps 170:
171: return(tree);
172: }
173:
174:
175: int
1.17 kristaps 176: roff_engine(struct rofftree *tree, char *buf)
1.1 kristaps 177: {
178:
1.17 kristaps 179: tree->cur = buf;
180: assert(buf);
1.12 kristaps 181:
1.17 kristaps 182: if (0 == *buf) {
1.29 kristaps 183: roff_err(tree, buf, "blank line");
1.1 kristaps 184: return(0);
185: } else if ('.' != *buf)
1.17 kristaps 186: return(textparse(tree, buf));
1.1 kristaps 187:
1.17 kristaps 188: return(roffparse(tree, buf));
1.1 kristaps 189: }
190:
191:
192: static int
1.37 kristaps 193: textparse(struct rofftree *tree, char *buf)
1.1 kristaps 194: {
1.37 kristaps 195: char *bufp;
196:
197: /* TODO: literal parsing. */
1.17 kristaps 198:
1.30 kristaps 199: if ( ! (ROFF_BODY & tree->state)) {
200: roff_err(tree, buf, "data not in body");
201: return(0);
202: }
1.37 kristaps 203:
204: /* LINTED */
205: while (*buf) {
206: while (*buf && isspace(*buf))
207: buf++;
208:
209: if (0 == *buf)
210: break;
211:
212: bufp = buf++;
213:
214: while (*buf && ! isspace(*buf))
215: buf++;
216:
217: if (0 != *buf) {
218: *buf++ = 0;
219: if ( ! roffdata(tree, 1, bufp))
220: return(0);
221: continue;
222: }
223:
224: if ( ! roffdata(tree, 1, bufp))
225: return(0);
226: break;
227: }
228:
229: return(1);
1.1 kristaps 230: }
231:
232:
233: static int
1.10 kristaps 234: roffargs(const struct rofftree *tree,
235: int tok, char *buf, char **argv)
1.1 kristaps 236: {
237: int i;
1.12 kristaps 238: char *p;
1.1 kristaps 239:
240: assert(tok >= 0 && tok < ROFF_MAX);
241: assert('.' == *buf);
242:
1.12 kristaps 243: p = buf;
244:
1.40 kristaps 245: /*
246: * This is an ugly little loop. It parses a line into
247: * space-delimited tokens. If a quote mark is encountered, a
248: * token is alloted the entire quoted text. If whitespace is
249: * escaped, it's included in the prior alloted token.
250: */
251:
1.1 kristaps 252: /* LINTED */
1.37 kristaps 253: for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) {
1.10 kristaps 254: if ('\"' == *buf) {
255: argv[i] = ++buf;
256: while (*buf && '\"' != *buf)
257: buf++;
258: if (0 == *buf) {
1.13 kristaps 259: roff_err(tree, argv[i], "unclosed "
1.12 kristaps 260: "quote in argument "
261: "list for `%s'",
262: toknames[tok]);
1.10 kristaps 263: return(0);
264: }
265: } else {
266: argv[i] = buf++;
1.40 kristaps 267: while (*buf) {
268: if ( ! isspace(*buf)) {
269: buf++;
270: continue;
271: }
272: if (*(buf - 1) == '\\') {
273: buf++;
274: continue;
275: }
276: break;
277: }
1.10 kristaps 278: if (0 == *buf)
279: continue;
1.1 kristaps 280: }
281: *buf++ = 0;
282: while (*buf && isspace(*buf))
283: buf++;
284: }
1.40 kristaps 285:
1.1 kristaps 286: assert(i > 0);
1.37 kristaps 287: if (ROFF_MAXLINEARG == i && *buf) {
1.13 kristaps 288: roff_err(tree, p, "too many arguments for `%s'", toknames
1.12 kristaps 289: [tok]);
1.10 kristaps 290: return(0);
291: }
292:
293: argv[i] = NULL;
294: return(1);
1.1 kristaps 295: }
296:
297:
1.6 kristaps 298: static int
299: roffscan(int tok, const int *tokv)
300: {
1.7 kristaps 301:
1.6 kristaps 302: if (NULL == tokv)
303: return(1);
304:
1.7 kristaps 305: for ( ; ROFF_MAX != *tokv; tokv++)
1.6 kristaps 306: if (tok == *tokv)
307: return(1);
308:
309: return(0);
310: }
311:
312:
1.1 kristaps 313: static int
1.17 kristaps 314: roffparse(struct rofftree *tree, char *buf)
1.1 kristaps 315: {
316: int tok, t;
1.6 kristaps 317: struct roffnode *n;
1.37 kristaps 318: char *argv[ROFF_MAXLINEARG];
1.18 kristaps 319: char **argvp;
1.1 kristaps 320:
1.25 kristaps 321: if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2))
322: if (0 == strncmp(buf, ".\\\"", 3))
323: return(1);
324:
1.6 kristaps 325: if (ROFF_MAX == (tok = rofffindtok(buf + 1))) {
1.12 kristaps 326: roff_err(tree, buf + 1, "bogus line macro");
1.6 kristaps 327: return(0);
328: } else if (NULL == tokens[tok].cb) {
1.12 kristaps 329: roff_err(tree, buf + 1, "unsupported macro `%s'",
330: toknames[tok]);
1.1 kristaps 331: return(0);
1.25 kristaps 332: }
333:
334: assert(ROFF___ != tok);
1.10 kristaps 335: if ( ! roffargs(tree, tok, buf, argv))
1.1 kristaps 336: return(0);
1.12 kristaps 337:
1.18 kristaps 338: argvp = (char **)argv;
1.6 kristaps 339:
340: /*
1.12 kristaps 341: * Prelude macros break some assumptions, so branch now.
1.6 kristaps 342: */
1.1 kristaps 343:
1.6 kristaps 344: if (ROFF_PRELUDE & tree->state) {
345: assert(NULL == tree->last);
346: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.28 kristaps 347: }
1.6 kristaps 348:
349: assert(ROFF_BODY & tree->state);
350:
351: /*
352: * First check that our possible parents and parent's possible
353: * children are satisfied.
354: */
355:
1.28 kristaps 356: if (tree->last && ! roffscan
357: (tree->last->tok, tokens[tok].parents)) {
1.15 kristaps 358: roff_err(tree, *argvp, "`%s' has invalid parent `%s'",
359: toknames[tok],
360: toknames[tree->last->tok]);
1.6 kristaps 361: return(0);
362: }
363:
1.28 kristaps 364: if (tree->last && ! roffscan
365: (tok, tokens[tree->last->tok].children)) {
1.18 kristaps 366: roff_err(tree, *argvp, "`%s' is invalid child of `%s'",
367: toknames[tok],
368: toknames[tree->last->tok]);
1.1 kristaps 369: return(0);
370: }
371:
372: /*
1.6 kristaps 373: * Branch if we're not a layout token.
1.1 kristaps 374: */
375:
1.6 kristaps 376: if (ROFF_LAYOUT != tokens[tok].type)
377: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
378: if (0 == tokens[tok].ctx)
379: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 380:
1.12 kristaps 381: /*
382: * First consider implicit-end tags, like as follows:
383: * .Sh SECTION 1
384: * .Sh SECTION 2
385: * In this, we want to close the scope of the NAME section. If
386: * there's an intermediary implicit-end tag, such as
387: * .Sh SECTION 1
388: * .Ss Subsection 1
389: * .Sh SECTION 2
390: * then it must be closed as well.
391: */
392:
1.6 kristaps 393: if (tok == tokens[tok].ctx) {
1.12 kristaps 394: /*
395: * First search up to the point where we must close.
396: * If one doesn't exist, then we can open a new scope.
397: */
398:
1.6 kristaps 399: for (n = tree->last; n; n = n->parent) {
400: assert(0 == tokens[n->tok].ctx ||
401: n->tok == tokens[n->tok].ctx);
402: if (n->tok == tok)
403: break;
1.10 kristaps 404: if (ROFF_SHALLOW & tokens[tok].flags) {
405: n = NULL;
406: break;
407: }
1.28 kristaps 408: if (tokens[n->tok].ctx == n->tok)
409: continue;
410: roff_err(tree, *argv, "`%s' breaks `%s' scope",
411: toknames[tok], toknames[n->tok]);
412: return(0);
1.6 kristaps 413: }
1.10 kristaps 414:
415: /*
416: * Create a new scope, as no previous one exists to
417: * close out.
418: */
1.12 kristaps 419:
420: if (NULL == n)
1.6 kristaps 421: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.10 kristaps 422:
423: /*
1.12 kristaps 424: * Close out all intermediary scoped blocks, then hang
425: * the current scope from our predecessor's parent.
1.10 kristaps 426: */
427:
1.1 kristaps 428: do {
429: t = tree->last->tok;
1.6 kristaps 430: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
1.1 kristaps 431: return(0);
432: } while (t != tok);
1.6 kristaps 433:
434: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 435: }
436:
1.12 kristaps 437: /*
438: * Now consider explicit-end tags, where we want to close back
439: * to a specific tag. Example:
440: * .Bl
441: * .It Item.
442: * .El
443: * In this, the `El' tag closes out the scope of `Bl'.
444: */
445:
1.6 kristaps 446: assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx);
447:
1.32 kristaps 448: /* LINTED */
1.28 kristaps 449: for (n = tree->last; n; n = n->parent)
450: if (n->tok != tokens[tok].ctx) {
451: if (n->tok == tokens[n->tok].ctx)
452: continue;
453: roff_err(tree, *argv, "`%s' breaks `%s' scope",
454: toknames[tok], toknames[n->tok]);
455: return(0);
456: } else
457: break;
458:
459:
460: if (NULL == n) {
461: roff_err(tree, *argv, "`%s' has no starting tag `%s'",
462: toknames[tok],
463: toknames[tokens[tok].ctx]);
464: return(0);
465: }
466:
1.14 kristaps 467: /* LINTED */
1.6 kristaps 468: do {
469: t = tree->last->tok;
470: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
471: return(0);
472: } while (t != tokens[tok].ctx);
1.1 kristaps 473:
1.9 kristaps 474: return(1);
1.1 kristaps 475: }
476:
477:
478: static int
479: rofffindarg(const char *name)
480: {
481: size_t i;
482:
483: /* FIXME: use a table, this is slow but ok for now. */
484:
485: /* LINTED */
486: for (i = 0; i < ROFF_ARGMAX; i++)
487: /* LINTED */
1.4 kristaps 488: if (0 == strcmp(name, tokargnames[i]))
1.1 kristaps 489: return((int)i);
490:
491: return(ROFF_ARGMAX);
492: }
493:
494:
495: static int
1.6 kristaps 496: rofffindtok(const char *buf)
1.1 kristaps 497: {
1.6 kristaps 498: char token[4];
1.23 kristaps 499: int i;
1.1 kristaps 500:
1.6 kristaps 501: for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++)
502: token[i] = *buf;
503:
1.9 kristaps 504: if (i == 3)
1.6 kristaps 505: return(ROFF_MAX);
506:
507: token[i] = 0;
508:
1.1 kristaps 509: /* FIXME: use a table, this is slow but ok for now. */
510:
511: /* LINTED */
512: for (i = 0; i < ROFF_MAX; i++)
513: /* LINTED */
1.12 kristaps 514: if (0 == strcmp(toknames[i], token))
1.1 kristaps 515: return((int)i);
1.7 kristaps 516:
1.1 kristaps 517: return(ROFF_MAX);
518: }
519:
520:
1.20 kristaps 521: static int
522: roffispunct(const char *p)
523: {
524:
525: if (0 == *p)
526: return(0);
527: if (0 != *(p + 1))
528: return(0);
529:
530: switch (*p) {
531: case('{'):
532: /* FALLTHROUGH */
533: case('.'):
534: /* FALLTHROUGH */
535: case(','):
536: /* FALLTHROUGH */
537: case(';'):
538: /* FALLTHROUGH */
539: case(':'):
540: /* FALLTHROUGH */
541: case('?'):
542: /* FALLTHROUGH */
543: case('!'):
544: /* FALLTHROUGH */
545: case('('):
546: /* FALLTHROUGH */
547: case(')'):
548: /* FALLTHROUGH */
549: case('['):
550: /* FALLTHROUGH */
551: case(']'):
552: /* FALLTHROUGH */
553: case('}'):
554: return(1);
555: default:
556: break;
557: }
558:
559: return(0);
560: }
561:
562:
1.2 kristaps 563: static int
564: rofffindcallable(const char *name)
565: {
566: int c;
567:
568: if (ROFF_MAX == (c = rofffindtok(name)))
569: return(ROFF_MAX);
1.8 kristaps 570: assert(c >= 0 && c < ROFF_MAX);
1.2 kristaps 571: return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX);
572: }
573:
574:
1.1 kristaps 575: static struct roffnode *
1.4 kristaps 576: roffnode_new(int tokid, struct rofftree *tree)
1.1 kristaps 577: {
578: struct roffnode *p;
579:
1.12 kristaps 580: if (NULL == (p = malloc(sizeof(struct roffnode))))
581: err(1, "malloc");
1.1 kristaps 582:
583: p->tok = tokid;
584: p->parent = tree->last;
585: tree->last = p;
1.9 kristaps 586:
1.1 kristaps 587: return(p);
588: }
589:
590:
1.5 kristaps 591: static int
592: roffargok(int tokid, int argid)
593: {
594: const int *c;
595:
596: if (NULL == (c = tokens[tokid].args))
597: return(0);
598:
599: for ( ; ROFF_ARGMAX != *c; c++)
600: if (argid == *c)
601: return(1);
602:
603: return(0);
604: }
605:
606:
1.1 kristaps 607: static void
1.15 kristaps 608: roffnode_free(struct rofftree *tree)
1.1 kristaps 609: {
610: struct roffnode *p;
611:
612: assert(tree->last);
613:
614: p = tree->last;
615: tree->last = tree->last->parent;
616: free(p);
617: }
618:
619:
1.6 kristaps 620: static int
1.44 kristaps 621: roffspecial(struct rofftree *tree, int tok,
622: const char *start, size_t sz, char **ordp)
1.40 kristaps 623: {
624:
1.44 kristaps 625: switch (tok) {
626: case (ROFF_Nm):
627: if (0 == sz) {
628: if (0 == tree->name[0]) {
629: roff_err(tree, start, "`Nm' not set");
630: return(0);
631: }
632: ordp[0] = tree->name;
633: ordp[1] = NULL;
634: } else if ( ! roffsetname(tree, ordp))
635: return(0);
636: break;
637:
638: case (ROFF_Ex):
639: if (0 == sz) {
640: roff_err(tree, start, "`Ex' expects an arg");
641: return(0);
642: } else if (1 != sz) {
643: roff_err(tree, start, "`Ex' expects one arg");
644: return(0);
645: }
646: break;
647:
648: case (ROFF_Sm):
649: if (0 == sz) {
650: roff_err(tree, start, "`Sm' expects an arg");
651: return(0);
652: } else if (1 != sz) {
653: roff_err(tree, start, "`Sm' expects one arg");
654: return(0);
655: }
656:
657: if (0 != strcmp(ordp[0], "on") &&
658: 0 != strcmp(ordp[0], "off")) {
659: roff_err(tree, start, "`Sm' has invalid argument");
660: return(0);
661: }
662: break;
1.45 ! kristaps 663:
! 664: case (ROFF_Ud):
! 665: /* FALLTHROUGH */
! 666: case (ROFF_Bt):
! 667: if (0 != sz) {
! 668: roff_err(tree, start, "`%s' expects no args",
! 669: toknames[tok]);
! 670: return(0);
! 671: }
! 672: break;
1.44 kristaps 673: default:
674: break;
675: }
676:
677: return((*tree->cb.roffspecial)
678: (tree->arg, tok, tree->cur, ordp));
1.40 kristaps 679: }
680:
681:
682: static int
1.33 kristaps 683: roffcall(struct rofftree *tree, int tok, char **argv)
684: {
685:
686: if (NULL == tokens[tok].cb) {
687: roff_err(tree, *argv, "unsupported macro `%s'",
688: toknames[tok]);
689: return(0);
690: }
691: if ( ! (*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER))
692: return(0);
693: return(1);
694: }
695:
696:
697: static int
1.12 kristaps 698: roffnextopt(const struct rofftree *tree, int tok,
1.18 kristaps 699: char ***in, char **val)
1.6 kristaps 700: {
1.18 kristaps 701: char *arg, **argv;
1.6 kristaps 702: int v;
703:
704: *val = NULL;
705: argv = *in;
706: assert(argv);
707:
708: if (NULL == (arg = *argv))
709: return(-1);
710: if ('-' != *arg)
711: return(-1);
712:
1.12 kristaps 713: if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) {
714: roff_warn(tree, arg, "argument-like parameter `%s' to "
1.33 kristaps 715: "`%s'", arg, toknames[tok]);
1.6 kristaps 716: return(-1);
1.12 kristaps 717: }
718:
719: if ( ! roffargok(tok, v)) {
720: roff_warn(tree, arg, "invalid argument parameter `%s' to "
721: "`%s'", tokargnames[v], toknames[tok]);
1.6 kristaps 722: return(-1);
1.12 kristaps 723: }
724:
725: if ( ! (ROFF_VALUE & tokenargs[v]))
1.6 kristaps 726: return(v);
727:
728: *in = ++argv;
729:
1.12 kristaps 730: if (NULL == *argv) {
731: roff_err(tree, arg, "empty value of `%s' for `%s'",
732: tokargnames[v], toknames[tok]);
733: return(ROFF_ARGMAX);
734: }
1.6 kristaps 735:
1.12 kristaps 736: return(v);
1.6 kristaps 737: }
738:
739:
1.27 kristaps 740: static int
1.31 kristaps 741: roffpurgepunct(struct rofftree *tree, char **argv)
742: {
743: int i;
744:
745: i = 0;
746: while (argv[i])
747: i++;
748: assert(i > 0);
749: if ( ! roffispunct(argv[--i]))
750: return(1);
751: while (i >= 0 && roffispunct(argv[i]))
752: i--;
753: i++;
754:
755: /* LINTED */
756: while (argv[i])
1.37 kristaps 757: if ( ! roffdata(tree, 0, argv[i++]))
1.31 kristaps 758: return(0);
759: return(1);
760: }
761:
762:
763: static int
1.27 kristaps 764: roffparseopts(struct rofftree *tree, int tok,
765: char ***args, int *argc, char **argv)
766: {
767: int i, c;
768: char *v;
769:
770: i = 0;
771:
772: while (-1 != (c = roffnextopt(tree, tok, args, &v))) {
773: if (ROFF_ARGMAX == c)
774: return(0);
775:
776: argc[i] = c;
777: argv[i] = v;
778: i++;
779: *args = *args + 1;
780: }
781:
782: argc[i] = ROFF_ARGMAX;
783: argv[i] = NULL;
784: return(1);
785: }
786:
787:
1.37 kristaps 788: static int
789: roffdata(struct rofftree *tree, int space, char *buf)
790: {
791:
1.38 kristaps 792: if (0 == *buf)
793: return(1);
1.37 kristaps 794: return((*tree->cb.roffdata)(tree->arg,
795: space != 0, tree->cur, buf));
796: }
797:
798:
1.1 kristaps 799: /* ARGSUSED */
800: static int
801: roff_Dd(ROFFCALL_ARGS)
802: {
1.30 kristaps 803: time_t t;
804: char *p, buf[32];
1.1 kristaps 805:
1.4 kristaps 806: if (ROFF_BODY & tree->state) {
807: assert( ! (ROFF_PRELUDE & tree->state));
808: assert(ROFF_PRELUDE_Dd & tree->state);
809: return(roff_text(tok, tree, argv, type));
810: }
811:
1.1 kristaps 812: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 813: assert( ! (ROFF_BODY & tree->state));
814:
1.6 kristaps 815: if (ROFF_PRELUDE_Dd & tree->state) {
1.12 kristaps 816: roff_err(tree, *argv, "repeated `Dd' in prelude");
1.6 kristaps 817: return(0);
818: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 819: roff_err(tree, *argv, "out-of-order `Dd' in prelude");
1.1 kristaps 820: return(0);
821: }
822:
1.30 kristaps 823: assert(NULL == tree->last);
824:
825: argv++;
826:
827: if (0 == strcmp(*argv, "$Mdocdate$")) {
828: t = time(NULL);
829: if (NULL == localtime_r(&t, &tree->tm))
830: err(1, "localtime_r");
831: tree->state |= ROFF_PRELUDE_Dd;
832: return(1);
833: }
834:
835: /* Build this from Mdocdate or raw date. */
836:
837: buf[0] = 0;
838: p = *argv;
839:
840: if (0 != strcmp(*argv, "$Mdocdate:")) {
841: while (*argv) {
842: if (strlcat(buf, *argv++, sizeof(buf))
843: < sizeof(buf))
844: continue;
845: roff_err(tree, p, "bad `Dd' date");
846: return(0);
847: }
848: if (strptime(buf, "%b%d,%Y", &tree->tm)) {
849: tree->state |= ROFF_PRELUDE_Dd;
850: return(1);
851: }
852: roff_err(tree, *argv, "bad `Dd' date");
853: return(0);
854: }
855:
856: argv++;
857: while (*argv && **argv != '$') {
858: if (strlcat(buf, *argv++, sizeof(buf))
859: >= sizeof(buf)) {
860: roff_err(tree, p, "bad `Dd' Mdocdate");
861: return(0);
862: }
863: if (strlcat(buf, " ", sizeof(buf))
864: >= sizeof(buf)) {
865: roff_err(tree, p, "bad `Dd' Mdocdate");
866: return(0);
867: }
868: }
869: if (NULL == *argv) {
870: roff_err(tree, p, "bad `Dd' Mdocdate");
871: return(0);
872: }
873:
874: if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) {
875: roff_err(tree, *argv, "bad `Dd' Mdocdate");
876: return(0);
877: }
1.4 kristaps 878:
1.1 kristaps 879: tree->state |= ROFF_PRELUDE_Dd;
880: return(1);
881: }
882:
883:
884: /* ARGSUSED */
885: static int
886: roff_Dt(ROFFCALL_ARGS)
887: {
888:
1.4 kristaps 889: if (ROFF_BODY & tree->state) {
890: assert( ! (ROFF_PRELUDE & tree->state));
891: assert(ROFF_PRELUDE_Dt & tree->state);
892: return(roff_text(tok, tree, argv, type));
893: }
894:
1.1 kristaps 895: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 896: assert( ! (ROFF_BODY & tree->state));
897:
1.6 kristaps 898: if ( ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 899: roff_err(tree, *argv, "out-of-order `Dt' in prelude");
1.1 kristaps 900: return(0);
1.6 kristaps 901: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 902: roff_err(tree, *argv, "repeated `Dt' in prelude");
1.6 kristaps 903: return(0);
1.1 kristaps 904: }
905:
1.30 kristaps 906: argv++;
907: if (NULL == *argv) {
908: roff_err(tree, *argv, "`Dt' needs document title");
909: return(0);
910: } else if (strlcpy(tree->title, *argv, sizeof(tree->title))
911: >= sizeof(tree->title)) {
912: roff_err(tree, *argv, "`Dt' document title too long");
913: return(0);
914: }
915:
916: argv++;
917: if (NULL == *argv) {
918: roff_err(tree, *argv, "`Dt' needs section");
919: return(0);
920: } else if (strlcpy(tree->section, *argv, sizeof(tree->section))
921: >= sizeof(tree->section)) {
922: roff_err(tree, *argv, "`Dt' section too long");
923: return(0);
924: }
925:
926: argv++;
927: if (NULL == *argv) {
928: tree->volume[0] = 0;
929: } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume))
930: >= sizeof(tree->volume)) {
931: roff_err(tree, *argv, "`Dt' volume too long");
932: return(0);
933: }
1.4 kristaps 934:
1.1 kristaps 935: assert(NULL == tree->last);
936: tree->state |= ROFF_PRELUDE_Dt;
937:
938: return(1);
939: }
940:
941:
1.42 kristaps 942: static int
943: roffsetname(struct rofftree *tree, char **ordp)
944: {
945:
946: assert(*ordp);
947:
948: /* FIXME: not all sections can set this. */
949:
950: if (NULL != *(ordp + 1)) {
951: roff_err(tree, *ordp, "too many `Nm' args");
952: return(0);
953: }
954:
955: if (strlcpy(tree->name, *ordp, sizeof(tree->name))
956: >= sizeof(tree->name)) {
957: roff_err(tree, *ordp, "`Nm' arg too long");
958: return(0);
959: }
960:
961: return(1);
962: }
963:
964:
1.1 kristaps 965: /* ARGSUSED */
1.42 kristaps 966: static int
1.33 kristaps 967: roff_Sm(ROFFCALL_ARGS)
1.31 kristaps 968: {
1.44 kristaps 969: char *ordp[1], *p;
1.31 kristaps 970:
1.33 kristaps 971: p = *argv++;
1.44 kristaps 972: *ordp = *argv;
1.31 kristaps 973:
1.44 kristaps 974: return(roffspecial(tree, tok, p, *ordp ? 1 : 0, ordp));
1.33 kristaps 975: }
976:
977:
978: /* ARGSUSED */
979: static int
980: roff_Ns(ROFFCALL_ARGS)
981: {
982: int j, c, first;
1.40 kristaps 983: char *morep[1];
1.33 kristaps 984:
985: first = (*argv++ == tree->cur);
1.40 kristaps 986: morep[0] = NULL;
1.33 kristaps 987:
1.44 kristaps 988: if ( ! roffspecial(tree, tok, *argv, 0, morep))
1.33 kristaps 989: return(0);
1.31 kristaps 990:
1.33 kristaps 991: while (*argv) {
992: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
993: if ( ! roffcall(tree, c, argv))
994: return(0);
1.31 kristaps 995: break;
996: }
1.33 kristaps 997:
998: if ( ! roffispunct(*argv)) {
1.37 kristaps 999: if ( ! roffdata(tree, 1, *argv++))
1000: return(0);
1001: continue;
1.31 kristaps 1002: }
1.37 kristaps 1003:
1.33 kristaps 1004: for (j = 0; argv[j]; j++)
1005: if ( ! roffispunct(argv[j]))
1006: break;
1007:
1008: if (argv[j]) {
1.37 kristaps 1009: if ( ! roffdata(tree, 0, *argv++))
1010: return(0);
1011: continue;
1.33 kristaps 1012: }
1013:
1.31 kristaps 1014: break;
1015: }
1016:
1017: if ( ! first)
1018: return(1);
1.33 kristaps 1019:
1.31 kristaps 1020: return(roffpurgepunct(tree, argv));
1021: }
1022:
1023:
1024: /* ARGSUSED */
1025: static int
1.1 kristaps 1026: roff_Os(ROFFCALL_ARGS)
1027: {
1.30 kristaps 1028: char *p;
1.1 kristaps 1029:
1.30 kristaps 1030: if (ROFF_BODY & tree->state) {
1.4 kristaps 1031: assert( ! (ROFF_PRELUDE & tree->state));
1032: assert(ROFF_PRELUDE_Os & tree->state);
1033: return(roff_text(tok, tree, argv, type));
1034: }
1.1 kristaps 1035:
1036: assert(ROFF_PRELUDE & tree->state);
1037: if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
1038: ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 1039: roff_err(tree, *argv, "out-of-order `Os' in prelude");
1.1 kristaps 1040: return(0);
1041: }
1042:
1.30 kristaps 1043: tree->os[0] = 0;
1044:
1045: p = *++argv;
1046:
1047: while (*argv) {
1048: if (strlcat(tree->os, *argv++, sizeof(tree->os))
1049: < sizeof(tree->os))
1050: continue;
1051: roff_err(tree, p, "`Os' value too long");
1052: return(0);
1053: }
1054:
1055: if (0 == tree->os[0])
1056: if (strlcpy(tree->os, "LOCAL", sizeof(tree->os))
1057: >= sizeof(tree->os)) {
1058: roff_err(tree, p, "`Os' value too long");
1059: return(0);
1060: }
1.1 kristaps 1061:
1062: tree->state |= ROFF_PRELUDE_Os;
1063: tree->state &= ~ROFF_PRELUDE;
1064: tree->state |= ROFF_BODY;
1065:
1.4 kristaps 1066: assert(NULL == tree->last);
1067:
1.36 kristaps 1068: return((*tree->cb.roffhead)(tree->arg, &tree->tm,
1069: tree->os, tree->title, tree->section,
1070: tree->volume));
1.1 kristaps 1071: }
1072:
1073:
1074: /* ARGSUSED */
1075: static int
1.2 kristaps 1076: roff_layout(ROFFCALL_ARGS)
1.1 kristaps 1077: {
1.37 kristaps 1078: int i, c, argcp[ROFF_MAXLINEARG];
1079: char *argvp[ROFF_MAXLINEARG];
1.1 kristaps 1080:
1.4 kristaps 1081: if (ROFF_PRELUDE & tree->state) {
1.27 kristaps 1082: roff_err(tree, *argv, "bad `%s' in prelude",
1.12 kristaps 1083: toknames[tok]);
1.4 kristaps 1084: return(0);
1.27 kristaps 1085: } else if (ROFF_EXIT == type) {
1.15 kristaps 1086: roffnode_free(tree);
1.35 kristaps 1087: if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok))
1088: return(0);
1.15 kristaps 1089: return((*tree->cb.roffblkout)(tree->arg, tok));
1.2 kristaps 1090: }
1.1 kristaps 1091:
1.27 kristaps 1092: assert( ! (ROFF_CALLABLE & tokens[tok].flags));
1.5 kristaps 1093:
1.27 kristaps 1094: ++argv;
1.5 kristaps 1095:
1.27 kristaps 1096: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1097: return(0);
1.4 kristaps 1098: if (NULL == roffnode_new(tok, tree))
1.2 kristaps 1099: return(0);
1100:
1.27 kristaps 1101: /*
1102: * Layouts have two parts: the layout body and header. The
1103: * layout header is the trailing text of the line macro, while
1104: * the layout body is everything following until termination.
1105: */
1106:
1.18 kristaps 1107: if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp))
1108: return(0);
1109: if (NULL == *argv)
1.35 kristaps 1110: return((*tree->cb.roffblkbodyin)
1111: (tree->arg, tok, argcp, argvp));
1112:
1113: if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1114: return(0);
1115:
1.27 kristaps 1116: /*
1117: * If there are no parsable parts, then write remaining tokens
1118: * into the layout header and exit.
1119: */
1120:
1.2 kristaps 1121: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1122: i = 0;
1.37 kristaps 1123: while (*argv)
1124: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1125: return(0);
1.37 kristaps 1126:
1.35 kristaps 1127: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1128: return(0);
1129: return((*tree->cb.roffblkbodyin)
1130: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1131: }
1132:
1.27 kristaps 1133: /*
1134: * Parsable elements may be in the header (or be the header, for
1135: * that matter). Follow the regular parsing rules for these.
1136: */
1137:
1.21 kristaps 1138: i = 0;
1.1 kristaps 1139: while (*argv) {
1.26 kristaps 1140: if (ROFF_MAX == (c = rofffindcallable(*argv))) {
1141: assert(tree->arg);
1.37 kristaps 1142: if ( ! roffdata(tree, i++, *argv++))
1.8 kristaps 1143: return(0);
1.26 kristaps 1144: continue;
1145: }
1.33 kristaps 1146: if ( ! roffcall(tree, c, argv))
1.14 kristaps 1147: return(0);
1.26 kristaps 1148: break;
1.21 kristaps 1149: }
1150:
1151: /*
1.27 kristaps 1152: * If there's trailing punctuation in the header, then write it
1153: * out now. Here we mimic the behaviour of a line-dominant text
1154: * macro.
1.21 kristaps 1155: */
1156:
1.35 kristaps 1157: if (NULL == *argv) {
1158: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1159: return(0);
1160: return((*tree->cb.roffblkbodyin)
1161: (tree->arg, tok, argcp, argvp));
1162: }
1.21 kristaps 1163:
1.27 kristaps 1164: /*
1165: * Expensive. Scan to the end of line then work backwards until
1166: * a token isn't punctuation.
1167: */
1168:
1.31 kristaps 1169: if ( ! roffpurgepunct(tree, argv))
1170: return(0);
1.12 kristaps 1171:
1.35 kristaps 1172: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1173: return(0);
1174: return((*tree->cb.roffblkbodyin)
1175: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1176: }
1177:
1178:
1179: /* ARGSUSED */
1180: static int
1.40 kristaps 1181: roff_ordered(ROFFCALL_ARGS)
1182: {
1.44 kristaps 1183: int i, first, c, argcp[ROFF_MAXLINEARG];
1184: char *ordp[ROFF_MAXLINEARG], *p,
1185: *argvp[ROFF_MAXLINEARG];
1.40 kristaps 1186:
1187: if (ROFF_PRELUDE & tree->state) {
1188: roff_err(tree, *argv, "`%s' disallowed in prelude",
1189: toknames[tok]);
1190: return(0);
1191: }
1192:
1193: first = (*argv == tree->cur);
1.44 kristaps 1194: p = *argv++;
1.40 kristaps 1195:
1.44 kristaps 1196: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1197: return(0);
1.40 kristaps 1198:
1.44 kristaps 1199: if (NULL == *argv)
1200: return(roffspecial(tree, tok, p, 0, ordp));
1.40 kristaps 1201:
1202: i = 0;
1203: while (*argv && i < ROFF_MAXLINEARG) {
1.42 kristaps 1204: c = rofffindcallable(*argv);
1205:
1206: if (ROFF_MAX == c && ! roffispunct(*argv)) {
1207: ordp[i++] = *argv++;
1208: continue;
1209: }
1210: ordp[i] = NULL;
1211:
1212: if (ROFF_MAX == c)
1213: break;
1214:
1.44 kristaps 1215: if ( ! roffspecial(tree, tok, p, (size_t)i, ordp))
1.42 kristaps 1216: return(0);
1.40 kristaps 1217:
1.42 kristaps 1218: return(roffcall(tree, c, ordp));
1.40 kristaps 1219: }
1220:
1.42 kristaps 1221: assert(i != ROFF_MAXLINEARG);
1.40 kristaps 1222: ordp[i] = NULL;
1223:
1.44 kristaps 1224: if ( ! roffspecial(tree, tok, p, (size_t)i, ordp))
1.40 kristaps 1225: return(0);
1226:
1227: /* FIXME: error if there's stuff after the punctuation. */
1228:
1229: if ( ! first || NULL == *argv)
1230: return(1);
1231:
1232: return(roffpurgepunct(tree, argv));
1233: }
1234:
1235:
1236: /* ARGSUSED */
1237: static int
1.2 kristaps 1238: roff_text(ROFFCALL_ARGS)
1239: {
1.37 kristaps 1240: int i, j, first, c, argcp[ROFF_MAXLINEARG];
1241: char *argvp[ROFF_MAXLINEARG];
1.2 kristaps 1242:
1.4 kristaps 1243: if (ROFF_PRELUDE & tree->state) {
1.12 kristaps 1244: roff_err(tree, *argv, "`%s' disallowed in prelude",
1245: toknames[tok]);
1.4 kristaps 1246: return(0);
1247: }
1248:
1.27 kristaps 1249: first = (*argv == tree->cur);
1.12 kristaps 1250: argv++;
1.5 kristaps 1251:
1.27 kristaps 1252: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1253: return(0);
1.24 kristaps 1254: if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1255: return(0);
1.27 kristaps 1256: if (NULL == *argv)
1257: return((*tree->cb.roffout)(tree->arg, tok));
1.1 kristaps 1258:
1.2 kristaps 1259: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1260: i = 0;
1.37 kristaps 1261: while (*argv)
1262: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1263: return(0);
1.37 kristaps 1264:
1.15 kristaps 1265: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 1266: }
1.1 kristaps 1267:
1.27 kristaps 1268: /*
1269: * Deal with punctuation. Ugly. Work ahead until we encounter
1270: * terminating punctuation. If we encounter it and all
1271: * subsequent tokens are punctuation, then stop processing (the
1272: * line-dominant macro will print these tokens after closure).
1273: */
1274:
1.21 kristaps 1275: i = 0;
1.2 kristaps 1276: while (*argv) {
1.33 kristaps 1277: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
1278: if ( ! (ROFF_LSCOPE & tokens[tok].flags))
1279: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1280: return(0);
1281:
1282: if ( ! roffcall(tree, c, argv))
1283: return(0);
1284:
1285: if (ROFF_LSCOPE & tokens[tok].flags)
1286: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.27 kristaps 1287: return(0);
1.33 kristaps 1288:
1289: break;
1290: }
1.21 kristaps 1291:
1.33 kristaps 1292: if ( ! roffispunct(*argv)) {
1.37 kristaps 1293: if ( ! roffdata(tree, i++, *argv++))
1.33 kristaps 1294: return(0);
1295: continue;
1296: }
1.27 kristaps 1297:
1.33 kristaps 1298: i = 1;
1299: for (j = 0; argv[j]; j++)
1300: if ( ! roffispunct(argv[j]))
1301: break;
1.27 kristaps 1302:
1.33 kristaps 1303: if (argv[j]) {
1.37 kristaps 1304: if ( ! roffdata(tree, 0, *argv++))
1.27 kristaps 1305: return(0);
1.33 kristaps 1306: continue;
1.8 kristaps 1307: }
1.20 kristaps 1308:
1.33 kristaps 1309: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.14 kristaps 1310: return(0);
1.20 kristaps 1311: break;
1.14 kristaps 1312: }
1.12 kristaps 1313:
1.27 kristaps 1314: if (NULL == *argv)
1315: return((*tree->cb.roffout)(tree->arg, tok));
1316: if ( ! first)
1317: return(1);
1.21 kristaps 1318:
1.31 kristaps 1319: return(roffpurgepunct(tree, argv));
1.6 kristaps 1320: }
1321:
1322:
1.9 kristaps 1323: /* ARGSUSED */
1.6 kristaps 1324: static int
1.27 kristaps 1325: roff_noop(ROFFCALL_ARGS)
1.6 kristaps 1326: {
1327:
1328: return(1);
1.1 kristaps 1329: }
1.9 kristaps 1330:
1331:
1332: /* ARGSUSED */
1333: static int
1.27 kristaps 1334: roff_depr(ROFFCALL_ARGS)
1.9 kristaps 1335: {
1336:
1.27 kristaps 1337: roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]);
1338: return(0);
1.11 kristaps 1339: }
1.12 kristaps 1340:
1341:
1342: static void
1343: roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...)
1344: {
1345: va_list ap;
1346: char buf[128];
1347:
1348: va_start(ap, fmt);
1349: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1350: va_end(ap);
1351:
1.15 kristaps 1352: (*tree->cb.roffmsg)(tree->arg,
1353: ROFF_WARN, tree->cur, pos, buf);
1.12 kristaps 1354: }
1355:
1356:
1357: static void
1358: roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...)
1359: {
1360: va_list ap;
1361: char buf[128];
1362:
1363: va_start(ap, fmt);
1364: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1365: va_end(ap);
1366:
1.15 kristaps 1367: (*tree->cb.roffmsg)(tree->arg,
1368: ROFF_ERROR, tree->cur, pos, buf);
1.12 kristaps 1369: }
1.33 kristaps 1370:
CVSweb