wi(4) depends on wlan(4)
[dragonfly.git] / sys / vfs / hammer / hammer.h
CommitLineData
8750964d
MD
1/*
2 * Copyright (c) 2007 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
ec4e8497 34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.51 2008/04/26 08:02:17 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>
427e5fc6 52#include <sys/globaldata.h>
66325755
MD
53#include <sys/lockf.h>
54#include <sys/buf.h>
8cd0a023 55#include <sys/queue.h>
66325755
MD
56#include <sys/globaldata.h>
57
58#include <sys/buf2.h>
855942b6 59#include <sys/signal2.h>
427e5fc6 60#include "hammer_disk.h"
8750964d 61#include "hammer_mount.h"
7dc57964 62#include "hammer_ioctl.h"
8750964d
MD
63
64#if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
65
66MALLOC_DECLARE(M_HAMMER);
67
66325755
MD
68struct hammer_mount;
69
8750964d
MD
70/*
71 * Key structure used for custom RB tree inode lookups. This prototypes
72 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
73 */
74typedef struct hammer_inode_info {
513ca7d7 75 int64_t obj_id; /* (key) object identifier */
8750964d
MD
76 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
77} *hammer_inode_info_t;
78
b84de5af
MD
79typedef enum hammer_transaction_type {
80 HAMMER_TRANS_RO,
81 HAMMER_TRANS_STD,
82 HAMMER_TRANS_FLS
83} hammer_transaction_type_t;
84
66325755
MD
85/*
86 * HAMMER Transaction tracking
87 */
88struct hammer_transaction {
b84de5af 89 hammer_transaction_type_t type;
66325755
MD
90 struct hammer_mount *hmp;
91 hammer_tid_t tid;
b84de5af 92 hammer_tid_t time;
a89aec1b 93 struct hammer_volume *rootvol;
66325755
MD
94};
95
8cd0a023
MD
96typedef struct hammer_transaction *hammer_transaction_t;
97
66325755
MD
98/*
99 * HAMMER locks
100 */
427e5fc6 101struct hammer_lock {
0b075555 102 int refs; /* active references delay writes */
0b075555 103 int lockcount; /* lock count for exclusive/shared access */
427e5fc6
MD
104 int wanted;
105 struct thread *locktd;
8750964d
MD
106};
107
427e5fc6
MD
108static __inline int
109hammer_islocked(struct hammer_lock *lock)
110{
8cd0a023 111 return(lock->lockcount != 0);
427e5fc6
MD
112}
113
0b075555
MD
114static __inline int
115hammer_isactive(struct hammer_lock *lock)
116{
117 return(lock->refs != 0);
118}
119
427e5fc6
MD
120static __inline int
121hammer_islastref(struct hammer_lock *lock)
122{
123 return(lock->refs == 1);
124}
c60bb2c5 125
6a37e7e4 126/*
7aa3b8a6 127 * Return if we specifically own the lock exclusively.
6a37e7e4
MD
128 */
129static __inline int
7aa3b8a6 130hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td)
6a37e7e4 131{
7aa3b8a6
MD
132 if (lock->lockcount > 0 && lock->locktd == td)
133 return(1);
134 return(0);
6a37e7e4
MD
135}
136
ec4e8497
MD
137/*
138 * inode->inode dependancy
139 */
140typedef struct hammer_depend {
141 TAILQ_ENTRY(hammer_depend) ip_entry;
142 TAILQ_ENTRY(hammer_depend) rec_entry;
143 struct hammer_inode *ip;
144 struct hammer_record *record;
145} *hammer_depend_t;
146
147TAILQ_HEAD(hammer_depend_list, hammer_depend);
148
8750964d 149/*
8cd0a023
MD
150 * Structure used to represent an inode in-memory.
151 *
152 * The record and data associated with an inode may be out of sync with
153 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
154 * clear).
155 *
156 * An inode may also hold a cache of unsynchronized records, used for
157 * database and directories only. Unsynchronized regular file data is
158 * stored in the buffer cache.
159 *
160 * NOTE: A file which is created and destroyed within the initial
161 * synchronization period can wind up not doing any disk I/O at all.
162 *
163 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
8750964d
MD
164 */
165struct hammer_ino_rb_tree;
166struct hammer_inode;
167RB_HEAD(hammer_ino_rb_tree, hammer_inode);
168RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
8cd0a023
MD
169 hammer_ino_rb_compare, hammer_inode_info_t);
170
171struct hammer_rec_rb_tree;
172struct hammer_record;
173RB_HEAD(hammer_rec_rb_tree, hammer_record);
174RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
175 hammer_rec_rb_compare, hammer_base_elm_t);
176
177TAILQ_HEAD(hammer_node_list, hammer_node);
8750964d 178
b84de5af
MD
179typedef enum hammer_inode_state {
180 HAMMER_FST_IDLE,
181 HAMMER_FST_SETUP,
182 HAMMER_FST_FLUSH
183} hammer_inode_state_t;
184
8750964d
MD
185struct hammer_inode {
186 RB_ENTRY(hammer_inode) rb_node;
b84de5af 187 hammer_inode_state_t flush_state;
059819e3 188 TAILQ_ENTRY(hammer_inode) flush_entry;
ec4e8497 189 struct hammer_depend_list depend_list;
b84de5af
MD
190 u_int64_t obj_id; /* (key) object identifier */
191 hammer_tid_t obj_asof; /* (key) snapshot or 0 */
192 struct hammer_mount *hmp;
193 int flags;
194 int error; /* flush error */
ec4e8497 195 int depend_count;
b84de5af
MD
196 int cursor_ip_refs; /* sanity */
197 struct vnode *vp;
198 struct lockf advlock;
199 struct hammer_lock lock; /* sync copy interlock */
200 TAILQ_HEAD(, bio) bio_list; /* BIOs to flush out */
201 TAILQ_HEAD(, bio) bio_alt_list; /* BIOs to flush out */
202 off_t trunc_off;
203 struct hammer_inode_record ino_rec; /* in-memory cache */
204 struct hammer_inode_data ino_data; /* in-memory cache */
205 struct hammer_rec_rb_tree rec_tree; /* in-memory cache */
61aeeb33 206 struct hammer_node *cache[2]; /* search initiate cache */
b84de5af
MD
207
208 /*
209 * When a demark is created to synchronize an inode to
210 * disk, certain fields are copied so the front-end VOPs
211 * can continue to run in parallel with the synchronization
212 * occuring in the background.
213 */
214 int sync_flags; /* to-sync flags cache */
215 off_t sync_trunc_off; /* to-sync truncation */
216 struct hammer_inode_record sync_ino_rec;/* to-sync cache */
217 struct hammer_inode_data sync_ino_data; /* to-sync cache */
8750964d
MD
218};
219
8cd0a023
MD
220typedef struct hammer_inode *hammer_inode_t;
221
66325755
MD
222#define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
223
8cd0a023
MD
224#define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
225#define HAMMER_INODE_RDIRTY 0x0002 /* in-memory ino_rec is dirty */
226#define HAMMER_INODE_ITIMES 0x0004 /* in-memory mtime/atime modified */
059819e3 227#define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records/flsbufs present */
8cd0a023 228#define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
a89aec1b 229#define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
c0ade690 230#define HAMMER_INODE_DELETED 0x0080 /* inode ready for deletion */
76376933 231#define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
d113fda1
MD
232#define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */
233#define HAMMER_INODE_GONE 0x0400 /* delete flushed out */
0a72edae 234#define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */
f3b0f382 235#define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */
b84de5af
MD
236#define HAMMER_INODE_REFLUSH 0x2000 /* pipelined flush during flush */
237#define HAMMER_INODE_UNUSED4000 0x4000
059819e3 238#define HAMMER_INODE_FLUSHW 0x8000 /* Someone waiting for flush */
8cd0a023 239
b84de5af
MD
240#define HAMMER_INODE_TRUNCATED 0x00010000
241
0b075555 242#define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_RDIRTY| \
f3b0f382 243 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \
b84de5af 244 HAMMER_INODE_ITIMES|HAMMER_INODE_TRUNCATED)
0b075555 245
8cd0a023 246#define HAMMER_MAX_INODE_CURSORS 4
66325755 247
f90dde4c
MD
248#define HAMMER_FLUSH_SIGNAL 0x0001
249#define HAMMER_FLUSH_FORCE 0x0002
ec4e8497 250#define HAMMER_FLUSH_RELEASE 0x0004
f90dde4c 251
8750964d 252/*
8cd0a023
MD
253 * Structure used to represent an unsynchronized record in-memory. This
254 * structure is orgranized in a per-inode RB-tree. If the inode is not
255 * on disk then neither are any records and the in-memory record tree
256 * represents the entire contents of the inode. If the inode is on disk
257 * then the on-disk B-Tree is scanned in parallel with the in-memory
258 * RB-Tree to synthesize the current state of the file.
259 *
260 * Only current (delete_tid == 0) unsynchronized records are kept in-memory.
b33e2cc0
MD
261 *
262 * blocked is the count of the number of cursors (ip_first/ip_next) blocked
263 * on the record waiting for a synchronization to complete.
8750964d 264 */
8cd0a023
MD
265struct hammer_record {
266 RB_ENTRY(hammer_record) rb_node;
b84de5af 267 hammer_inode_state_t state;
a89aec1b 268 struct hammer_lock lock;
8cd0a023
MD
269 struct hammer_inode *ip;
270 union hammer_record_ondisk rec;
271 union hammer_data_ondisk *data;
8cd0a023 272 int flags;
ec4e8497 273 struct hammer_depend_list depend_list;
8cd0a023 274};
8750964d 275
8cd0a023
MD
276typedef struct hammer_record *hammer_record_t;
277
278#define HAMMER_RECF_ALLOCDATA 0x0001
279#define HAMMER_RECF_ONRBTREE 0x0002
b84de5af 280#define HAMMER_RECF_DELETED_FE 0x0004 /* deleted (frontend) */
40043e7f 281#define HAMMER_RECF_INBAND 0x0008
b84de5af 282#define HAMMER_RECF_DELETED_BE 0x0010 /* deleted (backend) */
b33e2cc0 283#define HAMMER_RECF_WANTED 0x0020
b84de5af 284#define HAMMER_RECF_DELETE_ONDISK 0x0040
8cd0a023
MD
285
286/*
47197d71 287 * In-memory structures representing on-disk structures.
8cd0a023 288 */
8750964d 289struct hammer_volume;
427e5fc6 290struct hammer_buffer;
8cd0a023 291struct hammer_node;
8750964d 292RB_HEAD(hammer_vol_rb_tree, hammer_volume);
427e5fc6 293RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
8cd0a023 294RB_HEAD(hammer_nod_rb_tree, hammer_node);
8750964d
MD
295
296RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
297 hammer_vol_rb_compare, int32_t);
427e5fc6 298RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
47197d71 299 hammer_buf_rb_compare, hammer_off_t);
8cd0a023 300RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
47197d71 301 hammer_nod_rb_compare, hammer_off_t);
8750964d 302
66325755
MD
303/*
304 * IO management - embedded at the head of various in-memory structures
10a5d1ba
MD
305 *
306 * VOLUME - hammer_volume containing meta-data
307 * META_BUFFER - hammer_buffer containing meta-data
308 * DATA_BUFFER - hammer_buffer containing pure-data
309 *
310 * Dirty volume headers and dirty meta-data buffers are locked until the
311 * flusher can sequence them out. Dirty pure-data buffers can be written.
312 * Clean buffers can be passively released.
66325755 313 */
10a5d1ba
MD
314typedef enum hammer_io_type {
315 HAMMER_STRUCTURE_VOLUME,
316 HAMMER_STRUCTURE_META_BUFFER,
317 HAMMER_STRUCTURE_UNDO_BUFFER,
318 HAMMER_STRUCTURE_DATA_BUFFER
319} hammer_io_type_t;
66325755
MD
320
321union hammer_io_structure;
055f5ff8 322struct hammer_io;
66325755
MD
323
324struct worklist {
325 LIST_ENTRY(worklist) node;
326};
327
10a5d1ba
MD
328TAILQ_HEAD(hammer_io_list, hammer_io);
329typedef struct hammer_io_list *hammer_io_list_t;
055f5ff8 330
66325755 331struct hammer_io {
10a5d1ba
MD
332 struct worklist worklist;
333 struct hammer_lock lock;
334 enum hammer_io_type type;
335 struct hammer_mount *hmp;
336 TAILQ_ENTRY(hammer_io) mod_entry; /* list entry if modified */
337 hammer_io_list_t mod_list;
338 struct buf *bp;
339 int64_t offset;
340 int loading; /* loading/unloading interlock */
341 int modify_refs;
342
66325755
MD
343 u_int modified : 1; /* bp's data was modified */
344 u_int released : 1; /* bp released (w/ B_LOCKED set) */
055f5ff8
MD
345 u_int running : 1; /* bp write IO in progress */
346 u_int waiting : 1; /* someone is waiting on us */
b33e2cc0 347 u_int validated : 1; /* ondisk has been validated */
b58c6388
MD
348 u_int flush : 1; /* flush on last release */
349 u_int waitdep : 1; /* flush waits for dependancies */
66325755
MD
350};
351
8cd0a023
MD
352typedef struct hammer_io *hammer_io_t;
353
66325755 354/*
8cd0a023 355 * In-memory volume representing on-disk buffer
66325755 356 */
8750964d 357struct hammer_volume {
66325755 358 struct hammer_io io;
8750964d 359 RB_ENTRY(hammer_volume) rb_node;
47197d71 360 struct hammer_buf_rb_tree rb_bufs_root;
8750964d
MD
361 struct hammer_volume_ondisk *ondisk;
362 int32_t vol_no;
fbc6e32a 363 int64_t nblocks; /* note: special calculation for statfs */
47197d71
MD
364 int64_t buffer_base; /* base offset of buffer 0 */
365 hammer_off_t maxbuf_off; /* Maximum buffer offset */
c60bb2c5 366 char *vol_name;
8750964d 367 struct vnode *devvp;
427e5fc6 368 int vol_flags;
8750964d
MD
369};
370
8cd0a023
MD
371typedef struct hammer_volume *hammer_volume_t;
372
66325755 373/*
8cd0a023
MD
374 * In-memory buffer (other then volume, super-cluster, or cluster),
375 * representing an on-disk buffer.
66325755 376 */
427e5fc6 377struct hammer_buffer {
66325755 378 struct hammer_io io;
427e5fc6 379 RB_ENTRY(hammer_buffer) rb_node;
47197d71 380 void *ondisk;
427e5fc6 381 struct hammer_volume *volume;
34d829f7
MD
382 hammer_off_t zone2_offset;
383 hammer_off_t zoneX_offset;
8cd0a023 384 struct hammer_node_list clist;
66325755
MD
385};
386
8cd0a023
MD
387typedef struct hammer_buffer *hammer_buffer_t;
388
389/*
390 * In-memory B-Tree node, representing an on-disk B-Tree node.
391 *
392 * This is a hang-on structure which is backed by a hammer_buffer,
393 * indexed by a hammer_cluster, and used for fine-grained locking of
394 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
395 * can contain multiple nodes representing wildly disassociated portions
396 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
397 *
398 * This structure uses a cluster-relative index to reduce the number
399 * of layers required to access it, and also because all on-disk B-Tree
400 * references are cluster-relative offsets.
401 */
402struct hammer_node {
403 struct hammer_lock lock; /* node-by-node lock */
404 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */
405 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */
47197d71 406 hammer_off_t node_offset; /* full offset spec */
40043e7f 407 struct hammer_mount *hmp;
8cd0a023
MD
408 struct hammer_buffer *buffer; /* backing buffer */
409 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */
410 struct hammer_node **cache1; /* passive cache(s) */
411 struct hammer_node **cache2;
b3deaf57 412 int flags;
740d8317 413 int loading; /* load interlock */
8cd0a023
MD
414};
415
b3deaf57
MD
416#define HAMMER_NODE_DELETED 0x0001
417#define HAMMER_NODE_FLUSH 0x0002
b3deaf57 418
8cd0a023
MD
419typedef struct hammer_node *hammer_node_t;
420
b33e2cc0
MD
421/*
422 * List of locked nodes.
423 */
424struct hammer_node_locklist {
425 struct hammer_node_locklist *next;
426 hammer_node_t node;
427};
428
429typedef struct hammer_node_locklist *hammer_node_locklist_t;
430
431
8cd0a023
MD
432/*
433 * Common I/O management structure - embedded in in-memory structures
434 * which are backed by filesystem buffers.
435 */
66325755
MD
436union hammer_io_structure {
437 struct hammer_io io;
438 struct hammer_volume volume;
66325755 439 struct hammer_buffer buffer;
8750964d
MD
440};
441
055f5ff8
MD
442typedef union hammer_io_structure *hammer_io_structure_t;
443
bf686dbe
MD
444/*
445 * Allocation holes are recorded for a short period of time in an attempt
446 * to use up the space.
447 */
448
449#define HAMMER_MAX_HOLES 8
450
451struct hammer_hole;
452
453struct hammer_holes {
454 TAILQ_HEAD(, hammer_hole) list;
455 int count;
456};
457
458typedef struct hammer_holes *hammer_holes_t;
459
460struct hammer_hole {
461 TAILQ_ENTRY(hammer_hole) entry;
462 hammer_off_t offset;
463 int bytes;
464};
465
466typedef struct hammer_hole *hammer_hole_t;
427e5fc6 467
8cd0a023
MD
468#include "hammer_cursor.h"
469
8750964d
MD
470/*
471 * Internal hammer mount data structure
472 */
473struct hammer_mount {
474 struct mount *mp;
27ea2398 475 /*struct vnode *rootvp;*/
8750964d
MD
476 struct hammer_ino_rb_tree rb_inos_root;
477 struct hammer_vol_rb_tree rb_vols_root;
40043e7f 478 struct hammer_nod_rb_tree rb_nods_root;
8750964d 479 struct hammer_volume *rootvol;
47197d71
MD
480 struct hammer_base_elm root_btree_beg;
481 struct hammer_base_elm root_btree_end;
d26d0ae9 482 char *zbuf; /* HAMMER_BUFSIZE bytes worth of all-zeros */
195c19a1
MD
483 int hflags;
484 int ronly;
485 int nvolumes;
d26d0ae9 486 int volume_iterator;
059819e3
MD
487 int flusher_seq;
488 int flusher_act;
489 int flusher_exiting;
f90dde4c 490 int reclaim_count;
059819e3 491 thread_t flusher_td;
855942b6 492 u_int check_interrupt;
8750964d 493 uuid_t fsid;
66325755 494 udev_t fsid_udev;
10a5d1ba
MD
495 struct hammer_io_list volu_list; /* dirty undo buffers */
496 struct hammer_io_list undo_list; /* dirty undo buffers */
497 struct hammer_io_list data_list; /* dirty data buffers */
498 struct hammer_io_list meta_list; /* dirty meta bufs */
499 struct hammer_io_list lose_list; /* loose buffers */
500 int locked_dirty_count; /* meta/volu count */
f90dde4c 501 int io_running_count;
7f7c1f84 502 hammer_tid_t asof;
b84de5af 503 hammer_off_t next_tid;
66325755 504 u_int32_t namekey_iterator;
f03c9cf4 505 hammer_off_t zone_limits[HAMMER_MAX_ZONES];
513ca7d7 506 struct netexport export;
40043e7f 507 struct lock blockmap_lock;
bf686dbe 508 struct hammer_holes holes[HAMMER_MAX_ZONES];
059819e3 509 TAILQ_HEAD(, hammer_inode) flush_list;
8750964d
MD
510};
511
8cd0a023 512typedef struct hammer_mount *hammer_mount_t;
8750964d 513
fbc6e32a
MD
514struct hammer_sync_info {
515 int error;
516 int waitfor;
517};
518
8750964d
MD
519#endif
520
521#if defined(_KERNEL)
522
523extern struct vop_ops hammer_vnode_vops;
7a04d74f
MD
524extern struct vop_ops hammer_spec_vops;
525extern struct vop_ops hammer_fifo_vops;
66325755 526extern struct bio_ops hammer_bioops;
427e5fc6 527
d5ef456e 528extern int hammer_debug_general;
7d683b0f 529extern int hammer_debug_locks;
b3deaf57 530extern int hammer_debug_btree;
d113fda1 531extern int hammer_debug_tid;
b33e2cc0 532extern int hammer_debug_recover;
46fe7ae1 533extern int hammer_debug_recover_faults;
b3deaf57
MD
534extern int hammer_count_inodes;
535extern int hammer_count_records;
536extern int hammer_count_record_datas;
537extern int hammer_count_volumes;
b3deaf57
MD
538extern int hammer_count_buffers;
539extern int hammer_count_nodes;
7d683b0f 540extern int64_t hammer_contention_count;
b3deaf57 541
8750964d
MD
542int hammer_vop_inactive(struct vop_inactive_args *);
543int hammer_vop_reclaim(struct vop_reclaim_args *);
66325755
MD
544int hammer_get_vnode(struct hammer_inode *ip, int lktype,
545 struct vnode **vpp);
36f82b23 546struct hammer_inode *hammer_get_inode(hammer_transaction_t trans,
61aeeb33 547 struct hammer_node **cache,
d113fda1
MD
548 u_int64_t obj_id, hammer_tid_t asof, int flags,
549 int *errorp);
66325755
MD
550void hammer_put_inode(struct hammer_inode *ip);
551void hammer_put_inode_ref(struct hammer_inode *ip);
552
8cd0a023 553int hammer_unload_volume(hammer_volume_t volume, void *data __unused);
a89aec1b 554int hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
8cd0a023
MD
555int hammer_install_volume(hammer_mount_t hmp, const char *volname);
556
a89aec1b
MD
557int hammer_ip_lookup(hammer_cursor_t cursor, hammer_inode_t ip);
558int hammer_ip_first(hammer_cursor_t cursor, hammer_inode_t ip);
559int hammer_ip_next(hammer_cursor_t cursor);
40043e7f 560int hammer_ip_resolve_record_and_data(hammer_cursor_t cursor);
8cd0a023 561int hammer_ip_resolve_data(hammer_cursor_t cursor);
195c19a1 562int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_tid_t tid);
7dc57964 563int hammer_delete_at_cursor(hammer_cursor_t cursor, int64_t *stat_bytes);
b3deaf57
MD
564int hammer_ip_check_directory_empty(hammer_transaction_t trans,
565 hammer_inode_t ip);
fbc6e32a 566int hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
fbc6e32a 567
8cd0a023 568hammer_record_t
40043e7f 569 hammer_alloc_mem_record(hammer_inode_t ip);
b84de5af
MD
570void hammer_flush_record_done(hammer_record_t record);
571void hammer_wait_mem_record(hammer_record_t record);
b3deaf57 572void hammer_rel_mem_record(hammer_record_t record);
ec4e8497 573void hammer_delete_mem_record(hammer_record_t record);
8cd0a023 574
b84de5af 575
6a37e7e4 576int hammer_cursor_up(hammer_cursor_t cursor);
8cd0a023 577int hammer_cursor_down(hammer_cursor_t cursor);
6a37e7e4
MD
578int hammer_cursor_upgrade(hammer_cursor_t cursor);
579void hammer_cursor_downgrade(hammer_cursor_t cursor);
32c90105
MD
580int hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
581 int index);
8cd0a023
MD
582void hammer_lock_ex(struct hammer_lock *lock);
583int hammer_lock_ex_try(struct hammer_lock *lock);
584void hammer_lock_sh(struct hammer_lock *lock);
6a37e7e4
MD
585int hammer_lock_upgrade(struct hammer_lock *lock);
586void hammer_lock_downgrade(struct hammer_lock *lock);
427e5fc6 587void hammer_unlock(struct hammer_lock *lock);
66325755
MD
588void hammer_ref(struct hammer_lock *lock);
589void hammer_unref(struct hammer_lock *lock);
8cd0a023 590
66325755 591u_int32_t hammer_to_unix_xid(uuid_t *uuid);
8cd0a023
MD
592void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
593void hammer_to_timespec(hammer_tid_t tid, struct timespec *ts);
594hammer_tid_t hammer_timespec_to_transid(struct timespec *ts);
a89aec1b 595hammer_tid_t hammer_alloc_tid(hammer_transaction_t trans);
7f7c1f84 596hammer_tid_t hammer_now_tid(void);
d113fda1 597hammer_tid_t hammer_str_to_tid(const char *str);
8cd0a023 598
66325755 599enum vtype hammer_get_vnode_type(u_int8_t obj_type);
6b4f890b 600int hammer_get_dtype(u_int8_t obj_type);
66325755
MD
601u_int8_t hammer_get_obj_type(enum vtype vtype);
602int64_t hammer_directory_namekey(void *name, int len);
427e5fc6 603
36f82b23
MD
604int hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor,
605 struct hammer_node **cache);
195c19a1 606
8cd0a023 607void hammer_done_cursor(hammer_cursor_t cursor);
6b4f890b 608void hammer_mem_done(hammer_cursor_t cursor);
8cd0a023
MD
609
610int hammer_btree_lookup(hammer_cursor_t cursor);
d26d0ae9 611int hammer_btree_first(hammer_cursor_t cursor);
32c90105 612int hammer_btree_last(hammer_cursor_t cursor);
8cd0a023
MD
613int hammer_btree_extract(hammer_cursor_t cursor, int flags);
614int hammer_btree_iterate(hammer_cursor_t cursor);
32c90105 615int hammer_btree_iterate_reverse(hammer_cursor_t cursor);
8cd0a023
MD
616int hammer_btree_insert(hammer_cursor_t cursor, hammer_btree_elm_t elm);
617int hammer_btree_delete(hammer_cursor_t cursor);
618int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
d26d0ae9 619int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
32c90105
MD
620int hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
621int hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
622
fe7678ee 623
b33e2cc0
MD
624int hammer_btree_lock_children(hammer_cursor_t cursor,
625 struct hammer_node_locklist **locklistp);
b33e2cc0 626
c0ade690
MD
627void hammer_print_btree_node(hammer_node_ondisk_t ondisk);
628void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
8750964d 629
47197d71
MD
630void *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
631 int *errorp, struct hammer_buffer **bufferp);
632void *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
633 int *errorp, struct hammer_buffer **bufferp);
8cd0a023
MD
634
635hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
059819e3
MD
636int hammer_dowrite(hammer_transaction_t trans, hammer_inode_t ip,
637 struct bio *bio);
427e5fc6 638
8cd0a023 639hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
427e5fc6 640 int32_t vol_no, int *errorp);
47197d71
MD
641hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp,
642 hammer_off_t buf_offset, int isnew, int *errorp);
b58c6388 643void hammer_uncache_buffer(struct hammer_mount *hmp, hammer_off_t off);
8cd0a023 644
fbc6e32a 645int hammer_ref_volume(hammer_volume_t volume);
8cd0a023
MD
646int hammer_ref_buffer(hammer_buffer_t buffer);
647void hammer_flush_buffer_nodes(hammer_buffer_t buffer);
648
8cd0a023 649void hammer_rel_volume(hammer_volume_t volume, int flush);
8cd0a023
MD
650void hammer_rel_buffer(hammer_buffer_t buffer, int flush);
651
513ca7d7
MD
652int hammer_vfs_export(struct mount *mp, int op,
653 const struct export_args *export);
47197d71
MD
654hammer_node_t hammer_get_node(hammer_mount_t hmp,
655 hammer_off_t node_offset, int *errorp);
740d8317 656void hammer_ref_node(hammer_node_t node);
055f5ff8
MD
657hammer_node_t hammer_ref_node_safe(struct hammer_mount *hmp,
658 struct hammer_node **cache, int *errorp);
8cd0a023 659void hammer_rel_node(hammer_node_t node);
36f82b23
MD
660void hammer_delete_node(hammer_transaction_t trans,
661 hammer_node_t node);
8cd0a023
MD
662void hammer_cache_node(hammer_node_t node,
663 struct hammer_node **cache);
664void hammer_uncache_node(struct hammer_node **cache);
665void hammer_flush_node(hammer_node_t node);
666
427e5fc6
MD
667void hammer_dup_buffer(struct hammer_buffer **bufferp,
668 struct hammer_buffer *buffer);
36f82b23
MD
669hammer_node_t hammer_alloc_btree(hammer_transaction_t trans, int *errorp);
670void *hammer_alloc_record(hammer_transaction_t trans,
bf686dbe 671 hammer_off_t *rec_offp, u_int16_t rec_type,
40043e7f
MD
672 struct hammer_buffer **rec_bufferp,
673 int32_t data_len, void **datap,
674 struct hammer_buffer **data_bufferp, int *errorp);
36f82b23 675void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len,
bf686dbe
MD
676 hammer_off_t *data_offsetp,
677 struct hammer_buffer **data_bufferp, int *errorp);
678
059819e3
MD
679int hammer_generate_undo(hammer_transaction_t trans, hammer_io_t io,
680 hammer_off_t zone1_offset, void *base, int len);
427e5fc6 681
66325755 682void hammer_put_volume(struct hammer_volume *volume, int flush);
66325755 683void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
427e5fc6 684
36f82b23
MD
685hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans,
686 hammer_off_t owner, int *errorp);
687void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset,
c3be93f2 688 hammer_off_t owner, int *errorp);
36f82b23 689hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone,
40043e7f 690 int bytes, int *errorp);
36f82b23
MD
691void hammer_blockmap_free(hammer_transaction_t trans,
692 hammer_off_t bmap_off, int bytes);
bf686dbe
MD
693int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
694 int *curp, int *errorp);
40043e7f
MD
695hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
696 int *errorp);
bf686dbe
MD
697hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
698 int *errorp);
40043e7f 699
8cd0a023
MD
700void hammer_start_transaction(struct hammer_transaction *trans,
701 struct hammer_mount *hmp);
36f82b23
MD
702void hammer_simple_transaction(struct hammer_transaction *trans,
703 struct hammer_mount *hmp);
b84de5af
MD
704void hammer_start_transaction_fls(struct hammer_transaction *trans,
705 struct hammer_mount *hmp);
706void hammer_done_transaction(struct hammer_transaction *trans);
66325755
MD
707
708void hammer_modify_inode(struct hammer_transaction *trans,
8cd0a023 709 hammer_inode_t ip, int flags);
f90dde4c 710void hammer_flush_inode(hammer_inode_t ip, int flags);
b84de5af
MD
711void hammer_flush_inode_done(hammer_inode_t ip);
712void hammer_wait_inode(hammer_inode_t ip);
713
8cd0a023
MD
714int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
715 struct ucred *cred, struct hammer_inode *dip,
716 struct hammer_inode **ipp);
a89aec1b 717void hammer_rel_inode(hammer_inode_t ip, int flush);
b84de5af 718int hammer_sync_inode(hammer_inode_t ip, int handle_delete);
8cd0a023 719
a89aec1b 720int hammer_ip_add_directory(struct hammer_transaction *trans,
8cd0a023
MD
721 hammer_inode_t dip, struct namecache *ncp,
722 hammer_inode_t nip);
a89aec1b 723int hammer_ip_del_directory(struct hammer_transaction *trans,
8cd0a023
MD
724 hammer_cursor_t cursor, hammer_inode_t dip,
725 hammer_inode_t ip);
7a04d74f
MD
726int hammer_ip_add_record(struct hammer_transaction *trans,
727 hammer_record_t record);
a89aec1b 728int hammer_ip_delete_range(struct hammer_transaction *trans,
47197d71 729 hammer_inode_t ip, int64_t ran_beg, int64_t ran_end);
7a04d74f
MD
730int hammer_ip_delete_range_all(struct hammer_transaction *trans,
731 hammer_inode_t ip);
c0ade690 732int hammer_ip_sync_data(struct hammer_transaction *trans,
8cd0a023 733 hammer_inode_t ip, int64_t offset,
47197d71 734 void *data, int bytes);
36f82b23 735int hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec);
66325755 736
7dc57964
MD
737int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
738 struct ucred *cred);
739
10a5d1ba
MD
740void hammer_io_init(hammer_io_t io, hammer_mount_t hmp,
741 enum hammer_io_type type);
742void hammer_io_reinit(hammer_io_t io, enum hammer_io_type type);
66325755
MD
743int hammer_io_read(struct vnode *devvp, struct hammer_io *io);
744int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
b58c6388 745void hammer_io_release(struct hammer_io *io);
055f5ff8 746void hammer_io_flush(struct hammer_io *io);
8cd0a023 747int hammer_io_checkflush(hammer_io_t io);
61aeeb33 748void hammer_io_clear_modify(struct hammer_io *io);
055f5ff8 749void hammer_io_waitdep(struct hammer_io *io);
66325755 750
36f82b23
MD
751void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume,
752 void *base, int len);
753void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer,
754 void *base, int len);
10a5d1ba
MD
755void hammer_modify_volume_done(hammer_volume_t volume);
756void hammer_modify_buffer_done(hammer_buffer_t buffer);
0b075555 757
36f82b23
MD
758int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
759 struct hammer_ioc_reblock *reblock);
bf686dbe
MD
760
761void hammer_init_holes(hammer_mount_t hmp, hammer_holes_t holes);
762void hammer_free_holes(hammer_mount_t hmp, hammer_holes_t holes);
855942b6 763int hammer_signal_check(hammer_mount_t hmp);
bf686dbe 764
059819e3
MD
765void hammer_flusher_create(hammer_mount_t hmp);
766void hammer_flusher_destroy(hammer_mount_t hmp);
767void hammer_flusher_sync(hammer_mount_t hmp);
768void hammer_flusher_async(hammer_mount_t hmp);
769
f90dde4c
MD
770int hammer_recover(hammer_mount_t hmp, hammer_volume_t rootvol);
771
055f5ff8 772#endif
427e5fc6 773
8cd0a023 774static __inline void
36f82b23 775hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node)
bf686dbe 776{
36f82b23 777 hammer_modify_buffer(trans, node->buffer, NULL, 0);
bf686dbe
MD
778}
779
780static __inline void
36f82b23 781hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node)
8cd0a023 782{
36f82b23
MD
783 hammer_modify_buffer(trans, node->buffer,
784 node->ondisk, sizeof(*node->ondisk));
427e5fc6
MD
785}
786
bf686dbe 787static __inline void
36f82b23
MD
788hammer_modify_node(hammer_transaction_t trans, hammer_node_t node,
789 void *base, int len)
bf686dbe
MD
790{
791 KKASSERT((char *)base >= (char *)node->ondisk &&
792 (char *)base + len <=
793 (char *)node->ondisk + sizeof(*node->ondisk));
36f82b23 794 hammer_modify_buffer(trans, node->buffer, base, len);
bf686dbe
MD
795}
796
10a5d1ba
MD
797static __inline void
798hammer_modify_node_done(hammer_node_t node)
799{
800 hammer_modify_buffer_done(node->buffer);
801}
802
bf686dbe 803static __inline void
36f82b23
MD
804hammer_modify_record(hammer_transaction_t trans, hammer_buffer_t buffer,
805 void *base, int len)
bf686dbe
MD
806{
807 KKASSERT((char *)base >= (char *)buffer->ondisk &&
808 (char *)base + len <= (char *)buffer->ondisk + HAMMER_BUFSIZE);
36f82b23 809 hammer_modify_buffer(trans, buffer, base, len);
bf686dbe
MD
810}
811
10a5d1ba
MD
812static __inline void
813hammer_modify_record_done(hammer_buffer_t buffer)
814{
815 hammer_modify_buffer_done(buffer);
816}
817