|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1989 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: * @(#)dinode.h 7.10 (Berkeley) 5/8/91
34: */
35:
36: /*
37: * A dinode contains all the meta-data associated with a UFS file.
38: * This structure defines the on-disk format of a dinode.
39: */
40:
41: #define NDADDR 12 /* direct addresses in inode */
42: #define NIADDR 3 /* indirect addresses in inode */
43:
44: struct dinode {
45: u_short di_mode; /* 0: mode and type of file */
46: short di_nlink; /* 2: number of links to file */
47: uid_t di_uid; /* 4: owner's user id */
48: gid_t di_gid; /* 6: owner's group id */
49: u_quad di_qsize; /* 8: number of bytes in file */
50: time_t di_atime; /* 16: time last accessed */
51: long di_atspare;
52: time_t di_mtime; /* 24: time last modified */
53: long di_mtspare;
54: time_t di_ctime; /* 32: last time inode changed */
55: long di_ctspare;
56: daddr_t di_db[NDADDR]; /* 40: disk block addresses */
57: daddr_t di_ib[NIADDR]; /* 88: indirect blocks */
58: long di_flags; /* 100: status, currently unused */
59: long di_blocks; /* 104: blocks actually held */
60: long di_gen; /* 108: generation number */
61: long di_spare[4]; /* 112: reserved, currently unused */
62: };
63:
64: #if BYTE_ORDER == LITTLE_ENDIAN || defined(tahoe) /* ugh! -- must be fixed */
65: #define di_size di_qsize.val[0]
66: #else /* BYTE_ORDER == BIG_ENDIAN */
67: #define di_size di_qsize.val[1]
68: #endif
69: #define di_rdev di_db[0]
70:
71: /* file modes */
72: #define IFMT 0170000 /* mask of file type */
73: #define IFIFO 0010000 /* named pipe (fifo) */
74: #define IFCHR 0020000 /* character special device */
75: #define IFDIR 0040000 /* directory */
76: #define IFBLK 0060000 /* block special device */
77: #define IFREG 0100000 /* regular file */
78: #define IFLNK 0120000 /* symbolic link */
79: #define IFSOCK 0140000 /* UNIX domain socket */
80:
81: #define ISUID 04000 /* set user identifier when exec'ing */
82: #define ISGID 02000 /* set group identifier when exec'ing */
83: #define ISVTX 01000 /* save execution information on exit */
84: #define IREAD 0400 /* read permission */
85: #define IWRITE 0200 /* write permission */
86: #define IEXEC 0100 /* execute permission */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.