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