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.4 (Berkeley) 1/21/94
39 * $Id: inode.h,v 1.2 1994/08/02 07:54:49 davidg Exp $
40 */
41
42#ifndef _UFS_UFS_INODE_H_
43#define _UFS_UFS_INODE_H_
44
45#include <ufs/ufs/dinode.h>
46
47/*
48 * Theoretically, directories can be more than 2Gb in length, however, in
49 * practice this seems unlikely. So, we define the type doff_t as a long
50 * to keep down the cost of doing lookup on a 32-bit machine. If you are
51 * porting to a 64-bit architecture, you should make doff_t the same as off_t.
52 */
53#define doff_t long
54
55/*
56 * The inode is used to describe each active (or recently active)
57 * file in the UFS filesystem. It is composed of two types of
58 * information. The first part is the information that is needed
59 * only while the file is active (such as the identity of the file
60 * and linkage to speed its lookup). The second part is the
61 * permannent meta-data associated with the file which is read
62 * in from the permanent dinode from long term storage when the
63 * file becomes active, and is put back when the file is no longer
64 * being used.
65 */
66struct inode {
67 struct inode *i_next; /* Hash chain forward. */
68 struct inode **i_prev; /* Hash chain back. */
69 struct vnode *i_vnode; /* Vnode associated with this inode. */
70 struct vnode *i_devvp; /* Vnode for block I/O. */
71 u_long i_flag; /* I* flags. */
72 dev_t i_dev; /* Device associated with the inode. */
73 ino_t i_number; /* The identity of the inode. */
74 union { /* Associated filesystem. */
75 struct fs *fs; /* FFS */
76 struct lfs *lfs; /* LFS */
77 } inode_u;
78#define i_fs inode_u.fs
79#define i_lfs inode_u.lfs
80 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
81 u_quad_t i_modrev; /* Revision level for lease. */
82 struct lockf *i_lockf; /* Head of byte-level lock list. */
83 pid_t i_lockholder; /* DEBUG: holder of inode lock. */
84 pid_t i_lockwaiter; /* DEBUG: latest blocked for inode lock. */
85 /*
86 * Side effects; used during directory lookup.
87 */
88 long i_count; /* Size of free slot in directory. */
89 doff_t i_endoff; /* End of useful stuff in directory. */
90 doff_t i_diroff; /* Offset in dir, where we found last entry. */
91 doff_t i_offset; /* Offset of free space in directory. */
92 ino_t i_ino; /* Inode number of found directory. */
93 u_long i_reclen; /* Size of found directory entry. */
94 long i_spare[11]; /* Spares to round up to 128 bytes. */
95 /*
96 * The on-disk dinode itself.
97 */
98 struct dinode i_din; /* 128 bytes of the on-disk dinode. */
99};
100
101#define i_atime i_din.di_atime
102#define i_blocks i_din.di_blocks
103#define i_ctime i_din.di_ctime
104#define i_db i_din.di_db
105#define i_flags i_din.di_flags
106#define i_gen i_din.di_gen
107#define i_gid i_din.di_gid
108#define i_ib i_din.di_ib
109#define i_mode i_din.di_mode
110#define i_mtime i_din.di_mtime
111#define i_nlink i_din.di_nlink
112#define i_rdev i_din.di_rdev
113#define i_shortlink i_din.di_shortlink
114#define i_size i_din.di_size
115#define i_uid i_din.di_uid
116
117/* These flags are kept in i_flag. */
118#define IN_ACCESS 0x0001 /* Access time update request. */
119#define IN_CHANGE 0x0002 /* Inode change time update request. */
120#define IN_EXLOCK 0x0004 /* File has exclusive lock. */
121#define IN_LOCKED 0x0008 /* Inode lock. */
122#define IN_LWAIT 0x0010 /* Process waiting on file lock. */
123#define IN_MODIFIED 0x0020 /* Inode has been modified. */
124#define IN_RENAME 0x0040 /* Inode is being renamed. */
125#define IN_SHLOCK 0x0080 /* File has shared lock. */
126#define IN_UPDATE 0x0100 /* Modification time update request. */
127#define IN_WANTED 0x0200 /* Inode is wanted by a process. */
128
129#ifdef KERNEL
130/*
131 * Structure used to pass around logical block paths generated by
132 * ufs_getlbns and used by truncate and bmap code.
133 */
134struct indir {
135 daddr_t in_lbn; /* Logical block number. */
136 int in_off; /* Offset in buffer. */
137 int in_exists; /* Flag if the block exists. */
138};
139
140/* Convert between inode pointers and vnode pointers. */
141#define VTOI(vp) ((struct inode *)(vp)->v_data)
142#define ITOV(ip) ((ip)->i_vnode)
143
144#define ITIMES(ip, t1, t2) { \
145 if ((ip)->i_flag & (IN_ACCESS | IN_CHANGE | IN_UPDATE)) { \
146 (ip)->i_flag |= IN_MODIFIED; \
147 if ((ip)->i_flag & IN_ACCESS) \
148 (ip)->i_atime.ts_sec = (t1)->tv_sec; \
149 if ((ip)->i_flag & IN_UPDATE) { \
150 (ip)->i_mtime.ts_sec = (t2)->tv_sec; \
151 (ip)->i_modrev++; \
152 } \
153 if ((ip)->i_flag & IN_CHANGE) \
154 (ip)->i_ctime.ts_sec = time.tv_sec; \
155 (ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \
156 } \
157}
158
159/* This overlays the fid structure (see mount.h). */
160struct ufid {
161 u_short ufid_len; /* Length of structure. */
162 u_short ufid_pad; /* Force long alignment. */
163 ino_t ufid_ino; /* File number (ino). */
164 long ufid_gen; /* Generation number. */
165};
166
167#endif
168#endif /* KERNEL */
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.4 (Berkeley) 1/21/94
39 * $Id: inode.h,v 1.2 1994/08/02 07:54:49 davidg Exp $
40 */
41
42#ifndef _UFS_UFS_INODE_H_
43#define _UFS_UFS_INODE_H_
44
45#include <ufs/ufs/dinode.h>
46
47/*
48 * Theoretically, directories can be more than 2Gb in length, however, in
49 * practice this seems unlikely. So, we define the type doff_t as a long
50 * to keep down the cost of doing lookup on a 32-bit machine. If you are
51 * porting to a 64-bit architecture, you should make doff_t the same as off_t.
52 */
53#define doff_t long
54
55/*
56 * The inode is used to describe each active (or recently active)
57 * file in the UFS filesystem. It is composed of two types of
58 * information. The first part is the information that is needed
59 * only while the file is active (such as the identity of the file
60 * and linkage to speed its lookup). The second part is the
61 * permannent meta-data associated with the file which is read
62 * in from the permanent dinode from long term storage when the
63 * file becomes active, and is put back when the file is no longer
64 * being used.
65 */
66struct inode {
67 struct inode *i_next; /* Hash chain forward. */
68 struct inode **i_prev; /* Hash chain back. */
69 struct vnode *i_vnode; /* Vnode associated with this inode. */
70 struct vnode *i_devvp; /* Vnode for block I/O. */
71 u_long i_flag; /* I* flags. */
72 dev_t i_dev; /* Device associated with the inode. */
73 ino_t i_number; /* The identity of the inode. */
74 union { /* Associated filesystem. */
75 struct fs *fs; /* FFS */
76 struct lfs *lfs; /* LFS */
77 } inode_u;
78#define i_fs inode_u.fs
79#define i_lfs inode_u.lfs
80 struct dquot *i_dquot[MAXQUOTAS]; /* Dquot structures. */
81 u_quad_t i_modrev; /* Revision level for lease. */
82 struct lockf *i_lockf; /* Head of byte-level lock list. */
83 pid_t i_lockholder; /* DEBUG: holder of inode lock. */
84 pid_t i_lockwaiter; /* DEBUG: latest blocked for inode lock. */
85 /*
86 * Side effects; used during directory lookup.
87 */
88 long i_count; /* Size of free slot in directory. */
89 doff_t i_endoff; /* End of useful stuff in directory. */
90 doff_t i_diroff; /* Offset in dir, where we found last entry. */
91 doff_t i_offset; /* Offset of free space in directory. */
92 ino_t i_ino; /* Inode number of found directory. */
93 u_long i_reclen; /* Size of found directory entry. */
94 long i_spare[11]; /* Spares to round up to 128 bytes. */
95 /*
96 * The on-disk dinode itself.
97 */
98 struct dinode i_din; /* 128 bytes of the on-disk dinode. */
99};
100
101#define i_atime i_din.di_atime
102#define i_blocks i_din.di_blocks
103#define i_ctime i_din.di_ctime
104#define i_db i_din.di_db
105#define i_flags i_din.di_flags
106#define i_gen i_din.di_gen
107#define i_gid i_din.di_gid
108#define i_ib i_din.di_ib
109#define i_mode i_din.di_mode
110#define i_mtime i_din.di_mtime
111#define i_nlink i_din.di_nlink
112#define i_rdev i_din.di_rdev
113#define i_shortlink i_din.di_shortlink
114#define i_size i_din.di_size
115#define i_uid i_din.di_uid
116
117/* These flags are kept in i_flag. */
118#define IN_ACCESS 0x0001 /* Access time update request. */
119#define IN_CHANGE 0x0002 /* Inode change time update request. */
120#define IN_EXLOCK 0x0004 /* File has exclusive lock. */
121#define IN_LOCKED 0x0008 /* Inode lock. */
122#define IN_LWAIT 0x0010 /* Process waiting on file lock. */
123#define IN_MODIFIED 0x0020 /* Inode has been modified. */
124#define IN_RENAME 0x0040 /* Inode is being renamed. */
125#define IN_SHLOCK 0x0080 /* File has shared lock. */
126#define IN_UPDATE 0x0100 /* Modification time update request. */
127#define IN_WANTED 0x0200 /* Inode is wanted by a process. */
128
129#ifdef KERNEL
130/*
131 * Structure used to pass around logical block paths generated by
132 * ufs_getlbns and used by truncate and bmap code.
133 */
134struct indir {
135 daddr_t in_lbn; /* Logical block number. */
136 int in_off; /* Offset in buffer. */
137 int in_exists; /* Flag if the block exists. */
138};
139
140/* Convert between inode pointers and vnode pointers. */
141#define VTOI(vp) ((struct inode *)(vp)->v_data)
142#define ITOV(ip) ((ip)->i_vnode)
143
144#define ITIMES(ip, t1, t2) { \
145 if ((ip)->i_flag & (IN_ACCESS | IN_CHANGE | IN_UPDATE)) { \
146 (ip)->i_flag |= IN_MODIFIED; \
147 if ((ip)->i_flag & IN_ACCESS) \
148 (ip)->i_atime.ts_sec = (t1)->tv_sec; \
149 if ((ip)->i_flag & IN_UPDATE) { \
150 (ip)->i_mtime.ts_sec = (t2)->tv_sec; \
151 (ip)->i_modrev++; \
152 } \
153 if ((ip)->i_flag & IN_CHANGE) \
154 (ip)->i_ctime.ts_sec = time.tv_sec; \
155 (ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \
156 } \
157}
158
159/* This overlays the fid structure (see mount.h). */
160struct ufid {
161 u_short ufid_len; /* Length of structure. */
162 u_short ufid_pad; /* Force long alignment. */
163 ino_t ufid_ino; /* File number (ino). */
164 long ufid_gen; /* Generation number. */
165};
166
167#endif
168#endif /* KERNEL */