lfs.h revision 1.59
1 /* $NetBSD: lfs.h,v 1.59 2003/03/21 06:16:53 perseant Exp $ */ 2 3 /*- 4 * Copyright (c) 1999, 2000, 2001, 2002, 2003 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 #ifndef _UFS_LFS_LFS_H_ 74 #define _UFS_LFS_LFS_H_ 75 76 /* 77 * Compile-time options for LFS. 78 */ 79 #define LFS_IFIND_RETRIES 16 80 #define LFS_EAGAIN_FAIL /* markv fail with EAGAIN if ino is locked */ 81 #define LFS_DEBUG_RFW /* print roll-forward debugging info */ 82 #define LFS_LOGLENGTH 1024 83 84 /* #define DEBUG_LFS */ /* Intensive debugging of LFS subsystem */ 85 86 /* 87 * Parameters and generic definitions 88 */ 89 #define BW_CLEAN 1 90 #define MIN_FREE_SEGS 2 91 #define LFS_MAX_ACTIVE 10 92 #ifndef LFS_ATIME_IFILE 93 # define LFS_ATIME_IFILE 0 94 #endif 95 /* Max block count for lfs_markv() */ 96 #define LFS_MARKV_MAXBLKCNT 65536 97 98 /* Local definition for LFS's usage of PG_PAGER1 */ 99 #define PG_DELWRI PG_PAGER1 100 101 /* Types for lfs_newbuf and lfs_malloc */ 102 #define LFS_NB_UNKNOWN -1 103 #define LFS_NB_SUMMARY 0 104 #define LFS_NB_SBLOCK 1 105 #define LFS_NB_IBLOCK 2 106 #define LFS_NB_CLUSTER 3 107 #define LFS_NB_CLEAN 4 108 #define LFS_NB_COUNT 5 /* always last */ 109 110 /* Number of reserved memory blocks of each type */ 111 #define LFS_N_SUMMARIES 2 112 #define LFS_N_SBLOCKS 1 /* Always 1, to throttle superblock writes */ 113 #define LFS_N_IBLOCKS 16 /* In theory ssize/bsize; in practice around 2 */ 114 #define LFS_N_CLUSTERS 16 /* In theory ssize/MAXPHYS */ 115 #define LFS_N_CLEAN 0 116 117 /* Total count of "large" (non-pool) types */ 118 #define LFS_N_TOTAL (LFS_N_SUMMARIES + LFS_N_SBLOCKS + LFS_N_IBLOCKS + LFS_N_CLUSTERS + LFS_N_CLEAN) 119 120 /* Counts for pool types */ 121 #define LFS_N_CL LFS_N_CLUSTERS 122 #define LFS_N_BPP 2 123 #define LFS_N_SEG 2 124 125 /* Structure to keep reserved blocks */ 126 typedef struct lfs_res_blk { 127 void *p; 128 LIST_ENTRY(lfs_res_blk) res; 129 int size; 130 char inuse; 131 } res_t; 132 133 /* 134 * #define WRITE_THRESHHOLD ((nbuf >> 1) - 10) 135 * #define WAIT_THRESHHOLD (nbuf - (nbuf >> 2) - 10) 136 */ 137 #define LFS_MAX_BUFS ((nbuf >> 2) - 10) 138 #define LFS_WAIT_BUFS ((nbuf >> 1) - (nbuf >> 3) - 10) 139 /* These are new ... is LFS taking up too much memory in its buffers? */ 140 #define LFS_MAX_BYTES (((bufpages >> 2) - 10) * NBPG) 141 #define LFS_WAIT_BYTES (((bufpages >> 1) - (bufpages >> 3) - 10) * NBPG) 142 #define LFS_MAX_DIROP ((desiredvnodes >> 2) + (desiredvnodes >> 3)) 143 #define LFS_BUFWAIT 2 144 145 #define LFS_MAX_PAGES \ 146 (((uvmexp.active + uvmexp.inactive + uvmexp.free) * uvmexp.filemin) >> 8) 147 #define LFS_WAIT_PAGES \ 148 (((uvmexp.active + uvmexp.inactive + uvmexp.free) * uvmexp.filemax) >> 8) 149 150 #define LFS_IS_MALLOC_BUF(bp) (((bp)->b_flags & B_CALL) && \ 151 (bp)->b_iodone == lfs_callback) 152 153 #define LFS_LOCK_BUF(bp) do { \ 154 if (((bp)->b_flags & (B_LOCKED | B_CALL)) == 0) { \ 155 ++locked_queue_count; \ 156 locked_queue_bytes += bp->b_bufsize; \ 157 } \ 158 (bp)->b_flags |= B_LOCKED; \ 159 } while (0) 160 161 #define LFS_UNLOCK_BUF(bp) do { \ 162 if (((bp)->b_flags & (B_LOCKED | B_CALL)) == B_LOCKED) { \ 163 --locked_queue_count; \ 164 locked_queue_bytes -= bp->b_bufsize; \ 165 if (locked_queue_count < LFS_WAIT_BUFS && \ 166 locked_queue_bytes < LFS_WAIT_BYTES) \ 167 wakeup(&locked_queue_count); \ 168 } \ 169 (bp)->b_flags &= ~B_LOCKED; \ 170 } while (0) 171 172 #ifdef DEBUG_LOCKED_LIST 173 # define LFS_DEBUG_COUNTLOCKED(m) do { \ 174 int _s; \ 175 extern int locked_queue_count; \ 176 extern long locked_queue_bytes; \ 177 _s = splbio(); \ 178 lfs_countlocked(&locked_queue_count, &locked_queue_bytes, (m)); \ 179 splx(_s); \ 180 wakeup(&locked_queue_count); \ 181 } while (0) 182 #else 183 # define LFS_DEBUG_COUNTLOCKED(m) 184 #endif 185 186 /* For convenience */ 187 #define IN_ALLMOD (IN_MODIFIED|IN_ACCESS|IN_CHANGE|IN_UPDATE|IN_ACCESSED|IN_CLEANING) 188 189 #define LFS_SET_UINO(ip, flags) do { \ 190 simple_lock(&(ip)->i_lfs->lfs_interlock); \ 191 if (((flags) & IN_ACCESSED) && !((ip)->i_flag & IN_ACCESSED)) \ 192 ++(ip)->i_lfs->lfs_uinodes; \ 193 if (((flags) & IN_CLEANING) && !((ip)->i_flag & IN_CLEANING)) \ 194 ++(ip)->i_lfs->lfs_uinodes; \ 195 if (((flags) & IN_MODIFIED) && !((ip)->i_flag & IN_MODIFIED)) \ 196 ++(ip)->i_lfs->lfs_uinodes; \ 197 (ip)->i_flag |= (flags); \ 198 simple_unlock(&(ip)->i_lfs->lfs_interlock); \ 199 } while (0) 200 201 #define LFS_CLR_UINO(ip, flags) do { \ 202 simple_lock(&(ip)->i_lfs->lfs_interlock); \ 203 if (((flags) & IN_ACCESSED) && ((ip)->i_flag & IN_ACCESSED)) \ 204 --(ip)->i_lfs->lfs_uinodes; \ 205 if (((flags) & IN_CLEANING) && ((ip)->i_flag & IN_CLEANING)) \ 206 --(ip)->i_lfs->lfs_uinodes; \ 207 if (((flags) & IN_MODIFIED) && ((ip)->i_flag & IN_MODIFIED)) \ 208 --(ip)->i_lfs->lfs_uinodes; \ 209 (ip)->i_flag &= ~(flags); \ 210 if ((ip)->i_lfs->lfs_uinodes < 0) { \ 211 panic("lfs_uinodes < 0"); \ 212 } \ 213 simple_unlock(&(ip)->i_lfs->lfs_interlock); \ 214 } while (0) 215 216 #ifdef DEBUG 217 struct lfs_log_entry { 218 char *op; 219 char *file; 220 int line; 221 daddr_t block; 222 unsigned long flags; 223 }; 224 extern int lfs_lognum; 225 extern struct lfs_log_entry lfs_log[LFS_LOGLENGTH]; 226 # define LFS_BWRITE_LOG(bp) lfs_bwrite_log((bp), __FILE__, __LINE__) 227 # define LFS_ENTER_LOG(theop, thefile, theline, lbn, theflags) do { \ 228 int _s; \ 229 \ 230 _s = splbio(); \ 231 lfs_log[lfs_lognum].op = theop; \ 232 lfs_log[lfs_lognum].file = thefile; \ 233 lfs_log[lfs_lognum].line = (theline); \ 234 lfs_log[lfs_lognum].block = (lbn); \ 235 lfs_log[lfs_lognum].flags = (theflags); \ 236 lfs_lognum = (lfs_lognum + 1) % LFS_LOGLENGTH; \ 237 splx(_s); \ 238 } while (0) 239 240 # define LFS_BCLEAN_LOG(fs, bp) do { \ 241 if ((bp)->b_vp == (fs)->lfs_ivnode) \ 242 LFS_ENTER_LOG("clear", __FILE__, __LINE__, bp->b_lblkno, bp->b_flags); \ 243 } while (0) 244 #else 245 # define LFS_BCLEAN_LOG(fs, bp) 246 # define LFS_BWRITE_LOG(bp) VOP_BWRITE((bp)) 247 #endif 248 249 #define LFS_ITIMES(ip, acc, mod, cre) do { \ 250 struct lfs *_fs = (ip)->i_lfs; \ 251 \ 252 if ((ip)->i_flag & IN_ACCESS) { \ 253 (ip)->i_ffs_atime = (acc)->tv_sec; \ 254 (ip)->i_ffs_atimensec = (acc)->tv_nsec; \ 255 if ((ip)->i_lfs->lfs_version > 1) { \ 256 struct buf *ibp; \ 257 IFILE *ifp; \ 258 \ 259 LFS_IENTRY(ifp, ip->i_lfs, ip->i_number, ibp); \ 260 ifp->if_atime_sec = (acc)->tv_sec; \ 261 ifp->if_atime_nsec = (acc)->tv_nsec; \ 262 LFS_BWRITE_LOG(ibp); \ 263 _fs->lfs_flags |= LFS_IFDIRTY; \ 264 } else { \ 265 LFS_SET_UINO(ip, IN_ACCESSED); \ 266 } \ 267 } \ 268 if ((ip)->i_flag & (IN_CHANGE | IN_UPDATE)) { \ 269 if ((ip)->i_flag & IN_UPDATE) { \ 270 (ip)->i_ffs_mtime = (mod)->tv_sec; \ 271 (ip)->i_ffs_mtimensec = (mod)->tv_nsec; \ 272 (ip)->i_modrev++; \ 273 } \ 274 if ((ip)->i_flag & IN_CHANGE) { \ 275 (ip)->i_ffs_ctime = (cre)->tv_sec; \ 276 (ip)->i_ffs_ctimensec = (cre)->tv_nsec; \ 277 } \ 278 LFS_SET_UINO(ip, IN_MODIFIED); \ 279 } \ 280 (ip)->i_flag &= ~(IN_ACCESS | IN_CHANGE | IN_UPDATE); \ 281 } while (0) 282 283 /* 284 * How to find out whether a vnode had dirty buffers or pages, 285 * to know whether it needs to retain IN_MODIFIED after a write. 286 */ 287 #define VPISEMPTY(vp) (LIST_EMPTY(&(vp)->v_dirtyblkhd) && \ 288 !((vp)->v_flag & VONWORKLST)) 289 290 /* 291 * WRITEINPROG does not use VPISEMPTY because any dirty pages will 292 * have been given buffer headers, if they are "in progress". 293 */ 294 #define WRITEINPROG(vp) ((vp)->v_dirtyblkhd.lh_first && !(VTOI(vp)->i_flag & \ 295 (IN_MODIFIED | IN_ACCESSED | IN_CLEANING))) 296 297 /* Here begins the berkeley code */ 298 299 #define LFS_LABELPAD 8192 /* LFS label size */ 300 #define LFS_SBPAD 8192 /* LFS superblock size */ 301 302 /* On-disk and in-memory checkpoint segment usage structure. */ 303 typedef struct segusage SEGUSE; 304 struct segusage { 305 u_int32_t su_nbytes; /* 0: number of live bytes */ 306 u_int32_t su_olastmod; /* 4: SEGUSE last modified timestamp */ 307 u_int16_t su_nsums; /* 8: number of summaries in segment */ 308 u_int16_t su_ninos; /* 10: number of inode blocks in seg */ 309 310 #define SEGUSE_ACTIVE 0x01 /* segment currently being written */ 311 #define SEGUSE_DIRTY 0x02 /* segment has data in it */ 312 #define SEGUSE_SUPERBLOCK 0x04 /* segment contains a superblock */ 313 #define SEGUSE_ERROR 0x08 /* cleaner: do not clean segment */ 314 #define SEGUSE_EMPTY 0x10 /* segment is empty */ 315 u_int32_t su_flags; /* 12: segment flags */ 316 u_int64_t su_lastmod; /* 16: last modified timestamp */ 317 }; 318 319 typedef struct segusage_v1 SEGUSE_V1; 320 struct segusage_v1 { 321 u_int32_t su_nbytes; /* 0: number of live bytes */ 322 u_int32_t su_lastmod; /* 4: SEGUSE last modified timestamp */ 323 u_int16_t su_nsums; /* 8: number of summaries in segment */ 324 u_int16_t su_ninos; /* 10: number of inode blocks in seg */ 325 u_int32_t su_flags; /* 12: segment flags */ 326 }; 327 328 #define SEGUPB(fs) (fs->lfs_sepb) 329 #define SEGTABSIZE_SU(fs) \ 330 (((fs)->lfs_nseg + SEGUPB(fs) - 1) / (fs)->lfs_sepb) 331 332 /* On-disk file information. One per file with data blocks in the segment. */ 333 typedef struct finfo FINFO; 334 struct finfo { 335 u_int32_t fi_nblocks; /* number of blocks */ 336 u_int32_t fi_version; /* version number */ 337 u_int32_t fi_ino; /* inode number */ 338 u_int32_t fi_lastlength; /* length of last block in array */ 339 int32_t fi_blocks[1]; /* array of logical block numbers */ 340 }; 341 342 /* sizeof FINFO except fi_blocks */ 343 #define FINFOSIZE (sizeof(FINFO) - sizeof(int32_t)) 344 345 /* On-disk super block. */ 346 struct dlfs { 347 #define LFS_MAGIC 0x070162 348 u_int32_t dlfs_magic; /* 0: magic number */ 349 #define LFS_VERSION 2 350 u_int32_t dlfs_version; /* 4: version number */ 351 352 u_int32_t dlfs_size; /* 8: number of blocks in fs (v1) */ 353 /* number of frags in fs (v2) */ 354 u_int32_t dlfs_ssize; /* 12: number of blocks per segment (v1) */ 355 /* number of bytes per segment (v2) */ 356 u_int32_t dlfs_dsize; /* 16: number of disk blocks in fs */ 357 u_int32_t dlfs_bsize; /* 20: file system block size */ 358 u_int32_t dlfs_fsize; /* 24: size of frag blocks in fs */ 359 u_int32_t dlfs_frag; /* 28: number of frags in a block in fs */ 360 361 /* Checkpoint region. */ 362 u_int32_t dlfs_freehd; /* 32: start of the free list */ 363 u_int32_t dlfs_bfree; /* 36: number of free disk blocks */ 364 u_int32_t dlfs_nfiles; /* 40: number of allocated inodes */ 365 int32_t dlfs_avail; /* 44: blocks available for writing */ 366 int32_t dlfs_uinodes; /* 48: inodes in cache not yet on disk */ 367 int32_t dlfs_idaddr; /* 52: inode file disk address */ 368 u_int32_t dlfs_ifile; /* 56: inode file inode number */ 369 int32_t dlfs_lastseg; /* 60: address of last segment written */ 370 int32_t dlfs_nextseg; /* 64: address of next segment to write */ 371 int32_t dlfs_curseg; /* 68: current segment being written */ 372 int32_t dlfs_offset; /* 72: offset in curseg for next partial */ 373 int32_t dlfs_lastpseg; /* 76: address of last partial written */ 374 u_int32_t dlfs_inopf; /* 80: v1: time stamp; v2: inodes per frag */ 375 #define dlfs_otstamp dlfs_inopf 376 377 /* These are configuration parameters. */ 378 u_int32_t dlfs_minfree; /* 84: minimum percentage of free blocks */ 379 380 /* These fields can be computed from the others. */ 381 u_int64_t dlfs_maxfilesize; /* 88: maximum representable file size */ 382 u_int32_t dlfs_fsbpseg; /* 96: fsb per segment */ 383 u_int32_t dlfs_inopb; /* 100: inodes per block */ 384 u_int32_t dlfs_ifpb; /* 104: IFILE entries per block */ 385 u_int32_t dlfs_sepb; /* 108: SEGUSE entries per block */ 386 u_int32_t dlfs_nindir; /* 112: indirect pointers per block */ 387 u_int32_t dlfs_nseg; /* 116: number of segments */ 388 u_int32_t dlfs_nspf; /* 120: number of sectors per fragment */ 389 u_int32_t dlfs_cleansz; /* 124: cleaner info size in blocks */ 390 u_int32_t dlfs_segtabsz; /* 128: segment table size in blocks */ 391 u_int32_t dlfs_segmask; /* 132: calculate offset within a segment */ 392 u_int32_t dlfs_segshift; /* 136: fast mult/div for segments */ 393 u_int32_t dlfs_bshift; /* 140: calc block number from file offset */ 394 u_int32_t dlfs_ffshift; /* 144: fast mult/div for frag from file */ 395 u_int32_t dlfs_fbshift; /* 148: fast mult/div for frag from block */ 396 u_int64_t dlfs_bmask; /* 152: calc block offset from file offset */ 397 u_int64_t dlfs_ffmask; /* 160: calc frag offset from file offset */ 398 u_int64_t dlfs_fbmask; /* 168: calc frag offset from block offset */ 399 u_int32_t dlfs_blktodb; /* 176: blktodb and dbtoblk shift constant */ 400 u_int32_t dlfs_sushift; /* 180: fast mult/div for segusage table */ 401 402 int32_t dlfs_maxsymlinklen; /* 184: max length of an internal symlink */ 403 #define LFS_MIN_SBINTERVAL 5 /* minimum superblock segment spacing */ 404 #define LFS_MAXNUMSB 10 /* 188: superblock disk offsets */ 405 int32_t dlfs_sboffs[LFS_MAXNUMSB]; 406 407 u_int32_t dlfs_nclean; /* 228: Number of clean segments */ 408 u_char dlfs_fsmnt[MNAMELEN]; /* 232: name mounted on */ 409 #define LFS_PF_CLEAN 0x1 410 u_int16_t dlfs_pflags; /* 322: file system persistent flags */ 411 int32_t dlfs_dmeta; /* 324: total number of dirty summaries */ 412 u_int32_t dlfs_minfreeseg; /* 328: segs reserved for cleaner */ 413 u_int32_t dlfs_sumsize; /* 332: size of summary blocks */ 414 u_int64_t dlfs_serial; /* 336: serial number */ 415 u_int32_t dlfs_ibsize; /* 344: size of inode blocks */ 416 int32_t dlfs_start; /* 348: start of segment 0 */ 417 u_int64_t dlfs_tstamp; /* 352: time stamp */ 418 #define LFS_44INODEFMT 0 419 #define LFS_MAXINODEFMT 0 420 u_int32_t dlfs_inodefmt; /* 360: inode format version */ 421 u_int32_t dlfs_interleave; /* 364: segment interleave */ 422 u_int32_t dlfs_ident; /* 368: per-fs identifier */ 423 u_int32_t dlfs_fsbtodb; /* 372: fsbtodb abd dbtodsb shift constant */ 424 int8_t dlfs_pad[132]; /* 376: round to 512 bytes */ 425 /* Checksum -- last valid disk field. */ 426 u_int32_t dlfs_cksum; /* 508: checksum for superblock checking */ 427 }; 428 429 /* In-memory super block. */ 430 struct lfs { 431 struct dlfs lfs_dlfs; /* on-disk parameters */ 432 #define lfs_magic lfs_dlfs.dlfs_magic 433 #define lfs_version lfs_dlfs.dlfs_version 434 #define lfs_size lfs_dlfs.dlfs_size 435 #define lfs_ssize lfs_dlfs.dlfs_ssize 436 #define lfs_dsize lfs_dlfs.dlfs_dsize 437 #define lfs_bsize lfs_dlfs.dlfs_bsize 438 #define lfs_fsize lfs_dlfs.dlfs_fsize 439 #define lfs_frag lfs_dlfs.dlfs_frag 440 #define lfs_freehd lfs_dlfs.dlfs_freehd 441 #define lfs_bfree lfs_dlfs.dlfs_bfree 442 #define lfs_nfiles lfs_dlfs.dlfs_nfiles 443 #define lfs_avail lfs_dlfs.dlfs_avail 444 #define lfs_uinodes lfs_dlfs.dlfs_uinodes 445 #define lfs_idaddr lfs_dlfs.dlfs_idaddr 446 #define lfs_ifile lfs_dlfs.dlfs_ifile 447 #define lfs_lastseg lfs_dlfs.dlfs_lastseg 448 #define lfs_nextseg lfs_dlfs.dlfs_nextseg 449 #define lfs_curseg lfs_dlfs.dlfs_curseg 450 #define lfs_offset lfs_dlfs.dlfs_offset 451 #define lfs_lastpseg lfs_dlfs.dlfs_lastpseg 452 #define lfs_otstamp lfs_dlfs.dlfs_inopf 453 #define lfs_inopf lfs_dlfs.dlfs_inopf 454 #define lfs_minfree lfs_dlfs.dlfs_minfree 455 #define lfs_maxfilesize lfs_dlfs.dlfs_maxfilesize 456 #define lfs_fsbpseg lfs_dlfs.dlfs_fsbpseg 457 #define lfs_inopb lfs_dlfs.dlfs_inopb 458 #define lfs_ifpb lfs_dlfs.dlfs_ifpb 459 #define lfs_sepb lfs_dlfs.dlfs_sepb 460 #define lfs_nindir lfs_dlfs.dlfs_nindir 461 #define lfs_nseg lfs_dlfs.dlfs_nseg 462 #define lfs_nspf lfs_dlfs.dlfs_nspf 463 #define lfs_cleansz lfs_dlfs.dlfs_cleansz 464 #define lfs_segtabsz lfs_dlfs.dlfs_segtabsz 465 #define lfs_segmask lfs_dlfs.dlfs_segmask 466 #define lfs_segshift lfs_dlfs.dlfs_segshift 467 #define lfs_bmask lfs_dlfs.dlfs_bmask 468 #define lfs_bshift lfs_dlfs.dlfs_bshift 469 #define lfs_ffmask lfs_dlfs.dlfs_ffmask 470 #define lfs_ffshift lfs_dlfs.dlfs_ffshift 471 #define lfs_fbmask lfs_dlfs.dlfs_fbmask 472 #define lfs_fbshift lfs_dlfs.dlfs_fbshift 473 #define lfs_blktodb lfs_dlfs.dlfs_blktodb 474 #define lfs_fsbtodb lfs_dlfs.dlfs_fsbtodb 475 #define lfs_sushift lfs_dlfs.dlfs_sushift 476 #define lfs_maxsymlinklen lfs_dlfs.dlfs_maxsymlinklen 477 #define lfs_sboffs lfs_dlfs.dlfs_sboffs 478 #define lfs_cksum lfs_dlfs.dlfs_cksum 479 #define lfs_pflags lfs_dlfs.dlfs_pflags 480 #define lfs_fsmnt lfs_dlfs.dlfs_fsmnt 481 #define lfs_nclean lfs_dlfs.dlfs_nclean 482 #define lfs_dmeta lfs_dlfs.dlfs_dmeta 483 #define lfs_minfreeseg lfs_dlfs.dlfs_minfreeseg 484 #define lfs_sumsize lfs_dlfs.dlfs_sumsize 485 #define lfs_serial lfs_dlfs.dlfs_serial 486 #define lfs_ibsize lfs_dlfs.dlfs_ibsize 487 #define lfs_start lfs_dlfs.dlfs_start 488 #define lfs_tstamp lfs_dlfs.dlfs_tstamp 489 #define lfs_inodefmt lfs_dlfs.dlfs_inodefmt 490 #define lfs_interleave lfs_dlfs.dlfs_interleave 491 #define lfs_ident lfs_dlfs.dlfs_ident 492 493 /* These fields are set at mount time and are meaningless on disk. */ 494 struct segment *lfs_sp; /* current segment being written */ 495 struct vnode *lfs_ivnode; /* vnode for the ifile */ 496 u_int32_t lfs_seglock; /* single-thread the segment writer */ 497 pid_t lfs_lockpid; /* pid of lock holder */ 498 u_int32_t lfs_iocount; /* number of ios pending */ 499 u_int32_t lfs_writer; /* don't allow any dirops to start */ 500 u_int32_t lfs_dirops; /* count of active directory ops */ 501 u_int32_t lfs_doifile; /* Write ifile blocks on next write */ 502 u_int32_t lfs_nactive; /* Number of segments since last ckp */ 503 int8_t lfs_fmod; /* super block modified flag */ 504 int8_t lfs_ronly; /* mounted read-only flag */ 505 #define LFS_NOTYET 0x01 506 #define LFS_IFDIRTY 0x02 507 #define LFS_WARNED 0x04 508 int8_t lfs_flags; /* currently unused flag */ 509 u_int16_t lfs_activesb; /* toggle between superblocks */ 510 daddr_t lfs_sbactive; /* disk address of in-progress sb write */ 511 struct vnode *lfs_flushvp; /* vnode being flushed */ 512 struct vnode *lfs_unlockvp; /* being inactivated in lfs_segunlock */ 513 u_int32_t lfs_diropwait; /* # procs waiting on dirop flush */ 514 size_t lfs_devbsize; /* Device block size */ 515 size_t lfs_devbshift; /* Device block shift */ 516 struct lock lfs_fraglock; 517 pid_t lfs_rfpid; /* Process ID of roll-forward agent */ 518 int lfs_nadirop; /* number of active dirop nodes */ 519 long lfs_ravail; /* blocks pre-reserved for writing */ 520 res_t *lfs_resblk; /* Reserved memory for pageout */ 521 TAILQ_HEAD(, inode) lfs_dchainhd; /* dirop vnodes */ 522 TAILQ_HEAD(, inode) lfs_pchainhd; /* paging vnodes */ 523 #define LFS_RESHASH_WIDTH 17 524 LIST_HEAD(, lfs_res_blk) lfs_reshash[LFS_RESHASH_WIDTH]; 525 int lfs_pdflush; /* pagedaemon wants us to flush */ 526 u_int32_t **lfs_suflags; /* Segment use flags */ 527 #ifdef _KERNEL 528 struct pool lfs_clpool; /* Pool for struct lfs_cluster */ 529 struct pool lfs_bpppool; /* Pool for bpp */ 530 struct pool lfs_segpool; /* Pool for struct segment */ 531 #endif /* KERNEL */ 532 #define LFS_MAX_CLEANIND 64 533 int32_t lfs_cleanint[LFS_MAX_CLEANIND]; /* Active cleaning intervals */ 534 int lfs_cleanind; /* Index into intervals */ 535 struct simplelock lfs_interlock; /* lock for lfs_seglock */ 536 }; 537 538 /* 539 * Inode 0: out-of-band inode number 540 * Inode 1: IFILE inode number 541 * Inode 2: root inode 542 * Inode 3: lost+found inode number 543 */ 544 #define LFS_UNUSED_INUM 0 /* out of band inode number */ 545 #define LFS_IFILE_INUM 1 /* IFILE inode number */ 546 #define LOSTFOUNDINO 3 /* lost+found inode number */ 547 #define LFS_FIRST_INUM 4 /* first free inode number */ 548 549 /* Address calculations for metadata located in the inode */ 550 #define S_INDIR(fs) -NDADDR 551 #define D_INDIR(fs) (S_INDIR(fs) - NINDIR(fs) - 1) 552 #define T_INDIR(fs) (D_INDIR(fs) - NINDIR(fs) * NINDIR(fs) - 1) 553 554 /* Unassigned disk addresses. */ 555 #define UNASSIGNED -1 556 #define UNWRITTEN -2 557 558 /* Unused logical block number */ 559 #define LFS_UNUSED_LBN -1 560 561 typedef struct ifile IFILE; 562 struct ifile { 563 u_int32_t if_version; /* inode version number */ 564 #define LFS_UNUSED_DADDR 0 /* out-of-band daddr */ 565 int32_t if_daddr; /* inode disk address */ 566 ino_t if_nextfree; /* next-unallocated inode */ 567 /* XXX - when inode format changes, this changes too */ 568 u_int32_t if_atime_sec; /* Last access time, seconds */ 569 u_int32_t if_atime_nsec; /* and nanoseconds */ 570 }; 571 572 typedef struct ifile_v1 IFILE_V1; 573 struct ifile_v1 { 574 u_int32_t if_version; /* inode version number */ 575 int32_t if_daddr; /* inode disk address */ 576 ino_t if_nextfree; /* next-unallocated inode */ 577 #if LFS_ATIME_IFILE 578 struct timespec if_atime; /* Last access time */ 579 #endif 580 }; 581 582 /* 583 * Cleaner information structure. This resides in the ifile and is used 584 * to pass information between the cleaner and the kernel. 585 */ 586 typedef struct _cleanerinfo { 587 u_int32_t clean; /* number of clean segments */ 588 u_int32_t dirty; /* number of dirty segments */ 589 u_int32_t bfree; /* disk blocks free */ 590 int32_t avail; /* disk blocks available */ 591 u_int32_t free_head; /* head of the inode free list */ 592 u_int32_t free_tail; /* tail of the inode free list */ 593 } CLEANERINFO; 594 595 #define CLEANSIZE_SU(fs) \ 596 ((sizeof(CLEANERINFO) + (fs)->lfs_bsize - 1) >> (fs)->lfs_bshift) 597 598 /* 599 * All summary blocks are the same size, so we can always read a summary 600 * block easily from a segment. 601 */ 602 #define LFS_V1_SUMMARY_SIZE 512 603 #define LFS_DFL_SUMMARY_SIZE 512 604 605 /* On-disk segment summary information */ 606 typedef struct segsum_v1 SEGSUM_V1; 607 struct segsum_v1 { 608 u_int32_t ss_sumsum; /* 0: check sum of summary block */ 609 u_int32_t ss_datasum; /* 4: check sum of data */ 610 u_int32_t ss_magic; /* 8: segment summary magic number */ 611 #define SS_MAGIC 0x061561 612 int32_t ss_next; /* 12: next segment */ 613 u_int32_t ss_create; /* 16: creation time stamp */ 614 u_int16_t ss_nfinfo; /* 20: number of file info structures */ 615 u_int16_t ss_ninos; /* 22: number of inodes in summary */ 616 617 #define SS_DIROP 0x01 /* segment begins a dirop */ 618 #define SS_CONT 0x02 /* more partials to finish this write*/ 619 u_int16_t ss_flags; /* 24: used for directory operations */ 620 u_int16_t ss_pad; /* 26: extra space */ 621 /* FINFO's and inode daddr's... */ 622 }; 623 624 typedef struct segsum SEGSUM; 625 struct segsum { 626 u_int32_t ss_sumsum; /* 0: check sum of summary block */ 627 u_int32_t ss_datasum; /* 4: check sum of data */ 628 u_int32_t ss_magic; /* 8: segment summary magic number */ 629 int32_t ss_next; /* 12: next segment */ 630 u_int32_t ss_ident; /* 16: roll-forward fsid */ 631 #define ss_ocreate ss_ident /* ident is where create was in v1 */ 632 u_int16_t ss_nfinfo; /* 20: number of file info structures */ 633 u_int16_t ss_ninos; /* 22: number of inodes in summary */ 634 u_int16_t ss_flags; /* 24: used for directory operations */ 635 u_int8_t ss_pad[6]; /* 26: extra space */ 636 u_int64_t ss_serial; /* 32: serial number */ 637 u_int64_t ss_create; /* 40: time stamp */ 638 /* FINFO's and inode daddr's... */ 639 }; 640 641 #define SEGSUM_SIZE(fs) ((fs)->lfs_version == 1 ? sizeof(SEGSUM_V1) : sizeof(SEGSUM)) 642 643 /* NINDIR is the number of indirects in a file system block. */ 644 #define NINDIR(fs) ((fs)->lfs_nindir) 645 646 /* INOPB is the number of inodes in a secondary storage block. */ 647 #define INOPB(fs) ((fs)->lfs_inopb) 648 /* INOPF is the number of inodes in a fragment. */ 649 #define INOPF(fs) ((fs)->lfs_inopf) 650 651 #define blksize(fs, ip, lbn) \ 652 (((lbn) >= NDADDR || (ip)->i_ffs_size >= ((lbn) + 1) << (fs)->lfs_bshift) \ 653 ? (fs)->lfs_bsize \ 654 : (fragroundup(fs, blkoff(fs, (ip)->i_ffs_size)))) 655 #define blkoff(fs, loc) ((int)((loc) & (fs)->lfs_bmask)) 656 #define fragoff(fs, loc) /* calculates (loc % fs->lfs_fsize) */ \ 657 ((int)((loc) & (fs)->lfs_ffmask)) 658 #define fsbtodb(fs, b) ((b) << (fs)->lfs_fsbtodb) 659 #define dbtofsb(fs, b) ((b) >> (fs)->lfs_fsbtodb) 660 #define fragstodb(fs, b) ((b) << ((fs)->lfs_blktodb - (fs)->lfs_fbshift)) 661 #define dbtofrags(fs, b) ((b) >> ((fs)->lfs_blktodb - (fs)->lfs_fbshift)) 662 #define lblkno(fs, loc) ((loc) >> (fs)->lfs_bshift) 663 #define lblktosize(fs, blk) ((blk) << (fs)->lfs_bshift) 664 /* Same as above, but named like dbtob(), btodb() */ 665 #define fsbtob(fs, b) ((b) << ((fs)->lfs_bshift - \ 666 (fs)->lfs_blktodb + (fs)->lfs_fsbtodb)) 667 #define btofsb(fs, b) ((b) >> ((fs)->lfs_bshift - \ 668 (fs)->lfs_blktodb + (fs)->lfs_fsbtodb)) 669 #define fsbtofrags(fs, b) ((b) >> ((fs)->lfs_blktodb - (fs)->lfs_fbshift - \ 670 (fs)->lfs_fsbtodb)) 671 #define fragstofsb(fs, b) ((b) << ((fs)->lfs_blktodb - (fs)->lfs_fbshift - \ 672 (fs)->lfs_fsbtodb)) 673 #define btofrags(fs, b) ((b) >> (fs)->lfs_ffshift) 674 #define numfrags(fs, loc) /* calculates (loc / fs->lfs_fsize) */ \ 675 ((loc) >> (fs)->lfs_ffshift) 676 #define blkroundup(fs, size) /* calculates roundup(size, fs->lfs_bsize) */ \ 677 ((off_t)(((size) + (fs)->lfs_bmask) & (~(fs)->lfs_bmask))) 678 #define fragroundup(fs, size) /* calculates roundup(size, fs->lfs_fsize) */ \ 679 ((off_t)(((size) + (fs)->lfs_ffmask) & (~(fs)->lfs_ffmask))) 680 #define fragstoblks(fs, frags) /* calculates (frags / fs->lfs_frag) */ \ 681 ((frags) >> (fs)->lfs_fbshift) 682 #define blkstofrags(fs, blks) /* calculates (blks * fs->lfs_frag) */ \ 683 ((blks) << (fs)->lfs_fbshift) 684 #define fragnum(fs, fsb) /* calculates (fsb % fs->lfs_frag) */ \ 685 ((fsb) & ((fs)->lfs_frag - 1)) 686 #define blknum(fs, fsb) /* calculates rounddown(fsb, fs->lfs_frag) */ \ 687 ((fsb) &~ ((fs)->lfs_frag - 1)) 688 #define dblksize(fs, dip, lbn) \ 689 (((lbn) >= NDADDR || (dip)->di_size >= ((lbn) + 1) << (fs)->lfs_bshift)\ 690 ? (fs)->lfs_bsize \ 691 : (fragroundup(fs, blkoff(fs, (dip)->di_size)))) 692 693 #define segtod(fs, seg) (((fs)->lfs_version == 1 ? \ 694 (fs)->lfs_ssize << (fs)->lfs_blktodb : \ 695 btofsb((fs), (fs)->lfs_ssize)) * (seg)) 696 #define dtosn(fs, daddr) /* block address to segment number */ \ 697 ((uint32_t)(((daddr) - (fs)->lfs_start) / segtod((fs), 1))) 698 #define sntod(fs, sn) /* segment number to disk address */ \ 699 ((daddr_t)(segtod((fs), (sn)) + (fs)->lfs_start)) 700 701 /* Read in the block with the cleaner info from the ifile. */ 702 #define LFS_CLEANERINFO(CP, F, BP) do { \ 703 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 704 if (bread((F)->lfs_ivnode, \ 705 (daddr_t)0, (F)->lfs_bsize, NOCRED, &(BP))) \ 706 panic("lfs: ifile read"); \ 707 (CP) = (CLEANERINFO *)(BP)->b_data; \ 708 } while(0) 709 710 /* Synchronize the Ifile cleaner info with current avail and bfree */ 711 #define LFS_SYNC_CLEANERINFO(cip, fs, bp, w) do { \ 712 if ((w) || (cip)->bfree != (fs)->lfs_bfree || \ 713 (cip)->avail != (fs)->lfs_avail - (fs)->lfs_ravail) { \ 714 (cip)->bfree = (fs)->lfs_bfree; \ 715 (cip)->avail = (fs)->lfs_avail - (fs)->lfs_ravail; \ 716 if (((bp)->b_flags & B_GATHERED) == 0) \ 717 (fs)->lfs_flags |= LFS_IFDIRTY; \ 718 (void) LFS_BWRITE_LOG(bp); /* Ifile */ \ 719 } else \ 720 brelse(bp); \ 721 } while (0) 722 723 #define LFS_GET_HEADFREE(FS, CIP, BP, FREEP) do { \ 724 if ((FS)->lfs_version > 1) { \ 725 LFS_CLEANERINFO((CIP), (FS), (BP)); \ 726 (FS)->lfs_freehd = (CIP)->free_head; \ 727 brelse(BP); \ 728 } \ 729 *(FREEP) = (FS)->lfs_freehd; \ 730 } while (0) 731 732 #define LFS_PUT_HEADFREE(FS, CIP, BP, VAL) do { \ 733 (FS)->lfs_freehd = (VAL); \ 734 if ((FS)->lfs_version > 1) { \ 735 LFS_CLEANERINFO((CIP), (FS), (BP)); \ 736 (CIP)->free_head = (VAL); \ 737 LFS_BWRITE_LOG(BP); \ 738 (FS)->lfs_flags |= LFS_IFDIRTY; \ 739 } \ 740 } while (0) 741 742 #define LFS_GET_TAILFREE(FS, CIP, BP, FREEP) do { \ 743 LFS_CLEANERINFO((CIP), (FS), (BP)); \ 744 *(FREEP) = (CIP)->free_tail; \ 745 brelse(BP); \ 746 } while (0) 747 748 #define LFS_PUT_TAILFREE(FS, CIP, BP, VAL) do { \ 749 LFS_CLEANERINFO((CIP), (FS), (BP)); \ 750 (CIP)->free_tail = (VAL); \ 751 LFS_BWRITE_LOG(BP); \ 752 (FS)->lfs_flags |= LFS_IFDIRTY; \ 753 } while (0) 754 755 /* 756 * XXX - v1 compatibility code is not allowed to touch if_atime, since it 757 * may not be mapped! 758 */ 759 /* Read in the block with a specific inode from the ifile. */ 760 #define LFS_IENTRY(IP, F, IN, BP) do { \ 761 int _e; \ 762 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 763 if ((_e = bread((F)->lfs_ivnode, \ 764 (IN) / (F)->lfs_ifpb + (F)->lfs_cleansz + (F)->lfs_segtabsz, \ 765 (F)->lfs_bsize, NOCRED, &(BP))) != 0) \ 766 panic("lfs: ifile read %d", _e); \ 767 if ((F)->lfs_version == 1) \ 768 (IP) = (IFILE *)((IFILE_V1 *)(BP)->b_data + (IN) % (F)->lfs_ifpb); \ 769 else \ 770 (IP) = (IFILE *)(BP)->b_data + (IN) % (F)->lfs_ifpb; \ 771 } while(0) 772 773 /* Read in the block with a specific segment usage entry from the ifile. */ 774 #define LFS_SEGENTRY(SP, F, IN, BP) do { \ 775 int _e; \ 776 VTOI((F)->lfs_ivnode)->i_flag |= IN_ACCESS; \ 777 if ((_e = bread((F)->lfs_ivnode, \ 778 ((IN) / (F)->lfs_sepb) + (F)->lfs_cleansz, \ 779 (F)->lfs_bsize, NOCRED, &(BP))) != 0) \ 780 panic("lfs: ifile read: %d", _e); \ 781 if ((F)->lfs_version == 1) \ 782 (SP) = (SEGUSE *)((SEGUSE_V1 *)(BP)->b_data + \ 783 ((IN) & ((F)->lfs_sepb - 1))); \ 784 else \ 785 (SP) = (SEGUSE *)(BP)->b_data + ((IN) % (F)->lfs_sepb); \ 786 } while(0) 787 788 #define LFS_WRITESEGENTRY(SP, F, IN, BP) do { \ 789 if ((SP)->su_nbytes == 0) \ 790 (SP)->su_flags |= SEGUSE_EMPTY; \ 791 else \ 792 (SP)->su_flags &= ~SEGUSE_EMPTY; \ 793 (F)->lfs_suflags[(F)->lfs_activesb][(IN)] = (SP)->su_flags; \ 794 LFS_BWRITE_LOG(BP); \ 795 } while(0) 796 797 /* Determine if a buffer belongs to the ifile */ 798 #define IS_IFILE(bp) (VTOI(bp->b_vp)->i_number == LFS_IFILE_INUM) 799 800 /* 801 * Structures used by lfs_bmapv and lfs_markv to communicate information 802 * about inodes and data blocks. 803 */ 804 typedef struct block_info { 805 ino_t bi_inode; /* inode # */ 806 /* XXX ondisk32 */ 807 int32_t bi_lbn; /* logical block w/in file */ 808 int32_t bi_daddr; /* disk address of block */ 809 u_int64_t bi_segcreate; /* origin segment create time */ 810 int bi_version; /* file version number */ 811 void *bi_bp; /* data buffer */ 812 int bi_size; /* size of the block (if fragment) */ 813 } BLOCK_INFO; 814 815 /* Compatibility for 1.5 binaries */ 816 typedef struct block_info_15 { 817 ino_t bi_inode; /* inode # */ 818 /* XXX ondisk32 */ 819 int32_t bi_lbn; /* logical block w/in file */ 820 int32_t bi_daddr; /* disk address of block */ 821 u_int32_t bi_segcreate; /* origin segment create time */ 822 int bi_version; /* file version number */ 823 void *bi_bp; /* data buffer */ 824 int bi_size; /* size of the block (if fragment) */ 825 } BLOCK_INFO_15; 826 827 /* In-memory description of a segment about to be written. */ 828 struct segment { 829 struct lfs *fs; /* file system pointer */ 830 struct buf **bpp; /* pointer to buffer array */ 831 struct buf **cbpp; /* pointer to next available bp */ 832 struct buf **start_bpp; /* pointer to first bp in this set */ 833 struct buf *ibp; /* buffer pointer to inode page */ 834 struct dinode *idp; /* pointer to ifile dinode */ 835 struct finfo *fip; /* current fileinfo pointer */ 836 struct vnode *vp; /* vnode being gathered */ 837 void *segsum; /* segment summary info */ 838 u_int32_t ninodes; /* number of inodes in this segment */ 839 int32_t seg_bytes_left; /* bytes left in segment */ 840 int32_t sum_bytes_left; /* bytes left in summary block */ 841 u_int32_t seg_number; /* number of this segment */ 842 /* XXX ondisk32 */ 843 int32_t *start_lbp; /* beginning lbn for this set */ 844 845 #define SEGM_CKP 0x01 /* doing a checkpoint */ 846 #define SEGM_CLEAN 0x02 /* cleaner call; don't sort */ 847 #define SEGM_SYNC 0x04 /* wait for segment */ 848 #define SEGM_PROT 0x08 /* don't inactivate at segunlock */ 849 #define SEGM_PAGEDAEMON 0x10 /* pagedaemon called us */ 850 #define SEGM_WRITERD 0x20 /* LFS writed called us */ 851 #define SEGM_FORCE_CKP 0x40 /* Force checkpoint right away */ 852 u_int16_t seg_flags; /* run-time flags for this segment */ 853 u_int32_t seg_iocount; /* number of ios pending */ 854 int ndupino; /* number of duplicate inodes */ 855 }; 856 857 struct lfs_cluster { 858 size_t bufsize; /* Size of kept data */ 859 struct buf **bpp; /* Array of kept buffers */ 860 int bufcount; /* Number of kept buffers */ 861 #define LFS_CL_MALLOC 0x00000001 862 #define LFS_CL_SHIFT 0x00000002 863 #define LFS_CL_SYNC 0x00000004 864 u_int32_t flags; /* Flags */ 865 struct lfs *fs; /* LFS that this belongs to */ 866 struct segment *seg; /* Segment structure, for LFS_CL_SYNC */ 867 void *saveaddr; /* Original contents of saveaddr */ 868 char *olddata; /* Original b_data, if LFS_CL_MALLOC */ 869 }; 870 871 /* 872 * LFS inode extensions; moved from <ufs/ufs/inode.h> so that file didn't 873 * have to change every time LFS changed. 874 */ 875 struct lfs_inode_ext { 876 off_t lfs_osize; /* size of file on disk */ 877 u_int32_t lfs_effnblocks; /* number of blocks when i/o completes */ 878 size_t lfs_fragsize[NDADDR]; /* size of on-disk direct blocks */ 879 TAILQ_ENTRY(inode) lfs_dchain; /* Dirop chain. */ 880 TAILQ_ENTRY(inode) lfs_pchain; /* Paging chain. */ 881 }; 882 #define i_lfs_osize inode_ext.lfs->lfs_osize 883 #define i_lfs_effnblks inode_ext.lfs->lfs_effnblocks 884 #define i_lfs_fragsize inode_ext.lfs->lfs_fragsize 885 #define i_lfs_dchain inode_ext.lfs->lfs_dchain 886 887 /* 888 * Macros for determining free space on the disk, with the variable metadata 889 * of segment summaries and inode blocks taken into account. 890 */ 891 /* Estimate number of clean blocks not available for writing */ 892 #define LFS_EST_CMETA(F) (int32_t)((((F)->lfs_dmeta * \ 893 (int64_t)(F)->lfs_nclean) / \ 894 ((F)->lfs_nseg - (F)->lfs_nclean))) 895 896 /* Estimate total size of the disk not including metadata */ 897 #define LFS_EST_NONMETA(F) ((F)->lfs_dsize - (F)->lfs_dmeta - LFS_EST_CMETA(F)) 898 899 /* Estimate number of blocks actually available for writing */ 900 #define LFS_EST_BFREE(F) ((F)->lfs_bfree - LFS_EST_CMETA(F) - (F)->lfs_dmeta) 901 902 /* Amount of non-meta space not available to mortal man */ 903 #define LFS_EST_RSVD(F) (int32_t)((LFS_EST_NONMETA(F) * \ 904 (u_int64_t)(F)->lfs_minfree) / \ 905 100) 906 907 /* Can credential C write BB blocks */ 908 #define ISSPACE(F, BB, C) \ 909 ((((C) == NOCRED || (C)->cr_uid == 0) && \ 910 LFS_EST_BFREE(F) >= (BB)) || \ 911 ((C)->cr_uid != 0 && IS_FREESPACE(F, BB))) 912 913 /* Can an ordinary user write BB blocks */ 914 #define IS_FREESPACE(F, BB) \ 915 (LFS_EST_BFREE(F) >= (BB) + LFS_EST_RSVD(F)) 916 917 /* Statistics Counters */ 918 struct lfs_stats { 919 u_int segsused; 920 u_int psegwrites; 921 u_int psyncwrites; 922 u_int pcleanwrites; 923 u_int blocktot; 924 u_int cleanblocks; 925 u_int ncheckpoints; 926 u_int nwrites; 927 u_int nsync_writes; 928 u_int wait_exceeded; 929 u_int write_exceeded; 930 u_int flush_invoked; 931 u_int vflush_invoked; 932 }; 933 #ifdef _KERNEL 934 extern struct lfs_stats lfs_stats; 935 #endif 936 937 /* Fcntls to take the place of the lfs syscalls */ 938 struct lfs_fcntl_markv { 939 BLOCK_INFO *blkiov; /* blocks to relocate */ 940 int blkcnt; /* number of blocks */ 941 }; 942 943 #define LFCNSEGWAITALL _FCNW_FSPRIV('L', 0, struct timeval) 944 #define LFCNSEGWAIT _FCNW_FSPRIV('L', 1, struct timeval) 945 #define LFCNBMAPV _FCNRW_FSPRIV('L', 2, struct lfs_fcntl_markv) 946 #define LFCNMARKV _FCNRW_FSPRIV('L', 3, struct lfs_fcntl_markv) 947 #define LFCNRECLAIM _FCNO_FSPRIV('L', 4) 948 949 #endif /* !_UFS_LFS_LFS_H_ */ 950
Indexes created Wed Oct 01 19:09:53 GMT 2025