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