misc.c revision 6286 
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	{"md5digest",	F_MD5,		NEEDVALUE},
61	{"mode",	F_MODE,		NEEDVALUE},
62	{"nlink",	F_NLINK,	NEEDVALUE},
63	{"size",	F_SIZE,		NEEDVALUE},
64	{"time",	F_TIME,		NEEDVALUE},
65	{"type",	F_TYPE,		NEEDVALUE},
66	{"uid",		F_UID,		NEEDVALUE},
67	{"uname",	F_UNAME,	NEEDVALUE},
68};
69
70u_int
71parsekey(name, needvaluep)
72	char *name;
73	int *needvaluep;
74{
75	KEY *k, tmp;
76	int keycompare __P((const void *, const void *));
77
78	tmp.name = name;
79	k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
80	    sizeof(KEY), keycompare);
81	if (k == NULL)
82		err("unknown keyword %s", name);
83
84	if (needvaluep)
85		*needvaluep = k->flags & NEEDVALUE ? 1 : 0;
86	return (k->val);
87}
88
89int
90keycompare(a, b)
91	const void *a, *b;
92{
93	return (strcmp(((KEY *)a)->name, ((KEY *)b)->name));
94}
95
96#if __STDC__
97#include <stdarg.h>
98#else
99#include <varargs.h>
100#endif
101
102void
103#if __STDC__
104err(const char *fmt, ...)
105#else
106err(fmt, va_alist)
107	char *fmt;
108        va_dcl
109#endif
110{
111	va_list ap;
112#if __STDC__
113	va_start(ap, fmt);
114#else
115	va_start(ap);
116#endif
117	(void)fflush(NULL);
118	(void)fprintf(stderr, "\nmtree: ");
119	(void)vfprintf(stderr, fmt, ap);
120	va_end(ap);
121	(void)fprintf(stderr, "\n");
122	if (lineno)
123		(void)fprintf(stderr,
124		    "mtree: failed at line %d of the specification\n", lineno);
125	exit(1);
126	/* NOTREACHED */
127}
128