raid5.c 133.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
/*
 * raid5.c : Multiple Devices driver for Linux
 *	   Copyright (C) 1996, 1997 Ingo Molnar, Miguel de Icaza, Gadi Oxman
 *	   Copyright (C) 1999, 2000 Ingo Molnar
5
 *	   Copyright (C) 2002, 2003 H. Peter Anvin
L
Linus Torvalds 已提交
6
 *
7 8 9
 * RAID-4/5/6 management functions.
 * Thanks to Penguin Computing for making the RAID-6 development possible
 * by donating a test server!
L
Linus Torvalds 已提交
10 11 12 13 14 15 16 17 18 19 20
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 *
 * You should have received a copy of the GNU General Public License
 * (for example /usr/src/linux/COPYING); if not, write to the Free
 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
/*
 * BITMAP UNPLUGGING:
 *
 * The sequencing for updating the bitmap reliably is a little
 * subtle (and I got it wrong the first time) so it deserves some
 * explanation.
 *
 * We group bitmap updates into batches.  Each batch has a number.
 * We may write out several batches at once, but that isn't very important.
 * conf->bm_write is the number of the last batch successfully written.
 * conf->bm_flush is the number of the last batch that was closed to
 *    new additions.
 * When we discover that we will need to write to any block in a stripe
 * (in add_stripe_bio) we update the in-memory bitmap and record in sh->bm_seq
 * the number of the batch it will be in. This is bm_flush+1.
 * When we are ready to do a write, if that batch hasn't been written yet,
 *   we plug the array and queue the stripe for later.
 * When an unplug happens, we increment bm_flush, thus closing the current
 *   batch.
 * When we notice that bm_flush > bm_write, we write out all pending updates
 * to the bitmap, and advance bm_write to where bm_flush was.
 * This may occasionally write a bit out twice, but is sure never to
 * miss any bits.
 */
L
Linus Torvalds 已提交
45

46
#include <linux/blkdev.h>
47
#include <linux/kthread.h>
48
#include <linux/async_tx.h>
49
#include <linux/seq_file.h>
50
#include "md.h"
51
#include "raid5.h"
52 53
#include "raid6.h"
#include "bitmap.h"
54

L
Linus Torvalds 已提交
55 56 57 58 59 60 61 62 63
/*
 * Stripe cache
 */

#define NR_STRIPES		256
#define STRIPE_SIZE		PAGE_SIZE
#define STRIPE_SHIFT		(PAGE_SHIFT - 9)
#define STRIPE_SECTORS		(STRIPE_SIZE>>9)
#define	IO_THRESHOLD		1
64
#define BYPASS_THRESHOLD	1
65
#define NR_HASH			(PAGE_SIZE / sizeof(struct hlist_head))
L
Linus Torvalds 已提交
66 67
#define HASH_MASK		(NR_HASH - 1)

68
#define stripe_hash(conf, sect)	(&((conf)->stripe_hashtbl[((sect) >> STRIPE_SHIFT) & HASH_MASK]))
L
Linus Torvalds 已提交
69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89

/* bio's attached to a stripe+device for I/O are linked together in bi_sector
 * order without overlap.  There may be several bio's per stripe+device, and
 * a bio could span several devices.
 * When walking this list for a particular stripe+device, we must never proceed
 * beyond a bio that extends past this device, as the next bio might no longer
 * be valid.
 * This macro is used to determine the 'next' bio in the list, given the sector
 * of the current stripe+device
 */
#define r5_next_bio(bio, sect) ( ( (bio)->bi_sector + ((bio)->bi_size>>9) < sect + STRIPE_SECTORS) ? (bio)->bi_next : NULL)
/*
 * The following can be used to debug the driver
 */
#define RAID5_PARANOIA	1
#if RAID5_PARANOIA && defined(CONFIG_SMP)
# define CHECK_DEVLOCK() assert_spin_locked(&conf->device_lock)
#else
# define CHECK_DEVLOCK()
#endif

90
#ifdef DEBUG
L
Linus Torvalds 已提交
91 92 93 94
#define inline
#define __inline__
#endif

95 96
#define printk_rl(args...) ((void) (printk_ratelimit() && printk(args)))

97 98 99 100 101
#if !RAID6_USE_EMPTY_ZERO_PAGE
/* In .bss so it's zeroed */
const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
#endif

102
/*
103 104
 * We maintain a biased count of active stripes in the bottom 16 bits of
 * bi_phys_segments, and a count of processed stripes in the upper 16 bits
105 106 107
 */
static inline int raid5_bi_phys_segments(struct bio *bio)
{
108
	return bio->bi_phys_segments & 0xffff;
109 110 111 112
}

static inline int raid5_bi_hw_segments(struct bio *bio)
{
113
	return (bio->bi_phys_segments >> 16) & 0xffff;
114 115 116 117 118 119 120 121 122 123 124 125 126
}

static inline int raid5_dec_bi_phys_segments(struct bio *bio)
{
	--bio->bi_phys_segments;
	return raid5_bi_phys_segments(bio);
}

static inline int raid5_dec_bi_hw_segments(struct bio *bio)
{
	unsigned short val = raid5_bi_hw_segments(bio);

	--val;
127
	bio->bi_phys_segments = (val << 16) | raid5_bi_phys_segments(bio);
128 129 130 131 132
	return val;
}

static inline void raid5_set_bi_hw_segments(struct bio *bio, unsigned int cnt)
{
133
	bio->bi_phys_segments = raid5_bi_phys_segments(bio) || (cnt << 16);
134 135
}

136 137 138 139 140 141 142 143
/* Find first data disk in a raid6 stripe */
static inline int raid6_d0(struct stripe_head *sh)
{
	if (sh->qd_idx == sh->disks - 1)
		return 0;
	else
		return sh->qd_idx + 1;
}
144 145 146 147 148
static inline int raid6_next_disk(int disk, int raid_disks)
{
	disk++;
	return (disk < raid_disks) ? disk : 0;
}
149

150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
/* When walking through the disks in a raid5, starting at raid6_d0,
 * We need to map each disk to a 'slot', where the data disks are slot
 * 0 .. raid_disks-3, the parity disk is raid_disks-2 and the Q disk
 * is raid_disks-1.  This help does that mapping.
 */
static int raid6_idx_to_slot(int idx, struct stripe_head *sh, int *count)
{
	int slot;
	if (idx == sh->pd_idx)
		return sh->disks - 2;
	if (idx == sh->qd_idx)
		return sh->disks - 1;
	slot = (*count)++;
	return slot;
}

166 167 168 169 170 171 172 173
static void return_io(struct bio *return_bi)
{
	struct bio *bi = return_bi;
	while (bi) {

		return_bi = bi->bi_next;
		bi->bi_next = NULL;
		bi->bi_size = 0;
174
		bio_endio(bi, 0);
175 176 177 178
		bi = return_bi;
	}
}

L
Linus Torvalds 已提交
179 180
static void print_raid5_conf (raid5_conf_t *conf);

181 182 183 184 185 186 187
static int stripe_operations_active(struct stripe_head *sh)
{
	return sh->check_state || sh->reconstruct_state ||
	       test_bit(STRIPE_BIOFILL_RUN, &sh->state) ||
	       test_bit(STRIPE_COMPUTE_RUN, &sh->state);
}

188
static void __release_stripe(raid5_conf_t *conf, struct stripe_head *sh)
L
Linus Torvalds 已提交
189 190
{
	if (atomic_dec_and_test(&sh->count)) {
191 192
		BUG_ON(!list_empty(&sh->lru));
		BUG_ON(atomic_read(&conf->active_stripes)==0);
L
Linus Torvalds 已提交
193
		if (test_bit(STRIPE_HANDLE, &sh->state)) {
194
			if (test_bit(STRIPE_DELAYED, &sh->state)) {
L
Linus Torvalds 已提交
195
				list_add_tail(&sh->lru, &conf->delayed_list);
196 197
				blk_plug_device(conf->mddev->queue);
			} else if (test_bit(STRIPE_BIT_DELAY, &sh->state) &&
198
				   sh->bm_seq - conf->seq_write > 0) {
199
				list_add_tail(&sh->lru, &conf->bitmap_list);
200 201
				blk_plug_device(conf->mddev->queue);
			} else {
202
				clear_bit(STRIPE_BIT_DELAY, &sh->state);
L
Linus Torvalds 已提交
203
				list_add_tail(&sh->lru, &conf->handle_list);
204
			}
L
Linus Torvalds 已提交
205 206
			md_wakeup_thread(conf->mddev->thread);
		} else {
207
			BUG_ON(stripe_operations_active(sh));
L
Linus Torvalds 已提交
208 209 210 211 212 213
			if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
				atomic_dec(&conf->preread_active_stripes);
				if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD)
					md_wakeup_thread(conf->mddev->thread);
			}
			atomic_dec(&conf->active_stripes);
214 215
			if (!test_bit(STRIPE_EXPANDING, &sh->state)) {
				list_add_tail(&sh->lru, &conf->inactive_list);
L
Linus Torvalds 已提交
216
				wake_up(&conf->wait_for_stripe);
217 218
				if (conf->retry_read_aligned)
					md_wakeup_thread(conf->mddev->thread);
219
			}
L
Linus Torvalds 已提交
220 221 222
		}
	}
}
223

L
Linus Torvalds 已提交
224 225 226 227
static void release_stripe(struct stripe_head *sh)
{
	raid5_conf_t *conf = sh->raid_conf;
	unsigned long flags;
228

L
Linus Torvalds 已提交
229 230 231 232 233
	spin_lock_irqsave(&conf->device_lock, flags);
	__release_stripe(conf, sh);
	spin_unlock_irqrestore(&conf->device_lock, flags);
}

234
static inline void remove_hash(struct stripe_head *sh)
L
Linus Torvalds 已提交
235
{
236 237
	pr_debug("remove_hash(), stripe %llu\n",
		(unsigned long long)sh->sector);
L
Linus Torvalds 已提交
238

239
	hlist_del_init(&sh->hash);
L
Linus Torvalds 已提交
240 241
}

242
static inline void insert_hash(raid5_conf_t *conf, struct stripe_head *sh)
L
Linus Torvalds 已提交
243
{
244
	struct hlist_head *hp = stripe_hash(conf, sh->sector);
L
Linus Torvalds 已提交
245

246 247
	pr_debug("insert_hash(), stripe %llu\n",
		(unsigned long long)sh->sector);
L
Linus Torvalds 已提交
248 249

	CHECK_DEVLOCK();
250
	hlist_add_head(&sh->hash, hp);
L
Linus Torvalds 已提交
251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
}


/* find an idle stripe, make sure it is unhashed, and return it. */
static struct stripe_head *get_free_stripe(raid5_conf_t *conf)
{
	struct stripe_head *sh = NULL;
	struct list_head *first;

	CHECK_DEVLOCK();
	if (list_empty(&conf->inactive_list))
		goto out;
	first = conf->inactive_list.next;
	sh = list_entry(first, struct stripe_head, lru);
	list_del_init(first);
	remove_hash(sh);
	atomic_inc(&conf->active_stripes);
out:
	return sh;
}

static void shrink_buffers(struct stripe_head *sh, int num)
{
	struct page *p;
	int i;

	for (i=0; i<num ; i++) {
		p = sh->dev[i].page;
		if (!p)
			continue;
		sh->dev[i].page = NULL;
282
		put_page(p);
L
Linus Torvalds 已提交
283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
	}
}

static int grow_buffers(struct stripe_head *sh, int num)
{
	int i;

	for (i=0; i<num; i++) {
		struct page *page;

		if (!(page = alloc_page(GFP_KERNEL))) {
			return 1;
		}
		sh->dev[i].page = page;
	}
	return 0;
}

301
static void raid5_build_block(struct stripe_head *sh, int i);
302 303
static int stripe_to_pdidx(sector_t stripe, raid5_conf_t *conf, int previous,
			   int *qd_idx);
L
Linus Torvalds 已提交
304

305
static void init_stripe(struct stripe_head *sh, sector_t sector, int previous)
L
Linus Torvalds 已提交
306 307
{
	raid5_conf_t *conf = sh->raid_conf;
308
	int i;
309
	int qd_idx;
L
Linus Torvalds 已提交
310

311 312
	BUG_ON(atomic_read(&sh->count) != 0);
	BUG_ON(test_bit(STRIPE_HANDLE, &sh->state));
313
	BUG_ON(stripe_operations_active(sh));
314

L
Linus Torvalds 已提交
315
	CHECK_DEVLOCK();
316
	pr_debug("init_stripe called, stripe %llu\n",
L
Linus Torvalds 已提交
317 318 319
		(unsigned long long)sh->sector);

	remove_hash(sh);
320

321
	sh->disks = previous ? conf->previous_raid_disks : conf->raid_disks;
L
Linus Torvalds 已提交
322
	sh->sector = sector;
323 324
	sh->pd_idx = stripe_to_pdidx(sector, conf, previous, &qd_idx);
	sh->qd_idx = qd_idx;
L
Linus Torvalds 已提交
325 326
	sh->state = 0;

327 328

	for (i = sh->disks; i--; ) {
L
Linus Torvalds 已提交
329 330
		struct r5dev *dev = &sh->dev[i];

331
		if (dev->toread || dev->read || dev->towrite || dev->written ||
L
Linus Torvalds 已提交
332
		    test_bit(R5_LOCKED, &dev->flags)) {
333
			printk(KERN_ERR "sector=%llx i=%d %p %p %p %p %d\n",
L
Linus Torvalds 已提交
334
			       (unsigned long long)sh->sector, i, dev->toread,
335
			       dev->read, dev->towrite, dev->written,
L
Linus Torvalds 已提交
336 337 338 339 340 341 342 343 344
			       test_bit(R5_LOCKED, &dev->flags));
			BUG();
		}
		dev->flags = 0;
		raid5_build_block(sh, i);
	}
	insert_hash(conf, sh);
}

345
static struct stripe_head *__find_stripe(raid5_conf_t *conf, sector_t sector, int disks)
L
Linus Torvalds 已提交
346 347
{
	struct stripe_head *sh;
348
	struct hlist_node *hn;
L
Linus Torvalds 已提交
349 350

	CHECK_DEVLOCK();
351
	pr_debug("__find_stripe, sector %llu\n", (unsigned long long)sector);
352
	hlist_for_each_entry(sh, hn, stripe_hash(conf, sector), hash)
353
		if (sh->sector == sector && sh->disks == disks)
L
Linus Torvalds 已提交
354
			return sh;
355
	pr_debug("__stripe %llu not in cache\n", (unsigned long long)sector);
L
Linus Torvalds 已提交
356 357 358 359
	return NULL;
}

static void unplug_slaves(mddev_t *mddev);
360
static void raid5_unplug_device(struct request_queue *q);
L
Linus Torvalds 已提交
361

362 363 364
static struct stripe_head *
get_active_stripe(raid5_conf_t *conf, sector_t sector,
		  int previous, int noblock)
L
Linus Torvalds 已提交
365 366
{
	struct stripe_head *sh;
367
	int disks = previous ? conf->previous_raid_disks : conf->raid_disks;
L
Linus Torvalds 已提交
368

369
	pr_debug("get_stripe, sector %llu\n", (unsigned long long)sector);
L
Linus Torvalds 已提交
370 371 372 373

	spin_lock_irq(&conf->device_lock);

	do {
374 375 376
		wait_event_lock_irq(conf->wait_for_stripe,
				    conf->quiesce == 0,
				    conf->device_lock, /* nothing */);
377
		sh = __find_stripe(conf, sector, disks);
L
Linus Torvalds 已提交
378 379 380 381 382 383 384 385 386
		if (!sh) {
			if (!conf->inactive_blocked)
				sh = get_free_stripe(conf);
			if (noblock && sh == NULL)
				break;
			if (!sh) {
				conf->inactive_blocked = 1;
				wait_event_lock_irq(conf->wait_for_stripe,
						    !list_empty(&conf->inactive_list) &&
387 388
						    (atomic_read(&conf->active_stripes)
						     < (conf->max_nr_stripes *3/4)
L
Linus Torvalds 已提交
389 390
						     || !conf->inactive_blocked),
						    conf->device_lock,
391
						    raid5_unplug_device(conf->mddev->queue)
L
Linus Torvalds 已提交
392 393 394
					);
				conf->inactive_blocked = 0;
			} else
395
				init_stripe(sh, sector, previous);
L
Linus Torvalds 已提交
396 397
		} else {
			if (atomic_read(&sh->count)) {
398
			  BUG_ON(!list_empty(&sh->lru));
L
Linus Torvalds 已提交
399 400 401
			} else {
				if (!test_bit(STRIPE_HANDLE, &sh->state))
					atomic_inc(&conf->active_stripes);
402 403
				if (list_empty(&sh->lru) &&
				    !test_bit(STRIPE_EXPANDING, &sh->state))
404 405
					BUG();
				list_del_init(&sh->lru);
L
Linus Torvalds 已提交
406 407 408 409 410 411 412 413 414 415 416
			}
		}
	} while (sh == NULL);

	if (sh)
		atomic_inc(&sh->count);

	spin_unlock_irq(&conf->device_lock);
	return sh;
}

417 418 419 420
static void
raid5_end_read_request(struct bio *bi, int error);
static void
raid5_end_write_request(struct bio *bi, int error);
421

422
static void ops_run_io(struct stripe_head *sh, struct stripe_head_state *s)
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
{
	raid5_conf_t *conf = sh->raid_conf;
	int i, disks = sh->disks;

	might_sleep();

	for (i = disks; i--; ) {
		int rw;
		struct bio *bi;
		mdk_rdev_t *rdev;
		if (test_and_clear_bit(R5_Wantwrite, &sh->dev[i].flags))
			rw = WRITE;
		else if (test_and_clear_bit(R5_Wantread, &sh->dev[i].flags))
			rw = READ;
		else
			continue;

		bi = &sh->dev[i].req;

		bi->bi_rw = rw;
		if (rw == WRITE)
			bi->bi_end_io = raid5_end_write_request;
		else
			bi->bi_end_io = raid5_end_read_request;

		rcu_read_lock();
		rdev = rcu_dereference(conf->disks[i].rdev);
		if (rdev && test_bit(Faulty, &rdev->flags))
			rdev = NULL;
		if (rdev)
			atomic_inc(&rdev->nr_pending);
		rcu_read_unlock();

		if (rdev) {
457
			if (s->syncing || s->expanding || s->expanded)
458 459
				md_sync_acct(rdev->bdev, STRIPE_SECTORS);

D
Dan Williams 已提交
460 461
			set_bit(STRIPE_IO_STARTED, &sh->state);

462 463
			bi->bi_bdev = rdev->bdev;
			pr_debug("%s: for %llu schedule op %ld on disc %d\n",
464
				__func__, (unsigned long long)sh->sector,
465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527
				bi->bi_rw, i);
			atomic_inc(&sh->count);
			bi->bi_sector = sh->sector + rdev->data_offset;
			bi->bi_flags = 1 << BIO_UPTODATE;
			bi->bi_vcnt = 1;
			bi->bi_max_vecs = 1;
			bi->bi_idx = 0;
			bi->bi_io_vec = &sh->dev[i].vec;
			bi->bi_io_vec[0].bv_len = STRIPE_SIZE;
			bi->bi_io_vec[0].bv_offset = 0;
			bi->bi_size = STRIPE_SIZE;
			bi->bi_next = NULL;
			if (rw == WRITE &&
			    test_bit(R5_ReWrite, &sh->dev[i].flags))
				atomic_add(STRIPE_SECTORS,
					&rdev->corrected_errors);
			generic_make_request(bi);
		} else {
			if (rw == WRITE)
				set_bit(STRIPE_DEGRADED, &sh->state);
			pr_debug("skip op %ld on disc %d for sector %llu\n",
				bi->bi_rw, i, (unsigned long long)sh->sector);
			clear_bit(R5_LOCKED, &sh->dev[i].flags);
			set_bit(STRIPE_HANDLE, &sh->state);
		}
	}
}

static struct dma_async_tx_descriptor *
async_copy_data(int frombio, struct bio *bio, struct page *page,
	sector_t sector, struct dma_async_tx_descriptor *tx)
{
	struct bio_vec *bvl;
	struct page *bio_page;
	int i;
	int page_offset;

	if (bio->bi_sector >= sector)
		page_offset = (signed)(bio->bi_sector - sector) * 512;
	else
		page_offset = (signed)(sector - bio->bi_sector) * -512;
	bio_for_each_segment(bvl, bio, i) {
		int len = bio_iovec_idx(bio, i)->bv_len;
		int clen;
		int b_offset = 0;

		if (page_offset < 0) {
			b_offset = -page_offset;
			page_offset += b_offset;
			len -= b_offset;
		}

		if (len > 0 && page_offset + len > STRIPE_SIZE)
			clen = STRIPE_SIZE - page_offset;
		else
			clen = len;

		if (clen > 0) {
			b_offset += bio_iovec_idx(bio, i)->bv_offset;
			bio_page = bio_iovec_idx(bio, i)->bv_page;
			if (frombio)
				tx = async_memcpy(page, bio_page, page_offset,
					b_offset, clen,
528
					ASYNC_TX_DEP_ACK,
529 530 531 532
					tx, NULL, NULL);
			else
				tx = async_memcpy(bio_page, page, b_offset,
					page_offset, clen,
533
					ASYNC_TX_DEP_ACK,
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548
					tx, NULL, NULL);
		}
		if (clen < len) /* hit end of page */
			break;
		page_offset +=  len;
	}

	return tx;
}

static void ops_complete_biofill(void *stripe_head_ref)
{
	struct stripe_head *sh = stripe_head_ref;
	struct bio *return_bi = NULL;
	raid5_conf_t *conf = sh->raid_conf;
549
	int i;
550

551
	pr_debug("%s: stripe %llu\n", __func__,
552 553 554
		(unsigned long long)sh->sector);

	/* clear completed biofills */
555
	spin_lock_irq(&conf->device_lock);
556 557 558 559
	for (i = sh->disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];

		/* acknowledge completion of a biofill operation */
560 561
		/* and check if we need to reply to a read request,
		 * new R5_Wantfill requests are held off until
562
		 * !STRIPE_BIOFILL_RUN
563 564
		 */
		if (test_and_clear_bit(R5_Wantfill, &dev->flags)) {
565 566 567 568 569 570 571 572
			struct bio *rbi, *rbi2;

			BUG_ON(!dev->read);
			rbi = dev->read;
			dev->read = NULL;
			while (rbi && rbi->bi_sector <
				dev->sector + STRIPE_SECTORS) {
				rbi2 = r5_next_bio(rbi, dev->sector);
573
				if (!raid5_dec_bi_phys_segments(rbi)) {
574 575 576 577 578 579 580
					rbi->bi_next = return_bi;
					return_bi = rbi;
				}
				rbi = rbi2;
			}
		}
	}
581 582
	spin_unlock_irq(&conf->device_lock);
	clear_bit(STRIPE_BIOFILL_RUN, &sh->state);
583 584 585

	return_io(return_bi);

586
	set_bit(STRIPE_HANDLE, &sh->state);
587 588 589 590 591 592 593 594 595
	release_stripe(sh);
}

static void ops_run_biofill(struct stripe_head *sh)
{
	struct dma_async_tx_descriptor *tx = NULL;
	raid5_conf_t *conf = sh->raid_conf;
	int i;

596
	pr_debug("%s: stripe %llu\n", __func__,
597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626
		(unsigned long long)sh->sector);

	for (i = sh->disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		if (test_bit(R5_Wantfill, &dev->flags)) {
			struct bio *rbi;
			spin_lock_irq(&conf->device_lock);
			dev->read = rbi = dev->toread;
			dev->toread = NULL;
			spin_unlock_irq(&conf->device_lock);
			while (rbi && rbi->bi_sector <
				dev->sector + STRIPE_SECTORS) {
				tx = async_copy_data(0, rbi, dev->page,
					dev->sector, tx);
				rbi = r5_next_bio(rbi, dev->sector);
			}
		}
	}

	atomic_inc(&sh->count);
	async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
		ops_complete_biofill, sh);
}

static void ops_complete_compute5(void *stripe_head_ref)
{
	struct stripe_head *sh = stripe_head_ref;
	int target = sh->ops.target;
	struct r5dev *tgt = &sh->dev[target];

627
	pr_debug("%s: stripe %llu\n", __func__,
628 629 630 631 632
		(unsigned long long)sh->sector);

	set_bit(R5_UPTODATE, &tgt->flags);
	BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));
	clear_bit(R5_Wantcompute, &tgt->flags);
633 634 635
	clear_bit(STRIPE_COMPUTE_RUN, &sh->state);
	if (sh->check_state == check_state_compute_run)
		sh->check_state = check_state_compute_result;
