2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* raid10.c : Multiple Devices driver for Linux
|
|
|
|
*
|
|
|
|
* Copyright (C) 2000-2004 Neil Brown
|
|
|
|
*
|
|
|
|
* RAID-10 support for md.
|
|
|
|
*
|
2011-03-31 03:57:33 +02:00
|
|
|
* Base on code in raid1.c. See raid1.c for further copyright information.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2008-10-15 00:09:21 +02:00
|
|
|
#include <linux/delay.h>
|
2009-03-31 05:33:13 +02:00
|
|
|
#include <linux/blkdev.h>
|
2011-07-03 19:58:33 +02:00
|
|
|
#include <linux/module.h>
|
2009-03-31 05:33:13 +02:00
|
|
|
#include <linux/seq_file.h>
|
2011-07-27 03:00:36 +02:00
|
|
|
#include <linux/ratelimit.h>
|
2009-03-31 05:33:13 +02:00
|
|
|
#include "md.h"
|
2009-03-31 05:27:03 +02:00
|
|
|
#include "raid10.h"
|
2010-03-08 06:02:45 +01:00
|
|
|
#include "raid0.h"
|
2009-03-31 05:27:03 +02:00
|
|
|
#include "bitmap.h"
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* RAID10 provides a combination of RAID0 and RAID1 functionality.
|
|
|
|
* The layout of data is defined by
|
|
|
|
* chunk_size
|
|
|
|
* raid_disks
|
|
|
|
* near_copies (stored in low byte of layout)
|
|
|
|
* far_copies (stored in second byte of layout)
|
2006-06-26 09:27:41 +02:00
|
|
|
* far_offset (stored in bit 16 of layout )
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* The data to be stored is divided into chunks using chunksize.
|
|
|
|
* Each device is divided into far_copies sections.
|
|
|
|
* In each section, chunks are laid out in a style similar to raid0, but
|
|
|
|
* near_copies copies of each chunk is stored (each on a different drive).
|
|
|
|
* The starting device for each section is offset near_copies from the starting
|
|
|
|
* device of the previous section.
|
2006-06-26 09:27:41 +02:00
|
|
|
* Thus they are (near_copies*far_copies) of each chunk, and each is on a different
|
2005-04-17 00:20:36 +02:00
|
|
|
* drive.
|
|
|
|
* near_copies and far_copies must be at least one, and their product is at most
|
|
|
|
* raid_disks.
|
2006-06-26 09:27:41 +02:00
|
|
|
*
|
|
|
|
* If far_offset is true, then the far_copies are handled a bit differently.
|
|
|
|
* The copies are still in different stripes, but instead of be very far apart
|
|
|
|
* on disk, there are adjacent stripes.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Number of guaranteed r10bios in case of extreme VM load:
|
|
|
|
*/
|
|
|
|
#define NR_RAID10_BIOS 256
|
|
|
|
|
2011-10-11 07:50:01 +02:00
|
|
|
/* When there are this many requests queue to be written by
|
|
|
|
* the raid10 thread, we become 'congested' to provide back-pressure
|
|
|
|
* for writeback.
|
|
|
|
*/
|
|
|
|
static int max_queued_requests = 1024;
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void allow_barrier(struct r10conf *conf);
|
|
|
|
static void lower_barrier(struct r10conf *conf);
|
2006-01-06 09:20:13 +01:00
|
|
|
|
2005-10-07 08:46:04 +02:00
|
|
|
static void * r10bio_pool_alloc(gfp_t gfp_flags, void *data)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = data;
|
2011-10-11 07:48:43 +02:00
|
|
|
int size = offsetof(struct r10bio, devs[conf->copies]);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
/* allocate a r10bio with room for raid_disks entries in the
|
|
|
|
* bios array */
|
2011-03-10 08:52:07 +01:00
|
|
|
return kzalloc(size, gfp_flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void r10bio_pool_free(void *r10_bio, void *data)
|
|
|
|
{
|
|
|
|
kfree(r10_bio);
|
|
|
|
}
|
|
|
|
|
2008-08-05 07:54:14 +02:00
|
|
|
/* Maximum size of each resync request */
|
2005-04-17 00:20:36 +02:00
|
|
|
#define RESYNC_BLOCK_SIZE (64*1024)
|
|
|
|
#define RESYNC_PAGES ((RESYNC_BLOCK_SIZE + PAGE_SIZE-1) / PAGE_SIZE)
|
2008-08-05 07:54:14 +02:00
|
|
|
/* amount of memory to reserve for resync requests */
|
|
|
|
#define RESYNC_WINDOW (1024*1024)
|
|
|
|
/* maximum number of concurrent requests, memory permitting */
|
|
|
|
#define RESYNC_DEPTH (32*1024*1024/RESYNC_BLOCK_SIZE)
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* When performing a resync, we need to read and compare, so
|
|
|
|
* we need as many pages are there are copies.
|
|
|
|
* When performing a recovery, we need 2 bios, one for read,
|
|
|
|
* one for write (we recover only one drive per r10buf)
|
|
|
|
*
|
|
|
|
*/
|
2005-10-07 08:46:04 +02:00
|
|
|
static void * r10buf_pool_alloc(gfp_t gfp_flags, void *data)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = data;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct page *page;
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct bio *bio;
|
|
|
|
int i, j;
|
|
|
|
int nalloc;
|
|
|
|
|
|
|
|
r10_bio = r10bio_pool_alloc(gfp_flags, conf);
|
2011-03-10 08:52:07 +01:00
|
|
|
if (!r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (test_bit(MD_RECOVERY_SYNC, &conf->mddev->recovery))
|
|
|
|
nalloc = conf->copies; /* resync */
|
|
|
|
else
|
|
|
|
nalloc = 2; /* recovery */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate bios.
|
|
|
|
*/
|
|
|
|
for (j = nalloc ; j-- ; ) {
|
2010-10-26 08:33:54 +02:00
|
|
|
bio = bio_kmalloc(gfp_flags, RESYNC_PAGES);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!bio)
|
|
|
|
goto out_free_bio;
|
|
|
|
r10_bio->devs[j].bio = bio;
|
2011-12-23 00:17:54 +01:00
|
|
|
if (!conf->have_replacement)
|
|
|
|
continue;
|
|
|
|
bio = bio_kmalloc(gfp_flags, RESYNC_PAGES);
|
|
|
|
if (!bio)
|
|
|
|
goto out_free_bio;
|
|
|
|
r10_bio->devs[j].repl_bio = bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Allocate RESYNC_PAGES data pages and attach them
|
|
|
|
* where needed.
|
|
|
|
*/
|
|
|
|
for (j = 0 ; j < nalloc; j++) {
|
2011-12-23 00:17:54 +01:00
|
|
|
struct bio *rbio = r10_bio->devs[j].repl_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
bio = r10_bio->devs[j].bio;
|
|
|
|
for (i = 0; i < RESYNC_PAGES; i++) {
|
2011-07-18 09:38:49 +02:00
|
|
|
if (j == 1 && !test_bit(MD_RECOVERY_SYNC,
|
|
|
|
&conf->mddev->recovery)) {
|
|
|
|
/* we can share bv_page's during recovery */
|
|
|
|
struct bio *rbio = r10_bio->devs[0].bio;
|
|
|
|
page = rbio->bi_io_vec[i].bv_page;
|
|
|
|
get_page(page);
|
|
|
|
} else
|
|
|
|
page = alloc_page(gfp_flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (unlikely(!page))
|
|
|
|
goto out_free_pages;
|
|
|
|
|
|
|
|
bio->bi_io_vec[i].bv_page = page;
|
2011-12-23 00:17:54 +01:00
|
|
|
if (rbio)
|
|
|
|
rbio->bi_io_vec[i].bv_page = page;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return r10_bio;
|
|
|
|
|
|
|
|
out_free_pages:
|
|
|
|
for ( ; i > 0 ; i--)
|
2006-01-06 09:20:40 +01:00
|
|
|
safe_put_page(bio->bi_io_vec[i-1].bv_page);
|
2005-04-17 00:20:36 +02:00
|
|
|
while (j--)
|
|
|
|
for (i = 0; i < RESYNC_PAGES ; i++)
|
2006-01-06 09:20:40 +01:00
|
|
|
safe_put_page(r10_bio->devs[j].bio->bi_io_vec[i].bv_page);
|
2005-04-17 00:20:36 +02:00
|
|
|
j = -1;
|
|
|
|
out_free_bio:
|
2011-12-23 00:17:54 +01:00
|
|
|
while (++j < nalloc) {
|
2005-04-17 00:20:36 +02:00
|
|
|
bio_put(r10_bio->devs[j].bio);
|
2011-12-23 00:17:54 +01:00
|
|
|
if (r10_bio->devs[j].repl_bio)
|
|
|
|
bio_put(r10_bio->devs[j].repl_bio);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
r10bio_pool_free(r10_bio, conf);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void r10buf_pool_free(void *__r10_bio, void *data)
|
|
|
|
{
|
|
|
|
int i;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = data;
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10bio = __r10_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
int j;
|
|
|
|
|
|
|
|
for (j=0; j < conf->copies; j++) {
|
|
|
|
struct bio *bio = r10bio->devs[j].bio;
|
|
|
|
if (bio) {
|
|
|
|
for (i = 0; i < RESYNC_PAGES; i++) {
|
2006-01-06 09:20:40 +01:00
|
|
|
safe_put_page(bio->bi_io_vec[i].bv_page);
|
2005-04-17 00:20:36 +02:00
|
|
|
bio->bi_io_vec[i].bv_page = NULL;
|
|
|
|
}
|
|
|
|
bio_put(bio);
|
|
|
|
}
|
2011-12-23 00:17:54 +01:00
|
|
|
bio = r10bio->devs[j].repl_bio;
|
|
|
|
if (bio)
|
|
|
|
bio_put(bio);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
r10bio_pool_free(r10bio, conf);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void put_all_bios(struct r10conf *conf, struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < conf->copies; i++) {
|
|
|
|
struct bio **bio = & r10_bio->devs[i].bio;
|
2011-07-28 03:39:24 +02:00
|
|
|
if (!BIO_SPECIAL(*bio))
|
2005-04-17 00:20:36 +02:00
|
|
|
bio_put(*bio);
|
|
|
|
*bio = NULL;
|
2011-12-23 00:17:54 +01:00
|
|
|
bio = &r10_bio->devs[i].repl_bio;
|
|
|
|
if (r10_bio->read_slot < 0 && !BIO_SPECIAL(*bio))
|
|
|
|
bio_put(*bio);
|
|
|
|
*bio = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void free_r10bio(struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
put_all_bios(conf, r10_bio);
|
|
|
|
mempool_free(r10_bio, conf->r10bio_pool);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void put_buf(struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
mempool_free(r10_bio, conf->r10buf_pool);
|
|
|
|
|
2006-01-06 09:20:13 +01:00
|
|
|
lower_barrier(conf);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void reschedule_retry(struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = r10_bio->mddev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
|
|
|
list_add(&r10_bio->retry_list, &conf->retry_list);
|
2006-01-06 09:20:28 +01:00
|
|
|
conf->nr_queued ++;
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
|
|
|
|
2008-07-25 21:03:38 +02:00
|
|
|
/* wake up frozen array... */
|
|
|
|
wake_up(&conf->wait_barrier);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
md_wakeup_thread(mddev->thread);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* raid_end_bio_io() is called when we have finished servicing a mirrored
|
|
|
|
* operation and are ready to return a success/failure code to the buffer
|
|
|
|
* cache layer.
|
|
|
|
*/
|
2011-10-11 07:48:43 +02:00
|
|
|
static void raid_end_bio_io(struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct bio *bio = r10_bio->master_bio;
|
2011-07-28 03:39:23 +02:00
|
|
|
int done;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-28 03:39:23 +02:00
|
|
|
if (bio->bi_phys_segments) {
|
|
|
|
unsigned long flags;
|
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
|
|
|
bio->bi_phys_segments--;
|
|
|
|
done = (bio->bi_phys_segments == 0);
|
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
|
|
|
} else
|
|
|
|
done = 1;
|
|
|
|
if (!test_bit(R10BIO_Uptodate, &r10_bio->state))
|
|
|
|
clear_bit(BIO_UPTODATE, &bio->bi_flags);
|
|
|
|
if (done) {
|
|
|
|
bio_endio(bio, 0);
|
|
|
|
/*
|
|
|
|
* Wake up any possible resync thread that waits for the device
|
|
|
|
* to go idle.
|
|
|
|
*/
|
|
|
|
allow_barrier(conf);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
free_r10bio(r10_bio);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update disk head position estimator based on IRQ completion info.
|
|
|
|
*/
|
2011-10-11 07:48:43 +02:00
|
|
|
static inline void update_head_pos(int slot, struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
conf->mirrors[r10_bio->devs[slot].devnum].head_position =
|
|
|
|
r10_bio->devs[slot].addr + (r10_bio->sectors);
|
|
|
|
}
|
|
|
|
|
2011-07-18 09:38:47 +02:00
|
|
|
/*
|
|
|
|
* Find the disk number which triggered given bio
|
|
|
|
*/
|
2011-10-11 07:49:02 +02:00
|
|
|
static int find_bio_disk(struct r10conf *conf, struct r10bio *r10_bio,
|
2011-12-23 00:17:54 +01:00
|
|
|
struct bio *bio, int *slotp, int *replp)
|
2011-07-18 09:38:47 +02:00
|
|
|
{
|
|
|
|
int slot;
|
2011-12-23 00:17:54 +01:00
|
|
|
int repl = 0;
|
2011-07-18 09:38:47 +02:00
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
for (slot = 0; slot < conf->copies; slot++) {
|
2011-07-18 09:38:47 +02:00
|
|
|
if (r10_bio->devs[slot].bio == bio)
|
|
|
|
break;
|
2011-12-23 00:17:54 +01:00
|
|
|
if (r10_bio->devs[slot].repl_bio == bio) {
|
|
|
|
repl = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2011-07-18 09:38:47 +02:00
|
|
|
|
|
|
|
BUG_ON(slot == conf->copies);
|
|
|
|
update_head_pos(slot, r10_bio);
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
if (slotp)
|
|
|
|
*slotp = slot;
|
2011-12-23 00:17:54 +01:00
|
|
|
if (replp)
|
|
|
|
*replp = repl;
|
2011-07-18 09:38:47 +02:00
|
|
|
return r10_bio->devs[slot].devnum;
|
|
|
|
}
|
|
|
|
|
2007-09-27 12:47:43 +02:00
|
|
|
static void raid10_end_read_request(struct bio *bio, int error)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio = bio->bi_private;
|
2005-04-17 00:20:36 +02:00
|
|
|
int slot, dev;
|
2011-12-23 00:17:54 +01:00
|
|
|
struct md_rdev *rdev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
|
|
|
|
slot = r10_bio->read_slot;
|
|
|
|
dev = r10_bio->devs[slot].devnum;
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = r10_bio->devs[slot].rdev;
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* this branch is our 'one mirror IO has finished' event handler:
|
|
|
|
*/
|
2006-01-06 09:20:28 +01:00
|
|
|
update_head_pos(slot, r10_bio);
|
|
|
|
|
|
|
|
if (uptodate) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Set R10BIO_Uptodate in our master bio, so that
|
|
|
|
* we will return a good error code to the higher
|
|
|
|
* levels even if IO on some other mirrored buffer fails.
|
|
|
|
*
|
|
|
|
* The 'master' represents the composite IO operation to
|
|
|
|
* user-side. So if something waits for IO, then it will
|
|
|
|
* wait for the 'master' bio.
|
|
|
|
*/
|
|
|
|
set_bit(R10BIO_Uptodate, &r10_bio->state);
|
|
|
|
raid_end_bio_io(r10_bio);
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev_dec_pending(rdev, conf->mddev);
|
2006-01-06 09:20:28 +01:00
|
|
|
} else {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2011-05-11 06:53:17 +02:00
|
|
|
* oops, read error - keep the refcount on the rdev
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
char b[BDEVNAME_SIZE];
|
2011-07-27 03:00:36 +02:00
|
|
|
printk_ratelimited(KERN_ERR
|
|
|
|
"md/raid10:%s: %s: rescheduling sector %llu\n",
|
|
|
|
mdname(conf->mddev),
|
2011-12-23 00:17:54 +01:00
|
|
|
bdevname(rdev->bdev, b),
|
2011-07-27 03:00:36 +02:00
|
|
|
(unsigned long long)r10_bio->sector);
|
2011-07-28 03:39:23 +02:00
|
|
|
set_bit(R10BIO_ReadError, &r10_bio->state);
|
2005-04-17 00:20:36 +02:00
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void close_write(struct r10bio *r10_bio)
|
2011-07-28 03:39:24 +02:00
|
|
|
{
|
|
|
|
/* clear the bitmap if all writes complete successfully */
|
|
|
|
bitmap_endwrite(r10_bio->mddev->bitmap, r10_bio->sector,
|
|
|
|
r10_bio->sectors,
|
|
|
|
!test_bit(R10BIO_Degraded, &r10_bio->state),
|
|
|
|
0);
|
|
|
|
md_write_end(r10_bio->mddev);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void one_write_done(struct r10bio *r10_bio)
|
2011-09-10 09:21:17 +02:00
|
|
|
{
|
|
|
|
if (atomic_dec_and_test(&r10_bio->remaining)) {
|
|
|
|
if (test_bit(R10BIO_WriteError, &r10_bio->state))
|
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
else {
|
|
|
|
close_write(r10_bio);
|
|
|
|
if (test_bit(R10BIO_MadeGood, &r10_bio->state))
|
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
else
|
|
|
|
raid_end_bio_io(r10_bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-09-27 12:47:43 +02:00
|
|
|
static void raid10_end_write_request(struct bio *bio, int error)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio = bio->bi_private;
|
2011-07-18 09:38:47 +02:00
|
|
|
int dev;
|
2011-07-28 03:39:24 +02:00
|
|
|
int dec_rdev = 1;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2011-07-28 03:39:24 +02:00
|
|
|
int slot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
dev = find_bio_disk(conf, r10_bio, bio, &slot, NULL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* this branch is our 'one mirror IO has finished' event handler:
|
|
|
|
*/
|
2006-01-06 09:20:16 +01:00
|
|
|
if (!uptodate) {
|
2011-07-28 03:39:24 +02:00
|
|
|
set_bit(WriteErrorSeen, &conf->mirrors[dev].rdev->flags);
|
|
|
|
set_bit(R10BIO_WriteError, &r10_bio->state);
|
|
|
|
dec_rdev = 0;
|
2011-07-28 03:39:24 +02:00
|
|
|
} else {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Set R10BIO_Uptodate in our master bio, so that
|
|
|
|
* we will return a good error code for to the higher
|
|
|
|
* levels even if IO on some other mirrored buffer fails.
|
|
|
|
*
|
|
|
|
* The 'master' represents the composite IO operation to
|
|
|
|
* user-side. So if something waits for IO, then it will
|
|
|
|
* wait for the 'master' bio.
|
|
|
|
*/
|
2011-07-28 03:39:24 +02:00
|
|
|
sector_t first_bad;
|
|
|
|
int bad_sectors;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
set_bit(R10BIO_Uptodate, &r10_bio->state);
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
/* Maybe we can clear some bad blocks. */
|
|
|
|
if (is_badblock(conf->mirrors[dev].rdev,
|
|
|
|
r10_bio->devs[slot].addr,
|
|
|
|
r10_bio->sectors,
|
|
|
|
&first_bad, &bad_sectors)) {
|
|
|
|
bio_put(bio);
|
|
|
|
r10_bio->devs[slot].bio = IO_MADE_GOOD;
|
|
|
|
dec_rdev = 0;
|
|
|
|
set_bit(R10BIO_MadeGood, &r10_bio->state);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Let's see if all mirrored write operations have finished
|
|
|
|
* already.
|
|
|
|
*/
|
2011-09-10 09:21:17 +02:00
|
|
|
one_write_done(r10_bio);
|
2011-07-28 03:39:24 +02:00
|
|
|
if (dec_rdev)
|
|
|
|
rdev_dec_pending(conf->mirrors[dev].rdev, conf->mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* RAID10 layout manager
|
2011-03-31 03:57:33 +02:00
|
|
|
* As well as the chunksize and raid_disks count, there are two
|
2005-04-17 00:20:36 +02:00
|
|
|
* parameters: near_copies and far_copies.
|
|
|
|
* near_copies * far_copies must be <= raid_disks.
|
|
|
|
* Normally one of these will be 1.
|
|
|
|
* If both are 1, we get raid0.
|
|
|
|
* If near_copies == raid_disks, we get raid1.
|
|
|
|
*
|
2011-03-31 03:57:33 +02:00
|
|
|
* Chunks are laid out in raid0 style with near_copies copies of the
|
2005-04-17 00:20:36 +02:00
|
|
|
* first chunk, followed by near_copies copies of the next chunk and
|
|
|
|
* so on.
|
|
|
|
* If far_copies > 1, then after 1/far_copies of the array has been assigned
|
|
|
|
* as described above, we start again with a device offset of near_copies.
|
|
|
|
* So we effectively have another copy of the whole array further down all
|
|
|
|
* the drives, but with blocks on different drives.
|
|
|
|
* With this layout, and block is never stored twice on the one device.
|
|
|
|
*
|
|
|
|
* raid10_find_phys finds the sector offset of a given virtual sector
|
2006-06-26 09:27:41 +02:00
|
|
|
* on each device that it is on.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* raid10_find_virt does the reverse mapping, from a device and a
|
|
|
|
* sector offset to a virtual address
|
|
|
|
*/
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void raid10_find_phys(struct r10conf *conf, struct r10bio *r10bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int n,f;
|
|
|
|
sector_t sector;
|
|
|
|
sector_t chunk;
|
|
|
|
sector_t stripe;
|
|
|
|
int dev;
|
|
|
|
|
|
|
|
int slot = 0;
|
|
|
|
|
|
|
|
/* now calculate first sector/dev */
|
|
|
|
chunk = r10bio->sector >> conf->chunk_shift;
|
|
|
|
sector = r10bio->sector & conf->chunk_mask;
|
|
|
|
|
|
|
|
chunk *= conf->near_copies;
|
|
|
|
stripe = chunk;
|
|
|
|
dev = sector_div(stripe, conf->raid_disks);
|
2006-06-26 09:27:41 +02:00
|
|
|
if (conf->far_offset)
|
|
|
|
stripe *= conf->far_copies;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
sector += stripe << conf->chunk_shift;
|
|
|
|
|
|
|
|
/* and calculate all the others */
|
|
|
|
for (n=0; n < conf->near_copies; n++) {
|
|
|
|
int d = dev;
|
|
|
|
sector_t s = sector;
|
|
|
|
r10bio->devs[slot].addr = sector;
|
|
|
|
r10bio->devs[slot].devnum = d;
|
|
|
|
slot++;
|
|
|
|
|
|
|
|
for (f = 1; f < conf->far_copies; f++) {
|
|
|
|
d += conf->near_copies;
|
|
|
|
if (d >= conf->raid_disks)
|
|
|
|
d -= conf->raid_disks;
|
|
|
|
s += conf->stride;
|
|
|
|
r10bio->devs[slot].devnum = d;
|
|
|
|
r10bio->devs[slot].addr = s;
|
|
|
|
slot++;
|
|
|
|
}
|
|
|
|
dev++;
|
|
|
|
if (dev >= conf->raid_disks) {
|
|
|
|
dev = 0;
|
|
|
|
sector += (conf->chunk_mask + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
BUG_ON(slot != conf->copies);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static sector_t raid10_find_virt(struct r10conf *conf, sector_t sector, int dev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
sector_t offset, chunk, vchunk;
|
|
|
|
|
|
|
|
offset = sector & conf->chunk_mask;
|
2006-06-26 09:27:41 +02:00
|
|
|
if (conf->far_offset) {
|
|
|
|
int fc;
|
|
|
|
chunk = sector >> conf->chunk_shift;
|
|
|
|
fc = sector_div(chunk, conf->far_copies);
|
|
|
|
dev -= fc * conf->near_copies;
|
|
|
|
if (dev < 0)
|
|
|
|
dev += conf->raid_disks;
|
|
|
|
} else {
|
2007-03-01 05:11:18 +01:00
|
|
|
while (sector >= conf->stride) {
|
2006-06-26 09:27:41 +02:00
|
|
|
sector -= conf->stride;
|
|
|
|
if (dev < conf->near_copies)
|
|
|
|
dev += conf->raid_disks - conf->near_copies;
|
|
|
|
else
|
|
|
|
dev -= conf->near_copies;
|
|
|
|
}
|
|
|
|
chunk = sector >> conf->chunk_shift;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
vchunk = chunk * conf->raid_disks + dev;
|
|
|
|
sector_div(vchunk, conf->near_copies);
|
|
|
|
return (vchunk << conf->chunk_shift) + offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* raid10_mergeable_bvec -- tell bio layer if a two requests can be merged
|
|
|
|
* @q: request queue
|
2008-07-03 09:53:43 +02:00
|
|
|
* @bvm: properties of new bio
|
2005-04-17 00:20:36 +02:00
|
|
|
* @biovec: the request that could be merged to it.
|
|
|
|
*
|
|
|
|
* Return amount of bytes we can accept at this offset
|
|
|
|
* If near_copies == raid_disk, there are no striping issues,
|
|
|
|
* but in that case, the function isn't called at all.
|
|
|
|
*/
|
2008-07-03 09:53:43 +02:00
|
|
|
static int raid10_mergeable_bvec(struct request_queue *q,
|
|
|
|
struct bvec_merge_data *bvm,
|
|
|
|
struct bio_vec *biovec)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = q->queuedata;
|
2008-07-03 09:53:43 +02:00
|
|
|
sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
|
2005-04-17 00:20:36 +02:00
|
|
|
int max;
|
2009-06-18 00:45:01 +02:00
|
|
|
unsigned int chunk_sectors = mddev->chunk_sectors;
|
2008-07-03 09:53:43 +02:00
|
|
|
unsigned int bio_sectors = bvm->bi_size >> 9;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
max = (chunk_sectors - ((sector & (chunk_sectors - 1)) + bio_sectors)) << 9;
|
|
|
|
if (max < 0) max = 0; /* bio_add cannot handle a negative return */
|
2008-07-03 09:53:43 +02:00
|
|
|
if (max <= biovec->bv_len && bio_sectors == 0)
|
|
|
|
return biovec->bv_len;
|
2005-04-17 00:20:36 +02:00
|
|
|
else
|
|
|
|
return max;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine returns the disk from which the requested read should
|
|
|
|
* be done. There is a per-array 'next expected sequential IO' sector
|
|
|
|
* number - if this matches on the next IO then we use the last disk.
|
|
|
|
* There is also a per-disk 'last know head position' sector that is
|
|
|
|
* maintained from IRQ contexts, both the normal and the resync IO
|
|
|
|
* completion handlers update this position correctly. If there is no
|
|
|
|
* perfect sequential match then we pick the disk whose head is closest.
|
|
|
|
*
|
|
|
|
* If there are 2 mirrors in the same 2 devices, performance degrades
|
|
|
|
* because position is mirror, not device based.
|
|
|
|
*
|
|
|
|
* The rdev for the device selected will have nr_pending incremented.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* FIXME: possibly should rethink readbalancing and do it differently
|
|
|
|
* depending on near_copies / far_copies geometry.
|
|
|
|
*/
|
2011-12-23 00:17:54 +01:00
|
|
|
static struct md_rdev *read_balance(struct r10conf *conf,
|
|
|
|
struct r10bio *r10_bio,
|
|
|
|
int *max_sectors)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-05-08 00:20:17 +02:00
|
|
|
const sector_t this_sector = r10_bio->sector;
|
2011-05-11 06:27:03 +02:00
|
|
|
int disk, slot;
|
2011-07-28 03:39:23 +02:00
|
|
|
int sectors = r10_bio->sectors;
|
|
|
|
int best_good_sectors;
|
2011-05-11 06:27:03 +02:00
|
|
|
sector_t new_distance, best_dist;
|
2011-12-23 00:17:54 +01:00
|
|
|
struct md_rdev *rdev, *best_rdev;
|
2011-05-11 06:27:03 +02:00
|
|
|
int do_balance;
|
|
|
|
int best_slot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
raid10_find_phys(conf, r10_bio);
|
|
|
|
rcu_read_lock();
|
2011-05-11 06:27:03 +02:00
|
|
|
retry:
|
2011-07-28 03:39:23 +02:00
|
|
|
sectors = r10_bio->sectors;
|
2011-05-11 06:27:03 +02:00
|
|
|
best_slot = -1;
|
2011-12-23 00:17:54 +01:00
|
|
|
best_rdev = NULL;
|
2011-05-11 06:27:03 +02:00
|
|
|
best_dist = MaxSector;
|
2011-07-28 03:39:23 +02:00
|
|
|
best_good_sectors = 0;
|
2011-05-11 06:27:03 +02:00
|
|
|
do_balance = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Check if we can balance. We can balance on the whole
|
2006-01-06 09:20:16 +01:00
|
|
|
* device if no resync is going on (recovery is ok), or below
|
|
|
|
* the resync window. We take the first readable disk when
|
|
|
|
* above the resync window.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
if (conf->mddev->recovery_cp < MaxSector
|
2011-05-11 06:27:03 +02:00
|
|
|
&& (this_sector + sectors >= conf->next_resync))
|
|
|
|
do_balance = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-11 06:27:03 +02:00
|
|
|
for (slot = 0; slot < conf->copies ; slot++) {
|
2011-07-28 03:39:23 +02:00
|
|
|
sector_t first_bad;
|
|
|
|
int bad_sectors;
|
|
|
|
sector_t dev_sector;
|
|
|
|
|
2011-05-11 06:27:03 +02:00
|
|
|
if (r10_bio->devs[slot].bio == IO_BLOCKED)
|
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
disk = r10_bio->devs[slot].devnum;
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = rcu_dereference(conf->mirrors[disk].replacement);
|
|
|
|
if (rdev == NULL || test_bit(Faulty, &rdev->flags) ||
|
|
|
|
r10_bio->devs[slot].addr + sectors > rdev->recovery_offset)
|
|
|
|
rdev = rcu_dereference(conf->mirrors[disk].rdev);
|
2011-05-11 06:27:03 +02:00
|
|
|
if (rdev == NULL)
|
2005-04-17 00:20:36 +02:00
|
|
|
continue;
|
2011-12-23 00:17:54 +01:00
|
|
|
if (test_bit(Faulty, &rdev->flags))
|
|
|
|
continue;
|
|
|
|
if (!test_bit(In_sync, &rdev->flags) &&
|
|
|
|
r10_bio->devs[slot].addr + sectors > rdev->recovery_offset)
|
2011-05-11 06:27:03 +02:00
|
|
|
continue;
|
|
|
|
|
2011-07-28 03:39:23 +02:00
|
|
|
dev_sector = r10_bio->devs[slot].addr;
|
|
|
|
if (is_badblock(rdev, dev_sector, sectors,
|
|
|
|
&first_bad, &bad_sectors)) {
|
|
|
|
if (best_dist < MaxSector)
|
|
|
|
/* Already have a better slot */
|
|
|
|
continue;
|
|
|
|
if (first_bad <= dev_sector) {
|
|
|
|
/* Cannot read here. If this is the
|
|
|
|
* 'primary' device, then we must not read
|
|
|
|
* beyond 'bad_sectors' from another device.
|
|
|
|
*/
|
|
|
|
bad_sectors -= (dev_sector - first_bad);
|
|
|
|
if (!do_balance && sectors > bad_sectors)
|
|
|
|
sectors = bad_sectors;
|
|
|
|
if (best_good_sectors > sectors)
|
|
|
|
best_good_sectors = sectors;
|
|
|
|
} else {
|
|
|
|
sector_t good_sectors =
|
|
|
|
first_bad - dev_sector;
|
|
|
|
if (good_sectors > best_good_sectors) {
|
|
|
|
best_good_sectors = good_sectors;
|
|
|
|
best_slot = slot;
|
2011-12-23 00:17:54 +01:00
|
|
|
best_rdev = rdev;
|
2011-07-28 03:39:23 +02:00
|
|
|
}
|
|
|
|
if (!do_balance)
|
|
|
|
/* Must read from here */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
} else
|
|
|
|
best_good_sectors = sectors;
|
|
|
|
|
2011-05-11 06:27:03 +02:00
|
|
|
if (!do_balance)
|
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-11-28 22:44:09 +01:00
|
|
|
/* This optimisation is debatable, and completely destroys
|
|
|
|
* sequential read speed for 'far copies' arrays. So only
|
|
|
|
* keep it for 'near' arrays, and review those later.
|
|
|
|
*/
|
2011-05-11 06:27:03 +02:00
|
|
|
if (conf->near_copies > 1 && !atomic_read(&rdev->nr_pending))
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
2008-03-04 23:29:34 +01:00
|
|
|
|
|
|
|
/* for far > 1 always use the lowest address */
|
|
|
|
if (conf->far_copies > 1)
|
2011-05-11 06:27:03 +02:00
|
|
|
new_distance = r10_bio->devs[slot].addr;
|
2008-03-04 23:29:34 +01:00
|
|
|
else
|
2011-05-11 06:27:03 +02:00
|
|
|
new_distance = abs(r10_bio->devs[slot].addr -
|
|
|
|
conf->mirrors[disk].head_position);
|
|
|
|
if (new_distance < best_dist) {
|
|
|
|
best_dist = new_distance;
|
|
|
|
best_slot = slot;
|
2011-12-23 00:17:54 +01:00
|
|
|
best_rdev = rdev;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
2011-12-23 00:17:54 +01:00
|
|
|
if (slot >= conf->copies) {
|
2011-05-11 06:27:03 +02:00
|
|
|
slot = best_slot;
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = best_rdev;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-11 06:27:03 +02:00
|
|
|
if (slot >= 0) {
|
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
if (test_bit(Faulty, &rdev->flags)) {
|
|
|
|
/* Cannot risk returning a device that failed
|
|
|
|
* before we inc'ed nr_pending
|
|
|
|
*/
|
|
|
|
rdev_dec_pending(rdev, conf->mddev);
|
|
|
|
goto retry;
|
|
|
|
}
|
|
|
|
r10_bio->read_slot = slot;
|
|
|
|
} else
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_unlock();
|
2011-07-28 03:39:23 +02:00
|
|
|
*max_sectors = best_good_sectors;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
return rdev;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2006-10-03 10:15:54 +02:00
|
|
|
static int raid10_congested(void *data, int bits)
|
|
|
|
{
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = data;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2006-10-03 10:15:54 +02:00
|
|
|
int i, ret = 0;
|
|
|
|
|
2011-10-11 07:50:01 +02:00
|
|
|
if ((bits & (1 << BDI_async_congested)) &&
|
|
|
|
conf->pending_count >= max_queued_requests)
|
|
|
|
return 1;
|
|
|
|
|
2009-09-23 10:10:29 +02:00
|
|
|
if (mddev_congested(mddev, bits))
|
|
|
|
return 1;
|
2006-10-03 10:15:54 +02:00
|
|
|
rcu_read_lock();
|
2010-03-16 07:23:35 +01:00
|
|
|
for (i = 0; i < conf->raid_disks && ret == 0; i++) {
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev = rcu_dereference(conf->mirrors[i].rdev);
|
2006-10-03 10:15:54 +02:00
|
|
|
if (rdev && !test_bit(Faulty, &rdev->flags)) {
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = bdev_get_queue(rdev->bdev);
|
2006-10-03 10:15:54 +02:00
|
|
|
|
|
|
|
ret |= bdi_congested(&q->backing_dev_info, bits);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void flush_pending_writes(struct r10conf *conf)
|
2008-03-04 23:29:29 +01:00
|
|
|
{
|
|
|
|
/* Any writes that have been queued but are awaiting
|
|
|
|
* bitmap updates get flushed here.
|
|
|
|
*/
|
|
|
|
spin_lock_irq(&conf->device_lock);
|
|
|
|
|
|
|
|
if (conf->pending_bio_list.head) {
|
|
|
|
struct bio *bio;
|
|
|
|
bio = bio_list_get(&conf->pending_bio_list);
|
2011-10-11 07:50:01 +02:00
|
|
|
conf->pending_count = 0;
|
2008-03-04 23:29:29 +01:00
|
|
|
spin_unlock_irq(&conf->device_lock);
|
|
|
|
/* flush any pending bitmap writes to disk
|
|
|
|
* before proceeding w/ I/O */
|
|
|
|
bitmap_unplug(conf->mddev->bitmap);
|
2011-10-11 07:50:01 +02:00
|
|
|
wake_up(&conf->wait_barrier);
|
2008-03-04 23:29:29 +01:00
|
|
|
|
|
|
|
while (bio) { /* submit pending writes */
|
|
|
|
struct bio *next = bio->bi_next;
|
|
|
|
bio->bi_next = NULL;
|
|
|
|
generic_make_request(bio);
|
|
|
|
bio = next;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
spin_unlock_irq(&conf->device_lock);
|
|
|
|
}
|
2011-03-10 08:52:07 +01:00
|
|
|
|
2006-01-06 09:20:13 +01:00
|
|
|
/* Barriers....
|
|
|
|
* Sometimes we need to suspend IO while we do something else,
|
|
|
|
* either some resync/recovery, or reconfigure the array.
|
|
|
|
* To do this we raise a 'barrier'.
|
|
|
|
* The 'barrier' is a counter that can be raised multiple times
|
|
|
|
* to count how many activities are happening which preclude
|
|
|
|
* normal IO.
|
|
|
|
* We can only raise the barrier if there is no pending IO.
|
|
|
|
* i.e. if nr_pending == 0.
|
|
|
|
* We choose only to raise the barrier if no-one is waiting for the
|
|
|
|
* barrier to go down. This means that as soon as an IO request
|
|
|
|
* is ready, no other operations which require a barrier will start
|
|
|
|
* until the IO request has had a chance.
|
|
|
|
*
|
|
|
|
* So: regular IO calls 'wait_barrier'. When that returns there
|
|
|
|
* is no backgroup IO happening, It must arrange to call
|
|
|
|
* allow_barrier when it has finished its IO.
|
|
|
|
* backgroup IO calls must call raise_barrier. Once that returns
|
|
|
|
* there is no normal IO happeing. It must arrange to call
|
|
|
|
* lower_barrier when the particular background IO completes.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void raise_barrier(struct r10conf *conf, int force)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-01-06 09:20:16 +01:00
|
|
|
BUG_ON(force && !conf->barrier);
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_lock_irq(&conf->resync_lock);
|
2006-01-06 09:20:13 +01:00
|
|
|
|
2006-01-06 09:20:16 +01:00
|
|
|
/* Wait until no block IO is waiting (unless 'force') */
|
|
|
|
wait_event_lock_irq(conf->wait_barrier, force || !conf->nr_waiting,
|
2011-04-18 10:25:43 +02:00
|
|
|
conf->resync_lock, );
|
2006-01-06 09:20:13 +01:00
|
|
|
|
|
|
|
/* block any new IO from starting */
|
|
|
|
conf->barrier++;
|
|
|
|
|
2011-04-18 10:25:43 +02:00
|
|
|
/* Now wait for all pending IO to complete */
|
2006-01-06 09:20:13 +01:00
|
|
|
wait_event_lock_irq(conf->wait_barrier,
|
|
|
|
!conf->nr_pending && conf->barrier < RESYNC_DEPTH,
|
2011-04-18 10:25:43 +02:00
|
|
|
conf->resync_lock, );
|
2006-01-06 09:20:13 +01:00
|
|
|
|
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void lower_barrier(struct r10conf *conf)
|
2006-01-06 09:20:13 +01:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
spin_lock_irqsave(&conf->resync_lock, flags);
|
|
|
|
conf->barrier--;
|
|
|
|
spin_unlock_irqrestore(&conf->resync_lock, flags);
|
|
|
|
wake_up(&conf->wait_barrier);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void wait_barrier(struct r10conf *conf)
|
2006-01-06 09:20:13 +01:00
|
|
|
{
|
|
|
|
spin_lock_irq(&conf->resync_lock);
|
|
|
|
if (conf->barrier) {
|
|
|
|
conf->nr_waiting++;
|
|
|
|
wait_event_lock_irq(conf->wait_barrier, !conf->barrier,
|
|
|
|
conf->resync_lock,
|
2011-04-18 10:25:43 +02:00
|
|
|
);
|
2006-01-06 09:20:13 +01:00
|
|
|
conf->nr_waiting--;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2006-01-06 09:20:13 +01:00
|
|
|
conf->nr_pending++;
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void allow_barrier(struct r10conf *conf)
|
2006-01-06 09:20:13 +01:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
spin_lock_irqsave(&conf->resync_lock, flags);
|
|
|
|
conf->nr_pending--;
|
|
|
|
spin_unlock_irqrestore(&conf->resync_lock, flags);
|
|
|
|
wake_up(&conf->wait_barrier);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void freeze_array(struct r10conf *conf)
|
2006-01-06 09:20:28 +01:00
|
|
|
{
|
|
|
|
/* stop syncio and normal IO and wait for everything to
|
2006-01-06 09:20:42 +01:00
|
|
|
* go quiet.
|
2006-01-06 09:20:28 +01:00
|
|
|
* We increment barrier and nr_waiting, and then
|
2008-03-04 23:29:35 +01:00
|
|
|
* wait until nr_pending match nr_queued+1
|
|
|
|
* This is called in the context of one normal IO request
|
|
|
|
* that has failed. Thus any sync request that might be pending
|
|
|
|
* will be blocked by nr_pending, and we need to wait for
|
|
|
|
* pending IO requests to complete or be queued for re-try.
|
|
|
|
* Thus the number queued (nr_queued) plus this request (1)
|
|
|
|
* must match the number of pending IOs (nr_pending) before
|
|
|
|
* we continue.
|
2006-01-06 09:20:28 +01:00
|
|
|
*/
|
|
|
|
spin_lock_irq(&conf->resync_lock);
|
|
|
|
conf->barrier++;
|
|
|
|
conf->nr_waiting++;
|
|
|
|
wait_event_lock_irq(conf->wait_barrier,
|
2008-03-04 23:29:35 +01:00
|
|
|
conf->nr_pending == conf->nr_queued+1,
|
2006-01-06 09:20:28 +01:00
|
|
|
conf->resync_lock,
|
2011-04-18 10:25:43 +02:00
|
|
|
flush_pending_writes(conf));
|
|
|
|
|
2006-01-06 09:20:28 +01:00
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void unfreeze_array(struct r10conf *conf)
|
2006-01-06 09:20:28 +01:00
|
|
|
{
|
|
|
|
/* reverse the effect of the freeze */
|
|
|
|
spin_lock_irq(&conf->resync_lock);
|
|
|
|
conf->barrier--;
|
|
|
|
conf->nr_waiting--;
|
|
|
|
wake_up(&conf->wait_barrier);
|
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
}
|
|
|
|
|
2011-11-05 01:06:58 +01:00
|
|
|
static void make_request(struct mddev *mddev, struct bio * bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct bio *read_bio;
|
|
|
|
int i;
|
|
|
|
int chunk_sects = conf->chunk_mask + 1;
|
2005-11-01 09:26:16 +01:00
|
|
|
const int rw = bio_data_dir(bio);
|
2010-08-18 08:16:05 +02:00
|
|
|
const unsigned long do_sync = (bio->bi_rw & REQ_SYNC);
|
2010-09-03 11:56:18 +02:00
|
|
|
const unsigned long do_fua = (bio->bi_rw & REQ_FUA);
|
2006-01-06 09:20:16 +01:00
|
|
|
unsigned long flags;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *blocked_rdev;
|
2011-04-18 10:25:43 +02:00
|
|
|
int plugged;
|
2011-07-28 03:39:24 +02:00
|
|
|
int sectors_handled;
|
|
|
|
int max_sectors;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-09-03 11:56:18 +02:00
|
|
|
if (unlikely(bio->bi_rw & REQ_FLUSH)) {
|
|
|
|
md_flush_request(mddev, bio);
|
2011-09-12 12:12:01 +02:00
|
|
|
return;
|
2005-09-10 01:23:41 +02:00
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* If this request crosses a chunk boundary, we need to
|
|
|
|
* split it. This will only happen for 1 PAGE (or less) requests.
|
|
|
|
*/
|
|
|
|
if (unlikely( (bio->bi_sector & conf->chunk_mask) + (bio->bi_size >> 9)
|
|
|
|
> chunk_sects &&
|
|
|
|
conf->near_copies < conf->raid_disks)) {
|
|
|
|
struct bio_pair *bp;
|
|
|
|
/* Sanity check -- queue functions should prevent this happening */
|
|
|
|
if (bio->bi_vcnt != 1 ||
|
|
|
|
bio->bi_idx != 0)
|
|
|
|
goto bad_map;
|
|
|
|
/* This is a one page bio that upper layers
|
|
|
|
* refuse to split for us, so we need to split it.
|
|
|
|
*/
|
2008-10-09 08:57:05 +02:00
|
|
|
bp = bio_split(bio,
|
2005-04-17 00:20:36 +02:00
|
|
|
chunk_sects - (bio->bi_sector & (chunk_sects - 1)) );
|
2010-08-07 13:17:00 +02:00
|
|
|
|
|
|
|
/* Each of these 'make_request' calls will call 'wait_barrier'.
|
|
|
|
* If the first succeeds but the second blocks due to the resync
|
|
|
|
* thread raising the barrier, we will deadlock because the
|
|
|
|
* IO to the underlying device will be queued in generic_make_request
|
|
|
|
* and will never complete, so will never reduce nr_pending.
|
|
|
|
* So increment nr_waiting here so no new raise_barriers will
|
|
|
|
* succeed, and so the second wait_barrier cannot block.
|
|
|
|
*/
|
|
|
|
spin_lock_irq(&conf->resync_lock);
|
|
|
|
conf->nr_waiting++;
|
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
|
2011-09-12 12:12:01 +02:00
|
|
|
make_request(mddev, &bp->bio1);
|
|
|
|
make_request(mddev, &bp->bio2);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-08-07 13:17:00 +02:00
|
|
|
spin_lock_irq(&conf->resync_lock);
|
|
|
|
conf->nr_waiting--;
|
|
|
|
wake_up(&conf->wait_barrier);
|
|
|
|
spin_unlock_irq(&conf->resync_lock);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
bio_pair_release(bp);
|
2011-09-12 12:12:01 +02:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
bad_map:
|
2010-05-03 06:47:14 +02:00
|
|
|
printk("md/raid10:%s: make_request bug: can't convert block across chunks"
|
|
|
|
" or bigger than %dk %llu %d\n", mdname(mddev), chunk_sects/2,
|
2005-04-17 00:20:36 +02:00
|
|
|
(unsigned long long)bio->bi_sector, bio->bi_size >> 10);
|
|
|
|
|
2007-09-27 12:47:43 +02:00
|
|
|
bio_io_error(bio);
|
2011-09-12 12:12:01 +02:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-06-22 02:17:26 +02:00
|
|
|
md_write_start(mddev, bio);
|
2005-06-22 02:17:12 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Register the new request and wait if the reconstruction
|
|
|
|
* thread has put up a bar for new requests.
|
|
|
|
* Continue immediately if no resync is active currently.
|
|
|
|
*/
|
2006-01-06 09:20:13 +01:00
|
|
|
wait_barrier(conf);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
r10_bio = mempool_alloc(conf->r10bio_pool, GFP_NOIO);
|
|
|
|
|
|
|
|
r10_bio->master_bio = bio;
|
|
|
|
r10_bio->sectors = bio->bi_size >> 9;
|
|
|
|
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
r10_bio->sector = bio->bi_sector;
|
2006-01-06 09:20:16 +01:00
|
|
|
r10_bio->state = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-28 03:39:23 +02:00
|
|
|
/* We might need to issue multiple reads to different
|
|
|
|
* devices if there are bad blocks around, so we keep
|
|
|
|
* track of the number of reads in bio->bi_phys_segments.
|
|
|
|
* If this is 0, there is only one r10_bio and no locking
|
|
|
|
* will be needed when the request completes. If it is
|
|
|
|
* non-zero, then it is the number of not-completed requests.
|
|
|
|
*/
|
|
|
|
bio->bi_phys_segments = 0;
|
|
|
|
clear_bit(BIO_SEG_VALID, &bio->bi_flags);
|
|
|
|
|
2005-11-01 09:26:16 +01:00
|
|
|
if (rw == READ) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* read balancing logic:
|
|
|
|
*/
|
2011-12-23 00:17:54 +01:00
|
|
|
struct md_rdev *rdev;
|
2011-07-28 03:39:23 +02:00
|
|
|
int slot;
|
|
|
|
|
|
|
|
read_again:
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = read_balance(conf, r10_bio, &max_sectors);
|
|
|
|
if (!rdev) {
|
2005-04-17 00:20:36 +02:00
|
|
|
raid_end_bio_io(r10_bio);
|
2011-09-12 12:12:01 +02:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-12-23 00:17:54 +01:00
|
|
|
slot = r10_bio->read_slot;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-10-26 09:31:13 +02:00
|
|
|
read_bio = bio_clone_mddev(bio, GFP_NOIO, mddev);
|
2011-07-28 03:39:23 +02:00
|
|
|
md_trim_bio(read_bio, r10_bio->sector - bio->bi_sector,
|
|
|
|
max_sectors);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
r10_bio->devs[slot].bio = read_bio;
|
2011-12-23 00:17:54 +01:00
|
|
|
r10_bio->devs[slot].rdev = rdev;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
read_bio->bi_sector = r10_bio->devs[slot].addr +
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev->data_offset;
|
|
|
|
read_bio->bi_bdev = rdev->bdev;
|
2005-04-17 00:20:36 +02:00
|
|
|
read_bio->bi_end_io = raid10_end_read_request;
|
2010-08-07 18:20:39 +02:00
|
|
|
read_bio->bi_rw = READ | do_sync;
|
2005-04-17 00:20:36 +02:00
|
|
|
read_bio->bi_private = r10_bio;
|
|
|
|
|
2011-07-28 03:39:23 +02:00
|
|
|
if (max_sectors < r10_bio->sectors) {
|
|
|
|
/* Could not read all from this device, so we will
|
|
|
|
* need another r10_bio.
|
|
|
|
*/
|
|
|
|
sectors_handled = (r10_bio->sectors + max_sectors
|
|
|
|
- bio->bi_sector);
|
|
|
|
r10_bio->sectors = max_sectors;
|
|
|
|
spin_lock_irq(&conf->device_lock);
|
|
|
|
if (bio->bi_phys_segments == 0)
|
|
|
|
bio->bi_phys_segments = 2;
|
|
|
|
else
|
|
|
|
bio->bi_phys_segments++;
|
|
|
|
spin_unlock(&conf->device_lock);
|
|
|
|
/* Cannot call generic_make_request directly
|
|
|
|
* as that will be queued in __generic_make_request
|
|
|
|
* and subsequent mempool_alloc might block
|
|
|
|
* waiting for it. so hand bio over to raid10d.
|
|
|
|
*/
|
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
|
|
|
|
r10_bio = mempool_alloc(conf->r10bio_pool, GFP_NOIO);
|
|
|
|
|
|
|
|
r10_bio->master_bio = bio;
|
|
|
|
r10_bio->sectors = ((bio->bi_size >> 9)
|
|
|
|
- sectors_handled);
|
|
|
|
r10_bio->state = 0;
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
r10_bio->sector = bio->bi_sector + sectors_handled;
|
|
|
|
goto read_again;
|
|
|
|
} else
|
|
|
|
generic_make_request(read_bio);
|
2011-09-12 12:12:01 +02:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* WRITE:
|
|
|
|
*/
|
2011-10-11 07:50:01 +02:00
|
|
|
if (conf->pending_count >= max_queued_requests) {
|
|
|
|
md_wakeup_thread(mddev->thread);
|
|
|
|
wait_event(conf->wait_barrier,
|
|
|
|
conf->pending_count < max_queued_requests);
|
|
|
|
}
|
2008-04-30 09:52:32 +02:00
|
|
|
/* first select target devices under rcu_lock and
|
2005-04-17 00:20:36 +02:00
|
|
|
* inc refcount on their rdev. Record them by setting
|
|
|
|
* bios[x] to bio
|
2011-07-28 03:39:24 +02:00
|
|
|
* If there are known/acknowledged bad blocks on any device
|
|
|
|
* on which we have seen a write error, we want to avoid
|
|
|
|
* writing to those blocks. This potentially requires several
|
|
|
|
* writes to write around the bad blocks. Each set of writes
|
|
|
|
* gets its own r10_bio with a set of bios attached. The number
|
|
|
|
* of r10_bios is recored in bio->bi_phys_segments just as with
|
|
|
|
* the read case.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2011-04-18 10:25:43 +02:00
|
|
|
plugged = mddev_check_plugged(mddev);
|
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
r10_bio->read_slot = -1; /* make sure repl_bio gets freed */
|
2005-04-17 00:20:36 +02:00
|
|
|
raid10_find_phys(conf, r10_bio);
|
2011-07-28 03:39:24 +02:00
|
|
|
retry_write:
|
2008-05-07 05:42:32 +02:00
|
|
|
blocked_rdev = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_lock();
|
2011-07-28 03:39:24 +02:00
|
|
|
max_sectors = r10_bio->sectors;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
for (i = 0; i < conf->copies; i++) {
|
|
|
|
int d = r10_bio->devs[i].devnum;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev = rcu_dereference(conf->mirrors[d].rdev);
|
2008-04-30 09:52:32 +02:00
|
|
|
if (rdev && unlikely(test_bit(Blocked, &rdev->flags))) {
|
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
blocked_rdev = rdev;
|
|
|
|
break;
|
|
|
|
}
|
2011-07-28 03:39:24 +02:00
|
|
|
r10_bio->devs[i].bio = NULL;
|
|
|
|
if (!rdev || test_bit(Faulty, &rdev->flags)) {
|
2006-01-06 09:20:16 +01:00
|
|
|
set_bit(R10BIO_Degraded, &r10_bio->state);
|
2011-07-28 03:39:24 +02:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (test_bit(WriteErrorSeen, &rdev->flags)) {
|
|
|
|
sector_t first_bad;
|
|
|
|
sector_t dev_sector = r10_bio->devs[i].addr;
|
|
|
|
int bad_sectors;
|
|
|
|
int is_bad;
|
|
|
|
|
|
|
|
is_bad = is_badblock(rdev, dev_sector,
|
|
|
|
max_sectors,
|
|
|
|
&first_bad, &bad_sectors);
|
|
|
|
if (is_bad < 0) {
|
|
|
|
/* Mustn't write here until the bad block
|
|
|
|
* is acknowledged
|
|
|
|
*/
|
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
set_bit(BlockedBadBlocks, &rdev->flags);
|
|
|
|
blocked_rdev = rdev;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (is_bad && first_bad <= dev_sector) {
|
|
|
|
/* Cannot write here at all */
|
|
|
|
bad_sectors -= (dev_sector - first_bad);
|
|
|
|
if (bad_sectors < max_sectors)
|
|
|
|
/* Mustn't write more than bad_sectors
|
|
|
|
* to other devices yet
|
|
|
|
*/
|
|
|
|
max_sectors = bad_sectors;
|
|
|
|
/* We don't set R10BIO_Degraded as that
|
|
|
|
* only applies if the disk is missing,
|
|
|
|
* so it might be re-added, and we want to
|
|
|
|
* know to recover this chunk.
|
|
|
|
* In this case the device is here, and the
|
|
|
|
* fact that this chunk is not in-sync is
|
|
|
|
* recorded in the bad block log.
|
|
|
|
*/
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (is_bad) {
|
|
|
|
int good_sectors = first_bad - dev_sector;
|
|
|
|
if (good_sectors < max_sectors)
|
|
|
|
max_sectors = good_sectors;
|
|
|
|
}
|
2006-01-06 09:20:16 +01:00
|
|
|
}
|
2011-07-28 03:39:24 +02:00
|
|
|
r10_bio->devs[i].bio = bio;
|
|
|
|
atomic_inc(&rdev->nr_pending);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
2008-04-30 09:52:32 +02:00
|
|
|
if (unlikely(blocked_rdev)) {
|
|
|
|
/* Have to wait for this device to get unblocked, then retry */
|
|
|
|
int j;
|
|
|
|
int d;
|
|
|
|
|
|
|
|
for (j = 0; j < i; j++)
|
|
|
|
if (r10_bio->devs[j].bio) {
|
|
|
|
d = r10_bio->devs[j].devnum;
|
|
|
|
rdev_dec_pending(conf->mirrors[d].rdev, mddev);
|
|
|
|
}
|
|
|
|
allow_barrier(conf);
|
|
|
|
md_wait_for_blocked_rdev(blocked_rdev, mddev);
|
|
|
|
wait_barrier(conf);
|
|
|
|
goto retry_write;
|
|
|
|
}
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
if (max_sectors < r10_bio->sectors) {
|
|
|
|
/* We are splitting this into multiple parts, so
|
|
|
|
* we need to prepare for allocating another r10_bio.
|
|
|
|
*/
|
|
|
|
r10_bio->sectors = max_sectors;
|
|
|
|
spin_lock_irq(&conf->device_lock);
|
|
|
|
if (bio->bi_phys_segments == 0)
|
|
|
|
bio->bi_phys_segments = 2;
|
|
|
|
else
|
|
|
|
bio->bi_phys_segments++;
|
|
|
|
spin_unlock_irq(&conf->device_lock);
|
|
|
|
}
|
|
|
|
sectors_handled = r10_bio->sector + max_sectors - bio->bi_sector;
|
|
|
|
|
2010-10-19 03:54:01 +02:00
|
|
|
atomic_set(&r10_bio->remaining, 1);
|
2011-07-28 03:39:24 +02:00
|
|
|
bitmap_startwrite(mddev->bitmap, r10_bio->sector, r10_bio->sectors, 0);
|
2005-06-22 02:17:12 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
for (i = 0; i < conf->copies; i++) {
|
|
|
|
struct bio *mbio;
|
|
|
|
int d = r10_bio->devs[i].devnum;
|
|
|
|
if (!r10_bio->devs[i].bio)
|
|
|
|
continue;
|
|
|
|
|
2010-10-26 09:31:13 +02:00
|
|
|
mbio = bio_clone_mddev(bio, GFP_NOIO, mddev);
|
2011-07-28 03:39:24 +02:00
|
|
|
md_trim_bio(mbio, r10_bio->sector - bio->bi_sector,
|
|
|
|
max_sectors);
|
2005-04-17 00:20:36 +02:00
|
|
|
r10_bio->devs[i].bio = mbio;
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
mbio->bi_sector = (r10_bio->devs[i].addr+
|
|
|
|
conf->mirrors[d].rdev->data_offset);
|
2005-04-17 00:20:36 +02:00
|
|
|
mbio->bi_bdev = conf->mirrors[d].rdev->bdev;
|
|
|
|
mbio->bi_end_io = raid10_end_write_request;
|
2010-09-03 11:56:18 +02:00
|
|
|
mbio->bi_rw = WRITE | do_sync | do_fua;
|
2005-04-17 00:20:36 +02:00
|
|
|
mbio->bi_private = r10_bio;
|
|
|
|
|
|
|
|
atomic_inc(&r10_bio->remaining);
|
2010-10-19 03:54:01 +02:00
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
|
|
|
bio_list_add(&conf->pending_bio_list, mbio);
|
2011-10-11 07:50:01 +02:00
|
|
|
conf->pending_count++;
|
2010-10-19 03:54:01 +02:00
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-09-10 09:21:23 +02:00
|
|
|
/* Don't remove the bias on 'remaining' (one_write_done) until
|
|
|
|
* after checking if we need to go around again.
|
|
|
|
*/
|
2008-03-04 23:29:29 +01:00
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
if (sectors_handled < (bio->bi_size >> 9)) {
|
2011-09-10 09:21:23 +02:00
|
|
|
one_write_done(r10_bio);
|
2011-07-28 03:39:25 +02:00
|
|
|
/* We need another r10_bio. It has already been counted
|
2011-07-28 03:39:24 +02:00
|
|
|
* in bio->bi_phys_segments.
|
|
|
|
*/
|
|
|
|
r10_bio = mempool_alloc(conf->r10bio_pool, GFP_NOIO);
|
|
|
|
|
|
|
|
r10_bio->master_bio = bio;
|
|
|
|
r10_bio->sectors = (bio->bi_size >> 9) - sectors_handled;
|
|
|
|
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
r10_bio->sector = bio->bi_sector + sectors_handled;
|
|
|
|
r10_bio->state = 0;
|
|
|
|
goto retry_write;
|
|
|
|
}
|
2011-09-10 09:21:23 +02:00
|
|
|
one_write_done(r10_bio);
|
|
|
|
|
|
|
|
/* In case raid10d snuck in to freeze_array */
|
|
|
|
wake_up(&conf->wait_barrier);
|
2011-07-28 03:39:24 +02:00
|
|
|
|
2011-04-18 10:25:43 +02:00
|
|
|
if (do_sync || !mddev->bitmap || !plugged)
|
2007-01-11 08:15:37 +01:00
|
|
|
md_wakeup_thread(mddev->thread);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void status(struct seq_file *seq, struct mddev *mddev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if (conf->near_copies < conf->raid_disks)
|
2009-06-18 00:45:01 +02:00
|
|
|
seq_printf(seq, " %dK chunks", mddev->chunk_sectors / 2);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (conf->near_copies > 1)
|
|
|
|
seq_printf(seq, " %d near-copies", conf->near_copies);
|
2006-06-26 09:27:41 +02:00
|
|
|
if (conf->far_copies > 1) {
|
|
|
|
if (conf->far_offset)
|
|
|
|
seq_printf(seq, " %d offset-copies", conf->far_copies);
|
|
|
|
else
|
|
|
|
seq_printf(seq, " %d far-copies", conf->far_copies);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
seq_printf(seq, " [%d/%d] [", conf->raid_disks,
|
2006-10-03 10:15:48 +02:00
|
|
|
conf->raid_disks - mddev->degraded);
|
2005-04-17 00:20:36 +02:00
|
|
|
for (i = 0; i < conf->raid_disks; i++)
|
|
|
|
seq_printf(seq, "%s",
|
|
|
|
conf->mirrors[i].rdev &&
|
2005-11-09 06:39:31 +01:00
|
|
|
test_bit(In_sync, &conf->mirrors[i].rdev->flags) ? "U" : "_");
|
2005-04-17 00:20:36 +02:00
|
|
|
seq_printf(seq, "]");
|
|
|
|
}
|
|
|
|
|
2011-07-27 03:00:36 +02:00
|
|
|
/* check if there are enough drives for
|
|
|
|
* every block to appear on atleast one.
|
|
|
|
* Don't consider the device numbered 'ignore'
|
|
|
|
* as we might be about to remove it.
|
|
|
|
*/
|
2011-10-11 07:49:02 +02:00
|
|
|
static int enough(struct r10conf *conf, int ignore)
|
2011-07-27 03:00:36 +02:00
|
|
|
{
|
|
|
|
int first = 0;
|
|
|
|
|
|
|
|
do {
|
|
|
|
int n = conf->copies;
|
|
|
|
int cnt = 0;
|
|
|
|
while (n--) {
|
|
|
|
if (conf->mirrors[first].rdev &&
|
|
|
|
first != ignore)
|
|
|
|
cnt++;
|
|
|
|
first = (first+1) % conf->raid_disks;
|
|
|
|
}
|
|
|
|
if (cnt == 0)
|
|
|
|
return 0;
|
|
|
|
} while (first != 0);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void error(struct mddev *mddev, struct md_rdev *rdev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
char b[BDEVNAME_SIZE];
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If it is not operational, then we have already marked it as dead
|
|
|
|
* else if it is the last working disks, ignore the error, let the
|
|
|
|
* next level up know.
|
|
|
|
* else mark the drive as failed
|
|
|
|
*/
|
2005-11-09 06:39:31 +01:00
|
|
|
if (test_bit(In_sync, &rdev->flags)
|
2011-07-27 03:00:36 +02:00
|
|
|
&& !enough(conf, rdev->raid_disk))
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Don't fail the drive, just return an IO error.
|
|
|
|
*/
|
|
|
|
return;
|
2006-10-03 10:15:53 +02:00
|
|
|
if (test_and_clear_bit(In_sync, &rdev->flags)) {
|
|
|
|
unsigned long flags;
|
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
mddev->degraded++;
|
2006-10-03 10:15:53 +02:00
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* if recovery is running, make sure it aborts.
|
|
|
|
*/
|
md: restart recovery cleanly after device failure.
When we get any IO error during a recovery (rebuilding a spare), we abort
the recovery and restart it.
For RAID6 (and multi-drive RAID1) it may not be best to restart at the
beginning: when multiple failures can be tolerated, the recovery may be
able to continue and re-doing all that has already been done doesn't make
sense.
We already have the infrastructure to record where a recovery is up to
and restart from there, but it is not being used properly.
This is because:
- We sometimes abort with MD_RECOVERY_ERR rather than just MD_RECOVERY_INTR,
which causes the recovery not be be checkpointed.
- We remove spares and then re-added them which loses important state
information.
The distinction between MD_RECOVERY_ERR and MD_RECOVERY_INTR really isn't
needed. If there is an error, the relevant drive will be marked as
Faulty, and that is enough to ensure correct handling of the error. So we
first remove MD_RECOVERY_ERR, changing some of the uses of it to
MD_RECOVERY_INTR.
Then we cause the attempt to remove a non-faulty device from an array to
fail (unless recovery is impossible as the array is too degraded). Then
when remove_and_add_spares attempts to remove the devices on which
recovery can continue, it will fail, they will remain in place, and
recovery will continue on them as desired.
Issue: If we are halfway through rebuilding a spare and another drive
fails, and a new spare is immediately available, do we want to:
1/ complete the current rebuild, then go back and rebuild the new spare or
2/ restart the rebuild from the start and rebuild both devices in
parallel.
Both options can be argued for. The code currently takes option 2 as
a/ this requires least code change
b/ this results in a minimally-degraded array in minimal time.
Cc: "Eivind Sarto" <ivan@kasenna.com>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-05-23 22:04:39 +02:00
|
|
|
set_bit(MD_RECOVERY_INTR, &mddev->recovery);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-07-28 03:31:48 +02:00
|
|
|
set_bit(Blocked, &rdev->flags);
|
2005-11-09 06:39:31 +01:00
|
|
|
set_bit(Faulty, &rdev->flags);
|
2006-10-03 10:15:46 +02:00
|
|
|
set_bit(MD_CHANGE_DEVS, &mddev->flags);
|
2011-01-13 23:14:33 +01:00
|
|
|
printk(KERN_ALERT
|
|
|
|
"md/raid10:%s: Disk failure on %s, disabling device.\n"
|
|
|
|
"md/raid10:%s: Operation continuing on %d devices.\n",
|
2010-05-03 06:47:14 +02:00
|
|
|
mdname(mddev), bdevname(rdev->bdev, b),
|
|
|
|
mdname(mddev), conf->raid_disks - mddev->degraded);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void print_conf(struct r10conf *conf)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
2011-10-11 07:48:46 +02:00
|
|
|
struct mirror_info *tmp;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_DEBUG "RAID10 conf printout:\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!conf) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_DEBUG "(!conf)\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
}
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_DEBUG " --- wd:%d rd:%d\n", conf->raid_disks - conf->mddev->degraded,
|
2005-04-17 00:20:36 +02:00
|
|
|
conf->raid_disks);
|
|
|
|
|
|
|
|
for (i = 0; i < conf->raid_disks; i++) {
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
tmp = conf->mirrors + i;
|
|
|
|
if (tmp->rdev)
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_DEBUG " disk %d, wo:%d, o:%d, dev:%s\n",
|
2005-11-09 06:39:31 +01:00
|
|
|
i, !test_bit(In_sync, &tmp->rdev->flags),
|
|
|
|
!test_bit(Faulty, &tmp->rdev->flags),
|
2005-04-17 00:20:36 +02:00
|
|
|
bdevname(tmp->rdev->bdev,b));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void close_sync(struct r10conf *conf)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-01-06 09:20:13 +01:00
|
|
|
wait_barrier(conf);
|
|
|
|
allow_barrier(conf);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
mempool_destroy(conf->r10buf_pool);
|
|
|
|
conf->r10buf_pool = NULL;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static int raid10_spare_active(struct mddev *mddev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-10-11 07:48:46 +02:00
|
|
|
struct mirror_info *tmp;
|
2010-08-18 03:56:59 +02:00
|
|
|
int count = 0;
|
|
|
|
unsigned long flags;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Find all non-in_sync disks within the RAID10 configuration
|
|
|
|
* and mark them in_sync
|
|
|
|
*/
|
|
|
|
for (i = 0; i < conf->raid_disks; i++) {
|
|
|
|
tmp = conf->mirrors + i;
|
|
|
|
if (tmp->rdev
|
2005-11-09 06:39:31 +01:00
|
|
|
&& !test_bit(Faulty, &tmp->rdev->flags)
|
2006-10-03 10:15:53 +02:00
|
|
|
&& !test_and_set_bit(In_sync, &tmp->rdev->flags)) {
|
2010-08-18 03:56:59 +02:00
|
|
|
count++;
|
2010-08-18 03:49:02 +02:00
|
|
|
sysfs_notify_dirent(tmp->rdev->sysfs_state);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
2010-08-18 03:56:59 +02:00
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
|
|
|
mddev->degraded -= count;
|
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
print_conf(conf);
|
2010-08-18 03:56:59 +02:00
|
|
|
return count;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static int raid10_add_disk(struct mddev *mddev, struct md_rdev *rdev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2008-06-28 00:31:33 +02:00
|
|
|
int err = -EEXIST;
|
2005-04-17 00:20:36 +02:00
|
|
|
int mirror;
|
2008-06-28 00:31:31 +02:00
|
|
|
int first = 0;
|
2010-03-16 07:23:35 +01:00
|
|
|
int last = conf->raid_disks - 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (mddev->recovery_cp < MaxSector)
|
|
|
|
/* only hot-add to in-sync arrays, as recovery is
|
|
|
|
* very different from resync
|
|
|
|
*/
|
2008-06-28 00:31:33 +02:00
|
|
|
return -EBUSY;
|
2011-07-27 03:00:36 +02:00
|
|
|
if (!enough(conf, -1))
|
2008-06-28 00:31:33 +02:00
|
|
|
return -EINVAL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-11-06 07:28:20 +01:00
|
|
|
if (rdev->raid_disk >= 0)
|
2008-06-28 00:31:31 +02:00
|
|
|
first = last = rdev->raid_disk;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-18 09:38:43 +02:00
|
|
|
if (rdev->saved_raid_disk >= first &&
|
2006-01-06 09:20:16 +01:00
|
|
|
conf->mirrors[rdev->saved_raid_disk].rdev == NULL)
|
|
|
|
mirror = rdev->saved_raid_disk;
|
|
|
|
else
|
2008-06-28 00:31:31 +02:00
|
|
|
mirror = first;
|
2011-07-27 03:00:36 +02:00
|
|
|
for ( ; mirror <= last ; mirror++) {
|
2011-10-11 07:48:46 +02:00
|
|
|
struct mirror_info *p = &conf->mirrors[mirror];
|
2011-07-27 03:00:36 +02:00
|
|
|
if (p->recovery_disabled == mddev->recovery_disabled)
|
|
|
|
continue;
|
2011-10-31 02:59:44 +01:00
|
|
|
if (p->rdev)
|
2011-07-27 03:00:36 +02:00
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-27 03:00:36 +02:00
|
|
|
disk_stack_limits(mddev->gendisk, rdev->bdev,
|
|
|
|
rdev->data_offset << 9);
|
|
|
|
/* as we don't honour merge_bvec_fn, we must
|
|
|
|
* never risk violating it, so limit
|
|
|
|
* ->max_segments to one lying with a single
|
|
|
|
* page, as a one page request is never in
|
|
|
|
* violation.
|
|
|
|
*/
|
|
|
|
if (rdev->bdev->bd_disk->queue->merge_bvec_fn) {
|
|
|
|
blk_queue_max_segments(mddev->queue, 1);
|
|
|
|
blk_queue_segment_boundary(mddev->queue,
|
|
|
|
PAGE_CACHE_SIZE - 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-07-27 03:00:36 +02:00
|
|
|
p->head_position = 0;
|
2011-10-26 02:54:39 +02:00
|
|
|
p->recovery_disabled = mddev->recovery_disabled - 1;
|
2011-07-27 03:00:36 +02:00
|
|
|
rdev->raid_disk = mirror;
|
|
|
|
err = 0;
|
|
|
|
if (rdev->saved_raid_disk != mirror)
|
|
|
|
conf->fullsync = 1;
|
|
|
|
rcu_assign_pointer(p->rdev, rdev);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-08-03 02:59:47 +02:00
|
|
|
md_integrity_add_rdev(rdev, mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
print_conf(conf);
|
2008-06-28 00:31:33 +02:00
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-12-23 00:17:51 +01:00
|
|
|
static int raid10_remove_disk(struct mddev *mddev, struct md_rdev *rdev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
int err = 0;
|
2011-12-23 00:17:51 +01:00
|
|
|
int number = rdev->raid_disk;
|
2011-10-11 07:48:46 +02:00
|
|
|
struct mirror_info *p = conf->mirrors+ number;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
print_conf(conf);
|
2011-12-23 00:17:51 +01:00
|
|
|
if (rdev == p->rdev) {
|
2005-11-09 06:39:31 +01:00
|
|
|
if (test_bit(In_sync, &rdev->flags) ||
|
2005-04-17 00:20:36 +02:00
|
|
|
atomic_read(&rdev->nr_pending)) {
|
|
|
|
err = -EBUSY;
|
|
|
|
goto abort;
|
|
|
|
}
|
md: restart recovery cleanly after device failure.
When we get any IO error during a recovery (rebuilding a spare), we abort
the recovery and restart it.
For RAID6 (and multi-drive RAID1) it may not be best to restart at the
beginning: when multiple failures can be tolerated, the recovery may be
able to continue and re-doing all that has already been done doesn't make
sense.
We already have the infrastructure to record where a recovery is up to
and restart from there, but it is not being used properly.
This is because:
- We sometimes abort with MD_RECOVERY_ERR rather than just MD_RECOVERY_INTR,
which causes the recovery not be be checkpointed.
- We remove spares and then re-added them which loses important state
information.
The distinction between MD_RECOVERY_ERR and MD_RECOVERY_INTR really isn't
needed. If there is an error, the relevant drive will be marked as
Faulty, and that is enough to ensure correct handling of the error. So we
first remove MD_RECOVERY_ERR, changing some of the uses of it to
MD_RECOVERY_INTR.
Then we cause the attempt to remove a non-faulty device from an array to
fail (unless recovery is impossible as the array is too degraded). Then
when remove_and_add_spares attempts to remove the devices on which
recovery can continue, it will fail, they will remain in place, and
recovery will continue on them as desired.
Issue: If we are halfway through rebuilding a spare and another drive
fails, and a new spare is immediately available, do we want to:
1/ complete the current rebuild, then go back and rebuild the new spare or
2/ restart the rebuild from the start and rebuild both devices in
parallel.
Both options can be argued for. The code currently takes option 2 as
a/ this requires least code change
b/ this results in a minimally-degraded array in minimal time.
Cc: "Eivind Sarto" <ivan@kasenna.com>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-05-23 22:04:39 +02:00
|
|
|
/* Only remove faulty devices in recovery
|
|
|
|
* is not possible.
|
|
|
|
*/
|
|
|
|
if (!test_bit(Faulty, &rdev->flags) &&
|
2011-07-27 03:00:36 +02:00
|
|
|
mddev->recovery_disabled != p->recovery_disabled &&
|
2011-07-27 03:00:36 +02:00
|
|
|
enough(conf, -1)) {
|
md: restart recovery cleanly after device failure.
When we get any IO error during a recovery (rebuilding a spare), we abort
the recovery and restart it.
For RAID6 (and multi-drive RAID1) it may not be best to restart at the
beginning: when multiple failures can be tolerated, the recovery may be
able to continue and re-doing all that has already been done doesn't make
sense.
We already have the infrastructure to record where a recovery is up to
and restart from there, but it is not being used properly.
This is because:
- We sometimes abort with MD_RECOVERY_ERR rather than just MD_RECOVERY_INTR,
which causes the recovery not be be checkpointed.
- We remove spares and then re-added them which loses important state
information.
The distinction between MD_RECOVERY_ERR and MD_RECOVERY_INTR really isn't
needed. If there is an error, the relevant drive will be marked as
Faulty, and that is enough to ensure correct handling of the error. So we
first remove MD_RECOVERY_ERR, changing some of the uses of it to
MD_RECOVERY_INTR.
Then we cause the attempt to remove a non-faulty device from an array to
fail (unless recovery is impossible as the array is too degraded). Then
when remove_and_add_spares attempts to remove the devices on which
recovery can continue, it will fail, they will remain in place, and
recovery will continue on them as desired.
Issue: If we are halfway through rebuilding a spare and another drive
fails, and a new spare is immediately available, do we want to:
1/ complete the current rebuild, then go back and rebuild the new spare or
2/ restart the rebuild from the start and rebuild both devices in
parallel.
Both options can be argued for. The code currently takes option 2 as
a/ this requires least code change
b/ this results in a minimally-degraded array in minimal time.
Cc: "Eivind Sarto" <ivan@kasenna.com>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-05-23 22:04:39 +02:00
|
|
|
err = -EBUSY;
|
|
|
|
goto abort;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
p->rdev = NULL;
|
2005-05-01 17:59:04 +02:00
|
|
|
synchronize_rcu();
|
2005-04-17 00:20:36 +02:00
|
|
|
if (atomic_read(&rdev->nr_pending)) {
|
|
|
|
/* lost the race, try later */
|
|
|
|
err = -EBUSY;
|
|
|
|
p->rdev = rdev;
|
2009-08-03 02:59:47 +02:00
|
|
|
goto abort;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-03-17 11:11:05 +01:00
|
|
|
err = md_integrity_register(mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
abort:
|
|
|
|
|
|
|
|
print_conf(conf);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-09-27 12:47:43 +02:00
|
|
|
static void end_sync_read(struct bio *bio, int error)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio = bio->bi_private;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = r10_bio->mddev->private;
|
2011-07-18 09:38:47 +02:00
|
|
|
int d;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
d = find_bio_disk(conf, r10_bio, bio, NULL, NULL);
|
2006-01-06 09:20:29 +01:00
|
|
|
|
|
|
|
if (test_bit(BIO_UPTODATE, &bio->bi_flags))
|
|
|
|
set_bit(R10BIO_Uptodate, &r10_bio->state);
|
2011-07-28 03:39:25 +02:00
|
|
|
else
|
|
|
|
/* The write handler will notice the lack of
|
|
|
|
* R10BIO_Uptodate and record any errors etc
|
|
|
|
*/
|
2006-01-06 09:20:52 +01:00
|
|
|
atomic_add(r10_bio->sectors,
|
|
|
|
&conf->mirrors[d].rdev->corrected_errors);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* for reconstruct, we always reschedule after a read.
|
|
|
|
* for resync, only after all reads
|
|
|
|
*/
|
2009-02-25 03:18:47 +01:00
|
|
|
rdev_dec_pending(conf->mirrors[d].rdev, conf->mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (test_bit(R10BIO_IsRecover, &r10_bio->state) ||
|
|
|
|
atomic_dec_and_test(&r10_bio->remaining)) {
|
|
|
|
/* we have read all the blocks,
|
|
|
|
* do the comparison in process context in raid10d
|
|
|
|
*/
|
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void end_sync_request(struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = r10_bio->mddev;
|
md: restart recovery cleanly after device failure.
When we get any IO error during a recovery (rebuilding a spare), we abort
the recovery and restart it.
For RAID6 (and multi-drive RAID1) it may not be best to restart at the
beginning: when multiple failures can be tolerated, the recovery may be
able to continue and re-doing all that has already been done doesn't make
sense.
We already have the infrastructure to record where a recovery is up to
and restart from there, but it is not being used properly.
This is because:
- We sometimes abort with MD_RECOVERY_ERR rather than just MD_RECOVERY_INTR,
which causes the recovery not be be checkpointed.
- We remove spares and then re-added them which loses important state
information.
The distinction between MD_RECOVERY_ERR and MD_RECOVERY_INTR really isn't
needed. If there is an error, the relevant drive will be marked as
Faulty, and that is enough to ensure correct handling of the error. So we
first remove MD_RECOVERY_ERR, changing some of the uses of it to
MD_RECOVERY_INTR.
Then we cause the attempt to remove a non-faulty device from an array to
fail (unless recovery is impossible as the array is too degraded). Then
when remove_and_add_spares attempts to remove the devices on which
recovery can continue, it will fail, they will remain in place, and
recovery will continue on them as desired.
Issue: If we are halfway through rebuilding a spare and another drive
fails, and a new spare is immediately available, do we want to:
1/ complete the current rebuild, then go back and rebuild the new spare or
2/ restart the rebuild from the start and rebuild both devices in
parallel.
Both options can be argued for. The code currently takes option 2 as
a/ this requires least code change
b/ this results in a minimally-degraded array in minimal time.
Cc: "Eivind Sarto" <ivan@kasenna.com>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-05-23 22:04:39 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
while (atomic_dec_and_test(&r10_bio->remaining)) {
|
|
|
|
if (r10_bio->master_bio == NULL) {
|
|
|
|
/* the primary of several recovery bios */
|
2009-02-25 03:18:47 +01:00
|
|
|
sector_t s = r10_bio->sectors;
|
2011-07-28 03:39:25 +02:00
|
|
|
if (test_bit(R10BIO_MadeGood, &r10_bio->state) ||
|
|
|
|
test_bit(R10BIO_WriteError, &r10_bio->state))
|
2011-07-28 03:39:24 +02:00
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
else
|
|
|
|
put_buf(r10_bio);
|
2009-02-25 03:18:47 +01:00
|
|
|
md_done_sync(mddev, s, 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
|
|
|
} else {
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio2 = (struct r10bio *)r10_bio->master_bio;
|
2011-07-28 03:39:25 +02:00
|
|
|
if (test_bit(R10BIO_MadeGood, &r10_bio->state) ||
|
|
|
|
test_bit(R10BIO_WriteError, &r10_bio->state))
|
2011-07-28 03:39:24 +02:00
|
|
|
reschedule_retry(r10_bio);
|
|
|
|
else
|
|
|
|
put_buf(r10_bio);
|
2005-04-17 00:20:36 +02:00
|
|
|
r10_bio = r10_bio2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-28 03:39:25 +02:00
|
|
|
static void end_sync_write(struct bio *bio, int error)
|
|
|
|
{
|
|
|
|
int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio = bio->bi_private;
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = r10_bio->mddev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-07-28 03:39:25 +02:00
|
|
|
int d;
|
|
|
|
sector_t first_bad;
|
|
|
|
int bad_sectors;
|
|
|
|
int slot;
|
|
|
|
|
2011-12-23 00:17:54 +01:00
|
|
|
d = find_bio_disk(conf, r10_bio, bio, &slot, NULL);
|
2011-07-28 03:39:25 +02:00
|
|
|
|
|
|
|
if (!uptodate) {
|
|
|
|
set_bit(WriteErrorSeen, &conf->mirrors[d].rdev->flags);
|
|
|
|
set_bit(R10BIO_WriteError, &r10_bio->state);
|
|
|
|
} else if (is_badblock(conf->mirrors[d].rdev,
|
|
|
|
r10_bio->devs[slot].addr,
|
|
|
|
r10_bio->sectors,
|
|
|
|
&first_bad, &bad_sectors))
|
|
|
|
set_bit(R10BIO_MadeGood, &r10_bio->state);
|
|
|
|
|
|
|
|
rdev_dec_pending(conf->mirrors[d].rdev, mddev);
|
|
|
|
|
|
|
|
end_sync_request(r10_bio);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Note: sync and recover and handled very differently for raid10
|
|
|
|
* This code is for resync.
|
|
|
|
* For resync, we read through virtual addresses and read all blocks.
|
|
|
|
* If there is any error, we schedule a write. The lowest numbered
|
|
|
|
* drive is authoritative.
|
|
|
|
* However requests come for physical address, so we need to map.
|
|
|
|
* For every physical address there are raid_disks/copies virtual addresses,
|
|
|
|
* which is always are least one, but is not necessarly an integer.
|
|
|
|
* This means that a physical address can span multiple chunks, so we may
|
|
|
|
* have to submit multiple io requests for a single sync request.
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* We check if all blocks are in-sync and only write to blocks that
|
|
|
|
* aren't in sync
|
|
|
|
*/
|
2011-10-11 07:48:43 +02:00
|
|
|
static void sync_request_write(struct mddev *mddev, struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
int i, first;
|
|
|
|
struct bio *tbio, *fbio;
|
|
|
|
|
|
|
|
atomic_set(&r10_bio->remaining, 1);
|
|
|
|
|
|
|
|
/* find the first device with a block */
|
|
|
|
for (i=0; i<conf->copies; i++)
|
|
|
|
if (test_bit(BIO_UPTODATE, &r10_bio->devs[i].bio->bi_flags))
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (i == conf->copies)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
first = i;
|
|
|
|
fbio = r10_bio->devs[i].bio;
|
|
|
|
|
|
|
|
/* now find blocks with errors */
|
2006-01-06 09:20:29 +01:00
|
|
|
for (i=0 ; i < conf->copies ; i++) {
|
|
|
|
int j, d;
|
|
|
|
int vcnt = r10_bio->sectors >> (PAGE_SHIFT-9);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
tbio = r10_bio->devs[i].bio;
|
2006-01-06 09:20:29 +01:00
|
|
|
|
|
|
|
if (tbio->bi_end_io != end_sync_read)
|
|
|
|
continue;
|
|
|
|
if (i == first)
|
2005-04-17 00:20:36 +02:00
|
|
|
continue;
|
2006-01-06 09:20:29 +01:00
|
|
|
if (test_bit(BIO_UPTODATE, &r10_bio->devs[i].bio->bi_flags)) {
|
|
|
|
/* We know that the bi_io_vec layout is the same for
|
|
|
|
* both 'first' and 'i', so we just compare them.
|
|
|
|
* All vec entries are PAGE_SIZE;
|
|
|
|
*/
|
|
|
|
for (j = 0; j < vcnt; j++)
|
|
|
|
if (memcmp(page_address(fbio->bi_io_vec[j].bv_page),
|
|
|
|
page_address(tbio->bi_io_vec[j].bv_page),
|
|
|
|
PAGE_SIZE))
|
|
|
|
break;
|
|
|
|
if (j == vcnt)
|
|
|
|
continue;
|
|
|
|
mddev->resync_mismatches += r10_bio->sectors;
|
2011-07-28 03:39:25 +02:00
|
|
|
if (test_bit(MD_RECOVERY_CHECK, &mddev->recovery))
|
|
|
|
/* Don't fix anything. */
|
|
|
|
continue;
|
2006-01-06 09:20:29 +01:00
|
|
|
}
|
2011-07-28 03:39:25 +02:00
|
|
|
/* Ok, we need to write this bio, either to correct an
|
|
|
|
* inconsistency or to correct an unreadable block.
|
2005-04-17 00:20:36 +02:00
|
|
|
* First we need to fixup bv_offset, bv_len and
|
|
|
|
* bi_vecs, as the read request might have corrupted these
|
|
|
|
*/
|
|
|
|
tbio->bi_vcnt = vcnt;
|
|
|
|
tbio->bi_size = r10_bio->sectors << 9;
|
|
|
|
tbio->bi_idx = 0;
|
|
|
|
tbio->bi_phys_segments = 0;
|
|
|
|
tbio->bi_flags &= ~(BIO_POOL_MASK - 1);
|
|
|
|
tbio->bi_flags |= 1 << BIO_UPTODATE;
|
|
|
|
tbio->bi_next = NULL;
|
|
|
|
tbio->bi_rw = WRITE;
|
|
|
|
tbio->bi_private = r10_bio;
|
|
|
|
tbio->bi_sector = r10_bio->devs[i].addr;
|
|
|
|
|
|
|
|
for (j=0; j < vcnt ; j++) {
|
|
|
|
tbio->bi_io_vec[j].bv_offset = 0;
|
|
|
|
tbio->bi_io_vec[j].bv_len = PAGE_SIZE;
|
|
|
|
|
|
|
|
memcpy(page_address(tbio->bi_io_vec[j].bv_page),
|
|
|
|
page_address(fbio->bi_io_vec[j].bv_page),
|
|
|
|
PAGE_SIZE);
|
|
|
|
}
|
|
|
|
tbio->bi_end_io = end_sync_write;
|
|
|
|
|
|
|
|
d = r10_bio->devs[i].devnum;
|
|
|
|
atomic_inc(&conf->mirrors[d].rdev->nr_pending);
|
|
|
|
atomic_inc(&r10_bio->remaining);
|
|
|
|
md_sync_acct(conf->mirrors[d].rdev->bdev, tbio->bi_size >> 9);
|
|
|
|
|
|
|
|
tbio->bi_sector += conf->mirrors[d].rdev->data_offset;
|
|
|
|
tbio->bi_bdev = conf->mirrors[d].rdev->bdev;
|
|
|
|
generic_make_request(tbio);
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (atomic_dec_and_test(&r10_bio->remaining)) {
|
|
|
|
md_done_sync(mddev, r10_bio->sectors, 1);
|
|
|
|
put_buf(r10_bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now for the recovery code.
|
|
|
|
* Recovery happens across physical sectors.
|
|
|
|
* We recover all non-is_sync drives by finding the virtual address of
|
|
|
|
* each, and then choose a working drive that also has that virt address.
|
|
|
|
* There is a separate r10_bio for each non-in_sync drive.
|
|
|
|
* Only the first two slots are in use. The first for reading,
|
|
|
|
* The second for writing.
|
|
|
|
*
|
|
|
|
*/
|
2011-10-11 07:48:43 +02:00
|
|
|
static void fix_recovery_read_error(struct r10bio *r10_bio)
|
2011-07-28 03:39:25 +02:00
|
|
|
{
|
|
|
|
/* We got a read error during recovery.
|
|
|
|
* We repeat the read in smaller page-sized sections.
|
|
|
|
* If a read succeeds, write it to the new device or record
|
|
|
|
* a bad block if we cannot.
|
|
|
|
* If a read fails, record a bad block on both old and
|
|
|
|
* new devices.
|
|
|
|
*/
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = r10_bio->mddev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-07-28 03:39:25 +02:00
|
|
|
struct bio *bio = r10_bio->devs[0].bio;
|
|
|
|
sector_t sect = 0;
|
|
|
|
int sectors = r10_bio->sectors;
|
|
|
|
int idx = 0;
|
|
|
|
int dr = r10_bio->devs[0].devnum;
|
|
|
|
int dw = r10_bio->devs[1].devnum;
|
|
|
|
|
|
|
|
while (sectors) {
|
|
|
|
int s = sectors;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev;
|
2011-07-28 03:39:25 +02:00
|
|
|
sector_t addr;
|
|
|
|
int ok;
|
|
|
|
|
|
|
|
if (s > (PAGE_SIZE>>9))
|
|
|
|
s = PAGE_SIZE >> 9;
|
|
|
|
|
|
|
|
rdev = conf->mirrors[dr].rdev;
|
|
|
|
addr = r10_bio->devs[0].addr + sect,
|
|
|
|
ok = sync_page_io(rdev,
|
|
|
|
addr,
|
|
|
|
s << 9,
|
|
|
|
bio->bi_io_vec[idx].bv_page,
|
|
|
|
READ, false);
|
|
|
|
if (ok) {
|
|
|
|
rdev = conf->mirrors[dw].rdev;
|
|
|
|
addr = r10_bio->devs[1].addr + sect;
|
|
|
|
ok = sync_page_io(rdev,
|
|
|
|
addr,
|
|
|
|
s << 9,
|
|
|
|
bio->bi_io_vec[idx].bv_page,
|
|
|
|
WRITE, false);
|
|
|
|
if (!ok)
|
|
|
|
set_bit(WriteErrorSeen, &rdev->flags);
|
|
|
|
}
|
|
|
|
if (!ok) {
|
|
|
|
/* We don't worry if we cannot set a bad block -
|
|
|
|
* it really is bad so there is no loss in not
|
|
|
|
* recording it yet
|
|
|
|
*/
|
|
|
|
rdev_set_badblocks(rdev, addr, s, 0);
|
|
|
|
|
|
|
|
if (rdev != conf->mirrors[dw].rdev) {
|
|
|
|
/* need bad block on destination too */
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev2 = conf->mirrors[dw].rdev;
|
2011-07-28 03:39:25 +02:00
|
|
|
addr = r10_bio->devs[1].addr + sect;
|
|
|
|
ok = rdev_set_badblocks(rdev2, addr, s, 0);
|
|
|
|
if (!ok) {
|
|
|
|
/* just abort the recovery */
|
|
|
|
printk(KERN_NOTICE
|
|
|
|
"md/raid10:%s: recovery aborted"
|
|
|
|
" due to read error\n",
|
|
|
|
mdname(mddev));
|
|
|
|
|
|
|
|
conf->mirrors[dw].recovery_disabled
|
|
|
|
= mddev->recovery_disabled;
|
|
|
|
set_bit(MD_RECOVERY_INTR,
|
|
|
|
&mddev->recovery);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
sectors -= s;
|
|
|
|
sect += s;
|
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void recovery_request_write(struct mddev *mddev, struct r10bio *r10_bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-07-18 09:38:49 +02:00
|
|
|
int d;
|
|
|
|
struct bio *wbio;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-28 03:39:25 +02:00
|
|
|
if (!test_bit(R10BIO_Uptodate, &r10_bio->state)) {
|
|
|
|
fix_recovery_read_error(r10_bio);
|
|
|
|
end_sync_request(r10_bio);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-07-18 09:38:49 +02:00
|
|
|
/*
|
|
|
|
* share the pages with the first bio
|
2005-04-17 00:20:36 +02:00
|
|
|
* and submit the write request
|
|
|
|
*/
|
|
|
|
wbio = r10_bio->devs[1].bio;
|
|
|
|
d = r10_bio->devs[1].devnum;
|
|
|
|
|
|
|
|
atomic_inc(&conf->mirrors[d].rdev->nr_pending);
|
|
|
|
md_sync_acct(conf->mirrors[d].rdev->bdev, wbio->bi_size >> 9);
|
2011-07-28 03:39:25 +02:00
|
|
|
generic_make_request(wbio);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-14 02:49:58 +01:00
|
|
|
/*
|
|
|
|
* Used by fix_read_error() to decay the per rdev read_errors.
|
|
|
|
* We halve the read error count for every hour that has elapsed
|
|
|
|
* since the last recorded read error.
|
|
|
|
*
|
|
|
|
*/
|
2011-10-11 07:47:53 +02:00
|
|
|
static void check_decay_read_errors(struct mddev *mddev, struct md_rdev *rdev)
|
2009-12-14 02:49:58 +01:00
|
|
|
{
|
|
|
|
struct timespec cur_time_mon;
|
|
|
|
unsigned long hours_since_last;
|
|
|
|
unsigned int read_errors = atomic_read(&rdev->read_errors);
|
|
|
|
|
|
|
|
ktime_get_ts(&cur_time_mon);
|
|
|
|
|
|
|
|
if (rdev->last_read_error.tv_sec == 0 &&
|
|
|
|
rdev->last_read_error.tv_nsec == 0) {
|
|
|
|
/* first time we've seen a read error */
|
|
|
|
rdev->last_read_error = cur_time_mon;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
hours_since_last = (cur_time_mon.tv_sec -
|
|
|
|
rdev->last_read_error.tv_sec) / 3600;
|
|
|
|
|
|
|
|
rdev->last_read_error = cur_time_mon;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if hours_since_last is > the number of bits in read_errors
|
|
|
|
* just set read errors to 0. We do this to avoid
|
|
|
|
* overflowing the shift of read_errors by hours_since_last.
|
|
|
|
*/
|
|
|
|
if (hours_since_last >= 8 * sizeof(read_errors))
|
|
|
|
atomic_set(&rdev->read_errors, 0);
|
|
|
|
else
|
|
|
|
atomic_set(&rdev->read_errors, read_errors >> hours_since_last);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:45:26 +02:00
|
|
|
static int r10_sync_page_io(struct md_rdev *rdev, sector_t sector,
|
2011-07-28 03:39:25 +02:00
|
|
|
int sectors, struct page *page, int rw)
|
|
|
|
{
|
|
|
|
sector_t first_bad;
|
|
|
|
int bad_sectors;
|
|
|
|
|
|
|
|
if (is_badblock(rdev, sector, sectors, &first_bad, &bad_sectors)
|
|
|
|
&& (rw == READ || test_bit(WriteErrorSeen, &rdev->flags)))
|
|
|
|
return -1;
|
|
|
|
if (sync_page_io(rdev, sector, sectors << 9, page, rw, false))
|
|
|
|
/* success */
|
|
|
|
return 1;
|
|
|
|
if (rw == WRITE)
|
|
|
|
set_bit(WriteErrorSeen, &rdev->flags);
|
|
|
|
/* need to record an error - either for the block or the device */
|
|
|
|
if (!rdev_set_badblocks(rdev, sector, sectors, 0))
|
|
|
|
md_error(rdev->mddev, rdev);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* This is a kernel thread which:
|
|
|
|
*
|
|
|
|
* 1. Retries failed read operations on working mirrors.
|
|
|
|
* 2. Updates the raid superblock when problems encounter.
|
2006-10-03 10:15:45 +02:00
|
|
|
* 3. Performs writes following reads for array synchronising.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void fix_read_error(struct r10conf *conf, struct mddev *mddev, struct r10bio *r10_bio)
|
2006-10-03 10:15:45 +02:00
|
|
|
{
|
|
|
|
int sect = 0; /* Offset from r10_bio->sector */
|
|
|
|
int sectors = r10_bio->sectors;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev*rdev;
|
2009-12-14 02:49:58 +01:00
|
|
|
int max_read_errors = atomic_read(&mddev->max_corr_read_errors);
|
2010-06-24 05:31:03 +02:00
|
|
|
int d = r10_bio->devs[r10_bio->read_slot].devnum;
|
2009-12-14 02:49:58 +01:00
|
|
|
|
2011-05-11 06:53:17 +02:00
|
|
|
/* still own a reference to this rdev, so it cannot
|
|
|
|
* have been cleared recently.
|
|
|
|
*/
|
|
|
|
rdev = conf->mirrors[d].rdev;
|
2009-12-14 02:49:58 +01:00
|
|
|
|
2011-05-11 06:53:17 +02:00
|
|
|
if (test_bit(Faulty, &rdev->flags))
|
|
|
|
/* drive has already been failed, just ignore any
|
|
|
|
more fix_read_error() attempts */
|
|
|
|
return;
|
2009-12-14 02:49:58 +01:00
|
|
|
|
2011-05-11 06:53:17 +02:00
|
|
|
check_decay_read_errors(mddev, rdev);
|
|
|
|
atomic_inc(&rdev->read_errors);
|
|
|
|
if (atomic_read(&rdev->read_errors) > max_read_errors) {
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
bdevname(rdev->bdev, b);
|
2009-12-14 02:49:58 +01:00
|
|
|
|
2011-05-11 06:53:17 +02:00
|
|
|
printk(KERN_NOTICE
|
|
|
|
"md/raid10:%s: %s: Raid device exceeded "
|
|
|
|
"read_error threshold [cur %d:max %d]\n",
|
|
|
|
mdname(mddev), b,
|
|
|
|
atomic_read(&rdev->read_errors), max_read_errors);
|
|
|
|
printk(KERN_NOTICE
|
|
|
|
"md/raid10:%s: %s: Failing raid device\n",
|
|
|
|
mdname(mddev), b);
|
|
|
|
md_error(mddev, conf->mirrors[d].rdev);
|
|
|
|
return;
|
2009-12-14 02:49:58 +01:00
|
|
|
}
|
|
|
|
|
2006-10-03 10:15:45 +02:00
|
|
|
while(sectors) {
|
|
|
|
int s = sectors;
|
|
|
|
int sl = r10_bio->read_slot;
|
|
|
|
int success = 0;
|
|
|
|
int start;
|
|
|
|
|
|
|
|
if (s > (PAGE_SIZE>>9))
|
|
|
|
s = PAGE_SIZE >> 9;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
do {
|
2011-07-28 03:39:24 +02:00
|
|
|
sector_t first_bad;
|
|
|
|
int bad_sectors;
|
|
|
|
|
2010-06-24 05:31:03 +02:00
|
|
|
d = r10_bio->devs[sl].devnum;
|
2006-10-03 10:15:45 +02:00
|
|
|
rdev = rcu_dereference(conf->mirrors[d].rdev);
|
|
|
|
if (rdev &&
|
2011-07-28 03:39:24 +02:00
|
|
|
test_bit(In_sync, &rdev->flags) &&
|
|
|
|
is_badblock(rdev, r10_bio->devs[sl].addr + sect, s,
|
|
|
|
&first_bad, &bad_sectors) == 0) {
|
2006-10-03 10:15:45 +02:00
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
rcu_read_unlock();
|
2010-10-27 06:16:40 +02:00
|
|
|
success = sync_page_io(rdev,
|
2006-10-03 10:15:45 +02:00
|
|
|
r10_bio->devs[sl].addr +
|
2011-01-13 23:14:33 +01:00
|
|
|
sect,
|
2006-10-03 10:15:45 +02:00
|
|
|
s<<9,
|
2011-01-13 23:14:33 +01:00
|
|
|
conf->tmppage, READ, false);
|
2006-10-03 10:15:45 +02:00
|
|
|
rdev_dec_pending(rdev, mddev);
|
|
|
|
rcu_read_lock();
|
|
|
|
if (success)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
sl++;
|
|
|
|
if (sl == conf->copies)
|
|
|
|
sl = 0;
|
|
|
|
} while (!success && sl != r10_bio->read_slot);
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
if (!success) {
|
2011-07-28 03:39:25 +02:00
|
|
|
/* Cannot read from anywhere, just mark the block
|
|
|
|
* as bad on the first device to discourage future
|
|
|
|
* reads.
|
|
|
|
*/
|
2006-10-03 10:15:45 +02:00
|
|
|
int dn = r10_bio->devs[r10_bio->read_slot].devnum;
|
2011-07-28 03:39:25 +02:00
|
|
|
rdev = conf->mirrors[dn].rdev;
|
|
|
|
|
|
|
|
if (!rdev_set_badblocks(
|
|
|
|
rdev,
|
|
|
|
r10_bio->devs[r10_bio->read_slot].addr
|
|
|
|
+ sect,
|
|
|
|
s, 0))
|
|
|
|
md_error(mddev, rdev);
|
2006-10-03 10:15:45 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
start = sl;
|
|
|
|
/* write it back and re-read */
|
|
|
|
rcu_read_lock();
|
|
|
|
while (sl != r10_bio->read_slot) {
|
2009-12-14 02:49:57 +01:00
|
|
|
char b[BDEVNAME_SIZE];
|
2010-06-24 05:31:03 +02:00
|
|
|
|
2006-10-03 10:15:45 +02:00
|
|
|
if (sl==0)
|
|
|
|
sl = conf->copies;
|
|
|
|
sl--;
|
|
|
|
d = r10_bio->devs[sl].devnum;
|
|
|
|
rdev = rcu_dereference(conf->mirrors[d].rdev);
|
2011-07-28 03:39:23 +02:00
|
|
|
if (!rdev ||
|
|
|
|
!test_bit(In_sync, &rdev->flags))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
rcu_read_unlock();
|
2011-07-28 03:39:25 +02:00
|
|
|
if (r10_sync_page_io(rdev,
|
|
|
|
r10_bio->devs[sl].addr +
|
|
|
|
sect,
|
|
|
|
s<<9, conf->tmppage, WRITE)
|
2011-07-28 03:39:23 +02:00
|
|
|
== 0) {
|
|
|
|
/* Well, this device is dead */
|
|
|
|
printk(KERN_NOTICE
|
|
|
|
"md/raid10:%s: read correction "
|
|
|
|
"write failed"
|
|
|
|
" (%d sectors at %llu on %s)\n",
|
|
|
|
mdname(mddev), s,
|
|
|
|
(unsigned long long)(
|
|
|
|
sect + rdev->data_offset),
|
|
|
|
bdevname(rdev->bdev, b));
|
|
|
|
printk(KERN_NOTICE "md/raid10:%s: %s: failing "
|
|
|
|
"drive\n",
|
|
|
|
mdname(mddev),
|
|
|
|
bdevname(rdev->bdev, b));
|
2006-10-03 10:15:45 +02:00
|
|
|
}
|
2011-07-28 03:39:23 +02:00
|
|
|
rdev_dec_pending(rdev, mddev);
|
|
|
|
rcu_read_lock();
|
2006-10-03 10:15:45 +02:00
|
|
|
}
|
|
|
|
sl = start;
|
|
|
|
while (sl != r10_bio->read_slot) {
|
2011-07-28 03:39:23 +02:00
|
|
|
char b[BDEVNAME_SIZE];
|
2010-06-24 05:31:03 +02:00
|
|
|
|
2006-10-03 10:15:45 +02:00
|
|
|
if (sl==0)
|
|
|
|
sl = conf->copies;
|
|
|
|
sl--;
|
|
|
|
d = r10_bio->devs[sl].devnum;
|
|
|
|
rdev = rcu_dereference(conf->mirrors[d].rdev);
|
2011-07-28 03:39:23 +02:00
|
|
|
if (!rdev ||
|
|
|
|
!test_bit(In_sync, &rdev->flags))
|
|
|
|
continue;
|
2006-10-03 10:15:45 +02:00
|
|
|
|
2011-07-28 03:39:23 +02:00
|
|
|
atomic_inc(&rdev->nr_pending);
|
|
|
|
rcu_read_unlock();
|
2011-07-28 03:39:25 +02:00
|
|
|
switch (r10_sync_page_io(rdev,
|
|
|
|
r10_bio->devs[sl].addr +
|
|
|
|
sect,
|
|
|
|
s<<9, conf->tmppage,
|
|
|
|
READ)) {
|
|
|
|
case 0:
|
2011-07-28 03:39:23 +02:00
|
|
|
/* Well, this device is dead */
|
|
|
|
printk(KERN_NOTICE
|
|
|
|
"md/raid10:%s: unable to read back "
|
|
|
|
"corrected sectors"
|
|
|
|
" (%d sectors at %llu on %s)\n",
|
|
|
|
mdname(mddev), s,
|
|
|
|
(unsigned long long)(
|
|
|
|
sect + rdev->data_offset),
|
|
|
|
bdevname(rdev->bdev, b));
|
|
|
|
printk(KERN_NOTICE "md/raid10:%s: %s: failing "
|
|
|
|
"drive\n",
|
|
|
|
mdname(mddev),
|
|
|
|
bdevname(rdev->bdev, b));
|
2011-07-28 03:39:25 +02:00
|
|
|
break;
|
|
|
|
case 1:
|
2011-07-28 03:39:23 +02:00
|
|
|
printk(KERN_INFO
|
|
|
|
"md/raid10:%s: read error corrected"
|
|
|
|
" (%d sectors at %llu on %s)\n",
|
|
|
|
mdname(mddev), s,
|
|
|
|
(unsigned long long)(
|
|
|
|
sect + rdev->data_offset),
|
|
|
|
bdevname(rdev->bdev, b));
|
|
|
|
atomic_add(s, &rdev->corrected_errors);
|
2006-10-03 10:15:45 +02:00
|
|
|
}
|
2011-07-28 03:39:23 +02:00
|
|
|
|
|
|
|
rdev_dec_pending(rdev, mddev);
|
|
|
|
rcu_read_lock();
|
2006-10-03 10:15:45 +02:00
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
sectors -= s;
|
|
|
|
sect += s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
static void bi_complete(struct bio *bio, int error)
|
|
|
|
{
|
|
|
|
complete((struct completion *)bio->bi_private);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int submit_bio_wait(int rw, struct bio *bio)
|
|
|
|
{
|
|
|
|
struct completion event;
|
|
|
|
rw |= REQ_SYNC;
|
|
|
|
|
|
|
|
init_completion(&event);
|
|
|
|
bio->bi_private = &event;
|
|
|
|
bio->bi_end_io = bi_complete;
|
|
|
|
submit_bio(rw, bio);
|
|
|
|
wait_for_completion(&event);
|
|
|
|
|
|
|
|
return test_bit(BIO_UPTODATE, &bio->bi_flags);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static int narrow_write_error(struct r10bio *r10_bio, int i)
|
2011-07-28 03:39:24 +02:00
|
|
|
{
|
|
|
|
struct bio *bio = r10_bio->master_bio;
|
2011-10-11 07:47:53 +02:00
|
|
|
struct mddev *mddev = r10_bio->mddev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev = conf->mirrors[r10_bio->devs[i].devnum].rdev;
|
2011-07-28 03:39:24 +02:00
|
|
|
/* bio has the data to be written to slot 'i' where
|
|
|
|
* we just recently had a write error.
|
|
|
|
* We repeatedly clone the bio and trim down to one block,
|
|
|
|
* then try the write. Where the write fails we record
|
|
|
|
* a bad block.
|
|
|
|
* It is conceivable that the bio doesn't exactly align with
|
|
|
|
* blocks. We must handle this.
|
|
|
|
*
|
|
|
|
* We currently own a reference to the rdev.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int block_sectors;
|
|
|
|
sector_t sector;
|
|
|
|
int sectors;
|
|
|
|
int sect_to_write = r10_bio->sectors;
|
|
|
|
int ok = 1;
|
|
|
|
|
|
|
|
if (rdev->badblocks.shift < 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
block_sectors = 1 << rdev->badblocks.shift;
|
|
|
|
sector = r10_bio->sector;
|
|
|
|
sectors = ((r10_bio->sector + block_sectors)
|
|
|
|
& ~(sector_t)(block_sectors - 1))
|
|
|
|
- sector;
|
|
|
|
|
|
|
|
while (sect_to_write) {
|
|
|
|
struct bio *wbio;
|
|
|
|
if (sectors > sect_to_write)
|
|
|
|
sectors = sect_to_write;
|
|
|
|
/* Write at 'sector' for 'sectors' */
|
|
|
|
wbio = bio_clone_mddev(bio, GFP_NOIO, mddev);
|
|
|
|
md_trim_bio(wbio, sector - bio->bi_sector, sectors);
|
|
|
|
wbio->bi_sector = (r10_bio->devs[i].addr+
|
|
|
|
rdev->data_offset+
|
|
|
|
(sector - r10_bio->sector));
|
|
|
|
wbio->bi_bdev = rdev->bdev;
|
|
|
|
if (submit_bio_wait(WRITE, wbio) == 0)
|
|
|
|
/* Failure! */
|
|
|
|
ok = rdev_set_badblocks(rdev, sector,
|
|
|
|
sectors, 0)
|
|
|
|
&& ok;
|
|
|
|
|
|
|
|
bio_put(wbio);
|
|
|
|
sect_to_write -= sectors;
|
|
|
|
sector += sectors;
|
|
|
|
sectors = block_sectors;
|
|
|
|
}
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:48:43 +02:00
|
|
|
static void handle_read_error(struct mddev *mddev, struct r10bio *r10_bio)
|
2011-07-28 03:39:23 +02:00
|
|
|
{
|
|
|
|
int slot = r10_bio->read_slot;
|
|
|
|
struct bio *bio;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-12-23 00:17:54 +01:00
|
|
|
struct md_rdev *rdev = r10_bio->devs[slot].rdev;
|
2011-07-28 03:39:23 +02:00
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
unsigned long do_sync;
|
2011-07-28 03:39:23 +02:00
|
|
|
int max_sectors;
|
2011-07-28 03:39:23 +02:00
|
|
|
|
|
|
|
/* we got a read error. Maybe the drive is bad. Maybe just
|
|
|
|
* the block and we can fix it.
|
|
|
|
* We freeze all other IO, and try reading the block from
|
|
|
|
* other devices. When we find one, we re-write
|
|
|
|
* and check it that fixes the read error.
|
|
|
|
* This is all done synchronously while the array is
|
|
|
|
* frozen.
|
|
|
|
*/
|
|
|
|
if (mddev->ro == 0) {
|
|
|
|
freeze_array(conf);
|
|
|
|
fix_read_error(conf, mddev, r10_bio);
|
|
|
|
unfreeze_array(conf);
|
|
|
|
}
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev_dec_pending(rdev, mddev);
|
2011-07-28 03:39:23 +02:00
|
|
|
|
|
|
|
bio = r10_bio->devs[slot].bio;
|
2011-07-28 03:39:23 +02:00
|
|
|
bdevname(bio->bi_bdev, b);
|
2011-07-28 03:39:23 +02:00
|
|
|
r10_bio->devs[slot].bio =
|
|
|
|
mddev->ro ? IO_BLOCKED : NULL;
|
2011-07-28 03:39:23 +02:00
|
|
|
read_more:
|
2011-12-23 00:17:54 +01:00
|
|
|
rdev = read_balance(conf, r10_bio, &max_sectors);
|
|
|
|
if (rdev == NULL) {
|
2011-07-28 03:39:23 +02:00
|
|
|
printk(KERN_ALERT "md/raid10:%s: %s: unrecoverable I/O"
|
|
|
|
" read error for block %llu\n",
|
2011-07-28 03:39:23 +02:00
|
|
|
mdname(mddev), b,
|
2011-07-28 03:39:23 +02:00
|
|
|
(unsigned long long)r10_bio->sector);
|
|
|
|
raid_end_bio_io(r10_bio);
|
|
|
|
bio_put(bio);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
do_sync = (r10_bio->master_bio->bi_rw & REQ_SYNC);
|
2011-07-28 03:39:23 +02:00
|
|
|
if (bio)
|
|
|
|
bio_put(bio);
|
2011-07-28 03:39:23 +02:00
|
|
|
slot = r10_bio->read_slot;
|
|
|
|
printk_ratelimited(
|
|
|
|
KERN_ERR
|
|
|
|
"md/raid10:%s: %s: redirecting"
|
|
|
|
"sector %llu to another mirror\n",
|
|
|
|
mdname(mddev),
|
|
|
|
bdevname(rdev->bdev, b),
|
|
|
|
(unsigned long long)r10_bio->sector);
|
|
|
|
bio = bio_clone_mddev(r10_bio->master_bio,
|
|
|
|
GFP_NOIO, mddev);
|
2011-07-28 03:39:23 +02:00
|
|
|
md_trim_bio(bio,
|
|
|
|
r10_bio->sector - bio->bi_sector,
|
|
|
|
max_sectors);
|
2011-07-28 03:39:23 +02:00
|
|
|
r10_bio->devs[slot].bio = bio;
|
2011-12-23 00:17:54 +01:00
|
|
|
r10_bio->devs[slot].rdev = rdev;
|
2011-07-28 03:39:23 +02:00
|
|
|
bio->bi_sector = r10_bio->devs[slot].addr
|
|
|
|
+ rdev->data_offset;
|
|
|
|
bio->bi_bdev = rdev->bdev;
|
|
|
|
bio->bi_rw = READ | do_sync;
|
|
|
|
bio->bi_private = r10_bio;
|
|
|
|
bio->bi_end_io = raid10_end_read_request;
|
2011-07-28 03:39:23 +02:00
|
|
|
if (max_sectors < r10_bio->sectors) {
|
|
|
|
/* Drat - have to split this up more */
|
|
|
|
struct bio *mbio = r10_bio->master_bio;
|
|
|
|
int sectors_handled =
|
|
|
|
r10_bio->sector + max_sectors
|
|
|
|
- mbio->bi_sector;
|
|
|
|
r10_bio->sectors = max_sectors;
|
|
|
|
spin_lock_irq(&conf->device_lock);
|
|
|
|
if (mbio->bi_phys_segments == 0)
|
|
|
|
mbio->bi_phys_segments = 2;
|
|
|
|
else
|
|
|
|
mbio->bi_phys_segments++;
|
|
|
|
spin_unlock_irq(&conf->device_lock);
|
|
|
|
generic_make_request(bio);
|
|
|
|
bio = NULL;
|
|
|
|
|
|
|
|
r10_bio = mempool_alloc(conf->r10bio_pool,
|
|
|
|
GFP_NOIO);
|
|
|
|
r10_bio->master_bio = mbio;
|
|
|
|
r10_bio->sectors = (mbio->bi_size >> 9)
|
|
|
|
- sectors_handled;
|
|
|
|
r10_bio->state = 0;
|
|
|
|
set_bit(R10BIO_ReadError,
|
|
|
|
&r10_bio->state);
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
r10_bio->sector = mbio->bi_sector
|
|
|
|
+ sectors_handled;
|
|
|
|
|
|
|
|
goto read_more;
|
|
|
|
} else
|
|
|
|
generic_make_request(bio);
|
2011-07-28 03:39:23 +02:00
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static void handle_write_completed(struct r10conf *conf, struct r10bio *r10_bio)
|
2011-07-28 03:39:24 +02:00
|
|
|
{
|
|
|
|
/* Some sort of write request has finished and it
|
|
|
|
* succeeded in writing where we thought there was a
|
|
|
|
* bad block. So forget the bad block.
|
2011-07-28 03:39:25 +02:00
|
|
|
* Or possibly if failed and we need to record
|
|
|
|
* a bad block.
|
2011-07-28 03:39:24 +02:00
|
|
|
*/
|
|
|
|
int m;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev;
|
2011-07-28 03:39:24 +02:00
|
|
|
|
|
|
|
if (test_bit(R10BIO_IsSync, &r10_bio->state) ||
|
|
|
|
test_bit(R10BIO_IsRecover, &r10_bio->state)) {
|
2011-07-28 03:39:25 +02:00
|
|
|
for (m = 0; m < conf->copies; m++) {
|
|
|
|
int dev = r10_bio->devs[m].devnum;
|
|
|
|
rdev = conf->mirrors[dev].rdev;
|
|
|
|
if (r10_bio->devs[m].bio == NULL)
|
|
|
|
continue;
|
|
|
|
if (test_bit(BIO_UPTODATE,
|
2011-07-28 03:39:24 +02:00
|
|
|
&r10_bio->devs[m].bio->bi_flags)) {
|
|
|
|
rdev_clear_badblocks(
|
|
|
|
rdev,
|
|
|
|
r10_bio->devs[m].addr,
|
|
|
|
r10_bio->sectors);
|
2011-07-28 03:39:25 +02:00
|
|
|
} else {
|
|
|
|
if (!rdev_set_badblocks(
|
|
|
|
rdev,
|
|
|
|
r10_bio->devs[m].addr,
|
|
|
|
r10_bio->sectors, 0))
|
|
|
|
md_error(conf->mddev, rdev);
|
2011-07-28 03:39:24 +02:00
|
|
|
}
|
2011-07-28 03:39:25 +02:00
|
|
|
}
|
2011-07-28 03:39:24 +02:00
|
|
|
put_buf(r10_bio);
|
|
|
|
} else {
|
2011-07-28 03:39:24 +02:00
|
|
|
for (m = 0; m < conf->copies; m++) {
|
|
|
|
int dev = r10_bio->devs[m].devnum;
|
|
|
|
struct bio *bio = r10_bio->devs[m].bio;
|
|
|
|
rdev = conf->mirrors[dev].rdev;
|
|
|
|
if (bio == IO_MADE_GOOD) {
|
2011-07-28 03:39:24 +02:00
|
|
|
rdev_clear_badblocks(
|
|
|
|
rdev,
|
|
|
|
r10_bio->devs[m].addr,
|
|
|
|
r10_bio->sectors);
|
|
|
|
rdev_dec_pending(rdev, conf->mddev);
|
2011-07-28 03:39:24 +02:00
|
|
|
} else if (bio != NULL &&
|
|
|
|
!test_bit(BIO_UPTODATE, &bio->bi_flags)) {
|
|
|
|
if (!narrow_write_error(r10_bio, m)) {
|
|
|
|
md_error(conf->mddev, rdev);
|
|
|
|
set_bit(R10BIO_Degraded,
|
|
|
|
&r10_bio->state);
|
|
|
|
}
|
|
|
|
rdev_dec_pending(rdev, conf->mddev);
|
2011-07-28 03:39:24 +02:00
|
|
|
}
|
2011-07-28 03:39:24 +02:00
|
|
|
}
|
|
|
|
if (test_bit(R10BIO_WriteError,
|
|
|
|
&r10_bio->state))
|
|
|
|
close_write(r10_bio);
|
2011-07-28 03:39:24 +02:00
|
|
|
raid_end_bio_io(r10_bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void raid10d(struct mddev *mddev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long flags;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct list_head *head = &conf->retry_list;
|
2011-04-18 10:25:41 +02:00
|
|
|
struct blk_plug plug;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
md_check_recovery(mddev);
|
|
|
|
|
2011-04-18 10:25:41 +02:00
|
|
|
blk_start_plug(&plug);
|
2005-04-17 00:20:36 +02:00
|
|
|
for (;;) {
|
2006-01-06 09:20:16 +01:00
|
|
|
|
2011-03-10 08:52:07 +01:00
|
|
|
flush_pending_writes(conf);
|
2006-01-06 09:20:16 +01:00
|
|
|
|
2008-03-04 23:29:29 +01:00
|
|
|
spin_lock_irqsave(&conf->device_lock, flags);
|
|
|
|
if (list_empty(head)) {
|
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
2008-03-04 23:29:29 +01:00
|
|
|
}
|
2011-10-11 07:48:43 +02:00
|
|
|
r10_bio = list_entry(head->prev, struct r10bio, retry_list);
|
2005-04-17 00:20:36 +02:00
|
|
|
list_del(head->prev);
|
2006-01-06 09:20:28 +01:00
|
|
|
conf->nr_queued--;
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irqrestore(&conf->device_lock, flags);
|
|
|
|
|
|
|
|
mddev = r10_bio->mddev;
|
2009-06-16 08:54:21 +02:00
|
|
|
conf = mddev->private;
|
2011-07-28 03:39:24 +02:00
|
|
|
if (test_bit(R10BIO_MadeGood, &r10_bio->state) ||
|
|
|
|
test_bit(R10BIO_WriteError, &r10_bio->state))
|
2011-07-28 03:39:24 +02:00
|
|
|
handle_write_completed(conf, r10_bio);
|
|
|
|
else if (test_bit(R10BIO_IsSync, &r10_bio->state))
|
2005-04-17 00:20:36 +02:00
|
|
|
sync_request_write(mddev, r10_bio);
|
2011-03-10 08:52:07 +01:00
|
|
|
else if (test_bit(R10BIO_IsRecover, &r10_bio->state))
|
2005-04-17 00:20:36 +02:00
|
|
|
recovery_request_write(mddev, r10_bio);
|
2011-07-28 03:39:23 +02:00
|
|
|
else if (test_bit(R10BIO_ReadError, &r10_bio->state))
|
2011-07-28 03:39:23 +02:00
|
|
|
handle_read_error(mddev, r10_bio);
|
2011-07-28 03:39:23 +02:00
|
|
|
else {
|
|
|
|
/* just a partial read to be scheduled from a
|
|
|
|
* separate context
|
|
|
|
*/
|
|
|
|
int slot = r10_bio->read_slot;
|
|
|
|
generic_make_request(r10_bio->devs[slot].bio);
|
|
|
|
}
|
2011-07-28 03:39:23 +02:00
|
|
|
|
2009-10-16 06:55:32 +02:00
|
|
|
cond_resched();
|
2011-07-28 03:31:48 +02:00
|
|
|
if (mddev->flags & ~(1<<MD_CHANGE_PENDING))
|
|
|
|
md_check_recovery(mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-04-18 10:25:41 +02:00
|
|
|
blk_finish_plug(&plug);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static int init_resync(struct r10conf *conf)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int buffs;
|
2011-12-23 00:17:54 +01:00
|
|
|
int i;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
buffs = RESYNC_WINDOW / RESYNC_BLOCK_SIZE;
|
2006-04-02 13:34:29 +02:00
|
|
|
BUG_ON(conf->r10buf_pool);
|
2011-12-23 00:17:54 +01:00
|
|
|
conf->have_replacement = 0;
|
|
|
|
for (i = 0; i < conf->raid_disks; i++)
|
|
|
|
if (conf->mirrors[i].replacement)
|
|
|
|
conf->have_replacement = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
conf->r10buf_pool = mempool_create(buffs, r10buf_pool_alloc, r10buf_pool_free, conf);
|
|
|
|
if (!conf->r10buf_pool)
|
|
|
|
return -ENOMEM;
|
|
|
|
conf->next_resync = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* perform a "sync" on one "block"
|
|
|
|
*
|
|
|
|
* We need to make sure that no normal I/O request - particularly write
|
|
|
|
* requests - conflict with active sync requests.
|
|
|
|
*
|
|
|
|
* This is achieved by tracking pending requests and a 'barrier' concept
|
|
|
|
* that can be installed to exclude normal IO requests.
|
|
|
|
*
|
|
|
|
* Resync and recovery are handled very differently.
|
|
|
|
* We differentiate by looking at MD_RECOVERY_SYNC in mddev->recovery.
|
|
|
|
*
|
|
|
|
* For resync, we iterate over virtual addresses, read all copies,
|
|
|
|
* and update if there are differences. If only one copy is live,
|
|
|
|
* skip it.
|
|
|
|
* For recovery, we iterate over physical addresses, read a good
|
|
|
|
* value for each non-in_sync drive, and over-write.
|
|
|
|
*
|
|
|
|
* So, for recovery we may have several outstanding complex requests for a
|
|
|
|
* given address, one for each out-of-sync device. We model this by allocating
|
|
|
|
* a number of r10_bio structures, one for each out-of-sync device.
|
|
|
|
* As we setup these structures, we collect all bio's together into a list
|
|
|
|
* which we then process collectively to add pages, and then process again
|
|
|
|
* to pass to generic_make_request.
|
|
|
|
*
|
|
|
|
* The r10_bio structures are linked using a borrowed master_bio pointer.
|
|
|
|
* This link is counted in ->remaining. When the r10_bio that points to NULL
|
|
|
|
* has its remaining count decremented to 0, the whole complex operation
|
|
|
|
* is complete.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static sector_t sync_request(struct mddev *mddev, sector_t sector_nr,
|
2011-05-11 06:54:41 +02:00
|
|
|
int *skipped, int go_faster)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *r10_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct bio *biolist = NULL, *bio;
|
|
|
|
sector_t max_sector, nr_sectors;
|
|
|
|
int i;
|
2006-01-06 09:20:16 +01:00
|
|
|
int max_sync;
|
2010-10-19 01:03:39 +02:00
|
|
|
sector_t sync_blocks;
|
2005-04-17 00:20:36 +02:00
|
|
|
sector_t sectors_skipped = 0;
|
|
|
|
int chunks_skipped = 0;
|
|
|
|
|
|
|
|
if (!conf->r10buf_pool)
|
|
|
|
if (init_resync(conf))
|
2005-06-22 02:17:13 +02:00
|
|
|
return 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
skipped:
|
2009-03-31 05:33:13 +02:00
|
|
|
max_sector = mddev->dev_sectors;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
|
|
|
|
max_sector = mddev->resync_max_sectors;
|
|
|
|
if (sector_nr >= max_sector) {
|
2006-01-06 09:20:16 +01:00
|
|
|
/* If we aborted, we need to abort the
|
|
|
|
* sync on the 'current' bitmap chucks (there can
|
|
|
|
* be several when recovering multiple devices).
|
|
|
|
* as we may have started syncing it but not finished.
|
|
|
|
* We can find the current address in
|
|
|
|
* mddev->curr_resync, but for recovery,
|
|
|
|
* we need to convert that to several
|
|
|
|
* virtual addresses.
|
|
|
|
*/
|
|
|
|
if (mddev->curr_resync < max_sector) { /* aborted */
|
|
|
|
if (test_bit(MD_RECOVERY_SYNC, &mddev->recovery))
|
|
|
|
bitmap_end_sync(mddev->bitmap, mddev->curr_resync,
|
|
|
|
&sync_blocks, 1);
|
|
|
|
else for (i=0; i<conf->raid_disks; i++) {
|
|
|
|
sector_t sect =
|
|
|
|
raid10_find_virt(conf, mddev->curr_resync, i);
|
|
|
|
bitmap_end_sync(mddev->bitmap, sect,
|
|
|
|
&sync_blocks, 1);
|
|
|
|
}
|
|
|
|
} else /* completed sync */
|
|
|
|
conf->fullsync = 0;
|
|
|
|
|
|
|
|
bitmap_close_sync(mddev->bitmap);
|
2005-04-17 00:20:36 +02:00
|
|
|
close_sync(conf);
|
2005-06-22 02:17:13 +02:00
|
|
|
*skipped = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
return sectors_skipped;
|
|
|
|
}
|
|
|
|
if (chunks_skipped >= conf->raid_disks) {
|
|
|
|
/* if there has been nothing to do on any drive,
|
|
|
|
* then there is nothing to do at all..
|
|
|
|
*/
|
2005-06-22 02:17:13 +02:00
|
|
|
*skipped = 1;
|
|
|
|
return (max_sector - sector_nr) + sectors_skipped;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-02-06 10:39:52 +01:00
|
|
|
if (max_sector > mddev->resync_max)
|
|
|
|
max_sector = mddev->resync_max; /* Don't do IO beyond here */
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* make sure whole request will fit in a chunk - if chunks
|
|
|
|
* are meaningful
|
|
|
|
*/
|
|
|
|
if (conf->near_copies < conf->raid_disks &&
|
|
|
|
max_sector > (sector_nr | conf->chunk_mask))
|
|
|
|
max_sector = (sector_nr | conf->chunk_mask) + 1;
|
|
|
|
/*
|
|
|
|
* If there is non-resync activity waiting for us then
|
|
|
|
* put in a delay to throttle resync.
|
|
|
|
*/
|
2006-01-06 09:20:13 +01:00
|
|
|
if (!go_faster && conf->nr_waiting)
|
2005-04-17 00:20:36 +02:00
|
|
|
msleep_interruptible(1000);
|
|
|
|
|
|
|
|
/* Again, very different code for resync and recovery.
|
|
|
|
* Both must result in an r10bio with a list of bios that
|
|
|
|
* have bi_end_io, bi_sector, bi_bdev set,
|
|
|
|
* and bi_private set to the r10bio.
|
|
|
|
* For recovery, we may actually create several r10bios
|
|
|
|
* with 2 bios in each, that correspond to the bios in the main one.
|
|
|
|
* In this case, the subordinate r10bios link back through a
|
|
|
|
* borrowed master_bio pointer, and the counter in the master
|
|
|
|
* includes a ref from each subordinate.
|
|
|
|
*/
|
|
|
|
/* First, we decide what to do and set ->bi_end_io
|
|
|
|
* To end_sync_read if we want to read, and
|
|
|
|
* end_sync_write if we will want to write.
|
|
|
|
*/
|
|
|
|
|
2006-01-06 09:20:16 +01:00
|
|
|
max_sync = RESYNC_PAGES << (PAGE_SHIFT-9);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!test_bit(MD_RECOVERY_SYNC, &mddev->recovery)) {
|
|
|
|
/* recovery... the complicated one */
|
2011-07-28 03:39:24 +02:00
|
|
|
int j;
|
2005-04-17 00:20:36 +02:00
|
|
|
r10_bio = NULL;
|
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
for (i=0 ; i<conf->raid_disks; i++) {
|
|
|
|
int still_degraded;
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *rb2;
|
2011-05-11 06:54:41 +02:00
|
|
|
sector_t sect;
|
|
|
|
int must_sync;
|
2011-07-28 03:39:24 +02:00
|
|
|
int any_working;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
if (conf->mirrors[i].rdev == NULL ||
|
|
|
|
test_bit(In_sync, &conf->mirrors[i].rdev->flags))
|
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
still_degraded = 0;
|
|
|
|
/* want to reconstruct this device */
|
|
|
|
rb2 = r10_bio;
|
|
|
|
sect = raid10_find_virt(conf, sector_nr, i);
|
|
|
|
/* Unless we are doing a full sync, we only need
|
|
|
|
* to recover the block if it is set in the bitmap
|
|
|
|
*/
|
|
|
|
must_sync = bitmap_start_sync(mddev->bitmap, sect,
|
|
|
|
&sync_blocks, 1);
|
|
|
|
if (sync_blocks < max_sync)
|
|
|
|
max_sync = sync_blocks;
|
|
|
|
if (!must_sync &&
|
|
|
|
!conf->fullsync) {
|
|
|
|
/* yep, skip the sync_blocks here, but don't assume
|
|
|
|
* that there will never be anything to do here
|
|
|
|
*/
|
|
|
|
chunks_skipped = -1;
|
|
|
|
continue;
|
|
|
|
}
|
2006-01-06 09:20:16 +01:00
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
r10_bio = mempool_alloc(conf->r10buf_pool, GFP_NOIO);
|
|
|
|
raise_barrier(conf, rb2 != NULL);
|
|
|
|
atomic_set(&r10_bio->remaining, 0);
|
2009-05-07 04:48:10 +02:00
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
r10_bio->master_bio = (struct bio*)rb2;
|
|
|
|
if (rb2)
|
|
|
|
atomic_inc(&rb2->remaining);
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
set_bit(R10BIO_IsRecover, &r10_bio->state);
|
|
|
|
r10_bio->sector = sect;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-11 06:54:41 +02:00
|
|
|
raid10_find_phys(conf, r10_bio);
|
|
|
|
|
|
|
|
/* Need to check if the array will still be
|
|
|
|
* degraded
|
|
|
|
*/
|
|
|
|
for (j=0; j<conf->raid_disks; j++)
|
|
|
|
if (conf->mirrors[j].rdev == NULL ||
|
|
|
|
test_bit(Faulty, &conf->mirrors[j].rdev->flags)) {
|
|
|
|
still_degraded = 1;
|
2005-09-10 01:24:04 +02:00
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-05-11 06:54:41 +02:00
|
|
|
|
|
|
|
must_sync = bitmap_start_sync(mddev->bitmap, sect,
|
|
|
|
&sync_blocks, still_degraded);
|
|
|
|
|
2011-07-28 03:39:24 +02:00
|
|
|
any_working = 0;
|
2011-05-11 06:54:41 +02:00
|
|
|
for (j=0; j<conf->copies;j++) {
|
2011-07-28 03:39:24 +02:00
|
|
|
int k;
|
2011-05-11 06:54:41 +02:00
|
|
|
int d = r10_bio->devs[j].devnum;
|
2011-07-28 03:39:25 +02:00
|
|
|
sector_t from_addr, to_addr;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev;
|
2011-07-28 03:39:24 +02:00
|
|
|
sector_t sector, first_bad;
|
|
|
|
int bad_sectors;
|
2011-05-11 06:54:41 +02:00
|
|
|
if (!conf->mirrors[d].rdev ||
|
|
|
|
!test_bit(In_sync, &conf->mirrors[d].rdev->flags))
|
|
|
|
continue;
|
|
|
|
/* This is where we read from */
|
2011-07-28 03:39:24 +02:00
|
|
|
any_working = 1;
|
2011-07-28 03:39:24 +02:00
|
|
|
rdev = conf->mirrors[d].rdev;
|
|
|
|
sector = r10_bio->devs[j].addr;
|
|
|
|
|
|
|
|
if (is_badblock(rdev, sector, max_sync,
|
|
|
|
&first_bad, &bad_sectors)) {
|
|
|
|
if (first_bad > sector)
|
|
|
|
max_sync = first_bad - sector;
|
|
|
|
else {
|
|
|
|
bad_sectors -= (sector
|
|
|
|
- first_bad);
|
|
|
|
if (max_sync > bad_sectors)
|
|
|
|
max_sync = bad_sectors;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2011-05-11 06:54:41 +02:00
|
|
|
bio = r10_bio->devs[0].bio;
|
|
|
|
bio->bi_next = biolist;
|
|
|
|
biolist = bio;
|
|
|
|
bio->bi_private = r10_bio;
|
|
|
|
bio->bi_end_io = end_sync_read;
|
|
|
|
bio->bi_rw = READ;
|
2011-07-28 03:39:25 +02:00
|
|
|
from_addr = r10_bio->devs[j].addr;
|
|
|
|
bio->bi_sector = from_addr +
|
2011-05-11 06:54:41 +02:00
|
|
|
conf->mirrors[d].rdev->data_offset;
|
|
|
|
bio->bi_bdev = conf->mirrors[d].rdev->bdev;
|
|
|
|
atomic_inc(&conf->mirrors[d].rdev->nr_pending);
|
|
|
|
atomic_inc(&r10_bio->remaining);
|
|
|
|
/* and we write to 'i' */
|
|
|
|
|
|
|
|
for (k=0; k<conf->copies; k++)
|
|
|
|
if (r10_bio->devs[k].devnum == i)
|
|
|
|
break;
|
|
|
|
BUG_ON(k == conf->copies);
|
|
|
|
bio = r10_bio->devs[1].bio;
|
|
|
|
bio->bi_next = biolist;
|
|
|
|
biolist = bio;
|
|
|
|
bio->bi_private = r10_bio;
|
|
|
|
bio->bi_end_io = end_sync_write;
|
|
|
|
bio->bi_rw = WRITE;
|
2011-07-28 03:39:25 +02:00
|
|
|
to_addr = r10_bio->devs[k].addr;
|
|
|
|
bio->bi_sector = to_addr +
|
2011-05-11 06:54:41 +02:00
|
|
|
conf->mirrors[i].rdev->data_offset;
|
|
|
|
bio->bi_bdev = conf->mirrors[i].rdev->bdev;
|
|
|
|
|
|
|
|
r10_bio->devs[0].devnum = d;
|
2011-07-28 03:39:25 +02:00
|
|
|
r10_bio->devs[0].addr = from_addr;
|
2011-05-11 06:54:41 +02:00
|
|
|
r10_bio->devs[1].devnum = i;
|
2011-07-28 03:39:25 +02:00
|
|
|
r10_bio->devs[1].addr = to_addr;
|
2011-05-11 06:54:41 +02:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (j == conf->copies) {
|
2011-07-28 03:39:24 +02:00
|
|
|
/* Cannot recover, so abort the recovery or
|
|
|
|
* record a bad block */
|
2011-05-11 06:54:41 +02:00
|
|
|
put_buf(r10_bio);
|
|
|
|
if (rb2)
|
|
|
|
atomic_dec(&rb2->remaining);
|
|
|
|
r10_bio = rb2;
|
2011-07-28 03:39:24 +02:00
|
|
|
if (any_working) {
|
|
|
|
/* problem is that there are bad blocks
|
|
|
|
* on other device(s)
|
|
|
|
*/
|
|
|
|
int k;
|
|
|
|
for (k = 0; k < conf->copies; k++)
|
|
|
|
if (r10_bio->devs[k].devnum == i)
|
|
|
|
break;
|
|
|
|
if (!rdev_set_badblocks(
|
|
|
|
conf->mirrors[i].rdev,
|
|
|
|
r10_bio->devs[k].addr,
|
|
|
|
max_sync, 0))
|
|
|
|
any_working = 0;
|
|
|
|
}
|
|
|
|
if (!any_working) {
|
|
|
|
if (!test_and_set_bit(MD_RECOVERY_INTR,
|
|
|
|
&mddev->recovery))
|
|
|
|
printk(KERN_INFO "md/raid10:%s: insufficient "
|
|
|
|
"working devices for recovery.\n",
|
|
|
|
mdname(mddev));
|
|
|
|
conf->mirrors[i].recovery_disabled
|
|
|
|
= mddev->recovery_disabled;
|
|
|
|
}
|
2011-05-11 06:54:41 +02:00
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-05-11 06:54:41 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
if (biolist == NULL) {
|
|
|
|
while (r10_bio) {
|
2011-10-11 07:48:43 +02:00
|
|
|
struct r10bio *rb2 = r10_bio;
|
|
|
|
r10_bio = (struct r10bio*) rb2->master_bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
rb2->master_bio = NULL;
|
|
|
|
put_buf(rb2);
|
|
|
|
}
|
|
|
|
goto giveup;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* resync. Schedule a read for every block at this virt offset */
|
|
|
|
int count = 0;
|
2006-01-06 09:20:16 +01:00
|
|
|
|
2009-02-25 03:18:47 +01:00
|
|
|
bitmap_cond_end_sync(mddev->bitmap, sector_nr);
|
|
|
|
|
2006-01-06 09:20:16 +01:00
|
|
|
if (!bitmap_start_sync(mddev->bitmap, sector_nr,
|
|
|
|
&sync_blocks, mddev->degraded) &&
|
2011-05-11 06:54:41 +02:00
|
|
|
!conf->fullsync && !test_bit(MD_RECOVERY_REQUESTED,
|
|
|
|
&mddev->recovery)) {
|
2006-01-06 09:20:16 +01:00
|
|
|
/* We can skip this block */
|
|
|
|
*skipped = 1;
|
|
|
|
return sync_blocks + sectors_skipped;
|
|
|
|
}
|
|
|
|
if (sync_blocks < max_sync)
|
|
|
|
max_sync = sync_blocks;
|
2005-04-17 00:20:36 +02:00
|
|
|
r10_bio = mempool_alloc(conf->r10buf_pool, GFP_NOIO);
|
|
|
|
|
|
|
|
r10_bio->mddev = mddev;
|
|
|
|
atomic_set(&r10_bio->remaining, 0);
|
2006-01-06 09:20:16 +01:00
|
|
|
raise_barrier(conf, 0);
|
|
|
|
conf->next_resync = sector_nr;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
r10_bio->master_bio = NULL;
|
|
|
|
r10_bio->sector = sector_nr;
|
|
|
|
set_bit(R10BIO_IsSync, &r10_bio->state);
|
|
|
|
raid10_find_phys(conf, r10_bio);
|
|
|
|
r10_bio->sectors = (sector_nr | conf->chunk_mask) - sector_nr +1;
|
|
|
|
|
|
|
|
for (i=0; i<conf->copies; i++) {
|
|
|
|
int d = r10_bio->devs[i].devnum;
|
2011-07-28 03:39:24 +02:00
|
|
|
sector_t first_bad, sector;
|
|
|
|
int bad_sectors;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
bio = r10_bio->devs[i].bio;
|
|
|
|
bio->bi_end_io = NULL;
|
2007-06-16 19:16:06 +02:00
|
|
|
clear_bit(BIO_UPTODATE, &bio->bi_flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (conf->mirrors[d].rdev == NULL ||
|
2005-11-09 06:39:31 +01:00
|
|
|
test_bit(Faulty, &conf->mirrors[d].rdev->flags))
|
2005-04-17 00:20:36 +02:00
|
|
|
continue;
|
2011-07-28 03:39:24 +02:00
|
|
|
sector = r10_bio->devs[i].addr;
|
|
|
|
if (is_badblock(conf->mirrors[d].rdev,
|
|
|
|
sector, max_sync,
|
|
|
|
&first_bad, &bad_sectors)) {
|
|
|
|
if (first_bad > sector)
|
|
|
|
max_sync = first_bad - sector;
|
|
|
|
else {
|
|
|
|
bad_sectors -= (sector - first_bad);
|
|
|
|
if (max_sync > bad_sectors)
|
|
|
|
max_sync = max_sync;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
atomic_inc(&conf->mirrors[d].rdev->nr_pending);
|
|
|
|
atomic_inc(&r10_bio->remaining);
|
|
|
|
bio->bi_next = biolist;
|
|
|
|
biolist = bio;
|
|
|
|
bio->bi_private = r10_bio;
|
|
|
|
bio->bi_end_io = end_sync_read;
|
2006-12-13 09:34:13 +01:00
|
|
|
bio->bi_rw = READ;
|
2011-07-28 03:39:24 +02:00
|
|
|
bio->bi_sector = sector +
|
2005-04-17 00:20:36 +02:00
|
|
|
conf->mirrors[d].rdev->data_offset;
|
|
|
|
bio->bi_bdev = conf->mirrors[d].rdev->bdev;
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (count < 2) {
|
|
|
|
for (i=0; i<conf->copies; i++) {
|
|
|
|
int d = r10_bio->devs[i].devnum;
|
|
|
|
if (r10_bio->devs[i].bio->bi_end_io)
|
2011-05-11 06:54:41 +02:00
|
|
|
rdev_dec_pending(conf->mirrors[d].rdev,
|
|
|
|
mddev);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
put_buf(r10_bio);
|
|
|
|
biolist = NULL;
|
|
|
|
goto giveup;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (bio = biolist; bio ; bio=bio->bi_next) {
|
|
|
|
|
|
|
|
bio->bi_flags &= ~(BIO_POOL_MASK - 1);
|
|
|
|
if (bio->bi_end_io)
|
|
|
|
bio->bi_flags |= 1 << BIO_UPTODATE;
|
|
|
|
bio->bi_vcnt = 0;
|
|
|
|
bio->bi_idx = 0;
|
|
|
|
bio->bi_phys_segments = 0;
|
|
|
|
bio->bi_size = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
nr_sectors = 0;
|
2006-01-06 09:20:16 +01:00
|
|
|
if (sector_nr + max_sync < max_sector)
|
|
|
|
max_sector = sector_nr + max_sync;
|
2005-04-17 00:20:36 +02:00
|
|
|
do {
|
|
|
|
struct page *page;
|
|
|
|
int len = PAGE_SIZE;
|
|
|
|
if (sector_nr + (len>>9) > max_sector)
|
|
|
|
len = (max_sector - sector_nr) << 9;
|
|
|
|
if (len == 0)
|
|
|
|
break;
|
|
|
|
for (bio= biolist ; bio ; bio=bio->bi_next) {
|
2011-05-11 06:54:41 +02:00
|
|
|
struct bio *bio2;
|
2005-04-17 00:20:36 +02:00
|
|
|
page = bio->bi_io_vec[bio->bi_vcnt].bv_page;
|
2011-05-11 06:54:41 +02:00
|
|
|
if (bio_add_page(bio, page, len, 0))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* stop here */
|
|
|
|
bio->bi_io_vec[bio->bi_vcnt].bv_page = page;
|
|
|
|
for (bio2 = biolist;
|
|
|
|
bio2 && bio2 != bio;
|
|
|
|
bio2 = bio2->bi_next) {
|
|
|
|
/* remove last page from this bio */
|
|
|
|
bio2->bi_vcnt--;
|
|
|
|
bio2->bi_size -= len;
|
|
|
|
bio2->bi_flags &= ~(1<< BIO_SEG_VALID);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-05-11 06:54:41 +02:00
|
|
|
goto bio_full;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
nr_sectors += len>>9;
|
|
|
|
sector_nr += len>>9;
|
|
|
|
} while (biolist->bi_vcnt < RESYNC_PAGES);
|
|
|
|
bio_full:
|
|
|
|
r10_bio->sectors = nr_sectors;
|
|
|
|
|
|
|
|
while (biolist) {
|
|
|
|
bio = biolist;
|
|
|
|
biolist = biolist->bi_next;
|
|
|
|
|
|
|
|
bio->bi_next = NULL;
|
|
|
|
r10_bio = bio->bi_private;
|
|
|
|
r10_bio->sectors = nr_sectors;
|
|
|
|
|
|
|
|
if (bio->bi_end_io == end_sync_read) {
|
|
|
|
md_sync_acct(bio->bi_bdev, nr_sectors);
|
|
|
|
generic_make_request(bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-06-22 02:17:13 +02:00
|
|
|
if (sectors_skipped)
|
|
|
|
/* pretend they weren't skipped, it makes
|
|
|
|
* no important difference in this case
|
|
|
|
*/
|
|
|
|
md_done_sync(mddev, sectors_skipped, 1);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
return sectors_skipped + nr_sectors;
|
|
|
|
giveup:
|
|
|
|
/* There is nowhere to write, so all non-sync
|
2011-07-28 03:39:24 +02:00
|
|
|
* drives must be failed or in resync, all drives
|
|
|
|
* have a bad block, so try the next chunk...
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2009-02-25 03:18:47 +01:00
|
|
|
if (sector_nr + max_sync < max_sector)
|
|
|
|
max_sector = sector_nr + max_sync;
|
|
|
|
|
|
|
|
sectors_skipped += (max_sector - sector_nr);
|
2005-04-17 00:20:36 +02:00
|
|
|
chunks_skipped ++;
|
|
|
|
sector_nr = max_sector;
|
|
|
|
goto skipped;
|
|
|
|
}
|
|
|
|
|
2009-03-18 02:10:40 +01:00
|
|
|
static sector_t
|
2011-10-11 07:47:53 +02:00
|
|
|
raid10_size(struct mddev *mddev, sector_t sectors, int raid_disks)
|
2009-03-18 02:10:40 +01:00
|
|
|
{
|
|
|
|
sector_t size;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2009-03-18 02:10:40 +01:00
|
|
|
|
|
|
|
if (!raid_disks)
|
2010-03-16 07:23:35 +01:00
|
|
|
raid_disks = conf->raid_disks;
|
2009-03-18 02:10:40 +01:00
|
|
|
if (!sectors)
|
2010-03-08 06:02:45 +01:00
|
|
|
sectors = conf->dev_sectors;
|
2009-03-18 02:10:40 +01:00
|
|
|
|
|
|
|
size = sectors >> conf->chunk_shift;
|
|
|
|
sector_div(size, conf->far_copies);
|
|
|
|
size = size * raid_disks;
|
|
|
|
sector_div(size, conf->near_copies);
|
|
|
|
|
|
|
|
return size << conf->chunk_shift;
|
|
|
|
}
|
|
|
|
|
2010-03-08 06:02:45 +01:00
|
|
|
|
2011-10-11 07:49:02 +02:00
|
|
|
static struct r10conf *setup_conf(struct mddev *mddev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = NULL;
|
2006-06-26 09:27:41 +02:00
|
|
|
int nc, fc, fo;
|
2005-04-17 00:20:36 +02:00
|
|
|
sector_t stride, size;
|
2010-03-08 06:02:45 +01:00
|
|
|
int err = -EINVAL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-16 12:46:29 +02:00
|
|
|
if (mddev->new_chunk_sectors < (PAGE_SIZE >> 9) ||
|
|
|
|
!is_power_of_2(mddev->new_chunk_sectors)) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: chunk size must be "
|
|
|
|
"at least PAGE_SIZE(%ld) and be a power of 2.\n",
|
|
|
|
mdname(mddev), PAGE_SIZE);
|
2010-03-08 06:02:45 +01:00
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2006-01-06 09:20:36 +01:00
|
|
|
|
2010-06-16 12:46:29 +02:00
|
|
|
nc = mddev->new_layout & 255;
|
|
|
|
fc = (mddev->new_layout >> 8) & 255;
|
|
|
|
fo = mddev->new_layout & (1<<16);
|
2010-03-08 06:02:45 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if ((nc*fc) <2 || (nc*fc) > mddev->raid_disks ||
|
2010-06-16 12:46:29 +02:00
|
|
|
(mddev->new_layout >> 17)) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: unsupported raid10 layout: 0x%8x\n",
|
2010-06-16 12:46:29 +02:00
|
|
|
mdname(mddev), mddev->new_layout);
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
}
|
2010-03-08 06:02:45 +01:00
|
|
|
|
|
|
|
err = -ENOMEM;
|
2011-10-11 07:49:02 +02:00
|
|
|
conf = kzalloc(sizeof(struct r10conf), GFP_KERNEL);
|
2010-03-08 06:02:45 +01:00
|
|
|
if (!conf)
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
2010-03-08 06:02:45 +01:00
|
|
|
|
2006-01-06 09:20:28 +01:00
|
|
|
conf->mirrors = kzalloc(sizeof(struct mirror_info)*mddev->raid_disks,
|
2010-03-08 06:02:45 +01:00
|
|
|
GFP_KERNEL);
|
|
|
|
if (!conf->mirrors)
|
|
|
|
goto out;
|
2006-01-06 09:20:28 +01:00
|
|
|
|
|
|
|
conf->tmppage = alloc_page(GFP_KERNEL);
|
|
|
|
if (!conf->tmppage)
|
2010-03-08 06:02:45 +01:00
|
|
|
goto out;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-03-01 05:11:18 +01:00
|
|
|
conf->raid_disks = mddev->raid_disks;
|
2005-04-17 00:20:36 +02:00
|
|
|
conf->near_copies = nc;
|
|
|
|
conf->far_copies = fc;
|
|
|
|
conf->copies = nc*fc;
|
2006-06-26 09:27:41 +02:00
|
|
|
conf->far_offset = fo;
|
2010-03-08 06:02:45 +01:00
|
|
|
conf->chunk_mask = mddev->new_chunk_sectors - 1;
|
|
|
|
conf->chunk_shift = ffz(~mddev->new_chunk_sectors);
|
|
|
|
|
|
|
|
conf->r10bio_pool = mempool_create(NR_RAID10_BIOS, r10bio_pool_alloc,
|
|
|
|
r10bio_pool_free, conf);
|
|
|
|
if (!conf->r10bio_pool)
|
|
|
|
goto out;
|
|
|
|
|
2009-03-31 05:33:13 +02:00
|
|
|
size = mddev->dev_sectors >> conf->chunk_shift;
|
2007-03-01 05:11:18 +01:00
|
|
|
sector_div(size, fc);
|
|
|
|
size = size * conf->raid_disks;
|
|
|
|
sector_div(size, nc);
|
|
|
|
/* 'size' is now the number of chunks in the array */
|
|
|
|
/* calculate "used chunks per device" in 'stride' */
|
|
|
|
stride = size * conf->copies;
|
2007-06-16 19:16:06 +02:00
|
|
|
|
|
|
|
/* We need to round up when dividing by raid_disks to
|
|
|
|
* get the stride size.
|
|
|
|
*/
|
|
|
|
stride += conf->raid_disks - 1;
|
2007-03-01 05:11:18 +01:00
|
|
|
sector_div(stride, conf->raid_disks);
|
2010-03-08 06:02:45 +01:00
|
|
|
|
|
|
|
conf->dev_sectors = stride << conf->chunk_shift;
|
2007-03-01 05:11:18 +01:00
|
|
|
|
2006-06-26 09:27:41 +02:00
|
|
|
if (fo)
|
2007-03-01 05:11:18 +01:00
|
|
|
stride = 1;
|
|
|
|
else
|
2006-06-26 09:27:41 +02:00
|
|
|
sector_div(stride, fc);
|
2007-03-01 05:11:18 +01:00
|
|
|
conf->stride = stride << conf->chunk_shift;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-05-15 01:05:54 +02:00
|
|
|
spin_lock_init(&conf->device_lock);
|
2010-03-08 06:02:45 +01:00
|
|
|
INIT_LIST_HEAD(&conf->retry_list);
|
|
|
|
|
|
|
|
spin_lock_init(&conf->resync_lock);
|
|
|
|
init_waitqueue_head(&conf->wait_barrier);
|
|
|
|
|
|
|
|
conf->thread = md_register_thread(raid10d, mddev, NULL);
|
|
|
|
if (!conf->thread)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
conf->mddev = mddev;
|
|
|
|
return conf;
|
|
|
|
|
|
|
|
out:
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: couldn't allocate memory.\n",
|
2010-03-08 06:02:45 +01:00
|
|
|
mdname(mddev));
|
|
|
|
if (conf) {
|
|
|
|
if (conf->r10bio_pool)
|
|
|
|
mempool_destroy(conf->r10bio_pool);
|
|
|
|
kfree(conf->mirrors);
|
|
|
|
safe_put_page(conf->tmppage);
|
|
|
|
kfree(conf);
|
|
|
|
}
|
|
|
|
return ERR_PTR(err);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static int run(struct mddev *mddev)
|
2010-03-08 06:02:45 +01:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf;
|
2010-03-08 06:02:45 +01:00
|
|
|
int i, disk_idx, chunk_size;
|
2011-10-11 07:48:46 +02:00
|
|
|
struct mirror_info *disk;
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev;
|
2010-03-08 06:02:45 +01:00
|
|
|
sector_t size;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* copy the already verified devices into our private RAID10
|
|
|
|
* bookkeeping area. [whatever we allocate in run(),
|
|
|
|
* should be freed in stop()]
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (mddev->private == NULL) {
|
|
|
|
conf = setup_conf(mddev);
|
|
|
|
if (IS_ERR(conf))
|
|
|
|
return PTR_ERR(conf);
|
|
|
|
mddev->private = conf;
|
|
|
|
}
|
|
|
|
conf = mddev->private;
|
|
|
|
if (!conf)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
mddev->thread = conf->thread;
|
|
|
|
conf->thread = NULL;
|
|
|
|
|
2009-07-01 03:13:45 +02:00
|
|
|
chunk_size = mddev->chunk_sectors << 9;
|
|
|
|
blk_queue_io_min(mddev->queue, chunk_size);
|
|
|
|
if (conf->raid_disks % conf->near_copies)
|
|
|
|
blk_queue_io_opt(mddev->queue, chunk_size * conf->raid_disks);
|
|
|
|
else
|
|
|
|
blk_queue_io_opt(mddev->queue, chunk_size *
|
|
|
|
(conf->raid_disks / conf->near_copies));
|
|
|
|
|
2009-01-08 22:31:08 +01:00
|
|
|
list_for_each_entry(rdev, &mddev->disks, same_set) {
|
2011-07-28 03:31:47 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
disk_idx = rdev->raid_disk;
|
2010-03-16 07:23:35 +01:00
|
|
|
if (disk_idx >= conf->raid_disks
|
2005-04-17 00:20:36 +02:00
|
|
|
|| disk_idx < 0)
|
|
|
|
continue;
|
|
|
|
disk = conf->mirrors + disk_idx;
|
|
|
|
|
|
|
|
disk->rdev = rdev;
|
2009-07-01 03:13:45 +02:00
|
|
|
disk_stack_limits(mddev->gendisk, rdev->bdev,
|
|
|
|
rdev->data_offset << 9);
|
2005-04-17 00:20:36 +02:00
|
|
|
/* as we don't honour merge_bvec_fn, we must never risk
|
2010-03-08 06:44:38 +01:00
|
|
|
* violating it, so limit max_segments to 1 lying
|
|
|
|
* within a single page.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2010-03-08 06:44:38 +01:00
|
|
|
if (rdev->bdev->bd_disk->queue->merge_bvec_fn) {
|
|
|
|
blk_queue_max_segments(mddev->queue, 1);
|
|
|
|
blk_queue_segment_boundary(mddev->queue,
|
|
|
|
PAGE_CACHE_SIZE - 1);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
disk->head_position = 0;
|
|
|
|
}
|
2005-09-10 01:24:03 +02:00
|
|
|
/* need to check that every block has at least one working mirror */
|
2011-07-27 03:00:36 +02:00
|
|
|
if (!enough(conf, -1)) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: not enough operational mirrors.\n",
|
2005-09-10 01:24:03 +02:00
|
|
|
mdname(mddev));
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out_free_conf;
|
|
|
|
}
|
|
|
|
|
|
|
|
mddev->degraded = 0;
|
|
|
|
for (i = 0; i < conf->raid_disks; i++) {
|
|
|
|
|
|
|
|
disk = conf->mirrors + i;
|
|
|
|
|
2006-06-26 09:27:40 +02:00
|
|
|
if (!disk->rdev ||
|
2006-10-21 19:24:07 +02:00
|
|
|
!test_bit(In_sync, &disk->rdev->flags)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
disk->head_position = 0;
|
|
|
|
mddev->degraded++;
|
Ensure interrupted recovery completed properly (v1 metadata plus bitmap)
If, while assembling an array, we find a device which is not fully
in-sync with the array, it is important to set the "fullsync" flags.
This is an exact analog to the setting of this flag in hot_add_disk
methods.
Currently, only v1.x metadata supports having devices in an array
which are not fully in-sync (it keep track of how in sync they are).
The 'fullsync' flag only makes a difference when a write-intent bitmap
is being used. In this case it tells recovery to ignore the bitmap
and recovery all blocks.
This fix is already in place for raid1, but not raid5/6 or raid10.
So without this fix, a raid1 ir raid4/5/6 array with version 1.x
metadata and a write intent bitmaps, that is stopped in the middle
of a recovery, will appear to complete the recovery instantly
after it is reassembled, but the recovery will not be correct.
If you might have an array like that, issueing
echo repair > /sys/block/mdXX/md/sync_action
will make sure recovery completes properly.
Cc: <stable@kernel.org>
Signed-off-by: Neil Brown <neilb@suse.de>
2008-06-28 00:30:52 +02:00
|
|
|
if (disk->rdev)
|
|
|
|
conf->fullsync = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-10-26 02:54:39 +02:00
|
|
|
disk->recovery_disabled = mddev->recovery_disabled - 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2009-06-18 00:48:06 +02:00
|
|
|
if (mddev->recovery_cp != MaxSector)
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_NOTICE "md/raid10:%s: not clean"
|
2009-06-18 00:48:06 +02:00
|
|
|
" -- starting background reconstruction\n",
|
|
|
|
mdname(mddev));
|
2005-04-17 00:20:36 +02:00
|
|
|
printk(KERN_INFO
|
2010-05-03 06:47:14 +02:00
|
|
|
"md/raid10:%s: active with %d out of %d devices\n",
|
2010-03-16 07:23:35 +01:00
|
|
|
mdname(mddev), conf->raid_disks - mddev->degraded,
|
|
|
|
conf->raid_disks);
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Ok, everything is just fine now
|
|
|
|
*/
|
2010-03-08 06:02:45 +01:00
|
|
|
mddev->dev_sectors = conf->dev_sectors;
|
|
|
|
size = raid10_size(mddev, 0, 0);
|
|
|
|
md_set_array_sectors(mddev, size);
|
|
|
|
mddev->resync_max_sectors = size;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-10-03 10:15:54 +02:00
|
|
|
mddev->queue->backing_dev_info.congested_fn = raid10_congested;
|
|
|
|
mddev->queue->backing_dev_info.congested_data = mddev;
|
2005-05-17 06:53:16 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Calculate max read-ahead size.
|
|
|
|
* We need to readahead at least twice a whole stripe....
|
|
|
|
* maybe...
|
|
|
|
*/
|
|
|
|
{
|
2009-06-18 00:45:01 +02:00
|
|
|
int stripe = conf->raid_disks *
|
|
|
|
((mddev->chunk_sectors << 9) / PAGE_SIZE);
|
2005-04-17 00:20:36 +02:00
|
|
|
stripe /= conf->near_copies;
|
|
|
|
if (mddev->queue->backing_dev_info.ra_pages < 2* stripe)
|
|
|
|
mddev->queue->backing_dev_info.ra_pages = 2* stripe;
|
|
|
|
}
|
|
|
|
|
2010-03-16 07:23:35 +01:00
|
|
|
if (conf->near_copies < conf->raid_disks)
|
2005-04-17 00:20:36 +02:00
|
|
|
blk_queue_merge_bvec(mddev->queue, raid10_mergeable_bvec);
|
2011-03-17 11:11:05 +01:00
|
|
|
|
|
|
|
if (md_integrity_register(mddev))
|
|
|
|
goto out_free_conf;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_free_conf:
|
2011-09-21 07:30:20 +02:00
|
|
|
md_unregister_thread(&mddev->thread);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (conf->r10bio_pool)
|
|
|
|
mempool_destroy(conf->r10bio_pool);
|
2006-01-06 09:20:40 +01:00
|
|
|
safe_put_page(conf->tmppage);
|
2005-06-22 02:17:30 +02:00
|
|
|
kfree(conf->mirrors);
|
2005-04-17 00:20:36 +02:00
|
|
|
kfree(conf);
|
|
|
|
mddev->private = NULL;
|
|
|
|
out:
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static int stop(struct mddev *mddev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-03-31 05:39:39 +02:00
|
|
|
raise_barrier(conf, 0);
|
|
|
|
lower_barrier(conf);
|
|
|
|
|
2011-09-21 07:30:20 +02:00
|
|
|
md_unregister_thread(&mddev->thread);
|
2005-04-17 00:20:36 +02:00
|
|
|
blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
|
|
|
|
if (conf->r10bio_pool)
|
|
|
|
mempool_destroy(conf->r10bio_pool);
|
2005-06-22 02:17:30 +02:00
|
|
|
kfree(conf->mirrors);
|
2005-04-17 00:20:36 +02:00
|
|
|
kfree(conf);
|
|
|
|
mddev->private = NULL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void raid10_quiesce(struct mddev *mddev, int state)
|
2006-01-06 09:20:16 +01:00
|
|
|
{
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf = mddev->private;
|
2006-01-06 09:20:16 +01:00
|
|
|
|
|
|
|
switch(state) {
|
|
|
|
case 1:
|
|
|
|
raise_barrier(conf, 0);
|
|
|
|
break;
|
|
|
|
case 0:
|
|
|
|
lower_barrier(conf);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void *raid10_takeover_raid0(struct mddev *mddev)
|
2010-03-08 06:02:45 +01:00
|
|
|
{
|
2011-10-11 07:45:26 +02:00
|
|
|
struct md_rdev *rdev;
|
2011-10-11 07:49:02 +02:00
|
|
|
struct r10conf *conf;
|
2010-03-08 06:02:45 +01:00
|
|
|
|
|
|
|
if (mddev->degraded > 0) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: Error: degraded raid0!\n",
|
|
|
|
mdname(mddev));
|
2010-03-08 06:02:45 +01:00
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Set new parameters */
|
|
|
|
mddev->new_level = 10;
|
|
|
|
/* new layout: far_copies = 1, near_copies = 2 */
|
|
|
|
mddev->new_layout = (1<<8) + 2;
|
|
|
|
mddev->new_chunk_sectors = mddev->chunk_sectors;
|
|
|
|
mddev->delta_disks = mddev->raid_disks;
|
|
|
|
mddev->raid_disks *= 2;
|
|
|
|
/* make sure it will be not marked as dirty */
|
|
|
|
mddev->recovery_cp = MaxSector;
|
|
|
|
|
|
|
|
conf = setup_conf(mddev);
|
2011-02-04 14:18:26 +01:00
|
|
|
if (!IS_ERR(conf)) {
|
2010-06-15 10:36:03 +02:00
|
|
|
list_for_each_entry(rdev, &mddev->disks, same_set)
|
|
|
|
if (rdev->raid_disk >= 0)
|
|
|
|
rdev->new_raid_disk = rdev->raid_disk * 2;
|
2011-02-04 14:18:26 +01:00
|
|
|
conf->barrier = 1;
|
|
|
|
}
|
|
|
|
|
2010-03-08 06:02:45 +01:00
|
|
|
return conf;
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:47:53 +02:00
|
|
|
static void *raid10_takeover(struct mddev *mddev)
|
2010-03-08 06:02:45 +01:00
|
|
|
{
|
2011-10-11 07:48:59 +02:00
|
|
|
struct r0conf *raid0_conf;
|
2010-03-08 06:02:45 +01:00
|
|
|
|
|
|
|
/* raid10 can take over:
|
|
|
|
* raid0 - providing it has only two drives
|
|
|
|
*/
|
|
|
|
if (mddev->level == 0) {
|
|
|
|
/* for raid0 takeover only one zone is supported */
|
2011-10-11 07:48:59 +02:00
|
|
|
raid0_conf = mddev->private;
|
|
|
|
if (raid0_conf->nr_strip_zones > 1) {
|
2010-05-03 06:47:14 +02:00
|
|
|
printk(KERN_ERR "md/raid10:%s: cannot takeover raid 0"
|
|
|
|
" with more than one zone.\n",
|
|
|
|
mdname(mddev));
|
2010-03-08 06:02:45 +01:00
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
return raid10_takeover_raid0(mddev);
|
|
|
|
}
|
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
|
2011-10-11 07:49:58 +02:00
|
|
|
static struct md_personality raid10_personality =
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
.name = "raid10",
|
2006-01-06 09:20:36 +01:00
|
|
|
.level = 10,
|
2005-04-17 00:20:36 +02:00
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.make_request = make_request,
|
|
|
|
.run = run,
|
|
|
|
.stop = stop,
|
|
|
|
.status = status,
|
|
|
|
.error_handler = error,
|
|
|
|
.hot_add_disk = raid10_add_disk,
|
|
|
|
.hot_remove_disk= raid10_remove_disk,
|
|
|
|
.spare_active = raid10_spare_active,
|
|
|
|
.sync_request = sync_request,
|
2006-01-06 09:20:16 +01:00
|
|
|
.quiesce = raid10_quiesce,
|
2009-03-18 02:10:40 +01:00
|
|
|
.size = raid10_size,
|
2010-03-08 06:02:45 +01:00
|
|
|
.takeover = raid10_takeover,
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
static int __init raid_init(void)
|
|
|
|
{
|
2006-01-06 09:20:36 +01:00
|
|
|
return register_md_personality(&raid10_personality);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void raid_exit(void)
|
|
|
|
{
|
2006-01-06 09:20:36 +01:00
|
|
|
unregister_md_personality(&raid10_personality);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
module_init(raid_init);
|
|
|
|
module_exit(raid_exit);
|
|
|
|
MODULE_LICENSE("GPL");
|
2009-12-14 02:49:58 +01:00
|
|
|
MODULE_DESCRIPTION("RAID10 (striped mirror) personality for MD");
|
2005-04-17 00:20:36 +02:00
|
|
|
MODULE_ALIAS("md-personality-9"); /* RAID10 */
|
2006-01-06 09:20:51 +01:00
|
|
|
MODULE_ALIAS("md-raid10");
|
2006-01-06 09:20:36 +01:00
|
|
|
MODULE_ALIAS("md-level-10");
|
2011-10-11 07:50:01 +02:00
|
|
|
|
|
|
|
module_param(max_queued_requests, int, S_IRUGO|S_IWUSR);
|