xref: /netbsd/sys/ufs/ext2fs/ext2fs.h (revision c4a72b64)
1 /*	$NetBSD: ext2fs.h,v 1.11 2002/12/01 00:12:06 matt 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 #ifndef _UFS_EXT2FS_EXT2FS_H_
41 #define _UFS_EXT2FS_EXT2FS_H_
42 
43 #include <machine/bswap.h>
44 
45 /*
46  * Each disk drive contains some number of file systems.
47  * A file system consists of a number of cylinder groups.
48  * Each cylinder group has inodes and data.
49  *
50  * A file system is described by its super-block, which in turn
51  * describes the cylinder groups.  The super-block is critical
52  * data and is replicated in each cylinder group to protect against
53  * catastrophic loss.  This is done at `newfs' time and the critical
54  * super-block data does not change, so the copies need not be
55  * referenced further unless disaster strikes.
56  *
57  * The first boot and super blocks are given in absolute disk addresses.
58  * The byte-offset forms are preferred, as they don't imply a sector size.
59  */
60 #define BBSIZE		1024
61 #define SBSIZE		1024
62 #define	BBOFF		((off_t)(0))
63 #define	SBOFF		((off_t)(BBOFF + BBSIZE))
64 #define	BBLOCK		((ufs_daddr_t)(0))
65 #define	SBLOCK		((ufs_daddr_t)(BBLOCK + BBSIZE / DEV_BSIZE))
66 
67 /*
68  * Addresses stored in inodes are capable of addressing blocks
69  * XXX
70  */
71 
72 /*
73  * MINBSIZE is the smallest allowable block size.
74  * MINBSIZE must be big enough to hold a cylinder group block,
75  * thus changes to (struct cg) must keep its size within MINBSIZE.
76  * Note that super blocks are always of size SBSIZE,
77  * and that both SBSIZE and MAXBSIZE must be >= MINBSIZE.
78  */
79 #define LOG_MINBSIZE 10
80 #define MINBSIZE	(1 << LOG_MINBSIZE)
81 
82 /*
83  * The path name on which the file system is mounted is maintained
84  * in fs_fsmnt. MAXMNTLEN defines the amount of space allocated in
85  * the super block for this name.
86  */
87 #define MAXMNTLEN	512
88 
89 /*
90  * MINFREE gives the minimum acceptable percentage of file system
91  * blocks which may be free. If the freelist drops below this level
92  * only the superuser may continue to allocate blocks. This may
93  * be set to 0 if no reserve of free blocks is deemed necessary,
94  * however throughput drops by fifty percent if the file system
95  * is run at between 95% and 100% full; thus the minimum default
96  * value of fs_minfree is 5%. However, to get good clustering
97  * performance, 10% is a better choice. hence we use 10% as our
98  * default value. With 10% free space, fragmentation is not a
99  * problem, so we choose to optimize for time.
100  */
101 #define MINFREE		5
102 
103 /*
104  * Super block for an ext2fs file system.
105  */
106 struct ext2fs {
107 	u_int32_t  e2fs_icount;		/* Inode count */
108 	u_int32_t  e2fs_bcount;		/* blocks count */
109 	u_int32_t  e2fs_rbcount;	/* reserved blocks count */
110 	u_int32_t  e2fs_fbcount;	/* free blocks count */
111 	u_int32_t  e2fs_ficount;	/* free inodes count */
112 	u_int32_t  e2fs_first_dblock;	/* first data block */
113 	u_int32_t  e2fs_log_bsize;	/* block size = 1024*(2^e2fs_log_bsize) */
114 	u_int32_t  e2fs_fsize;		/* fragment size */
115 	u_int32_t  e2fs_bpg;		/* blocks per group */
116 	u_int32_t  e2fs_fpg;		/* frags per group */
117 	u_int32_t  e2fs_ipg;		/* inodes per group */
118 	u_int32_t  e2fs_mtime;		/* mount time */
119 	u_int32_t  e2fs_wtime;		/* write time */
120 	u_int16_t  e2fs_mnt_count;	/* mount count */
121 	u_int16_t  e2fs_max_mnt_count;	/* max mount count */
122 	u_int16_t  e2fs_magic;		/* magic number */
123 	u_int16_t  e2fs_state;		/* file system state */
124 	u_int16_t  e2fs_beh;		/* behavior on errors */
125 	u_int16_t  e2fs_minrev;		/* minor revision level */
126 	u_int32_t  e2fs_lastfsck;	/* time of last fsck */
127 	u_int32_t  e2fs_fsckintv;	/* max time between fscks */
128 	u_int32_t  e2fs_creator;	/* creator OS */
129 	u_int32_t  e2fs_rev;		/* revision level */
130 	u_int16_t  e2fs_ruid;		/* default uid for reserved blocks */
131 	u_int16_t  e2fs_rgid;		/* default gid for reserved blocks */
132 	/* EXT2_DYNAMIC_REV superblocks */
133 	u_int32_t  e2fs_first_ino;	/* first non-reserved inode */
134 	u_int16_t  e2fs_inode_size;	/* size of inode structure */
135 	u_int16_t  e2fs_block_group_nr;	/* block grp number of this sblk*/
136 	u_int32_t  e2fs_features_compat; /*  compatible feature set */
137 	u_int32_t  e2fs_features_incompat; /* incompatible feature set */
138 	u_int32_t  e2fs_features_rocompat; /* RO-compatible feature set */
139 	u_int8_t   e2fs_uuid[16];	/* 128-bit uuid for volume */
140 	char       e2fs_vname[16];	/* volume name */
141 	char       e2fs_fsmnt[64]; 	/* name mounted on */
142 	u_int32_t  e2fs_algo;		/* For compression */
143 	u_int8_t   e2fs_prealloc;	/* # of blocks to preallocate */
144 	u_int8_t   e2fs_dir_prealloc;	/* # of blocks to preallocate for dir */
145 	u_int16_t  pad1;
146 	u_int32_t  reserved2[204];
147 };
148 
149 
150 /* in-memory data for ext2fs */
151 struct m_ext2fs {
152 	struct ext2fs e2fs;
153 	u_char	e2fs_fsmnt[MAXMNTLEN];	/* name mounted on */
154 	int8_t	e2fs_ronly;	/* mounted read-only flag */
155 	int8_t	e2fs_fmod;	/* super block modified flag */
156 	int32_t	e2fs_bsize;	/* block size */
157 	int32_t e2fs_bshift;	/* ``lblkno'' calc of logical blkno */
158 	int32_t e2fs_bmask;	/* ``blkoff'' calc of blk offsets */
159 	int64_t e2fs_qbmask;	/* ~fs_bmask - for use with quad size */
160 	int32_t	e2fs_fsbtodb;	/* fsbtodb and dbtofsb shift constant */
161 	int32_t	e2fs_ncg;	/* number of cylinder groups */
162 	int32_t	e2fs_ngdb;	/* number of group descriptor block */
163 	int32_t	e2fs_ipb;	/* number of inodes per block */
164 	int32_t	e2fs_itpg;	/* number of inode table per group */
165 	struct	ext2_gd *e2fs_gd; /* group descripors */
166 };
167 
168 
169 
170 /*
171  * Filesystem identification
172  */
173 #define	E2FS_MAGIC	0xef53	/* the ext2fs magic number */
174 #define E2FS_REV0	0	/* revision levels */
175 #define E2FS_REV1	1	/* revision levels */
176 
177 /* compatible/imcompatible features */
178 #define EXT2F_COMPAT_PREALLOC		0x0001
179 
180 #define EXT2F_ROCOMPAT_SPARSESUPER	0x0001
181 #define EXT2F_ROCOMPAT_LARGEFILE	0x0002
182 #define EXT2F_ROCOMPAT_BTREE_DIR	0x0004
183 
184 #define EXT2F_INCOMPAT_COMP		0x0001
185 #define EXT2F_INCOMPAT_FTYPE		0x0002
186 
187 /* features supported in this implementation */
188 #define EXT2F_COMPAT_SUPP		0x0000
189 #define EXT2F_ROCOMPAT_SUPP		EXT2F_ROCOMPAT_SPARSESUPER
190 #define EXT2F_INCOMPAT_SUPP		EXT2F_INCOMPAT_FTYPE
191 
192 /*
193  * OS identification
194  */
195 #define E2FS_OS_LINUX 0
196 #define E2FS_OS_HURD  1
197 #define E2FS_OS_MASIX 2
198 
199 /*
200  * Filesystem clean flags
201  */
202 #define	E2FS_ISCLEAN	0x01
203 #define	E2FS_ERRORS	0x02
204 
205 /* ext2 file system block group descriptor */
206 
207 struct ext2_gd {
208 	u_int32_t ext2bgd_b_bitmap;	/* blocks bitmap block */
209 	u_int32_t ext2bgd_i_bitmap;	/* inodes bitmap block */
210 	u_int32_t ext2bgd_i_tables;	/* inodes table block  */
211 	u_int16_t ext2bgd_nbfree;	/* number of free blocks */
212 	u_int16_t ext2bgd_nifree;	/* number of free inodes */
213 	u_int16_t ext2bgd_ndirs;	/* number of directories */
214 	u_int16_t reserved;
215 	u_int32_t reserved2[3];
216 
217 };
218 
219 
220 /*
221  * If the EXT2F_ROCOMPAT_SPARSESUPER flag is set, the cylinder group has a
222  * copy of the super and cylinder group descriptors blocks only if it's
223  * a power of 3, 5 or 7
224  */
225 
226 static __inline__ int cg_has_sb __P((int)) __attribute__((__unused__));
227 static __inline int
228 cg_has_sb(i)
229 	int i;
230 {
231 	int a3 ,a5 , a7;
232 
233 	if (i == 0 || i == 1)
234 		return 1;
235 	for (a3 = 3, a5 = 5, a7 = 7;
236 	    a3 <= i || a5 <= i || a7 <= i;
237 	    a3 *= 3, a5 *= 5, a7 *= 7)
238 		if (i == a3 || i == a5 || i == a7)
239 			return 1;
240 	return 0;
241 }
242 
243 /* EXT2FS metadatas are stored in little-endian byte order. These macros
244  * helps reading theses metadatas
245  */
246 
247 #if BYTE_ORDER == LITTLE_ENDIAN
248 #	define h2fs16(x) (x)
249 #	define h2fs32(x) (x)
250 #	define fs2h16(x) (x)
251 #	define fs2h32(x) (x)
252 #	define e2fs_sbload(old, new) memcpy((new), (old), SBSIZE);
253 #	define e2fs_cgload(old, new, size) memcpy((new), (old), (size));
254 #	define e2fs_sbsave(old, new) memcpy((new), (old), SBSIZE);
255 #	define e2fs_cgsave(old, new, size) memcpy((new), (old), (size));
256 #else
257 void e2fs_sb_bswap __P((struct ext2fs *, struct ext2fs *));
258 void e2fs_cg_bswap __P((struct ext2_gd *, struct ext2_gd *, int));
259 #	define h2fs16(x) bswap16(x)
260 #	define h2fs32(x) bswap32(x)
261 #	define fs2h16(x) bswap16(x)
262 #	define fs2h32(x) bswap32(x)
263 #	define e2fs_sbload(old, new) e2fs_sb_bswap((old), (new))
264 #	define e2fs_cgload(old, new, size) e2fs_cg_bswap((old), (new), (size));
265 #	define e2fs_sbsave(old, new) e2fs_sb_bswap((old), (new))
266 #	define e2fs_cgsave(old, new, size) e2fs_cg_bswap((old), (new), (size));
267 #endif
268 
269 /*
270  * Turn file system block numbers into disk block addresses.
271  * This maps file system blocks to device size blocks.
272  */
273 #define fsbtodb(fs, b)	((b) << (fs)->e2fs_fsbtodb)
274 #define dbtofsb(fs, b)	((b) >> (fs)->e2fs_fsbtodb)
275 
276 /*
277  * Macros for handling inode numbers:
278  *	 inode number to file system block offset.
279  *	 inode number to cylinder group number.
280  *	 inode number to file system block address.
281  */
282 #define	ino_to_cg(fs, x)	(((x) - 1) / (fs)->e2fs.e2fs_ipg)
283 #define	ino_to_fsba(fs, x)						\
284 	((fs)->e2fs_gd[ino_to_cg(fs, x)].ext2bgd_i_tables + \
285 	(((x)-1) % (fs)->e2fs.e2fs_ipg)/(fs)->e2fs_ipb)
286 #define	ino_to_fsbo(fs, x)	(((x)-1) % (fs)->e2fs_ipb)
287 
288 /*
289  * Give cylinder group number for a file system block.
290  * Give cylinder group block number for a file system block.
291  */
292 #define	dtog(fs, d) (((d) - (fs)->e2fs.e2fs_first_dblock) / (fs)->e2fs.e2fs_fpg)
293 #define	dtogd(fs, d) \
294 	(((d) - (fs)->e2fs.e2fs_first_dblock) % (fs)->e2fs.e2fs_fpg)
295 
296 /*
297  * The following macros optimize certain frequently calculated
298  * quantities by using shifts and masks in place of divisions
299  * modulos and multiplications.
300  */
301 #define blkoff(fs, loc)		/* calculates (loc % fs->e2fs_bsize) */ \
302 	((loc) & (fs)->e2fs_qbmask)
303 #define lblktosize(fs, blk)	/* calculates (blk * fs->e2fs_bsize) */ \
304 	((blk) << (fs)->e2fs_bshift)
305 #define lblkno(fs, loc)		/* calculates (loc / fs->e2fs_bsize) */ \
306 	((loc) >> (fs)->e2fs_bshift)
307 #define blkroundup(fs, size)	/* calculates roundup(size, fs->e2fs_bsize) */ \
308 	(((size) + (fs)->e2fs_qbmask) & (fs)->e2fs_bmask)
309 #define fragroundup(fs, size)	/* calculates roundup(size, fs->e2fs_bsize) */ \
310 	(((size) + (fs)->e2fs_qbmask) & (fs)->e2fs_bmask)
311 /*
312  * Determine the number of available frags given a
313  * percentage to hold in reserve.
314  */
315 #define freespace(fs) \
316    ((fs)->e2fs.e2fs_fbcount - (fs)->e2fs.e2fs_rbcount)
317 
318 /*
319  * Number of indirects in a file system block.
320  */
321 #define	NINDIR(fs)	((fs)->e2fs_bsize / sizeof(u_int32_t))
322 
323 #endif /* !_UFS_EXT2FS_EXT2FS_H_ */
324