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