[apple/file_cmds.git] / mtree / mtree.h

/*-
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)mtree.h	8.1 (Berkeley) 6/6/93
 * $FreeBSD: src/usr.sbin/mtree/mtree.h,v 1.5 1999/12/09 20:38:35 joe Exp $
 */

#include <string.h>
#include <stdlib.h>

#define	KEYDEFAULT \
	(F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | F_TIME | F_UID | F_FLAGS)

#define	MISMATCHEXIT	2

typedef struct _node {
	struct _node	*parent, *child;	/* up, down */
	struct _node	*prev, *next;		/* left, right */
	off_t	st_size;			/* size */
	struct timespec	st_mtimespec;		/* last modification time */
	u_long	cksum;				/* check sum */
	char	*md5digest;			/* MD5 digest */
	char	*sha1digest;			/* SHA-1 digest */
	char	*rmd160digest;			/* RIPEMD160 digest */
	char	*slink;				/* symbolic link reference */
	uid_t	st_uid;				/* uid */
	gid_t	st_gid;				/* gid */
#define	MBITS	(S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO)
	mode_t	st_mode;			/* mode */
	u_long	st_flags;			/* flags */
	nlink_t	st_nlink;			/* link count */

#define	F_CKSUM	0x0001				/* check sum */
#define	F_DONE	0x0002				/* directory done */
#define	F_GID	0x0004				/* gid */
#define	F_GNAME	0x0008				/* group name */
#define	F_IGN	0x0010				/* ignore */
#define	F_MAGIC	0x0020				/* name has magic chars */
#define	F_MODE	0x0040				/* mode */
#define	F_NLINK	0x0080				/* number of links */
#define	F_SIZE	0x0100				/* size */
#define	F_SLINK	0x0200				/* link count */
#define	F_TIME	0x0400				/* modification time */
#define	F_TYPE	0x0800				/* file type */
#define	F_UID	0x1000				/* uid */
#define	F_UNAME	0x2000				/* user name */
#define	F_VISIT	0x4000				/* file visited */
#define F_MD5	0x8000				/* MD5 digest */
#define F_NOCHANGE 0x10000			/* If owner/mode "wrong", do */
						/* not change */
#define	F_SHA1	0x20000				/* SHA-1 digest */
#define	F_RMD160 0x40000			/* RIPEMD160 digest */
#define	F_FLAGS	0x80000				/* file flags */
	u_int	flags;				/* items set */

#define	F_BLOCK	0x001				/* block special */
#define	F_CHAR	0x002				/* char special */
#define	F_DIR	0x004				/* directory */
#define	F_FIFO	0x008				/* fifo */
#define	F_FILE	0x010				/* regular file */
#define	F_LINK	0x020				/* symbolic link */
#define	F_SOCK	0x040				/* socket */
	u_char	type;				/* file type */

	char	name[1];			/* file name (must be last) */
} NODE;

#define	RP(p)	\
	((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
	    (p)->fts_path + 2 : (p)->fts_path)
Commit	Line	Data
44a7a5ab A	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
440bd198	34	* $FreeBSD: src/usr.sbin/mtree/mtree.h,v 1.5 1999/12/09 20:38:35 joe Exp $
44a7a5ab A	35	*/
44a7a5ab A	36
44a7a5ab A	37	#include <string.h>
44a7a5ab A	38	#include <stdlib.h>
44a7a5ab A	39
44a7a5ab A	40	#define KEYDEFAULT \
440bd198	41	(F_GID \| F_MODE \| F_NLINK \| F_SIZE \| F_SLINK \| F_TIME \| F_UID \| F_FLAGS)
44a7a5ab A	42
	43	#define MISMATCHEXIT 2
	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	u_long cksum; /* check sum */
440bd198 A	51	char md5digest; / MD5 digest */
	52	char sha1digest; / SHA-1 digest */
	53	char rmd160digest; / RIPEMD160 digest */
44a7a5ab A	54	char slink; / symbolic link reference */
	55	uid_t st_uid; /* uid */
	56	gid_t st_gid; /* gid */
	57	#define MBITS (S_ISUID\|S_ISGID\|S_ISTXT\|S_IRWXU\|S_IRWXG\|S_IRWXO)
	58	mode_t st_mode; /* mode */
440bd198	59	u_long st_flags; /* flags */
44a7a5ab A	60	nlink_t st_nlink; /* link count */
	61
	62	#define F_CKSUM 0x0001 /* check sum */
	63	#define F_DONE 0x0002 /* directory done */
	64	#define F_GID 0x0004 /* gid */
	65	#define F_GNAME 0x0008 /* group name */
	66	#define F_IGN 0x0010 /* ignore */
	67	#define F_MAGIC 0x0020 /* name has magic chars */
	68	#define F_MODE 0x0040 /* mode */
	69	#define F_NLINK 0x0080 /* number of links */
440bd198 A	70	#define F_SIZE 0x0100 /* size */
	71	#define F_SLINK 0x0200 /* link count */
	72	#define F_TIME 0x0400 /* modification time */
	73	#define F_TYPE 0x0800 /* file type */
	74	#define F_UID 0x1000 /* uid */
	75	#define F_UNAME 0x2000 /* user name */
	76	#define F_VISIT 0x4000 /* file visited */
	77	#define F_MD5 0x8000 /* MD5 digest */
	78	#define F_NOCHANGE 0x10000 /* If owner/mode "wrong", do */
	79	/* not change */
	80	#define F_SHA1 0x20000 /* SHA-1 digest */
	81	#define F_RMD160 0x40000 /* RIPEMD160 digest */
	82	#define F_FLAGS 0x80000 /* file flags */
	83	u_int flags; /* items set */
44a7a5ab A	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	u_char type; /* file type */
	93
	94	char name[1]; /* file name (must be last) */
	95	} NODE;
	96
	97	#define RP(p) \
	98	((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \
	99	(p)->fts_path + 2 : (p)->fts_path)