cap_mkdb.c revision 1.11 1 1.11 mjl /* $NetBSD: cap_mkdb.c,v 1.11 2000/10/04 20:00:47 mjl Exp $ */
2 1.4 glass
3 1.1 cgd /*-
4 1.3 mycroft * Copyright (c) 1992, 1993
5 1.3 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.6 lukem __COPYRIGHT("@(#) Copyright (c) 1992, 1993\n\
39 1.6 lukem The Regents of the University of California. All rights reserved.\n");
40 1.1 cgd #endif /* not lint */
41 1.1 cgd
42 1.1 cgd #ifndef lint
43 1.4 glass #if 0
44 1.5 jtc static char sccsid[] = "@(#)cap_mkdb.c 8.2 (Berkeley) 4/27/95";
45 1.4 glass #endif
46 1.11 mjl __RCSID("$NetBSD: cap_mkdb.c,v 1.11 2000/10/04 20:00:47 mjl Exp $");
47 1.1 cgd #endif /* not lint */
48 1.1 cgd
49 1.1 cgd #include <sys/param.h>
50 1.1 cgd #include <sys/stat.h>
51 1.1 cgd
52 1.1 cgd #include <db.h>
53 1.1 cgd #include <err.h>
54 1.1 cgd #include <fcntl.h>
55 1.1 cgd #include <stdio.h>
56 1.1 cgd #include <stdlib.h>
57 1.1 cgd #include <string.h>
58 1.1 cgd #include <unistd.h>
59 1.1 cgd
60 1.6 lukem void db_build __P((char **));
61 1.6 lukem void dounlink __P((void));
62 1.6 lukem int main __P((int, char **));
63 1.6 lukem void usage __P((void));
64 1.1 cgd
65 1.1 cgd DB *capdbp;
66 1.1 cgd int verbose;
67 1.1 cgd char *capdb, *capname, buf[8 * 1024];
68 1.1 cgd
69 1.3 mycroft HASHINFO openinfo = {
70 1.3 mycroft 4096, /* bsize */
71 1.3 mycroft 16, /* ffactor */
72 1.9 mycroft 2048, /* nelem */
73 1.3 mycroft 2048 * 1024, /* cachesize */
74 1.3 mycroft NULL, /* hash() */
75 1.3 mycroft 0 /* lorder */
76 1.3 mycroft };
77 1.3 mycroft
78 1.1 cgd /*
79 1.1 cgd * Mkcapdb creates a capability hash database for quick retrieval of capability
80 1.1 cgd * records. The database contains 2 types of entries: records and references
81 1.1 cgd * marked by the first byte in the data. A record entry contains the actual
82 1.1 cgd * capability record whereas a reference contains the name (key) under which
83 1.1 cgd * the correct record is stored.
84 1.1 cgd */
85 1.1 cgd int
86 1.1 cgd main(argc, argv)
87 1.1 cgd int argc;
88 1.1 cgd char *argv[];
89 1.1 cgd {
90 1.10 simonb int c, byteorder;
91 1.1 cgd
92 1.1 cgd capname = NULL;
93 1.10 simonb byteorder = 0;
94 1.10 simonb while ((c = getopt(argc, argv, "bf:lv")) != -1) {
95 1.1 cgd switch(c) {
96 1.10 simonb case 'b':
97 1.10 simonb case 'l':
98 1.10 simonb if (byteorder != 0)
99 1.10 simonb usage();
100 1.10 simonb byteorder = c == 'b' ? 4321 : 1234;
101 1.10 simonb break;
102 1.1 cgd case 'f':
103 1.1 cgd capname = optarg;
104 1.1 cgd break;
105 1.1 cgd case 'v':
106 1.1 cgd verbose = 1;
107 1.1 cgd break;
108 1.1 cgd case '?':
109 1.1 cgd default:
110 1.1 cgd usage();
111 1.1 cgd }
112 1.1 cgd }
113 1.1 cgd argc -= optind;
114 1.1 cgd argv += optind;
115 1.1 cgd
116 1.1 cgd if (*argv == NULL)
117 1.1 cgd usage();
118 1.1 cgd
119 1.10 simonb /* Set byte order */
120 1.10 simonb openinfo.lorder = byteorder;
121 1.10 simonb
122 1.1 cgd /*
123 1.1 cgd * The database file is the first argument if no name is specified.
124 1.1 cgd * Make arrangements to unlink it if exit badly.
125 1.1 cgd */
126 1.1 cgd (void)snprintf(buf, sizeof(buf), "%s.db", capname ? capname : *argv);
127 1.1 cgd if ((capname = strdup(buf)) == NULL)
128 1.6 lukem err(1, "strdup");
129 1.3 mycroft if ((capdbp = dbopen(capname, O_CREAT | O_TRUNC | O_RDWR,
130 1.3 mycroft DEFFILEMODE, DB_HASH, &openinfo)) == NULL)
131 1.1 cgd err(1, "%s", buf);
132 1.1 cgd
133 1.1 cgd if (atexit(dounlink))
134 1.1 cgd err(1, "atexit");
135 1.1 cgd
136 1.1 cgd db_build(argv);
137 1.1 cgd
138 1.1 cgd if (capdbp->close(capdbp) < 0)
139 1.1 cgd err(1, "%s", capname);
140 1.1 cgd capname = NULL;
141 1.1 cgd exit(0);
142 1.1 cgd }
143 1.1 cgd
144 1.1 cgd void
145 1.1 cgd dounlink()
146 1.1 cgd {
147 1.1 cgd if (capname != NULL)
148 1.1 cgd (void)unlink(capname);
149 1.1 cgd }
150 1.1 cgd
151 1.1 cgd /*
152 1.1 cgd * Any changes to these definitions should be made also in the getcap(3)
153 1.1 cgd * library routines.
154 1.1 cgd */
155 1.1 cgd #define RECOK (char)0
156 1.1 cgd #define TCERR (char)1
157 1.1 cgd #define SHADOW (char)2
158 1.1 cgd
159 1.1 cgd /*
160 1.1 cgd * Db_build() builds the name and capabilty databases according to the
161 1.1 cgd * details above.
162 1.1 cgd */
163 1.1 cgd void
164 1.1 cgd db_build(ifiles)
165 1.1 cgd char **ifiles;
166 1.1 cgd {
167 1.1 cgd DBT key, data;
168 1.1 cgd recno_t reccnt;
169 1.1 cgd size_t len, bplen;
170 1.1 cgd int st;
171 1.1 cgd char *bp, *p, *t;
172 1.1 cgd
173 1.1 cgd data.data = NULL;
174 1.1 cgd key.data = NULL;
175 1.1 cgd for (reccnt = 0, bplen = 0; (st = cgetnext(&bp, ifiles)) > 0;) {
176 1.1 cgd
177 1.1 cgd /*
178 1.1 cgd * Allocate enough memory to store record, terminating
179 1.1 cgd * NULL and one extra byte.
180 1.1 cgd */
181 1.1 cgd len = strlen(bp);
182 1.1 cgd if (bplen <= len + 2) {
183 1.1 cgd bplen += MAX(256, len + 2);
184 1.1 cgd if ((data.data = realloc(data.data, bplen)) == NULL)
185 1.6 lukem err(1, "realloc");
186 1.1 cgd }
187 1.1 cgd
188 1.1 cgd /* Find the end of the name field. */
189 1.1 cgd if ((p = strchr(bp, ':')) == NULL) {
190 1.6 lukem warnx("no name field: %.*s", (int)(MIN(len, 20)), bp);
191 1.1 cgd continue;
192 1.1 cgd }
193 1.1 cgd
194 1.1 cgd /* First byte of stored record indicates status. */
195 1.1 cgd switch(st) {
196 1.1 cgd case 1:
197 1.1 cgd ((char *)(data.data))[0] = RECOK;
198 1.1 cgd break;
199 1.1 cgd case 2:
200 1.1 cgd ((char *)(data.data))[0] = TCERR;
201 1.8 mrg warnx("Record not tc expanded: %.*s", (int)(p - bp),bp);
202 1.1 cgd break;
203 1.1 cgd }
204 1.1 cgd
205 1.1 cgd /* Create the stored record. */
206 1.1 cgd memmove(&((u_char *)(data.data))[1], bp, len + 1);
207 1.1 cgd data.size = len + 2;
208 1.1 cgd
209 1.1 cgd /* Store the record under the name field. */
210 1.1 cgd key.data = bp;
211 1.1 cgd key.size = p - bp;
212 1.1 cgd
213 1.1 cgd switch(capdbp->put(capdbp, &key, &data, R_NOOVERWRITE)) {
214 1.1 cgd case -1:
215 1.1 cgd err(1, "put");
216 1.1 cgd /* NOTREACHED */
217 1.1 cgd case 1:
218 1.1 cgd warnx("ignored duplicate: %.*s",
219 1.6 lukem (int)key.size, (char *)key.data);
220 1.1 cgd continue;
221 1.1 cgd }
222 1.1 cgd ++reccnt;
223 1.1 cgd
224 1.1 cgd /* If only one name, ignore the rest. */
225 1.1 cgd if ((p = strchr(bp, '|')) == NULL)
226 1.1 cgd continue;
227 1.1 cgd
228 1.1 cgd /* The rest of the names reference the entire name. */
229 1.1 cgd ((char *)(data.data))[0] = SHADOW;
230 1.1 cgd memmove(&((u_char *)(data.data))[1], key.data, key.size);
231 1.1 cgd data.size = key.size + 1;
232 1.1 cgd
233 1.1 cgd /* Store references for other names. */
234 1.1 cgd for (p = t = bp;; ++p) {
235 1.1 cgd if (p > t && (*p == ':' || *p == '|')) {
236 1.1 cgd key.size = p - t;
237 1.1 cgd key.data = t;
238 1.1 cgd switch(capdbp->put(capdbp,
239 1.1 cgd &key, &data, R_NOOVERWRITE)) {
240 1.1 cgd case -1:
241 1.1 cgd err(1, "put");
242 1.1 cgd /* NOTREACHED */
243 1.1 cgd case 1:
244 1.1 cgd warnx("ignored duplicate: %.*s",
245 1.6 lukem (int)key.size, (char *)key.data);
246 1.1 cgd }
247 1.1 cgd t = p + 1;
248 1.1 cgd }
249 1.1 cgd if (*p == ':')
250 1.1 cgd break;
251 1.1 cgd }
252 1.1 cgd }
253 1.1 cgd
254 1.1 cgd switch(st) {
255 1.1 cgd case -1:
256 1.1 cgd err(1, "file argument");
257 1.1 cgd /* NOTREACHED */
258 1.1 cgd case -2:
259 1.1 cgd errx(1, "potential reference loop detected");
260 1.1 cgd /* NOTREACHED */
261 1.1 cgd }
262 1.1 cgd
263 1.1 cgd if (verbose)
264 1.1 cgd (void)printf("cap_mkdb: %d capability records\n", reccnt);
265 1.1 cgd }
266 1.1 cgd
267 1.1 cgd void
268 1.1 cgd usage()
269 1.1 cgd {
270 1.1 cgd (void)fprintf(stderr,
271 1.10 simonb "usage: cap_mkdb [-b|-l] [-v] [-f outfile] file1 [file2 ...]\n");
272 1.1 cgd exit(1);
273 1.1 cgd }
274