| blob | fc6607acb6e4734f12c4dbed23bf9e82ab5816ec |
1 /*
2 * raid10.c : Multiple Devices driver for Linux
3 *
4 * Copyright (C) 2000-2004 Neil Brown
5 *
6 * RAID-10 support for md.
7 *
8 * Base on code in raid1.c. See raid1.c for futher copyright information.
9 *
10 *
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; either version 2, or (at your option)
14 * any later version.
15 *
16 * You should have received a copy of the GNU General Public License
17 * (for example /usr/src/linux/COPYING); if not, write to the Free
18 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 */
22 #include <linux/raid/raid10.h>
23 #include <linux/raid/bitmap.h>
25 /*
26 * RAID10 provides a combination of RAID0 and RAID1 functionality.
27 * The layout of data is defined by
28 * chunk_size
29 * raid_disks
30 * near_copies (stored in low byte of layout)
31 * far_copies (stored in second byte of layout)
32 * far_offset (stored in bit 16 of layout )
33 *
34 * The data to be stored is divided into chunks using chunksize.
35 * Each device is divided into far_copies sections.
36 * In each section, chunks are laid out in a style similar to raid0, but
37 * near_copies copies of each chunk is stored (each on a different drive).
38 * The starting device for each section is offset near_copies from the starting
39 * device of the previous section.
40 * Thus they are (near_copies*far_copies) of each chunk, and each is on a different
41 * drive.
42 * near_copies and far_copies must be at least one, and their product is at most
43 * raid_disks.
44 *
45 * If far_offset is true, then the far_copies are handled a bit differently.
46 * The copies are still in different stripes, but instead of be very far apart
47 * on disk, there are adjacent stripes.
48 */
50 /*
51 * Number of guaranteed r10bios in case of extreme VM load:
52 */
53 #define NR_RAID10_BIOS 256
61 {
66 /* allocate a r10bio with room for raid_disks entries in the bios array */
72 }
75 {
77 }
79 #define RESYNC_BLOCK_SIZE (64*1024)
80 //#define RESYNC_BLOCK_SIZE PAGE_SIZE
81 #define RESYNC_SECTORS (RESYNC_BLOCK_SIZE >> 9)
82 #define RESYNC_PAGES ((RESYNC_BLOCK_SIZE + PAGE_SIZE-1) / PAGE_SIZE)
83 #define RESYNC_WINDOW (2048*1024)
85 /*
86 * When performing a resync, we need to read and compare, so
87 * we need as many pages are there are copies.
88 * When performing a recovery, we need 2 bios, one for read,
89 * one for write (we recover only one drive per r10buf)
90 *
91 */
93 {
105 }
109 else
112 /*
113 * Allocate bios.
114 */
120 }
121 /*
122 * Allocate RESYNC_PAGES data pages and attach them
123 * where needed.
124 */
133 }
134 }
138 out_free_pages:
145 out_free_bio:
150 }
153 {
165 }
167 }
168 }
170 }
173 {
181 }
182 }
185 {
188 /*
189 * Wake up any possible resync thread that waits for the device
190 * to go idle.
191 */
196 }
199 {
205 }
208 {
219 }
221 /*
222 * raid_end_bio_io() is called when we have finished servicing a mirrored
223 * operation and are ready to return a success/failure code to the buffer
224 * cache layer.
225 */
227 {
233 }
235 /*
236 * Update disk head position estimator based on IRQ completion info.
237 */
239 {
244 }
247 {
256 /*
257 * this branch is our 'one mirror IO has finished' event handler:
258 */
262 /*
263 * Set R10BIO_Uptodate in our master bio, so that
264 * we will return a good error code to the higher
265 * levels even if IO on some other mirrored buffer fails.
266 *
267 * The 'master' represents the composite IO operation to
268 * user-side. So if something waits for IO, then it will
269 * wait for the 'master' bio.
270 */
274 /*
275 * oops, read error:
276 */
282 }
285 }
288 {
299 /*
300 * this branch is our 'one mirror IO has finished' event handler:
301 */
304 /* an I/O failed, we can't clear the bitmap */
307 /*
308 * Set R10BIO_Uptodate in our master bio, so that
309 * we will return a good error code for to the higher
310 * levels even if IO on some other mirrored buffer fails.
311 *
312 * The 'master' represents the composite IO operation to
313 * user-side. So if something waits for IO, then it will
314 * wait for the 'master' bio.
315 */
320 /*
321 *
322 * Let's see if all mirrored write operations have finished
323 * already.
324 */
326 /* clear the bitmap if all writes complete successfully */
333 }
336 }
339 /*
340 * RAID10 layout manager
341 * Aswell as the chunksize and raid_disks count, there are two
342 * parameters: near_copies and far_copies.
343 * near_copies * far_copies must be <= raid_disks.
344 * Normally one of these will be 1.
345 * If both are 1, we get raid0.
346 * If near_copies == raid_disks, we get raid1.
347 *
348 * Chunks are layed out in raid0 style with near_copies copies of the
349 * first chunk, followed by near_copies copies of the next chunk and
350 * so on.
351 * If far_copies > 1, then after 1/far_copies of the array has been assigned
352 * as described above, we start again with a device offset of near_copies.
353 * So we effectively have another copy of the whole array further down all
354 * the drives, but with blocks on different drives.
355 * With this layout, and block is never stored twice on the one device.
356 *
357 * raid10_find_phys finds the sector offset of a given virtual sector
358 * on each device that it is on.
359 *
360 * raid10_find_virt does the reverse mapping, from a device and a
361 * sector offset to a virtual address
362 */
365 {
367 sector_t sector;
368 sector_t chunk;
369 sector_t stripe;
374 /* now calculate first sector/dev */
386 /* and calculate all the others */
392 slot++;
401 slot++;
402 }
403 dev++;
407 }
408 }
410 }
413 {
429 else
431 }
433 }
437 }
439 /**
440 * raid10_mergeable_bvec -- tell bio layer if a two requests can be merged
441 * @q: request queue
442 * @bio: the buffer head that's been built up so far
443 * @biovec: the request that could be merged to it.
444 *
445 * Return amount of bytes we can accept at this offset
446 * If near_copies == raid_disk, there are no striping issues,
447 * but in that case, the function isn't called at all.
448 */
451 {
462 else
464 }
466 /*
467 * This routine returns the disk from which the requested read should
468 * be done. There is a per-array 'next expected sequential IO' sector
469 * number - if this matches on the next IO then we use the last disk.
470 * There is also a per-disk 'last know head position' sector that is
471 * maintained from IRQ contexts, both the normal and the resync IO
472 * completion handlers update this position correctly. If there is no
473 * perfect sequential match then we pick the disk whose head is closest.
474 *
475 * If there are 2 mirrors in the same 2 devices, performance degrades
476 * because position is mirror, not device based.
477 *
478 * The rdev for the device selected will have nr_pending incremented.
479 */
481 /*
482 * FIXME: possibly should rethink readbalancing and do it differently
483 * depending on near_copies / far_copies geometry.
484 */
486 {
495 /*
496 * Check if we can balance. We can balance on the whole
497 * device if no resync is going on (recovery is ok), or below
498 * the resync window. We take the first readable disk when
499 * above the resync window.
500 */
503 /* make sure that disk is operational */
510 slot++;
515 }
517 }
519 }
522 /* make sure the disk is operational */
528 slot ++;
532 }
534 }
540 /* Find the disk whose head is closest */
551 /* This optimisation is debatable, and completely destroys
552 * sequential read speed for 'far copies' arrays. So only
553 * keep it for 'near' arrays, and review those later.
554 */
559 }
566 }
567 }
569 rb_out:
571 /* conf->next_seq_sect = this_sector + sectors;*/
575 else
580 }
583 {
601 }
602 }
604 }
607 {
612 }
615 {
627 }
628 }
631 }
634 /* Barriers....
635 * Sometimes we need to suspend IO while we do something else,
636 * either some resync/recovery, or reconfigure the array.
637 * To do this we raise a 'barrier'.
638 * The 'barrier' is a counter that can be raised multiple times
639 * to count how many activities are happening which preclude
640 * normal IO.
641 * We can only raise the barrier if there is no pending IO.
642 * i.e. if nr_pending == 0.
643 * We choose only to raise the barrier if no-one is waiting for the
644 * barrier to go down. This means that as soon as an IO request
645 * is ready, no other operations which require a barrier will start
646 * until the IO request has had a chance.
647 *
648 * So: regular IO calls 'wait_barrier'. When that returns there
649 * is no backgroup IO happening, It must arrange to call
650 * allow_barrier when it has finished its IO.
651 * backgroup IO calls must call raise_barrier. Once that returns
652 * there is no normal IO happeing. It must arrange to call
653 * lower_barrier when the particular background IO completes.
654 */
655 #define RESYNC_DEPTH 32
658 {
662 /* Wait until no block IO is waiting (unless 'force') */
667 /* block any new IO from starting */
670 /* No wait for all pending IO to complete */
677 }
680 {
686 }
689 {
697 }
700 }
703 {
709 }
712 {
713 /* stop syncio and normal IO and wait for everything to
714 * go quiet.
715 * We increment barrier and nr_waiting, and then
716 * wait until barrier+nr_pending match nr_queued+2
717 */
726 }
729 {
730 /* reverse the effect of the freeze */
736 }
739 {
755 }
757 /* If this request crosses a chunk boundary, we need to
758 * split it. This will only happen for 1 PAGE (or less) requests.
759 */
764 /* Sanity check -- queue functions should prevent this happening */
768 /* This is a one page bio that upper layers
769 * refuse to split for us, so we need to split it.
770 */
780 bad_map:
787 }
791 /*
792 * Register the new request and wait if the reconstruction
793 * thread has put up a bar for new requests.
794 * Continue immediately if no resync is active currently.
795 */
811 /*
812 * read balancing logic:
813 */
819 }
835 }
837 /*
838 * WRITE:
839 */
840 /* first select target devices under spinlock and
841 * inc refcount on their rdev. Record them by setting
842 * bios[x] to bio
843 */
856 }
857 }
881 }
884 /* the array is dead */
888 }
900 }
903 {
914 else
916 }
924 }
927 {
931 /*
932 * If it is not operational, then we have already marked it as dead
933 * else if it is the last working disks, ignore the error, let the
934 * next level up know.
935 * else mark the drive as failed
936 */
939 /*
940 * Don't fail the drive, just return an IO error.
941 * The test should really be more sophisticated than
942 * "working_disks == 1", but it isn't critical, and
943 * can wait until we do more sophisticated "is the drive
944 * really dead" tests...
945 */
952 /*
953 * if recovery is running, make sure it aborts.
954 */
956 }
962 }
965 {
973 }
985 }
986 }
989 {
995 }
997 /* check if there are enough drives for
998 * every block to appear on atleast one
999 */
1001 {
1009 cnt++;
1011 }
1016 }
1019 {
1024 /*
1025 * Find all non-in_sync disks within the RAID10 configuration
1026 * and mark them in_sync
1027 */
1037 }
1038 }
1042 }
1046 {
1053 /* only hot-add to in-sync arrays, as recovery is
1054 * very different from resync
1055 */
1063 else
1070 /* as we don't honour merge_bvec_fn, we must never risk
1071 * violating it, so limit ->max_sector to one PAGE, as
1072 * a one page request is never in violation.
1073 */
1085 }
1089 }
1092 {
1105 }
1109 /* lost the race, try later */
1112 }
1113 }
1114 abort:
1118 }
1122 {
1142 }
1144 /* for reconstruct, we always reschedule after a read.
1145 * for resync, only after all reads
1146 */
1149 /* we have read all the blocks,
1150 * do the comparison in process context in raid10d
1151 */
1153 }
1155 }
1158 {
1176 /* the primary of several recovery bios */
1184 }
1185 }
1187 }
1189 /*
1190 * Note: sync and recover and handled very differently for raid10
1191 * This code is for resync.
1192 * For resync, we read through virtual addresses and read all blocks.
1193 * If there is any error, we schedule a write. The lowest numbered
1194 * drive is authoritative.
1195 * However requests come for physical address, so we need to map.
1196 * For every physical address there are raid_disks/copies virtual addresses,
1197 * which is always are least one, but is not necessarly an integer.
1198 * This means that a physical address can span multiple chunks, so we may
1199 * have to submit multiple io requests for a single sync request.
1200 */
1201 /*
1202 * We check if all blocks are in-sync and only write to blocks that
1203 * aren't in sync
1204 */
1206 {
1213 /* find the first device with a block */
1224 /* now find blocks with errors */
1236 /* We know that the bi_io_vec layout is the same for
1237 * both 'first' and 'i', so we just compare them.
1238 * All vec entries are PAGE_SIZE;
1239 */
1243 PAGE_SIZE))
1248 }
1250 /* Don't fix anything. */
1252 /* Ok, we need to write this bio
1253 * First we need to fixup bv_offset, bv_len and
1254 * bi_vecs, as the read request might have corrupted these
1255 */
1276 PAGE_SIZE);
1277 }
1288 }
1290 done:
1294 }
1295 }
1297 /*
1298 * Now for the recovery code.
1299 * Recovery happens across physical sectors.
1300 * We recover all non-is_sync drives by finding the virtual address of
1301 * each, and then choose a working drive that also has that virt address.
1302 * There is a separate r10_bio for each non-in_sync drive.
1303 * Only the first two slots are in use. The first for reading,
1304 * The second for writing.
1305 *
1306 */
1309 {
1315 /* move the pages across to the second bio
1316 * and submit the write request
1317 */
1324 }
1331 else
1333 }
1336 /*
1337 * This is a kernel thread which:
1338 *
1339 * 1. Retries failed read operations on working mirrors.
1340 * 2. Updates the raid superblock when problems encounter.
1341 * 3. Performs writes following reads for array synchronising.
1342 */
1345 {
1375 }
1376 sl++;
1383 /* Cannot read from anywhere -- bye bye array */
1387 }
1390 /* write it back and re-read */
1396 sl--;
1409 /* Well, this device is dead */
1413 }
1414 }
1420 sl--;
1432 /* Well, this device is dead */
1434 else
1436 "raid10:%s: read error corrected"
1445 }
1446 }
1451 }
1452 }
1455 {
1474 /* flush any pending bitmap writes to disk before proceeding w/ I/O */
1482 }
1486 }
1505 /* we got a read error. Maybe the drive is bad. Maybe just
1506 * the block and we can fix it.
1507 * We freeze all other IO, and try reading the block from
1508 * other devices. When we find one, we re-write
1509 * and check it that fixes the read error.
1510 * This is all done synchronously while the array is
1511 * frozen.
1512 */
1517 }
1549 }
1550 }
1551 }
1555 }
1559 {
1569 }
1571 /*
1572 * perform a "sync" on one "block"
1573 *
1574 * We need to make sure that no normal I/O request - particularly write
1575 * requests - conflict with active sync requests.
1576 *
1577 * This is achieved by tracking pending requests and a 'barrier' concept
1578 * that can be installed to exclude normal IO requests.
1579 *
1580 * Resync and recovery are handled very differently.
1581 * We differentiate by looking at MD_RECOVERY_SYNC in mddev->recovery.
1582 *
1583 * For resync, we iterate over virtual addresses, read all copies,
1584 * and update if there are differences. If only one copy is live,
1585 * skip it.
1586 * For recovery, we iterate over physical addresses, read a good
1587 * value for each non-in_sync drive, and over-write.
1588 *
1589 * So, for recovery we may have several outstanding complex requests for a
1590 * given address, one for each out-of-sync device. We model this by allocating
1591 * a number of r10_bio structures, one for each out-of-sync device.
1592 * As we setup these structures, we collect all bio's together into a list
1593 * which we then process collectively to add pages, and then process again
1594 * to pass to generic_make_request.
1595 *
1596 * The r10_bio structures are linked using a borrowed master_bio pointer.
1597 * This link is counted in ->remaining. When the r10_bio that points to NULL
1598 * has its remaining count decremented to 0, the whole complex operation
1599 * is complete.
1600 *
1601 */
1604 {
1621 skipped:
1626 /* If we aborted, we need to abort the
1627 * sync on the 'current' bitmap chucks (there can
1628 * be several when recovering multiple devices).
1629 * as we may have started syncing it but not finished.
1630 * We can find the current address in
1631 * mddev->curr_resync, but for recovery,
1632 * we need to convert that to several
1633 * virtual addresses.
1634 */
1640 sector_t sect =
1644 }
1652 }
1654 /* if there has been nothing to do on any drive,
1655 * then there is nothing to do at all..
1656 */
1659 }
1661 /* make sure whole request will fit in a chunk - if chunks
1662 * are meaningful
1663 */
1667 /*
1668 * If there is non-resync activity waiting for us then
1669 * put in a delay to throttle resync.
1670 */
1674 /* Again, very different code for resync and recovery.
1675 * Both must result in an r10bio with a list of bios that
1676 * have bi_end_io, bi_sector, bi_bdev set,
1677 * and bi_private set to the r10bio.
1678 * For recovery, we may actually create several r10bios
1679 * with 2 bios in each, that correspond to the bios in the main one.
1680 * In this case, the subordinate r10bios link back through a
1681 * borrowed master_bio pointer, and the counter in the master
1682 * includes a ref from each subordinate.
1683 */
1684 /* First, we decide what to do and set ->bi_end_io
1685 * To end_sync_read if we want to read, and
1686 * end_sync_write if we will want to write.
1687 */
1691 /* recovery... the complicated one */
1699 /* want to reconstruct this device */
1703 /* Unless we are doing a full sync, we only need
1704 * to recover the block if it is set in the bitmap
1705 */
1712 /* yep, skip the sync_blocks here, but don't assume
1713 * that there will never be anything to do here
1714 */
1717 }
1731 /* Need to check if this section will still be
1732 * degraded
1733 */
1740 }
1741 }
1749 /* This is where we read from */
1761 /* and we write to 'i' */
1781 }
1782 }
1784 /* Cannot recover, so abort the recovery */
1791 }
1792 }
1799 }
1801 }
1803 /* resync. Schedule a read for every block at this virt offset */
1809 /* We can skip this block */
1812 }
1846 count++;
1847 }
1854 }
1858 }
1859 }
1871 }
1887 /* stop here */
1891 /* remove last page from this bio */
1895 }
1897 }
1899 }
1903 bio_full:
1917 }
1918 }
1921 /* pretend they weren't skipped, it makes
1922 * no important difference in this case
1923 */
1927 giveup:
1928 /* There is nowhere to write, so all non-sync
1929 * drives must be failed, so try the next chunk...
1930 */
1931 {
1934 chunks_skipped ++;
1937 }
1938 }
1941 {
1953 }
1963 }
1964 /*
1965 * copy the already verified devices into our private RAID10
1966 * bookkeeping area. [whatever we allocate in run(),
1967 * should be freed in stop()]
1968 */
1975 }
1977 GFP_KERNEL);
1982 }
2000 /* 'size' is now the number of chunks in the array */
2001 /* calculate "used chunks per device" in 'stride' */
2004 /* We need to round up when dividing by raid_disks to
2005 * get the stride size.
2006 */
2013 else
2023 }
2036 /* as we don't honour merge_bvec_fn, we must never risk
2037 * violating it, so limit ->max_sector to one PAGE, as
2038 * a one page request is never in violation.
2039 */
2045 }
2052 /* need to check that every block has at least one working mirror */
2057 }
2068 }
2069 }
2078 }
2084 /*
2085 * Ok, everything is just fine now
2086 */
2094 /* Calculate max read-ahead size.
2095 * We need to readahead at least twice a whole stripe....
2096 * maybe...
2097 */
2098 {
2103 }
2109 out_free_conf:
2116 out:
2118 }
2121 {
2133 }
2136 {
2146 }
2150 else
2153 }
2154 }
2157 {
2171 };
2174 {
2176 }
2179 {
2181 }