misc.c revision 36670
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#ifndef lint 35#if 0 36static char sccsid[] = "@(#)misc.c 8.1 (Berkeley) 6/6/93"; 37#endif 38static const char rcsid[] = 39 "$Id: misc.c,v 1.4 1997/10/01 06:30:01 charnier Exp $"; 40#endif /*not lint */ 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 "mtree.h" 48#include "extern.h" 49 50extern int lineno; 51 52typedef struct _key { 53 char *name; /* key name */ 54 u_int val; /* value */ 55 56#define NEEDVALUE 0x01 57 u_int flags; 58} KEY; 59 60/* NB: the following table must be sorted lexically. */ 61static KEY keylist[] = { 62 {"cksum", F_CKSUM, NEEDVALUE}, 63 {"gid", F_GID, NEEDVALUE}, 64 {"gname", F_GNAME, NEEDVALUE}, 65 {"ignore", F_IGN, 0}, 66 {"link", F_SLINK, NEEDVALUE}, 67 {"md5digest", F_MD5, NEEDVALUE}, 68 {"mode", F_MODE, NEEDVALUE}, 69 {"nlink", F_NLINK, NEEDVALUE}, 70 {"nochange", F_NOCHANGE, 0}, 71 {"size", F_SIZE, NEEDVALUE}, 72 {"time", F_TIME, NEEDVALUE}, 73 {"type", F_TYPE, NEEDVALUE}, 74 {"uid", F_UID, NEEDVALUE}, 75 {"uname", F_UNAME, NEEDVALUE}, 76}; 77 78u_int 79parsekey(name, needvaluep) 80 char *name; 81 int *needvaluep; 82{ 83 KEY *k, tmp; 84 int keycompare __P((const void *, const void *)); 85 86 tmp.name = name; 87 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 88 sizeof(KEY), keycompare); 89 if (k == NULL) 90 errx(1, "line %d: unknown keyword %s", lineno, name); 91 92 if (needvaluep) 93 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 94 return (k->val); 95} 96 97int 98keycompare(a, b) 99 const void *a, *b; 100{ 101 return (strcmp(((KEY *)a)->name, ((KEY *)b)->name)); 102} 103