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