636 637 638 639
	set_bit(STRIPE_HANDLE, &sh->state);
	release_stripe(sh);
}

640
static struct dma_async_tx_descriptor *ops_run_compute5(struct stripe_head *sh)
641 642 643 644 645 646 647 648 649 650 651 652
{
	/* kernel stack size limits the total number of disks */
	int disks = sh->disks;
	struct page *xor_srcs[disks];
	int target = sh->ops.target;
	struct r5dev *tgt = &sh->dev[target];
	struct page *xor_dest = tgt->page;
	int count = 0;
	struct dma_async_tx_descriptor *tx;
	int i;

	pr_debug("%s: stripe %llu block: %d\n",
653
		__func__, (unsigned long long)sh->sector, target);
654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676
	BUG_ON(!test_bit(R5_Wantcompute, &tgt->flags));

	for (i = disks; i--; )
		if (i != target)
			xor_srcs[count++] = sh->dev[i].page;

	atomic_inc(&sh->count);

	if (unlikely(count == 1))
		tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
			0, NULL, ops_complete_compute5, sh);
	else
		tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
			ASYNC_TX_XOR_ZERO_DST, NULL,
			ops_complete_compute5, sh);

	return tx;
}

static void ops_complete_prexor(void *stripe_head_ref)
{
	struct stripe_head *sh = stripe_head_ref;

677
	pr_debug("%s: stripe %llu\n", __func__,
678 679 680 681 682 683 684 685 686 687 688 689 690 691
		(unsigned long long)sh->sector);
}

static struct dma_async_tx_descriptor *
ops_run_prexor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
{
	/* kernel stack size limits the total number of disks */
	int disks = sh->disks;
	struct page *xor_srcs[disks];
	int count = 0, pd_idx = sh->pd_idx, i;

	/* existing parity data subtracted */
	struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;

692
	pr_debug("%s: stripe %llu\n", __func__,
693 694 695 696 697
		(unsigned long long)sh->sector);

	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		/* Only process blocks that are known to be uptodate */
698
		if (test_bit(R5_Wantdrain, &dev->flags))
699 700 701 702 703 704 705 706 707 708 709
			xor_srcs[count++] = dev->page;
	}

	tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
		ASYNC_TX_DEP_ACK | ASYNC_TX_XOR_DROP_DST, tx,
		ops_complete_prexor, sh);

	return tx;
}

static struct dma_async_tx_descriptor *
710
ops_run_biodrain(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
711 712
{
	int disks = sh->disks;
713
	int i;
714

715
	pr_debug("%s: stripe %llu\n", __func__,
716 717 718 719 720 721
		(unsigned long long)sh->sector);

	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		struct bio *chosen;

722
		if (test_and_clear_bit(R5_Wantdrain, &dev->flags)) {
723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748
			struct bio *wbi;

			spin_lock(&sh->lock);
			chosen = dev->towrite;
			dev->towrite = NULL;
			BUG_ON(dev->written);
			wbi = dev->written = chosen;
			spin_unlock(&sh->lock);

			while (wbi && wbi->bi_sector <
				dev->sector + STRIPE_SECTORS) {
				tx = async_copy_data(1, wbi, dev->page,
					dev->sector, tx);
				wbi = r5_next_bio(wbi, dev->sector);
			}
		}
	}

	return tx;
}

static void ops_complete_postxor(void *stripe_head_ref)
{
	struct stripe_head *sh = stripe_head_ref;
	int disks = sh->disks, i, pd_idx = sh->pd_idx;

749
	pr_debug("%s: stripe %llu\n", __func__,
750 751 752 753 754 755 756 757
		(unsigned long long)sh->sector);

	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		if (dev->written || i == pd_idx)
			set_bit(R5_UPTODATE, &dev->flags);
	}

758 759 760 761 762 763 764 765
	if (sh->reconstruct_state == reconstruct_state_drain_run)
		sh->reconstruct_state = reconstruct_state_drain_result;
	else if (sh->reconstruct_state == reconstruct_state_prexor_drain_run)
		sh->reconstruct_state = reconstruct_state_prexor_drain_result;
	else {
		BUG_ON(sh->reconstruct_state != reconstruct_state_run);
		sh->reconstruct_state = reconstruct_state_result;
	}
766 767 768 769 770 771

	set_bit(STRIPE_HANDLE, &sh->state);
	release_stripe(sh);
}

static void
772
ops_run_postxor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
773 774 775 776 777 778 779
{
	/* kernel stack size limits the total number of disks */
	int disks = sh->disks;
	struct page *xor_srcs[disks];

	int count = 0, pd_idx = sh->pd_idx, i;
	struct page *xor_dest;
780
	int prexor = 0;
781 782
	unsigned long flags;

783
	pr_debug("%s: stripe %llu\n", __func__,
784 785 786 787 788
		(unsigned long long)sh->sector);

	/* check if prexor is active which means only process blocks
	 * that are part of a read-modify-write (written)
	 */
789 790
	if (sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
		prexor = 1;
791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818
		xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (dev->written)
				xor_srcs[count++] = dev->page;
		}
	} else {
		xor_dest = sh->dev[pd_idx].page;
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (i != pd_idx)
				xor_srcs[count++] = dev->page;
		}
	}

	/* 1/ if we prexor'd then the dest is reused as a source
	 * 2/ if we did not prexor then we are redoing the parity
	 * set ASYNC_TX_XOR_DROP_DST and ASYNC_TX_XOR_ZERO_DST
	 * for the synchronous xor case
	 */
	flags = ASYNC_TX_DEP_ACK | ASYNC_TX_ACK |
		(prexor ? ASYNC_TX_XOR_DROP_DST : ASYNC_TX_XOR_ZERO_DST);

	atomic_inc(&sh->count);

	if (unlikely(count == 1)) {
		flags &= ~(ASYNC_TX_XOR_DROP_DST | ASYNC_TX_XOR_ZERO_DST);
		tx = async_memcpy(xor_dest, xor_srcs[0], 0, 0, STRIPE_SIZE,
819
			flags, tx, ops_complete_postxor, sh);
820 821
	} else
		tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
822
			flags, tx, ops_complete_postxor, sh);
823 824 825 826 827 828
}

static void ops_complete_check(void *stripe_head_ref)
{
	struct stripe_head *sh = stripe_head_ref;

829
	pr_debug("%s: stripe %llu\n", __func__,
830 831
		(unsigned long long)sh->sector);

832
	sh->check_state = check_state_check_result;
833 834 835 836 837 838 839 840 841 842 843 844 845 846
	set_bit(STRIPE_HANDLE, &sh->state);
	release_stripe(sh);
}

static void ops_run_check(struct stripe_head *sh)
{
	/* kernel stack size limits the total number of disks */
	int disks = sh->disks;
	struct page *xor_srcs[disks];
	struct dma_async_tx_descriptor *tx;

	int count = 0, pd_idx = sh->pd_idx, i;
	struct page *xor_dest = xor_srcs[count++] = sh->dev[pd_idx].page;

847
	pr_debug("%s: stripe %llu\n", __func__,
848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863
		(unsigned long long)sh->sector);

	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		if (i != pd_idx)
			xor_srcs[count++] = dev->page;
	}

	tx = async_xor_zero_sum(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
		&sh->ops.zero_sum_result, 0, NULL, NULL, NULL);

	atomic_inc(&sh->count);
	tx = async_trigger_callback(ASYNC_TX_DEP_ACK | ASYNC_TX_ACK, tx,
		ops_complete_check, sh);
}

864
static void raid5_run_ops(struct stripe_head *sh, unsigned long ops_request)
865 866 867 868
{
	int overlap_clear = 0, i, disks = sh->disks;
	struct dma_async_tx_descriptor *tx = NULL;

869
	if (test_bit(STRIPE_OP_BIOFILL, &ops_request)) {
870 871 872 873
		ops_run_biofill(sh);
		overlap_clear++;
	}

874 875 876 877 878 879
	if (test_bit(STRIPE_OP_COMPUTE_BLK, &ops_request)) {
		tx = ops_run_compute5(sh);
		/* terminate the chain if postxor is not set to be run */
		if (tx && !test_bit(STRIPE_OP_POSTXOR, &ops_request))
			async_tx_ack(tx);
	}
880

881
	if (test_bit(STRIPE_OP_PREXOR, &ops_request))
882 883
		tx = ops_run_prexor(sh, tx);

884
	if (test_bit(STRIPE_OP_BIODRAIN, &ops_request)) {
885
		tx = ops_run_biodrain(sh, tx);
886 887 888
		overlap_clear++;
	}

889
	if (test_bit(STRIPE_OP_POSTXOR, &ops_request))
890
		ops_run_postxor(sh, tx);
891

892
	if (test_bit(STRIPE_OP_CHECK, &ops_request))
893 894 895 896 897 898 899 900 901 902
		ops_run_check(sh);

	if (overlap_clear)
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (test_and_clear_bit(R5_Overlap, &dev->flags))
				wake_up(&sh->raid_conf->wait_for_overlap);
		}
}

903
static int grow_one_stripe(raid5_conf_t *conf)
L
Linus Torvalds 已提交
904 905
{
	struct stripe_head *sh;
906 907 908 909 910 911 912 913 914 915 916 917
	sh = kmem_cache_alloc(conf->slab_cache, GFP_KERNEL);
	if (!sh)
		return 0;
	memset(sh, 0, sizeof(*sh) + (conf->raid_disks-1)*sizeof(struct r5dev));
	sh->raid_conf = conf;
	spin_lock_init(&sh->lock);

	if (grow_buffers(sh, conf->raid_disks)) {
		shrink_buffers(sh, conf->raid_disks);
		kmem_cache_free(conf->slab_cache, sh);
		return 0;
	}
918
	sh->disks = conf->raid_disks;
919 920 921 922 923 924 925 926 927 928
	/* we just created an active stripe so... */
	atomic_set(&sh->count, 1);
	atomic_inc(&conf->active_stripes);
	INIT_LIST_HEAD(&sh->lru);
	release_stripe(sh);
	return 1;
}

static int grow_stripes(raid5_conf_t *conf, int num)
{
929
	struct kmem_cache *sc;
L
Linus Torvalds 已提交
930 931
	int devs = conf->raid_disks;

932 933
	sprintf(conf->cache_name[0], "raid5-%s", mdname(conf->mddev));
	sprintf(conf->cache_name[1], "raid5-%s-alt", mdname(conf->mddev));
934 935
	conf->active_name = 0;
	sc = kmem_cache_create(conf->cache_name[conf->active_name],
L
Linus Torvalds 已提交
936
			       sizeof(struct stripe_head)+(devs-1)*sizeof(struct r5dev),
937
			       0, 0, NULL);
L
Linus Torvalds 已提交
938 939 940
	if (!sc)
		return 1;
	conf->slab_cache = sc;
941
	conf->pool_size = devs;
942
	while (num--)
943
		if (!grow_one_stripe(conf))
L
Linus Torvalds 已提交
944 945 946
			return 1;
	return 0;
}
947 948

#ifdef CONFIG_MD_RAID5_RESHAPE
949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976
static int resize_stripes(raid5_conf_t *conf, int newsize)
{
	/* Make all the stripes able to hold 'newsize' devices.
	 * New slots in each stripe get 'page' set to a new page.
	 *
	 * This happens in stages:
	 * 1/ create a new kmem_cache and allocate the required number of
	 *    stripe_heads.
	 * 2/ gather all the old stripe_heads and tranfer the pages across
	 *    to the new stripe_heads.  This will have the side effect of
	 *    freezing the array as once all stripe_heads have been collected,
	 *    no IO will be possible.  Old stripe heads are freed once their
	 *    pages have been transferred over, and the old kmem_cache is
	 *    freed when all stripes are done.
	 * 3/ reallocate conf->disks to be suitable bigger.  If this fails,
	 *    we simple return a failre status - no need to clean anything up.
	 * 4/ allocate new pages for the new slots in the new stripe_heads.
	 *    If this fails, we don't bother trying the shrink the
	 *    stripe_heads down again, we just leave them as they are.
	 *    As each stripe_head is processed the new one is released into
	 *    active service.
	 *
	 * Once step2 is started, we cannot afford to wait for a write,
	 * so we use GFP_NOIO allocations.
	 */
	struct stripe_head *osh, *nsh;
	LIST_HEAD(newstripes);
	struct disk_info *ndisks;
977
	int err;
978
	struct kmem_cache *sc;
979 980 981 982 983
	int i;

	if (newsize <= conf->pool_size)
		return 0; /* never bother to shrink */

984 985 986
	err = md_allow_write(conf->mddev);
	if (err)
		return err;
987

988 989 990
	/* Step 1 */
	sc = kmem_cache_create(conf->cache_name[1-conf->active_name],
			       sizeof(struct stripe_head)+(newsize-1)*sizeof(struct r5dev),
991
			       0, 0, NULL);
992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025
	if (!sc)
		return -ENOMEM;

	for (i = conf->max_nr_stripes; i; i--) {
		nsh = kmem_cache_alloc(sc, GFP_KERNEL);
		if (!nsh)
			break;

		memset(nsh, 0, sizeof(*nsh) + (newsize-1)*sizeof(struct r5dev));

		nsh->raid_conf = conf;
		spin_lock_init(&nsh->lock);

		list_add(&nsh->lru, &newstripes);
	}
	if (i) {
		/* didn't get enough, give up */
		while (!list_empty(&newstripes)) {
			nsh = list_entry(newstripes.next, struct stripe_head, lru);
			list_del(&nsh->lru);
			kmem_cache_free(sc, nsh);
		}
		kmem_cache_destroy(sc);
		return -ENOMEM;
	}
	/* Step 2 - Must use GFP_NOIO now.
	 * OK, we have enough stripes, start collecting inactive
	 * stripes and copying them over
	 */
	list_for_each_entry(nsh, &newstripes, lru) {
		spin_lock_irq(&conf->device_lock);
		wait_event_lock_irq(conf->wait_for_stripe,
				    !list_empty(&conf->inactive_list),
				    conf->device_lock,
1026
				    unplug_slaves(conf->mddev)
1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
			);
		osh = get_free_stripe(conf);
		spin_unlock_irq(&conf->device_lock);
		atomic_set(&nsh->count, 1);
		for(i=0; i<conf->pool_size; i++)
			nsh->dev[i].page = osh->dev[i].page;
		for( ; i<newsize; i++)
			nsh->dev[i].page = NULL;
		kmem_cache_free(conf->slab_cache, osh);
	}
	kmem_cache_destroy(conf->slab_cache);

	/* Step 3.
	 * At this point, we are holding all the stripes so the array
	 * is completely stalled, so now is a good time to resize
	 * conf->disks.
	 */
	ndisks = kzalloc(newsize * sizeof(struct disk_info), GFP_NOIO);
	if (ndisks) {
		for (i=0; i<conf->raid_disks; i++)
			ndisks[i] = conf->disks[i];
		kfree(conf->disks);
		conf->disks = ndisks;
	} else
		err = -ENOMEM;

	/* Step 4, return new stripes to service */
	while(!list_empty(&newstripes)) {
		nsh = list_entry(newstripes.next, struct stripe_head, lru);
		list_del_init(&nsh->lru);
		for (i=conf->raid_disks; i < newsize; i++)
			if (nsh->dev[i].page == NULL) {
				struct page *p = alloc_page(GFP_NOIO);
				nsh->dev[i].page = p;
				if (!p)
					err = -ENOMEM;
			}
		release_stripe(nsh);
	}
	/* critical section pass, GFP_NOIO no longer needed */

	conf->slab_cache = sc;
	conf->active_name = 1-conf->active_name;
	conf->pool_size = newsize;
	return err;
}
1073
#endif
L
Linus Torvalds 已提交
1074

1075
static int drop_one_stripe(raid5_conf_t *conf)
L
Linus Torvalds 已提交
1076 1077 1078
{
	struct stripe_head *sh;

1079 1080 1081 1082 1083
	spin_lock_irq(&conf->device_lock);
	sh = get_free_stripe(conf);
	spin_unlock_irq(&conf->device_lock);
	if (!sh)
		return 0;
1084
	BUG_ON(atomic_read(&sh->count));
1085
	shrink_buffers(sh, conf->pool_size);
1086 1087 1088 1089 1090 1091 1092 1093 1094 1095
	kmem_cache_free(conf->slab_cache, sh);
	atomic_dec(&conf->active_stripes);
	return 1;
}

static void shrink_stripes(raid5_conf_t *conf)
{
	while (drop_one_stripe(conf))
		;

N
NeilBrown 已提交
1096 1097
	if (conf->slab_cache)
		kmem_cache_destroy(conf->slab_cache);
L
Linus Torvalds 已提交
1098 1099 1100
	conf->slab_cache = NULL;
}

1101
static void raid5_end_read_request(struct bio * bi, int error)
L
Linus Torvalds 已提交
1102 1103 1104
{
 	struct stripe_head *sh = bi->bi_private;
	raid5_conf_t *conf = sh->raid_conf;
1105
	int disks = sh->disks, i;
L
Linus Torvalds 已提交
1106
	int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
1107 1108
	char b[BDEVNAME_SIZE];
	mdk_rdev_t *rdev;
L
Linus Torvalds 已提交
1109 1110 1111 1112 1113 1114


	for (i=0 ; i<disks; i++)
		if (bi == &sh->dev[i].req)
			break;

1115 1116
	pr_debug("end_read_request %llu/%d, count: %d, uptodate %d.\n",
		(unsigned long long)sh->sector, i, atomic_read(&sh->count),
L
Linus Torvalds 已提交
1117 1118 1119
		uptodate);
	if (i == disks) {
		BUG();
1120
		return;
L
Linus Torvalds 已提交
1121 1122 1123 1124
	}

	if (uptodate) {
		set_bit(R5_UPTODATE, &sh->dev[i].flags);
1125
		if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
1126
			rdev = conf->disks[i].rdev;
1127 1128 1129 1130 1131 1132
			printk_rl(KERN_INFO "raid5:%s: read error corrected"
				  " (%lu sectors at %llu on %s)\n",
				  mdname(conf->mddev), STRIPE_SECTORS,
				  (unsigned long long)(sh->sector
						       + rdev->data_offset),
				  bdevname(rdev->bdev, b));
1133 1134 1135
			clear_bit(R5_ReadError, &sh->dev[i].flags);
			clear_bit(R5_ReWrite, &sh->dev[i].flags);
		}
1136 1137
		if (atomic_read(&conf->disks[i].rdev->read_errors))
			atomic_set(&conf->disks[i].rdev->read_errors, 0);
L
Linus Torvalds 已提交
1138
	} else {
1139
		const char *bdn = bdevname(conf->disks[i].rdev->bdev, b);
1140
		int retry = 0;
1141 1142
		rdev = conf->disks[i].rdev;

L
Linus Torvalds 已提交
1143
		clear_bit(R5_UPTODATE, &sh->dev[i].flags);
1144
		atomic_inc(&rdev->read_errors);
1145
		if (conf->mddev->degraded)
1146 1147 1148 1149 1150 1151 1152
			printk_rl(KERN_WARNING
				  "raid5:%s: read error not correctable "
				  "(sector %llu on %s).\n",
				  mdname(conf->mddev),
				  (unsigned long long)(sh->sector
						       + rdev->data_offset),
				  bdn);
1153
		else if (test_bit(R5_ReWrite, &sh->dev[i].flags))
1154
			/* Oh, no!!! */
1155 1156 1157 1158 1159 1160 1161
			printk_rl(KERN_WARNING
				  "raid5:%s: read error NOT corrected!! "
				  "(sector %llu on %s).\n",
				  mdname(conf->mddev),
				  (unsigned long long)(sh->sector
						       + rdev->data_offset),
				  bdn);
1162
		else if (atomic_read(&rdev->read_errors)
1163
			 > conf->max_nr_stripes)
N
NeilBrown 已提交
1164
			printk(KERN_WARNING
1165 1166
			       "raid5:%s: Too many read errors, failing device %s.\n",
			       mdname(conf->mddev), bdn);
1167 1168 1169 1170 1171
		else
			retry = 1;
		if (retry)
			set_bit(R5_ReadError, &sh->dev[i].flags);
		else {
1172 1173
			clear_bit(R5_ReadError, &sh->dev[i].flags);
			clear_bit(R5_ReWrite, &sh->dev[i].flags);
1174
			md_error(conf->mddev, rdev);
1175
		}
L
Linus Torvalds 已提交
1176 1177 1178 1179 1180 1181 1182
	}
	rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
	clear_bit(R5_LOCKED, &sh->dev[i].flags);
	set_bit(STRIPE_HANDLE, &sh->state);
	release_stripe(sh);
}

1183
static void raid5_end_write_request(struct bio *bi, int error)
L
Linus Torvalds 已提交
1184 1185 1186
{
 	struct stripe_head *sh = bi->bi_private;
	raid5_conf_t *conf = sh->raid_conf;
1187
	int disks = sh->disks, i;
L
Linus Torvalds 已提交
1188 1189 1190 1191 1192 1193
	int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);

	for (i=0 ; i<disks; i++)
		if (bi == &sh->dev[i].req)
			break;

1194
	pr_debug("end_write_request %llu/%d, count %d, uptodate: %d.\n",
L
Linus Torvalds 已提交
1195 1196 1197 1198
		(unsigned long long)sh->sector, i, atomic_read(&sh->count),
		uptodate);
	if (i == disks) {
		BUG();
1199
		return;
L
Linus Torvalds 已提交
1200 1201 1202 1203 1204 1205 1206 1207 1208
	}

	if (!uptodate)
		md_error(conf->mddev, conf->disks[i].rdev);

	rdev_dec_pending(conf->disks[i].rdev, conf->mddev);
	
	clear_bit(R5_LOCKED, &sh->dev[i].flags);
	set_bit(STRIPE_HANDLE, &sh->state);
1209
	release_stripe(sh);
L
Linus Torvalds 已提交
1210 1211 1212 1213 1214
}


static sector_t compute_blocknr(struct stripe_head *sh, int i);
	
1215
static void raid5_build_block(struct stripe_head *sh, int i)
L
Linus Torvalds 已提交
1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230
{
	struct r5dev *dev = &sh->dev[i];

	bio_init(&dev->req);
	dev->req.bi_io_vec = &dev->vec;
	dev->req.bi_vcnt++;
	dev->req.bi_max_vecs++;
	dev->vec.bv_page = dev->page;
	dev->vec.bv_len = STRIPE_SIZE;
	dev->vec.bv_offset = 0;

	dev->req.bi_sector = sh->sector;
	dev->req.bi_private = sh;

	dev->flags = 0;
1231
	dev->sector = compute_blocknr(sh, i);
L
Linus Torvalds 已提交
1232 1233 1234 1235 1236 1237
}

static void error(mddev_t *mddev, mdk_rdev_t *rdev)
{
	char b[BDEVNAME_SIZE];
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
1238
	pr_debug("raid5: error called\n");
L
Linus Torvalds 已提交
1239

1240
	if (!test_bit(Faulty, &rdev->flags)) {
1241
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
1242 1243 1244
		if (test_and_clear_bit(In_sync, &rdev->flags)) {
			unsigned long flags;
			spin_lock_irqsave(&conf->device_lock, flags);
L
Linus Torvalds 已提交
1245
			mddev->degraded++;
1246
			spin_unlock_irqrestore(&conf->device_lock, flags);
L
Linus Torvalds 已提交
1247 1248 1249
			/*
			 * if recovery was running, make sure it aborts.
			 */
1250
			set_bit(MD_RECOVERY_INTR, &mddev->recovery);
L
Linus Torvalds 已提交
1251
		}
1252
		set_bit(Faulty, &rdev->flags);
1253 1254 1255 1256
		printk(KERN_ALERT
		       "raid5: Disk failure on %s, disabling device.\n"
		       "raid5: Operation continuing on %d devices.\n",
		       bdevname(rdev->bdev,b), conf->raid_disks - mddev->degraded);
L
Linus Torvalds 已提交
1257
	}
1258
}
L
Linus Torvalds 已提交
1259 1260 1261 1262 1263

/*
 * Input: a 'big' sector number,
 * Output: index of the data and parity disk, and the sector # in them.
 */
1264 1265
static sector_t raid5_compute_sector(raid5_conf_t *conf, sector_t r_sector,
				     int previous,
1266
				     int *dd_idx, int *pd_idx, int *qd_idx)
