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