Displaying 6 results from an estimated 6 matches for "btree_submit_bio_hook".
Did you mean:
__btree_submit_bio_hook
2008 Aug 02
3
crash when mounting
...btrfs at Aug 3 05:09:33 ...
kernel: [<e0dc5e4c>] ? btrfs_map_bio+0x5d/0x1b7 [btrfs]
Message from syslogd@btrfs at Aug 3 05:09:33 ...
kernel: [<e0dc3ab3>] ? end_bio_extent_readpage+0x0/0x339 [btrfs]
Message from syslogd@btrfs at Aug 3 05:09:33 ...
kernel: [<e0dad33a>] ? __btree_submit_bio_hook+0x42/0x4b [btrfs]
Message from syslogd@btrfs at Aug 3 05:09:33 ...
kernel: [<e0dae650>] ? btree_submit_bio_hook+0x15/0x3b [btrfs]
Message from syslogd@btrfs at Aug 3 05:09:33 ...
kernel: [<e0dae63b>] ? btree_submit_bio_hook+0x0/0x3b [btrfs]
Message from syslogd@btrfs at Aug 3...
2011 Jun 10
6
[PATCH v2 0/6] 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
2010 Sep 03
0
[PATCH 1/2] btrfs: document where we use BUG_ON instead of error handling
..., len, page, GFP_NOFS);
ret = btree_read_extent_buffer_pages(root, eb, start + PAGE_CACHE_SIZE,
btrfs_header_generation(eb));
- BUG_ON(ret);
+ btrfs_fixable_bug_on(ret);
found_start = btrfs_header_bytenr(eb);
if (found_start != start) {
WARN_ON(1);
@@ -666,7 +666,7 @@ static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info,
bio, 1);
- BUG_ON(ret);
+ btrfs_fixable_bug_on(ret);
if (!(rw & REQ_WRITE)) {
/*
@@ -974,7 +974,7 @@ static int find_and_setup_root(struct btrfs_root *tree_root,...
2013 Aug 22
23
Question: How can I recover this partition? (unable to find logical $hugenum len 4096)
...xtent_page.isra.38+0xeb/0x1d0 [btrfs]
[ 45.917188] [<f9d06f60>] ? test_range_bit+0x80/0x180 [btrfs]
[ 45.917188] [<f9d08c67>] ? __extent_read_full_page+0x4f7/0x7f0 [btrfs]
[ 45.917188] [<f9ce1e79>] ? btrfs_bio_wq_end_io+0x29/0x70 [btrfs]
[ 45.917188] [<f9ce20aa>] btree_submit_bio_hook+0x5a/0x100 [btrfs]
[ 45.917188] [<f9ce2050>] ? btrfs_wq_submit_bio+0x170/0x170 [btrfs]
[ 45.917188] [<f9d03c90>] submit_one_bio+0x80/0xb0 [btrfs]
[ 45.917188] [<f9ce2050>] ? btrfs_wq_submit_bio+0x170/0x170 [btrfs]
[ 45.917188] [<f9d0b848>] read_extent_buffer_page...
2011 Oct 04
68
[patch 00/65] Error handling patchset v3
Hi all -
Here''s my current error handling patchset, against 3.1-rc8. Almost all of
this patchset is preparing for actual error handling. Before we start in
on that work, I''m trying to reduce the surface we need to worry about. It
turns out that there is a ton of code that returns an error code but never
actually reports an error.
The patchset has grown to 65 patches. 46 of them
2011 Jun 29
14
[PATCH v4 0/6] 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