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.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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
| 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.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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
|
46#include <ufs/ufs/dinode.h>
47
48/*
49 * The size of a logical block number.
50 */
51typedef long ufs_lbn_t;
52
53/*
54 * This must agree with the definition in <ufs/ufs/dir.h>.
55 */
56#define doff_t int32_t
57
58/*
59 * The inode is used to describe each active (or recently active) file in the
60 * UFS filesystem. It is composed of two types of information. The first part
61 * is the information that is needed only while the file is active (such as
62 * the identity of the file and linkage to speed its lookup). The second part
63 * is the permanent meta-data associated with the file which is read in
64 * from the permanent dinode from long term storage when the file becomes
65 * active, and is put back when the file is no longer being used.
66 */
67struct inode {
68 struct lock i_lock; /* Inode lock. >Keep this first< */
69 LIST_ENTRY(inode) i_hash;/* Hash chain. */
70 struct vnode *i_vnode;/* Vnode associated with this inode. */
71 struct vnode *i_devvp;/* Vnode for block I/O. */
72 u_int32_t i_flag; /* flags, see below */
73 dev_t i_dev; /* Device associated with the inode. */
74 ino_t i_number; /* The identity of the inode. */
75 int i_effnlink; /* i_nlink when I/O completes */
76
77 union { /* Associated filesystem. */
78 struct fs *fs; /* FFS */
79 struct ext2_sb_info *e2fs; /* EXT2FS */
80 } inode_u;
81#define i_fs inode_u.fs
82#define i_e2fs inode_u.e2fs
83 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
84 u_quad_t i_modrev; /* Revision level for NFS lease. */
85 struct lockf *i_lockf;/* Head of byte-level lock list. */
86 /*
87 * Side effects; used during directory lookup.
88 */
89 int32_t i_count; /* Size of free slot in directory. */
90 doff_t i_endoff; /* End of useful stuff in directory. */
91 doff_t i_diroff; /* Offset in dir, where we found last entry. */
92 doff_t i_offset; /* Offset of free space in directory. */
93 ino_t i_ino; /* Inode number of found directory. */
94 u_int32_t i_reclen; /* Size of found directory entry. */
95 u_int32_t i_spare[4]; /* XXX actually non-spare (for ext2fs). */
96 /*
97 * The on-disk dinode itself.
98 */
99 struct dinode i_din; /* 128 bytes of the on-disk dinode. */
100};
101
102#define i_atime i_din.di_atime
103#define i_atimensec i_din.di_atimensec
104#define i_blocks i_din.di_blocks
105#define i_ctime i_din.di_ctime
106#define i_ctimensec i_din.di_ctimensec
107#define i_db i_din.di_db
108#define i_flags i_din.di_flags
109#define i_gen i_din.di_gen
110#define i_gid i_din.di_gid
111#define i_ib i_din.di_ib
112#define i_mode i_din.di_mode
113#define i_mtime i_din.di_mtime
114#define i_mtimensec i_din.di_mtimensec
115#define i_nlink i_din.di_nlink
116#define i_rdev i_din.di_rdev
117#define i_shortlink i_din.di_shortlink
118#define i_size i_din.di_size
119#define i_uid i_din.di_uid
120
121/* These flags are kept in i_flag. */
122#define IN_ACCESS 0x0001 /* Access time update request. */
123#define IN_CHANGE 0x0002 /* Inode change time update request. */
124#define IN_UPDATE 0x0004 /* Modification time update request. */
125#define IN_MODIFIED 0x0008 /* Inode has been modified. */
126#define IN_RENAME 0x0010 /* Inode is being renamed. */
127#define IN_SHLOCK 0x0020 /* File has shared lock. */
128#define IN_EXLOCK 0x0040 /* File has exclusive lock. */
129#define IN_HASHED 0x0080 /* Inode is on hash list */
130#define IN_LAZYMOD 0x0100 /* Modified, but don't write yet. */
131
132#ifdef KERNEL
133/*
134 * Structure used to pass around logical block paths generated by
135 * ufs_getlbns and used by truncate and bmap code.
136 */
137struct indir {
138 ufs_daddr_t in_lbn; /* Logical block number. */
139 int in_off; /* Offset in buffer. */
140 int in_exists; /* Flag if the block exists. */
141};
142
143/* Convert between inode pointers and vnode pointers. */
144#define VTOI(vp) ((struct inode *)(vp)->v_data)
145#define ITOV(ip) ((ip)->i_vnode)
146
147/* Determine if soft dependencies are being done */
148#define DOINGSOFTDEP(vp) ((vp)->v_mount->mnt_flag & MNT_SOFTDEP)
149
150/* This overlays the fid structure (see mount.h). */
151struct ufid {
152 u_int16_t ufid_len; /* Length of structure. */
153 u_int16_t ufid_pad; /* Force 32-bit alignment. */
154 ino_t ufid_ino; /* File number (ino). */
155 int32_t ufid_gen; /* Generation number. */
156};
157#endif /* KERNEL */
158
159#endif /* !_UFS_UFS_INODE_H_ */
| 47#include <ufs/ufs/dinode.h>
48
49/*
50 * The size of a logical block number.
51 */
52typedef long ufs_lbn_t;
53
54/*
55 * This must agree with the definition in <ufs/ufs/dir.h>.
56 */
57#define doff_t int32_t
58
59/*
60 * The inode is used to describe each active (or recently active) file in the
61 * UFS filesystem. It is composed of two types of information. The first part
62 * is the information that is needed only while the file is active (such as
63 * the identity of the file and linkage to speed its lookup). The second part
64 * is the permanent meta-data associated with the file which is read in
65 * from the permanent dinode from long term storage when the file becomes
66 * active, and is put back when the file is no longer being used.
67 */
68struct inode {
69 struct lock i_lock; /* Inode lock. >Keep this first< */
70 LIST_ENTRY(inode) i_hash;/* Hash chain. */
71 struct vnode *i_vnode;/* Vnode associated with this inode. */
72 struct vnode *i_devvp;/* Vnode for block I/O. */
73 u_int32_t i_flag; /* flags, see below */
74 dev_t i_dev; /* Device associated with the inode. */
75 ino_t i_number; /* The identity of the inode. */
76 int i_effnlink; /* i_nlink when I/O completes */
77
78 union { /* Associated filesystem. */
79 struct fs *fs; /* FFS */
80 struct ext2_sb_info *e2fs; /* EXT2FS */
81 } inode_u;
82#define i_fs inode_u.fs
83#define i_e2fs inode_u.e2fs
84 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
85 u_quad_t i_modrev; /* Revision level for NFS lease. */
86 struct lockf *i_lockf;/* Head of byte-level lock list. */
87 /*
88 * Side effects; used during directory lookup.
89 */
90 int32_t i_count; /* Size of free slot in directory. */
91 doff_t i_endoff; /* End of useful stuff in directory. */
92 doff_t i_diroff; /* Offset in dir, where we found last entry. */
93 doff_t i_offset; /* Offset of free space in directory. */
94 ino_t i_ino; /* Inode number of found directory. */
95 u_int32_t i_reclen; /* Size of found directory entry. */
96 u_int32_t i_spare[4]; /* XXX actually non-spare (for ext2fs). */
97 /*
98 * The on-disk dinode itself.
99 */
100 struct dinode i_din; /* 128 bytes of the on-disk dinode. */
101};
102
103#define i_atime i_din.di_atime
104#define i_atimensec i_din.di_atimensec
105#define i_blocks i_din.di_blocks
106#define i_ctime i_din.di_ctime
107#define i_ctimensec i_din.di_ctimensec
108#define i_db i_din.di_db
109#define i_flags i_din.di_flags
110#define i_gen i_din.di_gen
111#define i_gid i_din.di_gid
112#define i_ib i_din.di_ib
113#define i_mode i_din.di_mode
114#define i_mtime i_din.di_mtime
115#define i_mtimensec i_din.di_mtimensec
116#define i_nlink i_din.di_nlink
117#define i_rdev i_din.di_rdev
118#define i_shortlink i_din.di_shortlink
119#define i_size i_din.di_size
120#define i_uid i_din.di_uid
121
122/* These flags are kept in i_flag. */
123#define IN_ACCESS 0x0001 /* Access time update request. */
124#define IN_CHANGE 0x0002 /* Inode change time update request. */
125#define IN_UPDATE 0x0004 /* Modification time update request. */
126#define IN_MODIFIED 0x0008 /* Inode has been modified. */
127#define IN_RENAME 0x0010 /* Inode is being renamed. */
128#define IN_SHLOCK 0x0020 /* File has shared lock. */
129#define IN_EXLOCK 0x0040 /* File has exclusive lock. */
130#define IN_HASHED 0x0080 /* Inode is on hash list */
131#define IN_LAZYMOD 0x0100 /* Modified, but don't write yet. */
132
133#ifdef KERNEL
134/*
135 * Structure used to pass around logical block paths generated by
136 * ufs_getlbns and used by truncate and bmap code.
137 */
138struct indir {
139 ufs_daddr_t in_lbn; /* Logical block number. */
140 int in_off; /* Offset in buffer. */
141 int in_exists; /* Flag if the block exists. */
142};
143
144/* Convert between inode pointers and vnode pointers. */
145#define VTOI(vp) ((struct inode *)(vp)->v_data)
146#define ITOV(ip) ((ip)->i_vnode)
147
148/* Determine if soft dependencies are being done */
149#define DOINGSOFTDEP(vp) ((vp)->v_mount->mnt_flag & MNT_SOFTDEP)
150
151/* This overlays the fid structure (see mount.h). */
152struct ufid {
153 u_int16_t ufid_len; /* Length of structure. */
154 u_int16_t ufid_pad; /* Force 32-bit alignment. */
155 ino_t ufid_ino; /* File number (ino). */
156 int32_t ufid_gen; /* Generation number. */
157};
158#endif /* KERNEL */
159
160#endif /* !_UFS_UFS_INODE_H_ */
|