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