mtree.h revision 1.16 1 /* $NetBSD: mtree.h,v 1.16 2001/10/22 07:07:46 lukem Exp $ */
2
3 /*-
4 * Copyright (c) 1990, 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 * @(#)mtree.h 8.1 (Berkeley) 6/6/93
36 */
37
38 #ifndef _MTREE_H_
39 #define _MTREE_H_
40
41 #define KEYDEFAULT (F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | \
42 F_TIME | F_TYPE | F_UID | F_FLAGS)
43
44 #define MISMATCHEXIT 2
45
46 typedef struct _node {
47 struct _node *parent, *child; /* up, down */
48 struct _node *prev, *next; /* left, right */
49 off_t st_size; /* size */
50 struct timespec st_mtimespec; /* last modification time */
51 u_long cksum; /* check sum */
52 char *slink; /* symbolic link reference */
53 uid_t st_uid; /* uid */
54 gid_t st_gid; /* gid */
55 #define MBITS (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO)
56 mode_t st_mode; /* mode */
57 dev_t st_rdev; /* device type */
58 u_long st_flags; /* flags */
59 nlink_t st_nlink; /* link count */
60 char *md5sum; /* md5 checksum */
61 char *tags; /* tags, comma delimited */
62
63 #define F_CKSUM 0x00000001 /* check sum */
64 #define F_DONE 0x00000002 /* directory done */
65 #define F_GID 0x00000004 /* gid */
66 #define F_GNAME 0x00000008 /* group name */
67 #define F_IGN 0x00000010 /* ignore */
68 #define F_MAGIC 0x00000020 /* name has magic chars */
69 #define F_MODE 0x00000040 /* mode */
70 #define F_NLINK 0x00000080 /* number of links */
71 #define F_OPT 0x00000100 /* existence optional */
72 #define F_SIZE 0x00000200 /* size */
73 #define F_SLINK 0x00000400 /* symbolic link */
74 #define F_TIME 0x00000800 /* modification time */
75 #define F_TYPE 0x00001000 /* file type */
76 #define F_UID 0x00002000 /* uid */
77 #define F_UNAME 0x00004000 /* user name */
78 #define F_VISIT 0x00008000 /* file visited */
79 #define F_FLAGS 0x00010000 /* file flags */
80 #define F_MD5 0x00020000 /* md5 check sum */
81 #define F_TAGS 0x00040000 /* tags */
82 #define F_DEV 0x00080000 /* device type */
83 int flags; /* items set */
84
85 #define F_BLOCK 0x001 /* block special */
86 #define F_CHAR 0x002 /* char special */
87 #define F_DIR 0x004 /* directory */
88 #define F_FIFO 0x008 /* fifo */
89 #define F_FILE 0x010 /* regular file */
90 #define F_LINK 0x020 /* symbolic link */
91 #define F_SOCK 0x040 /* socket */
92 int type; /* file type */
93
94 char name[1]; /* file name (must be last) */
95 } NODE;
96
97
98 typedef struct {
99 char **list;
100 int count;
101 } slist_t;
102
103
104 NODE *spec(FILE *);
105 u_int nodetoino(u_int);
106
107
108 #define RP(p) \
109 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
110 (p)->fts_path + 2 : (p)->fts_path)
111
112 #define UF_MASK ((UF_NODUMP | UF_IMMUTABLE | \
113 UF_APPEND | UF_OPAQUE) \
114 & UF_SETTABLE) /* user settable flags */
115 #define SF_MASK ((SF_ARCHIVED | SF_IMMUTABLE | \
116 SF_APPEND) & SF_SETTABLE) /* root settable flags */
117 #define CH_MASK (UF_MASK | SF_MASK) /* all settable flags */
118 #define SP_FLGS (SF_IMMUTABLE | SF_APPEND) /* special flags */
119
120 #endif /* _MTREE_H_ */
121