]>
Commit | Line | Data |
---|---|---|
b411b363 PR |
1 | /* |
2 | drbd_req.c | |
3 | ||
4 | This file is part of DRBD by Philipp Reisner and Lars Ellenberg. | |
5 | ||
6 | Copyright (C) 2001-2008, LINBIT Information Technologies GmbH. | |
7 | Copyright (C) 1999-2008, Philipp Reisner <philipp.reisner@linbit.com>. | |
8 | Copyright (C) 2002-2008, Lars Ellenberg <lars.ellenberg@linbit.com>. | |
9 | ||
10 | drbd is free software; you can redistribute it and/or modify | |
11 | it under the terms of the GNU General Public License as published by | |
12 | the Free Software Foundation; either version 2, or (at your option) | |
13 | any later version. | |
14 | ||
15 | drbd is distributed in the hope that it will be useful, | |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
19 | ||
20 | You should have received a copy of the GNU General Public License | |
21 | along with drbd; see the file COPYING. If not, write to | |
22 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. | |
23 | ||
24 | */ | |
25 | ||
b411b363 PR |
26 | #include <linux/module.h> |
27 | ||
28 | #include <linux/slab.h> | |
29 | #include <linux/drbd.h> | |
30 | #include "drbd_int.h" | |
b411b363 PR |
31 | #include "drbd_req.h" |
32 | ||
33 | ||
34 | /* Update disk stats at start of I/O request */ | |
35 | static void _drbd_start_io_acct(struct drbd_conf *mdev, struct drbd_request *req, struct bio *bio) | |
36 | { | |
37 | const int rw = bio_data_dir(bio); | |
38 | int cpu; | |
39 | cpu = part_stat_lock(); | |
40 | part_stat_inc(cpu, &mdev->vdisk->part0, ios[rw]); | |
41 | part_stat_add(cpu, &mdev->vdisk->part0, sectors[rw], bio_sectors(bio)); | |
753c8913 | 42 | part_inc_in_flight(&mdev->vdisk->part0, rw); |
b411b363 | 43 | part_stat_unlock(); |
b411b363 PR |
44 | } |
45 | ||
46 | /* Update disk stats when completing request upwards */ | |
47 | static void _drbd_end_io_acct(struct drbd_conf *mdev, struct drbd_request *req) | |
48 | { | |
49 | int rw = bio_data_dir(req->master_bio); | |
50 | unsigned long duration = jiffies - req->start_time; | |
51 | int cpu; | |
52 | cpu = part_stat_lock(); | |
53 | part_stat_add(cpu, &mdev->vdisk->part0, ticks[rw], duration); | |
54 | part_round_stats(cpu, &mdev->vdisk->part0); | |
753c8913 | 55 | part_dec_in_flight(&mdev->vdisk->part0, rw); |
b411b363 | 56 | part_stat_unlock(); |
b411b363 PR |
57 | } |
58 | ||
59 | static void _req_is_done(struct drbd_conf *mdev, struct drbd_request *req, const int rw) | |
60 | { | |
61 | const unsigned long s = req->rq_state; | |
288f422e PR |
62 | |
63 | /* remove it from the transfer log. | |
64 | * well, only if it had been there in the first | |
65 | * place... if it had not (local only or conflicting | |
66 | * and never sent), it should still be "empty" as | |
67 | * initialized in drbd_req_new(), so we can list_del() it | |
68 | * here unconditionally */ | |
69 | list_del(&req->tl_requests); | |
70 | ||
b411b363 PR |
71 | /* if it was a write, we may have to set the corresponding |
72 | * bit(s) out-of-sync first. If it had a local part, we need to | |
73 | * release the reference to the activity log. */ | |
74 | if (rw == WRITE) { | |
b411b363 PR |
75 | /* Set out-of-sync unless both OK flags are set |
76 | * (local only or remote failed). | |
77 | * Other places where we set out-of-sync: | |
78 | * READ with local io-error */ | |
79 | if (!(s & RQ_NET_OK) || !(s & RQ_LOCAL_OK)) | |
80 | drbd_set_out_of_sync(mdev, req->sector, req->size); | |
81 | ||
82 | if ((s & RQ_NET_OK) && (s & RQ_LOCAL_OK) && (s & RQ_NET_SIS)) | |
83 | drbd_set_in_sync(mdev, req->sector, req->size); | |
84 | ||
85 | /* one might be tempted to move the drbd_al_complete_io | |
86 | * to the local io completion callback drbd_endio_pri. | |
87 | * but, if this was a mirror write, we may only | |
88 | * drbd_al_complete_io after this is RQ_NET_DONE, | |
89 | * otherwise the extent could be dropped from the al | |
90 | * before it has actually been written on the peer. | |
91 | * if we crash before our peer knows about the request, | |
92 | * but after the extent has been dropped from the al, | |
93 | * we would forget to resync the corresponding extent. | |
94 | */ | |
95 | if (s & RQ_LOCAL_MASK) { | |
96 | if (get_ldev_if_state(mdev, D_FAILED)) { | |
0778286a PR |
97 | if (s & RQ_IN_ACT_LOG) |
98 | drbd_al_complete_io(mdev, req->sector); | |
b411b363 PR |
99 | put_ldev(mdev); |
100 | } else if (__ratelimit(&drbd_ratelimit_state)) { | |
101 | dev_warn(DEV, "Should have called drbd_al_complete_io(, %llu), " | |
102 | "but my Disk seems to have failed :(\n", | |
103 | (unsigned long long) req->sector); | |
104 | } | |
105 | } | |
106 | } | |
107 | ||
32fa7e91 | 108 | drbd_req_free(req); |
b411b363 PR |
109 | } |
110 | ||
111 | static void queue_barrier(struct drbd_conf *mdev) | |
112 | { | |
113 | struct drbd_tl_epoch *b; | |
114 | ||
115 | /* We are within the req_lock. Once we queued the barrier for sending, | |
116 | * we set the CREATE_BARRIER bit. It is cleared as soon as a new | |
117 | * barrier/epoch object is added. This is the only place this bit is | |
118 | * set. It indicates that the barrier for this epoch is already queued, | |
119 | * and no new epoch has been created yet. */ | |
120 | if (test_bit(CREATE_BARRIER, &mdev->flags)) | |
121 | return; | |
122 | ||
123 | b = mdev->newest_tle; | |
124 | b->w.cb = w_send_barrier; | |
125 | /* inc_ap_pending done here, so we won't | |
126 | * get imbalanced on connection loss. | |
127 | * dec_ap_pending will be done in got_BarrierAck | |
128 | * or (on connection loss) in tl_clear. */ | |
129 | inc_ap_pending(mdev); | |
130 | drbd_queue_work(&mdev->data.work, &b->w); | |
131 | set_bit(CREATE_BARRIER, &mdev->flags); | |
132 | } | |
133 | ||
134 | static void _about_to_complete_local_write(struct drbd_conf *mdev, | |
135 | struct drbd_request *req) | |
136 | { | |
137 | const unsigned long s = req->rq_state; | |
138 | struct drbd_request *i; | |
139 | struct drbd_epoch_entry *e; | |
140 | struct hlist_node *n; | |
141 | struct hlist_head *slot; | |
142 | ||
8a3c1044 LE |
143 | /* Before we can signal completion to the upper layers, |
144 | * we may need to close the current epoch. | |
145 | * We can skip this, if this request has not even been sent, because we | |
146 | * did not have a fully established connection yet/anymore, during | |
147 | * bitmap exchange, or while we are C_AHEAD due to congestion policy. | |
148 | */ | |
149 | if (mdev->state.conn >= C_CONNECTED && | |
150 | (s & RQ_NET_SENT) != 0 && | |
b411b363 PR |
151 | req->epoch == mdev->newest_tle->br_number) |
152 | queue_barrier(mdev); | |
153 | ||
154 | /* we need to do the conflict detection stuff, | |
155 | * if we have the ee_hash (two_primaries) and | |
156 | * this has been on the network */ | |
157 | if ((s & RQ_NET_DONE) && mdev->ee_hash != NULL) { | |
158 | const sector_t sector = req->sector; | |
159 | const int size = req->size; | |
160 | ||
161 | /* ASSERT: | |
162 | * there must be no conflicting requests, since | |
163 | * they must have been failed on the spot */ | |
164 | #define OVERLAPS overlaps(sector, size, i->sector, i->size) | |
165 | slot = tl_hash_slot(mdev, sector); | |
166 | hlist_for_each_entry(i, n, slot, colision) { | |
167 | if (OVERLAPS) { | |
168 | dev_alert(DEV, "LOGIC BUG: completed: %p %llus +%u; " | |
169 | "other: %p %llus +%u\n", | |
170 | req, (unsigned long long)sector, size, | |
171 | i, (unsigned long long)i->sector, i->size); | |
172 | } | |
173 | } | |
174 | ||
175 | /* maybe "wake" those conflicting epoch entries | |
176 | * that wait for this request to finish. | |
177 | * | |
178 | * currently, there can be only _one_ such ee | |
179 | * (well, or some more, which would be pending | |
180 | * P_DISCARD_ACK not yet sent by the asender...), | |
181 | * since we block the receiver thread upon the | |
182 | * first conflict detection, which will wait on | |
183 | * misc_wait. maybe we want to assert that? | |
184 | * | |
185 | * anyways, if we found one, | |
186 | * we just have to do a wake_up. */ | |
187 | #undef OVERLAPS | |
188 | #define OVERLAPS overlaps(sector, size, e->sector, e->size) | |
189 | slot = ee_hash_slot(mdev, req->sector); | |
190 | hlist_for_each_entry(e, n, slot, colision) { | |
191 | if (OVERLAPS) { | |
192 | wake_up(&mdev->misc_wait); | |
193 | break; | |
194 | } | |
195 | } | |
196 | } | |
197 | #undef OVERLAPS | |
198 | } | |
199 | ||
200 | void complete_master_bio(struct drbd_conf *mdev, | |
201 | struct bio_and_error *m) | |
202 | { | |
b411b363 PR |
203 | bio_endio(m->bio, m->error); |
204 | dec_ap_bio(mdev); | |
205 | } | |
206 | ||
207 | /* Helper for __req_mod(). | |
208 | * Set m->bio to the master bio, if it is fit to be completed, | |
209 | * or leave it alone (it is initialized to NULL in __req_mod), | |
210 | * if it has already been completed, or cannot be completed yet. | |
211 | * If m->bio is set, the error status to be returned is placed in m->error. | |
212 | */ | |
213 | void _req_may_be_done(struct drbd_request *req, struct bio_and_error *m) | |
214 | { | |
215 | const unsigned long s = req->rq_state; | |
216 | struct drbd_conf *mdev = req->mdev; | |
217 | /* only WRITES may end up here without a master bio (on barrier ack) */ | |
218 | int rw = req->master_bio ? bio_data_dir(req->master_bio) : WRITE; | |
219 | ||
b411b363 PR |
220 | /* we must not complete the master bio, while it is |
221 | * still being processed by _drbd_send_zc_bio (drbd_send_dblock) | |
222 | * not yet acknowledged by the peer | |
223 | * not yet completed by the local io subsystem | |
224 | * these flags may get cleared in any order by | |
225 | * the worker, | |
226 | * the receiver, | |
227 | * the bio_endio completion callbacks. | |
228 | */ | |
229 | if (s & RQ_NET_QUEUED) | |
230 | return; | |
231 | if (s & RQ_NET_PENDING) | |
232 | return; | |
233 | if (s & RQ_LOCAL_PENDING) | |
234 | return; | |
235 | ||
236 | if (req->master_bio) { | |
237 | /* this is data_received (remote read) | |
238 | * or protocol C P_WRITE_ACK | |
239 | * or protocol B P_RECV_ACK | |
240 | * or protocol A "handed_over_to_network" (SendAck) | |
241 | * or canceled or failed, | |
242 | * or killed from the transfer log due to connection loss. | |
243 | */ | |
244 | ||
245 | /* | |
246 | * figure out whether to report success or failure. | |
247 | * | |
248 | * report success when at least one of the operations succeeded. | |
249 | * or, to put the other way, | |
250 | * only report failure, when both operations failed. | |
251 | * | |
252 | * what to do about the failures is handled elsewhere. | |
253 | * what we need to do here is just: complete the master_bio. | |
254 | * | |
255 | * local completion error, if any, has been stored as ERR_PTR | |
256 | * in private_bio within drbd_endio_pri. | |
257 | */ | |
258 | int ok = (s & RQ_LOCAL_OK) || (s & RQ_NET_OK); | |
259 | int error = PTR_ERR(req->private_bio); | |
260 | ||
261 | /* remove the request from the conflict detection | |
262 | * respective block_id verification hash */ | |
263 | if (!hlist_unhashed(&req->colision)) | |
264 | hlist_del(&req->colision); | |
265 | else | |
8825f7c3 | 266 | D_ASSERT((s & (RQ_NET_MASK & ~RQ_NET_DONE)) == 0); |
b411b363 PR |
267 | |
268 | /* for writes we need to do some extra housekeeping */ | |
269 | if (rw == WRITE) | |
270 | _about_to_complete_local_write(mdev, req); | |
271 | ||
272 | /* Update disk stats */ | |
273 | _drbd_end_io_acct(mdev, req); | |
274 | ||
275 | m->error = ok ? 0 : (error ?: -EIO); | |
276 | m->bio = req->master_bio; | |
277 | req->master_bio = NULL; | |
278 | } | |
279 | ||
280 | if ((s & RQ_NET_MASK) == 0 || (s & RQ_NET_DONE)) { | |
281 | /* this is disconnected (local only) operation, | |
282 | * or protocol C P_WRITE_ACK, | |
283 | * or protocol A or B P_BARRIER_ACK, | |
284 | * or killed from the transfer log due to connection loss. */ | |
285 | _req_is_done(mdev, req, rw); | |
286 | } | |
287 | /* else: network part and not DONE yet. that is | |
288 | * protocol A or B, barrier ack still pending... */ | |
289 | } | |
290 | ||
cfa03415 PR |
291 | static void _req_may_be_done_not_susp(struct drbd_request *req, struct bio_and_error *m) |
292 | { | |
293 | struct drbd_conf *mdev = req->mdev; | |
294 | ||
fb22c402 | 295 | if (!is_susp(mdev->state)) |
cfa03415 PR |
296 | _req_may_be_done(req, m); |
297 | } | |
298 | ||
b411b363 PR |
299 | /* |
300 | * checks whether there was an overlapping request | |
301 | * or ee already registered. | |
302 | * | |
303 | * if so, return 1, in which case this request is completed on the spot, | |
304 | * without ever being submitted or send. | |
305 | * | |
306 | * return 0 if it is ok to submit this request. | |
307 | * | |
308 | * NOTE: | |
309 | * paranoia: assume something above us is broken, and issues different write | |
310 | * requests for the same block simultaneously... | |
311 | * | |
312 | * To ensure these won't be reordered differently on both nodes, resulting in | |
313 | * diverging data sets, we discard the later one(s). Not that this is supposed | |
314 | * to happen, but this is the rationale why we also have to check for | |
315 | * conflicting requests with local origin, and why we have to do so regardless | |
316 | * of whether we allowed multiple primaries. | |
317 | * | |
318 | * BTW, in case we only have one primary, the ee_hash is empty anyways, and the | |
319 | * second hlist_for_each_entry becomes a noop. This is even simpler than to | |
320 | * grab a reference on the net_conf, and check for the two_primaries flag... | |
321 | */ | |
322 | static int _req_conflicts(struct drbd_request *req) | |
323 | { | |
324 | struct drbd_conf *mdev = req->mdev; | |
325 | const sector_t sector = req->sector; | |
326 | const int size = req->size; | |
327 | struct drbd_request *i; | |
328 | struct drbd_epoch_entry *e; | |
329 | struct hlist_node *n; | |
330 | struct hlist_head *slot; | |
331 | ||
332 | D_ASSERT(hlist_unhashed(&req->colision)); | |
333 | ||
334 | if (!get_net_conf(mdev)) | |
335 | return 0; | |
336 | ||
337 | /* BUG_ON */ | |
338 | ERR_IF (mdev->tl_hash_s == 0) | |
339 | goto out_no_conflict; | |
340 | BUG_ON(mdev->tl_hash == NULL); | |
341 | ||
342 | #define OVERLAPS overlaps(i->sector, i->size, sector, size) | |
343 | slot = tl_hash_slot(mdev, sector); | |
344 | hlist_for_each_entry(i, n, slot, colision) { | |
345 | if (OVERLAPS) { | |
346 | dev_alert(DEV, "%s[%u] Concurrent local write detected! " | |
347 | "[DISCARD L] new: %llus +%u; " | |
348 | "pending: %llus +%u\n", | |
349 | current->comm, current->pid, | |
350 | (unsigned long long)sector, size, | |
351 | (unsigned long long)i->sector, i->size); | |
352 | goto out_conflict; | |
353 | } | |
354 | } | |
355 | ||
356 | if (mdev->ee_hash_s) { | |
357 | /* now, check for overlapping requests with remote origin */ | |
358 | BUG_ON(mdev->ee_hash == NULL); | |
359 | #undef OVERLAPS | |
360 | #define OVERLAPS overlaps(e->sector, e->size, sector, size) | |
361 | slot = ee_hash_slot(mdev, sector); | |
362 | hlist_for_each_entry(e, n, slot, colision) { | |
363 | if (OVERLAPS) { | |
364 | dev_alert(DEV, "%s[%u] Concurrent remote write detected!" | |
365 | " [DISCARD L] new: %llus +%u; " | |
366 | "pending: %llus +%u\n", | |
367 | current->comm, current->pid, | |
368 | (unsigned long long)sector, size, | |
369 | (unsigned long long)e->sector, e->size); | |
370 | goto out_conflict; | |
371 | } | |
372 | } | |
373 | } | |
374 | #undef OVERLAPS | |
375 | ||
376 | out_no_conflict: | |
377 | /* this is like it should be, and what we expected. | |
378 | * our users do behave after all... */ | |
379 | put_net_conf(mdev); | |
380 | return 0; | |
381 | ||
382 | out_conflict: | |
383 | put_net_conf(mdev); | |
384 | return 1; | |
385 | } | |
386 | ||
387 | /* obviously this could be coded as many single functions | |
388 | * instead of one huge switch, | |
389 | * or by putting the code directly in the respective locations | |
390 | * (as it has been before). | |
391 | * | |
392 | * but having it this way | |
393 | * enforces that it is all in this one place, where it is easier to audit, | |
394 | * it makes it obvious that whatever "event" "happens" to a request should | |
395 | * happen "atomically" within the req_lock, | |
396 | * and it enforces that we have to think in a very structured manner | |
397 | * about the "events" that may happen to a request during its life time ... | |
398 | */ | |
2a80699f | 399 | int __req_mod(struct drbd_request *req, enum drbd_req_event what, |
b411b363 PR |
400 | struct bio_and_error *m) |
401 | { | |
402 | struct drbd_conf *mdev = req->mdev; | |
2a80699f | 403 | int rv = 0; |
b411b363 PR |
404 | m->bio = NULL; |
405 | ||
b411b363 PR |
406 | switch (what) { |
407 | default: | |
408 | dev_err(DEV, "LOGIC BUG in %s:%u\n", __FILE__ , __LINE__); | |
409 | break; | |
410 | ||
411 | /* does not happen... | |
412 | * initialization done in drbd_req_new | |
413 | case created: | |
414 | break; | |
415 | */ | |
416 | ||
417 | case to_be_send: /* via network */ | |
418 | /* reached via drbd_make_request_common | |
419 | * and from w_read_retry_remote */ | |
420 | D_ASSERT(!(req->rq_state & RQ_NET_MASK)); | |
421 | req->rq_state |= RQ_NET_PENDING; | |
422 | inc_ap_pending(mdev); | |
423 | break; | |
424 | ||
425 | case to_be_submitted: /* locally */ | |
426 | /* reached via drbd_make_request_common */ | |
427 | D_ASSERT(!(req->rq_state & RQ_LOCAL_MASK)); | |
428 | req->rq_state |= RQ_LOCAL_PENDING; | |
429 | break; | |
430 | ||
431 | case completed_ok: | |
432 | if (bio_data_dir(req->master_bio) == WRITE) | |
433 | mdev->writ_cnt += req->size>>9; | |
434 | else | |
435 | mdev->read_cnt += req->size>>9; | |
436 | ||
437 | req->rq_state |= (RQ_LOCAL_COMPLETED|RQ_LOCAL_OK); | |
438 | req->rq_state &= ~RQ_LOCAL_PENDING; | |
439 | ||
cfa03415 | 440 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
441 | put_ldev(mdev); |
442 | break; | |
443 | ||
444 | case write_completed_with_error: | |
445 | req->rq_state |= RQ_LOCAL_COMPLETED; | |
446 | req->rq_state &= ~RQ_LOCAL_PENDING; | |
447 | ||
b411b363 | 448 | __drbd_chk_io_error(mdev, FALSE); |
cfa03415 | 449 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
450 | put_ldev(mdev); |
451 | break; | |
452 | ||
453 | case read_ahead_completed_with_error: | |
454 | /* it is legal to fail READA */ | |
455 | req->rq_state |= RQ_LOCAL_COMPLETED; | |
456 | req->rq_state &= ~RQ_LOCAL_PENDING; | |
cfa03415 | 457 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
458 | put_ldev(mdev); |
459 | break; | |
460 | ||
461 | case read_completed_with_error: | |
462 | drbd_set_out_of_sync(mdev, req->sector, req->size); | |
463 | ||
464 | req->rq_state |= RQ_LOCAL_COMPLETED; | |
465 | req->rq_state &= ~RQ_LOCAL_PENDING; | |
466 | ||
b411b363 | 467 | D_ASSERT(!(req->rq_state & RQ_NET_MASK)); |
b411b363 PR |
468 | |
469 | __drbd_chk_io_error(mdev, FALSE); | |
470 | put_ldev(mdev); | |
b411b363 | 471 | |
d255e5ff LE |
472 | /* no point in retrying if there is no good remote data, |
473 | * or we have no connection. */ | |
474 | if (mdev->state.pdsk != D_UP_TO_DATE) { | |
cfa03415 | 475 | _req_may_be_done_not_susp(req, m); |
d255e5ff LE |
476 | break; |
477 | } | |
478 | ||
479 | /* _req_mod(req,to_be_send); oops, recursion... */ | |
480 | req->rq_state |= RQ_NET_PENDING; | |
481 | inc_ap_pending(mdev); | |
b411b363 PR |
482 | /* fall through: _req_mod(req,queue_for_net_read); */ |
483 | ||
484 | case queue_for_net_read: | |
485 | /* READ or READA, and | |
486 | * no local disk, | |
487 | * or target area marked as invalid, | |
488 | * or just got an io-error. */ | |
489 | /* from drbd_make_request_common | |
490 | * or from bio_endio during read io-error recovery */ | |
491 | ||
492 | /* so we can verify the handle in the answer packet | |
493 | * corresponding hlist_del is in _req_may_be_done() */ | |
494 | hlist_add_head(&req->colision, ar_hash_slot(mdev, req->sector)); | |
495 | ||
83c38830 | 496 | set_bit(UNPLUG_REMOTE, &mdev->flags); |
b411b363 PR |
497 | |
498 | D_ASSERT(req->rq_state & RQ_NET_PENDING); | |
499 | req->rq_state |= RQ_NET_QUEUED; | |
500 | req->w.cb = (req->rq_state & RQ_LOCAL_MASK) | |
501 | ? w_read_retry_remote | |
502 | : w_send_read_req; | |
503 | drbd_queue_work(&mdev->data.work, &req->w); | |
504 | break; | |
505 | ||
506 | case queue_for_net_write: | |
507 | /* assert something? */ | |
508 | /* from drbd_make_request_common only */ | |
509 | ||
510 | hlist_add_head(&req->colision, tl_hash_slot(mdev, req->sector)); | |
511 | /* corresponding hlist_del is in _req_may_be_done() */ | |
512 | ||
513 | /* NOTE | |
514 | * In case the req ended up on the transfer log before being | |
515 | * queued on the worker, it could lead to this request being | |
516 | * missed during cleanup after connection loss. | |
517 | * So we have to do both operations here, | |
518 | * within the same lock that protects the transfer log. | |
519 | * | |
520 | * _req_add_to_epoch(req); this has to be after the | |
521 | * _maybe_start_new_epoch(req); which happened in | |
522 | * drbd_make_request_common, because we now may set the bit | |
523 | * again ourselves to close the current epoch. | |
524 | * | |
525 | * Add req to the (now) current epoch (barrier). */ | |
526 | ||
83c38830 LE |
527 | /* otherwise we may lose an unplug, which may cause some remote |
528 | * io-scheduler timeout to expire, increasing maximum latency, | |
529 | * hurting performance. */ | |
530 | set_bit(UNPLUG_REMOTE, &mdev->flags); | |
531 | ||
b411b363 PR |
532 | /* see drbd_make_request_common, |
533 | * just after it grabs the req_lock */ | |
534 | D_ASSERT(test_bit(CREATE_BARRIER, &mdev->flags) == 0); | |
535 | ||
536 | req->epoch = mdev->newest_tle->br_number; | |
b411b363 PR |
537 | |
538 | /* increment size of current epoch */ | |
7e602c0a | 539 | mdev->newest_tle->n_writes++; |
b411b363 PR |
540 | |
541 | /* queue work item to send data */ | |
542 | D_ASSERT(req->rq_state & RQ_NET_PENDING); | |
543 | req->rq_state |= RQ_NET_QUEUED; | |
544 | req->w.cb = w_send_dblock; | |
545 | drbd_queue_work(&mdev->data.work, &req->w); | |
546 | ||
547 | /* close the epoch, in case it outgrew the limit */ | |
7e602c0a | 548 | if (mdev->newest_tle->n_writes >= mdev->net_conf->max_epoch_size) |
b411b363 PR |
549 | queue_barrier(mdev); |
550 | ||
551 | break; | |
552 | ||
73a01a18 PR |
553 | case queue_for_send_oos: |
554 | req->rq_state |= RQ_NET_QUEUED; | |
555 | req->w.cb = w_send_oos; | |
556 | drbd_queue_work(&mdev->data.work, &req->w); | |
557 | break; | |
558 | ||
559 | case oos_handed_to_network: | |
560 | /* actually the same */ | |
b411b363 PR |
561 | case send_canceled: |
562 | /* treat it the same */ | |
563 | case send_failed: | |
564 | /* real cleanup will be done from tl_clear. just update flags | |
565 | * so it is no longer marked as on the worker queue */ | |
566 | req->rq_state &= ~RQ_NET_QUEUED; | |
567 | /* if we did it right, tl_clear should be scheduled only after | |
568 | * this, so this should not be necessary! */ | |
cfa03415 | 569 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
570 | break; |
571 | ||
572 | case handed_over_to_network: | |
573 | /* assert something? */ | |
759fbdfb PR |
574 | if (bio_data_dir(req->master_bio) == WRITE) |
575 | atomic_add(req->size>>9, &mdev->ap_in_flight); | |
576 | ||
b411b363 PR |
577 | if (bio_data_dir(req->master_bio) == WRITE && |
578 | mdev->net_conf->wire_protocol == DRBD_PROT_A) { | |
579 | /* this is what is dangerous about protocol A: | |
580 | * pretend it was successfully written on the peer. */ | |
581 | if (req->rq_state & RQ_NET_PENDING) { | |
582 | dec_ap_pending(mdev); | |
583 | req->rq_state &= ~RQ_NET_PENDING; | |
584 | req->rq_state |= RQ_NET_OK; | |
585 | } /* else: neg-ack was faster... */ | |
586 | /* it is still not yet RQ_NET_DONE until the | |
587 | * corresponding epoch barrier got acked as well, | |
588 | * so we know what to dirty on connection loss */ | |
589 | } | |
590 | req->rq_state &= ~RQ_NET_QUEUED; | |
591 | req->rq_state |= RQ_NET_SENT; | |
592 | /* because _drbd_send_zc_bio could sleep, and may want to | |
593 | * dereference the bio even after the "write_acked_by_peer" and | |
594 | * "completed_ok" events came in, once we return from | |
595 | * _drbd_send_zc_bio (drbd_send_dblock), we have to check | |
596 | * whether it is done already, and end it. */ | |
cfa03415 | 597 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
598 | break; |
599 | ||
d255e5ff LE |
600 | case read_retry_remote_canceled: |
601 | req->rq_state &= ~RQ_NET_QUEUED; | |
602 | /* fall through, in case we raced with drbd_disconnect */ | |
b411b363 PR |
603 | case connection_lost_while_pending: |
604 | /* transfer log cleanup after connection loss */ | |
605 | /* assert something? */ | |
606 | if (req->rq_state & RQ_NET_PENDING) | |
607 | dec_ap_pending(mdev); | |
608 | req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING); | |
609 | req->rq_state |= RQ_NET_DONE; | |
759fbdfb PR |
610 | if (req->rq_state & RQ_NET_SENT && req->rq_state & RQ_WRITE) |
611 | atomic_sub(req->size>>9, &mdev->ap_in_flight); | |
612 | ||
b411b363 PR |
613 | /* if it is still queued, we may not complete it here. |
614 | * it will be canceled soon. */ | |
615 | if (!(req->rq_state & RQ_NET_QUEUED)) | |
cfa03415 | 616 | _req_may_be_done(req, m); /* Allowed while state.susp */ |
b411b363 PR |
617 | break; |
618 | ||
619 | case write_acked_by_peer_and_sis: | |
620 | req->rq_state |= RQ_NET_SIS; | |
621 | case conflict_discarded_by_peer: | |
622 | /* for discarded conflicting writes of multiple primaries, | |
623 | * there is no need to keep anything in the tl, potential | |
624 | * node crashes are covered by the activity log. */ | |
625 | if (what == conflict_discarded_by_peer) | |
626 | dev_alert(DEV, "Got DiscardAck packet %llus +%u!" | |
627 | " DRBD is not a random data generator!\n", | |
628 | (unsigned long long)req->sector, req->size); | |
629 | req->rq_state |= RQ_NET_DONE; | |
630 | /* fall through */ | |
631 | case write_acked_by_peer: | |
632 | /* protocol C; successfully written on peer. | |
633 | * Nothing to do here. | |
634 | * We want to keep the tl in place for all protocols, to cater | |
635 | * for volatile write-back caches on lower level devices. | |
636 | * | |
637 | * A barrier request is expected to have forced all prior | |
638 | * requests onto stable storage, so completion of a barrier | |
639 | * request could set NET_DONE right here, and not wait for the | |
640 | * P_BARRIER_ACK, but that is an unnecessary optimization. */ | |
641 | ||
642 | /* this makes it effectively the same as for: */ | |
643 | case recv_acked_by_peer: | |
644 | /* protocol B; pretends to be successfully written on peer. | |
645 | * see also notes above in handed_over_to_network about | |
646 | * protocol != C */ | |
647 | req->rq_state |= RQ_NET_OK; | |
648 | D_ASSERT(req->rq_state & RQ_NET_PENDING); | |
649 | dec_ap_pending(mdev); | |
759fbdfb | 650 | atomic_sub(req->size>>9, &mdev->ap_in_flight); |
b411b363 | 651 | req->rq_state &= ~RQ_NET_PENDING; |
cfa03415 | 652 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
653 | break; |
654 | ||
655 | case neg_acked: | |
656 | /* assert something? */ | |
759fbdfb | 657 | if (req->rq_state & RQ_NET_PENDING) { |
b411b363 | 658 | dec_ap_pending(mdev); |
759fbdfb PR |
659 | atomic_sub(req->size>>9, &mdev->ap_in_flight); |
660 | } | |
b411b363 PR |
661 | req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING); |
662 | ||
663 | req->rq_state |= RQ_NET_DONE; | |
cfa03415 | 664 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
665 | /* else: done by handed_over_to_network */ |
666 | break; | |
667 | ||
265be2d0 PR |
668 | case fail_frozen_disk_io: |
669 | if (!(req->rq_state & RQ_LOCAL_COMPLETED)) | |
670 | break; | |
671 | ||
cfa03415 | 672 | _req_may_be_done(req, m); /* Allowed while state.susp */ |
265be2d0 PR |
673 | break; |
674 | ||
675 | case restart_frozen_disk_io: | |
676 | if (!(req->rq_state & RQ_LOCAL_COMPLETED)) | |
677 | break; | |
678 | ||
679 | req->rq_state &= ~RQ_LOCAL_COMPLETED; | |
680 | ||
681 | rv = MR_READ; | |
682 | if (bio_data_dir(req->master_bio) == WRITE) | |
683 | rv = MR_WRITE; | |
684 | ||
685 | get_ldev(mdev); | |
686 | req->w.cb = w_restart_disk_io; | |
687 | drbd_queue_work(&mdev->data.work, &req->w); | |
688 | break; | |
689 | ||
11b58e73 PR |
690 | case resend: |
691 | /* If RQ_NET_OK is already set, we got a P_WRITE_ACK or P_RECV_ACK | |
47ff2d0a | 692 | before the connection loss (B&C only); only P_BARRIER_ACK was missing. |
11b58e73 | 693 | Trowing them out of the TL here by pretending we got a BARRIER_ACK |
481c6f50 | 694 | We ensure that the peer was not rebooted */ |
11b58e73 PR |
695 | if (!(req->rq_state & RQ_NET_OK)) { |
696 | if (req->w.cb) { | |
697 | drbd_queue_work(&mdev->data.work, &req->w); | |
698 | rv = req->rq_state & RQ_WRITE ? MR_WRITE : MR_READ; | |
699 | } | |
700 | break; | |
701 | } | |
702 | /* else, fall through to barrier_acked */ | |
703 | ||
b411b363 | 704 | case barrier_acked: |
288f422e PR |
705 | if (!(req->rq_state & RQ_WRITE)) |
706 | break; | |
707 | ||
b411b363 PR |
708 | if (req->rq_state & RQ_NET_PENDING) { |
709 | /* barrier came in before all requests have been acked. | |
710 | * this is bad, because if the connection is lost now, | |
711 | * we won't be able to clean them up... */ | |
712 | dev_err(DEV, "FIXME (barrier_acked but pending)\n"); | |
b411b363 PR |
713 | list_move(&req->tl_requests, &mdev->out_of_sequence_requests); |
714 | } | |
715 | D_ASSERT(req->rq_state & RQ_NET_SENT); | |
716 | req->rq_state |= RQ_NET_DONE; | |
759fbdfb PR |
717 | if (mdev->net_conf->wire_protocol == DRBD_PROT_A) |
718 | atomic_sub(req->size>>9, &mdev->ap_in_flight); | |
cfa03415 | 719 | _req_may_be_done(req, m); /* Allowed while state.susp */ |
b411b363 PR |
720 | break; |
721 | ||
722 | case data_received: | |
723 | D_ASSERT(req->rq_state & RQ_NET_PENDING); | |
724 | dec_ap_pending(mdev); | |
725 | req->rq_state &= ~RQ_NET_PENDING; | |
726 | req->rq_state |= (RQ_NET_OK|RQ_NET_DONE); | |
cfa03415 | 727 | _req_may_be_done_not_susp(req, m); |
b411b363 PR |
728 | break; |
729 | }; | |
2a80699f PR |
730 | |
731 | return rv; | |
b411b363 PR |
732 | } |
733 | ||
734 | /* we may do a local read if: | |
735 | * - we are consistent (of course), | |
736 | * - or we are generally inconsistent, | |
737 | * BUT we are still/already IN SYNC for this area. | |
738 | * since size may be bigger than BM_BLOCK_SIZE, | |
739 | * we may need to check several bits. | |
740 | */ | |
741 | static int drbd_may_do_local_read(struct drbd_conf *mdev, sector_t sector, int size) | |
742 | { | |
743 | unsigned long sbnr, ebnr; | |
744 | sector_t esector, nr_sectors; | |
745 | ||
746 | if (mdev->state.disk == D_UP_TO_DATE) | |
747 | return 1; | |
748 | if (mdev->state.disk >= D_OUTDATED) | |
749 | return 0; | |
750 | if (mdev->state.disk < D_INCONSISTENT) | |
751 | return 0; | |
752 | /* state.disk == D_INCONSISTENT We will have a look at the BitMap */ | |
753 | nr_sectors = drbd_get_capacity(mdev->this_bdev); | |
754 | esector = sector + (size >> 9) - 1; | |
755 | ||
756 | D_ASSERT(sector < nr_sectors); | |
757 | D_ASSERT(esector < nr_sectors); | |
758 | ||
759 | sbnr = BM_SECT_TO_BIT(sector); | |
760 | ebnr = BM_SECT_TO_BIT(esector); | |
761 | ||
762 | return 0 == drbd_bm_count_bits(mdev, sbnr, ebnr); | |
763 | } | |
764 | ||
3719094e PR |
765 | static int drbd_should_do_remote(struct drbd_conf *mdev) |
766 | { | |
767 | union drbd_state s = mdev->state; | |
768 | ||
769 | return s.pdsk == D_UP_TO_DATE || | |
770 | (s.pdsk >= D_INCONSISTENT && | |
771 | s.conn >= C_WF_BITMAP_T && | |
772 | s.conn < C_AHEAD); | |
773 | } | |
774 | static int drbd_should_send_oos(struct drbd_conf *mdev) | |
775 | { | |
776 | union drbd_state s = mdev->state; | |
777 | ||
778 | return s.pdsk >= D_INCONSISTENT && | |
779 | (s.conn == C_AHEAD || s.conn == C_WF_BITMAP_S); | |
780 | } | |
781 | ||
aeda1cd6 | 782 | static int drbd_make_request_common(struct drbd_conf *mdev, struct bio *bio, unsigned long start_time) |
b411b363 PR |
783 | { |
784 | const int rw = bio_rw(bio); | |
785 | const int size = bio->bi_size; | |
786 | const sector_t sector = bio->bi_sector; | |
787 | struct drbd_tl_epoch *b = NULL; | |
788 | struct drbd_request *req; | |
73a01a18 | 789 | int local, remote, send_oos = 0; |
b411b363 | 790 | int err = -EIO; |
9a25a04c | 791 | int ret = 0; |
b411b363 PR |
792 | |
793 | /* allocate outside of all locks; */ | |
794 | req = drbd_req_new(mdev, bio); | |
795 | if (!req) { | |
796 | dec_ap_bio(mdev); | |
797 | /* only pass the error to the upper layers. | |
798 | * if user cannot handle io errors, that's not our business. */ | |
799 | dev_err(DEV, "could not kmalloc() req\n"); | |
800 | bio_endio(bio, -ENOMEM); | |
801 | return 0; | |
802 | } | |
aeda1cd6 | 803 | req->start_time = start_time; |
b411b363 | 804 | |
b411b363 PR |
805 | local = get_ldev(mdev); |
806 | if (!local) { | |
807 | bio_put(req->private_bio); /* or we get a bio leak */ | |
808 | req->private_bio = NULL; | |
809 | } | |
810 | if (rw == WRITE) { | |
811 | remote = 1; | |
812 | } else { | |
813 | /* READ || READA */ | |
814 | if (local) { | |
815 | if (!drbd_may_do_local_read(mdev, sector, size)) { | |
816 | /* we could kick the syncer to | |
817 | * sync this extent asap, wait for | |
818 | * it, then continue locally. | |
819 | * Or just issue the request remotely. | |
820 | */ | |
821 | local = 0; | |
822 | bio_put(req->private_bio); | |
823 | req->private_bio = NULL; | |
824 | put_ldev(mdev); | |
825 | } | |
826 | } | |
827 | remote = !local && mdev->state.pdsk >= D_UP_TO_DATE; | |
828 | } | |
829 | ||
830 | /* If we have a disk, but a READA request is mapped to remote, | |
831 | * we are R_PRIMARY, D_INCONSISTENT, SyncTarget. | |
832 | * Just fail that READA request right here. | |
833 | * | |
834 | * THINK: maybe fail all READA when not local? | |
835 | * or make this configurable... | |
836 | * if network is slow, READA won't do any good. | |
837 | */ | |
838 | if (rw == READA && mdev->state.disk >= D_INCONSISTENT && !local) { | |
839 | err = -EWOULDBLOCK; | |
840 | goto fail_and_free_req; | |
841 | } | |
842 | ||
843 | /* For WRITES going to the local disk, grab a reference on the target | |
844 | * extent. This waits for any resync activity in the corresponding | |
845 | * resync extent to finish, and, if necessary, pulls in the target | |
846 | * extent into the activity log, which involves further disk io because | |
847 | * of transactional on-disk meta data updates. */ | |
0778286a PR |
848 | if (rw == WRITE && local && !test_bit(AL_SUSPENDED, &mdev->flags)) { |
849 | req->rq_state |= RQ_IN_ACT_LOG; | |
b411b363 | 850 | drbd_al_begin_io(mdev, sector); |
0778286a | 851 | } |
b411b363 | 852 | |
3719094e PR |
853 | remote = remote && drbd_should_do_remote(mdev); |
854 | send_oos = rw == WRITE && drbd_should_send_oos(mdev); | |
855 | D_ASSERT(!(remote && send_oos)); | |
b411b363 | 856 | |
fb22c402 | 857 | if (!(local || remote) && !is_susp(mdev->state)) { |
fb2c7a10 LE |
858 | if (__ratelimit(&drbd_ratelimit_state)) |
859 | dev_err(DEV, "IO ERROR: neither local nor remote disk\n"); | |
b411b363 PR |
860 | goto fail_free_complete; |
861 | } | |
862 | ||
863 | /* For WRITE request, we have to make sure that we have an | |
864 | * unused_spare_tle, in case we need to start a new epoch. | |
865 | * I try to be smart and avoid to pre-allocate always "just in case", | |
866 | * but there is a race between testing the bit and pointer outside the | |
867 | * spinlock, and grabbing the spinlock. | |
868 | * if we lost that race, we retry. */ | |
73a01a18 | 869 | if (rw == WRITE && (remote || send_oos) && |
b411b363 PR |
870 | mdev->unused_spare_tle == NULL && |
871 | test_bit(CREATE_BARRIER, &mdev->flags)) { | |
872 | allocate_barrier: | |
873 | b = kmalloc(sizeof(struct drbd_tl_epoch), GFP_NOIO); | |
874 | if (!b) { | |
875 | dev_err(DEV, "Failed to alloc barrier.\n"); | |
876 | err = -ENOMEM; | |
877 | goto fail_free_complete; | |
878 | } | |
879 | } | |
880 | ||
881 | /* GOOD, everything prepared, grab the spin_lock */ | |
882 | spin_lock_irq(&mdev->req_lock); | |
883 | ||
fb22c402 | 884 | if (is_susp(mdev->state)) { |
9a25a04c PR |
885 | /* If we got suspended, use the retry mechanism of |
886 | generic_make_request() to restart processing of this | |
2f58dcfc | 887 | bio. In the next call to drbd_make_request |
9a25a04c PR |
888 | we sleep in inc_ap_bio() */ |
889 | ret = 1; | |
890 | spin_unlock_irq(&mdev->req_lock); | |
891 | goto fail_free_complete; | |
892 | } | |
893 | ||
73a01a18 | 894 | if (remote || send_oos) { |
3719094e PR |
895 | remote = drbd_should_do_remote(mdev); |
896 | send_oos = rw == WRITE && drbd_should_send_oos(mdev); | |
897 | D_ASSERT(!(remote && send_oos)); | |
73a01a18 PR |
898 | |
899 | if (!(remote || send_oos)) | |
b411b363 PR |
900 | dev_warn(DEV, "lost connection while grabbing the req_lock!\n"); |
901 | if (!(local || remote)) { | |
902 | dev_err(DEV, "IO ERROR: neither local nor remote disk\n"); | |
903 | spin_unlock_irq(&mdev->req_lock); | |
904 | goto fail_free_complete; | |
905 | } | |
906 | } | |
907 | ||
908 | if (b && mdev->unused_spare_tle == NULL) { | |
909 | mdev->unused_spare_tle = b; | |
910 | b = NULL; | |
911 | } | |
73a01a18 | 912 | if (rw == WRITE && (remote || send_oos) && |
b411b363 PR |
913 | mdev->unused_spare_tle == NULL && |
914 | test_bit(CREATE_BARRIER, &mdev->flags)) { | |
915 | /* someone closed the current epoch | |
916 | * while we were grabbing the spinlock */ | |
917 | spin_unlock_irq(&mdev->req_lock); | |
918 | goto allocate_barrier; | |
919 | } | |
920 | ||
921 | ||
922 | /* Update disk stats */ | |
923 | _drbd_start_io_acct(mdev, req, bio); | |
924 | ||
925 | /* _maybe_start_new_epoch(mdev); | |
926 | * If we need to generate a write barrier packet, we have to add the | |
927 | * new epoch (barrier) object, and queue the barrier packet for sending, | |
928 | * and queue the req's data after it _within the same lock_, otherwise | |
929 | * we have race conditions were the reorder domains could be mixed up. | |
930 | * | |
931 | * Even read requests may start a new epoch and queue the corresponding | |
932 | * barrier packet. To get the write ordering right, we only have to | |
933 | * make sure that, if this is a write request and it triggered a | |
934 | * barrier packet, this request is queued within the same spinlock. */ | |
73a01a18 | 935 | if ((remote || send_oos) && mdev->unused_spare_tle && |
b411b363 PR |
936 | test_and_clear_bit(CREATE_BARRIER, &mdev->flags)) { |
937 | _tl_add_barrier(mdev, mdev->unused_spare_tle); | |
938 | mdev->unused_spare_tle = NULL; | |
939 | } else { | |
940 | D_ASSERT(!(remote && rw == WRITE && | |
941 | test_bit(CREATE_BARRIER, &mdev->flags))); | |
942 | } | |
943 | ||
944 | /* NOTE | |
945 | * Actually, 'local' may be wrong here already, since we may have failed | |
946 | * to write to the meta data, and may become wrong anytime because of | |
947 | * local io-error for some other request, which would lead to us | |
948 | * "detaching" the local disk. | |
949 | * | |
950 | * 'remote' may become wrong any time because the network could fail. | |
951 | * | |
952 | * This is a harmless race condition, though, since it is handled | |
953 | * correctly at the appropriate places; so it just defers the failure | |
954 | * of the respective operation. | |
955 | */ | |
956 | ||
957 | /* mark them early for readability. | |
958 | * this just sets some state flags. */ | |
959 | if (remote) | |
960 | _req_mod(req, to_be_send); | |
961 | if (local) | |
962 | _req_mod(req, to_be_submitted); | |
963 | ||
964 | /* check this request on the collision detection hash tables. | |
965 | * if we have a conflict, just complete it here. | |
966 | * THINK do we want to check reads, too? (I don't think so...) */ | |
d28fd092 LE |
967 | if (rw == WRITE && _req_conflicts(req)) |
968 | goto fail_conflicting; | |
288f422e PR |
969 | |
970 | list_add_tail(&req->tl_requests, &mdev->newest_tle->requests); | |
971 | ||
b411b363 PR |
972 | /* NOTE remote first: to get the concurrent write detection right, |
973 | * we must register the request before start of local IO. */ | |
974 | if (remote) { | |
975 | /* either WRITE and C_CONNECTED, | |
976 | * or READ, and no local disk, | |
977 | * or READ, but not in sync. | |
978 | */ | |
979 | _req_mod(req, (rw == WRITE) | |
980 | ? queue_for_net_write | |
981 | : queue_for_net_read); | |
982 | } | |
73a01a18 PR |
983 | if (send_oos && drbd_set_out_of_sync(mdev, sector, size)) |
984 | _req_mod(req, queue_for_send_oos); | |
67531718 | 985 | |
73a01a18 PR |
986 | if (remote && |
987 | mdev->net_conf->on_congestion != OC_BLOCK && mdev->agreed_pro_version >= 96) { | |
67531718 PR |
988 | int congested = 0; |
989 | ||
990 | if (mdev->net_conf->cong_fill && | |
991 | atomic_read(&mdev->ap_in_flight) >= mdev->net_conf->cong_fill) { | |
992 | dev_info(DEV, "Congestion-fill threshold reached\n"); | |
993 | congested = 1; | |
994 | } | |
995 | ||
996 | if (mdev->act_log->used >= mdev->net_conf->cong_extents) { | |
997 | dev_info(DEV, "Congestion-extents threshold reached\n"); | |
998 | congested = 1; | |
999 | } | |
1000 | ||
1001 | if (congested) { | |
73a01a18 PR |
1002 | queue_barrier(mdev); |
1003 | ||
67531718 PR |
1004 | if (mdev->net_conf->on_congestion == OC_PULL_AHEAD) |
1005 | _drbd_set_state(_NS(mdev, conn, C_AHEAD), 0, NULL); | |
1006 | else /*mdev->net_conf->on_congestion == OC_DISCONNECT */ | |
1007 | _drbd_set_state(_NS(mdev, conn, C_DISCONNECTING), 0, NULL); | |
1008 | } | |
1009 | } | |
1010 | ||
b411b363 PR |
1011 | spin_unlock_irq(&mdev->req_lock); |
1012 | kfree(b); /* if someone else has beaten us to it... */ | |
1013 | ||
1014 | if (local) { | |
1015 | req->private_bio->bi_bdev = mdev->ldev->backing_bdev; | |
1016 | ||
6719fb03 LE |
1017 | /* State may have changed since we grabbed our reference on the |
1018 | * mdev->ldev member. Double check, and short-circuit to endio. | |
1019 | * In case the last activity log transaction failed to get on | |
1020 | * stable storage, and this is a WRITE, we may not even submit | |
1021 | * this bio. */ | |
1022 | if (get_ldev(mdev)) { | |
0cf9d27e AG |
1023 | if (drbd_insert_fault(mdev, rw == WRITE ? DRBD_FAULT_DT_WR |
1024 | : rw == READ ? DRBD_FAULT_DT_RD | |
1025 | : DRBD_FAULT_DT_RA)) | |
6719fb03 LE |
1026 | bio_endio(req->private_bio, -EIO); |
1027 | else | |
1028 | generic_make_request(req->private_bio); | |
1029 | put_ldev(mdev); | |
1030 | } else | |
b411b363 | 1031 | bio_endio(req->private_bio, -EIO); |
b411b363 PR |
1032 | } |
1033 | ||
b411b363 PR |
1034 | return 0; |
1035 | ||
d28fd092 LE |
1036 | fail_conflicting: |
1037 | /* this is a conflicting request. | |
1038 | * even though it may have been only _partially_ | |
1039 | * overlapping with one of the currently pending requests, | |
1040 | * without even submitting or sending it, we will | |
1041 | * pretend that it was successfully served right now. | |
1042 | */ | |
1043 | _drbd_end_io_acct(mdev, req); | |
1044 | spin_unlock_irq(&mdev->req_lock); | |
1045 | if (remote) | |
1046 | dec_ap_pending(mdev); | |
1047 | /* THINK: do we want to fail it (-EIO), or pretend success? | |
1048 | * this pretends success. */ | |
1049 | err = 0; | |
1050 | ||
b411b363 PR |
1051 | fail_free_complete: |
1052 | if (rw == WRITE && local) | |
1053 | drbd_al_complete_io(mdev, sector); | |
1054 | fail_and_free_req: | |
1055 | if (local) { | |
1056 | bio_put(req->private_bio); | |
1057 | req->private_bio = NULL; | |
1058 | put_ldev(mdev); | |
1059 | } | |
9a25a04c PR |
1060 | if (!ret) |
1061 | bio_endio(bio, err); | |
1062 | ||
b411b363 PR |
1063 | drbd_req_free(req); |
1064 | dec_ap_bio(mdev); | |
1065 | kfree(b); | |
1066 | ||
9a25a04c | 1067 | return ret; |
b411b363 PR |
1068 | } |
1069 | ||
1070 | /* helper function for drbd_make_request | |
1071 | * if we can determine just by the mdev (state) that this request will fail, | |
1072 | * return 1 | |
1073 | * otherwise return 0 | |
1074 | */ | |
1075 | static int drbd_fail_request_early(struct drbd_conf *mdev, int is_write) | |
1076 | { | |
b411b363 PR |
1077 | if (mdev->state.role != R_PRIMARY && |
1078 | (!allow_oos || is_write)) { | |
1079 | if (__ratelimit(&drbd_ratelimit_state)) { | |
1080 | dev_err(DEV, "Process %s[%u] tried to %s; " | |
1081 | "since we are not in Primary state, " | |
1082 | "we cannot allow this\n", | |
1083 | current->comm, current->pid, | |
1084 | is_write ? "WRITE" : "READ"); | |
1085 | } | |
1086 | return 1; | |
1087 | } | |
1088 | ||
b411b363 PR |
1089 | return 0; |
1090 | } | |
1091 | ||
2f58dcfc | 1092 | int drbd_make_request(struct request_queue *q, struct bio *bio) |
b411b363 PR |
1093 | { |
1094 | unsigned int s_enr, e_enr; | |
1095 | struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata; | |
aeda1cd6 | 1096 | unsigned long start_time; |
b411b363 PR |
1097 | |
1098 | if (drbd_fail_request_early(mdev, bio_data_dir(bio) & WRITE)) { | |
1099 | bio_endio(bio, -EPERM); | |
1100 | return 0; | |
1101 | } | |
1102 | ||
aeda1cd6 PR |
1103 | start_time = jiffies; |
1104 | ||
b411b363 PR |
1105 | /* |
1106 | * what we "blindly" assume: | |
1107 | */ | |
1108 | D_ASSERT(bio->bi_size > 0); | |
1109 | D_ASSERT((bio->bi_size & 0x1ff) == 0); | |
1110 | D_ASSERT(bio->bi_idx == 0); | |
1111 | ||
1112 | /* to make some things easier, force alignment of requests within the | |
1113 | * granularity of our hash tables */ | |
1114 | s_enr = bio->bi_sector >> HT_SHIFT; | |
1115 | e_enr = (bio->bi_sector+(bio->bi_size>>9)-1) >> HT_SHIFT; | |
1116 | ||
1117 | if (likely(s_enr == e_enr)) { | |
1118 | inc_ap_bio(mdev, 1); | |
aeda1cd6 | 1119 | return drbd_make_request_common(mdev, bio, start_time); |
b411b363 PR |
1120 | } |
1121 | ||
1122 | /* can this bio be split generically? | |
1123 | * Maybe add our own split-arbitrary-bios function. */ | |
1816a2b4 | 1124 | if (bio->bi_vcnt != 1 || bio->bi_idx != 0 || bio->bi_size > DRBD_MAX_BIO_SIZE) { |
b411b363 PR |
1125 | /* rather error out here than BUG in bio_split */ |
1126 | dev_err(DEV, "bio would need to, but cannot, be split: " | |
1127 | "(vcnt=%u,idx=%u,size=%u,sector=%llu)\n", | |
1128 | bio->bi_vcnt, bio->bi_idx, bio->bi_size, | |
1129 | (unsigned long long)bio->bi_sector); | |
1130 | bio_endio(bio, -EINVAL); | |
1131 | } else { | |
1132 | /* This bio crosses some boundary, so we have to split it. */ | |
1133 | struct bio_pair *bp; | |
1134 | /* works for the "do not cross hash slot boundaries" case | |
1135 | * e.g. sector 262269, size 4096 | |
1136 | * s_enr = 262269 >> 6 = 4097 | |
1137 | * e_enr = (262269+8-1) >> 6 = 4098 | |
1138 | * HT_SHIFT = 6 | |
1139 | * sps = 64, mask = 63 | |
1140 | * first_sectors = 64 - (262269 & 63) = 3 | |
1141 | */ | |
1142 | const sector_t sect = bio->bi_sector; | |
1143 | const int sps = 1 << HT_SHIFT; /* sectors per slot */ | |
1144 | const int mask = sps - 1; | |
1145 | const sector_t first_sectors = sps - (sect & mask); | |
1146 | bp = bio_split(bio, | |
1147 | #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,28) | |
1148 | bio_split_pool, | |
1149 | #endif | |
1150 | first_sectors); | |
1151 | ||
1152 | /* we need to get a "reference count" (ap_bio_cnt) | |
1153 | * to avoid races with the disconnect/reconnect/suspend code. | |
9a25a04c | 1154 | * In case we need to split the bio here, we need to get three references |
b411b363 PR |
1155 | * atomically, otherwise we might deadlock when trying to submit the |
1156 | * second one! */ | |
9a25a04c | 1157 | inc_ap_bio(mdev, 3); |
b411b363 PR |
1158 | |
1159 | D_ASSERT(e_enr == s_enr + 1); | |
1160 | ||
aeda1cd6 | 1161 | while (drbd_make_request_common(mdev, &bp->bio1, start_time)) |
9a25a04c PR |
1162 | inc_ap_bio(mdev, 1); |
1163 | ||
aeda1cd6 | 1164 | while (drbd_make_request_common(mdev, &bp->bio2, start_time)) |
9a25a04c PR |
1165 | inc_ap_bio(mdev, 1); |
1166 | ||
1167 | dec_ap_bio(mdev); | |
1168 | ||
b411b363 PR |
1169 | bio_pair_release(bp); |
1170 | } | |
1171 | return 0; | |
1172 | } | |
1173 | ||
1174 | /* This is called by bio_add_page(). With this function we reduce | |
1816a2b4 | 1175 | * the number of BIOs that span over multiple DRBD_MAX_BIO_SIZEs |
b411b363 PR |
1176 | * units (was AL_EXTENTs). |
1177 | * | |
1178 | * we do the calculation within the lower 32bit of the byte offsets, | |
1179 | * since we don't care for actual offset, but only check whether it | |
1180 | * would cross "activity log extent" boundaries. | |
1181 | * | |
1182 | * As long as the BIO is empty we have to allow at least one bvec, | |
1183 | * regardless of size and offset. so the resulting bio may still | |
1184 | * cross extent boundaries. those are dealt with (bio_split) in | |
2f58dcfc | 1185 | * drbd_make_request. |
b411b363 PR |
1186 | */ |
1187 | int drbd_merge_bvec(struct request_queue *q, struct bvec_merge_data *bvm, struct bio_vec *bvec) | |
1188 | { | |
1189 | struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata; | |
1190 | unsigned int bio_offset = | |
1191 | (unsigned int)bvm->bi_sector << 9; /* 32 bit */ | |
1192 | unsigned int bio_size = bvm->bi_size; | |
1193 | int limit, backing_limit; | |
1194 | ||
1816a2b4 LE |
1195 | limit = DRBD_MAX_BIO_SIZE |
1196 | - ((bio_offset & (DRBD_MAX_BIO_SIZE-1)) + bio_size); | |
b411b363 PR |
1197 | if (limit < 0) |
1198 | limit = 0; | |
1199 | if (bio_size == 0) { | |
1200 | if (limit <= bvec->bv_len) | |
1201 | limit = bvec->bv_len; | |
1202 | } else if (limit && get_ldev(mdev)) { | |
1203 | struct request_queue * const b = | |
1204 | mdev->ldev->backing_bdev->bd_disk->queue; | |
a1c88d0d | 1205 | if (b->merge_bvec_fn) { |
b411b363 PR |
1206 | backing_limit = b->merge_bvec_fn(b, bvm, bvec); |
1207 | limit = min(limit, backing_limit); | |
1208 | } | |
1209 | put_ldev(mdev); | |
1210 | } | |
1211 | return limit; | |
1212 | } |