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