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