1/*
2 * Copyright (c) 1982, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
--- 22 unchanged lines hidden (view full) ---
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)inode.h 8.9 (Berkeley) 5/14/95
39 * $Id: inode.h,v 1.16 1997/07/13 15:40:31 bde Exp $
40 */
41
42#ifndef _UFS_UFS_INODE_H_
43#define _UFS_UFS_INODE_H_
44
45#include <ufs/ufs/dinode.h>
46
47/*
--- 6 unchanged lines hidden (view full) ---
54 * UFS filesystem. It is composed of two types of information. The first part
55 * is the information that is needed only while the file is active (such as
56 * the identity of the file and linkage to speed its lookup). The second part
57 * is the permanent meta-data associated with the file which is read in
58 * from the permanent dinode from long term storage when the file becomes
59 * active, and is put back when the file is no longer being used.
60 */
61struct inode {
62 LIST_ENTRY(inode) i_hash;/* Hash chain. */
63 struct vnode *i_vnode;/* Vnode associated with this inode. */
64 struct vnode *i_devvp;/* Vnode for block I/O. */
65 u_int32_t i_flag; /* flags, see below */
66 dev_t i_dev; /* Device associated with the inode. */
67 ino_t i_number; /* The identity of the inode. */
68
69 union { /* Associated filesystem. */
70 struct fs *fs; /* FFS */
71 struct lfs *lfs; /* LFS */
72 struct ext2_sb_info *e2fs; /* EXT2FS */
73 } inode_u;
74#define i_fs inode_u.fs
75#define i_lfs inode_u.lfs
76#define i_e2fs inode_u.e2fs
77 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
78 u_quad_t i_modrev; /* Revision level for NFS lease. */
79 struct lockf *i_lockf;/* Head of byte-level lock list. */
80 struct lock i_lock; /* Inode lock. */
81 /*
82 * Side effects; used during directory lookup.
83 */
84 int32_t i_count; /* Size of free slot in directory. */
85 doff_t i_endoff; /* End of useful stuff in directory. */
86 doff_t i_diroff; /* Offset in dir, where we found last entry. */
87 doff_t i_offset; /* Offset of free space in directory. */
88 ino_t i_ino; /* Inode number of found directory. */
--- 85 unchanged lines hidden ---
2 * Copyright (c) 1982, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
--- 22 unchanged lines hidden (view full) ---
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)inode.h 8.9 (Berkeley) 5/14/95
39 * $Id: inode.h,v 1.16 1997/07/13 15:40:31 bde Exp $
40 */
41
42#ifndef _UFS_UFS_INODE_H_
43#define _UFS_UFS_INODE_H_
44
45#include <ufs/ufs/dinode.h>
46
47/*
--- 6 unchanged lines hidden (view full) ---
54 * UFS filesystem. It is composed of two types of information. The first part
55 * is the information that is needed only while the file is active (such as
56 * the identity of the file and linkage to speed its lookup). The second part
57 * is the permanent meta-data associated with the file which is read in
58 * from the permanent dinode from long term storage when the file becomes
59 * active, and is put back when the file is no longer being used.
60 */
61struct inode {
62 LIST_ENTRY(inode) i_hash;/* Hash chain. */
63 struct vnode *i_vnode;/* Vnode associated with this inode. */
64 struct vnode *i_devvp;/* Vnode for block I/O. */
65 u_int32_t i_flag; /* flags, see below */
66 dev_t i_dev; /* Device associated with the inode. */
67 ino_t i_number; /* The identity of the inode. */
68
69 union { /* Associated filesystem. */
70 struct fs *fs; /* FFS */
71 struct lfs *lfs; /* LFS */
72 struct ext2_sb_info *e2fs; /* EXT2FS */
73 } inode_u;
74#define i_fs inode_u.fs
75#define i_lfs inode_u.lfs
76#define i_e2fs inode_u.e2fs
77 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
78 u_quad_t i_modrev; /* Revision level for NFS lease. */
79 struct lockf *i_lockf;/* Head of byte-level lock list. */
80 struct lock i_lock; /* Inode lock. */
81 /*
82 * Side effects; used during directory lookup.
83 */
84 int32_t i_count; /* Size of free slot in directory. */
85 doff_t i_endoff; /* End of useful stuff in directory. */
86 doff_t i_diroff; /* Offset in dir, where we found last entry. */
87 doff_t i_offset; /* Offset of free space in directory. */
88 ino_t i_ino; /* Inode number of found directory. */
--- 85 unchanged lines hidden ---