1 /* $NetBSD: misc.c,v 1.27 2005/09/29 14:29:03 tron Exp $ */ 2 3 /*- 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 * 31 * @(#)misc.c 8.1 (Berkeley) 6/6/93 32 */ 33 34 #if HAVE_NBTOOL_CONFIG_H 35 #include "nbtool_config.h" 36 #endif 37 38 #include <sys/cdefs.h> 39 #if defined(__RCSID) && !defined(lint) 40 __RCSID("$NetBSD: misc.c,v 1.27 2005/09/29 14:29:03 tron Exp $"); 41 #endif /* not lint */ 42 43 #include <sys/types.h> 44 #include <sys/stat.h> 45 46 #include <stdarg.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include <string.h> 50 51 #include "extern.h" 52 53 typedef struct _key { 54 const char *name; /* key name */ 55 u_int val; /* value */ 56 57 #define NEEDVALUE 0x01 58 u_int flags; 59 } KEY; 60 61 /* NB: the following tables must be sorted lexically. */ 62 static KEY keylist[] = { 63 {"cksum", F_CKSUM, NEEDVALUE}, 64 {"device", F_DEV, NEEDVALUE}, 65 {"flags", F_FLAGS, NEEDVALUE}, 66 {"gid", F_GID, NEEDVALUE}, 67 {"gname", F_GNAME, NEEDVALUE}, 68 {"ignore", F_IGN, 0}, 69 {"link", F_SLINK, NEEDVALUE}, 70 {"md5", F_MD5, NEEDVALUE}, 71 {"md5digest", F_MD5, NEEDVALUE}, 72 {"mode", F_MODE, NEEDVALUE}, 73 {"nlink", F_NLINK, NEEDVALUE}, 74 {"optional", F_OPT, 0}, 75 {"rmd160", F_RMD160, NEEDVALUE}, 76 {"rmd160digest",F_RMD160, NEEDVALUE}, 77 {"sha1", F_SHA1, NEEDVALUE}, 78 {"sha1digest", F_SHA1, NEEDVALUE}, 79 {"sha256", F_SHA256, NEEDVALUE}, 80 {"sha256digest",F_SHA256, NEEDVALUE}, 81 {"sha384", F_SHA384, NEEDVALUE}, 82 {"sha384digest",F_SHA384, NEEDVALUE}, 83 {"sha512", F_SHA512, NEEDVALUE}, 84 {"sha512digest",F_SHA512, NEEDVALUE}, 85 {"size", F_SIZE, NEEDVALUE}, 86 {"tags", F_TAGS, NEEDVALUE}, 87 {"time", F_TIME, NEEDVALUE}, 88 {"type", F_TYPE, NEEDVALUE}, 89 {"uid", F_UID, NEEDVALUE}, 90 {"uname", F_UNAME, NEEDVALUE} 91 }; 92 93 static KEY typelist[] = { 94 {"block", F_BLOCK, }, 95 {"char", F_CHAR, }, 96 {"dir", F_DIR, }, 97 {"fifo", F_FIFO, }, 98 {"file", F_FILE, }, 99 {"link", F_LINK, }, 100 {"socket", F_SOCK, }, 101 }; 102 103 slist_t excludetags, includetags; 104 int keys = KEYDEFAULT; 105 106 107 int keycompare(const void *, const void *); 108 109 u_int 110 parsekey(const char *name, int *needvaluep) 111 { 112 static int allbits; 113 KEY *k, tmp; 114 115 if (allbits == 0) { 116 int i; 117 118 for (i = 0; i < sizeof(keylist) / sizeof(KEY); i++) 119 allbits |= keylist[i].val; 120 } 121 tmp.name = name; 122 if (strcmp(name, "all") == 0) 123 return (allbits); 124 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 125 sizeof(KEY), keycompare); 126 if (k == NULL) 127 mtree_err("unknown keyword `%s'", name); 128 129 if (needvaluep) 130 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 131 132 return (k->val); 133 } 134 135 u_int 136 parsetype(const char *name) 137 { 138 KEY *k, tmp; 139 140 tmp.name = name; 141 k = (KEY *)bsearch(&tmp, typelist, sizeof(typelist) / sizeof(KEY), 142 sizeof(KEY), keycompare); 143 if (k == NULL) 144 mtree_err("unknown file type `%s'", name); 145 146 return (k->val); 147 } 148 149 int 150 keycompare(const void *a, const void *b) 151 { 152 153 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name)); 154 } 155 156 void 157 mtree_err(const char *fmt, ...) 158 { 159 va_list ap; 160 161 va_start(ap, fmt); 162 vwarnx(fmt, ap); 163 va_end(ap); 164 if (mtree_lineno) 165 warnx("failed at line %lu of the specification", 166 (u_long) mtree_lineno); 167 exit(1); 168 /* NOTREACHED */ 169 } 170 171 void 172 addtag(slist_t *list, char *elem) 173 { 174 175 #define TAG_CHUNK 20 176 177 if ((list->count % TAG_CHUNK) == 0) { 178 char **new; 179 180 new = (char **)realloc(list->list, (list->count + TAG_CHUNK) 181 * sizeof(char *)); 182 if (new == NULL) 183 mtree_err("memory allocation error"); 184 list->list = new; 185 } 186 list->list[list->count] = elem; 187 list->count++; 188 } 189 190 void 191 parsetags(slist_t *list, char *args) 192 { 193 char *p, *e; 194 int len; 195 196 if (args == NULL) { 197 addtag(list, NULL); 198 return; 199 } 200 while ((p = strsep(&args, ",")) != NULL) { 201 if (*p == '\0') 202 continue; 203 len = strlen(p) + 3; /* "," + p + ",\0" */ 204 if ((e = malloc(len)) == NULL) 205 mtree_err("memory allocation error"); 206 snprintf(e, len, ",%s,", p); 207 addtag(list, e); 208 } 209 } 210 211 /* 212 * matchtags 213 * returns 0 if there's a match from the exclude list in the node's tags, 214 * or there's an include list and no match. 215 * return 1 otherwise. 216 */ 217 int 218 matchtags(NODE *node) 219 { 220 int i; 221 222 if (node->tags) { 223 for (i = 0; i < excludetags.count; i++) 224 if (strstr(node->tags, excludetags.list[i])) 225 break; 226 if (i < excludetags.count) 227 return (0); 228 229 for (i = 0; i < includetags.count; i++) 230 if (strstr(node->tags, includetags.list[i])) 231 break; 232 if (i > 0 && i == includetags.count) 233 return (0); 234 } else if (includetags.count > 0) { 235 return (0); 236 } 237 return (1); 238 } 239 240 u_int 241 nodetoino(u_int type) 242 { 243 244 switch (type) { 245 case F_BLOCK: 246 return S_IFBLK; 247 case F_CHAR: 248 return S_IFCHR; 249 case F_DIR: 250 return S_IFDIR; 251 case F_FIFO: 252 return S_IFIFO; 253 case F_FILE: 254 return S_IFREG; 255 case F_LINK: 256 return S_IFLNK; 257 #ifdef S_IFSOCK 258 case F_SOCK: 259 return S_IFSOCK; 260 #endif 261 default: 262 printf("unknown type %d", type); 263 abort(); 264 } 265 /* NOTREACHED */ 266 } 267 268 const char * 269 nodetype(u_int type) 270 { 271 272 return (inotype(nodetoino(type))); 273 } 274 275 276 const char * 277 inotype(u_int type) 278 { 279 280 switch (type & S_IFMT) { 281 case S_IFBLK: 282 return ("block"); 283 case S_IFCHR: 284 return ("char"); 285 case S_IFDIR: 286 return ("dir"); 287 case S_IFIFO: 288 return ("fifo"); 289 case S_IFREG: 290 return ("file"); 291 case S_IFLNK: 292 return ("link"); 293 #ifdef S_IFSOCK 294 case S_IFSOCK: 295 return ("socket"); 296 #endif 297 default: 298 return ("unknown"); 299 } 300 /* NOTREACHED */ 301 } 302