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