L
Linus Torvalds 已提交
1267 1268 1269 1270 1271 1272
{
	long stripe;
	unsigned long chunk_number;
	unsigned int chunk_offset;
	sector_t new_sector;
	int sectors_per_chunk = conf->chunk_size >> 9;
1273 1274 1275
	int raid_disks = previous ? conf->previous_raid_disks
				  : conf->raid_disks;
	int data_disks = raid_disks - conf->max_degraded;
L
Linus Torvalds 已提交
1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298

	/* First compute the information on this sector */

	/*
	 * Compute the chunk number and the sector offset inside the chunk
	 */
	chunk_offset = sector_div(r_sector, sectors_per_chunk);
	chunk_number = r_sector;
	BUG_ON(r_sector != chunk_number);

	/*
	 * Compute the stripe number
	 */
	stripe = chunk_number / data_disks;

	/*
	 * Compute the data disk and parity disk indexes inside the stripe
	 */
	*dd_idx = chunk_number % data_disks;

	/*
	 * Select the parity disk based on the user selected algorithm.
	 */
1299
	*qd_idx = ~0;
1300 1301
	switch(conf->level) {
	case 4:
L
Linus Torvalds 已提交
1302
		*pd_idx = data_disks;
1303 1304 1305
		break;
	case 5:
		switch (conf->algorithm) {
L
Linus Torvalds 已提交
1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324
		case ALGORITHM_LEFT_ASYMMETRIC:
			*pd_idx = data_disks - stripe % raid_disks;
			if (*dd_idx >= *pd_idx)
				(*dd_idx)++;
			break;
		case ALGORITHM_RIGHT_ASYMMETRIC:
			*pd_idx = stripe % raid_disks;
			if (*dd_idx >= *pd_idx)
				(*dd_idx)++;
			break;
		case ALGORITHM_LEFT_SYMMETRIC:
			*pd_idx = data_disks - stripe % raid_disks;
			*dd_idx = (*pd_idx + 1 + *dd_idx) % raid_disks;
			break;
		case ALGORITHM_RIGHT_SYMMETRIC:
			*pd_idx = stripe % raid_disks;
			*dd_idx = (*pd_idx + 1 + *dd_idx) % raid_disks;
			break;
		default:
N
NeilBrown 已提交
1325
			printk(KERN_ERR "raid5: unsupported algorithm %d\n",
L
Linus Torvalds 已提交
1326
				conf->algorithm);
1327 1328 1329 1330 1331 1332 1333 1334
		}
		break;
	case 6:

		/**** FIX THIS ****/
		switch (conf->algorithm) {
		case ALGORITHM_LEFT_ASYMMETRIC:
			*pd_idx = raid_disks - 1 - (stripe % raid_disks);
1335 1336
			*qd_idx = *pd_idx + 1;
			if (*pd_idx == raid_disks-1) {
1337
				(*dd_idx)++; 	/* Q D D D P */
1338 1339
				*qd_idx = 0;
			} else if (*dd_idx >= *pd_idx)
1340 1341 1342 1343
				(*dd_idx) += 2; /* D D P Q D */
			break;
		case ALGORITHM_RIGHT_ASYMMETRIC:
			*pd_idx = stripe % raid_disks;
1344 1345
			*qd_idx = *pd_idx + 1;
			if (*pd_idx == raid_disks-1) {
1346
				(*dd_idx)++; 	/* Q D D D P */
1347 1348
				*qd_idx = 0;
			} else if (*dd_idx >= *pd_idx)
1349 1350 1351 1352
				(*dd_idx) += 2; /* D D P Q D */
			break;
		case ALGORITHM_LEFT_SYMMETRIC:
			*pd_idx = raid_disks - 1 - (stripe % raid_disks);
1353
			*qd_idx = (*pd_idx + 1) % raid_disks;
1354 1355 1356 1357
			*dd_idx = (*pd_idx + 2 + *dd_idx) % raid_disks;
			break;
		case ALGORITHM_RIGHT_SYMMETRIC:
			*pd_idx = stripe % raid_disks;
1358
			*qd_idx = (*pd_idx + 1) % raid_disks;
1359 1360 1361
			*dd_idx = (*pd_idx + 2 + *dd_idx) % raid_disks;
			break;
		default:
1362 1363
			printk(KERN_CRIT "raid6: unsupported algorithm %d\n",
			       conf->algorithm);
1364 1365
		}
		break;
L
Linus Torvalds 已提交
1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378
	}

	/*
	 * Finally, compute the new sector number
	 */
	new_sector = (sector_t)stripe * sectors_per_chunk + chunk_offset;
	return new_sector;
}


static sector_t compute_blocknr(struct stripe_head *sh, int i)
{
	raid5_conf_t *conf = sh->raid_conf;
1379 1380
	int raid_disks = sh->disks;
	int data_disks = raid_disks - conf->max_degraded;
L
Linus Torvalds 已提交
1381 1382 1383 1384
	sector_t new_sector = sh->sector, check;
	int sectors_per_chunk = conf->chunk_size >> 9;
	sector_t stripe;
	int chunk_offset;
1385
	int chunk_number, dummy1, dummy2, dummy3, dd_idx = i;
L
Linus Torvalds 已提交
1386 1387
	sector_t r_sector;

1388

L
Linus Torvalds 已提交
1389 1390 1391 1392
	chunk_offset = sector_div(new_sector, sectors_per_chunk);
	stripe = new_sector;
	BUG_ON(new_sector != stripe);

1393 1394 1395 1396 1397 1398
	if (i == sh->pd_idx)
		return 0;
	switch(conf->level) {
	case 4: break;
	case 5:
		switch (conf->algorithm) {
L
Linus Torvalds 已提交
1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410
		case ALGORITHM_LEFT_ASYMMETRIC:
		case ALGORITHM_RIGHT_ASYMMETRIC:
			if (i > sh->pd_idx)
				i--;
			break;
		case ALGORITHM_LEFT_SYMMETRIC:
		case ALGORITHM_RIGHT_SYMMETRIC:
			if (i < sh->pd_idx)
				i += raid_disks;
			i -= (sh->pd_idx + 1);
			break;
		default:
N
NeilBrown 已提交
1411
			printk(KERN_ERR "raid5: unsupported algorithm %d\n",
1412 1413 1414 1415
			       conf->algorithm);
		}
		break;
	case 6:
1416
		if (i == sh->qd_idx)
1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437
			return 0; /* It is the Q disk */
		switch (conf->algorithm) {
		case ALGORITHM_LEFT_ASYMMETRIC:
		case ALGORITHM_RIGHT_ASYMMETRIC:
		  	if (sh->pd_idx == raid_disks-1)
				i--; 	/* Q D D D P */
			else if (i > sh->pd_idx)
				i -= 2; /* D D P Q D */
			break;
		case ALGORITHM_LEFT_SYMMETRIC:
		case ALGORITHM_RIGHT_SYMMETRIC:
			if (sh->pd_idx == raid_disks-1)
				i--; /* Q D D D P */
			else {
				/* D D P Q D */
				if (i < sh->pd_idx)
					i += raid_disks;
				i -= (sh->pd_idx + 2);
			}
			break;
		default:
1438 1439
			printk(KERN_CRIT "raid6: unsupported algorithm %d\n",
			       conf->algorithm);
1440 1441
		}
		break;
L
Linus Torvalds 已提交
1442 1443 1444 1445 1446
	}

	chunk_number = stripe * data_disks + i;
	r_sector = (sector_t)chunk_number * sectors_per_chunk + chunk_offset;

1447 1448
	check = raid5_compute_sector(conf, r_sector,
				     (raid_disks != conf->raid_disks),
1449
				     &dummy1, &dummy2, &dummy3);
L
Linus Torvalds 已提交
1450
	if (check != sh->sector || dummy1 != dd_idx || dummy2 != sh->pd_idx) {
N
NeilBrown 已提交
1451
		printk(KERN_ERR "compute_blocknr: map not correct\n");
L
Linus Torvalds 已提交
1452 1453 1454 1455 1456 1457 1458 1459
		return 0;
	}
	return r_sector;
}



/*
1460 1461 1462 1463 1464
 * Copy data between a page in the stripe cache, and one or more bion
 * The page could align with the middle of the bio, or there could be
 * several bion, each with several bio_vecs, which cover part of the page
 * Multiple bion are linked together on bi_next.  There may be extras
 * at the end of this list.  We ignore them.
L
Linus Torvalds 已提交
1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492
 */
static void copy_data(int frombio, struct bio *bio,
		     struct page *page,
		     sector_t sector)
{
	char *pa = page_address(page);
	struct bio_vec *bvl;
	int i;
	int page_offset;

	if (bio->bi_sector >= sector)
		page_offset = (signed)(bio->bi_sector - sector) * 512;
	else
		page_offset = (signed)(sector - bio->bi_sector) * -512;
	bio_for_each_segment(bvl, bio, i) {
		int len = bio_iovec_idx(bio,i)->bv_len;
		int clen;
		int b_offset = 0;

		if (page_offset < 0) {
			b_offset = -page_offset;
			page_offset += b_offset;
			len -= b_offset;
		}

		if (len > 0 && page_offset + len > STRIPE_SIZE)
			clen = STRIPE_SIZE - page_offset;
		else clen = len;
1493

L
Linus Torvalds 已提交
1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
		if (clen > 0) {
			char *ba = __bio_kmap_atomic(bio, i, KM_USER0);
			if (frombio)
				memcpy(pa+page_offset, ba+b_offset, clen);
			else
				memcpy(ba+b_offset, pa+page_offset, clen);
			__bio_kunmap_atomic(ba, KM_USER0);
		}
		if (clen < len) /* hit end of page */
			break;
		page_offset +=  len;
	}
}

D
Dan Williams 已提交
1508 1509 1510 1511 1512
#define check_xor()	do {						  \
				if (count == MAX_XOR_BLOCKS) {		  \
				xor_blocks(count, STRIPE_SIZE, dest, ptr);\
				count = 0;				  \
			   }						  \
L
Linus Torvalds 已提交
1513 1514
			} while(0)

1515 1516
static void compute_parity6(struct stripe_head *sh, int method)
{
1517
	raid5_conf_t *conf = sh->raid_conf;
1518
	int i, pd_idx, qd_idx, d0_idx, disks = sh->disks, count;
1519 1520 1521 1522
	struct bio *chosen;
	/**** FIX THIS: This could be very bad if disks is close to 256 ****/
	void *ptrs[disks];

1523 1524 1525
	pd_idx = sh->pd_idx;
	qd_idx = sh->qd_idx;
	d0_idx = raid6_d0(sh);
1526

1527
	pr_debug("compute_parity, stripe %llu, method %d\n",
1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541
		(unsigned long long)sh->sector, method);

	switch(method) {
	case READ_MODIFY_WRITE:
		BUG();		/* READ_MODIFY_WRITE N/A for RAID-6 */
	case RECONSTRUCT_WRITE:
		for (i= disks; i-- ;)
			if ( i != pd_idx && i != qd_idx && sh->dev[i].towrite ) {
				chosen = sh->dev[i].towrite;
				sh->dev[i].towrite = NULL;

				if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
					wake_up(&conf->wait_for_overlap);

E
Eric Sesterhenn 已提交
1542
				BUG_ON(sh->dev[i].written);
1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562
				sh->dev[i].written = chosen;
			}
		break;
	case CHECK_PARITY:
		BUG();		/* Not implemented yet */
	}

	for (i = disks; i--;)
		if (sh->dev[i].written) {
			sector_t sector = sh->dev[i].sector;
			struct bio *wbi = sh->dev[i].written;
			while (wbi && wbi->bi_sector < sector + STRIPE_SECTORS) {
				copy_data(1, wbi, sh->dev[i].page, sector);
				wbi = r5_next_bio(wbi, sector);
			}

			set_bit(R5_LOCKED, &sh->dev[i].flags);
			set_bit(R5_UPTODATE, &sh->dev[i].flags);
		}

1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578
	/* Note that unlike RAID-5, the ordering of the disks matters greatly.*/
	/* FIX: Is this ordering of drives even remotely optimal? */
	count = 0;
	i = d0_idx;
	do {
		int slot = raid6_idx_to_slot(i, sh, &count);
		ptrs[slot] = page_address(sh->dev[i].page);
		if (slot < sh->disks - 2 &&
		    !test_bit(R5_UPTODATE, &sh->dev[i].flags)) {
			printk(KERN_ERR "block %d/%d not uptodate "
			       "on parity calc\n", i, count);
			BUG();
		}
		i = raid6_next_disk(i, disks);
	} while (i != d0_idx);
	BUG_ON(count+2 != disks);
1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599

	raid6_call.gen_syndrome(disks, STRIPE_SIZE, ptrs);

	switch(method) {
	case RECONSTRUCT_WRITE:
		set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
		set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
		set_bit(R5_LOCKED,   &sh->dev[pd_idx].flags);
		set_bit(R5_LOCKED,   &sh->dev[qd_idx].flags);
		break;
	case UPDATE_PARITY:
		set_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
		set_bit(R5_UPTODATE, &sh->dev[qd_idx].flags);
		break;
	}
}


/* Compute one missing block */
static void compute_block_1(struct stripe_head *sh, int dd_idx, int nozero)
{
1600
	int i, count, disks = sh->disks;
D
Dan Williams 已提交
1601
	void *ptr[MAX_XOR_BLOCKS], *dest, *p;
1602
	int qd_idx = sh->qd_idx;
1603

1604
	pr_debug("compute_block_1, stripe %llu, idx %d\n",
1605 1606 1607 1608 1609 1610
		(unsigned long long)sh->sector, dd_idx);

	if ( dd_idx == qd_idx ) {
		/* We're actually computing the Q drive */
		compute_parity6(sh, UPDATE_PARITY);
	} else {
D
Dan Williams 已提交
1611 1612 1613
		dest = page_address(sh->dev[dd_idx].page);
		if (!nozero) memset(dest, 0, STRIPE_SIZE);
		count = 0;
1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626
		for (i = disks ; i--; ) {
			if (i == dd_idx || i == qd_idx)
				continue;
			p = page_address(sh->dev[i].page);
			if (test_bit(R5_UPTODATE, &sh->dev[i].flags))
				ptr[count++] = p;
			else
				printk("compute_block() %d, stripe %llu, %d"
				       " not present\n", dd_idx,
				       (unsigned long long)sh->sector, i);

			check_xor();
		}
D
Dan Williams 已提交
1627 1628
		if (count)
			xor_blocks(count, STRIPE_SIZE, dest, ptr);
1629 1630 1631 1632 1633 1634 1635 1636
		if (!nozero) set_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
		else clear_bit(R5_UPTODATE, &sh->dev[dd_idx].flags);
	}
}

/* Compute two missing blocks */
static void compute_block_2(struct stripe_head *sh, int dd_idx1, int dd_idx2)
{
1637
	int i, count, disks = sh->disks;
1638 1639 1640 1641
	int d0_idx = raid6_d0(sh);
	int faila = -1, failb = -1;
	/**** FIX THIS: This could be very bad if disks is close to 256 ****/
	void *ptrs[disks];
1642

1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655
	count = 0;
	i = d0_idx;
	do {
		int slot;
		slot = raid6_idx_to_slot(i, sh, &count);
		ptrs[slot] = page_address(sh->dev[i].page);
		if (i == dd_idx1)
			faila = slot;
		if (i == dd_idx2)
			failb = slot;
		i = raid6_next_disk(i, disks);
	} while (i != d0_idx);
	BUG_ON(count+2 != disks);
1656 1657 1658 1659

	BUG_ON(faila == failb);
	if ( failb < faila ) { int tmp = faila; faila = failb; failb = tmp; }

1660
	pr_debug("compute_block_2, stripe %llu, idx %d,%d (%d,%d)\n",
1661 1662
		 (unsigned long long)sh->sector, dd_idx1, dd_idx2,
		 faila, failb);
1663 1664 1665 1666 1667 1668 1669 1670 1671

	if ( failb == disks-1 ) {
		/* Q disk is one of the missing disks */
		if ( faila == disks-2 ) {
			/* Missing P+Q, just recompute */
			compute_parity6(sh, UPDATE_PARITY);
			return;
		} else {
			/* We're missing D+Q; recompute D from P */
1672 1673 1674
			compute_block_1(sh, ((dd_idx1 == sh->qd_idx) ?
					     dd_idx2 : dd_idx1),
					0);
1675 1676 1677 1678 1679
			compute_parity6(sh, UPDATE_PARITY); /* Is this necessary? */
			return;
		}
	}

1680 1681 1682 1683 1684 1685 1686
	/* We're missing D+P or D+D; */
	if (failb == disks-2) {
		/* We're missing D+P. */
		raid6_datap_recov(disks, STRIPE_SIZE, faila, ptrs);
	} else {
		/* We're missing D+D. */
		raid6_2data_recov(disks, STRIPE_SIZE, faila, failb, ptrs);
1687
	}
1688 1689 1690 1691

	/* Both the above update both missing blocks */
	set_bit(R5_UPTODATE, &sh->dev[dd_idx1].flags);
	set_bit(R5_UPTODATE, &sh->dev[dd_idx2].flags);
1692 1693
}

1694
static void
1695
schedule_reconstruction5(struct stripe_head *sh, struct stripe_head_state *s,
1696
			 int rcw, int expand)
1697 1698 1699 1700 1701 1702 1703 1704 1705
{
	int i, pd_idx = sh->pd_idx, disks = sh->disks;

	if (rcw) {
		/* if we are not expanding this is a proper write request, and
		 * there will be bios with new data to be drained into the
		 * stripe cache
		 */
		if (!expand) {
1706 1707 1708 1709
			sh->reconstruct_state = reconstruct_state_drain_run;
			set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
		} else
			sh->reconstruct_state = reconstruct_state_run;
1710

1711
		set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1712 1713 1714 1715 1716 1717

		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];

			if (dev->towrite) {
				set_bit(R5_LOCKED, &dev->flags);
1718
				set_bit(R5_Wantdrain, &dev->flags);
1719 1720
				if (!expand)
					clear_bit(R5_UPTODATE, &dev->flags);
1721
				s->locked++;
1722 1723
			}
		}
1724
		if (s->locked + 1 == disks)
1725 1726
			if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
				atomic_inc(&sh->raid_conf->pending_full_writes);
1727 1728 1729 1730
	} else {
		BUG_ON(!(test_bit(R5_UPTODATE, &sh->dev[pd_idx].flags) ||
			test_bit(R5_Wantcompute, &sh->dev[pd_idx].flags)));

1731
		sh->reconstruct_state = reconstruct_state_prexor_drain_run;
1732 1733 1734
		set_bit(STRIPE_OP_PREXOR, &s->ops_request);
		set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
		set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1735 1736 1737 1738 1739 1740 1741 1742

		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (i == pd_idx)
				continue;

			if (dev->towrite &&
			    (test_bit(R5_UPTODATE, &dev->flags) ||
1743 1744
			     test_bit(R5_Wantcompute, &dev->flags))) {
				set_bit(R5_Wantdrain, &dev->flags);
1745 1746
				set_bit(R5_LOCKED, &dev->flags);
				clear_bit(R5_UPTODATE, &dev->flags);
1747
				s->locked++;
1748 1749 1750 1751 1752 1753 1754 1755 1756
			}
		}
	}

	/* keep the parity disk locked while asynchronous operations
	 * are in flight
	 */
	set_bit(R5_LOCKED, &sh->dev[pd_idx].flags);
	clear_bit(R5_UPTODATE, &sh->dev[pd_idx].flags);
1757
	s->locked++;
1758

1759
	pr_debug("%s: stripe %llu locked: %d ops_request: %lx\n",
1760
		__func__, (unsigned long long)sh->sector,
1761
		s->locked, s->ops_request);
1762
}
1763

L
Linus Torvalds 已提交
1764 1765
/*
 * Each stripe/dev can have one or more bion attached.
1766
 * toread/towrite point to the first in a chain.
L
Linus Torvalds 已提交
1767 1768 1769 1770 1771 1772
 * The bi_next chain must be in order.
 */
static int add_stripe_bio(struct stripe_head *sh, struct bio *bi, int dd_idx, int forwrite)
{
	struct bio **bip;
	raid5_conf_t *conf = sh->raid_conf;
1773
	int firstwrite=0;
L
Linus Torvalds 已提交
1774

1775
	pr_debug("adding bh b#%llu to stripe s#%llu\n",
L
Linus Torvalds 已提交
1776 1777 1778 1779 1780 1781
		(unsigned long long)bi->bi_sector,
		(unsigned long long)sh->sector);


	spin_lock(&sh->lock);
	spin_lock_irq(&conf->device_lock);
1782
	if (forwrite) {
L
Linus Torvalds 已提交
1783
		bip = &sh->dev[dd_idx].towrite;
1784 1785 1786
		if (*bip == NULL && sh->dev[dd_idx].written == NULL)
			firstwrite = 1;
	} else
L
Linus Torvalds 已提交
1787 1788 1789 1790 1791 1792 1793 1794 1795
		bip = &sh->dev[dd_idx].toread;
	while (*bip && (*bip)->bi_sector < bi->bi_sector) {
		if ((*bip)->bi_sector + ((*bip)->bi_size >> 9) > bi->bi_sector)
			goto overlap;
		bip = & (*bip)->bi_next;
	}
	if (*bip && (*bip)->bi_sector < bi->bi_sector + ((bi->bi_size)>>9))
		goto overlap;

1796
	BUG_ON(*bip && bi->bi_next && (*bip) != bi->bi_next);
L
Linus Torvalds 已提交
1797 1798 1799
	if (*bip)
		bi->bi_next = *bip;
	*bip = bi;
1800
	bi->bi_phys_segments++;
L
Linus Torvalds 已提交
1801 1802 1803
	spin_unlock_irq(&conf->device_lock);
	spin_unlock(&sh->lock);

1804
	pr_debug("added bi b#%llu to stripe s#%llu, disk %d.\n",
L
Linus Torvalds 已提交
1805 1806 1807
		(unsigned long long)bi->bi_sector,
		(unsigned long long)sh->sector, dd_idx);

1808 1809 1810
	if (conf->mddev->bitmap && firstwrite) {
		bitmap_startwrite(conf->mddev->bitmap, sh->sector,
				  STRIPE_SECTORS, 0);
1811
		sh->bm_seq = conf->seq_flush+1;
1812 1813 1814
		set_bit(STRIPE_BIT_DELAY, &sh->state);
	}

L
Linus Torvalds 已提交
1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836
	if (forwrite) {
		/* check if page is covered */
		sector_t sector = sh->dev[dd_idx].sector;
		for (bi=sh->dev[dd_idx].towrite;
		     sector < sh->dev[dd_idx].sector + STRIPE_SECTORS &&
			     bi && bi->bi_sector <= sector;
		     bi = r5_next_bio(bi, sh->dev[dd_idx].sector)) {
			if (bi->bi_sector + (bi->bi_size>>9) >= sector)
				sector = bi->bi_sector + (bi->bi_size>>9);
		}
		if (sector >= sh->dev[dd_idx].sector + STRIPE_SECTORS)
			set_bit(R5_OVERWRITE, &sh->dev[dd_idx].flags);
	}
	return 1;

 overlap:
	set_bit(R5_Overlap, &sh->dev[dd_idx].flags);
	spin_unlock_irq(&conf->device_lock);
	spin_unlock(&sh->lock);
	return 0;
}

1837 1838
static void end_reshape(raid5_conf_t *conf);

1839 1840 1841 1842 1843 1844 1845
static int page_is_zero(struct page *p)
{
	char *a = page_address(p);
	return ((*(u32*)a) == 0 &&
		memcmp(a, a+4, STRIPE_SIZE-4)==0);
}

1846 1847
static int stripe_to_pdidx(sector_t stripe, raid5_conf_t *conf, int previous,
			   int *qd_idxp)
1848 1849 1850
{
	int sectors_per_chunk = conf->chunk_size >> 9;
	int pd_idx, dd_idx;
1851
	int chunk_offset = sector_div(stripe, sectors_per_chunk);
1852
	int disks = previous ? conf->previous_raid_disks : conf->raid_disks;
1853

1854 1855
	raid5_compute_sector(conf,
			     stripe * (disks - conf->max_degraded)
1856
			     *sectors_per_chunk + chunk_offset,
1857
			     previous,
1858
			     &dd_idx, &pd_idx, qd_idxp);
1859 1860 1861
	return pd_idx;
}

1862
static void
1863
handle_failed_stripe(raid5_conf_t *conf, struct stripe_head *sh,
1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896
				struct stripe_head_state *s, int disks,
				struct bio **return_bi)
{
	int i;
	for (i = disks; i--; ) {
		struct bio *bi;
		int bitmap_end = 0;

		if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
			mdk_rdev_t *rdev;
			rcu_read_lock();
			rdev = rcu_dereference(conf->disks[i].rdev);
			if (rdev && test_bit(In_sync, &rdev->flags))
				/* multiple read failures in one stripe */
				md_error(conf->mddev, rdev);
			rcu_read_unlock();
		}
		spin_lock_irq(&conf->device_lock);
		/* fail all writes first */
		bi = sh->dev[i].towrite;
		sh->dev[i].towrite = NULL;
		if (bi) {
			s->to_write--;
			bitmap_end = 1;
		}

