md/raid5: be more selective about distributing flags across batch.
[deliverable/linux.git] / drivers / md / raid5.c
1 /*
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
6 *
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!
10 *
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)
14 * any later version.
15 *
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.
19 */
20
21 /*
22 * BITMAP UNPLUGGING:
23 *
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
26 * explanation.
27 *
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->seq_write is the number of the last batch successfully written.
31 * conf->seq_flush is the number of the last batch that was closed to
32 * new additions.
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 seq_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
39 * batch.
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
43 * miss any bits.
44 */
45
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/module.h>
51 #include <linux/async.h>
52 #include <linux/seq_file.h>
53 #include <linux/cpu.h>
54 #include <linux/slab.h>
55 #include <linux/ratelimit.h>
56 #include <linux/nodemask.h>
57 #include <linux/flex_array.h>
58 #include <trace/events/block.h>
59
60 #include "md.h"
61 #include "raid5.h"
62 #include "raid0.h"
63 #include "bitmap.h"
64
65 #define cpu_to_group(cpu) cpu_to_node(cpu)
66 #define ANY_GROUP NUMA_NO_NODE
67
68 static bool devices_handle_discard_safely = false;
69 module_param(devices_handle_discard_safely, bool, 0644);
70 MODULE_PARM_DESC(devices_handle_discard_safely,
71 "Set to Y if all devices in each array reliably return zeroes on reads from discarded regions");
72 static struct workqueue_struct *raid5_wq;
73 /*
74 * Stripe cache
75 */
76
77 #define NR_STRIPES 256
78 #define STRIPE_SIZE PAGE_SIZE
79 #define STRIPE_SHIFT (PAGE_SHIFT - 9)
80 #define STRIPE_SECTORS (STRIPE_SIZE>>9)
81 #define IO_THRESHOLD 1
82 #define BYPASS_THRESHOLD 1
83 #define NR_HASH (PAGE_SIZE / sizeof(struct hlist_head))
84 #define HASH_MASK (NR_HASH - 1)
85 #define MAX_STRIPE_BATCH 8
86
87 static inline struct hlist_head *stripe_hash(struct r5conf *conf, sector_t sect)
88 {
89 int hash = (sect >> STRIPE_SHIFT) & HASH_MASK;
90 return &conf->stripe_hashtbl[hash];
91 }
92
93 static inline int stripe_hash_locks_hash(sector_t sect)
94 {
95 return (sect >> STRIPE_SHIFT) & STRIPE_HASH_LOCKS_MASK;
96 }
97
98 static inline void lock_device_hash_lock(struct r5conf *conf, int hash)
99 {
100 spin_lock_irq(conf->hash_locks + hash);
101 spin_lock(&conf->device_lock);
102 }
103
104 static inline void unlock_device_hash_lock(struct r5conf *conf, int hash)
105 {
106 spin_unlock(&conf->device_lock);
107 spin_unlock_irq(conf->hash_locks + hash);
108 }
109
110 static inline void lock_all_device_hash_locks_irq(struct r5conf *conf)
111 {
112 int i;
113 local_irq_disable();
114 spin_lock(conf->hash_locks);
115 for (i = 1; i < NR_STRIPE_HASH_LOCKS; i++)
116 spin_lock_nest_lock(conf->hash_locks + i, conf->hash_locks);
117 spin_lock(&conf->device_lock);
118 }
119
120 static inline void unlock_all_device_hash_locks_irq(struct r5conf *conf)
121 {
122 int i;
123 spin_unlock(&conf->device_lock);
124 for (i = NR_STRIPE_HASH_LOCKS; i; i--)
125 spin_unlock(conf->hash_locks + i - 1);
126 local_irq_enable();
127 }
128
129 /* bio's attached to a stripe+device for I/O are linked together in bi_sector
130 * order without overlap. There may be several bio's per stripe+device, and
131 * a bio could span several devices.
132 * When walking this list for a particular stripe+device, we must never proceed
133 * beyond a bio that extends past this device, as the next bio might no longer
134 * be valid.
135 * This function is used to determine the 'next' bio in the list, given the sector
136 * of the current stripe+device
137 */
138 static inline struct bio *r5_next_bio(struct bio *bio, sector_t sector)
139 {
140 int sectors = bio_sectors(bio);
141 if (bio->bi_iter.bi_sector + sectors < sector + STRIPE_SECTORS)
142 return bio->bi_next;
143 else
144 return NULL;
145 }
146
147 /*
148 * We maintain a biased count of active stripes in the bottom 16 bits of
149 * bi_phys_segments, and a count of processed stripes in the upper 16 bits
150 */
151 static inline int raid5_bi_processed_stripes(struct bio *bio)
152 {
153 atomic_t *segments = (atomic_t *)&bio->bi_phys_segments;
154 return (atomic_read(segments) >> 16) & 0xffff;
155 }
156
157 static inline int raid5_dec_bi_active_stripes(struct bio *bio)
158 {
159 atomic_t *segments = (atomic_t *)&bio->bi_phys_segments;
160 return atomic_sub_return(1, segments) & 0xffff;
161 }
162
163 static inline void raid5_inc_bi_active_stripes(struct bio *bio)
164 {
165 atomic_t *segments = (atomic_t *)&bio->bi_phys_segments;
166 atomic_inc(segments);
167 }
168
169 static inline void raid5_set_bi_processed_stripes(struct bio *bio,
170 unsigned int cnt)
171 {
172 atomic_t *segments = (atomic_t *)&bio->bi_phys_segments;
173 int old, new;
174
175 do {
176 old = atomic_read(segments);
177 new = (old & 0xffff) | (cnt << 16);
178 } while (atomic_cmpxchg(segments, old, new) != old);
179 }
180
181 static inline void raid5_set_bi_stripes(struct bio *bio, unsigned int cnt)
182 {
183 atomic_t *segments = (atomic_t *)&bio->bi_phys_segments;
184 atomic_set(segments, cnt);
185 }
186
187 /* Find first data disk in a raid6 stripe */
188 static inline int raid6_d0(struct stripe_head *sh)
189 {
190 if (sh->ddf_layout)
191 /* ddf always start from first device */
192 return 0;
193 /* md starts just after Q block */
194 if (sh->qd_idx == sh->disks - 1)
195 return 0;
196 else
197 return sh->qd_idx + 1;
198 }
199 static inline int raid6_next_disk(int disk, int raid_disks)
200 {
201 disk++;
202 return (disk < raid_disks) ? disk : 0;
203 }
204
205 /* When walking through the disks in a raid5, starting at raid6_d0,
206 * We need to map each disk to a 'slot', where the data disks are slot
207 * 0 .. raid_disks-3, the parity disk is raid_disks-2 and the Q disk
208 * is raid_disks-1. This help does that mapping.
209 */
210 static int raid6_idx_to_slot(int idx, struct stripe_head *sh,
211 int *count, int syndrome_disks)
212 {
213 int slot = *count;
214
215 if (sh->ddf_layout)
216 (*count)++;
217 if (idx == sh->pd_idx)
218 return syndrome_disks;
219 if (idx == sh->qd_idx)
220 return syndrome_disks + 1;
221 if (!sh->ddf_layout)
222 (*count)++;
223 return slot;
224 }
225
226 static void return_io(struct bio *return_bi)
227 {
228 struct bio *bi = return_bi;
229 while (bi) {
230
231 return_bi = bi->bi_next;
232 bi->bi_next = NULL;
233 bi->bi_iter.bi_size = 0;
234 trace_block_bio_complete(bdev_get_queue(bi->bi_bdev),
235 bi, 0);
236 bio_endio(bi, 0);
237 bi = return_bi;
238 }
239 }
240
241 static void print_raid5_conf (struct r5conf *conf);
242
243 static int stripe_operations_active(struct stripe_head *sh)
244 {
245 return sh->check_state || sh->reconstruct_state ||
246 test_bit(STRIPE_BIOFILL_RUN, &sh->state) ||
247 test_bit(STRIPE_COMPUTE_RUN, &sh->state);
248 }
249
250 static void raid5_wakeup_stripe_thread(struct stripe_head *sh)
251 {
252 struct r5conf *conf = sh->raid_conf;
253 struct r5worker_group *group;
254 int thread_cnt;
255 int i, cpu = sh->cpu;
256
257 if (!cpu_online(cpu)) {
258 cpu = cpumask_any(cpu_online_mask);
259 sh->cpu = cpu;
260 }
261
262 if (list_empty(&sh->lru)) {
263 struct r5worker_group *group;
264 group = conf->worker_groups + cpu_to_group(cpu);
265 list_add_tail(&sh->lru, &group->handle_list);
266 group->stripes_cnt++;
267 sh->group = group;
268 }
269
270 if (conf->worker_cnt_per_group == 0) {
271 md_wakeup_thread(conf->mddev->thread);
272 return;
273 }
274
275 group = conf->worker_groups + cpu_to_group(sh->cpu);
276
277 group->workers[0].working = true;
278 /* at least one worker should run to avoid race */
279 queue_work_on(sh->cpu, raid5_wq, &group->workers[0].work);
280
281 thread_cnt = group->stripes_cnt / MAX_STRIPE_BATCH - 1;
282 /* wakeup more workers */
283 for (i = 1; i < conf->worker_cnt_per_group && thread_cnt > 0; i++) {
284 if (group->workers[i].working == false) {
285 group->workers[i].working = true;
286 queue_work_on(sh->cpu, raid5_wq,
287 &group->workers[i].work);
288 thread_cnt--;
289 }
290 }
291 }
292
293 static void do_release_stripe(struct r5conf *conf, struct stripe_head *sh,
294 struct list_head *temp_inactive_list)
295 {
296 BUG_ON(!list_empty(&sh->lru));
297 BUG_ON(atomic_read(&conf->active_stripes)==0);
298 if (test_bit(STRIPE_HANDLE, &sh->state)) {
299 if (test_bit(STRIPE_DELAYED, &sh->state) &&
300 !test_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
301 list_add_tail(&sh->lru, &conf->delayed_list);
302 else if (test_bit(STRIPE_BIT_DELAY, &sh->state) &&
303 sh->bm_seq - conf->seq_write > 0)
304 list_add_tail(&sh->lru, &conf->bitmap_list);
305 else {
306 clear_bit(STRIPE_DELAYED, &sh->state);
307 clear_bit(STRIPE_BIT_DELAY, &sh->state);
308 if (conf->worker_cnt_per_group == 0) {
309 list_add_tail(&sh->lru, &conf->handle_list);
310 } else {
311 raid5_wakeup_stripe_thread(sh);
312 return;
313 }
314 }
315 md_wakeup_thread(conf->mddev->thread);
316 } else {
317 BUG_ON(stripe_operations_active(sh));
318 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
319 if (atomic_dec_return(&conf->preread_active_stripes)
320 < IO_THRESHOLD)
321 md_wakeup_thread(conf->mddev->thread);
322 atomic_dec(&conf->active_stripes);
323 if (!test_bit(STRIPE_EXPANDING, &sh->state))
324 list_add_tail(&sh->lru, temp_inactive_list);
325 }
326 }
327
328 static void __release_stripe(struct r5conf *conf, struct stripe_head *sh,
329 struct list_head *temp_inactive_list)
330 {
331 if (atomic_dec_and_test(&sh->count))
332 do_release_stripe(conf, sh, temp_inactive_list);
333 }
334
335 /*
336 * @hash could be NR_STRIPE_HASH_LOCKS, then we have a list of inactive_list
337 *
338 * Be careful: Only one task can add/delete stripes from temp_inactive_list at
339 * given time. Adding stripes only takes device lock, while deleting stripes
340 * only takes hash lock.
341 */
342 static void release_inactive_stripe_list(struct r5conf *conf,
343 struct list_head *temp_inactive_list,
344 int hash)
345 {
346 int size;
347 bool do_wakeup = false;
348 unsigned long flags;
349
350 if (hash == NR_STRIPE_HASH_LOCKS) {
351 size = NR_STRIPE_HASH_LOCKS;
352 hash = NR_STRIPE_HASH_LOCKS - 1;
353 } else
354 size = 1;
355 while (size) {
356 struct list_head *list = &temp_inactive_list[size - 1];
357
358 /*
359 * We don't hold any lock here yet, get_active_stripe() might
360 * remove stripes from the list
361 */
362 if (!list_empty_careful(list)) {
363 spin_lock_irqsave(conf->hash_locks + hash, flags);
364 if (list_empty(conf->inactive_list + hash) &&
365 !list_empty(list))
366 atomic_dec(&conf->empty_inactive_list_nr);
367 list_splice_tail_init(list, conf->inactive_list + hash);
368 do_wakeup = true;
369 spin_unlock_irqrestore(conf->hash_locks + hash, flags);
370 }
371 size--;
372 hash--;
373 }
374
375 if (do_wakeup) {
376 wake_up(&conf->wait_for_stripe);
377 if (conf->retry_read_aligned)
378 md_wakeup_thread(conf->mddev->thread);
379 }
380 }
381
382 /* should hold conf->device_lock already */
383 static int release_stripe_list(struct r5conf *conf,
384 struct list_head *temp_inactive_list)
385 {
386 struct stripe_head *sh;
387 int count = 0;
388 struct llist_node *head;
389
390 head = llist_del_all(&conf->released_stripes);
391 head = llist_reverse_order(head);
392 while (head) {
393 int hash;
394
395 sh = llist_entry(head, struct stripe_head, release_list);
396 head = llist_next(head);
397 /* sh could be readded after STRIPE_ON_RELEASE_LIST is cleard */
398 smp_mb();
399 clear_bit(STRIPE_ON_RELEASE_LIST, &sh->state);
400 /*
401 * Don't worry the bit is set here, because if the bit is set
402 * again, the count is always > 1. This is true for
403 * STRIPE_ON_UNPLUG_LIST bit too.
404 */
405 hash = sh->hash_lock_index;
406 __release_stripe(conf, sh, &temp_inactive_list[hash]);
407 count++;
408 }
409
410 return count;
411 }
412
413 static void release_stripe(struct stripe_head *sh)
414 {
415 struct r5conf *conf = sh->raid_conf;
416 unsigned long flags;
417 struct list_head list;
418 int hash;
419 bool wakeup;
420
421 /* Avoid release_list until the last reference.
422 */
423 if (atomic_add_unless(&sh->count, -1, 1))
424 return;
425
426 if (unlikely(!conf->mddev->thread) ||
427 test_and_set_bit(STRIPE_ON_RELEASE_LIST, &sh->state))
428 goto slow_path;
429 wakeup = llist_add(&sh->release_list, &conf->released_stripes);
430 if (wakeup)
431 md_wakeup_thread(conf->mddev->thread);
432 return;
433 slow_path:
434 local_irq_save(flags);
435 /* we are ok here if STRIPE_ON_RELEASE_LIST is set or not */
436 if (atomic_dec_and_lock(&sh->count, &conf->device_lock)) {
437 INIT_LIST_HEAD(&list);
438 hash = sh->hash_lock_index;
439 do_release_stripe(conf, sh, &list);
440 spin_unlock(&conf->device_lock);
441 release_inactive_stripe_list(conf, &list, hash);
442 }
443 local_irq_restore(flags);
444 }
445
446 static inline void remove_hash(struct stripe_head *sh)
447 {
448 pr_debug("remove_hash(), stripe %llu\n",
449 (unsigned long long)sh->sector);
450
451 hlist_del_init(&sh->hash);
452 }
453
454 static inline void insert_hash(struct r5conf *conf, struct stripe_head *sh)
455 {
456 struct hlist_head *hp = stripe_hash(conf, sh->sector);
457
458 pr_debug("insert_hash(), stripe %llu\n",
459 (unsigned long long)sh->sector);
460
461 hlist_add_head(&sh->hash, hp);
462 }
463
464 /* find an idle stripe, make sure it is unhashed, and return it. */
465 static struct stripe_head *get_free_stripe(struct r5conf *conf, int hash)
466 {
467 struct stripe_head *sh = NULL;
468 struct list_head *first;
469
470 if (list_empty(conf->inactive_list + hash))
471 goto out;
472 first = (conf->inactive_list + hash)->next;
473 sh = list_entry(first, struct stripe_head, lru);
474 list_del_init(first);
475 remove_hash(sh);
476 atomic_inc(&conf->active_stripes);
477 BUG_ON(hash != sh->hash_lock_index);
478 if (list_empty(conf->inactive_list + hash))
479 atomic_inc(&conf->empty_inactive_list_nr);
480 out:
481 return sh;
482 }
483
484 static void shrink_buffers(struct stripe_head *sh)
485 {
486 struct page *p;
487 int i;
488 int num = sh->raid_conf->pool_size;
489
490 for (i = 0; i < num ; i++) {
491 WARN_ON(sh->dev[i].page != sh->dev[i].orig_page);
492 p = sh->dev[i].page;
493 if (!p)
494 continue;
495 sh->dev[i].page = NULL;
496 put_page(p);
497 }
498 }
499
500 static int grow_buffers(struct stripe_head *sh, gfp_t gfp)
501 {
502 int i;
503 int num = sh->raid_conf->pool_size;
504
505 for (i = 0; i < num; i++) {
506 struct page *page;
507
508 if (!(page = alloc_page(gfp))) {
509 return 1;
510 }
511 sh->dev[i].page = page;
512 sh->dev[i].orig_page = page;
513 }
514 return 0;
515 }
516
517 static void raid5_build_block(struct stripe_head *sh, int i, int previous);
518 static void stripe_set_idx(sector_t stripe, struct r5conf *conf, int previous,
519 struct stripe_head *sh);
520
521 static void init_stripe(struct stripe_head *sh, sector_t sector, int previous)
522 {
523 struct r5conf *conf = sh->raid_conf;
524 int i, seq;
525
526 BUG_ON(atomic_read(&sh->count) != 0);
527 BUG_ON(test_bit(STRIPE_HANDLE, &sh->state));
528 BUG_ON(stripe_operations_active(sh));
529 BUG_ON(sh->batch_head);
530
531 pr_debug("init_stripe called, stripe %llu\n",
532 (unsigned long long)sector);
533 retry:
534 seq = read_seqcount_begin(&conf->gen_lock);
535 sh->generation = conf->generation - previous;
536 sh->disks = previous ? conf->previous_raid_disks : conf->raid_disks;
537 sh->sector = sector;
538 stripe_set_idx(sector, conf, previous, sh);
539 sh->state = 0;
540
541 for (i = sh->disks; i--; ) {
542 struct r5dev *dev = &sh->dev[i];
543
544 if (dev->toread || dev->read || dev->towrite || dev->written ||
545 test_bit(R5_LOCKED, &dev->flags)) {
546 printk(KERN_ERR "sector=%llx i=%d %p %p %p %p %d\n",
547 (unsigned long long)sh->sector, i, dev->toread,
548 dev->read, dev->towrite, dev->written,
549 test_bit(R5_LOCKED, &dev->flags));
550 WARN_ON(1);
551 }
552 dev->flags = 0;
553 raid5_build_block(sh, i, previous);
554 }
555 if (read_seqcount_retry(&conf->gen_lock, seq))
556 goto retry;
557 sh->overwrite_disks = 0;
558 insert_hash(conf, sh);
559 sh->cpu = smp_processor_id();
560 set_bit(STRIPE_BATCH_READY, &sh->state);
561 }
562
563 static struct stripe_head *__find_stripe(struct r5conf *conf, sector_t sector,
564 short generation)
565 {
566 struct stripe_head *sh;
567
568 pr_debug("__find_stripe, sector %llu\n", (unsigned long long)sector);
569 hlist_for_each_entry(sh, stripe_hash(conf, sector), hash)
570 if (sh->sector == sector && sh->generation == generation)
571 return sh;
572 pr_debug("__stripe %llu not in cache\n", (unsigned long long)sector);
573 return NULL;
574 }
575
576 /*
577 * Need to check if array has failed when deciding whether to:
578 * - start an array
579 * - remove non-faulty devices
580 * - add a spare
581 * - allow a reshape
582 * This determination is simple when no reshape is happening.
583 * However if there is a reshape, we need to carefully check
584 * both the before and after sections.
585 * This is because some failed devices may only affect one
586 * of the two sections, and some non-in_sync devices may
587 * be insync in the section most affected by failed devices.
588 */
589 static int calc_degraded(struct r5conf *conf)
590 {
591 int degraded, degraded2;
592 int i;
593
594 rcu_read_lock();
595 degraded = 0;
596 for (i = 0; i < conf->previous_raid_disks; i++) {
597 struct md_rdev *rdev = rcu_dereference(conf->disks[i].rdev);
598 if (rdev && test_bit(Faulty, &rdev->flags))
599 rdev = rcu_dereference(conf->disks[i].replacement);
600 if (!rdev || test_bit(Faulty, &rdev->flags))
601 degraded++;
602 else if (test_bit(In_sync, &rdev->flags))
603 ;
604 else
605 /* not in-sync or faulty.
606 * If the reshape increases the number of devices,
607 * this is being recovered by the reshape, so
608 * this 'previous' section is not in_sync.
609 * If the number of devices is being reduced however,
610 * the device can only be part of the array if
611 * we are reverting a reshape, so this section will
612 * be in-sync.
613 */
614 if (conf->raid_disks >= conf->previous_raid_disks)
615 degraded++;
616 }
617 rcu_read_unlock();
618 if (conf->raid_disks == conf->previous_raid_disks)
619 return degraded;
620 rcu_read_lock();
621 degraded2 = 0;
622 for (i = 0; i < conf->raid_disks; i++) {
623 struct md_rdev *rdev = rcu_dereference(conf->disks[i].rdev);
624 if (rdev && test_bit(Faulty, &rdev->flags))
625 rdev = rcu_dereference(conf->disks[i].replacement);
626 if (!rdev || test_bit(Faulty, &rdev->flags))
627 degraded2++;
628 else if (test_bit(In_sync, &rdev->flags))
629 ;
630 else
631 /* not in-sync or faulty.
632 * If reshape increases the number of devices, this
633 * section has already been recovered, else it
634 * almost certainly hasn't.
635 */
636 if (conf->raid_disks <= conf->previous_raid_disks)
637 degraded2++;
638 }
639 rcu_read_unlock();
640 if (degraded2 > degraded)
641 return degraded2;
642 return degraded;
643 }
644
645 static int has_failed(struct r5conf *conf)
646 {
647 int degraded;
648
649 if (conf->mddev->reshape_position == MaxSector)
650 return conf->mddev->degraded > conf->max_degraded;
651
652 degraded = calc_degraded(conf);
653 if (degraded > conf->max_degraded)
654 return 1;
655 return 0;
656 }
657
658 static struct stripe_head *
659 get_active_stripe(struct r5conf *conf, sector_t sector,
660 int previous, int noblock, int noquiesce)
661 {
662 struct stripe_head *sh;
663 int hash = stripe_hash_locks_hash(sector);
664
665 pr_debug("get_stripe, sector %llu\n", (unsigned long long)sector);
666
667 spin_lock_irq(conf->hash_locks + hash);
668
669 do {
670 wait_event_lock_irq(conf->wait_for_stripe,
671 conf->quiesce == 0 || noquiesce,
672 *(conf->hash_locks + hash));
673 sh = __find_stripe(conf, sector, conf->generation - previous);
674 if (!sh) {
675 if (!test_bit(R5_INACTIVE_BLOCKED, &conf->cache_state)) {
676 sh = get_free_stripe(conf, hash);
677 if (!sh && llist_empty(&conf->released_stripes) &&
678 !test_bit(R5_DID_ALLOC, &conf->cache_state))
679 set_bit(R5_ALLOC_MORE,
680 &conf->cache_state);
681 }
682 if (noblock && sh == NULL)
683 break;
684 if (!sh) {
685 set_bit(R5_INACTIVE_BLOCKED,
686 &conf->cache_state);
687 wait_event_lock_irq(
688 conf->wait_for_stripe,
689 !list_empty(conf->inactive_list + hash) &&
690 (atomic_read(&conf->active_stripes)
691 < (conf->max_nr_stripes * 3 / 4)
692 || !test_bit(R5_INACTIVE_BLOCKED,
693 &conf->cache_state)),
694 *(conf->hash_locks + hash));
695 clear_bit(R5_INACTIVE_BLOCKED,
696 &conf->cache_state);
697 } else {
698 init_stripe(sh, sector, previous);
699 atomic_inc(&sh->count);
700 }
701 } else if (!atomic_inc_not_zero(&sh->count)) {
702 spin_lock(&conf->device_lock);
703 if (!atomic_read(&sh->count)) {
704 if (!test_bit(STRIPE_HANDLE, &sh->state))
705 atomic_inc(&conf->active_stripes);
706 BUG_ON(list_empty(&sh->lru) &&
707 !test_bit(STRIPE_EXPANDING, &sh->state));
708 list_del_init(&sh->lru);
709 if (sh->group) {
710 sh->group->stripes_cnt--;
711 sh->group = NULL;
712 }
713 }
714 atomic_inc(&sh->count);
715 spin_unlock(&conf->device_lock);
716 }
717 } while (sh == NULL);
718
719 spin_unlock_irq(conf->hash_locks + hash);
720 return sh;
721 }
722
723 static bool is_full_stripe_write(struct stripe_head *sh)
724 {
725 BUG_ON(sh->overwrite_disks > (sh->disks - sh->raid_conf->max_degraded));
726 return sh->overwrite_disks == (sh->disks - sh->raid_conf->max_degraded);
727 }
728
729 static void lock_two_stripes(struct stripe_head *sh1, struct stripe_head *sh2)
730 {
731 local_irq_disable();
732 if (sh1 > sh2) {
733 spin_lock(&sh2->stripe_lock);
734 spin_lock_nested(&sh1->stripe_lock, 1);
735 } else {
736 spin_lock(&sh1->stripe_lock);
737 spin_lock_nested(&sh2->stripe_lock, 1);
738 }
739 }
740
741 static void unlock_two_stripes(struct stripe_head *sh1, struct stripe_head *sh2)
742 {
743 spin_unlock(&sh1->stripe_lock);
744 spin_unlock(&sh2->stripe_lock);
745 local_irq_enable();
746 }
747
748 /* Only freshly new full stripe normal write stripe can be added to a batch list */
749 static bool stripe_can_batch(struct stripe_head *sh)
750 {
751 return test_bit(STRIPE_BATCH_READY, &sh->state) &&
752 !test_bit(STRIPE_BITMAP_PENDING, &sh->state) &&
753 is_full_stripe_write(sh);
754 }
755
756 /* we only do back search */
757 static void stripe_add_to_batch_list(struct r5conf *conf, struct stripe_head *sh)
758 {
759 struct stripe_head *head;
760 sector_t head_sector, tmp_sec;
761 int hash;
762 int dd_idx;
763
764 if (!stripe_can_batch(sh))
765 return;
766 /* Don't cross chunks, so stripe pd_idx/qd_idx is the same */
767 tmp_sec = sh->sector;
768 if (!sector_div(tmp_sec, conf->chunk_sectors))
769 return;
770 head_sector = sh->sector - STRIPE_SECTORS;
771
772 hash = stripe_hash_locks_hash(head_sector);
773 spin_lock_irq(conf->hash_locks + hash);
774 head = __find_stripe(conf, head_sector, conf->generation);
775 if (head && !atomic_inc_not_zero(&head->count)) {
776 spin_lock(&conf->device_lock);
777 if (!atomic_read(&head->count)) {
778 if (!test_bit(STRIPE_HANDLE, &head->state))
779 atomic_inc(&conf->active_stripes);
780 BUG_ON(list_empty(&head->lru) &&
781 !test_bit(STRIPE_EXPANDING, &head->state));
782 list_del_init(&head->lru);
783 if (head->group) {
784 head->group->stripes_cnt--;
785 head->group = NULL;
786 }
787 }
788 atomic_inc(&head->count);
789 spin_unlock(&conf->device_lock);
790 }
791 spin_unlock_irq(conf->hash_locks + hash);
792
793 if (!head)
794 return;
795 if (!stripe_can_batch(head))
796 goto out;
797
798 lock_two_stripes(head, sh);
799 /* clear_batch_ready clear the flag */
800 if (!stripe_can_batch(head) || !stripe_can_batch(sh))
801 goto unlock_out;
802
803 if (sh->batch_head)
804 goto unlock_out;
805
806 dd_idx = 0;
807 while (dd_idx == sh->pd_idx || dd_idx == sh->qd_idx)
808 dd_idx++;
809 if (head->dev[dd_idx].towrite->bi_rw != sh->dev[dd_idx].towrite->bi_rw)
810 goto unlock_out;
811
812 if (head->batch_head) {
813 spin_lock(&head->batch_head->batch_lock);
814 /* This batch list is already running */
815 if (!stripe_can_batch(head)) {
816 spin_unlock(&head->batch_head->batch_lock);
817 goto unlock_out;
818 }
819
820 /*
821 * at this point, head's BATCH_READY could be cleared, but we
822 * can still add the stripe to batch list
823 */
824 list_add(&sh->batch_list, &head->batch_list);
825 spin_unlock(&head->batch_head->batch_lock);
826
827 sh->batch_head = head->batch_head;
828 } else {
829 head->batch_head = head;
830 sh->batch_head = head->batch_head;
831 spin_lock(&head->batch_lock);
832 list_add_tail(&sh->batch_list, &head->batch_list);
833 spin_unlock(&head->batch_lock);
834 }
835
836 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
837 if (atomic_dec_return(&conf->preread_active_stripes)
838 < IO_THRESHOLD)
839 md_wakeup_thread(conf->mddev->thread);
840
841 if (test_and_clear_bit(STRIPE_BIT_DELAY, &sh->state)) {
842 int seq = sh->bm_seq;
843 if (test_bit(STRIPE_BIT_DELAY, &sh->batch_head->state) &&
844 sh->batch_head->bm_seq > seq)
845 seq = sh->batch_head->bm_seq;
846 set_bit(STRIPE_BIT_DELAY, &sh->batch_head->state);
847 sh->batch_head->bm_seq = seq;
848 }
849
850 atomic_inc(&sh->count);
851 unlock_out:
852 unlock_two_stripes(head, sh);
853 out:
854 release_stripe(head);
855 }
856
857 /* Determine if 'data_offset' or 'new_data_offset' should be used
858 * in this stripe_head.
859 */
860 static int use_new_offset(struct r5conf *conf, struct stripe_head *sh)
861 {
862 sector_t progress = conf->reshape_progress;
863 /* Need a memory barrier to make sure we see the value
864 * of conf->generation, or ->data_offset that was set before
865 * reshape_progress was updated.
866 */
867 smp_rmb();
868 if (progress == MaxSector)
869 return 0;
870 if (sh->generation == conf->generation - 1)
871 return 0;
872 /* We are in a reshape, and this is a new-generation stripe,
873 * so use new_data_offset.
874 */
875 return 1;
876 }
877
878 static void
879 raid5_end_read_request(struct bio *bi, int error);
880 static void
881 raid5_end_write_request(struct bio *bi, int error);
882
883 static void ops_run_io(struct stripe_head *sh, struct stripe_head_state *s)
884 {
885 struct r5conf *conf = sh->raid_conf;
886 int i, disks = sh->disks;
887 struct stripe_head *head_sh = sh;
888
889 might_sleep();
890
891 for (i = disks; i--; ) {
892 int rw;
893 int replace_only = 0;
894 struct bio *bi, *rbi;
895 struct md_rdev *rdev, *rrdev = NULL;
896
897 sh = head_sh;
898 if (test_and_clear_bit(R5_Wantwrite, &sh->dev[i].flags)) {
899 if (test_and_clear_bit(R5_WantFUA, &sh->dev[i].flags))
900 rw = WRITE_FUA;
901 else
902 rw = WRITE;
903 if (test_bit(R5_Discard, &sh->dev[i].flags))
904 rw |= REQ_DISCARD;
905 } else if (test_and_clear_bit(R5_Wantread, &sh->dev[i].flags))
906 rw = READ;
907 else if (test_and_clear_bit(R5_WantReplace,
908 &sh->dev[i].flags)) {
909 rw = WRITE;
910 replace_only = 1;
911 } else
912 continue;
913 if (test_and_clear_bit(R5_SyncIO, &sh->dev[i].flags))
914 rw |= REQ_SYNC;
915
916 again:
917 bi = &sh->dev[i].req;
918 rbi = &sh->dev[i].rreq; /* For writing to replacement */
919
920 rcu_read_lock();
921 rrdev = rcu_dereference(conf->disks[i].replacement);
922 smp_mb(); /* Ensure that if rrdev is NULL, rdev won't be */
923 rdev = rcu_dereference(conf->disks[i].rdev);
924 if (!rdev) {
925 rdev = rrdev;
926 rrdev = NULL;
927 }
928 if (rw & WRITE) {
929 if (replace_only)
930 rdev = NULL;
931 if (rdev == rrdev)
932 /* We raced and saw duplicates */
933 rrdev = NULL;
934 } else {
935 if (test_bit(R5_ReadRepl, &head_sh->dev[i].flags) && rrdev)
936 rdev = rrdev;
937 rrdev = NULL;
938 }
939
940 if (rdev && test_bit(Faulty, &rdev->flags))
941 rdev = NULL;
942 if (rdev)
943 atomic_inc(&rdev->nr_pending);
944 if (rrdev && test_bit(Faulty, &rrdev->flags))
945 rrdev = NULL;
946 if (rrdev)
947 atomic_inc(&rrdev->nr_pending);
948 rcu_read_unlock();
949
950 /* We have already checked bad blocks for reads. Now
951 * need to check for writes. We never accept write errors
952 * on the replacement, so we don't to check rrdev.
953 */
954 while ((rw & WRITE) && rdev &&
955 test_bit(WriteErrorSeen, &rdev->flags)) {
956 sector_t first_bad;
957 int bad_sectors;
958 int bad = is_badblock(rdev, sh->sector, STRIPE_SECTORS,
959 &first_bad, &bad_sectors);
960 if (!bad)
961 break;
962
963 if (bad < 0) {
964 set_bit(BlockedBadBlocks, &rdev->flags);
965 if (!conf->mddev->external &&
966 conf->mddev->flags) {
967 /* It is very unlikely, but we might
968 * still need to write out the
969 * bad block log - better give it
970 * a chance*/
971 md_check_recovery(conf->mddev);
972 }
973 /*
974 * Because md_wait_for_blocked_rdev
975 * will dec nr_pending, we must
976 * increment it first.
977 */
978 atomic_inc(&rdev->nr_pending);
979 md_wait_for_blocked_rdev(rdev, conf->mddev);
980 } else {
981 /* Acknowledged bad block - skip the write */
982 rdev_dec_pending(rdev, conf->mddev);
983 rdev = NULL;
984 }
985 }
986
987 if (rdev) {
988 if (s->syncing || s->expanding || s->expanded
989 || s->replacing)
990 md_sync_acct(rdev->bdev, STRIPE_SECTORS);
991
992 set_bit(STRIPE_IO_STARTED, &sh->state);
993
994 bio_reset(bi);
995 bi->bi_bdev = rdev->bdev;
996 bi->bi_rw = rw;
997 bi->bi_end_io = (rw & WRITE)
998 ? raid5_end_write_request
999 : raid5_end_read_request;
1000 bi->bi_private = sh;
1001
1002 pr_debug("%s: for %llu schedule op %ld on disc %d\n",
1003 __func__, (unsigned long long)sh->sector,
1004 bi->bi_rw, i);
1005 atomic_inc(&sh->count);
1006 if (sh != head_sh)
1007 atomic_inc(&head_sh->count);
1008 if (use_new_offset(conf, sh))
1009 bi->bi_iter.bi_sector = (sh->sector
1010 + rdev->new_data_offset);
1011 else
1012 bi->bi_iter.bi_sector = (sh->sector
1013 + rdev->data_offset);
1014 if (test_bit(R5_ReadNoMerge, &head_sh->dev[i].flags))
1015 bi->bi_rw |= REQ_NOMERGE;
1016
1017 if (test_bit(R5_SkipCopy, &sh->dev[i].flags))
1018 WARN_ON(test_bit(R5_UPTODATE, &sh->dev[i].flags));
1019 sh->dev[i].vec.bv_page = sh->dev[i].page;
1020 bi->bi_vcnt = 1;
1021 bi->bi_io_vec[0].bv_len = STRIPE_SIZE;
1022 bi->bi_io_vec[0].bv_offset = 0;
1023 bi->bi_iter.bi_size = STRIPE_SIZE;
1024 /*
1025 * If this is discard request, set bi_vcnt 0. We don't
1026 * want to confuse SCSI because SCSI will replace payload
1027 */
1028 if (rw & REQ_DISCARD)
1029 bi->bi_vcnt = 0;
1030 if (rrdev)
1031 set_bit(R5_DOUBLE_LOCKED, &sh->dev[i].flags);
1032
1033 if (conf->mddev->gendisk)
1034 trace_block_bio_remap(bdev_get_queue(bi->bi_bdev),
1035 bi, disk_devt(conf->mddev->gendisk),
1036 sh->dev[i].sector);
1037 generic_make_request(bi);
1038 }
1039 if (rrdev) {
1040 if (s->syncing || s->expanding || s->expanded
1041 || s->replacing)
1042 md_sync_acct(rrdev->bdev, STRIPE_SECTORS);
1043
1044 set_bit(STRIPE_IO_STARTED, &sh->state);
1045
1046 bio_reset(rbi);
1047 rbi->bi_bdev = rrdev->bdev;
1048 rbi->bi_rw = rw;
1049 BUG_ON(!(rw & WRITE));
1050 rbi->bi_end_io = raid5_end_write_request;
1051 rbi->bi_private = sh;
1052
1053 pr_debug("%s: for %llu schedule op %ld on "
1054 "replacement disc %d\n",
1055 __func__, (unsigned long long)sh->sector,
1056 rbi->bi_rw, i);
1057 atomic_inc(&sh->count);
1058 if (sh != head_sh)
1059 atomic_inc(&head_sh->count);
1060 if (use_new_offset(conf, sh))
1061 rbi->bi_iter.bi_sector = (sh->sector
1062 + rrdev->new_data_offset);
1063 else
1064 rbi->bi_iter.bi_sector = (sh->sector
1065 + rrdev->data_offset);
1066 if (test_bit(R5_SkipCopy, &sh->dev[i].flags))
1067 WARN_ON(test_bit(R5_UPTODATE, &sh->dev[i].flags));
1068 sh->dev[i].rvec.bv_page = sh->dev[i].page;
1069 rbi->bi_vcnt = 1;
1070 rbi->bi_io_vec[0].bv_len = STRIPE_SIZE;
1071 rbi->bi_io_vec[0].bv_offset = 0;
1072 rbi->bi_iter.bi_size = STRIPE_SIZE;
1073 /*
1074 * If this is discard request, set bi_vcnt 0. We don't
1075 * want to confuse SCSI because SCSI will replace payload
1076 */
1077 if (rw & REQ_DISCARD)
1078 rbi->bi_vcnt = 0;
1079 if (conf->mddev->gendisk)
1080 trace_block_bio_remap(bdev_get_queue(rbi->bi_bdev),
1081 rbi, disk_devt(conf->mddev->gendisk),
1082 sh->dev[i].sector);
1083 generic_make_request(rbi);
1084 }
1085 if (!rdev && !rrdev) {
1086 if (rw & WRITE)
1087 set_bit(STRIPE_DEGRADED, &sh->state);
1088 pr_debug("skip op %ld on disc %d for sector %llu\n",
1089 bi->bi_rw, i, (unsigned long long)sh->sector);
1090 clear_bit(R5_LOCKED, &sh->dev[i].flags);
1091 set_bit(STRIPE_HANDLE, &sh->state);
1092 }
1093
1094 if (!head_sh->batch_head)
1095 continue;
1096 sh = list_first_entry(&sh->batch_list, struct stripe_head,
1097 batch_list);
1098 if (sh != head_sh)
1099 goto again;
1100 }
1101 }
1102
1103 static struct dma_async_tx_descriptor *
1104 async_copy_data(int frombio, struct bio *bio, struct page **page,
1105 sector_t sector, struct dma_async_tx_descriptor *tx,
1106 struct stripe_head *sh)
1107 {
1108 struct bio_vec bvl;
1109 struct bvec_iter iter;
1110 struct page *bio_page;
1111 int page_offset;
1112 struct async_submit_ctl submit;
1113 enum async_tx_flags flags = 0;
1114
1115 if (bio->bi_iter.bi_sector >= sector)
1116 page_offset = (signed)(bio->bi_iter.bi_sector - sector) * 512;
1117 else
1118 page_offset = (signed)(sector - bio->bi_iter.bi_sector) * -512;
1119
1120 if (frombio)
1121 flags |= ASYNC_TX_FENCE;
1122 init_async_submit(&submit, flags, tx, NULL, NULL, NULL);
1123
1124 bio_for_each_segment(bvl, bio, iter) {
1125 int len = bvl.bv_len;
1126 int clen;
1127 int b_offset = 0;
1128
1129 if (page_offset < 0) {
1130 b_offset = -page_offset;
1131 page_offset += b_offset;
1132 len -= b_offset;
1133 }
1134
1135 if (len > 0 && page_offset + len > STRIPE_SIZE)
1136 clen = STRIPE_SIZE - page_offset;
1137 else
1138 clen = len;
1139
1140 if (clen > 0) {
1141 b_offset += bvl.bv_offset;
1142 bio_page = bvl.bv_page;
1143 if (frombio) {
1144 if (sh->raid_conf->skip_copy &&
1145 b_offset == 0 && page_offset == 0 &&
1146 clen == STRIPE_SIZE)
1147 *page = bio_page;
1148 else
1149 tx = async_memcpy(*page, bio_page, page_offset,
1150 b_offset, clen, &submit);
1151 } else
1152 tx = async_memcpy(bio_page, *page, b_offset,
1153 page_offset, clen, &submit);
1154 }
1155 /* chain the operations */
1156 submit.depend_tx = tx;
1157
1158 if (clen < len) /* hit end of page */
1159 break;
1160 page_offset += len;
1161 }
1162
1163 return tx;
1164 }
1165
1166 static void ops_complete_biofill(void *stripe_head_ref)
1167 {
1168 struct stripe_head *sh = stripe_head_ref;
1169 struct bio *return_bi = NULL;
1170 int i;
1171
1172 pr_debug("%s: stripe %llu\n", __func__,
1173 (unsigned long long)sh->sector);
1174
1175 /* clear completed biofills */
1176 for (i = sh->disks; i--; ) {
1177 struct r5dev *dev = &sh->dev[i];
1178
1179 /* acknowledge completion of a biofill operation */
1180 /* and check if we need to reply to a read request,
1181 * new R5_Wantfill requests are held off until
1182 * !STRIPE_BIOFILL_RUN
1183 */
1184 if (test_and_clear_bit(R5_Wantfill, &dev->flags)) {
1185 struct bio *rbi, *rbi2;
1186
1187 BUG_ON(!dev->read);
1188 rbi = dev->read;
1189 dev->read = NULL;
1190 while (rbi && rbi->bi_iter.bi_sector <
1191 dev->sector + STRIPE_SECTORS) {
1192 rbi2 = r5_next_bio(rbi, dev->sector);
1193 if (!raid5_dec_bi_active_stripes(rbi)) {
1194 rbi->bi_next = return_bi;
1195 return_bi = rbi;
1196 }
1197 rbi = rbi2;
1198 }
1199 }
1200 }
1201 clear_bit(STRIPE_BIOFILL_RUN, &sh->state);
1202
1203 return_io(return_bi);
1204
1205 set_bit(STRIPE_HANDLE, &sh->state);
1206 release_stripe(sh);
1207 }
1208
1209 static void ops_run_biofill(struct stripe_head *sh)
1210 {
1211 struct dma_async_tx_descriptor *tx = NULL;
1212 struct async_submit_ctl submit;
1213 int i;
1214
1215 BUG_ON(sh->batch_head);
1216 pr_debug("%s: stripe %llu\n", __func__,
1217 (unsigned long long)sh->sector);
1218
1219 for (i = sh->disks; i--; ) {
1220 struct r5dev *dev = &sh->dev[i];
1221 if (test_bit(R5_Wantfill, &dev->flags)) {
1222 struct bio *rbi;
1223 spin_lock_irq(&sh->stripe_lock);
1224 dev->read = rbi = dev->toread;
1225 dev->toread = NULL;
1226 spin_unlock_irq(&sh->stripe_lock);
1227 while (rbi && rbi->bi_iter.bi_sector <
1228 dev->sector + STRIPE_SECTORS) {
1229 tx = async_copy_data(0, rbi, &dev->page,
1230 dev->sector, tx, sh);
1231 rbi = r5_next_bio(rbi, dev->sector);
1232 }
1233 }
1234 }
1235
1236 atomic_inc(&sh->count);
1237 init_async_submit(&submit, ASYNC_TX_ACK, tx, ops_complete_biofill, sh, NULL);
1238 async_trigger_callback(&submit);
1239 }
1240
1241 static void mark_target_uptodate(struct stripe_head *sh, int target)
1242 {
1243 struct r5dev *tgt;
1244
1245 if (target < 0)
1246 return;
1247
1248 tgt = &sh->dev[target];
1249 set_bit(R5_UPTODATE, &tgt->flags);
1250 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
1251 clear_bit(R5_Wantcompute, &tgt->flags);
1252 }
1253
1254 static void ops_complete_compute(void *stripe_head_ref)
1255 {
1256 struct stripe_head *sh = stripe_head_ref;
1257
1258 pr_debug("%s: stripe %llu\n", __func__,
1259 (unsigned long long)sh->sector);
1260
1261 /* mark the computed target(s) as uptodate */
1262 mark_target_uptodate(sh, sh->ops.target);
1263 mark_target_uptodate(sh, sh->ops.target2);
1264
1265 clear_bit(STRIPE_COMPUTE_RUN, &sh->state);
1266 if (sh->check_state == check_state_compute_run)
1267 sh->check_state = check_state_compute_result;
1268 set_bit(STRIPE_HANDLE, &sh->state);
1269 release_stripe(sh);
1270 }
1271
1272 /* return a pointer to the address conversion region of the scribble buffer */
1273 static addr_conv_t *to_addr_conv(struct stripe_head *sh,
1274 struct raid5_percpu *percpu, int i)
1275 {
1276 void *addr;
1277
1278 addr = flex_array_get(percpu->scribble, i);
1279 return addr + sizeof(struct page *) * (sh->disks + 2);
1280 }
1281
1282 /* return a pointer to the address conversion region of the scribble buffer */
1283 static struct page **to_addr_page(struct raid5_percpu *percpu, int i)
1284 {
1285 void *addr;
1286
1287 addr = flex_array_get(percpu->scribble, i);
1288 return addr;
1289 }
1290
1291 static struct dma_async_tx_descriptor *
1292 ops_run_compute5(struct stripe_head *sh, struct raid5_percpu *percpu)
1293 {
1294 int disks = sh->disks;
1295 struct page **xor_srcs = to_addr_page(percpu, 0);
1296 int target = sh->ops.target;
1297 struct r5dev *tgt = &sh->dev[target];
1298 struct page *xor_dest = tgt->page;
1299 int count = 0;
1300 struct dma_async_tx_descriptor *tx;
1301 struct async_submit_ctl submit;
1302 int i;
1303
1304 BUG_ON(sh->batch_head);
1305
1306 pr_debug("%s: stripe %llu block: %d\n",
1307 __func__, (unsigned long long)sh->sector, target);
1308 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
1309
1310 for (i = disks; i--; )
1311 if (i != target)
1312 xor_srcs[count++] = sh->dev[i].page;
1313
1314 atomic_inc(&sh->count);
1315
1316 init_async_submit(&submit, ASYNC_TX_FENCE|ASYNC_TX_XOR_ZERO_DST, NULL,
1317 ops_complete_compute, sh, to_addr_conv(sh, percpu, 0));
1318 if (unlikely(count == 1))
1319 tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE, &submit);
1320 else
1321 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE, &submit);
1322
1323 return tx;
1324 }
1325
1326 /* set_syndrome_sources - populate source buffers for gen_syndrome
1327 * @srcs - (struct page *) array of size sh->disks
1328 * @sh - stripe_head to parse
1329 *
1330 * Populates srcs in proper layout order for the stripe and returns the
1331 * 'count' of sources to be used in a call to async_gen_syndrome. The P
1332 * destination buffer is recorded in srcs[count] and the Q destination
1333 * is recorded in srcs[count+1]].
1334 */
1335 static int set_syndrome_sources(struct page **srcs,
1336 struct stripe_head *sh,
1337 int srctype)
1338 {
1339 int disks = sh->disks;
1340 int syndrome_disks = sh->ddf_layout ? disks : (disks - 2);
1341 int d0_idx = raid6_d0(sh);
1342 int count;
1343 int i;
1344
1345 for (i = 0; i < disks; i++)
1346 srcs[i] = NULL;
1347
1348 count = 0;
1349 i = d0_idx;
1350 do {
1351 int slot = raid6_idx_to_slot(i, sh, &count, syndrome_disks);
1352 struct r5dev *dev = &sh->dev[i];
1353
1354 if (i == sh->qd_idx || i == sh->pd_idx ||
1355 (srctype == SYNDROME_SRC_ALL) ||
1356 (srctype == SYNDROME_SRC_WANT_DRAIN &&
1357 test_bit(R5_Wantdrain, &dev->flags)) ||
1358 (srctype == SYNDROME_SRC_WRITTEN &&
1359 dev->written))
1360 srcs[slot] = sh->dev[i].page;
1361 i = raid6_next_disk(i, disks);
1362 } while (i != d0_idx);
1363
1364 return syndrome_disks;
1365 }
1366
1367 static struct dma_async_tx_descriptor *
1368 ops_run_compute6_1(struct stripe_head *sh, struct raid5_percpu *percpu)
1369 {
1370 int disks = sh->disks;
1371 struct page **blocks = to_addr_page(percpu, 0);
1372 int target;
1373 int qd_idx = sh->qd_idx;
1374 struct dma_async_tx_descriptor *tx;
1375 struct async_submit_ctl submit;
1376 struct r5dev *tgt;
1377 struct page *dest;
1378 int i;
1379 int count;
1380
1381 BUG_ON(sh->batch_head);
1382 if (sh->ops.target < 0)
1383 target = sh->ops.target2;
1384 else if (sh->ops.target2 < 0)
1385 target = sh->ops.target;
1386 else
1387 /* we should only have one valid target */
1388 BUG();
1389 BUG_ON(target < 0);
1390 pr_debug("%s: stripe %llu block: %d\n",
1391 __func__, (unsigned long long)sh->sector, target);
1392
1393 tgt = &sh->dev[target];
1394 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
1395 dest = tgt->page;
1396
1397 atomic_inc(&sh->count);
1398
1399 if (target == qd_idx) {
1400 count = set_syndrome_sources(blocks, sh, SYNDROME_SRC_ALL);
1401 blocks[count] = NULL; /* regenerating p is not necessary */
1402 BUG_ON(blocks[count+1] != dest); /* q should already be set */
1403 init_async_submit(&submit, ASYNC_TX_FENCE, NULL,
1404 ops_complete_compute, sh,
1405 to_addr_conv(sh, percpu, 0));
1406 tx = async_gen_syndrome(blocks, 0, count+2, STRIPE_SIZE, &submit);
1407 } else {
1408 /* Compute any data- or p-drive using XOR */
1409 count = 0;
1410 for (i = disks; i-- ; ) {
1411 if (i == target || i == qd_idx)
1412 continue;
1413 blocks[count++] = sh->dev[i].page;
1414 }
1415
1416 init_async_submit(&submit, ASYNC_TX_FENCE|ASYNC_TX_XOR_ZERO_DST,
1417 NULL, ops_complete_compute, sh,
1418 to_addr_conv(sh, percpu, 0));
1419 tx = async_xor(dest, blocks, 0, count, STRIPE_SIZE, &submit);
1420 }
1421
1422 return tx;
1423 }
1424
1425 static struct dma_async_tx_descriptor *
1426 ops_run_compute6_2(struct stripe_head *sh, struct raid5_percpu *percpu)
1427 {
1428 int i, count, disks = sh->disks;
1429 int syndrome_disks = sh->ddf_layout ? disks : disks-2;
1430 int d0_idx = raid6_d0(sh);
1431 int faila = -1, failb = -1;
1432 int target = sh->ops.target;
1433 int target2 = sh->ops.target2;
1434 struct r5dev *tgt = &sh->dev[target];
1435 struct r5dev *tgt2 = &sh->dev[target2];
1436 struct dma_async_tx_descriptor *tx;
1437 struct page **blocks = to_addr_page(percpu, 0);
1438 struct async_submit_ctl submit;
1439
1440 BUG_ON(sh->batch_head);
1441 pr_debug("%s: stripe %llu block1: %d block2: %d\n",
1442 __func__, (unsigned long long)sh->sector, target, target2);
1443 BUG_ON(target < 0 || target2 < 0);
1444 BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
1445 BUG_ON(!test_bit(R5_Wantcompute, &tgt2->flags));
1446
1447 /* we need to open-code set_syndrome_sources to handle the
1448 * slot number conversion for 'faila' and 'failb'
1449 */
1450 for (i = 0; i < disks ; i++)
1451 blocks[i] = NULL;
1452 count = 0;
1453 i = d0_idx;
1454 do {
1455 int slot = raid6_idx_to_slot(i, sh, &count, syndrome_disks);
1456
1457 blocks[slot] = sh->dev[i].page;
1458
1459 if (i == target)
1460 faila = slot;
1461 if (i == target2)
1462 failb = slot;
1463 i = raid6_next_disk(i, disks);
1464 } while (i != d0_idx);
1465
1466 BUG_ON(faila == failb);
1467 if (failb < faila)
1468 swap(faila, failb);
1469 pr_debug("%s: stripe: %llu faila: %d failb: %d\n",
1470 __func__, (unsigned long long)sh->sector, faila, failb);
1471
1472 atomic_inc(&sh->count);
1473
1474 if (failb == syndrome_disks+1) {
1475 /* Q disk is one of the missing disks */
1476 if (faila == syndrome_disks) {
1477 /* Missing P+Q, just recompute */
1478 init_async_submit(&submit, ASYNC_TX_FENCE, NULL,
1479 ops_complete_compute, sh,
1480 to_addr_conv(sh, percpu, 0));
1481 return async_gen_syndrome(blocks, 0, syndrome_disks+2,
1482 STRIPE_SIZE, &submit);
1483 } else {
1484 struct page *dest;
1485 int data_target;
1486 int qd_idx = sh->qd_idx;
1487
1488 /* Missing D+Q: recompute D from P, then recompute Q */
1489 if (target == qd_idx)
1490 data_target = target2;
1491 else
1492 data_target = target;
1493
1494 count = 0;
1495 for (i = disks; i-- ; ) {
1496 if (i == data_target || i == qd_idx)
1497 continue;
1498 blocks[count++] = sh->dev[i].page;
1499 }
1500 dest = sh->dev[data_target].page;
1501 init_async_submit(&submit,
1502 ASYNC_TX_FENCE|ASYNC_TX_XOR_ZERO_DST,
1503 NULL, NULL, NULL,
1504 to_addr_conv(sh, percpu, 0));
1505 tx = async_xor(dest, blocks, 0, count, STRIPE_SIZE,
1506 &submit);
1507
1508 count = set_syndrome_sources(blocks, sh, SYNDROME_SRC_ALL);
1509 init_async_submit(&submit, ASYNC_TX_FENCE, tx,
1510 ops_complete_compute, sh,
1511 to_addr_conv(sh, percpu, 0));
1512 return async_gen_syndrome(blocks, 0, count+2,
1513 STRIPE_SIZE, &submit);
1514 }
1515 } else {
1516 init_async_submit(&submit, ASYNC_TX_FENCE, NULL,
1517 ops_complete_compute, sh,
1518 to_addr_conv(sh, percpu, 0));
1519 if (failb == syndrome_disks) {
1520 /* We're missing D+P. */
1521 return async_raid6_datap_recov(syndrome_disks+2,
1522 STRIPE_SIZE, faila,
1523 blocks, &submit);
1524 } else {
1525 /* We're missing D+D. */
1526 return async_raid6_2data_recov(syndrome_disks+2,
1527 STRIPE_SIZE, faila, failb,
1528 blocks, &submit);
1529 }
1530 }
1531 }
1532
1533 static void ops_complete_prexor(void *stripe_head_ref)
1534 {
1535 struct stripe_head *sh = stripe_head_ref;
1536
1537 pr_debug("%s: stripe %llu\n", __func__,
1538 (unsigned long long)sh->sector);
1539 }
1540
1541 static struct dma_async_tx_descriptor *
1542 ops_run_prexor5(struct stripe_head *sh, struct raid5_percpu *percpu,
1543 struct dma_async_tx_descriptor *tx)
1544 {
1545 int disks = sh->disks;
1546 struct page **xor_srcs = to_addr_page(percpu, 0);
1547 int count = 0, pd_idx = sh->pd_idx, i;
1548 struct async_submit_ctl submit;
1549
1550 /* existing parity data subtracted */
1551 struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
1552
1553 BUG_ON(sh->batch_head);
1554 pr_debug("%s: stripe %llu\n", __func__,
1555 (unsigned long long)sh->sector);
1556
1557 for (i = disks; i--; ) {
1558 struct r5dev *dev = &sh->dev[i];
1559 /* Only process blocks that are known to be uptodate */
1560 if (test_bit(R5_Wantdrain, &dev->flags))
1561 xor_srcs[count++] = dev->page;
1562 }
1563
1564 init_async_submit(&submit, ASYNC_TX_FENCE|ASYNC_TX_XOR_DROP_DST, tx,
1565 ops_complete_prexor, sh, to_addr_conv(sh, percpu, 0));
1566 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE, &submit);
1567
1568 return tx;
1569 }
1570
1571 static struct dma_async_tx_descriptor *
1572 ops_run_prexor6(struct stripe_head *sh, struct raid5_percpu *percpu,
1573 struct dma_async_tx_descriptor *tx)
1574 {
1575 struct page **blocks = to_addr_page(percpu, 0);
1576 int count;
1577 struct async_submit_ctl submit;
1578
1579 pr_debug("%s: stripe %llu\n", __func__,
1580 (unsigned long long)sh->sector);
1581
1582 count = set_syndrome_sources(blocks, sh, SYNDROME_SRC_WANT_DRAIN);
1583
1584 init_async_submit(&submit, ASYNC_TX_FENCE|ASYNC_TX_PQ_XOR_DST, tx,
1585 ops_complete_prexor, sh, to_addr_conv(sh, percpu, 0));
1586 tx = async_gen_syndrome(blocks, 0, count+2, STRIPE_SIZE, &submit);
1587
1588 return tx;
1589 }
1590
1591 static struct dma_async_tx_descriptor *
1592 ops_run_biodrain(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
1593 {
1594 int disks = sh->disks;
1595 int i;
1596 struct stripe_head *head_sh = sh;
1597
1598 pr_debug("%s: stripe %llu\n", __func__,
1599 (unsigned long long)sh->sector);
1600
1601 for (i = disks; i--; ) {
1602 struct r5dev *dev;
1603 struct bio *chosen;
1604
1605 sh = head_sh;
1606 if (test_and_clear_bit(R5_Wantdrain, &head_sh->dev[i].flags)) {
1607 struct bio *wbi;
1608
1609 again:
1610 dev = &sh->dev[i];
1611 spin_lock_irq(&sh->stripe_lock);
1612 chosen = dev->towrite;
1613 dev->towrite = NULL;
1614 sh->overwrite_disks = 0;
1615 BUG_ON(dev->written);
1616 wbi = dev->written = chosen;
1617 spin_unlock_irq(&sh->stripe_lock);
1618 WARN_ON(dev->page != dev->orig_page);
1619
1620 while (wbi && wbi->bi_iter.bi_sector <
1621 dev->sector + STRIPE_SECTORS) {
1622 if (wbi->bi_rw & REQ_FUA)
1623 set_bit(R5_WantFUA, &dev->flags);
1624 if (wbi->bi_rw & REQ_SYNC)
1625 set_bit(R5_SyncIO, &dev->flags);
1626 if (wbi->bi_rw & REQ_DISCARD)
1627 set_bit(R5_Discard, &dev->flags);
1628 else {
1629 tx = async_copy_data(1, wbi, &dev->page,
1630 dev->sector, tx, sh);
1631 if (dev->page != dev->orig_page) {
1632 set_bit(R5_SkipCopy, &dev->flags);
1633 clear_bit(R5_UPTODATE, &dev->flags);
1634 clear_bit(R5_OVERWRITE, &dev->flags);
1635 }
1636 }
1637 wbi = r5_next_bio(wbi, dev->sector);
1638 }
1639
1640 if (head_sh->batch_head) {
1641 sh = list_first_entry(&sh->batch_list,
1642 struct stripe_head,
1643 batch_list);
1644 if (sh == head_sh)
1645 continue;
1646 goto again;
1647 }
1648 }
1649 }
1650
1651 return tx;
1652 }
1653
1654 static void ops_complete_reconstruct(void *stripe_head_ref)
1655 {
1656 struct stripe_head *sh = stripe_head_ref;
1657 int disks = sh->disks;
1658 int pd_idx = sh->pd_idx;
1659 int qd_idx = sh->qd_idx;
1660 int i;
1661 bool fua = false, sync = false, discard = false;
1662
1663 pr_debug("%s: stripe %llu\n", __func__,
1664 (unsigned long long)sh->sector);
1665
1666 for (i = disks; i--; ) {
1667 fua |= test_bit(R5_WantFUA, &sh->dev[i].flags);
1668 sync |= test_bit(R5_SyncIO, &sh->dev[i].flags);
1669 discard |= test_bit(R5_Discard, &sh->dev[i].flags);
1670 }
1671
1672 for (i = disks; i--; ) {
1673 struct r5dev *dev = &sh->dev[i];
1674
1675 if (dev->written || i == pd_idx || i == qd_idx) {
1676 if (!discard && !test_bit(R5_SkipCopy, &dev->flags))
1677 set_bit(R5_UPTODATE, &dev->flags);
1678 if (fua)
1679 set_bit(R5_WantFUA, &dev->flags);
1680 if (sync)
1681 set_bit(R5_SyncIO, &dev->flags);
1682 }
1683 }
1684
1685 if (sh->reconstruct_state == reconstruct_state_drain_run)
1686 sh->reconstruct_state = reconstruct_state_drain_result;
1687 else if (sh->reconstruct_state == reconstruct_state_prexor_drain_run)
1688 sh->reconstruct_state = reconstruct_state_prexor_drain_result;
1689 else {
1690 BUG_ON(sh->reconstruct_state != reconstruct_state_run);
1691 sh->reconstruct_state = reconstruct_state_result;
1692 }
1693
1694 set_bit(STRIPE_HANDLE, &sh->state);
1695 release_stripe(sh);
1696 }
1697
1698 static void
1699 ops_run_reconstruct5(struct stripe_head *sh, struct raid5_percpu *percpu,
1700 struct dma_async_tx_descriptor *tx)
1701 {
1702 int disks = sh->disks;
1703 struct page **xor_srcs;
1704 struct async_submit_ctl submit;
1705 int count, pd_idx = sh->pd_idx, i;
1706 struct page *xor_dest;
1707 int prexor = 0;
1708 unsigned long flags;
1709 int j = 0;
1710 struct stripe_head *head_sh = sh;
1711 int last_stripe;
1712
1713 pr_debug("%s: stripe %llu\n", __func__,
1714 (unsigned long long)sh->sector);
1715
1716 for (i = 0; i < sh->disks; i++) {
1717 if (pd_idx == i)
1718 continue;
1719 if (!test_bit(R5_Discard, &sh->dev[i].flags))
1720 break;
1721 }
1722 if (i >= sh->disks) {
1723 atomic_inc(&sh->count);
1724 set_bit(R5_Discard, &sh->dev[pd_idx].flags);
1725 ops_complete_reconstruct(sh);
1726 return;
1727 }
1728 again:
1729 count = 0;
1730 xor_srcs = to_addr_page(percpu, j);
1731 /* check if prexor is active which means only process blocks
1732 * that are part of a read-modify-write (written)
1733 */
1734 if (head_sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
1735 prexor = 1;
1736 xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
1737 for (i = disks; i--; ) {
1738 struct r5dev *dev = &sh->dev[i];
1739 if (head_sh->dev[i].written)
1740 xor_srcs[count++] = dev->page;
1741 }
1742 } else {
1743 xor_dest = sh->dev[pd_idx].page;
1744 for (i = disks; i--; ) {
1745 struct r5dev *dev = &sh->dev[i];
1746 if (i != pd_idx)
1747 xor_srcs[count++] = dev->page;
1748 }
1749 }
1750
1751 /* 1/ if we prexor'd then the dest is reused as a source
1752 * 2/ if we did not prexor then we are redoing the parity
1753 * set ASYNC_TX_XOR_DROP_DST and ASYNC_TX_XOR_ZERO_DST
1754 * for the synchronous xor case
1755 */
1756 last_stripe = !head_sh->batch_head ||
1757 list_first_entry(&sh->batch_list,
1758 struct stripe_head, batch_list) == head_sh;
1759 if (last_stripe) {
1760 flags = ASYNC_TX_ACK |
1761 (prexor ? ASYNC_TX_XOR_DROP_DST : ASYNC_TX_XOR_ZERO_DST);
1762
1763 atomic_inc(&head_sh->count);
1764 init_async_submit(&submit, flags, tx, ops_complete_reconstruct, head_sh,
1765 to_addr_conv(sh, percpu, j));
1766 } else {
1767 flags = prexor ? ASYNC_TX_XOR_DROP_DST : ASYNC_TX_XOR_ZERO_DST;
1768 init_async_submit(&submit, flags, tx, NULL, NULL,
1769 to_addr_conv(sh, percpu, j));
1770 }
1771
1772 if (unlikely(count == 1))
1773 tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE, &submit);
1774 else
1775 tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE, &submit);
1776 if (!last_stripe) {
1777 j++;
1778 sh = list_first_entry(&sh->batch_list, struct stripe_head,
1779 batch_list);
1780 goto again;
1781 }
1782 }
1783
1784 static void
1785 ops_run_reconstruct6(struct stripe_head *sh, struct raid5_percpu *percpu,
1786 struct dma_async_tx_descriptor *tx)
1787 {
1788 struct async_submit_ctl submit;
1789 struct page **blocks;
1790 int count, i, j = 0;
1791 struct stripe_head *head_sh = sh;
1792 int last_stripe;
1793 int synflags;
1794 unsigned long txflags;
1795
1796 pr_debug("%s: stripe %llu\n", __func__, (unsigned long long)sh->sector);
1797
1798 for (i = 0; i < sh->disks; i++) {
1799 if (sh->pd_idx == i || sh->qd_idx == i)
1800 continue;
1801 if (!test_bit(R5_Discard, &sh->dev[i].flags))
1802 break;
1803 }
1804 if (i >= sh->disks) {
1805 atomic_inc(&sh->count);
1806 set_bit(R5_Discard, &sh->dev[sh->pd_idx].flags);
1807 set_bit(R5_Discard, &sh->dev[sh->qd_idx].flags);
1808 ops_complete_reconstruct(sh);
1809 return;
1810 }
1811
1812 again:
1813 blocks = to_addr_page(percpu, j);
1814
1815 if (sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
1816 synflags = SYNDROME_SRC_WRITTEN;
1817 txflags = ASYNC_TX_ACK | ASYNC_TX_PQ_XOR_DST;
1818 } else {
1819 synflags = SYNDROME_SRC_ALL;
1820 txflags = ASYNC_TX_ACK;
1821 }
1822
1823 count = set_syndrome_sources(blocks, sh, synflags);
1824 last_stripe = !head_sh->batch_head ||
1825 list_first_entry(&sh->batch_list,
1826 struct stripe_head, batch_list) == head_sh;
1827
1828 if (last_stripe) {
1829 atomic_inc(&head_sh->count);
1830 init_async_submit(&submit, txflags, tx, ops_complete_reconstruct,
1831 head_sh, to_addr_conv(sh, percpu, j));
1832 } else
1833 init_async_submit(&submit, 0, tx, NULL, NULL,
1834 to_addr_conv(sh, percpu, j));
1835 tx = async_gen_syndrome(blocks, 0, count+2, STRIPE_SIZE, &submit);
1836 if (!last_stripe) {
1837 j++;
1838 sh = list_first_entry(&sh->batch_list, struct stripe_head,
1839 batch_list);
1840 goto again;
1841 }
1842 }
1843
1844 static void ops_complete_check(void *stripe_head_ref)
1845 {
1846 struct stripe_head *sh = stripe_head_ref;
1847
1848 pr_debug("%s: stripe %llu\n", __func__,
1849 (unsigned long long)sh->sector);
1850
1851 sh->check_state = check_state_check_result;
1852 set_bit(STRIPE_HANDLE, &sh->state);
1853 release_stripe(sh);
1854 }
1855
1856 static void ops_run_check_p(struct stripe_head *sh, struct raid5_percpu *percpu)
1857 {
1858 int disks = sh->disks;
1859 int pd_idx = sh->pd_idx;
1860 int qd_idx = sh->qd_idx;
1861 struct page *xor_dest;
1862 struct page **xor_srcs = to_addr_page(percpu, 0);
1863 struct dma_async_tx_descriptor *tx;
1864 struct async_submit_ctl submit;
1865 int count;
1866 int i;
1867
1868 pr_debug("%s: stripe %llu\n", __func__,
1869 (unsigned long long)sh->sector);
1870
1871 BUG_ON(sh->batch_head);
1872 count = 0;
1873 xor_dest = sh->dev[pd_idx].page;
1874 xor_srcs[count++] = xor_dest;
1875 for (i = disks; i--; ) {
1876 if (i == pd_idx || i == qd_idx)
1877 continue;
1878 xor_srcs[count++] = sh->dev[i].page;
1879 }
1880
1881 init_async_submit(&submit, 0, NULL, NULL, NULL,
1882 to_addr_conv(sh, percpu, 0));
1883 tx = async_xor_val(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
1884 &sh->ops.zero_sum_result, &submit);
1885
1886 atomic_inc(&sh->count);
1887 init_async_submit(&submit, ASYNC_TX_ACK, tx, ops_complete_check, sh, NULL);
1888 tx = async_trigger_callback(&submit);
1889 }
1890
1891 static void ops_run_check_pq(struct stripe_head *sh, struct raid5_percpu *percpu, int checkp)
1892 {
1893 struct page **srcs = to_addr_page(percpu, 0);
1894 struct async_submit_ctl submit;
1895 int count;
1896
1897 pr_debug("%s: stripe %llu checkp: %d\n", __func__,
1898 (unsigned long long)sh->sector, checkp);
1899
1900 BUG_ON(sh->batch_head);
1901 count = set_syndrome_sources(srcs, sh, SYNDROME_SRC_ALL);
1902 if (!checkp)
1903 srcs[count] = NULL;
1904
1905 atomic_inc(&sh->count);
1906 init_async_submit(&submit, ASYNC_TX_ACK, NULL, ops_complete_check,
1907 sh, to_addr_conv(sh, percpu, 0));
1908 async_syndrome_val(srcs, 0, count+2, STRIPE_SIZE,
1909 &sh->ops.zero_sum_result, percpu->spare_page, &submit);
1910 }
1911
1912 static void raid_run_ops(struct stripe_head *sh, unsigned long ops_request)
1913 {
1914 int overlap_clear = 0, i, disks = sh->disks;
1915 struct dma_async_tx_descriptor *tx = NULL;
1916 struct r5conf *conf = sh->raid_conf;
1917 int level = conf->level;
1918 struct raid5_percpu *percpu;
1919 unsigned long cpu;
1920
1921 cpu = get_cpu();
1922 percpu = per_cpu_ptr(conf->percpu, cpu);
1923 if (test_bit(STRIPE_OP_BIOFILL, &ops_request)) {
1924 ops_run_biofill(sh);
1925 overlap_clear++;
1926 }
1927
1928 if (test_bit(STRIPE_OP_COMPUTE_BLK, &ops_request)) {
1929 if (level < 6)
1930 tx = ops_run_compute5(sh, percpu);
1931 else {
1932 if (sh->ops.target2 < 0 || sh->ops.target < 0)
1933 tx = ops_run_compute6_1(sh, percpu);
1934 else
1935 tx = ops_run_compute6_2(sh, percpu);
1936 }
1937 /* terminate the chain if reconstruct is not set to be run */
1938 if (tx && !test_bit(STRIPE_OP_RECONSTRUCT, &ops_request))
1939 async_tx_ack(tx);
1940 }
1941
1942 if (test_bit(STRIPE_OP_PREXOR, &ops_request)) {
1943 if (level < 6)
1944 tx = ops_run_prexor5(sh, percpu, tx);
1945 else
1946 tx = ops_run_prexor6(sh, percpu, tx);
1947 }
1948
1949 if (test_bit(STRIPE_OP_BIODRAIN, &ops_request)) {
1950 tx = ops_run_biodrain(sh, tx);
1951 overlap_clear++;
1952 }
1953
1954 if (test_bit(STRIPE_OP_RECONSTRUCT, &ops_request)) {
1955 if (level < 6)
1956 ops_run_reconstruct5(sh, percpu, tx);
1957 else
1958 ops_run_reconstruct6(sh, percpu, tx);
1959 }
1960
1961 if (test_bit(STRIPE_OP_CHECK, &ops_request)) {
1962 if (sh->check_state == check_state_run)
1963 ops_run_check_p(sh, percpu);
1964 else if (sh->check_state == check_state_run_q)
1965 ops_run_check_pq(sh, percpu, 0);
1966 else if (sh->check_state == check_state_run_pq)
1967 ops_run_check_pq(sh, percpu, 1);
1968 else
1969 BUG();
1970 }
1971
1972 if (overlap_clear && !sh->batch_head)
1973 for (i = disks; i--; ) {
1974 struct r5dev *dev = &sh->dev[i];
1975 if (test_and_clear_bit(R5_Overlap, &dev->flags))
1976 wake_up(&sh->raid_conf->wait_for_overlap);
1977 }
1978 put_cpu();
1979 }
1980
1981 static struct stripe_head *alloc_stripe(struct kmem_cache *sc, gfp_t gfp)
1982 {
1983 struct stripe_head *sh;
1984
1985 sh = kmem_cache_zalloc(sc, gfp);
1986 if (sh) {
1987 spin_lock_init(&sh->stripe_lock);
1988 spin_lock_init(&sh->batch_lock);
1989 INIT_LIST_HEAD(&sh->batch_list);
1990 INIT_LIST_HEAD(&sh->lru);
1991 atomic_set(&sh->count, 1);
1992 }
1993 return sh;
1994 }
1995 static int grow_one_stripe(struct r5conf *conf, gfp_t gfp)
1996 {
1997 struct stripe_head *sh;
1998
1999 sh = alloc_stripe(conf->slab_cache, gfp);
2000 if (!sh)
2001 return 0;
2002
2003 sh->raid_conf = conf;
2004
2005 if (grow_buffers(sh, gfp)) {
2006 shrink_buffers(sh);
2007 kmem_cache_free(conf->slab_cache, sh);
2008 return 0;
2009 }
2010 sh->hash_lock_index =
2011 conf->max_nr_stripes % NR_STRIPE_HASH_LOCKS;
2012 /* we just created an active stripe so... */
2013 atomic_inc(&conf->active_stripes);
2014
2015 release_stripe(sh);
2016 conf->max_nr_stripes++;
2017 return 1;
2018 }
2019
2020 static int grow_stripes(struct r5conf *conf, int num)
2021 {
2022 struct kmem_cache *sc;
2023 int devs = max(conf->raid_disks, conf->previous_raid_disks);
2024
2025 if (conf->mddev->gendisk)
2026 sprintf(conf->cache_name[0],
2027 "raid%d-%s", conf->level, mdname(conf->mddev));
2028 else
2029 sprintf(conf->cache_name[0],
2030 "raid%d-%p", conf->level, conf->mddev);
2031 sprintf(conf->cache_name[1], "%s-alt", conf->cache_name[0]);
2032
2033 conf->active_name = 0;
2034 sc = kmem_cache_create(conf->cache_name[conf->active_name],
2035 sizeof(struct stripe_head)+(devs-1)*sizeof(struct r5dev),
2036 0, 0, NULL);
2037 if (!sc)
2038 return 1;
2039 conf->slab_cache = sc;
2040 conf->pool_size = devs;
2041 while (num--)
2042 if (!grow_one_stripe(conf, GFP_KERNEL))
2043 return 1;
2044
2045 return 0;
2046 }
2047
2048 /**
2049 * scribble_len - return the required size of the scribble region
2050 * @num - total number of disks in the array
2051 *
2052 * The size must be enough to contain:
2053 * 1/ a struct page pointer for each device in the array +2
2054 * 2/ room to convert each entry in (1) to its corresponding dma
2055 * (dma_map_page()) or page (page_address()) address.
2056 *
2057 * Note: the +2 is for the destination buffers of the ddf/raid6 case where we
2058 * calculate over all devices (not just the data blocks), using zeros in place
2059 * of the P and Q blocks.
2060 */
2061 static struct flex_array *scribble_alloc(int num, int cnt, gfp_t flags)
2062 {
2063 struct flex_array *ret;
2064 size_t len;
2065
2066 len = sizeof(struct page *) * (num+2) + sizeof(addr_conv_t) * (num+2);
2067 ret = flex_array_alloc(len, cnt, flags);
2068 if (!ret)
2069 return NULL;
2070 /* always prealloc all elements, so no locking is required */
2071 if (flex_array_prealloc(ret, 0, cnt, flags)) {
2072 flex_array_free(ret);
2073 return NULL;
2074 }
2075 return ret;
2076 }
2077
2078 static int resize_chunks(struct r5conf *conf, int new_disks, int new_sectors)
2079 {
2080 unsigned long cpu;
2081 int err = 0;
2082
2083 mddev_suspend(conf->mddev);
2084 get_online_cpus();
2085 for_each_present_cpu(cpu) {
2086 struct raid5_percpu *percpu;
2087 struct flex_array *scribble;
2088
2089 percpu = per_cpu_ptr(conf->percpu, cpu);
2090 scribble = scribble_alloc(new_disks,
2091 new_sectors / STRIPE_SECTORS,
2092 GFP_NOIO);
2093
2094 if (scribble) {
2095 flex_array_free(percpu->scribble);
2096 percpu->scribble = scribble;
2097 } else {
2098 err = -ENOMEM;
2099 break;
2100 }
2101 }
2102 put_online_cpus();
2103 mddev_resume(conf->mddev);
2104 return err;
2105 }
2106
2107 static int resize_stripes(struct r5conf *conf, int newsize)
2108 {
2109 /* Make all the stripes able to hold 'newsize' devices.
2110 * New slots in each stripe get 'page' set to a new page.
2111 *
2112 * This happens in stages:
2113 * 1/ create a new kmem_cache and allocate the required number of
2114 * stripe_heads.
2115 * 2/ gather all the old stripe_heads and transfer the pages across
2116 * to the new stripe_heads. This will have the side effect of
2117 * freezing the array as once all stripe_heads have been collected,
2118 * no IO will be possible. Old stripe heads are freed once their
2119 * pages have been transferred over, and the old kmem_cache is
2120 * freed when all stripes are done.
2121 * 3/ reallocate conf->disks to be suitable bigger. If this fails,
2122 * we simple return a failre status - no need to clean anything up.
2123 * 4/ allocate new pages for the new slots in the new stripe_heads.
2124 * If this fails, we don't bother trying the shrink the
2125 * stripe_heads down again, we just leave them as they are.
2126 * As each stripe_head is processed the new one is released into
2127 * active service.
2128 *
2129 * Once step2 is started, we cannot afford to wait for a write,
2130 * so we use GFP_NOIO allocations.
2131 */
2132 struct stripe_head *osh, *nsh;
2133 LIST_HEAD(newstripes);
2134 struct disk_info *ndisks;
2135 int err;
2136 struct kmem_cache *sc;
2137 int i;
2138 int hash, cnt;
2139
2140 if (newsize <= conf->pool_size)
2141 return 0; /* never bother to shrink */
2142
2143 err = md_allow_write(conf->mddev);
2144 if (err)
2145 return err;
2146
2147 /* Step 1 */
2148 sc = kmem_cache_create(conf->cache_name[1-conf->active_name],
2149 sizeof(struct stripe_head)+(newsize-1)*sizeof(struct r5dev),
2150 0, 0, NULL);
2151 if (!sc)
2152 return -ENOMEM;
2153
2154 for (i = conf->max_nr_stripes; i; i--) {
2155 nsh = alloc_stripe(sc, GFP_KERNEL);
2156 if (!nsh)
2157 break;
2158
2159 nsh->raid_conf = conf;
2160 list_add(&nsh->lru, &newstripes);
2161 }
2162 if (i) {
2163 /* didn't get enough, give up */
2164 while (!list_empty(&newstripes)) {
2165 nsh = list_entry(newstripes.next, struct stripe_head, lru);
2166 list_del(&nsh->lru);
2167 kmem_cache_free(sc, nsh);
2168 }
2169 kmem_cache_destroy(sc);
2170 return -ENOMEM;
2171 }
2172 /* Step 2 - Must use GFP_NOIO now.
2173 * OK, we have enough stripes, start collecting inactive
2174 * stripes and copying them over
2175 */
2176 hash = 0;
2177 cnt = 0;
2178 list_for_each_entry(nsh, &newstripes, lru) {
2179 lock_device_hash_lock(conf, hash);
2180 wait_event_cmd(conf->wait_for_stripe,
2181 !list_empty(conf->inactive_list + hash),
2182 unlock_device_hash_lock(conf, hash),
2183 lock_device_hash_lock(conf, hash));
2184 osh = get_free_stripe(conf, hash);
2185 unlock_device_hash_lock(conf, hash);
2186
2187 for(i=0; i<conf->pool_size; i++) {
2188 nsh->dev[i].page = osh->dev[i].page;
2189 nsh->dev[i].orig_page = osh->dev[i].page;
2190 }
2191 nsh->hash_lock_index = hash;
2192 kmem_cache_free(conf->slab_cache, osh);
2193 cnt++;
2194 if (cnt >= conf->max_nr_stripes / NR_STRIPE_HASH_LOCKS +
2195 !!((conf->max_nr_stripes % NR_STRIPE_HASH_LOCKS) > hash)) {
2196 hash++;
2197 cnt = 0;
2198 }
2199 }
2200 kmem_cache_destroy(conf->slab_cache);
2201
2202 /* Step 3.
2203 * At this point, we are holding all the stripes so the array
2204 * is completely stalled, so now is a good time to resize
2205 * conf->disks and the scribble region
2206 */
2207 ndisks = kzalloc(newsize * sizeof(struct disk_info), GFP_NOIO);
2208 if (ndisks) {
2209 for (i=0; i<conf->raid_disks; i++)
2210 ndisks[i] = conf->disks[i];
2211 kfree(conf->disks);
2212 conf->disks = ndisks;
2213 } else
2214 err = -ENOMEM;
2215
2216 /* Step 4, return new stripes to service */
2217 while(!list_empty(&newstripes)) {
2218 nsh = list_entry(newstripes.next, struct stripe_head, lru);
2219 list_del_init(&nsh->lru);
2220
2221 for (i=conf->raid_disks; i < newsize; i++)
2222 if (nsh->dev[i].page == NULL) {
2223 struct page *p = alloc_page(GFP_NOIO);
2224 nsh->dev[i].page = p;
2225 nsh->dev[i].orig_page = p;
2226 if (!p)
2227 err = -ENOMEM;
2228 }
2229 release_stripe(nsh);
2230 }
2231 /* critical section pass, GFP_NOIO no longer needed */
2232
2233 conf->slab_cache = sc;
2234 conf->active_name = 1-conf->active_name;
2235 if (!err)
2236 conf->pool_size = newsize;
2237 return err;
2238 }
2239
2240 static int drop_one_stripe(struct r5conf *conf)
2241 {
2242 struct stripe_head *sh;
2243 int hash = (conf->max_nr_stripes - 1) % NR_STRIPE_HASH_LOCKS;
2244
2245 spin_lock_irq(conf->hash_locks + hash);
2246 sh = get_free_stripe(conf, hash);
2247 spin_unlock_irq(conf->hash_locks + hash);
2248 if (!sh)
2249 return 0;
2250 BUG_ON(atomic_read(&sh->count));
2251 shrink_buffers(sh);
2252 kmem_cache_free(conf->slab_cache, sh);
2253 atomic_dec(&conf->active_stripes);
2254 conf->max_nr_stripes--;
2255 return 1;
2256 }
2257
2258 static void shrink_stripes(struct r5conf *conf)
2259 {
2260 while (conf->max_nr_stripes &&
2261 drop_one_stripe(conf))
2262 ;
2263
2264 if (conf->slab_cache)
2265 kmem_cache_destroy(conf->slab_cache);
2266 conf->slab_cache = NULL;
2267 }
2268
2269 static void raid5_end_read_request(struct bio * bi, int error)
2270 {
2271 struct stripe_head *sh = bi->bi_private;
2272 struct r5conf *conf = sh->raid_conf;
2273 int disks = sh->disks, i;
2274 int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
2275 char b[BDEVNAME_SIZE];
2276 struct md_rdev *rdev = NULL;
2277 sector_t s;
2278
2279 for (i=0 ; i<disks; i++)
2280 if (bi == &sh->dev[i].req)
2281 break;
2282
2283 pr_debug("end_read_request %llu/%d, count: %d, uptodate %d.\n",
2284 (unsigned long long)sh->sector, i, atomic_read(&sh->count),
2285 uptodate);
2286 if (i == disks) {
2287 BUG();
2288 return;
2289 }
2290 if (test_bit(R5_ReadRepl, &sh->dev[i].flags))
2291 /* If replacement finished while this request was outstanding,
2292 * 'replacement' might be NULL already.
2293 * In that case it moved down to 'rdev'.
2294 * rdev is not removed until all requests are finished.
2295 */
2296 rdev = conf->disks[i].replacement;
2297 if (!rdev)
2298 rdev = conf->disks[i].rdev;
2299
2300 if (use_new_offset(conf, sh))
2301 s = sh->sector + rdev->new_data_offset;
2302 else
2303 s = sh->sector + rdev->data_offset;
2304 if (uptodate) {
2305 set_bit(R5_UPTODATE, &sh->dev[i].flags);
2306 if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
2307 /* Note that this cannot happen on a
2308 * replacement device. We just fail those on
2309 * any error
2310 */
2311 printk_ratelimited(
2312 KERN_INFO
2313 "md/raid:%s: read error corrected"
2314 " (%lu sectors at %llu on %s)\n",
2315 mdname(conf->mddev), STRIPE_SECTORS,
2316 (unsigned long long)s,
2317 bdevname(rdev->bdev, b));
2318 atomic_add(STRIPE_SECTORS, &rdev->corrected_errors);
2319 clear_bit(R5_ReadError, &sh->dev[i].flags);
2320 clear_bit(R5_ReWrite, &sh->dev[i].flags);
2321 } else if (test_bit(R5_ReadNoMerge, &sh->dev[i].flags))
2322 clear_bit(R5_ReadNoMerge, &sh->dev[i].flags);
2323
2324 if (atomic_read(&rdev->read_errors))
2325 atomic_set(&rdev->read_errors, 0);
2326 } else {
2327 const char *bdn = bdevname(rdev->bdev, b);
2328 int retry = 0;
2329 int set_bad = 0;
2330
2331 clear_bit(R5_UPTODATE, &sh->dev[i].flags);
2332 atomic_inc(&rdev->read_errors);
2333 if (test_bit(R5_ReadRepl, &sh->dev[i].flags))
2334 printk_ratelimited(
2335 KERN_WARNING
2336 "md/raid:%s: read error on replacement device "
2337 "(sector %llu on %s).\n",
2338 mdname(conf->mddev),
2339 (unsigned long long)s,
2340 bdn);
2341 else if (conf->mddev->degraded >= conf->max_degraded) {
2342 set_bad = 1;
2343 printk_ratelimited(
2344 KERN_WARNING
2345 "md/raid:%s: read error not correctable "
2346 "(sector %llu on %s).\n",
2347 mdname(conf->mddev),
2348 (unsigned long long)s,
2349 bdn);
2350 } else if (test_bit(R5_ReWrite, &sh->dev[i].flags)) {
2351 /* Oh, no!!! */
2352 set_bad = 1;
2353 printk_ratelimited(
2354 KERN_WARNING
2355 "md/raid:%s: read error NOT corrected!! "
2356 "(sector %llu on %s).\n",
2357 mdname(conf->mddev),
2358 (unsigned long long)s,
2359 bdn);
2360 } else if (atomic_read(&rdev->read_errors)
2361 > conf->max_nr_stripes)
2362 printk(KERN_WARNING
2363 "md/raid:%s: Too many read errors, failing device %s.\n",
2364 mdname(conf->mddev), bdn);
2365 else
2366 retry = 1;
2367 if (set_bad && test_bit(In_sync, &rdev->flags)
2368 && !test_bit(R5_ReadNoMerge, &sh->dev[i].flags))
2369 retry = 1;
2370 if (retry)
2371 if (test_bit(R5_ReadNoMerge, &sh->dev[i].flags)) {
2372 set_bit(R5_ReadError, &sh->dev[i].flags);
2373 clear_bit(R5_ReadNoMerge, &sh->dev[i].flags);
2374 } else
2375 set_bit(R5_ReadNoMerge, &sh->dev[i].flags);
2376 else {
2377 clear_bit(R5_ReadError, &sh->dev[i].flags);
2378 clear_bit(R5_ReWrite, &sh->dev[i].flags);
2379 if (!(set_bad
2380 && test_bit(In_sync, &rdev->flags)
2381 && rdev_set_badblocks(
2382 rdev, sh->sector, STRIPE_SECTORS, 0)))
2383 md_error(conf->mddev, rdev);
2384 }
2385 }
2386 rdev_dec_pending(rdev, conf->mddev);
2387 clear_bit(R5_LOCKED, &sh->dev[i].flags);
2388 set_bit(STRIPE_HANDLE, &sh->state);
2389 release_stripe(sh);
2390 }
2391
2392 static void raid5_end_write_request(struct bio *bi, int error)
2393 {
2394 struct stripe_head *sh = bi->bi_private;
2395 struct r5conf *conf = sh->raid_conf;
2396 int disks = sh->disks, i;
2397 struct md_rdev *uninitialized_var(rdev);
2398 int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
2399 sector_t first_bad;
2400 int bad_sectors;
2401 int replacement = 0;
2402
2403 for (i = 0 ; i < disks; i++) {
2404 if (bi == &sh->dev[i].req) {
2405 rdev = conf->disks[i].rdev;
2406 break;
2407 }
2408 if (bi == &sh->dev[i].rreq) {
2409 rdev = conf->disks[i].replacement;
2410 if (rdev)
2411 replacement = 1;
2412 else
2413 /* rdev was removed and 'replacement'
2414 * replaced it. rdev is not removed
2415 * until all requests are finished.
2416 */
2417 rdev = conf->disks[i].rdev;
2418 break;
2419 }
2420 }
2421 pr_debug("end_write_request %llu/%d, count %d, uptodate: %d.\n",
2422 (unsigned long long)sh->sector, i, atomic_read(&sh->count),
2423 uptodate);
2424 if (i == disks) {
2425 BUG();
2426 return;
2427 }
2428
2429 if (replacement) {
2430 if (!uptodate)
2431 md_error(conf->mddev, rdev);
2432 else if (is_badblock(rdev, sh->sector,
2433 STRIPE_SECTORS,
2434 &first_bad, &bad_sectors))
2435 set_bit(R5_MadeGoodRepl, &sh->dev[i].flags);
2436 } else {
2437 if (!uptodate) {
2438 set_bit(STRIPE_DEGRADED, &sh->state);
2439 set_bit(WriteErrorSeen, &rdev->flags);
2440 set_bit(R5_WriteError, &sh->dev[i].flags);
2441 if (!test_and_set_bit(WantReplacement, &rdev->flags))
2442 set_bit(MD_RECOVERY_NEEDED,
2443 &rdev->mddev->recovery);
2444 } else if (is_badblock(rdev, sh->sector,
2445 STRIPE_SECTORS,
2446 &first_bad, &bad_sectors)) {
2447 set_bit(R5_MadeGood, &sh->dev[i].flags);
2448 if (test_bit(R5_ReadError, &sh->dev[i].flags))
2449 /* That was a successful write so make
2450 * sure it looks like we already did
2451 * a re-write.
2452 */
2453 set_bit(R5_ReWrite, &sh->dev[i].flags);
2454 }
2455 }
2456 rdev_dec_pending(rdev, conf->mddev);
2457
2458 if (sh->batch_head && !uptodate && !replacement)
2459 set_bit(STRIPE_BATCH_ERR, &sh->batch_head->state);
2460
2461 if (!test_and_clear_bit(R5_DOUBLE_LOCKED, &sh->dev[i].flags))
2462 clear_bit(R5_LOCKED, &sh->dev[i].flags);
2463 set_bit(STRIPE_HANDLE, &sh->state);
2464 release_stripe(sh);
2465
2466 if (sh->batch_head && sh != sh->batch_head)
2467 release_stripe(sh->batch_head);
2468 }
2469
2470 static sector_t compute_blocknr(struct stripe_head *sh, int i, int previous);
2471
2472 static void raid5_build_block(struct stripe_head *sh, int i, int previous)
2473 {
2474 struct r5dev *dev = &sh->dev[i];
2475
2476 bio_init(&dev->req);
2477 dev->req.bi_io_vec = &dev->vec;
2478 dev->req.bi_max_vecs = 1;
2479 dev->req.bi_private = sh;
2480
2481 bio_init(&dev->rreq);
2482 dev->rreq.bi_io_vec = &dev->rvec;
2483 dev->rreq.bi_max_vecs = 1;
2484 dev->rreq.bi_private = sh;
2485
2486 dev->flags = 0;
2487 dev->sector = compute_blocknr(sh, i, previous);
2488 }
2489
2490 static void error(struct mddev *mddev, struct md_rdev *rdev)
2491 {
2492 char b[BDEVNAME_SIZE];
2493 struct r5conf *conf = mddev->private;
2494 unsigned long flags;
2495 pr_debug("raid456: error called\n");
2496
2497 spin_lock_irqsave(&conf->device_lock, flags);
2498 clear_bit(In_sync, &rdev->flags);
2499 mddev->degraded = calc_degraded(conf);
2500 spin_unlock_irqrestore(&conf->device_lock, flags);
2501 set_bit(MD_RECOVERY_INTR, &mddev->recovery);
2502
2503 set_bit(Blocked, &rdev->flags);
2504 set_bit(Faulty, &rdev->flags);
2505 set_bit(MD_CHANGE_DEVS, &mddev->flags);
2506 printk(KERN_ALERT
2507 "md/raid:%s: Disk failure on %s, disabling device.\n"
2508 "md/raid:%s: Operation continuing on %d devices.\n",
2509 mdname(mddev),
2510 bdevname(rdev->bdev, b),
2511 mdname(mddev),
2512 conf->raid_disks - mddev->degraded);
2513 }
2514
2515 /*
2516 * Input: a 'big' sector number,
2517 * Output: index of the data and parity disk, and the sector # in them.
2518 */
2519 static sector_t raid5_compute_sector(struct r5conf *conf, sector_t r_sector,
2520 int previous, int *dd_idx,
2521 struct stripe_head *sh)
2522 {
2523 sector_t stripe, stripe2;
2524 sector_t chunk_number;
2525 unsigned int chunk_offset;
2526 int pd_idx, qd_idx;
2527 int ddf_layout = 0;
2528 sector_t new_sector;
2529 int algorithm = previous ? conf->prev_algo
2530 : conf->algorithm;
2531 int sectors_per_chunk = previous ? conf->prev_chunk_sectors
2532 : conf->chunk_sectors;
2533 int raid_disks = previous ? conf->previous_raid_disks
2534 : conf->raid_disks;
2535 int data_disks = raid_disks - conf->max_degraded;
2536
2537 /* First compute the information on this sector */
2538
2539 /*
2540 * Compute the chunk number and the sector offset inside the chunk
2541 */
2542 chunk_offset = sector_div(r_sector, sectors_per_chunk);
2543 chunk_number = r_sector;
2544
2545 /*
2546 * Compute the stripe number
2547 */
2548 stripe = chunk_number;
2549 *dd_idx = sector_div(stripe, data_disks);
2550 stripe2 = stripe;
2551 /*
2552 * Select the parity disk based on the user selected algorithm.
2553 */
2554 pd_idx = qd_idx = -1;
2555 switch(conf->level) {
2556 case 4:
2557 pd_idx = data_disks;
2558 break;
2559 case 5:
2560 switch (algorithm) {
2561 case ALGORITHM_LEFT_ASYMMETRIC:
2562 pd_idx = data_disks - sector_div(stripe2, raid_disks);
2563 if (*dd_idx >= pd_idx)
2564 (*dd_idx)++;
2565 break;
2566 case ALGORITHM_RIGHT_ASYMMETRIC:
2567 pd_idx = sector_div(stripe2, raid_disks);
2568 if (*dd_idx >= pd_idx)
2569 (*dd_idx)++;
2570 break;
2571 case ALGORITHM_LEFT_SYMMETRIC:
2572 pd_idx = data_disks - sector_div(stripe2, raid_disks);
2573 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
2574 break;
2575 case ALGORITHM_RIGHT_SYMMETRIC:
2576 pd_idx = sector_div(stripe2, raid_disks);
2577 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
2578 break;
2579 case ALGORITHM_PARITY_0:
2580 pd_idx = 0;
2581 (*dd_idx)++;
2582 break;
2583 case ALGORITHM_PARITY_N:
2584 pd_idx = data_disks;
2585 break;
2586 default:
2587 BUG();
2588 }
2589 break;
2590 case 6:
2591
2592 switch (algorithm) {
2593 case ALGORITHM_LEFT_ASYMMETRIC:
2594 pd_idx = raid_disks - 1 - sector_div(stripe2, raid_disks);
2595 qd_idx = pd_idx + 1;
2596 if (pd_idx == raid_disks-1) {
2597 (*dd_idx)++; /* Q D D D P */
2598 qd_idx = 0;
2599 } else if (*dd_idx >= pd_idx)
2600 (*dd_idx) += 2; /* D D P Q D */
2601 break;
2602 case ALGORITHM_RIGHT_ASYMMETRIC:
2603 pd_idx = sector_div(stripe2, raid_disks);
2604 qd_idx = pd_idx + 1;
2605 if (pd_idx == raid_disks-1) {
2606 (*dd_idx)++; /* Q D D D P */
2607 qd_idx = 0;
2608 } else if (*dd_idx >= pd_idx)
2609 (*dd_idx) += 2; /* D D P Q D */
2610 break;
2611 case ALGORITHM_LEFT_SYMMETRIC:
2612 pd_idx = raid_disks - 1 - sector_div(stripe2, raid_disks);
2613 qd_idx = (pd_idx + 1) % raid_disks;
2614 *dd_idx = (pd_idx + 2 + *dd_idx) % raid_disks;
2615 break;
2616 case ALGORITHM_RIGHT_SYMMETRIC:
2617 pd_idx = sector_div(stripe2, raid_disks);
2618 qd_idx = (pd_idx + 1) % raid_disks;
2619 *dd_idx = (pd_idx + 2 + *dd_idx) % raid_disks;
2620 break;
2621
2622 case ALGORITHM_PARITY_0:
2623 pd_idx = 0;
2624 qd_idx = 1;
2625 (*dd_idx) += 2;
2626 break;
2627 case ALGORITHM_PARITY_N:
2628 pd_idx = data_disks;
2629 qd_idx = data_disks + 1;
2630 break;
2631
2632 case ALGORITHM_ROTATING_ZERO_RESTART:
2633 /* Exactly the same as RIGHT_ASYMMETRIC, but or
2634 * of blocks for computing Q is different.
2635 */
2636 pd_idx = sector_div(stripe2, raid_disks);
2637 qd_idx = pd_idx + 1;
2638 if (pd_idx == raid_disks-1) {
2639 (*dd_idx)++; /* Q D D D P */
2640 qd_idx = 0;
2641 } else if (*dd_idx >= pd_idx)
2642 (*dd_idx) += 2; /* D D P Q D */
2643 ddf_layout = 1;
2644 break;
2645
2646 case ALGORITHM_ROTATING_N_RESTART:
2647 /* Same a left_asymmetric, by first stripe is
2648 * D D D P Q rather than
2649 * Q D D D P
2650 */
2651 stripe2 += 1;
2652 pd_idx = raid_disks - 1 - sector_div(stripe2, raid_disks);
2653 qd_idx = pd_idx + 1;
2654 if (pd_idx == raid_disks-1) {
2655 (*dd_idx)++; /* Q D D D P */
2656 qd_idx = 0;
2657 } else if (*dd_idx >= pd_idx)
2658 (*dd_idx) += 2; /* D D P Q D */
2659 ddf_layout = 1;
2660 break;
2661
2662 case ALGORITHM_ROTATING_N_CONTINUE:
2663 /* Same as left_symmetric but Q is before P */
2664 pd_idx = raid_disks - 1 - sector_div(stripe2, raid_disks);
2665 qd_idx = (pd_idx + raid_disks - 1) % raid_disks;
2666 *dd_idx = (pd_idx + 1 + *dd_idx) % raid_disks;
2667 ddf_layout = 1;
2668 break;
2669
2670 case ALGORITHM_LEFT_ASYMMETRIC_6:
2671 /* RAID5 left_asymmetric, with Q on last device */
2672 pd_idx = data_disks - sector_div(stripe2, raid_disks-1);
2673 if (*dd_idx >= pd_idx)
2674 (*dd_idx)++;
2675 qd_idx = raid_disks - 1;
2676 break;
2677
2678 case ALGORITHM_RIGHT_ASYMMETRIC_6:
2679 pd_idx = sector_div(stripe2, raid_disks-1);
2680 if (*dd_idx >= pd_idx)
2681 (*dd_idx)++;
2682 qd_idx = raid_disks - 1;
2683 break;
2684
2685 case ALGORITHM_LEFT_SYMMETRIC_6:
2686 pd_idx = data_disks - sector_div(stripe2, raid_disks-1);
2687 *dd_idx = (pd_idx + 1 + *dd_idx) % (raid_disks-1);
2688 qd_idx = raid_disks - 1;
2689 break;
2690
2691 case ALGORITHM_RIGHT_SYMMETRIC_6:
2692 pd_idx = sector_div(stripe2, raid_disks-1);
2693 *dd_idx = (pd_idx + 1 + *dd_idx) % (raid_disks-1);
2694 qd_idx = raid_disks - 1;
2695 break;
2696
2697 case ALGORITHM_PARITY_0_6:
2698 pd_idx = 0;
2699 (*dd_idx)++;
2700 qd_idx = raid_disks - 1;
2701 break;
2702
2703 default:
2704 BUG();
2705 }
2706 break;
2707 }
2708
2709 if (sh) {
2710 sh->pd_idx = pd_idx;
2711 sh->qd_idx = qd_idx;
2712 sh->ddf_layout = ddf_layout;
2713 }
2714 /*
2715 * Finally, compute the new sector number
2716 */
2717 new_sector = (sector_t)stripe * sectors_per_chunk + chunk_offset;
2718 return new_sector;
2719 }
2720
2721 static sector_t compute_blocknr(struct stripe_head *sh, int i, int previous)
2722 {
2723 struct r5conf *conf = sh->raid_conf;
2724 int raid_disks = sh->disks;
2725 int data_disks = raid_disks - conf->max_degraded;
2726 sector_t new_sector = sh->sector, check;
2727 int sectors_per_chunk = previous ? conf->prev_chunk_sectors
2728 : conf->chunk_sectors;
2729 int algorithm = previous ? conf->prev_algo
2730 : conf->algorithm;
2731 sector_t stripe;
2732 int chunk_offset;
2733 sector_t chunk_number;
2734 int dummy1, dd_idx = i;
2735 sector_t r_sector;
2736 struct stripe_head sh2;
2737
2738 chunk_offset = sector_div(new_sector, sectors_per_chunk);
2739 stripe = new_sector;
2740
2741 if (i == sh->pd_idx)
2742 return 0;
2743 switch(conf->level) {
2744 case 4: break;
2745 case 5:
2746 switch (algorithm) {
2747 case ALGORITHM_LEFT_ASYMMETRIC:
2748 case ALGORITHM_RIGHT_ASYMMETRIC:
2749 if (i > sh->pd_idx)
2750 i--;
2751 break;
2752 case ALGORITHM_LEFT_SYMMETRIC:
2753 case ALGORITHM_RIGHT_SYMMETRIC:
2754 if (i < sh->pd_idx)
2755 i += raid_disks;
2756 i -= (sh->pd_idx + 1);
2757 break;
2758 case ALGORITHM_PARITY_0:
2759 i -= 1;
2760 break;
2761 case ALGORITHM_PARITY_N:
2762 break;
2763 default:
2764 BUG();
2765 }
2766 break;
2767 case 6:
2768 if (i == sh->qd_idx)
2769 return 0; /* It is the Q disk */
2770 switch (algorithm) {
2771 case ALGORITHM_LEFT_ASYMMETRIC:
2772 case ALGORITHM_RIGHT_ASYMMETRIC:
2773 case ALGORITHM_ROTATING_ZERO_RESTART:
2774 case ALGORITHM_ROTATING_N_RESTART:
2775 if (sh->pd_idx == raid_disks-1)
2776 i--; /* Q D D D P */
2777 else if (i > sh->pd_idx)
2778 i -= 2; /* D D P Q D */
2779 break;
2780 case ALGORITHM_LEFT_SYMMETRIC:
2781 case ALGORITHM_RIGHT_SYMMETRIC:
2782 if (sh->pd_idx == raid_disks-1)
2783 i--; /* Q D D D P */
2784 else {
2785 /* D D P Q D */
2786 if (i < sh->pd_idx)
2787 i += raid_disks;
2788 i -= (sh->pd_idx + 2);
2789 }
2790 break;
2791 case ALGORITHM_PARITY_0:
2792 i -= 2;
2793 break;
2794 case ALGORITHM_PARITY_N:
2795 break;
2796 case ALGORITHM_ROTATING_N_CONTINUE:
2797 /* Like left_symmetric, but P is before Q */
2798 if (sh->pd_idx == 0)
2799 i--; /* P D D D Q */
2800 else {
2801 /* D D Q P D */
2802 if (i < sh->pd_idx)
2803 i += raid_disks;
2804 i -= (sh->pd_idx + 1);
2805 }
2806 break;
2807 case ALGORITHM_LEFT_ASYMMETRIC_6:
2808 case ALGORITHM_RIGHT_ASYMMETRIC_6:
2809 if (i > sh->pd_idx)
2810 i--;
2811 break;
2812 case ALGORITHM_LEFT_SYMMETRIC_6:
2813 case ALGORITHM_RIGHT_SYMMETRIC_6:
2814 if (i < sh->pd_idx)
2815 i += data_disks + 1;
2816 i -= (sh->pd_idx + 1);
2817 break;
2818 case ALGORITHM_PARITY_0_6:
2819 i -= 1;
2820 break;
2821 default:
2822 BUG();
2823 }
2824 break;
2825 }
2826
2827 chunk_number = stripe * data_disks + i;
2828 r_sector = chunk_number * sectors_per_chunk + chunk_offset;
2829
2830 check = raid5_compute_sector(conf, r_sector,
2831 previous, &dummy1, &sh2);
2832 if (check != sh->sector || dummy1 != dd_idx || sh2.pd_idx != sh->pd_idx
2833 || sh2.qd_idx != sh->qd_idx) {
2834 printk(KERN_ERR "md/raid:%s: compute_blocknr: map not correct\n",
2835 mdname(conf->mddev));
2836 return 0;
2837 }
2838 return r_sector;
2839 }
2840
2841 static void
2842 schedule_reconstruction(struct stripe_head *sh, struct stripe_head_state *s,
2843 int rcw, int expand)
2844 {
2845 int i, pd_idx = sh->pd_idx, qd_idx = sh->qd_idx, disks = sh->disks;
2846 struct r5conf *conf = sh->raid_conf;
2847 int level = conf->level;
2848
2849 if (rcw) {
2850
2851 for (i = disks; i--; ) {
2852 struct r5dev *dev = &sh->dev[i];
2853
2854 if (dev->towrite) {
2855 set_bit(R5_LOCKED, &dev->flags);
2856 set_bit(R5_Wantdrain, &dev->flags);
2857 if (!expand)
2858 clear_bit(R5_UPTODATE, &dev->flags);
2859 s->locked++;
2860 }
2861 }
2862 /* if we are not expanding this is a proper write request, and
2863 * there will be bios with new data to be drained into the
2864 * stripe cache
2865 */
2866 if (!expand) {
2867 if (!s->locked)
2868 /* False alarm, nothing to do */
2869 return;
2870 sh->reconstruct_state = reconstruct_state_drain_run;
2871 set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
2872 } else
2873 sh->reconstruct_state = reconstruct_state_run;
2874
2875 set_bit(STRIPE_OP_RECONSTRUCT, &s->ops_request);
2876
2877 if (s->locked + conf->max_degraded == disks)
2878 if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
2879 atomic_inc(&conf->pending_full_writes);
2880 } else {
2881 BUG_ON(!(test_bit(R5_UPTODATE, &sh->dev[pd_idx].flags) ||
2882 test_bit(R5_Wantcompute, &sh->dev[pd_idx].flags)));
2883 BUG_ON(level == 6 &&
2884 (!(test_bit(R5_UPTODATE, &sh->dev[qd_idx].flags) ||
2885 test_bit(R5_Wantcompute, &sh->dev[qd_idx].flags))));
2886
2887 for (i = disks; i--; ) {
2888 struct r5dev *dev = &sh->dev[i];
2889 if (i == pd_idx || i == qd_idx)
2890 continue;
2891
2892 if (dev->towrite &&
2893 (test_bit(R5_UPTODATE, &dev->flags) ||
2894 test_bit(R5_Wantcompute, &dev->flags))) {
2895 set_bit(R5_Wantdrain, &dev->flags);
2896 set_bit(R5_LOCKED, &dev->flags);
2897 clear_bit(R5_UPTODATE, &dev->flags);
2898 s->locked++;
2899 }
2900 }
2901 if (!s->locked)
2902 /* False alarm - nothing to do */
2903 return;
2904 sh->reconstruct_state = reconstruct_state_prexor_drain_run;
2905 set_bit(STRIPE_OP_PREXOR, &s->ops_request);
2906 set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
2907 set_bit(STRIPE_OP_RECONSTRUCT, &s->ops_request);
2908 }
2909
2910 /* keep the parity disk(s) locked while asynchronous operations
2911 * are in flight
2912 */
2913 set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
2914 clear_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
2915 s->locked++;
2916
2917 if (level == 6) {
2918 int qd_idx = sh->qd_idx;
2919 struct r5dev *dev = &sh->dev[qd_idx];
2920
2921 set_bit(R5_LOCKED, &dev->flags);
2922 clear_bit(R5_UPTODATE, &dev->flags);
2923 s->locked++;
2924 }
2925
2926 pr_debug("%s: stripe %llu locked: %d ops_request: %lx\n",
2927 __func__, (unsigned long long)sh->sector,
2928 s->locked, s->ops_request);
2929 }
2930
2931 /*
2932 * Each stripe/dev can have one or more bion attached.
2933 * toread/towrite point to the first in a chain.
2934 * The bi_next chain must be in order.
2935 */
2936 static int add_stripe_bio(struct stripe_head *sh, struct bio *bi, int dd_idx,
2937 int forwrite, int previous)
2938 {
2939 struct bio **bip;
2940 struct r5conf *conf = sh->raid_conf;
2941 int firstwrite=0;
2942
2943 pr_debug("adding bi b#%llu to stripe s#%llu\n",
2944 (unsigned long long)bi->bi_iter.bi_sector,
2945 (unsigned long long)sh->sector);
2946
2947 /*
2948 * If several bio share a stripe. The bio bi_phys_segments acts as a
2949 * reference count to avoid race. The reference count should already be
2950 * increased before this function is called (for example, in
2951 * make_request()), so other bio sharing this stripe will not free the
2952 * stripe. If a stripe is owned by one stripe, the stripe lock will
2953 * protect it.
2954 */
2955 spin_lock_irq(&sh->stripe_lock);
2956 /* Don't allow new IO added to stripes in batch list */
2957 if (sh->batch_head)
2958 goto overlap;
2959 if (forwrite) {
2960 bip = &sh->dev[dd_idx].towrite;
2961 if (*bip == NULL)
2962 firstwrite = 1;
2963 } else
2964 bip = &sh->dev[dd_idx].toread;
2965 while (*bip && (*bip)->bi_iter.bi_sector < bi->bi_iter.bi_sector) {
2966 if (bio_end_sector(*bip) > bi->bi_iter.bi_sector)
2967 goto overlap;
2968 bip = & (*bip)->bi_next;
2969 }
2970 if (*bip && (*bip)->bi_iter.bi_sector < bio_end_sector(bi))
2971 goto overlap;
2972
2973 if (!forwrite || previous)
2974 clear_bit(STRIPE_BATCH_READY, &sh->state);
2975
2976 BUG_ON(*bip && bi->bi_next && (*bip) != bi->bi_next);
2977 if (*bip)
2978 bi->bi_next = *bip;
2979 *bip = bi;
2980 raid5_inc_bi_active_stripes(bi);
2981
2982 if (forwrite) {
2983 /* check if page is covered */
2984 sector_t sector = sh->dev[dd_idx].sector;
2985 for (bi=sh->dev[dd_idx].towrite;
2986 sector < sh->dev[dd_idx].sector + STRIPE_SECTORS &&
2987 bi && bi->bi_iter.bi_sector <= sector;
2988 bi = r5_next_bio(bi, sh->dev[dd_idx].sector)) {
2989 if (bio_end_sector(bi) >= sector)
2990 sector = bio_end_sector(bi);
2991 }
2992 if (sector >= sh->dev[dd_idx].sector + STRIPE_SECTORS)
2993 if (!test_and_set_bit(R5_OVERWRITE, &sh->dev[dd_idx].flags))
2994 sh->overwrite_disks++;
2995 }
2996
2997 pr_debug("added bi b#%llu to stripe s#%llu, disk %d.\n",
2998 (unsigned long long)(*bip)->bi_iter.bi_sector,
2999 (unsigned long long)sh->sector, dd_idx);
3000
3001 if (conf->mddev->bitmap && firstwrite) {
3002 /* Cannot hold spinlock over bitmap_startwrite,
3003 * but must ensure this isn't added to a batch until
3004 * we have added to the bitmap and set bm_seq.
3005 * So set STRIPE_BITMAP_PENDING to prevent
3006 * batching.
3007 * If multiple add_stripe_bio() calls race here they
3008 * much all set STRIPE_BITMAP_PENDING. So only the first one
3009 * to complete "bitmap_startwrite" gets to set
3010 * STRIPE_BIT_DELAY. This is important as once a stripe
3011 * is added to a batch, STRIPE_BIT_DELAY cannot be changed
3012 * any more.
3013 */
3014 set_bit(STRIPE_BITMAP_PENDING, &sh->state);
3015 spin_unlock_irq(&sh->stripe_lock);
3016 bitmap_startwrite(conf->mddev->bitmap, sh->sector,
3017 STRIPE_SECTORS, 0);
3018 spin_lock_irq(&sh->stripe_lock);
3019 clear_bit(STRIPE_BITMAP_PENDING, &sh->state);
3020 if (!sh->batch_head) {
3021 sh->bm_seq = conf->seq_flush+1;
3022 set_bit(STRIPE_BIT_DELAY, &sh->state);
3023 }
3024 }
3025 spin_unlock_irq(&sh->stripe_lock);
3026
3027 if (stripe_can_batch(sh))
3028 stripe_add_to_batch_list(conf, sh);
3029 return 1;
3030
3031 overlap:
3032 set_bit(R5_Overlap, &sh->dev[dd_idx].flags);
3033 spin_unlock_irq(&sh->stripe_lock);
3034 return 0;
3035 }
3036
3037 static void end_reshape(struct r5conf *conf);
3038
3039 static void stripe_set_idx(sector_t stripe, struct r5conf *conf, int previous,
3040 struct stripe_head *sh)
3041 {
3042 int sectors_per_chunk =
3043 previous ? conf->prev_chunk_sectors : conf->chunk_sectors;
3044 int dd_idx;
3045 int chunk_offset = sector_div(stripe, sectors_per_chunk);
3046 int disks = previous ? conf->previous_raid_disks : conf->raid_disks;
3047
3048 raid5_compute_sector(conf,
3049 stripe * (disks - conf->max_degraded)
3050 *sectors_per_chunk + chunk_offset,
3051 previous,
3052 &dd_idx, sh);
3053 }
3054
3055 static void
3056 handle_failed_stripe(struct r5conf *conf, struct stripe_head *sh,
3057 struct stripe_head_state *s, int disks,
3058 struct bio **return_bi)
3059 {
3060 int i;
3061 BUG_ON(sh->batch_head);
3062 for (i = disks; i--; ) {
3063 struct bio *bi;
3064 int bitmap_end = 0;
3065
3066 if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
3067 struct md_rdev *rdev;
3068 rcu_read_lock();
3069 rdev = rcu_dereference(conf->disks[i].rdev);
3070 if (rdev && test_bit(In_sync, &rdev->flags))
3071 atomic_inc(&rdev->nr_pending);
3072 else
3073 rdev = NULL;
3074 rcu_read_unlock();
3075 if (rdev) {
3076 if (!rdev_set_badblocks(
3077 rdev,
3078 sh->sector,
3079 STRIPE_SECTORS, 0))
3080 md_error(conf->mddev, rdev);
3081 rdev_dec_pending(rdev, conf->mddev);
3082 }
3083 }
3084 spin_lock_irq(&sh->stripe_lock);
3085 /* fail all writes first */
3086 bi = sh->dev[i].towrite;
3087 sh->dev[i].towrite = NULL;
3088 sh->overwrite_disks = 0;
3089 spin_unlock_irq(&sh->stripe_lock);
3090 if (bi)
3091 bitmap_end = 1;
3092
3093 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
3094 wake_up(&conf->wait_for_overlap);
3095
3096 while (bi && bi->bi_iter.bi_sector <
3097 sh->dev[i].sector + STRIPE_SECTORS) {
3098 struct bio *nextbi = r5_next_bio(bi, sh->dev[i].sector);
3099 clear_bit(BIO_UPTODATE, &bi->bi_flags);
3100 if (!raid5_dec_bi_active_stripes(bi)) {
3101 md_write_end(conf->mddev);
3102 bi->bi_next = *return_bi;
3103 *return_bi = bi;
3104 }
3105 bi = nextbi;
3106 }
3107 if (bitmap_end)
3108 bitmap_endwrite(conf->mddev->bitmap, sh->sector,
3109 STRIPE_SECTORS, 0, 0);
3110 bitmap_end = 0;
3111 /* and fail all 'written' */
3112 bi = sh->dev[i].written;
3113 sh->dev[i].written = NULL;
3114 if (test_and_clear_bit(R5_SkipCopy, &sh->dev[i].flags)) {
3115 WARN_ON(test_bit(R5_UPTODATE, &sh->dev[i].flags));
3116 sh->dev[i].page = sh->dev[i].orig_page;
3117 }
3118
3119 if (bi) bitmap_end = 1;
3120 while (bi && bi->bi_iter.bi_sector <
3121 sh->dev[i].sector + STRIPE_SECTORS) {
3122 struct bio *bi2 = r5_next_bio(bi, sh->dev[i].sector);
3123 clear_bit(BIO_UPTODATE, &bi->bi_flags);
3124 if (!raid5_dec_bi_active_stripes(bi)) {
3125 md_write_end(conf->mddev);
3126 bi->bi_next = *return_bi;
3127 *return_bi = bi;
3128 }
3129 bi = bi2;
3130 }
3131
3132 /* fail any reads if this device is non-operational and
3133 * the data has not reached the cache yet.
3134 */
3135 if (!test_bit(R5_Wantfill, &sh->dev[i].flags) &&
3136 (!test_bit(R5_Insync, &sh->dev[i].flags) ||
3137 test_bit(R5_ReadError, &sh->dev[i].flags))) {
3138 spin_lock_irq(&sh->stripe_lock);
3139 bi = sh->dev[i].toread;
3140 sh->dev[i].toread = NULL;
3141 spin_unlock_irq(&sh->stripe_lock);
3142 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
3143 wake_up(&conf->wait_for_overlap);
3144 while (bi && bi->bi_iter.bi_sector <
3145 sh->dev[i].sector + STRIPE_SECTORS) {
3146 struct bio *nextbi =
3147 r5_next_bio(bi, sh->dev[i].sector);
3148 clear_bit(BIO_UPTODATE, &bi->bi_flags);
3149 if (!raid5_dec_bi_active_stripes(bi)) {
3150 bi->bi_next = *return_bi;
3151 *return_bi = bi;
3152 }
3153 bi = nextbi;
3154 }
3155 }
3156 if (bitmap_end)
3157 bitmap_endwrite(conf->mddev->bitmap, sh->sector,
3158 STRIPE_SECTORS, 0, 0);
3159 /* If we were in the middle of a write the parity block might
3160 * still be locked - so just clear all R5_LOCKED flags
3161 */
3162 clear_bit(R5_LOCKED, &sh->dev[i].flags);
3163 }
3164
3165 if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
3166 if (atomic_dec_and_test(&conf->pending_full_writes))
3167 md_wakeup_thread(conf->mddev->thread);
3168 }
3169
3170 static void
3171 handle_failed_sync(struct r5conf *conf, struct stripe_head *sh,
3172 struct stripe_head_state *s)
3173 {
3174 int abort = 0;
3175 int i;
3176
3177 BUG_ON(sh->batch_head);
3178 clear_bit(STRIPE_SYNCING, &sh->state);
3179 if (test_and_clear_bit(R5_Overlap, &sh->dev[sh->pd_idx].flags))
3180 wake_up(&conf->wait_for_overlap);
3181 s->syncing = 0;
3182 s->replacing = 0;
3183 /* There is nothing more to do for sync/check/repair.
3184 * Don't even need to abort as that is handled elsewhere
3185 * if needed, and not always wanted e.g. if there is a known
3186 * bad block here.
3187 * For recover/replace we need to record a bad block on all
3188 * non-sync devices, or abort the recovery
3189 */
3190 if (test_bit(MD_RECOVERY_RECOVER, &conf->mddev->recovery)) {
3191 /* During recovery devices cannot be removed, so
3192 * locking and refcounting of rdevs is not needed
3193 */
3194 for (i = 0; i < conf->raid_disks; i++) {
3195 struct md_rdev *rdev = conf->disks[i].rdev;
3196 if (rdev
3197 && !test_bit(Faulty, &rdev->flags)
3198 && !test_bit(In_sync, &rdev->flags)
3199 && !rdev_set_badblocks(rdev, sh->sector,
3200 STRIPE_SECTORS, 0))
3201 abort = 1;
3202 rdev = conf->disks[i].replacement;
3203 if (rdev
3204 && !test_bit(Faulty, &rdev->flags)
3205 && !test_bit(In_sync, &rdev->flags)
3206 && !rdev_set_badblocks(rdev, sh->sector,
3207 STRIPE_SECTORS, 0))
3208 abort = 1;
3209 }
3210 if (abort)
3211 conf->recovery_disabled =
3212 conf->mddev->recovery_disabled;
3213 }
3214 md_done_sync(conf->mddev, STRIPE_SECTORS, !abort);
3215 }
3216
3217 static int want_replace(struct stripe_head *sh, int disk_idx)
3218 {
3219 struct md_rdev *rdev;
3220 int rv = 0;
3221 /* Doing recovery so rcu locking not required */
3222 rdev = sh->raid_conf->disks[disk_idx].replacement;
3223 if (rdev
3224 && !test_bit(Faulty, &rdev->flags)
3225 && !test_bit(In_sync, &rdev->flags)
3226 && (rdev->recovery_offset <= sh->sector
3227 || rdev->mddev->recovery_cp <= sh->sector))
3228 rv = 1;
3229
3230 return rv;
3231 }
3232
3233 /* fetch_block - checks the given member device to see if its data needs
3234 * to be read or computed to satisfy a request.
3235 *
3236 * Returns 1 when no more member devices need to be checked, otherwise returns
3237 * 0 to tell the loop in handle_stripe_fill to continue
3238 */
3239
3240 static int need_this_block(struct stripe_head *sh, struct stripe_head_state *s,
3241 int disk_idx, int disks)
3242 {
3243 struct r5dev *dev = &sh->dev[disk_idx];
3244 struct r5dev *fdev[2] = { &sh->dev[s->failed_num[0]],
3245 &sh->dev[s->failed_num[1]] };
3246 int i;
3247
3248
3249 if (test_bit(R5_LOCKED, &dev->flags) ||
3250 test_bit(R5_UPTODATE, &dev->flags))
3251 /* No point reading this as we already have it or have
3252 * decided to get it.
3253 */
3254 return 0;
3255
3256 if (dev->toread ||
3257 (dev->towrite && !test_bit(R5_OVERWRITE, &dev->flags)))
3258 /* We need this block to directly satisfy a request */
3259 return 1;
3260
3261 if (s->syncing || s->expanding ||
3262 (s->replacing && want_replace(sh, disk_idx)))
3263 /* When syncing, or expanding we read everything.
3264 * When replacing, we need the replaced block.
3265 */
3266 return 1;
3267
3268 if ((s->failed >= 1 && fdev[0]->toread) ||
3269 (s->failed >= 2 && fdev[1]->toread))
3270 /* If we want to read from a failed device, then
3271 * we need to actually read every other device.
3272 */
3273 return 1;
3274
3275 /* Sometimes neither read-modify-write nor reconstruct-write
3276 * cycles can work. In those cases we read every block we
3277 * can. Then the parity-update is certain to have enough to
3278 * work with.
3279 * This can only be a problem when we need to write something,
3280 * and some device has failed. If either of those tests
3281 * fail we need look no further.
3282 */
3283 if (!s->failed || !s->to_write)
3284 return 0;
3285
3286 if (test_bit(R5_Insync, &dev->flags) &&
3287 !test_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
3288 /* Pre-reads at not permitted until after short delay
3289 * to gather multiple requests. However if this
3290 * device is no Insync, the block could only be be computed
3291 * and there is no need to delay that.
3292 */
3293 return 0;
3294
3295 for (i = 0; i < s->failed; i++) {
3296 if (fdev[i]->towrite &&
3297 !test_bit(R5_UPTODATE, &fdev[i]->flags) &&
3298 !test_bit(R5_OVERWRITE, &fdev[i]->flags))
3299 /* If we have a partial write to a failed
3300 * device, then we will need to reconstruct
3301 * the content of that device, so all other
3302 * devices must be read.
3303 */
3304 return 1;
3305 }
3306
3307 /* If we are forced to do a reconstruct-write, either because
3308 * the current RAID6 implementation only supports that, or
3309 * or because parity cannot be trusted and we are currently
3310 * recovering it, there is extra need to be careful.
3311 * If one of the devices that we would need to read, because
3312 * it is not being overwritten (and maybe not written at all)
3313 * is missing/faulty, then we need to read everything we can.
3314 */
3315 if (sh->raid_conf->level != 6 &&
3316 sh->sector < sh->raid_conf->mddev->recovery_cp)
3317 /* reconstruct-write isn't being forced */
3318 return 0;
3319 for (i = 0; i < s->failed; i++) {
3320 if (s->failed_num[i] != sh->pd_idx &&
3321 s->failed_num[i] != sh->qd_idx &&
3322 !test_bit(R5_UPTODATE, &fdev[i]->flags) &&
3323 !test_bit(R5_OVERWRITE, &fdev[i]->flags))
3324 return 1;
3325 }
3326
3327 return 0;
3328 }
3329
3330 static int fetch_block(struct stripe_head *sh, struct stripe_head_state *s,
3331 int disk_idx, int disks)
3332 {
3333 struct r5dev *dev = &sh->dev[disk_idx];
3334
3335 /* is the data in this block needed, and can we get it? */
3336 if (need_this_block(sh, s, disk_idx, disks)) {
3337 /* we would like to get this block, possibly by computing it,
3338 * otherwise read it if the backing disk is insync
3339 */
3340 BUG_ON(test_bit(R5_Wantcompute, &dev->flags));
3341 BUG_ON(test_bit(R5_Wantread, &dev->flags));
3342 BUG_ON(sh->batch_head);
3343 if ((s->uptodate == disks - 1) &&
3344 (s->failed && (disk_idx == s->failed_num[0] ||
3345 disk_idx == s->failed_num[1]))) {
3346 /* have disk failed, and we're requested to fetch it;
3347 * do compute it
3348 */
3349 pr_debug("Computing stripe %llu block %d\n",
3350 (unsigned long long)sh->sector, disk_idx);
3351 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
3352 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
3353 set_bit(R5_Wantcompute, &dev->flags);
3354 sh->ops.target = disk_idx;
3355 sh->ops.target2 = -1; /* no 2nd target */
3356 s->req_compute = 1;
3357 /* Careful: from this point on 'uptodate' is in the eye
3358 * of raid_run_ops which services 'compute' operations
3359 * before writes. R5_Wantcompute flags a block that will
3360 * be R5_UPTODATE by the time it is needed for a
3361 * subsequent operation.
3362 */
3363 s->uptodate++;
3364 return 1;
3365 } else if (s->uptodate == disks-2 && s->failed >= 2) {
3366 /* Computing 2-failure is *very* expensive; only
3367 * do it if failed >= 2
3368 */
3369 int other;
3370 for (other = disks; other--; ) {
3371 if (other == disk_idx)
3372 continue;
3373 if (!test_bit(R5_UPTODATE,
3374 &sh->dev[other].flags))
3375 break;
3376 }
3377 BUG_ON(other < 0);
3378 pr_debug("Computing stripe %llu blocks %d,%d\n",
3379 (unsigned long long)sh->sector,
3380 disk_idx, other);
3381 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
3382 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
3383 set_bit(R5_Wantcompute, &sh->dev[disk_idx].flags);
3384 set_bit(R5_Wantcompute, &sh->dev[other].flags);
3385 sh->ops.target = disk_idx;
3386 sh->ops.target2 = other;
3387 s->uptodate += 2;
3388 s->req_compute = 1;
3389 return 1;
3390 } else if (test_bit(R5_Insync, &dev->flags)) {
3391 set_bit(R5_LOCKED, &dev->flags);
3392 set_bit(R5_Wantread, &dev->flags);
3393 s->locked++;
3394 pr_debug("Reading block %d (sync=%d)\n",
3395 disk_idx, s->syncing);
3396 }
3397 }
3398
3399 return 0;
3400 }
3401
3402 /**
3403 * handle_stripe_fill - read or compute data to satisfy pending requests.
3404 */
3405 static void handle_stripe_fill(struct stripe_head *sh,
3406 struct stripe_head_state *s,
3407 int disks)
3408 {
3409 int i;
3410
3411 /* look for blocks to read/compute, skip this if a compute
3412 * is already in flight, or if the stripe contents are in the
3413 * midst of changing due to a write
3414 */
3415 if (!test_bit(STRIPE_COMPUTE_RUN, &sh->state) && !sh->check_state &&
3416 !sh->reconstruct_state)
3417 for (i = disks; i--; )
3418 if (fetch_block(sh, s, i, disks))
3419 break;
3420 set_bit(STRIPE_HANDLE, &sh->state);
3421 }
3422
3423 /* handle_stripe_clean_event
3424 * any written block on an uptodate or failed drive can be returned.
3425 * Note that if we 'wrote' to a failed drive, it will be UPTODATE, but
3426 * never LOCKED, so we don't need to test 'failed' directly.
3427 */
3428 static void handle_stripe_clean_event(struct r5conf *conf,
3429 struct stripe_head *sh, int disks, struct bio **return_bi)
3430 {
3431 int i;
3432 struct r5dev *dev;
3433 int discard_pending = 0;
3434 struct stripe_head *head_sh = sh;
3435 bool do_endio = false;
3436 int wakeup_nr = 0;
3437
3438 for (i = disks; i--; )
3439 if (sh->dev[i].written) {
3440 dev = &sh->dev[i];
3441 if (!test_bit(R5_LOCKED, &dev->flags) &&
3442 (test_bit(R5_UPTODATE, &dev->flags) ||
3443 test_bit(R5_Discard, &dev->flags) ||
3444 test_bit(R5_SkipCopy, &dev->flags))) {
3445 /* We can return any write requests */
3446 struct bio *wbi, *wbi2;
3447 pr_debug("Return write for disc %d\n", i);
3448 if (test_and_clear_bit(R5_Discard, &dev->flags))
3449 clear_bit(R5_UPTODATE, &dev->flags);
3450 if (test_and_clear_bit(R5_SkipCopy, &dev->flags)) {
3451 WARN_ON(test_bit(R5_UPTODATE, &dev->flags));
3452 }
3453 do_endio = true;
3454
3455 returnbi:
3456 dev->page = dev->orig_page;
3457 wbi = dev->written;
3458 dev->written = NULL;
3459 while (wbi && wbi->bi_iter.bi_sector <
3460 dev->sector + STRIPE_SECTORS) {
3461 wbi2 = r5_next_bio(wbi, dev->sector);
3462 if (!raid5_dec_bi_active_stripes(wbi)) {
3463 md_write_end(conf->mddev);
3464 wbi->bi_next = *return_bi;
3465 *return_bi = wbi;
3466 }
3467 wbi = wbi2;
3468 }
3469 bitmap_endwrite(conf->mddev->bitmap, sh->sector,
3470 STRIPE_SECTORS,
3471 !test_bit(STRIPE_DEGRADED, &sh->state),
3472 0);
3473 if (head_sh->batch_head) {
3474 sh = list_first_entry(&sh->batch_list,
3475 struct stripe_head,
3476 batch_list);
3477 if (sh != head_sh) {
3478 dev = &sh->dev[i];
3479 goto returnbi;
3480 }
3481 }
3482 sh = head_sh;
3483 dev = &sh->dev[i];
3484 } else if (test_bit(R5_Discard, &dev->flags))
3485 discard_pending = 1;
3486 WARN_ON(test_bit(R5_SkipCopy, &dev->flags));
3487 WARN_ON(dev->page != dev->orig_page);
3488 }
3489 if (!discard_pending &&
3490 test_bit(R5_Discard, &sh->dev[sh->pd_idx].flags)) {
3491 clear_bit(R5_Discard, &sh->dev[sh->pd_idx].flags);
3492 clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
3493 if (sh->qd_idx >= 0) {
3494 clear_bit(R5_Discard, &sh->dev[sh->qd_idx].flags);
3495 clear_bit(R5_UPTODATE, &sh->dev[sh->qd_idx].flags);
3496 }
3497 /* now that discard is done we can proceed with any sync */
3498 clear_bit(STRIPE_DISCARD, &sh->state);
3499 /*
3500 * SCSI discard will change some bio fields and the stripe has
3501 * no updated data, so remove it from hash list and the stripe
3502 * will be reinitialized
3503 */
3504 spin_lock_irq(&conf->device_lock);
3505 unhash:
3506 remove_hash(sh);
3507 if (head_sh->batch_head) {
3508 sh = list_first_entry(&sh->batch_list,
3509 struct stripe_head, batch_list);
3510 if (sh != head_sh)
3511 goto unhash;
3512 }
3513 spin_unlock_irq(&conf->device_lock);
3514 sh = head_sh;
3515
3516 if (test_bit(STRIPE_SYNC_REQUESTED, &sh->state))
3517 set_bit(STRIPE_HANDLE, &sh->state);
3518
3519 }
3520
3521 if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
3522 if (atomic_dec_and_test(&conf->pending_full_writes))
3523 md_wakeup_thread(conf->mddev->thread);
3524
3525 if (!head_sh->batch_head || !do_endio)
3526 return;
3527 for (i = 0; i < head_sh->disks; i++) {
3528 if (test_and_clear_bit(R5_Overlap, &head_sh->dev[i].flags))
3529 wakeup_nr++;
3530 }
3531 while (!list_empty(&head_sh->batch_list)) {
3532 int i;
3533 sh = list_first_entry(&head_sh->batch_list,
3534 struct stripe_head, batch_list);
3535 list_del_init(&sh->batch_list);
3536
3537 WARN_ON_ONCE(sh->state & ((1 << STRIPE_ACTIVE) |
3538 (1 << STRIPE_SYNCING) |
3539 (1 << STRIPE_REPLACED) |
3540 (1 << STRIPE_PREREAD_ACTIVE) |
3541 (1 << STRIPE_DELAYED) |
3542 (1 << STRIPE_BIT_DELAY) |
3543 (1 << STRIPE_FULL_WRITE) |
3544 (1 << STRIPE_BIOFILL_RUN) |
3545 (1 << STRIPE_COMPUTE_RUN) |
3546 (1 << STRIPE_OPS_REQ_PENDING) |
3547 (1 << STRIPE_DISCARD) |
3548 (1 << STRIPE_BATCH_READY) |
3549 (1 << STRIPE_BATCH_ERR) |
3550 (1 << STRIPE_BITMAP_PENDING)));
3551 WARN_ON_ONCE(head_sh->state & ((1 << STRIPE_DISCARD) |
3552 (1 << STRIPE_REPLACED)));
3553
3554 set_mask_bits(&sh->state, ~(STRIPE_EXPAND_SYNC_FLAGS |
3555 (1 << STRIPE_DEGRADED)),
3556 head_sh->state & (1 << STRIPE_INSYNC));
3557
3558 sh->check_state = head_sh->check_state;
3559 sh->reconstruct_state = head_sh->reconstruct_state;
3560 for (i = 0; i < sh->disks; i++) {
3561 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
3562 wakeup_nr++;
3563 sh->dev[i].flags = head_sh->dev[i].flags;
3564 }
3565
3566 spin_lock_irq(&sh->stripe_lock);
3567 sh->batch_head = NULL;
3568 spin_unlock_irq(&sh->stripe_lock);
3569 if (sh->state & STRIPE_EXPAND_SYNC_FLAGS)
3570 set_bit(STRIPE_HANDLE, &sh->state);
3571 release_stripe(sh);
3572 }
3573
3574 spin_lock_irq(&head_sh->stripe_lock);
3575 head_sh->batch_head = NULL;
3576 spin_unlock_irq(&head_sh->stripe_lock);
3577 if (wakeup_nr)
3578 wake_up(&conf->wait_for_overlap);
3579 if (head_sh->state & STRIPE_EXPAND_SYNC_FLAGS)
3580 set_bit(STRIPE_HANDLE, &head_sh->state);
3581 }
3582
3583 static void handle_stripe_dirtying(struct r5conf *conf,
3584 struct stripe_head *sh,
3585 struct stripe_head_state *s,
3586 int disks)
3587 {
3588 int rmw = 0, rcw = 0, i;
3589 sector_t recovery_cp = conf->mddev->recovery_cp;
3590
3591 /* Check whether resync is now happening or should start.
3592 * If yes, then the array is dirty (after unclean shutdown or
3593 * initial creation), so parity in some stripes might be inconsistent.
3594 * In this case, we need to always do reconstruct-write, to ensure
3595 * that in case of drive failure or read-error correction, we
3596 * generate correct data from the parity.
3597 */
3598 if (conf->rmw_level == PARITY_DISABLE_RMW ||
3599 (recovery_cp < MaxSector && sh->sector >= recovery_cp &&
3600 s->failed == 0)) {
3601 /* Calculate the real rcw later - for now make it
3602 * look like rcw is cheaper
3603 */
3604 rcw = 1; rmw = 2;
3605 pr_debug("force RCW rmw_level=%u, recovery_cp=%llu sh->sector=%llu\n",
3606 conf->rmw_level, (unsigned long long)recovery_cp,
3607 (unsigned long long)sh->sector);
3608 } else for (i = disks; i--; ) {
3609 /* would I have to read this buffer for read_modify_write */
3610 struct r5dev *dev = &sh->dev[i];
3611 if ((dev->towrite || i == sh->pd_idx || i == sh->qd_idx) &&
3612 !test_bit(R5_LOCKED, &dev->flags) &&
3613 !(test_bit(R5_UPTODATE, &dev->flags) ||
3614 test_bit(R5_Wantcompute, &dev->flags))) {
3615 if (test_bit(R5_Insync, &dev->flags))
3616 rmw++;
3617 else
3618 rmw += 2*disks; /* cannot read it */
3619 }
3620 /* Would I have to read this buffer for reconstruct_write */
3621 if (!test_bit(R5_OVERWRITE, &dev->flags) &&
3622 i != sh->pd_idx && i != sh->qd_idx &&
3623 !test_bit(R5_LOCKED, &dev->flags) &&
3624 !(test_bit(R5_UPTODATE, &dev->flags) ||
3625 test_bit(R5_Wantcompute, &dev->flags))) {
3626 if (test_bit(R5_Insync, &dev->flags))
3627 rcw++;
3628 else
3629 rcw += 2*disks;
3630 }
3631 }
3632 pr_debug("for sector %llu, rmw=%d rcw=%d\n",
3633 (unsigned long long)sh->sector, rmw, rcw);
3634 set_bit(STRIPE_HANDLE, &sh->state);
3635 if ((rmw < rcw || (rmw == rcw && conf->rmw_level == PARITY_ENABLE_RMW)) && rmw > 0) {
3636 /* prefer read-modify-write, but need to get some data */
3637 if (conf->mddev->queue)
3638 blk_add_trace_msg(conf->mddev->queue,
3639 "raid5 rmw %llu %d",
3640 (unsigned long long)sh->sector, rmw);
3641 for (i = disks; i--; ) {
3642 struct r5dev *dev = &sh->dev[i];
3643 if ((dev->towrite || i == sh->pd_idx || i == sh->qd_idx) &&
3644 !test_bit(R5_LOCKED, &dev->flags) &&
3645 !(test_bit(R5_UPTODATE, &dev->flags) ||
3646 test_bit(R5_Wantcompute, &dev->flags)) &&
3647 test_bit(R5_Insync, &dev->flags)) {
3648 if (test_bit(STRIPE_PREREAD_ACTIVE,
3649 &sh->state)) {
3650 pr_debug("Read_old block %d for r-m-w\n",
3651 i);
3652 set_bit(R5_LOCKED, &dev->flags);
3653 set_bit(R5_Wantread, &dev->flags);
3654 s->locked++;
3655 } else {
3656 set_bit(STRIPE_DELAYED, &sh->state);
3657 set_bit(STRIPE_HANDLE, &sh->state);
3658 }
3659 }
3660 }
3661 }
3662 if ((rcw < rmw || (rcw == rmw && conf->rmw_level != PARITY_ENABLE_RMW)) && rcw > 0) {
3663 /* want reconstruct write, but need to get some data */
3664 int qread =0;
3665 rcw = 0;
3666 for (i = disks; i--; ) {
3667 struct r5dev *dev = &sh->dev[i];
3668 if (!test_bit(R5_OVERWRITE, &dev->flags) &&
3669 i != sh->pd_idx && i != sh->qd_idx &&
3670 !test_bit(R5_LOCKED, &dev->flags) &&
3671 !(test_bit(R5_UPTODATE, &dev->flags) ||
3672 test_bit(R5_Wantcompute, &dev->flags))) {
3673 rcw++;
3674 if (test_bit(R5_Insync, &dev->flags) &&
3675 test_bit(STRIPE_PREREAD_ACTIVE,
3676 &sh->state)) {
3677 pr_debug("Read_old block "
3678 "%d for Reconstruct\n", i);
3679 set_bit(R5_LOCKED, &dev->flags);
3680 set_bit(R5_Wantread, &dev->flags);
3681 s->locked++;
3682 qread++;
3683 } else {
3684 set_bit(STRIPE_DELAYED, &sh->state);
3685 set_bit(STRIPE_HANDLE, &sh->state);
3686 }
3687 }
3688 }
3689 if (rcw && conf->mddev->queue)
3690 blk_add_trace_msg(conf->mddev->queue, "raid5 rcw %llu %d %d %d",
3691 (unsigned long long)sh->sector,
3692 rcw, qread, test_bit(STRIPE_DELAYED, &sh->state));
3693 }
3694
3695 if (rcw > disks && rmw > disks &&
3696 !test_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
3697 set_bit(STRIPE_DELAYED, &sh->state);
3698
3699 /* now if nothing is locked, and if we have enough data,
3700 * we can start a write request
3701 */
3702 /* since handle_stripe can be called at any time we need to handle the
3703 * case where a compute block operation has been submitted and then a
3704 * subsequent call wants to start a write request. raid_run_ops only
3705 * handles the case where compute block and reconstruct are requested
3706 * simultaneously. If this is not the case then new writes need to be
3707 * held off until the compute completes.
3708 */
3709 if ((s->req_compute || !test_bit(STRIPE_COMPUTE_RUN, &sh->state)) &&
3710 (s->locked == 0 && (rcw == 0 || rmw == 0) &&
3711 !test_bit(STRIPE_BIT_DELAY, &sh->state)))
3712 schedule_reconstruction(sh, s, rcw == 0, 0);
3713 }
3714
3715 static void handle_parity_checks5(struct r5conf *conf, struct stripe_head *sh,
3716 struct stripe_head_state *s, int disks)
3717 {
3718 struct r5dev *dev = NULL;
3719
3720 BUG_ON(sh->batch_head);
3721 set_bit(STRIPE_HANDLE, &sh->state);
3722
3723 switch (sh->check_state) {
3724 case check_state_idle:
3725 /* start a new check operation if there are no failures */
3726 if (s->failed == 0) {
3727 BUG_ON(s->uptodate != disks);
3728 sh->check_state = check_state_run;
3729 set_bit(STRIPE_OP_CHECK, &s->ops_request);
3730 clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
3731 s->uptodate--;
3732 break;
3733 }
3734 dev = &sh->dev[s->failed_num[0]];
3735 /* fall through */
3736 case check_state_compute_result:
3737 sh->check_state = check_state_idle;
3738 if (!dev)
3739 dev = &sh->dev[sh->pd_idx];
3740
3741 /* check that a write has not made the stripe insync */
3742 if (test_bit(STRIPE_INSYNC, &sh->state))
3743 break;
3744
3745 /* either failed parity check, or recovery is happening */
3746 BUG_ON(!test_bit(R5_UPTODATE, &dev->flags));
3747 BUG_ON(s->uptodate != disks);
3748
3749 set_bit(R5_LOCKED, &dev->flags);
3750 s->locked++;
3751 set_bit(R5_Wantwrite, &dev->flags);
3752
3753 clear_bit(STRIPE_DEGRADED, &sh->state);
3754 set_bit(STRIPE_INSYNC, &sh->state);
3755 break;
3756 case check_state_run:
3757 break; /* we will be called again upon completion */
3758 case check_state_check_result:
3759 sh->check_state = check_state_idle;
3760
3761 /* if a failure occurred during the check operation, leave
3762 * STRIPE_INSYNC not set and let the stripe be handled again
3763 */
3764 if (s->failed)
3765 break;
3766
3767 /* handle a successful check operation, if parity is correct
3768 * we are done. Otherwise update the mismatch count and repair
3769 * parity if !MD_RECOVERY_CHECK
3770 */
3771 if ((sh->ops.zero_sum_result & SUM_CHECK_P_RESULT) == 0)
3772 /* parity is correct (on disc,
3773 * not in buffer any more)
3774 */
3775 set_bit(STRIPE_INSYNC, &sh->state);
3776 else {
3777 atomic64_add(STRIPE_SECTORS, &conf->mddev->resync_mismatches);
3778 if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
3779 /* don't try to repair!! */
3780 set_bit(STRIPE_INSYNC, &sh->state);
3781 else {
3782 sh->check_state = check_state_compute_run;
3783 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
3784 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
3785 set_bit(R5_Wantcompute,
3786 &sh->dev[sh->pd_idx].flags);
3787 sh->ops.target = sh->pd_idx;
3788 sh->ops.target2 = -1;
3789 s->uptodate++;
3790 }
3791 }
3792 break;
3793 case check_state_compute_run:
3794 break;
3795 default:
3796 printk(KERN_ERR "%s: unknown check_state: %d sector: %llu\n",
3797 __func__, sh->check_state,
3798 (unsigned long long) sh->sector);
3799 BUG();
3800 }
3801 }
3802
3803 static void handle_parity_checks6(struct r5conf *conf, struct stripe_head *sh,
3804 struct stripe_head_state *s,
3805 int disks)
3806 {
3807 int pd_idx = sh->pd_idx;
3808 int qd_idx = sh->qd_idx;
3809 struct r5dev *dev;
3810
3811 BUG_ON(sh->batch_head);
3812 set_bit(STRIPE_HANDLE, &sh->state);
3813
3814 BUG_ON(s->failed > 2);
3815
3816 /* Want to check and possibly repair P and Q.
3817 * However there could be one 'failed' device, in which
3818 * case we can only check one of them, possibly using the
3819 * other to generate missing data
3820 */
3821
3822 switch (sh->check_state) {
3823 case check_state_idle:
3824 /* start a new check operation if there are < 2 failures */
3825 if (s->failed == s->q_failed) {
3826 /* The only possible failed device holds Q, so it
3827 * makes sense to check P (If anything else were failed,
3828 * we would have used P to recreate it).
3829 */
3830 sh->check_state = check_state_run;
3831 }
3832 if (!s->q_failed && s->failed < 2) {
3833 /* Q is not failed, and we didn't use it to generate
3834 * anything, so it makes sense to check it
3835 */
3836 if (sh->check_state == check_state_run)
3837 sh->check_state = check_state_run_pq;
3838 else
3839 sh->check_state = check_state_run_q;
3840 }
3841
3842 /* discard potentially stale zero_sum_result */
3843 sh->ops.zero_sum_result = 0;
3844
3845 if (sh->check_state == check_state_run) {
3846 /* async_xor_zero_sum destroys the contents of P */
3847 clear_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
3848 s->uptodate--;
3849 }
3850 if (sh->check_state >= check_state_run &&
3851 sh->check_state <= check_state_run_pq) {
3852 /* async_syndrome_zero_sum preserves P and Q, so
3853 * no need to mark them !uptodate here
3854 */
3855 set_bit(STRIPE_OP_CHECK, &s->ops_request);
3856 break;
3857 }
3858
3859 /* we have 2-disk failure */
3860 BUG_ON(s->failed != 2);
3861 /* fall through */
3862 case check_state_compute_result:
3863 sh->check_state = check_state_idle;
3864
3865 /* check that a write has not made the stripe insync */
3866 if (test_bit(STRIPE_INSYNC, &sh->state))
3867 break;
3868
3869 /* now write out any block on a failed drive,
3870 * or P or Q if they were recomputed
3871 */
3872 BUG_ON(s->uptodate < disks - 1); /* We don't need Q to recover */
3873 if (s->failed == 2) {
3874 dev = &sh->dev[s->failed_num[1]];
3875 s->locked++;
3876 set_bit(R5_LOCKED, &dev->flags);
3877 set_bit(R5_Wantwrite, &dev->flags);
3878 }
3879 if (s->failed >= 1) {
3880 dev = &sh->dev[s->failed_num[0]];
3881 s->locked++;
3882 set_bit(R5_LOCKED, &dev->flags);
3883 set_bit(R5_Wantwrite, &dev->flags);
3884 }
3885 if (sh->ops.zero_sum_result & SUM_CHECK_P_RESULT) {
3886 dev = &sh->dev[pd_idx];
3887 s->locked++;
3888 set_bit(R5_LOCKED, &dev->flags);
3889 set_bit(R5_Wantwrite, &dev->flags);
3890 }
3891 if (sh->ops.zero_sum_result & SUM_CHECK_Q_RESULT) {
3892 dev = &sh->dev[qd_idx];
3893 s->locked++;
3894 set_bit(R5_LOCKED, &dev->flags);
3895 set_bit(R5_Wantwrite, &dev->flags);
3896 }
3897 clear_bit(STRIPE_DEGRADED, &sh->state);
3898
3899 set_bit(STRIPE_INSYNC, &sh->state);
3900 break;
3901 case check_state_run:
3902 case check_state_run_q:
3903 case check_state_run_pq:
3904 break; /* we will be called again upon completion */
3905 case check_state_check_result:
3906 sh->check_state = check_state_idle;
3907
3908 /* handle a successful check operation, if parity is correct
3909 * we are done. Otherwise update the mismatch count and repair
3910 * parity if !MD_RECOVERY_CHECK
3911 */
3912 if (sh->ops.zero_sum_result == 0) {
3913 /* both parities are correct */
3914 if (!s->failed)
3915 set_bit(STRIPE_INSYNC, &sh->state);
3916 else {
3917 /* in contrast to the raid5 case we can validate
3918 * parity, but still have a failure to write
3919 * back
3920 */
3921 sh->check_state = check_state_compute_result;
3922 /* Returning at this point means that we may go
3923 * off and bring p and/or q uptodate again so
3924 * we make sure to check zero_sum_result again
3925 * to verify if p or q need writeback
3926 */
3927 }
3928 } else {
3929 atomic64_add(STRIPE_SECTORS, &conf->mddev->resync_mismatches);
3930 if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
3931 /* don't try to repair!! */
3932 set_bit(STRIPE_INSYNC, &sh->state);
3933 else {
3934 int *target = &sh->ops.target;
3935
3936 sh->ops.target = -1;
3937 sh->ops.target2 = -1;
3938 sh->check_state = check_state_compute_run;
3939 set_bit(STRIPE_COMPUTE_RUN, &sh->state);
3940 set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
3941 if (sh->ops.zero_sum_result & SUM_CHECK_P_RESULT) {
3942 set_bit(R5_Wantcompute,
3943 &sh->dev[pd_idx].flags);
3944 *target = pd_idx;
3945 target = &sh->ops.target2;
3946 s->uptodate++;
3947 }
3948 if (sh->ops.zero_sum_result & SUM_CHECK_Q_RESULT) {
3949 set_bit(R5_Wantcompute,
3950 &sh->dev[qd_idx].flags);
3951 *target = qd_idx;
3952 s->uptodate++;
3953 }
3954 }
3955 }
3956 break;
3957 case check_state_compute_run:
3958 break;
3959 default:
3960 printk(KERN_ERR "%s: unknown check_state: %d sector: %llu\n",
3961 __func__, sh->check_state,
3962 (unsigned long long) sh->sector);
3963 BUG();
3964 }
3965 }
3966
3967 static void handle_stripe_expansion(struct r5conf *conf, struct stripe_head *sh)
3968 {
3969 int i;
3970
3971 /* We have read all the blocks in this stripe and now we need to
3972 * copy some of them into a target stripe for expand.
3973 */
3974 struct dma_async_tx_descriptor *tx = NULL;
3975 BUG_ON(sh->batch_head);
3976 clear_bit(STRIPE_EXPAND_SOURCE, &sh->state);
3977 for (i = 0; i < sh->disks; i++)
3978 if (i != sh->pd_idx && i != sh->qd_idx) {
3979 int dd_idx, j;
3980 struct stripe_head *sh2;
3981 struct async_submit_ctl submit;
3982
3983 sector_t bn = compute_blocknr(sh, i, 1);
3984 sector_t s = raid5_compute_sector(conf, bn, 0,
3985 &dd_idx, NULL);
3986 sh2 = get_active_stripe(conf, s, 0, 1, 1);
3987 if (sh2 == NULL)
3988 /* so far only the early blocks of this stripe
3989 * have been requested. When later blocks
3990 * get requested, we will try again
3991 */
3992 continue;
3993 if (!test_bit(STRIPE_EXPANDING, &sh2->state) ||
3994 test_bit(R5_Expanded, &sh2->dev[dd_idx].flags)) {
3995 /* must have already done this block */
3996 release_stripe(sh2);
3997 continue;
3998 }
3999
4000 /* place all the copies on one channel */
4001 init_async_submit(&submit, 0, tx, NULL, NULL, NULL);
4002 tx = async_memcpy(sh2->dev[dd_idx].page,
4003 sh->dev[i].page, 0, 0, STRIPE_SIZE,
4004 &submit);
4005
4006 set_bit(R5_Expanded, &sh2->dev[dd_idx].flags);
4007 set_bit(R5_UPTODATE, &sh2->dev[dd_idx].flags);
4008 for (j = 0; j < conf->raid_disks; j++)
4009 if (j != sh2->pd_idx &&
4010 j != sh2->qd_idx &&
4011 !test_bit(R5_Expanded, &sh2->dev[j].flags))
4012 break;
4013 if (j == conf->raid_disks) {
4014 set_bit(STRIPE_EXPAND_READY, &sh2->state);
4015 set_bit(STRIPE_HANDLE, &sh2->state);
4016 }
4017 release_stripe(sh2);
4018
4019 }
4020 /* done submitting copies, wait for them to complete */
4021 async_tx_quiesce(&tx);
4022 }
4023
4024 /*
4025 * handle_stripe - do things to a stripe.
4026 *
4027 * We lock the stripe by setting STRIPE_ACTIVE and then examine the
4028 * state of various bits to see what needs to be done.
4029 * Possible results:
4030 * return some read requests which now have data
4031 * return some write requests which are safely on storage
4032 * schedule a read on some buffers
4033 * schedule a write of some buffers
4034 * return confirmation of parity correctness
4035 *
4036 */
4037
4038 static void analyse_stripe(struct stripe_head *sh, struct stripe_head_state *s)
4039 {
4040 struct r5conf *conf = sh->raid_conf;
4041 int disks = sh->disks;
4042 struct r5dev *dev;
4043 int i;
4044 int do_recovery = 0;
4045
4046 memset(s, 0, sizeof(*s));
4047
4048 s->expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state) && !sh->batch_head;
4049 s->expanded = test_bit(STRIPE_EXPAND_READY, &sh->state) && !sh->batch_head;
4050 s->failed_num[0] = -1;
4051 s->failed_num[1] = -1;
4052
4053 /* Now to look around and see what can be done */
4054 rcu_read_lock();
4055 for (i=disks; i--; ) {
4056 struct md_rdev *rdev;
4057 sector_t first_bad;
4058 int bad_sectors;
4059 int is_bad = 0;
4060
4061 dev = &sh->dev[i];
4062
4063 pr_debug("check %d: state 0x%lx read %p write %p written %p\n",
4064 i, dev->flags,
4065 dev->toread, dev->towrite, dev->written);
4066 /* maybe we can reply to a read
4067 *
4068 * new wantfill requests are only permitted while
4069 * ops_complete_biofill is guaranteed to be inactive
4070 */
4071 if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread &&
4072 !test_bit(STRIPE_BIOFILL_RUN, &sh->state))
4073 set_bit(R5_Wantfill, &dev->flags);
4074
4075 /* now count some things */
4076 if (test_bit(R5_LOCKED, &dev->flags))
4077 s->locked++;
4078 if (test_bit(R5_UPTODATE, &dev->flags))
4079 s->uptodate++;
4080 if (test_bit(R5_Wantcompute, &dev->flags)) {
4081 s->compute++;
4082 BUG_ON(s->compute > 2);
4083 }
4084
4085 if (test_bit(R5_Wantfill, &dev->flags))
4086 s->to_fill++;
4087 else if (dev->toread)
4088 s->to_read++;
4089 if (dev->towrite) {
4090 s->to_write++;
4091 if (!test_bit(R5_OVERWRITE, &dev->flags))
4092 s->non_overwrite++;
4093 }
4094 if (dev->written)
4095 s->written++;
4096 /* Prefer to use the replacement for reads, but only
4097 * if it is recovered enough and has no bad blocks.
4098 */
4099 rdev = rcu_dereference(conf->disks[i].replacement);
4100 if (rdev && !test_bit(Faulty, &rdev->flags) &&
4101 rdev->recovery_offset >= sh->sector + STRIPE_SECTORS &&
4102 !is_badblock(rdev, sh->sector, STRIPE_SECTORS,
4103 &first_bad, &bad_sectors))
4104 set_bit(R5_ReadRepl, &dev->flags);
4105 else {
4106 if (rdev)
4107 set_bit(R5_NeedReplace, &dev->flags);
4108 rdev = rcu_dereference(conf->disks[i].rdev);
4109 clear_bit(R5_ReadRepl, &dev->flags);
4110 }
4111 if (rdev && test_bit(Faulty, &rdev->flags))
4112 rdev = NULL;
4113 if (rdev) {
4114 is_bad = is_badblock(rdev, sh->sector, STRIPE_SECTORS,
4115 &first_bad, &bad_sectors);
4116 if (s->blocked_rdev == NULL
4117 && (test_bit(Blocked, &rdev->flags)
4118 || is_bad < 0)) {
4119 if (is_bad < 0)
4120 set_bit(BlockedBadBlocks,
4121 &rdev->flags);
4122 s->blocked_rdev = rdev;
4123 atomic_inc(&rdev->nr_pending);
4124 }
4125 }
4126 clear_bit(R5_Insync, &dev->flags);
4127 if (!rdev)
4128 /* Not in-sync */;
4129 else if (is_bad) {
4130 /* also not in-sync */
4131 if (!test_bit(WriteErrorSeen, &rdev->flags) &&
4132 test_bit(R5_UPTODATE, &dev->flags)) {
4133 /* treat as in-sync, but with a read error
4134 * which we can now try to correct
4135 */
4136 set_bit(R5_Insync, &dev->flags);
4137 set_bit(R5_ReadError, &dev->flags);
4138 }
4139 } else if (test_bit(In_sync, &rdev->flags))
4140 set_bit(R5_Insync, &dev->flags);
4141 else if (sh->sector + STRIPE_SECTORS <= rdev->recovery_offset)
4142 /* in sync if before recovery_offset */
4143 set_bit(R5_Insync, &dev->flags);
4144 else if (test_bit(R5_UPTODATE, &dev->flags) &&
4145 test_bit(R5_Expanded, &dev->flags))
4146 /* If we've reshaped into here, we assume it is Insync.
4147 * We will shortly update recovery_offset to make
4148 * it official.
4149 */
4150 set_bit(R5_Insync, &dev->flags);
4151
4152 if (test_bit(R5_WriteError, &dev->flags)) {
4153 /* This flag does not apply to '.replacement'
4154 * only to .rdev, so make sure to check that*/
4155 struct md_rdev *rdev2 = rcu_dereference(
4156 conf->disks[i].rdev);
4157 if (rdev2 == rdev)
4158 clear_bit(R5_Insync, &dev->flags);
4159 if (rdev2 && !test_bit(Faulty, &rdev2->flags)) {
4160 s->handle_bad_blocks = 1;
4161 atomic_inc(&rdev2->nr_pending);
4162 } else
4163 clear_bit(R5_WriteError, &dev->flags);
4164 }
4165 if (test_bit(R5_MadeGood, &dev->flags)) {
4166 /* This flag does not apply to '.replacement'
4167 * only to .rdev, so make sure to check that*/
4168 struct md_rdev *rdev2 = rcu_dereference(
4169 conf->disks[i].rdev);
4170 if (rdev2 && !test_bit(Faulty, &rdev2->flags)) {
4171 s->handle_bad_blocks = 1;
4172 atomic_inc(&rdev2->nr_pending);
4173 } else
4174 clear_bit(R5_MadeGood, &dev->flags);
4175 }
4176 if (test_bit(R5_MadeGoodRepl, &dev->flags)) {
4177 struct md_rdev *rdev2 = rcu_dereference(
4178 conf->disks[i].replacement);
4179 if (rdev2 && !test_bit(Faulty, &rdev2->flags)) {
4180 s->handle_bad_blocks = 1;
4181 atomic_inc(&rdev2->nr_pending);
4182 } else
4183 clear_bit(R5_MadeGoodRepl, &dev->flags);
4184 }
4185 if (!test_bit(R5_Insync, &dev->flags)) {
4186 /* The ReadError flag will just be confusing now */
4187 clear_bit(R5_ReadError, &dev->flags);
4188 clear_bit(R5_ReWrite, &dev->flags);
4189 }
4190 if (test_bit(R5_ReadError, &dev->flags))
4191 clear_bit(R5_Insync, &dev->flags);
4192 if (!test_bit(R5_Insync, &dev->flags)) {
4193 if (s->failed < 2)
4194 s->failed_num[s->failed] = i;
4195 s->failed++;
4196 if (rdev && !test_bit(Faulty, &rdev->flags))
4197 do_recovery = 1;
4198 }
4199 }
4200 if (test_bit(STRIPE_SYNCING, &sh->state)) {
4201 /* If there is a failed device being replaced,
4202 * we must be recovering.
4203 * else if we are after recovery_cp, we must be syncing
4204 * else if MD_RECOVERY_REQUESTED is set, we also are syncing.
4205 * else we can only be replacing
4206 * sync and recovery both need to read all devices, and so
4207 * use the same flag.
4208 */
4209 if (do_recovery ||
4210 sh->sector >= conf->mddev->recovery_cp ||
4211 test_bit(MD_RECOVERY_REQUESTED, &(conf->mddev->recovery)))
4212 s->syncing = 1;
4213 else
4214 s->replacing = 1;
4215 }
4216 rcu_read_unlock();
4217 }
4218
4219 static int clear_batch_ready(struct stripe_head *sh)
4220 {
4221 /* Return '1' if this is a member of batch, or
4222 * '0' if it is a lone stripe or a head which can now be
4223 * handled.
4224 */
4225 struct stripe_head *tmp;
4226 if (!test_and_clear_bit(STRIPE_BATCH_READY, &sh->state))
4227 return (sh->batch_head && sh->batch_head != sh);
4228 spin_lock(&sh->stripe_lock);
4229 if (!sh->batch_head) {
4230 spin_unlock(&sh->stripe_lock);
4231 return 0;
4232 }
4233
4234 /*
4235 * this stripe could be added to a batch list before we check
4236 * BATCH_READY, skips it
4237 */
4238 if (sh->batch_head != sh) {
4239 spin_unlock(&sh->stripe_lock);
4240 return 1;
4241 }
4242 spin_lock(&sh->batch_lock);
4243 list_for_each_entry(tmp, &sh->batch_list, batch_list)
4244 clear_bit(STRIPE_BATCH_READY, &tmp->state);
4245 spin_unlock(&sh->batch_lock);
4246 spin_unlock(&sh->stripe_lock);
4247
4248 /*
4249 * BATCH_READY is cleared, no new stripes can be added.
4250 * batch_list can be accessed without lock
4251 */
4252 return 0;
4253 }
4254
4255 static void break_stripe_batch_list(struct stripe_head *head_sh,
4256 unsigned long handle_flags)
4257 {
4258 struct stripe_head *sh, *next;
4259 int i;
4260 int do_wakeup = 0;
4261
4262 list_for_each_entry_safe(sh, next, &head_sh->batch_list, batch_list) {
4263
4264 list_del_init(&sh->batch_list);
4265
4266 WARN_ON_ONCE(sh->state & ((1 << STRIPE_ACTIVE) |
4267 (1 << STRIPE_SYNCING) |
4268 (1 << STRIPE_REPLACED) |
4269 (1 << STRIPE_PREREAD_ACTIVE) |
4270 (1 << STRIPE_DELAYED) |
4271 (1 << STRIPE_BIT_DELAY) |
4272 (1 << STRIPE_FULL_WRITE) |
4273 (1 << STRIPE_BIOFILL_RUN) |
4274 (1 << STRIPE_COMPUTE_RUN) |
4275 (1 << STRIPE_OPS_REQ_PENDING) |
4276 (1 << STRIPE_DISCARD) |
4277 (1 << STRIPE_BATCH_READY) |
4278 (1 << STRIPE_BATCH_ERR) |
4279 (1 << STRIPE_BITMAP_PENDING)));
4280 WARN_ON_ONCE(head_sh->state & ((1 << STRIPE_DISCARD) |
4281 (1 << STRIPE_REPLACED)));
4282
4283 set_mask_bits(&sh->state, ~(STRIPE_EXPAND_SYNC_FLAGS |
4284 (1 << STRIPE_DEGRADED)),
4285 head_sh->state & (1 << STRIPE_INSYNC));
4286
4287 sh->check_state = head_sh->check_state;
4288 sh->reconstruct_state = head_sh->reconstruct_state;
4289 for (i = 0; i < sh->disks; i++) {
4290 if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
4291 do_wakeup = 1;
4292 sh->dev[i].flags = head_sh->dev[i].flags &
4293 (~((1 << R5_WriteError) | (1 << R5_Overlap)));
4294 }
4295 spin_lock_irq(&sh->stripe_lock);
4296 sh->batch_head = NULL;
4297 spin_unlock_irq(&sh->stripe_lock);
4298 if (handle_flags == 0 ||
4299 sh->state & handle_flags)
4300 set_bit(STRIPE_HANDLE, &sh->state);
4301 release_stripe(sh);
4302 }
4303 spin_lock_irq(&head_sh->stripe_lock);
4304 head_sh->batch_head = NULL;
4305 spin_unlock_irq(&head_sh->stripe_lock);
4306 for (i = 0; i < head_sh->disks; i++)
4307 if (test_and_clear_bit(R5_Overlap, &head_sh->dev[i].flags))
4308 do_wakeup = 1;
4309 if (head_sh->state & handle_flags)
4310 set_bit(STRIPE_HANDLE, &head_sh->state);
4311
4312 if (do_wakeup)
4313 wake_up(&head_sh->raid_conf->wait_for_overlap);
4314 }
4315
4316 static void handle_stripe(struct stripe_head *sh)
4317 {
4318 struct stripe_head_state s;
4319 struct r5conf *conf = sh->raid_conf;
4320 int i;
4321 int prexor;
4322 int disks = sh->disks;
4323 struct r5dev *pdev, *qdev;
4324
4325 clear_bit(STRIPE_HANDLE, &sh->state);
4326 if (test_and_set_bit_lock(STRIPE_ACTIVE, &sh->state)) {
4327 /* already being handled, ensure it gets handled
4328 * again when current action finishes */
4329 set_bit(STRIPE_HANDLE, &sh->state);
4330 return;
4331 }
4332
4333 if (clear_batch_ready(sh) ) {
4334 clear_bit_unlock(STRIPE_ACTIVE, &sh->state);
4335 return;
4336 }
4337
4338 if (test_and_clear_bit(STRIPE_BATCH_ERR, &sh->state))
4339 break_stripe_batch_list(sh, 0);
4340
4341 if (test_bit(STRIPE_SYNC_REQUESTED, &sh->state) && !sh->batch_head) {
4342 spin_lock(&sh->stripe_lock);
4343 /* Cannot process 'sync' concurrently with 'discard' */
4344 if (!test_bit(STRIPE_DISCARD, &sh->state) &&
4345 test_and_clear_bit(STRIPE_SYNC_REQUESTED, &sh->state)) {
4346 set_bit(STRIPE_SYNCING, &sh->state);
4347 clear_bit(STRIPE_INSYNC, &sh->state);
4348 clear_bit(STRIPE_REPLACED, &sh->state);
4349 }
4350 spin_unlock(&sh->stripe_lock);
4351 }
4352 clear_bit(STRIPE_DELAYED, &sh->state);
4353
4354 pr_debug("handling stripe %llu, state=%#lx cnt=%d, "
4355 "pd_idx=%d, qd_idx=%d\n, check:%d, reconstruct:%d\n",
4356 (unsigned long long)sh->sector, sh->state,
4357 atomic_read(&sh->count), sh->pd_idx, sh->qd_idx,
4358 sh->check_state, sh->reconstruct_state);
4359
4360 analyse_stripe(sh, &s);
4361
4362 if (s.handle_bad_blocks) {
4363 set_bit(STRIPE_HANDLE, &sh->state);
4364 goto finish;
4365 }
4366
4367 if (unlikely(s.blocked_rdev)) {
4368 if (s.syncing || s.expanding || s.expanded ||
4369 s.replacing || s.to_write || s.written) {
4370 set_bit(STRIPE_HANDLE, &sh->state);
4371 goto finish;
4372 }
4373 /* There is nothing for the blocked_rdev to block */
4374 rdev_dec_pending(s.blocked_rdev, conf->mddev);
4375 s.blocked_rdev = NULL;
4376 }
4377
4378 if (s.to_fill && !test_bit(STRIPE_BIOFILL_RUN, &sh->state)) {
4379 set_bit(STRIPE_OP_BIOFILL, &s.ops_request);
4380 set_bit(STRIPE_BIOFILL_RUN, &sh->state);
4381 }
4382
4383 pr_debug("locked=%d uptodate=%d to_read=%d"
4384 " to_write=%d failed=%d failed_num=%d,%d\n",
4385 s.locked, s.uptodate, s.to_read, s.to_write, s.failed,
4386 s.failed_num[0], s.failed_num[1]);
4387 /* check if the array has lost more than max_degraded devices and,
4388 * if so, some requests might need to be failed.
4389 */
4390 if (s.failed > conf->max_degraded) {
4391 sh->check_state = 0;
4392 sh->reconstruct_state = 0;
4393 if (s.to_read+s.to_write+s.written)
4394 handle_failed_stripe(conf, sh, &s, disks, &s.return_bi);
4395 if (s.syncing + s.replacing)
4396 handle_failed_sync(conf, sh, &s);
4397 }
4398
4399 /* Now we check to see if any write operations have recently
4400 * completed
4401 */
4402 prexor = 0;
4403 if (sh->reconstruct_state == reconstruct_state_prexor_drain_result)
4404 prexor = 1;
4405 if (sh->reconstruct_state == reconstruct_state_drain_result ||
4406 sh->reconstruct_state == reconstruct_state_prexor_drain_result) {
4407 sh->reconstruct_state = reconstruct_state_idle;
4408
4409 /* All the 'written' buffers and the parity block are ready to
4410 * be written back to disk
4411 */
4412 BUG_ON(!test_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags) &&
4413 !test_bit(R5_Discard, &sh->dev[sh->pd_idx].flags));
4414 BUG_ON(sh->qd_idx >= 0 &&
4415 !test_bit(R5_UPTODATE, &sh->dev[sh->qd_idx].flags) &&
4416 !test_bit(R5_Discard, &sh->dev[sh->qd_idx].flags));
4417 for (i = disks; i--; ) {
4418 struct r5dev *dev = &sh->dev[i];
4419 if (test_bit(R5_LOCKED, &dev->flags) &&
4420 (i == sh->pd_idx || i == sh->qd_idx ||
4421 dev->written)) {
4422 pr_debug("Writing block %d\n", i);
4423 set_bit(R5_Wantwrite, &dev->flags);
4424 if (prexor)
4425 continue;
4426 if (s.failed > 1)
4427 continue;
4428 if (!test_bit(R5_Insync, &dev->flags) ||
4429 ((i == sh->pd_idx || i == sh->qd_idx) &&
4430 s.failed == 0))
4431 set_bit(STRIPE_INSYNC, &sh->state);
4432 }
4433 }
4434 if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
4435 s.dec_preread_active = 1;
4436 }
4437
4438 /*
4439 * might be able to return some write requests if the parity blocks
4440 * are safe, or on a failed drive
4441 */
4442 pdev = &sh->dev[sh->pd_idx];
4443 s.p_failed = (s.failed >= 1 && s.failed_num[0] == sh->pd_idx)
4444 || (s.failed >= 2 && s.failed_num[1] == sh->pd_idx);
4445 qdev = &sh->dev[sh->qd_idx];
4446 s.q_failed = (s.failed >= 1 && s.failed_num[0] == sh->qd_idx)
4447 || (s.failed >= 2 && s.failed_num[1] == sh->qd_idx)
4448 || conf->level < 6;
4449
4450 if (s.written &&
4451 (s.p_failed || ((test_bit(R5_Insync, &pdev->flags)
4452 && !test_bit(R5_LOCKED, &pdev->flags)
4453 && (test_bit(R5_UPTODATE, &pdev->flags) ||
4454 test_bit(R5_Discard, &pdev->flags))))) &&
4455 (s.q_failed || ((test_bit(R5_Insync, &qdev->flags)
4456 && !test_bit(R5_LOCKED, &qdev->flags)
4457 && (test_bit(R5_UPTODATE, &qdev->flags) ||
4458 test_bit(R5_Discard, &qdev->flags))))))
4459 handle_stripe_clean_event(conf, sh, disks, &s.return_bi);
4460
4461 /* Now we might consider reading some blocks, either to check/generate
4462 * parity, or to satisfy requests
4463 * or to load a block that is being partially written.
4464 */
4465 if (s.to_read || s.non_overwrite
4466 || (conf->level == 6 && s.to_write && s.failed)
4467 || (s.syncing && (s.uptodate + s.compute < disks))
4468 || s.replacing
4469 || s.expanding)
4470 handle_stripe_fill(sh, &s, disks);
4471
4472 /* Now to consider new write requests and what else, if anything
4473 * should be read. We do not handle new writes when:
4474 * 1/ A 'write' operation (copy+xor) is already in flight.
4475 * 2/ A 'check' operation is in flight, as it may clobber the parity
4476 * block.
4477 */
4478 if (s.to_write && !sh->reconstruct_state && !sh->check_state)
4479 handle_stripe_dirtying(conf, sh, &s, disks);
4480
4481 /* maybe we need to check and possibly fix the parity for this stripe
4482 * Any reads will already have been scheduled, so we just see if enough
4483 * data is available. The parity check is held off while parity
4484 * dependent operations are in flight.
4485 */
4486 if (sh->check_state ||
4487 (s.syncing && s.locked == 0 &&
4488 !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
4489 !test_bit(STRIPE_INSYNC, &sh->state))) {
4490 if (conf->level == 6)
4491 handle_parity_checks6(conf, sh, &s, disks);
4492 else
4493 handle_parity_checks5(conf, sh, &s, disks);
4494 }
4495
4496 if ((s.replacing || s.syncing) && s.locked == 0
4497 && !test_bit(STRIPE_COMPUTE_RUN, &sh->state)
4498 && !test_bit(STRIPE_REPLACED, &sh->state)) {
4499 /* Write out to replacement devices where possible */
4500 for (i = 0; i < conf->raid_disks; i++)
4501 if (test_bit(R5_NeedReplace, &sh->dev[i].flags)) {
4502 WARN_ON(!test_bit(R5_UPTODATE, &sh->dev[i].flags));
4503 set_bit(R5_WantReplace, &sh->dev[i].flags);
4504 set_bit(R5_LOCKED, &sh->dev[i].flags);
4505 s.locked++;
4506 }
4507 if (s.replacing)
4508 set_bit(STRIPE_INSYNC, &sh->state);
4509 set_bit(STRIPE_REPLACED, &sh->state);
4510 }
4511 if ((s.syncing || s.replacing) && s.locked == 0 &&
4512 !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
4513 test_bit(STRIPE_INSYNC, &sh->state)) {
4514 md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
4515 clear_bit(STRIPE_SYNCING, &sh->state);
4516 if (test_and_clear_bit(R5_Overlap, &sh->dev[sh->pd_idx].flags))
4517 wake_up(&conf->wait_for_overlap);
4518 }
4519
4520 /* If the failed drives are just a ReadError, then we might need
4521 * to progress the repair/check process
4522 */
4523 if (s.failed <= conf->max_degraded && !conf->mddev->ro)
4524 for (i = 0; i < s.failed; i++) {
4525 struct r5dev *dev = &sh->dev[s.failed_num[i]];
4526 if (test_bit(R5_ReadError, &dev->flags)
4527 && !test_bit(R5_LOCKED, &dev->flags)
4528 && test_bit(R5_UPTODATE, &dev->flags)
4529 ) {
4530 if (!test_bit(R5_ReWrite, &dev->flags)) {
4531 set_bit(R5_Wantwrite, &dev->flags);
4532 set_bit(R5_ReWrite, &dev->flags);
4533 set_bit(R5_LOCKED, &dev->flags);
4534 s.locked++;
4535 } else {
4536 /* let's read it back */
4537 set_bit(R5_Wantread, &dev->flags);
4538 set_bit(R5_LOCKED, &dev->flags);
4539 s.locked++;
4540 }
4541 }
4542 }
4543
4544 /* Finish reconstruct operations initiated by the expansion process */
4545 if (sh->reconstruct_state == reconstruct_state_result) {
4546 struct stripe_head *sh_src
4547 = get_active_stripe(conf, sh->sector, 1, 1, 1);
4548 if (sh_src && test_bit(STRIPE_EXPAND_SOURCE, &sh_src->state)) {
4549 /* sh cannot be written until sh_src has been read.
4550 * so arrange for sh to be delayed a little
4551 */
4552 set_bit(STRIPE_DELAYED, &sh->state);
4553 set_bit(STRIPE_HANDLE, &sh->state);
4554 if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE,
4555 &sh_src->state))
4556 atomic_inc(&conf->preread_active_stripes);
4557 release_stripe(sh_src);
4558 goto finish;
4559 }
4560 if (sh_src)
4561 release_stripe(sh_src);
4562
4563 sh->reconstruct_state = reconstruct_state_idle;
4564 clear_bit(STRIPE_EXPANDING, &sh->state);
4565 for (i = conf->raid_disks; i--; ) {
4566 set_bit(R5_Wantwrite, &sh->dev[i].flags);
4567 set_bit(R5_LOCKED, &sh->dev[i].flags);
4568 s.locked++;
4569 }
4570 }
4571
4572 if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state) &&
4573 !sh->reconstruct_state) {
4574 /* Need to write out all blocks after computing parity */
4575 sh->disks = conf->raid_disks;
4576 stripe_set_idx(sh->sector, conf, 0, sh);
4577 schedule_reconstruction(sh, &s, 1, 1);
4578 } else if (s.expanded && !sh->reconstruct_state && s.locked == 0) {
4579 clear_bit(STRIPE_EXPAND_READY, &sh->state);
4580 atomic_dec(&conf->reshape_stripes);
4581 wake_up(&conf->wait_for_overlap);
4582 md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
4583 }
4584
4585 if (s.expanding && s.locked == 0 &&
4586 !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
4587 handle_stripe_expansion(conf, sh);
4588
4589 finish:
4590 /* wait for this device to become unblocked */
4591 if (unlikely(s.blocked_rdev)) {
4592 if (conf->mddev->external)
4593 md_wait_for_blocked_rdev(s.blocked_rdev,
4594 conf->mddev);
4595 else
4596 /* Internal metadata will immediately
4597 * be written by raid5d, so we don't
4598 * need to wait here.
4599 */
4600 rdev_dec_pending(s.blocked_rdev,
4601 conf->mddev);
4602 }
4603
4604 if (s.handle_bad_blocks)
4605 for (i = disks; i--; ) {
4606 struct md_rdev *rdev;
4607 struct r5dev *dev = &sh->dev[i];
4608 if (test_and_clear_bit(R5_WriteError, &dev->flags)) {
4609 /* We own a safe reference to the rdev */
4610 rdev = conf->disks[i].rdev;
4611 if (!rdev_set_badblocks(rdev, sh->sector,
4612 STRIPE_SECTORS, 0))
4613 md_error(conf->mddev, rdev);
4614 rdev_dec_pending(rdev, conf->mddev);
4615 }
4616 if (test_and_clear_bit(R5_MadeGood, &dev->flags)) {
4617 rdev = conf->disks[i].rdev;
4618 rdev_clear_badblocks(rdev, sh->sector,
4619 STRIPE_SECTORS, 0);
4620 rdev_dec_pending(rdev, conf->mddev);
4621 }
4622 if (test_and_clear_bit(R5_MadeGoodRepl, &dev->flags)) {
4623 rdev = conf->disks[i].replacement;
4624 if (!rdev)
4625 /* rdev have been moved down */
4626 rdev = conf->disks[i].rdev;
4627 rdev_clear_badblocks(rdev, sh->sector,
4628 STRIPE_SECTORS, 0);
4629 rdev_dec_pending(rdev, conf->mddev);
4630 }
4631 }
4632
4633 if (s.ops_request)
4634 raid_run_ops(sh, s.ops_request);
4635
4636 ops_run_io(sh, &s);
4637
4638 if (s.dec_preread_active) {
4639 /* We delay this until after ops_run_io so that if make_request
4640 * is waiting on a flush, it won't continue until the writes
4641 * have actually been submitted.
4642 */
4643 atomic_dec(&conf->preread_active_stripes);
4644 if (atomic_read(&conf->preread_active_stripes) <
4645 IO_THRESHOLD)
4646 md_wakeup_thread(conf->mddev->thread);
4647 }
4648
4649 return_io(s.return_bi);
4650
4651 clear_bit_unlock(STRIPE_ACTIVE, &sh->state);
4652 }
4653
4654 static void raid5_activate_delayed(struct r5conf *conf)
4655 {
4656 if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD) {
4657 while (!list_empty(&conf->delayed_list)) {
4658 struct list_head *l = conf->delayed_list.next;
4659 struct stripe_head *sh;
4660 sh = list_entry(l, struct stripe_head, lru);
4661 list_del_init(l);
4662 clear_bit(STRIPE_DELAYED, &sh->state);
4663 if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
4664 atomic_inc(&conf->preread_active_stripes);
4665 list_add_tail(&sh->lru, &conf->hold_list);
4666 raid5_wakeup_stripe_thread(sh);
4667 }
4668 }
4669 }
4670
4671 static void activate_bit_delay(struct r5conf *conf,
4672 struct list_head *temp_inactive_list)
4673 {
4674 /* device_lock is held */
4675 struct list_head head;
4676 list_add(&head, &conf->bitmap_list);
4677 list_del_init(&conf->bitmap_list);
4678 while (!list_empty(&head)) {
4679 struct stripe_head *sh = list_entry(head.next, struct stripe_head, lru);
4680 int hash;
4681 list_del_init(&sh->lru);
4682 atomic_inc(&sh->count);
4683 hash = sh->hash_lock_index;
4684 __release_stripe(conf, sh, &temp_inactive_list[hash]);
4685 }
4686 }
4687
4688 static int raid5_congested(struct mddev *mddev, int bits)
4689 {
4690 struct r5conf *conf = mddev->private;
4691
4692 /* No difference between reads and writes. Just check
4693 * how busy the stripe_cache is
4694 */
4695
4696 if (test_bit(R5_INACTIVE_BLOCKED, &conf->cache_state))
4697 return 1;
4698 if (conf->quiesce)
4699 return 1;
4700 if (atomic_read(&conf->empty_inactive_list_nr))
4701 return 1;
4702
4703 return 0;
4704 }
4705
4706 /* We want read requests to align with chunks where possible,
4707 * but write requests don't need to.
4708 */
4709 static int raid5_mergeable_bvec(struct mddev *mddev,
4710 struct bvec_merge_data *bvm,
4711 struct bio_vec *biovec)
4712 {
4713 sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
4714 int max;
4715 unsigned int chunk_sectors = mddev->chunk_sectors;
4716 unsigned int bio_sectors = bvm->bi_size >> 9;
4717
4718 /*
4719 * always allow writes to be mergeable, read as well if array
4720 * is degraded as we'll go through stripe cache anyway.
4721 */
4722 if ((bvm->bi_rw & 1) == WRITE || mddev->degraded)
4723 return biovec->bv_len;
4724
4725 if (mddev->new_chunk_sectors < mddev->chunk_sectors)
4726 chunk_sectors = mddev->new_chunk_sectors;
4727 max = (chunk_sectors - ((sector & (chunk_sectors - 1)) + bio_sectors)) << 9;
4728 if (max < 0) max = 0;
4729 if (max <= biovec->bv_len && bio_sectors == 0)
4730 return biovec->bv_len;
4731 else
4732 return max;
4733 }
4734
4735 static int in_chunk_boundary(struct mddev *mddev, struct bio *bio)
4736 {
4737 sector_t sector = bio->bi_iter.bi_sector + get_start_sect(bio->bi_bdev);
4738 unsigned int chunk_sectors = mddev->chunk_sectors;
4739 unsigned int bio_sectors = bio_sectors(bio);
4740
4741 if (mddev->new_chunk_sectors < mddev->chunk_sectors)
4742 chunk_sectors = mddev->new_chunk_sectors;
4743 return chunk_sectors >=
4744 ((sector & (chunk_sectors - 1)) + bio_sectors);
4745 }
4746
4747 /*
4748 * add bio to the retry LIFO ( in O(1) ... we are in interrupt )
4749 * later sampled by raid5d.
4750 */
4751 static void add_bio_to_retry(struct bio *bi,struct r5conf *conf)
4752 {
4753 unsigned long flags;
4754
4755 spin_lock_irqsave(&conf->device_lock, flags);
4756
4757 bi->bi_next = conf->retry_read_aligned_list;
4758 conf->retry_read_aligned_list = bi;
4759
4760 spin_unlock_irqrestore(&conf->device_lock, flags);
4761 md_wakeup_thread(conf->mddev->thread);
4762 }
4763
4764 static struct bio *remove_bio_from_retry(struct r5conf *conf)
4765 {
4766 struct bio *bi;
4767
4768 bi = conf->retry_read_aligned;
4769 if (bi) {
4770 conf->retry_read_aligned = NULL;
4771 return bi;
4772 }
4773 bi = conf->retry_read_aligned_list;
4774 if(bi) {
4775 conf->retry_read_aligned_list = bi->bi_next;
4776 bi->bi_next = NULL;
4777 /*
4778 * this sets the active strip count to 1 and the processed
4779 * strip count to zero (upper 8 bits)
4780 */
4781 raid5_set_bi_stripes(bi, 1); /* biased count of active stripes */
4782 }
4783
4784 return bi;
4785 }
4786
4787 /*
4788 * The "raid5_align_endio" should check if the read succeeded and if it
4789 * did, call bio_endio on the original bio (having bio_put the new bio
4790 * first).
4791 * If the read failed..
4792 */
4793 static void raid5_align_endio(struct bio *bi, int error)
4794 {
4795 struct bio* raid_bi = bi->bi_private;
4796 struct mddev *mddev;
4797 struct r5conf *conf;
4798 int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
4799 struct md_rdev *rdev;
4800
4801 bio_put(bi);
4802
4803 rdev = (void*)raid_bi->bi_next;
4804 raid_bi->bi_next = NULL;
4805 mddev = rdev->mddev;
4806 conf = mddev->private;
4807
4808 rdev_dec_pending(rdev, conf->mddev);
4809
4810 if (!error && uptodate) {
4811 trace_block_bio_complete(bdev_get_queue(raid_bi->bi_bdev),
4812 raid_bi, 0);
4813 bio_endio(raid_bi, 0);
4814 if (atomic_dec_and_test(&conf->active_aligned_reads))
4815 wake_up(&conf->wait_for_stripe);
4816 return;
4817 }
4818
4819 pr_debug("raid5_align_endio : io error...handing IO for a retry\n");
4820
4821 add_bio_to_retry(raid_bi, conf);
4822 }
4823
4824 static int bio_fits_rdev(struct bio *bi)
4825 {
4826 struct request_queue *q = bdev_get_queue(bi->bi_bdev);
4827
4828 if (bio_sectors(bi) > queue_max_sectors(q))
4829 return 0;
4830 blk_recount_segments(q, bi);
4831 if (bi->bi_phys_segments > queue_max_segments(q))
4832 return 0;
4833
4834 if (q->merge_bvec_fn)
4835 /* it's too hard to apply the merge_bvec_fn at this stage,
4836 * just just give up
4837 */
4838 return 0;
4839
4840 return 1;
4841 }
4842
4843 static int chunk_aligned_read(struct mddev *mddev, struct bio * raid_bio)
4844 {
4845 struct r5conf *conf = mddev->private;
4846 int dd_idx;
4847 struct bio* align_bi;
4848 struct md_rdev *rdev;
4849 sector_t end_sector;
4850
4851 if (!in_chunk_boundary(mddev, raid_bio)) {
4852 pr_debug("chunk_aligned_read : non aligned\n");
4853 return 0;
4854 }
4855 /*
4856 * use bio_clone_mddev to make a copy of the bio
4857 */
4858 align_bi = bio_clone_mddev(raid_bio, GFP_NOIO, mddev);
4859 if (!align_bi)
4860 return 0;
4861 /*
4862 * set bi_end_io to a new function, and set bi_private to the
4863 * original bio.
4864 */
4865 align_bi->bi_end_io = raid5_align_endio;
4866 align_bi->bi_private = raid_bio;
4867 /*
4868 * compute position
4869 */
4870 align_bi->bi_iter.bi_sector =
4871 raid5_compute_sector(conf, raid_bio->bi_iter.bi_sector,
4872 0, &dd_idx, NULL);
4873
4874 end_sector = bio_end_sector(align_bi);
4875 rcu_read_lock();
4876 rdev = rcu_dereference(conf->disks[dd_idx].replacement);
4877 if (!rdev || test_bit(Faulty, &rdev->flags) ||
4878 rdev->recovery_offset < end_sector) {
4879 rdev = rcu_dereference(conf->disks[dd_idx].rdev);
4880 if (rdev &&
4881 (test_bit(Faulty, &rdev->flags) ||
4882 !(test_bit(In_sync, &rdev->flags) ||
4883 rdev->recovery_offset >= end_sector)))
4884 rdev = NULL;
4885 }
4886 if (rdev) {
4887 sector_t first_bad;
4888 int bad_sectors;
4889
4890 atomic_inc(&rdev->nr_pending);
4891 rcu_read_unlock();
4892 raid_bio->bi_next = (void*)rdev;
4893 align_bi->bi_bdev = rdev->bdev;
4894 __clear_bit(BIO_SEG_VALID, &align_bi->bi_flags);
4895
4896 if (!bio_fits_rdev(align_bi) ||
4897 is_badblock(rdev, align_bi->bi_iter.bi_sector,
4898 bio_sectors(align_bi),
4899 &first_bad, &bad_sectors)) {
4900 /* too big in some way, or has a known bad block */
4901 bio_put(align_bi);
4902 rdev_dec_pending(rdev, mddev);
4903 return 0;
4904 }
4905
4906 /* No reshape active, so we can trust rdev->data_offset */
4907 align_bi->bi_iter.bi_sector += rdev->data_offset;
4908
4909 spin_lock_irq(&conf->device_lock);
4910 wait_event_lock_irq(conf->wait_for_stripe,
4911 conf->quiesce == 0,
4912 conf->device_lock);
4913 atomic_inc(&conf->active_aligned_reads);
4914 spin_unlock_irq(&conf->device_lock);
4915
4916 if (mddev->gendisk)
4917 trace_block_bio_remap(bdev_get_queue(align_bi->bi_bdev),
4918 align_bi, disk_devt(mddev->gendisk),
4919 raid_bio->bi_iter.bi_sector);
4920 generic_make_request(align_bi);
4921 return 1;
4922 } else {
4923 rcu_read_unlock();
4924 bio_put(align_bi);
4925 return 0;
4926 }
4927 }
4928
4929 /* __get_priority_stripe - get the next stripe to process
4930 *
4931 * Full stripe writes are allowed to pass preread active stripes up until
4932 * the bypass_threshold is exceeded. In general the bypass_count
4933 * increments when the handle_list is handled before the hold_list; however, it
4934 * will not be incremented when STRIPE_IO_STARTED is sampled set signifying a
4935 * stripe with in flight i/o. The bypass_count will be reset when the
4936 * head of the hold_list has changed, i.e. the head was promoted to the
4937 * handle_list.
4938 */
4939 static struct stripe_head *__get_priority_stripe(struct r5conf *conf, int group)
4940 {
4941 struct stripe_head *sh = NULL, *tmp;
4942 struct list_head *handle_list = NULL;
4943 struct r5worker_group *wg = NULL;
4944
4945 if (conf->worker_cnt_per_group == 0) {
4946 handle_list = &conf->handle_list;
4947 } else if (group != ANY_GROUP) {
4948 handle_list = &conf->worker_groups[group].handle_list;
4949 wg = &conf->worker_groups[group];
4950 } else {
4951 int i;
4952 for (i = 0; i < conf->group_cnt; i++) {
4953 handle_list = &conf->worker_groups[i].handle_list;
4954 wg = &conf->worker_groups[i];
4955 if (!list_empty(handle_list))
4956 break;
4957 }
4958 }
4959
4960 pr_debug("%s: handle: %s hold: %s full_writes: %d bypass_count: %d\n",
4961 __func__,
4962 list_empty(handle_list) ? "empty" : "busy",
4963 list_empty(&conf->hold_list) ? "empty" : "busy",
4964 atomic_read(&conf->pending_full_writes), conf->bypass_count);
4965
4966 if (!list_empty(handle_list)) {
4967 sh = list_entry(handle_list->next, typeof(*sh), lru);
4968
4969 if (list_empty(&conf->hold_list))
4970 conf->bypass_count = 0;
4971 else if (!test_bit(STRIPE_IO_STARTED, &sh->state)) {
4972 if (conf->hold_list.next == conf->last_hold)
4973 conf->bypass_count++;
4974 else {
4975 conf->last_hold = conf->hold_list.next;
4976 conf->bypass_count -= conf->bypass_threshold;
4977 if (conf->bypass_count < 0)
4978 conf->bypass_count = 0;
4979 }
4980 }
4981 } else if (!list_empty(&conf->hold_list) &&
4982 ((conf->bypass_threshold &&
4983 conf->bypass_count > conf->bypass_threshold) ||
4984 atomic_read(&conf->pending_full_writes) == 0)) {
4985
4986 list_for_each_entry(tmp, &conf->hold_list, lru) {
4987 if (conf->worker_cnt_per_group == 0 ||
4988 group == ANY_GROUP ||
4989 !cpu_online(tmp->cpu) ||
4990 cpu_to_group(tmp->cpu) == group) {
4991 sh = tmp;
4992 break;
4993 }
4994 }
4995
4996 if (sh) {
4997 conf->bypass_count -= conf->bypass_threshold;
4998 if (conf->bypass_count < 0)
4999 conf->bypass_count = 0;
5000 }
5001 wg = NULL;
5002 }
5003
5004 if (!sh)
5005 return NULL;
5006
5007 if (wg) {
5008 wg->stripes_cnt--;
5009 sh->group = NULL;
5010 }
5011 list_del_init(&sh->lru);
5012 BUG_ON(atomic_inc_return(&sh->count) != 1);
5013 return sh;
5014 }
5015
5016 struct raid5_plug_cb {
5017 struct blk_plug_cb cb;
5018 struct list_head list;
5019 struct list_head temp_inactive_list[NR_STRIPE_HASH_LOCKS];
5020 };
5021
5022 static void raid5_unplug(struct blk_plug_cb *blk_cb, bool from_schedule)
5023 {
5024 struct raid5_plug_cb *cb = container_of(
5025 blk_cb, struct raid5_plug_cb, cb);
5026 struct stripe_head *sh;
5027 struct mddev *mddev = cb->cb.data;
5028 struct r5conf *conf = mddev->private;
5029 int cnt = 0;
5030 int hash;
5031
5032 if (cb->list.next && !list_empty(&cb->list)) {
5033 spin_lock_irq(&conf->device_lock);
5034 while (!list_empty(&cb->list)) {
5035 sh = list_first_entry(&cb->list, struct stripe_head, lru);
5036 list_del_init(&sh->lru);
5037 /*
5038 * avoid race release_stripe_plug() sees
5039 * STRIPE_ON_UNPLUG_LIST clear but the stripe
5040 * is still in our list
5041 */
5042 smp_mb__before_atomic();
5043 clear_bit(STRIPE_ON_UNPLUG_LIST, &sh->state);
5044 /*
5045 * STRIPE_ON_RELEASE_LIST could be set here. In that
5046 * case, the count is always > 1 here
5047 */
5048 hash = sh->hash_lock_index;
5049 __release_stripe(conf, sh, &cb->temp_inactive_list[hash]);
5050 cnt++;
5051 }
5052 spin_unlock_irq(&conf->device_lock);
5053 }
5054 release_inactive_stripe_list(conf, cb->temp_inactive_list,
5055 NR_STRIPE_HASH_LOCKS);
5056 if (mddev->queue)
5057 trace_block_unplug(mddev->queue, cnt, !from_schedule);
5058 kfree(cb);
5059 }
5060
5061 static void release_stripe_plug(struct mddev *mddev,
5062 struct stripe_head *sh)
5063 {
5064 struct blk_plug_cb *blk_cb = blk_check_plugged(
5065 raid5_unplug, mddev,
5066 sizeof(struct raid5_plug_cb));
5067 struct raid5_plug_cb *cb;
5068
5069 if (!blk_cb) {
5070 release_stripe(sh);
5071 return;
5072 }
5073
5074 cb = container_of(blk_cb, struct raid5_plug_cb, cb);
5075
5076 if (cb->list.next == NULL) {
5077 int i;
5078 INIT_LIST_HEAD(&cb->list);
5079 for (i = 0; i < NR_STRIPE_HASH_LOCKS; i++)
5080 INIT_LIST_HEAD(cb->temp_inactive_list + i);
5081 }
5082
5083 if (!test_and_set_bit(STRIPE_ON_UNPLUG_LIST, &sh->state))
5084 list_add_tail(&sh->lru, &cb->list);
5085 else
5086 release_stripe(sh);
5087 }
5088
5089 static void make_discard_request(struct mddev *mddev, struct bio *bi)
5090 {
5091 struct r5conf *conf = mddev->private;
5092 sector_t logical_sector, last_sector;
5093 struct stripe_head *sh;
5094 int remaining;
5095 int stripe_sectors;
5096
5097 if (mddev->reshape_position != MaxSector)
5098 /* Skip discard while reshape is happening */
5099 return;
5100
5101 logical_sector = bi->bi_iter.bi_sector & ~((sector_t)STRIPE_SECTORS-1);
5102 last_sector = bi->bi_iter.bi_sector + (bi->bi_iter.bi_size>>9);
5103
5104 bi->bi_next = NULL;
5105 bi->bi_phys_segments = 1; /* over-loaded to count active stripes */
5106
5107 stripe_sectors = conf->chunk_sectors *
5108 (conf->raid_disks - conf->max_degraded);
5109 logical_sector = DIV_ROUND_UP_SECTOR_T(logical_sector,
5110 stripe_sectors);
5111 sector_div(last_sector, stripe_sectors);
5112
5113 logical_sector *= conf->chunk_sectors;
5114 last_sector *= conf->chunk_sectors;
5115
5116 for (; logical_sector < last_sector;
5117 logical_sector += STRIPE_SECTORS) {
5118 DEFINE_WAIT(w);
5119 int d;
5120 again:
5121 sh = get_active_stripe(conf, logical_sector, 0, 0, 0);
5122 prepare_to_wait(&conf->wait_for_overlap, &w,
5123 TASK_UNINTERRUPTIBLE);
5124 set_bit(R5_Overlap, &sh->dev[sh->pd_idx].flags);
5125 if (test_bit(STRIPE_SYNCING, &sh->state)) {
5126 release_stripe(sh);
5127 schedule();
5128 goto again;
5129 }
5130 clear_bit(R5_Overlap, &sh->dev[sh->pd_idx].flags);
5131 spin_lock_irq(&sh->stripe_lock);
5132 for (d = 0; d < conf->raid_disks; d++) {
5133 if (d == sh->pd_idx || d == sh->qd_idx)
5134 continue;
5135 if (sh->dev[d].towrite || sh->dev[d].toread) {
5136 set_bit(R5_Overlap, &sh->dev[d].flags);
5137 spin_unlock_irq(&sh->stripe_lock);
5138 release_stripe(sh);
5139 schedule();
5140 goto again;
5141 }
5142 }
5143 set_bit(STRIPE_DISCARD, &sh->state);
5144 finish_wait(&conf->wait_for_overlap, &w);
5145 sh->overwrite_disks = 0;
5146 for (d = 0; d < conf->raid_disks; d++) {
5147 if (d == sh->pd_idx || d == sh->qd_idx)
5148 continue;
5149 sh->dev[d].towrite = bi;
5150 set_bit(R5_OVERWRITE, &sh->dev[d].flags);
5151 raid5_inc_bi_active_stripes(bi);
5152 sh->overwrite_disks++;
5153 }
5154 spin_unlock_irq(&sh->stripe_lock);
5155 if (conf->mddev->bitmap) {
5156 for (d = 0;
5157 d < conf->raid_disks - conf->max_degraded;
5158 d++)
5159 bitmap_startwrite(mddev->bitmap,
5160 sh->sector,
5161 STRIPE_SECTORS,
5162 0);
5163 sh->bm_seq = conf->seq_flush + 1;
5164 set_bit(STRIPE_BIT_DELAY, &sh->state);
5165 }
5166
5167 set_bit(STRIPE_HANDLE, &sh->state);
5168 clear_bit(STRIPE_DELAYED, &sh->state);
5169 if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
5170 atomic_inc(&conf->preread_active_stripes);
5171 release_stripe_plug(mddev, sh);
5172 }
5173
5174 remaining = raid5_dec_bi_active_stripes(bi);
5175 if (remaining == 0) {
5176 md_write_end(mddev);
5177 bio_endio(bi, 0);
5178 }
5179 }
5180
5181 static void make_request(struct mddev *mddev, struct bio * bi)
5182 {
5183 struct r5conf *conf = mddev->private;
5184 int dd_idx;
5185 sector_t new_sector;
5186 sector_t logical_sector, last_sector;
5187 struct stripe_head *sh;
5188 const int rw = bio_data_dir(bi);
5189 int remaining;
5190 DEFINE_WAIT(w);
5191 bool do_prepare;
5192
5193 if (unlikely(bi->bi_rw & REQ_FLUSH)) {
5194 md_flush_request(mddev, bi);
5195 return;
5196 }
5197
5198 md_write_start(mddev, bi);
5199
5200 /*
5201 * If array is degraded, better not do chunk aligned read because
5202 * later we might have to read it again in order to reconstruct
5203 * data on failed drives.
5204 */
5205 if (rw == READ && mddev->degraded == 0 &&
5206 mddev->reshape_position == MaxSector &&
5207 chunk_aligned_read(mddev,bi))
5208 return;
5209
5210 if (unlikely(bi->bi_rw & REQ_DISCARD)) {
5211 make_discard_request(mddev, bi);
5212 return;
5213 }
5214
5215 logical_sector = bi->bi_iter.bi_sector & ~((sector_t)STRIPE_SECTORS-1);
5216 last_sector = bio_end_sector(bi);
5217 bi->bi_next = NULL;
5218 bi->bi_phys_segments = 1; /* over-loaded to count active stripes */
5219
5220 prepare_to_wait(&conf->wait_for_overlap, &w, TASK_UNINTERRUPTIBLE);
5221 for (;logical_sector < last_sector; logical_sector += STRIPE_SECTORS) {
5222 int previous;
5223 int seq;
5224
5225 do_prepare = false;
5226 retry:
5227 seq = read_seqcount_begin(&conf->gen_lock);
5228 previous = 0;
5229 if (do_prepare)
5230 prepare_to_wait(&conf->wait_for_overlap, &w,
5231 TASK_UNINTERRUPTIBLE);
5232 if (unlikely(conf->reshape_progress != MaxSector)) {
5233 /* spinlock is needed as reshape_progress may be
5234 * 64bit on a 32bit platform, and so it might be
5235 * possible to see a half-updated value
5236 * Of course reshape_progress could change after
5237 * the lock is dropped, so once we get a reference
5238 * to the stripe that we think it is, we will have
5239 * to check again.
5240 */
5241 spin_lock_irq(&conf->device_lock);
5242 if (mddev->reshape_backwards
5243 ? logical_sector < conf->reshape_progress
5244 : logical_sector >= conf->reshape_progress) {
5245 previous = 1;
5246 } else {
5247 if (mddev->reshape_backwards
5248 ? logical_sector < conf->reshape_safe
5249 : logical_sector >= conf->reshape_safe) {
5250 spin_unlock_irq(&conf->device_lock);
5251 schedule();
5252 do_prepare = true;
5253 goto retry;
5254 }
5255 }
5256 spin_unlock_irq(&conf->device_lock);
5257 }
5258
5259 new_sector = raid5_compute_sector(conf, logical_sector,
5260 previous,
5261 &dd_idx, NULL);
5262 pr_debug("raid456: make_request, sector %llu logical %llu\n",
5263 (unsigned long long)new_sector,
5264 (unsigned long long)logical_sector);
5265
5266 sh = get_active_stripe(conf, new_sector, previous,
5267 (bi->bi_rw&RWA_MASK), 0);
5268 if (sh) {
5269 if (unlikely(previous)) {
5270 /* expansion might have moved on while waiting for a
5271 * stripe, so we must do the range check again.
5272 * Expansion could still move past after this
5273 * test, but as we are holding a reference to
5274 * 'sh', we know that if that happens,
5275 * STRIPE_EXPANDING will get set and the expansion
5276 * won't proceed until we finish with the stripe.
5277 */
5278 int must_retry = 0;
5279 spin_lock_irq(&conf->device_lock);
5280 if (mddev->reshape_backwards
5281 ? logical_sector >= conf->reshape_progress
5282 : logical_sector < conf->reshape_progress)
5283 /* mismatch, need to try again */
5284 must_retry = 1;
5285 spin_unlock_irq(&conf->device_lock);
5286 if (must_retry) {
5287 release_stripe(sh);
5288 schedule();
5289 do_prepare = true;
5290 goto retry;
5291 }
5292 }
5293 if (read_seqcount_retry(&conf->gen_lock, seq)) {
5294 /* Might have got the wrong stripe_head
5295 * by accident
5296 */
5297 release_stripe(sh);
5298 goto retry;
5299 }
5300
5301 if (rw == WRITE &&
5302 logical_sector >= mddev->suspend_lo &&
5303 logical_sector < mddev->suspend_hi) {
5304 release_stripe(sh);
5305 /* As the suspend_* range is controlled by
5306 * userspace, we want an interruptible
5307 * wait.
5308 */
5309 flush_signals(current);
5310 prepare_to_wait(&conf->wait_for_overlap,
5311 &w, TASK_INTERRUPTIBLE);
5312 if (logical_sector >= mddev->suspend_lo &&
5313 logical_sector < mddev->suspend_hi) {
5314 schedule();
5315 do_prepare = true;
5316 }
5317 goto retry;
5318 }
5319
5320 if (test_bit(STRIPE_EXPANDING, &sh->state) ||
5321 !add_stripe_bio(sh, bi, dd_idx, rw, previous)) {
5322 /* Stripe is busy expanding or
5323 * add failed due to overlap. Flush everything
5324 * and wait a while
5325 */
5326 md_wakeup_thread(mddev->thread);
5327 release_stripe(sh);
5328 schedule();
5329 do_prepare = true;
5330 goto retry;
5331 }
5332 set_bit(STRIPE_HANDLE, &sh->state);
5333 clear_bit(STRIPE_DELAYED, &sh->state);
5334 if ((!sh->batch_head || sh == sh->batch_head) &&
5335 (bi->bi_rw & REQ_SYNC) &&
5336 !test_and_set_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
5337 atomic_inc(&conf->preread_active_stripes);
5338 release_stripe_plug(mddev, sh);
5339 } else {
5340 /* cannot get stripe for read-ahead, just give-up */
5341 clear_bit(BIO_UPTODATE, &bi->bi_flags);
5342 break;
5343 }
5344 }
5345 finish_wait(&conf->wait_for_overlap, &w);
5346
5347 remaining = raid5_dec_bi_active_stripes(bi);
5348 if (remaining == 0) {
5349
5350 if ( rw == WRITE )
5351 md_write_end(mddev);
5352
5353 trace_block_bio_complete(bdev_get_queue(bi->bi_bdev),
5354 bi, 0);
5355 bio_endio(bi, 0);
5356 }
5357 }
5358
5359 static sector_t raid5_size(struct mddev *mddev, sector_t sectors, int raid_disks);
5360
5361 static sector_t reshape_request(struct mddev *mddev, sector_t sector_nr, int *skipped)
5362 {
5363 /* reshaping is quite different to recovery/resync so it is
5364 * handled quite separately ... here.
5365 *
5366 * On each call to sync_request, we gather one chunk worth of
5367 * destination stripes and flag them as expanding.
5368 * Then we find all the source stripes and request reads.
5369 * As the reads complete, handle_stripe will copy the data
5370 * into the destination stripe and release that stripe.
5371 */
5372 struct r5conf *conf = mddev->private;
5373 struct stripe_head *sh;
5374 sector_t first_sector, last_sector;
5375 int raid_disks = conf->previous_raid_disks;
5376 int data_disks = raid_disks - conf->max_degraded;
5377 int new_data_disks = conf->raid_disks - conf->max_degraded;
5378 int i;
5379 int dd_idx;
5380 sector_t writepos, readpos, safepos;
5381 sector_t stripe_addr;
5382 int reshape_sectors;
5383 struct list_head stripes;
5384
5385 if (sector_nr == 0) {
5386 /* If restarting in the middle, skip the initial sectors */
5387 if (mddev->reshape_backwards &&
5388 conf->reshape_progress < raid5_size(mddev, 0, 0)) {
5389 sector_nr = raid5_size(mddev, 0, 0)
5390 - conf->reshape_progress;
5391 } else if (!mddev->reshape_backwards &&
5392 conf->reshape_progress > 0)
5393 sector_nr = conf->reshape_progress;
5394 sector_div(sector_nr, new_data_disks);
5395 if (sector_nr) {
5396 mddev->curr_resync_completed = sector_nr;
5397 sysfs_notify(&mddev->kobj, NULL, "sync_completed");
5398 *skipped = 1;
5399 return sector_nr;
5400 }
5401 }
5402
5403 /* We need to process a full chunk at a time.
5404 * If old and new chunk sizes differ, we need to process the
5405 * largest of these
5406 */
5407 if (mddev->new_chunk_sectors > mddev->chunk_sectors)
5408 reshape_sectors = mddev->new_chunk_sectors;
5409 else
5410 reshape_sectors = mddev->chunk_sectors;
5411
5412 /* We update the metadata at least every 10 seconds, or when
5413 * the data about to be copied would over-write the source of
5414 * the data at the front of the range. i.e. one new_stripe
5415 * along from reshape_progress new_maps to after where
5416 * reshape_safe old_maps to
5417 */
5418 writepos = conf->reshape_progress;
5419 sector_div(writepos, new_data_disks);
5420 readpos = conf->reshape_progress;
5421 sector_div(readpos, data_disks);
5422 safepos = conf->reshape_safe;
5423 sector_div(safepos, data_disks);
5424 if (mddev->reshape_backwards) {
5425 writepos -= min_t(sector_t, reshape_sectors, writepos);
5426 readpos += reshape_sectors;
5427 safepos += reshape_sectors;
5428 } else {
5429 writepos += reshape_sectors;
5430 readpos -= min_t(sector_t, reshape_sectors, readpos);
5431 safepos -= min_t(sector_t, reshape_sectors, safepos);
5432 }
5433
5434 /* Having calculated the 'writepos' possibly use it
5435 * to set 'stripe_addr' which is where we will write to.
5436 */
5437 if (mddev->reshape_backwards) {
5438 BUG_ON(conf->reshape_progress == 0);
5439 stripe_addr = writepos;
5440 BUG_ON((mddev->dev_sectors &
5441 ~((sector_t)reshape_sectors - 1))
5442 - reshape_sectors - stripe_addr
5443 != sector_nr);
5444 } else {
5445 BUG_ON(writepos != sector_nr + reshape_sectors);
5446 stripe_addr = sector_nr;
5447 }
5448
5449 /* 'writepos' is the most advanced device address we might write.
5450 * 'readpos' is the least advanced device address we might read.
5451 * 'safepos' is the least address recorded in the metadata as having
5452 * been reshaped.
5453 * If there is a min_offset_diff, these are adjusted either by
5454 * increasing the safepos/readpos if diff is negative, or
5455 * increasing writepos if diff is positive.
5456 * If 'readpos' is then behind 'writepos', there is no way that we can
5457 * ensure safety in the face of a crash - that must be done by userspace
5458 * making a backup of the data. So in that case there is no particular
5459 * rush to update metadata.
5460 * Otherwise if 'safepos' is behind 'writepos', then we really need to
5461 * update the metadata to advance 'safepos' to match 'readpos' so that
5462 * we can be safe in the event of a crash.
5463 * So we insist on updating metadata if safepos is behind writepos and
5464 * readpos is beyond writepos.
5465 * In any case, update the metadata every 10 seconds.
5466 * Maybe that number should be configurable, but I'm not sure it is
5467 * worth it.... maybe it could be a multiple of safemode_delay???
5468 */
5469 if (conf->min_offset_diff < 0) {
5470 safepos += -conf->min_offset_diff;
5471 readpos += -conf->min_offset_diff;
5472 } else
5473 writepos += conf->min_offset_diff;
5474
5475 if ((mddev->reshape_backwards
5476 ? (safepos > writepos && readpos < writepos)
5477 : (safepos < writepos && readpos > writepos)) ||
5478 time_after(jiffies, conf->reshape_checkpoint + 10*HZ)) {
5479 /* Cannot proceed until we've updated the superblock... */
5480 wait_event(conf->wait_for_overlap,
5481 atomic_read(&conf->reshape_stripes)==0
5482 || test_bit(MD_RECOVERY_INTR, &mddev->recovery));
5483 if (atomic_read(&conf->reshape_stripes) != 0)
5484 return 0;
5485 mddev->reshape_position = conf->reshape_progress;
5486 mddev->curr_resync_completed = sector_nr;
5487 conf->reshape_checkpoint = jiffies;
5488 set_bit(MD_CHANGE_DEVS, &mddev->flags);
5489 md_wakeup_thread(mddev->thread);
5490 wait_event(mddev->sb_wait, mddev->flags == 0 ||
5491 test_bit(MD_RECOVERY_INTR, &mddev->recovery));
5492 if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
5493 return 0;
5494 spin_lock_irq(&conf->device_lock);
5495 conf->reshape_safe = mddev->reshape_position;
5496 spin_unlock_irq(&conf->device_lock);
5497 wake_up(&conf->wait_for_overlap);
5498 sysfs_notify(&mddev->kobj, NULL, "sync_completed");
5499 }
5500
5501 INIT_LIST_HEAD(&stripes);
5502 for (i = 0; i < reshape_sectors; i += STRIPE_SECTORS) {
5503 int j;
5504 int skipped_disk = 0;
5505 sh = get_active_stripe(conf, stripe_addr+i, 0, 0, 1);
5506 set_bit(STRIPE_EXPANDING, &sh->state);
5507 atomic_inc(&conf->reshape_stripes);
5508 /* If any of this stripe is beyond the end of the old
5509 * array, then we need to zero those blocks
5510 */
5511 for (j=sh->disks; j--;) {
5512 sector_t s;
5513 if (j == sh->pd_idx)
5514 continue;
5515 if (conf->level == 6 &&
5516 j == sh->qd_idx)
5517 continue;
5518 s = compute_blocknr(sh, j, 0);
5519 if (s < raid5_size(mddev, 0, 0)) {
5520 skipped_disk = 1;
5521 continue;
5522 }
5523 memset(page_address(sh->dev[j].page), 0, STRIPE_SIZE);
5524 set_bit(R5_Expanded, &sh->dev[j].flags);
5525 set_bit(R5_UPTODATE, &sh->dev[j].flags);
5526 }
5527 if (!skipped_disk) {
5528 set_bit(STRIPE_EXPAND_READY, &sh->state);
5529 set_bit(STRIPE_HANDLE, &sh->state);
5530 }
5531 list_add(&sh->lru, &stripes);
5532 }
5533 spin_lock_irq(&conf->device_lock);
5534 if (mddev->reshape_backwards)
5535 conf->reshape_progress -= reshape_sectors * new_data_disks;
5536 else
5537 conf->reshape_progress += reshape_sectors * new_data_disks;
5538 spin_unlock_irq(&conf->device_lock);
5539 /* Ok, those stripe are ready. We can start scheduling
5540 * reads on the source stripes.
5541 * The source stripes are determined by mapping the first and last
5542 * block on the destination stripes.
5543 */
5544 first_sector =
5545 raid5_compute_sector(conf, stripe_addr*(new_data_disks),
5546 1, &dd_idx, NULL);
5547 last_sector =
5548 raid5_compute_sector(conf, ((stripe_addr+reshape_sectors)
5549 * new_data_disks - 1),
5550 1, &dd_idx, NULL);
5551 if (last_sector >= mddev->dev_sectors)
5552 last_sector = mddev->dev_sectors - 1;
5553 while (first_sector <= last_sector) {
5554 sh = get_active_stripe(conf, first_sector, 1, 0, 1);
5555 set_bit(STRIPE_EXPAND_SOURCE, &sh->state);
5556 set_bit(STRIPE_HANDLE, &sh->state);
5557 release_stripe(sh);
5558 first_sector += STRIPE_SECTORS;
5559 }
5560 /* Now that the sources are clearly marked, we can release
5561 * the destination stripes
5562 */
5563 while (!list_empty(&stripes)) {
5564 sh = list_entry(stripes.next, struct stripe_head, lru);
5565 list_del_init(&sh->lru);
5566 release_stripe(sh);
5567 }
5568 /* If this takes us to the resync_max point where we have to pause,
5569 * then we need to write out the superblock.
5570 */
5571 sector_nr += reshape_sectors;
5572 if ((sector_nr - mddev->curr_resync_completed) * 2
5573 >= mddev->resync_max - mddev->curr_resync_completed) {
5574 /* Cannot proceed until we've updated the superblock... */
5575 wait_event(conf->wait_for_overlap,
5576 atomic_read(&conf->reshape_stripes) == 0
5577 || test_bit(MD_RECOVERY_INTR, &mddev->recovery));
5578 if (atomic_read(&conf->reshape_stripes) != 0)
5579 goto ret;
5580 mddev->reshape_position = conf->reshape_progress;
5581 mddev->curr_resync_completed = sector_nr;
5582 conf->reshape_checkpoint = jiffies;
5583 set_bit(MD_CHANGE_DEVS, &mddev->flags);
5584 md_wakeup_thread(mddev->thread);
5585 wait_event(mddev->sb_wait,
5586 !test_bit(MD_CHANGE_DEVS, &mddev->flags)
5587 || test_bit(MD_RECOVERY_INTR, &mddev->recovery));
5588 if (test_bit(MD_RECOVERY_INTR, &mddev->recovery))
5589 goto ret;
5590 spin_lock_irq(&conf->device_lock);
5591 conf->reshape_safe = mddev->reshape_position;
5592 spin_unlock_irq(&conf->device_lock);
5593 wake_up(&conf->wait_for_overlap);
5594 sysfs_notify(&mddev->kobj, NULL, "sync_completed");
5595 }
5596 ret:
5597 return reshape_sectors;
5598 }
5599
5600 static inline sector_t sync_request(struct mddev *mddev, sector_t sector_nr, int *skipped)
5601 {
5602 struct r5conf *conf = mddev->private;
5603 struct stripe_head *sh;
5604 sector_t max_sector = mddev->dev_sectors;
5605 sector_t sync_blocks;
5606 int still_degraded = 0;
5607 int i;
5608
5609 if (sector_nr >= max_sector) {
5610 /* just being told to finish up .. nothing much to do */
5611
5612 if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)) {
5613 end_reshape(conf);
5614 return 0;
5615 }
5616
5617 if (mddev->curr_resync < max_sector) /* aborted */
5618 bitmap_end_sync(mddev->bitmap, mddev->curr_resync,
5619 &sync_blocks, 1);
5620 else /* completed sync */
5621 conf->fullsync = 0;
5622 bitmap_close_sync(mddev->bitmap);
5623
5624 return 0;
5625 }
5626
5627 /* Allow raid5_quiesce to complete */
5628 wait_event(conf->wait_for_overlap, conf->quiesce != 2);
5629
5630 if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
5631 return reshape_request(mddev, sector_nr, skipped);
5632
5633 /* No need to check resync_max as we never do more than one
5634 * stripe, and as resync_max will always be on a chunk boundary,
5635 * if the check in md_do_sync didn't fire, there is no chance
5636 * of overstepping resync_max here
5637 */
5638
5639 /* if there is too many failed drives and we are trying
5640 * to resync, then assert that we are finished, because there is
5641 * nothing we can do.
5642 */
5643 if (mddev->degraded >= conf->max_degraded &&
5644 test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
5645 sector_t rv = mddev->dev_sectors - sector_nr;
5646 *skipped = 1;
5647 return rv;
5648 }
5649 if (!test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery) &&
5650 !conf->fullsync &&
5651 !bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, 1) &&
5652 sync_blocks >= STRIPE_SECTORS) {
5653 /* we can skip this block, and probably more */
5654 sync_blocks /= STRIPE_SECTORS;
5655 *skipped = 1;
5656 return sync_blocks * STRIPE_SECTORS; /* keep things rounded to whole stripes */
5657 }
5658
5659 bitmap_cond_end_sync(mddev->bitmap, sector_nr);
5660
5661 sh = get_active_stripe(conf, sector_nr, 0, 1, 0);
5662 if (sh == NULL) {
5663 sh = get_active_stripe(conf, sector_nr, 0, 0, 0);
5664 /* make sure we don't swamp the stripe cache if someone else
5665 * is trying to get access
5666 */
5667 schedule_timeout_uninterruptible(1);
5668 }
5669 /* Need to check if array will still be degraded after recovery/resync
5670 * Note in case of > 1 drive failures it's possible we're rebuilding
5671 * one drive while leaving another faulty drive in array.
5672 */
5673 rcu_read_lock();
5674 for (i = 0; i < conf->raid_disks; i++) {
5675 struct md_rdev *rdev = ACCESS_ONCE(conf->disks[i].rdev);
5676
5677 if (rdev == NULL || test_bit(Faulty, &rdev->flags))
5678 still_degraded = 1;
5679 }
5680 rcu_read_unlock();
5681
5682 bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, still_degraded);
5683
5684 set_bit(STRIPE_SYNC_REQUESTED, &sh->state);
5685 set_bit(STRIPE_HANDLE, &sh->state);
5686
5687 release_stripe(sh);
5688
5689 return STRIPE_SECTORS;
5690 }
5691
5692 static int retry_aligned_read(struct r5conf *conf, struct bio *raid_bio)
5693 {
5694 /* We may not be able to submit a whole bio at once as there
5695 * may not be enough stripe_heads available.
5696 * We cannot pre-allocate enough stripe_heads as we may need
5697 * more than exist in the cache (if we allow ever large chunks).
5698 * So we do one stripe head at a time and record in
5699 * ->bi_hw_segments how many have been done.
5700 *
5701 * We *know* that this entire raid_bio is in one chunk, so
5702 * it will be only one 'dd_idx' and only need one call to raid5_compute_sector.
5703 */
5704 struct stripe_head *sh;
5705 int dd_idx;
5706 sector_t sector, logical_sector, last_sector;
5707 int scnt = 0;
5708 int remaining;
5709 int handled = 0;
5710
5711 logical_sector = raid_bio->bi_iter.bi_sector &
5712 ~((sector_t)STRIPE_SECTORS-1);
5713 sector = raid5_compute_sector(conf, logical_sector,
5714 0, &dd_idx, NULL);
5715 last_sector = bio_end_sector(raid_bio);
5716
5717 for (; logical_sector < last_sector;
5718 logical_sector += STRIPE_SECTORS,
5719 sector += STRIPE_SECTORS,
5720 scnt++) {
5721
5722 if (scnt < raid5_bi_processed_stripes(raid_bio))
5723 /* already done this stripe */
5724 continue;
5725
5726 sh = get_active_stripe(conf, sector, 0, 1, 1);
5727
5728 if (!sh) {
5729 /* failed to get a stripe - must wait */
5730 raid5_set_bi_processed_stripes(raid_bio, scnt);
5731 conf->retry_read_aligned = raid_bio;
5732 return handled;
5733 }
5734
5735 if (!add_stripe_bio(sh, raid_bio, dd_idx, 0, 0)) {
5736 release_stripe(sh);
5737 raid5_set_bi_processed_stripes(raid_bio, scnt);
5738 conf->retry_read_aligned = raid_bio;
5739 return handled;
5740 }
5741
5742 set_bit(R5_ReadNoMerge, &sh->dev[dd_idx].flags);
5743 handle_stripe(sh);
5744 release_stripe(sh);
5745 handled++;
5746 }
5747 remaining = raid5_dec_bi_active_stripes(raid_bio);
5748 if (remaining == 0) {
5749 trace_block_bio_complete(bdev_get_queue(raid_bio->bi_bdev),
5750 raid_bio, 0);
5751 bio_endio(raid_bio, 0);
5752 }
5753 if (atomic_dec_and_test(&conf->active_aligned_reads))
5754 wake_up(&conf->wait_for_stripe);
5755 return handled;
5756 }
5757
5758 static int handle_active_stripes(struct r5conf *conf, int group,
5759 struct r5worker *worker,
5760 struct list_head *temp_inactive_list)
5761 {
5762 struct stripe_head *batch[MAX_STRIPE_BATCH], *sh;
5763 int i, batch_size = 0, hash;
5764 bool release_inactive = false;
5765
5766 while (batch_size < MAX_STRIPE_BATCH &&
5767 (sh = __get_priority_stripe(conf, group)) != NULL)
5768 batch[batch_size++] = sh;
5769
5770 if (batch_size == 0) {
5771 for (i = 0; i < NR_STRIPE_HASH_LOCKS; i++)
5772 if (!list_empty(temp_inactive_list + i))
5773 break;
5774 if (i == NR_STRIPE_HASH_LOCKS)
5775 return batch_size;
5776 release_inactive = true;
5777 }
5778 spin_unlock_irq(&conf->device_lock);
5779
5780 release_inactive_stripe_list(conf, temp_inactive_list,
5781 NR_STRIPE_HASH_LOCKS);
5782
5783 if (release_inactive) {
5784 spin_lock_irq(&conf->device_lock);
5785 return 0;
5786 }
5787
5788 for (i = 0; i < batch_size; i++)
5789 handle_stripe(batch[i]);
5790
5791 cond_resched();
5792
5793 spin_lock_irq(&conf->device_lock);
5794 for (i = 0; i < batch_size; i++) {
5795 hash = batch[i]->hash_lock_index;
5796 __release_stripe(conf, batch[i], &temp_inactive_list[hash]);
5797 }
5798 return batch_size;
5799 }
5800
5801 static void raid5_do_work(struct work_struct *work)
5802 {
5803 struct r5worker *worker = container_of(work, struct r5worker, work);
5804 struct r5worker_group *group = worker->group;
5805 struct r5conf *conf = group->conf;
5806 int group_id = group - conf->worker_groups;
5807 int handled;
5808 struct blk_plug plug;
5809
5810 pr_debug("+++ raid5worker active\n");
5811
5812 blk_start_plug(&plug);
5813 handled = 0;
5814 spin_lock_irq(&conf->device_lock);
5815 while (1) {
5816 int batch_size, released;
5817
5818 released = release_stripe_list(conf, worker->temp_inactive_list);
5819
5820 batch_size = handle_active_stripes(conf, group_id, worker,
5821 worker->temp_inactive_list);
5822 worker->working = false;
5823 if (!batch_size && !released)
5824 break;
5825 handled += batch_size;
5826 }
5827 pr_debug("%d stripes handled\n", handled);
5828
5829 spin_unlock_irq(&conf->device_lock);
5830 blk_finish_plug(&plug);
5831
5832 pr_debug("--- raid5worker inactive\n");
5833 }
5834
5835 /*
5836 * This is our raid5 kernel thread.
5837 *
5838 * We scan the hash table for stripes which can be handled now.
5839 * During the scan, completed stripes are saved for us by the interrupt
5840 * handler, so that they will not have to wait for our next wakeup.
5841 */
5842 static void raid5d(struct md_thread *thread)
5843 {
5844 struct mddev *mddev = thread->mddev;
5845 struct r5conf *conf = mddev->private;
5846 int handled;
5847 struct blk_plug plug;
5848
5849 pr_debug("+++ raid5d active\n");
5850
5851 md_check_recovery(mddev);
5852
5853 blk_start_plug(&plug);
5854 handled = 0;
5855 spin_lock_irq(&conf->device_lock);
5856 while (1) {
5857 struct bio *bio;
5858 int batch_size, released;
5859
5860 released = release_stripe_list(conf, conf->temp_inactive_list);
5861 if (released)
5862 clear_bit(R5_DID_ALLOC, &conf->cache_state);
5863
5864 if (
5865 !list_empty(&conf->bitmap_list)) {
5866 /* Now is a good time to flush some bitmap updates */
5867 conf->seq_flush++;
5868 spin_unlock_irq(&conf->device_lock);
5869 bitmap_unplug(mddev->bitmap);
5870 spin_lock_irq(&conf->device_lock);
5871 conf->seq_write = conf->seq_flush;
5872 activate_bit_delay(conf, conf->temp_inactive_list);
5873 }
5874 raid5_activate_delayed(conf);
5875
5876 while ((bio = remove_bio_from_retry(conf))) {
5877 int ok;
5878 spin_unlock_irq(&conf->device_lock);
5879 ok = retry_aligned_read(conf, bio);
5880 spin_lock_irq(&conf->device_lock);
5881 if (!ok)
5882 break;
5883 handled++;
5884 }
5885
5886 batch_size = handle_active_stripes(conf, ANY_GROUP, NULL,
5887 conf->temp_inactive_list);
5888 if (!batch_size && !released)
5889 break;
5890 handled += batch_size;
5891
5892 if (mddev->flags & ~(1<<MD_CHANGE_PENDING)) {
5893 spin_unlock_irq(&conf->device_lock);
5894 md_check_recovery(mddev);
5895 spin_lock_irq(&conf->device_lock);
5896 }
5897 }
5898 pr_debug("%d stripes handled\n", handled);
5899
5900 spin_unlock_irq(&conf->device_lock);
5901 if (test_and_clear_bit(R5_ALLOC_MORE, &conf->cache_state)) {
5902 grow_one_stripe(conf, __GFP_NOWARN);
5903 /* Set flag even if allocation failed. This helps
5904 * slow down allocation requests when mem is short
5905 */
5906 set_bit(R5_DID_ALLOC, &conf->cache_state);
5907 }
5908
5909 async_tx_issue_pending_all();
5910 blk_finish_plug(&plug);
5911
5912 pr_debug("--- raid5d inactive\n");
5913 }
5914
5915 static ssize_t
5916 raid5_show_stripe_cache_size(struct mddev *mddev, char *page)
5917 {
5918 struct r5conf *conf;
5919 int ret = 0;
5920 spin_lock(&mddev->lock);
5921 conf = mddev->private;
5922 if (conf)
5923 ret = sprintf(page, "%d\n", conf->min_nr_stripes);
5924 spin_unlock(&mddev->lock);
5925 return ret;
5926 }
5927
5928 int
5929 raid5_set_cache_size(struct mddev *mddev, int size)
5930 {
5931 struct r5conf *conf = mddev->private;
5932 int err;
5933
5934 if (size <= 16 || size > 32768)
5935 return -EINVAL;
5936
5937 conf->min_nr_stripes = size;
5938 while (size < conf->max_nr_stripes &&
5939 drop_one_stripe(conf))
5940 ;
5941
5942
5943 err = md_allow_write(mddev);
5944 if (err)
5945 return err;
5946
5947 while (size > conf->max_nr_stripes)
5948 if (!grow_one_stripe(conf, GFP_KERNEL))
5949 break;
5950
5951 return 0;
5952 }
5953 EXPORT_SYMBOL(raid5_set_cache_size);
5954
5955 static ssize_t
5956 raid5_store_stripe_cache_size(struct mddev *mddev, const char *page, size_t len)
5957 {
5958 struct r5conf *conf;
5959 unsigned long new;
5960 int err;
5961
5962 if (len >= PAGE_SIZE)
5963 return -EINVAL;
5964 if (kstrtoul(page, 10, &new))
5965 return -EINVAL;
5966 err = mddev_lock(mddev);
5967 if (err)
5968 return err;
5969 conf = mddev->private;
5970 if (!conf)
5971 err = -ENODEV;
5972 else
5973 err = raid5_set_cache_size(mddev, new);
5974 mddev_unlock(mddev);
5975
5976 return err ?: len;
5977 }
5978
5979 static struct md_sysfs_entry
5980 raid5_stripecache_size = __ATTR(stripe_cache_size, S_IRUGO | S_IWUSR,
5981 raid5_show_stripe_cache_size,
5982 raid5_store_stripe_cache_size);
5983
5984 static ssize_t
5985 raid5_show_rmw_level(struct mddev *mddev, char *page)
5986 {
5987 struct r5conf *conf = mddev->private;
5988 if (conf)
5989 return sprintf(page, "%d\n", conf->rmw_level);
5990 else
5991 return 0;
5992 }
5993
5994 static ssize_t
5995 raid5_store_rmw_level(struct mddev *mddev, const char *page, size_t len)
5996 {
5997 struct r5conf *conf = mddev->private;
5998 unsigned long new;
5999
6000 if (!conf)
6001 return -ENODEV;
6002
6003 if (len >= PAGE_SIZE)
6004 return -EINVAL;
6005
6006 if (kstrtoul(page, 10, &new))
6007 return -EINVAL;
6008
6009 if (new != PARITY_DISABLE_RMW && !raid6_call.xor_syndrome)
6010 return -EINVAL;
6011
6012 if (new != PARITY_DISABLE_RMW &&
6013 new != PARITY_ENABLE_RMW &&
6014 new != PARITY_PREFER_RMW)
6015 return -EINVAL;
6016
6017 conf->rmw_level = new;
6018 return len;
6019 }
6020
6021 static struct md_sysfs_entry
6022 raid5_rmw_level = __ATTR(rmw_level, S_IRUGO | S_IWUSR,
6023 raid5_show_rmw_level,
6024 raid5_store_rmw_level);
6025
6026
6027 static ssize_t
6028 raid5_show_preread_threshold(struct mddev *mddev, char *page)
6029 {
6030 struct r5conf *conf;
6031 int ret = 0;
6032 spin_lock(&mddev->lock);
6033 conf = mddev->private;
6034 if (conf)
6035 ret = sprintf(page, "%d\n", conf->bypass_threshold);
6036 spin_unlock(&mddev->lock);
6037 return ret;
6038 }
6039
6040 static ssize_t
6041 raid5_store_preread_threshold(struct mddev *mddev, const char *page, size_t len)
6042 {
6043 struct r5conf *conf;
6044 unsigned long new;
6045 int err;
6046
6047 if (len >= PAGE_SIZE)
6048 return -EINVAL;
6049 if (kstrtoul(page, 10, &new))
6050 return -EINVAL;
6051
6052 err = mddev_lock(mddev);
6053 if (err)
6054 return err;
6055 conf = mddev->private;
6056 if (!conf)
6057 err = -ENODEV;
6058 else if (new > conf->min_nr_stripes)
6059 err = -EINVAL;
6060 else
6061 conf->bypass_threshold = new;
6062 mddev_unlock(mddev);
6063 return err ?: len;
6064 }
6065
6066 static struct md_sysfs_entry
6067 raid5_preread_bypass_threshold = __ATTR(preread_bypass_threshold,
6068 S_IRUGO | S_IWUSR,
6069 raid5_show_preread_threshold,
6070 raid5_store_preread_threshold);
6071
6072 static ssize_t
6073 raid5_show_skip_copy(struct mddev *mddev, char *page)
6074 {
6075 struct r5conf *conf;
6076 int ret = 0;
6077 spin_lock(&mddev->lock);
6078 conf = mddev->private;
6079 if (conf)
6080 ret = sprintf(page, "%d\n", conf->skip_copy);
6081 spin_unlock(&mddev->lock);
6082 return ret;
6083 }
6084
6085 static ssize_t
6086 raid5_store_skip_copy(struct mddev *mddev, const char *page, size_t len)
6087 {
6088 struct r5conf *conf;
6089 unsigned long new;
6090 int err;
6091
6092 if (len >= PAGE_SIZE)
6093 return -EINVAL;
6094 if (kstrtoul(page, 10, &new))
6095 return -EINVAL;
6096 new = !!new;
6097
6098 err = mddev_lock(mddev);
6099 if (err)
6100 return err;
6101 conf = mddev->private;
6102 if (!conf)
6103 err = -ENODEV;
6104 else if (new != conf->skip_copy) {
6105 mddev_suspend(mddev);
6106 conf->skip_copy = new;
6107 if (new)
6108 mddev->queue->backing_dev_info.capabilities |=
6109 BDI_CAP_STABLE_WRITES;
6110 else
6111 mddev->queue->backing_dev_info.capabilities &=
6112 ~BDI_CAP_STABLE_WRITES;
6113 mddev_resume(mddev);
6114 }
6115 mddev_unlock(mddev);
6116 return err ?: len;
6117 }
6118
6119 static struct md_sysfs_entry
6120 raid5_skip_copy = __ATTR(skip_copy, S_IRUGO | S_IWUSR,
6121 raid5_show_skip_copy,
6122 raid5_store_skip_copy);
6123
6124 static ssize_t
6125 stripe_cache_active_show(struct mddev *mddev, char *page)
6126 {
6127 struct r5conf *conf = mddev->private;
6128 if (conf)
6129 return sprintf(page, "%d\n", atomic_read(&conf->active_stripes));
6130 else
6131 return 0;
6132 }
6133
6134 static struct md_sysfs_entry
6135 raid5_stripecache_active = __ATTR_RO(stripe_cache_active);
6136
6137 static ssize_t
6138 raid5_show_group_thread_cnt(struct mddev *mddev, char *page)
6139 {
6140 struct r5conf *conf;
6141 int ret = 0;
6142 spin_lock(&mddev->lock);
6143 conf = mddev->private;
6144 if (conf)
6145 ret = sprintf(page, "%d\n", conf->worker_cnt_per_group);
6146 spin_unlock(&mddev->lock);
6147 return ret;
6148 }
6149
6150 static int alloc_thread_groups(struct r5conf *conf, int cnt,
6151 int *group_cnt,
6152 int *worker_cnt_per_group,
6153 struct r5worker_group **worker_groups);
6154 static ssize_t
6155 raid5_store_group_thread_cnt(struct mddev *mddev, const char *page, size_t len)
6156 {
6157 struct r5conf *conf;
6158 unsigned long new;
6159 int err;
6160 struct r5worker_group *new_groups, *old_groups;
6161 int group_cnt, worker_cnt_per_group;
6162
6163 if (len >= PAGE_SIZE)
6164 return -EINVAL;
6165 if (kstrtoul(page, 10, &new))
6166 return -EINVAL;
6167
6168 err = mddev_lock(mddev);
6169 if (err)
6170 return err;
6171 conf = mddev->private;
6172 if (!conf)
6173 err = -ENODEV;
6174 else if (new != conf->worker_cnt_per_group) {
6175 mddev_suspend(mddev);
6176
6177 old_groups = conf->worker_groups;
6178 if (old_groups)
6179 flush_workqueue(raid5_wq);
6180
6181 err = alloc_thread_groups(conf, new,
6182 &group_cnt, &worker_cnt_per_group,
6183 &new_groups);
6184 if (!err) {
6185 spin_lock_irq(&conf->device_lock);
6186 conf->group_cnt = group_cnt;
6187 conf->worker_cnt_per_group = worker_cnt_per_group;
6188 conf->worker_groups = new_groups;
6189 spin_unlock_irq(&conf->device_lock);
6190
6191 if (old_groups)
6192 kfree(old_groups[0].workers);
6193 kfree(old_groups);
6194 }
6195 mddev_resume(mddev);
6196 }
6197 mddev_unlock(mddev);
6198
6199 return err ?: len;
6200 }
6201
6202 static struct md_sysfs_entry
6203 raid5_group_thread_cnt = __ATTR(group_thread_cnt, S_IRUGO | S_IWUSR,
6204 raid5_show_group_thread_cnt,
6205 raid5_store_group_thread_cnt);
6206
6207 static struct attribute *raid5_attrs[] = {
6208 &raid5_stripecache_size.attr,
6209 &raid5_stripecache_active.attr,
6210 &raid5_preread_bypass_threshold.attr,
6211 &raid5_group_thread_cnt.attr,
6212 &raid5_skip_copy.attr,
6213 &raid5_rmw_level.attr,
6214 NULL,
6215 };
6216 static struct attribute_group raid5_attrs_group = {
6217 .name = NULL,
6218 .attrs = raid5_attrs,
6219 };
6220
6221 static int alloc_thread_groups(struct r5conf *conf, int cnt,
6222 int *group_cnt,
6223 int *worker_cnt_per_group,
6224 struct r5worker_group **worker_groups)
6225 {
6226 int i, j, k;
6227 ssize_t size;
6228 struct r5worker *workers;
6229
6230 *worker_cnt_per_group = cnt;
6231 if (cnt == 0) {
6232 *group_cnt = 0;
6233 *worker_groups = NULL;
6234 return 0;
6235 }
6236 *group_cnt = num_possible_nodes();
6237 size = sizeof(struct r5worker) * cnt;
6238 workers = kzalloc(size * *group_cnt, GFP_NOIO);
6239 *worker_groups = kzalloc(sizeof(struct r5worker_group) *
6240 *group_cnt, GFP_NOIO);
6241 if (!*worker_groups || !workers) {
6242 kfree(workers);
6243 kfree(*worker_groups);
6244 return -ENOMEM;
6245 }
6246
6247 for (i = 0; i < *group_cnt; i++) {
6248 struct r5worker_group *group;
6249
6250 group = &(*worker_groups)[i];
6251 INIT_LIST_HEAD(&group->handle_list);
6252 group->conf = conf;
6253 group->workers = workers + i * cnt;
6254
6255 for (j = 0; j < cnt; j++) {
6256 struct r5worker *worker = group->workers + j;
6257 worker->group = group;
6258 INIT_WORK(&worker->work, raid5_do_work);
6259
6260 for (k = 0; k < NR_STRIPE_HASH_LOCKS; k++)
6261 INIT_LIST_HEAD(worker->temp_inactive_list + k);
6262 }
6263 }
6264
6265 return 0;
6266 }
6267
6268 static void free_thread_groups(struct r5conf *conf)
6269 {
6270 if (conf->worker_groups)
6271 kfree(conf->worker_groups[0].workers);
6272 kfree(conf->worker_groups);
6273 conf->worker_groups = NULL;
6274 }
6275
6276 static sector_t
6277 raid5_size(struct mddev *mddev, sector_t sectors, int raid_disks)
6278 {
6279 struct r5conf *conf = mddev->private;
6280
6281 if (!sectors)
6282 sectors = mddev->dev_sectors;
6283 if (!raid_disks)
6284 /* size is defined by the smallest of previous and new size */
6285 raid_disks = min(conf->raid_disks, conf->previous_raid_disks);
6286
6287 sectors &= ~((sector_t)mddev->chunk_sectors - 1);
6288 sectors &= ~((sector_t)mddev->new_chunk_sectors - 1);
6289 return sectors * (raid_disks - conf->max_degraded);
6290 }
6291
6292 static void free_scratch_buffer(struct r5conf *conf, struct raid5_percpu *percpu)
6293 {
6294 safe_put_page(percpu->spare_page);
6295 if (percpu->scribble)
6296 flex_array_free(percpu->scribble);
6297 percpu->spare_page = NULL;
6298 percpu->scribble = NULL;
6299 }
6300
6301 static int alloc_scratch_buffer(struct r5conf *conf, struct raid5_percpu *percpu)
6302 {
6303 if (conf->level == 6 && !percpu->spare_page)
6304 percpu->spare_page = alloc_page(GFP_KERNEL);
6305 if (!percpu->scribble)
6306 percpu->scribble = scribble_alloc(max(conf->raid_disks,
6307 conf->previous_raid_disks),
6308 max(conf->chunk_sectors,
6309 conf->prev_chunk_sectors)
6310 / STRIPE_SECTORS,
6311 GFP_KERNEL);
6312
6313 if (!percpu->scribble || (conf->level == 6 && !percpu->spare_page)) {
6314 free_scratch_buffer(conf, percpu);
6315 return -ENOMEM;
6316 }
6317
6318 return 0;
6319 }
6320
6321 static void raid5_free_percpu(struct r5conf *conf)
6322 {
6323 unsigned long cpu;
6324
6325 if (!conf->percpu)
6326 return;
6327
6328 #ifdef CONFIG_HOTPLUG_CPU
6329 unregister_cpu_notifier(&conf->cpu_notify);
6330 #endif
6331
6332 get_online_cpus();
6333 for_each_possible_cpu(cpu)
6334 free_scratch_buffer(conf, per_cpu_ptr(conf->percpu, cpu));
6335 put_online_cpus();
6336
6337 free_percpu(conf->percpu);
6338 }
6339
6340 static void free_conf(struct r5conf *conf)
6341 {
6342 if (conf->shrinker.seeks)
6343 unregister_shrinker(&conf->shrinker);
6344 free_thread_groups(conf);
6345 shrink_stripes(conf);
6346 raid5_free_percpu(conf);
6347 kfree(conf->disks);
6348 kfree(conf->stripe_hashtbl);
6349 kfree(conf);
6350 }
6351
6352 #ifdef CONFIG_HOTPLUG_CPU
6353 static int raid456_cpu_notify(struct notifier_block *nfb, unsigned long action,
6354 void *hcpu)
6355 {
6356 struct r5conf *conf = container_of(nfb, struct r5conf, cpu_notify);
6357 long cpu = (long)hcpu;
6358 struct raid5_percpu *percpu = per_cpu_ptr(conf->percpu, cpu);
6359
6360 switch (action) {
6361 case CPU_UP_PREPARE:
6362 case CPU_UP_PREPARE_FROZEN:
6363 if (alloc_scratch_buffer(conf, percpu)) {
6364 pr_err("%s: failed memory allocation for cpu%ld\n",
6365 __func__, cpu);
6366 return notifier_from_errno(-ENOMEM);
6367 }
6368 break;
6369 case CPU_DEAD:
6370 case CPU_DEAD_FROZEN:
6371 free_scratch_buffer(conf, per_cpu_ptr(conf->percpu, cpu));
6372 break;
6373 default:
6374 break;
6375 }
6376 return NOTIFY_OK;
6377 }
6378 #endif
6379
6380 static int raid5_alloc_percpu(struct r5conf *conf)
6381 {
6382 unsigned long cpu;
6383 int err = 0;
6384
6385 conf->percpu = alloc_percpu(struct raid5_percpu);
6386 if (!conf->percpu)
6387 return -ENOMEM;
6388
6389 #ifdef CONFIG_HOTPLUG_CPU
6390 conf->cpu_notify.notifier_call = raid456_cpu_notify;
6391 conf->cpu_notify.priority = 0;
6392 err = register_cpu_notifier(&conf->cpu_notify);
6393 if (err)
6394 return err;
6395 #endif
6396
6397 get_online_cpus();
6398 for_each_present_cpu(cpu) {
6399 err = alloc_scratch_buffer(conf, per_cpu_ptr(conf->percpu, cpu));
6400 if (err) {
6401 pr_err("%s: failed memory allocation for cpu%ld\n",
6402 __func__, cpu);
6403 break;
6404 }
6405 }
6406 put_online_cpus();
6407
6408 return err;
6409 }
6410
6411 static unsigned long raid5_cache_scan(struct shrinker *shrink,
6412 struct shrink_control *sc)
6413 {
6414 struct r5conf *conf = container_of(shrink, struct r5conf, shrinker);
6415 int ret = 0;
6416 while (ret < sc->nr_to_scan) {
6417 if (drop_one_stripe(conf) == 0)
6418 return SHRINK_STOP;
6419 ret++;
6420 }
6421 return ret;
6422 }
6423
6424 static unsigned long raid5_cache_count(struct shrinker *shrink,
6425 struct shrink_control *sc)
6426 {
6427 struct r5conf *conf = container_of(shrink, struct r5conf, shrinker);
6428
6429 if (conf->max_nr_stripes < conf->min_nr_stripes)
6430 /* unlikely, but not impossible */
6431 return 0;
6432 return conf->max_nr_stripes - conf->min_nr_stripes;
6433 }
6434
6435 static struct r5conf *setup_conf(struct mddev *mddev)
6436 {
6437 struct r5conf *conf;
6438 int raid_disk, memory, max_disks;
6439 struct md_rdev *rdev;
6440 struct disk_info *disk;
6441 char pers_name[6];
6442 int i;
6443 int group_cnt, worker_cnt_per_group;
6444 struct r5worker_group *new_group;
6445
6446 if (mddev->new_level != 5
6447 && mddev->new_level != 4
6448 && mddev->new_level != 6) {
6449 printk(KERN_ERR "md/raid:%s: raid level not set to 4/5/6 (%d)\n",
6450 mdname(mddev), mddev->new_level);
6451 return ERR_PTR(-EIO);
6452 }
6453 if ((mddev->new_level == 5
6454 && !algorithm_valid_raid5(mddev->new_layout)) ||
6455 (mddev->new_level == 6
6456 && !algorithm_valid_raid6(mddev->new_layout))) {
6457 printk(KERN_ERR "md/raid:%s: layout %d not supported\n",
6458 mdname(mddev), mddev->new_layout);
6459 return ERR_PTR(-EIO);
6460 }
6461 if (mddev->new_level == 6 && mddev->raid_disks < 4) {
6462 printk(KERN_ERR "md/raid:%s: not enough configured devices (%d, minimum 4)\n",
6463 mdname(mddev), mddev->raid_disks);
6464 return ERR_PTR(-EINVAL);
6465 }
6466
6467 if (!mddev->new_chunk_sectors ||
6468 (mddev->new_chunk_sectors << 9) % PAGE_SIZE ||
6469 !is_power_of_2(mddev->new_chunk_sectors)) {
6470 printk(KERN_ERR "md/raid:%s: invalid chunk size %d\n",
6471 mdname(mddev), mddev->new_chunk_sectors << 9);
6472 return ERR_PTR(-EINVAL);
6473 }
6474
6475 conf = kzalloc(sizeof(struct r5conf), GFP_KERNEL);
6476 if (conf == NULL)
6477 goto abort;
6478 /* Don't enable multi-threading by default*/
6479 if (!alloc_thread_groups(conf, 0, &group_cnt, &worker_cnt_per_group,
6480 &new_group)) {
6481 conf->group_cnt = group_cnt;
6482 conf->worker_cnt_per_group = worker_cnt_per_group;
6483 conf->worker_groups = new_group;
6484 } else
6485 goto abort;
6486 spin_lock_init(&conf->device_lock);
6487 seqcount_init(&conf->gen_lock);
6488 init_waitqueue_head(&conf->wait_for_stripe);
6489 init_waitqueue_head(&conf->wait_for_overlap);
6490 INIT_LIST_HEAD(&conf->handle_list);
6491 INIT_LIST_HEAD(&conf->hold_list);
6492 INIT_LIST_HEAD(&conf->delayed_list);
6493 INIT_LIST_HEAD(&conf->bitmap_list);
6494 init_llist_head(&conf->released_stripes);
6495 atomic_set(&conf->active_stripes, 0);
6496 atomic_set(&conf->preread_active_stripes, 0);
6497 atomic_set(&conf->active_aligned_reads, 0);
6498 conf->bypass_threshold = BYPASS_THRESHOLD;
6499 conf->recovery_disabled = mddev->recovery_disabled - 1;
6500
6501 conf->raid_disks = mddev->raid_disks;
6502 if (mddev->reshape_position == MaxSector)
6503 conf->previous_raid_disks = mddev->raid_disks;
6504 else
6505 conf->previous_raid_disks = mddev->raid_disks - mddev->delta_disks;
6506 max_disks = max(conf->raid_disks, conf->previous_raid_disks);
6507
6508 conf->disks = kzalloc(max_disks * sizeof(struct disk_info),
6509 GFP_KERNEL);
6510 if (!conf->disks)
6511 goto abort;
6512
6513 conf->mddev = mddev;
6514
6515 if ((conf->stripe_hashtbl = kzalloc(PAGE_SIZE, GFP_KERNEL)) == NULL)
6516 goto abort;
6517
6518 /* We init hash_locks[0] separately to that it can be used
6519 * as the reference lock in the spin_lock_nest_lock() call
6520 * in lock_all_device_hash_locks_irq in order to convince
6521 * lockdep that we know what we are doing.
6522 */
6523 spin_lock_init(conf->hash_locks);
6524 for (i = 1; i < NR_STRIPE_HASH_LOCKS; i++)
6525 spin_lock_init(conf->hash_locks + i);
6526
6527 for (i = 0; i < NR_STRIPE_HASH_LOCKS; i++)
6528 INIT_LIST_HEAD(conf->inactive_list + i);
6529
6530 for (i = 0; i < NR_STRIPE_HASH_LOCKS; i++)
6531 INIT_LIST_HEAD(conf->temp_inactive_list + i);
6532
6533 conf->level = mddev->new_level;
6534 conf->chunk_sectors = mddev->new_chunk_sectors;
6535 if (raid5_alloc_percpu(conf) != 0)
6536 goto abort;
6537
6538 pr_debug("raid456: run(%s) called.\n", mdname(mddev));
6539
6540 rdev_for_each(rdev, mddev) {
6541 raid_disk = rdev->raid_disk;
6542 if (raid_disk >= max_disks
6543 || raid_disk < 0)
6544 continue;
6545 disk = conf->disks + raid_disk;
6546
6547 if (test_bit(Replacement, &rdev->flags)) {
6548 if (disk->replacement)
6549 goto abort;
6550 disk->replacement = rdev;
6551 } else {
6552 if (disk->rdev)
6553 goto abort;
6554 disk->rdev = rdev;
6555 }
6556
6557 if (test_bit(In_sync, &rdev->flags)) {
6558 char b[BDEVNAME_SIZE];
6559 printk(KERN_INFO "md/raid:%s: device %s operational as raid"
6560 " disk %d\n",
6561 mdname(mddev), bdevname(rdev->bdev, b), raid_disk);
6562 } else if (rdev->saved_raid_disk != raid_disk)
6563 /* Cannot rely on bitmap to complete recovery */
6564 conf->fullsync = 1;
6565 }
6566
6567 conf->level = mddev->new_level;
6568 if (conf->level == 6) {
6569 conf->max_degraded = 2;
6570 if (raid6_call.xor_syndrome)
6571 conf->rmw_level = PARITY_ENABLE_RMW;
6572 else
6573 conf->rmw_level = PARITY_DISABLE_RMW;
6574 } else {
6575 conf->max_degraded = 1;
6576 conf->rmw_level = PARITY_ENABLE_RMW;
6577 }
6578 conf->algorithm = mddev->new_layout;
6579 conf->reshape_progress = mddev->reshape_position;
6580 if (conf->reshape_progress != MaxSector) {
6581 conf->prev_chunk_sectors = mddev->chunk_sectors;
6582 conf->prev_algo = mddev->layout;
6583 }
6584
6585 conf->min_nr_stripes = NR_STRIPES;
6586 memory = conf->min_nr_stripes * (sizeof(struct stripe_head) +
6587 max_disks * ((sizeof(struct bio) + PAGE_SIZE))) / 1024;
6588 atomic_set(&conf->empty_inactive_list_nr, NR_STRIPE_HASH_LOCKS);
6589 if (grow_stripes(conf, conf->min_nr_stripes)) {
6590 printk(KERN_ERR
6591 "md/raid:%s: couldn't allocate %dkB for buffers\n",
6592 mdname(mddev), memory);
6593 goto abort;
6594 } else
6595 printk(KERN_INFO "md/raid:%s: allocated %dkB\n",
6596 mdname(mddev), memory);
6597 /*
6598 * Losing a stripe head costs more than the time to refill it,
6599 * it reduces the queue depth and so can hurt throughput.
6600 * So set it rather large, scaled by number of devices.
6601 */
6602 conf->shrinker.seeks = DEFAULT_SEEKS * conf->raid_disks * 4;
6603 conf->shrinker.scan_objects = raid5_cache_scan;
6604 conf->shrinker.count_objects = raid5_cache_count;
6605 conf->shrinker.batch = 128;
6606 conf->shrinker.flags = 0;
6607 register_shrinker(&conf->shrinker);
6608
6609 sprintf(pers_name, "raid%d", mddev->new_level);
6610 conf->thread = md_register_thread(raid5d, mddev, pers_name);
6611 if (!conf->thread) {
6612 printk(KERN_ERR
6613 "md/raid:%s: couldn't allocate thread.\n",
6614 mdname(mddev));
6615 goto abort;
6616 }
6617
6618 return conf;
6619
6620 abort:
6621 if (conf) {
6622 free_conf(conf);
6623 return ERR_PTR(-EIO);
6624 } else
6625 return ERR_PTR(-ENOMEM);
6626 }
6627
6628 static int only_parity(int raid_disk, int algo, int raid_disks, int max_degraded)
6629 {
6630 switch (algo) {
6631 case ALGORITHM_PARITY_0:
6632 if (raid_disk < max_degraded)
6633 return 1;
6634 break;
6635 case ALGORITHM_PARITY_N:
6636 if (raid_disk >= raid_disks - max_degraded)
6637 return 1;
6638 break;
6639 case ALGORITHM_PARITY_0_6:
6640 if (raid_disk == 0 ||
6641 raid_disk == raid_disks - 1)
6642 return 1;
6643 break;
6644 case ALGORITHM_LEFT_ASYMMETRIC_6:
6645 case ALGORITHM_RIGHT_ASYMMETRIC_6:
6646 case ALGORITHM_LEFT_SYMMETRIC_6:
6647 case ALGORITHM_RIGHT_SYMMETRIC_6:
6648 if (raid_disk == raid_disks - 1)
6649 return 1;
6650 }
6651 return 0;
6652 }
6653
6654 static int run(struct mddev *mddev)
6655 {
6656 struct r5conf *conf;
6657 int working_disks = 0;
6658 int dirty_parity_disks = 0;
6659 struct md_rdev *rdev;
6660 sector_t reshape_offset = 0;
6661 int i;
6662 long long min_offset_diff = 0;
6663 int first = 1;
6664
6665 if (mddev->recovery_cp != MaxSector)
6666 printk(KERN_NOTICE "md/raid:%s: not clean"
6667 " -- starting background reconstruction\n",
6668 mdname(mddev));
6669
6670 rdev_for_each(rdev, mddev) {
6671 long long diff;
6672 if (rdev->raid_disk < 0)
6673 continue;
6674 diff = (rdev->new_data_offset - rdev->data_offset);
6675 if (first) {
6676 min_offset_diff = diff;
6677 first = 0;
6678 } else if (mddev->reshape_backwards &&
6679 diff < min_offset_diff)
6680 min_offset_diff = diff;
6681 else if (!mddev->reshape_backwards &&
6682 diff > min_offset_diff)
6683 min_offset_diff = diff;
6684 }
6685
6686 if (mddev->reshape_position != MaxSector) {
6687 /* Check that we can continue the reshape.
6688 * Difficulties arise if the stripe we would write to
6689 * next is at or after the stripe we would read from next.
6690 * For a reshape that changes the number of devices, this
6691 * is only possible for a very short time, and mdadm makes
6692 * sure that time appears to have past before assembling
6693 * the array. So we fail if that time hasn't passed.
6694 * For a reshape that keeps the number of devices the same
6695 * mdadm must be monitoring the reshape can keeping the
6696 * critical areas read-only and backed up. It will start
6697 * the array in read-only mode, so we check for that.
6698 */
6699 sector_t here_new, here_old;
6700 int old_disks;
6701 int max_degraded = (mddev->level == 6 ? 2 : 1);
6702
6703 if (mddev->new_level != mddev->level) {
6704 printk(KERN_ERR "md/raid:%s: unsupported reshape "
6705 "required - aborting.\n",
6706 mdname(mddev));
6707 return -EINVAL;
6708 }
6709 old_disks = mddev->raid_disks - mddev->delta_disks;
6710 /* reshape_position must be on a new-stripe boundary, and one
6711 * further up in new geometry must map after here in old
6712 * geometry.
6713 */
6714 here_new = mddev->reshape_position;
6715 if (sector_div(here_new, mddev->new_chunk_sectors *
6716 (mddev->raid_disks - max_degraded))) {
6717 printk(KERN_ERR "md/raid:%s: reshape_position not "
6718 "on a stripe boundary\n", mdname(mddev));
6719 return -EINVAL;
6720 }
6721 reshape_offset = here_new * mddev->new_chunk_sectors;
6722 /* here_new is the stripe we will write to */
6723 here_old = mddev->reshape_position;
6724 sector_div(here_old, mddev->chunk_sectors *
6725 (old_disks-max_degraded));
6726 /* here_old is the first stripe that we might need to read
6727 * from */
6728 if (mddev->delta_disks == 0) {
6729 if ((here_new * mddev->new_chunk_sectors !=
6730 here_old * mddev->chunk_sectors)) {
6731 printk(KERN_ERR "md/raid:%s: reshape position is"
6732 " confused - aborting\n", mdname(mddev));
6733 return -EINVAL;
6734 }
6735 /* We cannot be sure it is safe to start an in-place
6736 * reshape. It is only safe if user-space is monitoring
6737 * and taking constant backups.
6738 * mdadm always starts a situation like this in
6739 * readonly mode so it can take control before
6740 * allowing any writes. So just check for that.
6741 */
6742 if (abs(min_offset_diff) >= mddev->chunk_sectors &&
6743 abs(min_offset_diff) >= mddev->new_chunk_sectors)
6744 /* not really in-place - so OK */;
6745 else if (mddev->ro == 0) {
6746 printk(KERN_ERR "md/raid:%s: in-place reshape "
6747 "must be started in read-only mode "
6748 "- aborting\n",
6749 mdname(mddev));
6750 return -EINVAL;
6751 }
6752 } else if (mddev->reshape_backwards
6753 ? (here_new * mddev->new_chunk_sectors + min_offset_diff <=
6754 here_old * mddev->chunk_sectors)
6755 : (here_new * mddev->new_chunk_sectors >=
6756 here_old * mddev->chunk_sectors + (-min_offset_diff))) {
6757 /* Reading from the same stripe as writing to - bad */
6758 printk(KERN_ERR "md/raid:%s: reshape_position too early for "
6759 "auto-recovery - aborting.\n",
6760 mdname(mddev));
6761 return -EINVAL;
6762 }
6763 printk(KERN_INFO "md/raid:%s: reshape will continue\n",
6764 mdname(mddev));
6765 /* OK, we should be able to continue; */
6766 } else {
6767 BUG_ON(mddev->level != mddev->new_level);
6768 BUG_ON(mddev->layout != mddev->new_layout);
6769 BUG_ON(mddev->chunk_sectors != mddev->new_chunk_sectors);
6770 BUG_ON(mddev->delta_disks != 0);
6771 }
6772
6773 if (mddev->private == NULL)
6774 conf = setup_conf(mddev);
6775 else
6776 conf = mddev->private;
6777
6778 if (IS_ERR(conf))
6779 return PTR_ERR(conf);
6780
6781 conf->min_offset_diff = min_offset_diff;
6782 mddev->thread = conf->thread;
6783 conf->thread = NULL;
6784 mddev->private = conf;
6785
6786 for (i = 0; i < conf->raid_disks && conf->previous_raid_disks;
6787 i++) {
6788 rdev = conf->disks[i].rdev;
6789 if (!rdev && conf->disks[i].replacement) {
6790 /* The replacement is all we have yet */
6791 rdev = conf->disks[i].replacement;
6792 conf->disks[i].replacement = NULL;
6793 clear_bit(Replacement, &rdev->flags);
6794 conf->disks[i].rdev = rdev;
6795 }
6796 if (!rdev)
6797 continue;
6798 if (conf->disks[i].replacement &&
6799 conf->reshape_progress != MaxSector) {
6800 /* replacements and reshape simply do not mix. */
6801 printk(KERN_ERR "md: cannot handle concurrent "
6802 "replacement and reshape.\n");
6803 goto abort;
6804 }
6805 if (test_bit(In_sync, &rdev->flags)) {
6806 working_disks++;
6807 continue;
6808 }
6809 /* This disc is not fully in-sync. However if it
6810 * just stored parity (beyond the recovery_offset),
6811 * when we don't need to be concerned about the
6812 * array being dirty.
6813 * When reshape goes 'backwards', we never have
6814 * partially completed devices, so we only need
6815 * to worry about reshape going forwards.
6816 */
6817 /* Hack because v0.91 doesn't store recovery_offset properly. */
6818 if (mddev->major_version == 0 &&
6819 mddev->minor_version > 90)
6820 rdev->recovery_offset = reshape_offset;
6821
6822 if (rdev->recovery_offset < reshape_offset) {
6823 /* We need to check old and new layout */
6824 if (!only_parity(rdev->raid_disk,
6825 conf->algorithm,
6826 conf->raid_disks,
6827 conf->max_degraded))
6828 continue;
6829 }
6830 if (!only_parity(rdev->raid_disk,
6831 conf->prev_algo,
6832 conf->previous_raid_disks,
6833 conf->max_degraded))
6834 continue;
6835 dirty_parity_disks++;
6836 }
6837
6838 /*
6839 * 0 for a fully functional array, 1 or 2 for a degraded array.
6840 */
6841 mddev->degraded = calc_degraded(conf);
6842
6843 if (has_failed(conf)) {
6844 printk(KERN_ERR "md/raid:%s: not enough operational devices"
6845 " (%d/%d failed)\n",
6846 mdname(mddev), mddev->degraded, conf->raid_disks);
6847 goto abort;
6848 }
6849
6850 /* device size must be a multiple of chunk size */
6851 mddev->dev_sectors &= ~(mddev->chunk_sectors - 1);
6852 mddev->resync_max_sectors = mddev->dev_sectors;
6853
6854 if (mddev->degraded > dirty_parity_disks &&
6855 mddev->recovery_cp != MaxSector) {
6856 if (mddev->ok_start_degraded)
6857 printk(KERN_WARNING
6858 "md/raid:%s: starting dirty degraded array"
6859 " - data corruption possible.\n",
6860 mdname(mddev));
6861 else {
6862 printk(KERN_ERR
6863 "md/raid:%s: cannot start dirty degraded array.\n",
6864 mdname(mddev));
6865 goto abort;
6866 }
6867 }
6868
6869 if (mddev->degraded == 0)
6870 printk(KERN_INFO "md/raid:%s: raid level %d active with %d out of %d"
6871 " devices, algorithm %d\n", mdname(mddev), conf->level,
6872 mddev->raid_disks-mddev->degraded, mddev->raid_disks,
6873 mddev->new_layout);
6874 else
6875 printk(KERN_ALERT "md/raid:%s: raid level %d active with %d"
6876 " out of %d devices, algorithm %d\n",
6877 mdname(mddev), conf->level,
6878 mddev->raid_disks - mddev->degraded,
6879 mddev->raid_disks, mddev->new_layout);
6880
6881 print_raid5_conf(conf);
6882
6883 if (conf->reshape_progress != MaxSector) {
6884 conf->reshape_safe = conf->reshape_progress;
6885 atomic_set(&conf->reshape_stripes, 0);
6886 clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
6887 clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
6888 set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
6889 set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
6890 mddev->sync_thread = md_register_thread(md_do_sync, mddev,
6891 "reshape");
6892 }
6893
6894 /* Ok, everything is just fine now */
6895 if (mddev->to_remove == &raid5_attrs_group)
6896 mddev->to_remove = NULL;
6897 else if (mddev->kobj.sd &&
6898 sysfs_create_group(&mddev->kobj, &raid5_attrs_group))
6899 printk(KERN_WARNING
6900 "raid5: failed to create sysfs attributes for %s\n",
6901 mdname(mddev));
6902 md_set_array_sectors(mddev, raid5_size(mddev, 0, 0));
6903
6904 if (mddev->queue) {
6905 int chunk_size;
6906 bool discard_supported = true;
6907 /* read-ahead size must cover two whole stripes, which
6908 * is 2 * (datadisks) * chunksize where 'n' is the
6909 * number of raid devices
6910 */
6911 int data_disks = conf->previous_raid_disks - conf->max_degraded;
6912 int stripe = data_disks *
6913 ((mddev->chunk_sectors << 9) / PAGE_SIZE);
6914 if (mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
6915 mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
6916
6917 chunk_size = mddev->chunk_sectors << 9;
6918 blk_queue_io_min(mddev->queue, chunk_size);
6919 blk_queue_io_opt(mddev->queue, chunk_size *
6920 (conf->raid_disks - conf->max_degraded));
6921 mddev->queue->limits.raid_partial_stripes_expensive = 1;
6922 /*
6923 * We can only discard a whole stripe. It doesn't make sense to
6924 * discard data disk but write parity disk
6925 */
6926 stripe = stripe * PAGE_SIZE;
6927 /* Round up to power of 2, as discard handling
6928 * currently assumes that */
6929 while ((stripe-1) & stripe)
6930 stripe = (stripe | (stripe-1)) + 1;
6931 mddev->queue->limits.discard_alignment = stripe;
6932 mddev->queue->limits.discard_granularity = stripe;
6933 /*
6934 * unaligned part of discard request will be ignored, so can't
6935 * guarantee discard_zeroes_data
6936 */
6937 mddev->queue->limits.discard_zeroes_data = 0;
6938
6939 blk_queue_max_write_same_sectors(mddev->queue, 0);
6940
6941 rdev_for_each(rdev, mddev) {
6942 disk_stack_limits(mddev->gendisk, rdev->bdev,
6943 rdev->data_offset << 9);
6944 disk_stack_limits(mddev->gendisk, rdev->bdev,
6945 rdev->new_data_offset << 9);
6946 /*
6947 * discard_zeroes_data is required, otherwise data
6948 * could be lost. Consider a scenario: discard a stripe
6949 * (the stripe could be inconsistent if
6950 * discard_zeroes_data is 0); write one disk of the
6951 * stripe (the stripe could be inconsistent again
6952 * depending on which disks are used to calculate
6953 * parity); the disk is broken; The stripe data of this
6954 * disk is lost.
6955 */
6956 if (!blk_queue_discard(bdev_get_queue(rdev->bdev)) ||
6957 !bdev_get_queue(rdev->bdev)->
6958 limits.discard_zeroes_data)
6959 discard_supported = false;
6960 /* Unfortunately, discard_zeroes_data is not currently
6961 * a guarantee - just a hint. So we only allow DISCARD
6962 * if the sysadmin has confirmed that only safe devices
6963 * are in use by setting a module parameter.
6964 */
6965 if (!devices_handle_discard_safely) {
6966 if (discard_supported) {
6967 pr_info("md/raid456: discard support disabled due to uncertainty.\n");
6968 pr_info("Set raid456.devices_handle_discard_safely=Y to override.\n");
6969 }
6970 discard_supported = false;
6971 }
6972 }
6973
6974 if (discard_supported &&
6975 mddev->queue->limits.max_discard_sectors >= stripe &&
6976 mddev->queue->limits.discard_granularity >= stripe)
6977 queue_flag_set_unlocked(QUEUE_FLAG_DISCARD,
6978 mddev->queue);
6979 else
6980 queue_flag_clear_unlocked(QUEUE_FLAG_DISCARD,
6981 mddev->queue);
6982 }
6983
6984 return 0;
6985 abort:
6986 md_unregister_thread(&mddev->thread);
6987 print_raid5_conf(conf);
6988 free_conf(conf);
6989 mddev->private = NULL;
6990 printk(KERN_ALERT "md/raid:%s: failed to run raid set.\n", mdname(mddev));
6991 return -EIO;
6992 }
6993
6994 static void raid5_free(struct mddev *mddev, void *priv)
6995 {
6996 struct r5conf *conf = priv;
6997
6998 free_conf(conf);
6999 mddev->to_remove = &raid5_attrs_group;
7000 }
7001
7002 static void status(struct seq_file *seq, struct mddev *mddev)
7003 {
7004 struct r5conf *conf = mddev->private;
7005 int i;
7006
7007 seq_printf(seq, " level %d, %dk chunk, algorithm %d", mddev->level,
7008 mddev->chunk_sectors / 2, mddev->layout);
7009 seq_printf (seq, " [%d/%d] [", conf->raid_disks, conf->raid_disks - mddev->degraded);
7010 for (i = 0; i < conf->raid_disks; i++)
7011 seq_printf (seq, "%s",
7012 conf->disks[i].rdev &&
7013 test_bit(In_sync, &conf->disks[i].rdev->flags) ? "U" : "_");
7014 seq_printf (seq, "]");
7015 }
7016
7017 static void print_raid5_conf (struct r5conf *conf)
7018 {
7019 int i;
7020 struct disk_info *tmp;
7021
7022 printk(KERN_DEBUG "RAID conf printout:\n");
7023 if (!conf) {
7024 printk("(conf==NULL)\n");
7025 return;
7026 }
7027 printk(KERN_DEBUG " --- level:%d rd:%d wd:%d\n", conf->level,
7028 conf->raid_disks,
7029 conf->raid_disks - conf->mddev->degraded);
7030
7031 for (i = 0; i < conf->raid_disks; i++) {
7032 char b[BDEVNAME_SIZE];
7033 tmp = conf->disks + i;
7034 if (tmp->rdev)
7035 printk(KERN_DEBUG " disk %d, o:%d, dev:%s\n",
7036 i, !test_bit(Faulty, &tmp->rdev->flags),
7037 bdevname(tmp->rdev->bdev, b));
7038 }
7039 }
7040
7041 static int raid5_spare_active(struct mddev *mddev)
7042 {
7043 int i;
7044 struct r5conf *conf = mddev->private;
7045 struct disk_info *tmp;
7046 int count = 0;
7047 unsigned long flags;
7048
7049 for (i = 0; i < conf->raid_disks; i++) {
7050 tmp = conf->disks + i;
7051 if (tmp->replacement
7052 && tmp->replacement->recovery_offset == MaxSector
7053 && !test_bit(Faulty, &tmp->replacement->flags)
7054 && !test_and_set_bit(In_sync, &tmp->replacement->flags)) {
7055 /* Replacement has just become active. */
7056 if (!tmp->rdev
7057 || !test_and_clear_bit(In_sync, &tmp->rdev->flags))
7058 count++;
7059 if (tmp->rdev) {
7060 /* Replaced device not technically faulty,
7061 * but we need to be sure it gets removed
7062 * and never re-added.
7063 */
7064 set_bit(Faulty, &tmp->rdev->flags);
7065 sysfs_notify_dirent_safe(
7066 tmp->rdev->sysfs_state);
7067 }
7068 sysfs_notify_dirent_safe(tmp->replacement->sysfs_state);
7069 } else if (tmp->rdev
7070 && tmp->rdev->recovery_offset == MaxSector
7071 && !test_bit(Faulty, &tmp->rdev->flags)
7072 && !test_and_set_bit(In_sync, &tmp->rdev->flags)) {
7073 count++;
7074 sysfs_notify_dirent_safe(tmp->rdev->sysfs_state);
7075 }
7076 }
7077 spin_lock_irqsave(&conf->device_lock, flags);
7078 mddev->degraded = calc_degraded(conf);
7079 spin_unlock_irqrestore(&conf->device_lock, flags);
7080 print_raid5_conf(conf);
7081 return count;
7082 }
7083
7084 static int raid5_remove_disk(struct mddev *mddev, struct md_rdev *rdev)
7085 {
7086 struct r5conf *conf = mddev->private;
7087 int err = 0;
7088 int number = rdev->raid_disk;
7089 struct md_rdev **rdevp;
7090 struct disk_info *p = conf->disks + number;
7091
7092 print_raid5_conf(conf);
7093 if (rdev == p->rdev)
7094 rdevp = &p->rdev;
7095 else if (rdev == p->replacement)
7096 rdevp = &p->replacement;
7097 else
7098 return 0;
7099
7100 if (number >= conf->raid_disks &&
7101 conf->reshape_progress == MaxSector)
7102 clear_bit(In_sync, &rdev->flags);
7103
7104 if (test_bit(In_sync, &rdev->flags) ||
7105 atomic_read(&rdev->nr_pending)) {
7106 err = -EBUSY;
7107 goto abort;
7108 }
7109 /* Only remove non-faulty devices if recovery
7110 * isn't possible.
7111 */
7112 if (!test_bit(Faulty, &rdev->flags) &&
7113 mddev->recovery_disabled != conf->recovery_disabled &&
7114 !has_failed(conf) &&
7115 (!p->replacement || p->replacement == rdev) &&
7116 number < conf->raid_disks) {
7117 err = -EBUSY;
7118 goto abort;
7119 }
7120 *rdevp = NULL;
7121 synchronize_rcu();
7122 if (atomic_read(&rdev->nr_pending)) {
7123 /* lost the race, try later */
7124 err = -EBUSY;
7125 *rdevp = rdev;
7126 } else if (p->replacement) {
7127 /* We must have just cleared 'rdev' */
7128 p->rdev = p->replacement;
7129 clear_bit(Replacement, &p->replacement->flags);
7130 smp_mb(); /* Make sure other CPUs may see both as identical
7131 * but will never see neither - if they are careful
7132 */
7133 p->replacement = NULL;
7134 clear_bit(WantReplacement, &rdev->flags);
7135 } else
7136 /* We might have just removed the Replacement as faulty-
7137 * clear the bit just in case
7138 */
7139 clear_bit(WantReplacement, &rdev->flags);
7140 abort:
7141
7142 print_raid5_conf(conf);
7143 return err;
7144 }
7145
7146 static int raid5_add_disk(struct mddev *mddev, struct md_rdev *rdev)
7147 {
7148 struct r5conf *conf = mddev->private;
7149 int err = -EEXIST;
7150 int disk;
7151 struct disk_info *p;
7152 int first = 0;
7153 int last = conf->raid_disks - 1;
7154
7155 if (mddev->recovery_disabled == conf->recovery_disabled)
7156 return -EBUSY;
7157
7158 if (rdev->saved_raid_disk < 0 && has_failed(conf))
7159 /* no point adding a device */
7160 return -EINVAL;
7161
7162 if (rdev->raid_disk >= 0)
7163 first = last = rdev->raid_disk;
7164
7165 /*
7166 * find the disk ... but prefer rdev->saved_raid_disk
7167 * if possible.
7168 */
7169 if (rdev->saved_raid_disk >= 0 &&
7170 rdev->saved_raid_disk >= first &&
7171 conf->disks[rdev->saved_raid_disk].rdev == NULL)
7172 first = rdev->saved_raid_disk;
7173
7174 for (disk = first; disk <= last; disk++) {
7175 p = conf->disks + disk;
7176 if (p->rdev == NULL) {
7177 clear_bit(In_sync, &rdev->flags);
7178 rdev->raid_disk = disk;
7179 err = 0;
7180 if (rdev->saved_raid_disk != disk)
7181 conf->fullsync = 1;
7182 rcu_assign_pointer(p->rdev, rdev);
7183 goto out;
7184 }
7185 }
7186 for (disk = first; disk <= last; disk++) {
7187 p = conf->disks + disk;
7188 if (test_bit(WantReplacement, &p->rdev->flags) &&
7189 p->replacement == NULL) {
7190 clear_bit(In_sync, &rdev->flags);
7191 set_bit(Replacement, &rdev->flags);
7192 rdev->raid_disk = disk;
7193 err = 0;
7194 conf->fullsync = 1;
7195 rcu_assign_pointer(p->replacement, rdev);
7196 break;
7197 }
7198 }
7199 out:
7200 print_raid5_conf(conf);
7201 return err;
7202 }
7203
7204 static int raid5_resize(struct mddev *mddev, sector_t sectors)
7205 {
7206 /* no resync is happening, and there is enough space
7207 * on all devices, so we can resize.
7208 * We need to make sure resync covers any new space.
7209 * If the array is shrinking we should possibly wait until
7210 * any io in the removed space completes, but it hardly seems
7211 * worth it.
7212 */
7213 sector_t newsize;
7214 sectors &= ~((sector_t)mddev->chunk_sectors - 1);
7215 newsize = raid5_size(mddev, sectors, mddev->raid_disks);
7216 if (mddev->external_size &&
7217 mddev->array_sectors > newsize)
7218 return -EINVAL;
7219 if (mddev->bitmap) {
7220 int ret = bitmap_resize(mddev->bitmap, sectors, 0, 0);
7221 if (ret)
7222 return ret;
7223 }
7224 md_set_array_sectors(mddev, newsize);
7225 set_capacity(mddev->gendisk, mddev->array_sectors);
7226 revalidate_disk(mddev->gendisk);
7227 if (sectors > mddev->dev_sectors &&
7228 mddev->recovery_cp > mddev->dev_sectors) {
7229 mddev->recovery_cp = mddev->dev_sectors;
7230 set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
7231 }
7232 mddev->dev_sectors = sectors;
7233 mddev->resync_max_sectors = sectors;
7234 return 0;
7235 }
7236
7237 static int check_stripe_cache(struct mddev *mddev)
7238 {
7239 /* Can only proceed if there are plenty of stripe_heads.
7240 * We need a minimum of one full stripe,, and for sensible progress
7241 * it is best to have about 4 times that.
7242 * If we require 4 times, then the default 256 4K stripe_heads will
7243 * allow for chunk sizes up to 256K, which is probably OK.
7244 * If the chunk size is greater, user-space should request more
7245 * stripe_heads first.
7246 */
7247 struct r5conf *conf = mddev->private;
7248 if (((mddev->chunk_sectors << 9) / STRIPE_SIZE) * 4
7249 > conf->min_nr_stripes ||
7250 ((mddev->new_chunk_sectors << 9) / STRIPE_SIZE) * 4
7251 > conf->min_nr_stripes) {
7252 printk(KERN_WARNING "md/raid:%s: reshape: not enough stripes. Needed %lu\n",
7253 mdname(mddev),
7254 ((max(mddev->chunk_sectors, mddev->new_chunk_sectors) << 9)
7255 / STRIPE_SIZE)*4);
7256 return 0;
7257 }
7258 return 1;
7259 }
7260
7261 static int check_reshape(struct mddev *mddev)
7262 {
7263 struct r5conf *conf = mddev->private;
7264
7265 if (mddev->delta_disks == 0 &&
7266 mddev->new_layout == mddev->layout &&
7267 mddev->new_chunk_sectors == mddev->chunk_sectors)
7268 return 0; /* nothing to do */
7269 if (has_failed(conf))
7270 return -EINVAL;
7271 if (mddev->delta_disks < 0 && mddev->reshape_position == MaxSector) {
7272 /* We might be able to shrink, but the devices must
7273 * be made bigger first.
7274 * For raid6, 4 is the minimum size.
7275 * Otherwise 2 is the minimum
7276 */
7277 int min = 2;
7278 if (mddev->level == 6)
7279 min = 4;
7280 if (mddev->raid_disks + mddev->delta_disks < min)
7281 return -EINVAL;
7282 }
7283
7284 if (!check_stripe_cache(mddev))
7285 return -ENOSPC;
7286
7287 if (mddev->new_chunk_sectors > mddev->chunk_sectors ||
7288 mddev->delta_disks > 0)
7289 if (resize_chunks(conf,
7290 conf->previous_raid_disks
7291 + max(0, mddev->delta_disks),
7292 max(mddev->new_chunk_sectors,
7293 mddev->chunk_sectors)
7294 ) < 0)
7295 return -ENOMEM;
7296 return resize_stripes(conf, (conf->previous_raid_disks
7297 + mddev->delta_disks));
7298 }
7299
7300 static int raid5_start_reshape(struct mddev *mddev)
7301 {
7302 struct r5conf *conf = mddev->private;
7303 struct md_rdev *rdev;
7304 int spares = 0;
7305 unsigned long flags;
7306
7307 if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
7308 return -EBUSY;
7309
7310 if (!check_stripe_cache(mddev))
7311 return -ENOSPC;
7312
7313 if (has_failed(conf))
7314 return -EINVAL;
7315
7316 rdev_for_each(rdev, mddev) {
7317 if (!test_bit(In_sync, &rdev->flags)
7318 && !test_bit(Faulty, &rdev->flags))
7319 spares++;
7320 }
7321
7322 if (spares - mddev->degraded < mddev->delta_disks - conf->max_degraded)
7323 /* Not enough devices even to make a degraded array
7324 * of that size
7325 */
7326 return -EINVAL;
7327
7328 /* Refuse to reduce size of the array. Any reductions in
7329 * array size must be through explicit setting of array_size
7330 * attribute.
7331 */
7332 if (raid5_size(mddev, 0, conf->raid_disks + mddev->delta_disks)
7333 < mddev->array_sectors) {
7334 printk(KERN_ERR "md/raid:%s: array size must be reduced "
7335 "before number of disks\n", mdname(mddev));
7336 return -EINVAL;
7337 }
7338
7339 atomic_set(&conf->reshape_stripes, 0);
7340 spin_lock_irq(&conf->device_lock);
7341 write_seqcount_begin(&conf->gen_lock);
7342 conf->previous_raid_disks = conf->raid_disks;
7343 conf->raid_disks += mddev->delta_disks;
7344 conf->prev_chunk_sectors = conf->chunk_sectors;
7345 conf->chunk_sectors = mddev->new_chunk_sectors;
7346 conf->prev_algo = conf->algorithm;
7347 conf->algorithm = mddev->new_layout;
7348 conf->generation++;
7349 /* Code that selects data_offset needs to see the generation update
7350 * if reshape_progress has been set - so a memory barrier needed.
7351 */
7352 smp_mb();
7353 if (mddev->reshape_backwards)
7354 conf->reshape_progress = raid5_size(mddev, 0, 0);
7355 else
7356 conf->reshape_progress = 0;
7357 conf->reshape_safe = conf->reshape_progress;
7358 write_seqcount_end(&conf->gen_lock);
7359 spin_unlock_irq(&conf->device_lock);
7360
7361 /* Now make sure any requests that proceeded on the assumption
7362 * the reshape wasn't running - like Discard or Read - have
7363 * completed.
7364 */
7365 mddev_suspend(mddev);
7366 mddev_resume(mddev);
7367
7368 /* Add some new drives, as many as will fit.
7369 * We know there are enough to make the newly sized array work.
7370 * Don't add devices if we are reducing the number of
7371 * devices in the array. This is because it is not possible
7372 * to correctly record the "partially reconstructed" state of
7373 * such devices during the reshape and confusion could result.
7374 */
7375 if (mddev->delta_disks >= 0) {
7376 rdev_for_each(rdev, mddev)
7377 if (rdev->raid_disk < 0 &&
7378 !test_bit(Faulty, &rdev->flags)) {
7379 if (raid5_add_disk(mddev, rdev) == 0) {
7380 if (rdev->raid_disk
7381 >= conf->previous_raid_disks)
7382 set_bit(In_sync, &rdev->flags);
7383 else
7384 rdev->recovery_offset = 0;
7385
7386 if (sysfs_link_rdev(mddev, rdev))
7387 /* Failure here is OK */;
7388 }
7389 } else if (rdev->raid_disk >= conf->previous_raid_disks
7390 && !test_bit(Faulty, &rdev->flags)) {
7391 /* This is a spare that was manually added */
7392 set_bit(In_sync, &rdev->flags);
7393 }
7394
7395 /* When a reshape changes the number of devices,
7396 * ->degraded is measured against the larger of the
7397 * pre and post number of devices.
7398 */
7399 spin_lock_irqsave(&conf->device_lock, flags);
7400 mddev->degraded = calc_degraded(conf);
7401 spin_unlock_irqrestore(&conf->device_lock, flags);
7402 }
7403 mddev->raid_disks = conf->raid_disks;
7404 mddev->reshape_position = conf->reshape_progress;
7405 set_bit(MD_CHANGE_DEVS, &mddev->flags);
7406
7407 clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
7408 clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
7409 set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
7410 set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
7411 mddev->sync_thread = md_register_thread(md_do_sync, mddev,
7412 "reshape");
7413 if (!mddev->sync_thread) {
7414 mddev->recovery = 0;
7415 spin_lock_irq(&conf->device_lock);
7416 write_seqcount_begin(&conf->gen_lock);
7417 mddev->raid_disks = conf->raid_disks = conf->previous_raid_disks;
7418 mddev->new_chunk_sectors =
7419 conf->chunk_sectors = conf->prev_chunk_sectors;
7420 mddev->new_layout = conf->algorithm = conf->prev_algo;
7421 rdev_for_each(rdev, mddev)
7422 rdev->new_data_offset = rdev->data_offset;
7423 smp_wmb();
7424 conf->generation --;
7425 conf->reshape_progress = MaxSector;
7426 mddev->reshape_position = MaxSector;
7427 write_seqcount_end(&conf->gen_lock);
7428 spin_unlock_irq(&conf->device_lock);
7429 return -EAGAIN;
7430 }
7431 conf->reshape_checkpoint = jiffies;
7432 md_wakeup_thread(mddev->sync_thread);
7433 md_new_event(mddev);
7434 return 0;
7435 }
7436
7437 /* This is called from the reshape thread and should make any
7438 * changes needed in 'conf'
7439 */
7440 static void end_reshape(struct r5conf *conf)
7441 {
7442
7443 if (!test_bit(MD_RECOVERY_INTR, &conf->mddev->recovery)) {
7444 struct md_rdev *rdev;
7445
7446 spin_lock_irq(&conf->device_lock);
7447 conf->previous_raid_disks = conf->raid_disks;
7448 rdev_for_each(rdev, conf->mddev)
7449 rdev->data_offset = rdev->new_data_offset;
7450 smp_wmb();
7451 conf->reshape_progress = MaxSector;
7452 spin_unlock_irq(&conf->device_lock);
7453 wake_up(&conf->wait_for_overlap);
7454
7455 /* read-ahead size must cover two whole stripes, which is
7456 * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
7457 */
7458 if (conf->mddev->queue) {
7459 int data_disks = conf->raid_disks - conf->max_degraded;
7460 int stripe = data_disks * ((conf->chunk_sectors << 9)
7461 / PAGE_SIZE);
7462 if (conf->mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
7463 conf->mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
7464 }
7465 }
7466 }
7467
7468 /* This is called from the raid5d thread with mddev_lock held.
7469 * It makes config changes to the device.
7470 */
7471 static void raid5_finish_reshape(struct mddev *mddev)
7472 {
7473 struct r5conf *conf = mddev->private;
7474
7475 if (!test_bit(MD_RECOVERY_INTR, &mddev->recovery)) {
7476
7477 if (mddev->delta_disks > 0) {
7478 md_set_array_sectors(mddev, raid5_size(mddev, 0, 0));
7479 set_capacity(mddev->gendisk, mddev->array_sectors);
7480 revalidate_disk(mddev->gendisk);
7481 } else {
7482 int d;
7483 spin_lock_irq(&conf->device_lock);
7484 mddev->degraded = calc_degraded(conf);
7485 spin_unlock_irq(&conf->device_lock);
7486 for (d = conf->raid_disks ;
7487 d < conf->raid_disks - mddev->delta_disks;
7488 d++) {
7489 struct md_rdev *rdev = conf->disks[d].rdev;
7490 if (rdev)
7491 clear_bit(In_sync, &rdev->flags);
7492 rdev = conf->disks[d].replacement;
7493 if (rdev)
7494 clear_bit(In_sync, &rdev->flags);
7495 }
7496 }
7497 mddev->layout = conf->algorithm;
7498 mddev->chunk_sectors = conf->chunk_sectors;
7499 mddev->reshape_position = MaxSector;
7500 mddev->delta_disks = 0;
7501 mddev->reshape_backwards = 0;
7502 }
7503 }
7504
7505 static void raid5_quiesce(struct mddev *mddev, int state)
7506 {
7507 struct r5conf *conf = mddev->private;
7508
7509 switch(state) {
7510 case 2: /* resume for a suspend */
7511 wake_up(&conf->wait_for_overlap);
7512 break;
7513
7514 case 1: /* stop all writes */
7515 lock_all_device_hash_locks_irq(conf);
7516 /* '2' tells resync/reshape to pause so that all
7517 * active stripes can drain
7518 */
7519 conf->quiesce = 2;
7520 wait_event_cmd(conf->wait_for_stripe,
7521 atomic_read(&conf->active_stripes) == 0 &&
7522 atomic_read(&conf->active_aligned_reads) == 0,
7523 unlock_all_device_hash_locks_irq(conf),
7524 lock_all_device_hash_locks_irq(conf));
7525 conf->quiesce = 1;
7526 unlock_all_device_hash_locks_irq(conf);
7527 /* allow reshape to continue */
7528 wake_up(&conf->wait_for_overlap);
7529 break;
7530
7531 case 0: /* re-enable writes */
7532 lock_all_device_hash_locks_irq(conf);
7533 conf->quiesce = 0;
7534 wake_up(&conf->wait_for_stripe);
7535 wake_up(&conf->wait_for_overlap);
7536 unlock_all_device_hash_locks_irq(conf);
7537 break;
7538 }
7539 }
7540
7541 static void *raid45_takeover_raid0(struct mddev *mddev, int level)
7542 {
7543 struct r0conf *raid0_conf = mddev->private;
7544 sector_t sectors;
7545
7546 /* for raid0 takeover only one zone is supported */
7547 if (raid0_conf->nr_strip_zones > 1) {
7548 printk(KERN_ERR "md/raid:%s: cannot takeover raid0 with more than one zone.\n",
7549 mdname(mddev));
7550 return ERR_PTR(-EINVAL);
7551 }
7552
7553 sectors = raid0_conf->strip_zone[0].zone_end;
7554 sector_div(sectors, raid0_conf->strip_zone[0].nb_dev);
7555 mddev->dev_sectors = sectors;
7556 mddev->new_level = level;
7557 mddev->new_layout = ALGORITHM_PARITY_N;
7558 mddev->new_chunk_sectors = mddev->chunk_sectors;
7559 mddev->raid_disks += 1;
7560 mddev->delta_disks = 1;
7561 /* make sure it will be not marked as dirty */
7562 mddev->recovery_cp = MaxSector;
7563
7564 return setup_conf(mddev);
7565 }
7566
7567 static void *raid5_takeover_raid1(struct mddev *mddev)
7568 {
7569 int chunksect;
7570
7571 if (mddev->raid_disks != 2 ||
7572 mddev->degraded > 1)
7573 return ERR_PTR(-EINVAL);
7574
7575 /* Should check if there are write-behind devices? */
7576
7577 chunksect = 64*2; /* 64K by default */
7578
7579 /* The array must be an exact multiple of chunksize */
7580 while (chunksect && (mddev->array_sectors & (chunksect-1)))
7581 chunksect >>= 1;
7582
7583 if ((chunksect<<9) < STRIPE_SIZE)
7584 /* array size does not allow a suitable chunk size */
7585 return ERR_PTR(-EINVAL);
7586
7587 mddev->new_level = 5;
7588 mddev->new_layout = ALGORITHM_LEFT_SYMMETRIC;
7589 mddev->new_chunk_sectors = chunksect;
7590
7591 return setup_conf(mddev);
7592 }
7593
7594 static void *raid5_takeover_raid6(struct mddev *mddev)
7595 {
7596 int new_layout;
7597
7598 switch (mddev->layout) {
7599 case ALGORITHM_LEFT_ASYMMETRIC_6:
7600 new_layout = ALGORITHM_LEFT_ASYMMETRIC;
7601 break;
7602 case ALGORITHM_RIGHT_ASYMMETRIC_6:
7603 new_layout = ALGORITHM_RIGHT_ASYMMETRIC;
7604 break;
7605 case ALGORITHM_LEFT_SYMMETRIC_6:
7606 new_layout = ALGORITHM_LEFT_SYMMETRIC;
7607 break;
7608 case ALGORITHM_RIGHT_SYMMETRIC_6:
7609 new_layout = ALGORITHM_RIGHT_SYMMETRIC;
7610 break;
7611 case ALGORITHM_PARITY_0_6:
7612 new_layout = ALGORITHM_PARITY_0;
7613 break;
7614 case ALGORITHM_PARITY_N:
7615 new_layout = ALGORITHM_PARITY_N;
7616 break;
7617 default:
7618 return ERR_PTR(-EINVAL);
7619 }
7620 mddev->new_level = 5;
7621 mddev->new_layout = new_layout;
7622 mddev->delta_disks = -1;
7623 mddev->raid_disks -= 1;
7624 return setup_conf(mddev);
7625 }
7626
7627 static int raid5_check_reshape(struct mddev *mddev)
7628 {
7629 /* For a 2-drive array, the layout and chunk size can be changed
7630 * immediately as not restriping is needed.
7631 * For larger arrays we record the new value - after validation
7632 * to be used by a reshape pass.
7633 */
7634 struct r5conf *conf = mddev->private;
7635 int new_chunk = mddev->new_chunk_sectors;
7636
7637 if (mddev->new_layout >= 0 && !algorithm_valid_raid5(mddev->new_layout))
7638 return -EINVAL;
7639 if (new_chunk > 0) {
7640 if (!is_power_of_2(new_chunk))
7641 return -EINVAL;
7642 if (new_chunk < (PAGE_SIZE>>9))
7643 return -EINVAL;
7644 if (mddev->array_sectors & (new_chunk-1))
7645 /* not factor of array size */
7646 return -EINVAL;
7647 }
7648
7649 /* They look valid */
7650
7651 if (mddev->raid_disks == 2) {
7652 /* can make the change immediately */
7653 if (mddev->new_layout >= 0) {
7654 conf->algorithm = mddev->new_layout;
7655 mddev->layout = mddev->new_layout;
7656 }
7657 if (new_chunk > 0) {
7658 conf->chunk_sectors = new_chunk ;
7659 mddev->chunk_sectors = new_chunk;
7660 }
7661 set_bit(MD_CHANGE_DEVS, &mddev->flags);
7662 md_wakeup_thread(mddev->thread);
7663 }
7664 return check_reshape(mddev);
7665 }
7666
7667 static int raid6_check_reshape(struct mddev *mddev)
7668 {
7669 int new_chunk = mddev->new_chunk_sectors;
7670
7671 if (mddev->new_layout >= 0 && !algorithm_valid_raid6(mddev->new_layout))
7672 return -EINVAL;
7673 if (new_chunk > 0) {
7674 if (!is_power_of_2(new_chunk))
7675 return -EINVAL;
7676 if (new_chunk < (PAGE_SIZE >> 9))
7677 return -EINVAL;
7678 if (mddev->array_sectors & (new_chunk-1))
7679 /* not factor of array size */
7680 return -EINVAL;
7681 }
7682
7683 /* They look valid */
7684 return check_reshape(mddev);
7685 }
7686
7687 static void *raid5_takeover(struct mddev *mddev)
7688 {
7689 /* raid5 can take over:
7690 * raid0 - if there is only one strip zone - make it a raid4 layout
7691 * raid1 - if there are two drives. We need to know the chunk size
7692 * raid4 - trivial - just use a raid4 layout.
7693 * raid6 - Providing it is a *_6 layout
7694 */
7695 if (mddev->level == 0)
7696 return raid45_takeover_raid0(mddev, 5);
7697 if (mddev->level == 1)
7698 return raid5_takeover_raid1(mddev);
7699 if (mddev->level == 4) {
7700 mddev->new_layout = ALGORITHM_PARITY_N;
7701 mddev->new_level = 5;
7702 return setup_conf(mddev);
7703 }
7704 if (mddev->level == 6)
7705 return raid5_takeover_raid6(mddev);
7706
7707 return ERR_PTR(-EINVAL);
7708 }
7709
7710 static void *raid4_takeover(struct mddev *mddev)
7711 {
7712 /* raid4 can take over:
7713 * raid0 - if there is only one strip zone
7714 * raid5 - if layout is right
7715 */
7716 if (mddev->level == 0)
7717 return raid45_takeover_raid0(mddev, 4);
7718 if (mddev->level == 5 &&
7719 mddev->layout == ALGORITHM_PARITY_N) {
7720 mddev->new_layout = 0;
7721 mddev->new_level = 4;
7722 return setup_conf(mddev);
7723 }
7724 return ERR_PTR(-EINVAL);
7725 }
7726
7727 static struct md_personality raid5_personality;
7728
7729 static void *raid6_takeover(struct mddev *mddev)
7730 {
7731 /* Currently can only take over a raid5. We map the
7732 * personality to an equivalent raid6 personality
7733 * with the Q block at the end.
7734 */
7735 int new_layout;
7736
7737 if (mddev->pers != &raid5_personality)
7738 return ERR_PTR(-EINVAL);
7739 if (mddev->degraded > 1)
7740 return ERR_PTR(-EINVAL);
7741 if (mddev->raid_disks > 253)
7742 return ERR_PTR(-EINVAL);
7743 if (mddev->raid_disks < 3)
7744 return ERR_PTR(-EINVAL);
7745
7746 switch (mddev->layout) {
7747 case ALGORITHM_LEFT_ASYMMETRIC:
7748 new_layout = ALGORITHM_LEFT_ASYMMETRIC_6;
7749 break;
7750 case ALGORITHM_RIGHT_ASYMMETRIC:
7751 new_layout = ALGORITHM_RIGHT_ASYMMETRIC_6;
7752 break;
7753 case ALGORITHM_LEFT_SYMMETRIC:
7754 new_layout = ALGORITHM_LEFT_SYMMETRIC_6;
7755 break;
7756 case ALGORITHM_RIGHT_SYMMETRIC:
7757 new_layout = ALGORITHM_RIGHT_SYMMETRIC_6;
7758 break;
7759 case ALGORITHM_PARITY_0:
7760 new_layout = ALGORITHM_PARITY_0_6;
7761 break;
7762 case ALGORITHM_PARITY_N:
7763 new_layout = ALGORITHM_PARITY_N;
7764 break;
7765 default:
7766 return ERR_PTR(-EINVAL);
7767 }
7768 mddev->new_level = 6;
7769 mddev->new_layout = new_layout;
7770 mddev->delta_disks = 1;
7771 mddev->raid_disks += 1;
7772 return setup_conf(mddev);
7773 }
7774
7775 static struct md_personality raid6_personality =
7776 {
7777 .name = "raid6",
7778 .level = 6,
7779 .owner = THIS_MODULE,
7780 .make_request = make_request,
7781 .run = run,
7782 .free = raid5_free,
7783 .status = status,
7784 .error_handler = error,
7785 .hot_add_disk = raid5_add_disk,
7786 .hot_remove_disk= raid5_remove_disk,
7787 .spare_active = raid5_spare_active,
7788 .sync_request = sync_request,
7789 .resize = raid5_resize,
7790 .size = raid5_size,
7791 .check_reshape = raid6_check_reshape,
7792 .start_reshape = raid5_start_reshape,
7793 .finish_reshape = raid5_finish_reshape,
7794 .quiesce = raid5_quiesce,
7795 .takeover = raid6_takeover,
7796 .congested = raid5_congested,
7797 .mergeable_bvec = raid5_mergeable_bvec,
7798 };
7799 static struct md_personality raid5_personality =
7800 {
7801 .name = "raid5",
7802 .level = 5,
7803 .owner = THIS_MODULE,
7804 .make_request = make_request,
7805 .run = run,
7806 .free = raid5_free,
7807 .status = status,
7808 .error_handler = error,
7809 .hot_add_disk = raid5_add_disk,
7810 .hot_remove_disk= raid5_remove_disk,
7811 .spare_active = raid5_spare_active,
7812 .sync_request = sync_request,
7813 .resize = raid5_resize,
7814 .size = raid5_size,
7815 .check_reshape = raid5_check_reshape,
7816 .start_reshape = raid5_start_reshape,
7817 .finish_reshape = raid5_finish_reshape,
7818 .quiesce = raid5_quiesce,
7819 .takeover = raid5_takeover,
7820 .congested = raid5_congested,
7821 .mergeable_bvec = raid5_mergeable_bvec,
7822 };
7823
7824 static struct md_personality raid4_personality =
7825 {
7826 .name = "raid4",
7827 .level = 4,
7828 .owner = THIS_MODULE,
7829 .make_request = make_request,
7830 .run = run,
7831 .free = raid5_free,
7832 .status = status,
7833 .error_handler = error,
7834 .hot_add_disk = raid5_add_disk,
7835 .hot_remove_disk= raid5_remove_disk,
7836 .spare_active = raid5_spare_active,
7837 .sync_request = sync_request,
7838 .resize = raid5_resize,
7839 .size = raid5_size,
7840 .check_reshape = raid5_check_reshape,
7841 .start_reshape = raid5_start_reshape,
7842 .finish_reshape = raid5_finish_reshape,
7843 .quiesce = raid5_quiesce,
7844 .takeover = raid4_takeover,
7845 .congested = raid5_congested,
7846 .mergeable_bvec = raid5_mergeable_bvec,
7847 };
7848
7849 static int __init raid5_init(void)
7850 {
7851 raid5_wq = alloc_workqueue("raid5wq",
7852 WQ_UNBOUND|WQ_MEM_RECLAIM|WQ_CPU_INTENSIVE|WQ_SYSFS, 0);
7853 if (!raid5_wq)
7854 return -ENOMEM;
7855 register_md_personality(&raid6_personality);
7856 register_md_personality(&raid5_personality);
7857 register_md_personality(&raid4_personality);
7858 return 0;
7859 }
7860
7861 static void raid5_exit(void)
7862 {
7863 unregister_md_personality(&raid6_personality);
7864 unregister_md_personality(&raid5_personality);
7865 unregister_md_personality(&raid4_personality);
7866 destroy_workqueue(raid5_wq);
7867 }
7868
7869 module_init(raid5_init);
7870 module_exit(raid5_exit);
7871 MODULE_LICENSE("GPL");
7872 MODULE_DESCRIPTION("RAID4/5/6 (striping with parity) personality for MD");
7873 MODULE_ALIAS("md-personality-4"); /* RAID5 */
7874 MODULE_ALIAS("md-raid5");
7875 MODULE_ALIAS("md-raid4");
7876 MODULE_ALIAS("md-level-5");
7877 MODULE_ALIAS("md-level-4");
7878 MODULE_ALIAS("md-personality-8"); /* RAID6 */
7879 MODULE_ALIAS("md-raid6");
7880 MODULE_ALIAS("md-level-6");
7881
7882 /* This used to be two separate modules, they were: */
7883 MODULE_ALIAS("raid5");
7884 MODULE_ALIAS("raid6");
This page took 0.193765 seconds and 6 git commands to generate.