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.130 2008/11/13 02:18:43 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>
54 #include <sys/globaldata.h>
55 #include <sys/lockf.h>
57 #include <sys/queue.h>
59 #include <sys/globaldata.h>
60 #include <sys/limits.h>
63 #include <sys/signal2.h>
64 #include <sys/mplock2.h>
65 #include "hammer_disk.h"
66 #include "hammer_mount.h"
67 #include "hammer_ioctl.h"
69 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
71 MALLOC_DECLARE(M_HAMMER
);
76 #if !defined(KTR_HAMMER)
77 #define KTR_HAMMER KTR_ALL
79 KTR_INFO_MASTER_EXTERN(hammer
);
87 * Key structure used for custom RB tree inode lookups. This prototypes
88 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
90 typedef struct hammer_inode_info
{
91 int64_t obj_id
; /* (key) object identifier */
92 hammer_tid_t obj_asof
; /* (key) snapshot transid or 0 */
93 u_int32_t obj_localization
; /* (key) pseudo-fs */
95 struct hammer_btree_leaf_elm
*leaf
;
97 } *hammer_inode_info_t
;
99 typedef enum hammer_transaction_type
{
103 } hammer_transaction_type_t
;
106 * HAMMER Transaction tracking
108 struct hammer_transaction
{
109 hammer_transaction_type_t type
;
110 struct hammer_mount
*hmp
;
116 struct hammer_volume
*rootvol
;
119 typedef struct hammer_transaction
*hammer_transaction_t
;
121 #define HAMMER_TRANSF_NEWINODE 0x0001
122 #define HAMMER_TRANSF_DIDIO 0x0002
123 #define HAMMER_TRANSF_CRCDOM 0x0004 /* EDOM on CRC error, less critical */
129 int refs
; /* active references delay writes */
130 volatile u_int lockval
; /* lock count and control bits */
131 struct thread
*owner
; /* owner if exclusively held */
134 #define HAMMER_LOCKF_EXCLUSIVE 0x40000000
135 #define HAMMER_LOCKF_WANTED 0x80000000
138 hammer_notlocked(struct hammer_lock
*lock
)
140 return(lock
->lockval
== 0);
144 hammer_islocked(struct hammer_lock
*lock
)
146 return(lock
->lockval
!= 0);
150 hammer_isactive(struct hammer_lock
*lock
)
152 return(lock
->refs
!= 0);
156 hammer_islastref(struct hammer_lock
*lock
)
158 return(lock
->refs
== 1);
162 * Return if we specifically own the lock exclusively.
165 hammer_lock_excl_owned(struct hammer_lock
*lock
, thread_t td
)
167 if ((lock
->lockval
& HAMMER_LOCKF_EXCLUSIVE
) &&
175 * Flush state, used by various structures
177 typedef enum hammer_inode_state
{
181 } hammer_inode_state_t
;
183 TAILQ_HEAD(hammer_record_list
, hammer_record
);
186 * Pseudo-filesystem extended data tracking
188 struct hammer_pfs_rb_tree
;
189 struct hammer_pseudofs_inmem
;
190 RB_HEAD(hammer_pfs_rb_tree
, hammer_pseudofs_inmem
);
191 RB_PROTOTYPE2(hammer_pfs_rb_tree
, hammer_pseudofs_inmem
, rb_node
,
192 hammer_pfs_rb_compare
, u_int32_t
);
194 struct hammer_pseudofs_inmem
{
195 RB_ENTRY(hammer_pseudofs_inmem
) rb_node
;
196 struct hammer_lock lock
;
197 u_int32_t localization
;
198 hammer_tid_t create_tid
;
201 struct hammer_pseudofs_data pfsd
;
204 typedef struct hammer_pseudofs_inmem
*hammer_pseudofs_inmem_t
;
206 #define HAMMER_PFSM_DELETED 0x0001
209 * Cache object ids. A fixed number of objid cache structures are
210 * created to reserve object id's for newly created files in multiples
211 * of 100,000, localized to a particular directory, and recycled as
212 * needed. This allows parallel create operations in different
213 * directories to retain fairly localized object ids which in turn
214 * improves reblocking performance and layout.
216 #define OBJID_CACHE_SIZE 1024
217 #define OBJID_CACHE_BULK_BITS 10 /* 10 bits (1024) */
218 #define OBJID_CACHE_BULK (32 * 32) /* two level (1024) */
219 #define OBJID_CACHE_BULK_MASK (OBJID_CACHE_BULK - 1)
220 #define OBJID_CACHE_BULK_MASK64 ((u_int64_t)(OBJID_CACHE_BULK - 1))
222 typedef struct hammer_objid_cache
{
223 TAILQ_ENTRY(hammer_objid_cache
) entry
;
224 struct hammer_inode
*dip
;
225 hammer_tid_t base_tid
;
229 } *hammer_objid_cache_t
;
232 * Associate an inode with a B-Tree node to cache search start positions
234 typedef struct hammer_node_cache
{
235 TAILQ_ENTRY(hammer_node_cache
) entry
;
236 struct hammer_node
*node
;
237 struct hammer_inode
*ip
;
238 } *hammer_node_cache_t
;
240 TAILQ_HEAD(hammer_node_cache_list
, hammer_node_cache
);
243 * Structure used to organize flush groups. Flush groups must be
244 * organized into chunks in order to avoid blowing out the UNDO FIFO.
245 * Without this a 'sync' could end up flushing 50,000 inodes in a single
248 struct hammer_fls_rb_tree
;
249 RB_HEAD(hammer_fls_rb_tree
, hammer_inode
);
250 RB_PROTOTYPE(hammer_fls_rb_tree
, hammer_inode
, rb_flsnode
,
251 hammer_ino_rb_compare
);
253 struct hammer_flush_group
{
254 TAILQ_ENTRY(hammer_flush_group
) flush_entry
;
255 struct hammer_fls_rb_tree flush_tree
;
257 int total_count
; /* record load */
258 int running
; /* group is running */
263 typedef struct hammer_flush_group
*hammer_flush_group_t
;
265 TAILQ_HEAD(hammer_flush_group_list
, hammer_flush_group
);
268 * Structure used to represent an inode in-memory.
270 * The record and data associated with an inode may be out of sync with
271 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
274 * An inode may also hold a cache of unsynchronized records, used for
275 * database and directories only. Unsynchronized regular file data is
276 * stored in the buffer cache.
278 * NOTE: A file which is created and destroyed within the initial
279 * synchronization period can wind up not doing any disk I/O at all.
281 * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
283 struct hammer_ino_rb_tree
;
285 RB_HEAD(hammer_ino_rb_tree
, hammer_inode
);
286 RB_PROTOTYPEX(hammer_ino_rb_tree
, INFO
, hammer_inode
, rb_node
,
287 hammer_ino_rb_compare
, hammer_inode_info_t
);
289 struct hammer_redo_rb_tree
;
290 RB_HEAD(hammer_redo_rb_tree
, hammer_inode
);
291 RB_PROTOTYPE2(hammer_redo_rb_tree
, hammer_inode
, rb_redonode
,
292 hammer_redo_rb_compare
, hammer_off_t
);
294 struct hammer_rec_rb_tree
;
295 struct hammer_record
;
296 RB_HEAD(hammer_rec_rb_tree
, hammer_record
);
297 RB_PROTOTYPEX(hammer_rec_rb_tree
, INFO
, hammer_record
, rb_node
,
298 hammer_rec_rb_compare
, hammer_btree_leaf_elm_t
);
300 TAILQ_HEAD(hammer_node_list
, hammer_node
);
302 struct hammer_inode
{
303 RB_ENTRY(hammer_inode
) rb_node
;
304 hammer_inode_state_t flush_state
;
305 hammer_flush_group_t flush_group
;
306 RB_ENTRY(hammer_inode
) rb_flsnode
; /* when on flush list */
307 RB_ENTRY(hammer_inode
) rb_redonode
; /* when INODE_RDIRTY is set */
308 struct hammer_record_list target_list
; /* target of dependant recs */
309 int64_t obj_id
; /* (key) object identifier */
310 hammer_tid_t obj_asof
; /* (key) snapshot or 0 */
311 u_int32_t obj_localization
; /* (key) pseudo-fs */
312 struct hammer_mount
*hmp
;
313 hammer_objid_cache_t objid_cache
;
315 int error
; /* flush error */
316 int cursor_ip_refs
; /* sanity */
319 hammer_pseudofs_inmem_t pfsm
;
320 struct lockf advlock
;
321 struct hammer_lock lock
; /* sync copy interlock */
323 struct hammer_btree_leaf_elm ino_leaf
; /* in-memory cache */
324 struct hammer_inode_data ino_data
; /* in-memory cache */
325 struct hammer_rec_rb_tree rec_tree
; /* in-memory cache */
327 struct hammer_node_cache cache
[4]; /* search initiate cache */
330 * When a demark is created to synchronize an inode to
331 * disk, certain fields are copied so the front-end VOPs
332 * can continue to run in parallel with the synchronization
333 * occuring in the background.
335 int sync_flags
; /* to-sync flags cache */
336 off_t sync_trunc_off
; /* to-sync truncation */
337 off_t save_trunc_off
; /* write optimization */
338 struct hammer_btree_leaf_elm sync_ino_leaf
; /* to-sync cache */
339 struct hammer_inode_data sync_ino_data
; /* to-sync cache */
343 * Track the earliest offset in the UNDO/REDO FIFO containing
344 * REDO records. This is staged to the backend during flush
345 * sequences. While the inode is staged redo_fifo_next is used
346 * to track the earliest offset for rotation into redo_fifo_start
347 * on completion of the flush.
349 hammer_off_t redo_fifo_start
;
350 hammer_off_t redo_fifo_next
;
353 typedef struct hammer_inode
*hammer_inode_t
;
355 #define VTOI(vp) ((struct hammer_inode *)(vp)->v_data)
358 * NOTE: DDIRTY does not include atime or mtime and does not include
359 * write-append size changes. SDIRTY handles write-append size
362 * REDO indicates that REDO logging is active, creating a definitive
363 * stream of REDO records in the UNDO/REDO log for writes and
364 * truncations, including boundary records when/if REDO is turned off.
365 * REDO is typically enabled by fsync() and turned off if excessive
366 * writes without an fsync() occurs.
368 * RDIRTY indicates that REDO records were laid down in the UNDO/REDO
369 * FIFO (even if REDO is turned off some might still be active) and
370 * still being tracked for this inode. See hammer_redo.c
372 /* (not including atime/mtime) */
373 #define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */
374 #define HAMMER_INODE_RSV_INODES 0x0002 /* hmp->rsv_inodes bumped */
375 #define HAMMER_INODE_CONN_DOWN 0x0004 /* include in downward recursion */
376 #define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records */
377 #define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */
378 #define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */
379 #define HAMMER_INODE_DELETED 0x0080 /* inode delete (backend) */
380 #define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */
381 #define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */
382 #define HAMMER_INODE_VHELD 0x0400 /* vnode held on sync */
383 #define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */
384 #define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */
385 #define HAMMER_INODE_REFLUSH 0x2000 /* flush on dependancy / reflush */
386 #define HAMMER_INODE_RECLAIM 0x4000 /* trying to reclaim */
387 #define HAMMER_INODE_FLUSHW 0x8000 /* Someone waiting for flush */
389 #define HAMMER_INODE_TRUNCATED 0x00010000
390 #define HAMMER_INODE_DELETING 0x00020000 /* inode delete request (frontend)*/
391 #define HAMMER_INODE_RESIGNAL 0x00040000 /* re-signal on re-flush */
392 #define HAMMER_INODE_ATIME 0x00100000 /* in-memory atime modified */
393 #define HAMMER_INODE_MTIME 0x00200000 /* in-memory mtime modified */
394 #define HAMMER_INODE_WOULDBLOCK 0x00400000 /* re-issue to new flush group */
395 #define HAMMER_INODE_DUMMY 0x00800000 /* dummy inode covering bad file */
396 #define HAMMER_INODE_SDIRTY 0x01000000 /* in-memory ino_data.size is dirty*/
397 #define HAMMER_INODE_REDO 0x02000000 /* REDO logging active */
398 #define HAMMER_INODE_RDIRTY 0x04000000 /* REDO records active in fifo */
400 #define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_SDIRTY| \
401 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \
402 HAMMER_INODE_ATIME|HAMMER_INODE_MTIME| \
403 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
405 #define HAMMER_INODE_MODMASK_NOXDIRTY \
406 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY)
408 #define HAMMER_INODE_MODMASK_NOREDO \
409 (HAMMER_INODE_DDIRTY| \
410 HAMMER_INODE_XDIRTY| \
411 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
413 #define HAMMER_FLUSH_SIGNAL 0x0001
414 #define HAMMER_FLUSH_RECURSION 0x0002
417 * Used by the inode reclaim code to pipeline reclaims and avoid
418 * blowing out kernel memory or letting the flusher get too far
419 * behind. The reclaim wakes up when count reaches 0 or the
422 struct hammer_reclaim
{
423 TAILQ_ENTRY(hammer_reclaim
) entry
;
427 #define HAMMER_RECLAIM_WAIT 4000 /* default vfs.hammer.limit_reclaim */
430 * Structure used to represent an unsynchronized record in-memory. These
431 * records typically represent directory entries. Only non-historical
432 * records are kept in-memory.
434 * Records are organized as a per-inode RB-Tree. If the inode is not
435 * on disk then neither are any records and the in-memory record tree
436 * represents the entire contents of the inode. If the inode is on disk
437 * then the on-disk B-Tree is scanned in parallel with the in-memory
438 * RB-Tree to synthesize the current state of the file.
440 * Records are also used to enforce the ordering of directory create/delete
441 * operations. A new inode will not be flushed to disk unless its related
442 * directory entry is also being flushed at the same time. A directory entry
443 * will not be removed unless its related inode is also being removed at the
446 typedef enum hammer_record_type
{
447 HAMMER_MEM_RECORD_GENERAL
, /* misc record */
448 HAMMER_MEM_RECORD_INODE
, /* inode record */
449 HAMMER_MEM_RECORD_ADD
, /* positive memory cache record */
450 HAMMER_MEM_RECORD_DEL
, /* negative delete-on-disk record */
451 HAMMER_MEM_RECORD_DATA
/* bulk-data record w/on-disk ref */
452 } hammer_record_type_t
;
454 struct hammer_record
{
455 RB_ENTRY(hammer_record
) rb_node
;
456 TAILQ_ENTRY(hammer_record
) target_entry
;
457 hammer_inode_state_t flush_state
;
458 hammer_flush_group_t flush_group
;
459 hammer_record_type_t type
;
460 struct hammer_lock lock
;
461 struct hammer_reserve
*resv
;
462 struct hammer_inode
*ip
;
463 struct hammer_inode
*target_ip
;
464 struct hammer_btree_leaf_elm leaf
;
465 union hammer_data_ondisk
*data
;
467 hammer_off_t zone2_offset
; /* direct-write only */
470 typedef struct hammer_record
*hammer_record_t
;
473 * Record flags. Note that FE can only be set by the frontend if the
474 * record has not been interlocked by the backend w/ BE.
476 #define HAMMER_RECF_ALLOCDATA 0x0001
477 #define HAMMER_RECF_ONRBTREE 0x0002
478 #define HAMMER_RECF_DELETED_FE 0x0004 /* deleted (frontend) */
479 #define HAMMER_RECF_DELETED_BE 0x0008 /* deleted (backend) */
480 #define HAMMER_RECF_COMMITTED 0x0010 /* committed to the B-Tree */
481 #define HAMMER_RECF_INTERLOCK_BE 0x0020 /* backend interlock */
482 #define HAMMER_RECF_WANTED 0x0040 /* wanted by the frontend */
483 #define HAMMER_RECF_CONVERT_DELETE 0x0100 /* special case */
484 #define HAMMER_RECF_DIRECT_IO 0x0200 /* related direct I/O running*/
485 #define HAMMER_RECF_DIRECT_WAIT 0x0400 /* related direct I/O running*/
486 #define HAMMER_RECF_DIRECT_INVAL 0x0800 /* buffer alias invalidation */
487 #define HAMMER_RECF_REDO 0x1000 /* REDO was laid down */
490 * hammer_create_at_cursor() and hammer_delete_at_cursor() flags.
492 #define HAMMER_CREATE_MODE_UMIRROR 0x0001
493 #define HAMMER_CREATE_MODE_SYS 0x0002
495 #define HAMMER_DELETE_ADJUST 0x0001
496 #define HAMMER_DELETE_DESTROY 0x0002
499 * In-memory structures representing on-disk structures.
501 struct hammer_volume
;
502 struct hammer_buffer
;
505 struct hammer_reserve
;
507 RB_HEAD(hammer_vol_rb_tree
, hammer_volume
);
508 RB_HEAD(hammer_buf_rb_tree
, hammer_buffer
);
509 RB_HEAD(hammer_nod_rb_tree
, hammer_node
);
510 RB_HEAD(hammer_und_rb_tree
, hammer_undo
);
511 RB_HEAD(hammer_res_rb_tree
, hammer_reserve
);
513 RB_PROTOTYPE2(hammer_vol_rb_tree
, hammer_volume
, rb_node
,
514 hammer_vol_rb_compare
, int32_t);
515 RB_PROTOTYPE2(hammer_buf_rb_tree
, hammer_buffer
, rb_node
,
516 hammer_buf_rb_compare
, hammer_off_t
);
517 RB_PROTOTYPE2(hammer_nod_rb_tree
, hammer_node
, rb_node
,
518 hammer_nod_rb_compare
, hammer_off_t
);
519 RB_PROTOTYPE2(hammer_und_rb_tree
, hammer_undo
, rb_node
,
520 hammer_und_rb_compare
, hammer_off_t
);
521 RB_PROTOTYPE2(hammer_res_rb_tree
, hammer_reserve
, rb_node
,
522 hammer_res_rb_compare
, hammer_off_t
);
525 * IO management - embedded at the head of various in-memory structures
527 * VOLUME - hammer_volume containing meta-data
528 * META_BUFFER - hammer_buffer containing meta-data
529 * DATA_BUFFER - hammer_buffer containing pure-data
531 * Dirty volume headers and dirty meta-data buffers are locked until the
532 * flusher can sequence them out. Dirty pure-data buffers can be written.
533 * Clean buffers can be passively released.
535 typedef enum hammer_io_type
{
536 HAMMER_STRUCTURE_VOLUME
,
537 HAMMER_STRUCTURE_META_BUFFER
,
538 HAMMER_STRUCTURE_UNDO_BUFFER
,
539 HAMMER_STRUCTURE_DATA_BUFFER
542 union hammer_io_structure
;
546 LIST_ENTRY(worklist
) node
;
549 TAILQ_HEAD(hammer_io_list
, hammer_io
);
550 typedef struct hammer_io_list
*hammer_io_list_t
;
553 struct worklist worklist
;
554 struct hammer_lock lock
;
555 enum hammer_io_type type
;
556 struct hammer_mount
*hmp
;
557 struct hammer_volume
*volume
;
558 TAILQ_ENTRY(hammer_io
) mod_entry
; /* list entry if modified */
559 hammer_io_list_t mod_list
;
561 int64_t offset
; /* zone-2 offset */
562 int bytes
; /* buffer cache buffer size */
563 int loading
; /* loading/unloading interlock */
566 u_int modified
: 1; /* bp's data was modified */
567 u_int released
: 1; /* bp released (w/ B_LOCKED set) */
568 u_int running
: 1; /* bp write IO in progress */
569 u_int waiting
: 1; /* someone is waiting on us */
570 u_int validated
: 1; /* ondisk has been validated */
571 u_int waitdep
: 1; /* flush waits for dependancies */
572 u_int recovered
: 1; /* has recovery ref */
573 u_int waitmod
: 1; /* waiting for modify_refs */
574 u_int reclaim
: 1; /* reclaim requested */
575 u_int gencrc
: 1; /* crc needs to be generated */
576 u_int ioerror
: 1; /* abort on io-error */
579 typedef struct hammer_io
*hammer_io_t
;
581 #define HAMMER_CLUSTER_SIZE (64 * 1024)
582 #if HAMMER_CLUSTER_SIZE > MAXBSIZE
583 #undef HAMMER_CLUSTER_SIZE
584 #define HAMMER_CLUSTER_SIZE MAXBSIZE
586 #define HAMMER_CLUSTER_BUFS (HAMMER_CLUSTER_SIZE / HAMMER_BUFSIZE)
589 * In-memory volume representing on-disk buffer
591 struct hammer_volume
{
593 RB_ENTRY(hammer_volume
) rb_node
;
594 struct hammer_volume_ondisk
*ondisk
;
596 int64_t nblocks
; /* note: special calculation for statfs */
597 int64_t buffer_base
; /* base offset of buffer 0 */
598 hammer_off_t maxbuf_off
; /* Maximum buffer offset (zone-2) */
599 hammer_off_t maxraw_off
; /* Maximum raw offset for device */
605 typedef struct hammer_volume
*hammer_volume_t
;
608 * In-memory buffer (other then volume, super-cluster, or cluster),
609 * representing an on-disk buffer.
611 struct hammer_buffer
{
613 RB_ENTRY(hammer_buffer
) rb_node
;
615 hammer_off_t zoneX_offset
;
616 hammer_off_t zone2_offset
;
617 struct hammer_reserve
*resv
;
618 struct hammer_node_list clist
;
621 typedef struct hammer_buffer
*hammer_buffer_t
;
624 * In-memory B-Tree node, representing an on-disk B-Tree node.
626 * This is a hang-on structure which is backed by a hammer_buffer,
627 * indexed by a hammer_cluster, and used for fine-grained locking of
628 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer
629 * can contain multiple nodes representing wildly disassociated portions
630 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
632 * This structure uses a cluster-relative index to reduce the number
633 * of layers required to access it, and also because all on-disk B-Tree
634 * references are cluster-relative offsets.
637 struct hammer_lock lock
; /* node-by-node lock */
638 TAILQ_ENTRY(hammer_node
) entry
; /* per-buffer linkage */
639 RB_ENTRY(hammer_node
) rb_node
; /* per-cluster linkage */
640 hammer_off_t node_offset
; /* full offset spec */
641 struct hammer_mount
*hmp
;
642 struct hammer_buffer
*buffer
; /* backing buffer */
643 hammer_node_ondisk_t ondisk
; /* ptr to on-disk structure */
644 TAILQ_HEAD(, hammer_cursor
) cursor_list
; /* deadlock recovery */
645 struct hammer_node_cache_list cache_list
; /* passive caches */
647 int loading
; /* load interlock */
650 #define HAMMER_NODE_DELETED 0x0001
651 #define HAMMER_NODE_FLUSH 0x0002
652 #define HAMMER_NODE_CRCGOOD 0x0004
653 #define HAMMER_NODE_NEEDSCRC 0x0008
654 #define HAMMER_NODE_NEEDSMIRROR 0x0010
655 #define HAMMER_NODE_CRCBAD 0x0020
657 #define HAMMER_NODE_CRCANY (HAMMER_NODE_CRCGOOD | HAMMER_NODE_CRCBAD)
659 typedef struct hammer_node
*hammer_node_t
;
662 * List of locked nodes. This structure is used to lock potentially large
663 * numbers of nodes as an aid for complex B-Tree operations.
665 struct hammer_node_lock
;
666 TAILQ_HEAD(hammer_node_lock_list
, hammer_node_lock
);
668 struct hammer_node_lock
{
669 TAILQ_ENTRY(hammer_node_lock
) entry
;
670 struct hammer_node_lock_list list
;
671 struct hammer_node_lock
*parent
;
673 hammer_node_ondisk_t copy
; /* copy of on-disk data */
674 int index
; /* index of this node in parent */
675 int count
; /* count children */
679 typedef struct hammer_node_lock
*hammer_node_lock_t
;
681 #define HAMMER_NODE_LOCK_UPDATED 0x0001
684 * Common I/O management structure - embedded in in-memory structures
685 * which are backed by filesystem buffers.
687 union hammer_io_structure
{
689 struct hammer_volume volume
;
690 struct hammer_buffer buffer
;
693 typedef union hammer_io_structure
*hammer_io_structure_t
;
696 * The reserve structure prevents the blockmap from allocating
697 * out of a reserved bigblock. Such reservations are used by
698 * the direct-write mechanism.
700 * The structure is also used to hold off on reallocations of
701 * big blocks from the freemap until flush dependancies have
704 struct hammer_reserve
{
705 RB_ENTRY(hammer_reserve
) rb_node
;
706 TAILQ_ENTRY(hammer_reserve
) delay_entry
;
712 hammer_off_t zone_offset
;
715 typedef struct hammer_reserve
*hammer_reserve_t
;
717 #define HAMMER_RESF_ONDELAY 0x0001
718 #define HAMMER_RESF_LAYER2FREE 0x0002
720 #include "hammer_cursor.h"
723 * The undo structure tracks recent undos to avoid laying down duplicate
724 * undos within a flush group, saving us a significant amount of overhead.
726 * This is strictly a heuristic.
728 #define HAMMER_MAX_UNDOS 1024
729 #define HAMMER_MAX_FLUSHERS 4
732 RB_ENTRY(hammer_undo
) rb_node
;
733 TAILQ_ENTRY(hammer_undo
) lru_entry
;
738 typedef struct hammer_undo
*hammer_undo_t
;
740 struct hammer_flusher_info
;
741 TAILQ_HEAD(hammer_flusher_info_list
, hammer_flusher_info
);
743 struct hammer_flusher
{
744 int signal
; /* flusher thread sequencer */
745 int act
; /* currently active flush group */
746 int done
; /* set to act when complete */
747 int next
; /* next flush group */
748 int group_lock
; /* lock sequencing of the next flush */
749 int exiting
; /* request master exit */
750 thread_t td
; /* master flusher thread */
751 hammer_tid_t tid
; /* last flushed transaction id */
752 int finalize_want
; /* serialize finalization */
753 struct hammer_lock finalize_lock
; /* serialize finalization */
754 struct hammer_transaction trans
; /* shared transaction */
755 struct hammer_flusher_info_list run_list
;
756 struct hammer_flusher_info_list ready_list
;
759 #define HAMMER_FLUSH_UNDOS_RELAXED 0
760 #define HAMMER_FLUSH_UNDOS_FORCED 1
761 #define HAMMER_FLUSH_UNDOS_AUTO 2
763 * Internal hammer mount data structure
765 struct hammer_mount
{
767 /*struct vnode *rootvp;*/
768 struct hammer_ino_rb_tree rb_inos_root
;
769 struct hammer_redo_rb_tree rb_redo_root
;
770 struct hammer_vol_rb_tree rb_vols_root
;
771 struct hammer_nod_rb_tree rb_nods_root
;
772 struct hammer_und_rb_tree rb_undo_root
;
773 struct hammer_res_rb_tree rb_resv_root
;
774 struct hammer_buf_rb_tree rb_bufs_root
;
775 struct hammer_pfs_rb_tree rb_pfsm_root
;
776 struct hammer_volume
*rootvol
;
777 struct hammer_base_elm root_btree_beg
;
778 struct hammer_base_elm root_btree_end
;
780 struct malloc_type
*m_misc
;
781 struct malloc_type
*m_inodes
;
783 int flags
; /* HAMMER_MOUNT_xxx flags */
788 int master_id
; /* -1 or 0-15 - clustering and mirroring */
789 int version
; /* hammer filesystem version to use */
790 int rsv_inodes
; /* reserved space due to dirty inodes */
791 int64_t rsv_databytes
; /* reserved space due to record data */
792 int rsv_recs
; /* reserved space due to dirty records */
793 int rsv_fromdelay
; /* bigblocks reserved due to flush delay */
794 int undo_rec_limit
; /* based on size of undo area */
796 int count_newrecords
;
798 int volume_to_remove
; /* volume that is currently being removed */
800 int inode_reclaims
; /* inodes pending reclaim by flusher */
801 int count_inodes
; /* total number of inodes */
802 int count_iqueued
; /* inodes queued to flusher */
804 struct hammer_flusher flusher
;
806 u_int check_interrupt
;
809 struct hammer_io_list volu_list
; /* dirty undo buffers */
810 struct hammer_io_list undo_list
; /* dirty undo buffers */
811 struct hammer_io_list data_list
; /* dirty data buffers */
812 struct hammer_io_list alt_data_list
; /* dirty data buffers */
813 struct hammer_io_list meta_list
; /* dirty meta bufs */
814 struct hammer_io_list lose_list
; /* loose buffers */
815 int locked_dirty_space
; /* meta/volu count */
816 int io_running_space
;
817 int objid_cache_count
;
818 int error
; /* critical I/O error */
819 struct krate krate
; /* rate limited kprintf */
820 hammer_tid_t asof
; /* snapshot mount */
821 hammer_tid_t next_tid
;
822 hammer_tid_t flush_tid1
; /* flusher tid sequencing */
823 hammer_tid_t flush_tid2
; /* flusher tid sequencing */
824 int64_t copy_stat_freebigblocks
; /* number of free bigblocks */
825 u_int32_t undo_seqno
; /* UNDO/REDO FIFO seqno */
827 struct netexport export
;
828 struct hammer_lock sync_lock
;
829 struct hammer_lock free_lock
;
830 struct hammer_lock undo_lock
;
831 struct hammer_lock blkmap_lock
;
832 struct hammer_lock snapshot_lock
;
833 struct hammer_lock volume_lock
;
834 struct hammer_blockmap blockmap
[HAMMER_MAX_ZONES
];
835 struct hammer_undo undos
[HAMMER_MAX_UNDOS
];
837 TAILQ_HEAD(, hammer_undo
) undo_lru_list
;
838 TAILQ_HEAD(, hammer_reserve
) delay_list
;
839 struct hammer_flush_group_list flush_group_list
;
840 hammer_flush_group_t next_flush_group
;
841 TAILQ_HEAD(, hammer_objid_cache
) objid_cache_list
;
842 TAILQ_HEAD(, hammer_reclaim
) reclaim_list
;
845 typedef struct hammer_mount
*hammer_mount_t
;
847 #define HAMMER_MOUNT_CRITICAL_ERROR 0x0001
848 #define HAMMER_MOUNT_FLUSH_RECOVERY 0x0002
849 #define HAMMER_MOUNT_REDO_SYNC 0x0004
851 struct hammer_sync_info
{
859 * checkspace slop (8MB chunks), higher numbers are more conservative.
861 #define HAMMER_CHKSPC_REBLOCK 25
862 #define HAMMER_CHKSPC_MIRROR 20
863 #define HAMMER_CHKSPC_WRITE 20
864 #define HAMMER_CHKSPC_CREATE 20
865 #define HAMMER_CHKSPC_REMOVE 10
866 #define HAMMER_CHKSPC_EMERGENCY 0
870 extern struct vop_ops hammer_vnode_vops
;
871 extern struct vop_ops hammer_spec_vops
;
872 extern struct vop_ops hammer_fifo_vops
;
873 extern struct bio_ops hammer_bioops
;
875 extern int hammer_debug_io
;
876 extern int hammer_debug_general
;
877 extern int hammer_debug_debug
;
878 extern int hammer_debug_inode
;
879 extern int hammer_debug_locks
;
880 extern int hammer_debug_btree
;
881 extern int hammer_debug_tid
;
882 extern int hammer_debug_recover
;
883 extern int hammer_debug_recover_faults
;
884 extern int hammer_debug_critical
;
885 extern int hammer_cluster_enable
;
886 extern int hammer_count_fsyncs
;
887 extern int hammer_count_inodes
;
888 extern int hammer_count_iqueued
;
889 extern int hammer_count_reclaiming
;
890 extern int hammer_count_records
;
891 extern int hammer_count_record_datas
;
892 extern int hammer_count_volumes
;
893 extern int hammer_count_buffers
;
894 extern int hammer_count_nodes
;
895 extern int64_t hammer_count_extra_space_used
;
896 extern int64_t hammer_stats_btree_lookups
;
897 extern int64_t hammer_stats_btree_searches
;
898 extern int64_t hammer_stats_btree_inserts
;
899 extern int64_t hammer_stats_btree_deletes
;
900 extern int64_t hammer_stats_btree_elements
;
901 extern int64_t hammer_stats_btree_splits
;
902 extern int64_t hammer_stats_btree_iterations
;
903 extern int64_t hammer_stats_btree_root_iterations
;
904 extern int64_t hammer_stats_record_iterations
;
905 extern int64_t hammer_stats_file_read
;
906 extern int64_t hammer_stats_file_write
;
907 extern int64_t hammer_stats_file_iopsr
;
908 extern int64_t hammer_stats_file_iopsw
;
909 extern int64_t hammer_stats_disk_read
;
910 extern int64_t hammer_stats_disk_write
;
911 extern int64_t hammer_stats_inode_flushes
;
912 extern int64_t hammer_stats_commits
;
913 extern int64_t hammer_stats_undo
;
914 extern int64_t hammer_stats_redo
;
915 extern int hammer_count_dirtybufspace
;
916 extern int hammer_count_refedbufs
;
917 extern int hammer_count_reservations
;
918 extern int hammer_count_io_running_read
;
919 extern int hammer_count_io_running_write
;
920 extern int hammer_count_io_locked
;
921 extern int hammer_limit_dirtybufspace
;
922 extern int hammer_limit_recs
;
923 extern int hammer_limit_inode_recs
;
924 extern int hammer_limit_reclaim
;
925 extern int hammer_limit_redo
;
926 extern int hammer_bio_count
;
927 extern int hammer_verify_zone
;
928 extern int hammer_verify_data
;
929 extern int hammer_write_mode
;
930 extern int hammer_yield_check
;
931 extern int hammer_fsync_mode
;
932 extern int hammer_autoflush
;
933 extern int64_t hammer_contention_count
;
935 void hammer_critical_error(hammer_mount_t hmp
, hammer_inode_t ip
,
936 int error
, const char *msg
);
937 int hammer_vop_inactive(struct vop_inactive_args
*);
938 int hammer_vop_reclaim(struct vop_reclaim_args
*);
939 int hammer_get_vnode(struct hammer_inode
*ip
, struct vnode
**vpp
);
940 struct hammer_inode
*hammer_get_inode(hammer_transaction_t trans
,
941 hammer_inode_t dip
, int64_t obj_id
,
942 hammer_tid_t asof
, u_int32_t localization
,
943 int flags
, int *errorp
);
944 struct hammer_inode
*hammer_get_dummy_inode(hammer_transaction_t trans
,
945 hammer_inode_t dip
, int64_t obj_id
,
946 hammer_tid_t asof
, u_int32_t localization
,
947 int flags
, int *errorp
);
948 struct hammer_inode
*hammer_find_inode(hammer_transaction_t trans
,
949 int64_t obj_id
, hammer_tid_t asof
,
950 u_int32_t localization
);
951 void hammer_scan_inode_snapshots(hammer_mount_t hmp
,
952 hammer_inode_info_t iinfo
,
953 int (*callback
)(hammer_inode_t ip
, void *data
),
955 void hammer_put_inode(struct hammer_inode
*ip
);
956 void hammer_put_inode_ref(struct hammer_inode
*ip
);
957 void hammer_inode_waitreclaims(hammer_mount_t hmp
);
958 void hammer_inode_waithard(hammer_mount_t hmp
);
960 int hammer_unload_volume(hammer_volume_t volume
, void *data __unused
);
961 int hammer_adjust_volume_mode(hammer_volume_t volume
, void *data __unused
);
963 int hammer_unload_buffer(hammer_buffer_t buffer
, void *data
);
964 int hammer_install_volume(hammer_mount_t hmp
, const char *volname
,
965 struct vnode
*devvp
);
966 int hammer_mountcheck_volumes(hammer_mount_t hmp
);
968 int hammer_mem_add(hammer_record_t record
);
969 int hammer_ip_lookup(hammer_cursor_t cursor
);
970 int hammer_ip_first(hammer_cursor_t cursor
);
971 int hammer_ip_next(hammer_cursor_t cursor
);
972 int hammer_ip_resolve_data(hammer_cursor_t cursor
);
973 int hammer_ip_delete_record(hammer_cursor_t cursor
, hammer_inode_t ip
,
975 int hammer_create_at_cursor(hammer_cursor_t cursor
,
976 hammer_btree_leaf_elm_t leaf
, void *udata
, int mode
);
977 int hammer_delete_at_cursor(hammer_cursor_t cursor
, int delete_flags
,
978 hammer_tid_t delete_tid
, u_int32_t delete_ts
,
979 int track
, int64_t *stat_bytes
);
980 int hammer_ip_check_directory_empty(hammer_transaction_t trans
,
982 int hammer_sync_hmp(hammer_mount_t hmp
, int waitfor
);
983 int hammer_queue_inodes_flusher(hammer_mount_t hmp
, int waitfor
);
986 hammer_alloc_mem_record(hammer_inode_t ip
, int data_len
);
987 void hammer_flush_record_done(hammer_record_t record
, int error
);
988 void hammer_wait_mem_record_ident(hammer_record_t record
, const char *ident
);
989 void hammer_rel_mem_record(hammer_record_t record
);
991 int hammer_cursor_up(hammer_cursor_t cursor
);
992 int hammer_cursor_up_locked(hammer_cursor_t cursor
);
993 int hammer_cursor_down(hammer_cursor_t cursor
);
994 int hammer_cursor_upgrade(hammer_cursor_t cursor
);
995 int hammer_cursor_upgrade_node(hammer_cursor_t cursor
);
996 void hammer_cursor_downgrade(hammer_cursor_t cursor
);
997 int hammer_cursor_seek(hammer_cursor_t cursor
, hammer_node_t node
,
999 void hammer_lock_ex_ident(struct hammer_lock
*lock
, const char *ident
);
1000 int hammer_lock_ex_try(struct hammer_lock
*lock
);
1001 void hammer_lock_sh(struct hammer_lock
*lock
);
1002 int hammer_lock_sh_try(struct hammer_lock
*lock
);
1003 int hammer_lock_upgrade(struct hammer_lock
*lock
);
1004 void hammer_lock_downgrade(struct hammer_lock
*lock
);
1005 int hammer_lock_status(struct hammer_lock
*lock
);
1006 void hammer_unlock(struct hammer_lock
*lock
);
1007 void hammer_ref(struct hammer_lock
*lock
);
1008 void hammer_unref(struct hammer_lock
*lock
);
1010 void hammer_sync_lock_ex(hammer_transaction_t trans
);
1011 void hammer_sync_lock_sh(hammer_transaction_t trans
);
1012 int hammer_sync_lock_sh_try(hammer_transaction_t trans
);
1013 void hammer_sync_unlock(hammer_transaction_t trans
);
1015 u_int32_t
hammer_to_unix_xid(uuid_t
*uuid
);
1016 void hammer_guid_to_uuid(uuid_t
*uuid
, u_int32_t guid
);
1017 void hammer_time_to_timespec(u_int64_t xtime
, struct timespec
*ts
);
1018 u_int64_t
hammer_timespec_to_time(struct timespec
*ts
);
1019 int hammer_str_to_tid(const char *str
, int *ispfsp
,
1020 hammer_tid_t
*tidp
, u_int32_t
*localizationp
);
1021 int hammer_is_atatext(const char *name
, int len
);
1022 hammer_tid_t
hammer_alloc_objid(hammer_mount_t hmp
, hammer_inode_t dip
,
1024 void hammer_clear_objid(hammer_inode_t dip
);
1025 void hammer_destroy_objid_cache(hammer_mount_t hmp
);
1027 int hammer_enter_undo_history(hammer_mount_t hmp
, hammer_off_t offset
,
1029 void hammer_clear_undo_history(hammer_mount_t hmp
);
1030 enum vtype
hammer_get_vnode_type(u_int8_t obj_type
);
1031 int hammer_get_dtype(u_int8_t obj_type
);
1032 u_int8_t
hammer_get_obj_type(enum vtype vtype
);
1033 int64_t hammer_directory_namekey(hammer_inode_t dip
, const void *name
, int len
,
1034 u_int32_t
*max_iterationsp
);
1035 int hammer_nohistory(hammer_inode_t ip
);
1037 int hammer_init_cursor(hammer_transaction_t trans
, hammer_cursor_t cursor
,
1038 hammer_node_cache_t cache
, hammer_inode_t ip
);
1039 void hammer_normalize_cursor(hammer_cursor_t cursor
);
1040 void hammer_done_cursor(hammer_cursor_t cursor
);
1041 int hammer_recover_cursor(hammer_cursor_t cursor
);
1042 void hammer_unlock_cursor(hammer_cursor_t cursor
);
1043 int hammer_lock_cursor(hammer_cursor_t cursor
);
1044 hammer_cursor_t
hammer_push_cursor(hammer_cursor_t ocursor
);
1045 void hammer_pop_cursor(hammer_cursor_t ocursor
, hammer_cursor_t ncursor
);
1047 void hammer_cursor_replaced_node(hammer_node_t onode
, hammer_node_t nnode
);
1048 void hammer_cursor_removed_node(hammer_node_t onode
, hammer_node_t parent
,
1050 void hammer_cursor_split_node(hammer_node_t onode
, hammer_node_t nnode
,
1052 void hammer_cursor_moved_element(hammer_node_t onode
, hammer_node_t nnode
,
1053 int oindex
, int nindex
);
1054 void hammer_cursor_parent_changed(hammer_node_t node
, hammer_node_t oparent
,
1055 hammer_node_t nparent
, int nindex
);
1056 void hammer_cursor_inserted_element(hammer_node_t node
, int index
);
1057 void hammer_cursor_deleted_element(hammer_node_t node
, int index
);
1059 int hammer_btree_lookup(hammer_cursor_t cursor
);
1060 int hammer_btree_first(hammer_cursor_t cursor
);
1061 int hammer_btree_last(hammer_cursor_t cursor
);
1062 int hammer_btree_extract(hammer_cursor_t cursor
, int flags
);
1063 int hammer_btree_iterate(hammer_cursor_t cursor
);
1064 int hammer_btree_iterate_reverse(hammer_cursor_t cursor
);
1065 int hammer_btree_insert(hammer_cursor_t cursor
,
1066 hammer_btree_leaf_elm_t elm
, int *doprop
);
1067 int hammer_btree_delete(hammer_cursor_t cursor
);
1068 void hammer_btree_do_propagation(hammer_cursor_t cursor
,
1069 hammer_pseudofs_inmem_t pfsm
,
1070 hammer_btree_leaf_elm_t leaf
);
1071 int hammer_btree_cmp(hammer_base_elm_t key1
, hammer_base_elm_t key2
);
1072 int hammer_btree_chkts(hammer_tid_t ts
, hammer_base_elm_t key
);
1073 int hammer_btree_correct_rhb(hammer_cursor_t cursor
, hammer_tid_t tid
);
1074 int hammer_btree_correct_lhb(hammer_cursor_t cursor
, hammer_tid_t tid
);
1076 int btree_set_parent(hammer_transaction_t trans
, hammer_node_t node
,
1077 hammer_btree_elm_t elm
);
1078 void hammer_node_lock_init(hammer_node_lock_t parent
, hammer_node_t node
);
1079 int hammer_btree_lock_children(hammer_cursor_t cursor
, int depth
,
1080 hammer_node_lock_t parent
);
1081 void hammer_btree_lock_copy(hammer_cursor_t cursor
,
1082 hammer_node_lock_t parent
);
1083 int hammer_btree_sync_copy(hammer_cursor_t cursor
,
1084 hammer_node_lock_t parent
);
1085 void hammer_btree_unlock_children(hammer_cursor_t cursor
,
1086 hammer_node_lock_t parent
);
1087 int hammer_btree_search_node(hammer_base_elm_t elm
, hammer_node_ondisk_t node
);
1088 hammer_node_t
hammer_btree_get_parent(hammer_transaction_t trans
,
1089 hammer_node_t node
, int *parent_indexp
,
1090 int *errorp
, int try_exclusive
);
1092 void hammer_print_btree_node(hammer_node_ondisk_t ondisk
);
1093 void hammer_print_btree_elm(hammer_btree_elm_t elm
, u_int8_t type
, int i
);
1095 void *hammer_bread(struct hammer_mount
*hmp
, hammer_off_t off
,
1096 int *errorp
, struct hammer_buffer
**bufferp
);
1097 void *hammer_bnew(struct hammer_mount
*hmp
, hammer_off_t off
,
1098 int *errorp
, struct hammer_buffer
**bufferp
);
1099 void *hammer_bread_ext(struct hammer_mount
*hmp
, hammer_off_t off
, int bytes
,
1100 int *errorp
, struct hammer_buffer
**bufferp
);
1101 void *hammer_bnew_ext(struct hammer_mount
*hmp
, hammer_off_t off
, int bytes
,
1102 int *errorp
, struct hammer_buffer
**bufferp
);
1104 hammer_volume_t
hammer_get_root_volume(hammer_mount_t hmp
, int *errorp
);
1106 hammer_volume_t
hammer_get_volume(hammer_mount_t hmp
,
1107 int32_t vol_no
, int *errorp
);
1108 hammer_buffer_t
hammer_get_buffer(hammer_mount_t hmp
, hammer_off_t buf_offset
,
1109 int bytes
, int isnew
, int *errorp
);
1110 void hammer_sync_buffers(hammer_mount_t hmp
,
1111 hammer_off_t base_offset
, int bytes
);
1112 int hammer_del_buffers(hammer_mount_t hmp
,
1113 hammer_off_t base_offset
,
1114 hammer_off_t zone2_offset
, int bytes
,
1115 int report_conflicts
);
1117 int hammer_ref_volume(hammer_volume_t volume
);
1118 int hammer_ref_buffer(hammer_buffer_t buffer
);
1119 void hammer_flush_buffer_nodes(hammer_buffer_t buffer
);
1121 void hammer_rel_volume(hammer_volume_t volume
, int flush
);
1122 void hammer_rel_buffer(hammer_buffer_t buffer
, int flush
);
1124 int hammer_vfs_export(struct mount
*mp
, int op
,
1125 const struct export_args
*export
);
1126 hammer_node_t
hammer_get_node(hammer_transaction_t trans
,
1127 hammer_off_t node_offset
, int isnew
, int *errorp
);
1128 void hammer_ref_node(hammer_node_t node
);
1129 hammer_node_t
hammer_ref_node_safe(hammer_transaction_t trans
,
1130 hammer_node_cache_t cache
, int *errorp
);
1131 void hammer_rel_node(hammer_node_t node
);
1132 void hammer_delete_node(hammer_transaction_t trans
,
1133 hammer_node_t node
);
1134 void hammer_cache_node(hammer_node_cache_t cache
,
1135 hammer_node_t node
);
1136 void hammer_uncache_node(hammer_node_cache_t cache
);
1137 void hammer_flush_node(hammer_node_t node
);
1139 void hammer_dup_buffer(struct hammer_buffer
**bufferp
,
1140 struct hammer_buffer
*buffer
);
1141 hammer_node_t
hammer_alloc_btree(hammer_transaction_t trans
,
1142 hammer_off_t hint
, int *errorp
);
1143 void *hammer_alloc_data(hammer_transaction_t trans
, int32_t data_len
,
1144 u_int16_t rec_type
, hammer_off_t
*data_offsetp
,
1145 struct hammer_buffer
**data_bufferp
,
1146 hammer_off_t hint
, int *errorp
);
1148 int hammer_generate_undo(hammer_transaction_t trans
,
1149 hammer_off_t zone1_offset
, void *base
, int len
);
1150 int hammer_generate_redo(hammer_transaction_t trans
, hammer_inode_t ip
,
1151 hammer_off_t file_offset
, u_int32_t flags
,
1152 void *base
, int len
);
1153 void hammer_generate_redo_sync(hammer_transaction_t trans
);
1154 void hammer_redo_fifo_start_flush(hammer_inode_t ip
);
1155 void hammer_redo_fifo_end_flush(hammer_inode_t ip
);
1157 void hammer_format_undo(void *base
, u_int32_t seqno
);
1158 int hammer_upgrade_undo_4(hammer_transaction_t trans
);
1160 void hammer_put_volume(struct hammer_volume
*volume
, int flush
);
1161 void hammer_put_buffer(struct hammer_buffer
*buffer
, int flush
);
1163 hammer_off_t
hammer_freemap_alloc(hammer_transaction_t trans
,
1164 hammer_off_t owner
, int *errorp
);
1165 void hammer_freemap_free(hammer_transaction_t trans
, hammer_off_t phys_offset
,
1166 hammer_off_t owner
, int *errorp
);
1167 int _hammer_checkspace(hammer_mount_t hmp
, int slop
, int64_t *resp
);
1168 hammer_off_t
hammer_blockmap_alloc(hammer_transaction_t trans
, int zone
,
1169 int bytes
, hammer_off_t hint
, int *errorp
);
1170 hammer_reserve_t
hammer_blockmap_reserve(hammer_mount_t hmp
, int zone
,
1171 int bytes
, hammer_off_t
*zone_offp
, int *errorp
);
1172 void hammer_blockmap_reserve_complete(hammer_mount_t hmp
,
1173 hammer_reserve_t resv
);
1174 void hammer_reserve_clrdelay(hammer_mount_t hmp
, hammer_reserve_t resv
);
1175 void hammer_blockmap_free(hammer_transaction_t trans
,
1176 hammer_off_t bmap_off
, int bytes
);
1177 int hammer_blockmap_finalize(hammer_transaction_t trans
,
1178 hammer_reserve_t resv
,
1179 hammer_off_t bmap_off
, int bytes
);
1180 int hammer_blockmap_getfree(hammer_mount_t hmp
, hammer_off_t bmap_off
,
1181 int *curp
, int *errorp
);
1182 hammer_off_t
hammer_blockmap_lookup(hammer_mount_t hmp
, hammer_off_t bmap_off
,
1184 hammer_off_t
hammer_undo_lookup(hammer_mount_t hmp
, hammer_off_t bmap_off
,
1186 int64_t hammer_undo_used(hammer_transaction_t trans
);
1187 int64_t hammer_undo_space(hammer_transaction_t trans
);
1188 int64_t hammer_undo_max(hammer_mount_t hmp
);
1189 int hammer_undo_reclaim(hammer_io_t io
);
1191 void hammer_start_transaction(struct hammer_transaction
*trans
,
1192 struct hammer_mount
*hmp
);
1193 void hammer_simple_transaction(struct hammer_transaction
*trans
,
1194 struct hammer_mount
*hmp
);
1195 void hammer_start_transaction_fls(struct hammer_transaction
*trans
,
1196 struct hammer_mount
*hmp
);
1197 void hammer_done_transaction(struct hammer_transaction
*trans
);
1198 hammer_tid_t
hammer_alloc_tid(hammer_mount_t hmp
, int count
);
1200 void hammer_modify_inode(hammer_inode_t ip
, int flags
);
1201 void hammer_flush_inode(hammer_inode_t ip
, int flags
);
1202 void hammer_flush_inode_done(hammer_inode_t ip
, int error
);
1203 void hammer_wait_inode(hammer_inode_t ip
);
1205 int hammer_create_inode(struct hammer_transaction
*trans
, struct vattr
*vap
,
1206 struct ucred
*cred
, struct hammer_inode
*dip
,
1207 const char *name
, int namelen
,
1208 hammer_pseudofs_inmem_t pfsm
,
1209 struct hammer_inode
**ipp
);
1210 void hammer_rel_inode(hammer_inode_t ip
, int flush
);
1211 int hammer_reload_inode(hammer_inode_t ip
, void *arg __unused
);
1212 int hammer_ino_rb_compare(hammer_inode_t ip1
, hammer_inode_t ip2
);
1213 int hammer_redo_rb_compare(hammer_inode_t ip1
, hammer_inode_t ip2
);
1214 int hammer_destroy_inode_callback(hammer_inode_t ip
, void *data __unused
);
1216 int hammer_sync_inode(hammer_transaction_t trans
, hammer_inode_t ip
);
1217 void hammer_test_inode(hammer_inode_t dip
);
1218 void hammer_inode_unloadable_check(hammer_inode_t ip
, int getvp
);
1220 int hammer_ip_add_directory(struct hammer_transaction
*trans
,
1221 hammer_inode_t dip
, const char *name
, int bytes
,
1222 hammer_inode_t nip
);
1223 int hammer_ip_del_directory(struct hammer_transaction
*trans
,
1224 hammer_cursor_t cursor
, hammer_inode_t dip
,
1226 hammer_record_t
hammer_ip_add_bulk(hammer_inode_t ip
, off_t file_offset
,
1227 void *data
, int bytes
, int *errorp
);
1228 int hammer_ip_frontend_trunc(struct hammer_inode
*ip
, off_t file_size
);
1229 int hammer_ip_add_record(struct hammer_transaction
*trans
,
1230 hammer_record_t record
);
1231 int hammer_ip_delete_range(hammer_cursor_t cursor
, hammer_inode_t ip
,
1232 int64_t ran_beg
, int64_t ran_end
, int truncating
);
1233 int hammer_ip_delete_clean(hammer_cursor_t cursor
, hammer_inode_t ip
,
1235 int hammer_ip_sync_data(hammer_cursor_t cursor
, hammer_inode_t ip
,
1236 int64_t offset
, void *data
, int bytes
);
1237 int hammer_ip_sync_record(hammer_transaction_t trans
, hammer_record_t rec
);
1238 int hammer_ip_sync_record_cursor(hammer_cursor_t cursor
, hammer_record_t rec
);
1239 hammer_pseudofs_inmem_t
hammer_load_pseudofs(hammer_transaction_t trans
,
1240 u_int32_t localization
, int *errorp
);
1241 int hammer_mkroot_pseudofs(hammer_transaction_t trans
, struct ucred
*cred
,
1242 hammer_pseudofs_inmem_t pfsm
);
1243 int hammer_save_pseudofs(hammer_transaction_t trans
,
1244 hammer_pseudofs_inmem_t pfsm
);
1245 int hammer_unload_pseudofs(hammer_transaction_t trans
, u_int32_t localization
);
1246 void hammer_rel_pseudofs(hammer_mount_t hmp
, hammer_pseudofs_inmem_t pfsm
);
1247 int hammer_ioctl(hammer_inode_t ip
, u_long com
, caddr_t data
, int fflag
,
1248 struct ucred
*cred
);
1250 void hammer_io_init(hammer_io_t io
, hammer_volume_t volume
,
1251 enum hammer_io_type type
);
1252 int hammer_io_read(struct vnode
*devvp
, struct hammer_io
*io
,
1253 hammer_off_t limit
);
1254 void hammer_io_advance(struct hammer_io
*io
);
1255 int hammer_io_new(struct vnode
*devvp
, struct hammer_io
*io
);
1256 int hammer_io_inval(hammer_volume_t volume
, hammer_off_t zone2_offset
);
1257 struct buf
*hammer_io_release(struct hammer_io
*io
, int flush
);
1258 void hammer_io_flush(struct hammer_io
*io
, int reclaim
);
1259 void hammer_io_wait(struct hammer_io
*io
);
1260 void hammer_io_waitdep(struct hammer_io
*io
);
1261 void hammer_io_wait_all(hammer_mount_t hmp
, const char *ident
);
1262 int hammer_io_direct_read(hammer_mount_t hmp
, struct bio
*bio
,
1263 hammer_btree_leaf_elm_t leaf
);
1264 int hammer_io_direct_write(hammer_mount_t hmp
, hammer_record_t record
,
1266 void hammer_io_direct_wait(hammer_record_t record
);
1267 void hammer_io_direct_uncache(hammer_mount_t hmp
, hammer_btree_leaf_elm_t leaf
);
1268 void hammer_io_write_interlock(hammer_io_t io
);
1269 void hammer_io_done_interlock(hammer_io_t io
);
1270 void hammer_io_clear_modify(struct hammer_io
*io
, int inval
);
1271 void hammer_io_clear_modlist(struct hammer_io
*io
);
1272 void hammer_io_flush_sync(hammer_mount_t hmp
);
1273 void hammer_io_clear_error(struct hammer_io
*io
);
1275 void hammer_modify_volume(hammer_transaction_t trans
, hammer_volume_t volume
,
1276 void *base
, int len
);
1277 void hammer_modify_buffer(hammer_transaction_t trans
, hammer_buffer_t buffer
,
1278 void *base
, int len
);
1279 void hammer_modify_volume_done(hammer_volume_t volume
);
1280 void hammer_modify_buffer_done(hammer_buffer_t buffer
);
1282 int hammer_ioc_reblock(hammer_transaction_t trans
, hammer_inode_t ip
,
1283 struct hammer_ioc_reblock
*reblock
);
1284 int hammer_ioc_rebalance(hammer_transaction_t trans
, hammer_inode_t ip
,
1285 struct hammer_ioc_rebalance
*rebal
);
1286 int hammer_ioc_prune(hammer_transaction_t trans
, hammer_inode_t ip
,
1287 struct hammer_ioc_prune
*prune
);
1288 int hammer_ioc_mirror_read(hammer_transaction_t trans
, hammer_inode_t ip
,
1289 struct hammer_ioc_mirror_rw
*mirror
);
1290 int hammer_ioc_mirror_write(hammer_transaction_t trans
, hammer_inode_t ip
,
1291 struct hammer_ioc_mirror_rw
*mirror
);
1292 int hammer_ioc_set_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1293 struct ucred
*cred
, struct hammer_ioc_pseudofs_rw
*pfs
);
1294 int hammer_ioc_get_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1295 struct hammer_ioc_pseudofs_rw
*pfs
);
1296 int hammer_ioc_destroy_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1297 struct hammer_ioc_pseudofs_rw
*pfs
);
1298 int hammer_ioc_downgrade_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1299 struct hammer_ioc_pseudofs_rw
*pfs
);
1300 int hammer_ioc_upgrade_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1301 struct hammer_ioc_pseudofs_rw
*pfs
);
1302 int hammer_ioc_wait_pseudofs(hammer_transaction_t trans
, hammer_inode_t ip
,
1303 struct hammer_ioc_pseudofs_rw
*pfs
);
1304 int hammer_ioc_volume_add(hammer_transaction_t trans
, hammer_inode_t ip
,
1305 struct hammer_ioc_volume
*ioc
);
1306 int hammer_ioc_volume_del(hammer_transaction_t trans
, hammer_inode_t ip
,
1307 struct hammer_ioc_volume
*ioc
);
1309 int hammer_signal_check(hammer_mount_t hmp
);
1311 void hammer_flusher_create(hammer_mount_t hmp
);
1312 void hammer_flusher_destroy(hammer_mount_t hmp
);
1313 void hammer_flusher_sync(hammer_mount_t hmp
);
1314 int hammer_flusher_async(hammer_mount_t hmp
, hammer_flush_group_t flg
);
1315 int hammer_flusher_async_one(hammer_mount_t hmp
);
1316 void hammer_flusher_wait(hammer_mount_t hmp
, int seq
);
1317 void hammer_flusher_wait_next(hammer_mount_t hmp
);
1318 int hammer_flusher_meta_limit(hammer_mount_t hmp
);
1319 int hammer_flusher_meta_halflimit(hammer_mount_t hmp
);
1320 int hammer_flusher_undo_exhausted(hammer_transaction_t trans
, int quarter
);
1321 void hammer_flusher_clean_loose_ios(hammer_mount_t hmp
);
1322 void hammer_flusher_finalize(hammer_transaction_t trans
, int final
);
1323 int hammer_flusher_haswork(hammer_mount_t hmp
);
1324 void hammer_flusher_flush_undos(hammer_mount_t hmp
, int already_flushed
);
1326 int hammer_recover_stage1(hammer_mount_t hmp
, hammer_volume_t rootvol
);
1327 int hammer_recover_stage2(hammer_mount_t hmp
, hammer_volume_t rootvol
);
1328 void hammer_recover_flush_buffers(hammer_mount_t hmp
,
1329 hammer_volume_t root_volume
, int final
);
1331 void hammer_crc_set_blockmap(hammer_blockmap_t blockmap
);
1332 void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk
);
1333 void hammer_crc_set_leaf(void *data
, hammer_btree_leaf_elm_t leaf
);
1335 int hammer_crc_test_blockmap(hammer_blockmap_t blockmap
);
1336 int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk
);
1337 int hammer_crc_test_btree(hammer_node_ondisk_t ondisk
);
1338 int hammer_crc_test_leaf(void *data
, hammer_btree_leaf_elm_t leaf
);
1339 void hkprintf(const char *ctl
, ...);
1340 udev_t
hammer_fsid_to_udev(uuid_t
*uuid
);
1343 int hammer_blocksize(int64_t file_offset
);
1344 int64_t hammer_blockdemarc(int64_t file_offset1
, int64_t file_offset2
);
1347 * Shortcut for _hammer_checkspace(), used all over the code.
1350 hammer_checkspace(hammer_mount_t hmp
, int slop
)
1352 return(_hammer_checkspace(hmp
, slop
, NULL
));
1357 static __inline
void
1358 hammer_wait_mem_record(hammer_record_t record
)
1360 hammer_wait_mem_record_ident(record
, "hmmwai");
1363 static __inline
void
1364 hammer_lock_ex(struct hammer_lock
*lock
)
1366 hammer_lock_ex_ident(lock
, "hmrlck");
1370 * Indicate that a B-Tree node is being modified.
1372 static __inline
void
1373 hammer_modify_node_noundo(hammer_transaction_t trans
, hammer_node_t node
)
1375 KKASSERT((node
->flags
& HAMMER_NODE_CRCBAD
) == 0);
1376 hammer_modify_buffer(trans
, node
->buffer
, NULL
, 0);
1379 static __inline
void
1380 hammer_modify_node_all(hammer_transaction_t trans
, struct hammer_node
*node
)
1382 KKASSERT((node
->flags
& HAMMER_NODE_CRCBAD
) == 0);
1383 hammer_modify_buffer(trans
, node
->buffer
,
1384 node
->ondisk
, sizeof(*node
->ondisk
));
1387 static __inline
void
1388 hammer_modify_node(hammer_transaction_t trans
, hammer_node_t node
,
1389 void *base
, int len
)
1391 hammer_crc_t
*crcptr
;
1393 KKASSERT((char *)base
>= (char *)node
->ondisk
&&
1394 (char *)base
+ len
<=
1395 (char *)node
->ondisk
+ sizeof(*node
->ondisk
));
1396 KKASSERT((node
->flags
& HAMMER_NODE_CRCBAD
) == 0);
1397 hammer_modify_buffer(trans
, node
->buffer
, base
, len
);
1398 crcptr
= &node
->ondisk
->crc
;
1399 hammer_modify_buffer(trans
, node
->buffer
, crcptr
, sizeof(hammer_crc_t
));
1400 --node
->buffer
->io
.modify_refs
; /* only want one ref */
1404 * Indicate that the specified modifications have been completed.
1406 * Do not try to generate the crc here, it's very expensive to do and a
1407 * sequence of insertions or deletions can result in many calls to this
1408 * function on the same node.
1410 static __inline
void
1411 hammer_modify_node_done(hammer_node_t node
)
1413 node
->flags
|= HAMMER_NODE_CRCGOOD
;
1414 if ((node
->flags
& HAMMER_NODE_NEEDSCRC
) == 0) {
1415 node
->flags
|= HAMMER_NODE_NEEDSCRC
;
1416 node
->buffer
->io
.gencrc
= 1;
1417 hammer_ref_node(node
);
1419 hammer_modify_buffer_done(node
->buffer
);
1422 #define hammer_modify_volume_field(trans, vol, field) \
1423 hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \
1424 sizeof((vol)->ondisk->field))
1426 #define hammer_modify_node_field(trans, node, field) \
1427 hammer_modify_node(trans, node, &(node)->ondisk->field, \
1428 sizeof((node)->ondisk->field))
1431 * The HAMMER_INODE_CAP_DIR_LOCAL_INO capability is set on newly
1432 * created directories for HAMMER version 2 or greater and causes
1433 * directory entries to be placed the inode localization zone in
1434 * the B-Tree instead of the misc zone.
1436 * This greatly improves localization between directory entries and
1439 static __inline u_int32_t
1440 hammer_dir_localization(hammer_inode_t dip
)
1442 if (dip
->ino_data
.cap_flags
& HAMMER_INODE_CAP_DIR_LOCAL_INO
)
1443 return(HAMMER_LOCALIZE_INODE
);
1445 return(HAMMER_LOCALIZE_MISC
);