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