ext2fs.h revision 1.8.14.1 1 /* $NetBSD: ext2fs.h,v 1.8.14.1 1999/12/21 23:20:06 wrstuden Exp $ */
2
3 /*
4 * Copyright (c) 1997 Manuel Bouyer.
5 * Copyright (c) 1982, 1986, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 * @(#)fs.h 8.10 (Berkeley) 10/27/94
37 * Modified for ext2fs by Manuel Bouyer.
38 */
39
40 #include <machine/bswap.h>
41
42 /*
43 * Each disk drive contains some number of file systems.
44 * A file system consists of a number of cylinder groups.
45 * Each cylinder group has inodes and data.
46 *
47 * A file system is described by its super-block, which in turn
48 * describes the cylinder groups. The super-block is critical
49 * data and is replicated in each cylinder group to protect against
50 * catastrophic loss. This is done at `newfs' time and the critical
51 * super-block data does not change, so the copies need not be
52 * referenced further unless disaster strikes.
53 *
54 * The first boot and super blocks are given in absolute disk addresses.
55 * The byte-offset forms are preferred, as they don't imply a sector size.
56 */
57 #define BBSIZE 1024
58 #define SBSIZE 1024
59 #define BBOFF ((off_t)(0))
60 #define SBOFF ((off_t)(BBOFF + BBSIZE))
61 #define BBLOCK ((ufs_daddr_t)(0))
62 #if 0
63 #define SBLOCK ((ufs_daddr_t)(BBLOCK + BBSIZE / DEV_BSIZE))
64 #endif
65
66 /*
67 * Addresses stored in inodes are capable of addressing blocks
68 * XXX
69 */
70
71 /*
72 * MINBSIZE is the smallest allowable block size.
73 * MINBSIZE must be big enough to hold a cylinder group block,
74 * thus changes to (struct cg) must keep its size within MINBSIZE.
75 * Note that super blocks are always of size SBSIZE,
76 * and that both SBSIZE and MAXBSIZE must be >= MINBSIZE.
77 */
78 #define LOG_MINBSIZE 10
79 #define MINBSIZE (1 << LOG_MINBSIZE)
80
81 /*
82 * The path name on which the file system is mounted is maintained
83 * in fs_fsmnt. MAXMNTLEN defines the amount of space allocated in
84 * the super block for this name.
85 */
86 #define MAXMNTLEN 512
87
88 /*
89 * MINFREE gives the minimum acceptable percentage of file system
90 * blocks which may be free. If the freelist drops below this level
91 * only the superuser may continue to allocate blocks. This may
92 * be set to 0 if no reserve of free blocks is deemed necessary,
93 * however throughput drops by fifty percent if the file system
94 * is run at between 95% and 100% full; thus the minimum default
95 * value of fs_minfree is 5%. However, to get good clustering
96 * performance, 10% is a better choice. hence we use 10% as our
97 * default value. With 10% free space, fragmentation is not a
98 * problem, so we choose to optimize for time.
99 */
100 #define MINFREE 5
101
102 /*
103 * Super block for an ext2fs file system.
104 */
105 struct ext2fs {
106 u_int32_t e2fs_icount; /* Inode count */
107 u_int32_t e2fs_bcount; /* blocks count */
108 u_int32_t e2fs_rbcount; /* reserved blocks count */
109 u_int32_t e2fs_fbcount; /* free blocks count */
110 u_int32_t e2fs_ficount; /* free inodes count */
111 u_int32_t e2fs_first_dblock; /* first data block */
112 u_int32_t e2fs_log_bsize; /* block size = 1024*(2^e2fs_log_bsize) */
113 u_int32_t e2fs_fsize; /* fragment size */
114 u_int32_t e2fs_bpg; /* blocks per group */
115 u_int32_t e2fs_fpg; /* frags per group */
116 u_int32_t e2fs_ipg; /* inodes per group */
117 u_int32_t e2fs_mtime; /* mount time */
118 u_int32_t e2fs_wtime; /* write time */
119 u_int16_t e2fs_mnt_count; /* mount count */
120 u_int16_t e2fs_max_mnt_count; /* max mount count */
121 u_int16_t e2fs_magic; /* magic number */
122 u_int16_t e2fs_state; /* file system state */
123 u_int16_t e2fs_beh; /* behavior on errors */
124 u_int16_t reserved;
125 u_int32_t e2fs_lastfsck; /* time of last fsck */
126 u_int32_t e2fs_fsckintv; /* max time between fscks */
127 u_int32_t e2fs_creator; /* creator OS */
128 u_int32_t e2fs_rev; /* revision level */
129 u_int16_t e2fs_ruid; /* default uid for reserved blocks */
130 u_int16_t e2fs_rgid; /* default gid for reserved blocks */
131 /* EXT2_DYNAMIC_REV superblocks */
132 u_int32_t e2fs_first_ino; /* first non-reserved inode */
133 u_int16_t e2fs_inode_size; /* size of inode structure */
134 u_int16_t e2fs_block_group_nr; /* block grp number of this sblk*/
135 u_int32_t e2fs_features_compat; /* OK to mount if unknown */
136 u_int32_t e2fs_features_incompat; /* not OK to mount if unknown */
137 u_int32_t e2fs_features_compat_ro; /* OK to mount ro if unknown */
138 u_int32_t reserved2[230];
139 };
140
141
142 /* in-memory data for ext2fs */
143 struct m_ext2fs {
144 struct ext2fs e2fs;
145 u_char e2fs_fsmnt[MAXMNTLEN]; /* name mounted on */
146 int8_t e2fs_ronly; /* mounted read-only flag */
147 int8_t e2fs_fmod; /* super block modified flag */
148 int32_t e2fs_bsize; /* block size */
149 int32_t e2fs_bshift; /* ``lblkno'' calc of logical blkno */
150 int32_t e2fs_bmask; /* ``blkoff'' calc of blk offsets */
151 int64_t e2fs_qbmask; /* ~fs_bmask - for use with quad size */
152 int32_t e2fs_fsbtodb; /* fsbtodb and dbtofsb shift constant */
153 int32_t e2fs_ncg; /* number of cylinder groups */
154 int32_t e2fs_ngdb; /* number of group descriptor block */
155 int32_t e2fs_ipb; /* number of inodes per block */
156 int32_t e2fs_itpg; /* number of inode table per group */
157 struct ext2_gd *e2fs_gd; /* group descripors */
158 };
159
160
161
162 /*
163 * Filesystem identification
164 */
165 #define E2FS_MAGIC 0xef53 /* the ext2fs magic number */
166 #define E2FS_REV 0 /* revision level */
167
168 /*
169 * OS identification
170 */
171 #define E2FS_OS_LINUX 0
172 #define E2FS_OS_HURD 1
173 #define E2FS_OS_MASIX 2
174
175 /*
176 * Filesystem clean flags
177 */
178 #define E2FS_ISCLEAN 0x01
179 #define E2FS_ERRORS 0x02
180
181 /* ext2 file system block group descriptor */
182
183 struct ext2_gd {
184 u_int32_t ext2bgd_b_bitmap; /* blocks bitmap block */
185 u_int32_t ext2bgd_i_bitmap; /* inodes bitmap block */
186 u_int32_t ext2bgd_i_tables; /* inodes table block */
187 u_int16_t ext2bgd_nbfree; /* number of free blocks */
188 u_int16_t ext2bgd_nifree; /* number of free inodes */
189 u_int16_t ext2bgd_ndirs; /* number of directories */
190 u_int16_t reserved;
191 u_int32_t reserved2[3];
192
193 };
194
195 /* EXT2FS metadatas are stored in little-endian byte order. These macros
196 * helps reading theses metadatas
197 */
198
199 #if BYTE_ORDER == LITTLE_ENDIAN
200 # define h2fs16(x) (x)
201 # define h2fs32(x) (x)
202 # define fs2h16(x) (x)
203 # define fs2h32(x) (x)
204 # define e2fs_sbload(old, new) memcpy((new), (old), SBSIZE);
205 # define e2fs_cgload(old, new, size) memcpy((new), (old), (size));
206 # define e2fs_sbsave(old, new) memcpy((new), (old), SBSIZE);
207 # define e2fs_cgsave(old, new, size) memcpy((new), (old), (size));
208 #else
209 void e2fs_sb_bswap __P((struct ext2fs *, struct ext2fs *));
210 void e2fs_cg_bswap __P((struct ext2_gd *, struct ext2_gd *, int));
211 # define h2fs16(x) bswap16(x)
212 # define h2fs32(x) bswap32(x)
213 # define fs2h16(x) bswap16(x)
214 # define fs2h32(x) bswap32(x)
215 # define e2fs_sbload(old, new) e2fs_sb_bswap((old), (new))
216 # define e2fs_cgload(old, new, size) e2fs_cg_bswap((old), (new), (size));
217 # define e2fs_sbsave(old, new) e2fs_sb_bswap((old), (new))
218 # define e2fs_cgsave(old, new, size) e2fs_cg_bswap((old), (new), (size));
219 #endif
220
221 /*
222 * Turn file system block numbers into disk block addresses.
223 * This maps file system blocks to device size blocks.
224 */
225 #define fsbtodb(fs, b) ((b) << (fs)->e2fs_fsbtodb)
226 #define dbtofsb(fs, b) ((b) >> (fs)->e2fs_fsbtodb)
227
228 /*
229 * Macros for handling inode numbers:
230 * inode number to file system block offset.
231 * inode number to cylinder group number.
232 * inode number to file system block address.
233 */
234 #define ino_to_cg(fs, x) (((x) - 1) / (fs)->e2fs.e2fs_ipg)
235 #define ino_to_fsba(fs, x) \
236 ((fs)->e2fs_gd[ino_to_cg(fs, x)].ext2bgd_i_tables + \
237 (((x)-1) % (fs)->e2fs.e2fs_ipg)/(fs)->e2fs_ipb)
238 #define ino_to_fsbo(fs, x) (((x)-1) % (fs)->e2fs_ipb)
239
240 /*
241 * Give cylinder group number for a file system block.
242 * Give cylinder group block number for a file system block.
243 */
244 #define dtog(fs, d) (((d) - (fs)->e2fs.e2fs_first_dblock) / (fs)->e2fs.e2fs_fpg)
245 #define dtogd(fs, d) \
246 (((d) - (fs)->e2fs.e2fs_first_dblock) % (fs)->e2fs.e2fs_fpg)
247
248 /*
249 * The following macros optimize certain frequently calculated
250 * quantities by using shifts and masks in place of divisions
251 * modulos and multiplications.
252 */
253 #define blkoff(fs, loc) /* calculates (loc % fs->e2fs_bsize) */ \
254 ((loc) & (fs)->e2fs_qbmask)
255 #define lblktosize(fs, blk) /* calculates (blk * fs->e2fs_bsize) */ \
256 ((blk) << (fs)->e2fs_bshift)
257 #define lblkno(fs, loc) /* calculates (loc / fs->e2fs_bsize) */ \
258 ((loc) >> (fs)->e2fs_bshift)
259 #define blkroundup(fs, size) /* calculates roundup(size, fs->e2fs_bsize) */ \
260 (((size) + (fs)->e2fs_qbmask) & (fs)->e2fs_bmask)
261 #define fragroundup(fs, size) /* calculates roundup(size, fs->e2fs_bsize) */ \
262 (((size) + (fs)->e2fs_qbmask) & (fs)->e2fs_bmask)
263 /*
264 * Determine the number of available frags given a
265 * percentage to hold in reserve.
266 */
267 #define freespace(fs) \
268 ((fs)->e2fs.e2fs_fbcount - (fs)->e2fs.e2fs_rbcount)
269
270 /*
271 * Number of indirects in a file system block.
272 */
273 #define NINDIR(fs) ((fs)->e2fs_bsize / sizeof(u_int32_t))
274