mtree.h revision 44303
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. 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. 32 * 33 * @(#)mtree.h 8.1 (Berkeley) 6/6/93 34 */ 35 36#include <string.h> 37#include <stdlib.h> 38 39#define KEYDEFAULT \ 40 (F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | F_TIME | F_UID) 41 42#define MISMATCHEXIT 2 43 44typedef struct _node { 45 struct _node *parent, *child; /* up, down */ 46 struct _node *prev, *next; /* left, right */ 47 off_t st_size; /* size */ 48 struct timespec st_mtimespec; /* last modification time */ 49 u_long cksum; /* check sum */ 50 char *md5digest; /* MD5 digest */ 51 char *sha1digest; /* SHA-1 digest */ 52 char *rmd160digest; /* RIPEMD160 digest */ 53 char *slink; /* symbolic link reference */ 54 uid_t st_uid; /* uid */ 55 gid_t st_gid; /* gid */ 56#define MBITS (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO) 57 mode_t st_mode; /* mode */ 58 nlink_t st_nlink; /* link count */ 59 60#define F_CKSUM 0x0001 /* check sum */ 61#define F_DONE 0x0002 /* directory done */ 62#define F_GID 0x0004 /* gid */ 63#define F_GNAME 0x0008 /* group name */ 64#define F_IGN 0x0010 /* ignore */ 65#define F_MAGIC 0x0020 /* name has magic chars */ 66#define F_MODE 0x0040 /* mode */ 67#define F_NLINK 0x0080 /* number of links */ 68#define F_SIZE 0x0100 /* size */ 69#define F_SLINK 0x0200 /* link count */ 70#define F_TIME 0x0400 /* modification time */ 71#define F_TYPE 0x0800 /* file type */ 72#define F_UID 0x1000 /* uid */ 73#define F_UNAME 0x2000 /* user name */ 74#define F_VISIT 0x4000 /* file visited */ 75#define F_MD5 0x8000 /* MD5 digest */ 76#define F_NOCHANGE 0x10000 /* If owner/mode "wrong", do */ 77 /* not change */ 78#define F_SHA1 0x20000 /* SHA-1 digest */ 79#define F_RMD160 0x40000 /* RIPEMD160 digest */ 80 u_int flags; /* items set */ 81 82#define F_BLOCK 0x001 /* block special */ 83#define F_CHAR 0x002 /* char special */ 84#define F_DIR 0x004 /* directory */ 85#define F_FIFO 0x008 /* fifo */ 86#define F_FILE 0x010 /* regular file */ 87#define F_LINK 0x020 /* symbolic link */ 88#define F_SOCK 0x040 /* socket */ 89 u_char type; /* file type */ 90 91 char name[1]; /* file name (must be last) */ 92} NODE; 93 94#define RP(p) \ 95 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \ 96 (p)->fts_path + 2 : (p)->fts_path) 97