raid5.c 133.2 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 void stripe_set_idx(sector_t stripe, raid5_conf_t *conf, int previous,
			    struct stripe_head *sh);
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;
L
Linus Torvalds 已提交
309

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

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

	remove_hash(sh);
319

320
	sh->disks = previous ? conf->previous_raid_disks : conf->raid_disks;
L
Linus Torvalds 已提交
321
	sh->sector = sector;
322
	stripe_set_idx(sector, conf, previous, sh);
L
Linus Torvalds 已提交
323 324
	sh->state = 0;

325 326

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

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

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

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

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

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

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

	spin_lock_irq(&conf->device_lock);

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

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

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

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

420
static void ops_run_io(struct stripe_head *sh, struct stripe_head_state *s)
421 422 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
{
	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) {
455
			if (s->syncing || s->expanding || s->expanded)
456 457
				md_sync_acct(rdev->bdev, STRIPE_SECTORS);

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

460 461
			bi->bi_bdev = rdev->bdev;
			pr_debug("%s: for %llu schedule op %ld on disc %d\n",
462
				__func__, (unsigned long long)sh->sector,
463 464 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
				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,
526
					ASYNC_TX_DEP_ACK,
527 528 529 530
					tx, NULL, NULL);
			else
				tx = async_memcpy(bio_page, page, b_offset,
					page_offset, clen,
531
					ASYNC_TX_DEP_ACK,
532 533 534 535 536 537 538 539 540 541 542 543 544 545 546
					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;
547
	int i;
548

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

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

		/* acknowledge completion of a biofill operation */
558 559
		/* and check if we need to reply to a read request,
		 * new R5_Wantfill requests are held off until
560
		 * !STRIPE_BIOFILL_RUN
561 562
		 */
		if (test_and_clear_bit(R5_Wantfill, &dev->flags)) {
563 564 565 566 567 568 569 570
			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);
571
				if (!raid5_dec_bi_phys_segments(rbi)) {
572 573 574 575 576 577 578
					rbi->bi_next = return_bi;
					return_bi = rbi;
				}
				rbi = rbi2;
			}
		}
	}
579 580
	spin_unlock_irq(&conf->device_lock);
	clear_bit(STRIPE_BIOFILL_RUN, &sh->state);
581 582 583

	return_io(return_bi);

584
	set_bit(STRIPE_HANDLE, &sh->state);
585 586 587 588 589 590 591 592 593
	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;

594
	pr_debug("%s: stripe %llu\n", __func__,
595 596 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
		(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];

625
	pr_debug("%s: stripe %llu\n", __func__,
626 627 628 629 630
		(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);
631 632 633
	clear_bit(STRIPE_COMPUTE_RUN, &sh->state);
	if (sh->check_state == check_state_compute_run)
		sh->check_state = check_state_compute_result;
634 635 636 637
	set_bit(STRIPE_HANDLE, &sh->state);
	release_stripe(sh);
}

638
static struct dma_async_tx_descriptor *ops_run_compute5(struct stripe_head *sh)
639 640 641 642 643 644 645 646 647 648 649 650
{
	/* 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",
651
		__func__, (unsigned long long)sh->sector, target);
652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674
	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;

675
	pr_debug("%s: stripe %llu\n", __func__,
676 677 678 679 680 681 682 683 684 685 686 687 688 689
		(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;

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

	for (i = disks; i--; ) {
		struct r5dev *dev = &sh->dev[i];
		/* Only process blocks that are known to be uptodate */
696
		if (test_bit(R5_Wantdrain, &dev->flags))
697 698 699 700 701 702 703 704 705 706 707
			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 *
708
ops_run_biodrain(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
709 710
{
	int disks = sh->disks;
711
	int i;
712

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

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

720
		if (test_and_clear_bit(R5_Wantdrain, &dev->flags)) {
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746
			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;

747
	pr_debug("%s: stripe %llu\n", __func__,
748 749 750 751 752 753 754 755
		(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);
	}

756 757 758 759 760 761 762 763
	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;
	}
764 765 766 767 768 769

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

static void
770
ops_run_postxor(struct stripe_head *sh, struct dma_async_tx_descriptor *tx)
771 772 773 774 775 776 777
{
	/* 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;
778
	int prexor = 0;
779 780
	unsigned long flags;

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

	/* check if prexor is active which means only process blocks
	 * that are part of a read-modify-write (written)
	 */
787 788
	if (sh->reconstruct_state == reconstruct_state_prexor_drain_run) {
		prexor = 1;
789 790 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
		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,
817
			flags, tx, ops_complete_postxor, sh);
818 819
	} else
		tx = async_xor(xor_dest, xor_srcs, 0, count, STRIPE_SIZE,
820
			flags, tx, ops_complete_postxor, sh);
821 822 823 824 825 826
}

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

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

830
	sh->check_state = check_state_check_result;
831 832 833 834 835 836 837 838 839 840 841 842 843 844
	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;

845
	pr_debug("%s: stripe %llu\n", __func__,
846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861
		(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);
}

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

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

872 873 874 875 876 877
	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);
	}
878

879
	if (test_bit(STRIPE_OP_PREXOR, &ops_request))
880 881
		tx = ops_run_prexor(sh, tx);

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

887
	if (test_bit(STRIPE_OP_POSTXOR, &ops_request))
888
		ops_run_postxor(sh, tx);
889

890
	if (test_bit(STRIPE_OP_CHECK, &ops_request))
891 892 893 894 895 896 897 898 899 900
		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);
		}
}

901
static int grow_one_stripe(raid5_conf_t *conf)
L
Linus Torvalds 已提交
902 903
{
	struct stripe_head *sh;
904 905 906 907 908 909 910 911 912 913 914 915
	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;
	}
916
	sh->disks = conf->raid_disks;
917 918 919 920 921 922 923 924 925 926
	/* 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)
{
927
	struct kmem_cache *sc;
L
Linus Torvalds 已提交
928 929
	int devs = conf->raid_disks;

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

#ifdef CONFIG_MD_RAID5_RESHAPE
947 948 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
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;
975
	int err;
976
	struct kmem_cache *sc;
977 978 979 980 981
	int i;

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

982 983 984
	err = md_allow_write(conf->mddev);
	if (err)
		return err;
985

986 987 988
	/* Step 1 */
	sc = kmem_cache_create(conf->cache_name[1-conf->active_name],
			       sizeof(struct stripe_head)+(newsize-1)*sizeof(struct r5dev),
989
			       0, 0, NULL);
990 991 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
	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,
1024
				    unplug_slaves(conf->mddev)
1025 1026 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
			);
		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;
}
1071
#endif
L
Linus Torvalds 已提交
1072

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

1077 1078 1079 1080 1081
	spin_lock_irq(&conf->device_lock);
	sh = get_free_stripe(conf);
	spin_unlock_irq(&conf->device_lock);
	if (!sh)
		return 0;
1082
	BUG_ON(atomic_read(&sh->count));
1083
	shrink_buffers(sh, conf->pool_size);
1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
	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 已提交
1094 1095
	if (conf->slab_cache)
		kmem_cache_destroy(conf->slab_cache);
L
Linus Torvalds 已提交
1096 1097 1098
	conf->slab_cache = NULL;
}

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


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

1113 1114
	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 已提交
