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