]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | #ifndef _RAID5_H |
2 | #define _RAID5_H | |
3 | ||
1da177e4 | 4 | #include <linux/raid/xor.h> |
ad283ea4 | 5 | #include <linux/dmaengine.h> |
1da177e4 LT |
6 | |
7 | /* | |
8 | * | |
c4c1663b | 9 | * Each stripe contains one buffer per device. Each buffer can be in |
1da177e4 | 10 | * one of a number of states stored in "flags". Changes between |
c4c1663b N |
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. | |
1da177e4 LT |
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 | |
ede7ee8b | 30 | * Empty -> Dirty - on compute_parity to satisfy write/sync request. |
1da177e4 LT |
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). | |
aa5e5dc2 | 52 | * To distinguish these states we have a stripe bit STRIPE_INSYNC that |
1da177e4 LT |
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 | * | |
c4c1663b N |
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. | |
1da177e4 LT |
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. | |
1da177e4 LT |
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()) | |
c4c1663b | 116 | * setSTRIPE_ACTIVE, clrSTRIPE_HANDLE ... |
91c00924 DW |
117 | * (lockdev check-buffers unlockdev) .. |
118 | * change-state .. | |
c4c1663b | 119 | * record io/ops needed clearSTRIPE_ACTIVE schedule io/ops |
1da177e4 LT |
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 | |
91c00924 DW |
125 | * on a cached buffer, and plus one if the stripe is undergoing stripe |
126 | * operations. | |
127 | * | |
c4c1663b | 128 | * The stripe operations are: |
91c00924 DW |
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. | |
1da177e4 LT |
155 | */ |
156 | ||
ecc65c9b | 157 | /* |
f72ffdd6 | 158 | * Operations state - intermediate states that are visible outside of |
c4c1663b | 159 | * STRIPE_ACTIVE. |
ecc65c9b DW |
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, | |
ac6b53b6 DW |
176 | check_state_run, /* xor parity check */ |
177 | check_state_run_q, /* q-parity check */ | |
178 | check_state_run_pq, /* pq dual parity check */ | |
ecc65c9b DW |
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, | |
d8ee0728 | 189 | reconstruct_state_prexor_drain_run, /* prexor-write */ |
ecc65c9b DW |
190 | reconstruct_state_drain_run, /* write */ |
191 | reconstruct_state_run, /* expand */ | |
d8ee0728 | 192 | reconstruct_state_prexor_drain_result, |
ecc65c9b DW |
193 | reconstruct_state_drain_result, |
194 | reconstruct_state_result, | |
195 | }; | |
196 | ||
1da177e4 | 197 | struct stripe_head { |
fccddba0 | 198 | struct hlist_node hash; |
d0dabf7e | 199 | struct list_head lru; /* inactive_list or handle_list */ |
773ca82f | 200 | struct llist_node release_list; |
d1688a6d | 201 | struct r5conf *raid_conf; |
86b42c71 N |
202 | short generation; /* increments with every |
203 | * reshape */ | |
d0dabf7e N |
204 | sector_t sector; /* sector of this row */ |
205 | short pd_idx; /* parity disk index */ | |
206 | short qd_idx; /* 'Q' disk index for raid6 */ | |
67cc2b81 | 207 | short ddf_layout;/* use DDF ordering to calculate Q */ |
566c09c5 | 208 | short hash_lock_index; |
d0dabf7e N |
209 | unsigned long state; /* state flags */ |
210 | atomic_t count; /* nr of active thread/requests */ | |
72626685 | 211 | int bm_seq; /* sequence number for bitmap flushes */ |
d0dabf7e | 212 | int disks; /* disks in stripe */ |
7a87f434 | 213 | int overwrite_disks; /* total overwrite disks in stripe, |
214 | * this is only checked when stripe | |
215 | * has STRIPE_BATCH_READY | |
216 | */ | |
ecc65c9b | 217 | enum check_states check_state; |
600aa109 | 218 | enum reconstruct_states reconstruct_state; |
b17459c0 | 219 | spinlock_t stripe_lock; |
851c30c9 | 220 | int cpu; |
bfc90cb0 | 221 | struct r5worker_group *group; |
59fc630b | 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*/ | |
f6bed0ef SL |
226 | |
227 | struct r5l_io_unit *log_io; | |
228 | struct list_head log_list; | |
a39f7afd SL |
229 | sector_t log_start; /* first meta block on the journal */ |
230 | struct list_head r5c; /* for r5c_cache->stripe_in_journal */ | |
417b8d4a DW |
231 | /** |
232 | * struct stripe_operations | |
91c00924 | 233 | * @target - STRIPE_OP_COMPUTE_BLK target |
417b8d4a DW |
234 | * @target2 - 2nd compute target in the raid6 case |
235 | * @zero_sum_result - P and Q verification flags | |
236 | * @request - async service request flags for raid_run_ops | |
91c00924 DW |
237 | */ |
238 | struct stripe_operations { | |
ac6b53b6 | 239 | int target, target2; |
ad283ea4 | 240 | enum sum_check_flags zero_sum_result; |
91c00924 | 241 | } ops; |
1da177e4 | 242 | struct r5dev { |
671488cc N |
243 | /* rreq and rvec are used for the replacement device when |
244 | * writing data to both devices. | |
245 | */ | |
246 | struct bio req, rreq; | |
247 | struct bio_vec vec, rvec; | |
d592a996 | 248 | struct page *page, *orig_page; |
91c00924 | 249 | struct bio *toread, *read, *towrite, *written; |
1da177e4 LT |
250 | sector_t sector; /* sector of this page */ |
251 | unsigned long flags; | |
f6bed0ef | 252 | u32 log_checksum; |
1da177e4 LT |
253 | } dev[1]; /* allocated with extra space depending of RAID geometry */ |
254 | }; | |
a4456856 DW |
255 | |
256 | /* stripe_head_state - collects and tracks the dynamic state of a stripe_head | |
c4c1663b | 257 | * for handle_stripe. |
a4456856 DW |
258 | */ |
259 | struct stripe_head_state { | |
9a3e1101 N |
260 | /* 'syncing' means that we need to read all devices, either |
261 | * to check/correct parity, or to reconstruct a missing device. | |
262 | * 'replacing' means we are replacing one or more drives and | |
263 | * the source is valid at this point so we don't need to | |
264 | * read all devices, just the replacement targets. | |
265 | */ | |
266 | int syncing, expanding, expanded, replacing; | |
a4456856 | 267 | int locked, uptodate, to_read, to_write, failed, written; |
b5e98d65 | 268 | int to_fill, compute, req_compute, non_overwrite; |
1e6d690b | 269 | int injournal, just_cached; |
f2b3b44d | 270 | int failed_num[2]; |
f2b3b44d | 271 | int p_failed, q_failed; |
c5709ef6 N |
272 | int dec_preread_active; |
273 | unsigned long ops_request; | |
274 | ||
34a6f80e | 275 | struct bio_list return_bi; |
3cb03002 | 276 | struct md_rdev *blocked_rdev; |
bc2607f3 | 277 | int handle_bad_blocks; |
6e74a9cf | 278 | int log_failed; |
a4456856 DW |
279 | }; |
280 | ||
671488cc N |
281 | /* Flags for struct r5dev.flags */ |
282 | enum r5dev_flags { | |
283 | R5_UPTODATE, /* page contains current data */ | |
284 | R5_LOCKED, /* IO has been submitted on "req" */ | |
977df362 | 285 | R5_DOUBLE_LOCKED,/* Cannot clear R5_LOCKED until 2 writes complete */ |
671488cc | 286 | R5_OVERWRITE, /* towrite covers whole page */ |
1da177e4 | 287 | /* and some that are internal to handle_stripe */ |
671488cc N |
288 | R5_Insync, /* rdev && rdev->in_sync at start */ |
289 | R5_Wantread, /* want to schedule a read */ | |
290 | R5_Wantwrite, | |
291 | R5_Overlap, /* There is a pending overlapping request | |
292 | * on this block */ | |
3f9e7c14 | 293 | R5_ReadNoMerge, /* prevent bio from merging in block-layer */ |
671488cc N |
294 | R5_ReadError, /* seen a read error here recently */ |
295 | R5_ReWrite, /* have tried to over-write the readerror */ | |
1da177e4 | 296 | |
671488cc N |
297 | R5_Expanded, /* This block now has post-expand data */ |
298 | R5_Wantcompute, /* compute_block in progress treat as | |
299 | * uptodate | |
300 | */ | |
301 | R5_Wantfill, /* dev->toread contains a bio that needs | |
302 | * filling | |
303 | */ | |
304 | R5_Wantdrain, /* dev->towrite needs to be drained */ | |
305 | R5_WantFUA, /* Write should be FUA */ | |
bc0934f0 | 306 | R5_SyncIO, /* The IO is sync */ |
671488cc N |
307 | R5_WriteError, /* got a write error - need to record it */ |
308 | R5_MadeGood, /* A bad block has been fixed by writing to it */ | |
309 | R5_ReadRepl, /* Will/did read from replacement rather than orig */ | |
310 | R5_MadeGoodRepl,/* A bad block on the replacement device has been | |
311 | * fixed by writing to it */ | |
9a3e1101 N |
312 | R5_NeedReplace, /* This device has a replacement which is not |
313 | * up-to-date at this stripe. */ | |
314 | R5_WantReplace, /* We need to update the replacement, we have read | |
315 | * data in, and now is a good time to write it out. | |
316 | */ | |
620125f2 | 317 | R5_Discard, /* Discard the stripe */ |
d592a996 | 318 | R5_SkipCopy, /* Don't copy data from bio to stripe cache */ |
2ded3703 SL |
319 | R5_InJournal, /* data being written is in the journal device. |
320 | * if R5_InJournal is set for parity pd_idx, all the | |
321 | * data and parity being written are in the journal | |
322 | * device | |
323 | */ | |
671488cc | 324 | }; |
1da177e4 LT |
325 | |
326 | /* | |
327 | * Stripe state | |
328 | */ | |
83206d66 | 329 | enum { |
c4c1663b | 330 | STRIPE_ACTIVE, |
83206d66 N |
331 | STRIPE_HANDLE, |
332 | STRIPE_SYNC_REQUESTED, | |
333 | STRIPE_SYNCING, | |
334 | STRIPE_INSYNC, | |
f94c0b66 | 335 | STRIPE_REPLACED, |
83206d66 N |
336 | STRIPE_PREREAD_ACTIVE, |
337 | STRIPE_DELAYED, | |
338 | STRIPE_DEGRADED, | |
339 | STRIPE_BIT_DELAY, | |
340 | STRIPE_EXPANDING, | |
341 | STRIPE_EXPAND_SOURCE, | |
342 | STRIPE_EXPAND_READY, | |
343 | STRIPE_IO_STARTED, /* do not count towards 'bypass_count' */ | |
344 | STRIPE_FULL_WRITE, /* all blocks are set to be overwritten */ | |
345 | STRIPE_BIOFILL_RUN, | |
346 | STRIPE_COMPUTE_RUN, | |
347 | STRIPE_OPS_REQ_PENDING, | |
8811b596 | 348 | STRIPE_ON_UNPLUG_LIST, |
f8dfcffd | 349 | STRIPE_DISCARD, |
773ca82f | 350 | STRIPE_ON_RELEASE_LIST, |
da41ba65 | 351 | STRIPE_BATCH_READY, |
72ac7330 | 352 | STRIPE_BATCH_ERR, |
d0852df5 N |
353 | STRIPE_BITMAP_PENDING, /* Being added to bitmap, don't add |
354 | * to batch yet. | |
355 | */ | |
2ded3703 SL |
356 | STRIPE_LOG_TRAPPED, /* trapped into log (see raid5-cache.c) |
357 | * this bit is used in two scenarios: | |
358 | * | |
359 | * 1. write-out phase | |
360 | * set in first entry of r5l_write_stripe | |
361 | * clear in second entry of r5l_write_stripe | |
362 | * used to bypass logic in handle_stripe | |
363 | * | |
364 | * 2. caching phase | |
365 | * set in r5c_try_caching_write() | |
366 | * clear when journal write is done | |
367 | * used to initiate r5c_cache_data() | |
368 | * also used to bypass logic in handle_stripe | |
369 | */ | |
370 | STRIPE_R5C_CACHING, /* the stripe is in caching phase | |
371 | * see more detail in the raid5-cache.c | |
372 | */ | |
1e6d690b SL |
373 | STRIPE_R5C_PARTIAL_STRIPE, /* in r5c cache (to-be/being handled or |
374 | * in conf->r5c_partial_stripe_list) | |
375 | */ | |
376 | STRIPE_R5C_FULL_STRIPE, /* in r5c cache (to-be/being handled or | |
377 | * in conf->r5c_full_stripe_list) | |
378 | */ | |
3bddb7f8 | 379 | STRIPE_R5C_PREFLUSH, /* need to flush journal device */ |
83206d66 | 380 | }; |
417b8d4a | 381 | |
1b956f7a | 382 | #define STRIPE_EXPAND_SYNC_FLAGS \ |
dabc4ec6 | 383 | ((1 << STRIPE_EXPAND_SOURCE) |\ |
384 | (1 << STRIPE_EXPAND_READY) |\ | |
385 | (1 << STRIPE_EXPANDING) |\ | |
386 | (1 << STRIPE_SYNC_REQUESTED)) | |
91c00924 | 387 | /* |
ecc65c9b | 388 | * Operation request flags |
91c00924 | 389 | */ |
ede7ee8b N |
390 | enum { |
391 | STRIPE_OP_BIOFILL, | |
392 | STRIPE_OP_COMPUTE_BLK, | |
393 | STRIPE_OP_PREXOR, | |
394 | STRIPE_OP_BIODRAIN, | |
395 | STRIPE_OP_RECONSTRUCT, | |
396 | STRIPE_OP_CHECK, | |
397 | }; | |
584acdd4 MS |
398 | |
399 | /* | |
400 | * RAID parity calculation preferences | |
401 | */ | |
402 | enum { | |
403 | PARITY_DISABLE_RMW = 0, | |
404 | PARITY_ENABLE_RMW, | |
d06f191f | 405 | PARITY_PREFER_RMW, |
584acdd4 MS |
406 | }; |
407 | ||
408 | /* | |
409 | * Pages requested from set_syndrome_sources() | |
410 | */ | |
411 | enum { | |
412 | SYNDROME_SRC_ALL, | |
413 | SYNDROME_SRC_WANT_DRAIN, | |
414 | SYNDROME_SRC_WRITTEN, | |
415 | }; | |
1da177e4 LT |
416 | /* |
417 | * Plugging: | |
418 | * | |
419 | * To improve write throughput, we need to delay the handling of some | |
420 | * stripes until there has been a chance that several write requests | |
421 | * for the one stripe have all been collected. | |
422 | * In particular, any write request that would require pre-reading | |
423 | * is put on a "delayed" queue until there are no stripes currently | |
424 | * in a pre-read phase. Further, if the "delayed" queue is empty when | |
425 | * a stripe is put on it then we "plug" the queue and do not process it | |
426 | * until an unplug call is made. (the unplug_io_fn() is called). | |
427 | * | |
428 | * When preread is initiated on a stripe, we set PREREAD_ACTIVE and add | |
429 | * it to the count of prereading stripes. | |
430 | * When write is initiated, or the stripe refcnt == 0 (just in case) we | |
431 | * clear the PREREAD_ACTIVE flag and decrement the count | |
b5c124af N |
432 | * Whenever the 'handle' queue is empty and the device is not plugged, we |
433 | * move any strips from delayed to handle and clear the DELAYED flag and set | |
434 | * PREREAD_ACTIVE. | |
1da177e4 LT |
435 | * In stripe_handle, if we find pre-reading is necessary, we do it if |
436 | * PREREAD_ACTIVE is set, else we set DELAYED which will send it to the delayed queue. | |
c4c1663b | 437 | * HANDLE gets cleared if stripe_handle leaves nothing locked. |
1da177e4 | 438 | */ |
ef740c37 | 439 | |
1da177e4 | 440 | struct disk_info { |
671488cc | 441 | struct md_rdev *rdev, *replacement; |
1da177e4 LT |
442 | }; |
443 | ||
937621c3 SL |
444 | /* |
445 | * Stripe cache | |
446 | */ | |
447 | ||
448 | #define NR_STRIPES 256 | |
449 | #define STRIPE_SIZE PAGE_SIZE | |
450 | #define STRIPE_SHIFT (PAGE_SHIFT - 9) | |
451 | #define STRIPE_SECTORS (STRIPE_SIZE>>9) | |
452 | #define IO_THRESHOLD 1 | |
453 | #define BYPASS_THRESHOLD 1 | |
454 | #define NR_HASH (PAGE_SIZE / sizeof(struct hlist_head)) | |
455 | #define HASH_MASK (NR_HASH - 1) | |
456 | #define MAX_STRIPE_BATCH 8 | |
457 | ||
458 | /* bio's attached to a stripe+device for I/O are linked together in bi_sector | |
459 | * order without overlap. There may be several bio's per stripe+device, and | |
460 | * a bio could span several devices. | |
461 | * When walking this list for a particular stripe+device, we must never proceed | |
462 | * beyond a bio that extends past this device, as the next bio might no longer | |
463 | * be valid. | |
464 | * This function is used to determine the 'next' bio in the list, given the | |
465 | * sector of the current stripe+device | |
466 | */ | |
467 | static inline struct bio *r5_next_bio(struct bio *bio, sector_t sector) | |
468 | { | |
469 | int sectors = bio_sectors(bio); | |
470 | ||
471 | if (bio->bi_iter.bi_sector + sectors < sector + STRIPE_SECTORS) | |
472 | return bio->bi_next; | |
473 | else | |
474 | return NULL; | |
475 | } | |
476 | ||
477 | /* | |
478 | * We maintain a biased count of active stripes in the bottom 16 bits of | |
479 | * bi_phys_segments, and a count of processed stripes in the upper 16 bits | |
480 | */ | |
481 | static inline int raid5_bi_processed_stripes(struct bio *bio) | |
482 | { | |
483 | atomic_t *segments = (atomic_t *)&bio->bi_phys_segments; | |
484 | ||
485 | return (atomic_read(segments) >> 16) & 0xffff; | |
486 | } | |
487 | ||
488 | static inline int raid5_dec_bi_active_stripes(struct bio *bio) | |
489 | { | |
490 | atomic_t *segments = (atomic_t *)&bio->bi_phys_segments; | |
491 | ||
492 | return atomic_sub_return(1, segments) & 0xffff; | |
493 | } | |
494 | ||
495 | static inline void raid5_inc_bi_active_stripes(struct bio *bio) | |
496 | { | |
497 | atomic_t *segments = (atomic_t *)&bio->bi_phys_segments; | |
498 | ||
499 | atomic_inc(segments); | |
500 | } | |
501 | ||
502 | static inline void raid5_set_bi_processed_stripes(struct bio *bio, | |
503 | unsigned int cnt) | |
504 | { | |
505 | atomic_t *segments = (atomic_t *)&bio->bi_phys_segments; | |
506 | int old, new; | |
507 | ||
508 | do { | |
509 | old = atomic_read(segments); | |
510 | new = (old & 0xffff) | (cnt << 16); | |
511 | } while (atomic_cmpxchg(segments, old, new) != old); | |
512 | } | |
513 | ||
514 | static inline void raid5_set_bi_stripes(struct bio *bio, unsigned int cnt) | |
515 | { | |
516 | atomic_t *segments = (atomic_t *)&bio->bi_phys_segments; | |
517 | ||
518 | atomic_set(segments, cnt); | |
519 | } | |
520 | ||
566c09c5 SL |
521 | /* NOTE NR_STRIPE_HASH_LOCKS must remain below 64. |
522 | * This is because we sometimes take all the spinlocks | |
523 | * and creating that much locking depth can cause | |
524 | * problems. | |
525 | */ | |
526 | #define NR_STRIPE_HASH_LOCKS 8 | |
527 | #define STRIPE_HASH_LOCKS_MASK (NR_STRIPE_HASH_LOCKS - 1) | |
528 | ||
851c30c9 SL |
529 | struct r5worker { |
530 | struct work_struct work; | |
531 | struct r5worker_group *group; | |
566c09c5 | 532 | struct list_head temp_inactive_list[NR_STRIPE_HASH_LOCKS]; |
bfc90cb0 | 533 | bool working; |
851c30c9 SL |
534 | }; |
535 | ||
536 | struct r5worker_group { | |
537 | struct list_head handle_list; | |
538 | struct r5conf *conf; | |
539 | struct r5worker *workers; | |
bfc90cb0 | 540 | int stripes_cnt; |
851c30c9 SL |
541 | }; |
542 | ||
a39f7afd SL |
543 | enum r5_cache_state { |
544 | R5_INACTIVE_BLOCKED, /* release of inactive stripes blocked, | |
545 | * waiting for 25% to be free | |
546 | */ | |
547 | R5_ALLOC_MORE, /* It might help to allocate another | |
548 | * stripe. | |
549 | */ | |
550 | R5_DID_ALLOC, /* A stripe was allocated, don't allocate | |
551 | * more until at least one has been | |
552 | * released. This avoids flooding | |
553 | * the cache. | |
554 | */ | |
555 | R5C_LOG_TIGHT, /* log device space tight, need to | |
556 | * prioritize stripes at last_checkpoint | |
557 | */ | |
558 | R5C_LOG_CRITICAL, /* log device is running out of space, | |
559 | * only process stripes that are already | |
560 | * occupying the log | |
561 | */ | |
562 | }; | |
563 | ||
d1688a6d | 564 | struct r5conf { |
fccddba0 | 565 | struct hlist_head *stripe_hashtbl; |
566c09c5 SL |
566 | /* only protect corresponding hash list and inactive_list */ |
567 | spinlock_t hash_locks[NR_STRIPE_HASH_LOCKS]; | |
fd01b88c | 568 | struct mddev *mddev; |
09c9e5fa | 569 | int chunk_sectors; |
584acdd4 | 570 | int level, algorithm, rmw_level; |
16a53ecc | 571 | int max_degraded; |
02c2de8c | 572 | int raid_disks; |
1da177e4 | 573 | int max_nr_stripes; |
edbe83ab | 574 | int min_nr_stripes; |
1da177e4 | 575 | |
fef9c61f N |
576 | /* reshape_progress is the leading edge of a 'reshape' |
577 | * It has value MaxSector when no reshape is happening | |
578 | * If delta_disks < 0, it is the last sector we started work on, | |
579 | * else is it the next sector to work on. | |
580 | */ | |
581 | sector_t reshape_progress; | |
582 | /* reshape_safe is the trailing edge of a reshape. We know that | |
583 | * before (or after) this address, all reshape has completed. | |
584 | */ | |
585 | sector_t reshape_safe; | |
7ecaa1e6 | 586 | int previous_raid_disks; |
09c9e5fa AN |
587 | int prev_chunk_sectors; |
588 | int prev_algo; | |
86b42c71 | 589 | short generation; /* increments with every reshape */ |
c46501b2 | 590 | seqcount_t gen_lock; /* lock against generation changes */ |
c8f517c4 N |
591 | unsigned long reshape_checkpoint; /* Time we last updated |
592 | * metadata */ | |
b5254dd5 N |
593 | long long min_offset_diff; /* minimum difference between |
594 | * data_offset and | |
595 | * new_data_offset across all | |
596 | * devices. May be negative, | |
597 | * but is closest to zero. | |
598 | */ | |
7ecaa1e6 | 599 | |
1da177e4 | 600 | struct list_head handle_list; /* stripes needing handling */ |
8b3e6cdc | 601 | struct list_head hold_list; /* preread ready stripes */ |
1da177e4 | 602 | struct list_head delayed_list; /* stripes that have plugged requests */ |
72626685 | 603 | struct list_head bitmap_list; /* stripes delaying awaiting bitmap update */ |
46031f9a RBJ |
604 | struct bio *retry_read_aligned; /* currently retrying aligned bios */ |
605 | struct bio *retry_read_aligned_list; /* aligned bios retry list */ | |
1da177e4 | 606 | atomic_t preread_active_stripes; /* stripes with scheduled io */ |
46031f9a | 607 | atomic_t active_aligned_reads; |
8b3e6cdc DW |
608 | atomic_t pending_full_writes; /* full write backlog */ |
609 | int bypass_count; /* bypassed prereads */ | |
610 | int bypass_threshold; /* preread nice */ | |
d592a996 | 611 | int skip_copy; /* Don't copy data from bio to stripe cache */ |
8b3e6cdc | 612 | struct list_head *last_hold; /* detect hold_list promotions */ |
1da177e4 | 613 | |
c3cce6cd N |
614 | /* bios to have bi_end_io called after metadata is synced */ |
615 | struct bio_list return_bi; | |
616 | ||
f6705578 | 617 | atomic_t reshape_stripes; /* stripes with pending writes for reshape */ |
ad01c9e3 N |
618 | /* unfortunately we need two cache names as we temporarily have |
619 | * two caches. | |
620 | */ | |
621 | int active_name; | |
f4be6b43 | 622 | char cache_name[2][32]; |
2d5b569b N |
623 | struct kmem_cache *slab_cache; /* for allocating stripes */ |
624 | struct mutex cache_size_mutex; /* Protect changes to cache size */ | |
72626685 N |
625 | |
626 | int seq_flush, seq_write; | |
627 | int quiesce; | |
628 | ||
629 | int fullsync; /* set to 1 if a full sync is needed, | |
630 | * (fresh device added). | |
631 | * Cleared when a sync completes. | |
632 | */ | |
7f0da59b | 633 | int recovery_disabled; |
36d1c647 DW |
634 | /* per cpu variables */ |
635 | struct raid5_percpu { | |
636 | struct page *spare_page; /* Used when checking P/Q in raid6 */ | |
46d5b785 | 637 | struct flex_array *scribble; /* space for constructing buffer |
d6f38f31 DW |
638 | * lists and performing address |
639 | * conversions | |
640 | */ | |
a29d8b8e | 641 | } __percpu *percpu; |
27a353c0 SL |
642 | int scribble_disks; |
643 | int scribble_sectors; | |
29c6d1bb | 644 | struct hlist_node node; |
ca65b73b | 645 | |
1da177e4 LT |
646 | /* |
647 | * Free stripes pool | |
648 | */ | |
649 | atomic_t active_stripes; | |
566c09c5 | 650 | struct list_head inactive_list[NR_STRIPE_HASH_LOCKS]; |
1e6d690b SL |
651 | |
652 | atomic_t r5c_cached_full_stripes; | |
653 | struct list_head r5c_full_stripe_list; | |
654 | atomic_t r5c_cached_partial_stripes; | |
655 | struct list_head r5c_partial_stripe_list; | |
656 | ||
4bda556a | 657 | atomic_t empty_inactive_list_nr; |
773ca82f | 658 | struct llist_head released_stripes; |
b1b46486 | 659 | wait_queue_head_t wait_for_quiescent; |
6ab2a4b8 | 660 | wait_queue_head_t wait_for_stripe; |
1da177e4 | 661 | wait_queue_head_t wait_for_overlap; |
5423399a | 662 | unsigned long cache_state; |
edbe83ab | 663 | struct shrinker shrinker; |
ad01c9e3 | 664 | int pool_size; /* number of disks in stripeheads in pool */ |
1da177e4 | 665 | spinlock_t device_lock; |
b55e6bfc | 666 | struct disk_info *disks; |
91adb564 N |
667 | |
668 | /* When taking over an array from a different personality, we store | |
669 | * the new thread here until we fully activate the array. | |
670 | */ | |
2b8bf345 | 671 | struct md_thread *thread; |
566c09c5 | 672 | struct list_head temp_inactive_list[NR_STRIPE_HASH_LOCKS]; |
851c30c9 SL |
673 | struct r5worker_group *worker_groups; |
674 | int group_cnt; | |
675 | int worker_cnt_per_group; | |
f6bed0ef | 676 | struct r5l_log *log; |
1da177e4 LT |
677 | }; |
678 | ||
5423399a | 679 | |
1da177e4 LT |
680 | /* |
681 | * Our supported algorithms | |
682 | */ | |
99c0fb5f N |
683 | #define ALGORITHM_LEFT_ASYMMETRIC 0 /* Rotating Parity N with Data Restart */ |
684 | #define ALGORITHM_RIGHT_ASYMMETRIC 1 /* Rotating Parity 0 with Data Restart */ | |
685 | #define ALGORITHM_LEFT_SYMMETRIC 2 /* Rotating Parity N with Data Continuation */ | |
686 | #define ALGORITHM_RIGHT_SYMMETRIC 3 /* Rotating Parity 0 with Data Continuation */ | |
1da177e4 | 687 | |
99c0fb5f N |
688 | /* Define non-rotating (raid4) algorithms. These allow |
689 | * conversion of raid4 to raid5. | |
690 | */ | |
691 | #define ALGORITHM_PARITY_0 4 /* P or P,Q are initial devices */ | |
692 | #define ALGORITHM_PARITY_N 5 /* P or P,Q are final devices. */ | |
693 | ||
694 | /* DDF RAID6 layouts differ from md/raid6 layouts in two ways. | |
695 | * Firstly, the exact positioning of the parity block is slightly | |
696 | * different between the 'LEFT_*' modes of md and the "_N_*" modes | |
697 | * of DDF. | |
698 | * Secondly, or order of datablocks over which the Q syndrome is computed | |
699 | * is different. | |
700 | * Consequently we have different layouts for DDF/raid6 than md/raid6. | |
701 | * These layouts are from the DDFv1.2 spec. | |
702 | * Interestingly DDFv1.2-Errata-A does not specify N_CONTINUE but | |
703 | * leaves RLQ=3 as 'Vendor Specific' | |
704 | */ | |
705 | ||
706 | #define ALGORITHM_ROTATING_ZERO_RESTART 8 /* DDF PRL=6 RLQ=1 */ | |
707 | #define ALGORITHM_ROTATING_N_RESTART 9 /* DDF PRL=6 RLQ=2 */ | |
708 | #define ALGORITHM_ROTATING_N_CONTINUE 10 /*DDF PRL=6 RLQ=3 */ | |
709 | ||
99c0fb5f N |
710 | /* For every RAID5 algorithm we define a RAID6 algorithm |
711 | * with exactly the same layout for data and parity, and | |
712 | * with the Q block always on the last device (N-1). | |
713 | * This allows trivial conversion from RAID5 to RAID6 | |
714 | */ | |
715 | #define ALGORITHM_LEFT_ASYMMETRIC_6 16 | |
716 | #define ALGORITHM_RIGHT_ASYMMETRIC_6 17 | |
717 | #define ALGORITHM_LEFT_SYMMETRIC_6 18 | |
718 | #define ALGORITHM_RIGHT_SYMMETRIC_6 19 | |
719 | #define ALGORITHM_PARITY_0_6 20 | |
720 | #define ALGORITHM_PARITY_N_6 ALGORITHM_PARITY_N | |
721 | ||
722 | static inline int algorithm_valid_raid5(int layout) | |
723 | { | |
724 | return (layout >= 0) && | |
725 | (layout <= 5); | |
726 | } | |
727 | static inline int algorithm_valid_raid6(int layout) | |
728 | { | |
729 | return (layout >= 0 && layout <= 5) | |
730 | || | |
e4424fee | 731 | (layout >= 8 && layout <= 10) |
99c0fb5f N |
732 | || |
733 | (layout >= 16 && layout <= 20); | |
734 | } | |
735 | ||
736 | static inline int algorithm_is_DDF(int layout) | |
737 | { | |
738 | return layout >= 8 && layout <= 10; | |
739 | } | |
11d8a6e3 | 740 | |
d1688a6d | 741 | extern void md_raid5_kick_device(struct r5conf *conf); |
fd01b88c | 742 | extern int raid5_set_cache_size(struct mddev *mddev, int size); |
6d036f7d SL |
743 | extern sector_t raid5_compute_blocknr(struct stripe_head *sh, int i, int previous); |
744 | extern void raid5_release_stripe(struct stripe_head *sh); | |
745 | extern sector_t raid5_compute_sector(struct r5conf *conf, sector_t r_sector, | |
746 | int previous, int *dd_idx, | |
747 | struct stripe_head *sh); | |
748 | extern struct stripe_head * | |
749 | raid5_get_active_stripe(struct r5conf *conf, sector_t sector, | |
750 | int previous, int noblock, int noquiesce); | |
f6bed0ef SL |
751 | extern int r5l_init_log(struct r5conf *conf, struct md_rdev *rdev); |
752 | extern void r5l_exit_log(struct r5l_log *log); | |
753 | extern int r5l_write_stripe(struct r5l_log *log, struct stripe_head *head_sh); | |
754 | extern void r5l_write_stripe_run(struct r5l_log *log); | |
0576b1c6 SL |
755 | extern void r5l_flush_stripe_to_raid(struct r5l_log *log); |
756 | extern void r5l_stripe_write_finished(struct stripe_head *sh); | |
828cbe98 | 757 | extern int r5l_handle_flush_request(struct r5l_log *log, struct bio *bio); |
e6c033f7 | 758 | extern void r5l_quiesce(struct r5l_log *log, int state); |
6e74a9cf | 759 | extern bool r5l_log_disk_error(struct r5conf *conf); |
2ded3703 SL |
760 | extern bool r5c_is_writeback(struct r5l_log *log); |
761 | extern int | |
762 | r5c_try_caching_write(struct r5conf *conf, struct stripe_head *sh, | |
763 | struct stripe_head_state *s, int disks); | |
764 | extern void | |
765 | r5c_finish_stripe_write_out(struct r5conf *conf, struct stripe_head *sh, | |
766 | struct stripe_head_state *s); | |
1e6d690b | 767 | extern void r5c_release_extra_page(struct stripe_head *sh); |
a39f7afd | 768 | extern void r5l_wake_reclaim(struct r5l_log *log, sector_t space); |
1e6d690b SL |
769 | extern void r5c_handle_cached_data_endio(struct r5conf *conf, |
770 | struct stripe_head *sh, int disks, struct bio_list *return_bi); | |
771 | extern int r5c_cache_data(struct r5l_log *log, struct stripe_head *sh, | |
772 | struct stripe_head_state *s); | |
a39f7afd SL |
773 | extern void r5c_make_stripe_write_out(struct stripe_head *sh); |
774 | extern void r5c_flush_cache(struct r5conf *conf, int num); | |
775 | extern void r5c_check_stripe_cache_usage(struct r5conf *conf); | |
776 | extern void r5c_check_cached_full_stripe(struct r5conf *conf); | |
2c7da14b | 777 | extern struct md_sysfs_entry r5c_journal_mode; |
1da177e4 | 778 | #endif |