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 #define HAMMER2_MODIFY_ASSERTNOCOPY     0x00000008
 194
 195 /*
 196  * Flags passed to hammer2_chain_lock()
 197  */
 198 #define HAMMER2_RESOLVE_NEVER           1
 199 #define HAMMER2_RESOLVE_MAYBE           2
 200 #define HAMMER2_RESOLVE_ALWAYS          3
 201 #define HAMMER2_RESOLVE_MASK            0x0F
 202
 203 #define HAMMER2_RESOLVE_SHARED          0x10
 204 #define HAMMER2_RESOLVE_NOREF           0x20
 205
 206 /*
 207  * Cluster different types of storage together for allocations
 208  */
 209 #define HAMMER2_FREECACHE_INODE         0
 210 #define HAMMER2_FREECACHE_INDIR         1
 211 #define HAMMER2_FREECACHE_DATA          2
 212 #define HAMMER2_FREECACHE_UNUSED3       3
 213 #define HAMMER2_FREECACHE_TYPES         4
 214
 215 /*
 216  * BMAP read-ahead maximum parameters
 217  */
 218 #define HAMMER2_BMAP_COUNT              16      /* max bmap read-ahead */
 219 #define HAMMER2_BMAP_BYTES              (HAMMER2_PBUFSIZE * HAMMER2_BMAP_COUNT)
 220
 221 /*
 222  * Misc
 223  */
 224 #define HAMMER2_FLUSH_DEPTH_LIMIT       40      /* stack recursion limit */
 225
 226 /*
 227  * HAMMER2 IN-MEMORY CACHE OF MEDIA STRUCTURES
 228  *
 229  * There is an in-memory representation of all on-media data structure.
 230  *
 231  * When accessed read-only the data will be mapped to the related buffer
 232  * cache buffer.
 233  *
 234  * When accessed read-write (marked modified) a kmalloc()'d copy of the
 235  * is created which can then be modified.  The copy is destroyed when a
 236  * filesystem block is allocated to replace it.
 237  *
 238  * Active inodes (those with vnodes attached) will maintain the kmalloc()'d
 239  * copy for both the read-only and the read-write case.  The combination of
 240  * (bp) and (data) determines whether (data) was allocated or not.
 241  *
 242  * The in-memory representation may remain cached (for example in order to
 243  * placemark clustering locks) even after the related data has been
 244  * detached.
 245  */
 246
 247 RB_HEAD(hammer2_inode_tree, hammer2_inode);
 248
 249 /*
 250  * A hammer2 inode.
 251  *
 252  * NOTE: The inode's attribute CST which is also used to lock the inode
 253  *       is embedded in the chain (chain.cst) and aliased w/ attr_cst.
 254  */
 255 struct hammer2_inode {
 256         RB_ENTRY(hammer2_inode) rbnode;         /* inumber lookup (HL) */
 257         ccms_cst_t              topo_cst;       /* directory topology cst */
 258         struct hammer2_mount    *hmp;           /* Global mount */
 259         struct hammer2_pfsmount *pmp;           /* PFS mount */
 260         struct hammer2_inode    *pip;           /* parent inode */
 261         struct vnode            *vp;
 262         hammer2_chain_t         *chain;         /* NOTE: rehomed on rename */
 263         struct lockf            advlock;
 264         hammer2_tid_t           inum;
 265         u_int                   flags;
 266         u_int                   refs;           /* +vpref, +flushref */
 267 };
 268
 269 typedef struct hammer2_inode hammer2_inode_t;
 270
 271 #define HAMMER2_INODE_MODIFIED          0x0001
 272 #define HAMMER2_INODE_DIRTYEMBED        0x0002
 273 #define HAMMER2_INODE_RENAME_INPROG     0x0004
 274 #define HAMMER2_INODE_ONRBTREE          0x0008
 275
 276 int hammer2_inode_cmp(hammer2_inode_t *ip1, hammer2_inode_t *ip2);
 277 RB_PROTOTYPE2(hammer2_inode_tree, hammer2_inode, rbnode, hammer2_inode_cmp,
 278                 hammer2_tid_t);
 279
 280 /*
 281  * A hammer2 transaction and flush sequencing structure.
 282  *
 283  * This global structure is tied into hammer2_mount and is used
 284  * to sequence modifying operations and flushes.
 285  *
 286  * (a) Any modifying operations with sync_tid >= flush_tid will stall until
 287  *     all modifying operating with sync_tid < flush_tid complete.
 288  *
 289  *     The flush related to flush_tid stalls until all modifying operations
 290  *     with sync_tid < flush_tid complete.
 291  *
 292  * (b) Once unstalled, modifying operations with sync_tid > flush_tid are
 293  *     allowed to run.  All modifications cause modify/duplicate operations
 294  *     to occur on the related chains.  Note that most INDIRECT blocks will
 295  *     be unaffected because the modifications just overload the RBTREE
 296  *     structurally instead of actually modifying the indirect blocks.
 297  *
 298  * (c) The actual flush unstalls and RUNS CONCURRENTLY with (b), but only
 299  *     utilizes the chain structures with sync_tid <= flush_tid.  The
 300  *     flush will modify related indirect blocks and inodes in-place
 301  *     (rather than duplicate) since the adjustments are compatible with
 302  *     (b)'s RBTREE overloading
 303  *
 304  *     SPECIAL NOTE:  Inode modifications have to also propagate along any
 305  *                    modify/duplicate chains.  File writes detect the flush
 306  *                    and force out the conflicting buffer cache buffer(s)
 307  *                    before reusing them.
 308  *
 309  * TODO: Flush merging.  When fsync() is called on multiple discrete files
 310  *       concurrently there is no reason to stall the second fsync.
 311  *       The final flush that reaches to root can cover both fsync()s.
 312  *
 313  *     The chains typically terminate as they fly onto the disk.  The flush
 314  *     ultimately reaches the volume header.
 315  */
 316 struct hammer2_trans {
 317         TAILQ_ENTRY(hammer2_trans) entry;
 318         struct hammer2_mount    *hmp;
 319         hammer2_tid_t           sync_tid;
 320         thread_t                td;
 321         int                     flags;
 322         int                     blocked;
 323         uint8_t                 inodes_created;
 324         uint8_t                 dummy[7];
 325 };
 326
 327 typedef struct hammer2_trans hammer2_trans_t;
 328
 329 #define HAMMER2_TRANS_ISFLUSH   0x0001
 330
 331 /*
 332  * XXX
 333  */
 334 struct hammer2_freecache {
 335         hammer2_off_t   bulk;
 336         hammer2_off_t   single;
 337 };
 338
 339 typedef struct hammer2_freecache hammer2_freecache_t;
 340
 341 /*
 342  * Global (per device) mount structure for device (aka vp->v_mount->hmp)
 343  */
 344 TAILQ_HEAD(hammer2_trans_queue, hammer2_trans);
 345
 346 struct hammer2_mount {
 347         struct vnode    *devvp;         /* device vnode */
 348         int             ronly;          /* read-only mount */
 349         int             pmp_count;      /* PFS mounts backed by us */
 350         TAILQ_ENTRY(hammer2_mount) mntentry; /* hammer2_mntlist */
 351
 352         struct malloc_type *minode;
 353         int             ninodes;
 354         int             maxinodes;
 355
 356         struct malloc_type *mchain;
 357         int             nipstacks;
 358         int             maxipstacks;
 359         hammer2_chain_t vchain;         /* anchor chain */
 360         hammer2_chain_t *schain;        /* super-root */
 361         hammer2_inode_t *sroot;         /* super-root inode */
 362         struct lock     alloclk;        /* lockmgr lock */
 363         struct lock     voldatalk;      /* lockmgr lock */
 364         struct hammer2_trans_queue transq; /* all in-progress transactions */
 365         hammer2_trans_t *curflush;      /* current flush in progress */
 366         hammer2_tid_t   flush_tid;      /* currently synchronizing flush pt */
 367         int             flushcnt;       /* #of flush trans on the list */
 368
 369         int             volhdrno;       /* last volhdrno written */
 370         hammer2_volume_data_t voldata;
 371         hammer2_volume_data_t volsync;  /* synchronized voldata */
 372         hammer2_freecache_t freecache[HAMMER2_FREECACHE_TYPES]
 373                                      [HAMMER2_MAX_RADIX+1];
 374 };
 375
 376 typedef struct hammer2_mount hammer2_mount_t;
 377
 378 /*
 379  * Per-PFS mount structure for device (aka vp->v_mount)
 380  */
 381 struct hammer2_pfsmount {
 382         struct mount            *mp;            /* kernel mount */
 383         struct hammer2_mount    *hmp;           /* device global mount */
 384         hammer2_chain_t         *rchain;        /* PFS root chain */
 385         hammer2_inode_t         *iroot;         /* PFS root inode */
 386         hammer2_off_t           inode_count;    /* copy of inode_count */
 387         ccms_domain_t           ccms_dom;
 388         struct netexport        export;         /* nfs export */
 389         int                     ronly;          /* read-only mount */
 390         struct malloc_type      *mmsg;
 391         kdmsg_iocom_t           iocom;
 392         struct spinlock         inum_spin;      /* inumber lookup */
 393         struct hammer2_inode_tree inum_tree;
 394 };
 395
 396 typedef struct hammer2_pfsmount hammer2_pfsmount_t;
 397
 398 #if defined(_KERNEL)
 399
 400 MALLOC_DECLARE(M_HAMMER2);
 401
 402 #define VTOI(vp)        ((hammer2_inode_t *)(vp)->v_data)
 403 #define ITOV(ip)        ((ip)->vp)
 404
 405 static __inline
 406 hammer2_pfsmount_t *
 407 MPTOPMP(struct mount *mp)
 408 {
 409         return ((hammer2_pfsmount_t *)mp->mnt_data);
 410 }
 411
 412 static __inline
 413 hammer2_mount_t *
 414 MPTOHMP(struct mount *mp)
 415 {
 416         return (((hammer2_pfsmount_t *)mp->mnt_data)->hmp);
 417 }
 418
 419 extern struct vop_ops hammer2_vnode_vops;
 420 extern struct vop_ops hammer2_spec_vops;
 421 extern struct vop_ops hammer2_fifo_vops;
 422
 423 extern int hammer2_debug;
 424 extern int hammer2_cluster_enable;
 425 extern int hammer2_hardlink_enable;
 426 extern long hammer2_iod_file_read;
 427 extern long hammer2_iod_meta_read;
 428 extern long hammer2_iod_indr_read;
 429 extern long hammer2_iod_file_write;
 430 extern long hammer2_iod_meta_write;
 431 extern long hammer2_iod_indr_write;
 432 extern long hammer2_iod_fmap_write;
 433 extern long hammer2_iod_volu_write;
 434 extern long hammer2_ioa_file_read;
 435 extern long hammer2_ioa_meta_read;
 436 extern long hammer2_ioa_indr_read;
 437 extern long hammer2_ioa_file_write;
 438 extern long hammer2_ioa_meta_write;
 439 extern long hammer2_ioa_indr_write;
 440 extern long hammer2_ioa_fmap_write;
 441 extern long hammer2_ioa_volu_write;
 442
 443 /*
 444  * hammer2_subr.c
 445  */
 446 #define hammer2_icrc32(buf, size)       iscsi_crc32((buf), (size))
 447 #define hammer2_icrc32c(buf, size, crc) iscsi_crc32_ext((buf), (size), (crc))
 448
 449 void hammer2_inode_lock_ex(hammer2_inode_t *ip);
 450 void hammer2_inode_lock_sh(hammer2_inode_t *ip);
 451 void hammer2_inode_unlock_ex(hammer2_inode_t *ip);
 452 void hammer2_inode_unlock_sh(hammer2_inode_t *ip);
 453 void hammer2_voldata_lock(hammer2_mount_t *hmp);
 454 void hammer2_voldata_unlock(hammer2_mount_t *hmp, int modify);
 455 ccms_state_t hammer2_inode_lock_temp_release(hammer2_inode_t *ip);
 456 void hammer2_inode_lock_temp_restore(hammer2_inode_t *ip, ccms_state_t ostate);
 457 ccms_state_t hammer2_inode_lock_upgrade(hammer2_inode_t *ip);
 458 void hammer2_inode_lock_downgrade(hammer2_inode_t *ip, ccms_state_t ostate);
 459
 460 void hammer2_mount_exlock(hammer2_mount_t *hmp);
 461 void hammer2_mount_shlock(hammer2_mount_t *hmp);
 462 void hammer2_mount_unlock(hammer2_mount_t *hmp);
 463
 464 int hammer2_get_dtype(hammer2_chain_t *chain);
 465 int hammer2_get_vtype(hammer2_chain_t *chain);
 466 u_int8_t hammer2_get_obj_type(enum vtype vtype);
 467 void hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts);
 468 u_int64_t hammer2_timespec_to_time(struct timespec *ts);
 469 u_int32_t hammer2_to_unix_xid(uuid_t *uuid);
 470 void hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
 471
 472 hammer2_key_t hammer2_dirhash(const unsigned char *name, size_t len);
 473 int hammer2_allocsize(size_t bytes);
 474
 475 int hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
 476                          hammer2_key_t *lbasep, hammer2_key_t *leofp);
 477 void hammer2_update_time(uint64_t *timep);
 478
 479 /*
 480  * hammer2_inode.c
 481  */
 482 struct vnode *hammer2_igetv(hammer2_inode_t *ip, int *errorp);
 483
 484 void hammer2_inode_lock_nlinks(hammer2_inode_t *ip);
 485 void hammer2_inode_unlock_nlinks(hammer2_inode_t *ip);
 486 hammer2_inode_t *hammer2_inode_lookup(hammer2_pfsmount_t *pmp,
 487                         hammer2_tid_t inum);
 488 hammer2_inode_t *hammer2_inode_get(hammer2_mount_t *hmp,
 489                         hammer2_pfsmount_t *pmp, hammer2_inode_t *dip,
 490                         hammer2_chain_t *chain);
 491 void hammer2_inode_put(hammer2_inode_t *ip);
 492 void hammer2_inode_free(hammer2_inode_t *ip);
 493 void hammer2_inode_ref(hammer2_inode_t *ip);
 494 void hammer2_inode_drop(hammer2_inode_t *ip);
 495 void hammer2_inode_repoint(hammer2_inode_t *ip, hammer2_inode_t *pip,
 496                         hammer2_chain_t *chain);
 497 int hammer2_inode_calc_alloc(hammer2_key_t filesize);
 498
 499 hammer2_inode_t *hammer2_inode_create(hammer2_trans_t *trans,
 500                         hammer2_inode_t *dip,
 501                         struct vattr *vap, struct ucred *cred,
 502                         const uint8_t *name, size_t name_len,
 503                         int *errorp);
 504 int hammer2_inode_connect(hammer2_trans_t *trans, int hlink,
 505                         hammer2_inode_t *dip, hammer2_chain_t **chainp,
 506                         const uint8_t *name, size_t name_len);
 507 hammer2_inode_t *hammer2_inode_common_parent(hammer2_inode_t *fdip,
 508                         hammer2_inode_t *tdip);
 509
 510 int hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
 511                         const uint8_t *name, size_t name_len, int isdir,
 512                         int *hlinkp);
 513 int hammer2_hardlink_consolidate(hammer2_trans_t *trans, hammer2_inode_t *ip,
 514                         hammer2_chain_t **chainp,
 515                         hammer2_inode_t *tdip, int linkcnt);
 516 int hammer2_hardlink_deconsolidate(hammer2_trans_t *trans, hammer2_inode_t *dip,
 517                         hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
 518 int hammer2_hardlink_find(hammer2_inode_t *dip,
 519                         hammer2_chain_t **chainp, hammer2_chain_t **ochainp);
 520
 521 /*
 522  * hammer2_chain.c
 523  */
 524 void hammer2_modify_volume(hammer2_mount_t *hmp);
 525 hammer2_chain_t *hammer2_chain_alloc(hammer2_mount_t *hmp,
 526                                 hammer2_blockref_t *bref);
 527 void hammer2_chain_core_alloc(hammer2_chain_t *chain,
 528                                 hammer2_chain_core_t *core);
 529 void hammer2_chain_free(hammer2_chain_t *chain);
 530 void hammer2_chain_ref(hammer2_chain_t *chain);
 531 void hammer2_chain_drop(hammer2_chain_t *chain);
 532 int hammer2_chain_lock(hammer2_chain_t *chain, int how);
 533 void hammer2_chain_moved(hammer2_chain_t *chain);
 534 void hammer2_chain_modify(hammer2_trans_t *trans,
 535                                 hammer2_chain_t **chainp, int flags);
 536 hammer2_inode_data_t *hammer2_chain_modify_ip(hammer2_trans_t *trans,
 537                                 hammer2_inode_t *ip, int flags);
 538 void hammer2_chain_resize(hammer2_trans_t *trans, hammer2_inode_t *ip,
 539                                 struct buf *bp,
 540                                 hammer2_chain_t *parent,
 541                                 hammer2_chain_t **chainp,
 542                                 int nradix, int flags);
 543 void hammer2_chain_unlock(hammer2_chain_t *chain);
 544 void hammer2_chain_wait(hammer2_chain_t *chain);
 545 hammer2_chain_t *hammer2_chain_find(hammer2_chain_t *parent, int index);
 546 hammer2_chain_t *hammer2_chain_get(hammer2_chain_t *parent, int index,
 547                                 int flags);
 548 hammer2_chain_t *hammer2_chain_lookup_init(hammer2_chain_t *parent, int flags);
 549 void hammer2_chain_lookup_done(hammer2_chain_t *parent);
 550 hammer2_chain_t *hammer2_chain_lookup(hammer2_chain_t **parentp,
 551                                 hammer2_key_t key_beg, hammer2_key_t key_end,
 552                                 int flags);
 553 hammer2_chain_t *hammer2_chain_next(hammer2_chain_t **parentp,
 554                                 hammer2_chain_t *chain,
 555                                 hammer2_key_t key_beg, hammer2_key_t key_end,
 556                                 int flags);
 557 int hammer2_chain_create(hammer2_trans_t *trans,
 558                                 hammer2_chain_t **parentp,
 559                                 hammer2_chain_t **chainp,
 560                                 hammer2_key_t key, int keybits,
 561                                 int type, size_t bytes);
 562 void hammer2_chain_duplicate(hammer2_trans_t *trans, hammer2_chain_t *parent,
 563                                 int i,
 564                                 hammer2_chain_t **chainp,
 565                                 hammer2_blockref_t *bref);
 566 void hammer2_chain_delete(hammer2_trans_t *trans, hammer2_chain_t *parent,
 567                                 hammer2_chain_t *chain);
 568 void hammer2_chain_flush(hammer2_trans_t *trans, hammer2_chain_t *chain);
 569 void hammer2_chain_commit(hammer2_trans_t *trans, hammer2_chain_t *chain);
 570 void hammer2_chain_parent_setsubmod(hammer2_trans_t *trans,
 571                                 hammer2_chain_t *chain);
 572
 573 /*
 574  * hammer2_trans.c
 575  */
 576 void hammer2_trans_init(hammer2_mount_t *hmp, hammer2_trans_t *trans,
 577                                 int flags);
 578 void hammer2_trans_done(hammer2_trans_t *trans);
 579
 580 /*
 581  * hammer2_ioctl.c
 582  */
 583 int hammer2_ioctl(hammer2_inode_t *ip, u_long com, void *data,
 584                                 int fflag, struct ucred *cred);
 585
 586 /*
 587  * hammer2_msgops.c
 588  */
 589 int hammer2_msg_dbg_rcvmsg(kdmsg_msg_t *msg);
 590 int hammer2_msg_adhoc_input(kdmsg_msg_t *msg);
 591
 592 /*
 593  * hammer2_vfsops.c
 594  */
 595 void hammer2_clusterctl_wakeup(kdmsg_iocom_t *iocom);
 596 void hammer2_volconf_update(hammer2_pfsmount_t *pmp, int index);
 597 void hammer2_cluster_reconnect(hammer2_pfsmount_t *pmp, struct file *fp);
 598 void hammer2_dump_chain(hammer2_chain_t *chain, int tab, int *countp);
 599
 600 /*
 601  * hammer2_freemap.c
 602  */
 603 hammer2_off_t hammer2_freemap_alloc(hammer2_mount_t *hmp,
 604                                 int type, size_t bytes);
 605 void hammer2_freemap_free(hammer2_mount_t *hmp, hammer2_off_t data_off,
 606                                 int type);
 607
 608 #endif /* !_KERNEL */
 609 #endif /* !_VFS_HAMMER2_HAMMER2_H_ */