2 * Copyright (c) 2007-2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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
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.
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
34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.62 2008/05/06 00:21:07 dillon Exp $
37 * This header file contains structures used internally by the HAMMERFS
38 * implementation. See hammer_disk.h for on-disk structures.
41 #include <sys/param.h>
42 #include <sys/types.h>
43 #include <sys/kernel.h>
45 #include <sys/systm.h>
47 #include <sys/malloc.h>
48 #include <sys/mount.h>
49 #include <sys/mountctl.h>
50 #include <sys/vnode.h>
52 #include <sys/globaldata.h>
53 #include <sys/lockf.h>
55 #include <sys/queue.h>
56 #include <sys/globaldata.h>
59 #include <sys/signal2.h>
60 #include "hammer_disk.h"
61 #include "hammer_mount.h"
62 #include "hammer_ioctl.h"
64 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
66 MALLOC_DECLARE(M_HAMMER);
71 * Key structure used for custom RB tree inode lookups. This prototypes
72 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
74 typedef struct hammer_inode_info {
75 int64_t obj_id; /* (key) object identifier */
76 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */
77 } *hammer_inode_info_t;
79 typedef enum hammer_transaction_type {
83 } hammer_transaction_type_t;
86 * HAMMER Transaction tracking
88 struct hammer_transaction {
89 hammer_transaction_type_t type;
90 struct hammer_mount *hmp;
93 struct hammer_volume *rootvol;
96 typedef struct hammer_transaction *hammer_transaction_t;
102 int refs; /* active references delay writes */
103 int lockcount; /* lock count for exclusive/shared access */
105 struct thread *locktd;
109 hammer_islocked(struct hammer_lock *lock)
111 return(lock->lockcount != 0);
115 hammer_isactive(struct hammer_lock *lock)
117 return(lock->refs != 0);
121 hammer_islastref(struct hammer_lock *lock)
123 return(lock->refs == 1);
127 * Return if we specifically own the lock exclusively.
130 hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td)
132 if (lock->lockcount > 0 && lock->locktd == td)
138 * Flush state, used by various structures
140 typedef enum hammer_inode_state {
144 } hammer_inode_state_t;
146 TAILQ_HEAD(hammer_record_list, hammer_record);
149 * Cache object ids. A fixed number of objid cache structures are
150 * created to reserve object id's for newly created files in multiples
151 * of 100,000, localized to a particular directory, and recycled as
152 * needed. This allows parallel create operations in different
153 * directories to retain fairly localized object ids which in turn
154 * improves reblocking performance and layout.
156 #define OBJID_CACHE_SIZE 128
157 #define OBJID_CACHE_BULK 100000
159 typedef struct hammer_objid_cache {
160 TAILQ_ENTRY(hammer_objid_cache) entry;
161 struct hammer_inode *dip;
162 hammer_tid_t next_tid;
164 } *hammer_objid_cache_t;
167 * Structure used to represent an inode in-memory.
169 * The record and data associated with an inode may be out of sync with
170 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
173 * An inode may also hold a cache of unsynchronized records, used for
174 * database and directories only. Unsynchronized regular file data is
175 * stored in the buffer cache.
177 * NOTE: A file which is created and destroyed within the initial
178 * synchronization period can wind up not doing any disk I/O at all.
180 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
182 struct hammer_ino_rb_tree;
184 RB_HEAD(hammer_ino_rb_tree, hammer_inode);
185 RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
186 hammer_ino_rb_compare, hammer_inode_info_t);
188 struct hammer_rec_rb_tree;
189 struct hammer_record;
190 RB_HEAD(hammer_rec_rb_tree, hammer_record);
191 RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
192 hammer_rec_rb_compare, hammer_base_elm_t);
194 TAILQ_HEAD(hammer_node_list, hammer_node);
196 struct hammer_inode {
197 RB_ENTRY(hammer_inode) rb_node;
198 hammer_inode_state_t flush_state;
200 TAILQ_ENTRY(hammer_inode) flush_entry;
201 struct hammer_record_list target_list; /* target of dependant recs */
202 u_int64_t obj_id; /* (key) object identifier */
203 hammer_tid_t obj_asof; /* (key) snapshot or 0 */
204 struct hammer_mount *hmp;
205 hammer_objid_cache_t objid_cache;
207 int error; /* flush error */
208 int cursor_ip_refs; /* sanity */
210 struct lockf advlock;
211 struct hammer_lock lock; /* sync copy interlock */
212 TAILQ_HEAD(, bio) bio_list; /* BIOs to flush out */
213 TAILQ_HEAD(, bio) bio_alt_list; /* BIOs to flush out */
215 struct hammer_inode_record ino_rec; /* in-memory cache */
216 struct hammer_inode_data ino_data; /* in-memory cache */
217 struct hammer_rec_rb_tree rec_tree; /* in-memory cache */
218 struct hammer_node *cache[2]; /* search initiate cache */
221 * When a demark is created to synchronize an inode to
222 * disk, certain fields are copied so the front-end VOPs
223 * can continue to run in parallel with the synchronization
224 * occuring in the background.
226 int sync_flags; /* to-sync flags cache */
227 off_t sync_trunc_off; /* to-sync truncation */
228 struct hammer_inode_record sync_ino_rec;/* to-sync cache */
229 struct hammer_inode_data sync_ino_data; /* to-sync cache */
232 typedef struct hammer_inode *hammer_inode_t;
234 #define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
236 #define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
237 #define HAMMER_INODE_RDIRTY 0x0002 /* in-memory ino_rec is dirty */
238 #define HAMMER_INODE_ITIMES 0x0004 /* in-memory mtime/atime modified */
239 #define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records */
240 #define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
241 #define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
242 #define HAMMER_INODE_DELETED 0x0080 /* inode delete (backend) */
243 #define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
244 #define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */
245 #define HAMMER_INODE_VHELD 0x0400 /* vnode held on sync */
246 #define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */
247 #define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */
248 #define HAMMER_INODE_REFLUSH 0x2000 /* pipelined flush during flush */
249 #define HAMMER_INODE_WRITE_ALT 0x4000 /* strategy writes to alt bioq */
250 #define HAMMER_INODE_FLUSHW 0x8000 /* Someone waiting for flush */
252 #define HAMMER_INODE_TRUNCATED 0x00010000
253 #define HAMMER_INODE_DELETING 0x00020000 /* inode delete request (frontend)*/
254 #define HAMMER_INODE_RESIGNAL 0x00040000 /* re-signal on re-flush */
255 #define HAMMER_INODE_RESIGNAL 0x00040000 /* re-signal on re-flush */
257 #define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_RDIRTY| \
258 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \
259 HAMMER_INODE_ITIMES|HAMMER_INODE_TRUNCATED|\
260 HAMMER_INODE_DELETING)
262 #define HAMMER_INODE_MODMASK_NOXDIRTY \
263 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY)
265 #define HAMMER_MAX_INODE_CURSORS 4
267 #define HAMMER_FLUSH_SIGNAL 0x0001
268 #define HAMMER_FLUSH_RECURSION 0x0002
271 * Structure used to represent an unsynchronized record in-memory. These
272 * records typically represent directory entries. Only non-historical
273 * records are kept in-memory.
275 * Records are organized as a per-inode RB-Tree. If the inode is not
276 * on disk then neither are any records and the in-memory record tree
277 * represents the entire contents of the inode. If the inode is on disk
278 * then the on-disk B-Tree is scanned in parallel with the in-memory
279 * RB-Tree to synthesize the current state of the file.
281 * Records are also used to enforce the ordering of directory create/delete
282 * operations. A new inode will not be flushed to disk unless its related
283 * directory entry is also being flushed at the same time. A directory entry
284 * will not be removed unless its related inode is also being removed at the
287 typedef enum hammer_record_type {
288 HAMMER_MEM_RECORD_GENERAL, /* misc record */
289 HAMMER_MEM_RECORD_ADD, /* positive memory cache record */
290 HAMMER_MEM_RECORD_DEL /* negative delete-on-disk record */
291 } hammer_record_type_t;
293 struct hammer_record {
294 RB_ENTRY(hammer_record) rb_node;
295 TAILQ_ENTRY(hammer_record) target_entry;
296 hammer_inode_state_t flush_state;
298 hammer_record_type_t type;
299 struct hammer_lock lock;
300 struct hammer_inode *ip;
301 struct hammer_inode *target_ip;
302 union hammer_record_ondisk rec;
303 union hammer_data_ondisk *data;
307 typedef struct hammer_record *hammer_record_t;
310 * Record flags. Note that FE can only be set by the frontend if the
311 * record has not been interlocked by the backend w/ BE.
313 #define HAMMER_RECF_ALLOCDATA 0x0001
314 #define HAMMER_RECF_ONRBTREE 0x0002
315 #define HAMMER_RECF_DELETED_FE 0x0004 /* deleted (frontend) */
316 #define HAMMER_RECF_DELETED_BE 0x0008 /* deleted (backend) */
317 #define HAMMER_RECF_INBAND 0x0010
318 #define HAMMER_RECF_INTERLOCK_BE 0x0020 /* backend interlock */
319 #define HAMMER_RECF_WANTED 0x0040
320 #define HAMMER_RECF_CONVERT_DELETE 0x0100 /* special case */
323 * In-memory structures representing on-disk structures.
325 struct hammer_volume;
326 struct hammer_buffer;
329 RB_HEAD(hammer_vol_rb_tree, hammer_volume);
330 RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
331 RB_HEAD(hammer_nod_rb_tree, hammer_node);
332 RB_HEAD(hammer_und_rb_tree, hammer_undo);
334 RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
335 hammer_vol_rb_compare, int32_t);
336 RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
337 hammer_buf_rb_compare, hammer_off_t);
338 RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
339 hammer_nod_rb_compare, hammer_off_t);
340 RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node,
341 hammer_und_rb_compare, hammer_off_t);
344 * IO management - embedded at the head of various in-memory structures
346 * VOLUME - hammer_volume containing meta-data
347 * META_BUFFER - hammer_buffer containing meta-data
348 * DATA_BUFFER - hammer_buffer containing pure-data
350 * Dirty volume headers and dirty meta-data buffers are locked until the
351 * flusher can sequence them out. Dirty pure-data buffers can be written.
352 * Clean buffers can be passively released.
354 typedef enum hammer_io_type {
355 HAMMER_STRUCTURE_VOLUME,
356 HAMMER_STRUCTURE_META_BUFFER,
357 HAMMER_STRUCTURE_UNDO_BUFFER,
358 HAMMER_STRUCTURE_DATA_BUFFER
361 union hammer_io_structure;
365 LIST_ENTRY(worklist) node;
368 TAILQ_HEAD(hammer_io_list, hammer_io);
369 typedef struct hammer_io_list *hammer_io_list_t;
372 struct worklist worklist;
373 struct hammer_lock lock;
374 enum hammer_io_type type;
375 struct hammer_mount *hmp;
376 TAILQ_ENTRY(hammer_io) mod_entry; /* list entry if modified */
377 hammer_io_list_t mod_list;
380 int loading; /* loading/unloading interlock */
383 u_int modified : 1; /* bp's data was modified */
384 u_int released : 1; /* bp released (w/ B_LOCKED set) */
385 u_int running : 1; /* bp write IO in progress */
386 u_int waiting : 1; /* someone is waiting on us */
387 u_int validated : 1; /* ondisk has been validated */
388 u_int flush : 1; /* flush on last release */
389 u_int waitdep : 1; /* flush waits for dependancies */
392 typedef struct hammer_io *hammer_io_t;
395 * In-memory volume representing on-disk buffer
397 struct hammer_volume {
399 RB_ENTRY(hammer_volume) rb_node;
400 struct hammer_buf_rb_tree rb_bufs_root;
401 struct hammer_volume_ondisk *ondisk;
403 int64_t nblocks; /* note: special calculation for statfs */
404 int64_t buffer_base; /* base offset of buffer 0 */
405 hammer_off_t maxbuf_off; /* Maximum buffer offset */
411 typedef struct hammer_volume *hammer_volume_t;
414 * In-memory buffer (other then volume, super-cluster, or cluster),
415 * representing an on-disk buffer.
417 struct hammer_buffer {
419 RB_ENTRY(hammer_buffer) rb_node;
421 struct hammer_volume *volume;
422 hammer_off_t zone2_offset;
423 hammer_off_t zoneX_offset;
424 struct hammer_node_list clist;
427 typedef struct hammer_buffer *hammer_buffer_t;
430 * In-memory B-Tree node, representing an on-disk B-Tree node.
432 * This is a hang-on structure which is backed by a hammer_buffer,
433 * indexed by a hammer_cluster, and used for fine-grained locking of
434 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
435 * can contain multiple nodes representing wildly disassociated portions
436 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
438 * This structure uses a cluster-relative index to reduce the number
439 * of layers required to access it, and also because all on-disk B-Tree
440 * references are cluster-relative offsets.
443 struct hammer_lock lock; /* node-by-node lock */
444 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */
445 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */
446 hammer_off_t node_offset; /* full offset spec */
447 struct hammer_mount *hmp;
448 struct hammer_buffer *buffer; /* backing buffer */
449 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */
450 struct hammer_node **cache1; /* passive cache(s) */
451 struct hammer_node **cache2;
453 int loading; /* load interlock */
456 #define HAMMER_NODE_DELETED 0x0001
457 #define HAMMER_NODE_FLUSH 0x0002
459 typedef struct hammer_node *hammer_node_t;
462 * List of locked nodes.
464 struct hammer_node_locklist {
465 struct hammer_node_locklist *next;
469 typedef struct hammer_node_locklist *hammer_node_locklist_t;
473 * Common I/O management structure - embedded in in-memory structures
474 * which are backed by filesystem buffers.
476 union hammer_io_structure {
478 struct hammer_volume volume;
479 struct hammer_buffer buffer;
482 typedef union hammer_io_structure *hammer_io_structure_t;
485 * Allocation holes are recorded for a short period of time in an attempt
486 * to use up the space.
489 #define HAMMER_MAX_HOLES 8
493 struct hammer_holes {
494 TAILQ_HEAD(, hammer_hole) list;
498 typedef struct hammer_holes *hammer_holes_t;
501 TAILQ_ENTRY(hammer_hole) entry;
506 typedef struct hammer_hole *hammer_hole_t;
508 #include "hammer_cursor.h"
511 * Undo history tracking
513 #define HAMMER_MAX_UNDOS 256
516 RB_ENTRY(hammer_undo) rb_node;
517 TAILQ_ENTRY(hammer_undo) lru_entry;
522 typedef struct hammer_undo *hammer_undo_t;
525 * Internal hammer mount data structure
527 struct hammer_mount {
529 /*struct vnode *rootvp;*/
530 struct hammer_ino_rb_tree rb_inos_root;
531 struct hammer_vol_rb_tree rb_vols_root;
532 struct hammer_nod_rb_tree rb_nods_root;
533 struct hammer_und_rb_tree rb_undo_root;
534 struct hammer_volume *rootvol;
535 struct hammer_base_elm root_btree_beg;
536 struct hammer_base_elm root_btree_end;
537 char *zbuf; /* HAMMER_BUFSIZE bytes worth of all-zeros */
542 int flusher_signal; /* flusher thread sequencer */
543 int flusher_act; /* currently active flush group */
544 int flusher_done; /* set to act when complete */
545 int flusher_next; /* next flush group */
546 int flusher_lock; /* lock sequencing of the next flush */
548 hammer_off_t flusher_undo_start; /* UNDO window for flushes */
551 u_int check_interrupt;
554 struct hammer_io_list volu_list; /* dirty undo buffers */
555 struct hammer_io_list undo_list; /* dirty undo buffers */
556 struct hammer_io_list data_list; /* dirty data buffers */
557 struct hammer_io_list meta_list; /* dirty meta bufs */
558 struct hammer_io_list lose_list; /* loose buffers */
559 int locked_dirty_count; /* meta/volu count */
560 int io_running_count;
561 int objid_cache_count;
563 hammer_off_t next_tid;
564 u_int32_t namekey_iterator;
565 hammer_off_t zone_limits[HAMMER_MAX_ZONES];
566 struct netexport export;
567 struct hammer_lock sync_lock;
568 struct hammer_lock free_lock;
569 struct lock blockmap_lock;
570 struct hammer_blockmap blockmap[HAMMER_MAX_ZONES];
571 struct hammer_holes holes[HAMMER_MAX_ZONES];
572 struct hammer_undo undos[HAMMER_MAX_UNDOS];
574 TAILQ_HEAD(, hammer_undo) undo_lru_list;
575 TAILQ_HEAD(, hammer_inode) flush_list;
576 TAILQ_HEAD(, hammer_objid_cache) objid_cache_list;
579 typedef struct hammer_mount *hammer_mount_t;
581 struct hammer_sync_info {
590 extern struct vop_ops hammer_vnode_vops;
591 extern struct vop_ops hammer_spec_vops;
592 extern struct vop_ops hammer_fifo_vops;
593 extern struct bio_ops hammer_bioops;
595 extern int hammer_debug_general;
596 extern int hammer_debug_debug;
597 extern int hammer_debug_inode;
598 extern int hammer_debug_locks;
599 extern int hammer_debug_btree;
600 extern int hammer_debug_tid;
601 extern int hammer_debug_recover;
602 extern int hammer_debug_recover_faults;
603 extern int hammer_count_inodes;
604 extern int hammer_count_records;
605 extern int hammer_count_record_datas;
606 extern int hammer_count_volumes;
607 extern int hammer_count_buffers;
608 extern int hammer_count_nodes;
609 extern int hammer_count_dirtybufs;
610 extern int hammer_limit_dirtybufs;
611 extern int hammer_bio_count;
612 extern int64_t hammer_contention_count;
614 int hammer_vop_inactive(struct vop_inactive_args *);
615 int hammer_vop_reclaim(struct vop_reclaim_args *);
616 int hammer_get_vnode(struct hammer_inode *ip, struct vnode **vpp);
617 struct hammer_inode *hammer_get_inode(hammer_transaction_t trans,
618 struct hammer_node **cache,
619 u_int64_t obj_id, hammer_tid_t asof, int flags,
621 void hammer_put_inode(struct hammer_inode *ip);
622 void hammer_put_inode_ref(struct hammer_inode *ip);
624 int hammer_unload_volume(hammer_volume_t volume, void *data __unused);
625 int hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
626 int hammer_install_volume(hammer_mount_t hmp, const char *volname);
628 int hammer_ip_lookup(hammer_cursor_t cursor, hammer_inode_t ip);
629 int hammer_ip_first(hammer_cursor_t cursor);
630 int hammer_ip_next(hammer_cursor_t cursor);
631 int hammer_ip_resolve_record_and_data(hammer_cursor_t cursor);
632 int hammer_ip_resolve_data(hammer_cursor_t cursor);
633 int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_tid_t tid);
634 int hammer_delete_at_cursor(hammer_cursor_t cursor, int64_t *stat_bytes);
635 int hammer_ip_check_directory_empty(hammer_transaction_t trans,
636 hammer_cursor_t parent_cursor, hammer_inode_t ip);
637 int hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
640 hammer_alloc_mem_record(hammer_inode_t ip);
641 void hammer_flush_record_done(hammer_record_t record, int error);
642 void hammer_wait_mem_record(hammer_record_t record);
643 void hammer_rel_mem_record(hammer_record_t record);
645 int hammer_cursor_up(hammer_cursor_t cursor);
646 int hammer_cursor_down(hammer_cursor_t cursor);
647 int hammer_cursor_upgrade(hammer_cursor_t cursor);
648 void hammer_cursor_downgrade(hammer_cursor_t cursor);
649 int hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
651 void hammer_lock_ex(struct hammer_lock *lock);
652 int hammer_lock_ex_try(struct hammer_lock *lock);
653 void hammer_lock_sh(struct hammer_lock *lock);
654 int hammer_lock_upgrade(struct hammer_lock *lock);
655 void hammer_lock_downgrade(struct hammer_lock *lock);
656 void hammer_unlock(struct hammer_lock *lock);
657 void hammer_ref(struct hammer_lock *lock);
658 void hammer_unref(struct hammer_lock *lock);
660 u_int32_t hammer_to_unix_xid(uuid_t *uuid);
661 void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
662 void hammer_to_timespec(hammer_tid_t tid, struct timespec *ts);
663 hammer_tid_t hammer_timespec_to_transid(struct timespec *ts);
664 hammer_tid_t hammer_now_tid(void);
665 hammer_tid_t hammer_str_to_tid(const char *str);
666 hammer_tid_t hammer_alloc_objid(hammer_transaction_t trans, hammer_inode_t dip);
667 void hammer_clear_objid(hammer_inode_t dip);
668 void hammer_destroy_objid_cache(hammer_mount_t hmp);
670 int hammer_enter_undo_history(hammer_mount_t hmp, hammer_off_t offset,
672 void hammer_clear_undo_history(hammer_mount_t hmp);
673 enum vtype hammer_get_vnode_type(u_int8_t obj_type);
674 int hammer_get_dtype(u_int8_t obj_type);
675 u_int8_t hammer_get_obj_type(enum vtype vtype);
676 int64_t hammer_directory_namekey(void *name, int len);
678 int hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor,
679 struct hammer_node **cache, hammer_inode_t ip);
680 int hammer_reinit_cursor(hammer_cursor_t cursor);
681 void hammer_normalize_cursor(hammer_cursor_t cursor);
682 void hammer_done_cursor(hammer_cursor_t cursor);
683 void hammer_mem_done(hammer_cursor_t cursor);
685 int hammer_btree_lookup(hammer_cursor_t cursor);
686 int hammer_btree_first(hammer_cursor_t cursor);
687 int hammer_btree_last(hammer_cursor_t cursor);
688 int hammer_btree_extract(hammer_cursor_t cursor, int flags);
689 int hammer_btree_iterate(hammer_cursor_t cursor);
690 int hammer_btree_iterate_reverse(hammer_cursor_t cursor);
691 int hammer_btree_insert(hammer_cursor_t cursor, hammer_btree_elm_t elm);
692 int hammer_btree_delete(hammer_cursor_t cursor);
693 int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
694 int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
695 int hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
696 int hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
699 int hammer_btree_lock_children(hammer_cursor_t cursor,
700 struct hammer_node_locklist **locklistp);
702 void hammer_print_btree_node(hammer_node_ondisk_t ondisk);
703 void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
705 void *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
706 int *errorp, struct hammer_buffer **bufferp);
707 void *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
708 int *errorp, struct hammer_buffer **bufferp);
710 hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
711 int hammer_dowrite(hammer_cursor_t cursor, hammer_inode_t ip,
714 hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
715 int32_t vol_no, int *errorp);
716 hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp,
717 hammer_off_t buf_offset, int isnew, int *errorp);
718 void hammer_uncache_buffer(struct hammer_mount *hmp, hammer_off_t off);
720 int hammer_ref_volume(hammer_volume_t volume);
721 int hammer_ref_buffer(hammer_buffer_t buffer);
722 void hammer_flush_buffer_nodes(hammer_buffer_t buffer);
724 void hammer_rel_volume(hammer_volume_t volume, int flush);
725 void hammer_rel_buffer(hammer_buffer_t buffer, int flush);
727 int hammer_vfs_export(struct mount *mp, int op,
728 const struct export_args *export);
729 hammer_node_t hammer_get_node(hammer_mount_t hmp, hammer_off_t node_offset,
730 int isnew, int *errorp);
731 void hammer_ref_node(hammer_node_t node);
732 hammer_node_t hammer_ref_node_safe(struct hammer_mount *hmp,
733 struct hammer_node **cache, int *errorp);
734 void hammer_rel_node(hammer_node_t node);
735 void hammer_delete_node(hammer_transaction_t trans,
737 void hammer_cache_node(hammer_node_t node,
738 struct hammer_node **cache);
739 void hammer_uncache_node(struct hammer_node **cache);
740 void hammer_flush_node(hammer_node_t node);
742 void hammer_dup_buffer(struct hammer_buffer **bufferp,
743 struct hammer_buffer *buffer);
744 hammer_node_t hammer_alloc_btree(hammer_transaction_t trans, int *errorp);
745 void *hammer_alloc_record(hammer_transaction_t trans,
746 hammer_off_t *rec_offp, u_int16_t rec_type,
747 struct hammer_buffer **rec_bufferp,
748 int32_t data_len, void **datap,
749 hammer_off_t *data_offp,
750 struct hammer_buffer **data_bufferp, int *errorp);
751 void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len,
752 hammer_off_t *data_offsetp,
753 struct hammer_buffer **data_bufferp, int *errorp);
755 int hammer_generate_undo(hammer_transaction_t trans, hammer_io_t io,
756 hammer_off_t zone1_offset, void *base, int len);
758 void hammer_put_volume(struct hammer_volume *volume, int flush);
759 void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
761 hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans,
762 hammer_off_t owner, int *errorp);
763 void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset,
764 hammer_off_t owner, int *errorp);
765 hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone,
766 int bytes, int *errorp);
767 void hammer_blockmap_free(hammer_transaction_t trans,
768 hammer_off_t bmap_off, int bytes);
769 int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
770 int *curp, int *errorp);
771 hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
773 hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
775 int64_t hammer_undo_used(hammer_mount_t hmp);
776 int64_t hammer_undo_space(hammer_mount_t hmp);
777 int64_t hammer_undo_max(hammer_mount_t hmp);
780 void hammer_start_transaction(struct hammer_transaction *trans,
781 struct hammer_mount *hmp);
782 void hammer_simple_transaction(struct hammer_transaction *trans,
783 struct hammer_mount *hmp);
784 void hammer_start_transaction_fls(struct hammer_transaction *trans,
785 struct hammer_mount *hmp);
786 void hammer_done_transaction(struct hammer_transaction *trans);
788 void hammer_modify_inode(struct hammer_transaction *trans,
789 hammer_inode_t ip, int flags);
790 void hammer_flush_inode(hammer_inode_t ip, int flags);
791 void hammer_flush_inode_done(hammer_inode_t ip);
792 void hammer_wait_inode(hammer_inode_t ip);
794 int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
795 struct ucred *cred, struct hammer_inode *dip,
796 struct hammer_inode **ipp);
797 void hammer_rel_inode(hammer_inode_t ip, int flush);
798 int hammer_sync_inode(hammer_inode_t ip);
799 void hammer_test_inode(hammer_inode_t ip);
800 void hammer_inode_unloadable_check(hammer_inode_t ip, int getvp);
802 int hammer_ip_add_directory(struct hammer_transaction *trans,
803 hammer_inode_t dip, struct namecache *ncp,
805 int hammer_ip_del_directory(struct hammer_transaction *trans,
806 hammer_cursor_t cursor, hammer_inode_t dip,
808 int hammer_ip_add_record(struct hammer_transaction *trans,
809 hammer_record_t record);
810 int hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
811 int64_t ran_beg, int64_t ran_end);
812 int hammer_ip_delete_range_all(hammer_cursor_t cursor, hammer_inode_t ip,
814 int hammer_ip_sync_data(hammer_cursor_t cursor, hammer_inode_t ip,
815 int64_t offset, void *data, int bytes);
816 int hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec);
817 int hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t rec);
819 int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
822 void hammer_io_init(hammer_io_t io, hammer_mount_t hmp,
823 enum hammer_io_type type);
824 void hammer_io_reinit(hammer_io_t io, enum hammer_io_type type);
825 int hammer_io_read(struct vnode *devvp, struct hammer_io *io);
826 int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
827 void hammer_io_release(struct hammer_io *io);
828 void hammer_io_flush(struct hammer_io *io);
829 int hammer_io_checkflush(hammer_io_t io);
830 void hammer_io_clear_modify(struct hammer_io *io);
831 void hammer_io_waitdep(struct hammer_io *io);
833 void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume,
834 void *base, int len);
835 void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer,
836 void *base, int len);
837 void hammer_modify_volume_done(hammer_volume_t volume);
838 void hammer_modify_buffer_done(hammer_buffer_t buffer);
840 int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
841 struct hammer_ioc_reblock *reblock);
843 void hammer_init_holes(hammer_mount_t hmp, hammer_holes_t holes);
844 void hammer_free_holes(hammer_mount_t hmp, hammer_holes_t holes);
845 int hammer_signal_check(hammer_mount_t hmp);
847 void hammer_flusher_create(hammer_mount_t hmp);
848 void hammer_flusher_destroy(hammer_mount_t hmp);
849 void hammer_flusher_sync(hammer_mount_t hmp);
850 void hammer_flusher_async(hammer_mount_t hmp);
852 int hammer_recover(hammer_mount_t hmp, hammer_volume_t rootvol);
854 void hammer_crc_set_blockmap(hammer_blockmap_t blockmap);
855 void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk);
857 int hammer_crc_test_blockmap(hammer_blockmap_t blockmap);
858 int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk);
859 int hammer_crc_test_record(hammer_record_ondisk_t ondisk);
860 int hammer_crc_test_btree(hammer_node_ondisk_t ondisk);
861 void hkprintf(const char *ctl, ...);
866 hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node)
868 hammer_modify_buffer(trans, node->buffer, NULL, 0);
872 hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node)
874 hammer_modify_buffer(trans, node->buffer,
875 node->ondisk, sizeof(*node->ondisk));
879 hammer_modify_node(hammer_transaction_t trans, hammer_node_t node,
882 hammer_crc_t *crcptr;
884 KKASSERT((char *)base >= (char *)node->ondisk &&
885 (char *)base + len <=
886 (char *)node->ondisk + sizeof(*node->ondisk));
887 hammer_modify_buffer(trans, node->buffer, base, len);
888 crcptr = &node->ondisk->crc;
889 hammer_modify_buffer(trans, node->buffer, crcptr, sizeof(hammer_crc_t));
890 --node->buffer->io.modify_refs; /* only want one ref */
894 hammer_modify_node_done(hammer_node_t node)
896 node->ondisk->crc = crc32(&node->ondisk->crc + 1, HAMMER_BTREE_CRCSIZE);
897 hammer_modify_buffer_done(node->buffer);
901 hammer_modify_record_noundo(hammer_transaction_t trans, hammer_buffer_t buffer,
902 hammer_record_ondisk_t rec __unused)
904 hammer_modify_buffer(trans, buffer, NULL, 0);
908 hammer_modify_record_all(hammer_transaction_t trans, hammer_buffer_t buffer,
909 hammer_record_ondisk_t rec)
911 KKASSERT((char *)rec >= (char *)buffer->ondisk &&
912 (char *)(rec + 1) <= (char *)buffer->ondisk + HAMMER_BUFSIZE);
913 hammer_modify_buffer(trans, buffer, rec, sizeof(*rec));
917 hammer_modify_record(hammer_transaction_t trans, hammer_buffer_t buffer,
918 hammer_record_ondisk_t rec, void *base, int len,
921 KKASSERT((char *)base >= (char *)buffer->ondisk &&
922 (char *)base + len <= (char *)buffer->ondisk + HAMMER_BUFSIZE);
923 KKASSERT((char *)rec >= (char *)buffer->ondisk &&
924 (char *)(rec + 1) <= (char *)buffer->ondisk + HAMMER_BUFSIZE);
927 * Due to undo overheads it is more efficient to just undo the whole
930 hammer_modify_buffer(trans, buffer, rec, sizeof(*rec));
932 hammer_modify_buffer(trans, buffer, base, len);
933 hammer_modify_buffer(trans, buffer, &rec->base.rec_crc,
934 sizeof(rec->base.rec_crc));
935 --node->buffer->io.modify_refs; /* only want one ref */
937 hammer_modify_buffer(trans, buffer, &rec->base.signature,
938 sizeof(rec->base.signature));
939 --node->buffer->io.modify_refs; /* only want one ref */
945 hammer_modify_record_done(hammer_buffer_t buffer, hammer_record_ondisk_t rec)
947 rec->base.rec_crc = crc32(&rec->base.rec_crc + 1,
948 HAMMER_RECORD_CRCSIZE);
949 hammer_modify_buffer_done(buffer);
952 #define hammer_modify_volume_field(trans, vol, field) \
953 hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \
954 sizeof((vol)->ondisk->field))
956 #define hammer_modify_node_field(trans, node, field) \
957 hammer_modify_node(trans, node, &(node)->ondisk->field, \
958 sizeof((node)->ondisk->field))
960 #define hammer_modify_record_field(trans, buffer, rec, field, dodelete) \
961 hammer_modify_record(trans, buffer, rec, &(rec)->field, \
962 sizeof((rec)->field), dodelete)