| mtree.h (121300) | mtree.h (144295) |
|---|---|
| 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 --- 13 unchanged lines hidden (view full) --- 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 | 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 --- 13 unchanged lines hidden (view full) --- 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 $ | 30 * $FreeBSD: head/usr.sbin/mtree/mtree.h 144295 2005-03-29 11:44:17Z tobez $ |
| 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 */ | 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 *sha256digest; /* SHA-256 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 */ --- 14 unchanged lines hidden (view full) --- 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 */ | 50 char *rmd160digest; /* RIPEMD160 digest */ 51 char *slink; /* symbolic link reference */ 52 uid_t st_uid; /* uid */ 53 gid_t st_gid; /* gid */ 54#define MBITS (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO) 55 mode_t st_mode; /* mode */ 56 u_long st_flags; /* flags */ 57 nlink_t st_nlink; /* link count */ --- 14 unchanged lines hidden (view full) --- 72#define F_UNAME 0x2000 /* user name */ 73#define F_VISIT 0x4000 /* file visited */ 74#define F_MD5 0x8000 /* MD5 digest */ 75#define F_NOCHANGE 0x10000 /* If owner/mode "wrong", do */ 76 /* not change */ 77#define F_SHA1 0x20000 /* SHA-1 digest */ 78#define F_RMD160 0x40000 /* RIPEMD160 digest */ 79#define F_FLAGS 0x80000 /* file flags */ |
| 80#define F_SHA256 0x100000 /* SHA-256 digest */ |
|
| 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) | 81 u_int flags; /* items set */ 82 83#define F_BLOCK 0x001 /* block special */ 84#define F_CHAR 0x002 /* char special */ 85#define F_DIR 0x004 /* directory */ 86#define F_FIFO 0x008 /* fifo */ 87#define F_FILE 0x010 /* regular file */ 88#define F_LINK 0x020 /* symbolic link */ 89#define F_SOCK 0x040 /* socket */ 90 u_char type; /* file type */ 91 92 char name[1]; /* file name (must be last) */ 93} NODE; 94 95#define RP(p) \ 96 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \ 97 (p)->fts_path + 2 : (p)->fts_path) |