search for: end_bio_extent_readpag

...ev = (struct block_device *) (unsigned long)bbio->mirror_num; ... } static void btrfs_end_bio(struct bio *bio, int err) { ... bio->bi_bdev = (struct block_device *) (unsigned long)bbio->mirror_num; ... } In fs/btrfs/extent_io.c static void end_bio_extent_readpage(struct bio *bio, int err) { int mirror; ... mirror = (int)(unsigned long)bio->bi_bdev; ... } Ewweeeeeeeeeeeeeeeeeehh........ No wonder this thing crashes. Chris, can''t the original bio carry bbio in bi_private and let end_bio_extent_readpage() free the bbio instead of abusi...

...000004a19ab88 ffff8801b966f380 0000100000000000 > [ 605.115884] ffffffff81255810 0000000000000000 0000000000000002 0000000001400000 > [ 605.116180] Call Trace: > [ 605.116320] [<ffffffff81251384>] ? submit_extent_page+0x164/0x280 > [ 605.116488] [<ffffffff81255810>] ? end_bio_extent_readpage+0x0/0x210 > [ 605.116654] [<ffffffff81257241>] ? __extent_read_full_page+0x4e1/0x680 > [ 605.116820] [<ffffffff81255810>] ? end_bio_extent_readpage+0x0/0x210 > [ 605.116990] [<ffffffff8122c260>] ? btree_get_extent+0x0/0x1e0 > [ 605.117151] [<ffffffff8125766...

...m syslogd@btrfs at Aug 3 05:09:33 ... kernel: [<e0dc5ded>] ? btrfs_map_block+0x19/0x1b [btrfs] Message from syslogd@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...

The goal is to detect when drives start to get an increased error rate, when drives should be replaced soon. Therefore statistic counters are added that count IO errors (read, write and flush). Additionally, the software detected errors like checksum errors and corrupted blocks are counted. An ioctl interface is added to get the device statistic counters. A second ioctl is added to atomically get

Hi all - The following 9 patches add more error handling to the btrfs code: - Add btrfs_panic - Catch locking failures in {set,clear}_extent_bit - Push up set_extent_bit errors to callers - Push up lock_extent errors to callers - Push up clear_extent_bit errors to callers - Push up unlock_extent errors to callers - Make pin_down_extent return void - Push up btrfs_pin_extent errors to

Changes v1-v2: - Remove restriction that BTRFS_IOC_GET_DEVICE_STATS is a privileged operation - Cast u64 to unsigned long long for printf() Changes v2-v3: - Rebased on Chris'' current master Changes v3-v4: - Add padding at end of ioctl structure Changes v4-v5: - The statistic members in the ioctl are now organized as an array of 64 bit values. Symbolic names for the array indexes

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

...807c3e0 [ 297.418161] cb38bda8 ffffe3fb c04aaf4a 00000000 00000000 00000000 cf53c3f0 00000fff [ 297.418161] Call Trace: [ 297.418161] [<c04a7ed6>] ? submit_extent_page+0xea/0x190 [ 297.418161] [<c04a9af4>] ? __extent_read_full_page+0x61d/0x6a0 [ 297.418161] [<c04aaf4a>] ? end_bio_extent_readpage+0x0/0x205 [ 297.418161] [<c0491123>] ? btree_get_extent+0x0/0x16c [ 297.418161] [<c04a8467>] ? test_range_bit+0xd5/0xdf [ 297.418161] [<c04aa4c7>] ? read_extent_buffer_pages+0x274/0x3aa [ 297.418161] [<c07c6b0e>] ? _spin_unlock+0x2c/0x41 [ 297.418161] [<c04acda...

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

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