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