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