Remove obsolete ieee80211_amrr.9 manual page.
[dragonfly.git] / sys / vfs / hammer2 / hammer2.h
1 /*
2  * Copyright (c) 2011-2014 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/signal2.h>
85 #include <sys/dmsg.h>
86 #include <sys/mutex.h>
87 #include <sys/kern_syscall.h>
88
89 #include <sys/buf2.h>
90 #include <sys/mutex2.h>
91
92 #include "hammer2_disk.h"
93 #include "hammer2_mount.h"
94 #include "hammer2_ioctl.h"
95 #include "hammer2_ccms.h"
96
97 struct hammer2_chain;
98 struct hammer2_cluster;
99 struct hammer2_inode;
100 struct hammer2_mount;
101 struct hammer2_pfsmount;
102 struct hammer2_span;
103 struct hammer2_state;
104 struct hammer2_msg;
105
106 /*
107  * The xid tracks internal transactional updates.
108  *
109  * XXX fix-me, really needs to be 64-bits
110  */
111 typedef uint32_t hammer2_xid_t;
112
113 #define HAMMER2_XID_MIN 0x00000000U
114 #define HAMMER2_XID_MAX 0x7FFFFFFFU
115
116 /*
117  * The chain structure tracks a portion of the media topology from the
118  * root (volume) down.  Chains represent volumes, inodes, indirect blocks,
119  * data blocks, and freemap nodes and leafs.
120  *
121  * The chain structure utilizes a simple singly-homed topology and the
122  * chain's in-memory topology will move around as the chains do, due mainly
123  * to renames and indirect block creation.
124  *
125  * Block Table Updates
126  *
127  *      Block table updates for insertions and updates are delayed until the
128  *      flush.  This allows us to avoid having to modify the parent chain
129  *      all the way to the root.
130  *
131  *      Block table deletions are performed immediately (modifying the parent
132  *      in the process) because the flush code uses the chain structure to
133  *      track delayed updates and the chain will be (likely) gone or moved to
134  *      another location in the topology after a deletion.
135  *
136  *      A prior iteration of the code tried to keep the relationship intact
137  *      on deletes by doing a delete-duplicate operation on the chain, but
138  *      it added way too much complexity to the codebase.
139  *
140  * Flush Synchronization
141  *
142  *      The flush code must flush modified chains bottom-up.  Because chain
143  *      structures can shift around and are NOT topologically stable,
144  *      modified chains are independently indexed for the flush.  As the flush
145  *      runs it modifies (or further modifies) and updates the parents,
146  *      propagating the flush all the way to the volume root.
147  *
148  *      Modifying front-end operations can occur during a flush but will block
149  *      in two cases: (1) when the front-end tries to operate on the inode
150  *      currently in the midst of being flushed and (2) if the front-end
151  *      crosses an inode currently being flushed (such as during a rename).
152  *      So, for example, if you rename directory "x" to "a/b/c/d/e/f/g/x" and
153  *      the flusher is currently working on "a/b/c", the rename will block
154  *      temporarily in order to ensure that "x" exists in one place or the
155  *      other.
156  *
157  *      Meta-data statistics are updated by the flusher.  The front-end will
158  *      make estimates but meta-data must be fully synchronized only during a
159  *      flush in order to ensure that it remains correct across a crash.
160  *
161  *      Multiple flush synchronizations can theoretically be in-flight at the
162  *      same time but the implementation is not coded to handle the case and
163  *      currently serializes them.
164  *
165  * Snapshots:
166  *
167  *      Snapshots currently require the subdirectory tree being snapshotted
168  *      to be flushed.  The snapshot then creates a new super-root inode which
169  *      copies the flushed blockdata of the directory or file that was
170  *      snapshotted.
171  *
172  * RBTREE NOTES:
173  *
174  *      - Note that the radix tree runs in powers of 2 only so sub-trees
175  *        cannot straddle edges.
176  */
177 RB_HEAD(hammer2_chain_tree, hammer2_chain);
178 TAILQ_HEAD(h2_flush_list, hammer2_chain);
179 TAILQ_HEAD(h2_core_list, hammer2_chain);
180
181 #define CHAIN_CORE_DELETE_BMAP_ENTRIES  \
182         (HAMMER2_PBUFSIZE / sizeof(hammer2_blockref_t) / sizeof(uint32_t))
183
184 struct hammer2_chain_core {
185         struct ccms_cst cst;
186         struct hammer2_chain_tree rbtree; /* sub-chains */
187         int             live_zero;      /* blockref array opt */
188         u_int           flags;
189         u_int           live_count;     /* live (not deleted) chains in tree */
190         u_int           chain_count;    /* live + deleted chains under core */
191         int             generation;     /* generation number (inserts only) */
192 };
193
194 typedef struct hammer2_chain_core hammer2_chain_core_t;
195
196 #define HAMMER2_CORE_UNUSED0001         0x0001
197 #define HAMMER2_CORE_COUNTEDBREFS       0x0002
198
199 /*
200  * H2 is a copy-on-write filesystem.  In order to allow chains to allocate
201  * smaller blocks (down to 64-bytes), but improve performance and make
202  * clustered I/O possible using larger block sizes, the kernel buffer cache
203  * is abstracted via the hammer2_io structure.
204  */
205 RB_HEAD(hammer2_io_tree, hammer2_io);
206
207 struct hammer2_io {
208         RB_ENTRY(hammer2_io) rbnode;    /* indexed by device offset */
209         struct spinlock spin;
210         struct hammer2_mount *hmp;
211         struct buf      *bp;
212         struct bio      *bio;
213         off_t           pbase;
214         int             psize;
215         void            (*callback)(struct hammer2_io *dio,
216                                     struct hammer2_cluster *cluster,
217                                     struct hammer2_chain *chain,
218                                     void *arg1, off_t arg2);
219         struct hammer2_cluster *arg_l;          /* INPROG I/O only */
220         struct hammer2_chain *arg_c;            /* INPROG I/O only */
221         void            *arg_p;                 /* INPROG I/O only */
222         off_t           arg_o;                  /* INPROG I/O only */
223         int             refs;
224         int             act;                    /* activity */
225 };
226
227 typedef struct hammer2_io hammer2_io_t;
228
229 /*
230  * Primary chain structure keeps track of the topology in-memory.
231  */
232 struct hammer2_chain {
233         hammer2_chain_core_t    core;
234         RB_ENTRY(hammer2_chain) rbnode;         /* live chain(s) */
235         hammer2_blockref_t      bref;
236         struct hammer2_chain    *parent;
237         struct hammer2_state    *state;         /* if active cache msg */
238         struct hammer2_mount    *hmp;
239         struct hammer2_pfsmount *pmp;           /* (pfs-cluster pmp or spmp) */
240
241         hammer2_xid_t   flush_xid;              /* flush sequencing */
242         hammer2_key_t   data_count;             /* delta's to apply */
243         hammer2_key_t   inode_count;            /* delta's to apply */
244         hammer2_key_t   data_count_up;          /* delta's to apply */
245         hammer2_key_t   inode_count_up;         /* delta's to apply */
246         hammer2_io_t    *dio;                   /* physical data buffer */
247         u_int           bytes;                  /* physical data size */
248         u_int           flags;
249         u_int           refs;
250         u_int           lockcnt;
251         hammer2_media_data_t *data;             /* data pointer shortcut */
252         TAILQ_ENTRY(hammer2_chain) flush_node;  /* flush list */
253 };
254
255 typedef struct hammer2_chain hammer2_chain_t;
256
257 int hammer2_chain_cmp(hammer2_chain_t *chain1, hammer2_chain_t *chain2);
258 RB_PROTOTYPE(hammer2_chain_tree, hammer2_chain, rbnode, hammer2_chain_cmp);
259
260 /*
261  * Special notes on flags:
262  *
263  * INITIAL - This flag allows a chain to be created and for storage to
264  *           be allocated without having to immediately instantiate the
265  *           related buffer.  The data is assumed to be all-zeros.  It
266  *           is primarily used for indirect blocks.
267  *
268  * MODIFIED- The chain's media data has been modified.
269  * UPDATE  - Chain might not be modified but parent blocktable needs update
270  *
271  * BMAPPED - Indicates that the chain is present in the parent blockmap.
272  * BMAPUPD - Indicates that the chain is present but needs to be updated
273  *           in the parent blockmap.
274  */
275 #define HAMMER2_CHAIN_MODIFIED          0x00000001      /* dirty chain data */
276 #define HAMMER2_CHAIN_ALLOCATED         0x00000002      /* kmalloc'd chain */
277 #define HAMMER2_CHAIN_DESTROY           0x00000004
278 #define HAMMER2_CHAIN_UNUSED00000008    0x00000008
279 #define HAMMER2_CHAIN_DELETED           0x00000010      /* deleted chain */
280 #define HAMMER2_CHAIN_INITIAL           0x00000020      /* initial create */
281 #define HAMMER2_CHAIN_UPDATE            0x00000040      /* need parent update */
282 #define HAMMER2_CHAIN_DEFERRED          0x00000080      /* flush depth defer */
283 #define HAMMER2_CHAIN_IOFLUSH           0x00000100      /* bawrite on put */
284 #define HAMMER2_CHAIN_ONFLUSH           0x00000200      /* on a flush list */
285 #define HAMMER2_CHAIN_UNUSED00000400    0x00000400
286 #define HAMMER2_CHAIN_VOLUMESYNC        0x00000800      /* needs volume sync */
287 #define HAMMER2_CHAIN_UNUSED00001000    0x00001000
288 #define HAMMER2_CHAIN_MOUNTED           0x00002000      /* PFS is mounted */
289 #define HAMMER2_CHAIN_ONRBTREE          0x00004000      /* on parent RB tree */
290 #define HAMMER2_CHAIN_SNAPSHOT          0x00008000      /* snapshot special */
291 #define HAMMER2_CHAIN_EMBEDDED          0x00010000      /* embedded data */
292 #define HAMMER2_CHAIN_RELEASE           0x00020000      /* don't keep around */
293 #define HAMMER2_CHAIN_BMAPPED           0x00040000      /* present in blkmap */
294 #define HAMMER2_CHAIN_BMAPUPD           0x00080000      /* +needs updating */
295 #define HAMMER2_CHAIN_UNUSED00100000    0x00100000
296 #define HAMMER2_CHAIN_UNUSED00200000    0x00200000
297 #define HAMMER2_CHAIN_PFSBOUNDARY       0x00400000      /* super->pfs inode */
298
299 #define HAMMER2_CHAIN_FLUSH_MASK        (HAMMER2_CHAIN_MODIFIED |       \
300                                          HAMMER2_CHAIN_UPDATE |         \
301                                          HAMMER2_CHAIN_ONFLUSH)
302
303 /*
304  * Flags passed to hammer2_chain_lookup() and hammer2_chain_next()
305  *
306  * NOTE: MATCHIND allows an indirect block / freemap node to be returned
307  *       when the passed key range matches the radix.  Remember that key_end
308  *       is inclusive (e.g. {0x000,0xFFF}, not {0x000,0x1000}).
309  */
310 #define HAMMER2_LOOKUP_NOLOCK           0x00000001      /* ref only */
311 #define HAMMER2_LOOKUP_NODATA           0x00000002      /* data left NULL */
312 #define HAMMER2_LOOKUP_SHARED           0x00000100
313 #define HAMMER2_LOOKUP_MATCHIND         0x00000200      /* return all chains */
314 #define HAMMER2_LOOKUP_UNUSED0400       0x00000400
315 #define HAMMER2_LOOKUP_ALWAYS           0x00000800      /* resolve data */
316
317 /*
318  * Flags passed to hammer2_chain_modify() and hammer2_chain_resize()
319  *
320  * NOTE: OPTDATA allows us to avoid instantiating buffers for INDIRECT
321  *       blocks in the INITIAL-create state.
322  */
323 #define HAMMER2_MODIFY_OPTDATA          0x00000002      /* data can be NULL */
324 #define HAMMER2_MODIFY_NO_MODIFY_TID    0x00000004
325 #define HAMMER2_MODIFY_UNUSED0008       0x00000008
326 #define HAMMER2_MODIFY_NOREALLOC        0x00000010
327
328 /*
329  * Flags passed to hammer2_chain_lock()
330  */
331 #define HAMMER2_RESOLVE_NEVER           1
332 #define HAMMER2_RESOLVE_MAYBE           2
333 #define HAMMER2_RESOLVE_ALWAYS          3
334 #define HAMMER2_RESOLVE_MASK            0x0F
335
336 #define HAMMER2_RESOLVE_SHARED          0x10    /* request shared lock */
337 #define HAMMER2_RESOLVE_NOREF           0x20    /* already ref'd on lock */
338
339 /*
340  * Flags passed to hammer2_chain_delete()
341  */
342 #define HAMMER2_DELETE_PERMANENT        0x0001
343 #define HAMMER2_DELETE_NOSTATS          0x0002
344
345 #define HAMMER2_INSERT_NOSTATS          0x0002
346
347 /*
348  * Flags passed to hammer2_chain_delete_duplicate()
349  */
350 #define HAMMER2_DELDUP_RECORE           0x0001
351
352 /*
353  * Cluster different types of storage together for allocations
354  */
355 #define HAMMER2_FREECACHE_INODE         0
356 #define HAMMER2_FREECACHE_INDIR         1
357 #define HAMMER2_FREECACHE_DATA          2
358 #define HAMMER2_FREECACHE_UNUSED3       3
359 #define HAMMER2_FREECACHE_TYPES         4
360
361 /*
362  * hammer2_freemap_alloc() block preference
363  */
364 #define HAMMER2_OFF_NOPREF              ((hammer2_off_t)-1)
365
366 /*
367  * BMAP read-ahead maximum parameters
368  */
369 #define HAMMER2_BMAP_COUNT              16      /* max bmap read-ahead */
370 #define HAMMER2_BMAP_BYTES              (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT)
371
372 /*
373  * hammer2_freemap_adjust()
374  */
375 #define HAMMER2_FREEMAP_DORECOVER       1
376 #define HAMMER2_FREEMAP_DOMAYFREE       2
377 #define HAMMER2_FREEMAP_DOREALFREE      3
378
379 /*
380  * HAMMER2 cluster - A set of chains representing the same entity.
381  *
382  * The hammer2_pfsmount structure embeds a hammer2_cluster.  All other
383  * hammer2_cluster use cases use temporary allocations.
384  *
385  * The cluster API mimics the chain API.  Except as used in the pfsmount,
386  * the cluster structure is a temporary 'working copy' of a set of chains
387  * representing targets compatible with the operation.  However, for
388  * performance reasons the cluster API does not necessarily issue concurrent
389  * requests to the underlying chain API for all compatible chains all the
390  * time.  This may sometimes necessitate revisiting parent cluster nodes
391  * to 'flesh out' (validate more chains).
392  *
393  * If an insufficient number of chains remain in a working copy, the operation
394  * may have to be downgraded, retried, or stall until the requisit number
395  * of chains are available.
396  */
397 #define HAMMER2_MAXCLUSTER      8
398
399 struct hammer2_cluster {
400         int                     status;         /* operational status */
401         int                     refs;           /* track for deallocation */
402         struct hammer2_pfsmount *pmp;
403         uint32_t                flags;
404         int                     nchains;
405         hammer2_chain_t         *focus;         /* current focus (or mod) */
406         hammer2_chain_t         *array[HAMMER2_MAXCLUSTER];
407         char                    missed[HAMMER2_MAXCLUSTER];
408         int                     cache_index[HAMMER2_MAXCLUSTER];
409 };
410
411 typedef struct hammer2_cluster hammer2_cluster_t;
412
413 #define HAMMER2_CLUSTER_INODE   0x00000001      /* embedded in inode */
414 #define HAMMER2_CLUSTER_NOSYNC  0x00000002      /* not in sync (cumulative) */
415
416
417 RB_HEAD(hammer2_inode_tree, hammer2_inode);
418
419 /*
420  * A hammer2 inode.
421  *
422  * NOTE: The inode's attribute CST which is also used to lock the inode
423  *       is embedded in the chain (chain.cst) and aliased w/ attr_cst.
424  */
425 struct hammer2_inode {
426         RB_ENTRY(hammer2_inode) rbnode;         /* inumber lookup (HL) */
427         ccms_cst_t              topo_cst;       /* directory topology cst */
428         struct hammer2_pfsmount *pmp;           /* PFS mount */
429         struct hammer2_inode    *pip;           /* parent inode */
430         struct vnode            *vp;
431         hammer2_cluster_t       cluster;
432         struct lockf            advlock;
433         hammer2_tid_t           inum;
434         u_int                   flags;
435         u_int                   refs;           /* +vpref, +flushref */
436         uint8_t                 comp_heuristic;
437         hammer2_off_t           size;
438         uint64_t                mtime;
439 };
440
441 typedef struct hammer2_inode hammer2_inode_t;
442
443 #define HAMMER2_INODE_MODIFIED          0x0001
444 #define HAMMER2_INODE_SROOT             0x0002  /* kmalloc special case */
445 #define HAMMER2_INODE_RENAME_INPROG     0x0004
446 #define HAMMER2_INODE_ONRBTREE          0x0008
447 #define HAMMER2_INODE_RESIZED           0x0010
448 #define HAMMER2_INODE_MTIME             0x0020
449 #define HAMMER2_INODE_UNLINKED          0x0040
450
451 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2);
452 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp,
453                 hammer2_tid_t);
454
455 /*
456  * inode-unlink side-structure
457  */
458 struct hammer2_inode_unlink {
459         TAILQ_ENTRY(hammer2_inode_unlink) entry;
460         hammer2_inode_t *ip;
461 };
462 TAILQ_HEAD(h2_unlk_list, hammer2_inode_unlink);
463
464 typedef struct hammer2_inode_unlink hammer2_inode_unlink_t;
465
466 /*
467  * A hammer2 transaction and flush sequencing structure.
468  *
469  * This global structure is tied into hammer2_mount and is used
470  * to sequence modifying operations and flushes.
471  *
472  * (a) Any modifying operations with sync_tid >= flush_tid will stall until
473  *     all modifying operating with sync_tid < flush_tid complete.
474  *
475  *     The flush related to flush_tid stalls until all modifying operations
476  *     with sync_tid < flush_tid complete.
477  *
478  * (b) Once unstalled, modifying operations with sync_tid > flush_tid are
479  *     allowed to run.  All modifications cause modify/duplicate operations
480  *     to occur on the related chains.  Note that most INDIRECT blocks will
481  *     be unaffected because the modifications just overload the RBTREE
482  *     structurally instead of actually modifying the indirect blocks.
483  *
484  * (c) The actual flush unstalls and RUNS CONCURRENTLY with (b), but only
485  *     utilizes the chain structures with sync_tid <= flush_tid.  The
486  *     flush will modify related indirect blocks and inodes in-place
487  *     (rather than duplicate) since the adjustments are compatible with
488  *     (b)'s RBTREE overloading
489  *
490  *     SPECIAL NOTE:  Inode modifications have to also propagate along any
491  *                    modify/duplicate chains.  File writes detect the flush
492  *                    and force out the conflicting buffer cache buffer(s)
493  *                    before reusing them.
494  *
495  * (d) Snapshots can be made instantly but must be flushed and disconnected
496  *     from their duplicative source before they can be mounted.  This is
497  *     because while H2's on-media structure supports forks, its in-memory
498  *     structure only supports very simple forking for background flushing
499  *     purposes.
500  *
501  * TODO: Flush merging.  When fsync() is called on multiple discrete files
502  *       concurrently there is no reason to stall the second fsync.
503  *       The final flush that reaches to root can cover both fsync()s.
504  *
505  *     The chains typically terminate as they fly onto the disk.  The flush
506  *     ultimately reaches the volume header.
507  */
508 struct hammer2_trans {
509         TAILQ_ENTRY(hammer2_trans) entry;
510         struct hammer2_pfsmount *pmp;
511         hammer2_xid_t           sync_xid;
512         hammer2_tid_t           inode_tid;      /* inode number assignment */
513         thread_t                td;             /* pointer */
514         int                     flags;
515         int                     blocked;
516         uint8_t                 inodes_created;
517         uint8_t                 dummy[7];
518 };
519
520 typedef struct hammer2_trans hammer2_trans_t;
521
522 #define HAMMER2_TRANS_ISFLUSH           0x0001  /* formal flush */
523 #define HAMMER2_TRANS_CONCURRENT        0x0002  /* concurrent w/flush */
524 #define HAMMER2_TRANS_BUFCACHE          0x0004  /* from bioq strategy write */
525 #define HAMMER2_TRANS_NEWINODE          0x0008  /* caller allocating inode */
526 #define HAMMER2_TRANS_FREEBATCH         0x0010  /* batch freeing code */
527 #define HAMMER2_TRANS_PREFLUSH          0x0020  /* preflush state */
528
529 #define HAMMER2_FREEMAP_HEUR_NRADIX     4       /* pwr 2 PBUFRADIX-MINIORADIX */
530 #define HAMMER2_FREEMAP_HEUR_TYPES      8
531 #define HAMMER2_FREEMAP_HEUR            (HAMMER2_FREEMAP_HEUR_NRADIX * \
532                                          HAMMER2_FREEMAP_HEUR_TYPES)
533
534 #define HAMMER2_CLUSTER_COPY_NOCHAINS   0x0001  /* do not copy or ref chains */
535 #define HAMMER2_CLUSTER_COPY_NOREF      0x0002  /* do not ref chains or cl */
536
537 /*
538  * Transaction Rendezvous
539  */
540 TAILQ_HEAD(hammer2_trans_queue, hammer2_trans);
541
542 struct hammer2_trans_manage {
543         hammer2_xid_t           flush_xid;      /* last flush transaction */
544         hammer2_xid_t           alloc_xid;
545         struct lock             translk;        /* lockmgr lock */
546         struct hammer2_trans_queue transq;      /* modifying transactions */
547         int                     flushcnt;       /* track flush trans */
548 };
549
550 typedef struct hammer2_trans_manage hammer2_trans_manage_t;
551
552 /*
553  * Global (per device) mount structure for device (aka vp->v_mount->hmp)
554  */
555 struct hammer2_mount {
556         struct vnode    *devvp;         /* device vnode */
557         int             ronly;          /* read-only mount */
558         int             pmp_count;      /* PFS mounts backed by us */
559         TAILQ_ENTRY(hammer2_mount) mntentry; /* hammer2_mntlist */
560
561         struct malloc_type *mchain;
562         int             nipstacks;
563         int             maxipstacks;
564         kdmsg_iocom_t   iocom;          /* volume-level dmsg interface */
565         struct spinlock io_spin;        /* iotree access */
566         struct hammer2_io_tree iotree;
567         int             iofree_count;
568         hammer2_chain_t vchain;         /* anchor chain (topology) */
569         hammer2_chain_t fchain;         /* anchor chain (freemap) */
570         struct spinlock list_spin;
571         struct h2_flush_list    flushq; /* flush seeds */
572         struct hammer2_pfsmount *spmp;  /* super-root pmp for transactions */
573         struct lock     vollk;          /* lockmgr lock */
574         hammer2_off_t   heur_freemap[HAMMER2_FREEMAP_HEUR];
575         int             volhdrno;       /* last volhdrno written */
576         hammer2_volume_data_t voldata;
577         hammer2_volume_data_t volsync;  /* synchronized voldata */
578 };
579
580 typedef struct hammer2_mount hammer2_mount_t;
581
582 /*
583  * HAMMER2 PFS mount point structure (aka vp->v_mount->mnt_data).
584  * This has a 1:1 correspondence to struct mount (note that the
585  * hammer2_mount structure has a N:1 correspondence).
586  *
587  * This structure represents a cluster mount and not necessarily a
588  * PFS under a specific device mount (HMP).  The distinction is important
589  * because the elements backing a cluster mount can change on the fly.
590  *
591  * Usually the first element under the cluster represents the original
592  * user-requested mount that bootstraps the whole mess.  In significant
593  * setups the original is usually just a read-only media image (or
594  * representitive file) that simply contains a bootstrap volume header
595  * listing the configuration.
596  */
597 struct hammer2_pfsmount {
598         struct mount            *mp;
599         TAILQ_ENTRY(hammer2_pfsmount) mntentry; /* hammer2_pfslist */
600         uuid_t                  pfs_clid;
601         uuid_t                  pfs_fsid;
602         hammer2_mount_t         *spmp_hmp;      /* (spmp only) */
603         hammer2_inode_t         *iroot;         /* PFS root inode */
604         hammer2_inode_t         *ihidden;       /* PFS hidden directory */
605         struct lock             lock;           /* PFS lock for certain ops */
606         hammer2_off_t           inode_count;    /* copy of inode_count */
607         ccms_domain_t           ccms_dom;
608         struct netexport        export;         /* nfs export */
609         int                     ronly;          /* read-only mount */
610         struct malloc_type      *minode;
611         struct malloc_type      *mmsg;
612         struct spinlock         inum_spin;      /* inumber lookup */
613         struct hammer2_inode_tree inum_tree;    /* (not applicable to spmp) */
614         hammer2_tid_t           alloc_tid;
615         hammer2_tid_t           flush_tid;
616         hammer2_tid_t           inode_tid;
617         long                    inmem_inodes;
618         uint32_t                inmem_dirty_chains;
619         int                     count_lwinprog; /* logical write in prog */
620         struct spinlock         list_spin;
621         struct h2_unlk_list     unlinkq;        /* last-close unlink */
622         thread_t                wthread_td;     /* write thread td */
623         struct bio_queue_head   wthread_bioq;   /* logical buffer bioq */
624         struct mtx              wthread_mtx;    /* interlock */
625         int                     wthread_destroy;/* termination sequencing */
626 };
627
628 typedef struct hammer2_pfsmount hammer2_pfsmount_t;
629
630 #define HAMMER2_DIRTYCHAIN_WAITING      0x80000000
631 #define HAMMER2_DIRTYCHAIN_MASK         0x7FFFFFFF
632
633 #define HAMMER2_LWINPROG_WAITING        0x80000000
634 #define HAMMER2_LWINPROG_MASK           0x7FFFFFFF
635
636 #if defined(_KERNEL)
637
638 MALLOC_DECLARE(M_HAMMER2);
639
640 #define VTOI(vp)        ((hammer2_inode_t *)(vp)->v_data)
641 #define ITOV(ip)        ((ip)->vp)
642
643 /*
644  * Currently locked chains retain the locked buffer cache buffer for
645  * indirect blocks, and indirect blocks can be one of two sizes.  The
646  * device buffer has to match the case to avoid deadlocking recursive
647  * chains that might otherwise try to access different offsets within
648  * the same device buffer.
649  */
650 static __inline
651 int
652 hammer2_devblkradix(int radix)
653 {
654         if (radix <= HAMMER2_LBUFRADIX) {
655                 return (HAMMER2_LBUFRADIX);
656         } else {
657                 return (HAMMER2_PBUFRADIX);
658         }
659 }
660
661 static __inline
662 size_t
663 hammer2_devblksize(size_t bytes)
664 {
665         if (bytes <= HAMMER2_LBUFSIZE) {
666                 return(HAMMER2_LBUFSIZE);
667         } else {
668                 KKASSERT(bytes <= HAMMER2_PBUFSIZE &&
669                          (bytes ^ (bytes - 1)) == ((bytes << 1) - 1));
670                 return (HAMMER2_PBUFSIZE);
671         }
672 }
673
674
675 static __inline
676 hammer2_pfsmount_t *
677 MPTOPMP(struct mount *mp)
678 {
679         return ((hammer2_pfsmount_t *)mp->mnt_data);
680 }
681
682 #define LOCKSTART       int __nlocks = curthread->td_locks
683 #define LOCKENTER       (++curthread->td_locks)
684 #define LOCKEXIT        (--curthread->td_locks)
685 #define LOCKSTOP        KKASSERT(curthread->td_locks == __nlocks)
686
687 extern struct vop_ops hammer2_vnode_vops;
688 extern struct vop_ops hammer2_spec_vops;
689 extern struct vop_ops hammer2_fifo_vops;
690
691 extern int hammer2_debug;
692 extern int hammer2_cluster_enable;
693 extern int hammer2_hardlink_enable;
694 extern int hammer2_flush_pipe;
695 extern int hammer2_synchronous_flush;
696 extern int hammer2_dio_count;
697 extern long hammer2_limit_dirty_chains;
698 extern long hammer2_iod_file_read;
699 extern long hammer2_iod_meta_read;
700 extern long hammer2_iod_indr_read;
701 extern long hammer2_iod_fmap_read;
702 extern long hammer2_iod_volu_read;
703 extern long hammer2_iod_file_write;
704 extern long hammer2_iod_meta_write;
705 extern long hammer2_iod_indr_write;
706 extern long hammer2_iod_fmap_write;
707 extern long hammer2_iod_volu_write;
708 extern long hammer2_ioa_file_read;
709 extern long hammer2_ioa_meta_read;
710 extern long hammer2_ioa_indr_read;
711 extern long hammer2_ioa_fmap_read;
712 extern long hammer2_ioa_volu_read;
713 extern long hammer2_ioa_file_write;
714 extern long hammer2_ioa_meta_write;
715 extern long hammer2_ioa_indr_write;
716 extern long hammer2_ioa_fmap_write;
717 extern long hammer2_ioa_volu_write;
718
719 extern struct objcache *cache_buffer_read;
720 extern struct objcache *cache_buffer_write;
721
722 extern int destroy;
723 extern int write_thread_wakeup;
724
725 extern mtx_t thread_protect;
726
727 /*
728  * hammer2_subr.c
729  */
730 #define hammer2_icrc32(buf, size)       iscsi_crc32((buf), (size))
731 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc))
732
733 hammer2_cluster_t *hammer2_inode_lock_ex(hammer2_inode_t *ip);
734 hammer2_cluster_t *hammer2_inode_lock_sh(hammer2_inode_t *ip);
735 void hammer2_inode_unlock_ex(hammer2_inode_t *ip, hammer2_cluster_t *chain);
736 void hammer2_inode_unlock_sh(hammer2_inode_t *ip, hammer2_cluster_t *chain);
737 ccms_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip);
738 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip, ccms_state_t ostate);
739 ccms_state_t hammer2_inode_lock_upgrade(hammer2_inode_t *ip);
740 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, ccms_state_t ostate);
741
742 void hammer2_mount_exlock(hammer2_mount_t *hmp);
743 void hammer2_mount_shlock(hammer2_mount_t *hmp);
744 void hammer2_mount_unlock(hammer2_mount_t *hmp);
745
746 int hammer2_get_dtype(const hammer2_inode_data_t *ipdata);
747 int hammer2_get_vtype(const hammer2_inode_data_t *ipdata);
748 u_int8_t hammer2_get_obj_type(enum vtype vtype);
749 void hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts);
750 u_int64_t hammer2_timespec_to_time(const struct timespec *ts);
751 u_int32_t hammer2_to_unix_xid(const uuid_t *uuid);
752 void hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
753 hammer2_xid_t hammer2_trans_newxid(hammer2_pfsmount_t *pmp);
754 void hammer2_trans_manage_init(void);
755
756 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len);
757 int hammer2_getradix(size_t bytes);
758
759 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
760                         hammer2_key_t *lbasep, hammer2_key_t *leofp);
761 int hammer2_calc_physical(hammer2_inode_t *ip,
762                         const hammer2_inode_data_t *ipdata,
763                         hammer2_key_t lbase);
764 void hammer2_update_time(uint64_t *timep);
765 void hammer2_adjreadcounter(hammer2_blockref_t *bref, size_t bytes);
766
767 /*
768  * hammer2_inode.c
769  */
770 struct vnode *hammer2_igetv(hammer2_inode_t *ip, hammer2_cluster_t *cparent,
771                         int *errorp);
772 void hammer2_inode_lock_nlinks(hammer2_inode_t *ip);
773 void hammer2_inode_unlock_nlinks(hammer2_inode_t *ip);
774 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfsmount_t *pmp,
775                         hammer2_tid_t inum);
776 hammer2_inode_t *hammer2_inode_get(hammer2_pfsmount_t *pmp,
777                         hammer2_inode_t *dip, hammer2_cluster_t *cluster);
778 void hammer2_inode_free(hammer2_inode_t *ip);
779 void hammer2_inode_ref(hammer2_inode_t *ip);
780 void hammer2_inode_drop(hammer2_inode_t *ip);
781 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip,
782                         hammer2_cluster_t *cluster);
783 void hammer2_run_unlinkq(hammer2_trans_t *trans, hammer2_pfsmount_t *pmp);
784
785 hammer2_inode_t *hammer2_inode_create(hammer2_trans_t *trans,
786                         hammer2_inode_t *dip,
787                         struct vattr *vap, struct ucred *cred,
788                         const uint8_t *name, size_t name_len,
789                         hammer2_cluster_t **clusterp, int *errorp);
790 int hammer2_inode_connect(hammer2_trans_t *trans,
791                         hammer2_cluster_t **clusterp, int hlink,
792                         hammer2_inode_t *dip, hammer2_cluster_t *dcluster,
793                         const uint8_t *name, size_t name_len,
794                         hammer2_key_t key);
795 hammer2_inode_t *hammer2_inode_common_parent(hammer2_inode_t *fdip,
796                         hammer2_inode_t *tdip);
797 void hammer2_inode_fsync(hammer2_trans_t *trans, hammer2_inode_t *ip,
798                         hammer2_cluster_t *cparent);
799 int hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
800                         const uint8_t *name, size_t name_len, int isdir,
801                         int *hlinkp, struct nchandle *nch, int nlinks);
802 int hammer2_hardlink_consolidate(hammer2_trans_t *trans,
803                         hammer2_inode_t *ip, hammer2_cluster_t **clusterp,
804                         hammer2_inode_t *cdip, hammer2_cluster_t *cdcluster,
805                         int nlinks);
806 int hammer2_hardlink_deconsolidate(hammer2_trans_t *trans, hammer2_inode_t *dip,
807                         hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
808 int hammer2_hardlink_find(hammer2_inode_t *dip, hammer2_cluster_t **cparentp,
809                         hammer2_cluster_t *cluster);
810 int hammer2_parent_find(hammer2_cluster_t **cparentp,
811                         hammer2_cluster_t *cluster);
812 void hammer2_inode_install_hidden(hammer2_pfsmount_t *pmp);
813
814 /*
815  * hammer2_chain.c
816  */
817 void hammer2_voldata_lock(hammer2_mount_t *hmp);
818 void hammer2_voldata_unlock(hammer2_mount_t *hmp);
819 void hammer2_voldata_modify(hammer2_mount_t *hmp);
820 hammer2_chain_t *hammer2_chain_alloc(hammer2_mount_t *hmp,
821                                 hammer2_pfsmount_t *pmp,
822                                 hammer2_trans_t *trans,
823                                 hammer2_blockref_t *bref);
824 void hammer2_chain_core_alloc(hammer2_trans_t *trans, hammer2_chain_t *chain);
825 void hammer2_chain_ref(hammer2_chain_t *chain);
826 void hammer2_chain_drop(hammer2_chain_t *chain);
827 int hammer2_chain_lock(hammer2_chain_t *chain, int how);
828 void hammer2_chain_load_async(hammer2_cluster_t *cluster,
829                                 void (*func)(hammer2_io_t *dio,
830                                              hammer2_cluster_t *cluster,
831                                              hammer2_chain_t *chain,
832                                              void *arg_p, off_t arg_o),
833                                 void *arg_p);
834 void hammer2_chain_moved(hammer2_chain_t *chain);
835 void hammer2_chain_modify(hammer2_trans_t *trans,
836                                 hammer2_chain_t *chain, int flags);
837 void hammer2_chain_resize(hammer2_trans_t *trans, hammer2_inode_t *ip,
838                                 hammer2_chain_t *parent,
839                                 hammer2_chain_t *chain,
840                                 int nradix, int flags);
841 void hammer2_chain_unlock(hammer2_chain_t *chain);
842 void hammer2_chain_wait(hammer2_chain_t *chain);
843 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent, int generation,
844                                 hammer2_blockref_t *bref);
845 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags);
846 void hammer2_chain_lookup_done(hammer2_chain_t *parent);
847 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp,
848                                 hammer2_key_t *key_nextp,
849                                 hammer2_key_t key_beg, hammer2_key_t key_end,
850                                 int *cache_indexp, int flags, int *ddflagp);
851 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp,
852                                 hammer2_chain_t *chain,
853                                 hammer2_key_t *key_nextp,
854                                 hammer2_key_t key_beg, hammer2_key_t key_end,
855                                 int *cache_indexp, int flags);
856 hammer2_chain_t *hammer2_chain_scan(hammer2_chain_t *parent,
857                                 hammer2_chain_t *chain,
858                                 int *cache_indexp, int flags);
859
860 int hammer2_chain_create(hammer2_trans_t *trans, hammer2_chain_t **parentp,
861                                 hammer2_chain_t **chainp,
862                                 hammer2_pfsmount_t *pmp,
863                                 hammer2_key_t key, int keybits,
864                                 int type, size_t bytes, int flags);
865 void hammer2_chain_rename(hammer2_trans_t *trans, hammer2_blockref_t *bref,
866                                 hammer2_chain_t **parentp,
867                                 hammer2_chain_t *chain, int flags);
868 int hammer2_chain_snapshot(hammer2_trans_t *trans, hammer2_chain_t **chainp,
869                                 hammer2_ioc_pfs_t *pfs);
870 void hammer2_chain_delete(hammer2_trans_t *trans, hammer2_chain_t *parent,
871                                 hammer2_chain_t *chain, int flags);
872 void hammer2_chain_delete_duplicate(hammer2_trans_t *trans,
873                                 hammer2_chain_t **chainp, int flags);
874 void hammer2_flush(hammer2_trans_t *trans, hammer2_chain_t *chain);
875 void hammer2_chain_commit(hammer2_trans_t *trans, hammer2_chain_t *chain);
876 void hammer2_chain_setflush(hammer2_trans_t *trans, hammer2_chain_t *chain);
877 void hammer2_chain_countbrefs(hammer2_chain_t *chain,
878                                 hammer2_blockref_t *base, int count);
879
880 void hammer2_chain_setcheck(hammer2_chain_t *chain, void *bdata);
881 int hammer2_chain_testcheck(hammer2_chain_t *chain, void *bdata);
882
883
884 void hammer2_pfs_memory_wait(hammer2_pfsmount_t *pmp);
885 void hammer2_pfs_memory_inc(hammer2_pfsmount_t *pmp);
886 void hammer2_pfs_memory_wakeup(hammer2_pfsmount_t *pmp);
887
888 void hammer2_base_delete(hammer2_trans_t *trans, hammer2_chain_t *chain,
889                                 hammer2_blockref_t *base, int count,
890                                 int *cache_indexp, hammer2_chain_t *child);
891 void hammer2_base_insert(hammer2_trans_t *trans, hammer2_chain_t *chain,
892                                 hammer2_blockref_t *base, int count,
893                                 int *cache_indexp, hammer2_chain_t *child);
894
895 /*
896  * hammer2_trans.c
897  */
898 void hammer2_trans_init(hammer2_trans_t *trans, hammer2_pfsmount_t *pmp,
899                                 int flags);
900 void hammer2_trans_spmp(hammer2_trans_t *trans, hammer2_pfsmount_t *pmp);
901 void hammer2_trans_done(hammer2_trans_t *trans);
902
903 /*
904  * hammer2_ioctl.c
905  */
906 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data,
907                                 int fflag, struct ucred *cred);
908
909 /*
910  * hammer2_io.c
911  */
912 hammer2_io_t *hammer2_io_getblk(hammer2_mount_t *hmp, off_t lbase,
913                                 int lsize, int *ownerp);
914 void hammer2_io_putblk(hammer2_io_t **diop);
915 void hammer2_io_cleanup(hammer2_mount_t *hmp, struct hammer2_io_tree *tree);
916 char *hammer2_io_data(hammer2_io_t *dio, off_t lbase);
917 int hammer2_io_new(hammer2_mount_t *hmp, off_t lbase, int lsize,
918                                 hammer2_io_t **diop);
919 int hammer2_io_newnz(hammer2_mount_t *hmp, off_t lbase, int lsize,
920                                 hammer2_io_t **diop);
921 int hammer2_io_newq(hammer2_mount_t *hmp, off_t lbase, int lsize,
922                                 hammer2_io_t **diop);
923 int hammer2_io_bread(hammer2_mount_t *hmp, off_t lbase, int lsize,
924                                 hammer2_io_t **diop);
925 void hammer2_io_breadcb(hammer2_mount_t *hmp, off_t lbase, int lsize,
926                                 void (*callback)(hammer2_io_t *dio,
927                                                  hammer2_cluster_t *arg_l,
928                                                  hammer2_chain_t *arg_c,
929                                                  void *arg_p, off_t arg_o),
930                                 hammer2_cluster_t *arg_l,
931                                 hammer2_chain_t *arg_c,
932                                 void *arg_p, off_t arg_o);
933 void hammer2_io_bawrite(hammer2_io_t **diop);
934 void hammer2_io_bdwrite(hammer2_io_t **diop);
935 int hammer2_io_bwrite(hammer2_io_t **diop);
936 int hammer2_io_isdirty(hammer2_io_t *dio);
937 void hammer2_io_setdirty(hammer2_io_t *dio);
938 void hammer2_io_setinval(hammer2_io_t *dio, u_int bytes);
939 void hammer2_io_brelse(hammer2_io_t **diop);
940 void hammer2_io_bqrelse(hammer2_io_t **diop);
941
942 /*
943  * hammer2_msgops.c
944  */
945 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg);
946 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg);
947
948 /*
949  * hammer2_vfsops.c
950  */
951 void hammer2_clusterctl_wakeup(kdmsg_iocom_t *iocom);
952 void hammer2_volconf_update(hammer2_mount_t *hmp, int index);
953 void hammer2_cluster_reconnect(hammer2_mount_t *hmp, struct file *fp);
954 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp, char pfx);
955 void hammer2_bioq_sync(hammer2_pfsmount_t *pmp);
956 int hammer2_vfs_sync(struct mount *mp, int waitflags);
957 void hammer2_lwinprog_ref(hammer2_pfsmount_t *pmp);
958 void hammer2_lwinprog_drop(hammer2_pfsmount_t *pmp);
959 void hammer2_lwinprog_wait(hammer2_pfsmount_t *pmp);
960
961 /*
962  * hammer2_freemap.c
963  */
964 int hammer2_freemap_alloc(hammer2_trans_t *trans, hammer2_chain_t *chain,
965                                 size_t bytes);
966 void hammer2_freemap_adjust(hammer2_trans_t *trans, hammer2_mount_t *hmp,
967                                 hammer2_blockref_t *bref, int how);
968
969 /*
970  * hammer2_cluster.c
971  */
972 int hammer2_cluster_need_resize(hammer2_cluster_t *cluster, int bytes);
973 uint8_t hammer2_cluster_type(hammer2_cluster_t *cluster);
974 const hammer2_media_data_t *hammer2_cluster_data(hammer2_cluster_t *cluster);
975 hammer2_media_data_t *hammer2_cluster_wdata(hammer2_cluster_t *cluster);
976 hammer2_cluster_t *hammer2_cluster_from_chain(hammer2_chain_t *chain);
977 int hammer2_cluster_modified(hammer2_cluster_t *cluster);
978 int hammer2_cluster_duplicated(hammer2_cluster_t *cluster);
979 void hammer2_cluster_set_chainflags(hammer2_cluster_t *cluster, uint32_t flags);
980 void hammer2_cluster_bref(hammer2_cluster_t *cluster, hammer2_blockref_t *bref);
981 void hammer2_cluster_setflush(hammer2_trans_t *trans,
982                         hammer2_cluster_t *cluster);
983 void hammer2_cluster_setmethod_check(hammer2_trans_t *trans,
984                         hammer2_cluster_t *cluster, int check_algo);
985 hammer2_cluster_t *hammer2_cluster_alloc(hammer2_pfsmount_t *pmp,
986                         hammer2_trans_t *trans,
987                         hammer2_blockref_t *bref);
988 void hammer2_cluster_ref(hammer2_cluster_t *cluster);
989 void hammer2_cluster_drop(hammer2_cluster_t *cluster);
990 void hammer2_cluster_wait(hammer2_cluster_t *cluster);
991 int hammer2_cluster_lock(hammer2_cluster_t *cluster, int how);
992 void hammer2_cluster_replace(hammer2_cluster_t *dst, hammer2_cluster_t *src);
993 void hammer2_cluster_replace_locked(hammer2_cluster_t *dst,
994                         hammer2_cluster_t *src);
995 hammer2_cluster_t *hammer2_cluster_copy(hammer2_cluster_t *ocluster,
996                         int with_chains);
997 void hammer2_cluster_unlock(hammer2_cluster_t *cluster);
998 void hammer2_cluster_resize(hammer2_trans_t *trans, hammer2_inode_t *ip,
999                         hammer2_cluster_t *cparent, hammer2_cluster_t *cluster,
1000                         int nradix, int flags);
1001 hammer2_inode_data_t *hammer2_cluster_modify_ip(hammer2_trans_t *trans,
1002                         hammer2_inode_t *ip, hammer2_cluster_t *cluster,
1003                         int flags);
1004 void hammer2_cluster_modify(hammer2_trans_t *trans, hammer2_cluster_t *cluster,
1005                         int flags);
1006 void hammer2_cluster_modsync(hammer2_cluster_t *cluster);
1007 hammer2_cluster_t *hammer2_cluster_lookup_init(hammer2_cluster_t *cparent,
1008                         int flags);
1009 void hammer2_cluster_lookup_done(hammer2_cluster_t *cparent);
1010 hammer2_cluster_t *hammer2_cluster_lookup(hammer2_cluster_t *cparent,
1011                         hammer2_key_t *key_nextp,
1012                         hammer2_key_t key_beg, hammer2_key_t key_end,
1013                         int flags, int *ddflagp);
1014 hammer2_cluster_t *hammer2_cluster_next(hammer2_cluster_t *cparent,
1015                         hammer2_cluster_t *cluster,
1016                         hammer2_key_t *key_nextp,
1017                         hammer2_key_t key_beg, hammer2_key_t key_end,
1018                         int flags);
1019 hammer2_cluster_t *hammer2_cluster_scan(hammer2_cluster_t *cparent,
1020                         hammer2_cluster_t *cluster, int flags);
1021 int hammer2_cluster_create(hammer2_trans_t *trans, hammer2_cluster_t *cparent,
1022                         hammer2_cluster_t **clusterp,
1023                         hammer2_key_t key, int keybits,
1024                         int type, size_t bytes, int flags);
1025 void hammer2_cluster_rename(hammer2_trans_t *trans, hammer2_blockref_t *bref,
1026                         hammer2_cluster_t *cparent, hammer2_cluster_t *cluster,
1027                         int flags);
1028 void hammer2_cluster_delete(hammer2_trans_t *trans, hammer2_cluster_t *pcluster,
1029                         hammer2_cluster_t *cluster, int flags);
1030 int hammer2_cluster_snapshot(hammer2_trans_t *trans,
1031                         hammer2_cluster_t *ocluster, hammer2_ioc_pfs_t *pfs);
1032 hammer2_cluster_t *hammer2_cluster_parent(hammer2_cluster_t *cluster);
1033
1034
1035 #endif /* !_KERNEL */
1036 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */