btrfs: generic readeahead interface
v5 cover btrfs: generic readeahead interface
This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time.
Also the initial build-ups of free-space-caches and inode-allocator-caches could be sped up.
To make testing easier, a simple ioctl interface is added to trigger a read- ahead from user mode. It also implements a tree walk in the traditional way.
A simple demonstration from my 7-disk test btrfs:
- enumerating the extent tree (traditional): 351s
- enumerating the extent tree (readahead): 41s
- enumerating extents+csum tree (readahead): 49s
The implementation is also tested with this tool in various combinations of parallel reads of the same and of different trees.
The main changes from v1 are:
- Switch from extent_state flags to extent_buffer flags.
- Fix a race when triggering the read.
- Fix a bug where only parts of the requested range where actually prefetched. The hit only when requesting parts of a tree, so the above numbers doesn't change.
Change from v2:
- use rcu instead of transaction to protect root->node
Changes from v3:
- rebased to current for-linus
- in v3 patch 1 was missing
Changes from v4:
- adoptions according the Josef's review. See the parts for more detailed comments
This series is also available atgit://git.kernel.org/pub/scm/linux/kernel/git/arne/btrfs-unstable-arne.git readahead
Arne Jansen (7):
btrfs: add an extra wait mode to read_extent_buffer_pages
btrfs: add READAHEAD extent buffer flag
btrfs: state information for readahead
btrfs: initial readahead code and prototypes
btrfs: hooks for readahead
btrfs: test ioctl for readahead
btrfs: use readahead API for scrub
fs/btrfs/Makefile | 3 +- fs/btrfs/ctree.h | 21 ++ fs/btrfs/disk-io.c | 85 +++++- fs/btrfs/disk-io.h | 2 + fs/btrfs/extent_io.c | 9 +- fs/btrfs/extent_io.h | 4 + fs/btrfs/ioctl.c | 93 +++++- fs/btrfs/ioctl.h | 16 + fs/btrfs/reada.c | 949 ++++++++++++++++++++++++++++++++++++++++++++++++++ fs/btrfs/scrub.c | 116 +++---- fs/btrfs/volumes.c | 8 + fs/btrfs/volumes.h | 8 + 12 files changed, 1239 insertions(+), 75 deletions(-) create mode 100644 fs/btrfs/reada.c
Signature · 1 line
1.7.3.4
PATCH v5 1/7 btrfs: add an extra wait mode to read_extent_buffer_pages
read_extent_buffer_pages currently has two modes, either trigger a read without waiting for anything, or wait for the I/O to finish. The former also bails when it's unable to lock the page. This patch now adds an additional parameter to allow it to block on page lock, but don't wait for completion.
Changes v5:
- merge the 2 wait parameters into one and define WAIT_NONE, WAIT_COMPLETE and WAIT_PAGE_LOCK
--- fs/btrfs/disk-io.c | 5 +++-- fs/btrfs/extent_io.c | 7 +++---- fs/btrfs/extent_io.h | 3 +++ 3 files changed, 9 insertions(+), 6 deletions(-)
fs/btrfs/disk-io.c +3 -2
@@ -325,7 +325,8 @@ static int btree_read_extent_buffer_pages(struct btrfs_root *root,clear_bit (EXTENT_BUFFER_CORRUPT , &eb->bflags); io_tree = &BTRFS_I (root->fs_info->btree_inode)->io_tree;while (1 ) { - ret =read_extent_buffer_pages (io_tree, eb, start,1 , + ret =read_extent_buffer_pages (io_tree, eb, start, +WAIT_COMPLETE , btree_get_extent, mirror_num);if (!ret && !verify_parent_transid (io_tree, eb, parent_transid))
@@ -940,7 +941,7 @@ int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,if (!buf)return 0 ;read_extent_buffer_pages (&BTRFS_I (btree_inode)->io_tree, - buf,0 ,0 , btree_get_extent,0 ); + buf,0 ,WAIT_NONE , btree_get_extent,0 );free_extent_buffer (buf);return ret; }
fs/btrfs/extent_io.c +3 -4
@@ -3357,8 +3357,7 @@ int extent_buffer_uptodate(struct extent_io_tree *tree, }int read_extent_buffer_pages (struct extent_io_tree *tree, -struct extent_buffer *eb, -u64 start,int wait, +struct extent_buffer *eb,u64 start,int wait,get_extent_t *get_extent,int mirror_num) {unsigned long i;
@@ -3392,7 +3391,7 @@ int read_extent_buffer_pages(struct extent_io_tree *tree, num_pages =num_extent_pages (eb->start, eb->len);for (i = start_i; i < num_pages; i++) { page =extent_buffer_page (eb, i); -if (!wait) { +if (wait !=WAIT_NONE ) {if (!trylock_page (page)) goto unlock_exit; }else {
@@ -3436,7 +3435,7 @@ int read_extent_buffer_pages(struct extent_io_tree *tree,if (bio)submit_one_bio (READ , bio, mirror_num, bio_flags); -if (ret || !wait) +if (ret || wait !=WAIT_COMPLETE )return ret;for (i = start_i; i < num_pages; i++) {
fs/btrfs/extent_io.h +3 -0
@@ -240,6 +240,9 @@ struct extent_buffer *alloc_extent_buffer(struct extent_io_tree *tree,struct extent_buffer *find_extent_buffer (struct extent_io_tree *tree,u64 start,unsigned long len);void free_extent_buffer (struct extent_buffer *eb); +#define WAIT_NONE 0 +#define WAIT_COMPLETE 1 +#define WAIT_PAGE_LOCK 2int read_extent_buffer_pages (struct extent_io_tree *tree,struct extent_buffer *eb,u64 start,int wait,get_extent_t *get_extent,int mirror_num);
Signature · 1 line
1.7.3.4
PATCH v6 1/1 btrfs: add an extra wait mode to read_extent_buffer_pages
read_extent_buffer_pages currently has two modes, either trigger a read without waiting for anything, or wait for the I/O to finish. The former also bails when it's unable to lock the page. This patch now adds an additional parameter to allow it to block on page lock, but don't wait for completion.
Changes v5:
- merge the 2 wait parameters into one and define WAIT_NONE, WAIT_COMPLETE and WAIT_PAGE_LOCK
Change v6:
- Fix stupid bug in the test of wait flag
--- fs/btrfs/disk-io.c | 5 +++-- fs/btrfs/extent_io.c | 7 +++---- fs/btrfs/extent_io.h | 3 +++ 3 files changed, 9 insertions(+), 6 deletions(-)
fs/btrfs/disk-io.c +3 -2
@@ -322,7 +322,8 @@ static int btree_read_extent_buffer_pages(struct btrfs_root *root,clear_bit (EXTENT_BUFFER_CORRUPT , &eb->bflags); io_tree = &BTRFS_I (root->fs_info->btree_inode)->io_tree;while (1 ) { - ret =read_extent_buffer_pages (io_tree, eb, start,1 , + ret =read_extent_buffer_pages (io_tree, eb, start, +WAIT_COMPLETE , btree_get_extent, mirror_num);if (!ret && !verify_parent_transid (io_tree, eb, parent_transid))
@@ -937,7 +938,7 @@ int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,if (!buf)return 0 ;read_extent_buffer_pages (&BTRFS_I (btree_inode)->io_tree, - buf,0 ,0 , btree_get_extent,0 ); + buf,0 ,WAIT_NONE , btree_get_extent,0 );free_extent_buffer (buf);return ret; }
fs/btrfs/extent_io.c +3 -4
@@ -3364,8 +3364,7 @@ int extent_buffer_uptodate(struct extent_io_tree *tree, }int read_extent_buffer_pages (struct extent_io_tree *tree, -struct extent_buffer *eb, -u64 start,int wait, +struct extent_buffer *eb,u64 start,int wait,get_extent_t *get_extent,int mirror_num) {unsigned long i;
@@ -3399,7 +3398,7 @@ int read_extent_buffer_pages(struct extent_io_tree *tree, num_pages =num_extent_pages (eb->start, eb->len);for (i = start_i; i < num_pages; i++) { page =extent_buffer_page (eb, i); -if (!wait) { +if (wait ==WAIT_NONE ) {if (!trylock_page (page)) goto unlock_exit; }else {
@@ -3443,7 +3442,7 @@ int read_extent_buffer_pages(struct extent_io_tree *tree,if (bio)submit_one_bio (READ , bio, mirror_num, bio_flags); -if (ret || !wait) +if (ret || wait !=WAIT_COMPLETE )return ret;for (i = start_i; i < num_pages; i++) {
fs/btrfs/extent_io.h +3 -0
@@ -245,6 +245,9 @@ struct extent_buffer *alloc_extent_buffer(struct extent_io_tree *tree,struct extent_buffer *find_extent_buffer (struct extent_io_tree *tree,u64 start,unsigned long len);void free_extent_buffer (struct extent_buffer *eb); +#define WAIT_NONE 0 +#define WAIT_COMPLETE 1 +#define WAIT_PAGE_LOCK 2int read_extent_buffer_pages (struct extent_io_tree *tree,struct extent_buffer *eb,u64 start,int wait,get_extent_t *get_extent,int mirror_num);
Signature · 1 line
1.7.3.4
PATCH v5 2/7 btrfs: add READAHEAD extent buffer flag
In reply to Arne JansenAdd a READAHEAD extent buffer flag.
Add a function to trigger a read with this flag set.
Changes v2:
- use extent buffer flags instead of extent state flags
Changes v5:
- adapt to changed read_extent_buffer_pages interface
- don't return eb from reada_tree_block_flagged if it has CORRUPT flag set
--- fs/btrfs/disk-io.c | 32 ++++++++++++++++++++++++++++++++ fs/btrfs/disk-io.h | 2 ++ fs/btrfs/extent_io.h | 1 + 3 files changed, 35 insertions(+), 0 deletions(-)
fs/btrfs/disk-io.c +32 -0
@@ -946,6 +946,38 @@ int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,return ret; } +int reada_tree_block_flagged (struct btrfs_root *root,u64 bytenr,u32 blocksize, +int mirror_num,struct extent_buffer **eb) +{ +struct extent_buffer *buf =NULL ; +struct inode *btree_inode = root->fs_info->btree_inode; +struct extent_io_tree *io_tree = &BTRFS_I (btree_inode)->io_tree; +int ret; + + buf =btrfs_find_create_tree_block (root, bytenr, blocksize); +if (!buf) +return 0 ; + +set_bit (EXTENT_BUFFER_READAHEAD , &buf->bflags); + + ret =read_extent_buffer_pages (io_tree, buf,0 ,WAIT_PAGE_LOCK , + btree_get_extent, mirror_num); +if (ret) { +free_extent_buffer (buf); +return ret; + } + +if (test_bit (EXTENT_BUFFER_CORRUPT , &buf->bflags)) { +free_extent_buffer (buf); +return -EIO ; + }else if (extent_buffer_uptodate (io_tree, buf,NULL )) { + *eb = buf; + }else { +free_extent_buffer (buf); + } +return 0 ; +} +struct extent_buffer *btrfs_find_tree_block (struct btrfs_root *root,u64 bytenr,u32 blocksize) {
fs/btrfs/disk-io.h +2 -0
@@ -40,6 +40,8 @@ struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize, u64 parent_transid);int readahead_tree_block (struct btrfs_root *root,u64 bytenr,u32 blocksize,u64 parent_transid); +int reada_tree_block_flagged (struct btrfs_root *root,u64 bytenr,u32 blocksize, +int mirror_num,struct extent_buffer **eb);struct extent_buffer *btrfs_find_create_tree_block (struct btrfs_root *root,u64 bytenr,u32 blocksize); int clean_tree_block(struct btrfs_trans_handle *trans,
fs/btrfs/extent_io.h +1 -0
@@ -32,6 +32,7 @@#define EXTENT_BUFFER_BLOCKING 1#define EXTENT_BUFFER_DIRTY 2#define EXTENT_BUFFER_CORRUPT 3 +#define EXTENT_BUFFER_READAHEAD 4/* this got triggered by readahead */ /* these are flags for extent_clear_unlock_delalloc */ #define EXTENT_CLEAR_UNLOCK_PAGE 0x1
Signature · 1 line
1.7.3.4
PATCH v5 3/7 btrfs: state information for readahead
In reply to Arne JansenAdd state information for readahead to btrfs_fs_info and btrfs_device
Changes v2:
- don't wait in radix_trees
- add own set of workers for readahead
--- fs/btrfs/ctree.h | 5 +++++ fs/btrfs/disk-io.c | 11 +++++++++++ fs/btrfs/volumes.c | 8 ++++++++ fs/btrfs/volumes.h | 8 ++++++++ 4 files changed, 32 insertions(+), 0 deletions(-)
fs/btrfs/ctree.h +5 -0
@@ -1033,6 +1033,7 @@ struct btrfs_fs_info {struct btrfs_workers endio_write_workers;struct btrfs_workers endio_freespace_worker;struct btrfs_workers submit_workers; +struct btrfs_workers readahead_workers;/* * fixup workers take dirty pages that didn't properly go through * the cow mechanism and make them safe to write. It happens
@@ -1115,6 +1116,10 @@ struct btrfs_fs_info {u64 fs_state;struct btrfs_delayed_root *delayed_root; + +/* readahead tree */ +spinlock_t reada_lock; +struct radix_tree_root reada_tree; };/*
fs/btrfs/disk-io.c +11 -0
@@ -1682,6 +1682,10 @@ struct btrfs_root *open_ctree(struct super_block *sb, fs_info->defrag_inodes =RB_ROOT ; fs_info->trans_no_join =0 ; +/* readahead state */ +INIT_RADIX_TREE (&fs_info->reada_tree,GFP_NOFS & ~__GFP_WAIT); +spin_lock_init (&fs_info->reada_lock); + fs_info->thread_pool_size = min_t(unsigned long,num_online_cpus () +2 ,8 );
@@ -1871,6 +1875,9 @@ struct btrfs_root *open_ctree(struct super_block *sb,btrfs_init_workers (&fs_info->delayed_workers,"delayed-meta" , fs_info->thread_pool_size, &fs_info->generic_worker); +btrfs_init_workers (&fs_info->readahead_workers,"readahead" , + fs_info->thread_pool_size, + &fs_info->generic_worker);/* * endios are largely parallel and should have a very
@@ -1881,6 +1888,7 @@ struct btrfs_root *open_ctree(struct super_block *sb, fs_info->endio_write_workers.idle_thresh =2 ; fs_info->endio_meta_write_workers.idle_thresh =2 ; + fs_info->readahead_workers.idle_thresh =2 ;btrfs_start_workers (&fs_info->workers,1 );btrfs_start_workers (&fs_info->generic_worker,1 );
@@ -1893,6 +1901,7 @@ struct btrfs_root *open_ctree(struct super_block *sb,btrfs_start_workers (&fs_info->endio_write_workers,1 );btrfs_start_workers (&fs_info->endio_freespace_worker,1 );btrfs_start_workers (&fs_info->delayed_workers,1 ); +btrfs_start_workers (&fs_info->readahead_workers,1 ); fs_info->bdi.ra_pages *=btrfs_super_num_devices (disk_super); fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
@@ -2150,6 +2159,7 @@ fail_sb_buffer:btrfs_stop_workers (&fs_info->endio_freespace_worker);btrfs_stop_workers (&fs_info->submit_workers);btrfs_stop_workers (&fs_info->delayed_workers); +btrfs_stop_workers (&fs_info->readahead_workers); fail_alloc:kfree (fs_info->delayed_root); fail_iput:
@@ -2617,6 +2627,7 @@ int close_ctree(struct btrfs_root *root)btrfs_stop_workers (&fs_info->endio_freespace_worker);btrfs_stop_workers (&fs_info->submit_workers);btrfs_stop_workers (&fs_info->delayed_workers); +btrfs_stop_workers (&fs_info->readahead_workers);btrfs_close_devices (fs_info->fs_devices);btrfs_mapping_tree_free (&fs_info->mapping_tree);
fs/btrfs/volumes.c +8 -0
@@ -349,6 +349,14 @@ static noinline int device_list_add(const char *path, }INIT_LIST_HEAD (&device->dev_alloc_list); +/* init readahead state */ +spin_lock_init (&device->reada_lock); + device->reada_curr_zone =NULL ; +atomic_set (&device->reada_in_flight,0 ); + device->reada_next =0 ; +INIT_RADIX_TREE (&device->reada_zones,GFP_NOFS & ~__GFP_WAIT); +INIT_RADIX_TREE (&device->reada_extents,GFP_NOFS & ~__GFP_WAIT); +mutex_lock (&fs_devices->device_list_mutex);list_add_rcu (&device->dev_list, &fs_devices->devices);mutex_unlock (&fs_devices->device_list_mutex);
fs/btrfs/volumes.h +8 -0
@@ -91,6 +91,14 @@ struct btrfs_device {struct btrfs_work work;struct rcu_head rcu;struct work_struct rcu_work; + +/* readahead state */ +spinlock_t reada_lock; +atomic_t reada_in_flight; +u64 reada_next; +struct reada_zone *reada_curr_zone; +struct radix_tree_root reada_zones; +struct radix_tree_root reada_extents; };struct btrfs_fs_devices {
Signature · 1 line
1.7.3.4
PATCH v5 4/7 btrfs: initial readahead code and prototypes
In reply to Arne JansenThis is the implementation for the generic read ahead framework.
To trigger a readahead, btrfs_reada_add must be called. It will start a read ahead for the given range [start, end) on tree root. The returned handle can either be used to wait on the readahead to finish (btrfs_reada_wait), or to send it to the background (btrfs_reada_detach).
The read ahead works as follows:
On btrfs_reada_add, the root of the tree is inserted into a radix_tree. reada_start_machine will then search for extents to prefetch and trigger some reads. When a read finishes for a node, all contained node/leaf pointers that lie in the given range will also be enqueued. The reads will be triggered in sequential order, thus giving a big win over a naive enumeration. It will also make use of multi-device layouts. Each disk will have its on read pointer and all disks will by utilized in parallel. Also will no two disks read both sides of a mirror simultaneously, as this would waste seeking capacity. Instead both disks will read different parts of the filesystem.
Any number of readaheads can be started in parallel. The read order will be determined globally, i.e. 2 parallel readaheads will normally finish faster than the 2 started one after another.
Changes v2:
- protect root->node by transaction instead of node_lock
- fix missed branches:
The readahead had a too simple check to determine if a branch from a node should be checked or not. It now also records the upper bound of each node to see if the requested RA range lies within.
- use KERN_CONT to debug output, to avoid line breaks
- defer reada_start_machine to worker to avoid deadlock
Changes v3:
- protect root->node by rcu
Changes v5:
- changed EIO-semantics of reada_tree_block_flagged
- remove spin_lock from reada_control and make elems an atomic_t
- remove unused read_total from reada_control
- kill reada_key_cmp, use btrfs_comp_cpu_keys instead
- use kref-style release functions where possible
- return struct reada_control * instead of void * from btrfs_reada_add
--- fs/btrfs/Makefile | 3 +- fs/btrfs/ctree.h | 16 + fs/btrfs/reada.c | 949 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 967 insertions(+), 1 deletions(-)
fs/btrfs/Makefile +2 -1
@@ -7,4 +7,5 @@ btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \ extent_map.o sysfs.o struct-funcs.o xattr.o ordered-data.o \ extent_io.o volumes.o async-thread.o ioctl.o locking.o orphan.o \ export.o tree-log.o acl.o free-space-cache.o zlib.o lzo.o \ - compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o + compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o \ + reada.o
fs/btrfs/ctree.h +16 -0
@@ -2681,4 +2681,20 @@ int btrfs_scrub_cancel_devid(struct btrfs_root *root, u64 devid);int btrfs_scrub_progress (struct btrfs_root *root,u64 devid,struct btrfs_scrub_progress *progress); +/* reada.c */ +struct reada_control { +struct btrfs_root *root;/* tree to prefetch */ +struct btrfs_key key_start; +struct btrfs_key key_end;/* exclusive */ +atomic_t elems; +struct kref refcnt; +wait_queue_head_t wait; +}; +struct reada_control *btrfs_reada_add (struct btrfs_root *root, +struct btrfs_key *start,struct btrfs_key *end); +int btrfs_reada_wait (void *handle); +void btrfs_reada_detach (void *handle); +int btree_readahead_hook (struct btrfs_root *root,struct extent_buffer *eb, +u64 start,int err); +#endif
fs/btrfs/reada.c new file +949 -0
949 lines not on this page · raw message
Signature · 1 line
1.7.3.4
PATCH v5 5/7 btrfs: hooks for readahead
In reply to Arne JansenThis adds the hooks needed for readahead. In the readpage_end_io_hook, the extent state is checked for the EXTENT_READAHEAD flag. Only in this case the readahead hook is called, to keep the impact on non-ra as low as possible.
Additionally, a hook for a failed IO is added, otherwise readahead would wait indefinitely for the extent to finish.
Changes for v2:
- eliminate race condition
--- fs/btrfs/disk-io.c | 37 +++++++++++++++++++++++++++++++++++++ fs/btrfs/extent_io.c | 2 +- 2 files changed, 38 insertions(+), 1 deletions(-)
fs/btrfs/disk-io.c +37 -0
@@ -575,11 +575,47 @@ static int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end, end =min_t (u64, eb->len,PAGE_CACHE_SIZE ); end = eb->start + end -1 ; err: +if (test_bit (EXTENT_BUFFER_READAHEAD , &eb->bflags)) { +clear_bit (EXTENT_BUFFER_READAHEAD , &eb->bflags); +btree_readahead_hook (root, eb, eb->start, ret); + } +free_extent_buffer (eb); out:return ret; } +static int btree_io_failed_hook (struct bio *failed_bio, +struct page *page,u64 start,u64 end, +struct extent_state *state) +{ +struct extent_io_tree *tree; +unsigned long len; +struct extent_buffer *eb; +struct btrfs_root *root =BTRFS_I (page->mapping->host)->root; + + tree = &BTRFS_I (page->mapping->host)->io_tree; +if (page->private ==EXTENT_PAGE_PRIVATE ) + goto out; +if (!page->private) + goto out; + + len = page->private >>2 ; +WARN_ON (len ==0 ); + + eb =alloc_extent_buffer (tree, start, len, page); +if (eb ==NULL ) + goto out; + +if (test_bit (EXTENT_BUFFER_READAHEAD , &eb->bflags)) { +clear_bit (EXTENT_BUFFER_READAHEAD , &eb->bflags); +btree_readahead_hook (root, eb, eb->start, -EIO ); + } + +out: +return -EIO ;/* we fixed nothing */ +} +static void end_workqueue_bio (struct bio *bio,int err) {struct end_io_wq *end_io_wq = bio->bi_private;
@@ -3134,6 +3170,7 @@ static int btrfs_cleanup_transaction(struct btrfs_root *root)static struct extent_io_ops btree_extent_io_ops = { .write_cache_pages_lock_hook = btree_lock_page_hook, .readpage_end_io_hook = btree_readpage_end_io_hook, + .readpage_io_failed_hook = btree_io_failed_hook, .submit_bio_hook = btree_submit_bio_hook,/* note we're sharing with inode.c for the merge bio hook */ .merge_bio_hook = btrfs_merge_bio_hook,
fs/btrfs/extent_io.c +1 -1
@@ -1774,7 +1774,7 @@ static void end_bio_extent_readpage(struct bio *bio, int err)if (!uptodate && tree->ops && tree->ops->readpage_io_failed_hook) { ret = tree->ops->readpage_io_failed_hook (bio, page, - start, end,NULL ); + start, end, state);if (ret ==0 ) { uptodate =test_bit (BIO_UPTODATE , &bio->bi_flags);
Signature · 1 line
1.7.3.4
PATCH v5 6/7 btrfs: test ioctl for readahead
In reply to Arne JansenThis ioctl is added to trigger a readahead from user mode. It implements a readahead using the new interface and also a traditional tree walk. This way it's possible to measure the two side by side.
Changes v5:
- handle is not of type struct reada_control
--- fs/btrfs/ioctl.c | 93 ++++++++++++++++++++++++++++++++++++++++++++++++++++-- fs/btrfs/ioctl.h | 16 +++++++++ 2 files changed, 106 insertions(+), 3 deletions(-)
fs/btrfs/ioctl.c +90 -3
@@ -2784,6 +2784,93 @@ static noinline long btrfs_ioctl_wait_sync(struct file *file, void __user *argp)return btrfs_wait_for_commit (root, transid); } +static noinline long btrfs_ioctl_reada_test (struct btrfs_fs_info *fs_info, +void __user *argp) +{ +struct btrfs_key start = {0 }; +struct btrfs_key end = { + .objectid = (u64)-1 , + .type = (u8)-1 , + .offset = (u64)-1 + }; +struct btrfs_ioctl_reada_args reada_args; +struct btrfs_key key; +struct btrfs_root *root =NULL ; + +if (!argp) +return -EINVAL ; + +if (!capable (CAP_SYS_ADMIN )) +return -EPERM ; + +if (copy_from_user (&reada_args, + (struct btrfs_ioctl_reada_args __user *)argp, +sizeof (reada_args))) +return -EFAULT ; + + start.objectid = reada_args.start_objectid; + start.type = reada_args.start_type; + start.offset = reada_args.start_offset; + end.objectid = reada_args.end_objectid; + end.type = reada_args.end_type; + end.offset = reada_args.end_offset; + + key.objectid = reada_args.tree; + key.type =BTRFS_ROOT_ITEM_KEY ; + key.offset = (u64)-1 ; + root =btrfs_read_fs_root_no_name (fs_info, &key); +if (IS_ERR (root)) +return -ENOENT ; + +if (!(reada_args.flags &BTRFS_READA_IOC_FLAGS_TRAD )) { +struct reada_control *handle; + + handle =btrfs_reada_add (root, &start, &end); +if (IS_ERR (handle)) +return PTR_ERR (handle); + +if (reada_args.flags &BTRFS_READA_IOC_FLAGS_WAIT ) +btrfs_reada_wait (handle); +else +btrfs_reada_detach (handle); + }else { +struct btrfs_path *path; +struct extent_buffer *leaf; +int slot; +int ret; + +/* +* enumerate the tree the traditional way +*/ + path =btrfs_alloc_path (); +if (!path) +return -ENOMEM ; + path->reada =2 ; + + ret =btrfs_search_slot (NULL , root, &start, path,0 ,0 ); +if (ret <0 ) + goto out; + +do { + leaf = path->nodes[0 ]; + slot = path->slots[0 ]; +btrfs_item_key_to_cpu (leaf, &key, slot); + +if (key.objectid > end.objectid) +break ; +if (key.objectid == end.objectid && key.type > end.type) +break ; +if (key.objectid == end.objectid && + key.type == end.type && key.offset > end.offset) +break ; + }while ((ret =btrfs_next_leaf (root, path)) ==0 ); +out: +btrfs_free_path (path); +return ret >=0 ?0 : ret; + } +return 0 ; +} +static long btrfs_ioctl_scrub (struct btrfs_root *root,void __user *arg) {int ret;
@@ -2836,8 +2923,7 @@ static long btrfs_ioctl_scrub_progress(struct btrfs_root *root,return ret; } -long btrfs_ioctl (struct file *file,unsigned int - cmd,unsigned long arg) +long btrfs_ioctl (struct file *file,unsigned int cmd,unsigned long arg) {struct btrfs_root *root =BTRFS_I (fdentry (file)->d_inode)->root;void __user *argp = (void __user *)arg;
@@ -2908,7 +2994,8 @@ long btrfs_ioctl(struct file *file, unsigned intreturn btrfs_ioctl_scrub_cancel (root, argp);case BTRFS_IOC_SCRUB_PROGRESS :return btrfs_ioctl_scrub_progress (root, argp); +case BTRFS_IOC_READA_TEST : +return btrfs_ioctl_reada_test (root->fs_info, argp); } -return -ENOTTY ; }
fs/btrfs/ioctl.h +16 -0
@@ -193,6 +193,20 @@ struct btrfs_ioctl_space_args {struct btrfs_ioctl_space_info spaces[0 ]; }; +#define BTRFS_READA_IOC_FLAGS_WAIT 1 +#define BTRFS_READA_IOC_FLAGS_TRAD 2 +struct btrfs_ioctl_reada_args { +__u64 flags; +__u64 tree; +__u64 start_objectid; +__u8 start_type; +__u64 start_offset; +__u64 end_objectid; +__u8 end_type; +__u64 end_offset; +__u64 unused[100 ]; +}; +#define BTRFS_IOC_SNAP_CREATE _IOW(BTRFS_IOCTL_MAGIC, 1, \ struct btrfs_ioctl_vol_args)#define BTRFS_IOC_DEFRAG _IOW(BTRFS_IOCTL_MAGIC, 2, \
@@ -248,4 +262,6 @@ struct btrfs_ioctl_space_args { struct btrfs_ioctl_dev_info_args)#define BTRFS_IOC_FS_INFO _IOR(BTRFS_IOCTL_MAGIC, 31, \ struct btrfs_ioctl_fs_info_args) +#define BTRFS_IOC_READA_TEST _IOW(BTRFS_IOCTL_MAGIC, 99, \ + struct btrfs_ioctl_reada_args)#endif
Signature · 1 line
1.7.3.4
PATCH v5 7/7 btrfs: use readahead API for scrub
In reply to Arne JansenScrub uses a simple tree-enumeration to bring the relevant portions of the extent- and csum-tree into the page cache before starting the scrub-I/O. This is now replaced by using the new readahead-API. During readahead the scrub is being accounted as paused, so it won't hold off transaction commits.
This change raises the average disk bandwith utilisation on my test volume from 70% to 90%. On another volume, the time for a test run went down from 89s to 43s.
Changes v5:
- reada1/2 are now of type struct reada_control *
--- fs/btrfs/scrub.c | 116 ++++++++++++++++++++++++------------------------------ 1 files changed, 52 insertions(+), 64 deletions(-)
fs/btrfs/scrub.c +50 -62
@@ -29,15 +29,12 @@* any can be found. * * Future enhancements: -* - To enhance the performance, better read-ahead strategies for the -* extent-tree can be employed. * - In case an unrepairable extent is encountered, track which files are * affected and report them * - In case of a read error on files with nodatasum, map the file and read * the extent to trigger a writeback of the good copy * - track and record media errors, throw out bad devices * - add a mode to also read unallocated space -* - make the prefetch cancellable */ struct scrub_bio ;
@@ -741,13 +738,16 @@ static noinline_for_stack int scrub_stripe(struct scrub_dev *sdev,int slot;int i;u64 nstripes; -int start_stripe;struct extent_buffer *l;struct btrfs_key key;u64 physical;u64 logical;u64 generation;u64 mirror_num; +struct reada_control *reada1; +struct reada_control *reada2; +struct btrfs_key key_start; +struct btrfs_key key_end;u64 increment = map->stripe_len;u64 offset;
@@ -779,81 +779,67 @@ static noinline_for_stack int scrub_stripe(struct scrub_dev *sdev,if (!path)return -ENOMEM ; - path->reada =2 ; path->search_commit_root =1 ; path->skip_locking =1 ;/* -* find all extents for each stripe and just read them to get -* them into the page cache -* FIXME: we can do better. build a more intelligent prefetching +* trigger the readahead for extent tree csum tree and wait for +* completion. During readahead, the scrub is officially paused +* to not hold off transaction commits */ logical = base + offset; - physical = map->stripes[num].physical; - ret =0 ; -for (i =0 ; i < nstripes; ++i) { - key.objectid = logical; - key.type =BTRFS_EXTENT_ITEM_KEY ; - key.offset = (u64 )0 ; - - ret =btrfs_search_slot (NULL , root, &key, path,0 ,0 ); -if (ret <0 ) - goto out_noplug; - -/* -* we might miss half an extent here, but that doesn't matter, -* as it's only the prefetch -*/ -while (1 ) { - l = path->nodes[0 ]; - slot = path->slots[0 ]; -if (slot >=btrfs_header_nritems (l)) { - ret =btrfs_next_leaf (root, path); -if (ret ==0 ) -continue ; -if (ret <0 ) - goto out_noplug; -break ; - } -btrfs_item_key_to_cpu (l, &key, slot); +wait_event (sdev->list_wait, +atomic_read (&sdev->in_flight) ==0 ); +atomic_inc (&fs_info->scrubs_paused); +wake_up (&fs_info->scrub_pause_wait); -if (key.objectid >= logical + map->stripe_len) -break ; +/* FIXME it might be better to start readahead at commit root */ + key_start.objectid = logical; + key_start.type =BTRFS_EXTENT_ITEM_KEY ; + key_start.offset = (u64 )0 ; + key_end.objectid = base + offset + nstripes * increment; + key_end.type =BTRFS_EXTENT_ITEM_KEY ; + key_end.offset = (u64 )0 ; + reada1 =btrfs_reada_add (root, &key_start, &key_end); + + key_start.objectid =BTRFS_EXTENT_CSUM_OBJECTID ; + key_start.type =BTRFS_EXTENT_CSUM_KEY ; + key_start.offset = logical; + key_end.objectid =BTRFS_EXTENT_CSUM_OBJECTID ; + key_end.type =BTRFS_EXTENT_CSUM_KEY ; + key_end.offset = base + offset + nstripes * increment; + reada2 =btrfs_reada_add (csum_root, &key_start, &key_end); + +if (!IS_ERR (reada1)) +btrfs_reada_wait (reada1); +if (!IS_ERR (reada2)) +btrfs_reada_wait (reada2); - path->slots[0 ]++; - } -btrfs_release_path (path); - logical += increment; - physical += map->stripe_len; -cond_resched (); +mutex_lock (&fs_info->scrub_lock); +while (atomic_read (&fs_info->scrub_pause_req)) { +mutex_unlock (&fs_info->scrub_lock); +wait_event (fs_info->scrub_pause_wait, +atomic_read (&fs_info->scrub_pause_req) ==0 ); +mutex_lock (&fs_info->scrub_lock); } +atomic_dec (&fs_info->scrubs_paused); +mutex_unlock (&fs_info->scrub_lock); +wake_up (&fs_info->scrub_pause_wait);/* * collect all data csums for the stripe to avoid seeking during * the scrub. This might currently (crc32) end up to be about 1MB */ - start_stripe =0 ;blk_start_plug (&plug); -again: - logical = base + offset + start_stripe * increment; -for (i = start_stripe; i < nstripes; ++i) { - ret =btrfs_lookup_csums_range (csum_root, logical, - logical + map->stripe_len -1 , - &sdev->csum_list,1 ); -if (ret) - goto out; - logical += increment; -cond_resched (); - }/* * now find all extents for each stripe and scrub them */ - logical = base + offset + start_stripe * increment; - physical = map->stripes[num].physical + start_stripe * map->stripe_len; + logical = base + offset; + physical = map->stripes[num].physical; ret =0 ; -for (i = start_stripe; i < nstripes; ++i) { +for (i =0 ; i < nstripes; ++i) {/* * canceled? */
@@ -882,11 +868,14 @@ again:atomic_dec (&fs_info->scrubs_paused);mutex_unlock (&fs_info->scrub_lock);wake_up (&fs_info->scrub_pause_wait); -scrub_free_csums (sdev); - start_stripe = i; - goto again; } + ret =btrfs_lookup_csums_range (csum_root, logical, + logical + map->stripe_len -1 , + &sdev->csum_list,1 ); +if (ret) + goto out; + key.objectid = logical; key.type =BTRFS_EXTENT_ITEM_KEY ; key.offset = (u64 )0 ;
@@ -982,7 +971,6 @@ next: out:blk_finish_plug (&plug); -out_noplug:btrfs_free_path (path);return ret <0 ? ret :0 ; }
Signature · 1 line
1.7.3.4