		if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
			wake_up(&conf->wait_for_overlap);

		while (bi && bi->bi_sector <
			sh->dev[i].sector + STRIPE_SECTORS) {
			struct bio *nextbi = r5_next_bio(bi, sh->dev[i].sector);
			clear_bit(BIO_UPTODATE, &bi->bi_flags);
1897
			if (!raid5_dec_bi_phys_segments(bi)) {
1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911
				md_write_end(conf->mddev);
				bi->bi_next = *return_bi;
				*return_bi = bi;
			}
			bi = nextbi;
		}
		/* and fail all 'written' */
		bi = sh->dev[i].written;
		sh->dev[i].written = NULL;
		if (bi) bitmap_end = 1;
		while (bi && bi->bi_sector <
		       sh->dev[i].sector + STRIPE_SECTORS) {
			struct bio *bi2 = r5_next_bio(bi, sh->dev[i].sector);
			clear_bit(BIO_UPTODATE, &bi->bi_flags);
1912
			if (!raid5_dec_bi_phys_segments(bi)) {
1913 1914 1915 1916 1917 1918 1919
				md_write_end(conf->mddev);
				bi->bi_next = *return_bi;
				*return_bi = bi;
			}
			bi = bi2;
		}

1920 1921 1922 1923 1924 1925
		/* fail any reads if this device is non-operational and
		 * the data has not reached the cache yet.
		 */
		if (!test_bit(R5_Wantfill, &sh->dev[i].flags) &&
		    (!test_bit(R5_Insync, &sh->dev[i].flags) ||
		      test_bit(R5_ReadError, &sh->dev[i].flags))) {
1926 1927 1928 1929 1930 1931 1932 1933 1934 1935
			bi = sh->dev[i].toread;
			sh->dev[i].toread = NULL;
			if (test_and_clear_bit(R5_Overlap, &sh->dev[i].flags))
				wake_up(&conf->wait_for_overlap);
			if (bi) s->to_read--;
			while (bi && bi->bi_sector <
			       sh->dev[i].sector + STRIPE_SECTORS) {
				struct bio *nextbi =
					r5_next_bio(bi, sh->dev[i].sector);
				clear_bit(BIO_UPTODATE, &bi->bi_flags);
1936
				if (!raid5_dec_bi_phys_segments(bi)) {
1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948
					bi->bi_next = *return_bi;
					*return_bi = bi;
				}
				bi = nextbi;
			}
		}
		spin_unlock_irq(&conf->device_lock);
		if (bitmap_end)
			bitmap_endwrite(conf->mddev->bitmap, sh->sector,
					STRIPE_SECTORS, 0, 0);
	}

1949 1950 1951
	if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
		if (atomic_dec_and_test(&conf->pending_full_writes))
			md_wakeup_thread(conf->mddev->thread);
1952 1953
}

1954 1955 1956 1957 1958
/* fetch_block5 - checks the given member device to see if its data needs
 * to be read or computed to satisfy a request.
 *
 * Returns 1 when no more member devices need to be checked, otherwise returns
 * 0 to tell the loop in handle_stripe_fill5 to continue
1959
 */
1960 1961
static int fetch_block5(struct stripe_head *sh, struct stripe_head_state *s,
			int disk_idx, int disks)
1962 1963 1964 1965 1966 1967
{
	struct r5dev *dev = &sh->dev[disk_idx];
	struct r5dev *failed_dev = &sh->dev[s->failed_num];

	/* is the data in this block needed, and can we get it? */
	if (!test_bit(R5_LOCKED, &dev->flags) &&
1968 1969 1970 1971 1972 1973 1974 1975
	    !test_bit(R5_UPTODATE, &dev->flags) &&
	    (dev->toread ||
	     (dev->towrite && !test_bit(R5_OVERWRITE, &dev->flags)) ||
	     s->syncing || s->expanding ||
	     (s->failed &&
	      (failed_dev->toread ||
	       (failed_dev->towrite &&
		!test_bit(R5_OVERWRITE, &failed_dev->flags)))))) {
1976 1977
		/* We would like to get this block, possibly by computing it,
		 * otherwise read it if the backing disk is insync
1978 1979
		 */
		if ((s->uptodate == disks - 1) &&
1980
		    (s->failed && disk_idx == s->failed_num)) {
1981 1982
			set_bit(STRIPE_COMPUTE_RUN, &sh->state);
			set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
1983 1984 1985 1986 1987 1988 1989 1990 1991 1992
			set_bit(R5_Wantcompute, &dev->flags);
			sh->ops.target = disk_idx;
			s->req_compute = 1;
			/* Careful: from this point on 'uptodate' is in the eye
			 * of raid5_run_ops which services 'compute' operations
			 * before writes. R5_Wantcompute flags a block that will
			 * be R5_UPTODATE by the time it is needed for a
			 * subsequent operation.
			 */
			s->uptodate++;
1993
			return 1; /* uptodate + compute == disks */
1994
		} else if (test_bit(R5_Insync, &dev->flags)) {
1995 1996 1997 1998 1999 2000 2001 2002
			set_bit(R5_LOCKED, &dev->flags);
			set_bit(R5_Wantread, &dev->flags);
			s->locked++;
			pr_debug("Reading block %d (sync=%d)\n", disk_idx,
				s->syncing);
		}
	}

2003
	return 0;
2004 2005
}

2006 2007 2008 2009
/**
 * handle_stripe_fill5 - read or compute data to satisfy pending requests.
 */
static void handle_stripe_fill5(struct stripe_head *sh,
2010 2011 2012
			struct stripe_head_state *s, int disks)
{
	int i;
2013 2014 2015 2016 2017

	/* look for blocks to read/compute, skip this if a compute
	 * is already in flight, or if the stripe contents are in the
	 * midst of changing due to a write
	 */
2018
	if (!test_bit(STRIPE_COMPUTE_RUN, &sh->state) && !sh->check_state &&
2019
	    !sh->reconstruct_state)
2020
		for (i = disks; i--; )
2021
			if (fetch_block5(sh, s, i, disks))
2022
				break;
2023 2024 2025
	set_bit(STRIPE_HANDLE, &sh->state);
}

2026
static void handle_stripe_fill6(struct stripe_head *sh,
2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046
			struct stripe_head_state *s, struct r6_state *r6s,
			int disks)
{
	int i;
	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		if (!test_bit(R5_LOCKED, &dev->flags) &&
		    !test_bit(R5_UPTODATE, &dev->flags) &&
		    (dev->toread || (dev->towrite &&
		     !test_bit(R5_OVERWRITE, &dev->flags)) ||
		     s->syncing || s->expanding ||
		     (s->failed >= 1 &&
		      (sh->dev[r6s->failed_num[0]].toread ||
		       s->to_write)) ||
		     (s->failed >= 2 &&
		      (sh->dev[r6s->failed_num[1]].toread ||
		       s->to_write)))) {
			/* we would like to get this block, possibly
			 * by computing it, but we might not be able to
			 */
2047 2048 2049
			if ((s->uptodate == disks - 1) &&
			    (s->failed && (i == r6s->failed_num[0] ||
					   i == r6s->failed_num[1]))) {
2050
				pr_debug("Computing stripe %llu block %d\n",
2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066
				       (unsigned long long)sh->sector, i);
				compute_block_1(sh, i, 0);
				s->uptodate++;
			} else if ( s->uptodate == disks-2 && s->failed >= 2 ) {
				/* Computing 2-failure is *very* expensive; only
				 * do it if failed >= 2
				 */
				int other;
				for (other = disks; other--; ) {
					if (other == i)
						continue;
					if (!test_bit(R5_UPTODATE,
					      &sh->dev[other].flags))
						break;
				}
				BUG_ON(other < 0);
2067
				pr_debug("Computing stripe %llu blocks %d,%d\n",
2068 2069 2070 2071 2072 2073 2074 2075
				       (unsigned long long)sh->sector,
				       i, other);
				compute_block_2(sh, i, other);
				s->uptodate += 2;
			} else if (test_bit(R5_Insync, &dev->flags)) {
				set_bit(R5_LOCKED, &dev->flags);
				set_bit(R5_Wantread, &dev->flags);
				s->locked++;
2076
				pr_debug("Reading block %d (sync=%d)\n",
2077 2078 2079 2080 2081 2082 2083 2084
					i, s->syncing);
			}
		}
	}
	set_bit(STRIPE_HANDLE, &sh->state);
}


2085
/* handle_stripe_clean_event
2086 2087 2088 2089
 * any written block on an uptodate or failed drive can be returned.
 * Note that if we 'wrote' to a failed drive, it will be UPTODATE, but
 * never LOCKED, so we don't need to test 'failed' directly.
 */
2090
static void handle_stripe_clean_event(raid5_conf_t *conf,
2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103
	struct stripe_head *sh, int disks, struct bio **return_bi)
{
	int i;
	struct r5dev *dev;

	for (i = disks; i--; )
		if (sh->dev[i].written) {
			dev = &sh->dev[i];
			if (!test_bit(R5_LOCKED, &dev->flags) &&
				test_bit(R5_UPTODATE, &dev->flags)) {
				/* We can return any write requests */
				struct bio *wbi, *wbi2;
				int bitmap_end = 0;
2104
				pr_debug("Return write for disc %d\n", i);
2105 2106 2107 2108 2109 2110
				spin_lock_irq(&conf->device_lock);
				wbi = dev->written;
				dev->written = NULL;
				while (wbi && wbi->bi_sector <
					dev->sector + STRIPE_SECTORS) {
					wbi2 = r5_next_bio(wbi, dev->sector);
2111
					if (!raid5_dec_bi_phys_segments(wbi)) {
2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128
						md_write_end(conf->mddev);
						wbi->bi_next = *return_bi;
						*return_bi = wbi;
					}
					wbi = wbi2;
				}
				if (dev->towrite == NULL)
					bitmap_end = 1;
				spin_unlock_irq(&conf->device_lock);
				if (bitmap_end)
					bitmap_endwrite(conf->mddev->bitmap,
							sh->sector,
							STRIPE_SECTORS,
					 !test_bit(STRIPE_DEGRADED, &sh->state),
							0);
			}
		}
2129 2130 2131 2132

	if (test_and_clear_bit(STRIPE_FULL_WRITE, &sh->state))
		if (atomic_dec_and_test(&conf->pending_full_writes))
			md_wakeup_thread(conf->mddev->thread);
2133 2134
}

2135
static void handle_stripe_dirtying5(raid5_conf_t *conf,
2136 2137 2138 2139 2140 2141 2142 2143
		struct stripe_head *sh,	struct stripe_head_state *s, int disks)
{
	int rmw = 0, rcw = 0, i;
	for (i = disks; i--; ) {
		/* would I have to read this buffer for read_modify_write */
		struct r5dev *dev = &sh->dev[i];
		if ((dev->towrite || i == sh->pd_idx) &&
		    !test_bit(R5_LOCKED, &dev->flags) &&
2144 2145
		    !(test_bit(R5_UPTODATE, &dev->flags) ||
		      test_bit(R5_Wantcompute, &dev->flags))) {
2146 2147 2148 2149 2150 2151 2152 2153
			if (test_bit(R5_Insync, &dev->flags))
				rmw++;
			else
				rmw += 2*disks;  /* cannot read it */
		}
		/* Would I have to read this buffer for reconstruct_write */
		if (!test_bit(R5_OVERWRITE, &dev->flags) && i != sh->pd_idx &&
		    !test_bit(R5_LOCKED, &dev->flags) &&
2154 2155 2156
		    !(test_bit(R5_UPTODATE, &dev->flags) ||
		    test_bit(R5_Wantcompute, &dev->flags))) {
			if (test_bit(R5_Insync, &dev->flags)) rcw++;
2157 2158 2159 2160
			else
				rcw += 2*disks;
		}
	}
2161
	pr_debug("for sector %llu, rmw=%d rcw=%d\n",
2162 2163 2164 2165 2166 2167 2168 2169
		(unsigned long long)sh->sector, rmw, rcw);
	set_bit(STRIPE_HANDLE, &sh->state);
	if (rmw < rcw && rmw > 0)
		/* prefer read-modify-write, but need to get some data */
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if ((dev->towrite || i == sh->pd_idx) &&
			    !test_bit(R5_LOCKED, &dev->flags) &&
2170 2171
			    !(test_bit(R5_UPTODATE, &dev->flags) ||
			    test_bit(R5_Wantcompute, &dev->flags)) &&
2172 2173 2174
			    test_bit(R5_Insync, &dev->flags)) {
				if (
				  test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2175
					pr_debug("Read_old block "
2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192
						"%d for r-m-w\n", i);
					set_bit(R5_LOCKED, &dev->flags);
					set_bit(R5_Wantread, &dev->flags);
					s->locked++;
				} else {
					set_bit(STRIPE_DELAYED, &sh->state);
					set_bit(STRIPE_HANDLE, &sh->state);
				}
			}
		}
	if (rcw <= rmw && rcw > 0)
		/* want reconstruct write, but need to get some data */
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (!test_bit(R5_OVERWRITE, &dev->flags) &&
			    i != sh->pd_idx &&
			    !test_bit(R5_LOCKED, &dev->flags) &&
2193 2194
			    !(test_bit(R5_UPTODATE, &dev->flags) ||
			    test_bit(R5_Wantcompute, &dev->flags)) &&
2195 2196 2197
			    test_bit(R5_Insync, &dev->flags)) {
				if (
				  test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2198
					pr_debug("Read_old block "
2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211
						"%d for Reconstruct\n", i);
					set_bit(R5_LOCKED, &dev->flags);
					set_bit(R5_Wantread, &dev->flags);
					s->locked++;
				} else {
					set_bit(STRIPE_DELAYED, &sh->state);
					set_bit(STRIPE_HANDLE, &sh->state);
				}
			}
		}
	/* now if nothing is locked, and if we have enough data,
	 * we can start a write request
	 */
2212 2213 2214 2215 2216 2217 2218
	/* since handle_stripe can be called at any time we need to handle the
	 * case where a compute block operation has been submitted and then a
	 * subsequent call wants to start a write request.  raid5_run_ops only
	 * handles the case where compute block and postxor are requested
	 * simultaneously.  If this is not the case then new writes need to be
	 * held off until the compute completes.
	 */
2219 2220 2221
	if ((s->req_compute || !test_bit(STRIPE_COMPUTE_RUN, &sh->state)) &&
	    (s->locked == 0 && (rcw == 0 || rmw == 0) &&
	    !test_bit(STRIPE_BIT_DELAY, &sh->state)))
2222
		schedule_reconstruction5(sh, s, rcw == 0, 0);
2223 2224
}

2225
static void handle_stripe_dirtying6(raid5_conf_t *conf,
2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240
		struct stripe_head *sh,	struct stripe_head_state *s,
		struct r6_state *r6s, int disks)
{
	int rcw = 0, must_compute = 0, pd_idx = sh->pd_idx, i;
	int qd_idx = r6s->qd_idx;
	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		/* Would I have to read this buffer for reconstruct_write */
		if (!test_bit(R5_OVERWRITE, &dev->flags)
		    && i != pd_idx && i != qd_idx
		    && (!test_bit(R5_LOCKED, &dev->flags)
			    ) &&
		    !test_bit(R5_UPTODATE, &dev->flags)) {
			if (test_bit(R5_Insync, &dev->flags)) rcw++;
			else {
2241
				pr_debug("raid6: must_compute: "
2242 2243 2244 2245 2246
					"disk %d flags=%#lx\n", i, dev->flags);
				must_compute++;
			}
		}
	}
2247
	pr_debug("for sector %llu, rcw=%d, must_compute=%d\n",
2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261
	       (unsigned long long)sh->sector, rcw, must_compute);
	set_bit(STRIPE_HANDLE, &sh->state);

	if (rcw > 0)
		/* want reconstruct write, but need to get some data */
		for (i = disks; i--; ) {
			struct r5dev *dev = &sh->dev[i];
			if (!test_bit(R5_OVERWRITE, &dev->flags)
			    && !(s->failed == 0 && (i == pd_idx || i == qd_idx))
			    && !test_bit(R5_LOCKED, &dev->flags) &&
			    !test_bit(R5_UPTODATE, &dev->flags) &&
			    test_bit(R5_Insync, &dev->flags)) {
				if (
				  test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2262
					pr_debug("Read_old stripe %llu "
2263 2264 2265 2266 2267 2268
						"block %d for Reconstruct\n",
					     (unsigned long long)sh->sector, i);
					set_bit(R5_LOCKED, &dev->flags);
					set_bit(R5_Wantread, &dev->flags);
					s->locked++;
				} else {
2269
					pr_debug("Request delayed stripe %llu "
2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298
						"block %d for Reconstruct\n",
					     (unsigned long long)sh->sector, i);
					set_bit(STRIPE_DELAYED, &sh->state);
					set_bit(STRIPE_HANDLE, &sh->state);
				}
			}
		}
	/* now if nothing is locked, and if we have enough data, we can start a
	 * write request
	 */
	if (s->locked == 0 && rcw == 0 &&
	    !test_bit(STRIPE_BIT_DELAY, &sh->state)) {
		if (must_compute > 0) {
			/* We have failed blocks and need to compute them */
			switch (s->failed) {
			case 0:
				BUG();
			case 1:
				compute_block_1(sh, r6s->failed_num[0], 0);
				break;
			case 2:
				compute_block_2(sh, r6s->failed_num[0],
						r6s->failed_num[1]);
				break;
			default: /* This request should have been failed? */
				BUG();
			}
		}

2299
		pr_debug("Computing parity for stripe %llu\n",
2300 2301 2302 2303 2304
			(unsigned long long)sh->sector);
		compute_parity6(sh, RECONSTRUCT_WRITE);
		/* now every locked buffer is ready to be written */
		for (i = disks; i--; )
			if (test_bit(R5_LOCKED, &sh->dev[i].flags)) {
2305
				pr_debug("Writing stripe %llu block %d\n",
2306 2307 2308 2309
				       (unsigned long long)sh->sector, i);
				s->locked++;
				set_bit(R5_Wantwrite, &sh->dev[i].flags);
			}
2310 2311 2312
		if (s->locked == disks)
			if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
				atomic_inc(&conf->pending_full_writes);
2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327
		/* after a RECONSTRUCT_WRITE, the stripe MUST be in-sync */
		set_bit(STRIPE_INSYNC, &sh->state);

		if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
			atomic_dec(&conf->preread_active_stripes);
			if (atomic_read(&conf->preread_active_stripes) <
			    IO_THRESHOLD)
				md_wakeup_thread(conf->mddev->thread);
		}
	}
}

static void handle_parity_checks5(raid5_conf_t *conf, struct stripe_head *sh,
				struct stripe_head_state *s, int disks)
{
2328
	struct r5dev *dev = NULL;
2329

2330
	set_bit(STRIPE_HANDLE, &sh->state);
2331

2332 2333 2334
	switch (sh->check_state) {
	case check_state_idle:
		/* start a new check operation if there are no failures */
2335 2336
		if (s->failed == 0) {
			BUG_ON(s->uptodate != disks);
2337 2338
			sh->check_state = check_state_run;
			set_bit(STRIPE_OP_CHECK, &s->ops_request);
2339 2340
			clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
			s->uptodate--;
2341
			break;
2342
		}
2343 2344 2345 2346 2347 2348 2349 2350 2351 2352
		dev = &sh->dev[s->failed_num];
		/* fall through */
	case check_state_compute_result:
		sh->check_state = check_state_idle;
		if (!dev)
			dev = &sh->dev[sh->pd_idx];

		/* check that a write has not made the stripe insync */
		if (test_bit(STRIPE_INSYNC, &sh->state))
			break;
D
Dan Williams 已提交
2353

2354 2355 2356 2357 2358
		/* either failed parity check, or recovery is happening */
		BUG_ON(!test_bit(R5_UPTODATE, &dev->flags));
		BUG_ON(s->uptodate != disks);

		set_bit(R5_LOCKED, &dev->flags);
2359
		s->locked++;
2360
		set_bit(R5_Wantwrite, &dev->flags);
2361

2362 2363
		clear_bit(STRIPE_DEGRADED, &sh->state);
		set_bit(STRIPE_INSYNC, &sh->state);
2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391
		break;
	case check_state_run:
		break; /* we will be called again upon completion */
	case check_state_check_result:
		sh->check_state = check_state_idle;

		/* if a failure occurred during the check operation, leave
		 * STRIPE_INSYNC not set and let the stripe be handled again
		 */
		if (s->failed)
			break;

		/* handle a successful check operation, if parity is correct
		 * we are done.  Otherwise update the mismatch count and repair
		 * parity if !MD_RECOVERY_CHECK
		 */
		if (sh->ops.zero_sum_result == 0)
			/* parity is correct (on disc,
			 * not in buffer any more)
			 */
			set_bit(STRIPE_INSYNC, &sh->state);
		else {
			conf->mddev->resync_mismatches += STRIPE_SECTORS;
			if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
				/* don't try to repair!! */
				set_bit(STRIPE_INSYNC, &sh->state);
			else {
				sh->check_state = check_state_compute_run;
2392
				set_bit(STRIPE_COMPUTE_RUN, &sh->state);
2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407
				set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
				set_bit(R5_Wantcompute,
					&sh->dev[sh->pd_idx].flags);
				sh->ops.target = sh->pd_idx;
				s->uptodate++;
			}
		}
		break;
	case check_state_compute_run:
		break;
	default:
		printk(KERN_ERR "%s: unknown check_state: %d sector: %llu\n",
		       __func__, sh->check_state,
		       (unsigned long long) sh->sector);
		BUG();
2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512
	}
}


static void handle_parity_checks6(raid5_conf_t *conf, struct stripe_head *sh,
				struct stripe_head_state *s,
				struct r6_state *r6s, struct page *tmp_page,
				int disks)
{
	int update_p = 0, update_q = 0;
	struct r5dev *dev;
	int pd_idx = sh->pd_idx;
	int qd_idx = r6s->qd_idx;

	set_bit(STRIPE_HANDLE, &sh->state);

	BUG_ON(s->failed > 2);
	BUG_ON(s->uptodate < disks);
	/* Want to check and possibly repair P and Q.
	 * However there could be one 'failed' device, in which
	 * case we can only check one of them, possibly using the
	 * other to generate missing data
	 */

	/* If !tmp_page, we cannot do the calculations,
	 * but as we have set STRIPE_HANDLE, we will soon be called
	 * by stripe_handle with a tmp_page - just wait until then.
	 */
	if (tmp_page) {
		if (s->failed == r6s->q_failed) {
			/* The only possible failed device holds 'Q', so it
			 * makes sense to check P (If anything else were failed,
			 * we would have used P to recreate it).
			 */
			compute_block_1(sh, pd_idx, 1);
			if (!page_is_zero(sh->dev[pd_idx].page)) {
				compute_block_1(sh, pd_idx, 0);
				update_p = 1;
			}
		}
		if (!r6s->q_failed && s->failed < 2) {
			/* q is not failed, and we didn't use it to generate
			 * anything, so it makes sense to check it
			 */
			memcpy(page_address(tmp_page),
			       page_address(sh->dev[qd_idx].page),
			       STRIPE_SIZE);
			compute_parity6(sh, UPDATE_PARITY);
			if (memcmp(page_address(tmp_page),
				   page_address(sh->dev[qd_idx].page),
				   STRIPE_SIZE) != 0) {
				clear_bit(STRIPE_INSYNC, &sh->state);
				update_q = 1;
			}
		}
		if (update_p || update_q) {
			conf->mddev->resync_mismatches += STRIPE_SECTORS;
			if (test_bit(MD_RECOVERY_CHECK, &conf->mddev->recovery))
				/* don't try to repair!! */
				update_p = update_q = 0;
		}

		/* now write out any block on a failed drive,
		 * or P or Q if they need it
		 */

		if (s->failed == 2) {
			dev = &sh->dev[r6s->failed_num[1]];
			s->locked++;
			set_bit(R5_LOCKED, &dev->flags);
			set_bit(R5_Wantwrite, &dev->flags);
		}
		if (s->failed >= 1) {
			dev = &sh->dev[r6s->failed_num[0]];
			s->locked++;
			set_bit(R5_LOCKED, &dev->flags);
			set_bit(R5_Wantwrite, &dev->flags);
		}

		if (update_p) {
			dev = &sh->dev[pd_idx];
			s->locked++;
			set_bit(R5_LOCKED, &dev->flags);
			set_bit(R5_Wantwrite, &dev->flags);
		}
		if (update_q) {
			dev = &sh->dev[qd_idx];
			s->locked++;
			set_bit(R5_LOCKED, &dev->flags);
			set_bit(R5_Wantwrite, &dev->flags);
		}
		clear_bit(STRIPE_DEGRADED, &sh->state);

		set_bit(STRIPE_INSYNC, &sh->state);
	}
}

