xref: /netbsd-src/usr.sbin/mtree/mtree.h (revision aaf4ece63a859a04e37cf3a7229b5fab0157cc06)
1 /*	$NetBSD: mtree.h,v 1.24 2005/09/02 17:12:38 elad 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. Neither the name of the University nor the names of its contributors
16  *    may be used to endorse or promote products derived from this software
17  *    without specific prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29  * SUCH DAMAGE.
30  *
31  *	@(#)mtree.h	8.1 (Berkeley) 6/6/93
32  */
33 
34 #ifndef _MTREE_H_
35 #define	_MTREE_H_
36 
37 #define	KEYDEFAULT	(F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | \
38 			F_TIME | F_TYPE | F_UID | F_FLAGS)
39 
40 #define	MISMATCHEXIT	2
41 
42 /* Max. length of hash -- update this if needed when adding a new algorithm. */
43 #define	MAXHASHLEN	128 /* SHA512 */
44 
45 typedef struct _node {
46 	struct _node	*parent, *child;	/* up, down */
47 	struct _node	*prev, *next;		/* left, right */
48 	off_t	st_size;			/* size */
49 	struct timespec	st_mtimespec;		/* last modification time */
50 	char	*slink;				/* symbolic link reference */
51 	uid_t	st_uid;				/* uid */
52 	gid_t	st_gid;				/* gid */
53 #define	MBITS	(S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO)
54 	mode_t	st_mode;			/* mode */
55 	dev_t	st_rdev;			/* device type */
56 	u_long	st_flags;			/* flags */
57 	nlink_t	st_nlink;			/* link count */
58 	u_long	cksum;				/* check sum */
59 	char	*md5digest;			/* MD5 digest */
60 	char	*rmd160digest;			/* RMD-160 digest */
61 	char	*sha1digest;			/* SHA1 digest */
62 	char	*sha256digest;			/* SHA256 digest */
63 	char	*sha384digest;			/* SHA384 digest */
64 	char	*sha512digest;			/* SHA512 digest */
65 	char	*tags;				/* tags, comma delimited */
66 	size_t	lineno;				/* line # entry came from */
67 
68 #define	F_CKSUM		0x00000001		/* cksum(1) check sum */
69 #define	F_DEV		0x00000002		/* device type */
70 #define	F_DONE		0x00000004		/* directory done */
71 #define	F_FLAGS		0x00000008		/* file flags */
72 #define	F_GID		0x00000010		/* gid */
73 #define	F_GNAME		0x00000020		/* group name */
74 #define	F_IGN		0x00000040		/* ignore */
75 #define	F_MAGIC		0x00000080		/* name has magic chars */
76 #define	F_MD5		0x00000100		/* MD5 digest */
77 #define	F_MODE		0x00000200		/* mode */
78 #define	F_NLINK		0x00000400		/* number of links */
79 #define	F_OPT		0x00000800		/* existence optional */
80 #define	F_RMD160	0x00001000		/* RMD-160 digest */
81 #define	F_SHA1		0x00002000		/* SHA1 digest */
82 #define	F_SIZE		0x00004000		/* size */
83 #define	F_SLINK		0x00008000		/* symbolic link */
84 #define	F_TAGS		0x00010000		/* tags */
85 #define	F_TIME		0x00020000		/* modification time */
86 #define	F_TYPE		0x00040000		/* file type */
87 #define	F_UID		0x00080000		/* uid */
88 #define	F_UNAME		0x00100000		/* user name */
89 #define	F_VISIT		0x00200000		/* file visited */
90 #define	F_SHA256	0x00800000		/* SHA256 digest */
91 #define	F_SHA384	0x01000000		/* SHA384 digest */
92 #define	F_SHA512	0x02000000		/* SHA512 digest */
93 
94 	int	flags;				/* items set */
95 
96 #define	F_BLOCK	0x001				/* block special */
97 #define	F_CHAR	0x002				/* char special */
98 #define	F_DIR	0x004				/* directory */
99 #define	F_FIFO	0x008				/* fifo */
100 #define	F_FILE	0x010				/* regular file */
101 #define	F_LINK	0x020				/* symbolic link */
102 #define	F_SOCK	0x040				/* socket */
103 	int	type;				/* file type */
104 
105 	char	name[1];			/* file name (must be last) */
106 } NODE;
107 
108 
109 typedef struct {
110 	char  **list;
111 	int	count;
112 } slist_t;
113 
114 
115 /*
116  * prototypes for functions published to other programs which want to use
117  * the specfile parser but don't want to pull in all of "extern.h"
118  */
119 const char	*inotype(u_int);
120 u_int		 nodetoino(u_int);
121 int		 setup_getid(const char *);
122 NODE		*spec(FILE *);
123 void		 free_nodes(NODE *);
124 char		*vispath(const char *);
125 
126 
127 #define	RP(p)	\
128 	((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
129 	    (p)->fts_path + 2 : (p)->fts_path)
130 
131 #define	UF_MASK ((UF_NODUMP | UF_IMMUTABLE |   \
132                   UF_APPEND | UF_OPAQUE)       \
133                     & UF_SETTABLE)              /* user settable flags */
134 #define	SF_MASK ((SF_ARCHIVED | SF_IMMUTABLE | \
135                   SF_APPEND) & SF_SETTABLE)     /* root settable flags */
136 #define	CH_MASK  (UF_MASK | SF_MASK)            /* all settable flags */
137 #define	SP_FLGS  (SF_IMMUTABLE | SF_APPEND)     /* special flags */
138 
139 #endif /* _MTREE_H_ */
140