sys/vfs/hammer/hammer.h

   1 /*
   2  * Copyright (c) 2007-2008 The DragonFly Project.  All rights reserved.
   3  *
   4  * This code is derived from software contributed to The DragonFly Project
   5  * by Matthew Dillon <dillon@backplane.com>
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  *
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in
  15  *    the documentation and/or other materials provided with the
  16  *    distribution.
  17  * 3. Neither the name of The DragonFly Project nor the names of its
  18  *    contributors may be used to endorse or promote products derived
  19  *    from this software without specific, prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  24  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
  25  * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  26  * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
  27  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  28  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
  29  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  30  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  31  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  *
  34  * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.111 2008/07/11 01:22:29 dillon Exp $
  35  */
  36 /*
  37  * This header file contains structures used internally by the HAMMERFS
  38  * implementation.  See hammer_disk.h for on-disk structures.
  39  */
  40
  41 #include <sys/param.h>
  42 #include <sys/types.h>
  43 #include <sys/kernel.h>
  44 #include <sys/conf.h>
  45 #include <sys/systm.h>
  46 #include <sys/tree.h>
  47 #include <sys/malloc.h>
  48 #include <sys/mount.h>
  49 #include <sys/mountctl.h>
  50 #include <sys/vnode.h>
  51 #include <sys/proc.h>
  52 #include <sys/stat.h>
  53 #include <sys/globaldata.h>
  54 #include <sys/lockf.h>
  55 #include <sys/buf.h>
  56 #include <sys/queue.h>
  57 #include <sys/ktr.h>
  58 #include <sys/globaldata.h>
  59
  60 #include <sys/buf2.h>
  61 #include <sys/signal2.h>
  62 #include "hammer_disk.h"
  63 #include "hammer_mount.h"
  64 #include "hammer_ioctl.h"
  65
  66 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
  67
  68 MALLOC_DECLARE(M_HAMMER);
  69
  70 /*
  71  * Kernel trace
  72  */
  73 #if !defined(KTR_HAMMER)
  74 #define KTR_HAMMER      KTR_ALL
  75 #endif
  76 KTR_INFO_MASTER_EXTERN(hammer);
  77
  78 /*
  79  * Misc structures
  80  */
  81 struct hammer_mount;
  82
  83 /*
  84  * Key structure used for custom RB tree inode lookups.  This prototypes
  85  * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
  86  */
  87 typedef struct hammer_inode_info {
  88         int64_t         obj_id;         /* (key) object identifier */
  89         hammer_tid_t    obj_asof;       /* (key) snapshot transid or 0 */
  90         u_int32_t       obj_localization; /* (key) pseudo-fs */
  91         union {
  92                 struct hammer_btree_leaf_elm *leaf;
  93         } u;
  94 } *hammer_inode_info_t;
  95
  96 typedef enum hammer_transaction_type {
  97         HAMMER_TRANS_RO,
  98         HAMMER_TRANS_STD,
  99         HAMMER_TRANS_FLS
 100 } hammer_transaction_type_t;
 101
 102 /*
 103  * HAMMER Transaction tracking
 104  */
 105 struct hammer_transaction {
 106         hammer_transaction_type_t type;
 107         struct hammer_mount *hmp;
 108         hammer_tid_t    tid;
 109         u_int64_t       time;
 110         u_int32_t       time32;
 111         int             sync_lock_refs;
 112         struct hammer_volume *rootvol;
 113 };
 114
 115 typedef struct hammer_transaction *hammer_transaction_t;
 116
 117 /*
 118  * HAMMER locks
 119  */
 120 struct hammer_lock {
 121         int     refs;           /* active references delay writes */
 122         int     lockcount;      /* lock count for exclusive/shared access */
 123         int     wanted;
 124         int     exwanted;       /* number of threads waiting for ex lock */
 125         struct thread *locktd;
 126 };
 127
 128 static __inline int
 129 hammer_islocked(struct hammer_lock *lock)
 130 {
 131         return(lock->lockcount != 0);
 132 }
 133
 134 static __inline int
 135 hammer_isactive(struct hammer_lock *lock)
 136 {
 137         return(lock->refs != 0);
 138 }
 139
 140 static __inline int
 141 hammer_islastref(struct hammer_lock *lock)
 142 {
 143         return(lock->refs == 1);
 144 }
 145
 146 /*
 147  * Return if we specifically own the lock exclusively.
 148  */
 149 static __inline int
 150 hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td)
 151 {
 152         if (lock->lockcount > 0 && lock->locktd == td)
 153                 return(1);
 154         return(0);
 155 }
 156
 157 /*
 158  * Flush state, used by various structures
 159  */
 160 typedef enum hammer_inode_state {
 161         HAMMER_FST_IDLE,
 162         HAMMER_FST_SETUP,
 163         HAMMER_FST_FLUSH
 164 } hammer_inode_state_t;
 165
 166 TAILQ_HEAD(hammer_record_list, hammer_record);
 167
 168 /*
 169  * Pseudo-filesystem extended data tracking
 170  */
 171 struct hammer_pfs_rb_tree;
 172 struct hammer_pseudofs_inmem;
 173 RB_HEAD(hammer_pfs_rb_tree, hammer_pseudofs_inmem);
 174 RB_PROTOTYPE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node,
 175               hammer_pfs_rb_compare, u_int32_t);
 176
 177 struct hammer_pseudofs_inmem {
 178         RB_ENTRY(hammer_pseudofs_inmem) rb_node;
 179         struct hammer_lock      lock;
 180         u_int32_t               localization;
 181         hammer_tid_t            create_tid;
 182         udev_t                  fsid_udev;
 183         struct hammer_pseudofs_data pfsd;
 184 };
 185
 186 typedef struct hammer_pseudofs_inmem *hammer_pseudofs_inmem_t;
 187
 188 /*
 189  * Cache object ids.  A fixed number of objid cache structures are
 190  * created to reserve object id's for newly created files in multiples
 191  * of 100,000, localized to a particular directory, and recycled as
 192  * needed.  This allows parallel create operations in different
 193  * directories to retain fairly localized object ids which in turn
 194  * improves reblocking performance and layout.
 195  */
 196 #define OBJID_CACHE_SIZE        1024
 197 #define OBJID_CACHE_BULK        100000
 198
 199 typedef struct hammer_objid_cache {
 200         TAILQ_ENTRY(hammer_objid_cache) entry;
 201         struct hammer_inode             *dip;
 202         hammer_tid_t                    next_tid;
 203         int                             count;
 204 } *hammer_objid_cache_t;
 205
 206 /*
 207  * Associate an inode with a B-Tree node to cache search start positions
 208  */
 209 typedef struct hammer_node_cache {
 210         TAILQ_ENTRY(hammer_node_cache) entry;
 211         struct hammer_node              *node;
 212         struct hammer_inode             *ip;
 213 } *hammer_node_cache_t;
 214
 215 TAILQ_HEAD(hammer_node_cache_list, hammer_node_cache);
 216
 217 /*
 218  * Structure used to represent an inode in-memory.
 219  *
 220  * The record and data associated with an inode may be out of sync with
 221  * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
 222  * clear).
 223  *
 224  * An inode may also hold a cache of unsynchronized records, used for
 225  * database and directories only.  Unsynchronized regular file data is
 226  * stored in the buffer cache.
 227  *
 228  * NOTE: A file which is created and destroyed within the initial
 229  * synchronization period can wind up not doing any disk I/O at all.
 230  *
 231  * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
 232  */
 233 struct hammer_ino_rb_tree;
 234 struct hammer_inode;
 235 RB_HEAD(hammer_ino_rb_tree, hammer_inode);
 236 RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
 237               hammer_ino_rb_compare, hammer_inode_info_t);
 238
 239 struct hammer_rec_rb_tree;
 240 struct hammer_record;
 241 RB_HEAD(hammer_rec_rb_tree, hammer_record);
 242 RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
 243               hammer_rec_rb_compare, hammer_btree_leaf_elm_t);
 244
 245 TAILQ_HEAD(hammer_node_list, hammer_node);
 246
 247 struct hammer_inode {
 248         RB_ENTRY(hammer_inode)  rb_node;
 249         hammer_inode_state_t    flush_state;
 250         int                     flush_group;
 251         TAILQ_ENTRY(hammer_inode) flush_entry;
 252         struct hammer_record_list target_list;  /* target of dependant recs */
 253         int64_t                 obj_id;         /* (key) object identifier */
 254         hammer_tid_t            obj_asof;       /* (key) snapshot or 0 */
 255         u_int32_t               obj_localization; /* (key) pseudo-fs */
 256         struct hammer_mount     *hmp;
 257         hammer_objid_cache_t    objid_cache;
 258         int                     flags;
 259         int                     error;          /* flush error */
 260         int                     cursor_ip_refs; /* sanity */
 261         int                     rsv_recs;
 262         struct vnode            *vp;
 263         hammer_pseudofs_inmem_t pfsm;
 264         struct lockf            advlock;
 265         struct hammer_lock      lock;           /* sync copy interlock */
 266         off_t                   trunc_off;
 267         struct hammer_btree_leaf_elm ino_leaf;  /* in-memory cache */
 268         struct hammer_inode_data ino_data;      /* in-memory cache */
 269         struct hammer_rec_rb_tree rec_tree;     /* in-memory cache */
 270         struct hammer_node_cache cache[2];      /* search initiate cache */
 271
 272         /*
 273          * When a demark is created to synchronize an inode to
 274          * disk, certain fields are copied so the front-end VOPs
 275          * can continue to run in parallel with the synchronization
 276          * occuring in the background.
 277          */
 278         int             sync_flags;             /* to-sync flags cache */
 279         off_t           sync_trunc_off;         /* to-sync truncation */
 280         off_t           save_trunc_off;         /* write optimization */
 281         struct hammer_btree_leaf_elm sync_ino_leaf; /* to-sync cache */
 282         struct hammer_inode_data sync_ino_data; /* to-sync cache */
 283 };
 284
 285 typedef struct hammer_inode *hammer_inode_t;
 286
 287 #define VTOI(vp)        ((struct hammer_inode *)(vp)->v_data)
 288
 289 #define HAMMER_INODE_DDIRTY     0x0001  /* in-memory ino_data is dirty */
 290                                         /* (not including atime/mtime) */
 291 #define HAMMER_INODE_RSV_INODES 0x0002  /* hmp->rsv_inodes bumped */
 292 #define HAMMER_INODE_UNUSED0004 0x0004
 293 #define HAMMER_INODE_XDIRTY     0x0008  /* in-memory records */
 294 #define HAMMER_INODE_ONDISK     0x0010  /* inode is on-disk (else not yet) */
 295 #define HAMMER_INODE_FLUSH      0x0020  /* flush on last ref */
 296 #define HAMMER_INODE_DELETED    0x0080  /* inode delete (backend) */
 297 #define HAMMER_INODE_DELONDISK  0x0100  /* delete synchronized to disk */
 298 #define HAMMER_INODE_RO         0x0200  /* read-only (because of as-of) */
 299 #define HAMMER_INODE_VHELD      0x0400  /* vnode held on sync */
 300 #define HAMMER_INODE_DONDISK    0x0800  /* data records may be on disk */
 301 #define HAMMER_INODE_BUFS       0x1000  /* dirty high level bps present */
 302 #define HAMMER_INODE_REFLUSH    0x2000  /* pipelined flush during flush */
 303 #define HAMMER_INODE_RECLAIM    0x4000  /* trying to reclaim */
 304 #define HAMMER_INODE_FLUSHW     0x8000  /* Someone waiting for flush */
 305
 306 #define HAMMER_INODE_TRUNCATED  0x00010000
 307 #define HAMMER_INODE_DELETING   0x00020000 /* inode delete request (frontend)*/
 308 #define HAMMER_INODE_RESIGNAL   0x00040000 /* re-signal on re-flush */
 309 #define HAMMER_INODE_ATIME      0x00100000 /* in-memory atime modified */
 310 #define HAMMER_INODE_MTIME      0x00200000 /* in-memory mtime modified */
 311 #define HAMMER_INODE_WOULDBLOCK 0x00400000 /* re-issue to new flush group */
 312
 313 #define HAMMER_INODE_MODMASK    (HAMMER_INODE_DDIRTY|                       \
 314                                  HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS|     \
 315                                  HAMMER_INODE_ATIME|HAMMER_INODE_MTIME|     \
 316                                  HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
 317
 318 #define HAMMER_INODE_MODMASK_NOXDIRTY \
 319                                 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY)
 320
 321 #define HAMMER_FLUSH_GROUP_SIZE 64
 322
 323 #define HAMMER_FLUSH_SIGNAL     0x0001
 324 #define HAMMER_FLUSH_RECURSION  0x0002
 325
 326 /*
 327  * Used by the inode reclaim code to pipeline reclaims and avoid
 328  * blowing out kernel memory or letting the flusher get too far
 329  * behind.
 330  */
 331 struct hammer_reclaim {
 332         TAILQ_ENTRY(hammer_reclaim) entry;
 333         int     okydoky;
 334 };
 335
 336 #define HAMMER_RECLAIM_FLUSH    2000
 337 #define HAMMER_RECLAIM_WAIT     4000
 338
 339 /*
 340  * Structure used to represent an unsynchronized record in-memory.  These
 341  * records typically represent directory entries.  Only non-historical
 342  * records are kept in-memory.
 343  *
 344  * Records are organized as a per-inode RB-Tree.  If the inode is not
 345  * on disk then neither are any records and the in-memory record tree
 346  * represents the entire contents of the inode.  If the inode is on disk
 347  * then the on-disk B-Tree is scanned in parallel with the in-memory
 348  * RB-Tree to synthesize the current state of the file.
 349  *
 350  * Records are also used to enforce the ordering of directory create/delete
 351  * operations.  A new inode will not be flushed to disk unless its related
 352  * directory entry is also being flushed at the same time.  A directory entry
 353  * will not be removed unless its related inode is also being removed at the
 354  * same time.
 355  */
 356 typedef enum hammer_record_type {
 357         HAMMER_MEM_RECORD_GENERAL,      /* misc record */
 358         HAMMER_MEM_RECORD_INODE,        /* inode record */
 359         HAMMER_MEM_RECORD_ADD,          /* positive memory cache record */
 360         HAMMER_MEM_RECORD_DEL,          /* negative delete-on-disk record */
 361         HAMMER_MEM_RECORD_DATA          /* bulk-data record w/on-disk ref */
 362 } hammer_record_type_t;
 363
 364 struct hammer_record {
 365         RB_ENTRY(hammer_record)         rb_node;
 366         TAILQ_ENTRY(hammer_record)      target_entry;
 367         hammer_inode_state_t            flush_state;
 368         int                             flush_group;
 369         hammer_record_type_t            type;
 370         struct hammer_lock              lock;
 371         struct hammer_reserve           *resv;
 372         struct hammer_inode             *ip;
 373         struct hammer_inode             *target_ip;
 374         struct hammer_btree_leaf_elm    leaf;
 375         union hammer_data_ondisk        *data;
 376         int                             flags;
 377 };
 378
 379 typedef struct hammer_record *hammer_record_t;
 380
 381 /*
 382  * Record flags.  Note that FE can only be set by the frontend if the
 383  * record has not been interlocked by the backend w/ BE.
 384  */
 385 #define HAMMER_RECF_ALLOCDATA           0x0001
 386 #define HAMMER_RECF_ONRBTREE            0x0002
 387 #define HAMMER_RECF_DELETED_FE          0x0004  /* deleted (frontend) */
 388 #define HAMMER_RECF_DELETED_BE          0x0008  /* deleted (backend) */
 389 #define HAMMER_RECF_UNUSED0010          0x0010
 390 #define HAMMER_RECF_INTERLOCK_BE        0x0020  /* backend interlock */
 391 #define HAMMER_RECF_WANTED              0x0040  /* wanted by the frontend */
 392 #define HAMMER_RECF_CONVERT_DELETE      0x0100 /* special case */
 393
 394 /*
 395  * hammer_delete_at_cursor() flags
 396  */
 397 #define HAMMER_DELETE_ADJUST            0x0001
 398 #define HAMMER_DELETE_DESTROY           0x0002
 399
 400 /*
 401  * In-memory structures representing on-disk structures.
 402  */
 403 struct hammer_volume;
 404 struct hammer_buffer;
 405 struct hammer_node;
 406 struct hammer_undo;
 407 struct hammer_reserve;
 408
 409 RB_HEAD(hammer_vol_rb_tree, hammer_volume);
 410 RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
 411 RB_HEAD(hammer_nod_rb_tree, hammer_node);
 412 RB_HEAD(hammer_und_rb_tree, hammer_undo);
 413 RB_HEAD(hammer_res_rb_tree, hammer_reserve);
 414
 415 RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
 416               hammer_vol_rb_compare, int32_t);
 417 RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
 418               hammer_buf_rb_compare, hammer_off_t);
 419 RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
 420               hammer_nod_rb_compare, hammer_off_t);
 421 RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node,
 422               hammer_und_rb_compare, hammer_off_t);
 423 RB_PROTOTYPE2(hammer_res_rb_tree, hammer_reserve, rb_node,
 424               hammer_res_rb_compare, hammer_off_t);
 425
 426 /*
 427  * IO management - embedded at the head of various in-memory structures
 428  *
 429  * VOLUME       - hammer_volume containing meta-data
 430  * META_BUFFER  - hammer_buffer containing meta-data
 431  * DATA_BUFFER  - hammer_buffer containing pure-data
 432  *
 433  * Dirty volume headers and dirty meta-data buffers are locked until the
 434  * flusher can sequence them out.  Dirty pure-data buffers can be written.
 435  * Clean buffers can be passively released.
 436  */
 437 typedef enum hammer_io_type {
 438         HAMMER_STRUCTURE_VOLUME,
 439         HAMMER_STRUCTURE_META_BUFFER,
 440         HAMMER_STRUCTURE_UNDO_BUFFER,
 441         HAMMER_STRUCTURE_DATA_BUFFER
 442 } hammer_io_type_t;
 443
 444 union hammer_io_structure;
 445 struct hammer_io;
 446
 447 struct worklist {
 448         LIST_ENTRY(worklist) node;
 449 };
 450
 451 TAILQ_HEAD(hammer_io_list, hammer_io);
 452 typedef struct hammer_io_list *hammer_io_list_t;
 453
 454 struct hammer_io {
 455         struct worklist         worklist;
 456         struct hammer_lock      lock;
 457         enum hammer_io_type     type;
 458         struct hammer_mount     *hmp;
 459         TAILQ_ENTRY(hammer_io)  mod_entry; /* list entry if modified */
 460         hammer_io_list_t        mod_list;
 461         struct buf              *bp;
 462         int64_t                 offset;    /* zone-2 offset */
 463         int                     bytes;     /* buffer cache buffer size */
 464         int                     loading;   /* loading/unloading interlock */
 465         int                     modify_refs;
 466
 467         u_int           modified : 1;   /* bp's data was modified */
 468         u_int           released : 1;   /* bp released (w/ B_LOCKED set) */
 469         u_int           running : 1;    /* bp write IO in progress */
 470         u_int           waiting : 1;    /* someone is waiting on us */
 471         u_int           validated : 1;  /* ondisk has been validated */
 472         u_int           waitdep : 1;    /* flush waits for dependancies */
 473         u_int           recovered : 1;  /* has recovery ref */
 474         u_int           waitmod : 1;    /* waiting for modify_refs */
 475         u_int           reclaim : 1;    /* reclaim requested */
 476         u_int           gencrc : 1;     /* crc needs to be generated */
 477 };
 478
 479 typedef struct hammer_io *hammer_io_t;
 480
 481 #define HAMMER_CLUSTER_SIZE     (64 * 1024)
 482 #if HAMMER_CLUSTER_SIZE > MAXBSIZE
 483 #undef  HAMMER_CLUSTER_SIZE
 484 #define HAMMER_CLUSTER_SIZE     MAXBSIZE
 485 #endif
 486 #define HAMMER_CLUSTER_BUFS     (HAMMER_CLUSTER_SIZE / HAMMER_BUFSIZE)
 487
 488 /*
 489  * In-memory volume representing on-disk buffer
 490  */
 491 struct hammer_volume {
 492         struct hammer_io io;
 493         RB_ENTRY(hammer_volume) rb_node;
 494         struct hammer_volume_ondisk *ondisk;
 495         int32_t vol_no;
 496         int64_t nblocks;        /* note: special calculation for statfs */
 497         int64_t buffer_base;    /* base offset of buffer 0 */
 498         hammer_off_t maxbuf_off; /* Maximum buffer offset (zone-2) */
 499         hammer_off_t maxraw_off; /* Maximum raw offset for device */
 500         char    *vol_name;
 501         struct vnode *devvp;
 502         int     vol_flags;
 503 };
 504
 505 typedef struct hammer_volume *hammer_volume_t;
 506
 507 /*
 508  * In-memory buffer (other then volume, super-cluster, or cluster),
 509  * representing an on-disk buffer.
 510  */
 511 struct hammer_buffer {
 512         struct hammer_io io;
 513         RB_ENTRY(hammer_buffer) rb_node;
 514         void *ondisk;
 515         struct hammer_volume *volume;
 516         hammer_off_t zoneX_offset;
 517         hammer_off_t zone2_offset;
 518         struct hammer_reserve *resv;
 519         struct hammer_node_list clist;
 520 };
 521
 522 typedef struct hammer_buffer *hammer_buffer_t;
 523
 524 /*
 525  * In-memory B-Tree node, representing an on-disk B-Tree node.
 526  *
 527  * This is a hang-on structure which is backed by a hammer_buffer,
 528  * indexed by a hammer_cluster, and used for fine-grained locking of
 529  * B-Tree nodes in order to properly control lock ordering.  A hammer_buffer
 530  * can contain multiple nodes representing wildly disassociated portions
 531  * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
 532  *
 533  * This structure uses a cluster-relative index to reduce the number
 534  * of layers required to access it, and also because all on-disk B-Tree
 535  * references are cluster-relative offsets.
 536  */
 537 struct hammer_node {
 538         struct hammer_lock      lock;           /* node-by-node lock */
 539         TAILQ_ENTRY(hammer_node) entry;         /* per-buffer linkage */
 540         RB_ENTRY(hammer_node)   rb_node;        /* per-cluster linkage */
 541         hammer_off_t            node_offset;    /* full offset spec */
 542         struct hammer_mount     *hmp;
 543         struct hammer_buffer    *buffer;        /* backing buffer */
 544         hammer_node_ondisk_t    ondisk;         /* ptr to on-disk structure */
 545         TAILQ_HEAD(, hammer_cursor) cursor_list;  /* deadlock recovery */
 546         struct hammer_node_cache_list cache_list; /* passive caches */
 547         int                     flags;
 548         int                     loading;        /* load interlock */
 549 };
 550
 551 #define HAMMER_NODE_DELETED     0x0001
 552 #define HAMMER_NODE_FLUSH       0x0002
 553 #define HAMMER_NODE_CRCGOOD     0x0004
 554 #define HAMMER_NODE_NEEDSCRC    0x0008
 555 #define HAMMER_NODE_NEEDSMIRROR 0x0010
 556
 557 typedef struct hammer_node      *hammer_node_t;
 558
 559 /*
 560  * List of locked nodes.
 561  */
 562 struct hammer_node_locklist {
 563         struct hammer_node_locklist *next;
 564         hammer_node_t   node;
 565 };
 566
 567 typedef struct hammer_node_locklist *hammer_node_locklist_t;
 568
 569
 570 /*
 571  * Common I/O management structure - embedded in in-memory structures
 572  * which are backed by filesystem buffers.
 573  */
 574 union hammer_io_structure {
 575         struct hammer_io        io;
 576         struct hammer_volume    volume;
 577         struct hammer_buffer    buffer;
 578 };
 579
 580 typedef union hammer_io_structure *hammer_io_structure_t;
 581
 582 /*
 583  * The reserve structure prevents the blockmap from allocating
 584  * out of a reserved bigblock.  Such reservations are used by
 585  * the direct-write mechanism.
 586  *
 587  * The structure is also used to hold off on reallocations of
 588  * big blocks from the freemap until flush dependancies have
 589  * been dealt with.
 590  */
 591 struct hammer_reserve {
 592         RB_ENTRY(hammer_reserve) rb_node;
 593         TAILQ_ENTRY(hammer_reserve) delay_entry;
 594         int             flush_group;
 595         int             flags;
 596         int             refs;
 597         int             zone;
 598         int             append_off;
 599         hammer_off_t    zone_offset;
 600 };
 601
 602 typedef struct hammer_reserve *hammer_reserve_t;
 603
 604 #define HAMMER_RESF_ONDELAY     0x0001
 605
 606 #include "hammer_cursor.h"
 607
 608 /*
 609  * The undo structure tracks recent undos to avoid laying down duplicate
 610  * undos within a flush group, saving us a significant amount of overhead.
 611  *
 612  * This is strictly a heuristic.
 613  */
 614 #define HAMMER_MAX_UNDOS        1024
 615 #define HAMMER_MAX_FLUSHERS     4
 616
 617 struct hammer_undo {
 618         RB_ENTRY(hammer_undo)   rb_node;
 619         TAILQ_ENTRY(hammer_undo) lru_entry;
 620         hammer_off_t            offset;
 621         int                     bytes;
 622 };
 623
 624 typedef struct hammer_undo *hammer_undo_t;
 625
 626 struct hammer_flusher_info;
 627
 628 struct hammer_flusher {
 629         int             signal;         /* flusher thread sequencer */
 630         int             act;            /* currently active flush group */
 631         int             done;           /* set to act when complete */
 632         int             next;           /* next flush group */
 633         int             group_lock;     /* lock sequencing of the next flush */
 634         int             exiting;        /* request master exit */
 635         int             count;          /* number of slave flushers */
 636         int             running;        /* number of slave flushers running */
 637         thread_t        td;             /* master flusher thread */
 638         hammer_tid_t    tid;            /* last flushed transaction id */
 639         int             finalize_want;          /* serialize finalization */
 640         struct hammer_lock finalize_lock;       /* serialize finalization */
 641         struct hammer_transaction trans;        /* shared transaction */
 642         struct hammer_flusher_info *info[HAMMER_MAX_FLUSHERS];
 643 };
 644
 645 /*
 646  * Internal hammer mount data structure
 647  */
 648 struct hammer_mount {
 649         struct mount *mp;
 650         /*struct vnode *rootvp;*/
 651         struct hammer_ino_rb_tree rb_inos_root;
 652         struct hammer_vol_rb_tree rb_vols_root;
 653         struct hammer_nod_rb_tree rb_nods_root;
 654         struct hammer_und_rb_tree rb_undo_root;
 655         struct hammer_res_rb_tree rb_resv_root;
 656         struct hammer_buf_rb_tree rb_bufs_root;
 657         struct hammer_pfs_rb_tree rb_pfsm_root;
 658         struct hammer_volume *rootvol;
 659         struct hammer_base_elm root_btree_beg;
 660         struct hammer_base_elm root_btree_end;
 661         int     flags;
 662         int     hflags;
 663         int     ronly;
 664         int     nvolumes;
 665         int     volume_iterator;
 666         int     masterid;       /* -1 or 0-15 - clustering and mirroring */
 667         int     rsv_inodes;     /* reserved space due to dirty inodes */
 668         int64_t rsv_databytes;  /* reserved space due to record data */
 669         int     rsv_recs;       /* reserved space due to dirty records */
 670         int     rsv_fromdelay;  /* bigblocks reserved due to flush delay */
 671         int     last_newrecords;
 672         int     count_newrecords;
 673
 674         int     inode_reclaims; /* inodes pending reclaim by flusher */
 675         int     count_inodes;   /* total number of inodes */
 676         int     count_iqueued;  /* inodes queued to flusher */
 677
 678         struct hammer_flusher flusher;
 679
 680         u_int   check_interrupt;
 681         uuid_t  fsid;
 682         struct hammer_io_list volu_list;        /* dirty undo buffers */
 683         struct hammer_io_list undo_list;        /* dirty undo buffers */
 684         struct hammer_io_list data_list;        /* dirty data buffers */
 685         struct hammer_io_list alt_data_list;    /* dirty data buffers */
 686         struct hammer_io_list meta_list;        /* dirty meta bufs    */
 687         struct hammer_io_list lose_list;        /* loose buffers      */
 688         int     locked_dirty_space;             /* meta/volu count    */
 689         int     io_running_space;
 690         int     objid_cache_count;
 691         hammer_tid_t    asof;                   /* snapshot mount */
 692         hammer_off_t    next_tid;
 693         int64_t copy_stat_freebigblocks;        /* number of free bigblocks */
 694
 695         u_int32_t namekey_iterator;
 696         struct netexport export;
 697         struct hammer_lock sync_lock;
 698         struct hammer_lock free_lock;
 699         struct hammer_lock undo_lock;
 700         struct hammer_lock blkmap_lock;
 701         struct hammer_blockmap  blockmap[HAMMER_MAX_ZONES];
 702         struct hammer_undo      undos[HAMMER_MAX_UNDOS];
 703         int                     undo_alloc;
 704         TAILQ_HEAD(, hammer_undo)  undo_lru_list;
 705         TAILQ_HEAD(, hammer_inode) flush_list;
 706         TAILQ_HEAD(, hammer_reserve) delay_list;
 707         TAILQ_HEAD(, hammer_objid_cache) objid_cache_list;
 708         TAILQ_HEAD(, hammer_reclaim) reclaim_list;
 709 };
 710
 711 typedef struct hammer_mount     *hammer_mount_t;
 712
 713 #define HAMMER_MOUNT_UNUSED0001 0x0001
 714
 715 struct hammer_sync_info {
 716         int error;
 717         int waitfor;
 718 };
 719
 720 #endif
 721
 722 /*
 723  * checkspace slop (8MB chunks), higher numbers are more conservative.
 724  */
 725 #define HAMMER_CHECKSPACE_SLOP_REBLOCK  25
 726 #define HAMMER_CHECKSPACE_SLOP_WRITE    20
 727 #define HAMMER_CHECKSPACE_SLOP_CREATE   20
 728 #define HAMMER_CHECKSPACE_SLOP_REMOVE   10
 729
 730 #if defined(_KERNEL)
 731
 732 extern struct vop_ops hammer_vnode_vops;
 733 extern struct vop_ops hammer_spec_vops;
 734 extern struct vop_ops hammer_fifo_vops;
 735 extern struct bio_ops hammer_bioops;
 736
 737 extern int hammer_debug_io;
 738 extern int hammer_debug_general;
 739 extern int hammer_debug_debug;
 740 extern int hammer_debug_inode;
 741 extern int hammer_debug_locks;
 742 extern int hammer_debug_btree;
 743 extern int hammer_debug_tid;
 744 extern int hammer_debug_recover;
 745 extern int hammer_debug_recover_faults;
 746 extern int hammer_debug_cluster_enable;
 747 extern int hammer_count_inodes;
 748 extern int hammer_count_iqueued;
 749 extern int hammer_count_reclaiming;
 750 extern int hammer_count_records;
 751 extern int hammer_count_record_datas;
 752 extern int hammer_count_volumes;
 753 extern int hammer_count_buffers;
 754 extern int hammer_count_nodes;
 755 extern int64_t hammer_count_extra_space_used;
 756 extern int64_t hammer_stats_btree_lookups;
 757 extern int64_t hammer_stats_btree_searches;
 758 extern int64_t hammer_stats_btree_inserts;
 759 extern int64_t hammer_stats_btree_deletes;
 760 extern int64_t hammer_stats_btree_elements;
 761 extern int64_t hammer_stats_btree_splits;
 762 extern int64_t hammer_stats_btree_iterations;
 763 extern int64_t hammer_stats_record_iterations;
 764 extern int hammer_count_dirtybufspace;
 765 extern int hammer_count_refedbufs;
 766 extern int hammer_count_reservations;
 767 extern int hammer_count_io_running_read;
 768 extern int hammer_count_io_running_write;
 769 extern int hammer_count_io_locked;
 770 extern int hammer_limit_dirtybufspace;
 771 extern int hammer_limit_iqueued;
 772 extern int hammer_limit_recs;
 773 extern int hammer_bio_count;
 774 extern int hammer_verify_zone;
 775 extern int hammer_write_mode;
 776 extern int64_t hammer_contention_count;
 777
 778 int     hammer_vop_inactive(struct vop_inactive_args *);
 779 int     hammer_vop_reclaim(struct vop_reclaim_args *);
 780 int     hammer_get_vnode(struct hammer_inode *ip, struct vnode **vpp);
 781 struct hammer_inode *hammer_get_inode(hammer_transaction_t trans,
 782                         hammer_inode_t dip, int64_t obj_id,
 783                         hammer_tid_t asof, u_int32_t localization,
 784                         int flags, int *errorp);
 785 void    hammer_scan_inode_snapshots(hammer_mount_t hmp,
 786                         hammer_inode_info_t iinfo,
 787                         int (*callback)(hammer_inode_t ip, void *data),
 788                         void *data);
 789 void    hammer_put_inode(struct hammer_inode *ip);
 790 void    hammer_put_inode_ref(struct hammer_inode *ip);
 791 void    hammer_inode_waitreclaims(hammer_mount_t hmp);
 792
 793 int     hammer_unload_volume(hammer_volume_t volume, void *data __unused);
 794 int     hammer_adjust_volume_mode(hammer_volume_t volume, void *data __unused);
 795
 796 int     hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
 797 int     hammer_install_volume(hammer_mount_t hmp, const char *volname);
 798
 799 int     hammer_ip_lookup(hammer_cursor_t cursor);
 800 int     hammer_ip_first(hammer_cursor_t cursor);
 801 int     hammer_ip_next(hammer_cursor_t cursor);
 802 int     hammer_ip_resolve_data(hammer_cursor_t cursor);
 803 int     hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
 804                         hammer_tid_t tid);
 805 int     hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
 806                         int64_t *stat_bytes);
 807 int     hammer_ip_check_directory_empty(hammer_transaction_t trans,
 808                         hammer_inode_t ip);
 809 int     hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
 810 int     hammer_queue_inodes_flusher(hammer_mount_t hmp, int waitfor);
 811
 812 hammer_record_t
 813         hammer_alloc_mem_record(hammer_inode_t ip, int data_len);
 814 void    hammer_flush_record_done(hammer_record_t record, int error);
 815 void    hammer_wait_mem_record_ident(hammer_record_t record, const char *ident);
 816 void    hammer_rel_mem_record(hammer_record_t record);
 817
 818 int     hammer_cursor_up(hammer_cursor_t cursor);
 819 int     hammer_cursor_up_locked(hammer_cursor_t cursor);
 820 int     hammer_cursor_down(hammer_cursor_t cursor);
 821 int     hammer_cursor_upgrade(hammer_cursor_t cursor);
 822 int     hammer_cursor_upgrade_node(hammer_cursor_t cursor);
 823 void    hammer_cursor_downgrade(hammer_cursor_t cursor);
 824 int     hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
 825                         int index);
 826 void    hammer_lock_ex_ident(struct hammer_lock *lock, const char *ident);
 827 int     hammer_lock_ex_try(struct hammer_lock *lock);
 828 void    hammer_lock_sh(struct hammer_lock *lock);
 829 int     hammer_lock_sh_try(struct hammer_lock *lock);
 830 int     hammer_lock_upgrade(struct hammer_lock *lock);
 831 void    hammer_lock_downgrade(struct hammer_lock *lock);
 832 int     hammer_lock_status(struct hammer_lock *lock);
 833 void    hammer_unlock(struct hammer_lock *lock);
 834 void    hammer_ref(struct hammer_lock *lock);
 835 void    hammer_unref(struct hammer_lock *lock);
 836
 837 void    hammer_sync_lock_ex(hammer_transaction_t trans);
 838 void    hammer_sync_lock_sh(hammer_transaction_t trans);
 839 int     hammer_sync_lock_sh_try(hammer_transaction_t trans);
 840 void    hammer_sync_unlock(hammer_transaction_t trans);
 841
 842 u_int32_t hammer_to_unix_xid(uuid_t *uuid);
 843 void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
 844 void    hammer_time_to_timespec(u_int64_t xtime, struct timespec *ts);
 845 u_int64_t hammer_timespec_to_time(struct timespec *ts);
 846 hammer_tid_t hammer_str_to_tid(const char *str, int *ispfs,
 847                         u_int32_t *localizationp);
 848 hammer_tid_t hammer_alloc_objid(hammer_mount_t hmp, hammer_inode_t dip);
 849 void hammer_clear_objid(hammer_inode_t dip);
 850 void hammer_destroy_objid_cache(hammer_mount_t hmp);
 851
 852 int hammer_enter_undo_history(hammer_mount_t hmp, hammer_off_t offset,
 853                         int bytes);
 854 void hammer_clear_undo_history(hammer_mount_t hmp);
 855 enum vtype hammer_get_vnode_type(u_int8_t obj_type);
 856 int hammer_get_dtype(u_int8_t obj_type);
 857 u_int8_t hammer_get_obj_type(enum vtype vtype);
 858 int64_t hammer_directory_namekey(const void *name, int len);
 859 int     hammer_nohistory(hammer_inode_t ip);
 860
 861 int     hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor,
 862                         hammer_node_cache_t cache, hammer_inode_t ip);
 863 void    hammer_normalize_cursor(hammer_cursor_t cursor);
 864 void    hammer_done_cursor(hammer_cursor_t cursor);
 865 int     hammer_recover_cursor(hammer_cursor_t cursor);
 866 void    hammer_unlock_cursor(hammer_cursor_t cursor, int also_ip);
 867 int     hammer_lock_cursor(hammer_cursor_t cursor, int also_ip);
 868 hammer_cursor_t hammer_push_cursor(hammer_cursor_t ocursor);
 869 void    hammer_pop_cursor(hammer_cursor_t ocursor, hammer_cursor_t ncursor);
 870
 871 void    hammer_cursor_replaced_node(hammer_node_t onode, hammer_node_t nnode);
 872 void    hammer_cursor_removed_node(hammer_node_t onode, hammer_node_t parent,
 873                         int index);
 874 void    hammer_cursor_split_node(hammer_node_t onode, hammer_node_t nnode,
 875                         int index);
 876 void    hammer_cursor_inserted_element(hammer_node_t node, int index);
 877 void    hammer_cursor_deleted_element(hammer_node_t node, int index);
 878
 879 int     hammer_btree_lookup(hammer_cursor_t cursor);
 880 int     hammer_btree_first(hammer_cursor_t cursor);
 881 int     hammer_btree_last(hammer_cursor_t cursor);
 882 int     hammer_btree_extract(hammer_cursor_t cursor, int flags);
 883 int     hammer_btree_iterate(hammer_cursor_t cursor);
 884 int     hammer_btree_iterate_reverse(hammer_cursor_t cursor);
 885 int     hammer_btree_insert(hammer_cursor_t cursor,
 886                             hammer_btree_leaf_elm_t elm, int *doprop);
 887 int     hammer_btree_delete(hammer_cursor_t cursor);
 888 void    hammer_btree_do_propagation(hammer_cursor_t cursor,
 889                             hammer_pseudofs_inmem_t pfsm,
 890                             hammer_btree_leaf_elm_t leaf);
 891 int     hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
 892 int     hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
 893 int     hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
 894 int     hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
 895
 896 int     btree_set_parent(hammer_transaction_t trans, hammer_node_t node,
 897                         hammer_btree_elm_t elm);
 898 int     hammer_btree_lock_children(hammer_cursor_t cursor,
 899                         struct hammer_node_locklist **locklistp);
 900 void    hammer_btree_unlock_children(struct hammer_node_locklist **locklistp);
 901 int     hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node);
 902 hammer_node_t hammer_btree_get_parent(hammer_node_t node, int *parent_indexp,
 903                         int *errorp, int try_exclusive);
 904
 905 void    hammer_print_btree_node(hammer_node_ondisk_t ondisk);
 906 void    hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
 907
 908 void    *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
 909                         int *errorp, struct hammer_buffer **bufferp);
 910 void    *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
 911                         int *errorp, struct hammer_buffer **bufferp);
 912 void    *hammer_bread_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
 913                         int *errorp, struct hammer_buffer **bufferp);
 914 void    *hammer_bnew_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
 915                         int *errorp, struct hammer_buffer **bufferp);
 916
 917 hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
 918
 919 hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
 920                         int32_t vol_no, int *errorp);
 921 hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp, hammer_off_t buf_offset,
 922                         int bytes, int isnew, int *errorp);
 923 void            hammer_del_buffers(hammer_mount_t hmp, hammer_off_t base_offset,
 924                         hammer_off_t zone2_offset, int bytes);
 925
 926 int             hammer_ref_volume(hammer_volume_t volume);
 927 int             hammer_ref_buffer(hammer_buffer_t buffer);
 928 void            hammer_flush_buffer_nodes(hammer_buffer_t buffer);
 929
 930 void            hammer_rel_volume(hammer_volume_t volume, int flush);
 931 void            hammer_rel_buffer(hammer_buffer_t buffer, int flush);
 932
 933 int             hammer_vfs_export(struct mount *mp, int op,
 934                         const struct export_args *export);
 935 hammer_node_t   hammer_get_node(hammer_mount_t hmp, hammer_off_t node_offset,
 936                         int isnew, int *errorp);
 937 void            hammer_ref_node(hammer_node_t node);
 938 hammer_node_t   hammer_ref_node_safe(struct hammer_mount *hmp,
 939                         hammer_node_cache_t cache, int *errorp);
 940 void            hammer_rel_node(hammer_node_t node);
 941 void            hammer_delete_node(hammer_transaction_t trans,
 942                         hammer_node_t node);
 943 void            hammer_cache_node(hammer_node_cache_t cache,
 944                         hammer_node_t node);
 945 void            hammer_uncache_node(hammer_node_cache_t cache);
 946 void            hammer_flush_node(hammer_node_t node);
 947
 948 void hammer_dup_buffer(struct hammer_buffer **bufferp,
 949                         struct hammer_buffer *buffer);
 950 hammer_node_t hammer_alloc_btree(hammer_transaction_t trans, int *errorp);
 951 void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len,
 952                         u_int16_t rec_type, hammer_off_t *data_offsetp,
 953                         struct hammer_buffer **data_bufferp, int *errorp);
 954
 955 int hammer_generate_undo(hammer_transaction_t trans, hammer_io_t io,
 956                         hammer_off_t zone1_offset, void *base, int len);
 957
 958 void hammer_put_volume(struct hammer_volume *volume, int flush);
 959 void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
 960
 961 hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans,
 962                         hammer_off_t owner, int *errorp);
 963 void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset,
 964                         hammer_off_t owner, int *errorp);
 965 int hammer_checkspace(hammer_mount_t hmp, int slop);
 966 hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone,
 967                         int bytes, int *errorp);
 968 hammer_reserve_t hammer_blockmap_reserve(hammer_mount_t hmp, int zone,
 969                         int bytes, hammer_off_t *zone_offp, int *errorp);
 970 void hammer_blockmap_reserve_complete(hammer_mount_t hmp,
 971                         hammer_reserve_t resv);
 972 void hammer_reserve_clrdelay(hammer_mount_t hmp, hammer_reserve_t resv);
 973 void hammer_blockmap_free(hammer_transaction_t trans,
 974                         hammer_off_t bmap_off, int bytes);
 975 void hammer_blockmap_finalize(hammer_transaction_t trans,
 976                         hammer_off_t bmap_off, int bytes);
 977 int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
 978                         int *curp, int *errorp);
 979 hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
 980                         int *errorp);
 981 hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
 982                         int *errorp);
 983 int64_t hammer_undo_used(hammer_transaction_t trans);
 984 int64_t hammer_undo_space(hammer_transaction_t trans);
 985 int64_t hammer_undo_max(hammer_mount_t hmp);
 986
 987 void hammer_start_transaction(struct hammer_transaction *trans,
 988                               struct hammer_mount *hmp);
 989 void hammer_simple_transaction(struct hammer_transaction *trans,
 990                               struct hammer_mount *hmp);
 991 void hammer_start_transaction_fls(struct hammer_transaction *trans,
 992                                   struct hammer_mount *hmp);
 993 void hammer_done_transaction(struct hammer_transaction *trans);
 994
 995 void hammer_modify_inode(hammer_inode_t ip, int flags);
 996 void hammer_flush_inode(hammer_inode_t ip, int flags);
 997 void hammer_flush_inode_done(hammer_inode_t ip);
 998 void hammer_wait_inode(hammer_inode_t ip);
 999
1000 int  hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
1001                         struct ucred *cred, struct hammer_inode *dip,
1002                         hammer_pseudofs_inmem_t pfsm,
1003                         struct hammer_inode **ipp);
1004 void hammer_rel_inode(hammer_inode_t ip, int flush);
1005 int hammer_reload_inode(hammer_inode_t ip, void *arg __unused);
1006 int hammer_ino_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2);
1007
1008 int hammer_sync_inode(hammer_inode_t ip);
1009 void hammer_test_inode(hammer_inode_t ip);
1010 void hammer_inode_unloadable_check(hammer_inode_t ip, int getvp);
1011
1012 int  hammer_ip_add_directory(struct hammer_transaction *trans,
1013                         hammer_inode_t dip, const char *name, int bytes,
1014                         hammer_inode_t nip);
1015 int  hammer_ip_del_directory(struct hammer_transaction *trans,
1016                         hammer_cursor_t cursor, hammer_inode_t dip,
1017                         hammer_inode_t ip);
1018 hammer_record_t hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset,
1019                         void *data, int bytes, int *errorp);
1020 int  hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size);
1021 int  hammer_ip_add_record(struct hammer_transaction *trans,
1022                         hammer_record_t record);
1023 int  hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
1024                         int64_t ran_beg, int64_t ran_end, int truncating);
1025 int  hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip,
1026                         int *countp);
1027 int  hammer_ip_sync_data(hammer_cursor_t cursor, hammer_inode_t ip,
1028                         int64_t offset, void *data, int bytes);
1029 int  hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec);
1030 int  hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t rec);
1031 hammer_pseudofs_inmem_t  hammer_load_pseudofs(hammer_transaction_t trans,
1032                         u_int32_t localization, int *errorp);
1033 int  hammer_mkroot_pseudofs(hammer_transaction_t trans, struct ucred *cred,
1034                         hammer_pseudofs_inmem_t pfsm);
1035 int  hammer_save_pseudofs(hammer_transaction_t trans,
1036                         hammer_pseudofs_inmem_t pfsm);
1037 void hammer_rel_pseudofs(hammer_mount_t hmp, hammer_pseudofs_inmem_t pfsm);
1038 int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
1039                         struct ucred *cred);
1040
1041 void hammer_io_init(hammer_io_t io, hammer_mount_t hmp,
1042                         enum hammer_io_type type);
1043 int hammer_io_read(struct vnode *devvp, struct hammer_io *io,
1044                         hammer_off_t limit);
1045 int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
1046 void hammer_io_inval(hammer_volume_t volume, hammer_off_t zone2_offset);
1047 struct buf *hammer_io_release(struct hammer_io *io, int flush);
1048 void hammer_io_flush(struct hammer_io *io);
1049 void hammer_io_waitdep(struct hammer_io *io);
1050 void hammer_io_wait_all(hammer_mount_t hmp, const char *ident);
1051 int hammer_io_direct_read(hammer_mount_t hmp, struct bio *bio);
1052 int hammer_io_direct_write(hammer_mount_t hmp, hammer_btree_leaf_elm_t leaf,
1053                           struct bio *bio);
1054 void hammer_io_direct_uncache(hammer_mount_t hmp, hammer_btree_leaf_elm_t leaf);
1055 void hammer_io_write_interlock(hammer_io_t io);
1056 void hammer_io_done_interlock(hammer_io_t io);
1057 void hammer_io_clear_modify(struct hammer_io *io, int inval);
1058 void hammer_io_clear_modlist(struct hammer_io *io);
1059 void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume,
1060                         void *base, int len);
1061 void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer,
1062                         void *base, int len);
1063 void hammer_modify_volume_done(hammer_volume_t volume);
1064 void hammer_modify_buffer_done(hammer_buffer_t buffer);
1065
1066 int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
1067                         struct hammer_ioc_reblock *reblock);
1068 int hammer_ioc_prune(hammer_transaction_t trans, hammer_inode_t ip,
1069                         struct hammer_ioc_prune *prune);
1070 int hammer_ioc_mirror_read(hammer_transaction_t trans, hammer_inode_t ip,
1071                         struct hammer_ioc_mirror_rw *mirror);
1072 int hammer_ioc_mirror_write(hammer_transaction_t trans, hammer_inode_t ip,
1073                         struct hammer_ioc_mirror_rw *mirror);
1074 int hammer_ioc_set_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1075                         struct ucred *cred, struct hammer_ioc_pseudofs_rw *pfs);
1076 int hammer_ioc_get_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1077                         struct hammer_ioc_pseudofs_rw *pfs);
1078
1079 int hammer_signal_check(hammer_mount_t hmp);
1080
1081 void hammer_flusher_create(hammer_mount_t hmp);
1082 void hammer_flusher_destroy(hammer_mount_t hmp);
1083 void hammer_flusher_sync(hammer_mount_t hmp);
1084 void hammer_flusher_async(hammer_mount_t hmp);
1085 int  hammer_flusher_meta_limit(hammer_mount_t hmp);
1086 int  hammer_flusher_undo_exhausted(hammer_transaction_t trans, int quarter);
1087 void hammer_flusher_clean_loose_ios(hammer_mount_t hmp);
1088 void hammer_flusher_finalize(hammer_transaction_t trans, int final);
1089
1090 int hammer_recover(hammer_mount_t hmp, hammer_volume_t rootvol);
1091 void hammer_recover_flush_buffers(hammer_mount_t hmp,
1092                         hammer_volume_t root_volume, int final);
1093
1094 void hammer_crc_set_blockmap(hammer_blockmap_t blockmap);
1095 void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk);
1096 void hammer_crc_set_leaf(void *data, hammer_btree_leaf_elm_t leaf);
1097
1098 int hammer_crc_test_blockmap(hammer_blockmap_t blockmap);
1099 int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk);
1100 int hammer_crc_test_btree(hammer_node_ondisk_t ondisk);
1101 int hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf);
1102 void hkprintf(const char *ctl, ...);
1103 udev_t hammer_fsid_to_udev(uuid_t *uuid);
1104
1105
1106 int hammer_blocksize(int64_t file_offset);
1107 int64_t hammer_blockdemarc(int64_t file_offset1, int64_t file_offset2);
1108
1109 #endif
1110
1111 static __inline void
1112 hammer_wait_mem_record(hammer_record_t record)
1113 {
1114         hammer_wait_mem_record_ident(record, "hmmwai");
1115 }
1116
1117 static __inline void
1118 hammer_lock_ex(struct hammer_lock *lock)
1119 {
1120         hammer_lock_ex_ident(lock, "hmrlck");
1121 }
1122
1123 /*
1124  * Indicate that a B-Tree node is being modified.
1125  */
1126 static __inline void
1127 hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node)
1128 {
1129         hammer_modify_buffer(trans, node->buffer, NULL, 0);
1130 }
1131
1132 static __inline void
1133 hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node)
1134 {
1135         hammer_modify_buffer(trans, node->buffer,
1136                              node->ondisk, sizeof(*node->ondisk));
1137 }
1138
1139 static __inline void
1140 hammer_modify_node(hammer_transaction_t trans, hammer_node_t node,
1141                    void *base, int len)
1142 {
1143         hammer_crc_t *crcptr;
1144
1145         KKASSERT((char *)base >= (char *)node->ondisk &&
1146                  (char *)base + len <=
1147                     (char *)node->ondisk + sizeof(*node->ondisk));
1148         hammer_modify_buffer(trans, node->buffer, base, len);
1149         crcptr = &node->ondisk->crc;
1150         hammer_modify_buffer(trans, node->buffer, crcptr, sizeof(hammer_crc_t));
1151         --node->buffer->io.modify_refs; /* only want one ref */
1152 }
1153
1154 /*
1155  * Indicate that the specified modifications have been completed.
1156  *
1157  * Do not try to generate the crc here, it's very expensive to do and a
1158  * sequence of insertions or deletions can result in many calls to this
1159  * function on the same node.
1160  */
1161 static __inline void
1162 hammer_modify_node_done(hammer_node_t node)
1163 {
1164         node->flags |= HAMMER_NODE_CRCGOOD;
1165         if ((node->flags & HAMMER_NODE_NEEDSCRC) == 0) {
1166                 node->flags |= HAMMER_NODE_NEEDSCRC;
1167                 node->buffer->io.gencrc = 1;
1168                 hammer_ref_node(node);
1169         }
1170         hammer_modify_buffer_done(node->buffer);
1171 }
1172
1173 #define hammer_modify_volume_field(trans, vol, field)           \
1174         hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \
1175                              sizeof((vol)->ondisk->field))
1176
1177 #define hammer_modify_node_field(trans, node, field)            \
1178         hammer_modify_node(trans, node, &(node)->ondisk->field, \
1179                              sizeof((node)->ondisk->field))
1180