1115 1116 1117
		uptodate);
	if (i == disks) {
		BUG();
1118
		return;
L
Linus Torvalds 已提交
1119 1120 1121 1122
	}

	if (uptodate) {
		set_bit(R5_UPTODATE, &sh->dev[i].flags);
1123
		if (test_bit(R5_ReadError, &sh->dev[i].flags)) {
1124
			rdev = conf->disks[i].rdev;
1125 1126 1127 1128 1129 1130
			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));
1131 1132 1133
			clear_bit(R5_ReadError, &sh->dev[i].flags);
			clear_bit(R5_ReWrite, &sh->dev[i].flags);
		}
1134 1135
		if (atomic_read(&conf->disks[i].rdev->read_errors))
			atomic_set(&conf->disks[i].rdev->read_errors, 0);
L
Linus Torvalds 已提交
1136
	} else {
1137
		const char *bdn = bdevname(conf->disks[i].rdev->bdev, b);
1138
		int retry = 0;
1139 1140
		rdev = conf->disks[i].rdev;

L
Linus Torvalds 已提交
1141
		clear_bit(R5_UPTODATE, &sh->dev[i].flags);
1142
		atomic_inc(&rdev->read_errors);
1143
		if (conf->mddev->degraded)
1144 1145 1146 1147 1148 1149 1150
			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);
1151
		else if (test_bit(R5_ReWrite, &sh->dev[i].flags))
1152
			/* Oh, no!!! */
1153 1154 1155 1156 1157 1158 1159
			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);
1160
		else if (atomic_read(&rdev->read_errors)
1161
			 > conf->max_nr_stripes)
N
NeilBrown 已提交
1162
			printk(KERN_WARNING
1163 1164
			       "raid5:%s: Too many read errors, failing device %s.\n",
			       mdname(conf->mddev), bdn);
1165 1166 1167 1168 1169
		else
			retry = 1;
		if (retry)
			set_bit(R5_ReadError, &sh->dev[i].flags);
		else {
1170 1171
			clear_bit(R5_ReadError, &sh->dev[i].flags);
			clear_bit(R5_ReWrite, &sh->dev[i].flags);
1172
			md_error(conf->mddev, rdev);
1173
		}
L
Linus Torvalds 已提交
1174 1175 1176 1177 1178 1179 1180
	}
	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);
}

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

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

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

	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);
1207
	release_stripe(sh);
L
Linus Torvalds 已提交
1208 1209 1210 1211 1212
}


static sector_t compute_blocknr(struct stripe_head *sh, int i);
	
1213
static void raid5_build_block(struct stripe_head *sh, int i)
L
Linus Torvalds 已提交
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228
{
	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;
1229
	dev->sector = compute_blocknr(sh, i);
L
Linus Torvalds 已提交
1230 1231 1232 1233 1234 1235
}

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

1238
	if (!test_bit(Faulty, &rdev->flags)) {
1239
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
1240 1241 1242
		if (test_and_clear_bit(In_sync, &rdev->flags)) {
			unsigned long flags;
			spin_lock_irqsave(&conf->device_lock, flags);
L
Linus Torvalds 已提交
1243
			mddev->degraded++;
1244
			spin_unlock_irqrestore(&conf->device_lock, flags);
L
Linus Torvalds 已提交
1245 1246 1247
			/*
			 * if recovery was running, make sure it aborts.
			 */
1248
			set_bit(MD_RECOVERY_INTR, &mddev->recovery);
L
Linus Torvalds 已提交
1249
		}
1250
		set_bit(Faulty, &rdev->flags);
1251 1252 1253 1254
		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 已提交
1255
	}
1256
}
L
Linus Torvalds 已提交
1257 1258 1259 1260 1261

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

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

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

1367 1368 1369 1370
	if (sh) {
		sh->pd_idx = pd_idx;
		sh->qd_idx = qd_idx;
	}
L
Linus Torvalds 已提交
1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
	/*
	 * 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;
1382 1383
	int raid_disks = sh->disks;
	int data_disks = raid_disks - conf->max_degraded;
L
Linus Torvalds 已提交
1384 1385 1386 1387
	sector_t new_sector = sh->sector, check;
	int sectors_per_chunk = conf->chunk_size >> 9;
	sector_t stripe;
	int chunk_offset;
1388
	int chunk_number, dummy1, dd_idx = i;
L
Linus Torvalds 已提交
1389
	sector_t r_sector;
1390
	struct stripe_head sh2;
L
Linus Torvalds 已提交
1391

1392

L
Linus Torvalds 已提交
1393 1394 1395 1396
	chunk_offset = sector_div(new_sector, sectors_per_chunk);
	stripe = new_sector;
	BUG_ON(new_sector != stripe);

1397 1398 1399 1400 1401 1402
	if (i == sh->pd_idx)
		return 0;
	switch(conf->level) {
	case 4: break;
	case 5:
		switch (conf->algorithm) {
L
Linus Torvalds 已提交
1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414
		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 已提交
1415
			printk(KERN_ERR "raid5: unsupported algorithm %d\n",
1416 1417 1418 1419
			       conf->algorithm);
		}
		break;
	case 6:
1420
		if (i == sh->qd_idx)
1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441
			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:
1442 1443
			printk(KERN_CRIT "raid6: unsupported algorithm %d\n",
			       conf->algorithm);
1444 1445
		}
		break;
L
Linus Torvalds 已提交
1446 1447 1448 1449 1450
	}

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

1451 1452
	check = raid5_compute_sector(conf, r_sector,
				     (raid_disks != conf->raid_disks),
1453 1454 1455
				     &dummy1, &sh2);
	if (check != sh->sector || dummy1 != dd_idx || sh2.pd_idx != sh->pd_idx
		|| sh2.qd_idx != sh->qd_idx) {
N
NeilBrown 已提交
1456
		printk(KERN_ERR "compute_blocknr: map not correct\n");
L
Linus Torvalds 已提交
1457 1458 1459 1460 1461 1462 1463 1464
		return 0;
	}
	return r_sector;
}



/*
1465 1466 1467 1468 1469
 * 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 已提交
1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497
 */
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;
1498

L
Linus Torvalds 已提交
1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512
		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 已提交
1513 1514 1515 1516 1517
#define check_xor()	do {						  \
				if (count == MAX_XOR_BLOCKS) {		  \
				xor_blocks(count, STRIPE_SIZE, dest, ptr);\
				count = 0;				  \
			   }						  \
L
Linus Torvalds 已提交
1518 1519
			} while(0)

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

1528 1529 1530
	pd_idx = sh->pd_idx;
	qd_idx = sh->qd_idx;
	d0_idx = raid6_d0(sh);
1531

1532
	pr_debug("compute_parity, stripe %llu, method %d\n",
1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
		(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 已提交
1547
				BUG_ON(sh->dev[i].written);
1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567
				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);
		}

1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583
	/* 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);
1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604

	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)
{
1605
	int i, count, disks = sh->disks;
D
Dan Williams 已提交
1606
	void *ptr[MAX_XOR_BLOCKS], *dest, *p;
1607
	int qd_idx = sh->qd_idx;
1608

1609
	pr_debug("compute_block_1, stripe %llu, idx %d\n",
1610 1611 1612 1613 1614 1615
		(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 已提交
1616 1617 1618
		dest = page_address(sh->dev[dd_idx].page);
		if (!nozero) memset(dest, 0, STRIPE_SIZE);
		count = 0;
1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631
		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 已提交
1632 1633
		if (count)
			xor_blocks(count, STRIPE_SIZE, dest, ptr);
1634 1635 1636 1637 1638 1639 1640 1641
		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)
{
1642
	int i, count, disks = sh->disks;
1643 1644 1645 1646
	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];
1647

1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660
	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);
1661 1662 1663 1664

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

1665
	pr_debug("compute_block_2, stripe %llu, idx %d,%d (%d,%d)\n",
1666 1667
		 (unsigned long long)sh->sector, dd_idx1, dd_idx2,
		 faila, failb);
1668 1669 1670 1671 1672 1673 1674 1675 1676

	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 */
