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