2019-04-30 11:42:43 -07:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2008-09-14 05:55:09 -07:00
|
|
|
/*
|
|
|
|
* Functions related to generic timeout handling of requests.
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/blkdev.h>
|
2008-09-14 05:56:33 -07:00
|
|
|
#include <linux/fault-inject.h>
|
2008-09-14 05:55:09 -07:00
|
|
|
|
|
|
|
#include "blk.h"
|
2014-09-22 09:21:48 -07:00
|
|
|
#include "blk-mq.h"
|
2008-09-14 05:55:09 -07:00
|
|
|
|
2008-09-14 05:56:33 -07:00
|
|
|
#ifdef CONFIG_FAIL_IO_TIMEOUT
|
|
|
|
|
|
|
|
static DECLARE_FAULT_ATTR(fail_io_timeout);
|
|
|
|
|
|
|
|
static int __init setup_fail_io_timeout(char *str)
|
|
|
|
{
|
|
|
|
return setup_fault_attr(&fail_io_timeout, str);
|
|
|
|
}
|
|
|
|
__setup("fail_io_timeout=", setup_fail_io_timeout);
|
|
|
|
|
2020-06-10 23:44:47 -07:00
|
|
|
bool __blk_should_fake_timeout(struct request_queue *q)
|
2008-09-14 05:56:33 -07:00
|
|
|
{
|
|
|
|
return should_fail(&fail_io_timeout, 1);
|
|
|
|
}
|
2020-06-10 23:44:47 -07:00
|
|
|
EXPORT_SYMBOL_GPL(__blk_should_fake_timeout);
|
2008-09-14 05:56:33 -07:00
|
|
|
|
|
|
|
static int __init fail_io_timeout_debugfs(void)
|
|
|
|
{
|
2011-08-03 16:21:01 -07:00
|
|
|
struct dentry *dir = fault_create_debugfs_attr("fail_io_timeout",
|
|
|
|
NULL, &fail_io_timeout);
|
|
|
|
|
2013-11-06 00:55:44 -07:00
|
|
|
return PTR_ERR_OR_ZERO(dir);
|
2008-09-14 05:56:33 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
late_initcall(fail_io_timeout_debugfs);
|
|
|
|
|
|
|
|
ssize_t part_timeout_show(struct device *dev, struct device_attribute *attr,
|
|
|
|
char *buf)
|
|
|
|
{
|
|
|
|
struct gendisk *disk = dev_to_disk(dev);
|
|
|
|
int set = test_bit(QUEUE_FLAG_FAIL_IO, &disk->queue->queue_flags);
|
|
|
|
|
|
|
|
return sprintf(buf, "%d\n", set != 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t part_timeout_store(struct device *dev, struct device_attribute *attr,
|
|
|
|
const char *buf, size_t count)
|
|
|
|
{
|
|
|
|
struct gendisk *disk = dev_to_disk(dev);
|
|
|
|
int val;
|
|
|
|
|
|
|
|
if (count) {
|
|
|
|
struct request_queue *q = disk->queue;
|
|
|
|
char *p = (char *) buf;
|
|
|
|
|
|
|
|
val = simple_strtoul(p, &p, 10);
|
|
|
|
if (val)
|
2018-03-07 18:10:04 -07:00
|
|
|
blk_queue_flag_set(QUEUE_FLAG_FAIL_IO, q);
|
2008-09-14 05:56:33 -07:00
|
|
|
else
|
2018-03-07 18:10:04 -07:00
|
|
|
blk_queue_flag_clear(QUEUE_FLAG_FAIL_IO, q);
|
2008-09-14 05:56:33 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_FAIL_IO_TIMEOUT */
|
|
|
|
|
2008-09-14 05:55:09 -07:00
|
|
|
/**
|
2020-07-30 18:42:33 -07:00
|
|
|
* blk_abort_request - Request recovery for the specified command
|
2008-09-14 05:55:09 -07:00
|
|
|
* @req: pointer to the request of interest
|
|
|
|
*
|
|
|
|
* This function requests that the block layer start recovery for the
|
|
|
|
* request by deleting the timer and calling the q's timeout function.
|
|
|
|
* LLDDs who implement their own error recovery MAY ignore the timeout
|
2018-11-14 09:02:06 -07:00
|
|
|
* event if they generated blk_abort_request.
|
2008-09-14 05:55:09 -07:00
|
|
|
*/
|
|
|
|
void blk_abort_request(struct request *req)
|
|
|
|
{
|
2018-10-29 09:25:07 -07:00
|
|
|
/*
|
|
|
|
* All we need to ensure is that timeout scan takes place
|
|
|
|
* immediately and that scan sees the new timeout value.
|
|
|
|
* No need for fancy synchronizations.
|
|
|
|
*/
|
2018-11-14 09:02:05 -07:00
|
|
|
WRITE_ONCE(req->deadline, jiffies);
|
2018-10-29 09:25:07 -07:00
|
|
|
kblockd_schedule_work(&req->q->timeout_work);
|
2008-09-14 05:55:09 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_abort_request);
|
|
|
|
|
2020-07-13 14:48:16 -07:00
|
|
|
static unsigned long blk_timeout_mask __read_mostly;
|
|
|
|
|
2020-07-17 03:00:02 -07:00
|
|
|
static int __init blk_timeout_init(void)
|
2020-07-13 14:48:16 -07:00
|
|
|
{
|
|
|
|
blk_timeout_mask = roundup_pow_of_two(HZ) - 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
late_initcall(blk_timeout_init);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Just a rough estimate, we don't care about specific values for timeouts.
|
|
|
|
*/
|
|
|
|
static inline unsigned long blk_round_jiffies(unsigned long j)
|
|
|
|
{
|
|
|
|
return (j + blk_timeout_mask) + 1;
|
|
|
|
}
|
|
|
|
|
2014-05-13 14:10:52 -07:00
|
|
|
unsigned long blk_rq_timeout(unsigned long timeout)
|
|
|
|
{
|
|
|
|
unsigned long maxt;
|
|
|
|
|
2020-07-13 14:48:16 -07:00
|
|
|
maxt = blk_round_jiffies(jiffies + BLK_MAX_TIMEOUT);
|
2014-05-13 14:10:52 -07:00
|
|
|
if (time_after(timeout, maxt))
|
|
|
|
timeout = maxt;
|
|
|
|
|
|
|
|
return timeout;
|
|
|
|
}
|
|
|
|
|
2014-04-25 05:14:48 -07:00
|
|
|
/**
|
|
|
|
* blk_add_timer - Start timeout timer for a single request
|
|
|
|
* @req: request that is about to start running.
|
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* Each request has its own timer, and as it is added to the queue, we
|
|
|
|
* set up the timer. When the request completes, we cancel the timer.
|
|
|
|
*/
|
|
|
|
void blk_add_timer(struct request *req)
|
2008-09-14 05:55:09 -07:00
|
|
|
{
|
|
|
|
struct request_queue *q = req->q;
|
|
|
|
unsigned long expiry;
|
|
|
|
|
2009-04-22 19:05:18 -07:00
|
|
|
/*
|
|
|
|
* Some LLDs, like scsi, peek at the timeout to prevent a
|
|
|
|
* command from being retried forever.
|
|
|
|
*/
|
|
|
|
if (!req->timeout)
|
2008-09-14 05:55:09 -07:00
|
|
|
req->timeout = q->rq_timeout;
|
2009-04-22 19:05:18 -07:00
|
|
|
|
2018-06-22 13:18:09 -07:00
|
|
|
req->rq_flags &= ~RQF_TIMED_OUT;
|
2018-11-14 09:02:05 -07:00
|
|
|
|
|
|
|
expiry = jiffies + req->timeout;
|
|
|
|
WRITE_ONCE(req->deadline, expiry);
|
2015-11-24 15:58:53 -07:00
|
|
|
|
2008-09-14 05:55:09 -07:00
|
|
|
/*
|
|
|
|
* If the timer isn't already pending or this timeout is earlier
|
2008-11-06 00:42:49 -07:00
|
|
|
* than an existing one, modify the timer. Round up to next nearest
|
2008-09-14 05:55:09 -07:00
|
|
|
* second.
|
|
|
|
*/
|
2020-07-13 14:48:16 -07:00
|
|
|
expiry = blk_rq_timeout(blk_round_jiffies(expiry));
|
2008-09-14 05:55:09 -07:00
|
|
|
|
|
|
|
if (!timer_pending(&q->timeout) ||
|
2014-04-16 10:36:54 -07:00
|
|
|
time_before(expiry, q->timeout.expires)) {
|
|
|
|
unsigned long diff = q->timeout.expires - expiry;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Due to added timer slack to group timers, the timer
|
|
|
|
* will often be a little in front of what we asked for.
|
|
|
|
* So apply some tolerance here too, otherwise we keep
|
|
|
|
* modifying the timer because expires for value X
|
|
|
|
* will be X + something.
|
|
|
|
*/
|
2014-05-30 14:41:39 -07:00
|
|
|
if (!timer_pending(&q->timeout) || (diff >= HZ / 2))
|
2014-04-16 10:36:54 -07:00
|
|
|
mod_timer(&q->timeout, expiry);
|
|
|
|
}
|
blk-mq: new multi-queue block IO queueing mechanism
Linux currently has two models for block devices:
- The classic request_fn based approach, where drivers use struct
request units for IO. The block layer provides various helper
functionalities to let drivers share code, things like tag
management, timeout handling, queueing, etc.
- The "stacked" approach, where a driver squeezes in between the
block layer and IO submitter. Since this bypasses the IO stack,
driver generally have to manage everything themselves.
With drivers being written for new high IOPS devices, the classic
request_fn based driver doesn't work well enough. The design dates
back to when both SMP and high IOPS was rare. It has problems with
scaling to bigger machines, and runs into scaling issues even on
smaller machines when you have IOPS in the hundreds of thousands
per device.
The stacked approach is then most often selected as the model
for the driver. But this means that everybody has to re-invent
everything, and along with that we get all the problems again
that the shared approach solved.
This commit introduces blk-mq, block multi queue support. The
design is centered around per-cpu queues for queueing IO, which
then funnel down into x number of hardware submission queues.
We might have a 1:1 mapping between the two, or it might be
an N:M mapping. That all depends on what the hardware supports.
blk-mq provides various helper functions, which include:
- Scalable support for request tagging. Most devices need to
be able to uniquely identify a request both in the driver and
to the hardware. The tagging uses per-cpu caches for freed
tags, to enable cache hot reuse.
- Timeout handling without tracking request on a per-device
basis. Basically the driver should be able to get a notification,
if a request happens to fail.
- Optional support for non 1:1 mappings between issue and
submission queues. blk-mq can redirect IO completions to the
desired location.
- Support for per-request payloads. Drivers almost always need
to associate a request structure with some driver private
command structure. Drivers can tell blk-mq this at init time,
and then any request handed to the driver will have the
required size of memory associated with it.
- Support for merging of IO, and plugging. The stacked model
gets neither of these. Even for high IOPS devices, merging
sequential IO reduces per-command overhead and thus
increases bandwidth.
For now, this is provided as a potential 3rd queueing model, with
the hope being that, as it matures, it can replace both the classic
and stacked model. That would get us back to having just 1 real
model for block devices, leaving the stacked approach to dm/md
devices (as it was originally intended).
Contributions in this patch from the following people:
Shaohua Li <shli@fusionio.com>
Alexander Gordeev <agordeev@redhat.com>
Christoph Hellwig <hch@infradead.org>
Mike Christie <michaelc@cs.wisc.edu>
Matias Bjorling <m@bjorling.me>
Jeff Moyer <jmoyer@redhat.com>
Acked-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2013-10-24 01:20:05 -07:00
|
|
|
|
|
|
|
}
|