1 /* 2 * Copyright (c) 2011-2015 The DragonFly Project. All rights reserved. 3 * 4 * This code is derived from software contributed to The DragonFly Project 5 * by Matthew Dillon <dillon@dragonflybsd.org> 6 * by Venkatesh Srinivas <vsrinivas@dragonflybsd.org> 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in 16 * the documentation and/or other materials provided with the 17 * distribution. 18 * 3. Neither the name of The DragonFly Project nor the names of its 19 * contributors may be used to endorse or promote products derived 20 * from this software without specific, prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 23 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 27 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, 28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 31 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 32 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 /* 37 * HAMMER2 IN-MEMORY CACHE OF MEDIA STRUCTURES 38 * 39 * This header file contains structures used internally by the HAMMER2 40 * implementation. See hammer2_disk.h for on-disk structures. 41 * 42 * There is an in-memory representation of all on-media data structure. 43 * Almost everything is represented by a hammer2_chain structure in-memory. 44 * Other higher-level structures typically map to chains. 45 * 46 * A great deal of data is accessed simply via its buffer cache buffer, 47 * which is mapped for the duration of the chain's lock. Hammer2 must 48 * implement its own buffer cache layer on top of the system layer to 49 * allow for different threads to lock different sub-block-sized buffers. 50 * 51 * When modifications are made to a chain a new filesystem block must be 52 * allocated. Multiple modifications do not typically allocate new blocks 53 * until the current block has been flushed. Flushes do not block the 54 * front-end unless the front-end operation crosses the current inode being 55 * flushed. 56 * 57 * The in-memory representation may remain cached (for example in order to 58 * placemark clustering locks) even after the related data has been 59 * detached. 60 */ 61 62 #ifndef _VFS_HAMMER2_HAMMER2_H_ 63 #define _VFS_HAMMER2_HAMMER2_H_ 64 65 #include <sys/param.h> 66 #include <sys/types.h> 67 #include <sys/kernel.h> 68 #include <sys/conf.h> 69 #include <sys/systm.h> 70 #include <sys/tree.h> 71 #include <sys/malloc.h> 72 #include <sys/mount.h> 73 #include <sys/vnode.h> 74 #include <sys/proc.h> 75 #include <sys/mountctl.h> 76 #include <sys/priv.h> 77 #include <sys/stat.h> 78 #include <sys/thread.h> 79 #include <sys/globaldata.h> 80 #include <sys/lockf.h> 81 #include <sys/buf.h> 82 #include <sys/queue.h> 83 #include <sys/limits.h> 84 #include <sys/dmsg.h> 85 #include <sys/mutex.h> 86 #include <sys/kern_syscall.h> 87 88 #include <sys/signal2.h> 89 #include <sys/buf2.h> 90 #include <sys/mutex2.h> 91 #include <sys/thread2.h> 92 93 #include "hammer2_disk.h" 94 #include "hammer2_mount.h" 95 #include "hammer2_ioctl.h" 96 97 struct hammer2_io; 98 struct hammer2_iocb; 99 struct hammer2_chain; 100 struct hammer2_cluster; 101 struct hammer2_inode; 102 struct hammer2_dev; 103 struct hammer2_pfs; 104 struct hammer2_span; 105 struct hammer2_state; 106 struct hammer2_msg; 107 struct hammer2_thread; 108 union hammer2_xop; 109 110 /* 111 * Mutex and lock shims. Hammer2 requires support for asynchronous and 112 * abortable locks, and both exclusive and shared spinlocks. Normal 113 * synchronous non-abortable locks can be substituted for spinlocks. 114 */ 115 typedef mtx_t hammer2_mtx_t; 116 typedef mtx_link_t hammer2_mtx_link_t; 117 typedef mtx_state_t hammer2_mtx_state_t; 118 119 typedef struct spinlock hammer2_spin_t; 120 121 #define hammer2_mtx_ex mtx_lock_ex_quick 122 #define hammer2_mtx_sh mtx_lock_sh_quick 123 #define hammer2_mtx_unlock mtx_unlock 124 #define hammer2_mtx_owned mtx_owned 125 #define hammer2_mtx_init mtx_init 126 #define hammer2_mtx_temp_release mtx_lock_temp_release 127 #define hammer2_mtx_temp_restore mtx_lock_temp_restore 128 #define hammer2_mtx_refs mtx_lockrefs 129 130 #define hammer2_spin_init spin_init 131 #define hammer2_spin_sh spin_lock_shared 132 #define hammer2_spin_ex spin_lock 133 #define hammer2_spin_unsh spin_unlock_shared 134 #define hammer2_spin_unex spin_unlock 135 136 TAILQ_HEAD(hammer2_xop_list, hammer2_xop_head); 137 138 typedef struct hammer2_xop_list hammer2_xop_list_t; 139 140 141 /* 142 * General lock support 143 */ 144 static __inline 145 int 146 hammer2_mtx_upgrade(hammer2_mtx_t *mtx) 147 { 148 int wasexclusive; 149 150 if (mtx_islocked_ex(mtx)) { 151 wasexclusive = 1; 152 } else { 153 mtx_unlock(mtx); 154 mtx_lock_ex_quick(mtx); 155 wasexclusive = 0; 156 } 157 return wasexclusive; 158 } 159 160 /* 161 * Downgrade an inode lock from exclusive to shared only if the inode 162 * lock was previously shared. If the inode lock was previously exclusive, 163 * this is a NOP. 164 */ 165 static __inline 166 void 167 hammer2_mtx_downgrade(hammer2_mtx_t *mtx, int wasexclusive) 168 { 169 if (wasexclusive == 0) 170 mtx_downgrade(mtx); 171 } 172 173 /* 174 * The xid tracks internal transactional updates. 175 * 176 * XXX fix-me, really needs to be 64-bits 177 */ 178 typedef uint32_t hammer2_xid_t; 179 180 #define HAMMER2_XID_MIN 0x00000000U 181 #define HAMMER2_XID_MAX 0x7FFFFFFFU 182 183 /* 184 * The chain structure tracks a portion of the media topology from the 185 * root (volume) down. Chains represent volumes, inodes, indirect blocks, 186 * data blocks, and freemap nodes and leafs. 187 * 188 * The chain structure utilizes a simple singly-homed topology and the 189 * chain's in-memory topology will move around as the chains do, due mainly 190 * to renames and indirect block creation. 191 * 192 * Block Table Updates 193 * 194 * Block table updates for insertions and updates are delayed until the 195 * flush. This allows us to avoid having to modify the parent chain 196 * all the way to the root. 197 * 198 * Block table deletions are performed immediately (modifying the parent 199 * in the process) because the flush code uses the chain structure to 200 * track delayed updates and the chain will be (likely) gone or moved to 201 * another location in the topology after a deletion. 202 * 203 * A prior iteration of the code tried to keep the relationship intact 204 * on deletes by doing a delete-duplicate operation on the chain, but 205 * it added way too much complexity to the codebase. 206 * 207 * Flush Synchronization 208 * 209 * The flush code must flush modified chains bottom-up. Because chain 210 * structures can shift around and are NOT topologically stable, 211 * modified chains are independently indexed for the flush. As the flush 212 * runs it modifies (or further modifies) and updates the parents, 213 * propagating the flush all the way to the volume root. 214 * 215 * Modifying front-end operations can occur during a flush but will block 216 * in two cases: (1) when the front-end tries to operate on the inode 217 * currently in the midst of being flushed and (2) if the front-end 218 * crosses an inode currently being flushed (such as during a rename). 219 * So, for example, if you rename directory "x" to "a/b/c/d/e/f/g/x" and 220 * the flusher is currently working on "a/b/c", the rename will block 221 * temporarily in order to ensure that "x" exists in one place or the 222 * other. 223 * 224 * Meta-data statistics are updated by the flusher. The front-end will 225 * make estimates but meta-data must be fully synchronized only during a 226 * flush in order to ensure that it remains correct across a crash. 227 * 228 * Multiple flush synchronizations can theoretically be in-flight at the 229 * same time but the implementation is not coded to handle the case and 230 * currently serializes them. 231 * 232 * Snapshots: 233 * 234 * Snapshots currently require the subdirectory tree being snapshotted 235 * to be flushed. The snapshot then creates a new super-root inode which 236 * copies the flushed blockdata of the directory or file that was 237 * snapshotted. 238 * 239 * RBTREE NOTES: 240 * 241 * - Note that the radix tree runs in powers of 2 only so sub-trees 242 * cannot straddle edges. 243 */ 244 RB_HEAD(hammer2_chain_tree, hammer2_chain); 245 TAILQ_HEAD(h2_flush_list, hammer2_chain); 246 TAILQ_HEAD(h2_core_list, hammer2_chain); 247 TAILQ_HEAD(h2_iocb_list, hammer2_iocb); 248 249 #define CHAIN_CORE_DELETE_BMAP_ENTRIES \ 250 (HAMMER2_PBUFSIZE / sizeof(hammer2_blockref_t) / sizeof(uint32_t)) 251 252 /* 253 * Core topology for chain (embedded in chain). Protected by a spinlock. 254 */ 255 struct hammer2_chain_core { 256 hammer2_spin_t spin; 257 struct hammer2_chain_tree rbtree; /* sub-chains */ 258 int live_zero; /* blockref array opt */ 259 u_int live_count; /* live (not deleted) chains in tree */ 260 u_int chain_count; /* live + deleted chains under core */ 261 int generation; /* generation number (inserts only) */ 262 }; 263 264 typedef struct hammer2_chain_core hammer2_chain_core_t; 265 266 RB_HEAD(hammer2_io_tree, hammer2_io); 267 268 /* 269 * IOCB - IO callback (into chain, cluster, or manual request) 270 */ 271 struct hammer2_iocb { 272 TAILQ_ENTRY(hammer2_iocb) entry; 273 void (*callback)(struct hammer2_iocb *iocb); 274 struct hammer2_io *dio; 275 struct hammer2_cluster *cluster; 276 struct hammer2_chain *chain; 277 void *ptr; 278 off_t lbase; 279 int lsize; 280 uint32_t flags; 281 int error; 282 }; 283 284 typedef struct hammer2_iocb hammer2_iocb_t; 285 286 #define HAMMER2_IOCB_INTERLOCK 0x00000001 287 #define HAMMER2_IOCB_ONQ 0x00000002 288 #define HAMMER2_IOCB_DONE 0x00000004 289 #define HAMMER2_IOCB_INPROG 0x00000008 290 #define HAMMER2_IOCB_UNUSED10 0x00000010 291 #define HAMMER2_IOCB_QUICK 0x00010000 292 #define HAMMER2_IOCB_ZERO 0x00020000 293 #define HAMMER2_IOCB_READ 0x00040000 294 #define HAMMER2_IOCB_WAKEUP 0x00080000 295 296 /* 297 * DIO - Management structure wrapping system buffer cache. 298 * 299 * Used for multiple purposes including concurrent management 300 * if small requests by chains into larger DIOs. 301 */ 302 struct hammer2_io { 303 RB_ENTRY(hammer2_io) rbnode; /* indexed by device offset */ 304 struct h2_iocb_list iocbq; 305 struct spinlock spin; 306 struct hammer2_dev *hmp; 307 struct buf *bp; 308 off_t pbase; 309 int psize; 310 int refs; 311 int act; /* activity */ 312 }; 313 314 typedef struct hammer2_io hammer2_io_t; 315 316 #define HAMMER2_DIO_INPROG 0x80000000 /* bio in progress */ 317 #define HAMMER2_DIO_GOOD 0x40000000 /* dio->bp is stable */ 318 #define HAMMER2_DIO_WAITING 0x20000000 /* (old) */ 319 #define HAMMER2_DIO_DIRTY 0x10000000 /* flush on last drop */ 320 321 #define HAMMER2_DIO_MASK 0x0FFFFFFF 322 323 /* 324 * Primary chain structure keeps track of the topology in-memory. 325 */ 326 struct hammer2_chain { 327 hammer2_mtx_t lock; 328 hammer2_chain_core_t core; 329 RB_ENTRY(hammer2_chain) rbnode; /* live chain(s) */ 330 hammer2_blockref_t bref; 331 struct hammer2_chain *parent; 332 struct hammer2_state *state; /* if active cache msg */ 333 struct hammer2_dev *hmp; 334 struct hammer2_pfs *pmp; /* A PFS or super-root (spmp) */ 335 336 hammer2_io_t *dio; /* physical data buffer */ 337 u_int bytes; /* physical data size */ 338 u_int flags; 339 u_int refs; 340 u_int lockcnt; 341 int error; /* on-lock data error state */ 342 343 hammer2_media_data_t *data; /* data pointer shortcut */ 344 TAILQ_ENTRY(hammer2_chain) flush_node; /* flush list */ 345 }; 346 347 typedef struct hammer2_chain hammer2_chain_t; 348 349 int hammer2_chain_cmp(hammer2_chain_t *chain1, hammer2_chain_t *chain2); 350 RB_PROTOTYPE(hammer2_chain_tree, hammer2_chain, rbnode, hammer2_chain_cmp); 351 352 /* 353 * Special notes on flags: 354 * 355 * INITIAL - This flag allows a chain to be created and for storage to 356 * be allocated without having to immediately instantiate the 357 * related buffer. The data is assumed to be all-zeros. It 358 * is primarily used for indirect blocks. 359 * 360 * MODIFIED - The chain's media data has been modified. 361 * 362 * UPDATE - Chain might not be modified but parent blocktable needs update 363 * 364 * FICTITIOUS - Faked chain as a placeholder for an error condition. This 365 * chain is unsuitable for I/O. 366 * 367 * BMAPPED - Indicates that the chain is present in the parent blockmap. 368 * 369 * BMAPUPD - Indicates that the chain is present but needs to be updated 370 * in the parent blockmap. 371 */ 372 #define HAMMER2_CHAIN_MODIFIED 0x00000001 /* dirty chain data */ 373 #define HAMMER2_CHAIN_ALLOCATED 0x00000002 /* kmalloc'd chain */ 374 #define HAMMER2_CHAIN_DESTROY 0x00000004 375 #define HAMMER2_CHAIN_DEDUP 0x00000008 /* used as dedup src */ 376 #define HAMMER2_CHAIN_DELETED 0x00000010 /* deleted chain */ 377 #define HAMMER2_CHAIN_INITIAL 0x00000020 /* initial create */ 378 #define HAMMER2_CHAIN_UPDATE 0x00000040 /* need parent update */ 379 #define HAMMER2_CHAIN_DEFERRED 0x00000080 /* flush depth defer */ 380 #define HAMMER2_CHAIN_UNUSED000001000 0x00000100 381 #define HAMMER2_CHAIN_ONFLUSH 0x00000200 /* on a flush list */ 382 #define HAMMER2_CHAIN_FICTITIOUS 0x00000400 /* unsuitable for I/O */ 383 #define HAMMER2_CHAIN_VOLUMESYNC 0x00000800 /* needs volume sync */ 384 #define HAMMER2_CHAIN_DELAYED 0x00001000 /* delayed flush */ 385 #define HAMMER2_CHAIN_COUNTEDBREFS 0x00002000 /* block table stats */ 386 #define HAMMER2_CHAIN_ONRBTREE 0x00004000 /* on parent RB tree */ 387 #define HAMMER2_CHAIN_UNUSED00008000 0x00008000 388 #define HAMMER2_CHAIN_EMBEDDED 0x00010000 /* embedded data */ 389 #define HAMMER2_CHAIN_RELEASE 0x00020000 /* don't keep around */ 390 #define HAMMER2_CHAIN_BMAPPED 0x00040000 /* present in blkmap */ 391 #define HAMMER2_CHAIN_BMAPUPD 0x00080000 /* +needs updating */ 392 #define HAMMER2_CHAIN_IOINPROG 0x00100000 /* I/O interlock */ 393 #define HAMMER2_CHAIN_IOSIGNAL 0x00200000 /* I/O interlock */ 394 #define HAMMER2_CHAIN_PFSBOUNDARY 0x00400000 /* super->pfs inode */ 395 396 #define HAMMER2_CHAIN_FLUSH_MASK (HAMMER2_CHAIN_MODIFIED | \ 397 HAMMER2_CHAIN_UPDATE | \ 398 HAMMER2_CHAIN_ONFLUSH) 399 400 /* 401 * Hammer2 error codes, used by chain->error and cluster->error. The error 402 * code is typically set on-lock unless no I/O was requested, and set on 403 * I/O otherwise. If set for a cluster it generally means that the cluster 404 * code could not find a valid copy to present. 405 * 406 * IO - An I/O error occurred 407 * CHECK - I/O succeeded but did not match the check code 408 * INCOMPLETE - A cluster is not complete enough to use, or 409 * a chain cannot be loaded because its parent has an error. 410 * 411 * NOTE: API allows callers to check zero/non-zero to determine if an error 412 * condition exists. 413 * 414 * NOTE: Chain's data field is usually NULL on an IO error but not necessarily 415 * NULL on other errors. Check chain->error, not chain->data. 416 */ 417 #define HAMMER2_ERROR_NONE 0 418 #define HAMMER2_ERROR_IO 1 /* device I/O error */ 419 #define HAMMER2_ERROR_CHECK 2 /* check code mismatch */ 420 #define HAMMER2_ERROR_INCOMPLETE 3 /* incomplete cluster */ 421 #define HAMMER2_ERROR_DEPTH 4 /* temporary depth limit */ 422 423 /* 424 * Flags passed to hammer2_chain_lookup() and hammer2_chain_next() 425 * 426 * NOTES: 427 * NOLOCK - Input and output chains are referenced only and not 428 * locked. Output chain might be temporarily locked 429 * internally. 430 * 431 * NODATA - Asks that the chain->data not be resolved in order 432 * to avoid I/O. 433 * 434 * NODIRECT - Prevents a lookup of offset 0 in an inode from returning 435 * the inode itself if the inode is in DIRECTDATA mode 436 * (i.e. file is <= 512 bytes). Used by the synchronization 437 * code to prevent confusion. 438 * 439 * SHARED - The input chain is expected to be locked shared, 440 * and the output chain is locked shared. 441 * 442 * MATCHIND - Allows an indirect block / freemap node to be returned 443 * when the passed key range matches the radix. Remember 444 * that key_end is inclusive (e.g. {0x000,0xFFF}, 445 * not {0x000,0x1000}). 446 * 447 * (Cannot be used for remote or cluster ops). 448 * 449 * ALLNODES - Allows NULL focus. 450 * 451 * ALWAYS - Always resolve the data. If ALWAYS and NODATA are both 452 * missing, bulk file data is not resolved but inodes and 453 * other meta-data will. 454 * 455 * NOUNLOCK - Used by hammer2_chain_next() to leave the lock on 456 * the input chain intact. The chain is still dropped. 457 * This allows the caller to add a reference to the chain 458 * and retain it in a locked state (used by the 459 * XOP/feed/collect code). 460 */ 461 #define HAMMER2_LOOKUP_NOLOCK 0x00000001 /* ref only */ 462 #define HAMMER2_LOOKUP_NODATA 0x00000002 /* data left NULL */ 463 #define HAMMER2_LOOKUP_NODIRECT 0x00000004 /* no offset=0 DD */ 464 #define HAMMER2_LOOKUP_SHARED 0x00000100 465 #define HAMMER2_LOOKUP_MATCHIND 0x00000200 /* return all chains */ 466 #define HAMMER2_LOOKUP_ALLNODES 0x00000400 /* allow NULL focus */ 467 #define HAMMER2_LOOKUP_ALWAYS 0x00000800 /* resolve data */ 468 #define HAMMER2_LOOKUP_NOUNLOCK 0x00001000 /* leave lock intact */ 469 470 /* 471 * Flags passed to hammer2_chain_modify() and hammer2_chain_resize() 472 * 473 * NOTE: OPTDATA allows us to avoid instantiating buffers for INDIRECT 474 * blocks in the INITIAL-create state. 475 */ 476 #define HAMMER2_MODIFY_OPTDATA 0x00000002 /* data can be NULL */ 477 #define HAMMER2_MODIFY_NO_MODIFY_TID 0x00000004 478 #define HAMMER2_MODIFY_UNUSED0008 0x00000008 479 480 /* 481 * Flags passed to hammer2_chain_lock() 482 * 483 * NOTE: RDONLY is set to optimize cluster operations when *no* modifications 484 * will be made to either the cluster being locked or any underlying 485 * cluster. It allows the cluster to lock and access data for a subset 486 * of available nodes instead of all available nodes. 487 */ 488 #define HAMMER2_RESOLVE_NEVER 1 489 #define HAMMER2_RESOLVE_MAYBE 2 490 #define HAMMER2_RESOLVE_ALWAYS 3 491 #define HAMMER2_RESOLVE_MASK 0x0F 492 493 #define HAMMER2_RESOLVE_SHARED 0x10 /* request shared lock */ 494 #define HAMMER2_RESOLVE_UNUSED20 0x20 495 #define HAMMER2_RESOLVE_RDONLY 0x40 /* higher level op flag */ 496 497 /* 498 * Flags passed to hammer2_chain_delete() 499 */ 500 #define HAMMER2_DELETE_PERMANENT 0x0001 501 502 /* 503 * Flags passed to hammer2_chain_insert() or hammer2_chain_rename() 504 */ 505 #define HAMMER2_INSERT_PFSROOT 0x0004 506 507 /* 508 * Flags passed to hammer2_chain_delete_duplicate() 509 */ 510 #define HAMMER2_DELDUP_RECORE 0x0001 511 512 /* 513 * Cluster different types of storage together for allocations 514 */ 515 #define HAMMER2_FREECACHE_INODE 0 516 #define HAMMER2_FREECACHE_INDIR 1 517 #define HAMMER2_FREECACHE_DATA 2 518 #define HAMMER2_FREECACHE_UNUSED3 3 519 #define HAMMER2_FREECACHE_TYPES 4 520 521 /* 522 * hammer2_freemap_alloc() block preference 523 */ 524 #define HAMMER2_OFF_NOPREF ((hammer2_off_t)-1) 525 526 /* 527 * BMAP read-ahead maximum parameters 528 */ 529 #define HAMMER2_BMAP_COUNT 16 /* max bmap read-ahead */ 530 #define HAMMER2_BMAP_BYTES (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT) 531 532 /* 533 * hammer2_freemap_adjust() 534 */ 535 #define HAMMER2_FREEMAP_DORECOVER 1 536 #define HAMMER2_FREEMAP_DOMAYFREE 2 537 #define HAMMER2_FREEMAP_DOREALFREE 3 538 539 /* 540 * HAMMER2 cluster - A set of chains representing the same entity. 541 * 542 * hammer2_cluster typically represents a temporary set of representitive 543 * chains. The one exception is that a hammer2_cluster is embedded in 544 * hammer2_inode. This embedded cluster is ONLY used to track the 545 * representitive chains and cannot be directly locked. 546 * 547 * A cluster is usually temporary (and thus per-thread) for locking purposes, 548 * allowing us to embed the asynchronous storage required for cluster 549 * operations in the cluster itself and adjust the state and status without 550 * having to worry too much about SMP issues. 551 * 552 * The exception is the cluster embedded in the hammer2_inode structure. 553 * This is used to cache the cluster state on an inode-by-inode basis. 554 * Individual hammer2_chain structures not incorporated into clusters might 555 * also stick around to cache miscellanious elements. 556 * 557 * Because the cluster is a 'working copy' and is usually subject to cluster 558 * quorum rules, it is quite possible for us to end up with an insufficient 559 * number of live chains to execute an operation. If an insufficient number 560 * of chains remain in a working copy, the operation may have to be 561 * downgraded, retried, stall until the requisit number of chains are 562 * available, or possibly even error out depending on the mount type. 563 * 564 * A cluster's focus is set when it is locked. The focus can only be set 565 * to a chain still part of the synchronized set. 566 */ 567 #define HAMMER2_MAXCLUSTER 8 568 #define HAMMER2_XOPFIFO 16 569 #define HAMMER2_XOPFIFO_MASK (HAMMER2_XOPFIFO - 1) 570 #define HAMMER2_XOPGROUPS 16 571 #define HAMMER2_XOPGROUPS_MASK (HAMMER2_XOPGROUPS - 1) 572 #define HAMMER2_XOPMASK_VOP 0x80000000U 573 574 struct hammer2_cluster_item { 575 hammer2_chain_t *chain; 576 int cache_index; 577 uint32_t flags; 578 }; 579 580 typedef struct hammer2_cluster_item hammer2_cluster_item_t; 581 582 /* 583 * INVALID - Invalid for focus, i.e. not part of synchronized set. 584 * Once set, this bit is sticky across operations. 585 * 586 * FEMOD - Indicates that front-end modifying operations can 587 * mess with this entry and MODSYNC will copy also 588 * effect it. 589 */ 590 #define HAMMER2_CITEM_INVALID 0x00000001 591 #define HAMMER2_CITEM_FEMOD 0x00000002 592 #define HAMMER2_CITEM_NULL 0x00000004 593 594 struct hammer2_cluster { 595 int refs; /* track for deallocation */ 596 int ddflag; 597 struct hammer2_pfs *pmp; 598 uint32_t flags; 599 int nchains; 600 int error; /* error code valid on lock */ 601 int focus_index; 602 hammer2_iocb_t iocb; 603 hammer2_chain_t *focus; /* current focus (or mod) */ 604 hammer2_cluster_item_t array[HAMMER2_MAXCLUSTER]; 605 }; 606 607 typedef struct hammer2_cluster hammer2_cluster_t; 608 609 /* 610 * WRHARD - Hard mounts can write fully synchronized 611 * RDHARD - Hard mounts can read fully synchronized 612 * UNHARD - Unsynchronized masters present 613 * NOHARD - No masters visible 614 * WRSOFT - Soft mounts can write to at least the SOFT_MASTER 615 * RDSOFT - Soft mounts can read from at least a SOFT_SLAVE 616 * UNSOFT - Unsynchronized slaves present 617 * NOSOFT - No slaves visible 618 * RDSLAVE - slaves are accessible (possibly unsynchronized or remote). 619 * MSYNCED - All masters are fully synchronized 620 * SSYNCED - All known local slaves are fully synchronized to masters 621 * 622 * All available masters are always incorporated. All PFSs belonging to a 623 * cluster (master, slave, copy, whatever) always try to synchronize the 624 * total number of known masters in the PFSs root inode. 625 * 626 * A cluster might have access to many slaves, copies, or caches, but we 627 * have a limited number of cluster slots. Any such elements which are 628 * directly mounted from block device(s) will always be incorporated. Note 629 * that SSYNCED only applies to such elements which are directly mounted, 630 * not to any remote slaves, copies, or caches that could be available. These 631 * bits are used to monitor and drive our synchronization threads. 632 * 633 * When asking the question 'is any data accessible at all', then a simple 634 * test against (RDHARD|RDSOFT|RDSLAVE) gives you the answer. If any of 635 * these bits are set the object can be read with certain caveats: 636 * RDHARD - no caveats. RDSOFT - authoritative but might not be synchronized. 637 * and RDSLAVE - not authoritative, has some data but it could be old or 638 * incomplete. 639 * 640 * When both soft and hard mounts are available, data will be read and written 641 * via the soft mount only. But all might be in the cluster because 642 * background synchronization threads still need to do their work. 643 */ 644 #define HAMMER2_CLUSTER_INODE 0x00000001 /* embedded in inode struct */ 645 #define HAMMER2_CLUSTER_UNUSED2 0x00000002 646 #define HAMMER2_CLUSTER_LOCKED 0x00000004 /* cluster lks not recursive */ 647 #define HAMMER2_CLUSTER_WRHARD 0x00000100 /* hard-mount can write */ 648 #define HAMMER2_CLUSTER_RDHARD 0x00000200 /* hard-mount can read */ 649 #define HAMMER2_CLUSTER_UNHARD 0x00000400 /* unsynchronized masters */ 650 #define HAMMER2_CLUSTER_NOHARD 0x00000800 /* no masters visible */ 651 #define HAMMER2_CLUSTER_WRSOFT 0x00001000 /* soft-mount can write */ 652 #define HAMMER2_CLUSTER_RDSOFT 0x00002000 /* soft-mount can read */ 653 #define HAMMER2_CLUSTER_UNSOFT 0x00004000 /* unsynchronized slaves */ 654 #define HAMMER2_CLUSTER_NOSOFT 0x00008000 /* no slaves visible */ 655 #define HAMMER2_CLUSTER_MSYNCED 0x00010000 /* all masters synchronized */ 656 #define HAMMER2_CLUSTER_SSYNCED 0x00020000 /* known slaves synchronized */ 657 658 #define HAMMER2_CLUSTER_ANYDATA ( HAMMER2_CLUSTER_RDHARD | \ 659 HAMMER2_CLUSTER_RDSOFT | \ 660 HAMMER2_CLUSTER_RDSLAVE) 661 662 #define HAMMER2_CLUSTER_RDOK ( HAMMER2_CLUSTER_RDHARD | \ 663 HAMMER2_CLUSTER_RDSOFT) 664 665 #define HAMMER2_CLUSTER_WROK ( HAMMER2_CLUSTER_WRHARD | \ 666 HAMMER2_CLUSTER_WRSOFT) 667 668 #define HAMMER2_CLUSTER_ZFLAGS ( HAMMER2_CLUSTER_WRHARD | \ 669 HAMMER2_CLUSTER_RDHARD | \ 670 HAMMER2_CLUSTER_WRSOFT | \ 671 HAMMER2_CLUSTER_RDSOFT | \ 672 HAMMER2_CLUSTER_MSYNCED | \ 673 HAMMER2_CLUSTER_SSYNCED) 674 675 /* 676 * Helper functions (cluster must be locked for flags to be valid). 677 */ 678 static __inline 679 int 680 hammer2_cluster_rdok(hammer2_cluster_t *cluster) 681 { 682 return (cluster->flags & HAMMER2_CLUSTER_RDOK); 683 } 684 685 static __inline 686 int 687 hammer2_cluster_wrok(hammer2_cluster_t *cluster) 688 { 689 return (cluster->flags & HAMMER2_CLUSTER_WROK); 690 } 691 692 RB_HEAD(hammer2_inode_tree, hammer2_inode); 693 694 /* 695 * A hammer2 inode. 696 * 697 * NOTE: The inode-embedded cluster is never used directly for I/O (since 698 * it may be shared). Instead it will be replicated-in and synchronized 699 * back out if changed. 700 */ 701 struct hammer2_inode { 702 RB_ENTRY(hammer2_inode) rbnode; /* inumber lookup (HL) */ 703 hammer2_mtx_t lock; /* inode lock */ 704 struct hammer2_pfs *pmp; /* PFS mount */ 705 struct hammer2_inode *pip; /* parent inode */ 706 struct vnode *vp; 707 struct spinlock cluster_spin; /* update cluster */ 708 hammer2_cluster_t cluster; 709 struct lockf advlock; 710 u_int flags; 711 u_int refs; /* +vpref, +flushref */ 712 uint8_t comp_heuristic; 713 hammer2_inode_meta_t meta; /* copy of meta-data */ 714 hammer2_off_t osize; 715 }; 716 717 typedef struct hammer2_inode hammer2_inode_t; 718 719 /* 720 * MODIFIED - Inode is in a modified state, ip->meta may have changes. 721 * RESIZED - Inode truncated (any) or inode extended beyond 722 * EMBEDDED_BYTES. 723 */ 724 #define HAMMER2_INODE_MODIFIED 0x0001 725 #define HAMMER2_INODE_SROOT 0x0002 /* kmalloc special case */ 726 #define HAMMER2_INODE_RENAME_INPROG 0x0004 727 #define HAMMER2_INODE_ONRBTREE 0x0008 728 #define HAMMER2_INODE_RESIZED 0x0010 /* requires inode_fsync */ 729 #define HAMMER2_INODE_ISDELETED 0x0020 /* deleted, not in ihidden */ 730 #define HAMMER2_INODE_ISUNLINKED 0x0040 731 #define HAMMER2_INODE_METAGOOD 0x0080 /* inode meta-data good */ 732 #define HAMMER2_INODE_ONSIDEQ 0x0100 /* on side processing queue */ 733 734 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2); 735 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp, 736 hammer2_tid_t); 737 738 /* 739 * inode-unlink side-structure 740 */ 741 struct hammer2_inode_sideq { 742 TAILQ_ENTRY(hammer2_inode_sideq) entry; 743 hammer2_inode_t *ip; 744 }; 745 TAILQ_HEAD(h2_sideq_list, hammer2_inode_sideq); 746 747 typedef struct hammer2_inode_sideq hammer2_inode_sideq_t; 748 749 /* 750 * Transaction management sub-structure under hammer2_pfs 751 */ 752 struct hammer2_trans { 753 uint32_t flags; 754 uint32_t sync_wait; 755 }; 756 757 typedef struct hammer2_trans hammer2_trans_t; 758 759 #define HAMMER2_TRANS_ISFLUSH 0x80000000 /* flush code */ 760 #define HAMMER2_TRANS_BUFCACHE 0x40000000 /* bio strategy */ 761 #define HAMMER2_TRANS_PREFLUSH 0x20000000 /* preflush state */ 762 #define HAMMER2_TRANS_FPENDING 0x10000000 /* flush pending */ 763 #define HAMMER2_TRANS_WAITING 0x08000000 /* someone waiting */ 764 #define HAMMER2_TRANS_MASK 0x00FFFFFF /* count mask */ 765 766 #define HAMMER2_FREEMAP_HEUR_NRADIX 4 /* pwr 2 PBUFRADIX-MINIORADIX */ 767 #define HAMMER2_FREEMAP_HEUR_TYPES 8 768 #define HAMMER2_FREEMAP_HEUR_SIZE (HAMMER2_FREEMAP_HEUR_NRADIX * \ 769 HAMMER2_FREEMAP_HEUR_TYPES) 770 771 #define HAMMER2_DEDUP_HEUR_SIZE 65536 772 #define HAMMER2_DEDUP_HEUR_MASK (HAMMER2_DEDUP_HEUR_SIZE - 1) 773 774 #define HAMMER2_FLUSH_TOP 0x0001 775 #define HAMMER2_FLUSH_ALL 0x0002 776 777 778 /* 779 * Hammer2 support thread element. 780 * 781 * Potentially many support threads can hang off of hammer2, primarily 782 * off the hammer2_pfs structure. Typically: 783 * 784 * td x Nodes A synchronization thread for each node. 785 * td x Nodes x workers Worker threads for frontend operations. 786 * td x 1 Bioq thread for logical buffer writes. 787 * 788 * In addition, the synchronization thread(s) associated with the 789 * super-root PFS (spmp) for a node is responsible for automatic bulkfree 790 * and dedup scans. 791 */ 792 struct hammer2_thread { 793 struct hammer2_pfs *pmp; 794 hammer2_xop_list_t *xopq; /* points into pmp->xopq[] */ 795 thread_t td; 796 uint32_t flags; 797 int depth; 798 int clindex; /* cluster element index */ 799 int repidx; 800 struct lock lk; /* thread control lock */ 801 }; 802 803 typedef struct hammer2_thread hammer2_thread_t; 804 805 #define HAMMER2_THREAD_UNMOUNTING 0x0001 /* unmount request */ 806 #define HAMMER2_THREAD_DEV 0x0002 /* related to dev, not pfs */ 807 #define HAMMER2_THREAD_UNUSED04 0x0004 808 #define HAMMER2_THREAD_REMASTER 0x0008 /* remaster request */ 809 #define HAMMER2_THREAD_STOP 0x0010 /* exit request */ 810 #define HAMMER2_THREAD_FREEZE 0x0020 /* force idle */ 811 #define HAMMER2_THREAD_FROZEN 0x0040 /* restart */ 812 813 /* 814 * Support structure for dedup heuristic. 815 */ 816 struct hammer2_dedup { 817 hammer2_off_t data_off; 818 uint32_t data_crc; 819 uint32_t ticks; 820 }; 821 822 typedef struct hammer2_dedup hammer2_dedup_t; 823 824 /* 825 * hammer2_xop - container for VOP/XOP operation (allocated, not on stack). 826 * 827 * This structure is used to distribute a VOP operation across multiple 828 * nodes. It provides a rendezvous for concurrent node execution and 829 * can be detached from the frontend operation to allow the frontend to 830 * return early. 831 * 832 * This structure also sequences operations on up to three inodes. 833 */ 834 typedef void (*hammer2_xop_func_t)(union hammer2_xop *xop, int clidx); 835 836 struct hammer2_xop_fifo { 837 TAILQ_ENTRY(hammer2_xop_head) entry; 838 hammer2_chain_t *array[HAMMER2_XOPFIFO]; 839 int errors[HAMMER2_XOPFIFO]; 840 int ri; 841 int wi; 842 int flags; 843 }; 844 845 typedef struct hammer2_xop_fifo hammer2_xop_fifo_t; 846 847 #define HAMMER2_XOP_FIFO_RUN 0x0001 848 849 struct hammer2_xop_head { 850 hammer2_xop_func_t func; 851 hammer2_tid_t mtid; 852 struct hammer2_inode *ip1; 853 struct hammer2_inode *ip2; 854 struct hammer2_inode *ip3; 855 uint32_t check_counter; 856 uint32_t run_mask; 857 uint32_t chk_mask; 858 int state; 859 int error; 860 hammer2_key_t collect_key; 861 char *name1; 862 size_t name1_len; 863 char *name2; 864 size_t name2_len; 865 hammer2_xop_fifo_t collect[HAMMER2_MAXCLUSTER]; 866 hammer2_cluster_t cluster; /* help collections */ 867 }; 868 869 typedef struct hammer2_xop_head hammer2_xop_head_t; 870 871 struct hammer2_xop_ipcluster { 872 hammer2_xop_head_t head; 873 }; 874 875 struct hammer2_xop_strategy { 876 hammer2_xop_head_t head; 877 hammer2_key_t lbase; 878 int finished; 879 hammer2_mtx_t lock; 880 struct bio *bio; 881 }; 882 883 struct hammer2_xop_readdir { 884 hammer2_xop_head_t head; 885 hammer2_key_t lkey; 886 }; 887 888 struct hammer2_xop_nresolve { 889 hammer2_xop_head_t head; 890 hammer2_key_t lhc; /* if name is NULL used lhc */ 891 }; 892 893 struct hammer2_xop_nlink { 894 hammer2_xop_head_t head; 895 }; 896 897 struct hammer2_xop_unlink { 898 hammer2_xop_head_t head; 899 int isdir; 900 int dopermanent; 901 }; 902 903 struct hammer2_xop_nrename { 904 hammer2_xop_head_t head; 905 hammer2_tid_t lhc; 906 int ip_key; 907 }; 908 909 struct hammer2_xop_scanlhc { 910 hammer2_xop_head_t head; 911 hammer2_key_t lhc; 912 }; 913 914 struct hammer2_xop_scanall { 915 hammer2_xop_head_t head; 916 hammer2_key_t key_beg; /* inclusive */ 917 hammer2_key_t key_end; /* inclusive */ 918 }; 919 920 struct hammer2_xop_lookup { 921 hammer2_xop_head_t head; 922 hammer2_key_t lhc; 923 }; 924 925 struct hammer2_xop_create { 926 hammer2_xop_head_t head; 927 hammer2_inode_meta_t meta; /* initial metadata */ 928 hammer2_key_t lhc; 929 int flags; 930 }; 931 932 struct hammer2_xop_destroy { 933 hammer2_xop_head_t head; 934 }; 935 936 struct hammer2_xop_fsync { 937 hammer2_xop_head_t head; 938 hammer2_inode_meta_t meta; 939 hammer2_off_t osize; 940 u_int ipflags; 941 int clear_directdata; 942 }; 943 944 struct hammer2_xop_unlinkall { 945 hammer2_xop_head_t head; 946 hammer2_key_t key_beg; 947 hammer2_key_t key_end; 948 }; 949 950 struct hammer2_xop_connect { 951 hammer2_xop_head_t head; 952 hammer2_key_t lhc; 953 }; 954 955 struct hammer2_xop_flush { 956 hammer2_xop_head_t head; 957 }; 958 959 typedef struct hammer2_xop_readdir hammer2_xop_readdir_t; 960 typedef struct hammer2_xop_nresolve hammer2_xop_nresolve_t; 961 typedef struct hammer2_xop_nlink hammer2_xop_nlink_t; 962 typedef struct hammer2_xop_unlink hammer2_xop_unlink_t; 963 typedef struct hammer2_xop_nrename hammer2_xop_nrename_t; 964 typedef struct hammer2_xop_ipcluster hammer2_xop_ipcluster_t; 965 typedef struct hammer2_xop_strategy hammer2_xop_strategy_t; 966 typedef struct hammer2_xop_create hammer2_xop_create_t; 967 typedef struct hammer2_xop_destroy hammer2_xop_destroy_t; 968 typedef struct hammer2_xop_fsync hammer2_xop_fsync_t; 969 typedef struct hammer2_xop_unlinkall hammer2_xop_unlinkall_t; 970 typedef struct hammer2_xop_scanlhc hammer2_xop_scanlhc_t; 971 typedef struct hammer2_xop_scanall hammer2_xop_scanall_t; 972 typedef struct hammer2_xop_lookup hammer2_xop_lookup_t; 973 typedef struct hammer2_xop_connect hammer2_xop_connect_t; 974 typedef struct hammer2_xop_flush hammer2_xop_flush_t; 975 976 union hammer2_xop { 977 hammer2_xop_head_t head; 978 hammer2_xop_ipcluster_t xop_ipcluster; 979 hammer2_xop_readdir_t xop_readdir; 980 hammer2_xop_nresolve_t xop_nresolve; 981 hammer2_xop_nlink_t xop_nlink; 982 hammer2_xop_unlink_t xop_unlink; 983 hammer2_xop_nrename_t xop_nrename; 984 hammer2_xop_strategy_t xop_strategy; 985 hammer2_xop_create_t xop_create; 986 hammer2_xop_destroy_t xop_destroy; 987 hammer2_xop_fsync_t xop_fsync; 988 hammer2_xop_unlinkall_t xop_unlinkall; 989 hammer2_xop_scanlhc_t xop_scanlhc; 990 hammer2_xop_scanall_t xop_scanall; 991 hammer2_xop_lookup_t xop_lookup; 992 hammer2_xop_flush_t xop_flush; 993 hammer2_xop_connect_t xop_connect; 994 }; 995 996 typedef union hammer2_xop hammer2_xop_t; 997 998 /* 999 * hammer2_xop_group - Manage XOP support threads. 1000 */ 1001 struct hammer2_xop_group { 1002 hammer2_thread_t thrs[HAMMER2_MAXCLUSTER]; 1003 }; 1004 1005 typedef struct hammer2_xop_group hammer2_xop_group_t; 1006 1007 /* 1008 * flags to hammer2_xop_collect() 1009 */ 1010 #define HAMMER2_XOP_COLLECT_NOWAIT 0x00000001 1011 #define HAMMER2_XOP_COLLECT_WAITALL 0x00000002 1012 1013 /* 1014 * flags to hammer2_xop_alloc() 1015 * 1016 * MODIFYING - This is a modifying transaction, allocate a mtid. 1017 */ 1018 #define HAMMER2_XOP_MODIFYING 0x00000001 1019 1020 /* 1021 * Global (per partition) management structure, represents a hard block 1022 * device. Typically referenced by hammer2_chain structures when applicable. 1023 * Typically not used for network-managed elements. 1024 * 1025 * Note that a single hammer2_dev can be indirectly tied to multiple system 1026 * mount points. There is no direct relationship. System mounts are 1027 * per-cluster-id, not per-block-device, and a single hard mount might contain 1028 * many PFSs and those PFSs might combine together in various ways to form 1029 * the set of available clusters. 1030 */ 1031 struct hammer2_dev { 1032 struct vnode *devvp; /* device vnode */ 1033 int ronly; /* read-only mount */ 1034 int mount_count; /* number of actively mounted PFSs */ 1035 TAILQ_ENTRY(hammer2_dev) mntentry; /* hammer2_mntlist */ 1036 1037 struct malloc_type *mchain; 1038 int nipstacks; 1039 int maxipstacks; 1040 kdmsg_iocom_t iocom; /* volume-level dmsg interface */ 1041 struct spinlock io_spin; /* iotree access */ 1042 struct hammer2_io_tree iotree; 1043 int iofree_count; 1044 hammer2_chain_t vchain; /* anchor chain (topology) */ 1045 hammer2_chain_t fchain; /* anchor chain (freemap) */ 1046 struct spinlock list_spin; 1047 struct h2_flush_list flushq; /* flush seeds */ 1048 struct hammer2_pfs *spmp; /* super-root pmp for transactions */ 1049 struct lock bulklk; /* bulkfree lock */ 1050 struct lock vollk; /* lockmgr lock */ 1051 hammer2_off_t heur_freemap[HAMMER2_FREEMAP_HEUR_SIZE]; 1052 hammer2_dedup_t heur_dedup[HAMMER2_DEDUP_HEUR_SIZE]; 1053 int volhdrno; /* last volhdrno written */ 1054 char devrepname[64]; /* for kprintf */ 1055 hammer2_volume_data_t voldata; 1056 hammer2_volume_data_t volsync; /* synchronized voldata */ 1057 }; 1058 1059 typedef struct hammer2_dev hammer2_dev_t; 1060 1061 /* 1062 * Helper functions (cluster must be locked for flags to be valid). 1063 */ 1064 static __inline 1065 int 1066 hammer2_chain_rdok(hammer2_chain_t *chain) 1067 { 1068 return (chain->error == 0); 1069 } 1070 1071 static __inline 1072 int 1073 hammer2_chain_wrok(hammer2_chain_t *chain) 1074 { 1075 return (chain->error == 0 && chain->hmp->ronly == 0); 1076 } 1077 1078 /* 1079 * Per-cluster management structure. This structure will be tied to a 1080 * system mount point if the system is mounting the PFS, but is also used 1081 * to manage clusters encountered during the super-root scan or received 1082 * via LNK_SPANs that might not be mounted. 1083 * 1084 * This structure is also used to represent the super-root that hangs off 1085 * of a hard mount point. The super-root is not really a cluster element. 1086 * In this case the spmp_hmp field will be non-NULL. It's just easier to do 1087 * this than to special case super-root manipulation in the hammer2_chain* 1088 * code as being only hammer2_dev-related. 1089 * 1090 * pfs_mode and pfs_nmasters are rollup fields which critically describes 1091 * how elements of the cluster act on the cluster. pfs_mode is only applicable 1092 * when a PFS is mounted by the system. pfs_nmasters is our best guess as to 1093 * how many masters have been configured for a cluster and is always 1094 * applicable. pfs_types[] is an array with 1:1 correspondance to the 1095 * iroot cluster and describes the PFS types of the nodes making up the 1096 * cluster. 1097 * 1098 * WARNING! Portions of this structure have deferred initialization. In 1099 * particular, if not mounted there will be no ihidden or wthread. 1100 * umounted network PFSs will also be missing iroot and numerous 1101 * other fields will not be initialized prior to mount. 1102 * 1103 * Synchronization threads are chain-specific and only applicable 1104 * to local hard PFS entries. A hammer2_pfs structure may contain 1105 * more than one when multiple hard PFSs are present on the local 1106 * machine which require synchronization monitoring. Most PFSs 1107 * (such as snapshots) are 1xMASTER PFSs which do not need a 1108 * synchronization thread. 1109 * 1110 * WARNING! The chains making up pfs->iroot's cluster are accounted for in 1111 * hammer2_dev->mount_count when the pfs is associated with a mount 1112 * point. 1113 */ 1114 struct hammer2_pfs { 1115 struct mount *mp; 1116 TAILQ_ENTRY(hammer2_pfs) mntentry; /* hammer2_pfslist */ 1117 uuid_t pfs_clid; 1118 hammer2_dev_t *spmp_hmp; /* only if super-root pmp */ 1119 hammer2_inode_t *iroot; /* PFS root inode */ 1120 hammer2_inode_t *ihidden; /* PFS hidden directory */ 1121 uint8_t pfs_types[HAMMER2_MAXCLUSTER]; 1122 char *pfs_names[HAMMER2_MAXCLUSTER]; 1123 hammer2_dev_t *pfs_hmps[HAMMER2_MAXCLUSTER]; 1124 hammer2_trans_t trans; 1125 struct lock lock; /* PFS lock for certain ops */ 1126 struct netexport export; /* nfs export */ 1127 int ronly; /* read-only mount */ 1128 struct malloc_type *minode; 1129 struct malloc_type *mmsg; 1130 struct spinlock inum_spin; /* inumber lookup */ 1131 struct hammer2_inode_tree inum_tree; /* (not applicable to spmp) */ 1132 hammer2_tid_t modify_tid; /* modify transaction id */ 1133 hammer2_tid_t inode_tid; /* inode allocator */ 1134 uint8_t pfs_nmasters; /* total masters */ 1135 uint8_t pfs_mode; /* operating mode PFSMODE */ 1136 uint8_t unused01; 1137 uint8_t unused02; 1138 int xop_iterator; 1139 long inmem_inodes; 1140 uint32_t inmem_dirty_chains; 1141 int count_lwinprog; /* logical write in prog */ 1142 struct spinlock list_spin; 1143 struct h2_sideq_list sideq; /* last-close dirty/unlink */ 1144 hammer2_thread_t sync_thrs[HAMMER2_MAXCLUSTER]; 1145 uint32_t cluster_flags; /* cached cluster flags */ 1146 int has_xop_threads; 1147 struct spinlock xop_spin; /* xop sequencer */ 1148 hammer2_xop_group_t xop_groups[HAMMER2_XOPGROUPS]; 1149 hammer2_xop_list_t xopq[HAMMER2_MAXCLUSTER]; 1150 }; 1151 1152 typedef struct hammer2_pfs hammer2_pfs_t; 1153 1154 #define HAMMER2_DIRTYCHAIN_WAITING 0x80000000 1155 #define HAMMER2_DIRTYCHAIN_MASK 0x7FFFFFFF 1156 1157 #define HAMMER2_LWINPROG_WAITING 0x80000000 1158 #define HAMMER2_LWINPROG_WAITING0 0x40000000 1159 #define HAMMER2_LWINPROG_MASK 0x3FFFFFFF 1160 1161 /* 1162 * hammer2_cluster_check 1163 */ 1164 #define HAMMER2_CHECK_NULL 0x00000001 1165 1166 /* 1167 * Bulkscan 1168 */ 1169 #define HAMMER2_BULK_ABORT 0x00000001 1170 1171 /* 1172 * Misc 1173 */ 1174 #if defined(_KERNEL) 1175 1176 MALLOC_DECLARE(M_HAMMER2); 1177 1178 #define VTOI(vp) ((hammer2_inode_t *)(vp)->v_data) 1179 #define ITOV(ip) ((ip)->vp) 1180 1181 /* 1182 * Currently locked chains retain the locked buffer cache buffer for 1183 * indirect blocks, and indirect blocks can be one of two sizes. The 1184 * device buffer has to match the case to avoid deadlocking recursive 1185 * chains that might otherwise try to access different offsets within 1186 * the same device buffer. 1187 */ 1188 static __inline 1189 int 1190 hammer2_devblkradix(int radix) 1191 { 1192 #if 0 1193 if (radix <= HAMMER2_LBUFRADIX) { 1194 return (HAMMER2_LBUFRADIX); 1195 } else { 1196 return (HAMMER2_PBUFRADIX); 1197 } 1198 #endif 1199 return (HAMMER2_PBUFRADIX); 1200 } 1201 1202 /* 1203 * XXX almost time to remove this. DIO uses PBUFSIZE exclusively now. 1204 */ 1205 static __inline 1206 size_t 1207 hammer2_devblksize(size_t bytes) 1208 { 1209 #if 0 1210 if (bytes <= HAMMER2_LBUFSIZE) { 1211 return(HAMMER2_LBUFSIZE); 1212 } else { 1213 KKASSERT(bytes <= HAMMER2_PBUFSIZE && 1214 (bytes ^ (bytes - 1)) == ((bytes << 1) - 1)); 1215 return (HAMMER2_PBUFSIZE); 1216 } 1217 #endif 1218 return (HAMMER2_PBUFSIZE); 1219 } 1220 1221 1222 static __inline 1223 hammer2_pfs_t * 1224 MPTOPMP(struct mount *mp) 1225 { 1226 return ((hammer2_pfs_t *)mp->mnt_data); 1227 } 1228 1229 #define LOCKSTART int __nlocks = curthread->td_locks 1230 #define LOCKENTER (++curthread->td_locks) 1231 #define LOCKEXIT (--curthread->td_locks) 1232 #define LOCKSTOP KKASSERT(curthread->td_locks == __nlocks) 1233 1234 extern struct vop_ops hammer2_vnode_vops; 1235 extern struct vop_ops hammer2_spec_vops; 1236 extern struct vop_ops hammer2_fifo_vops; 1237 1238 extern int hammer2_debug; 1239 extern int hammer2_cluster_enable; 1240 extern int hammer2_hardlink_enable; 1241 extern int hammer2_flush_pipe; 1242 extern int hammer2_synchronous_flush; 1243 extern int hammer2_dio_count; 1244 extern long hammer2_limit_dirty_chains; 1245 extern long hammer2_iod_file_read; 1246 extern long hammer2_iod_meta_read; 1247 extern long hammer2_iod_indr_read; 1248 extern long hammer2_iod_fmap_read; 1249 extern long hammer2_iod_volu_read; 1250 extern long hammer2_iod_file_write; 1251 extern long hammer2_iod_file_wembed; 1252 extern long hammer2_iod_file_wzero; 1253 extern long hammer2_iod_file_wdedup; 1254 extern long hammer2_iod_meta_write; 1255 extern long hammer2_iod_indr_write; 1256 extern long hammer2_iod_fmap_write; 1257 extern long hammer2_iod_volu_write; 1258 extern long hammer2_ioa_file_read; 1259 extern long hammer2_ioa_meta_read; 1260 extern long hammer2_ioa_indr_read; 1261 extern long hammer2_ioa_fmap_read; 1262 extern long hammer2_ioa_volu_read; 1263 extern long hammer2_ioa_file_write; 1264 extern long hammer2_ioa_meta_write; 1265 extern long hammer2_ioa_indr_write; 1266 extern long hammer2_ioa_fmap_write; 1267 extern long hammer2_ioa_volu_write; 1268 1269 extern struct objcache *cache_buffer_read; 1270 extern struct objcache *cache_buffer_write; 1271 extern struct objcache *cache_xops; 1272 1273 /* 1274 * hammer2_subr.c 1275 */ 1276 #define hammer2_icrc32(buf, size) iscsi_crc32((buf), (size)) 1277 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc)) 1278 1279 int hammer2_signal_check(time_t *timep); 1280 const char *hammer2_error_str(int error); 1281 1282 void hammer2_inode_lock(hammer2_inode_t *ip, int how); 1283 void hammer2_inode_unlock(hammer2_inode_t *ip); 1284 hammer2_chain_t *hammer2_inode_chain(hammer2_inode_t *ip, int clindex, int how); 1285 hammer2_chain_t *hammer2_inode_chain_and_parent(hammer2_inode_t *ip, 1286 int clindex, hammer2_chain_t **parentp, int how); 1287 hammer2_mtx_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip); 1288 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip, 1289 hammer2_mtx_state_t ostate); 1290 int hammer2_inode_lock_upgrade(hammer2_inode_t *ip); 1291 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, int); 1292 1293 void hammer2_dev_exlock(hammer2_dev_t *hmp); 1294 void hammer2_dev_shlock(hammer2_dev_t *hmp); 1295 void hammer2_dev_unlock(hammer2_dev_t *hmp); 1296 1297 int hammer2_get_dtype(const hammer2_inode_data_t *ipdata); 1298 int hammer2_get_vtype(uint8_t type); 1299 u_int8_t hammer2_get_obj_type(enum vtype vtype); 1300 void hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts); 1301 u_int64_t hammer2_timespec_to_time(const struct timespec *ts); 1302 u_int32_t hammer2_to_unix_xid(const uuid_t *uuid); 1303 void hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid); 1304 void hammer2_trans_manage_init(hammer2_pfs_t *pmp); 1305 1306 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len); 1307 int hammer2_getradix(size_t bytes); 1308 1309 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff, 1310 hammer2_key_t *lbasep, hammer2_key_t *leofp); 1311 int hammer2_calc_physical(hammer2_inode_t *ip, hammer2_key_t lbase); 1312 void hammer2_update_time(uint64_t *timep); 1313 void hammer2_adjreadcounter(hammer2_blockref_t *bref, size_t bytes); 1314 1315 /* 1316 * hammer2_inode.c 1317 */ 1318 struct vnode *hammer2_igetv(hammer2_inode_t *ip, int *errorp); 1319 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfs_t *pmp, 1320 hammer2_tid_t inum); 1321 hammer2_inode_t *hammer2_inode_get(hammer2_pfs_t *pmp, hammer2_inode_t *dip, 1322 hammer2_cluster_t *cluster, int idx); 1323 void hammer2_inode_free(hammer2_inode_t *ip); 1324 void hammer2_inode_ref(hammer2_inode_t *ip); 1325 void hammer2_inode_drop(hammer2_inode_t *ip); 1326 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip, 1327 hammer2_cluster_t *cluster); 1328 void hammer2_inode_repoint_one(hammer2_inode_t *ip, hammer2_cluster_t *cluster, 1329 int idx); 1330 void hammer2_inode_modify(hammer2_inode_t *ip); 1331 void hammer2_inode_run_sideq(hammer2_pfs_t *pmp); 1332 1333 hammer2_inode_t *hammer2_inode_create(hammer2_inode_t *dip, 1334 struct vattr *vap, struct ucred *cred, 1335 const uint8_t *name, size_t name_len, hammer2_key_t lhc, 1336 hammer2_key_t inum, uint8_t type, uint8_t target_type, 1337 int flags, int *errorp); 1338 int hammer2_inode_connect(hammer2_inode_t *dip, hammer2_inode_t *ip, 1339 const char *name, size_t name_len, 1340 hammer2_key_t lhc); 1341 hammer2_inode_t *hammer2_inode_common_parent(hammer2_inode_t *fdip, 1342 hammer2_inode_t *tdip); 1343 void hammer2_inode_chain_sync(hammer2_inode_t *ip); 1344 int hammer2_inode_unlink_finisher(hammer2_inode_t *ip, int isopen); 1345 void hammer2_inode_install_hidden(hammer2_pfs_t *pmp); 1346 1347 /* 1348 * hammer2_chain.c 1349 */ 1350 void hammer2_voldata_lock(hammer2_dev_t *hmp); 1351 void hammer2_voldata_unlock(hammer2_dev_t *hmp); 1352 void hammer2_voldata_modify(hammer2_dev_t *hmp); 1353 hammer2_chain_t *hammer2_chain_alloc(hammer2_dev_t *hmp, 1354 hammer2_pfs_t *pmp, 1355 hammer2_blockref_t *bref); 1356 void hammer2_chain_core_init(hammer2_chain_t *chain); 1357 void hammer2_chain_ref(hammer2_chain_t *chain); 1358 void hammer2_chain_drop(hammer2_chain_t *chain); 1359 void hammer2_chain_lock(hammer2_chain_t *chain, int how); 1360 void hammer2_chain_load_data(hammer2_chain_t *chain); 1361 const hammer2_media_data_t *hammer2_chain_rdata(hammer2_chain_t *chain); 1362 hammer2_media_data_t *hammer2_chain_wdata(hammer2_chain_t *chain); 1363 int hammer2_chain_snapshot(hammer2_chain_t *chain, hammer2_ioc_pfs_t *pmp, 1364 hammer2_tid_t mtid); 1365 1366 int hammer2_chain_hardlink_find(hammer2_inode_t *dip, 1367 hammer2_chain_t **parentp, 1368 hammer2_chain_t **chainp, 1369 int flags); 1370 void hammer2_chain_modify(hammer2_chain_t *chain, hammer2_tid_t mtid, 1371 hammer2_off_t dedup_off, int flags); 1372 void hammer2_chain_modify_ip(hammer2_inode_t *ip, hammer2_chain_t *chain, 1373 hammer2_tid_t mtid, int flags); 1374 void hammer2_chain_resize(hammer2_inode_t *ip, hammer2_chain_t *parent, 1375 hammer2_chain_t *chain, 1376 hammer2_tid_t mtid, hammer2_off_t dedup_off, 1377 int nradix, int flags); 1378 void hammer2_chain_unlock(hammer2_chain_t *chain); 1379 void hammer2_chain_wait(hammer2_chain_t *chain); 1380 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent, int generation, 1381 hammer2_blockref_t *bref); 1382 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags); 1383 void hammer2_chain_lookup_done(hammer2_chain_t *parent); 1384 hammer2_chain_t *hammer2_chain_getparent(hammer2_chain_t **parentp, int how); 1385 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp, 1386 hammer2_key_t *key_nextp, 1387 hammer2_key_t key_beg, hammer2_key_t key_end, 1388 int *cache_indexp, int flags); 1389 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp, 1390 hammer2_chain_t *chain, 1391 hammer2_key_t *key_nextp, 1392 hammer2_key_t key_beg, hammer2_key_t key_end, 1393 int *cache_indexp, int flags); 1394 hammer2_blockref_t *hammer2_chain_scan(hammer2_chain_t *parent, 1395 hammer2_chain_t **chainp, 1396 hammer2_blockref_t *bref, 1397 int *firstp, int *cache_indexp, int flags); 1398 1399 int hammer2_chain_create(hammer2_chain_t **parentp, 1400 hammer2_chain_t **chainp, hammer2_pfs_t *pmp, 1401 hammer2_key_t key, int keybits, 1402 int type, size_t bytes, hammer2_tid_t mtid, 1403 hammer2_off_t dedup_off, int flags); 1404 void hammer2_chain_rename(hammer2_blockref_t *bref, 1405 hammer2_chain_t **parentp, 1406 hammer2_chain_t *chain, 1407 hammer2_tid_t mtid, int flags); 1408 void hammer2_chain_delete(hammer2_chain_t *parent, hammer2_chain_t *chain, 1409 hammer2_tid_t mtid, int flags); 1410 void hammer2_chain_setflush(hammer2_chain_t *chain); 1411 void hammer2_chain_countbrefs(hammer2_chain_t *chain, 1412 hammer2_blockref_t *base, int count); 1413 hammer2_chain_t *hammer2_chain_bulksnap(hammer2_chain_t *chain); 1414 void hammer2_chain_bulkdrop(hammer2_chain_t *copy); 1415 1416 void hammer2_chain_setcheck(hammer2_chain_t *chain, void *bdata); 1417 int hammer2_chain_testcheck(hammer2_chain_t *chain, void *bdata); 1418 1419 1420 void hammer2_pfs_memory_wait(hammer2_pfs_t *pmp); 1421 void hammer2_pfs_memory_inc(hammer2_pfs_t *pmp); 1422 void hammer2_pfs_memory_wakeup(hammer2_pfs_t *pmp); 1423 1424 void hammer2_base_delete(hammer2_chain_t *chain, 1425 hammer2_blockref_t *base, int count, 1426 int *cache_indexp, hammer2_chain_t *child); 1427 void hammer2_base_insert(hammer2_chain_t *chain, 1428 hammer2_blockref_t *base, int count, 1429 int *cache_indexp, hammer2_chain_t *child); 1430 1431 /* 1432 * hammer2_flush.c 1433 */ 1434 void hammer2_flush(hammer2_chain_t *chain, int istop); 1435 void hammer2_flush_quick(hammer2_dev_t *hmp); 1436 void hammer2_delayed_flush(hammer2_chain_t *chain); 1437 1438 /* 1439 * hammer2_trans.c 1440 */ 1441 void hammer2_trans_init(hammer2_pfs_t *pmp, uint32_t flags); 1442 hammer2_tid_t hammer2_trans_sub(hammer2_pfs_t *pmp); 1443 void hammer2_trans_clear_preflush(hammer2_pfs_t *pmp); 1444 void hammer2_trans_done(hammer2_pfs_t *pmp); 1445 hammer2_tid_t hammer2_trans_newinum(hammer2_pfs_t *pmp); 1446 void hammer2_trans_assert_strategy(hammer2_pfs_t *pmp); 1447 1448 /* 1449 * hammer2_ioctl.c 1450 */ 1451 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data, 1452 int fflag, struct ucred *cred); 1453 1454 /* 1455 * hammer2_io.c 1456 */ 1457 void hammer2_io_putblk(hammer2_io_t **diop); 1458 void hammer2_io_cleanup(hammer2_dev_t *hmp, struct hammer2_io_tree *tree); 1459 char *hammer2_io_data(hammer2_io_t *dio, off_t lbase); 1460 hammer2_io_t *hammer2_io_getquick(hammer2_dev_t *hmp, off_t lbase, int lsize); 1461 void hammer2_io_getblk(hammer2_dev_t *hmp, off_t lbase, int lsize, 1462 hammer2_iocb_t *iocb); 1463 void hammer2_io_complete(hammer2_iocb_t *iocb); 1464 void hammer2_io_callback(struct bio *bio); 1465 void hammer2_iocb_wait(hammer2_iocb_t *iocb); 1466 int hammer2_io_new(hammer2_dev_t *hmp, off_t lbase, int lsize, 1467 hammer2_io_t **diop); 1468 int hammer2_io_newnz(hammer2_dev_t *hmp, off_t lbase, int lsize, 1469 hammer2_io_t **diop); 1470 int hammer2_io_newq(hammer2_dev_t *hmp, off_t lbase, int lsize, 1471 hammer2_io_t **diop); 1472 int hammer2_io_bread(hammer2_dev_t *hmp, off_t lbase, int lsize, 1473 hammer2_io_t **diop); 1474 void hammer2_io_bawrite(hammer2_io_t **diop); 1475 void hammer2_io_bdwrite(hammer2_io_t **diop); 1476 int hammer2_io_bwrite(hammer2_io_t **diop); 1477 int hammer2_io_isdirty(hammer2_io_t *dio); 1478 void hammer2_io_setdirty(hammer2_io_t *dio); 1479 void hammer2_io_setinval(hammer2_io_t *dio, u_int bytes); 1480 void hammer2_io_brelse(hammer2_io_t **diop); 1481 void hammer2_io_bqrelse(hammer2_io_t **diop); 1482 1483 /* 1484 * hammer2_thread.c 1485 */ 1486 void hammer2_thr_create(hammer2_thread_t *thr, hammer2_pfs_t *pmp, 1487 const char *id, int clindex, int repidx, 1488 void (*func)(void *arg)); 1489 void hammer2_thr_delete(hammer2_thread_t *thr); 1490 void hammer2_thr_remaster(hammer2_thread_t *thr); 1491 void hammer2_thr_freeze_async(hammer2_thread_t *thr); 1492 void hammer2_thr_freeze(hammer2_thread_t *thr); 1493 void hammer2_thr_unfreeze(hammer2_thread_t *thr); 1494 int hammer2_thr_break(hammer2_thread_t *thr); 1495 void hammer2_primary_xops_thread(void *arg); 1496 1497 /* 1498 * hammer2_thread.c (XOP API) 1499 */ 1500 void hammer2_xop_group_init(hammer2_pfs_t *pmp, hammer2_xop_group_t *xgrp); 1501 void *hammer2_xop_alloc(hammer2_inode_t *ip, int flags); 1502 void hammer2_xop_setname(hammer2_xop_head_t *xop, 1503 const char *name, size_t name_len); 1504 void hammer2_xop_setname2(hammer2_xop_head_t *xop, 1505 const char *name, size_t name_len); 1506 void hammer2_xop_setip2(hammer2_xop_head_t *xop, hammer2_inode_t *ip2); 1507 void hammer2_xop_setip3(hammer2_xop_head_t *xop, hammer2_inode_t *ip3); 1508 void hammer2_xop_reinit(hammer2_xop_head_t *xop); 1509 void hammer2_xop_helper_create(hammer2_pfs_t *pmp); 1510 void hammer2_xop_helper_cleanup(hammer2_pfs_t *pmp); 1511 void hammer2_xop_start(hammer2_xop_head_t *xop, hammer2_xop_func_t func); 1512 void hammer2_xop_start_except(hammer2_xop_head_t *xop, hammer2_xop_func_t func, 1513 int notidx); 1514 int hammer2_xop_collect(hammer2_xop_head_t *xop, int flags); 1515 void hammer2_xop_retire(hammer2_xop_head_t *xop, uint32_t mask); 1516 int hammer2_xop_active(hammer2_xop_head_t *xop); 1517 int hammer2_xop_feed(hammer2_xop_head_t *xop, hammer2_chain_t *chain, 1518 int clindex, int error); 1519 1520 /* 1521 * hammer2_synchro.c 1522 */ 1523 void hammer2_primary_sync_thread(void *arg); 1524 1525 /* 1526 * XOP backends in hammer2_xops.c, primarily for VNOPS. Other XOP backends 1527 * may be integrated into other source files. 1528 */ 1529 void hammer2_xop_ipcluster(hammer2_xop_t *xop, int clidx); 1530 void hammer2_xop_readdir(hammer2_xop_t *xop, int clidx); 1531 void hammer2_xop_nresolve(hammer2_xop_t *xop, int clidx); 1532 void hammer2_xop_unlink(hammer2_xop_t *xop, int clidx); 1533 void hammer2_xop_nrename(hammer2_xop_t *xop, int clidx); 1534 void hammer2_xop_nlink(hammer2_xop_t *xop, int clidx); 1535 void hammer2_xop_scanlhc(hammer2_xop_t *xop, int clidx); 1536 void hammer2_xop_scanall(hammer2_xop_t *xop, int clidx); 1537 void hammer2_xop_lookup(hammer2_xop_t *xop, int clidx); 1538 void hammer2_inode_xop_create(hammer2_xop_t *xop, int clidx); 1539 void hammer2_inode_xop_destroy(hammer2_xop_t *xop, int clidx); 1540 void hammer2_inode_xop_chain_sync(hammer2_xop_t *xop, int clidx); 1541 void hammer2_inode_xop_unlinkall(hammer2_xop_t *xop, int clidx); 1542 void hammer2_inode_xop_connect(hammer2_xop_t *xop, int clidx); 1543 void hammer2_inode_xop_flush(hammer2_xop_t *xop, int clidx); 1544 1545 /* 1546 * hammer2_msgops.c 1547 */ 1548 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg); 1549 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg); 1550 1551 /* 1552 * hammer2_vfsops.c 1553 */ 1554 void hammer2_volconf_update(hammer2_dev_t *hmp, int index); 1555 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp, char pfx); 1556 int hammer2_vfs_sync(struct mount *mp, int waitflags); 1557 hammer2_pfs_t *hammer2_pfsalloc(hammer2_chain_t *chain, 1558 const hammer2_inode_data_t *ripdata, 1559 hammer2_tid_t modify_tid); 1560 1561 void hammer2_lwinprog_ref(hammer2_pfs_t *pmp); 1562 void hammer2_lwinprog_drop(hammer2_pfs_t *pmp); 1563 void hammer2_lwinprog_wait(hammer2_pfs_t *pmp, int pipe); 1564 1565 /* 1566 * hammer2_freemap.c 1567 */ 1568 int hammer2_freemap_alloc(hammer2_chain_t *chain, size_t bytes); 1569 void hammer2_freemap_adjust(hammer2_dev_t *hmp, 1570 hammer2_blockref_t *bref, int how); 1571 1572 /* 1573 * hammer2_cluster.c 1574 */ 1575 uint8_t hammer2_cluster_type(hammer2_cluster_t *cluster); 1576 const hammer2_media_data_t *hammer2_cluster_rdata(hammer2_cluster_t *cluster); 1577 hammer2_media_data_t *hammer2_cluster_wdata(hammer2_cluster_t *cluster); 1578 hammer2_cluster_t *hammer2_cluster_from_chain(hammer2_chain_t *chain); 1579 void hammer2_cluster_bref(hammer2_cluster_t *cluster, hammer2_blockref_t *bref); 1580 hammer2_cluster_t *hammer2_cluster_alloc(hammer2_pfs_t *pmp, 1581 hammer2_blockref_t *bref); 1582 void hammer2_cluster_ref(hammer2_cluster_t *cluster); 1583 void hammer2_cluster_drop(hammer2_cluster_t *cluster); 1584 void hammer2_cluster_lock(hammer2_cluster_t *cluster, int how); 1585 int hammer2_cluster_check(hammer2_cluster_t *cluster, hammer2_key_t lokey, 1586 int flags); 1587 void hammer2_cluster_resolve(hammer2_cluster_t *cluster); 1588 void hammer2_cluster_forcegood(hammer2_cluster_t *cluster); 1589 hammer2_cluster_t *hammer2_cluster_copy(hammer2_cluster_t *ocluster); 1590 void hammer2_cluster_unlock(hammer2_cluster_t *cluster); 1591 1592 int hammer2_bulkfree_pass(hammer2_dev_t *hmp, 1593 struct hammer2_ioc_bulkfree *bfi); 1594 1595 /* 1596 * hammer2_iocom.c 1597 */ 1598 void hammer2_iocom_init(hammer2_dev_t *hmp); 1599 void hammer2_iocom_uninit(hammer2_dev_t *hmp); 1600 void hammer2_cluster_reconnect(hammer2_dev_t *hmp, struct file *fp); 1601 1602 /* 1603 * hammer2_strategy.c 1604 */ 1605 int hammer2_vop_strategy(struct vop_strategy_args *ap); 1606 int hammer2_vop_bmap(struct vop_bmap_args *ap); 1607 void hammer2_write_thread(void *arg); 1608 void hammer2_bioq_sync(hammer2_pfs_t *pmp); 1609 void hammer2_dedup_clear(hammer2_dev_t *hmp); 1610 1611 #endif /* !_KERNEL */ 1612 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */ 1613