1 /* $NetBSD: misc.c,v 1.4 1995/03/07 21:26:23 cgd Exp $ */ 2 3 /*- 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)misc.c 8.1 (Berkeley) 6/6/93 36 */ 37 38 #include <sys/types.h> 39 #include <sys/stat.h> 40 #include <fts.h> 41 #include <stdio.h> 42 #include "mtree.h" 43 #include "extern.h" 44 45 extern int lineno; 46 47 typedef struct _key { 48 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 "gid", F_GID, NEEDVALUE, 59 "gname", F_GNAME, NEEDVALUE, 60 "ignore", F_IGN, 0, 61 "link", F_SLINK, NEEDVALUE, 62 "mode", F_MODE, NEEDVALUE, 63 "nlink", F_NLINK, NEEDVALUE, 64 "optional", F_OPT, 0, 65 "size", F_SIZE, NEEDVALUE, 66 "time", F_TIME, NEEDVALUE, 67 "type", F_TYPE, NEEDVALUE, 68 "uid", F_UID, NEEDVALUE, 69 "uname", F_UNAME, NEEDVALUE, 70 }; 71 72 u_int 73 parsekey(name, needvaluep) 74 char *name; 75 int *needvaluep; 76 { 77 KEY *k, tmp; 78 int keycompare __P((const void *, const void *)); 79 80 tmp.name = name; 81 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY), 82 sizeof(KEY), keycompare); 83 if (k == NULL) 84 err("unknown keyword %s", name); 85 86 if (needvaluep) 87 *needvaluep = k->flags & NEEDVALUE ? 1 : 0; 88 return (k->val); 89 } 90 91 int 92 keycompare(a, b) 93 const void *a, *b; 94 { 95 return (strcmp(((KEY *)a)->name, ((KEY *)b)->name)); 96 } 97 98 #if __STDC__ 99 #include <stdarg.h> 100 #else 101 #include <varargs.h> 102 #endif 103 104 void 105 #if __STDC__ 106 err(const char *fmt, ...) 107 #else 108 err(fmt, va_alist) 109 char *fmt; 110 va_dcl 111 #endif 112 { 113 va_list ap; 114 #if __STDC__ 115 va_start(ap, fmt); 116 #else 117 va_start(ap); 118 #endif 119 (void)fprintf(stderr, "mtree: "); 120 (void)vfprintf(stderr, fmt, ap); 121 va_end(ap); 122 (void)fprintf(stderr, "\n"); 123 if (lineno) 124 (void)fprintf(stderr, 125 "mtree: failed at line %d of the specification\n", lineno); 126 exit(1); 127 /* NOTREACHED */ 128 } 129