2 * Copyright (c) 2011-2013 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 * This header file contains structures used internally by the HAMMER2
38 * implementation. See hammer2_disk.h for on-disk structures.
41 #ifndef _VFS_HAMMER2_HAMMER2_H_
42 #define _VFS_HAMMER2_HAMMER2_H_
44 #include <sys/param.h>
45 #include <sys/types.h>
46 #include <sys/kernel.h>
48 #include <sys/systm.h>
50 #include <sys/malloc.h>
51 #include <sys/mount.h>
52 #include <sys/vnode.h>
54 #include <sys/mountctl.h>
57 #include <sys/thread.h>
58 #include <sys/globaldata.h>
59 #include <sys/lockf.h>
61 #include <sys/queue.h>
62 #include <sys/limits.h>
64 #include <sys/signal2.h>
66 #include <sys/mutex.h>
67 #include <sys/mutex2.h>
69 #include "hammer2_disk.h"
70 #include "hammer2_mount.h"
71 #include "hammer2_ioctl.h"
72 #include "hammer2_ccms.h"
77 struct hammer2_pfsmount;
83 * The chain structure tracks a portion of the media topology from the
84 * root (volume) down. Chains represent volumes, inodes, indirect blocks,
85 * data blocks, and freemap nodes and leafs.
87 * The chain structure can be multi-homed and its topological recursion
88 * (chain->core) can be shared amongst several chains. Chain structures
89 * are topologically stable once placed in the in-memory topology (they
90 * don't move around). Modifications which cross flush synchronization
91 * boundaries, renames, resizing, or any move of the chain to elsewhere
92 * in the topology is accomplished via the DELETE-DUPLICATE mechanism.
94 * DELETE-DUPLICATE allows HAMMER2 to track work across flush synchronization
95 * points without stalling the filesystem or corrupting the flush
96 * sychronization point. When necessary a chain will be marked DELETED
97 * and a new, duplicate chain will be allocated.
99 * This mechanism necessarily requires that we be able to overload chains
100 * at any given layer in the topology. Overloading is accomplished via a
101 * RBTREE recursion through chain->rbtree.
105 * (1) Fully coherent snapshots can be taken without requiring
106 * a pre-flush, resulting in extremely fast (sub-millisecond)
109 * (2) Multiple synchronization points can be in-flight at the same
110 * time, representing multiple snapshots or flushes.
112 * (3) The algorithms needed to keep track of everything are actually
115 * Special Considerations:
117 * A chain is ref-counted on a per-chain basis, but the chain's lock
118 * is associated with the shared chain_core and is not per-chain.
120 * The power-of-2 nature of the media radix tree ensures that there
121 * will be no overlaps which straddle edges.
123 RB_HEAD(hammer2_chain_tree, hammer2_chain);
124 TAILQ_HEAD(h2_flush_deferral_list, hammer2_chain);
125 TAILQ_HEAD(h2_core_list, hammer2_chain);
126 TAILQ_HEAD(h2_layer_list, hammer2_chain_layer);
128 struct hammer2_chain_layer {
130 TAILQ_ENTRY(hammer2_chain_layer) entry;
131 struct hammer2_chain_tree rbtree;
132 int refs; /* prevent destruction */
135 typedef struct hammer2_chain_layer hammer2_chain_layer_t;
137 struct hammer2_chain_core {
140 struct h2_core_list ownerq; /* all chains sharing this core */
141 struct h2_layer_list layerq;
142 u_int chain_count; /* total chains in layers */
145 u_int live_count; /* live (not deleted) chains in tree */
148 typedef struct hammer2_chain_core hammer2_chain_core_t;
150 #define HAMMER2_CORE_INDIRECT 0x0001
152 struct hammer2_chain {
153 RB_ENTRY(hammer2_chain) rbnode; /* node */
154 TAILQ_ENTRY(hammer2_chain) core_entry; /* contemporary chains */
155 hammer2_chain_layer_t *inlayer;
156 hammer2_blockref_t bref;
157 hammer2_chain_core_t *core;
158 hammer2_chain_core_t *above;
159 struct hammer2_state *state; /* if active cache msg */
160 struct hammer2_mount *hmp;
161 struct hammer2_pfsmount *pmp; /* can be NULL */
163 hammer2_tid_t modify_tid; /* snapshot/flush filter */
164 hammer2_tid_t delete_tid;
165 hammer2_key_t data_count; /* delta's to apply */
166 hammer2_key_t inode_count; /* delta's to apply */
167 struct buf *bp; /* physical data buffer */
168 u_int bytes; /* physical data size */
172 int live_zero; /* blockref array opt */
173 hammer2_media_data_t *data; /* data pointer shortcut */
174 TAILQ_ENTRY(hammer2_chain) flush_node; /* flush deferral list */
177 typedef struct hammer2_chain hammer2_chain_t;
179 int hammer2_chain_cmp(hammer2_chain_t *chain1, hammer2_chain_t *chain2);
180 RB_PROTOTYPE(hammer2_chain_tree, hammer2_chain, rbnode, hammer2_chain_cmp);
183 * Special notes on flags:
185 * INITIAL - This flag allows a chain to be created and for storage to
186 * be allocated without having to immediately instantiate the
187 * related buffer. The data is assumed to be all-zeros. It
188 * is primarily used for indirect blocks.
190 * MOVED - A modified chain becomes MOVED after it flushes. A chain
191 * can also become MOVED if it is moved within the topology
192 * (even if not modified).
194 #define HAMMER2_CHAIN_MODIFIED 0x00000001 /* dirty chain data */
195 #define HAMMER2_CHAIN_ALLOCATED 0x00000002 /* kmalloc'd chain */
196 #define HAMMER2_CHAIN_DIRTYBP 0x00000004 /* dirty on unlock */
197 #define HAMMER2_CHAIN_SUBMODIFIED 0x00000008 /* recursive flush */
198 #define HAMMER2_CHAIN_DELETED 0x00000010 /* deleted chain */
199 #define HAMMER2_CHAIN_INITIAL 0x00000020 /* initial create */
200 #define HAMMER2_CHAIN_FLUSHED 0x00000040 /* flush on unlock */
201 #define HAMMER2_CHAIN_MOVED 0x00000080 /* bref changed */
202 #define HAMMER2_CHAIN_IOFLUSH 0x00000100 /* bawrite on put */
203 #define HAMMER2_CHAIN_DEFERRED 0x00000200 /* on a deferral list */
204 #define HAMMER2_CHAIN_DESTROYED 0x00000400 /* destroying inode */
205 #define HAMMER2_CHAIN_VOLUMESYNC 0x00000800 /* needs volume sync */
206 #define HAMMER2_CHAIN_UNUSED1000 0x00001000
207 #define HAMMER2_CHAIN_MOUNTED 0x00002000 /* PFS is mounted */
208 #define HAMMER2_CHAIN_ONRBTREE 0x00004000 /* on parent RB tree */
209 #define HAMMER2_CHAIN_SNAPSHOT 0x00008000 /* snapshot special */
210 #define HAMMER2_CHAIN_EMBEDDED 0x00010000 /* embedded data */
211 #define HAMMER2_CHAIN_UNUSE20000 0x00020000
212 #define HAMMER2_CHAIN_REPLACE 0x00040000 /* replace bref */
213 #define HAMMER2_CHAIN_COUNTEDBREFS 0x00080000 /* counted brefs */
214 #define HAMMER2_CHAIN_DUPLICATED 0x00100000 /* fwd delete-dup */
215 #define HAMMER2_CHAIN_PFSROOT 0x00200000 /* in pfs->cluster */
218 * Flags passed to hammer2_chain_lookup() and hammer2_chain_next()
220 * NOTE: MATCHIND allows an indirect block / freemap node to be returned
221 * when the passed key range matches the radix. Remember that key_end
222 * is inclusive (e.g. {0x000,0xFFF}, not {0x000,0x1000}).
224 #define HAMMER2_LOOKUP_NOLOCK 0x00000001 /* ref only */
225 #define HAMMER2_LOOKUP_NODATA 0x00000002 /* data left NULL */
226 #define HAMMER2_LOOKUP_SHARED 0x00000100
227 #define HAMMER2_LOOKUP_MATCHIND 0x00000200
228 #define HAMMER2_LOOKUP_FREEMAP 0x00000400 /* freemap base */
229 #define HAMMER2_LOOKUP_ALWAYS 0x00000800 /* resolve data */
232 * Flags passed to hammer2_chain_modify() and hammer2_chain_resize()
234 * NOTE: OPTDATA allows us to avoid instantiating buffers for INDIRECT
235 * blocks in the INITIAL-create state.
237 #define HAMMER2_MODIFY_OPTDATA 0x00000002 /* data can be NULL */
238 #define HAMMER2_MODIFY_NO_MODIFY_TID 0x00000004
239 #define HAMMER2_MODIFY_ASSERTNOCOPY 0x00000008
240 #define HAMMER2_MODIFY_NOREALLOC 0x00000010
243 * Flags passed to hammer2_chain_lock()
245 #define HAMMER2_RESOLVE_NEVER 1
246 #define HAMMER2_RESOLVE_MAYBE 2
247 #define HAMMER2_RESOLVE_ALWAYS 3
248 #define HAMMER2_RESOLVE_MASK 0x0F
250 #define HAMMER2_RESOLVE_SHARED 0x10 /* request shared lock */
251 #define HAMMER2_RESOLVE_NOREF 0x20 /* already ref'd on lock */
254 * Flags passed to hammer2_chain_delete()
256 #define HAMMER2_DELETE_WILLDUP 0x0001 /* no blk free, will be dup */
259 * Flags passed to hammer2_chain_delete_duplicate()
261 #define HAMMER2_DELDUP_RECORE 0x0001
264 * Cluster different types of storage together for allocations
266 #define HAMMER2_FREECACHE_INODE 0
267 #define HAMMER2_FREECACHE_INDIR 1
268 #define HAMMER2_FREECACHE_DATA 2
269 #define HAMMER2_FREECACHE_UNUSED3 3
270 #define HAMMER2_FREECACHE_TYPES 4
273 * hammer2_freemap_alloc() block preference
275 #define HAMMER2_OFF_NOPREF ((hammer2_off_t)-1)
278 * BMAP read-ahead maximum parameters
280 #define HAMMER2_BMAP_COUNT 16 /* max bmap read-ahead */
281 #define HAMMER2_BMAP_BYTES (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT)
286 #define HAMMER2_FLUSH_DEPTH_LIMIT 40 /* stack recursion limit */
289 * HAMMER2 IN-MEMORY CACHE OF MEDIA STRUCTURES
291 * There is an in-memory representation of all on-media data structure.
292 * Basically everything is represented by a hammer2_chain structure
293 * in-memory and other higher-level structures map to chains.
295 * A great deal of data is accessed simply via its buffer cache buffer,
296 * which is mapped for the duration of the chain's lock. However, because
297 * chains may represent blocks smaller than the 16KB minimum we impose
298 * on buffer cache buffers, we cannot hold related buffer cache buffers
299 * locked for smaller blocks. In these situations we kmalloc() a copy
302 * When modifications are made to a chain a new filesystem block must be
303 * allocated. Multiple modifications do not necessarily allocate new
304 * blocks. However, when a flush occurs a flush synchronization point
305 * is created and any new modifications made after this point will allocate
306 * a new block even if the chain is already in a modified state.
308 * The in-memory representation may remain cached (for example in order to
309 * placemark clustering locks) even after the related data has been
314 * In order to support concurrent flushes a flush synchronization point
315 * is created represented by a transaction id. Among other things,
316 * operations may move filesystem objects from one part of the topology
317 * to another (for example, if you rename a file or when indirect blocks
318 * are created or destroyed, and a few other things). When this occurs
319 * across a flush synchronization point the flusher needs to be able to
320 * recurse down BOTH the 'before' version of the topology and the 'after'
323 * To facilitate this modifications to chains do what is called a
324 * DELETE-DUPLICATE operation. Chains are not actually moved in-memory.
325 * Instead the chain we wish to move is deleted and a new chain is created
326 * at the target location in the topology. ANY SUBCHAINS PLACED UNDER THE
327 * CHAIN BEING MOVED HAVE TO EXIST IN BOTH PLACES. To make this work
328 * all sub-chains are managed by the hammer2_chain_core structure. This
329 * structure can be multi-homed, meaning that it can have more than one
330 * chain as its parent. When a chain is delete-duplicated the chain's core
331 * becomes shared under both the old and new chain.
335 * When a chain is delete-duplicated the old chain typically becomes stale.
336 * This is detected via the HAMMER2_CHAIN_DUPLICATED flag in chain->flags.
337 * To avoid executing live filesystem operations on stale chains, the inode
338 * locking code will follow stale chains via core->ownerq until it finds
339 * the live chain. The lock prevents ripups by other threads. Lookups
340 * must properly order locking operations to prevent other threads from
341 * racing the lookup operation and will also follow stale chains when
345 RB_HEAD(hammer2_inode_tree, hammer2_inode);
350 * NOTE: The inode's attribute CST which is also used to lock the inode
351 * is embedded in the chain (chain.cst) and aliased w/ attr_cst.
353 struct hammer2_inode {
354 RB_ENTRY(hammer2_inode) rbnode; /* inumber lookup (HL) */
355 ccms_cst_t topo_cst; /* directory topology cst */
356 struct hammer2_pfsmount *pmp; /* PFS mount */
357 struct hammer2_inode *pip; /* parent inode */
359 hammer2_chain_t *chain; /* NOTE: rehomed on rename */
360 struct lockf advlock;
363 u_int refs; /* +vpref, +flushref */
364 uint8_t comp_heuristic;
369 typedef struct hammer2_inode hammer2_inode_t;
371 #define HAMMER2_INODE_MODIFIED 0x0001
372 #define HAMMER2_INODE_SROOT 0x0002 /* kmalloc special case */
373 #define HAMMER2_INODE_RENAME_INPROG 0x0004
374 #define HAMMER2_INODE_ONRBTREE 0x0008
375 #define HAMMER2_INODE_RESIZED 0x0010
376 #define HAMMER2_INODE_MTIME 0x0020
378 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2);
379 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp,
383 * A hammer2 transaction and flush sequencing structure.
385 * This global structure is tied into hammer2_mount and is used
386 * to sequence modifying operations and flushes.
388 * (a) Any modifying operations with sync_tid >= flush_tid will stall until
389 * all modifying operating with sync_tid < flush_tid complete.
391 * The flush related to flush_tid stalls until all modifying operations
392 * with sync_tid < flush_tid complete.
394 * (b) Once unstalled, modifying operations with sync_tid > flush_tid are
395 * allowed to run. All modifications cause modify/duplicate operations
396 * to occur on the related chains. Note that most INDIRECT blocks will
397 * be unaffected because the modifications just overload the RBTREE
398 * structurally instead of actually modifying the indirect blocks.
400 * (c) The actual flush unstalls and RUNS CONCURRENTLY with (b), but only
401 * utilizes the chain structures with sync_tid <= flush_tid. The
402 * flush will modify related indirect blocks and inodes in-place
403 * (rather than duplicate) since the adjustments are compatible with
404 * (b)'s RBTREE overloading
406 * SPECIAL NOTE: Inode modifications have to also propagate along any
407 * modify/duplicate chains. File writes detect the flush
408 * and force out the conflicting buffer cache buffer(s)
409 * before reusing them.
411 * (d) Snapshots can be made instantly but must be flushed and disconnected
412 * from their duplicative source before they can be mounted. This is
413 * because while H2's on-media structure supports forks, its in-memory
414 * structure only supports very simple forking for background flushing
417 * TODO: Flush merging. When fsync() is called on multiple discrete files
418 * concurrently there is no reason to stall the second fsync.
419 * The final flush that reaches to root can cover both fsync()s.
421 * The chains typically terminate as they fly onto the disk. The flush
422 * ultimately reaches the volume header.
424 struct hammer2_trans {
425 TAILQ_ENTRY(hammer2_trans) entry;
426 struct hammer2_pfsmount *pmp;
427 hammer2_tid_t sync_tid;
428 thread_t td; /* pointer */
431 uint8_t inodes_created;
435 typedef struct hammer2_trans hammer2_trans_t;
437 #define HAMMER2_TRANS_ISFLUSH 0x0001 /* formal flush */
438 #define HAMMER2_TRANS_RESTRICTED 0x0002 /* snapshot flush restrict */
439 #define HAMMER2_TRANS_BUFCACHE 0x0004 /* from bioq strategy write */
441 #define HAMMER2_FREEMAP_HEUR_NRADIX 4 /* pwr 2 PBUFRADIX-MINIORADIX */
442 #define HAMMER2_FREEMAP_HEUR_TYPES 8
443 #define HAMMER2_FREEMAP_HEUR (HAMMER2_FREEMAP_HEUR_NRADIX * \
444 HAMMER2_FREEMAP_HEUR_TYPES)
447 * Global (per device) mount structure for device (aka vp->v_mount->hmp)
449 TAILQ_HEAD(hammer2_trans_queue, hammer2_trans);
451 struct hammer2_mount {
452 struct vnode *devvp; /* device vnode */
453 int ronly; /* read-only mount */
454 int pmp_count; /* PFS mounts backed by us */
455 TAILQ_ENTRY(hammer2_mount) mntentry; /* hammer2_mntlist */
457 struct malloc_type *mchain;
460 hammer2_chain_t vchain; /* anchor chain (topology) */
461 hammer2_chain_t fchain; /* anchor chain (freemap) */
462 hammer2_inode_t *sroot; /* super-root localized to media */
463 struct lock alloclk; /* lockmgr lock */
464 struct lock voldatalk; /* lockmgr lock */
465 struct hammer2_trans_queue transq; /* all in-progress transactions */
466 hammer2_trans_t *curflush; /* current flush in progress */
467 hammer2_tid_t topo_flush_tid; /* currently synchronizing flush pt */
468 hammer2_tid_t free_flush_tid; /* currently synchronizing flush pt */
469 hammer2_off_t heur_freemap[HAMMER2_FREEMAP_HEUR];
470 int flushcnt; /* #of flush trans on the list */
472 int volhdrno; /* last volhdrno written */
473 hammer2_volume_data_t voldata;
474 hammer2_volume_data_t volsync; /* synchronized voldata */
477 typedef struct hammer2_mount hammer2_mount_t;
480 * HAMMER2 cluster - a device/root associated with a PFS.
482 * A PFS may have several hammer2_cluster's associated with it.
484 #define HAMMER2_MAXCLUSTER 8
486 struct hammer2_cluster {
489 hammer2_chain_t *chains[HAMMER2_MAXCLUSTER];
492 typedef struct hammer2_cluster hammer2_cluster_t;
495 * HAMMER2 PFS mount point structure (aka vp->v_mount->mnt_data).
496 * This has a 1:1 correspondence to struct mount (note that the
497 * hammer2_mount structure has a N:1 correspondence).
499 * This structure represents a cluster mount and not necessarily a
500 * PFS under a specific device mount (HMP). The distinction is important
501 * because the elements backing a cluster mount can change on the fly.
503 * Usually the first element under the cluster represents the original
504 * user-requested mount that bootstraps the whole mess. In significant
505 * setups the original is usually just a read-only media image (or
506 * representitive file) that simply contains a bootstrap volume header
507 * listing the configuration.
509 struct hammer2_pfsmount {
511 hammer2_cluster_t cluster;
512 hammer2_inode_t *iroot; /* PFS root inode */
513 hammer2_off_t inode_count; /* copy of inode_count */
514 ccms_domain_t ccms_dom;
515 struct netexport export; /* nfs export */
516 int ronly; /* read-only mount */
517 struct malloc_type *minode;
518 struct malloc_type *mmsg;
520 struct spinlock inum_spin; /* inumber lookup */
521 struct hammer2_inode_tree inum_tree;
525 thread_t wthread_td; /* write thread td */
526 struct bio_queue_head wthread_bioq; /* logical buffer bioq */
527 struct mtx wthread_mtx; /* interlock */
528 int wthread_destroy;/* termination sequencing */
531 typedef struct hammer2_pfsmount hammer2_pfsmount_t;
533 struct hammer2_cbinfo {
534 hammer2_chain_t *chain;
535 void (*func)(hammer2_chain_t *, struct buf *, char *, void *);
540 typedef struct hammer2_cbinfo hammer2_cbinfo_t;
544 MALLOC_DECLARE(M_HAMMER2);
546 #define VTOI(vp) ((hammer2_inode_t *)(vp)->v_data)
547 #define ITOV(ip) ((ip)->vp)
550 * Currently locked chains retain the locked buffer cache buffer for
551 * indirect blocks, and indirect blocks can be one of two sizes. The
552 * device buffer has to match the case to avoid deadlocking recursive
553 * chains that might otherwise try to access different offsets within
554 * the same device buffer.
558 hammer2_devblkradix(int radix)
561 if (radix <= HAMMER2_LBUFRADIX) {
562 return (HAMMER2_LBUFRADIX);
564 return (HAMMER2_PBUFRADIX);
567 return (HAMMER2_PBUFRADIX);
573 hammer2_devblksize(size_t bytes)
576 if (bytes <= HAMMER2_LBUFSIZE) {
577 return(HAMMER2_LBUFSIZE);
579 KKASSERT(bytes <= HAMMER2_PBUFSIZE &&
580 (bytes ^ (bytes - 1)) == ((bytes << 1) - 1));
581 return (HAMMER2_PBUFSIZE);
584 KKASSERT(bytes <= HAMMER2_PBUFSIZE &&
585 (bytes ^ (bytes - 1)) == ((bytes << 1) - 1));
586 return(HAMMER2_PBUFSIZE);
593 MPTOPMP(struct mount *mp)
595 return ((hammer2_pfsmount_t *)mp->mnt_data);
598 extern struct vop_ops hammer2_vnode_vops;
599 extern struct vop_ops hammer2_spec_vops;
600 extern struct vop_ops hammer2_fifo_vops;
602 extern int hammer2_debug;
603 extern int hammer2_cluster_enable;
604 extern int hammer2_hardlink_enable;
605 extern long hammer2_iod_file_read;
606 extern long hammer2_iod_meta_read;
607 extern long hammer2_iod_indr_read;
608 extern long hammer2_iod_fmap_read;
609 extern long hammer2_iod_volu_read;
610 extern long hammer2_iod_file_write;
611 extern long hammer2_iod_meta_write;
612 extern long hammer2_iod_indr_write;
613 extern long hammer2_iod_fmap_write;
614 extern long hammer2_iod_volu_write;
615 extern long hammer2_ioa_file_read;
616 extern long hammer2_ioa_meta_read;
617 extern long hammer2_ioa_indr_read;
618 extern long hammer2_ioa_fmap_read;
619 extern long hammer2_ioa_volu_read;
620 extern long hammer2_ioa_file_write;
621 extern long hammer2_ioa_meta_write;
622 extern long hammer2_ioa_indr_write;
623 extern long hammer2_ioa_fmap_write;
624 extern long hammer2_ioa_volu_write;
626 extern struct objcache *cache_buffer_read;
627 extern struct objcache *cache_buffer_write;
630 extern int write_thread_wakeup;
632 extern mtx_t thread_protect;
637 #define hammer2_icrc32(buf, size) iscsi_crc32((buf), (size))
638 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc))
640 hammer2_chain_t *hammer2_inode_lock_ex(hammer2_inode_t *ip);
641 hammer2_chain_t *hammer2_inode_lock_sh(hammer2_inode_t *ip);
642 void hammer2_inode_unlock_ex(hammer2_inode_t *ip, hammer2_chain_t *chain);
643 void hammer2_inode_unlock_sh(hammer2_inode_t *ip, hammer2_chain_t *chain);
644 void hammer2_voldata_lock(hammer2_mount_t *hmp);
645 void hammer2_voldata_unlock(hammer2_mount_t *hmp, int modify);
646 ccms_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip);
647 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip, ccms_state_t ostate);
648 ccms_state_t hammer2_inode_lock_upgrade(hammer2_inode_t *ip);
649 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, ccms_state_t ostate);
651 void hammer2_mount_exlock(hammer2_mount_t *hmp);
652 void hammer2_mount_shlock(hammer2_mount_t *hmp);
653 void hammer2_mount_unlock(hammer2_mount_t *hmp);
655 int hammer2_get_dtype(hammer2_chain_t *chain);
656 int hammer2_get_vtype(hammer2_chain_t *chain);
657 u_int8_t hammer2_get_obj_type(enum vtype vtype);
658 void hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts);
659 u_int64_t hammer2_timespec_to_time(struct timespec *ts);
660 u_int32_t hammer2_to_unix_xid(uuid_t *uuid);
661 void hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
663 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len);
664 int hammer2_getradix(size_t bytes);
666 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
667 hammer2_key_t *lbasep, hammer2_key_t *leofp);
668 int hammer2_calc_physical(hammer2_inode_t *ip, hammer2_key_t lbase);
669 void hammer2_update_time(uint64_t *timep);
674 struct vnode *hammer2_igetv(hammer2_inode_t *ip, int *errorp);
676 void hammer2_inode_lock_nlinks(hammer2_inode_t *ip);
677 void hammer2_inode_unlock_nlinks(hammer2_inode_t *ip);
678 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfsmount_t *pmp,
680 hammer2_inode_t *hammer2_inode_get(hammer2_pfsmount_t *pmp,
681 hammer2_inode_t *dip, hammer2_chain_t *chain);
682 void hammer2_inode_free(hammer2_inode_t *ip);
683 void hammer2_inode_ref(hammer2_inode_t *ip);
684 void hammer2_inode_drop(hammer2_inode_t *ip);
685 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip,
686 hammer2_chain_t *chain);
688 hammer2_inode_t *hammer2_inode_create(hammer2_trans_t *trans,
689 hammer2_inode_t *dip,
690 struct vattr *vap, struct ucred *cred,
691 const uint8_t *name, size_t name_len,
692 hammer2_chain_t **chainp, int *errorp);
693 int hammer2_inode_connect(hammer2_trans_t *trans, int hlink,
694 hammer2_inode_t *dip, hammer2_chain_t **chainp,
695 const uint8_t *name, size_t name_len);
696 hammer2_inode_t *hammer2_inode_common_parent(hammer2_inode_t *fdip,
697 hammer2_inode_t *tdip);
698 void hammer2_inode_fsync(hammer2_trans_t *trans, hammer2_inode_t *ip,
699 hammer2_chain_t **parentp);
700 int hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
701 const uint8_t *name, size_t name_len, int isdir,
703 int hammer2_hardlink_consolidate(hammer2_trans_t *trans, hammer2_inode_t *ip,
704 hammer2_chain_t **chainp,
705 hammer2_inode_t *tdip, int linkcnt);
706 int hammer2_hardlink_deconsolidate(hammer2_trans_t *trans, hammer2_inode_t *dip,
707 hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
708 int hammer2_hardlink_find(hammer2_inode_t *dip,
709 hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
714 void hammer2_modify_volume(hammer2_mount_t *hmp);
715 hammer2_chain_t *hammer2_chain_alloc(hammer2_mount_t *hmp, hammer2_pfsmount_t *pmp,
716 hammer2_trans_t *trans, hammer2_blockref_t *bref);
717 void hammer2_chain_core_alloc(hammer2_trans_t *trans, hammer2_chain_t *nchain,
718 hammer2_chain_t *ochain);
719 void hammer2_chain_ref(hammer2_chain_t *chain);
720 void hammer2_chain_drop(hammer2_chain_t *chain);
721 int hammer2_chain_lock(hammer2_chain_t *chain, int how);
722 void hammer2_chain_load_async(hammer2_chain_t *chain,
723 void (*func)(hammer2_chain_t *, struct buf *,
726 void hammer2_chain_moved(hammer2_chain_t *chain);
727 void hammer2_chain_modify(hammer2_trans_t *trans,
728 hammer2_chain_t **chainp, int flags);
729 hammer2_inode_data_t *hammer2_chain_modify_ip(hammer2_trans_t *trans,
730 hammer2_inode_t *ip, hammer2_chain_t **chainp,
732 void hammer2_chain_resize(hammer2_trans_t *trans, hammer2_inode_t *ip,
733 hammer2_chain_t *parent,
734 hammer2_chain_t **chainp,
735 int nradix, int flags);
736 void hammer2_chain_unlock(hammer2_chain_t *chain);
737 void hammer2_chain_wait(hammer2_chain_t *chain);
738 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent,
739 hammer2_blockref_t *bref);
740 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags);
741 void hammer2_chain_lookup_done(hammer2_chain_t *parent);
742 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp,
743 hammer2_key_t *key_nextp,
744 hammer2_key_t key_beg, hammer2_key_t key_end,
745 int *cache_indexp, int flags);
746 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp,
747 hammer2_chain_t *chain,
748 hammer2_key_t *key_nextp,
749 hammer2_key_t key_beg, hammer2_key_t key_end,
750 int *cache_indexp, int flags);
752 int hammer2_chain_create(hammer2_trans_t *trans,
753 hammer2_chain_t **parentp,
754 hammer2_chain_t **chainp,
755 hammer2_key_t key, int keybits,
756 int type, size_t bytes);
757 void hammer2_chain_duplicate(hammer2_trans_t *trans, hammer2_chain_t *parent,
758 hammer2_chain_t **chainp,
759 hammer2_blockref_t *bref, int snapshot);
760 int hammer2_chain_snapshot(hammer2_trans_t *trans, hammer2_chain_t *chain,
761 hammer2_ioc_pfs_t *pfs);
762 void hammer2_chain_delete(hammer2_trans_t *trans, hammer2_chain_t *chain,
764 void hammer2_chain_delete_duplicate(hammer2_trans_t *trans,
765 hammer2_chain_t **chainp, int flags);
766 void hammer2_chain_flush(hammer2_trans_t *trans, hammer2_chain_t *chain);
767 void hammer2_chain_commit(hammer2_trans_t *trans, hammer2_chain_t *chain);
768 void hammer2_chain_setsubmod(hammer2_trans_t *trans, hammer2_chain_t *chain);
770 void hammer2_chain_memory_wait(hammer2_pfsmount_t *pmp);
771 void hammer2_chain_memory_wakeup(hammer2_pfsmount_t *pmp);
772 void hammer2_chain_countbrefs(hammer2_chain_t *chain,
773 hammer2_blockref_t *base, int count);
774 void hammer2_chain_layer_check_locked(hammer2_mount_t *hmp,
775 hammer2_chain_core_t *core);
777 int hammer2_base_find(hammer2_chain_t *chain,
778 hammer2_blockref_t *base, int count,
779 int *cache_indexp, hammer2_key_t *key_nextp,
780 hammer2_key_t key_beg, hammer2_key_t key_end);
781 void hammer2_base_delete(hammer2_chain_t *chain,
782 hammer2_blockref_t *base, int count,
783 int *cache_indexp, hammer2_blockref_t *elm);
784 void hammer2_base_insert(hammer2_chain_t *chain,
785 hammer2_blockref_t *base, int count,
786 int *cache_indexp, hammer2_blockref_t *elm,
792 void hammer2_trans_init(hammer2_trans_t *trans,
793 hammer2_pfsmount_t *pmp, int flags);
794 void hammer2_trans_done(hammer2_trans_t *trans);
799 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data,
800 int fflag, struct ucred *cred);
805 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg);
806 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg);
811 void hammer2_clusterctl_wakeup(kdmsg_iocom_t *iocom);
812 void hammer2_volconf_update(hammer2_pfsmount_t *pmp, int index);
813 void hammer2_cluster_reconnect(hammer2_pfsmount_t *pmp, struct file *fp);
814 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp);
819 int hammer2_freemap_alloc(hammer2_trans_t *trans, hammer2_mount_t *hmp,
820 hammer2_blockref_t *bref, size_t bytes);
821 void hammer2_freemap_free(hammer2_trans_t *trans, hammer2_mount_t *hmp,
822 hammer2_blockref_t *bref, int how);
825 #endif /* !_KERNEL */
826 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */