HAMMER VFS - Correct seriuos bug in hammer rebalancing code
[dragonfly.git] / sys / vfs / hammer / hammer.h
CommitLineData
8750964d 1/*
1f07f686 2 * Copyright (c) 2007-2008 The DragonFly Project. All rights reserved.
8750964d
MD
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 *
44a83111 34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.130 2008/11/13 02:18:43 dillon Exp $
8750964d
MD
35 */
36/*
37 * This header file contains structures used internally by the HAMMERFS
c60bb2c5 38 * implementation. See hammer_disk.h for on-disk structures.
8750964d
MD
39 */
40
427e5fc6
MD
41#include <sys/param.h>
42#include <sys/types.h>
43#include <sys/kernel.h>
42c7d26b 44#include <sys/conf.h>
427e5fc6 45#include <sys/systm.h>
8750964d
MD
46#include <sys/tree.h>
47#include <sys/malloc.h>
427e5fc6 48#include <sys/mount.h>
513ca7d7 49#include <sys/mountctl.h>
427e5fc6 50#include <sys/vnode.h>
42c7d26b 51#include <sys/proc.h>
895c1f85 52#include <sys/priv.h>
e63644f0 53#include <sys/stat.h>
427e5fc6 54#include <sys/globaldata.h>
66325755
MD
55#include <sys/lockf.h>
56#include <sys/buf.h>
8cd0a023 57#include <sys/queue.h>
bcac4bbb 58#include <sys/ktr.h>
66325755 59#include <sys/globaldata.h>
9192654c 60#include <sys/limits.h>
66325755
MD
61
62#include <sys/buf2.h>
855942b6 63#include <sys/signal2.h>
2247fe02 64#include <sys/mplock2.h>
427e5fc6 65#include "hammer_disk.h"
8750964d 66#include "hammer_mount.h"
7dc57964 67#include "hammer_ioctl.h"
8750964d
MD
68
69#if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
70
71MALLOC_DECLARE(M_HAMMER);
72
bcac4bbb
MD
73/*
74 * Kernel trace
75 */
76#if !defined(KTR_HAMMER)
77#define KTR_HAMMER KTR_ALL
78#endif
79KTR_INFO_MASTER_EXTERN(hammer);
80
81/*
82 * Misc structures
83 */
66325755
MD
84struct hammer_mount;
85
8750964d
MD
86/*
87 * Key structure used for custom RB tree inode lookups. This prototypes
88 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
89 */
90typedef struct hammer_inode_info {
513ca7d7 91 int64_t obj_id; /* (key) object identifier */
8750964d 92 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
ddfdf542 93 u_int32_t obj_localization; /* (key) pseudo-fs */
43c665ae
MD
94 union {
95 struct hammer_btree_leaf_elm *leaf;
96 } u;
8750964d
MD
97} *hammer_inode_info_t;
98
b84de5af
MD
99typedef enum hammer_transaction_type {
100 HAMMER_TRANS_RO,
101 HAMMER_TRANS_STD,
102 HAMMER_TRANS_FLS
103} hammer_transaction_type_t;
104
66325755
MD
105/*
106 * HAMMER Transaction tracking
107 */
108struct hammer_transaction {
b84de5af 109 hammer_transaction_type_t type;
66325755
MD
110 struct hammer_mount *hmp;
111 hammer_tid_t tid;
ddfdf542 112 u_int64_t time;
dd94f1b1 113 u_int32_t time32;
2f85fa4d 114 int sync_lock_refs;
21fde338 115 int flags;
a89aec1b 116 struct hammer_volume *rootvol;
66325755
MD
117};
118
8cd0a023
MD
119typedef struct hammer_transaction *hammer_transaction_t;
120
21fde338 121#define HAMMER_TRANSF_NEWINODE 0x0001
82010f9f 122#define HAMMER_TRANSF_DIDIO 0x0002
4c286c36 123#define HAMMER_TRANSF_CRCDOM 0x0004 /* EDOM on CRC error, less critical */
21fde338 124
66325755
MD
125/*
126 * HAMMER locks
127 */
427e5fc6 128struct hammer_lock {
899eb297
MD
129 int refs; /* active references delay writes */
130 volatile u_int lockval; /* lock count and control bits */
131 struct thread *owner; /* owner if exclusively held */
8750964d
MD
132};
133
899eb297
MD
134#define HAMMER_LOCKF_EXCLUSIVE 0x40000000
135#define HAMMER_LOCKF_WANTED 0x80000000
136
137static __inline int
138hammer_notlocked(struct hammer_lock *lock)
139{
140 return(lock->lockval == 0);
141}
142
427e5fc6
MD
143static __inline int
144hammer_islocked(struct hammer_lock *lock)
145{
899eb297 146 return(lock->lockval != 0);
427e5fc6
MD
147}
148
149static __inline int
0b075555
MD
150hammer_isactive(struct hammer_lock *lock)
151{
152 return(lock->refs != 0);
153}
154
155static __inline int
427e5fc6
MD
156hammer_islastref(struct hammer_lock *lock)
157{
158 return(lock->refs == 1);
159}
c60bb2c5 160
8750964d 161/*
7aa3b8a6 162 * Return if we specifically own the lock exclusively.
6a37e7e4
MD
163 */
164static __inline int
7aa3b8a6 165hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td)
6a37e7e4 166{
899eb297
MD
167 if ((lock->lockval & HAMMER_LOCKF_EXCLUSIVE) &&
168 lock->owner == td) {
7aa3b8a6 169 return(1);
899eb297 170 }
7aa3b8a6 171 return(0);
6a37e7e4
MD
172}
173
174/*
1f07f686 175 * Flush state, used by various structures
ec4e8497 176 */
1f07f686
MD
177typedef enum hammer_inode_state {
178 HAMMER_FST_IDLE,
179 HAMMER_FST_SETUP,
180 HAMMER_FST_FLUSH
181} hammer_inode_state_t;
ec4e8497 182
1f07f686 183TAILQ_HEAD(hammer_record_list, hammer_record);
ec4e8497
MD
184
185/*
5fa5c92f
MD
186 * Pseudo-filesystem extended data tracking
187 */
188struct hammer_pfs_rb_tree;
189struct hammer_pseudofs_inmem;
190RB_HEAD(hammer_pfs_rb_tree, hammer_pseudofs_inmem);
191RB_PROTOTYPE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node,
192 hammer_pfs_rb_compare, u_int32_t);
193
194struct hammer_pseudofs_inmem {
195 RB_ENTRY(hammer_pseudofs_inmem) rb_node;
196 struct hammer_lock lock;
197 u_int32_t localization;
ea434b6f 198 hammer_tid_t create_tid;
842e7a70 199 int flags;
a56cb012 200 udev_t fsid_udev;
5fa5c92f
MD
201 struct hammer_pseudofs_data pfsd;
202};
203
204typedef struct hammer_pseudofs_inmem *hammer_pseudofs_inmem_t;
205
842e7a70
MD
206#define HAMMER_PFSM_DELETED 0x0001
207
5fa5c92f 208/*
0729c8c8
MD
209 * Cache object ids. A fixed number of objid cache structures are
210 * created to reserve object id's for newly created files in multiples
211 * of 100,000, localized to a particular directory, and recycled as
212 * needed. This allows parallel create operations in different
213 * directories to retain fairly localized object ids which in turn
214 * improves reblocking performance and layout.
215 */
bf3b416b 216#define OBJID_CACHE_SIZE 1024
5a64efa1
MD
217#define OBJID_CACHE_BULK_BITS 10 /* 10 bits (1024) */
218#define OBJID_CACHE_BULK (32 * 32) /* two level (1024) */
219#define OBJID_CACHE_BULK_MASK (OBJID_CACHE_BULK - 1)
220#define OBJID_CACHE_BULK_MASK64 ((u_int64_t)(OBJID_CACHE_BULK - 1))
0729c8c8
MD
221
222typedef struct hammer_objid_cache {
223 TAILQ_ENTRY(hammer_objid_cache) entry;
224 struct hammer_inode *dip;
5a64efa1 225 hammer_tid_t base_tid;
0729c8c8 226 int count;
5a64efa1
MD
227 u_int32_t bm0;
228 u_int32_t bm1[32];
0729c8c8
MD
229} *hammer_objid_cache_t;
230
231/*
bcac4bbb
MD
232 * Associate an inode with a B-Tree node to cache search start positions
233 */
234typedef struct hammer_node_cache {
7a61b85d 235 TAILQ_ENTRY(hammer_node_cache) entry;
bcac4bbb
MD
236 struct hammer_node *node;
237 struct hammer_inode *ip;
238} *hammer_node_cache_t;
239
240TAILQ_HEAD(hammer_node_cache_list, hammer_node_cache);
241
242/*
7a61b85d
MD
243 * Structure used to organize flush groups. Flush groups must be
244 * organized into chunks in order to avoid blowing out the UNDO FIFO.
245 * Without this a 'sync' could end up flushing 50,000 inodes in a single
246 * transaction.
247 */
ff003b11
MD
248struct hammer_fls_rb_tree;
249RB_HEAD(hammer_fls_rb_tree, hammer_inode);
250RB_PROTOTYPE(hammer_fls_rb_tree, hammer_inode, rb_flsnode,
251 hammer_ino_rb_compare);
252
7a61b85d
MD
253struct hammer_flush_group {
254 TAILQ_ENTRY(hammer_flush_group) flush_entry;
ff003b11
MD
255 struct hammer_fls_rb_tree flush_tree;
256 int unused01;
7a61b85d
MD
257 int total_count; /* record load */
258 int running; /* group is running */
259 int closed;
260 int refs;
261};
262
263typedef struct hammer_flush_group *hammer_flush_group_t;
264
265TAILQ_HEAD(hammer_flush_group_list, hammer_flush_group);
266
267/*
8cd0a023
MD
268 * Structure used to represent an inode in-memory.
269 *
270 * The record and data associated with an inode may be out of sync with
271 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
272 * clear).
273 *
274 * An inode may also hold a cache of unsynchronized records, used for
275 * database and directories only. Unsynchronized regular file data is
276 * stored in the buffer cache.
277 *
278 * NOTE: A file which is created and destroyed within the initial
279 * synchronization period can wind up not doing any disk I/O at all.
280 *
281 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
8750964d
MD
282 */
283struct hammer_ino_rb_tree;
284struct hammer_inode;
285RB_HEAD(hammer_ino_rb_tree, hammer_inode);
286RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
8cd0a023
MD
287 hammer_ino_rb_compare, hammer_inode_info_t);
288
73896937
MD
289struct hammer_redo_rb_tree;
290RB_HEAD(hammer_redo_rb_tree, hammer_inode);
291RB_PROTOTYPE2(hammer_redo_rb_tree, hammer_inode, rb_redonode,
292 hammer_redo_rb_compare, hammer_off_t);
293
8cd0a023
MD
294struct hammer_rec_rb_tree;
295struct hammer_record;
296RB_HEAD(hammer_rec_rb_tree, hammer_record);
297RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
0832c9bb 298 hammer_rec_rb_compare, hammer_btree_leaf_elm_t);
8cd0a023
MD
299
300TAILQ_HEAD(hammer_node_list, hammer_node);
8750964d
MD
301
302struct hammer_inode {
1f07f686
MD
303 RB_ENTRY(hammer_inode) rb_node;
304 hammer_inode_state_t flush_state;
7a61b85d 305 hammer_flush_group_t flush_group;
ff003b11 306 RB_ENTRY(hammer_inode) rb_flsnode; /* when on flush list */
73896937 307 RB_ENTRY(hammer_inode) rb_redonode; /* when INODE_RDIRTY is set */
1f07f686 308 struct hammer_record_list target_list; /* target of dependant recs */
adf01747 309 int64_t obj_id; /* (key) object identifier */
b84de5af 310 hammer_tid_t obj_asof; /* (key) snapshot or 0 */
ddfdf542 311 u_int32_t obj_localization; /* (key) pseudo-fs */
b84de5af 312 struct hammer_mount *hmp;
0729c8c8 313 hammer_objid_cache_t objid_cache;
b84de5af
MD
314 int flags;
315 int error; /* flush error */
316 int cursor_ip_refs; /* sanity */
47637bff 317 int rsv_recs;
b84de5af 318 struct vnode *vp;
5fa5c92f 319 hammer_pseudofs_inmem_t pfsm;
b84de5af
MD
320 struct lockf advlock;
321 struct hammer_lock lock; /* sync copy interlock */
b84de5af 322 off_t trunc_off;
11ad5ade 323 struct hammer_btree_leaf_elm ino_leaf; /* in-memory cache */
b84de5af
MD
324 struct hammer_inode_data ino_data; /* in-memory cache */
325 struct hammer_rec_rb_tree rec_tree; /* in-memory cache */
3214ade6 326 int rec_generation;
39d8fd63 327 struct hammer_node_cache cache[4]; /* search initiate cache */
b84de5af
MD
328
329 /*
330 * When a demark is created to synchronize an inode to
331 * disk, certain fields are copied so the front-end VOPs
332 * can continue to run in parallel with the synchronization
333 * occuring in the background.
334 */
335 int sync_flags; /* to-sync flags cache */
336 off_t sync_trunc_off; /* to-sync truncation */
a9d52b76 337 off_t save_trunc_off; /* write optimization */
11ad5ade 338 struct hammer_btree_leaf_elm sync_ino_leaf; /* to-sync cache */
b84de5af 339 struct hammer_inode_data sync_ino_data; /* to-sync cache */
9192654c 340 size_t redo_count;
73896937
MD
341
342 /*
343 * Track the earliest offset in the UNDO/REDO FIFO containing
344 * REDO records. This is staged to the backend during flush
345 * sequences. While the inode is staged redo_fifo_next is used
346 * to track the earliest offset for rotation into redo_fifo_start
347 * on completion of the flush.
348 */
349 hammer_off_t redo_fifo_start;
350 hammer_off_t redo_fifo_next;
8750964d
MD
351};
352
8cd0a023
MD
353typedef struct hammer_inode *hammer_inode_t;
354
66325755
MD
355#define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
356
9192654c
MD
357/*
358 * NOTE: DDIRTY does not include atime or mtime and does not include
359 * write-append size changes. SDIRTY handles write-append size
360 * changes.
47f363f1
MD
361 *
362 * REDO indicates that REDO logging is active, creating a definitive
363 * stream of REDO records in the UNDO/REDO log for writes and
364 * truncations, including boundary records when/if REDO is turned off.
365 * REDO is typically enabled by fsync() and turned off if excessive
366 * writes without an fsync() occurs.
367 *
368 * RDIRTY indicates that REDO records were laid down in the UNDO/REDO
369 * FIFO (even if REDO is turned off some might still be active) and
370 * still being tracked for this inode. See hammer_redo.c
9192654c 371 */
ddfdf542 372 /* (not including atime/mtime) */
9192654c 373#define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
e63644f0 374#define HAMMER_INODE_RSV_INODES 0x0002 /* hmp->rsv_inodes bumped */
7b6ccb11 375#define HAMMER_INODE_CONN_DOWN 0x0004 /* include in downward recursion */
1f07f686 376#define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records */
8cd0a023 377#define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
a89aec1b 378#define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
869e8f55 379#define HAMMER_INODE_DELETED 0x0080 /* inode delete (backend) */
76376933 380#define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
d113fda1 381#define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */
e0092341 382#define HAMMER_INODE_UNUSED0400 0x0400
0a72edae 383#define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */
f3b0f382 384#define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */
f153644d 385#define HAMMER_INODE_REFLUSH 0x2000 /* flush on dependancy / reflush */
9f5097dc 386#define HAMMER_INODE_RECLAIM 0x4000 /* trying to reclaim */
059819e3 387#define HAMMER_INODE_FLUSHW 0x8000 /* Someone waiting for flush */
8cd0a023 388
b84de5af 389#define HAMMER_INODE_TRUNCATED 0x00010000
869e8f55 390#define HAMMER_INODE_DELETING 0x00020000 /* inode delete request (frontend)*/
4e17f465 391#define HAMMER_INODE_RESIGNAL 0x00040000 /* re-signal on re-flush */
ddfdf542 392#define HAMMER_INODE_ATIME 0x00100000 /* in-memory atime modified */
06ad81ff
MD
393#define HAMMER_INODE_MTIME 0x00200000 /* in-memory mtime modified */
394#define HAMMER_INODE_WOULDBLOCK 0x00400000 /* re-issue to new flush group */
4c286c36 395#define HAMMER_INODE_DUMMY 0x00800000 /* dummy inode covering bad file */
9192654c 396#define HAMMER_INODE_SDIRTY 0x01000000 /* in-memory ino_data.size is dirty*/
47f363f1
MD
397#define HAMMER_INODE_REDO 0x02000000 /* REDO logging active */
398#define HAMMER_INODE_RDIRTY 0x04000000 /* REDO records active in fifo */
b84de5af 399
9192654c 400#define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_SDIRTY| \
11ad5ade 401 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \
ddfdf542
MD
402 HAMMER_INODE_ATIME|HAMMER_INODE_MTIME| \
403 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
1f07f686 404
9192654c 405#define HAMMER_INODE_MODMASK_NOXDIRTY \
1f07f686 406 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY)
0b075555 407
9192654c
MD
408#define HAMMER_INODE_MODMASK_NOREDO \
409 (HAMMER_INODE_DDIRTY| \
410 HAMMER_INODE_XDIRTY| \
411 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
412
f90dde4c 413#define HAMMER_FLUSH_SIGNAL 0x0001
4e17f465 414#define HAMMER_FLUSH_RECURSION 0x0002
f90dde4c 415
7bc5b8c2
MD
416/*
417 * Used by the inode reclaim code to pipeline reclaims and avoid
418 * blowing out kernel memory or letting the flusher get too far
82010f9f
MD
419 * behind. The reclaim wakes up when count reaches 0 or the
420 * timer expires.
7bc5b8c2
MD
421 */
422struct hammer_reclaim {
423 TAILQ_ENTRY(hammer_reclaim) entry;
82010f9f 424 int count;
7bc5b8c2
MD
425};
426
ff003b11 427#define HAMMER_RECLAIM_WAIT 4000 /* default vfs.hammer.limit_reclaim */
9f5097dc 428
8750964d 429/*
e98f1b96
MD
430 * Track who is creating the greatest burden on the
431 * inode cache.
432 */
433struct hammer_inostats {
434 pid_t pid; /* track user process */
435 int ltick; /* last tick */
436 int count; /* count (degenerates) */
437};
438
439#define HAMMER_INOSTATS_HSIZE 32
440#define HAMMER_INOSTATS_HMASK (HAMMER_INOSTATS_HSIZE - 1)
441
442/*
1f07f686
MD
443 * Structure used to represent an unsynchronized record in-memory. These
444 * records typically represent directory entries. Only non-historical
445 * records are kept in-memory.
446 *
447 * Records are organized as a per-inode RB-Tree. If the inode is not
8cd0a023
MD
448 * on disk then neither are any records and the in-memory record tree
449 * represents the entire contents of the inode. If the inode is on disk
450 * then the on-disk B-Tree is scanned in parallel with the in-memory
451 * RB-Tree to synthesize the current state of the file.
452 *
1f07f686
MD
453 * Records are also used to enforce the ordering of directory create/delete
454 * operations. A new inode will not be flushed to disk unless its related
455 * directory entry is also being flushed at the same time. A directory entry
456 * will not be removed unless its related inode is also being removed at the
457 * same time.
8750964d 458 */
1f07f686 459typedef enum hammer_record_type {
e8599db1 460 HAMMER_MEM_RECORD_GENERAL, /* misc record */
930bf163 461 HAMMER_MEM_RECORD_INODE, /* inode record */
1f07f686 462 HAMMER_MEM_RECORD_ADD, /* positive memory cache record */
47637bff
MD
463 HAMMER_MEM_RECORD_DEL, /* negative delete-on-disk record */
464 HAMMER_MEM_RECORD_DATA /* bulk-data record w/on-disk ref */
1f07f686
MD
465} hammer_record_type_t;
466
8cd0a023
MD
467struct hammer_record {
468 RB_ENTRY(hammer_record) rb_node;
1f07f686
MD
469 TAILQ_ENTRY(hammer_record) target_entry;
470 hammer_inode_state_t flush_state;
7a61b85d 471 hammer_flush_group_t flush_group;
1f07f686 472 hammer_record_type_t type;
a89aec1b 473 struct hammer_lock lock;
0832c9bb 474 struct hammer_reserve *resv;
8cd0a023 475 struct hammer_inode *ip;
1f07f686 476 struct hammer_inode *target_ip;
11ad5ade 477 struct hammer_btree_leaf_elm leaf;
8cd0a023 478 union hammer_data_ondisk *data;
8cd0a023 479 int flags;
e469566b 480 hammer_off_t zone2_offset; /* direct-write only */
8cd0a023 481};
8750964d 482
8cd0a023
MD
483typedef struct hammer_record *hammer_record_t;
484
d36ec43b
MD
485/*
486 * Record flags. Note that FE can only be set by the frontend if the
487 * record has not been interlocked by the backend w/ BE.
488 */
8cd0a023
MD
489#define HAMMER_RECF_ALLOCDATA 0x0001
490#define HAMMER_RECF_ONRBTREE 0x0002
b84de5af 491#define HAMMER_RECF_DELETED_FE 0x0004 /* deleted (frontend) */
d36ec43b 492#define HAMMER_RECF_DELETED_BE 0x0008 /* deleted (backend) */
1b0ab2c3 493#define HAMMER_RECF_COMMITTED 0x0010 /* committed to the B-Tree */
d36ec43b 494#define HAMMER_RECF_INTERLOCK_BE 0x0020 /* backend interlock */
0832c9bb 495#define HAMMER_RECF_WANTED 0x0040 /* wanted by the frontend */
1b0ab2c3
MD
496#define HAMMER_RECF_CONVERT_DELETE 0x0100 /* special case */
497#define HAMMER_RECF_DIRECT_IO 0x0200 /* related direct I/O running*/
498#define HAMMER_RECF_DIRECT_WAIT 0x0400 /* related direct I/O running*/
e469566b 499#define HAMMER_RECF_DIRECT_INVAL 0x0800 /* buffer alias invalidation */
47f363f1 500#define HAMMER_RECF_REDO 0x1000 /* REDO was laid down */
8cd0a023
MD
501
502/*
83f2a3aa 503 * hammer_create_at_cursor() and hammer_delete_at_cursor() flags.
602c6cb8 504 */
83f2a3aa
MD
505#define HAMMER_CREATE_MODE_UMIRROR 0x0001
506#define HAMMER_CREATE_MODE_SYS 0x0002
507
602c6cb8
MD
508#define HAMMER_DELETE_ADJUST 0x0001
509#define HAMMER_DELETE_DESTROY 0x0002
510
511/*
47197d71 512 * In-memory structures representing on-disk structures.
8cd0a023 513 */
8750964d 514struct hammer_volume;
427e5fc6 515struct hammer_buffer;
8cd0a023 516struct hammer_node;
e8599db1 517struct hammer_undo;
0832c9bb
MD
518struct hammer_reserve;
519
8750964d 520RB_HEAD(hammer_vol_rb_tree, hammer_volume);
427e5fc6 521RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
8cd0a023 522RB_HEAD(hammer_nod_rb_tree, hammer_node);
e8599db1 523RB_HEAD(hammer_und_rb_tree, hammer_undo);
0832c9bb 524RB_HEAD(hammer_res_rb_tree, hammer_reserve);
8750964d
MD
525
526RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
527 hammer_vol_rb_compare, int32_t);
427e5fc6 528RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
47197d71 529 hammer_buf_rb_compare, hammer_off_t);
8cd0a023 530RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
47197d71 531 hammer_nod_rb_compare, hammer_off_t);
e8599db1
MD
532RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node,
533 hammer_und_rb_compare, hammer_off_t);
0832c9bb
MD
534RB_PROTOTYPE2(hammer_res_rb_tree, hammer_reserve, rb_node,
535 hammer_res_rb_compare, hammer_off_t);
8750964d 536
66325755
MD
537/*
538 * IO management - embedded at the head of various in-memory structures
10a5d1ba
MD
539 *
540 * VOLUME - hammer_volume containing meta-data
541 * META_BUFFER - hammer_buffer containing meta-data
542 * DATA_BUFFER - hammer_buffer containing pure-data
543 *
544 * Dirty volume headers and dirty meta-data buffers are locked until the
545 * flusher can sequence them out. Dirty pure-data buffers can be written.
546 * Clean buffers can be passively released.
66325755 547 */
10a5d1ba
MD
548typedef enum hammer_io_type {
549 HAMMER_STRUCTURE_VOLUME,
550 HAMMER_STRUCTURE_META_BUFFER,
551 HAMMER_STRUCTURE_UNDO_BUFFER,
eddadaee
MD
552 HAMMER_STRUCTURE_DATA_BUFFER,
553 HAMMER_STRUCTURE_DUMMY
10a5d1ba 554} hammer_io_type_t;
66325755
MD
555
556union hammer_io_structure;
055f5ff8 557struct hammer_io;
66325755
MD
558
559struct worklist {
560 LIST_ENTRY(worklist) node;
561};
562
10a5d1ba
MD
563TAILQ_HEAD(hammer_io_list, hammer_io);
564typedef struct hammer_io_list *hammer_io_list_t;
055f5ff8 565
66325755 566struct hammer_io {
10a5d1ba
MD
567 struct worklist worklist;
568 struct hammer_lock lock;
569 enum hammer_io_type type;
570 struct hammer_mount *hmp;
748efb59 571 struct hammer_volume *volume;
10a5d1ba 572 TAILQ_ENTRY(hammer_io) mod_entry; /* list entry if modified */
eddadaee 573 TAILQ_ENTRY(hammer_io) iorun_entry; /* iorun_list */
10a5d1ba
MD
574 hammer_io_list_t mod_list;
575 struct buf *bp;
4a2796f3
MD
576 int64_t offset; /* zone-2 offset */
577 int bytes; /* buffer cache buffer size */
10a5d1ba
MD
578 int loading; /* loading/unloading interlock */
579 int modify_refs;
580
66325755
MD
581 u_int modified : 1; /* bp's data was modified */
582 u_int released : 1; /* bp released (w/ B_LOCKED set) */
055f5ff8
MD
583 u_int running : 1; /* bp write IO in progress */
584 u_int waiting : 1; /* someone is waiting on us */
b33e2cc0 585 u_int validated : 1; /* ondisk has been validated */
b58c6388 586 u_int waitdep : 1; /* flush waits for dependancies */
51c35492 587 u_int recovered : 1; /* has recovery ref */
9f5097dc 588 u_int waitmod : 1; /* waiting for modify_refs */
cebe9493 589 u_int reclaim : 1; /* reclaim requested */
bcac4bbb 590 u_int gencrc : 1; /* crc needs to be generated */
cdb6e4e6 591 u_int ioerror : 1; /* abort on io-error */
66325755
MD
592};
593
8cd0a023
MD
594typedef struct hammer_io *hammer_io_t;
595
af209b0f
MD
596#define HAMMER_CLUSTER_SIZE (64 * 1024)
597#if HAMMER_CLUSTER_SIZE > MAXBSIZE
598#undef HAMMER_CLUSTER_SIZE
599#define HAMMER_CLUSTER_SIZE MAXBSIZE
600#endif
601#define HAMMER_CLUSTER_BUFS (HAMMER_CLUSTER_SIZE / HAMMER_BUFSIZE)
602
66325755 603/*
8cd0a023 604 * In-memory volume representing on-disk buffer
66325755 605 */
8750964d 606struct hammer_volume {
66325755 607 struct hammer_io io;
8750964d 608 RB_ENTRY(hammer_volume) rb_node;
8750964d
MD
609 struct hammer_volume_ondisk *ondisk;
610 int32_t vol_no;
fbc6e32a 611 int64_t nblocks; /* note: special calculation for statfs */
47197d71 612 int64_t buffer_base; /* base offset of buffer 0 */
2f85fa4d
MD
613 hammer_off_t maxbuf_off; /* Maximum buffer offset (zone-2) */
614 hammer_off_t maxraw_off; /* Maximum raw offset for device */
c60bb2c5 615 char *vol_name;
8750964d 616 struct vnode *devvp;
427e5fc6 617 int vol_flags;
8750964d
MD
618};
619
8cd0a023
MD
620typedef struct hammer_volume *hammer_volume_t;
621
66325755 622/*
8cd0a023
MD
623 * In-memory buffer (other then volume, super-cluster, or cluster),
624 * representing an on-disk buffer.
66325755 625 */
427e5fc6 626struct hammer_buffer {
66325755 627 struct hammer_io io;
427e5fc6 628 RB_ENTRY(hammer_buffer) rb_node;
47197d71 629 void *ondisk;
34d829f7 630 hammer_off_t zoneX_offset;
0832c9bb 631 hammer_off_t zone2_offset;
cebe9493 632 struct hammer_reserve *resv;
8cd0a023 633 struct hammer_node_list clist;
66325755
MD
634};
635
8cd0a023
MD
636typedef struct hammer_buffer *hammer_buffer_t;
637
638/*
639 * In-memory B-Tree node, representing an on-disk B-Tree node.
640 *
641 * This is a hang-on structure which is backed by a hammer_buffer,
642 * indexed by a hammer_cluster, and used for fine-grained locking of
643 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
644 * can contain multiple nodes representing wildly disassociated portions
645 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
646 *
647 * This structure uses a cluster-relative index to reduce the number
648 * of layers required to access it, and also because all on-disk B-Tree
649 * references are cluster-relative offsets.
650 */
651struct hammer_node {
652 struct hammer_lock lock; /* node-by-node lock */
653 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */
654 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */
47197d71 655 hammer_off_t node_offset; /* full offset spec */
40043e7f 656 struct hammer_mount *hmp;
8cd0a023
MD
657 struct hammer_buffer *buffer; /* backing buffer */
658 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */
b3bad96f 659 TAILQ_HEAD(, hammer_cursor) cursor_list; /* deadlock recovery */
bcac4bbb 660 struct hammer_node_cache_list cache_list; /* passive caches */
b3deaf57 661 int flags;
740d8317 662 int loading; /* load interlock */
8cd0a023
MD
663};
664
b3deaf57
MD
665#define HAMMER_NODE_DELETED 0x0001
666#define HAMMER_NODE_FLUSH 0x0002
bcac4bbb
MD
667#define HAMMER_NODE_CRCGOOD 0x0004
668#define HAMMER_NODE_NEEDSCRC 0x0008
c82af904 669#define HAMMER_NODE_NEEDSMIRROR 0x0010
4c286c36 670#define HAMMER_NODE_CRCBAD 0x0020
fa2b9a03 671#define HAMMER_NODE_NONLINEAR 0x0040 /* linear heuristic */
4c286c36
MD
672
673#define HAMMER_NODE_CRCANY (HAMMER_NODE_CRCGOOD | HAMMER_NODE_CRCBAD)
b3deaf57 674
8cd0a023
MD
675typedef struct hammer_node *hammer_node_t;
676
677/*
1775b6a0
MD
678 * List of locked nodes. This structure is used to lock potentially large
679 * numbers of nodes as an aid for complex B-Tree operations.
b33e2cc0 680 */
1775b6a0
MD
681struct hammer_node_lock;
682TAILQ_HEAD(hammer_node_lock_list, hammer_node_lock);
683
684struct hammer_node_lock {
685 TAILQ_ENTRY(hammer_node_lock) entry;
686 struct hammer_node_lock_list list;
687 struct hammer_node_lock *parent;
b33e2cc0 688 hammer_node_t node;
1775b6a0
MD
689 hammer_node_ondisk_t copy; /* copy of on-disk data */
690 int index; /* index of this node in parent */
691 int count; /* count children */
692 int flags;
b33e2cc0
MD
693};
694
1775b6a0 695typedef struct hammer_node_lock *hammer_node_lock_t;
b33e2cc0 696
1775b6a0 697#define HAMMER_NODE_LOCK_UPDATED 0x0001
b33e2cc0
MD
698
699/*
8cd0a023
MD
700 * Common I/O management structure - embedded in in-memory structures
701 * which are backed by filesystem buffers.
702 */
66325755
MD
703union hammer_io_structure {
704 struct hammer_io io;
705 struct hammer_volume volume;
66325755 706 struct hammer_buffer buffer;
8750964d
MD
707};
708
055f5ff8
MD
709typedef union hammer_io_structure *hammer_io_structure_t;
710
bf686dbe 711/*
cebe9493
MD
712 * The reserve structure prevents the blockmap from allocating
713 * out of a reserved bigblock. Such reservations are used by
714 * the direct-write mechanism.
715 *
716 * The structure is also used to hold off on reallocations of
717 * big blocks from the freemap until flush dependancies have
718 * been dealt with.
719 */
0832c9bb
MD
720struct hammer_reserve {
721 RB_ENTRY(hammer_reserve) rb_node;
cebe9493
MD
722 TAILQ_ENTRY(hammer_reserve) delay_entry;
723 int flush_group;
cb51be26 724 int flags;
0832c9bb 725 int refs;
cb51be26 726 int zone;
df301614 727 int append_off;
cebe9493 728 hammer_off_t zone_offset;
0832c9bb
MD
729};
730
731typedef struct hammer_reserve *hammer_reserve_t;
732
cb51be26 733#define HAMMER_RESF_ONDELAY 0x0001
5e435c92 734#define HAMMER_RESF_LAYER2FREE 0x0002
cb51be26 735
8cd0a023
MD
736#include "hammer_cursor.h"
737
8750964d 738/*
cebe9493
MD
739 * The undo structure tracks recent undos to avoid laying down duplicate
740 * undos within a flush group, saving us a significant amount of overhead.
741 *
742 * This is strictly a heuristic.
e8599db1 743 */
7a61b85d
MD
744#define HAMMER_MAX_UNDOS 1024
745#define HAMMER_MAX_FLUSHERS 4
e8599db1
MD
746
747struct hammer_undo {
748 RB_ENTRY(hammer_undo) rb_node;
749 TAILQ_ENTRY(hammer_undo) lru_entry;
750 hammer_off_t offset;
751 int bytes;
752};
753
754typedef struct hammer_undo *hammer_undo_t;
755
af209b0f 756struct hammer_flusher_info;
7a61b85d 757TAILQ_HEAD(hammer_flusher_info_list, hammer_flusher_info);
da2da375
MD
758
759struct hammer_flusher {
760 int signal; /* flusher thread sequencer */
761 int act; /* currently active flush group */
762 int done; /* set to act when complete */
763 int next; /* next flush group */
764 int group_lock; /* lock sequencing of the next flush */
765 int exiting; /* request master exit */
da2da375
MD
766 thread_t td; /* master flusher thread */
767 hammer_tid_t tid; /* last flushed transaction id */
768 int finalize_want; /* serialize finalization */
769 struct hammer_lock finalize_lock; /* serialize finalization */
770 struct hammer_transaction trans; /* shared transaction */
7a61b85d
MD
771 struct hammer_flusher_info_list run_list;
772 struct hammer_flusher_info_list ready_list;
da2da375
MD
773};
774
9192654c
MD
775#define HAMMER_FLUSH_UNDOS_RELAXED 0
776#define HAMMER_FLUSH_UNDOS_FORCED 1
777#define HAMMER_FLUSH_UNDOS_AUTO 2
da2da375 778/*
8750964d
MD
779 * Internal hammer mount data structure
780 */
781struct hammer_mount {
782 struct mount *mp;
27ea2398 783 /*struct vnode *rootvp;*/
8750964d 784 struct hammer_ino_rb_tree rb_inos_root;
73896937 785 struct hammer_redo_rb_tree rb_redo_root;
8750964d 786 struct hammer_vol_rb_tree rb_vols_root;
40043e7f 787 struct hammer_nod_rb_tree rb_nods_root;
e8599db1 788 struct hammer_und_rb_tree rb_undo_root;
0832c9bb
MD
789 struct hammer_res_rb_tree rb_resv_root;
790 struct hammer_buf_rb_tree rb_bufs_root;
5fa5c92f 791 struct hammer_pfs_rb_tree rb_pfsm_root;
8750964d 792 struct hammer_volume *rootvol;
47197d71
MD
793 struct hammer_base_elm root_btree_beg;
794 struct hammer_base_elm root_btree_end;
bac808fe
MD
795
796 struct malloc_type *m_misc;
797 struct malloc_type *m_inodes;
798
cdb6e4e6 799 int flags; /* HAMMER_MOUNT_xxx flags */
195c19a1
MD
800 int hflags;
801 int ronly;
802 int nvolumes;
d26d0ae9 803 int volume_iterator;
732a1697 804 int master_id; /* -1 or 0-15 - clustering and mirroring */
44a83111 805 int version; /* hammer filesystem version to use */
e63644f0 806 int rsv_inodes; /* reserved space due to dirty inodes */
a7e9bef1 807 int64_t rsv_databytes; /* reserved space due to record data */
e63644f0 808 int rsv_recs; /* reserved space due to dirty records */
a7e9bef1 809 int rsv_fromdelay; /* bigblocks reserved due to flush delay */
7a61b85d 810 int undo_rec_limit; /* based on size of undo area */
4a2796f3
MD
811 int last_newrecords;
812 int count_newrecords;
da2da375 813
865c9609
MN
814 int volume_to_remove; /* volume that is currently being removed */
815
9f5097dc
MD
816 int inode_reclaims; /* inodes pending reclaim by flusher */
817 int count_inodes; /* total number of inodes */
af209b0f 818 int count_iqueued; /* inodes queued to flusher */
da2da375
MD
819
820 struct hammer_flusher flusher;
821
855942b6 822 u_int check_interrupt;
3e583440 823 u_int check_yield;
8750964d 824 uuid_t fsid;
10a5d1ba
MD
825 struct hammer_io_list volu_list; /* dirty undo buffers */
826 struct hammer_io_list undo_list; /* dirty undo buffers */
827 struct hammer_io_list data_list; /* dirty data buffers */
0832c9bb 828 struct hammer_io_list alt_data_list; /* dirty data buffers */
10a5d1ba
MD
829 struct hammer_io_list meta_list; /* dirty meta bufs */
830 struct hammer_io_list lose_list; /* loose buffers */
f5a07a7a
MD
831 int locked_dirty_space; /* meta/volu count */
832 int io_running_space;
0729c8c8 833 int objid_cache_count;
cdb6e4e6
MD
834 int error; /* critical I/O error */
835 struct krate krate; /* rate limited kprintf */
ddfdf542 836 hammer_tid_t asof; /* snapshot mount */
4889cbd4
MD
837 hammer_tid_t next_tid;
838 hammer_tid_t flush_tid1; /* flusher tid sequencing */
839 hammer_tid_t flush_tid2; /* flusher tid sequencing */
e63644f0 840 int64_t copy_stat_freebigblocks; /* number of free bigblocks */
02428fb6 841 u_int32_t undo_seqno; /* UNDO/REDO FIFO seqno */
e63644f0 842
513ca7d7 843 struct netexport export;
9480ff55 844 struct hammer_lock sync_lock;
c9b9e29d 845 struct hammer_lock free_lock;
d99d6bf5
MD
846 struct hammer_lock undo_lock;
847 struct hammer_lock blkmap_lock;
83f2a3aa 848 struct hammer_lock snapshot_lock;
52e547e3 849 struct hammer_lock volume_lock;
0729c8c8 850 struct hammer_blockmap blockmap[HAMMER_MAX_ZONES];
e8599db1
MD
851 struct hammer_undo undos[HAMMER_MAX_UNDOS];
852 int undo_alloc;
853 TAILQ_HEAD(, hammer_undo) undo_lru_list;
cebe9493 854 TAILQ_HEAD(, hammer_reserve) delay_list;
7a61b85d 855 struct hammer_flush_group_list flush_group_list;
7b6ccb11 856 hammer_flush_group_t next_flush_group;
0729c8c8 857 TAILQ_HEAD(, hammer_objid_cache) objid_cache_list;
7bc5b8c2 858 TAILQ_HEAD(, hammer_reclaim) reclaim_list;
eddadaee 859 TAILQ_HEAD(, hammer_io) iorun_list;
e98f1b96
MD
860
861 struct hammer_inostats inostats[HAMMER_INOSTATS_HSIZE];
8750964d
MD
862};
863
8cd0a023 864typedef struct hammer_mount *hammer_mount_t;
8750964d 865
cdb6e4e6 866#define HAMMER_MOUNT_CRITICAL_ERROR 0x0001
82010f9f 867#define HAMMER_MOUNT_FLUSH_RECOVERY 0x0002
47f363f1 868#define HAMMER_MOUNT_REDO_SYNC 0x0004
9f5097dc 869
fbc6e32a
MD
870struct hammer_sync_info {
871 int error;
872 int waitfor;
873};
874
f6468e9e
MD
875/*
876 * Minium buffer cache bufs required to rebalance the B-Tree.
877 * This is because we must hold the children and the children's children
878 * locked. Even this might not be enough if things are horribly out
879 * of balance.
880 */
881#define HAMMER_REBALANCE_MIN_BUFS \
882 (HAMMER_BTREE_LEAF_ELMS * HAMMER_BTREE_LEAF_ELMS)
883
884
8750964d
MD
885#endif
886
a7e9bef1
MD
887/*
888 * checkspace slop (8MB chunks), higher numbers are more conservative.
889 */
93291532
MD
890#define HAMMER_CHKSPC_REBLOCK 25
891#define HAMMER_CHKSPC_MIRROR 20
892#define HAMMER_CHKSPC_WRITE 20
893#define HAMMER_CHKSPC_CREATE 20
894#define HAMMER_CHKSPC_REMOVE 10
7b6ccb11 895#define HAMMER_CHKSPC_EMERGENCY 0
a7e9bef1 896
8750964d
MD
897#if defined(_KERNEL)
898
899extern struct vop_ops hammer_vnode_vops;
7a04d74f
MD
900extern struct vop_ops hammer_spec_vops;
901extern struct vop_ops hammer_fifo_vops;
66325755 902extern struct bio_ops hammer_bioops;
427e5fc6 903
2f85fa4d 904extern int hammer_debug_io;
d5ef456e 905extern int hammer_debug_general;
77062c8a 906extern int hammer_debug_debug;
e8599db1 907extern int hammer_debug_inode;
7d683b0f 908extern int hammer_debug_locks;
b3deaf57 909extern int hammer_debug_btree;
d113fda1 910extern int hammer_debug_tid;
b33e2cc0 911extern int hammer_debug_recover;
46fe7ae1 912extern int hammer_debug_recover_faults;
fc73edd8 913extern int hammer_debug_critical;
1b0ab2c3 914extern int hammer_cluster_enable;
7a61b85d 915extern int hammer_count_fsyncs;
b3deaf57 916extern int hammer_count_inodes;
af209b0f 917extern int hammer_count_iqueued;
9f5097dc 918extern int hammer_count_reclaiming;
b3deaf57
MD
919extern int hammer_count_records;
920extern int hammer_count_record_datas;
921extern int hammer_count_volumes;
b3deaf57
MD
922extern int hammer_count_buffers;
923extern int hammer_count_nodes;
a7e9bef1 924extern int64_t hammer_count_extra_space_used;
cb51be26
MD
925extern int64_t hammer_stats_btree_lookups;
926extern int64_t hammer_stats_btree_searches;
927extern int64_t hammer_stats_btree_inserts;
928extern int64_t hammer_stats_btree_deletes;
929extern int64_t hammer_stats_btree_elements;
930extern int64_t hammer_stats_btree_splits;
931extern int64_t hammer_stats_btree_iterations;
39d8fd63 932extern int64_t hammer_stats_btree_root_iterations;
cb51be26 933extern int64_t hammer_stats_record_iterations;
ce0138a6
MD
934extern int64_t hammer_stats_file_read;
935extern int64_t hammer_stats_file_write;
936extern int64_t hammer_stats_file_iopsr;
937extern int64_t hammer_stats_file_iopsw;
938extern int64_t hammer_stats_disk_read;
939extern int64_t hammer_stats_disk_write;
940extern int64_t hammer_stats_inode_flushes;
941extern int64_t hammer_stats_commits;
89e744ce 942extern int64_t hammer_stats_undo;
6048b411 943extern int64_t hammer_stats_redo;
f5a07a7a 944extern int hammer_count_dirtybufspace;
a99b9ea2 945extern int hammer_count_refedbufs;
0832c9bb 946extern int hammer_count_reservations;
a99b9ea2
MD
947extern int hammer_count_io_running_read;
948extern int hammer_count_io_running_write;
949extern int hammer_count_io_locked;
f5a07a7a 950extern int hammer_limit_dirtybufspace;
47637bff 951extern int hammer_limit_recs;
de996e86 952extern int hammer_limit_inode_recs;
ff003b11 953extern int hammer_limit_reclaim;
9192654c 954extern int hammer_limit_redo;
1f07f686 955extern int hammer_bio_count;
cb51be26 956extern int hammer_verify_zone;
1b0ab2c3 957extern int hammer_verify_data;
cb51be26 958extern int hammer_write_mode;
3e583440 959extern int hammer_yield_check;
6f3d87c0 960extern int hammer_fsync_mode;
21fde338 961extern int hammer_autoflush;
7d683b0f 962extern int64_t hammer_contention_count;
b3deaf57 963
cdb6e4e6
MD
964void hammer_critical_error(hammer_mount_t hmp, hammer_inode_t ip,
965 int error, const char *msg);
8750964d
MD
966int hammer_vop_inactive(struct vop_inactive_args *);
967int hammer_vop_reclaim(struct vop_reclaim_args *);
e8599db1 968int hammer_get_vnode(struct hammer_inode *ip, struct vnode **vpp);
36f82b23 969struct hammer_inode *hammer_get_inode(hammer_transaction_t trans,
adf01747 970 hammer_inode_t dip, int64_t obj_id,
ddfdf542
MD
971 hammer_tid_t asof, u_int32_t localization,
972 int flags, int *errorp);
4c286c36
MD
973struct hammer_inode *hammer_get_dummy_inode(hammer_transaction_t trans,
974 hammer_inode_t dip, int64_t obj_id,
975 hammer_tid_t asof, u_int32_t localization,
976 int flags, int *errorp);
39d8fd63
MD
977struct hammer_inode *hammer_find_inode(hammer_transaction_t trans,
978 int64_t obj_id, hammer_tid_t asof,
979 u_int32_t localization);
43c665ae
MD
980void hammer_scan_inode_snapshots(hammer_mount_t hmp,
981 hammer_inode_info_t iinfo,
982 int (*callback)(hammer_inode_t ip, void *data),
983 void *data);
66325755
MD
984void hammer_put_inode(struct hammer_inode *ip);
985void hammer_put_inode_ref(struct hammer_inode *ip);
e98f1b96 986void hammer_inode_waitreclaims(hammer_transaction_t trans);
66325755 987
8cd0a023 988int hammer_unload_volume(hammer_volume_t volume, void *data __unused);
51c35492
MD
989int hammer_adjust_volume_mode(hammer_volume_t volume, void *data __unused);
990
07be83b8 991int hammer_unload_buffer(hammer_buffer_t buffer, void *data);
7c19b529
MN
992int hammer_install_volume(hammer_mount_t hmp, const char *volname,
993 struct vnode *devvp);
1b0ab2c3 994int hammer_mountcheck_volumes(hammer_mount_t hmp);
8cd0a023 995
e469566b 996int hammer_mem_add(hammer_record_t record);
45a014dc 997int hammer_ip_lookup(hammer_cursor_t cursor);
4e17f465 998int hammer_ip_first(hammer_cursor_t cursor);
a89aec1b 999int hammer_ip_next(hammer_cursor_t cursor);
8cd0a023 1000int hammer_ip_resolve_data(hammer_cursor_t cursor);
e63644f0
MD
1001int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
1002 hammer_tid_t tid);
83f2a3aa
MD
1003int hammer_create_at_cursor(hammer_cursor_t cursor,
1004 hammer_btree_leaf_elm_t leaf, void *udata, int mode);
602c6cb8 1005int hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
842e7a70
MD
1006 hammer_tid_t delete_tid, u_int32_t delete_ts,
1007 int track, int64_t *stat_bytes);
b3deaf57 1008int hammer_ip_check_directory_empty(hammer_transaction_t trans,
98f7132d 1009 hammer_inode_t ip);
fbc6e32a 1010int hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
f36a9737
MD
1011int hammer_queue_inodes_flusher(hammer_mount_t hmp, int waitfor);
1012
8cd0a023 1013hammer_record_t
11ad5ade 1014 hammer_alloc_mem_record(hammer_inode_t ip, int data_len);
d36ec43b 1015void hammer_flush_record_done(hammer_record_t record, int error);
af209b0f 1016void hammer_wait_mem_record_ident(hammer_record_t record, const char *ident);
b3deaf57 1017void hammer_rel_mem_record(hammer_record_t record);
b84de5af 1018
6a37e7e4 1019int hammer_cursor_up(hammer_cursor_t cursor);
f36a9737 1020int hammer_cursor_up_locked(hammer_cursor_t cursor);
8cd0a023 1021int hammer_cursor_down(hammer_cursor_t cursor);
6a37e7e4 1022int hammer_cursor_upgrade(hammer_cursor_t cursor);
7bc5b8c2 1023int hammer_cursor_upgrade_node(hammer_cursor_t cursor);
6a37e7e4 1024void hammer_cursor_downgrade(hammer_cursor_t cursor);
32c90105
MD
1025int hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
1026 int index);
af209b0f 1027void hammer_lock_ex_ident(struct hammer_lock *lock, const char *ident);
8cd0a023
MD
1028int hammer_lock_ex_try(struct hammer_lock *lock);
1029void hammer_lock_sh(struct hammer_lock *lock);
47637bff 1030int hammer_lock_sh_try(struct hammer_lock *lock);
6a37e7e4
MD
1031int hammer_lock_upgrade(struct hammer_lock *lock);
1032void hammer_lock_downgrade(struct hammer_lock *lock);
b3bad96f 1033int hammer_lock_status(struct hammer_lock *lock);
427e5fc6 1034void hammer_unlock(struct hammer_lock *lock);
66325755
MD
1035void hammer_ref(struct hammer_lock *lock);
1036void hammer_unref(struct hammer_lock *lock);
8cd0a023 1037
2f85fa4d
MD
1038void hammer_sync_lock_ex(hammer_transaction_t trans);
1039void hammer_sync_lock_sh(hammer_transaction_t trans);
47637bff 1040int hammer_sync_lock_sh_try(hammer_transaction_t trans);
2f85fa4d
MD
1041void hammer_sync_unlock(hammer_transaction_t trans);
1042
66325755 1043u_int32_t hammer_to_unix_xid(uuid_t *uuid);
8cd0a023 1044void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
ddfdf542
MD
1045void hammer_time_to_timespec(u_int64_t xtime, struct timespec *ts);
1046u_int64_t hammer_timespec_to_time(struct timespec *ts);
bc6c1f13
MD
1047int hammer_str_to_tid(const char *str, int *ispfsp,
1048 hammer_tid_t *tidp, u_int32_t *localizationp);
1049int hammer_is_atatext(const char *name, int len);
5a64efa1
MD
1050hammer_tid_t hammer_alloc_objid(hammer_mount_t hmp, hammer_inode_t dip,
1051 int64_t namekey);
0729c8c8
MD
1052void hammer_clear_objid(hammer_inode_t dip);
1053void hammer_destroy_objid_cache(hammer_mount_t hmp);
8cd0a023 1054
e8599db1 1055int hammer_enter_undo_history(hammer_mount_t hmp, hammer_off_t offset,
b3bad96f 1056 int bytes);
e8599db1 1057void hammer_clear_undo_history(hammer_mount_t hmp);
66325755 1058enum vtype hammer_get_vnode_type(u_int8_t obj_type);
6b4f890b 1059int hammer_get_dtype(u_int8_t obj_type);
66325755 1060u_int8_t hammer_get_obj_type(enum vtype vtype);
5e435c92
MD
1061int64_t hammer_directory_namekey(hammer_inode_t dip, const void *name, int len,
1062 u_int32_t *max_iterationsp);
e63644f0 1063int hammer_nohistory(hammer_inode_t ip);
427e5fc6 1064
36f82b23 1065int hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor,
b3bad96f 1066 hammer_node_cache_t cache, hammer_inode_t ip);
4e17f465 1067void hammer_normalize_cursor(hammer_cursor_t cursor);
8cd0a023 1068void hammer_done_cursor(hammer_cursor_t cursor);
b3bad96f 1069int hammer_recover_cursor(hammer_cursor_t cursor);
982be4bf
MD
1070void hammer_unlock_cursor(hammer_cursor_t cursor);
1071int hammer_lock_cursor(hammer_cursor_t cursor);
3f43fb33
MD
1072hammer_cursor_t hammer_push_cursor(hammer_cursor_t ocursor);
1073void hammer_pop_cursor(hammer_cursor_t ocursor, hammer_cursor_t ncursor);
b3bad96f
MD
1074
1075void hammer_cursor_replaced_node(hammer_node_t onode, hammer_node_t nnode);
1076void hammer_cursor_removed_node(hammer_node_t onode, hammer_node_t parent,
1077 int index);
1078void hammer_cursor_split_node(hammer_node_t onode, hammer_node_t nnode,
1079 int index);
bbb01e14
MD
1080void hammer_cursor_moved_element(hammer_node_t oparent, int pindex,
1081 hammer_node_t onode, int oindex,
1082 hammer_node_t nnode, int nindex);
1775b6a0
MD
1083void hammer_cursor_parent_changed(hammer_node_t node, hammer_node_t oparent,
1084 hammer_node_t nparent, int nindex);
b3bad96f
MD
1085void hammer_cursor_inserted_element(hammer_node_t node, int index);
1086void hammer_cursor_deleted_element(hammer_node_t node, int index);
8cd0a023
MD
1087
1088int hammer_btree_lookup(hammer_cursor_t cursor);
d26d0ae9 1089int hammer_btree_first(hammer_cursor_t cursor);
32c90105 1090int hammer_btree_last(hammer_cursor_t cursor);
8cd0a023
MD
1091int hammer_btree_extract(hammer_cursor_t cursor, int flags);
1092int hammer_btree_iterate(hammer_cursor_t cursor);
32c90105 1093int hammer_btree_iterate_reverse(hammer_cursor_t cursor);
11ad5ade 1094int hammer_btree_insert(hammer_cursor_t cursor,
602c6cb8 1095 hammer_btree_leaf_elm_t elm, int *doprop);
8cd0a023 1096int hammer_btree_delete(hammer_cursor_t cursor);
4c038e17
MD
1097void hammer_btree_do_propagation(hammer_cursor_t cursor,
1098 hammer_pseudofs_inmem_t pfsm,
602c6cb8 1099 hammer_btree_leaf_elm_t leaf);
8cd0a023 1100int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
d26d0ae9 1101int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
32c90105
MD
1102int hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
1103int hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
1104
2f85fa4d
MD
1105int btree_set_parent(hammer_transaction_t trans, hammer_node_t node,
1106 hammer_btree_elm_t elm);
1775b6a0
MD
1107void hammer_node_lock_init(hammer_node_lock_t parent, hammer_node_t node);
1108int hammer_btree_lock_children(hammer_cursor_t cursor, int depth,
1109 hammer_node_lock_t parent);
1110void hammer_btree_lock_copy(hammer_cursor_t cursor,
1111 hammer_node_lock_t parent);
7ddc70d1 1112int hammer_btree_sync_copy(hammer_cursor_t cursor,
1775b6a0 1113 hammer_node_lock_t parent);
bac808fe 1114void hammer_btree_unlock_children(hammer_cursor_t cursor,
1775b6a0 1115 hammer_node_lock_t parent);
bcac4bbb 1116int hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node);
82010f9f
MD
1117hammer_node_t hammer_btree_get_parent(hammer_transaction_t trans,
1118 hammer_node_t node, int *parent_indexp,
c82af904 1119 int *errorp, int try_exclusive);
b33e2cc0 1120
c0ade690
MD
1121void hammer_print_btree_node(hammer_node_ondisk_t ondisk);
1122void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
8750964d 1123
47197d71
MD
1124void *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
1125 int *errorp, struct hammer_buffer **bufferp);
1126void *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
1127 int *errorp, struct hammer_buffer **bufferp);
4a2796f3
MD
1128void *hammer_bread_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
1129 int *errorp, struct hammer_buffer **bufferp);
1130void *hammer_bnew_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
1131 int *errorp, struct hammer_buffer **bufferp);
8cd0a023
MD
1132
1133hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
427e5fc6 1134
8cd0a023 1135hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
427e5fc6 1136 int32_t vol_no, int *errorp);
4a2796f3
MD
1137hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp, hammer_off_t buf_offset,
1138 int bytes, int isnew, int *errorp);
1b0ab2c3
MD
1139void hammer_sync_buffers(hammer_mount_t hmp,
1140 hammer_off_t base_offset, int bytes);
362ec2dc 1141int hammer_del_buffers(hammer_mount_t hmp,
1b0ab2c3 1142 hammer_off_t base_offset,
362ec2dc
MD
1143 hammer_off_t zone2_offset, int bytes,
1144 int report_conflicts);
8cd0a023 1145
fbc6e32a 1146int hammer_ref_volume(hammer_volume_t volume);
8cd0a023
MD
1147int hammer_ref_buffer(hammer_buffer_t buffer);
1148void hammer_flush_buffer_nodes(hammer_buffer_t buffer);
1149
8cd0a023 1150void hammer_rel_volume(hammer_volume_t volume, int flush);
8cd0a023
MD
1151void hammer_rel_buffer(hammer_buffer_t buffer, int flush);
1152
513ca7d7
MD
1153int hammer_vfs_export(struct mount *mp, int op,
1154 const struct export_args *export);
82010f9f
MD
1155hammer_node_t hammer_get_node(hammer_transaction_t trans,
1156 hammer_off_t node_offset, int isnew, int *errorp);
740d8317 1157void hammer_ref_node(hammer_node_t node);
4c286c36 1158hammer_node_t hammer_ref_node_safe(hammer_transaction_t trans,
bcac4bbb 1159 hammer_node_cache_t cache, int *errorp);
8cd0a023 1160void hammer_rel_node(hammer_node_t node);
36f82b23
MD
1161void hammer_delete_node(hammer_transaction_t trans,
1162 hammer_node_t node);
bcac4bbb
MD
1163void hammer_cache_node(hammer_node_cache_t cache,
1164 hammer_node_t node);
1165void hammer_uncache_node(hammer_node_cache_t cache);
8cd0a023
MD
1166void hammer_flush_node(hammer_node_t node);
1167
427e5fc6
MD
1168void hammer_dup_buffer(struct hammer_buffer **bufferp,
1169 struct hammer_buffer *buffer);
df2ccbac
MD
1170hammer_node_t hammer_alloc_btree(hammer_transaction_t trans,
1171 hammer_off_t hint, int *errorp);
36f82b23 1172void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len,
bf3b416b 1173 u_int16_t rec_type, hammer_off_t *data_offsetp,
df2ccbac
MD
1174 struct hammer_buffer **data_bufferp,
1175 hammer_off_t hint, int *errorp);
bf686dbe 1176
02428fb6 1177int hammer_generate_undo(hammer_transaction_t trans,
059819e3 1178 hammer_off_t zone1_offset, void *base, int len);
6048b411 1179int hammer_generate_redo(hammer_transaction_t trans, hammer_inode_t ip,
47f363f1
MD
1180 hammer_off_t file_offset, u_int32_t flags,
1181 void *base, int len);
1182void hammer_generate_redo_sync(hammer_transaction_t trans);
73896937
MD
1183void hammer_redo_fifo_start_flush(hammer_inode_t ip);
1184void hammer_redo_fifo_end_flush(hammer_inode_t ip);
1185
47f363f1 1186void hammer_format_undo(void *base, u_int32_t seqno);
02428fb6 1187int hammer_upgrade_undo_4(hammer_transaction_t trans);
427e5fc6 1188
66325755 1189void hammer_put_volume(struct hammer_volume *volume, int flush);
66325755 1190void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
427e5fc6 1191
36f82b23
MD
1192hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans,
1193 hammer_off_t owner, int *errorp);
1194void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset,
c3be93f2 1195 hammer_off_t owner, int *errorp);
0f65be10 1196int _hammer_checkspace(hammer_mount_t hmp, int slop, int64_t *resp);
36f82b23 1197hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone,
df2ccbac 1198 int bytes, hammer_off_t hint, int *errorp);
0832c9bb
MD
1199hammer_reserve_t hammer_blockmap_reserve(hammer_mount_t hmp, int zone,
1200 int bytes, hammer_off_t *zone_offp, int *errorp);
1201void hammer_blockmap_reserve_complete(hammer_mount_t hmp,
1202 hammer_reserve_t resv);
cb51be26 1203void hammer_reserve_clrdelay(hammer_mount_t hmp, hammer_reserve_t resv);
36f82b23
MD
1204void hammer_blockmap_free(hammer_transaction_t trans,
1205 hammer_off_t bmap_off, int bytes);
cdb6e4e6 1206int hammer_blockmap_finalize(hammer_transaction_t trans,
5e435c92 1207 hammer_reserve_t resv,
4a2796f3 1208 hammer_off_t bmap_off, int bytes);
bf686dbe
MD
1209int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
1210 int *curp, int *errorp);
40043e7f
MD
1211hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
1212 int *errorp);
bf686dbe
MD
1213hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
1214 int *errorp);
06ad81ff
MD
1215int64_t hammer_undo_used(hammer_transaction_t trans);
1216int64_t hammer_undo_space(hammer_transaction_t trans);
1f07f686 1217int64_t hammer_undo_max(hammer_mount_t hmp);
710733a6 1218int hammer_undo_reclaim(hammer_io_t io);
1f07f686 1219
8cd0a023
MD
1220void hammer_start_transaction(struct hammer_transaction *trans,
1221 struct hammer_mount *hmp);
36f82b23
MD
1222void hammer_simple_transaction(struct hammer_transaction *trans,
1223 struct hammer_mount *hmp);
b84de5af
MD
1224void hammer_start_transaction_fls(struct hammer_transaction *trans,
1225 struct hammer_mount *hmp);
1226void hammer_done_transaction(struct hammer_transaction *trans);
83f2a3aa 1227hammer_tid_t hammer_alloc_tid(hammer_mount_t hmp, int count);
66325755 1228
e98f1b96 1229void hammer_modify_inode(hammer_transaction_t trans, hammer_inode_t ip, int flags);
f90dde4c 1230void hammer_flush_inode(hammer_inode_t ip, int flags);
cdb6e4e6 1231void hammer_flush_inode_done(hammer_inode_t ip, int error);
b84de5af
MD
1232void hammer_wait_inode(hammer_inode_t ip);
1233
8cd0a023
MD
1234int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
1235 struct ucred *cred, struct hammer_inode *dip,
5a64efa1 1236 const char *name, int namelen,
ea434b6f
MD
1237 hammer_pseudofs_inmem_t pfsm,
1238 struct hammer_inode **ipp);
a89aec1b 1239void hammer_rel_inode(hammer_inode_t ip, int flush);
51c35492 1240int hammer_reload_inode(hammer_inode_t ip, void *arg __unused);
af209b0f 1241int hammer_ino_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2);
73896937 1242int hammer_redo_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2);
cdb6e4e6 1243int hammer_destroy_inode_callback(hammer_inode_t ip, void *data __unused);
51c35492 1244
02325004 1245int hammer_sync_inode(hammer_transaction_t trans, hammer_inode_t ip);
7b6ccb11 1246void hammer_test_inode(hammer_inode_t dip);
e8599db1 1247void hammer_inode_unloadable_check(hammer_inode_t ip, int getvp);
8cd0a023 1248
a89aec1b 1249int hammer_ip_add_directory(struct hammer_transaction *trans,
5a930e66 1250 hammer_inode_t dip, const char *name, int bytes,
8cd0a023 1251 hammer_inode_t nip);
a89aec1b 1252int hammer_ip_del_directory(struct hammer_transaction *trans,
8cd0a023
MD
1253 hammer_cursor_t cursor, hammer_inode_t dip,
1254 hammer_inode_t ip);
6362a262 1255void hammer_ip_replace_bulk(hammer_mount_t hmp, hammer_record_t record);
47637bff 1256hammer_record_t hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset,
0832c9bb 1257 void *data, int bytes, int *errorp);
47637bff 1258int hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size);
7a04d74f
MD
1259int hammer_ip_add_record(struct hammer_transaction *trans,
1260 hammer_record_t record);
4e17f465 1261int hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
47637bff 1262 int64_t ran_beg, int64_t ran_end, int truncating);
a9d52b76 1263int hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip,
4e17f465
MD
1264 int *countp);
1265int hammer_ip_sync_data(hammer_cursor_t cursor, hammer_inode_t ip,
1266 int64_t offset, void *data, int bytes);
36f82b23 1267int hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec);
4e17f465 1268int hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t rec);
ea434b6f
MD
1269hammer_pseudofs_inmem_t hammer_load_pseudofs(hammer_transaction_t trans,
1270 u_int32_t localization, int *errorp);
1271int hammer_mkroot_pseudofs(hammer_transaction_t trans, struct ucred *cred,
1272 hammer_pseudofs_inmem_t pfsm);
1273int hammer_save_pseudofs(hammer_transaction_t trans,
1274 hammer_pseudofs_inmem_t pfsm);
842e7a70 1275int hammer_unload_pseudofs(hammer_transaction_t trans, u_int32_t localization);
5fa5c92f 1276void hammer_rel_pseudofs(hammer_mount_t hmp, hammer_pseudofs_inmem_t pfsm);
7dc57964
MD
1277int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
1278 struct ucred *cred);
1279
748efb59 1280void hammer_io_init(hammer_io_t io, hammer_volume_t volume,
10a5d1ba 1281 enum hammer_io_type type);
2f85fa4d
MD
1282int hammer_io_read(struct vnode *devvp, struct hammer_io *io,
1283 hammer_off_t limit);
0e8bd897 1284void hammer_io_advance(struct hammer_io *io);
66325755 1285int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
362ec2dc 1286int hammer_io_inval(hammer_volume_t volume, hammer_off_t zone2_offset);
ecca949a 1287struct buf *hammer_io_release(struct hammer_io *io, int flush);
710733a6 1288void hammer_io_flush(struct hammer_io *io, int reclaim);
1b0ab2c3 1289void hammer_io_wait(struct hammer_io *io);
055f5ff8 1290void hammer_io_waitdep(struct hammer_io *io);
eddadaee 1291void hammer_io_wait_all(hammer_mount_t hmp, const char *ident, int doflush);
1b0ab2c3
MD
1292int hammer_io_direct_read(hammer_mount_t hmp, struct bio *bio,
1293 hammer_btree_leaf_elm_t leaf);
6362a262
MD
1294int hammer_io_direct_write(hammer_mount_t hmp, struct bio *bio,
1295 hammer_record_t record);
1b0ab2c3 1296void hammer_io_direct_wait(hammer_record_t record);
43c665ae 1297void hammer_io_direct_uncache(hammer_mount_t hmp, hammer_btree_leaf_elm_t leaf);
9f5097dc
MD
1298void hammer_io_write_interlock(hammer_io_t io);
1299void hammer_io_done_interlock(hammer_io_t io);
4a2796f3 1300void hammer_io_clear_modify(struct hammer_io *io, int inval);
cebe9493 1301void hammer_io_clear_modlist(struct hammer_io *io);
748efb59 1302void hammer_io_flush_sync(hammer_mount_t hmp);
2faf0737 1303void hammer_io_clear_error(struct hammer_io *io);
b8a41159 1304void hammer_io_notmeta(hammer_buffer_t buffer);
748efb59 1305
36f82b23
MD
1306void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume,
1307 void *base, int len);
1308void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer,
1309 void *base, int len);
10a5d1ba
MD
1310void hammer_modify_volume_done(hammer_volume_t volume);
1311void hammer_modify_buffer_done(hammer_buffer_t buffer);
0b075555 1312
36f82b23
MD
1313int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
1314 struct hammer_ioc_reblock *reblock);
1775b6a0
MD
1315int hammer_ioc_rebalance(hammer_transaction_t trans, hammer_inode_t ip,
1316 struct hammer_ioc_rebalance *rebal);
11ad5ade
MD
1317int hammer_ioc_prune(hammer_transaction_t trans, hammer_inode_t ip,
1318 struct hammer_ioc_prune *prune);
c82af904
MD
1319int hammer_ioc_mirror_read(hammer_transaction_t trans, hammer_inode_t ip,
1320 struct hammer_ioc_mirror_rw *mirror);
1321int hammer_ioc_mirror_write(hammer_transaction_t trans, hammer_inode_t ip,
1322 struct hammer_ioc_mirror_rw *mirror);
5fa5c92f 1323int hammer_ioc_set_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
ea434b6f 1324 struct ucred *cred, struct hammer_ioc_pseudofs_rw *pfs);
5fa5c92f
MD
1325int hammer_ioc_get_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1326 struct hammer_ioc_pseudofs_rw *pfs);
842e7a70
MD
1327int hammer_ioc_destroy_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1328 struct hammer_ioc_pseudofs_rw *pfs);
1329int hammer_ioc_downgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1330 struct hammer_ioc_pseudofs_rw *pfs);
1331int hammer_ioc_upgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1332 struct hammer_ioc_pseudofs_rw *pfs);
4889cbd4
MD
1333int hammer_ioc_wait_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1334 struct hammer_ioc_pseudofs_rw *pfs);
d121f61c 1335int hammer_ioc_volume_add(hammer_transaction_t trans, hammer_inode_t ip,
865c9609
MN
1336 struct hammer_ioc_volume *ioc);
1337int hammer_ioc_volume_del(hammer_transaction_t trans, hammer_inode_t ip,
1338 struct hammer_ioc_volume *ioc);
bf686dbe 1339
855942b6 1340int hammer_signal_check(hammer_mount_t hmp);
bf686dbe 1341
059819e3
MD
1342void hammer_flusher_create(hammer_mount_t hmp);
1343void hammer_flusher_destroy(hammer_mount_t hmp);
1344void hammer_flusher_sync(hammer_mount_t hmp);
7a61b85d 1345int hammer_flusher_async(hammer_mount_t hmp, hammer_flush_group_t flg);
15e75dab 1346int hammer_flusher_async_one(hammer_mount_t hmp);
93291532 1347void hammer_flusher_wait(hammer_mount_t hmp, int seq);
82010f9f 1348void hammer_flusher_wait_next(hammer_mount_t hmp);
06ad81ff 1349int hammer_flusher_meta_limit(hammer_mount_t hmp);
93291532 1350int hammer_flusher_meta_halflimit(hammer_mount_t hmp);
06ad81ff 1351int hammer_flusher_undo_exhausted(hammer_transaction_t trans, int quarter);
525aad3a 1352void hammer_flusher_clean_loose_ios(hammer_mount_t hmp);
6c1f89f4 1353void hammer_flusher_finalize(hammer_transaction_t trans, int final);
1b0ab2c3 1354int hammer_flusher_haswork(hammer_mount_t hmp);
6048b411 1355void hammer_flusher_flush_undos(hammer_mount_t hmp, int already_flushed);
059819e3 1356
02428fb6
MD
1357int hammer_recover_stage1(hammer_mount_t hmp, hammer_volume_t rootvol);
1358int hammer_recover_stage2(hammer_mount_t hmp, hammer_volume_t rootvol);
51c35492 1359void hammer_recover_flush_buffers(hammer_mount_t hmp,
06ad81ff 1360 hammer_volume_t root_volume, int final);
f90dde4c 1361
19619882
MD
1362void hammer_crc_set_blockmap(hammer_blockmap_t blockmap);
1363void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk);
ddfdf542 1364void hammer_crc_set_leaf(void *data, hammer_btree_leaf_elm_t leaf);
19619882
MD
1365
1366int hammer_crc_test_blockmap(hammer_blockmap_t blockmap);
1367int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk);
19619882 1368int hammer_crc_test_btree(hammer_node_ondisk_t ondisk);
ddfdf542 1369int hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf);
77062c8a 1370void hkprintf(const char *ctl, ...);
a56cb012
MD
1371udev_t hammer_fsid_to_udev(uuid_t *uuid);
1372
19619882 1373
4a2796f3 1374int hammer_blocksize(int64_t file_offset);
6362a262 1375int hammer_blockoff(int64_t file_offset);
4a2796f3
MD
1376int64_t hammer_blockdemarc(int64_t file_offset1, int64_t file_offset2);
1377
0f65be10
MD
1378/*
1379 * Shortcut for _hammer_checkspace(), used all over the code.
1380 */
1381static __inline int
1382hammer_checkspace(hammer_mount_t hmp, int slop)
1383{
1384 return(_hammer_checkspace(hmp, slop, NULL));
1385}
1386
055f5ff8 1387#endif
427e5fc6 1388
8cd0a023 1389static __inline void
af209b0f
MD
1390hammer_wait_mem_record(hammer_record_t record)
1391{
1392 hammer_wait_mem_record_ident(record, "hmmwai");
1393}
1394
1395static __inline void
1396hammer_lock_ex(struct hammer_lock *lock)
1397{
1398 hammer_lock_ex_ident(lock, "hmrlck");
1399}
1400
bcac4bbb
MD
1401/*
1402 * Indicate that a B-Tree node is being modified.
1403 */
af209b0f 1404static __inline void
36f82b23 1405hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node)
bf686dbe 1406{
4c286c36 1407 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0);
36f82b23 1408 hammer_modify_buffer(trans, node->buffer, NULL, 0);
bf686dbe
MD
1409}
1410
1411static __inline void
36f82b23 1412hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node)
8cd0a023 1413{
4c286c36 1414 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0);
36f82b23
MD
1415 hammer_modify_buffer(trans, node->buffer,
1416 node->ondisk, sizeof(*node->ondisk));
427e5fc6
MD
1417}
1418
bf686dbe 1419static __inline void
36f82b23
MD
1420hammer_modify_node(hammer_transaction_t trans, hammer_node_t node,
1421 void *base, int len)
bf686dbe 1422{
19619882
MD
1423 hammer_crc_t *crcptr;
1424
bf686dbe
MD
1425 KKASSERT((char *)base >= (char *)node->ondisk &&
1426 (char *)base + len <=
1427 (char *)node->ondisk + sizeof(*node->ondisk));
4c286c36 1428 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0);
36f82b23 1429 hammer_modify_buffer(trans, node->buffer, base, len);
19619882
MD
1430 crcptr = &node->ondisk->crc;
1431 hammer_modify_buffer(trans, node->buffer, crcptr, sizeof(hammer_crc_t));
1432 --node->buffer->io.modify_refs; /* only want one ref */
bf686dbe
MD
1433}
1434
bcac4bbb
MD
1435/*
1436 * Indicate that the specified modifications have been completed.
1437 *
1438 * Do not try to generate the crc here, it's very expensive to do and a
1439 * sequence of insertions or deletions can result in many calls to this
1440 * function on the same node.
1441 */
bf686dbe 1442static __inline void
10a5d1ba
MD
1443hammer_modify_node_done(hammer_node_t node)
1444{
bcac4bbb
MD
1445 node->flags |= HAMMER_NODE_CRCGOOD;
1446 if ((node->flags & HAMMER_NODE_NEEDSCRC) == 0) {
1447 node->flags |= HAMMER_NODE_NEEDSCRC;
1448 node->buffer->io.gencrc = 1;
1449 hammer_ref_node(node);
1450 }
10a5d1ba
MD
1451 hammer_modify_buffer_done(node->buffer);
1452}
1453
e8599db1
MD
1454#define hammer_modify_volume_field(trans, vol, field) \
1455 hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \
1456 sizeof((vol)->ondisk->field))
1457
c9b9e29d
MD
1458#define hammer_modify_node_field(trans, node, field) \
1459 hammer_modify_node(trans, node, &(node)->ondisk->field, \
1460 sizeof((node)->ondisk->field))
1461
beec5dc4
MD
1462/*
1463 * The HAMMER_INODE_CAP_DIR_LOCAL_INO capability is set on newly
1464 * created directories for HAMMER version 2 or greater and causes
1465 * directory entries to be placed the inode localization zone in
1466 * the B-Tree instead of the misc zone.
1467 *
1468 * This greatly improves localization between directory entries and
1469 * inodes
1470 */
1471static __inline u_int32_t
1472hammer_dir_localization(hammer_inode_t dip)
1473{
1474 if (dip->ino_data.cap_flags & HAMMER_INODE_CAP_DIR_LOCAL_INO)
1475 return(HAMMER_LOCALIZE_INODE);
1476 else
1477 return(HAMMER_LOCALIZE_MISC);
1478}