2005-04-16 16:20:36 -06:00
|
|
|
#ifndef _RAID1_H
|
|
|
|
#define _RAID1_H
|
|
|
|
|
2012-07-30 18:03:52 -06:00
|
|
|
struct raid1_info {
|
2011-10-10 23:45:26 -06:00
|
|
|
struct md_rdev *rdev;
|
2005-04-16 16:20:36 -06:00
|
|
|
sector_t head_position;
|
2012-07-30 18:03:53 -06:00
|
|
|
|
|
|
|
/* When choose the best device for a read (read_balance())
|
|
|
|
* we try to keep sequential reads one the same device
|
|
|
|
*/
|
|
|
|
sector_t next_seq_sect;
|
md/raid1: prevent merging too large request
For SSD, if request size exceeds specific value (optimal io size), request size
isn't important for bandwidth. In such condition, if making request size bigger
will cause some disks idle, the total throughput will actually drop. A good
example is doing a readahead in a two-disk raid1 setup.
So when should we split big requests? We absolutly don't want to split big
request to very small requests. Even in SSD, big request transfer is more
efficient. This patch only considers request with size above optimal io size.
If all disks are busy, is it worth doing a split? Say optimal io size is 16k,
two requests 32k and two disks. We can let each disk run one 32k request, or
split the requests to 4 16k requests and each disk runs two. It's hard to say
which case is better, depending on hardware.
So only consider case where there are idle disks. For readahead, split is
always better in this case. And in my test, below patch can improve > 30%
thoughput. Hmm, not 100%, because disk isn't 100% busy.
Such case can happen not just in readahead, for example, in directio. But I
suppose directio usually will have bigger IO depth and make all disks busy, so
I ignored it.
Note: if the raid uses any hard disk, we don't prevent merging. That will make
performace worse.
Signed-off-by: Shaohua Li <shli@fusionio.com>
Signed-off-by: NeilBrown <neilb@suse.de>
2012-07-30 18:03:53 -06:00
|
|
|
sector_t seq_start;
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* memory pools need a pointer to the mddev, so they can force an unplug
|
|
|
|
* when memory is tight, and a count of the number of drives that the
|
|
|
|
* pool was allocated for, so they know how much to allocate and free.
|
|
|
|
* mddev->raid_disks cannot be used, as it can change while a pool is active
|
|
|
|
* These two datums are stored in a kmalloced struct.
|
2011-12-22 16:17:56 -07:00
|
|
|
* The 'raid_disks' here is twice the raid_disks in r1conf.
|
|
|
|
* This allows space for each 'real' device can have a replacement in the
|
|
|
|
* second half of the array.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
|
|
|
|
struct pool_info {
|
2011-10-10 23:47:53 -06:00
|
|
|
struct mddev *mddev;
|
2005-04-16 16:20:36 -06:00
|
|
|
int raid_disks;
|
|
|
|
};
|
|
|
|
|
2011-10-10 23:49:05 -06:00
|
|
|
struct r1conf {
|
2011-10-10 23:47:53 -06:00
|
|
|
struct mddev *mddev;
|
2012-07-30 18:03:52 -06:00
|
|
|
struct raid1_info *mirrors; /* twice 'raid_disks' to
|
2011-12-22 16:17:56 -07:00
|
|
|
* allow for replacements.
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
int raid_disks;
|
2011-10-06 21:22:33 -06:00
|
|
|
|
|
|
|
/* During resync, read_balancing is only allowed on the part
|
|
|
|
* of the array that has been resynced. 'next_resync' tells us
|
|
|
|
* where that is.
|
|
|
|
*/
|
|
|
|
sector_t next_resync;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
spinlock_t device_lock;
|
|
|
|
|
2011-10-10 23:48:43 -06:00
|
|
|
/* list of 'struct r1bio' that need to be processed by raid1d,
|
|
|
|
* whether to retry a read, writeout a resync or recovery
|
|
|
|
* block, or anything else.
|
2011-10-06 21:22:33 -06:00
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
struct list_head retry_list;
|
2005-06-21 18:17:23 -06:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* queue pending writes to be submitted on unplug */
|
|
|
|
struct bio_list pending_bio_list;
|
2011-10-10 23:50:01 -06:00
|
|
|
int pending_count;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* for use when syncing mirrors:
|
|
|
|
* We don't allow both normal IO and resync/recovery IO at
|
|
|
|
* the same time - resync/recovery can only happen when there
|
|
|
|
* is no other IO. So when either is active, the other has to wait.
|
|
|
|
* See more details description in raid1.c near raise_barrier().
|
|
|
|
*/
|
|
|
|
wait_queue_head_t wait_barrier;
|
2005-04-16 16:20:36 -06:00
|
|
|
spinlock_t resync_lock;
|
2005-06-21 18:17:23 -06:00
|
|
|
int nr_pending;
|
2006-01-06 01:20:12 -07:00
|
|
|
int nr_waiting;
|
2006-01-06 01:20:19 -07:00
|
|
|
int nr_queued;
|
2005-06-21 18:17:23 -06:00
|
|
|
int barrier;
|
2013-11-13 21:16:18 -07:00
|
|
|
int array_frozen;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* Set to 1 if a full sync is needed, (fresh device added).
|
|
|
|
* Cleared when a sync completes.
|
|
|
|
*/
|
|
|
|
int fullsync;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* When the same as mddev->recovery_disabled we don't allow
|
|
|
|
* recovery to be attempted as we expect a read error.
|
|
|
|
*/
|
|
|
|
int recovery_disabled;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-01-06 01:20:19 -07:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* poolinfo contains information about the content of the
|
|
|
|
* mempools - it changes when the array grows or shrinks
|
|
|
|
*/
|
|
|
|
struct pool_info *poolinfo;
|
2011-10-10 23:48:43 -06:00
|
|
|
mempool_t *r1bio_pool;
|
|
|
|
mempool_t *r1buf_pool;
|
2009-12-13 18:49:51 -07:00
|
|
|
|
2011-10-06 21:22:33 -06:00
|
|
|
/* temporary buffer to synchronous IO when attempting to repair
|
|
|
|
* a read error.
|
|
|
|
*/
|
|
|
|
struct page *tmppage;
|
|
|
|
|
|
|
|
|
2009-12-13 18:49:51 -07:00
|
|
|
/* When taking over an array from a different personality, we store
|
|
|
|
* the new thread here until we fully activate the array.
|
|
|
|
*/
|
2011-10-10 23:48:23 -06:00
|
|
|
struct md_thread *thread;
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* this is our 'private' RAID1 bio.
|
|
|
|
*
|
|
|
|
* it contains information about what kind of IO operations were started
|
|
|
|
* for this RAID1 operation, and about their status:
|
|
|
|
*/
|
|
|
|
|
2011-10-10 23:48:43 -06:00
|
|
|
struct r1bio {
|
2005-04-16 16:20:36 -06:00
|
|
|
atomic_t remaining; /* 'have we finished' count,
|
|
|
|
* used from IRQ handlers
|
|
|
|
*/
|
2005-09-09 17:23:47 -06:00
|
|
|
atomic_t behind_remaining; /* number of write-behind ios remaining
|
|
|
|
* in this BehindIO request
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
sector_t sector;
|
|
|
|
int sectors;
|
|
|
|
unsigned long state;
|
2011-10-10 23:47:53 -06:00
|
|
|
struct mddev *mddev;
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* original bio going to /dev/mdx
|
|
|
|
*/
|
|
|
|
struct bio *master_bio;
|
|
|
|
/*
|
|
|
|
* if the IO is in READ direction, then this is where we read
|
|
|
|
*/
|
|
|
|
int read_disk;
|
|
|
|
|
|
|
|
struct list_head retry_list;
|
2011-05-10 22:51:19 -06:00
|
|
|
/* Next two are only valid when R1BIO_BehindIO is set */
|
2011-07-27 19:32:10 -06:00
|
|
|
struct bio_vec *behind_bvecs;
|
2011-05-10 22:51:19 -06:00
|
|
|
int behind_page_count;
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* if the IO is in WRITE direction, then multiple bios are used.
|
|
|
|
* We choose the number when they are allocated.
|
|
|
|
*/
|
|
|
|
struct bio *bios[0];
|
2005-06-21 18:17:23 -06:00
|
|
|
/* DO NOT PUT ANY NEW FIELDS HERE - bios array is contiguously alloced*/
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/* bits for r1bio.state */
|
|
|
|
#define R1BIO_Uptodate 0
|
|
|
|
#define R1BIO_IsSync 1
|
2005-06-21 18:17:23 -06:00
|
|
|
#define R1BIO_Degraded 2
|
[PATCH] md: support BIO_RW_BARRIER for md/raid1
We can only accept BARRIER requests if all slaves handle
barriers, and that can, of course, change with time....
So we keep track of whether the whole array seems safe for barriers,
and also whether each individual rdev handles barriers.
We initially assumes barriers are OK.
When writing the superblock we try a barrier, and if that fails, we flag
things for no-barriers. This will usually clear the flags fairly quickly.
If writing the superblock finds that BIO_RW_BARRIER is -ENOTSUPP, we need to
resubmit, so introduce function "md_super_wait" which waits for requests to
finish, and retries ENOTSUPP requests without the barrier flag.
When writing the real raid1, write requests which were BIO_RW_BARRIER but
which aresn't supported need to be retried. So raid1d is enhanced to do this,
and when any bio write completes (i.e. no retry needed) we remove it from the
r1bio, so that devices needing retry are easy to find.
We should hardly ever get -ENOTSUPP errors when writing data to the raid.
It should only happen if:
1/ the device used to support BARRIER, but now doesn't. Few devices
change like this, though raid1 can!
or
2/ the array has no persistent superblock, so there was no opportunity to
pre-test for barriers when writing the superblock.
Signed-off-by: Neil Brown <neilb@cse.unsw.edu.au>
Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-11-08 22:39:34 -07:00
|
|
|
#define R1BIO_BehindIO 3
|
2011-07-27 19:31:48 -06:00
|
|
|
/* Set ReadError on bios that experience a readerror so that
|
|
|
|
* raid1d knows what to do with them.
|
|
|
|
*/
|
|
|
|
#define R1BIO_ReadError 4
|
2005-09-09 17:23:47 -06:00
|
|
|
/* For write-behind requests, we call bi_end_io when
|
|
|
|
* the last non-write-behind device completes, providing
|
|
|
|
* any write was successful. Otherwise we call when
|
|
|
|
* any write-behind write succeeds, otherwise we call
|
|
|
|
* with failure when last write completes (and all failed).
|
|
|
|
* Record that bi_end_io was called with this flag...
|
|
|
|
*/
|
2006-03-23 03:59:22 -07:00
|
|
|
#define R1BIO_Returned 6
|
2011-07-27 19:31:49 -06:00
|
|
|
/* If a write for this request means we can clear some
|
|
|
|
* known-bad-block records, we set this flag
|
|
|
|
*/
|
2011-07-27 19:32:41 -06:00
|
|
|
#define R1BIO_MadeGood 7
|
|
|
|
#define R1BIO_WriteError 8
|
2005-09-09 17:23:47 -06:00
|
|
|
|
2011-10-10 23:47:53 -06:00
|
|
|
extern int md_raid1_congested(struct mddev *mddev, int bits);
|
2011-06-07 16:50:35 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif
|