1 /*- 2 * Copyright (c) 1991, 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 * @(#)misc.c 8.1 (Berkeley) 6/6/93 34 * $FreeBSD: src/usr.sbin/mtree/misc.c,v 1.8.2.1 2000/06/28 02:33:17 joe Exp $ 35 * $DragonFly: src/usr.sbin/mtree/misc.c,v 1.5 2004/03/15 16:24:22 dillon Exp $ 36 */ 37 38 #include <sys/types.h> 39 #include <sys/stat.h> 40 #include <err.h> 41 #include <fts.h> 42 #include <stdio.h> 43 #include <unistd.h> 44 #include "mtree.h" 45 #include "extern.h" 46 47 typedef struct _key { 48 const char *name; /* key name */ 49 u_int val; /* value */ 50 51 #define NEEDVALUE 0x01 52 u_int flags; 53 } KEY; 54 55 /* NB: the following table must be sorted lexically. */ 56 static KEY keylist[] = { 57 {"cksum", F_CKSUM, NEEDVALUE}, 58 {"flags", F_FLAGS, NEEDVALUE}, 59 {"gid", F_GID, NEEDVALUE}, 60 {"gname", F_GNAME, NEEDVALUE}, 61 {"ignore", F_IGN, 0}, 62 {"link", F_SLINK, NEEDVALUE}, 63 #ifdef MD5 64 {"md5digest", F_MD5, NEEDVALUE}, 65 #endif 66 {"mode", F_MODE, NEEDVALUE}, 67 {"nlink", F_NLINK, NEEDVALUE}, 68 {"nochange", F_NOCHANGE, 0}, 69 #ifdef RMD160 70 {"ripemd160digest", F_RMD160, NEEDVALUE}, 71 #endif 72 #ifdef SHA1 73 {"sha1digest", F_SHA1, NEEDVALUE}, 74 #endif 75 {"size", F_SIZE, NEEDVALUE}, 76 {"time", F_TIME, NEEDVALUE}, 77 {"type", F_TYPE, NEEDVALUE}, 78 {"uid", F_UID, NEEDVALUE}, 79 {"uname", F_UNAME, NEEDVALUE}, 80 }; 81 82 int keycompare(const void *, const void *); 83 84 u_int 85 parsekey(char *name, int *needvaluep) 86 { 87 KEY *k, tmp; 88 89 tmp.name = name; 90 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 91 sizeof(KEY), keycompare); 92 if (k == NULL) 93 errx(1, "line %d: unknown keyword %s", lineno, name); 94 95 if (needvaluep) 96 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 97 return (k->val); 98 } 99 100 int 101 keycompare(const void *a, const void *b) 102 { 103 104 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name)); 105 } 106 107 char * 108 flags_to_string(u_long fflags) 109 { 110 char *string; 111 112 string = fflagstostr(fflags); 113 if (string != NULL && *string == '\0') { 114 free(string); 115 string = strdup("none"); 116 } 117 if (string == NULL) 118 err(1, NULL); 119 120 return string; 121 } 122