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
32static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93";
33#endif /*not lint */
34#endif
35#include <sys/cdefs.h>
| 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
32static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93";
33#endif /*not lint */
34#endif
35#include <sys/cdefs.h>
|
36__FBSDID("$FreeBSD: head/usr.sbin/mtree/misc.c 124387 2004-01-11 19:25:56Z phk $");
| 36__FBSDID("$FreeBSD: head/usr.sbin/mtree/misc.c 144295 2005-03-29 11:44:17Z tobez $");
|
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
47typedef 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. */
56static 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#ifdef RMD160
70 {"ripemd160digest", F_RMD160, NEEDVALUE},
71#endif
72#ifdef SHA1
73 {"sha1digest", F_SHA1, NEEDVALUE},
74#endif
| 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
47typedef 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. */
56static 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#ifdef RMD160
70 {"ripemd160digest", F_RMD160, NEEDVALUE},
71#endif
72#ifdef SHA1
73 {"sha1digest", F_SHA1, NEEDVALUE},
74#endif
|
| 75#ifdef SHA256
76 {"sha256digest", F_SHA256, NEEDVALUE},
77#endif
|
75 {"size", F_SIZE, NEEDVALUE},
76 {"time", F_TIME, NEEDVALUE},
77 {"type", F_TYPE, NEEDVALUE},
78 {"uid", F_UID, NEEDVALUE},
79 {"uname", F_UNAME, NEEDVALUE},
80};
81
82int keycompare(const void *, const void *);
83
84u_int
85parsekey(char *name, int *needvaluep)
86{
87 KEY *k, tmp;
88
89 tmp.name = name;
90 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
91 sizeof(KEY), keycompare);
92 if (k == NULL)
93 errx(1, "line %d: unknown keyword %s", lineno, name);
94
95 if (needvaluep)
96 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
97 return (k->val);
98}
99
100int
101keycompare(const void *a, const void *b)
102{
103 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name));
104}
105
106char *
107flags_to_string(u_long fflags)
108{
109 char *string;
110
111 string = fflagstostr(fflags);
112 if (string != NULL && *string == '\0') {
113 free(string);
114 string = strdup("none");
115 }
116 if (string == NULL)
117 err(1, NULL);
118
119 return string;
120}
| 78 {"size", F_SIZE, NEEDVALUE},
79 {"time", F_TIME, NEEDVALUE},
80 {"type", F_TYPE, NEEDVALUE},
81 {"uid", F_UID, NEEDVALUE},
82 {"uname", F_UNAME, NEEDVALUE},
83};
84
85int keycompare(const void *, const void *);
86
87u_int
88parsekey(char *name, int *needvaluep)
89{
90 KEY *k, tmp;
91
92 tmp.name = name;
93 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
94 sizeof(KEY), keycompare);
95 if (k == NULL)
96 errx(1, "line %d: unknown keyword %s", lineno, name);
97
98 if (needvaluep)
99 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
100 return (k->val);
101}
102
103int
104keycompare(const void *a, const void *b)
105{
106 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name));
107}
108
109char *
110flags_to_string(u_long fflags)
111{
112 char *string;
113
114 string = fflagstostr(fflags);
115 if (string != NULL && *string == '\0') {
116 free(string);
117 string = strdup("none");
118 }
119 if (string == NULL)
120 err(1, NULL);
121
122 return string;
123}
|