1677 1678 1679
			compute_block_1(sh, ((dd_idx1 == sh->qd_idx) ?
					     dd_idx2 : dd_idx1),
					0);
1680 1681 1682 1683 1684
			compute_parity6(sh, UPDATE_PARITY); /* Is this necessary? */
			return;
		}
	}

1685 1686 1687 1688 1689 1690 1691
	/* 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);
1692
	}
1693 1694 1695 1696

	/* 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);
1697 1698
}

1699
static void
1700
schedule_reconstruction5(struct stripe_head *sh, struct stripe_head_state *s,
1701
			 int rcw, int expand)
1702 1703 1704 1705 1706 1707 1708 1709 1710
{
	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) {
1711 1712 1713 1714
			sh->reconstruct_state = reconstruct_state_drain_run;
			set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
		} else
			sh->reconstruct_state = reconstruct_state_run;
1715

1716
		set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1717 1718 1719 1720 1721 1722

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

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

1736
		sh->reconstruct_state = reconstruct_state_prexor_drain_run;
1737 1738 1739
		set_bit(STRIPE_OP_PREXOR, &s->ops_request);
		set_bit(STRIPE_OP_BIODRAIN, &s->ops_request);
		set_bit(STRIPE_OP_POSTXOR, &s->ops_request);
1740 1741 1742 1743 1744 1745 1746 1747

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

			if (dev->towrite &&
			    (test_bit(R5_UPTODATE, &dev->flags) ||
1748 1749
			     test_bit(R5_Wantcompute, &dev->flags))) {
				set_bit(R5_Wantdrain, &dev->flags);
1750 1751
				set_bit(R5_LOCKED, &dev->flags);
				clear_bit(R5_UPTODATE, &dev->flags);
1752
				s->locked++;
1753 1754 1755 1756 1757 1758 1759 1760 1761
			}
		}
	}

	/* 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);
1762
	s->locked++;
1763

1764
	pr_debug("%s: stripe %llu locked: %d ops_request: %lx\n",
1765
		__func__, (unsigned long long)sh->sector,
1766
		s->locked, s->ops_request);
1767
}
1768

L
Linus Torvalds 已提交
1769 1770
/*
 * Each stripe/dev can have one or more bion attached.
1771
 * toread/towrite point to the first in a chain.
L
Linus Torvalds 已提交
1772 1773 1774 1775 1776 1777
 * 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;
1778
	int firstwrite=0;
L
Linus Torvalds 已提交
1779

1780
	pr_debug("adding bh b#%llu to stripe s#%llu\n",
L
Linus Torvalds 已提交
1781 1782 1783 1784 1785 1786
		(unsigned long long)bi->bi_sector,
		(unsigned long long)sh->sector);


	spin_lock(&sh->lock);
	spin_lock_irq(&conf->device_lock);
1787
	if (forwrite) {
L
Linus Torvalds 已提交
1788
		bip = &sh->dev[dd_idx].towrite;
1789 1790 1791
		if (*bip == NULL && sh->dev[dd_idx].written == NULL)
			firstwrite = 1;
	} else
L
Linus Torvalds 已提交
1792 1793 1794 1795 1796 1797 1798 1799 1800
		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;

1801
	BUG_ON(*bip && bi->bi_next && (*bip) != bi->bi_next);
L
Linus Torvalds 已提交
1802 1803 1804
	if (*bip)
		bi->bi_next = *bip;
	*bip = bi;
1805
	bi->bi_phys_segments++;
L
Linus Torvalds 已提交
1806 1807 1808
	spin_unlock_irq(&conf->device_lock);
	spin_unlock(&sh->lock);

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

1813 1814 1815
	if (conf->mddev->bitmap && firstwrite) {
		bitmap_startwrite(conf->mddev->bitmap, sh->sector,
				  STRIPE_SECTORS, 0);
1816
		sh->bm_seq = conf->seq_flush+1;
1817 1818 1819
		set_bit(STRIPE_BIT_DELAY, &sh->state);
	}

L
Linus Torvalds 已提交
1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841
	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;
}

1842 1843
static void end_reshape(raid5_conf_t *conf);

1844 1845 1846 1847 1848 1849 1850
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);
}

1851 1852
static void stripe_set_idx(sector_t stripe, raid5_conf_t *conf, int previous,
			    struct stripe_head *sh)
1853 1854
{
	int sectors_per_chunk = conf->chunk_size >> 9;
1855
	int dd_idx;
1856
	int chunk_offset = sector_div(stripe, sectors_per_chunk);
1857
	int disks = previous ? conf->previous_raid_disks : conf->raid_disks;
1858

1859 1860
	raid5_compute_sector(conf,
			     stripe * (disks - conf->max_degraded)
1861
			     *sectors_per_chunk + chunk_offset,
1862
			     previous,
1863
			     &dd_idx, sh);
1864 1865
}

1866
static void
1867
handle_failed_stripe(raid5_conf_t *conf, struct stripe_head *sh,
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 1897 1898 1899 1900
				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);
1901
			if (!raid5_dec_bi_phys_segments(bi)) {
1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915
				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);
1916
			if (!raid5_dec_bi_phys_segments(bi)) {
1917 1918 1919 1920 1921 1922 1923
				md_write_end(conf->mddev);
				bi->bi_next = *return_bi;
				*return_bi = bi;
			}
			bi = bi2;
		}

1924 1925 1926 1927 1928 1929
		/* 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))) {
1930 1931 1932 1933 1934 1935 1936 1937 1938 1939
			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);
1940
				if (!raid5_dec_bi_phys_segments(bi)) {
1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952
					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);
	}

1953 1954 1955
	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);
1956 1957
}

1958 1959 1960 1961 1962
/* 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
1963
 */
1964 1965
static int fetch_block5(struct stripe_head *sh, struct stripe_head_state *s,
			int disk_idx, int disks)
1966 1967 1968 1969 1970 1971
{
	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) &&
1972 1973 1974 1975 1976 1977 1978 1979
	    !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)))))) {
1980 1981
		/* We would like to get this block, possibly by computing it,
		 * otherwise read it if the backing disk is insync
1982 1983
		 */
		if ((s->uptodate == disks - 1) &&
1984
		    (s->failed && disk_idx == s->failed_num)) {
1985 1986
			set_bit(STRIPE_COMPUTE_RUN, &sh->state);
			set_bit(STRIPE_OP_COMPUTE_BLK, &s->ops_request);
1987 1988 1989 1990 1991 1992 1993 1994 1995 1996
			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++;
1997
			return 1; /* uptodate + compute == disks */
1998
		} else if (test_bit(R5_Insync, &dev->flags)) {
1999 2000 2001 2002 2003 2004 2005 2006
			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);
		}
	}

2007
	return 0;
2008 2009
}

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

	/* 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
	 */
