Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef _RAID5_H |
| 2 | #define _RAID5_H |
| 3 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4 | #include <linux/raid/xor.h> |
Dan Williams | ad283ea | 2009-08-29 19:09:26 -0700 | [diff] [blame] | 5 | #include <linux/dmaengine.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 6 | |
| 7 | /* |
| 8 | * |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 9 | * Each stripe contains one buffer per device. Each buffer can be in |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 10 | * one of a number of states stored in "flags". Changes between |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 11 | * these states happen *almost* exclusively under the protection of the |
| 12 | * STRIPE_ACTIVE flag. Some very specific changes can happen in bi_end_io, and |
| 13 | * these are not protected by STRIPE_ACTIVE. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 14 | * |
| 15 | * The flag bits that are used to represent these states are: |
| 16 | * R5_UPTODATE and R5_LOCKED |
| 17 | * |
| 18 | * State Empty == !UPTODATE, !LOCK |
| 19 | * We have no data, and there is no active request |
| 20 | * State Want == !UPTODATE, LOCK |
| 21 | * A read request is being submitted for this block |
| 22 | * State Dirty == UPTODATE, LOCK |
| 23 | * Some new data is in this buffer, and it is being written out |
| 24 | * State Clean == UPTODATE, !LOCK |
| 25 | * We have valid data which is the same as on disc |
| 26 | * |
| 27 | * The possible state transitions are: |
| 28 | * |
| 29 | * Empty -> Want - on read or write to get old data for parity calc |
NeilBrown | ede7ee8 | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 30 | * Empty -> Dirty - on compute_parity to satisfy write/sync request. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 31 | * Empty -> Clean - on compute_block when computing a block for failed drive |
| 32 | * Want -> Empty - on failed read |
| 33 | * Want -> Clean - on successful completion of read request |
| 34 | * Dirty -> Clean - on successful completion of write request |
| 35 | * Dirty -> Clean - on failed write |
| 36 | * Clean -> Dirty - on compute_parity to satisfy write/sync (RECONSTRUCT or RMW) |
| 37 | * |
| 38 | * The Want->Empty, Want->Clean, Dirty->Clean, transitions |
| 39 | * all happen in b_end_io at interrupt time. |
| 40 | * Each sets the Uptodate bit before releasing the Lock bit. |
| 41 | * This leaves one multi-stage transition: |
| 42 | * Want->Dirty->Clean |
| 43 | * This is safe because thinking that a Clean buffer is actually dirty |
| 44 | * will at worst delay some action, and the stripe will be scheduled |
| 45 | * for attention after the transition is complete. |
| 46 | * |
| 47 | * There is one possibility that is not covered by these states. That |
| 48 | * is if one drive has failed and there is a spare being rebuilt. We |
| 49 | * can't distinguish between a clean block that has been generated |
| 50 | * from parity calculations, and a clean block that has been |
| 51 | * successfully written to the spare ( or to parity when resyncing). |
Michael Opdenacker | aa5e5dc | 2013-09-18 06:00:43 +0200 | [diff] [blame] | 52 | * To distinguish these states we have a stripe bit STRIPE_INSYNC that |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 53 | * is set whenever a write is scheduled to the spare, or to the parity |
| 54 | * disc if there is no spare. A sync request clears this bit, and |
| 55 | * when we find it set with no buffers locked, we know the sync is |
| 56 | * complete. |
| 57 | * |
| 58 | * Buffers for the md device that arrive via make_request are attached |
| 59 | * to the appropriate stripe in one of two lists linked on b_reqnext. |
| 60 | * One list (bh_read) for read requests, one (bh_write) for write. |
| 61 | * There should never be more than one buffer on the two lists |
| 62 | * together, but we are not guaranteed of that so we allow for more. |
| 63 | * |
| 64 | * If a buffer is on the read list when the associated cache buffer is |
| 65 | * Uptodate, the data is copied into the read buffer and it's b_end_io |
| 66 | * routine is called. This may happen in the end_request routine only |
| 67 | * if the buffer has just successfully been read. end_request should |
| 68 | * remove the buffers from the list and then set the Uptodate bit on |
| 69 | * the buffer. Other threads may do this only if they first check |
| 70 | * that the Uptodate bit is set. Once they have checked that they may |
| 71 | * take buffers off the read queue. |
| 72 | * |
| 73 | * When a buffer on the write list is committed for write it is copied |
| 74 | * into the cache buffer, which is then marked dirty, and moved onto a |
| 75 | * third list, the written list (bh_written). Once both the parity |
| 76 | * block and the cached buffer are successfully written, any buffer on |
| 77 | * a written list can be returned with b_end_io. |
| 78 | * |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 79 | * The write list and read list both act as fifos. The read list, |
| 80 | * write list and written list are protected by the device_lock. |
| 81 | * The device_lock is only for list manipulations and will only be |
| 82 | * held for a very short time. It can be claimed from interrupts. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 83 | * |
| 84 | * |
| 85 | * Stripes in the stripe cache can be on one of two lists (or on |
| 86 | * neither). The "inactive_list" contains stripes which are not |
| 87 | * currently being used for any request. They can freely be reused |
| 88 | * for another stripe. The "handle_list" contains stripes that need |
| 89 | * to be handled in some way. Both of these are fifo queues. Each |
| 90 | * stripe is also (potentially) linked to a hash bucket in the hash |
| 91 | * table so that it can be found by sector number. Stripes that are |
| 92 | * not hashed must be on the inactive_list, and will normally be at |
| 93 | * the front. All stripes start life this way. |
| 94 | * |
| 95 | * The inactive_list, handle_list and hash bucket lists are all protected by the |
| 96 | * device_lock. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 97 | * - stripes have a reference counter. If count==0, they are on a list. |
| 98 | * - If a stripe might need handling, STRIPE_HANDLE is set. |
| 99 | * - When refcount reaches zero, then if STRIPE_HANDLE it is put on |
| 100 | * handle_list else inactive_list |
| 101 | * |
| 102 | * This, combined with the fact that STRIPE_HANDLE is only ever |
| 103 | * cleared while a stripe has a non-zero count means that if the |
| 104 | * refcount is 0 and STRIPE_HANDLE is set, then it is on the |
| 105 | * handle_list and if recount is 0 and STRIPE_HANDLE is not set, then |
| 106 | * the stripe is on inactive_list. |
| 107 | * |
| 108 | * The possible transitions are: |
| 109 | * activate an unhashed/inactive stripe (get_active_stripe()) |
| 110 | * lockdev check-hash unlink-stripe cnt++ clean-stripe hash-stripe unlockdev |
| 111 | * activate a hashed, possibly active stripe (get_active_stripe()) |
| 112 | * lockdev check-hash if(!cnt++)unlink-stripe unlockdev |
| 113 | * attach a request to an active stripe (add_stripe_bh()) |
| 114 | * lockdev attach-buffer unlockdev |
| 115 | * handle a stripe (handle_stripe()) |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 116 | * setSTRIPE_ACTIVE, clrSTRIPE_HANDLE ... |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 117 | * (lockdev check-buffers unlockdev) .. |
| 118 | * change-state .. |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 119 | * record io/ops needed clearSTRIPE_ACTIVE schedule io/ops |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 120 | * release an active stripe (release_stripe()) |
| 121 | * lockdev if (!--cnt) { if STRIPE_HANDLE, add to handle_list else add to inactive-list } unlockdev |
| 122 | * |
| 123 | * The refcount counts each thread that have activated the stripe, |
| 124 | * plus raid5d if it is handling it, plus one for each active request |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 125 | * on a cached buffer, and plus one if the stripe is undergoing stripe |
| 126 | * operations. |
| 127 | * |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 128 | * The stripe operations are: |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 129 | * -copying data between the stripe cache and user application buffers |
| 130 | * -computing blocks to save a disk access, or to recover a missing block |
| 131 | * -updating the parity on a write operation (reconstruct write and |
| 132 | * read-modify-write) |
| 133 | * -checking parity correctness |
| 134 | * -running i/o to disk |
| 135 | * These operations are carried out by raid5_run_ops which uses the async_tx |
| 136 | * api to (optionally) offload operations to dedicated hardware engines. |
| 137 | * When requesting an operation handle_stripe sets the pending bit for the |
| 138 | * operation and increments the count. raid5_run_ops is then run whenever |
| 139 | * the count is non-zero. |
| 140 | * There are some critical dependencies between the operations that prevent some |
| 141 | * from being requested while another is in flight. |
| 142 | * 1/ Parity check operations destroy the in cache version of the parity block, |
| 143 | * so we prevent parity dependent operations like writes and compute_blocks |
| 144 | * from starting while a check is in progress. Some dma engines can perform |
| 145 | * the check without damaging the parity block, in these cases the parity |
| 146 | * block is re-marked up to date (assuming the check was successful) and is |
| 147 | * not re-read from disk. |
| 148 | * 2/ When a write operation is requested we immediately lock the affected |
| 149 | * blocks, and mark them as not up to date. This causes new read requests |
| 150 | * to be held off, as well as parity checks and compute block operations. |
| 151 | * 3/ Once a compute block operation has been requested handle_stripe treats |
| 152 | * that block as if it is up to date. raid5_run_ops guaruntees that any |
| 153 | * operation that is dependent on the compute block result is initiated after |
| 154 | * the compute block completes. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 155 | */ |
| 156 | |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 157 | /* |
NeilBrown | f72ffdd | 2014-09-30 14:23:59 +1000 | [diff] [blame] | 158 | * Operations state - intermediate states that are visible outside of |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 159 | * STRIPE_ACTIVE. |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 160 | * In general _idle indicates nothing is running, _run indicates a data |
| 161 | * processing operation is active, and _result means the data processing result |
| 162 | * is stable and can be acted upon. For simple operations like biofill and |
| 163 | * compute that only have an _idle and _run state they are indicated with |
| 164 | * sh->state flags (STRIPE_BIOFILL_RUN and STRIPE_COMPUTE_RUN) |
| 165 | */ |
| 166 | /** |
| 167 | * enum check_states - handles syncing / repairing a stripe |
| 168 | * @check_state_idle - check operations are quiesced |
| 169 | * @check_state_run - check operation is running |
| 170 | * @check_state_result - set outside lock when check result is valid |
| 171 | * @check_state_compute_run - check failed and we are repairing |
| 172 | * @check_state_compute_result - set outside lock when compute result is valid |
| 173 | */ |
| 174 | enum check_states { |
| 175 | check_state_idle = 0, |
Dan Williams | ac6b53b | 2009-07-14 13:40:19 -0700 | [diff] [blame] | 176 | check_state_run, /* xor parity check */ |
| 177 | check_state_run_q, /* q-parity check */ |
| 178 | check_state_run_pq, /* pq dual parity check */ |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 179 | check_state_check_result, |
| 180 | check_state_compute_run, /* parity repair */ |
| 181 | check_state_compute_result, |
| 182 | }; |
| 183 | |
| 184 | /** |
| 185 | * enum reconstruct_states - handles writing or expanding a stripe |
| 186 | */ |
| 187 | enum reconstruct_states { |
| 188 | reconstruct_state_idle = 0, |
Dan Williams | d8ee072 | 2008-06-28 08:32:06 +1000 | [diff] [blame] | 189 | reconstruct_state_prexor_drain_run, /* prexor-write */ |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 190 | reconstruct_state_drain_run, /* write */ |
| 191 | reconstruct_state_run, /* expand */ |
Dan Williams | d8ee072 | 2008-06-28 08:32:06 +1000 | [diff] [blame] | 192 | reconstruct_state_prexor_drain_result, |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 193 | reconstruct_state_drain_result, |
| 194 | reconstruct_state_result, |
| 195 | }; |
| 196 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 197 | struct stripe_head { |
NeilBrown | fccddba | 2006-01-06 00:20:33 -0800 | [diff] [blame] | 198 | struct hlist_node hash; |
NeilBrown | d0dabf7 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 199 | struct list_head lru; /* inactive_list or handle_list */ |
Shaohua Li | 773ca82 | 2013-08-27 17:50:39 +0800 | [diff] [blame] | 200 | struct llist_node release_list; |
NeilBrown | d1688a6 | 2011-10-11 16:49:52 +1100 | [diff] [blame] | 201 | struct r5conf *raid_conf; |
NeilBrown | 86b42c7 | 2009-03-31 15:19:03 +1100 | [diff] [blame] | 202 | short generation; /* increments with every |
| 203 | * reshape */ |
NeilBrown | d0dabf7 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 204 | sector_t sector; /* sector of this row */ |
| 205 | short pd_idx; /* parity disk index */ |
| 206 | short qd_idx; /* 'Q' disk index for raid6 */ |
NeilBrown | 67cc2b8 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 207 | short ddf_layout;/* use DDF ordering to calculate Q */ |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 208 | short hash_lock_index; |
NeilBrown | d0dabf7 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 209 | unsigned long state; /* state flags */ |
| 210 | atomic_t count; /* nr of active thread/requests */ |
NeilBrown | 7262668 | 2005-09-09 16:23:54 -0700 | [diff] [blame] | 211 | int bm_seq; /* sequence number for bitmap flushes */ |
NeilBrown | d0dabf7 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 212 | int disks; /* disks in stripe */ |
shli@kernel.org | 7a87f43 | 2014-12-15 12:57:03 +1100 | [diff] [blame] | 213 | int overwrite_disks; /* total overwrite disks in stripe, |
| 214 | * this is only checked when stripe |
| 215 | * has STRIPE_BATCH_READY |
| 216 | */ |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 217 | enum check_states check_state; |
Dan Williams | 600aa10 | 2008-06-28 08:32:05 +1000 | [diff] [blame] | 218 | enum reconstruct_states reconstruct_state; |
Shaohua Li | b17459c | 2012-07-19 16:01:31 +1000 | [diff] [blame] | 219 | spinlock_t stripe_lock; |
Shaohua Li | 851c30c | 2013-08-28 14:30:16 +0800 | [diff] [blame] | 220 | int cpu; |
Shaohua Li | bfc90cb | 2013-08-29 15:40:32 +0800 | [diff] [blame] | 221 | struct r5worker_group *group; |
shli@kernel.org | 59fc630 | 2014-12-15 12:57:03 +1100 | [diff] [blame] | 222 | |
| 223 | struct stripe_head *batch_head; /* protected by stripe lock */ |
| 224 | spinlock_t batch_lock; /* only header's lock is useful */ |
| 225 | struct list_head batch_list; /* protected by head's batch lock*/ |
Dan Williams | 417b8d4 | 2009-10-16 16:25:22 +1100 | [diff] [blame] | 226 | /** |
| 227 | * struct stripe_operations |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 228 | * @target - STRIPE_OP_COMPUTE_BLK target |
Dan Williams | 417b8d4 | 2009-10-16 16:25:22 +1100 | [diff] [blame] | 229 | * @target2 - 2nd compute target in the raid6 case |
| 230 | * @zero_sum_result - P and Q verification flags |
| 231 | * @request - async service request flags for raid_run_ops |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 232 | */ |
| 233 | struct stripe_operations { |
Dan Williams | ac6b53b | 2009-07-14 13:40:19 -0700 | [diff] [blame] | 234 | int target, target2; |
Dan Williams | ad283ea | 2009-08-29 19:09:26 -0700 | [diff] [blame] | 235 | enum sum_check_flags zero_sum_result; |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 236 | } ops; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 237 | struct r5dev { |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 238 | /* rreq and rvec are used for the replacement device when |
| 239 | * writing data to both devices. |
| 240 | */ |
| 241 | struct bio req, rreq; |
| 242 | struct bio_vec vec, rvec; |
Shaohua Li | d592a99 | 2014-05-21 17:57:44 +0800 | [diff] [blame] | 243 | struct page *page, *orig_page; |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 244 | struct bio *toread, *read, *towrite, *written; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 245 | sector_t sector; /* sector of this page */ |
| 246 | unsigned long flags; |
| 247 | } dev[1]; /* allocated with extra space depending of RAID geometry */ |
| 248 | }; |
Dan Williams | a445685 | 2007-07-09 11:56:43 -0700 | [diff] [blame] | 249 | |
| 250 | /* stripe_head_state - collects and tracks the dynamic state of a stripe_head |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 251 | * for handle_stripe. |
Dan Williams | a445685 | 2007-07-09 11:56:43 -0700 | [diff] [blame] | 252 | */ |
| 253 | struct stripe_head_state { |
NeilBrown | 9a3e110 | 2011-12-23 10:17:53 +1100 | [diff] [blame] | 254 | /* 'syncing' means that we need to read all devices, either |
| 255 | * to check/correct parity, or to reconstruct a missing device. |
| 256 | * 'replacing' means we are replacing one or more drives and |
| 257 | * the source is valid at this point so we don't need to |
| 258 | * read all devices, just the replacement targets. |
| 259 | */ |
| 260 | int syncing, expanding, expanded, replacing; |
Dan Williams | a445685 | 2007-07-09 11:56:43 -0700 | [diff] [blame] | 261 | int locked, uptodate, to_read, to_write, failed, written; |
Dan Williams | b5e98d6 | 2007-01-02 13:52:31 -0700 | [diff] [blame] | 262 | int to_fill, compute, req_compute, non_overwrite; |
NeilBrown | f2b3b44 | 2011-07-26 11:35:19 +1000 | [diff] [blame] | 263 | int failed_num[2]; |
NeilBrown | f2b3b44 | 2011-07-26 11:35:19 +1000 | [diff] [blame] | 264 | int p_failed, q_failed; |
NeilBrown | c5709ef | 2011-07-26 11:35:20 +1000 | [diff] [blame] | 265 | int dec_preread_active; |
| 266 | unsigned long ops_request; |
| 267 | |
| 268 | struct bio *return_bi; |
NeilBrown | 3cb0300 | 2011-10-11 16:45:26 +1100 | [diff] [blame] | 269 | struct md_rdev *blocked_rdev; |
NeilBrown | bc2607f | 2011-07-28 11:39:22 +1000 | [diff] [blame] | 270 | int handle_bad_blocks; |
Dan Williams | a445685 | 2007-07-09 11:56:43 -0700 | [diff] [blame] | 271 | }; |
| 272 | |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 273 | /* Flags for struct r5dev.flags */ |
| 274 | enum r5dev_flags { |
| 275 | R5_UPTODATE, /* page contains current data */ |
| 276 | R5_LOCKED, /* IO has been submitted on "req" */ |
NeilBrown | 977df36 | 2011-12-23 10:17:53 +1100 | [diff] [blame] | 277 | R5_DOUBLE_LOCKED,/* Cannot clear R5_LOCKED until 2 writes complete */ |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 278 | R5_OVERWRITE, /* towrite covers whole page */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 279 | /* and some that are internal to handle_stripe */ |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 280 | R5_Insync, /* rdev && rdev->in_sync at start */ |
| 281 | R5_Wantread, /* want to schedule a read */ |
| 282 | R5_Wantwrite, |
| 283 | R5_Overlap, /* There is a pending overlapping request |
| 284 | * on this block */ |
majianpeng | 3f9e7c1 | 2012-07-31 10:04:21 +1000 | [diff] [blame] | 285 | R5_ReadNoMerge, /* prevent bio from merging in block-layer */ |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 286 | R5_ReadError, /* seen a read error here recently */ |
| 287 | R5_ReWrite, /* have tried to over-write the readerror */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 288 | |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 289 | R5_Expanded, /* This block now has post-expand data */ |
| 290 | R5_Wantcompute, /* compute_block in progress treat as |
| 291 | * uptodate |
| 292 | */ |
| 293 | R5_Wantfill, /* dev->toread contains a bio that needs |
| 294 | * filling |
| 295 | */ |
| 296 | R5_Wantdrain, /* dev->towrite needs to be drained */ |
| 297 | R5_WantFUA, /* Write should be FUA */ |
Shaohua Li | bc0934f | 2012-05-22 13:55:05 +1000 | [diff] [blame] | 298 | R5_SyncIO, /* The IO is sync */ |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 299 | R5_WriteError, /* got a write error - need to record it */ |
| 300 | R5_MadeGood, /* A bad block has been fixed by writing to it */ |
| 301 | R5_ReadRepl, /* Will/did read from replacement rather than orig */ |
| 302 | R5_MadeGoodRepl,/* A bad block on the replacement device has been |
| 303 | * fixed by writing to it */ |
NeilBrown | 9a3e110 | 2011-12-23 10:17:53 +1100 | [diff] [blame] | 304 | R5_NeedReplace, /* This device has a replacement which is not |
| 305 | * up-to-date at this stripe. */ |
| 306 | R5_WantReplace, /* We need to update the replacement, we have read |
| 307 | * data in, and now is a good time to write it out. |
| 308 | */ |
Shaohua Li | 620125f | 2012-10-11 13:49:05 +1100 | [diff] [blame] | 309 | R5_Discard, /* Discard the stripe */ |
Shaohua Li | d592a99 | 2014-05-21 17:57:44 +0800 | [diff] [blame] | 310 | R5_SkipCopy, /* Don't copy data from bio to stripe cache */ |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 311 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 312 | |
| 313 | /* |
| 314 | * Stripe state |
| 315 | */ |
NeilBrown | 83206d6 | 2011-07-26 11:19:49 +1000 | [diff] [blame] | 316 | enum { |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 317 | STRIPE_ACTIVE, |
NeilBrown | 83206d6 | 2011-07-26 11:19:49 +1000 | [diff] [blame] | 318 | STRIPE_HANDLE, |
| 319 | STRIPE_SYNC_REQUESTED, |
| 320 | STRIPE_SYNCING, |
| 321 | STRIPE_INSYNC, |
NeilBrown | f94c0b6 | 2013-07-22 12:57:21 +1000 | [diff] [blame] | 322 | STRIPE_REPLACED, |
NeilBrown | 83206d6 | 2011-07-26 11:19:49 +1000 | [diff] [blame] | 323 | STRIPE_PREREAD_ACTIVE, |
| 324 | STRIPE_DELAYED, |
| 325 | STRIPE_DEGRADED, |
| 326 | STRIPE_BIT_DELAY, |
| 327 | STRIPE_EXPANDING, |
| 328 | STRIPE_EXPAND_SOURCE, |
| 329 | STRIPE_EXPAND_READY, |
| 330 | STRIPE_IO_STARTED, /* do not count towards 'bypass_count' */ |
| 331 | STRIPE_FULL_WRITE, /* all blocks are set to be overwritten */ |
| 332 | STRIPE_BIOFILL_RUN, |
| 333 | STRIPE_COMPUTE_RUN, |
| 334 | STRIPE_OPS_REQ_PENDING, |
Shaohua Li | 8811b59 | 2012-08-02 08:33:00 +1000 | [diff] [blame] | 335 | STRIPE_ON_UNPLUG_LIST, |
NeilBrown | f8dfcff | 2013-03-12 12:18:06 +1100 | [diff] [blame] | 336 | STRIPE_DISCARD, |
Shaohua Li | 773ca82 | 2013-08-27 17:50:39 +0800 | [diff] [blame] | 337 | STRIPE_ON_RELEASE_LIST, |
shli@kernel.org | da41ba6 | 2014-12-15 12:57:03 +1100 | [diff] [blame] | 338 | STRIPE_BATCH_READY, |
shli@kernel.org | 72ac733 | 2014-12-15 12:57:03 +1100 | [diff] [blame] | 339 | STRIPE_BATCH_ERR, |
NeilBrown | d0852df5 | 2015-05-27 08:43:45 +1000 | [diff] [blame] | 340 | STRIPE_BITMAP_PENDING, /* Being added to bitmap, don't add |
| 341 | * to batch yet. |
| 342 | */ |
NeilBrown | 83206d6 | 2011-07-26 11:19:49 +1000 | [diff] [blame] | 343 | }; |
Dan Williams | 417b8d4 | 2009-10-16 16:25:22 +1100 | [diff] [blame] | 344 | |
NeilBrown | 1b956f7 | 2015-05-21 12:40:26 +1000 | [diff] [blame] | 345 | #define STRIPE_EXPAND_SYNC_FLAGS \ |
shli@kernel.org | dabc4ec | 2014-12-15 12:57:04 +1100 | [diff] [blame] | 346 | ((1 << STRIPE_EXPAND_SOURCE) |\ |
| 347 | (1 << STRIPE_EXPAND_READY) |\ |
| 348 | (1 << STRIPE_EXPANDING) |\ |
| 349 | (1 << STRIPE_SYNC_REQUESTED)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 350 | /* |
Dan Williams | ecc65c9 | 2008-06-28 08:31:57 +1000 | [diff] [blame] | 351 | * Operation request flags |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 352 | */ |
NeilBrown | ede7ee8 | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 353 | enum { |
| 354 | STRIPE_OP_BIOFILL, |
| 355 | STRIPE_OP_COMPUTE_BLK, |
| 356 | STRIPE_OP_PREXOR, |
| 357 | STRIPE_OP_BIODRAIN, |
| 358 | STRIPE_OP_RECONSTRUCT, |
| 359 | STRIPE_OP_CHECK, |
| 360 | }; |
Markus Stockhausen | 584acdd | 2014-12-15 12:57:05 +1100 | [diff] [blame] | 361 | |
| 362 | /* |
| 363 | * RAID parity calculation preferences |
| 364 | */ |
| 365 | enum { |
| 366 | PARITY_DISABLE_RMW = 0, |
| 367 | PARITY_ENABLE_RMW, |
Markus Stockhausen | d06f191 | 2014-12-15 12:57:05 +1100 | [diff] [blame] | 368 | PARITY_PREFER_RMW, |
Markus Stockhausen | 584acdd | 2014-12-15 12:57:05 +1100 | [diff] [blame] | 369 | }; |
| 370 | |
| 371 | /* |
| 372 | * Pages requested from set_syndrome_sources() |
| 373 | */ |
| 374 | enum { |
| 375 | SYNDROME_SRC_ALL, |
| 376 | SYNDROME_SRC_WANT_DRAIN, |
| 377 | SYNDROME_SRC_WRITTEN, |
| 378 | }; |
Dan Williams | 91c0092 | 2007-01-02 13:52:30 -0700 | [diff] [blame] | 379 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 380 | * Plugging: |
| 381 | * |
| 382 | * To improve write throughput, we need to delay the handling of some |
| 383 | * stripes until there has been a chance that several write requests |
| 384 | * for the one stripe have all been collected. |
| 385 | * In particular, any write request that would require pre-reading |
| 386 | * is put on a "delayed" queue until there are no stripes currently |
| 387 | * in a pre-read phase. Further, if the "delayed" queue is empty when |
| 388 | * a stripe is put on it then we "plug" the queue and do not process it |
| 389 | * until an unplug call is made. (the unplug_io_fn() is called). |
| 390 | * |
| 391 | * When preread is initiated on a stripe, we set PREREAD_ACTIVE and add |
| 392 | * it to the count of prereading stripes. |
| 393 | * When write is initiated, or the stripe refcnt == 0 (just in case) we |
| 394 | * clear the PREREAD_ACTIVE flag and decrement the count |
NeilBrown | b5c124a | 2006-10-03 01:15:45 -0700 | [diff] [blame] | 395 | * Whenever the 'handle' queue is empty and the device is not plugged, we |
| 396 | * move any strips from delayed to handle and clear the DELAYED flag and set |
| 397 | * PREREAD_ACTIVE. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 398 | * In stripe_handle, if we find pre-reading is necessary, we do it if |
| 399 | * PREREAD_ACTIVE is set, else we set DELAYED which will send it to the delayed queue. |
NeilBrown | c4c1663 | 2011-07-26 11:34:20 +1000 | [diff] [blame] | 400 | * HANDLE gets cleared if stripe_handle leaves nothing locked. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 401 | */ |
Christoph Hellwig | ef740c3 | 2009-03-31 14:27:03 +1100 | [diff] [blame] | 402 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 403 | struct disk_info { |
NeilBrown | 671488c | 2011-12-23 10:17:52 +1100 | [diff] [blame] | 404 | struct md_rdev *rdev, *replacement; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 405 | }; |
| 406 | |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 407 | /* NOTE NR_STRIPE_HASH_LOCKS must remain below 64. |
| 408 | * This is because we sometimes take all the spinlocks |
| 409 | * and creating that much locking depth can cause |
| 410 | * problems. |
| 411 | */ |
| 412 | #define NR_STRIPE_HASH_LOCKS 8 |
| 413 | #define STRIPE_HASH_LOCKS_MASK (NR_STRIPE_HASH_LOCKS - 1) |
| 414 | |
Shaohua Li | 851c30c | 2013-08-28 14:30:16 +0800 | [diff] [blame] | 415 | struct r5worker { |
| 416 | struct work_struct work; |
| 417 | struct r5worker_group *group; |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 418 | struct list_head temp_inactive_list[NR_STRIPE_HASH_LOCKS]; |
Shaohua Li | bfc90cb | 2013-08-29 15:40:32 +0800 | [diff] [blame] | 419 | bool working; |
Shaohua Li | 851c30c | 2013-08-28 14:30:16 +0800 | [diff] [blame] | 420 | }; |
| 421 | |
| 422 | struct r5worker_group { |
| 423 | struct list_head handle_list; |
| 424 | struct r5conf *conf; |
| 425 | struct r5worker *workers; |
Shaohua Li | bfc90cb | 2013-08-29 15:40:32 +0800 | [diff] [blame] | 426 | int stripes_cnt; |
Shaohua Li | 851c30c | 2013-08-28 14:30:16 +0800 | [diff] [blame] | 427 | }; |
| 428 | |
NeilBrown | d1688a6 | 2011-10-11 16:49:52 +1100 | [diff] [blame] | 429 | struct r5conf { |
NeilBrown | fccddba | 2006-01-06 00:20:33 -0800 | [diff] [blame] | 430 | struct hlist_head *stripe_hashtbl; |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 431 | /* only protect corresponding hash list and inactive_list */ |
| 432 | spinlock_t hash_locks[NR_STRIPE_HASH_LOCKS]; |
NeilBrown | fd01b88 | 2011-10-11 16:47:53 +1100 | [diff] [blame] | 433 | struct mddev *mddev; |
Andre Noll | 09c9e5f | 2009-06-18 08:45:55 +1000 | [diff] [blame] | 434 | int chunk_sectors; |
Markus Stockhausen | 584acdd | 2014-12-15 12:57:05 +1100 | [diff] [blame] | 435 | int level, algorithm, rmw_level; |
NeilBrown | 16a53ec | 2006-06-26 00:27:38 -0700 | [diff] [blame] | 436 | int max_degraded; |
NeilBrown | 02c2de8 | 2006-10-03 01:15:47 -0700 | [diff] [blame] | 437 | int raid_disks; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 438 | int max_nr_stripes; |
NeilBrown | edbe83a | 2015-02-26 12:47:56 +1100 | [diff] [blame] | 439 | int min_nr_stripes; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 440 | |
NeilBrown | fef9c61 | 2009-03-31 15:16:46 +1100 | [diff] [blame] | 441 | /* reshape_progress is the leading edge of a 'reshape' |
| 442 | * It has value MaxSector when no reshape is happening |
| 443 | * If delta_disks < 0, it is the last sector we started work on, |
| 444 | * else is it the next sector to work on. |
| 445 | */ |
| 446 | sector_t reshape_progress; |
| 447 | /* reshape_safe is the trailing edge of a reshape. We know that |
| 448 | * before (or after) this address, all reshape has completed. |
| 449 | */ |
| 450 | sector_t reshape_safe; |
NeilBrown | 7ecaa1e | 2006-03-27 01:18:08 -0800 | [diff] [blame] | 451 | int previous_raid_disks; |
Andre Noll | 09c9e5f | 2009-06-18 08:45:55 +1000 | [diff] [blame] | 452 | int prev_chunk_sectors; |
| 453 | int prev_algo; |
NeilBrown | 86b42c7 | 2009-03-31 15:19:03 +1100 | [diff] [blame] | 454 | short generation; /* increments with every reshape */ |
NeilBrown | c46501b | 2013-08-27 15:52:13 +1000 | [diff] [blame] | 455 | seqcount_t gen_lock; /* lock against generation changes */ |
NeilBrown | c8f517c | 2009-03-31 15:28:40 +1100 | [diff] [blame] | 456 | unsigned long reshape_checkpoint; /* Time we last updated |
| 457 | * metadata */ |
NeilBrown | b5254dd | 2012-05-21 09:27:01 +1000 | [diff] [blame] | 458 | long long min_offset_diff; /* minimum difference between |
| 459 | * data_offset and |
| 460 | * new_data_offset across all |
| 461 | * devices. May be negative, |
| 462 | * but is closest to zero. |
| 463 | */ |
NeilBrown | 7ecaa1e | 2006-03-27 01:18:08 -0800 | [diff] [blame] | 464 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 465 | struct list_head handle_list; /* stripes needing handling */ |
Dan Williams | 8b3e6cd | 2008-04-28 02:15:53 -0700 | [diff] [blame] | 466 | struct list_head hold_list; /* preread ready stripes */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 467 | struct list_head delayed_list; /* stripes that have plugged requests */ |
NeilBrown | 7262668 | 2005-09-09 16:23:54 -0700 | [diff] [blame] | 468 | struct list_head bitmap_list; /* stripes delaying awaiting bitmap update */ |
Raz Ben-Jehuda(caro) | 46031f9 | 2006-12-10 02:20:47 -0800 | [diff] [blame] | 469 | struct bio *retry_read_aligned; /* currently retrying aligned bios */ |
| 470 | struct bio *retry_read_aligned_list; /* aligned bios retry list */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 471 | atomic_t preread_active_stripes; /* stripes with scheduled io */ |
Raz Ben-Jehuda(caro) | 46031f9 | 2006-12-10 02:20:47 -0800 | [diff] [blame] | 472 | atomic_t active_aligned_reads; |
Dan Williams | 8b3e6cd | 2008-04-28 02:15:53 -0700 | [diff] [blame] | 473 | atomic_t pending_full_writes; /* full write backlog */ |
| 474 | int bypass_count; /* bypassed prereads */ |
| 475 | int bypass_threshold; /* preread nice */ |
Shaohua Li | d592a99 | 2014-05-21 17:57:44 +0800 | [diff] [blame] | 476 | int skip_copy; /* Don't copy data from bio to stripe cache */ |
Dan Williams | 8b3e6cd | 2008-04-28 02:15:53 -0700 | [diff] [blame] | 477 | struct list_head *last_hold; /* detect hold_list promotions */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 478 | |
NeilBrown | f670557 | 2006-03-27 01:18:11 -0800 | [diff] [blame] | 479 | atomic_t reshape_stripes; /* stripes with pending writes for reshape */ |
NeilBrown | ad01c9e | 2006-03-27 01:18:07 -0800 | [diff] [blame] | 480 | /* unfortunately we need two cache names as we temporarily have |
| 481 | * two caches. |
| 482 | */ |
| 483 | int active_name; |
NeilBrown | f4be6b4 | 2010-06-01 19:37:25 +1000 | [diff] [blame] | 484 | char cache_name[2][32]; |
NeilBrown | 2d5b569 | 2015-07-06 12:49:23 +1000 | [diff] [blame] | 485 | struct kmem_cache *slab_cache; /* for allocating stripes */ |
| 486 | struct mutex cache_size_mutex; /* Protect changes to cache size */ |
NeilBrown | 7262668 | 2005-09-09 16:23:54 -0700 | [diff] [blame] | 487 | |
| 488 | int seq_flush, seq_write; |
| 489 | int quiesce; |
| 490 | |
| 491 | int fullsync; /* set to 1 if a full sync is needed, |
| 492 | * (fresh device added). |
| 493 | * Cleared when a sync completes. |
| 494 | */ |
NeilBrown | 7f0da59 | 2011-07-28 11:39:22 +1000 | [diff] [blame] | 495 | int recovery_disabled; |
Dan Williams | 36d1c64 | 2009-07-14 11:48:22 -0700 | [diff] [blame] | 496 | /* per cpu variables */ |
| 497 | struct raid5_percpu { |
| 498 | struct page *spare_page; /* Used when checking P/Q in raid6 */ |
shli@kernel.org | 46d5b78 | 2014-12-15 12:57:02 +1100 | [diff] [blame] | 499 | struct flex_array *scribble; /* space for constructing buffer |
Dan Williams | d6f38f3 | 2009-07-14 11:50:52 -0700 | [diff] [blame] | 500 | * lists and performing address |
| 501 | * conversions |
| 502 | */ |
Tejun Heo | a29d8b8 | 2010-02-02 14:39:15 +0900 | [diff] [blame] | 503 | } __percpu *percpu; |
Dan Williams | 36d1c64 | 2009-07-14 11:48:22 -0700 | [diff] [blame] | 504 | #ifdef CONFIG_HOTPLUG_CPU |
| 505 | struct notifier_block cpu_notify; |
| 506 | #endif |
NeilBrown | ca65b73 | 2006-01-06 00:20:17 -0800 | [diff] [blame] | 507 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 508 | /* |
| 509 | * Free stripes pool |
| 510 | */ |
| 511 | atomic_t active_stripes; |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 512 | struct list_head inactive_list[NR_STRIPE_HASH_LOCKS]; |
Shaohua Li | 4bda556 | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 513 | atomic_t empty_inactive_list_nr; |
Shaohua Li | 773ca82 | 2013-08-27 17:50:39 +0800 | [diff] [blame] | 514 | struct llist_head released_stripes; |
Yuanhan Liu | b1b4648 | 2015-05-08 18:19:06 +1000 | [diff] [blame] | 515 | wait_queue_head_t wait_for_quiescent; |
Yuanhan Liu | e9e4c37 | 2015-05-08 18:19:07 +1000 | [diff] [blame] | 516 | wait_queue_head_t wait_for_stripe[NR_STRIPE_HASH_LOCKS]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 517 | wait_queue_head_t wait_for_overlap; |
NeilBrown | 5423399 | 2015-02-26 12:21:04 +1100 | [diff] [blame] | 518 | unsigned long cache_state; |
| 519 | #define R5_INACTIVE_BLOCKED 1 /* release of inactive stripes blocked, |
| 520 | * waiting for 25% to be free |
| 521 | */ |
NeilBrown | edbe83a | 2015-02-26 12:47:56 +1100 | [diff] [blame] | 522 | #define R5_ALLOC_MORE 2 /* It might help to allocate another |
| 523 | * stripe. |
| 524 | */ |
| 525 | #define R5_DID_ALLOC 4 /* A stripe was allocated, don't allocate |
| 526 | * more until at least one has been |
| 527 | * released. This avoids flooding |
| 528 | * the cache. |
| 529 | */ |
| 530 | struct shrinker shrinker; |
NeilBrown | ad01c9e | 2006-03-27 01:18:07 -0800 | [diff] [blame] | 531 | int pool_size; /* number of disks in stripeheads in pool */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 532 | spinlock_t device_lock; |
NeilBrown | b55e6bf | 2006-03-27 01:18:06 -0800 | [diff] [blame] | 533 | struct disk_info *disks; |
NeilBrown | 91adb56 | 2009-03-31 14:39:39 +1100 | [diff] [blame] | 534 | |
| 535 | /* When taking over an array from a different personality, we store |
| 536 | * the new thread here until we fully activate the array. |
| 537 | */ |
NeilBrown | 2b8bf34 | 2011-10-11 16:48:23 +1100 | [diff] [blame] | 538 | struct md_thread *thread; |
Shaohua Li | 566c09c | 2013-11-14 15:16:17 +1100 | [diff] [blame] | 539 | struct list_head temp_inactive_list[NR_STRIPE_HASH_LOCKS]; |
Shaohua Li | 851c30c | 2013-08-28 14:30:16 +0800 | [diff] [blame] | 540 | struct r5worker_group *worker_groups; |
| 541 | int group_cnt; |
| 542 | int worker_cnt_per_group; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 543 | }; |
| 544 | |
NeilBrown | 5423399 | 2015-02-26 12:21:04 +1100 | [diff] [blame] | 545 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 546 | /* |
| 547 | * Our supported algorithms |
| 548 | */ |
NeilBrown | 99c0fb5 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 549 | #define ALGORITHM_LEFT_ASYMMETRIC 0 /* Rotating Parity N with Data Restart */ |
| 550 | #define ALGORITHM_RIGHT_ASYMMETRIC 1 /* Rotating Parity 0 with Data Restart */ |
| 551 | #define ALGORITHM_LEFT_SYMMETRIC 2 /* Rotating Parity N with Data Continuation */ |
| 552 | #define ALGORITHM_RIGHT_SYMMETRIC 3 /* Rotating Parity 0 with Data Continuation */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 553 | |
NeilBrown | 99c0fb5 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 554 | /* Define non-rotating (raid4) algorithms. These allow |
| 555 | * conversion of raid4 to raid5. |
| 556 | */ |
| 557 | #define ALGORITHM_PARITY_0 4 /* P or P,Q are initial devices */ |
| 558 | #define ALGORITHM_PARITY_N 5 /* P or P,Q are final devices. */ |
| 559 | |
| 560 | /* DDF RAID6 layouts differ from md/raid6 layouts in two ways. |
| 561 | * Firstly, the exact positioning of the parity block is slightly |
| 562 | * different between the 'LEFT_*' modes of md and the "_N_*" modes |
| 563 | * of DDF. |
| 564 | * Secondly, or order of datablocks over which the Q syndrome is computed |
| 565 | * is different. |
| 566 | * Consequently we have different layouts for DDF/raid6 than md/raid6. |
| 567 | * These layouts are from the DDFv1.2 spec. |
| 568 | * Interestingly DDFv1.2-Errata-A does not specify N_CONTINUE but |
| 569 | * leaves RLQ=3 as 'Vendor Specific' |
| 570 | */ |
| 571 | |
| 572 | #define ALGORITHM_ROTATING_ZERO_RESTART 8 /* DDF PRL=6 RLQ=1 */ |
| 573 | #define ALGORITHM_ROTATING_N_RESTART 9 /* DDF PRL=6 RLQ=2 */ |
| 574 | #define ALGORITHM_ROTATING_N_CONTINUE 10 /*DDF PRL=6 RLQ=3 */ |
| 575 | |
NeilBrown | 99c0fb5 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 576 | /* For every RAID5 algorithm we define a RAID6 algorithm |
| 577 | * with exactly the same layout for data and parity, and |
| 578 | * with the Q block always on the last device (N-1). |
| 579 | * This allows trivial conversion from RAID5 to RAID6 |
| 580 | */ |
| 581 | #define ALGORITHM_LEFT_ASYMMETRIC_6 16 |
| 582 | #define ALGORITHM_RIGHT_ASYMMETRIC_6 17 |
| 583 | #define ALGORITHM_LEFT_SYMMETRIC_6 18 |
| 584 | #define ALGORITHM_RIGHT_SYMMETRIC_6 19 |
| 585 | #define ALGORITHM_PARITY_0_6 20 |
| 586 | #define ALGORITHM_PARITY_N_6 ALGORITHM_PARITY_N |
| 587 | |
| 588 | static inline int algorithm_valid_raid5(int layout) |
| 589 | { |
| 590 | return (layout >= 0) && |
| 591 | (layout <= 5); |
| 592 | } |
| 593 | static inline int algorithm_valid_raid6(int layout) |
| 594 | { |
| 595 | return (layout >= 0 && layout <= 5) |
| 596 | || |
NeilBrown | e4424fe | 2009-10-16 16:27:34 +1100 | [diff] [blame] | 597 | (layout >= 8 && layout <= 10) |
NeilBrown | 99c0fb5 | 2009-03-31 14:39:38 +1100 | [diff] [blame] | 598 | || |
| 599 | (layout >= 16 && layout <= 20); |
| 600 | } |
| 601 | |
| 602 | static inline int algorithm_is_DDF(int layout) |
| 603 | { |
| 604 | return layout >= 8 && layout <= 10; |
| 605 | } |
NeilBrown | 11d8a6e | 2010-07-26 11:57:07 +1000 | [diff] [blame] | 606 | |
NeilBrown | d1688a6 | 2011-10-11 16:49:52 +1100 | [diff] [blame] | 607 | extern void md_raid5_kick_device(struct r5conf *conf); |
NeilBrown | fd01b88 | 2011-10-11 16:47:53 +1100 | [diff] [blame] | 608 | extern int raid5_set_cache_size(struct mddev *mddev, int size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 609 | #endif |