search for: orig_bio

...diff --git a/fs/btrfs/inode.c b/fs/btrfs/inode.c index 3476760..8b82309 100644 --- a/fs/btrfs/inode.c +++ b/fs/btrfs/inode.c @@ -5960,13 +5960,6 @@ static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip, u32 *csums = dip->csums; int ret = 0; - bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS); - if (!bio) - return -ENOMEM; - bio->bi_private = dip; - bio->bi_end_io = btrfs_end_dio_bio; - atomic_inc(&dip->pending_bios); - map_length = orig_bio->bi_size; ret = btrfs_map_block(map_tree, READ, start_sector << 9, &m...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-188,7 +188,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -205,24 +206,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-189,7 +189,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -206,24 +207,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-189,7 +189,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -206,24 +207,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...-189,7 +189,8 @@ void bch_data_verify(struct search *s) struct cached_dev *dc = container_of(s->d, struct cached_dev, disk); struct closure *cl = &s->cl; struct bio *check; - struct bio_vec *bv; + struct bio_vec bv, *bv2; + struct bvec_iter iter; int i; check = bio_clone(s->orig_bio, GFP_NOIO); @@ -206,24 +207,24 @@ void bch_data_verify(struct search *s) closure_bio_submit(check, cl, &dc->disk); closure_sync(cl); - bio_for_each_segment(bv, s->orig_bio, i) { - void *p1 = kmap(bv->bv_page); - void *p2 = kmap(check->bi_io_vec[i].bv_page); + bio_for_each_se...

...bio_flagged(bio, BIO_USER_MAPPED)) ++ bio_unmap_user(bio); ++ else ++ ret = bio_uncopy_user(bio); ++ } ++ ++ return ret; ++} ++ ++static int __blk_rq_map_user(request_queue_t *q, struct request *rq, ++ void __user *ubuf, unsigned int len) ++{ ++ unsigned long uaddr; ++ struct bio *bio, *orig_bio; ++ int reading, ret; ++ ++ reading = rq_data_dir(rq) == READ; ++ ++ /* ++ * if alignment requirement is satisfied, map in user pages for ++ * direct dma. else, set up kernel bounce buffers ++ */ ++ uaddr = (unsigned long) ubuf; ++ if (!(uaddr & queue_dma_alignment(q)) && !(len &...

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

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

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

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