2022
	if (!test_bit(STRIPE_COMPUTE_RUN, &sh->state) && !sh->check_state &&
2023
	    !sh->reconstruct_state)
2024
		for (i = disks; i--; )
2025
			if (fetch_block5(sh, s, i, disks))
2026
				break;
2027 2028 2029
	set_bit(STRIPE_HANDLE, &sh->state);
}

2030
static void handle_stripe_fill6(struct stripe_head *sh,
2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050
			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
			 */
2051 2052 2053
			if ((s->uptodate == disks - 1) &&
			    (s->failed && (i == r6s->failed_num[0] ||
					   i == r6s->failed_num[1]))) {
2054
				pr_debug("Computing stripe %llu block %d\n",
2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070
				       (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);
2071
				pr_debug("Computing stripe %llu blocks %d,%d\n",
2072 2073 2074 2075 2076 2077 2078 2079
				       (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++;
2080
				pr_debug("Reading block %d (sync=%d)\n",
2081 2082 2083 2084 2085 2086 2087 2088
					i, s->syncing);
			}
		}
	}
	set_bit(STRIPE_HANDLE, &sh->state);
}


2089
/* handle_stripe_clean_event
2090 2091 2092 2093
 * 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.
 */
2094
static void handle_stripe_clean_event(raid5_conf_t *conf,
2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107
	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;
2108
				pr_debug("Return write for disc %d\n", i);
2109 2110 2111 2112 2113 2114
				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);
2115
					if (!raid5_dec_bi_phys_segments(wbi)) {
2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132
						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);
			}
		}
2133 2134 2135 2136

	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);
2137 2138
}

2139
static void handle_stripe_dirtying5(raid5_conf_t *conf,
2140 2141 2142 2143 2144 2145 2146 2147
		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) &&
2148 2149
		    !(test_bit(R5_UPTODATE, &dev->flags) ||
		      test_bit(R5_Wantcompute, &dev->flags))) {
2150 2151 2152 2153 2154 2155 2156 2157
			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) &&
2158 2159 2160
		    !(test_bit(R5_UPTODATE, &dev->flags) ||
		    test_bit(R5_Wantcompute, &dev->flags))) {
			if (test_bit(R5_Insync, &dev->flags)) rcw++;
2161 2162 2163 2164
			else
				rcw += 2*disks;
		}
	}
2165
	pr_debug("for sector %llu, rmw=%d rcw=%d\n",
2166 2167 2168 2169 2170 2171 2172 2173
		(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) &&
2174 2175
			    !(test_bit(R5_UPTODATE, &dev->flags) ||
			    test_bit(R5_Wantcompute, &dev->flags)) &&
2176 2177 2178
			    test_bit(R5_Insync, &dev->flags)) {
				if (
				  test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2179
					pr_debug("Read_old block "
2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196
						"%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) &&
2197 2198
			    !(test_bit(R5_UPTODATE, &dev->flags) ||
			    test_bit(R5_Wantcompute, &dev->flags)) &&
2199 2200 2201
			    test_bit(R5_Insync, &dev->flags)) {
				if (
				  test_bit(STRIPE_PREREAD_ACTIVE, &sh->state)) {
2202
					pr_debug("Read_old block "
2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215
						"%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
	 */
2216 2217 2218 2219 2220 2221 2222
	/* 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.
	 */
2223 2224 2225
	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)))
2226
		schedule_reconstruction5(sh, s, rcw == 0, 0);
2227 2228
}

2229
static void handle_stripe_dirtying6(raid5_conf_t *conf,
2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244
		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 {
2245
				pr_debug("raid6: must_compute: "
2246 2247 2248 2249 2250
					"disk %d flags=%#lx\n", i, dev->flags);
				must_compute++;
			}
		}
	}
2251
	pr_debug("for sector %llu, rcw=%d, must_compute=%d\n",
2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265
	       (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)) {
2266
					pr_debug("Read_old stripe %llu "
2267 2268 2269 2270 2271 2272
						"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 {
2273
					pr_debug("Request delayed stripe %llu "
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 2299 2300 2301 2302
						"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();
			}
		}

2303
		pr_debug("Computing parity for stripe %llu\n",
2304 2305 2306 2307 2308
			(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)) {
2309
				pr_debug("Writing stripe %llu block %d\n",
2310 2311 2312 2313
				       (unsigned long long)sh->sector, i);
				s->locked++;
				set_bit(R5_Wantwrite, &sh->dev[i].flags);
			}
2314 2315 2316
		if (s->locked == disks)
			if (!test_and_set_bit(STRIPE_FULL_WRITE, &sh->state))
				atomic_inc(&conf->pending_full_writes);
2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331
		/* 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)
{
2332
	struct r5dev *dev = NULL;
2333

2334
	set_bit(STRIPE_HANDLE, &sh->state);
2335

2336 2337 2338
	switch (sh->check_state) {
	case check_state_idle:
		/* start a new check operation if there are no failures */
2339 2340
		if (s->failed == 0) {
			BUG_ON(s->uptodate != disks);
2341 2342
			sh->check_state = check_state_run;
			set_bit(STRIPE_OP_CHECK, &s->ops_request);
2343 2344
			clear_bit(R5_UPTODATE, &sh->dev[sh->pd_idx].flags);
			s->uptodate--;
2345
			break;
2346
		}
2347 2348 2349 2350 2351 2352 2353 2354 2355 2356
		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 已提交
2357

2358 2359 2360 2361 2362
		/* 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);
2363
		s->locked++;
2364
		set_bit(R5_Wantwrite, &dev->flags);
2365

2366 2367
		clear_bit(STRIPE_DEGRADED, &sh->state);
		set_bit(STRIPE_INSYNC, &sh->state);
2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395
		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;
2396
				set_bit(STRIPE_COMPUTE_RUN, &sh->state);
2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411
				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();
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 2513 2514 2515 2516
	}
}


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.
	 */
2517
	struct dma_async_tx_descriptor *tx = NULL;
2518 2519
	clear_bit(STRIPE_EXPAND_SOURCE, &sh->state);
	for (i = 0; i < sh->disks; i++)
2520
		if (i != sh->pd_idx && (!r6s || i != r6s->qd_idx)) {
2521
			int dd_idx, j;
2522 2523 2524
			struct stripe_head *sh2;

			sector_t bn = compute_blocknr(sh, i);
2525 2526
			sector_t s = raid5_compute_sector(conf, bn, 0,
							  &dd_idx, NULL);
2527
			sh2 = get_active_stripe(conf, s, 0, 1);
2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539
			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;
			}
2540 2541 2542 2543 2544 2545

			/* 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);

2546 2547 2548 2549
			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 &&
2550
				    (!r6s || j != sh2->qd_idx) &&
2551 2552 2553 2554 2555 2556 2557
				    !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);
2558

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

2567

L
Linus Torvalds 已提交
2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583
/*
 * 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.
 *
 */
2584

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

2595
	memset(&s, 0, sizeof(s));
2596 2597 2598 2599
	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 已提交
2600 2601 2602 2603 2604

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

2605 2606 2607
	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 已提交
2608

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

2616 2617 2618 2619 2620 2621 2622
		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
2623
		 * ops_complete_biofill is guaranteed to be inactive
2624 2625
		 */
		if (test_bit(R5_UPTODATE, &dev->flags) && dev->toread &&
2626
		    !test_bit(STRIPE_BIOFILL_RUN, &sh->state))
2627
			set_bit(R5_Wantfill, &dev->flags);
L
Linus Torvalds 已提交
2628 2629

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

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

2665
	if (unlikely(blocked_rdev)) {
2666 2667 2668 2669 2670 2671 2672 2673
		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;
2674 2675
	}

2676 2677 2678 2679
	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);
	}
