1 /*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * 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 * from: @(#)mtree.h 5.9 (Berkeley) 2/19/92 34 * $Id: mtree.h,v 1.4 1994/04/25 18:21:23 cgd Exp $ 35 */ 36 37 #include <string.h> 38 #include <stdlib.h> 39 40 #define KEYDEFAULT \ 41 (F_GID | F_MODE | F_NLINK | F_SIZE | F_SLINK | F_TIME | F_UID) 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 */ 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 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 u_short flags; /* items set */ 74 75 #define F_BLOCK 0x001 /* block special */ 76 #define F_CHAR 0x002 /* char special */ 77 #define F_DIR 0x004 /* directory */ 78 #define F_FIFO 0x008 /* fifo */ 79 #define F_FILE 0x010 /* regular file */ 80 #define F_LINK 0x020 /* symbolic link */ 81 #define F_SOCK 0x040 /* socket */ 82 u_char type; /* file type */ 83 84 char name[1]; /* file name (must be last) */ 85 } NODE; 86 87 #define RP(p) \ 88 ((p)->fts_path[0] == '.' && (p)->fts_path[1] == '/' ? \ 89 (p)->fts_path + 2 : (p)->fts_path) 90