blob: d9df1a1c40b9ccdb1e99cb9ceecd0d1e39152a00 [file] [log] [blame]
Philipp Reisnerb411b362009-09-25 16:07:19 -07001/*
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
Philipp Reisnerb411b362009-09-25 16:07:19 -070026#include <linux/module.h>
27
28#include <linux/slab.h>
29#include <linux/drbd.h>
30#include "drbd_int.h"
Philipp Reisnerb411b362009-09-25 16:07:19 -070031#include "drbd_req.h"
32
33
34/* Update disk stats at start of I/O request */
35static 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));
Philipp Reisner753c8912009-11-18 15:52:51 +010042 part_inc_in_flight(&mdev->vdisk->part0, rw);
Philipp Reisnerb411b362009-09-25 16:07:19 -070043 part_stat_unlock();
Philipp Reisnerb411b362009-09-25 16:07:19 -070044}
45
46/* Update disk stats when completing request upwards */
47static 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);
Philipp Reisner753c8912009-11-18 15:52:51 +010055 part_dec_in_flight(&mdev->vdisk->part0, rw);
Philipp Reisnerb411b362009-09-25 16:07:19 -070056 part_stat_unlock();
Philipp Reisnerb411b362009-09-25 16:07:19 -070057}
58
59static void _req_is_done(struct drbd_conf *mdev, struct drbd_request *req, const int rw)
60{
61 const unsigned long s = req->rq_state;
Philipp Reisner288f4222010-05-27 15:07:43 +020062
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
Philipp Reisnerb411b362009-09-25 16:07:19 -070071 /* 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) {
Philipp Reisnerb411b362009-09-25 16:07:19 -070075 /* 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)) {
97 drbd_al_complete_io(mdev, req->sector);
98 put_ldev(mdev);
99 } else if (__ratelimit(&drbd_ratelimit_state)) {
100 dev_warn(DEV, "Should have called drbd_al_complete_io(, %llu), "
101 "but my Disk seems to have failed :(\n",
102 (unsigned long long) req->sector);
103 }
104 }
105 }
106
Philipp Reisner32fa7e92010-05-26 17:13:18 +0200107 drbd_req_free(req);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700108}
109
110static void queue_barrier(struct drbd_conf *mdev)
111{
112 struct drbd_tl_epoch *b;
113
114 /* We are within the req_lock. Once we queued the barrier for sending,
115 * we set the CREATE_BARRIER bit. It is cleared as soon as a new
116 * barrier/epoch object is added. This is the only place this bit is
117 * set. It indicates that the barrier for this epoch is already queued,
118 * and no new epoch has been created yet. */
119 if (test_bit(CREATE_BARRIER, &mdev->flags))
120 return;
121
122 b = mdev->newest_tle;
123 b->w.cb = w_send_barrier;
124 /* inc_ap_pending done here, so we won't
125 * get imbalanced on connection loss.
126 * dec_ap_pending will be done in got_BarrierAck
127 * or (on connection loss) in tl_clear. */
128 inc_ap_pending(mdev);
129 drbd_queue_work(&mdev->data.work, &b->w);
130 set_bit(CREATE_BARRIER, &mdev->flags);
131}
132
133static void _about_to_complete_local_write(struct drbd_conf *mdev,
134 struct drbd_request *req)
135{
136 const unsigned long s = req->rq_state;
137 struct drbd_request *i;
138 struct drbd_epoch_entry *e;
139 struct hlist_node *n;
140 struct hlist_head *slot;
141
142 /* before we can signal completion to the upper layers,
143 * we may need to close the current epoch */
144 if (mdev->state.conn >= C_CONNECTED &&
145 req->epoch == mdev->newest_tle->br_number)
146 queue_barrier(mdev);
147
148 /* we need to do the conflict detection stuff,
149 * if we have the ee_hash (two_primaries) and
150 * this has been on the network */
151 if ((s & RQ_NET_DONE) && mdev->ee_hash != NULL) {
152 const sector_t sector = req->sector;
153 const int size = req->size;
154
155 /* ASSERT:
156 * there must be no conflicting requests, since
157 * they must have been failed on the spot */
158#define OVERLAPS overlaps(sector, size, i->sector, i->size)
159 slot = tl_hash_slot(mdev, sector);
160 hlist_for_each_entry(i, n, slot, colision) {
161 if (OVERLAPS) {
162 dev_alert(DEV, "LOGIC BUG: completed: %p %llus +%u; "
163 "other: %p %llus +%u\n",
164 req, (unsigned long long)sector, size,
165 i, (unsigned long long)i->sector, i->size);
166 }
167 }
168
169 /* maybe "wake" those conflicting epoch entries
170 * that wait for this request to finish.
171 *
172 * currently, there can be only _one_ such ee
173 * (well, or some more, which would be pending
174 * P_DISCARD_ACK not yet sent by the asender...),
175 * since we block the receiver thread upon the
176 * first conflict detection, which will wait on
177 * misc_wait. maybe we want to assert that?
178 *
179 * anyways, if we found one,
180 * we just have to do a wake_up. */
181#undef OVERLAPS
182#define OVERLAPS overlaps(sector, size, e->sector, e->size)
183 slot = ee_hash_slot(mdev, req->sector);
184 hlist_for_each_entry(e, n, slot, colision) {
185 if (OVERLAPS) {
186 wake_up(&mdev->misc_wait);
187 break;
188 }
189 }
190 }
191#undef OVERLAPS
192}
193
194void complete_master_bio(struct drbd_conf *mdev,
195 struct bio_and_error *m)
196{
Philipp Reisnerb411b362009-09-25 16:07:19 -0700197 bio_endio(m->bio, m->error);
198 dec_ap_bio(mdev);
199}
200
201/* Helper for __req_mod().
202 * Set m->bio to the master bio, if it is fit to be completed,
203 * or leave it alone (it is initialized to NULL in __req_mod),
204 * if it has already been completed, or cannot be completed yet.
205 * If m->bio is set, the error status to be returned is placed in m->error.
206 */
207void _req_may_be_done(struct drbd_request *req, struct bio_and_error *m)
208{
209 const unsigned long s = req->rq_state;
210 struct drbd_conf *mdev = req->mdev;
211 /* only WRITES may end up here without a master bio (on barrier ack) */
212 int rw = req->master_bio ? bio_data_dir(req->master_bio) : WRITE;
213
Philipp Reisnerb411b362009-09-25 16:07:19 -0700214 /* we must not complete the master bio, while it is
215 * still being processed by _drbd_send_zc_bio (drbd_send_dblock)
216 * not yet acknowledged by the peer
217 * not yet completed by the local io subsystem
218 * these flags may get cleared in any order by
219 * the worker,
220 * the receiver,
221 * the bio_endio completion callbacks.
222 */
223 if (s & RQ_NET_QUEUED)
224 return;
225 if (s & RQ_NET_PENDING)
226 return;
227 if (s & RQ_LOCAL_PENDING)
228 return;
229
230 if (req->master_bio) {
231 /* this is data_received (remote read)
232 * or protocol C P_WRITE_ACK
233 * or protocol B P_RECV_ACK
234 * or protocol A "handed_over_to_network" (SendAck)
235 * or canceled or failed,
236 * or killed from the transfer log due to connection loss.
237 */
238
239 /*
240 * figure out whether to report success or failure.
241 *
242 * report success when at least one of the operations succeeded.
243 * or, to put the other way,
244 * only report failure, when both operations failed.
245 *
246 * what to do about the failures is handled elsewhere.
247 * what we need to do here is just: complete the master_bio.
248 *
249 * local completion error, if any, has been stored as ERR_PTR
250 * in private_bio within drbd_endio_pri.
251 */
252 int ok = (s & RQ_LOCAL_OK) || (s & RQ_NET_OK);
253 int error = PTR_ERR(req->private_bio);
254
255 /* remove the request from the conflict detection
256 * respective block_id verification hash */
257 if (!hlist_unhashed(&req->colision))
258 hlist_del(&req->colision);
259 else
260 D_ASSERT((s & RQ_NET_MASK) == 0);
261
262 /* for writes we need to do some extra housekeeping */
263 if (rw == WRITE)
264 _about_to_complete_local_write(mdev, req);
265
266 /* Update disk stats */
267 _drbd_end_io_acct(mdev, req);
268
269 m->error = ok ? 0 : (error ?: -EIO);
270 m->bio = req->master_bio;
271 req->master_bio = NULL;
272 }
273
274 if ((s & RQ_NET_MASK) == 0 || (s & RQ_NET_DONE)) {
275 /* this is disconnected (local only) operation,
276 * or protocol C P_WRITE_ACK,
277 * or protocol A or B P_BARRIER_ACK,
278 * or killed from the transfer log due to connection loss. */
279 _req_is_done(mdev, req, rw);
280 }
281 /* else: network part and not DONE yet. that is
282 * protocol A or B, barrier ack still pending... */
283}
284
285/*
286 * checks whether there was an overlapping request
287 * or ee already registered.
288 *
289 * if so, return 1, in which case this request is completed on the spot,
290 * without ever being submitted or send.
291 *
292 * return 0 if it is ok to submit this request.
293 *
294 * NOTE:
295 * paranoia: assume something above us is broken, and issues different write
296 * requests for the same block simultaneously...
297 *
298 * To ensure these won't be reordered differently on both nodes, resulting in
299 * diverging data sets, we discard the later one(s). Not that this is supposed
300 * to happen, but this is the rationale why we also have to check for
301 * conflicting requests with local origin, and why we have to do so regardless
302 * of whether we allowed multiple primaries.
303 *
304 * BTW, in case we only have one primary, the ee_hash is empty anyways, and the
305 * second hlist_for_each_entry becomes a noop. This is even simpler than to
306 * grab a reference on the net_conf, and check for the two_primaries flag...
307 */
308static int _req_conflicts(struct drbd_request *req)
309{
310 struct drbd_conf *mdev = req->mdev;
311 const sector_t sector = req->sector;
312 const int size = req->size;
313 struct drbd_request *i;
314 struct drbd_epoch_entry *e;
315 struct hlist_node *n;
316 struct hlist_head *slot;
317
318 D_ASSERT(hlist_unhashed(&req->colision));
319
320 if (!get_net_conf(mdev))
321 return 0;
322
323 /* BUG_ON */
324 ERR_IF (mdev->tl_hash_s == 0)
325 goto out_no_conflict;
326 BUG_ON(mdev->tl_hash == NULL);
327
328#define OVERLAPS overlaps(i->sector, i->size, sector, size)
329 slot = tl_hash_slot(mdev, sector);
330 hlist_for_each_entry(i, n, slot, colision) {
331 if (OVERLAPS) {
332 dev_alert(DEV, "%s[%u] Concurrent local write detected! "
333 "[DISCARD L] new: %llus +%u; "
334 "pending: %llus +%u\n",
335 current->comm, current->pid,
336 (unsigned long long)sector, size,
337 (unsigned long long)i->sector, i->size);
338 goto out_conflict;
339 }
340 }
341
342 if (mdev->ee_hash_s) {
343 /* now, check for overlapping requests with remote origin */
344 BUG_ON(mdev->ee_hash == NULL);
345#undef OVERLAPS
346#define OVERLAPS overlaps(e->sector, e->size, sector, size)
347 slot = ee_hash_slot(mdev, sector);
348 hlist_for_each_entry(e, n, slot, colision) {
349 if (OVERLAPS) {
350 dev_alert(DEV, "%s[%u] Concurrent remote write detected!"
351 " [DISCARD L] new: %llus +%u; "
352 "pending: %llus +%u\n",
353 current->comm, current->pid,
354 (unsigned long long)sector, size,
355 (unsigned long long)e->sector, e->size);
356 goto out_conflict;
357 }
358 }
359 }
360#undef OVERLAPS
361
362out_no_conflict:
363 /* this is like it should be, and what we expected.
364 * our users do behave after all... */
365 put_net_conf(mdev);
366 return 0;
367
368out_conflict:
369 put_net_conf(mdev);
370 return 1;
371}
372
373/* obviously this could be coded as many single functions
374 * instead of one huge switch,
375 * or by putting the code directly in the respective locations
376 * (as it has been before).
377 *
378 * but having it this way
379 * enforces that it is all in this one place, where it is easier to audit,
380 * it makes it obvious that whatever "event" "happens" to a request should
381 * happen "atomically" within the req_lock,
382 * and it enforces that we have to think in a very structured manner
383 * about the "events" that may happen to a request during its life time ...
384 */
Philipp Reisner2a806992010-06-09 14:07:43 +0200385int __req_mod(struct drbd_request *req, enum drbd_req_event what,
Philipp Reisnerb411b362009-09-25 16:07:19 -0700386 struct bio_and_error *m)
387{
388 struct drbd_conf *mdev = req->mdev;
Philipp Reisner2a806992010-06-09 14:07:43 +0200389 int rv = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700390 m->bio = NULL;
391
Philipp Reisnerb411b362009-09-25 16:07:19 -0700392 switch (what) {
393 default:
394 dev_err(DEV, "LOGIC BUG in %s:%u\n", __FILE__ , __LINE__);
395 break;
396
397 /* does not happen...
398 * initialization done in drbd_req_new
399 case created:
400 break;
401 */
402
403 case to_be_send: /* via network */
404 /* reached via drbd_make_request_common
405 * and from w_read_retry_remote */
406 D_ASSERT(!(req->rq_state & RQ_NET_MASK));
407 req->rq_state |= RQ_NET_PENDING;
408 inc_ap_pending(mdev);
409 break;
410
411 case to_be_submitted: /* locally */
412 /* reached via drbd_make_request_common */
413 D_ASSERT(!(req->rq_state & RQ_LOCAL_MASK));
414 req->rq_state |= RQ_LOCAL_PENDING;
415 break;
416
417 case completed_ok:
418 if (bio_data_dir(req->master_bio) == WRITE)
419 mdev->writ_cnt += req->size>>9;
420 else
421 mdev->read_cnt += req->size>>9;
422
423 req->rq_state |= (RQ_LOCAL_COMPLETED|RQ_LOCAL_OK);
424 req->rq_state &= ~RQ_LOCAL_PENDING;
425
426 _req_may_be_done(req, m);
427 put_ldev(mdev);
428 break;
429
430 case write_completed_with_error:
431 req->rq_state |= RQ_LOCAL_COMPLETED;
432 req->rq_state &= ~RQ_LOCAL_PENDING;
433
Philipp Reisnerb411b362009-09-25 16:07:19 -0700434 __drbd_chk_io_error(mdev, FALSE);
435 _req_may_be_done(req, m);
436 put_ldev(mdev);
437 break;
438
439 case read_ahead_completed_with_error:
440 /* it is legal to fail READA */
441 req->rq_state |= RQ_LOCAL_COMPLETED;
442 req->rq_state &= ~RQ_LOCAL_PENDING;
443 _req_may_be_done(req, m);
444 put_ldev(mdev);
445 break;
446
447 case read_completed_with_error:
448 drbd_set_out_of_sync(mdev, req->sector, req->size);
449
450 req->rq_state |= RQ_LOCAL_COMPLETED;
451 req->rq_state &= ~RQ_LOCAL_PENDING;
452
Philipp Reisnerb411b362009-09-25 16:07:19 -0700453 D_ASSERT(!(req->rq_state & RQ_NET_MASK));
Philipp Reisnerb411b362009-09-25 16:07:19 -0700454
455 __drbd_chk_io_error(mdev, FALSE);
456 put_ldev(mdev);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700457
Lars Ellenbergd255e5f2010-05-27 09:45:45 +0200458 /* no point in retrying if there is no good remote data,
459 * or we have no connection. */
460 if (mdev->state.pdsk != D_UP_TO_DATE) {
461 _req_may_be_done(req, m);
462 break;
463 }
464
465 /* _req_mod(req,to_be_send); oops, recursion... */
466 req->rq_state |= RQ_NET_PENDING;
467 inc_ap_pending(mdev);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700468 /* fall through: _req_mod(req,queue_for_net_read); */
469
470 case queue_for_net_read:
471 /* READ or READA, and
472 * no local disk,
473 * or target area marked as invalid,
474 * or just got an io-error. */
475 /* from drbd_make_request_common
476 * or from bio_endio during read io-error recovery */
477
478 /* so we can verify the handle in the answer packet
479 * corresponding hlist_del is in _req_may_be_done() */
480 hlist_add_head(&req->colision, ar_hash_slot(mdev, req->sector));
481
Lars Ellenberg83c38832009-11-03 02:22:06 +0100482 set_bit(UNPLUG_REMOTE, &mdev->flags);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700483
484 D_ASSERT(req->rq_state & RQ_NET_PENDING);
485 req->rq_state |= RQ_NET_QUEUED;
486 req->w.cb = (req->rq_state & RQ_LOCAL_MASK)
487 ? w_read_retry_remote
488 : w_send_read_req;
489 drbd_queue_work(&mdev->data.work, &req->w);
490 break;
491
492 case queue_for_net_write:
493 /* assert something? */
494 /* from drbd_make_request_common only */
495
496 hlist_add_head(&req->colision, tl_hash_slot(mdev, req->sector));
497 /* corresponding hlist_del is in _req_may_be_done() */
498
499 /* NOTE
500 * In case the req ended up on the transfer log before being
501 * queued on the worker, it could lead to this request being
502 * missed during cleanup after connection loss.
503 * So we have to do both operations here,
504 * within the same lock that protects the transfer log.
505 *
506 * _req_add_to_epoch(req); this has to be after the
507 * _maybe_start_new_epoch(req); which happened in
508 * drbd_make_request_common, because we now may set the bit
509 * again ourselves to close the current epoch.
510 *
511 * Add req to the (now) current epoch (barrier). */
512
Lars Ellenberg83c38832009-11-03 02:22:06 +0100513 /* otherwise we may lose an unplug, which may cause some remote
514 * io-scheduler timeout to expire, increasing maximum latency,
515 * hurting performance. */
516 set_bit(UNPLUG_REMOTE, &mdev->flags);
517
Philipp Reisnerb411b362009-09-25 16:07:19 -0700518 /* see drbd_make_request_common,
519 * just after it grabs the req_lock */
520 D_ASSERT(test_bit(CREATE_BARRIER, &mdev->flags) == 0);
521
522 req->epoch = mdev->newest_tle->br_number;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700523
524 /* increment size of current epoch */
Philipp Reisner7e602c02010-05-27 14:49:27 +0200525 mdev->newest_tle->n_writes++;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700526
527 /* queue work item to send data */
528 D_ASSERT(req->rq_state & RQ_NET_PENDING);
529 req->rq_state |= RQ_NET_QUEUED;
530 req->w.cb = w_send_dblock;
531 drbd_queue_work(&mdev->data.work, &req->w);
532
533 /* close the epoch, in case it outgrew the limit */
Philipp Reisner7e602c02010-05-27 14:49:27 +0200534 if (mdev->newest_tle->n_writes >= mdev->net_conf->max_epoch_size)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700535 queue_barrier(mdev);
536
537 break;
538
539 case send_canceled:
540 /* treat it the same */
541 case send_failed:
542 /* real cleanup will be done from tl_clear. just update flags
543 * so it is no longer marked as on the worker queue */
544 req->rq_state &= ~RQ_NET_QUEUED;
545 /* if we did it right, tl_clear should be scheduled only after
546 * this, so this should not be necessary! */
547 _req_may_be_done(req, m);
548 break;
549
550 case handed_over_to_network:
551 /* assert something? */
552 if (bio_data_dir(req->master_bio) == WRITE &&
553 mdev->net_conf->wire_protocol == DRBD_PROT_A) {
554 /* this is what is dangerous about protocol A:
555 * pretend it was successfully written on the peer. */
556 if (req->rq_state & RQ_NET_PENDING) {
557 dec_ap_pending(mdev);
558 req->rq_state &= ~RQ_NET_PENDING;
559 req->rq_state |= RQ_NET_OK;
560 } /* else: neg-ack was faster... */
561 /* it is still not yet RQ_NET_DONE until the
562 * corresponding epoch barrier got acked as well,
563 * so we know what to dirty on connection loss */
564 }
565 req->rq_state &= ~RQ_NET_QUEUED;
566 req->rq_state |= RQ_NET_SENT;
567 /* because _drbd_send_zc_bio could sleep, and may want to
568 * dereference the bio even after the "write_acked_by_peer" and
569 * "completed_ok" events came in, once we return from
570 * _drbd_send_zc_bio (drbd_send_dblock), we have to check
571 * whether it is done already, and end it. */
572 _req_may_be_done(req, m);
573 break;
574
Lars Ellenbergd255e5f2010-05-27 09:45:45 +0200575 case read_retry_remote_canceled:
576 req->rq_state &= ~RQ_NET_QUEUED;
577 /* fall through, in case we raced with drbd_disconnect */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700578 case connection_lost_while_pending:
579 /* transfer log cleanup after connection loss */
580 /* assert something? */
581 if (req->rq_state & RQ_NET_PENDING)
582 dec_ap_pending(mdev);
583 req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING);
584 req->rq_state |= RQ_NET_DONE;
585 /* if it is still queued, we may not complete it here.
586 * it will be canceled soon. */
587 if (!(req->rq_state & RQ_NET_QUEUED))
588 _req_may_be_done(req, m);
589 break;
590
591 case write_acked_by_peer_and_sis:
592 req->rq_state |= RQ_NET_SIS;
593 case conflict_discarded_by_peer:
594 /* for discarded conflicting writes of multiple primaries,
595 * there is no need to keep anything in the tl, potential
596 * node crashes are covered by the activity log. */
597 if (what == conflict_discarded_by_peer)
598 dev_alert(DEV, "Got DiscardAck packet %llus +%u!"
599 " DRBD is not a random data generator!\n",
600 (unsigned long long)req->sector, req->size);
601 req->rq_state |= RQ_NET_DONE;
602 /* fall through */
603 case write_acked_by_peer:
604 /* protocol C; successfully written on peer.
605 * Nothing to do here.
606 * We want to keep the tl in place for all protocols, to cater
607 * for volatile write-back caches on lower level devices.
608 *
609 * A barrier request is expected to have forced all prior
610 * requests onto stable storage, so completion of a barrier
611 * request could set NET_DONE right here, and not wait for the
612 * P_BARRIER_ACK, but that is an unnecessary optimization. */
613
614 /* this makes it effectively the same as for: */
615 case recv_acked_by_peer:
616 /* protocol B; pretends to be successfully written on peer.
617 * see also notes above in handed_over_to_network about
618 * protocol != C */
619 req->rq_state |= RQ_NET_OK;
620 D_ASSERT(req->rq_state & RQ_NET_PENDING);
621 dec_ap_pending(mdev);
622 req->rq_state &= ~RQ_NET_PENDING;
623 _req_may_be_done(req, m);
624 break;
625
626 case neg_acked:
627 /* assert something? */
628 if (req->rq_state & RQ_NET_PENDING)
629 dec_ap_pending(mdev);
630 req->rq_state &= ~(RQ_NET_OK|RQ_NET_PENDING);
631
632 req->rq_state |= RQ_NET_DONE;
633 _req_may_be_done(req, m);
634 /* else: done by handed_over_to_network */
635 break;
636
637 case barrier_acked:
Philipp Reisner288f4222010-05-27 15:07:43 +0200638 if (!(req->rq_state & RQ_WRITE))
639 break;
640
Philipp Reisnerb411b362009-09-25 16:07:19 -0700641 if (req->rq_state & RQ_NET_PENDING) {
642 /* barrier came in before all requests have been acked.
643 * this is bad, because if the connection is lost now,
644 * we won't be able to clean them up... */
645 dev_err(DEV, "FIXME (barrier_acked but pending)\n");
Philipp Reisnerb411b362009-09-25 16:07:19 -0700646 list_move(&req->tl_requests, &mdev->out_of_sequence_requests);
647 }
648 D_ASSERT(req->rq_state & RQ_NET_SENT);
649 req->rq_state |= RQ_NET_DONE;
650 _req_may_be_done(req, m);
651 break;
652
653 case data_received:
654 D_ASSERT(req->rq_state & RQ_NET_PENDING);
655 dec_ap_pending(mdev);
656 req->rq_state &= ~RQ_NET_PENDING;
657 req->rq_state |= (RQ_NET_OK|RQ_NET_DONE);
658 _req_may_be_done(req, m);
659 break;
660 };
Philipp Reisner2a806992010-06-09 14:07:43 +0200661
662 return rv;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700663}
664
665/* we may do a local read if:
666 * - we are consistent (of course),
667 * - or we are generally inconsistent,
668 * BUT we are still/already IN SYNC for this area.
669 * since size may be bigger than BM_BLOCK_SIZE,
670 * we may need to check several bits.
671 */
672static int drbd_may_do_local_read(struct drbd_conf *mdev, sector_t sector, int size)
673{
674 unsigned long sbnr, ebnr;
675 sector_t esector, nr_sectors;
676
677 if (mdev->state.disk == D_UP_TO_DATE)
678 return 1;
679 if (mdev->state.disk >= D_OUTDATED)
680 return 0;
681 if (mdev->state.disk < D_INCONSISTENT)
682 return 0;
683 /* state.disk == D_INCONSISTENT We will have a look at the BitMap */
684 nr_sectors = drbd_get_capacity(mdev->this_bdev);
685 esector = sector + (size >> 9) - 1;
686
687 D_ASSERT(sector < nr_sectors);
688 D_ASSERT(esector < nr_sectors);
689
690 sbnr = BM_SECT_TO_BIT(sector);
691 ebnr = BM_SECT_TO_BIT(esector);
692
693 return 0 == drbd_bm_count_bits(mdev, sbnr, ebnr);
694}
695
696static int drbd_make_request_common(struct drbd_conf *mdev, struct bio *bio)
697{
698 const int rw = bio_rw(bio);
699 const int size = bio->bi_size;
700 const sector_t sector = bio->bi_sector;
701 struct drbd_tl_epoch *b = NULL;
702 struct drbd_request *req;
703 int local, remote;
704 int err = -EIO;
Philipp Reisner9a25a042010-05-10 16:42:23 +0200705 int ret = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700706
707 /* allocate outside of all locks; */
708 req = drbd_req_new(mdev, bio);
709 if (!req) {
710 dec_ap_bio(mdev);
711 /* only pass the error to the upper layers.
712 * if user cannot handle io errors, that's not our business. */
713 dev_err(DEV, "could not kmalloc() req\n");
714 bio_endio(bio, -ENOMEM);
715 return 0;
716 }
717
Philipp Reisnerb411b362009-09-25 16:07:19 -0700718 local = get_ldev(mdev);
719 if (!local) {
720 bio_put(req->private_bio); /* or we get a bio leak */
721 req->private_bio = NULL;
722 }
723 if (rw == WRITE) {
724 remote = 1;
725 } else {
726 /* READ || READA */
727 if (local) {
728 if (!drbd_may_do_local_read(mdev, sector, size)) {
729 /* we could kick the syncer to
730 * sync this extent asap, wait for
731 * it, then continue locally.
732 * Or just issue the request remotely.
733 */
734 local = 0;
735 bio_put(req->private_bio);
736 req->private_bio = NULL;
737 put_ldev(mdev);
738 }
739 }
740 remote = !local && mdev->state.pdsk >= D_UP_TO_DATE;
741 }
742
743 /* If we have a disk, but a READA request is mapped to remote,
744 * we are R_PRIMARY, D_INCONSISTENT, SyncTarget.
745 * Just fail that READA request right here.
746 *
747 * THINK: maybe fail all READA when not local?
748 * or make this configurable...
749 * if network is slow, READA won't do any good.
750 */
751 if (rw == READA && mdev->state.disk >= D_INCONSISTENT && !local) {
752 err = -EWOULDBLOCK;
753 goto fail_and_free_req;
754 }
755
756 /* For WRITES going to the local disk, grab a reference on the target
757 * extent. This waits for any resync activity in the corresponding
758 * resync extent to finish, and, if necessary, pulls in the target
759 * extent into the activity log, which involves further disk io because
760 * of transactional on-disk meta data updates. */
761 if (rw == WRITE && local)
762 drbd_al_begin_io(mdev, sector);
763
764 remote = remote && (mdev->state.pdsk == D_UP_TO_DATE ||
765 (mdev->state.pdsk == D_INCONSISTENT &&
766 mdev->state.conn >= C_CONNECTED));
767
Philipp Reisner9a25a042010-05-10 16:42:23 +0200768 if (!(local || remote) && !mdev->state.susp) {
Philipp Reisnerb411b362009-09-25 16:07:19 -0700769 dev_err(DEV, "IO ERROR: neither local nor remote disk\n");
770 goto fail_free_complete;
771 }
772
773 /* For WRITE request, we have to make sure that we have an
774 * unused_spare_tle, in case we need to start a new epoch.
775 * I try to be smart and avoid to pre-allocate always "just in case",
776 * but there is a race between testing the bit and pointer outside the
777 * spinlock, and grabbing the spinlock.
778 * if we lost that race, we retry. */
779 if (rw == WRITE && remote &&
780 mdev->unused_spare_tle == NULL &&
781 test_bit(CREATE_BARRIER, &mdev->flags)) {
782allocate_barrier:
783 b = kmalloc(sizeof(struct drbd_tl_epoch), GFP_NOIO);
784 if (!b) {
785 dev_err(DEV, "Failed to alloc barrier.\n");
786 err = -ENOMEM;
787 goto fail_free_complete;
788 }
789 }
790
791 /* GOOD, everything prepared, grab the spin_lock */
792 spin_lock_irq(&mdev->req_lock);
793
Philipp Reisner9a25a042010-05-10 16:42:23 +0200794 if (mdev->state.susp) {
795 /* If we got suspended, use the retry mechanism of
796 generic_make_request() to restart processing of this
797 bio. In the next call to drbd_make_request_26
798 we sleep in inc_ap_bio() */
799 ret = 1;
800 spin_unlock_irq(&mdev->req_lock);
801 goto fail_free_complete;
802 }
803
Philipp Reisnerb411b362009-09-25 16:07:19 -0700804 if (remote) {
805 remote = (mdev->state.pdsk == D_UP_TO_DATE ||
806 (mdev->state.pdsk == D_INCONSISTENT &&
807 mdev->state.conn >= C_CONNECTED));
808 if (!remote)
809 dev_warn(DEV, "lost connection while grabbing the req_lock!\n");
810 if (!(local || remote)) {
811 dev_err(DEV, "IO ERROR: neither local nor remote disk\n");
812 spin_unlock_irq(&mdev->req_lock);
813 goto fail_free_complete;
814 }
815 }
816
817 if (b && mdev->unused_spare_tle == NULL) {
818 mdev->unused_spare_tle = b;
819 b = NULL;
820 }
821 if (rw == WRITE && remote &&
822 mdev->unused_spare_tle == NULL &&
823 test_bit(CREATE_BARRIER, &mdev->flags)) {
824 /* someone closed the current epoch
825 * while we were grabbing the spinlock */
826 spin_unlock_irq(&mdev->req_lock);
827 goto allocate_barrier;
828 }
829
830
831 /* Update disk stats */
832 _drbd_start_io_acct(mdev, req, bio);
833
834 /* _maybe_start_new_epoch(mdev);
835 * If we need to generate a write barrier packet, we have to add the
836 * new epoch (barrier) object, and queue the barrier packet for sending,
837 * and queue the req's data after it _within the same lock_, otherwise
838 * we have race conditions were the reorder domains could be mixed up.
839 *
840 * Even read requests may start a new epoch and queue the corresponding
841 * barrier packet. To get the write ordering right, we only have to
842 * make sure that, if this is a write request and it triggered a
843 * barrier packet, this request is queued within the same spinlock. */
844 if (remote && mdev->unused_spare_tle &&
845 test_and_clear_bit(CREATE_BARRIER, &mdev->flags)) {
846 _tl_add_barrier(mdev, mdev->unused_spare_tle);
847 mdev->unused_spare_tle = NULL;
848 } else {
849 D_ASSERT(!(remote && rw == WRITE &&
850 test_bit(CREATE_BARRIER, &mdev->flags)));
851 }
852
853 /* NOTE
854 * Actually, 'local' may be wrong here already, since we may have failed
855 * to write to the meta data, and may become wrong anytime because of
856 * local io-error for some other request, which would lead to us
857 * "detaching" the local disk.
858 *
859 * 'remote' may become wrong any time because the network could fail.
860 *
861 * This is a harmless race condition, though, since it is handled
862 * correctly at the appropriate places; so it just defers the failure
863 * of the respective operation.
864 */
865
866 /* mark them early for readability.
867 * this just sets some state flags. */
868 if (remote)
869 _req_mod(req, to_be_send);
870 if (local)
871 _req_mod(req, to_be_submitted);
872
873 /* check this request on the collision detection hash tables.
874 * if we have a conflict, just complete it here.
875 * THINK do we want to check reads, too? (I don't think so...) */
876 if (rw == WRITE && _req_conflicts(req)) {
877 /* this is a conflicting request.
878 * even though it may have been only _partially_
879 * overlapping with one of the currently pending requests,
880 * without even submitting or sending it, we will
881 * pretend that it was successfully served right now.
882 */
883 if (local) {
884 bio_put(req->private_bio);
885 req->private_bio = NULL;
886 drbd_al_complete_io(mdev, req->sector);
887 put_ldev(mdev);
888 local = 0;
889 }
890 if (remote)
891 dec_ap_pending(mdev);
892 _drbd_end_io_acct(mdev, req);
893 /* THINK: do we want to fail it (-EIO), or pretend success? */
894 bio_endio(req->master_bio, 0);
895 req->master_bio = NULL;
896 dec_ap_bio(mdev);
897 drbd_req_free(req);
898 remote = 0;
899 }
900
Philipp Reisner288f4222010-05-27 15:07:43 +0200901
902 list_add_tail(&req->tl_requests, &mdev->newest_tle->requests);
903
Philipp Reisnerb411b362009-09-25 16:07:19 -0700904 /* NOTE remote first: to get the concurrent write detection right,
905 * we must register the request before start of local IO. */
906 if (remote) {
907 /* either WRITE and C_CONNECTED,
908 * or READ, and no local disk,
909 * or READ, but not in sync.
910 */
911 _req_mod(req, (rw == WRITE)
912 ? queue_for_net_write
913 : queue_for_net_read);
914 }
915 spin_unlock_irq(&mdev->req_lock);
916 kfree(b); /* if someone else has beaten us to it... */
917
918 if (local) {
919 req->private_bio->bi_bdev = mdev->ldev->backing_bdev;
920
Philipp Reisnerb411b362009-09-25 16:07:19 -0700921 if (FAULT_ACTIVE(mdev, rw == WRITE ? DRBD_FAULT_DT_WR
922 : rw == READ ? DRBD_FAULT_DT_RD
923 : DRBD_FAULT_DT_RA))
924 bio_endio(req->private_bio, -EIO);
925 else
926 generic_make_request(req->private_bio);
927 }
928
929 /* we need to plug ALWAYS since we possibly need to kick lo_dev.
930 * we plug after submit, so we won't miss an unplug event */
931 drbd_plug_device(mdev);
932
933 return 0;
934
935fail_free_complete:
936 if (rw == WRITE && local)
937 drbd_al_complete_io(mdev, sector);
938fail_and_free_req:
939 if (local) {
940 bio_put(req->private_bio);
941 req->private_bio = NULL;
942 put_ldev(mdev);
943 }
Philipp Reisner9a25a042010-05-10 16:42:23 +0200944 if (!ret)
945 bio_endio(bio, err);
946
Philipp Reisnerb411b362009-09-25 16:07:19 -0700947 drbd_req_free(req);
948 dec_ap_bio(mdev);
949 kfree(b);
950
Philipp Reisner9a25a042010-05-10 16:42:23 +0200951 return ret;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700952}
953
954/* helper function for drbd_make_request
955 * if we can determine just by the mdev (state) that this request will fail,
956 * return 1
957 * otherwise return 0
958 */
959static int drbd_fail_request_early(struct drbd_conf *mdev, int is_write)
960{
Philipp Reisnerb411b362009-09-25 16:07:19 -0700961 if (mdev->state.role != R_PRIMARY &&
962 (!allow_oos || is_write)) {
963 if (__ratelimit(&drbd_ratelimit_state)) {
964 dev_err(DEV, "Process %s[%u] tried to %s; "
965 "since we are not in Primary state, "
966 "we cannot allow this\n",
967 current->comm, current->pid,
968 is_write ? "WRITE" : "READ");
969 }
970 return 1;
971 }
972
973 /*
974 * Paranoia: we might have been primary, but sync target, or
975 * even diskless, then lost the connection.
976 * This should have been handled (panic? suspend?) somewhere
977 * else. But maybe it was not, so check again here.
978 * Caution: as long as we do not have a read/write lock on mdev,
979 * to serialize state changes, this is racy, since we may lose
980 * the connection *after* we test for the cstate.
981 */
982 if (mdev->state.disk < D_UP_TO_DATE && mdev->state.pdsk < D_UP_TO_DATE) {
983 if (__ratelimit(&drbd_ratelimit_state))
984 dev_err(DEV, "Sorry, I have no access to good data anymore.\n");
985 return 1;
986 }
987
988 return 0;
989}
990
991int drbd_make_request_26(struct request_queue *q, struct bio *bio)
992{
993 unsigned int s_enr, e_enr;
994 struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata;
995
996 if (drbd_fail_request_early(mdev, bio_data_dir(bio) & WRITE)) {
997 bio_endio(bio, -EPERM);
998 return 0;
999 }
1000
1001 /* Reject barrier requests if we know the underlying device does
1002 * not support them.
1003 * XXX: Need to get this info from peer as well some how so we
1004 * XXX: reject if EITHER side/data/metadata area does not support them.
1005 *
1006 * because of those XXX, this is not yet enabled,
1007 * i.e. in drbd_init_set_defaults we set the NO_BARRIER_SUPP bit.
1008 */
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +02001009 if (unlikely(bio->bi_rw & REQ_HARDBARRIER) && test_bit(NO_BARRIER_SUPP, &mdev->flags)) {
Philipp Reisnerb411b362009-09-25 16:07:19 -07001010 /* dev_warn(DEV, "Rejecting barrier request as underlying device does not support\n"); */
1011 bio_endio(bio, -EOPNOTSUPP);
1012 return 0;
1013 }
1014
1015 /*
1016 * what we "blindly" assume:
1017 */
1018 D_ASSERT(bio->bi_size > 0);
1019 D_ASSERT((bio->bi_size & 0x1ff) == 0);
1020 D_ASSERT(bio->bi_idx == 0);
1021
1022 /* to make some things easier, force alignment of requests within the
1023 * granularity of our hash tables */
1024 s_enr = bio->bi_sector >> HT_SHIFT;
1025 e_enr = (bio->bi_sector+(bio->bi_size>>9)-1) >> HT_SHIFT;
1026
1027 if (likely(s_enr == e_enr)) {
1028 inc_ap_bio(mdev, 1);
1029 return drbd_make_request_common(mdev, bio);
1030 }
1031
1032 /* can this bio be split generically?
1033 * Maybe add our own split-arbitrary-bios function. */
1034 if (bio->bi_vcnt != 1 || bio->bi_idx != 0 || bio->bi_size > DRBD_MAX_SEGMENT_SIZE) {
1035 /* rather error out here than BUG in bio_split */
1036 dev_err(DEV, "bio would need to, but cannot, be split: "
1037 "(vcnt=%u,idx=%u,size=%u,sector=%llu)\n",
1038 bio->bi_vcnt, bio->bi_idx, bio->bi_size,
1039 (unsigned long long)bio->bi_sector);
1040 bio_endio(bio, -EINVAL);
1041 } else {
1042 /* This bio crosses some boundary, so we have to split it. */
1043 struct bio_pair *bp;
1044 /* works for the "do not cross hash slot boundaries" case
1045 * e.g. sector 262269, size 4096
1046 * s_enr = 262269 >> 6 = 4097
1047 * e_enr = (262269+8-1) >> 6 = 4098
1048 * HT_SHIFT = 6
1049 * sps = 64, mask = 63
1050 * first_sectors = 64 - (262269 & 63) = 3
1051 */
1052 const sector_t sect = bio->bi_sector;
1053 const int sps = 1 << HT_SHIFT; /* sectors per slot */
1054 const int mask = sps - 1;
1055 const sector_t first_sectors = sps - (sect & mask);
1056 bp = bio_split(bio,
1057#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,28)
1058 bio_split_pool,
1059#endif
1060 first_sectors);
1061
1062 /* we need to get a "reference count" (ap_bio_cnt)
1063 * to avoid races with the disconnect/reconnect/suspend code.
Philipp Reisner9a25a042010-05-10 16:42:23 +02001064 * In case we need to split the bio here, we need to get three references
Philipp Reisnerb411b362009-09-25 16:07:19 -07001065 * atomically, otherwise we might deadlock when trying to submit the
1066 * second one! */
Philipp Reisner9a25a042010-05-10 16:42:23 +02001067 inc_ap_bio(mdev, 3);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001068
1069 D_ASSERT(e_enr == s_enr + 1);
1070
Philipp Reisner9a25a042010-05-10 16:42:23 +02001071 while (drbd_make_request_common(mdev, &bp->bio1))
1072 inc_ap_bio(mdev, 1);
1073
1074 while (drbd_make_request_common(mdev, &bp->bio2))
1075 inc_ap_bio(mdev, 1);
1076
1077 dec_ap_bio(mdev);
1078
Philipp Reisnerb411b362009-09-25 16:07:19 -07001079 bio_pair_release(bp);
1080 }
1081 return 0;
1082}
1083
1084/* This is called by bio_add_page(). With this function we reduce
1085 * the number of BIOs that span over multiple DRBD_MAX_SEGMENT_SIZEs
1086 * units (was AL_EXTENTs).
1087 *
1088 * we do the calculation within the lower 32bit of the byte offsets,
1089 * since we don't care for actual offset, but only check whether it
1090 * would cross "activity log extent" boundaries.
1091 *
1092 * As long as the BIO is empty we have to allow at least one bvec,
1093 * regardless of size and offset. so the resulting bio may still
1094 * cross extent boundaries. those are dealt with (bio_split) in
1095 * drbd_make_request_26.
1096 */
1097int drbd_merge_bvec(struct request_queue *q, struct bvec_merge_data *bvm, struct bio_vec *bvec)
1098{
1099 struct drbd_conf *mdev = (struct drbd_conf *) q->queuedata;
1100 unsigned int bio_offset =
1101 (unsigned int)bvm->bi_sector << 9; /* 32 bit */
1102 unsigned int bio_size = bvm->bi_size;
1103 int limit, backing_limit;
1104
1105 limit = DRBD_MAX_SEGMENT_SIZE
1106 - ((bio_offset & (DRBD_MAX_SEGMENT_SIZE-1)) + bio_size);
1107 if (limit < 0)
1108 limit = 0;
1109 if (bio_size == 0) {
1110 if (limit <= bvec->bv_len)
1111 limit = bvec->bv_len;
1112 } else if (limit && get_ldev(mdev)) {
1113 struct request_queue * const b =
1114 mdev->ldev->backing_bdev->bd_disk->queue;
Lars Ellenberga1c88d02010-05-14 19:16:41 +02001115 if (b->merge_bvec_fn) {
Philipp Reisnerb411b362009-09-25 16:07:19 -07001116 backing_limit = b->merge_bvec_fn(b, bvm, bvec);
1117 limit = min(limit, backing_limit);
1118 }
1119 put_ldev(mdev);
1120 }
1121 return limit;
1122}