static void handle_stripe_expansion(raid5_conf_t *conf, struct stripe_head *sh,
				struct r6_state *r6s)
{
	int i;

	/* We have read all the blocks in this stripe and now we need to
	 * copy some of them into a target stripe for expand.
	 */
2513
	struct dma_async_tx_descriptor *tx = NULL;
2514 2515
	clear_bit(STRIPE_EXPAND_SOURCE, &sh->state);
	for (i = 0; i < sh->disks; i++)
2516
		if (i != sh->pd_idx && (!r6s || i != r6s->qd_idx)) {
2517
			int dd_idx, pd_idx, qd_idx, j;
2518 2519 2520
			struct stripe_head *sh2;

			sector_t bn = compute_blocknr(sh, i);
2521 2522 2523
			sector_t s =
				raid5_compute_sector(conf, bn, 0,
						     &dd_idx, &pd_idx, &qd_idx);
2524
			sh2 = get_active_stripe(conf, s, 0, 1);
2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536
			if (sh2 == NULL)
				/* so far only the early blocks of this stripe
				 * have been requested.  When later blocks
				 * get requested, we will try again
				 */
				continue;
			if (!test_bit(STRIPE_EXPANDING, &sh2->state) ||
			   test_bit(R5_Expanded, &sh2->dev[dd_idx].flags)) {
				/* must have already done this block */
				release_stripe(sh2);
				continue;
			}
2537 2538 2539 2540 2541 2542

			/* place all the copies on one channel */
			tx = async_memcpy(sh2->dev[dd_idx].page,
				sh->dev[i].page, 0, 0, STRIPE_SIZE,
				ASYNC_TX_DEP_ACK, tx, NULL, NULL);

2543 2544 2545 2546
			set_bit(R5_Expanded, &sh2->dev[dd_idx].flags);
			set_bit(R5_UPTODATE, &sh2->dev[dd_idx].flags);
			for (j = 0; j < conf->raid_disks; j++)
				if (j != sh2->pd_idx &&
2547
				    (!r6s || j != sh2->qd_idx) &&
2548 2549 2550 2551 2552 2553 2554
				    !test_bit(R5_Expanded, &sh2->dev[j].flags))
					break;
			if (j == conf->raid_disks) {
				set_bit(STRIPE_EXPAND_READY, &sh2->state);
				set_bit(STRIPE_HANDLE, &sh2->state);
			}
			release_stripe(sh2);
2555

2556
		}
2557 2558 2559 2560 2561
	/* done submitting copies, wait for them to complete */
	if (tx) {
		async_tx_ack(tx);
		dma_wait_for_async_tx(tx);
	}
2562
}
L
Linus Torvalds 已提交
2563

2564

L
Linus Torvalds 已提交
2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580
/*
 * handle_stripe - do things to a stripe.
 *
 * We lock the stripe and then examine the state of various bits
 * to see what needs to be done.
 * Possible results:
 *    return some read request which now have data
 *    return some write requests which are safely on disc
 *    schedule a read on some buffers
 *    schedule a write of some buffers
 *    return confirmation of parity correctness
 *
 * buffers are taken off read_list or write_list, and bh_cache buffers
 * get BH_Lock set before the stripe lock is released.
 *
 */
2581

2582
static bool handle_stripe5(struct stripe_head *sh)
L
Linus Torvalds 已提交
2583 2584
{
	raid5_conf_t *conf = sh->raid_conf;
2585 2586 2587
	int disks = sh->disks, i;
	struct bio *return_bi = NULL;
	struct stripe_head_state s;
L
Linus Torvalds 已提交
2588
	struct r5dev *dev;
2589
	mdk_rdev_t *blocked_rdev = NULL;
2590
	int prexor;
L
Linus Torvalds 已提交
2591

2592
	memset(&s, 0, sizeof(s));
2593 2594 2595 2596
	pr_debug("handling stripe %llu, state=%#lx cnt=%d, pd_idx=%d check:%d "
		 "reconstruct:%d\n", (unsigned long long)sh->sector, sh->state,
		 atomic_read(&sh->count), sh->pd_idx, sh->check_state,
		 sh->reconstruct_state);
L
Linus Torvalds 已提交
2597 2598 2599 2600 2601

	spin_lock(&sh->lock);
	clear_bit(STRIPE_HANDLE, &sh->state);
	clear_bit(STRIPE_DELAYED, &sh->state);

2602 2603 2604
	s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
	s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
	s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
N
Neil Brown 已提交
2605

2606
	/* Now to look around and see what can be done */
2607
	rcu_read_lock();
L
Linus Torvalds 已提交
2608 2609
	for (i=disks; i--; ) {
		mdk_rdev_t *rdev;
2610
		struct r5dev *dev = &sh->dev[i];
L
Linus Torvalds 已提交
2611 2612
		clear_bit(R5_Insync, &dev->flags);

2613 2614 2615 2616 2617 2618 2619
		pr_debug("check %d: state 0x%lx toread %p read %p write %p "
			"written %p\n",	i, dev->flags, dev->toread, dev->read,
			dev->towrite, dev->written);

		/* maybe we can request a biofill operation
		 *
		 * new wantfill requests are only permitted while
2620
		 * ops_complete_biofill is guaranteed to be inactive
2621 2622
		 */
		if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread &&
2623
		    !test_bit(STRIPE_BIOFILL_RUN, &sh->state))
2624
			set_bit(R5_Wantfill, &dev->flags);
L
Linus Torvalds 已提交
2625 2626

		/* now count some things */
2627 2628
		if (test_bit(R5_LOCKED, &dev->flags)) s.locked++;
		if (test_bit(R5_UPTODATE, &dev->flags)) s.uptodate++;
2629
		if (test_bit(R5_Wantcompute, &dev->flags)) s.compute++;
L
Linus Torvalds 已提交
2630

2631 2632 2633
		if (test_bit(R5_Wantfill, &dev->flags))
			s.to_fill++;
		else if (dev->toread)
2634
			s.to_read++;
L
Linus Torvalds 已提交
2635
		if (dev->towrite) {
2636
			s.to_write++;
L
Linus Torvalds 已提交
2637
			if (!test_bit(R5_OVERWRITE, &dev->flags))
2638
				s.non_overwrite++;
L
Linus Torvalds 已提交
2639
		}
2640 2641
		if (dev->written)
			s.written++;
2642
		rdev = rcu_dereference(conf->disks[i].rdev);
2643 2644
		if (blocked_rdev == NULL &&
		    rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
2645 2646 2647
			blocked_rdev = rdev;
			atomic_inc(&rdev->nr_pending);
		}
2648
		if (!rdev || !test_bit(In_sync, &rdev->flags)) {
N
NeilBrown 已提交
2649
			/* The ReadError flag will just be confusing now */
2650 2651 2652
			clear_bit(R5_ReadError, &dev->flags);
			clear_bit(R5_ReWrite, &dev->flags);
		}
2653
		if (!rdev || !test_bit(In_sync, &rdev->flags)
2654
		    || test_bit(R5_ReadError, &dev->flags)) {
2655 2656
			s.failed++;
			s.failed_num = i;
L
Linus Torvalds 已提交
2657 2658 2659
		} else
			set_bit(R5_Insync, &dev->flags);
	}
2660
	rcu_read_unlock();
2661

2662
	if (unlikely(blocked_rdev)) {
2663 2664 2665 2666 2667 2668 2669 2670
		if (s.syncing || s.expanding || s.expanded ||
		    s.to_write || s.written) {
			set_bit(STRIPE_HANDLE, &sh->state);
			goto unlock;
		}
		/* There is nothing for the blocked_rdev to block */
		rdev_dec_pending(blocked_rdev, conf->mddev);
		blocked_rdev = NULL;
2671 2672
	}

2673 2674 2675 2676
	if (s.to_fill && !test_bit(STRIPE_BIOFILL_RUN, &sh->state)) {
		set_bit(STRIPE_OP_BIOFILL, &s.ops_request);
		set_bit(STRIPE_BIOFILL_RUN, &sh->state);
	}
2677

2678
	pr_debug("locked=%d uptodate=%d to_read=%d"
L
Linus Torvalds 已提交
2679
		" to_write=%d failed=%d failed_num=%d\n",
2680 2681
		s.locked, s.uptodate, s.to_read, s.to_write,
		s.failed, s.failed_num);
L
Linus Torvalds 已提交
2682 2683 2684
	/* check if the array has lost two devices and, if so, some requests might
	 * need to be failed
	 */
2685
	if (s.failed > 1 && s.to_read+s.to_write+s.written)
2686
		handle_failed_stripe(conf, sh, &s, disks, &return_bi);
2687
	if (s.failed > 1 && s.syncing) {
L
Linus Torvalds 已提交
2688 2689
		md_done_sync(conf->mddev, STRIPE_SECTORS,0);
		clear_bit(STRIPE_SYNCING, &sh->state);
2690
		s.syncing = 0;
L
Linus Torvalds 已提交
2691 2692 2693 2694 2695 2696
	}

	/* might be able to return some write requests if the parity block
	 * is safe, or on a failed drive
	 */
	dev = &sh->dev[sh->pd_idx];
2697 2698 2699 2700 2701
	if ( s.written &&
	     ((test_bit(R5_Insync, &dev->flags) &&
	       !test_bit(R5_LOCKED, &dev->flags) &&
	       test_bit(R5_UPTODATE, &dev->flags)) ||
	       (s.failed == 1 && s.failed_num == sh->pd_idx)))
2702
		handle_stripe_clean_event(conf, sh, disks, &return_bi);
L
Linus Torvalds 已提交
2703 2704 2705 2706 2707

	/* Now we might consider reading some blocks, either to check/generate
	 * parity, or to satisfy requests
	 * or to load a block that is being partially written.
	 */
2708
	if (s.to_read || s.non_overwrite ||
2709
	    (s.syncing && (s.uptodate + s.compute < disks)) || s.expanding)
2710
		handle_stripe_fill5(sh, &s, disks);
L
Linus Torvalds 已提交
2711

2712 2713 2714
	/* Now we check to see if any write operations have recently
	 * completed
	 */
2715
	prexor = 0;
2716
	if (sh->reconstruct_state == reconstruct_state_prexor_drain_result)
2717
		prexor = 1;
2718 2719
	if (sh->reconstruct_state == reconstruct_state_drain_result ||
	    sh->reconstruct_state == reconstruct_state_prexor_drain_result) {
2720
		sh->reconstruct_state = reconstruct_state_idle;
2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731

		/* All the 'written' buffers and the parity block are ready to
		 * be written back to disk
		 */
		BUG_ON(!test_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags));
		for (i = disks; i--; ) {
			dev = &sh->dev[i];
			if (test_bit(R5_LOCKED, &dev->flags) &&
				(i == sh->pd_idx || dev->written)) {
				pr_debug("Writing block %d\n", i);
				set_bit(R5_Wantwrite, &dev->flags);
2732 2733
				if (prexor)
					continue;
2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752
				if (!test_bit(R5_Insync, &dev->flags) ||
				    (i == sh->pd_idx && s.failed == 0))
					set_bit(STRIPE_INSYNC, &sh->state);
			}
		}
		if (test_and_clear_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
			atomic_dec(&conf->preread_active_stripes);
			if (atomic_read(&conf->preread_active_stripes) <
				IO_THRESHOLD)
				md_wakeup_thread(conf->mddev->thread);
		}
	}

	/* Now to consider new write requests and what else, if anything
	 * should be read.  We do not handle new writes when:
	 * 1/ A 'write' operation (copy+xor) is already in flight.
	 * 2/ A 'check' operation is in flight, as it may clobber the parity
	 *    block.
	 */
2753
	if (s.to_write && !sh->reconstruct_state && !sh->check_state)
2754
		handle_stripe_dirtying5(conf, sh, &s, disks);
L
Linus Torvalds 已提交
2755 2756

	/* maybe we need to check and possibly fix the parity for this stripe
2757 2758 2759
	 * Any reads will already have been scheduled, so we just see if enough
	 * data is available.  The parity check is held off while parity
	 * dependent operations are in flight.
L
Linus Torvalds 已提交
2760
	 */
2761 2762
	if (sh->check_state ||
	    (s.syncing && s.locked == 0 &&
2763
	     !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
2764
	     !test_bit(STRIPE_INSYNC, &sh->state)))
2765
		handle_parity_checks5(conf, sh, &s, disks);
2766

2767
	if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
L
Linus Torvalds 已提交
2768 2769 2770
		md_done_sync(conf->mddev, STRIPE_SECTORS,1);
		clear_bit(STRIPE_SYNCING, &sh->state);
	}
2771 2772 2773 2774

	/* If the failed drive is just a ReadError, then we might need to progress
	 * the repair/check process
	 */
2775 2776 2777 2778
	if (s.failed == 1 && !conf->mddev->ro &&
	    test_bit(R5_ReadError, &sh->dev[s.failed_num].flags)
	    && !test_bit(R5_LOCKED, &sh->dev[s.failed_num].flags)
	    && test_bit(R5_UPTODATE, &sh->dev[s.failed_num].flags)
2779
		) {
2780
		dev = &sh->dev[s.failed_num];
2781 2782 2783 2784
		if (!test_bit(R5_ReWrite, &dev->flags)) {
			set_bit(R5_Wantwrite, &dev->flags);
			set_bit(R5_ReWrite, &dev->flags);
			set_bit(R5_LOCKED, &dev->flags);
2785
			s.locked++;
2786 2787 2788 2789
		} else {
			/* let's read it back */
			set_bit(R5_Wantread, &dev->flags);
			set_bit(R5_LOCKED, &dev->flags);
2790
			s.locked++;
2791 2792 2793
		}
	}

2794 2795 2796
	/* Finish reconstruct operations initiated by the expansion process */
	if (sh->reconstruct_state == reconstruct_state_result) {
		sh->reconstruct_state = reconstruct_state_idle;
2797
		clear_bit(STRIPE_EXPANDING, &sh->state);
D
Dan Williams 已提交
2798
		for (i = conf->raid_disks; i--; ) {
2799
			set_bit(R5_Wantwrite, &sh->dev[i].flags);
D
Dan Williams 已提交
2800
			set_bit(R5_LOCKED, &sh->dev[i].flags);
2801
			s.locked++;
D
Dan Williams 已提交
2802
		}
2803 2804 2805
	}

	if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state) &&
2806
	    !sh->reconstruct_state) {
2807
		int qd_idx;
2808 2809
		/* Need to write out all blocks after computing parity */
		sh->disks = conf->raid_disks;
2810 2811
		sh->pd_idx = stripe_to_pdidx(sh->sector, conf, 0, &qd_idx);
		sh->qd_idx = qd_idx;
2812
		schedule_reconstruction5(sh, &s, 1, 1);
2813
	} else if (s.expanded && !sh->reconstruct_state && s.locked == 0) {
2814
		clear_bit(STRIPE_EXPAND_READY, &sh->state);
2815
		atomic_dec(&conf->reshape_stripes);
2816 2817 2818 2819
		wake_up(&conf->wait_for_overlap);
		md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
	}

2820
	if (s.expanding && s.locked == 0 &&
2821
	    !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
2822
		handle_stripe_expansion(conf, sh, NULL);
2823

2824
 unlock:
L
Linus Torvalds 已提交
2825 2826
	spin_unlock(&sh->lock);

2827 2828 2829 2830
	/* wait for this device to become unblocked */
	if (unlikely(blocked_rdev))
		md_wait_for_blocked_rdev(blocked_rdev, conf->mddev);

2831 2832
	if (s.ops_request)
		raid5_run_ops(sh, s.ops_request);
2833

2834
	ops_run_io(sh, &s);
L
Linus Torvalds 已提交
2835

2836
	return_io(return_bi);
2837 2838

	return blocked_rdev == NULL;
L
Linus Torvalds 已提交
2839 2840
}

2841
static bool handle_stripe6(struct stripe_head *sh, struct page *tmp_page)
L
Linus Torvalds 已提交
2842
{
2843
	raid5_conf_t *conf = sh->raid_conf;
2844
	int disks = sh->disks;
2845 2846 2847 2848
	struct bio *return_bi = NULL;
	int i, pd_idx = sh->pd_idx;
	struct stripe_head_state s;
	struct r6_state r6s;
2849
	struct r5dev *dev, *pdev, *qdev;
2850
	mdk_rdev_t *blocked_rdev = NULL;
L
Linus Torvalds 已提交
2851

2852
	r6s.qd_idx = sh->qd_idx;
2853
	pr_debug("handling stripe %llu, state=%#lx cnt=%d, "
2854 2855 2856 2857
		"pd_idx=%d, qd_idx=%d\n",
	       (unsigned long long)sh->sector, sh->state,
	       atomic_read(&sh->count), pd_idx, r6s.qd_idx);
	memset(&s, 0, sizeof(s));
2858

2859 2860 2861 2862
	spin_lock(&sh->lock);
	clear_bit(STRIPE_HANDLE, &sh->state);
	clear_bit(STRIPE_DELAYED, &sh->state);

2863 2864 2865
	s.syncing = test_bit(STRIPE_SYNCING, &sh->state);
	s.expanding = test_bit(STRIPE_EXPAND_SOURCE, &sh->state);
	s.expanded = test_bit(STRIPE_EXPAND_READY, &sh->state);
2866
	/* Now to look around and see what can be done */
L
Linus Torvalds 已提交
2867 2868

	rcu_read_lock();
2869 2870 2871 2872
	for (i=disks; i--; ) {
		mdk_rdev_t *rdev;
		dev = &sh->dev[i];
		clear_bit(R5_Insync, &dev->flags);
L
Linus Torvalds 已提交
2873

2874
		pr_debug("check %d: state 0x%lx read %p write %p written %p\n",
2875 2876 2877 2878
			i, dev->flags, dev->toread, dev->towrite, dev->written);
		/* maybe we can reply to a read */
		if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread) {
			struct bio *rbi, *rbi2;
2879
			pr_debug("Return read for disc %d\n", i);
2880 2881 2882 2883 2884 2885 2886 2887 2888 2889
			spin_lock_irq(&conf->device_lock);
			rbi = dev->toread;
			dev->toread = NULL;
			if (test_and_clear_bit(R5_Overlap, &dev->flags))
				wake_up(&conf->wait_for_overlap);
			spin_unlock_irq(&conf->device_lock);
			while (rbi && rbi->bi_sector < dev->sector + STRIPE_SECTORS) {
				copy_data(0, rbi, dev->page, dev->sector);
				rbi2 = r5_next_bio(rbi, dev->sector);
				spin_lock_irq(&conf->device_lock);
2890
				if (!raid5_dec_bi_phys_segments(rbi)) {
2891 2892 2893 2894 2895 2896 2897
					rbi->bi_next = return_bi;
					return_bi = rbi;
				}
				spin_unlock_irq(&conf->device_lock);
				rbi = rbi2;
			}
		}
L
Linus Torvalds 已提交
2898

2899
		/* now count some things */
2900 2901
		if (test_bit(R5_LOCKED, &dev->flags)) s.locked++;
		if (test_bit(R5_UPTODATE, &dev->flags)) s.uptodate++;
L
Linus Torvalds 已提交
2902

2903

2904 2905
		if (dev->toread)
			s.to_read++;
2906
		if (dev->towrite) {
2907
			s.to_write++;
2908
			if (!test_bit(R5_OVERWRITE, &dev->flags))
2909
				s.non_overwrite++;
2910
		}
2911 2912
		if (dev->written)
			s.written++;
2913
		rdev = rcu_dereference(conf->disks[i].rdev);
2914 2915
		if (blocked_rdev == NULL &&
		    rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
2916 2917 2918
			blocked_rdev = rdev;
			atomic_inc(&rdev->nr_pending);
		}
2919 2920 2921 2922
		if (!rdev || !test_bit(In_sync, &rdev->flags)) {
			/* The ReadError flag will just be confusing now */
			clear_bit(R5_ReadError, &dev->flags);
			clear_bit(R5_ReWrite, &dev->flags);
L
Linus Torvalds 已提交
2923
		}
2924 2925
		if (!rdev || !test_bit(In_sync, &rdev->flags)
		    || test_bit(R5_ReadError, &dev->flags)) {
2926 2927 2928
			if (s.failed < 2)
				r6s.failed_num[s.failed] = i;
			s.failed++;
2929 2930
		} else
			set_bit(R5_Insync, &dev->flags);
L
Linus Torvalds 已提交
2931 2932
	}
	rcu_read_unlock();
2933 2934

	if (unlikely(blocked_rdev)) {
2935 2936 2937 2938 2939 2940 2941 2942
		if (s.syncing || s.expanding || s.expanded ||
		    s.to_write || s.written) {
			set_bit(STRIPE_HANDLE, &sh->state);
			goto unlock;
		}
		/* There is nothing for the blocked_rdev to block */
		rdev_dec_pending(blocked_rdev, conf->mddev);
		blocked_rdev = NULL;
2943
	}
2944

2945
	pr_debug("locked=%d uptodate=%d to_read=%d"
2946
	       " to_write=%d failed=%d failed_num=%d,%d\n",
2947 2948 2949 2950
	       s.locked, s.uptodate, s.to_read, s.to_write, s.failed,
	       r6s.failed_num[0], r6s.failed_num[1]);
	/* check if the array has lost >2 devices and, if so, some requests
	 * might need to be failed
2951
	 */
2952
	if (s.failed > 2 && s.to_read+s.to_write+s.written)
2953
		handle_failed_stripe(conf, sh, &s, disks, &return_bi);
2954
	if (s.failed > 2 && s.syncing) {
2955 2956
		md_done_sync(conf->mddev, STRIPE_SECTORS,0);
		clear_bit(STRIPE_SYNCING, &sh->state);
2957
		s.syncing = 0;
2958 2959 2960 2961 2962 2963 2964
	}

	/*
	 * might be able to return some write requests if the parity blocks
	 * are safe, or on a failed drive
	 */
	pdev = &sh->dev[pd_idx];
2965 2966 2967 2968 2969 2970 2971 2972
	r6s.p_failed = (s.failed >= 1 && r6s.failed_num[0] == pd_idx)
		|| (s.failed >= 2 && r6s.failed_num[1] == pd_idx);
	qdev = &sh->dev[r6s.qd_idx];
	r6s.q_failed = (s.failed >= 1 && r6s.failed_num[0] == r6s.qd_idx)
		|| (s.failed >= 2 && r6s.failed_num[1] == r6s.qd_idx);

	if ( s.written &&
	     ( r6s.p_failed || ((test_bit(R5_Insync, &pdev->flags)
2973
			     && !test_bit(R5_LOCKED, &pdev->flags)
2974 2975
			     && test_bit(R5_UPTODATE, &pdev->flags)))) &&
	     ( r6s.q_failed || ((test_bit(R5_Insync, &qdev->flags)
2976
			     && !test_bit(R5_LOCKED, &qdev->flags)
2977
			     && test_bit(R5_UPTODATE, &qdev->flags)))))
2978
		handle_stripe_clean_event(conf, sh, disks, &return_bi);
2979 2980 2981 2982 2983

	/* Now we might consider reading some blocks, either to check/generate
	 * parity, or to satisfy requests
	 * or to load a block that is being partially written.
	 */
2984 2985
	if (s.to_read || s.non_overwrite || (s.to_write && s.failed) ||
	    (s.syncing && (s.uptodate < disks)) || s.expanding)
2986
		handle_stripe_fill6(sh, &s, &r6s, disks);
2987 2988

	/* now to consider writing and what else, if anything should be read */
2989
	if (s.to_write)
2990
		handle_stripe_dirtying6(conf, sh, &s, &r6s, disks);
2991 2992

	/* maybe we need to check and possibly fix the parity for this stripe
2993 2994
	 * Any reads will already have been scheduled, so we just see if enough
	 * data is available
2995
	 */
2996 2997
	if (s.syncing && s.locked == 0 && !test_bit(STRIPE_INSYNC, &sh->state))
		handle_parity_checks6(conf, sh, &s, &r6s, tmp_page, disks);
2998

2999
	if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
3000 3001 3002 3003 3004 3005 3006
		md_done_sync(conf->mddev, STRIPE_SECTORS,1);
		clear_bit(STRIPE_SYNCING, &sh->state);
	}

	/* If the failed drives are just a ReadError, then we might need
	 * to progress the repair/check process
	 */
3007 3008 3009
	if (s.failed <= 2 && !conf->mddev->ro)
		for (i = 0; i < s.failed; i++) {
			dev = &sh->dev[r6s.failed_num[i]];
3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024
			if (test_bit(R5_ReadError, &dev->flags)
			    && !test_bit(R5_LOCKED, &dev->flags)
			    && test_bit(R5_UPTODATE, &dev->flags)
				) {
				if (!test_bit(R5_ReWrite, &dev->flags)) {
					set_bit(R5_Wantwrite, &dev->flags);
					set_bit(R5_ReWrite, &dev->flags);
					set_bit(R5_LOCKED, &dev->flags);
				} else {
					/* let's read it back */
					set_bit(R5_Wantread, &dev->flags);
					set_bit(R5_LOCKED, &dev->flags);
				}
			}
		}
