man_validate.c

   1 /* $Id: man_validate.c,v 1.5 2009/03/27 14:56:15 kristaps Exp $ */
   2 /*
   3  * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org>
   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  */
  19 #include <sys/types.h>
  20
  21 #include <assert.h>
  22 #include <ctype.h>
  23 #include <stdarg.h>
  24 #include <stdlib.h>
  25
  26 #include "libman.h"
  27
  28 /* FIXME: validate text. */
  29
  30 #define POSTARGS  struct man *m, const struct man_node *n
  31
  32 typedef int     (*v_post)(POSTARGS);
  33
  34 struct  man_valid {
  35         v_post   *posts;
  36 };
  37
  38 static  int       count(const struct man_node *);
  39 static  int       check_eq0(POSTARGS);
  40 static  int       check_ge1(POSTARGS);
  41 static  int       check_ge2(POSTARGS);
  42 static  int       check_le1(POSTARGS);
  43 static  int       check_le2(POSTARGS);
  44 static  int       check_le5(POSTARGS);
  45
  46 static  v_post    posts_le1[] = { check_le1, NULL };
  47 static  v_post    posts_le2[] = { check_le2, NULL };
  48 static  v_post    posts_ge1[] = { check_ge1, NULL };
  49 static  v_post    posts_eq0[] = { check_eq0, NULL };
  50 static  v_post    posts_ge2_le5[] = { check_ge2, check_le5, NULL };
  51
  52 static  const struct man_valid man_valids[MAN_MAX] = {
  53         { NULL }, /* __ */
  54         { posts_ge2_le5 }, /* TH */
  55         { posts_ge1 }, /* SH */
  56         { posts_ge1 }, /* SS */
  57         { NULL }, /* TP */
  58         { posts_eq0 }, /* LP */
  59         { posts_eq0 }, /* PP */
  60         { posts_eq0 }, /* P */
  61         { posts_le2 }, /* IP */
  62         { posts_le1 }, /* HP */
  63         { NULL }, /* SM */
  64         { NULL }, /* SB */
  65         { NULL }, /* BI */
  66         { NULL }, /* IB */
  67         { NULL }, /* BR */
  68         { NULL }, /* RB */
  69         { NULL }, /* R */
  70         { NULL }, /* B */
  71         { NULL }, /* I */
  72         { NULL }, /* IR */
  73         { NULL }, /* RI */
  74         { posts_eq0 }, /* br */
  75 };
  76
  77
  78 int
  79 man_valid_post(struct man *m)
  80 {
  81         v_post          *cp;
  82
  83         if (MAN_VALID & m->last->flags)
  84                 return(1);
  85         m->last->flags |= MAN_VALID;
  86
  87         switch (m->last->type) {
  88         case (MAN_TEXT):
  89                 /* FALLTHROUGH */
  90         case (MAN_ROOT):
  91                 return(1);
  92         default:
  93                 break;
  94         }
  95
  96         if (NULL == (cp = man_valids[m->last->tok].posts))
  97                 return(1);
  98         for ( ; *cp; cp++)
  99                 if ( ! (*cp)(m, m->last))
 100                         return(0);
 101
 102         return(1);
 103 }
 104
 105
 106 static inline int
 107 count(const struct man_node *n)
 108 {
 109         int              i;
 110
 111         for (i = 0; n; n = n->next, i++)
 112                 /* Loop. */ ;
 113         return(i);
 114 }
 115
 116
 117 #define INEQ_DEFINE(x, ineq, name) \
 118 static int \
 119 check_##name(POSTARGS) \
 120 { \
 121         int              c; \
 122         if ((c = count(n->child)) ineq (x)) \
 123                 return(1); \
 124         return(man_verr(m, n->line, n->pos, \
 125                         "expected line arguments %s %d, have %d", \
 126                         #ineq, (x), c)); \
 127 }
 128
 129 INEQ_DEFINE(0, ==, eq0)
 130 INEQ_DEFINE(1, >=, ge1)
 131 INEQ_DEFINE(2, >=, ge2)
 132 INEQ_DEFINE(1, <=, le1)
 133 INEQ_DEFINE(2, <=, le2)
 134 INEQ_DEFINE(5, <=, le5)
 135