mtree/misc.c

   1 /*      $NetBSD: misc.c,v 1.5 1997/10/17 11:46:40 lukem Exp $   */
   2
   3 /*-
   4  * Copyright (c) 1991, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  * 3. All advertising materials mentioning features or use of this software
  16  *    must display the following acknowledgement:
  17  *      This product includes software developed by the University of
  18  *      California, Berkeley and its contributors.
  19  * 4. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  *
  35  *      @(#)misc.c      8.1 (Berkeley) 6/6/93
  36  */
  37
  38 #include <sys/cdefs.h>
  39 #ifndef lint
  40 __RCSID("$NetBSD: misc.c,v 1.5 1997/10/17 11:46:40 lukem Exp $");
  41 #endif /* not lint */
  42
  43 #include <sys/types.h>
  44 #include <sys/stat.h>
  45 #include <fts.h>
  46 #include <stdio.h>
  47 #include "mtree.h"
  48 #include "extern.h"
  49
  50 extern int lineno;
  51
  52 typedef struct _key {
  53         char *name;                     /* key name */
  54         u_int val;                      /* value */
  55
  56 #define NEEDVALUE       0x01
  57         u_int flags;
  58 } KEY;
  59
  60 /* NB: the following table must be sorted lexically. */
  61 static KEY keylist[] = {
  62         {"cksum",       F_CKSUM,        NEEDVALUE},
  63         {"gid",         F_GID,          NEEDVALUE},
  64         {"gname",       F_GNAME,        NEEDVALUE},
  65         {"ignore",      F_IGN,          0},
  66         {"link",        F_SLINK,        NEEDVALUE},
  67         {"mode",        F_MODE,         NEEDVALUE},
  68         {"nlink",       F_NLINK,        NEEDVALUE},
  69         {"optional",    F_OPT,          0},
  70         {"size",        F_SIZE,         NEEDVALUE},
  71         {"time",        F_TIME,         NEEDVALUE},
  72         {"type",        F_TYPE,         NEEDVALUE},
  73         {"uid",         F_UID,          NEEDVALUE},
  74         {"uname",       F_UNAME,        NEEDVALUE}
  75 };
  76
  77 int keycompare __P((const void *, const void *));
  78
  79 u_int
  80 parsekey(name, needvaluep)
  81         char *name;
  82         int *needvaluep;
  83 {
  84         KEY *k, tmp;
  85
  86         tmp.name = name;
  87         k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
  88             sizeof(KEY), keycompare);
  89         if (k == NULL)
  90                 mtree_err("unknown keyword %s", name);
  91
  92         if (needvaluep)
  93                 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
  94         return (k->val);
  95 }
  96
  97 int
  98 keycompare(a, b)
  99         const void *a, *b;
 100 {
 101         return (strcmp(((KEY *)a)->name, ((KEY *)b)->name));
 102 }
 103
 104 #if __STDC__
 105 #include <stdarg.h>
 106 #else
 107 #include <varargs.h>
 108 #endif
 109
 110 void
 111 #if __STDC__
 112 mtree_err(const char *fmt, ...)
 113 #else
 114 mtree_err(fmt, va_alist)
 115         char *fmt;
 116         va_dcl
 117 #endif
 118 {
 119         va_list ap;
 120 #if __STDC__
 121         va_start(ap, fmt);
 122 #else
 123         va_start(ap);
 124 #endif
 125         (void)fprintf(stderr, "mtree: ");
 126         (void)vfprintf(stderr, fmt, ap);
 127         va_end(ap);
 128         (void)fprintf(stderr, "\n");
 129         if (lineno)
 130                 (void)fprintf(stderr,
 131                     "mtree: failed at line %d of the specification\n", lineno);
 132         exit(1);
 133         /* NOTREACHED */
 134 }