3025

3026
	if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state)) {
3027
		/* Need to write out all blocks after computing P&Q */
3028
		int qd_idx;
3029
		sh->disks = conf->raid_disks;
3030 3031
		sh->pd_idx = stripe_to_pdidx(sh->sector, conf, 0, &qd_idx);
		sh->qd_idx = qd_idx;
3032 3033 3034
		compute_parity6(sh, RECONSTRUCT_WRITE);
		for (i = conf->raid_disks ; i-- ;  ) {
			set_bit(R5_LOCKED, &sh->dev[i].flags);
3035
			s.locked++;
3036 3037 3038
			set_bit(R5_Wantwrite, &sh->dev[i].flags);
		}
		clear_bit(STRIPE_EXPANDING, &sh->state);
3039
	} else if (s.expanded) {
3040 3041 3042 3043 3044 3045
		clear_bit(STRIPE_EXPAND_READY, &sh->state);
		atomic_dec(&conf->reshape_stripes);
		wake_up(&conf->wait_for_overlap);
		md_done_sync(conf->mddev, STRIPE_SECTORS, 1);
	}

3046
	if (s.expanding && s.locked == 0 &&
3047
	    !test_bit(STRIPE_COMPUTE_RUN, &sh->state))
3048
		handle_stripe_expansion(conf, sh, &r6s);
3049

3050
 unlock:
3051 3052
	spin_unlock(&sh->lock);

3053 3054 3055 3056
	/* wait for this device to become unblocked */
	if (unlikely(blocked_rdev))
		md_wait_for_blocked_rdev(blocked_rdev, conf->mddev);

D
Dan Williams 已提交
3057
	ops_run_io(sh, &s);
3058

D
Dan Williams 已提交
3059
	return_io(return_bi);
3060 3061

	return blocked_rdev == NULL;
3062 3063
}

3064 3065
/* returns true if the stripe was handled */
static bool handle_stripe(struct stripe_head *sh, struct page *tmp_page)
3066 3067
{
	if (sh->raid_conf->level == 6)
3068
		return handle_stripe6(sh, tmp_page);
3069
	else
3070
		return handle_stripe5(sh);
3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085
}



static void raid5_activate_delayed(raid5_conf_t *conf)
{
	if (atomic_read(&conf->preread_active_stripes) < IO_THRESHOLD) {
		while (!list_empty(&conf->delayed_list)) {
			struct list_head *l = conf->delayed_list.next;
			struct stripe_head *sh;
			sh = list_entry(l, struct stripe_head, lru);
			list_del_init(l);
			clear_bit(STRIPE_DELAYED, &sh->state);
			if (!test_and_set_bit(STRIPE_PREREAD_ACTIVE, &sh->state))
				atomic_inc(&conf->preread_active_stripes);
3086
			list_add_tail(&sh->lru, &conf->hold_list);
3087
		}
3088 3089
	} else
		blk_plug_device(conf->mddev->queue);
3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114
}

static void activate_bit_delay(raid5_conf_t *conf)
{
	/* device_lock is held */
	struct list_head head;
	list_add(&head, &conf->bitmap_list);
	list_del_init(&conf->bitmap_list);
	while (!list_empty(&head)) {
		struct stripe_head *sh = list_entry(head.next, struct stripe_head, lru);
		list_del_init(&sh->lru);
		atomic_inc(&sh->count);
		__release_stripe(conf, sh);
	}
}

static void unplug_slaves(mddev_t *mddev)
{
	raid5_conf_t *conf = mddev_to_conf(mddev);
	int i;

	rcu_read_lock();
	for (i=0; i<mddev->raid_disks; i++) {
		mdk_rdev_t *rdev = rcu_dereference(conf->disks[i].rdev);
		if (rdev && !test_bit(Faulty, &rdev->flags) && atomic_read(&rdev->nr_pending)) {
3115
			struct request_queue *r_queue = bdev_get_queue(rdev->bdev);
3116 3117 3118 3119

			atomic_inc(&rdev->nr_pending);
			rcu_read_unlock();

3120
			blk_unplug(r_queue);
3121 3122 3123 3124 3125 3126 3127 3128

			rdev_dec_pending(rdev, mddev);
			rcu_read_lock();
		}
	}
	rcu_read_unlock();
}

3129
static void raid5_unplug_device(struct request_queue *q)
3130 3131 3132 3133 3134 3135 3136 3137 3138 3139
{
	mddev_t *mddev = q->queuedata;
	raid5_conf_t *conf = mddev_to_conf(mddev);
	unsigned long flags;

	spin_lock_irqsave(&conf->device_lock, flags);

	if (blk_remove_plug(q)) {
		conf->seq_flush++;
		raid5_activate_delayed(conf);
3140
	}
L
Linus Torvalds 已提交
3141 3142 3143 3144 3145 3146 3147
	md_wakeup_thread(mddev->thread);

	spin_unlock_irqrestore(&conf->device_lock, flags);

	unplug_slaves(mddev);
}

3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165
static int raid5_congested(void *data, int bits)
{
	mddev_t *mddev = data;
	raid5_conf_t *conf = mddev_to_conf(mddev);

	/* No difference between reads and writes.  Just check
	 * how busy the stripe_cache is
	 */
	if (conf->inactive_blocked)
		return 1;
	if (conf->quiesce)
		return 1;
	if (list_empty_careful(&conf->inactive_list))
		return 1;

	return 0;
}

3166 3167 3168
/* We want read requests to align with chunks where possible,
 * but write requests don't need to.
 */
3169 3170 3171
static int raid5_mergeable_bvec(struct request_queue *q,
				struct bvec_merge_data *bvm,
				struct bio_vec *biovec)
3172 3173
{
	mddev_t *mddev = q->queuedata;
3174
	sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
3175 3176
	int max;
	unsigned int chunk_sectors = mddev->chunk_size >> 9;
3177
	unsigned int bio_sectors = bvm->bi_size >> 9;
3178

3179
	if ((bvm->bi_rw & 1) == WRITE)
3180 3181 3182 3183 3184 3185 3186 3187 3188 3189
		return biovec->bv_len; /* always allow writes to be mergeable */

	max =  (chunk_sectors - ((sector & (chunk_sectors - 1)) + bio_sectors)) << 9;
	if (max < 0) max = 0;
	if (max <= biovec->bv_len && bio_sectors == 0)
		return biovec->bv_len;
	else
		return max;
}

3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200

static int in_chunk_boundary(mddev_t *mddev, struct bio *bio)
{
	sector_t sector = bio->bi_sector + get_start_sect(bio->bi_bdev);
	unsigned int chunk_sectors = mddev->chunk_size >> 9;
	unsigned int bio_sectors = bio->bi_size >> 9;

	return  chunk_sectors >=
		((sector & (chunk_sectors - 1)) + bio_sectors);
}

3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229
/*
 *  add bio to the retry LIFO  ( in O(1) ... we are in interrupt )
 *  later sampled by raid5d.
 */
static void add_bio_to_retry(struct bio *bi,raid5_conf_t *conf)
{
	unsigned long flags;

	spin_lock_irqsave(&conf->device_lock, flags);

	bi->bi_next = conf->retry_read_aligned_list;
	conf->retry_read_aligned_list = bi;

	spin_unlock_irqrestore(&conf->device_lock, flags);
	md_wakeup_thread(conf->mddev->thread);
}


static struct bio *remove_bio_from_retry(raid5_conf_t *conf)
{
	struct bio *bi;

	bi = conf->retry_read_aligned;
	if (bi) {
		conf->retry_read_aligned = NULL;
		return bi;
	}
	bi = conf->retry_read_aligned_list;
	if(bi) {
3230
		conf->retry_read_aligned_list = bi->bi_next;
3231
		bi->bi_next = NULL;
3232 3233 3234 3235
		/*
		 * this sets the active strip count to 1 and the processed
		 * strip count to zero (upper 8 bits)
		 */
3236 3237 3238 3239 3240 3241 3242
		bi->bi_phys_segments = 1; /* biased count of active stripes */
	}

	return bi;
}


3243 3244 3245 3246 3247 3248
/*
 *  The "raid5_align_endio" should check if the read succeeded and if it
 *  did, call bio_endio on the original bio (having bio_put the new bio
 *  first).
 *  If the read failed..
 */
3249
static void raid5_align_endio(struct bio *bi, int error)
3250 3251
{
	struct bio* raid_bi  = bi->bi_private;
3252 3253 3254 3255 3256
	mddev_t *mddev;
	raid5_conf_t *conf;
	int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
	mdk_rdev_t *rdev;

3257
	bio_put(bi);
3258 3259 3260 3261 3262 3263 3264 3265 3266

	mddev = raid_bi->bi_bdev->bd_disk->queue->queuedata;
	conf = mddev_to_conf(mddev);
	rdev = (void*)raid_bi->bi_next;
	raid_bi->bi_next = NULL;

	rdev_dec_pending(rdev, conf->mddev);

	if (!error && uptodate) {
3267
		bio_endio(raid_bi, 0);
3268 3269
		if (atomic_dec_and_test(&conf->active_aligned_reads))
			wake_up(&conf->wait_for_stripe);
3270
		return;
3271 3272 3273
	}


3274
	pr_debug("raid5_align_endio : io error...handing IO for a retry\n");
3275 3276

	add_bio_to_retry(raid_bi, conf);
3277 3278
}

3279 3280
static int bio_fits_rdev(struct bio *bi)
{
3281
	struct request_queue *q = bdev_get_queue(bi->bi_bdev);
3282 3283 3284 3285

	if ((bi->bi_size>>9) > q->max_sectors)
		return 0;
	blk_recount_segments(q, bi);
3286
	if (bi->bi_phys_segments > q->max_phys_segments)
3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298
		return 0;

	if (q->merge_bvec_fn)
		/* it's too hard to apply the merge_bvec_fn at this stage,
		 * just just give up
		 */
		return 0;

	return 1;
}


3299
static int chunk_aligned_read(struct request_queue *q, struct bio * raid_bio)
3300 3301 3302
{
	mddev_t *mddev = q->queuedata;
	raid5_conf_t *conf = mddev_to_conf(mddev);
3303
	unsigned int dd_idx, pd_idx, qd_idx;
3304 3305 3306 3307
	struct bio* align_bi;
	mdk_rdev_t *rdev;

	if (!in_chunk_boundary(mddev, raid_bio)) {
3308
		pr_debug("chunk_aligned_read : non aligned\n");
3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325
		return 0;
	}
	/*
 	 * use bio_clone to make a copy of the bio
	 */
	align_bi = bio_clone(raid_bio, GFP_NOIO);
	if (!align_bi)
		return 0;
	/*
	 *   set bi_end_io to a new function, and set bi_private to the
	 *     original bio.
	 */
	align_bi->bi_end_io  = raid5_align_endio;
	align_bi->bi_private = raid_bio;
	/*
	 *	compute position
	 */
3326 3327
	align_bi->bi_sector =  raid5_compute_sector(conf, raid_bio->bi_sector,
						    0,
3328
						    &dd_idx, &pd_idx, &qd_idx);
3329 3330 3331 3332 3333 3334

	rcu_read_lock();
	rdev = rcu_dereference(conf->disks[dd_idx].rdev);
	if (rdev && test_bit(In_sync, &rdev->flags)) {
		atomic_inc(&rdev->nr_pending);
		rcu_read_unlock();
3335 3336 3337 3338 3339
		raid_bio->bi_next = (void*)rdev;
		align_bi->bi_bdev =  rdev->bdev;
		align_bi->bi_flags &= ~(1 << BIO_SEG_VALID);
		align_bi->bi_sector += rdev->data_offset;

3340 3341 3342 3343 3344 3345 3346
		if (!bio_fits_rdev(align_bi)) {
			/* too big in some way */
			bio_put(align_bi);
			rdev_dec_pending(rdev, mddev);
			return 0;
		}

3347 3348 3349 3350 3351 3352 3353
		spin_lock_irq(&conf->device_lock);
		wait_event_lock_irq(conf->wait_for_stripe,
				    conf->quiesce == 0,
				    conf->device_lock, /* nothing */);
		atomic_inc(&conf->active_aligned_reads);
		spin_unlock_irq(&conf->device_lock);

3354 3355 3356 3357
		generic_make_request(align_bi);
		return 1;
	} else {
		rcu_read_unlock();
3358
		bio_put(align_bi);
3359 3360 3361 3362
		return 0;
	}
}

3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414
/* __get_priority_stripe - get the next stripe to process
 *
 * Full stripe writes are allowed to pass preread active stripes up until
 * the bypass_threshold is exceeded.  In general the bypass_count
 * increments when the handle_list is handled before the hold_list; however, it
 * will not be incremented when STRIPE_IO_STARTED is sampled set signifying a
 * stripe with in flight i/o.  The bypass_count will be reset when the
 * head of the hold_list has changed, i.e. the head was promoted to the
 * handle_list.
 */
static struct stripe_head *__get_priority_stripe(raid5_conf_t *conf)
{
	struct stripe_head *sh;

	pr_debug("%s: handle: %s hold: %s full_writes: %d bypass_count: %d\n",
		  __func__,
		  list_empty(&conf->handle_list) ? "empty" : "busy",
		  list_empty(&conf->hold_list) ? "empty" : "busy",
		  atomic_read(&conf->pending_full_writes), conf->bypass_count);

	if (!list_empty(&conf->handle_list)) {
		sh = list_entry(conf->handle_list.next, typeof(*sh), lru);

		if (list_empty(&conf->hold_list))
			conf->bypass_count = 0;
		else if (!test_bit(STRIPE_IO_STARTED, &sh->state)) {
			if (conf->hold_list.next == conf->last_hold)
				conf->bypass_count++;
			else {
				conf->last_hold = conf->hold_list.next;
				conf->bypass_count -= conf->bypass_threshold;
				if (conf->bypass_count < 0)
					conf->bypass_count = 0;
			}
		}
	} else if (!list_empty(&conf->hold_list) &&
		   ((conf->bypass_threshold &&
		     conf->bypass_count > conf->bypass_threshold) ||
		    atomic_read(&conf->pending_full_writes) == 0)) {
		sh = list_entry(conf->hold_list.next,
				typeof(*sh), lru);
		conf->bypass_count -= conf->bypass_threshold;
		if (conf->bypass_count < 0)
			conf->bypass_count = 0;
	} else
		return NULL;

	list_del_init(&sh->lru);
	atomic_inc(&sh->count);
	BUG_ON(atomic_read(&sh->count) != 1);
	return sh;
}
3415

3416
static int make_request(struct request_queue *q, struct bio * bi)
L
Linus Torvalds 已提交
3417 3418 3419
{
	mddev_t *mddev = q->queuedata;
	raid5_conf_t *conf = mddev_to_conf(mddev);
3420
	int dd_idx, pd_idx, qd_idx;
L
Linus Torvalds 已提交
3421 3422 3423
	sector_t new_sector;
	sector_t logical_sector, last_sector;
	struct stripe_head *sh;
3424
	const int rw = bio_data_dir(bi);
T
Tejun Heo 已提交
3425
	int cpu, remaining;
L
Linus Torvalds 已提交
3426

3427
	if (unlikely(bio_barrier(bi))) {
3428
		bio_endio(bi, -EOPNOTSUPP);
3429 3430 3431
		return 0;
	}

3432
	md_write_start(mddev, bi);
3433

T
Tejun Heo 已提交
3434 3435 3436 3437 3438
	cpu = part_stat_lock();
	part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
	part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
		      bio_sectors(bi));
	part_stat_unlock();
L
Linus Torvalds 已提交
3439

3440
	if (rw == READ &&
3441 3442 3443 3444
	     mddev->reshape_position == MaxSector &&
	     chunk_aligned_read(q,bi))
            	return 0;

L
Linus Torvalds 已提交
3445 3446 3447 3448
	logical_sector = bi->bi_sector & ~((sector_t)STRIPE_SECTORS-1);
	last_sector = bi->bi_sector + (bi->bi_size>>9);
	bi->bi_next = NULL;
	bi->bi_phys_segments = 1;	/* over-loaded to count active stripes */
3449

L
Linus Torvalds 已提交
3450 3451
	for (;logical_sector < last_sector; logical_sector += STRIPE_SECTORS) {
		DEFINE_WAIT(w);
3452
		int disks, data_disks;
3453
		int previous;
3454

3455
	retry:
3456
		previous = 0;
3457
		prepare_to_wait(&conf->wait_for_overlap, &w, TASK_UNINTERRUPTIBLE);
3458 3459 3460
		if (likely(conf->expand_progress == MaxSector))
			disks = conf->raid_disks;
		else {
3461 3462 3463 3464 3465 3466 3467 3468
			/* spinlock is needed as expand_progress may be
			 * 64bit on a 32bit platform, and so it might be
			 * possible to see a half-updated value
			 * Ofcourse expand_progress could change after
			 * the lock is dropped, so once we get a reference
			 * to the stripe that we think it is, we will have
			 * to check again.
			 */
3469 3470
			spin_lock_irq(&conf->device_lock);
			disks = conf->raid_disks;
3471
			if (logical_sector >= conf->expand_progress) {
3472
				disks = conf->previous_raid_disks;
3473 3474
				previous = 1;
			} else {
3475 3476 3477 3478 3479 3480
				if (logical_sector >= conf->expand_lo) {
					spin_unlock_irq(&conf->device_lock);
					schedule();
					goto retry;
				}
			}
3481 3482
			spin_unlock_irq(&conf->device_lock);
		}
3483 3484
		data_disks = disks - conf->max_degraded;

3485 3486
		new_sector = raid5_compute_sector(conf, logical_sector,
						  previous,
3487
						  &dd_idx, &pd_idx, &qd_idx);
3488
		pr_debug("raid5: make_request, sector %llu logical %llu\n",
L
Linus Torvalds 已提交
3489 3490 3491
			(unsigned long long)new_sector, 
			(unsigned long long)logical_sector);

3492 3493
		sh = get_active_stripe(conf, new_sector, previous,
				       (bi->bi_rw&RWA_MASK));
L
Linus Torvalds 已提交
3494
		if (sh) {
3495 3496
			if (unlikely(conf->expand_progress != MaxSector)) {
				/* expansion might have moved on while waiting for a
3497 3498 3499 3500 3501 3502
				 * stripe, so we must do the range check again.
				 * Expansion could still move past after this
				 * test, but as we are holding a reference to
				 * 'sh', we know that if that happens,
				 *  STRIPE_EXPANDING will get set and the expansion
				 * won't proceed until we finish with the stripe.
3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515
				 */
				int must_retry = 0;
				spin_lock_irq(&conf->device_lock);
				if (logical_sector <  conf->expand_progress &&
				    disks == conf->previous_raid_disks)
					/* mismatch, need to try again */
					must_retry = 1;
				spin_unlock_irq(&conf->device_lock);
				if (must_retry) {
					release_stripe(sh);
					goto retry;
				}
			}
3516 3517 3518 3519 3520 3521 3522 3523 3524
			/* FIXME what if we get a false positive because these
			 * are being updated.
			 */
			if (logical_sector >= mddev->suspend_lo &&
			    logical_sector < mddev->suspend_hi) {
				release_stripe(sh);
				schedule();
				goto retry;
			}
3525 3526 3527 3528 3529

			if (test_bit(STRIPE_EXPANDING, &sh->state) ||
			    !add_stripe_bio(sh, bi, dd_idx, (bi->bi_rw&RW_MASK))) {
				/* Stripe is busy expanding or
				 * add failed due to overlap.  Flush everything
L
Linus Torvalds 已提交
3530 3531 3532 3533 3534 3535 3536 3537
				 * and wait a while
				 */
				raid5_unplug_device(mddev->queue);
				release_stripe(sh);
				schedule();
				goto retry;
			}
			finish_wait(&conf->wait_for_overlap, &w);
3538 3539
			set_bit(STRIPE_HANDLE, &sh->state);
			clear_bit(STRIPE_DELAYED, &sh->state);
L
Linus Torvalds 已提交
3540 3541 3542 3543 3544 3545 3546 3547 3548 3549
			release_stripe(sh);
		} else {
			/* cannot get stripe for read-ahead, just give-up */
			clear_bit(BIO_UPTODATE, &bi->bi_flags);
			finish_wait(&conf->wait_for_overlap, &w);
			break;
		}
			
	}
	spin_lock_irq(&conf->device_lock);
3550
	remaining = raid5_dec_bi_phys_segments(bi);
3551 3552
	spin_unlock_irq(&conf->device_lock);
	if (remaining == 0) {
L
Linus Torvalds 已提交
3553

3554
		if ( rw == WRITE )
L
Linus Torvalds 已提交
3555
			md_write_end(mddev);
3556

3557
		bio_endio(bi, 0);
L
Linus Torvalds 已提交
3558 3559 3560 3561
	}
	return 0;
}

3562
static sector_t reshape_request(mddev_t *mddev, sector_t sector_nr, int *skipped)
L
Linus Torvalds 已提交
3563
{
3564 3565 3566 3567 3568 3569 3570 3571 3572
	/* reshaping is quite different to recovery/resync so it is
	 * handled quite separately ... here.
	 *
	 * On each call to sync_request, we gather one chunk worth of
	 * destination stripes and flag them as expanding.
	 * Then we find all the source stripes and request reads.
	 * As the reads complete, handle_stripe will copy the data
	 * into the destination stripe and release that stripe.
	 */
L
Linus Torvalds 已提交
3573 3574
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
	struct stripe_head *sh;
3575
	int pd_idx, qd_idx;
3576
	sector_t first_sector, last_sector;
3577 3578 3579
	int raid_disks = conf->previous_raid_disks;
	int data_disks = raid_disks - conf->max_degraded;
	int new_data_disks = conf->raid_disks - conf->max_degraded;
3580 3581 3582 3583 3584 3585 3586 3587
	int i;
	int dd_idx;
	sector_t writepos, safepos, gap;

	if (sector_nr == 0 &&
	    conf->expand_progress != 0) {
		/* restarting in the middle, skip the initial sectors */
		sector_nr = conf->expand_progress;
3588
		sector_div(sector_nr, new_data_disks);
3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601
		*skipped = 1;
		return sector_nr;
	}

	/* we update the metadata when there is more than 3Meg
	 * in the block range (that is rather arbitrary, should
	 * probably be time based) or when the data about to be
	 * copied would over-write the source of the data at
	 * the front of the range.
	 * i.e. one new_stripe forward from expand_progress new_maps
	 * to after where expand_lo old_maps to
	 */
	writepos = conf->expand_progress +
3602 3603
		conf->chunk_size/512*(new_data_disks);
	sector_div(writepos, new_data_disks);
3604
	safepos = conf->expand_lo;
3605
	sector_div(safepos, data_disks);
3606 3607 3608
	gap = conf->expand_progress - conf->expand_lo;

	if (writepos >= safepos ||
3609
	    gap > (new_data_disks)*3000*2 /*3Meg*/) {
3610 3611 3612 3613
		/* Cannot proceed until we've updated the superblock... */
		wait_event(conf->wait_for_overlap,
			   atomic_read(&conf->reshape_stripes)==0);
		mddev->reshape_position = conf->expand_progress;
3614
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
3615
		md_wakeup_thread(mddev->thread);
3616
		wait_event(mddev->sb_wait, mddev->flags == 0 ||
3617 3618 3619 3620 3621 3622 3623 3624 3625 3626
			   kthread_should_stop());
		spin_lock_irq(&conf->device_lock);
		conf->expand_lo = mddev->reshape_position;
		spin_unlock_irq(&conf->device_lock);
		wake_up(&conf->wait_for_overlap);
	}

	for (i=0; i < conf->chunk_size/512; i+= STRIPE_SECTORS) {
		int j;
		int skipped = 0;
3627
		sh = get_active_stripe(conf, sector_nr+i, 0, 0);
3628 3629 3630 3631 3632 3633 3634 3635 3636
		set_bit(STRIPE_EXPANDING, &sh->state);
		atomic_inc(&conf->reshape_stripes);
		/* If any of this stripe is beyond the end of the old
		 * array, then we need to zero those blocks
		 */
		for (j=sh->disks; j--;) {
			sector_t s;
			if (j == sh->pd_idx)
				continue;
3637
			if (conf->level == 6 &&
3638
			    j == sh->qd_idx)
3639
				continue;
3640
			s = compute_blocknr(sh, j);
3641
			if (s < mddev->array_sectors) {
3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655
				skipped = 1;
				continue;
			}
			memset(page_address(sh->dev[j].page), 0, STRIPE_SIZE);
			set_bit(R5_Expanded, &sh->dev[j].flags);
			set_bit(R5_UPTODATE, &sh->dev[j].flags);
		}
		if (!skipped) {
			set_bit(STRIPE_EXPAND_READY, &sh->state);
			set_bit(STRIPE_HANDLE, &sh->state);
		}
		release_stripe(sh);
	}
	spin_lock_irq(&conf->device_lock);
N
NeilBrown 已提交
3656
	conf->expand_progress = (sector_nr + i) * new_data_disks;
3657 3658 3659 3660 3661 3662 3663
	spin_unlock_irq(&conf->device_lock);
	/* Ok, those stripe are ready. We can start scheduling
	 * reads on the source stripes.
	 * The source stripes are determined by mapping the first and last
	 * block on the destination stripes.
	 */
	first_sector =
3664
		raid5_compute_sector(conf, sector_nr*(new_data_disks),
3665
				     1, &dd_idx, &pd_idx, &qd_idx);
3666
	last_sector =
3667 3668
		raid5_compute_sector(conf, ((sector_nr+conf->chunk_size/512)
					    *(new_data_disks) - 1),
3669
				     1, &dd_idx, &pd_idx, &qd_idx);
A
Andre Noll 已提交
3670 3671
	if (last_sector >= mddev->dev_sectors)
		last_sector = mddev->dev_sectors - 1;
3672
	while (first_sector <= last_sector) {
3673
		sh = get_active_stripe(conf, first_sector, 1, 0);
3674 3675 3676 3677 3678
		set_bit(STRIPE_EXPAND_SOURCE, &sh->state);
		set_bit(STRIPE_HANDLE, &sh->state);
		release_stripe(sh);
		first_sector += STRIPE_SECTORS;
	}
3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697
	/* If this takes us to the resync_max point where we have to pause,
	 * then we need to write out the superblock.
	 */
	sector_nr += conf->chunk_size>>9;
	if (sector_nr >= mddev->resync_max) {
		/* Cannot proceed until we've updated the superblock... */
		wait_event(conf->wait_for_overlap,
			   atomic_read(&conf->reshape_stripes) == 0);
		mddev->reshape_position = conf->expand_progress;
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
		md_wakeup_thread(mddev->thread);
		wait_event(mddev->sb_wait,
			   !test_bit(MD_CHANGE_DEVS, &mddev->flags)
			   || kthread_should_stop());
		spin_lock_irq(&conf->device_lock);
		conf->expand_lo = mddev->reshape_position;
		spin_unlock_irq(&conf->device_lock);
		wake_up(&conf->wait_for_overlap);
	}
3698 3699 3700 3701 3702 3703 3704 3705
	return conf->chunk_size>>9;
}

