Tiny step to keep ether header in mbuf on ethernet input path:
[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 *
bf686dbe 34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.40 2008/03/18 05:19:15 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>
427e5fc6 59#include "hammer_disk.h"
8750964d 60#include "hammer_mount.h"
7dc57964 61#include "hammer_ioctl.h"
8750964d
MD
62
63#if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
64
65MALLOC_DECLARE(M_HAMMER);
66
66325755
MD
67struct hammer_mount;
68
8750964d
MD
69/*
70 * Key structure used for custom RB tree inode lookups. This prototypes
71 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
72 */
73typedef struct hammer_inode_info {
513ca7d7 74 int64_t obj_id; /* (key) object identifier */
8750964d
MD
75 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
76} *hammer_inode_info_t;
77
66325755
MD
78/*
79 * HAMMER Transaction tracking
80 */
81struct hammer_transaction {
82 struct hammer_mount *hmp;
83 hammer_tid_t tid;
a89aec1b 84 struct hammer_volume *rootvol;
46fe7ae1 85/* TAILQ_HEAD(, hammer_io) recycle_list;*/
66325755
MD
86};
87
8cd0a023
MD
88typedef struct hammer_transaction *hammer_transaction_t;
89
66325755
MD
90/*
91 * HAMMER locks
92 */
427e5fc6 93struct hammer_lock {
0b075555 94 int refs; /* active references delay writes */
0b075555 95 int lockcount; /* lock count for exclusive/shared access */
427e5fc6
MD
96 int wanted;
97 struct thread *locktd;
8750964d
MD
98};
99
427e5fc6
MD
100static __inline int
101hammer_islocked(struct hammer_lock *lock)
102{
8cd0a023 103 return(lock->lockcount != 0);
427e5fc6
MD
104}
105
0b075555
MD
106static __inline int
107hammer_isactive(struct hammer_lock *lock)
108{
109 return(lock->refs != 0);
110}
111
427e5fc6
MD
112static __inline int
113hammer_islastref(struct hammer_lock *lock)
114{
115 return(lock->refs == 1);
116}
c60bb2c5 117
6a37e7e4
MD
118/*
119 * This inline is specifically optimized for the case where the caller
120 * owns the lock, but wants to know what kind of lock he owns. A
121 * negative value indicates a shared lock, a positive value indicates
122 * an exclusive lock.
123 */
124static __inline int
125hammer_lock_held(struct hammer_lock *lock)
126{
127 return(lock->lockcount);
128}
129
8750964d 130/*
8cd0a023
MD
131 * Structure used to represent an inode in-memory.
132 *
133 * The record and data associated with an inode may be out of sync with
134 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
135 * clear).
136 *
137 * An inode may also hold a cache of unsynchronized records, used for
138 * database and directories only. Unsynchronized regular file data is
139 * stored in the buffer cache.
140 *
141 * NOTE: A file which is created and destroyed within the initial
142 * synchronization period can wind up not doing any disk I/O at all.
143 *
144 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
8750964d
MD
145 */
146struct hammer_ino_rb_tree;
147struct hammer_inode;
148RB_HEAD(hammer_ino_rb_tree, hammer_inode);
149RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
8cd0a023
MD
150 hammer_ino_rb_compare, hammer_inode_info_t);
151
152struct hammer_rec_rb_tree;
153struct hammer_record;
154RB_HEAD(hammer_rec_rb_tree, hammer_record);
155RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
156 hammer_rec_rb_compare, hammer_base_elm_t);
157
158TAILQ_HEAD(hammer_node_list, hammer_node);
8750964d
MD
159
160struct hammer_inode {
161 RB_ENTRY(hammer_inode) rb_node;
162 u_int64_t obj_id; /* (key) object identifier */
163 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
8cd0a023 164 hammer_tid_t last_tid; /* last modified tid (for fsync) */
66325755
MD
165 struct hammer_mount *hmp;
166 int flags;
c60bb2c5 167 struct vnode *vp;
66325755 168 struct lockf advlock;
8cd0a023 169 struct hammer_lock lock;
c60bb2c5
MD
170 struct hammer_inode_record ino_rec;
171 struct hammer_inode_data ino_data;
8cd0a023 172 struct hammer_rec_rb_tree rec_tree; /* red-black record tree */
61aeeb33 173 struct hammer_node *cache[2]; /* search initiate cache */
8750964d
MD
174};
175
8cd0a023
MD
176typedef struct hammer_inode *hammer_inode_t;
177
66325755
MD
178#define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
179
8cd0a023
MD
180#define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
181#define HAMMER_INODE_RDIRTY 0x0002 /* in-memory ino_rec is dirty */
182#define HAMMER_INODE_ITIMES 0x0004 /* in-memory mtime/atime modified */
d113fda1 183#define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records present */
8cd0a023 184#define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
a89aec1b 185#define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
c0ade690 186#define HAMMER_INODE_DELETED 0x0080 /* inode ready for deletion */
76376933 187#define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
d113fda1
MD
188#define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */
189#define HAMMER_INODE_GONE 0x0400 /* delete flushed out */
0a72edae 190#define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */
f3b0f382 191#define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */
42c7d26b 192#define HAMMER_INODE_TIDLOCKED 0x2000 /* tid locked until inode synced */
8cd0a023 193
0b075555 194#define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_RDIRTY| \
f3b0f382 195 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \
d113fda1 196 HAMMER_INODE_ITIMES|HAMMER_INODE_DELETED)
0b075555 197
8cd0a023 198#define HAMMER_MAX_INODE_CURSORS 4
66325755 199
8750964d 200/*
8cd0a023
MD
201 * Structure used to represent an unsynchronized record in-memory. This
202 * structure is orgranized in a per-inode RB-tree. If the inode is not
203 * on disk then neither are any records and the in-memory record tree
204 * represents the entire contents of the inode. If the inode is on disk
205 * then the on-disk B-Tree is scanned in parallel with the in-memory
206 * RB-Tree to synthesize the current state of the file.
207 *
208 * Only current (delete_tid == 0) unsynchronized records are kept in-memory.
b33e2cc0
MD
209 *
210 * blocked is the count of the number of cursors (ip_first/ip_next) blocked
211 * on the record waiting for a synchronization to complete.
8750964d 212 */
8cd0a023
MD
213struct hammer_record {
214 RB_ENTRY(hammer_record) rb_node;
a89aec1b 215 struct hammer_lock lock;
8cd0a023
MD
216 struct hammer_inode *ip;
217 union hammer_record_ondisk rec;
218 union hammer_data_ondisk *data;
8cd0a023 219 int flags;
b33e2cc0 220 int blocked;
8cd0a023 221};
8750964d 222
8cd0a023
MD
223typedef struct hammer_record *hammer_record_t;
224
225#define HAMMER_RECF_ALLOCDATA 0x0001
226#define HAMMER_RECF_ONRBTREE 0x0002
a89aec1b 227#define HAMMER_RECF_DELETED 0x0004
40043e7f 228#define HAMMER_RECF_INBAND 0x0008
b3deaf57 229#define HAMMER_RECF_SYNCING 0x0010
b33e2cc0 230#define HAMMER_RECF_WANTED 0x0020
8cd0a023
MD
231
232/*
47197d71 233 * In-memory structures representing on-disk structures.
8cd0a023 234 */
8750964d 235struct hammer_volume;
427e5fc6 236struct hammer_buffer;
8cd0a023 237struct hammer_node;
8750964d 238RB_HEAD(hammer_vol_rb_tree, hammer_volume);
427e5fc6 239RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
8cd0a023 240RB_HEAD(hammer_nod_rb_tree, hammer_node);
8750964d
MD
241
242RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
243 hammer_vol_rb_compare, int32_t);
427e5fc6 244RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
47197d71 245 hammer_buf_rb_compare, hammer_off_t);
8cd0a023 246RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
47197d71 247 hammer_nod_rb_compare, hammer_off_t);
8750964d 248
66325755
MD
249/*
250 * IO management - embedded at the head of various in-memory structures
251 */
252enum hammer_io_type { HAMMER_STRUCTURE_VOLUME,
66325755
MD
253 HAMMER_STRUCTURE_BUFFER };
254
255union hammer_io_structure;
055f5ff8 256struct hammer_io;
66325755
MD
257
258struct worklist {
259 LIST_ENTRY(worklist) node;
260};
261
055f5ff8
MD
262TAILQ_HEAD(hammer_io_list, hammer_io);
263
66325755
MD
264struct hammer_io {
265 struct worklist worklist;
266 struct hammer_lock lock;
267 enum hammer_io_type type;
268 struct buf *bp;
269 int64_t offset;
055f5ff8
MD
270 TAILQ_ENTRY(hammer_io) entry; /* based on modified flag */
271 struct hammer_io_list *entry_list;
272 struct hammer_io_list deplist;
66325755
MD
273 u_int modified : 1; /* bp's data was modified */
274 u_int released : 1; /* bp released (w/ B_LOCKED set) */
055f5ff8
MD
275 u_int running : 1; /* bp write IO in progress */
276 u_int waiting : 1; /* someone is waiting on us */
eaeff70d 277 u_int loading : 1; /* ondisk is loading */
b33e2cc0 278 u_int validated : 1; /* ondisk has been validated */
66325755
MD
279};
280
8cd0a023
MD
281typedef struct hammer_io *hammer_io_t;
282
66325755 283/*
8cd0a023 284 * In-memory volume representing on-disk buffer
66325755 285 */
8750964d 286struct hammer_volume {
66325755 287 struct hammer_io io;
8750964d 288 RB_ENTRY(hammer_volume) rb_node;
47197d71 289 struct hammer_buf_rb_tree rb_bufs_root;
8750964d
MD
290 struct hammer_volume_ondisk *ondisk;
291 int32_t vol_no;
fbc6e32a 292 int64_t nblocks; /* note: special calculation for statfs */
47197d71
MD
293 int64_t buffer_base; /* base offset of buffer 0 */
294 hammer_off_t maxbuf_off; /* Maximum buffer offset */
c60bb2c5 295 char *vol_name;
8750964d
MD
296 struct vnode *devvp;
297 struct hammer_mount *hmp;
427e5fc6 298 int vol_flags;
8750964d
MD
299};
300
8cd0a023
MD
301typedef struct hammer_volume *hammer_volume_t;
302
66325755 303/*
8cd0a023
MD
304 * In-memory buffer (other then volume, super-cluster, or cluster),
305 * representing an on-disk buffer.
66325755 306 */
427e5fc6 307struct hammer_buffer {
66325755 308 struct hammer_io io;
427e5fc6 309 RB_ENTRY(hammer_buffer) rb_node;
47197d71 310 void *ondisk;
427e5fc6 311 struct hammer_volume *volume;
34d829f7
MD
312 hammer_off_t zone2_offset;
313 hammer_off_t zoneX_offset;
8cd0a023 314 struct hammer_node_list clist;
66325755
MD
315};
316
8cd0a023
MD
317typedef struct hammer_buffer *hammer_buffer_t;
318
319/*
320 * In-memory B-Tree node, representing an on-disk B-Tree node.
321 *
322 * This is a hang-on structure which is backed by a hammer_buffer,
323 * indexed by a hammer_cluster, and used for fine-grained locking of
324 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
325 * can contain multiple nodes representing wildly disassociated portions
326 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
327 *
328 * This structure uses a cluster-relative index to reduce the number
329 * of layers required to access it, and also because all on-disk B-Tree
330 * references are cluster-relative offsets.
331 */
332struct hammer_node {
333 struct hammer_lock lock; /* node-by-node lock */
334 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */
335 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */
47197d71 336 hammer_off_t node_offset; /* full offset spec */
40043e7f 337 struct hammer_mount *hmp;
8cd0a023
MD
338 struct hammer_buffer *buffer; /* backing buffer */
339 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */
340 struct hammer_node **cache1; /* passive cache(s) */
341 struct hammer_node **cache2;
b3deaf57 342 int flags;
8cd0a023
MD
343};
344
b3deaf57
MD
345#define HAMMER_NODE_DELETED 0x0001
346#define HAMMER_NODE_FLUSH 0x0002
b3deaf57 347
8cd0a023
MD
348typedef struct hammer_node *hammer_node_t;
349
b33e2cc0
MD
350/*
351 * List of locked nodes.
352 */
353struct hammer_node_locklist {
354 struct hammer_node_locklist *next;
355 hammer_node_t node;
356};
357
358typedef struct hammer_node_locklist *hammer_node_locklist_t;
359
360
8cd0a023
MD
361/*
362 * Common I/O management structure - embedded in in-memory structures
363 * which are backed by filesystem buffers.
364 */
66325755
MD
365union hammer_io_structure {
366 struct hammer_io io;
367 struct hammer_volume volume;
66325755 368 struct hammer_buffer buffer;
8750964d
MD
369};
370
055f5ff8
MD
371typedef union hammer_io_structure *hammer_io_structure_t;
372
bf686dbe
MD
373/*
374 * Allocation holes are recorded for a short period of time in an attempt
375 * to use up the space.
376 */
377
378#define HAMMER_MAX_HOLES 8
379
380struct hammer_hole;
381
382struct hammer_holes {
383 TAILQ_HEAD(, hammer_hole) list;
384 int count;
385};
386
387typedef struct hammer_holes *hammer_holes_t;
388
389struct hammer_hole {
390 TAILQ_ENTRY(hammer_hole) entry;
391 hammer_off_t offset;
392 int bytes;
393};
394
395typedef struct hammer_hole *hammer_hole_t;
427e5fc6 396
8cd0a023
MD
397#include "hammer_cursor.h"
398
8750964d
MD
399/*
400 * Internal hammer mount data structure
401 */
402struct hammer_mount {
403 struct mount *mp;
27ea2398 404 /*struct vnode *rootvp;*/
8750964d
MD
405 struct hammer_ino_rb_tree rb_inos_root;
406 struct hammer_vol_rb_tree rb_vols_root;
40043e7f 407 struct hammer_nod_rb_tree rb_nods_root;
8750964d 408 struct hammer_volume *rootvol;
47197d71
MD
409 struct hammer_base_elm root_btree_beg;
410 struct hammer_base_elm root_btree_end;
d26d0ae9 411 char *zbuf; /* HAMMER_BUFSIZE bytes worth of all-zeros */
195c19a1
MD
412 int hflags;
413 int ronly;
414 int nvolumes;
d26d0ae9 415 int volume_iterator;
8750964d 416 uuid_t fsid;
66325755 417 udev_t fsid_udev;
7f7c1f84 418 hammer_tid_t asof;
66325755 419 u_int32_t namekey_iterator;
f03c9cf4 420 hammer_off_t zone_limits[HAMMER_MAX_ZONES];
513ca7d7 421 struct netexport export;
40043e7f 422 struct lock blockmap_lock;
bf686dbe 423 struct hammer_holes holes[HAMMER_MAX_ZONES];
8750964d
MD
424};
425
8cd0a023 426typedef struct hammer_mount *hammer_mount_t;
8750964d 427
fbc6e32a
MD
428struct hammer_sync_info {
429 int error;
430 int waitfor;
431};
432
8750964d
MD
433#endif
434
435#if defined(_KERNEL)
436
437extern struct vop_ops hammer_vnode_vops;
7a04d74f
MD
438extern struct vop_ops hammer_spec_vops;
439extern struct vop_ops hammer_fifo_vops;
66325755 440extern struct bio_ops hammer_bioops;
427e5fc6 441
d5ef456e 442extern int hammer_debug_general;
b3deaf57 443extern int hammer_debug_btree;
d113fda1 444extern int hammer_debug_tid;
b33e2cc0 445extern int hammer_debug_recover;
46fe7ae1 446extern int hammer_debug_recover_faults;
b3deaf57
MD
447extern int hammer_count_inodes;
448extern int hammer_count_records;
449extern int hammer_count_record_datas;
450extern int hammer_count_volumes;
b3deaf57
MD
451extern int hammer_count_buffers;
452extern int hammer_count_nodes;
b3deaf57 453
8750964d
MD
454int hammer_vop_inactive(struct vop_inactive_args *);
455int hammer_vop_reclaim(struct vop_reclaim_args *);
66325755
MD
456int hammer_get_vnode(struct hammer_inode *ip, int lktype,
457 struct vnode **vpp);
8cd0a023 458struct hammer_inode *hammer_get_inode(hammer_mount_t hmp,
61aeeb33 459 struct hammer_node **cache,
d113fda1
MD
460 u_int64_t obj_id, hammer_tid_t asof, int flags,
461 int *errorp);
66325755
MD
462void hammer_put_inode(struct hammer_inode *ip);
463void hammer_put_inode_ref(struct hammer_inode *ip);
464
d113fda1 465int hammer_unload_inode(hammer_inode_t ip, void *data);
8cd0a023 466int hammer_unload_volume(hammer_volume_t volume, void *data __unused);
a89aec1b 467int hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
8cd0a023
MD
468int hammer_install_volume(hammer_mount_t hmp, const char *volname);
469
a89aec1b
MD
470int hammer_ip_lookup(hammer_cursor_t cursor, hammer_inode_t ip);
471int hammer_ip_first(hammer_cursor_t cursor, hammer_inode_t ip);
472int hammer_ip_next(hammer_cursor_t cursor);
40043e7f 473int hammer_ip_resolve_record_and_data(hammer_cursor_t cursor);
8cd0a023 474int hammer_ip_resolve_data(hammer_cursor_t cursor);
195c19a1 475int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_tid_t tid);
7dc57964 476int hammer_delete_at_cursor(hammer_cursor_t cursor, int64_t *stat_bytes);
b3deaf57
MD
477int hammer_ip_check_directory_empty(hammer_transaction_t trans,
478 hammer_inode_t ip);
fbc6e32a
MD
479int hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
480int hammer_sync_volume(hammer_volume_t volume, void *data);
fbc6e32a
MD
481int hammer_sync_buffer(hammer_buffer_t buffer, void *data);
482
8cd0a023 483hammer_record_t
40043e7f 484 hammer_alloc_mem_record(hammer_inode_t ip);
b3deaf57 485void hammer_rel_mem_record(hammer_record_t record);
8cd0a023 486
6a37e7e4 487int hammer_cursor_up(hammer_cursor_t cursor);
8cd0a023 488int hammer_cursor_down(hammer_cursor_t cursor);
6a37e7e4
MD
489int hammer_cursor_upgrade(hammer_cursor_t cursor);
490void hammer_cursor_downgrade(hammer_cursor_t cursor);
32c90105
MD
491int hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
492 int index);
8cd0a023
MD
493void hammer_lock_ex(struct hammer_lock *lock);
494int hammer_lock_ex_try(struct hammer_lock *lock);
495void hammer_lock_sh(struct hammer_lock *lock);
6a37e7e4
MD
496int hammer_lock_upgrade(struct hammer_lock *lock);
497void hammer_lock_downgrade(struct hammer_lock *lock);
427e5fc6 498void hammer_unlock(struct hammer_lock *lock);
66325755
MD
499void hammer_ref(struct hammer_lock *lock);
500void hammer_unref(struct hammer_lock *lock);
8cd0a023 501
66325755 502u_int32_t hammer_to_unix_xid(uuid_t *uuid);
8cd0a023
MD
503void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
504void hammer_to_timespec(hammer_tid_t tid, struct timespec *ts);
505hammer_tid_t hammer_timespec_to_transid(struct timespec *ts);
a89aec1b 506hammer_tid_t hammer_alloc_tid(hammer_transaction_t trans);
7f7c1f84 507hammer_tid_t hammer_now_tid(void);
d113fda1 508hammer_tid_t hammer_str_to_tid(const char *str);
8cd0a023 509
66325755 510enum vtype hammer_get_vnode_type(u_int8_t obj_type);
6b4f890b 511int hammer_get_dtype(u_int8_t obj_type);
66325755
MD
512u_int8_t hammer_get_obj_type(enum vtype vtype);
513int64_t hammer_directory_namekey(void *name, int len);
427e5fc6 514
47197d71
MD
515int hammer_init_cursor_hmp(hammer_cursor_t cursor,
516 struct hammer_node **cache, hammer_mount_t hmp);
195c19a1 517
8cd0a023 518void hammer_done_cursor(hammer_cursor_t cursor);
6b4f890b 519void hammer_mem_done(hammer_cursor_t cursor);
8cd0a023
MD
520
521int hammer_btree_lookup(hammer_cursor_t cursor);
d26d0ae9 522int hammer_btree_first(hammer_cursor_t cursor);
32c90105 523int hammer_btree_last(hammer_cursor_t cursor);
8cd0a023
MD
524int hammer_btree_extract(hammer_cursor_t cursor, int flags);
525int hammer_btree_iterate(hammer_cursor_t cursor);
32c90105 526int hammer_btree_iterate_reverse(hammer_cursor_t cursor);
8cd0a023
MD
527int hammer_btree_insert(hammer_cursor_t cursor, hammer_btree_elm_t elm);
528int hammer_btree_delete(hammer_cursor_t cursor);
529int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
d26d0ae9 530int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
32c90105
MD
531int hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
532int hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
533
fe7678ee 534
b33e2cc0
MD
535int hammer_btree_lock_children(hammer_cursor_t cursor,
536 struct hammer_node_locklist **locklistp);
537void hammer_btree_unlock_children(struct hammer_node_locklist **locklistp);
538
c0ade690
MD
539void hammer_print_btree_node(hammer_node_ondisk_t ondisk);
540void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
8750964d 541
47197d71
MD
542void *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
543 int *errorp, struct hammer_buffer **bufferp);
544void *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
545 int *errorp, struct hammer_buffer **bufferp);
8cd0a023
MD
546
547hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
427e5fc6 548
8cd0a023 549hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
427e5fc6 550 int32_t vol_no, int *errorp);
47197d71
MD
551hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp,
552 hammer_off_t buf_offset, int isnew, int *errorp);
8cd0a023 553
fbc6e32a 554int hammer_ref_volume(hammer_volume_t volume);
8cd0a023
MD
555int hammer_ref_buffer(hammer_buffer_t buffer);
556void hammer_flush_buffer_nodes(hammer_buffer_t buffer);
557
8cd0a023 558void hammer_rel_volume(hammer_volume_t volume, int flush);
8cd0a023
MD
559void hammer_rel_buffer(hammer_buffer_t buffer, int flush);
560
513ca7d7
MD
561int hammer_vfs_export(struct mount *mp, int op,
562 const struct export_args *export);
47197d71
MD
563hammer_node_t hammer_get_node(hammer_mount_t hmp,
564 hammer_off_t node_offset, int *errorp);
8cd0a023 565int hammer_ref_node(hammer_node_t node);
055f5ff8
MD
566hammer_node_t hammer_ref_node_safe(struct hammer_mount *hmp,
567 struct hammer_node **cache, int *errorp);
8cd0a023
MD
568void hammer_rel_node(hammer_node_t node);
569void hammer_cache_node(hammer_node_t node,
570 struct hammer_node **cache);
571void hammer_uncache_node(struct hammer_node **cache);
572void hammer_flush_node(hammer_node_t node);
573
427e5fc6
MD
574void hammer_dup_buffer(struct hammer_buffer **bufferp,
575 struct hammer_buffer *buffer);
47197d71
MD
576hammer_node_t hammer_alloc_btree(hammer_mount_t hmp, int *errorp);
577void *hammer_alloc_record(hammer_mount_t hmp,
bf686dbe 578 hammer_off_t *rec_offp, u_int16_t rec_type,
40043e7f
MD
579 struct hammer_buffer **rec_bufferp,
580 int32_t data_len, void **datap,
581 struct hammer_buffer **data_bufferp, int *errorp);
bf686dbe
MD
582void *hammer_alloc_data(hammer_mount_t hmp, int32_t data_len,
583 hammer_off_t *data_offsetp,
584 struct hammer_buffer **data_bufferp, int *errorp);
585
586int hammer_generate_undo(hammer_mount_t hmp, hammer_off_t zone1_offset,
47197d71 587 void *base, int len);
427e5fc6 588
66325755 589void hammer_put_volume(struct hammer_volume *volume, int flush);
66325755 590void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
427e5fc6 591
c3be93f2
MD
592hammer_off_t hammer_freemap_alloc(hammer_mount_t hmp, hammer_off_t owner,
593 int *errorp);
594void hammer_freemap_free(hammer_mount_t hmp, hammer_off_t phys_offset,
595 hammer_off_t owner, int *errorp);
40043e7f
MD
596hammer_off_t hammer_blockmap_alloc(hammer_mount_t hmp, int zone,
597 int bytes, int *errorp);
c3be93f2 598void hammer_blockmap_free(hammer_mount_t hmp, hammer_off_t bmap_off, int bytes);
bf686dbe
MD
599int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
600 int *curp, int *errorp);
40043e7f
MD
601hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
602 int *errorp);
bf686dbe
MD
603hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
604 int *errorp);
40043e7f 605
8cd0a023
MD
606void hammer_start_transaction(struct hammer_transaction *trans,
607 struct hammer_mount *hmp);
d113fda1
MD
608void hammer_start_transaction_tid(struct hammer_transaction *trans,
609 struct hammer_mount *hmp, hammer_tid_t tid);
66325755
MD
610void hammer_commit_transaction(struct hammer_transaction *trans);
611void hammer_abort_transaction(struct hammer_transaction *trans);
612
613void hammer_modify_inode(struct hammer_transaction *trans,
8cd0a023
MD
614 hammer_inode_t ip, int flags);
615int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
616 struct ucred *cred, struct hammer_inode *dip,
617 struct hammer_inode **ipp);
a89aec1b 618void hammer_rel_inode(hammer_inode_t ip, int flush);
c0ade690 619int hammer_sync_inode(hammer_inode_t ip, int waitfor, int handle_delete);
8cd0a023 620
a89aec1b 621int hammer_ip_add_directory(struct hammer_transaction *trans,
8cd0a023
MD
622 hammer_inode_t dip, struct namecache *ncp,
623 hammer_inode_t nip);
a89aec1b 624int hammer_ip_del_directory(struct hammer_transaction *trans,
8cd0a023
MD
625 hammer_cursor_t cursor, hammer_inode_t dip,
626 hammer_inode_t ip);
7a04d74f
MD
627int hammer_ip_add_record(struct hammer_transaction *trans,
628 hammer_record_t record);
a89aec1b 629int hammer_ip_delete_range(struct hammer_transaction *trans,
47197d71 630 hammer_inode_t ip, int64_t ran_beg, int64_t ran_end);
7a04d74f
MD
631int hammer_ip_delete_range_all(struct hammer_transaction *trans,
632 hammer_inode_t ip);
c0ade690 633int hammer_ip_sync_data(struct hammer_transaction *trans,
8cd0a023 634 hammer_inode_t ip, int64_t offset,
47197d71
MD
635 void *data, int bytes);
636int hammer_ip_sync_record(hammer_record_t rec);
66325755 637
7dc57964
MD
638int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
639 struct ucred *cred);
640
055f5ff8 641void hammer_io_init(hammer_io_t io, enum hammer_io_type type);
66325755
MD
642int hammer_io_read(struct vnode *devvp, struct hammer_io *io);
643int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
644void hammer_io_release(struct hammer_io *io, int flush);
055f5ff8 645void hammer_io_flush(struct hammer_io *io);
8cd0a023 646int hammer_io_checkflush(hammer_io_t io);
61aeeb33 647void hammer_io_clear_modify(struct hammer_io *io);
055f5ff8 648void hammer_io_waitdep(struct hammer_io *io);
66325755 649
47197d71
MD
650void hammer_modify_volume(hammer_volume_t volume, void *base, int len);
651void hammer_modify_buffer(hammer_buffer_t buffer, void *base, int len);
0b075555 652
bf686dbe
MD
653int hammer_reblock(hammer_inode_t ip, struct hammer_ioc_reblock *reblock);
654
655void hammer_init_holes(hammer_mount_t hmp, hammer_holes_t holes);
656void hammer_free_holes(hammer_mount_t hmp, hammer_holes_t holes);
657
055f5ff8 658#endif
427e5fc6 659
8cd0a023 660static __inline void
bf686dbe
MD
661hammer_modify_node_noundo(struct hammer_node *node)
662{
663 hammer_modify_buffer(node->buffer, NULL, 0);
664}
665
666static __inline void
667hammer_modify_node_all(struct hammer_node *node)
8cd0a023 668{
47197d71 669 hammer_modify_buffer(node->buffer, node->ondisk, sizeof(*node->ondisk));
427e5fc6
MD
670}
671
bf686dbe
MD
672static __inline void
673hammer_modify_node(struct hammer_node *node, void *base, int len)
674{
675 KKASSERT((char *)base >= (char *)node->ondisk &&
676 (char *)base + len <=
677 (char *)node->ondisk + sizeof(*node->ondisk));
678 hammer_modify_buffer(node->buffer, base, len);
679}
680
681static __inline void
682hammer_modify_record(struct hammer_buffer *buffer, void *base, int len)
683{
684 KKASSERT((char *)base >= (char *)buffer->ondisk &&
685 (char *)base + len <= (char *)buffer->ondisk + HAMMER_BUFSIZE);
686 hammer_modify_buffer(buffer, base, len);
687}
688