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