/* FIXME go_faster isn't used */
static inline sector_t sync_request(mddev_t *mddev, sector_t sector_nr, int *skipped, int go_faster)
{
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
	struct stripe_head *sh;
A
Andre Noll 已提交
3706
	sector_t max_sector = mddev->dev_sectors;
3707
	int sync_blocks;
3708 3709
	int still_degraded = 0;
	int i;
L
Linus Torvalds 已提交
3710

3711
	if (sector_nr >= max_sector) {
L
Linus Torvalds 已提交
3712 3713
		/* just being told to finish up .. nothing much to do */
		unplug_slaves(mddev);
3714 3715 3716 3717
		if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery)) {
			end_reshape(conf);
			return 0;
		}
3718 3719 3720 3721

		if (mddev->curr_resync < max_sector) /* aborted */
			bitmap_end_sync(mddev->bitmap, mddev->curr_resync,
					&sync_blocks, 1);
3722
		else /* completed sync */
3723 3724 3725
			conf->fullsync = 0;
		bitmap_close_sync(mddev->bitmap);

L
Linus Torvalds 已提交
3726 3727
		return 0;
	}
3728

3729 3730
	if (test_bit(MD_RECOVERY_RESHAPE, &mddev->recovery))
		return reshape_request(mddev, sector_nr, skipped);
3731

3732 3733 3734 3735 3736 3737
	/* No need to check resync_max as we never do more than one
	 * stripe, and as resync_max will always be on a chunk boundary,
	 * if the check in md_do_sync didn't fire, there is no chance
	 * of overstepping resync_max here
	 */

3738
	/* if there is too many failed drives and we are trying
L
Linus Torvalds 已提交
3739 3740 3741
	 * to resync, then assert that we are finished, because there is
	 * nothing we can do.
	 */
3742
	if (mddev->degraded >= conf->max_degraded &&
3743
	    test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
A
Andre Noll 已提交
3744
		sector_t rv = mddev->dev_sectors - sector_nr;
3745
		*skipped = 1;
L
Linus Torvalds 已提交
3746 3747
		return rv;
	}
3748
	if (!bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, 1) &&
3749
	    !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery) &&
3750 3751 3752 3753 3754 3755
	    !conf->fullsync && sync_blocks >= STRIPE_SECTORS) {
		/* we can skip this block, and probably more */
		sync_blocks /= STRIPE_SECTORS;
		*skipped = 1;
		return sync_blocks * STRIPE_SECTORS; /* keep things rounded to whole stripes */
	}
L
Linus Torvalds 已提交
3756

N
NeilBrown 已提交
3757 3758 3759

	bitmap_cond_end_sync(mddev->bitmap, sector_nr);

3760
	sh = get_active_stripe(conf, sector_nr, 0, 1);
L
Linus Torvalds 已提交
3761
	if (sh == NULL) {
3762
		sh = get_active_stripe(conf, sector_nr, 0, 0);
L
Linus Torvalds 已提交
3763
		/* make sure we don't swamp the stripe cache if someone else
3764
		 * is trying to get access
L
Linus Torvalds 已提交
3765
		 */
3766
		schedule_timeout_uninterruptible(1);
L
Linus Torvalds 已提交
3767
	}
3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778
	/* Need to check if array will still be degraded after recovery/resync
	 * We don't need to check the 'failed' flag as when that gets set,
	 * recovery aborts.
	 */
	for (i=0; i<mddev->raid_disks; i++)
		if (conf->disks[i].rdev == NULL)
			still_degraded = 1;

	bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, still_degraded);

	spin_lock(&sh->lock);
L
Linus Torvalds 已提交
3779 3780 3781 3782
	set_bit(STRIPE_SYNCING, &sh->state);
	clear_bit(STRIPE_INSYNC, &sh->state);
	spin_unlock(&sh->lock);

3783 3784 3785
	/* wait for any blocked device to be handled */
	while(unlikely(!handle_stripe(sh, NULL)))
		;
L
Linus Torvalds 已提交
3786 3787 3788 3789 3790
	release_stripe(sh);

	return STRIPE_SECTORS;
}

3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803
static int  retry_aligned_read(raid5_conf_t *conf, struct bio *raid_bio)
{
	/* We may not be able to submit a whole bio at once as there
	 * may not be enough stripe_heads available.
	 * We cannot pre-allocate enough stripe_heads as we may need
	 * more than exist in the cache (if we allow ever large chunks).
	 * So we do one stripe head at a time and record in
	 * ->bi_hw_segments how many have been done.
	 *
	 * We *know* that this entire raid_bio is in one chunk, so
	 * it will be only one 'dd_idx' and only need one call to raid5_compute_sector.
	 */
	struct stripe_head *sh;
3804
	int dd_idx, pd_idx, qd_idx;
3805 3806 3807 3808 3809 3810
	sector_t sector, logical_sector, last_sector;
	int scnt = 0;
	int remaining;
	int handled = 0;

	logical_sector = raid_bio->bi_sector & ~((sector_t)STRIPE_SECTORS-1);
3811
	sector = raid5_compute_sector(conf, logical_sector,
3812
				      0, &dd_idx, &pd_idx, &qd_idx);
3813 3814 3815
	last_sector = raid_bio->bi_sector + (raid_bio->bi_size>>9);

	for (; logical_sector < last_sector;
3816 3817 3818
	     logical_sector += STRIPE_SECTORS,
		     sector += STRIPE_SECTORS,
		     scnt++) {
3819

3820
		if (scnt < raid5_bi_hw_segments(raid_bio))
3821 3822 3823
			/* already done this stripe */
			continue;

3824
		sh = get_active_stripe(conf, sector, 0, 1);
3825 3826 3827

		if (!sh) {
			/* failed to get a stripe - must wait */
3828
			raid5_set_bi_hw_segments(raid_bio, scnt);
3829 3830 3831 3832 3833
			conf->retry_read_aligned = raid_bio;
			return handled;
		}

		set_bit(R5_ReadError, &sh->dev[dd_idx].flags);
3834 3835
		if (!add_stripe_bio(sh, raid_bio, dd_idx, 0)) {
			release_stripe(sh);
3836
			raid5_set_bi_hw_segments(raid_bio, scnt);
3837 3838 3839 3840
			conf->retry_read_aligned = raid_bio;
			return handled;
		}

3841 3842 3843 3844 3845
		handle_stripe(sh, NULL);
		release_stripe(sh);
		handled++;
	}
	spin_lock_irq(&conf->device_lock);
3846
	remaining = raid5_dec_bi_phys_segments(raid_bio);
3847
	spin_unlock_irq(&conf->device_lock);
3848 3849
	if (remaining == 0)
		bio_endio(raid_bio, 0);
3850 3851 3852 3853 3854 3855 3856
	if (atomic_dec_and_test(&conf->active_aligned_reads))
		wake_up(&conf->wait_for_stripe);
	return handled;
}



L
Linus Torvalds 已提交
3857 3858 3859 3860 3861 3862 3863
/*
 * This is our raid5 kernel thread.
 *
 * We scan the hash table for stripes which can be handled now.
 * During the scan, completed stripes are saved for us by the interrupt
 * handler, so that they will not have to wait for our next wakeup.
 */
3864
static void raid5d(mddev_t *mddev)
L
Linus Torvalds 已提交
3865 3866 3867 3868 3869
{
	struct stripe_head *sh;
	raid5_conf_t *conf = mddev_to_conf(mddev);
	int handled;

3870
	pr_debug("+++ raid5d active\n");
L
Linus Torvalds 已提交
3871 3872 3873 3874 3875 3876

	md_check_recovery(mddev);

	handled = 0;
	spin_lock_irq(&conf->device_lock);
	while (1) {
3877
		struct bio *bio;
L
Linus Torvalds 已提交
3878

3879
		if (conf->seq_flush != conf->seq_write) {
3880
			int seq = conf->seq_flush;
3881
			spin_unlock_irq(&conf->device_lock);
3882
			bitmap_unplug(mddev->bitmap);
3883
			spin_lock_irq(&conf->device_lock);
3884 3885 3886 3887
			conf->seq_write = seq;
			activate_bit_delay(conf);
		}

3888 3889 3890 3891 3892 3893 3894 3895 3896 3897
		while ((bio = remove_bio_from_retry(conf))) {
			int ok;
			spin_unlock_irq(&conf->device_lock);
			ok = retry_aligned_read(conf, bio);
			spin_lock_irq(&conf->device_lock);
			if (!ok)
				break;
			handled++;
		}

3898 3899
		sh = __get_priority_stripe(conf);

3900
		if (!sh)
L
Linus Torvalds 已提交
3901 3902 3903 3904
			break;
		spin_unlock_irq(&conf->device_lock);
		
		handled++;
3905
		handle_stripe(sh, conf->spare_page);
L
Linus Torvalds 已提交
3906 3907 3908 3909
		release_stripe(sh);

		spin_lock_irq(&conf->device_lock);
	}
3910
	pr_debug("%d stripes handled\n", handled);
L
Linus Torvalds 已提交
3911 3912 3913

	spin_unlock_irq(&conf->device_lock);

3914
	async_tx_issue_pending_all();
L
Linus Torvalds 已提交
3915 3916
	unplug_slaves(mddev);

3917
	pr_debug("--- raid5d inactive\n");
L
Linus Torvalds 已提交
3918 3919
}

3920
static ssize_t
3921
raid5_show_stripe_cache_size(mddev_t *mddev, char *page)
3922
{
3923
	raid5_conf_t *conf = mddev_to_conf(mddev);
3924 3925 3926 3927
	if (conf)
		return sprintf(page, "%d\n", conf->max_nr_stripes);
	else
		return 0;
3928 3929 3930
}

static ssize_t
3931
raid5_store_stripe_cache_size(mddev_t *mddev, const char *page, size_t len)
3932
{
3933
	raid5_conf_t *conf = mddev_to_conf(mddev);
3934
	unsigned long new;
3935 3936
	int err;

3937 3938
	if (len >= PAGE_SIZE)
		return -EINVAL;
3939 3940
	if (!conf)
		return -ENODEV;
3941

3942
	if (strict_strtoul(page, 10, &new))
3943 3944 3945 3946 3947 3948 3949 3950 3951
		return -EINVAL;
	if (new <= 16 || new > 32768)
		return -EINVAL;
	while (new < conf->max_nr_stripes) {
		if (drop_one_stripe(conf))
			conf->max_nr_stripes--;
		else
			break;
	}
3952 3953 3954
	err = md_allow_write(mddev);
	if (err)
		return err;
3955 3956 3957 3958 3959 3960 3961
	while (new > conf->max_nr_stripes) {
		if (grow_one_stripe(conf))
			conf->max_nr_stripes++;
		else break;
	}
	return len;
}
3962

3963 3964 3965 3966
static struct md_sysfs_entry
raid5_stripecache_size = __ATTR(stripe_cache_size, S_IRUGO | S_IWUSR,
				raid5_show_stripe_cache_size,
				raid5_store_stripe_cache_size);
3967

3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981
static ssize_t
raid5_show_preread_threshold(mddev_t *mddev, char *page)
{
	raid5_conf_t *conf = mddev_to_conf(mddev);
	if (conf)
		return sprintf(page, "%d\n", conf->bypass_threshold);
	else
		return 0;
}

static ssize_t
raid5_store_preread_threshold(mddev_t *mddev, const char *page, size_t len)
{
	raid5_conf_t *conf = mddev_to_conf(mddev);
3982
	unsigned long new;
3983 3984 3985 3986 3987
	if (len >= PAGE_SIZE)
		return -EINVAL;
	if (!conf)
		return -ENODEV;

3988
	if (strict_strtoul(page, 10, &new))
3989
		return -EINVAL;
3990
	if (new > conf->max_nr_stripes)
3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001
		return -EINVAL;
	conf->bypass_threshold = new;
	return len;
}

static struct md_sysfs_entry
raid5_preread_bypass_threshold = __ATTR(preread_bypass_threshold,
					S_IRUGO | S_IWUSR,
					raid5_show_preread_threshold,
					raid5_store_preread_threshold);

4002
static ssize_t
4003
stripe_cache_active_show(mddev_t *mddev, char *page)
4004
{
4005
	raid5_conf_t *conf = mddev_to_conf(mddev);
4006 4007 4008 4009
	if (conf)
		return sprintf(page, "%d\n", atomic_read(&conf->active_stripes));
	else
		return 0;
4010 4011
}

4012 4013
static struct md_sysfs_entry
raid5_stripecache_active = __ATTR_RO(stripe_cache_active);
4014

4015
static struct attribute *raid5_attrs[] =  {
4016 4017
	&raid5_stripecache_size.attr,
	&raid5_stripecache_active.attr,
4018
	&raid5_preread_bypass_threshold.attr,
4019 4020
	NULL,
};
4021 4022 4023
static struct attribute_group raid5_attrs_group = {
	.name = NULL,
	.attrs = raid5_attrs,
4024 4025
};

