2009-09-26 07:07:19 +08: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>.
|
|
|
|
|
|
|
|
drbd is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
drbd is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with drbd; see the file COPYING. If not, write to
|
|
|
|
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/drbd.h>
|
|
|
|
#include "drbd_int.h"
|
|
|
|
#include "drbd_req.h"
|
|
|
|
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static bool drbd_may_do_local_read(struct drbd_device *device, sector_t sector, int size);
|
2011-12-03 18:18:56 +08:00
|
|
|
|
2009-09-26 07:07:19 +08:00
|
|
|
/* Update disk stats at start of I/O request */
|
2011-07-03 19:26:43 +08:00
|
|
|
static void _drbd_start_io_acct(struct drbd_device *device, struct drbd_request *req)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2013-03-20 01:16:50 +08:00
|
|
|
const int rw = bio_data_dir(req->master_bio);
|
2009-09-26 07:07:19 +08:00
|
|
|
int cpu;
|
|
|
|
cpu = part_stat_lock();
|
2011-07-03 19:26:43 +08:00
|
|
|
part_round_stats(cpu, &device->vdisk->part0);
|
|
|
|
part_stat_inc(cpu, &device->vdisk->part0, ios[rw]);
|
|
|
|
part_stat_add(cpu, &device->vdisk->part0, sectors[rw], req->i.size >> 9);
|
2011-11-07 17:54:28 +08:00
|
|
|
(void) cpu; /* The macro invocations above want the cpu argument, I do not like
|
|
|
|
the compiler warning about cpu only assigned but never used... */
|
2011-07-03 19:26:43 +08:00
|
|
|
part_inc_in_flight(&device->vdisk->part0, rw);
|
2009-09-26 07:07:19 +08:00
|
|
|
part_stat_unlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Update disk stats when completing request upwards */
|
2011-07-03 19:26:43 +08:00
|
|
|
static void _drbd_end_io_acct(struct drbd_device *device, struct drbd_request *req)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
|
|
|
int rw = bio_data_dir(req->master_bio);
|
|
|
|
unsigned long duration = jiffies - req->start_time;
|
|
|
|
int cpu;
|
|
|
|
cpu = part_stat_lock();
|
2011-07-03 19:26:43 +08:00
|
|
|
part_stat_add(cpu, &device->vdisk->part0, ticks[rw], duration);
|
|
|
|
part_round_stats(cpu, &device->vdisk->part0);
|
|
|
|
part_dec_in_flight(&device->vdisk->part0, rw);
|
2009-09-26 07:07:19 +08:00
|
|
|
part_stat_unlock();
|
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static struct drbd_request *drbd_req_new(struct drbd_device *device,
|
2011-01-27 01:45:11 +08:00
|
|
|
struct bio *bio_src)
|
|
|
|
{
|
|
|
|
struct drbd_request *req;
|
|
|
|
|
|
|
|
req = mempool_alloc(drbd_request_mempool, GFP_NOIO);
|
|
|
|
if (!req)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
drbd_req_make_private_bio(req, bio_src);
|
|
|
|
req->rq_state = bio_data_dir(bio_src) == WRITE ? RQ_WRITE : 0;
|
2011-07-28 21:27:51 +08:00
|
|
|
req->device = device;
|
2011-01-27 01:45:11 +08:00
|
|
|
req->master_bio = bio_src;
|
|
|
|
req->epoch = 0;
|
2011-01-28 17:31:04 +08:00
|
|
|
|
2011-01-27 01:45:11 +08:00
|
|
|
drbd_clear_interval(&req->i);
|
2013-10-12 06:44:27 +08:00
|
|
|
req->i.sector = bio_src->bi_iter.bi_sector;
|
|
|
|
req->i.size = bio_src->bi_iter.bi_size;
|
2011-01-27 21:42:51 +08:00
|
|
|
req->i.local = true;
|
2011-01-28 17:31:04 +08:00
|
|
|
req->i.waiting = false;
|
|
|
|
|
2011-01-27 01:45:11 +08:00
|
|
|
INIT_LIST_HEAD(&req->tl_requests);
|
|
|
|
INIT_LIST_HEAD(&req->w.list);
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* one reference to be put by __drbd_make_request */
|
2012-01-24 23:58:11 +08:00
|
|
|
atomic_set(&req->completion_ref, 1);
|
2012-01-25 00:19:42 +08:00
|
|
|
/* one kref as long as completion_ref > 0 */
|
2012-01-24 23:58:11 +08:00
|
|
|
kref_init(&req->kref);
|
2011-01-27 01:45:11 +08:00
|
|
|
return req;
|
|
|
|
}
|
|
|
|
|
2012-07-24 16:12:36 +08:00
|
|
|
void drbd_req_destroy(struct kref *kref)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2012-01-24 23:58:11 +08:00
|
|
|
struct drbd_request *req = container_of(kref, struct drbd_request, kref);
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-01-25 00:19:42 +08: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 23:53:52 +08:00
|
|
|
drbd_err(device, "drbd_req_destroy: Logic BUG rq_state = 0x%x, completion_ref = %d\n",
|
2012-01-25 00:19:42 +08:00
|
|
|
s, atomic_read(&req->completion_ref));
|
|
|
|
return;
|
|
|
|
}
|
2010-05-27 21:07:43 +08:00
|
|
|
|
|
|
|
/* remove it from the transfer log.
|
|
|
|
* well, only if it had been there in the first
|
|
|
|
* place... if it had not (local only or conflicting
|
|
|
|
* and never sent), it should still be "empty" as
|
|
|
|
* initialized in drbd_req_new(), so we can list_del() it
|
|
|
|
* here unconditionally */
|
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 17:36:25 +08:00
|
|
|
list_del_init(&req->tl_requests);
|
2010-05-27 21:07:43 +08:00
|
|
|
|
2009-09-26 07:07:19 +08: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 23:58:11 +08:00
|
|
|
if (s & RQ_WRITE) {
|
2009-09-26 07:07:19 +08: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 20:08:35 +08: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 20:39:44 +08:00
|
|
|
if (!(s & RQ_NET_OK) || !(s & RQ_LOCAL_OK))
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_set_out_of_sync(device, req->i.sector, req->i.size);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-08-28 20:39:44 +08:00
|
|
|
if ((s & RQ_NET_OK) && (s & RQ_LOCAL_OK) && (s & RQ_NET_SIS))
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_set_in_sync(device, req->i.sector, req->i.size);
|
2012-08-28 20:39:44 +08:00
|
|
|
}
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
/* one might be tempted to move the drbd_al_complete_io
|
2011-02-17 23:46:59 +08:00
|
|
|
* to the local io completion callback drbd_request_endio.
|
2009-09-26 07:07:19 +08: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 21:23:14 +08:00
|
|
|
if (s & RQ_IN_ACT_LOG) {
|
2011-07-03 19:26:43 +08:00
|
|
|
if (get_ldev_if_state(device, D_FAILED)) {
|
|
|
|
drbd_al_complete_io(device, &req->i);
|
|
|
|
put_ldev(device);
|
2009-09-26 07:07:19 +08:00
|
|
|
} else if (__ratelimit(&drbd_ratelimit_state)) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_warn(device, "Should have called drbd_al_complete_io(, %llu, %u), "
|
2011-03-31 21:18:56 +08:00
|
|
|
"but my Disk seems to have failed :(\n",
|
|
|
|
(unsigned long long) req->i.sector, req->i.size);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-24 16:12:36 +08:00
|
|
|
mempool_free(req, drbd_request_mempool);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-05-30 22:32:41 +08:00
|
|
|
static void wake_all_senders(struct drbd_connection *connection)
|
|
|
|
{
|
|
|
|
wake_up(&connection->sender_work.q_wait);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-11-28 22:04:49 +08:00
|
|
|
/* must hold resource->req_lock */
|
2011-05-30 22:32:41 +08:00
|
|
|
void start_new_tl_epoch(struct drbd_connection *connection)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2012-08-07 12:42:09 +08:00
|
|
|
/* no point closing an epoch, if it is empty, anyways. */
|
2011-05-30 22:32:41 +08:00
|
|
|
if (connection->current_tle_writes == 0)
|
2012-08-07 12:42:09 +08:00
|
|
|
return;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-05-30 22:32:41 +08:00
|
|
|
connection->current_tle_writes = 0;
|
|
|
|
atomic_inc(&connection->current_tle_nr);
|
|
|
|
wake_all_senders(connection);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
void complete_master_bio(struct drbd_device *device,
|
2009-09-26 07:07:19 +08:00
|
|
|
struct bio_and_error *m)
|
|
|
|
{
|
|
|
|
bio_endio(m->bio, m->error);
|
2011-07-03 19:26:43 +08:00
|
|
|
dec_ap_bio(device);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-01-28 17:31:04 +08:00
|
|
|
|
|
|
|
static void drbd_remove_request_interval(struct rb_root *root,
|
|
|
|
struct drbd_request *req)
|
|
|
|
{
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2011-01-28 17:31:04 +08:00
|
|
|
struct drbd_interval *i = &req->i;
|
|
|
|
|
|
|
|
drbd_remove_interval(root, i);
|
|
|
|
|
|
|
|
/* Wake up any processes waiting for this request to complete. */
|
|
|
|
if (i->waiting)
|
2011-07-03 19:26:43 +08:00
|
|
|
wake_up(&device->misc_wait);
|
2011-01-28 17:31:04 +08:00
|
|
|
}
|
|
|
|
|
2009-09-26 07:07:19 +08: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 23:02:45 +08:00
|
|
|
static
|
2012-01-25 00:19:42 +08:00
|
|
|
void drbd_req_complete(struct drbd_request *req, struct bio_and_error *m)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2012-01-25 00:19:42 +08:00
|
|
|
const unsigned s = req->rq_state;
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-01-25 00:19:42 +08:00
|
|
|
int rw;
|
|
|
|
int error, ok;
|
2009-09-26 07:07:19 +08: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-25 00:19:42 +08: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 23:53:52 +08:00
|
|
|
drbd_err(device, "drbd_req_complete: Logic BUG rq_state = 0x%x\n", s);
|
2009-09-26 07:07:19 +08:00
|
|
|
return;
|
2012-01-25 00:19:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!req->master_bio) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device, "drbd_req_complete: Logic BUG, master_bio == NULL!\n");
|
2009-09-26 07:07:19 +08:00
|
|
|
return;
|
2012-01-25 00:19:42 +08:00
|
|
|
}
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
rw = bio_rw(req->master_bio);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08: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 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* remove the request from the conflict detection
|
|
|
|
* respective block_id verification hash */
|
|
|
|
if (!drbd_interval_empty(&req->i)) {
|
|
|
|
struct rb_root *root;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
if (rw == WRITE)
|
2011-07-03 19:26:43 +08:00
|
|
|
root = &device->write_requests;
|
2012-01-25 00:19:42 +08:00
|
|
|
else
|
2011-07-03 19:26:43 +08:00
|
|
|
root = &device->read_requests;
|
2012-01-25 00:19:42 +08:00
|
|
|
drbd_remove_request_interval(root, req);
|
2013-03-27 21:08:41 +08:00
|
|
|
}
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08: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.
|
|
|
|
*/
|
|
|
|
if (rw == WRITE &&
|
2011-05-31 20:33:49 +08: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 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* Update disk stats */
|
2011-07-03 19:26:43 +08:00
|
|
|
_drbd_end_io_acct(device, req);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08: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.
|
|
|
|
*
|
|
|
|
* READA may fail, and will not be retried.
|
|
|
|
*
|
|
|
|
* WRITE should have used all available paths already.
|
|
|
|
*/
|
|
|
|
if (!ok && rw == READ && !list_empty(&req->tl_requests))
|
|
|
|
req->rq_state |= RQ_POSTPONED;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
if (!(req->rq_state & RQ_POSTPONED)) {
|
2009-09-26 07:07:19 +08:00
|
|
|
m->error = ok ? 0 : (error ?: -EIO);
|
|
|
|
m->bio = req->master_bio;
|
|
|
|
req->master_bio = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
static int drbd_req_put_completion_ref(struct drbd_request *req, struct bio_and_error *m, int put)
|
2010-06-23 23:18:51 +08:00
|
|
|
{
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, m || (req->rq_state & RQ_POSTPONED));
|
2012-01-25 00:19:42 +08:00
|
|
|
|
|
|
|
if (!atomic_sub_and_test(put, &req->completion_ref))
|
|
|
|
return 0;
|
2011-03-14 20:01:50 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
drbd_req_complete(req, m);
|
2012-07-24 16:12:36 +08:00
|
|
|
|
|
|
|
if (req->rq_state & RQ_POSTPONED) {
|
|
|
|
/* don't destroy the req object just yet,
|
|
|
|
* but queue it for retry */
|
|
|
|
drbd_restart_request(req);
|
|
|
|
return 0;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
2012-07-24 16:12:36 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
return 1;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-01-25 00:19:42 +08: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 23:18:51 +08:00
|
|
|
{
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-01-25 00:19:42 +08:00
|
|
|
unsigned s = req->rq_state;
|
|
|
|
int c_put = 0;
|
|
|
|
int k_put = 0;
|
2010-06-23 23:18:51 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (drbd_suspended(device) && !((s | clear) & RQ_COMPLETION_SUSP))
|
2012-08-14 17:28:52 +08:00
|
|
|
set |= RQ_COMPLETION_SUSP;
|
2010-06-23 23:18:51 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* apply */
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
req->rq_state &= ~clear;
|
|
|
|
req->rq_state |= set;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* no change? */
|
|
|
|
if (req->rq_state == s)
|
|
|
|
return;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
/* intent: get references */
|
|
|
|
|
|
|
|
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 19:26:43 +08:00
|
|
|
inc_ap_pending(device);
|
2012-01-25 00:19:42 +08:00
|
|
|
atomic_inc(&req->completion_ref);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
if (!(s & RQ_NET_QUEUED) && (set & RQ_NET_QUEUED))
|
|
|
|
atomic_inc(&req->completion_ref);
|
|
|
|
|
|
|
|
if (!(s & RQ_EXP_BARR_ACK) && (set & RQ_EXP_BARR_ACK))
|
|
|
|
kref_get(&req->kref); /* wait for the DONE */
|
|
|
|
|
|
|
|
if (!(s & RQ_NET_SENT) && (set & RQ_NET_SENT))
|
2011-07-03 19:26:43 +08:00
|
|
|
atomic_add(req->i.size >> 9, &device->ap_in_flight);
|
2012-01-25 00:19:42 +08:00
|
|
|
|
2012-08-14 17:28:52 +08:00
|
|
|
if (!(s & RQ_COMPLETION_SUSP) && (set & RQ_COMPLETION_SUSP))
|
|
|
|
atomic_inc(&req->completion_ref);
|
|
|
|
|
2012-01-25 00:19:42 +08: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 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_LOCAL_PENDING);
|
2012-01-25 00:19:42 +08:00
|
|
|
/* local completion may still come in later,
|
|
|
|
* we need to keep the req object around. */
|
|
|
|
kref_get(&req->kref);
|
|
|
|
++c_put;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
if ((s & RQ_LOCAL_PENDING) && (clear & RQ_LOCAL_PENDING)) {
|
|
|
|
if (req->rq_state & RQ_LOCAL_ABORTED)
|
|
|
|
++k_put;
|
|
|
|
else
|
|
|
|
++c_put;
|
|
|
|
}
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
if ((s & RQ_NET_PENDING) && (clear & RQ_NET_PENDING)) {
|
2011-07-03 19:26:43 +08:00
|
|
|
dec_ap_pending(device);
|
2012-01-25 00:19:42 +08:00
|
|
|
++c_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((s & RQ_NET_QUEUED) && (clear & RQ_NET_QUEUED))
|
|
|
|
++c_put;
|
|
|
|
|
|
|
|
if ((s & RQ_EXP_BARR_ACK) && !(s & RQ_NET_DONE) && (set & RQ_NET_DONE)) {
|
|
|
|
if (req->rq_state & RQ_NET_SENT)
|
2011-07-03 19:26:43 +08:00
|
|
|
atomic_sub(req->i.size >> 9, &device->ap_in_flight);
|
2012-01-25 00:19:42 +08:00
|
|
|
++k_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* potentially complete and destroy */
|
|
|
|
|
|
|
|
if (k_put || c_put) {
|
|
|
|
/* Completion does it's own kref_put. If we are going to
|
|
|
|
* kref_sub below, we need req to be still around then. */
|
|
|
|
int at_least = k_put + !!c_put;
|
|
|
|
int refcount = atomic_read(&req->kref.refcount);
|
|
|
|
if (refcount < at_least)
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device,
|
2012-01-25 00:19:42 +08:00
|
|
|
"mod_rq_state: Logic BUG: %x -> %x: refcount = %d, should be >= %d\n",
|
|
|
|
s, req->rq_state, refcount, at_least);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If we made progress, retry conflicting peer requests, if any. */
|
|
|
|
if (req->i.waiting)
|
2011-07-03 19:26:43 +08:00
|
|
|
wake_up(&device->misc_wait);
|
2012-01-25 00:19:42 +08:00
|
|
|
|
|
|
|
if (c_put)
|
|
|
|
k_put += drbd_req_put_completion_ref(req, m, c_put);
|
|
|
|
if (k_put)
|
|
|
|
kref_sub(&req->kref, k_put, drbd_req_destroy);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static void drbd_report_io_error(struct drbd_device *device, struct drbd_request *req)
|
2012-09-26 20:07:04 +08:00
|
|
|
{
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
|
2012-09-27 21:19:38 +08:00
|
|
|
if (!__ratelimit(&drbd_ratelimit_state))
|
2012-09-26 20:07:04 +08:00
|
|
|
return;
|
|
|
|
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_warn(device, "local %s IO error sector %llu+%u on %s\n",
|
2012-09-26 20:07:04 +08:00
|
|
|
(req->rq_state & RQ_WRITE) ? "WRITE" : "READ",
|
2012-09-27 21:19:38 +08:00
|
|
|
(unsigned long long)req->i.sector,
|
|
|
|
req->i.size >> 9,
|
2011-07-03 19:26:43 +08:00
|
|
|
bdevname(device->ldev->backing_bdev, b));
|
2012-09-26 20:07:04 +08:00
|
|
|
}
|
|
|
|
|
2009-09-26 07:07:19 +08: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 20:07:43 +08:00
|
|
|
int __req_mod(struct drbd_request *req, enum drbd_req_event what,
|
2009-09-26 07:07:19 +08:00
|
|
|
struct bio_and_error *m)
|
|
|
|
{
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2011-04-19 23:10:19 +08:00
|
|
|
struct net_conf *nc;
|
2011-04-14 07:24:47 +08:00
|
|
|
int p, rv = 0;
|
2011-02-22 09:15:32 +08:00
|
|
|
|
|
|
|
if (m)
|
|
|
|
m->bio = NULL;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
switch (what) {
|
|
|
|
default:
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device, "LOGIC BUG in %s:%u\n", __FILE__ , __LINE__);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* does not happen...
|
|
|
|
* initialization done in drbd_req_new
|
2011-01-25 22:37:43 +08:00
|
|
|
case CREATED:
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
*/
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case TO_BE_SENT: /* via network */
|
2011-02-22 09:15:32 +08:00
|
|
|
/* reached via __drbd_make_request
|
2009-09-26 07:07:19 +08:00
|
|
|
* and from w_read_retry_remote */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, !(req->rq_state & RQ_NET_MASK));
|
2011-04-19 23:10:19 +08:00
|
|
|
rcu_read_lock();
|
2011-05-31 20:33:49 +08:00
|
|
|
nc = rcu_dereference(first_peer_device(device)->connection->net_conf);
|
2011-04-19 23:10:19 +08:00
|
|
|
p = nc->wire_protocol;
|
|
|
|
rcu_read_unlock();
|
2011-04-14 07:24:47 +08:00
|
|
|
req->rq_state |=
|
|
|
|
p == DRBD_PROT_C ? RQ_EXP_WRITE_ACK :
|
|
|
|
p == DRBD_PROT_B ? RQ_EXP_RECEIVE_ACK : 0;
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_PENDING);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case TO_BE_SUBMITTED: /* locally */
|
2011-02-22 09:15:32 +08:00
|
|
|
/* reached via __drbd_make_request */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, !(req->rq_state & RQ_LOCAL_MASK));
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_LOCAL_PENDING);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case COMPLETED_OK:
|
2011-03-14 20:01:50 +08:00
|
|
|
if (req->rq_state & RQ_WRITE)
|
2011-07-03 19:26:43 +08:00
|
|
|
device->writ_cnt += req->i.size >> 9;
|
2009-09-26 07:07:19 +08:00
|
|
|
else
|
2011-07-03 19:26:43 +08:00
|
|
|
device->read_cnt += req->i.size >> 9;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING,
|
|
|
|
RQ_LOCAL_COMPLETED|RQ_LOCAL_OK);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-07-05 21:38:59 +08:00
|
|
|
case ABORT_DISK_IO:
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_LOCAL_ABORTED);
|
2011-03-14 20:01:50 +08: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 21:18:21 +08:00
|
|
|
case WRITE_COMPLETED_WITH_ERROR:
|
2011-07-03 19:26:43 +08: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 21:18:21 +08:00
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING, RQ_LOCAL_COMPLETED);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case READ_COMPLETED_WITH_ERROR:
|
2011-07-03 19:26:43 +08: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-25 00:19:42 +08:00
|
|
|
/* fall through. */
|
|
|
|
case READ_AHEAD_COMPLETED_WITH_ERROR:
|
|
|
|
/* it is legal to fail READA, no __drbd_chk_io_error in that case. */
|
|
|
|
mod_rq_state(req, m, RQ_LOCAL_PENDING, RQ_LOCAL_COMPLETED);
|
2012-03-26 23:29:30 +08:00
|
|
|
break;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case QUEUE_FOR_NET_READ:
|
2009-09-26 07:07:19 +08:00
|
|
|
/* READ or READA, and
|
|
|
|
* no local disk,
|
|
|
|
* or target area marked as invalid,
|
|
|
|
* or just got an io-error. */
|
2011-02-22 09:15:32 +08:00
|
|
|
/* from __drbd_make_request
|
2009-09-26 07:07:19 +08:00
|
|
|
* or from bio_endio during read io-error recovery */
|
|
|
|
|
2012-03-26 23:02:45 +08:00
|
|
|
/* So we can verify the handle in the answer packet.
|
|
|
|
* Corresponding drbd_remove_request_interval is in
|
2012-01-25 00:19:42 +08:00
|
|
|
* drbd_req_complete() */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, drbd_interval_empty(&req->i));
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_insert_interval(&device->read_requests, &req->i);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
set_bit(UNPLUG_REMOTE, &device->flags);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
|
|
|
D_ASSERT(device, (req->rq_state & RQ_LOCAL_MASK) == 0);
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED);
|
2012-03-26 23:29:30 +08:00
|
|
|
req->w.cb = w_send_read_req;
|
2011-07-28 21:27:51 +08:00
|
|
|
drbd_queue_work(&first_peer_device(device)->connection->sender_work,
|
|
|
|
&req->w);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case QUEUE_FOR_NET_WRITE:
|
2009-09-26 07:07:19 +08:00
|
|
|
/* assert something? */
|
2011-02-22 09:15:32 +08:00
|
|
|
/* from __drbd_make_request only */
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-03-26 23:02:45 +08:00
|
|
|
/* Corresponding drbd_remove_request_interval is in
|
2012-01-25 00:19:42 +08:00
|
|
|
* drbd_req_complete() */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, drbd_interval_empty(&req->i));
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_insert_interval(&device->write_requests, &req->i);
|
2009-09-26 07:07:19 +08: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 09:15:32 +08:00
|
|
|
* __drbd_make_request, because we now may set the bit
|
2009-09-26 07:07:19 +08:00
|
|
|
* again ourselves to close the current epoch.
|
|
|
|
*
|
|
|
|
* Add req to the (now) current epoch (barrier). */
|
|
|
|
|
2009-11-03 09:22:06 +08: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 19:26:43 +08:00
|
|
|
set_bit(UNPLUG_REMOTE, &device->flags);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
/* queue work item to send data */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED|RQ_EXP_BARR_ACK);
|
2009-09-26 07:07:19 +08:00
|
|
|
req->w.cb = w_send_dblock;
|
2011-07-28 21:27:51 +08:00
|
|
|
drbd_queue_work(&first_peer_device(device)->connection->sender_work,
|
|
|
|
&req->w);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
/* close the epoch, in case it outgrew the limit */
|
2011-04-19 23:10:19 +08:00
|
|
|
rcu_read_lock();
|
2011-05-31 20:33:49 +08:00
|
|
|
nc = rcu_dereference(first_peer_device(device)->connection->net_conf);
|
2011-04-19 23:10:19 +08:00
|
|
|
p = nc->max_epoch_size;
|
|
|
|
rcu_read_unlock();
|
2011-05-31 20:33:49 +08:00
|
|
|
if (first_peer_device(device)->connection->current_tle_writes >= p)
|
|
|
|
start_new_tl_epoch(first_peer_device(device)->connection);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case QUEUE_FOR_SEND_OOS:
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_QUEUED);
|
2010-12-20 06:53:14 +08:00
|
|
|
req->w.cb = w_send_out_of_sync;
|
2011-07-28 21:27:51 +08:00
|
|
|
drbd_queue_work(&first_peer_device(device)->connection->sender_work,
|
|
|
|
&req->w);
|
2010-10-27 20:33:00 +08:00
|
|
|
break;
|
|
|
|
|
2012-03-26 22:46:39 +08:00
|
|
|
case READ_RETRY_REMOTE_CANCELED:
|
2011-01-25 22:37:43 +08:00
|
|
|
case SEND_CANCELED:
|
|
|
|
case SEND_FAILED:
|
2009-09-26 07:07:19 +08: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-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, 0);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case HANDED_OVER_TO_NETWORK:
|
2009-09-26 07:07:19 +08:00
|
|
|
/* assert something? */
|
|
|
|
if (bio_data_dir(req->master_bio) == WRITE &&
|
2011-04-14 07:24:47 +08:00
|
|
|
!(req->rq_state & (RQ_EXP_RECEIVE_ACK | RQ_EXP_WRITE_ACK))) {
|
2009-09-26 07:07:19 +08:00
|
|
|
/* this is what is dangerous about protocol A:
|
|
|
|
* pretend it was successfully written on the peer. */
|
2012-01-25 00:19:42 +08:00
|
|
|
if (req->rq_state & RQ_NET_PENDING)
|
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_OK);
|
|
|
|
/* else: neg-ack was faster... */
|
2009-09-26 07:07:19 +08:00
|
|
|
/* 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-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, RQ_NET_SENT);
|
2012-01-11 16:43:25 +08:00
|
|
|
break;
|
|
|
|
|
2012-03-26 22:44:59 +08:00
|
|
|
case OOS_HANDED_TO_NETWORK:
|
2012-01-11 16:43:25 +08:00
|
|
|
/* Was not set PENDING, no longer QUEUED, so is now DONE
|
|
|
|
* as far as this connection is concerned. */
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_QUEUED, RQ_NET_DONE);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case CONNECTION_LOST_WHILE_PENDING:
|
2009-09-26 07:07:19 +08:00
|
|
|
/* transfer log cleanup after connection loss */
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m,
|
|
|
|
RQ_NET_OK|RQ_NET_PENDING|RQ_COMPLETION_SUSP,
|
|
|
|
RQ_NET_DONE);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2012-08-01 18:33:51 +08:00
|
|
|
case CONFLICT_RESOLVED:
|
|
|
|
/* for superseded conflicting writes of multiple primaries,
|
2009-09-26 07:07:19 +08:00
|
|
|
* there is no need to keep anything in the tl, potential
|
2012-07-24 15:31:18 +08:00
|
|
|
* node crashes are covered by the activity log.
|
|
|
|
*
|
|
|
|
* If this request had been marked as RQ_POSTPONED before,
|
2012-08-01 18:33:51 +08:00
|
|
|
* it will actually not be completed, but "restarted",
|
2012-07-24 15:31:18 +08:00
|
|
|
* resubmitted from the retry worker context. */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_WRITE_ACK);
|
2012-07-24 15:31:18 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_DONE|RQ_NET_OK);
|
|
|
|
break;
|
|
|
|
|
2012-03-26 22:51:11 +08:00
|
|
|
case WRITE_ACKED_BY_PEER_AND_SIS:
|
2012-07-24 15:31:18 +08:00
|
|
|
req->rq_state |= RQ_NET_SIS;
|
2011-01-25 22:37:43 +08:00
|
|
|
case WRITE_ACKED_BY_PEER:
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_WRITE_ACK);
|
2009-09-26 07:07:19 +08:00
|
|
|
/* protocol C; successfully written on peer.
|
2012-03-23 21:42:19 +08:00
|
|
|
* Nothing more to do here.
|
2009-09-26 07:07:19 +08:00
|
|
|
* We want to keep the tl in place for all protocols, to cater
|
2012-03-23 21:42:19 +08:00
|
|
|
* for volatile write-back caches on lower level devices. */
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-04-14 07:24:47 +08:00
|
|
|
goto ack_common;
|
2011-01-25 22:37:43 +08:00
|
|
|
case RECV_ACKED_BY_PEER:
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_RECEIVE_ACK);
|
2009-09-26 07:07:19 +08:00
|
|
|
/* protocol B; pretends to be successfully written on peer.
|
2011-01-25 22:37:43 +08:00
|
|
|
* see also notes above in HANDED_OVER_TO_NETWORK about
|
2009-09-26 07:07:19 +08:00
|
|
|
* protocol != C */
|
2011-04-14 07:24:47 +08:00
|
|
|
ack_common:
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_OK);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-02-22 09:15:32 +08:00
|
|
|
case POSTPONE_WRITE:
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_EXP_WRITE_ACK);
|
2011-04-14 07:24:47 +08:00
|
|
|
/* If this node has already detected the write conflict, the
|
2011-02-22 09:15:32 +08:00
|
|
|
* worker will be waiting on misc_wait. Wake it up once this
|
|
|
|
* request has completed locally.
|
|
|
|
*/
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2011-02-22 09:15:32 +08:00
|
|
|
req->rq_state |= RQ_POSTPONED;
|
2012-01-25 00:19:42 +08:00
|
|
|
if (req->i.waiting)
|
2011-07-03 19:26:43 +08:00
|
|
|
wake_up(&device->misc_wait);
|
2012-01-25 00:19:42 +08: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 09:15:32 +08:00
|
|
|
break;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case NEG_ACKED:
|
2012-08-07 12:47:14 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_OK|RQ_NET_PENDING, 0);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case FAIL_FROZEN_DISK_IO:
|
2010-05-31 16:14:17 +08:00
|
|
|
if (!(req->rq_state & RQ_LOCAL_COMPLETED))
|
|
|
|
break;
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP, 0);
|
2010-05-31 16:14:17 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case RESTART_FROZEN_DISK_IO:
|
2010-05-31 16:14:17 +08:00
|
|
|
if (!(req->rq_state & RQ_LOCAL_COMPLETED))
|
|
|
|
break;
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m,
|
|
|
|
RQ_COMPLETION_SUSP|RQ_LOCAL_COMPLETED,
|
|
|
|
RQ_LOCAL_PENDING);
|
2010-05-31 16:14:17 +08:00
|
|
|
|
|
|
|
rv = MR_READ;
|
|
|
|
if (bio_data_dir(req->master_bio) == WRITE)
|
|
|
|
rv = MR_WRITE;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
get_ldev(device); /* always succeeds in this call path */
|
2010-05-31 16:14:17 +08:00
|
|
|
req->w.cb = w_restart_disk_io;
|
2011-07-28 21:27:51 +08:00
|
|
|
drbd_queue_work(&first_peer_device(device)->connection->sender_work,
|
|
|
|
&req->w);
|
2010-05-31 16:14:17 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case RESEND:
|
2012-07-31 17:22:58 +08:00
|
|
|
/* Simply complete (local only) READs. */
|
|
|
|
if (!(req->rq_state & RQ_WRITE) && !req->w.cb) {
|
2012-08-07 19:28:00 +08:00
|
|
|
mod_rq_state(req, m, RQ_COMPLETION_SUSP, 0);
|
2012-07-31 17:22:58 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2010-05-12 23:08:26 +08:00
|
|
|
/* If RQ_NET_OK is already set, we got a P_WRITE_ACK or P_RECV_ACK
|
2012-01-25 00:19:42 +08:00
|
|
|
before the connection loss (B&C only); only P_BARRIER_ACK
|
|
|
|
(or the local completion?) was missing when we suspended.
|
2012-03-26 23:02:45 +08: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 23:08:26 +08:00
|
|
|
if (!(req->rq_state & RQ_NET_OK)) {
|
2011-07-28 21:27:51 +08:00
|
|
|
/* FIXME could this possibly be a req->dw.cb == w_send_out_of_sync?
|
2012-01-25 00:19:42 +08: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 23:08:26 +08:00
|
|
|
if (req->w.cb) {
|
2011-07-28 21:27:51 +08:00
|
|
|
drbd_queue_work(&first_peer_device(device)->connection->sender_work,
|
|
|
|
&req->w);
|
2010-05-12 23:08:26 +08:00
|
|
|
rv = req->rq_state & RQ_WRITE ? MR_WRITE : MR_READ;
|
2012-01-25 00:19:42 +08:00
|
|
|
} /* else: FIXME can this happen? */
|
2010-05-12 23:08:26 +08:00
|
|
|
break;
|
|
|
|
}
|
2011-01-25 22:37:43 +08:00
|
|
|
/* else, fall through to BARRIER_ACKED */
|
2010-05-12 23:08:26 +08:00
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case BARRIER_ACKED:
|
2012-01-25 00:19:42 +08:00
|
|
|
/* barrier ack for READ requests does not make sense */
|
2010-05-27 21:07:43 +08:00
|
|
|
if (!(req->rq_state & RQ_WRITE))
|
|
|
|
break;
|
|
|
|
|
2009-09-26 07:07:19 +08:00
|
|
|
if (req->rq_state & RQ_NET_PENDING) {
|
2011-08-17 18:43:25 +08:00
|
|
|
/* barrier came in before all requests were acked.
|
2009-09-26 07:07:19 +08:00
|
|
|
* this is bad, because if the connection is lost now,
|
|
|
|
* we won't be able to clean them up... */
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device, "FIXME (BARRIER_ACKED but pending)\n");
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
2012-01-25 00:19:42 +08: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 07:07:19 +08:00
|
|
|
break;
|
|
|
|
|
2011-01-25 22:37:43 +08:00
|
|
|
case DATA_RECEIVED:
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->rq_state & RQ_NET_PENDING);
|
2012-01-25 00:19:42 +08:00
|
|
|
mod_rq_state(req, m, RQ_NET_PENDING, RQ_NET_OK|RQ_NET_DONE);
|
2009-09-26 07:07:19 +08:00
|
|
|
break;
|
2013-03-27 21:08:41 +08:00
|
|
|
|
|
|
|
case QUEUE_AS_DRBD_BARRIER:
|
2011-05-31 20:33:49 +08:00
|
|
|
start_new_tl_epoch(first_peer_device(device)->connection);
|
2013-03-27 21:08:41 +08:00
|
|
|
mod_rq_state(req, m, 0, RQ_NET_OK|RQ_NET_DONE);
|
|
|
|
break;
|
2009-09-26 07:07:19 +08:00
|
|
|
};
|
2010-06-09 20:07:43 +08:00
|
|
|
|
|
|
|
return rv;
|
2009-09-26 07:07:19 +08: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 19:26:43 +08:00
|
|
|
static bool drbd_may_do_local_read(struct drbd_device *device, sector_t sector, int size)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
|
|
|
unsigned long sbnr, ebnr;
|
|
|
|
sector_t esector, nr_sectors;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (device->state.disk == D_UP_TO_DATE)
|
2010-12-20 03:48:29 +08:00
|
|
|
return true;
|
2011-07-03 19:26:43 +08:00
|
|
|
if (device->state.disk != D_INCONSISTENT)
|
2010-12-20 03:48:29 +08:00
|
|
|
return false;
|
2009-09-26 07:07:19 +08:00
|
|
|
esector = sector + (size >> 9) - 1;
|
2011-07-03 19:26:43 +08:00
|
|
|
nr_sectors = drbd_get_capacity(device->this_bdev);
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, sector < nr_sectors);
|
|
|
|
D_ASSERT(device, esector < nr_sectors);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
|
|
|
sbnr = BM_SECT_TO_BIT(sector);
|
|
|
|
ebnr = BM_SECT_TO_BIT(esector);
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
return drbd_bm_count_bits(device, sbnr, ebnr) == 0;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static bool remote_due_to_read_balancing(struct drbd_device *device, sector_t sector,
|
2012-03-29 23:04:14 +08:00
|
|
|
enum drbd_read_balancing rbm)
|
2011-11-11 19:31:20 +08:00
|
|
|
{
|
|
|
|
struct backing_dev_info *bdi;
|
2011-11-17 17:12:31 +08:00
|
|
|
int stripe_shift;
|
2011-11-11 19:31:20 +08:00
|
|
|
|
|
|
|
switch (rbm) {
|
|
|
|
case RB_CONGESTED_REMOTE:
|
2011-07-03 19:26:43 +08:00
|
|
|
bdi = &device->ldev->backing_bdev->bd_disk->queue->backing_dev_info;
|
2011-11-11 19:31:20 +08:00
|
|
|
return bdi_read_congested(bdi);
|
|
|
|
case RB_LEAST_PENDING:
|
2011-07-03 19:26:43 +08:00
|
|
|
return atomic_read(&device->local_cnt) >
|
|
|
|
atomic_read(&device->ap_pending_cnt) + atomic_read(&device->rs_pending_cnt);
|
2011-11-17 17:12:31 +08: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 19:31:20 +08:00
|
|
|
case RB_ROUND_ROBIN:
|
2011-07-03 19:26:43 +08:00
|
|
|
return test_and_change_bit(READ_BALANCE_RR, &device->flags);
|
2011-11-11 19:31:20 +08:00
|
|
|
case RB_PREFER_REMOTE:
|
|
|
|
return true;
|
|
|
|
case RB_PREFER_LOCAL:
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-01-28 22:53:51 +08: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-27 02:12:24 +08:00
|
|
|
*
|
|
|
|
* Only way out: remove the conflicting intervals from the tree.
|
2011-01-28 22:53:51 +08:00
|
|
|
*/
|
2012-03-27 02:12:24 +08:00
|
|
|
static void complete_conflicting_writes(struct drbd_request *req)
|
2011-01-28 22:53:51 +08:00
|
|
|
{
|
2012-03-27 02:12:24 +08:00
|
|
|
DEFINE_WAIT(wait);
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-27 02:12:24 +08:00
|
|
|
struct drbd_interval *i;
|
|
|
|
sector_t sector = req->i.sector;
|
|
|
|
int size = req->i.size;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
i = drbd_find_overlap(&device->write_requests, sector, size);
|
2012-03-27 02:12:24 +08:00
|
|
|
if (!i)
|
|
|
|
return;
|
2011-01-28 22:53:51 +08:00
|
|
|
|
2012-03-27 02:12:24 +08:00
|
|
|
for (;;) {
|
2011-07-03 19:26:43 +08:00
|
|
|
prepare_to_wait(&device->misc_wait, &wait, TASK_UNINTERRUPTIBLE);
|
|
|
|
i = drbd_find_overlap(&device->write_requests, sector, size);
|
2011-01-28 22:53:51 +08:00
|
|
|
if (!i)
|
2012-03-27 02:12:24 +08:00
|
|
|
break;
|
|
|
|
/* Indicate to wake up device->misc_wait on progress. */
|
|
|
|
i->waiting = true;
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2012-03-27 02:12:24 +08:00
|
|
|
schedule();
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-01-28 22:53:51 +08:00
|
|
|
}
|
2011-07-03 19:26:43 +08:00
|
|
|
finish_wait(&device->misc_wait, &wait);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
/* called within req_lock and rcu_read_lock() */
|
2011-07-03 19:26:43 +08:00
|
|
|
static void maybe_pull_ahead(struct drbd_device *device)
|
2012-06-08 20:17:36 +08:00
|
|
|
{
|
2011-05-31 20:33:49 +08:00
|
|
|
struct drbd_connection *connection = first_peer_device(device)->connection;
|
2012-03-29 23:04:14 +08:00
|
|
|
struct net_conf *nc;
|
|
|
|
bool congested = false;
|
|
|
|
enum drbd_on_congestion on_congestion;
|
|
|
|
|
2013-03-27 21:08:45 +08:00
|
|
|
rcu_read_lock();
|
2011-05-30 22:32:41 +08:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2012-03-29 23:04:14 +08:00
|
|
|
on_congestion = nc ? nc->on_congestion : OC_BLOCK;
|
2013-03-27 21:08:45 +08:00
|
|
|
rcu_read_unlock();
|
2012-03-29 23:04:14 +08:00
|
|
|
if (on_congestion == OC_BLOCK ||
|
2011-05-30 22:32:41 +08:00
|
|
|
connection->agreed_pro_version < 96)
|
2012-07-30 15:06:26 +08:00
|
|
|
return;
|
2012-06-08 20:17:36 +08: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 19:26:43 +08:00
|
|
|
* sure device->act_log is there.
|
2012-06-08 20:17:36 +08:00
|
|
|
*/
|
2011-07-03 19:26:43 +08:00
|
|
|
if (!get_ldev_if_state(device, D_UP_TO_DATE))
|
2012-06-08 20:17:36 +08:00
|
|
|
return;
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (nc->cong_fill &&
|
2011-07-03 19:26:43 +08:00
|
|
|
atomic_read(&device->ap_in_flight) >= nc->cong_fill) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_info(device, "Congestion-fill threshold reached\n");
|
2012-03-29 23:04:14 +08:00
|
|
|
congested = true;
|
2012-06-08 20:17:36 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (device->act_log->used >= nc->cong_extents) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_info(device, "Congestion-extents threshold reached\n");
|
2012-03-29 23:04:14 +08:00
|
|
|
congested = true;
|
2012-06-08 20:17:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (congested) {
|
2012-08-07 12:42:09 +08:00
|
|
|
/* start a new epoch for non-mirrored writes */
|
2011-05-31 20:33:49 +08:00
|
|
|
start_new_tl_epoch(first_peer_device(device)->connection);
|
2012-06-08 20:17:36 +08:00
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (on_congestion == OC_PULL_AHEAD)
|
2011-07-03 19:26:43 +08:00
|
|
|
_drbd_set_state(_NS(device, conn, C_AHEAD), 0, NULL);
|
2012-03-29 23:04:14 +08:00
|
|
|
else /*nc->on_congestion == OC_DISCONNECT */
|
2011-07-03 19:26:43 +08:00
|
|
|
_drbd_set_state(_NS(device, conn, C_DISCONNECTING), 0, NULL);
|
2012-06-08 20:17:36 +08:00
|
|
|
}
|
2011-07-03 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2012-06-08 20:17:36 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08: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 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 23:04:14 +08:00
|
|
|
enum drbd_read_balancing rbm;
|
|
|
|
|
|
|
|
if (req->private_bio) {
|
2011-07-03 19:26:43 +08:00
|
|
|
if (!drbd_may_do_local_read(device,
|
2012-03-29 23:04:14 +08:00
|
|
|
req->i.sector, req->i.size)) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
2011-07-03 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2012-03-29 23:04:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (device->state.pdsk != D_UP_TO_DATE)
|
2012-03-29 23:04:14 +08:00
|
|
|
return false;
|
|
|
|
|
2012-01-25 00:19:42 +08:00
|
|
|
if (req->private_bio == NULL)
|
|
|
|
return true;
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
/* TODO: improve read balancing decisions, take into account drbd
|
|
|
|
* protocol, pending requests etc. */
|
|
|
|
|
|
|
|
rcu_read_lock();
|
2011-07-03 19:26:43 +08:00
|
|
|
rbm = rcu_dereference(device->ldev->disk_conf)->read_balancing;
|
2012-03-29 23:04:14 +08:00
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
if (rbm == RB_PREFER_LOCAL && req->private_bio)
|
|
|
|
return false; /* submit locally */
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (remote_due_to_read_balancing(device, req->i.sector, rbm)) {
|
2012-03-29 23:04:14 +08:00
|
|
|
if (req->private_bio) {
|
|
|
|
bio_put(req->private_bio);
|
|
|
|
req->private_bio = NULL;
|
2011-07-03 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2012-03-29 23:04:14 +08:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* 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 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 23:04:14 +08:00
|
|
|
int remote, send_oos;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
remote = drbd_should_do_remote(device->state);
|
|
|
|
send_oos = drbd_should_send_out_of_sync(device->state);
|
2012-03-29 23:04:14 +08:00
|
|
|
|
2012-08-03 08:19:09 +08: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. */
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, req->master_bio->bi_rw & REQ_FLUSH);
|
2012-08-07 12:42:09 +08:00
|
|
|
if (remote)
|
2013-03-27 21:08:41 +08:00
|
|
|
_req_mod(req, QUEUE_AS_DRBD_BARRIER);
|
|
|
|
return remote;
|
2012-08-03 08:19:09 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (!remote && !send_oos)
|
|
|
|
return 0;
|
|
|
|
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, !(remote && send_oos));
|
2012-03-29 23:04:14 +08:00
|
|
|
|
|
|
|
if (remote) {
|
|
|
|
_req_mod(req, TO_BE_SENT);
|
|
|
|
_req_mod(req, QUEUE_FOR_NET_WRITE);
|
2011-07-03 19:26:43 +08:00
|
|
|
} else if (drbd_set_out_of_sync(device, req->i.sector, req->i.size))
|
2012-03-29 23:04:14 +08:00
|
|
|
_req_mod(req, QUEUE_FOR_SEND_OOS);
|
|
|
|
|
|
|
|
return remote;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
drbd_submit_req_private_bio(struct drbd_request *req)
|
|
|
|
{
|
2011-07-28 21:27:51 +08:00
|
|
|
struct drbd_device *device = req->device;
|
2012-03-29 23:04:14 +08:00
|
|
|
struct bio *bio = req->private_bio;
|
|
|
|
const int rw = bio_rw(bio);
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
bio->bi_bdev = device->ldev->backing_bdev;
|
2012-03-29 23:04:14 +08: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 19:26:43 +08:00
|
|
|
if (get_ldev(device)) {
|
|
|
|
if (drbd_insert_fault(device,
|
2012-03-29 23:04:14 +08:00
|
|
|
rw == WRITE ? DRBD_FAULT_DT_WR
|
|
|
|
: rw == READ ? DRBD_FAULT_DT_RD
|
|
|
|
: DRBD_FAULT_DT_RA))
|
|
|
|
bio_endio(bio, -EIO);
|
|
|
|
else
|
|
|
|
generic_make_request(bio);
|
2011-07-03 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2012-03-29 23:04:14 +08:00
|
|
|
} else
|
|
|
|
bio_endio(bio, -EIO);
|
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static void drbd_queue_write(struct drbd_device *device, struct drbd_request *req)
|
2013-03-20 01:16:54 +08:00
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
spin_lock(&device->submit.lock);
|
|
|
|
list_add_tail(&req->tl_requests, &device->submit.writes);
|
|
|
|
spin_unlock(&device->submit.lock);
|
|
|
|
queue_work(device->submit.wq, &device->submit.worker);
|
2013-03-20 01:16:54 +08:00
|
|
|
}
|
|
|
|
|
2013-03-20 01:16:50 +08: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 17:42:27 +08:00
|
|
|
static struct drbd_request *
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_request_prepare(struct drbd_device *device, struct bio *bio, unsigned long start_time)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2013-03-20 01:16:50 +08:00
|
|
|
const int rw = bio_data_dir(bio);
|
2009-09-26 07:07:19 +08:00
|
|
|
struct drbd_request *req;
|
|
|
|
|
|
|
|
/* allocate outside of all locks; */
|
2011-07-03 19:26:43 +08:00
|
|
|
req = drbd_req_new(device, bio);
|
2009-09-26 07:07:19 +08:00
|
|
|
if (!req) {
|
2011-07-03 19:26:43 +08:00
|
|
|
dec_ap_bio(device);
|
2009-09-26 07:07:19 +08:00
|
|
|
/* only pass the error to the upper layers.
|
|
|
|
* if user cannot handle io errors, that's not our business. */
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device, "could not kmalloc() req\n");
|
2009-09-26 07:07:19 +08:00
|
|
|
bio_endio(bio, -ENOMEM);
|
2013-03-20 01:16:50 +08:00
|
|
|
return ERR_PTR(-ENOMEM);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
2010-11-10 00:45:06 +08:00
|
|
|
req->start_time = start_time;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (!get_ldev(device)) {
|
2012-03-29 23:04:14 +08:00
|
|
|
bio_put(req->private_bio);
|
2009-09-26 07:07:19 +08:00
|
|
|
req->private_bio = NULL;
|
|
|
|
}
|
|
|
|
|
2013-03-20 01:16:57 +08:00
|
|
|
/* Update disk stats */
|
2011-07-03 19:26:43 +08:00
|
|
|
_drbd_start_io_acct(device, req);
|
2013-03-20 01:16:57 +08:00
|
|
|
|
2012-08-03 08:19:09 +08:00
|
|
|
if (rw == WRITE && req->private_bio && req->i.size
|
2011-07-03 19:26:43 +08:00
|
|
|
&& !test_bit(AL_SUSPENDED, &device->flags)) {
|
|
|
|
if (!drbd_al_begin_io_fastpath(device, &req->i)) {
|
|
|
|
drbd_queue_write(device, req);
|
2013-03-20 01:16:54 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2010-08-31 18:00:50 +08:00
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
|
|
|
}
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2013-03-20 01:16:50 +08:00
|
|
|
return req;
|
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static void drbd_send_and_submit(struct drbd_device *device, struct drbd_request *req)
|
2013-03-20 01:16:50 +08:00
|
|
|
{
|
|
|
|
const int rw = bio_rw(req->master_bio);
|
|
|
|
struct bio_and_error m = { NULL, };
|
|
|
|
bool no_remote = false;
|
|
|
|
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-01-28 22:53:51 +08:00
|
|
|
if (rw == WRITE) {
|
2012-03-27 02:12:24 +08: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 21:08:45 +08: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 19:26:43 +08:00
|
|
|
maybe_pull_ahead(device);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2010-05-10 22:42:23 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (drbd_suspended(device)) {
|
2012-03-29 23:04:14 +08: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 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
2012-03-29 23:04:14 +08:00
|
|
|
goto out;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
/* We fail READ/READA early, if we can not serve it.
|
|
|
|
* We must do this before req is registered on any lists.
|
2012-01-25 00:19:42 +08:00
|
|
|
* Otherwise, drbd_req_complete() will queue failed READ for retry. */
|
2012-03-29 23:04:14 +08:00
|
|
|
if (rw != WRITE) {
|
|
|
|
if (!do_remote_read(req) && !req->private_bio)
|
|
|
|
goto nodata;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-11-28 22:04:49 +08:00
|
|
|
/* which transfer log epoch does this belong to? */
|
2011-05-31 20:33:49 +08:00
|
|
|
req->epoch = atomic_read(&first_peer_device(device)->connection->current_tle_nr);
|
2010-05-27 21:07:43 +08:00
|
|
|
|
2012-07-31 15:31:11 +08:00
|
|
|
/* no point in adding empty flushes to the transfer log,
|
|
|
|
* they are mapped to drbd barriers already. */
|
2012-08-07 12:42:09 +08:00
|
|
|
if (likely(req->i.size!=0)) {
|
|
|
|
if (rw == WRITE)
|
2011-05-31 20:33:49 +08:00
|
|
|
first_peer_device(device)->connection->current_tle_writes++;
|
2010-05-27 21:07:43 +08:00
|
|
|
|
2011-05-31 20:33:49 +08:00
|
|
|
list_add_tail(&req->tl_requests, &first_peer_device(device)->connection->transfer_log);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
2010-10-27 18:21:30 +08:00
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (rw == WRITE) {
|
|
|
|
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 05:04:07 +08:00
|
|
|
} else
|
2012-03-29 23:04:14 +08:00
|
|
|
no_remote = true;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (req->private_bio) {
|
|
|
|
/* needs to be marked within the same spinlock */
|
|
|
|
_req_mod(req, TO_BE_SUBMITTED);
|
|
|
|
/* but we need to give up the spinlock to submit */
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2012-03-29 23:04:14 +08:00
|
|
|
drbd_submit_req_private_bio(req);
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2012-03-29 23:04:14 +08:00
|
|
|
} else if (no_remote) {
|
|
|
|
nodata:
|
|
|
|
if (__ratelimit(&drbd_ratelimit_state))
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_err(device, "IO ERROR: neither local nor remote data, sector %llu+%u\n",
|
2012-09-27 21:19:38 +08:00
|
|
|
(unsigned long long)req->i.sector, req->i.size >> 9);
|
2012-03-29 23:04:14 +08:00
|
|
|
/* A write may have been queued for send_oos, however.
|
2012-01-25 00:19:42 +08:00
|
|
|
* So we can not simply free it, we must go through drbd_req_put_completion_ref() */
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
out:
|
2012-01-25 00:19:42 +08:00
|
|
|
if (drbd_req_put_completion_ref(req, &m, 1))
|
|
|
|
kref_put(&req->kref, drbd_req_destroy);
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2012-03-29 23:04:14 +08:00
|
|
|
if (m.bio)
|
2011-07-03 19:26:43 +08:00
|
|
|
complete_master_bio(device, &m);
|
2013-03-20 01:16:50 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
void __drbd_make_request(struct drbd_device *device, struct bio *bio, unsigned long start_time)
|
2013-03-20 01:16:50 +08:00
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
struct drbd_request *req = drbd_request_prepare(device, bio, start_time);
|
2013-03-20 01:16:50 +08:00
|
|
|
if (IS_ERR_OR_NULL(req))
|
|
|
|
return;
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_send_and_submit(device, req);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static void submit_fast_path(struct drbd_device *device, struct list_head *incoming)
|
2013-03-23 08:14:40 +08:00
|
|
|
{
|
2013-03-20 01:16:56 +08:00
|
|
|
struct drbd_request *req, *tmp;
|
|
|
|
list_for_each_entry_safe(req, tmp, incoming, tl_requests) {
|
|
|
|
const int rw = bio_data_dir(req->master_bio);
|
2013-03-23 08:14:40 +08:00
|
|
|
|
2013-03-20 01:16:56 +08:00
|
|
|
if (rw == WRITE /* rw != WRITE should not even end up here! */
|
|
|
|
&& req->private_bio && req->i.size
|
2011-07-03 19:26:43 +08:00
|
|
|
&& !test_bit(AL_SUSPENDED, &device->flags)) {
|
|
|
|
if (!drbd_al_begin_io_fastpath(device, &req->i))
|
2013-03-20 01:16:56 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_del_init(&req->tl_requests);
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_send_and_submit(device, req);
|
2013-03-23 08:14:40 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
static bool prepare_al_transaction_nonblock(struct drbd_device *device,
|
2013-03-20 01:16:56 +08:00
|
|
|
struct list_head *incoming,
|
|
|
|
struct list_head *pending)
|
|
|
|
{
|
|
|
|
struct drbd_request *req, *tmp;
|
|
|
|
int wake = 0;
|
|
|
|
int err;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
spin_lock_irq(&device->al_lock);
|
2013-03-20 01:16:56 +08:00
|
|
|
list_for_each_entry_safe(req, tmp, incoming, tl_requests) {
|
2011-07-03 19:26:43 +08:00
|
|
|
err = drbd_al_begin_io_nonblock(device, &req->i);
|
2013-03-20 01:16:56 +08:00
|
|
|
if (err == -EBUSY)
|
|
|
|
wake = 1;
|
|
|
|
if (err)
|
|
|
|
continue;
|
|
|
|
req->rq_state |= RQ_IN_ACT_LOG;
|
|
|
|
list_move_tail(&req->tl_requests, pending);
|
|
|
|
}
|
2011-07-03 19:26:43 +08:00
|
|
|
spin_unlock_irq(&device->al_lock);
|
2013-03-20 01:16:56 +08:00
|
|
|
if (wake)
|
2011-07-03 19:26:43 +08:00
|
|
|
wake_up(&device->al_wait);
|
2013-03-20 01:16:56 +08:00
|
|
|
|
|
|
|
return !list_empty(pending);
|
|
|
|
}
|
2013-03-23 08:14:40 +08:00
|
|
|
|
|
|
|
void do_submit(struct work_struct *ws)
|
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
struct drbd_device *device = container_of(ws, struct drbd_device, submit.worker);
|
2013-03-20 01:16:56 +08:00
|
|
|
LIST_HEAD(incoming);
|
|
|
|
LIST_HEAD(pending);
|
2013-03-23 08:14:40 +08:00
|
|
|
struct drbd_request *req, *tmp;
|
|
|
|
|
2013-03-20 01:16:56 +08:00
|
|
|
for (;;) {
|
2011-07-03 19:26:43 +08:00
|
|
|
spin_lock(&device->submit.lock);
|
|
|
|
list_splice_tail_init(&device->submit.writes, &incoming);
|
|
|
|
spin_unlock(&device->submit.lock);
|
2013-03-23 08:14:40 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
submit_fast_path(device, &incoming);
|
2013-03-20 01:16:56 +08:00
|
|
|
if (list_empty(&incoming))
|
|
|
|
break;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
wait_event(device->al_wait, prepare_al_transaction_nonblock(device, &incoming, &pending));
|
2013-03-20 01:16:58 +08:00
|
|
|
/* Maybe more was queued, while we prepared the transaction?
|
|
|
|
* Try to stuff them into this transaction as well.
|
|
|
|
* Be strictly non-blocking here, no wait_event, we already
|
|
|
|
* have something to commit.
|
|
|
|
* Stop if we don't make any more progres.
|
|
|
|
*/
|
|
|
|
for (;;) {
|
|
|
|
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 19:26:43 +08:00
|
|
|
if (list_empty(&device->submit.writes))
|
2013-03-20 01:16:58 +08:00
|
|
|
break;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
spin_lock(&device->submit.lock);
|
|
|
|
list_splice_tail_init(&device->submit.writes, &more_incoming);
|
|
|
|
spin_unlock(&device->submit.lock);
|
2013-03-20 01:16:58 +08:00
|
|
|
|
|
|
|
if (list_empty(&more_incoming))
|
|
|
|
break;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
made_progress = prepare_al_transaction_nonblock(device, &more_incoming, &more_pending);
|
2013-03-20 01:16:58 +08:00
|
|
|
|
|
|
|
list_splice_tail_init(&more_pending, &pending);
|
|
|
|
list_splice_tail_init(&more_incoming, &incoming);
|
|
|
|
|
|
|
|
if (!made_progress)
|
|
|
|
break;
|
|
|
|
}
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_al_begin_io_commit(device, false);
|
2013-03-20 01:16:56 +08:00
|
|
|
|
|
|
|
list_for_each_entry_safe(req, tmp, &pending, tl_requests) {
|
|
|
|
list_del_init(&req->tl_requests);
|
2011-07-03 19:26:43 +08:00
|
|
|
drbd_send_and_submit(device, req);
|
2013-03-20 01:16:56 +08:00
|
|
|
}
|
2013-03-23 08:14:40 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-12 18:12:01 +08:00
|
|
|
void drbd_make_request(struct request_queue *q, struct bio *bio)
|
2009-09-26 07:07:19 +08:00
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
struct drbd_device *device = (struct drbd_device *) q->queuedata;
|
2010-11-10 00:45:06 +08:00
|
|
|
unsigned long start_time;
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2010-11-10 00:45:06 +08:00
|
|
|
start_time = jiffies;
|
|
|
|
|
2009-09-26 07:07:19 +08:00
|
|
|
/*
|
|
|
|
* what we "blindly" assume:
|
|
|
|
*/
|
2011-06-27 22:23:33 +08:00
|
|
|
D_ASSERT(device, IS_ALIGNED(bio->bi_iter.bi_size, 512));
|
2009-09-26 07:07:19 +08:00
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
inc_ap_bio(device);
|
|
|
|
__drbd_make_request(device, bio, start_time);
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
|
2011-03-31 22:36:43 +08:00
|
|
|
/* This is called by bio_add_page().
|
|
|
|
*
|
|
|
|
* q->max_hw_sectors and other global limits are already enforced there.
|
2009-09-26 07:07:19 +08:00
|
|
|
*
|
2011-03-31 22:36:43 +08:00
|
|
|
* We need to call down to our lower level device,
|
|
|
|
* in case it has special restrictions.
|
|
|
|
*
|
|
|
|
* We also may need to enforce configured max-bio-bvecs limits.
|
2009-09-26 07:07:19 +08:00
|
|
|
*
|
|
|
|
* As long as the BIO is empty we have to allow at least one bvec,
|
2011-03-31 22:36:43 +08:00
|
|
|
* regardless of size and offset, so no need to ask lower levels.
|
2009-09-26 07:07:19 +08:00
|
|
|
*/
|
|
|
|
int drbd_merge_bvec(struct request_queue *q, struct bvec_merge_data *bvm, struct bio_vec *bvec)
|
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
struct drbd_device *device = (struct drbd_device *) q->queuedata;
|
2009-09-26 07:07:19 +08:00
|
|
|
unsigned int bio_size = bvm->bi_size;
|
2011-03-31 22:36:43 +08:00
|
|
|
int limit = DRBD_MAX_BIO_SIZE;
|
|
|
|
int backing_limit;
|
|
|
|
|
2011-07-03 19:26:43 +08:00
|
|
|
if (bio_size && get_ldev(device)) {
|
2013-10-23 16:59:19 +08:00
|
|
|
unsigned int max_hw_sectors = queue_max_hw_sectors(q);
|
2009-09-26 07:07:19 +08:00
|
|
|
struct request_queue * const b =
|
2011-07-03 19:26:43 +08:00
|
|
|
device->ldev->backing_bdev->bd_disk->queue;
|
2010-05-15 01:16:41 +08:00
|
|
|
if (b->merge_bvec_fn) {
|
2009-09-26 07:07:19 +08:00
|
|
|
backing_limit = b->merge_bvec_fn(b, bvm, bvec);
|
|
|
|
limit = min(limit, backing_limit);
|
|
|
|
}
|
2011-07-03 19:26:43 +08:00
|
|
|
put_ldev(device);
|
2013-10-23 16:59:19 +08:00
|
|
|
if ((limit >> 9) > max_hw_sectors)
|
|
|
|
limit = max_hw_sectors << 9;
|
2009-09-26 07:07:19 +08:00
|
|
|
}
|
|
|
|
return limit;
|
|
|
|
}
|
2011-03-01 18:08:28 +08:00
|
|
|
|
2011-05-30 22:32:41 +08:00
|
|
|
static struct drbd_request *find_oldest_request(struct drbd_connection *connection)
|
2011-11-28 22:04:49 +08:00
|
|
|
{
|
|
|
|
/* Walk the transfer log,
|
|
|
|
* and find the oldest not yet completed request */
|
|
|
|
struct drbd_request *r;
|
2011-05-30 22:32:41 +08:00
|
|
|
list_for_each_entry(r, &connection->transfer_log, tl_requests) {
|
2012-01-24 23:58:11 +08:00
|
|
|
if (atomic_read(&r->completion_ref))
|
2011-11-28 22:04:49 +08:00
|
|
|
return r;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2011-03-01 18:08:28 +08:00
|
|
|
void request_timer_fn(unsigned long data)
|
|
|
|
{
|
2011-07-03 19:26:43 +08:00
|
|
|
struct drbd_device *device = (struct drbd_device *) data;
|
2011-05-31 20:33:49 +08:00
|
|
|
struct drbd_connection *connection = first_peer_device(device)->connection;
|
2011-03-01 18:08:28 +08:00
|
|
|
struct drbd_request *req; /* oldest request */
|
2011-04-19 23:10:19 +08:00
|
|
|
struct net_conf *nc;
|
2011-06-29 20:06:08 +08:00
|
|
|
unsigned long ent = 0, dt = 0, et, nt; /* effective timeout = ko_count * timeout */
|
2012-04-25 17:46:14 +08:00
|
|
|
unsigned long now;
|
2011-03-01 18:08:28 +08:00
|
|
|
|
2011-04-19 23:10:19 +08:00
|
|
|
rcu_read_lock();
|
2011-05-30 22:32:41 +08:00
|
|
|
nc = rcu_dereference(connection->net_conf);
|
2011-07-03 19:26:43 +08:00
|
|
|
if (nc && device->state.conn >= C_WF_REPORT_PARAMS)
|
2012-05-07 17:53:08 +08:00
|
|
|
ent = nc->timeout * HZ/10 * nc->ko_count;
|
2011-07-05 21:38:59 +08:00
|
|
|
|
2011-07-03 19:26:43 +08: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 20:06:08 +08:00
|
|
|
}
|
2011-04-19 23:10:19 +08:00
|
|
|
rcu_read_unlock();
|
2011-03-01 18:08:28 +08:00
|
|
|
|
2011-06-29 20:06:08 +08:00
|
|
|
et = min_not_zero(dt, ent);
|
|
|
|
|
2012-04-25 17:46:14 +08:00
|
|
|
if (!et)
|
2011-03-01 18:08:28 +08:00
|
|
|
return; /* Recurring timer stopped */
|
|
|
|
|
2012-04-25 17:46:14 +08:00
|
|
|
now = jiffies;
|
|
|
|
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_lock_irq(&device->resource->req_lock);
|
2011-05-30 22:32:41 +08:00
|
|
|
req = find_oldest_request(connection);
|
2011-11-28 22:04:49 +08:00
|
|
|
if (!req) {
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_unlock_irq(&device->resource->req_lock);
|
2011-07-03 19:26:43 +08:00
|
|
|
mod_timer(&device->request_timer, now + et);
|
2011-03-01 18:08:28 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2012-04-25 17:46:14 +08:00
|
|
|
/* The request is considered timed out, if
|
|
|
|
* - we have some effective timeout from the configuration,
|
|
|
|
* with above 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.
|
|
|
|
*/
|
|
|
|
if (ent && req->rq_state & RQ_NET_PENDING &&
|
|
|
|
time_after(now, req->start_time + ent) &&
|
2011-05-30 22:32:41 +08:00
|
|
|
!time_in_range(now, connection->last_reconnect_jif, connection->last_reconnect_jif + ent)) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_warn(device, "Remote failed to finish a request within ko-count * timeout\n");
|
2011-07-03 19:26:43 +08:00
|
|
|
_drbd_set_state(_NS(device, conn, C_TIMEOUT), CS_VERBOSE | CS_HARD, NULL);
|
2011-03-01 18:08:28 +08:00
|
|
|
}
|
2011-07-28 21:27:51 +08:00
|
|
|
if (dt && req->rq_state & RQ_LOCAL_PENDING && req->device == device &&
|
2012-04-25 17:46:14 +08:00
|
|
|
time_after(now, req->start_time + dt) &&
|
2011-07-03 19:26:43 +08:00
|
|
|
!time_in_range(now, device->last_reattach_jif, device->last_reattach_jif + dt)) {
|
2011-07-03 23:53:52 +08:00
|
|
|
drbd_warn(device, "Local backing device failed to meet the disk-timeout\n");
|
2011-07-03 19:26:43 +08:00
|
|
|
__drbd_chk_io_error(device, DRBD_FORCE_DETACH);
|
2011-06-29 20:06:08 +08:00
|
|
|
}
|
2012-04-25 17:46:14 +08:00
|
|
|
nt = (time_after(now, req->start_time + et) ? now : req->start_time) + et;
|
2011-07-07 20:19:42 +08:00
|
|
|
spin_unlock_irq(&connection->resource->req_lock);
|
2011-07-03 19:26:43 +08:00
|
|
|
mod_timer(&device->request_timer, nt);
|
2011-03-01 18:08:28 +08:00
|
|
|
}
|