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