4026
static int run(mddev_t *mddev)
L
Linus Torvalds 已提交
4027 4028 4029 4030 4031
{
	raid5_conf_t *conf;
	int raid_disk, memory;
	mdk_rdev_t *rdev;
	struct disk_info *disk;
4032
	int working_disks = 0;
L
Linus Torvalds 已提交
4033

4034 4035
	if (mddev->level != 5 && mddev->level != 4 && mddev->level != 6) {
		printk(KERN_ERR "raid5: %s: raid level not set to 4/5/6 (%d)\n",
N
NeilBrown 已提交
4036
		       mdname(mddev), mddev->level);
L
Linus Torvalds 已提交
4037 4038 4039
		return -EIO;
	}

4040 4041 4042 4043 4044 4045 4046
	if (mddev->chunk_size < PAGE_SIZE) {
		printk(KERN_ERR "md/raid5: chunk_size must be at least "
		       "PAGE_SIZE but %d < %ld\n",
		       mddev->chunk_size, PAGE_SIZE);
		return -EINVAL;
	}

4047 4048 4049 4050 4051 4052 4053 4054
	if (mddev->reshape_position != MaxSector) {
		/* Check that we can continue the reshape.
		 * Currently only disks can change, it must
		 * increase, and we must be past the point where
		 * a stripe over-writes itself
		 */
		sector_t here_new, here_old;
		int old_disks;
4055
		int max_degraded = (mddev->level == 5 ? 1 : 2);
4056 4057 4058 4059

		if (mddev->new_level != mddev->level ||
		    mddev->new_layout != mddev->layout ||
		    mddev->new_chunk != mddev->chunk_size) {
4060 4061
			printk(KERN_ERR "raid5: %s: unsupported reshape "
			       "required - aborting.\n",
4062 4063 4064 4065
			       mdname(mddev));
			return -EINVAL;
		}
		if (mddev->delta_disks <= 0) {
4066 4067
			printk(KERN_ERR "raid5: %s: unsupported reshape "
			       "(reduce disks) required - aborting.\n",
4068 4069 4070 4071 4072
			       mdname(mddev));
			return -EINVAL;
		}
		old_disks = mddev->raid_disks - mddev->delta_disks;
		/* reshape_position must be on a new-stripe boundary, and one
4073 4074
		 * further up in new geometry must map after here in old
		 * geometry.
4075 4076
		 */
		here_new = mddev->reshape_position;
4077 4078 4079 4080
		if (sector_div(here_new, (mddev->chunk_size>>9)*
			       (mddev->raid_disks - max_degraded))) {
			printk(KERN_ERR "raid5: reshape_position not "
			       "on a stripe boundary\n");
4081 4082 4083 4084
			return -EINVAL;
		}
		/* here_new is the stripe we will write to */
		here_old = mddev->reshape_position;
4085 4086 4087 4088
		sector_div(here_old, (mddev->chunk_size>>9)*
			   (old_disks-max_degraded));
		/* here_old is the first stripe that we might need to read
		 * from */
4089 4090
		if (here_new >= here_old) {
			/* Reading from the same stripe as writing to - bad */
4091 4092
			printk(KERN_ERR "raid5: reshape_position too early for "
			       "auto-recovery - aborting.\n");
4093 4094 4095 4096 4097 4098 4099
			return -EINVAL;
		}
		printk(KERN_INFO "raid5: reshape will continue\n");
		/* OK, we should be able to continue; */
	}


4100
	mddev->private = kzalloc(sizeof (raid5_conf_t), GFP_KERNEL);
L
Linus Torvalds 已提交
4101 4102
	if ((conf = mddev->private) == NULL)
		goto abort;
4103 4104 4105 4106 4107 4108 4109 4110
	if (mddev->reshape_position == MaxSector) {
		conf->previous_raid_disks = conf->raid_disks = mddev->raid_disks;
	} else {
		conf->raid_disks = mddev->raid_disks;
		conf->previous_raid_disks = mddev->raid_disks - mddev->delta_disks;
	}

	conf->disks = kzalloc(conf->raid_disks * sizeof(struct disk_info),
4111 4112 4113
			      GFP_KERNEL);
	if (!conf->disks)
		goto abort;
4114

L
Linus Torvalds 已提交
4115 4116
	conf->mddev = mddev;

4117
	if ((conf->stripe_hashtbl = kzalloc(PAGE_SIZE, GFP_KERNEL)) == NULL)
L
Linus Torvalds 已提交
4118 4119
		goto abort;

4120 4121 4122 4123 4124
	if (mddev->level == 6) {
		conf->spare_page = alloc_page(GFP_KERNEL);
		if (!conf->spare_page)
			goto abort;
	}
L
Linus Torvalds 已提交
4125
	spin_lock_init(&conf->device_lock);
4126
	mddev->queue->queue_lock = &conf->device_lock;
L
Linus Torvalds 已提交
4127 4128 4129
	init_waitqueue_head(&conf->wait_for_stripe);
	init_waitqueue_head(&conf->wait_for_overlap);
	INIT_LIST_HEAD(&conf->handle_list);
4130
	INIT_LIST_HEAD(&conf->hold_list);
L
Linus Torvalds 已提交
4131
	INIT_LIST_HEAD(&conf->delayed_list);
4132
	INIT_LIST_HEAD(&conf->bitmap_list);
L
Linus Torvalds 已提交
4133 4134 4135
	INIT_LIST_HEAD(&conf->inactive_list);
	atomic_set(&conf->active_stripes, 0);
	atomic_set(&conf->preread_active_stripes, 0);
4136
	atomic_set(&conf->active_aligned_reads, 0);
4137
	conf->bypass_threshold = BYPASS_THRESHOLD;
L
Linus Torvalds 已提交
4138

4139
	pr_debug("raid5: run(%s) called.\n", mdname(mddev));
L
Linus Torvalds 已提交
4140

4141
	list_for_each_entry(rdev, &mddev->disks, same_set) {
L
Linus Torvalds 已提交
4142
		raid_disk = rdev->raid_disk;
4143
		if (raid_disk >= conf->raid_disks
L
Linus Torvalds 已提交
4144 4145 4146 4147 4148 4149
		    || raid_disk < 0)
			continue;
		disk = conf->disks + raid_disk;

		disk->rdev = rdev;

4150
		if (test_bit(In_sync, &rdev->flags)) {
L
Linus Torvalds 已提交
4151 4152 4153 4154
			char b[BDEVNAME_SIZE];
			printk(KERN_INFO "raid5: device %s operational as raid"
				" disk %d\n", bdevname(rdev->bdev,b),
				raid_disk);
4155
			working_disks++;
4156 4157 4158
		} else
			/* Cannot rely on bitmap to complete recovery */
			conf->fullsync = 1;
L
Linus Torvalds 已提交
4159 4160 4161
	}

	/*
4162
	 * 0 for a fully functional array, 1 or 2 for a degraded array.
L
Linus Torvalds 已提交
4163
	 */
4164
	mddev->degraded = conf->raid_disks - working_disks;
L
Linus Torvalds 已提交
4165 4166 4167
	conf->mddev = mddev;
	conf->chunk_size = mddev->chunk_size;
	conf->level = mddev->level;
4168 4169 4170 4171
	if (conf->level == 6)
		conf->max_degraded = 2;
	else
		conf->max_degraded = 1;
L
Linus Torvalds 已提交
4172 4173
	conf->algorithm = mddev->layout;
	conf->max_nr_stripes = NR_STRIPES;
4174
	conf->expand_progress = mddev->reshape_position;
L
Linus Torvalds 已提交
4175 4176

	/* device size must be a multiple of chunk size */
A
Andre Noll 已提交
4177 4178
	mddev->dev_sectors &= ~(mddev->chunk_size / 512 - 1);
	mddev->resync_max_sectors = mddev->dev_sectors;
L
Linus Torvalds 已提交
4179

4180 4181 4182 4183 4184
	if (conf->level == 6 && conf->raid_disks < 4) {
		printk(KERN_ERR "raid6: not enough configured devices for %s (%d, minimum 4)\n",
		       mdname(mddev), conf->raid_disks);
		goto abort;
	}
L
Linus Torvalds 已提交
4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195
	if (!conf->chunk_size || conf->chunk_size % 4) {
		printk(KERN_ERR "raid5: invalid chunk size %d for %s\n",
			conf->chunk_size, mdname(mddev));
		goto abort;
	}
	if (conf->algorithm > ALGORITHM_RIGHT_SYMMETRIC) {
		printk(KERN_ERR 
			"raid5: unsupported parity algorithm %d for %s\n",
			conf->algorithm, mdname(mddev));
		goto abort;
	}
4196
	if (mddev->degraded > conf->max_degraded) {
L
Linus Torvalds 已提交
4197 4198
		printk(KERN_ERR "raid5: not enough operational devices for %s"
			" (%d/%d failed)\n",
4199
			mdname(mddev), mddev->degraded, conf->raid_disks);
L
Linus Torvalds 已提交
4200 4201 4202
		goto abort;
	}

4203
	if (mddev->degraded > 0 &&
L
Linus Torvalds 已提交
4204
	    mddev->recovery_cp != MaxSector) {
4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215
		if (mddev->ok_start_degraded)
			printk(KERN_WARNING
			       "raid5: starting dirty degraded array: %s"
			       "- data corruption possible.\n",
			       mdname(mddev));
		else {
			printk(KERN_ERR
			       "raid5: cannot start dirty degraded array for %s\n",
			       mdname(mddev));
			goto abort;
		}
L
Linus Torvalds 已提交
4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226
	}

	{
		mddev->thread = md_register_thread(raid5d, mddev, "%s_raid5");
		if (!mddev->thread) {
			printk(KERN_ERR 
				"raid5: couldn't allocate thread for %s\n",
				mdname(mddev));
			goto abort;
		}
	}
4227
	memory = conf->max_nr_stripes * (sizeof(struct stripe_head) +
L
Linus Torvalds 已提交
4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251
		 conf->raid_disks * ((sizeof(struct bio) + PAGE_SIZE))) / 1024;
	if (grow_stripes(conf, conf->max_nr_stripes)) {
		printk(KERN_ERR 
			"raid5: couldn't allocate %dkB for buffers\n", memory);
		shrink_stripes(conf);
		md_unregister_thread(mddev->thread);
		goto abort;
	} else
		printk(KERN_INFO "raid5: allocated %dkB for %s\n",
			memory, mdname(mddev));

	if (mddev->degraded == 0)
		printk("raid5: raid level %d set %s active with %d out of %d"
			" devices, algorithm %d\n", conf->level, mdname(mddev), 
			mddev->raid_disks-mddev->degraded, mddev->raid_disks,
			conf->algorithm);
	else
		printk(KERN_ALERT "raid5: raid level %d set %s active with %d"
			" out of %d devices, algorithm %d\n", conf->level,
			mdname(mddev), mddev->raid_disks - mddev->degraded,
			mddev->raid_disks, conf->algorithm);

	print_raid5_conf(conf);

4252 4253
	if (conf->expand_progress != MaxSector) {
		printk("...ok start reshape thread\n");
4254
		conf->expand_lo = conf->expand_progress;
4255 4256 4257 4258 4259 4260 4261 4262 4263
		atomic_set(&conf->reshape_stripes, 0);
		clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
		clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
		set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
		set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
		mddev->sync_thread = md_register_thread(md_do_sync, mddev,
							"%s_reshape");
	}

L
Linus Torvalds 已提交
4264
	/* read-ahead size must cover two whole stripes, which is
4265
	 * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
L
Linus Torvalds 已提交
4266 4267
	 */
	{
4268 4269
		int data_disks = conf->previous_raid_disks - conf->max_degraded;
		int stripe = data_disks *
4270
			(mddev->chunk_size / PAGE_SIZE);
L
Linus Torvalds 已提交
4271 4272 4273 4274 4275
		if (mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
			mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
	}

	/* Ok, everything is just fine now */
4276 4277 4278 4279
	if (sysfs_create_group(&mddev->kobj, &raid5_attrs_group))
		printk(KERN_WARNING
		       "raid5: failed to create sysfs attributes for %s\n",
		       mdname(mddev));
4280 4281

	mddev->queue->unplug_fn = raid5_unplug_device;
4282
	mddev->queue->backing_dev_info.congested_data = mddev;
4283
	mddev->queue->backing_dev_info.congested_fn = raid5_congested;
4284

A
Andre Noll 已提交
4285 4286
	mddev->array_sectors = mddev->dev_sectors *
		(conf->previous_raid_disks - conf->max_degraded);
4287

4288 4289
	blk_queue_merge_bvec(mddev->queue, raid5_mergeable_bvec);

L
Linus Torvalds 已提交
4290 4291 4292 4293
	return 0;
abort:
	if (conf) {
		print_raid5_conf(conf);
4294
		safe_put_page(conf->spare_page);
4295
		kfree(conf->disks);
4296
		kfree(conf->stripe_hashtbl);
L
Linus Torvalds 已提交
4297 4298 4299 4300 4301 4302 4303 4304 4305
		kfree(conf);
	}
	mddev->private = NULL;
	printk(KERN_ALERT "raid5: failed to run raid set %s\n", mdname(mddev));
	return -EIO;
}



4306
static int stop(mddev_t *mddev)
L
Linus Torvalds 已提交
4307 4308 4309 4310 4311 4312
{
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;

	md_unregister_thread(mddev->thread);
	mddev->thread = NULL;
	shrink_stripes(conf);
4313
	kfree(conf->stripe_hashtbl);
4314
	mddev->queue->backing_dev_info.congested_fn = NULL;
L
Linus Torvalds 已提交
4315
	blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
4316
	sysfs_remove_group(&mddev->kobj, &raid5_attrs_group);
4317
	kfree(conf->disks);
4318
	kfree(conf);
L
Linus Torvalds 已提交
4319 4320 4321 4322
	mddev->private = NULL;
	return 0;
}

4323
#ifdef DEBUG
4324
static void print_sh(struct seq_file *seq, struct stripe_head *sh)
L
Linus Torvalds 已提交
4325 4326 4327
{
	int i;

4328 4329 4330 4331 4332
	seq_printf(seq, "sh %llu, pd_idx %d, state %ld.\n",
		   (unsigned long long)sh->sector, sh->pd_idx, sh->state);
	seq_printf(seq, "sh %llu,  count %d.\n",
		   (unsigned long long)sh->sector, atomic_read(&sh->count));
	seq_printf(seq, "sh %llu, ", (unsigned long long)sh->sector);
4333
	for (i = 0; i < sh->disks; i++) {
4334 4335
		seq_printf(seq, "(cache%d: %p %ld) ",
			   i, sh->dev[i].page, sh->dev[i].flags);
L
Linus Torvalds 已提交
4336
	}
4337
	seq_printf(seq, "\n");
L
Linus Torvalds 已提交
4338 4339
}

4340
static void printall(struct seq_file *seq, raid5_conf_t *conf)
L
Linus Torvalds 已提交
4341 4342
{
	struct stripe_head *sh;
4343
	struct hlist_node *hn;
L
Linus Torvalds 已提交
4344 4345 4346 4347
	int i;

	spin_lock_irq(&conf->device_lock);
	for (i = 0; i < NR_HASH; i++) {
4348
		hlist_for_each_entry(sh, hn, &conf->stripe_hashtbl[i], hash) {
L
Linus Torvalds 已提交
4349 4350
			if (sh->raid_conf != conf)
				continue;
4351
			print_sh(seq, sh);
L
Linus Torvalds 已提交
4352 4353 4354 4355 4356 4357
		}
	}
	spin_unlock_irq(&conf->device_lock);
}
#endif

4358
static void status(struct seq_file *seq, mddev_t *mddev)
L
Linus Torvalds 已提交
4359 4360 4361 4362 4363
{
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
	int i;

	seq_printf (seq, " level %d, %dk chunk, algorithm %d", mddev->level, mddev->chunk_size >> 10, mddev->layout);
4364
	seq_printf (seq, " [%d/%d] [", conf->raid_disks, conf->raid_disks - mddev->degraded);
L
Linus Torvalds 已提交
4365 4366 4367
	for (i = 0; i < conf->raid_disks; i++)
		seq_printf (seq, "%s",
			       conf->disks[i].rdev &&
4368
			       test_bit(In_sync, &conf->disks[i].rdev->flags) ? "U" : "_");
L
Linus Torvalds 已提交
4369
	seq_printf (seq, "]");
4370
#ifdef DEBUG
4371 4372
	seq_printf (seq, "\n");
	printall(seq, conf);
L
Linus Torvalds 已提交
4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385
#endif
}

static void print_raid5_conf (raid5_conf_t *conf)
{
	int i;
	struct disk_info *tmp;

	printk("RAID5 conf printout:\n");
	if (!conf) {
		printk("(conf==NULL)\n");
		return;
	}
4386 4387
	printk(" --- rd:%d wd:%d\n", conf->raid_disks,
		 conf->raid_disks - conf->mddev->degraded);
L
Linus Torvalds 已提交
4388 4389 4390 4391 4392 4393

	for (i = 0; i < conf->raid_disks; i++) {
		char b[BDEVNAME_SIZE];
		tmp = conf->disks + i;
		if (tmp->rdev)
		printk(" disk %d, o:%d, dev:%s\n",
4394
			i, !test_bit(Faulty, &tmp->rdev->flags),
L
Linus Torvalds 已提交
4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407
			bdevname(tmp->rdev->bdev,b));
	}
}

static int raid5_spare_active(mddev_t *mddev)
{
	int i;
	raid5_conf_t *conf = mddev->private;
	struct disk_info *tmp;

	for (i = 0; i < conf->raid_disks; i++) {
		tmp = conf->disks + i;
		if (tmp->rdev
4408
		    && !test_bit(Faulty, &tmp->rdev->flags)
4409 4410 4411
		    && !test_and_set_bit(In_sync, &tmp->rdev->flags)) {
			unsigned long flags;
			spin_lock_irqsave(&conf->device_lock, flags);
L
Linus Torvalds 已提交
4412
			mddev->degraded--;
4413
			spin_unlock_irqrestore(&conf->device_lock, flags);
L
Linus Torvalds 已提交
4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429
		}
	}
	print_raid5_conf(conf);
	return 0;
}

static int raid5_remove_disk(mddev_t *mddev, int number)
{
	raid5_conf_t *conf = mddev->private;
	int err = 0;
	mdk_rdev_t *rdev;
	struct disk_info *p = conf->disks + number;

	print_raid5_conf(conf);
	rdev = p->rdev;
	if (rdev) {
4430
		if (test_bit(In_sync, &rdev->flags) ||
L
Linus Torvalds 已提交
4431 4432 4433 4434
		    atomic_read(&rdev->nr_pending)) {
			err = -EBUSY;
			goto abort;
		}
4435 4436 4437 4438 4439 4440 4441 4442
		/* Only remove non-faulty devices if recovery
		 * isn't possible.
		 */
		if (!test_bit(Faulty, &rdev->flags) &&
		    mddev->degraded <= conf->max_degraded) {
			err = -EBUSY;
			goto abort;
		}
L
Linus Torvalds 已提交
4443
		p->rdev = NULL;
4444
		synchronize_rcu();
L
Linus Torvalds 已提交
4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459
		if (atomic_read(&rdev->nr_pending)) {
			/* lost the race, try later */
			err = -EBUSY;
			p->rdev = rdev;
		}
	}
abort:

	print_raid5_conf(conf);
	return err;
}

static int raid5_add_disk(mddev_t *mddev, mdk_rdev_t *rdev)
{
	raid5_conf_t *conf = mddev->private;
4460
	int err = -EEXIST;
L
Linus Torvalds 已提交
4461 4462
	int disk;
	struct disk_info *p;
4463 4464
	int first = 0;
	int last = conf->raid_disks - 1;
L
Linus Torvalds 已提交
4465

4466
	if (mddev->degraded > conf->max_degraded)
L
Linus Torvalds 已提交
4467
		/* no point adding a device */
4468
		return -EINVAL;
L
Linus Torvalds 已提交
4469

4470 4471
	if (rdev->raid_disk >= 0)
		first = last = rdev->raid_disk;
L
Linus Torvalds 已提交
4472 4473

	/*
4474 4475
	 * find the disk ... but prefer rdev->saved_raid_disk
	 * if possible.
L
Linus Torvalds 已提交
4476
	 */
4477
	if (rdev->saved_raid_disk >= 0 &&
4478
	    rdev->saved_raid_disk >= first &&
4479 4480 4481
	    conf->disks[rdev->saved_raid_disk].rdev == NULL)
		disk = rdev->saved_raid_disk;
	else
4482 4483
		disk = first;
	for ( ; disk <= last ; disk++)
L
Linus Torvalds 已提交
4484
		if ((p=conf->disks + disk)->rdev == NULL) {
4485
			clear_bit(In_sync, &rdev->flags);
L
Linus Torvalds 已提交
4486
			rdev->raid_disk = disk;
4487
			err = 0;
4488 4489
			if (rdev->saved_raid_disk != disk)
				conf->fullsync = 1;
4490
			rcu_assign_pointer(p->rdev, rdev);
L
Linus Torvalds 已提交
4491 4492 4493
			break;
		}
	print_raid5_conf(conf);
4494
	return err;
L
Linus Torvalds 已提交
4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505
}

static int raid5_resize(mddev_t *mddev, sector_t sectors)
{
	/* no resync is happening, and there is enough space
	 * on all devices, so we can resize.
	 * We need to make sure resync covers any new space.
	 * If the array is shrinking we should possibly wait until
	 * any io in the removed space completes, but it hardly seems
	 * worth it.
	 */
4506 4507
	raid5_conf_t *conf = mddev_to_conf(mddev);

L
Linus Torvalds 已提交
4508
	sectors &= ~((sector_t)mddev->chunk_size/512 - 1);
4509 4510 4511
	mddev->array_sectors = sectors * (mddev->raid_disks
					  - conf->max_degraded);
	set_capacity(mddev->gendisk, mddev->array_sectors);
4512
	mddev->changed = 1;
A
Andre Noll 已提交
4513 4514
	if (sectors > mddev->dev_sectors && mddev->recovery_cp == MaxSector) {
		mddev->recovery_cp = mddev->dev_sectors;
L
Linus Torvalds 已提交
4515 4516
		set_bit(MD_RECOVERY_NEEDED, &mddev->recovery);
	}
A
Andre Noll 已提交
4517
	mddev->dev_sectors = sectors;
4518
	mddev->resync_max_sectors = sectors;
L
Linus Torvalds 已提交
4519 4520 4521
	return 0;
}

4522
#ifdef CONFIG_MD_RAID5_RESHAPE
4523
static int raid5_check_reshape(mddev_t *mddev)
4524 4525 4526 4527
{
	raid5_conf_t *conf = mddev_to_conf(mddev);
	int err;

4528 4529 4530 4531
	if (mddev->delta_disks < 0 ||
	    mddev->new_level != mddev->level)
		return -EINVAL; /* Cannot shrink array or change level yet */
	if (mddev->delta_disks == 0)
4532
		return 0; /* nothing to do */
4533 4534 4535
	if (mddev->bitmap)
		/* Cannot grow a bitmap yet */
		return -EBUSY;
4536 4537 4538 4539 4540 4541 4542 4543 4544

	/* Can only proceed if there are plenty of stripe_heads.
	 * We need a minimum of one full stripe,, and for sensible progress
	 * it is best to have about 4 times that.
	 * If we require 4 times, then the default 256 4K stripe_heads will
	 * allow for chunk sizes up to 256K, which is probably OK.
	 * If the chunk size is greater, user-space should request more
	 * stripe_heads first.
	 */
4545 4546
	if ((mddev->chunk_size / STRIPE_SIZE) * 4 > conf->max_nr_stripes ||
	    (mddev->new_chunk / STRIPE_SIZE) * 4 > conf->max_nr_stripes) {
4547 4548 4549 4550 4551
		printk(KERN_WARNING "raid5: reshape: not enough stripes.  Needed %lu\n",
		       (mddev->chunk_size / STRIPE_SIZE)*4);
		return -ENOSPC;
	}

4552 4553 4554 4555
	err = resize_stripes(conf, conf->raid_disks + mddev->delta_disks);
	if (err)
		return err;

4556 4557
	if (mddev->degraded > conf->max_degraded)
		return -EINVAL;
4558 4559 4560 4561 4562 4563 4564 4565 4566 4567
	/* looks like we might be able to manage this */
	return 0;
}

static int raid5_start_reshape(mddev_t *mddev)
{
	raid5_conf_t *conf = mddev_to_conf(mddev);
	mdk_rdev_t *rdev;
	int spares = 0;
	int added_devices = 0;
4568
	unsigned long flags;
4569

4570
	if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
4571 4572
		return -EBUSY;

4573
	list_for_each_entry(rdev, &mddev->disks, same_set)
4574 4575 4576
		if (rdev->raid_disk < 0 &&
		    !test_bit(Faulty, &rdev->flags))
			spares++;
4577

4578
	if (spares - mddev->degraded < mddev->delta_disks - conf->max_degraded)
4579 4580 4581 4582 4583
		/* Not enough devices even to make a degraded array
		 * of that size
		 */
		return -EINVAL;

4584
	atomic_set(&conf->reshape_stripes, 0);
4585 4586
	spin_lock_irq(&conf->device_lock);
	conf->previous_raid_disks = conf->raid_disks;
4587
	conf->raid_disks += mddev->delta_disks;
4588
	conf->expand_progress = 0;
4589
	conf->expand_lo = 0;
4590 4591 4592 4593 4594
	spin_unlock_irq(&conf->device_lock);

	/* Add some new drives, as many as will fit.
	 * We know there are enough to make the newly sized array work.
	 */
4595
	list_for_each_entry(rdev, &mddev->disks, same_set)
4596 4597
		if (rdev->raid_disk < 0 &&
		    !test_bit(Faulty, &rdev->flags)) {
4598
			if (raid5_add_disk(mddev, rdev) == 0) {
4599 4600 4601
				char nm[20];
				set_bit(In_sync, &rdev->flags);
				added_devices++;
4602
				rdev->recovery_offset = 0;
4603
				sprintf(nm, "rd%d", rdev->raid_disk);
4604 4605 4606 4607 4608 4609
				if (sysfs_create_link(&mddev->kobj,
						      &rdev->kobj, nm))
					printk(KERN_WARNING
					       "raid5: failed to create "
					       " link %s for %s\n",
					       nm, mdname(mddev));
4610 4611 4612 4613
			} else
				break;
		}

4614
	spin_lock_irqsave(&conf->device_lock, flags);
4615
	mddev->degraded = (conf->raid_disks - conf->previous_raid_disks) - added_devices;
4616
	spin_unlock_irqrestore(&conf->device_lock, flags);
4617
	mddev->raid_disks = conf->raid_disks;
4618
	mddev->reshape_position = 0;
4619
	set_bit(MD_CHANGE_DEVS, &mddev->flags);
4620

4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644
	clear_bit(MD_RECOVERY_SYNC, &mddev->recovery);
	clear_bit(MD_RECOVERY_CHECK, &mddev->recovery);
	set_bit(MD_RECOVERY_RESHAPE, &mddev->recovery);
	set_bit(MD_RECOVERY_RUNNING, &mddev->recovery);
	mddev->sync_thread = md_register_thread(md_do_sync, mddev,
						"%s_reshape");
	if (!mddev->sync_thread) {
		mddev->recovery = 0;
		spin_lock_irq(&conf->device_lock);
		mddev->raid_disks = conf->raid_disks = conf->previous_raid_disks;
		conf->expand_progress = MaxSector;
		spin_unlock_irq(&conf->device_lock);
		return -EAGAIN;
	}
	md_wakeup_thread(mddev->sync_thread);
	md_new_event(mddev);
	return 0;
}
#endif

static void end_reshape(raid5_conf_t *conf)
{
	struct block_device *bdev;

4645
	if (!test_bit(MD_RECOVERY_INTR, &conf->mddev->recovery)) {
A
Andre Noll 已提交
4646
		conf->mddev->array_sectors = conf->mddev->dev_sectors *
4647
			(conf->raid_disks - conf->max_degraded);
4648
		set_capacity(conf->mddev->gendisk, conf->mddev->array_sectors);
4649
		conf->mddev->changed = 1;
4650 4651 4652 4653

		bdev = bdget_disk(conf->mddev->gendisk, 0);
		if (bdev) {
			mutex_lock(&bdev->bd_inode->i_mutex);
4654 4655
			i_size_write(bdev->bd_inode,
				     (loff_t)conf->mddev->array_sectors << 9);
4656 4657 4658 4659 4660 4661 4662
			mutex_unlock(&bdev->bd_inode->i_mutex);
			bdput(bdev);
		}
		spin_lock_irq(&conf->device_lock);
		conf->expand_progress = MaxSector;
		spin_unlock_irq(&conf->device_lock);
		conf->mddev->reshape_position = MaxSector;
4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673

		/* read-ahead size must cover two whole stripes, which is
		 * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
		 */
		{
			int data_disks = conf->previous_raid_disks - conf->max_degraded;
			int stripe = data_disks *
				(conf->mddev->chunk_size / PAGE_SIZE);
			if (conf->mddev->queue->backing_dev_info.ra_pages < 2 * stripe)
				conf->mddev->queue->backing_dev_info.ra_pages = 2 * stripe;
		}
4674 4675 4676
	}
}

4677 4678 4679 4680 4681
static void raid5_quiesce(mddev_t *mddev, int state)
{
	raid5_conf_t *conf = mddev_to_conf(mddev);

	switch(state) {
4682 4683 4684 4685
	case 2: /* resume for a suspend */
		wake_up(&conf->wait_for_overlap);
		break;

4686 4687 4688 4689
	case 1: /* stop all writes */
		spin_lock_irq(&conf->device_lock);
		conf->quiesce = 1;
		wait_event_lock_irq(conf->wait_for_stripe,
4690 4691
				    atomic_read(&conf->active_stripes) == 0 &&
				    atomic_read(&conf->active_aligned_reads) == 0,
4692 4693 4694 4695 4696 4697 4698 4699
				    conf->device_lock, /* nothing */);
		spin_unlock_irq(&conf->device_lock);
		break;

	case 0: /* re-enable writes */
		spin_lock_irq(&conf->device_lock);
		conf->quiesce = 0;
		wake_up(&conf->wait_for_stripe);
4700
		wake_up(&conf->wait_for_overlap);
4701 4702 4703 4704
		spin_unlock_irq(&conf->device_lock);
		break;
	}
}
4705

4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720
static struct mdk_personality raid6_personality =
{
	.name		= "raid6",
	.level		= 6,
	.owner		= THIS_MODULE,
	.make_request	= make_request,
	.run		= run,
	.stop		= stop,
	.status		= status,
	.error_handler	= error,
	.hot_add_disk	= raid5_add_disk,
	.hot_remove_disk= raid5_remove_disk,
	.spare_active	= raid5_spare_active,
	.sync_request	= sync_request,
	.resize		= raid5_resize,
4721 4722 4723 4724
#ifdef CONFIG_MD_RAID5_RESHAPE
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
#endif
4725 4726
	.quiesce	= raid5_quiesce,
};
4727
static struct mdk_personality raid5_personality =
L
Linus Torvalds 已提交
4728 4729
{
	.name		= "raid5",
4730
	.level		= 5,
L
Linus Torvalds 已提交
4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741
	.owner		= THIS_MODULE,
	.make_request	= make_request,
	.run		= run,
	.stop		= stop,
	.status		= status,
	.error_handler	= error,
	.hot_add_disk	= raid5_add_disk,
	.hot_remove_disk= raid5_remove_disk,
	.spare_active	= raid5_spare_active,
	.sync_request	= sync_request,
	.resize		= raid5_resize,
4742
#ifdef CONFIG_MD_RAID5_RESHAPE
4743 4744
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
4745
#endif
4746
	.quiesce	= raid5_quiesce,
L
Linus Torvalds 已提交
4747 4748
};

4749
static struct mdk_personality raid4_personality =
L
Linus Torvalds 已提交
4750
{
4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763
	.name		= "raid4",
	.level		= 4,
	.owner		= THIS_MODULE,
	.make_request	= make_request,
	.run		= run,
	.stop		= stop,
	.status		= status,
	.error_handler	= error,
	.hot_add_disk	= raid5_add_disk,
	.hot_remove_disk= raid5_remove_disk,
	.spare_active	= raid5_spare_active,
	.sync_request	= sync_request,
	.resize		= raid5_resize,
4764 4765 4766 4767
#ifdef CONFIG_MD_RAID5_RESHAPE
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
#endif
4768 4769 4770 4771 4772
	.quiesce	= raid5_quiesce,
};

static int __init raid5_init(void)
{
4773 4774 4775 4776 4777 4778
	int e;

	e = raid6_select_algo();
	if ( e )
		return e;
	register_md_personality(&raid6_personality);
4779 4780 4781
	register_md_personality(&raid5_personality);
	register_md_personality(&raid4_personality);
	return 0;
L
Linus Torvalds 已提交
4782 4783
}

4784
static void raid5_exit(void)
L
Linus Torvalds 已提交
4785
{
4786
	unregister_md_personality(&raid6_personality);
4787 4788
	unregister_md_personality(&raid5_personality);
	unregister_md_personality(&raid4_personality);
L
Linus Torvalds 已提交
4789 4790 4791 4792 4793 4794
}

module_init(raid5_init);
module_exit(raid5_exit);
MODULE_LICENSE("GPL");
MODULE_ALIAS("md-personality-4"); /* RAID5 */
4795 4796
MODULE_ALIAS("md-raid5");
MODULE_ALIAS("md-raid4");
4797 4798
MODULE_ALIAS("md-level-5");
MODULE_ALIAS("md-level-4");
4799 4800 4801 4802 4803 4804 4805
MODULE_ALIAS("md-personality-8"); /* RAID6 */
MODULE_ALIAS("md-raid6");
MODULE_ALIAS("md-level-6");

/* This used to be two separate modules, they were: */
MODULE_ALIAS("raid5");
MODULE_ALIAS("raid6");