2680

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

	/* 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];
2700 2701 2702 2703 2704
	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)))
2705
		handle_stripe_clean_event(conf, sh, disks, &return_bi);
L
Linus Torvalds 已提交
2706 2707 2708 2709 2710

	/* 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.
	 */
2711
	if (s.to_read || s.non_overwrite ||
2712
	    (s.syncing && (s.uptodate + s.compute < disks)) || s.expanding)
2713
		handle_stripe_fill5(sh, &s, disks);
L
Linus Torvalds 已提交
2714

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

		/* 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);
2735 2736
				if (prexor)
					continue;
2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755
				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.
	 */
2756
	if (s.to_write && !sh->reconstruct_state && !sh->check_state)
2757
		handle_stripe_dirtying5(conf, sh, &s, disks);
L
Linus Torvalds 已提交
2758 2759

	/* maybe we need to check and possibly fix the parity for this stripe
2760 2761 2762
	 * 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 已提交
2763
	 */
2764 2765
	if (sh->check_state ||
	    (s.syncing && s.locked == 0 &&
2766
	     !test_bit(STRIPE_COMPUTE_RUN, &sh->state) &&
2767
	     !test_bit(STRIPE_INSYNC, &sh->state)))
2768
		handle_parity_checks5(conf, sh, &s, disks);
2769

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

	/* If the failed drive is just a ReadError, then we might need to progress
	 * the repair/check process
	 */
2778 2779 2780 2781
	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)
2782
		) {
2783
		dev = &sh->dev[s.failed_num];
2784 2785 2786 2787
		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);
2788
			s.locked++;
2789 2790 2791 2792
		} else {
			/* let's read it back */
			set_bit(R5_Wantread, &dev->flags);
			set_bit(R5_LOCKED, &dev->flags);
2793
			s.locked++;
2794 2795 2796
		}
	}

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

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

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

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

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

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

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

2837
	return_io(return_bi);
2838 2839

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

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

2853
	r6s.qd_idx = sh->qd_idx;
2854
	pr_debug("handling stripe %llu, state=%#lx cnt=%d, "
2855 2856 2857 2858
		"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));
2859

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

2864 2865 2866
	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);
2867
	/* Now to look around and see what can be done */
L
Linus Torvalds 已提交
2868 2869

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

2875
		pr_debug("check %d: state 0x%lx read %p write %p written %p\n",
2876 2877 2878 2879
			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;
2880
			pr_debug("Return read for disc %d\n", i);
2881 2882 2883 2884 2885 2886 2887 2888 2889 2890
			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);
2891
				if (!raid5_dec_bi_phys_segments(rbi)) {
2892 2893 2894 2895 2896 2897 2898
					rbi->bi_next = return_bi;
					return_bi = rbi;
				}
				spin_unlock_irq(&conf->device_lock);
				rbi = rbi2;
			}
		}
L
Linus Torvalds 已提交
2899

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

2904

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

	if (unlikely(blocked_rdev)) {
2936 2937 2938 2939 2940 2941 2942 2943
		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;
2944
	}
2945

2946
	pr_debug("locked=%d uptodate=%d to_read=%d"
2947
	       " to_write=%d failed=%d failed_num=%d,%d\n",
2948 2949 2950 2951
	       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
2952
	 */
2953
	if (s.failed > 2 && s.to_read+s.to_write+s.written)
2954
		handle_failed_stripe(conf, sh, &s, disks, &return_bi);
2955
	if (s.failed > 2 && s.syncing) {
2956 2957
		md_done_sync(conf->mddev, STRIPE_SECTORS,0);
		clear_bit(STRIPE_SYNCING, &sh->state);
2958
		s.syncing = 0;
2959 2960 2961 2962 2963 2964 2965
	}

	/*
	 * might be able to return some write requests if the parity blocks
	 * are safe, or on a failed drive
	 */
	pdev = &sh->dev[pd_idx];
2966 2967 2968 2969 2970 2971 2972 2973
	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)
2974
			     && !test_bit(R5_LOCKED, &pdev->flags)
2975 2976
			     && test_bit(R5_UPTODATE, &pdev->flags)))) &&
	     ( r6s.q_failed || ((test_bit(R5_Insync, &qdev->flags)
2977
			     && !test_bit(R5_LOCKED, &qdev->flags)
2978
			     && test_bit(R5_UPTODATE, &qdev->flags)))))
2979
		handle_stripe_clean_event(conf, sh, disks, &return_bi);
2980 2981 2982 2983 2984

	/* 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.
	 */
2985 2986
	if (s.to_read || s.non_overwrite || (s.to_write && s.failed) ||
	    (s.syncing && (s.uptodate < disks)) || s.expanding)
2987
		handle_stripe_fill6(sh, &s, &r6s, disks);
2988 2989

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

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

3000
	if (s.syncing && s.locked == 0 && test_bit(STRIPE_INSYNC, &sh->state)) {
3001 3002 3003 3004 3005 3006 3007
		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
	 */
3008 3009 3010
	if (s.failed <= 2 && !conf->mddev->ro)
		for (i = 0; i < s.failed; i++) {
			dev = &sh->dev[r6s.failed_num[i]];
3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025
			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);
				}
			}
		}
3026

3027
	if (s.expanded && test_bit(STRIPE_EXPANDING, &sh->state)) {
3028 3029
		/* Need to write out all blocks after computing P&Q */
		sh->disks = conf->raid_disks;
3030
		stripe_set_idx(sh->sector, conf, 0, sh);
3031 3032 3033
		compute_parity6(sh, RECONSTRUCT_WRITE);
		for (i = conf->raid_disks ; i-- ;  ) {
			set_bit(R5_LOCKED, &sh->dev[i].flags);
3034
			s.locked++;
3035 3036 3037
			set_bit(R5_Wantwrite, &sh->dev[i].flags);
		}
		clear_bit(STRIPE_EXPANDING, &sh->state);
3038
	} else if (s.expanded) {
3039 3040 3041 3042 3043 3044
		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);
	}

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

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

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

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

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

	return blocked_rdev == NULL;
3061 3062
}

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



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);
3085
			list_add_tail(&sh->lru, &conf->hold_list);
3086
		}
3087 3088
	} else
		blk_plug_device(conf->mddev->queue);
3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113
}

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)) {
3114
			struct request_queue *r_queue = bdev_get_queue(rdev->bdev);
3115 3116 3117 3118

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

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

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

3128
static void raid5_unplug_device(struct request_queue *q)
3129 3130 3131 3132 3133 3134 3135 3136 3137 3138
{
	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);
3139
	}
L
Linus Torvalds 已提交
3140 3141 3142 3143 3144 3145 3146
	md_wakeup_thread(mddev->thread);

	spin_unlock_irqrestore(&conf->device_lock, flags);

	unplug_slaves(mddev);
}

3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164
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;
}

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

3178
	if ((bvm->bi_rw & 1) == WRITE)
3179 3180 3181 3182 3183 3184 3185 3186 3187 3188
		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;
}

