2019-05-22 10:51:37 +03:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2009-09-26 03:07:19 +04:00
|
|
|
/*
|
|
|
|
drbd_req.c
|
|
|
|
|
|
|
|
This file is part of DRBD by Philipp Reisner and Lars Ellenberg.
|
|
|
|
|
|
|
|
Copyright (C) 2001-2008, LINBIT Information Technologies GmbH.
|
|
|
|
Copyright (C) 1999-2008, Philipp Reisner <philipp.reisner@linbit.com>.
|
|
|
|
Copyright (C) 2002-2008, Lars Ellenberg <lars.ellenberg@linbit.com>.
|
|
|
|
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/drbd.h>
|
|
|
|
#include "drbd_int.h"
|
|
|
|
#include "drbd_req.h"
|
|
|
|
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static bool drbd_may_do_local_read(struct drbd_device *device, sector_t sector, int size);
|
2011-12-03 14:18:56 +04:00
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
/* Update disk stats at start of I/O request */
|
2011-07-03 15:26:43 +04:00
|
|
|
static void _drbd_start_io_acct(struct drbd_device *device, struct drbd_request *req)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2017-07-01 06:55:08 +03:00
|
|
|
struct request_queue *q = device->rq_queue;
|
|
|
|
|
2018-07-18 14:47:39 +03:00
|
|
|
generic_start_io_acct(q, bio_op(req->master_bio),
|
2017-07-01 06:55:08 +03:00
|
|
|
req->i.size >> 9, &device->vdisk->part0);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Update disk stats when completing request upwards */
|
2011-07-03 15:26:43 +04:00
|
|
|
static void _drbd_end_io_acct(struct drbd_device *device, struct drbd_request *req)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2017-07-01 06:55:08 +03:00
|
|
|
struct request_queue *q = device->rq_queue;
|
|
|
|
|
2018-07-18 14:47:39 +03:00
|
|
|
generic_end_io_acct(q, bio_op(req->master_bio),
|
2014-11-24 06:05:25 +03:00
|
|
|
&device->vdisk->part0, req->start_jif);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2016-06-14 01:26:31 +03:00
|
|
|
static struct drbd_request *drbd_req_new(struct drbd_device *device, struct bio *bio_src)
|
2011-01-26 20:45:11 +03:00
|
|
|
{
|
|
|
|
struct drbd_request *req;
|
|
|
|
|
2018-05-21 01:25:48 +03:00
|
|
|
req = mempool_alloc(&drbd_request_mempool, GFP_NOIO);
|
2011-01-26 20:45:11 +03:00
|
|
|
if (!req)
|
|
|
|
return NULL;
|
2015-03-25 02:22:32 +03:00
|
|
|
memset(req, 0, sizeof(*req));
|
2011-01-26 20:45:11 +03:00
|
|
|
|
|
|
|
drbd_req_make_private_bio(req, bio_src);
|
2016-06-14 01:26:31 +03:00
|
|
|
req->rq_state = (bio_data_dir(bio_src) == WRITE ? RQ_WRITE : 0)
|
|
|
|
| (bio_op(bio_src) == REQ_OP_WRITE_SAME ? RQ_WSAME : 0)
|
drbd: introduce P_ZEROES (REQ_OP_WRITE_ZEROES on the "wire")
And also re-enable partial-zero-out + discard aligned.
With the introduction of REQ_OP_WRITE_ZEROES,
we started to use that for both WRITE_ZEROES and DISCARDS,
hoping that WRITE_ZEROES would "do what we want",
UNMAP if possible, zero-out the rest.
The example scenario is some LVM "thin" backend.
While an un-allocated block on dm-thin reads as zeroes, on a dm-thin
with "skip_block_zeroing=true", after a partial block write allocated
that block, that same block may well map "undefined old garbage" from
the backends on LBAs that have not yet been written to.
If we cannot distinguish between zero-out and discard on the receiving
side, to avoid "undefined old garbage" to pop up randomly at later times
on supposedly zero-initialized blocks, we'd need to map all discards to
zero-out on the receiving side. But that would potentially do a full
alloc on thinly provisioned backends, even when the expectation was to
unmap/trim/discard/de-allocate.
We need to distinguish on the protocol level, whether we need to guarantee
zeroes (and thus use zero-out, potentially doing the mentioned full-alloc),
or if we want to put the emphasis on discard, and only do a "best effort
zeroing" (by "discarding" blocks aligned to discard-granularity, and zeroing
only potential unaligned head and tail clippings to at least *try* to
avoid "false positives" in an online-verify later), hoping that someone
set skip_block_zeroing=false.
For some discussion regarding this on dm-devel, see also
https://www.mail-archive.com/dm-devel%40redhat.com/msg07965.html
https://www.redhat.com/archives/dm-devel/2018-January/msg00271.html
For backward compatibility, P_TRIM means zero-out, unless the
DRBD_FF_WZEROES feature flag is agreed upon during handshake.
To have upper layers even try to submit WRITE ZEROES requests,
we need to announce "efficient zeroout" independently.
We need to fixup max_write_zeroes_sectors after blk_queue_stack_limits():
if we can handle "zeroes" efficiently on the protocol,
we want to do that, even if our backend does not announce
max_write_zeroes_sectors itself.
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2018-12-20 19:23:42 +03:00
|
|
|
| (bio_op(bio_src) == REQ_OP_WRITE_ZEROES ? RQ_ZEROES : 0)
|
2016-06-14 01:26:31 +03:00
|
|
|
| (bio_op(bio_src) == REQ_OP_DISCARD ? RQ_UNMAP : 0);
|
|
|
|
req->device = device;
|
|
|
|
req->master_bio = bio_src;
|
|
|
|
req->epoch = 0;
|
2011-01-28 12:31:04 +03:00
|
|
|
|
2011-01-26 20:45:11 +03:00
|
|
|
drbd_clear_interval(&req->i);
|
2013-10-12 02:44:27 +04:00
|
|
|
req->i.sector = bio_src->bi_iter.bi_sector;
|
|
|
|
req->i.size = bio_src->bi_iter.bi_size;
|
2011-01-27 16:42:51 +03:00
|
|
|
req->i.local = true;
|
2011-01-28 12:31:04 +03:00
|
|
|
req->i.waiting = false;
|
|
|
|
|
2011-01-26 20:45:11 +03:00
|
|
|
INIT_LIST_HEAD(&req->tl_requests);
|
|
|
|
INIT_LIST_HEAD(&req->w.list);
|
2013-11-22 15:52:03 +04:00
|
|
|
INIT_LIST_HEAD(&req->req_pending_master_completion);
|
|
|
|
INIT_LIST_HEAD(&req->req_pending_local);
|
2011-01-26 20:45:11 +03:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* one reference to be put by __drbd_make_request */
|
2012-01-24 19:58:11 +04:00
|
|
|
atomic_set(&req->completion_ref, 1);
|
2012-01-24 20:19:42 +04:00
|
|
|
/* one kref as long as completion_ref > 0 */
|
2012-01-24 19:58:11 +04:00
|
|
|
kref_init(&req->kref);
|
2011-01-26 20:45:11 +03:00
|
|
|
return req;
|
|
|
|
}
|
|
|
|
|
2014-03-20 14:19:22 +04:00
|
|
|
static void drbd_remove_request_interval(struct rb_root *root,
|
|
|
|
struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_device *device = req->device;
|
|
|
|
struct drbd_interval *i = &req->i;
|
|
|
|
|
|
|
|
drbd_remove_interval(root, i);
|
|
|
|
|
|
|
|
/* Wake up any processes waiting for this request to complete. */
|
|
|
|
if (i->waiting)
|
|
|
|
wake_up(&device->misc_wait);
|
|
|
|
}
|
|
|
|
|
2012-07-24 12:12:36 +04:00
|
|
|
void drbd_req_destroy(struct kref *kref)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2012-01-24 19:58:11 +04:00
|
|
|
struct drbd_request *req = container_of(kref, struct drbd_request, kref);
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-01-24 20:19:42 +04:00
|
|
|
const unsigned s = req->rq_state;
|
|
|
|
|
|
|
|
if ((req->master_bio && !(s & RQ_POSTPONED)) ||
|
|
|
|
atomic_read(&req->completion_ref) ||
|
|
|
|
(s & RQ_LOCAL_PENDING) ||
|
|
|
|
((s & RQ_NET_MASK) && !(s & RQ_NET_DONE))) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "drbd_req_destroy: Logic BUG rq_state = 0x%x, completion_ref = %d\n",
|
2012-01-24 20:19:42 +04:00
|
|
|
s, atomic_read(&req->completion_ref));
|
|
|
|
return;
|
|
|
|
}
|
2010-05-27 17:07:43 +04:00
|
|
|
|
2013-11-22 15:52:03 +04:00
|
|
|
/* If called from mod_rq_state (expected normal case) or
|
|
|
|
* drbd_send_and_submit (the less likely normal path), this holds the
|
|
|
|
* req_lock, and req->tl_requests will typicaly be on ->transfer_log,
|
|
|
|
* though it may be still empty (never added to the transfer log).
|
|
|
|
*
|
|
|
|
* If called from do_retry(), we do NOT hold the req_lock, but we are
|
|
|
|
* still allowed to unconditionally list_del(&req->tl_requests),
|
|
|
|
* because it will be on a local on-stack list only. */
|
drbd: fix potential deadlock during "restart" of conflicting writes
w_restart_write(), run from worker context, calls __drbd_make_request()
and further drbd_al_begin_io(, delegate=true), which then
potentially deadlocks. The previous patch moved a BUG_ON to expose
such call paths, which would now be triggered.
Also, if we call __drbd_make_request() from resource worker context,
like w_restart_write() did, and that should block for whatever reason
(!drbd_state_is_stable(), resource suspended, ...),
we potentially deadlock the whole resource, as the worker
is needed for state changes and other things.
Create a dedicated retry workqueue for this instead.
Also make sure that inc_ap_bio()/dec_ap_bio() are properly paired,
even if do_retry() needs to retry itself,
in case __drbd_make_request() returns != 0.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
2011-11-24 13:36:25 +04:00
|
|
|
list_del_init(&req->tl_requests);
|
2010-05-27 17:07:43 +04:00
|
|
|
|
2014-03-20 14:19:22 +04:00
|
|
|
/* finally remove the request from the conflict detection
|
|
|
|
* respective block_id verification interval tree. */
|
|
|
|
if (!drbd_interval_empty(&req->i)) {
|
|
|
|
struct rb_root *root;
|
|
|
|
|
|
|
|
if (s & RQ_WRITE)
|
|
|
|
root = &device->write_requests;
|
|
|
|
else
|
|
|
|
root = &device->read_requests;
|
|
|
|
drbd_remove_request_interval(root, req);
|
|
|
|
} else if (s & (RQ_NET_MASK & ~RQ_NET_DONE) && req->i.size != 0)
|
|
|
|
drbd_err(device, "drbd_req_destroy: Logic BUG: interval empty, but: rq_state=0x%x, sect=%llu, size=%u\n",
|
|
|
|
s, (unsigned long long)req->i.sector, req->i.size);
|
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
/* if it was a write, we may have to set the corresponding
|
|
|
|
* bit(s) out-of-sync first. If it had a local part, we need to
|
|
|
|
* release the reference to the activity log. */
|
2012-01-24 19:58:11 +04:00
|
|
|
if (s & RQ_WRITE) {
|
2009-09-26 03:07:19 +04:00
|
|
|
/* Set out-of-sync unless both OK flags are set
|
|
|
|
* (local only or remote failed).
|
|
|
|
* Other places where we set out-of-sync:
|
|
|
|
* READ with local io-error */
|
|
|
|
|
2012-09-03 16:08:35 +04:00
|
|
|
/* There is a special case:
|
|
|
|
* we may notice late that IO was suspended,
|
|
|
|
* and postpone, or schedule for retry, a write,
|
|
|
|
* before it even was submitted or sent.
|
|
|
|
* In that case we do not want to touch the bitmap at all.
|
|
|
|
*/
|
|
|
|
if ((s & (RQ_POSTPONED|RQ_LOCAL_MASK|RQ_NET_MASK)) != RQ_POSTPONED) {
|
2012-08-28 16:39:44 +04:00
|
|
|
if (!(s & RQ_NET_OK) || !(s & RQ_LOCAL_OK))
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_set_out_of_sync(device, req->i.sector, req->i.size);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-08-28 16:39:44 +04:00
|
|
|
if ((s & RQ_NET_OK) && (s & RQ_LOCAL_OK) && (s & RQ_NET_SIS))
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_set_in_sync(device, req->i.sector, req->i.size);
|
2012-08-28 16:39:44 +04:00
|
|
|
}
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
/* one might be tempted to move the drbd_al_complete_io
|
2011-02-17 18:46:59 +03:00
|
|
|
* to the local io completion callback drbd_request_endio.
|
2009-09-26 03:07:19 +04:00
|
|
|
* but, if this was a mirror write, we may only
|
|
|
|
* drbd_al_complete_io after this is RQ_NET_DONE,
|
|
|
|
* otherwise the extent could be dropped from the al
|
|
|
|
* before it has actually been written on the peer.
|
|
|
|
* if we crash before our peer knows about the request,
|
|
|
|
* but after the extent has been dropped from the al,
|
|
|
|
* we would forget to resync the corresponding extent.
|
|
|
|
*/
|
2012-08-29 17:23:14 +04:00
|
|
|
if (s & RQ_IN_ACT_LOG) {
|
2011-07-03 15:26:43 +04:00
|
|
|
if (get_ldev_if_state(device, D_FAILED)) {
|
|
|
|
drbd_al_complete_io(device, &req->i);
|
|
|
|
put_ldev(device);
|
2009-09-26 03:07:19 +04:00
|
|
|
} else if (__ratelimit(&drbd_ratelimit_state)) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_warn(device, "Should have called drbd_al_complete_io(, %llu, %u), "
|
2011-03-31 17:18:56 +04:00
|
|
|
"but my Disk seems to have failed :(\n",
|
|
|
|
(unsigned long long) req->i.sector, req->i.size);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-21 01:25:48 +03:00
|
|
|
mempool_free(req, &drbd_request_mempool);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-05-30 18:32:41 +04:00
|
|
|
static void wake_all_senders(struct drbd_connection *connection)
|
|
|
|
{
|
|
|
|
wake_up(&connection->sender_work.q_wait);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-11-28 18:04:49 +04:00
|
|
|
/* must hold resource->req_lock */
|
2011-05-30 18:32:41 +04:00
|
|
|
void start_new_tl_epoch(struct drbd_connection *connection)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2012-08-07 08:42:09 +04:00
|
|
|
/* no point closing an epoch, if it is empty, anyways. */
|
2011-05-30 18:32:41 +04:00
|
|
|
if (connection->current_tle_writes == 0)
|
2012-08-07 08:42:09 +04:00
|
|
|
return;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-05-30 18:32:41 +04:00
|
|
|
connection->current_tle_writes = 0;
|
|
|
|
atomic_inc(&connection->current_tle_nr);
|
|
|
|
wake_all_senders(connection);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
void complete_master_bio(struct drbd_device *device,
|
2009-09-26 03:07:19 +04:00
|
|
|
struct bio_and_error *m)
|
|
|
|
{
|
2017-06-03 10:38:06 +03:00
|
|
|
m->bio->bi_status = errno_to_blk_status(m->error);
|
2015-07-20 16:29:37 +03:00
|
|
|
bio_endio(m->bio);
|
2011-07-03 15:26:43 +04:00
|
|
|
dec_ap_bio(device);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-01-28 12:31:04 +03:00
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
/* Helper for __req_mod().
|
|
|
|
* Set m->bio to the master bio, if it is fit to be completed,
|
|
|
|
* or leave it alone (it is initialized to NULL in __req_mod),
|
|
|
|
* if it has already been completed, or cannot be completed yet.
|
|
|
|
* If m->bio is set, the error status to be returned is placed in m->error.
|
|
|
|
*/
|
2012-03-26 19:02:45 +04:00
|
|
|
static
|
2012-01-24 20:19:42 +04:00
|
|
|
void drbd_req_complete(struct drbd_request *req, struct bio_and_error *m)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2012-01-24 20:19:42 +04:00
|
|
|
const unsigned s = req->rq_state;
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-01-24 20:19:42 +04:00
|
|
|
int error, ok;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
/* we must not complete the master bio, while it is
|
|
|
|
* still being processed by _drbd_send_zc_bio (drbd_send_dblock)
|
|
|
|
* not yet acknowledged by the peer
|
|
|
|
* not yet completed by the local io subsystem
|
|
|
|
* these flags may get cleared in any order by
|
|
|
|
* the worker,
|
|
|
|
* the receiver,
|
|
|
|
* the bio_endio completion callbacks.
|
|
|
|
*/
|
2012-01-24 20:19:42 +04:00
|
|
|
if ((s & RQ_LOCAL_PENDING && !(s & RQ_LOCAL_ABORTED)) ||
|
|
|
|
(s & RQ_NET_QUEUED) || (s & RQ_NET_PENDING) ||
|
|
|
|
(s & RQ_COMPLETION_SUSP)) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "drbd_req_complete: Logic BUG rq_state = 0x%x\n", s);
|
2009-09-26 03:07:19 +04:00
|
|
|
return;
|
2012-01-24 20:19:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!req->master_bio) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "drbd_req_complete: Logic BUG, master_bio == NULL!\n");
|
2009-09-26 03:07:19 +04:00
|
|
|
return;
|
2012-01-24 20:19:42 +04:00
|
|
|
}
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/*
|
|
|
|
* figure out whether to report success or failure.
|
|
|
|
*
|
|
|
|
* report success when at least one of the operations succeeded.
|
|
|
|
* or, to put the other way,
|
|
|
|
* only report failure, when both operations failed.
|
|
|
|
*
|
|
|
|
* what to do about the failures is handled elsewhere.
|
|
|
|
* what we need to do here is just: complete the master_bio.
|
|
|
|
*
|
|
|
|
* local completion error, if any, has been stored as ERR_PTR
|
|
|
|
* in private_bio within drbd_request_endio.
|
|
|
|
*/
|
|
|
|
ok = (s & RQ_LOCAL_OK) || (s & RQ_NET_OK);
|
|
|
|
error = PTR_ERR(req->private_bio);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* Before we can signal completion to the upper layers,
|
|
|
|
* we may need to close the current transfer log epoch.
|
|
|
|
* We are within the request lock, so we can simply compare
|
|
|
|
* the request epoch number with the current transfer log
|
|
|
|
* epoch number. If they match, increase the current_tle_nr,
|
|
|
|
* and reset the transfer log epoch write_cnt.
|
|
|
|
*/
|
2016-07-19 12:28:41 +03:00
|
|
|
if (op_is_write(bio_op(req->master_bio)) &&
|
2011-05-31 16:33:49 +04:00
|
|
|
req->epoch == atomic_read(&first_peer_device(device)->connection->current_tle_nr))
|
|
|
|
start_new_tl_epoch(first_peer_device(device)->connection);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* Update disk stats */
|
2011-07-03 15:26:43 +04:00
|
|
|
_drbd_end_io_acct(device, req);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* If READ failed,
|
|
|
|
* have it be pushed back to the retry work queue,
|
|
|
|
* so it will re-enter __drbd_make_request(),
|
|
|
|
* and be re-assigned to a suitable local or remote path,
|
|
|
|
* or failed if we do not have access to good data anymore.
|
|
|
|
*
|
|
|
|
* Unless it was failed early by __drbd_make_request(),
|
|
|
|
* because no path was available, in which case
|
|
|
|
* it was not even added to the transfer_log.
|
|
|
|
*
|
2016-07-19 12:28:41 +03:00
|
|
|
* read-ahead may fail, and will not be retried.
|
2012-01-24 20:19:42 +04:00
|
|
|
*
|
|
|
|
* WRITE should have used all available paths already.
|
|
|
|
*/
|
2016-07-19 12:28:41 +03:00
|
|
|
if (!ok &&
|
|
|
|
bio_op(req->master_bio) == REQ_OP_READ &&
|
2016-08-06 00:35:16 +03:00
|
|
|
!(req->master_bio->bi_opf & REQ_RAHEAD) &&
|
2016-07-19 12:28:41 +03:00
|
|
|
!list_empty(&req->tl_requests))
|
2012-01-24 20:19:42 +04:00
|
|
|
req->rq_state |= RQ_POSTPONED;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if (!(req->rq_state & RQ_POSTPONED)) {
|
2009-09-26 03:07:19 +04:00
|
|
|
m->error = ok ? 0 : (error ?: -EIO);
|
|
|
|
m->bio = req->master_bio;
|
|
|
|
req->master_bio = NULL;
|
2014-03-20 14:19:22 +04:00
|
|
|
/* We leave it in the tree, to be able to verify later
|
|
|
|
* write-acks in protocol != C during resync.
|
|
|
|
* But we mark it as "complete", so it won't be counted as
|
|
|
|
* conflict in a multi-primary setup. */
|
|
|
|
req->i.completed = true;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2014-03-20 14:19:22 +04:00
|
|
|
|
|
|
|
if (req->i.waiting)
|
|
|
|
wake_up(&device->misc_wait);
|
2013-11-22 15:52:03 +04:00
|
|
|
|
|
|
|
/* Either we are about to complete to upper layers,
|
|
|
|
* or we will restart this request.
|
|
|
|
* In either case, the request object will be destroyed soon,
|
|
|
|
* so better remove it from all lists. */
|
|
|
|
list_del_init(&req->req_pending_master_completion);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 15:52:03 +04:00
|
|
|
/* still holds resource->req_lock */
|
2017-05-11 11:21:46 +03:00
|
|
|
static void drbd_req_put_completion_ref(struct drbd_request *req, struct bio_and_error *m, int put)
|
2010-06-23 19:18:51 +04:00
|
|
|
{
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, m || (req->rq_state & RQ_POSTPONED));
|
2012-01-24 20:19:42 +04:00
|
|
|
|
2017-05-11 11:21:46 +03:00
|
|
|
if (!put)
|
|
|
|
return;
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if (!atomic_sub_and_test(put, &req->completion_ref))
|
2017-05-11 11:21:46 +03:00
|
|
|
return;
|
2011-03-14 15:01:50 +03:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
drbd_req_complete(req, m);
|
2012-07-24 12:12:36 +04:00
|
|
|
|
2017-05-11 11:21:46 +03:00
|
|
|
/* local completion may still come in later,
|
|
|
|
* we need to keep the req object around. */
|
|
|
|
if (req->rq_state & RQ_LOCAL_ABORTED)
|
|
|
|
return;
|
|
|
|
|
2012-07-24 12:12:36 +04:00
|
|
|
if (req->rq_state & RQ_POSTPONED) {
|
|
|
|
/* don't destroy the req object just yet,
|
|
|
|
* but queue it for retry */
|
|
|
|
drbd_restart_request(req);
|
2017-05-11 11:21:46 +03:00
|
|
|
return;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2012-07-24 12:12:36 +04:00
|
|
|
|
2017-05-11 11:21:46 +03:00
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 16:00:12 +04:00
|
|
|
static void set_if_null_req_next(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_next == NULL)
|
|
|
|
connection->req_next = req;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void advance_conn_req_next(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_next != req)
|
|
|
|
return;
|
|
|
|
list_for_each_entry_continue(req, &connection->transfer_log, tl_requests) {
|
|
|
|
const unsigned s = req->rq_state;
|
|
|
|
if (s & RQ_NET_QUEUED)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (&req->tl_requests == &connection->transfer_log)
|
|
|
|
req = NULL;
|
|
|
|
connection->req_next = req;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void set_if_null_req_ack_pending(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_ack_pending == NULL)
|
|
|
|
connection->req_ack_pending = req;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void advance_conn_req_ack_pending(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_ack_pending != req)
|
|
|
|
return;
|
|
|
|
list_for_each_entry_continue(req, &connection->transfer_log, tl_requests) {
|
|
|
|
const unsigned s = req->rq_state;
|
|
|
|
if ((s & RQ_NET_SENT) && (s & RQ_NET_PENDING))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (&req->tl_requests == &connection->transfer_log)
|
|
|
|
req = NULL;
|
|
|
|
connection->req_ack_pending = req;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void set_if_null_req_not_net_done(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_not_net_done == NULL)
|
|
|
|
connection->req_not_net_done = req;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void advance_conn_req_not_net_done(struct drbd_peer_device *peer_device, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_connection *connection = peer_device ? peer_device->connection : NULL;
|
|
|
|
if (!connection)
|
|
|
|
return;
|
|
|
|
if (connection->req_not_net_done != req)
|
|
|
|
return;
|
|
|
|
list_for_each_entry_continue(req, &connection->transfer_log, tl_requests) {
|
|
|
|
const unsigned s = req->rq_state;
|
|
|
|
if ((s & RQ_NET_SENT) && !(s & RQ_NET_DONE))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (&req->tl_requests == &connection->transfer_log)
|
|
|
|
req = NULL;
|
|
|
|
connection->req_not_net_done = req;
|
|
|
|
}
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* I'd like this to be the only place that manipulates
|
|
|
|
* req->completion_ref and req->kref. */
|
|
|
|
static void mod_rq_state(struct drbd_request *req, struct bio_and_error *m,
|
|
|
|
int clear, int set)
|
2010-06-23 19:18:51 +04:00
|
|
|
{
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2013-11-22 16:00:12 +04:00
|
|
|
struct drbd_peer_device *peer_device = first_peer_device(device);
|
2012-01-24 20:19:42 +04:00
|
|
|
unsigned s = req->rq_state;
|
|
|
|
int c_put = 0;
|
2010-06-23 19:18:51 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (drbd_suspended(device) && !((s | clear) & RQ_COMPLETION_SUSP))
|
2012-08-14 13:28:52 +04:00
|
|
|
set |= RQ_COMPLETION_SUSP;
|
2010-06-23 19:18:51 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* apply */
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
req->rq_state &= ~clear;
|
|
|
|
req->rq_state |= set;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* no change? */
|
|
|
|
if (req->rq_state == s)
|
|
|
|
return;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* intent: get references */
|
|
|
|
|
2016-11-14 19:34:19 +03:00
|
|
|
kref_get(&req->kref);
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if (!(s & RQ_LOCAL_PENDING) && (set & RQ_LOCAL_PENDING))
|
|
|
|
atomic_inc(&req->completion_ref);
|
|
|
|
|
|
|
|
if (!(s & RQ_NET_PENDING) && (set & RQ_NET_PENDING)) {
|
2011-07-03 15:26:43 +04:00
|
|
|
inc_ap_pending(device);
|
2012-01-24 20:19:42 +04:00
|
|
|
atomic_inc(&req->completion_ref);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
if (!(s & RQ_NET_QUEUED) && (set & RQ_NET_QUEUED)) {
|
2012-01-24 20:19:42 +04:00
|
|
|
atomic_inc(&req->completion_ref);
|
2013-11-22 16:00:12 +04:00
|
|
|
set_if_null_req_next(peer_device, req);
|
2013-11-22 15:32:01 +04:00
|
|
|
}
|
2012-01-24 20:19:42 +04:00
|
|
|
|
|
|
|
if (!(s & RQ_EXP_BARR_ACK) && (set & RQ_EXP_BARR_ACK))
|
|
|
|
kref_get(&req->kref); /* wait for the DONE */
|
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
if (!(s & RQ_NET_SENT) && (set & RQ_NET_SENT)) {
|
2015-03-16 18:08:29 +03:00
|
|
|
/* potentially already completed in the ack_receiver thread */
|
2013-11-22 16:00:12 +04:00
|
|
|
if (!(s & RQ_NET_DONE)) {
|
2013-11-22 15:32:01 +04:00
|
|
|
atomic_add(req->i.size >> 9, &device->ap_in_flight);
|
2013-11-22 16:00:12 +04:00
|
|
|
set_if_null_req_not_net_done(peer_device, req);
|
|
|
|
}
|
2015-05-18 15:08:46 +03:00
|
|
|
if (req->rq_state & RQ_NET_PENDING)
|
2013-11-22 16:00:12 +04:00
|
|
|
set_if_null_req_ack_pending(peer_device, req);
|
2013-11-22 15:32:01 +04:00
|
|
|
}
|
2012-01-24 20:19:42 +04:00
|
|
|
|
2012-08-14 13:28:52 +04:00
|
|
|
if (!(s & RQ_COMPLETION_SUSP) && (set & RQ_COMPLETION_SUSP))
|
|
|
|
atomic_inc(&req->completion_ref);
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
/* progress: put references */
|
|
|
|
|
|
|
|
if ((s & RQ_COMPLETION_SUSP) && (clear & RQ_COMPLETION_SUSP))
|
|
|
|
++c_put;
|
|
|
|
|
|
|
|
if (!(s & RQ_LOCAL_ABORTED) && (set & RQ_LOCAL_ABORTED)) {
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_LOCAL_PENDING);
|
2012-01-24 20:19:42 +04:00
|
|
|
++c_put;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if ((s & RQ_LOCAL_PENDING) && (clear & RQ_LOCAL_PENDING)) {
|
|
|
|
if (req->rq_state & RQ_LOCAL_ABORTED)
|
2016-11-14 19:34:19 +03:00
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2012-01-24 20:19:42 +04:00
|
|
|
else
|
|
|
|
++c_put;
|
2013-11-22 15:52:03 +04:00
|
|
|
list_del_init(&req->req_pending_local);
|
2012-01-24 20:19:42 +04:00
|
|
|
}
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if ((s & RQ_NET_PENDING) && (clear & RQ_NET_PENDING)) {
|
2011-07-03 15:26:43 +04:00
|
|
|
dec_ap_pending(device);
|
2012-01-24 20:19:42 +04:00
|
|
|
++c_put;
|
2013-11-22 15:32:01 +04:00
|
|
|
req->acked_jif = jiffies;
|
2013-11-22 16:00:12 +04:00
|
|
|
advance_conn_req_ack_pending(peer_device, req);
|
2012-01-24 20:19:42 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 16:00:12 +04:00
|
|
|
if ((s & RQ_NET_QUEUED) && (clear & RQ_NET_QUEUED)) {
|
2012-01-24 20:19:42 +04:00
|
|
|
++c_put;
|
2013-11-22 16:00:12 +04:00
|
|
|
advance_conn_req_next(peer_device, req);
|
|
|
|
}
|
2012-01-24 20:19:42 +04:00
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
if (!(s & RQ_NET_DONE) && (set & RQ_NET_DONE)) {
|
|
|
|
if (s & RQ_NET_SENT)
|
2011-07-03 15:26:43 +04:00
|
|
|
atomic_sub(req->i.size >> 9, &device->ap_in_flight);
|
2013-11-22 15:32:01 +04:00
|
|
|
if (s & RQ_EXP_BARR_ACK)
|
2016-11-14 19:34:19 +03:00
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2013-11-22 15:32:01 +04:00
|
|
|
req->net_done_jif = jiffies;
|
2013-11-22 16:00:12 +04:00
|
|
|
|
|
|
|
/* in ahead/behind mode, or just in case,
|
|
|
|
* before we finally destroy this request,
|
|
|
|
* the caching pointers must not reference it anymore */
|
|
|
|
advance_conn_req_next(peer_device, req);
|
|
|
|
advance_conn_req_ack_pending(peer_device, req);
|
|
|
|
advance_conn_req_not_net_done(peer_device, req);
|
2012-01-24 20:19:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* potentially complete and destroy */
|
|
|
|
|
|
|
|
/* If we made progress, retry conflicting peer requests, if any. */
|
|
|
|
if (req->i.waiting)
|
2011-07-03 15:26:43 +04:00
|
|
|
wake_up(&device->misc_wait);
|
2012-01-24 20:19:42 +04:00
|
|
|
|
2017-05-11 11:21:46 +03:00
|
|
|
drbd_req_put_completion_ref(req, m, c_put);
|
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static void drbd_report_io_error(struct drbd_device *device, struct drbd_request *req)
|
2012-09-26 16:07:04 +04:00
|
|
|
{
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
|
2012-09-27 17:19:38 +04:00
|
|
|
if (!__ratelimit(&drbd_ratelimit_state))
|
2012-09-26 16:07:04 +04:00
|
|
|
return;
|
|
|
|
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_warn(device, "local %s IO error sector %llu+%u on %s\n",
|
2012-09-26 16:07:04 +04:00
|
|
|
(req->rq_state & RQ_WRITE) ? "WRITE" : "READ",
|
2012-09-27 17:19:38 +04:00
|
|
|
(unsigned long long)req->i.sector,
|
|
|
|
req->i.size >> 9,
|
2011-07-03 15:26:43 +04:00
|
|
|
bdevname(device->ldev->backing_bdev, b));
|
2012-09-26 16:07:04 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
/* Helper for HANDED_OVER_TO_NETWORK.
|
|
|
|
* Is this a protocol A write (neither WRITE_ACK nor RECEIVE_ACK expected)?
|
|
|
|
* Is it also still "PENDING"?
|
|
|
|
* --> If so, clear PENDING and set NET_OK below.
|
|
|
|
* If it is a protocol A write, but not RQ_PENDING anymore, neg-ack was faster
|
|
|
|
* (and we must not set RQ_NET_OK) */
|
|
|
|
static inline bool is_pending_write_protocol_A(struct drbd_request *req)
|
|
|
|
{
|
|
|
|
return (req->rq_state &
|
|
|
|
(RQ_WRITE|RQ_NET_PENDING|RQ_EXP_WRITE_ACK|RQ_EXP_RECEIVE_ACK))
|
|
|
|
== (RQ_WRITE|RQ_NET_PENDING);
|
|
|
|
}
|
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
/* obviously this could be coded as many single functions
|
|
|
|
* instead of one huge switch,
|
|
|
|
* or by putting the code directly in the respective locations
|
|
|
|
* (as it has been before).
|
|
|
|
*
|
|
|
|
* but having it this way
|
|
|
|
* enforces that it is all in this one place, where it is easier to audit,
|
|
|
|
* it makes it obvious that whatever "event" "happens" to a request should
|
|
|
|
* happen "atomically" within the req_lock,
|
|
|
|
* and it enforces that we have to think in a very structured manner
|
|
|
|
* about the "events" that may happen to a request during its life time ...
|
|
|
|
*/
|
2010-06-09 16:07:43 +04:00
|
|
|
int __req_mod(struct drbd_request *req, enum drbd_req_event what,
|
2009-09-26 03:07:19 +04:00
|
|
|
struct bio_and_error *m)
|
|
|
|
{
|
2013-11-22 15:40:58 +04:00
|
|
|
struct drbd_device *const device = req->device;
|
|
|
|
struct drbd_peer_device *const peer_device = first_peer_device(device);
|
|
|
|
struct drbd_connection *const connection = peer_device ? peer_device->connection : NULL;
|
2011-04-19 19:10:19 +04:00
|
|
|
struct net_conf *nc;
|
2011-04-14 03:24:47 +04:00
|
|
|
int p, rv = 0;
|
2011-02-22 04:15:32 +03:00
|
|
|
|
|
|
|
if (m)
|
|
|
|
m->bio = NULL;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
switch (what) {
|
|
|
|
default:
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "LOGIC BUG in %s:%u\n", __FILE__ , __LINE__);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* does not happen...
|
|
|
|
* initialization done in drbd_req_new
|
2011-01-25 17:37:43 +03:00
|
|
|
case CREATED:
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
*/
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case TO_BE_SENT: /* via network */
|
2011-02-22 04:15:32 +03:00
|
|
|
/* reached via __drbd_make_request
|
2009-09-26 03:07:19 +04:00
|
|
|
* and from w_read_retry_remote */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, !(req->rq_state & RQ_NET_MASK));
|
2011-04-19 19:10:19 +04:00
|
|
|
rcu_read_lock();
|
2013-11-22 15:40:58 +04:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2011-04-19 19:10:19 +04:00
|
|
|
p = nc->wire_protocol;
|
|
|
|
rcu_read_unlock();
|
2011-04-14 03:24:47 +04:00
|
|
|
req->rq_state |=
|
|
|
|
p == DRBD_PROT_C ? RQ_EXP_WRITE_ACK :
|
|
|
|
p == DRBD_PROT_B ? RQ_EXP_RECEIVE_ACK : 0;
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_PENDING);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case TO_BE_SUBMITTED: /* locally */
|
2011-02-22 04:15:32 +03:00
|
|
|
/* reached via __drbd_make_request */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, !(req->rq_state & RQ_LOCAL_MASK));
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_LOCAL_PENDING);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case COMPLETED_OK:
|
2011-03-14 15:01:50 +03:00
|
|
|
if (req->rq_state & RQ_WRITE)
|
2011-07-03 15:26:43 +04:00
|
|
|
device->writ_cnt += req->i.size >> 9;
|
2009-09-26 03:07:19 +04:00
|
|
|
else
|
2011-07-03 15:26:43 +04:00
|
|
|
device->read_cnt += req->i.size >> 9;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING,
|
|
|
|
RQ_LOCAL_COMPLETED|RQ_LOCAL_OK);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-07-05 17:38:59 +04:00
|
|
|
case ABORT_DISK_IO:
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_LOCAL_ABORTED);
|
2011-03-14 15:01:50 +03:00
|
|
|
break;
|
|
|
|
|
drbd: always write bitmap on detach
If we detach due to local read-error (which sets a bit in the bitmap),
stay Primary, and then re-attach (which re-reads the bitmap from disk),
we potentially lost the "out-of-sync" (or, "bad block") information in
the bitmap.
Always (try to) write out the changed bitmap pages before going diskless.
That way, we don't lose the bit for the bad block,
the next resync will fetch it from the peer, and rewrite
it locally, which may result in block reallocation in some
lower layer (or the hardware), and thereby "heal" the bad blocks.
If the bitmap writeout errors out as well, we will (again: try to)
mark the "we need a full sync" bit in our super block,
if it was a READ error; writes are covered by the activity log already.
If that superblock does not make it to disk either, we are sorry.
Maybe we just lost an entire disk or controller (or iSCSI connection),
and there actually are no bad blocks at all, so we don't need to
re-fetch from the peer, there is no "auto-healing" necessary.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
2012-09-27 17:18:21 +04:00
|
|
|
case WRITE_COMPLETED_WITH_ERROR:
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_report_io_error(device, req);
|
|
|
|
__drbd_chk_io_error(device, DRBD_WRITE_ERROR);
|
drbd: always write bitmap on detach
If we detach due to local read-error (which sets a bit in the bitmap),
stay Primary, and then re-attach (which re-reads the bitmap from disk),
we potentially lost the "out-of-sync" (or, "bad block") information in
the bitmap.
Always (try to) write out the changed bitmap pages before going diskless.
That way, we don't lose the bit for the bad block,
the next resync will fetch it from the peer, and rewrite
it locally, which may result in block reallocation in some
lower layer (or the hardware), and thereby "heal" the bad blocks.
If the bitmap writeout errors out as well, we will (again: try to)
mark the "we need a full sync" bit in our super block,
if it was a READ error; writes are covered by the activity log already.
If that superblock does not make it to disk either, we are sorry.
Maybe we just lost an entire disk or controller (or iSCSI connection),
and there actually are no bad blocks at all, so we don't need to
re-fetch from the peer, there is no "auto-healing" necessary.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
2012-09-27 17:18:21 +04:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING, RQ_LOCAL_COMPLETED);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case READ_COMPLETED_WITH_ERROR:
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_set_out_of_sync(device, req->i.sector, req->i.size);
|
|
|
|
drbd_report_io_error(device, req);
|
|
|
|
__drbd_chk_io_error(device, DRBD_READ_ERROR);
|
2012-01-24 20:19:42 +04:00
|
|
|
/* fall through. */
|
|
|
|
case READ_AHEAD_COMPLETED_WITH_ERROR:
|
2016-07-19 12:28:41 +03:00
|
|
|
/* it is legal to fail read-ahead, no __drbd_chk_io_error in that case. */
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING, RQ_LOCAL_COMPLETED);
|
2014-04-28 20:43:24 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case DISCARD_COMPLETED_NOTSUPP:
|
|
|
|
case DISCARD_COMPLETED_WITH_ERROR:
|
|
|
|
/* I'd rather not detach from local disk just because it
|
2018-10-03 23:56:25 +03:00
|
|
|
* failed a REQ_OP_DISCARD. */
|
2014-04-28 20:43:24 +04:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING, RQ_LOCAL_COMPLETED);
|
2012-03-26 19:29:30 +04:00
|
|
|
break;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case QUEUE_FOR_NET_READ:
|
2016-07-19 12:28:41 +03:00
|
|
|
/* READ, and
|
2009-09-26 03:07:19 +04:00
|
|
|
* no local disk,
|
|
|
|
* or target area marked as invalid,
|
|
|
|
* or just got an io-error. */
|
2011-02-22 04:15:32 +03:00
|
|
|
/* from __drbd_make_request
|
2009-09-26 03:07:19 +04:00
|
|
|
* or from bio_endio during read io-error recovery */
|
|
|
|
|
2012-03-26 19:02:45 +04:00
|
|
|
/* So we can verify the handle in the answer packet.
|
|
|
|
* Corresponding drbd_remove_request_interval is in
|
2012-01-24 20:19:42 +04:00
|
|
|
* drbd_req_complete() */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, drbd_interval_empty(&req->i));
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_insert_interval(&device->read_requests, &req->i);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
set_bit(UNPLUG_REMOTE, &device->flags);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
|
|
|
D_ASSERT(device, (req->rq_state & RQ_LOCAL_MASK) == 0);
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED);
|
2012-03-26 19:29:30 +04:00
|
|
|
req->w.cb = w_send_read_req;
|
2013-11-22 15:40:58 +04:00
|
|
|
drbd_queue_work(&connection->sender_work,
|
2011-07-28 17:27:51 +04:00
|
|
|
&req->w);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case QUEUE_FOR_NET_WRITE:
|
2009-09-26 03:07:19 +04:00
|
|
|
/* assert something? */
|
2011-02-22 04:15:32 +03:00
|
|
|
/* from __drbd_make_request only */
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2012-03-26 19:02:45 +04:00
|
|
|
/* Corresponding drbd_remove_request_interval is in
|
2012-01-24 20:19:42 +04:00
|
|
|
* drbd_req_complete() */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, drbd_interval_empty(&req->i));
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_insert_interval(&device->write_requests, &req->i);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
/* NOTE
|
|
|
|
* In case the req ended up on the transfer log before being
|
|
|
|
* queued on the worker, it could lead to this request being
|
|
|
|
* missed during cleanup after connection loss.
|
|
|
|
* So we have to do both operations here,
|
|
|
|
* within the same lock that protects the transfer log.
|
|
|
|
*
|
|
|
|
* _req_add_to_epoch(req); this has to be after the
|
|
|
|
* _maybe_start_new_epoch(req); which happened in
|
2011-02-22 04:15:32 +03:00
|
|
|
* __drbd_make_request, because we now may set the bit
|
2009-09-26 03:07:19 +04:00
|
|
|
* again ourselves to close the current epoch.
|
|
|
|
*
|
|
|
|
* Add req to the (now) current epoch (barrier). */
|
|
|
|
|
2009-11-03 04:22:06 +03:00
|
|
|
/* otherwise we may lose an unplug, which may cause some remote
|
|
|
|
* io-scheduler timeout to expire, increasing maximum latency,
|
|
|
|
* hurting performance. */
|
2011-07-03 15:26:43 +04:00
|
|
|
set_bit(UNPLUG_REMOTE, &device->flags);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
/* queue work item to send data */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED|RQ_EXP_BARR_ACK);
|
2009-09-26 03:07:19 +04:00
|
|
|
req->w.cb = w_send_dblock;
|
2013-11-22 15:40:58 +04:00
|
|
|
drbd_queue_work(&connection->sender_work,
|
2011-07-28 17:27:51 +04:00
|
|
|
&req->w);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
/* close the epoch, in case it outgrew the limit */
|
2011-04-19 19:10:19 +04:00
|
|
|
rcu_read_lock();
|
2013-11-22 15:40:58 +04:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2011-04-19 19:10:19 +04:00
|
|
|
p = nc->max_epoch_size;
|
|
|
|
rcu_read_unlock();
|
2013-11-22 15:40:58 +04:00
|
|
|
if (connection->current_tle_writes >= p)
|
|
|
|
start_new_tl_epoch(connection);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case QUEUE_FOR_SEND_OOS:
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED);
|
2010-12-20 01:53:14 +03:00
|
|
|
req->w.cb = w_send_out_of_sync;
|
2013-11-22 15:40:58 +04:00
|
|
|
drbd_queue_work(&connection->sender_work,
|
2011-07-28 17:27:51 +04:00
|
|
|
&req->w);
|
2010-10-27 16:33:00 +04:00
|
|
|
break;
|
|
|
|
|
2012-03-26 18:46:39 +04:00
|
|
|
case READ_RETRY_REMOTE_CANCELED:
|
2011-01-25 17:37:43 +03:00
|
|
|
case SEND_CANCELED:
|
|
|
|
case SEND_FAILED:
|
2009-09-26 03:07:19 +04:00
|
|
|
/* real cleanup will be done from tl_clear. just update flags
|
|
|
|
* so it is no longer marked as on the worker queue */
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, 0);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case HANDED_OVER_TO_NETWORK:
|
2009-09-26 03:07:19 +04:00
|
|
|
/* assert something? */
|
2013-11-22 15:32:01 +04:00
|
|
|
if (is_pending_write_protocol_A(req))
|
2009-09-26 03:07:19 +04:00
|
|
|
/* this is what is dangerous about protocol A:
|
|
|
|
* pretend it was successfully written on the peer. */
|
2013-11-22 15:32:01 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED|RQ_NET_PENDING,
|
|
|
|
RQ_NET_SENT|RQ_NET_OK);
|
|
|
|
else
|
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, RQ_NET_SENT);
|
|
|
|
/* It is still not yet RQ_NET_DONE until the
|
|
|
|
* corresponding epoch barrier got acked as well,
|
|
|
|
* so we know what to dirty on connection loss. */
|
2012-01-11 12:43:25 +04:00
|
|
|
break;
|
|
|
|
|
2012-03-26 18:44:59 +04:00
|
|
|
case OOS_HANDED_TO_NETWORK:
|
2012-01-11 12:43:25 +04:00
|
|
|
/* Was not set PENDING, no longer QUEUED, so is now DONE
|
|
|
|
* as far as this connection is concerned. */
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, RQ_NET_DONE);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case CONNECTION_LOST_WHILE_PENDING:
|
2009-09-26 03:07:19 +04:00
|
|
|
/* transfer log cleanup after connection loss */
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m,
|
|
|
|
RQ_NET_OK|RQ_NET_PENDING|RQ_COMPLETION_SUSP,
|
|
|
|
RQ_NET_DONE);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2012-08-01 14:33:51 +04:00
|
|
|
case CONFLICT_RESOLVED:
|
|
|
|
/* for superseded conflicting writes of multiple primaries,
|
2009-09-26 03:07:19 +04:00
|
|
|
* there is no need to keep anything in the tl, potential
|
2012-07-24 11:31:18 +04:00
|
|
|
* node crashes are covered by the activity log.
|
|
|
|
*
|
|
|
|
* If this request had been marked as RQ_POSTPONED before,
|
2012-08-01 14:33:51 +04:00
|
|
|
* it will actually not be completed, but "restarted",
|
2012-07-24 11:31:18 +04:00
|
|
|
* resubmitted from the retry worker context. */
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_WRITE_ACK);
|
2012-07-24 11:31:18 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_DONE|RQ_NET_OK);
|
|
|
|
break;
|
|
|
|
|
2012-03-26 18:51:11 +04:00
|
|
|
case WRITE_ACKED_BY_PEER_AND_SIS:
|
2012-07-24 11:31:18 +04:00
|
|
|
req->rq_state |= RQ_NET_SIS;
|
2011-01-25 17:37:43 +03:00
|
|
|
case WRITE_ACKED_BY_PEER:
|
2014-03-20 14:19:22 +04:00
|
|
|
/* Normal operation protocol C: successfully written on peer.
|
|
|
|
* During resync, even in protocol != C,
|
|
|
|
* we requested an explicit write ack anyways.
|
|
|
|
* Which means we cannot even assert anything here.
|
2012-03-23 17:42:19 +04:00
|
|
|
* Nothing more to do here.
|
2009-09-26 03:07:19 +04:00
|
|
|
* We want to keep the tl in place for all protocols, to cater
|
2012-03-23 17:42:19 +04:00
|
|
|
* for volatile write-back caches on lower level devices. */
|
2011-04-14 03:24:47 +04:00
|
|
|
goto ack_common;
|
2011-01-25 17:37:43 +03:00
|
|
|
case RECV_ACKED_BY_PEER:
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_RECEIVE_ACK);
|
2009-09-26 03:07:19 +04:00
|
|
|
/* protocol B; pretends to be successfully written on peer.
|
2011-01-25 17:37:43 +03:00
|
|
|
* see also notes above in HANDED_OVER_TO_NETWORK about
|
2009-09-26 03:07:19 +04:00
|
|
|
* protocol != C */
|
2011-04-14 03:24:47 +04:00
|
|
|
ack_common:
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_OK);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-02-22 04:15:32 +03:00
|
|
|
case POSTPONE_WRITE:
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_WRITE_ACK);
|
2011-04-14 03:24:47 +04:00
|
|
|
/* If this node has already detected the write conflict, the
|
2011-02-22 04:15:32 +03:00
|
|
|
* worker will be waiting on misc_wait. Wake it up once this
|
|
|
|
* request has completed locally.
|
|
|
|
*/
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2011-02-22 04:15:32 +03:00
|
|
|
req->rq_state |= RQ_POSTPONED;
|
2012-01-24 20:19:42 +04:00
|
|
|
if (req->i.waiting)
|
2011-07-03 15:26:43 +04:00
|
|
|
wake_up(&device->misc_wait);
|
2012-01-24 20:19:42 +04:00
|
|
|
/* Do not clear RQ_NET_PENDING. This request will make further
|
|
|
|
* progress via restart_conflicting_writes() or
|
|
|
|
* fail_postponed_requests(). Hopefully. */
|
2011-02-22 04:15:32 +03:00
|
|
|
break;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case NEG_ACKED:
|
2012-08-07 08:47:14 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_OK|RQ_NET_PENDING, 0);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case FAIL_FROZEN_DISK_IO:
|
2010-05-31 12:14:17 +04:00
|
|
|
if (!(req->rq_state & RQ_LOCAL_COMPLETED))
|
|
|
|
break;
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP, 0);
|
2010-05-31 12:14:17 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case RESTART_FROZEN_DISK_IO:
|
2010-05-31 12:14:17 +04:00
|
|
|
if (!(req->rq_state & RQ_LOCAL_COMPLETED))
|
|
|
|
break;
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m,
|
|
|
|
RQ_COMPLETION_SUSP|RQ_LOCAL_COMPLETED,
|
|
|
|
RQ_LOCAL_PENDING);
|
2010-05-31 12:14:17 +04:00
|
|
|
|
|
|
|
rv = MR_READ;
|
|
|
|
if (bio_data_dir(req->master_bio) == WRITE)
|
|
|
|
rv = MR_WRITE;
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
get_ldev(device); /* always succeeds in this call path */
|
2010-05-31 12:14:17 +04:00
|
|
|
req->w.cb = w_restart_disk_io;
|
2013-11-22 15:40:58 +04:00
|
|
|
drbd_queue_work(&connection->sender_work,
|
2011-07-28 17:27:51 +04:00
|
|
|
&req->w);
|
2010-05-31 12:14:17 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case RESEND:
|
2012-07-31 13:22:58 +04:00
|
|
|
/* Simply complete (local only) READs. */
|
|
|
|
if (!(req->rq_state & RQ_WRITE) && !req->w.cb) {
|
2012-08-07 15:28:00 +04:00
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP, 0);
|
2012-07-31 13:22:58 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2010-05-12 19:08:26 +04:00
|
|
|
/* If RQ_NET_OK is already set, we got a P_WRITE_ACK or P_RECV_ACK
|
2012-01-24 20:19:42 +04:00
|
|
|
before the connection loss (B&C only); only P_BARRIER_ACK
|
|
|
|
(or the local completion?) was missing when we suspended.
|
2012-03-26 19:02:45 +04:00
|
|
|
Throwing them out of the TL here by pretending we got a BARRIER_ACK.
|
|
|
|
During connection handshake, we ensure that the peer was not rebooted. */
|
2010-05-12 19:08:26 +04:00
|
|
|
if (!(req->rq_state & RQ_NET_OK)) {
|
2011-07-28 17:27:51 +04:00
|
|
|
/* FIXME could this possibly be a req->dw.cb == w_send_out_of_sync?
|
2012-01-24 20:19:42 +04:00
|
|
|
* in that case we must not set RQ_NET_PENDING. */
|
|
|
|
|
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP, RQ_NET_QUEUED|RQ_NET_PENDING);
|
2010-05-12 19:08:26 +04:00
|
|
|
if (req->w.cb) {
|
2013-11-22 15:40:58 +04:00
|
|
|
/* w.cb expected to be w_send_dblock, or w_send_read_req */
|
|
|
|
drbd_queue_work(&connection->sender_work,
|
2011-07-28 17:27:51 +04:00
|
|
|
&req->w);
|
2010-05-12 19:08:26 +04:00
|
|
|
rv = req->rq_state & RQ_WRITE ? MR_WRITE : MR_READ;
|
2012-01-24 20:19:42 +04:00
|
|
|
} /* else: FIXME can this happen? */
|
2010-05-12 19:08:26 +04:00
|
|
|
break;
|
|
|
|
}
|
2019-01-23 09:33:09 +03:00
|
|
|
/* else, fall through - to BARRIER_ACKED */
|
2010-05-12 19:08:26 +04:00
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case BARRIER_ACKED:
|
2012-01-24 20:19:42 +04:00
|
|
|
/* barrier ack for READ requests does not make sense */
|
2010-05-27 17:07:43 +04:00
|
|
|
if (!(req->rq_state & RQ_WRITE))
|
|
|
|
break;
|
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
if (req->rq_state & RQ_NET_PENDING) {
|
2011-08-17 14:43:25 +04:00
|
|
|
/* barrier came in before all requests were acked.
|
2009-09-26 03:07:19 +04:00
|
|
|
* this is bad, because if the connection is lost now,
|
|
|
|
* we won't be able to clean them up... */
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "FIXME (BARRIER_ACKED but pending)\n");
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2012-01-24 20:19:42 +04:00
|
|
|
/* Allowed to complete requests, even while suspended.
|
|
|
|
* As this is called for all requests within a matching epoch,
|
|
|
|
* we need to filter, and only set RQ_NET_DONE for those that
|
|
|
|
* have actually been on the wire. */
|
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP,
|
|
|
|
(req->rq_state & RQ_NET_MASK) ? RQ_NET_DONE : 0);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
|
|
|
|
2011-01-25 17:37:43 +03:00
|
|
|
case DATA_RECEIVED:
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2012-01-24 20:19:42 +04:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_OK|RQ_NET_DONE);
|
2009-09-26 03:07:19 +04:00
|
|
|
break;
|
2013-03-27 17:08:41 +04:00
|
|
|
|
|
|
|
case QUEUE_AS_DRBD_BARRIER:
|
2013-11-22 15:40:58 +04:00
|
|
|
start_new_tl_epoch(connection);
|
2013-03-27 17:08:41 +04:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_OK|RQ_NET_DONE);
|
|
|
|
break;
|
2019-11-28 06:09:30 +03:00
|
|
|
}
|
2010-06-09 16:07:43 +04:00
|
|
|
|
|
|
|
return rv;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* we may do a local read if:
|
|
|
|
* - we are consistent (of course),
|
|
|
|
* - or we are generally inconsistent,
|
|
|
|
* BUT we are still/already IN SYNC for this area.
|
|
|
|
* since size may be bigger than BM_BLOCK_SIZE,
|
|
|
|
* we may need to check several bits.
|
|
|
|
*/
|
2011-07-03 15:26:43 +04:00
|
|
|
static bool drbd_may_do_local_read(struct drbd_device *device, sector_t sector, int size)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
|
|
|
unsigned long sbnr, ebnr;
|
|
|
|
sector_t esector, nr_sectors;
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (device->state.disk == D_UP_TO_DATE)
|
2010-12-19 22:48:29 +03:00
|
|
|
return true;
|
2011-07-03 15:26:43 +04:00
|
|
|
if (device->state.disk != D_INCONSISTENT)
|
2010-12-19 22:48:29 +03:00
|
|
|
return false;
|
2009-09-26 03:07:19 +04:00
|
|
|
esector = sector + (size >> 9) - 1;
|
2011-07-03 15:26:43 +04:00
|
|
|
nr_sectors = drbd_get_capacity(device->this_bdev);
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, sector < nr_sectors);
|
|
|
|
D_ASSERT(device, esector < nr_sectors);
|
2009-09-26 03:07:19 +04:00
|
|
|
|
|
|
|
sbnr = BM_SECT_TO_BIT(sector);
|
|
|
|
ebnr = BM_SECT_TO_BIT(esector);
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
return drbd_bm_count_bits(device, sbnr, ebnr) == 0;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static bool remote_due_to_read_balancing(struct drbd_device *device, sector_t sector,
|
2012-03-29 19:04:14 +04:00
|
|
|
enum drbd_read_balancing rbm)
|
2011-11-11 15:31:20 +04:00
|
|
|
{
|
|
|
|
struct backing_dev_info *bdi;
|
2011-11-17 13:12:31 +04:00
|
|
|
int stripe_shift;
|
2011-11-11 15:31:20 +04:00
|
|
|
|
|
|
|
switch (rbm) {
|
|
|
|
case RB_CONGESTED_REMOTE:
|
2017-02-02 17:56:50 +03:00
|
|
|
bdi = device->ldev->backing_bdev->bd_disk->queue->backing_dev_info;
|
2011-11-11 15:31:20 +04:00
|
|
|
return bdi_read_congested(bdi);
|
|
|
|
case RB_LEAST_PENDING:
|
2011-07-03 15:26:43 +04:00
|
|
|
return atomic_read(&device->local_cnt) >
|
|
|
|
atomic_read(&device->ap_pending_cnt) + atomic_read(&device->rs_pending_cnt);
|
2011-11-17 13:12:31 +04:00
|
|
|
case RB_32K_STRIPING: /* stripe_shift = 15 */
|
|
|
|
case RB_64K_STRIPING:
|
|
|
|
case RB_128K_STRIPING:
|
|
|
|
case RB_256K_STRIPING:
|
|
|
|
case RB_512K_STRIPING:
|
|
|
|
case RB_1M_STRIPING: /* stripe_shift = 20 */
|
|
|
|
stripe_shift = (rbm - RB_32K_STRIPING + 15);
|
|
|
|
return (sector >> (stripe_shift - 9)) & 1;
|
2011-11-11 15:31:20 +04:00
|
|
|
case RB_ROUND_ROBIN:
|
2011-07-03 15:26:43 +04:00
|
|
|
return test_and_change_bit(READ_BALANCE_RR, &device->flags);
|
2011-11-11 15:31:20 +04:00
|
|
|
case RB_PREFER_REMOTE:
|
|
|
|
return true;
|
|
|
|
case RB_PREFER_LOCAL:
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-01-28 17:53:51 +03:00
|
|
|
/*
|
|
|
|
* complete_conflicting_writes - wait for any conflicting write requests
|
|
|
|
*
|
|
|
|
* The write_requests tree contains all active write requests which we
|
|
|
|
* currently know about. Wait for any requests to complete which conflict with
|
|
|
|
* the new one.
|
2012-03-26 22:12:24 +04:00
|
|
|
*
|
|
|
|
* Only way out: remove the conflicting intervals from the tree.
|
2011-01-28 17:53:51 +03:00
|
|
|
*/
|
2012-03-26 22:12:24 +04:00
|
|
|
static void complete_conflicting_writes(struct drbd_request *req)
|
2011-01-28 17:53:51 +03:00
|
|
|
{
|
2012-03-26 22:12:24 +04:00
|
|
|
DEFINE_WAIT(wait);
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-26 22:12:24 +04:00
|
|
|
struct drbd_interval *i;
|
|
|
|
sector_t sector = req->i.sector;
|
|
|
|
int size = req->i.size;
|
|
|
|
|
|
|
|
for (;;) {
|
2016-06-14 01:26:17 +03:00
|
|
|
drbd_for_each_overlap(i, &device->write_requests, sector, size) {
|
|
|
|
/* Ignore, if already completed to upper layers. */
|
|
|
|
if (i->completed)
|
|
|
|
continue;
|
|
|
|
/* Handle the first found overlap. After the schedule
|
|
|
|
* we have to restart the tree walk. */
|
2012-03-26 22:12:24 +04:00
|
|
|
break;
|
2016-06-14 01:26:17 +03:00
|
|
|
}
|
|
|
|
if (!i) /* if any */
|
|
|
|
break;
|
|
|
|
|
2012-03-26 22:12:24 +04:00
|
|
|
/* Indicate to wake up device->misc_wait on progress. */
|
2016-06-14 01:26:17 +03:00
|
|
|
prepare_to_wait(&device->misc_wait, &wait, TASK_UNINTERRUPTIBLE);
|
2012-03-26 22:12:24 +04:00
|
|
|
i->waiting = true;
|
2011-07-07 16:19:42 +04:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2012-03-26 22:12:24 +04:00
|
|
|
schedule();
|
2011-07-07 16:19:42 +04:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-01-28 17:53:51 +03:00
|
|
|
}
|
2011-07-03 15:26:43 +04:00
|
|
|
finish_wait(&device->misc_wait, &wait);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2016-06-14 01:26:35 +03:00
|
|
|
/* called within req_lock */
|
2011-07-03 15:26:43 +04:00
|
|
|
static void maybe_pull_ahead(struct drbd_device *device)
|
2012-06-08 16:17:36 +04:00
|
|
|
{
|
2011-05-31 16:33:49 +04:00
|
|
|
struct drbd_connection *connection = first_peer_device(device)->connection;
|
2012-03-29 19:04:14 +04:00
|
|
|
struct net_conf *nc;
|
|
|
|
bool congested = false;
|
|
|
|
enum drbd_on_congestion on_congestion;
|
|
|
|
|
2013-03-27 17:08:45 +04:00
|
|
|
rcu_read_lock();
|
2011-05-30 18:32:41 +04:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2012-03-29 19:04:14 +04:00
|
|
|
on_congestion = nc ? nc->on_congestion : OC_BLOCK;
|
2013-03-27 17:08:45 +04:00
|
|
|
rcu_read_unlock();
|
2012-03-29 19:04:14 +04:00
|
|
|
if (on_congestion == OC_BLOCK ||
|
2011-05-30 18:32:41 +04:00
|
|
|
connection->agreed_pro_version < 96)
|
2012-07-30 11:06:26 +04:00
|
|
|
return;
|
2012-06-08 16:17:36 +04:00
|
|
|
|
2014-03-20 17:04:35 +04:00
|
|
|
if (on_congestion == OC_PULL_AHEAD && device->state.conn == C_AHEAD)
|
|
|
|
return; /* nothing to do ... */
|
|
|
|
|
2012-06-08 16:17:36 +04:00
|
|
|
/* If I don't even have good local storage, we can not reasonably try
|
|
|
|
* to pull ahead of the peer. We also need the local reference to make
|
2011-07-03 15:26:43 +04:00
|
|
|
* sure device->act_log is there.
|
2012-06-08 16:17:36 +04:00
|
|
|
*/
|
2011-07-03 15:26:43 +04:00
|
|
|
if (!get_ldev_if_state(device, D_UP_TO_DATE))
|
2012-06-08 16:17:36 +04:00
|
|
|
return;
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
if (nc->cong_fill &&
|
2011-07-03 15:26:43 +04:00
|
|
|
atomic_read(&device->ap_in_flight) >= nc->cong_fill) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_info(device, "Congestion-fill threshold reached\n");
|
2012-03-29 19:04:14 +04:00
|
|
|
congested = true;
|
2012-06-08 16:17:36 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (device->act_log->used >= nc->cong_extents) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_info(device, "Congestion-extents threshold reached\n");
|
2012-03-29 19:04:14 +04:00
|
|
|
congested = true;
|
2012-06-08 16:17:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (congested) {
|
2012-08-07 08:42:09 +04:00
|
|
|
/* start a new epoch for non-mirrored writes */
|
2011-05-31 16:33:49 +04:00
|
|
|
start_new_tl_epoch(first_peer_device(device)->connection);
|
2012-06-08 16:17:36 +04:00
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
if (on_congestion == OC_PULL_AHEAD)
|
2011-07-03 15:26:43 +04:00
|
|
|
_drbd_set_state(_NS(device, conn, C_AHEAD), 0, NULL);
|
2012-03-29 19:04:14 +04:00
|
|
|
else /*nc->on_congestion == OC_DISCONNECT */
|
2011-07-03 15:26:43 +04:00
|
|
|
_drbd_set_state(_NS(device, conn, C_DISCONNECTING), 0, NULL);
|
2012-06-08 16:17:36 +04:00
|
|
|
}
|
2011-07-03 15:26:43 +04:00
|
|
|
put_ldev(device);
|
2012-06-08 16:17:36 +04:00
|
|
|
}
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
/* If this returns false, and req->private_bio is still set,
|
|
|
|
* this should be submitted locally.
|
|
|
|
*
|
|
|
|
* If it returns false, but req->private_bio is not set,
|
|
|
|
* we do not have access to good data :(
|
|
|
|
*
|
|
|
|
* Otherwise, this destroys req->private_bio, if any,
|
|
|
|
* and returns true.
|
|
|
|
*/
|
|
|
|
static bool do_remote_read(struct drbd_request *req)
|
|
|
|
{
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 19:04:14 +04:00
|
|
|
enum drbd_read_balancing rbm;
|
|
|
|
|
|
|
|
if (req->private_bio) {
|
2011-07-03 15:26:43 +04:00
|
|
|
if (!drbd_may_do_local_read(device,
|
2012-03-29 19:04:14 +04:00
|
|
|
req->i.sector, req->i.size)) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
2011-07-03 15:26:43 +04:00
|
|
|
put_ldev(device);
|
2012-03-29 19:04:14 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (device->state.pdsk != D_UP_TO_DATE)
|
2012-03-29 19:04:14 +04:00
|
|
|
return false;
|
|
|
|
|
2012-01-24 20:19:42 +04:00
|
|
|
if (req->private_bio == NULL)
|
|
|
|
return true;
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
/* TODO: improve read balancing decisions, take into account drbd
|
|
|
|
* protocol, pending requests etc. */
|
|
|
|
|
|
|
|
rcu_read_lock();
|
2011-07-03 15:26:43 +04:00
|
|
|
rbm = rcu_dereference(device->ldev->disk_conf)->read_balancing;
|
2012-03-29 19:04:14 +04:00
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
if (rbm == RB_PREFER_LOCAL && req->private_bio)
|
|
|
|
return false; /* submit locally */
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (remote_due_to_read_balancing(device, req->i.sector, rbm)) {
|
2012-03-29 19:04:14 +04:00
|
|
|
if (req->private_bio) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
2011-07-03 15:26:43 +04:00
|
|
|
put_ldev(device);
|
2012-03-29 19:04:14 +04:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2014-08-08 19:48:00 +04:00
|
|
|
bool drbd_should_do_remote(union drbd_dev_state s)
|
|
|
|
{
|
|
|
|
return s.pdsk == D_UP_TO_DATE ||
|
|
|
|
(s.pdsk >= D_INCONSISTENT &&
|
|
|
|
s.conn >= C_WF_BITMAP_T &&
|
|
|
|
s.conn < C_AHEAD);
|
|
|
|
/* Before proto 96 that was >= CONNECTED instead of >= C_WF_BITMAP_T.
|
|
|
|
That is equivalent since before 96 IO was frozen in the C_WF_BITMAP*
|
|
|
|
states. */
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool drbd_should_send_out_of_sync(union drbd_dev_state s)
|
|
|
|
{
|
|
|
|
return s.conn == C_AHEAD || s.conn == C_WF_BITMAP_S;
|
|
|
|
/* pdsk = D_INCONSISTENT as a consequence. Protocol 96 check not necessary
|
|
|
|
since we enter state C_AHEAD only if proto >= 96 */
|
|
|
|
}
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
/* returns number of connections (== 1, for drbd 8.4)
|
|
|
|
* expected to actually write this data,
|
|
|
|
* which does NOT include those that we are L_AHEAD for. */
|
|
|
|
static int drbd_process_write_request(struct drbd_request *req)
|
|
|
|
{
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 19:04:14 +04:00
|
|
|
int remote, send_oos;
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
remote = drbd_should_do_remote(device->state);
|
|
|
|
send_oos = drbd_should_send_out_of_sync(device->state);
|
2012-03-29 19:04:14 +04:00
|
|
|
|
2012-08-03 04:19:09 +04:00
|
|
|
/* Need to replicate writes. Unless it is an empty flush,
|
|
|
|
* which is better mapped to a DRBD P_BARRIER packet,
|
|
|
|
* also for drbd wire protocol compatibility reasons.
|
|
|
|
* If this was a flush, just start a new epoch.
|
|
|
|
* Unless the current epoch was empty anyways, or we are not currently
|
|
|
|
* replicating, in which case there is no point. */
|
|
|
|
if (unlikely(req->i.size == 0)) {
|
|
|
|
/* The only size==0 bios we expect are empty flushes. */
|
2016-08-06 00:35:16 +03:00
|
|
|
D_ASSERT(device, req->master_bio->bi_opf & REQ_PREFLUSH);
|
2012-08-07 08:42:09 +04:00
|
|
|
if (remote)
|
2013-03-27 17:08:41 +04:00
|
|
|
_req_mod(req, QUEUE_AS_DRBD_BARRIER);
|
|
|
|
return remote;
|
2012-08-03 04:19:09 +04:00
|
|
|
}
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
if (!remote && !send_oos)
|
|
|
|
return 0;
|
|
|
|
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, !(remote && send_oos));
|
2012-03-29 19:04:14 +04:00
|
|
|
|
|
|
|
if (remote) {
|
|
|
|
_req_mod(req, TO_BE_SENT);
|
|
|
|
_req_mod(req, QUEUE_FOR_NET_WRITE);
|
2011-07-03 15:26:43 +04:00
|
|
|
} else if (drbd_set_out_of_sync(device, req->i.sector, req->i.size))
|
2012-03-29 19:04:14 +04:00
|
|
|
_req_mod(req, QUEUE_FOR_SEND_OOS);
|
|
|
|
|
|
|
|
return remote;
|
|
|
|
}
|
|
|
|
|
drbd: introduce P_ZEROES (REQ_OP_WRITE_ZEROES on the "wire")
And also re-enable partial-zero-out + discard aligned.
With the introduction of REQ_OP_WRITE_ZEROES,
we started to use that for both WRITE_ZEROES and DISCARDS,
hoping that WRITE_ZEROES would "do what we want",
UNMAP if possible, zero-out the rest.
The example scenario is some LVM "thin" backend.
While an un-allocated block on dm-thin reads as zeroes, on a dm-thin
with "skip_block_zeroing=true", after a partial block write allocated
that block, that same block may well map "undefined old garbage" from
the backends on LBAs that have not yet been written to.
If we cannot distinguish between zero-out and discard on the receiving
side, to avoid "undefined old garbage" to pop up randomly at later times
on supposedly zero-initialized blocks, we'd need to map all discards to
zero-out on the receiving side. But that would potentially do a full
alloc on thinly provisioned backends, even when the expectation was to
unmap/trim/discard/de-allocate.
We need to distinguish on the protocol level, whether we need to guarantee
zeroes (and thus use zero-out, potentially doing the mentioned full-alloc),
or if we want to put the emphasis on discard, and only do a "best effort
zeroing" (by "discarding" blocks aligned to discard-granularity, and zeroing
only potential unaligned head and tail clippings to at least *try* to
avoid "false positives" in an online-verify later), hoping that someone
set skip_block_zeroing=false.
For some discussion regarding this on dm-devel, see also
https://www.mail-archive.com/dm-devel%40redhat.com/msg07965.html
https://www.redhat.com/archives/dm-devel/2018-January/msg00271.html
For backward compatibility, P_TRIM means zero-out, unless the
DRBD_FF_WZEROES feature flag is agreed upon during handshake.
To have upper layers even try to submit WRITE ZEROES requests,
we need to announce "efficient zeroout" independently.
We need to fixup max_write_zeroes_sectors after blk_queue_stack_limits():
if we can handle "zeroes" efficiently on the protocol,
we want to do that, even if our backend does not announce
max_write_zeroes_sectors itself.
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2018-12-20 19:23:42 +03:00
|
|
|
static void drbd_process_discard_or_zeroes_req(struct drbd_request *req, int flags)
|
2016-06-14 01:26:22 +03:00
|
|
|
{
|
drbd: introduce P_ZEROES (REQ_OP_WRITE_ZEROES on the "wire")
And also re-enable partial-zero-out + discard aligned.
With the introduction of REQ_OP_WRITE_ZEROES,
we started to use that for both WRITE_ZEROES and DISCARDS,
hoping that WRITE_ZEROES would "do what we want",
UNMAP if possible, zero-out the rest.
The example scenario is some LVM "thin" backend.
While an un-allocated block on dm-thin reads as zeroes, on a dm-thin
with "skip_block_zeroing=true", after a partial block write allocated
that block, that same block may well map "undefined old garbage" from
the backends on LBAs that have not yet been written to.
If we cannot distinguish between zero-out and discard on the receiving
side, to avoid "undefined old garbage" to pop up randomly at later times
on supposedly zero-initialized blocks, we'd need to map all discards to
zero-out on the receiving side. But that would potentially do a full
alloc on thinly provisioned backends, even when the expectation was to
unmap/trim/discard/de-allocate.
We need to distinguish on the protocol level, whether we need to guarantee
zeroes (and thus use zero-out, potentially doing the mentioned full-alloc),
or if we want to put the emphasis on discard, and only do a "best effort
zeroing" (by "discarding" blocks aligned to discard-granularity, and zeroing
only potential unaligned head and tail clippings to at least *try* to
avoid "false positives" in an online-verify later), hoping that someone
set skip_block_zeroing=false.
For some discussion regarding this on dm-devel, see also
https://www.mail-archive.com/dm-devel%40redhat.com/msg07965.html
https://www.redhat.com/archives/dm-devel/2018-January/msg00271.html
For backward compatibility, P_TRIM means zero-out, unless the
DRBD_FF_WZEROES feature flag is agreed upon during handshake.
To have upper layers even try to submit WRITE ZEROES requests,
we need to announce "efficient zeroout" independently.
We need to fixup max_write_zeroes_sectors after blk_queue_stack_limits():
if we can handle "zeroes" efficiently on the protocol,
we want to do that, even if our backend does not announce
max_write_zeroes_sectors itself.
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2018-12-20 19:23:42 +03:00
|
|
|
int err = drbd_issue_discard_or_zero_out(req->device,
|
|
|
|
req->i.sector, req->i.size >> 9, flags);
|
|
|
|
if (err)
|
2017-06-03 10:38:06 +03:00
|
|
|
req->private_bio->bi_status = BLK_STS_IOERR;
|
2016-06-14 01:26:22 +03:00
|
|
|
bio_endio(req->private_bio);
|
|
|
|
}
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
static void
|
|
|
|
drbd_submit_req_private_bio(struct drbd_request *req)
|
|
|
|
{
|
2011-07-28 17:27:51 +04:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 19:04:14 +04:00
|
|
|
struct bio *bio = req->private_bio;
|
2016-07-19 12:28:41 +03:00
|
|
|
unsigned int type;
|
|
|
|
|
|
|
|
if (bio_op(bio) != REQ_OP_READ)
|
|
|
|
type = DRBD_FAULT_DT_WR;
|
2016-08-06 00:35:16 +03:00
|
|
|
else if (bio->bi_opf & REQ_RAHEAD)
|
2016-07-19 12:28:41 +03:00
|
|
|
type = DRBD_FAULT_DT_RA;
|
|
|
|
else
|
|
|
|
type = DRBD_FAULT_DT_RD;
|
2012-03-29 19:04:14 +04:00
|
|
|
|
2017-08-23 20:10:32 +03:00
|
|
|
bio_set_dev(bio, device->ldev->backing_bdev);
|
2012-03-29 19:04:14 +04:00
|
|
|
|
|
|
|
/* State may have changed since we grabbed our reference on the
|
|
|
|
* ->ldev member. Double check, and short-circuit to endio.
|
|
|
|
* In case the last activity log transaction failed to get on
|
|
|
|
* stable storage, and this is a WRITE, we may not even submit
|
|
|
|
* this bio. */
|
2011-07-03 15:26:43 +04:00
|
|
|
if (get_ldev(device)) {
|
2016-07-19 12:28:41 +03:00
|
|
|
if (drbd_insert_fault(device, type))
|
2015-07-20 16:29:37 +03:00
|
|
|
bio_io_error(bio);
|
drbd: introduce P_ZEROES (REQ_OP_WRITE_ZEROES on the "wire")
And also re-enable partial-zero-out + discard aligned.
With the introduction of REQ_OP_WRITE_ZEROES,
we started to use that for both WRITE_ZEROES and DISCARDS,
hoping that WRITE_ZEROES would "do what we want",
UNMAP if possible, zero-out the rest.
The example scenario is some LVM "thin" backend.
While an un-allocated block on dm-thin reads as zeroes, on a dm-thin
with "skip_block_zeroing=true", after a partial block write allocated
that block, that same block may well map "undefined old garbage" from
the backends on LBAs that have not yet been written to.
If we cannot distinguish between zero-out and discard on the receiving
side, to avoid "undefined old garbage" to pop up randomly at later times
on supposedly zero-initialized blocks, we'd need to map all discards to
zero-out on the receiving side. But that would potentially do a full
alloc on thinly provisioned backends, even when the expectation was to
unmap/trim/discard/de-allocate.
We need to distinguish on the protocol level, whether we need to guarantee
zeroes (and thus use zero-out, potentially doing the mentioned full-alloc),
or if we want to put the emphasis on discard, and only do a "best effort
zeroing" (by "discarding" blocks aligned to discard-granularity, and zeroing
only potential unaligned head and tail clippings to at least *try* to
avoid "false positives" in an online-verify later), hoping that someone
set skip_block_zeroing=false.
For some discussion regarding this on dm-devel, see also
https://www.mail-archive.com/dm-devel%40redhat.com/msg07965.html
https://www.redhat.com/archives/dm-devel/2018-January/msg00271.html
For backward compatibility, P_TRIM means zero-out, unless the
DRBD_FF_WZEROES feature flag is agreed upon during handshake.
To have upper layers even try to submit WRITE ZEROES requests,
we need to announce "efficient zeroout" independently.
We need to fixup max_write_zeroes_sectors after blk_queue_stack_limits():
if we can handle "zeroes" efficiently on the protocol,
we want to do that, even if our backend does not announce
max_write_zeroes_sectors itself.
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2018-12-20 19:23:42 +03:00
|
|
|
else if (bio_op(bio) == REQ_OP_WRITE_ZEROES)
|
|
|
|
drbd_process_discard_or_zeroes_req(req, EE_ZEROOUT |
|
|
|
|
((bio->bi_opf & REQ_NOUNMAP) ? 0 : EE_TRIM));
|
|
|
|
else if (bio_op(bio) == REQ_OP_DISCARD)
|
|
|
|
drbd_process_discard_or_zeroes_req(req, EE_TRIM);
|
2012-03-29 19:04:14 +04:00
|
|
|
else
|
|
|
|
generic_make_request(bio);
|
2011-07-03 15:26:43 +04:00
|
|
|
put_ldev(device);
|
2012-03-29 19:04:14 +04:00
|
|
|
} else
|
2015-07-20 16:29:37 +03:00
|
|
|
bio_io_error(bio);
|
2012-03-29 19:04:14 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static void drbd_queue_write(struct drbd_device *device, struct drbd_request *req)
|
2013-03-19 21:16:54 +04:00
|
|
|
{
|
2013-11-22 15:52:03 +04:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-07-03 15:26:43 +04:00
|
|
|
list_add_tail(&req->tl_requests, &device->submit.writes);
|
2013-11-22 15:52:03 +04:00
|
|
|
list_add_tail(&req->req_pending_master_completion,
|
|
|
|
&device->pending_master_completion[1 /* WRITE */]);
|
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2011-07-03 15:26:43 +04:00
|
|
|
queue_work(device->submit.wq, &device->submit.worker);
|
2014-05-08 00:41:28 +04:00
|
|
|
/* do_submit() may sleep internally on al_wait, too */
|
|
|
|
wake_up(&device->al_wait);
|
2013-03-19 21:16:54 +04:00
|
|
|
}
|
|
|
|
|
2013-03-19 21:16:50 +04:00
|
|
|
/* returns the new drbd_request pointer, if the caller is expected to
|
|
|
|
* drbd_send_and_submit() it (to save latency), or NULL if we queued the
|
|
|
|
* request on the submitter thread.
|
|
|
|
* Returns ERR_PTR(-ENOMEM) if we cannot allocate a drbd_request.
|
|
|
|
*/
|
2013-12-19 13:42:27 +04:00
|
|
|
static struct drbd_request *
|
2013-11-22 15:32:01 +04:00
|
|
|
drbd_request_prepare(struct drbd_device *device, struct bio *bio, unsigned long start_jif)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2013-03-19 21:16:50 +04:00
|
|
|
const int rw = bio_data_dir(bio);
|
2009-09-26 03:07:19 +04:00
|
|
|
struct drbd_request *req;
|
|
|
|
|
|
|
|
/* allocate outside of all locks; */
|
2011-07-03 15:26:43 +04:00
|
|
|
req = drbd_req_new(device, bio);
|
2009-09-26 03:07:19 +04:00
|
|
|
if (!req) {
|
2011-07-03 15:26:43 +04:00
|
|
|
dec_ap_bio(device);
|
2009-09-26 03:07:19 +04:00
|
|
|
/* only pass the error to the upper layers.
|
|
|
|
* if user cannot handle io errors, that's not our business. */
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "could not kmalloc() req\n");
|
2017-06-03 10:38:06 +03:00
|
|
|
bio->bi_status = BLK_STS_RESOURCE;
|
2015-07-20 16:29:37 +03:00
|
|
|
bio_endio(bio);
|
2013-03-19 21:16:50 +04:00
|
|
|
return ERR_PTR(-ENOMEM);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2013-11-22 15:32:01 +04:00
|
|
|
req->start_jif = start_jif;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (!get_ldev(device)) {
|
2012-03-29 19:04:14 +04:00
|
|
|
bio_put(req->private_bio);
|
2009-09-26 03:07:19 +04:00
|
|
|
req->private_bio = NULL;
|
|
|
|
}
|
|
|
|
|
2013-03-19 21:16:57 +04:00
|
|
|
/* Update disk stats */
|
2011-07-03 15:26:43 +04:00
|
|
|
_drbd_start_io_acct(device, req);
|
2013-03-19 21:16:57 +04:00
|
|
|
|
2016-06-14 01:26:22 +03:00
|
|
|
/* process discards always from our submitter thread */
|
2018-06-26 01:51:30 +03:00
|
|
|
if (bio_op(bio) == REQ_OP_WRITE_ZEROES ||
|
|
|
|
bio_op(bio) == REQ_OP_DISCARD)
|
2016-06-14 01:26:22 +03:00
|
|
|
goto queue_for_submitter_thread;
|
|
|
|
|
2012-08-03 04:19:09 +04:00
|
|
|
if (rw == WRITE && req->private_bio && req->i.size
|
2011-07-03 15:26:43 +04:00
|
|
|
&& !test_bit(AL_SUSPENDED, &device->flags)) {
|
2016-06-14 01:26:22 +03:00
|
|
|
if (!drbd_al_begin_io_fastpath(device, &req->i))
|
|
|
|
goto queue_for_submitter_thread;
|
2010-08-31 14:00:50 +04:00
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
2013-11-22 15:32:01 +04:00
|
|
|
req->in_actlog_jif = jiffies;
|
2010-08-31 14:00:50 +04:00
|
|
|
}
|
2013-03-19 21:16:50 +04:00
|
|
|
return req;
|
2016-06-14 01:26:22 +03:00
|
|
|
|
|
|
|
queue_for_submitter_thread:
|
|
|
|
atomic_inc(&device->ap_actlog_cnt);
|
|
|
|
drbd_queue_write(device, req);
|
|
|
|
return NULL;
|
2013-03-19 21:16:50 +04:00
|
|
|
}
|
|
|
|
|
drbd: if there is no good data accessible, writes should be IO errors
If DRBD lost all path to good data,
and the on-no-data-accessible policy is OND_SUSPEND_IO,
all pending and new IO requests are suspended (will block).
If that setting is OND_IO_ERROR, IO will still be completed.
READ to "clean" areas (e.g. on an D_INCONSISTENT device,
and bitmap indicates a block is already in sync) will succeed.
READ to "unclean" areas (bitmap indicates block is out-of-sync),
will return EIO.
If we are already D_DISKLESS (or D_FAILED), we also return EIO.
Unfortunately, on a former R_PRIMARY C_SYNC_TARGET D_INCONSISTENT,
after replication link loss, new WRITE requests still went through OK.
The would also set the "out-of-sync" bit on their way, so READ after
WRITE would still return EIO. Also, the data generation UUIDs had not
been bumped, we would cause data divergence, without being able to
detect it on the next sync handshake, given the right sequence of events
in a multiple error scenario and "improper" order of recovery actions.
The right thing to do is to return EIO for all new writes,
unless we have access to good, current, D_UP_TO_DATE data.
The "established best practices" way to avoid these situations in the
first place is to set OND_SUSPEND_IO, or even do a hard-reset from
the pri-on-incon-degr policy helper hook.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@fb.com>
2016-06-14 01:26:27 +03:00
|
|
|
/* Require at least one path to current data.
|
|
|
|
* We don't want to allow writes on C_STANDALONE D_INCONSISTENT:
|
|
|
|
* We would not allow to read what was written,
|
|
|
|
* we would not have bumped the data generation uuids,
|
|
|
|
* we would cause data divergence for all the wrong reasons.
|
|
|
|
*
|
|
|
|
* If we don't see at least one D_UP_TO_DATE, we will fail this request,
|
|
|
|
* which either returns EIO, or, if OND_SUSPEND_IO is set, suspends IO,
|
|
|
|
* and queues for retry later.
|
|
|
|
*/
|
|
|
|
static bool may_do_writes(struct drbd_device *device)
|
|
|
|
{
|
|
|
|
const union drbd_dev_state s = device->state;
|
|
|
|
return s.disk == D_UP_TO_DATE || s.pdsk == D_UP_TO_DATE;
|
|
|
|
}
|
|
|
|
|
drbd: introduce drbd_recv_header_maybe_unplug
Recently, drbd_recv_header() was changed to potentially
implicitly "unplug" the backend device(s), in case there
is currently nothing to receive.
Be more explicit about it: re-introduce the original drbd_recv_header(),
and introduce a new drbd_recv_header_maybe_unplug() for use by the
receiver "main loop".
Using explicit plugging via blk_start_plug(); blk_finish_plug();
really helps the io-scheduler of the backend with merging requests.
Wrap the receiver "main loop" with such a plug.
Also catch unplug events on the Primary,
and try to propagate.
This is performance relevant. Without this, if the receiving side does
not merge requests, number of IOPS on the peer can me significantly
higher than IOPS on the Primary, and can easily become the bottleneck.
Together, both changes should help to reduce the number of IOPS
as seen on the backend of the receiving side, by increasing
the chance of merging mergable requests, without trading latency
for more throughput.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2017-08-29 11:20:32 +03:00
|
|
|
struct drbd_plug_cb {
|
|
|
|
struct blk_plug_cb cb;
|
|
|
|
struct drbd_request *most_recent_req;
|
|
|
|
/* do we need more? */
|
|
|
|
};
|
|
|
|
|
|
|
|
static void drbd_unplug(struct blk_plug_cb *cb, bool from_schedule)
|
|
|
|
{
|
|
|
|
struct drbd_plug_cb *plug = container_of(cb, struct drbd_plug_cb, cb);
|
|
|
|
struct drbd_resource *resource = plug->cb.data;
|
|
|
|
struct drbd_request *req = plug->most_recent_req;
|
|
|
|
|
2017-08-29 11:20:34 +03:00
|
|
|
kfree(cb);
|
drbd: introduce drbd_recv_header_maybe_unplug
Recently, drbd_recv_header() was changed to potentially
implicitly "unplug" the backend device(s), in case there
is currently nothing to receive.
Be more explicit about it: re-introduce the original drbd_recv_header(),
and introduce a new drbd_recv_header_maybe_unplug() for use by the
receiver "main loop".
Using explicit plugging via blk_start_plug(); blk_finish_plug();
really helps the io-scheduler of the backend with merging requests.
Wrap the receiver "main loop" with such a plug.
Also catch unplug events on the Primary,
and try to propagate.
This is performance relevant. Without this, if the receiving side does
not merge requests, number of IOPS on the peer can me significantly
higher than IOPS on the Primary, and can easily become the bottleneck.
Together, both changes should help to reduce the number of IOPS
as seen on the backend of the receiving side, by increasing
the chance of merging mergable requests, without trading latency
for more throughput.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2017-08-29 11:20:32 +03:00
|
|
|
if (!req)
|
|
|
|
return;
|
|
|
|
|
|
|
|
spin_lock_irq(&resource->req_lock);
|
|
|
|
/* In case the sender did not process it yet, raise the flag to
|
|
|
|
* have it followed with P_UNPLUG_REMOTE just after. */
|
|
|
|
req->rq_state |= RQ_UNPLUG;
|
|
|
|
/* but also queue a generic unplug */
|
|
|
|
drbd_queue_unplug(req->device);
|
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2017-08-29 11:20:34 +03:00
|
|
|
spin_unlock_irq(&resource->req_lock);
|
drbd: introduce drbd_recv_header_maybe_unplug
Recently, drbd_recv_header() was changed to potentially
implicitly "unplug" the backend device(s), in case there
is currently nothing to receive.
Be more explicit about it: re-introduce the original drbd_recv_header(),
and introduce a new drbd_recv_header_maybe_unplug() for use by the
receiver "main loop".
Using explicit plugging via blk_start_plug(); blk_finish_plug();
really helps the io-scheduler of the backend with merging requests.
Wrap the receiver "main loop" with such a plug.
Also catch unplug events on the Primary,
and try to propagate.
This is performance relevant. Without this, if the receiving side does
not merge requests, number of IOPS on the peer can me significantly
higher than IOPS on the Primary, and can easily become the bottleneck.
Together, both changes should help to reduce the number of IOPS
as seen on the backend of the receiving side, by increasing
the chance of merging mergable requests, without trading latency
for more throughput.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2017-08-29 11:20:32 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct drbd_plug_cb* drbd_check_plugged(struct drbd_resource *resource)
|
|
|
|
{
|
|
|
|
/* A lot of text to say
|
|
|
|
* return (struct drbd_plug_cb*)blk_check_plugged(); */
|
|
|
|
struct drbd_plug_cb *plug;
|
|
|
|
struct blk_plug_cb *cb = blk_check_plugged(drbd_unplug, resource, sizeof(*plug));
|
|
|
|
|
|
|
|
if (cb)
|
|
|
|
plug = container_of(cb, struct drbd_plug_cb, cb);
|
|
|
|
else
|
|
|
|
plug = NULL;
|
|
|
|
return plug;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void drbd_update_plug(struct drbd_plug_cb *plug, struct drbd_request *req)
|
|
|
|
{
|
|
|
|
struct drbd_request *tmp = plug->most_recent_req;
|
|
|
|
/* Will be sent to some peer.
|
|
|
|
* Remember to tag it with UNPLUG_REMOTE on unplug */
|
|
|
|
kref_get(&req->kref);
|
|
|
|
plug->most_recent_req = req;
|
|
|
|
if (tmp)
|
|
|
|
kref_put(&tmp->kref, drbd_req_destroy);
|
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static void drbd_send_and_submit(struct drbd_device *device, struct drbd_request *req)
|
2013-03-19 21:16:50 +04:00
|
|
|
{
|
2013-12-04 15:07:09 +04:00
|
|
|
struct drbd_resource *resource = device->resource;
|
2016-07-19 12:28:41 +03:00
|
|
|
const int rw = bio_data_dir(req->master_bio);
|
2013-03-19 21:16:50 +04:00
|
|
|
struct bio_and_error m = { NULL, };
|
|
|
|
bool no_remote = false;
|
2013-12-04 15:07:09 +04:00
|
|
|
bool submit_private_bio = false;
|
2013-03-19 21:16:50 +04:00
|
|
|
|
2013-12-04 15:07:09 +04:00
|
|
|
spin_lock_irq(&resource->req_lock);
|
2011-01-28 17:53:51 +03:00
|
|
|
if (rw == WRITE) {
|
2012-03-26 22:12:24 +04:00
|
|
|
/* This may temporarily give up the req_lock,
|
|
|
|
* but will re-aquire it before it returns here.
|
|
|
|
* Needs to be before the check on drbd_suspended() */
|
|
|
|
complete_conflicting_writes(req);
|
2013-03-27 17:08:45 +04:00
|
|
|
/* no more giving up req_lock from now on! */
|
|
|
|
|
|
|
|
/* check for congestion, and potentially stop sending
|
|
|
|
* full data updates, but start sending "dirty bits" only. */
|
2011-07-03 15:26:43 +04:00
|
|
|
maybe_pull_ahead(device);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2010-05-10 18:42:23 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (drbd_suspended(device)) {
|
2012-03-29 19:04:14 +04:00
|
|
|
/* push back and retry: */
|
|
|
|
req->rq_state |= RQ_POSTPONED;
|
|
|
|
if (req->private_bio) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
2011-07-03 15:26:43 +04:00
|
|
|
put_ldev(device);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2012-03-29 19:04:14 +04:00
|
|
|
goto out;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2016-07-19 12:28:41 +03:00
|
|
|
/* We fail READ early, if we can not serve it.
|
2012-03-29 19:04:14 +04:00
|
|
|
* We must do this before req is registered on any lists.
|
2012-01-24 20:19:42 +04:00
|
|
|
* Otherwise, drbd_req_complete() will queue failed READ for retry. */
|
2012-03-29 19:04:14 +04:00
|
|
|
if (rw != WRITE) {
|
|
|
|
if (!do_remote_read(req) && !req->private_bio)
|
|
|
|
goto nodata;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-11-28 18:04:49 +04:00
|
|
|
/* which transfer log epoch does this belong to? */
|
2011-05-31 16:33:49 +04:00
|
|
|
req->epoch = atomic_read(&first_peer_device(device)->connection->current_tle_nr);
|
2010-05-27 17:07:43 +04:00
|
|
|
|
2012-07-31 11:31:11 +04:00
|
|
|
/* no point in adding empty flushes to the transfer log,
|
|
|
|
* they are mapped to drbd barriers already. */
|
2012-08-07 08:42:09 +04:00
|
|
|
if (likely(req->i.size!=0)) {
|
|
|
|
if (rw == WRITE)
|
2011-05-31 16:33:49 +04:00
|
|
|
first_peer_device(device)->connection->current_tle_writes++;
|
2010-05-27 17:07:43 +04:00
|
|
|
|
2011-05-31 16:33:49 +04:00
|
|
|
list_add_tail(&req->tl_requests, &first_peer_device(device)->connection->transfer_log);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
2010-10-27 14:21:30 +04:00
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
if (rw == WRITE) {
|
drbd: if there is no good data accessible, writes should be IO errors
If DRBD lost all path to good data,
and the on-no-data-accessible policy is OND_SUSPEND_IO,
all pending and new IO requests are suspended (will block).
If that setting is OND_IO_ERROR, IO will still be completed.
READ to "clean" areas (e.g. on an D_INCONSISTENT device,
and bitmap indicates a block is already in sync) will succeed.
READ to "unclean" areas (bitmap indicates block is out-of-sync),
will return EIO.
If we are already D_DISKLESS (or D_FAILED), we also return EIO.
Unfortunately, on a former R_PRIMARY C_SYNC_TARGET D_INCONSISTENT,
after replication link loss, new WRITE requests still went through OK.
The would also set the "out-of-sync" bit on their way, so READ after
WRITE would still return EIO. Also, the data generation UUIDs had not
been bumped, we would cause data divergence, without being able to
detect it on the next sync handshake, given the right sequence of events
in a multiple error scenario and "improper" order of recovery actions.
The right thing to do is to return EIO for all new writes,
unless we have access to good, current, D_UP_TO_DATE data.
The "established best practices" way to avoid these situations in the
first place is to set OND_SUSPEND_IO, or even do a hard-reset from
the pri-on-incon-degr policy helper hook.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@fb.com>
2016-06-14 01:26:27 +03:00
|
|
|
if (req->private_bio && !may_do_writes(device)) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
|
|
|
put_ldev(device);
|
|
|
|
goto nodata;
|
|
|
|
}
|
2012-03-29 19:04:14 +04:00
|
|
|
if (!drbd_process_write_request(req))
|
|
|
|
no_remote = true;
|
|
|
|
} else {
|
|
|
|
/* We either have a private_bio, or we can read from remote.
|
|
|
|
* Otherwise we had done the goto nodata above. */
|
|
|
|
if (req->private_bio == NULL) {
|
|
|
|
_req_mod(req, TO_BE_SENT);
|
|
|
|
_req_mod(req, QUEUE_FOR_NET_READ);
|
drbd: fix potential data divergence after multiple failures
If we get an IO-error during an activity log transaction,
if we failed to write the bitmap of the evicted extent,
we must not write the transaction itself.
If we failed to write the transaction,
we must not even submit the corresponding bio,
as its extent is not yet marked in the activity log.
Otherwise, if this was a disconneted Primary (degraded cluster), which
now lost its disk as well, and we later re-attach the same backend
storage, we possibly "forget" to resync some parts of the disk that
potentially have been changed.
On the receiving side, when receiving from a peer with unhealthy disk,
checking for pdsk == D_DISKLESS is not enough, we need to set out of
sync and do AL transactions for everything pdsk < D_INCONSISTENT on the
receiving side.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
2010-10-19 01:04:07 +04:00
|
|
|
} else
|
2012-03-29 19:04:14 +04:00
|
|
|
no_remote = true;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2017-08-29 11:20:34 +03:00
|
|
|
if (no_remote == false) {
|
|
|
|
struct drbd_plug_cb *plug = drbd_check_plugged(resource);
|
|
|
|
if (plug)
|
|
|
|
drbd_update_plug(plug, req);
|
|
|
|
}
|
drbd: introduce drbd_recv_header_maybe_unplug
Recently, drbd_recv_header() was changed to potentially
implicitly "unplug" the backend device(s), in case there
is currently nothing to receive.
Be more explicit about it: re-introduce the original drbd_recv_header(),
and introduce a new drbd_recv_header_maybe_unplug() for use by the
receiver "main loop".
Using explicit plugging via blk_start_plug(); blk_finish_plug();
really helps the io-scheduler of the backend with merging requests.
Wrap the receiver "main loop" with such a plug.
Also catch unplug events on the Primary,
and try to propagate.
This is performance relevant. Without this, if the receiving side does
not merge requests, number of IOPS on the peer can me significantly
higher than IOPS on the Primary, and can easily become the bottleneck.
Together, both changes should help to reduce the number of IOPS
as seen on the backend of the receiving side, by increasing
the chance of merging mergable requests, without trading latency
for more throughput.
Signed-off-by: Philipp Reisner <philipp.reisner@linbit.com>
Signed-off-by: Lars Ellenberg <lars.ellenberg@linbit.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2017-08-29 11:20:32 +03:00
|
|
|
|
2013-11-22 15:52:03 +04:00
|
|
|
/* If it took the fast path in drbd_request_prepare, add it here.
|
|
|
|
* The slow path has added it already. */
|
|
|
|
if (list_empty(&req->req_pending_master_completion))
|
|
|
|
list_add_tail(&req->req_pending_master_completion,
|
|
|
|
&device->pending_master_completion[rw == WRITE]);
|
2012-03-29 19:04:14 +04:00
|
|
|
if (req->private_bio) {
|
|
|
|
/* needs to be marked within the same spinlock */
|
2015-01-16 19:41:55 +03:00
|
|
|
req->pre_submit_jif = jiffies;
|
2013-11-22 15:52:03 +04:00
|
|
|
list_add_tail(&req->req_pending_local,
|
|
|
|
&device->pending_completion[rw == WRITE]);
|
2012-03-29 19:04:14 +04:00
|
|
|
_req_mod(req, TO_BE_SUBMITTED);
|
|
|
|
/* but we need to give up the spinlock to submit */
|
2013-12-04 15:07:09 +04:00
|
|
|
submit_private_bio = true;
|
2012-03-29 19:04:14 +04:00
|
|
|
} else if (no_remote) {
|
|
|
|
nodata:
|
|
|
|
if (__ratelimit(&drbd_ratelimit_state))
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_err(device, "IO ERROR: neither local nor remote data, sector %llu+%u\n",
|
2012-09-27 17:19:38 +04:00
|
|
|
(unsigned long long)req->i.sector, req->i.size >> 9);
|
2012-03-29 19:04:14 +04:00
|
|
|
/* A write may have been queued for send_oos, however.
|
2012-01-24 20:19:42 +04:00
|
|
|
* So we can not simply free it, we must go through drbd_req_put_completion_ref() */
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2012-03-29 19:04:14 +04:00
|
|
|
out:
|
2017-05-11 11:21:46 +03:00
|
|
|
drbd_req_put_completion_ref(req, &m, 1);
|
2013-12-04 15:07:09 +04:00
|
|
|
spin_unlock_irq(&resource->req_lock);
|
|
|
|
|
|
|
|
/* Even though above is a kref_put(), this is safe.
|
|
|
|
* As long as we still need to submit our private bio,
|
|
|
|
* we hold a completion ref, and the request cannot disappear.
|
|
|
|
* If however this request did not even have a private bio to submit
|
|
|
|
* (e.g. remote read), req may already be invalid now.
|
|
|
|
* That's why we cannot check on req->private_bio. */
|
|
|
|
if (submit_private_bio)
|
|
|
|
drbd_submit_req_private_bio(req);
|
2012-03-29 19:04:14 +04:00
|
|
|
if (m.bio)
|
2011-07-03 15:26:43 +04:00
|
|
|
complete_master_bio(device, &m);
|
2013-03-19 21:16:50 +04:00
|
|
|
}
|
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
void __drbd_make_request(struct drbd_device *device, struct bio *bio, unsigned long start_jif)
|
2013-03-19 21:16:50 +04:00
|
|
|
{
|
2013-11-22 15:32:01 +04:00
|
|
|
struct drbd_request *req = drbd_request_prepare(device, bio, start_jif);
|
2013-03-19 21:16:50 +04:00
|
|
|
if (IS_ERR_OR_NULL(req))
|
|
|
|
return;
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_send_and_submit(device, req);
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static void submit_fast_path(struct drbd_device *device, struct list_head *incoming)
|
2013-03-23 04:14:40 +04:00
|
|
|
{
|
2017-08-29 11:20:34 +03:00
|
|
|
struct blk_plug plug;
|
2013-03-19 21:16:56 +04:00
|
|
|
struct drbd_request *req, *tmp;
|
2017-08-29 11:20:34 +03:00
|
|
|
|
|
|
|
blk_start_plug(&plug);
|
2013-03-19 21:16:56 +04:00
|
|
|
list_for_each_entry_safe(req, tmp, incoming, tl_requests) {
|
|
|
|
const int rw = bio_data_dir(req->master_bio);
|
2013-03-23 04:14:40 +04:00
|
|
|
|
2013-03-19 21:16:56 +04:00
|
|
|
if (rw == WRITE /* rw != WRITE should not even end up here! */
|
|
|
|
&& req->private_bio && req->i.size
|
2011-07-03 15:26:43 +04:00
|
|
|
&& !test_bit(AL_SUSPENDED, &device->flags)) {
|
|
|
|
if (!drbd_al_begin_io_fastpath(device, &req->i))
|
2013-03-19 21:16:56 +04:00
|
|
|
continue;
|
|
|
|
|
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
2013-11-22 15:32:01 +04:00
|
|
|
req->in_actlog_jif = jiffies;
|
2013-12-20 14:22:13 +04:00
|
|
|
atomic_dec(&device->ap_actlog_cnt);
|
2013-03-19 21:16:56 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
list_del_init(&req->tl_requests);
|
2011-07-03 15:26:43 +04:00
|
|
|
drbd_send_and_submit(device, req);
|
2013-03-23 04:14:40 +04:00
|
|
|
}
|
2017-08-29 11:20:34 +03:00
|
|
|
blk_finish_plug(&plug);
|
2013-03-23 04:14:40 +04:00
|
|
|
}
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
static bool prepare_al_transaction_nonblock(struct drbd_device *device,
|
2013-03-19 21:16:56 +04:00
|
|
|
struct list_head *incoming,
|
2014-05-08 00:41:28 +04:00
|
|
|
struct list_head *pending,
|
|
|
|
struct list_head *later)
|
2013-03-19 21:16:56 +04:00
|
|
|
{
|
2017-08-29 11:20:33 +03:00
|
|
|
struct drbd_request *req;
|
2013-03-19 21:16:56 +04:00
|
|
|
int wake = 0;
|
|
|
|
int err;
|
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
spin_lock_irq(&device->al_lock);
|
2017-08-29 11:20:33 +03:00
|
|
|
while ((req = list_first_entry_or_null(incoming, struct drbd_request, tl_requests))) {
|
2011-07-03 15:26:43 +04:00
|
|
|
err = drbd_al_begin_io_nonblock(device, &req->i);
|
2014-05-08 00:41:28 +04:00
|
|
|
if (err == -ENOBUFS)
|
|
|
|
break;
|
2013-03-19 21:16:56 +04:00
|
|
|
if (err == -EBUSY)
|
|
|
|
wake = 1;
|
|
|
|
if (err)
|
2014-05-08 00:41:28 +04:00
|
|
|
list_move_tail(&req->tl_requests, later);
|
|
|
|
else
|
|
|
|
list_move_tail(&req->tl_requests, pending);
|
2013-03-19 21:16:56 +04:00
|
|
|
}
|
2011-07-03 15:26:43 +04:00
|
|
|
spin_unlock_irq(&device->al_lock);
|
2013-03-19 21:16:56 +04:00
|
|
|
if (wake)
|
2011-07-03 15:26:43 +04:00
|
|
|
wake_up(&device->al_wait);
|
2013-03-19 21:16:56 +04:00
|
|
|
return !list_empty(pending);
|
|
|
|
}
|
2013-03-23 04:14:40 +04:00
|
|
|
|
2017-08-29 11:20:34 +03:00
|
|
|
static void send_and_submit_pending(struct drbd_device *device, struct list_head *pending)
|
2014-05-08 00:41:28 +04:00
|
|
|
{
|
2017-08-29 11:20:34 +03:00
|
|
|
struct blk_plug plug;
|
2017-08-29 11:20:33 +03:00
|
|
|
struct drbd_request *req;
|
2014-05-08 00:41:28 +04:00
|
|
|
|
2017-08-29 11:20:34 +03:00
|
|
|
blk_start_plug(&plug);
|
2017-08-29 11:20:33 +03:00
|
|
|
while ((req = list_first_entry_or_null(pending, struct drbd_request, tl_requests))) {
|
2014-05-08 00:41:28 +04:00
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
|
|
|
req->in_actlog_jif = jiffies;
|
|
|
|
atomic_dec(&device->ap_actlog_cnt);
|
|
|
|
list_del_init(&req->tl_requests);
|
|
|
|
drbd_send_and_submit(device, req);
|
|
|
|
}
|
2017-08-29 11:20:34 +03:00
|
|
|
blk_finish_plug(&plug);
|
2014-05-08 00:41:28 +04:00
|
|
|
}
|
|
|
|
|
2013-03-23 04:14:40 +04:00
|
|
|
void do_submit(struct work_struct *ws)
|
|
|
|
{
|
2011-07-03 15:26:43 +04:00
|
|
|
struct drbd_device *device = container_of(ws, struct drbd_device, submit.worker);
|
2014-05-08 00:41:28 +04:00
|
|
|
LIST_HEAD(incoming); /* from drbd_make_request() */
|
|
|
|
LIST_HEAD(pending); /* to be submitted after next AL-transaction commit */
|
|
|
|
LIST_HEAD(busy); /* blocked by resync requests */
|
|
|
|
|
|
|
|
/* grab new incoming requests */
|
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
|
|
|
list_splice_tail_init(&device->submit.writes, &incoming);
|
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2013-03-23 04:14:40 +04:00
|
|
|
|
2013-03-19 21:16:56 +04:00
|
|
|
for (;;) {
|
2014-05-08 00:41:28 +04:00
|
|
|
DEFINE_WAIT(wait);
|
2013-03-23 04:14:40 +04:00
|
|
|
|
2014-05-08 00:41:28 +04:00
|
|
|
/* move used-to-be-busy back to front of incoming */
|
|
|
|
list_splice_init(&busy, &incoming);
|
2011-07-03 15:26:43 +04:00
|
|
|
submit_fast_path(device, &incoming);
|
2013-03-19 21:16:56 +04:00
|
|
|
if (list_empty(&incoming))
|
|
|
|
break;
|
|
|
|
|
2013-03-19 21:16:58 +04:00
|
|
|
for (;;) {
|
2014-05-08 00:41:28 +04:00
|
|
|
prepare_to_wait(&device->al_wait, &wait, TASK_UNINTERRUPTIBLE);
|
|
|
|
|
|
|
|
list_splice_init(&busy, &incoming);
|
|
|
|
prepare_al_transaction_nonblock(device, &incoming, &pending, &busy);
|
|
|
|
if (!list_empty(&pending))
|
|
|
|
break;
|
|
|
|
|
|
|
|
schedule();
|
|
|
|
|
|
|
|
/* If all currently "hot" activity log extents are kept busy by
|
|
|
|
* incoming requests, we still must not totally starve new
|
|
|
|
* requests to "cold" extents.
|
|
|
|
* Something left on &incoming means there had not been
|
|
|
|
* enough update slots available, and the activity log
|
|
|
|
* has been marked as "starving".
|
|
|
|
*
|
|
|
|
* Try again now, without looking for new requests,
|
|
|
|
* effectively blocking all new requests until we made
|
|
|
|
* at least _some_ progress with what we currently have.
|
|
|
|
*/
|
|
|
|
if (!list_empty(&incoming))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Nothing moved to pending, but nothing left
|
|
|
|
* on incoming: all moved to busy!
|
|
|
|
* Grab new and iterate. */
|
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
|
|
|
list_splice_tail_init(&device->submit.writes, &incoming);
|
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
|
|
|
}
|
|
|
|
finish_wait(&device->al_wait, &wait);
|
|
|
|
|
|
|
|
/* If the transaction was full, before all incoming requests
|
|
|
|
* had been processed, skip ahead to commit, and iterate
|
|
|
|
* without splicing in more incoming requests from upper layers.
|
|
|
|
*
|
|
|
|
* Else, if all incoming have been processed,
|
|
|
|
* they have become either "pending" (to be submitted after
|
|
|
|
* next transaction commit) or "busy" (blocked by resync).
|
|
|
|
*
|
|
|
|
* Maybe more was queued, while we prepared the transaction?
|
|
|
|
* Try to stuff those into this transaction as well.
|
|
|
|
* Be strictly non-blocking here,
|
|
|
|
* we already have something to commit.
|
|
|
|
*
|
|
|
|
* Commit if we don't make any more progres.
|
|
|
|
*/
|
|
|
|
|
|
|
|
while (list_empty(&incoming)) {
|
2013-03-19 21:16:58 +04:00
|
|
|
LIST_HEAD(more_pending);
|
|
|
|
LIST_HEAD(more_incoming);
|
|
|
|
bool made_progress;
|
|
|
|
|
|
|
|
/* It is ok to look outside the lock,
|
|
|
|
* it's only an optimization anyways */
|
2011-07-03 15:26:43 +04:00
|
|
|
if (list_empty(&device->submit.writes))
|
2013-03-19 21:16:58 +04:00
|
|
|
break;
|
|
|
|
|
2013-11-22 15:52:03 +04:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-07-03 15:26:43 +04:00
|
|
|
list_splice_tail_init(&device->submit.writes, &more_incoming);
|
2013-11-22 15:52:03 +04:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2013-03-19 21:16:58 +04:00
|
|
|
|
|
|
|
if (list_empty(&more_incoming))
|
|
|
|
break;
|
|
|
|
|
2014-05-08 00:41:28 +04:00
|
|
|
made_progress = prepare_al_transaction_nonblock(device, &more_incoming, &more_pending, &busy);
|
2013-03-19 21:16:58 +04:00
|
|
|
|
|
|
|
list_splice_tail_init(&more_pending, &pending);
|
|
|
|
list_splice_tail_init(&more_incoming, &incoming);
|
|
|
|
if (!made_progress)
|
|
|
|
break;
|
|
|
|
}
|
2013-03-19 21:16:56 +04:00
|
|
|
|
2014-05-08 00:41:28 +04:00
|
|
|
drbd_al_begin_io_commit(device);
|
|
|
|
send_and_submit_pending(device, &pending);
|
2013-03-23 04:14:40 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-11-05 20:41:16 +03:00
|
|
|
blk_qc_t drbd_make_request(struct request_queue *q, struct bio *bio)
|
2009-09-26 03:07:19 +04:00
|
|
|
{
|
2011-07-03 15:26:43 +04:00
|
|
|
struct drbd_device *device = (struct drbd_device *) q->queuedata;
|
2013-11-22 15:32:01 +04:00
|
|
|
unsigned long start_jif;
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2017-06-18 07:38:57 +03:00
|
|
|
blk_queue_split(q, &bio);
|
2015-04-24 08:37:18 +03:00
|
|
|
|
2013-11-22 15:32:01 +04:00
|
|
|
start_jif = jiffies;
|
2010-11-09 19:45:06 +03:00
|
|
|
|
2009-09-26 03:07:19 +04:00
|
|
|
/*
|
|
|
|
* what we "blindly" assume:
|
|
|
|
*/
|
2011-06-27 18:23:33 +04:00
|
|
|
D_ASSERT(device, IS_ALIGNED(bio->bi_iter.bi_size, 512));
|
2009-09-26 03:07:19 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
inc_ap_bio(device);
|
2013-11-22 15:32:01 +04:00
|
|
|
__drbd_make_request(device, bio, start_jif);
|
2015-11-05 20:41:16 +03:00
|
|
|
return BLK_QC_T_NONE;
|
2009-09-26 03:07:19 +04:00
|
|
|
}
|
|
|
|
|
2015-02-19 15:54:11 +03:00
|
|
|
static bool net_timeout_reached(struct drbd_request *net_req,
|
|
|
|
struct drbd_connection *connection,
|
|
|
|
unsigned long now, unsigned long ent,
|
|
|
|
unsigned int ko_count, unsigned int timeout)
|
|
|
|
{
|
|
|
|
struct drbd_device *device = net_req->device;
|
|
|
|
|
|
|
|
if (!time_after(now, net_req->pre_send_jif + ent))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (time_in_range(now, connection->last_reconnect_jif, connection->last_reconnect_jif + ent))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (net_req->rq_state & RQ_NET_PENDING) {
|
|
|
|
drbd_warn(device, "Remote failed to finish a request within %ums > ko-count (%u) * timeout (%u * 0.1s)\n",
|
|
|
|
jiffies_to_msecs(now - net_req->pre_send_jif), ko_count, timeout);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We received an ACK already (or are using protocol A),
|
|
|
|
* but are waiting for the epoch closing barrier ack.
|
|
|
|
* Check if we sent the barrier already. We should not blame the peer
|
|
|
|
* for being unresponsive, if we did not even ask it yet. */
|
|
|
|
if (net_req->epoch == connection->send.current_epoch_nr) {
|
|
|
|
drbd_warn(device,
|
|
|
|
"We did not send a P_BARRIER for %ums > ko-count (%u) * timeout (%u * 0.1s); drbd kernel thread blocked?\n",
|
|
|
|
jiffies_to_msecs(now - net_req->pre_send_jif), ko_count, timeout);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Worst case: we may have been blocked for whatever reason, then
|
|
|
|
* suddenly are able to send a lot of requests (and epoch separating
|
|
|
|
* barriers) in quick succession.
|
|
|
|
* The timestamp of the net_req may be much too old and not correspond
|
|
|
|
* to the sending time of the relevant unack'ed barrier packet, so
|
|
|
|
* would trigger a spurious timeout. The latest barrier packet may
|
|
|
|
* have a too recent timestamp to trigger the timeout, potentially miss
|
|
|
|
* a timeout. Right now we don't have a place to conveniently store
|
|
|
|
* these timestamps.
|
|
|
|
* But in this particular situation, the application requests are still
|
|
|
|
* completed to upper layers, DRBD should still "feel" responsive.
|
|
|
|
* No need yet to kill this connection, it may still recover.
|
|
|
|
* If not, eventually we will have queued enough into the network for
|
|
|
|
* us to block. From that point of view, the timestamp of the last sent
|
|
|
|
* barrier packet is relevant enough.
|
|
|
|
*/
|
|
|
|
if (time_after(now, connection->send.last_sent_barrier_jif + ent)) {
|
|
|
|
drbd_warn(device, "Remote failed to answer a P_BARRIER (sent at %lu jif; now=%lu jif) within %ums > ko-count (%u) * timeout (%u * 0.1s)\n",
|
|
|
|
connection->send.last_sent_barrier_jif, now,
|
|
|
|
jiffies_to_msecs(now - connection->send.last_sent_barrier_jif), ko_count, timeout);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* A request is considered timed out, if
|
|
|
|
* - we have some effective timeout from the configuration,
|
|
|
|
* with some state restrictions applied,
|
|
|
|
* - the oldest request is waiting for a response from the network
|
|
|
|
* resp. the local disk,
|
|
|
|
* - the oldest request is in fact older than the effective timeout,
|
|
|
|
* - the connection was established (resp. disk was attached)
|
|
|
|
* for longer than the timeout already.
|
|
|
|
* Note that for 32bit jiffies and very stable connections/disks,
|
|
|
|
* we may have a wrap around, which is catched by
|
|
|
|
* !time_in_range(now, last_..._jif, last_..._jif + timeout).
|
|
|
|
*
|
|
|
|
* Side effect: once per 32bit wrap-around interval, which means every
|
|
|
|
* ~198 days with 250 HZ, we have a window where the timeout would need
|
|
|
|
* to expire twice (worst case) to become effective. Good enough.
|
|
|
|
*/
|
|
|
|
|
2017-10-18 06:33:01 +03:00
|
|
|
void request_timer_fn(struct timer_list *t)
|
2011-03-01 13:08:28 +03:00
|
|
|
{
|
2017-10-18 06:33:01 +03:00
|
|
|
struct drbd_device *device = from_timer(device, t, request_timer);
|
2011-05-31 16:33:49 +04:00
|
|
|
struct drbd_connection *connection = first_peer_device(device)->connection;
|
2013-11-22 16:00:12 +04:00
|
|
|
struct drbd_request *req_read, *req_write, *req_peer; /* oldest request */
|
2011-04-19 19:10:19 +04:00
|
|
|
struct net_conf *nc;
|
2013-11-22 16:00:12 +04:00
|
|
|
unsigned long oldest_submit_jif;
|
2011-06-29 16:06:08 +04:00
|
|
|
unsigned long ent = 0, dt = 0, et, nt; /* effective timeout = ko_count * timeout */
|
2012-04-25 13:46:14 +04:00
|
|
|
unsigned long now;
|
2015-02-19 15:54:11 +03:00
|
|
|
unsigned int ko_count = 0, timeout = 0;
|
2011-03-01 13:08:28 +03:00
|
|
|
|
2011-04-19 19:10:19 +04:00
|
|
|
rcu_read_lock();
|
2011-05-30 18:32:41 +04:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2015-02-19 15:54:11 +03:00
|
|
|
if (nc && device->state.conn >= C_WF_REPORT_PARAMS) {
|
|
|
|
ko_count = nc->ko_count;
|
|
|
|
timeout = nc->timeout;
|
|
|
|
}
|
2011-07-05 17:38:59 +04:00
|
|
|
|
2011-07-03 15:26:43 +04:00
|
|
|
if (get_ldev(device)) { /* implicit state.disk >= D_INCONSISTENT */
|
|
|
|
dt = rcu_dereference(device->ldev->disk_conf)->disk_timeout * HZ / 10;
|
|
|
|
put_ldev(device);
|
2011-06-29 16:06:08 +04:00
|
|
|
}
|
2011-04-19 19:10:19 +04:00
|
|
|
rcu_read_unlock();
|
2011-03-01 13:08:28 +03:00
|
|
|
|
2015-02-19 15:54:11 +03:00
|
|
|
|
|
|
|
ent = timeout * HZ/10 * ko_count;
|
2011-06-29 16:06:08 +04:00
|
|
|
et = min_not_zero(dt, ent);
|
|
|
|
|
2012-04-25 13:46:14 +04:00
|
|
|
if (!et)
|
2011-03-01 13:08:28 +03:00
|
|
|
return; /* Recurring timer stopped */
|
|
|
|
|
2012-04-25 13:46:14 +04:00
|
|
|
now = jiffies;
|
2013-11-22 16:00:12 +04:00
|
|
|
nt = now + et;
|
2012-04-25 13:46:14 +04:00
|
|
|
|
2011-07-07 16:19:42 +04:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2013-11-22 16:00:12 +04:00
|
|
|
req_read = list_first_entry_or_null(&device->pending_completion[0], struct drbd_request, req_pending_local);
|
|
|
|
req_write = list_first_entry_or_null(&device->pending_completion[1], struct drbd_request, req_pending_local);
|
2015-02-19 15:54:11 +03:00
|
|
|
|
2013-11-22 16:00:12 +04:00
|
|
|
/* maybe the oldest request waiting for the peer is in fact still
|
2015-02-19 15:54:11 +03:00
|
|
|
* blocking in tcp sendmsg. That's ok, though, that's handled via the
|
|
|
|
* socket send timeout, requesting a ping, and bumping ko-count in
|
|
|
|
* we_should_drop_the_connection().
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* check the oldest request we did successfully sent,
|
|
|
|
* but which is still waiting for an ACK. */
|
|
|
|
req_peer = connection->req_ack_pending;
|
|
|
|
|
|
|
|
/* if we don't have such request (e.g. protocoll A)
|
|
|
|
* check the oldest requests which is still waiting on its epoch
|
|
|
|
* closing barrier ack. */
|
|
|
|
if (!req_peer)
|
|
|
|
req_peer = connection->req_not_net_done;
|
2013-11-22 16:00:12 +04:00
|
|
|
|
|
|
|
/* evaluate the oldest peer request only in one timer! */
|
|
|
|
if (req_peer && req_peer->device != device)
|
|
|
|
req_peer = NULL;
|
|
|
|
|
|
|
|
/* do we have something to evaluate? */
|
|
|
|
if (req_peer == NULL && req_write == NULL && req_read == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
oldest_submit_jif =
|
|
|
|
(req_write && req_read)
|
|
|
|
? ( time_before(req_write->pre_submit_jif, req_read->pre_submit_jif)
|
|
|
|
? req_write->pre_submit_jif : req_read->pre_submit_jif )
|
|
|
|
: req_write ? req_write->pre_submit_jif
|
|
|
|
: req_read ? req_read->pre_submit_jif : now;
|
2011-03-01 13:08:28 +03:00
|
|
|
|
2015-02-19 15:54:11 +03:00
|
|
|
if (ent && req_peer && net_timeout_reached(req_peer, connection, now, ent, ko_count, timeout))
|
2014-11-10 19:21:14 +03:00
|
|
|
_conn_request_state(connection, NS(conn, C_TIMEOUT), CS_VERBOSE | CS_HARD);
|
2015-02-19 15:54:11 +03:00
|
|
|
|
2013-11-22 16:00:12 +04:00
|
|
|
if (dt && oldest_submit_jif != now &&
|
|
|
|
time_after(now, oldest_submit_jif + dt) &&
|
2011-07-03 15:26:43 +04:00
|
|
|
!time_in_range(now, device->last_reattach_jif, device->last_reattach_jif + dt)) {
|
2011-07-03 19:53:52 +04:00
|
|
|
drbd_warn(device, "Local backing device failed to meet the disk-timeout\n");
|
2011-07-03 15:26:43 +04:00
|
|
|
__drbd_chk_io_error(device, DRBD_FORCE_DETACH);
|
2011-06-29 16:06:08 +04:00
|
|
|
}
|
2014-04-28 20:43:31 +04:00
|
|
|
|
|
|
|
/* Reschedule timer for the nearest not already expired timeout.
|
|
|
|
* Fallback to now + min(effective network timeout, disk timeout). */
|
2013-11-22 16:00:12 +04:00
|
|
|
ent = (ent && req_peer && time_before(now, req_peer->pre_send_jif + ent))
|
|
|
|
? req_peer->pre_send_jif + ent : now + et;
|
|
|
|
dt = (dt && oldest_submit_jif != now && time_before(now, oldest_submit_jif + dt))
|
|
|
|
? oldest_submit_jif + dt : now + et;
|
2014-04-28 20:43:31 +04:00
|
|
|
nt = time_before(ent, dt) ? ent : dt;
|
2013-11-22 16:00:12 +04:00
|
|
|
out:
|
2014-09-11 16:29:08 +04:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2011-07-03 15:26:43 +04:00
|
|
|
mod_timer(&device->request_timer, nt);
|
2011-03-01 13:08:28 +03:00
|
|
|
}
|