2 * Copyright (c) 2011-2018 The DragonFly Project. All rights reserved.
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>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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
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.
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
37 * HAMMER2 IN-MEMORY CACHE OF MEDIA STRUCTURES
39 * This header file contains structures used internally by the HAMMER2
40 * implementation. See hammer2_disk.h for on-disk structures.
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.
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.
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
57 * The in-memory representation may remain cached (for example in order to
58 * placemark clustering locks) even after the related data has been
62 #ifndef _VFS_HAMMER2_HAMMER2_H_
63 #define _VFS_HAMMER2_HAMMER2_H_
66 #include <sys/param.h>
68 #include <sys/types.h>
70 #include <sys/kernel.h>
74 #include <sys/systm.h>
77 #include <sys/malloc.h>
78 #include <sys/mount.h>
79 #include <sys/vnode.h>
81 #include <sys/mountctl.h>
84 #include <sys/thread.h>
85 #include <sys/globaldata.h>
86 #include <sys/lockf.h>
88 #include <sys/queue.h>
89 #include <sys/limits.h>
91 #include <sys/mutex.h>
93 #include <sys/kern_syscall.h>
97 #include <sys/signal2.h>
99 #include <sys/mutex2.h>
100 #include <sys/thread2.h>
103 #include "hammer2_xxhash.h"
104 #include "hammer2_disk.h"
105 #include "hammer2_mount.h"
106 #include "hammer2_ioctl.h"
109 struct hammer2_chain;
110 struct hammer2_cluster;
111 struct hammer2_inode;
115 struct hammer2_state;
117 struct hammer2_thread;
121 * Mutex and lock shims. Hammer2 requires support for asynchronous and
122 * abortable locks, and both exclusive and shared spinlocks. Normal
123 * synchronous non-abortable locks can be substituted for spinlocks.
125 typedef mtx_t hammer2_mtx_t;
126 typedef mtx_link_t hammer2_mtx_link_t;
127 typedef mtx_state_t hammer2_mtx_state_t;
129 typedef struct spinlock hammer2_spin_t;
131 #define hammer2_mtx_ex mtx_lock_ex_quick
132 #define hammer2_mtx_sh mtx_lock_sh_quick
133 #define hammer2_mtx_sh_again mtx_lock_sh_again
134 #define hammer2_mtx_unlock mtx_unlock
135 #define hammer2_mtx_downgrade mtx_downgrade
136 #define hammer2_mtx_owned mtx_owned
137 #define hammer2_mtx_init mtx_init
138 #define hammer2_mtx_temp_release mtx_lock_temp_release
139 #define hammer2_mtx_temp_restore mtx_lock_temp_restore
140 #define hammer2_mtx_refs mtx_lockrefs
142 #define hammer2_spin_init spin_init
143 #define hammer2_spin_sh spin_lock_shared
144 #define hammer2_spin_ex spin_lock
145 #define hammer2_spin_unsh spin_unlock_shared
146 #define hammer2_spin_unex spin_unlock
148 TAILQ_HEAD(hammer2_xop_list, hammer2_xop_head);
149 TAILQ_HEAD(hammer2_chain_list, hammer2_chain);
151 typedef struct hammer2_xop_list hammer2_xop_list_t;
155 * General lock support
159 hammer2_mtx_upgrade_try(hammer2_mtx_t *mtx)
161 return mtx_upgrade_try(mtx);
167 * The xid tracks internal transactional updates.
169 * XXX fix-me, really needs to be 64-bits
171 typedef uint32_t hammer2_xid_t;
173 #define HAMMER2_XID_MIN 0x00000000U
174 #define HAMMER2_XID_MAX 0x7FFFFFFFU
176 #define HAMMER2_LIMIT_DIRTY_CHAINS (65536)
179 * The chain structure tracks a portion of the media topology from the
180 * root (volume) down. Chains represent volumes, inodes, indirect blocks,
181 * data blocks, and freemap nodes and leafs.
183 * The chain structure utilizes a simple singly-homed topology and the
184 * chain's in-memory topology will move around as the chains do, due mainly
185 * to renames and indirect block creation.
187 * Block Table Updates
189 * Block table updates for insertions and updates are delayed until the
190 * flush. This allows us to avoid having to modify the parent chain
191 * all the way to the root.
193 * Block table deletions are performed immediately (modifying the parent
194 * in the process) because the flush code uses the chain structure to
195 * track delayed updates and the chain will be (likely) gone or moved to
196 * another location in the topology after a deletion.
198 * A prior iteration of the code tried to keep the relationship intact
199 * on deletes by doing a delete-duplicate operation on the chain, but
200 * it added way too much complexity to the codebase.
202 * Flush Synchronization
204 * The flush code must flush modified chains bottom-up. Because chain
205 * structures can shift around and are NOT topologically stable,
206 * modified chains are independently indexed for the flush. As the flush
207 * runs it modifies (or further modifies) and updates the parents,
208 * propagating the flush all the way to the volume root.
210 * Modifying front-end operations can occur during a flush but will block
211 * in two cases: (1) when the front-end tries to operate on the inode
212 * currently in the midst of being flushed and (2) if the front-end
213 * crosses an inode currently being flushed (such as during a rename).
214 * So, for example, if you rename directory "x" to "a/b/c/d/e/f/g/x" and
215 * the flusher is currently working on "a/b/c", the rename will block
216 * temporarily in order to ensure that "x" exists in one place or the
219 * Meta-data statistics are updated by the flusher. The front-end will
220 * make estimates but meta-data must be fully synchronized only during a
221 * flush in order to ensure that it remains correct across a crash.
223 * Multiple flush synchronizations can theoretically be in-flight at the
224 * same time but the implementation is not coded to handle the case and
225 * currently serializes them.
229 * Snapshots currently require the subdirectory tree being snapshotted
230 * to be flushed. The snapshot then creates a new super-root inode which
231 * copies the flushed blockdata of the directory or file that was
236 * - Note that the radix tree runs in powers of 2 only so sub-trees
237 * cannot straddle edges.
239 RB_HEAD(hammer2_chain_tree, hammer2_chain);
240 TAILQ_HEAD(h2_flush_list, hammer2_chain);
241 TAILQ_HEAD(h2_core_list, hammer2_chain);
243 #define CHAIN_CORE_DELETE_BMAP_ENTRIES \
244 (HAMMER2_PBUFSIZE / sizeof(hammer2_blockref_t) / sizeof(uint32_t))
247 * Core topology for chain (embedded in chain). Protected by a spinlock.
249 struct hammer2_chain_core {
251 struct hammer2_chain_tree rbtree; /* sub-chains */
252 int live_zero; /* blockref array opt */
253 u_int live_count; /* live (not deleted) chains in tree */
254 u_int chain_count; /* live + deleted chains under core */
255 int generation; /* generation number (inserts only) */
258 typedef struct hammer2_chain_core hammer2_chain_core_t;
260 RB_HEAD(hammer2_io_tree, hammer2_io);
263 * DIO - Management structure wrapping system buffer cache.
265 * HAMMER2 uses an I/O abstraction that allows it to cache and manipulate
266 * fixed-sized filesystem buffers frontend by variable-sized hammer2_chain
270 RB_ENTRY(hammer2_io) rbnode; /* indexed by device offset */
271 struct hammer2_dev *hmp;
276 int act; /* activity */
277 int btype; /* approximate BREF_TYPE_* */
281 uint64_t dedup_valid; /* valid for dedup operation */
282 uint64_t dedup_alloc; /* allocated / de-dupable */
285 typedef struct hammer2_io hammer2_io_t;
287 #define HAMMER2_DIO_INPROG 0x8000000000000000LLU /* bio in progress */
288 #define HAMMER2_DIO_GOOD 0x4000000000000000LLU /* dio->bp is stable */
289 #define HAMMER2_DIO_WAITING 0x2000000000000000LLU /* wait on INPROG */
290 #define HAMMER2_DIO_DIRTY 0x1000000000000000LLU /* flush last drop */
292 #define HAMMER2_DIO_MASK 0x00FFFFFFFFFFFFFFLLU
295 * Primary chain structure keeps track of the topology in-memory.
297 struct hammer2_chain {
299 hammer2_chain_core_t core;
300 RB_ENTRY(hammer2_chain) rbnode; /* live chain(s) */
301 hammer2_blockref_t bref;
302 struct hammer2_chain *parent;
303 struct hammer2_state *state; /* if active cache msg */
304 struct hammer2_dev *hmp;
305 struct hammer2_pfs *pmp; /* A PFS or super-root (spmp) */
307 hammer2_io_t *dio; /* physical data buffer */
308 u_int bytes; /* physical data size */
312 int error; /* on-lock data error state */
313 int cache_index; /* heur speeds up lookup */
315 hammer2_media_data_t *data; /* data pointer shortcut */
316 TAILQ_ENTRY(hammer2_chain) flush_node; /* flush list */
317 TAILQ_ENTRY(hammer2_chain) lru_node; /* 0-refs LRU */
320 typedef struct hammer2_chain hammer2_chain_t;
322 int hammer2_chain_cmp(hammer2_chain_t *chain1, hammer2_chain_t *chain2);
323 RB_PROTOTYPE(hammer2_chain_tree, hammer2_chain, rbnode, hammer2_chain_cmp);
326 * Special notes on flags:
328 * INITIAL - This flag allows a chain to be created and for storage to
329 * be allocated without having to immediately instantiate the
330 * related buffer. The data is assumed to be all-zeros. It
331 * is primarily used for indirect blocks.
333 * MODIFIED - The chain's media data has been modified. Prevents chain
334 * free on lastdrop if still in the topology.
336 * UPDATE - Chain might not be modified but parent blocktable needs
337 * an update. Prevents chain free on lastdrop if still in
340 * FICTITIOUS - Faked chain as a placeholder for an error condition. This
341 * chain is unsuitable for I/O.
343 * BMAPPED - Indicates that the chain is present in the parent blockmap.
345 * BMAPUPD - Indicates that the chain is present but needs to be updated
346 * in the parent blockmap.
348 #define HAMMER2_CHAIN_MODIFIED 0x00000001 /* dirty chain data */
349 #define HAMMER2_CHAIN_ALLOCATED 0x00000002 /* kmalloc'd chain */
350 #define HAMMER2_CHAIN_DESTROY 0x00000004
351 #define HAMMER2_CHAIN_DEDUPABLE 0x00000008 /* registered w/dedup */
352 #define HAMMER2_CHAIN_DELETED 0x00000010 /* deleted chain */
353 #define HAMMER2_CHAIN_INITIAL 0x00000020 /* initial create */
354 #define HAMMER2_CHAIN_UPDATE 0x00000040 /* need parent update */
355 #define HAMMER2_CHAIN_DEFERRED 0x00000080 /* flush depth defer */
356 #define HAMMER2_CHAIN_TESTEDGOOD 0x00000100 /* crc tested good */
357 #define HAMMER2_CHAIN_ONFLUSH 0x00000200 /* on a flush list */
358 #define HAMMER2_CHAIN_FICTITIOUS 0x00000400 /* unsuitable for I/O */
359 #define HAMMER2_CHAIN_VOLUMESYNC 0x00000800 /* needs volume sync */
360 #define HAMMER2_CHAIN_DELAYED 0x00001000 /* delayed flush */
361 #define HAMMER2_CHAIN_COUNTEDBREFS 0x00002000 /* block table stats */
362 #define HAMMER2_CHAIN_ONRBTREE 0x00004000 /* on parent RB tree */
363 #define HAMMER2_CHAIN_ONLRU 0x00008000 /* on LRU list */
364 #define HAMMER2_CHAIN_EMBEDDED 0x00010000 /* embedded data */
365 #define HAMMER2_CHAIN_RELEASE 0x00020000 /* don't keep around */
366 #define HAMMER2_CHAIN_BMAPPED 0x00040000 /* present in blkmap */
367 #define HAMMER2_CHAIN_BMAPUPD 0x00080000 /* +needs updating */
368 #define HAMMER2_CHAIN_IOINPROG 0x00100000 /* I/O interlock */
369 #define HAMMER2_CHAIN_IOSIGNAL 0x00200000 /* I/O interlock */
370 #define HAMMER2_CHAIN_PFSBOUNDARY 0x00400000 /* super->pfs inode */
371 #define HAMMER2_CHAIN_HINT_LEAF_COUNT 0x00800000 /* redo leaf count */
373 #define HAMMER2_CHAIN_FLUSH_MASK (HAMMER2_CHAIN_MODIFIED | \
374 HAMMER2_CHAIN_UPDATE | \
375 HAMMER2_CHAIN_ONFLUSH | \
376 HAMMER2_CHAIN_DESTROY)
379 * Hammer2 error codes, used by chain->error and cluster->error. The error
380 * code is typically set on-lock unless no I/O was requested, and set on
381 * I/O otherwise. If set for a cluster it generally means that the cluster
382 * code could not find a valid copy to present.
384 * All H2 error codes are flags and can be accumulated by ORing them
387 * IO - An I/O error occurred
388 * CHECK - I/O succeeded but did not match the check code
389 * INCOMPLETE - A cluster is not complete enough to use, or
390 * a chain cannot be loaded because its parent has an error.
392 * NOTE: API allows callers to check zero/non-zero to determine if an error
395 * NOTE: Chain's data field is usually NULL on an IO error but not necessarily
396 * NULL on other errors. Check chain->error, not chain->data.
398 #define HAMMER2_ERROR_NONE 0 /* no error (must be 0) */
399 #define HAMMER2_ERROR_EIO 0x00000001 /* device I/O error */
400 #define HAMMER2_ERROR_CHECK 0x00000002 /* check code error */
401 #define HAMMER2_ERROR_INCOMPLETE 0x00000004 /* incomplete cluster */
402 #define HAMMER2_ERROR_DEPTH 0x00000008 /* tmp depth limit */
403 #define HAMMER2_ERROR_BADBREF 0x00000010 /* illegal bref */
404 #define HAMMER2_ERROR_ENOSPC 0x00000020 /* allocation failure */
405 #define HAMMER2_ERROR_ENOENT 0x00000040 /* entry not found */
406 #define HAMMER2_ERROR_ENOTEMPTY 0x00000080 /* dir not empty */
407 #define HAMMER2_ERROR_EAGAIN 0x00000100 /* retry */
408 #define HAMMER2_ERROR_ENOTDIR 0x00000200 /* not directory */
409 #define HAMMER2_ERROR_EISDIR 0x00000400 /* is directory */
410 #define HAMMER2_ERROR_EINPROGRESS 0x00000800 /* already running */
411 #define HAMMER2_ERROR_ABORTED 0x00001000 /* aborted operation */
412 #define HAMMER2_ERROR_EOF 0x00002000 /* end of scan */
413 #define HAMMER2_ERROR_EINVAL 0x00004000 /* catch-all */
414 #define HAMMER2_ERROR_EEXIST 0x00008000 /* entry exists */
415 #define HAMMER2_ERROR_EDEADLK 0x00010000
416 #define HAMMER2_ERROR_ESRCH 0x00020000
417 #define HAMMER2_ERROR_ETIMEDOUT 0x00040000
420 * Flags passed to hammer2_chain_lookup() and hammer2_chain_next()
423 * NOLOCK - Input and output chains are referenced only and not
424 * locked. Output chain might be temporarily locked
427 * NODATA - Asks that the chain->data not be resolved in order
430 * NODIRECT - Prevents a lookup of offset 0 in an inode from returning
431 * the inode itself if the inode is in DIRECTDATA mode
432 * (i.e. file is <= 512 bytes). Used by the synchronization
433 * code to prevent confusion.
435 * SHARED - The input chain is expected to be locked shared,
436 * and the output chain is locked shared.
438 * MATCHIND - Allows an indirect block / freemap node to be returned
439 * when the passed key range matches the radix. Remember
440 * that key_end is inclusive (e.g. {0x000,0xFFF},
441 * not {0x000,0x1000}).
443 * (Cannot be used for remote or cluster ops).
445 * ALLNODES - Allows NULL focus.
447 * ALWAYS - Always resolve the data. If ALWAYS and NODATA are both
448 * missing, bulk file data is not resolved but inodes and
449 * other meta-data will.
451 * NOUNLOCK - Used by hammer2_chain_next() to leave the lock on
452 * the input chain intact. The chain is still dropped.
453 * This allows the caller to add a reference to the chain
454 * and retain it in a locked state (used by the
455 * XOP/feed/collect code).
457 #define HAMMER2_LOOKUP_NOLOCK 0x00000001 /* ref only */
458 #define HAMMER2_LOOKUP_NODATA 0x00000002 /* data left NULL */
459 #define HAMMER2_LOOKUP_NODIRECT 0x00000004 /* no offset=0 DD */
460 #define HAMMER2_LOOKUP_SHARED 0x00000100
461 #define HAMMER2_LOOKUP_MATCHIND 0x00000200 /* return all chains */
462 #define HAMMER2_LOOKUP_ALLNODES 0x00000400 /* allow NULL focus */
463 #define HAMMER2_LOOKUP_ALWAYS 0x00000800 /* resolve data */
464 #define HAMMER2_LOOKUP_NOUNLOCK 0x00001000 /* leave lock intact */
467 * Flags passed to hammer2_chain_modify() and hammer2_chain_resize()
469 * NOTE: OPTDATA allows us to avoid instantiating buffers for INDIRECT
470 * blocks in the INITIAL-create state.
472 #define HAMMER2_MODIFY_OPTDATA 0x00000002 /* data can be NULL */
473 #define HAMMER2_MODIFY_NO_MODIFY_TID 0x00000004
474 #define HAMMER2_MODIFY_UNUSED0008 0x00000008
477 * Flags passed to hammer2_chain_lock()
479 * NOTE: RDONLY is set to optimize cluster operations when *no* modifications
480 * will be made to either the cluster being locked or any underlying
481 * cluster. It allows the cluster to lock and access data for a subset
482 * of available nodes instead of all available nodes.
484 #define HAMMER2_RESOLVE_NEVER 1
485 #define HAMMER2_RESOLVE_MAYBE 2
486 #define HAMMER2_RESOLVE_ALWAYS 3
487 #define HAMMER2_RESOLVE_MASK 0x0F
489 #define HAMMER2_RESOLVE_SHARED 0x10 /* request shared lock */
490 #define HAMMER2_RESOLVE_LOCKAGAIN 0x20 /* another shared lock */
491 #define HAMMER2_RESOLVE_RDONLY 0x40 /* higher level op flag */
494 * Flags passed to hammer2_chain_delete()
496 #define HAMMER2_DELETE_PERMANENT 0x0001
499 * Flags passed to hammer2_chain_insert() or hammer2_chain_rename()
500 * or hammer2_chain_create().
502 #define HAMMER2_INSERT_PFSROOT 0x0004
503 #define HAMMER2_INSERT_SAMEPARENT 0x0008
506 * Flags passed to hammer2_chain_delete_duplicate()
508 #define HAMMER2_DELDUP_RECORE 0x0001
511 * Cluster different types of storage together for allocations
513 #define HAMMER2_FREECACHE_INODE 0
514 #define HAMMER2_FREECACHE_INDIR 1
515 #define HAMMER2_FREECACHE_DATA 2
516 #define HAMMER2_FREECACHE_UNUSED3 3
517 #define HAMMER2_FREECACHE_TYPES 4
520 * hammer2_freemap_alloc() block preference
522 #define HAMMER2_OFF_NOPREF ((hammer2_off_t)-1)
525 * BMAP read-ahead maximum parameters
527 #define HAMMER2_BMAP_COUNT 16 /* max bmap read-ahead */
528 #define HAMMER2_BMAP_BYTES (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT)
531 * hammer2_freemap_adjust()
533 #define HAMMER2_FREEMAP_DORECOVER 1
534 #define HAMMER2_FREEMAP_DOMAYFREE 2
535 #define HAMMER2_FREEMAP_DOREALFREE 3
538 * HAMMER2 cluster - A set of chains representing the same entity.
540 * hammer2_cluster typically represents a temporary set of representitive
541 * chains. The one exception is that a hammer2_cluster is embedded in
542 * hammer2_inode. This embedded cluster is ONLY used to track the
543 * representitive chains and cannot be directly locked.
545 * A cluster is usually temporary (and thus per-thread) for locking purposes,
546 * allowing us to embed the asynchronous storage required for cluster
547 * operations in the cluster itself and adjust the state and status without
548 * having to worry too much about SMP issues.
550 * The exception is the cluster embedded in the hammer2_inode structure.
551 * This is used to cache the cluster state on an inode-by-inode basis.
552 * Individual hammer2_chain structures not incorporated into clusters might
553 * also stick around to cache miscellanious elements.
555 * Because the cluster is a 'working copy' and is usually subject to cluster
556 * quorum rules, it is quite possible for us to end up with an insufficient
557 * number of live chains to execute an operation. If an insufficient number
558 * of chains remain in a working copy, the operation may have to be
559 * downgraded, retried, stall until the requisit number of chains are
560 * available, or possibly even error out depending on the mount type.
562 * A cluster's focus is set when it is locked. The focus can only be set
563 * to a chain still part of the synchronized set.
565 #define HAMMER2_XOPFIFO 16
566 #define HAMMER2_XOPFIFO_MASK (HAMMER2_XOPFIFO - 1)
567 #define HAMMER2_XOPGROUPS 32
568 #define HAMMER2_XOPGROUPS_MASK (HAMMER2_XOPGROUPS - 1)
570 #define HAMMER2_MAXCLUSTER 8
571 #define HAMMER2_XOPMASK_CLUSTER (uint64_t)((1LLU << HAMMER2_MAXCLUSTER) - 1)
572 #define HAMMER2_XOPMASK_VOP (uint64_t)0x0000000080000000LLU
573 #define HAMMER2_XOPMASK_FIFOW (uint64_t)0x0000000040000000LLU
574 #define HAMMER2_XOPMASK_WAIT (uint64_t)0x0000000020000000LLU
575 #define HAMMER2_XOPMASK_FEED (uint64_t)0x0000000100000000LLU
577 #define HAMMER2_XOPMASK_ALLDONE (HAMMER2_XOPMASK_VOP | HAMMER2_XOPMASK_CLUSTER)
579 #define HAMMER2_SPECTHREADS 1 /* sync */
581 struct hammer2_cluster_item {
582 hammer2_chain_t *chain;
587 typedef struct hammer2_cluster_item hammer2_cluster_item_t;
590 * INVALID - Invalid for focus, i.e. not part of synchronized set.
591 * Once set, this bit is sticky across operations.
593 * FEMOD - Indicates that front-end modifying operations can
594 * mess with this entry and MODSYNC will copy also
597 #define HAMMER2_CITEM_INVALID 0x00000001
598 #define HAMMER2_CITEM_FEMOD 0x00000002
599 #define HAMMER2_CITEM_NULL 0x00000004
601 struct hammer2_cluster {
602 int refs; /* track for deallocation */
604 struct hammer2_pfs *pmp;
607 int error; /* error code valid on lock */
609 hammer2_chain_t *focus; /* current focus (or mod) */
610 hammer2_cluster_item_t array[HAMMER2_MAXCLUSTER];
613 typedef struct hammer2_cluster hammer2_cluster_t;
616 * WRHARD - Hard mounts can write fully synchronized
617 * RDHARD - Hard mounts can read fully synchronized
618 * UNHARD - Unsynchronized masters present
619 * NOHARD - No masters visible
620 * WRSOFT - Soft mounts can write to at least the SOFT_MASTER
621 * RDSOFT - Soft mounts can read from at least a SOFT_SLAVE
622 * UNSOFT - Unsynchronized slaves present
623 * NOSOFT - No slaves visible
624 * RDSLAVE - slaves are accessible (possibly unsynchronized or remote).
625 * MSYNCED - All masters are fully synchronized
626 * SSYNCED - All known local slaves are fully synchronized to masters
628 * All available masters are always incorporated. All PFSs belonging to a
629 * cluster (master, slave, copy, whatever) always try to synchronize the
630 * total number of known masters in the PFSs root inode.
632 * A cluster might have access to many slaves, copies, or caches, but we
633 * have a limited number of cluster slots. Any such elements which are
634 * directly mounted from block device(s) will always be incorporated. Note
635 * that SSYNCED only applies to such elements which are directly mounted,
636 * not to any remote slaves, copies, or caches that could be available. These
637 * bits are used to monitor and drive our synchronization threads.
639 * When asking the question 'is any data accessible at all', then a simple
640 * test against (RDHARD|RDSOFT|RDSLAVE) gives you the answer. If any of
641 * these bits are set the object can be read with certain caveats:
642 * RDHARD - no caveats. RDSOFT - authoritative but might not be synchronized.
643 * and RDSLAVE - not authoritative, has some data but it could be old or
646 * When both soft and hard mounts are available, data will be read and written
647 * via the soft mount only. But all might be in the cluster because
648 * background synchronization threads still need to do their work.
650 #define HAMMER2_CLUSTER_INODE 0x00000001 /* embedded in inode struct */
651 #define HAMMER2_CLUSTER_UNUSED2 0x00000002
652 #define HAMMER2_CLUSTER_LOCKED 0x00000004 /* cluster lks not recursive */
653 #define HAMMER2_CLUSTER_WRHARD 0x00000100 /* hard-mount can write */
654 #define HAMMER2_CLUSTER_RDHARD 0x00000200 /* hard-mount can read */
655 #define HAMMER2_CLUSTER_UNHARD 0x00000400 /* unsynchronized masters */
656 #define HAMMER2_CLUSTER_NOHARD 0x00000800 /* no masters visible */
657 #define HAMMER2_CLUSTER_WRSOFT 0x00001000 /* soft-mount can write */
658 #define HAMMER2_CLUSTER_RDSOFT 0x00002000 /* soft-mount can read */
659 #define HAMMER2_CLUSTER_UNSOFT 0x00004000 /* unsynchronized slaves */
660 #define HAMMER2_CLUSTER_NOSOFT 0x00008000 /* no slaves visible */
661 #define HAMMER2_CLUSTER_MSYNCED 0x00010000 /* all masters synchronized */
662 #define HAMMER2_CLUSTER_SSYNCED 0x00020000 /* known slaves synchronized */
664 #define HAMMER2_CLUSTER_ANYDATA ( HAMMER2_CLUSTER_RDHARD | \
665 HAMMER2_CLUSTER_RDSOFT | \
666 HAMMER2_CLUSTER_RDSLAVE)
668 #define HAMMER2_CLUSTER_RDOK ( HAMMER2_CLUSTER_RDHARD | \
669 HAMMER2_CLUSTER_RDSOFT)
671 #define HAMMER2_CLUSTER_WROK ( HAMMER2_CLUSTER_WRHARD | \
672 HAMMER2_CLUSTER_WRSOFT)
674 #define HAMMER2_CLUSTER_ZFLAGS ( HAMMER2_CLUSTER_WRHARD | \
675 HAMMER2_CLUSTER_RDHARD | \
676 HAMMER2_CLUSTER_WRSOFT | \
677 HAMMER2_CLUSTER_RDSOFT | \
678 HAMMER2_CLUSTER_MSYNCED | \
679 HAMMER2_CLUSTER_SSYNCED)
682 * Helper functions (cluster must be locked for flags to be valid).
686 hammer2_cluster_rdok(hammer2_cluster_t *cluster)
688 return (cluster->flags & HAMMER2_CLUSTER_RDOK);
693 hammer2_cluster_wrok(hammer2_cluster_t *cluster)
695 return (cluster->flags & HAMMER2_CLUSTER_WROK);
698 RB_HEAD(hammer2_inode_tree, hammer2_inode);
703 * NOTE: The inode-embedded cluster is never used directly for I/O (since
704 * it may be shared). Instead it will be replicated-in and synchronized
705 * back out if changed.
707 struct hammer2_inode {
708 RB_ENTRY(hammer2_inode) rbnode; /* inumber lookup (HL) */
709 hammer2_mtx_t lock; /* inode lock */
710 hammer2_mtx_t truncate_lock; /* prevent truncates */
711 struct hammer2_pfs *pmp; /* PFS mount */
713 struct spinlock cluster_spin; /* update cluster */
714 hammer2_cluster_t cluster;
715 struct lockf advlock;
717 u_int refs; /* +vpref, +flushref */
718 uint8_t comp_heuristic;
719 hammer2_inode_meta_t meta; /* copy of meta-data */
723 typedef struct hammer2_inode hammer2_inode_t;
726 * MODIFIED - Inode is in a modified state, ip->meta may have changes.
727 * RESIZED - Inode truncated (any) or inode extended beyond
730 #define HAMMER2_INODE_MODIFIED 0x0001
731 #define HAMMER2_INODE_SROOT 0x0002 /* kmalloc special case */
732 #define HAMMER2_INODE_RENAME_INPROG 0x0004
733 #define HAMMER2_INODE_ONRBTREE 0x0008
734 #define HAMMER2_INODE_RESIZED 0x0010 /* requires inode_fsync */
735 #define HAMMER2_INODE_ISDELETED 0x0020 /* deleted */
736 #define HAMMER2_INODE_ISUNLINKED 0x0040
737 #define HAMMER2_INODE_METAGOOD 0x0080 /* inode meta-data good */
738 #define HAMMER2_INODE_ONSIDEQ 0x0100 /* on side processing queue */
739 #define HAMMER2_INODE_NOSIDEQ 0x0200 /* disable sideq operation */
741 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2);
742 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp,
746 * inode-unlink side-structure
748 struct hammer2_inode_sideq {
749 TAILQ_ENTRY(hammer2_inode_sideq) entry;
752 TAILQ_HEAD(h2_sideq_list, hammer2_inode_sideq);
754 typedef struct hammer2_inode_sideq hammer2_inode_sideq_t;
757 * Transaction management sub-structure under hammer2_pfs
759 struct hammer2_trans {
764 typedef struct hammer2_trans hammer2_trans_t;
766 #define HAMMER2_TRANS_ISFLUSH 0x80000000 /* flush code */
767 #define HAMMER2_TRANS_BUFCACHE 0x40000000 /* bio strategy */
768 #define HAMMER2_TRANS_UNUSED20 0x20000000
769 #define HAMMER2_TRANS_FPENDING 0x10000000 /* flush pending */
770 #define HAMMER2_TRANS_WAITING 0x08000000 /* someone waiting */
771 #define HAMMER2_TRANS_MASK 0x00FFFFFF /* count mask */
773 #define HAMMER2_FREEMAP_HEUR_NRADIX 4 /* pwr 2 PBUFRADIX-MINIORADIX */
774 #define HAMMER2_FREEMAP_HEUR_TYPES 8
775 #define HAMMER2_FREEMAP_HEUR_SIZE (HAMMER2_FREEMAP_HEUR_NRADIX * \
776 HAMMER2_FREEMAP_HEUR_TYPES)
778 #define HAMMER2_DEDUP_HEUR_SIZE (65536 * 4)
779 #define HAMMER2_DEDUP_HEUR_MASK (HAMMER2_DEDUP_HEUR_SIZE - 1)
781 #define HAMMER2_FLUSH_TOP 0x0001
782 #define HAMMER2_FLUSH_ALL 0x0002
783 #define HAMMER2_FLUSH_INODE_STOP 0x0004 /* stop at sub-inode */
787 * Hammer2 support thread element.
789 * Potentially many support threads can hang off of hammer2, primarily
790 * off the hammer2_pfs structure. Typically:
792 * td x Nodes A synchronization thread for each node.
793 * td x Nodes x workers Worker threads for frontend operations.
794 * td x 1 Bioq thread for logical buffer writes.
796 * In addition, the synchronization thread(s) associated with the
797 * super-root PFS (spmp) for a node is responsible for automatic bulkfree
800 struct hammer2_thread {
801 struct hammer2_pfs *pmp;
802 struct hammer2_dev *hmp;
803 hammer2_xop_list_t xopq;
807 int clindex; /* cluster element index */
809 char *scratch; /* MAXPHYS */
812 typedef struct hammer2_thread hammer2_thread_t;
814 #define HAMMER2_THREAD_UNMOUNTING 0x0001 /* unmount request */
815 #define HAMMER2_THREAD_DEV 0x0002 /* related to dev, not pfs */
816 #define HAMMER2_THREAD_WAITING 0x0004 /* thread in idle tsleep */
817 #define HAMMER2_THREAD_REMASTER 0x0008 /* remaster request */
818 #define HAMMER2_THREAD_STOP 0x0010 /* exit request */
819 #define HAMMER2_THREAD_FREEZE 0x0020 /* force idle */
820 #define HAMMER2_THREAD_FROZEN 0x0040 /* thread is frozen */
821 #define HAMMER2_THREAD_XOPQ 0x0080 /* work pending */
822 #define HAMMER2_THREAD_STOPPED 0x0100 /* thread has stopped */
823 #define HAMMER2_THREAD_UNFREEZE 0x0200
825 #define HAMMER2_THREAD_WAKEUP_MASK (HAMMER2_THREAD_UNMOUNTING | \
826 HAMMER2_THREAD_REMASTER | \
827 HAMMER2_THREAD_STOP | \
828 HAMMER2_THREAD_FREEZE | \
832 * Support structure for dedup heuristic.
834 struct hammer2_dedup {
835 hammer2_off_t data_off;
841 typedef struct hammer2_dedup hammer2_dedup_t;
844 * hammer2_xop - container for VOP/XOP operation (allocated, not on stack).
846 * This structure is used to distribute a VOP operation across multiple
847 * nodes. It provides a rendezvous for concurrent node execution and
848 * can be detached from the frontend operation to allow the frontend to
851 * This structure also sequences operations on up to three inodes.
853 typedef void (*hammer2_xop_func_t)(hammer2_thread_t *thr,
854 union hammer2_xop *xop);
856 struct hammer2_xop_fifo {
857 TAILQ_ENTRY(hammer2_xop_head) entry;
858 hammer2_chain_t *array[HAMMER2_XOPFIFO];
859 int errors[HAMMER2_XOPFIFO];
863 hammer2_thread_t *thr;
866 typedef struct hammer2_xop_fifo hammer2_xop_fifo_t;
868 #define HAMMER2_XOP_FIFO_RUN 0x0001
869 #define HAMMER2_XOP_FIFO_STALL 0x0002
871 struct hammer2_xop_head {
872 hammer2_xop_func_t func;
874 struct hammer2_inode *ip1;
875 struct hammer2_inode *ip2;
876 struct hammer2_inode *ip3;
882 hammer2_key_t collect_key;
887 hammer2_xop_fifo_t collect[HAMMER2_MAXCLUSTER];
888 hammer2_cluster_t cluster; /* help collections */
891 typedef struct hammer2_xop_head hammer2_xop_head_t;
893 struct hammer2_xop_ipcluster {
894 hammer2_xop_head_t head;
897 struct hammer2_xop_strategy {
898 hammer2_xop_head_t head;
905 struct hammer2_xop_readdir {
906 hammer2_xop_head_t head;
910 struct hammer2_xop_nresolve {
911 hammer2_xop_head_t head;
912 hammer2_key_t lhc; /* if name is NULL used lhc */
915 struct hammer2_xop_unlink {
916 hammer2_xop_head_t head;
921 #define H2DOPERM_PERMANENT 0x01
922 #define H2DOPERM_FORCE 0x02
923 #define H2DOPERM_IGNINO 0x04
925 struct hammer2_xop_nrename {
926 hammer2_xop_head_t head;
931 struct hammer2_xop_scanlhc {
932 hammer2_xop_head_t head;
936 struct hammer2_xop_scanall {
937 hammer2_xop_head_t head;
938 hammer2_key_t key_beg; /* inclusive */
939 hammer2_key_t key_end; /* inclusive */
944 struct hammer2_xop_lookup {
945 hammer2_xop_head_t head;
949 struct hammer2_xop_mkdirent {
950 hammer2_xop_head_t head;
951 hammer2_dirent_head_t dirent;
955 struct hammer2_xop_create {
956 hammer2_xop_head_t head;
957 hammer2_inode_meta_t meta; /* initial metadata */
962 struct hammer2_xop_destroy {
963 hammer2_xop_head_t head;
966 struct hammer2_xop_fsync {
967 hammer2_xop_head_t head;
968 hammer2_inode_meta_t meta;
971 int clear_directdata;
974 struct hammer2_xop_unlinkall {
975 hammer2_xop_head_t head;
976 hammer2_key_t key_beg;
977 hammer2_key_t key_end;
980 struct hammer2_xop_connect {
981 hammer2_xop_head_t head;
985 struct hammer2_xop_flush {
986 hammer2_xop_head_t head;
989 typedef struct hammer2_xop_readdir hammer2_xop_readdir_t;
990 typedef struct hammer2_xop_nresolve hammer2_xop_nresolve_t;
991 typedef struct hammer2_xop_unlink hammer2_xop_unlink_t;
992 typedef struct hammer2_xop_nrename hammer2_xop_nrename_t;
993 typedef struct hammer2_xop_ipcluster hammer2_xop_ipcluster_t;
994 typedef struct hammer2_xop_strategy hammer2_xop_strategy_t;
995 typedef struct hammer2_xop_mkdirent hammer2_xop_mkdirent_t;
996 typedef struct hammer2_xop_create hammer2_xop_create_t;
997 typedef struct hammer2_xop_destroy hammer2_xop_destroy_t;
998 typedef struct hammer2_xop_fsync hammer2_xop_fsync_t;
999 typedef struct hammer2_xop_unlinkall hammer2_xop_unlinkall_t;
1000 typedef struct hammer2_xop_scanlhc hammer2_xop_scanlhc_t;
1001 typedef struct hammer2_xop_scanall hammer2_xop_scanall_t;
1002 typedef struct hammer2_xop_lookup hammer2_xop_lookup_t;
1003 typedef struct hammer2_xop_connect hammer2_xop_connect_t;
1004 typedef struct hammer2_xop_flush hammer2_xop_flush_t;
1007 hammer2_xop_head_t head;
1008 hammer2_xop_ipcluster_t xop_ipcluster;
1009 hammer2_xop_readdir_t xop_readdir;
1010 hammer2_xop_nresolve_t xop_nresolve;
1011 hammer2_xop_unlink_t xop_unlink;
1012 hammer2_xop_nrename_t xop_nrename;
1013 hammer2_xop_strategy_t xop_strategy;
1014 hammer2_xop_mkdirent_t xop_mkdirent;
1015 hammer2_xop_create_t xop_create;
1016 hammer2_xop_destroy_t xop_destroy;
1017 hammer2_xop_fsync_t xop_fsync;
1018 hammer2_xop_unlinkall_t xop_unlinkall;
1019 hammer2_xop_scanlhc_t xop_scanlhc;
1020 hammer2_xop_scanall_t xop_scanall;
1021 hammer2_xop_lookup_t xop_lookup;
1022 hammer2_xop_flush_t xop_flush;
1023 hammer2_xop_connect_t xop_connect;
1026 typedef union hammer2_xop hammer2_xop_t;
1029 * hammer2_xop_group - Manage XOP support threads.
1031 struct hammer2_xop_group {
1032 hammer2_thread_t thrs[HAMMER2_MAXCLUSTER];
1035 typedef struct hammer2_xop_group hammer2_xop_group_t;
1038 * flags to hammer2_xop_collect()
1040 #define HAMMER2_XOP_COLLECT_NOWAIT 0x00000001
1041 #define HAMMER2_XOP_COLLECT_WAITALL 0x00000002
1044 * flags to hammer2_xop_alloc()
1046 * MODIFYING - This is a modifying transaction, allocate a mtid.
1047 * RECURSE - Recurse top-level inode (for root flushes)
1049 #define HAMMER2_XOP_MODIFYING 0x00000001
1050 #define HAMMER2_XOP_STRATEGY 0x00000002
1051 #define HAMMER2_XOP_INODE_STOP 0x00000004
1054 * Global (per partition) management structure, represents a hard block
1055 * device. Typically referenced by hammer2_chain structures when applicable.
1056 * Typically not used for network-managed elements.
1058 * Note that a single hammer2_dev can be indirectly tied to multiple system
1059 * mount points. There is no direct relationship. System mounts are
1060 * per-cluster-id, not per-block-device, and a single hard mount might contain
1061 * many PFSs and those PFSs might combine together in various ways to form
1062 * the set of available clusters.
1064 struct hammer2_dev {
1065 struct vnode *devvp; /* device vnode */
1066 int ronly; /* read-only mount */
1067 int mount_count; /* number of actively mounted PFSs */
1068 TAILQ_ENTRY(hammer2_dev) mntentry; /* hammer2_mntlist */
1070 struct malloc_type *mchain;
1073 kdmsg_iocom_t iocom; /* volume-level dmsg interface */
1074 struct spinlock io_spin; /* iotree, iolruq access */
1075 struct hammer2_io_tree iotree;
1077 int freemap_relaxed;
1078 hammer2_chain_t vchain; /* anchor chain (topology) */
1079 hammer2_chain_t fchain; /* anchor chain (freemap) */
1080 struct spinlock list_spin;
1081 struct h2_flush_list flushq; /* flush seeds */
1082 struct hammer2_pfs *spmp; /* super-root pmp for transactions */
1083 struct lock vollk; /* lockmgr lock */
1084 struct lock bulklk; /* bulkfree operation lock */
1085 struct lock bflock; /* bulk-free manual function lock */
1086 hammer2_off_t heur_freemap[HAMMER2_FREEMAP_HEUR_SIZE];
1087 hammer2_dedup_t heur_dedup[HAMMER2_DEDUP_HEUR_SIZE];
1088 int volhdrno; /* last volhdrno written */
1089 uint32_t hflags; /* HMNT2 flags applicable to device */
1090 hammer2_off_t free_reserved; /* nominal free reserved */
1091 hammer2_thread_t bfthr; /* bulk-free thread */
1092 char devrepname[64]; /* for kprintf */
1093 hammer2_ioc_bulkfree_t bflast; /* stats for last bulkfree run */
1094 hammer2_volume_data_t voldata;
1095 hammer2_volume_data_t volsync; /* synchronized voldata */
1098 typedef struct hammer2_dev hammer2_dev_t;
1101 * Helper functions (cluster must be locked for flags to be valid).
1105 hammer2_chain_rdok(hammer2_chain_t *chain)
1107 return (chain->error == 0);
1112 hammer2_chain_wrok(hammer2_chain_t *chain)
1114 return (chain->error == 0 && chain->hmp->ronly == 0);
1118 * Per-cluster management structure. This structure will be tied to a
1119 * system mount point if the system is mounting the PFS, but is also used
1120 * to manage clusters encountered during the super-root scan or received
1121 * via LNK_SPANs that might not be mounted.
1123 * This structure is also used to represent the super-root that hangs off
1124 * of a hard mount point. The super-root is not really a cluster element.
1125 * In this case the spmp_hmp field will be non-NULL. It's just easier to do
1126 * this than to special case super-root manipulation in the hammer2_chain*
1127 * code as being only hammer2_dev-related.
1129 * pfs_mode and pfs_nmasters are rollup fields which critically describes
1130 * how elements of the cluster act on the cluster. pfs_mode is only applicable
1131 * when a PFS is mounted by the system. pfs_nmasters is our best guess as to
1132 * how many masters have been configured for a cluster and is always
1133 * applicable. pfs_types[] is an array with 1:1 correspondance to the
1134 * iroot cluster and describes the PFS types of the nodes making up the
1137 * WARNING! Portions of this structure have deferred initialization. In
1138 * particular, if not mounted there will be no wthread.
1139 * umounted network PFSs will also be missing iroot and numerous
1140 * other fields will not be initialized prior to mount.
1142 * Synchronization threads are chain-specific and only applicable
1143 * to local hard PFS entries. A hammer2_pfs structure may contain
1144 * more than one when multiple hard PFSs are present on the local
1145 * machine which require synchronization monitoring. Most PFSs
1146 * (such as snapshots) are 1xMASTER PFSs which do not need a
1147 * synchronization thread.
1149 * WARNING! The chains making up pfs->iroot's cluster are accounted for in
1150 * hammer2_dev->mount_count when the pfs is associated with a mount
1153 struct hammer2_pfs {
1155 TAILQ_ENTRY(hammer2_pfs) mntentry; /* hammer2_pfslist */
1157 hammer2_dev_t *spmp_hmp; /* only if super-root pmp */
1158 hammer2_dev_t *force_local; /* only if 'local' mount */
1159 hammer2_inode_t *iroot; /* PFS root inode */
1160 uint8_t pfs_types[HAMMER2_MAXCLUSTER];
1161 char *pfs_names[HAMMER2_MAXCLUSTER];
1162 hammer2_dev_t *pfs_hmps[HAMMER2_MAXCLUSTER];
1163 hammer2_trans_t trans;
1164 struct lock lock; /* PFS lock for certain ops */
1165 struct lock lock_nlink; /* rename and nlink lock */
1166 struct netexport export; /* nfs export */
1167 int ronly; /* read-only mount */
1168 int hflags; /* pfs-specific mount flags */
1169 struct malloc_type *minode;
1170 struct malloc_type *mmsg;
1171 struct spinlock inum_spin; /* inumber lookup */
1172 struct hammer2_inode_tree inum_tree; /* (not applicable to spmp) */
1173 long inum_count; /* #of inodes in inum_tree */
1174 struct spinlock lru_spin; /* inumber lookup */
1175 struct hammer2_chain_list lru_list; /* chains on LRU */
1176 int lru_count; /* #of chains on LRU */
1177 hammer2_tid_t modify_tid; /* modify transaction id */
1178 hammer2_tid_t inode_tid; /* inode allocator */
1179 uint8_t pfs_nmasters; /* total masters */
1180 uint8_t pfs_mode; /* operating mode PFSMODE */
1183 int free_ticks; /* free_* calculations */
1185 hammer2_off_t free_reserved;
1186 hammer2_off_t free_nominal;
1187 uint32_t inmem_dirty_chains;
1188 int count_lwinprog; /* logical write in prog */
1189 struct spinlock list_spin;
1190 struct h2_sideq_list sideq; /* last-close dirty/unlink */
1192 hammer2_thread_t sync_thrs[HAMMER2_MAXCLUSTER];
1193 uint32_t cluster_flags; /* cached cluster flags */
1194 int has_xop_threads;
1195 struct spinlock xop_spin; /* xop sequencer */
1196 hammer2_xop_group_t xop_groups[HAMMER2_XOPGROUPS];
1199 typedef struct hammer2_pfs hammer2_pfs_t;
1201 TAILQ_HEAD(hammer2_pfslist, hammer2_pfs);
1203 #define HAMMER2_LRU_LIMIT 1024 /* per pmp lru_list */
1205 #define HAMMER2_DIRTYCHAIN_WAITING 0x80000000
1206 #define HAMMER2_DIRTYCHAIN_MASK 0x7FFFFFFF
1208 #define HAMMER2_LWINPROG_WAITING 0x80000000
1209 #define HAMMER2_LWINPROG_WAITING0 0x40000000
1210 #define HAMMER2_LWINPROG_MASK 0x3FFFFFFF
1213 * hammer2_cluster_check
1215 #define HAMMER2_CHECK_NULL 0x00000001
1220 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
1221 #define VTOI(vp) ((hammer2_inode_t *)(vp)->v_data)
1224 #if defined(_KERNEL)
1226 MALLOC_DECLARE(M_HAMMER2);
1228 #define ITOV(ip) ((ip)->vp)
1231 * Currently locked chains retain the locked buffer cache buffer for
1232 * indirect blocks, and indirect blocks can be one of two sizes. The
1233 * device buffer has to match the case to avoid deadlocking recursive
1234 * chains that might otherwise try to access different offsets within
1235 * the same device buffer.
1239 hammer2_devblkradix(int radix)
1242 if (radix <= HAMMER2_LBUFRADIX) {
1243 return (HAMMER2_LBUFRADIX);
1245 return (HAMMER2_PBUFRADIX);
1248 return (HAMMER2_PBUFRADIX);
1252 * XXX almost time to remove this. DIO uses PBUFSIZE exclusively now.
1256 hammer2_devblksize(size_t bytes)
1259 if (bytes <= HAMMER2_LBUFSIZE) {
1260 return(HAMMER2_LBUFSIZE);
1262 KKASSERT(bytes <= HAMMER2_PBUFSIZE &&
1263 (bytes ^ (bytes - 1)) == ((bytes << 1) - 1));
1264 return (HAMMER2_PBUFSIZE);
1267 return (HAMMER2_PBUFSIZE);
1273 MPTOPMP(struct mount *mp)
1275 return ((hammer2_pfs_t *)mp->mnt_data);
1278 #define HAMMER2_DEDUP_FRAG (HAMMER2_PBUFSIZE / 64)
1279 #define HAMMER2_DEDUP_FRAGRADIX (HAMMER2_PBUFRADIX - 6)
1283 hammer2_dedup_mask(hammer2_io_t *dio, hammer2_off_t data_off, u_int bytes)
1289 bbeg = (int)((data_off & ~HAMMER2_OFF_MASK_RADIX) - dio->pbase) >>
1290 HAMMER2_DEDUP_FRAGRADIX;
1291 bits = (int)((bytes + (HAMMER2_DEDUP_FRAG - 1)) >>
1292 HAMMER2_DEDUP_FRAGRADIX);
1293 mask = ((uint64_t)1 << bbeg) - 1;
1294 if (bbeg + bits == 64)
1295 mask = (uint64_t)-1;
1297 mask = ((uint64_t)1 << (bbeg + bits)) - 1;
1299 mask &= ~(((uint64_t)1 << bbeg) - 1);
1306 hammer2_error_to_errno(int error)
1309 if (error & HAMMER2_ERROR_EIO)
1311 else if (error & HAMMER2_ERROR_CHECK)
1313 else if (error & HAMMER2_ERROR_ABORTED)
1315 else if (error & HAMMER2_ERROR_BADBREF)
1317 else if (error & HAMMER2_ERROR_ENOSPC)
1319 else if (error & HAMMER2_ERROR_ENOENT)
1321 else if (error & HAMMER2_ERROR_ENOTEMPTY)
1323 else if (error & HAMMER2_ERROR_EAGAIN)
1325 else if (error & HAMMER2_ERROR_ENOTDIR)
1327 else if (error & HAMMER2_ERROR_EISDIR)
1329 else if (error & HAMMER2_ERROR_EINPROGRESS)
1330 error = EINPROGRESS;
1331 else if (error & HAMMER2_ERROR_EEXIST)
1341 hammer2_errno_to_error(int error)
1347 return HAMMER2_ERROR_EIO;
1350 return HAMMER2_ERROR_EINVAL;
1354 extern struct vop_ops hammer2_vnode_vops;
1355 extern struct vop_ops hammer2_spec_vops;
1356 extern struct vop_ops hammer2_fifo_vops;
1357 extern struct hammer2_pfslist hammer2_pfslist;
1358 extern struct lock hammer2_mntlk;
1361 extern int hammer2_debug;
1362 extern int hammer2_cluster_meta_read;
1363 extern int hammer2_cluster_data_read;
1364 extern int hammer2_dedup_enable;
1365 extern int hammer2_always_compress;
1366 extern int hammer2_inval_enable;
1367 extern int hammer2_flush_pipe;
1368 extern int hammer2_dio_count;
1369 extern int hammer2_dio_limit;
1370 extern int hammer2_bulkfree_tps;
1371 extern long hammer2_chain_allocs;
1372 extern long hammer2_chain_frees;
1373 extern long hammer2_limit_dirty_chains;
1374 extern long hammer2_count_modified_chains;
1375 extern long hammer2_iod_invals;
1376 extern long hammer2_iod_file_read;
1377 extern long hammer2_iod_meta_read;
1378 extern long hammer2_iod_indr_read;
1379 extern long hammer2_iod_fmap_read;
1380 extern long hammer2_iod_volu_read;
1381 extern long hammer2_iod_file_write;
1382 extern long hammer2_iod_file_wembed;
1383 extern long hammer2_iod_file_wzero;
1384 extern long hammer2_iod_file_wdedup;
1385 extern long hammer2_iod_meta_write;
1386 extern long hammer2_iod_indr_write;
1387 extern long hammer2_iod_fmap_write;
1388 extern long hammer2_iod_volu_write;
1390 extern long hammer2_process_xxhash64;
1391 extern long hammer2_process_icrc32;
1393 extern struct objcache *cache_buffer_read;
1394 extern struct objcache *cache_buffer_write;
1395 extern struct objcache *cache_xops;
1400 #define hammer2_icrc32(buf, size) iscsi_crc32((buf), (size))
1401 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc))
1403 int hammer2_signal_check(time_t *timep);
1404 const char *hammer2_error_str(int error);
1406 void hammer2_inode_lock(hammer2_inode_t *ip, int how);
1407 void hammer2_inode_unlock(hammer2_inode_t *ip);
1408 hammer2_chain_t *hammer2_inode_chain(hammer2_inode_t *ip, int clindex, int how);
1409 hammer2_chain_t *hammer2_inode_chain_and_parent(hammer2_inode_t *ip,
1410 int clindex, hammer2_chain_t **parentp, int how);
1411 hammer2_mtx_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip);
1412 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip,
1413 hammer2_mtx_state_t ostate);
1414 int hammer2_inode_lock_upgrade(hammer2_inode_t *ip);
1415 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, int);
1417 void hammer2_dev_exlock(hammer2_dev_t *hmp);
1418 void hammer2_dev_shlock(hammer2_dev_t *hmp);
1419 void hammer2_dev_unlock(hammer2_dev_t *hmp);
1421 int hammer2_get_dtype(uint8_t type);
1422 int hammer2_get_vtype(uint8_t type);
1423 uint8_t hammer2_get_obj_type(enum vtype vtype);
1424 void hammer2_time_to_timespec(uint64_t xtime, struct timespec *ts);
1425 uint64_t hammer2_timespec_to_time(const struct timespec *ts);
1426 uint32_t hammer2_to_unix_xid(const uuid_t *uuid);
1427 void hammer2_guid_to_uuid(uuid_t *uuid, uint32_t guid);
1428 void hammer2_trans_manage_init(hammer2_pfs_t *pmp);
1430 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len);
1431 int hammer2_getradix(size_t bytes);
1433 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
1434 hammer2_key_t *lbasep, hammer2_key_t *leofp);
1435 int hammer2_calc_physical(hammer2_inode_t *ip, hammer2_key_t lbase);
1436 void hammer2_update_time(uint64_t *timep);
1437 void hammer2_adjreadcounter(hammer2_blockref_t *bref, size_t bytes);
1442 struct vnode *hammer2_igetv(hammer2_inode_t *ip, int *errorp);
1443 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfs_t *pmp,
1444 hammer2_tid_t inum);
1445 hammer2_inode_t *hammer2_inode_get(hammer2_pfs_t *pmp, hammer2_inode_t *dip,
1446 hammer2_cluster_t *cluster, int idx);
1447 void hammer2_inode_free(hammer2_inode_t *ip);
1448 void hammer2_inode_ref(hammer2_inode_t *ip);
1449 void hammer2_inode_drop(hammer2_inode_t *ip);
1450 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip,
1451 hammer2_cluster_t *cluster);
1452 void hammer2_inode_repoint_one(hammer2_inode_t *ip, hammer2_cluster_t *cluster,
1454 void hammer2_inode_modify(hammer2_inode_t *ip);
1455 void hammer2_inode_run_sideq(hammer2_pfs_t *pmp, int doall);
1457 hammer2_inode_t *hammer2_inode_create(hammer2_inode_t *dip,
1458 hammer2_inode_t *pip,
1459 struct vattr *vap, struct ucred *cred,
1460 const uint8_t *name, size_t name_len, hammer2_key_t lhc,
1461 hammer2_key_t inum, uint8_t type, uint8_t target_type,
1462 int flags, int *errorp);
1463 int hammer2_inode_chain_sync(hammer2_inode_t *ip);
1464 int hammer2_inode_chain_flush(hammer2_inode_t *ip);
1465 int hammer2_inode_unlink_finisher(hammer2_inode_t *ip, int isopen);
1466 int hammer2_dirent_create(hammer2_inode_t *dip, const char *name,
1467 size_t name_len, hammer2_key_t inum, uint8_t type);
1472 void hammer2_voldata_lock(hammer2_dev_t *hmp);
1473 void hammer2_voldata_unlock(hammer2_dev_t *hmp);
1474 void hammer2_voldata_modify(hammer2_dev_t *hmp);
1475 hammer2_chain_t *hammer2_chain_alloc(hammer2_dev_t *hmp,
1477 hammer2_blockref_t *bref);
1478 void hammer2_chain_core_init(hammer2_chain_t *chain);
1479 void hammer2_chain_ref(hammer2_chain_t *chain);
1480 void hammer2_chain_ref_hold(hammer2_chain_t *chain);
1481 void hammer2_chain_drop(hammer2_chain_t *chain);
1482 void hammer2_chain_drop_unhold(hammer2_chain_t *chain);
1483 void hammer2_chain_lock(hammer2_chain_t *chain, int how);
1484 void hammer2_chain_lock_unhold(hammer2_chain_t *chain, int how);
1485 void hammer2_chain_load_data(hammer2_chain_t *chain);
1486 const hammer2_media_data_t *hammer2_chain_rdata(hammer2_chain_t *chain);
1487 hammer2_media_data_t *hammer2_chain_wdata(hammer2_chain_t *chain);
1489 int hammer2_chain_inode_find(hammer2_pfs_t *pmp, hammer2_key_t inum,
1490 int clindex, int flags,
1491 hammer2_chain_t **parentp,
1492 hammer2_chain_t **chainp);
1493 int hammer2_chain_modify(hammer2_chain_t *chain, hammer2_tid_t mtid,
1494 hammer2_off_t dedup_off, int flags);
1495 int hammer2_chain_modify_ip(hammer2_inode_t *ip, hammer2_chain_t *chain,
1496 hammer2_tid_t mtid, int flags);
1497 int hammer2_chain_resize(hammer2_chain_t *chain,
1498 hammer2_tid_t mtid, hammer2_off_t dedup_off,
1499 int nradix, int flags);
1500 void hammer2_chain_unlock(hammer2_chain_t *chain);
1501 void hammer2_chain_unlock_hold(hammer2_chain_t *chain);
1502 void hammer2_chain_wait(hammer2_chain_t *chain);
1503 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent, int generation,
1504 hammer2_blockref_t *bref, int how);
1505 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags);
1506 void hammer2_chain_lookup_done(hammer2_chain_t *parent);
1507 hammer2_chain_t *hammer2_chain_getparent(hammer2_chain_t *chain, int flags);
1508 hammer2_chain_t *hammer2_chain_repparent(hammer2_chain_t **chainp, int flags);
1509 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp,
1510 hammer2_key_t *key_nextp,
1511 hammer2_key_t key_beg, hammer2_key_t key_end,
1512 int *errorp, int flags);
1513 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp,
1514 hammer2_chain_t *chain,
1515 hammer2_key_t *key_nextp,
1516 hammer2_key_t key_beg, hammer2_key_t key_end,
1517 int *errorp, int flags);
1518 int hammer2_chain_scan(hammer2_chain_t *parent,
1519 hammer2_chain_t **chainp,
1520 hammer2_blockref_t *bref,
1521 int *firstp, int flags);
1523 int hammer2_chain_create(hammer2_chain_t **parentp, hammer2_chain_t **chainp,
1524 hammer2_pfs_t *pmp, int methods,
1525 hammer2_key_t key, int keybits,
1526 int type, size_t bytes, hammer2_tid_t mtid,
1527 hammer2_off_t dedup_off, int flags);
1528 void hammer2_chain_rename(hammer2_chain_t **parentp,
1529 hammer2_chain_t *chain,
1530 hammer2_tid_t mtid, int flags);
1531 int hammer2_chain_delete(hammer2_chain_t *parent, hammer2_chain_t *chain,
1532 hammer2_tid_t mtid, int flags);
1533 int hammer2_chain_indirect_maintenance(hammer2_chain_t *parent,
1534 hammer2_chain_t *chain);
1535 void hammer2_chain_setflush(hammer2_chain_t *chain);
1536 void hammer2_chain_countbrefs(hammer2_chain_t *chain,
1537 hammer2_blockref_t *base, int count);
1538 hammer2_chain_t *hammer2_chain_bulksnap(hammer2_dev_t *hmp);
1539 void hammer2_chain_bulkdrop(hammer2_chain_t *copy);
1541 void hammer2_chain_setcheck(hammer2_chain_t *chain, void *bdata);
1542 int hammer2_chain_testcheck(hammer2_chain_t *chain, void *bdata);
1543 int hammer2_chain_dirent_test(hammer2_chain_t *chain, const char *name,
1546 void hammer2_pfs_memory_wait(hammer2_pfs_t *pmp);
1547 void hammer2_pfs_memory_inc(hammer2_pfs_t *pmp);
1548 void hammer2_pfs_memory_wakeup(hammer2_pfs_t *pmp);
1550 void hammer2_base_delete(hammer2_chain_t *parent,
1551 hammer2_blockref_t *base, int count,
1552 hammer2_chain_t *chain);
1553 void hammer2_base_insert(hammer2_chain_t *parent,
1554 hammer2_blockref_t *base, int count,
1555 hammer2_chain_t *chain,
1556 hammer2_blockref_t *elm);
1561 int hammer2_flush(hammer2_chain_t *chain, int istop);
1562 void hammer2_delayed_flush(hammer2_chain_t *chain);
1567 void hammer2_trans_init(hammer2_pfs_t *pmp, uint32_t flags);
1568 hammer2_tid_t hammer2_trans_sub(hammer2_pfs_t *pmp);
1569 void hammer2_trans_done(hammer2_pfs_t *pmp);
1570 hammer2_tid_t hammer2_trans_newinum(hammer2_pfs_t *pmp);
1571 void hammer2_trans_assert_strategy(hammer2_pfs_t *pmp);
1572 void hammer2_dedup_record(hammer2_chain_t *chain, hammer2_io_t *dio,
1578 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data,
1579 int fflag, struct ucred *cred);
1584 void hammer2_io_putblk(hammer2_io_t **diop);
1585 void hammer2_io_inval(hammer2_io_t *dio, hammer2_off_t data_off, u_int bytes);
1586 void hammer2_io_cleanup(hammer2_dev_t *hmp, struct hammer2_io_tree *tree);
1587 char *hammer2_io_data(hammer2_io_t *dio, off_t lbase);
1588 void hammer2_io_bkvasync(hammer2_io_t *dio);
1589 hammer2_io_t *hammer2_io_getblk(hammer2_dev_t *hmp, int btype, off_t lbase,
1591 void hammer2_io_dedup_set(hammer2_dev_t *hmp, hammer2_blockref_t *bref);
1592 void hammer2_io_dedup_delete(hammer2_dev_t *hmp, uint8_t btype,
1593 hammer2_off_t data_off, u_int bytes);
1594 void hammer2_io_dedup_assert(hammer2_dev_t *hmp, hammer2_off_t data_off,
1596 void hammer2_io_callback(struct bio *bio);
1597 int hammer2_io_new(hammer2_dev_t *hmp, int btype, off_t lbase, int lsize,
1598 hammer2_io_t **diop);
1599 int hammer2_io_newnz(hammer2_dev_t *hmp, int btype, off_t lbase, int lsize,
1600 hammer2_io_t **diop);
1601 int hammer2_io_bread(hammer2_dev_t *hmp, int btype, off_t lbase, int lsize,
1602 hammer2_io_t **diop);
1603 hammer2_io_t *hammer2_io_getquick(hammer2_dev_t *hmp, off_t lbase, int lsize);
1604 void hammer2_io_bawrite(hammer2_io_t **diop);
1605 void hammer2_io_bdwrite(hammer2_io_t **diop);
1606 int hammer2_io_bwrite(hammer2_io_t **diop);
1607 void hammer2_io_setdirty(hammer2_io_t *dio);
1608 void hammer2_io_brelse(hammer2_io_t **diop);
1609 void hammer2_io_bqrelse(hammer2_io_t **diop);
1614 void hammer2_thr_signal(hammer2_thread_t *thr, uint32_t flags);
1615 void hammer2_thr_signal2(hammer2_thread_t *thr,
1616 uint32_t pflags, uint32_t nflags);
1617 void hammer2_thr_wait(hammer2_thread_t *thr, uint32_t flags);
1618 void hammer2_thr_wait_neg(hammer2_thread_t *thr, uint32_t flags);
1619 int hammer2_thr_wait_any(hammer2_thread_t *thr, uint32_t flags, int timo);
1620 void hammer2_thr_create(hammer2_thread_t *thr,
1621 hammer2_pfs_t *pmp, hammer2_dev_t *hmp,
1622 const char *id, int clindex, int repidx,
1623 void (*func)(void *arg));
1624 void hammer2_thr_delete(hammer2_thread_t *thr);
1625 void hammer2_thr_remaster(hammer2_thread_t *thr);
1626 void hammer2_thr_freeze_async(hammer2_thread_t *thr);
1627 void hammer2_thr_freeze(hammer2_thread_t *thr);
1628 void hammer2_thr_unfreeze(hammer2_thread_t *thr);
1629 int hammer2_thr_break(hammer2_thread_t *thr);
1630 void hammer2_primary_xops_thread(void *arg);
1633 * hammer2_thread.c (XOP API)
1635 void hammer2_xop_group_init(hammer2_pfs_t *pmp, hammer2_xop_group_t *xgrp);
1636 void *hammer2_xop_alloc(hammer2_inode_t *ip, int flags);
1637 void hammer2_xop_setname(hammer2_xop_head_t *xop,
1638 const char *name, size_t name_len);
1639 void hammer2_xop_setname2(hammer2_xop_head_t *xop,
1640 const char *name, size_t name_len);
1641 size_t hammer2_xop_setname_inum(hammer2_xop_head_t *xop, hammer2_key_t inum);
1642 void hammer2_xop_setip2(hammer2_xop_head_t *xop, hammer2_inode_t *ip2);
1643 void hammer2_xop_setip3(hammer2_xop_head_t *xop, hammer2_inode_t *ip3);
1644 void hammer2_xop_reinit(hammer2_xop_head_t *xop);
1645 void hammer2_xop_helper_create(hammer2_pfs_t *pmp);
1646 void hammer2_xop_helper_cleanup(hammer2_pfs_t *pmp);
1647 void hammer2_xop_start(hammer2_xop_head_t *xop, hammer2_xop_func_t func);
1648 void hammer2_xop_start_except(hammer2_xop_head_t *xop, hammer2_xop_func_t func,
1650 int hammer2_xop_collect(hammer2_xop_head_t *xop, int flags);
1651 void hammer2_xop_retire(hammer2_xop_head_t *xop, uint64_t mask);
1652 int hammer2_xop_active(hammer2_xop_head_t *xop);
1653 int hammer2_xop_feed(hammer2_xop_head_t *xop, hammer2_chain_t *chain,
1654 int clindex, int error);
1659 void hammer2_primary_sync_thread(void *arg);
1662 * XOP backends in hammer2_xops.c, primarily for VNOPS. Other XOP backends
1663 * may be integrated into other source files.
1665 void hammer2_xop_ipcluster(hammer2_thread_t *thr, hammer2_xop_t *xop);
1666 void hammer2_xop_readdir(hammer2_thread_t *thr, hammer2_xop_t *xop);
1667 void hammer2_xop_nresolve(hammer2_thread_t *thr, hammer2_xop_t *xop);
1668 void hammer2_xop_unlink(hammer2_thread_t *thr, hammer2_xop_t *xop);
1669 void hammer2_xop_nrename(hammer2_thread_t *thr, hammer2_xop_t *xop);
1670 void hammer2_xop_scanlhc(hammer2_thread_t *thr, hammer2_xop_t *xop);
1671 void hammer2_xop_scanall(hammer2_thread_t *thr, hammer2_xop_t *xop);
1672 void hammer2_xop_lookup(hammer2_thread_t *thr, hammer2_xop_t *xop);
1673 void hammer2_inode_xop_mkdirent(hammer2_thread_t *thr, hammer2_xop_t *xop);
1674 void hammer2_inode_xop_create(hammer2_thread_t *thr, hammer2_xop_t *xop);
1675 void hammer2_inode_xop_destroy(hammer2_thread_t *thr, hammer2_xop_t *xop);
1676 void hammer2_inode_xop_chain_sync(hammer2_thread_t *thr, hammer2_xop_t *xop);
1677 void hammer2_inode_xop_unlinkall(hammer2_thread_t *thr, hammer2_xop_t *xop);
1678 void hammer2_inode_xop_connect(hammer2_thread_t *thr, hammer2_xop_t *xop);
1679 void hammer2_inode_xop_flush(hammer2_thread_t *thr, hammer2_xop_t *xop);
1684 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg);
1685 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg);
1690 void hammer2_volconf_update(hammer2_dev_t *hmp, int index);
1691 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp, char pfx,
1693 int hammer2_vfs_sync(struct mount *mp, int waitflags);
1694 int hammer2_vfs_enospace(hammer2_inode_t *ip, off_t bytes, struct ucred *cred);
1696 hammer2_pfs_t *hammer2_pfsalloc(hammer2_chain_t *chain,
1697 const hammer2_inode_data_t *ripdata,
1698 hammer2_tid_t modify_tid,
1699 hammer2_dev_t *force_local);
1700 void hammer2_pfsdealloc(hammer2_pfs_t *pmp, int clindex, int destroying);
1701 int hammer2_vfs_vget(struct mount *mp, struct vnode *dvp,
1702 ino_t ino, struct vnode **vpp);
1704 void hammer2_lwinprog_ref(hammer2_pfs_t *pmp);
1705 void hammer2_lwinprog_drop(hammer2_pfs_t *pmp);
1706 void hammer2_lwinprog_wait(hammer2_pfs_t *pmp, int pipe);
1711 int hammer2_freemap_alloc(hammer2_chain_t *chain, size_t bytes);
1712 void hammer2_freemap_adjust(hammer2_dev_t *hmp,
1713 hammer2_blockref_t *bref, int how);
1718 uint8_t hammer2_cluster_type(hammer2_cluster_t *cluster);
1719 const hammer2_media_data_t *hammer2_cluster_rdata(hammer2_cluster_t *cluster);
1720 hammer2_media_data_t *hammer2_cluster_wdata(hammer2_cluster_t *cluster);
1721 hammer2_cluster_t *hammer2_cluster_from_chain(hammer2_chain_t *chain);
1722 void hammer2_cluster_bref(hammer2_cluster_t *cluster, hammer2_blockref_t *bref);
1723 hammer2_cluster_t *hammer2_cluster_alloc(hammer2_pfs_t *pmp,
1724 hammer2_blockref_t *bref);
1725 void hammer2_cluster_ref(hammer2_cluster_t *cluster);
1726 void hammer2_cluster_drop(hammer2_cluster_t *cluster);
1727 void hammer2_cluster_lock(hammer2_cluster_t *cluster, int how);
1728 int hammer2_cluster_check(hammer2_cluster_t *cluster, hammer2_key_t lokey,
1730 void hammer2_cluster_resolve(hammer2_cluster_t *cluster);
1731 void hammer2_cluster_forcegood(hammer2_cluster_t *cluster);
1732 void hammer2_cluster_unlock(hammer2_cluster_t *cluster);
1734 void hammer2_bulkfree_init(hammer2_dev_t *hmp);
1735 void hammer2_bulkfree_uninit(hammer2_dev_t *hmp);
1736 int hammer2_bulkfree_pass(hammer2_dev_t *hmp, hammer2_chain_t *vchain,
1737 struct hammer2_ioc_bulkfree *bfi);
1742 void hammer2_iocom_init(hammer2_dev_t *hmp);
1743 void hammer2_iocom_uninit(hammer2_dev_t *hmp);
1744 void hammer2_cluster_reconnect(hammer2_dev_t *hmp, struct file *fp);
1747 * hammer2_strategy.c
1749 int hammer2_vop_strategy(struct vop_strategy_args *ap);
1750 int hammer2_vop_bmap(struct vop_bmap_args *ap);
1751 void hammer2_write_thread(void *arg);
1752 void hammer2_bioq_sync(hammer2_pfs_t *pmp);
1753 void hammer2_dedup_clear(hammer2_dev_t *hmp);
1755 #endif /* !_KERNEL */
1756 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */