Home | History | Annotate | Line # | Download | only in lfs
lfs.h revision 1.6
      1 /*	$NetBSD: lfs.h,v 1.6 1994/12/21 20:01:01 mycroft Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1991, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  *
     35  *	@(#)lfs.h	8.5 (Berkeley) 7/8/94
     36  */
     37 
     38 #define	LFS_LABELPAD	8192		/* LFS label size */
     39 #define	LFS_SBPAD	8192		/* LFS superblock size */
     40 
     41 /*
     42  * XXX
     43  * This is a kluge and NEEDS to go away.
     44  *
     45  * Right now, ufs code handles most of the calls for directory operations
     46  * such as create, mkdir, link, etc.  As a result VOP_UPDATE is being
     47  * called with waitfor set (since ffs does these things synchronously).
     48  * Since LFS does not want to do these synchronously, we treat the last
     49  * argument to lfs_update as a set of flags.  If LFS_SYNC is set, then
     50  * the update should be synchronous, if not, do it asynchronously.
     51  * Unfortunately, this means that LFS won't work with NFS yet because
     52  * NFS goes through paths that will make normal calls to ufs which will
     53  * call lfs with a last argument of 1.
     54  */
     55 #define	LFS_SYNC	0x02
     56 
     57 /* On-disk and in-memory checkpoint segment usage structure. */
     58 typedef struct segusage SEGUSE;
     59 struct segusage {
     60 	u_int32_t su_nbytes;		/* number of live bytes */
     61 	u_int32_t su_lastmod;		/* SEGUSE last modified timestamp */
     62 	u_int16_t su_nsums;		/* number of summaries in segment */
     63 	u_int16_t su_ninos;		/* number of inode blocks in seg */
     64 
     65 #define	SEGUSE_ACTIVE		0x01	/* segment is currently being written */
     66 #define	SEGUSE_DIRTY		0x02	/* segment has data in it */
     67 #define	SEGUSE_SUPERBLOCK	0x04	/* segment contains a superblock */
     68 	u_int32_t su_flags;
     69 };
     70 
     71 #define	SEGUPB(fs)	(1 << (fs)->lfs_sushift)
     72 #define	SEGTABSIZE_SU(fs)						\
     73 	(((fs)->lfs_nseg + SEGUPB(fs) - 1) >> (fs)->lfs_sushift)
     74 
     75 /* On-disk file information.  One per file with data blocks in the segment. */
     76 typedef struct finfo FINFO;
     77 struct finfo {
     78 	u_int32_t fi_nblocks;		/* number of blocks */
     79 	u_int32_t fi_version;		/* version number */
     80 	u_int32_t fi_ino;		/* inode number */
     81 	daddr_t	  fi_blocks[1];		/* array of logical block numbers */
     82 };
     83 
     84 /* On-disk and in-memory super block. */
     85 struct lfs {
     86 #define	LFS_MAGIC	0x070162
     87 	u_int32_t lfs_magic;		/* magic number */
     88 #define	LFS_VERSION	1
     89 	u_int32_t lfs_version;		/* version number */
     90 
     91 	u_int32_t lfs_size;		/* number of blocks in fs */
     92 	u_int32_t lfs_ssize;		/* number of blocks per segment */
     93 	u_int32_t lfs_dsize;		/* number of disk blocks in fs */
     94 	u_int32_t lfs_bsize;		/* file system block size */
     95 	u_int32_t lfs_fsize;		/* size of frag blocks in fs */
     96 	u_int32_t lfs_frag;		/* number of frags in a block in fs */
     97 
     98 /* Checkpoint region. */
     99 	ino_t	  lfs_free;		/* start of the free list */
    100 	u_int32_t lfs_bfree;		/* number of free disk blocks */
    101 	u_int32_t lfs_nfiles;		/* number of allocated inodes */
    102 	int32_t	  lfs_avail;		/* blocks available for writing */
    103 	u_int32_t lfs_uinodes;		/* inodes in cache not yet on disk */
    104 	daddr_t	  lfs_idaddr;		/* inode file disk address */
    105 	ino_t	  lfs_ifile;		/* inode file inode number */
    106 	daddr_t	  lfs_lastseg;		/* address of last segment written */
    107 	daddr_t	  lfs_nextseg;		/* address of next segment to write */
    108 	daddr_t	  lfs_curseg;		/* current segment being written */
    109 	daddr_t	  lfs_offset;		/* offset in curseg for next partial */
    110 	daddr_t	  lfs_lastpseg;		/* address of last partial written */
    111 	u_int32_t lfs_tstamp;		/* time stamp */
    112 
    113 /* These are configuration parameters. */
    114 	u_int32_t lfs_minfree;		/* minimum percentage of free blocks */
    115 
    116 /* These fields can be computed from the others. */
    117 	u_int64_t lfs_maxfilesize;	/* maximum representable file size */
    118 	u_int32_t lfs_dbpseg;		/* disk blocks per segment */
    119 	u_int32_t lfs_inopb;		/* inodes per block */
    120 	u_int32_t lfs_ifpb;		/* IFILE entries per block */
    121 	u_int32_t lfs_sepb;		/* SEGUSE entries per block */
    122 	u_int32_t lfs_nindir;		/* indirect pointers per block */
    123 	u_int32_t lfs_nseg;		/* number of segments */
    124 	u_int32_t lfs_nspf;		/* number of sectors per fragment */
    125 	u_int32_t lfs_cleansz;		/* cleaner info size in blocks */
    126 	u_int32_t lfs_segtabsz;		/* segment table size in blocks */
    127 
    128 	u_int32_t lfs_segmask;		/* calculate offset within a segment */
    129 	u_int32_t lfs_segshift;		/* fast mult/div for segments */
    130 	u_int32_t lfs_bmask;		/* calc block offset from file offset */
    131 	u_int32_t lfs_bshift;		/* calc block number from file offset */
    132 	u_int32_t lfs_ffmask;		/* calc frag offset from file offset */
    133 	u_int32_t lfs_ffshift;		/* fast mult/div for frag from file */
    134 	u_int32_t lfs_fbmask;		/* calc frag offset from block offset */
    135 	u_int32_t lfs_fbshift;		/* fast mult/div for frag from block */
    136 	u_int32_t lfs_fsbtodb;		/* fsbtodb and dbtofsb shift constant */
    137 	u_int32_t lfs_sushift;		/* fast mult/div for segusage table */
    138 
    139 	int32_t	  lfs_maxsymlinklen;	/* max length of an internal symlink */
    140 
    141 #define	LFS_MIN_SBINTERVAL	5	/* minimum superblock segment spacing */
    142 #define	LFS_MAXNUMSB		10	/* superblock disk offsets */
    143 	daddr_t	  lfs_sboffs[LFS_MAXNUMSB];
    144 
    145 /* Checksum -- last valid disk field. */
    146 	u_int32_t lfs_cksum;		/* checksum for superblock checking */
    147 
    148 /* These fields are set at mount time and are meaningless on disk. */
    149 	struct segment *lfs_sp;		/* current segment being written */
    150 	struct vnode *lfs_ivnode;	/* vnode for the ifile */
    151 	u_long	  lfs_seglock;		/* single-thread the segment writer */
    152 	pid_t	  lfs_lockpid;		/* pid of lock holder */
    153 	u_long	  lfs_iocount;		/* number of ios pending */
    154 	u_long	  lfs_writer;		/* don't allow any dirops to start */
    155 	u_long	  lfs_dirops;		/* count of active directory ops */
    156 	u_long	  lfs_doifile;		/* Write ifile blocks on next write */
    157 	u_long	  lfs_nactive;		/* Number of segments since last ckp */
    158 	int8_t	  lfs_fmod;		/* super block modified flag */
    159 	int8_t	  lfs_clean;		/* file system is clean flag */
    160 	int8_t	  lfs_ronly;		/* mounted read-only flag */
    161 	int8_t	  lfs_flags;		/* currently unused flag */
    162 	u_char	  lfs_fsmnt[MNAMELEN];	/* name mounted on */
    163 
    164 	int32_t	  lfs_pad[40];		/* round to 512 bytes */
    165 };
    166 
    167 /*
    168  * Inode 0:	out-of-band inode number
    169  * Inode 1:	IFILE inode number
    170  * Inode 2:	root inode
    171  * Inode 3:	lost+found inode number
    172  */
    173 #define	LFS_UNUSED_INUM	0		/* out of band inode number */
    174 #define	LFS_IFILE_INUM	1		/* IFILE inode number */
    175 #define	LOSTFOUNDINO	3		/* lost+found inode number */
    176 #define	LFS_FIRST_INUM	4		/* first free inode number */
    177 
    178 /* Address calculations for metadata located in the inode */
    179 #define	S_INDIR(fs)	-NDADDR
    180 #define	D_INDIR(fs)	(S_INDIR(fs) - NINDIR(fs) - 1)
    181 #define	T_INDIR(fs)	(D_INDIR(fs) - NINDIR(fs) * NINDIR(fs) - 1)
    182 
    183 /* Unassigned disk address. */
    184 #define	UNASSIGNED	-1
    185 
    186 /* Unused logical block number */
    187 #define LFS_UNUSED_LBN	-1
    188 
    189 typedef struct ifile IFILE;
    190 struct ifile {
    191 	u_int32_t if_version;		/* inode version number */
    192 #define	LFS_UNUSED_DADDR	0	/* out-of-band daddr */
    193 	daddr_t	  if_daddr;		/* inode disk address */
    194 	ino_t	  if_nextfree;		/* next-unallocated inode */
    195 };
    196 
    197 /*
    198  * Cleaner information structure.  This resides in the ifile and is used
    199  * to pass information between the cleaner and the kernel.
    200  */
    201 typedef struct _cleanerinfo {
    202 	u_int32_t clean;		/* K: number of clean segments */
    203 	u_int32_t dirty;		/* K: number of dirty segments */
    204 } CLEANERINFO;
    205 
    206 #define	CLEANSIZE_SU(fs)						\
    207 	((sizeof(CLEANERINFO) + (fs)->lfs_bsize - 1) >> (fs)->lfs_bshift)
    208 
    209 /*
    210  * All summary blocks are the same size, so we can always read a summary
    211  * block easily from a segment.
    212  */
    213 #define	LFS_SUMMARY_SIZE	512
    214 
    215 /* On-disk segment summary information */
    216 typedef struct segsum SEGSUM;
    217 struct segsum {
    218 	u_int32_t ss_sumsum;		/* check sum of summary block */
    219 	u_int32_t ss_datasum;		/* check sum of data */
    220 	daddr_t	  ss_next;		/* next segment */
    221 	u_int32_t ss_create;		/* creation time stamp */
    222 	u_int16_t ss_nfinfo;		/* number of file info structures */
    223 	u_int16_t ss_ninos;		/* number of inodes in summary */
    224 
    225 #define	SS_DIROP	0x01		/* segment begins a dirop */
    226 #define	SS_CONT		0x02		/* more partials to finish this write*/
    227 	u_int16_t ss_flags;		/* used for directory operations */
    228 	u_int16_t ss_pad;		/* extra space */
    229 	/* FINFO's and inode daddr's... */
    230 };
    231 
    232 /* NINDIR is the number of indirects in a file system block. */
    233 #define	NINDIR(fs)	((fs)->lfs_nindir)
    234 
    235 /* INOPB is the number of inodes in a secondary storage block. */
    236 #define	INOPB(fs)	((fs)->lfs_inopb)
    237 
    238 #define	blksize(fs)		((fs)->lfs_bsize)
    239 #define	blkoff(fs, loc)		((loc) & (fs)->lfs_bmask)
    240 #define	fsbtodb(fs, b)		((b) << (fs)->lfs_fsbtodb)
    241 #define	dbtofsb(fs, b)		((b) >> (fs)->lfs_fsbtodb)
    242 #define	lblkno(fs, loc)		((loc) >> (fs)->lfs_bshift)
    243 #define	lblktosize(fs, blk)	((blk) << (fs)->lfs_bshift)
    244 #define numfrags(fs, loc)	/* calculates (loc / fs->fs_fsize) */	\
    245 	((loc) >> (fs)->lfs_bshift)
    246 
    247 #define	datosn(fs, daddr)	/* disk address to segment number */	\
    248 	(((daddr) - (fs)->lfs_sboffs[0]) / fsbtodb((fs), (fs)->lfs_ssize))
    249 #define sntoda(fs, sn) 		/* segment number to disk address */	\
    250 	((daddr_t)((sn) * ((fs)->lfs_ssize << (fs)->lfs_fsbtodb) +	\
    251 	    (fs)->lfs_sboffs[0]))
    252 
    253 /* Read in the block with the cleaner info from the ifile. */
    254 #define LFS_CLEANERINFO(CP, F, BP) {					\
    255 	VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS;			\
    256 	if (bread((F)->lfs_ivnode,					\
    257 	    (daddr_t)0, (F)->lfs_bsize, NOCRED, &(BP)))			\
    258 		panic("lfs: ifile read");				\
    259 	(CP) = (CLEANERINFO *)(BP)->b_data;				\
    260 }
    261 
    262 /* Read in the block with a specific inode from the ifile. */
    263 #define	LFS_IENTRY(IP, F, IN, BP) {					\
    264 	int _e;								\
    265 	VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS;			\
    266 	if (_e = bread((F)->lfs_ivnode,					\
    267 	    (IN) / (F)->lfs_ifpb + (F)->lfs_cleansz + (F)->lfs_segtabsz,\
    268 	    (F)->lfs_bsize, NOCRED, &(BP)))				\
    269 		panic("lfs: ifile read %d", _e);			\
    270 	(IP) = (IFILE *)(BP)->b_data + (IN) % (F)->lfs_ifpb;		\
    271 }
    272 
    273 /* Read in the block with a specific segment usage entry from the ifile. */
    274 #define	LFS_SEGENTRY(SP, F, IN, BP) {					\
    275 	int _e;								\
    276 	VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS;			\
    277 	if (_e = bread((F)->lfs_ivnode,					\
    278 	    ((IN) >> (F)->lfs_sushift) + (F)->lfs_cleansz,		\
    279 	    (F)->lfs_bsize, NOCRED, &(BP)))				\
    280 		panic("lfs: ifile read: %d", _e);			\
    281 	(SP) = (SEGUSE *)(BP)->b_data + ((IN) & (F)->lfs_sepb - 1);	\
    282 }
    283 
    284 /*
    285  * Determine if there is enough room currently available to write db
    286  * disk blocks.  We need enough blocks for the new blocks, the current,
    287  * inode blocks, a summary block, plus potentially the ifile inode and
    288  * the segment usage table, plus an ifile page.
    289  */
    290 #define LFS_FITS(fs, db)						\
    291 	((int32_t)((db + ((fs)->lfs_uinodes + INOPB((fs))) / 		\
    292 	INOPB((fs)) + fsbtodb(fs, 1) + LFS_SUMMARY_SIZE / DEV_BSIZE +	\
    293 	(fs)->lfs_segtabsz)) < (fs)->lfs_avail)
    294 
    295 /* Determine if a buffer belongs to the ifile */
    296 #define IS_IFILE(bp)	(VTOI(bp->b_vp)->i_number == LFS_IFILE_INUM)
    297 
    298 /*
    299  * Structures used by lfs_bmapv and lfs_markv to communicate information
    300  * about inodes and data blocks.
    301  */
    302 typedef struct block_info {
    303 	ino_t	bi_inode;		/* inode # */
    304 	daddr_t	bi_lbn;			/* logical block w/in file */
    305 	daddr_t	bi_daddr;		/* disk address of block */
    306 	time_t	bi_segcreate;		/* origin segment create time */
    307 	int	bi_version;		/* file version number */
    308 	void	*bi_bp;			/* data buffer */
    309 } BLOCK_INFO;
    310 
    311 /* In-memory description of a segment about to be written. */
    312 struct segment {
    313 	struct lfs	 *fs;		/* file system pointer */
    314 	struct buf	**bpp;		/* pointer to buffer array */
    315 	struct buf	**cbpp;		/* pointer to next available bp */
    316 	struct buf	**start_bpp;	/* pointer to first bp in this set */
    317 	struct buf	 *ibp;		/* buffer pointer to inode page */
    318 	struct finfo	 *fip;		/* current fileinfo pointer */
    319 	struct vnode	 *vp;		/* vnode being gathered */
    320 	void	 *segsum;		/* segment summary info */
    321 	u_int32_t ninodes;		/* number of inodes in this segment */
    322 	u_int32_t seg_bytes_left;	/* bytes left in segment */
    323 	u_int32_t sum_bytes_left;	/* bytes left in summary block */
    324 	u_int32_t seg_number;		/* number of this segment */
    325 	daddr_t  *start_lbp;		/* beginning lbn for this set */
    326 
    327 #define	SEGM_CKP	0x01		/* doing a checkpoint */
    328 #define	SEGM_CLEAN	0x02		/* cleaner call; don't sort */
    329 #define	SEGM_SYNC	0x04		/* wait for segment */
    330 	u_int16_t seg_flags;		/* run-time flags for this segment */
    331 };
    332 
    333 #define ISSPACE(F, BB, C)						\
    334 	(((C)->cr_uid == 0 && (F)->lfs_bfree >= (BB)) ||		\
    335 	((C)->cr_uid != 0 && IS_FREESPACE(F, BB)))
    336 
    337 #define IS_FREESPACE(F, BB)						\
    338 	((F)->lfs_bfree > ((F)->lfs_dsize * (F)->lfs_minfree / 100 + (BB)))
    339 
    340 #define ISSPACE_XXX(F, BB)						\
    341 	((F)->lfs_bfree >= (BB))
    342 
    343 #define DOSTATS
    344 #ifdef DOSTATS
    345 /* Statistics Counters */
    346 struct lfs_stats {
    347 	u_int	segsused;
    348 	u_int	psegwrites;
    349 	u_int	psyncwrites;
    350 	u_int	pcleanwrites;
    351 	u_int	blocktot;
    352 	u_int	cleanblocks;
    353 	u_int	ncheckpoints;
    354 	u_int	nwrites;
    355 	u_int	nsync_writes;
    356 	u_int	wait_exceeded;
    357 	u_int	write_exceeded;
    358 	u_int	flush_invoked;
    359 };
    360 extern struct lfs_stats lfs_stats;
    361 #endif
    362