2 * raid5.c : Multiple Devices driver for Linux
3 * Copyright (C) 1996, 1997 Ingo Molnar, Miguel de Icaza, Gadi Oxman
4 * Copyright (C) 1999, 2000 Ingo Molnar
5 * Copyright (C) 2002, 2003 H. Peter Anvin
7 * RAID-4/5/6 management functions.
8 * Thanks to Penguin Computing for making the RAID-6 development possible
9 * by donating a test server!
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; either version 2, or (at your option)
16 * You should have received a copy of the GNU General Public License
17 * (for example /usr/src/linux/COPYING); if not, write to the Free
18 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 * The sequencing for updating the bitmap reliably is a little
25 * subtle (and I got it wrong the first time) so it deserves some
28 * We group bitmap updates into batches. Each batch has a number.
29 * We may write out several batches at once, but that isn't very important.
30 * conf->bm_write is the number of the last batch successfully written.
31 * conf->bm_flush is the number of the last batch that was closed to
33 * When we discover that we will need to write to any block in a stripe
34 * (in add_stripe_bio) we update the in-memory bitmap and record in sh->bm_seq
35 * the number of the batch it will be in. This is bm_flush+1.
36 * When we are ready to do a write, if that batch hasn't been written yet,
37 * we plug the array and queue the stripe for later.
38 * When an unplug happens, we increment bm_flush, thus closing the current
40 * When we notice that bm_flush > bm_write, we write out all pending updates
41 * to the bitmap, and advance bm_write to where bm_flush was.
42 * This may occasionally write a bit out twice, but is sure never to
46 #include <linux/blkdev.h>
47 #include <linux/kthread.h>
48 #include <linux/raid/pq.h>
49 #include <linux/async_tx.h>
50 #include <linux/seq_file.h>
59 #define NR_STRIPES 256
60 #define STRIPE_SIZE PAGE_SIZE
61 #define STRIPE_SHIFT (PAGE_SHIFT - 9)
62 #define STRIPE_SECTORS (STRIPE_SIZE>>9)
63 #define IO_THRESHOLD 1
64 #define BYPASS_THRESHOLD 1
65 #define NR_HASH (PAGE_SIZE / sizeof(struct hlist_head))
66 #define HASH_MASK (NR_HASH - 1)
68 #define stripe_hash(conf, sect) (&((conf)->stripe_hashtbl[((sect) >> STRIPE_SHIFT) & HASH_MASK]))
70 /* bio's attached to a stripe+device for I/O are linked together in bi_sector
71 * order without overlap. There may be several bio's per stripe+device, and
72 * a bio could span several devices.
73 * When walking this list for a particular stripe+device, we must never proceed
74 * beyond a bio that extends past this device, as the next bio might no longer
76 * This macro is used to determine the 'next' bio in the list, given the sector
77 * of the current stripe+device
79 #define r5_next_bio(bio, sect) ( ( (bio)->bi_sector + ((bio)->bi_size>>9) < sect + STRIPE_SECTORS) ? (bio)->bi_next : NULL)
81 * The following can be used to debug the driver
83 #define RAID5_PARANOIA 1
84 #if RAID5_PARANOIA && defined(CONFIG_SMP)
85 # define CHECK_DEVLOCK() assert_spin_locked(&conf->device_lock)
87 # define CHECK_DEVLOCK()
95 #define printk_rl(args...) ((void) (printk_ratelimit() && printk(args)))
98 * We maintain a biased count of active stripes in the bottom 16 bits of
99 * bi_phys_segments, and a count of processed stripes in the upper 16 bits
101 static inline int raid5_bi_phys_segments(struct bio *bio)
103 return bio->bi_phys_segments & 0xffff;
106 static inline int raid5_bi_hw_segments(struct bio *bio)
108 return (bio->bi_phys_segments >> 16) & 0xffff;
111 static inline int raid5_dec_bi_phys_segments(struct bio *bio)
113 --bio->bi_phys_segments;
114 return raid5_bi_phys_segments(bio);
117 static inline int raid5_dec_bi_hw_segments(struct bio *bio)
119 unsigned short val = raid5_bi_hw_segments(bio);
122 bio->bi_phys_segments = (val << 16) | raid5_bi_phys_segments(bio);
126 static inline void raid5_set_bi_hw_segments(struct bio *bio, unsigned int cnt)
128 bio->bi_phys_segments = raid5_bi_phys_segments(bio) || (cnt << 16);
131 /* Find first data disk in a raid6 stripe */
132 static inline int raid6_d0(struct stripe_head *sh)
135 /* ddf always start from first device */
137 /* md starts just after Q block */
138 if (sh->qd_idx == sh->disks - 1)
141 return sh->qd_idx + 1;
143 static inline int raid6_next_disk(int disk, int raid_disks)
146 return (disk < raid_disks) ? disk : 0;
149 /* When walking through the disks in a raid5, starting at raid6_d0,
150 * We need to map each disk to a 'slot', where the data disks are slot
151 * 0 .. raid_disks-3, the parity disk is raid_disks-2 and the Q disk
152 * is raid_disks-1. This help does that mapping.
154 static int raid6_idx_to_slot(int idx, struct stripe_head *sh,
155 int *count, int syndrome_disks)
159 if (idx == sh->pd_idx)
160 return syndrome_disks;
161 if (idx == sh->qd_idx)
162 return syndrome_disks + 1;
167 static void return_io(struct bio *return_bi)
169 struct bio *bi = return_bi;
172 return_bi = bi->bi_next;
180 static void print_raid5_conf (raid5_conf_t *conf);
182 static int stripe_operations_active(struct stripe_head *sh)
184 return sh->check_state || sh->reconstruct_state ||
185 test_bit(STRIPE_BIOFILL_RUN, &sh->state) ||
186 test_bit(STRIPE_COMPUTE_RUN, &sh->state);
189 static void __release_stripe(raid5_conf_t *conf, struct stripe_head *sh)
191 if (atomic_dec_and_test(&sh->count)) {
192 BUG_ON(!list_empty(&sh->lru));
193 BUG_ON(atomic_read(&conf->active_stripes)==0);
194 if (test_bit(STRIPE_HANDLE, &sh->state)) {
195 if (test_bit(STRIPE_DELAYED, &sh->state)) {
196 list_add_tail(&sh->lru, &conf->delayed_list);
197 blk_plug_device(conf->mddev->queue);
198 } else if (test_bit(STRIPE_BIT_DELAY, &sh->state) &&
199 sh->bm_seq - conf->seq_write > 0) {
200 list_add_tail(&sh->lru, &conf->bitmap_list);
201 blk_plug_device(conf->mddev->queue);
203 clear_bit(STRIPE_BIT_DELAY, &sh->state);
204 list_add_tail(&sh->lru, &conf->handle_list);
206 md_wakeup_thread(conf->mddev->thread);
208 BUG_ON(stripe_operations_active(sh));
209 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
210 atomic_dec(&conf->preread_active_stripes);
211 if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD)
212 md_wakeup_thread(conf->mddev->thread);
214 atomic_dec(&conf->active_stripes);
215 if (!test_bit(STRIPE_EXPANDING, &sh->state)) {
216 list_add_tail(&sh->lru, &conf->inactive_list);
217 wake_up(&conf->wait_for_stripe);
218 if (conf->retry_read_aligned)
219 md_wakeup_thread(conf->mddev->thread);
225 static void release_stripe(struct stripe_head *sh)
227 raid5_conf_t *conf = sh->raid_conf;
230 spin_lock_irqsave(&conf->device_lock, flags);
231 __release_stripe(conf, sh);
232 spin_unlock_irqrestore(&conf->device_lock, flags);
235 static inline void remove_hash(struct stripe_head *sh)
237 pr_debug("remove_hash(), stripe %llu\n",
238 (unsigned long long)sh->sector);
240 hlist_del_init(&sh->hash);
243 static inline void insert_hash(raid5_conf_t *conf, struct stripe_head *sh)
245 struct hlist_head *hp = stripe_hash(conf, sh->sector);
247 pr_debug("insert_hash(), stripe %llu\n",
248 (unsigned long long)sh->sector);
251 hlist_add_head(&sh->hash, hp);
255 /* find an idle stripe, make sure it is unhashed, and return it. */
256 static struct stripe_head *get_free_stripe(raid5_conf_t *conf)
258 struct stripe_head *sh = NULL;
259 struct list_head *first;
262 if (list_empty(&conf->inactive_list))
264 first = conf->inactive_list.next;
265 sh = list_entry(first, struct stripe_head, lru);
266 list_del_init(first);
268 atomic_inc(&conf->active_stripes);
273 static void shrink_buffers(struct stripe_head *sh, int num)
278 for (i=0; i<num ; i++) {
282 sh->dev[i].page = NULL;
287 static int grow_buffers(struct stripe_head *sh, int num)
291 for (i=0; i<num; i++) {
294 if (!(page = alloc_page(GFP_KERNEL))) {
297 sh->dev[i].page = page;
302 static void raid5_build_block(struct stripe_head *sh, int i, int previous);
303 static void stripe_set_idx(sector_t stripe, raid5_conf_t *conf, int previous,
304 struct stripe_head *sh);
306 static void init_stripe(struct stripe_head *sh, sector_t sector, int previous)
308 raid5_conf_t *conf = sh->raid_conf;
311 BUG_ON(atomic_read(&sh->count) != 0);
312 BUG_ON(test_bit(STRIPE_HANDLE, &sh->state));
313 BUG_ON(stripe_operations_active(sh));
316 pr_debug("init_stripe called, stripe %llu\n",
317 (unsigned long long)sh->sector);
321 sh->generation = conf->generation - previous;
322 sh->disks = previous ? conf->previous_raid_disks : conf->raid_disks;
324 stripe_set_idx(sector, conf, previous, sh);
328 for (i = sh->disks; i--; ) {
329 struct r5dev *dev = &sh->dev[i];
331 if (dev->toread || dev->read || dev->towrite || dev->written ||
332 test_bit(R5_LOCKED, &dev->flags)) {
333 printk(KERN_ERR "sector=%llx i=%d %p %p %p %p %d\n",
334 (unsigned long long)sh->sector, i, dev->toread,
335 dev->read, dev->towrite, dev->written,
336 test_bit(R5_LOCKED, &dev->flags));
340 raid5_build_block(sh, i, previous);
342 insert_hash(conf, sh);
345 static struct stripe_head *__find_stripe(raid5_conf_t *conf, sector_t sector,
348 struct stripe_head *sh;
349 struct hlist_node *hn;
352 pr_debug("__find_stripe, sector %llu\n", (unsigned long long)sector);
353 hlist_for_each_entry(sh, hn, stripe_hash(conf, sector), hash)
354 if (sh->sector == sector && sh->generation == generation)
356 pr_debug("__stripe %llu not in cache\n", (unsigned long long)sector);
360 static void unplug_slaves(mddev_t *mddev);
361 static void raid5_unplug_device(struct request_queue *q);
363 static struct stripe_head *
364 get_active_stripe(raid5_conf_t *conf, sector_t sector,
365 int previous, int noblock)
367 struct stripe_head *sh;
369 pr_debug("get_stripe, sector %llu\n", (unsigned long long)sector);
371 spin_lock_irq(&conf->device_lock);
374 wait_event_lock_irq(conf->wait_for_stripe,
376 conf->device_lock, /* nothing */);
377 sh = __find_stripe(conf, sector, conf->generation - previous);
379 if (!conf->inactive_blocked)
380 sh = get_free_stripe(conf);
381 if (noblock && sh == NULL)
384 conf->inactive_blocked = 1;
385 wait_event_lock_irq(conf->wait_for_stripe,
386 !list_empty(&conf->inactive_list) &&
387 (atomic_read(&conf->active_stripes)
388 < (conf->max_nr_stripes *3/4)
389 || !conf->inactive_blocked),
391 raid5_unplug_device(conf->mddev->queue)
393 conf->inactive_blocked = 0;
395 init_stripe(sh, sector, previous);
397 if (atomic_read(&sh->count)) {
398 BUG_ON(!list_empty(&sh->lru)
399 && !test_bit(STRIPE_EXPANDING, &sh->state));
401 if (!test_bit(STRIPE_HANDLE, &sh->state))
402 atomic_inc(&conf->active_stripes);
403 if (list_empty(&sh->lru) &&
404 !test_bit(STRIPE_EXPANDING, &sh->state))
406 list_del_init(&sh->lru);
409 } while (sh == NULL);
412 atomic_inc(&sh->count);
414 spin_unlock_irq(&conf->device_lock);
419 raid5_end_read_request(struct bio *bi, int error);
421 raid5_end_write_request(struct bio *bi, int error);
423 static void ops_run_io(struct stripe_head *sh, struct stripe_head_state *s)
425 raid5_conf_t *conf = sh->raid_conf;
426 int i, disks = sh->disks;
430 for (i = disks; i--; ) {
434 if (test_and_clear_bit(R5_Wantwrite, &sh->dev[i].flags))
436 else if (test_and_clear_bit(R5_Wantread, &sh->dev[i].flags))
441 bi = &sh->dev[i].req;
445 bi->bi_end_io = raid5_end_write_request;
447 bi->bi_end_io = raid5_end_read_request;
450 rdev = rcu_dereference(conf->disks[i].rdev);
451 if (rdev && test_bit(Faulty, &rdev->flags))
454 atomic_inc(&rdev->nr_pending);
458 if (s->syncing || s->expanding || s->expanded)
459 md_sync_acct(rdev->bdev, STRIPE_SECTORS);
461 set_bit(STRIPE_IO_STARTED, &sh->state);
463 bi->bi_bdev = rdev->bdev;
464 pr_debug("%s: for %llu schedule op %ld on disc %d\n",
465 __func__, (unsigned long long)sh->sector,
467 atomic_inc(&sh->count);
468 bi->bi_sector = sh->sector + rdev->data_offset;
469 bi->bi_flags = 1 << BIO_UPTODATE;
473 bi->bi_io_vec = &sh->dev[i].vec;
474 bi->bi_io_vec[0].bv_len = STRIPE_SIZE;
475 bi->bi_io_vec[0].bv_offset = 0;
476 bi->bi_size = STRIPE_SIZE;
479 test_bit(R5_ReWrite, &sh->dev[i].flags))
480 atomic_add(STRIPE_SECTORS,
481 &rdev->corrected_errors);
482 generic_make_request(bi);
485 set_bit(STRIPE_DEGRADED, &sh->state);
486 pr_debug("skip op %ld on disc %d for sector %llu\n",
487 bi->bi_rw, i, (unsigned long long)sh->sector);
488 clear_bit(R5_LOCKED, &sh->dev[i].flags);
489 set_bit(STRIPE_HANDLE, &sh->state);
494 static struct dma_async_tx_descriptor *
495 async_copy_data(int frombio, struct bio *bio, struct page *page,
496 sector_t sector, struct dma_async_tx_descriptor *tx)
499 struct page *bio_page;
503 if (bio->bi_sector >= sector)
504 page_offset = (signed)(bio->bi_sector - sector) * 512;
506 page_offset = (signed)(sector - bio->bi_sector) * -512;
507 bio_for_each_segment(bvl, bio, i) {
508 int len = bio_iovec_idx(bio, i)->bv_len;
512 if (page_offset < 0) {
513 b_offset = -page_offset;
514 page_offset += b_offset;
518 if (len > 0 && page_offset + len > STRIPE_SIZE)
519 clen = STRIPE_SIZE - page_offset;
524 b_offset += bio_iovec_idx(bio, i)->bv_offset;
525 bio_page = bio_iovec_idx(bio, i)->bv_page;
527 tx = async_memcpy(page, bio_page, page_offset,
532 tx = async_memcpy(bio_page, page, b_offset,
537 if (clen < len) /* hit end of page */
545 static void ops_complete_biofill(void *stripe_head_ref)
547 struct stripe_head *sh = stripe_head_ref;
548 struct bio *return_bi = NULL;
549 raid5_conf_t *conf = sh->raid_conf;
552 pr_debug("%s: stripe %llu\n", __func__,
553 (unsigned long long)sh->sector);
555 /* clear completed biofills */
556 spin_lock_irq(&conf->device_lock);
557 for (i = sh->disks; i--; ) {
558 struct r5dev *dev = &sh->dev[i];
560 /* acknowledge completion of a biofill operation */
561 /* and check if we need to reply to a read request,
562 * new R5_Wantfill requests are held off until
563 * !STRIPE_BIOFILL_RUN
565 if (test_and_clear_bit(R5_Wantfill, &dev->flags)) {
566 struct bio *rbi, *rbi2;
571 while (rbi && rbi->bi_sector <
572 dev->sector + STRIPE_SECTORS) {
573 rbi2 = r5_next_bio(rbi, dev->sector);
574 if (!raid5_dec_bi_phys_segments(rbi)) {
575 rbi->bi_next = return_bi;
582 spin_unlock_irq(&conf->device_lock);
583 clear_bit(STRIPE_BIOFILL_RUN, &sh->state);
585 return_io(return_bi);
587 set_bit(STRIPE_HANDLE, &sh->state);
591 static void ops_run_biofill(struct stripe_head *sh)
593 struct dma_async_tx_descriptor *tx = NULL;
594 raid5_conf_t *conf = sh->raid_conf;
597 pr_debug("%s: stripe %llu\n", __func__,
598 (unsigned long long)sh->sector);
600 for (i = sh->disks; i--; ) {
601 struct r5dev *dev = &sh->dev[i];
602 if (test_bit(R5_Wantfill, &dev->flags)) {
604 spin_lock_irq(&conf->device_lock);
605 dev->read = rbi = dev->toread;
607 spin_unlock_irq(&conf->device_lock);
608 while (rbi && rbi->bi_sector <
609 dev->sector + STRIPE_SECTORS) {
610 tx = async_copy_data(0, rbi, dev->page,
612 rbi = r5_next_bio(rbi, dev->sector);
617 atomic_inc(&sh->count);
618 async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
619 ops_complete_biofill, sh);
622 static void ops_complete_compute5(void *stripe_head_ref)
624 struct stripe_head *sh = stripe_head_ref;
625 int target = sh->ops.target;
626 struct r5dev *tgt = &sh->dev[target];
628 pr_debug("%s: stripe %llu\n", __func__,
629 (unsigned long long)sh->sector);
631 set_bit(R5_UPTODATE, &tgt->flags);
632 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
633 clear_bit(R5_Wantcompute, &tgt->flags);
634 clear_bit(STRIPE_COMPUTE_RUN, &sh->state);
635 if (sh->check_state == check_state_compute_run)
636 sh->check_state = check_state_compute_result;
637 set_bit(STRIPE_HANDLE, &sh->state);
641 static struct dma_async_tx_descriptor *ops_run_compute5(struct stripe_head *sh)
643 /* kernel stack size limits the total number of disks */
644 int disks = sh->disks;
645 struct page *xor_srcs[disks];
646 int target = sh->ops.target;
647 struct r5dev *tgt = &sh->dev[target];
648 struct page *xor_dest = tgt->page;
650 struct dma_async_tx_descriptor *tx;
653 pr_debug("%s: stripe %llu block: %d\n",
654 __func__, (unsigned long long)sh->sector, target);
655 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
657 for (i = disks; i--; )
659 xor_srcs[count++] = sh->dev[i].page;
661 atomic_inc(&sh->count);
663 if (unlikely(count == 1))
664 tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
665 0, NULL, ops_complete_compute5, sh);
667 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
668 ASYNC_TX_XOR_ZERO_DST, NULL,
669 ops_complete_compute5, sh);
674 static void ops_complete_prexor(void *stripe_head_ref)
676 struct stripe_head *sh = stripe_head_ref;
678 pr_debug("%s: stripe %llu\n", __func__,
679 (unsigned long long)sh->sector);
682 static struct dma_async_tx_descriptor *
683 ops_run_prexor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
685 /* kernel stack size limits the total number of disks */
686 int disks = sh->disks;
687 struct page *xor_srcs[disks];
688 int count = 0, pd_idx = sh->pd_idx, i;
690 /* existing parity data subtracted */
691 struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
693 pr_debug("%s: stripe %llu\n", __func__,
694 (unsigned long long)sh->sector);
696 for (i = disks; i--; ) {
697 struct r5dev *dev = &sh->dev[i];
698 /* Only process blocks that are known to be uptodate */
699 if (test_bit(R5_Wantdrain, &dev->flags))
700 xor_srcs[count++] = dev->page;
703 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
704 ASYNC_TX_DEP_ACK | ASYNC_TX_XOR_DROP_DST, tx,
705 ops_complete_prexor, sh);
710 static struct dma_async_tx_descriptor *
711 ops_run_biodrain(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
713 int disks = sh->disks;
716 pr_debug("%s: stripe %llu\n", __func__,
717 (unsigned long long)sh->sector);
719 for (i = disks; i--; ) {
720 struct r5dev *dev = &sh->dev[i];
723 if (test_and_clear_bit(R5_Wantdrain, &dev->flags)) {
726 spin_lock(&sh->lock);
727 chosen = dev->towrite;
729 BUG_ON(dev->written);
730 wbi = dev->written = chosen;
731 spin_unlock(&sh->lock);
733 while (wbi && wbi->bi_sector <
734 dev->sector + STRIPE_SECTORS) {
735 tx = async_copy_data(1, wbi, dev->page,
737 wbi = r5_next_bio(wbi, dev->sector);
745 static void ops_complete_postxor(void *stripe_head_ref)
747 struct stripe_head *sh = stripe_head_ref;
748 int disks = sh->disks, i, pd_idx = sh->pd_idx;
750 pr_debug("%s: stripe %llu\n", __func__,
751 (unsigned long long)sh->sector);
753 for (i = disks; i--; ) {
754 struct r5dev *dev = &sh->dev[i];
755 if (dev->written || i == pd_idx)
756 set_bit(R5_UPTODATE, &dev->flags);
759 if (sh->reconstruct_state == reconstruct_state_drain_run)
760 sh->reconstruct_state = reconstruct_state_drain_result;
761 else if (sh->reconstruct_state == reconstruct_state_prexor_drain_run)
762 sh->reconstruct_state = reconstruct_state_prexor_drain_result;
764 BUG_ON(sh->reconstruct_state != reconstruct_state_run);
765 sh->reconstruct_state = reconstruct_state_result;
768 set_bit(STRIPE_HANDLE, &sh->state);
773 ops_run_postxor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
775 /* kernel stack size limits the total number of disks */
776 int disks = sh->disks;
777 struct page *xor_srcs[disks];
779 int count = 0, pd_idx = sh->pd_idx, i;
780 struct page *xor_dest;
784 pr_debug("%s: stripe %llu\n", __func__,
785 (unsigned long long)sh->sector);
787 /* check if prexor is active which means only process blocks
788 * that are part of a read-modify-write (written)
790 if (sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
792 xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
793 for (i = disks; i--; ) {
794 struct r5dev *dev = &sh->dev[i];
796 xor_srcs[count++] = dev->page;
799 xor_dest = sh->dev[pd_idx].page;
800 for (i = disks; i--; ) {
801 struct r5dev *dev = &sh->dev[i];
803 xor_srcs[count++] = dev->page;
807 /* 1/ if we prexor'd then the dest is reused as a source
808 * 2/ if we did not prexor then we are redoing the parity
809 * set ASYNC_TX_XOR_DROP_DST and ASYNC_TX_XOR_ZERO_DST
810 * for the synchronous xor case
812 flags = ASYNC_TX_DEP_ACK | ASYNC_TX_ACK |
813 (prexor ? ASYNC_TX_XOR_DROP_DST : ASYNC_TX_XOR_ZERO_DST);
815 atomic_inc(&sh->count);
817 if (unlikely(count == 1)) {
818 flags &= ~(ASYNC_TX_XOR_DROP_DST | ASYNC_TX_XOR_ZERO_DST);
819 tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
820 flags, tx, ops_complete_postxor, sh);
822 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
823 flags, tx, ops_complete_postxor, sh);
826 static void ops_complete_check(void *stripe_head_ref)
828 struct stripe_head *sh = stripe_head_ref;
830 pr_debug("%s: stripe %llu\n", __func__,
831 (unsigned long long)sh->sector);
833 sh->check_state = check_state_check_result;
834 set_bit(STRIPE_HANDLE, &sh->state);
838 static void ops_run_check(struct stripe_head *sh)
840 /* kernel stack size limits the total number of disks */
841 int disks = sh->disks;
842 struct page *xor_srcs[disks];
843 struct dma_async_tx_descriptor *tx;
845 int count = 0, pd_idx = sh->pd_idx, i;
846 struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
848 pr_debug("%s: stripe %llu\n", __func__,
849 (unsigned long long)sh->sector);
851 for (i = disks; i--; ) {
852 struct r5dev *dev = &sh->dev[i];
854 xor_srcs[count++] = dev->page;
857 tx = async_xor_zero_sum(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
858 &sh->ops.zero_sum_result, 0, NULL, NULL, NULL);
860 atomic_inc(&sh->count);
861 tx = async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
862 ops_complete_check, sh);
865 static void raid5_run_ops(struct stripe_head *sh, unsigned long ops_request)
867 int overlap_clear = 0, i, disks = sh->disks;
868 struct dma_async_tx_descriptor *tx = NULL;
870 if (test_bit(STRIPE_OP_BIOFILL, &ops_request)) {
875 if (test_bit(STRIPE_OP_COMPUTE_BLK, &ops_request)) {
876 tx = ops_run_compute5(sh);
877 /* terminate the chain if postxor is not set to be run */
878 if (tx && !test_bit(STRIPE_OP_POSTXOR, &ops_request))
882 if (test_bit(STRIPE_OP_PREXOR, &ops_request))
883 tx = ops_run_prexor(sh, tx);
885 if (test_bit(STRIPE_OP_BIODRAIN, &ops_request)) {
886 tx = ops_run_biodrain(sh, tx);
890 if (test_bit(STRIPE_OP_POSTXOR, &ops_request))
891 ops_run_postxor(sh, tx);
893 if (test_bit(STRIPE_OP_CHECK, &ops_request))
897 for (i = disks; i--; ) {
898 struct r5dev *dev = &sh->dev[i];
899 if (test_and_clear_bit(R5_Overlap, &dev->flags))
900 wake_up(&sh->raid_conf->wait_for_overlap);
904 static int grow_one_stripe(raid5_conf_t *conf)
906 struct stripe_head *sh;
907 sh = kmem_cache_alloc(conf->slab_cache, GFP_KERNEL);
910 memset(sh, 0, sizeof(*sh) + (conf->raid_disks-1)*sizeof(struct r5dev));
911 sh->raid_conf = conf;
912 spin_lock_init(&sh->lock);
914 if (grow_buffers(sh, conf->raid_disks)) {
915 shrink_buffers(sh, conf->raid_disks);
916 kmem_cache_free(conf->slab_cache, sh);
919 sh->disks = conf->raid_disks;
920 /* we just created an active stripe so... */
921 atomic_set(&sh->count, 1);
922 atomic_inc(&conf->active_stripes);
923 INIT_LIST_HEAD(&sh->lru);
928 static int grow_stripes(raid5_conf_t *conf, int num)
930 struct kmem_cache *sc;
931 int devs = conf->raid_disks;
933 sprintf(conf->cache_name[0],
934 "raid%d-%s", conf->level, mdname(conf->mddev));
935 sprintf(conf->cache_name[1],
936 "raid%d-%s-alt", conf->level, mdname(conf->mddev));
937 conf->active_name = 0;
938 sc = kmem_cache_create(conf->cache_name[conf->active_name],
939 sizeof(struct stripe_head)+(devs-1)*sizeof(struct r5dev),
943 conf->slab_cache = sc;
944 conf->pool_size = devs;
946 if (!grow_one_stripe(conf))
951 static int resize_stripes(raid5_conf_t *conf, int newsize)
953 /* Make all the stripes able to hold 'newsize' devices.
954 * New slots in each stripe get 'page' set to a new page.
956 * This happens in stages:
957 * 1/ create a new kmem_cache and allocate the required number of
959 * 2/ gather all the old stripe_heads and tranfer the pages across
960 * to the new stripe_heads. This will have the side effect of
961 * freezing the array as once all stripe_heads have been collected,
962 * no IO will be possible. Old stripe heads are freed once their
963 * pages have been transferred over, and the old kmem_cache is
964 * freed when all stripes are done.
965 * 3/ reallocate conf->disks to be suitable bigger. If this fails,
966 * we simple return a failre status - no need to clean anything up.
967 * 4/ allocate new pages for the new slots in the new stripe_heads.
968 * If this fails, we don't bother trying the shrink the
969 * stripe_heads down again, we just leave them as they are.
970 * As each stripe_head is processed the new one is released into
973 * Once step2 is started, we cannot afford to wait for a write,
974 * so we use GFP_NOIO allocations.
976 struct stripe_head *osh, *nsh;
977 LIST_HEAD(newstripes);
978 struct disk_info *ndisks;
980 struct kmem_cache *sc;
983 if (newsize <= conf->pool_size)
984 return 0; /* never bother to shrink */
986 err = md_allow_write(conf->mddev);
991 sc = kmem_cache_create(conf->cache_name[1-conf->active_name],
992 sizeof(struct stripe_head)+(newsize-1)*sizeof(struct r5dev),
997 for (i = conf->max_nr_stripes; i; i--) {
998 nsh = kmem_cache_alloc(sc, GFP_KERNEL);
1002 memset(nsh, 0, sizeof(*nsh) + (newsize-1)*sizeof(struct r5dev));
1004 nsh->raid_conf = conf;
1005 spin_lock_init(&nsh->lock);
1007 list_add(&nsh->lru, &newstripes);
1010 /* didn't get enough, give up */
1011 while (!list_empty(&newstripes)) {
1012 nsh = list_entry(newstripes.next, struct stripe_head, lru);
1013 list_del(&nsh->lru);
1014 kmem_cache_free(sc, nsh);
1016 kmem_cache_destroy(sc);
1019 /* Step 2 - Must use GFP_NOIO now.
1020 * OK, we have enough stripes, start collecting inactive
1021 * stripes and copying them over
1023 list_for_each_entry(nsh, &newstripes, lru) {
1024 spin_lock_irq(&conf->device_lock);
1025 wait_event_lock_irq(conf->wait_for_stripe,
1026 !list_empty(&conf->inactive_list),
1028 unplug_slaves(conf->mddev)
1030 osh = get_free_stripe(conf);
1031 spin_unlock_irq(&conf->device_lock);
1032 atomic_set(&nsh->count, 1);
1033 for(i=0; i<conf->pool_size; i++)
1034 nsh->dev[i].page = osh->dev[i].page;
1035 for( ; i<newsize; i++)
1036 nsh->dev[i].page = NULL;
1037 kmem_cache_free(conf->slab_cache, osh);
1039 kmem_cache_destroy(conf->slab_cache);
1042 * At this point, we are holding all the stripes so the array
1043 * is completely stalled, so now is a good time to resize
1046 ndisks = kzalloc(newsize * sizeof(struct disk_info), GFP_NOIO);
1048 for (i=0; i<conf->raid_disks; i++)
1049 ndisks[i] = conf->disks[i];
1051 conf->disks = ndisks;
1055 /* Step 4, return new stripes to service */
1056 while(!list_empty(&newstripes)) {
1057 nsh = list_entry(newstripes.next, struct stripe_head, lru);
1058 list_del_init(&nsh->lru);
1059 for (i=conf->raid_disks; i < newsize; i++)
1060 if (nsh->dev[i].page == NULL) {
1061 struct page *p = alloc_page(GFP_NOIO);
1062 nsh->dev[i].page = p;
1066 release_stripe(nsh);
1068 /* critical section pass, GFP_NOIO no longer needed */
1070 conf->slab_cache = sc;
1071 conf->active_name = 1-conf->active_name;
1072 conf->pool_size = newsize;
1076 static int drop_one_stripe(raid5_conf_t *conf)
1078 struct stripe_head *sh;
1080 spin_lock_irq(&conf->device_lock);
1081 sh = get_free_stripe(conf);
1082 spin_unlock_irq(&conf->device_lock);
1085 BUG_ON(atomic_read(&sh->count));
1086 shrink_buffers(sh, conf->pool_size);
1087 kmem_cache_free(conf->slab_cache, sh);
1088 atomic_dec(&conf->active_stripes);
1092 static void shrink_stripes(raid5_conf_t *conf)
1094 while (drop_one_stripe(conf))
1097 if (conf->slab_cache)
1098 kmem_cache_destroy(conf->slab_cache);
1099 conf->slab_cache = NULL;
1102 static void raid5_end_read_request(struct bio * bi, int error)
1104 struct stripe_head *sh = bi->bi_private;
1105 raid5_conf_t *conf = sh->raid_conf;
1106 int disks = sh->disks, i;
1107 int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
1108 char b[BDEVNAME_SIZE];
1112 for (i=0 ; i<disks; i++)
1113 if (bi == &sh->dev[i].req)
1116 pr_debug("end_read_request %llu/%d, count: %d, uptodate %d.\n",
1117 (unsigned long long)sh->sector, i, atomic_read(&sh->count),
1125 set_bit(R5_UPTODATE, &sh->dev[i].flags);
1126 if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
1127 rdev = conf->disks[i].rdev;
1128 printk_rl(KERN_INFO "raid5:%s: read error corrected"
1129 " (%lu sectors at %llu on %s)\n",
1130 mdname(conf->mddev), STRIPE_SECTORS,
1131 (unsigned long long)(sh->sector
1132 + rdev->data_offset),
1133 bdevname(rdev->bdev, b));
1134 clear_bit(R5_ReadError, &sh->dev[i].flags);
1135 clear_bit(R5_ReWrite, &sh->dev[i].flags);
1137 if (atomic_read(&conf->disks[i].rdev->read_errors))
1138 atomic_set(&conf->disks[i].rdev->read_errors, 0);
1140 const char *bdn = bdevname(conf->disks[i].rdev->bdev, b);
1142 rdev = conf->disks[i].rdev;
1144 clear_bit(R5_UPTODATE, &sh->dev[i].flags);
1145 atomic_inc(&rdev->read_errors);
1146 if (conf->mddev->degraded)
1147 printk_rl(KERN_WARNING
1148 "raid5:%s: read error not correctable "
1149 "(sector %llu on %s).\n",
1150 mdname(conf->mddev),
1151 (unsigned long long)(sh->sector
1152 + rdev->data_offset),
1154 else if (test_bit(R5_ReWrite, &sh->dev[i].flags))
1156 printk_rl(KERN_WARNING
1157 "raid5:%s: read error NOT corrected!! "
1158 "(sector %llu on %s).\n",
1159 mdname(conf->mddev),
1160 (unsigned long long)(sh->sector
1161 + rdev->data_offset),
1163 else if (atomic_read(&rdev->read_errors)
1164 > conf->max_nr_stripes)
1166 "raid5:%s: Too many read errors, failing device %s.\n",
1167 mdname(conf->mddev), bdn);
1171 set_bit(R5_ReadError, &sh->dev[i].flags);
1173 clear_bit(R5_ReadError, &sh->dev[i].flags);
1174 clear_bit(R5_ReWrite, &sh->dev[i].flags);
1175 md_error(conf->mddev, rdev);
1178 rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
1179 clear_bit(R5_LOCKED, &sh->dev[i].flags);
1180 set_bit(STRIPE_HANDLE, &sh->state);
1184 static void raid5_end_write_request(struct bio *bi, int error)
1186 struct stripe_head *sh = bi->bi_private;
1187 raid5_conf_t *conf = sh->raid_conf;
1188 int disks = sh->disks, i;
1189 int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
1191 for (i=0 ; i<disks; i++)
1192 if (bi == &sh->dev[i].req)
1195 pr_debug("end_write_request %llu/%d, count %d, uptodate: %d.\n",
1196 (unsigned long long)sh->sector, i, atomic_read(&sh->count),
1204 md_error(conf->mddev, conf->disks[i].rdev);
1206 rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
1208 clear_bit(R5_LOCKED, &sh->dev[i].flags);
1209 set_bit(STRIPE_HANDLE, &sh->state);
1214 static sector_t compute_blocknr(struct stripe_head *sh, int i, int previous);
1216 static void raid5_build_block(struct stripe_head *sh, int i, int previous)
1218 struct r5dev *dev = &sh->dev[i];
1220 bio_init(&dev->req);
1221 dev->req.bi_io_vec = &dev->vec;
1223 dev->req.bi_max_vecs++;
1224 dev->vec.bv_page = dev->page;
1225 dev->vec.bv_len = STRIPE_SIZE;
1226 dev->vec.bv_offset = 0;
1228 dev->req.bi_sector = sh->sector;
1229 dev->req.bi_private = sh;
1232 dev->sector = compute_blocknr(sh, i, previous);
1235 static void error(mddev_t *mddev, mdk_rdev_t *rdev)
1237 char b[BDEVNAME_SIZE];
1238 raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
1239 pr_debug("raid5: error called\n");
1241 if (!test_bit(Faulty, &rdev->flags)) {
1242 set_bit(MD_CHANGE_DEVS, &mddev->flags);
1243 if (test_and_clear_bit(In_sync, &rdev->flags)) {
1244 unsigned long flags;
1245 spin_lock_irqsave(&conf->device_lock, flags);
1247 spin_unlock_irqrestore(&conf->device_lock, flags);
1249 * if recovery was running, make sure it aborts.
1251 set_bit(MD_RECOVERY_INTR, &mddev->recovery);
1253 set_bit(Faulty, &rdev->flags);
1255 "raid5: Disk failure on %s, disabling device.\n"
1256 "raid5: Operation continuing on %d devices.\n",
1257 bdevname(rdev->bdev,b), conf->raid_disks - mddev->degraded);
1262 * Input: a 'big' sector number,
1263 * Output: index of the data and parity disk, and the sector # in them.
1265 static sector_t raid5_compute_sector(raid5_conf_t *conf, sector_t r_sector,
1266 int previous, int *dd_idx,
1267 struct stripe_head *sh)
1270 unsigned long chunk_number;
1271 unsigned int chunk_offset;
1274 sector_t new_sector;
1275 int algorithm = previous ? conf->prev_algo
1277 int sectors_per_chunk = previous ? (conf->prev_chunk >> 9)
1278 : (conf->chunk_size >> 9);
1279 int raid_disks = previous ? conf->previous_raid_disks
1281 int data_disks = raid_disks - conf->max_degraded;
1283 /* First compute the information on this sector */
1286 * Compute the chunk number and the sector offset inside the chunk
1288 chunk_offset = sector_div(r_sector, sectors_per_chunk);
1289 chunk_number = r_sector;
1290 BUG_ON(r_sector != chunk_number);
1293 * Compute the stripe number
1295 stripe = chunk_number / data_disks;
1298 * Compute the data disk and parity disk indexes inside the stripe
1300 *dd_idx = chunk_number % data_disks;
1303 * Select the parity disk based on the user selected algorithm.
1305 pd_idx = qd_idx = ~0;
1306 switch(conf->level) {
1308 pd_idx = data_disks;
1311 switch (algorithm) {
1312 case ALGORITHM_LEFT_ASYMMETRIC:
1313 pd_idx = data_disks - stripe % raid_disks;
1314 if (*dd_idx >= pd_idx)
1317 case ALGORITHM_RIGHT_ASYMMETRIC:
1318 pd_idx = stripe % raid_disks;
1319 if (*dd_idx >= pd_idx)
1322 case ALGORITHM_LEFT_SYMMETRIC:
1323 pd_idx = data_disks - stripe % raid_disks;
1324 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
1326 case ALGORITHM_RIGHT_SYMMETRIC:
1327 pd_idx = stripe % raid_disks;
1328 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
1330 case ALGORITHM_PARITY_0:
1334 case ALGORITHM_PARITY_N:
1335 pd_idx = data_disks;
1338 printk(KERN_ERR "raid5: unsupported algorithm %d\n",
1345 switch (algorithm) {
1346 case ALGORITHM_LEFT_ASYMMETRIC:
1347 pd_idx = raid_disks - 1 - (stripe % raid_disks);
1348 qd_idx = pd_idx + 1;
1349 if (pd_idx == raid_disks-1) {
1350 (*dd_idx)++; /* Q D D D P */
1352 } else if (*dd_idx >= pd_idx)
1353 (*dd_idx) += 2; /* D D P Q D */
1355 case ALGORITHM_RIGHT_ASYMMETRIC:
1356 pd_idx = stripe % raid_disks;
1357 qd_idx = pd_idx + 1;
1358 if (pd_idx == raid_disks-1) {
1359 (*dd_idx)++; /* Q D D D P */
1361 } else if (*dd_idx >= pd_idx)
1362 (*dd_idx) += 2; /* D D P Q D */
1364 case ALGORITHM_LEFT_SYMMETRIC:
1365 pd_idx = raid_disks - 1 - (stripe % raid_disks);
1366 qd_idx = (pd_idx + 1) % raid_disks;
1367 *dd_idx = (pd_idx + 2 + *dd_idx) % raid_disks;
1369 case ALGORITHM_RIGHT_SYMMETRIC:
1370 pd_idx = stripe % raid_disks;
1371 qd_idx = (pd_idx + 1) % raid_disks;
1372 *dd_idx = (pd_idx + 2 + *dd_idx) % raid_disks;
1375 case ALGORITHM_PARITY_0:
1380 case ALGORITHM_PARITY_N:
1381 pd_idx = data_disks;
1382 qd_idx = data_disks + 1;
1385 case ALGORITHM_ROTATING_ZERO_RESTART:
1386 /* Exactly the same as RIGHT_ASYMMETRIC, but or
1387 * of blocks for computing Q is different.
1389 pd_idx = stripe % raid_disks;
1390 qd_idx = pd_idx + 1;
1391 if (pd_idx == raid_disks-1) {
1392 (*dd_idx)++; /* Q D D D P */
1394 } else if (*dd_idx >= pd_idx)
1395 (*dd_idx) += 2; /* D D P Q D */
1399 case ALGORITHM_ROTATING_N_RESTART:
1400 /* Same a left_asymmetric, by first stripe is
1401 * D D D P Q rather than
1404 pd_idx = raid_disks - 1 - ((stripe + 1) % raid_disks);
1405 qd_idx = pd_idx + 1;
1406 if (pd_idx == raid_disks-1) {
1407 (*dd_idx)++; /* Q D D D P */
1409 } else if (*dd_idx >= pd_idx)
1410 (*dd_idx) += 2; /* D D P Q D */
1414 case ALGORITHM_ROTATING_N_CONTINUE:
1415 /* Same as left_symmetric but Q is before P */
1416 pd_idx = raid_disks - 1 - (stripe % raid_disks);
1417 qd_idx = (pd_idx + raid_disks - 1) % raid_disks;
1418 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
1422 case ALGORITHM_LEFT_ASYMMETRIC_6:
1423 /* RAID5 left_asymmetric, with Q on last device */
1424 pd_idx = data_disks - stripe % (raid_disks-1);
1425 if (*dd_idx >= pd_idx)
1427 qd_idx = raid_disks - 1;
1430 case ALGORITHM_RIGHT_ASYMMETRIC_6:
1431 pd_idx = stripe % (raid_disks-1);
1432 if (*dd_idx >= pd_idx)
1434 qd_idx = raid_disks - 1;
1437 case ALGORITHM_LEFT_SYMMETRIC_6:
1438 pd_idx = data_disks - stripe % (raid_disks-1);
1439 *dd_idx = (pd_idx + 1 + *dd_idx) % (raid_disks-1);
1440 qd_idx = raid_disks - 1;
1443 case ALGORITHM_RIGHT_SYMMETRIC_6:
1444 pd_idx = stripe % (raid_disks-1);
1445 *dd_idx = (pd_idx + 1 + *dd_idx) % (raid_disks-1);
1446 qd_idx = raid_disks - 1;
1449 case ALGORITHM_PARITY_0_6:
1452 qd_idx = raid_disks - 1;
1457 printk(KERN_CRIT "raid6: unsupported algorithm %d\n",
1465 sh->pd_idx = pd_idx;
1466 sh->qd_idx = qd_idx;
1467 sh->ddf_layout = ddf_layout;
1470 * Finally, compute the new sector number
1472 new_sector = (sector_t)stripe * sectors_per_chunk + chunk_offset;
1477 static sector_t compute_blocknr(struct stripe_head *sh, int i, int previous)
1479 raid5_conf_t *conf = sh->raid_conf;
1480 int raid_disks = sh->disks;
1481 int data_disks = raid_disks - conf->max_degraded;
1482 sector_t new_sector = sh->sector, check;
1483 int sectors_per_chunk = previous ? (conf->prev_chunk >> 9)
1484 : (conf->chunk_size >> 9);
1485 int algorithm = previous ? conf->prev_algo
1489 int chunk_number, dummy1, dd_idx = i;
1491 struct stripe_head sh2;
1494 chunk_offset = sector_div(new_sector, sectors_per_chunk);
1495 stripe = new_sector;
1496 BUG_ON(new_sector != stripe);
1498 if (i == sh->pd_idx)
1500 switch(conf->level) {
1503 switch (algorithm) {
1504 case ALGORITHM_LEFT_ASYMMETRIC:
1505 case ALGORITHM_RIGHT_ASYMMETRIC:
1509 case ALGORITHM_LEFT_SYMMETRIC:
1510 case ALGORITHM_RIGHT_SYMMETRIC:
1513 i -= (sh->pd_idx + 1);
1515 case ALGORITHM_PARITY_0:
1518 case ALGORITHM_PARITY_N:
1521 printk(KERN_ERR "raid5: unsupported algorithm %d\n",
1527 if (i == sh->qd_idx)
1528 return 0; /* It is the Q disk */
1529 switch (algorithm) {
1530 case ALGORITHM_LEFT_ASYMMETRIC:
1531 case ALGORITHM_RIGHT_ASYMMETRIC:
1532 case ALGORITHM_ROTATING_ZERO_RESTART:
1533 case ALGORITHM_ROTATING_N_RESTART:
1534 if (sh->pd_idx == raid_disks-1)
1535 i--; /* Q D D D P */
1536 else if (i > sh->pd_idx)
1537 i -= 2; /* D D P Q D */
1539 case ALGORITHM_LEFT_SYMMETRIC:
1540 case ALGORITHM_RIGHT_SYMMETRIC:
1541 if (sh->pd_idx == raid_disks-1)
1542 i--; /* Q D D D P */
1547 i -= (sh->pd_idx + 2);
1550 case ALGORITHM_PARITY_0:
1553 case ALGORITHM_PARITY_N:
1555 case ALGORITHM_ROTATING_N_CONTINUE:
1556 if (sh->pd_idx == 0)
1557 i--; /* P D D D Q */
1558 else if (i > sh->pd_idx)
1559 i -= 2; /* D D Q P D */
1561 case ALGORITHM_LEFT_ASYMMETRIC_6:
1562 case ALGORITHM_RIGHT_ASYMMETRIC_6:
1566 case ALGORITHM_LEFT_SYMMETRIC_6:
1567 case ALGORITHM_RIGHT_SYMMETRIC_6:
1569 i += data_disks + 1;
1570 i -= (sh->pd_idx + 1);
1572 case ALGORITHM_PARITY_0_6:
1576 printk(KERN_CRIT "raid6: unsupported algorithm %d\n",
1583 chunk_number = stripe * data_disks + i;
1584 r_sector = (sector_t)chunk_number * sectors_per_chunk + chunk_offset;
1586 check = raid5_compute_sector(conf, r_sector,
1587 previous, &dummy1, &sh2);
1588 if (check != sh->sector || dummy1 != dd_idx || sh2.pd_idx != sh->pd_idx
1589 || sh2.qd_idx != sh->qd_idx) {
1590 printk(KERN_ERR "compute_blocknr: map not correct\n");
1599 * Copy data between a page in the stripe cache, and one or more bion
1600 * The page could align with the middle of the bio, or there could be
1601 * several bion, each with several bio_vecs, which cover part of the page
1602 * Multiple bion are linked together on bi_next. There may be extras
1603 * at the end of this list. We ignore them.
1605 static void copy_data(int frombio, struct bio *bio,
1609 char *pa = page_address(page);
1610 struct bio_vec *bvl;
1614 if (bio->bi_sector >= sector)
1615 page_offset = (signed)(bio->bi_sector - sector) * 512;
1617 page_offset = (signed)(sector - bio->bi_sector) * -512;
1618 bio_for_each_segment(bvl, bio, i) {
1619 int len = bio_iovec_idx(bio,i)->bv_len;
1623 if (page_offset < 0) {
1624 b_offset = -page_offset;
1625 page_offset += b_offset;
1629 if (len > 0 && page_offset + len > STRIPE_SIZE)
1630 clen = STRIPE_SIZE - page_offset;
1634 char *ba = __bio_kmap_atomic(bio, i, KM_USER0);
1636 memcpy(pa+page_offset, ba+b_offset, clen);
1638 memcpy(ba+b_offset, pa+page_offset, clen);
1639 __bio_kunmap_atomic(ba, KM_USER0);
1641 if (clen < len) /* hit end of page */
1647 #define check_xor() do { \
1648 if (count == MAX_XOR_BLOCKS) { \
1649 xor_blocks(count, STRIPE_SIZE, dest, ptr);\
1654 static void compute_parity6(struct stripe_head *sh, int method)
1656 raid5_conf_t *conf = sh->raid_conf;
1657 int i, pd_idx, qd_idx, d0_idx, disks = sh->disks, count;
1658 int syndrome_disks = sh->ddf_layout ? disks : (disks - 2);
1660 /**** FIX THIS: This could be very bad if disks is close to 256 ****/
1661 void *ptrs[syndrome_disks+2];
1663 pd_idx = sh->pd_idx;
1664 qd_idx = sh->qd_idx;
1665 d0_idx = raid6_d0(sh);
1667 pr_debug("compute_parity, stripe %llu, method %d\n",
1668 (unsigned long long)sh->sector, method);
1671 case READ_MODIFY_WRITE:
1672 BUG(); /* READ_MODIFY_WRITE N/A for RAID-6 */
1673 case RECONSTRUCT_WRITE:
1674 for (i= disks; i-- ;)
1675 if ( i != pd_idx && i != qd_idx && sh->dev[i].towrite ) {
1676 chosen = sh->dev[i].towrite;
1677 sh->dev[i].towrite = NULL;
1679 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
1680 wake_up(&conf->wait_for_overlap);
1682 BUG_ON(sh->dev[i].written);
1683 sh->dev[i].written = chosen;
1687 BUG(); /* Not implemented yet */
1690 for (i = disks; i--;)
1691 if (sh->dev[i].written) {
1692 sector_t sector = sh->dev[i].sector;
1693 struct bio *wbi = sh->dev[i].written;
1694 while (wbi && wbi->bi_sector < sector + STRIPE_SECTORS) {
1695 copy_data(1, wbi, sh->dev[i].page, sector);
1696 wbi = r5_next_bio(wbi, sector);
1699 set_bit(R5_LOCKED, &sh->dev[i].flags);
1700 set_bit(R5_UPTODATE, &sh->dev[i].flags);
1703 /* Note that unlike RAID-5, the ordering of the disks matters greatly.*/
1705 for (i = 0; i < disks; i++)
1706 ptrs[i] = (void *)raid6_empty_zero_page;
1711 int slot = raid6_idx_to_slot(i, sh, &count, syndrome_disks);
1713 ptrs[slot] = page_address(sh->dev[i].page);
1714 if (slot < syndrome_disks &&
1715 !test_bit(R5_UPTODATE, &sh->dev[i].flags)) {
1716 printk(KERN_ERR "block %d/%d not uptodate "
1717 "on parity calc\n", i, count);
1721 i = raid6_next_disk(i, disks);
1722 } while (i != d0_idx);
1723 BUG_ON(count != syndrome_disks);
1725 raid6_call.gen_syndrome(syndrome_disks+2, STRIPE_SIZE, ptrs);
1728 case RECONSTRUCT_WRITE:
1729 set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
1730 set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
1731 set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
1732 set_bit(R5_LOCKED, &sh->dev[qd_idx].flags);
1735 set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
1736 set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
1742 /* Compute one missing block */
1743 static void compute_block_1(struct stripe_head *sh, int dd_idx, int nozero)
1745 int i, count, disks = sh->disks;
1746 void *ptr[MAX_XOR_BLOCKS], *dest, *p;
1747 int qd_idx = sh->qd_idx;
1749 pr_debug("compute_block_1, stripe %llu, idx %d\n",
1750 (unsigned long long)sh->sector, dd_idx);
1752 if ( dd_idx == qd_idx ) {
1753 /* We're actually computing the Q drive */
1754 compute_parity6(sh, UPDATE_PARITY);
1756 dest = page_address(sh->dev[dd_idx].page);
1757 if (!nozero) memset(dest, 0, STRIPE_SIZE);
1759 for (i = disks ; i--; ) {
1760 if (i == dd_idx || i == qd_idx)
1762 p = page_address(sh->dev[i].page);
1763 if (test_bit(R5_UPTODATE, &sh->dev[i].flags))
1766 printk("compute_block() %d, stripe %llu, %d"
1767 " not present\n", dd_idx,
1768 (unsigned long long)sh->sector, i);
1773 xor_blocks(count, STRIPE_SIZE, dest, ptr);
1774 if (!nozero) set_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
1775 else clear_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
1779 /* Compute two missing blocks */
1780 static void compute_block_2(struct stripe_head *sh, int dd_idx1, int dd_idx2)
1782 int i, count, disks = sh->disks;
1783 int syndrome_disks = sh->ddf_layout ? disks : disks-2;
1784 int d0_idx = raid6_d0(sh);
1785 int faila = -1, failb = -1;
1786 /**** FIX THIS: This could be very bad if disks is close to 256 ****/
1787 void *ptrs[syndrome_disks+2];
1789 for (i = 0; i < disks ; i++)
1790 ptrs[i] = (void *)raid6_empty_zero_page;
1794 int slot = raid6_idx_to_slot(i, sh, &count, syndrome_disks);
1796 ptrs[slot] = page_address(sh->dev[i].page);
1802 i = raid6_next_disk(i, disks);
1803 } while (i != d0_idx);
1804 BUG_ON(count != syndrome_disks);
1806 BUG_ON(faila == failb);
1807 if ( failb < faila ) { int tmp = faila; faila = failb; failb = tmp; }
1809 pr_debug("compute_block_2, stripe %llu, idx %d,%d (%d,%d)\n",
1810 (unsigned long long)sh->sector, dd_idx1, dd_idx2,
1813 if (failb == syndrome_disks+1) {
1814 /* Q disk is one of the missing disks */
1815 if (faila == syndrome_disks) {
1816 /* Missing P+Q, just recompute */
1817 compute_parity6(sh, UPDATE_PARITY);
1820 /* We're missing D+Q; recompute D from P */
1821 compute_block_1(sh, ((dd_idx1 == sh->qd_idx) ?
1824 compute_parity6(sh, UPDATE_PARITY); /* Is this necessary? */
1829 /* We're missing D+P or D+D; */
1830 if (failb == syndrome_disks) {
1831 /* We're missing D+P. */
1832 raid6_datap_recov(syndrome_disks+2, STRIPE_SIZE, faila, ptrs);
1834 /* We're missing D+D. */
1835 raid6_2data_recov(syndrome_disks+2, STRIPE_SIZE, faila, failb,
1839 /* Both the above update both missing blocks */
1840 set_bit(R5_UPTODATE, &sh->dev[dd_idx1].flags);
1841 set_bit(R5_UPTODATE, &sh->dev[dd_idx2].flags);
1845 schedule_reconstruction5(struct stripe_head *sh, struct stripe_head_state *s,
1846 int rcw, int expand)
1848 int i, pd_idx = sh->pd_idx, disks = sh->disks;
1851 /* if we are not expanding this is a proper write request, and
1852 * there will be bios with new data to be drained into the
1856 sh->reconstruct_state = reconstruct_state_drain_run;
1857 set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
1859 sh->reconstruct_state = reconstruct_state_run;
1861 set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1863 for (i = disks; i--; ) {
1864 struct r5dev *dev = &sh->dev[i];
1867 set_bit(R5_LOCKED, &dev->flags);
1868 set_bit(R5_Wantdrain, &dev->flags);
1870 clear_bit(R5_UPTODATE, &dev->flags);
1874 if (s->locked + 1 == disks)
1875 if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
1876 atomic_inc(&sh->raid_conf->pending_full_writes);
1878 BUG_ON(!(test_bit(R5_UPTODATE, &sh->dev[pd_idx].flags) ||
1879 test_bit(R5_Wantcompute, &sh->dev[pd_idx].flags)));
1881 sh->reconstruct_state = reconstruct_state_prexor_drain_run;
1882 set_bit(STRIPE_OP_PREXOR, &s->ops_request);
1883 set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
1884 set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1886 for (i = disks; i--; ) {
1887 struct r5dev *dev = &sh->dev[i];
1892 (test_bit(R5_UPTODATE, &dev->flags) ||
1893 test_bit(R5_Wantcompute, &dev->flags))) {
1894 set_bit(R5_Wantdrain, &dev->flags);
1895 set_bit(R5_LOCKED, &dev->flags);
1896 clear_bit(R5_UPTODATE, &dev->flags);
1902 /* keep the parity disk locked while asynchronous operations
1905 set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
1906 clear_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
1909 pr_debug("%s: stripe %llu locked: %d ops_request: %lx\n",
1910 __func__, (unsigned long long)sh->sector,
1911 s->locked, s->ops_request);
1915 * Each stripe/dev can have one or more bion attached.
1916 * toread/towrite point to the first in a chain.
1917 * The bi_next chain must be in order.
1919 static int add_stripe_bio(struct stripe_head *sh, struct bio *bi, int dd_idx, int forwrite)
1922 raid5_conf_t *conf = sh->raid_conf;
1925 pr_debug("adding bh b#%llu to stripe s#%llu\n",
1926 (unsigned long long)bi->bi_sector,
1927 (unsigned long long)sh->sector);
1930 spin_lock(&sh->lock);
1931 spin_lock_irq(&conf->device_lock);
1933 bip = &sh->dev[dd_idx].towrite;
1934 if (*bip == NULL && sh->dev[dd_idx].written == NULL)
1937 bip = &sh->dev[dd_idx].toread;
1938 while (*bip && (*bip)->bi_sector < bi->bi_sector) {
1939 if ((*bip)->bi_sector + ((*bip)->bi_size >> 9) > bi->bi_sector)
1941 bip = & (*bip)->bi_next;
1943 if (*bip && (*bip)->bi_sector < bi->bi_sector + ((bi->bi_size)>>9))
1946 BUG_ON(*bip && bi->bi_next && (*bip) != bi->bi_next);
1950 bi->bi_phys_segments++;
1951 spin_unlock_irq(&conf->device_lock);
1952 spin_unlock(&sh->lock);
1954 pr_debug("added bi b#%llu to stripe s#%llu, disk %d.\n",
1955 (unsigned long long)bi->bi_sector,
1956 (unsigned long long)sh->sector, dd_idx);
1958 if (conf->mddev->bitmap && firstwrite) {
1959 bitmap_startwrite(conf->mddev->bitmap, sh->sector,
1961 sh->bm_seq = conf->seq_flush+1;
1962 set_bit(STRIPE_BIT_DELAY, &sh->state);
1966 /* check if page is covered */
1967 sector_t sector = sh->dev[dd_idx].sector;
1968 for (bi=sh->dev[dd_idx].towrite;
1969 sector < sh->dev[dd_idx].sector + STRIPE_SECTORS &&
1970 bi && bi->bi_sector <= sector;
1971 bi = r5_next_bio(bi, sh->dev[dd_idx].sector)) {
1972 if (bi->bi_sector + (bi->bi_size>>9) >= sector)
1973 sector = bi->bi_sector + (bi->bi_size>>9);
1975 if (sector >= sh->dev[dd_idx].sector + STRIPE_SECTORS)
1976 set_bit(R5_OVERWRITE, &sh->dev[dd_idx].flags);
1981 set_bit(R5_Overlap, &sh->dev[dd_idx].flags);
1982 spin_unlock_irq(&conf->device_lock);
1983 spin_unlock(&sh->lock);
1987 static void end_reshape(raid5_conf_t *conf);
1989 static int page_is_zero(struct page *p)
1991 char *a = page_address(p);
1992 return ((*(u32*)a) == 0 &&
1993 memcmp(a, a+4, STRIPE_SIZE-4)==0);
1996 static void stripe_set_idx(sector_t stripe, raid5_conf_t *conf, int previous,
1997 struct stripe_head *sh)
1999 int sectors_per_chunk =
2000 previous ? (conf->prev_chunk >> 9)
2001 : (conf->chunk_size >> 9);
2003 int chunk_offset = sector_div(stripe, sectors_per_chunk);
2004 int disks = previous ? conf->previous_raid_disks : conf->raid_disks;
2006 raid5_compute_sector(conf,
2007 stripe * (disks - conf->max_degraded)
2008 *sectors_per_chunk + chunk_offset,
2014 handle_failed_stripe(raid5_conf_t *conf, struct stripe_head *sh,
2015 struct stripe_head_state *s, int disks,
2016 struct bio **return_bi)
2019 for (i = disks; i--; ) {
2023 if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
2026 rdev = rcu_dereference(conf->disks[i].rdev);
2027 if (rdev && test_bit(In_sync, &rdev->flags))
2028 /* multiple read failures in one stripe */
2029 md_error(conf->mddev, rdev);
2032 spin_lock_irq(&conf->device_lock);
2033 /* fail all writes first */
2034 bi = sh->dev[i].towrite;
2035 sh->dev[i].towrite = NULL;
2041 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
2042 wake_up(&conf->wait_for_overlap);
2044 while (bi && bi->bi_sector <
2045 sh->dev[i].sector + STRIPE_SECTORS) {
2046 struct bio *nextbi = r5_next_bio(bi, sh->dev[i].sector);
2047 clear_bit(BIO_UPTODATE, &bi->bi_flags);
2048 if (!raid5_dec_bi_phys_segments(bi)) {
2049 md_write_end(conf->mddev);
2050 bi->bi_next = *return_bi;
2055 /* and fail all 'written' */
2056 bi = sh->dev[i].written;
2057 sh->dev[i].written = NULL;
2058 if (bi) bitmap_end = 1;
2059 while (bi && bi->bi_sector <
2060 sh->dev[i].sector + STRIPE_SECTORS) {
2061 struct bio *bi2 = r5_next_bio(bi, sh->dev[i].sector);
2062 clear_bit(BIO_UPTODATE, &bi->bi_flags);
2063 if (!raid5_dec_bi_phys_segments(bi)) {
2064 md_write_end(conf->mddev);
2065 bi->bi_next = *return_bi;
2071 /* fail any reads if this device is non-operational and
2072 * the data has not reached the cache yet.
2074 if (!test_bit(R5_Wantfill, &sh->dev[i].flags) &&
2075 (!test_bit(R5_Insync, &sh->dev[i].flags) ||
2076 test_bit(R5_ReadError, &sh->dev[i].flags))) {
2077 bi = sh->dev[i].toread;
2078 sh->dev[i].toread = NULL;
2079 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
2080 wake_up(&conf->wait_for_overlap);
2081 if (bi) s->to_read--;
2082 while (bi && bi->bi_sector <
2083 sh->dev[i].sector + STRIPE_SECTORS) {
2084 struct bio *nextbi =
2085 r5_next_bio(bi, sh->dev[i].sector);
2086 clear_bit(BIO_UPTODATE, &bi->bi_flags);
2087 if (!raid5_dec_bi_phys_segments(bi)) {
2088 bi->bi_next = *return_bi;
2094 spin_unlock_irq(&conf->device_lock);
2096 bitmap_endwrite(conf->mddev->bitmap, sh->sector,
2097 STRIPE_SECTORS, 0, 0);
2100 if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
2101 if (atomic_dec_and_test(&conf->pending_full_writes))
2102 md_wakeup_thread(conf->mddev->thread);
2105 /* fetch_block5 - checks the given member device to see if its data needs
2106 * to be read or computed to satisfy a request.
2108 * Returns 1 when no more member devices need to be checked, otherwise returns
2109 * 0 to tell the loop in handle_stripe_fill5 to continue
2111 static int fetch_block5(struct stripe_head *sh, struct stripe_head_state *s,
2112 int disk_idx, int disks)
2114 struct r5dev *dev = &sh->dev[disk_idx];
2115 struct r5dev *failed_dev = &sh->dev[s->failed_num];
2117 /* is the data in this block needed, and can we get it? */
2118 if (!test_bit(R5_LOCKED, &dev->flags) &&
2119 !test_bit(R5_UPTODATE, &dev->flags) &&
2121 (dev->towrite && !test_bit(R5_OVERWRITE, &dev->flags)) ||
2122 s->syncing || s->expanding ||
2124 (failed_dev->toread ||
2125 (failed_dev->towrite &&
2126 !test_bit(R5_OVERWRITE, &failed_dev->flags)))))) {
2127 /* We would like to get this block, possibly by computing it,
2128 * otherwise read it if the backing disk is insync
2130 if ((s->uptodate == disks - 1) &&
2131 (s->failed && disk_idx == s->failed_num)) {
2132 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
2133 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
2134 set_bit(R5_Wantcompute, &dev->flags);
2135 sh->ops.target = disk_idx;
2137 /* Careful: from this point on 'uptodate' is in the eye
2138 * of raid5_run_ops which services 'compute' operations
2139 * before writes. R5_Wantcompute flags a block that will
2140 * be R5_UPTODATE by the time it is needed for a
2141 * subsequent operation.
2144 return 1; /* uptodate + compute == disks */
2145 } else if (test_bit(R5_Insync, &dev->flags)) {
2146 set_bit(R5_LOCKED, &dev->flags);
2147 set_bit(R5_Wantread, &dev->flags);
2149 pr_debug("Reading block %d (sync=%d)\n", disk_idx,
2158 * handle_stripe_fill5 - read or compute data to satisfy pending requests.
2160 static void handle_stripe_fill5(struct stripe_head *sh,
2161 struct stripe_head_state *s, int disks)
2165 /* look for blocks to read/compute, skip this if a compute
2166 * is already in flight, or if the stripe contents are in the
2167 * midst of changing due to a write
2169 if (!test_bit(STRIPE_COMPUTE_RUN, &sh->state) && !sh->check_state &&
2170 !sh->reconstruct_state)
2171 for (i = disks; i--; )
2172 if (fetch_block5(sh, s, i, disks))
2174 set_bit(STRIPE_HANDLE, &sh->state);
2177 static void handle_stripe_fill6(struct stripe_head *sh,
2178 struct stripe_head_state *s, struct r6_state *r6s,
2182 for (i = disks; i--; ) {
2183 struct r5dev *dev = &sh->dev[i];
2184 if (!test_bit(R5_LOCKED, &dev->flags) &&
2185 !test_bit(R5_UPTODATE, &dev->flags) &&
2186 (dev->toread || (dev->towrite &&
2187 !test_bit(R5_OVERWRITE, &dev->flags)) ||
2188 s->syncing || s->expanding ||
2190 (sh->dev[r6s->failed_num[0]].toread ||
2193 (sh->dev[r6s->failed_num[1]].toread ||
2195 /* we would like to get this block, possibly
2196 * by computing it, but we might not be able to
2198 if ((s->uptodate == disks - 1) &&
2199 (s->failed && (i == r6s->failed_num[0] ||
2200 i == r6s->failed_num[1]))) {
2201 pr_debug("Computing stripe %llu block %d\n",
2202 (unsigned long long)sh->sector, i);
2203 compute_block_1(sh, i, 0);
2205 } else if ( s->uptodate == disks-2 && s->failed >= 2 ) {
2206 /* Computing 2-failure is *very* expensive; only
2207 * do it if failed >= 2
2210 for (other = disks; other--; ) {
2213 if (!test_bit(R5_UPTODATE,
2214 &sh->dev[other].flags))
2218 pr_debug("Computing stripe %llu blocks %d,%d\n",
2219 (unsigned long long)sh->sector,
2221 compute_block_2(sh, i, other);
2223 } else if (test_bit(R5_Insync, &dev->flags)) {
2224 set_bit(R5_LOCKED, &dev->flags);
2225 set_bit(R5_Wantread, &dev->flags);
2227 pr_debug("Reading block %d (sync=%d)\n",
2232 set_bit(STRIPE_HANDLE, &sh->state);
2236 /* handle_stripe_clean_event
2237 * any written block on an uptodate or failed drive can be returned.
2238 * Note that if we 'wrote' to a failed drive, it will be UPTODATE, but
2239 * never LOCKED, so we don't need to test 'failed' directly.
2241 static void handle_stripe_clean_event(raid5_conf_t *conf,
2242 struct stripe_head *sh, int disks, struct bio **return_bi)
2247 for (i = disks; i--; )
2248 if (sh->dev[i].written) {
2250 if (!test_bit(R5_LOCKED, &dev->flags) &&
2251 test_bit(R5_UPTODATE, &dev->flags)) {
2252 /* We can return any write requests */
2253 struct bio *wbi, *wbi2;
2255 pr_debug("Return write for disc %d\n", i);
2256 spin_lock_irq(&conf->device_lock);
2258 dev->written = NULL;
2259 while (wbi && wbi->bi_sector <
2260 dev->sector + STRIPE_SECTORS) {
2261 wbi2 = r5_next_bio(wbi, dev->sector);
2262 if (!raid5_dec_bi_phys_segments(wbi)) {
2263 md_write_end(conf->mddev);
2264 wbi->bi_next = *return_bi;
2269 if (dev->towrite == NULL)
2271 spin_unlock_irq(&conf->device_lock);
2273 bitmap_endwrite(conf->mddev->bitmap,
2276 !test_bit(STRIPE_DEGRADED, &sh->state),
2281 if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
2282 if (atomic_dec_and_test(&conf->pending_full_writes))
2283 md_wakeup_thread(conf->mddev->thread);
2286 static void handle_stripe_dirtying5(raid5_conf_t *conf,
2287 struct stripe_head *sh, struct stripe_head_state *s, int disks)
2289 int rmw = 0, rcw = 0, i;
2290 for (i = disks; i--; ) {
2291 /* would I have to read this buffer for read_modify_write */
2292 struct r5dev *dev = &sh->dev[i];
2293 if ((dev->towrite || i == sh->pd_idx) &&
2294 !test_bit(R5_LOCKED, &dev->flags) &&
2295 !(test_bit(R5_UPTODATE, &dev->flags) ||
2296 test_bit(R5_Wantcompute, &dev->flags))) {
2297 if (test_bit(R5_Insync, &dev->flags))
2300 rmw += 2*disks; /* cannot read it */
2302 /* Would I have to read this buffer for reconstruct_write */
2303 if (!test_bit(R5_OVERWRITE, &dev->flags) && i != sh->pd_idx &&
2304 !test_bit(R5_LOCKED, &dev->flags) &&
2305 !(test_bit(R5_UPTODATE, &dev->flags) ||
2306 test_bit(R5_Wantcompute, &dev->flags))) {
2307 if (test_bit(R5_Insync, &dev->flags)) rcw++;
2312 pr_debug("for sector %llu, rmw=%d rcw=%d\n",
2313 (unsigned long long)sh->sector, rmw, rcw);
2314 set_bit(STRIPE_HANDLE, &sh->state);
2315 if (rmw < rcw && rmw > 0)
2316 /* prefer read-modify-write, but need to get some data */
2317 for (i = disks; i--; ) {
2318 struct r5dev *dev = &sh->dev[i];
2319 if ((dev->towrite || i == sh->pd_idx) &&
2320 !test_bit(R5_LOCKED, &dev->flags) &&
2321 !(test_bit(R5_UPTODATE, &dev->flags) ||
2322 test_bit(R5_Wantcompute, &dev->flags)) &&
2323 test_bit(R5_Insync, &dev->flags)) {
2325 test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2326 pr_debug("Read_old block "
2327 "%d for r-m-w\n", i);
2328 set_bit(R5_LOCKED, &dev->flags);
2329 set_bit(R5_Wantread, &dev->flags);
2332 set_bit(STRIPE_DELAYED, &sh->state);
2333 set_bit(STRIPE_HANDLE, &sh->state);
2337 if (rcw <= rmw && rcw > 0)
2338 /* want reconstruct write, but need to get some data */
2339 for (i = disks; i--; ) {
2340 struct r5dev *dev = &sh->dev[i];
2341 if (!test_bit(R5_OVERWRITE, &dev->flags) &&
2343 !test_bit(R5_LOCKED, &dev->flags) &&
2344 !(test_bit(R5_UPTODATE, &dev->flags) ||
2345 test_bit(R5_Wantcompute, &dev->flags)) &&
2346 test_bit(R5_Insync, &dev->flags)) {
2348 test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2349 pr_debug("Read_old block "
2350 "%d for Reconstruct\n", i);
2351 set_bit(R5_LOCKED, &dev->flags);
2352 set_bit(R5_Wantread, &dev->flags);
2355 set_bit(STRIPE_DELAYED, &sh->state);
2356 set_bit(STRIPE_HANDLE, &sh->state);
2360 /* now if nothing is locked, and if we have enough data,
2361 * we can start a write request
2363 /* since handle_stripe can be called at any time we need to handle the
2364 * case where a compute block operation has been submitted and then a
2365 * subsequent call wants to start a write request. raid5_run_ops only
2366 * handles the case where compute block and postxor are requested
2367 * simultaneously. If this is not the case then new writes need to be
2368 * held off until the compute completes.
2370 if ((s->req_compute || !test_bit(STRIPE_COMPUTE_RUN, &sh->state)) &&
2371 (s->locked == 0 && (rcw == 0 || rmw == 0) &&
2372 !test_bit(STRIPE_BIT_DELAY, &sh->state)))
2373 schedule_reconstruction5(sh, s, rcw == 0, 0);
2376 static void handle_stripe_dirtying6(raid5_conf_t *conf,
2377 struct stripe_head *sh, struct stripe_head_state *s,
2378 struct r6_state *r6s, int disks)
2380 int rcw = 0, must_compute = 0, pd_idx = sh->pd_idx, i;
2381 int qd_idx = sh->qd_idx;
2382 for (i = disks; i--; ) {
2383 struct r5dev *dev = &sh->dev[i];
2384 /* Would I have to read this buffer for reconstruct_write */
2385 if (!test_bit(R5_OVERWRITE, &dev->flags)
2386 && i != pd_idx && i != qd_idx
2387 && (!test_bit(R5_LOCKED, &dev->flags)
2389 !test_bit(R5_UPTODATE, &dev->flags)) {
2390 if (test_bit(R5_Insync, &dev->flags)) rcw++;
2392 pr_debug("raid6: must_compute: "
2393 "disk %d flags=%#lx\n", i, dev->flags);
2398 pr_debug("for sector %llu, rcw=%d, must_compute=%d\n",
2399 (unsigned long long)sh->sector, rcw, must_compute);
2400 set_bit(STRIPE_HANDLE, &sh->state);
2403 /* want reconstruct write, but need to get some data */
2404 for (i = disks; i--; ) {
2405 struct r5dev *dev = &sh->dev[i];
2406 if (!test_bit(R5_OVERWRITE, &dev->flags)
2407 && !(s->failed == 0 && (i == pd_idx || i == qd_idx))
2408 && !test_bit(R5_LOCKED, &dev->flags) &&
2409 !test_bit(R5_UPTODATE, &dev->flags) &&
2410 test_bit(R5_Insync, &dev->flags)) {
2412 test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2413 pr_debug("Read_old stripe %llu "
2414 "block %d for Reconstruct\n",
2415 (unsigned long long)sh->sector, i);
2416 set_bit(R5_LOCKED, &dev->flags);
2417 set_bit(R5_Wantread, &dev->flags);
2420 pr_debug("Request delayed stripe %llu "
2421 "block %d for Reconstruct\n",
2422 (unsigned long long)sh->sector, i);
2423 set_bit(STRIPE_DELAYED, &sh->state);
2424 set_bit(STRIPE_HANDLE, &sh->state);
2428 /* now if nothing is locked, and if we have enough data, we can start a
2431 if (s->locked == 0 && rcw == 0 &&
2432 !test_bit(STRIPE_BIT_DELAY, &sh->state)) {
2433 if (must_compute > 0) {
2434 /* We have failed blocks and need to compute them */
2435 switch (s->failed) {
2439 compute_block_1(sh, r6s->failed_num[0], 0);
2442 compute_block_2(sh, r6s->failed_num[0],
2443 r6s->failed_num[1]);
2445 default: /* This request should have been failed? */
2450 pr_debug("Computing parity for stripe %llu\n",
2451 (unsigned long long)sh->sector);
2452 compute_parity6(sh, RECONSTRUCT_WRITE);
2453 /* now every locked buffer is ready to be written */
2454 for (i = disks; i--; )
2455 if (test_bit(R5_LOCKED, &sh->dev[i].flags)) {
2456 pr_debug("Writing stripe %llu block %d\n",
2457 (unsigned long long)sh->sector, i);
2459 set_bit(R5_Wantwrite, &sh->dev[i].flags);
2461 if (s->locked == disks)
2462 if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
2463 atomic_inc(&conf->pending_full_writes);
2464 /* after a RECONSTRUCT_WRITE, the stripe MUST be in-sync */
2465 set_bit(STRIPE_INSYNC, &sh->state);
2467 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2468 atomic_dec(&conf->preread_active_stripes);
2469 if (atomic_read(&conf->preread_active_stripes) <
2471 md_wakeup_thread(conf->mddev->thread);
2476 static void handle_parity_checks5(raid5_conf_t *conf, struct stripe_head *sh,
2477 struct stripe_head_state *s, int disks)
2479 struct r5dev *dev = NULL;
2481 set_bit(STRIPE_HANDLE, &sh->state);
2483 switch (sh->check_state) {
2484 case check_state_idle:
2485 /* start a new check operation if there are no failures */
2486 if (s->failed == 0) {
2487 BUG_ON(s->uptodate != disks);
2488 sh->check_state = check_state_run;
2489 set_bit(STRIPE_OP_CHECK, &s->ops_request);
2490 clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
2494 dev = &sh->dev[s->failed_num];
2496 case check_state_compute_result:
2497 sh->check_state = check_state_idle;
2499 dev = &sh->dev[sh->pd_idx];
2501 /* check that a write has not made the stripe insync */
2502 if (test_bit(STRIPE_INSYNC, &sh->state))
2505 /* either failed parity check, or recovery is happening */
2506 BUG_ON(!test_bit(R5_UPTODATE, &dev->flags));
2507 BUG_ON(s->uptodate != disks);
2509 set_bit(R5_LOCKED, &dev->flags);
2511 set_bit(R5_Wantwrite, &dev->flags);
2513 clear_bit(STRIPE_DEGRADED, &sh->state);
2514 set_bit(STRIPE_INSYNC, &sh->state);
2516 case check_state_run:
2517 break; /* we will be called again upon completion */
2518 case check_state_check_result:
2519 sh->check_state = check_state_idle;
2521 /* if a failure occurred during the check operation, leave
2522 * STRIPE_INSYNC not set and let the stripe be handled again
2527 /* handle a successful check operation, if parity is correct
2528 * we are done. Otherwise update the mismatch count and repair
2529 * parity if !MD_RECOVERY_CHECK
2531 if (sh->ops.zero_sum_result == 0)
2532 /* parity is correct (on disc,
2533 * not in buffer any more)
2535 set_bit(STRIPE_INSYNC, &sh->state);
2537 conf->mddev->resync_mismatches += STRIPE_SECTORS;
2538 if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
2539 /* don't try to repair!! */
2540 set_bit(STRIPE_INSYNC, &sh->state);
2542 sh->check_state = check_state_compute_run;
2543 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
2544 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
2545 set_bit(R5_Wantcompute,
2546 &sh->dev[sh->pd_idx].flags);
2547 sh->ops.target = sh->pd_idx;
2552 case check_state_compute_run:
2555 printk(KERN_ERR "%s: unknown check_state: %d sector: %llu\n",
2556 __func__, sh->check_state,
2557 (unsigned long long) sh->sector);
2563 static void handle_parity_checks6(raid5_conf_t *conf, struct stripe_head *sh,
2564 struct stripe_head_state *s,
2565 struct r6_state *r6s, struct page *tmp_page,
2568 int update_p = 0, update_q = 0;
2570 int pd_idx = sh->pd_idx;
2571 int qd_idx = sh->qd_idx;
2573 set_bit(STRIPE_HANDLE, &sh->state);
2575 BUG_ON(s->failed > 2);
2576 BUG_ON(s->uptodate < disks);
2577 /* Want to check and possibly repair P and Q.
2578 * However there could be one 'failed' device, in which
2579 * case we can only check one of them, possibly using the
2580 * other to generate missing data
2583 /* If !tmp_page, we cannot do the calculations,
2584 * but as we have set STRIPE_HANDLE, we will soon be called
2585 * by stripe_handle with a tmp_page - just wait until then.
2588 if (s->failed == r6s->q_failed) {
2589 /* The only possible failed device holds 'Q', so it
2590 * makes sense to check P (If anything else were failed,
2591 * we would have used P to recreate it).
2593 compute_block_1(sh, pd_idx, 1);
2594 if (!page_is_zero(sh->dev[pd_idx].page)) {
2595 compute_block_1(sh, pd_idx, 0);
2599 if (!r6s->q_failed && s->failed < 2) {
2600 /* q is not failed, and we didn't use it to generate
2601 * anything, so it makes sense to check it
2603 memcpy(page_address(tmp_page),
2604 page_address(sh->dev[qd_idx].page),
2606 compute_parity6(sh, UPDATE_PARITY);
2607 if (memcmp(page_address(tmp_page),
2608 page_address(sh->dev[qd_idx].page),
2609 STRIPE_SIZE) != 0) {
2610 clear_bit(STRIPE_INSYNC, &sh->state);
2614 if (update_p || update_q) {
2615 conf->mddev->resync_mismatches += STRIPE_SECTORS;
2616 if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
2617 /* don't try to repair!! */
2618 update_p = update_q = 0;
2621 /* now write out any block on a failed drive,
2622 * or P or Q if they need it
2625 if (s->failed == 2) {
2626 dev = &sh->dev[r6s->failed_num[1]];
2628 set_bit(R5_LOCKED, &dev->flags);
2629 set_bit(R5_Wantwrite, &dev->flags);
2631 if (s->failed >= 1) {
2632 dev = &sh->dev[r6s->failed_num[0]];
2634 set_bit(R5_LOCKED, &dev->flags);
2635 set_bit(R5_Wantwrite, &dev->flags);
2639 dev = &sh->dev[pd_idx];
2641 set_bit(R5_LOCKED, &dev->flags);
2642 set_bit(R5_Wantwrite, &dev->flags);
2645 dev = &sh->dev[qd_idx];
2647 set_bit(R5_LOCKED, &dev->flags);
2648 set_bit(R5_Wantwrite, &dev->flags);
2650 clear_bit(STRIPE_DEGRADED, &sh->state);
2652 set_bit(STRIPE_INSYNC, &sh->state);
2656 static void handle_stripe_expansion(raid5_conf_t *conf, struct stripe_head *sh,
2657 struct r6_state *r6s)
2661 /* We have read all the blocks in this stripe and now we need to
2662 * copy some of them into a target stripe for expand.
2664 struct dma_async_tx_descriptor *tx = NULL;
2665 clear_bit(STRIPE_EXPAND_SOURCE, &sh->state);
2666 for (i = 0; i < sh->disks; i++)
2667 if (i != sh->pd_idx && i != sh->qd_idx) {
2669 struct stripe_head *sh2;
2671 sector_t bn = compute_blocknr(sh, i, 1);
2672 sector_t s = raid5_compute_sector(conf, bn, 0,
2674 sh2 = get_active_stripe(conf, s, 0, 1);
2676 /* so far only the early blocks of this stripe
2677 * have been requested. When later blocks
2678 * get requested, we will try again
2681 if (!test_bit(STRIPE_EXPANDING, &sh2->state) ||
2682 test_bit(R5_Expanded, &sh2->dev[dd_idx].flags)) {
2683 /* must have already done this block */
2684 release_stripe(sh2);
2688 /* place all the copies on one channel */
2689 tx = async_memcpy(sh2->dev[dd_idx].page,
2690 sh->dev[i].page, 0, 0, STRIPE_SIZE,
2691 ASYNC_TX_DEP_ACK, tx, NULL, NULL);
2693 set_bit(R5_Expanded, &sh2->dev[dd_idx].flags);
2694 set_bit(R5_UPTODATE, &sh2->dev[dd_idx].flags);
2695 for (j = 0; j < conf->raid_disks; j++)
2696 if (j != sh2->pd_idx &&
2697 (!r6s || j != sh2->qd_idx) &&
2698 !test_bit(R5_Expanded, &sh2->dev[j].flags))
2700 if (j == conf->raid_disks) {
2701 set_bit(STRIPE_EXPAND_READY, &sh2->state);
2702 set_bit(STRIPE_HANDLE, &sh2->state);
2704 release_stripe(sh2);
2707 /* done submitting copies, wait for them to complete */
2710 dma_wait_for_async_tx(tx);
2716 * handle_stripe - do things to a stripe.
2718 * We lock the stripe and then examine the state of various bits
2719 * to see what needs to be done.
2721 * return some read request which now have data
2722 * return some write requests which are safely on disc
2723 * schedule a read on some buffers
2724 * schedule a write of some buffers
2725 * return confirmation of parity correctness
2727 * buffers are taken off read_list or write_list, and bh_cache buffers
2728 * get BH_Lock set before the stripe lock is released.
2732 static bool handle_stripe5(struct stripe_head *sh)
2734 raid5_conf_t *conf = sh->raid_conf;
2735 int disks = sh->disks, i;
2736 struct bio *return_bi = NULL;
2737 struct stripe_head_state s;
2739 mdk_rdev_t *blocked_rdev = NULL;
2742 memset(&s, 0, sizeof(s));
2743 pr_debug("handling stripe %llu, state=%#lx cnt=%d, pd_idx=%d check:%d "
2744 "reconstruct:%d\n", (unsigned long long)sh->sector, sh->state,
2745 atomic_read(&sh->count), sh->pd_idx, sh->check_state,
2746 sh->reconstruct_state);
2748 spin_lock(&sh->lock);
2749 clear_bit(STRIPE_HANDLE, &sh->state);
2750 clear_bit(STRIPE_DELAYED, &sh->state);
2752 s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
2753 s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
2754 s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
2756 /* Now to look around and see what can be done */
2758 for (i=disks; i--; ) {
2760 struct r5dev *dev = &sh->dev[i];
2761 clear_bit(R5_Insync, &dev->flags);
2763 pr_debug("check %d: state 0x%lx toread %p read %p write %p "
2764 "written %p\n", i, dev->flags, dev->toread, dev->read,
2765 dev->towrite, dev->written);
2767 /* maybe we can request a biofill operation
2769 * new wantfill requests are only permitted while
2770 * ops_complete_biofill is guaranteed to be inactive
2772 if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread &&
2773 !test_bit(STRIPE_BIOFILL_RUN, &sh->state))
2774 set_bit(R5_Wantfill, &dev->flags);
2776 /* now count some things */
2777 if (test_bit(R5_LOCKED, &dev->flags)) s.locked++;
2778 if (test_bit(R5_UPTODATE, &dev->flags)) s.uptodate++;
2779 if (test_bit(R5_Wantcompute, &dev->flags)) s.compute++;
2781 if (test_bit(R5_Wantfill, &dev->flags))
2783 else if (dev->toread)
2787 if (!test_bit(R5_OVERWRITE, &dev->flags))
2792 rdev = rcu_dereference(conf->disks[i].rdev);
2793 if (blocked_rdev == NULL &&
2794 rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
2795 blocked_rdev = rdev;
2796 atomic_inc(&rdev->nr_pending);
2798 if (!rdev || !test_bit(In_sync, &rdev->flags)) {
2799 /* The ReadError flag will just be confusing now */
2800 clear_bit(R5_ReadError, &dev->flags);
2801 clear_bit(R5_ReWrite, &dev->flags);
2803 if (!rdev || !test_bit(In_sync, &rdev->flags)
2804 || test_bit(R5_ReadError, &dev->flags)) {
2808 set_bit(R5_Insync, &dev->flags);
2812 if (unlikely(blocked_rdev)) {
2813 if (s.syncing || s.expanding || s.expanded ||
2814 s.to_write || s.written) {
2815 set_bit(STRIPE_HANDLE, &sh->state);
2818 /* There is nothing for the blocked_rdev to block */
2819 rdev_dec_pending(blocked_rdev, conf->mddev);
2820 blocked_rdev = NULL;
2823 if (s.to_fill && !test_bit(STRIPE_BIOFILL_RUN, &sh->state)) {
2824 set_bit(STRIPE_OP_BIOFILL, &s.ops_request);
2825 set_bit(STRIPE_BIOFILL_RUN, &sh->state);
2828 pr_debug("locked=%d uptodate=%d to_read=%d"
2829 " to_write=%d failed=%d failed_num=%d\n",
2830 s.locked, s.uptodate, s.to_read, s.to_write,
2831 s.failed, s.failed_num);
2832 /* check if the array has lost two devices and, if so, some requests might
2835 if (s.failed > 1 && s.to_read+s.to_write+s.written)
2836 handle_failed_stripe(conf, sh, &s, disks, &return_bi);
2837 if (s.failed > 1 && s.syncing) {
2838 md_done_sync(conf->mddev, STRIPE_SECTORS,0);
2839 clear_bit(STRIPE_SYNCING, &sh->state);
2843 /* might be able to return some write requests if the parity block
2844 * is safe, or on a failed drive
2846 dev = &sh->dev[sh->pd_idx];
2848 ((test_bit(R5_Insync, &dev->flags) &&
2849 !test_bit(R5_LOCKED, &dev->flags) &&
2850 test_bit(R5_UPTODATE, &dev->flags)) ||
2851 (s.failed == 1 && s.failed_num == sh->pd_idx)))
2852 handle_stripe_clean_event(conf, sh, disks, &return_bi);
2854 /* Now we might consider reading some blocks, either to check/generate
2855 * parity, or to satisfy requests
2856 * or to load a block that is being partially written.
2858 if (s.to_read || s.non_overwrite ||
2859 (s.syncing && (s.uptodate + s.compute < disks)) || s.expanding)
2860 handle_stripe_fill5(sh, &s, disks);
2862 /* Now we check to see if any write operations have recently
2866 if (sh->reconstruct_state == reconstruct_state_prexor_drain_result)
2868 if (sh->reconstruct_state == reconstruct_state_drain_result ||
2869 sh->reconstruct_state == reconstruct_state_prexor_drain_result) {
2870 sh->reconstruct_state = reconstruct_state_idle;
2872 /* All the 'written' buffers and the parity block are ready to
2873 * be written back to disk
2875 BUG_ON(!test_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags));
2876 for (i = disks; i--; ) {
2878 if (test_bit(R5_LOCKED, &dev->flags) &&
2879 (i == sh->pd_idx || dev->written)) {
2880 pr_debug("Writing block %d\n", i);
2881 set_bit(R5_Wantwrite, &dev->flags);
2884 if (!test_bit(R5_Insync, &dev->flags) ||
2885 (i == sh->pd_idx && s.failed == 0))
2886 set_bit(STRIPE_INSYNC, &sh->state);
2889 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2890 atomic_dec(&conf->preread_active_stripes);
2891 if (atomic_read(&conf->preread_active_stripes) <
2893 md_wakeup_thread(conf->mddev->thread);
2897 /* Now to consider new write requests and what else, if anything
2898 * should be read. We do not handle new writes when:
2899 * 1/ A 'write' operation (copy+xor) is already in flight.
2900 * 2/ A 'check' operation is in flight, as it may clobber the parity
2903 if (s.to_write && !sh->reconstruct_state && !sh->check_state)
2904 handle_stripe_dirtying5(conf, sh, &s, disks);
2906 /* maybe we need to check and possibly fix the parity for this stripe
2907 * Any reads will already have been scheduled, so we just see if enough
2908 * data is available. The parity check is held off while parity
2909 * dependent operations are in flight.
2911 if (sh->check_state ||
2912 (s.syncing && s.locked == 0 &&
2913 !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
2914 !test_bit(STRIPE_INSYNC, &sh->state)))
2915 handle_parity_checks5(conf, sh, &s, disks);
2917 if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
2918 md_done_sync(conf->mddev, STRIPE_SECTORS,1);
2919 clear_bit(STRIPE_SYNCING, &sh->state);
2922 /* If the failed drive is just a ReadError, then we might need to progress
2923 * the repair/check process
2925 if (s.failed == 1 && !conf->mddev->ro &&
2926 test_bit(R5_ReadError, &sh->dev[s.failed_num].flags)
2927 && !test_bit(R5_LOCKED, &sh->dev[s.failed_num].flags)
2928 && test_bit(R5_UPTODATE, &sh->dev[s.failed_num].flags)
2930 dev = &sh->dev[s.failed_num];
2931 if (!test_bit(R5_ReWrite, &dev->flags)) {
2932 set_bit(R5_Wantwrite, &dev->flags);
2933 set_bit(R5_ReWrite, &dev->flags);
2934 set_bit(R5_LOCKED, &dev->flags);
2937 /* let's read it back */
2938 set_bit(R5_Wantread, &dev->flags);
2939 set_bit(R5_LOCKED, &dev->flags);
2944 /* Finish reconstruct operations initiated by the expansion process */
2945 if (sh->reconstruct_state == reconstruct_state_result) {
2946 struct stripe_head *sh2
2947 = get_active_stripe(conf, sh->sector, 1, 1);
2948 if (sh2 && test_bit(STRIPE_EXPAND_SOURCE, &sh2->state)) {
2949 /* sh cannot be written until sh2 has been read.
2950 * so arrange for sh to be delayed a little
2952 set_bit(STRIPE_DELAYED, &sh->state);
2953 set_bit(STRIPE_HANDLE, &sh->state);
2954 if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE,
2956 atomic_inc(&conf->preread_active_stripes);
2957 release_stripe(sh2);
2961 release_stripe(sh2);
2963 sh->reconstruct_state = reconstruct_state_idle;
2964 clear_bit(STRIPE_EXPANDING, &sh->state);
2965 for (i = conf->raid_disks; i--; ) {
2966 set_bit(R5_Wantwrite, &sh->dev[i].flags);
2967 set_bit(R5_LOCKED, &sh->dev[i].flags);
2972 if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state) &&
2973 !sh->reconstruct_state) {
2974 /* Need to write out all blocks after computing parity */
2975 sh->disks = conf->raid_disks;
2976 stripe_set_idx(sh->sector, conf, 0, sh);
2977 schedule_reconstruction5(sh, &s, 1, 1);
2978 } else if (s.expanded && !sh->reconstruct_state && s.locked == 0) {
2979 clear_bit(STRIPE_EXPAND_READY, &sh->state);
2980 atomic_dec(&conf->reshape_stripes);
2981 wake_up(&conf->wait_for_overlap);
2982 md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
2985 if (s.expanding && s.locked == 0 &&
2986 !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
2987 handle_stripe_expansion(conf, sh, NULL);
2990 spin_unlock(&sh->lock);
2992 /* wait for this device to become unblocked */
2993 if (unlikely(blocked_rdev))
2994 md_wait_for_blocked_rdev(blocked_rdev, conf->mddev);
2997 raid5_run_ops(sh, s.ops_request);
3001 return_io(return_bi);
3003 return blocked_rdev == NULL;
3006 static bool handle_stripe6(struct stripe_head *sh, struct page *tmp_page)
3008 raid5_conf_t *conf = sh->raid_conf;
3009 int disks = sh->disks;
3010 struct bio *return_bi = NULL;
3011 int i, pd_idx = sh->pd_idx, qd_idx = sh->qd_idx;
3012 struct stripe_head_state s;
3013 struct r6_state r6s;
3014 struct r5dev *dev, *pdev, *qdev;
3015 mdk_rdev_t *blocked_rdev = NULL;
3017 pr_debug("handling stripe %llu, state=%#lx cnt=%d, "
3018 "pd_idx=%d, qd_idx=%d\n",
3019 (unsigned long long)sh->sector, sh->state,
3020 atomic_read(&sh->count), pd_idx, qd_idx);
3021 memset(&s, 0, sizeof(s));
3023 spin_lock(&sh->lock);
3024 clear_bit(STRIPE_HANDLE, &sh->state);
3025 clear_bit(STRIPE_DELAYED, &sh->state);
3027 s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
3028 s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
3029 s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
3030 /* Now to look around and see what can be done */
3033 for (i=disks; i--; ) {
3036 clear_bit(R5_Insync, &dev->flags);
3038 pr_debug("check %d: state 0x%lx read %p write %p written %p\n",
3039 i, dev->flags, dev->toread, dev->towrite, dev->written);
3040 /* maybe we can reply to a read */
3041 if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread) {
3042 struct bio *rbi, *rbi2;
3043 pr_debug("Return read for disc %d\n", i);
3044 spin_lock_irq(&conf->device_lock);
3047 if (test_and_clear_bit(R5_Overlap, &dev->flags))
3048 wake_up(&conf->wait_for_overlap);
3049 spin_unlock_irq(&conf->device_lock);
3050 while (rbi && rbi->bi_sector < dev->sector + STRIPE_SECTORS) {
3051 copy_data(0, rbi, dev->page, dev->sector);
3052 rbi2 = r5_next_bio(rbi, dev->sector);
3053 spin_lock_irq(&conf->device_lock);
3054 if (!raid5_dec_bi_phys_segments(rbi)) {
3055 rbi->bi_next = return_bi;
3058 spin_unlock_irq(&conf->device_lo