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