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
30 #if 0
31 #ifndef lint
32 static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93";
33 #endif /*not lint */
34 #endif
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
37
38 #include <sys/types.h>
39 #include <sys/stat.h>
40 #include <err.h>
41 #include <fts.h>
42 #include <stdio.h>
43 #include <unistd.h>
44 #include "mtree.h"
45 #include "extern.h"
46
47 typedef struct _key {
48 const char *name; /* key name */
49 u_int val; /* value */
50
51 #define NEEDVALUE 0x01
52 u_int flags;
53 } KEY;
54
55 /* NB: the following table must be sorted lexically. */
56 static KEY keylist[] = {
57 {"cksum", F_CKSUM, NEEDVALUE},
58 {"flags", F_FLAGS, NEEDVALUE},
59 {"gid", F_GID, NEEDVALUE},
60 {"gname", F_GNAME, NEEDVALUE},
61 {"ignore", F_IGN, 0},
62 {"link", F_SLINK, NEEDVALUE},
63 #ifdef MD5
64 {"md5digest", F_MD5, NEEDVALUE},
65 #endif
66 {"mode", F_MODE, NEEDVALUE},
67 {"nlink", F_NLINK, NEEDVALUE},
68 {"nochange", F_NOCHANGE, 0},
69 {"optional", F_OPT, 0},
70 #ifdef RMD160
71 {"ripemd160digest", F_RMD160, NEEDVALUE},
72 #endif
73 #ifdef SHA1
74 {"sha1digest", F_SHA1, NEEDVALUE},
75 #endif
76 #ifdef SHA256
77 {"sha256digest", F_SHA256, NEEDVALUE},
78 #endif
79 {"size", F_SIZE, NEEDVALUE},
80 {"time", F_TIME, NEEDVALUE},
81 {"type", F_TYPE, NEEDVALUE},
82 {"uid", F_UID, NEEDVALUE},
83 {"uname", F_UNAME, NEEDVALUE},
84 };
85
86 int keycompare(const void *, const void *);
87
88 u_int
parsekey(char * name,int * needvaluep)89 parsekey(char *name, int *needvaluep)
90 {
91 KEY *k, tmp;
92
93 tmp.name = name;
94 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
95 sizeof(KEY), keycompare);
96 if (k == NULL)
97 errx(1, "line %d: unknown keyword %s", lineno, name);
98
99 if (needvaluep)
100 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
101 return (k->val);
102 }
103
104 int
keycompare(const void * a,const void * b)105 keycompare(const void *a, const void *b)
106 {
107 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name));
108 }
109
110 char *
flags_to_string(u_long fflags)111 flags_to_string(u_long fflags)
112 {
113 char *string;
114
115 string = fflagstostr(fflags);
116 if (string != NULL && *string == '\0') {
117 free(string);
118 string = strdup("none");
119 }
120 if (string == NULL)
121 err(1, NULL);
122
123 return string;
124 }
125