3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199

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);
}

3200 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
/*
 *  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) {
3229
		conf->retry_read_aligned_list = bi->bi_next;
3230
		bi->bi_next = NULL;
3231 3232 3233 3234
		/*
		 * this sets the active strip count to 1 and the processed
		 * strip count to zero (upper 8 bits)
		 */
3235 3236 3237 3238 3239 3240 3241
		bi->bi_phys_segments = 1; /* biased count of active stripes */
	}

	return bi;
}


3242 3243 3244 3245 3246 3247
/*
 *  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..
 */
3248
static void raid5_align_endio(struct bio *bi, int error)
3249 3250
{
	struct bio* raid_bi  = bi->bi_private;
3251 3252 3253 3254 3255
	mddev_t *mddev;
	raid5_conf_t *conf;
	int uptodate = test_bit(BIO_UPTODATE, &bi->bi_flags);
	mdk_rdev_t *rdev;

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

	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) {
3266
		bio_endio(raid_bi, 0);
3267 3268
		if (atomic_dec_and_test(&conf->active_aligned_reads))
			wake_up(&conf->wait_for_stripe);
3269
		return;
3270 3271 3272
	}


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

	add_bio_to_retry(raid_bi, conf);
3276 3277
}

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

	if ((bi->bi_size>>9) > q->max_sectors)
		return 0;
	blk_recount_segments(q, bi);
3285
	if (bi->bi_phys_segments > q->max_phys_segments)
3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297
		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;
}


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

	if (!in_chunk_boundary(mddev, raid_bio)) {
3307
		pr_debug("chunk_aligned_read : non aligned\n");
3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324
		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
	 */
3325 3326
	align_bi->bi_sector =  raid5_compute_sector(conf, raid_bio->bi_sector,
						    0,
3327
						    &dd_idx, NULL);
3328 3329 3330 3331 3332 3333

	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();
3334 3335 3336 3337 3338
		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;

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

3346 3347 3348 3349 3350 3351 3352
		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);

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

3362 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
/* __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;
}
3414

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

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

3431
	md_write_start(mddev, bi);
3432

T
Tejun Heo 已提交
3433 3434 3435 3436 3437
	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 已提交
3438

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

L
Linus Torvalds 已提交
3444 3445 3446 3447
	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 */
3448

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

3454
	retry:
3455
		previous = 0;
3456
		prepare_to_wait(&conf->wait_for_overlap, &w, TASK_UNINTERRUPTIBLE);
3457 3458 3459
		if (likely(conf->expand_progress == MaxSector))
			disks = conf->raid_disks;
		else {
3460 3461 3462 3463 3464 3465 3466 3467
			/* 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.
			 */
3468 3469
			spin_lock_irq(&conf->device_lock);
			disks = conf->raid_disks;
3470
			if (logical_sector >= conf->expand_progress) {
3471
				disks = conf->previous_raid_disks;
3472 3473
				previous = 1;
			} else {
3474 3475 3476 3477 3478 3479
				if (logical_sector >= conf->expand_lo) {
					spin_unlock_irq(&conf->device_lock);
					schedule();
					goto retry;
				}
			}
3480 3481
			spin_unlock_irq(&conf->device_lock);
		}
3482 3483
		data_disks = disks - conf->max_degraded;

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

3491 3492
		sh = get_active_stripe(conf, new_sector, previous,
				       (bi->bi_rw&RWA_MASK));
L
Linus Torvalds 已提交
3493
		if (sh) {
3494 3495
			if (unlikely(conf->expand_progress != MaxSector)) {
				/* expansion might have moved on while waiting for a
3496 3497 3498 3499 3500 3501
				 * 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.
3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514
				 */
				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;
				}
			}
3515 3516 3517 3518 3519 3520 3521 3522 3523
			/* 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;
			}
3524 3525 3526 3527 3528

			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 已提交
3529 3530 3531 3532 3533 3534 3535 3536
				 * and wait a while
				 */
				raid5_unplug_device(mddev->queue);
				release_stripe(sh);
				schedule();
				goto retry;
			}
			finish_wait(&conf->wait_for_overlap, &w);
3537 3538
			set_bit(STRIPE_HANDLE, &sh->state);
			clear_bit(STRIPE_DELAYED, &sh->state);
L
Linus Torvalds 已提交
3539 3540 3541 3542 3543 3544 3545 3546 3547 3548
			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);
3549
	remaining = raid5_dec_bi_phys_segments(bi);
