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