misc.c revision 2860
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 */ 35 36#include <sys/types.h> 37#include <sys/stat.h> 38#include <fts.h> 39#include <stdio.h> 40#include "mtree.h" 41#include "extern.h" 42 43extern int lineno; 44 45typedef struct _key { 46 char *name; /* key name */ 47 u_int val; /* value */ 48 49#define NEEDVALUE 0x01 50 u_int flags; 51} KEY; 52 53/* NB: the following table must be sorted lexically. */ 54static KEY keylist[] = { 55 {"cksum", F_CKSUM, NEEDVALUE}, 56 {"gid", F_GID, NEEDVALUE}, 57 {"gname", F_GNAME, NEEDVALUE}, 58 {"ignore", F_IGN, 0}, 59 {"link", F_SLINK, NEEDVALUE}, 60 {"mode", F_MODE, NEEDVALUE}, 61 {"nlink", F_NLINK, NEEDVALUE}, 62 {"size", F_SIZE, NEEDVALUE}, 63 {"time", F_TIME, NEEDVALUE}, 64 {"type", F_TYPE, NEEDVALUE}, 65 {"uid", F_UID, NEEDVALUE}, 66 {"uname", F_UNAME, NEEDVALUE}, 67}; 68 69u_int 70parsekey(name, needvaluep) 71 char *name; 72 int *needvaluep; 73{ 74 KEY *k, tmp; 75 int keycompare __P((const void *, const void *)); 76 77 tmp.name = name; 78 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 79 sizeof(KEY), keycompare); 80 if (k == NULL) 81 err("unknown keyword %s", name); 82 83 if (needvaluep) 84 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 85 return (k->val); 86} 87 88int 89keycompare(a, b) 90 const void *a, *b; 91{ 92 return (strcmp(((KEY *)a)->name, ((KEY *)b)->name)); 93} 94 95#if __STDC__ 96#include <stdarg.h> 97#else 98#include <varargs.h> 99#endif 100 101void 102#if __STDC__ 103err(const char *fmt, ...) 104#else 105err(fmt, va_alist) 106 char *fmt; 107 va_dcl 108#endif 109{ 110 va_list ap; 111#if __STDC__ 112 va_start(ap, fmt); 113#else 114 va_start(ap); 115#endif 116 (void)fflush(NULL); 117 (void)fprintf(stderr, "\nmtree: "); 118 (void)vfprintf(stderr, fmt, ap); 119 va_end(ap); 120 (void)fprintf(stderr, "\n"); 121 if (lineno) 122 (void)fprintf(stderr, 123 "mtree: failed at line %d of the specification\n", lineno); 124 exit(1); 125 /* NOTREACHED */ 126} 127