Add PCICAP_{ID,NEXTPTR} to avoid using magic number
[dragonfly.git] / usr.sbin / mtree / misc.c
CommitLineData
984263bc
MD
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.
1de703da
MD
32 *
33 * @(#)misc.c 8.1 (Berkeley) 6/6/93
34 * $FreeBSD: src/usr.sbin/mtree/misc.c,v 1.8.2.1 2000/06/28 02:33:17 joe Exp $
4a5947c3 35 * $DragonFly: src/usr.sbin/mtree/misc.c,v 1.5 2004/03/15 16:24:22 dillon Exp $
984263bc
MD
36 */
37
984263bc
MD
38#include <sys/types.h>
39#include <sys/stat.h>
40#include <err.h>
41#include <fts.h>
42#include <stdio.h>
43#include <unistd.h>
44#include "mtree.h"
45#include "extern.h"
46
47extern int lineno;
48
49typedef struct _key {
50 char *name; /* key name */
51 u_int val; /* value */
52
53#define NEEDVALUE 0x01
54 u_int flags;
55} KEY;
56
57/* NB: the following table must be sorted lexically. */
58static KEY keylist[] = {
59 {"cksum", F_CKSUM, NEEDVALUE},
60 {"flags", F_FLAGS, NEEDVALUE},
61 {"gid", F_GID, NEEDVALUE},
62 {"gname", F_GNAME, NEEDVALUE},
63 {"ignore", F_IGN, 0},
64 {"link", F_SLINK, NEEDVALUE},
65#ifdef MD5
66 {"md5digest", F_MD5, NEEDVALUE},
67#endif
68 {"mode", F_MODE, NEEDVALUE},
69 {"nlink", F_NLINK, NEEDVALUE},
70 {"nochange", F_NOCHANGE, 0},
71#ifdef RMD160
72 {"ripemd160digest", F_RMD160, NEEDVALUE},
73#endif
74#ifdef SHA1
75 {"sha1digest", F_SHA1, NEEDVALUE},
76#endif
77 {"size", F_SIZE, NEEDVALUE},
78 {"time", F_TIME, NEEDVALUE},
79 {"type", F_TYPE, NEEDVALUE},
80 {"uid", F_UID, NEEDVALUE},
81 {"uname", F_UNAME, NEEDVALUE},
82};
83
84u_int
6ffd281a 85parsekey(char *name, int *needvaluep)
984263bc
MD
86{
87 KEY *k, tmp;
2d8a3be7 88 int keycompare(const void *, const void *);
984263bc
MD
89
90 tmp.name = name;
91 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
92 sizeof(KEY), keycompare);
93 if (k == NULL)
94 errx(1, "line %d: unknown keyword %s", lineno, name);
95
96 if (needvaluep)
97 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
98 return (k->val);
99}
100
101int
6ffd281a 102keycompare(const void *a, const void *b)
984263bc 103{
4a5947c3 104
984263bc
MD
105 return (strcmp(((KEY *)a)->name, ((KEY *)b)->name));
106}
107
108char *
6ffd281a 109flags_to_string(u_long fflags)
984263bc
MD
110{
111 char *string;
112
113 string = fflagstostr(fflags);
114 if (string != NULL && *string == '\0') {
115 free(string);
116 string = strdup("none");
117 }
118 if (string == NULL)
119 err(1, NULL);
120
121 return string;
122}