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