2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93";
38 static const char rcsid[] =
42 #include <sys/types.h>
54 char *name; /* key name */
55 u_int val; /* value */
57 #define NEEDVALUE 0x01
61 /* NB: the following table must be sorted lexically. */
62 static KEY keylist[] = {
63 {"cksum", F_CKSUM, NEEDVALUE},
64 {"flags", F_FLAGS, NEEDVALUE},
65 {"gid", F_GID, NEEDVALUE},
66 {"gname", F_GNAME, NEEDVALUE},
68 {"link", F_SLINK, NEEDVALUE},
70 {"md5digest", F_MD5, NEEDVALUE},
72 {"mode", F_MODE, NEEDVALUE},
73 {"nlink", F_NLINK, NEEDVALUE},
74 {"nochange", F_NOCHANGE, 0},
76 {"ripemd160digest", F_RMD160, NEEDVALUE},
79 {"sha1digest", F_SHA1, NEEDVALUE},
81 {"size", F_SIZE, NEEDVALUE},
82 {"time", F_TIME, NEEDVALUE},
83 {"type", F_TYPE, NEEDVALUE},
84 {"uid", F_UID, NEEDVALUE},
85 {"uname", F_UNAME, NEEDVALUE},
89 parsekey(name, needvaluep)
94 int keycompare __P((const void *, const void *));
97 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
98 sizeof(KEY), keycompare);
100 errx(1, "line %d: unknown keyword %s", lineno, name);
103 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
111 return (strcmp(((KEY *)a)->name, ((KEY *)b)->name));
115 flags_to_string(fflags)
120 string = fflagstostr(fflags);
121 if (string != NULL && *string == '\0') {
123 string = strdup("none");