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