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