mirror of
https://github.com/torvalds/linux.git
synced 2024-11-10 14:11:52 +00:00
btrfs: move basic block_group definitions to their own header
This is prep work for moving all of the block group cache code into its own file. Signed-off-by: Josef Bacik <josef@toxicpanda.com> Reviewed-by: David Sterba <dsterba@suse.com> [ minor comment updates ] Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Josef Bacik
David Sterba
parent
478b4d9f01
commit
aac0023c21
154
fs/btrfs/block-group.h
Normal file
154
fs/btrfs/block-group.h
Normal file
@ -0,0 +1,154 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0 */
|
||||
|
||||
#ifndef BTRFS_BLOCK_GROUP_H
|
||||
#define BTRFS_BLOCK_GROUP_H
|
||||
|
||||
enum btrfs_disk_cache_state {
|
||||
BTRFS_DC_WRITTEN,
|
||||
BTRFS_DC_ERROR,
|
||||
BTRFS_DC_CLEAR,
|
||||
BTRFS_DC_SETUP,
|
||||
};
|
||||
|
||||
struct btrfs_caching_control {
|
||||
struct list_head list;
|
||||
struct mutex mutex;
|
||||
wait_queue_head_t wait;
|
||||
struct btrfs_work work;
|
||||
struct btrfs_block_group_cache *block_group;
|
||||
u64 progress;
|
||||
refcount_t count;
|
||||
};
|
||||
|
||||
/* Once caching_thread() finds this much free space, it will wake up waiters. */
|
||||
#define CACHING_CTL_WAKE_UP SZ_2M
|
||||
|
||||
struct btrfs_block_group_cache {
|
||||
struct btrfs_key key;
|
||||
struct btrfs_block_group_item item;
|
||||
struct btrfs_fs_info *fs_info;
|
||||
struct inode *inode;
|
||||
spinlock_t lock;
|
||||
u64 pinned;
|
||||
u64 reserved;
|
||||
u64 delalloc_bytes;
|
||||
u64 bytes_super;
|
||||
u64 flags;
|
||||
u64 cache_generation;
|
||||
|
||||
/*
|
||||
* If the free space extent count exceeds this number, convert the block
|
||||
* group to bitmaps.
|
||||
*/
|
||||
u32 bitmap_high_thresh;
|
||||
|
||||
/*
|
||||
* If the free space extent count drops below this number, convert the
|
||||
* block group back to extents.
|
||||
*/
|
||||
u32 bitmap_low_thresh;
|
||||
|
||||
/*
|
||||
* It is just used for the delayed data space allocation because
|
||||
* only the data space allocation and the relative metadata update
|
||||
* can be done cross the transaction.
|
||||
*/
|
||||
struct rw_semaphore data_rwsem;
|
||||
|
||||
/* For raid56, this is a full stripe, without parity */
|
||||
unsigned long full_stripe_len;
|
||||
|
||||
unsigned int ro;
|
||||
unsigned int iref:1;
|
||||
unsigned int has_caching_ctl:1;
|
||||
unsigned int removed:1;
|
||||
|
||||
int disk_cache_state;
|
||||
|
||||
/* Cache tracking stuff */
|
||||
int cached;
|
||||
struct btrfs_caching_control *caching_ctl;
|
||||
u64 last_byte_to_unpin;
|
||||
|
||||
struct btrfs_space_info *space_info;
|
||||
|
||||
/* Free space cache stuff */
|
||||
struct btrfs_free_space_ctl *free_space_ctl;
|
||||
|
||||
/* Block group cache stuff */
|
||||
struct rb_node cache_node;
|
||||
|
||||
/* For block groups in the same raid type */
|
||||
struct list_head list;
|
||||
|
||||
/* Usage count */
|
||||
atomic_t count;
|
||||
|
||||
/*
|
||||
* List of struct btrfs_free_clusters for this block group.
|
||||
* Today it will only have one thing on it, but that may change
|
||||
*/
|
||||
struct list_head cluster_list;
|
||||
|
||||
/* For delayed block group creation or deletion of empty block groups */
|
||||
struct list_head bg_list;
|
||||
|
||||
/* For read-only block groups */
|
||||
struct list_head ro_list;
|
||||
|
||||
atomic_t trimming;
|
||||
|
||||
/* For dirty block groups */
|
||||
struct list_head dirty_list;
|
||||
struct list_head io_list;
|
||||
|
||||
struct btrfs_io_ctl io_ctl;
|
||||
|
||||
/*
|
||||
* Incremented when doing extent allocations and holding a read lock
|
||||
* on the space_info's groups_sem semaphore.
|
||||
* Decremented when an ordered extent that represents an IO against this
|
||||
* block group's range is created (after it's added to its inode's
|
||||
* root's list of ordered extents) or immediately after the allocation
|
||||
* if it's a metadata extent or fallocate extent (for these cases we
|
||||
* don't create ordered extents).
|
||||
*/
|
||||
atomic_t reservations;
|
||||
|
||||
/*
|
||||
* Incremented while holding the spinlock *lock* by a task checking if
|
||||
* it can perform a nocow write (incremented if the value for the *ro*
|
||||
* field is 0). Decremented by such tasks once they create an ordered
|
||||
* extent or before that if some error happens before reaching that step.
|
||||
* This is to prevent races between block group relocation and nocow
|
||||
* writes through direct IO.
|
||||
*/
|
||||
atomic_t nocow_writers;
|
||||
|
||||
/* Lock for free space tree operations. */
|
||||
struct mutex free_space_lock;
|
||||
|
||||
/*
|
||||
* Does the block group need to be added to the free space tree?
|
||||
* Protected by free_space_lock.
|
||||
*/
|
||||
int needs_free_space;
|
||||
|
||||
/* Record locked full stripes for RAID5/6 block group */
|
||||
struct btrfs_full_stripe_locks_tree full_stripe_locks_root;
|
||||
};
|
||||
|
||||
#ifdef CONFIG_BTRFS_DEBUG
|
||||
static inline int btrfs_should_fragment_free_space(
|
||||
struct btrfs_block_group_cache *block_group)
|
||||
{
|
||||
struct btrfs_fs_info *fs_info = block_group->fs_info;
|
||||
|
||||
return (btrfs_test_opt(fs_info, FRAGMENT_METADATA) &&
|
||||
block_group->flags & BTRFS_BLOCK_GROUP_METADATA) ||
|
||||
(btrfs_test_opt(fs_info, FRAGMENT_DATA) &&
|
||||
block_group->flags & BTRFS_BLOCK_GROUP_DATA);
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* BTRFS_BLOCK_GROUP_H */
|
||||
148
fs/btrfs/ctree.h
148
fs/btrfs/ctree.h
@ -39,6 +39,7 @@ struct btrfs_transaction;
|
||||
struct btrfs_pending_snapshot;
|
||||
struct btrfs_delayed_ref_root;
|
||||
struct btrfs_space_info;
|
||||
struct btrfs_block_group_cache;
|
||||
extern struct kmem_cache *btrfs_trans_handle_cachep;
|
||||
extern struct kmem_cache *btrfs_bit_radix_cachep;
|
||||
extern struct kmem_cache *btrfs_path_cachep;
|
||||
@ -439,26 +440,6 @@ enum btrfs_caching_type {
|
||||
BTRFS_CACHE_ERROR,
|
||||
};
|
||||
|
||||
enum btrfs_disk_cache_state {
|
||||
BTRFS_DC_WRITTEN,
|
||||
BTRFS_DC_ERROR,
|
||||
BTRFS_DC_CLEAR,
|
||||
BTRFS_DC_SETUP,
|
||||
};
|
||||
|
||||
struct btrfs_caching_control {
|
||||
struct list_head list;
|
||||
struct mutex mutex;
|
||||
wait_queue_head_t wait;
|
||||
struct btrfs_work work;
|
||||
struct btrfs_block_group_cache *block_group;
|
||||
u64 progress;
|
||||
refcount_t count;
|
||||
};
|
||||
|
||||
/* Once caching_thread() finds this much free space, it will wake up waiters. */
|
||||
#define CACHING_CTL_WAKE_UP SZ_2M
|
||||
|
||||
struct btrfs_io_ctl {
|
||||
void *cur, *orig;
|
||||
struct page *page;
|
||||
@ -481,120 +462,6 @@ struct btrfs_full_stripe_locks_tree {
|
||||
struct mutex lock;
|
||||
};
|
||||
|
||||
struct btrfs_block_group_cache {
|
||||
struct btrfs_key key;
|
||||
struct btrfs_block_group_item item;
|
||||
struct btrfs_fs_info *fs_info;
|
||||
struct inode *inode;
|
||||
spinlock_t lock;
|
||||
u64 pinned;
|
||||
u64 reserved;
|
||||
u64 delalloc_bytes;
|
||||
u64 bytes_super;
|
||||
u64 flags;
|
||||
u64 cache_generation;
|
||||
|
||||
/*
|
||||
* If the free space extent count exceeds this number, convert the block
|
||||
* group to bitmaps.
|
||||
*/
|
||||
u32 bitmap_high_thresh;
|
||||
|
||||
/*
|
||||
* If the free space extent count drops below this number, convert the
|
||||
* block group back to extents.
|
||||
*/
|
||||
u32 bitmap_low_thresh;
|
||||
|
||||
/*
|
||||
* It is just used for the delayed data space allocation because
|
||||
* only the data space allocation and the relative metadata update
|
||||
* can be done cross the transaction.
|
||||
*/
|
||||
struct rw_semaphore data_rwsem;
|
||||
|
||||
/* for raid56, this is a full stripe, without parity */
|
||||
unsigned long full_stripe_len;
|
||||
|
||||
unsigned int ro;
|
||||
unsigned int iref:1;
|
||||
unsigned int has_caching_ctl:1;
|
||||
unsigned int removed:1;
|
||||
|
||||
int disk_cache_state;
|
||||
|
||||
/* cache tracking stuff */
|
||||
int cached;
|
||||
struct btrfs_caching_control *caching_ctl;
|
||||
u64 last_byte_to_unpin;
|
||||
|
||||
struct btrfs_space_info *space_info;
|
||||
|
||||
/* free space cache stuff */
|
||||
struct btrfs_free_space_ctl *free_space_ctl;
|
||||
|
||||
/* block group cache stuff */
|
||||
struct rb_node cache_node;
|
||||
|
||||
/* for block groups in the same raid type */
|
||||
struct list_head list;
|
||||
|
||||
/* usage count */
|
||||
atomic_t count;
|
||||
|
||||
/* List of struct btrfs_free_clusters for this block group.
|
||||
* Today it will only have one thing on it, but that may change
|
||||
*/
|
||||
struct list_head cluster_list;
|
||||
|
||||
/* For delayed block group creation or deletion of empty block groups */
|
||||
struct list_head bg_list;
|
||||
|
||||
/* For read-only block groups */
|
||||
struct list_head ro_list;
|
||||
|
||||
atomic_t trimming;
|
||||
|
||||
/* For dirty block groups */
|
||||
struct list_head dirty_list;
|
||||
struct list_head io_list;
|
||||
|
||||
struct btrfs_io_ctl io_ctl;
|
||||
|
||||
/*
|
||||
* Incremented when doing extent allocations and holding a read lock
|
||||
* on the space_info's groups_sem semaphore.
|
||||
* Decremented when an ordered extent that represents an IO against this
|
||||
* block group's range is created (after it's added to its inode's
|
||||
* root's list of ordered extents) or immediately after the allocation
|
||||
* if it's a metadata extent or fallocate extent (for these cases we
|
||||
* don't create ordered extents).
|
||||
*/
|
||||
atomic_t reservations;
|
||||
|
||||
/*
|
||||
* Incremented while holding the spinlock *lock* by a task checking if
|
||||
* it can perform a nocow write (incremented if the value for the *ro*
|
||||
* field is 0). Decremented by such tasks once they create an ordered
|
||||
* extent or before that if some error happens before reaching that step.
|
||||
* This is to prevent races between block group relocation and nocow
|
||||
* writes through direct IO.
|
||||
*/
|
||||
atomic_t nocow_writers;
|
||||
|
||||
/* Lock for free space tree operations. */
|
||||
struct mutex free_space_lock;
|
||||
|
||||
/*
|
||||
* Does the block group need to be added to the free space tree?
|
||||
* Protected by free_space_lock.
|
||||
*/
|
||||
int needs_free_space;
|
||||
|
||||
/* Record locked full stripes for RAID5/6 block group */
|
||||
struct btrfs_full_stripe_locks_tree full_stripe_locks_root;
|
||||
};
|
||||
|
||||
/* delayed seq elem */
|
||||
struct seq_list {
|
||||
struct list_head list;
|
||||
@ -1387,19 +1254,6 @@ static inline u32 BTRFS_MAX_XATTR_SIZE(const struct btrfs_fs_info *info)
|
||||
btrfs_clear_opt(fs_info->mount_opt, opt); \
|
||||
}
|
||||
|
||||
#ifdef CONFIG_BTRFS_DEBUG
|
||||
static inline int
|
||||
btrfs_should_fragment_free_space(struct btrfs_block_group_cache *block_group)
|
||||
{
|
||||
struct btrfs_fs_info *fs_info = block_group->fs_info;
|
||||
|
||||
return (btrfs_test_opt(fs_info, FRAGMENT_METADATA) &&
|
||||
block_group->flags & BTRFS_BLOCK_GROUP_METADATA) ||
|
||||
(btrfs_test_opt(fs_info, FRAGMENT_DATA) &&
|
||||
block_group->flags & BTRFS_BLOCK_GROUP_DATA);
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Requests for changes that need to be done during transaction commit.
|
||||
*
|
||||
|
||||
@ -40,6 +40,7 @@
|
||||
#include "compression.h"
|
||||
#include "tree-checker.h"
|
||||
#include "ref-verify.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#define BTRFS_SUPER_FLAG_SUPP (BTRFS_HEADER_FLAG_WRITTEN |\
|
||||
BTRFS_HEADER_FLAG_RELOC |\
|
||||
|
||||
@ -32,6 +32,7 @@
|
||||
#include "space-info.h"
|
||||
#include "block-rsv.h"
|
||||
#include "delalloc-space.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#undef SCRAMBLE_DELAYED_REFS
|
||||
|
||||
|
||||
@ -20,6 +20,7 @@
|
||||
#include "volumes.h"
|
||||
#include "space-info.h"
|
||||
#include "delalloc-space.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#define BITS_PER_BITMAP (PAGE_SIZE * 8UL)
|
||||
#define MAX_CACHE_BYTES_PER_GIG SZ_32K
|
||||
|
||||
@ -10,6 +10,7 @@
|
||||
#include "locking.h"
|
||||
#include "free-space-tree.h"
|
||||
#include "transaction.h"
|
||||
#include "block-group.h"
|
||||
|
||||
static int __add_block_group_free_space(struct btrfs_trans_handle *trans,
|
||||
struct btrfs_block_group_cache *block_group,
|
||||
|
||||
@ -6,6 +6,8 @@
|
||||
#ifndef BTRFS_FREE_SPACE_TREE_H
|
||||
#define BTRFS_FREE_SPACE_TREE_H
|
||||
|
||||
struct btrfs_caching_control;
|
||||
|
||||
/*
|
||||
* The default size for new free space bitmap items. The last bitmap in a block
|
||||
* group may be truncated, and none of the free space tree code assumes that
|
||||
|
||||
@ -47,6 +47,7 @@
|
||||
#include "props.h"
|
||||
#include "qgroup.h"
|
||||
#include "delalloc-space.h"
|
||||
#include "block-group.h"
|
||||
|
||||
struct btrfs_iget_args {
|
||||
struct btrfs_key *location;
|
||||
|
||||
@ -45,6 +45,7 @@
|
||||
#include "compression.h"
|
||||
#include "space-info.h"
|
||||
#include "delalloc-space.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#ifdef CONFIG_64BIT
|
||||
/* If we have a 32-bit userspace and 64-bit kernel, then the UAPI
|
||||
|
||||
@ -21,7 +21,7 @@
|
||||
#include "backref.h"
|
||||
#include "extent_io.h"
|
||||
#include "qgroup.h"
|
||||
|
||||
#include "block-group.h"
|
||||
|
||||
/* TODO XXX FIXME
|
||||
* - subvol delete -> delete when ref goes to 0? delete limits also?
|
||||
|
||||
@ -14,6 +14,7 @@
|
||||
#include "disk-io.h"
|
||||
#include "transaction.h"
|
||||
#include "dev-replace.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#undef DEBUG
|
||||
|
||||
|
||||
@ -21,6 +21,7 @@
|
||||
#include "qgroup.h"
|
||||
#include "print-tree.h"
|
||||
#include "delalloc-space.h"
|
||||
#include "block-group.h"
|
||||
|
||||
/*
|
||||
* backref_node, mapping_node and tree_block start with this
|
||||
|
||||
@ -18,6 +18,7 @@
|
||||
#include "check-integrity.h"
|
||||
#include "rcu-string.h"
|
||||
#include "raid56.h"
|
||||
#include "block-group.h"
|
||||
|
||||
/*
|
||||
* This is only the first step towards a full-features scrub. It reads all
|
||||
|
||||
@ -8,6 +8,7 @@
|
||||
#include "ordered-data.h"
|
||||
#include "transaction.h"
|
||||
#include "math.h"
|
||||
#include "block-group.h"
|
||||
|
||||
u64 btrfs_space_info_used(struct btrfs_space_info *s_info,
|
||||
bool may_use_included)
|
||||
|
||||
@ -44,6 +44,7 @@
|
||||
#include "backref.h"
|
||||
#include "space-info.h"
|
||||
#include "tests/btrfs-tests.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#include "qgroup.h"
|
||||
#define CREATE_TRACE_POINTS
|
||||
|
||||
@ -17,6 +17,7 @@
|
||||
#include "sysfs.h"
|
||||
#include "volumes.h"
|
||||
#include "space-info.h"
|
||||
#include "block-group.h"
|
||||
|
||||
static inline struct btrfs_fs_info *to_fs_info(struct kobject *kobj);
|
||||
static inline struct btrfs_fs_devices *to_fs_devs(struct kobject *kobj);
|
||||
|
||||
@ -15,6 +15,7 @@
|
||||
#include "../volumes.h"
|
||||
#include "../disk-io.h"
|
||||
#include "../qgroup.h"
|
||||
#include "../block-group.h"
|
||||
|
||||
static struct vfsmount *test_mnt = NULL;
|
||||
|
||||
|
||||
@ -8,6 +8,7 @@
|
||||
#include "../ctree.h"
|
||||
#include "../disk-io.h"
|
||||
#include "../free-space-cache.h"
|
||||
#include "../block-group.h"
|
||||
|
||||
#define BITS_PER_BITMAP (PAGE_SIZE * 8UL)
|
||||
|
||||
|
||||
@ -9,6 +9,7 @@
|
||||
#include "../disk-io.h"
|
||||
#include "../free-space-tree.h"
|
||||
#include "../transaction.h"
|
||||
#include "../block-group.h"
|
||||
|
||||
struct free_space_extent {
|
||||
u64 start;
|
||||
|
||||
@ -19,6 +19,7 @@
|
||||
#include "volumes.h"
|
||||
#include "dev-replace.h"
|
||||
#include "qgroup.h"
|
||||
#include "block-group.h"
|
||||
|
||||
#define BTRFS_ROOT_TRANS_TAG 0
|
||||
|
||||
|
||||
@ -29,6 +29,7 @@
|
||||
#include "sysfs.h"
|
||||
#include "tree-checker.h"
|
||||
#include "space-info.h"
|
||||
#include "block-group.h"
|
||||
|
||||
const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = {
|
||||
[BTRFS_RAID_RAID10] = {
|
||||
|
||||
Loading…
Reference in New Issue
Block a user