1/*-
2 * Copyright (c) 1990, 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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)mtree.h 8.1 (Berkeley) 6/6/93
30 * $FreeBSD: head/usr.sbin/mtree/mtree.h 121300 2003-10-21 08:27:05Z phk $
31 */
32
33#include <string.h>
34#include <stdlib.h>
35
36#define KEYDEFAULT \
37 (F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | F_TIME | F_UID | F_FLAGS)
38
39#define MISMATCHEXIT 2
40
41typedef struct _node {
42 struct _node *parent, *child; /* up, down */
43 struct _node *prev, *next; /* left, right */
44 off_t st_size; /* size */
45 struct timespec st_mtimespec; /* last modification time */
46 u_long cksum; /* check sum */
47 char *md5digest; /* MD5 digest */
48 char *sha1digest; /* SHA-1 digest */
49 char *rmd160digest; /* RIPEMD160 digest */
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 u_long st_flags; /* flags */
56 nlink_t st_nlink; /* link count */
57
58#define F_CKSUM 0x0001 /* check sum */
59#define F_DONE 0x0002 /* directory done */
60#define F_GID 0x0004 /* gid */
61#define F_GNAME 0x0008 /* group name */
62#define F_IGN 0x0010 /* ignore */
63#define F_MAGIC 0x0020 /* name has magic chars */
64#define F_MODE 0x0040 /* mode */
65#define F_NLINK 0x0080 /* number of links */
66#define F_SIZE 0x0100 /* size */
67#define F_SLINK 0x0200 /* link count */
68#define F_TIME 0x0400 /* modification time */
69#define F_TYPE 0x0800 /* file type */
70#define F_UID 0x1000 /* uid */
71#define F_UNAME 0x2000 /* user name */
72#define F_VISIT 0x4000 /* file visited */
73#define F_MD5 0x8000 /* MD5 digest */
74#define F_NOCHANGE 0x10000 /* If owner/mode "wrong", do */
75 /* not change */
76#define F_SHA1 0x20000 /* SHA-1 digest */
77#define F_RMD160 0x40000 /* RIPEMD160 digest */
78#define F_FLAGS 0x80000 /* file flags */
79 u_int flags; /* items set */
80
81#define F_BLOCK 0x001 /* block special */
82#define F_CHAR 0x002 /* char special */
83#define F_DIR 0x004 /* directory */
84#define F_FIFO 0x008 /* fifo */
85#define F_FILE 0x010 /* regular file */
86#define F_LINK 0x020 /* symbolic link */
87#define F_SOCK 0x040 /* socket */
88 u_char type; /* file type */
89
90 char name[1]; /* file name (must be last) */
91} NODE;
92
93#define RP(p) \
94 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
95 (p)->fts_path + 2 : (p)->fts_path)
2 * Copyright (c) 1990, 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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)mtree.h 8.1 (Berkeley) 6/6/93
30 * $FreeBSD: head/usr.sbin/mtree/mtree.h 121300 2003-10-21 08:27:05Z phk $
31 */
32
33#include <string.h>
34#include <stdlib.h>
35
36#define KEYDEFAULT \
37 (F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | F_TIME | F_UID | F_FLAGS)
38
39#define MISMATCHEXIT 2
40
41typedef struct _node {
42 struct _node *parent, *child; /* up, down */
43 struct _node *prev, *next; /* left, right */
44 off_t st_size; /* size */
45 struct timespec st_mtimespec; /* last modification time */
46 u_long cksum; /* check sum */
47 char *md5digest; /* MD5 digest */
48 char *sha1digest; /* SHA-1 digest */
49 char *rmd160digest; /* RIPEMD160 digest */
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 u_long st_flags; /* flags */
56 nlink_t st_nlink; /* link count */
57
58#define F_CKSUM 0x0001 /* check sum */
59#define F_DONE 0x0002 /* directory done */
60#define F_GID 0x0004 /* gid */
61#define F_GNAME 0x0008 /* group name */
62#define F_IGN 0x0010 /* ignore */
63#define F_MAGIC 0x0020 /* name has magic chars */
64#define F_MODE 0x0040 /* mode */
65#define F_NLINK 0x0080 /* number of links */
66#define F_SIZE 0x0100 /* size */
67#define F_SLINK 0x0200 /* link count */
68#define F_TIME 0x0400 /* modification time */
69#define F_TYPE 0x0800 /* file type */
70#define F_UID 0x1000 /* uid */
71#define F_UNAME 0x2000 /* user name */
72#define F_VISIT 0x4000 /* file visited */
73#define F_MD5 0x8000 /* MD5 digest */
74#define F_NOCHANGE 0x10000 /* If owner/mode "wrong", do */
75 /* not change */
76#define F_SHA1 0x20000 /* SHA-1 digest */
77#define F_RMD160 0x40000 /* RIPEMD160 digest */
78#define F_FLAGS 0x80000 /* file flags */
79 u_int flags; /* items set */
80
81#define F_BLOCK 0x001 /* block special */
82#define F_CHAR 0x002 /* char special */
83#define F_DIR 0x004 /* directory */
84#define F_FIFO 0x008 /* fifo */
85#define F_FILE 0x010 /* regular file */
86#define F_LINK 0x020 /* symbolic link */
87#define F_SOCK 0x040 /* socket */
88 u_char type; /* file type */
89
90 char name[1]; /* file name (must be last) */
91} NODE;
92
93#define RP(p) \
94 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
95 (p)->fts_path + 2 : (p)->fts_path)