projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| ca106bee WJ |
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 | * @(#)mtree.h 5.7 (Berkeley) 5/25/90 | |
| 34 | */ | |
| 35 | ||
| 36 | #include <string.h> | |
| 37 | #include <stdlib.h> | |
| 38 | ||
| 39 | typedef struct _node { | |
| 40 | struct _node *parent, *child; /* up, down */ | |
| 41 | struct _node *prev, *next; /* left, right */ | |
| 42 | off_t st_size; /* size */ | |
| 43 | time_t st_mtime; /* last modification time */ | |
| 44 | u_long cksum; /* check sum */ | |
| 45 | char *slink; /* symbolic link reference */ | |
| 46 | uid_t st_uid; /* owner */ | |
| 47 | gid_t st_gid; /* group */ | |
| 48 | #define MBITS (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO) | |
| 49 | mode_t st_mode; /* mode */ | |
| 50 | nlink_t st_nlink; /* link count */ | |
| 51 | ||
| 52 | #define F_BLOCK 0x001 /* block special */ | |
| 53 | #define F_CHAR 0x002 /* char special */ | |
| 54 | #define F_DIR 0x004 /* directory */ | |
| 55 | #define F_FIFO 0x008 /* fifo */ | |
| 56 | #define F_FILE 0x010 /* regular file */ | |
| 57 | #define F_LINK 0x020 /* symbolic link */ | |
| 58 | #define F_SOCK 0x040 /* socket */ | |
| 59 | u_short type; /* file type */ | |
| 60 | ||
| 61 | #define F_CKSUM 0x0001 /* check sum */ | |
| 62 | #define F_DONE 0x0002 /* directory done */ | |
| 63 | #define F_GROUP 0x0004 /* group */ | |
| 64 | #define F_IGN 0x0008 /* ignore */ | |
| 65 | #define F_MAGIC 0x0010 /* name has magic chars */ | |
| 66 | #define F_MODE 0x0020 /* mode */ | |
| 67 | #define F_NLINK 0x0040 /* number of links */ | |
| 68 | #define F_OWNER 0x0080 /* owner */ | |
| 69 | #define F_SIZE 0x0100 /* size */ | |
| 70 | #define F_SLINK 0x0200 /* link count */ | |
| 71 | #define F_TIME 0x0400 /* modification time */ | |
| 72 | #define F_TYPE 0x0800 /* file type */ | |
| 73 | #define F_VISIT 0x1000 /* file visited */ | |
| 74 | u_short flags; /* items set */ | |
| 75 | ||
| 76 | char name[1]; /* file name (must be last) */ | |
| 77 | } NODE; | |
| 78 | ||
| 79 | #define RP(p) (p->fts_path + 2) |