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