sys/vfs/hammer2/hammer2.h

   1 /*
   2  * Copyright (c) 2011-2013 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  * This header file contains structures used internally by the HAMMER2
  38  * implementation.  See hammer2_disk.h for on-disk structures.
  39  */
  40
  41 #ifndef _VFS_HAMMER2_HAMMER2_H_
  42 #define _VFS_HAMMER2_HAMMER2_H_
  43
  44 #include <sys/param.h>
  45 #include <sys/types.h>
  46 #include <sys/kernel.h>
  47 #include <sys/conf.h>
  48 #include <sys/systm.h>
  49 #include <sys/tree.h>
  50 #include <sys/malloc.h>
  51 #include <sys/mount.h>
  52 #include <sys/vnode.h>
  53 #include <sys/proc.h>
  54 #include <sys/mountctl.h>
  55 #include <sys/priv.h>
  56 #include <sys/stat.h>
  57 #include <sys/thread.h>
  58 #include <sys/globaldata.h>
  59 #include <sys/lockf.h>
  60 #include <sys/buf.h>
  61 #include <sys/queue.h>
  62 #include <sys/limits.h>
  63 #include <sys/buf2.h>
  64 #include <sys/signal2.h>
  65 #include <sys/tree.h>
  66 #include <sys/dmsg.h>
  67
  68 #include "hammer2_disk.h"
  69 #include "hammer2_mount.h"
  70 #include "hammer2_ioctl.h"
  71 #include "hammer2_ccms.h"
  72
  73 struct hammer2_chain;
  74 struct hammer2_inode;
  75 struct hammer2_mount;
  76 struct hammer2_pfsmount;
  77 struct hammer2_span;
  78 struct hammer2_state;
  79 struct hammer2_msg;
  80
  81 /*
  82  * The chain structure tracks blockref recursions all the way to the root
  83  * volume.  These consist of indirect blocks, inodes, and eventually the
  84  * volume header itself.
  85  *
  86  * In situations where a duplicate is needed to represent different snapshots
  87  * or flush points a new chain will be allocated but associated with the
  88  * same shared chain_core.  The RBTREE is contained in the shared chain_core
  89  * and entries in the RBTREE are versioned.
  90  *
  91  * Duplication can occur whenever a chain must be modified.  Note that
  92  * a deletion is not considered a modification.
  93  *
  94  *      (a) General modifications at data leafs
  95  *      (b) When a chain is resized
  96  *      (c) When a chain's blockref array is updated
  97  *      (d) When a chain is renamed
  98  *      (e) When a chain is moved (when an indirect block is split)
  99  *
 100  * Advantages:
 101  *
 102  *      (1) Fully coherent snapshots can be taken without requiring
 103  *          a pre-flush, resulting in extremely fast (sub-millisecond)
 104  *          snapshots.
 105  *
 106  *      (2) Multiple synchronization points can be in-flight at the same
 107  *          time, representing multiple snapshots or flushes.
 108  *
 109  *      (3) The algorithms needed to keep track of everything are actually
 110  *          not that complex.
 111  *
 112  * Special Considerations:
 113  *
 114  *      A chain is ref-counted on a per-chain basis, but the chain's lock
 115  *      is associated with the shared chain_core and is not per-chain.
 116  *
 117  *      Each chain is representative of a filesystem topology.  Even
 118  *      though the shared chain_core's are effectively multi-homed, the
 119  *      chain structure is not.
 120  *
 121  *      chain->parent is a stable pointer and can be iterated without locking
 122  *      as long as either the chain or *any* deep child under the chain
 123  *      is held.
 124  */
 125 RB_HEAD(hammer2_chain_tree, hammer2_chain);
 126 TAILQ_HEAD(flush_deferral_list, hammer2_chain);
 127
 128 struct hammer2_chain_core {
 129         struct ccms_cst cst;
 130         u_int           sharecnt;
 131         struct hammer2_chain_tree rbtree;
 132 };
 133
 134 typedef struct hammer2_chain_core hammer2_chain_core_t;
 135
 136 struct hammer2_chain {
 137         RB_ENTRY(hammer2_chain) rbnode;
 138         hammer2_blockref_t      bref;
 139         hammer2_chain_core_t    *core;
 140         struct hammer2_chain    *parent;
 141         struct hammer2_state    *state;         /* if active cache msg */
 142         struct hammer2_mount    *hmp;
 143         struct hammer2_chain    *duplink;       /* duplication link */
 144
 145         hammer2_tid_t   modify_tid;             /* snapshot/flush filter */
 146         hammer2_tid_t   delete_tid;
 147         struct buf      *bp;                    /* physical data buffer */
 148         u_int           bytes;                  /* physical data size */
 149         int             index;                  /* blockref index in parent */
 150         u_int           flags;
 151         u_int           refs;
 152         hammer2_media_data_t *data;             /* data pointer shortcut */
 153         TAILQ_ENTRY(hammer2_chain) flush_node;  /* flush deferral list */
 154 };
 155
 156 typedef struct hammer2_chain hammer2_chain_t;
 157
 158 int hammer2_chain_cmp(hammer2_chain_t *chain1, hammer2_chain_t *chain2);
 159 RB_PROTOTYPE(hammer2_chain_tree, hammer2_chain, rbnode, hammer2_chain_cmp);
 160
 161 #define HAMMER2_CHAIN_MODIFIED          0x00000001      /* dirty chain data */
 162 #define HAMMER2_CHAIN_ALLOCATED         0x00000002      /* kmalloc'd chain */
 163 #define HAMMER2_CHAIN_DIRTYBP           0x00000004      /* dirty on unlock */
 164 #define HAMMER2_CHAIN_SUBMODIFIED       0x00000008      /* 1+ subs modified */
 165 #define HAMMER2_CHAIN_DELETED           0x00000010      /* deleted chain */
 166 #define HAMMER2_CHAIN_INITIAL           0x00000020      /* initial create */
 167 #define HAMMER2_CHAIN_FLUSHED           0x00000040      /* flush on unlock */
 168 #define HAMMER2_CHAIN_MOVED             0x00000080      /* bref changed */
 169 #define HAMMER2_CHAIN_IOFLUSH           0x00000100      /* bawrite on put */
 170 #define HAMMER2_CHAIN_DEFERRED          0x00000200      /* on a deferral list */
 171 #define HAMMER2_CHAIN_DESTROYED         0x00000400      /* destroying inode */
 172 #define HAMMER2_CHAIN_VOLUMESYNC        0x00000800      /* needs volume sync */
 173 #define HAMMER2_CHAIN_UNUSED1000        0x00001000
 174 #define HAMMER2_CHAIN_MOUNTED           0x00002000      /* PFS is mounted */
 175 #define HAMMER2_CHAIN_ONRBTREE          0x00004000      /* on parent RB tree */
 176
 177 /*
 178  * Flags passed to hammer2_chain_lookup() and hammer2_chain_next()
 179  */
 180 #define HAMMER2_LOOKUP_NOLOCK           0x00000001      /* ref only */
 181 #define HAMMER2_LOOKUP_NODATA           0x00000002      /* data left NULL */
 182 #define HAMMER2_LOOKUP_SHARED           0x00000100
 183
 184 /*
 185  * Flags passed to hammer2_chain_modify() and hammer2_chain_resize()
 186  *
 187  * NOTE: OPTDATA allows us to avoid instantiating buffers for INDIRECT
 188  *       blocks in the INITIAL-create state.
 189  */
 190 #define HAMMER2_MODIFY_NOSUB            0x00000001      /* do not set SUBMOD */
 191 #define HAMMER2_MODIFY_OPTDATA          0x00000002      /* data can be NULL */
 192 #define HAMMER2_MODIFY_NO_MODIFY_TID    0x00000004
 193
 194 /*
 195  * Flags passed to hammer2_chain_lock()
 196  */
 197 #define HAMMER2_RESOLVE_NEVER           1
 198 #define HAMMER2_RESOLVE_MAYBE           2
 199 #define HAMMER2_RESOLVE_ALWAYS          3
 200 #define HAMMER2_RESOLVE_MASK            0x0F
 201
 202 #define HAMMER2_RESOLVE_SHARED          0x10
 203 #define HAMMER2_RESOLVE_NOREF           0x20
 204
 205 /*
 206  * Cluster different types of storage together for allocations
 207  */
 208 #define HAMMER2_FREECACHE_INODE         0
 209 #define HAMMER2_FREECACHE_INDIR         1
 210 #define HAMMER2_FREECACHE_DATA          2
 211 #define HAMMER2_FREECACHE_UNUSED3       3
 212 #define HAMMER2_FREECACHE_TYPES         4
 213
 214 /*
 215  * BMAP read-ahead maximum parameters
 216  */
 217 #define HAMMER2_BMAP_COUNT              16      /* max bmap read-ahead */
 218 #define HAMMER2_BMAP_BYTES              (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT)
 219
 220 /*
 221  * Misc
 222  */
 223 #define HAMMER2_FLUSH_DEPTH_LIMIT       40      /* stack recursion limit */
 224
 225 /*
 226  * HAMMER2 IN-MEMORY CACHE OF MEDIA STRUCTURES
 227  *
 228  * There is an in-memory representation of all on-media data structure.
 229  *
 230  * When accessed read-only the data will be mapped to the related buffer
 231  * cache buffer.
 232  *
 233  * When accessed read-write (marked modified) a kmalloc()'d copy of the
 234  * is created which can then be modified.  The copy is destroyed when a
 235  * filesystem block is allocated to replace it.
 236  *
 237  * Active inodes (those with vnodes attached) will maintain the kmalloc()'d
 238  * copy for both the read-only and the read-write case.  The combination of
 239  * (bp) and (data) determines whether (data) was allocated or not.
 240  *
 241  * The in-memory representation may remain cached (for example in order to
 242  * placemark clustering locks) even after the related data has been
 243  * detached.
 244  */
 245
 246 RB_HEAD(hammer2_inode_tree, hammer2_inode);
 247
 248 /*
 249  * A hammer2 inode.
 250  *
 251  * NOTE: The inode's attribute CST which is also used to lock the inode
 252  *       is embedded in the chain (chain.cst) and aliased w/ attr_cst.
 253  */
 254 struct hammer2_inode {
 255         RB_ENTRY(hammer2_inode) rbnode;         /* inumber lookup (HL) */
 256         ccms_cst_t              topo_cst;       /* directory topology cst */
 257         struct hammer2_mount    *hmp;           /* Global mount */
 258         struct hammer2_pfsmount *pmp;           /* PFS mount */
 259         struct hammer2_inode    *pip;           /* parent inode */
 260         struct vnode            *vp;
 261         hammer2_chain_t         *chain;         /* NOTE: rehomed on rename */
 262         struct lockf            advlock;
 263         hammer2_tid_t           inum;
 264         u_int                   flags;
 265         u_int                   refs;           /* +vpref, +flushref */
 266 };
 267
 268 typedef struct hammer2_inode hammer2_inode_t;
 269
 270 #define HAMMER2_INODE_MODIFIED          0x0001
 271 #define HAMMER2_INODE_DIRTYEMBED        0x0002
 272 #define HAMMER2_INODE_RENAME_INPROG     0x0004
 273 #define HAMMER2_INODE_ONRBTREE          0x0008
 274
 275 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2);
 276 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp,
 277                 hammer2_tid_t);
 278
 279 /*
 280  * A hammer2 transaction placeholder.
 281  *
 282  * This structure is required for all modifying operations, including
 283  * flushes.  It holds the transaction id allocated for the modifying
 284  * operation and is also used to interlock flushes and snapshots.
 285  */
 286 struct hammer2_trans {
 287         struct hammer2_mount    *hmp;
 288         hammer2_tid_t           sync_tid;
 289         uint8_t                 inodes_created;
 290         uint8_t                 dummy[7];
 291 };
 292
 293 typedef struct hammer2_trans hammer2_trans_t;
 294
 295 /*
 296  * XXX
 297  */
 298 struct hammer2_freecache {
 299         hammer2_off_t   bulk;
 300         hammer2_off_t   single;
 301 };
 302
 303 typedef struct hammer2_freecache hammer2_freecache_t;
 304
 305 /*
 306  * Global (per device) mount structure for device (aka vp->v_mount->hmp)
 307  */
 308 struct hammer2_mount {
 309         struct vnode    *devvp;         /* device vnode */
 310         int             ronly;          /* read-only mount */
 311         int             pmp_count;      /* PFS mounts backed by us */
 312         TAILQ_ENTRY(hammer2_mount) mntentry; /* hammer2_mntlist */
 313
 314         struct malloc_type *minode;
 315         int             ninodes;
 316         int             maxinodes;
 317
 318         struct malloc_type *mchain;
 319         int             nipstacks;
 320         int             maxipstacks;
 321         hammer2_chain_t vchain;         /* anchor chain */
 322         hammer2_chain_t *schain;        /* super-root */
 323         hammer2_inode_t *sroot;         /* super-root inode */
 324         struct lock     alloclk;        /* lockmgr lock */
 325         struct lock     voldatalk;      /* lockmgr lock */
 326         hammer2_tid_t   flush_tid;      /* (voldata locked, flush running) */
 327         thread_t        flush_td;       /* vfs_sync cycle owner */
 328         int             flush_wait;
 329         int             volhdrno;       /* last volhdrno written */
 330         hammer2_volume_data_t voldata;
 331         hammer2_volume_data_t volsync;  /* synchronized voldata */
 332         hammer2_freecache_t freecache[HAMMER2_FREECACHE_TYPES]
 333                                      [HAMMER2_MAX_RADIX+1];
 334 };
 335
 336 typedef struct hammer2_mount hammer2_mount_t;
 337
 338 /*
 339  * Per-PFS mount structure for device (aka vp->v_mount)
 340  */
 341 struct hammer2_pfsmount {
 342         struct mount            *mp;            /* kernel mount */
 343         struct hammer2_mount    *hmp;           /* device global mount */
 344         hammer2_chain_t         *rchain;        /* PFS root chain */
 345         hammer2_inode_t         *iroot;         /* PFS root inode */
 346         hammer2_off_t           inode_count;    /* copy of inode_count */
 347         ccms_domain_t           ccms_dom;
 348         struct netexport        export;         /* nfs export */
 349         int                     ronly;          /* read-only mount */
 350         struct malloc_type      *mmsg;
 351         kdmsg_iocom_t           iocom;
 352         struct spinlock         inum_spin;      /* inumber lookup */
 353         struct hammer2_inode_tree inum_tree;
 354 };
 355
 356 typedef struct hammer2_pfsmount hammer2_pfsmount_t;
 357
 358 #if defined(_KERNEL)
 359
 360 MALLOC_DECLARE(M_HAMMER2);
 361
 362 #define VTOI(vp)        ((hammer2_inode_t *)(vp)->v_data)
 363 #define ITOV(ip)        ((ip)->vp)
 364
 365 static __inline
 366 hammer2_pfsmount_t *
 367 MPTOPMP(struct mount *mp)
 368 {
 369         return ((hammer2_pfsmount_t *)mp->mnt_data);
 370 }
 371
 372 static __inline
 373 hammer2_mount_t *
 374 MPTOHMP(struct mount *mp)
 375 {
 376         return (((hammer2_pfsmount_t *)mp->mnt_data)->hmp);
 377 }
 378
 379 extern struct vop_ops hammer2_vnode_vops;
 380 extern struct vop_ops hammer2_spec_vops;
 381 extern struct vop_ops hammer2_fifo_vops;
 382
 383 extern int hammer2_debug;
 384 extern int hammer2_cluster_enable;
 385 extern int hammer2_hardlink_enable;
 386 extern long hammer2_iod_file_read;
 387 extern long hammer2_iod_meta_read;
 388 extern long hammer2_iod_indr_read;
 389 extern long hammer2_iod_file_write;
 390 extern long hammer2_iod_meta_write;
 391 extern long hammer2_iod_indr_write;
 392 extern long hammer2_iod_fmap_write;
 393 extern long hammer2_iod_volu_write;
 394 extern long hammer2_ioa_file_read;
 395 extern long hammer2_ioa_meta_read;
 396 extern long hammer2_ioa_indr_read;
 397 extern long hammer2_ioa_file_write;
 398 extern long hammer2_ioa_meta_write;
 399 extern long hammer2_ioa_indr_write;
 400 extern long hammer2_ioa_fmap_write;
 401 extern long hammer2_ioa_volu_write;
 402
 403 /*
 404  * hammer2_subr.c
 405  */
 406 #define hammer2_icrc32(buf, size)       iscsi_crc32((buf), (size))
 407 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc))
 408
 409 void hammer2_inode_lock_ex(hammer2_inode_t *ip);
 410 void hammer2_inode_lock_sh(hammer2_inode_t *ip);
 411 void hammer2_inode_unlock_ex(hammer2_inode_t *ip);
 412 void hammer2_inode_unlock_sh(hammer2_inode_t *ip);
 413 void hammer2_voldata_lock(hammer2_mount_t *hmp);
 414 void hammer2_voldata_unlock(hammer2_mount_t *hmp, int modify);
 415 ccms_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip);
 416 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip, ccms_state_t ostate);
 417 ccms_state_t hammer2_inode_lock_upgrade(hammer2_inode_t *ip);
 418 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, ccms_state_t ostate);
 419
 420 void hammer2_mount_exlock(hammer2_mount_t *hmp);
 421 void hammer2_mount_shlock(hammer2_mount_t *hmp);
 422 void hammer2_mount_unlock(hammer2_mount_t *hmp);
 423
 424 int hammer2_get_dtype(hammer2_chain_t *chain);
 425 int hammer2_get_vtype(hammer2_chain_t *chain);
 426 u_int8_t hammer2_get_obj_type(enum vtype vtype);
 427 void hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts);
 428 u_int64_t hammer2_timespec_to_time(struct timespec *ts);
 429 u_int32_t hammer2_to_unix_xid(uuid_t *uuid);
 430 void hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
 431
 432 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len);
 433 int hammer2_allocsize(size_t bytes);
 434
 435 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
 436                          hammer2_key_t *lbasep, hammer2_key_t *leofp);
 437 void hammer2_update_time(uint64_t *timep);
 438
 439 /*
 440  * hammer2_inode.c
 441  */
 442 struct vnode *hammer2_igetv(hammer2_inode_t *ip, int *errorp);
 443
 444 void hammer2_inode_lock_nlinks(hammer2_inode_t *ip);
 445 void hammer2_inode_unlock_nlinks(hammer2_inode_t *ip);
 446 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfsmount_t *pmp,
 447                         hammer2_tid_t inum);
 448 hammer2_inode_t *hammer2_inode_get(hammer2_mount_t *hmp,
 449                         hammer2_pfsmount_t *pmp, hammer2_inode_t *dip,
 450                         hammer2_chain_t *chain);
 451 void hammer2_inode_put(hammer2_inode_t *ip);
 452 void hammer2_inode_free(hammer2_inode_t *ip);
 453 void hammer2_inode_ref(hammer2_inode_t *ip);
 454 void hammer2_inode_drop(hammer2_inode_t *ip);
 455 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip,
 456                         hammer2_chain_t *chain);
 457 int hammer2_inode_calc_alloc(hammer2_key_t filesize);
 458
 459 hammer2_inode_t *hammer2_inode_create(hammer2_trans_t *trans,
 460                         hammer2_inode_t *dip,
 461                         struct vattr *vap, struct ucred *cred,
 462                         const uint8_t *name, size_t name_len,
 463                         int *errorp);
 464 int hammer2_inode_connect(hammer2_trans_t *trans, int hlink,
 465                         hammer2_inode_t *dip, hammer2_chain_t **chainp,
 466                         const uint8_t *name, size_t name_len);
 467 hammer2_inode_t *hammer2_inode_common_parent(hammer2_inode_t *fdip,
 468                         hammer2_inode_t *tdip);
 469
 470 int hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
 471                         const uint8_t *name, size_t name_len, int isdir,
 472                         int *hlinkp);
 473 int hammer2_hardlink_consolidate(hammer2_trans_t *trans, hammer2_inode_t *ip,
 474                         hammer2_chain_t **chainp,
 475                         hammer2_inode_t *tdip, int linkcnt);
 476 int hammer2_hardlink_deconsolidate(hammer2_trans_t *trans, hammer2_inode_t *dip,
 477                         hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
 478 int hammer2_hardlink_find(hammer2_inode_t *dip,
 479                         hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
 480
 481 /*
 482  * hammer2_chain.c
 483  */
 484 void hammer2_modify_volume(hammer2_mount_t *hmp);
 485 hammer2_chain_t *hammer2_chain_alloc(hammer2_mount_t *hmp,
 486                                 hammer2_blockref_t *bref);
 487 void hammer2_chain_core_alloc(hammer2_chain_t *chain,
 488                                 hammer2_chain_core_t *core);
 489 void hammer2_chain_free(hammer2_chain_t *chain);
 490 void hammer2_chain_ref(hammer2_chain_t *chain);
 491 void hammer2_chain_drop(hammer2_chain_t *chain);
 492 int hammer2_chain_lock(hammer2_chain_t *chain, int how);
 493 void hammer2_chain_moved(hammer2_chain_t *chain);
 494 void hammer2_chain_modify(hammer2_trans_t *trans,
 495                                 hammer2_chain_t *chain, int flags);
 496 hammer2_inode_data_t *hammer2_chain_modify_ip(hammer2_trans_t *trans,
 497                                 hammer2_inode_t *ip, int flags);
 498 void hammer2_chain_resize(hammer2_trans_t *trans, hammer2_inode_t *ip,
 499                                 struct buf *bp,
 500                                 hammer2_chain_t *parent,
 501                                 hammer2_chain_t **chainp,
 502                                 int nradix, int flags);
 503 void hammer2_chain_unlock(hammer2_chain_t *chain);
 504 void hammer2_chain_wait(hammer2_chain_t *chain);
 505 hammer2_chain_t *hammer2_chain_find(hammer2_chain_t *parent, int index);
 506 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent, int index,
 507                                 int flags);
 508 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags);
 509 void hammer2_chain_lookup_done(hammer2_chain_t *parent);
 510 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp,
 511                                 hammer2_key_t key_beg, hammer2_key_t key_end,
 512                                 int flags);
 513 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp,
 514                                 hammer2_chain_t *chain,
 515                                 hammer2_key_t key_beg, hammer2_key_t key_end,
 516                                 int flags);
 517 int hammer2_chain_create(hammer2_trans_t *trans,
 518                                 hammer2_chain_t **parentp,
 519                                 hammer2_chain_t **chainp,
 520                                 hammer2_key_t key, int keybits,
 521                                 int type, size_t bytes);
 522 void hammer2_chain_duplicate(hammer2_trans_t *trans, hammer2_chain_t *parent,
 523                                 int i,
 524                                 hammer2_chain_t **chainp,
 525                                 hammer2_blockref_t *bref);
 526 void hammer2_chain_delete(hammer2_trans_t *trans, hammer2_chain_t *parent,
 527                                 hammer2_chain_t *chain);
 528 void hammer2_chain_flush(hammer2_trans_t *trans, hammer2_chain_t *chain);
 529 void hammer2_chain_commit(hammer2_trans_t *trans, hammer2_chain_t *chain);
 530 void hammer2_chain_parent_setsubmod(hammer2_chain_t *chain);
 531
 532 /*
 533  * hammer2_trans.c
 534  */
 535 void hammer2_trans_init_flush(hammer2_mount_t *hmp, hammer2_trans_t *trans,
 536                               int master);
 537 void hammer2_trans_done_flush(hammer2_trans_t *trans, int master);
 538 void hammer2_trans_init(hammer2_mount_t *hmp, hammer2_trans_t *trans);
 539 void hammer2_trans_done(hammer2_trans_t *trans);
 540
 541 /*
 542  * hammer2_ioctl.c
 543  */
 544 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data,
 545                                 int fflag, struct ucred *cred);
 546
 547 /*
 548  * hammer2_msgops.c
 549  */
 550 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg);
 551 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg);
 552
 553 /*
 554  * hammer2_vfsops.c
 555  */
 556 void hammer2_clusterctl_wakeup(kdmsg_iocom_t *iocom);
 557 void hammer2_volconf_update(hammer2_pfsmount_t *pmp, int index);
 558 void hammer2_cluster_reconnect(hammer2_pfsmount_t *pmp, struct file *fp);
 559 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp);
 560
 561 /*
 562  * hammer2_freemap.c
 563  */
 564 hammer2_off_t hammer2_freemap_alloc(hammer2_mount_t *hmp,
 565                                 int type, size_t bytes);
 566 void hammer2_freemap_free(hammer2_mount_t *hmp, hammer2_off_t data_off,
 567                                 int type);
 568
 569 #endif /* !_KERNEL */
 570 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */