misc.c revision 121299
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 34#if 0 35#ifndef lint 36static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93"; 37#endif /*not lint */ 38#endif 39#include <sys/cdefs.h> 40__FBSDID("$FreeBSD: head/usr.sbin/mtree/misc.c 121299 2003-10-21 07:58:52Z phk $"); 41 42#include <sys/types.h> 43#include <sys/stat.h> 44#include <err.h> 45#include <fts.h> 46#include <stdio.h> 47#include <unistd.h> 48#include "mtree.h" 49#include "extern.h" 50 51extern int lineno; 52 53typedef 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 table must be sorted lexically. */ 62static KEY keylist[] = { 63 {"cksum", F_CKSUM, NEEDVALUE}, 64 {"flags", F_FLAGS, NEEDVALUE}, 65 {"gid", F_GID, NEEDVALUE}, 66 {"gname", F_GNAME, NEEDVALUE}, 67 {"ignore", F_IGN, 0}, 68 {"link", F_SLINK, NEEDVALUE}, 69#ifdef MD5 70 {"md5digest", F_MD5, NEEDVALUE}, 71#endif 72 {"mode", F_MODE, NEEDVALUE}, 73 {"nlink", F_NLINK, NEEDVALUE}, 74 {"nochange", F_NOCHANGE, 0}, 75#ifdef RMD160 76 {"ripemd160digest", F_RMD160, NEEDVALUE}, 77#endif 78#ifdef SHA1 79 {"sha1digest", F_SHA1, NEEDVALUE}, 80#endif 81 {"size", F_SIZE, NEEDVALUE}, 82 {"time", F_TIME, NEEDVALUE}, 83 {"type", F_TYPE, NEEDVALUE}, 84 {"uid", F_UID, NEEDVALUE}, 85 {"uname", F_UNAME, NEEDVALUE}, 86}; 87 88int keycompare(const void *, const void *); 89 90u_int 91parsekey(char *name, int *needvaluep) 92{ 93 KEY *k, tmp; 94 95 tmp.name = name; 96 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 97 sizeof(KEY), keycompare); 98 if (k == NULL) 99 errx(1, "line %d: unknown keyword %s", lineno, name); 100 101 if (needvaluep) 102 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 103 return (k->val); 104} 105 106int 107keycompare(const void *a, const void *b) 108{ 109 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name)); 110} 111 112char * 113flags_to_string(u_long fflags) 114{ 115 char *string; 116 117 string = fflagstostr(fflags); 118 if (string != NULL && *string == '\0') { 119 free(string); 120 string = strdup("none"); 121 } 122 if (string == NULL) 123 err(1, NULL); 124 125 return string; 126} 127