3550 3551
	spin_unlock_irq(&conf->device_lock);
	if (remaining == 0) {
L
Linus Torvalds 已提交
3552

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

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

3561
static sector_t reshape_request(mddev_t *mddev, sector_t sector_nr, int *skipped)
L
Linus Torvalds 已提交
3562
{
3563 3564 3565 3566 3567 3568 3569 3570 3571
	/* 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 已提交
3572 3573
	raid5_conf_t *conf = (raid5_conf_t *) mddev->private;
	struct stripe_head *sh;
3574
	sector_t first_sector, last_sector;
3575 3576 3577
	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;
3578 3579 3580 3581 3582 3583 3584 3585
	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;
3586
		sector_div(sector_nr, new_data_disks);
3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599
		*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 +
3600 3601
		conf->chunk_size/512*(new_data_disks);
	sector_div(writepos, new_data_disks);
3602
	safepos = conf->expand_lo;
3603
	sector_div(safepos, data_disks);
3604 3605 3606
	gap = conf->expand_progress - conf->expand_lo;

	if (writepos >= safepos ||
3607
	    gap > (new_data_disks)*3000*2 /*3Meg*/) {
3608 3609 3610 3611
		/* 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;
3612
		set_bit(MD_CHANGE_DEVS, &mddev->flags);
3613
		md_wakeup_thread(mddev->thread);
3614
		wait_event(mddev->sb_wait, mddev->flags == 0 ||
3615 3616 3617 3618 3619 3620 3621 3622 3623 3624
			   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;
3625
		sh = get_active_stripe(conf, sector_nr+i, 0, 0);
3626 3627 3628 3629 3630 3631 3632 3633 3634
		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;
3635
			if (conf->level == 6 &&
3636
			    j == sh->qd_idx)
3637
				continue;
3638
			s = compute_blocknr(sh, j);
3639
			if (s < mddev->array_sectors) {
3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653
				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 已提交
3654
	conf->expand_progress = (sector_nr + i) * new_data_disks;
3655 3656 3657 3658 3659 3660 3661
	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 =
3662
		raid5_compute_sector(conf, sector_nr*(new_data_disks),
3663
				     1, &dd_idx, NULL);
3664
	last_sector =
3665 3666
		raid5_compute_sector(conf, ((sector_nr+conf->chunk_size/512)
					    *(new_data_disks) - 1),
3667
				     1, &dd_idx, NULL);
A
Andre Noll 已提交
3668 3669
	if (last_sector >= mddev->dev_sectors)
		last_sector = mddev->dev_sectors - 1;
3670
	while (first_sector <= last_sector) {
3671
		sh = get_active_stripe(conf, first_sector, 1, 0);
3672 3673 3674 3675 3676
		set_bit(STRIPE_EXPAND_SOURCE, &sh->state);
		set_bit(STRIPE_HANDLE, &sh->state);
		release_stripe(sh);
		first_sector += STRIPE_SECTORS;
	}
3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695
	/* 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);
	}
3696 3697 3698 3699 3700 3701 3702 3703
	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 已提交
3704
	sector_t max_sector = mddev->dev_sectors;
3705
	int sync_blocks;
3706 3707
	int still_degraded = 0;
	int i;
L
Linus Torvalds 已提交
3708

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

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

L
Linus Torvalds 已提交
3724 3725
		return 0;
	}
3726

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

3730 3731 3732 3733 3734 3735
	/* 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
	 */

3736
	/* if there is too many failed drives and we are trying
L
Linus Torvalds 已提交
3737 3738 3739
	 * to resync, then assert that we are finished, because there is
	 * nothing we can do.
	 */
3740
	if (mddev->degraded >= conf->max_degraded &&
3741
	    test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
A
Andre Noll 已提交
3742
		sector_t rv = mddev->dev_sectors - sector_nr;
3743
		*skipped = 1;
L
Linus Torvalds 已提交
3744 3745
		return rv;
	}
3746
	if (!bitmap_start_sync(mddev->bitmap, sector_nr, &sync_blocks, 1) &&
3747
	    !test_bit(MD_RECOVERY_REQUESTED, &mddev->recovery) &&
3748 3749 3750 3751 3752 3753
	    !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 已提交
3754

N
NeilBrown 已提交
3755 3756 3757

	bitmap_cond_end_sync(mddev->bitmap, sector_nr);

3758
	sh = get_active_stripe(conf, sector_nr, 0, 1);
L
Linus Torvalds 已提交
3759
	if (sh == NULL) {
3760
		sh = get_active_stripe(conf, sector_nr, 0, 0);
L
Linus Torvalds 已提交
3761
		/* make sure we don't swamp the stripe cache if someone else
3762
		 * is trying to get access
L
Linus Torvalds 已提交
3763
		 */
3764
		schedule_timeout_uninterruptible(1);
L
Linus Torvalds 已提交
3765
	}
3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776
	/* 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 已提交
3777 3778 3779 3780
	set_bit(STRIPE_SYNCING, &sh->state);
	clear_bit(STRIPE_INSYNC, &sh->state);
	spin_unlock(&sh->lock);

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

	return STRIPE_SECTORS;
}

3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801
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;
3802
	int dd_idx;
3803 3804 3805 3806 3807 3808
	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);
3809
	sector = raid5_compute_sector(conf, logical_sector,
3810
				      0, &dd_idx, NULL);
3811 3812 3813
	last_sector = raid_bio->bi_sector + (raid_bio->bi_size>>9);

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

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

3822
		sh = get_active_stripe(conf, sector, 0, 1);
3823 3824 3825

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

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

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



L
Linus Torvalds 已提交
3855 3856 3857 3858 3859 3860 3861
/*
 * 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.
 */
3862
static void raid5d(mddev_t *mddev)
L
Linus Torvalds 已提交
3863 3864 3865 3866 3867
{
	struct stripe_head *sh;
	raid5_conf_t *conf = mddev_to_conf(mddev);
	int handled;

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

	md_check_recovery(mddev);

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

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

3886 3887 3888 3889 3890 3891 3892 3893 3894 3895
		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++;
		}

3896 3897
		sh = __get_priority_stripe(conf);

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

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

	spin_unlock_irq(&conf->device_lock);

3912
	async_tx_issue_pending_all();
L
Linus Torvalds 已提交
3913 3914
	unplug_slaves(mddev);

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

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

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

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

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

3961 3962 3963 3964
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);
3965

3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979
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);
3980
	unsigned long new;
3981 3982 3983 3984 3985
	if (len >= PAGE_SIZE)
		return -EINVAL;
	if (!conf)
		return -ENODEV;

3986
	if (strict_strtoul(page, 10, &new))
3987
		return -EINVAL;
3988
	if (new > conf->max_nr_stripes)
3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999
		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);

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

4010 4011
static struct md_sysfs_entry
raid5_stripecache_active = __ATTR_RO(stripe_cache_active);
4012

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

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

4032 4033
	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 已提交
4034
		       mdname(mddev), mddev->level);
L
Linus Torvalds 已提交
4035 4036 4037
		return -EIO;
	}

4038 4039 4040 4041 4042 4043 4044
	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;
	}

4045 4046 4047 4048 4049 4050 4051 4052
	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;
4053
		int max_degraded = (mddev->level == 5 ? 1 : 2);
4054 4055 4056 4057

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


4098
	mddev->private = kzalloc(sizeof (raid5_conf_t), GFP_KERNEL);
L
Linus Torvalds 已提交
4099 4100
	if ((conf = mddev->private) == NULL)
		goto abort;
4101 4102 4103 4104 4105 4106 4107 4108
	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),
4109 4110 4111
			      GFP_KERNEL);
	if (!conf->disks)
		goto abort;
4112

L
Linus Torvalds 已提交
4113 4114
	conf->mddev = mddev;

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

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

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

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

		disk->rdev = rdev;

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

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

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

4178 4179 4180 4181 4182
	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 已提交
4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193
	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;
	}
4194
	if (mddev->degraded > conf->max_degraded) {
L
Linus Torvalds 已提交
4195 4196
		printk(KERN_ERR "raid5: not enough operational devices for %s"
			" (%d/%d failed)\n",
4197
			mdname(mddev), mddev->degraded, conf->raid_disks);
L
Linus Torvalds 已提交
4198 4199 4200
		goto abort;
	}

4201
	if (mddev->degraded > 0 &&
L
Linus Torvalds 已提交
4202
	    mddev->recovery_cp != MaxSector) {
4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213
		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 已提交
4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224
	}

	{
		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;
		}
	}
4225
	memory = conf->max_nr_stripes * (sizeof(struct stripe_head) +
L
Linus Torvalds 已提交
4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249
		 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);

4250 4251
	if (conf->expand_progress != MaxSector) {
		printk("...ok start reshape thread\n");
4252
		conf->expand_lo = conf->expand_progress;
4253 4254 4255 4256 4257 4258 4259 4260 4261
		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 已提交
4262
	/* read-ahead size must cover two whole stripes, which is
4263
	 * 2 * (datadisks) * chunksize where 'n' is the number of raid devices
L
Linus Torvalds 已提交
4264 4265
	 */
	{
4266 4267
		int data_disks = conf->previous_raid_disks - conf->max_degraded;
		int stripe = data_disks *
4268
			(mddev->chunk_size / PAGE_SIZE);
L
Linus Torvalds 已提交
4269 4270 4271 4272 4273
		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 */
4274 4275 4276 4277
	if (sysfs_create_group(&mddev->kobj, &raid5_attrs_group))
		printk(KERN_WARNING
		       "raid5: failed to create sysfs attributes for %s\n",
		       mdname(mddev));
4278 4279

	mddev->queue->unplug_fn = raid5_unplug_device;
4280
	mddev->queue->backing_dev_info.congested_data = mddev;
4281
	mddev->queue->backing_dev_info.congested_fn = raid5_congested;
4282

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

4286 4287
	blk_queue_merge_bvec(mddev->queue, raid5_mergeable_bvec);

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



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

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

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

4326 4327 4328 4329 4330
	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);
4331
	for (i = 0; i < sh->disks; i++) {
4332 4333
		seq_printf(seq, "(cache%d: %p %ld) ",
			   i, sh->dev[i].page, sh->dev[i].flags);
L
Linus Torvalds 已提交
4334
	}
4335
	seq_printf(seq, "\n");
L
Linus Torvalds 已提交
4336 4337
}

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

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

