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