1 /* $NetBSD: misc.c,v 1.34 2012/12/20 19:09:25 christos 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/types.h> 39 #include <sys/stat.h> 40 41 #include <stdarg.h> 42 #include <stdio.h> 43 #include <stdlib.h> 44 #include <string.h> 45 46 #include "extern.h" 47 48 enum flavor flavor = F_MTREE; 49 50 typedef struct _key { 51 const char *name; /* key name */ 52 u_int val; /* value */ 53 54 #define NEEDVALUE 0x01 55 u_int flags; 56 } KEY; 57 58 /* NB: the following tables must be sorted lexically. */ 59 static KEY keylist[] = { 60 {"cksum", F_CKSUM, NEEDVALUE}, 61 {"device", F_DEV, NEEDVALUE}, 62 {"flags", F_FLAGS, NEEDVALUE}, 63 {"gid", F_GID, NEEDVALUE}, 64 {"gname", F_GNAME, NEEDVALUE}, 65 {"ignore", F_IGN, 0}, 66 {"link", F_SLINK, NEEDVALUE}, 67 {"md5", F_MD5, NEEDVALUE}, 68 {"md5digest", F_MD5, NEEDVALUE}, 69 {"mode", F_MODE, NEEDVALUE}, 70 {"nlink", F_NLINK, NEEDVALUE}, 71 {"nochange", F_NOCHANGE, 0}, 72 {"optional", F_OPT, 0}, 73 {"ripemd160digest", F_RMD160, NEEDVALUE}, 74 {"rmd160", F_RMD160, NEEDVALUE}, 75 {"rmd160digest",F_RMD160, NEEDVALUE}, 76 {"sha1", F_SHA1, NEEDVALUE}, 77 {"sha1digest", F_SHA1, NEEDVALUE}, 78 {"sha256", F_SHA256, NEEDVALUE}, 79 {"sha256digest",F_SHA256, NEEDVALUE}, 80 {"sha384", F_SHA384, NEEDVALUE}, 81 {"sha384digest",F_SHA384, NEEDVALUE}, 82 {"sha512", F_SHA512, NEEDVALUE}, 83 {"sha512digest",F_SHA512, NEEDVALUE}, 84 {"size", F_SIZE, NEEDVALUE}, 85 {"tags", F_TAGS, NEEDVALUE}, 86 {"time", F_TIME, NEEDVALUE}, 87 {"type", F_TYPE, NEEDVALUE}, 88 {"uid", F_UID, NEEDVALUE}, 89 {"uname", F_UNAME, NEEDVALUE} 90 }; 91 92 static KEY typelist[] = { 93 {"block", F_BLOCK, 0}, 94 {"char", F_CHAR, 0}, 95 {"dir", F_DIR, 0}, 96 #ifdef S_IFDOOR 97 {"door", F_DOOR, 0}, 98 #endif 99 {"fifo", F_FIFO, 0}, 100 {"file", F_FILE, 0}, 101 {"link", F_LINK, 0}, 102 {"socket", F_SOCK, 0}, 103 }; 104 105 slist_t excludetags, includetags; 106 int keys = KEYDEFAULT; 107 108 109 int keycompare(const void *, const void *); 110 111 u_int 112 parsekey(const char *name, int *needvaluep) 113 { 114 static int allbits; 115 KEY *k, tmp; 116 117 if (allbits == 0) { 118 size_t i; 119 120 for (i = 0; i < sizeof(keylist) / sizeof(KEY); i++) 121 allbits |= keylist[i].val; 122 } 123 tmp.name = name; 124 if (strcmp(name, "all") == 0) 125 return (allbits); 126 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 127 sizeof(KEY), keycompare); 128 if (k == NULL) 129 mtree_err("unknown keyword `%s'", name); 130 131 if (needvaluep) 132 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 133 134 return (k->val); 135 } 136 137 u_int 138 parsetype(const char *name) 139 { 140 KEY *k, tmp; 141 142 tmp.name = name; 143 k = (KEY *)bsearch(&tmp, typelist, sizeof(typelist) / sizeof(KEY), 144 sizeof(KEY), keycompare); 145 if (k == NULL) 146 mtree_err("unknown file type `%s'", name); 147 148 return (k->val); 149 } 150 151 int 152 keycompare(const void *a, const void *b) 153 { 154 155 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name)); 156 } 157 158 void 159 mtree_err(const char *fmt, ...) 160 { 161 va_list ap; 162 163 va_start(ap, fmt); 164 vwarnx(fmt, ap); 165 va_end(ap); 166 if (mtree_lineno) 167 warnx("failed at line %lu of the specification", 168 (u_long) mtree_lineno); 169 exit(1); 170 /* NOTREACHED */ 171 } 172 173 void 174 addtag(slist_t *list, char *elem) 175 { 176 177 #define TAG_CHUNK 20 178 179 if ((list->count % TAG_CHUNK) == 0) { 180 char **new; 181 182 new = (char **)realloc(list->list, (list->count + TAG_CHUNK) 183 * sizeof(char *)); 184 if (new == NULL) 185 mtree_err("memory allocation error"); 186 list->list = new; 187 } 188 list->list[list->count] = elem; 189 list->count++; 190 } 191 192 void 193 parsetags(slist_t *list, char *args) 194 { 195 char *p, *e; 196 int len; 197 198 if (args == NULL) { 199 addtag(list, NULL); 200 return; 201 } 202 while ((p = strsep(&args, ",")) != NULL) { 203 if (*p == '\0') 204 continue; 205 len = strlen(p) + 3; /* "," + p + ",\0" */ 206 if ((e = malloc(len)) == NULL) 207 mtree_err("memory allocation error"); 208 snprintf(e, len, ",%s,", p); 209 addtag(list, e); 210 } 211 } 212 213 /* 214 * matchtags 215 * returns 0 if there's a match from the exclude list in the node's tags, 216 * or there's an include list and no match. 217 * return 1 otherwise. 218 */ 219 int 220 matchtags(NODE *node) 221 { 222 int i; 223 224 if (node->tags) { 225 for (i = 0; i < excludetags.count; i++) 226 if (strstr(node->tags, excludetags.list[i])) 227 break; 228 if (i < excludetags.count) 229 return (0); 230 231 for (i = 0; i < includetags.count; i++) 232 if (strstr(node->tags, includetags.list[i])) 233 break; 234 if (i > 0 && i == includetags.count) 235 return (0); 236 } else if (includetags.count > 0) { 237 return (0); 238 } 239 return (1); 240 } 241 242 u_int 243 nodetoino(u_int type) 244 { 245 246 switch (type) { 247 case F_BLOCK: 248 return S_IFBLK; 249 case F_CHAR: 250 return S_IFCHR; 251 case F_DIR: 252 return S_IFDIR; 253 case F_FIFO: 254 return S_IFIFO; 255 case F_FILE: 256 return S_IFREG; 257 case F_LINK: 258 return S_IFLNK; 259 #ifdef S_IFSOCK 260 case F_SOCK: 261 return S_IFSOCK; 262 #endif 263 default: 264 printf("unknown type %d", type); 265 abort(); 266 } 267 /* NOTREACHED */ 268 } 269 270 const char * 271 nodetype(u_int type) 272 { 273 274 return (inotype(nodetoino(type))); 275 } 276 277 278 const char * 279 inotype(u_int type) 280 { 281 282 switch (type & S_IFMT) { 283 case S_IFBLK: 284 return ("block"); 285 case S_IFCHR: 286 return ("char"); 287 case S_IFDIR: 288 return ("dir"); 289 case S_IFIFO: 290 return ("fifo"); 291 case S_IFREG: 292 return ("file"); 293 case S_IFLNK: 294 return ("link"); 295 #ifdef S_IFSOCK 296 case S_IFSOCK: 297 return ("socket"); 298 #endif 299 #ifdef S_IFDOOR 300 case S_IFDOOR: 301 return ("door"); 302 #endif 303 default: 304 return ("unknown"); 305 } 306 /* NOTREACHED */ 307 } 308