4356
static void status(struct seq_file *seq, mddev_t *mddev)
L
Linus Torvalds 已提交
4357 4358 4359 4360 4361
{
	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);
4362
	seq_printf (seq, " [%d/%d] [", conf->raid_disks, conf->raid_disks - mddev->degraded);
L
Linus Torvalds 已提交
4363 4364 4365
	for (i = 0; i < conf->raid_disks; i++)
		seq_printf (seq, "%s",
			       conf->disks[i].rdev &&
4366
			       test_bit(In_sync, &conf->disks[i].rdev->flags) ? "U" : "_");
L
Linus Torvalds 已提交
4367
	seq_printf (seq, "]");
4368
#ifdef DEBUG
4369 4370
	seq_printf (seq, "\n");
	printall(seq, conf);
L
Linus Torvalds 已提交
4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383
#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;
	}
4384 4385
	printk(" --- rd:%d wd:%d\n", conf->raid_disks,
		 conf->raid_disks - conf->mddev->degraded);
L
Linus Torvalds 已提交
4386 4387 4388 4389 4390 4391

	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",
4392
			i, !test_bit(Faulty, &tmp->rdev->flags),
L
Linus Torvalds 已提交
4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405
			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
4406
		    && !test_bit(Faulty, &tmp->rdev->flags)
4407 4408 4409
		    && !test_and_set_bit(In_sync, &tmp->rdev->flags)) {
			unsigned long flags;
			spin_lock_irqsave(&conf->device_lock, flags);
L
Linus Torvalds 已提交
4410
			mddev->degraded--;
4411
			spin_unlock_irqrestore(&conf->device_lock, flags);
L
Linus Torvalds 已提交
4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427
		}
	}
	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) {
4428
		if (test_bit(In_sync, &rdev->flags) ||
L
Linus Torvalds 已提交
4429 4430 4431 4432
		    atomic_read(&rdev->nr_pending)) {
			err = -EBUSY;
			goto abort;
		}
4433 4434 4435 4436 4437 4438 4439 4440
		/* 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 已提交
4441
		p->rdev = NULL;
4442
		synchronize_rcu();
L
Linus Torvalds 已提交
4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457
		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;
4458
	int err = -EEXIST;
L
Linus Torvalds 已提交
4459 4460
	int disk;
	struct disk_info *p;
4461 4462
	int first = 0;
	int last = conf->raid_disks - 1;
L
Linus Torvalds 已提交
4463

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

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

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

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.
	 */
4504 4505
	raid5_conf_t *conf = mddev_to_conf(mddev);

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

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

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

	/* 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.
	 */
4543 4544
	if ((mddev->chunk_size / STRIPE_SIZE) * 4 > conf->max_nr_stripes ||
	    (mddev->new_chunk / STRIPE_SIZE) * 4 > conf->max_nr_stripes) {
4545 4546 4547 4548 4549
		printk(KERN_WARNING "raid5: reshape: not enough stripes.  Needed %lu\n",
		       (mddev->chunk_size / STRIPE_SIZE)*4);
		return -ENOSPC;
	}

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

4554 4555
	if (mddev->degraded > conf->max_degraded)
		return -EINVAL;
4556 4557 4558 4559 4560 4561 4562 4563 4564 4565
	/* 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;
4566
	unsigned long flags;
4567

4568
	if (test_bit(MD_RECOVERY_RUNNING, &mddev->recovery))
4569 4570
		return -EBUSY;

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

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

4582
	atomic_set(&conf->reshape_stripes, 0);
4583 4584
	spin_lock_irq(&conf->device_lock);
	conf->previous_raid_disks = conf->raid_disks;
4585
	conf->raid_disks += mddev->delta_disks;
4586
	conf->expand_progress = 0;
4587
	conf->expand_lo = 0;
4588 4589 4590 4591 4592
	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.
	 */
4593
	list_for_each_entry(rdev, &mddev->disks, same_set)
4594 4595
		if (rdev->raid_disk < 0 &&
		    !test_bit(Faulty, &rdev->flags)) {
4596
			if (raid5_add_disk(mddev, rdev) == 0) {
4597 4598 4599
				char nm[20];
				set_bit(In_sync, &rdev->flags);
				added_devices++;
4600
				rdev->recovery_offset = 0;
4601
				sprintf(nm, "rd%d", rdev->raid_disk);
4602 4603 4604 4605 4606 4607
				if (sysfs_create_link(&mddev->kobj,
						      &rdev->kobj, nm))
					printk(KERN_WARNING
					       "raid5: failed to create "
					       " link %s for %s\n",
					       nm, mdname(mddev));
4608 4609 4610 4611
			} else
				break;
		}

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

4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642
	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;

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

		bdev = bdget_disk(conf->mddev->gendisk, 0);
		if (bdev) {
			mutex_lock(&bdev->bd_inode->i_mutex);
4652 4653
			i_size_write(bdev->bd_inode,
				     (loff_t)conf->mddev->array_sectors << 9);
4654 4655 4656 4657 4658 4659 4660
			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;
4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671

		/* 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;
		}
4672 4673 4674
	}
}

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

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

4684 4685 4686 4687
	case 1: /* stop all writes */
		spin_lock_irq(&conf->device_lock);
		conf->quiesce = 1;
		wait_event_lock_irq(conf->wait_for_stripe,
4688 4689
				    atomic_read(&conf->active_stripes) == 0 &&
				    atomic_read(&conf->active_aligned_reads) == 0,
4690 4691 4692 4693 4694 4695 4696 4697
				    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);
4698
		wake_up(&conf->wait_for_overlap);
4699 4700 4701 4702
		spin_unlock_irq(&conf->device_lock);
		break;
	}
}
4703

4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718
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,
4719 4720 4721 4722
#ifdef CONFIG_MD_RAID5_RESHAPE
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
#endif
4723 4724
	.quiesce	= raid5_quiesce,
};
4725
static struct mdk_personality raid5_personality =
L
Linus Torvalds 已提交
4726 4727
{
	.name		= "raid5",
4728
	.level		= 5,
L
Linus Torvalds 已提交
4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739
	.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,
4740
#ifdef CONFIG_MD_RAID5_RESHAPE
4741 4742
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
4743
#endif
4744
	.quiesce	= raid5_quiesce,
L
Linus Torvalds 已提交
4745 4746
};

4747
static struct mdk_personality raid4_personality =
L
Linus Torvalds 已提交
4748
{
4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761
	.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,
4762 4763 4764 4765
#ifdef CONFIG_MD_RAID5_RESHAPE
	.check_reshape	= raid5_check_reshape,
	.start_reshape  = raid5_start_reshape,
#endif
4766 4767 4768 4769 4770
	.quiesce	= raid5_quiesce,
};

static int __init raid5_init(void)
{
4771 4772 4773 4774 4775 4776
	int e;

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

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

module_init(raid5_init);
module_exit(raid5_exit);
MODULE_LICENSE("GPL");
MODULE_ALIAS("md-personality-4"); /* RAID5 */
4793 4794
MODULE_ALIAS("md-raid5");
MODULE_ALIAS("md-raid4");
4795 4796
MODULE_ALIAS("md-level-5");
MODULE_ALIAS("md-level-4");
4797 4798 4799 4800 4801 4802 4803
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");