cap_mkdb.c revision 1.5 1 1.5 jtc /* $NetBSD: cap_mkdb.c,v 1.5 1995/09/02 05:47:12 jtc 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.1 cgd #ifndef lint
37 1.1 cgd static char copyright[] =
38 1.3 mycroft "@(#) Copyright (c) 1992, 1993\n\
39 1.3 mycroft 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.5 jtc static char rcsid[] = "$NetBSD: cap_mkdb.c,v 1.5 1995/09/02 05:47:12 jtc 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 <errno.h>
55 1.1 cgd #include <fcntl.h>
56 1.1 cgd #include <limits.h>
57 1.1 cgd #include <stdio.h>
58 1.1 cgd #include <stdlib.h>
59 1.1 cgd #include <string.h>
60 1.1 cgd #include <unistd.h>
61 1.1 cgd
62 1.1 cgd void db_build __P((char **));
63 1.1 cgd void dounlink __P((void));
64 1.1 cgd void usage __P((void));
65 1.1 cgd
66 1.1 cgd DB *capdbp;
67 1.1 cgd int verbose;
68 1.1 cgd char *capdb, *capname, buf[8 * 1024];
69 1.1 cgd
70 1.3 mycroft HASHINFO openinfo = {
71 1.3 mycroft 4096, /* bsize */
72 1.3 mycroft 16, /* ffactor */
73 1.3 mycroft 256, /* nelem */
74 1.3 mycroft 2048 * 1024, /* cachesize */
75 1.3 mycroft NULL, /* hash() */
76 1.3 mycroft 0 /* lorder */
77 1.3 mycroft };
78 1.3 mycroft
79 1.1 cgd /*
80 1.1 cgd * Mkcapdb creates a capability hash database for quick retrieval of capability
81 1.1 cgd * records. The database contains 2 types of entries: records and references
82 1.1 cgd * marked by the first byte in the data. A record entry contains the actual
83 1.1 cgd * capability record whereas a reference contains the name (key) under which
84 1.1 cgd * the correct record is stored.
85 1.1 cgd */
86 1.1 cgd int
87 1.1 cgd main(argc, argv)
88 1.1 cgd int argc;
89 1.1 cgd char *argv[];
90 1.1 cgd {
91 1.1 cgd int c;
92 1.1 cgd
93 1.1 cgd capname = NULL;
94 1.1 cgd while ((c = getopt(argc, argv, "f:v")) != EOF) {
95 1.1 cgd switch(c) {
96 1.1 cgd case 'f':
97 1.1 cgd capname = optarg;
98 1.1 cgd break;
99 1.1 cgd case 'v':
100 1.1 cgd verbose = 1;
101 1.1 cgd break;
102 1.1 cgd case '?':
103 1.1 cgd default:
104 1.1 cgd usage();
105 1.1 cgd }
106 1.1 cgd }
107 1.1 cgd argc -= optind;
108 1.1 cgd argv += optind;
109 1.1 cgd
110 1.1 cgd if (*argv == NULL)
111 1.1 cgd usage();
112 1.1 cgd
113 1.1 cgd /*
114 1.1 cgd * The database file is the first argument if no name is specified.
115 1.1 cgd * Make arrangements to unlink it if exit badly.
116 1.1 cgd */
117 1.1 cgd (void)snprintf(buf, sizeof(buf), "%s.db", capname ? capname : *argv);
118 1.1 cgd if ((capname = strdup(buf)) == NULL)
119 1.1 cgd err(1, "");
120 1.3 mycroft if ((capdbp = dbopen(capname, O_CREAT | O_TRUNC | O_RDWR,
121 1.3 mycroft DEFFILEMODE, DB_HASH, &openinfo)) == NULL)
122 1.1 cgd err(1, "%s", buf);
123 1.1 cgd
124 1.1 cgd if (atexit(dounlink))
125 1.1 cgd err(1, "atexit");
126 1.1 cgd
127 1.1 cgd db_build(argv);
128 1.1 cgd
129 1.1 cgd if (capdbp->close(capdbp) < 0)
130 1.1 cgd err(1, "%s", capname);
131 1.1 cgd capname = NULL;
132 1.1 cgd exit(0);
133 1.1 cgd }
134 1.1 cgd
135 1.1 cgd void
136 1.1 cgd dounlink()
137 1.1 cgd {
138 1.1 cgd if (capname != NULL)
139 1.1 cgd (void)unlink(capname);
140 1.1 cgd }
141 1.1 cgd
142 1.1 cgd /*
143 1.1 cgd * Any changes to these definitions should be made also in the getcap(3)
144 1.1 cgd * library routines.
145 1.1 cgd */
146 1.1 cgd #define RECOK (char)0
147 1.1 cgd #define TCERR (char)1
148 1.1 cgd #define SHADOW (char)2
149 1.1 cgd
150 1.1 cgd /*
151 1.1 cgd * Db_build() builds the name and capabilty databases according to the
152 1.1 cgd * details above.
153 1.1 cgd */
154 1.1 cgd void
155 1.1 cgd db_build(ifiles)
156 1.1 cgd char **ifiles;
157 1.1 cgd {
158 1.1 cgd DBT key, data;
159 1.1 cgd recno_t reccnt;
160 1.1 cgd size_t len, bplen;
161 1.1 cgd int st;
162 1.1 cgd char *bp, *p, *t;
163 1.1 cgd
164 1.1 cgd data.data = NULL;
165 1.1 cgd key.data = NULL;
166 1.1 cgd for (reccnt = 0, bplen = 0; (st = cgetnext(&bp, ifiles)) > 0;) {
167 1.1 cgd
168 1.1 cgd /*
169 1.1 cgd * Allocate enough memory to store record, terminating
170 1.1 cgd * NULL and one extra byte.
171 1.1 cgd */
172 1.1 cgd len = strlen(bp);
173 1.1 cgd if (bplen <= len + 2) {
174 1.1 cgd bplen += MAX(256, len + 2);
175 1.1 cgd if ((data.data = realloc(data.data, bplen)) == NULL)
176 1.1 cgd err(1, "");
177 1.1 cgd }
178 1.1 cgd
179 1.1 cgd /* Find the end of the name field. */
180 1.1 cgd if ((p = strchr(bp, ':')) == NULL) {
181 1.1 cgd warnx("no name field: %.*s", MIN(len, 20), bp);
182 1.1 cgd continue;
183 1.1 cgd }
184 1.1 cgd
185 1.1 cgd /* First byte of stored record indicates status. */
186 1.1 cgd switch(st) {
187 1.1 cgd case 1:
188 1.1 cgd ((char *)(data.data))[0] = RECOK;
189 1.1 cgd break;
190 1.1 cgd case 2:
191 1.1 cgd ((char *)(data.data))[0] = TCERR;
192 1.1 cgd warnx("Record not tc expanded: %.*s", p - bp, bp);
193 1.1 cgd break;
194 1.1 cgd }
195 1.1 cgd
196 1.1 cgd /* Create the stored record. */
197 1.1 cgd memmove(&((u_char *)(data.data))[1], bp, len + 1);
198 1.1 cgd data.size = len + 2;
199 1.1 cgd
200 1.1 cgd /* Store the record under the name field. */
201 1.1 cgd key.data = bp;
202 1.1 cgd key.size = p - bp;
203 1.1 cgd
204 1.1 cgd switch(capdbp->put(capdbp, &key, &data, R_NOOVERWRITE)) {
205 1.1 cgd case -1:
206 1.1 cgd err(1, "put");
207 1.1 cgd /* NOTREACHED */
208 1.1 cgd case 1:
209 1.1 cgd warnx("ignored duplicate: %.*s",
210 1.1 cgd key.size, (char *)key.data);
211 1.1 cgd continue;
212 1.1 cgd }
213 1.1 cgd ++reccnt;
214 1.1 cgd
215 1.1 cgd /* If only one name, ignore the rest. */
216 1.1 cgd if ((p = strchr(bp, '|')) == NULL)
217 1.1 cgd continue;
218 1.1 cgd
219 1.1 cgd /* The rest of the names reference the entire name. */
220 1.1 cgd ((char *)(data.data))[0] = SHADOW;
221 1.1 cgd memmove(&((u_char *)(data.data))[1], key.data, key.size);
222 1.1 cgd data.size = key.size + 1;
223 1.1 cgd
224 1.1 cgd /* Store references for other names. */
225 1.1 cgd for (p = t = bp;; ++p) {
226 1.1 cgd if (p > t && (*p == ':' || *p == '|')) {
227 1.1 cgd key.size = p - t;
228 1.1 cgd key.data = t;
229 1.1 cgd switch(capdbp->put(capdbp,
230 1.1 cgd &key, &data, R_NOOVERWRITE)) {
231 1.1 cgd case -1:
232 1.1 cgd err(1, "put");
233 1.1 cgd /* NOTREACHED */
234 1.1 cgd case 1:
235 1.1 cgd warnx("ignored duplicate: %.*s",
236 1.1 cgd key.size, (char *)key.data);
237 1.1 cgd }
238 1.1 cgd t = p + 1;
239 1.1 cgd }
240 1.1 cgd if (*p == ':')
241 1.1 cgd break;
242 1.1 cgd }
243 1.1 cgd }
244 1.1 cgd
245 1.1 cgd switch(st) {
246 1.1 cgd case -1:
247 1.1 cgd err(1, "file argument");
248 1.1 cgd /* NOTREACHED */
249 1.1 cgd case -2:
250 1.1 cgd errx(1, "potential reference loop detected");
251 1.1 cgd /* NOTREACHED */
252 1.1 cgd }
253 1.1 cgd
254 1.1 cgd if (verbose)
255 1.1 cgd (void)printf("cap_mkdb: %d capability records\n", reccnt);
256 1.1 cgd }
257 1.1 cgd
258 1.1 cgd void
259 1.1 cgd usage()
260 1.1 cgd {
261 1.1 cgd (void)fprintf(stderr,
262 1.1 cgd "usage: cap_mkdb [-v] [-f outfile] file1 [file2 ...]\n");
263 1.1 cgd exit(1);
264 1.1 cgd }
265