usr.sbin/mtree/misc.c

   1 /*-
   2  * Copyright (c) 1991, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  * @(#)misc.c   8.1 (Berkeley) 6/6/93
  30  * $FreeBSD: src/usr.sbin/mtree/misc.c,v 1.8.2.1 2000/06/28 02:33:17 joe Exp $
  31  * $DragonFly: src/usr.sbin/mtree/misc.c,v 1.5 2004/03/15 16:24:22 dillon Exp $
  32  */
  33
  34 #include <sys/types.h>
  35 #include <sys/stat.h>
  36 #include <err.h>
  37 #include <fts.h>
  38 #include <stdio.h>
  39 #include <unistd.h>
  40 #include "mtree.h"
  41 #include "extern.h"
  42
  43 typedef struct _key {
  44         const char *name;               /* key name */
  45         u_int val;                      /* value */
  46
  47 #define NEEDVALUE       0x01
  48         u_int flags;
  49 } KEY;
  50
  51 /* NB: the following table must be sorted lexically. */
  52 static KEY keylist[] = {
  53         {"cksum",       F_CKSUM,        NEEDVALUE},
  54         {"flags",       F_FLAGS,        NEEDVALUE},
  55         {"gid",         F_GID,          NEEDVALUE},
  56         {"gname",       F_GNAME,        NEEDVALUE},
  57         {"ignore",      F_IGN,          0},
  58         {"link",        F_SLINK,        NEEDVALUE},
  59 #ifdef MD5
  60         {"md5digest",   F_MD5,          NEEDVALUE},
  61 #endif
  62         {"mode",        F_MODE,         NEEDVALUE},
  63         {"nlink",       F_NLINK,        NEEDVALUE},
  64         {"nochange",    F_NOCHANGE,     0},
  65 #ifdef RMD160
  66         {"ripemd160digest", F_RMD160,   NEEDVALUE},
  67 #endif
  68 #ifdef SHA1
  69         {"sha1digest",  F_SHA1,         NEEDVALUE},
  70 #endif
  71         {"size",        F_SIZE,         NEEDVALUE},
  72         {"time",        F_TIME,         NEEDVALUE},
  73         {"type",        F_TYPE,         NEEDVALUE},
  74         {"uid",         F_UID,          NEEDVALUE},
  75         {"uname",       F_UNAME,        NEEDVALUE},
  76 };
  77
  78 int keycompare(const void *, const void *);
  79
  80 u_int
  81 parsekey(char *name, int *needvaluep)
  82 {
  83         KEY *k, tmp;
  84
  85         tmp.name = name;
  86         k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
  87             sizeof(KEY), keycompare);
  88         if (k == NULL)
  89                 errx(1, "line %d: unknown keyword %s", lineno, name);
  90
  91         if (needvaluep)
  92                 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
  93         return (k->val);
  94 }
  95
  96 int
  97 keycompare(const void *a, const void *b)
  98 {
  99
 100         return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name));
 101 }
 102
 103 char *
 104 flags_to_string(u_long fflags)
 105 {
 106         char *string;
 107
 108         string = fflagstostr(fflags);
 109         if (string != NULL && *string == '\0') {
 110                 free(string);
 111                 string = strdup("none");
 112         }
 113         if (string == NULL)
 114                 err(1, NULL);
 115
 116         return string;
 117 }