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