- Factor out if_purgeaddrs_nolink(), which frees all non-link ifaddrs no
[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 *
0b075555 34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.16 2007/12/30 08:49:20 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>
44#include <sys/systm.h>
8750964d
MD
45#include <sys/tree.h>
46#include <sys/malloc.h>
427e5fc6
MD
47#include <sys/mount.h>
48#include <sys/vnode.h>
49#include <sys/globaldata.h>
66325755
MD
50#include <sys/lockf.h>
51#include <sys/buf.h>
8cd0a023 52#include <sys/queue.h>
66325755
MD
53#include <sys/globaldata.h>
54
55#include <sys/buf2.h>
c60bb2c5 56#include "hammer_alist.h"
427e5fc6 57#include "hammer_disk.h"
8750964d
MD
58#include "hammer_mount.h"
59
60#if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
61
62MALLOC_DECLARE(M_HAMMER);
63
66325755
MD
64struct hammer_mount;
65
8750964d
MD
66/*
67 * Key structure used for custom RB tree inode lookups. This prototypes
68 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
69 */
70typedef struct hammer_inode_info {
71 u_int64_t obj_id; /* (key) object identifier */
72 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
73} *hammer_inode_info_t;
74
66325755
MD
75/*
76 * HAMMER Transaction tracking
77 */
78struct hammer_transaction {
79 struct hammer_mount *hmp;
80 hammer_tid_t tid;
a89aec1b 81 struct hammer_volume *rootvol;
66325755
MD
82};
83
8cd0a023
MD
84typedef struct hammer_transaction *hammer_transaction_t;
85
66325755
MD
86/*
87 * HAMMER locks
88 */
427e5fc6 89struct hammer_lock {
0b075555
MD
90 int refs; /* active references delay writes */
91 int modifying; /* indicates buffer being modified */
92 int lockcount; /* lock count for exclusive/shared access */
427e5fc6
MD
93 int wanted;
94 struct thread *locktd;
8750964d
MD
95};
96
427e5fc6
MD
97static __inline int
98hammer_islocked(struct hammer_lock *lock)
99{
8cd0a023 100 return(lock->lockcount != 0);
427e5fc6
MD
101}
102
0b075555
MD
103static __inline int
104hammer_isactive(struct hammer_lock *lock)
105{
106 return(lock->refs != 0);
107}
108
427e5fc6
MD
109static __inline int
110hammer_islastref(struct hammer_lock *lock)
111{
112 return(lock->refs == 1);
113}
c60bb2c5 114
8750964d 115/*
8cd0a023
MD
116 * Structure used to represent an inode in-memory.
117 *
118 * The record and data associated with an inode may be out of sync with
119 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
120 * clear).
121 *
122 * An inode may also hold a cache of unsynchronized records, used for
123 * database and directories only. Unsynchronized regular file data is
124 * stored in the buffer cache.
125 *
126 * NOTE: A file which is created and destroyed within the initial
127 * synchronization period can wind up not doing any disk I/O at all.
128 *
129 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
8750964d
MD
130 */
131struct hammer_ino_rb_tree;
132struct hammer_inode;
133RB_HEAD(hammer_ino_rb_tree, hammer_inode);
134RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
8cd0a023
MD
135 hammer_ino_rb_compare, hammer_inode_info_t);
136
137struct hammer_rec_rb_tree;
138struct hammer_record;
139RB_HEAD(hammer_rec_rb_tree, hammer_record);
140RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
141 hammer_rec_rb_compare, hammer_base_elm_t);
142
143TAILQ_HEAD(hammer_node_list, hammer_node);
8750964d
MD
144
145struct hammer_inode {
146 RB_ENTRY(hammer_inode) rb_node;
147 u_int64_t obj_id; /* (key) object identifier */
148 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
8cd0a023 149 hammer_tid_t last_tid; /* last modified tid (for fsync) */
66325755
MD
150 struct hammer_mount *hmp;
151 int flags;
c60bb2c5 152 struct vnode *vp;
66325755 153 struct lockf advlock;
8cd0a023 154 struct hammer_lock lock;
c60bb2c5
MD
155 struct hammer_inode_record ino_rec;
156 struct hammer_inode_data ino_data;
8cd0a023
MD
157 struct hammer_rec_rb_tree rec_tree; /* red-black record tree */
158 struct hammer_node *cache; /* cached B-Tree node shortcut */
8750964d
MD
159};
160
8cd0a023
MD
161typedef struct hammer_inode *hammer_inode_t;
162
66325755
MD
163#define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
164
8cd0a023
MD
165#define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
166#define HAMMER_INODE_RDIRTY 0x0002 /* in-memory ino_rec is dirty */
167#define HAMMER_INODE_ITIMES 0x0004 /* in-memory mtime/atime modified */
168#define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
a89aec1b 169#define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
c0ade690
MD
170#define HAMMER_INODE_TID 0x0040 /* update in-memory last_tid */
171#define HAMMER_INODE_DELETED 0x0080 /* inode ready for deletion */
76376933 172#define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
8cd0a023 173
0b075555
MD
174#define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_RDIRTY| \
175 HAMMER_INODE_ITIMES|HAMMER_INODE_FLUSH| \
176 HAMMER_INODE_DELETED)
177
8cd0a023 178#define HAMMER_MAX_INODE_CURSORS 4
66325755 179
8750964d 180/*
8cd0a023
MD
181 * Structure used to represent an unsynchronized record in-memory. This
182 * structure is orgranized in a per-inode RB-tree. If the inode is not
183 * on disk then neither are any records and the in-memory record tree
184 * represents the entire contents of the inode. If the inode is on disk
185 * then the on-disk B-Tree is scanned in parallel with the in-memory
186 * RB-Tree to synthesize the current state of the file.
187 *
188 * Only current (delete_tid == 0) unsynchronized records are kept in-memory.
8750964d 189 */
8cd0a023
MD
190struct hammer_record {
191 RB_ENTRY(hammer_record) rb_node;
a89aec1b 192 struct hammer_lock lock;
8cd0a023
MD
193 struct hammer_inode *ip;
194 union hammer_record_ondisk rec;
195 union hammer_data_ondisk *data;
8cd0a023
MD
196 int flags;
197};
8750964d 198
8cd0a023
MD
199typedef struct hammer_record *hammer_record_t;
200
201#define HAMMER_RECF_ALLOCDATA 0x0001
202#define HAMMER_RECF_ONRBTREE 0x0002
a89aec1b 203#define HAMMER_RECF_DELETED 0x0004
c0ade690 204#define HAMMER_RECF_EMBEDDED_DATA 0x0008
8cd0a023
MD
205
206/*
207 * Structures used to internally represent a volume and a cluster
208 */
8750964d
MD
209struct hammer_volume;
210struct hammer_cluster;
427e5fc6
MD
211struct hammer_supercl;
212struct hammer_buffer;
8cd0a023 213struct hammer_node;
8750964d
MD
214RB_HEAD(hammer_vol_rb_tree, hammer_volume);
215RB_HEAD(hammer_clu_rb_tree, hammer_cluster);
427e5fc6
MD
216RB_HEAD(hammer_scl_rb_tree, hammer_supercl);
217RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
8cd0a023 218RB_HEAD(hammer_nod_rb_tree, hammer_node);
8750964d
MD
219
220RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
221 hammer_vol_rb_compare, int32_t);
222RB_PROTOTYPE2(hammer_clu_rb_tree, hammer_cluster, rb_node,
223 hammer_clu_rb_compare, int32_t);
427e5fc6
MD
224RB_PROTOTYPE2(hammer_scl_rb_tree, hammer_supercl, rb_node,
225 hammer_scl_rb_compare, int32_t);
226RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
227 hammer_buf_rb_compare, int32_t);
8cd0a023
MD
228RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
229 hammer_nod_rb_compare, int32_t);
8750964d 230
66325755
MD
231/*
232 * IO management - embedded at the head of various in-memory structures
233 */
234enum hammer_io_type { HAMMER_STRUCTURE_VOLUME,
235 HAMMER_STRUCTURE_SUPERCL,
236 HAMMER_STRUCTURE_CLUSTER,
237 HAMMER_STRUCTURE_BUFFER };
238
239union hammer_io_structure;
240
241struct worklist {
242 LIST_ENTRY(worklist) node;
243};
244
245struct hammer_io {
246 struct worklist worklist;
247 struct hammer_lock lock;
248 enum hammer_io_type type;
249 struct buf *bp;
250 int64_t offset;
251 u_int modified : 1; /* bp's data was modified */
252 u_int released : 1; /* bp released (w/ B_LOCKED set) */
253};
254
8cd0a023
MD
255typedef struct hammer_io *hammer_io_t;
256
66325755 257/*
8cd0a023 258 * In-memory volume representing on-disk buffer
66325755 259 */
8750964d 260struct hammer_volume {
66325755 261 struct hammer_io io;
8750964d
MD
262 RB_ENTRY(hammer_volume) rb_node;
263 struct hammer_clu_rb_tree rb_clus_root;
427e5fc6 264 struct hammer_scl_rb_tree rb_scls_root;
8750964d 265 struct hammer_volume_ondisk *ondisk;
427e5fc6 266 struct hammer_alist_live alist;
8750964d
MD
267 int32_t vol_no;
268 int32_t vol_clsize;
d26d0ae9 269 int32_t clu_iterator; /* cluster allocation iterator */
fbc6e32a 270 int64_t nblocks; /* note: special calculation for statfs */
8750964d 271 int64_t cluster_base; /* base offset of cluster 0 */
c60bb2c5 272 char *vol_name;
8750964d
MD
273 struct vnode *devvp;
274 struct hammer_mount *hmp;
427e5fc6 275 int vol_flags;
8750964d
MD
276};
277
8cd0a023
MD
278typedef struct hammer_volume *hammer_volume_t;
279
66325755 280/*
8cd0a023 281 * In-memory super-cluster representing on-disk buffer
66325755 282 */
427e5fc6 283struct hammer_supercl {
66325755 284 struct hammer_io io;
427e5fc6 285 RB_ENTRY(hammer_supercl) rb_node;
427e5fc6
MD
286 struct hammer_supercl_ondisk *ondisk;
287 struct hammer_volume *volume;
288 struct hammer_alist_live alist;
289 int32_t scl_no;
427e5fc6 290};
c60bb2c5 291
8cd0a023
MD
292typedef struct hammer_supercl *hammer_supercl_t;
293
fbc6e32a
MD
294enum hammer_cluster_state {
295 HAMMER_CLUSTER_IDLE,
296 HAMMER_CLUSTER_ASYNC,
297 HAMMER_CLUSTER_OPEN
298};
299
66325755 300/*
8cd0a023
MD
301 * In-memory cluster representing on-disk buffer
302 *
303 * The cluster's indexing range is cached in hammer_cluster, separate
304 * from the ondisk info in order to allow cursors to point to it.
66325755 305 */
8750964d 306struct hammer_cluster {
66325755 307 struct hammer_io io;
8750964d 308 RB_ENTRY(hammer_cluster) rb_node;
427e5fc6 309 struct hammer_buf_rb_tree rb_bufs_root;
8750964d
MD
310 struct hammer_cluster_ondisk *ondisk;
311 struct hammer_volume *volume;
427e5fc6
MD
312 struct hammer_alist_live alist_master;
313 struct hammer_alist_live alist_btree;
314 struct hammer_alist_live alist_record;
315 struct hammer_alist_live alist_mdata;
8cd0a023
MD
316 struct hammer_nod_rb_tree rb_nods_root; /* cursors in cluster */
317 struct hammer_base_elm clu_btree_beg; /* copy of on-disk info */
318 struct hammer_base_elm clu_btree_end; /* copy of on-disk info */
8750964d 319 int32_t clu_no;
fbc6e32a 320 enum hammer_cluster_state state;
427e5fc6
MD
321};
322
8cd0a023
MD
323typedef struct hammer_cluster *hammer_cluster_t;
324
66325755 325/*
8cd0a023
MD
326 * In-memory buffer (other then volume, super-cluster, or cluster),
327 * representing an on-disk buffer.
66325755 328 */
427e5fc6 329struct hammer_buffer {
66325755 330 struct hammer_io io;
427e5fc6 331 RB_ENTRY(hammer_buffer) rb_node;
427e5fc6 332 hammer_fsbuf_ondisk_t ondisk;
427e5fc6 333 struct hammer_volume *volume;
8cd0a023 334 struct hammer_cluster *cluster;
427e5fc6 335 int32_t buf_no;
8cd0a023
MD
336 u_int64_t buf_type;
337 struct hammer_alist_live alist;
338 struct hammer_node_list clist;
339 struct hammer_node *save_scan;
66325755
MD
340};
341
8cd0a023
MD
342typedef struct hammer_buffer *hammer_buffer_t;
343
344/*
345 * In-memory B-Tree node, representing an on-disk B-Tree node.
346 *
347 * This is a hang-on structure which is backed by a hammer_buffer,
348 * indexed by a hammer_cluster, and used for fine-grained locking of
349 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
350 * can contain multiple nodes representing wildly disassociated portions
351 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
352 *
353 * This structure uses a cluster-relative index to reduce the number
354 * of layers required to access it, and also because all on-disk B-Tree
355 * references are cluster-relative offsets.
356 */
357struct hammer_node {
358 struct hammer_lock lock; /* node-by-node lock */
359 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */
360 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */
361 int32_t node_offset; /* cluster-rel offset */
362 struct hammer_cluster *cluster;
363 struct hammer_buffer *buffer; /* backing buffer */
364 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */
365 struct hammer_node **cache1; /* passive cache(s) */
366 struct hammer_node **cache2;
367};
368
369typedef struct hammer_node *hammer_node_t;
370
371/*
372 * Common I/O management structure - embedded in in-memory structures
373 * which are backed by filesystem buffers.
374 */
66325755
MD
375union hammer_io_structure {
376 struct hammer_io io;
377 struct hammer_volume volume;
378 struct hammer_supercl supercl;
379 struct hammer_cluster cluster;
380 struct hammer_buffer buffer;
8750964d
MD
381};
382
427e5fc6
MD
383#define HAMFS_CLUSTER_DIRTY 0x0001
384
8cd0a023
MD
385#include "hammer_cursor.h"
386
8750964d
MD
387/*
388 * Internal hammer mount data structure
389 */
390struct hammer_mount {
391 struct mount *mp;
27ea2398 392 /*struct vnode *rootvp;*/
8750964d
MD
393 struct hammer_ino_rb_tree rb_inos_root;
394 struct hammer_vol_rb_tree rb_vols_root;
395 struct hammer_volume *rootvol;
396 struct hammer_cluster *rootcl;
d26d0ae9 397 char *zbuf; /* HAMMER_BUFSIZE bytes worth of all-zeros */
195c19a1
MD
398 int hflags;
399 int ronly;
400 int nvolumes;
d26d0ae9 401 int volume_iterator;
8750964d 402 uuid_t fsid;
66325755 403 udev_t fsid_udev;
7f7c1f84 404 hammer_tid_t asof;
66325755 405 u_int32_t namekey_iterator;
8750964d
MD
406};
407
8cd0a023 408typedef struct hammer_mount *hammer_mount_t;
8750964d 409
fbc6e32a
MD
410struct hammer_sync_info {
411 int error;
412 int waitfor;
413};
414
8750964d
MD
415#endif
416
417#if defined(_KERNEL)
418
419extern struct vop_ops hammer_vnode_vops;
7a04d74f
MD
420extern struct vop_ops hammer_spec_vops;
421extern struct vop_ops hammer_fifo_vops;
427e5fc6
MD
422extern struct hammer_alist_config Buf_alist_config;
423extern struct hammer_alist_config Vol_normal_alist_config;
424extern struct hammer_alist_config Vol_super_alist_config;
425extern struct hammer_alist_config Supercl_alist_config;
426extern struct hammer_alist_config Clu_master_alist_config;
427extern struct hammer_alist_config Clu_slave_alist_config;
66325755 428extern struct bio_ops hammer_bioops;
427e5fc6 429
8750964d
MD
430int hammer_vop_inactive(struct vop_inactive_args *);
431int hammer_vop_reclaim(struct vop_reclaim_args *);
7f7c1f84 432int hammer_vfs_vget(struct mount *mp, ino_t ino, struct vnode **vpp);
66325755
MD
433int hammer_get_vnode(struct hammer_inode *ip, int lktype,
434 struct vnode **vpp);
8cd0a023 435struct hammer_inode *hammer_get_inode(hammer_mount_t hmp,
7f7c1f84
MD
436 u_int64_t obj_id, hammer_tid_t asof, int *errorp);
437int hammer_update_inode(hammer_inode_t ip);
66325755
MD
438void hammer_put_inode(struct hammer_inode *ip);
439void hammer_put_inode_ref(struct hammer_inode *ip);
440
8cd0a023
MD
441int hammer_unload_inode(hammer_inode_t ip, void *data __unused);
442int hammer_unload_volume(hammer_volume_t volume, void *data __unused);
a89aec1b
MD
443int hammer_unload_supercl(hammer_supercl_t supercl, void *data __unused);
444int hammer_unload_cluster(hammer_cluster_t cluster, void *data __unused);
445int hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
8cd0a023
MD
446int hammer_install_volume(hammer_mount_t hmp, const char *volname);
447
a89aec1b
MD
448int hammer_ip_lookup(hammer_cursor_t cursor, hammer_inode_t ip);
449int hammer_ip_first(hammer_cursor_t cursor, hammer_inode_t ip);
450int hammer_ip_next(hammer_cursor_t cursor);
8cd0a023 451int hammer_ip_resolve_data(hammer_cursor_t cursor);
195c19a1
MD
452int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_tid_t tid);
453
fbc6e32a
MD
454int hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
455int hammer_sync_volume(hammer_volume_t volume, void *data);
456int hammer_sync_cluster(hammer_cluster_t cluster, void *data);
457int hammer_sync_buffer(hammer_buffer_t buffer, void *data);
458
8cd0a023 459hammer_record_t
7f7c1f84 460 hammer_alloc_mem_record(hammer_inode_t ip);
a89aec1b 461void hammer_rel_mem_record(struct hammer_record **recordp);
d26d0ae9 462void hammer_drop_mem_record(hammer_record_t record, int delete);
8cd0a023 463
195c19a1 464int hammer_cursor_up(hammer_cursor_t cursor, int nonblock);
8cd0a023
MD
465int hammer_cursor_toroot(hammer_cursor_t cursor);
466int hammer_cursor_down(hammer_cursor_t cursor);
467
468void hammer_lock_ex(struct hammer_lock *lock);
469int hammer_lock_ex_try(struct hammer_lock *lock);
470void hammer_lock_sh(struct hammer_lock *lock);
427e5fc6 471void hammer_unlock(struct hammer_lock *lock);
66325755
MD
472void hammer_ref(struct hammer_lock *lock);
473void hammer_unref(struct hammer_lock *lock);
8cd0a023
MD
474void hammer_downgrade(struct hammer_lock *lock);
475
66325755 476u_int32_t hammer_to_unix_xid(uuid_t *uuid);
8cd0a023
MD
477void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
478void hammer_to_timespec(hammer_tid_t tid, struct timespec *ts);
479hammer_tid_t hammer_timespec_to_transid(struct timespec *ts);
a89aec1b 480hammer_tid_t hammer_alloc_tid(hammer_transaction_t trans);
7f7c1f84 481hammer_tid_t hammer_now_tid(void);
a89aec1b 482hammer_tid_t hammer_alloc_recid(hammer_transaction_t trans);
8cd0a023 483
66325755 484enum vtype hammer_get_vnode_type(u_int8_t obj_type);
6b4f890b 485int hammer_get_dtype(u_int8_t obj_type);
66325755
MD
486u_int8_t hammer_get_obj_type(enum vtype vtype);
487int64_t hammer_directory_namekey(void *name, int len);
427e5fc6 488
8cd0a023 489int hammer_init_cursor_hmp(hammer_cursor_t cursor, hammer_mount_t hmp);
d26d0ae9 490int hammer_init_cursor_cluster(hammer_cursor_t cursor, hammer_cluster_t cluster);
8cd0a023 491int hammer_init_cursor_ip(hammer_cursor_t cursor, hammer_inode_t ip);
195c19a1 492
8cd0a023 493void hammer_done_cursor(hammer_cursor_t cursor);
6b4f890b 494void hammer_mem_done(hammer_cursor_t cursor);
8cd0a023
MD
495
496int hammer_btree_lookup(hammer_cursor_t cursor);
d26d0ae9 497int hammer_btree_first(hammer_cursor_t cursor);
8cd0a023
MD
498int hammer_btree_extract(hammer_cursor_t cursor, int flags);
499int hammer_btree_iterate(hammer_cursor_t cursor);
500int hammer_btree_insert(hammer_cursor_t cursor, hammer_btree_elm_t elm);
501int hammer_btree_delete(hammer_cursor_t cursor);
502int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
d26d0ae9 503int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
c0ade690
MD
504void hammer_print_btree_node(hammer_node_ondisk_t ondisk);
505void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
8750964d 506
c60bb2c5 507void *hammer_bread(struct hammer_cluster *cluster, int32_t cloff,
8cd0a023
MD
508 u_int64_t buf_type, int *errorp,
509 struct hammer_buffer **bufferp);
510
511hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
512hammer_cluster_t hammer_get_root_cluster(hammer_mount_t hmp, int *errorp);
427e5fc6 513
8cd0a023 514hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
427e5fc6 515 int32_t vol_no, int *errorp);
8cd0a023 516hammer_supercl_t hammer_get_supercl(hammer_volume_t volume,
427e5fc6 517 int32_t scl_no, int *errorp, int isnew);
8cd0a023 518hammer_cluster_t hammer_get_cluster(hammer_volume_t volume,
427e5fc6 519 int32_t clu_no, int *errorp, int isnew);
8cd0a023
MD
520hammer_buffer_t hammer_get_buffer(hammer_cluster_t cluster,
521 int32_t buf_no, u_int64_t buf_type, int *errorp);
522
fbc6e32a 523int hammer_ref_volume(hammer_volume_t volume);
8cd0a023
MD
524int hammer_ref_cluster(hammer_cluster_t cluster);
525int hammer_ref_buffer(hammer_buffer_t buffer);
526void hammer_flush_buffer_nodes(hammer_buffer_t buffer);
527
528
529void hammer_rel_volume(hammer_volume_t volume, int flush);
530void hammer_rel_supercl(hammer_supercl_t supercl, int flush);
531void hammer_rel_cluster(hammer_cluster_t cluster, int flush);
532void hammer_rel_buffer(hammer_buffer_t buffer, int flush);
533
534hammer_node_t hammer_get_node(hammer_cluster_t cluster,
535 int32_t node_offset, int *errorp);
536int hammer_ref_node(hammer_node_t node);
537void hammer_rel_node(hammer_node_t node);
538void hammer_cache_node(hammer_node_t node,
539 struct hammer_node **cache);
540void hammer_uncache_node(struct hammer_node **cache);
541void hammer_flush_node(hammer_node_t node);
542
427e5fc6
MD
543void hammer_dup_buffer(struct hammer_buffer **bufferp,
544 struct hammer_buffer *buffer);
545void hammer_dup_cluster(struct hammer_cluster **clusterp,
546 struct hammer_cluster *cluster);
d26d0ae9
MD
547hammer_cluster_t hammer_alloc_cluster(hammer_mount_t hmp,
548 hammer_cluster_t cluster_hint, int *errorp);
549void hammer_init_cluster(hammer_cluster_t cluster,
550 hammer_base_elm_t left_bound,
551 hammer_base_elm_t right_bound);
8cd0a023 552hammer_node_t hammer_alloc_btree(struct hammer_cluster *cluster, int *errorp);
427e5fc6
MD
553void *hammer_alloc_data(struct hammer_cluster *cluster, int32_t bytes,
554 int *errorp, struct hammer_buffer **bufferp);
555void *hammer_alloc_record(struct hammer_cluster *cluster,
556 int *errorp, struct hammer_buffer **bufferp);
427e5fc6
MD
557void hammer_free_data_ptr(struct hammer_buffer *buffer,
558 void *data, int bytes);
559void hammer_free_record_ptr(struct hammer_buffer *buffer,
560 union hammer_record_ondisk *rec);
d26d0ae9 561void hammer_free_cluster(hammer_cluster_t cluster);
427e5fc6
MD
562void hammer_free_btree(struct hammer_cluster *cluster, int32_t bclu_offset);
563void hammer_free_data(struct hammer_cluster *cluster, int32_t bclu_offset,
564 int32_t bytes);
565void hammer_free_record(struct hammer_cluster *cluster, int32_t bclu_offset);
566
66325755
MD
567void hammer_put_volume(struct hammer_volume *volume, int flush);
568void hammer_put_supercl(struct hammer_supercl *supercl, int flush);
569void hammer_put_cluster(struct hammer_cluster *cluster, int flush);
570void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
427e5fc6
MD
571
572void hammer_init_alist_config(void);
8750964d 573
8cd0a023
MD
574void hammer_start_transaction(struct hammer_transaction *trans,
575 struct hammer_mount *hmp);
66325755
MD
576void hammer_commit_transaction(struct hammer_transaction *trans);
577void hammer_abort_transaction(struct hammer_transaction *trans);
578
579void hammer_modify_inode(struct hammer_transaction *trans,
8cd0a023
MD
580 hammer_inode_t ip, int flags);
581int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
582 struct ucred *cred, struct hammer_inode *dip,
583 struct hammer_inode **ipp);
a89aec1b 584void hammer_rel_inode(hammer_inode_t ip, int flush);
c0ade690 585int hammer_sync_inode(hammer_inode_t ip, int waitfor, int handle_delete);
8cd0a023 586
a89aec1b 587int hammer_ip_add_directory(struct hammer_transaction *trans,
8cd0a023
MD
588 hammer_inode_t dip, struct namecache *ncp,
589 hammer_inode_t nip);
a89aec1b 590int hammer_ip_del_directory(struct hammer_transaction *trans,
8cd0a023
MD
591 hammer_cursor_t cursor, hammer_inode_t dip,
592 hammer_inode_t ip);
7a04d74f
MD
593int hammer_ip_add_record(struct hammer_transaction *trans,
594 hammer_record_t record);
a89aec1b 595int hammer_ip_delete_range(struct hammer_transaction *trans,
d26d0ae9
MD
596 hammer_inode_t ip, int64_t ran_beg, int64_t ran_end,
597 struct hammer_cursor **spikep);
7a04d74f
MD
598int hammer_ip_delete_range_all(struct hammer_transaction *trans,
599 hammer_inode_t ip);
c0ade690 600int hammer_ip_sync_data(struct hammer_transaction *trans,
8cd0a023 601 hammer_inode_t ip, int64_t offset,
d26d0ae9
MD
602 void *data, int bytes, struct hammer_cursor **spikep);
603int hammer_ip_sync_record(hammer_record_t rec, struct hammer_cursor **spikep);
604int hammer_write_record(hammer_cursor_t cursor, hammer_record_ondisk_t rec,
605 void *data, int cursor_flags);
606
607void hammer_load_spike(hammer_cursor_t cursor, struct hammer_cursor **spikep);
608int hammer_spike(struct hammer_cursor **spikep);
66325755
MD
609
610int hammer_io_read(struct vnode *devvp, struct hammer_io *io);
611int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
612void hammer_io_release(struct hammer_io *io, int flush);
8cd0a023 613int hammer_io_checkflush(hammer_io_t io);
fbc6e32a
MD
614void hammer_io_notify_cluster(hammer_cluster_t cluster);
615void hammer_io_flush(struct hammer_io *io, struct hammer_sync_info *info);
0b075555
MD
616void hammer_io_intend_modify(struct hammer_io *io);
617void hammer_io_modify_done(struct hammer_io *io);
66325755 618
8750964d
MD
619#endif
620
427e5fc6
MD
621/*
622 * Inline support functions (not kernel specific)
623 */
624static __inline void
625hammer_modify_volume(struct hammer_volume *volume)
626{
66325755 627 volume->io.modified = 1;
0b075555
MD
628 ++volume->io.lock.modifying;
629 if (volume->io.released)
630 hammer_io_intend_modify(&volume->io);
631}
632
633static __inline void
634hammer_modify_volume_done(struct hammer_volume *volume)
635{
636 hammer_io_modify_done(&volume->io);
427e5fc6
MD
637}
638
639static __inline void
640hammer_modify_supercl(struct hammer_supercl *supercl)
641{
66325755 642 supercl->io.modified = 1;
0b075555
MD
643 ++supercl->io.lock.modifying;
644 if (supercl->io.released)
645 hammer_io_intend_modify(&supercl->io);
646}
647
648static __inline void
649hammer_modify_supercl_done(struct hammer_supercl *supercl)
650{
651 hammer_io_modify_done(&supercl->io);
427e5fc6
MD
652}
653
654static __inline void
655hammer_modify_cluster(struct hammer_cluster *cluster)
656{
66325755 657 cluster->io.modified = 1;
0b075555
MD
658 ++cluster->io.lock.modifying;
659 if (cluster->io.released)
660 hammer_io_intend_modify(&cluster->io);
661}
662
663static __inline void
664hammer_modify_cluster_done(struct hammer_cluster *cluster)
665{
666 hammer_io_modify_done(&cluster->io);
427e5fc6
MD
667}
668
669static __inline void
670hammer_modify_buffer(struct hammer_buffer *buffer)
671{
fbc6e32a 672 hammer_io_notify_cluster(buffer->cluster);
66325755 673 buffer->io.modified = 1;
0b075555
MD
674 ++buffer->io.lock.modifying;
675 if (buffer->io.released)
676 hammer_io_intend_modify(&buffer->io);
677}
678
679static __inline void
680hammer_modify_buffer_done(struct hammer_buffer *buffer)
681{
682 hammer_io_modify_done(&buffer->io);
427e5fc6
MD
683}
684
8cd0a023
MD
685static __inline void
686hammer_modify_node(struct hammer_node *node)
687{
fbc6e32a 688 hammer_modify_buffer(node->buffer);
8cd0a023
MD
689}
690
0b075555
MD
691static __inline void
692hammer_modify_node_done(struct hammer_node *node)
693{
694 hammer_modify_buffer_done(node->buffer);
695}
696
427e5fc6
MD
697/*
698 * Return the cluster-relative byte offset of an element within a buffer
699 */
700static __inline int
701hammer_bclu_offset(struct hammer_buffer *buffer, void *ptr)
702{
703 int bclu_offset;
704
705 bclu_offset = buffer->buf_no * HAMMER_BUFSIZE +
706 ((char *)ptr - (char *)buffer->ondisk);
707 return(bclu_offset);
708}
709