lfs.h revision 1.23
1 /* $NetBSD: lfs.h,v 1.23 2000/05/27 00:19:52 perseant Exp $ */ 2 3 /*- 4 * Copyright (c) 1999 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Konrad E. Schroder <perseant (at) hhhh.org>. 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 NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 /*- 39 * Copyright (c) 1991, 1993 40 * The Regents of the University of California. All rights reserved. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. All advertising materials mentioning features or use of this software 51 * must display the following acknowledgement: 52 * This product includes software developed by the University of 53 * California, Berkeley and its contributors. 54 * 4. Neither the name of the University nor the names of its contributors 55 * may be used to endorse or promote products derived from this software 56 * without specific prior written permission. 57 * 58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 68 * SUCH DAMAGE. 69 * 70 * @(#)lfs.h 8.9 (Berkeley) 5/8/95 71 */ 72 73 /* 74 * Compile-time options for LFS. 75 */ 76 #define LFS_EAGAIN_FAIL /* markv fail with EAGAIN if ino is locked */ 77 #define LFS_TRACK_IOS /* attempt to avoid cleaning segments not yet fully written to disk */ 78 #define LFS_CANNOT_ROLLFW /* No roll-forward agent exists */ 79 80 /* #define DEBUG_LFS */ /* Intensive debugging of LFS subsystem */ 81 82 /* #define LFS_ATIME_IFILE */ /* Store atime in Ifile, don't push */ 83 84 /* 85 * Parameters and generic definitions 86 */ 87 #define BW_CLEAN 1 88 #define MIN_FREE_SEGS 4 89 #define LFS_MAX_ACTIVE 10 90 #define LFS_MAXDIROP (desiredvnodes>>2) 91 92 #ifndef LFS_ATIME_IFILE 93 # define LFS_ITIMES(ip, acc, mod, cre) FFS_ITIMES((ip),(acc),(mod),(cre)) 94 #else 95 # define LFS_ITIMES(ip, acc, mod, cre) { \ 96 struct buf *ibp; \ 97 IFILE *ifp; \ 98 \ 99 if ((ip)->i_flag & IN_ACCESS) { \ 100 LFS_IENTRY(ifp, ip->i_lfs, ip->i_number, ibp); \ 101 ifp->if_atime = (mod); \ 102 VOP_BWRITE(bp); \ 103 (ip)->i_flag &= ~IN_ACCESS; \ 104 } \ 105 if ((ip)->i_flag & (IN_CHANGE | IN_UPDATE)) { \ 106 (ip)->i_flag |= IN_MODIFIED; \ 107 if ((ip)->i_flag & IN_UPDATE) { \ 108 (ip)->i_ffs_mtime = (mod)->tv_sec; \ 109 (ip)->i_ffs_mtimensec = (mod)->tv_nsec; \ 110 (ip)->i_modrev++; \ 111 } \ 112 if ((ip)->i_flag & IN_CHANGE) { \ 113 (ip)->i_ffs_ctime = (cre)->tv_sec; \ 114 (ip)->i_ffs_ctimensec = (cre)->tv_nsec; \ 115 } \ 116 (ip)->i_flag &= ~(IN_CHANGE | IN_UPDATE); \ 117 } \ 118 } 119 #endif 120 121 #define WRITEINPROG(vp) (vp->v_dirtyblkhd.lh_first && !(VTOI(vp)->i_flag & (IN_MODIFIED|IN_CLEANING))) 122 123 /* Here begins the berkeley code */ 124 125 #define LFS_LABELPAD 8192 /* LFS label size */ 126 #define LFS_SBPAD 8192 /* LFS superblock size */ 127 128 /* On-disk and in-memory checkpoint segment usage structure. */ 129 typedef struct segusage SEGUSE; 130 struct segusage { 131 u_int32_t su_nbytes; /* number of live bytes */ 132 u_int32_t su_lastmod; /* SEGUSE last modified timestamp */ 133 u_int16_t su_nsums; /* number of summaries in segment */ 134 u_int16_t su_ninos; /* number of inode blocks in seg */ 135 136 #define SEGUSE_ACTIVE 0x01 /* segment is currently being written */ 137 #define SEGUSE_DIRTY 0x02 /* segment has data in it */ 138 #define SEGUSE_SUPERBLOCK 0x04 /* segment contains a superblock */ 139 u_int32_t su_flags; 140 }; 141 142 #define SEGUPB(fs) (1 << (fs)->lfs_sushift) 143 #define SEGTABSIZE_SU(fs) \ 144 (((fs)->lfs_nseg + SEGUPB(fs) - 1) >> (fs)->lfs_sushift) 145 146 /* On-disk file information. One per file with data blocks in the segment. */ 147 typedef struct finfo FINFO; 148 struct finfo { 149 u_int32_t fi_nblocks; /* number of blocks */ 150 u_int32_t fi_version; /* version number */ 151 u_int32_t fi_ino; /* inode number */ 152 u_int32_t fi_lastlength; /* length of last block in array */ 153 ufs_daddr_t fi_blocks[1]; /* array of logical block numbers */ 154 }; 155 156 /* On-disk super block. */ 157 struct dlfs { 158 #define LFS_MAGIC 0x070162 159 u_int32_t dlfs_magic; /* 0: magic number */ 160 #define LFS_VERSION 1 161 u_int32_t dlfs_version; /* 4: version number */ 162 163 u_int32_t dlfs_size; /* 8: number of blocks in fs */ 164 u_int32_t dlfs_ssize; /* 12: number of blocks per segment */ 165 u_int32_t dlfs_dsize; /* 16: number of disk blocks in fs */ 166 u_int32_t dlfs_bsize; /* 20: file system block size */ 167 u_int32_t dlfs_fsize; /* 24: size of frag blocks in fs */ 168 u_int32_t dlfs_frag; /* 28: number of frags in a block in fs */ 169 170 /* Checkpoint region. */ 171 u_int32_t dlfs_free; /* 32: start of the free list */ 172 u_int32_t dlfs_bfree; /* 36: number of free disk blocks */ 173 u_int32_t dlfs_nfiles; /* 40: number of allocated inodes */ 174 int32_t dlfs_avail; /* 44: blocks available for writing */ 175 u_int32_t dlfs_uinodes; /* 48: inodes in cache not yet on disk */ 176 ufs_daddr_t dlfs_idaddr; /* 52: inode file disk address */ 177 u_int32_t dlfs_ifile; /* 56: inode file inode number */ 178 ufs_daddr_t dlfs_lastseg; /* 60: address of last segment written */ 179 ufs_daddr_t dlfs_nextseg; /* 64: address of next segment to write */ 180 ufs_daddr_t dlfs_curseg; /* 68: current segment being written */ 181 ufs_daddr_t dlfs_offset; /* 72: offset in curseg for next partial */ 182 ufs_daddr_t dlfs_lastpseg; /* 76: address of last partial written */ 183 u_int32_t dlfs_tstamp; /* 80: time stamp */ 184 185 /* These are configuration parameters. */ 186 u_int32_t dlfs_minfree; /* 84: minimum percentage of free blocks */ 187 188 /* These fields can be computed from the others. */ 189 u_int64_t dlfs_maxfilesize; /* 88: maximum representable file size */ 190 u_int32_t dlfs_dbpseg; /* 96: disk blocks per segment */ 191 u_int32_t dlfs_inopb; /* 100: inodes per block */ 192 u_int32_t dlfs_ifpb; /* 104: IFILE entries per block */ 193 u_int32_t dlfs_sepb; /* 108: SEGUSE entries per block */ 194 u_int32_t dlfs_nindir; /* 112: indirect pointers per block */ 195 u_int32_t dlfs_nseg; /* 116: number of segments */ 196 u_int32_t dlfs_nspf; /* 120: number of sectors per fragment */ 197 u_int32_t dlfs_cleansz; /* 124: cleaner info size in blocks */ 198 u_int32_t dlfs_segtabsz; /* 128: segment table size in blocks */ 199 u_int32_t dlfs_segmask; /* 132: calculate offset within a segment */ 200 u_int32_t dlfs_segshift; /* 136: fast mult/div for segments */ 201 u_int32_t dlfs_bshift; /* 140: calc block number from file offset */ 202 u_int32_t dlfs_ffshift; /* 144: fast mult/div for frag from file */ 203 u_int32_t dlfs_fbshift; /* 148: fast mult/div for frag from block */ 204 u_int64_t dlfs_bmask; /* 152: calc block offset from file offset */ 205 u_int64_t dlfs_ffmask; /* 160: calc frag offset from file offset */ 206 u_int64_t dlfs_fbmask; /* 168: calc frag offset from block offset */ 207 u_int32_t dlfs_fsbtodb; /* 176: fsbtodb and dbtofsb shift constant */ 208 u_int32_t dlfs_sushift; /* 180: fast mult/div for segusage table */ 209 210 int32_t dlfs_maxsymlinklen; /* 184: max length of an internal symlink */ 211 212 #define LFS_MIN_SBINTERVAL 5 /* minimum superblock segment spacing */ 213 #define LFS_MAXNUMSB 10 /* 188: superblock disk offsets */ 214 ufs_daddr_t dlfs_sboffs[LFS_MAXNUMSB]; 215 216 u_int32_t dlfs_nclean; /* 228: Number of clean segments */ 217 u_char dlfs_fsmnt[MNAMELEN]; /* 232: name mounted on */ 218 /* XXX this is 2 bytes only to pad to a quad boundary */ 219 u_int16_t dlfs_clean; /* 322: file system is clean flag */ 220 int8_t dlfs_pad[184]; /* 324: round to 512 bytes */ 221 /* Checksum -- last valid disk field. */ 222 u_int32_t dlfs_cksum; /* 328: checksum for superblock checking */ 223 }; 224 225 /* Maximum number of io's we can have pending at once */ 226 #define LFS_THROTTLE 16 /* XXX should be better paramtrized - ? */ 227 228 /* In-memory super block. */ 229 struct lfs { 230 struct dlfs lfs_dlfs; /* on-disk parameters */ 231 #define lfs_magic lfs_dlfs.dlfs_magic 232 #define lfs_version lfs_dlfs.dlfs_version 233 #define lfs_size lfs_dlfs.dlfs_size 234 #define lfs_ssize lfs_dlfs.dlfs_ssize 235 #define lfs_dsize lfs_dlfs.dlfs_dsize 236 #define lfs_bsize lfs_dlfs.dlfs_bsize 237 #define lfs_fsize lfs_dlfs.dlfs_fsize 238 #define lfs_frag lfs_dlfs.dlfs_frag 239 #define lfs_free lfs_dlfs.dlfs_free 240 #define lfs_bfree lfs_dlfs.dlfs_bfree 241 #define lfs_nfiles lfs_dlfs.dlfs_nfiles 242 #define lfs_avail lfs_dlfs.dlfs_avail 243 #define lfs_uinodes lfs_dlfs.dlfs_uinodes 244 #define lfs_idaddr lfs_dlfs.dlfs_idaddr 245 #define lfs_ifile lfs_dlfs.dlfs_ifile 246 #define lfs_lastseg lfs_dlfs.dlfs_lastseg 247 #define lfs_nextseg lfs_dlfs.dlfs_nextseg 248 #define lfs_curseg lfs_dlfs.dlfs_curseg 249 #define lfs_offset lfs_dlfs.dlfs_offset 250 #define lfs_lastpseg lfs_dlfs.dlfs_lastpseg 251 #define lfs_tstamp lfs_dlfs.dlfs_tstamp 252 #define lfs_minfree lfs_dlfs.dlfs_minfree 253 #define lfs_maxfilesize lfs_dlfs.dlfs_maxfilesize 254 #define lfs_dbpseg lfs_dlfs.dlfs_dbpseg 255 #define lfs_inopb lfs_dlfs.dlfs_inopb 256 #define lfs_ifpb lfs_dlfs.dlfs_ifpb 257 #define lfs_sepb lfs_dlfs.dlfs_sepb 258 #define lfs_nindir lfs_dlfs.dlfs_nindir 259 #define lfs_nseg lfs_dlfs.dlfs_nseg 260 #define lfs_nspf lfs_dlfs.dlfs_nspf 261 #define lfs_cleansz lfs_dlfs.dlfs_cleansz 262 #define lfs_segtabsz lfs_dlfs.dlfs_segtabsz 263 #define lfs_segmask lfs_dlfs.dlfs_segmask 264 #define lfs_segshift lfs_dlfs.dlfs_segshift 265 #define lfs_bmask lfs_dlfs.dlfs_bmask 266 #define lfs_bshift lfs_dlfs.dlfs_bshift 267 #define lfs_ffmask lfs_dlfs.dlfs_ffmask 268 #define lfs_ffshift lfs_dlfs.dlfs_ffshift 269 #define lfs_fbmask lfs_dlfs.dlfs_fbmask 270 #define lfs_fbshift lfs_dlfs.dlfs_fbshift 271 #define lfs_fsbtodb lfs_dlfs.dlfs_fsbtodb 272 #define lfs_sushift lfs_dlfs.dlfs_sushift 273 #define lfs_maxsymlinklen lfs_dlfs.dlfs_maxsymlinklen 274 #define lfs_sboffs lfs_dlfs.dlfs_sboffs 275 #define lfs_cksum lfs_dlfs.dlfs_cksum 276 #define lfs_clean lfs_dlfs.dlfs_clean 277 #define lfs_fsmnt lfs_dlfs.dlfs_fsmnt 278 #define lfs_nclean lfs_dlfs.dlfs_nclean 279 /* These fields are set at mount time and are meaningless on disk. */ 280 struct segment *lfs_sp; /* current segment being written */ 281 struct vnode *lfs_ivnode; /* vnode for the ifile */ 282 u_int32_t lfs_seglock; /* single-thread the segment writer */ 283 pid_t lfs_lockpid; /* pid of lock holder */ 284 u_int32_t lfs_iocount; /* number of ios pending */ 285 u_int32_t lfs_writer; /* don't allow any dirops to start */ 286 u_int32_t lfs_dirops; /* count of active directory ops */ 287 u_int32_t lfs_doifile; /* Write ifile blocks on next write */ 288 u_int32_t lfs_nactive; /* Number of segments since last ckp */ 289 int8_t lfs_fmod; /* super block modified flag */ 290 int8_t lfs_ronly; /* mounted read-only flag */ 291 int8_t lfs_flags; /* currently unused flag */ 292 u_int16_t lfs_activesb; /* toggle between superblocks */ 293 #ifdef LFS_TRACK_IOS 294 daddr_t lfs_pending[LFS_THROTTLE]; /* daddrs of pending writes */ 295 #endif /* LFS_TRACK_IOS */ 296 #ifdef LFS_CANNOT_ROLLFW 297 daddr_t lfs_sbactive; /* disk address of in-progress sb write */ 298 #endif 299 struct vnode *lfs_flushvp; /* vnode being flushed */ 300 struct vnode *lfs_unlockvp; /* being inactivated in lfs_segunlock */ 301 u_int32_t lfs_diropwait; /* # procs waiting on dirop flush */ 302 struct lock lfs_freelock; 303 int lfs_nadirop; /* number of active dirop nodes */ 304 }; 305 306 /* 307 * Inode 0: out-of-band inode number 308 * Inode 1: IFILE inode number 309 * Inode 2: root inode 310 * Inode 3: lost+found inode number 311 */ 312 #define LFS_UNUSED_INUM 0 /* out of band inode number */ 313 #define LFS_IFILE_INUM 1 /* IFILE inode number */ 314 #define LOSTFOUNDINO 3 /* lost+found inode number */ 315 #define LFS_FIRST_INUM 4 /* first free inode number */ 316 317 /* Address calculations for metadata located in the inode */ 318 #define S_INDIR(fs) -NDADDR 319 #define D_INDIR(fs) (S_INDIR(fs) - NINDIR(fs) - 1) 320 #define T_INDIR(fs) (D_INDIR(fs) - NINDIR(fs) * NINDIR(fs) - 1) 321 322 /* Unassigned disk addresses. */ 323 #define UNASSIGNED -1 324 #define UNWRITTEN -2 325 326 /* Unused logical block number */ 327 #define LFS_UNUSED_LBN -1 328 329 typedef struct ifile IFILE; 330 struct ifile { 331 u_int32_t if_version; /* inode version number */ 332 #define LFS_UNUSED_DADDR 0 /* out-of-band daddr */ 333 ufs_daddr_t if_daddr; /* inode disk address */ 334 ino_t if_nextfree; /* next-unallocated inode */ 335 #ifdef LFS_ATIME_IFILE 336 struct timespec if_atime; /* Last access time */ 337 #endif 338 }; 339 340 /* 341 * Cleaner information structure. This resides in the ifile and is used 342 * to pass information between the cleaner and the kernel. 343 */ 344 typedef struct _cleanerinfo { 345 u_int32_t clean; /* K: number of clean segments */ 346 u_int32_t dirty; /* K: number of dirty segments */ 347 } CLEANERINFO; 348 349 #define CLEANSIZE_SU(fs) \ 350 ((sizeof(CLEANERINFO) + (fs)->lfs_bsize - 1) >> (fs)->lfs_bshift) 351 352 /* 353 * All summary blocks are the same size, so we can always read a summary 354 * block easily from a segment. 355 */ 356 #define LFS_SUMMARY_SIZE 512 357 358 /* On-disk segment summary information */ 359 typedef struct segsum SEGSUM; 360 struct segsum { 361 u_int32_t ss_sumsum; /* check sum of summary block */ 362 u_int32_t ss_datasum; /* check sum of data */ 363 u_int32_t ss_magic; /* segment summary magic number */ 364 #define SS_MAGIC 0x061561 365 ufs_daddr_t ss_next; /* next segment */ 366 u_int32_t ss_create; /* creation time stamp */ 367 u_int16_t ss_nfinfo; /* number of file info structures */ 368 u_int16_t ss_ninos; /* number of inodes in summary */ 369 370 #define SS_DIROP 0x01 /* segment begins a dirop */ 371 #define SS_CONT 0x02 /* more partials to finish this write*/ 372 u_int16_t ss_flags; /* used for directory operations */ 373 u_int16_t ss_pad; /* extra space */ 374 /* FINFO's and inode daddr's... */ 375 }; 376 377 /* NINDIR is the number of indirects in a file system block. */ 378 #define NINDIR(fs) ((fs)->lfs_nindir) 379 380 /* INOPB is the number of inodes in a secondary storage block. */ 381 #define INOPB(fs) ((fs)->lfs_inopb) 382 383 #define blksize(fs, ip, lbn) \ 384 (((lbn) >= NDADDR || (ip)->i_ffs_size >= ((lbn) + 1) << (fs)->lfs_bshift) \ 385 ? (fs)->lfs_bsize \ 386 : (fragroundup(fs, blkoff(fs, (ip)->i_ffs_size)))) 387 #define blkoff(fs, loc) ((int)(loc) & (fs)->lfs_bmask) 388 #define fragoff(fs, loc) /* calculates (loc % fs->lfs_fsize) */ \ 389 ((int)((loc) & (fs)->lfs_ffmask)) 390 #define fsbtodb(fs, b) ((b) << (fs)->lfs_fsbtodb) 391 #define dbtofsb(fs, b) ((b) >> (fs)->lfs_fsbtodb) 392 #define fragstodb(fs, b) ((b) << ((fs)->lfs_fsbtodb - (fs)->lfs_fbshift)) 393 #define dbtofrags(fs, b) ((b) >> ((fs)->lfs_fsbtodb - (fs)->lfs_fbshift)) 394 #define lblkno(fs, loc) ((loc) >> (fs)->lfs_bshift) 395 #define lblktosize(fs, blk) ((blk) << (fs)->lfs_bshift) 396 #define numfrags(fs, loc) /* calculates (loc / fs->lfs_fsize) */ \ 397 ((loc) >> (fs)->lfs_ffshift) 398 #define blkroundup(fs, size) /* calculates roundup(size, fs->lfs_bsize) */ \ 399 ((int)(((size) + (fs)->lfs_bmask) & (~(fs)->lfs_bmask))) 400 #define fragroundup(fs, size) /* calculates roundup(size, fs->lfs_fsize) */ \ 401 ((int)(((size) + (fs)->lfs_ffmask) & (~(fs)->lfs_ffmask))) 402 #define fragstoblks(fs, frags) /* calculates (frags / fs->lfs_frag) */ \ 403 ((frags) >> (fs)->lfs_fbshift) 404 #define blkstofrags(fs, blks) /* calculates (blks * fs->lfs_frag) */ \ 405 ((blks) << (fs)->lfs_fbshift) 406 #define fragnum(fs, fsb) /* calculates (fsb % fs->lfs_frag) */ \ 407 ((fsb) & ((fs)->lfs_frag - 1)) 408 #define blknum(fs, fsb) /* calculates rounddown(fsb, fs->lfs_frag) */ \ 409 ((fsb) &~ ((fs)->lfs_frag - 1)) 410 #define dblksize(fs, dip, lbn) \ 411 (((lbn) >= NDADDR || (dip)->di_size >= ((lbn) + 1) << (fs)->lfs_bshift)\ 412 ? (fs)->lfs_bsize \ 413 : (fragroundup(fs, blkoff(fs, (dip)->di_size)))) 414 #define datosn(fs, daddr) /* disk address to segment number */ \ 415 (((daddr) - (fs)->lfs_sboffs[0]) / fsbtodb((fs), (fs)->lfs_ssize)) 416 #define sntoda(fs, sn) /* segment number to disk address */ \ 417 ((ufs_daddr_t)((sn) * ((fs)->lfs_ssize << (fs)->lfs_fsbtodb) + \ 418 (fs)->lfs_sboffs[0])) 419 420 /* Read in the block with the cleaner info from the ifile. */ 421 #define LFS_CLEANERINFO(CP, F, BP) { \ 422 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 423 if (bread((F)->lfs_ivnode, \ 424 (ufs_daddr_t)0, (F)->lfs_bsize, NOCRED, &(BP))) \ 425 panic("lfs: ifile read"); \ 426 (CP) = (CLEANERINFO *)(BP)->b_data; \ 427 } 428 429 /* Read in the block with a specific inode from the ifile. */ 430 #define LFS_IENTRY(IP, F, IN, BP) { \ 431 int _e; \ 432 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 433 if ((_e = bread((F)->lfs_ivnode, \ 434 (IN) / (F)->lfs_ifpb + (F)->lfs_cleansz + (F)->lfs_segtabsz,\ 435 (F)->lfs_bsize, NOCRED, &(BP))) != 0) \ 436 panic("lfs: ifile read %d", _e); \ 437 (IP) = (IFILE *)(BP)->b_data + (IN) % (F)->lfs_ifpb; \ 438 } 439 440 /* Read in the block with a specific segment usage entry from the ifile. */ 441 #define LFS_SEGENTRY(SP, F, IN, BP) { \ 442 int _e; \ 443 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 444 if ((_e = bread((F)->lfs_ivnode, \ 445 ((IN) >> (F)->lfs_sushift) + (F)->lfs_cleansz, \ 446 (F)->lfs_bsize, NOCRED, &(BP))) != 0) \ 447 panic("lfs: ifile read: %d", _e); \ 448 (SP) = (SEGUSE *)(BP)->b_data + ((IN) & ((F)->lfs_sepb - 1)); \ 449 } 450 451 /* Determine if a buffer belongs to the ifile */ 452 #define IS_IFILE(bp) (VTOI(bp->b_vp)->i_number == LFS_IFILE_INUM) 453 454 /* 455 * Structures used by lfs_bmapv and lfs_markv to communicate information 456 * about inodes and data blocks. 457 */ 458 typedef struct block_info { 459 ino_t bi_inode; /* inode # */ 460 ufs_daddr_t bi_lbn; /* logical block w/in file */ 461 ufs_daddr_t bi_daddr; /* disk address of block */ 462 time_t bi_segcreate; /* origin segment create time */ 463 int bi_version; /* file version number */ 464 void *bi_bp; /* data buffer */ 465 int bi_size; /* size of the block (if fragment) */ 466 } BLOCK_INFO; 467 468 /* In-memory description of a segment about to be written. */ 469 struct segment { 470 struct lfs *fs; /* file system pointer */ 471 struct buf **bpp; /* pointer to buffer array */ 472 struct buf **cbpp; /* pointer to next available bp */ 473 struct buf **start_bpp; /* pointer to first bp in this set */ 474 struct buf *ibp; /* buffer pointer to inode page */ 475 struct dinode *idp; /* pointer to ifile dinode */ 476 struct finfo *fip; /* current fileinfo pointer */ 477 struct vnode *vp; /* vnode being gathered */ 478 void *segsum; /* segment summary info */ 479 u_int32_t ninodes; /* number of inodes in this segment */ 480 u_int32_t seg_bytes_left; /* bytes left in segment */ 481 u_int32_t sum_bytes_left; /* bytes left in summary block */ 482 u_int32_t seg_number; /* number of this segment */ 483 ufs_daddr_t *start_lbp; /* beginning lbn for this set */ 484 485 #define SEGM_CKP 0x01 /* doing a checkpoint */ 486 #define SEGM_CLEAN 0x02 /* cleaner call; don't sort */ 487 #define SEGM_SYNC 0x04 /* wait for segment */ 488 u_int16_t seg_flags; /* run-time flags for this segment */ 489 }; 490 491 #define ISSPACE(F, BB, C) \ 492 (((C)->cr_uid == 0 && (F)->lfs_bfree >= (BB)) || \ 493 ((C)->cr_uid != 0 && IS_FREESPACE(F, BB))) 494 495 #define IS_FREESPACE(F, BB) \ 496 ((F)->lfs_bfree > ((F)->lfs_dsize * (F)->lfs_minfree / 100 + (BB))) 497 498 #define ISSPACE_XXX(F, BB) \ 499 ((F)->lfs_bfree >= (BB)) 500 501 /* Statistics Counters */ 502 struct lfs_stats { 503 u_int segsused; 504 u_int psegwrites; 505 u_int psyncwrites; 506 u_int pcleanwrites; 507 u_int blocktot; 508 u_int cleanblocks; 509 u_int ncheckpoints; 510 u_int nwrites; 511 u_int nsync_writes; 512 u_int wait_exceeded; 513 u_int write_exceeded; 514 u_int flush_invoked; 515 u_int vflush_invoked; 516 }; 517 extern struct lfs_stats lfs_stats; 518
Indexes created Mon Sep 29 21:09:56 GMT 2025