1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
|
/* $OpenBSD: cap_mkdb.c,v 1.18 2011/07/04 21:34:54 nicm Exp $ */
/* $NetBSD: cap_mkdb.c,v 1.5 1995/09/02 05:47:12 jtc Exp $ */
/*-
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/stat.h>
#include <db.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
void db_build(char **);
void dounlink(void);
void usage(void);
int igetnext(char **, char **);
int main(int, char *[]);
DB *capdbp;
int info, verbose;
char *capname, buf[8 * 1024];
HASHINFO openinfo = {
4096, /* bsize */
16, /* ffactor */
256, /* nelem */
2048 * 1024, /* cachesize */
NULL, /* hash() */
0 /* lorder */
};
/*
* cap_mkdb creates a capability hash database for quick retrieval of capability
* records. The database contains 2 types of entries: records and references
* marked by the first byte in the data. A record entry contains the actual
* capability record whereas a reference contains the name (key) under which
* the correct record is stored.
*/
int
main(int argc, char *argv[])
{
int c;
capname = NULL;
while ((c = getopt(argc, argv, "f:iv")) != -1) {
switch(c) {
case 'f':
capname = optarg;
break;
case 'v':
verbose = 1;
break;
case 'i':
info = 1;
break;
case '?':
default:
usage();
}
}
argc -= optind;
argv += optind;
if (*argv == NULL)
usage();
/*
* The database file is the first argument if no name is specified.
* Make arrangements to unlink it if we exit badly.
*/
(void)snprintf(buf, sizeof(buf), "%s.db", capname ? capname : *argv);
if ((capname = strdup(buf)) == NULL)
err(1, NULL);
if ((capdbp = dbopen(capname, O_CREAT | O_TRUNC | O_RDWR,
DEFFILEMODE, DB_HASH, &openinfo)) == NULL)
err(1, "%s", buf);
if (atexit(dounlink))
err(1, "atexit");
db_build(argv);
if (capdbp->close(capdbp) < 0)
err(1, "%s", capname);
capname = NULL;
exit(0);
}
void
dounlink(void)
{
if (capname != NULL)
(void)unlink(capname);
}
/*
* Any changes to these definitions should be made also in the getcap(3)
* library routines.
*/
#define RECOK (char)0
#define TCERR (char)1
#define SHADOW (char)2
/*
* db_build() builds the name and capability databases according to the
* details above.
*/
void
db_build(char **ifiles)
{
DBT key, data;
recno_t reccnt;
size_t len, bplen;
int st;
char *bp, *p, *t, *out, ch;
cgetusedb(0); /* disable reading of .db files in getcap(3) */
data.data = NULL;
key.data = NULL;
for (reccnt = 0, bplen = 0;
(st = (info ? igetnext(&bp, ifiles) : cgetnext(&bp, ifiles))) > 0;) {
/*
* Allocate enough memory to store four times the size of the
* record (so an existing ':' can be expanded to '\072' for
* terminfo) plus a terminating NULL and one extra byte.
*/
len = strlen(bp);
if (bplen <= 4 * len + 2) {
int newbplen = bplen + MAX(256, 4 * len + 2);
void *newdata;
if ((newdata = realloc(data.data, newbplen)) == NULL)
err(1, NULL);
data.data = newdata;
bplen = newbplen;
}
/* Find the end of the name field. */
if ((p = strchr(bp, info ? ',' : ':')) == NULL) {
warnx("no name field: %.*s", (int)MIN(len, 20), bp);
continue;
}
/* First byte of stored record indicates status. */
switch(st) {
case 1:
((char *)(data.data))[0] = RECOK;
break;
case 2:
((char *)(data.data))[0] = TCERR;
warnx("Record not tc expanded: %.*s", (int)(p - bp), bp);
break;
}
/* Create the stored record. */
if (info) {
/*
* The record separator is :, so it is necessary to
* change commas into colons. However, \, should be
* left alone, unless the \ is the last part of ^\.
*/
data.size = len + 2;
out = ((char *) data.data) + 1;
t = bp;
while (t < bp + len) {
switch (ch = *t++) {
case '^':
case '\\':
*out++ = ch;
if (*t != '\0')
*out++ = *t++;
break;
case ':':
memcpy(out, "\\072", 4);
out += 4;
data.size += 3; /* : already counted */
break;
case ',':
*out++ = ':';
break;
default:
*out++ = ch;
break;
}
}
*out++ = '\0';
if (memchr((char *)data.data + 1, '\0', data.size - 2)) {
warnx("NUL in entry: %.*s", (int)MIN(len, 20), bp);
continue;
}
} else {
char *capbeg, *capend;
t = (char *)data.data + 1;
/* Copy the cap name and trailing ':' */
len = p - bp + 1;
memcpy(t, bp, len);
t += len;
/* Copy entry, collapsing empty fields. */
capbeg = p + 1;
while (*capbeg) {
/* Skip empty fields. */
if ((len = strspn(capbeg, ": \t\n\r")))
capbeg += len;
/* Find the end of this cap and copy it w/ : */
capend = strchr(capbeg, ':');
if (capend)
len = capend - capbeg + 1;
else
len = strlen(capbeg);
memcpy(t, capbeg, len);
t += len;
capbeg += len;
}
*t = '\0';
data.size = t - (char *)data.data + 1;
}
/* Store the record under the name field. */
key.data = bp;
key.size = p - bp;
switch(capdbp->put(capdbp, &key, &data, R_NOOVERWRITE)) {
case -1:
err(1, "put");
/* NOTREACHED */
case 1:
warnx("ignored duplicate: %.*s",
(int)key.size, (char *)key.data);
continue;
}
++reccnt;
/* If only one name, ignore the rest. */
if ((p = strchr(bp, '|')) == NULL)
continue;
/* The rest of the names reference the entire name. */
((char *)(data.data))[0] = SHADOW;
(void) memmove(&((u_char *)(data.data))[1], key.data, key.size);
data.size = key.size + 1;
/* Store references for other names. */
for (p = t = bp;; ++p) {
if (p > t && (*p == (info ? ',' : ':') || *p == '|')) {
key.size = p - t;
key.data = t;
/*
* If this is the last entry and contains any
* spaces, it is a description rather than an
* alias, so skip it and break.
*/
if (*p != '|' &&
memchr(key.data, ' ', key.size) != NULL)
break;
switch(capdbp->put(capdbp,
&key, &data, R_NOOVERWRITE)) {
case -1:
err(1, "put");
/* NOTREACHED */
case 1:
warnx("ignored duplicate: %.*s",
(int)key.size, (char *)key.data);
}
t = p + 1;
}
if (*p == (info ? ',' : ':'))
break;
}
free(bp);
}
switch(st) {
case -1:
err(1, "file argument");
/* NOTREACHED */
case -2:
errx(1, "potential reference loop detected");
/* NOTREACHED */
}
if (verbose)
(void)printf("cap_mkdb: %d capability records\n", reccnt);
}
void
usage(void)
{
(void)fprintf(stderr,
"usage: cap_mkdb [-iv] [-f outfile] file1 [file2 ...]\n");
exit(1);
}
|