Annotation of mandoc/roff.c, Revision 1.44
1.44 ! kristaps 1: /* $Id: roff.c,v 1.43 2008/12/05 22:54: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;
! 663: default:
! 664: break;
! 665: }
! 666:
! 667: return((*tree->cb.roffspecial)
! 668: (tree->arg, tok, tree->cur, ordp));
1.40 kristaps 669: }
670:
671:
672: static int
1.33 kristaps 673: roffcall(struct rofftree *tree, int tok, char **argv)
674: {
675:
676: if (NULL == tokens[tok].cb) {
677: roff_err(tree, *argv, "unsupported macro `%s'",
678: toknames[tok]);
679: return(0);
680: }
681: if ( ! (*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER))
682: return(0);
683: return(1);
684: }
685:
686:
687: static int
1.12 kristaps 688: roffnextopt(const struct rofftree *tree, int tok,
1.18 kristaps 689: char ***in, char **val)
1.6 kristaps 690: {
1.18 kristaps 691: char *arg, **argv;
1.6 kristaps 692: int v;
693:
694: *val = NULL;
695: argv = *in;
696: assert(argv);
697:
698: if (NULL == (arg = *argv))
699: return(-1);
700: if ('-' != *arg)
701: return(-1);
702:
1.12 kristaps 703: if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) {
704: roff_warn(tree, arg, "argument-like parameter `%s' to "
1.33 kristaps 705: "`%s'", arg, toknames[tok]);
1.6 kristaps 706: return(-1);
1.12 kristaps 707: }
708:
709: if ( ! roffargok(tok, v)) {
710: roff_warn(tree, arg, "invalid argument parameter `%s' to "
711: "`%s'", tokargnames[v], toknames[tok]);
1.6 kristaps 712: return(-1);
1.12 kristaps 713: }
714:
715: if ( ! (ROFF_VALUE & tokenargs[v]))
1.6 kristaps 716: return(v);
717:
718: *in = ++argv;
719:
1.12 kristaps 720: if (NULL == *argv) {
721: roff_err(tree, arg, "empty value of `%s' for `%s'",
722: tokargnames[v], toknames[tok]);
723: return(ROFF_ARGMAX);
724: }
1.6 kristaps 725:
1.12 kristaps 726: return(v);
1.6 kristaps 727: }
728:
729:
1.27 kristaps 730: static int
1.31 kristaps 731: roffpurgepunct(struct rofftree *tree, char **argv)
732: {
733: int i;
734:
735: i = 0;
736: while (argv[i])
737: i++;
738: assert(i > 0);
739: if ( ! roffispunct(argv[--i]))
740: return(1);
741: while (i >= 0 && roffispunct(argv[i]))
742: i--;
743: i++;
744:
745: /* LINTED */
746: while (argv[i])
1.37 kristaps 747: if ( ! roffdata(tree, 0, argv[i++]))
1.31 kristaps 748: return(0);
749: return(1);
750: }
751:
752:
753: static int
1.27 kristaps 754: roffparseopts(struct rofftree *tree, int tok,
755: char ***args, int *argc, char **argv)
756: {
757: int i, c;
758: char *v;
759:
760: i = 0;
761:
762: while (-1 != (c = roffnextopt(tree, tok, args, &v))) {
763: if (ROFF_ARGMAX == c)
764: return(0);
765:
766: argc[i] = c;
767: argv[i] = v;
768: i++;
769: *args = *args + 1;
770: }
771:
772: argc[i] = ROFF_ARGMAX;
773: argv[i] = NULL;
774: return(1);
775: }
776:
777:
1.37 kristaps 778: static int
779: roffdata(struct rofftree *tree, int space, char *buf)
780: {
781:
1.38 kristaps 782: if (0 == *buf)
783: return(1);
1.37 kristaps 784: return((*tree->cb.roffdata)(tree->arg,
785: space != 0, tree->cur, buf));
786: }
787:
788:
1.1 kristaps 789: /* ARGSUSED */
790: static int
791: roff_Dd(ROFFCALL_ARGS)
792: {
1.30 kristaps 793: time_t t;
794: char *p, buf[32];
1.1 kristaps 795:
1.4 kristaps 796: if (ROFF_BODY & tree->state) {
797: assert( ! (ROFF_PRELUDE & tree->state));
798: assert(ROFF_PRELUDE_Dd & tree->state);
799: return(roff_text(tok, tree, argv, type));
800: }
801:
1.1 kristaps 802: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 803: assert( ! (ROFF_BODY & tree->state));
804:
1.6 kristaps 805: if (ROFF_PRELUDE_Dd & tree->state) {
1.12 kristaps 806: roff_err(tree, *argv, "repeated `Dd' in prelude");
1.6 kristaps 807: return(0);
808: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 809: roff_err(tree, *argv, "out-of-order `Dd' in prelude");
1.1 kristaps 810: return(0);
811: }
812:
1.30 kristaps 813: assert(NULL == tree->last);
814:
815: argv++;
816:
817: if (0 == strcmp(*argv, "$Mdocdate$")) {
818: t = time(NULL);
819: if (NULL == localtime_r(&t, &tree->tm))
820: err(1, "localtime_r");
821: tree->state |= ROFF_PRELUDE_Dd;
822: return(1);
823: }
824:
825: /* Build this from Mdocdate or raw date. */
826:
827: buf[0] = 0;
828: p = *argv;
829:
830: if (0 != strcmp(*argv, "$Mdocdate:")) {
831: while (*argv) {
832: if (strlcat(buf, *argv++, sizeof(buf))
833: < sizeof(buf))
834: continue;
835: roff_err(tree, p, "bad `Dd' date");
836: return(0);
837: }
838: if (strptime(buf, "%b%d,%Y", &tree->tm)) {
839: tree->state |= ROFF_PRELUDE_Dd;
840: return(1);
841: }
842: roff_err(tree, *argv, "bad `Dd' date");
843: return(0);
844: }
845:
846: argv++;
847: while (*argv && **argv != '$') {
848: if (strlcat(buf, *argv++, sizeof(buf))
849: >= sizeof(buf)) {
850: roff_err(tree, p, "bad `Dd' Mdocdate");
851: return(0);
852: }
853: if (strlcat(buf, " ", sizeof(buf))
854: >= sizeof(buf)) {
855: roff_err(tree, p, "bad `Dd' Mdocdate");
856: return(0);
857: }
858: }
859: if (NULL == *argv) {
860: roff_err(tree, p, "bad `Dd' Mdocdate");
861: return(0);
862: }
863:
864: if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) {
865: roff_err(tree, *argv, "bad `Dd' Mdocdate");
866: return(0);
867: }
1.4 kristaps 868:
1.1 kristaps 869: tree->state |= ROFF_PRELUDE_Dd;
870: return(1);
871: }
872:
873:
874: /* ARGSUSED */
875: static int
876: roff_Dt(ROFFCALL_ARGS)
877: {
878:
1.4 kristaps 879: if (ROFF_BODY & tree->state) {
880: assert( ! (ROFF_PRELUDE & tree->state));
881: assert(ROFF_PRELUDE_Dt & tree->state);
882: return(roff_text(tok, tree, argv, type));
883: }
884:
1.1 kristaps 885: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 886: assert( ! (ROFF_BODY & tree->state));
887:
1.6 kristaps 888: if ( ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 889: roff_err(tree, *argv, "out-of-order `Dt' in prelude");
1.1 kristaps 890: return(0);
1.6 kristaps 891: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 892: roff_err(tree, *argv, "repeated `Dt' in prelude");
1.6 kristaps 893: return(0);
1.1 kristaps 894: }
895:
1.30 kristaps 896: argv++;
897: if (NULL == *argv) {
898: roff_err(tree, *argv, "`Dt' needs document title");
899: return(0);
900: } else if (strlcpy(tree->title, *argv, sizeof(tree->title))
901: >= sizeof(tree->title)) {
902: roff_err(tree, *argv, "`Dt' document title too long");
903: return(0);
904: }
905:
906: argv++;
907: if (NULL == *argv) {
908: roff_err(tree, *argv, "`Dt' needs section");
909: return(0);
910: } else if (strlcpy(tree->section, *argv, sizeof(tree->section))
911: >= sizeof(tree->section)) {
912: roff_err(tree, *argv, "`Dt' section too long");
913: return(0);
914: }
915:
916: argv++;
917: if (NULL == *argv) {
918: tree->volume[0] = 0;
919: } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume))
920: >= sizeof(tree->volume)) {
921: roff_err(tree, *argv, "`Dt' volume too long");
922: return(0);
923: }
1.4 kristaps 924:
1.1 kristaps 925: assert(NULL == tree->last);
926: tree->state |= ROFF_PRELUDE_Dt;
927:
928: return(1);
929: }
930:
931:
1.42 kristaps 932: static int
933: roffsetname(struct rofftree *tree, char **ordp)
934: {
935:
936: assert(*ordp);
937:
938: /* FIXME: not all sections can set this. */
939:
940: if (NULL != *(ordp + 1)) {
941: roff_err(tree, *ordp, "too many `Nm' args");
942: return(0);
943: }
944:
945: if (strlcpy(tree->name, *ordp, sizeof(tree->name))
946: >= sizeof(tree->name)) {
947: roff_err(tree, *ordp, "`Nm' arg too long");
948: return(0);
949: }
950:
951: return(1);
952: }
953:
954:
1.1 kristaps 955: /* ARGSUSED */
1.42 kristaps 956: static int
1.33 kristaps 957: roff_Sm(ROFFCALL_ARGS)
1.31 kristaps 958: {
1.44 ! kristaps 959: char *ordp[1], *p;
1.31 kristaps 960:
1.33 kristaps 961: p = *argv++;
1.44 ! kristaps 962: *ordp = *argv;
1.31 kristaps 963:
1.44 ! kristaps 964: return(roffspecial(tree, tok, p, *ordp ? 1 : 0, ordp));
1.33 kristaps 965: }
966:
967:
968: /* ARGSUSED */
969: static int
970: roff_Ns(ROFFCALL_ARGS)
971: {
972: int j, c, first;
1.40 kristaps 973: char *morep[1];
1.33 kristaps 974:
975: first = (*argv++ == tree->cur);
1.40 kristaps 976: morep[0] = NULL;
1.33 kristaps 977:
1.44 ! kristaps 978: if ( ! roffspecial(tree, tok, *argv, 0, morep))
1.33 kristaps 979: return(0);
1.31 kristaps 980:
1.33 kristaps 981: while (*argv) {
982: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
983: if ( ! roffcall(tree, c, argv))
984: return(0);
1.31 kristaps 985: break;
986: }
1.33 kristaps 987:
988: if ( ! roffispunct(*argv)) {
1.37 kristaps 989: if ( ! roffdata(tree, 1, *argv++))
990: return(0);
991: continue;
1.31 kristaps 992: }
1.37 kristaps 993:
1.33 kristaps 994: for (j = 0; argv[j]; j++)
995: if ( ! roffispunct(argv[j]))
996: break;
997:
998: if (argv[j]) {
1.37 kristaps 999: if ( ! roffdata(tree, 0, *argv++))
1000: return(0);
1001: continue;
1.33 kristaps 1002: }
1003:
1.31 kristaps 1004: break;
1005: }
1006:
1007: if ( ! first)
1008: return(1);
1.33 kristaps 1009:
1.31 kristaps 1010: return(roffpurgepunct(tree, argv));
1011: }
1012:
1013:
1014: /* ARGSUSED */
1015: static int
1.1 kristaps 1016: roff_Os(ROFFCALL_ARGS)
1017: {
1.30 kristaps 1018: char *p;
1.1 kristaps 1019:
1.30 kristaps 1020: if (ROFF_BODY & tree->state) {
1.4 kristaps 1021: assert( ! (ROFF_PRELUDE & tree->state));
1022: assert(ROFF_PRELUDE_Os & tree->state);
1023: return(roff_text(tok, tree, argv, type));
1024: }
1.1 kristaps 1025:
1026: assert(ROFF_PRELUDE & tree->state);
1027: if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
1028: ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 1029: roff_err(tree, *argv, "out-of-order `Os' in prelude");
1.1 kristaps 1030: return(0);
1031: }
1032:
1.30 kristaps 1033: tree->os[0] = 0;
1034:
1035: p = *++argv;
1036:
1037: while (*argv) {
1038: if (strlcat(tree->os, *argv++, sizeof(tree->os))
1039: < sizeof(tree->os))
1040: continue;
1041: roff_err(tree, p, "`Os' value too long");
1042: return(0);
1043: }
1044:
1045: if (0 == tree->os[0])
1046: if (strlcpy(tree->os, "LOCAL", sizeof(tree->os))
1047: >= sizeof(tree->os)) {
1048: roff_err(tree, p, "`Os' value too long");
1049: return(0);
1050: }
1.1 kristaps 1051:
1052: tree->state |= ROFF_PRELUDE_Os;
1053: tree->state &= ~ROFF_PRELUDE;
1054: tree->state |= ROFF_BODY;
1055:
1.4 kristaps 1056: assert(NULL == tree->last);
1057:
1.36 kristaps 1058: return((*tree->cb.roffhead)(tree->arg, &tree->tm,
1059: tree->os, tree->title, tree->section,
1060: tree->volume));
1.1 kristaps 1061: }
1062:
1063:
1064: /* ARGSUSED */
1065: static int
1.2 kristaps 1066: roff_layout(ROFFCALL_ARGS)
1.1 kristaps 1067: {
1.37 kristaps 1068: int i, c, argcp[ROFF_MAXLINEARG];
1069: char *argvp[ROFF_MAXLINEARG];
1.1 kristaps 1070:
1.4 kristaps 1071: if (ROFF_PRELUDE & tree->state) {
1.27 kristaps 1072: roff_err(tree, *argv, "bad `%s' in prelude",
1.12 kristaps 1073: toknames[tok]);
1.4 kristaps 1074: return(0);
1.27 kristaps 1075: } else if (ROFF_EXIT == type) {
1.15 kristaps 1076: roffnode_free(tree);
1.35 kristaps 1077: if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok))
1078: return(0);
1.15 kristaps 1079: return((*tree->cb.roffblkout)(tree->arg, tok));
1.2 kristaps 1080: }
1.1 kristaps 1081:
1.27 kristaps 1082: assert( ! (ROFF_CALLABLE & tokens[tok].flags));
1.5 kristaps 1083:
1.27 kristaps 1084: ++argv;
1.5 kristaps 1085:
1.27 kristaps 1086: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1087: return(0);
1.4 kristaps 1088: if (NULL == roffnode_new(tok, tree))
1.2 kristaps 1089: return(0);
1090:
1.27 kristaps 1091: /*
1092: * Layouts have two parts: the layout body and header. The
1093: * layout header is the trailing text of the line macro, while
1094: * the layout body is everything following until termination.
1095: */
1096:
1.18 kristaps 1097: if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp))
1098: return(0);
1099: if (NULL == *argv)
1.35 kristaps 1100: return((*tree->cb.roffblkbodyin)
1101: (tree->arg, tok, argcp, argvp));
1102:
1103: if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1104: return(0);
1105:
1.27 kristaps 1106: /*
1107: * If there are no parsable parts, then write remaining tokens
1108: * into the layout header and exit.
1109: */
1110:
1.2 kristaps 1111: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1112: i = 0;
1.37 kristaps 1113: while (*argv)
1114: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1115: return(0);
1.37 kristaps 1116:
1.35 kristaps 1117: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1118: return(0);
1119: return((*tree->cb.roffblkbodyin)
1120: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1121: }
1122:
1.27 kristaps 1123: /*
1124: * Parsable elements may be in the header (or be the header, for
1125: * that matter). Follow the regular parsing rules for these.
1126: */
1127:
1.21 kristaps 1128: i = 0;
1.1 kristaps 1129: while (*argv) {
1.26 kristaps 1130: if (ROFF_MAX == (c = rofffindcallable(*argv))) {
1131: assert(tree->arg);
1.37 kristaps 1132: if ( ! roffdata(tree, i++, *argv++))
1.8 kristaps 1133: return(0);
1.26 kristaps 1134: continue;
1135: }
1.33 kristaps 1136: if ( ! roffcall(tree, c, argv))
1.14 kristaps 1137: return(0);
1.26 kristaps 1138: break;
1.21 kristaps 1139: }
1140:
1141: /*
1.27 kristaps 1142: * If there's trailing punctuation in the header, then write it
1143: * out now. Here we mimic the behaviour of a line-dominant text
1144: * macro.
1.21 kristaps 1145: */
1146:
1.35 kristaps 1147: if (NULL == *argv) {
1148: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1149: return(0);
1150: return((*tree->cb.roffblkbodyin)
1151: (tree->arg, tok, argcp, argvp));
1152: }
1.21 kristaps 1153:
1.27 kristaps 1154: /*
1155: * Expensive. Scan to the end of line then work backwards until
1156: * a token isn't punctuation.
1157: */
1158:
1.31 kristaps 1159: if ( ! roffpurgepunct(tree, argv))
1160: return(0);
1.12 kristaps 1161:
1.35 kristaps 1162: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1163: return(0);
1164: return((*tree->cb.roffblkbodyin)
1165: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1166: }
1167:
1168:
1169: /* ARGSUSED */
1170: static int
1.40 kristaps 1171: roff_ordered(ROFFCALL_ARGS)
1172: {
1.44 ! kristaps 1173: /* FIXME: the tail-switch statement is in two different places:
! 1174: * consolidate. */
! 1175: int i, first, c, argcp[ROFF_MAXLINEARG];
! 1176: char *ordp[ROFF_MAXLINEARG], *p,
! 1177: *argvp[ROFF_MAXLINEARG];
1.40 kristaps 1178:
1179: if (ROFF_PRELUDE & tree->state) {
1180: roff_err(tree, *argv, "`%s' disallowed in prelude",
1181: toknames[tok]);
1182: return(0);
1183: }
1184:
1185: first = (*argv == tree->cur);
1.44 ! kristaps 1186: p = *argv++;
1.40 kristaps 1187:
1.44 ! kristaps 1188: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
! 1189: return(0);
1.40 kristaps 1190:
1.44 ! kristaps 1191: if (NULL == *argv)
! 1192: return(roffspecial(tree, tok, p, 0, ordp));
1.40 kristaps 1193:
1194: i = 0;
1195: while (*argv && i < ROFF_MAXLINEARG) {
1.42 kristaps 1196: c = rofffindcallable(*argv);
1197:
1198: if (ROFF_MAX == c && ! roffispunct(*argv)) {
1199: ordp[i++] = *argv++;
1200: continue;
1201: }
1202: ordp[i] = NULL;
1203:
1204: if (ROFF_MAX == c)
1205: break;
1206:
1.44 ! kristaps 1207: if ( ! roffspecial(tree, tok, p, (size_t)i, ordp))
1.42 kristaps 1208: return(0);
1.40 kristaps 1209:
1.42 kristaps 1210: return(roffcall(tree, c, ordp));
1.40 kristaps 1211: }
1212:
1.42 kristaps 1213: assert(i != ROFF_MAXLINEARG);
1.40 kristaps 1214: ordp[i] = NULL;
1215:
1.44 ! kristaps 1216: if ( ! roffspecial(tree, tok, p, (size_t)i, ordp))
1.40 kristaps 1217: return(0);
1218:
1219: /* FIXME: error if there's stuff after the punctuation. */
1220:
1221: if ( ! first || NULL == *argv)
1222: return(1);
1223:
1224: return(roffpurgepunct(tree, argv));
1225: }
1226:
1227:
1228: /* ARGSUSED */
1229: static int
1.2 kristaps 1230: roff_text(ROFFCALL_ARGS)
1231: {
1.37 kristaps 1232: int i, j, first, c, argcp[ROFF_MAXLINEARG];
1233: char *argvp[ROFF_MAXLINEARG];
1.2 kristaps 1234:
1.4 kristaps 1235: if (ROFF_PRELUDE & tree->state) {
1.12 kristaps 1236: roff_err(tree, *argv, "`%s' disallowed in prelude",
1237: toknames[tok]);
1.4 kristaps 1238: return(0);
1239: }
1240:
1.27 kristaps 1241: first = (*argv == tree->cur);
1.12 kristaps 1242: argv++;
1.5 kristaps 1243:
1.27 kristaps 1244: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1245: return(0);
1.24 kristaps 1246: if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1247: return(0);
1.27 kristaps 1248: if (NULL == *argv)
1249: return((*tree->cb.roffout)(tree->arg, tok));
1.1 kristaps 1250:
1.2 kristaps 1251: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1252: i = 0;
1.37 kristaps 1253: while (*argv)
1254: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1255: return(0);
1.37 kristaps 1256:
1.15 kristaps 1257: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 1258: }
1.1 kristaps 1259:
1.27 kristaps 1260: /*
1261: * Deal with punctuation. Ugly. Work ahead until we encounter
1262: * terminating punctuation. If we encounter it and all
1263: * subsequent tokens are punctuation, then stop processing (the
1264: * line-dominant macro will print these tokens after closure).
1265: */
1266:
1.21 kristaps 1267: i = 0;
1.2 kristaps 1268: while (*argv) {
1.33 kristaps 1269: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
1270: if ( ! (ROFF_LSCOPE & tokens[tok].flags))
1271: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1272: return(0);
1273:
1274: if ( ! roffcall(tree, c, argv))
1275: return(0);
1276:
1277: if (ROFF_LSCOPE & tokens[tok].flags)
1278: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.27 kristaps 1279: return(0);
1.33 kristaps 1280:
1281: break;
1282: }
1.21 kristaps 1283:
1.33 kristaps 1284: if ( ! roffispunct(*argv)) {
1.37 kristaps 1285: if ( ! roffdata(tree, i++, *argv++))
1.33 kristaps 1286: return(0);
1287: continue;
1288: }
1.27 kristaps 1289:
1.33 kristaps 1290: i = 1;
1291: for (j = 0; argv[j]; j++)
1292: if ( ! roffispunct(argv[j]))
1293: break;
1.27 kristaps 1294:
1.33 kristaps 1295: if (argv[j]) {
1.37 kristaps 1296: if ( ! roffdata(tree, 0, *argv++))
1.27 kristaps 1297: return(0);
1.33 kristaps 1298: continue;
1.8 kristaps 1299: }
1.20 kristaps 1300:
1.33 kristaps 1301: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.14 kristaps 1302: return(0);
1.20 kristaps 1303: break;
1.14 kristaps 1304: }
1.12 kristaps 1305:
1.27 kristaps 1306: if (NULL == *argv)
1307: return((*tree->cb.roffout)(tree->arg, tok));
1308: if ( ! first)
1309: return(1);
1.21 kristaps 1310:
1.31 kristaps 1311: return(roffpurgepunct(tree, argv));
1.6 kristaps 1312: }
1313:
1314:
1.9 kristaps 1315: /* ARGSUSED */
1.6 kristaps 1316: static int
1.27 kristaps 1317: roff_noop(ROFFCALL_ARGS)
1.6 kristaps 1318: {
1319:
1320: return(1);
1.1 kristaps 1321: }
1.9 kristaps 1322:
1323:
1324: /* ARGSUSED */
1325: static int
1.27 kristaps 1326: roff_depr(ROFFCALL_ARGS)
1.9 kristaps 1327: {
1328:
1.27 kristaps 1329: roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]);
1330: return(0);
1.11 kristaps 1331: }
1.12 kristaps 1332:
1333:
1334: static void
1335: roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...)
1336: {
1337: va_list ap;
1338: char buf[128];
1339:
1340: va_start(ap, fmt);
1341: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1342: va_end(ap);
1343:
1.15 kristaps 1344: (*tree->cb.roffmsg)(tree->arg,
1345: ROFF_WARN, tree->cur, pos, buf);
1.12 kristaps 1346: }
1347:
1348:
1349: static void
1350: roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...)
1351: {
1352: va_list ap;
1353: char buf[128];
1354:
1355: va_start(ap, fmt);
1356: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1357: va_end(ap);
1358:
1.15 kristaps 1359: (*tree->cb.roffmsg)(tree->arg,
1360: ROFF_ERROR, tree->cur, pos, buf);
1.12 kristaps 1361: }
1.33 kristaps 1362:
CVSweb