1244541Sbrooks/* $NetBSD: misc.c,v 1.34 2012/12/20 19:09:25 christos Exp $ */ 2244541Sbrooks 3244541Sbrooks/*- 4244541Sbrooks * Copyright (c) 1991, 1993 5244541Sbrooks * The Regents of the University of California. All rights reserved. 6244541Sbrooks * 7244541Sbrooks * Redistribution and use in source and binary forms, with or without 8244541Sbrooks * modification, are permitted provided that the following conditions 9244541Sbrooks * are met: 10244541Sbrooks * 1. Redistributions of source code must retain the above copyright 11244541Sbrooks * notice, this list of conditions and the following disclaimer. 12244541Sbrooks * 2. Redistributions in binary form must reproduce the above copyright 13244541Sbrooks * notice, this list of conditions and the following disclaimer in the 14244541Sbrooks * documentation and/or other materials provided with the distribution. 15244541Sbrooks * 3. Neither the name of the University nor the names of its contributors 16244541Sbrooks * may be used to endorse or promote products derived from this software 17244541Sbrooks * without specific prior written permission. 18244541Sbrooks * 19244541Sbrooks * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20244541Sbrooks * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21244541Sbrooks * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22244541Sbrooks * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23244541Sbrooks * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24244541Sbrooks * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25244541Sbrooks * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26244541Sbrooks * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27244541Sbrooks * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28244541Sbrooks * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29244541Sbrooks * SUCH DAMAGE. 30244541Sbrooks * 31244541Sbrooks * @(#)misc.c 8.1 (Berkeley) 6/6/93 32244541Sbrooks */ 33244541Sbrooks 34244541Sbrooks#if HAVE_NBTOOL_CONFIG_H 35244541Sbrooks#include "nbtool_config.h" 36244541Sbrooks#endif 37244541Sbrooks 38244541Sbrooks#include <sys/cdefs.h> 39244541Sbrooks#if defined(__RCSID) && !defined(lint) 40244541Sbrooks__RCSID("$NetBSD: misc.c,v 1.34 2012/12/20 19:09:25 christos Exp $"); 41244541Sbrooks#endif /* not lint */ 42244541Sbrooks 43244541Sbrooks#include <sys/types.h> 44244541Sbrooks#include <sys/stat.h> 45244541Sbrooks 46244541Sbrooks#include <stdarg.h> 47244541Sbrooks#include <stdio.h> 48244541Sbrooks#include <stdlib.h> 49244541Sbrooks#include <string.h> 50244541Sbrooks 51244541Sbrooks#include "extern.h" 52244541Sbrooks 53244541Sbrooksenum flavor flavor = F_MTREE; 54244541Sbrooks 55244541Sbrookstypedef struct _key { 56244541Sbrooks const char *name; /* key name */ 57244541Sbrooks u_int val; /* value */ 58244541Sbrooks 59244541Sbrooks#define NEEDVALUE 0x01 60244541Sbrooks u_int flags; 61244541Sbrooks} KEY; 62244541Sbrooks 63244541Sbrooks/* NB: the following tables must be sorted lexically. */ 64244541Sbrooksstatic KEY keylist[] = { 65244541Sbrooks {"cksum", F_CKSUM, NEEDVALUE}, 66244541Sbrooks {"device", F_DEV, NEEDVALUE}, 67244541Sbrooks {"flags", F_FLAGS, NEEDVALUE}, 68244541Sbrooks {"gid", F_GID, NEEDVALUE}, 69244541Sbrooks {"gname", F_GNAME, NEEDVALUE}, 70244541Sbrooks {"ignore", F_IGN, 0}, 71244541Sbrooks {"link", F_SLINK, NEEDVALUE}, 72244541Sbrooks {"md5", F_MD5, NEEDVALUE}, 73244541Sbrooks {"md5digest", F_MD5, NEEDVALUE}, 74244541Sbrooks {"mode", F_MODE, NEEDVALUE}, 75244541Sbrooks {"nlink", F_NLINK, NEEDVALUE}, 76244541Sbrooks {"nochange", F_NOCHANGE, 0}, 77244541Sbrooks {"optional", F_OPT, 0}, 78244541Sbrooks {"ripemd160digest", F_RMD160, NEEDVALUE}, 79244541Sbrooks {"rmd160", F_RMD160, NEEDVALUE}, 80244541Sbrooks {"rmd160digest",F_RMD160, NEEDVALUE}, 81244541Sbrooks {"sha1", F_SHA1, NEEDVALUE}, 82244541Sbrooks {"sha1digest", F_SHA1, NEEDVALUE}, 83244541Sbrooks {"sha256", F_SHA256, NEEDVALUE}, 84244541Sbrooks {"sha256digest",F_SHA256, NEEDVALUE}, 85244541Sbrooks {"sha384", F_SHA384, NEEDVALUE}, 86244541Sbrooks {"sha384digest",F_SHA384, NEEDVALUE}, 87244541Sbrooks {"sha512", F_SHA512, NEEDVALUE}, 88244541Sbrooks {"sha512digest",F_SHA512, NEEDVALUE}, 89244541Sbrooks {"size", F_SIZE, NEEDVALUE}, 90244541Sbrooks {"tags", F_TAGS, NEEDVALUE}, 91244541Sbrooks {"time", F_TIME, NEEDVALUE}, 92244541Sbrooks {"type", F_TYPE, NEEDVALUE}, 93244541Sbrooks {"uid", F_UID, NEEDVALUE}, 94244541Sbrooks {"uname", F_UNAME, NEEDVALUE} 95244541Sbrooks}; 96244541Sbrooks 97244541Sbrooksstatic KEY typelist[] = { 98244541Sbrooks {"block", F_BLOCK, 0}, 99244541Sbrooks {"char", F_CHAR, 0}, 100244541Sbrooks {"dir", F_DIR, 0}, 101244541Sbrooks#ifdef S_IFDOOR 102244541Sbrooks {"door", F_DOOR, 0}, 103244541Sbrooks#endif 104244541Sbrooks {"fifo", F_FIFO, 0}, 105244541Sbrooks {"file", F_FILE, 0}, 106244541Sbrooks {"link", F_LINK, 0}, 107244541Sbrooks {"socket", F_SOCK, 0}, 108244541Sbrooks}; 109244541Sbrooks 110244541Sbrooksslist_t excludetags, includetags; 111244541Sbrooksint keys = KEYDEFAULT; 112244541Sbrooks 113244541Sbrooks 114244541Sbrooksint keycompare(const void *, const void *); 115244541Sbrooks 116244541Sbrooksu_int 117244541Sbrooksparsekey(const char *name, int *needvaluep) 118244541Sbrooks{ 119244541Sbrooks static int allbits; 120244541Sbrooks KEY *k, tmp; 121244541Sbrooks 122244541Sbrooks if (allbits == 0) { 123244541Sbrooks size_t i; 124244541Sbrooks 125244541Sbrooks for (i = 0; i < sizeof(keylist) / sizeof(KEY); i++) 126244541Sbrooks allbits |= keylist[i].val; 127244541Sbrooks } 128244541Sbrooks tmp.name = name; 129244541Sbrooks if (strcmp(name, "all") == 0) 130244541Sbrooks return (allbits); 131244541Sbrooks k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 132244541Sbrooks sizeof(KEY), keycompare); 133244541Sbrooks if (k == NULL) 134244541Sbrooks mtree_err("unknown keyword `%s'", name); 135244541Sbrooks 136244541Sbrooks if (needvaluep) 137244541Sbrooks *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 138244541Sbrooks 139244541Sbrooks return (k->val); 140244541Sbrooks} 141244541Sbrooks 142244541Sbrooksu_int 143244541Sbrooksparsetype(const char *name) 144244541Sbrooks{ 145244541Sbrooks KEY *k, tmp; 146244541Sbrooks 147244541Sbrooks tmp.name = name; 148244541Sbrooks k = (KEY *)bsearch(&tmp, typelist, sizeof(typelist) / sizeof(KEY), 149244541Sbrooks sizeof(KEY), keycompare); 150244541Sbrooks if (k == NULL) 151244541Sbrooks mtree_err("unknown file type `%s'", name); 152244541Sbrooks 153244541Sbrooks return (k->val); 154244541Sbrooks} 155244541Sbrooks 156244541Sbrooksint 157244541Sbrookskeycompare(const void *a, const void *b) 158244541Sbrooks{ 159244541Sbrooks 160244541Sbrooks return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name)); 161244541Sbrooks} 162244541Sbrooks 163244541Sbrooksvoid 164244541Sbrooksmtree_err(const char *fmt, ...) 165244541Sbrooks{ 166244541Sbrooks va_list ap; 167244541Sbrooks 168244541Sbrooks va_start(ap, fmt); 169244541Sbrooks vwarnx(fmt, ap); 170244541Sbrooks va_end(ap); 171244541Sbrooks if (mtree_lineno) 172244541Sbrooks warnx("failed at line %lu of the specification", 173244541Sbrooks (u_long) mtree_lineno); 174244541Sbrooks exit(1); 175244541Sbrooks /* NOTREACHED */ 176244541Sbrooks} 177244541Sbrooks 178244541Sbrooksvoid 179244541Sbrooksaddtag(slist_t *list, char *elem) 180244541Sbrooks{ 181244541Sbrooks 182244541Sbrooks#define TAG_CHUNK 20 183244541Sbrooks 184244541Sbrooks if ((list->count % TAG_CHUNK) == 0) { 185244541Sbrooks char **new; 186244541Sbrooks 187244541Sbrooks new = (char **)realloc(list->list, (list->count + TAG_CHUNK) 188244541Sbrooks * sizeof(char *)); 189244541Sbrooks if (new == NULL) 190244541Sbrooks mtree_err("memory allocation error"); 191244541Sbrooks list->list = new; 192244541Sbrooks } 193244541Sbrooks list->list[list->count] = elem; 194244541Sbrooks list->count++; 195244541Sbrooks} 196244541Sbrooks 197244541Sbrooksvoid 198244541Sbrooksparsetags(slist_t *list, char *args) 199244541Sbrooks{ 200244541Sbrooks char *p, *e; 201244541Sbrooks int len; 202244541Sbrooks 203244541Sbrooks if (args == NULL) { 204244541Sbrooks addtag(list, NULL); 205244541Sbrooks return; 206244541Sbrooks } 207244541Sbrooks while ((p = strsep(&args, ",")) != NULL) { 208244541Sbrooks if (*p == '\0') 209244541Sbrooks continue; 210244541Sbrooks len = strlen(p) + 3; /* "," + p + ",\0" */ 211244541Sbrooks if ((e = malloc(len)) == NULL) 212244541Sbrooks mtree_err("memory allocation error"); 213244541Sbrooks snprintf(e, len, ",%s,", p); 214244541Sbrooks addtag(list, e); 215244541Sbrooks } 216244541Sbrooks} 217244541Sbrooks 218244541Sbrooks/* 219244541Sbrooks * matchtags 220244541Sbrooks * returns 0 if there's a match from the exclude list in the node's tags, 221244541Sbrooks * or there's an include list and no match. 222244541Sbrooks * return 1 otherwise. 223244541Sbrooks */ 224244541Sbrooksint 225244541Sbrooksmatchtags(NODE *node) 226244541Sbrooks{ 227244541Sbrooks int i; 228244541Sbrooks 229244541Sbrooks if (node->tags) { 230244541Sbrooks for (i = 0; i < excludetags.count; i++) 231244541Sbrooks if (strstr(node->tags, excludetags.list[i])) 232244541Sbrooks break; 233244541Sbrooks if (i < excludetags.count) 234244541Sbrooks return (0); 235244541Sbrooks 236244541Sbrooks for (i = 0; i < includetags.count; i++) 237244541Sbrooks if (strstr(node->tags, includetags.list[i])) 238244541Sbrooks break; 239244541Sbrooks if (i > 0 && i == includetags.count) 240244541Sbrooks return (0); 241244541Sbrooks } else if (includetags.count > 0) { 242244541Sbrooks return (0); 243244541Sbrooks } 244244541Sbrooks return (1); 245244541Sbrooks} 246244541Sbrooks 247244541Sbrooksu_int 248244541Sbrooksnodetoino(u_int type) 249244541Sbrooks{ 250244541Sbrooks 251244541Sbrooks switch (type) { 252244541Sbrooks case F_BLOCK: 253244541Sbrooks return S_IFBLK; 254244541Sbrooks case F_CHAR: 255244541Sbrooks return S_IFCHR; 256244541Sbrooks case F_DIR: 257244541Sbrooks return S_IFDIR; 258244541Sbrooks case F_FIFO: 259244541Sbrooks return S_IFIFO; 260244541Sbrooks case F_FILE: 261244541Sbrooks return S_IFREG; 262244541Sbrooks case F_LINK: 263244541Sbrooks return S_IFLNK; 264244541Sbrooks#ifdef S_IFSOCK 265244541Sbrooks case F_SOCK: 266244541Sbrooks return S_IFSOCK; 267244541Sbrooks#endif 268244541Sbrooks default: 269244541Sbrooks printf("unknown type %d", type); 270244541Sbrooks abort(); 271244541Sbrooks } 272244541Sbrooks /* NOTREACHED */ 273244541Sbrooks} 274244541Sbrooks 275244541Sbrooksconst char * 276244541Sbrooksnodetype(u_int type) 277244541Sbrooks{ 278244541Sbrooks 279244541Sbrooks return (inotype(nodetoino(type))); 280244541Sbrooks} 281244541Sbrooks 282244541Sbrooks 283244541Sbrooksconst char * 284244541Sbrooksinotype(u_int type) 285244541Sbrooks{ 286244541Sbrooks 287244541Sbrooks switch (type & S_IFMT) { 288244541Sbrooks case S_IFBLK: 289244541Sbrooks return ("block"); 290244541Sbrooks case S_IFCHR: 291244541Sbrooks return ("char"); 292244541Sbrooks case S_IFDIR: 293244541Sbrooks return ("dir"); 294244541Sbrooks case S_IFIFO: 295244541Sbrooks return ("fifo"); 296244541Sbrooks case S_IFREG: 297244541Sbrooks return ("file"); 298244541Sbrooks case S_IFLNK: 299244541Sbrooks return ("link"); 300244541Sbrooks#ifdef S_IFSOCK 301244541Sbrooks case S_IFSOCK: 302244541Sbrooks return ("socket"); 303244541Sbrooks#endif 304244541Sbrooks#ifdef S_IFDOOR 305244541Sbrooks case S_IFDOOR: 306244541Sbrooks return ("door"); 307244541Sbrooks#endif 308244541Sbrooks default: 309244541Sbrooks return ("unknown"); 310244541Sbrooks } 311244541Sbrooks /* NOTREACHED */ 312244541Sbrooks} 313