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