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